-- 0db7f4046f9b59c0f8c3df2f0eb7fd88fc328439 by Abseil Team <absl-team@google.com>: Revise documentation of bit_cast: * Removes inappropriate examples (round-tripping pointers, serialization), for which reinterpret_cast is more appropriate. * Removes mention of "bit representation", which is not an explicit notion in C++. The best we get is "byte representation". * Removes a circular defition of "bitcast" as itself, and instead explains what it does. * Removes the mathism "for some values of", which is probably not totally accessible to a general audience, and in any case needless verbiage. * Fixes comments in the example. * Replaces some colloquialisms with simpler, more direct language. PiperOrigin-RevId: 421791786 -- e04e64df55d93c1b9a09c0483b97cc4d8763260d by Derek Mauro <dmauro@google.com>: Update Docker image to use GCC 11.2, Clang 14 (prerelease), CMake 3.22.1, and Bazel 4.2.2 PiperOrigin-RevId: 421658559 -- d002bb3dc5cd1fc5b4cbd79a450efc894caa567c by Chris Kennelly <ckennelly@google.com>: Add a small microbenchmark for absl::bit_width. PiperOrigin-RevId: 421604852 -- 131b057d1b76ecd7170421b48d661bb958ff676b by Evan Brown <ezb@google.com>: Adds a disabled test for EBO in nested `CompressedTuple`s. PiperOrigin-RevId: 421413134 -- e34c7876d3a1212d90c73c030ccae6169b682d43 by Jorg Brown <jorg@google.com>: Show users a better error message if they pass a pointer to absl::Uniform. PiperOrigin-RevId: 421090472 GitOrigin-RevId: 0db7f4046f9b59c0f8c3df2f0eb7fd88fc328439 Change-Id: I5a004e8d17e974fa4897a09d1466ae8fc65dfdbbpull/1095/head
parent
2a042b082c
commit
c59e7e59f5
9 changed files with 137 additions and 35 deletions
@ -0,0 +1,73 @@ |
|||||||
|
// Copyright 2022 The Abseil Authors
|
||||||
|
//
|
||||||
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
// you may not use this file except in compliance with the License.
|
||||||
|
// You may obtain a copy of the License at
|
||||||
|
//
|
||||||
|
// https://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
//
|
||||||
|
// Unless required by applicable law or agreed to in writing, software
|
||||||
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
// See the License for the specific language governing permissions and
|
||||||
|
// limitations under the License.
|
||||||
|
|
||||||
|
#include <cstdint> |
||||||
|
#include <vector> |
||||||
|
|
||||||
|
#include "benchmark/benchmark.h" |
||||||
|
#include "absl/base/optimization.h" |
||||||
|
#include "absl/numeric/bits.h" |
||||||
|
#include "absl/random/random.h" |
||||||
|
|
||||||
|
namespace absl { |
||||||
|
namespace { |
||||||
|
|
||||||
|
template <typename T> |
||||||
|
static void BM_bitwidth(benchmark::State& state) { |
||||||
|
const int count = state.range(0); |
||||||
|
|
||||||
|
absl::BitGen rng; |
||||||
|
std::vector<T> values; |
||||||
|
values.reserve(count); |
||||||
|
for (int i = 0; i < count; ++i) { |
||||||
|
values.push_back(absl::Uniform<T>(rng, 0, std::numeric_limits<T>::max())); |
||||||
|
} |
||||||
|
|
||||||
|
while (state.KeepRunningBatch(count)) { |
||||||
|
for (int i = 0; i < count; ++i) { |
||||||
|
benchmark::DoNotOptimize(values[i]); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth, uint8_t)->Range(1, 1 << 20); |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth, uint16_t)->Range(1, 1 << 20); |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth, uint32_t)->Range(1, 1 << 20); |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth, uint64_t)->Range(1, 1 << 20); |
||||||
|
|
||||||
|
template <typename T> |
||||||
|
static void BM_bitwidth_nonzero(benchmark::State& state) { |
||||||
|
const int count = state.range(0); |
||||||
|
|
||||||
|
absl::BitGen rng; |
||||||
|
std::vector<T> values; |
||||||
|
values.reserve(count); |
||||||
|
for (int i = 0; i < count; ++i) { |
||||||
|
values.push_back(absl::Uniform<T>(rng, 1, std::numeric_limits<T>::max())); |
||||||
|
} |
||||||
|
|
||||||
|
while (state.KeepRunningBatch(count)) { |
||||||
|
for (int i = 0; i < count; ++i) { |
||||||
|
const T value = values[i]; |
||||||
|
ABSL_INTERNAL_ASSUME(value > 0); |
||||||
|
benchmark::DoNotOptimize(value); |
||||||
|
} |
||||||
|
} |
||||||
|
} |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth_nonzero, uint8_t)->Range(1, 1 << 20); |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth_nonzero, uint16_t)->Range(1, 1 << 20); |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth_nonzero, uint32_t)->Range(1, 1 << 20); |
||||||
|
BENCHMARK_TEMPLATE(BM_bitwidth_nonzero, uint64_t)->Range(1, 1 << 20); |
||||||
|
|
||||||
|
} // namespace
|
||||||
|
} // namespace absl
|
Loading…
Reference in new issue