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.100 by root, Thu Apr 22 13:01:58 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);
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;
217} 214}
218 215
219// 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)
220#if 0 217#if 0
221// 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.
… …
246absdir (int d) 243absdir (int d)
247{ 244{
248 return ((d - 1) & 7) + 1; 245 return ((d - 1) & 7) + 1;
249} 246}
250 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
251extern ssize_t slice_alloc; // statistics 262extern ssize_t slice_alloc; // statistics
252 263
253void *salloc_ (int n) throw (std::bad_alloc); 264void *salloc_ (int n) throw (std::bad_alloc);
254void *salloc_ (int n, void *src) throw (std::bad_alloc); 265void *salloc_ (int n, void *src) throw (std::bad_alloc);
255 266
… …
459 return !is_constant (num) ? get_range (num) // non-constant 470 return !is_constant (num) ? get_range (num) // non-constant
460 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two 471 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
461 : this->next () & (num - 1); // constant, power-of-two 472 : this->next () & (num - 1); // constant, power-of-two
462 } 473 }
463 474
464 // return a number within (min .. max) 475 // return a number within the closed interval [min .. max]
465 int operator () (int r_min, int r_max) 476 int operator () (int r_min, int r_max)
466 { 477 {
467 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max 478 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
468 ? r_min + operator ()(r_max - r_min + 1) 479 ? r_min + operator ()(r_max - r_min + 1)
469 : get_range (r_min, r_max); 480 : get_range (r_min, r_max);
470 } 481 }
471 482
483 // return a number within the closed interval [0..1]
472 double operator ()() 484 double operator ()()
473 { 485 {
474 return this->next () / (double)0xFFFFFFFFU; 486 return this->next () / (double)0xFFFFFFFFU;
475 } 487 }
476 488
… …
552typedef refptr<object> object_ptr; 564typedef refptr<object> object_ptr;
553typedef refptr<archetype> arch_ptr; 565typedef refptr<archetype> arch_ptr;
554typedef refptr<client> client_ptr; 566typedef refptr<client> client_ptr;
555typedef refptr<player> player_ptr; 567typedef refptr<player> player_ptr;
556 568
569#define STRHSH_NULL 2166136261
570
571static inline uint32_t
572strhsh (const char *s)
573{
574 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
575 // it is about twice as fast as the one-at-a-time one,
576 // with good distribution.
577 // FNV-1a is faster on many cpus because the multiplication
578 // runs concurrently with the looping logic.
579 uint32_t hash = STRHSH_NULL;
580
581 while (*s)
582 hash = (hash ^ *s++) * 16777619U;
583
584 return hash;
585}
586
587static inline uint32_t
588memhsh (const char *s, size_t len)
589{
590 uint32_t hash = STRHSH_NULL;
591
592 while (len--)
593 hash = (hash ^ *s++) * 16777619U;
594
595 return hash;
596}
597
557struct str_hash 598struct str_hash
558{ 599{
559 std::size_t operator ()(const char *s) const 600 std::size_t operator ()(const char *s) const
560 { 601 {
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; 602 return strhsh (s);
603 }
604
605 std::size_t operator ()(const shstr &s) const
606 {
607 return strhsh (s);
592 } 608 }
593}; 609};
594 610
595struct str_equal 611struct str_equal
596{ 612{
… …
708 724
709int similar_direction (int a, int b); 725int similar_direction (int a, int b);
710 726
711// like v?sprintf, but returns a "static" buffer 727// like v?sprintf, but returns a "static" buffer
712char *vformat (const char *format, va_list ap); 728char *vformat (const char *format, va_list ap);
713char *format (const char *format, ...); 729char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
714 730
715// safety-check player input which will become object->msg 731// safety-check player input which will become object->msg
716bool msg_is_safe (const char *msg); 732bool msg_is_safe (const char *msg);
717 733
718///////////////////////////////////////////////////////////////////////////// 734/////////////////////////////////////////////////////////////////////////////

Diff Legend

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