From 974755deb9bbea37752d2202844a1f485e59c8e7 Mon Sep 17 00:00:00 2001 From: Matt Turner Date: Tue, 11 Nov 2008 23:17:11 +0000 Subject: -- Rename misc.c randnum.c -- Delete misc.h git-svn-id: svn://mattst88.com/svn/cleanbench/trunk@8 0d43b9a7-5ab2-4d7b-af9d-f64450cef757 --- misc.c | 55 ------------------------------------------------------- 1 file changed, 55 deletions(-) delete mode 100644 misc.c (limited to 'misc.c') diff --git a/misc.c b/misc.c deleted file mode 100644 index 7d2620f..0000000 --- a/misc.c +++ /dev/null @@ -1,55 +0,0 @@ -#include -#include - -/**************************** -** RANDOM NUMBER GENERATOR ** -***************************** -** This is a second-order linear congruential random number -** generator. Its advantage is (of course) that it can be -** seeded and will thus produce repeatable sequences of -** random numbers. -*/ - -/**************************** -* randnum() * -***************************** -** Second order linear congruential generator. -** Constants suggested by J. G. Skellam. -** If val==0, returns next member of sequence. -** val!=0, restart generator. -*/ - -int32_t randnum(int32_t val) { - static int32_t randw[2] = { 13 , 117 }; - int32_t interm; - - if (val != 0) { - randw[0] = 13; - randw[1] = 117; - } - - interm = (randw[0]* (int32_t)254754 + randw[1]*(int32_t)529562) % (int32_t)999563; - randw[1] = randw[0]; - randw[0] = interm; - return(interm); -} - -/**************************** -* randwc() * -***************************** -** Returns signed 32-bit random modulo num. -*/ -int32_t randwc(int32_t num) { - return(randnum(0) % num); -} - -/*************************** -** abs_randwc() ** -**************************** -** Same as randwc(), only this routine returns only -** positive numbers. -*/ -uint32_t abs_randwc(uint32_t num) { - return abs(randwc(num)); -} - -- cgit v1.2.3