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> |
… | |
… | |
71 | #endif |
55 | #endif |
72 | |
56 | |
73 | // 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) |
74 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
75 | |
59 | |
|
|
60 | // could use the sizeof (arr) /( sizeof (arr [0]) here, but C++ is |
|
|
61 | // much more obfuscated... :) |
|
|
62 | |
|
|
63 | template<typename T, int N> |
|
|
64 | inline int array_length (const T (&arr)[N]) |
|
|
65 | { |
|
|
66 | return N; |
|
|
67 | } |
|
|
68 | |
76 | // very ugly macro that basicaly declares and initialises a variable |
69 | // very ugly macro that basically declares and initialises a variable |
77 | // that is in scope for the next statement only |
70 | // that is in scope for the next statement only |
78 | // works only for stuff that can be assigned 0 and converts to false |
71 | // works only for stuff that can be assigned 0 and converts to false |
79 | // (note: works great for pointers) |
72 | // (note: works great for pointers) |
80 | // most ugly macro I ever wrote |
73 | // most ugly macro I ever wrote |
81 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
74 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
… | |
… | |
95 | // as a is often a constant while b is the variable. it is still a bug, though. |
88 | // as a is often a constant while b is the variable. it is still a bug, though. |
96 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
89 | 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 max (T a, U b) { return (U)a > b ? (U)a : b; } |
90 | 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, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
91 | 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 | |
92 | |
|
|
93 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
|
|
94 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
|
|
95 | 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); } |
|
|
96 | |
100 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
97 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
101 | |
98 | |
102 | 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 min (T a, U b, V c) { return min (a, min (b, c)); } |
103 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
100 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
104 | |
101 | |
|
|
102 | // sign returns -1 or +1 |
|
|
103 | template<typename T> |
|
|
104 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
|
|
105 | // relies on 2c representation |
|
|
106 | template<> |
|
|
107 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
108 | template<> |
|
|
109 | inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); } |
|
|
110 | template<> |
|
|
111 | inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); } |
|
|
112 | |
|
|
113 | // sign0 returns -1, 0 or +1 |
|
|
114 | template<typename T> |
|
|
115 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
|
|
116 | |
|
|
117 | template<typename T, typename U> |
|
|
118 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
|
|
119 | |
|
|
120 | // div* only work correctly for div > 0 |
|
|
121 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
122 | template<typename T> static inline T div (T val, T div) |
|
|
123 | { |
|
|
124 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
125 | } |
|
|
126 | // div, round-up |
|
|
127 | template<typename T> static inline T div_ru (T val, T div) |
|
|
128 | { |
|
|
129 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
130 | } |
|
|
131 | // div, round-down |
|
|
132 | template<typename T> static inline T div_rd (T val, T div) |
|
|
133 | { |
|
|
134 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
135 | } |
|
|
136 | |
|
|
137 | // lerp* only work correctly for min_in < max_in |
|
|
138 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
105 | template<typename T> |
139 | template<typename T> |
106 | static inline T |
140 | static inline T |
107 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
141 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
108 | { |
142 | { |
109 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
143 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
144 | } |
|
|
145 | |
|
|
146 | // lerp, round-down |
|
|
147 | template<typename T> |
|
|
148 | static inline T |
|
|
149 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
150 | { |
|
|
151 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
152 | } |
|
|
153 | |
|
|
154 | // lerp, round-up |
|
|
155 | template<typename T> |
|
|
156 | static inline T |
|
|
157 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
158 | { |
|
|
159 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
110 | } |
160 | } |
111 | |
161 | |
112 | // lots of stuff taken from FXT |
162 | // lots of stuff taken from FXT |
113 | |
163 | |
114 | /* Rotate right. This is used in various places for checksumming */ |
164 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
152 | int32_t d = b - a; |
202 | int32_t d = b - a; |
153 | d &= d >> 31; |
203 | d &= d >> 31; |
154 | return b - d; |
204 | return b - d; |
155 | } |
205 | } |
156 | |
206 | |
157 | // this is much faster than crossfires original algorithm |
207 | // this is much faster than crossfire's original algorithm |
158 | // on modern cpus |
208 | // on modern cpus |
159 | inline int |
209 | inline int |
160 | isqrt (int n) |
210 | isqrt (int n) |
161 | { |
211 | { |
162 | return (int)sqrtf ((float)n); |
212 | return (int)sqrtf ((float)n); |
|
|
213 | } |
|
|
214 | |
|
|
215 | // this is kind of like the ^^ operator, if it would exist, without sequence point. |
|
|
216 | // more handy than it looks like, due to the implicit !! done on its arguments |
|
|
217 | inline bool |
|
|
218 | logical_xor (bool a, bool b) |
|
|
219 | { |
|
|
220 | return a != b; |
|
|
221 | } |
|
|
222 | |
|
|
223 | inline bool |
|
|
224 | logical_implies (bool a, bool b) |
|
|
225 | { |
|
|
226 | return a <= b; |
163 | } |
227 | } |
164 | |
228 | |
165 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
229 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
166 | #if 0 |
230 | #if 0 |
167 | // and has a max. error of 6 in the range -100..+100. |
231 | // and has a max. error of 6 in the range -100..+100. |
… | |
… | |
192 | absdir (int d) |
256 | absdir (int d) |
193 | { |
257 | { |
194 | return ((d - 1) & 7) + 1; |
258 | return ((d - 1) & 7) + 1; |
195 | } |
259 | } |
196 | |
260 | |
|
|
261 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
262 | #if GCC_VERSION(3,4) |
|
|
263 | static inline int least_significant_bit (uint32_t x) |
|
|
264 | { |
|
|
265 | return __builtin_ctz (x); |
|
|
266 | } |
|
|
267 | #else |
|
|
268 | int least_significant_bit (uint32_t x); |
|
|
269 | #endif |
|
|
270 | |
|
|
271 | #define for_all_bits_sparse_32(mask, idxvar) \ |
|
|
272 | for (uint32_t idxvar, mask_ = mask; \ |
|
|
273 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
|
|
274 | |
197 | extern ssize_t slice_alloc; // statistics |
275 | extern ssize_t slice_alloc; // statistics |
198 | |
276 | |
199 | void *salloc_ (int n) throw (std::bad_alloc); |
277 | void *salloc_ (int n) throw (std::bad_alloc); |
200 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
278 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
201 | |
279 | |
… | |
… | |
217 | inline void sfree (T *ptr, int n = 1) throw () |
295 | inline void sfree (T *ptr, int n = 1) throw () |
218 | { |
296 | { |
219 | if (expect_true (ptr)) |
297 | if (expect_true (ptr)) |
220 | { |
298 | { |
221 | slice_alloc -= n * sizeof (T); |
299 | slice_alloc -= n * sizeof (T); |
|
|
300 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
222 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
301 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
223 | assert (slice_alloc >= 0);//D |
302 | assert (slice_alloc >= 0);//D |
224 | } |
303 | } |
225 | } |
304 | } |
226 | |
305 | |
|
|
306 | // nulls the pointer |
|
|
307 | template<typename T> |
|
|
308 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
309 | { |
|
|
310 | sfree<T> (ptr, n); |
|
|
311 | ptr = 0; |
|
|
312 | } |
|
|
313 | |
227 | // makes dynamically allocated objects zero-initialised |
314 | // makes dynamically allocated objects zero-initialised |
228 | struct zero_initialised |
315 | struct zero_initialised |
229 | { |
316 | { |
230 | void *operator new (size_t s, void *p) |
317 | void *operator new (size_t s, void *p) |
231 | { |
318 | { |
… | |
… | |
239 | } |
326 | } |
240 | |
327 | |
241 | void *operator new[] (size_t s) |
328 | void *operator new[] (size_t s) |
242 | { |
329 | { |
243 | return salloc0<char> (s); |
330 | return salloc0<char> (s); |
|
|
331 | } |
|
|
332 | |
|
|
333 | void operator delete (void *p, size_t s) |
|
|
334 | { |
|
|
335 | sfree ((char *)p, s); |
|
|
336 | } |
|
|
337 | |
|
|
338 | void operator delete[] (void *p, size_t s) |
|
|
339 | { |
|
|
340 | sfree ((char *)p, s); |
|
|
341 | } |
|
|
342 | }; |
|
|
343 | |
|
|
344 | // makes dynamically allocated objects zero-initialised |
|
|
345 | struct slice_allocated |
|
|
346 | { |
|
|
347 | void *operator new (size_t s, void *p) |
|
|
348 | { |
|
|
349 | return p; |
|
|
350 | } |
|
|
351 | |
|
|
352 | void *operator new (size_t s) |
|
|
353 | { |
|
|
354 | return salloc<char> (s); |
|
|
355 | } |
|
|
356 | |
|
|
357 | void *operator new[] (size_t s) |
|
|
358 | { |
|
|
359 | return salloc<char> (s); |
244 | } |
360 | } |
245 | |
361 | |
246 | void operator delete (void *p, size_t s) |
362 | void operator delete (void *p, size_t s) |
247 | { |
363 | { |
248 | sfree ((char *)p, s); |
364 | sfree ((char *)p, s); |
… | |
… | |
312 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
428 | // 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 |
429 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
314 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
430 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
315 | struct tausworthe_random_generator |
431 | struct tausworthe_random_generator |
316 | { |
432 | { |
317 | // generator |
|
|
318 | uint32_t state [4]; |
433 | uint32_t state [4]; |
319 | |
434 | |
320 | void operator =(const tausworthe_random_generator &src) |
435 | void operator =(const tausworthe_random_generator &src) |
321 | { |
436 | { |
322 | state [0] = src.state [0]; |
437 | state [0] = src.state [0]; |
… | |
… | |
325 | state [3] = src.state [3]; |
440 | state [3] = src.state [3]; |
326 | } |
441 | } |
327 | |
442 | |
328 | void seed (uint32_t seed); |
443 | void seed (uint32_t seed); |
329 | uint32_t next (); |
444 | uint32_t next (); |
|
|
445 | }; |
330 | |
446 | |
331 | // uniform distribution |
447 | // Xorshift RNGs, George Marsaglia |
|
|
448 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
449 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
450 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
451 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
452 | struct xorshift_random_generator |
|
|
453 | { |
|
|
454 | uint32_t x, y; |
|
|
455 | |
|
|
456 | void operator =(const xorshift_random_generator &src) |
|
|
457 | { |
|
|
458 | x = src.x; |
|
|
459 | y = src.y; |
|
|
460 | } |
|
|
461 | |
|
|
462 | void seed (uint32_t seed) |
|
|
463 | { |
|
|
464 | x = seed; |
|
|
465 | y = seed * 69069U; |
|
|
466 | } |
|
|
467 | |
|
|
468 | uint32_t next () |
|
|
469 | { |
|
|
470 | uint32_t t = x ^ (x << 10); |
|
|
471 | x = y; |
|
|
472 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
473 | return y; |
|
|
474 | } |
|
|
475 | }; |
|
|
476 | |
|
|
477 | template<class generator> |
|
|
478 | struct random_number_generator : generator |
|
|
479 | { |
|
|
480 | // uniform distribution, 0 .. max (0, num - 1) |
332 | uint32_t operator ()(uint32_t num) |
481 | uint32_t operator ()(uint32_t num) |
333 | { |
482 | { |
334 | return is_constant (num) |
483 | return !is_constant (num) ? get_range (num) // non-constant |
335 | ? (next () * (uint64_t)num) >> 32U |
484 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
336 | : get_range (num); |
485 | : this->next () & (num - 1); // constant, power-of-two |
337 | } |
486 | } |
338 | |
487 | |
339 | // return a number within (min .. max) |
488 | // return a number within the closed interval [min .. max] |
340 | int operator () (int r_min, int r_max) |
489 | int operator () (int r_min, int r_max) |
341 | { |
490 | { |
342 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
491 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
343 | ? r_min + operator ()(r_max - r_min + 1) |
492 | ? r_min + operator ()(r_max - r_min + 1) |
344 | : get_range (r_min, r_max); |
493 | : get_range (r_min, r_max); |
345 | } |
494 | } |
346 | |
495 | |
|
|
496 | // return a number within the closed interval [0..1] |
347 | double operator ()() |
497 | double operator ()() |
348 | { |
498 | { |
349 | return this->next () / (double)0xFFFFFFFFU; |
499 | return this->next () / (double)0xFFFFFFFFU; |
350 | } |
500 | } |
351 | |
501 | |
352 | protected: |
502 | protected: |
353 | uint32_t get_range (uint32_t r_max); |
503 | uint32_t get_range (uint32_t r_max); |
354 | int get_range (int r_min, int r_max); |
504 | int get_range (int r_min, int r_max); |
355 | }; |
505 | }; |
356 | |
506 | |
357 | typedef tausworthe_random_generator rand_gen; |
507 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
358 | |
508 | |
359 | extern rand_gen rndm; |
509 | extern rand_gen rndm, rmg_rndm; |
360 | |
510 | |
361 | INTERFACE_CLASS (attachable) |
511 | INTERFACE_CLASS (attachable) |
362 | struct refcnt_base |
512 | struct refcnt_base |
363 | { |
513 | { |
364 | typedef int refcnt_t; |
514 | typedef int refcnt_t; |
… | |
… | |
426 | typedef refptr<maptile> maptile_ptr; |
576 | typedef refptr<maptile> maptile_ptr; |
427 | typedef refptr<object> object_ptr; |
577 | typedef refptr<object> object_ptr; |
428 | typedef refptr<archetype> arch_ptr; |
578 | typedef refptr<archetype> arch_ptr; |
429 | typedef refptr<client> client_ptr; |
579 | typedef refptr<client> client_ptr; |
430 | typedef refptr<player> player_ptr; |
580 | typedef refptr<player> player_ptr; |
|
|
581 | typedef refptr<region> region_ptr; |
|
|
582 | |
|
|
583 | #define STRHSH_NULL 2166136261 |
|
|
584 | |
|
|
585 | static inline uint32_t |
|
|
586 | strhsh (const char *s) |
|
|
587 | { |
|
|
588 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
589 | // it is about twice as fast as the one-at-a-time one, |
|
|
590 | // with good distribution. |
|
|
591 | // FNV-1a is faster on many cpus because the multiplication |
|
|
592 | // runs concurrently with the looping logic. |
|
|
593 | uint32_t hash = STRHSH_NULL; |
|
|
594 | |
|
|
595 | while (*s) |
|
|
596 | hash = (hash ^ *s++) * 16777619U; |
|
|
597 | |
|
|
598 | return hash; |
|
|
599 | } |
|
|
600 | |
|
|
601 | static inline uint32_t |
|
|
602 | memhsh (const char *s, size_t len) |
|
|
603 | { |
|
|
604 | uint32_t hash = STRHSH_NULL; |
|
|
605 | |
|
|
606 | while (len--) |
|
|
607 | hash = (hash ^ *s++) * 16777619U; |
|
|
608 | |
|
|
609 | return hash; |
|
|
610 | } |
431 | |
611 | |
432 | struct str_hash |
612 | struct str_hash |
433 | { |
613 | { |
434 | std::size_t operator ()(const char *s) const |
614 | std::size_t operator ()(const char *s) const |
435 | { |
615 | { |
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; |
616 | return strhsh (s); |
|
|
617 | } |
|
|
618 | |
|
|
619 | std::size_t operator ()(const shstr &s) const |
|
|
620 | { |
|
|
621 | return strhsh (s); |
455 | } |
622 | } |
456 | }; |
623 | }; |
457 | |
624 | |
458 | struct str_equal |
625 | struct str_equal |
459 | { |
626 | { |
… | |
… | |
552 | erase (&obj); |
719 | erase (&obj); |
553 | } |
720 | } |
554 | }; |
721 | }; |
555 | |
722 | |
556 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
723 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
724 | // returns the number of bytes actually used (including \0) |
557 | void assign (char *dst, const char *src, int maxlen); |
725 | int assign (char *dst, const char *src, int maxsize); |
558 | |
726 | |
559 | // type-safe version of assign |
727 | // type-safe version of assign |
560 | template<int N> |
728 | template<int N> |
561 | inline void assign (char (&dst)[N], const char *src) |
729 | inline int assign (char (&dst)[N], const char *src) |
562 | { |
730 | { |
563 | assign ((char *)&dst, src, N); |
731 | return assign ((char *)&dst, src, N); |
564 | } |
732 | } |
565 | |
733 | |
566 | typedef double tstamp; |
734 | typedef double tstamp; |
567 | |
735 | |
568 | // return current time as timestamp |
736 | // return current time as timestamp |
569 | tstamp now (); |
737 | tstamp now (); |
570 | |
738 | |
571 | int similar_direction (int a, int b); |
739 | int similar_direction (int a, int b); |
572 | |
740 | |
573 | // like sprintf, but returns a "static" buffer |
741 | // like v?sprintf, but returns a "static" buffer |
574 | const char *format (const char *format, ...); |
742 | char *vformat (const char *format, va_list ap); |
|
|
743 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
|
|
744 | |
|
|
745 | // safety-check player input which will become object->msg |
|
|
746 | bool msg_is_safe (const char *msg); |
575 | |
747 | |
576 | ///////////////////////////////////////////////////////////////////////////// |
748 | ///////////////////////////////////////////////////////////////////////////// |
577 | // threads, very very thin wrappers around pthreads |
749 | // threads, very very thin wrappers around pthreads |
578 | |
750 | |
579 | struct thread |
751 | struct thread |