1/*-
2 * Copyright (c) 2000-2004 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$
27 */
28
29/* This contains Yarrow-specific declarations.
30 * See http://www.counterpane.com/yarrow.html
31 */
32
33#define TIMEBIN		16	/* max value for Pt/t */
34
35#define FAST		0
36#define SLOW		1
37
38/* This is the beastie that needs protecting. It contains all of the
39 * state that we are excited about.
40 * Exactly one will be instantiated.
41 */
42struct random_state {
43	u_int64_t counter[4];	/* C - 256 bits */
44	struct yarrowkey key;	/* K */
45	u_int gengateinterval;	/* Pg */
46	u_int bins;		/* Pt/t */
47	u_int outputblocks;	/* count output blocks for gates */
48	u_int slowoverthresh;	/* slow pool overthreshhold reseed count */
49	struct pool {
50		struct source {
51			u_int bits;	/* estimated bits of entropy */
52			u_int frac;	/* fractional bits of entropy
53					   (given as 1024/n) */
54		} source[ENTROPYSOURCE];
55		u_int thresh;	/* pool reseed threshhold */
56		struct yarrowhash hash;	/* accumulated entropy */
57	} pool[2];		/* pool[0] is fast, pool[1] is slow */
58	u_int which;		/* toggle - sets the current insertion pool */
59};
60