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 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 |
7 | * it under the terms of the GNU General Public License as published by |
7 | * it under the terms of the GNU General Public License as published by |
8 | * the Free Software Foundation, either version 3 of the License, or |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * (at your option) any later version. |
9 | * (at your option) any later version. |
… | |
… | |
20 | */ |
20 | */ |
21 | |
21 | |
22 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
23 | #define UTIL_H__ |
23 | #define UTIL_H__ |
24 | |
24 | |
25 | //#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 |
26 | |
28 | |
27 | #if __GNUC__ >= 3 |
29 | #if __GNUC__ >= 3 |
28 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define is_constant(c) __builtin_constant_p (c) |
29 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
30 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
|
|
33 | # define noinline __attribute__((__noinline__)) |
31 | #else |
34 | #else |
32 | # define is_constant(c) 0 |
35 | # define is_constant(c) 0 |
33 | # define expect(expr,value) (expr) |
36 | # define expect(expr,value) (expr) |
34 | # define prefetch(addr,rw,locality) |
37 | # define prefetch(addr,rw,locality) |
|
|
38 | # define noinline |
35 | #endif |
39 | #endif |
36 | |
40 | |
37 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
41 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
38 | # define decltype(x) typeof(x) |
42 | # define decltype(x) typeof(x) |
39 | #endif |
43 | #endif |
40 | |
44 | |
41 | // put into ifs if you are very sure that the expression |
45 | // put into ifs if you are very sure that the expression |
42 | // is mostly true or mosty false. note that these return |
46 | // is mostly true or mosty false. note that these return |
43 | // booleans, not the expression. |
47 | // booleans, not the expression. |
44 | #define expect_false(expr) expect ((expr) != 0, 0) |
48 | #define expect_false(expr) expect ((expr) ? 1 : 0, 0) |
45 | #define expect_true(expr) expect ((expr) != 0, 1) |
49 | #define expect_true(expr) expect ((expr) ? 1 : 0, 1) |
|
|
50 | |
|
|
51 | #include <pthread.h> |
46 | |
52 | |
47 | #include <cstddef> |
53 | #include <cstddef> |
48 | #include <cmath> |
54 | #include <cmath> |
49 | #include <new> |
55 | #include <new> |
50 | #include <vector> |
56 | #include <vector> |
… | |
… | |
52 | #include <glib.h> |
58 | #include <glib.h> |
53 | |
59 | |
54 | #include <shstr.h> |
60 | #include <shstr.h> |
55 | #include <traits.h> |
61 | #include <traits.h> |
56 | |
62 | |
|
|
63 | #if DEBUG_SALLOC |
|
|
64 | # define g_slice_alloc0(s) debug_slice_alloc0(s) |
|
|
65 | # define g_slice_alloc(s) debug_slice_alloc(s) |
|
|
66 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
|
|
67 | void *g_slice_alloc (unsigned long size); |
|
|
68 | void *g_slice_alloc0 (unsigned long size); |
|
|
69 | void g_slice_free1 (unsigned long size, void *ptr); |
|
|
70 | #elif PREFER_MALLOC |
|
|
71 | # define g_slice_alloc0(s) calloc (1, (s)) |
|
|
72 | # define g_slice_alloc(s) malloc ((s)) |
|
|
73 | # define g_slice_free1(s,p) free ((p)) |
|
|
74 | #endif |
|
|
75 | |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
76 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
77 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | |
78 | |
60 | // very ugly macro that basicaly declares and initialises a variable |
79 | // very ugly macro that basically declares and initialises a variable |
61 | // that is in scope for the next statement only |
80 | // that is in scope for the next statement only |
62 | // works only for stuff that can be assigned 0 and converts to false |
81 | // works only for stuff that can be assigned 0 and converts to false |
63 | // (note: works great for pointers) |
82 | // (note: works great for pointers) |
64 | // most ugly macro I ever wrote |
83 | // most ugly macro I ever wrote |
65 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
84 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
… | |
… | |
70 | |
89 | |
71 | // in range excluding end |
90 | // in range excluding end |
72 | #define IN_RANGE_EXC(val,beg,end) \ |
91 | #define IN_RANGE_EXC(val,beg,end) \ |
73 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
92 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
74 | |
93 | |
|
|
94 | void cleanup (const char *cause, bool make_core = false); |
75 | void fork_abort (const char *msg); |
95 | void fork_abort (const char *msg); |
76 | |
96 | |
77 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
97 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
78 | // as a is often a constant while b is the variable. it is still a bug, though. |
98 | // as a is often a constant while b is the variable. it is still a bug, though. |
79 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
99 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
80 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
100 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
81 | 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; } |
101 | 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; } |
82 | |
102 | |
|
|
103 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
104 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
105 | 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); } |
|
|
106 | |
83 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
107 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
84 | |
108 | |
|
|
109 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
|
|
110 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
|
|
111 | |
|
|
112 | // sign returns -1 or +1 |
|
|
113 | template<typename T> |
|
|
114 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
115 | // relies on 2c representation |
|
|
116 | template<> |
|
|
117 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
118 | |
|
|
119 | // sign0 returns -1, 0 or +1 |
|
|
120 | template<typename T> |
|
|
121 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
122 | |
|
|
123 | // div* only work correctly for div > 0 |
|
|
124 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
125 | template<typename T> static inline T div (T val, T div) |
|
|
126 | { |
|
|
127 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
128 | } |
|
|
129 | // div, round-up |
|
|
130 | template<typename T> static inline T div_ru (T val, T div) |
|
|
131 | { |
|
|
132 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
133 | } |
|
|
134 | // div, round-down |
|
|
135 | template<typename T> static inline T div_rd (T val, T div) |
|
|
136 | { |
|
|
137 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
138 | } |
|
|
139 | |
|
|
140 | // lerp* only work correctly for min_in < max_in |
|
|
141 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
85 | template<typename T> |
142 | template<typename T> |
86 | static inline T |
143 | static inline T |
87 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
144 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
88 | { |
145 | { |
89 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
146 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
147 | } |
|
|
148 | |
|
|
149 | // lerp, round-down |
|
|
150 | template<typename T> |
|
|
151 | static inline T |
|
|
152 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
153 | { |
|
|
154 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
155 | } |
|
|
156 | |
|
|
157 | // lerp, round-up |
|
|
158 | template<typename T> |
|
|
159 | static inline T |
|
|
160 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
161 | { |
|
|
162 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
90 | } |
163 | } |
91 | |
164 | |
92 | // lots of stuff taken from FXT |
165 | // lots of stuff taken from FXT |
93 | |
166 | |
94 | /* Rotate right. This is used in various places for checksumming */ |
167 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
172 | absdir (int d) |
245 | absdir (int d) |
173 | { |
246 | { |
174 | return ((d - 1) & 7) + 1; |
247 | return ((d - 1) & 7) + 1; |
175 | } |
248 | } |
176 | |
249 | |
177 | extern size_t slice_alloc; // statistics |
250 | extern ssize_t slice_alloc; // statistics |
|
|
251 | |
|
|
252 | void *salloc_ (int n) throw (std::bad_alloc); |
|
|
253 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
|
|
254 | |
|
|
255 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
256 | template<typename T> |
|
|
257 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
258 | |
|
|
259 | // also copies src into the new area, like "memdup" |
|
|
260 | // if src is 0, clears the memory |
|
|
261 | template<typename T> |
|
|
262 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
263 | |
|
|
264 | // clears the memory |
|
|
265 | template<typename T> |
|
|
266 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
267 | |
|
|
268 | // for symmetry |
|
|
269 | template<typename T> |
|
|
270 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
271 | { |
|
|
272 | if (expect_true (ptr)) |
|
|
273 | { |
|
|
274 | slice_alloc -= n * sizeof (T); |
|
|
275 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
|
|
276 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
277 | assert (slice_alloc >= 0);//D |
|
|
278 | } |
|
|
279 | } |
|
|
280 | |
|
|
281 | // nulls the pointer |
|
|
282 | template<typename T> |
|
|
283 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
284 | { |
|
|
285 | sfree<T> (ptr, n); |
|
|
286 | ptr = 0; |
|
|
287 | } |
178 | |
288 | |
179 | // makes dynamically allocated objects zero-initialised |
289 | // makes dynamically allocated objects zero-initialised |
180 | struct zero_initialised |
290 | struct zero_initialised |
181 | { |
291 | { |
182 | void *operator new (size_t s, void *p) |
292 | void *operator new (size_t s, void *p) |
… | |
… | |
185 | return p; |
295 | return p; |
186 | } |
296 | } |
187 | |
297 | |
188 | void *operator new (size_t s) |
298 | void *operator new (size_t s) |
189 | { |
299 | { |
190 | slice_alloc += s; |
|
|
191 | return g_slice_alloc0 (s); |
300 | return salloc0<char> (s); |
192 | } |
301 | } |
193 | |
302 | |
194 | void *operator new[] (size_t s) |
303 | void *operator new[] (size_t s) |
195 | { |
304 | { |
196 | slice_alloc += s; |
|
|
197 | return g_slice_alloc0 (s); |
305 | return salloc0<char> (s); |
198 | } |
306 | } |
199 | |
307 | |
200 | void operator delete (void *p, size_t s) |
308 | void operator delete (void *p, size_t s) |
201 | { |
309 | { |
202 | slice_alloc -= s; |
310 | sfree ((char *)p, s); |
203 | g_slice_free1 (s, p); |
|
|
204 | } |
311 | } |
205 | |
312 | |
206 | void operator delete[] (void *p, size_t s) |
313 | void operator delete[] (void *p, size_t s) |
207 | { |
314 | { |
208 | slice_alloc -= s; |
315 | sfree ((char *)p, s); |
209 | g_slice_free1 (s, p); |
|
|
210 | } |
316 | } |
211 | }; |
317 | }; |
212 | |
318 | |
213 | void *salloc_ (int n) throw (std::bad_alloc); |
319 | // makes dynamically allocated objects zero-initialised |
214 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
320 | struct slice_allocated |
215 | |
|
|
216 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
217 | template<typename T> |
|
|
218 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
219 | |
|
|
220 | // also copies src into the new area, like "memdup" |
|
|
221 | // if src is 0, clears the memory |
|
|
222 | template<typename T> |
|
|
223 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
224 | |
|
|
225 | // clears the memory |
|
|
226 | template<typename T> |
|
|
227 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
228 | |
|
|
229 | // for symmetry |
|
|
230 | template<typename T> |
|
|
231 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
232 | { |
321 | { |
233 | #ifdef PREFER_MALLOC |
322 | void *operator new (size_t s, void *p) |
234 | free (ptr); |
323 | { |
235 | #else |
324 | return p; |
236 | slice_alloc -= n * sizeof (T); |
325 | } |
237 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
326 | |
238 | #endif |
327 | void *operator new (size_t s) |
239 | } |
328 | { |
|
|
329 | return salloc<char> (s); |
|
|
330 | } |
|
|
331 | |
|
|
332 | void *operator new[] (size_t s) |
|
|
333 | { |
|
|
334 | return salloc<char> (s); |
|
|
335 | } |
|
|
336 | |
|
|
337 | void operator delete (void *p, size_t s) |
|
|
338 | { |
|
|
339 | sfree ((char *)p, s); |
|
|
340 | } |
|
|
341 | |
|
|
342 | void operator delete[] (void *p, size_t s) |
|
|
343 | { |
|
|
344 | sfree ((char *)p, s); |
|
|
345 | } |
|
|
346 | }; |
240 | |
347 | |
241 | // a STL-compatible allocator that uses g_slice |
348 | // a STL-compatible allocator that uses g_slice |
242 | // boy, this is verbose |
349 | // boy, this is verbose |
243 | template<typename Tp> |
350 | template<typename Tp> |
244 | struct slice_allocator |
351 | struct slice_allocator |
… | |
… | |
256 | { |
363 | { |
257 | typedef slice_allocator<U> other; |
364 | typedef slice_allocator<U> other; |
258 | }; |
365 | }; |
259 | |
366 | |
260 | slice_allocator () throw () { } |
367 | slice_allocator () throw () { } |
261 | slice_allocator (const slice_allocator &o) throw () { } |
368 | slice_allocator (const slice_allocator &) throw () { } |
262 | template<typename Tp2> |
369 | template<typename Tp2> |
263 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
370 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
264 | |
371 | |
265 | ~slice_allocator () { } |
372 | ~slice_allocator () { } |
266 | |
373 | |
… | |
… | |
275 | void deallocate (pointer p, size_type n) |
382 | void deallocate (pointer p, size_type n) |
276 | { |
383 | { |
277 | sfree<Tp> (p, n); |
384 | sfree<Tp> (p, n); |
278 | } |
385 | } |
279 | |
386 | |
280 | size_type max_size ()const throw () |
387 | size_type max_size () const throw () |
281 | { |
388 | { |
282 | return size_t (-1) / sizeof (Tp); |
389 | return size_t (-1) / sizeof (Tp); |
283 | } |
390 | } |
284 | |
391 | |
285 | void construct (pointer p, const Tp &val) |
392 | void construct (pointer p, const Tp &val) |
… | |
… | |
296 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
403 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
297 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
404 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
298 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
405 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
299 | struct tausworthe_random_generator |
406 | struct tausworthe_random_generator |
300 | { |
407 | { |
301 | // generator |
|
|
302 | uint32_t state [4]; |
408 | uint32_t state [4]; |
303 | |
409 | |
304 | void operator =(const tausworthe_random_generator &src) |
410 | void operator =(const tausworthe_random_generator &src) |
305 | { |
411 | { |
306 | state [0] = src.state [0]; |
412 | state [0] = src.state [0]; |
… | |
… | |
309 | state [3] = src.state [3]; |
415 | state [3] = src.state [3]; |
310 | } |
416 | } |
311 | |
417 | |
312 | void seed (uint32_t seed); |
418 | void seed (uint32_t seed); |
313 | uint32_t next (); |
419 | uint32_t next (); |
|
|
420 | }; |
314 | |
421 | |
315 | // uniform distribution |
422 | // Xorshift RNGs, George Marsaglia |
|
|
423 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
424 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
425 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
426 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
427 | struct xorshift_random_generator |
|
|
428 | { |
|
|
429 | uint32_t x, y; |
|
|
430 | |
|
|
431 | void operator =(const xorshift_random_generator &src) |
|
|
432 | { |
|
|
433 | x = src.x; |
|
|
434 | y = src.y; |
|
|
435 | } |
|
|
436 | |
|
|
437 | void seed (uint32_t seed) |
|
|
438 | { |
|
|
439 | x = seed; |
|
|
440 | y = seed * 69069U; |
|
|
441 | } |
|
|
442 | |
|
|
443 | uint32_t next () |
|
|
444 | { |
|
|
445 | uint32_t t = x ^ (x << 10); |
|
|
446 | x = y; |
|
|
447 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
448 | return y; |
|
|
449 | } |
|
|
450 | }; |
|
|
451 | |
|
|
452 | template<class generator> |
|
|
453 | struct random_number_generator : generator |
|
|
454 | { |
|
|
455 | // uniform distribution, 0 .. max (0, num - 1) |
316 | uint32_t operator ()(uint32_t num) |
456 | uint32_t operator ()(uint32_t num) |
317 | { |
457 | { |
318 | return is_constant (num) |
458 | return !is_constant (num) ? get_range (num) // non-constant |
319 | ? (next () * (uint64_t)num) >> 32U |
459 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
320 | : get_range (num); |
460 | : this->next () & (num - 1); // constant, power-of-two |
321 | } |
461 | } |
322 | |
462 | |
323 | // return a number within (min .. max) |
463 | // return a number within (min .. max) |
324 | int operator () (int r_min, int r_max) |
464 | int operator () (int r_min, int r_max) |
325 | { |
465 | { |
… | |
… | |
336 | protected: |
476 | protected: |
337 | uint32_t get_range (uint32_t r_max); |
477 | uint32_t get_range (uint32_t r_max); |
338 | int get_range (int r_min, int r_max); |
478 | int get_range (int r_min, int r_max); |
339 | }; |
479 | }; |
340 | |
480 | |
341 | typedef tausworthe_random_generator rand_gen; |
481 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
342 | |
482 | |
343 | extern rand_gen rndm; |
483 | extern rand_gen rndm, rmg_rndm; |
344 | |
484 | |
345 | INTERFACE_CLASS (attachable) |
485 | INTERFACE_CLASS (attachable) |
346 | struct refcnt_base |
486 | struct refcnt_base |
347 | { |
487 | { |
348 | typedef int refcnt_t; |
488 | typedef int refcnt_t; |
… | |
… | |
415 | |
555 | |
416 | struct str_hash |
556 | struct str_hash |
417 | { |
557 | { |
418 | std::size_t operator ()(const char *s) const |
558 | std::size_t operator ()(const char *s) const |
419 | { |
559 | { |
420 | unsigned long hash = 0; |
560 | #if 0 |
|
|
561 | uint32_t hash = 0; |
421 | |
562 | |
422 | /* use the one-at-a-time hash function, which supposedly is |
563 | /* use the one-at-a-time hash function, which supposedly is |
423 | * better than the djb2-like one used by perl5.005, but |
564 | * better than the djb2-like one used by perl5.005, but |
424 | * certainly is better then the bug used here before. |
565 | * certainly is better then the bug used here before. |
425 | * see http://burtleburtle.net/bob/hash/doobs.html |
566 | * see http://burtleburtle.net/bob/hash/doobs.html |
… | |
… | |
432 | } |
573 | } |
433 | |
574 | |
434 | hash += hash << 3; |
575 | hash += hash << 3; |
435 | hash ^= hash >> 11; |
576 | hash ^= hash >> 11; |
436 | hash += hash << 15; |
577 | hash += hash << 15; |
|
|
578 | #else |
|
|
579 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
580 | // it is about twice as fast as the one-at-a-time one, |
|
|
581 | // with good distribution. |
|
|
582 | // FNV-1a is faster on many cpus because the multiplication |
|
|
583 | // runs concurrent with the looping logic. |
|
|
584 | uint32_t hash = 2166136261; |
|
|
585 | |
|
|
586 | while (*s) |
|
|
587 | hash = (hash ^ *s++) * 16777619; |
|
|
588 | #endif |
437 | |
589 | |
438 | return hash; |
590 | return hash; |
439 | } |
591 | } |
440 | }; |
592 | }; |
441 | |
593 | |
… | |
… | |
536 | erase (&obj); |
688 | erase (&obj); |
537 | } |
689 | } |
538 | }; |
690 | }; |
539 | |
691 | |
540 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
692 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
693 | // returns the number of bytes actually used (including \0) |
541 | void assign (char *dst, const char *src, int maxlen); |
694 | int assign (char *dst, const char *src, int maxsize); |
542 | |
695 | |
543 | // type-safe version of assign |
696 | // type-safe version of assign |
544 | template<int N> |
697 | template<int N> |
545 | inline void assign (char (&dst)[N], const char *src) |
698 | inline int assign (char (&dst)[N], const char *src) |
546 | { |
699 | { |
547 | assign ((char *)&dst, src, N); |
700 | return assign ((char *)&dst, src, N); |
548 | } |
701 | } |
549 | |
702 | |
550 | typedef double tstamp; |
703 | typedef double tstamp; |
551 | |
704 | |
552 | // return current time as timestampe |
705 | // return current time as timestamp |
553 | tstamp now (); |
706 | tstamp now (); |
554 | |
707 | |
555 | int similar_direction (int a, int b); |
708 | int similar_direction (int a, int b); |
556 | |
709 | |
557 | // like sprintf, but returns a "static" buffer |
710 | // like sprintf, but returns a "static" buffer |
558 | const char *format (const char *format, ...); |
711 | const char *format (const char *format, ...); |
559 | |
712 | |
|
|
713 | // safety-check player input which will become object->msg |
|
|
714 | bool msg_is_safe (const char *msg); |
|
|
715 | |
|
|
716 | ///////////////////////////////////////////////////////////////////////////// |
|
|
717 | // threads, very very thin wrappers around pthreads |
|
|
718 | |
|
|
719 | struct thread |
|
|
720 | { |
|
|
721 | pthread_t id; |
|
|
722 | |
|
|
723 | void start (void *(*start_routine)(void *), void *arg = 0); |
|
|
724 | |
|
|
725 | void cancel () |
|
|
726 | { |
|
|
727 | pthread_cancel (id); |
|
|
728 | } |
|
|
729 | |
|
|
730 | void *join () |
|
|
731 | { |
|
|
732 | void *ret; |
|
|
733 | |
|
|
734 | if (pthread_join (id, &ret)) |
|
|
735 | cleanup ("pthread_join failed", 1); |
|
|
736 | |
|
|
737 | return ret; |
|
|
738 | } |
|
|
739 | }; |
|
|
740 | |
|
|
741 | // note that mutexes are not classes |
|
|
742 | typedef pthread_mutex_t smutex; |
|
|
743 | |
|
|
744 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
|
|
745 | #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
|
|
746 | #else |
|
|
747 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
560 | #endif |
748 | #endif |
561 | |
749 | |
|
|
750 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
|
|
751 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
|
|
752 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
|
|
753 | |
|
|
754 | typedef pthread_cond_t scond; |
|
|
755 | |
|
|
756 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
757 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
758 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
759 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
760 | |
|
|
761 | #endif |
|
|
762 | |