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 |
… | |
… | |
52 | # define g_slice_alloc0(s) calloc (1, (s)) |
55 | # define g_slice_alloc0(s) calloc (1, (s)) |
53 | # define g_slice_alloc(s) malloc ((s)) |
56 | # define g_slice_alloc(s) malloc ((s)) |
54 | # define g_slice_free1(s,p) free ((p)) |
57 | # define g_slice_free1(s,p) free ((p)) |
55 | #endif |
58 | #endif |
56 | |
59 | |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
|
|
58 | #define auto(var,expr) decltype(expr) var = (expr) |
|
|
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 | |
|
|
71 | // very ugly macro that basically declares and initialises a variable |
60 | // very ugly macro that basically declares and initialises a variable |
72 | // that is in scope for the next statement only |
61 | // that is in scope for the next statement only |
73 | // works only for stuff that can be assigned 0 and converts to false |
62 | // works only for stuff that can be assigned 0 and converts to false |
74 | // (note: works great for pointers) |
63 | // (note: works great for pointers) |
75 | // most ugly macro I ever wrote |
64 | // most ugly macro I ever wrote |
… | |
… | |
81 | |
70 | |
82 | // in range excluding end |
71 | // in range excluding end |
83 | #define IN_RANGE_EXC(val,beg,end) \ |
72 | #define IN_RANGE_EXC(val,beg,end) \ |
84 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
73 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
85 | |
74 | |
86 | void cleanup (const char *cause, bool make_core = false); |
75 | ecb_cold void cleanup (const char *cause, bool make_core = false); |
87 | void fork_abort (const char *msg); |
76 | ecb_cold void fork_abort (const char *msg); |
88 | |
77 | |
89 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
78 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
90 | // as a is often a constant while b is the variable. it is still a bug, though. |
79 | // as a is often a constant while b is the variable. it is still a bug, though. |
91 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
80 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
92 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
81 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
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; } |
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; } |
94 | |
83 | |
95 | template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } |
84 | 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); } |
85 | 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); } |
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); } |
… | |
… | |
237 | #if 0 |
226 | #if 0 |
238 | // and has a max. error of 6 in the range -100..+100. |
227 | // and has a max. error of 6 in the range -100..+100. |
239 | #else |
228 | #else |
240 | // and has a max. error of 9 in the range -100..+100. |
229 | // and has a max. error of 9 in the range -100..+100. |
241 | #endif |
230 | #endif |
242 | inline int |
231 | inline int |
243 | idistance (int dx, int dy) |
232 | idistance (int dx, int dy) |
244 | { |
233 | { |
245 | unsigned int dx_ = abs (dx); |
234 | unsigned int dx_ = abs (dx); |
246 | unsigned int dy_ = abs (dy); |
235 | unsigned int dy_ = abs (dy); |
247 | |
236 | |
248 | #if 0 |
237 | #if 0 |
249 | return dx_ > dy_ |
238 | return dx_ > dy_ |
… | |
… | |
252 | #else |
241 | #else |
253 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
242 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
254 | #endif |
243 | #endif |
255 | } |
244 | } |
256 | |
245 | |
|
|
246 | // can be substantially faster than floor, if your value range allows for it |
|
|
247 | template<typename T> |
|
|
248 | inline T |
|
|
249 | fastfloor (T x) |
|
|
250 | { |
|
|
251 | return std::floor (x); |
|
|
252 | } |
|
|
253 | |
|
|
254 | inline float |
|
|
255 | fastfloor (float x) |
|
|
256 | { |
|
|
257 | return sint32(x) - (x < 0); |
|
|
258 | } |
|
|
259 | |
|
|
260 | inline double |
|
|
261 | fastfloor (double x) |
|
|
262 | { |
|
|
263 | return sint64(x) - (x < 0); |
|
|
264 | } |
|
|
265 | |
257 | /* |
266 | /* |
258 | * absdir(int): Returns a number between 1 and 8, which represent |
267 | * absdir(int): Returns a number between 1 and 8, which represent |
259 | * the "absolute" direction of a number (it actually takes care of |
268 | * the "absolute" direction of a number (it actually takes care of |
260 | * "overflow" in previous calculations of a direction). |
269 | * "overflow" in previous calculations of a direction). |
261 | */ |
270 | */ |
… | |
… | |
263 | absdir (int d) |
272 | absdir (int d) |
264 | { |
273 | { |
265 | return ((d - 1) & 7) + 1; |
274 | return ((d - 1) & 7) + 1; |
266 | } |
275 | } |
267 | |
276 | |
268 | // avoid ctz name because netbsd or freebsd spams it's namespace with it |
|
|
269 | #if GCC_VERSION(3,4) |
|
|
270 | static inline int least_significant_bit (uint32_t x) |
|
|
271 | { |
|
|
272 | return __builtin_ctz (x); |
|
|
273 | } |
|
|
274 | #else |
|
|
275 | int least_significant_bit (uint32_t x); |
|
|
276 | #endif |
|
|
277 | |
|
|
278 | #define for_all_bits_sparse_32(mask, idxvar) \ |
277 | #define for_all_bits_sparse_32(mask, idxvar) \ |
279 | for (uint32_t idxvar, mask_ = mask; \ |
278 | for (uint32_t idxvar, mask_ = mask; \ |
280 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
279 | mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);) |
281 | |
280 | |
282 | extern ssize_t slice_alloc; // statistics |
281 | extern ssize_t slice_alloc; // statistics |
283 | |
282 | |
284 | void *salloc_ (int n) throw (std::bad_alloc); |
283 | void *salloc_ (int n); |
285 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
284 | void *salloc_ (int n, void *src); |
286 | |
285 | |
287 | // strictly the same as g_slice_alloc, but never returns 0 |
286 | // strictly the same as g_slice_alloc, but never returns 0 |
288 | template<typename T> |
287 | template<typename T> |
289 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
288 | inline T *salloc (int n = 1) { return (T *)salloc_ (n * sizeof (T)); } |
290 | |
289 | |
291 | // also copies src into the new area, like "memdup" |
290 | // also copies src into the new area, like "memdup" |
292 | // if src is 0, clears the memory |
291 | // if src is 0, clears the memory |
293 | template<typename T> |
292 | template<typename T> |
294 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
293 | inline T *salloc (int n, T *src) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
295 | |
294 | |
296 | // clears the memory |
295 | // clears the memory |
297 | template<typename T> |
296 | template<typename T> |
298 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
297 | inline T *salloc0(int n = 1) { return (T *)salloc_ (n * sizeof (T), 0); } |
299 | |
298 | |
300 | // for symmetry |
299 | // for symmetry |
301 | template<typename T> |
300 | template<typename T> |
302 | inline void sfree (T *ptr, int n = 1) throw () |
301 | inline void sfree (T *ptr, int n = 1) noexcept |
303 | { |
302 | { |
304 | if (expect_true (ptr)) |
303 | if (expect_true (ptr)) |
305 | { |
304 | { |
306 | slice_alloc -= n * sizeof (T); |
305 | slice_alloc -= n * sizeof (T); |
307 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
306 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
308 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
307 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
309 | assert (slice_alloc >= 0);//D |
|
|
310 | } |
308 | } |
311 | } |
309 | } |
312 | |
310 | |
313 | // nulls the pointer |
311 | // nulls the pointer |
314 | template<typename T> |
312 | template<typename T> |
315 | inline void sfree0 (T *&ptr, int n = 1) throw () |
313 | inline void sfree0 (T *&ptr, int n = 1) noexcept |
316 | { |
314 | { |
317 | sfree<T> (ptr, n); |
315 | sfree<T> (ptr, n); |
318 | ptr = 0; |
316 | ptr = 0; |
319 | } |
317 | } |
320 | |
318 | |
… | |
… | |
388 | typedef const Tp *const_pointer; |
386 | typedef const Tp *const_pointer; |
389 | typedef Tp &reference; |
387 | typedef Tp &reference; |
390 | typedef const Tp &const_reference; |
388 | typedef const Tp &const_reference; |
391 | typedef Tp value_type; |
389 | typedef Tp value_type; |
392 | |
390 | |
393 | template <class U> |
391 | template <class U> |
394 | struct rebind |
392 | struct rebind |
395 | { |
393 | { |
396 | typedef slice_allocator<U> other; |
394 | typedef slice_allocator<U> other; |
397 | }; |
395 | }; |
398 | |
396 | |
399 | slice_allocator () throw () { } |
397 | slice_allocator () noexcept { } |
400 | slice_allocator (const slice_allocator &) throw () { } |
398 | slice_allocator (const slice_allocator &) noexcept { } |
401 | template<typename Tp2> |
399 | template<typename Tp2> |
402 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
400 | slice_allocator (const slice_allocator<Tp2> &) noexcept { } |
403 | |
401 | |
404 | ~slice_allocator () { } |
402 | ~slice_allocator () { } |
405 | |
403 | |
406 | pointer address (reference x) const { return &x; } |
404 | pointer address (reference x) const { return &x; } |
407 | const_pointer address (const_reference x) const { return &x; } |
405 | const_pointer address (const_reference x) const { return &x; } |
… | |
… | |
414 | void deallocate (pointer p, size_type n) |
412 | void deallocate (pointer p, size_type n) |
415 | { |
413 | { |
416 | sfree<Tp> (p, n); |
414 | sfree<Tp> (p, n); |
417 | } |
415 | } |
418 | |
416 | |
419 | size_type max_size () const throw () |
417 | size_type max_size () const noexcept |
420 | { |
418 | { |
421 | return size_t (-1) / sizeof (Tp); |
419 | return size_t (-1) / sizeof (Tp); |
422 | } |
420 | } |
423 | |
421 | |
424 | void construct (pointer p, const Tp &val) |
422 | void construct (pointer p, const Tp &val) |
… | |
… | |
427 | } |
425 | } |
428 | |
426 | |
429 | void destroy (pointer p) |
427 | void destroy (pointer p) |
430 | { |
428 | { |
431 | p->~Tp (); |
429 | p->~Tp (); |
|
|
430 | } |
|
|
431 | }; |
|
|
432 | |
|
|
433 | // basically a memory area, but refcounted |
|
|
434 | struct refcnt_buf |
|
|
435 | { |
|
|
436 | char *data; |
|
|
437 | |
|
|
438 | refcnt_buf (size_t size = 0); |
|
|
439 | refcnt_buf (void *data, size_t size); |
|
|
440 | |
|
|
441 | refcnt_buf (const refcnt_buf &src) |
|
|
442 | { |
|
|
443 | data = src.data; |
|
|
444 | inc (); |
|
|
445 | } |
|
|
446 | |
|
|
447 | ~refcnt_buf (); |
|
|
448 | |
|
|
449 | refcnt_buf &operator =(const refcnt_buf &src); |
|
|
450 | |
|
|
451 | operator char *() |
|
|
452 | { |
|
|
453 | return data; |
|
|
454 | } |
|
|
455 | |
|
|
456 | size_t size () const |
|
|
457 | { |
|
|
458 | return _size (); |
|
|
459 | } |
|
|
460 | |
|
|
461 | protected: |
|
|
462 | enum { |
|
|
463 | overhead = sizeof (uint32_t) * 2 |
|
|
464 | }; |
|
|
465 | |
|
|
466 | uint32_t &_size () const |
|
|
467 | { |
|
|
468 | return ((unsigned int *)data)[-2]; |
|
|
469 | } |
|
|
470 | |
|
|
471 | uint32_t &_refcnt () const |
|
|
472 | { |
|
|
473 | return ((unsigned int *)data)[-1]; |
|
|
474 | } |
|
|
475 | |
|
|
476 | void _alloc (uint32_t size) |
|
|
477 | { |
|
|
478 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
|
|
479 | _size () = size; |
|
|
480 | _refcnt () = 1; |
|
|
481 | } |
|
|
482 | |
|
|
483 | void _dealloc (); |
|
|
484 | |
|
|
485 | void inc () |
|
|
486 | { |
|
|
487 | ++_refcnt (); |
|
|
488 | } |
|
|
489 | |
|
|
490 | void dec () |
|
|
491 | { |
|
|
492 | if (!--_refcnt ()) |
|
|
493 | _dealloc (); |
432 | } |
494 | } |
433 | }; |
495 | }; |
434 | |
496 | |
435 | INTERFACE_CLASS (attachable) |
497 | INTERFACE_CLASS (attachable) |
436 | struct refcnt_base |
498 | struct refcnt_base |
… | |
… | |
453 | // p if not null |
515 | // p if not null |
454 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
516 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
455 | |
517 | |
456 | void refcnt_dec () |
518 | void refcnt_dec () |
457 | { |
519 | { |
458 | if (!is_constant (p)) |
520 | if (!ecb_is_constant (p)) |
459 | --*refcnt_ref (); |
521 | --*refcnt_ref (); |
460 | else if (p) |
522 | else if (p) |
461 | --p->refcnt; |
523 | --p->refcnt; |
462 | } |
524 | } |
463 | |
525 | |
464 | void refcnt_inc () |
526 | void refcnt_inc () |
465 | { |
527 | { |
466 | if (!is_constant (p)) |
528 | if (!ecb_is_constant (p)) |
467 | ++*refcnt_ref (); |
529 | ++*refcnt_ref (); |
468 | else if (p) |
530 | else if (p) |
469 | ++p->refcnt; |
531 | ++p->refcnt; |
470 | } |
532 | } |
471 | |
533 | |
… | |
… | |
514 | // with good distribution. |
576 | // with good distribution. |
515 | // FNV-1a is faster on many cpus because the multiplication |
577 | // FNV-1a is faster on many cpus because the multiplication |
516 | // runs concurrently with the looping logic. |
578 | // runs concurrently with the looping logic. |
517 | // we modify the hash a bit to improve its distribution |
579 | // we modify the hash a bit to improve its distribution |
518 | uint32_t hash = STRHSH_NULL; |
580 | uint32_t hash = STRHSH_NULL; |
519 | |
581 | |
520 | while (*s) |
582 | while (*s) |
521 | hash = (hash ^ *s++) * 16777619U; |
583 | hash = (hash ^ *s++) * 16777619U; |
522 | |
584 | |
523 | return hash ^ (hash >> 16); |
585 | return hash ^ (hash >> 16); |
524 | } |
586 | } |
525 | |
587 | |
526 | static inline uint32_t |
588 | static inline uint32_t |
527 | memhsh (const char *s, size_t len) |
589 | memhsh (const char *s, size_t len) |
528 | { |
590 | { |
529 | uint32_t hash = STRHSH_NULL; |
591 | uint32_t hash = STRHSH_NULL; |
530 | |
592 | |
531 | while (len--) |
593 | while (len--) |
532 | hash = (hash ^ *s++) * 16777619U; |
594 | hash = (hash ^ *s++) * 16777619U; |
533 | |
595 | |
534 | return hash; |
596 | return hash; |
535 | } |
597 | } |
… | |
… | |
543 | |
605 | |
544 | std::size_t operator ()(const shstr &s) const |
606 | std::size_t operator ()(const shstr &s) const |
545 | { |
607 | { |
546 | return strhsh (s); |
608 | return strhsh (s); |
547 | } |
609 | } |
|
|
610 | |
|
|
611 | typedef ska::power_of_two_hash_policy hash_policy; |
548 | }; |
612 | }; |
549 | |
613 | |
550 | struct str_equal |
614 | struct str_equal |
551 | { |
615 | { |
552 | bool operator ()(const char *a, const char *b) const |
616 | bool operator ()(const char *a, const char *b) const |
… | |
… | |
578 | } |
642 | } |
579 | }; |
643 | }; |
580 | |
644 | |
581 | // This container blends advantages of linked lists |
645 | // This container blends advantages of linked lists |
582 | // (efficiency) with vectors (random access) by |
646 | // (efficiency) with vectors (random access) by |
583 | // by using an unordered vector and storing the vector |
647 | // using an unordered vector and storing the vector |
584 | // index inside the object. |
648 | // index inside the object. |
585 | // |
649 | // |
586 | // + memory-efficient on most 64 bit archs |
650 | // + memory-efficient on most 64 bit archs |
587 | // + O(1) insert/remove |
651 | // + O(1) insert/remove |
588 | // + free unique (but varying) id for inserted objects |
652 | // + free unique (but varying) id for inserted objects |
… | |
… | |
625 | insert (&obj); |
689 | insert (&obj); |
626 | } |
690 | } |
627 | |
691 | |
628 | void erase (T *obj) |
692 | void erase (T *obj) |
629 | { |
693 | { |
630 | unsigned int pos = obj->*indexmember; |
694 | object_vector_index pos = obj->*indexmember; |
631 | obj->*indexmember = 0; |
695 | obj->*indexmember = 0; |
632 | |
696 | |
633 | if (pos < this->size ()) |
697 | if (pos < this->size ()) |
634 | { |
698 | { |
635 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
699 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
731 | |
795 | |
732 | int similar_direction (int a, int b); |
796 | int similar_direction (int a, int b); |
733 | |
797 | |
734 | // like v?sprintf, but returns a "static" buffer |
798 | // like v?sprintf, but returns a "static" buffer |
735 | char *vformat (const char *format, va_list ap); |
799 | char *vformat (const char *format, va_list ap); |
736 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
800 | char *format (const char *format, ...) ecb_attribute ((format (printf, 1, 2))); |
737 | |
801 | |
738 | // safety-check player input which will become object->msg |
802 | // safety-check player input which will become object->msg |
739 | bool msg_is_safe (const char *msg); |
803 | bool msg_is_safe (const char *msg); |
740 | |
804 | |
741 | ///////////////////////////////////////////////////////////////////////////// |
805 | ///////////////////////////////////////////////////////////////////////////// |