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 /* 223364c169SVladimir Kotal * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 237c478bd9Sstevel@tonic-gate * Use is subject to license terms. 247c478bd9Sstevel@tonic-gate */ 257c478bd9Sstevel@tonic-gate 267c478bd9Sstevel@tonic-gate /* 277c478bd9Sstevel@tonic-gate * This file implements the interfaces that the /dev/random 287c478bd9Sstevel@tonic-gate * driver uses for read(2), write(2) and poll(2) on /dev/random or 297c478bd9Sstevel@tonic-gate * /dev/urandom. It also implements the kernel API - random_add_entropy(), 303364c169SVladimir Kotal * random_add_pseudo_entropy(), random_get_pseudo_bytes() 313364c169SVladimir Kotal * and random_get_bytes(). 327c478bd9Sstevel@tonic-gate * 337c478bd9Sstevel@tonic-gate * We periodically collect random bits from providers which are registered 347c478bd9Sstevel@tonic-gate * with the Kernel Cryptographic Framework (kCF) as capable of random 357c478bd9Sstevel@tonic-gate * number generation. The random bits are maintained in a cache and 367c478bd9Sstevel@tonic-gate * it is used for high quality random numbers (/dev/random) requests. 377c478bd9Sstevel@tonic-gate * We pick a provider and call its SPI routine, if the cache does not have 387c478bd9Sstevel@tonic-gate * enough bytes to satisfy a request. 397c478bd9Sstevel@tonic-gate * 407c478bd9Sstevel@tonic-gate * /dev/urandom requests use a software-based generator algorithm that uses the 417c478bd9Sstevel@tonic-gate * random bits in the cache as a seed. We create one pseudo-random generator 427c478bd9Sstevel@tonic-gate * (for /dev/urandom) per possible CPU on the system, and use it, 437c478bd9Sstevel@tonic-gate * kmem-magazine-style, to avoid cache line contention. 447c478bd9Sstevel@tonic-gate * 457c478bd9Sstevel@tonic-gate * LOCKING HIERARCHY: 46fe54a78eSHai-May Chao * 1) rmp->rm_mag.rm_lock protects the per-cpu pseudo-random generators. 477c478bd9Sstevel@tonic-gate * 2) rndpool_lock protects the high-quality randomness pool. 48fe54a78eSHai-May Chao * It may be locked while a rmp->rm_mag.rm_lock is held. 497c478bd9Sstevel@tonic-gate * 507c478bd9Sstevel@tonic-gate * A history note: The kernel API and the software-based algorithms in this 517c478bd9Sstevel@tonic-gate * file used to be part of the /dev/random driver. 527c478bd9Sstevel@tonic-gate */ 537c478bd9Sstevel@tonic-gate 547c478bd9Sstevel@tonic-gate #include <sys/types.h> 557c478bd9Sstevel@tonic-gate #include <sys/conf.h> 567c478bd9Sstevel@tonic-gate #include <sys/sunddi.h> 577c478bd9Sstevel@tonic-gate #include <sys/disp.h> 587c478bd9Sstevel@tonic-gate #include <sys/modctl.h> 597c478bd9Sstevel@tonic-gate #include <sys/ddi.h> 607c478bd9Sstevel@tonic-gate #include <sys/crypto/common.h> 617c478bd9Sstevel@tonic-gate #include <sys/crypto/api.h> 627c478bd9Sstevel@tonic-gate #include <sys/crypto/impl.h> 637c478bd9Sstevel@tonic-gate #include <sys/crypto/sched_impl.h> 647c478bd9Sstevel@tonic-gate #include <sys/random.h> 657c478bd9Sstevel@tonic-gate #include <sys/sha1.h> 667c478bd9Sstevel@tonic-gate #include <sys/time.h> 677c478bd9Sstevel@tonic-gate #include <sys/sysmacros.h> 687c478bd9Sstevel@tonic-gate #include <sys/cpuvar.h> 697c478bd9Sstevel@tonic-gate #include <sys/taskq.h> 70fe54a78eSHai-May Chao #include <rng/fips_random.h> 717c478bd9Sstevel@tonic-gate 727c478bd9Sstevel@tonic-gate #define RNDPOOLSIZE 1024 /* Pool size in bytes */ 737c478bd9Sstevel@tonic-gate #define MINEXTRACTBYTES 20 747c478bd9Sstevel@tonic-gate #define MAXEXTRACTBYTES 1024 757c478bd9Sstevel@tonic-gate #define PRNG_MAXOBLOCKS 1310720 /* Max output block per prng key */ 767c478bd9Sstevel@tonic-gate #define TIMEOUT_INTERVAL 5 /* Periodic mixing interval in secs */ 777c478bd9Sstevel@tonic-gate 787c478bd9Sstevel@tonic-gate typedef enum extract_type { 797c478bd9Sstevel@tonic-gate NONBLOCK_EXTRACT, 807c478bd9Sstevel@tonic-gate BLOCKING_EXTRACT, 817c478bd9Sstevel@tonic-gate ALWAYS_EXTRACT 827c478bd9Sstevel@tonic-gate } extract_type_t; 837c478bd9Sstevel@tonic-gate 847c478bd9Sstevel@tonic-gate /* 857c478bd9Sstevel@tonic-gate * Hash-algo generic definitions. For now, they are SHA1's. We use SHA1 867c478bd9Sstevel@tonic-gate * routines directly instead of using k-API because we can't return any 877c478bd9Sstevel@tonic-gate * error code in /dev/urandom case and we can get an error using k-API 887c478bd9Sstevel@tonic-gate * if a mechanism is disabled. 897c478bd9Sstevel@tonic-gate */ 907c478bd9Sstevel@tonic-gate #define HASHSIZE 20 917c478bd9Sstevel@tonic-gate #define HASH_CTX SHA1_CTX 927c478bd9Sstevel@tonic-gate #define HashInit(ctx) SHA1Init((ctx)) 937c478bd9Sstevel@tonic-gate #define HashUpdate(ctx, p, s) SHA1Update((ctx), (p), (s)) 947c478bd9Sstevel@tonic-gate #define HashFinal(d, ctx) SHA1Final((d), (ctx)) 957c478bd9Sstevel@tonic-gate 967c478bd9Sstevel@tonic-gate /* HMAC-SHA1 */ 977c478bd9Sstevel@tonic-gate #define HMAC_KEYSIZE 20 987c478bd9Sstevel@tonic-gate 997c478bd9Sstevel@tonic-gate /* 1007c478bd9Sstevel@tonic-gate * Cache of random bytes implemented as a circular buffer. findex and rindex 1017c478bd9Sstevel@tonic-gate * track the front and back of the circular buffer. 1027c478bd9Sstevel@tonic-gate */ 1037c478bd9Sstevel@tonic-gate uint8_t rndpool[RNDPOOLSIZE]; 1047c478bd9Sstevel@tonic-gate static int findex, rindex; 1057c478bd9Sstevel@tonic-gate static int rnbyte_cnt; /* Number of bytes in the cache */ 1067c478bd9Sstevel@tonic-gate 1077c478bd9Sstevel@tonic-gate static kmutex_t rndpool_lock; /* protects r/w accesses to the cache, */ 1087c478bd9Sstevel@tonic-gate /* and the global variables */ 1097c478bd9Sstevel@tonic-gate static kcondvar_t rndpool_read_cv; /* serializes poll/read syscalls */ 1107c478bd9Sstevel@tonic-gate static int num_waiters; /* #threads waiting to read from /dev/random */ 1117c478bd9Sstevel@tonic-gate 1127c478bd9Sstevel@tonic-gate static struct pollhead rnd_pollhead; 1137c478bd9Sstevel@tonic-gate static timeout_id_t kcf_rndtimeout_id; 1147c478bd9Sstevel@tonic-gate static crypto_mech_type_t rngmech_type = CRYPTO_MECH_INVALID; 1157c478bd9Sstevel@tonic-gate rnd_stats_t rnd_stats; 116f317a3a3Skrishna static boolean_t rng_prov_found = B_TRUE; 117f317a3a3Skrishna static boolean_t rng_ok_to_log = B_TRUE; 1187c478bd9Sstevel@tonic-gate 1197c478bd9Sstevel@tonic-gate static void rndc_addbytes(uint8_t *, size_t); 1207c478bd9Sstevel@tonic-gate static void rndc_getbytes(uint8_t *ptr, size_t len); 1217c478bd9Sstevel@tonic-gate static void rnd_handler(void *); 1227c478bd9Sstevel@tonic-gate static void rnd_alloc_magazines(); 1237c478bd9Sstevel@tonic-gate 1247c478bd9Sstevel@tonic-gate void 1257c478bd9Sstevel@tonic-gate kcf_rnd_init() 1267c478bd9Sstevel@tonic-gate { 1277c478bd9Sstevel@tonic-gate hrtime_t ts; 1287c478bd9Sstevel@tonic-gate time_t now; 1297c478bd9Sstevel@tonic-gate 1307c478bd9Sstevel@tonic-gate mutex_init(&rndpool_lock, NULL, MUTEX_DEFAULT, NULL); 1317c478bd9Sstevel@tonic-gate cv_init(&rndpool_read_cv, NULL, CV_DEFAULT, NULL); 1327c478bd9Sstevel@tonic-gate 1337c478bd9Sstevel@tonic-gate /* 1347c478bd9Sstevel@tonic-gate * Add bytes to the cache using 1357c478bd9Sstevel@tonic-gate * . 2 unpredictable times: high resolution time since the boot-time, 1367c478bd9Sstevel@tonic-gate * and the current time-of-the day. 1377c478bd9Sstevel@tonic-gate * This is used only to make the timeout value in the timer 1387c478bd9Sstevel@tonic-gate * unpredictable. 1397c478bd9Sstevel@tonic-gate */ 1407c478bd9Sstevel@tonic-gate ts = gethrtime(); 1417c478bd9Sstevel@tonic-gate rndc_addbytes((uint8_t *)&ts, sizeof (ts)); 1427c478bd9Sstevel@tonic-gate 1437c478bd9Sstevel@tonic-gate (void) drv_getparm(TIME, &now); 1447c478bd9Sstevel@tonic-gate rndc_addbytes((uint8_t *)&now, sizeof (now)); 1457c478bd9Sstevel@tonic-gate 1467c478bd9Sstevel@tonic-gate rnbyte_cnt = 0; 1477c478bd9Sstevel@tonic-gate findex = rindex = 0; 1487c478bd9Sstevel@tonic-gate num_waiters = 0; 1497c478bd9Sstevel@tonic-gate rngmech_type = KCF_MECHID(KCF_MISC_CLASS, 0); 1507c478bd9Sstevel@tonic-gate 1517c478bd9Sstevel@tonic-gate rnd_alloc_magazines(); 1527c478bd9Sstevel@tonic-gate } 1537c478bd9Sstevel@tonic-gate 1547c478bd9Sstevel@tonic-gate /* 1557c478bd9Sstevel@tonic-gate * Return TRUE if at least one provider exists that can 1567c478bd9Sstevel@tonic-gate * supply random numbers. 1577c478bd9Sstevel@tonic-gate */ 1587c478bd9Sstevel@tonic-gate boolean_t 1597c478bd9Sstevel@tonic-gate kcf_rngprov_check(void) 1607c478bd9Sstevel@tonic-gate { 1617c478bd9Sstevel@tonic-gate int rv; 1627c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd; 1637c478bd9Sstevel@tonic-gate 1647c478bd9Sstevel@tonic-gate if ((pd = kcf_get_mech_provider(rngmech_type, NULL, &rv, 1657c478bd9Sstevel@tonic-gate NULL, CRYPTO_FG_RANDOM, B_FALSE, 0)) != NULL) { 1667c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 167f317a3a3Skrishna /* 168f317a3a3Skrishna * We logged a warning once about no provider being available 169f317a3a3Skrishna * and now a provider became available. So, set the flag so 170f317a3a3Skrishna * that we can log again if the problem recurs. 171f317a3a3Skrishna */ 172f317a3a3Skrishna rng_ok_to_log = B_TRUE; 173f317a3a3Skrishna rng_prov_found = B_TRUE; 1747c478bd9Sstevel@tonic-gate return (B_TRUE); 175f317a3a3Skrishna } else { 176f317a3a3Skrishna rng_prov_found = B_FALSE; 1777c478bd9Sstevel@tonic-gate return (B_FALSE); 178f317a3a3Skrishna } 1797c478bd9Sstevel@tonic-gate } 1807c478bd9Sstevel@tonic-gate 1817c478bd9Sstevel@tonic-gate /* 1827c478bd9Sstevel@tonic-gate * Pick a software-based provider and submit a request to seed 1837c478bd9Sstevel@tonic-gate * its random number generator. 1847c478bd9Sstevel@tonic-gate */ 1857c478bd9Sstevel@tonic-gate static void 1868047c9fbSmcpowers rngprov_seed(uint8_t *buf, int len, uint_t entropy_est, uint32_t flags) 1877c478bd9Sstevel@tonic-gate { 1887c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd = NULL; 1897c478bd9Sstevel@tonic-gate 1906a1073f8Skrishna if (kcf_get_sw_prov(rngmech_type, &pd, NULL, B_FALSE) == 1916a1073f8Skrishna CRYPTO_SUCCESS) { 1928047c9fbSmcpowers (void) KCF_PROV_SEED_RANDOM(pd, pd->pd_sid, buf, len, 1938047c9fbSmcpowers entropy_est, flags, NULL); 1947c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 1957c478bd9Sstevel@tonic-gate } 1967c478bd9Sstevel@tonic-gate } 1977c478bd9Sstevel@tonic-gate 1987c478bd9Sstevel@tonic-gate /* 1997c478bd9Sstevel@tonic-gate * This routine is called for blocking reads. 2007c478bd9Sstevel@tonic-gate * 2017c478bd9Sstevel@tonic-gate * The argument is_taskq_thr indicates whether the caller is 2027c478bd9Sstevel@tonic-gate * the taskq thread dispatched by the timeout handler routine. 2037c478bd9Sstevel@tonic-gate * In this case, we cycle through all the providers 2047c478bd9Sstevel@tonic-gate * submitting a request to each provider to generate random numbers. 2057c478bd9Sstevel@tonic-gate * 2067c478bd9Sstevel@tonic-gate * For other cases, we pick a provider and submit a request to generate 2077c478bd9Sstevel@tonic-gate * random numbers. We retry using another provider if we get an error. 2087c478bd9Sstevel@tonic-gate * 2097c478bd9Sstevel@tonic-gate * Returns the number of bytes that are written to 'ptr'. Returns -1 2107c478bd9Sstevel@tonic-gate * if no provider is found. ptr and need are unchanged. 2117c478bd9Sstevel@tonic-gate */ 2127c478bd9Sstevel@tonic-gate static int 213*8b502715SKrishna Yenduri rngprov_getbytes(uint8_t *ptr, size_t need, boolean_t is_taskq_thr) 2147c478bd9Sstevel@tonic-gate { 2157c478bd9Sstevel@tonic-gate int rv; 2167c478bd9Sstevel@tonic-gate int prov_cnt = 0; 2177c478bd9Sstevel@tonic-gate int total_bytes = 0; 2187c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd; 2197c478bd9Sstevel@tonic-gate kcf_req_params_t params; 2207c478bd9Sstevel@tonic-gate kcf_prov_tried_t *list = NULL; 2217c478bd9Sstevel@tonic-gate 2227c478bd9Sstevel@tonic-gate while ((pd = kcf_get_mech_provider(rngmech_type, NULL, &rv, 2237c478bd9Sstevel@tonic-gate list, CRYPTO_FG_RANDOM, B_FALSE, 0)) != NULL) { 2247c478bd9Sstevel@tonic-gate 2257c478bd9Sstevel@tonic-gate prov_cnt++; 2267c478bd9Sstevel@tonic-gate 2277c478bd9Sstevel@tonic-gate KCF_WRAP_RANDOM_OPS_PARAMS(¶ms, KCF_OP_RANDOM_GENERATE, 2288047c9fbSmcpowers pd->pd_sid, ptr, need, 0, 0); 2297c478bd9Sstevel@tonic-gate rv = kcf_submit_request(pd, NULL, NULL, ¶ms, B_FALSE); 2307c478bd9Sstevel@tonic-gate ASSERT(rv != CRYPTO_QUEUED); 2317c478bd9Sstevel@tonic-gate 2327c478bd9Sstevel@tonic-gate if (rv == CRYPTO_SUCCESS) { 2337c478bd9Sstevel@tonic-gate total_bytes += need; 2347c478bd9Sstevel@tonic-gate if (is_taskq_thr) 2357c478bd9Sstevel@tonic-gate rndc_addbytes(ptr, need); 2367c478bd9Sstevel@tonic-gate else { 2377c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 2387c478bd9Sstevel@tonic-gate break; 2397c478bd9Sstevel@tonic-gate } 2407c478bd9Sstevel@tonic-gate } 2417c478bd9Sstevel@tonic-gate 2427c478bd9Sstevel@tonic-gate if (is_taskq_thr || rv != CRYPTO_SUCCESS) { 2437c478bd9Sstevel@tonic-gate /* Add pd to the linked list of providers tried. */ 2447c478bd9Sstevel@tonic-gate if (kcf_insert_triedlist(&list, pd, KM_SLEEP) == NULL) { 2457c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 2467c478bd9Sstevel@tonic-gate break; 2477c478bd9Sstevel@tonic-gate } 2487c478bd9Sstevel@tonic-gate } 2497c478bd9Sstevel@tonic-gate 2507c478bd9Sstevel@tonic-gate } 2517c478bd9Sstevel@tonic-gate 2527c478bd9Sstevel@tonic-gate if (list != NULL) 2537c478bd9Sstevel@tonic-gate kcf_free_triedlist(list); 2547c478bd9Sstevel@tonic-gate 2557c478bd9Sstevel@tonic-gate if (prov_cnt == 0) { /* no provider could be found. */ 256f317a3a3Skrishna rng_prov_found = B_FALSE; 2577c478bd9Sstevel@tonic-gate return (-1); 258f317a3a3Skrishna } else { 259f317a3a3Skrishna rng_prov_found = B_TRUE; 260f317a3a3Skrishna /* See comments in kcf_rngprov_check() */ 261f317a3a3Skrishna rng_ok_to_log = B_TRUE; 2627c478bd9Sstevel@tonic-gate } 2637c478bd9Sstevel@tonic-gate 2647c478bd9Sstevel@tonic-gate return (total_bytes); 2657c478bd9Sstevel@tonic-gate } 2667c478bd9Sstevel@tonic-gate 2677c478bd9Sstevel@tonic-gate static void 2687c478bd9Sstevel@tonic-gate notify_done(void *arg, int rv) 2697c478bd9Sstevel@tonic-gate { 2707c478bd9Sstevel@tonic-gate uchar_t *rndbuf = arg; 2717c478bd9Sstevel@tonic-gate 2727c478bd9Sstevel@tonic-gate if (rv == CRYPTO_SUCCESS) 2737c478bd9Sstevel@tonic-gate rndc_addbytes(rndbuf, MINEXTRACTBYTES); 2747c478bd9Sstevel@tonic-gate 2757c478bd9Sstevel@tonic-gate bzero(rndbuf, MINEXTRACTBYTES); 2767c478bd9Sstevel@tonic-gate kmem_free(rndbuf, MINEXTRACTBYTES); 2777c478bd9Sstevel@tonic-gate } 2787c478bd9Sstevel@tonic-gate 2797c478bd9Sstevel@tonic-gate /* 2807c478bd9Sstevel@tonic-gate * Cycle through all the providers submitting a request to each provider 2817c478bd9Sstevel@tonic-gate * to generate random numbers. This is called for the modes - NONBLOCK_EXTRACT 2827c478bd9Sstevel@tonic-gate * and ALWAYS_EXTRACT. 2837c478bd9Sstevel@tonic-gate * 2847c478bd9Sstevel@tonic-gate * Returns the number of bytes that are written to 'ptr'. Returns -1 2857c478bd9Sstevel@tonic-gate * if no provider is found. ptr and len are unchanged. 2867c478bd9Sstevel@tonic-gate */ 2877c478bd9Sstevel@tonic-gate static int 288*8b502715SKrishna Yenduri rngprov_getbytes_nblk(uint8_t *ptr, size_t len) 2897c478bd9Sstevel@tonic-gate { 2907c478bd9Sstevel@tonic-gate int rv, blen, total_bytes; 2917c478bd9Sstevel@tonic-gate uchar_t *rndbuf; 2927c478bd9Sstevel@tonic-gate kcf_provider_desc_t *pd; 2937c478bd9Sstevel@tonic-gate kcf_req_params_t params; 2947c478bd9Sstevel@tonic-gate crypto_call_req_t req; 2957c478bd9Sstevel@tonic-gate kcf_prov_tried_t *list = NULL; 2967c478bd9Sstevel@tonic-gate int prov_cnt = 0; 2977c478bd9Sstevel@tonic-gate 2987c478bd9Sstevel@tonic-gate blen = 0; 2997c478bd9Sstevel@tonic-gate total_bytes = 0; 3007c478bd9Sstevel@tonic-gate req.cr_flag = CRYPTO_SKIP_REQID; 3017c478bd9Sstevel@tonic-gate req.cr_callback_func = notify_done; 3027c478bd9Sstevel@tonic-gate 3037c478bd9Sstevel@tonic-gate while ((pd = kcf_get_mech_provider(rngmech_type, NULL, &rv, 3047c478bd9Sstevel@tonic-gate list, CRYPTO_FG_RANDOM, CHECK_RESTRICT(&req), 0)) != NULL) { 3057c478bd9Sstevel@tonic-gate 3067c478bd9Sstevel@tonic-gate prov_cnt ++; 3077c478bd9Sstevel@tonic-gate switch (pd->pd_prov_type) { 3087c478bd9Sstevel@tonic-gate case CRYPTO_HW_PROVIDER: 3097c478bd9Sstevel@tonic-gate /* 3107c478bd9Sstevel@tonic-gate * We have to allocate a buffer here as we can not 3117c478bd9Sstevel@tonic-gate * assume that the input buffer will remain valid 3127c478bd9Sstevel@tonic-gate * when the callback comes. We use a fixed size buffer 3137c478bd9Sstevel@tonic-gate * to simplify the book keeping. 3147c478bd9Sstevel@tonic-gate */ 3157c478bd9Sstevel@tonic-gate rndbuf = kmem_alloc(MINEXTRACTBYTES, KM_NOSLEEP); 3167c478bd9Sstevel@tonic-gate if (rndbuf == NULL) { 3177c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 3187c478bd9Sstevel@tonic-gate if (list != NULL) 3197c478bd9Sstevel@tonic-gate kcf_free_triedlist(list); 3207c478bd9Sstevel@tonic-gate return (total_bytes); 3217c478bd9Sstevel@tonic-gate } 3227c478bd9Sstevel@tonic-gate req.cr_callback_arg = rndbuf; 3237c478bd9Sstevel@tonic-gate KCF_WRAP_RANDOM_OPS_PARAMS(¶ms, 3247c478bd9Sstevel@tonic-gate KCF_OP_RANDOM_GENERATE, 3258047c9fbSmcpowers pd->pd_sid, rndbuf, MINEXTRACTBYTES, 0, 0); 3267c478bd9Sstevel@tonic-gate break; 3277c478bd9Sstevel@tonic-gate 3287c478bd9Sstevel@tonic-gate case CRYPTO_SW_PROVIDER: 3297c478bd9Sstevel@tonic-gate /* 3307c478bd9Sstevel@tonic-gate * We do not need to allocate a buffer in the software 3317c478bd9Sstevel@tonic-gate * provider case as there is no callback involved. We 3327c478bd9Sstevel@tonic-gate * avoid any extra data copy by directly passing 'ptr'. 3337c478bd9Sstevel@tonic-gate */ 3347c478bd9Sstevel@tonic-gate KCF_WRAP_RANDOM_OPS_PARAMS(¶ms, 3357c478bd9Sstevel@tonic-gate KCF_OP_RANDOM_GENERATE, 3368047c9fbSmcpowers pd->pd_sid, ptr, len, 0, 0); 3377c478bd9Sstevel@tonic-gate break; 3387c478bd9Sstevel@tonic-gate } 3397c478bd9Sstevel@tonic-gate 3407c478bd9Sstevel@tonic-gate rv = kcf_submit_request(pd, NULL, &req, ¶ms, B_FALSE); 3417c478bd9Sstevel@tonic-gate if (rv == CRYPTO_SUCCESS) { 3427c478bd9Sstevel@tonic-gate switch (pd->pd_prov_type) { 3437c478bd9Sstevel@tonic-gate case CRYPTO_HW_PROVIDER: 3447c478bd9Sstevel@tonic-gate /* 3457c478bd9Sstevel@tonic-gate * Since we have the input buffer handy, 3467c478bd9Sstevel@tonic-gate * we directly copy to it rather than 3477c478bd9Sstevel@tonic-gate * adding to the pool. 3487c478bd9Sstevel@tonic-gate */ 3497c478bd9Sstevel@tonic-gate blen = min(MINEXTRACTBYTES, len); 3507c478bd9Sstevel@tonic-gate bcopy(rndbuf, ptr, blen); 3517c478bd9Sstevel@tonic-gate if (len < MINEXTRACTBYTES) 3527c478bd9Sstevel@tonic-gate rndc_addbytes(rndbuf + len, 3537c478bd9Sstevel@tonic-gate MINEXTRACTBYTES - len); 3547c478bd9Sstevel@tonic-gate ptr += blen; 3557c478bd9Sstevel@tonic-gate len -= blen; 3567c478bd9Sstevel@tonic-gate total_bytes += blen; 3577c478bd9Sstevel@tonic-gate break; 3587c478bd9Sstevel@tonic-gate 3597c478bd9Sstevel@tonic-gate case CRYPTO_SW_PROVIDER: 3607c478bd9Sstevel@tonic-gate total_bytes += len; 3617c478bd9Sstevel@tonic-gate len = 0; 3627c478bd9Sstevel@tonic-gate break; 3637c478bd9Sstevel@tonic-gate } 3647c478bd9Sstevel@tonic-gate } 3657c478bd9Sstevel@tonic-gate 3667c478bd9Sstevel@tonic-gate /* 3677c478bd9Sstevel@tonic-gate * We free the buffer in the callback routine 3687c478bd9Sstevel@tonic-gate * for the CRYPTO_QUEUED case. 3697c478bd9Sstevel@tonic-gate */ 3707c478bd9Sstevel@tonic-gate if (pd->pd_prov_type == CRYPTO_HW_PROVIDER && 3717c478bd9Sstevel@tonic-gate rv != CRYPTO_QUEUED) { 3727c478bd9Sstevel@tonic-gate bzero(rndbuf, MINEXTRACTBYTES); 3737c478bd9Sstevel@tonic-gate kmem_free(rndbuf, MINEXTRACTBYTES); 3747c478bd9Sstevel@tonic-gate } 3757c478bd9Sstevel@tonic-gate 3767c478bd9Sstevel@tonic-gate if (len == 0) { 3777c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 3787c478bd9Sstevel@tonic-gate break; 3797c478bd9Sstevel@tonic-gate } 3807c478bd9Sstevel@tonic-gate 3817c478bd9Sstevel@tonic-gate if (rv != CRYPTO_SUCCESS) { 3827c478bd9Sstevel@tonic-gate /* Add pd to the linked list of providers tried. */ 3837c478bd9Sstevel@tonic-gate if (kcf_insert_triedlist(&list, pd, KM_NOSLEEP) == 3847c478bd9Sstevel@tonic-gate NULL) { 3857c478bd9Sstevel@tonic-gate KCF_PROV_REFRELE(pd); 3867c478bd9Sstevel@tonic-gate break; 3877c478bd9Sstevel@tonic-gate } 3887c478bd9Sstevel@tonic-gate } 3897c478bd9Sstevel@tonic-gate } 3907c478bd9Sstevel@tonic-gate 3917c478bd9Sstevel@tonic-gate if (list != NULL) { 3927c478bd9Sstevel@tonic-gate kcf_free_triedlist(list); 3937c478bd9Sstevel@tonic-gate } 3947c478bd9Sstevel@tonic-gate 3957c478bd9Sstevel@tonic-gate if (prov_cnt == 0) { /* no provider could be found. */ 396f317a3a3Skrishna rng_prov_found = B_FALSE; 3977c478bd9Sstevel@tonic-gate return (-1); 398f317a3a3Skrishna } else { 399f317a3a3Skrishna rng_prov_found = B_TRUE; 400f317a3a3Skrishna /* See comments in kcf_rngprov_check() */ 401f317a3a3Skrishna rng_ok_to_log = B_TRUE; 4027c478bd9Sstevel@tonic-gate } 4037c478bd9Sstevel@tonic-gate 4047c478bd9Sstevel@tonic-gate return (total_bytes); 4057c478bd9Sstevel@tonic-gate } 4067c478bd9Sstevel@tonic-gate 4077c478bd9Sstevel@tonic-gate static void 4087c478bd9Sstevel@tonic-gate rngprov_task(void *arg) 4097c478bd9Sstevel@tonic-gate { 4107c478bd9Sstevel@tonic-gate int len = (int)(uintptr_t)arg; 4117c478bd9Sstevel@tonic-gate uchar_t tbuf[MAXEXTRACTBYTES]; 4127c478bd9Sstevel@tonic-gate 4137c478bd9Sstevel@tonic-gate ASSERT(len <= MAXEXTRACTBYTES); 414*8b502715SKrishna Yenduri (void) rngprov_getbytes(tbuf, len, B_TRUE); 4157c478bd9Sstevel@tonic-gate } 4167c478bd9Sstevel@tonic-gate 4177c478bd9Sstevel@tonic-gate /* 4187c478bd9Sstevel@tonic-gate * Returns "len" random or pseudo-random bytes in *ptr. 4197c478bd9Sstevel@tonic-gate * Will block if not enough random bytes are available and the 4207c478bd9Sstevel@tonic-gate * call is blocking. 4217c478bd9Sstevel@tonic-gate * 4227c478bd9Sstevel@tonic-gate * Called with rndpool_lock held (allowing caller to do optimistic locking; 4237c478bd9Sstevel@tonic-gate * releases the lock before return). 4247c478bd9Sstevel@tonic-gate */ 4257c478bd9Sstevel@tonic-gate static int 426*8b502715SKrishna Yenduri rnd_get_bytes(uint8_t *ptr, size_t len, extract_type_t how) 4277c478bd9Sstevel@tonic-gate { 4287c478bd9Sstevel@tonic-gate int bytes; 4297c478bd9Sstevel@tonic-gate size_t got; 4307c478bd9Sstevel@tonic-gate 4317c478bd9Sstevel@tonic-gate ASSERT(mutex_owned(&rndpool_lock)); 4327c478bd9Sstevel@tonic-gate /* 4337c478bd9Sstevel@tonic-gate * Check if the request can be satisfied from the cache 4347c478bd9Sstevel@tonic-gate * of random bytes. 4357c478bd9Sstevel@tonic-gate */ 4367c478bd9Sstevel@tonic-gate if (len <= rnbyte_cnt) { 4377c478bd9Sstevel@tonic-gate rndc_getbytes(ptr, len); 4387c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 4397c478bd9Sstevel@tonic-gate return (0); 4407c478bd9Sstevel@tonic-gate } 4417c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 4427c478bd9Sstevel@tonic-gate 4437c478bd9Sstevel@tonic-gate switch (how) { 4447c478bd9Sstevel@tonic-gate case BLOCKING_EXTRACT: 445*8b502715SKrishna Yenduri if ((got = rngprov_getbytes(ptr, len, B_FALSE)) == -1) 4467c478bd9Sstevel@tonic-gate break; /* No provider found */ 4477c478bd9Sstevel@tonic-gate 4487c478bd9Sstevel@tonic-gate if (got == len) 4497c478bd9Sstevel@tonic-gate return (0); 4507c478bd9Sstevel@tonic-gate len -= got; 4517c478bd9Sstevel@tonic-gate ptr += got; 4527c478bd9Sstevel@tonic-gate break; 4537c478bd9Sstevel@tonic-gate 4547c478bd9Sstevel@tonic-gate case NONBLOCK_EXTRACT: 4557c478bd9Sstevel@tonic-gate case ALWAYS_EXTRACT: 456*8b502715SKrishna Yenduri if ((got = rngprov_getbytes_nblk(ptr, len)) == -1) { 4577c478bd9Sstevel@tonic-gate /* No provider found */ 4587c478bd9Sstevel@tonic-gate if (how == NONBLOCK_EXTRACT) { 4597c478bd9Sstevel@tonic-gate return (EAGAIN); 4607c478bd9Sstevel@tonic-gate } 4617c478bd9Sstevel@tonic-gate } else { 4627c478bd9Sstevel@tonic-gate if (got == len) 4637c478bd9Sstevel@tonic-gate return (0); 4647c478bd9Sstevel@tonic-gate len -= got; 4657c478bd9Sstevel@tonic-gate ptr += got; 4667c478bd9Sstevel@tonic-gate } 4677c478bd9Sstevel@tonic-gate if (how == NONBLOCK_EXTRACT && (rnbyte_cnt < len)) 4687c478bd9Sstevel@tonic-gate return (EAGAIN); 4697c478bd9Sstevel@tonic-gate break; 4707c478bd9Sstevel@tonic-gate } 4717c478bd9Sstevel@tonic-gate 4727c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 4737c478bd9Sstevel@tonic-gate while (len > 0) { 4747c478bd9Sstevel@tonic-gate if (how == BLOCKING_EXTRACT) { 4757c478bd9Sstevel@tonic-gate /* Check if there is enough */ 4767c478bd9Sstevel@tonic-gate while (rnbyte_cnt < MINEXTRACTBYTES) { 4777c478bd9Sstevel@tonic-gate num_waiters++; 4787c478bd9Sstevel@tonic-gate if (cv_wait_sig(&rndpool_read_cv, 4797c478bd9Sstevel@tonic-gate &rndpool_lock) == 0) { 4807c478bd9Sstevel@tonic-gate num_waiters--; 4817c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 4827c478bd9Sstevel@tonic-gate return (EINTR); 4837c478bd9Sstevel@tonic-gate } 4847c478bd9Sstevel@tonic-gate num_waiters--; 4857c478bd9Sstevel@tonic-gate } 4867c478bd9Sstevel@tonic-gate } 4877c478bd9Sstevel@tonic-gate 4887c478bd9Sstevel@tonic-gate /* Figure out how many bytes to extract */ 4897c478bd9Sstevel@tonic-gate bytes = min(len, rnbyte_cnt); 4907c478bd9Sstevel@tonic-gate rndc_getbytes(ptr, bytes); 4917c478bd9Sstevel@tonic-gate 4927c478bd9Sstevel@tonic-gate len -= bytes; 4937c478bd9Sstevel@tonic-gate ptr += bytes; 4947c478bd9Sstevel@tonic-gate 4957c478bd9Sstevel@tonic-gate if (len > 0 && how == ALWAYS_EXTRACT) { 4967c478bd9Sstevel@tonic-gate /* 4977c478bd9Sstevel@tonic-gate * There are not enough bytes, but we can not block. 4987c478bd9Sstevel@tonic-gate * This only happens in the case of /dev/urandom which 4997c478bd9Sstevel@tonic-gate * runs an additional generation algorithm. So, there 5007c478bd9Sstevel@tonic-gate * is no problem. 5017c478bd9Sstevel@tonic-gate */ 5027c478bd9Sstevel@tonic-gate while (len > 0) { 5037c478bd9Sstevel@tonic-gate *ptr = rndpool[findex]; 5047c478bd9Sstevel@tonic-gate ptr++; len--; 5057c478bd9Sstevel@tonic-gate rindex = findex = (findex + 1) & 5067c478bd9Sstevel@tonic-gate (RNDPOOLSIZE - 1); 5077c478bd9Sstevel@tonic-gate } 5087c478bd9Sstevel@tonic-gate break; 5097c478bd9Sstevel@tonic-gate } 5107c478bd9Sstevel@tonic-gate } 5117c478bd9Sstevel@tonic-gate 5127c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 5137c478bd9Sstevel@tonic-gate return (0); 5147c478bd9Sstevel@tonic-gate } 5157c478bd9Sstevel@tonic-gate 5167c478bd9Sstevel@tonic-gate int 517*8b502715SKrishna Yenduri kcf_rnd_get_bytes(uint8_t *ptr, size_t len, boolean_t noblock) 5187c478bd9Sstevel@tonic-gate { 5197c478bd9Sstevel@tonic-gate extract_type_t how; 5207c478bd9Sstevel@tonic-gate int error; 5217c478bd9Sstevel@tonic-gate 5227c478bd9Sstevel@tonic-gate how = noblock ? NONBLOCK_EXTRACT : BLOCKING_EXTRACT; 5237c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 524*8b502715SKrishna Yenduri if ((error = rnd_get_bytes(ptr, len, how)) != 0) 5257c478bd9Sstevel@tonic-gate return (error); 5267c478bd9Sstevel@tonic-gate 5277c478bd9Sstevel@tonic-gate BUMP_RND_STATS(rs_rndOut, len); 5287c478bd9Sstevel@tonic-gate return (0); 5297c478bd9Sstevel@tonic-gate } 5307c478bd9Sstevel@tonic-gate 5317c478bd9Sstevel@tonic-gate /* 5327c478bd9Sstevel@tonic-gate * Revisit this if the structs grow or we come up with a better way 5337c478bd9Sstevel@tonic-gate * of cache-line-padding structures. 5347c478bd9Sstevel@tonic-gate */ 5357c478bd9Sstevel@tonic-gate #define RND_CPU_CACHE_SIZE 64 536fe54a78eSHai-May Chao #define RND_CPU_PAD_SIZE RND_CPU_CACHE_SIZE*6 5377c478bd9Sstevel@tonic-gate #define RND_CPU_PAD (RND_CPU_PAD_SIZE - \ 538fe54a78eSHai-May Chao sizeof (rndmag_t)) 5397c478bd9Sstevel@tonic-gate /* 5407c478bd9Sstevel@tonic-gate * Per-CPU random state. Somewhat like like kmem's magazines, this provides 5417c478bd9Sstevel@tonic-gate * a per-CPU instance of the pseudo-random generator. We have it much easier 5427c478bd9Sstevel@tonic-gate * than kmem, as we can afford to "leak" random bits if a CPU is DR'ed out. 5437c478bd9Sstevel@tonic-gate * 5447c478bd9Sstevel@tonic-gate * Note that this usage is preemption-safe; a thread 5457c478bd9Sstevel@tonic-gate * entering a critical section remembers which generator it locked 5467c478bd9Sstevel@tonic-gate * and unlocks the same one; should it be preempted and wind up running on 5477c478bd9Sstevel@tonic-gate * a different CPU, there will be a brief period of increased contention 5487c478bd9Sstevel@tonic-gate * before it exits the critical section but nothing will melt. 5497c478bd9Sstevel@tonic-gate */ 5507c478bd9Sstevel@tonic-gate typedef struct rndmag_s 5517c478bd9Sstevel@tonic-gate { 5527c478bd9Sstevel@tonic-gate kmutex_t rm_lock; 55356498af3SHai-May Chao uint8_t *rm_buffer; /* Start of buffer */ 5547c478bd9Sstevel@tonic-gate uint8_t *rm_eptr; /* End of buffer */ 5557c478bd9Sstevel@tonic-gate uint8_t *rm_rptr; /* Current read pointer */ 5567c478bd9Sstevel@tonic-gate uint32_t rm_oblocks; /* time to rekey? */ 5577c478bd9Sstevel@tonic-gate uint32_t rm_ofuzz; /* Rekey backoff state */ 5587c478bd9Sstevel@tonic-gate uint32_t rm_olimit; /* Hard rekey limit */ 5597c478bd9Sstevel@tonic-gate rnd_stats_t rm_stats; /* Per-CPU Statistics */ 56056498af3SHai-May Chao uint32_t rm_key[HASHSIZE/BYTES_IN_WORD]; /* FIPS XKEY */ 56156498af3SHai-May Chao uint32_t rm_seed[HASHSIZE/BYTES_IN_WORD]; /* seed for rekey */ 56256498af3SHai-May Chao uint32_t rm_previous[HASHSIZE/BYTES_IN_WORD]; /* prev random */ 5637c478bd9Sstevel@tonic-gate } rndmag_t; 5647c478bd9Sstevel@tonic-gate 565fe54a78eSHai-May Chao typedef struct rndmag_pad_s 566fe54a78eSHai-May Chao { 567fe54a78eSHai-May Chao rndmag_t rm_mag; 568fe54a78eSHai-May Chao uint8_t rm_pad[RND_CPU_PAD]; 569fe54a78eSHai-May Chao } rndmag_pad_t; 570fe54a78eSHai-May Chao 5717c478bd9Sstevel@tonic-gate /* 572fe54a78eSHai-May Chao * Generate random bytes for /dev/urandom by applying the 573fe54a78eSHai-May Chao * FIPS 186-2 algorithm with a key created from bytes extracted 5747c478bd9Sstevel@tonic-gate * from the pool. A maximum of PRNG_MAXOBLOCKS output blocks 5757c478bd9Sstevel@tonic-gate * is generated before a new key is obtained. 5767c478bd9Sstevel@tonic-gate * 5777c478bd9Sstevel@tonic-gate * Note that callers to this routine are likely to assume it can't fail. 5787c478bd9Sstevel@tonic-gate * 5797c478bd9Sstevel@tonic-gate * Called with rmp locked; releases lock. 5807c478bd9Sstevel@tonic-gate */ 5817c478bd9Sstevel@tonic-gate static int 582fe54a78eSHai-May Chao rnd_generate_pseudo_bytes(rndmag_pad_t *rmp, uint8_t *ptr, size_t len) 5837c478bd9Sstevel@tonic-gate { 5847c478bd9Sstevel@tonic-gate size_t bytes = len; 5857c478bd9Sstevel@tonic-gate int nblock, size; 5867c478bd9Sstevel@tonic-gate uint32_t oblocks; 58756498af3SHai-May Chao uint32_t tempout[HASHSIZE/BYTES_IN_WORD]; 58856498af3SHai-May Chao uint32_t seed[HASHSIZE/BYTES_IN_WORD]; 589fe54a78eSHai-May Chao int i; 590fe54a78eSHai-May Chao hrtime_t timestamp; 591fe54a78eSHai-May Chao uint8_t *src, *dst; 5927c478bd9Sstevel@tonic-gate 593fe54a78eSHai-May Chao ASSERT(mutex_owned(&rmp->rm_mag.rm_lock)); 5947c478bd9Sstevel@tonic-gate 5957c478bd9Sstevel@tonic-gate /* Nothing is being asked */ 5967c478bd9Sstevel@tonic-gate if (len == 0) { 597fe54a78eSHai-May Chao mutex_exit(&rmp->rm_mag.rm_lock); 5987c478bd9Sstevel@tonic-gate return (0); 5997c478bd9Sstevel@tonic-gate } 6007c478bd9Sstevel@tonic-gate 6017c478bd9Sstevel@tonic-gate nblock = howmany(len, HASHSIZE); 6027c478bd9Sstevel@tonic-gate 603fe54a78eSHai-May Chao rmp->rm_mag.rm_oblocks += nblock; 604fe54a78eSHai-May Chao oblocks = rmp->rm_mag.rm_oblocks; 6057c478bd9Sstevel@tonic-gate 6067c478bd9Sstevel@tonic-gate do { 607fe54a78eSHai-May Chao if (oblocks >= rmp->rm_mag.rm_olimit) { 6087c478bd9Sstevel@tonic-gate 6097c478bd9Sstevel@tonic-gate /* 6107c478bd9Sstevel@tonic-gate * Contention-avoiding rekey: see if 6117c478bd9Sstevel@tonic-gate * the pool is locked, and if so, wait a bit. 6127c478bd9Sstevel@tonic-gate * Do an 'exponential back-in' to ensure we don't 6137c478bd9Sstevel@tonic-gate * run too long without rekey. 6147c478bd9Sstevel@tonic-gate */ 615fe54a78eSHai-May Chao if (rmp->rm_mag.rm_ofuzz) { 6167c478bd9Sstevel@tonic-gate /* 6177c478bd9Sstevel@tonic-gate * Decaying exponential back-in for rekey. 6187c478bd9Sstevel@tonic-gate */ 6197c478bd9Sstevel@tonic-gate if ((rnbyte_cnt < MINEXTRACTBYTES) || 6207c478bd9Sstevel@tonic-gate (!mutex_tryenter(&rndpool_lock))) { 621fe54a78eSHai-May Chao rmp->rm_mag.rm_olimit += 622fe54a78eSHai-May Chao rmp->rm_mag.rm_ofuzz; 623fe54a78eSHai-May Chao rmp->rm_mag.rm_ofuzz >>= 1; 6247c478bd9Sstevel@tonic-gate goto punt; 6257c478bd9Sstevel@tonic-gate } 6267c478bd9Sstevel@tonic-gate } else { 6277c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 6287c478bd9Sstevel@tonic-gate } 6297c478bd9Sstevel@tonic-gate 6307c478bd9Sstevel@tonic-gate /* Get a new chunk of entropy */ 631fe54a78eSHai-May Chao (void) rnd_get_bytes((uint8_t *)rmp->rm_mag.rm_key, 632*8b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 633fe54a78eSHai-May Chao 634fe54a78eSHai-May Chao rmp->rm_mag.rm_olimit = PRNG_MAXOBLOCKS/2; 635fe54a78eSHai-May Chao rmp->rm_mag.rm_ofuzz = PRNG_MAXOBLOCKS/4; 6367c478bd9Sstevel@tonic-gate oblocks = 0; 637fe54a78eSHai-May Chao rmp->rm_mag.rm_oblocks = nblock; 6387c478bd9Sstevel@tonic-gate } 6397c478bd9Sstevel@tonic-gate punt: 640fe54a78eSHai-May Chao timestamp = gethrtime(); 641fe54a78eSHai-May Chao 642fe54a78eSHai-May Chao src = (uint8_t *)×tamp; 643fe54a78eSHai-May Chao dst = (uint8_t *)rmp->rm_mag.rm_seed; 644fe54a78eSHai-May Chao 645fe54a78eSHai-May Chao for (i = 0; i < HASHSIZE; i++) { 646fe54a78eSHai-May Chao dst[i] ^= src[i % sizeof (timestamp)]; 647fe54a78eSHai-May Chao } 648fe54a78eSHai-May Chao 649fe54a78eSHai-May Chao bcopy(rmp->rm_mag.rm_seed, seed, HASHSIZE); 650fe54a78eSHai-May Chao 651fe54a78eSHai-May Chao fips_random_inner(rmp->rm_mag.rm_key, tempout, 652fe54a78eSHai-May Chao seed); 653fe54a78eSHai-May Chao 6547c478bd9Sstevel@tonic-gate if (bytes >= HASHSIZE) { 6557c478bd9Sstevel@tonic-gate size = HASHSIZE; 6567c478bd9Sstevel@tonic-gate } else { 6577c478bd9Sstevel@tonic-gate size = min(bytes, HASHSIZE); 6587c478bd9Sstevel@tonic-gate } 659fe54a78eSHai-May Chao 660fe54a78eSHai-May Chao /* 661fe54a78eSHai-May Chao * FIPS 140-2: Continuous RNG test - each generation 662fe54a78eSHai-May Chao * of an n-bit block shall be compared with the previously 663fe54a78eSHai-May Chao * generated block. Test shall fail if any two compared 664fe54a78eSHai-May Chao * n-bit blocks are equal. 665fe54a78eSHai-May Chao */ 66656498af3SHai-May Chao for (i = 0; i < HASHSIZE/BYTES_IN_WORD; i++) { 667fe54a78eSHai-May Chao if (tempout[i] != rmp->rm_mag.rm_previous[i]) 668fe54a78eSHai-May Chao break; 669fe54a78eSHai-May Chao } 67056498af3SHai-May Chao if (i == HASHSIZE/BYTES_IN_WORD) 671fe54a78eSHai-May Chao cmn_err(CE_WARN, "kcf_random: The value of 160-bit " 672fe54a78eSHai-May Chao "block random bytes are same as the previous " 673fe54a78eSHai-May Chao "one.\n"); 674fe54a78eSHai-May Chao 675fe54a78eSHai-May Chao bcopy(tempout, rmp->rm_mag.rm_previous, 676fe54a78eSHai-May Chao HASHSIZE); 677fe54a78eSHai-May Chao 678fe54a78eSHai-May Chao bcopy(tempout, ptr, size); 6797c478bd9Sstevel@tonic-gate ptr += size; 6807c478bd9Sstevel@tonic-gate bytes -= size; 6817c478bd9Sstevel@tonic-gate oblocks++; 6827c478bd9Sstevel@tonic-gate nblock--; 6837c478bd9Sstevel@tonic-gate } while (bytes > 0); 6847c478bd9Sstevel@tonic-gate 685fe54a78eSHai-May Chao /* Zero out sensitive information */ 686fe54a78eSHai-May Chao bzero(seed, HASHSIZE); 687fe54a78eSHai-May Chao bzero(tempout, HASHSIZE); 688fe54a78eSHai-May Chao mutex_exit(&rmp->rm_mag.rm_lock); 6897c478bd9Sstevel@tonic-gate return (0); 6907c478bd9Sstevel@tonic-gate } 6917c478bd9Sstevel@tonic-gate 6927c478bd9Sstevel@tonic-gate /* 6937c478bd9Sstevel@tonic-gate * Per-CPU Random magazines. 6947c478bd9Sstevel@tonic-gate */ 695fe54a78eSHai-May Chao static rndmag_pad_t *rndmag; 6967c478bd9Sstevel@tonic-gate static uint8_t *rndbuf; 6977c478bd9Sstevel@tonic-gate static size_t rndmag_total; 6987c478bd9Sstevel@tonic-gate /* 6997c478bd9Sstevel@tonic-gate * common/os/cpu.c says that platform support code can shrinkwrap 7007c478bd9Sstevel@tonic-gate * max_ncpus. On the off chance that we get loaded very early, we 7017c478bd9Sstevel@tonic-gate * read it exactly once, to copy it here. 7027c478bd9Sstevel@tonic-gate */ 7037c478bd9Sstevel@tonic-gate static uint32_t random_max_ncpus = 0; 7047c478bd9Sstevel@tonic-gate 7057c478bd9Sstevel@tonic-gate /* 7067c478bd9Sstevel@tonic-gate * Boot-time tunables, for experimentation. 7077c478bd9Sstevel@tonic-gate */ 70802f574f0Skais size_t rndmag_threshold = 2560; 70902f574f0Skais size_t rndbuf_len = 5120; 710fa626f0cSkrishna size_t rndmag_size = 1280; 7117c478bd9Sstevel@tonic-gate 7127c478bd9Sstevel@tonic-gate 7137c478bd9Sstevel@tonic-gate int 7147c478bd9Sstevel@tonic-gate kcf_rnd_get_pseudo_bytes(uint8_t *ptr, size_t len) 7157c478bd9Sstevel@tonic-gate { 716fe54a78eSHai-May Chao rndmag_pad_t *rmp; 7177c478bd9Sstevel@tonic-gate uint8_t *cptr, *eptr; 7187c478bd9Sstevel@tonic-gate 7197c478bd9Sstevel@tonic-gate /* 7207c478bd9Sstevel@tonic-gate * Anyone who asks for zero bytes of randomness should get slapped. 7217c478bd9Sstevel@tonic-gate */ 7227c478bd9Sstevel@tonic-gate ASSERT(len > 0); 7237c478bd9Sstevel@tonic-gate 7247c478bd9Sstevel@tonic-gate /* 7257c478bd9Sstevel@tonic-gate * Fast path. 7267c478bd9Sstevel@tonic-gate */ 7277c478bd9Sstevel@tonic-gate for (;;) { 7287c478bd9Sstevel@tonic-gate rmp = &rndmag[CPU->cpu_seqid]; 729fe54a78eSHai-May Chao mutex_enter(&rmp->rm_mag.rm_lock); 7307c478bd9Sstevel@tonic-gate 7317c478bd9Sstevel@tonic-gate /* 7327c478bd9Sstevel@tonic-gate * Big requests bypass buffer and tail-call the 7337c478bd9Sstevel@tonic-gate * generate routine directly. 7347c478bd9Sstevel@tonic-gate */ 7357c478bd9Sstevel@tonic-gate if (len > rndmag_threshold) { 7367c478bd9Sstevel@tonic-gate BUMP_CPU_RND_STATS(rmp, rs_urndOut, len); 7377c478bd9Sstevel@tonic-gate return (rnd_generate_pseudo_bytes(rmp, ptr, len)); 7387c478bd9Sstevel@tonic-gate } 7397c478bd9Sstevel@tonic-gate 740fe54a78eSHai-May Chao cptr = rmp->rm_mag.rm_rptr; 7417c478bd9Sstevel@tonic-gate eptr = cptr + len; 7427c478bd9Sstevel@tonic-gate 743fe54a78eSHai-May Chao if (eptr <= rmp->rm_mag.rm_eptr) { 744fe54a78eSHai-May Chao rmp->rm_mag.rm_rptr = eptr; 7457c478bd9Sstevel@tonic-gate bcopy(cptr, ptr, len); 7467c478bd9Sstevel@tonic-gate BUMP_CPU_RND_STATS(rmp, rs_urndOut, len); 747fe54a78eSHai-May Chao mutex_exit(&rmp->rm_mag.rm_lock); 7487c478bd9Sstevel@tonic-gate 7497c478bd9Sstevel@tonic-gate return (0); 7507c478bd9Sstevel@tonic-gate } 7517c478bd9Sstevel@tonic-gate /* 7527c478bd9Sstevel@tonic-gate * End fast path. 7537c478bd9Sstevel@tonic-gate */ 754fe54a78eSHai-May Chao rmp->rm_mag.rm_rptr = rmp->rm_mag.rm_buffer; 7557c478bd9Sstevel@tonic-gate /* 7567c478bd9Sstevel@tonic-gate * Note: We assume the generate routine always succeeds 7577c478bd9Sstevel@tonic-gate * in this case (because it does at present..) 7587c478bd9Sstevel@tonic-gate * It also always releases rm_lock. 7597c478bd9Sstevel@tonic-gate */ 760fe54a78eSHai-May Chao (void) rnd_generate_pseudo_bytes(rmp, rmp->rm_mag.rm_buffer, 7617c478bd9Sstevel@tonic-gate rndbuf_len); 7627c478bd9Sstevel@tonic-gate } 7637c478bd9Sstevel@tonic-gate } 7647c478bd9Sstevel@tonic-gate 7657c478bd9Sstevel@tonic-gate /* 7667c478bd9Sstevel@tonic-gate * We set up (empty) magazines for all of max_ncpus, possibly wasting a 7677c478bd9Sstevel@tonic-gate * little memory on big systems that don't have the full set installed. 7687c478bd9Sstevel@tonic-gate * See above; "empty" means "rptr equal to eptr"; this will trigger the 7697c478bd9Sstevel@tonic-gate * refill path in rnd_get_pseudo_bytes above on the first call for each CPU. 7707c478bd9Sstevel@tonic-gate * 7717c478bd9Sstevel@tonic-gate * TODO: make rndmag_size tunable at run time! 7727c478bd9Sstevel@tonic-gate */ 7737c478bd9Sstevel@tonic-gate static void 7747c478bd9Sstevel@tonic-gate rnd_alloc_magazines() 7757c478bd9Sstevel@tonic-gate { 776fe54a78eSHai-May Chao rndmag_pad_t *rmp; 7777c478bd9Sstevel@tonic-gate int i; 778fe54a78eSHai-May Chao uint8_t discard_buf[HASHSIZE]; 7797c478bd9Sstevel@tonic-gate 7807c478bd9Sstevel@tonic-gate rndbuf_len = roundup(rndbuf_len, HASHSIZE); 7817c478bd9Sstevel@tonic-gate if (rndmag_size < rndbuf_len) 7827c478bd9Sstevel@tonic-gate rndmag_size = rndbuf_len; 7837c478bd9Sstevel@tonic-gate rndmag_size = roundup(rndmag_size, RND_CPU_CACHE_SIZE); 7847c478bd9Sstevel@tonic-gate 7857c478bd9Sstevel@tonic-gate random_max_ncpus = max_ncpus; 7867c478bd9Sstevel@tonic-gate rndmag_total = rndmag_size * random_max_ncpus; 7877c478bd9Sstevel@tonic-gate 7887c478bd9Sstevel@tonic-gate rndbuf = kmem_alloc(rndmag_total, KM_SLEEP); 789fe54a78eSHai-May Chao rndmag = kmem_zalloc(sizeof (rndmag_pad_t) * random_max_ncpus, 790fe54a78eSHai-May Chao KM_SLEEP); 7917c478bd9Sstevel@tonic-gate 7927c478bd9Sstevel@tonic-gate for (i = 0; i < random_max_ncpus; i++) { 7937c478bd9Sstevel@tonic-gate uint8_t *buf; 7947c478bd9Sstevel@tonic-gate 7957c478bd9Sstevel@tonic-gate rmp = &rndmag[i]; 796fe54a78eSHai-May Chao mutex_init(&rmp->rm_mag.rm_lock, NULL, MUTEX_DRIVER, NULL); 7977c478bd9Sstevel@tonic-gate 7987c478bd9Sstevel@tonic-gate buf = rndbuf + i * rndmag_size; 7997c478bd9Sstevel@tonic-gate 800fe54a78eSHai-May Chao rmp->rm_mag.rm_buffer = buf; 801fe54a78eSHai-May Chao rmp->rm_mag.rm_eptr = buf + rndbuf_len; 802fe54a78eSHai-May Chao rmp->rm_mag.rm_rptr = buf + rndbuf_len; 803fe54a78eSHai-May Chao rmp->rm_mag.rm_oblocks = 1; 804fe54a78eSHai-May Chao 805fe54a78eSHai-May Chao mutex_enter(&rndpool_lock); 806fe54a78eSHai-May Chao /* 807fe54a78eSHai-May Chao * FIPS 140-2: the first n-bit (n > 15) block generated 808fe54a78eSHai-May Chao * after power-up, initialization, or reset shall not 809fe54a78eSHai-May Chao * be used, but shall be saved for comparison. 810fe54a78eSHai-May Chao */ 811fe54a78eSHai-May Chao (void) rnd_get_bytes(discard_buf, 812*8b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 813fe54a78eSHai-May Chao bcopy(discard_buf, rmp->rm_mag.rm_previous, 814fe54a78eSHai-May Chao HMAC_KEYSIZE); 815fe54a78eSHai-May Chao /* rnd_get_bytes() will call mutex_exit(&rndpool_lock) */ 816fe54a78eSHai-May Chao mutex_enter(&rndpool_lock); 817fe54a78eSHai-May Chao (void) rnd_get_bytes((uint8_t *)rmp->rm_mag.rm_key, 818*8b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 819fe54a78eSHai-May Chao /* rnd_get_bytes() will call mutex_exit(&rndpool_lock) */ 820fe54a78eSHai-May Chao mutex_enter(&rndpool_lock); 821fe54a78eSHai-May Chao (void) rnd_get_bytes((uint8_t *)rmp->rm_mag.rm_seed, 822*8b502715SKrishna Yenduri HMAC_KEYSIZE, ALWAYS_EXTRACT); 8237c478bd9Sstevel@tonic-gate } 8247c478bd9Sstevel@tonic-gate } 8257c478bd9Sstevel@tonic-gate 8267c478bd9Sstevel@tonic-gate void 8277c478bd9Sstevel@tonic-gate kcf_rnd_schedule_timeout(boolean_t do_mech2id) 8287c478bd9Sstevel@tonic-gate { 8297c478bd9Sstevel@tonic-gate clock_t ut; /* time in microseconds */ 8307c478bd9Sstevel@tonic-gate 8317c478bd9Sstevel@tonic-gate if (do_mech2id) 8327c478bd9Sstevel@tonic-gate rngmech_type = crypto_mech2id(SUN_RANDOM); 8337c478bd9Sstevel@tonic-gate 8347c478bd9Sstevel@tonic-gate /* 8357c478bd9Sstevel@tonic-gate * The new timeout value is taken from the buffer of random bytes. 8367c478bd9Sstevel@tonic-gate * We're merely reading the first 32 bits from the buffer here, not 8377c478bd9Sstevel@tonic-gate * consuming any random bytes. 8387c478bd9Sstevel@tonic-gate * The timeout multiplier value is a random value between 0.5 sec and 8397c478bd9Sstevel@tonic-gate * 1.544480 sec (0.5 sec + 0xFF000 microseconds). 8407c478bd9Sstevel@tonic-gate * The new timeout is TIMEOUT_INTERVAL times that multiplier. 8417c478bd9Sstevel@tonic-gate */ 8427c478bd9Sstevel@tonic-gate ut = 500000 + (clock_t)((((uint32_t)rndpool[findex]) << 12) & 0xFF000); 8437c478bd9Sstevel@tonic-gate kcf_rndtimeout_id = timeout(rnd_handler, NULL, 8447c478bd9Sstevel@tonic-gate TIMEOUT_INTERVAL * drv_usectohz(ut)); 8457c478bd9Sstevel@tonic-gate } 8467c478bd9Sstevel@tonic-gate 8477c478bd9Sstevel@tonic-gate /* 8489d31afc5SKrishna Yenduri * Called from the driver for a poll on /dev/random 8499d31afc5SKrishna Yenduri * . POLLOUT always succeeds. 8509d31afc5SKrishna Yenduri * . POLLIN and POLLRDNORM will block until a 8519d31afc5SKrishna Yenduri * minimum amount of entropy is available. 8529d31afc5SKrishna Yenduri * 8537c478bd9Sstevel@tonic-gate * &rnd_pollhead is passed in *phpp in order to indicate the calling thread 8547c478bd9Sstevel@tonic-gate * will block. When enough random bytes are available, later, the timeout 8557c478bd9Sstevel@tonic-gate * handler routine will issue the pollwakeup() calls. 8567c478bd9Sstevel@tonic-gate */ 8577c478bd9Sstevel@tonic-gate void 8589d31afc5SKrishna Yenduri kcf_rnd_chpoll(short events, int anyyet, short *reventsp, 8599d31afc5SKrishna Yenduri struct pollhead **phpp) 8607c478bd9Sstevel@tonic-gate { 8619d31afc5SKrishna Yenduri *reventsp = events & POLLOUT; 8629d31afc5SKrishna Yenduri 8639d31afc5SKrishna Yenduri if (events & (POLLIN | POLLRDNORM)) { 8649d31afc5SKrishna Yenduri /* 8659d31afc5SKrishna Yenduri * Sampling of rnbyte_cnt is an atomic 8669d31afc5SKrishna Yenduri * operation. Hence we do not need any locking. 8679d31afc5SKrishna Yenduri */ 8689d31afc5SKrishna Yenduri if (rnbyte_cnt >= MINEXTRACTBYTES) 8699d31afc5SKrishna Yenduri *reventsp |= (events & (POLLIN | POLLRDNORM)); 8707c478bd9Sstevel@tonic-gate } 8719d31afc5SKrishna Yenduri 8729d31afc5SKrishna Yenduri if (*reventsp == 0 && !anyyet) 8739d31afc5SKrishna Yenduri *phpp = &rnd_pollhead; 8747c478bd9Sstevel@tonic-gate } 8757c478bd9Sstevel@tonic-gate 8767c478bd9Sstevel@tonic-gate /*ARGSUSED*/ 8777c478bd9Sstevel@tonic-gate static void 8787c478bd9Sstevel@tonic-gate rnd_handler(void *arg) 8797c478bd9Sstevel@tonic-gate { 8807c478bd9Sstevel@tonic-gate int len = 0; 8817c478bd9Sstevel@tonic-gate 882f317a3a3Skrishna if (!rng_prov_found && rng_ok_to_log) { 883f317a3a3Skrishna cmn_err(CE_WARN, "No randomness provider enabled for " 884f317a3a3Skrishna "/dev/random. Use cryptoadm(1M) to enable a provider."); 885f317a3a3Skrishna rng_ok_to_log = B_FALSE; 886f317a3a3Skrishna } 887f317a3a3Skrishna 8887c478bd9Sstevel@tonic-gate if (num_waiters > 0) 8897c478bd9Sstevel@tonic-gate len = MAXEXTRACTBYTES; 8907c478bd9Sstevel@tonic-gate else if (rnbyte_cnt < RNDPOOLSIZE) 8917c478bd9Sstevel@tonic-gate len = MINEXTRACTBYTES; 8927c478bd9Sstevel@tonic-gate 8937c478bd9Sstevel@tonic-gate if (len > 0) { 8947c478bd9Sstevel@tonic-gate (void) taskq_dispatch(system_taskq, rngprov_task, 8957c478bd9Sstevel@tonic-gate (void *)(uintptr_t)len, TQ_NOSLEEP); 8967c478bd9Sstevel@tonic-gate } 8977c478bd9Sstevel@tonic-gate 8987c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 8997c478bd9Sstevel@tonic-gate /* 9007c478bd9Sstevel@tonic-gate * Wake up threads waiting in poll() or for enough accumulated 9017c478bd9Sstevel@tonic-gate * random bytes to read from /dev/random. In case a poll() is 9027c478bd9Sstevel@tonic-gate * concurrent with a read(), the polling process may be woken up 9037c478bd9Sstevel@tonic-gate * indicating that enough randomness is now available for reading, 9047c478bd9Sstevel@tonic-gate * and another process *steals* the bits from the pool, causing the 9057c478bd9Sstevel@tonic-gate * subsequent read() from the first process to block. It is acceptable 9067c478bd9Sstevel@tonic-gate * since the blocking will eventually end, after the timeout 9077c478bd9Sstevel@tonic-gate * has expired enough times to honor the read. 9087c478bd9Sstevel@tonic-gate * 9097c478bd9Sstevel@tonic-gate * Note - Since we hold the rndpool_lock across the pollwakeup() call 9107c478bd9Sstevel@tonic-gate * we MUST NOT grab the rndpool_lock in kcf_rndchpoll(). 9117c478bd9Sstevel@tonic-gate */ 9127c478bd9Sstevel@tonic-gate if (rnbyte_cnt >= MINEXTRACTBYTES) 9137c478bd9Sstevel@tonic-gate pollwakeup(&rnd_pollhead, POLLIN | POLLRDNORM); 9147c478bd9Sstevel@tonic-gate 9157c478bd9Sstevel@tonic-gate if (num_waiters > 0) 9167c478bd9Sstevel@tonic-gate cv_broadcast(&rndpool_read_cv); 9177c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 9187c478bd9Sstevel@tonic-gate 9197c478bd9Sstevel@tonic-gate kcf_rnd_schedule_timeout(B_FALSE); 9207c478bd9Sstevel@tonic-gate } 9217c478bd9Sstevel@tonic-gate 9227c478bd9Sstevel@tonic-gate static void 9237c478bd9Sstevel@tonic-gate rndc_addbytes(uint8_t *ptr, size_t len) 9247c478bd9Sstevel@tonic-gate { 9257c478bd9Sstevel@tonic-gate ASSERT(ptr != NULL && len > 0); 9267c478bd9Sstevel@tonic-gate ASSERT(rnbyte_cnt <= RNDPOOLSIZE); 9277c478bd9Sstevel@tonic-gate 9287c478bd9Sstevel@tonic-gate mutex_enter(&rndpool_lock); 9297c478bd9Sstevel@tonic-gate while ((len > 0) && (rnbyte_cnt < RNDPOOLSIZE)) { 9307c478bd9Sstevel@tonic-gate rndpool[rindex] ^= *ptr; 9317c478bd9Sstevel@tonic-gate ptr++; len--; 9327c478bd9Sstevel@tonic-gate rindex = (rindex + 1) & (RNDPOOLSIZE - 1); 9337c478bd9Sstevel@tonic-gate rnbyte_cnt++; 9347c478bd9Sstevel@tonic-gate } 9357c478bd9Sstevel@tonic-gate 9367c478bd9Sstevel@tonic-gate /* Handle buffer full case */ 9377c478bd9Sstevel@tonic-gate while (len > 0) { 9387c478bd9Sstevel@tonic-gate rndpool[rindex] ^= *ptr; 9397c478bd9Sstevel@tonic-gate ptr++; len--; 9407c478bd9Sstevel@tonic-gate findex = rindex = (rindex + 1) & (RNDPOOLSIZE - 1); 9417c478bd9Sstevel@tonic-gate } 9427c478bd9Sstevel@tonic-gate mutex_exit(&rndpool_lock); 9437c478bd9Sstevel@tonic-gate } 9447c478bd9Sstevel@tonic-gate 9457c478bd9Sstevel@tonic-gate /* 9467c478bd9Sstevel@tonic-gate * Caller should check len <= rnbyte_cnt under the 9477c478bd9Sstevel@tonic-gate * rndpool_lock before calling. 9487c478bd9Sstevel@tonic-gate */ 9497c478bd9Sstevel@tonic-gate static void 9507c478bd9Sstevel@tonic-gate rndc_getbytes(uint8_t *ptr, size_t len) 9517c478bd9Sstevel@tonic-gate { 9527c478bd9Sstevel@tonic-gate ASSERT(MUTEX_HELD(&rndpool_lock)); 9537c478bd9Sstevel@tonic-gate ASSERT(len <= rnbyte_cnt && rnbyte_cnt <= RNDPOOLSIZE); 9547c478bd9Sstevel@tonic-gate 9557c478bd9Sstevel@tonic-gate BUMP_RND_STATS(rs_rndcOut, len); 9567c478bd9Sstevel@tonic-gate 9577c478bd9Sstevel@tonic-gate while (len > 0) { 9587c478bd9Sstevel@tonic-gate *ptr = rndpool[findex]; 9597c478bd9Sstevel@tonic-gate ptr++; len--; 9607c478bd9Sstevel@tonic-gate findex = (findex + 1) & (RNDPOOLSIZE - 1); 9617c478bd9Sstevel@tonic-gate rnbyte_cnt--; 9627c478bd9Sstevel@tonic-gate } 9637c478bd9Sstevel@tonic-gate } 9647c478bd9Sstevel@tonic-gate 9657c478bd9Sstevel@tonic-gate /* Random number exported entry points */ 9667c478bd9Sstevel@tonic-gate 9677c478bd9Sstevel@tonic-gate /* 9687c478bd9Sstevel@tonic-gate * Mix the supplied bytes into the entropy pool of a kCF 9697c478bd9Sstevel@tonic-gate * RNG provider. 9707c478bd9Sstevel@tonic-gate */ 9717c478bd9Sstevel@tonic-gate int 9728047c9fbSmcpowers random_add_pseudo_entropy(uint8_t *ptr, size_t len, uint_t entropy_est) 9738047c9fbSmcpowers { 9748047c9fbSmcpowers if (len < 1) 9758047c9fbSmcpowers return (-1); 9768047c9fbSmcpowers 9778047c9fbSmcpowers rngprov_seed(ptr, len, entropy_est, 0); 9788047c9fbSmcpowers 9798047c9fbSmcpowers return (0); 9808047c9fbSmcpowers } 9818047c9fbSmcpowers 9828047c9fbSmcpowers /* 9838047c9fbSmcpowers * Mix the supplied bytes into the entropy pool of a kCF 9848047c9fbSmcpowers * RNG provider. Mix immediately. 9858047c9fbSmcpowers */ 9868047c9fbSmcpowers int 9878047c9fbSmcpowers random_add_entropy(uint8_t *ptr, size_t len, uint_t entropy_est) 9887c478bd9Sstevel@tonic-gate { 9897c478bd9Sstevel@tonic-gate if (len < 1) 9907c478bd9Sstevel@tonic-gate return (-1); 9917c478bd9Sstevel@tonic-gate 9928047c9fbSmcpowers rngprov_seed(ptr, len, entropy_est, CRYPTO_SEED_NOW); 9937c478bd9Sstevel@tonic-gate 9947c478bd9Sstevel@tonic-gate return (0); 9957c478bd9Sstevel@tonic-gate } 9967c478bd9Sstevel@tonic-gate 9977c478bd9Sstevel@tonic-gate /* 9987c478bd9Sstevel@tonic-gate * Get bytes from the /dev/urandom generator. This function 9997c478bd9Sstevel@tonic-gate * always succeeds. Returns 0. 10007c478bd9Sstevel@tonic-gate */ 10017c478bd9Sstevel@tonic-gate int 10027c478bd9Sstevel@tonic-gate random_get_pseudo_bytes(uint8_t *ptr, size_t len) 10037c478bd9Sstevel@tonic-gate { 10047c478bd9Sstevel@tonic-gate ASSERT(!mutex_owned(&rndpool_lock)); 10057c478bd9Sstevel@tonic-gate 10067c478bd9Sstevel@tonic-gate if (len < 1) 10077c478bd9Sstevel@tonic-gate return (0); 10087c478bd9Sstevel@tonic-gate return (kcf_rnd_get_pseudo_bytes(ptr, len)); 10097c478bd9Sstevel@tonic-gate } 10107c478bd9Sstevel@tonic-gate 10117c478bd9Sstevel@tonic-gate /* 10127c478bd9Sstevel@tonic-gate * Get bytes from the /dev/random generator. Returns 0 10137c478bd9Sstevel@tonic-gate * on success. Returns EAGAIN if there is insufficient entropy. 10147c478bd9Sstevel@tonic-gate */ 10157c478bd9Sstevel@tonic-gate int 10167c478bd9Sstevel@tonic-gate random_get_bytes(uint8_t *ptr, size_t len) 10177c478bd9Sstevel@tonic-gate { 10187c478bd9Sstevel@tonic-gate ASSERT(!mutex_owned(&rndpool_lock)); 10197c478bd9Sstevel@tonic-gate 10207c478bd9Sstevel@tonic-gate if (len < 1) 10217c478bd9Sstevel@tonic-gate return (0); 1022*8b502715SKrishna Yenduri return (kcf_rnd_get_bytes(ptr, len, B_TRUE)); 10237c478bd9Sstevel@tonic-gate } 1024