-
Notifications
You must be signed in to change notification settings - Fork 1.1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Reimplementation of Random using an LXM pseudo-random number generator (
#10742) As described in the paper [LXM: Better Splittable Pseudorandom Number Generators (and Almost as Fast)](https://doi.org/10.1145/3485525) by Guy L. Steele Jr. and Sebastiano Vigna, proceedings of OOPSLA 2021. This provides a fast, state-of-the-art PRNG with full support for splitting. Initialization from a seed (an array of integers) proceeds by serializing the array to a byte sequence (each seed element occupies 8 bytes in little-endian representation) then hashing twice using the MD5 hash function and two different suffixes, obtaining 256 bits of initialization data. More tests were added in testsuite/tests/lib-random, and the lone test testsuite/tests/basic-more/testrandom.ml was moved there.
- Loading branch information
1 parent
8a4f2d2
commit 1d6ff7b
Showing
21 changed files
with
306 additions
and
291 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,69 @@ | ||
/**************************************************************************/ | ||
/* */ | ||
/* OCaml */ | ||
/* */ | ||
/* Xavier Leroy, projet Cambium, College de France and Inria */ | ||
/* */ | ||
/* Copyright 2021 Institut National de Recherche en Informatique et */ | ||
/* en Automatique. */ | ||
/* */ | ||
/* All rights reserved. This file is distributed under the terms of */ | ||
/* the GNU Lesser General Public License version 2.1, with the */ | ||
/* special exception on linking described in the file LICENSE. */ | ||
/* */ | ||
/**************************************************************************/ | ||
|
||
#include <string.h> | ||
#include "caml/alloc.h" | ||
#include "caml/bigarray.h" | ||
#include "caml/mlvalues.h" | ||
|
||
/* The L64X128 member of the LXM family. Taken from figure 1 in | ||
"LXM: Better Splittable Pseudorandom Number Generators | ||
(and Almost as Fast)" by Guy L. Steele Jr. and Sebastiano Vigna, | ||
OOPSLA 2021. */ | ||
|
||
static const uint64_t M = 0xd1342543de82ef95; | ||
|
||
struct LXM_state { | ||
uint64_t a; /* per-instance additive parameter (odd) */ | ||
uint64_t s; /* state of the LCG subgenerator */ | ||
uint64_t x[2]; /* state of the XBG subgenerator (not 0) */ | ||
}; | ||
|
||
/* In OCaml, states are represented as a 1D big array of 64-bit integers */ | ||
|
||
#define LXM_val(v) ((struct LXM_state *) Caml_ba_data_val(v)) | ||
|
||
Caml_inline uint64_t rotl(const uint64_t x, int k) { | ||
return (x << k) | (x >> (64 - k)); | ||
} | ||
|
||
CAMLprim uint64_t caml_lxm_next_unboxed(value v) | ||
{ | ||
uint64_t z, q0, q1; | ||
struct LXM_state * st = LXM_val(v); | ||
|
||
/* Combining operation */ | ||
z = st->s + st->x[0]; | ||
/* Mixing function */ | ||
z = (z ^ (z >> 32)) * 0xdaba0b6eb09322e3; | ||
z = (z ^ (z >> 32)) * 0xdaba0b6eb09322e3; | ||
z = (z ^ (z >> 32)); | ||
/* LCG update */ | ||
st->s = st->s * M + st->a; | ||
/* XBG update */ | ||
q0 = st->x[0]; q1 = st->x[1]; | ||
q1 ^= q0; | ||
q0 = rotl(q0, 24); | ||
q0 = q0 ^ q1 ^ (q1 << 16); | ||
q1 = rotl(q1, 37); | ||
st->x[0] = q0; st->x[1] = q1; | ||
/* Return result */ | ||
return z; | ||
} | ||
|
||
CAMLprim value caml_lxm_next(value v) | ||
{ | ||
return caml_copy_int64(caml_lxm_next_unboxed(v)); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.