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.97 by root, Fri Mar 26 01:04:44 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>
… …
206 int32_t d = b - a; 186 int32_t d = b - a;
207 d &= d >> 31; 187 d &= d >> 31;
208 return b - d; 188 return b - d;
209} 189}
210 190
211// this is much faster than crossfires original algorithm 191// this is much faster than crossfire's original algorithm
212// on modern cpus 192// on modern cpus
213inline int 193inline int
214isqrt (int n) 194isqrt (int n)
215{ 195{
216 return (int)sqrtf ((float)n); 196 return (int)sqrtf ((float)n);
… …
260absdir (int d) 240absdir (int d)
261{ 241{
262 return ((d - 1) & 7) + 1; 242 return ((d - 1) & 7) + 1;
263} 243}
264 244
245// avoid ctz name because netbsd or freebsd spams it's namespace with it
246#if GCC_VERSION(3,4)
247static inline int least_significant_bit (uint32_t x)
248{
249 return __builtin_ctz (x);
250}
251#else
252int least_significant_bit (uint32_t x);
253#endif
254
255#define for_all_bits_sparse_32(mask, idxvar) \
256 for (uint32_t idxvar, mask_ = mask; \
257 mask_ && ((idxvar = least_significant_bit (mask_)), mask_ &= ~(1 << idxvar), 1);)
258
265extern ssize_t slice_alloc; // statistics 259extern ssize_t slice_alloc; // statistics
266 260
267void *salloc_ (int n) throw (std::bad_alloc); 261void *salloc_ (int n) throw (std::bad_alloc);
268void *salloc_ (int n, void *src) throw (std::bad_alloc); 262void *salloc_ (int n, void *src) throw (std::bad_alloc);
269 263
… …
566typedef refptr<object> object_ptr; 560typedef refptr<object> object_ptr;
567typedef refptr<archetype> arch_ptr; 561typedef refptr<archetype> arch_ptr;
568typedef refptr<client> client_ptr; 562typedef refptr<client> client_ptr;
569typedef refptr<player> player_ptr; 563typedef refptr<player> player_ptr;
570 564
565#define STRHSH_NULL 2166136261
566
567static inline uint32_t
568strhsh (const char *s)
569{
570 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
571 // it is about twice as fast as the one-at-a-time one,
572 // with good distribution.
573 // FNV-1a is faster on many cpus because the multiplication
574 // runs concurrently with the looping logic.
575 uint32_t hash = STRHSH_NULL;
576
577 while (*s)
578 hash = (hash ^ *s++) * 16777619;
579
580 return hash;
581}
582
583static inline uint32_t
584memhsh (const char *s, size_t len)
585{
586 uint32_t hash = STRHSH_NULL;
587
588 while (len--)
589 hash = (hash ^ *s++) * 16777619;
590
591 return hash;
592}
593
571struct str_hash 594struct str_hash
572{ 595{
573 std::size_t operator ()(const char *s) const 596 std::size_t operator ()(const char *s) const
574 { 597 {
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; 598 return strhsh (s);
599 }
600
601 std::size_t operator ()(const shstr &s) const
602 {
603 return strhsh (s);
606 } 604 }
607}; 605};
608 606
609struct str_equal 607struct str_equal
610{ 608{
… …
722 720
723int similar_direction (int a, int b); 721int similar_direction (int a, int b);
724 722
725// like v?sprintf, but returns a "static" buffer 723// like v?sprintf, but returns a "static" buffer
726char *vformat (const char *format, va_list ap); 724char *vformat (const char *format, va_list ap);
727char *format (const char *format, ...); 725char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
728 726
729// safety-check player input which will become object->msg 727// safety-check player input which will become object->msg
730bool msg_is_safe (const char *msg); 728bool msg_is_safe (const char *msg);
731 729
732///////////////////////////////////////////////////////////////////////////// 730/////////////////////////////////////////////////////////////////////////////

Diff Legend

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