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,2011,2012 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 | |
60 | #if cplusplus_does_not_suck |
63 | #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) |
64 | // 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> |
65 | template<typename T, int N> |
63 | static inline int array_length (const T (&arr)[N]) |
66 | static inline int array_length (const T (&arr)[N]) |
64 | { |
67 | { |
65 | return N; |
68 | return N; |
… | |
… | |
81 | |
84 | |
82 | // in range excluding end |
85 | // in range excluding end |
83 | #define IN_RANGE_EXC(val,beg,end) \ |
86 | #define IN_RANGE_EXC(val,beg,end) \ |
84 | ((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)) |
85 | |
88 | |
86 | void cleanup (const char *cause, bool make_core = false); |
89 | ecb_cold void cleanup (const char *cause, bool make_core = false); |
87 | void fork_abort (const char *msg); |
90 | ecb_cold void fork_abort (const char *msg); |
88 | |
91 | |
89 | // 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, |
90 | // 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. |
91 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
94 | 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 a > (T)b ? a : (T)b; } |
95 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
… | |
… | |
237 | #if 0 |
240 | #if 0 |
238 | // 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. |
239 | #else |
242 | #else |
240 | // 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. |
241 | #endif |
244 | #endif |
242 | inline int |
245 | inline int |
243 | idistance (int dx, int dy) |
246 | idistance (int dx, int dy) |
244 | { |
247 | { |
245 | unsigned int dx_ = abs (dx); |
248 | unsigned int dx_ = abs (dx); |
246 | unsigned int dy_ = abs (dy); |
249 | unsigned int dy_ = abs (dy); |
247 | |
250 | |
248 | #if 0 |
251 | #if 0 |
249 | return dx_ > dy_ |
252 | return dx_ > dy_ |
… | |
… | |
283 | absdir (int d) |
286 | absdir (int d) |
284 | { |
287 | { |
285 | return ((d - 1) & 7) + 1; |
288 | return ((d - 1) & 7) + 1; |
286 | } |
289 | } |
287 | |
290 | |
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) \ |
291 | #define for_all_bits_sparse_32(mask, idxvar) \ |
299 | for (uint32_t idxvar, mask_ = mask; \ |
292 | for (uint32_t idxvar, mask_ = mask; \ |
300 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
293 | mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);) |
301 | |
294 | |
302 | extern ssize_t slice_alloc; // statistics |
295 | extern ssize_t slice_alloc; // statistics |
303 | |
296 | |
304 | void *salloc_ (int n) throw (std::bad_alloc); |
297 | void *salloc_ (int n); |
305 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
298 | void *salloc_ (int n, void *src); |
306 | |
299 | |
307 | // strictly the same as g_slice_alloc, but never returns 0 |
300 | // strictly the same as g_slice_alloc, but never returns 0 |
308 | template<typename T> |
301 | template<typename T> |
309 | 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)); } |
310 | |
303 | |
311 | // also copies src into the new area, like "memdup" |
304 | // also copies src into the new area, like "memdup" |
312 | // if src is 0, clears the memory |
305 | // if src is 0, clears the memory |
313 | template<typename T> |
306 | template<typename T> |
314 | 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); } |
315 | |
308 | |
316 | // clears the memory |
309 | // clears the memory |
317 | template<typename T> |
310 | template<typename T> |
318 | 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); } |
319 | |
312 | |
320 | // for symmetry |
313 | // for symmetry |
321 | template<typename T> |
314 | template<typename T> |
322 | inline void sfree (T *ptr, int n = 1) throw () |
315 | inline void sfree (T *ptr, int n = 1) noexcept |
323 | { |
316 | { |
324 | if (expect_true (ptr)) |
317 | if (expect_true (ptr)) |
325 | { |
318 | { |
326 | slice_alloc -= n * sizeof (T); |
319 | slice_alloc -= n * sizeof (T); |
327 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
320 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
… | |
… | |
329 | } |
322 | } |
330 | } |
323 | } |
331 | |
324 | |
332 | // nulls the pointer |
325 | // nulls the pointer |
333 | template<typename T> |
326 | template<typename T> |
334 | inline void sfree0 (T *&ptr, int n = 1) throw () |
327 | inline void sfree0 (T *&ptr, int n = 1) noexcept |
335 | { |
328 | { |
336 | sfree<T> (ptr, n); |
329 | sfree<T> (ptr, n); |
337 | ptr = 0; |
330 | ptr = 0; |
338 | } |
331 | } |
339 | |
332 | |
… | |
… | |
407 | typedef const Tp *const_pointer; |
400 | typedef const Tp *const_pointer; |
408 | typedef Tp &reference; |
401 | typedef Tp &reference; |
409 | typedef const Tp &const_reference; |
402 | typedef const Tp &const_reference; |
410 | typedef Tp value_type; |
403 | typedef Tp value_type; |
411 | |
404 | |
412 | template <class U> |
405 | template <class U> |
413 | struct rebind |
406 | struct rebind |
414 | { |
407 | { |
415 | typedef slice_allocator<U> other; |
408 | typedef slice_allocator<U> other; |
416 | }; |
409 | }; |
417 | |
410 | |
418 | slice_allocator () throw () { } |
411 | slice_allocator () noexcept { } |
419 | slice_allocator (const slice_allocator &) throw () { } |
412 | slice_allocator (const slice_allocator &) noexcept { } |
420 | template<typename Tp2> |
413 | template<typename Tp2> |
421 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
414 | slice_allocator (const slice_allocator<Tp2> &) noexcept { } |
422 | |
415 | |
423 | ~slice_allocator () { } |
416 | ~slice_allocator () { } |
424 | |
417 | |
425 | pointer address (reference x) const { return &x; } |
418 | pointer address (reference x) const { return &x; } |
426 | const_pointer address (const_reference x) const { return &x; } |
419 | const_pointer address (const_reference x) const { return &x; } |
… | |
… | |
433 | void deallocate (pointer p, size_type n) |
426 | void deallocate (pointer p, size_type n) |
434 | { |
427 | { |
435 | sfree<Tp> (p, n); |
428 | sfree<Tp> (p, n); |
436 | } |
429 | } |
437 | |
430 | |
438 | size_type max_size () const throw () |
431 | size_type max_size () const noexcept |
439 | { |
432 | { |
440 | return size_t (-1) / sizeof (Tp); |
433 | return size_t (-1) / sizeof (Tp); |
441 | } |
434 | } |
442 | |
435 | |
443 | void construct (pointer p, const Tp &val) |
436 | void construct (pointer p, const Tp &val) |
… | |
… | |
460 | refcnt_buf (void *data, size_t size); |
453 | refcnt_buf (void *data, size_t size); |
461 | |
454 | |
462 | refcnt_buf (const refcnt_buf &src) |
455 | refcnt_buf (const refcnt_buf &src) |
463 | { |
456 | { |
464 | data = src.data; |
457 | data = src.data; |
465 | ++_refcnt (); |
458 | inc (); |
466 | } |
459 | } |
467 | |
460 | |
468 | ~refcnt_buf (); |
461 | ~refcnt_buf (); |
469 | |
462 | |
470 | refcnt_buf &operator =(const refcnt_buf &src); |
463 | refcnt_buf &operator =(const refcnt_buf &src); |
… | |
… | |
479 | return _size (); |
472 | return _size (); |
480 | } |
473 | } |
481 | |
474 | |
482 | protected: |
475 | protected: |
483 | enum { |
476 | enum { |
484 | overhead = sizeof (unsigned int) * 2 |
477 | overhead = sizeof (uint32_t) * 2 |
485 | }; |
478 | }; |
486 | |
479 | |
487 | unsigned int &_size () const |
480 | uint32_t &_size () const |
488 | { |
481 | { |
489 | return ((unsigned int *)data)[-2]; |
482 | return ((unsigned int *)data)[-2]; |
490 | } |
483 | } |
491 | |
484 | |
492 | unsigned int &_refcnt () const |
485 | uint32_t &_refcnt () const |
493 | { |
486 | { |
494 | return ((unsigned int *)data)[-1]; |
487 | return ((unsigned int *)data)[-1]; |
495 | } |
488 | } |
496 | |
489 | |
497 | void _alloc (unsigned int size) |
490 | void _alloc (uint32_t size) |
498 | { |
491 | { |
499 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
492 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
500 | _size () = size; |
493 | _size () = size; |
501 | _refcnt () = 1; |
494 | _refcnt () = 1; |
502 | } |
495 | } |
503 | |
496 | |
|
|
497 | void _dealloc (); |
|
|
498 | |
|
|
499 | void inc () |
|
|
500 | { |
|
|
501 | ++_refcnt (); |
|
|
502 | } |
|
|
503 | |
504 | void dec () |
504 | void dec () |
505 | { |
505 | { |
506 | if (!--_refcnt ()) |
506 | if (!--_refcnt ()) |
507 | sfree<char> (data - overhead, size () + overhead); |
507 | _dealloc (); |
508 | } |
508 | } |
509 | }; |
509 | }; |
510 | |
510 | |
511 | INTERFACE_CLASS (attachable) |
511 | INTERFACE_CLASS (attachable) |
512 | struct refcnt_base |
512 | struct refcnt_base |
… | |
… | |
529 | // p if not null |
529 | // p if not null |
530 | 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; } |
531 | |
531 | |
532 | void refcnt_dec () |
532 | void refcnt_dec () |
533 | { |
533 | { |
534 | if (!is_constant (p)) |
534 | if (!ecb_is_constant (p)) |
535 | --*refcnt_ref (); |
535 | --*refcnt_ref (); |
536 | else if (p) |
536 | else if (p) |
537 | --p->refcnt; |
537 | --p->refcnt; |
538 | } |
538 | } |
539 | |
539 | |
540 | void refcnt_inc () |
540 | void refcnt_inc () |
541 | { |
541 | { |
542 | if (!is_constant (p)) |
542 | if (!ecb_is_constant (p)) |
543 | ++*refcnt_ref (); |
543 | ++*refcnt_ref (); |
544 | else if (p) |
544 | else if (p) |
545 | ++p->refcnt; |
545 | ++p->refcnt; |
546 | } |
546 | } |
547 | |
547 | |
… | |
… | |
590 | // with good distribution. |
590 | // with good distribution. |
591 | // FNV-1a is faster on many cpus because the multiplication |
591 | // FNV-1a is faster on many cpus because the multiplication |
592 | // runs concurrently with the looping logic. |
592 | // runs concurrently with the looping logic. |
593 | // we modify the hash a bit to improve its distribution |
593 | // we modify the hash a bit to improve its distribution |
594 | uint32_t hash = STRHSH_NULL; |
594 | uint32_t hash = STRHSH_NULL; |
595 | |
595 | |
596 | while (*s) |
596 | while (*s) |
597 | hash = (hash ^ *s++) * 16777619U; |
597 | hash = (hash ^ *s++) * 16777619U; |
598 | |
598 | |
599 | return hash ^ (hash >> 16); |
599 | return hash ^ (hash >> 16); |
600 | } |
600 | } |
601 | |
601 | |
602 | static inline uint32_t |
602 | static inline uint32_t |
603 | memhsh (const char *s, size_t len) |
603 | memhsh (const char *s, size_t len) |
604 | { |
604 | { |
605 | uint32_t hash = STRHSH_NULL; |
605 | uint32_t hash = STRHSH_NULL; |
606 | |
606 | |
607 | while (len--) |
607 | while (len--) |
608 | hash = (hash ^ *s++) * 16777619U; |
608 | hash = (hash ^ *s++) * 16777619U; |
609 | |
609 | |
610 | return hash; |
610 | return hash; |
611 | } |
611 | } |
… | |
… | |
619 | |
619 | |
620 | std::size_t operator ()(const shstr &s) const |
620 | std::size_t operator ()(const shstr &s) const |
621 | { |
621 | { |
622 | return strhsh (s); |
622 | return strhsh (s); |
623 | } |
623 | } |
|
|
624 | |
|
|
625 | typedef ska::power_of_two_hash_policy hash_policy; |
624 | }; |
626 | }; |
625 | |
627 | |
626 | struct str_equal |
628 | struct str_equal |
627 | { |
629 | { |
628 | bool operator ()(const char *a, const char *b) const |
630 | bool operator ()(const char *a, const char *b) const |
… | |
… | |
654 | } |
656 | } |
655 | }; |
657 | }; |
656 | |
658 | |
657 | // This container blends advantages of linked lists |
659 | // This container blends advantages of linked lists |
658 | // (efficiency) with vectors (random access) by |
660 | // (efficiency) with vectors (random access) by |
659 | // by using an unordered vector and storing the vector |
661 | // using an unordered vector and storing the vector |
660 | // index inside the object. |
662 | // index inside the object. |
661 | // |
663 | // |
662 | // + memory-efficient on most 64 bit archs |
664 | // + memory-efficient on most 64 bit archs |
663 | // + O(1) insert/remove |
665 | // + O(1) insert/remove |
664 | // + free unique (but varying) id for inserted objects |
666 | // + free unique (but varying) id for inserted objects |
… | |
… | |
701 | insert (&obj); |
703 | insert (&obj); |
702 | } |
704 | } |
703 | |
705 | |
704 | void erase (T *obj) |
706 | void erase (T *obj) |
705 | { |
707 | { |
706 | unsigned int pos = obj->*indexmember; |
708 | object_vector_index pos = obj->*indexmember; |
707 | obj->*indexmember = 0; |
709 | obj->*indexmember = 0; |
708 | |
710 | |
709 | if (pos < this->size ()) |
711 | if (pos < this->size ()) |
710 | { |
712 | { |
711 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
713 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
807 | |
809 | |
808 | int similar_direction (int a, int b); |
810 | int similar_direction (int a, int b); |
809 | |
811 | |
810 | // like v?sprintf, but returns a "static" buffer |
812 | // like v?sprintf, but returns a "static" buffer |
811 | char *vformat (const char *format, va_list ap); |
813 | char *vformat (const char *format, va_list ap); |
812 | char *format (const char *format, ...) attribute ((format (printf, 1, 2))); |
814 | char *format (const char *format, ...) ecb_attribute ((format (printf, 1, 2))); |
813 | |
815 | |
814 | // safety-check player input which will become object->msg |
816 | // safety-check player input which will become object->msg |
815 | bool msg_is_safe (const char *msg); |
817 | bool msg_is_safe (const char *msg); |
816 | |
818 | |
817 | ///////////////////////////////////////////////////////////////////////////// |
819 | ///////////////////////////////////////////////////////////////////////////// |