| 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 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 |
| 7 | * under the terms of the GNU General Public License as published by the Free |
7 | * it under the terms of the GNU General Public License as published by |
| 8 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * the Free Software Foundation, either version 3 of the License, or |
| 9 | * any later version. |
9 | * (at your 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 GNU General Public License |
| 17 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 18 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
| 19 | * |
18 | * |
| 20 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 21 | */ |
20 | */ |
| 22 | |
21 | |
| 23 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
| 24 | #define UTIL_H__ |
23 | #define UTIL_H__ |
| 25 | |
24 | |
| 26 | //#define PREFER_MALLOC |
25 | #define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 |
|
|
26 | #define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs |
|
|
27 | #define PREFER_MALLOC 0 // use malloc and not the slice allocator |
| 27 | |
28 | |
| 28 | #if __GNUC__ >= 3 |
29 | #if __GNUC__ >= 3 |
| 29 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define is_constant(c) __builtin_constant_p (c) |
| 30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
| 31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
| … | |
… | |
| 43 | // is mostly true or mosty false. note that these return |
44 | // is mostly true or mosty false. note that these return |
| 44 | // booleans, not the expression. |
45 | // booleans, not the expression. |
| 45 | #define expect_false(expr) expect ((expr) != 0, 0) |
46 | #define expect_false(expr) expect ((expr) != 0, 0) |
| 46 | #define expect_true(expr) expect ((expr) != 0, 1) |
47 | #define expect_true(expr) expect ((expr) != 0, 1) |
| 47 | |
48 | |
|
|
49 | #include <pthread.h> |
|
|
50 | |
| 48 | #include <cstddef> |
51 | #include <cstddef> |
| 49 | #include <cmath> |
52 | #include <cmath> |
| 50 | #include <new> |
53 | #include <new> |
| 51 | #include <vector> |
54 | #include <vector> |
| 52 | |
55 | |
| 53 | #include <glib.h> |
56 | #include <glib.h> |
| 54 | |
57 | |
| 55 | #include <shstr.h> |
58 | #include <shstr.h> |
| 56 | #include <traits.h> |
59 | #include <traits.h> |
| 57 | |
60 | |
|
|
61 | #if DEBUG_SALLOC |
|
|
62 | # define g_slice_alloc0(s) debug_slice_alloc0(s) |
|
|
63 | # define g_slice_alloc(s) debug_slice_alloc(s) |
|
|
64 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
|
|
65 | void *g_slice_alloc (unsigned long size); |
|
|
66 | void *g_slice_alloc0 (unsigned long size); |
|
|
67 | void g_slice_free1 (unsigned long size, void *ptr); |
|
|
68 | #elif PREFER_MALLOC |
|
|
69 | # define g_slice_alloc0(s) calloc (1, (s)) |
|
|
70 | # define g_slice_alloc(s) malloc ((s)) |
|
|
71 | # define g_slice_free1(s,p) free ((p)) |
|
|
72 | #endif |
|
|
73 | |
| 58 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
74 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
| 59 | #define auto(var,expr) decltype(expr) var = (expr) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
| 60 | |
76 | |
| 61 | // very ugly macro that basicaly declares and initialises a variable |
77 | // very ugly macro that basically declares and initialises a variable |
| 62 | // that is in scope for the next statement only |
78 | // that is in scope for the next statement only |
| 63 | // works only for stuff that can be assigned 0 and converts to false |
79 | // works only for stuff that can be assigned 0 and converts to false |
| 64 | // (note: works great for pointers) |
80 | // (note: works great for pointers) |
| 65 | // most ugly macro I ever wrote |
81 | // most ugly macro I ever wrote |
| 66 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
| … | |
… | |
| 71 | |
87 | |
| 72 | // in range excluding end |
88 | // in range excluding end |
| 73 | #define IN_RANGE_EXC(val,beg,end) \ |
89 | #define IN_RANGE_EXC(val,beg,end) \ |
| 74 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
90 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
| 75 | |
91 | |
|
|
92 | void cleanup (const char *cause, bool make_core = false); |
| 76 | void fork_abort (const char *msg); |
93 | void fork_abort (const char *msg); |
| 77 | |
94 | |
| 78 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
95 | // 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. |
96 | // 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; } |
97 | 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; } |
98 | 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; } |
99 | 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 | |
100 | |
|
|
101 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
102 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
103 | 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); } |
|
|
104 | |
| 84 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
105 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
106 | |
|
|
107 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
|
|
108 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
|
|
109 | |
|
|
110 | // sign returns -1 or +1 |
|
|
111 | template<typename T> |
|
|
112 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
113 | // relies on 2c representation |
|
|
114 | template<> |
|
|
115 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
116 | |
|
|
117 | // sign0 returns -1, 0 or +1 |
|
|
118 | template<typename T> |
|
|
119 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
120 | |
|
|
121 | // 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; } |
|
|
123 | // div, round-up |
|
|
124 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
|
|
125 | // div, round-down |
|
|
126 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
| 85 | |
127 | |
| 86 | template<typename T> |
128 | template<typename T> |
| 87 | static inline T |
129 | static inline T |
| 88 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
130 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
| 89 | { |
131 | { |
| 90 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
132 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
133 | } |
|
|
134 | |
|
|
135 | // lerp, round-down |
|
|
136 | template<typename T> |
|
|
137 | static inline T |
|
|
138 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
139 | { |
|
|
140 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
141 | } |
|
|
142 | |
|
|
143 | // lerp, round-up |
|
|
144 | template<typename T> |
|
|
145 | static inline T |
|
|
146 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
147 | { |
|
|
148 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
| 91 | } |
149 | } |
| 92 | |
150 | |
| 93 | // lots of stuff taken from FXT |
151 | // lots of stuff taken from FXT |
| 94 | |
152 | |
| 95 | /* Rotate right. This is used in various places for checksumming */ |
153 | /* Rotate right. This is used in various places for checksumming */ |
| … | |
… | |
| 173 | absdir (int d) |
231 | absdir (int d) |
| 174 | { |
232 | { |
| 175 | return ((d - 1) & 7) + 1; |
233 | return ((d - 1) & 7) + 1; |
| 176 | } |
234 | } |
| 177 | |
235 | |
|
|
236 | extern ssize_t slice_alloc; // statistics |
|
|
237 | |
|
|
238 | void *salloc_ (int n) throw (std::bad_alloc); |
|
|
239 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
|
|
240 | |
|
|
241 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
242 | template<typename T> |
|
|
243 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
244 | |
|
|
245 | // also copies src into the new area, like "memdup" |
|
|
246 | // if src is 0, clears the memory |
|
|
247 | template<typename T> |
|
|
248 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
249 | |
|
|
250 | // clears the memory |
|
|
251 | template<typename T> |
|
|
252 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
253 | |
|
|
254 | // for symmetry |
|
|
255 | template<typename T> |
|
|
256 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
257 | { |
|
|
258 | if (expect_true (ptr)) |
|
|
259 | { |
|
|
260 | slice_alloc -= n * sizeof (T); |
|
|
261 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
|
|
262 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
263 | assert (slice_alloc >= 0);//D |
|
|
264 | } |
|
|
265 | } |
|
|
266 | |
|
|
267 | // nulls the pointer |
|
|
268 | template<typename T> |
|
|
269 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
270 | { |
|
|
271 | sfree<T> (ptr, n); |
|
|
272 | ptr = 0; |
|
|
273 | } |
|
|
274 | |
| 178 | // makes dynamically allocated objects zero-initialised |
275 | // makes dynamically allocated objects zero-initialised |
| 179 | struct zero_initialised |
276 | struct zero_initialised |
| 180 | { |
277 | { |
| 181 | void *operator new (size_t s, void *p) |
278 | void *operator new (size_t s, void *p) |
| 182 | { |
279 | { |
| … | |
… | |
| 184 | return p; |
281 | return p; |
| 185 | } |
282 | } |
| 186 | |
283 | |
| 187 | void *operator new (size_t s) |
284 | void *operator new (size_t s) |
| 188 | { |
285 | { |
| 189 | return g_slice_alloc0 (s); |
286 | return salloc0<char> (s); |
| 190 | } |
287 | } |
| 191 | |
288 | |
| 192 | void *operator new[] (size_t s) |
289 | void *operator new[] (size_t s) |
| 193 | { |
290 | { |
| 194 | return g_slice_alloc0 (s); |
291 | return salloc0<char> (s); |
| 195 | } |
292 | } |
| 196 | |
293 | |
| 197 | void operator delete (void *p, size_t s) |
294 | void operator delete (void *p, size_t s) |
| 198 | { |
295 | { |
| 199 | g_slice_free1 (s, p); |
296 | sfree ((char *)p, s); |
| 200 | } |
297 | } |
| 201 | |
298 | |
| 202 | void operator delete[] (void *p, size_t s) |
299 | void operator delete[] (void *p, size_t s) |
| 203 | { |
300 | { |
| 204 | g_slice_free1 (s, p); |
301 | sfree ((char *)p, s); |
| 205 | } |
302 | } |
| 206 | }; |
303 | }; |
| 207 | |
304 | |
| 208 | void *salloc_ (int n) throw (std::bad_alloc); |
305 | // makes dynamically allocated objects zero-initialised |
| 209 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
306 | 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 | { |
307 | { |
| 228 | #ifdef PREFER_MALLOC |
308 | void *operator new (size_t s, void *p) |
| 229 | free (ptr); |
309 | { |
| 230 | #else |
310 | return p; |
| 231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
311 | } |
| 232 | #endif |
312 | |
| 233 | } |
313 | void *operator new (size_t s) |
|
|
314 | { |
|
|
315 | return salloc<char> (s); |
|
|
316 | } |
|
|
317 | |
|
|
318 | void *operator new[] (size_t s) |
|
|
319 | { |
|
|
320 | return salloc<char> (s); |
|
|
321 | } |
|
|
322 | |
|
|
323 | void operator delete (void *p, size_t s) |
|
|
324 | { |
|
|
325 | sfree ((char *)p, s); |
|
|
326 | } |
|
|
327 | |
|
|
328 | void operator delete[] (void *p, size_t s) |
|
|
329 | { |
|
|
330 | sfree ((char *)p, s); |
|
|
331 | } |
|
|
332 | }; |
| 234 | |
333 | |
| 235 | // a STL-compatible allocator that uses g_slice |
334 | // a STL-compatible allocator that uses g_slice |
| 236 | // boy, this is verbose |
335 | // boy, this is verbose |
| 237 | template<typename Tp> |
336 | template<typename Tp> |
| 238 | struct slice_allocator |
337 | struct slice_allocator |
| … | |
… | |
| 250 | { |
349 | { |
| 251 | typedef slice_allocator<U> other; |
350 | typedef slice_allocator<U> other; |
| 252 | }; |
351 | }; |
| 253 | |
352 | |
| 254 | slice_allocator () throw () { } |
353 | slice_allocator () throw () { } |
| 255 | slice_allocator (const slice_allocator &o) throw () { } |
354 | slice_allocator (const slice_allocator &) throw () { } |
| 256 | template<typename Tp2> |
355 | template<typename Tp2> |
| 257 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
356 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
| 258 | |
357 | |
| 259 | ~slice_allocator () { } |
358 | ~slice_allocator () { } |
| 260 | |
359 | |
| … | |
… | |
| 269 | void deallocate (pointer p, size_type n) |
368 | void deallocate (pointer p, size_type n) |
| 270 | { |
369 | { |
| 271 | sfree<Tp> (p, n); |
370 | sfree<Tp> (p, n); |
| 272 | } |
371 | } |
| 273 | |
372 | |
| 274 | size_type max_size ()const throw () |
373 | size_type max_size () const throw () |
| 275 | { |
374 | { |
| 276 | return size_t (-1) / sizeof (Tp); |
375 | return size_t (-1) / sizeof (Tp); |
| 277 | } |
376 | } |
| 278 | |
377 | |
| 279 | void construct (pointer p, const Tp &val) |
378 | void construct (pointer p, const Tp &val) |
| … | |
… | |
| 290 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
389 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
| 291 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
390 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
| 292 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
391 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
| 293 | struct tausworthe_random_generator |
392 | struct tausworthe_random_generator |
| 294 | { |
393 | { |
| 295 | // generator |
|
|
| 296 | uint32_t state [4]; |
394 | uint32_t state [4]; |
| 297 | |
395 | |
| 298 | void operator =(const tausworthe_random_generator &src) |
396 | void operator =(const tausworthe_random_generator &src) |
| 299 | { |
397 | { |
| 300 | state [0] = src.state [0]; |
398 | state [0] = src.state [0]; |
| … | |
… | |
| 303 | state [3] = src.state [3]; |
401 | state [3] = src.state [3]; |
| 304 | } |
402 | } |
| 305 | |
403 | |
| 306 | void seed (uint32_t seed); |
404 | void seed (uint32_t seed); |
| 307 | uint32_t next (); |
405 | uint32_t next (); |
|
|
406 | }; |
| 308 | |
407 | |
| 309 | // uniform distribution |
408 | // Xorshift RNGs, George Marsaglia |
|
|
409 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
410 | // 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. |
|
|
412 | struct xorshift_random_generator |
|
|
413 | { |
|
|
414 | uint32_t x, y; |
|
|
415 | |
|
|
416 | void operator =(const xorshift_random_generator &src) |
|
|
417 | { |
|
|
418 | x = src.x; |
|
|
419 | y = src.y; |
|
|
420 | } |
|
|
421 | |
|
|
422 | void seed (uint32_t seed) |
|
|
423 | { |
|
|
424 | x = seed; |
|
|
425 | y = seed * 69069U; |
|
|
426 | } |
|
|
427 | |
|
|
428 | uint32_t next () |
|
|
429 | { |
|
|
430 | uint32_t t = x ^ (x << 10); |
|
|
431 | x = y; |
|
|
432 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
433 | return y; |
|
|
434 | } |
|
|
435 | }; |
|
|
436 | |
|
|
437 | template<class generator> |
|
|
438 | struct random_number_generator : generator |
|
|
439 | { |
|
|
440 | // uniform distribution, 0 .. max (0, num - 1) |
| 310 | uint32_t operator ()(uint32_t num) |
441 | uint32_t operator ()(uint32_t num) |
| 311 | { |
442 | { |
| 312 | return is_constant (num) |
443 | return !is_constant (num) ? get_range (num) // non-constant |
| 313 | ? (next () * (uint64_t)num) >> 32U |
444 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
| 314 | : get_range (num); |
445 | : this->next () & (num - 1); // constant, power-of-two |
| 315 | } |
446 | } |
| 316 | |
447 | |
| 317 | // return a number within (min .. max) |
448 | // return a number within (min .. max) |
| 318 | int operator () (int r_min, int r_max) |
449 | int operator () (int r_min, int r_max) |
| 319 | { |
450 | { |
| … | |
… | |
| 330 | protected: |
461 | protected: |
| 331 | uint32_t get_range (uint32_t r_max); |
462 | uint32_t get_range (uint32_t r_max); |
| 332 | int get_range (int r_min, int r_max); |
463 | int get_range (int r_min, int r_max); |
| 333 | }; |
464 | }; |
| 334 | |
465 | |
| 335 | typedef tausworthe_random_generator rand_gen; |
466 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
| 336 | |
467 | |
| 337 | extern rand_gen rndm; |
468 | extern rand_gen rndm, rmg_rndm; |
|
|
469 | |
|
|
470 | INTERFACE_CLASS (attachable) |
|
|
471 | struct refcnt_base |
|
|
472 | { |
|
|
473 | typedef int refcnt_t; |
|
|
474 | mutable refcnt_t ACC (RW, refcnt); |
|
|
475 | |
|
|
476 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
477 | MTH void refcnt_dec () const { --refcnt; } |
|
|
478 | |
|
|
479 | refcnt_base () : refcnt (0) { } |
|
|
480 | }; |
|
|
481 | |
|
|
482 | // to avoid branches with more advanced compilers |
|
|
483 | extern refcnt_base::refcnt_t refcnt_dummy; |
| 338 | |
484 | |
| 339 | template<class T> |
485 | template<class T> |
| 340 | struct refptr |
486 | struct refptr |
| 341 | { |
487 | { |
|
|
488 | // p if not null |
|
|
489 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
490 | |
|
|
491 | void refcnt_dec () |
|
|
492 | { |
|
|
493 | if (!is_constant (p)) |
|
|
494 | --*refcnt_ref (); |
|
|
495 | else if (p) |
|
|
496 | --p->refcnt; |
|
|
497 | } |
|
|
498 | |
|
|
499 | void refcnt_inc () |
|
|
500 | { |
|
|
501 | if (!is_constant (p)) |
|
|
502 | ++*refcnt_ref (); |
|
|
503 | else if (p) |
|
|
504 | ++p->refcnt; |
|
|
505 | } |
|
|
506 | |
| 342 | T *p; |
507 | T *p; |
| 343 | |
508 | |
| 344 | refptr () : p(0) { } |
509 | refptr () : p(0) { } |
| 345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
510 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
| 346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
511 | refptr (T *p) : p(p) { refcnt_inc (); } |
| 347 | ~refptr () { if (p) p->refcnt_dec (); } |
512 | ~refptr () { refcnt_dec (); } |
| 348 | |
513 | |
| 349 | const refptr<T> &operator =(T *o) |
514 | const refptr<T> &operator =(T *o) |
| 350 | { |
515 | { |
|
|
516 | // if decrementing ever destroys we need to reverse the order here |
| 351 | if (p) p->refcnt_dec (); |
517 | refcnt_dec (); |
| 352 | p = o; |
518 | p = o; |
| 353 | if (p) p->refcnt_inc (); |
519 | refcnt_inc (); |
| 354 | |
|
|
| 355 | return *this; |
520 | return *this; |
| 356 | } |
521 | } |
| 357 | |
522 | |
| 358 | const refptr<T> &operator =(const refptr<T> o) |
523 | const refptr<T> &operator =(const refptr<T> &o) |
| 359 | { |
524 | { |
| 360 | *this = o.p; |
525 | *this = o.p; |
| 361 | return *this; |
526 | return *this; |
| 362 | } |
527 | } |
| 363 | |
528 | |
| 364 | T &operator * () const { return *p; } |
529 | T &operator * () const { return *p; } |
| 365 | T *operator ->() const { return p; } |
530 | T *operator ->() const { return p; } |
| 366 | |
531 | |
| 367 | operator T *() const { return p; } |
532 | operator T *() const { return p; } |
| 368 | }; |
533 | }; |
| 369 | |
534 | |
| 370 | typedef refptr<maptile> maptile_ptr; |
535 | typedef refptr<maptile> maptile_ptr; |
| … | |
… | |
| 406 | return !strcmp (a, b); |
571 | return !strcmp (a, b); |
| 407 | } |
572 | } |
| 408 | }; |
573 | }; |
| 409 | |
574 | |
| 410 | // Mostly the same as std::vector, but insert/erase can reorder |
575 | // Mostly the same as std::vector, but insert/erase can reorder |
| 411 | // the elements, making insret/remove O(1) instead of O(n). |
576 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
| 412 | // |
577 | // |
| 413 | // NOTE: only some forms of erase/insert are available |
578 | // NOTE: only some forms of erase are available |
| 414 | template<class T> |
579 | template<class T> |
| 415 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
580 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
| 416 | { |
581 | { |
| 417 | typedef typename unordered_vector::iterator iterator; |
582 | typedef typename unordered_vector::iterator iterator; |
| 418 | |
583 | |
| … | |
… | |
| 459 | return obj->*indexmember |
624 | return obj->*indexmember |
| 460 | ? this->begin () + obj->*indexmember - 1 |
625 | ? this->begin () + obj->*indexmember - 1 |
| 461 | : this->end (); |
626 | : this->end (); |
| 462 | } |
627 | } |
| 463 | |
628 | |
|
|
629 | void push_back (T *obj) |
|
|
630 | { |
|
|
631 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
632 | obj->*indexmember = this->size (); |
|
|
633 | } |
|
|
634 | |
| 464 | void insert (T *obj) |
635 | void insert (T *obj) |
| 465 | { |
636 | { |
| 466 | push_back (obj); |
637 | push_back (obj); |
| 467 | obj->*indexmember = this->size (); |
|
|
| 468 | } |
638 | } |
| 469 | |
639 | |
| 470 | void insert (T &obj) |
640 | void insert (T &obj) |
| 471 | { |
641 | { |
| 472 | insert (&obj); |
642 | insert (&obj); |
| … | |
… | |
| 502 | assign ((char *)&dst, src, N); |
672 | assign ((char *)&dst, src, N); |
| 503 | } |
673 | } |
| 504 | |
674 | |
| 505 | typedef double tstamp; |
675 | typedef double tstamp; |
| 506 | |
676 | |
| 507 | // return current time as timestampe |
677 | // return current time as timestamp |
| 508 | tstamp now (); |
678 | tstamp now (); |
| 509 | |
679 | |
| 510 | int similar_direction (int a, int b); |
680 | int similar_direction (int a, int b); |
| 511 | |
681 | |
| 512 | // like printf, but returns a std::string |
682 | // like sprintf, but returns a "static" buffer |
| 513 | const std::string format (const char *format, ...); |
683 | const char *format (const char *format, ...); |
| 514 | |
684 | |
|
|
685 | ///////////////////////////////////////////////////////////////////////////// |
|
|
686 | // threads, very very thin wrappers around pthreads |
|
|
687 | |
|
|
688 | struct thread |
|
|
689 | { |
|
|
690 | pthread_t id; |
|
|
691 | |
|
|
692 | void start (void *(*start_routine)(void *), void *arg = 0); |
|
|
693 | |
|
|
694 | void cancel () |
|
|
695 | { |
|
|
696 | pthread_cancel (id); |
|
|
697 | } |
|
|
698 | |
|
|
699 | void *join () |
|
|
700 | { |
|
|
701 | void *ret; |
|
|
702 | |
|
|
703 | if (pthread_join (id, &ret)) |
|
|
704 | cleanup ("pthread_join failed", 1); |
|
|
705 | |
|
|
706 | return ret; |
|
|
707 | } |
|
|
708 | }; |
|
|
709 | |
|
|
710 | // note that mutexes are not classes |
|
|
711 | typedef pthread_mutex_t smutex; |
|
|
712 | |
|
|
713 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
|
|
714 | #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
|
|
715 | #else |
|
|
716 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
| 515 | #endif |
717 | #endif |
| 516 | |
718 | |
|
|
719 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
|
|
720 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
|
|
721 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
|
|
722 | |
|
|
723 | typedef pthread_cond_t scond; |
|
|
724 | |
|
|
725 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
726 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
727 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
728 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
729 | |
|
|
730 | #endif |
|
|
731 | |
