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 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> |
… | |
… | |
116 | |
99 | |
117 | // sign0 returns -1, 0 or +1 |
100 | // sign0 returns -1, 0 or +1 |
118 | template<typename T> |
101 | template<typename T> |
119 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
102 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
120 | |
103 | |
|
|
104 | // div* only work correctly for div > 0 |
121 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
105 | // 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; } |
106 | template<typename T> static inline T div (T val, T div) |
|
|
107 | { |
|
|
108 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
109 | } |
123 | // div, round-up |
110 | // div, round-up |
124 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
111 | template<typename T> static inline T div_ru (T val, T div) |
|
|
112 | { |
|
|
113 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
114 | } |
125 | // div, round-down |
115 | // div, round-down |
126 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
116 | template<typename T> static inline T div_rd (T val, T div) |
|
|
117 | { |
|
|
118 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
119 | } |
127 | |
120 | |
|
|
121 | // lerp* only work correctly for min_in < max_in |
|
|
122 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
128 | template<typename T> |
123 | template<typename T> |
129 | static inline T |
124 | static inline T |
130 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
125 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
131 | { |
126 | { |
132 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
127 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
… | |
… | |
197 | // on modern cpus |
192 | // on modern cpus |
198 | inline int |
193 | inline int |
199 | isqrt (int n) |
194 | isqrt (int n) |
200 | { |
195 | { |
201 | return (int)sqrtf ((float)n); |
196 | return (int)sqrtf ((float)n); |
|
|
197 | } |
|
|
198 | |
|
|
199 | // this is kind of like the ^^ operator, if it would exist, without sequence point. |
|
|
200 | // more handy than it looks like, due to the implicit !! done on its arguments |
|
|
201 | inline bool |
|
|
202 | logical_xor (bool a, bool b) |
|
|
203 | { |
|
|
204 | return a != b; |
|
|
205 | } |
|
|
206 | |
|
|
207 | inline bool |
|
|
208 | logical_implies (bool a, bool b) |
|
|
209 | { |
|
|
210 | return a <= b; |
202 | } |
211 | } |
203 | |
212 | |
204 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
213 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
205 | #if 0 |
214 | #if 0 |
206 | // and has a max. error of 6 in the range -100..+100. |
215 | // and has a max. error of 6 in the range -100..+100. |
… | |
… | |
389 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
398 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
390 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
399 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
391 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
400 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
392 | struct tausworthe_random_generator |
401 | struct tausworthe_random_generator |
393 | { |
402 | { |
394 | // generator |
|
|
395 | uint32_t state [4]; |
403 | uint32_t state [4]; |
396 | |
404 | |
397 | void operator =(const tausworthe_random_generator &src) |
405 | void operator =(const tausworthe_random_generator &src) |
398 | { |
406 | { |
399 | state [0] = src.state [0]; |
407 | state [0] = src.state [0]; |
… | |
… | |
402 | state [3] = src.state [3]; |
410 | state [3] = src.state [3]; |
403 | } |
411 | } |
404 | |
412 | |
405 | void seed (uint32_t seed); |
413 | void seed (uint32_t seed); |
406 | uint32_t next (); |
414 | uint32_t next (); |
|
|
415 | }; |
407 | |
416 | |
|
|
417 | // Xorshift RNGs, George Marsaglia |
|
|
418 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
419 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
420 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
421 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
422 | struct xorshift_random_generator |
|
|
423 | { |
|
|
424 | uint32_t x, y; |
|
|
425 | |
|
|
426 | void operator =(const xorshift_random_generator &src) |
|
|
427 | { |
|
|
428 | x = src.x; |
|
|
429 | y = src.y; |
|
|
430 | } |
|
|
431 | |
|
|
432 | void seed (uint32_t seed) |
|
|
433 | { |
|
|
434 | x = seed; |
|
|
435 | y = seed * 69069U; |
|
|
436 | } |
|
|
437 | |
|
|
438 | uint32_t next () |
|
|
439 | { |
|
|
440 | uint32_t t = x ^ (x << 10); |
|
|
441 | x = y; |
|
|
442 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
443 | return y; |
|
|
444 | } |
|
|
445 | }; |
|
|
446 | |
|
|
447 | template<class generator> |
|
|
448 | struct random_number_generator : generator |
|
|
449 | { |
408 | // uniform distribution, 0 .. max (0, num - 1) |
450 | // uniform distribution, 0 .. max (0, num - 1) |
409 | uint32_t operator ()(uint32_t num) |
451 | uint32_t operator ()(uint32_t num) |
410 | { |
452 | { |
411 | return !is_constant (num) ? get_range (num) // non-constant |
453 | return !is_constant (num) ? get_range (num) // non-constant |
412 | : num & (num - 1) ? (next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
454 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
413 | : next () & (num - 1); // constant, power-of-two |
455 | : this->next () & (num - 1); // constant, power-of-two |
414 | } |
456 | } |
415 | |
457 | |
416 | // return a number within (min .. max) |
458 | // return a number within (min .. max) |
417 | int operator () (int r_min, int r_max) |
459 | int operator () (int r_min, int r_max) |
418 | { |
460 | { |
… | |
… | |
429 | protected: |
471 | protected: |
430 | uint32_t get_range (uint32_t r_max); |
472 | uint32_t get_range (uint32_t r_max); |
431 | int get_range (int r_min, int r_max); |
473 | int get_range (int r_min, int r_max); |
432 | }; |
474 | }; |
433 | |
475 | |
434 | typedef tausworthe_random_generator rand_gen; |
476 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
435 | |
477 | |
436 | extern rand_gen rndm, rmg_rndm; |
478 | extern rand_gen rndm, rmg_rndm; |
437 | |
479 | |
438 | INTERFACE_CLASS (attachable) |
480 | INTERFACE_CLASS (attachable) |
439 | struct refcnt_base |
481 | struct refcnt_base |
… | |
… | |
508 | |
550 | |
509 | struct str_hash |
551 | struct str_hash |
510 | { |
552 | { |
511 | std::size_t operator ()(const char *s) const |
553 | std::size_t operator ()(const char *s) const |
512 | { |
554 | { |
513 | unsigned long hash = 0; |
555 | #if 0 |
|
|
556 | uint32_t hash = 0; |
514 | |
557 | |
515 | /* use the one-at-a-time hash function, which supposedly is |
558 | /* use the one-at-a-time hash function, which supposedly is |
516 | * better than the djb2-like one used by perl5.005, but |
559 | * better than the djb2-like one used by perl5.005, but |
517 | * certainly is better then the bug used here before. |
560 | * certainly is better then the bug used here before. |
518 | * see http://burtleburtle.net/bob/hash/doobs.html |
561 | * see http://burtleburtle.net/bob/hash/doobs.html |
… | |
… | |
525 | } |
568 | } |
526 | |
569 | |
527 | hash += hash << 3; |
570 | hash += hash << 3; |
528 | hash ^= hash >> 11; |
571 | hash ^= hash >> 11; |
529 | hash += hash << 15; |
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 |
530 | |
584 | |
531 | return hash; |
585 | return hash; |
532 | } |
586 | } |
533 | }; |
587 | }; |
534 | |
588 | |
… | |
… | |
629 | erase (&obj); |
683 | erase (&obj); |
630 | } |
684 | } |
631 | }; |
685 | }; |
632 | |
686 | |
633 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
687 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
688 | // returns the number of bytes actually used (including \0) |
634 | void assign (char *dst, const char *src, int maxlen); |
689 | int assign (char *dst, const char *src, int maxsize); |
635 | |
690 | |
636 | // type-safe version of assign |
691 | // type-safe version of assign |
637 | template<int N> |
692 | template<int N> |
638 | inline void assign (char (&dst)[N], const char *src) |
693 | inline int assign (char (&dst)[N], const char *src) |
639 | { |
694 | { |
640 | assign ((char *)&dst, src, N); |
695 | return assign ((char *)&dst, src, N); |
641 | } |
696 | } |
642 | |
697 | |
643 | typedef double tstamp; |
698 | typedef double tstamp; |
644 | |
699 | |
645 | // return current time as timestamp |
700 | // return current time as timestamp |
646 | tstamp now (); |
701 | tstamp now (); |
647 | |
702 | |
648 | int similar_direction (int a, int b); |
703 | int similar_direction (int a, int b); |
649 | |
704 | |
650 | // like sprintf, but returns a "static" buffer |
705 | // like v?sprintf, but returns a "static" buffer |
651 | const char *format (const char *format, ...); |
706 | char *vformat (const char *format, va_list ap); |
|
|
707 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
|
|
708 | |
|
|
709 | // safety-check player input which will become object->msg |
|
|
710 | bool msg_is_safe (const char *msg); |
652 | |
711 | |
653 | ///////////////////////////////////////////////////////////////////////////// |
712 | ///////////////////////////////////////////////////////////////////////////// |
654 | // threads, very very thin wrappers around pthreads |
713 | // threads, very very thin wrappers around pthreads |
655 | |
714 | |
656 | struct thread |
715 | struct thread |