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.90 by root, Mon Oct 12 14:00:58 2009 UTC vs.
Revision 1.103 by root, Thu Apr 29 15:49:04 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 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.
… …
21 */ 21 */
22 22
23#ifndef UTIL_H__ 23#ifndef UTIL_H__
24#define UTIL_H__ 24#define UTIL_H__
25 25
26#include <compiler.h>
27
26#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 28#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
27#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs 29#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
28#define PREFER_MALLOC 0 // use malloc and not the slice allocator 30#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 31
52#include <pthread.h> 32#include <pthread.h>
53 33
54#include <cstddef> 34#include <cstddef>
55#include <cmath> 35#include <cmath>
… …
75#endif 55#endif
76 56
77// 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)
78#define auto(var,expr) decltype(expr) var = (expr) 58#define auto(var,expr) decltype(expr) var = (expr)
79 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
80// very ugly macro that basically declares and initialises a variable 69// very ugly macro that basically declares and initialises a variable
81// that is in scope for the next statement only 70// that is in scope for the next statement only
82// 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
83// (note: works great for pointers) 72// (note: works great for pointers)
84// most ugly macro I ever wrote 73// most ugly macro I ever wrote
… …
113// sign returns -1 or +1 102// sign returns -1 or +1
114template<typename T> 103template<typename T>
115static inline T sign (T v) { return v < 0 ? -1 : +1; } 104static inline T sign (T v) { return v < 0 ? -1 : +1; }
116// relies on 2c representation 105// relies on 2c representation
117template<> 106template<>
118inline 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); }
119 112
120// sign0 returns -1, 0 or +1 113// sign0 returns -1, 0 or +1
121template<typename T> 114template<typename T>
122static 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; }
123 119
124// div* only work correctly for div > 0 120// div* only work correctly for div > 0
125// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 121// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
126template<typename T> static inline T div (T val, T div) 122template<typename T> static inline T div (T val, T div)
127{ 123{
… …
206 int32_t d = b - a; 202 int32_t d = b - a;
207 d &= d >> 31; 203 d &= d >> 31;
208 return b - d; 204 return b - d;
209} 205}
210 206
211// this is much faster than crossfires original algorithm 207// this is much faster than crossfire's original algorithm
212// on modern cpus 208// on modern cpus
213inline int 209inline int
214isqrt (int n) 210isqrt (int n)
215{ 211{
216 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;
217} 227}
218 228
219// 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)
220#if 0 230#if 0
221// 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.
… …
246absdir (int d) 256absdir (int d)
247{ 257{
248 return ((d - 1) & 7) + 1; 258 return ((d - 1) & 7) + 1;
249} 259}
250 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
251extern ssize_t slice_alloc; // statistics 275extern ssize_t slice_alloc; // statistics
252 276
253void *salloc_ (int n) throw (std::bad_alloc); 277void *salloc_ (int n) throw (std::bad_alloc);
254void *salloc_ (int n, void *src) throw (std::bad_alloc); 278void *salloc_ (int n, void *src) throw (std::bad_alloc);
255 279
… …
459 return !is_constant (num) ? get_range (num) // non-constant 483 return !is_constant (num) ? get_range (num) // non-constant
460 : 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
461 : this->next () & (num - 1); // constant, power-of-two 485 : this->next () & (num - 1); // constant, power-of-two
462 } 486 }
463 487
464 // return a number within (min .. max) 488 // return a number within the closed interval [min .. max]
465 int operator () (int r_min, int r_max) 489 int operator () (int r_min, int r_max)
466 { 490 {
467 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max 491 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
468 ? r_min + operator ()(r_max - r_min + 1) 492 ? r_min + operator ()(r_max - r_min + 1)
469 : get_range (r_min, r_max); 493 : get_range (r_min, r_max);
470 } 494 }
471 495
496 // return a number within the closed interval [0..1]
472 double operator ()() 497 double operator ()()
473 { 498 {
474 return this->next () / (double)0xFFFFFFFFU; 499 return this->next () / (double)0xFFFFFFFFU;
475 } 500 }
476 501
… …
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 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}
556 611
557struct str_hash 612struct str_hash
558{ 613{
559 std::size_t operator ()(const char *s) const 614 std::size_t operator ()(const char *s) const
560 { 615 {
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; 616 return strhsh (s);
617 }
618
619 std::size_t operator ()(const shstr &s) const
620 {
621 return strhsh (s);
592 } 622 }
593}; 623};
594 624
595struct str_equal 625struct str_equal
596{ 626{
… …
706// return current time as timestamp 736// return current time as timestamp
707tstamp now (); 737tstamp now ();
708 738
709int similar_direction (int a, int b); 739int similar_direction (int a, int b);
710 740
711// like sprintf, but returns a "static" buffer 741// like v?sprintf, but returns a "static" buffer
712const char *format (const char *format, ...); 742char *vformat (const char *format, va_list ap);
743char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
713 744
714// safety-check player input which will become object->msg 745// safety-check player input which will become object->msg
715bool msg_is_safe (const char *msg); 746bool msg_is_safe (const char *msg);
716 747
717///////////////////////////////////////////////////////////////////////////// 748/////////////////////////////////////////////////////////////////////////////

Diff Legend

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