salted_seed_seq_test.cc 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168
  1. // Copyright 2017 The Abseil Authors.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // https://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. #include "absl/random/internal/salted_seed_seq.h"
  15. #include <iterator>
  16. #include <random>
  17. #include <utility>
  18. #include <vector>
  19. #include "gmock/gmock.h"
  20. #include "gtest/gtest.h"
  21. using absl::random_internal::GetSaltMaterial;
  22. using absl::random_internal::MakeSaltedSeedSeq;
  23. using absl::random_internal::SaltedSeedSeq;
  24. using testing::Eq;
  25. using testing::Pointwise;
  26. namespace {
  27. template <typename Sseq>
  28. void ConformsToInterface() {
  29. // Check that the SeedSequence can be default-constructed.
  30. { Sseq default_constructed_seq; }
  31. // Check that the SeedSequence can be constructed with two iterators.
  32. {
  33. uint32_t init_array[] = {1, 3, 5, 7, 9};
  34. Sseq iterator_constructed_seq(std::begin(init_array), std::end(init_array));
  35. }
  36. // Check that the SeedSequence can be std::initializer_list-constructed.
  37. { Sseq list_constructed_seq = {1, 3, 5, 7, 9, 11, 13}; }
  38. // Check that param() and size() return state provided to constructor.
  39. {
  40. uint32_t init_array[] = {1, 2, 3, 4, 5};
  41. Sseq seq(std::begin(init_array), std::end(init_array));
  42. EXPECT_EQ(seq.size(), ABSL_ARRAYSIZE(init_array));
  43. std::vector<uint32_t> state_vector;
  44. seq.param(std::back_inserter(state_vector));
  45. EXPECT_EQ(state_vector.size(), ABSL_ARRAYSIZE(init_array));
  46. for (int i = 0; i < state_vector.size(); i++) {
  47. EXPECT_EQ(state_vector[i], i + 1);
  48. }
  49. }
  50. // Check for presence of generate() method.
  51. {
  52. Sseq seq;
  53. uint32_t seeds[5];
  54. seq.generate(std::begin(seeds), std::end(seeds));
  55. }
  56. }
  57. TEST(SaltedSeedSeq, CheckInterfaces) {
  58. // Control case
  59. ConformsToInterface<std::seed_seq>();
  60. // Abseil classes
  61. ConformsToInterface<SaltedSeedSeq<std::seed_seq>>();
  62. }
  63. TEST(SaltedSeedSeq, CheckConstructingFromOtherSequence) {
  64. std::vector<uint32_t> seed_values(10, 1);
  65. std::seed_seq seq(seed_values.begin(), seed_values.end());
  66. auto salted_seq = MakeSaltedSeedSeq(std::move(seq));
  67. EXPECT_EQ(seq.size(), salted_seq.size());
  68. std::vector<uint32_t> param_result;
  69. seq.param(std::back_inserter(param_result));
  70. EXPECT_EQ(seed_values, param_result);
  71. }
  72. TEST(SaltedSeedSeq, SaltedSaltedSeedSeqIsNotDoubleSalted) {
  73. uint32_t init[] = {1, 3, 5, 7, 9};
  74. std::seed_seq seq(std::begin(init), std::end(init));
  75. // The first salting.
  76. SaltedSeedSeq<std::seed_seq> salted_seq = MakeSaltedSeedSeq(std::move(seq));
  77. uint32_t a[16];
  78. salted_seq.generate(std::begin(a), std::end(a));
  79. // The second salting.
  80. SaltedSeedSeq<std::seed_seq> salted_salted_seq =
  81. MakeSaltedSeedSeq(std::move(salted_seq));
  82. uint32_t b[16];
  83. salted_salted_seq.generate(std::begin(b), std::end(b));
  84. // ... both should be equal.
  85. EXPECT_THAT(b, Pointwise(Eq(), a)) << "a[0] " << a[0];
  86. }
  87. TEST(SaltedSeedSeq, SeedMaterialIsSalted) {
  88. const size_t kNumBlocks = 16;
  89. uint32_t seed_material[kNumBlocks];
  90. std::random_device urandom{"/dev/urandom"};
  91. for (uint32_t& seed : seed_material) {
  92. seed = urandom();
  93. }
  94. std::seed_seq seq(std::begin(seed_material), std::end(seed_material));
  95. SaltedSeedSeq<std::seed_seq> salted_seq(std::begin(seed_material),
  96. std::end(seed_material));
  97. bool salt_is_available = GetSaltMaterial().has_value();
  98. // If salt is available generated sequence should be different.
  99. if (salt_is_available) {
  100. uint32_t outputs[kNumBlocks];
  101. uint32_t salted_outputs[kNumBlocks];
  102. seq.generate(std::begin(outputs), std::end(outputs));
  103. salted_seq.generate(std::begin(salted_outputs), std::end(salted_outputs));
  104. EXPECT_THAT(outputs, Pointwise(testing::Ne(), salted_outputs));
  105. }
  106. }
  107. TEST(SaltedSeedSeq, GenerateAcceptsDifferentTypes) {
  108. const size_t kNumBlocks = 4;
  109. SaltedSeedSeq<std::seed_seq> seq({1, 2, 3});
  110. uint32_t expected[kNumBlocks];
  111. seq.generate(std::begin(expected), std::end(expected));
  112. // 32-bit outputs
  113. {
  114. unsigned long seed_material[kNumBlocks]; // NOLINT(runtime/int)
  115. seq.generate(std::begin(seed_material), std::end(seed_material));
  116. EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
  117. }
  118. {
  119. unsigned int seed_material[kNumBlocks]; // NOLINT(runtime/int)
  120. seq.generate(std::begin(seed_material), std::end(seed_material));
  121. EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
  122. }
  123. // 64-bit outputs.
  124. {
  125. uint64_t seed_material[kNumBlocks];
  126. seq.generate(std::begin(seed_material), std::end(seed_material));
  127. EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
  128. }
  129. {
  130. int64_t seed_material[kNumBlocks];
  131. seq.generate(std::begin(seed_material), std::end(seed_material));
  132. EXPECT_THAT(seed_material, Pointwise(Eq(), expected));
  133. }
  134. }
  135. } // namespace