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,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
9 | * option) any later version. |
… | |
… | |
55 | #endif |
55 | #endif |
56 | |
56 | |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | |
59 | |
|
|
60 | // could use the sizeof (arr) /( sizeof (arr [0]) here, but C++ is |
|
|
61 | // much more obfuscated... :) |
|
|
62 | |
|
|
63 | template<typename T, int N> |
|
|
64 | inline int array_length (const T (&arr)[N]) |
|
|
65 | { |
|
|
66 | return N; |
|
|
67 | } |
|
|
68 | |
60 | // very ugly macro that basically declares and initialises a variable |
69 | // very ugly macro that basically declares and initialises a variable |
61 | // that is in scope for the next statement only |
70 | // that is in scope for the next statement only |
62 | // works only for stuff that can be assigned 0 and converts to false |
71 | // works only for stuff that can be assigned 0 and converts to false |
63 | // (note: works great for pointers) |
72 | // (note: works great for pointers) |
64 | // most ugly macro I ever wrote |
73 | // most ugly macro I ever wrote |
… | |
… | |
98 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
107 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
99 | |
108 | |
100 | // sign0 returns -1, 0 or +1 |
109 | // sign0 returns -1, 0 or +1 |
101 | template<typename T> |
110 | template<typename T> |
102 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
111 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
112 | |
|
|
113 | template<typename T, typename U> |
|
|
114 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
103 | |
115 | |
104 | // div* only work correctly for div > 0 |
116 | // div* only work correctly for div > 0 |
105 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
117 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
106 | template<typename T> static inline T div (T val, T div) |
118 | template<typename T> static inline T div (T val, T div) |
107 | { |
119 | { |
… | |
… | |
240 | absdir (int d) |
252 | absdir (int d) |
241 | { |
253 | { |
242 | return ((d - 1) & 7) + 1; |
254 | return ((d - 1) & 7) + 1; |
243 | } |
255 | } |
244 | |
256 | |
|
|
257 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
258 | #if GCC_VERSION(3,4) |
|
|
259 | static inline int least_significant_bit (uint32_t x) |
|
|
260 | { |
|
|
261 | return __builtin_ctz (x); |
|
|
262 | } |
|
|
263 | #else |
|
|
264 | int least_significant_bit (uint32_t x); |
|
|
265 | #endif |
|
|
266 | |
|
|
267 | #define for_all_bits_sparse_32(mask, idxvar) \ |
|
|
268 | for (uint32_t idxvar, mask_ = mask; \ |
|
|
269 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
|
|
270 | |
245 | extern ssize_t slice_alloc; // statistics |
271 | extern ssize_t slice_alloc; // statistics |
246 | |
272 | |
247 | void *salloc_ (int n) throw (std::bad_alloc); |
273 | void *salloc_ (int n) throw (std::bad_alloc); |
248 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
274 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
249 | |
275 | |
… | |
… | |
453 | return !is_constant (num) ? get_range (num) // non-constant |
479 | return !is_constant (num) ? get_range (num) // non-constant |
454 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
480 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
455 | : this->next () & (num - 1); // constant, power-of-two |
481 | : this->next () & (num - 1); // constant, power-of-two |
456 | } |
482 | } |
457 | |
483 | |
458 | // return a number within (min .. max) |
484 | // return a number within the closed interval [min .. max] |
459 | int operator () (int r_min, int r_max) |
485 | int operator () (int r_min, int r_max) |
460 | { |
486 | { |
461 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
487 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
462 | ? r_min + operator ()(r_max - r_min + 1) |
488 | ? r_min + operator ()(r_max - r_min + 1) |
463 | : get_range (r_min, r_max); |
489 | : get_range (r_min, r_max); |
464 | } |
490 | } |
465 | |
491 | |
|
|
492 | // return a number within the closed interval [0..1] |
466 | double operator ()() |
493 | double operator ()() |
467 | { |
494 | { |
468 | return this->next () / (double)0xFFFFFFFFU; |
495 | return this->next () / (double)0xFFFFFFFFU; |
469 | } |
496 | } |
470 | |
497 | |
… | |
… | |
559 | // FNV-1a is faster on many cpus because the multiplication |
586 | // FNV-1a is faster on many cpus because the multiplication |
560 | // runs concurrently with the looping logic. |
587 | // runs concurrently with the looping logic. |
561 | uint32_t hash = STRHSH_NULL; |
588 | uint32_t hash = STRHSH_NULL; |
562 | |
589 | |
563 | while (*s) |
590 | while (*s) |
564 | hash = (hash ^ *s++) * 16777619; |
591 | hash = (hash ^ *s++) * 16777619U; |
565 | |
592 | |
566 | return hash; |
593 | return hash; |
567 | } |
594 | } |
568 | |
595 | |
569 | static inline uint32_t |
596 | static inline uint32_t |
570 | memhsh (const char *s, size_t len) |
597 | memhsh (const char *s, size_t len) |
571 | { |
598 | { |
572 | uint32_t hash = STRHSH_NULL; |
599 | uint32_t hash = STRHSH_NULL; |
573 | |
600 | |
574 | while (len--) |
601 | while (len--) |
575 | hash = (hash ^ *s++) * 16777619; |
602 | hash = (hash ^ *s++) * 16777619U; |
576 | |
603 | |
577 | return hash; |
604 | return hash; |
578 | } |
605 | } |
579 | |
606 | |
580 | struct str_hash |
607 | struct str_hash |