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. |
… | |
… | |
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); } |
… | |
… | |
252 | #else |
252 | #else |
253 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
253 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
254 | #endif |
254 | #endif |
255 | } |
255 | } |
256 | |
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 | |
257 | /* |
277 | /* |
258 | * absdir(int): Returns a number between 1 and 8, which represent |
278 | * absdir(int): Returns a number between 1 and 8, which represent |
259 | * the "absolute" direction of a number (it actually takes care of |
279 | * the "absolute" direction of a number (it actually takes care of |
260 | * "overflow" in previous calculations of a direction). |
280 | * "overflow" in previous calculations of a direction). |
261 | */ |
281 | */ |
… | |
… | |
304 | if (expect_true (ptr)) |
324 | if (expect_true (ptr)) |
305 | { |
325 | { |
306 | slice_alloc -= n * sizeof (T); |
326 | slice_alloc -= n * sizeof (T); |
307 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
327 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
308 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
328 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
309 | assert (slice_alloc >= 0);//D |
|
|
310 | } |
329 | } |
311 | } |
330 | } |
312 | |
331 | |
313 | // nulls the pointer |
332 | // nulls the pointer |
314 | template<typename T> |
333 | template<typename T> |
… | |
… | |
427 | } |
446 | } |
428 | |
447 | |
429 | void destroy (pointer p) |
448 | void destroy (pointer p) |
430 | { |
449 | { |
431 | 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 | ++_refcnt (); |
|
|
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 (unsigned int) * 2 |
|
|
485 | }; |
|
|
486 | |
|
|
487 | unsigned int &_size () const |
|
|
488 | { |
|
|
489 | return ((unsigned int *)data)[-2]; |
|
|
490 | } |
|
|
491 | |
|
|
492 | unsigned int &_refcnt () const |
|
|
493 | { |
|
|
494 | return ((unsigned int *)data)[-1]; |
|
|
495 | } |
|
|
496 | |
|
|
497 | void _alloc (unsigned int size) |
|
|
498 | { |
|
|
499 | data = ((char *)salloc<char> (size + overhead)) + overhead; |
|
|
500 | _size () = size; |
|
|
501 | _refcnt () = 1; |
|
|
502 | } |
|
|
503 | |
|
|
504 | void dec () |
|
|
505 | { |
|
|
506 | if (!--_refcnt ()) |
|
|
507 | sfree<char> (data - overhead, size () + overhead); |
432 | } |
508 | } |
433 | }; |
509 | }; |
434 | |
510 | |
435 | INTERFACE_CLASS (attachable) |
511 | INTERFACE_CLASS (attachable) |
436 | struct refcnt_base |
512 | struct refcnt_base |
… | |
… | |
578 | } |
654 | } |
579 | }; |
655 | }; |
580 | |
656 | |
581 | // This container blends advantages of linked lists |
657 | // This container blends advantages of linked lists |
582 | // (efficiency) with vectors (random access) by |
658 | // (efficiency) with vectors (random access) by |
583 | // by using an unordered vector and storing the vector |
659 | // using an unordered vector and storing the vector |
584 | // index inside the object. |
660 | // index inside the object. |
585 | // |
661 | // |
586 | // + memory-efficient on most 64 bit archs |
662 | // + memory-efficient on most 64 bit archs |
587 | // + O(1) insert/remove |
663 | // + O(1) insert/remove |
588 | // + free unique (but varying) id for inserted objects |
664 | // + free unique (but varying) id for inserted objects |
… | |
… | |
625 | insert (&obj); |
701 | insert (&obj); |
626 | } |
702 | } |
627 | |
703 | |
628 | void erase (T *obj) |
704 | void erase (T *obj) |
629 | { |
705 | { |
630 | unsigned int pos = obj->*indexmember; |
706 | object_vector_index pos = obj->*indexmember; |
631 | obj->*indexmember = 0; |
707 | obj->*indexmember = 0; |
632 | |
708 | |
633 | if (pos < this->size ()) |
709 | if (pos < this->size ()) |
634 | { |
710 | { |
635 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
711 | (*this)[pos - 1] = (*this)[this->size () - 1]; |