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 | #if cplusplus_does_not_suck |
|
|
61 | // does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm) |
|
|
62 | template<typename T, int N> |
|
|
63 | static inline int array_length (const T (&arr)[N]) |
|
|
64 | { |
|
|
65 | return N; |
|
|
66 | } |
|
|
67 | #else |
|
|
68 | #define array_length(name) (sizeof (name) / sizeof (name [0])) |
|
|
69 | #endif |
|
|
70 | |
60 | // very ugly macro that basically declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
61 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
62 | // works only for stuff that can be assigned 0 and converts to false |
73 | // works only for stuff that can be assigned 0 and converts to false |
63 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
64 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
… | |
… | |
93 | // sign returns -1 or +1 |
104 | // sign returns -1 or +1 |
94 | template<typename T> |
105 | template<typename T> |
95 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
106 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
96 | // relies on 2c representation |
107 | // relies on 2c representation |
97 | template<> |
108 | template<> |
98 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
109 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
110 | template<> |
|
|
111 | inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); } |
|
|
112 | template<> |
|
|
113 | inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); } |
99 | |
114 | |
100 | // sign0 returns -1, 0 or +1 |
115 | // sign0 returns -1, 0 or +1 |
101 | template<typename T> |
116 | template<typename T> |
102 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
117 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
118 | |
|
|
119 | template<typename T, typename U> |
|
|
120 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
103 | |
121 | |
104 | // div* only work correctly for div > 0 |
122 | // div* only work correctly for div > 0 |
105 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
106 | template<typename T> static inline T div (T val, T div) |
124 | template<typename T> static inline T div (T val, T div) |
107 | { |
125 | { |
108 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
126 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
109 | } |
127 | } |
|
|
128 | |
|
|
129 | template<> inline float div (float val, float div) { return val / div; } |
|
|
130 | template<> inline double div (double val, double div) { return val / div; } |
|
|
131 | |
110 | // div, round-up |
132 | // div, round-up |
111 | template<typename T> static inline T div_ru (T val, T div) |
133 | template<typename T> static inline T div_ru (T val, T div) |
112 | { |
134 | { |
113 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
135 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
114 | } |
136 | } |
… | |
… | |
186 | int32_t d = b - a; |
208 | int32_t d = b - a; |
187 | d &= d >> 31; |
209 | d &= d >> 31; |
188 | return b - d; |
210 | return b - d; |
189 | } |
211 | } |
190 | |
212 | |
191 | // this is much faster than crossfires original algorithm |
213 | // this is much faster than crossfire's original algorithm |
192 | // on modern cpus |
214 | // on modern cpus |
193 | inline int |
215 | inline int |
194 | isqrt (int n) |
216 | isqrt (int n) |
195 | { |
217 | { |
196 | return (int)sqrtf ((float)n); |
218 | return (int)sqrtf ((float)n); |
… | |
… | |
240 | absdir (int d) |
262 | absdir (int d) |
241 | { |
263 | { |
242 | return ((d - 1) & 7) + 1; |
264 | return ((d - 1) & 7) + 1; |
243 | } |
265 | } |
244 | |
266 | |
|
|
267 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
268 | #if GCC_VERSION(3,4) |
|
|
269 | static inline int least_significant_bit (uint32_t x) |
|
|
270 | { |
|
|
271 | return __builtin_ctz (x); |
|
|
272 | } |
|
|
273 | #else |
|
|
274 | int least_significant_bit (uint32_t x); |
|
|
275 | #endif |
|
|
276 | |
|
|
277 | #define for_all_bits_sparse_32(mask, idxvar) \ |
|
|
278 | for (uint32_t idxvar, mask_ = mask; \ |
|
|
279 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
|
|
280 | |
245 | extern ssize_t slice_alloc; // statistics |
281 | extern ssize_t slice_alloc; // statistics |
246 | |
282 | |
247 | void *salloc_ (int n) throw (std::bad_alloc); |
283 | void *salloc_ (int n) throw (std::bad_alloc); |
248 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
284 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
249 | |
285 | |
… | |
… | |
445 | }; |
481 | }; |
446 | |
482 | |
447 | template<class generator> |
483 | template<class generator> |
448 | struct random_number_generator : generator |
484 | struct random_number_generator : generator |
449 | { |
485 | { |
450 | // uniform distribution, 0 .. max (0, num - 1) |
486 | // uniform distribution, [0 .. num - 1] |
451 | uint32_t operator ()(uint32_t num) |
487 | uint32_t operator ()(uint32_t num) |
452 | { |
488 | { |
453 | return !is_constant (num) ? get_range (num) // non-constant |
489 | return !is_constant (num) ? get_range (num) // non-constant |
454 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
490 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
455 | : this->next () & (num - 1); // constant, power-of-two |
491 | : this->next () & (num - 1); // constant, power-of-two |
456 | } |
492 | } |
457 | |
493 | |
458 | // return a number within (min .. max) |
494 | // return a number within the closed interval [min .. max] |
459 | int operator () (int r_min, int r_max) |
495 | int operator () (int r_min, int r_max) |
460 | { |
496 | { |
461 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
497 | return is_constant (r_min <= r_max) && r_min <= r_max |
462 | ? r_min + operator ()(r_max - r_min + 1) |
498 | ? r_min + operator ()(r_max - r_min + 1) |
463 | : get_range (r_min, r_max); |
499 | : get_range (r_min, r_max); |
464 | } |
500 | } |
465 | |
501 | |
|
|
502 | // return a number within the half-open interval [0..1[ |
466 | double operator ()() |
503 | double operator ()() |
467 | { |
504 | { |
468 | return this->next () / (double)0xFFFFFFFFU; |
505 | return this->next () / 0x100000000; |
469 | } |
506 | } |
470 | |
507 | |
471 | protected: |
508 | protected: |
472 | uint32_t get_range (uint32_t r_max); |
509 | uint32_t get_range (uint32_t r_max); |
473 | int get_range (int r_min, int r_max); |
510 | int get_range (int r_min, int r_max); |
… | |
… | |
545 | typedef refptr<maptile> maptile_ptr; |
582 | typedef refptr<maptile> maptile_ptr; |
546 | typedef refptr<object> object_ptr; |
583 | typedef refptr<object> object_ptr; |
547 | typedef refptr<archetype> arch_ptr; |
584 | typedef refptr<archetype> arch_ptr; |
548 | typedef refptr<client> client_ptr; |
585 | typedef refptr<client> client_ptr; |
549 | typedef refptr<player> player_ptr; |
586 | typedef refptr<player> player_ptr; |
|
|
587 | typedef refptr<region> region_ptr; |
|
|
588 | |
|
|
589 | #define STRHSH_NULL 2166136261 |
|
|
590 | |
|
|
591 | static inline uint32_t |
|
|
592 | strhsh (const char *s) |
|
|
593 | { |
|
|
594 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
595 | // it is about twice as fast as the one-at-a-time one, |
|
|
596 | // with good distribution. |
|
|
597 | // FNV-1a is faster on many cpus because the multiplication |
|
|
598 | // runs concurrently with the looping logic. |
|
|
599 | uint32_t hash = STRHSH_NULL; |
|
|
600 | |
|
|
601 | while (*s) |
|
|
602 | hash = (hash ^ *s++) * 16777619U; |
|
|
603 | |
|
|
604 | return hash; |
|
|
605 | } |
|
|
606 | |
|
|
607 | static inline uint32_t |
|
|
608 | memhsh (const char *s, size_t len) |
|
|
609 | { |
|
|
610 | uint32_t hash = STRHSH_NULL; |
|
|
611 | |
|
|
612 | while (len--) |
|
|
613 | hash = (hash ^ *s++) * 16777619U; |
|
|
614 | |
|
|
615 | return hash; |
|
|
616 | } |
550 | |
617 | |
551 | struct str_hash |
618 | struct str_hash |
552 | { |
619 | { |
553 | std::size_t operator ()(const char *s) const |
620 | std::size_t operator ()(const char *s) const |
554 | { |
621 | { |
555 | #if 0 |
|
|
556 | uint32_t hash = 0; |
|
|
557 | |
|
|
558 | /* use the one-at-a-time hash function, which supposedly is |
|
|
559 | * better than the djb2-like one used by perl5.005, but |
|
|
560 | * certainly is better then the bug used here before. |
|
|
561 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
562 | */ |
|
|
563 | while (*s) |
|
|
564 | { |
|
|
565 | hash += *s++; |
|
|
566 | hash += hash << 10; |
|
|
567 | hash ^= hash >> 6; |
|
|
568 | } |
|
|
569 | |
|
|
570 | hash += hash << 3; |
|
|
571 | hash ^= hash >> 11; |
|
|
572 | hash += hash << 15; |
|
|
573 | #else |
|
|
574 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
575 | // it is about twice as fast as the one-at-a-time one, |
|
|
576 | // with good distribution. |
|
|
577 | // FNV-1a is faster on many cpus because the multiplication |
|
|
578 | // runs concurrent with the looping logic. |
|
|
579 | uint32_t hash = 2166136261; |
|
|
580 | |
|
|
581 | while (*s) |
|
|
582 | hash = (hash ^ *s++) * 16777619; |
|
|
583 | #endif |
|
|
584 | |
|
|
585 | return hash; |
622 | return strhsh (s); |
|
|
623 | } |
|
|
624 | |
|
|
625 | std::size_t operator ()(const shstr &s) const |
|
|
626 | { |
|
|
627 | return strhsh (s); |
586 | } |
628 | } |
587 | }; |
629 | }; |
588 | |
630 | |
589 | struct str_equal |
631 | struct str_equal |
590 | { |
632 | { |