1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify |
7 | * it under the terms of the GNU General Public License as published by |
7 | * it under the terms of the GNU General Public License as published by |
8 | * the Free Software Foundation, either version 3 of the License, or |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * (at your option) any later version. |
9 | * (at your option) any later version. |
… | |
… | |
41 | #endif |
41 | #endif |
42 | |
42 | |
43 | // put into ifs if you are very sure that the expression |
43 | // put into ifs if you are very sure that the expression |
44 | // is mostly true or mosty false. note that these return |
44 | // is mostly true or mosty false. note that these return |
45 | // booleans, not the expression. |
45 | // booleans, not the expression. |
46 | #define expect_false(expr) expect ((expr) != 0, 0) |
46 | #define expect_false(expr) expect ((expr) ? 1 : 0, 0) |
47 | #define expect_true(expr) expect ((expr) != 0, 1) |
47 | #define expect_true(expr) expect ((expr) ? 1 : 0, 1) |
48 | |
48 | |
49 | #include <pthread.h> |
49 | #include <pthread.h> |
50 | |
50 | |
51 | #include <cstddef> |
51 | #include <cstddef> |
52 | #include <cmath> |
52 | #include <cmath> |
… | |
… | |
72 | #endif |
72 | #endif |
73 | |
73 | |
74 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
74 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
76 | |
76 | |
77 | // very ugly macro that basicaly declares and initialises a variable |
77 | // very ugly macro that basically declares and initialises a variable |
78 | // that is in scope for the next statement only |
78 | // that is in scope for the next statement only |
79 | // works only for stuff that can be assigned 0 and converts to false |
79 | // works only for stuff that can be assigned 0 and converts to false |
80 | // (note: works great for pointers) |
80 | // (note: works great for pointers) |
81 | // most ugly macro I ever wrote |
81 | // most ugly macro I ever wrote |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
… | |
… | |
96 | // as a is often a constant while b is the variable. it is still a bug, though. |
96 | // as a is often a constant while b is the variable. it is still a bug, though. |
97 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
97 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
98 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
98 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
99 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
99 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
100 | |
100 | |
|
|
101 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
102 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
103 | template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); } |
|
|
104 | |
101 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
105 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
102 | |
106 | |
103 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
107 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
104 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
108 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
105 | |
109 | |
|
|
110 | // sign returns -1 or +1 |
|
|
111 | template<typename T> |
|
|
112 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
113 | // relies on 2c representation |
|
|
114 | template<> |
|
|
115 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
116 | |
|
|
117 | // sign0 returns -1, 0 or +1 |
|
|
118 | template<typename T> |
|
|
119 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
120 | |
|
|
121 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
122 | template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; } |
|
|
123 | // div, round-up |
|
|
124 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
|
|
125 | // div, round-down |
|
|
126 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
|
|
127 | |
106 | template<typename T> |
128 | template<typename T> |
107 | static inline T |
129 | static inline T |
108 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
130 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
109 | { |
131 | { |
110 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
132 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
133 | } |
|
|
134 | |
|
|
135 | // lerp, round-down |
|
|
136 | template<typename T> |
|
|
137 | static inline T |
|
|
138 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
139 | { |
|
|
140 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
141 | } |
|
|
142 | |
|
|
143 | // lerp, round-up |
|
|
144 | template<typename T> |
|
|
145 | static inline T |
|
|
146 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
147 | { |
|
|
148 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
111 | } |
149 | } |
112 | |
150 | |
113 | // lots of stuff taken from FXT |
151 | // lots of stuff taken from FXT |
114 | |
152 | |
115 | /* Rotate right. This is used in various places for checksumming */ |
153 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
351 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
389 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
352 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
390 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
353 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
391 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
354 | struct tausworthe_random_generator |
392 | struct tausworthe_random_generator |
355 | { |
393 | { |
356 | // generator |
|
|
357 | uint32_t state [4]; |
394 | uint32_t state [4]; |
358 | |
395 | |
359 | void operator =(const tausworthe_random_generator &src) |
396 | void operator =(const tausworthe_random_generator &src) |
360 | { |
397 | { |
361 | state [0] = src.state [0]; |
398 | state [0] = src.state [0]; |
… | |
… | |
364 | state [3] = src.state [3]; |
401 | state [3] = src.state [3]; |
365 | } |
402 | } |
366 | |
403 | |
367 | void seed (uint32_t seed); |
404 | void seed (uint32_t seed); |
368 | uint32_t next (); |
405 | uint32_t next (); |
|
|
406 | }; |
369 | |
407 | |
370 | // uniform distribution |
408 | // Xorshift RNGs, George Marsaglia |
|
|
409 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
410 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
411 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
412 | struct xorshift_random_generator |
|
|
413 | { |
|
|
414 | uint32_t x, y; |
|
|
415 | |
|
|
416 | void operator =(const xorshift_random_generator &src) |
|
|
417 | { |
|
|
418 | x = src.x; |
|
|
419 | y = src.y; |
|
|
420 | } |
|
|
421 | |
|
|
422 | void seed (uint32_t seed) |
|
|
423 | { |
|
|
424 | x = seed; |
|
|
425 | y = seed * 69069U; |
|
|
426 | } |
|
|
427 | |
|
|
428 | uint32_t next () |
|
|
429 | { |
|
|
430 | uint32_t t = x ^ (x << 10); |
|
|
431 | x = y; |
|
|
432 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
433 | return y; |
|
|
434 | } |
|
|
435 | }; |
|
|
436 | |
|
|
437 | template<class generator> |
|
|
438 | struct random_number_generator : generator |
|
|
439 | { |
|
|
440 | // uniform distribution, 0 .. max (0, num - 1) |
371 | uint32_t operator ()(uint32_t num) |
441 | uint32_t operator ()(uint32_t num) |
372 | { |
442 | { |
373 | return is_constant (num) |
443 | return !is_constant (num) ? get_range (num) // non-constant |
374 | ? (next () * (uint64_t)num) >> 32U |
444 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
375 | : get_range (num); |
445 | : this->next () & (num - 1); // constant, power-of-two |
376 | } |
446 | } |
377 | |
447 | |
378 | // return a number within (min .. max) |
448 | // return a number within (min .. max) |
379 | int operator () (int r_min, int r_max) |
449 | int operator () (int r_min, int r_max) |
380 | { |
450 | { |
… | |
… | |
391 | protected: |
461 | protected: |
392 | uint32_t get_range (uint32_t r_max); |
462 | uint32_t get_range (uint32_t r_max); |
393 | int get_range (int r_min, int r_max); |
463 | int get_range (int r_min, int r_max); |
394 | }; |
464 | }; |
395 | |
465 | |
396 | typedef tausworthe_random_generator rand_gen; |
466 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
397 | |
467 | |
398 | extern rand_gen rndm; |
468 | extern rand_gen rndm, rmg_rndm; |
399 | |
469 | |
400 | INTERFACE_CLASS (attachable) |
470 | INTERFACE_CLASS (attachable) |
401 | struct refcnt_base |
471 | struct refcnt_base |
402 | { |
472 | { |
403 | typedef int refcnt_t; |
473 | typedef int refcnt_t; |
… | |
… | |
470 | |
540 | |
471 | struct str_hash |
541 | struct str_hash |
472 | { |
542 | { |
473 | std::size_t operator ()(const char *s) const |
543 | std::size_t operator ()(const char *s) const |
474 | { |
544 | { |
475 | unsigned long hash = 0; |
545 | #if 0 |
|
|
546 | uint32_t hash = 0; |
476 | |
547 | |
477 | /* use the one-at-a-time hash function, which supposedly is |
548 | /* use the one-at-a-time hash function, which supposedly is |
478 | * better than the djb2-like one used by perl5.005, but |
549 | * better than the djb2-like one used by perl5.005, but |
479 | * certainly is better then the bug used here before. |
550 | * certainly is better then the bug used here before. |
480 | * see http://burtleburtle.net/bob/hash/doobs.html |
551 | * see http://burtleburtle.net/bob/hash/doobs.html |
… | |
… | |
487 | } |
558 | } |
488 | |
559 | |
489 | hash += hash << 3; |
560 | hash += hash << 3; |
490 | hash ^= hash >> 11; |
561 | hash ^= hash >> 11; |
491 | hash += hash << 15; |
562 | hash += hash << 15; |
|
|
563 | #else |
|
|
564 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
565 | // it is about twice as fast as the one-at-a-time one, |
|
|
566 | // with good distribution. |
|
|
567 | // FNV-1a is faster on many cpus because the multiplication |
|
|
568 | // runs concurrent with the looping logic. |
|
|
569 | uint32_t hash = 2166136261; |
|
|
570 | |
|
|
571 | while (*s) |
|
|
572 | hash = (hash ^ *s++) * 16777619; |
|
|
573 | #endif |
492 | |
574 | |
493 | return hash; |
575 | return hash; |
494 | } |
576 | } |
495 | }; |
577 | }; |
496 | |
578 | |