| 175 | // With ARROW_NOINLINE, try to make sure the number of items is not constant-propagated |
| 176 | template <typename Vector> |
| 177 | ARROW_NOINLINE void BenchmarkVectorPushBack(benchmark::State& state, const int nitems) { |
| 178 | using T = typename Vector::value_type; |
| 179 | constexpr int kNumIters = 1000; |
| 180 | |
| 181 | ARROW_CHECK_LE(static_cast<size_t>(nitems), Vector{}.max_size()); |
| 182 | |
| 183 | for (auto _ : state) { |
| 184 | int64_t dummy = 0; |
| 185 | for (int i = 0; i < kNumIters; ++i) { |
| 186 | Vector vec; |
| 187 | vec.reserve(nitems); |
| 188 | for (int j = 0; j < nitems; ++j) { |
| 189 | vec.push_back(ValueInitializer<T>(j)); |
| 190 | } |
| 191 | dummy += reinterpret_cast<intptr_t>(vec.data()); |
| 192 | benchmark::ClobberMemory(); |
| 193 | } |
| 194 | benchmark::DoNotOptimize(dummy); |
| 195 | } |
| 196 | |
| 197 | state.SetItemsProcessed(state.iterations() * kNumIters * nitems); |
| 198 | } |
| 199 | |
| 200 | template <typename Vector> |
| 201 | void ShortVectorPushBack(benchmark::State& state) { |