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,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * 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 Affero GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * and the GNU General Public License along with this program. If not, see |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
18 | * <http://www.gnu.org/licenses/>. |
19 | * |
19 | * |
20 | * 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> |
21 | */ |
21 | */ |
22 | |
22 | |
23 | #ifndef UTIL_H__ |
23 | #ifndef UTIL_H__ |
24 | #define UTIL_H__ |
24 | #define UTIL_H__ |
… | |
… | |
55 | #endif |
55 | #endif |
56 | |
56 | |
57 | // 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) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | |
59 | |
|
|
60 | #if cplusplus_does_not_suck /* still sucks in codesize with gcc 6, although local types work now */ |
|
|
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 | |
60 | // very ugly macro that basically declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
61 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
62 | // 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 |
63 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
64 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
… | |
… | |
70 | |
81 | |
71 | // in range excluding end |
82 | // in range excluding end |
72 | #define IN_RANGE_EXC(val,beg,end) \ |
83 | #define IN_RANGE_EXC(val,beg,end) \ |
73 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
84 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
74 | |
85 | |
75 | void cleanup (const char *cause, bool make_core = false); |
86 | ecb_cold void cleanup (const char *cause, bool make_core = false); |
76 | void fork_abort (const char *msg); |
87 | ecb_cold void fork_abort (const char *msg); |
77 | |
88 | |
78 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
89 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
79 | // as a is often a constant while b is the variable. it is still a bug, though. |
90 | // as a is often a constant while b is the variable. it is still a bug, though. |
80 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
91 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
81 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
92 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
82 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
93 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
83 | |
94 | |
84 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
95 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
85 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
96 | template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } |
86 | 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); } |
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); } |
… | |
… | |
93 | // sign returns -1 or +1 |
104 | // sign returns -1 or +1 |
94 | template<typename T> |
105 | template<typename T> |
95 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
106 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
96 | // relies on 2c representation |
107 | // relies on 2c representation |
97 | template<> |
108 | template<> |
98 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
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); } |
99 | |
114 | |
100 | // sign0 returns -1, 0 or +1 |
115 | // sign0 returns -1, 0 or +1 |
101 | template<typename T> |
116 | template<typename T> |
102 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
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; } |
103 | |
122 | |
104 | // div* only work correctly for div > 0 |
123 | // div* only work correctly for div > 0 |
105 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
124 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
106 | template<typename T> static inline T div (T val, T div) |
125 | template<typename T> static inline T div (T val, T div) |
107 | { |
126 | { |
108 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
127 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
109 | } |
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 | |
110 | // div, round-up |
133 | // div, round-up |
111 | template<typename T> static inline T div_ru (T val, T div) |
134 | template<typename T> static inline T div_ru (T val, T div) |
112 | { |
135 | { |
113 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
136 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
114 | } |
137 | } |
… | |
… | |
214 | #if 0 |
237 | #if 0 |
215 | // 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. |
216 | #else |
239 | #else |
217 | // and has a max. error of 9 in the range -100..+100. |
240 | // and has a max. error of 9 in the range -100..+100. |
218 | #endif |
241 | #endif |
219 | inline int |
242 | inline int |
220 | idistance (int dx, int dy) |
243 | idistance (int dx, int dy) |
221 | { |
244 | { |
222 | unsigned int dx_ = abs (dx); |
245 | unsigned int dx_ = abs (dx); |
223 | unsigned int dy_ = abs (dy); |
246 | unsigned int dy_ = abs (dy); |
224 | |
247 | |
225 | #if 0 |
248 | #if 0 |
226 | return dx_ > dy_ |
249 | return dx_ > dy_ |
… | |
… | |
229 | #else |
252 | #else |
230 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
253 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
231 | #endif |
254 | #endif |
232 | } |
255 | } |
233 | |
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 | |
234 | /* |
277 | /* |
235 | * absdir(int): Returns a number between 1 and 8, which represent |
278 | * absdir(int): Returns a number between 1 and 8, which represent |
236 | * the "absolute" direction of a number (it actually takes care of |
279 | * the "absolute" direction of a number (it actually takes care of |
237 | * "overflow" in previous calculations of a direction). |
280 | * "overflow" in previous calculations of a direction). |
238 | */ |
281 | */ |
… | |
… | |
240 | absdir (int d) |
283 | absdir (int d) |
241 | { |
284 | { |
242 | return ((d - 1) & 7) + 1; |
285 | return ((d - 1) & 7) + 1; |
243 | } |
286 | } |
244 | |
287 | |
|
|
288 | #define for_all_bits_sparse_32(mask, idxvar) \ |
|
|
289 | for (uint32_t idxvar, mask_ = mask; \ |
|
|
290 | mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);) |
|
|
291 | |
245 | extern ssize_t slice_alloc; // statistics |
292 | extern ssize_t slice_alloc; // statistics |
246 | |
293 | |
247 | void *salloc_ (int n) throw (std::bad_alloc); |
294 | void *salloc_ (int n); |
248 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
295 | void *salloc_ (int n, void *src); |
249 | |
296 | |
250 | // strictly the same as g_slice_alloc, but never returns 0 |
297 | // strictly the same as g_slice_alloc, but never returns 0 |
251 | template<typename T> |
298 | template<typename T> |
252 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
299 | inline T *salloc (int n = 1) { return (T *)salloc_ (n * sizeof (T)); } |
253 | |
300 | |
254 | // also copies src into the new area, like "memdup" |
301 | // also copies src into the new area, like "memdup" |
255 | // if src is 0, clears the memory |
302 | // if src is 0, clears the memory |
256 | template<typename T> |
303 | template<typename T> |
257 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
304 | inline T *salloc (int n, T *src) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
258 | |
305 | |
259 | // clears the memory |
306 | // clears the memory |
260 | template<typename T> |
307 | template<typename T> |
261 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
308 | inline T *salloc0(int n = 1) { return (T *)salloc_ (n * sizeof (T), 0); } |
262 | |
309 | |
263 | // for symmetry |
310 | // for symmetry |
264 | template<typename T> |
311 | template<typename T> |
265 | inline void sfree (T *ptr, int n = 1) throw () |
312 | inline void sfree (T *ptr, int n = 1) noexcept |
266 | { |
313 | { |
267 | if (expect_true (ptr)) |
314 | if (expect_true (ptr)) |
268 | { |
315 | { |
269 | slice_alloc -= n * sizeof (T); |
316 | slice_alloc -= n * sizeof (T); |
270 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
317 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
271 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
318 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
272 | assert (slice_alloc >= 0);//D |
|
|
273 | } |
319 | } |
274 | } |
320 | } |
275 | |
321 | |
276 | // nulls the pointer |
322 | // nulls the pointer |
277 | template<typename T> |
323 | template<typename T> |
278 | inline void sfree0 (T *&ptr, int n = 1) throw () |
324 | inline void sfree0 (T *&ptr, int n = 1) noexcept |
279 | { |
325 | { |
280 | sfree<T> (ptr, n); |
326 | sfree<T> (ptr, n); |
281 | ptr = 0; |
327 | ptr = 0; |
282 | } |
328 | } |
283 | |
329 | |
… | |
… | |
351 | typedef const Tp *const_pointer; |
397 | typedef const Tp *const_pointer; |
352 | typedef Tp &reference; |
398 | typedef Tp &reference; |
353 | typedef const Tp &const_reference; |
399 | typedef const Tp &const_reference; |
354 | typedef Tp value_type; |
400 | typedef Tp value_type; |
355 | |
401 | |
356 | template <class U> |
402 | template <class U> |
357 | struct rebind |
403 | struct rebind |
358 | { |
404 | { |
359 | typedef slice_allocator<U> other; |
405 | typedef slice_allocator<U> other; |
360 | }; |
406 | }; |
361 | |
407 | |
362 | slice_allocator () throw () { } |
408 | slice_allocator () noexcept { } |
363 | slice_allocator (const slice_allocator &) throw () { } |
409 | slice_allocator (const slice_allocator &) noexcept { } |
364 | template<typename Tp2> |
410 | template<typename Tp2> |
365 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
411 | slice_allocator (const slice_allocator<Tp2> &) noexcept { } |
366 | |
412 | |
367 | ~slice_allocator () { } |
413 | ~slice_allocator () { } |
368 | |
414 | |
369 | pointer address (reference x) const { return &x; } |
415 | pointer address (reference x) const { return &x; } |
370 | const_pointer address (const_reference x) const { return &x; } |
416 | const_pointer address (const_reference x) const { return &x; } |
… | |
… | |
377 | void deallocate (pointer p, size_type n) |
423 | void deallocate (pointer p, size_type n) |
378 | { |
424 | { |
379 | sfree<Tp> (p, n); |
425 | sfree<Tp> (p, n); |
380 | } |
426 | } |
381 | |
427 | |
382 | size_type max_size () const throw () |
428 | size_type max_size () const noexcept |
383 | { |
429 | { |
384 | return size_t (-1) / sizeof (Tp); |
430 | return size_t (-1) / sizeof (Tp); |
385 | } |
431 | } |
386 | |
432 | |
387 | void construct (pointer p, const Tp &val) |
433 | void construct (pointer p, const Tp &val) |
… | |
… | |
393 | { |
439 | { |
394 | p->~Tp (); |
440 | p->~Tp (); |
395 | } |
441 | } |
396 | }; |
442 | }; |
397 | |
443 | |
398 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
444 | // basically a memory area, but refcounted |
399 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
445 | struct refcnt_buf |
400 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
401 | struct tausworthe_random_generator |
|
|
402 | { |
446 | { |
403 | uint32_t state [4]; |
447 | char *data; |
404 | |
448 | |
405 | void operator =(const tausworthe_random_generator &src) |
449 | refcnt_buf (size_t size = 0); |
406 | { |
450 | refcnt_buf (void *data, size_t size); |
407 | state [0] = src.state [0]; |
|
|
408 | state [1] = src.state [1]; |
|
|
409 | state [2] = src.state [2]; |
|
|
410 | state [3] = src.state [3]; |
|
|
411 | } |
|
|
412 | |
451 | |
413 | void seed (uint32_t seed); |
452 | refcnt_buf (const refcnt_buf &src) |
414 | uint32_t next (); |
|
|
415 | }; |
|
|
416 | |
|
|
417 | // Xorshift RNGs, George Marsaglia |
|
|
418 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
419 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
420 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
421 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
422 | struct xorshift_random_generator |
|
|
423 | { |
|
|
424 | uint32_t x, y; |
|
|
425 | |
|
|
426 | void operator =(const xorshift_random_generator &src) |
|
|
427 | { |
453 | { |
428 | x = src.x; |
454 | data = src.data; |
429 | y = src.y; |
455 | inc (); |
430 | } |
456 | } |
431 | |
457 | |
432 | void seed (uint32_t seed) |
458 | ~refcnt_buf (); |
433 | { |
|
|
434 | x = seed; |
|
|
435 | y = seed * 69069U; |
|
|
436 | } |
|
|
437 | |
459 | |
438 | uint32_t next () |
460 | refcnt_buf &operator =(const refcnt_buf &src); |
|
|
461 | |
|
|
462 | operator char *() |
439 | { |
463 | { |
440 | uint32_t t = x ^ (x << 10); |
|
|
441 | x = y; |
|
|
442 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
443 | return y; |
464 | return data; |
444 | } |
465 | } |
445 | }; |
|
|
446 | |
466 | |
447 | template<class generator> |
467 | size_t size () const |
448 | struct random_number_generator : generator |
|
|
449 | { |
|
|
450 | // uniform distribution, 0 .. max (0, num - 1) |
|
|
451 | uint32_t operator ()(uint32_t num) |
|
|
452 | { |
468 | { |
453 | return !is_constant (num) ? get_range (num) // non-constant |
469 | return _size (); |
454 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
|
|
455 | : this->next () & (num - 1); // constant, power-of-two |
|
|
456 | } |
|
|
457 | |
|
|
458 | // return a number within (min .. max) |
|
|
459 | int operator () (int r_min, int r_max) |
|
|
460 | { |
|
|
461 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
|
|
462 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
463 | : get_range (r_min, r_max); |
|
|
464 | } |
|
|
465 | |
|
|
466 | double operator ()() |
|
|
467 | { |
|
|
468 | return this->next () / (double)0xFFFFFFFFU; |
|
|
469 | } |
470 | } |
470 | |
471 | |
471 | protected: |
472 | protected: |
472 | uint32_t get_range (uint32_t r_max); |
473 | enum { |
473 | int get_range (int r_min, int r_max); |
474 | overhead = sizeof (uint32_t) * 2 |
474 | }; |
475 | }; |
475 | |
476 | |
476 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
477 | uint32_t &_size () const |
|
|
478 | { |
|
|
479 | return ((unsigned int *)data)[-2]; |
|
|
480 | } |
477 | |
481 | |
478 | extern rand_gen rndm, rmg_rndm; |
482 | uint32_t &_refcnt () const |
|
|
483 | { |
|
|
484 | return ((unsigned int *)data)[-1]; |
|
|
485 | } |
|
|
486 | |
|
|
487 | void _alloc (uint32_t size) |
|
|
488 | { |
|
|
489 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
|
|
490 | _size () = size; |
|
|
491 | _refcnt () = 1; |
|
|
492 | } |
|
|
493 | |
|
|
494 | void _dealloc (); |
|
|
495 | |
|
|
496 | void inc () |
|
|
497 | { |
|
|
498 | ++_refcnt (); |
|
|
499 | } |
|
|
500 | |
|
|
501 | void dec () |
|
|
502 | { |
|
|
503 | if (!--_refcnt ()) |
|
|
504 | _dealloc (); |
|
|
505 | } |
|
|
506 | }; |
479 | |
507 | |
480 | INTERFACE_CLASS (attachable) |
508 | INTERFACE_CLASS (attachable) |
481 | struct refcnt_base |
509 | struct refcnt_base |
482 | { |
510 | { |
483 | typedef int refcnt_t; |
511 | typedef int refcnt_t; |
… | |
… | |
498 | // p if not null |
526 | // p if not null |
499 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
527 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
500 | |
528 | |
501 | void refcnt_dec () |
529 | void refcnt_dec () |
502 | { |
530 | { |
503 | if (!is_constant (p)) |
531 | if (!ecb_is_constant (p)) |
504 | --*refcnt_ref (); |
532 | --*refcnt_ref (); |
505 | else if (p) |
533 | else if (p) |
506 | --p->refcnt; |
534 | --p->refcnt; |
507 | } |
535 | } |
508 | |
536 | |
509 | void refcnt_inc () |
537 | void refcnt_inc () |
510 | { |
538 | { |
511 | if (!is_constant (p)) |
539 | if (!ecb_is_constant (p)) |
512 | ++*refcnt_ref (); |
540 | ++*refcnt_ref (); |
513 | else if (p) |
541 | else if (p) |
514 | ++p->refcnt; |
542 | ++p->refcnt; |
515 | } |
543 | } |
516 | |
544 | |
… | |
… | |
545 | typedef refptr<maptile> maptile_ptr; |
573 | typedef refptr<maptile> maptile_ptr; |
546 | typedef refptr<object> object_ptr; |
574 | typedef refptr<object> object_ptr; |
547 | typedef refptr<archetype> arch_ptr; |
575 | typedef refptr<archetype> arch_ptr; |
548 | typedef refptr<client> client_ptr; |
576 | typedef refptr<client> client_ptr; |
549 | typedef refptr<player> player_ptr; |
577 | typedef refptr<player> player_ptr; |
|
|
578 | typedef refptr<region> region_ptr; |
|
|
579 | |
|
|
580 | #define STRHSH_NULL 2166136261 |
|
|
581 | |
|
|
582 | static inline uint32_t |
|
|
583 | strhsh (const char *s) |
|
|
584 | { |
|
|
585 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
586 | // it is about twice as fast as the one-at-a-time one, |
|
|
587 | // with good distribution. |
|
|
588 | // FNV-1a is faster on many cpus because the multiplication |
|
|
589 | // runs concurrently with the looping logic. |
|
|
590 | // we modify the hash a bit to improve its distribution |
|
|
591 | uint32_t hash = STRHSH_NULL; |
|
|
592 | |
|
|
593 | while (*s) |
|
|
594 | hash = (hash ^ *s++) * 16777619U; |
|
|
595 | |
|
|
596 | return hash ^ (hash >> 16); |
|
|
597 | } |
|
|
598 | |
|
|
599 | static inline uint32_t |
|
|
600 | memhsh (const char *s, size_t len) |
|
|
601 | { |
|
|
602 | uint32_t hash = STRHSH_NULL; |
|
|
603 | |
|
|
604 | while (len--) |
|
|
605 | hash = (hash ^ *s++) * 16777619U; |
|
|
606 | |
|
|
607 | return hash; |
|
|
608 | } |
550 | |
609 | |
551 | struct str_hash |
610 | struct str_hash |
552 | { |
611 | { |
553 | std::size_t operator ()(const char *s) const |
612 | std::size_t operator ()(const char *s) const |
554 | { |
613 | { |
555 | #if 0 |
|
|
556 | uint32_t hash = 0; |
|
|
557 | |
|
|
558 | /* use the one-at-a-time hash function, which supposedly is |
|
|
559 | * better than the djb2-like one used by perl5.005, but |
|
|
560 | * certainly is better then the bug used here before. |
|
|
561 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
562 | */ |
|
|
563 | while (*s) |
|
|
564 | { |
|
|
565 | hash += *s++; |
|
|
566 | hash += hash << 10; |
|
|
567 | hash ^= hash >> 6; |
|
|
568 | } |
|
|
569 | |
|
|
570 | hash += hash << 3; |
|
|
571 | hash ^= hash >> 11; |
|
|
572 | hash += hash << 15; |
|
|
573 | #else |
|
|
574 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
|
|
575 | // it is about twice as fast as the one-at-a-time one, |
|
|
576 | // with good distribution. |
|
|
577 | // FNV-1a is faster on many cpus because the multiplication |
|
|
578 | // runs concurrent with the looping logic. |
|
|
579 | uint32_t hash = 2166136261; |
|
|
580 | |
|
|
581 | while (*s) |
|
|
582 | hash = (hash ^ *s++) * 16777619; |
|
|
583 | #endif |
|
|
584 | |
|
|
585 | return hash; |
614 | return strhsh (s); |
|
|
615 | } |
|
|
616 | |
|
|
617 | std::size_t operator ()(const shstr &s) const |
|
|
618 | { |
|
|
619 | return strhsh (s); |
586 | } |
620 | } |
587 | }; |
621 | }; |
588 | |
622 | |
589 | struct str_equal |
623 | struct str_equal |
590 | { |
624 | { |
… | |
… | |
617 | } |
651 | } |
618 | }; |
652 | }; |
619 | |
653 | |
620 | // This container blends advantages of linked lists |
654 | // This container blends advantages of linked lists |
621 | // (efficiency) with vectors (random access) by |
655 | // (efficiency) with vectors (random access) by |
622 | // by using an unordered vector and storing the vector |
656 | // using an unordered vector and storing the vector |
623 | // index inside the object. |
657 | // index inside the object. |
624 | // |
658 | // |
625 | // + memory-efficient on most 64 bit archs |
659 | // + memory-efficient on most 64 bit archs |
626 | // + O(1) insert/remove |
660 | // + O(1) insert/remove |
627 | // + free unique (but varying) id for inserted objects |
661 | // + free unique (but varying) id for inserted objects |
… | |
… | |
664 | insert (&obj); |
698 | insert (&obj); |
665 | } |
699 | } |
666 | |
700 | |
667 | void erase (T *obj) |
701 | void erase (T *obj) |
668 | { |
702 | { |
669 | unsigned int pos = obj->*indexmember; |
703 | object_vector_index pos = obj->*indexmember; |
670 | obj->*indexmember = 0; |
704 | obj->*indexmember = 0; |
671 | |
705 | |
672 | if (pos < this->size ()) |
706 | if (pos < this->size ()) |
673 | { |
707 | { |
674 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
708 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
682 | { |
716 | { |
683 | erase (&obj); |
717 | erase (&obj); |
684 | } |
718 | } |
685 | }; |
719 | }; |
686 | |
720 | |
|
|
721 | ///////////////////////////////////////////////////////////////////////////// |
|
|
722 | |
|
|
723 | // something like a vector or stack, but without |
|
|
724 | // out of bounds checking |
|
|
725 | template<typename T> |
|
|
726 | struct fixed_stack |
|
|
727 | { |
|
|
728 | T *data; |
|
|
729 | int size; |
|
|
730 | int max; |
|
|
731 | |
|
|
732 | fixed_stack () |
|
|
733 | : size (0), data (0) |
|
|
734 | { |
|
|
735 | } |
|
|
736 | |
|
|
737 | fixed_stack (int max) |
|
|
738 | : size (0), max (max) |
|
|
739 | { |
|
|
740 | data = salloc<T> (max); |
|
|
741 | } |
|
|
742 | |
|
|
743 | void reset (int new_max) |
|
|
744 | { |
|
|
745 | sfree (data, max); |
|
|
746 | size = 0; |
|
|
747 | max = new_max; |
|
|
748 | data = salloc<T> (max); |
|
|
749 | } |
|
|
750 | |
|
|
751 | void free () |
|
|
752 | { |
|
|
753 | sfree (data, max); |
|
|
754 | data = 0; |
|
|
755 | } |
|
|
756 | |
|
|
757 | ~fixed_stack () |
|
|
758 | { |
|
|
759 | sfree (data, max); |
|
|
760 | } |
|
|
761 | |
|
|
762 | T &operator[](int idx) |
|
|
763 | { |
|
|
764 | return data [idx]; |
|
|
765 | } |
|
|
766 | |
|
|
767 | void push (T v) |
|
|
768 | { |
|
|
769 | data [size++] = v; |
|
|
770 | } |
|
|
771 | |
|
|
772 | T &pop () |
|
|
773 | { |
|
|
774 | return data [--size]; |
|
|
775 | } |
|
|
776 | |
|
|
777 | T remove (int idx) |
|
|
778 | { |
|
|
779 | T v = data [idx]; |
|
|
780 | |
|
|
781 | data [idx] = data [--size]; |
|
|
782 | |
|
|
783 | return v; |
|
|
784 | } |
|
|
785 | }; |
|
|
786 | |
|
|
787 | ///////////////////////////////////////////////////////////////////////////// |
|
|
788 | |
687 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
789 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
688 | // returns the number of bytes actually used (including \0) |
790 | // returns the number of bytes actually used (including \0) |
689 | int assign (char *dst, const char *src, int maxsize); |
791 | int assign (char *dst, const char *src, int maxsize); |
690 | |
792 | |
691 | // type-safe version of assign |
793 | // type-safe version of assign |
… | |
… | |
702 | |
804 | |
703 | int similar_direction (int a, int b); |
805 | int similar_direction (int a, int b); |
704 | |
806 | |
705 | // like v?sprintf, but returns a "static" buffer |
807 | // like v?sprintf, but returns a "static" buffer |
706 | char *vformat (const char *format, va_list ap); |
808 | char *vformat (const char *format, va_list ap); |
707 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
809 | char *format (const char *format, ...) ecb_attribute ((format (printf, 1, 2))); |
708 | |
810 | |
709 | // safety-check player input which will become object->msg |
811 | // safety-check player input which will become object->msg |
710 | bool msg_is_safe (const char *msg); |
812 | bool msg_is_safe (const char *msg); |
711 | |
813 | |
712 | ///////////////////////////////////////////////////////////////////////////// |
814 | ///////////////////////////////////////////////////////////////////////////// |