14db9ae91SMark Murray /*- 2095db7e6SConrad Meyer * Copyright (c) 2017 Oliver Pinter 3d1b06863SMark Murray * Copyright (c) 2000-2015 Mark R V Murray 44db9ae91SMark Murray * All rights reserved. 54db9ae91SMark Murray * 64db9ae91SMark Murray * Redistribution and use in source and binary forms, with or without 74db9ae91SMark Murray * modification, are permitted provided that the following conditions 84db9ae91SMark Murray * are met: 94db9ae91SMark Murray * 1. Redistributions of source code must retain the above copyright 104db9ae91SMark Murray * notice, this list of conditions and the following disclaimer 114db9ae91SMark Murray * in this position and unchanged. 124db9ae91SMark Murray * 2. Redistributions in binary form must reproduce the above copyright 134db9ae91SMark Murray * notice, this list of conditions and the following disclaimer in the 144db9ae91SMark Murray * documentation and/or other materials provided with the distribution. 154db9ae91SMark Murray * 164db9ae91SMark Murray * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 174db9ae91SMark Murray * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 184db9ae91SMark Murray * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 194db9ae91SMark Murray * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 204db9ae91SMark Murray * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 214db9ae91SMark Murray * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 224db9ae91SMark Murray * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 234db9ae91SMark Murray * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 244db9ae91SMark Murray * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 254db9ae91SMark Murray * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 264db9ae91SMark Murray * 274db9ae91SMark Murray */ 284db9ae91SMark Murray 29aad970f1SDavid E. O'Brien #include <sys/cdefs.h> 30aad970f1SDavid E. O'Brien __FBSDID("$FreeBSD$"); 31aad970f1SDavid E. O'Brien 324db9ae91SMark Murray #include <sys/param.h> 334db9ae91SMark Murray #include <sys/systm.h> 34fb919e4dSMark Murray #include <sys/bus.h> 354db9ae91SMark Murray #include <sys/conf.h> 364db9ae91SMark Murray #include <sys/fcntl.h> 37fb919e4dSMark Murray #include <sys/filio.h> 384db9ae91SMark Murray #include <sys/kernel.h> 3902c986abSMark Murray #include <sys/kthread.h> 40fb919e4dSMark Murray #include <sys/lock.h> 4141ee9f1cSPoul-Henning Kamp #include <sys/module.h> 4210cb2424SMark Murray #include <sys/malloc.h> 43d1b06863SMark Murray #include <sys/poll.h> 44b40ce416SJulian Elischer #include <sys/proc.h> 45f02e47dcSMark Murray #include <sys/random.h> 46d1b06863SMark Murray #include <sys/sbuf.h> 47d1b06863SMark Murray #include <sys/selinfo.h> 4810cb2424SMark Murray #include <sys/sysctl.h> 4910cb2424SMark Murray #include <sys/systm.h> 50fb919e4dSMark Murray #include <sys/uio.h> 5102c986abSMark Murray #include <sys/unistd.h> 524db9ae91SMark Murray 53d1b06863SMark Murray #include <crypto/rijndael/rijndael-api-fst.h> 547a3f5d11SAllan Jude #include <crypto/sha2/sha256.h> 55d1b06863SMark Murray 56d1b06863SMark Murray #include <dev/random/hash.h> 5702c986abSMark Murray #include <dev/random/randomdev.h> 58095ed2c9SMark Murray #include <dev/random/random_harvestq.h> 594db9ae91SMark Murray 603aa77530SMark Murray #define RANDOM_UNIT 0 61e7806b4cSMark Murray 62*3ee1d5bbSConrad Meyer /* 63*3ee1d5bbSConrad Meyer * In loadable random, the core randomdev.c / random(9) routines have static 64*3ee1d5bbSConrad Meyer * visibility and an alternative name to avoid conflicting with the function 65*3ee1d5bbSConrad Meyer * pointers of the real names in the core kernel. random_alg_context_init 66*3ee1d5bbSConrad Meyer * installs pointers to the loadable static names into the core kernel's 67*3ee1d5bbSConrad Meyer * function pointers at SI_SUB_RANDOM:SI_ORDER_SECOND. 68*3ee1d5bbSConrad Meyer */ 69646041a8SMark Murray #if defined(RANDOM_LOADABLE) 70*3ee1d5bbSConrad Meyer static int (read_random_uio)(struct uio *, bool); 71*3ee1d5bbSConrad Meyer static void (read_random)(void *, u_int); 72*3ee1d5bbSConrad Meyer static bool (is_random_seeded)(void); 73646041a8SMark Murray #endif 74646041a8SMark Murray 75d1b06863SMark Murray static d_read_t randomdev_read; 76d1b06863SMark Murray static d_write_t randomdev_write; 77d1b06863SMark Murray static d_poll_t randomdev_poll; 7810cb2424SMark Murray static d_ioctl_t randomdev_ioctl; 794db9ae91SMark Murray 804db9ae91SMark Murray static struct cdevsw random_cdevsw = { 817ac40f5fSPoul-Henning Kamp .d_name = "random", 8210cb2424SMark Murray .d_version = D_VERSION, 83d1b06863SMark Murray .d_read = randomdev_read, 84d1b06863SMark Murray .d_write = randomdev_write, 85d1b06863SMark Murray .d_poll = randomdev_poll, 8610cb2424SMark Murray .d_ioctl = randomdev_ioctl, 874db9ae91SMark Murray }; 884db9ae91SMark Murray 894db9ae91SMark Murray /* For use with make_dev(9)/destroy_dev(9). */ 9089c9c53dSPoul-Henning Kamp static struct cdev *random_dev; 914db9ae91SMark Murray 92646041a8SMark Murray #if defined(RANDOM_LOADABLE) 933aa77530SMark Murray static void 94*3ee1d5bbSConrad Meyer random_alg_context_init(void *dummy __unused) 953aa77530SMark Murray { 96*3ee1d5bbSConrad Meyer _read_random_uio = (read_random_uio); 97*3ee1d5bbSConrad Meyer _read_random = (read_random); 98*3ee1d5bbSConrad Meyer _is_random_seeded = (is_random_seeded); 993aa77530SMark Murray } 100*3ee1d5bbSConrad Meyer SYSINIT(random_device, SI_SUB_RANDOM, SI_ORDER_SECOND, random_alg_context_init, 101*3ee1d5bbSConrad Meyer NULL); 102*3ee1d5bbSConrad Meyer #endif 1033aa77530SMark Murray 104d1b06863SMark Murray static struct selinfo rsel; 105d1b06863SMark Murray 106d1b06863SMark Murray /* 107d1b06863SMark Murray * This is the read uio(9) interface for random(4). 108d1b06863SMark Murray */ 109d1b06863SMark Murray /* ARGSUSED */ 110d1b06863SMark Murray static int 111d1b06863SMark Murray randomdev_read(struct cdev *dev __unused, struct uio *uio, int flags) 112d1b06863SMark Murray { 113707d98feSEd Schouten 114*3ee1d5bbSConrad Meyer return ((read_random_uio)(uio, (flags & O_NONBLOCK) != 0)); 115707d98feSEd Schouten } 116707d98feSEd Schouten 11713774e82SConrad Meyer /* 11813774e82SConrad Meyer * If the random device is not seeded, blocks until it is seeded. 11913774e82SConrad Meyer * 12013774e82SConrad Meyer * Returns zero when the random device is seeded. 12113774e82SConrad Meyer * 12213774e82SConrad Meyer * If the 'interruptible' parameter is true, and the device is unseeded, this 12313774e82SConrad Meyer * routine may be interrupted. If interrupted, it will return either ERESTART 12413774e82SConrad Meyer * or EINTR. 12513774e82SConrad Meyer */ 12613774e82SConrad Meyer #define SEEDWAIT_INTERRUPTIBLE true 12713774e82SConrad Meyer #define SEEDWAIT_UNINTERRUPTIBLE false 12813774e82SConrad Meyer static int 12913774e82SConrad Meyer randomdev_wait_until_seeded(bool interruptible) 13013774e82SConrad Meyer { 13113774e82SConrad Meyer int error, spamcount, slpflags; 13213774e82SConrad Meyer 13313774e82SConrad Meyer slpflags = interruptible ? PCATCH : 0; 13413774e82SConrad Meyer 13513774e82SConrad Meyer error = 0; 13613774e82SConrad Meyer spamcount = 0; 13713774e82SConrad Meyer while (!p_random_alg_context->ra_seeded()) { 13813774e82SConrad Meyer /* keep tapping away at the pre-read until we seed/unblock. */ 13913774e82SConrad Meyer p_random_alg_context->ra_pre_read(); 14013774e82SConrad Meyer /* Only bother the console every 10 seconds or so */ 14113774e82SConrad Meyer if (spamcount == 0) 14213774e82SConrad Meyer printf("random: %s unblock wait\n", __func__); 14313774e82SConrad Meyer spamcount = (spamcount + 1) % 100; 144*3ee1d5bbSConrad Meyer error = tsleep(p_random_alg_context, slpflags, "randseed", 14513774e82SConrad Meyer hz / 10); 14613774e82SConrad Meyer if (error == ERESTART || error == EINTR) { 14713774e82SConrad Meyer KASSERT(interruptible, 14813774e82SConrad Meyer ("unexpected wake of non-interruptible sleep")); 14913774e82SConrad Meyer break; 15013774e82SConrad Meyer } 15113774e82SConrad Meyer /* Squash tsleep timeout condition */ 15213774e82SConrad Meyer if (error == EWOULDBLOCK) 15313774e82SConrad Meyer error = 0; 15413774e82SConrad Meyer KASSERT(error == 0, ("unexpected tsleep error %d", error)); 15513774e82SConrad Meyer } 15613774e82SConrad Meyer return (error); 15713774e82SConrad Meyer } 15813774e82SConrad Meyer 159707d98feSEd Schouten int 160*3ee1d5bbSConrad Meyer (read_random_uio)(struct uio *uio, bool nonblock) 161707d98feSEd Schouten { 162db488e4fSConrad Meyer /* 16 MiB takes about 0.08 s CPU time on my 2017 AMD Zen CPU */ 163db488e4fSConrad Meyer #define SIGCHK_PERIOD (16 * 1024 * 1024) 164db488e4fSConrad Meyer const size_t sigchk_period = SIGCHK_PERIOD; 165db488e4fSConrad Meyer CTASSERT(SIGCHK_PERIOD % PAGE_SIZE == 0); 166db488e4fSConrad Meyer #undef SIGCHK_PERIOD 167d1b06863SMark Murray 168d0d71d81SConrad Meyer uint8_t *random_buf; 169d0d71d81SConrad Meyer size_t total_read, read_len; 170d0d71d81SConrad Meyer ssize_t bufsize; 171d0d71d81SConrad Meyer int error; 172d0d71d81SConrad Meyer 173d0d71d81SConrad Meyer 174d0d71d81SConrad Meyer KASSERT(uio->uio_rw == UIO_READ, ("%s: bogus write", __func__)); 175d0d71d81SConrad Meyer KASSERT(uio->uio_resid >= 0, ("%s: bogus negative resid", __func__)); 176d0d71d81SConrad Meyer 177646041a8SMark Murray p_random_alg_context->ra_pre_read(); 178d1b06863SMark Murray error = 0; 179dbefaadcSMark Murray /* (Un)Blocking logic */ 18013774e82SConrad Meyer if (!p_random_alg_context->ra_seeded()) { 18113774e82SConrad Meyer if (nonblock) 182d1b06863SMark Murray error = EWOULDBLOCK; 18313774e82SConrad Meyer else 18413774e82SConrad Meyer error = randomdev_wait_until_seeded( 18513774e82SConrad Meyer SEEDWAIT_INTERRUPTIBLE); 186d1b06863SMark Murray } 187d0d71d81SConrad Meyer if (error != 0) 188d0d71d81SConrad Meyer return (error); 189d0d71d81SConrad Meyer 190d0d71d81SConrad Meyer read_rate_increment(howmany(uio->uio_resid + 1, sizeof(uint32_t))); 191b712101cSMark Murray total_read = 0; 192d0d71d81SConrad Meyer 193d0d71d81SConrad Meyer /* Easy to deal with the trivial 0 byte case. */ 194d0d71d81SConrad Meyer if (__predict_false(uio->uio_resid == 0)) 195d0d71d81SConrad Meyer return (0); 196d0d71d81SConrad Meyer 197b712101cSMark Murray /* 198d0d71d81SConrad Meyer * If memory is plentiful, use maximally sized requests to avoid 199d0d71d81SConrad Meyer * per-call algorithm overhead. But fall back to a single page 200d0d71d81SConrad Meyer * allocation if the full request isn't immediately available. 201b712101cSMark Murray */ 202d0d71d81SConrad Meyer bufsize = MIN(sigchk_period, (size_t)uio->uio_resid); 203d0d71d81SConrad Meyer random_buf = malloc(bufsize, M_ENTROPY, M_NOWAIT); 204d0d71d81SConrad Meyer if (random_buf == NULL) { 205d0d71d81SConrad Meyer bufsize = PAGE_SIZE; 206d0d71d81SConrad Meyer random_buf = malloc(bufsize, M_ENTROPY, M_WAITOK); 207d0d71d81SConrad Meyer } 208d0d71d81SConrad Meyer 209d0d71d81SConrad Meyer error = 0; 210d0d71d81SConrad Meyer while (uio->uio_resid > 0 && error == 0) { 211d0d71d81SConrad Meyer read_len = MIN((size_t)uio->uio_resid, bufsize); 212d0d71d81SConrad Meyer 213646041a8SMark Murray p_random_alg_context->ra_read(random_buf, read_len); 214d0d71d81SConrad Meyer 215db488e4fSConrad Meyer /* 216d0d71d81SConrad Meyer * uiomove() may yield the CPU before each 'read_len' bytes (up 217d0d71d81SConrad Meyer * to bufsize) are copied out. 218db488e4fSConrad Meyer */ 219d0d71d81SConrad Meyer error = uiomove(random_buf, read_len, uio); 220d0d71d81SConrad Meyer total_read += read_len; 221d0d71d81SConrad Meyer 222db488e4fSConrad Meyer /* 223db488e4fSConrad Meyer * Poll for signals every few MBs to avoid very long 224db488e4fSConrad Meyer * uninterruptible syscalls. 225db488e4fSConrad Meyer */ 226db488e4fSConrad Meyer if (error == 0 && uio->uio_resid != 0 && 2277a8d2661SXin LI total_read % sigchk_period == 0) { 228*3ee1d5bbSConrad Meyer error = tsleep_sbt(p_random_alg_context, PCATCH, 229db488e4fSConrad Meyer "randrd", SBT_1NS, 0, C_HARDCLOCK); 2307a8d2661SXin LI /* Squash tsleep timeout condition */ 2317a8d2661SXin LI if (error == EWOULDBLOCK) 2327a8d2661SXin LI error = 0; 2337a8d2661SXin LI } 234d1b06863SMark Murray } 235d0d71d81SConrad Meyer 236d0d71d81SConrad Meyer /* 237d0d71d81SConrad Meyer * Short reads due to signal interrupt should not indicate error. 238d0d71d81SConrad Meyer * Instead, the uio will reflect that the read was shorter than 239d0d71d81SConrad Meyer * requested. 240d0d71d81SConrad Meyer */ 241db488e4fSConrad Meyer if (error == ERESTART || error == EINTR) 242d1b06863SMark Murray error = 0; 243d0d71d81SConrad Meyer 244d0d71d81SConrad Meyer explicit_bzero(random_buf, bufsize); 245d1b06863SMark Murray free(random_buf, M_ENTROPY); 246d1b06863SMark Murray return (error); 247d1b06863SMark Murray } 248d1b06863SMark Murray 249d1b06863SMark Murray /*- 2503782136fSConrad Meyer * Kernel API version of read_random(). This is similar to read_random_uio(), 2513782136fSConrad Meyer * except it doesn't interface with uio(9). It cannot assumed that random_buf 2523782136fSConrad Meyer * is a multiple of RANDOM_BLOCKSIZE bytes. 2533782136fSConrad Meyer * 2543782136fSConrad Meyer * If the tunable 'kern.random.initial_seeding.bypass_before_seeding' is set 2553782136fSConrad Meyer * non-zero, silently fail to emit random data (matching the pre-r346250 2563782136fSConrad Meyer * behavior). If read_random is called prior to seeding and bypassed because 2573782136fSConrad Meyer * of this tunable, the condition is reported in the read-only sysctl 2583782136fSConrad Meyer * 'kern.random.initial_seeding.read_random_bypassed_before_seeding'. 259d1b06863SMark Murray */ 26013774e82SConrad Meyer void 261*3ee1d5bbSConrad Meyer (read_random)(void *random_buf, u_int len) 262d1b06863SMark Murray { 263d1b06863SMark Murray 264d1b06863SMark Murray KASSERT(random_buf != NULL, ("No suitable random buffer in %s", __func__)); 265646041a8SMark Murray p_random_alg_context->ra_pre_read(); 2663782136fSConrad Meyer 26713774e82SConrad Meyer if (len == 0) 26813774e82SConrad Meyer return; 2693782136fSConrad Meyer 2703782136fSConrad Meyer /* (Un)Blocking logic */ 2713782136fSConrad Meyer if (__predict_false(!p_random_alg_context->ra_seeded())) { 2723782136fSConrad Meyer if (random_bypass_before_seeding) { 2733782136fSConrad Meyer if (!read_random_bypassed_before_seeding) { 2743782136fSConrad Meyer if (!random_bypass_disable_warnings) 2753782136fSConrad Meyer printf("read_random: WARNING: bypassing" 2763782136fSConrad Meyer " request for random data because " 2773782136fSConrad Meyer "the random device is not yet " 2783782136fSConrad Meyer "seeded and the knob " 2793782136fSConrad Meyer "'bypass_before_seeding' was " 2803782136fSConrad Meyer "enabled.\n"); 2813782136fSConrad Meyer read_random_bypassed_before_seeding = true; 2823782136fSConrad Meyer } 2833782136fSConrad Meyer /* Avoid potentially leaking stack garbage */ 2843782136fSConrad Meyer memset(random_buf, 0, len); 2853782136fSConrad Meyer return; 2863782136fSConrad Meyer } 2873782136fSConrad Meyer 2883782136fSConrad Meyer (void)randomdev_wait_until_seeded(SEEDWAIT_UNINTERRUPTIBLE); 2893782136fSConrad Meyer } 2903782136fSConrad Meyer read_rate_increment(roundup2(len, sizeof(uint32_t))); 291d0d71d81SConrad Meyer p_random_alg_context->ra_read(random_buf, len); 292d1b06863SMark Murray } 293d1b06863SMark Murray 294f3d2512dSConrad Meyer bool 295*3ee1d5bbSConrad Meyer (is_random_seeded)(void) 296f3d2512dSConrad Meyer { 297f3d2512dSConrad Meyer return (p_random_alg_context->ra_seeded()); 298f3d2512dSConrad Meyer } 299f3d2512dSConrad Meyer 300646041a8SMark Murray static __inline void 301646041a8SMark Murray randomdev_accumulate(uint8_t *buf, u_int count) 302646041a8SMark Murray { 303646041a8SMark Murray static u_int destination = 0; 304646041a8SMark Murray static struct harvest_event event; 305646041a8SMark Murray static struct randomdev_hash hash; 306646041a8SMark Murray static uint32_t entropy_data[RANDOM_KEYSIZE_WORDS]; 307646041a8SMark Murray uint32_t timestamp; 308646041a8SMark Murray int i; 309646041a8SMark Murray 310646041a8SMark Murray /* Extra timing here is helpful to scrape scheduler jitter entropy */ 311646041a8SMark Murray randomdev_hash_init(&hash); 312646041a8SMark Murray timestamp = (uint32_t)get_cyclecount(); 313646041a8SMark Murray randomdev_hash_iterate(&hash, ×tamp, sizeof(timestamp)); 314646041a8SMark Murray randomdev_hash_iterate(&hash, buf, count); 315646041a8SMark Murray timestamp = (uint32_t)get_cyclecount(); 316646041a8SMark Murray randomdev_hash_iterate(&hash, ×tamp, sizeof(timestamp)); 317646041a8SMark Murray randomdev_hash_finish(&hash, entropy_data); 318646041a8SMark Murray for (i = 0; i < RANDOM_KEYSIZE_WORDS; i += sizeof(event.he_entropy)/sizeof(event.he_entropy[0])) { 319646041a8SMark Murray event.he_somecounter = (uint32_t)get_cyclecount(); 320646041a8SMark Murray event.he_size = sizeof(event.he_entropy); 321646041a8SMark Murray event.he_source = RANDOM_CACHED; 322646041a8SMark Murray event.he_destination = destination++; /* Harmless cheating */ 323646041a8SMark Murray memcpy(event.he_entropy, entropy_data + i, sizeof(event.he_entropy)); 324646041a8SMark Murray p_random_alg_context->ra_event_processor(&event); 325646041a8SMark Murray } 32600e0e488SConrad Meyer explicit_bzero(&event, sizeof(event)); 327646041a8SMark Murray explicit_bzero(entropy_data, sizeof(entropy_data)); 328646041a8SMark Murray } 329646041a8SMark Murray 330d1b06863SMark Murray /* ARGSUSED */ 331d1b06863SMark Murray static int 332d1b06863SMark Murray randomdev_write(struct cdev *dev __unused, struct uio *uio, int flags __unused) 333d1b06863SMark Murray { 334d1b06863SMark Murray uint8_t *random_buf; 335d1b06863SMark Murray int c, error = 0; 336d1b06863SMark Murray ssize_t nbytes; 337d1b06863SMark Murray 338d1b06863SMark Murray random_buf = malloc(PAGE_SIZE, M_ENTROPY, M_WAITOK); 339d1b06863SMark Murray nbytes = uio->uio_resid; 340d1b06863SMark Murray while (uio->uio_resid > 0 && error == 0) { 341d1b06863SMark Murray c = MIN(uio->uio_resid, PAGE_SIZE); 342d1b06863SMark Murray error = uiomove(random_buf, c, uio); 343d1b06863SMark Murray if (error) 344d1b06863SMark Murray break; 345646041a8SMark Murray randomdev_accumulate(random_buf, c); 346*3ee1d5bbSConrad Meyer tsleep(p_random_alg_context, 0, "randwr", hz/10); 347d1b06863SMark Murray } 348d1b06863SMark Murray if (nbytes != uio->uio_resid && (error == ERESTART || error == EINTR)) 349d1b06863SMark Murray /* Partial write, not error. */ 350d1b06863SMark Murray error = 0; 351d1b06863SMark Murray free(random_buf, M_ENTROPY); 352d1b06863SMark Murray return (error); 353d1b06863SMark Murray } 354d1b06863SMark Murray 355d1b06863SMark Murray /* ARGSUSED */ 356d1b06863SMark Murray static int 357d1b06863SMark Murray randomdev_poll(struct cdev *dev __unused, int events, struct thread *td __unused) 358d1b06863SMark Murray { 359d1b06863SMark Murray 360d1b06863SMark Murray if (events & (POLLIN | POLLRDNORM)) { 361646041a8SMark Murray if (p_random_alg_context->ra_seeded()) 362d1b06863SMark Murray events &= (POLLIN | POLLRDNORM); 363d1b06863SMark Murray else 364d1b06863SMark Murray selrecord(td, &rsel); 365d1b06863SMark Murray } 366d1b06863SMark Murray return (events); 367d1b06863SMark Murray } 368d1b06863SMark Murray 369d1b06863SMark Murray /* This will be called by the entropy processor when it seeds itself and becomes secure */ 370d1b06863SMark Murray void 371d1b06863SMark Murray randomdev_unblock(void) 372d1b06863SMark Murray { 373d1b06863SMark Murray 374d1b06863SMark Murray selwakeuppri(&rsel, PUSER); 375*3ee1d5bbSConrad Meyer wakeup(p_random_alg_context); 376d1b06863SMark Murray printf("random: unblocking device.\n"); 377d1b06863SMark Murray /* Do random(9) a favour while we are about it. */ 378d1b06863SMark Murray (void)atomic_cmpset_int(&arc4rand_iniseed_state, ARC4_ENTR_NONE, ARC4_ENTR_HAVE); 379d1b06863SMark Murray } 380d1b06863SMark Murray 381e1199601SMark Murray /* ARGSUSED */ 3824db9ae91SMark Murray static int 38310cb2424SMark Murray randomdev_ioctl(struct cdev *dev __unused, u_long cmd, caddr_t addr __unused, 384e1199601SMark Murray int flags __unused, struct thread *td __unused) 3854d87a031SMark Murray { 386e7806b4cSMark Murray int error = 0; 387e7806b4cSMark Murray 38841bc9751SMark Murray switch (cmd) { 38941bc9751SMark Murray /* Really handled in upper layer */ 39041bc9751SMark Murray case FIOASYNC: 39141bc9751SMark Murray case FIONBIO: 392e7806b4cSMark Murray break; 39341bc9751SMark Murray default: 394e7806b4cSMark Murray error = ENOTTY; 3954d87a031SMark Murray } 39610cb2424SMark Murray 397e7806b4cSMark Murray return (error); 39841bc9751SMark Murray } 3994d87a031SMark Murray 400e1199601SMark Murray /* ARGSUSED */ 401a6278a2aSMark Murray static int 40210cb2424SMark Murray randomdev_modevent(module_t mod __unused, int type, void *data __unused) 4034db9ae91SMark Murray { 404e7806b4cSMark Murray int error = 0; 4054d87a031SMark Murray 4064db9ae91SMark Murray switch (type) { 4074db9ae91SMark Murray case MOD_LOAD: 408d1b06863SMark Murray printf("random: entropy device external interface\n"); 40910cb2424SMark Murray random_dev = make_dev_credf(MAKEDEV_ETERNAL_KLD, &random_cdevsw, 4103aa77530SMark Murray RANDOM_UNIT, NULL, UID_ROOT, GID_WHEEL, 0644, "random"); 41110cb2424SMark Murray make_dev_alias(random_dev, "urandom"); /* compatibility */ 412e7806b4cSMark Murray break; 4134db9ae91SMark Murray case MOD_UNLOAD: 414*3ee1d5bbSConrad Meyer error = EBUSY; 415e7806b4cSMark Murray break; 4164db9ae91SMark Murray case MOD_SHUTDOWN: 417e7806b4cSMark Murray break; 4183e019deaSPoul-Henning Kamp default: 4193e019deaSPoul-Henning Kamp error = EOPNOTSUPP; 4203e019deaSPoul-Henning Kamp break; 4214db9ae91SMark Murray } 422e7806b4cSMark Murray return (error); 4234db9ae91SMark Murray } 4244db9ae91SMark Murray 425d1b06863SMark Murray static moduledata_t randomdev_mod = { 426d1b06863SMark Murray "random_device", 427d1b06863SMark Murray randomdev_modevent, 428d1b06863SMark Murray 0 429d1b06863SMark Murray }; 43010cb2424SMark Murray 431d1b06863SMark Murray DECLARE_MODULE(random_device, randomdev_mod, SI_SUB_DRIVERS, SI_ORDER_FIRST); 432d1b06863SMark Murray MODULE_VERSION(random_device, 1); 433646041a8SMark Murray MODULE_DEPEND(random_device, crypto, 1, 1, 1); 434646041a8SMark Murray MODULE_DEPEND(random_device, random_harvestq, 1, 1, 1); 435