2 * Copyright 2013 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.
17 #include "folly/Range.h"
18 #include "folly/Benchmark.h"
19 #include "folly/Foreach.h"
24 using namespace folly;
31 void initStr(int len) {
32 cout << "string length " << len << ':' << endl;
39 } // anonymous namespace
41 BENCHMARK(FindSingleCharMemchr, n) {
42 StringPiece haystack(str);
43 FOR_EACH_RANGE (i, 0, n) {
44 doNotOptimizeAway(haystack.find('b'));
46 doNotOptimizeAway(&x);
50 BENCHMARK_RELATIVE(FindSingleCharRange, n) {
52 StringPiece haystack(str);
53 folly::StringPiece needle(&c, &c + 1);
54 FOR_EACH_RANGE (i, 0, n) {
55 doNotOptimizeAway(haystack.find(needle));
57 doNotOptimizeAway(&x);
61 BENCHMARK_DRAW_LINE();
63 BENCHMARK(FindFirstOfRange, n) {
64 StringPiece haystack(str);
65 folly::StringPiece needles("bc");
66 DCHECK_EQ(haystack.size() - 1, haystack.find_first_of(needles)); // it works!
67 FOR_EACH_RANGE (i, 0, n) {
68 doNotOptimizeAway(haystack.find_first_of(needles));
70 doNotOptimizeAway(&x);
74 BENCHMARK(FindFirstOfOffsetRange, n) {
75 StringPiece haystack(str);
76 folly::StringPiece needles("bc");
77 DCHECK_EQ(haystack.size() - 1, haystack.find_first_of(needles, 1)); // works!
78 FOR_EACH_RANGE (i, 0, n) {
79 size_t pos = i % 2; // not a constant to prevent optimization
80 doNotOptimizeAway(haystack.find_first_of(needles, pos));
82 doNotOptimizeAway(&x);
86 int main(int argc, char** argv) {
87 google::ParseCommandLineFlags(&argc, &argv, true);
89 for (int len : {1, 10, 256, 10*1024, 10*1024*1024}) {