1*9507f98cSAndroid Build Coastguard Worker // Copyright (c) 2011 The LevelDB Authors. All rights reserved. 2*9507f98cSAndroid Build Coastguard Worker // Use of this source code is governed by a BSD-style license that can be 3*9507f98cSAndroid Build Coastguard Worker // found in the LICENSE file. See the AUTHORS file for names of contributors. 4*9507f98cSAndroid Build Coastguard Worker 5*9507f98cSAndroid Build Coastguard Worker #ifndef STORAGE_LEVELDB_UTIL_RANDOM_H_ 6*9507f98cSAndroid Build Coastguard Worker #define STORAGE_LEVELDB_UTIL_RANDOM_H_ 7*9507f98cSAndroid Build Coastguard Worker 8*9507f98cSAndroid Build Coastguard Worker #include <cstdint> 9*9507f98cSAndroid Build Coastguard Worker 10*9507f98cSAndroid Build Coastguard Worker namespace leveldb { 11*9507f98cSAndroid Build Coastguard Worker 12*9507f98cSAndroid Build Coastguard Worker // A very simple random number generator. Not especially good at 13*9507f98cSAndroid Build Coastguard Worker // generating truly random bits, but good enough for our needs in this 14*9507f98cSAndroid Build Coastguard Worker // package. 15*9507f98cSAndroid Build Coastguard Worker class Random { 16*9507f98cSAndroid Build Coastguard Worker private: 17*9507f98cSAndroid Build Coastguard Worker uint32_t seed_; 18*9507f98cSAndroid Build Coastguard Worker 19*9507f98cSAndroid Build Coastguard Worker public: Random(uint32_t s)20*9507f98cSAndroid Build Coastguard Worker explicit Random(uint32_t s) : seed_(s & 0x7fffffffu) { 21*9507f98cSAndroid Build Coastguard Worker // Avoid bad seeds. 22*9507f98cSAndroid Build Coastguard Worker if (seed_ == 0 || seed_ == 2147483647L) { 23*9507f98cSAndroid Build Coastguard Worker seed_ = 1; 24*9507f98cSAndroid Build Coastguard Worker } 25*9507f98cSAndroid Build Coastguard Worker } Next()26*9507f98cSAndroid Build Coastguard Worker uint32_t Next() { 27*9507f98cSAndroid Build Coastguard Worker static const uint32_t M = 2147483647L; // 2^31-1 28*9507f98cSAndroid Build Coastguard Worker static const uint64_t A = 16807; // bits 14, 8, 7, 5, 2, 1, 0 29*9507f98cSAndroid Build Coastguard Worker // We are computing 30*9507f98cSAndroid Build Coastguard Worker // seed_ = (seed_ * A) % M, where M = 2^31-1 31*9507f98cSAndroid Build Coastguard Worker // 32*9507f98cSAndroid Build Coastguard Worker // seed_ must not be zero or M, or else all subsequent computed values 33*9507f98cSAndroid Build Coastguard Worker // will be zero or M respectively. For all other values, seed_ will end 34*9507f98cSAndroid Build Coastguard Worker // up cycling through every number in [1,M-1] 35*9507f98cSAndroid Build Coastguard Worker uint64_t product = seed_ * A; 36*9507f98cSAndroid Build Coastguard Worker 37*9507f98cSAndroid Build Coastguard Worker // Compute (product % M) using the fact that ((x << 31) % M) == x. 38*9507f98cSAndroid Build Coastguard Worker seed_ = static_cast<uint32_t>((product >> 31) + (product & M)); 39*9507f98cSAndroid Build Coastguard Worker // The first reduction may overflow by 1 bit, so we may need to 40*9507f98cSAndroid Build Coastguard Worker // repeat. mod == M is not possible; using > allows the faster 41*9507f98cSAndroid Build Coastguard Worker // sign-bit-based test. 42*9507f98cSAndroid Build Coastguard Worker if (seed_ > M) { 43*9507f98cSAndroid Build Coastguard Worker seed_ -= M; 44*9507f98cSAndroid Build Coastguard Worker } 45*9507f98cSAndroid Build Coastguard Worker return seed_; 46*9507f98cSAndroid Build Coastguard Worker } 47*9507f98cSAndroid Build Coastguard Worker // Returns a uniformly distributed value in the range [0..n-1] 48*9507f98cSAndroid Build Coastguard Worker // REQUIRES: n > 0 Uniform(int n)49*9507f98cSAndroid Build Coastguard Worker uint32_t Uniform(int n) { return Next() % n; } 50*9507f98cSAndroid Build Coastguard Worker 51*9507f98cSAndroid Build Coastguard Worker // Randomly returns true ~"1/n" of the time, and false otherwise. 52*9507f98cSAndroid Build Coastguard Worker // REQUIRES: n > 0 OneIn(int n)53*9507f98cSAndroid Build Coastguard Worker bool OneIn(int n) { return (Next() % n) == 0; } 54*9507f98cSAndroid Build Coastguard Worker 55*9507f98cSAndroid Build Coastguard Worker // Skewed: pick "base" uniformly from range [0,max_log] and then 56*9507f98cSAndroid Build Coastguard Worker // return "base" random bits. The effect is to pick a number in the 57*9507f98cSAndroid Build Coastguard Worker // range [0,2^max_log-1] with exponential bias towards smaller numbers. Skewed(int max_log)58*9507f98cSAndroid Build Coastguard Worker uint32_t Skewed(int max_log) { return Uniform(1 << Uniform(max_log + 1)); } 59*9507f98cSAndroid Build Coastguard Worker }; 60*9507f98cSAndroid Build Coastguard Worker 61*9507f98cSAndroid Build Coastguard Worker } // namespace leveldb 62*9507f98cSAndroid Build Coastguard Worker 63*9507f98cSAndroid Build Coastguard Worker #endif // STORAGE_LEVELDB_UTIL_RANDOM_H_ 64