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,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 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__ |
… | |
… | |
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); } |
… | |
… | |
237 | #if 0 |
237 | #if 0 |
238 | // 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. |
239 | #else |
239 | #else |
240 | // 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. |
241 | #endif |
241 | #endif |
242 | inline int |
242 | inline int |
243 | idistance (int dx, int dy) |
243 | idistance (int dx, int dy) |
244 | { |
244 | { |
245 | unsigned int dx_ = abs (dx); |
245 | unsigned int dx_ = abs (dx); |
246 | unsigned int dy_ = abs (dy); |
246 | unsigned int dy_ = abs (dy); |
247 | |
247 | |
248 | #if 0 |
248 | #if 0 |
249 | return dx_ > dy_ |
249 | return dx_ > dy_ |
… | |
… | |
324 | if (expect_true (ptr)) |
324 | if (expect_true (ptr)) |
325 | { |
325 | { |
326 | slice_alloc -= n * sizeof (T); |
326 | slice_alloc -= n * sizeof (T); |
327 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
327 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
328 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
328 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
329 | assert (slice_alloc >= 0);//D |
|
|
330 | } |
329 | } |
331 | } |
330 | } |
332 | |
331 | |
333 | // nulls the pointer |
332 | // nulls the pointer |
334 | template<typename T> |
333 | template<typename T> |
… | |
… | |
408 | typedef const Tp *const_pointer; |
407 | typedef const Tp *const_pointer; |
409 | typedef Tp &reference; |
408 | typedef Tp &reference; |
410 | typedef const Tp &const_reference; |
409 | typedef const Tp &const_reference; |
411 | typedef Tp value_type; |
410 | typedef Tp value_type; |
412 | |
411 | |
413 | template <class U> |
412 | template <class U> |
414 | struct rebind |
413 | struct rebind |
415 | { |
414 | { |
416 | typedef slice_allocator<U> other; |
415 | typedef slice_allocator<U> other; |
417 | }; |
416 | }; |
418 | |
417 | |
… | |
… | |
447 | } |
446 | } |
448 | |
447 | |
449 | void destroy (pointer p) |
448 | void destroy (pointer p) |
450 | { |
449 | { |
451 | 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 (); |
452 | } |
515 | } |
453 | }; |
516 | }; |
454 | |
517 | |
455 | INTERFACE_CLASS (attachable) |
518 | INTERFACE_CLASS (attachable) |
456 | struct refcnt_base |
519 | struct refcnt_base |
… | |
… | |
534 | // with good distribution. |
597 | // with good distribution. |
535 | // FNV-1a is faster on many cpus because the multiplication |
598 | // FNV-1a is faster on many cpus because the multiplication |
536 | // runs concurrently with the looping logic. |
599 | // runs concurrently with the looping logic. |
537 | // we modify the hash a bit to improve its distribution |
600 | // we modify the hash a bit to improve its distribution |
538 | uint32_t hash = STRHSH_NULL; |
601 | uint32_t hash = STRHSH_NULL; |
539 | |
602 | |
540 | while (*s) |
603 | while (*s) |
541 | hash = (hash ^ *s++) * 16777619U; |
604 | hash = (hash ^ *s++) * 16777619U; |
542 | |
605 | |
543 | return hash ^ (hash >> 16); |
606 | return hash ^ (hash >> 16); |
544 | } |
607 | } |
545 | |
608 | |
546 | static inline uint32_t |
609 | static inline uint32_t |
547 | memhsh (const char *s, size_t len) |
610 | memhsh (const char *s, size_t len) |
548 | { |
611 | { |
549 | uint32_t hash = STRHSH_NULL; |
612 | uint32_t hash = STRHSH_NULL; |
550 | |
613 | |
551 | while (len--) |
614 | while (len--) |
552 | hash = (hash ^ *s++) * 16777619U; |
615 | hash = (hash ^ *s++) * 16777619U; |
553 | |
616 | |
554 | return hash; |
617 | return hash; |
555 | } |
618 | } |
… | |
… | |
598 | } |
661 | } |
599 | }; |
662 | }; |
600 | |
663 | |
601 | // This container blends advantages of linked lists |
664 | // This container blends advantages of linked lists |
602 | // (efficiency) with vectors (random access) by |
665 | // (efficiency) with vectors (random access) by |
603 | // by using an unordered vector and storing the vector |
666 | // using an unordered vector and storing the vector |
604 | // index inside the object. |
667 | // index inside the object. |
605 | // |
668 | // |
606 | // + memory-efficient on most 64 bit archs |
669 | // + memory-efficient on most 64 bit archs |
607 | // + O(1) insert/remove |
670 | // + O(1) insert/remove |
608 | // + free unique (but varying) id for inserted objects |
671 | // + free unique (but varying) id for inserted objects |
… | |
… | |
645 | insert (&obj); |
708 | insert (&obj); |
646 | } |
709 | } |
647 | |
710 | |
648 | void erase (T *obj) |
711 | void erase (T *obj) |
649 | { |
712 | { |
650 | unsigned int pos = obj->*indexmember; |
713 | object_vector_index pos = obj->*indexmember; |
651 | obj->*indexmember = 0; |
714 | obj->*indexmember = 0; |
652 | |
715 | |
653 | if (pos < this->size ()) |
716 | if (pos < this->size ()) |
654 | { |
717 | { |
655 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
718 | (*this)[pos - 1] = (*this)[this->size () - 1]; |