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 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__ |
… | |
… | |
28 | |
29 | |
29 | #if __GNUC__ >= 3 |
30 | #if __GNUC__ >= 3 |
30 | # define is_constant(c) __builtin_constant_p (c) |
31 | # define is_constant(c) __builtin_constant_p (c) |
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
32 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
33 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
|
|
34 | # define noinline __attribute__((__noinline__)) |
33 | #else |
35 | #else |
34 | # define is_constant(c) 0 |
36 | # define is_constant(c) 0 |
35 | # define expect(expr,value) (expr) |
37 | # define expect(expr,value) (expr) |
36 | # define prefetch(addr,rw,locality) |
38 | # define prefetch(addr,rw,locality) |
|
|
39 | # define noinline |
37 | #endif |
40 | #endif |
38 | |
41 | |
39 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
42 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
40 | # define decltype(x) typeof(x) |
43 | # define decltype(x) typeof(x) |
41 | #endif |
44 | #endif |
42 | |
45 | |
43 | // put into ifs if you are very sure that the expression |
46 | // put into ifs if you are very sure that the expression |
44 | // is mostly true or mosty false. note that these return |
47 | // is mostly true or mosty false. note that these return |
45 | // booleans, not the expression. |
48 | // booleans, not the expression. |
46 | #define expect_false(expr) expect ((expr) != 0, 0) |
49 | #define expect_false(expr) expect ((expr) ? 1 : 0, 0) |
47 | #define expect_true(expr) expect ((expr) != 0, 1) |
50 | #define expect_true(expr) expect ((expr) ? 1 : 0, 1) |
48 | |
51 | |
49 | #include <pthread.h> |
52 | #include <pthread.h> |
50 | |
53 | |
51 | #include <cstddef> |
54 | #include <cstddef> |
52 | #include <cmath> |
55 | #include <cmath> |
… | |
… | |
72 | #endif |
75 | #endif |
73 | |
76 | |
74 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
77 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
78 | #define auto(var,expr) decltype(expr) var = (expr) |
76 | |
79 | |
77 | // very ugly macro that basicaly declares and initialises a variable |
80 | // very ugly macro that basically declares and initialises a variable |
78 | // that is in scope for the next statement only |
81 | // that is in scope for the next statement only |
79 | // works only for stuff that can be assigned 0 and converts to false |
82 | // works only for stuff that can be assigned 0 and converts to false |
80 | // (note: works great for pointers) |
83 | // (note: works great for pointers) |
81 | // most ugly macro I ever wrote |
84 | // most ugly macro I ever wrote |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
85 | #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. |
99 | // 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; } |
100 | 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; } |
101 | 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; } |
102 | 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 | |
103 | |
|
|
104 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
105 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
106 | 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); } |
|
|
107 | |
101 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
108 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
102 | |
109 | |
103 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
110 | 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)); } |
111 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
105 | |
112 | |
|
|
113 | // sign returns -1 or +1 |
|
|
114 | template<typename T> |
|
|
115 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
116 | // relies on 2c representation |
|
|
117 | template<> |
|
|
118 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
119 | |
|
|
120 | // sign0 returns -1, 0 or +1 |
|
|
121 | template<typename T> |
|
|
122 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
123 | |
|
|
124 | // div* only work correctly for div > 0 |
|
|
125 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
126 | template<typename T> static inline T div (T val, T div) |
|
|
127 | { |
|
|
128 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
129 | } |
|
|
130 | // div, round-up |
|
|
131 | template<typename T> static inline T div_ru (T val, T div) |
|
|
132 | { |
|
|
133 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
134 | } |
|
|
135 | // div, round-down |
|
|
136 | template<typename T> static inline T div_rd (T val, T div) |
|
|
137 | { |
|
|
138 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
139 | } |
|
|
140 | |
|
|
141 | // lerp* only work correctly for min_in < max_in |
|
|
142 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
106 | template<typename T> |
143 | template<typename T> |
107 | static inline T |
144 | static inline T |
108 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
145 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
109 | { |
146 | { |
110 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
147 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
148 | } |
|
|
149 | |
|
|
150 | // lerp, round-down |
|
|
151 | template<typename T> |
|
|
152 | static inline T |
|
|
153 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
154 | { |
|
|
155 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
156 | } |
|
|
157 | |
|
|
158 | // lerp, round-up |
|
|
159 | template<typename T> |
|
|
160 | static inline T |
|
|
161 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
162 | { |
|
|
163 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
111 | } |
164 | } |
112 | |
165 | |
113 | // lots of stuff taken from FXT |
166 | // lots of stuff taken from FXT |
114 | |
167 | |
115 | /* Rotate right. This is used in various places for checksumming */ |
168 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
159 | // on modern cpus |
212 | // on modern cpus |
160 | inline int |
213 | inline int |
161 | isqrt (int n) |
214 | isqrt (int n) |
162 | { |
215 | { |
163 | return (int)sqrtf ((float)n); |
216 | return (int)sqrtf ((float)n); |
|
|
217 | } |
|
|
218 | |
|
|
219 | // this is kind of like the ^^ operator, if it would exist, without sequence point. |
|
|
220 | // more handy than it looks like, due to the implicit !! done on its arguments |
|
|
221 | inline bool |
|
|
222 | logical_xor (bool a, bool b) |
|
|
223 | { |
|
|
224 | return a != b; |
|
|
225 | } |
|
|
226 | |
|
|
227 | inline bool |
|
|
228 | logical_implies (bool a, bool b) |
|
|
229 | { |
|
|
230 | return a <= b; |
164 | } |
231 | } |
165 | |
232 | |
166 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
233 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
167 | #if 0 |
234 | #if 0 |
168 | // and has a max. error of 6 in the range -100..+100. |
235 | // and has a max. error of 6 in the range -100..+100. |
… | |
… | |
224 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
291 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
225 | assert (slice_alloc >= 0);//D |
292 | assert (slice_alloc >= 0);//D |
226 | } |
293 | } |
227 | } |
294 | } |
228 | |
295 | |
|
|
296 | // nulls the pointer |
|
|
297 | template<typename T> |
|
|
298 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
299 | { |
|
|
300 | sfree<T> (ptr, n); |
|
|
301 | ptr = 0; |
|
|
302 | } |
|
|
303 | |
229 | // makes dynamically allocated objects zero-initialised |
304 | // makes dynamically allocated objects zero-initialised |
230 | struct zero_initialised |
305 | struct zero_initialised |
231 | { |
306 | { |
232 | void *operator new (size_t s, void *p) |
307 | void *operator new (size_t s, void *p) |
233 | { |
308 | { |
… | |
… | |
241 | } |
316 | } |
242 | |
317 | |
243 | void *operator new[] (size_t s) |
318 | void *operator new[] (size_t s) |
244 | { |
319 | { |
245 | return salloc0<char> (s); |
320 | return salloc0<char> (s); |
|
|
321 | } |
|
|
322 | |
|
|
323 | void operator delete (void *p, size_t s) |
|
|
324 | { |
|
|
325 | sfree ((char *)p, s); |
|
|
326 | } |
|
|
327 | |
|
|
328 | void operator delete[] (void *p, size_t s) |
|
|
329 | { |
|
|
330 | sfree ((char *)p, s); |
|
|
331 | } |
|
|
332 | }; |
|
|
333 | |
|
|
334 | // makes dynamically allocated objects zero-initialised |
|
|
335 | struct slice_allocated |
|
|
336 | { |
|
|
337 | void *operator new (size_t s, void *p) |
|
|
338 | { |
|
|
339 | return p; |
|
|
340 | } |
|
|
341 | |
|
|
342 | void *operator new (size_t s) |
|
|
343 | { |
|
|
344 | return salloc<char> (s); |
|
|
345 | } |
|
|
346 | |
|
|
347 | void *operator new[] (size_t s) |
|
|
348 | { |
|
|
349 | return salloc<char> (s); |
246 | } |
350 | } |
247 | |
351 | |
248 | void operator delete (void *p, size_t s) |
352 | void operator delete (void *p, size_t s) |
249 | { |
353 | { |
250 | sfree ((char *)p, s); |
354 | sfree ((char *)p, s); |
… | |
… | |
314 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
418 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
315 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
419 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
316 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
420 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
317 | struct tausworthe_random_generator |
421 | struct tausworthe_random_generator |
318 | { |
422 | { |
319 | // generator |
|
|
320 | uint32_t state [4]; |
423 | uint32_t state [4]; |
321 | |
424 | |
322 | void operator =(const tausworthe_random_generator &src) |
425 | void operator =(const tausworthe_random_generator &src) |
323 | { |
426 | { |
324 | state [0] = src.state [0]; |
427 | state [0] = src.state [0]; |
… | |
… | |
327 | state [3] = src.state [3]; |
430 | state [3] = src.state [3]; |
328 | } |
431 | } |
329 | |
432 | |
330 | void seed (uint32_t seed); |
433 | void seed (uint32_t seed); |
331 | uint32_t next (); |
434 | uint32_t next (); |
|
|
435 | }; |
332 | |
436 | |
333 | // uniform distribution |
437 | // Xorshift RNGs, George Marsaglia |
|
|
438 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
439 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
440 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
441 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
442 | struct xorshift_random_generator |
|
|
443 | { |
|
|
444 | uint32_t x, y; |
|
|
445 | |
|
|
446 | void operator =(const xorshift_random_generator &src) |
|
|
447 | { |
|
|
448 | x = src.x; |
|
|
449 | y = src.y; |
|
|
450 | } |
|
|
451 | |
|
|
452 | void seed (uint32_t seed) |
|
|
453 | { |
|
|
454 | x = seed; |
|
|
455 | y = seed * 69069U; |
|
|
456 | } |
|
|
457 | |
|
|
458 | uint32_t next () |
|
|
459 | { |
|
|
460 | uint32_t t = x ^ (x << 10); |
|
|
461 | x = y; |
|
|
462 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
463 | return y; |
|
|
464 | } |
|
|
465 | }; |
|
|
466 | |
|
|
467 | template<class generator> |
|
|
468 | struct random_number_generator : generator |
|
|
469 | { |
|
|
470 | // uniform distribution, 0 .. max (0, num - 1) |
334 | uint32_t operator ()(uint32_t num) |
471 | uint32_t operator ()(uint32_t num) |
335 | { |
472 | { |
336 | return is_constant (num) |
473 | return !is_constant (num) ? get_range (num) // non-constant |
337 | ? (next () * (uint64_t)num) >> 32U |
474 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
338 | : get_range (num); |
475 | : this->next () & (num - 1); // constant, power-of-two |
339 | } |
476 | } |
340 | |
477 | |
341 | // return a number within (min .. max) |
478 | // return a number within (min .. max) |
342 | int operator () (int r_min, int r_max) |
479 | int operator () (int r_min, int r_max) |
343 | { |
480 | { |
… | |
… | |
354 | protected: |
491 | protected: |
355 | uint32_t get_range (uint32_t r_max); |
492 | uint32_t get_range (uint32_t r_max); |
356 | int get_range (int r_min, int r_max); |
493 | int get_range (int r_min, int r_max); |
357 | }; |
494 | }; |
358 | |
495 | |
359 | typedef tausworthe_random_generator rand_gen; |
496 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
360 | |
497 | |
361 | extern rand_gen rndm; |
498 | extern rand_gen rndm, rmg_rndm; |
362 | |
499 | |
363 | INTERFACE_CLASS (attachable) |
500 | INTERFACE_CLASS (attachable) |
364 | struct refcnt_base |
501 | struct refcnt_base |
365 | { |
502 | { |
366 | typedef int refcnt_t; |
503 | typedef int refcnt_t; |
… | |
… | |
433 | |
570 | |
434 | struct str_hash |
571 | struct str_hash |
435 | { |
572 | { |
436 | std::size_t operator ()(const char *s) const |
573 | std::size_t operator ()(const char *s) const |
437 | { |
574 | { |
438 | unsigned long hash = 0; |
575 | #if 0 |
|
|
576 | uint32_t hash = 0; |
439 | |
577 | |
440 | /* use the one-at-a-time hash function, which supposedly is |
578 | /* use the one-at-a-time hash function, which supposedly is |
441 | * better than the djb2-like one used by perl5.005, but |
579 | * better than the djb2-like one used by perl5.005, but |
442 | * certainly is better then the bug used here before. |
580 | * certainly is better then the bug used here before. |
443 | * see http://burtleburtle.net/bob/hash/doobs.html |
581 | * see http://burtleburtle.net/bob/hash/doobs.html |
… | |
… | |
450 | } |
588 | } |
451 | |
589 | |
452 | hash += hash << 3; |
590 | hash += hash << 3; |
453 | hash ^= hash >> 11; |
591 | hash ^= hash >> 11; |
454 | hash += hash << 15; |
592 | hash += hash << 15; |
|
|
593 | #else |
|
|
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 concurrent with the looping logic. |
|
|
599 | uint32_t hash = 2166136261; |
|
|
600 | |
|
|
601 | while (*s) |
|
|
602 | hash = (hash ^ *s++) * 16777619; |
|
|
603 | #endif |
455 | |
604 | |
456 | return hash; |
605 | return hash; |
457 | } |
606 | } |
458 | }; |
607 | }; |
459 | |
608 | |
… | |
… | |
554 | erase (&obj); |
703 | erase (&obj); |
555 | } |
704 | } |
556 | }; |
705 | }; |
557 | |
706 | |
558 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
707 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
708 | // returns the number of bytes actually used (including \0) |
559 | void assign (char *dst, const char *src, int maxlen); |
709 | int assign (char *dst, const char *src, int maxsize); |
560 | |
710 | |
561 | // type-safe version of assign |
711 | // type-safe version of assign |
562 | template<int N> |
712 | template<int N> |
563 | inline void assign (char (&dst)[N], const char *src) |
713 | inline int assign (char (&dst)[N], const char *src) |
564 | { |
714 | { |
565 | assign ((char *)&dst, src, N); |
715 | return assign ((char *)&dst, src, N); |
566 | } |
716 | } |
567 | |
717 | |
568 | typedef double tstamp; |
718 | typedef double tstamp; |
569 | |
719 | |
570 | // return current time as timestamp |
720 | // return current time as timestamp |
571 | tstamp now (); |
721 | tstamp now (); |
572 | |
722 | |
573 | int similar_direction (int a, int b); |
723 | int similar_direction (int a, int b); |
574 | |
724 | |
575 | // like sprintf, but returns a "static" buffer |
725 | // like v?sprintf, but returns a "static" buffer |
|
|
726 | char *vformat (const char *format, va_list ap); |
576 | const char *format (const char *format, ...); |
727 | char *format (const char *format, ...); |
|
|
728 | |
|
|
729 | // safety-check player input which will become object->msg |
|
|
730 | bool msg_is_safe (const char *msg); |
577 | |
731 | |
578 | ///////////////////////////////////////////////////////////////////////////// |
732 | ///////////////////////////////////////////////////////////////////////////// |
579 | // threads, very very thin wrappers around pthreads |
733 | // threads, very very thin wrappers around pthreads |
580 | |
734 | |
581 | struct thread |
735 | struct thread |