2000-07-07 09:03:59 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 2000 Mark R V Murray
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer
|
|
|
|
* in this position and unchanged.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* $FreeBSD$
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/queue.h>
|
2000-09-10 13:52:19 +00:00
|
|
|
#include <sys/kthread.h>
|
2000-10-20 07:58:15 +00:00
|
|
|
#include <sys/mutex.h>
|
2000-10-14 10:59:56 +00:00
|
|
|
#include <sys/poll.h>
|
|
|
|
#include <sys/select.h>
|
2000-07-07 09:03:59 +00:00
|
|
|
#include <sys/random.h>
|
2000-11-25 17:09:01 +00:00
|
|
|
|
|
|
|
#include <machine/cpu.h>
|
|
|
|
|
2000-07-07 09:03:59 +00:00
|
|
|
#include <crypto/blowfish/blowfish.h>
|
|
|
|
|
2000-10-14 10:59:56 +00:00
|
|
|
#include <dev/random/hash.h>
|
|
|
|
#include <dev/random/yarrow.h>
|
|
|
|
|
|
|
|
static u_int read_random_phony(void *, u_int);
|
2000-07-07 09:03:59 +00:00
|
|
|
|
2000-07-23 11:08:16 +00:00
|
|
|
/* hold the address of the routine which is actually called if
|
2000-11-25 17:09:01 +00:00
|
|
|
* the randomdev is loaded
|
2000-07-23 11:08:16 +00:00
|
|
|
*/
|
2000-11-25 17:09:01 +00:00
|
|
|
static void (*reap_func)(u_int64_t, void *, u_int, u_int, u_int, u_int) = NULL;
|
2000-10-14 10:59:56 +00:00
|
|
|
static u_int (*read_func)(void *, u_int) = read_random_phony;
|
2000-07-07 09:03:59 +00:00
|
|
|
|
|
|
|
/* Initialise the harvester at load time */
|
|
|
|
void
|
2000-11-25 17:09:01 +00:00
|
|
|
random_init_harvester(void (*reaper)(u_int64_t, void *, u_int, u_int, u_int, u_int), u_int (*reader)(void *, u_int))
|
2000-07-07 09:03:59 +00:00
|
|
|
{
|
2000-10-14 10:59:56 +00:00
|
|
|
reap_func = reaper;
|
|
|
|
read_func = reader;
|
2000-07-07 09:03:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Deinitialise the harvester at unload time */
|
|
|
|
void
|
|
|
|
random_deinit_harvester(void)
|
|
|
|
{
|
2000-10-14 10:59:56 +00:00
|
|
|
reap_func = NULL;
|
|
|
|
read_func = read_random_phony;
|
2000-07-07 09:03:59 +00:00
|
|
|
}
|
|
|
|
|
2000-07-23 11:08:16 +00:00
|
|
|
/* Entropy harvesting routine. This is supposed to be fast; do
|
|
|
|
* not do anything slow in here!
|
|
|
|
* Implemented as in indirect call to allow non-inclusion of
|
|
|
|
* the entropy device.
|
|
|
|
*/
|
2000-07-07 09:03:59 +00:00
|
|
|
void
|
2000-07-25 21:18:47 +00:00
|
|
|
random_harvest(void *entropy, u_int count, u_int bits, u_int frac, u_int origin)
|
2000-07-07 09:03:59 +00:00
|
|
|
{
|
2000-11-25 17:09:01 +00:00
|
|
|
if (reap_func)
|
|
|
|
(*reap_func)(get_cyclecount(), entropy, count, bits, frac, origin);
|
2000-07-07 09:03:59 +00:00
|
|
|
}
|
2000-09-10 13:52:19 +00:00
|
|
|
|
2000-10-14 10:59:56 +00:00
|
|
|
/* Userland-visible version of read_random */
|
|
|
|
u_int
|
|
|
|
read_random(void *buf, u_int count)
|
|
|
|
{
|
|
|
|
return (*read_func)(buf, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If the entropy device is not loaded, make a token effort to
|
|
|
|
* provide _some_ kind of randomness. This should only be used
|
|
|
|
* inside other RNG's, like arc4random(9).
|
2000-09-10 13:52:19 +00:00
|
|
|
*/
|
2000-10-14 10:59:56 +00:00
|
|
|
static u_int
|
|
|
|
read_random_phony(void *buf, u_int count)
|
2000-09-10 13:52:19 +00:00
|
|
|
{
|
2000-10-14 10:59:56 +00:00
|
|
|
u_long randval;
|
|
|
|
int size, i;
|
|
|
|
static int initialised = 0;
|
|
|
|
|
|
|
|
/* Try to give random(9) a half decent initialisation
|
2000-11-25 17:09:01 +00:00
|
|
|
* DO NOT make the mistake of thinking this is secure!!
|
2000-10-14 10:59:56 +00:00
|
|
|
*/
|
2000-11-25 17:09:01 +00:00
|
|
|
if (!initialised)
|
|
|
|
srandom((u_long)get_cyclecount());
|
2000-10-14 10:59:56 +00:00
|
|
|
|
|
|
|
/* Fill buf[] with random(9) output */
|
|
|
|
for (i = 0; i < count; i+= sizeof(u_long)) {
|
|
|
|
randval = random();
|
|
|
|
size = (count - i) < sizeof(u_long) ? (count - i) : sizeof(u_long);
|
|
|
|
memcpy(&((char *)buf)[i], &randval, size);
|
|
|
|
}
|
|
|
|
|
|
|
|
return count;
|
2000-09-10 13:52:19 +00:00
|
|
|
}
|
|
|
|
|
2000-10-14 10:59:56 +00:00
|
|
|
/* Helper routine to enable kthread_exit() to work while the module is
|
|
|
|
* being (or has been) unloaded.
|
|
|
|
* This routine is in this file because it is always linked into the kernel,
|
|
|
|
* and will thus never be unloaded. This is critical for unloadable modules
|
|
|
|
* that have threads.
|
|
|
|
*/
|
2000-09-10 13:52:19 +00:00
|
|
|
void
|
2000-10-14 10:59:56 +00:00
|
|
|
random_set_wakeup_exit(void *control)
|
2000-09-10 13:52:19 +00:00
|
|
|
{
|
2000-10-14 10:59:56 +00:00
|
|
|
wakeup(control);
|
|
|
|
mtx_enter(&Giant, MTX_DEF);
|
|
|
|
kthread_exit(0);
|
|
|
|
/* NOTREACHED */
|
2000-09-10 13:52:19 +00:00
|
|
|
}
|