Change log:ffaf1e2ba6..ef538e3112Full diff:ffaf1e2ba6..ef538e3112Roll chromium third_party fb3dc2a0aa..cbc2a20101 Change log:fb3dc2a0aa..cbc2a20101Changed dependencies: * src/base:2743076235..02a6c4cdd0* src/build:459adce3eb..3c4d6b6d24* src/ios:71b35d6ee6..0c6d3816a0* src/testing:f624b1f4b7..e0597e0b5d* src/third_party/catapult: https://chromium.googlesource.com/catapult.git/+log/eca23c365a..fdacd1639e * src/third_party/depot_tools:e05f18d477..e09b6845cf* src/third_party/freetype/src:0589f6e6ee..8f1ed54877* src/third_party/googletest/src:145d05750b..9077ec7efe* src/tools:76e5757c8f..c7862334ceDEPS diff:ffaf1e2ba6..ef538e3112/DEPS Clang version changed 332838:334100 Details:ffaf1e2ba6..ef538e3112/tools/clang/scripts/update.py TBR=buildbot@webrtc.org, BUG=None CQ_INCLUDE_TRYBOTS=master.internal.tryserver.corp.webrtc:linux_internal NO_AUTOIMPORT_DEPS_CHECK=true Change-Id: Iac45f00b35127f886b32aac8b79578fbe528fb00 Reviewed-on: https://webrtc-review.googlesource.com/83220 Reviewed-by: WebRTC Buildbot <buildbot@webrtc.org> Commit-Queue: WebRTC Buildbot <buildbot@webrtc.org> Cr-Commit-Position: refs/heads/master@{#23585}
222 lines
7.2 KiB
C++
222 lines
7.2 KiB
C++
// Copyright 2017 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
|
|
//
|
|
// http://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 "absl/numeric/int128.h"
|
|
|
|
#include <algorithm>
|
|
#include <cstdint>
|
|
#include <random>
|
|
#include <vector>
|
|
|
|
#include "benchmark/benchmark.h"
|
|
#include "absl/base/config.h"
|
|
|
|
namespace {
|
|
|
|
constexpr size_t kSampleSize = 1000000;
|
|
|
|
std::mt19937 MakeRandomEngine() {
|
|
std::random_device r;
|
|
std::seed_seq seed({r(), r(), r(), r(), r(), r(), r(), r()});
|
|
return std::mt19937(seed);
|
|
}
|
|
|
|
std::vector<std::pair<absl::uint128, absl::uint128>>
|
|
GetRandomClass128SampleUniformDivisor() {
|
|
std::vector<std::pair<absl::uint128, absl::uint128>> values;
|
|
std::mt19937 random = MakeRandomEngine();
|
|
std::uniform_int_distribution<uint64_t> uniform_uint64;
|
|
values.reserve(kSampleSize);
|
|
for (size_t i = 0; i < kSampleSize; ++i) {
|
|
absl::uint128 a =
|
|
absl::MakeUint128(uniform_uint64(random), uniform_uint64(random));
|
|
absl::uint128 b =
|
|
absl::MakeUint128(uniform_uint64(random), uniform_uint64(random));
|
|
values.emplace_back(std::max(a, b),
|
|
std::max(absl::uint128(2), std::min(a, b)));
|
|
}
|
|
return values;
|
|
}
|
|
|
|
void BM_DivideClass128UniformDivisor(benchmark::State& state) {
|
|
auto values = GetRandomClass128SampleUniformDivisor();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first / pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_DivideClass128UniformDivisor);
|
|
|
|
std::vector<std::pair<absl::uint128, uint64_t>>
|
|
GetRandomClass128SampleSmallDivisor() {
|
|
std::vector<std::pair<absl::uint128, uint64_t>> values;
|
|
std::mt19937 random = MakeRandomEngine();
|
|
std::uniform_int_distribution<uint64_t> uniform_uint64;
|
|
values.reserve(kSampleSize);
|
|
for (size_t i = 0; i < kSampleSize; ++i) {
|
|
absl::uint128 a =
|
|
absl::MakeUint128(uniform_uint64(random), uniform_uint64(random));
|
|
uint64_t b = std::max(uint64_t{2}, uniform_uint64(random));
|
|
values.emplace_back(std::max(a, absl::uint128(b)), b);
|
|
}
|
|
return values;
|
|
}
|
|
|
|
void BM_DivideClass128SmallDivisor(benchmark::State& state) {
|
|
auto values = GetRandomClass128SampleSmallDivisor();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first / pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_DivideClass128SmallDivisor);
|
|
|
|
std::vector<std::pair<absl::uint128, absl::uint128>> GetRandomClass128Sample() {
|
|
std::vector<std::pair<absl::uint128, absl::uint128>> values;
|
|
std::mt19937 random = MakeRandomEngine();
|
|
std::uniform_int_distribution<uint64_t> uniform_uint64;
|
|
values.reserve(kSampleSize);
|
|
for (size_t i = 0; i < kSampleSize; ++i) {
|
|
values.emplace_back(
|
|
absl::MakeUint128(uniform_uint64(random), uniform_uint64(random)),
|
|
absl::MakeUint128(uniform_uint64(random), uniform_uint64(random)));
|
|
}
|
|
return values;
|
|
}
|
|
|
|
void BM_MultiplyClass128(benchmark::State& state) {
|
|
auto values = GetRandomClass128Sample();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first * pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_MultiplyClass128);
|
|
|
|
void BM_AddClass128(benchmark::State& state) {
|
|
auto values = GetRandomClass128Sample();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first + pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_AddClass128);
|
|
|
|
#ifdef ABSL_HAVE_INTRINSIC_INT128
|
|
|
|
// Some implementations of <random> do not support __int128 when it is
|
|
// available, so we make our own uniform_int_distribution-like type.
|
|
class UniformIntDistribution128 {
|
|
public:
|
|
// NOLINTNEXTLINE: mimicking std::uniform_int_distribution API
|
|
unsigned __int128 operator()(std::mt19937& generator) {
|
|
return (static_cast<unsigned __int128>(dist64_(generator)) << 64) |
|
|
dist64_(generator);
|
|
}
|
|
|
|
private:
|
|
std::uniform_int_distribution<uint64_t> dist64_;
|
|
};
|
|
|
|
std::vector<std::pair<unsigned __int128, unsigned __int128>>
|
|
GetRandomIntrinsic128SampleUniformDivisor() {
|
|
std::vector<std::pair<unsigned __int128, unsigned __int128>> values;
|
|
std::mt19937 random = MakeRandomEngine();
|
|
UniformIntDistribution128 uniform_uint128;
|
|
values.reserve(kSampleSize);
|
|
for (size_t i = 0; i < kSampleSize; ++i) {
|
|
unsigned __int128 a = uniform_uint128(random);
|
|
unsigned __int128 b = uniform_uint128(random);
|
|
values.emplace_back(
|
|
std::max(a, b),
|
|
std::max(static_cast<unsigned __int128>(2), std::min(a, b)));
|
|
}
|
|
return values;
|
|
}
|
|
|
|
void BM_DivideIntrinsic128UniformDivisor(benchmark::State& state) {
|
|
auto values = GetRandomIntrinsic128SampleUniformDivisor();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first / pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_DivideIntrinsic128UniformDivisor);
|
|
|
|
std::vector<std::pair<unsigned __int128, uint64_t>>
|
|
GetRandomIntrinsic128SampleSmallDivisor() {
|
|
std::vector<std::pair<unsigned __int128, uint64_t>> values;
|
|
std::mt19937 random = MakeRandomEngine();
|
|
UniformIntDistribution128 uniform_uint128;
|
|
std::uniform_int_distribution<uint64_t> uniform_uint64;
|
|
values.reserve(kSampleSize);
|
|
for (size_t i = 0; i < kSampleSize; ++i) {
|
|
unsigned __int128 a = uniform_uint128(random);
|
|
uint64_t b = std::max(uint64_t{2}, uniform_uint64(random));
|
|
values.emplace_back(std::max(a, static_cast<unsigned __int128>(b)), b);
|
|
}
|
|
return values;
|
|
}
|
|
|
|
void BM_DivideIntrinsic128SmallDivisor(benchmark::State& state) {
|
|
auto values = GetRandomIntrinsic128SampleSmallDivisor();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first / pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_DivideIntrinsic128SmallDivisor);
|
|
|
|
std::vector<std::pair<unsigned __int128, unsigned __int128>>
|
|
GetRandomIntrinsic128Sample() {
|
|
std::vector<std::pair<unsigned __int128, unsigned __int128>> values;
|
|
std::mt19937 random = MakeRandomEngine();
|
|
UniformIntDistribution128 uniform_uint128;
|
|
values.reserve(kSampleSize);
|
|
for (size_t i = 0; i < kSampleSize; ++i) {
|
|
values.emplace_back(uniform_uint128(random), uniform_uint128(random));
|
|
}
|
|
return values;
|
|
}
|
|
|
|
void BM_MultiplyIntrinsic128(benchmark::State& state) {
|
|
auto values = GetRandomIntrinsic128Sample();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first * pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_MultiplyIntrinsic128);
|
|
|
|
void BM_AddIntrinsic128(benchmark::State& state) {
|
|
auto values = GetRandomIntrinsic128Sample();
|
|
while (state.KeepRunningBatch(values.size())) {
|
|
for (const auto& pair : values) {
|
|
benchmark::DoNotOptimize(pair.first + pair.second);
|
|
}
|
|
}
|
|
}
|
|
BENCHMARK(BM_AddIntrinsic128);
|
|
|
|
#endif // ABSL_HAVE_INTRINSIC_INT128
|
|
|
|
} // namespace
|