yarrow.h revision 69170 
1/*-
2 * Copyright (c) 2000 Mark R V Murray
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer
10 *    in this position and unchanged.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 *    notice, this list of conditions and the following disclaimer in the
13 *    documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 *
26 * $FreeBSD: head/sys/dev/random/yarrow.h 69170 2000-11-25 18:00:54Z markm $
27 */
28
29/* #define ENTROPYSOURCE nn	   entropy sources (actually classes)
30 *					This is properly defined in
31 *					an enum in sys/random.h
32 */
33
34#define ENTROPYBIN	256	/* buckets to harvest entropy events  */
35#define TIMEBIN		16	/* max value for Pt/t */
36
37#define HARVESTSIZE	16	/* max size of each harvested entropy unit */
38
39#define FAST		0
40#define SLOW		1
41
42int random_init(void);
43void random_deinit(void);
44void random_init_harvester(void (*)(u_int64_t, void *, u_int, u_int, u_int, enum esource), u_int (*)(void *, u_int));
45void random_deinit_harvester(void);
46void random_set_wakeup_exit(void *);
47
48u_int read_random_real(void *, u_int);
49void write_random(void *, u_int);
50
51/* This is the beastie that needs protecting. It contains all of the
52 * state that we are excited about.
53 */
54struct random_state {
55	u_int64_t counter;	/* C */
56	struct yarrowkey key;	/* K */
57	int gengateinterval;	/* Pg */
58	int bins;		/* Pt/t */
59	int outputblocks;	/* count output blocks for gates */
60	u_int slowoverthresh;	/* slow pool overthreshhold reseed count */
61	struct pool {
62		struct source {
63			u_int bits;	/* estimated bits of entropy */
64			u_int frac;	/* fractional bits of entropy
65					   (given as 1024/n) */
66		} source[ENTROPYSOURCE];
67		u_int thresh;	/* pool reseed threshhold */
68		struct yarrowhash hash;	/* accumulated entropy */
69	} pool[2];		/* pool[0] is fast, pool[1] is slow */
70	int which;		/* toggle - shows the current insertion pool */
71	int seeded;		/* 0 until first reseed, then 1 */
72	struct selinfo rsel;	/* For poll(2) */
73};
74
75extern struct random_state random_state;
76