1 /* SPDX-License-Identifier: LGPL-2.1+ */
3 #if defined(__i386__) || defined(__x86_64__)
17 # include <sys/auxv.h>
21 # include <sys/random.h>
23 # include <linux/random.h>
26 #include "alloc-util.h"
30 #include "random-util.h"
31 #include "time-util.h"
33 int rdrand(unsigned long *ret
) {
35 #if defined(__i386__) || defined(__x86_64__)
36 static int have_rdrand
= -1;
39 if (have_rdrand
< 0) {
40 uint32_t eax
, ebx
, ecx
, edx
;
42 /* Check if RDRAND is supported by the CPU */
43 if (__get_cpuid(1, &eax
, &ebx
, &ecx
, &edx
) == 0) {
48 /* Compat with old gcc where bit_RDRND didn't exist yet */
50 #define bit_RDRND (1U << 30)
53 have_rdrand
= !!(ecx
& bit_RDRND
);
59 asm volatile("rdrand %0;"
63 msan_unpoison(&err
, sizeof(err
));
73 int genuine_random_bytes(void *p
, size_t n
, RandomFlags flags
) {
74 static int have_syscall
= -1;
75 _cleanup_close_
int fd
= -1;
76 bool got_some
= false;
79 /* Gathers some randomness from the kernel (or the CPU if the RANDOM_ALLOW_RDRAND flag is set). This
80 * call won't block, unless the RANDOM_BLOCK flag is set. If RANDOM_MAY_FAIL is set, an error is
81 * returned if the random pool is not initialized. Otherwise it will always return some data from the
82 * kernel, regardless of whether the random pool is fully initialized or not. */
87 if (FLAGS_SET(flags
, RANDOM_ALLOW_RDRAND
))
88 /* Try x86-64' RDRAND intrinsic if we have it. We only use it if high quality randomness is
89 * not required, as we don't trust it (who does?). Note that we only do a single iteration of
90 * RDRAND here, even though the Intel docs suggest calling this in a tight loop of 10
91 * invocations or so. That's because we don't really care about the quality here. We
92 * generally prefer using RDRAND if the caller allows us to, since this way we won't upset
93 * the kernel's random subsystem by accessing it before the pool is initialized (after all it
94 * will kmsg log about every attempt to do so)..*/
100 if (got_some
&& FLAGS_SET(flags
, RANDOM_EXTEND_WITH_PSEUDO
)) {
101 /* Fill in the remaining bytes using pseudo-random values */
102 pseudo_random_bytes(p
, n
);
106 /* OK, this didn't work, let's go to getrandom() + /dev/urandom instead */
110 m
= MIN(sizeof(u
), n
);
113 p
= (uint8_t*) p
+ m
;
117 return 0; /* Yay, success! */
122 /* Use the getrandom() syscall unless we know we don't have it. */
123 if (have_syscall
!= 0 && !HAS_FEATURE_MEMORY_SANITIZER
) {
126 r
= getrandom(p
, n
, FLAGS_SET(flags
, RANDOM_BLOCK
) ? 0 : GRND_NONBLOCK
);
131 return 0; /* Yay, success! */
133 assert((size_t) r
< n
);
134 p
= (uint8_t*) p
+ r
;
137 if (FLAGS_SET(flags
, RANDOM_EXTEND_WITH_PSEUDO
)) {
138 /* Fill in the remaining bytes using pseudo-random values */
139 pseudo_random_bytes(p
, n
);
145 /* Hmm, we didn't get enough good data but the caller insists on good data? Then try again */
146 if (FLAGS_SET(flags
, RANDOM_BLOCK
))
149 /* Fill in the rest with /dev/urandom */
156 } else if (errno
== ENOSYS
) {
157 /* We lack the syscall, continue with reading from /dev/urandom. */
158 have_syscall
= false;
161 } else if (errno
== EAGAIN
) {
162 /* The kernel has no entropy whatsoever. Let's remember to use the syscall
163 * the next time again though.
165 * If RANDOM_MAY_FAIL is set, return an error so that random_bytes() can
166 * produce some pseudo-random bytes instead. Otherwise, fall back to
167 * /dev/urandom, which we know is empty, but the kernel will produce some
168 * bytes for us on a best-effort basis. */
171 if (got_some
&& FLAGS_SET(flags
, RANDOM_EXTEND_WITH_PSEUDO
)) {
172 /* Fill in the remaining bytes using pseudorandom values */
173 pseudo_random_bytes(p
, n
);
177 if (FLAGS_SET(flags
, RANDOM_MAY_FAIL
))
180 /* Use /dev/urandom instead */
187 fd
= open("/dev/urandom", O_RDONLY
|O_CLOEXEC
|O_NOCTTY
);
189 return errno
== ENOENT
? -ENOSYS
: -errno
;
191 return loop_read_exact(fd
, p
, n
, true);
194 void initialize_srand(void) {
195 static bool srand_called
= false;
206 /* The kernel provides us with 16 bytes of entropy in auxv, so let's
207 * try to make use of that to seed the pseudo-random generator. It's
208 * better than nothing... */
210 auxv
= (const void*) getauxval(AT_RANDOM
);
212 assert_cc(sizeof(x
) <= 16);
213 memcpy(&x
, auxv
, sizeof(x
));
218 x
^= (unsigned) now(CLOCK_REALTIME
);
219 x
^= (unsigned) gettid();
228 /* INT_MAX gives us only 31 bits, so use 24 out of that. */
229 #if RAND_MAX >= INT_MAX
232 /* SHORT_INT_MAX or lower gives at most 15 bits, we just just 8 out of that. */
236 void pseudo_random_bytes(void *p
, size_t n
) {
241 for (q
= p
; q
< (uint8_t*) p
+ n
; q
+= RAND_STEP
) {
244 rr
= (unsigned) rand();
247 if ((size_t) (q
- (uint8_t*) p
+ 2) < n
)
251 if ((size_t) (q
- (uint8_t*) p
+ 1) < n
)
258 void random_bytes(void *p
, size_t n
) {
260 if (genuine_random_bytes(p
, n
, RANDOM_EXTEND_WITH_PSEUDO
|RANDOM_MAY_FAIL
|RANDOM_ALLOW_RDRAND
) >= 0)
263 /* If for some reason some user made /dev/urandom unavailable to us, or the kernel has no entropy, use a PRNG instead. */
264 pseudo_random_bytes(p
, n
);