random_pcg.h 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /**************************************************************************/
  2. /* random_pcg.h */
  3. /**************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /**************************************************************************/
  8. /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
  9. /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /**************************************************************************/
  30. #pragma once
  31. #include "core/math/math_funcs.h"
  32. #include "thirdparty/misc/pcg.h"
  33. #if defined(__GNUC__)
  34. #define CLZ32(x) __builtin_clz(x)
  35. #elif defined(_MSC_VER)
  36. #include <intrin.h>
  37. static int __bsr_clz32(uint32_t x) {
  38. unsigned long index;
  39. _BitScanReverse(&index, x);
  40. return 31 - index;
  41. }
  42. #define CLZ32(x) __bsr_clz32(x)
  43. #endif
  44. template <typename T>
  45. class Vector;
  46. class RandomPCG {
  47. pcg32_random_t pcg;
  48. uint64_t current_seed = 0; // The seed the current generator state started from.
  49. uint64_t current_inc = 0;
  50. public:
  51. static const uint64_t DEFAULT_SEED = 12047754176567800795U;
  52. static const uint64_t DEFAULT_INC = PCG_DEFAULT_INC_64;
  53. RandomPCG(uint64_t p_seed = DEFAULT_SEED, uint64_t p_inc = DEFAULT_INC);
  54. _FORCE_INLINE_ void seed(uint64_t p_seed) {
  55. current_seed = p_seed;
  56. pcg32_srandom_r(&pcg, current_seed, current_inc);
  57. }
  58. _FORCE_INLINE_ uint64_t get_seed() { return current_seed; }
  59. _FORCE_INLINE_ void set_state(uint64_t p_state) { pcg.state = p_state; }
  60. _FORCE_INLINE_ uint64_t get_state() const { return pcg.state; }
  61. void randomize();
  62. _FORCE_INLINE_ uint32_t rand() {
  63. return pcg32_random_r(&pcg);
  64. }
  65. _FORCE_INLINE_ uint32_t rand(uint32_t bounds) {
  66. return pcg32_boundedrand_r(&pcg, bounds);
  67. }
  68. int64_t rand_weighted(const Vector<float> &p_weights);
  69. // Obtaining floating point numbers in [0, 1] range with "good enough" uniformity.
  70. // These functions sample the output of rand() as the fraction part of an infinite binary number,
  71. // with some tricks applied to reduce ops and branching:
  72. // 1. Instead of shifting to the first 1 and connecting random bits, we simply set the MSB and LSB to 1.
  73. // Provided that the RNG is actually uniform bit by bit, this should have the exact same effect.
  74. // 2. In order to compensate for exponent info loss, we count zeros from another random number,
  75. // and just add that to the initial offset.
  76. // This has the same probability as counting and shifting an actual bit stream: 2^-n for n zeroes.
  77. // For all numbers above 2^-96 (2^-64 for floats), the functions should be uniform.
  78. // However, all numbers below that threshold are floored to 0.
  79. // The thresholds are chosen to minimize rand() calls while keeping the numbers within a totally subjective quality standard.
  80. // If clz or ldexp isn't available, fall back to bit truncation for performance, sacrificing uniformity.
  81. _FORCE_INLINE_ double randd() {
  82. #if defined(CLZ32)
  83. uint32_t proto_exp_offset = rand();
  84. if (unlikely(proto_exp_offset == 0)) {
  85. return 0;
  86. }
  87. uint64_t significand = (((uint64_t)rand()) << 32) | rand() | 0x8000000000000001U;
  88. return std::ldexp((double)significand, -64 - CLZ32(proto_exp_offset));
  89. #else
  90. #pragma message("RandomPCG::randd - intrinsic clz is not available, falling back to bit truncation")
  91. return (double)(((((uint64_t)rand()) << 32) | rand()) & 0x1FFFFFFFFFFFFFU) / (double)0x1FFFFFFFFFFFFFU;
  92. #endif
  93. }
  94. _FORCE_INLINE_ float randf() {
  95. #if defined(CLZ32)
  96. uint32_t proto_exp_offset = rand();
  97. if (unlikely(proto_exp_offset == 0)) {
  98. return 0;
  99. }
  100. return std::ldexp((float)(rand() | 0x80000001), -32 - CLZ32(proto_exp_offset));
  101. #else
  102. #pragma message("RandomPCG::randf - intrinsic clz is not available, falling back to bit truncation")
  103. return (float)(rand() & 0xFFFFFF) / (float)0xFFFFFF;
  104. #endif
  105. }
  106. _FORCE_INLINE_ double randfn(double p_mean, double p_deviation) {
  107. double temp = randd();
  108. if (temp < CMP_EPSILON) {
  109. temp += CMP_EPSILON; // To prevent generating of INF value in log function, resulting to return NaN value from this function.
  110. }
  111. return p_mean + p_deviation * (std::cos(Math::TAU * randd()) * std::sqrt(-2.0 * std::log(temp))); // Box-Muller transform.
  112. }
  113. _FORCE_INLINE_ float randfn(float p_mean, float p_deviation) {
  114. float temp = randf();
  115. if (temp < CMP_EPSILON) {
  116. temp += CMP_EPSILON; // To prevent generating of INF value in log function, resulting to return NaN value from this function.
  117. }
  118. return p_mean + p_deviation * (std::cos((float)Math::TAU * randf()) * std::sqrt(-2.0 * std::log(temp))); // Box-Muller transform.
  119. }
  120. double random(double p_from, double p_to);
  121. float random(float p_from, float p_to);
  122. int random(int p_from, int p_to);
  123. };