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,2011 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> |
… | |
… | |
65 | void *g_slice_alloc0 (unsigned long size); |
49 | void *g_slice_alloc0 (unsigned long size); |
66 | void g_slice_free1 (unsigned long size, void *ptr); |
50 | void g_slice_free1 (unsigned long size, void *ptr); |
67 | #elif PREFER_MALLOC |
51 | #elif PREFER_MALLOC |
68 | # define g_slice_alloc0(s) calloc (1, (s)) |
52 | # define g_slice_alloc0(s) calloc (1, (s)) |
69 | # define g_slice_alloc(s) malloc ((s)) |
53 | # define g_slice_alloc(s) malloc ((s)) |
70 | # define g_slice_free1(s,p) free ((s)) |
54 | # define g_slice_free1(s,p) free ((p)) |
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 | #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 | |
76 | // very ugly macro that basicaly declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
77 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
78 | // 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 |
79 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
80 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
81 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
76 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
… | |
… | |
91 | void cleanup (const char *cause, bool make_core = false); |
86 | void cleanup (const char *cause, bool make_core = false); |
92 | void fork_abort (const char *msg); |
87 | void fork_abort (const char *msg); |
93 | |
88 | |
94 | // 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, |
95 | // 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. |
96 | 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 a < (T)b ? a : (T)b; } |
97 | 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 a > (T)b ? a : (T)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; } |
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; } |
|
|
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); } |
99 | |
98 | |
100 | 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; } |
101 | |
100 | |
102 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
101 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
103 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
102 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
104 | |
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 | //clashes with C++0x |
|
|
120 | template<typename T, typename U> |
|
|
121 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
|
|
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 | |
|
|
130 | template<> inline float div (float val, float div) { return val / div; } |
|
|
131 | template<> inline double div (double val, double div) { return val / div; } |
|
|
132 | |
|
|
133 | // div, round-up |
|
|
134 | template<typename T> static inline T div_ru (T val, T div) |
|
|
135 | { |
|
|
136 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
137 | } |
|
|
138 | // div, round-down |
|
|
139 | template<typename T> static inline T div_rd (T val, T div) |
|
|
140 | { |
|
|
141 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
142 | } |
|
|
143 | |
|
|
144 | // lerp* only work correctly for min_in < max_in |
|
|
145 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
105 | template<typename T> |
146 | template<typename T> |
106 | static inline T |
147 | static inline T |
107 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
148 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
108 | { |
149 | { |
109 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
150 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
151 | } |
|
|
152 | |
|
|
153 | // lerp, round-down |
|
|
154 | template<typename T> |
|
|
155 | static inline T |
|
|
156 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
157 | { |
|
|
158 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
159 | } |
|
|
160 | |
|
|
161 | // lerp, round-up |
|
|
162 | template<typename T> |
|
|
163 | static inline T |
|
|
164 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
165 | { |
|
|
166 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
110 | } |
167 | } |
111 | |
168 | |
112 | // lots of stuff taken from FXT |
169 | // lots of stuff taken from FXT |
113 | |
170 | |
114 | /* Rotate right. This is used in various places for checksumming */ |
171 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
152 | int32_t d = b - a; |
209 | int32_t d = b - a; |
153 | d &= d >> 31; |
210 | d &= d >> 31; |
154 | return b - d; |
211 | return b - d; |
155 | } |
212 | } |
156 | |
213 | |
157 | // this is much faster than crossfires original algorithm |
214 | // this is much faster than crossfire's original algorithm |
158 | // on modern cpus |
215 | // on modern cpus |
159 | inline int |
216 | inline int |
160 | isqrt (int n) |
217 | isqrt (int n) |
161 | { |
218 | { |
162 | return (int)sqrtf ((float)n); |
219 | return (int)sqrtf ((float)n); |
|
|
220 | } |
|
|
221 | |
|
|
222 | // this is kind of like the ^^ operator, if it would exist, without sequence point. |
|
|
223 | // more handy than it looks like, due to the implicit !! done on its arguments |
|
|
224 | inline bool |
|
|
225 | logical_xor (bool a, bool b) |
|
|
226 | { |
|
|
227 | return a != b; |
|
|
228 | } |
|
|
229 | |
|
|
230 | inline bool |
|
|
231 | logical_implies (bool a, bool b) |
|
|
232 | { |
|
|
233 | return a <= b; |
163 | } |
234 | } |
164 | |
235 | |
165 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
236 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
166 | #if 0 |
237 | #if 0 |
167 | // and has a max. error of 6 in the range -100..+100. |
238 | // and has a max. error of 6 in the range -100..+100. |
… | |
… | |
181 | #else |
252 | #else |
182 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
253 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
183 | #endif |
254 | #endif |
184 | } |
255 | } |
185 | |
256 | |
|
|
257 | // can be substantially faster than floor, if your value range allows for it |
|
|
258 | template<typename T> |
|
|
259 | inline T |
|
|
260 | fastfloor (T x) |
|
|
261 | { |
|
|
262 | return std::floor (x); |
|
|
263 | } |
|
|
264 | |
|
|
265 | inline float |
|
|
266 | fastfloor (float x) |
|
|
267 | { |
|
|
268 | return sint32(x) - (x < 0); |
|
|
269 | } |
|
|
270 | |
|
|
271 | inline double |
|
|
272 | fastfloor (double x) |
|
|
273 | { |
|
|
274 | return sint64(x) - (x < 0); |
|
|
275 | } |
|
|
276 | |
186 | /* |
277 | /* |
187 | * absdir(int): Returns a number between 1 and 8, which represent |
278 | * absdir(int): Returns a number between 1 and 8, which represent |
188 | * the "absolute" direction of a number (it actually takes care of |
279 | * the "absolute" direction of a number (it actually takes care of |
189 | * "overflow" in previous calculations of a direction). |
280 | * "overflow" in previous calculations of a direction). |
190 | */ |
281 | */ |
… | |
… | |
192 | absdir (int d) |
283 | absdir (int d) |
193 | { |
284 | { |
194 | return ((d - 1) & 7) + 1; |
285 | return ((d - 1) & 7) + 1; |
195 | } |
286 | } |
196 | |
287 | |
|
|
288 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
289 | #if GCC_VERSION(3,4) |
|
|
290 | static inline int least_significant_bit (uint32_t x) |
|
|
291 | { |
|
|
292 | return __builtin_ctz (x); |
|
|
293 | } |
|
|
294 | #else |
|
|
295 | int least_significant_bit (uint32_t x); |
|
|
296 | #endif |
|
|
297 | |
|
|
298 | #define for_all_bits_sparse_32(mask, idxvar) \ |
|
|
299 | for (uint32_t idxvar, mask_ = mask; \ |
|
|
300 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
|
|
301 | |
197 | extern ssize_t slice_alloc; // statistics |
302 | extern ssize_t slice_alloc; // statistics |
198 | |
303 | |
199 | void *salloc_ (int n) throw (std::bad_alloc); |
304 | void *salloc_ (int n) throw (std::bad_alloc); |
200 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
305 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
201 | |
306 | |
… | |
… | |
217 | inline void sfree (T *ptr, int n = 1) throw () |
322 | inline void sfree (T *ptr, int n = 1) throw () |
218 | { |
323 | { |
219 | if (expect_true (ptr)) |
324 | if (expect_true (ptr)) |
220 | { |
325 | { |
221 | slice_alloc -= n * sizeof (T); |
326 | slice_alloc -= n * sizeof (T); |
|
|
327 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
222 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
328 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
223 | assert (slice_alloc >= 0);//D |
329 | assert (slice_alloc >= 0);//D |
224 | } |
330 | } |
225 | } |
331 | } |
226 | |
332 | |
|
|
333 | // nulls the pointer |
|
|
334 | template<typename T> |
|
|
335 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
336 | { |
|
|
337 | sfree<T> (ptr, n); |
|
|
338 | ptr = 0; |
|
|
339 | } |
|
|
340 | |
227 | // makes dynamically allocated objects zero-initialised |
341 | // makes dynamically allocated objects zero-initialised |
228 | struct zero_initialised |
342 | struct zero_initialised |
229 | { |
343 | { |
230 | void *operator new (size_t s, void *p) |
344 | void *operator new (size_t s, void *p) |
231 | { |
345 | { |
… | |
… | |
239 | } |
353 | } |
240 | |
354 | |
241 | void *operator new[] (size_t s) |
355 | void *operator new[] (size_t s) |
242 | { |
356 | { |
243 | return salloc0<char> (s); |
357 | return salloc0<char> (s); |
|
|
358 | } |
|
|
359 | |
|
|
360 | void operator delete (void *p, size_t s) |
|
|
361 | { |
|
|
362 | sfree ((char *)p, s); |
|
|
363 | } |
|
|
364 | |
|
|
365 | void operator delete[] (void *p, size_t s) |
|
|
366 | { |
|
|
367 | sfree ((char *)p, s); |
|
|
368 | } |
|
|
369 | }; |
|
|
370 | |
|
|
371 | // makes dynamically allocated objects zero-initialised |
|
|
372 | struct slice_allocated |
|
|
373 | { |
|
|
374 | void *operator new (size_t s, void *p) |
|
|
375 | { |
|
|
376 | return p; |
|
|
377 | } |
|
|
378 | |
|
|
379 | void *operator new (size_t s) |
|
|
380 | { |
|
|
381 | return salloc<char> (s); |
|
|
382 | } |
|
|
383 | |
|
|
384 | void *operator new[] (size_t s) |
|
|
385 | { |
|
|
386 | return salloc<char> (s); |
244 | } |
387 | } |
245 | |
388 | |
246 | void operator delete (void *p, size_t s) |
389 | void operator delete (void *p, size_t s) |
247 | { |
390 | { |
248 | sfree ((char *)p, s); |
391 | sfree ((char *)p, s); |
… | |
… | |
307 | { |
450 | { |
308 | p->~Tp (); |
451 | p->~Tp (); |
309 | } |
452 | } |
310 | }; |
453 | }; |
311 | |
454 | |
312 | // 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 |
|
|
314 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
315 | struct tausworthe_random_generator |
|
|
316 | { |
|
|
317 | // generator |
|
|
318 | uint32_t state [4]; |
|
|
319 | |
|
|
320 | void operator =(const tausworthe_random_generator &src) |
|
|
321 | { |
|
|
322 | state [0] = src.state [0]; |
|
|
323 | state [1] = src.state [1]; |
|
|
324 | state [2] = src.state [2]; |
|
|
325 | state [3] = src.state [3]; |
|
|
326 | } |
|
|
327 | |
|
|
328 | void seed (uint32_t seed); |
|
|
329 | uint32_t next (); |
|
|
330 | |
|
|
331 | // uniform distribution |
|
|
332 | uint32_t operator ()(uint32_t num) |
|
|
333 | { |
|
|
334 | return is_constant (num) |
|
|
335 | ? (next () * (uint64_t)num) >> 32U |
|
|
336 | : get_range (num); |
|
|
337 | } |
|
|
338 | |
|
|
339 | // return a number within (min .. max) |
|
|
340 | int operator () (int r_min, int r_max) |
|
|
341 | { |
|
|
342 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
|
|
343 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
344 | : get_range (r_min, r_max); |
|
|
345 | } |
|
|
346 | |
|
|
347 | double operator ()() |
|
|
348 | { |
|
|
349 | return this->next () / (double)0xFFFFFFFFU; |
|
|
350 | } |
|
|
351 | |
|
|
352 | protected: |
|
|
353 | uint32_t get_range (uint32_t r_max); |
|
|
354 | int get_range (int r_min, int r_max); |
|
|
355 | }; |
|
|
356 | |
|
|
357 | typedef tausworthe_random_generator rand_gen; |
|
|
358 | |
|
|
359 | extern rand_gen rndm; |
|
|
360 | |
|
|
361 | INTERFACE_CLASS (attachable) |
455 | INTERFACE_CLASS (attachable) |
362 | struct refcnt_base |
456 | struct refcnt_base |
363 | { |
457 | { |
364 | typedef int refcnt_t; |
458 | typedef int refcnt_t; |
365 | mutable refcnt_t ACC (RW, refcnt); |
459 | mutable refcnt_t ACC (RW, refcnt); |
… | |
… | |
426 | typedef refptr<maptile> maptile_ptr; |
520 | typedef refptr<maptile> maptile_ptr; |
427 | typedef refptr<object> object_ptr; |
521 | typedef refptr<object> object_ptr; |
428 | typedef refptr<archetype> arch_ptr; |
522 | typedef refptr<archetype> arch_ptr; |
429 | typedef refptr<client> client_ptr; |
523 | typedef refptr<client> client_ptr; |
430 | typedef refptr<player> player_ptr; |
524 | typedef refptr<player> player_ptr; |
|
|
525 | typedef refptr<region> region_ptr; |
|
|
526 | |
|
|
527 | #define STRHSH_NULL 2166136261 |
|
|
528 | |
|
|
529 | static inline uint32_t |
|
|
530 | strhsh (const char *s) |
|
|
531 | { |
|
|
532 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
533 | // it is about twice as fast as the one-at-a-time one, |
|
|
534 | // with good distribution. |
|
|
535 | // FNV-1a is faster on many cpus because the multiplication |
|
|
536 | // runs concurrently with the looping logic. |
|
|
537 | // we modify the hash a bit to improve its distribution |
|
|
538 | uint32_t hash = STRHSH_NULL; |
|
|
539 | |
|
|
540 | while (*s) |
|
|
541 | hash = (hash ^ *s++) * 16777619U; |
|
|
542 | |
|
|
543 | return hash ^ (hash >> 16); |
|
|
544 | } |
|
|
545 | |
|
|
546 | static inline uint32_t |
|
|
547 | memhsh (const char *s, size_t len) |
|
|
548 | { |
|
|
549 | uint32_t hash = STRHSH_NULL; |
|
|
550 | |
|
|
551 | while (len--) |
|
|
552 | hash = (hash ^ *s++) * 16777619U; |
|
|
553 | |
|
|
554 | return hash; |
|
|
555 | } |
431 | |
556 | |
432 | struct str_hash |
557 | struct str_hash |
433 | { |
558 | { |
434 | std::size_t operator ()(const char *s) const |
559 | std::size_t operator ()(const char *s) const |
435 | { |
560 | { |
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; |
561 | return strhsh (s); |
|
|
562 | } |
|
|
563 | |
|
|
564 | std::size_t operator ()(const shstr &s) const |
|
|
565 | { |
|
|
566 | return strhsh (s); |
455 | } |
567 | } |
456 | }; |
568 | }; |
457 | |
569 | |
458 | struct str_equal |
570 | struct str_equal |
459 | { |
571 | { |
… | |
… | |
551 | { |
663 | { |
552 | erase (&obj); |
664 | erase (&obj); |
553 | } |
665 | } |
554 | }; |
666 | }; |
555 | |
667 | |
|
|
668 | ///////////////////////////////////////////////////////////////////////////// |
|
|
669 | |
|
|
670 | // something like a vector or stack, but without |
|
|
671 | // out of bounds checking |
|
|
672 | template<typename T> |
|
|
673 | struct fixed_stack |
|
|
674 | { |
|
|
675 | T *data; |
|
|
676 | int size; |
|
|
677 | int max; |
|
|
678 | |
|
|
679 | fixed_stack () |
|
|
680 | : size (0), data (0) |
|
|
681 | { |
|
|
682 | } |
|
|
683 | |
|
|
684 | fixed_stack (int max) |
|
|
685 | : size (0), max (max) |
|
|
686 | { |
|
|
687 | data = salloc<T> (max); |
|
|
688 | } |
|
|
689 | |
|
|
690 | void reset (int new_max) |
|
|
691 | { |
|
|
692 | sfree (data, max); |
|
|
693 | size = 0; |
|
|
694 | max = new_max; |
|
|
695 | data = salloc<T> (max); |
|
|
696 | } |
|
|
697 | |
|
|
698 | void free () |
|
|
699 | { |
|
|
700 | sfree (data, max); |
|
|
701 | data = 0; |
|
|
702 | } |
|
|
703 | |
|
|
704 | ~fixed_stack () |
|
|
705 | { |
|
|
706 | sfree (data, max); |
|
|
707 | } |
|
|
708 | |
|
|
709 | T &operator[](int idx) |
|
|
710 | { |
|
|
711 | return data [idx]; |
|
|
712 | } |
|
|
713 | |
|
|
714 | void push (T v) |
|
|
715 | { |
|
|
716 | data [size++] = v; |
|
|
717 | } |
|
|
718 | |
|
|
719 | T &pop () |
|
|
720 | { |
|
|
721 | return data [--size]; |
|
|
722 | } |
|
|
723 | |
|
|
724 | T remove (int idx) |
|
|
725 | { |
|
|
726 | T v = data [idx]; |
|
|
727 | |
|
|
728 | data [idx] = data [--size]; |
|
|
729 | |
|
|
730 | return v; |
|
|
731 | } |
|
|
732 | }; |
|
|
733 | |
|
|
734 | ///////////////////////////////////////////////////////////////////////////// |
|
|
735 | |
556 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
736 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
737 | // returns the number of bytes actually used (including \0) |
557 | void assign (char *dst, const char *src, int maxlen); |
738 | int assign (char *dst, const char *src, int maxsize); |
558 | |
739 | |
559 | // type-safe version of assign |
740 | // type-safe version of assign |
560 | template<int N> |
741 | template<int N> |
561 | inline void assign (char (&dst)[N], const char *src) |
742 | inline int assign (char (&dst)[N], const char *src) |
562 | { |
743 | { |
563 | assign ((char *)&dst, src, N); |
744 | return assign ((char *)&dst, src, N); |
564 | } |
745 | } |
565 | |
746 | |
566 | typedef double tstamp; |
747 | typedef double tstamp; |
567 | |
748 | |
568 | // return current time as timestamp |
749 | // return current time as timestamp |
569 | tstamp now (); |
750 | tstamp now (); |
570 | |
751 | |
571 | int similar_direction (int a, int b); |
752 | int similar_direction (int a, int b); |
572 | |
753 | |
573 | // like sprintf, but returns a "static" buffer |
754 | // like v?sprintf, but returns a "static" buffer |
574 | const char *format (const char *format, ...); |
755 | char *vformat (const char *format, va_list ap); |
|
|
756 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
|
|
757 | |
|
|
758 | // safety-check player input which will become object->msg |
|
|
759 | bool msg_is_safe (const char *msg); |
575 | |
760 | |
576 | ///////////////////////////////////////////////////////////////////////////// |
761 | ///////////////////////////////////////////////////////////////////////////// |
577 | // threads, very very thin wrappers around pthreads |
762 | // threads, very very thin wrappers around pthreads |
578 | |
763 | |
579 | struct thread |
764 | struct thread |
… | |
… | |
606 | #else |
791 | #else |
607 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
792 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
608 | #endif |
793 | #endif |
609 | |
794 | |
610 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
795 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
611 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
796 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
612 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
797 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
613 | |
798 | |
|
|
799 | typedef pthread_cond_t scond; |
|
|
800 | |
|
|
801 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
802 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
803 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
804 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
805 | |
614 | #endif |
806 | #endif |
615 | |
807 | |