Random.cpp 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2020, Peter Elliott <pelliott@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/Singleton.h>
  8. #include <Kernel/Arch/Processor.h>
  9. #if ARCH(X86_64)
  10. # include <Kernel/Arch/x86_64/Time/HPET.h>
  11. # include <Kernel/Arch/x86_64/Time/RTC.h>
  12. #elif ARCH(AARCH64)
  13. # include <Kernel/Arch/aarch64/ASM_wrapper.h>
  14. #endif
  15. #include <Kernel/Devices/Generic/RandomDevice.h>
  16. #include <Kernel/Random.h>
  17. #include <Kernel/Sections.h>
  18. #include <Kernel/Time/TimeManagement.h>
  19. namespace Kernel {
  20. static Singleton<KernelRng> s_the;
  21. static Atomic<u32, AK::MemoryOrder::memory_order_relaxed> s_next_random_value = 1;
  22. KernelRng& KernelRng::the()
  23. {
  24. return *s_the;
  25. }
  26. UNMAP_AFTER_INIT KernelRng::KernelRng()
  27. {
  28. #if ARCH(X86_64)
  29. if (Processor::current().has_feature(CPUFeature::RDSEED)) {
  30. dmesgln("KernelRng: Using RDSEED as entropy source");
  31. for (size_t i = 0; i < pool_count * reseed_threshold; ++i) {
  32. add_random_event(Kernel::read_rdseed(), i % 32);
  33. }
  34. } else if (Processor::current().has_feature(CPUFeature::RDRAND)) {
  35. dmesgln("KernelRng: Using RDRAND as entropy source");
  36. for (size_t i = 0; i < pool_count * reseed_threshold; ++i) {
  37. add_random_event(Kernel::read_rdrand(), i % 32);
  38. }
  39. } else if (TimeManagement::the().can_query_precise_time()) {
  40. // Add HPET as entropy source if we don't have anything better.
  41. dmesgln("KernelRng: Using HPET as entropy source");
  42. for (size_t i = 0; i < pool_count * reseed_threshold; ++i) {
  43. u64 hpet_time = HPET::the().read_main_counter_unsafe();
  44. add_random_event(hpet_time, i % 32);
  45. }
  46. } else {
  47. // Fallback to RTC
  48. dmesgln("KernelRng: Using RTC as entropy source (bad!)");
  49. auto current_time = static_cast<u64>(RTC::now());
  50. for (size_t i = 0; i < pool_count * reseed_threshold; ++i) {
  51. add_random_event(current_time, i % 32);
  52. current_time *= 0x574au;
  53. current_time += 0x40b2u;
  54. }
  55. }
  56. #elif ARCH(AARCH64)
  57. if (Processor::current().has_feature(CPUFeature::RNG)) {
  58. dmesgln("KernelRng: Using RNDRRS as entropy source");
  59. for (size_t i = 0; i < pool_count * reseed_threshold; ++i) {
  60. add_random_event(Aarch64::Asm::read_rndrrs(), i % 32);
  61. }
  62. } else {
  63. // Fallback to TimeManagement as entropy
  64. dmesgln("KernelRng: Using bad entropy source TimeManagement");
  65. auto current_time = static_cast<u64>(TimeManagement::the().now().to_milliseconds());
  66. for (size_t i = 0; i < pool_count * reseed_threshold; ++i) {
  67. add_random_event(current_time, i % 32);
  68. current_time *= 0x574au;
  69. current_time += 0x40b2u;
  70. }
  71. }
  72. #else
  73. dmesgln("KernelRng: No entropy source available!");
  74. #endif
  75. }
  76. void KernelRng::wait_for_entropy()
  77. {
  78. SpinlockLocker lock(get_lock());
  79. if (!is_ready()) {
  80. dbgln("Entropy starvation...");
  81. m_seed_queue.wait_forever("KernelRng"sv);
  82. }
  83. }
  84. void KernelRng::wake_if_ready()
  85. {
  86. VERIFY(get_lock().is_locked());
  87. if (is_ready()) {
  88. m_seed_queue.wake_all();
  89. }
  90. }
  91. size_t EntropySource::next_source { static_cast<size_t>(EntropySource::Static::MaxHardcodedSourceIndex) };
  92. static void do_get_fast_random_bytes(Bytes buffer)
  93. {
  94. union {
  95. u8 bytes[4];
  96. u32 value;
  97. } u;
  98. size_t offset = 4;
  99. for (size_t i = 0; i < buffer.size(); ++i) {
  100. if (offset >= 4) {
  101. auto current_next = s_next_random_value.load();
  102. for (;;) {
  103. auto new_next = current_next * 1103515245 + 12345;
  104. if (s_next_random_value.compare_exchange_strong(current_next, new_next)) {
  105. u.value = new_next;
  106. break;
  107. }
  108. }
  109. offset = 0;
  110. }
  111. buffer[i] = u.bytes[offset++];
  112. }
  113. }
  114. bool get_good_random_bytes(Bytes buffer, bool allow_wait, bool fallback_to_fast)
  115. {
  116. bool result = false;
  117. auto& kernel_rng = KernelRng::the();
  118. // FIXME: What if interrupts are disabled because we're in an interrupt?
  119. bool can_wait = Processor::are_interrupts_enabled();
  120. if (!can_wait && allow_wait) {
  121. // If we can't wait but the caller would be ok with it, then we
  122. // need to definitely fallback to *something*, even if it's less
  123. // secure...
  124. fallback_to_fast = true;
  125. }
  126. if (can_wait && allow_wait) {
  127. for (;;) {
  128. {
  129. if (kernel_rng.get_random_bytes(buffer)) {
  130. result = true;
  131. break;
  132. }
  133. }
  134. kernel_rng.wait_for_entropy();
  135. }
  136. } else {
  137. // We can't wait/block here, or we are not allowed to block/wait
  138. if (kernel_rng.get_random_bytes(buffer)) {
  139. result = true;
  140. } else if (fallback_to_fast) {
  141. // If interrupts are disabled
  142. do_get_fast_random_bytes(buffer);
  143. result = true;
  144. }
  145. }
  146. // NOTE: The only case where this function should ever return false and
  147. // not actually return random data is if fallback_to_fast == false and
  148. // allow_wait == false and interrupts are enabled!
  149. VERIFY(result || !fallback_to_fast);
  150. return result;
  151. }
  152. void get_fast_random_bytes(Bytes buffer)
  153. {
  154. // Try to get good randomness, but don't block if we can't right now
  155. // and allow falling back to fast randomness
  156. auto result = get_good_random_bytes(buffer, false, true);
  157. VERIFY(result);
  158. }
  159. }