C语言生成32位和64位随机数算法
C语言生成32位和64位随机数算法
/** * randstd.h * * Standard definitions and types, Bob Jenkins * * 2015-01-19: revised by cheungmine */ #ifndef _RANDSTD_H__ #define _RANDSTD_H__ #ifndef STDIO # include <stdio.h> # define STDIO #endif #ifndef STDDEF # include <stddef.h> # define STDDEF #endif typedef unsigned long long ub8; #define UB8MAXVAL 0xffffffffffffffffLL #define UB8BITS 64 typedef signed long long sb8; #define SB8MAXVAL 0x7fffffffffffffffLL typedef unsigned long int ub4; /* unsigned 4-byte quantities */ #define UB4MAXVAL 0xffffffff typedef signed long int sb4; #define UB4BITS 32 #define SB4MAXVAL 0x7fffffff typedef unsigned short int ub2; #define UB2MAXVAL 0xffff #define UB2BITS 16 typedef signed short int sb2; #define SB2MAXVAL 0x7fff /* unsigned 1-byte quantities */ typedef unsigned char ub1; #define UB1MAXVAL 0xff #define UB1BITS 8 /* signed 1-byte quantities */ typedef signed char sb1; #define SB1MAXVAL 0x7f /* fastest type available */ typedef int word; #define bis(target,mask) ((target) |= (mask)) #define bic(target,mask) ((target) &= ~(mask)) #define bit(target,mask) ((target) & (mask)) #ifndef min # define min(a,b) (((a)<(b)) ? (a) : (b)) #endif /* min */ #ifndef max # define max(a,b) (((a)<(b)) ? (b) : (a)) #endif /* max */ #ifndef abs # define abs(a) (((a)>0) ? (a) : -(a)) #endif #ifndef align # define align(a) (((ub4)a+(sizeof(void *)-1))&(~(sizeof(void *)-1))) #endif /* align */ #define RAND_TRUE 1 #define RAND_FALSE 0 #define RAND_SUCCESS 0 /* 1 on VAX */ #endif /* _RANDSTD_H__ */
/**
* rand.h
* definitions for a random number generator
* -----------------------------------------------------------------------------
* By Bob Jenkins, 1996, Public Domain
* MODIFIED:
* 960327: Creation (addition of randinit, really)
* 970719: use context, not global variables, for internal state
* 980324: renamed seed to flag
* 980605: recommend RANDSIZL=4 for noncryptography.
* 010626: note this is public domain
* -----------------------------------------------------------------------------
*
* 2015-01-19: revised by cheungmine
*/
#ifndef _RAND_H__
#define _RAND_H__
#ifdef __cplusplus
extern "C" {
#endif
#include "randstd.h"
#define RANDSIZL (8)
#define RANDSIZ (1<<RANDSIZL)
/**
* context of random number generator
*/
struct randctx_ub4
{
ub4 randcnt;
ub4 seed[RANDSIZ];
ub4 mm[RANDSIZ];
ub4 aa;
ub4 bb;
ub4 cc;
};
typedef struct randctx_ub4 randctx;
/**
* context of random number generator for 64-bits int
*/
struct randctx_ub8
{
ub8 randcnt;
ub8 seed[RANDSIZ];
ub8 mm[RANDSIZ];
ub8 aa;
ub8 bb;
ub8 cc;
};
typedef struct randctx_ub8 randctx64;
/**
* randinit
* init rand seed
*/
extern void rand_init(randctx *r, word time_as_seed);
extern void rand64_init(randctx64 *r, word time_as_seed);
/**
* rand
* Call rand(randctx *) to retrieve a single 32-bit random value.
*/
extern ub4 rand(randctx *r);
extern ub4 randint(randctx *r, ub4 rmin, ub4 rmax);
extern ub8 rand64(randctx64 *r);
extern ub8 randint64(randctx64 *r, ub8 rmin, ub8 rmax);
#ifdef __cplusplus
}
#endif
#endif /* _RAND_H__ */
/**
* rand.c
* By Bob Jenkins. My random number generator, ISAAC. Public Domain.
* -----------------------------------------------------------------------------
* MODIFIED:
* 960327: Creation (addition of randinit, really)
* 970719: use context, not global variables, for internal state
* 980324: added main (ifdef'ed out), also rearranged randinit()
* 010626: Note that this is public domain
* -----------------------------------------------------------------------------
*
* 2015-01-19: revised by cheungmine
*/
#include "rand.h"
#include <time.h>
/**
*==============================================================================
* 32-bits int random generator
*==============================================================================
*/
#define isaac_golden_ratio32 0x9e3779b9
#define ind32(mm,x) (*(ub4 *)((ub1 *)(mm) + ((x) & ((RANDSIZ-1)<<2))))
#define rngstep32(mix,a,b,mm,m,m2,r,x) \
{ \
x = *m; \
a = (a^(mix)) + *(m2++); \
*(m++) = y = ind32(mm,x) + a + b; \
*(r++) = b = ind32(mm,y>>RANDSIZL) + x; \
}
#define mix32(a,b,c,d,e,f,g,h) \
{ \
a^=b<<11; d+=a; b+=c; \
b^=c>>2; e+=b; c+=d; \
c^=d<<8; f+=c; d+=e; \
d^=e>>16; g+=d; e+=f; \
e^=f<<10; h+=e; f+=g; \
f^=g>>4; a+=f; g+=h; \
g^=h<<8; b+=g; h+=a; \
h^=a>>9; c+=h; a+=b; \
}
static void isaac32(randctx *ctx)
{
register ub4 a, b, x, y, *m, *mm, *m2, *r, *mend;
mm = ctx->mm;
r = ctx->seed;
a = ctx->aa;
b = ctx->bb + (++ctx->cc);
for (m = mm, mend = m2 = m+(RANDSIZ/2); m<mend; ) {
rngstep32( a<<13, a, b, mm, m, m2, r, x);
rngstep32( a>>6 , a, b, mm, m, m2, r, x);
rngstep32( a<<2 , a, b, mm, m, m2, r, x);
rngstep32( a>>16, a, b, mm, m, m2, r, x);
}
for (m2 = mm; m2<mend; ) {
rngstep32( a<<13, a, b, mm, m, m2, r, x);
rngstep32( a>>6 , a, b, mm, m, m2, r, x);
rngstep32( a<<2 , a, b, mm, m, m2, r, x);
rngstep32( a>>16, a, b, mm, m, m2, r, x);
}
ctx->bb = b;
ctx->aa = a;
}
#define gen_rand32(r) \
(!(r)->randcnt-- ? \
(isaac32(r), (r)->randcnt=RANDSIZ-1, (r)->seed[(r)->randcnt]) : \
(r)->seed[(r)->randcnt])
void rand_init(randctx *ctx, word time_as_seed)
{
word i;
ub4 a, b, c, d, e, f, g, h;
ub4 *m, *r;
ctx->aa = ctx->bb = ctx->cc = 0;
m = ctx->mm;
r = ctx->seed;
a = b = c = d = e = f = g = h = isaac_golden_ratio32; /* the golden ratio */
/* init seed */
for (i=0; i<256; ++i) {
r[i] = (ub4) (time_as_seed? time(0) : 0);
}
for (i=0; i<4; ++i) { /* scramble it */
mix32(a,b,c,d,e,f,g,h);
}
if (1) {
/* initialize using the contents of r[] as the seed */
for (i=0; i<RANDSIZ; i+=8) {
a+=r[i ]; b+=r[i+1]; c+=r[i+2]; d+=r[i+3];
e+=r[i+4]; f+=r[i+5]; g+=r[i+6]; h+=r[i+7];
mix32(a,b,c,d,e,f,g,h);
m[i ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
}
/* do a second pass to make all of the seed affect all of m */
for (i=0; i<RANDSIZ; i+=8) {
a+=m[i ]; b+=m[i+1]; c+=m[i+2]; d+=m[i+3];
e+=m[i+4]; f+=m[i+5]; g+=m[i+6]; h+=m[i+7];
mix32(a,b,c,d,e,f,g,h);
m[i ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
}
} else {
/* Never run to this: fill in m[] with messy stuff */
for (i=0; i<RANDSIZ; i+=8) {
mix32(a,b,c,d,e,f,g,h);
m[i ]=a; m[i+1]=b; m[i+2]=c; m[i+3]=d;
m[i+4]=e; m[i+5]=f; m[i+6]=g; m[i+7]=h;
}
}
isaac32(ctx); /* fill in the first set of results */
ctx->randcnt = RANDSIZ; /* prepare to use the first set of results */
}
/**
* randint
* get 32-bits unsigned integer random
*/
ub4 rand(randctx *r)
{
return gen_rand32(r);
}
/**
* randint
* get integer random between rmin and rmax
*/
ub4 randint(randctx *r, ub4 rmin, ub4 rmax)
{
if (! r->randcnt-- ) {
isaac32(r);
r->randcnt = RANDSIZ - 1;
}
ub4 ret = (ub4) r->seed[r->randcnt];
return ret % (ub4) (rmax - rmin + 1) + rmin;
}
/**
*==============================================================================
* 64 bits int random generator
*==============================================================================
*/
#define isaac_golden_ratio64 0x9e3779b97f4a7c13LL
#define ind64(mm,x) (*(ub8 *)((ub1 *)(mm) + ((x) & ((RANDSIZ-1)<<3))))
#define rngstep64(mix,a,b,mm,m,m2,r,x) \
{ \
x = *m; \
a = (mix) + *(m2++); \
*(m++) = y = ind64(mm,x) + a + b; \
*(r++) = b = ind64(mm,y>>RANDSIZL) + x; \
}
#define mix64(a,b,c,d,e,f,g,h) \
{ \
a-=e; f^=h>>9; h+=a; \
b-=f; g^=a<<9; a+=b; \
c-=g; h^=b>>23; b+=c; \
d-=h; a^=c<<15; c+=d; \
e-=a; b^=d>>14; d+=e; \
f-=b; c^=e<<20; e+=f; \
g-=c; d^=f>>17; f+=g; \
h-=d; e^=g<<14; g+=h; \
}
static void isaac64(randctx64 *ctx)
{
register ub8 a,b,x,y,*m,*mm,*m2,*r,*mend;
mm = ctx->mm;
r = ctx->seed;
a = ctx->aa;
b = ctx->bb + (++ctx->cc);
for (m = mm, mend = m2 = m+(RANDSIZ/2); m<mend; ) {
rngstep64(~(a^(a<<21)), a, b, mm, m, m2, r, x);
rngstep64( a^(a>>5) , a, b, mm, m, m2, r, x);
rngstep64( a^(a<<12) , a, b, mm, m, m2, r, x);
rngstep64( a^(a>>33) , a, b, mm, m, m2, r, x);
}
for (m2 = mm; m2<mend; ) {
rngstep64(~(a^(a<<21)), a, b, mm, m, m2, r, x);
rngstep64( a^(a>>5) , a, b, mm, m, m2, r, x);
rngstep64( a^(a<<12) , a, b, mm, m, m2, r, x);
rngstep64( a^(a>>33) , a, b, mm, m, m2, r, x);
}
ctx->bb = b;
ctx->aa = a;
}
#define gen_rand64(r) \
(!(r)->randcnt-- ? (isaac64(r), (r)->randcnt=RANDSIZ-1, (r)->seed[(r)->randcnt]) : \
(r)->seed[(r)->randcnt])
void rand64_init(randctx64 *ctx, word time_as_seed)
{
word i;
ub8 a,b,c,d,e,f,g,h;
ub8 *mm, *r;
ctx->aa = ctx->bb = ctx->cc = (ub8) 0;
a=b=c=d=e=f=g=h= isaac_golden_ratio64; /* the golden ratio */
mm = ctx->mm;
r = ctx->seed;
/* init seed */
for (i=0; i<256; ++i) {
r[i] = (ub8) (time_as_seed? time(0) : 0);
}
for (i=0; i<4; ++i) { /* scramble it */
mix64(a,b,c,d,e,f,g,h);
}
for (i=0; i<RANDSIZ; i+=8) { /* fill in mm[] with messy stuff */
if (1) { /* use all the information in the seed */
a+=r[i ]; b+=r[i+1]; c+=r[i+2]; d+=r[i+3];
e+=r[i+4]; f+=r[i+5]; g+=r[i+6]; h+=r[i+7];
}
mix64(a,b,c,d,e,f,g,h);
mm[i ]=a; mm[i+1]=b; mm[i+2]=c; mm[i+3]=d;
mm[i+4]=e; mm[i+5]=f; mm[i+6]=g; mm[i+7]=h;
}
if (1) {
/* do a second pass to make all of the seed affect all of mm */
for (i=0; i<RANDSIZ; i+=8) {
a+=mm[i ]; b+=mm[i+1]; c+=mm[i+2]; d+=mm[i+3];
e+=mm[i+4]; f+=mm[i+5]; g+=mm[i+6]; h+=mm[i+7];
mix64(a,b,c,d,e,f,g,h);
mm[i ]=a; mm[i+1]=b; mm[i+2]=c; mm[i+3]=d;
mm[i+4]=e; mm[i+5]=f; mm[i+6]=g; mm[i+7]=h;
}
}
isaac64(ctx); /* fill in the first set of results */
ctx->randcnt = RANDSIZ; /* prepare to use the first set of results */
}
/**
* rand64
* get 64-bits unsigned integer random
*/
ub8 rand64(randctx64 *r)
{
return (ub8) (gen_rand64(r));
}
/**
* randint64
* get 64-bits unsigned integer random
*/
ub8 randint64(randctx64 *r, ub8 rmin, ub8 rmax)
{
if (! r->randcnt-- ) {
isaac64(r);
r->randcnt = RANDSIZ - 1;
}
ub8 ret = (ub8) r->seed[r->randcnt];
return ret % (ub8) (rmax - rmin + 1) + rmin;
}
#ifdef NEVER
static void inner_test32()
{
ub4 i,j;
randctx ctx;
rand_init(&ctx, RAND_FALSE);
for (i=0; i<2; ++i) {
isaac32(&ctx);
for (j=0; j<256; ++j) {
printf("%.8lx",ctx.seed[j]);
if ((j&7)==7) {
printf("\n");
}
}
}
}
static void inner_test64()
{
ub8 i,j;
randctx64 ctx;
rand64_init(&ctx, RAND_FALSE);
for (i=0; i<2; ++i) {
isaac64(&ctx);
for (j=0; j<RANDSIZ; ++j) {
printf("%.8lx%.8lx",(ub4)(ctx.seed[j]>>32),(ub4)ctx.seed[j]);
if ((j&3)==3) {
printf("\n");
}
}
}
}
static void usage()
{
int i;
randctx ctx;
randctx64 ctx64;
rand_init(&ctx, RAND_TRUE);
rand64_init(&ctx64, RAND_TRUE);
for (i=0; i<100; ++i) {
printf("%03d: %d\n", i, (sb4)randint(&ctx, -100, 100));
printf("%03d: %lld\n", i, (sb8)randint64(&ctx64, -100, 100));
}
}
int main()
{
inner_test32();
inner_test64();
usage();
}
#endif
C语言生成32位和64位随机数算法的更多相关文章
- 64位主机64位oracle下装32位客户端ODAC(NFPACS版)
64位主机64位oracle下装32位客户端ODAC(NFPACS版) by dd 1.下载Oracle Data Access Components(ODAC) Xcopy的两个版本: x86:(我 ...
- Linux系统查看系统是32位还是64位方法总结
这篇博客是总结.归纳查看Linux系统是32位还是64位的一些方法,很多内容来自网上网友的博客.本篇只是整理.梳理这方面的知识,方便自己忘记的时候随时查看. 方法1:getconf LONG_BIT ...
- oracle 32位导64位
oracle 32位导64位 SHUTDOWN IMMEDIATE; STARTUP MOUNT; ALTER SYSTEM ENABLE RESTRICTED SESSION; ; ; ALTER ...
- Shell脚本中,如何判断Linux系统是32位还是64位?
一行就能搞定,输出32或者64 可以用“和. 参考代码如下: ldconfig if [ $(getconf WORD_BIT) = '32' ] && [ $(getconf LON ...
- 【转】Tomcat版本是32位、64位问题
转载地址:http://www.cnblogs.com/greensleeves/p/3168541.html 最近遇到一个Tomcat windows安装版本是32位还是64位问题.由于一系列原因, ...
- 查看Linux是32位还是64位
最直接简洁的办法: 在linux终端输入getconf LONG_BIT命令 如果是32位机器,则结果为32 [root@localhost ~]# getconf LONG_BIT 32 如果是64 ...
- Windows2003 IIS6.0支持32位和64位两种模式的设置方法
IIS 6.0 可支持 32 位和 64 位两种模式.但是,IIS 6.0 不支持在 64 位版本的 Windows 上同时运行这两种模式.ASP.NET 1.1 只在 32 位模式下运行.而 ASP ...
- linux-查看系统是32位还是64位
可以用命令“getconf LONG_BIT”查看, 如果返回的结果是32则说明是32位,返回的结果是64则说明是64位. 此外还可以使用命令“uname -a”查看, 输出的结果中,如果有x86_6 ...
- 查看linux机器是32位还是64位的方法
file /sbin/init 或者 file /bin/ls/sbin/init: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dyna ...
随机推荐
- springMVC源码分析--ControllerBeanNameHandlerMapping(八)
在上一篇博客springMVC源码分析--AbstractControllerUrlHandlerMapping(六)中我们介绍到AbstractControllerUrlHandlerMapping ...
- Python 制作Android开发 所需的适配不同分辨率的套图
使用Python做起工具来还真是爽,简单,方便,快捷.今天忙活了一下,制作出一个比较实用的小工具. 自动化套图制作,适配不同屏幕 尤其是对于android开发来说,要适配不同屏幕就需要多套切图,那么. ...
- Android文件(File)操作
Android 使用与其他平台上基于磁盘的文件系统类似的文件系统. 本文讲述如何使用 Android 文件系统通过 File API 读取和写入文件. File 对象适合按照从开始到结束的顺序不跳过地 ...
- android 网络工具 之Android-Volley的demo
1.今天详细的研究了Volley的使用,下面来给大家介绍一下: Android Volley 是Google开发的一个网络lib,可以让你更加简单并且快速的访问网络数据.Volley库的网络请求都是异 ...
- paypal的IPN机制
paypal对接时发现有这么一个机制,看起来还不错,起到了防止篡改欺诈行为,保证了通信的安全性,但会增加几次通信.
- JAVA面向对象-----super关键字
JAVA面向对象-–super关键字 1:定义Father(父类)类 1:成员变量int x=1; 2:构造方法无参的和有参的,有输出语句 2:定义Son类extends Father类 1:成员变量 ...
- 给你的流添加缓冲装置——字节块ByteChunk
这是一个很重要的一个字节数组处理缓冲工具,它封装了字节缓冲器及对字节缓冲区的操作,包括对缓冲区的写入.读取.扩展缓冲区大小等等,另外还提供相应字符编码的转码操作.此工具让缓冲操作变得更加方便,除了缓冲 ...
- 《java入门第一季》之tcp协议下的编程实现键盘录入数据不断地往服务器端发送数据案例
这里要封装通道流,封装键盘录入数据流. 同样地,还是两台电脑.一个客户端,一个服务器. 客户端代码: import java.io.BufferedReader; import java.io.Buf ...
- 《java入门第一季》之根据小案例体会泛型
泛型在哪些地方使用呢? * 看API,如果类,接口,抽象类后面跟的有<E>就说要使用泛型.一般来说就是在集合中使用. 下面根据案例,加深体会泛型的作用. 案例一: import java. ...
- Chapter 2 User Authentication, Authorization, and Security(10):创建包含数据库
原文出处:http://blog.csdn.net/dba_huangzj/article/details/39473895,专题目录:http://blog.csdn.net/dba_huangzj ...