yarrow.h revision 69168 
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 69168 2000-11-25 17:09:01Z markm $
27 */
28
29/* #define ENTROPYSOURCE nn	   entropy sources (actually classes)
30 *				   The entropy classes will as follows:
31 *					0 - Direct write
32 *					1 - Keyboard
33 *					2 - Mouse
34 */
35
36#define ENTROPYBIN	256	/* buckets to harvest entropy events  */
37#define TIMEBIN		16	/* max value for Pt/t */
38
39#define HARVESTSIZE	16	/* max size of each harvested entropy unit */
40
41#define FAST		0
42#define SLOW		1
43
44int random_init(void);
45void random_deinit(void);
46void random_init_harvester(void (*)(u_int64_t, void *, u_int, u_int, u_int, enum esource), u_int (*)(void *, u_int));
47void random_deinit_harvester(void);
48void random_set_wakeup_exit(void *);
49
50u_int read_random_real(void *, u_int);
51void write_random(void *, u_int);
52
53/* This is the beastie that needs protecting. It contains all of the
54 * state that we are excited about.
55 * This is a biiig structure. It may move over to a malloc(9)ed
56 * replacement.
57 */
58struct random_state {
59	u_int64_t counter;	/* C */
60	struct yarrowkey key;	/* K */
61	int gengateinterval;	/* Pg */
62	int bins;		/* Pt/t */
63	int outputblocks;	/* count output blocks for gates */
64	u_int slowoverthresh;	/* slow pool overthreshhold reseed count */
65	struct pool {
66		struct source {
67			u_int bits;	/* estimated bits of entropy */
68			u_int frac;	/* fractional bits of entropy
69					   (given as 1024/n) */
70		} source[ENTROPYSOURCE];
71		u_int thresh;	/* pool reseed threshhold */
72		struct yarrowhash hash;	/* accumulated entropy */
73	} pool[2];		/* pool[0] is fast, pool[1] is slow */
74	int which;		/* toggle - shows the current insertion pool */
75	int seeded;		/* 0 until first reseed, then 1 */
76	struct selinfo rsel;	/* For poll(2) */
77};
78
79extern struct random_state random_state;
80