/* Copyright 2023 The TensorFlow Authors. All Rights Reserved. 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 "tensorflow/lite/kernels/rng_util.h" #include <array> #include <cstdint> namespace tflite { namespace rng { // 0x1BD11BDA is a parity constant specified by the ThreeFry2x32 algorithm. static constexpr uint32_t kThreefryParity = …; // Constants specified by the Philox algorithm. static constexpr uint64_t kPhiloxM4x32A = …; static constexpr uint64_t kPhiloxM4x32B = …; static constexpr uint32_t kPhiloxW32A = …; static constexpr uint32_t kPhiloxW32B = …; // Implements the ThreeFry counter-based PRNG algorithm. Use 20 rounds. // Salmon et al. SC 2011. Parallel random numbers: as easy as 1, 2, 3. // http://www.thesalmons.org/john/random123/papers/random123sc11.pdf std::array<uint32_t, 2> Threefry2x32(uint32_t key_0, uint32_t key_1, std::array<uint32_t, 2> ctr) { … } // Implements the Philox4x32 counter-based PRNG algorithm. Use 10 rounds. // Salmon et al. SC 2011. Parallel random numbers: as easy as 1, 2, 3. // http://www.thesalmons.org/john/random123/papers/random123sc11.pdf std::array<uint32_t, 4> Philox4x32(uint32_t key_0, uint32_t key_1, std::array<uint32_t, 4> ctr) { … } } // namespace rng } // namespace tflite
Codebase Browser
chromium