1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * under the terms of the GNU General Public License as published by the Free |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * any later version. |
9 | * option) any later version. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, but |
11 | * This program is distributed in the hope that it will be useful, |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * 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 along |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
18 | * <http://www.gnu.org/licenses/>. |
19 | * |
19 | * |
20 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
21 | */ |
22 | |
22 | |
23 | #ifndef UTIL_H__ |
23 | #ifndef UTIL_H__ |
24 | #define UTIL_H__ |
24 | #define UTIL_H__ |
25 | |
25 | |
26 | //#define PREFER_MALLOC |
26 | #include <compiler.h> |
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 | |
31 | |
38 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
32 | #include <pthread.h> |
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 | |
33 | |
48 | #include <cstddef> |
34 | #include <cstddef> |
49 | #include <cmath> |
35 | #include <cmath> |
50 | #include <new> |
36 | #include <new> |
51 | #include <vector> |
37 | #include <vector> |
… | |
… | |
53 | #include <glib.h> |
39 | #include <glib.h> |
54 | |
40 | |
55 | #include <shstr.h> |
41 | #include <shstr.h> |
56 | #include <traits.h> |
42 | #include <traits.h> |
57 | |
43 | |
|
|
44 | #if DEBUG_SALLOC |
|
|
45 | # define g_slice_alloc0(s) debug_slice_alloc0(s) |
|
|
46 | # define g_slice_alloc(s) debug_slice_alloc(s) |
|
|
47 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
|
|
48 | void *g_slice_alloc (unsigned long size); |
|
|
49 | void *g_slice_alloc0 (unsigned long size); |
|
|
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)) |
|
|
55 | #endif |
|
|
56 | |
58 | // 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) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
60 | |
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 | |
61 | // very ugly macro that basicaly declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
62 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
63 | // 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 |
64 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
65 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
66 | #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) |
… | |
… | |
71 | |
81 | |
72 | // in range excluding end |
82 | // in range excluding end |
73 | #define IN_RANGE_EXC(val,beg,end) \ |
83 | #define IN_RANGE_EXC(val,beg,end) \ |
74 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
84 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
75 | |
85 | |
|
|
86 | void cleanup (const char *cause, bool make_core = false); |
76 | void fork_abort (const char *msg); |
87 | void fork_abort (const char *msg); |
77 | |
88 | |
78 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
89 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
79 | // 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. |
80 | 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; } |
81 | 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; } |
82 | 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; } |
83 | |
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 | |
84 | 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; } |
85 | |
100 | |
|
|
101 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (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)); } |
|
|
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 |
86 | template<typename T> |
145 | template<typename T> |
87 | static inline T |
146 | static inline T |
88 | 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) |
89 | { |
148 | { |
90 | 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); |
91 | } |
166 | } |
92 | |
167 | |
93 | // lots of stuff taken from FXT |
168 | // lots of stuff taken from FXT |
94 | |
169 | |
95 | /* Rotate right. This is used in various places for checksumming */ |
170 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
133 | int32_t d = b - a; |
208 | int32_t d = b - a; |
134 | d &= d >> 31; |
209 | d &= d >> 31; |
135 | return b - d; |
210 | return b - d; |
136 | } |
211 | } |
137 | |
212 | |
138 | // this is much faster than crossfires original algorithm |
213 | // this is much faster than crossfire's original algorithm |
139 | // on modern cpus |
214 | // on modern cpus |
140 | inline int |
215 | inline int |
141 | isqrt (int n) |
216 | isqrt (int n) |
142 | { |
217 | { |
143 | 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; |
144 | } |
233 | } |
145 | |
234 | |
146 | // 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) |
147 | #if 0 |
236 | #if 0 |
148 | // 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. |
… | |
… | |
173 | absdir (int d) |
262 | absdir (int d) |
174 | { |
263 | { |
175 | return ((d - 1) & 7) + 1; |
264 | return ((d - 1) & 7) + 1; |
176 | } |
265 | } |
177 | |
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 | |
|
|
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 | } |
|
|
319 | |
178 | // makes dynamically allocated objects zero-initialised |
320 | // makes dynamically allocated objects zero-initialised |
179 | struct zero_initialised |
321 | struct zero_initialised |
180 | { |
322 | { |
181 | void *operator new (size_t s, void *p) |
323 | void *operator new (size_t s, void *p) |
182 | { |
324 | { |
… | |
… | |
184 | return p; |
326 | return p; |
185 | } |
327 | } |
186 | |
328 | |
187 | void *operator new (size_t s) |
329 | void *operator new (size_t s) |
188 | { |
330 | { |
189 | return g_slice_alloc0 (s); |
331 | return salloc0<char> (s); |
190 | } |
332 | } |
191 | |
333 | |
192 | void *operator new[] (size_t s) |
334 | void *operator new[] (size_t s) |
193 | { |
335 | { |
194 | return g_slice_alloc0 (s); |
336 | return salloc0<char> (s); |
195 | } |
337 | } |
196 | |
338 | |
197 | void operator delete (void *p, size_t s) |
339 | void operator delete (void *p, size_t s) |
198 | { |
340 | { |
199 | g_slice_free1 (s, p); |
341 | sfree ((char *)p, s); |
200 | } |
342 | } |
201 | |
343 | |
202 | void operator delete[] (void *p, size_t s) |
344 | void operator delete[] (void *p, size_t s) |
203 | { |
345 | { |
204 | g_slice_free1 (s, p); |
346 | sfree ((char *)p, s); |
205 | } |
347 | } |
206 | }; |
348 | }; |
207 | |
349 | |
208 | void *salloc_ (int n) throw (std::bad_alloc); |
350 | // makes dynamically allocated objects zero-initialised |
209 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
351 | struct slice_allocated |
210 | |
|
|
211 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
212 | template<typename T> |
|
|
213 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
214 | |
|
|
215 | // also copies src into the new area, like "memdup" |
|
|
216 | // if src is 0, clears the memory |
|
|
217 | template<typename T> |
|
|
218 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
219 | |
|
|
220 | // clears the memory |
|
|
221 | template<typename T> |
|
|
222 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
223 | |
|
|
224 | // for symmetry |
|
|
225 | template<typename T> |
|
|
226 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
227 | { |
352 | { |
228 | #ifdef PREFER_MALLOC |
353 | void *operator new (size_t s, void *p) |
229 | free (ptr); |
354 | { |
230 | #else |
355 | return p; |
231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
356 | } |
232 | #endif |
357 | |
233 | } |
358 | void *operator new (size_t s) |
|
|
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 | }; |
234 | |
378 | |
235 | // a STL-compatible allocator that uses g_slice |
379 | // a STL-compatible allocator that uses g_slice |
236 | // boy, this is verbose |
380 | // boy, this is verbose |
237 | template<typename Tp> |
381 | template<typename Tp> |
238 | struct slice_allocator |
382 | struct slice_allocator |
… | |
… | |
250 | { |
394 | { |
251 | typedef slice_allocator<U> other; |
395 | typedef slice_allocator<U> other; |
252 | }; |
396 | }; |
253 | |
397 | |
254 | slice_allocator () throw () { } |
398 | slice_allocator () throw () { } |
255 | slice_allocator (const slice_allocator &o) throw () { } |
399 | slice_allocator (const slice_allocator &) throw () { } |
256 | template<typename Tp2> |
400 | template<typename Tp2> |
257 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
401 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
258 | |
402 | |
259 | ~slice_allocator () { } |
403 | ~slice_allocator () { } |
260 | |
404 | |
… | |
… | |
269 | void deallocate (pointer p, size_type n) |
413 | void deallocate (pointer p, size_type n) |
270 | { |
414 | { |
271 | sfree<Tp> (p, n); |
415 | sfree<Tp> (p, n); |
272 | } |
416 | } |
273 | |
417 | |
274 | size_type max_size ()const throw () |
418 | size_type max_size () const throw () |
275 | { |
419 | { |
276 | return size_t (-1) / sizeof (Tp); |
420 | return size_t (-1) / sizeof (Tp); |
277 | } |
421 | } |
278 | |
422 | |
279 | void construct (pointer p, const Tp &val) |
423 | void construct (pointer p, const Tp &val) |
… | |
… | |
285 | { |
429 | { |
286 | p->~Tp (); |
430 | p->~Tp (); |
287 | } |
431 | } |
288 | }; |
432 | }; |
289 | |
433 | |
290 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
434 | INTERFACE_CLASS (attachable) |
291 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
435 | struct refcnt_base |
292 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
293 | struct tausworthe_random_generator |
|
|
294 | { |
436 | { |
295 | // generator |
437 | typedef int refcnt_t; |
296 | uint32_t state [4]; |
438 | mutable refcnt_t ACC (RW, refcnt); |
297 | |
439 | |
298 | void operator =(const tausworthe_random_generator &src) |
440 | MTH void refcnt_inc () const { ++refcnt; } |
299 | { |
441 | MTH void refcnt_dec () const { --refcnt; } |
300 | state [0] = src.state [0]; |
|
|
301 | state [1] = src.state [1]; |
|
|
302 | state [2] = src.state [2]; |
|
|
303 | state [3] = src.state [3]; |
|
|
304 | } |
|
|
305 | |
442 | |
306 | void seed (uint32_t seed); |
443 | refcnt_base () : refcnt (0) { } |
307 | uint32_t next (); |
|
|
308 | |
|
|
309 | // uniform distribution |
|
|
310 | uint32_t operator ()(uint32_t num) |
|
|
311 | { |
|
|
312 | return is_constant (num) |
|
|
313 | ? (next () * (uint64_t)num) >> 32U |
|
|
314 | : get_range (num); |
|
|
315 | } |
|
|
316 | |
|
|
317 | // return a number within (min .. max) |
|
|
318 | int operator () (int r_min, int r_max) |
|
|
319 | { |
|
|
320 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
|
|
321 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
322 | : get_range (r_min, r_max); |
|
|
323 | } |
|
|
324 | |
|
|
325 | double operator ()() |
|
|
326 | { |
|
|
327 | return this->next () / (double)0xFFFFFFFFU; |
|
|
328 | } |
|
|
329 | |
|
|
330 | protected: |
|
|
331 | uint32_t get_range (uint32_t r_max); |
|
|
332 | int get_range (int r_min, int r_max); |
|
|
333 | }; |
444 | }; |
334 | |
445 | |
335 | typedef tausworthe_random_generator rand_gen; |
446 | // to avoid branches with more advanced compilers |
336 | |
447 | extern refcnt_base::refcnt_t refcnt_dummy; |
337 | extern rand_gen rndm; |
|
|
338 | |
448 | |
339 | template<class T> |
449 | template<class T> |
340 | struct refptr |
450 | struct refptr |
341 | { |
451 | { |
|
|
452 | // p if not null |
|
|
453 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
454 | |
|
|
455 | void refcnt_dec () |
|
|
456 | { |
|
|
457 | if (!is_constant (p)) |
|
|
458 | --*refcnt_ref (); |
|
|
459 | else if (p) |
|
|
460 | --p->refcnt; |
|
|
461 | } |
|
|
462 | |
|
|
463 | void refcnt_inc () |
|
|
464 | { |
|
|
465 | if (!is_constant (p)) |
|
|
466 | ++*refcnt_ref (); |
|
|
467 | else if (p) |
|
|
468 | ++p->refcnt; |
|
|
469 | } |
|
|
470 | |
342 | T *p; |
471 | T *p; |
343 | |
472 | |
344 | refptr () : p(0) { } |
473 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
474 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
475 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
476 | ~refptr () { refcnt_dec (); } |
348 | |
477 | |
349 | const refptr<T> &operator =(T *o) |
478 | const refptr<T> &operator =(T *o) |
350 | { |
479 | { |
|
|
480 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
481 | refcnt_dec (); |
352 | p = o; |
482 | p = o; |
353 | if (p) p->refcnt_inc (); |
483 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
484 | return *this; |
356 | } |
485 | } |
357 | |
486 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
487 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
488 | { |
360 | *this = o.p; |
489 | *this = o.p; |
361 | return *this; |
490 | return *this; |
362 | } |
491 | } |
363 | |
492 | |
364 | T &operator * () const { return *p; } |
493 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
494 | T *operator ->() const { return p; } |
366 | |
495 | |
367 | operator T *() const { return p; } |
496 | operator T *() const { return p; } |
368 | }; |
497 | }; |
369 | |
498 | |
370 | typedef refptr<maptile> maptile_ptr; |
499 | typedef refptr<maptile> maptile_ptr; |
371 | typedef refptr<object> object_ptr; |
500 | typedef refptr<object> object_ptr; |
372 | typedef refptr<archetype> arch_ptr; |
501 | typedef refptr<archetype> arch_ptr; |
373 | typedef refptr<client> client_ptr; |
502 | typedef refptr<client> client_ptr; |
374 | typedef refptr<player> player_ptr; |
503 | typedef refptr<player> player_ptr; |
|
|
504 | typedef refptr<region> region_ptr; |
|
|
505 | |
|
|
506 | #define STRHSH_NULL 2166136261 |
|
|
507 | |
|
|
508 | static inline uint32_t |
|
|
509 | strhsh (const char *s) |
|
|
510 | { |
|
|
511 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
512 | // it is about twice as fast as the one-at-a-time one, |
|
|
513 | // with good distribution. |
|
|
514 | // FNV-1a is faster on many cpus because the multiplication |
|
|
515 | // runs concurrently with the looping logic. |
|
|
516 | uint32_t hash = STRHSH_NULL; |
|
|
517 | |
|
|
518 | while (*s) |
|
|
519 | hash = (hash ^ *s++) * 16777619U; |
|
|
520 | |
|
|
521 | return hash; |
|
|
522 | } |
|
|
523 | |
|
|
524 | static inline uint32_t |
|
|
525 | memhsh (const char *s, size_t len) |
|
|
526 | { |
|
|
527 | uint32_t hash = STRHSH_NULL; |
|
|
528 | |
|
|
529 | while (len--) |
|
|
530 | hash = (hash ^ *s++) * 16777619U; |
|
|
531 | |
|
|
532 | return hash; |
|
|
533 | } |
375 | |
534 | |
376 | struct str_hash |
535 | struct str_hash |
377 | { |
536 | { |
378 | std::size_t operator ()(const char *s) const |
537 | std::size_t operator ()(const char *s) const |
379 | { |
538 | { |
380 | unsigned long hash = 0; |
|
|
381 | |
|
|
382 | /* use the one-at-a-time hash function, which supposedly is |
|
|
383 | * better than the djb2-like one used by perl5.005, but |
|
|
384 | * certainly is better then the bug used here before. |
|
|
385 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
386 | */ |
|
|
387 | while (*s) |
|
|
388 | { |
|
|
389 | hash += *s++; |
|
|
390 | hash += hash << 10; |
|
|
391 | hash ^= hash >> 6; |
|
|
392 | } |
|
|
393 | |
|
|
394 | hash += hash << 3; |
|
|
395 | hash ^= hash >> 11; |
|
|
396 | hash += hash << 15; |
|
|
397 | |
|
|
398 | return hash; |
539 | return strhsh (s); |
|
|
540 | } |
|
|
541 | |
|
|
542 | std::size_t operator ()(const shstr &s) const |
|
|
543 | { |
|
|
544 | return strhsh (s); |
399 | } |
545 | } |
400 | }; |
546 | }; |
401 | |
547 | |
402 | struct str_equal |
548 | struct str_equal |
403 | { |
549 | { |
… | |
… | |
406 | return !strcmp (a, b); |
552 | return !strcmp (a, b); |
407 | } |
553 | } |
408 | }; |
554 | }; |
409 | |
555 | |
410 | // Mostly the same as std::vector, but insert/erase can reorder |
556 | // Mostly the same as std::vector, but insert/erase can reorder |
411 | // the elements, making insret/remove O(1) instead of O(n). |
557 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
412 | // |
558 | // |
413 | // NOTE: only some forms of erase/insert are available |
559 | // NOTE: only some forms of erase are available |
414 | template<class T> |
560 | template<class T> |
415 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
561 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
416 | { |
562 | { |
417 | typedef typename unordered_vector::iterator iterator; |
563 | typedef typename unordered_vector::iterator iterator; |
418 | |
564 | |
… | |
… | |
440 | // + free unique (but varying) id for inserted objects |
586 | // + free unique (but varying) id for inserted objects |
441 | // + cache-friendly iteration |
587 | // + cache-friendly iteration |
442 | // - only works for pointers to structs |
588 | // - only works for pointers to structs |
443 | // |
589 | // |
444 | // NOTE: only some forms of erase/insert are available |
590 | // NOTE: only some forms of erase/insert are available |
445 | template<class T, int T::* index> |
591 | typedef int object_vector_index; |
|
|
592 | |
|
|
593 | template<class T, object_vector_index T::*indexmember> |
446 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
594 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
447 | { |
595 | { |
448 | typedef typename object_vector::iterator iterator; |
596 | typedef typename object_vector::iterator iterator; |
449 | |
597 | |
450 | bool contains (const T *obj) const |
598 | bool contains (const T *obj) const |
451 | { |
599 | { |
452 | return obj->*index; |
600 | return obj->*indexmember; |
453 | } |
601 | } |
454 | |
602 | |
455 | iterator find (const T *obj) |
603 | iterator find (const T *obj) |
456 | { |
604 | { |
457 | return obj->*index |
605 | return obj->*indexmember |
458 | ? this->begin () + obj->*index - 1 |
606 | ? this->begin () + obj->*indexmember - 1 |
459 | : this->end (); |
607 | : this->end (); |
460 | } |
608 | } |
461 | |
609 | |
|
|
610 | void push_back (T *obj) |
|
|
611 | { |
|
|
612 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
613 | obj->*indexmember = this->size (); |
|
|
614 | } |
|
|
615 | |
462 | void insert (T *obj) |
616 | void insert (T *obj) |
463 | { |
617 | { |
464 | push_back (obj); |
618 | push_back (obj); |
465 | obj->*index = this->size (); |
|
|
466 | } |
619 | } |
467 | |
620 | |
468 | void insert (T &obj) |
621 | void insert (T &obj) |
469 | { |
622 | { |
470 | insert (&obj); |
623 | insert (&obj); |
471 | } |
624 | } |
472 | |
625 | |
473 | void erase (T *obj) |
626 | void erase (T *obj) |
474 | { |
627 | { |
475 | unsigned int pos = obj->*index; |
628 | unsigned int pos = obj->*indexmember; |
476 | obj->*index = 0; |
629 | obj->*indexmember = 0; |
477 | |
630 | |
478 | if (pos < this->size ()) |
631 | if (pos < this->size ()) |
479 | { |
632 | { |
480 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
633 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
481 | (*this)[pos - 1]->*index = pos; |
634 | (*this)[pos - 1]->*indexmember = pos; |
482 | } |
635 | } |
483 | |
636 | |
484 | this->pop_back (); |
637 | this->pop_back (); |
485 | } |
638 | } |
486 | |
639 | |
487 | void erase (T &obj) |
640 | void erase (T &obj) |
488 | { |
641 | { |
489 | errase (&obj); |
642 | erase (&obj); |
490 | } |
643 | } |
491 | }; |
644 | }; |
492 | |
645 | |
493 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
646 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
647 | // returns the number of bytes actually used (including \0) |
494 | void assign (char *dst, const char *src, int maxlen); |
648 | int assign (char *dst, const char *src, int maxsize); |
495 | |
649 | |
496 | // type-safe version of assign |
650 | // type-safe version of assign |
497 | template<int N> |
651 | template<int N> |
498 | inline void assign (char (&dst)[N], const char *src) |
652 | inline int assign (char (&dst)[N], const char *src) |
499 | { |
653 | { |
500 | assign ((char *)&dst, src, N); |
654 | return assign ((char *)&dst, src, N); |
501 | } |
655 | } |
502 | |
656 | |
503 | typedef double tstamp; |
657 | typedef double tstamp; |
504 | |
658 | |
505 | // return current time as timestampe |
659 | // return current time as timestamp |
506 | tstamp now (); |
660 | tstamp now (); |
507 | |
661 | |
508 | int similar_direction (int a, int b); |
662 | int similar_direction (int a, int b); |
509 | |
663 | |
510 | // like printf, but returns a std::string |
664 | // like v?sprintf, but returns a "static" buffer |
511 | const std::string format (const char *format, ...); |
665 | char *vformat (const char *format, va_list ap); |
|
|
666 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
512 | |
667 | |
|
|
668 | // safety-check player input which will become object->msg |
|
|
669 | bool msg_is_safe (const char *msg); |
|
|
670 | |
|
|
671 | ///////////////////////////////////////////////////////////////////////////// |
|
|
672 | // threads, very very thin wrappers around pthreads |
|
|
673 | |
|
|
674 | struct thread |
|
|
675 | { |
|
|
676 | pthread_t id; |
|
|
677 | |
|
|
678 | void start (void *(*start_routine)(void *), void *arg = 0); |
|
|
679 | |
|
|
680 | void cancel () |
|
|
681 | { |
|
|
682 | pthread_cancel (id); |
|
|
683 | } |
|
|
684 | |
|
|
685 | void *join () |
|
|
686 | { |
|
|
687 | void *ret; |
|
|
688 | |
|
|
689 | if (pthread_join (id, &ret)) |
|
|
690 | cleanup ("pthread_join failed", 1); |
|
|
691 | |
|
|
692 | return ret; |
|
|
693 | } |
|
|
694 | }; |
|
|
695 | |
|
|
696 | // note that mutexes are not classes |
|
|
697 | typedef pthread_mutex_t smutex; |
|
|
698 | |
|
|
699 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
|
|
700 | #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
|
|
701 | #else |
|
|
702 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
513 | #endif |
703 | #endif |
514 | |
704 | |
|
|
705 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
|
|
706 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
|
|
707 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
|
|
708 | |
|
|
709 | typedef pthread_cond_t scond; |
|
|
710 | |
|
|
711 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
712 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
713 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
714 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
715 | |
|
|
716 | #endif |
|
|
717 | |