2 * Copyright (C) 2004 Internet Systems Consortium, Inc. ("ISC")
3 * Copyright (C) 1999-2002 Internet Software Consortium.
5 * Permission to use, copy, modify, and distribute this software for any
6 * purpose with or without fee is hereby granted, provided that the above
7 * copyright notice and this permission notice appear in all copies.
9 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
10 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
11 * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
12 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
13 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
14 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
15 * PERFORMANCE OF THIS SOFTWARE.
18 /* $Id: lfsr.c,v 1.11.2.2.2.3 2004/03/08 09:04:49 marka Exp $ */
24 #include <isc/assertions.h>
28 #define VALID_LFSR(x) (x != NULL)
31 isc_lfsr_init(isc_lfsr_t *lfsr, isc_uint32_t state, unsigned int bits,
32 isc_uint32_t tap, unsigned int count,
33 isc_lfsrreseed_t reseed, void *arg)
35 REQUIRE(VALID_LFSR(lfsr));
36 REQUIRE(8 <= bits && bits <= 32);
43 lfsr->reseed = reseed;
46 if (count == 0 && reseed != NULL)
49 lfsr->state = 0xffffffffU >> (32 - lfsr->bits);
53 * Return the next state of the lfsr.
55 static inline isc_uint32_t
56 lfsr_generate(isc_lfsr_t *lfsr)
60 highbit = 1 << (lfsr->bits - 1);
63 * If the previous state is zero, we must fill it with something
64 * here, or we will begin to generate an extremely predictable output.
66 * First, give the reseed function a crack at it. If the state is
67 * still 0, set it to all ones.
69 if (lfsr->state == 0) {
70 if (lfsr->reseed != NULL)
71 lfsr->reseed(lfsr, lfsr->arg);
73 lfsr->state = 0xffffffffU >> (32 - lfsr->bits);
76 if (lfsr->state & 0x01) {
77 lfsr->state = (lfsr->state >> 1) ^ lfsr->tap;
86 isc_lfsr_generate(isc_lfsr_t *lfsr, void *data, unsigned int count)
92 REQUIRE(VALID_LFSR(lfsr));
93 REQUIRE(data != NULL);
101 for (bit = 0; bit < 7; bit++) {
102 *p |= lfsr_generate(lfsr);
105 *p |= lfsr_generate(lfsr);
109 if (lfsr->count != 0 && lfsr->reseed != NULL) {
110 if (lfsr->count <= count * 8)
111 lfsr->reseed(lfsr, lfsr->arg);
113 lfsr->count -= (count * 8);
117 static inline isc_uint32_t
118 lfsr_skipgenerate(isc_lfsr_t *lfsr, unsigned int skip)
121 (void)lfsr_generate(lfsr);
123 (void)lfsr_generate(lfsr);
125 return (lfsr->state);
129 * Skip "skip" states in "lfsr".
132 isc_lfsr_skip(isc_lfsr_t *lfsr, unsigned int skip)
134 REQUIRE(VALID_LFSR(lfsr));
137 (void)lfsr_generate(lfsr);
141 * Skip states in lfsr1 and lfsr2 using the other's current state.
142 * Return the final state of lfsr1 ^ lfsr2.
145 isc_lfsr_generate32(isc_lfsr_t *lfsr1, isc_lfsr_t *lfsr2)
147 isc_uint32_t state1, state2;
148 isc_uint32_t skip1, skip2;
150 REQUIRE(VALID_LFSR(lfsr1));
151 REQUIRE(VALID_LFSR(lfsr2));
153 skip1 = lfsr1->state & 0x01;
154 skip2 = lfsr2->state & 0x01;
157 state1 = lfsr_skipgenerate(lfsr1, skip2);
158 state2 = lfsr_skipgenerate(lfsr2, skip1);
160 return (state1 ^ state2);