blob: 89dfa580e6b0523ece3886a854e6d8d30e9d8ef0 [file] [log] [blame]
Eric Fiselierb08d8b12016-07-19 23:07:03 +00001#undef NDEBUG
Eric Fiselierfbc9ff22016-11-05 00:30:27 +00002#include <algorithm>
3#include <cassert>
4#include <cmath>
5#include <cstdlib>
6#include <vector>
Eric Fiselierb08d8b12016-07-19 23:07:03 +00007#include "benchmark/benchmark.h"
Eric Fiselier4d5e91d2016-08-29 19:12:01 +00008#include "output_test.h"
Eric Fiselierb08d8b12016-07-19 23:07:03 +00009
10namespace {
11
Eric Fiselierb08d8b12016-07-19 23:07:03 +000012#define ADD_COMPLEXITY_CASES(...) \
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000013 int CONCAT(dummy, __LINE__) = AddComplexityTest(__VA_ARGS__)
Eric Fiselierb08d8b12016-07-19 23:07:03 +000014
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000015int AddComplexityTest(std::string big_o_test_name, std::string rms_test_name,
16 std::string big_o) {
17 SetSubstitutions({{"%bigo_name", big_o_test_name},
18 {"%rms_name", rms_test_name},
19 {"%bigo_str", "[ ]* %float " + big_o},
20 {"%bigo", big_o},
21 {"%rms", "[ ]*[0-9]+ %"}});
22 AddCases(
23 TC_ConsoleOut,
24 {{"^%bigo_name %bigo_str %bigo_str[ ]*$"},
25 {"^%bigo_name", MR_Not}, // Assert we we didn't only matched a name.
26 {"^%rms_name %rms %rms[ ]*$", MR_Next}});
27 AddCases(TC_JSONOut, {{"\"name\": \"%bigo_name\",$"},
Eric Fiselier19039762018-01-18 04:23:01 +000028 {"\"cpu_coefficient\": %float,$", MR_Next},
29 {"\"real_coefficient\": %float,$", MR_Next},
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000030 {"\"big_o\": \"%bigo\",$", MR_Next},
31 {"\"time_unit\": \"ns\"$", MR_Next},
32 {"}", MR_Next},
33 {"\"name\": \"%rms_name\",$"},
34 {"\"rms\": %float$", MR_Next},
35 {"}", MR_Next}});
36 AddCases(TC_CSVOut, {{"^\"%bigo_name\",,%float,%float,%bigo,,,,,$"},
37 {"^\"%bigo_name\"", MR_Not},
38 {"^\"%rms_name\",,%float,%float,,,,,,$", MR_Next}});
Eric Fiselierb08d8b12016-07-19 23:07:03 +000039 return 0;
40}
41
42} // end namespace
43
44// ========================================================================= //
45// --------------------------- Testing BigO O(1) --------------------------- //
46// ========================================================================= //
47
48void BM_Complexity_O1(benchmark::State& state) {
Eric Fiselier19039762018-01-18 04:23:01 +000049 for (auto _ : state) {
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000050 for (int i = 0; i < 1024; ++i) {
51 benchmark::DoNotOptimize(&i);
52 }
Eric Fiselierb08d8b12016-07-19 23:07:03 +000053 }
Eric Fiselierf6e09e52016-08-09 18:56:48 +000054 state.SetComplexityN(state.range(0));
Eric Fiselierb08d8b12016-07-19 23:07:03 +000055}
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000056BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
57BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
58BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int) {
59 return 1.0;
60});
Eric Fiselierb08d8b12016-07-19 23:07:03 +000061
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000062const char *big_o_1_test_name = "BM_Complexity_O1_BigO";
63const char *rms_o_1_test_name = "BM_Complexity_O1_RMS";
64const char *enum_big_o_1 = "\\([0-9]+\\)";
65// FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto
66// deduced.
Eric Fiselier4d5e91d2016-08-29 19:12:01 +000067// See https://github.com/google/benchmark/issues/272
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000068const char *auto_big_o_1 = "(\\([0-9]+\\))|(lgN)";
69const char *lambda_big_o_1 = "f\\(N\\)";
Eric Fiselierb08d8b12016-07-19 23:07:03 +000070
71// Add enum tests
Eric Fiselier4d5e91d2016-08-29 19:12:01 +000072ADD_COMPLEXITY_CASES(big_o_1_test_name, rms_o_1_test_name, enum_big_o_1);
Eric Fiselierb08d8b12016-07-19 23:07:03 +000073
Eric Fiselierf6e09e52016-08-09 18:56:48 +000074// Add auto enum tests
Eric Fiselier4d5e91d2016-08-29 19:12:01 +000075ADD_COMPLEXITY_CASES(big_o_1_test_name, rms_o_1_test_name, auto_big_o_1);
Eric Fiselierf6e09e52016-08-09 18:56:48 +000076
Eric Fiselierb08d8b12016-07-19 23:07:03 +000077// Add lambda tests
Eric Fiselier4d5e91d2016-08-29 19:12:01 +000078ADD_COMPLEXITY_CASES(big_o_1_test_name, rms_o_1_test_name, lambda_big_o_1);
Eric Fiselierb08d8b12016-07-19 23:07:03 +000079
80// ========================================================================= //
81// --------------------------- Testing BigO O(N) --------------------------- //
82// ========================================================================= //
83
84std::vector<int> ConstructRandomVector(int size) {
85 std::vector<int> v;
86 v.reserve(size);
87 for (int i = 0; i < size; ++i) {
Eric Fiselier4d5e91d2016-08-29 19:12:01 +000088 v.push_back(std::rand() % size);
Eric Fiselierb08d8b12016-07-19 23:07:03 +000089 }
90 return v;
91}
92
93void BM_Complexity_O_N(benchmark::State& state) {
Eric Fiselierf6e09e52016-08-09 18:56:48 +000094 auto v = ConstructRandomVector(state.range(0));
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000095 const int item_not_in_vector =
96 state.range(0) * 2; // Test worst case scenario (item not in vector)
Eric Fiselier19039762018-01-18 04:23:01 +000097 for (auto _ : state) {
Eric Fiselierfbc9ff22016-11-05 00:30:27 +000098 benchmark::DoNotOptimize(std::find(v.begin(), v.end(), item_not_in_vector));
Eric Fiselierb08d8b12016-07-19 23:07:03 +000099 }
Eric Fiselierf6e09e52016-08-09 18:56:48 +0000100 state.SetComplexityN(state.range(0));
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000101}
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000102BENCHMARK(BM_Complexity_O_N)
103 ->RangeMultiplier(2)
104 ->Range(1 << 10, 1 << 16)
105 ->Complexity(benchmark::oN);
106BENCHMARK(BM_Complexity_O_N)
107 ->RangeMultiplier(2)
108 ->Range(1 << 10, 1 << 16)
109 ->Complexity([](int n) -> double { return n; });
110BENCHMARK(BM_Complexity_O_N)
111 ->RangeMultiplier(2)
112 ->Range(1 << 10, 1 << 16)
113 ->Complexity();
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000114
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000115const char *big_o_n_test_name = "BM_Complexity_O_N_BigO";
116const char *rms_o_n_test_name = "BM_Complexity_O_N_RMS";
117const char *enum_auto_big_o_n = "N";
118const char *lambda_big_o_n = "f\\(N\\)";
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000119
120// Add enum tests
Eric Fiselier4d5e91d2016-08-29 19:12:01 +0000121ADD_COMPLEXITY_CASES(big_o_n_test_name, rms_o_n_test_name, enum_auto_big_o_n);
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000122
123// Add lambda tests
Eric Fiselier4d5e91d2016-08-29 19:12:01 +0000124ADD_COMPLEXITY_CASES(big_o_n_test_name, rms_o_n_test_name, lambda_big_o_n);
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000125
126// ========================================================================= //
127// ------------------------- Testing BigO O(N*lgN) ------------------------- //
128// ========================================================================= //
129
130static void BM_Complexity_O_N_log_N(benchmark::State& state) {
Eric Fiselierf6e09e52016-08-09 18:56:48 +0000131 auto v = ConstructRandomVector(state.range(0));
Eric Fiselier19039762018-01-18 04:23:01 +0000132 for (auto _ : state) {
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000133 std::sort(v.begin(), v.end());
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000134 }
Eric Fiselierf6e09e52016-08-09 18:56:48 +0000135 state.SetComplexityN(state.range(0));
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000136}
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000137BENCHMARK(BM_Complexity_O_N_log_N)
138 ->RangeMultiplier(2)
139 ->Range(1 << 10, 1 << 16)
140 ->Complexity(benchmark::oNLogN);
141BENCHMARK(BM_Complexity_O_N_log_N)
142 ->RangeMultiplier(2)
143 ->Range(1 << 10, 1 << 16)
Eric Fiselier19039762018-01-18 04:23:01 +0000144 ->Complexity([](int n) { return n * log2(n); });
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000145BENCHMARK(BM_Complexity_O_N_log_N)
146 ->RangeMultiplier(2)
147 ->Range(1 << 10, 1 << 16)
148 ->Complexity();
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000149
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000150const char *big_o_n_lg_n_test_name = "BM_Complexity_O_N_log_N_BigO";
151const char *rms_o_n_lg_n_test_name = "BM_Complexity_O_N_log_N_RMS";
152const char *enum_auto_big_o_n_lg_n = "NlgN";
153const char *lambda_big_o_n_lg_n = "f\\(N\\)";
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000154
155// Add enum tests
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000156ADD_COMPLEXITY_CASES(big_o_n_lg_n_test_name, rms_o_n_lg_n_test_name,
157 enum_auto_big_o_n_lg_n);
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000158
159// Add lambda tests
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000160ADD_COMPLEXITY_CASES(big_o_n_lg_n_test_name, rms_o_n_lg_n_test_name,
161 lambda_big_o_n_lg_n);
Eric Fiselierb08d8b12016-07-19 23:07:03 +0000162
163// ========================================================================= //
164// --------------------------- TEST CASES END ------------------------------ //
165// ========================================================================= //
166
Eric Fiselierfbc9ff22016-11-05 00:30:27 +0000167int main(int argc, char *argv[]) { RunOutputTests(argc, argv); }