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.89 by sf-marcmagus, Sun Oct 11 01:35:52 2009 UTC vs.
Revision 1.99 by root, Fri Apr 9 02:45:16 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>
… …
118 99
119// sign0 returns -1, 0 or +1 100// sign0 returns -1, 0 or +1
120template<typename T> 101template<typename T>
121static inline T sign0 (T v) { return v ? sign (v) : 0; } 102static inline T sign0 (T v) { return v ? sign (v) : 0; }
122 103
104template<typename T, typename U>
105static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
106
123// div* only work correctly for div > 0 107// div* only work correctly for div > 0
124// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 108// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
125template<typename T> static inline T div (T val, T div) 109template<typename T> static inline T div (T val, T div)
126{ 110{
127 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; 111 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
… …
205 int32_t d = b - a; 189 int32_t d = b - a;
206 d &= d >> 31; 190 d &= d >> 31;
207 return b - d; 191 return b - d;
208} 192}
209 193
210// this is much faster than crossfires original algorithm 194// this is much faster than crossfire's original algorithm
211// on modern cpus 195// on modern cpus
212inline int 196inline int
213isqrt (int n) 197isqrt (int n)
214{ 198{
215 return (int)sqrtf ((float)n); 199 return (int)sqrtf ((float)n);
200}
201
202// this is kind of like the ^^ operator, if it would exist, without sequence point.
203// more handy than it looks like, due to the implicit !! done on its arguments
204inline bool
205logical_xor (bool a, bool b)
206{
207 return a != b;
208}
209
210inline bool
211logical_implies (bool a, bool b)
212{
213 return a <= b;
216} 214}
217 215
218// this is only twice as fast as naive sqrtf (dx*dy+dy*dy) 216// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
219#if 0 217#if 0
220// and has a max. error of 6 in the range -100..+100. 218// and has a max. error of 6 in the range -100..+100.
… …
245absdir (int d) 243absdir (int d)
246{ 244{
247 return ((d - 1) & 7) + 1; 245 return ((d - 1) & 7) + 1;
248} 246}
249 247
248// avoid ctz name because netbsd or freebsd spams it's namespace with it
249#if GCC_VERSION(3,4)
250static inline int least_significant_bit (uint32_t x)
251{
252 return __builtin_ctz (x);
253}
254#else
255int least_significant_bit (uint32_t x);
256#endif
257
258#define for_all_bits_sparse_32(mask, idxvar) \
259 for (uint32_t idxvar, mask_ = mask; \
260 mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);)
261
250extern ssize_t slice_alloc; // statistics 262extern ssize_t slice_alloc; // statistics
251 263
252void *salloc_ (int n) throw (std::bad_alloc); 264void *salloc_ (int n) throw (std::bad_alloc);
253void *salloc_ (int n, void *src) throw (std::bad_alloc); 265void *salloc_ (int n, void *src) throw (std::bad_alloc);
254 266
… …
551typedef refptr<object> object_ptr; 563typedef refptr<object> object_ptr;
552typedef refptr<archetype> arch_ptr; 564typedef refptr<archetype> arch_ptr;
553typedef refptr<client> client_ptr; 565typedef refptr<client> client_ptr;
554typedef refptr<player> player_ptr; 566typedef refptr<player> player_ptr;
555 567
568#define STRHSH_NULL 2166136261
569
570static inline uint32_t
571strhsh (const char *s)
572{
573 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
574 // it is about twice as fast as the one-at-a-time one,
575 // with good distribution.
576 // FNV-1a is faster on many cpus because the multiplication
577 // runs concurrently with the looping logic.
578 uint32_t hash = STRHSH_NULL;
579
580 while (*s)
581 hash = (hash ^ *s++) * 16777619U;
582
583 return hash;
584}
585
586static inline uint32_t
587memhsh (const char *s, size_t len)
588{
589 uint32_t hash = STRHSH_NULL;
590
591 while (len--)
592 hash = (hash ^ *s++) * 16777619U;
593
594 return hash;
595}
596
556struct str_hash 597struct str_hash
557{ 598{
558 std::size_t operator ()(const char *s) const 599 std::size_t operator ()(const char *s) const
559 { 600 {
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; 601 return strhsh (s);
602 }
603
604 std::size_t operator ()(const shstr &s) const
605 {
606 return strhsh (s);
591 } 607 }
592}; 608};
593 609
594struct str_equal 610struct str_equal
595{ 611{
… …
705// return current time as timestamp 721// return current time as timestamp
706tstamp now (); 722tstamp now ();
707 723
708int similar_direction (int a, int b); 724int similar_direction (int a, int b);
709 725
710// like sprintf, but returns a "static" buffer 726// like v?sprintf, but returns a "static" buffer
711const char *format (const char *format, ...); 727char *vformat (const char *format, va_list ap);
728char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
712 729
713// safety-check player input which will become object->msg 730// safety-check player input which will become object->msg
714bool msg_is_safe (const char *msg); 731bool msg_is_safe (const char *msg);
715 732
716///////////////////////////////////////////////////////////////////////////// 733/////////////////////////////////////////////////////////////////////////////

Diff Legend

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