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,2009,2010 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 |
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) |
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> |
62 | template<typename T, int N> |
63 | static inline int array_length (const T (&arr)[N]) |
63 | static inline int array_length (const T (&arr)[N]) |
64 | { |
64 | { |
65 | return N; |
65 | return N; |
… | |
… | |
86 | void cleanup (const char *cause, bool make_core = false); |
86 | void cleanup (const char *cause, bool make_core = false); |
87 | void fork_abort (const char *msg); |
87 | void fork_abort (const char *msg); |
88 | |
88 | |
89 | // 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, |
90 | // 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. |
91 | 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; } |
92 | 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; } |
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; } |
93 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
94 | |
94 | |
95 | 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); } |
96 | 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); } |
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); } |
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); } |
… | |
… | |
114 | |
114 | |
115 | // sign0 returns -1, 0 or +1 |
115 | // sign0 returns -1, 0 or +1 |
116 | template<typename T> |
116 | template<typename T> |
117 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
117 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
118 | |
118 | |
|
|
119 | //clashes with C++0x |
119 | template<typename T, typename U> |
120 | template<typename T, typename U> |
120 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
121 | static inline T copysign (T a, U b) { return a > 0 ? b : -b; } |
121 | |
122 | |
122 | // div* only work correctly for div > 0 |
123 | // div* only work correctly for div > 0 |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
124 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
… | |
… | |
236 | #if 0 |
237 | #if 0 |
237 | // 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. |
238 | #else |
239 | #else |
239 | // 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. |
240 | #endif |
241 | #endif |
241 | inline int |
242 | inline int |
242 | idistance (int dx, int dy) |
243 | idistance (int dx, int dy) |
243 | { |
244 | { |
244 | unsigned int dx_ = abs (dx); |
245 | unsigned int dx_ = abs (dx); |
245 | unsigned int dy_ = abs (dy); |
246 | unsigned int dy_ = abs (dy); |
246 | |
247 | |
247 | #if 0 |
248 | #if 0 |
248 | return dx_ > dy_ |
249 | return dx_ > dy_ |
… | |
… | |
251 | #else |
252 | #else |
252 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
253 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
253 | #endif |
254 | #endif |
254 | } |
255 | } |
255 | |
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 | |
256 | /* |
277 | /* |
257 | * absdir(int): Returns a number between 1 and 8, which represent |
278 | * absdir(int): Returns a number between 1 and 8, which represent |
258 | * the "absolute" direction of a number (it actually takes care of |
279 | * the "absolute" direction of a number (it actually takes care of |
259 | * "overflow" in previous calculations of a direction). |
280 | * "overflow" in previous calculations of a direction). |
260 | */ |
281 | */ |
… | |
… | |
278 | for (uint32_t idxvar, mask_ = mask; \ |
299 | for (uint32_t idxvar, mask_ = mask; \ |
279 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
300 | mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);) |
280 | |
301 | |
281 | extern ssize_t slice_alloc; // statistics |
302 | extern ssize_t slice_alloc; // statistics |
282 | |
303 | |
283 | void *salloc_ (int n) throw (std::bad_alloc); |
304 | void *salloc_ (int n); |
284 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
305 | void *salloc_ (int n, void *src); |
285 | |
306 | |
286 | // strictly the same as g_slice_alloc, but never returns 0 |
307 | // strictly the same as g_slice_alloc, but never returns 0 |
287 | template<typename T> |
308 | template<typename T> |
288 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
309 | inline T *salloc (int n = 1) { return (T *)salloc_ (n * sizeof (T)); } |
289 | |
310 | |
290 | // also copies src into the new area, like "memdup" |
311 | // also copies src into the new area, like "memdup" |
291 | // if src is 0, clears the memory |
312 | // if src is 0, clears the memory |
292 | template<typename T> |
313 | template<typename T> |
293 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
314 | inline T *salloc (int n, T *src) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
294 | |
315 | |
295 | // clears the memory |
316 | // clears the memory |
296 | template<typename T> |
317 | template<typename T> |
297 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
318 | inline T *salloc0(int n = 1) { return (T *)salloc_ (n * sizeof (T), 0); } |
298 | |
319 | |
299 | // for symmetry |
320 | // for symmetry |
300 | template<typename T> |
321 | template<typename T> |
301 | inline void sfree (T *ptr, int n = 1) throw () |
322 | inline void sfree (T *ptr, int n = 1) noexcept |
302 | { |
323 | { |
303 | if (expect_true (ptr)) |
324 | if (expect_true (ptr)) |
304 | { |
325 | { |
305 | slice_alloc -= n * sizeof (T); |
326 | slice_alloc -= n * sizeof (T); |
306 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
327 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
307 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
328 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
308 | assert (slice_alloc >= 0);//D |
|
|
309 | } |
329 | } |
310 | } |
330 | } |
311 | |
331 | |
312 | // nulls the pointer |
332 | // nulls the pointer |
313 | template<typename T> |
333 | template<typename T> |
314 | inline void sfree0 (T *&ptr, int n = 1) throw () |
334 | inline void sfree0 (T *&ptr, int n = 1) noexcept |
315 | { |
335 | { |
316 | sfree<T> (ptr, n); |
336 | sfree<T> (ptr, n); |
317 | ptr = 0; |
337 | ptr = 0; |
318 | } |
338 | } |
319 | |
339 | |
… | |
… | |
387 | typedef const Tp *const_pointer; |
407 | typedef const Tp *const_pointer; |
388 | typedef Tp &reference; |
408 | typedef Tp &reference; |
389 | typedef const Tp &const_reference; |
409 | typedef const Tp &const_reference; |
390 | typedef Tp value_type; |
410 | typedef Tp value_type; |
391 | |
411 | |
392 | template <class U> |
412 | template <class U> |
393 | struct rebind |
413 | struct rebind |
394 | { |
414 | { |
395 | typedef slice_allocator<U> other; |
415 | typedef slice_allocator<U> other; |
396 | }; |
416 | }; |
397 | |
417 | |
398 | slice_allocator () throw () { } |
418 | slice_allocator () noexcept { } |
399 | slice_allocator (const slice_allocator &) throw () { } |
419 | slice_allocator (const slice_allocator &) noexcept { } |
400 | template<typename Tp2> |
420 | template<typename Tp2> |
401 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
421 | slice_allocator (const slice_allocator<Tp2> &) noexcept { } |
402 | |
422 | |
403 | ~slice_allocator () { } |
423 | ~slice_allocator () { } |
404 | |
424 | |
405 | pointer address (reference x) const { return &x; } |
425 | pointer address (reference x) const { return &x; } |
406 | const_pointer address (const_reference x) const { return &x; } |
426 | const_pointer address (const_reference x) const { return &x; } |
… | |
… | |
413 | void deallocate (pointer p, size_type n) |
433 | void deallocate (pointer p, size_type n) |
414 | { |
434 | { |
415 | sfree<Tp> (p, n); |
435 | sfree<Tp> (p, n); |
416 | } |
436 | } |
417 | |
437 | |
418 | size_type max_size () const throw () |
438 | size_type max_size () const noexcept |
419 | { |
439 | { |
420 | return size_t (-1) / sizeof (Tp); |
440 | return size_t (-1) / sizeof (Tp); |
421 | } |
441 | } |
422 | |
442 | |
423 | void construct (pointer p, const Tp &val) |
443 | void construct (pointer p, const Tp &val) |
… | |
… | |
426 | } |
446 | } |
427 | |
447 | |
428 | void destroy (pointer p) |
448 | void destroy (pointer p) |
429 | { |
449 | { |
430 | p->~Tp (); |
450 | p->~Tp (); |
|
|
451 | } |
|
|
452 | }; |
|
|
453 | |
|
|
454 | // basically a memory area, but refcounted |
|
|
455 | struct refcnt_buf |
|
|
456 | { |
|
|
457 | char *data; |
|
|
458 | |
|
|
459 | refcnt_buf (size_t size = 0); |
|
|
460 | refcnt_buf (void *data, size_t size); |
|
|
461 | |
|
|
462 | refcnt_buf (const refcnt_buf &src) |
|
|
463 | { |
|
|
464 | data = src.data; |
|
|
465 | inc (); |
|
|
466 | } |
|
|
467 | |
|
|
468 | ~refcnt_buf (); |
|
|
469 | |
|
|
470 | refcnt_buf &operator =(const refcnt_buf &src); |
|
|
471 | |
|
|
472 | operator char *() |
|
|
473 | { |
|
|
474 | return data; |
|
|
475 | } |
|
|
476 | |
|
|
477 | size_t size () const |
|
|
478 | { |
|
|
479 | return _size (); |
|
|
480 | } |
|
|
481 | |
|
|
482 | protected: |
|
|
483 | enum { |
|
|
484 | overhead = sizeof (uint32_t) * 2 |
|
|
485 | }; |
|
|
486 | |
|
|
487 | uint32_t &_size () const |
|
|
488 | { |
|
|
489 | return ((unsigned int *)data)[-2]; |
|
|
490 | } |
|
|
491 | |
|
|
492 | uint32_t &_refcnt () const |
|
|
493 | { |
|
|
494 | return ((unsigned int *)data)[-1]; |
|
|
495 | } |
|
|
496 | |
|
|
497 | void _alloc (uint32_t size) |
|
|
498 | { |
|
|
499 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
|
|
500 | _size () = size; |
|
|
501 | _refcnt () = 1; |
|
|
502 | } |
|
|
503 | |
|
|
504 | void _dealloc (); |
|
|
505 | |
|
|
506 | void inc () |
|
|
507 | { |
|
|
508 | ++_refcnt (); |
|
|
509 | } |
|
|
510 | |
|
|
511 | void dec () |
|
|
512 | { |
|
|
513 | if (!--_refcnt ()) |
|
|
514 | _dealloc (); |
431 | } |
515 | } |
432 | }; |
516 | }; |
433 | |
517 | |
434 | INTERFACE_CLASS (attachable) |
518 | INTERFACE_CLASS (attachable) |
435 | struct refcnt_base |
519 | struct refcnt_base |
… | |
… | |
513 | // with good distribution. |
597 | // with good distribution. |
514 | // FNV-1a is faster on many cpus because the multiplication |
598 | // FNV-1a is faster on many cpus because the multiplication |
515 | // runs concurrently with the looping logic. |
599 | // runs concurrently with the looping logic. |
516 | // we modify the hash a bit to improve its distribution |
600 | // we modify the hash a bit to improve its distribution |
517 | uint32_t hash = STRHSH_NULL; |
601 | uint32_t hash = STRHSH_NULL; |
518 | |
602 | |
519 | while (*s) |
603 | while (*s) |
520 | hash = (hash ^ *s++) * 16777619U; |
604 | hash = (hash ^ *s++) * 16777619U; |
521 | |
605 | |
522 | return hash ^ (hash >> 16); |
606 | return hash ^ (hash >> 16); |
523 | } |
607 | } |
524 | |
608 | |
525 | static inline uint32_t |
609 | static inline uint32_t |
526 | memhsh (const char *s, size_t len) |
610 | memhsh (const char *s, size_t len) |
527 | { |
611 | { |
528 | uint32_t hash = STRHSH_NULL; |
612 | uint32_t hash = STRHSH_NULL; |
529 | |
613 | |
530 | while (len--) |
614 | while (len--) |
531 | hash = (hash ^ *s++) * 16777619U; |
615 | hash = (hash ^ *s++) * 16777619U; |
532 | |
616 | |
533 | return hash; |
617 | return hash; |
534 | } |
618 | } |
… | |
… | |
577 | } |
661 | } |
578 | }; |
662 | }; |
579 | |
663 | |
580 | // This container blends advantages of linked lists |
664 | // This container blends advantages of linked lists |
581 | // (efficiency) with vectors (random access) by |
665 | // (efficiency) with vectors (random access) by |
582 | // by using an unordered vector and storing the vector |
666 | // using an unordered vector and storing the vector |
583 | // index inside the object. |
667 | // index inside the object. |
584 | // |
668 | // |
585 | // + memory-efficient on most 64 bit archs |
669 | // + memory-efficient on most 64 bit archs |
586 | // + O(1) insert/remove |
670 | // + O(1) insert/remove |
587 | // + free unique (but varying) id for inserted objects |
671 | // + free unique (but varying) id for inserted objects |
… | |
… | |
624 | insert (&obj); |
708 | insert (&obj); |
625 | } |
709 | } |
626 | |
710 | |
627 | void erase (T *obj) |
711 | void erase (T *obj) |
628 | { |
712 | { |
629 | unsigned int pos = obj->*indexmember; |
713 | object_vector_index pos = obj->*indexmember; |
630 | obj->*indexmember = 0; |
714 | obj->*indexmember = 0; |
631 | |
715 | |
632 | if (pos < this->size ()) |
716 | if (pos < this->size ()) |
633 | { |
717 | { |
634 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
718 | (*this)[pos - 1] = (*this)[this->size () - 1]; |