Abseil Common Libraries (C++) (grcp 依赖) https://abseil.io/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

169 lines
5.1 KiB

Export of internal Abseil changes -- f012012ef78234a6a4585321b67d7b7c92ebc266 by Laramie Leavitt <lar@google.com>: Slight restructuring of absl/random/internal randen implementation. Convert round-keys.inc into randen_round_keys.cc file. Consistently use a 128-bit pointer type for internal method parameters. This allows simpler pointer arithmetic in C++ & permits removal of some constants and casts. Remove some redundancy in comments & constexpr variables. Specifically, all references to Randen algorithm parameters use RandenTraits; duplication in RandenSlow removed. PiperOrigin-RevId: 312190313 -- dc8b42e054046741e9ed65335bfdface997c6063 by Abseil Team <absl-team@google.com>: Internal change. PiperOrigin-RevId: 312167304 -- f13d248fafaf206492c1362c3574031aea3abaf7 by Matthew Brown <matthewbr@google.com>: Cleanup StrFormat extensions a little. PiperOrigin-RevId: 312166336 -- 9d9117589667afe2332bb7ad42bc967ca7c54502 by Derek Mauro <dmauro@google.com>: Internal change PiperOrigin-RevId: 312105213 -- 9a12b9b3aa0e59b8ee6cf9408ed0029045543a9b by Abseil Team <absl-team@google.com>: Complete IGNORE_TYPE macro renaming. PiperOrigin-RevId: 311999699 -- 64756f20d61021d999bd0d4c15e9ad3857382f57 by Gennadiy Rozental <rogeeff@google.com>: Switch to fixed bytes specific default value. This fixes the Abseil Flags for big endian platforms. PiperOrigin-RevId: 311844448 -- bdbe6b5b29791dbc3816ada1828458b3010ff1e9 by Laramie Leavitt <lar@google.com>: Change many distribution tests to use pcg_engine as a deterministic source of entropy. It's reasonable to test that the BitGen itself has good entropy, however when testing the cross product of all random distributions x all the architecture variations x all submitted changes results in a large number of tests. In order to account for these failures while still using good entropy requires that our allowed sigma need to account for all of these independent tests. Our current sigma values are too restrictive, and we see a lot of failures, so we have to either relax the sigma values or convert some of the statistical tests to use deterministic values. This changelist does the latter. PiperOrigin-RevId: 311840096 GitOrigin-RevId: f012012ef78234a6a4585321b67d7b7c92ebc266 Change-Id: Ic84886f38ff30d7d72c126e9b63c9a61eb729a1a
5 years ago
// 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
//
// 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 "absl/random/internal/salted_seed_seq.h"
#include <iterator>
#include <random>
#include <utility>
#include <vector>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
using absl::random_internal::GetSaltMaterial;
using absl::random_internal::MakeSaltedSeedSeq;
using absl::random_internal::SaltedSeedSeq;
using testing::Eq;
using testing::Pointwise;
namespace {
template <typename Sseq>
void ConformsToInterface() {
// Check that the SeedSequence can be default-constructed.
{ Sseq default_constructed_seq; }
// Check that the SeedSequence can be constructed with two iterators.
{
uint32_t init_array[] = {1, 3, 5, 7, 9};
Sseq iterator_constructed_seq(std::begin(init_array), std::end(init_array));
}
// Check that the SeedSequence can be std::initializer_list-constructed.
{ Sseq list_constructed_seq = {1, 3, 5, 7, 9, 11, 13}; }
// Check that param() and size() return state provided to constructor.
{
uint32_t init_array[] = {1, 2, 3, 4, 5};
Sseq seq(std::begin(init_array), std::end(init_array));
EXPECT_EQ(seq.size(), ABSL_ARRAYSIZE(init_array));
std::vector<uint32_t> state_vector;
seq.param(std::back_inserter(state_vector));
EXPECT_EQ(state_vector.size(), ABSL_ARRAYSIZE(init_array));
for (int i = 0; i < state_vector.size(); i++) {
EXPECT_EQ(state_vector[i], i + 1);
}
}
// Check for presence of generate() method.
{
Sseq seq;
uint32_t seeds[5];
seq.generate(std::begin(seeds), std::end(seeds));
}
}
TEST(SaltedSeedSeq, CheckInterfaces) {
// Control case
ConformsToInterface<std::seed_seq>();
// Abseil classes
ConformsToInterface<SaltedSeedSeq<std::seed_seq>>();
}
TEST(SaltedSeedSeq, CheckConstructingFromOtherSequence) {
std::vector<uint32_t> seed_values(10, 1);
std::seed_seq seq(seed_values.begin(), seed_values.end());
auto salted_seq = MakeSaltedSeedSeq(std::move(seq));
EXPECT_EQ(seq.size(), salted_seq.size());
std::vector<uint32_t> param_result;
seq.param(std::back_inserter(param_result));
EXPECT_EQ(seed_values, param_result);
}
TEST(SaltedSeedSeq, SaltedSaltedSeedSeqIsNotDoubleSalted) {
uint32_t init[] = {1, 3, 5, 7, 9};
std::seed_seq seq(std::begin(init), std::end(init));
// The first salting.
SaltedSeedSeq<std::seed_seq> salted_seq = MakeSaltedSeedSeq(std::move(seq));
uint32_t a[16];
salted_seq.generate(std::begin(a), std::end(a));
// The second salting.
SaltedSeedSeq<std::seed_seq> salted_salted_seq =
MakeSaltedSeedSeq(std::move(salted_seq));
uint32_t b[16];
salted_salted_seq.generate(std::begin(b), std::end(b));
// ... both should be equal.
EXPECT_THAT(b, Pointwise(Eq(), a)) << "a[0] " << a[0];
}
TEST(SaltedSeedSeq, SeedMaterialIsSalted) {
const size_t kNumBlocks = 16;
uint32_t seed_material[kNumBlocks];
std::random_device urandom{"/dev/urandom"};
for (uint32_t& seed : seed_material) {
seed = urandom();
}
std::seed_seq seq(std::begin(seed_material), std::end(seed_material));
SaltedSeedSeq<std::seed_seq> salted_seq(std::begin(seed_material),
std::end(seed_material));
bool salt_is_available = GetSaltMaterial().has_value();
// If salt is available generated sequence should be different.
if (salt_is_available) {
uint32_t outputs[kNumBlocks];
uint32_t salted_outputs[kNumBlocks];
seq.generate(std::begin(outputs), std::end(outputs));
salted_seq.generate(std::begin(salted_outputs), std::end(salted_outputs));
EXPECT_THAT(outputs, Pointwise(testing::Ne(), salted_outputs));
}
}
TEST(SaltedSeedSeq, GenerateAcceptsDifferentTypes) {
const size_t kNumBlocks = 4;
SaltedSeedSeq<std::seed_seq> seq({1, 2, 3});
uint32_t expected[kNumBlocks];
seq.generate(std::begin(expected), std::end(expected));
// 32-bit outputs
{
unsigned long seed_material[kNumBlocks]; // NOLINT(runtime/int)
seq.generate(std::begin(seed_material), std::end(seed_material));
EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
}
{
unsigned int seed_material[kNumBlocks]; // NOLINT(runtime/int)
seq.generate(std::begin(seed_material), std::end(seed_material));
EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
}
// 64-bit outputs.
{
uint64_t seed_material[kNumBlocks];
seq.generate(std::begin(seed_material), std::end(seed_material));
EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
}
{
int64_t seed_material[kNumBlocks];
seq.generate(std::begin(seed_material), std::end(seed_material));
EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
}
}
} // namespace