- File:
-
- 1 edited
-
libcfa/src/concurrency/thread.cfa (modified) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/concurrency/thread.cfa
r2210cfc r24e321c 10 10 // Created On : Tue Jan 17 12:27:26 2017 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Mon Jan 10 17:05:35 202213 // Update Count : 2812 // Last Modified On : Wed Dec 4 09:17:49 2019 13 // Update Count : 9 14 14 // 15 15 … … 27 27 uint64_t thread_rand(); 28 28 29 extern uint32_t __thread_seed; // global thread seed30 31 29 //----------------------------------------------------------------------------- 32 30 // Thread ctors and dtors 33 void ?{}( thread$ & this, const char * const name, cluster & cl, void * storage, size_t storageSize ) with( this ) {31 void ?{}(thread$ & this, const char * const name, cluster & cl, void * storage, size_t storageSize ) with( this ) { 34 32 context{ 0p, 0p }; 35 33 self_cor{ name, storage, storageSize }; … … 41 39 self_mon.owner = &this; 42 40 self_mon.recursion = 1; 43 random_state = __thread_seed;44 41 self_mon_p = &self_mon; 45 42 curr_cluster = &cl; … … 181 178 } 182 179 183 #define GENERATOR LCG184 185 inline uint32_t MarsagliaXor( uint32_t & state ) {186 state ^= state << 6;187 state ^= state >> 21;188 state ^= state << 7;189 return state;190 } // MarsagliaXor191 192 inline uint32_t LCG( uint32_t & state ) { // linear congruential generator193 return state = 36969 * (state & 65535) + (state >> 16); // 36969 is NOT prime!194 } // LCG195 196 void set_seed( uint32_t seed ) { active_thread()->random_state = seed; __thread_seed = seed; }197 uint32_t prng( void ) { return GENERATOR( active_thread()->random_state ); } // [0,UINT_MAX]198 199 180 // Local Variables: // 200 181 // mode: c //
Note:
See TracChangeset
for help on using the changeset viewer.