kushi.p@gmail.com | e486977 | 2011-04-22 22:13:07 +0900 | [diff] [blame] | 1 | // Copyright (c) 2011 The Chromium Authors. All rights reserved. |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
| 5 | #include "base/rand_util.h" |
| 6 | |
| 7 | #include <math.h> |
tfarina | 0dae636 | 2015-05-19 07:14:09 +0900 | [diff] [blame] | 8 | #include <stdint.h> |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 9 | |
scottmg@chromium.org | fd621b9 | 2013-10-16 05:29:03 +0900 | [diff] [blame] | 10 | #include <algorithm> |
mark@chromium.org | c22c62b | 2008-09-30 23:26:33 +0900 | [diff] [blame] | 11 | #include <limits> |
| 12 | |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 13 | #include "base/logging.h" |
avi@chromium.org | 68a745c | 2013-06-11 05:11:14 +0900 | [diff] [blame] | 14 | #include "base/strings/string_util.h" |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 15 | |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 16 | namespace base { |
| 17 | |
| 18 | int RandInt(int min, int max) { |
kushi.p@gmail.com | e486977 | 2011-04-22 22:13:07 +0900 | [diff] [blame] | 19 | DCHECK_LE(min, max); |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 20 | |
Nico Weber | 1796efe | 2015-10-30 05:42:58 +0900 | [diff] [blame] | 21 | uint64_t range = static_cast<uint64_t>(max) - min + 1; |
| 22 | // |range| is at most UINT_MAX + 1, so the result of RandGenerator(range) |
| 23 | // is at most UINT_MAX. Hence it's safe to cast it from uint64_t to int64_t. |
| 24 | int result = |
| 25 | static_cast<int>(min + static_cast<int64_t>(base::RandGenerator(range))); |
kushi.p@gmail.com | 381e966 | 2011-05-04 10:29:38 +0900 | [diff] [blame] | 26 | DCHECK_GE(result, min); |
| 27 | DCHECK_LE(result, max); |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 28 | return result; |
| 29 | } |
| 30 | |
| 31 | double RandDouble() { |
joi@chromium.org | df3561d | 2011-05-11 02:18:53 +0900 | [diff] [blame] | 32 | return BitsToOpenEndedUnitInterval(base::RandUint64()); |
| 33 | } |
| 34 | |
Nico Weber | 1796efe | 2015-10-30 05:42:58 +0900 | [diff] [blame] | 35 | double BitsToOpenEndedUnitInterval(uint64_t bits) { |
mark@chromium.org | c22c62b | 2008-09-30 23:26:33 +0900 | [diff] [blame] | 36 | // We try to get maximum precision by masking out as many bits as will fit |
| 37 | // in the target type's mantissa, and raising it to an appropriate power to |
| 38 | // produce output in the range [0, 1). For IEEE 754 doubles, the mantissa |
| 39 | // is expected to accommodate 53 bits. |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 40 | |
avi | 486c61f | 2015-11-24 23:26:24 +0900 | [diff] [blame] | 41 | static_assert(std::numeric_limits<double>::radix == 2, |
| 42 | "otherwise use scalbn"); |
mark@chromium.org | c22c62b | 2008-09-30 23:26:33 +0900 | [diff] [blame] | 43 | static const int kBits = std::numeric_limits<double>::digits; |
Nico Weber | 1796efe | 2015-10-30 05:42:58 +0900 | [diff] [blame] | 44 | uint64_t random_bits = bits & ((UINT64_C(1) << kBits) - 1); |
mark@chromium.org | c22c62b | 2008-09-30 23:26:33 +0900 | [diff] [blame] | 45 | double result = ldexp(static_cast<double>(random_bits), -1 * kBits); |
kushi.p@gmail.com | 381e966 | 2011-05-04 10:29:38 +0900 | [diff] [blame] | 46 | DCHECK_GE(result, 0.0); |
| 47 | DCHECK_LT(result, 1.0); |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 48 | return result; |
| 49 | } |
| 50 | |
Nico Weber | 1796efe | 2015-10-30 05:42:58 +0900 | [diff] [blame] | 51 | uint64_t RandGenerator(uint64_t range) { |
dilmah@chromium.org | bd36573 | 2011-08-25 04:58:36 +0900 | [diff] [blame] | 52 | DCHECK_GT(range, 0u); |
joi@chromium.org | edf24fc | 2011-05-31 02:39:09 +0900 | [diff] [blame] | 53 | // We must discard random results above this number, as they would |
| 54 | // make the random generator non-uniform (consider e.g. if |
dilmah@chromium.org | bd36573 | 2011-08-25 04:58:36 +0900 | [diff] [blame] | 55 | // MAX_UINT64 was 7 and |range| was 5, then a result of 1 would be twice |
| 56 | // as likely as a result of 3 or 4). |
Nico Weber | 1796efe | 2015-10-30 05:42:58 +0900 | [diff] [blame] | 57 | uint64_t max_acceptable_value = |
| 58 | (std::numeric_limits<uint64_t>::max() / range) * range - 1; |
joi@chromium.org | edf24fc | 2011-05-31 02:39:09 +0900 | [diff] [blame] | 59 | |
Nico Weber | 1796efe | 2015-10-30 05:42:58 +0900 | [diff] [blame] | 60 | uint64_t value; |
joi@chromium.org | edf24fc | 2011-05-31 02:39:09 +0900 | [diff] [blame] | 61 | do { |
| 62 | value = base::RandUint64(); |
dilmah@chromium.org | bd36573 | 2011-08-25 04:58:36 +0900 | [diff] [blame] | 63 | } while (value > max_acceptable_value); |
joi@chromium.org | edf24fc | 2011-05-31 02:39:09 +0900 | [diff] [blame] | 64 | |
dilmah@chromium.org | bd36573 | 2011-08-25 04:58:36 +0900 | [diff] [blame] | 65 | return value % range; |
isherman@chromium.org | 01eaa0b | 2010-08-31 06:07:05 +0900 | [diff] [blame] | 66 | } |
| 67 | |
qsr@google.com | fbda4d5 | 2011-05-05 17:46:11 +0900 | [diff] [blame] | 68 | std::string RandBytesAsString(size_t length) { |
pkasting@chromium.org | d347937 | 2011-11-30 05:06:18 +0900 | [diff] [blame] | 69 | DCHECK_GT(length, 0u); |
qsr@google.com | fbda4d5 | 2011-05-05 17:46:11 +0900 | [diff] [blame] | 70 | std::string result; |
| 71 | RandBytes(WriteInto(&result, length + 1), length); |
abarth@chromium.org | c19cb31 | 2011-04-30 06:03:54 +0900 | [diff] [blame] | 72 | return result; |
| 73 | } |
| 74 | |
mark@chromium.org | b93c054 | 2008-09-30 07:18:01 +0900 | [diff] [blame] | 75 | } // namespace base |