ConstexprMathBenchmark.cpp 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196
  1. /*
  2. * Copyright 2018-present Facebook, Inc.
  3. *
  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
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  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.
  15. */
  16. #include <folly/Benchmark.h>
  17. #include <folly/ConstexprMath.h>
  18. #include <glog/logging.h>
  19. #include <limits>
  20. #include <type_traits>
  21. template <typename ValueT>
  22. constexpr ValueT UBSafeAdd(ValueT a, ValueT b) {
  23. using UnsignedT = typename std::make_unsigned<ValueT>::type;
  24. return static_cast<ValueT>(
  25. static_cast<UnsignedT>(a) + static_cast<UnsignedT>(b));
  26. }
  27. template <typename ValueT>
  28. constexpr ValueT UBSafeSub(ValueT a, ValueT b) {
  29. using UnsignedT = typename std::make_unsigned<ValueT>::type;
  30. return static_cast<ValueT>(
  31. static_cast<UnsignedT>(a) - static_cast<UnsignedT>(b));
  32. }
  33. template <typename ValueT, typename Op>
  34. void Run(size_t iterations, ValueT kMin, ValueT kMax, Op&& op) {
  35. auto kMid = (kMin + kMax) / 2;
  36. for (size_t round = 0; round < iterations; round++) {
  37. for (ValueT a = kMin; a < kMin + 100; a++) {
  38. for (ValueT b = kMin; b < kMin + 100; b++) {
  39. auto a1 = a, b1 = b;
  40. folly::makeUnpredictable(a1);
  41. folly::makeUnpredictable(b1);
  42. ValueT c = op(a1, b1);
  43. folly::doNotOptimizeAway(c);
  44. }
  45. }
  46. for (ValueT a = kMin; a < kMin + 100; a++) {
  47. for (ValueT b = kMid - 50; b < kMid + 50; b++) {
  48. auto a1 = a, b1 = b;
  49. folly::makeUnpredictable(a1);
  50. folly::makeUnpredictable(b1);
  51. ValueT c = op(a1, b1);
  52. folly::doNotOptimizeAway(c);
  53. }
  54. }
  55. for (ValueT a = kMin; a < kMin + 100; a++) {
  56. for (ValueT b = kMax - 100; b < kMax; b++) {
  57. auto a1 = a, b1 = b;
  58. folly::makeUnpredictable(a1);
  59. folly::makeUnpredictable(b1);
  60. ValueT c = op(a1, b1);
  61. folly::doNotOptimizeAway(c);
  62. }
  63. }
  64. for (ValueT a = kMid - 50; a < kMid + 50; a++) {
  65. for (ValueT b = kMin; b < kMin + 100; b++) {
  66. auto a1 = a, b1 = b;
  67. folly::makeUnpredictable(a1);
  68. folly::makeUnpredictable(b1);
  69. ValueT c = op(a1, b1);
  70. folly::doNotOptimizeAway(c);
  71. }
  72. }
  73. for (ValueT a = kMid - 50; a < kMid + 50; a++) {
  74. for (ValueT b = kMid - 50; b < kMid + 50; b++) {
  75. auto a1 = a, b1 = b;
  76. folly::makeUnpredictable(a1);
  77. folly::makeUnpredictable(b1);
  78. ValueT c = op(a1, b1);
  79. folly::doNotOptimizeAway(c);
  80. }
  81. }
  82. for (ValueT a = kMid - 50; a < kMid + 50; a++) {
  83. for (ValueT b = kMax - 100; b < kMax; b++) {
  84. auto a1 = a, b1 = b;
  85. folly::makeUnpredictable(a1);
  86. folly::makeUnpredictable(b1);
  87. ValueT c = op(a1, b1);
  88. folly::doNotOptimizeAway(c);
  89. }
  90. }
  91. for (ValueT a = kMax - 100; a < kMax; a++) {
  92. for (ValueT b = kMin; b < kMin + 100; b++) {
  93. auto a1 = a, b1 = b;
  94. folly::makeUnpredictable(a1);
  95. folly::makeUnpredictable(b1);
  96. ValueT c = op(a1, b1);
  97. folly::doNotOptimizeAway(c);
  98. }
  99. }
  100. for (ValueT a = kMax - 100; a < kMax; a++) {
  101. for (ValueT b = kMid - 50; b < kMid + 50; b++) {
  102. auto a1 = a, b1 = b;
  103. folly::makeUnpredictable(a1);
  104. folly::makeUnpredictable(b1);
  105. ValueT c = op(a1, b1);
  106. folly::doNotOptimizeAway(c);
  107. }
  108. }
  109. for (ValueT a = kMax - 100; a < kMax; a++) {
  110. for (ValueT b = kMax - 100; b < kMax; b++) {
  111. auto a1 = a, b1 = b;
  112. folly::makeUnpredictable(a1);
  113. folly::makeUnpredictable(b1);
  114. ValueT c = op(a1, b1);
  115. folly::doNotOptimizeAway(c);
  116. }
  117. }
  118. }
  119. }
  120. template <typename ValueT>
  121. void Add(size_t iterations, ValueT kMin, ValueT kMax) {
  122. Run<ValueT>(iterations, kMin, kMax, [](ValueT a, ValueT b) {
  123. return UBSafeAdd(a, b);
  124. });
  125. }
  126. template <typename ValueT>
  127. void NoOverflowAdd(size_t iterations, ValueT kMin, ValueT kMax) {
  128. Run<ValueT>(iterations, kMin, kMax, [](ValueT a, ValueT b) {
  129. return folly::constexpr_add_overflow_clamped(a, b);
  130. });
  131. }
  132. template <typename ValueT>
  133. void Sub(size_t iterations, ValueT kMin, ValueT kMax) {
  134. Run<ValueT>(iterations, kMin, kMax, [](ValueT a, ValueT b) {
  135. return UBSafeSub(a, b);
  136. });
  137. }
  138. template <typename ValueT>
  139. void NoOverflowSub(size_t iterations, ValueT kMin, ValueT kMax) {
  140. Run<ValueT>(iterations, kMin, kMax, [](ValueT a, ValueT b) {
  141. return folly::constexpr_sub_overflow_clamped(a, b);
  142. });
  143. }
  144. #define GENERATE_BENCHMARKS_FOR_TYPE(ValueT) \
  145. BENCHMARK_NAMED_PARAM( \
  146. Add, \
  147. ValueT, \
  148. std::numeric_limits<ValueT>::min(), \
  149. std::numeric_limits<ValueT>::max()) \
  150. BENCHMARK_RELATIVE_NAMED_PARAM( \
  151. NoOverflowAdd, \
  152. ValueT, \
  153. std::numeric_limits<ValueT>::min(), \
  154. std::numeric_limits<ValueT>::max()) \
  155. BENCHMARK_NAMED_PARAM( \
  156. Sub, \
  157. ValueT, \
  158. std::numeric_limits<ValueT>::min(), \
  159. std::numeric_limits<ValueT>::max()) \
  160. BENCHMARK_RELATIVE_NAMED_PARAM( \
  161. NoOverflowSub, \
  162. ValueT, \
  163. std::numeric_limits<ValueT>::min(), \
  164. std::numeric_limits<ValueT>::max())
  165. GENERATE_BENCHMARKS_FOR_TYPE(int8_t)
  166. BENCHMARK_DRAW_LINE();
  167. GENERATE_BENCHMARKS_FOR_TYPE(uint8_t)
  168. BENCHMARK_DRAW_LINE();
  169. GENERATE_BENCHMARKS_FOR_TYPE(int16_t)
  170. BENCHMARK_DRAW_LINE();
  171. GENERATE_BENCHMARKS_FOR_TYPE(uint16_t)
  172. BENCHMARK_DRAW_LINE();
  173. GENERATE_BENCHMARKS_FOR_TYPE(int32_t)
  174. BENCHMARK_DRAW_LINE();
  175. GENERATE_BENCHMARKS_FOR_TYPE(uint32_t)
  176. BENCHMARK_DRAW_LINE();
  177. GENERATE_BENCHMARKS_FOR_TYPE(int64_t)
  178. BENCHMARK_DRAW_LINE();
  179. GENERATE_BENCHMARKS_FOR_TYPE(uint64_t)
  180. int main(int argc, char** argv) {
  181. gflags::ParseCommandLineFlags(&argc, &argv, true);
  182. folly::runBenchmarks();
  183. return 0;
  184. }