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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
6 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * 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 |
8 | * 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 |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
10 | * option) any later version. |
10 | * |
11 | * |
11 | * This program is distributed in the hope that it will be useful, |
12 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
15 | * GNU General Public License for more details. |
15 | * |
16 | * |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * 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 |
18 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
19 | * <http://www.gnu.org/licenses/>. |
19 | * |
20 | * |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
22 | */ |
22 | |
23 | |
23 | #ifndef UTIL_H__ |
24 | #ifndef UTIL_H__ |
24 | #define UTIL_H__ |
25 | #define UTIL_H__ |
… | |
… | |
35 | #include <cmath> |
36 | #include <cmath> |
36 | #include <new> |
37 | #include <new> |
37 | #include <vector> |
38 | #include <vector> |
38 | |
39 | |
39 | #include <glib.h> |
40 | #include <glib.h> |
|
|
41 | |
|
|
42 | #include <flat_hash_map.hpp> |
40 | |
43 | |
41 | #include <shstr.h> |
44 | #include <shstr.h> |
42 | #include <traits.h> |
45 | #include <traits.h> |
43 | |
46 | |
44 | #if DEBUG_SALLOC |
47 | #if DEBUG_SALLOC |
… | |
… | |
55 | #endif |
58 | #endif |
56 | |
59 | |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
60 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
61 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | |
62 | |
|
|
63 | #if cplusplus_does_not_suck /* still sucks in codesize with gcc 6, although local types work now */ |
|
|
64 | // does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm) |
|
|
65 | template<typename T, int N> |
|
|
66 | static inline int array_length (const T (&arr)[N]) |
|
|
67 | { |
|
|
68 | return N; |
|
|
69 | } |
|
|
70 | #else |
|
|
71 | #define array_length(name) (sizeof (name) / sizeof (name [0])) |
|
|
72 | #endif |
|
|
73 | |
60 | // very ugly macro that basically declares and initialises a variable |
74 | // very ugly macro that basically declares and initialises a variable |
61 | // that is in scope for the next statement only |
75 | // that is in scope for the next statement only |
62 | // works only for stuff that can be assigned 0 and converts to false |
76 | // works only for stuff that can be assigned 0 and converts to false |
63 | // (note: works great for pointers) |
77 | // (note: works great for pointers) |
64 | // most ugly macro I ever wrote |
78 | // most ugly macro I ever wrote |
… | |
… | |
70 | |
84 | |
71 | // in range excluding end |
85 | // in range excluding end |
72 | #define IN_RANGE_EXC(val,beg,end) \ |
86 | #define IN_RANGE_EXC(val,beg,end) \ |
73 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
87 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
74 | |
88 | |
75 | void cleanup (const char *cause, bool make_core = false); |
89 | ecb_cold void cleanup (const char *cause, bool make_core = false); |
76 | void fork_abort (const char *msg); |
90 | ecb_cold void fork_abort (const char *msg); |
77 | |
91 | |
78 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
92 | // 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. |
93 | // 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; } |
94 | 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; } |
95 | 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; } |
96 | 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 | |
97 | |
84 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
98 | 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); } |
99 | 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); } |
100 | 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 |
107 | // sign returns -1 or +1 |
94 | template<typename T> |
108 | template<typename T> |
95 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
109 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
96 | // relies on 2c representation |
110 | // relies on 2c representation |
97 | template<> |
111 | template<> |
98 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
112 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
113 | template<> |
|
|
114 | inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); } |
|
|
115 | template<> |
|
|
116 | inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); } |
99 | |
117 | |
100 | // sign0 returns -1, 0 or +1 |
118 | // sign0 returns -1, 0 or +1 |
101 | template<typename T> |
119 | template<typename T> |
102 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
120 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
103 | |
121 | |
|
|
122 | //clashes with C++0x |
104 | template<typename T, typename U> |
123 | template<typename T, typename U> |
105 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
124 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
106 | |
125 | |
107 | // div* only work correctly for div > 0 |
126 | // div* only work correctly for div > 0 |
108 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
127 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
109 | template<typename T> static inline T div (T val, T div) |
128 | template<typename T> static inline T div (T val, T div) |
110 | { |
129 | { |
111 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
130 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
112 | } |
131 | } |
|
|
132 | |
|
|
133 | template<> inline float div (float val, float div) { return val / div; } |
|
|
134 | template<> inline double div (double val, double div) { return val / div; } |
|
|
135 | |
113 | // div, round-up |
136 | // div, round-up |
114 | template<typename T> static inline T div_ru (T val, T div) |
137 | template<typename T> static inline T div_ru (T val, T div) |
115 | { |
138 | { |
116 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
139 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
117 | } |
140 | } |
… | |
… | |
217 | #if 0 |
240 | #if 0 |
218 | // and has a max. error of 6 in the range -100..+100. |
241 | // and has a max. error of 6 in the range -100..+100. |
219 | #else |
242 | #else |
220 | // and has a max. error of 9 in the range -100..+100. |
243 | // and has a max. error of 9 in the range -100..+100. |
221 | #endif |
244 | #endif |
222 | inline int |
245 | inline int |
223 | idistance (int dx, int dy) |
246 | idistance (int dx, int dy) |
224 | { |
247 | { |
225 | unsigned int dx_ = abs (dx); |
248 | unsigned int dx_ = abs (dx); |
226 | unsigned int dy_ = abs (dy); |
249 | unsigned int dy_ = abs (dy); |
227 | |
250 | |
228 | #if 0 |
251 | #if 0 |
229 | return dx_ > dy_ |
252 | return dx_ > dy_ |
… | |
… | |
232 | #else |
255 | #else |
233 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
256 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
234 | #endif |
257 | #endif |
235 | } |
258 | } |
236 | |
259 | |
|
|
260 | // can be substantially faster than floor, if your value range allows for it |
|
|
261 | template<typename T> |
|
|
262 | inline T |
|
|
263 | fastfloor (T x) |
|
|
264 | { |
|
|
265 | return std::floor (x); |
|
|
266 | } |
|
|
267 | |
|
|
268 | inline float |
|
|
269 | fastfloor (float x) |
|
|
270 | { |
|
|
271 | return sint32(x) - (x < 0); |
|
|
272 | } |
|
|
273 | |
|
|
274 | inline double |
|
|
275 | fastfloor (double x) |
|
|
276 | { |
|
|
277 | return sint64(x) - (x < 0); |
|
|
278 | } |
|
|
279 | |
237 | /* |
280 | /* |
238 | * absdir(int): Returns a number between 1 and 8, which represent |
281 | * absdir(int): Returns a number between 1 and 8, which represent |
239 | * the "absolute" direction of a number (it actually takes care of |
282 | * the "absolute" direction of a number (it actually takes care of |
240 | * "overflow" in previous calculations of a direction). |
283 | * "overflow" in previous calculations of a direction). |
241 | */ |
284 | */ |
… | |
… | |
243 | absdir (int d) |
286 | absdir (int d) |
244 | { |
287 | { |
245 | return ((d - 1) & 7) + 1; |
288 | return ((d - 1) & 7) + 1; |
246 | } |
289 | } |
247 | |
290 | |
248 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
249 | #if GCC_VERSION(3,4) |
|
|
250 | static inline int least_significant_bit (uint32_t x) |
|
|
251 | { |
|
|
252 | return __builtin_ctz (x); |
|
|
253 | } |
|
|
254 | #else |
|
|
255 | int least_significant_bit (uint32_t x); |
|
|
256 | #endif |
|
|
257 | |
|
|
258 | #define for_all_bits_sparse_32(mask, idxvar) \ |
291 | #define for_all_bits_sparse_32(mask, idxvar) \ |
259 | for (uint32_t idxvar, mask_ = mask; \ |
292 | for (uint32_t idxvar, mask_ = mask; \ |
260 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
293 | mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);) |
261 | |
294 | |
262 | extern ssize_t slice_alloc; // statistics |
295 | extern ssize_t slice_alloc; // statistics |
263 | |
296 | |
264 | void *salloc_ (int n) throw (std::bad_alloc); |
297 | void *salloc_ (int n); |
265 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
298 | void *salloc_ (int n, void *src); |
266 | |
299 | |
267 | // strictly the same as g_slice_alloc, but never returns 0 |
300 | // strictly the same as g_slice_alloc, but never returns 0 |
268 | template<typename T> |
301 | template<typename T> |
269 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
302 | inline T *salloc (int n = 1) { return (T *)salloc_ (n * sizeof (T)); } |
270 | |
303 | |
271 | // also copies src into the new area, like "memdup" |
304 | // also copies src into the new area, like "memdup" |
272 | // if src is 0, clears the memory |
305 | // if src is 0, clears the memory |
273 | template<typename T> |
306 | template<typename T> |
274 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
307 | inline T *salloc (int n, T *src) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
275 | |
308 | |
276 | // clears the memory |
309 | // clears the memory |
277 | template<typename T> |
310 | template<typename T> |
278 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
311 | inline T *salloc0(int n = 1) { return (T *)salloc_ (n * sizeof (T), 0); } |
279 | |
312 | |
280 | // for symmetry |
313 | // for symmetry |
281 | template<typename T> |
314 | template<typename T> |
282 | inline void sfree (T *ptr, int n = 1) throw () |
315 | inline void sfree (T *ptr, int n = 1) noexcept |
283 | { |
316 | { |
284 | if (expect_true (ptr)) |
317 | if (expect_true (ptr)) |
285 | { |
318 | { |
286 | slice_alloc -= n * sizeof (T); |
319 | slice_alloc -= n * sizeof (T); |
287 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
320 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
288 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
321 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
289 | assert (slice_alloc >= 0);//D |
|
|
290 | } |
322 | } |
291 | } |
323 | } |
292 | |
324 | |
293 | // nulls the pointer |
325 | // nulls the pointer |
294 | template<typename T> |
326 | template<typename T> |
295 | inline void sfree0 (T *&ptr, int n = 1) throw () |
327 | inline void sfree0 (T *&ptr, int n = 1) noexcept |
296 | { |
328 | { |
297 | sfree<T> (ptr, n); |
329 | sfree<T> (ptr, n); |
298 | ptr = 0; |
330 | ptr = 0; |
299 | } |
331 | } |
300 | |
332 | |
… | |
… | |
368 | typedef const Tp *const_pointer; |
400 | typedef const Tp *const_pointer; |
369 | typedef Tp &reference; |
401 | typedef Tp &reference; |
370 | typedef const Tp &const_reference; |
402 | typedef const Tp &const_reference; |
371 | typedef Tp value_type; |
403 | typedef Tp value_type; |
372 | |
404 | |
373 | template <class U> |
405 | template <class U> |
374 | struct rebind |
406 | struct rebind |
375 | { |
407 | { |
376 | typedef slice_allocator<U> other; |
408 | typedef slice_allocator<U> other; |
377 | }; |
409 | }; |
378 | |
410 | |
379 | slice_allocator () throw () { } |
411 | slice_allocator () noexcept { } |
380 | slice_allocator (const slice_allocator &) throw () { } |
412 | slice_allocator (const slice_allocator &) noexcept { } |
381 | template<typename Tp2> |
413 | template<typename Tp2> |
382 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
414 | slice_allocator (const slice_allocator<Tp2> &) noexcept { } |
383 | |
415 | |
384 | ~slice_allocator () { } |
416 | ~slice_allocator () { } |
385 | |
417 | |
386 | pointer address (reference x) const { return &x; } |
418 | pointer address (reference x) const { return &x; } |
387 | const_pointer address (const_reference x) const { return &x; } |
419 | const_pointer address (const_reference x) const { return &x; } |
… | |
… | |
394 | void deallocate (pointer p, size_type n) |
426 | void deallocate (pointer p, size_type n) |
395 | { |
427 | { |
396 | sfree<Tp> (p, n); |
428 | sfree<Tp> (p, n); |
397 | } |
429 | } |
398 | |
430 | |
399 | size_type max_size () const throw () |
431 | size_type max_size () const noexcept |
400 | { |
432 | { |
401 | return size_t (-1) / sizeof (Tp); |
433 | return size_t (-1) / sizeof (Tp); |
402 | } |
434 | } |
403 | |
435 | |
404 | void construct (pointer p, const Tp &val) |
436 | void construct (pointer p, const Tp &val) |
… | |
… | |
410 | { |
442 | { |
411 | p->~Tp (); |
443 | p->~Tp (); |
412 | } |
444 | } |
413 | }; |
445 | }; |
414 | |
446 | |
415 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
447 | // basically a memory area, but refcounted |
416 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
448 | struct refcnt_buf |
417 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
418 | struct tausworthe_random_generator |
|
|
419 | { |
449 | { |
420 | uint32_t state [4]; |
450 | char *data; |
421 | |
451 | |
422 | void operator =(const tausworthe_random_generator &src) |
452 | refcnt_buf (size_t size = 0); |
423 | { |
453 | refcnt_buf (void *data, size_t size); |
424 | state [0] = src.state [0]; |
|
|
425 | state [1] = src.state [1]; |
|
|
426 | state [2] = src.state [2]; |
|
|
427 | state [3] = src.state [3]; |
|
|
428 | } |
|
|
429 | |
454 | |
430 | void seed (uint32_t seed); |
455 | refcnt_buf (const refcnt_buf &src) |
431 | uint32_t next (); |
|
|
432 | }; |
|
|
433 | |
|
|
434 | // Xorshift RNGs, George Marsaglia |
|
|
435 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
436 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
437 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
438 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
439 | struct xorshift_random_generator |
|
|
440 | { |
|
|
441 | uint32_t x, y; |
|
|
442 | |
|
|
443 | void operator =(const xorshift_random_generator &src) |
|
|
444 | { |
456 | { |
445 | x = src.x; |
457 | data = src.data; |
446 | y = src.y; |
458 | inc (); |
447 | } |
459 | } |
448 | |
460 | |
449 | void seed (uint32_t seed) |
461 | ~refcnt_buf (); |
450 | { |
|
|
451 | x = seed; |
|
|
452 | y = seed * 69069U; |
|
|
453 | } |
|
|
454 | |
462 | |
455 | uint32_t next () |
463 | refcnt_buf &operator =(const refcnt_buf &src); |
|
|
464 | |
|
|
465 | operator char *() |
456 | { |
466 | { |
457 | uint32_t t = x ^ (x << 10); |
|
|
458 | x = y; |
|
|
459 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
460 | return y; |
467 | return data; |
461 | } |
468 | } |
462 | }; |
|
|
463 | |
469 | |
464 | template<class generator> |
470 | size_t size () const |
465 | struct random_number_generator : generator |
|
|
466 | { |
|
|
467 | // uniform distribution, 0 .. max (0, num - 1) |
|
|
468 | uint32_t operator ()(uint32_t num) |
|
|
469 | { |
471 | { |
470 | return !is_constant (num) ? get_range (num) // non-constant |
472 | return _size (); |
471 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
|
|
472 | : this->next () & (num - 1); // constant, power-of-two |
|
|
473 | } |
|
|
474 | |
|
|
475 | // return a number within (min .. max) |
|
|
476 | int operator () (int r_min, int r_max) |
|
|
477 | { |
|
|
478 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
|
|
479 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
480 | : get_range (r_min, r_max); |
|
|
481 | } |
|
|
482 | |
|
|
483 | double operator ()() |
|
|
484 | { |
|
|
485 | return this->next () / (double)0xFFFFFFFFU; |
|
|
486 | } |
473 | } |
487 | |
474 | |
488 | protected: |
475 | protected: |
489 | uint32_t get_range (uint32_t r_max); |
476 | enum { |
490 | int get_range (int r_min, int r_max); |
477 | overhead = sizeof (uint32_t) * 2 |
491 | }; |
478 | }; |
492 | |
479 | |
493 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
480 | uint32_t &_size () const |
|
|
481 | { |
|
|
482 | return ((unsigned int *)data)[-2]; |
|
|
483 | } |
494 | |
484 | |
495 | extern rand_gen rndm, rmg_rndm; |
485 | uint32_t &_refcnt () const |
|
|
486 | { |
|
|
487 | return ((unsigned int *)data)[-1]; |
|
|
488 | } |
|
|
489 | |
|
|
490 | void _alloc (uint32_t size) |
|
|
491 | { |
|
|
492 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
|
|
493 | _size () = size; |
|
|
494 | _refcnt () = 1; |
|
|
495 | } |
|
|
496 | |
|
|
497 | void _dealloc (); |
|
|
498 | |
|
|
499 | void inc () |
|
|
500 | { |
|
|
501 | ++_refcnt (); |
|
|
502 | } |
|
|
503 | |
|
|
504 | void dec () |
|
|
505 | { |
|
|
506 | if (!--_refcnt ()) |
|
|
507 | _dealloc (); |
|
|
508 | } |
|
|
509 | }; |
496 | |
510 | |
497 | INTERFACE_CLASS (attachable) |
511 | INTERFACE_CLASS (attachable) |
498 | struct refcnt_base |
512 | struct refcnt_base |
499 | { |
513 | { |
500 | typedef int refcnt_t; |
514 | typedef int refcnt_t; |
… | |
… | |
515 | // p if not null |
529 | // p if not null |
516 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
530 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
517 | |
531 | |
518 | void refcnt_dec () |
532 | void refcnt_dec () |
519 | { |
533 | { |
520 | if (!is_constant (p)) |
534 | if (!ecb_is_constant (p)) |
521 | --*refcnt_ref (); |
535 | --*refcnt_ref (); |
522 | else if (p) |
536 | else if (p) |
523 | --p->refcnt; |
537 | --p->refcnt; |
524 | } |
538 | } |
525 | |
539 | |
526 | void refcnt_inc () |
540 | void refcnt_inc () |
527 | { |
541 | { |
528 | if (!is_constant (p)) |
542 | if (!ecb_is_constant (p)) |
529 | ++*refcnt_ref (); |
543 | ++*refcnt_ref (); |
530 | else if (p) |
544 | else if (p) |
531 | ++p->refcnt; |
545 | ++p->refcnt; |
532 | } |
546 | } |
533 | |
547 | |
… | |
… | |
562 | typedef refptr<maptile> maptile_ptr; |
576 | typedef refptr<maptile> maptile_ptr; |
563 | typedef refptr<object> object_ptr; |
577 | typedef refptr<object> object_ptr; |
564 | typedef refptr<archetype> arch_ptr; |
578 | typedef refptr<archetype> arch_ptr; |
565 | typedef refptr<client> client_ptr; |
579 | typedef refptr<client> client_ptr; |
566 | typedef refptr<player> player_ptr; |
580 | typedef refptr<player> player_ptr; |
|
|
581 | typedef refptr<region> region_ptr; |
567 | |
582 | |
568 | #define STRHSH_NULL 2166136261 |
583 | #define STRHSH_NULL 2166136261 |
569 | |
584 | |
570 | static inline uint32_t |
585 | static inline uint32_t |
571 | strhsh (const char *s) |
586 | strhsh (const char *s) |
… | |
… | |
573 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
588 | // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/) |
574 | // it is about twice as fast as the one-at-a-time one, |
589 | // it is about twice as fast as the one-at-a-time one, |
575 | // with good distribution. |
590 | // with good distribution. |
576 | // FNV-1a is faster on many cpus because the multiplication |
591 | // FNV-1a is faster on many cpus because the multiplication |
577 | // runs concurrently with the looping logic. |
592 | // runs concurrently with the looping logic. |
|
|
593 | // we modify the hash a bit to improve its distribution |
578 | uint32_t hash = STRHSH_NULL; |
594 | uint32_t hash = STRHSH_NULL; |
579 | |
595 | |
580 | while (*s) |
596 | while (*s) |
581 | hash = (hash ^ *s++) * 16777619U; |
597 | hash = (hash ^ *s++) * 16777619U; |
582 | |
598 | |
583 | return hash; |
599 | return hash ^ (hash >> 16); |
584 | } |
600 | } |
585 | |
601 | |
586 | static inline uint32_t |
602 | static inline uint32_t |
587 | memhsh (const char *s, size_t len) |
603 | memhsh (const char *s, size_t len) |
588 | { |
604 | { |
589 | uint32_t hash = STRHSH_NULL; |
605 | uint32_t hash = STRHSH_NULL; |
590 | |
606 | |
591 | while (len--) |
607 | while (len--) |
592 | hash = (hash ^ *s++) * 16777619U; |
608 | hash = (hash ^ *s++) * 16777619U; |
593 | |
609 | |
594 | return hash; |
610 | return hash; |
595 | } |
611 | } |
… | |
… | |
603 | |
619 | |
604 | std::size_t operator ()(const shstr &s) const |
620 | std::size_t operator ()(const shstr &s) const |
605 | { |
621 | { |
606 | return strhsh (s); |
622 | return strhsh (s); |
607 | } |
623 | } |
|
|
624 | |
|
|
625 | typedef ska::power_of_two_hash_policy hash_policy; |
608 | }; |
626 | }; |
609 | |
627 | |
610 | struct str_equal |
628 | struct str_equal |
611 | { |
629 | { |
612 | bool operator ()(const char *a, const char *b) const |
630 | bool operator ()(const char *a, const char *b) const |
… | |
… | |
638 | } |
656 | } |
639 | }; |
657 | }; |
640 | |
658 | |
641 | // This container blends advantages of linked lists |
659 | // This container blends advantages of linked lists |
642 | // (efficiency) with vectors (random access) by |
660 | // (efficiency) with vectors (random access) by |
643 | // by using an unordered vector and storing the vector |
661 | // using an unordered vector and storing the vector |
644 | // index inside the object. |
662 | // index inside the object. |
645 | // |
663 | // |
646 | // + memory-efficient on most 64 bit archs |
664 | // + memory-efficient on most 64 bit archs |
647 | // + O(1) insert/remove |
665 | // + O(1) insert/remove |
648 | // + free unique (but varying) id for inserted objects |
666 | // + free unique (but varying) id for inserted objects |
… | |
… | |
685 | insert (&obj); |
703 | insert (&obj); |
686 | } |
704 | } |
687 | |
705 | |
688 | void erase (T *obj) |
706 | void erase (T *obj) |
689 | { |
707 | { |
690 | unsigned int pos = obj->*indexmember; |
708 | object_vector_index pos = obj->*indexmember; |
691 | obj->*indexmember = 0; |
709 | obj->*indexmember = 0; |
692 | |
710 | |
693 | if (pos < this->size ()) |
711 | if (pos < this->size ()) |
694 | { |
712 | { |
695 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
713 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
703 | { |
721 | { |
704 | erase (&obj); |
722 | erase (&obj); |
705 | } |
723 | } |
706 | }; |
724 | }; |
707 | |
725 | |
|
|
726 | ///////////////////////////////////////////////////////////////////////////// |
|
|
727 | |
|
|
728 | // something like a vector or stack, but without |
|
|
729 | // out of bounds checking |
|
|
730 | template<typename T> |
|
|
731 | struct fixed_stack |
|
|
732 | { |
|
|
733 | T *data; |
|
|
734 | int size; |
|
|
735 | int max; |
|
|
736 | |
|
|
737 | fixed_stack () |
|
|
738 | : size (0), data (0) |
|
|
739 | { |
|
|
740 | } |
|
|
741 | |
|
|
742 | fixed_stack (int max) |
|
|
743 | : size (0), max (max) |
|
|
744 | { |
|
|
745 | data = salloc<T> (max); |
|
|
746 | } |
|
|
747 | |
|
|
748 | void reset (int new_max) |
|
|
749 | { |
|
|
750 | sfree (data, max); |
|
|
751 | size = 0; |
|
|
752 | max = new_max; |
|
|
753 | data = salloc<T> (max); |
|
|
754 | } |
|
|
755 | |
|
|
756 | void free () |
|
|
757 | { |
|
|
758 | sfree (data, max); |
|
|
759 | data = 0; |
|
|
760 | } |
|
|
761 | |
|
|
762 | ~fixed_stack () |
|
|
763 | { |
|
|
764 | sfree (data, max); |
|
|
765 | } |
|
|
766 | |
|
|
767 | T &operator[](int idx) |
|
|
768 | { |
|
|
769 | return data [idx]; |
|
|
770 | } |
|
|
771 | |
|
|
772 | void push (T v) |
|
|
773 | { |
|
|
774 | data [size++] = v; |
|
|
775 | } |
|
|
776 | |
|
|
777 | T &pop () |
|
|
778 | { |
|
|
779 | return data [--size]; |
|
|
780 | } |
|
|
781 | |
|
|
782 | T remove (int idx) |
|
|
783 | { |
|
|
784 | T v = data [idx]; |
|
|
785 | |
|
|
786 | data [idx] = data [--size]; |
|
|
787 | |
|
|
788 | return v; |
|
|
789 | } |
|
|
790 | }; |
|
|
791 | |
|
|
792 | ///////////////////////////////////////////////////////////////////////////// |
|
|
793 | |
708 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
794 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
709 | // returns the number of bytes actually used (including \0) |
795 | // returns the number of bytes actually used (including \0) |
710 | int assign (char *dst, const char *src, int maxsize); |
796 | int assign (char *dst, const char *src, int maxsize); |
711 | |
797 | |
712 | // type-safe version of assign |
798 | // type-safe version of assign |
… | |
… | |
723 | |
809 | |
724 | int similar_direction (int a, int b); |
810 | int similar_direction (int a, int b); |
725 | |
811 | |
726 | // like v?sprintf, but returns a "static" buffer |
812 | // like v?sprintf, but returns a "static" buffer |
727 | char *vformat (const char *format, va_list ap); |
813 | char *vformat (const char *format, va_list ap); |
728 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
814 | char *format (const char *format, ...) ecb_attribute ((format (printf, 1, 2))); |
729 | |
815 | |
730 | // safety-check player input which will become object->msg |
816 | // safety-check player input which will become object->msg |
731 | bool msg_is_safe (const char *msg); |
817 | bool msg_is_safe (const char *msg); |
732 | |
818 | |
733 | ///////////////////////////////////////////////////////////////////////////// |
819 | ///////////////////////////////////////////////////////////////////////////// |