2 * Copyright (c) 2000-2004 Mark R V Murray
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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.
29 /* This header contains only those definitions that are global
30 * and harvester-specific for the entropy processor
33 /* #define ENTROPYSOURCE nn entropy sources (actually classes)
34 * This is properly defined in
35 * an enum in sys/random.h
38 /* Cryptographic block size in bits */
41 /* The ring size _MUST_ be a power of 2 */
42 #define HARVEST_RING_SIZE 1024 /* harvest ring buffer size */
43 #define HARVEST_RING_MASK (HARVEST_RING_SIZE - 1)
45 #define HARVESTSIZE 16 /* max size of each harvested entropy unit */
47 MALLOC_DECLARE(M_ENTROPY);
49 /* These are used to queue harvested packets of entropy. The entropy
50 * buffer size is pretty arbitrary.
53 uintmax_t somecounter; /* fast counter for clock jitter */
54 u_char entropy[HARVESTSIZE]; /* the harvested entropy */
55 u_int size, bits, frac; /* stats about the entropy */
56 enum esource source; /* stats about the entropy */
57 STAILQ_ENTRY(harvest) next; /* next item on the list */
60 void random_yarrow_init(void);
61 void random_yarrow_deinit(void);
63 int random_yarrow_read(void *, int);
64 void random_yarrow_write(void *, int);
66 void random_yarrow_init_harvester(void (*)(u_int64_t, const void *, u_int,
67 u_int, u_int, enum esource), int (*)(void *, int));
68 void random_yarrow_deinit_harvester(void);
70 void random_set_wakeup_exit(void *);
71 void random_process_event(struct harvest *event);
72 void random_yarrow_reseed(void);
73 void random_yarrow_unblock(void);
75 void random_yarrow_init_alg(struct sysctl_ctx_list *, struct sysctl_oid *);
76 void random_yarrow_deinit_alg(void);
78 extern struct random_systat random_yarrow;
79 extern struct mtx random_reseed_mtx;
81 /* If this was c++, this would be a template */
82 #define RANDOM_CHECK_UINT(name, min, max) \
84 random_check_uint_##name(SYSCTL_HANDLER_ARGS) \
86 if (oidp->oid_arg1 != NULL) { \
87 if (*(u_int *)(oidp->oid_arg1) <= (min)) \
88 *(u_int *)(oidp->oid_arg1) = (min); \
89 else if (*(u_int *)(oidp->oid_arg1) > (max)) \
90 *(u_int *)(oidp->oid_arg1) = (max); \
92 return sysctl_handle_int(oidp, oidp->oid_arg1, oidp->oid_arg2, \