mirror of
https://github.com/isc-projects/bind9.git
synced 2026-06-14 22:30:01 -04:00
add lfsr.c
This commit is contained in:
Michael Graff
parent
cb5f37d93b
commit
ad91a3d204
2 changed files with 136 additions and 2 deletions
|
|
@ -46,7 +46,7 @@ WIN32OBJS = win32/condition.@O@ win32/dir.@O@ win32/once.@O@ \
|
|||
OBJS = @ISC_EXTRA_OBJS@ \
|
||||
assertions.@O@ base64.@O@ bitstring.@O@ buffer.@O@ \
|
||||
bufferlist.@O@ commandline.@O@ error.@O@ event.@O@ heap.@O@ \
|
||||
lex.@O@ lib.@O@ log.@O@ \
|
||||
lex.@O@ lfsr.@O@ lib.@O@ log.@O@ \
|
||||
mem.@O@ mutexblock.@O@ random.@O@ \
|
||||
ratelimiter.@O@ result.@O@ rwlock.@O@ \
|
||||
serial.@O@ sockaddr.@O@ str.@O@ symtab.@O@ \
|
||||
|
|
@ -57,7 +57,7 @@ OBJS = @ISC_EXTRA_OBJS@ \
|
|||
SRCS = @ISC_EXTRA_SRCS@ \
|
||||
assertions.c base64.c bitstring.c buffer.c \
|
||||
bufferlist.c commandline.c error.c event.c heap.c \
|
||||
lex.c lib.c log.c \
|
||||
lex.c lfsr.c lib.c log.c \
|
||||
mem.c mutexblock.c random.c \
|
||||
ratelimiter.c result.c rwlock.c \
|
||||
serial.c sockaddr.c str.c symtab.c \
|
||||
|
|
|
|||
134
lib/isc/lfsr.c
Normal file
134
lib/isc/lfsr.c
Normal file
|
|
@ -0,0 +1,134 @@
|
|||
/*
|
||||
* Copyright (C) 1999 Internet Software Consortium.
|
||||
*
|
||||
* Permission to use, copy, modify, and distribute this software for any
|
||||
* purpose with or without fee is hereby granted, provided that the above
|
||||
* copyright notice and this permission notice appear in all copies.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
||||
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
||||
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
||||
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
||||
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
||||
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
||||
* SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
|
||||
#include <isc/assertions.h>
|
||||
#include <isc/lfsr.h>
|
||||
|
||||
isc_lfsr_t isc_lfsr_standard[] = {
|
||||
/* 32-bit, x^31 + x^6 + x^4 + x^2 + x + 1 */
|
||||
{ 0, 32, (1 << 31) | (1 << 6) | (1 << 4) | (1 << 2) | (1 << 1) | 1 },
|
||||
|
||||
/* 32-bit, x^31 + x^6 + x^2 + x + 1 */
|
||||
{ 0, 32, (1 << 31) | (1 << 6) | (1 << 2) | (1 << 1) | 1 },
|
||||
|
||||
/* 30-bit, x^29 + x^6 + x^3 + 1 */
|
||||
{ 0, 30, (1 << 29) | (1 << 5) | (1 << 3) | 1 },
|
||||
|
||||
/* 19-bit, x^18 + x^4 + x + 1 */
|
||||
{ 0, 19, (1 << 18) | (1 << 4) | (1 << 1) | 1 },
|
||||
|
||||
/* 13-bit, x^12 + x^3 + x^2 + 1 */
|
||||
{ 0, 13, (1 << 12) | (1 << 3) | (1 << 2) | 1 },
|
||||
|
||||
{ 0, 0, 0}
|
||||
};
|
||||
|
||||
#define VALID_LFSR(x) (x != NULL)
|
||||
|
||||
/*
|
||||
* Return the next state of the lfsr.
|
||||
*/
|
||||
static inline isc_uint32_t
|
||||
lfsr_generate(isc_lfsr_t *lfsr)
|
||||
{
|
||||
unsigned int nbits;
|
||||
|
||||
nbits = lfsr->bits - 1;
|
||||
|
||||
/*
|
||||
* If the previous state is zero, we must fill it with something
|
||||
* here, or we will begin to generate an extremely predictable output.
|
||||
*/
|
||||
if (lfsr->state == 0)
|
||||
lfsr->state = (-1) & ((1 << nbits) - 1);
|
||||
|
||||
if (lfsr->state & 1)
|
||||
lfsr->state = ((lfsr->state ^ lfsr->tap) >> 1) | (1 << nbits);
|
||||
else
|
||||
lfsr->state >>= 1;
|
||||
|
||||
return (lfsr->state);
|
||||
}
|
||||
|
||||
isc_uint32_t
|
||||
isc_lfsr_generate(isc_lfsr_t *lfsr)
|
||||
{
|
||||
REQUIRE(VALID_LFSR(lfsr));
|
||||
|
||||
return (lfsr_generate(lfsr));
|
||||
}
|
||||
|
||||
static inline isc_uint32_t
|
||||
lfsr_skipgenerate(isc_lfsr_t *lfsr, unsigned int skip)
|
||||
{
|
||||
while (skip--)
|
||||
(void)lfsr_generate(lfsr);
|
||||
|
||||
return (lfsr_generate(lfsr));
|
||||
}
|
||||
|
||||
/*
|
||||
* Skip "skip" states in "lfsr" and return the ending state.
|
||||
*/
|
||||
isc_uint32_t
|
||||
isc_lfsr_skipgenerate(isc_lfsr_t *lfsr, unsigned int skip)
|
||||
{
|
||||
REQUIRE(VALID_LFSR(lfsr));
|
||||
|
||||
return (lfsr_skipgenerate(lfsr, skip));
|
||||
}
|
||||
|
||||
/*
|
||||
* Skip states in lfsr1 and lfsr2 using the other's current state.
|
||||
* Return the final state of lfsr1 ^ lfsr2.
|
||||
*
|
||||
* Since this uses the _previous_ state of the lfsrs, the the actual values
|
||||
* they contain should never be released to anyone other than by return from
|
||||
* this function.
|
||||
*
|
||||
* "skipbits" indicates how many lower bits should be used to advance the
|
||||
* lfsrs. A good value is 1. If simple combining is desired (without
|
||||
* skipping any values) one can use 0.
|
||||
*/
|
||||
isc_uint32_t
|
||||
isc_lfsr_lfsrskipgenerate(isc_lfsr_t *lfsr1, isc_lfsr_t *lfsr2,
|
||||
unsigned int skipbits)
|
||||
{
|
||||
isc_uint32_t state1, state2;
|
||||
isc_uint32_t skip1, skip2;
|
||||
isc_uint32_t skipmask;
|
||||
|
||||
REQUIRE(VALID_LFSR(lfsr1));
|
||||
REQUIRE(VALID_LFSR(lfsr2));
|
||||
REQUIRE(skipbits < 31);
|
||||
|
||||
if (skipbits == 0)
|
||||
skipmask = 0;
|
||||
else
|
||||
skipmask = (1 << skipbits) - 1;
|
||||
|
||||
skip1 = lfsr1->state & skipmask;
|
||||
skip2 = lfsr2->state & skipmask;
|
||||
|
||||
/* cross-skip. */
|
||||
state1 = lfsr_skipgenerate(lfsr1, skip2);
|
||||
state2 = lfsr_skipgenerate(lfsr2, skip1);
|
||||
|
||||
return (state1 ^ state2);
|
||||
}
|
||||
Loading…
Reference in a new issue