ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/util.h
(Generate patch)

Comparing deliantra/server/include/util.h (file contents):
Revision 1.91 by root, Thu Oct 15 21:09:32 2009 UTC vs.
Revision 1.128 by root, Tue Nov 27 18:47:35 2018 UTC

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 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__
26
27#include <compiler.h>
25 28
26#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 29#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
27#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs 30#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
28#define PREFER_MALLOC 0 // use malloc and not the slice allocator 31#define PREFER_MALLOC 0 // use malloc and not the slice allocator
29
30#if __GNUC__ >= 3
31# define is_constant(c) __builtin_constant_p (c)
32# define expect(expr,value) __builtin_expect ((expr),(value))
33# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
34# define noinline __attribute__((__noinline__))
35#else
36# define is_constant(c) 0
37# define expect(expr,value) (expr)
38# define prefetch(addr,rw,locality)
39# define noinline
40#endif
41
42#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
43# define decltype(x) typeof(x)
44#endif
45
46// put into ifs if you are very sure that the expression
47// is mostly true or mosty false. note that these return
48// booleans, not the expression.
49#define expect_false(expr) expect ((expr) ? 1 : 0, 0)
50#define expect_true(expr) expect ((expr) ? 1 : 0, 1)
51 32
52#include <pthread.h> 33#include <pthread.h>
53 34
54#include <cstddef> 35#include <cstddef>
55#include <cmath> 36#include <cmath>
56#include <new> 37#include <new>
57#include <vector> 38#include <vector>
58 39
59#include <glib.h> 40#include <glib.h>
41
42#include <flat_hash_map.hpp>
60 43
61#include <shstr.h> 44#include <shstr.h>
62#include <traits.h> 45#include <traits.h>
63 46
64#if DEBUG_SALLOC 47#if DEBUG_SALLOC
… …
75#endif 58#endif
76 59
77// 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)
78#define auto(var,expr) decltype(expr) var = (expr) 61#define auto(var,expr) decltype(expr) var = (expr)
79 62
63#if cplusplus_does_not_suck /* still sucks in codesize with gcc 6, although local types work now */
64// does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm)
65template<typename T, int N>
66static inline int array_length (const T (&arr)[N])
67{
68 return N;
69}
70#else
71#define array_length(name) (sizeof (name) / sizeof (name [0]))
72#endif
73
80// very ugly macro that basically declares and initialises a variable 74// very ugly macro that basically declares and initialises a variable
81// that is in scope for the next statement only 75// that is in scope for the next statement only
82// works only for stuff that can be assigned 0 and converts to false 76// works only for stuff that can be assigned 0 and converts to false
83// (note: works great for pointers) 77// (note: works great for pointers)
84// most ugly macro I ever wrote 78// most ugly macro I ever wrote
… …
90 84
91// in range excluding end 85// in range excluding end
92#define IN_RANGE_EXC(val,beg,end) \ 86#define IN_RANGE_EXC(val,beg,end) \
93 ((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))
94 88
95void cleanup (const char *cause, bool make_core = false); 89ecb_cold void cleanup (const char *cause, bool make_core = false);
96void fork_abort (const char *msg); 90ecb_cold void fork_abort (const char *msg);
97 91
98// 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,
99// 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.
100template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 94template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
101template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 95template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
102template<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; } 96template<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; }
103 97
104template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); } 98template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
105template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); } 99template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
106template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); } 100template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
… …
113// sign returns -1 or +1 107// sign returns -1 or +1
114template<typename T> 108template<typename T>
115static inline T sign (T v) { return v < 0 ? -1 : +1; } 109static inline T sign (T v) { return v < 0 ? -1 : +1; }
116// relies on 2c representation 110// relies on 2c representation
117template<> 111template<>
118inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } 112inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
113template<>
114inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); }
115template<>
116inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); }
119 117
120// sign0 returns -1, 0 or +1 118// sign0 returns -1, 0 or +1
121template<typename T> 119template<typename T>
122static inline T sign0 (T v) { return v ? sign (v) : 0; } 120static inline T sign0 (T v) { return v ? sign (v) : 0; }
121
122//clashes with C++0x
123template<typename T, typename U>
124static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
123 125
124// div* only work correctly for div > 0 126// div* only work correctly for div > 0
125// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 127// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
126template<typename T> static inline T div (T val, T div) 128template<typename T> static inline T div (T val, T div)
127{ 129{
128 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; 130 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
129} 131}
132
133template<> inline float div (float val, float div) { return val / div; }
134template<> inline double div (double val, double div) { return val / div; }
135
130// div, round-up 136// div, round-up
131template<typename T> static inline T div_ru (T val, T div) 137template<typename T> static inline T div_ru (T val, T div)
132{ 138{
133 return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; 139 return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div;
134} 140}
… …
206 int32_t d = b - a; 212 int32_t d = b - a;
207 d &= d >> 31; 213 d &= d >> 31;
208 return b - d; 214 return b - d;
209} 215}
210 216
211// this is much faster than crossfires original algorithm 217// this is much faster than crossfire's original algorithm
212// on modern cpus 218// on modern cpus
213inline int 219inline int
214isqrt (int n) 220isqrt (int n)
215{ 221{
216 return (int)sqrtf ((float)n); 222 return (int)sqrtf ((float)n);
223}
224
225// this is kind of like the ^^ operator, if it would exist, without sequence point.
226// more handy than it looks like, due to the implicit !! done on its arguments
227inline bool
228logical_xor (bool a, bool b)
229{
230 return a != b;
231}
232
233inline bool
234logical_implies (bool a, bool b)
235{
236 return a <= b;
217} 237}
218 238
219// this is only twice as fast as naive sqrtf (dx*dy+dy*dy) 239// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
220#if 0 240#if 0
221// 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.
222#else 242#else
223// 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.
224#endif 244#endif
225inline int 245inline int
226idistance (int dx, int dy) 246idistance (int dx, int dy)
227{ 247{
228 unsigned int dx_ = abs (dx); 248 unsigned int dx_ = abs (dx);
229 unsigned int dy_ = abs (dy); 249 unsigned int dy_ = abs (dy);
230 250
231#if 0 251#if 0
232 return dx_ > dy_ 252 return dx_ > dy_
… …
235#else 255#else
236 return dx_ + dy_ - min (dx_, dy_) * 5 / 8; 256 return dx_ + dy_ - min (dx_, dy_) * 5 / 8;
237#endif 257#endif
238} 258}
239 259
260// can be substantially faster than floor, if your value range allows for it
261template<typename T>
262inline T
263fastfloor (T x)
264{
265 return std::floor (x);
266}
267
268inline float
269fastfloor (float x)
270{
271 return sint32(x) - (x < 0);
272}
273
274inline double
275fastfloor (double x)
276{
277 return sint64(x) - (x < 0);
278}
279
240/* 280/*
241 * absdir(int): Returns a number between 1 and 8, which represent 281 * absdir(int): Returns a number between 1 and 8, which represent
242 * the "absolute" direction of a number (it actually takes care of 282 * the "absolute" direction of a number (it actually takes care of
243 * "overflow" in previous calculations of a direction). 283 * "overflow" in previous calculations of a direction).
244 */ 284 */
… …
246absdir (int d) 286absdir (int d)
247{ 287{
248 return ((d - 1) & 7) + 1; 288 return ((d - 1) & 7) + 1;
249} 289}
250 290
291#define for_all_bits_sparse_32(mask, idxvar) \
292 for (uint32_t idxvar, mask_ = mask; \
293 mask_ && ((idxvar = ecb_ctz32 (mask_)), mask_ &= ~(1 << idxvar), 1);)
294
251extern ssize_t slice_alloc; // statistics 295extern ssize_t slice_alloc; // statistics
252 296
253void *salloc_ (int n) throw (std::bad_alloc); 297void *salloc_ (int n);
254void *salloc_ (int n, void *src) throw (std::bad_alloc); 298void *salloc_ (int n, void *src);
255 299
256// strictly the same as g_slice_alloc, but never returns 0 300// strictly the same as g_slice_alloc, but never returns 0
257template<typename T> 301template<typename T>
258inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } 302inline T *salloc (int n = 1) { return (T *)salloc_ (n * sizeof (T)); }
259 303
260// also copies src into the new area, like "memdup" 304// also copies src into the new area, like "memdup"
261// if src is 0, clears the memory 305// if src is 0, clears the memory
262template<typename T> 306template<typename T>
263inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } 307inline T *salloc (int n, T *src) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
264 308
265// clears the memory 309// clears the memory
266template<typename T> 310template<typename T>
267inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } 311inline T *salloc0(int n = 1) { return (T *)salloc_ (n * sizeof (T), 0); }
268 312
269// for symmetry 313// for symmetry
270template<typename T> 314template<typename T>
271inline void sfree (T *ptr, int n = 1) throw () 315inline void sfree (T *ptr, int n = 1) noexcept
272{ 316{
273 if (expect_true (ptr)) 317 if (expect_true (ptr))
274 { 318 {
275 slice_alloc -= n * sizeof (T); 319 slice_alloc -= n * sizeof (T);
276 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); 320 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
277 g_slice_free1 (n * sizeof (T), (void *)ptr); 321 g_slice_free1 (n * sizeof (T), (void *)ptr);
278 assert (slice_alloc >= 0);//D
279 } 322 }
280} 323}
281 324
282// nulls the pointer 325// nulls the pointer
283template<typename T> 326template<typename T>
284inline void sfree0 (T *&ptr, int n = 1) throw () 327inline void sfree0 (T *&ptr, int n = 1) noexcept
285{ 328{
286 sfree<T> (ptr, n); 329 sfree<T> (ptr, n);
287 ptr = 0; 330 ptr = 0;
288} 331}
289 332
… …
357 typedef const Tp *const_pointer; 400 typedef const Tp *const_pointer;
358 typedef Tp &reference; 401 typedef Tp &reference;
359 typedef const Tp &const_reference; 402 typedef const Tp &const_reference;
360 typedef Tp value_type; 403 typedef Tp value_type;
361 404
362 template <class U> 405 template <class U>
363 struct rebind 406 struct rebind
364 { 407 {
365 typedef slice_allocator<U> other; 408 typedef slice_allocator<U> other;
366 }; 409 };
367 410
368 slice_allocator () throw () { } 411 slice_allocator () noexcept { }
369 slice_allocator (const slice_allocator &) throw () { } 412 slice_allocator (const slice_allocator &) noexcept { }
370 template<typename Tp2> 413 template<typename Tp2>
371 slice_allocator (const slice_allocator<Tp2> &) throw () { } 414 slice_allocator (const slice_allocator<Tp2> &) noexcept { }
372 415
373 ~slice_allocator () { } 416 ~slice_allocator () { }
374 417
375 pointer address (reference x) const { return &x; } 418 pointer address (reference x) const { return &x; }
376 const_pointer address (const_reference x) const { return &x; } 419 const_pointer address (const_reference x) const { return &x; }
… …
383 void deallocate (pointer p, size_type n) 426 void deallocate (pointer p, size_type n)
384 { 427 {
385 sfree<Tp> (p, n); 428 sfree<Tp> (p, n);
386 } 429 }
387 430
388 size_type max_size () const throw () 431 size_type max_size () const noexcept
389 { 432 {
390 return size_t (-1) / sizeof (Tp); 433 return size_t (-1) / sizeof (Tp);
391 } 434 }
392 435
393 void construct (pointer p, const Tp &val) 436 void construct (pointer p, const Tp &val)
… …
399 { 442 {
400 p->~Tp (); 443 p->~Tp ();
401 } 444 }
402}; 445};
403 446
404// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. 447// basically a memory area, but refcounted
405// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 448struct refcnt_buf
406// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
407struct tausworthe_random_generator
408{ 449{
409 uint32_t state [4]; 450 char *data;
410 451
411 void operator =(const tausworthe_random_generator &src) 452 refcnt_buf (size_t size = 0);
412 { 453 refcnt_buf (void *data, size_t size);
413 state [0] = src.state [0];
414 state [1] = src.state [1];
415 state [2] = src.state [2];
416 state [3] = src.state [3];
417 }
418 454
419 void seed (uint32_t seed); 455 refcnt_buf (const refcnt_buf &src)
420 uint32_t next ();
421};
422
423// Xorshift RNGs, George Marsaglia
424// http://www.jstatsoft.org/v08/i14/paper
425// this one is about 40% faster than the tausworthe one above (i.e. not much),
426// despite the inlining, and has the issue of only creating 2**32-1 numbers.
427// see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf
428struct xorshift_random_generator
429{
430 uint32_t x, y;
431
432 void operator =(const xorshift_random_generator &src)
433 { 456 {
434 x = src.x; 457 data = src.data;
435 y = src.y; 458 inc ();
436 } 459 }
437 460
438 void seed (uint32_t seed) 461 ~refcnt_buf ();
439 {
440 x = seed;
441 y = seed * 69069U;
442 }
443 462
444 uint32_t next () 463 refcnt_buf &operator =(const refcnt_buf &src);
464
465 operator char *()
445 { 466 {
446 uint32_t t = x ^ (x << 10);
447 x = y;
448 y = y ^ (y >> 13) ^ t ^ (t >> 10);
449 return y; 467 return data;
450 } 468 }
451};
452 469
453template<class generator> 470 size_t size () const
454struct random_number_generator : generator
455{
456 // uniform distribution, 0 .. max (0, num - 1)
457 uint32_t operator ()(uint32_t num)
458 { 471 {
459 return !is_constant (num) ? get_range (num) // non-constant 472 return _size ();
460 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
461 : this->next () & (num - 1); // constant, power-of-two
462 }
463
464 // return a number within (min .. max)
465 int operator () (int r_min, int r_max)
466 {
467 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
468 ? r_min + operator ()(r_max - r_min + 1)
469 : get_range (r_min, r_max);
470 }
471
472 double operator ()()
473 {
474 return this->next () / (double)0xFFFFFFFFU;
475 } 473 }
476 474
477protected: 475protected:
478 uint32_t get_range (uint32_t r_max); 476 enum {
479 int get_range (int r_min, int r_max); 477 overhead = sizeof (uint32_t) * 2
480}; 478 };
481 479
482typedef random_number_generator<tausworthe_random_generator> rand_gen; 480 uint32_t &_size () const
481 {
482 return ((unsigned int *)data)[-2];
483 }
483 484
484extern rand_gen rndm, rmg_rndm; 485 uint32_t &_refcnt () const
486 {
487 return ((unsigned int *)data)[-1];
488 }
489
490 void _alloc (uint32_t size)
491 {
492 data = ((char *)salloc<char> (size + overhead)) + overhead;
493 _size () = size;
494 _refcnt () = 1;
495 }
496
497 void _dealloc ();
498
499 void inc ()
500 {
501 ++_refcnt ();
502 }
503
504 void dec ()
505 {
506 if (!--_refcnt ())
507 _dealloc ();
508 }
509};
485 510
486INTERFACE_CLASS (attachable) 511INTERFACE_CLASS (attachable)
487struct refcnt_base 512struct refcnt_base
488{ 513{
489 typedef int refcnt_t; 514 typedef int refcnt_t;
… …
504 // p if not null 529 // p if not null
505 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; }
506 531
507 void refcnt_dec () 532 void refcnt_dec ()
508 { 533 {
509 if (!is_constant (p)) 534 if (!ecb_is_constant (p))
510 --*refcnt_ref (); 535 --*refcnt_ref ();
511 else if (p) 536 else if (p)
512 --p->refcnt; 537 --p->refcnt;
513 } 538 }
514 539
515 void refcnt_inc () 540 void refcnt_inc ()
516 { 541 {
517 if (!is_constant (p)) 542 if (!ecb_is_constant (p))
518 ++*refcnt_ref (); 543 ++*refcnt_ref ();
519 else if (p) 544 else if (p)
520 ++p->refcnt; 545 ++p->refcnt;
521 } 546 }
522 547
… …
551typedef refptr<maptile> maptile_ptr; 576typedef refptr<maptile> maptile_ptr;
552typedef refptr<object> object_ptr; 577typedef refptr<object> object_ptr;
553typedef refptr<archetype> arch_ptr; 578typedef refptr<archetype> arch_ptr;
554typedef refptr<client> client_ptr; 579typedef refptr<client> client_ptr;
555typedef refptr<player> player_ptr; 580typedef refptr<player> player_ptr;
581typedef refptr<region> region_ptr;
582
583#define STRHSH_NULL 2166136261
584
585static inline uint32_t
586strhsh (const char *s)
587{
588 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
589 // it is about twice as fast as the one-at-a-time one,
590 // with good distribution.
591 // FNV-1a is faster on many cpus because the multiplication
592 // runs concurrently with the looping logic.
593 // we modify the hash a bit to improve its distribution
594 uint32_t hash = STRHSH_NULL;
595
596 while (*s)
597 hash = (hash ^ *s++) * 16777619U;
598
599 return hash ^ (hash >> 16);
600}
601
602static inline uint32_t
603memhsh (const char *s, size_t len)
604{
605 uint32_t hash = STRHSH_NULL;
606
607 while (len--)
608 hash = (hash ^ *s++) * 16777619U;
609
610 return hash;
611}
556 612
557struct str_hash 613struct str_hash
558{ 614{
559 std::size_t operator ()(const char *s) const 615 std::size_t operator ()(const char *s) const
560 { 616 {
561#if 0
562 uint32_t hash = 0;
563
564 /* use the one-at-a-time hash function, which supposedly is
565 * better than the djb2-like one used by perl5.005, but
566 * certainly is better then the bug used here before.
567 * see http://burtleburtle.net/bob/hash/doobs.html
568 */
569 while (*s)
570 {
571 hash += *s++;
572 hash += hash << 10;
573 hash ^= hash >> 6;
574 }
575
576 hash += hash << 3;
577 hash ^= hash >> 11;
578 hash += hash << 15;
579#else
580 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
581 // it is about twice as fast as the one-at-a-time one,
582 // with good distribution.
583 // FNV-1a is faster on many cpus because the multiplication
584 // runs concurrent with the looping logic.
585 uint32_t hash = 2166136261;
586
587 while (*s)
588 hash = (hash ^ *s++) * 16777619;
589#endif
590
591 return hash; 617 return strhsh (s);
592 } 618 }
619
620 std::size_t operator ()(const shstr &s) const
621 {
622 return strhsh (s);
623 }
624
625 typedef ska::power_of_two_hash_policy hash_policy;
593}; 626};
594 627
595struct str_equal 628struct str_equal
596{ 629{
597 bool operator ()(const char *a, const char *b) const 630 bool operator ()(const char *a, const char *b) const
… …
623 } 656 }
624}; 657};
625 658
626// This container blends advantages of linked lists 659// This container blends advantages of linked lists
627// (efficiency) with vectors (random access) by 660// (efficiency) with vectors (random access) by
628// by using an unordered vector and storing the vector 661// using an unordered vector and storing the vector
629// index inside the object. 662// index inside the object.
630// 663//
631// + memory-efficient on most 64 bit archs 664// + memory-efficient on most 64 bit archs
632// + O(1) insert/remove 665// + O(1) insert/remove
633// + free unique (but varying) id for inserted objects 666// + free unique (but varying) id for inserted objects
… …
670 insert (&obj); 703 insert (&obj);
671 } 704 }
672 705
673 void erase (T *obj) 706 void erase (T *obj)
674 { 707 {
675 unsigned int pos = obj->*indexmember; 708 object_vector_index pos = obj->*indexmember;
676 obj->*indexmember = 0; 709 obj->*indexmember = 0;
677 710
678 if (pos < this->size ()) 711 if (pos < this->size ())
679 { 712 {
680 (*this)[pos - 1] = (*this)[this->size () - 1]; 713 (*this)[pos - 1] = (*this)[this->size () - 1];
… …
688 { 721 {
689 erase (&obj); 722 erase (&obj);
690 } 723 }
691}; 724};
692 725
726/////////////////////////////////////////////////////////////////////////////
727
728// something like a vector or stack, but without
729// out of bounds checking
730template<typename T>
731struct fixed_stack
732{
733 T *data;
734 int size;
735 int max;
736
737 fixed_stack ()
738 : size (0), data (0)
739 {
740 }
741
742 fixed_stack (int max)
743 : size (0), max (max)
744 {
745 data = salloc<T> (max);
746 }
747
748 void reset (int new_max)
749 {
750 sfree (data, max);
751 size = 0;
752 max = new_max;
753 data = salloc<T> (max);
754 }
755
756 void free ()
757 {
758 sfree (data, max);
759 data = 0;
760 }
761
762 ~fixed_stack ()
763 {
764 sfree (data, max);
765 }
766
767 T &operator[](int idx)
768 {
769 return data [idx];
770 }
771
772 void push (T v)
773 {
774 data [size++] = v;
775 }
776
777 T &pop ()
778 {
779 return data [--size];
780 }
781
782 T remove (int idx)
783 {
784 T v = data [idx];
785
786 data [idx] = data [--size];
787
788 return v;
789 }
790};
791
792/////////////////////////////////////////////////////////////////////////////
793
693// basically does what strncpy should do, but appends "..." to strings exceeding length 794// basically does what strncpy should do, but appends "..." to strings exceeding length
694// returns the number of bytes actually used (including \0) 795// returns the number of bytes actually used (including \0)
695int assign (char *dst, const char *src, int maxsize); 796int assign (char *dst, const char *src, int maxsize);
696 797
697// type-safe version of assign 798// type-safe version of assign
… …
708 809
709int similar_direction (int a, int b); 810int similar_direction (int a, int b);
710 811
711// like v?sprintf, but returns a "static" buffer 812// like v?sprintf, but returns a "static" buffer
712char *vformat (const char *format, va_list ap); 813char *vformat (const char *format, va_list ap);
713char *format (const char *format, ...); 814char *format (const char *format, ...) ecb_attribute ((format (printf, 1, 2)));
714 815
715// safety-check player input which will become object->msg 816// safety-check player input which will become object->msg
716bool msg_is_safe (const char *msg); 817bool msg_is_safe (const char *msg);
717 818
718///////////////////////////////////////////////////////////////////////////// 819/////////////////////////////////////////////////////////////////////////////

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines