23 template<jit::
float_scalar T,
bool SAFE_MATH=false>
32 stream <<
"struct mt_state {" << std::endl
33 <<
" array<uint32_t, 624> array;" << std::endl
34 <<
" uint16_t index;" << std::endl
36 <<
" uint16_t padding[3];" << std::endl
46 std::array<uint32_t, 624>
array;
65 states.push_back(initialize_state(
seed +
i));
109 if (!pre_funcs.contains(
"random_state")) {
110 pre_funcs.insert(
"random_state");
146 std::cout <<
"state";
158 if (registers.find(
this) == registers.end()) {
160 registers[
this] =
name;
161 stream <<
" " <<
name
162 <<
" [label = \"state\", shape = box, style = \"rounded,filled\", fillcolor = black, fontcolor = white];" << std::endl;
183 return states.size();
201 return states.data();
206 std::vector<mt_state> states;
213 static std::string to_string() {
214 return "random_state";
225 state.array[0] =
seed;
227 state.array[
i] = 1812433253U*(state.array[
i - 1]^(state.array[
i - 1] >> 30)) +
i;
245 template<jit::
float_scalar T,
bool SAFE_MATH=false>
248 auto temp = std::make_shared<random_state_node<T, SAFE_MATH>> (size,
seed)->reduce();
250 for (
size_t i =
temp->get_hash();
260#if defined(__clang__) || defined(__GNUC__)
263 assert(
false &&
"Should never reach.");
268 template<jit::
float_scalar T,
bool SAFE_MATH=false>
280 template<jit::
float_scalar T,
bool SAFE_MATH=false>
282 return std::dynamic_pointer_cast<random_state_node<T, SAFE_MATH>> (x);
294 template<jit::
float_scalar T,
bool SAFE_MATH=false>
303 static std::string to_string() {
314 stream <<
"uint32_t random(";
315 if constexpr (jit::use_metal<T> ()) {
318 stream <<
"mt_state &state) {" << std::endl
319 <<
" const uint16_t k = state.index;" << std::endl
320 <<
" state.index = (k + 1) % 624;" << std::endl
321 <<
" uint32_t x = (state.array[k] & 0x80000000U) |" << std::endl
322 <<
" (state.array[state.index] & 0x7fffffffU);" << std::endl
323 <<
" uint32_t xA = x >> 1;" << std::endl
324 <<
" xA = x & 0x1U ? xA^0x9908b0dfU : xA;" << std::endl
325 <<
" const uint16_t j = (k + 397) % 624;" << std::endl
326 <<
" x = state.array[j]^xA;" << std::endl
327 <<
" state.array[k] = x;" << std::endl
328 <<
" uint32_t y = x^(x >> 11);" << std::endl
329 <<
" y = y^((y << 7) & 0x9d2c5680U);" << std::endl
330 <<
" y = y^((y << 15) & 0xefc60000U);" << std::endl
331 <<
" return y^(y >> 18);" << std::endl
386 this->
arg->compile_preamble(stream, registers,
401 if (!pre_funcs.contains(
"random")) {
402 pre_funcs.insert(
"random");
422 if (registers.find(
this) == registers.end()) {
423 auto a = this->
arg->compile(stream, registers,
427 registers[
this] =
"static_cast<"
428 + jit::get_type_string<T> ()
430 + registers[
a.get()] +
"))";
432 registers[
this] =
"random(" + registers[
a.get()] +
")";
458 std::cout <<
"random(";
459 this->
arg->to_latex();
472 if (registers.find(
this) == registers.end()) {
474 registers[
this] =
name;
475 stream <<
" " <<
name
476 <<
" [label = \"state\", shape = box, style = \"rounded,filled\", fillcolor = black, fontcolor = white];" << std::endl;
478 auto a = this->
arg->to_vizgraph(stream, registers);
479 stream <<
" " <<
name <<
" -- " << registers[
a.get()] <<
";" << std::endl;
504 template<jit::
float_scalar T,
bool SAFE_MATH=false>
506 auto temp = std::make_shared<random_node<T, SAFE_MATH>> (state)->reduce();
508 for (
size_t i =
temp->get_hash();
518#if defined(__clang__) || defined(__GNUC__)
521 assert(
false &&
"Should never reach.");
526 template<jit::
float_scalar T,
bool SAFE_MATH=false>
538 template<jit::
float_scalar T,
bool SAFE_MATH=false>
540 return std::dynamic_pointer_cast<random_node<T, SAFE_MATH>> (x);
551 template<jit::
float_scalar T,
bool SAFE_MATH=false>
567 template<jit::
float_scalar T, jit::
float_scalar R,
bool SAFE_MATH=false>
Class representing a generic buffer.
Definition backend.hpp:29
Class representing a node leaf.
Definition node.hpp:371
Class representing a random_node leaf.
Definition random.hpp:295
virtual void compile_preamble(std::ostringstream &stream, jit::register_map ®isters, jit::visiter_map &visited, jit::register_usage &usage, jit::texture1d_list &textures1d, jit::texture2d_list &textures2d, jit::preamble_map &pre_funcs, int &avail_const_mem)
Compile preamble.
Definition random.hpp:377
virtual bool is_match(shared_leaf< T, SAFE_MATH > x)
Query if the nodes match.
Definition random.hpp:450
random_node(shared_random_state< T, SAFE_MATH > x)
Construct a constant node from a vector.
Definition random.hpp:340
virtual backend::buffer< T > evaluate()
Evaluate the results of random node.
Definition random.hpp:348
virtual shared_leaf< T, SAFE_MATH > get_power_exponent() const
Get the exponent of a power.
Definition random.hpp:490
virtual void to_latex() const
Convert the node to latex.
Definition random.hpp:457
static void compile_random(std::ostringstream &stream)
Write the preamble for the random function.
Definition random.hpp:313
virtual shared_leaf< T, SAFE_MATH > to_vizgraph(std::stringstream &stream, jit::register_map ®isters)
Convert the node to vizgraph.
Definition random.hpp:470
virtual shared_leaf< T, SAFE_MATH > compile(std::ostringstream &stream, jit::register_map ®isters, const jit::register_map &thread_mem, const jit::register_usage &usage)
Compile the node.
Definition random.hpp:418
virtual shared_leaf< T, SAFE_MATH > df(shared_leaf< T, SAFE_MATH > x)
Transform node to derivative.
Definition random.hpp:361
Random state.
Definition random.hpp:24
virtual shared_leaf< T, SAFE_MATH > to_vizgraph(std::stringstream &stream, jit::register_map ®isters)
Convert the node to vizgraph.
Definition random.hpp:156
size_t size()
Get the size of the random state vector in bytes.
Definition random.hpp:182
virtual void compile_preamble(std::ostringstream &stream, jit::register_map ®isters, jit::visiter_map &visited, jit::register_usage &usage, jit::texture1d_list &textures1d, jit::texture2d_list &textures2d, jit::preamble_map &pre_funcs, int &avail_const_mem)
Compile preamble.
Definition random.hpp:101
random_state_node(const size_t size, const uint32_t seed=0)
Construct a constant node from a vector.
Definition random.hpp:61
virtual shared_leaf< T, SAFE_MATH > df(shared_leaf< T, SAFE_MATH > x)
Transform node to derivative.
Definition random.hpp:85
virtual void to_latex() const
Convert the node to latex.
Definition random.hpp:145
virtual backend::buffer< T > evaluate()
Evaluate the results of random_state_node.
Definition random.hpp:74
size_t get_size_bytes()
Get the size of the random state vector in bytes.
Definition random.hpp:191
virtual shared_leaf< T, SAFE_MATH > get_power_exponent() const
Get the exponent of a power.
Definition random.hpp:173
mt_state * data()
Get the size of the random state vector in bytes.
Definition random.hpp:200
virtual shared_leaf< T, SAFE_MATH > compile(std::ostringstream &stream, jit::register_map ®isters, const jit::register_map &thread_mem, const jit::register_usage &usage)
Compile the node.
Definition random.hpp:135
static void compile_random_state(std::ostringstream &stream)
Write the preamble for the random state struct.
Definition random.hpp:31
Class representing a straight node.
Definition node.hpp:1219
shared_leaf< T, SAFE_MATH > arg
Argument.
Definition node.hpp:1222
Complex scalar concept.
Definition register.hpp:25
subroutine assert(test, message)
Assert check.
Definition f_binding_test.f90:38
Name space for graph nodes.
Definition arithmetic.hpp:13
constexpr shared_leaf< T, SAFE_MATH > random_scale()
Create a random_scale constant.
Definition random.hpp:552
constexpr shared_leaf< T, SAFE_MATH > uniform_random(const R min, const R max, shared_random_state< T, SAFE_MATH > state)
Create a uniform random number.
Definition random.hpp:568
shared_random_state< T, SAFE_MATH > random_state_cast(shared_leaf< T, SAFE_MATH > x)
Cast to a random_state node.
Definition random.hpp:281
constexpr shared_leaf< T, SAFE_MATH > zero()
Forward declare for zero.
Definition node.hpp:1154
shared_leaf< T, SAFE_MATH > random(shared_random_state< T, SAFE_MATH > state)
Define random convenience function.
Definition random.hpp:505
std::shared_ptr< random_state_node< T, SAFE_MATH > > shared_random_state
Convenience type alias for shared sqrt nodes.
Definition random.hpp:269
std::shared_ptr< random_node< T, SAFE_MATH > > shared_random
Convenience type alias for shared sqrt nodes.
Definition random.hpp:527
constexpr T i
Convenience type for imaginary constant.
Definition node.hpp:1186
shared_leaf< T, SAFE_MATH > min(shared_leaf< T, SAFE_MATH > l, shared_leaf< T, SAFE_MATH > r)
Build a max node from a condition and two leaves.
Definition logical.hpp:3266
std::shared_ptr< leaf_node< T, SAFE_MATH > > shared_leaf
Convenience type alias for shared leaf nodes.
Definition node.hpp:691
shared_random< T, SAFE_MATH > random_cast(shared_leaf< T, SAFE_MATH > x)
Cast to a random node.
Definition random.hpp:539
shared_leaf< T, SAFE_MATH > random_state(const size_t size, const uint32_t seed=0)
Define random_state convenience function.
Definition random.hpp:246
std::unordered_set< void * > visiter_map
Type alias for listing visited nodes.
Definition register.hpp:263
std::unordered_map< void *, size_t > register_usage
Type alias for counting register usage.
Definition register.hpp:261
std::unordered_set< std::string > preamble_map
Type alias for preamble defined functions.
Definition register.hpp:269
std::unordered_map< void *, std::string > register_map
Type alias for mapping node pointers to register names.
Definition register.hpp:259
std::unordered_map< void *, std::array< size_t, 2 > > texture2d_list
Type alias for indexing 2D textures.
Definition register.hpp:267
std::unordered_map< void *, size_t > texture1d_list
Type alias for indexing 1D textures.
Definition register.hpp:265
std::string to_string(const char prefix, const NODE *pointer)
Convert a graph::leaf_node pointer to a string.
Definition register.hpp:247
Base nodes of graph computation framework.
Random state structure.
Definition random.hpp:44
uint16_t index
State index.
Definition random.hpp:48
std::array< uint32_t, 624 > array
State array.
Definition random.hpp:46