17c478bd9Sstevel@tonic-gate /* 27c478bd9Sstevel@tonic-gate * CDDL HEADER START 37c478bd9Sstevel@tonic-gate * 47c478bd9Sstevel@tonic-gate * The contents of this file are subject to the terms of the 502f574f0Skais * Common Development and Distribution License (the "License"). 602f574f0Skais * You may not use this file except in compliance with the License. 77c478bd9Sstevel@tonic-gate * 87c478bd9Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 97c478bd9Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing. 107c478bd9Sstevel@tonic-gate * See the License for the specific language governing permissions 117c478bd9Sstevel@tonic-gate * and limitations under the License. 127c478bd9Sstevel@tonic-gate * 137c478bd9Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each 147c478bd9Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 157c478bd9Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the 167c478bd9Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying 177c478bd9Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner] 187c478bd9Sstevel@tonic-gate * 197c478bd9Sstevel@tonic-gate * CDDL HEADER END 207c478bd9Sstevel@tonic-gate */ 217c478bd9Sstevel@tonic-gate /* 229b009fc1SValerie Bubb Fenwick * Copyright (c) 2004, 2010, Oracle and/or its affiliates. All rights reserved. 23717fae56SGordon Ross * Copyright 2012 Nexenta Systems, Inc. All rights reserved. 24*9d12795fSRobert Mustacchi * Copyright (c) 2015, Joyent, Inc. 256ea3c060SGarrett D'Amore */ 267c478bd9Sstevel@tonic-gate 277c478bd9Sstevel@tonic-gate /* 287c478bd9Sstevel@tonic-gate * This file implements the interfaces that the /dev/random 297c478bd9Sstevel@tonic-gate * driver uses for read(2), write(2) and poll(2) on /dev/random or 307c478bd9Sstevel@tonic-gate * /dev/urandom. It also implements the kernel API - random_add_entropy(), 313364c169SVladimir Kotal * random_add_pseudo_entropy(), random_get_pseudo_bytes() 323364c169SVladimir Kotal * and random_get_bytes(). 337c478bd9Sstevel@tonic-gate * 347c478bd9Sstevel@tonic-gate * We periodically collect random bits from providers which are registered 357c478bd9Sstevel@tonic-gate * with the Kernel Cryptographic Framework (kCF) as capable of random 367c478bd9Sstevel@tonic-gate * number generation. The random bits are maintained in a cache and 377c478bd9Sstevel@tonic-gate * it is used for high quality random numbers (/dev/random) requests. 387c478bd9Sstevel@tonic-gate * We pick a provider and call its SPI routine, if the cache does not have 397c478bd9Sstevel@tonic-gate * enough bytes to satisfy a request. 407c478bd9Sstevel@tonic-gate * 417c478bd9Sstevel@tonic-gate * /dev/urandom requests use a software-based generator algorithm that uses the 427c478bd9Sstevel@tonic-gate * random bits in the cache as a seed. We create one pseudo-random generator 437c478bd9Sstevel@tonic-gate * (for /dev/urandom) per possible CPU on the system, and use it, 447c478bd9Sstevel@tonic-gate * kmem-magazine-style, to avoid cache line contention. 457c478bd9Sstevel@tonic-gate * 467c478bd9Sstevel@tonic-gate * LOCKING HIERARCHY: 47fe54a78eSHai-May Chao * 1) rmp->rm_mag.rm_lock protects the per-cpu pseudo-random generators. 487c478bd9Sstevel@tonic-gate * 2) rndpool_lock protects the high-quality randomness pool. 49fe54a78eSHai-May Chao * It may be locked while a rmp->rm_mag.rm_lock is held. 507c478bd9Sstevel@tonic-gate * 517c478bd9Sstevel@tonic-gate * A history note: The kernel API and the software-based algorithms in this 527c478bd9Sstevel@tonic-gate * file used to be part of the /dev/random driver. 537c478bd9Sstevel@tonic-gate */ 547c478bd9Sstevel@tonic-gate 557c478bd9Sstevel@tonic-gate #include <sys/types.h> 567c478bd9Sstevel@tonic-gate #include <sys/conf.h> 577c478bd9Sstevel@tonic-gate #include <sys/sunddi.h> 587c478bd9Sstevel@tonic-gate #include <sys/disp.h> 597c478bd9Sstevel@tonic-gate #include <sys/modctl.h> 607c478bd9Sstevel@tonic-gate #include <sys/ddi.h> 617c478bd9Sstevel@tonic-gate #include <sys/crypto/common.h> 627c478bd9Sstevel@tonic-gate #include <sys/crypto/api.h> 637c478bd9Sstevel@tonic-gate #include <sys/crypto/impl.h> 647c478bd9Sstevel@tonic-gate #include <sys/crypto/sched_impl.h> 6573556491SAnthony Scarpino #include <sys/crypto/ioctladmin.h> 667c478bd9Sstevel@tonic-gate #include <sys/random.h> 677c478bd9Sstevel@tonic-gate #include <sys/sha1.h> 687c478bd9Sstevel@tonic-gate #include <sys/time.h> 697c478bd9Sstevel@tonic-gate #include <sys/sysmacros.h> 707c478bd9Sstevel@tonic-gate #include <sys/cpuvar.h> 717c478bd9Sstevel@tonic-gate #include <sys/taskq.h> 72fe54a78eSHai-May Chao #include <rng/fips_random.h> 737c478bd9Sstevel@tonic-gate 747c478bd9Sstevel@tonic-gate #define RNDPOOLSIZE 1024 /* Pool size in bytes */ 757c478bd9Sstevel@tonic-gate #define MINEXTRACTBYTES 20 767c478bd9Sstevel@tonic-gate #define MAXEXTRACTBYTES 1024 777c478bd9Sstevel@tonic-gate #define PRNG_MAXOBLOCKS 1310720 /* Max output block per prng key */ 787c478bd9Sstevel@tonic-gate #define TIMEOUT_INTERVAL 5 /* Periodic mixing interval in secs */ 797c478bd9Sstevel@tonic-gate 807c478bd9Sstevel@tonic-gate typedef enum extract_type { 817c478bd9Sstevel@tonic-gate NONBLOCK_EXTRACT, 827c478bd9Sstevel@tonic-gate BLOCKING_EXTRACT, 837c478bd9Sstevel@tonic-gate ALWAYS_EXTRACT 847c478bd9Sstevel@tonic-gate } extract_type_t; 857c478bd9Sstevel@tonic-gate 867c478bd9Sstevel@tonic-gate /* 877c478bd9Sstevel@tonic-gate * Hash-algo generic definitions. For now, they are SHA1's. We use SHA1 887c478bd9Sstevel@tonic-gate * routines directly instead of using k-API because we can't return any 897c478bd9Sstevel@tonic-gate * error code in /dev/urandom case and we can get an error using k-API 907c478bd9Sstevel@tonic-gate * if a mechanism is disabled. 917c478bd9Sstevel@tonic-gate */ 927c478bd9Sstevel@tonic-gate #define HASHSIZE 20 937c478bd9Sstevel@tonic-gate #define HASH_CTX SHA1_CTX 947c478bd9Sstevel@tonic-gate #define HashInit(ctx) SHA1Init((ctx)) 957c478bd9Sstevel@tonic-gate #define HashUpdate(ctx, p, s) SHA1Update((ctx), (p), (s)) 967c478bd9Sstevel@tonic-gate #define HashFinal(d, ctx) SHA1Final((d), (ctx)) 977c478bd9Sstevel@tonic-gate 987c478bd9Sstevel@tonic-gate /* HMAC-SHA1 */ 997c478bd9Sstevel@tonic-gate #define HMAC_KEYSIZE 20 1007c478bd9Sstevel@tonic-gate 1017c478bd9Sstevel@tonic-gate /* 1027c478bd9Sstevel@tonic-gate * Cache of random bytes implemented as a circular buffer. findex and rindex 1037c478bd9Sstevel@tonic-gate * track the front and back of the circular buffer. 1047c478bd9Sstevel@tonic-gate */ 1057c478bd9Sstevel@tonic-gate uint8_t rndpool[RNDPOOLSIZE]; 1067c478bd9Sstevel@tonic-gate static int findex, rindex; 1077c478bd9Sstevel@tonic-gate static int rnbyte_cnt; /* Number of bytes in the cache */ 1087c478bd9Sstevel@tonic-gate 1097c478bd9Sstevel@tonic-gate static kmutex_t rndpool_lock; /* protects r/w accesses to the cache, */ 1107c478bd9Sstevel@tonic-gate /* and the global variables */ 1117c478bd9Sstevel@tonic-gate static kcondvar_t rndpool_read_cv; /* serializes poll/read syscalls */ 1127c478bd9Sstevel@tonic-gate static int num_waiters; /* #threads waiting to read from /dev/random */ 1137c478bd9Sstevel@tonic-gate 1147c478bd9Sstevel@tonic-gate static struct pollhead rnd_pollhead; 115104d3bdeSDan OpenSolaris Anderson /* LINTED E_STATIC_UNUSED */ 1167c478bd9Sstevel@tonic-gate static timeout_id_t kcf_rndtimeout_id; 1177c478bd9Sstevel@tonic-gate static crypto_mech_type_t rngmech_type = CRYPTO_MECH_INVALID; 1187c478bd9Sstevel@tonic-gate rnd_stats_t rnd_stats; 119f317a3a3Skrishna static boolean_t rng_prov_found = B_TRUE; 120f317a3a3Skrishna static boolean_t rng_ok_to_log = B_TRUE; 121f5229b7eSKrishna Yenduri static boolean_t rngprov_task_idle = B_TRUE; 1227c478bd9Sstevel@tonic-gate 1237c478bd9Sstevel@tonic-gate static void rndc_addbytes(uint8_t *, size_t); 1247c478bd9Sstevel@tonic-gate static void rndc_getbytes(uint8_t *ptr, size_t len); 1257c478bd9Sstevel@tonic-gate static void rnd_handler(void *); 126717fae56SGordon Ross static void rnd_alloc_magazines(void); 127717fae56SGordon Ross static void rnd_fips_discard_initial(void); 128717fae56SGordon Ross static void rnd_init2(void *); 129717fae56SGordon Ross static void rnd_schedule_timeout(void); 1307c478bd9Sstevel@tonic-gate 131717fae56SGordon Ross /* 132717fae56SGordon Ross * Called from kcf:_init() 133717fae56SGordon Ross */ 1347c478bd9Sstevel@tonic-gate void 1357c478bd9Sstevel@tonic-gate kcf_rnd_init() 1367c478bd9Sstevel@tonic-gate { 1377c478bd9Sstevel@tonic-gate hrtime_t ts; 1387c478bd9Sstevel@tonic-gate time_t now; 1397c478bd9Sstevel@tonic-gate 1407c478bd9Sstevel@tonic-gate mutex_init(&rndpool_lock, NULL, MUTEX_DEFAULT, NULL); 1417c478bd9Sstevel@tonic-gate cv_init(&rndpool_read_cv, NULL, CV_DEFAULT, NULL); 1427c478bd9Sstevel@tonic-gate 1437c478bd9Sstevel@tonic-gate /* 1447c478bd9Sstevel@tonic-gate * Add bytes to the cache using 1457c478bd9Sstevel@tonic-gate * . 2 unpredictable times: high resolution time since the boot-time, 1467c478bd9Sstevel@tonic-gate * and the current time-of-the day. 1477c478bd9Sstevel@tonic-gate * This is used only to make the timeout value in the timer 1487c478bd9Sstevel@tonic-gate * unpredictable. 1497c478bd9Sstevel@tonic-gate */ 1507c478bd9Sstevel@tonic-gate ts = gethrtime(); 1517c478bd9Sstevel@tonic-gate rndc_addbytes((uint8_t *)&ts, sizeof (ts)); 1527c478bd9Sstevel@tonic-gate 1537c478bd9Sstevel@tonic-gate (void) drv_getparm(TIME, &now); 1547c478bd9Sstevel@tonic-gate rndc_addbytes((uint8_t *)&now, sizeof (now)); 1557c478bd9Sstevel@tonic-gate 1567c478bd9Sstevel@tonic-gate rnbyte_cnt = 0; 1577c478bd9Sstevel@tonic-gate findex = rindex = 0; 1587c478bd9Sstevel@tonic-gate num_waiters = 0; 1597c478bd9Sstevel@tonic-gate 1607c478bd9Sstevel@tonic-gate rnd_alloc_magazines(); 161717fae56SGordon Ross 162717fae56SGordon Ross (void) taskq_dispatch(system_taskq, rnd_init2, NULL, TQ_SLEEP); 163717fae56SGordon Ross } 164717fae56SGordon Ross 165717fae56SGordon Ross /* 166717fae56SGordon Ross * This is called via the system taskq, so that we can do further 167717fae56SGordon Ross * initializations that have to wait until the kcf module itself is 168717fae56SGordon Ross * done loading. (After kcf:_init returns.) 169717fae56SGordon Ross */ 170717fae56SGordon Ross static void 171717fae56SGordon Ross rnd_init2(void *unused) 172717fae56SGordon Ross { 173717fae56SGordon Ross 174717fae56SGordon Ross _NOTE(ARGUNUSED(unused)); 175717fae56SGordon Ross 176717fae56SGordon Ross /* 177717fae56SGordon Ross * This will load a randomness provider; typically "swrand", 178717fae56SGordon Ross * but could be another provider if so configured. 179717fae56SGordon Ross */ 180717fae56SGordon Ross rngmech_type = crypto_mech2id(SUN_RANDOM); 181717fae56SGordon Ross 182717fae56SGordon Ross /* Update rng_prov_found etc. */ 183717fae56SGordon Ross (void) kcf_rngprov_check(); 184717fae56SGordon Ross 185717fae56SGordon Ross /* FIPS 140-2 init. */ 186717fae56SGordon Ross rnd_fips_discard_initial(); 187717fae56SGordon Ross 188717fae56SGordon Ross /* Start rnd_handler calls. */ 189717fae56SGordon Ross rnd_schedule_timeout(); 1907c478bd9Sstevel@tonic-gate } 1917c478bd9Sstevel@tonic-gate 1927c478bd9Sstevel@tonic-gate /* 1937c478bd9Sstevel@tonic-gate * Return TRUE if at least one provider exists that can 1947c478bd9Sstevel@tonic-gate * supply random numbers. 1957c478bd9Sstevel@tonic-gate */ 1967c478bd9Sstevel@tonic-gate boolean_t 1977c478bd9Sstevel@tonic-gate kcf_rngprov_check(void) 1987c478bd9Sstevel@tonic-gate { 1997c478bd9Sstevel@tonic-gate int rv; 2007c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd; 2017c478bd9Sstevel@tonic-gate 202436935a1SVladimir Kotal if ((pd = kcf_get_mech_provider(rngmech_type, NULL, NULL, &rv, 2039b009fc1SValerie Bubb Fenwick NULL, CRYPTO_FG_RANDOM, 0)) != NULL) { 2047c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 205f317a3a3Skrishna /* 206f317a3a3Skrishna * We logged a warning once about no provider being available 207f317a3a3Skrishna * and now a provider became available. So, set the flag so 208f317a3a3Skrishna * that we can log again if the problem recurs. 209f317a3a3Skrishna */ 210f317a3a3Skrishna rng_ok_to_log = B_TRUE; 211f317a3a3Skrishna rng_prov_found = B_TRUE; 2127c478bd9Sstevel@tonic-gate return (B_TRUE); 213f317a3a3Skrishna } else { 214f317a3a3Skrishna rng_prov_found = B_FALSE; 2157c478bd9Sstevel@tonic-gate return (B_FALSE); 216f317a3a3Skrishna } 2177c478bd9Sstevel@tonic-gate } 2187c478bd9Sstevel@tonic-gate 2197c478bd9Sstevel@tonic-gate /* 2207c478bd9Sstevel@tonic-gate * Pick a software-based provider and submit a request to seed 2217c478bd9Sstevel@tonic-gate * its random number generator. 2227c478bd9Sstevel@tonic-gate */ 2237c478bd9Sstevel@tonic-gate static void 2248047c9fbSmcpowers rngprov_seed(uint8_t *buf, int len, uint_t entropy_est, uint32_t flags) 2257c478bd9Sstevel@tonic-gate { 2267c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd = NULL; 2277c478bd9Sstevel@tonic-gate 2286a1073f8Skrishna if (kcf_get_sw_prov(rngmech_type, &pd, NULL, B_FALSE) == 2296a1073f8Skrishna CRYPTO_SUCCESS) { 2308047c9fbSmcpowers (void) KCF_PROV_SEED_RANDOM(pd, pd->pd_sid, buf, len, 2318047c9fbSmcpowers entropy_est, flags, NULL); 2327c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 2337c478bd9Sstevel@tonic-gate } 2347c478bd9Sstevel@tonic-gate } 2357c478bd9Sstevel@tonic-gate 2367c478bd9Sstevel@tonic-gate /* 2377c478bd9Sstevel@tonic-gate * This routine is called for blocking reads. 2387c478bd9Sstevel@tonic-gate * 2397c478bd9Sstevel@tonic-gate * The argument is_taskq_thr indicates whether the caller is 2407c478bd9Sstevel@tonic-gate * the taskq thread dispatched by the timeout handler routine. 2417c478bd9Sstevel@tonic-gate * In this case, we cycle through all the providers 2427c478bd9Sstevel@tonic-gate * submitting a request to each provider to generate random numbers. 2437c478bd9Sstevel@tonic-gate * 2447c478bd9Sstevel@tonic-gate * For other cases, we pick a provider and submit a request to generate 2457c478bd9Sstevel@tonic-gate * random numbers. We retry using another provider if we get an error. 2467c478bd9Sstevel@tonic-gate * 2477c478bd9Sstevel@tonic-gate * Returns the number of bytes that are written to 'ptr'. Returns -1 2487c478bd9Sstevel@tonic-gate * if no provider is found. ptr and need are unchanged. 2497c478bd9Sstevel@tonic-gate */ 2507c478bd9Sstevel@tonic-gate static int 2518b502715SKrishna Yenduri rngprov_getbytes(uint8_t *ptr, size_t need, boolean_t is_taskq_thr) 2527c478bd9Sstevel@tonic-gate { 2537c478bd9Sstevel@tonic-gate int rv; 2547c478bd9Sstevel@tonic-gate int prov_cnt = 0; 2557c478bd9Sstevel@tonic-gate int total_bytes = 0; 2567c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd; 2577c478bd9Sstevel@tonic-gate kcf_req_params_t params; 2587c478bd9Sstevel@tonic-gate kcf_prov_tried_t *list = NULL; 2597c478bd9Sstevel@tonic-gate 260436935a1SVladimir Kotal while ((pd = kcf_get_mech_provider(rngmech_type, NULL, NULL, &rv, 2619b009fc1SValerie Bubb Fenwick list, CRYPTO_FG_RANDOM, 0)) != NULL) { 2627c478bd9Sstevel@tonic-gate 2637c478bd9Sstevel@tonic-gate prov_cnt++; 2647c478bd9Sstevel@tonic-gate 2657c478bd9Sstevel@tonic-gate KCF_WRAP_RANDOM_OPS_PARAMS(¶ms, KCF_OP_RANDOM_GENERATE, 2668047c9fbSmcpowers pd->pd_sid, ptr, need, 0, 0); 2677c478bd9Sstevel@tonic-gate rv = kcf_submit_request(pd, NULL, NULL, ¶ms, B_FALSE); 2687c478bd9Sstevel@tonic-gate ASSERT(rv != CRYPTO_QUEUED); 2697c478bd9Sstevel@tonic-gate 2707c478bd9Sstevel@tonic-gate if (rv == CRYPTO_SUCCESS) { 2717c478bd9Sstevel@tonic-gate total_bytes += need; 2727c478bd9Sstevel@tonic-gate if (is_taskq_thr) 2737c478bd9Sstevel@tonic-gate rndc_addbytes(ptr, need); 2747c478bd9Sstevel@tonic-gate else { 2757c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 2767c478bd9Sstevel@tonic-gate break; 2777c478bd9Sstevel@tonic-gate } 2787c478bd9Sstevel@tonic-gate } 2797c478bd9Sstevel@tonic-gate 2807c478bd9Sstevel@tonic-gate if (is_taskq_thr || rv != CRYPTO_SUCCESS) { 2817c478bd9Sstevel@tonic-gate /* Add pd to the linked list of providers tried. */ 2827c478bd9Sstevel@tonic-gate if (kcf_insert_triedlist(&list, pd, KM_SLEEP) == NULL) { 2837c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 2847c478bd9Sstevel@tonic-gate break; 2857c478bd9Sstevel@tonic-gate } 2867c478bd9Sstevel@tonic-gate } 2877c478bd9Sstevel@tonic-gate 2887c478bd9Sstevel@tonic-gate } 2897c478bd9Sstevel@tonic-gate 2907c478bd9Sstevel@tonic-gate if (list != NULL) 2917c478bd9Sstevel@tonic-gate kcf_free_triedlist(list); 2927c478bd9Sstevel@tonic-gate 2937c478bd9Sstevel@tonic-gate if (prov_cnt == 0) { /* no provider could be found. */ 294f317a3a3Skrishna rng_prov_found = B_FALSE; 2957c478bd9Sstevel@tonic-gate return (-1); 296f317a3a3Skrishna } else { 297f317a3a3Skrishna rng_prov_found = B_TRUE; 298f317a3a3Skrishna /* See comments in kcf_rngprov_check() */ 299f317a3a3Skrishna rng_ok_to_log = B_TRUE; 3007c478bd9Sstevel@tonic-gate } 3017c478bd9Sstevel@tonic-gate 3027c478bd9Sstevel@tonic-gate return (total_bytes); 3037c478bd9Sstevel@tonic-gate } 3047c478bd9Sstevel@tonic-gate 3057c478bd9Sstevel@tonic-gate static void 3067c478bd9Sstevel@tonic-gate notify_done(void *arg, int rv) 3077c478bd9Sstevel@tonic-gate { 3087c478bd9Sstevel@tonic-gate uchar_t *rndbuf = arg; 3097c478bd9Sstevel@tonic-gate 3107c478bd9Sstevel@tonic-gate if (rv == CRYPTO_SUCCESS) 3117c478bd9Sstevel@tonic-gate rndc_addbytes(rndbuf, MINEXTRACTBYTES); 3127c478bd9Sstevel@tonic-gate 3137c478bd9Sstevel@tonic-gate bzero(rndbuf, MINEXTRACTBYTES); 3147c478bd9Sstevel@tonic-gate kmem_free(rndbuf, MINEXTRACTBYTES); 3157c478bd9Sstevel@tonic-gate } 3167c478bd9Sstevel@tonic-gate 3177c478bd9Sstevel@tonic-gate /* 3187c478bd9Sstevel@tonic-gate * Cycle through all the providers submitting a request to each provider 3197c478bd9Sstevel@tonic-gate * to generate random numbers. This is called for the modes - NONBLOCK_EXTRACT 3207c478bd9Sstevel@tonic-gate * and ALWAYS_EXTRACT. 3217c478bd9Sstevel@tonic-gate * 3227c478bd9Sstevel@tonic-gate * Returns the number of bytes that are written to 'ptr'. Returns -1 3237c478bd9Sstevel@tonic-gate * if no provider is found. ptr and len are unchanged. 3247c478bd9Sstevel@tonic-gate */ 3257c478bd9Sstevel@tonic-gate static int 3268b502715SKrishna Yenduri rngprov_getbytes_nblk(uint8_t *ptr, size_t len) 3277c478bd9Sstevel@tonic-gate { 328104d3bdeSDan OpenSolaris Anderson int rv, total_bytes; 329104d3bdeSDan OpenSolaris Anderson size_t blen; 3307c478bd9Sstevel@tonic-gate uchar_t *rndbuf; 3317c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd; 3327c478bd9Sstevel@tonic-gate kcf_req_params_t params; 3337c478bd9Sstevel@tonic-gate crypto_call_req_t req; 3347c478bd9Sstevel@tonic-gate kcf_prov_tried_t *list = NULL; 3357c478bd9Sstevel@tonic-gate int prov_cnt = 0; 3367c478bd9Sstevel@tonic-gate 3377c478bd9Sstevel@tonic-gate blen = 0; 3387c478bd9Sstevel@tonic-gate total_bytes = 0; 3397c478bd9Sstevel@tonic-gate req.cr_flag = CRYPTO_SKIP_REQID; 3407c478bd9Sstevel@tonic-gate req.cr_callback_func = notify_done; 3417c478bd9Sstevel@tonic-gate 342436935a1SVladimir Kotal while ((pd = kcf_get_mech_provider(rngmech_type, NULL, NULL, &rv, 3439b009fc1SValerie Bubb Fenwick list, CRYPTO_FG_RANDOM, 0)) != NULL) { 3447c478bd9Sstevel@tonic-gate 3457c478bd9Sstevel@tonic-gate prov_cnt ++; 3467c478bd9Sstevel@tonic-gate switch (pd->pd_prov_type) { 3477c478bd9Sstevel@tonic-gate case CRYPTO_HW_PROVIDER: 3487c478bd9Sstevel@tonic-gate /* 3497c478bd9Sstevel@tonic-gate * We have to allocate a buffer here as we can not 3507c478bd9Sstevel@tonic-gate * assume that the input buffer will remain valid 3517c478bd9Sstevel@tonic-gate * when the callback comes. We use a fixed size buffer 3527c478bd9Sstevel@tonic-gate * to simplify the book keeping. 3537c478bd9Sstevel@tonic-gate */ 3547c478bd9Sstevel@tonic-gate rndbuf = kmem_alloc(MINEXTRACTBYTES, KM_NOSLEEP); 3557c478bd9Sstevel@tonic-gate if (rndbuf == NULL) { 3567c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 3577c478bd9Sstevel@tonic-gate if (list != NULL) 3587c478bd9Sstevel@tonic-gate kcf_free_triedlist(list); 3597c478bd9Sstevel@tonic-gate return (total_bytes); 3607c478bd9Sstevel@tonic-gate } 3617c478bd9Sstevel@tonic-gate req.cr_callback_arg = rndbuf; 3627c478bd9Sstevel@tonic-gate KCF_WRAP_RANDOM_OPS_PARAMS(¶ms, 3637c478bd9Sstevel@tonic-gate KCF_OP_RANDOM_GENERATE, 3648047c9fbSmcpowers pd->pd_sid, rndbuf, MINEXTRACTBYTES, 0, 0); 3657c478bd9Sstevel@tonic-gate break; 3667c478bd9Sstevel@tonic-gate 3677c478bd9Sstevel@tonic-gate case CRYPTO_SW_PROVIDER: 3687c478bd9Sstevel@tonic-gate /* 3697c478bd9Sstevel@tonic-gate * We do not need to allocate a buffer in the software 3707c478bd9Sstevel@tonic-gate * provider case as there is no callback involved. We 3717c478bd9Sstevel@tonic-gate * avoid any extra data copy by directly passing 'ptr'. 3727c478bd9Sstevel@tonic-gate */ 3737c478bd9Sstevel@tonic-gate KCF_WRAP_RANDOM_OPS_PARAMS(¶ms, 3747c478bd9Sstevel@tonic-gate KCF_OP_RANDOM_GENERATE, 3758047c9fbSmcpowers pd->pd_sid, ptr, len, 0, 0); 3767c478bd9Sstevel@tonic-gate break; 3777c478bd9Sstevel@tonic-gate } 3787c478bd9Sstevel@tonic-gate 3797c478bd9Sstevel@tonic-gate rv = kcf_submit_request(pd, NULL, &req, ¶ms, B_FALSE); 3807c478bd9Sstevel@tonic-gate if (rv == CRYPTO_SUCCESS) { 3817c478bd9Sstevel@tonic-gate switch (pd->pd_prov_type) { 3827c478bd9Sstevel@tonic-gate case CRYPTO_HW_PROVIDER: 3837c478bd9Sstevel@tonic-gate /* 3847c478bd9Sstevel@tonic-gate * Since we have the input buffer handy, 3857c478bd9Sstevel@tonic-gate * we directly copy to it rather than 3867c478bd9Sstevel@tonic-gate * adding to the pool. 3877c478bd9Sstevel@tonic-gate */ 3887c478bd9Sstevel@tonic-gate blen = min(MINEXTRACTBYTES, len); 3897c478bd9Sstevel@tonic-gate bcopy(rndbuf, ptr, blen); 3907c478bd9Sstevel@tonic-gate if (len < MINEXTRACTBYTES) 3917c478bd9Sstevel@tonic-gate rndc_addbytes(rndbuf + len, 3927c478bd9Sstevel@tonic-gate MINEXTRACTBYTES - len); 3937c478bd9Sstevel@tonic-gate ptr += blen; 3947c478bd9Sstevel@tonic-gate len -= blen; 3957c478bd9Sstevel@tonic-gate total_bytes += blen; 3967c478bd9Sstevel@tonic-gate break; 3977c478bd9Sstevel@tonic-gate 3987c478bd9Sstevel@tonic-gate case CRYPTO_SW_PROVIDER: 3997c478bd9Sstevel@tonic-gate total_bytes += len; 4007c478bd9Sstevel@tonic-gate len = 0; 4017c478bd9Sstevel@tonic-gate break; 4027c478bd9Sstevel@tonic-gate } 4037c478bd9Sstevel@tonic-gate } 4047c478bd9Sstevel@tonic-gate 4057c478bd9Sstevel@tonic-gate /* 4067c478bd9Sstevel@tonic-gate * We free the buffer in the callback routine 4077c478bd9Sstevel@tonic-gate * for the CRYPTO_QUEUED case. 4087c478bd9Sstevel@tonic-gate */ 4097c478bd9Sstevel@tonic-gate if (pd->pd_prov_type == CRYPTO_HW_PROVIDER && 4107c478bd9Sstevel@tonic-gate rv != CRYPTO_QUEUED) { 4117c478bd9Sstevel@tonic-gate bzero(rndbuf, MINEXTRACTBYTES); 4127c478bd9Sstevel@tonic-gate kmem_free(rndbuf, MINEXTRACTBYTES); 4137c478bd9Sstevel@tonic-gate } 4147c478bd9Sstevel@tonic-gate 4157c478bd9Sstevel@tonic-gate if (len == 0) { 4167c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 4177c478bd9Sstevel@tonic-gate break; 4187c478bd9Sstevel@tonic-gate } 4197c478bd9Sstevel@tonic-gate 4207c478bd9Sstevel@tonic-gate if (rv != CRYPTO_SUCCESS) { 4217c478bd9Sstevel@tonic-gate /* Add pd to the linked list of providers tried. */ 4227c478bd9Sstevel@tonic-gate if (kcf_insert_triedlist(&list, pd, KM_NOSLEEP) == 4237c478bd9Sstevel@tonic-gate NULL) { 4247c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 4257c478bd9Sstevel@tonic-gate break; 4267c478bd9Sstevel@tonic-gate } 4277c478bd9Sstevel@tonic-gate } 4287c478bd9Sstevel@tonic-gate } 4297c478bd9Sstevel@tonic-gate 4307c478bd9Sstevel@tonic-gate if (list != NULL) { 4317c478bd9Sstevel@tonic-gate kcf_free_triedlist(list); 4327c478bd9Sstevel@tonic-gate } 4337c478bd9Sstevel@tonic-gate 4347c478bd9Sstevel@tonic-gate if (prov_cnt == 0) { /* no provider could be found. */ 435f317a3a3Skrishna rng_prov_found = B_FALSE; 4367c478bd9Sstevel@tonic-gate return (-1); 437f317a3a3Skrishna } else { 438f317a3a3Skrishna rng_prov_found = B_TRUE; 439f317a3a3Skrishna /* See comments in kcf_rngprov_check() */ 440f317a3a3Skrishna rng_ok_to_log = B_TRUE; 4417c478bd9Sstevel@tonic-gate } 4427c478bd9Sstevel@tonic-gate 4437c478bd9Sstevel@tonic-gate return (total_bytes); 4447c478bd9Sstevel@tonic-gate } 4457c478bd9Sstevel@tonic-gate 4467c478bd9Sstevel@tonic-gate static void 4477c478bd9Sstevel@tonic-gate rngprov_task(void *arg) 4487c478bd9Sstevel@tonic-gate { 4497c478bd9Sstevel@tonic-gate int len = (int)(uintptr_t)arg; 4507c478bd9Sstevel@tonic-gate uchar_t tbuf[MAXEXTRACTBYTES]; 4517c478bd9Sstevel@tonic-gate 4527c478bd9Sstevel@tonic-gate ASSERT(len <= MAXEXTRACTBYTES); 4538b502715SKrishna Yenduri (void) rngprov_getbytes(tbuf, len, B_TRUE); 454f5229b7eSKrishna Yenduri rngprov_task_idle = B_TRUE; 4557c478bd9Sstevel@tonic-gate } 4567c478bd9Sstevel@tonic-gate 4577c478bd9Sstevel@tonic-gate /* 4587c478bd9Sstevel@tonic-gate * Returns "len" random or pseudo-random bytes in *ptr. 4597c478bd9Sstevel@tonic-gate * Will block if not enough random bytes are available and the 4607c478bd9Sstevel@tonic-gate * call is blocking. 4617c478bd9Sstevel@tonic-gate * 4627c478bd9Sstevel@tonic-gate * Called with rndpool_lock held (allowing caller to do optimistic locking; 4637c478bd9Sstevel@tonic-gate * releases the lock before return). 4647c478bd9Sstevel@tonic-gate */ 4657c478bd9Sstevel@tonic-gate static int 4668b502715SKrishna Yenduri rnd_get_bytes(uint8_t *ptr, size_t len, extract_type_t how) 4677c478bd9Sstevel@tonic-gate { 46895014fbbSDan OpenSolaris Anderson size_t bytes; 46995014fbbSDan OpenSolaris Anderson int got; 4707c478bd9Sstevel@tonic-gate 4717c478bd9Sstevel@tonic-gate ASSERT(mutex_owned(&rndpool_lock)); 4727c478bd9Sstevel@tonic-gate /* 4737c478bd9Sstevel@tonic-gate * Check if the request can be satisfied from the cache 4747c478bd9Sstevel@tonic-gate * of random bytes. 4757c478bd9Sstevel@tonic-gate */ 4767c478bd9Sstevel@tonic-gate if (len <= rnbyte_cnt) { 4777c478bd9Sstevel@tonic-gate rndc_getbytes(ptr, len); 4787c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 4797c478bd9Sstevel@tonic-gate return (0); 4807c478bd9Sstevel@tonic-gate } 4817c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 4827c478bd9Sstevel@tonic-gate 4837c478bd9Sstevel@tonic-gate switch (how) { 4847c478bd9Sstevel@tonic-gate case BLOCKING_EXTRACT: 4858b502715SKrishna Yenduri if ((got = rngprov_getbytes(ptr, len, B_FALSE)) == -1) 4867c478bd9Sstevel@tonic-gate break; /* No provider found */ 4877c478bd9Sstevel@tonic-gate 4887c478bd9Sstevel@tonic-gate if (got == len) 4897c478bd9Sstevel@tonic-gate return (0); 4907c478bd9Sstevel@tonic-gate len -= got; 4917c478bd9Sstevel@tonic-gate ptr += got; 4927c478bd9Sstevel@tonic-gate break; 4937c478bd9Sstevel@tonic-gate 4947c478bd9Sstevel@tonic-gate case NONBLOCK_EXTRACT: 4957c478bd9Sstevel@tonic-gate case ALWAYS_EXTRACT: 4968b502715SKrishna Yenduri if ((got = rngprov_getbytes_nblk(ptr, len)) == -1) { 4977c478bd9Sstevel@tonic-gate /* No provider found */ 4987c478bd9Sstevel@tonic-gate if (how == NONBLOCK_EXTRACT) { 4997c478bd9Sstevel@tonic-gate return (EAGAIN); 5007c478bd9Sstevel@tonic-gate } 5017c478bd9Sstevel@tonic-gate } else { 5027c478bd9Sstevel@tonic-gate if (got == len) 5037c478bd9Sstevel@tonic-gate return (0); 5047c478bd9Sstevel@tonic-gate len -= got; 5057c478bd9Sstevel@tonic-gate ptr += got; 5067c478bd9Sstevel@tonic-gate } 5077c478bd9Sstevel@tonic-gate if (how == NONBLOCK_EXTRACT && (rnbyte_cnt < len)) 5087c478bd9Sstevel@tonic-gate return (EAGAIN); 5097c478bd9Sstevel@tonic-gate break; 5107c478bd9Sstevel@tonic-gate } 5117c478bd9Sstevel@tonic-gate 5127c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 5137c478bd9Sstevel@tonic-gate while (len > 0) { 5147c478bd9Sstevel@tonic-gate if (how == BLOCKING_EXTRACT) { 5157c478bd9Sstevel@tonic-gate /* Check if there is enough */ 5167c478bd9Sstevel@tonic-gate while (rnbyte_cnt < MINEXTRACTBYTES) { 5177c478bd9Sstevel@tonic-gate num_waiters++; 5187c478bd9Sstevel@tonic-gate if (cv_wait_sig(&rndpool_read_cv, 5197c478bd9Sstevel@tonic-gate &rndpool_lock) == 0) { 5207c478bd9Sstevel@tonic-gate num_waiters--; 5217c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 5227c478bd9Sstevel@tonic-gate return (EINTR); 5237c478bd9Sstevel@tonic-gate } 5247c478bd9Sstevel@tonic-gate num_waiters--; 5257c478bd9Sstevel@tonic-gate } 5267c478bd9Sstevel@tonic-gate } 5277c478bd9Sstevel@tonic-gate 5287c478bd9Sstevel@tonic-gate /* Figure out how many bytes to extract */ 5297c478bd9Sstevel@tonic-gate bytes = min(len, rnbyte_cnt); 5307c478bd9Sstevel@tonic-gate rndc_getbytes(ptr, bytes); 5317c478bd9Sstevel@tonic-gate 5327c478bd9Sstevel@tonic-gate len -= bytes; 5337c478bd9Sstevel@tonic-gate ptr += bytes; 5347c478bd9Sstevel@tonic-gate 5357c478bd9Sstevel@tonic-gate if (len > 0 && how == ALWAYS_EXTRACT) { 5367c478bd9Sstevel@tonic-gate /* 5377c478bd9Sstevel@tonic-gate * There are not enough bytes, but we can not block. 5387c478bd9Sstevel@tonic-gate * This only happens in the case of /dev/urandom which 5397c478bd9Sstevel@tonic-gate * runs an additional generation algorithm. So, there 5407c478bd9Sstevel@tonic-gate * is no problem. 5417c478bd9Sstevel@tonic-gate */ 5427c478bd9Sstevel@tonic-gate while (len > 0) { 5437c478bd9Sstevel@tonic-gate *ptr = rndpool[findex]; 5447c478bd9Sstevel@tonic-gate ptr++; len--; 5457c478bd9Sstevel@tonic-gate rindex = findex = (findex + 1) & 5467c478bd9Sstevel@tonic-gate (RNDPOOLSIZE - 1); 5477c478bd9Sstevel@tonic-gate } 5487c478bd9Sstevel@tonic-gate break; 5497c478bd9Sstevel@tonic-gate } 5507c478bd9Sstevel@tonic-gate } 5517c478bd9Sstevel@tonic-gate 5527c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 5537c478bd9Sstevel@tonic-gate return (0); 5547c478bd9Sstevel@tonic-gate } 5557c478bd9Sstevel@tonic-gate 5567c478bd9Sstevel@tonic-gate int 5578b502715SKrishna Yenduri kcf_rnd_get_bytes(uint8_t *ptr, size_t len, boolean_t noblock) 5587c478bd9Sstevel@tonic-gate { 5597c478bd9Sstevel@tonic-gate extract_type_t how; 5607c478bd9Sstevel@tonic-gate int error; 5617c478bd9Sstevel@tonic-gate 5627c478bd9Sstevel@tonic-gate how = noblock ? NONBLOCK_EXTRACT : BLOCKING_EXTRACT; 5637c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 5648b502715SKrishna Yenduri if ((error = rnd_get_bytes(ptr, len, how)) != 0) 5657c478bd9Sstevel@tonic-gate return (error); 5667c478bd9Sstevel@tonic-gate 5677c478bd9Sstevel@tonic-gate BUMP_RND_STATS(rs_rndOut, len); 5687c478bd9Sstevel@tonic-gate return (0); 5697c478bd9Sstevel@tonic-gate } 5707c478bd9Sstevel@tonic-gate 5717c478bd9Sstevel@tonic-gate /* 5727c478bd9Sstevel@tonic-gate * Revisit this if the structs grow or we come up with a better way 5737c478bd9Sstevel@tonic-gate * of cache-line-padding structures. 5747c478bd9Sstevel@tonic-gate */ 5757c478bd9Sstevel@tonic-gate #define RND_CPU_CACHE_SIZE 64 576fe54a78eSHai-May Chao #define RND_CPU_PAD_SIZE RND_CPU_CACHE_SIZE*6 5777c478bd9Sstevel@tonic-gate #define RND_CPU_PAD (RND_CPU_PAD_SIZE - \ 578fe54a78eSHai-May Chao sizeof (rndmag_t)) 5797c478bd9Sstevel@tonic-gate /* 5807c478bd9Sstevel@tonic-gate * Per-CPU random state. Somewhat like like kmem's magazines, this provides 5817c478bd9Sstevel@tonic-gate * a per-CPU instance of the pseudo-random generator. We have it much easier 5827c478bd9Sstevel@tonic-gate * than kmem, as we can afford to "leak" random bits if a CPU is DR'ed out. 5837c478bd9Sstevel@tonic-gate * 5847c478bd9Sstevel@tonic-gate * Note that this usage is preemption-safe; a thread 5857c478bd9Sstevel@tonic-gate * entering a critical section remembers which generator it locked 5867c478bd9Sstevel@tonic-gate * and unlocks the same one; should it be preempted and wind up running on 5877c478bd9Sstevel@tonic-gate * a different CPU, there will be a brief period of increased contention 5887c478bd9Sstevel@tonic-gate * before it exits the critical section but nothing will melt. 5897c478bd9Sstevel@tonic-gate */ 5907c478bd9Sstevel@tonic-gate typedef struct rndmag_s 5917c478bd9Sstevel@tonic-gate { 5927c478bd9Sstevel@tonic-gate kmutex_t rm_lock; 59356498af3SHai-May Chao uint8_t *rm_buffer; /* Start of buffer */ 5947c478bd9Sstevel@tonic-gate uint8_t *rm_eptr; /* End of buffer */ 5957c478bd9Sstevel@tonic-gate uint8_t *rm_rptr; /* Current read pointer */ 5967c478bd9Sstevel@tonic-gate uint32_t rm_oblocks; /* time to rekey? */ 5977c478bd9Sstevel@tonic-gate uint32_t rm_ofuzz; /* Rekey backoff state */ 5987c478bd9Sstevel@tonic-gate uint32_t rm_olimit; /* Hard rekey limit */ 5997c478bd9Sstevel@tonic-gate rnd_stats_t rm_stats; /* Per-CPU Statistics */ 60056498af3SHai-May Chao uint32_t rm_key[HASHSIZE/BYTES_IN_WORD]; /* FIPS XKEY */ 60156498af3SHai-May Chao uint32_t rm_seed[HASHSIZE/BYTES_IN_WORD]; /* seed for rekey */ 60256498af3SHai-May Chao uint32_t rm_previous[HASHSIZE/BYTES_IN_WORD]; /* prev random */ 6037c478bd9Sstevel@tonic-gate } rndmag_t; 6047c478bd9Sstevel@tonic-gate 605fe54a78eSHai-May Chao typedef struct rndmag_pad_s 606fe54a78eSHai-May Chao { 607fe54a78eSHai-May Chao rndmag_t rm_mag; 608fe54a78eSHai-May Chao uint8_t rm_pad[RND_CPU_PAD]; 609fe54a78eSHai-May Chao } rndmag_pad_t; 610fe54a78eSHai-May Chao 6117c478bd9Sstevel@tonic-gate /* 612fe54a78eSHai-May Chao * Generate random bytes for /dev/urandom by applying the 613fe54a78eSHai-May Chao * FIPS 186-2 algorithm with a key created from bytes extracted 6147c478bd9Sstevel@tonic-gate * from the pool. A maximum of PRNG_MAXOBLOCKS output blocks 6157c478bd9Sstevel@tonic-gate * is generated before a new key is obtained. 6167c478bd9Sstevel@tonic-gate * 6177c478bd9Sstevel@tonic-gate * Note that callers to this routine are likely to assume it can't fail. 6187c478bd9Sstevel@tonic-gate * 6197c478bd9Sstevel@tonic-gate * Called with rmp locked; releases lock. 6207c478bd9Sstevel@tonic-gate */ 6217c478bd9Sstevel@tonic-gate static int 622fe54a78eSHai-May Chao rnd_generate_pseudo_bytes(rndmag_pad_t *rmp, uint8_t *ptr, size_t len) 6237c478bd9Sstevel@tonic-gate { 624104d3bdeSDan OpenSolaris Anderson size_t bytes = len, size; 625104d3bdeSDan OpenSolaris Anderson int nblock; 6267c478bd9Sstevel@tonic-gate uint32_t oblocks; 62756498af3SHai-May Chao uint32_t tempout[HASHSIZE/BYTES_IN_WORD]; 62856498af3SHai-May Chao uint32_t seed[HASHSIZE/BYTES_IN_WORD]; 629fe54a78eSHai-May Chao int i; 630fe54a78eSHai-May Chao hrtime_t timestamp; 631fe54a78eSHai-May Chao uint8_t *src, *dst; 6327c478bd9Sstevel@tonic-gate 633fe54a78eSHai-May Chao ASSERT(mutex_owned(&rmp->rm_mag.rm_lock)); 6347c478bd9Sstevel@tonic-gate 6357c478bd9Sstevel@tonic-gate /* Nothing is being asked */ 6367c478bd9Sstevel@tonic-gate if (len == 0) { 637fe54a78eSHai-May Chao mutex_exit(&rmp->rm_mag.rm_lock); 6387c478bd9Sstevel@tonic-gate return (0); 6397c478bd9Sstevel@tonic-gate } 6407c478bd9Sstevel@tonic-gate 6417c478bd9Sstevel@tonic-gate nblock = howmany(len, HASHSIZE); 6427c478bd9Sstevel@tonic-gate 643fe54a78eSHai-May Chao rmp->rm_mag.rm_oblocks += nblock; 644fe54a78eSHai-May Chao oblocks = rmp->rm_mag.rm_oblocks; 6457c478bd9Sstevel@tonic-gate 6467c478bd9Sstevel@tonic-gate do { 647fe54a78eSHai-May Chao if (oblocks >= rmp->rm_mag.rm_olimit) { 6487c478bd9Sstevel@tonic-gate 6497c478bd9Sstevel@tonic-gate /* 6507c478bd9Sstevel@tonic-gate * Contention-avoiding rekey: see if 6517c478bd9Sstevel@tonic-gate * the pool is locked, and if so, wait a bit. 6527c478bd9Sstevel@tonic-gate * Do an 'exponential back-in' to ensure we don't 6537c478bd9Sstevel@tonic-gate * run too long without rekey. 6547c478bd9Sstevel@tonic-gate */ 655fe54a78eSHai-May Chao if (rmp->rm_mag.rm_ofuzz) { 6567c478bd9Sstevel@tonic-gate /* 6577c478bd9Sstevel@tonic-gate * Decaying exponential back-in for rekey. 6587c478bd9Sstevel@tonic-gate */ 6597c478bd9Sstevel@tonic-gate if ((rnbyte_cnt < MINEXTRACTBYTES) || 6607c478bd9Sstevel@tonic-gate (!mutex_tryenter(&rndpool_lock))) { 661fe54a78eSHai-May Chao rmp->rm_mag.rm_olimit += 662fe54a78eSHai-May Chao rmp->rm_mag.rm_ofuzz; 663fe54a78eSHai-May Chao rmp->rm_mag.rm_ofuzz >>= 1; 6647c478bd9Sstevel@tonic-gate goto punt; 6657c478bd9Sstevel@tonic-gate } 6667c478bd9Sstevel@tonic-gate } else { 6677c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 6687c478bd9Sstevel@tonic-gate } 6697c478bd9Sstevel@tonic-gate 6707c478bd9Sstevel@tonic-gate /* Get a new chunk of entropy */ 671fe54a78eSHai-May Chao (void) rnd_get_bytes((uint8_t *)rmp->rm_mag.rm_key, 6728b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 673fe54a78eSHai-May Chao 674fe54a78eSHai-May Chao rmp->rm_mag.rm_olimit = PRNG_MAXOBLOCKS/2; 675fe54a78eSHai-May Chao rmp->rm_mag.rm_ofuzz = PRNG_MAXOBLOCKS/4; 6767c478bd9Sstevel@tonic-gate oblocks = 0; 677fe54a78eSHai-May Chao rmp->rm_mag.rm_oblocks = nblock; 6787c478bd9Sstevel@tonic-gate } 6797c478bd9Sstevel@tonic-gate punt: 680fe54a78eSHai-May Chao timestamp = gethrtime(); 681fe54a78eSHai-May Chao 682fe54a78eSHai-May Chao src = (uint8_t *)×tamp; 683fe54a78eSHai-May Chao dst = (uint8_t *)rmp->rm_mag.rm_seed; 684fe54a78eSHai-May Chao 685fe54a78eSHai-May Chao for (i = 0; i < HASHSIZE; i++) { 686fe54a78eSHai-May Chao dst[i] ^= src[i % sizeof (timestamp)]; 687fe54a78eSHai-May Chao } 688fe54a78eSHai-May Chao 689fe54a78eSHai-May Chao bcopy(rmp->rm_mag.rm_seed, seed, HASHSIZE); 690fe54a78eSHai-May Chao 691fe54a78eSHai-May Chao fips_random_inner(rmp->rm_mag.rm_key, tempout, 692fe54a78eSHai-May Chao seed); 693fe54a78eSHai-May Chao 6947c478bd9Sstevel@tonic-gate if (bytes >= HASHSIZE) { 6957c478bd9Sstevel@tonic-gate size = HASHSIZE; 6967c478bd9Sstevel@tonic-gate } else { 6977c478bd9Sstevel@tonic-gate size = min(bytes, HASHSIZE); 6987c478bd9Sstevel@tonic-gate } 699fe54a78eSHai-May Chao 700fe54a78eSHai-May Chao /* 701fe54a78eSHai-May Chao * FIPS 140-2: Continuous RNG test - each generation 702fe54a78eSHai-May Chao * of an n-bit block shall be compared with the previously 703fe54a78eSHai-May Chao * generated block. Test shall fail if any two compared 704fe54a78eSHai-May Chao * n-bit blocks are equal. 705fe54a78eSHai-May Chao */ 70656498af3SHai-May Chao for (i = 0; i < HASHSIZE/BYTES_IN_WORD; i++) { 707fe54a78eSHai-May Chao if (tempout[i] != rmp->rm_mag.rm_previous[i]) 708fe54a78eSHai-May Chao break; 709fe54a78eSHai-May Chao } 710b5a2d845SHai-May Chao if (i == HASHSIZE/BYTES_IN_WORD) { 711fe54a78eSHai-May Chao cmn_err(CE_WARN, "kcf_random: The value of 160-bit " 712fe54a78eSHai-May Chao "block random bytes are same as the previous " 713fe54a78eSHai-May Chao "one.\n"); 714b5a2d845SHai-May Chao /* discard random bytes and return error */ 715b971bb4cSValerie Bubb Fenwick mutex_exit(&rmp->rm_mag.rm_lock); 716b5a2d845SHai-May Chao return (EIO); 717b5a2d845SHai-May Chao } 718fe54a78eSHai-May Chao 719fe54a78eSHai-May Chao bcopy(tempout, rmp->rm_mag.rm_previous, 720fe54a78eSHai-May Chao HASHSIZE); 721fe54a78eSHai-May Chao 722fe54a78eSHai-May Chao bcopy(tempout, ptr, size); 7237c478bd9Sstevel@tonic-gate ptr += size; 7247c478bd9Sstevel@tonic-gate bytes -= size; 7257c478bd9Sstevel@tonic-gate oblocks++; 7267c478bd9Sstevel@tonic-gate nblock--; 7277c478bd9Sstevel@tonic-gate } while (bytes > 0); 7287c478bd9Sstevel@tonic-gate 729fe54a78eSHai-May Chao /* Zero out sensitive information */ 730fe54a78eSHai-May Chao bzero(seed, HASHSIZE); 731fe54a78eSHai-May Chao bzero(tempout, HASHSIZE); 732fe54a78eSHai-May Chao mutex_exit(&rmp->rm_mag.rm_lock); 7337c478bd9Sstevel@tonic-gate return (0); 7347c478bd9Sstevel@tonic-gate } 7357c478bd9Sstevel@tonic-gate 7367c478bd9Sstevel@tonic-gate /* 7377c478bd9Sstevel@tonic-gate * Per-CPU Random magazines. 7387c478bd9Sstevel@tonic-gate */ 739fe54a78eSHai-May Chao static rndmag_pad_t *rndmag; 7407c478bd9Sstevel@tonic-gate static uint8_t *rndbuf; 7417c478bd9Sstevel@tonic-gate static size_t rndmag_total; 7427c478bd9Sstevel@tonic-gate /* 7437c478bd9Sstevel@tonic-gate * common/os/cpu.c says that platform support code can shrinkwrap 7447c478bd9Sstevel@tonic-gate * max_ncpus. On the off chance that we get loaded very early, we 7457c478bd9Sstevel@tonic-gate * read it exactly once, to copy it here. 7467c478bd9Sstevel@tonic-gate */ 7477c478bd9Sstevel@tonic-gate static uint32_t random_max_ncpus = 0; 7487c478bd9Sstevel@tonic-gate 7497c478bd9Sstevel@tonic-gate /* 7507c478bd9Sstevel@tonic-gate * Boot-time tunables, for experimentation. 7517c478bd9Sstevel@tonic-gate */ 75202f574f0Skais size_t rndmag_threshold = 2560; 75302f574f0Skais size_t rndbuf_len = 5120; 754fa626f0cSkrishna size_t rndmag_size = 1280; 7557c478bd9Sstevel@tonic-gate 7567c478bd9Sstevel@tonic-gate 7577c478bd9Sstevel@tonic-gate int 7587c478bd9Sstevel@tonic-gate kcf_rnd_get_pseudo_bytes(uint8_t *ptr, size_t len) 7597c478bd9Sstevel@tonic-gate { 760fe54a78eSHai-May Chao rndmag_pad_t *rmp; 7617c478bd9Sstevel@tonic-gate uint8_t *cptr, *eptr; 7627c478bd9Sstevel@tonic-gate 7637c478bd9Sstevel@tonic-gate /* 7647c478bd9Sstevel@tonic-gate * Anyone who asks for zero bytes of randomness should get slapped. 7657c478bd9Sstevel@tonic-gate */ 7667c478bd9Sstevel@tonic-gate ASSERT(len > 0); 7677c478bd9Sstevel@tonic-gate 7687c478bd9Sstevel@tonic-gate /* 7697c478bd9Sstevel@tonic-gate * Fast path. 7707c478bd9Sstevel@tonic-gate */ 7717c478bd9Sstevel@tonic-gate for (;;) { 7727c478bd9Sstevel@tonic-gate rmp = &rndmag[CPU->cpu_seqid]; 773fe54a78eSHai-May Chao mutex_enter(&rmp->rm_mag.rm_lock); 7747c478bd9Sstevel@tonic-gate 7757c478bd9Sstevel@tonic-gate /* 7767c478bd9Sstevel@tonic-gate * Big requests bypass buffer and tail-call the 7777c478bd9Sstevel@tonic-gate * generate routine directly. 7787c478bd9Sstevel@tonic-gate */ 7797c478bd9Sstevel@tonic-gate if (len > rndmag_threshold) { 7807c478bd9Sstevel@tonic-gate BUMP_CPU_RND_STATS(rmp, rs_urndOut, len); 7817c478bd9Sstevel@tonic-gate return (rnd_generate_pseudo_bytes(rmp, ptr, len)); 7827c478bd9Sstevel@tonic-gate } 7837c478bd9Sstevel@tonic-gate 784fe54a78eSHai-May Chao cptr = rmp->rm_mag.rm_rptr; 7857c478bd9Sstevel@tonic-gate eptr = cptr + len; 7867c478bd9Sstevel@tonic-gate 787fe54a78eSHai-May Chao if (eptr <= rmp->rm_mag.rm_eptr) { 788fe54a78eSHai-May Chao rmp->rm_mag.rm_rptr = eptr; 7897c478bd9Sstevel@tonic-gate bcopy(cptr, ptr, len); 7907c478bd9Sstevel@tonic-gate BUMP_CPU_RND_STATS(rmp, rs_urndOut, len); 791fe54a78eSHai-May Chao mutex_exit(&rmp->rm_mag.rm_lock); 7927c478bd9Sstevel@tonic-gate 7937c478bd9Sstevel@tonic-gate return (0); 7947c478bd9Sstevel@tonic-gate } 7957c478bd9Sstevel@tonic-gate /* 7967c478bd9Sstevel@tonic-gate * End fast path. 7977c478bd9Sstevel@tonic-gate */ 798fe54a78eSHai-May Chao rmp->rm_mag.rm_rptr = rmp->rm_mag.rm_buffer; 7997c478bd9Sstevel@tonic-gate /* 8007c478bd9Sstevel@tonic-gate * Note: We assume the generate routine always succeeds 8017c478bd9Sstevel@tonic-gate * in this case (because it does at present..) 8027c478bd9Sstevel@tonic-gate * It also always releases rm_lock. 8037c478bd9Sstevel@tonic-gate */ 804fe54a78eSHai-May Chao (void) rnd_generate_pseudo_bytes(rmp, rmp->rm_mag.rm_buffer, 8057c478bd9Sstevel@tonic-gate rndbuf_len); 8067c478bd9Sstevel@tonic-gate } 8077c478bd9Sstevel@tonic-gate } 8087c478bd9Sstevel@tonic-gate 8097c478bd9Sstevel@tonic-gate /* 8107c478bd9Sstevel@tonic-gate * We set up (empty) magazines for all of max_ncpus, possibly wasting a 8117c478bd9Sstevel@tonic-gate * little memory on big systems that don't have the full set installed. 8127c478bd9Sstevel@tonic-gate * See above; "empty" means "rptr equal to eptr"; this will trigger the 8137c478bd9Sstevel@tonic-gate * refill path in rnd_get_pseudo_bytes above on the first call for each CPU. 8147c478bd9Sstevel@tonic-gate * 8157c478bd9Sstevel@tonic-gate * TODO: make rndmag_size tunable at run time! 8167c478bd9Sstevel@tonic-gate */ 8177c478bd9Sstevel@tonic-gate static void 8187c478bd9Sstevel@tonic-gate rnd_alloc_magazines() 8197c478bd9Sstevel@tonic-gate { 820fe54a78eSHai-May Chao rndmag_pad_t *rmp; 8217c478bd9Sstevel@tonic-gate int i; 8227c478bd9Sstevel@tonic-gate 8237c478bd9Sstevel@tonic-gate rndbuf_len = roundup(rndbuf_len, HASHSIZE); 8247c478bd9Sstevel@tonic-gate if (rndmag_size < rndbuf_len) 8257c478bd9Sstevel@tonic-gate rndmag_size = rndbuf_len; 8267c478bd9Sstevel@tonic-gate rndmag_size = roundup(rndmag_size, RND_CPU_CACHE_SIZE); 8277c478bd9Sstevel@tonic-gate 8287c478bd9Sstevel@tonic-gate random_max_ncpus = max_ncpus; 8297c478bd9Sstevel@tonic-gate rndmag_total = rndmag_size * random_max_ncpus; 8307c478bd9Sstevel@tonic-gate 8317c478bd9Sstevel@tonic-gate rndbuf = kmem_alloc(rndmag_total, KM_SLEEP); 832fe54a78eSHai-May Chao rndmag = kmem_zalloc(sizeof (rndmag_pad_t) * random_max_ncpus, 833fe54a78eSHai-May Chao KM_SLEEP); 8347c478bd9Sstevel@tonic-gate 8357c478bd9Sstevel@tonic-gate for (i = 0; i < random_max_ncpus; i++) { 8367c478bd9Sstevel@tonic-gate uint8_t *buf; 8377c478bd9Sstevel@tonic-gate 8387c478bd9Sstevel@tonic-gate rmp = &rndmag[i]; 839fe54a78eSHai-May Chao mutex_init(&rmp->rm_mag.rm_lock, NULL, MUTEX_DRIVER, NULL); 8407c478bd9Sstevel@tonic-gate 8417c478bd9Sstevel@tonic-gate buf = rndbuf + i * rndmag_size; 8427c478bd9Sstevel@tonic-gate 843fe54a78eSHai-May Chao rmp->rm_mag.rm_buffer = buf; 844fe54a78eSHai-May Chao rmp->rm_mag.rm_eptr = buf + rndbuf_len; 845fe54a78eSHai-May Chao rmp->rm_mag.rm_rptr = buf + rndbuf_len; 846fe54a78eSHai-May Chao rmp->rm_mag.rm_oblocks = 1; 847717fae56SGordon Ross } 848717fae56SGordon Ross } 849fe54a78eSHai-May Chao 850717fae56SGordon Ross /* 851717fae56SGordon Ross * FIPS 140-2: the first n-bit (n > 15) block generated 852717fae56SGordon Ross * after power-up, initialization, or reset shall not 853717fae56SGordon Ross * be used, but shall be saved for comparison. 854717fae56SGordon Ross */ 855717fae56SGordon Ross static void 856717fae56SGordon Ross rnd_fips_discard_initial(void) 857717fae56SGordon Ross { 858717fae56SGordon Ross uint8_t discard_buf[HASHSIZE]; 859717fae56SGordon Ross rndmag_pad_t *rmp; 860717fae56SGordon Ross int i; 861717fae56SGordon Ross 862717fae56SGordon Ross for (i = 0; i < random_max_ncpus; i++) { 863717fae56SGordon Ross rmp = &rndmag[i]; 864717fae56SGordon Ross 865717fae56SGordon Ross /* rnd_get_bytes() will call mutex_exit(&rndpool_lock) */ 866fe54a78eSHai-May Chao mutex_enter(&rndpool_lock); 867fe54a78eSHai-May Chao (void) rnd_get_bytes(discard_buf, 8688b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 869fe54a78eSHai-May Chao bcopy(discard_buf, rmp->rm_mag.rm_previous, 870fe54a78eSHai-May Chao HMAC_KEYSIZE); 871fe54a78eSHai-May Chao /* rnd_get_bytes() will call mutex_exit(&rndpool_lock) */ 872fe54a78eSHai-May Chao mutex_enter(&rndpool_lock); 873fe54a78eSHai-May Chao (void) rnd_get_bytes((uint8_t *)rmp->rm_mag.rm_key, 8748b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 875fe54a78eSHai-May Chao /* rnd_get_bytes() will call mutex_exit(&rndpool_lock) */ 876fe54a78eSHai-May Chao mutex_enter(&rndpool_lock); 877fe54a78eSHai-May Chao (void) rnd_get_bytes((uint8_t *)rmp->rm_mag.rm_seed, 8788b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 8797c478bd9Sstevel@tonic-gate } 8807c478bd9Sstevel@tonic-gate } 8817c478bd9Sstevel@tonic-gate 882a0d1cdd5SGarrett D'Amore static void 883717fae56SGordon Ross rnd_schedule_timeout(void) 8847c478bd9Sstevel@tonic-gate { 8857c478bd9Sstevel@tonic-gate clock_t ut; /* time in microseconds */ 8867c478bd9Sstevel@tonic-gate 8877c478bd9Sstevel@tonic-gate /* 8887c478bd9Sstevel@tonic-gate * The new timeout value is taken from the buffer of random bytes. 8897c478bd9Sstevel@tonic-gate * We're merely reading the first 32 bits from the buffer here, not 8907c478bd9Sstevel@tonic-gate * consuming any random bytes. 8917c478bd9Sstevel@tonic-gate * The timeout multiplier value is a random value between 0.5 sec and 8927c478bd9Sstevel@tonic-gate * 1.544480 sec (0.5 sec + 0xFF000 microseconds). 8937c478bd9Sstevel@tonic-gate * The new timeout is TIMEOUT_INTERVAL times that multiplier. 8947c478bd9Sstevel@tonic-gate */ 8957c478bd9Sstevel@tonic-gate ut = 500000 + (clock_t)((((uint32_t)rndpool[findex]) << 12) & 0xFF000); 8967c478bd9Sstevel@tonic-gate kcf_rndtimeout_id = timeout(rnd_handler, NULL, 8977c478bd9Sstevel@tonic-gate TIMEOUT_INTERVAL * drv_usectohz(ut)); 8987c478bd9Sstevel@tonic-gate } 8997c478bd9Sstevel@tonic-gate 9007c478bd9Sstevel@tonic-gate /* 9019d31afc5SKrishna Yenduri * Called from the driver for a poll on /dev/random 9029d31afc5SKrishna Yenduri * . POLLOUT always succeeds. 9039d31afc5SKrishna Yenduri * . POLLIN and POLLRDNORM will block until a 9049d31afc5SKrishna Yenduri * minimum amount of entropy is available. 9059d31afc5SKrishna Yenduri * 9067c478bd9Sstevel@tonic-gate * &rnd_pollhead is passed in *phpp in order to indicate the calling thread 9077c478bd9Sstevel@tonic-gate * will block. When enough random bytes are available, later, the timeout 9087c478bd9Sstevel@tonic-gate * handler routine will issue the pollwakeup() calls. 9097c478bd9Sstevel@tonic-gate */ 9107c478bd9Sstevel@tonic-gate void 9119d31afc5SKrishna Yenduri kcf_rnd_chpoll(short events, int anyyet, short *reventsp, 9129d31afc5SKrishna Yenduri struct pollhead **phpp) 9137c478bd9Sstevel@tonic-gate { 9149d31afc5SKrishna Yenduri *reventsp = events & POLLOUT; 9159d31afc5SKrishna Yenduri 9169d31afc5SKrishna Yenduri if (events & (POLLIN | POLLRDNORM)) { 9179d31afc5SKrishna Yenduri /* 9189d31afc5SKrishna Yenduri * Sampling of rnbyte_cnt is an atomic 9199d31afc5SKrishna Yenduri * operation. Hence we do not need any locking. 9209d31afc5SKrishna Yenduri */ 9219d31afc5SKrishna Yenduri if (rnbyte_cnt >= MINEXTRACTBYTES) 9229d31afc5SKrishna Yenduri *reventsp |= (events & (POLLIN | POLLRDNORM)); 9237c478bd9Sstevel@tonic-gate } 9249d31afc5SKrishna Yenduri 9259d31afc5SKrishna Yenduri if (*reventsp == 0 && !anyyet) 9269d31afc5SKrishna Yenduri *phpp = &rnd_pollhead; 9277c478bd9Sstevel@tonic-gate } 9287c478bd9Sstevel@tonic-gate 9297c478bd9Sstevel@tonic-gate /*ARGSUSED*/ 9307c478bd9Sstevel@tonic-gate static void 9317c478bd9Sstevel@tonic-gate rnd_handler(void *arg) 9327c478bd9Sstevel@tonic-gate { 9337c478bd9Sstevel@tonic-gate int len = 0; 9347c478bd9Sstevel@tonic-gate 935f317a3a3Skrishna if (!rng_prov_found && rng_ok_to_log) { 936f317a3a3Skrishna cmn_err(CE_WARN, "No randomness provider enabled for " 937f317a3a3Skrishna "/dev/random. Use cryptoadm(1M) to enable a provider."); 938f317a3a3Skrishna rng_ok_to_log = B_FALSE; 939f317a3a3Skrishna } 940f317a3a3Skrishna 9417c478bd9Sstevel@tonic-gate if (num_waiters > 0) 942f5229b7eSKrishna Yenduri /* 943f5229b7eSKrishna Yenduri * Note: len has no relationship with how many bytes 944f5229b7eSKrishna Yenduri * a poll thread needs. 945f5229b7eSKrishna Yenduri */ 9467c478bd9Sstevel@tonic-gate len = MAXEXTRACTBYTES; 9477c478bd9Sstevel@tonic-gate else if (rnbyte_cnt < RNDPOOLSIZE) 9487c478bd9Sstevel@tonic-gate len = MINEXTRACTBYTES; 9497c478bd9Sstevel@tonic-gate 950f5229b7eSKrishna Yenduri /* 951f5229b7eSKrishna Yenduri * Only one thread gets to set rngprov_task_idle at a given point 952f5229b7eSKrishna Yenduri * of time and the order of the writes is defined. Also, it is OK 953f5229b7eSKrishna Yenduri * if we read an older value of it and skip the dispatch once 954f5229b7eSKrishna Yenduri * since we will get the correct value during the next time here. 955f5229b7eSKrishna Yenduri * So, no locking is needed here. 956f5229b7eSKrishna Yenduri */ 957f5229b7eSKrishna Yenduri if (len > 0 && rngprov_task_idle) { 958f5229b7eSKrishna Yenduri rngprov_task_idle = B_FALSE; 959f5229b7eSKrishna Yenduri 960f5229b7eSKrishna Yenduri /* 961f5229b7eSKrishna Yenduri * It is OK if taskq_dispatch fails here. We will retry 962f5229b7eSKrishna Yenduri * the next time around. Meanwhile, a thread doing a 963f5229b7eSKrishna Yenduri * read() will go to the provider directly, if the 964f5229b7eSKrishna Yenduri * cache becomes empty. 965f5229b7eSKrishna Yenduri */ 966f5229b7eSKrishna Yenduri if (taskq_dispatch(system_taskq, rngprov_task, 967f5229b7eSKrishna Yenduri (void *)(uintptr_t)len, TQ_NOSLEEP | TQ_NOQUEUE) == 0) { 968f5229b7eSKrishna Yenduri rngprov_task_idle = B_TRUE; 969f5229b7eSKrishna Yenduri } 9707c478bd9Sstevel@tonic-gate } 9717c478bd9Sstevel@tonic-gate 9727c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 9737c478bd9Sstevel@tonic-gate /* 9747c478bd9Sstevel@tonic-gate * Wake up threads waiting in poll() or for enough accumulated 9757c478bd9Sstevel@tonic-gate * random bytes to read from /dev/random. In case a poll() is 9767c478bd9Sstevel@tonic-gate * concurrent with a read(), the polling process may be woken up 9777c478bd9Sstevel@tonic-gate * indicating that enough randomness is now available for reading, 9787c478bd9Sstevel@tonic-gate * and another process *steals* the bits from the pool, causing the 9797c478bd9Sstevel@tonic-gate * subsequent read() from the first process to block. It is acceptable 9807c478bd9Sstevel@tonic-gate * since the blocking will eventually end, after the timeout 9817c478bd9Sstevel@tonic-gate * has expired enough times to honor the read. 9827c478bd9Sstevel@tonic-gate * 9837c478bd9Sstevel@tonic-gate * Note - Since we hold the rndpool_lock across the pollwakeup() call 9847c478bd9Sstevel@tonic-gate * we MUST NOT grab the rndpool_lock in kcf_rndchpoll(). 9857c478bd9Sstevel@tonic-gate */ 9867c478bd9Sstevel@tonic-gate if (rnbyte_cnt >= MINEXTRACTBYTES) 9877c478bd9Sstevel@tonic-gate pollwakeup(&rnd_pollhead, POLLIN | POLLRDNORM); 9887c478bd9Sstevel@tonic-gate 9897c478bd9Sstevel@tonic-gate if (num_waiters > 0) 9907c478bd9Sstevel@tonic-gate cv_broadcast(&rndpool_read_cv); 9917c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 9927c478bd9Sstevel@tonic-gate 993717fae56SGordon Ross rnd_schedule_timeout(); 9947c478bd9Sstevel@tonic-gate } 9957c478bd9Sstevel@tonic-gate 9967c478bd9Sstevel@tonic-gate static void 9977c478bd9Sstevel@tonic-gate rndc_addbytes(uint8_t *ptr, size_t len) 9987c478bd9Sstevel@tonic-gate { 9997c478bd9Sstevel@tonic-gate ASSERT(ptr != NULL && len > 0); 10007c478bd9Sstevel@tonic-gate ASSERT(rnbyte_cnt <= RNDPOOLSIZE); 10017c478bd9Sstevel@tonic-gate 10027c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 10037c478bd9Sstevel@tonic-gate while ((len > 0) && (rnbyte_cnt < RNDPOOLSIZE)) { 10047c478bd9Sstevel@tonic-gate rndpool[rindex] ^= *ptr; 10057c478bd9Sstevel@tonic-gate ptr++; len--; 10067c478bd9Sstevel@tonic-gate rindex = (rindex + 1) & (RNDPOOLSIZE - 1); 10077c478bd9Sstevel@tonic-gate rnbyte_cnt++; 10087c478bd9Sstevel@tonic-gate } 10097c478bd9Sstevel@tonic-gate 10107c478bd9Sstevel@tonic-gate /* Handle buffer full case */ 10117c478bd9Sstevel@tonic-gate while (len > 0) { 10127c478bd9Sstevel@tonic-gate rndpool[rindex] ^= *ptr; 10137c478bd9Sstevel@tonic-gate ptr++; len--; 10147c478bd9Sstevel@tonic-gate findex = rindex = (rindex + 1) & (RNDPOOLSIZE - 1); 10157c478bd9Sstevel@tonic-gate } 10167c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 10177c478bd9Sstevel@tonic-gate } 10187c478bd9Sstevel@tonic-gate 10197c478bd9Sstevel@tonic-gate /* 10207c478bd9Sstevel@tonic-gate * Caller should check len <= rnbyte_cnt under the 10217c478bd9Sstevel@tonic-gate * rndpool_lock before calling. 10227c478bd9Sstevel@tonic-gate */ 10237c478bd9Sstevel@tonic-gate static void 10247c478bd9Sstevel@tonic-gate rndc_getbytes(uint8_t *ptr, size_t len) 10257c478bd9Sstevel@tonic-gate { 10267c478bd9Sstevel@tonic-gate ASSERT(MUTEX_HELD(&rndpool_lock)); 10277c478bd9Sstevel@tonic-gate ASSERT(len <= rnbyte_cnt && rnbyte_cnt <= RNDPOOLSIZE); 10287c478bd9Sstevel@tonic-gate 10297c478bd9Sstevel@tonic-gate BUMP_RND_STATS(rs_rndcOut, len); 10307c478bd9Sstevel@tonic-gate 10317c478bd9Sstevel@tonic-gate while (len > 0) { 10327c478bd9Sstevel@tonic-gate *ptr = rndpool[findex]; 10337c478bd9Sstevel@tonic-gate ptr++; len--; 10347c478bd9Sstevel@tonic-gate findex = (findex + 1) & (RNDPOOLSIZE - 1); 10357c478bd9Sstevel@tonic-gate rnbyte_cnt--; 10367c478bd9Sstevel@tonic-gate } 10377c478bd9Sstevel@tonic-gate } 10387c478bd9Sstevel@tonic-gate 10397c478bd9Sstevel@tonic-gate /* Random number exported entry points */ 10407c478bd9Sstevel@tonic-gate 10417c478bd9Sstevel@tonic-gate /* 10427c478bd9Sstevel@tonic-gate * Mix the supplied bytes into the entropy pool of a kCF 10437c478bd9Sstevel@tonic-gate * RNG provider. 10447c478bd9Sstevel@tonic-gate */ 10457c478bd9Sstevel@tonic-gate int 10468047c9fbSmcpowers random_add_pseudo_entropy(uint8_t *ptr, size_t len, uint_t entropy_est) 10478047c9fbSmcpowers { 10488047c9fbSmcpowers if (len < 1) 10498047c9fbSmcpowers return (-1); 10508047c9fbSmcpowers 10518047c9fbSmcpowers rngprov_seed(ptr, len, entropy_est, 0); 10528047c9fbSmcpowers 10538047c9fbSmcpowers return (0); 10548047c9fbSmcpowers } 10558047c9fbSmcpowers 10568047c9fbSmcpowers /* 10578047c9fbSmcpowers * Mix the supplied bytes into the entropy pool of a kCF 10588047c9fbSmcpowers * RNG provider. Mix immediately. 10598047c9fbSmcpowers */ 10608047c9fbSmcpowers int 10618047c9fbSmcpowers random_add_entropy(uint8_t *ptr, size_t len, uint_t entropy_est) 10627c478bd9Sstevel@tonic-gate { 10637c478bd9Sstevel@tonic-gate if (len < 1) 10647c478bd9Sstevel@tonic-gate return (-1); 10657c478bd9Sstevel@tonic-gate 10668047c9fbSmcpowers rngprov_seed(ptr, len, entropy_est, CRYPTO_SEED_NOW); 10677c478bd9Sstevel@tonic-gate 10687c478bd9Sstevel@tonic-gate return (0); 10697c478bd9Sstevel@tonic-gate } 10707c478bd9Sstevel@tonic-gate 10717c478bd9Sstevel@tonic-gate /* 10727c478bd9Sstevel@tonic-gate * Get bytes from the /dev/urandom generator. This function 10737c478bd9Sstevel@tonic-gate * always succeeds. Returns 0. 10747c478bd9Sstevel@tonic-gate */ 10757c478bd9Sstevel@tonic-gate int 10767c478bd9Sstevel@tonic-gate random_get_pseudo_bytes(uint8_t *ptr, size_t len) 10777c478bd9Sstevel@tonic-gate { 10787c478bd9Sstevel@tonic-gate ASSERT(!mutex_owned(&rndpool_lock)); 10797c478bd9Sstevel@tonic-gate 10807c478bd9Sstevel@tonic-gate if (len < 1) 10817c478bd9Sstevel@tonic-gate return (0); 10827c478bd9Sstevel@tonic-gate return (kcf_rnd_get_pseudo_bytes(ptr, len)); 10837c478bd9Sstevel@tonic-gate } 10847c478bd9Sstevel@tonic-gate 10857c478bd9Sstevel@tonic-gate /* 10867c478bd9Sstevel@tonic-gate * Get bytes from the /dev/random generator. Returns 0 10877c478bd9Sstevel@tonic-gate * on success. Returns EAGAIN if there is insufficient entropy. 10887c478bd9Sstevel@tonic-gate */ 10897c478bd9Sstevel@tonic-gate int 10907c478bd9Sstevel@tonic-gate random_get_bytes(uint8_t *ptr, size_t len) 10917c478bd9Sstevel@tonic-gate { 10927c478bd9Sstevel@tonic-gate ASSERT(!mutex_owned(&rndpool_lock)); 10937c478bd9Sstevel@tonic-gate 10947c478bd9Sstevel@tonic-gate if (len < 1) 10957c478bd9Sstevel@tonic-gate return (0); 10968b502715SKrishna Yenduri return (kcf_rnd_get_bytes(ptr, len, B_TRUE)); 10977c478bd9Sstevel@tonic-gate } 1098*9d12795fSRobert Mustacchi 1099*9d12795fSRobert Mustacchi int 1100*9d12795fSRobert Mustacchi random_get_blocking_bytes(uint8_t *ptr, size_t len) 1101*9d12795fSRobert Mustacchi { 1102*9d12795fSRobert Mustacchi ASSERT(!mutex_owned(&rndpool_lock)); 1103*9d12795fSRobert Mustacchi 1104*9d12795fSRobert Mustacchi if (len < 1) 1105*9d12795fSRobert Mustacchi return (0); 1106*9d12795fSRobert Mustacchi return (kcf_rnd_get_bytes(ptr, len, B_FALSE)); 1107*9d12795fSRobert Mustacchi } 1108