numbers_benchmark.cc 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. // Copyright 2018 The Abseil Authors.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // https://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. #include <cstdint>
  15. #include <random>
  16. #include <string>
  17. #include <type_traits>
  18. #include <vector>
  19. #include "benchmark/benchmark.h"
  20. #include "absl/base/internal/raw_logging.h"
  21. #include "absl/random/distributions.h"
  22. #include "absl/random/random.h"
  23. #include "absl/strings/numbers.h"
  24. namespace {
  25. template <typename T>
  26. void BM_FastIntToBuffer(benchmark::State& state) {
  27. const int inc = state.range(0);
  28. char buf[absl::numbers_internal::kFastToBufferSize];
  29. // Use the unsigned type to increment to take advantage of well-defined
  30. // modular arithmetic.
  31. typename std::make_unsigned<T>::type x = 0;
  32. for (auto _ : state) {
  33. absl::numbers_internal::FastIntToBuffer(static_cast<T>(x), buf);
  34. x += inc;
  35. }
  36. }
  37. BENCHMARK_TEMPLATE(BM_FastIntToBuffer, int32_t)->Range(0, 1 << 15);
  38. BENCHMARK_TEMPLATE(BM_FastIntToBuffer, int64_t)->Range(0, 1 << 30);
  39. // Creates an integer that would be printed as `num_digits` repeated 7s in the
  40. // given `base`. `base` must be greater than or equal to 8.
  41. int64_t RepeatedSevens(int num_digits, int base) {
  42. ABSL_RAW_CHECK(base >= 8, "");
  43. int64_t num = 7;
  44. while (--num_digits) num = base * num + 7;
  45. return num;
  46. }
  47. void BM_safe_strto32_string(benchmark::State& state) {
  48. const int digits = state.range(0);
  49. const int base = state.range(1);
  50. std::string str(digits, '7'); // valid in octal, decimal and hex
  51. int32_t value = 0;
  52. for (auto _ : state) {
  53. benchmark::DoNotOptimize(
  54. absl::numbers_internal::safe_strto32_base(str, &value, base));
  55. }
  56. ABSL_RAW_CHECK(value == RepeatedSevens(digits, base), "");
  57. }
  58. BENCHMARK(BM_safe_strto32_string)
  59. ->ArgPair(1, 8)
  60. ->ArgPair(1, 10)
  61. ->ArgPair(1, 16)
  62. ->ArgPair(2, 8)
  63. ->ArgPair(2, 10)
  64. ->ArgPair(2, 16)
  65. ->ArgPair(4, 8)
  66. ->ArgPair(4, 10)
  67. ->ArgPair(4, 16)
  68. ->ArgPair(8, 8)
  69. ->ArgPair(8, 10)
  70. ->ArgPair(8, 16)
  71. ->ArgPair(10, 8)
  72. ->ArgPair(9, 10);
  73. void BM_safe_strto64_string(benchmark::State& state) {
  74. const int digits = state.range(0);
  75. const int base = state.range(1);
  76. std::string str(digits, '7'); // valid in octal, decimal and hex
  77. int64_t value = 0;
  78. for (auto _ : state) {
  79. benchmark::DoNotOptimize(
  80. absl::numbers_internal::safe_strto64_base(str, &value, base));
  81. }
  82. ABSL_RAW_CHECK(value == RepeatedSevens(digits, base), "");
  83. }
  84. BENCHMARK(BM_safe_strto64_string)
  85. ->ArgPair(1, 8)
  86. ->ArgPair(1, 10)
  87. ->ArgPair(1, 16)
  88. ->ArgPair(2, 8)
  89. ->ArgPair(2, 10)
  90. ->ArgPair(2, 16)
  91. ->ArgPair(4, 8)
  92. ->ArgPair(4, 10)
  93. ->ArgPair(4, 16)
  94. ->ArgPair(8, 8)
  95. ->ArgPair(8, 10)
  96. ->ArgPair(8, 16)
  97. ->ArgPair(16, 8)
  98. ->ArgPair(16, 10)
  99. ->ArgPair(16, 16);
  100. void BM_safe_strtou32_string(benchmark::State& state) {
  101. const int digits = state.range(0);
  102. const int base = state.range(1);
  103. std::string str(digits, '7'); // valid in octal, decimal and hex
  104. uint32_t value = 0;
  105. for (auto _ : state) {
  106. benchmark::DoNotOptimize(
  107. absl::numbers_internal::safe_strtou32_base(str, &value, base));
  108. }
  109. ABSL_RAW_CHECK(value == RepeatedSevens(digits, base), "");
  110. }
  111. BENCHMARK(BM_safe_strtou32_string)
  112. ->ArgPair(1, 8)
  113. ->ArgPair(1, 10)
  114. ->ArgPair(1, 16)
  115. ->ArgPair(2, 8)
  116. ->ArgPair(2, 10)
  117. ->ArgPair(2, 16)
  118. ->ArgPair(4, 8)
  119. ->ArgPair(4, 10)
  120. ->ArgPair(4, 16)
  121. ->ArgPair(8, 8)
  122. ->ArgPair(8, 10)
  123. ->ArgPair(8, 16)
  124. ->ArgPair(10, 8)
  125. ->ArgPair(9, 10);
  126. void BM_safe_strtou64_string(benchmark::State& state) {
  127. const int digits = state.range(0);
  128. const int base = state.range(1);
  129. std::string str(digits, '7'); // valid in octal, decimal and hex
  130. uint64_t value = 0;
  131. for (auto _ : state) {
  132. benchmark::DoNotOptimize(
  133. absl::numbers_internal::safe_strtou64_base(str, &value, base));
  134. }
  135. ABSL_RAW_CHECK(value == RepeatedSevens(digits, base), "");
  136. }
  137. BENCHMARK(BM_safe_strtou64_string)
  138. ->ArgPair(1, 8)
  139. ->ArgPair(1, 10)
  140. ->ArgPair(1, 16)
  141. ->ArgPair(2, 8)
  142. ->ArgPair(2, 10)
  143. ->ArgPair(2, 16)
  144. ->ArgPair(4, 8)
  145. ->ArgPair(4, 10)
  146. ->ArgPair(4, 16)
  147. ->ArgPair(8, 8)
  148. ->ArgPair(8, 10)
  149. ->ArgPair(8, 16)
  150. ->ArgPair(16, 8)
  151. ->ArgPair(16, 10)
  152. ->ArgPair(16, 16);
  153. // Returns a vector of `num_strings` strings. Each string represents a
  154. // floating point number with `num_digits` digits before the decimal point and
  155. // another `num_digits` digits after.
  156. std::vector<std::string> MakeFloatStrings(int num_strings, int num_digits) {
  157. // For convenience, use a random number generator to generate the test data.
  158. // We don't actually need random properties, so use a fixed seed.
  159. std::minstd_rand0 rng(1);
  160. std::uniform_int_distribution<int> random_digit('0', '9');
  161. std::vector<std::string> float_strings(num_strings);
  162. for (std::string& s : float_strings) {
  163. s.reserve(2 * num_digits + 1);
  164. for (int i = 0; i < num_digits; ++i) {
  165. s.push_back(static_cast<char>(random_digit(rng)));
  166. }
  167. s.push_back('.');
  168. for (int i = 0; i < num_digits; ++i) {
  169. s.push_back(static_cast<char>(random_digit(rng)));
  170. }
  171. }
  172. return float_strings;
  173. }
  174. template <typename StringType>
  175. StringType GetStringAs(const std::string& s) {
  176. return static_cast<StringType>(s);
  177. }
  178. template <>
  179. const char* GetStringAs<const char*>(const std::string& s) {
  180. return s.c_str();
  181. }
  182. template <typename StringType>
  183. std::vector<StringType> GetStringsAs(const std::vector<std::string>& strings) {
  184. std::vector<StringType> result;
  185. result.reserve(strings.size());
  186. for (const std::string& s : strings) {
  187. result.push_back(GetStringAs<StringType>(s));
  188. }
  189. return result;
  190. }
  191. template <typename T>
  192. void BM_SimpleAtof(benchmark::State& state) {
  193. const int num_strings = state.range(0);
  194. const int num_digits = state.range(1);
  195. std::vector<std::string> backing_strings =
  196. MakeFloatStrings(num_strings, num_digits);
  197. std::vector<T> inputs = GetStringsAs<T>(backing_strings);
  198. float value;
  199. for (auto _ : state) {
  200. for (const T& input : inputs) {
  201. benchmark::DoNotOptimize(absl::SimpleAtof(input, &value));
  202. }
  203. }
  204. }
  205. BENCHMARK_TEMPLATE(BM_SimpleAtof, absl::string_view)
  206. ->ArgPair(10, 1)
  207. ->ArgPair(10, 2)
  208. ->ArgPair(10, 4)
  209. ->ArgPair(10, 8);
  210. BENCHMARK_TEMPLATE(BM_SimpleAtof, const char*)
  211. ->ArgPair(10, 1)
  212. ->ArgPair(10, 2)
  213. ->ArgPair(10, 4)
  214. ->ArgPair(10, 8);
  215. BENCHMARK_TEMPLATE(BM_SimpleAtof, std::string)
  216. ->ArgPair(10, 1)
  217. ->ArgPair(10, 2)
  218. ->ArgPair(10, 4)
  219. ->ArgPair(10, 8);
  220. template <typename T>
  221. void BM_SimpleAtod(benchmark::State& state) {
  222. const int num_strings = state.range(0);
  223. const int num_digits = state.range(1);
  224. std::vector<std::string> backing_strings =
  225. MakeFloatStrings(num_strings, num_digits);
  226. std::vector<T> inputs = GetStringsAs<T>(backing_strings);
  227. double value;
  228. for (auto _ : state) {
  229. for (const T& input : inputs) {
  230. benchmark::DoNotOptimize(absl::SimpleAtod(input, &value));
  231. }
  232. }
  233. }
  234. BENCHMARK_TEMPLATE(BM_SimpleAtod, absl::string_view)
  235. ->ArgPair(10, 1)
  236. ->ArgPair(10, 2)
  237. ->ArgPair(10, 4)
  238. ->ArgPair(10, 8);
  239. BENCHMARK_TEMPLATE(BM_SimpleAtod, const char*)
  240. ->ArgPair(10, 1)
  241. ->ArgPair(10, 2)
  242. ->ArgPair(10, 4)
  243. ->ArgPair(10, 8);
  244. BENCHMARK_TEMPLATE(BM_SimpleAtod, std::string)
  245. ->ArgPair(10, 1)
  246. ->ArgPair(10, 2)
  247. ->ArgPair(10, 4)
  248. ->ArgPair(10, 8);
  249. void BM_FastHexToBufferZeroPad16(benchmark::State& state) {
  250. absl::BitGen rng;
  251. std::vector<uint64_t> nums;
  252. nums.resize(1000);
  253. auto min = std::numeric_limits<uint64_t>::min();
  254. auto max = std::numeric_limits<uint64_t>::max();
  255. for (auto& num : nums) {
  256. num = absl::LogUniform(rng, min, max);
  257. }
  258. char buf[16];
  259. while (state.KeepRunningBatch(nums.size())) {
  260. for (auto num : nums) {
  261. auto digits = absl::numbers_internal::FastHexToBufferZeroPad16(num, buf);
  262. benchmark::DoNotOptimize(digits);
  263. benchmark::DoNotOptimize(buf);
  264. }
  265. }
  266. }
  267. BENCHMARK(BM_FastHexToBufferZeroPad16);
  268. } // namespace