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 | # define noinline __attribute__((__noinline__)) |
|
|
34 | #else |
|
|
35 | # define is_constant(c) 0 |
|
|
36 | # define expect(expr,value) (expr) |
|
|
37 | # define prefetch(addr,rw,locality) |
|
|
38 | # define noinline |
|
|
39 | #endif |
|
|
40 | |
|
|
41 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
42 | # define decltype(x) typeof(x) |
|
|
43 | #endif |
|
|
44 | |
|
|
45 | // put into ifs if you are very sure that the expression |
|
|
46 | // is mostly true or mosty false. note that these return |
|
|
47 | // booleans, not the expression. |
|
|
48 | #define expect_false(expr) expect ((expr) ? 1 : 0, 0) |
|
|
49 | #define expect_true(expr) expect ((expr) ? 1 : 0, 1) |
|
|
50 | |
31 | |
51 | #include <pthread.h> |
32 | #include <pthread.h> |
52 | |
33 | |
53 | #include <cstddef> |
34 | #include <cstddef> |
54 | #include <cmath> |
35 | #include <cmath> |
… | |
… | |
205 | int32_t d = b - a; |
186 | int32_t d = b - a; |
206 | d &= d >> 31; |
187 | d &= d >> 31; |
207 | return b - d; |
188 | return b - d; |
208 | } |
189 | } |
209 | |
190 | |
210 | // this is much faster than crossfires original algorithm |
191 | // this is much faster than crossfire's original algorithm |
211 | // on modern cpus |
192 | // on modern cpus |
212 | inline int |
193 | inline int |
213 | isqrt (int n) |
194 | isqrt (int n) |
214 | { |
195 | { |
215 | 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; |
216 | } |
211 | } |
217 | |
212 | |
218 | // 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) |
219 | #if 0 |
214 | #if 0 |
220 | // 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. |
… | |
… | |
245 | absdir (int d) |
240 | absdir (int d) |
246 | { |
241 | { |
247 | return ((d - 1) & 7) + 1; |
242 | return ((d - 1) & 7) + 1; |
248 | } |
243 | } |
249 | |
244 | |
|
|
245 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
246 | #if GCC_VERSION(3,4) |
|
|
247 | static inline int least_significant_bit (uint32_t x) |
|
|
248 | { |
|
|
249 | return __builtin_ctz (x); |
|
|
250 | } |
|
|
251 | #else |
|
|
252 | int least_significant_bit (uint32_t x); |
|
|
253 | #endif |
|
|
254 | |
|
|
255 | #define for_all_bits_sparse_32(mask, idxvar) \ |
|
|
256 | for (uint32_t idxvar, mask_ = mask; \ |
|
|
257 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
|
|
258 | |
250 | extern ssize_t slice_alloc; // statistics |
259 | extern ssize_t slice_alloc; // statistics |
251 | |
260 | |
252 | void *salloc_ (int n) throw (std::bad_alloc); |
261 | void *salloc_ (int n) throw (std::bad_alloc); |
253 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
262 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
254 | |
263 | |
… | |
… | |
551 | typedef refptr<object> object_ptr; |
560 | typedef refptr<object> object_ptr; |
552 | typedef refptr<archetype> arch_ptr; |
561 | typedef refptr<archetype> arch_ptr; |
553 | typedef refptr<client> client_ptr; |
562 | typedef refptr<client> client_ptr; |
554 | typedef refptr<player> player_ptr; |
563 | typedef refptr<player> player_ptr; |
555 | |
564 | |
|
|
565 | #define STRHSH_NULL 2166136261 |
|
|
566 | |
|
|
567 | static inline uint32_t |
|
|
568 | strhsh (const char *s) |
|
|
569 | { |
|
|
570 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
571 | // it is about twice as fast as the one-at-a-time one, |
|
|
572 | // with good distribution. |
|
|
573 | // FNV-1a is faster on many cpus because the multiplication |
|
|
574 | // runs concurrently with the looping logic. |
|
|
575 | uint32_t hash = STRHSH_NULL; |
|
|
576 | |
|
|
577 | while (*s) |
|
|
578 | hash = (hash ^ *s++) * 16777619; |
|
|
579 | |
|
|
580 | return hash; |
|
|
581 | } |
|
|
582 | |
|
|
583 | static inline uint32_t |
|
|
584 | memhsh (const char *s, size_t len) |
|
|
585 | { |
|
|
586 | uint32_t hash = STRHSH_NULL; |
|
|
587 | |
|
|
588 | while (len--) |
|
|
589 | hash = (hash ^ *s++) * 16777619; |
|
|
590 | |
|
|
591 | return hash; |
|
|
592 | } |
|
|
593 | |
556 | struct str_hash |
594 | struct str_hash |
557 | { |
595 | { |
558 | std::size_t operator ()(const char *s) const |
596 | std::size_t operator ()(const char *s) const |
559 | { |
597 | { |
560 | #if 0 |
|
|
561 | uint32_t hash = 0; |
|
|
562 | |
|
|
563 | /* use the one-at-a-time hash function, which supposedly is |
|
|
564 | * better than the djb2-like one used by perl5.005, but |
|
|
565 | * certainly is better then the bug used here before. |
|
|
566 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
567 | */ |
|
|
568 | while (*s) |
|
|
569 | { |
|
|
570 | hash += *s++; |
|
|
571 | hash += hash << 10; |
|
|
572 | hash ^= hash >> 6; |
|
|
573 | } |
|
|
574 | |
|
|
575 | hash += hash << 3; |
|
|
576 | hash ^= hash >> 11; |
|
|
577 | hash += hash << 15; |
|
|
578 | #else |
|
|
579 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
580 | // it is about twice as fast as the one-at-a-time one, |
|
|
581 | // with good distribution. |
|
|
582 | // FNV-1a is faster on many cpus because the multiplication |
|
|
583 | // runs concurrent with the looping logic. |
|
|
584 | uint32_t hash = 2166136261; |
|
|
585 | |
|
|
586 | while (*s) |
|
|
587 | hash = (hash ^ *s++) * 16777619; |
|
|
588 | #endif |
|
|
589 | |
|
|
590 | return hash; |
598 | return strhsh (s); |
|
|
599 | } |
|
|
600 | |
|
|
601 | std::size_t operator ()(const shstr &s) const |
|
|
602 | { |
|
|
603 | return strhsh (s); |
591 | } |
604 | } |
592 | }; |
605 | }; |
593 | |
606 | |
594 | struct str_equal |
607 | struct str_equal |
595 | { |
608 | { |
… | |
… | |
705 | // return current time as timestamp |
718 | // return current time as timestamp |
706 | tstamp now (); |
719 | tstamp now (); |
707 | |
720 | |
708 | int similar_direction (int a, int b); |
721 | int similar_direction (int a, int b); |
709 | |
722 | |
710 | // like sprintf, but returns a "static" buffer |
723 | // like v?sprintf, but returns a "static" buffer |
711 | const char *format (const char *format, ...); |
724 | char *vformat (const char *format, va_list ap); |
|
|
725 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
|
|
726 | |
|
|
727 | // safety-check player input which will become object->msg |
|
|
728 | bool msg_is_safe (const char *msg); |
712 | |
729 | |
713 | ///////////////////////////////////////////////////////////////////////////// |
730 | ///////////////////////////////////////////////////////////////////////////// |
714 | // threads, very very thin wrappers around pthreads |
731 | // threads, very very thin wrappers around pthreads |
715 | |
732 | |
716 | struct thread |
733 | struct thread |