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 |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * the Free Software Foundation, either version 3 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * (at your option) any later version. |
9 | * option) any later version. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
18 | * |
19 | * |
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | */ |
21 | */ |
21 | |
22 | |
22 | #ifndef UTIL_H__ |
23 | #ifndef UTIL_H__ |
23 | #define UTIL_H__ |
24 | #define UTIL_H__ |
24 | |
25 | |
|
|
26 | #include <compiler.h> |
|
|
27 | |
25 | #define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 |
28 | #define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 |
26 | #define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs |
29 | #define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs |
27 | #define PREFER_MALLOC 0 // use malloc and not the slice allocator |
30 | #define PREFER_MALLOC 0 // use malloc and not the slice allocator |
28 | |
|
|
29 | #if __GNUC__ >= 3 |
|
|
30 | # define is_constant(c) __builtin_constant_p (c) |
|
|
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
|
|
33 | #else |
|
|
34 | # define is_constant(c) 0 |
|
|
35 | # define expect(expr,value) (expr) |
|
|
36 | # define prefetch(addr,rw,locality) |
|
|
37 | #endif |
|
|
38 | |
|
|
39 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
40 | # define decltype(x) typeof(x) |
|
|
41 | #endif |
|
|
42 | |
|
|
43 | // put into ifs if you are very sure that the expression |
|
|
44 | // is mostly true or mosty false. note that these return |
|
|
45 | // booleans, not the expression. |
|
|
46 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
47 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
48 | |
31 | |
49 | #include <pthread.h> |
32 | #include <pthread.h> |
50 | |
33 | |
51 | #include <cstddef> |
34 | #include <cstddef> |
52 | #include <cmath> |
35 | #include <cmath> |
… | |
… | |
72 | #endif |
55 | #endif |
73 | |
56 | |
74 | // 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) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
76 | |
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 | |
77 | // very ugly macro that basicaly declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
78 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
79 | // 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 |
80 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
81 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
76 | #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. |
90 | // 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; } |
91 | 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; } |
92 | 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; } |
93 | 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 | |
94 | |
101 | template<typename T> static inline void min_it (T &v, T m) { v = min (v, m); } |
95 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
102 | template<typename T> static inline void max_it (T &v, T m) { v = max (v, m); } |
96 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
103 | template<typename T> static inline void clamp_it (T &v, T a, T b) { v = clamp (v, a, b); } |
97 | 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 | |
98 | |
105 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
99 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
106 | |
100 | |
107 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
101 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (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)); } |
102 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
109 | |
103 | |
|
|
104 | // sign returns -1 or +1 |
|
|
105 | template<typename T> |
|
|
106 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
107 | // relies on 2c representation |
|
|
108 | template<> |
|
|
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); } |
|
|
114 | |
|
|
115 | // sign0 returns -1, 0 or +1 |
|
|
116 | template<typename T> |
|
|
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; } |
|
|
121 | |
|
|
122 | // div* only work correctly for div > 0 |
110 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
111 | template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; } |
124 | template<typename T> static inline T div (T val, T div) |
|
|
125 | { |
|
|
126 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
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 | |
112 | // div, round-up |
132 | // div, round-up |
113 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
133 | template<typename T> static inline T div_ru (T val, T div) |
|
|
134 | { |
|
|
135 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
136 | } |
114 | // div, round-down |
137 | // div, round-down |
115 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
138 | template<typename T> static inline T div_rd (T val, T div) |
|
|
139 | { |
|
|
140 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
141 | } |
116 | |
142 | |
|
|
143 | // lerp* only work correctly for min_in < max_in |
|
|
144 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
117 | template<typename T> |
145 | template<typename T> |
118 | static inline T |
146 | static inline T |
119 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
147 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
120 | { |
148 | { |
121 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
149 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
… | |
… | |
180 | int32_t d = b - a; |
208 | int32_t d = b - a; |
181 | d &= d >> 31; |
209 | d &= d >> 31; |
182 | return b - d; |
210 | return b - d; |
183 | } |
211 | } |
184 | |
212 | |
185 | // this is much faster than crossfires original algorithm |
213 | // this is much faster than crossfire's original algorithm |
186 | // on modern cpus |
214 | // on modern cpus |
187 | inline int |
215 | inline int |
188 | isqrt (int n) |
216 | isqrt (int n) |
189 | { |
217 | { |
190 | return (int)sqrtf ((float)n); |
218 | return (int)sqrtf ((float)n); |
|
|
219 | } |
|
|
220 | |
|
|
221 | // this is kind of like the ^^ operator, if it would exist, without sequence point. |
|
|
222 | // more handy than it looks like, due to the implicit !! done on its arguments |
|
|
223 | inline bool |
|
|
224 | logical_xor (bool a, bool b) |
|
|
225 | { |
|
|
226 | return a != b; |
|
|
227 | } |
|
|
228 | |
|
|
229 | inline bool |
|
|
230 | logical_implies (bool a, bool b) |
|
|
231 | { |
|
|
232 | return a <= b; |
191 | } |
233 | } |
192 | |
234 | |
193 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
235 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
194 | #if 0 |
236 | #if 0 |
195 | // and has a max. error of 6 in the range -100..+100. |
237 | // and has a max. error of 6 in the range -100..+100. |
… | |
… | |
220 | absdir (int d) |
262 | absdir (int d) |
221 | { |
263 | { |
222 | return ((d - 1) & 7) + 1; |
264 | return ((d - 1) & 7) + 1; |
223 | } |
265 | } |
224 | |
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 | |
225 | extern ssize_t slice_alloc; // statistics |
281 | extern ssize_t slice_alloc; // statistics |
226 | |
282 | |
227 | void *salloc_ (int n) throw (std::bad_alloc); |
283 | void *salloc_ (int n) throw (std::bad_alloc); |
228 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
284 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
229 | |
285 | |
… | |
… | |
373 | { |
429 | { |
374 | p->~Tp (); |
430 | p->~Tp (); |
375 | } |
431 | } |
376 | }; |
432 | }; |
377 | |
433 | |
378 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
|
|
379 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
|
|
380 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
381 | struct tausworthe_random_generator |
|
|
382 | { |
|
|
383 | // generator |
|
|
384 | uint32_t state [4]; |
|
|
385 | |
|
|
386 | void operator =(const tausworthe_random_generator &src) |
|
|
387 | { |
|
|
388 | state [0] = src.state [0]; |
|
|
389 | state [1] = src.state [1]; |
|
|
390 | state [2] = src.state [2]; |
|
|
391 | state [3] = src.state [3]; |
|
|
392 | } |
|
|
393 | |
|
|
394 | void seed (uint32_t seed); |
|
|
395 | uint32_t next (); |
|
|
396 | |
|
|
397 | // uniform distribution, 0 .. max (0, num - 1) |
|
|
398 | uint32_t operator ()(uint32_t num) |
|
|
399 | { |
|
|
400 | return is_constant (num) |
|
|
401 | ? (next () * (uint64_t)num) >> 32U |
|
|
402 | : get_range (num); |
|
|
403 | } |
|
|
404 | |
|
|
405 | // return a number within (min .. max) |
|
|
406 | int operator () (int r_min, int r_max) |
|
|
407 | { |
|
|
408 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
|
|
409 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
410 | : get_range (r_min, r_max); |
|
|
411 | } |
|
|
412 | |
|
|
413 | double operator ()() |
|
|
414 | { |
|
|
415 | return this->next () / (double)0xFFFFFFFFU; |
|
|
416 | } |
|
|
417 | |
|
|
418 | protected: |
|
|
419 | uint32_t get_range (uint32_t r_max); |
|
|
420 | int get_range (int r_min, int r_max); |
|
|
421 | }; |
|
|
422 | |
|
|
423 | typedef tausworthe_random_generator rand_gen; |
|
|
424 | |
|
|
425 | extern rand_gen rndm, rmg_rndm; |
|
|
426 | |
|
|
427 | INTERFACE_CLASS (attachable) |
434 | INTERFACE_CLASS (attachable) |
428 | struct refcnt_base |
435 | struct refcnt_base |
429 | { |
436 | { |
430 | typedef int refcnt_t; |
437 | typedef int refcnt_t; |
431 | mutable refcnt_t ACC (RW, refcnt); |
438 | mutable refcnt_t ACC (RW, refcnt); |
… | |
… | |
492 | typedef refptr<maptile> maptile_ptr; |
499 | typedef refptr<maptile> maptile_ptr; |
493 | typedef refptr<object> object_ptr; |
500 | typedef refptr<object> object_ptr; |
494 | typedef refptr<archetype> arch_ptr; |
501 | typedef refptr<archetype> arch_ptr; |
495 | typedef refptr<client> client_ptr; |
502 | typedef refptr<client> client_ptr; |
496 | typedef refptr<player> player_ptr; |
503 | typedef refptr<player> player_ptr; |
|
|
504 | typedef refptr<region> region_ptr; |
|
|
505 | |
|
|
506 | #define STRHSH_NULL 2166136261 |
|
|
507 | |
|
|
508 | static inline uint32_t |
|
|
509 | strhsh (const char *s) |
|
|
510 | { |
|
|
511 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
512 | // it is about twice as fast as the one-at-a-time one, |
|
|
513 | // with good distribution. |
|
|
514 | // FNV-1a is faster on many cpus because the multiplication |
|
|
515 | // runs concurrently with the looping logic. |
|
|
516 | uint32_t hash = STRHSH_NULL; |
|
|
517 | |
|
|
518 | while (*s) |
|
|
519 | hash = (hash ^ *s++) * 16777619U; |
|
|
520 | |
|
|
521 | return hash; |
|
|
522 | } |
|
|
523 | |
|
|
524 | static inline uint32_t |
|
|
525 | memhsh (const char *s, size_t len) |
|
|
526 | { |
|
|
527 | uint32_t hash = STRHSH_NULL; |
|
|
528 | |
|
|
529 | while (len--) |
|
|
530 | hash = (hash ^ *s++) * 16777619U; |
|
|
531 | |
|
|
532 | return hash; |
|
|
533 | } |
497 | |
534 | |
498 | struct str_hash |
535 | struct str_hash |
499 | { |
536 | { |
500 | std::size_t operator ()(const char *s) const |
537 | std::size_t operator ()(const char *s) const |
501 | { |
538 | { |
502 | unsigned long hash = 0; |
|
|
503 | |
|
|
504 | /* use the one-at-a-time hash function, which supposedly is |
|
|
505 | * better than the djb2-like one used by perl5.005, but |
|
|
506 | * certainly is better then the bug used here before. |
|
|
507 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
508 | */ |
|
|
509 | while (*s) |
|
|
510 | { |
|
|
511 | hash += *s++; |
|
|
512 | hash += hash << 10; |
|
|
513 | hash ^= hash >> 6; |
|
|
514 | } |
|
|
515 | |
|
|
516 | hash += hash << 3; |
|
|
517 | hash ^= hash >> 11; |
|
|
518 | hash += hash << 15; |
|
|
519 | |
|
|
520 | return hash; |
539 | return strhsh (s); |
|
|
540 | } |
|
|
541 | |
|
|
542 | std::size_t operator ()(const shstr &s) const |
|
|
543 | { |
|
|
544 | return strhsh (s); |
521 | } |
545 | } |
522 | }; |
546 | }; |
523 | |
547 | |
524 | struct str_equal |
548 | struct str_equal |
525 | { |
549 | { |
… | |
… | |
618 | erase (&obj); |
642 | erase (&obj); |
619 | } |
643 | } |
620 | }; |
644 | }; |
621 | |
645 | |
622 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
646 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
647 | // returns the number of bytes actually used (including \0) |
623 | void assign (char *dst, const char *src, int maxlen); |
648 | int assign (char *dst, const char *src, int maxsize); |
624 | |
649 | |
625 | // type-safe version of assign |
650 | // type-safe version of assign |
626 | template<int N> |
651 | template<int N> |
627 | inline void assign (char (&dst)[N], const char *src) |
652 | inline int assign (char (&dst)[N], const char *src) |
628 | { |
653 | { |
629 | assign ((char *)&dst, src, N); |
654 | return assign ((char *)&dst, src, N); |
630 | } |
655 | } |
631 | |
656 | |
632 | typedef double tstamp; |
657 | typedef double tstamp; |
633 | |
658 | |
634 | // return current time as timestamp |
659 | // return current time as timestamp |
635 | tstamp now (); |
660 | tstamp now (); |
636 | |
661 | |
637 | int similar_direction (int a, int b); |
662 | int similar_direction (int a, int b); |
638 | |
663 | |
639 | // like sprintf, but returns a "static" buffer |
664 | // like v?sprintf, but returns a "static" buffer |
640 | const char *format (const char *format, ...); |
665 | char *vformat (const char *format, va_list ap); |
|
|
666 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
|
|
667 | |
|
|
668 | // safety-check player input which will become object->msg |
|
|
669 | bool msg_is_safe (const char *msg); |
641 | |
670 | |
642 | ///////////////////////////////////////////////////////////////////////////// |
671 | ///////////////////////////////////////////////////////////////////////////// |
643 | // threads, very very thin wrappers around pthreads |
672 | // threads, very very thin wrappers around pthreads |
644 | |
673 | |
645 | struct thread |
674 | struct thread |