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__ |
… | |
… | |
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 |
… | |
… | |
116 | |
119 | |
117 | // sign0 returns -1, 0 or +1 |
120 | // sign0 returns -1, 0 or +1 |
118 | template<typename T> |
121 | template<typename T> |
119 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
122 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
120 | |
123 | |
|
|
124 | // div* only work correctly for div > 0 |
121 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
125 | // 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; } |
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 | } |
123 | // div, round-up |
130 | // div, round-up |
124 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
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 | } |
125 | // div, round-down |
135 | // div, round-down |
126 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
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 | } |
127 | |
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 |
128 | template<typename T> |
143 | template<typename T> |
129 | static inline T |
144 | static inline T |
130 | 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) |
131 | { |
146 | { |
132 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
147 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
… | |
… | |
407 | |
422 | |
408 | // Xorshift RNGs, George Marsaglia |
423 | // Xorshift RNGs, George Marsaglia |
409 | // http://www.jstatsoft.org/v08/i14/paper |
424 | // http://www.jstatsoft.org/v08/i14/paper |
410 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
425 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
411 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
426 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
427 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
412 | struct xorshift_random_generator |
428 | struct xorshift_random_generator |
413 | { |
429 | { |
414 | uint32_t x, y; |
430 | uint32_t x, y; |
415 | |
431 | |
416 | void operator =(const xorshift_random_generator &src) |
432 | void operator =(const xorshift_random_generator &src) |
… | |
… | |
673 | erase (&obj); |
689 | erase (&obj); |
674 | } |
690 | } |
675 | }; |
691 | }; |
676 | |
692 | |
677 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
693 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
694 | // returns the number of bytes actually used (including \0) |
678 | void assign (char *dst, const char *src, int maxlen); |
695 | int assign (char *dst, const char *src, int maxsize); |
679 | |
696 | |
680 | // type-safe version of assign |
697 | // type-safe version of assign |
681 | template<int N> |
698 | template<int N> |
682 | inline void assign (char (&dst)[N], const char *src) |
699 | inline int assign (char (&dst)[N], const char *src) |
683 | { |
700 | { |
684 | assign ((char *)&dst, src, N); |
701 | return assign ((char *)&dst, src, N); |
685 | } |
702 | } |
686 | |
703 | |
687 | typedef double tstamp; |
704 | typedef double tstamp; |
688 | |
705 | |
689 | // return current time as timestamp |
706 | // return current time as timestamp |
… | |
… | |
691 | |
708 | |
692 | int similar_direction (int a, int b); |
709 | int similar_direction (int a, int b); |
693 | |
710 | |
694 | // like sprintf, but returns a "static" buffer |
711 | // like sprintf, but returns a "static" buffer |
695 | const char *format (const char *format, ...); |
712 | const char *format (const char *format, ...); |
|
|
713 | |
|
|
714 | // safety-check player input which will become object->msg |
|
|
715 | bool msg_is_safe (const char *msg); |
696 | |
716 | |
697 | ///////////////////////////////////////////////////////////////////////////// |
717 | ///////////////////////////////////////////////////////////////////////////// |
698 | // threads, very very thin wrappers around pthreads |
718 | // threads, very very thin wrappers around pthreads |
699 | |
719 | |
700 | struct thread |
720 | struct thread |