2 * Copyright 2017 Facebook, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 #include <folly/Benchmark.h>
20 #include <folly/io/Cursor.h>
21 #include <folly/io/IOBuf.h>
22 #include <folly/portability/GFlags.h>
25 using std::unique_ptr;
26 using namespace folly::io;
32 BENCHMARK(reserveBenchmark, iters) {
34 unique_ptr<IOBuf> iobuf1(IOBuf::create(buf_size));
35 iobuf1->append(buf_size);
36 for (size_t bufs = num_bufs; bufs > 1; bufs --) {
37 iobuf1->reserve(0, buf_size);
38 iobuf1->append(buf_size);
43 BENCHMARK(chainBenchmark, iters) {
45 unique_ptr<IOBuf> iobuf1(IOBuf::create(buf_size));
46 iobuf1->append(buf_size);
47 for (size_t bufs = num_bufs; bufs > 1; bufs --) {
48 unique_ptr<IOBuf> iobufNext(IOBuf::create(buf_size));
49 iobuf1->prependChain(std::move(iobufNext));
54 vector<unique_ptr<IOBuf>> bufPool;
55 inline unique_ptr<IOBuf> poolGetIOBuf() {
56 if (bufPool.size() > 0) {
57 unique_ptr<IOBuf> ret = std::move(bufPool.back());
61 unique_ptr<IOBuf> iobuf(IOBuf::create(buf_size));
62 iobuf->append(buf_size);
67 inline void poolPutIOBuf(unique_ptr<IOBuf>&& buf) {
68 unique_ptr<IOBuf> head = std::move(buf);
70 unique_ptr<IOBuf> next = head->pop();
71 bufPool.push_back(std::move(head));
72 head = std::move(next);
76 BENCHMARK(poolBenchmark, iters) {
78 unique_ptr<IOBuf> head = poolGetIOBuf();
79 for (size_t bufs = num_bufs; bufs > 1; bufs --) {
80 unique_ptr<IOBuf> iobufNext = poolGetIOBuf();
81 head->prependChain(std::move(iobufNext));
84 poolPutIOBuf(std::move(head));
88 void setNumbers(size_t size, size_t num) {
93 printf("\nBuffer size: %zu, number of buffers: %zu\n\n", size, num);
97 ------------------------------------------------------------------------------
98 reserveBenchmark 100000 9.186 ms 91.86 ns 10.38 M
99 chainBenchmark 100000 59.44 ms 594.4 ns 1.604 M
100 poolBenchmark 100000 15.87 ms 158.7 ns 6.01 M
102 Buffer size: 100, number of buffers: 10
104 Benchmark Iters Total t t/iter iter/sec
105 ------------------------------------------------------------------------------
106 reserveBenchmark 100000 62 ms 620 ns 1.538 M
107 chainBenchmark 100000 59.48 ms 594.8 ns 1.603 M
108 poolBenchmark 100000 16.07 ms 160.7 ns 5.933 M
110 Buffer size: 2048, number of buffers: 10
112 Benchmark Iters Total t t/iter iter/sec
113 ------------------------------------------------------------------------------
114 reserveBenchmark 100000 148.4 ms 1.484 us 658.2 k
115 chainBenchmark 100000 140.9 ms 1.409 us 693 k
116 poolBenchmark 100000 16.73 ms 167.3 ns 5.7 M
118 Buffer size: 10000, number of buffers: 10
120 Benchmark Iters Total t t/iter iter/sec
121 ------------------------------------------------------------------------------
122 reserveBenchmark 100000 234 ms 2.34 us 417.3 k
123 chainBenchmark 100000 142.3 ms 1.423 us 686.1 k
124 poolBenchmark 100000 16.78 ms 167.8 ns 5.684 M
126 Buffer size: 100000, number of buffers: 10
128 Benchmark Iters Total t t/iter iter/sec
129 ------------------------------------------------------------------------------
130 reserveBenchmark 100000 186.5 ms 1.865 us 523.5 k
131 chainBenchmark 100000 360.5 ms 3.605 us 270.9 k
132 poolBenchmark 100000 16.52 ms 165.2 ns 5.772 M
134 Buffer size: 1000000, number of buffers: 10
136 Benchmark Iters Total t t/iter iter/sec
137 ------------------------------------------------------------------------------
138 reserveBenchmark 156 2.084 s 13.36 ms 74.84
139 chainBenchmark 30082 2.001 s 66.5 us 14.68 k
140 poolBenchmark 100000 18.18 ms 181.8 ns 5.244 M
143 Buffer size: 10, number of buffers: 20
145 Benchmark Iters Total t t/iter iter/sec
146 ------------------------------------------------------------------------------
147 reserveBenchmark 100000 12.54 ms 125.4 ns 7.603 M
148 chainBenchmark 100000 118.6 ms 1.186 us 823.2 k
149 poolBenchmark 100000 32.2 ms 322 ns 2.962 M
151 int main(int argc, char** argv) {
152 gflags::ParseCommandLineFlags(&argc, &argv, true);
155 folly::runBenchmarks();
157 folly::runBenchmarks();
158 setNumbers(2048, 10);
159 folly::runBenchmarks();
160 setNumbers(10000, 10);
161 folly::runBenchmarks();
162 setNumbers(100000, 10);
163 folly::runBenchmarks();
164 setNumbers(1000000, 10);
165 folly::runBenchmarks();
168 folly::runBenchmarks();