stasis-aries-wal/stasis/util/random.h

90 lines
2.8 KiB
C
Raw Normal View History

/*
* random.h
*
* Created on: Aug 31, 2011
* Author: sears
*/
#ifndef RANDOM_H_
#define RANDOM_H_
#include <stasis/common.h>
BEGIN_C_DECLS
uint64_t stasis_util_random64(uint64_t x);
merge in changes from svn[r1572..r1601] ------------------------------------------------------------------------ r1601 | sears.russell@gmail.com | 2012-03-20 18:43:00 -0400 (Tue, 20 Mar 2012) | 1 line commit bLSM bloom filter to stasis/util, which is where it really belongs ------------------------------------------------------------------------ r1600 | sears.russell@gmail.com | 2012-03-04 01:58:38 -0500 (Sun, 04 Mar 2012) | 1 line fix memory leak in skiplist unit test (now it is valgrind clean) ------------------------------------------------------------------------ r1599 | sears.russell@gmail.com | 2012-03-04 01:58:05 -0500 (Sun, 04 Mar 2012) | 1 line fix typo in finalize type ------------------------------------------------------------------------ r1598 | sears.russell@gmail.com | 2012-03-04 00:59:59 -0500 (Sun, 04 Mar 2012) | 1 line add comparator and finalizer parameters to skiplist constructor ------------------------------------------------------------------------ r1597 | sears.russell@gmail.com | 2012-03-03 18:23:16 -0500 (Sat, 03 Mar 2012) | 1 line bugfixes for skiplist ------------------------------------------------------------------------ r1596 | sears.russell@gmail.com | 2012-03-02 15:05:07 -0500 (Fri, 02 Mar 2012) | 1 line updated concurrentSkipList. Seeing strange crashes ------------------------------------------------------------------------ r1595 | sears.russell@gmail.com | 2012-03-01 16:51:59 -0500 (Thu, 01 Mar 2012) | 1 line add progress reports ------------------------------------------------------------------------ r1594 | sears.russell@gmail.com | 2012-02-28 13:17:05 -0500 (Tue, 28 Feb 2012) | 1 line experimental support for automatic logfile preallocation ------------------------------------------------------------------------ r1593 | sears.russell@gmail.com | 2012-02-28 12:10:01 -0500 (Tue, 28 Feb 2012) | 1 line add histogram reporting to rawIOPS benchmark ------------------------------------------------------------------------ r1592 | sears.russell@gmail.com | 2012-02-24 16:31:36 -0500 (Fri, 24 Feb 2012) | 1 line userspace raid 0 implementation ------------------------------------------------------------------------ r1591 | sears.russell@gmail.com | 2012-02-12 01:47:25 -0500 (Sun, 12 Feb 2012) | 1 line add skiplist unit test, fix compile warnings ------------------------------------------------------------------------ r1590 | sears.russell@gmail.com | 2012-02-12 00:52:52 -0500 (Sun, 12 Feb 2012) | 1 line fix compile error ------------------------------------------------------------------------ r1589 | sears.russell@gmail.com | 2012-02-12 00:50:21 -0500 (Sun, 12 Feb 2012) | 1 line fix some bugs in hazard.h surrounding thread list management and overruns of R under high contention ------------------------------------------------------------------------ r1588 | sears.russell@gmail.com | 2012-02-11 14:23:10 -0500 (Sat, 11 Feb 2012) | 1 line add hazard pointer for get_lock. It was implicitly blowing away the hazard pointer protecting y in the caller ------------------------------------------------------------------------ r1587 | sears.russell@gmail.com | 2012-02-10 18:51:25 -0500 (Fri, 10 Feb 2012) | 1 line fix null pointer bug ------------------------------------------------------------------------ r1586 | sears.russell@gmail.com | 2012-02-10 18:03:39 -0500 (Fri, 10 Feb 2012) | 1 line add simple refcounting scheme to concurrentSkipList. This solves the problem where a deleted node points to another deleted node, and we only have a hazard pointer for the first node. ------------------------------------------------------------------------ r1585 | sears.russell@gmail.com | 2012-02-10 14:19:14 -0500 (Fri, 10 Feb 2012) | 1 line add hazard pointers for update using the smallest free slot first. The old method left a race condition, since hazard_scan stops at the first null pointer. ------------------------------------------------------------------------ r1584 | sears.russell@gmail.com | 2012-02-10 02:45:30 -0500 (Fri, 10 Feb 2012) | 1 line add hazard pointers for update array ------------------------------------------------------------------------ r1583 | sears.russell@gmail.com | 2012-02-10 00:04:50 -0500 (Fri, 10 Feb 2012) | 1 line skiplist update: concurrent, but broken ------------------------------------------------------------------------ r1582 | sears.russell@gmail.com | 2012-02-09 17:44:27 -0500 (Thu, 09 Feb 2012) | 1 line skip list implementation. Not concurrent yet. ------------------------------------------------------------------------ r1581 | sears.russell@gmail.com | 2012-02-08 13:33:29 -0500 (Wed, 08 Feb 2012) | 1 line Commit of a bunch of new, unused code: KISS random number generator, Hazard Pointers, SUX latches (untested) and bit twiddling for concurrent b-tree ------------------------------------------------------------------------ r1580 | sears.russell@gmail.com | 2012-01-17 19:17:37 -0500 (Tue, 17 Jan 2012) | 1 line fix typo ------------------------------------------------------------------------ r1579 | sears.russell@gmail.com | 2012-01-11 18:33:31 -0500 (Wed, 11 Jan 2012) | 1 line static build fixes for linux. hopefully these do not break macos... ------------------------------------------------------------------------ r1578 | sears.russell@gmail.com | 2012-01-09 19:13:34 -0500 (Mon, 09 Jan 2012) | 1 line fix cmake under linux ------------------------------------------------------------------------ r1577 | sears.russell@gmail.com | 2012-01-09 18:37:15 -0500 (Mon, 09 Jan 2012) | 1 line fix linux static binary compilation bugs ------------------------------------------------------------------------ r1576 | sears.russell | 2012-01-09 18:00:08 -0500 (Mon, 09 Jan 2012) | 1 line port to macos x ------------------------------------------------------------------------ r1575 | sears.russell | 2012-01-09 17:39:43 -0500 (Mon, 09 Jan 2012) | 1 line add missing _ from sync call name ------------------------------------------------------------------------ r1574 | sears.russell@gmail.com | 2012-01-09 14:26:31 -0500 (Mon, 09 Jan 2012) | 1 line add -rt flag to static builds ------------------------------------------------------------------------ r1573 | sears.russell@gmail.com | 2011-12-20 23:38:29 -0500 (Tue, 20 Dec 2011) | 1 line Simple makefile geared toward building libstasis.so and libstasis.a (and nothing else) ------------------------------------------------------------------------ r1572 | sears.russell@gmail.com | 2011-12-20 22:37:54 -0500 (Tue, 20 Dec 2011) | 1 line add some missing #include<config.h> lines
2012-04-21 16:52:31 +00:00
/**
* The remainder of this file is a cleaned up and reentrant version of George
* Marsaglia's generators from stat.sci.math in 1999.
*
* I was concerned that replacing the macros with static inlines would hurt
* the optimizer, but for some reason, on my machine, and with -O3,
* check_kiss.c is about 2x faster than the version from the newsgroup posting.
*
* @see check_kiss.c for the original, unmodified code.
*/
typedef struct {
uint32_t x;
uint32_t y;
uint32_t bro;
uint8_t c;
uint32_t z;
uint32_t w;
uint32_t jsr;
uint32_t jcong;
uint32_t a;
uint32_t b;
uint32_t t[256];
} kiss_table_t;
static inline uint32_t stasis_util_random_kiss_znew(kiss_table_t* k) {
return k->z=36969*(k->z&65535)+(k->z>>16);
}
static inline uint32_t stasis_util_random_kiss_wnew(kiss_table_t* k) {
return k->w=18000*(k->w&65535)+(k->w>>16);
}
static inline uint32_t stasis_util_random_kiss_MWC(kiss_table_t* k) {
return (stasis_util_random_kiss_znew(k)<<16)+stasis_util_random_kiss_wnew(k);
}
static inline uint32_t stasis_util_random_kiss_SHR3(kiss_table_t* k) {
return (k->jsr^=(k->jsr<<17), k->jsr^=(k->jsr>>13), k->jsr^=(k->jsr<<5));
}
static inline uint32_t stasis_util_random_kiss_CONG(kiss_table_t* k) {
return k->jcong=69069*k->jcong+1234567;
}
static inline uint32_t stasis_util_random_kiss_FIB(kiss_table_t* k) {
return ((k->b=k->a+k->b),(k->a=k->b-k->a));
}
static inline uint32_t stasis_util_random_kiss_KISS(kiss_table_t* k) {
return (stasis_util_random_kiss_MWC(k)^stasis_util_random_kiss_CONG(k))
+ stasis_util_random_kiss_SHR3(k);
}
static inline uint32_t stasis_util_random_kiss_LFIB4(kiss_table_t* k) {
(k->c)++;
return
k->t[k->c]=k->t[k->c]
+k->t[(uint8_t)(k->c+58)]
+k->t[(uint8_t)(k->c+119)]
+k->t[(uint8_t)(k->c+178)];
}
static inline uint32_t stasis_util_random_kiss_SWB(kiss_table_t* k) {
return (k->c++,
k->bro=(k->x<k->y),
k->t[k->c]=(k->x=k->t[(uint8_t)(k->c+34)])-(k->y=k->t[(uint8_t)(k->c+19)]+k->bro));
}
static inline float stasis_util_random_kiss_UNI(kiss_table_t *k) {
return stasis_util_random_kiss_KISS(k) * 2.328306e-10;
}
static inline float stasis_util_random_kiss_VNI(kiss_table_t *k) {
return ((int32_t) stasis_util_random_kiss_KISS(k))*4.656613e-10;
}
static inline void stasis_util_random_kiss_settable(kiss_table_t *k,
uint32_t i1, uint32_t i2, uint32_t i3,
uint32_t i4, uint32_t i5, uint32_t i6) {
k->x=0;k->y=0;k->c=0;k->z=i1;k->w=i2,k->jsr=i3; k->jcong=i4; k->a=i5; k->b=i6;
for(int i = 0; i < 256; i++) { k->t[i] = stasis_util_random_kiss_KISS(k); }
}
END_C_DECLS
#endif /* RANDOM_H_ */