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.88 by root, Tue May 5 04:51:56 2009 UTC vs.
Revision 1.104 by root, Thu Apr 29 21:21:34 2010 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * 5 *
6 * Deliantra is free software: you can redistribute it and/or modify 6 * Deliantra is free software: you can redistribute it and/or modify it under
7 * it under the terms of the GNU General Public License as published by 7 * the terms of the Affero GNU General Public License as published by the
8 * the Free Software Foundation, either version 3 of the License, or 8 * Free Software Foundation, either version 3 of the License, or (at your
9 * (at your 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 GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
18 * 19 *
19 * 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>
20 */ 21 */
21 22
22#ifndef UTIL_H__ 23#ifndef UTIL_H__
23#define UTIL_H__ 24#define UTIL_H__
24 25
26#include <compiler.h>
27
25#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 28#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs 29#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
27#define PREFER_MALLOC 0 // use malloc and not the slice allocator 30#define PREFER_MALLOC 0 // use malloc and not the slice allocator
28
29#if __GNUC__ >= 3
30# define is_constant(c) __builtin_constant_p (c)
31# define expect(expr,value) __builtin_expect ((expr),(value))
32# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
33# define noinline __attribute__((__noinline__))
34#else
35# define is_constant(c) 0
36# define expect(expr,value) (expr)
37# define prefetch(addr,rw,locality)
38# define noinline
39#endif
40
41#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
42# define decltype(x) typeof(x)
43#endif
44
45// put into ifs if you are very sure that the expression
46// is mostly true or mosty false. note that these return
47// booleans, not the expression.
48#define expect_false(expr) expect ((expr) ? 1 : 0, 0)
49#define expect_true(expr) expect ((expr) ? 1 : 0, 1)
50 31
51#include <pthread.h> 32#include <pthread.h>
52 33
53#include <cstddef> 34#include <cstddef>
54#include <cmath> 35#include <cmath>
… …
74#endif 55#endif
75 56
76// 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)
77#define auto(var,expr) decltype(expr) var = (expr) 58#define auto(var,expr) decltype(expr) var = (expr)
78 59
60// could use the sizeof (arr) /( sizeof (arr [0]) here, but C++ is
61// much more obfuscated... :)
62
63template<typename T, int N>
64inline int array_length (const T (&arr)[N])
65{
66 return N;
67}
68
79// very ugly macro that basically declares and initialises a variable 69// very ugly macro that basically declares and initialises a variable
80// that is in scope for the next statement only 70// that is in scope for the next statement only
81// works only for stuff that can be assigned 0 and converts to false 71// works only for stuff that can be assigned 0 and converts to false
82// (note: works great for pointers) 72// (note: works great for pointers)
83// most ugly macro I ever wrote 73// most ugly macro I ever wrote
… …
112// sign returns -1 or +1 102// sign returns -1 or +1
113template<typename T> 103template<typename T>
114static inline T sign (T v) { return v < 0 ? -1 : +1; } 104static inline T sign (T v) { return v < 0 ? -1 : +1; }
115// relies on 2c representation 105// relies on 2c representation
116template<> 106template<>
117inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } 107inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
108template<>
109inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); }
110template<>
111inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); }
118 112
119// sign0 returns -1, 0 or +1 113// sign0 returns -1, 0 or +1
120template<typename T> 114template<typename T>
121static inline T sign0 (T v) { return v ? sign (v) : 0; } 115static inline T sign0 (T v) { return v ? sign (v) : 0; }
116
117template<typename T, typename U>
118static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
122 119
123// div* only work correctly for div > 0 120// div* only work correctly for div > 0
124// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 121// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
125template<typename T> static inline T div (T val, T div) 122template<typename T> static inline T div (T val, T div)
126{ 123{
… …
205 int32_t d = b - a; 202 int32_t d = b - a;
206 d &= d >> 31; 203 d &= d >> 31;
207 return b - d; 204 return b - d;
208} 205}
209 206
210// this is much faster than crossfires original algorithm 207// this is much faster than crossfire's original algorithm
211// on modern cpus 208// on modern cpus
212inline int 209inline int
213isqrt (int n) 210isqrt (int n)
214{ 211{
215 return (int)sqrtf ((float)n); 212 return (int)sqrtf ((float)n);
213}
214
215// this is kind of like the ^^ operator, if it would exist, without sequence point.
216// more handy than it looks like, due to the implicit !! done on its arguments
217inline bool
218logical_xor (bool a, bool b)
219{
220 return a != b;
221}
222
223inline bool
224logical_implies (bool a, bool b)
225{
226 return a <= b;
216} 227}
217 228
218// this is only twice as fast as naive sqrtf (dx*dy+dy*dy) 229// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
219#if 0 230#if 0
220// and has a max. error of 6 in the range -100..+100. 231// and has a max. error of 6 in the range -100..+100.
… …
245absdir (int d) 256absdir (int d)
246{ 257{
247 return ((d - 1) & 7) + 1; 258 return ((d - 1) & 7) + 1;
248} 259}
249 260
261// avoid ctz name because netbsd or freebsd spams it's namespace with it
262#if GCC_VERSION(3,4)
263static inline int least_significant_bit (uint32_t x)
264{
265 return __builtin_ctz (x);
266}
267#else
268int least_significant_bit (uint32_t x);
269#endif
270
271#define for_all_bits_sparse_32(mask, idxvar) \
272 for (uint32_t idxvar, mask_ = mask; \
273 mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);)
274
250extern ssize_t slice_alloc; // statistics 275extern ssize_t slice_alloc; // statistics
251 276
252void *salloc_ (int n) throw (std::bad_alloc); 277void *salloc_ (int n) throw (std::bad_alloc);
253void *salloc_ (int n, void *src) throw (std::bad_alloc); 278void *salloc_ (int n, void *src) throw (std::bad_alloc);
254 279
… …
458 return !is_constant (num) ? get_range (num) // non-constant 483 return !is_constant (num) ? get_range (num) // non-constant
459 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two 484 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
460 : this->next () & (num - 1); // constant, power-of-two 485 : this->next () & (num - 1); // constant, power-of-two
461 } 486 }
462 487
463 // return a number within (min .. max) 488 // return a number within the closed interval [min .. max]
464 int operator () (int r_min, int r_max) 489 int operator () (int r_min, int r_max)
465 { 490 {
466 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max 491 return is_constant (r_min <= r_max) && r_min <= r_max
467 ? r_min + operator ()(r_max - r_min + 1) 492 ? r_min + operator ()(r_max - r_min + 1)
468 : get_range (r_min, r_max); 493 : get_range (r_min, r_max);
469 } 494 }
470 495
496 // return a number within the closed interval [0..1]
471 double operator ()() 497 double operator ()()
472 { 498 {
473 return this->next () / (double)0xFFFFFFFFU; 499 return this->next () / (double)0xFFFFFFFFU;
474 } 500 }
475 501
… …
550typedef refptr<maptile> maptile_ptr; 576typedef refptr<maptile> maptile_ptr;
551typedef refptr<object> object_ptr; 577typedef refptr<object> object_ptr;
552typedef refptr<archetype> arch_ptr; 578typedef refptr<archetype> arch_ptr;
553typedef refptr<client> client_ptr; 579typedef refptr<client> client_ptr;
554typedef 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 uint32_t hash = STRHSH_NULL;
594
595 while (*s)
596 hash = (hash ^ *s++) * 16777619U;
597
598 return hash;
599}
600
601static inline uint32_t
602memhsh (const char *s, size_t len)
603{
604 uint32_t hash = STRHSH_NULL;
605
606 while (len--)
607 hash = (hash ^ *s++) * 16777619U;
608
609 return hash;
610}
555 611
556struct str_hash 612struct str_hash
557{ 613{
558 std::size_t operator ()(const char *s) const 614 std::size_t operator ()(const char *s) const
559 { 615 {
560#if 0
561 uint32_t hash = 0;
562
563 /* use the one-at-a-time hash function, which supposedly is
564 * better than the djb2-like one used by perl5.005, but
565 * certainly is better then the bug used here before.
566 * see http://burtleburtle.net/bob/hash/doobs.html
567 */
568 while (*s)
569 {
570 hash += *s++;
571 hash += hash << 10;
572 hash ^= hash >> 6;
573 }
574
575 hash += hash << 3;
576 hash ^= hash >> 11;
577 hash += hash << 15;
578#else
579 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
580 // it is about twice as fast as the one-at-a-time one,
581 // with good distribution.
582 // FNV-1a is faster on many cpus because the multiplication
583 // runs concurrent with the looping logic.
584 uint32_t hash = 2166136261;
585
586 while (*s)
587 hash = (hash ^ *s++) * 16777619;
588#endif
589
590 return hash; 616 return strhsh (s);
617 }
618
619 std::size_t operator ()(const shstr &s) const
620 {
621 return strhsh (s);
591 } 622 }
592}; 623};
593 624
594struct str_equal 625struct str_equal
595{ 626{
… …
705// return current time as timestamp 736// return current time as timestamp
706tstamp now (); 737tstamp now ();
707 738
708int similar_direction (int a, int b); 739int similar_direction (int a, int b);
709 740
710// like sprintf, but returns a "static" buffer 741// like v?sprintf, but returns a "static" buffer
711const char *format (const char *format, ...); 742char *vformat (const char *format, va_list ap);
743char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
744
745// safety-check player input which will become object->msg
746bool msg_is_safe (const char *msg);
712 747
713///////////////////////////////////////////////////////////////////////////// 748/////////////////////////////////////////////////////////////////////////////
714// threads, very very thin wrappers around pthreads 749// threads, very very thin wrappers around pthreads
715 750
716struct thread 751struct thread

Diff Legend

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