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,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 | |
25 | #define DEBUG_SALLOC 0 |
26 | #include <compiler.h> |
26 | #define PREFER_MALLOC 0 |
|
|
27 | |
27 | |
28 | #if __GNUC__ >= 3 |
28 | #define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 |
29 | # define is_constant(c) __builtin_constant_p (c) |
29 | #define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs |
30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
30 | #define PREFER_MALLOC 0 // use malloc and not the slice allocator |
31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
|
|
32 | #else |
|
|
33 | # define is_constant(c) 0 |
|
|
34 | # define expect(expr,value) (expr) |
|
|
35 | # define prefetch(addr,rw,locality) |
|
|
36 | #endif |
|
|
37 | |
|
|
38 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
39 | # define decltype(x) typeof(x) |
|
|
40 | #endif |
|
|
41 | |
|
|
42 | // put into ifs if you are very sure that the expression |
|
|
43 | // is mostly true or mosty false. note that these return |
|
|
44 | // booleans, not the expression. |
|
|
45 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
46 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
47 | |
31 | |
48 | #include <pthread.h> |
32 | #include <pthread.h> |
49 | |
33 | |
50 | #include <cstddef> |
34 | #include <cstddef> |
51 | #include <cmath> |
35 | #include <cmath> |
… | |
… | |
62 | # define g_slice_alloc(s) debug_slice_alloc(s) |
46 | # define g_slice_alloc(s) debug_slice_alloc(s) |
63 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
47 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
64 | void *g_slice_alloc (unsigned long size); |
48 | void *g_slice_alloc (unsigned long size); |
65 | void *g_slice_alloc0 (unsigned long size); |
49 | void *g_slice_alloc0 (unsigned long size); |
66 | void g_slice_free1 (unsigned long size, void *ptr); |
50 | void g_slice_free1 (unsigned long size, void *ptr); |
|
|
51 | #elif PREFER_MALLOC |
|
|
52 | # define g_slice_alloc0(s) calloc (1, (s)) |
|
|
53 | # define g_slice_alloc(s) malloc ((s)) |
|
|
54 | # define g_slice_free1(s,p) free ((p)) |
67 | #endif |
55 | #endif |
68 | |
56 | |
69 | // 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) |
70 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
71 | |
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 | |
72 | // very ugly macro that basicaly declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
73 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
74 | // 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 |
75 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
76 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
77 | #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) |
… | |
… | |
91 | // 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. |
92 | 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; } |
93 | 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; } |
94 | 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; } |
95 | |
94 | |
|
|
95 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
96 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
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); } |
|
|
98 | |
96 | 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; } |
97 | |
100 | |
98 | 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)); } |
99 | 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)); } |
100 | |
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 |
|
|
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
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 | |
|
|
132 | // div, round-up |
|
|
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 | } |
|
|
137 | // div, round-down |
|
|
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 | } |
|
|
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 |
101 | template<typename T> |
145 | template<typename T> |
102 | static inline T |
146 | static inline T |
103 | 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) |
104 | { |
148 | { |
105 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
149 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
150 | } |
|
|
151 | |
|
|
152 | // lerp, round-down |
|
|
153 | template<typename T> |
|
|
154 | static inline T |
|
|
155 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
156 | { |
|
|
157 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
158 | } |
|
|
159 | |
|
|
160 | // lerp, round-up |
|
|
161 | template<typename T> |
|
|
162 | static inline T |
|
|
163 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
164 | { |
|
|
165 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
106 | } |
166 | } |
107 | |
167 | |
108 | // lots of stuff taken from FXT |
168 | // lots of stuff taken from FXT |
109 | |
169 | |
110 | /* Rotate right. This is used in various places for checksumming */ |
170 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
148 | int32_t d = b - a; |
208 | int32_t d = b - a; |
149 | d &= d >> 31; |
209 | d &= d >> 31; |
150 | return b - d; |
210 | return b - d; |
151 | } |
211 | } |
152 | |
212 | |
153 | // this is much faster than crossfires original algorithm |
213 | // this is much faster than crossfire's original algorithm |
154 | // on modern cpus |
214 | // on modern cpus |
155 | inline int |
215 | inline int |
156 | isqrt (int n) |
216 | isqrt (int n) |
157 | { |
217 | { |
158 | 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; |
159 | } |
233 | } |
160 | |
234 | |
161 | // 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) |
162 | #if 0 |
236 | #if 0 |
163 | // 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. |
… | |
… | |
188 | absdir (int d) |
262 | absdir (int d) |
189 | { |
263 | { |
190 | return ((d - 1) & 7) + 1; |
264 | return ((d - 1) & 7) + 1; |
191 | } |
265 | } |
192 | |
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 | |
193 | extern size_t slice_alloc; // statistics |
281 | extern ssize_t slice_alloc; // statistics |
|
|
282 | |
|
|
283 | void *salloc_ (int n) throw (std::bad_alloc); |
|
|
284 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
|
|
285 | |
|
|
286 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
287 | template<typename T> |
|
|
288 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
289 | |
|
|
290 | // also copies src into the new area, like "memdup" |
|
|
291 | // if src is 0, clears the memory |
|
|
292 | template<typename T> |
|
|
293 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
294 | |
|
|
295 | // clears the memory |
|
|
296 | template<typename T> |
|
|
297 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
298 | |
|
|
299 | // for symmetry |
|
|
300 | template<typename T> |
|
|
301 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
302 | { |
|
|
303 | if (expect_true (ptr)) |
|
|
304 | { |
|
|
305 | slice_alloc -= n * sizeof (T); |
|
|
306 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
|
|
307 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
308 | assert (slice_alloc >= 0);//D |
|
|
309 | } |
|
|
310 | } |
|
|
311 | |
|
|
312 | // nulls the pointer |
|
|
313 | template<typename T> |
|
|
314 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
315 | { |
|
|
316 | sfree<T> (ptr, n); |
|
|
317 | ptr = 0; |
|
|
318 | } |
194 | |
319 | |
195 | // makes dynamically allocated objects zero-initialised |
320 | // makes dynamically allocated objects zero-initialised |
196 | struct zero_initialised |
321 | struct zero_initialised |
197 | { |
322 | { |
198 | void *operator new (size_t s, void *p) |
323 | void *operator new (size_t s, void *p) |
… | |
… | |
201 | return p; |
326 | return p; |
202 | } |
327 | } |
203 | |
328 | |
204 | void *operator new (size_t s) |
329 | void *operator new (size_t s) |
205 | { |
330 | { |
206 | slice_alloc += s; |
|
|
207 | return g_slice_alloc0 (s); |
331 | return salloc0<char> (s); |
208 | } |
332 | } |
209 | |
333 | |
210 | void *operator new[] (size_t s) |
334 | void *operator new[] (size_t s) |
211 | { |
335 | { |
212 | slice_alloc += s; |
|
|
213 | return g_slice_alloc0 (s); |
336 | return salloc0<char> (s); |
214 | } |
337 | } |
215 | |
338 | |
216 | void operator delete (void *p, size_t s) |
339 | void operator delete (void *p, size_t s) |
217 | { |
340 | { |
218 | slice_alloc -= s; |
341 | sfree ((char *)p, s); |
219 | g_slice_free1 (s, p); |
|
|
220 | } |
342 | } |
221 | |
343 | |
222 | void operator delete[] (void *p, size_t s) |
344 | void operator delete[] (void *p, size_t s) |
223 | { |
345 | { |
224 | slice_alloc -= s; |
346 | sfree ((char *)p, s); |
225 | g_slice_free1 (s, p); |
|
|
226 | } |
347 | } |
227 | }; |
348 | }; |
228 | |
349 | |
229 | void *salloc_ (int n) throw (std::bad_alloc); |
350 | // makes dynamically allocated objects zero-initialised |
230 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
351 | struct slice_allocated |
231 | |
|
|
232 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
233 | template<typename T> |
|
|
234 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
235 | |
|
|
236 | // also copies src into the new area, like "memdup" |
|
|
237 | // if src is 0, clears the memory |
|
|
238 | template<typename T> |
|
|
239 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
240 | |
|
|
241 | // clears the memory |
|
|
242 | template<typename T> |
|
|
243 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
244 | |
|
|
245 | // for symmetry |
|
|
246 | template<typename T> |
|
|
247 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
248 | { |
352 | { |
249 | #if PREFER_MALLOC |
353 | void *operator new (size_t s, void *p) |
250 | free (ptr); |
354 | { |
251 | #else |
355 | return p; |
252 | slice_alloc -= n * sizeof (T); |
356 | } |
253 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
357 | |
254 | #endif |
358 | void *operator new (size_t s) |
255 | } |
359 | { |
|
|
360 | return salloc<char> (s); |
|
|
361 | } |
|
|
362 | |
|
|
363 | void *operator new[] (size_t s) |
|
|
364 | { |
|
|
365 | return salloc<char> (s); |
|
|
366 | } |
|
|
367 | |
|
|
368 | void operator delete (void *p, size_t s) |
|
|
369 | { |
|
|
370 | sfree ((char *)p, s); |
|
|
371 | } |
|
|
372 | |
|
|
373 | void operator delete[] (void *p, size_t s) |
|
|
374 | { |
|
|
375 | sfree ((char *)p, s); |
|
|
376 | } |
|
|
377 | }; |
256 | |
378 | |
257 | // a STL-compatible allocator that uses g_slice |
379 | // a STL-compatible allocator that uses g_slice |
258 | // boy, this is verbose |
380 | // boy, this is verbose |
259 | template<typename Tp> |
381 | template<typename Tp> |
260 | struct slice_allocator |
382 | struct slice_allocator |
… | |
… | |
312 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
434 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
313 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
435 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
314 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
436 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
315 | struct tausworthe_random_generator |
437 | struct tausworthe_random_generator |
316 | { |
438 | { |
317 | // generator |
|
|
318 | uint32_t state [4]; |
439 | uint32_t state [4]; |
319 | |
440 | |
320 | void operator =(const tausworthe_random_generator &src) |
441 | void operator =(const tausworthe_random_generator &src) |
321 | { |
442 | { |
322 | state [0] = src.state [0]; |
443 | state [0] = src.state [0]; |
… | |
… | |
325 | state [3] = src.state [3]; |
446 | state [3] = src.state [3]; |
326 | } |
447 | } |
327 | |
448 | |
328 | void seed (uint32_t seed); |
449 | void seed (uint32_t seed); |
329 | uint32_t next (); |
450 | uint32_t next (); |
|
|
451 | }; |
330 | |
452 | |
|
|
453 | // Xorshift RNGs, George Marsaglia |
|
|
454 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
455 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
456 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
457 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
458 | struct xorshift_random_generator |
|
|
459 | { |
|
|
460 | uint32_t x, y; |
|
|
461 | |
|
|
462 | void operator =(const xorshift_random_generator &src) |
|
|
463 | { |
|
|
464 | x = src.x; |
|
|
465 | y = src.y; |
|
|
466 | } |
|
|
467 | |
|
|
468 | void seed (uint32_t seed) |
|
|
469 | { |
|
|
470 | x = seed; |
|
|
471 | y = seed * 69069U; |
|
|
472 | } |
|
|
473 | |
|
|
474 | uint32_t next () |
|
|
475 | { |
|
|
476 | uint32_t t = x ^ (x << 10); |
|
|
477 | x = y; |
|
|
478 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
479 | return y; |
|
|
480 | } |
|
|
481 | }; |
|
|
482 | |
|
|
483 | template<class generator> |
|
|
484 | struct random_number_generator : generator |
|
|
485 | { |
331 | // uniform distribution |
486 | // uniform distribution, [0 .. num - 1] |
332 | uint32_t operator ()(uint32_t num) |
487 | uint32_t operator ()(uint32_t num) |
333 | { |
488 | { |
334 | return is_constant (num) |
489 | return !is_constant (num) ? get_range (num) // non-constant |
335 | ? (next () * (uint64_t)num) >> 32U |
490 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
336 | : get_range (num); |
491 | : this->next () & (num - 1); // constant, power-of-two |
337 | } |
492 | } |
338 | |
493 | |
339 | // return a number within (min .. max) |
494 | // return a number within the closed interval [min .. max], max can be >, < or == min. |
340 | int operator () (int r_min, int r_max) |
495 | int operator () (int r_min, int r_max) |
341 | { |
496 | { |
342 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
497 | return is_constant (r_min <= r_max) && r_min <= r_max |
343 | ? r_min + operator ()(r_max - r_min + 1) |
498 | ? r_min + operator ()(r_max - r_min + 1) |
344 | : get_range (r_min, r_max); |
499 | : get_range (r_min, r_max); |
345 | } |
500 | } |
346 | |
501 | |
|
|
502 | // return a number within the half-open interval [0..1[ |
347 | double operator ()() |
503 | double operator ()() |
348 | { |
504 | { |
349 | return this->next () / (double)0xFFFFFFFFU; |
505 | return this->next () / (double)0x100000000ULL; |
350 | } |
506 | } |
351 | |
507 | |
352 | protected: |
508 | protected: |
353 | uint32_t get_range (uint32_t r_max); |
509 | uint32_t get_range (uint32_t r_max); |
354 | int get_range (int r_min, int r_max); |
510 | int get_range (int r_min, int r_max); |
355 | }; |
511 | }; |
356 | |
512 | |
357 | typedef tausworthe_random_generator rand_gen; |
513 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
358 | |
514 | |
359 | extern rand_gen rndm; |
515 | extern rand_gen rndm, rmg_rndm; |
360 | |
516 | |
361 | INTERFACE_CLASS (attachable) |
517 | INTERFACE_CLASS (attachable) |
362 | struct refcnt_base |
518 | struct refcnt_base |
363 | { |
519 | { |
364 | typedef int refcnt_t; |
520 | typedef int refcnt_t; |
… | |
… | |
426 | typedef refptr<maptile> maptile_ptr; |
582 | typedef refptr<maptile> maptile_ptr; |
427 | typedef refptr<object> object_ptr; |
583 | typedef refptr<object> object_ptr; |
428 | typedef refptr<archetype> arch_ptr; |
584 | typedef refptr<archetype> arch_ptr; |
429 | typedef refptr<client> client_ptr; |
585 | typedef refptr<client> client_ptr; |
430 | typedef refptr<player> player_ptr; |
586 | typedef refptr<player> player_ptr; |
|
|
587 | typedef refptr<region> region_ptr; |
|
|
588 | |
|
|
589 | #define STRHSH_NULL 2166136261 |
|
|
590 | |
|
|
591 | static inline uint32_t |
|
|
592 | strhsh (const char *s) |
|
|
593 | { |
|
|
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 concurrently with the looping logic. |
|
|
599 | uint32_t hash = STRHSH_NULL; |
|
|
600 | |
|
|
601 | while (*s) |
|
|
602 | hash = (hash ^ *s++) * 16777619U; |
|
|
603 | |
|
|
604 | return hash; |
|
|
605 | } |
|
|
606 | |
|
|
607 | static inline uint32_t |
|
|
608 | memhsh (const char *s, size_t len) |
|
|
609 | { |
|
|
610 | uint32_t hash = STRHSH_NULL; |
|
|
611 | |
|
|
612 | while (len--) |
|
|
613 | hash = (hash ^ *s++) * 16777619U; |
|
|
614 | |
|
|
615 | return hash; |
|
|
616 | } |
431 | |
617 | |
432 | struct str_hash |
618 | struct str_hash |
433 | { |
619 | { |
434 | std::size_t operator ()(const char *s) const |
620 | std::size_t operator ()(const char *s) const |
435 | { |
621 | { |
436 | unsigned long hash = 0; |
|
|
437 | |
|
|
438 | /* use the one-at-a-time hash function, which supposedly is |
|
|
439 | * better than the djb2-like one used by perl5.005, but |
|
|
440 | * certainly is better then the bug used here before. |
|
|
441 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
442 | */ |
|
|
443 | while (*s) |
|
|
444 | { |
|
|
445 | hash += *s++; |
|
|
446 | hash += hash << 10; |
|
|
447 | hash ^= hash >> 6; |
|
|
448 | } |
|
|
449 | |
|
|
450 | hash += hash << 3; |
|
|
451 | hash ^= hash >> 11; |
|
|
452 | hash += hash << 15; |
|
|
453 | |
|
|
454 | return hash; |
622 | return strhsh (s); |
|
|
623 | } |
|
|
624 | |
|
|
625 | std::size_t operator ()(const shstr &s) const |
|
|
626 | { |
|
|
627 | return strhsh (s); |
455 | } |
628 | } |
456 | }; |
629 | }; |
457 | |
630 | |
458 | struct str_equal |
631 | struct str_equal |
459 | { |
632 | { |
… | |
… | |
552 | erase (&obj); |
725 | erase (&obj); |
553 | } |
726 | } |
554 | }; |
727 | }; |
555 | |
728 | |
556 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
729 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
730 | // returns the number of bytes actually used (including \0) |
557 | void assign (char *dst, const char *src, int maxlen); |
731 | int assign (char *dst, const char *src, int maxsize); |
558 | |
732 | |
559 | // type-safe version of assign |
733 | // type-safe version of assign |
560 | template<int N> |
734 | template<int N> |
561 | inline void assign (char (&dst)[N], const char *src) |
735 | inline int assign (char (&dst)[N], const char *src) |
562 | { |
736 | { |
563 | assign ((char *)&dst, src, N); |
737 | return assign ((char *)&dst, src, N); |
564 | } |
738 | } |
565 | |
739 | |
566 | typedef double tstamp; |
740 | typedef double tstamp; |
567 | |
741 | |
568 | // return current time as timestamp |
742 | // return current time as timestamp |
569 | tstamp now (); |
743 | tstamp now (); |
570 | |
744 | |
571 | int similar_direction (int a, int b); |
745 | int similar_direction (int a, int b); |
572 | |
746 | |
573 | // like sprintf, but returns a "static" buffer |
747 | // like v?sprintf, but returns a "static" buffer |
574 | const char *format (const char *format, ...); |
748 | char *vformat (const char *format, va_list ap); |
|
|
749 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
|
|
750 | |
|
|
751 | // safety-check player input which will become object->msg |
|
|
752 | bool msg_is_safe (const char *msg); |
575 | |
753 | |
576 | ///////////////////////////////////////////////////////////////////////////// |
754 | ///////////////////////////////////////////////////////////////////////////// |
577 | // threads, very very thin wrappers around pthreads |
755 | // threads, very very thin wrappers around pthreads |
578 | |
756 | |
579 | struct thread |
757 | struct thread |
… | |
… | |
606 | #else |
784 | #else |
607 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
785 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
608 | #endif |
786 | #endif |
609 | |
787 | |
610 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
788 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
611 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
789 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
612 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
790 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
613 | |
791 | |
|
|
792 | typedef pthread_cond_t scond; |
|
|
793 | |
|
|
794 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
795 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
796 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
797 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
798 | |
614 | #endif |
799 | #endif |
615 | |
800 | |