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.92 by root, Tue Oct 20 05:57:08 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 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>
119 99
120// sign0 returns -1, 0 or +1 100// sign0 returns -1, 0 or +1
121template<typename T> 101template<typename T>
122static inline T sign0 (T v) { return v ? sign (v) : 0; } 102static inline T sign0 (T v) { return v ? sign (v) : 0; }
123 103
104template<typename T, typename U>
105static inline T copysign (T a, U b) { return a > 0 ? b : -b; }
106
124// div* only work correctly for div > 0 107// div* only work correctly for div > 0
125// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 108// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
126template<typename T> static inline T div (T val, T div) 109template<typename T> static inline T div (T val, T div)
127{ 110{
128 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;
206 int32_t d = b - a; 189 int32_t d = b - a;
207 d &= d >> 31; 190 d &= d >> 31;
208 return b - d; 191 return b - d;
209} 192}
210 193
211// this is much faster than crossfires original algorithm 194// this is much faster than crossfire's original algorithm
212// on modern cpus 195// on modern cpus
213inline int 196inline int
214isqrt (int n) 197isqrt (int n)
215{ 198{
216 return (int)sqrtf ((float)n); 199 return (int)sqrtf ((float)n);
260absdir (int d) 243absdir (int d)
261{ 244{
262 return ((d - 1) & 7) + 1; 245 return ((d - 1) & 7) + 1;
263} 246}
264 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
265extern ssize_t slice_alloc; // statistics 262extern ssize_t slice_alloc; // statistics
266 263
267void *salloc_ (int n) throw (std::bad_alloc); 264void *salloc_ (int n) throw (std::bad_alloc);
268void *salloc_ (int n, void *src) throw (std::bad_alloc); 265void *salloc_ (int n, void *src) throw (std::bad_alloc);
269 266
566typedef refptr<object> object_ptr; 563typedef refptr<object> object_ptr;
567typedef refptr<archetype> arch_ptr; 564typedef refptr<archetype> arch_ptr;
568typedef refptr<client> client_ptr; 565typedef refptr<client> client_ptr;
569typedef refptr<player> player_ptr; 566typedef refptr<player> player_ptr;
570 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
571struct str_hash 597struct str_hash
572{ 598{
573 std::size_t operator ()(const char *s) const 599 std::size_t operator ()(const char *s) const
574 { 600 {
575#if 0
576 uint32_t hash = 0;
577
578 /* use the one-at-a-time hash function, which supposedly is
579 * better than the djb2-like one used by perl5.005, but
580 * certainly is better then the bug used here before.
581 * see http://burtleburtle.net/bob/hash/doobs.html
582 */
583 while (*s)
584 {
585 hash += *s++;
586 hash += hash << 10;
587 hash ^= hash >> 6;
588 }
589
590 hash += hash << 3;
591 hash ^= hash >> 11;
592 hash += hash << 15;
593#else
594 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
595 // it is about twice as fast as the one-at-a-time one,
596 // with good distribution.
597 // FNV-1a is faster on many cpus because the multiplication
598 // runs concurrent with the looping logic.
599 uint32_t hash = 2166136261;
600
601 while (*s)
602 hash = (hash ^ *s++) * 16777619;
603#endif
604
605 return hash; 601 return strhsh (s);
602 }
603
604 std::size_t operator ()(const shstr &s) const
605 {
606 return strhsh (s);
606 } 607 }
607}; 608};
608 609
609struct str_equal 610struct str_equal
610{ 611{
722 723
723int similar_direction (int a, int b); 724int similar_direction (int a, int b);
724 725
725// like v?sprintf, but returns a "static" buffer 726// like v?sprintf, but returns a "static" buffer
726char *vformat (const char *format, va_list ap); 727char *vformat (const char *format, va_list ap);
727char *format (const char *format, ...); 728char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
728 729
729// safety-check player input which will become object->msg 730// safety-check player input which will become object->msg
730bool msg_is_safe (const char *msg); 731bool msg_is_safe (const char *msg);
731 732
732///////////////////////////////////////////////////////////////////////////// 733/////////////////////////////////////////////////////////////////////////////

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines