Home
last modified time | relevance | path

Searched refs:RandenTraits (Results 1 - 7 of 7) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dranden.h36 static constexpr size_t kStateBytes = RandenTraits::kStateBytes;
37 static constexpr size_t kCapacityBytes = RandenTraits::kCapacityBytes;
38 static constexpr size_t kSeedBytes = RandenTraits::kSeedBytes;
70 static_assert(M * sizeof(S) == RandenTraits::kSeedBytes,
73 static_assert(N * sizeof(T) == RandenTraits::kStateBytes,
H A Dranden_slow_test.cc26 using absl::random_internal::RandenTraits;
30 RandenTraits::kStateBytes - RandenTraits::kCapacityBytes;
31 constexpr size_t kStateSizeT = RandenTraits::kStateBytes / sizeof(uint64_t);
H A Dranden_traits.h54 // RandenTraits contains the basic algorithm traits, such as the size of the
56 struct RandenTraits { struct
81 extern const unsigned char kRandenRoundKeys[RandenTraits::kKeyBytes];
82 extern const unsigned char kRandenRoundKeysBE[RandenTraits::kKeyBytes];
H A Dranden_hwaes_test.cc28 using absl::random_internal::RandenTraits;
32 RandenTraits::kStateBytes - RandenTraits::kCapacityBytes;
33 constexpr size_t kStateSizeT = RandenTraits::kStateBytes / sizeof(uint64_t);
H A Dranden_hwaes.cc92 using absl::random_internal::RandenTraits;
156 for (uint32_t block = 0; block < RandenTraits::kFeistelBlocks; ++block) {
281 static_assert(RandenTraits::kFeistelBlocks == 16,
284 constexpr size_t shuffle[RandenTraits::kFeistelBlocks] = {
330 static_assert(RandenTraits::kFeistelBlocks == 16,
396 for (size_t round = 0; round < RandenTraits::kFeistelRounds; ++round) {
423 static_assert(RandenTraits::kCapacityBytes / sizeof(Vector128) == 1,
425 static_assert(RandenTraits::kStateBytes / sizeof(Vector128) == 16,
498 static_assert(RandenTraits::kCapacityBytes == sizeof(Vector128),
H A Dranden_slow.cc301 using ::absl::random_internal::RandenTraits;
306 static_assert(RandenTraits::kFeistelBlocks == 16, in BlockShuffle()
309 constexpr size_t shuffle[RandenTraits::kFeistelBlocks] = { in BlockShuffle()
315 absl::uint128 source[RandenTraits::kFeistelBlocks]; in BlockShuffle()
317 for (size_t i = 0; i < RandenTraits::kFeistelBlocks; i++) { in BlockShuffle()
366 for (size_t branch = 0; branch < RandenTraits::kFeistelBlocks; branch += 4) { in FeistelRound()
392 for (size_t round = 0; round < RandenTraits::kFeistelRounds; ++round) { in Permute()
422 RandenTraits::kCapacityBytes / sizeof(uint64_t); in Absorb()
424 kCapacityBlocks * sizeof(uint64_t) == RandenTraits::kCapacityBytes, in Absorb()
428 i < RandenTraits in Absorb()
[all...]
H A Dpool_urbg.cc52 static constexpr size_t kState = RandenTraits::kStateBytes / sizeof(uint32_t);
54 RandenTraits::kCapacityBytes / sizeof(uint32_t);
211 RandenTraits::kStateBytes / sizeof(uint32_t); in InitPoolURBG()

Completed in 4 milliseconds