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.84 by root, Wed Dec 31 17:35:37 2008 UTC vs.
Revision 1.94 by root, Sun Nov 8 16:13:45 2009 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 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#else
34# define is_constant(c) 0
35# define expect(expr,value) (expr)
36# define prefetch(addr,rw,locality)
37#endif
38
39#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
40# define decltype(x) typeof(x)
41#endif
42
43// put into ifs if you are very sure that the expression
44// is mostly true or mosty false. note that these return
45// booleans, not the expression.
46#define expect_false(expr) expect ((expr) ? 1 : 0, 0)
47#define expect_true(expr) expect ((expr) ? 1 : 0, 1)
48 31
49#include <pthread.h> 32#include <pthread.h>
50 33
51#include <cstddef> 34#include <cstddef>
52#include <cmath> 35#include <cmath>
… …
116 99
117// sign0 returns -1, 0 or +1 100// sign0 returns -1, 0 or +1
118template<typename T> 101template<typename T>
119static inline T sign0 (T v) { return v ? sign (v) : 0; } 102static inline T sign0 (T v) { return v ? sign (v) : 0; }
120 103
104// div* only work correctly for div > 0
121// div, with correct rounding (< 0.5 downwards, >=0.5 upwards) 105// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
122template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; } 106template<typename T> static inline T div (T val, T div)
107{
108 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
109}
123// div, round-up 110// div, round-up
124template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } 111template<typename T> static inline T div_ru (T val, T div)
112{
113 return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div;
114}
125// div, round-down 115// div, round-down
126template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } 116template<typename T> static inline T div_rd (T val, T div)
117{
118 return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div;
119}
127 120
121// lerp* only work correctly for min_in < max_in
122// Linear intERPolate, scales val from min_in..max_in to min_out..max_out
128template<typename T> 123template<typename T>
129static inline T 124static inline T
130lerp (T val, T min_in, T max_in, T min_out, T max_out) 125lerp (T val, T min_in, T max_in, T min_out, T max_out)
131{ 126{
132 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); 127 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
… …
191 int32_t d = b - a; 186 int32_t d = b - a;
192 d &= d >> 31; 187 d &= d >> 31;
193 return b - d; 188 return b - d;
194} 189}
195 190
196// this is much faster than crossfires original algorithm 191// this is much faster than crossfire's original algorithm
197// on modern cpus 192// on modern cpus
198inline int 193inline int
199isqrt (int n) 194isqrt (int n)
200{ 195{
201 return (int)sqrtf ((float)n); 196 return (int)sqrtf ((float)n);
197}
198
199// this is kind of like the ^^ operator, if it would exist, without sequence point.
200// more handy than it looks like, due to the implicit !! done on its arguments
201inline bool
202logical_xor (bool a, bool b)
203{
204 return a != b;
205}
206
207inline bool
208logical_implies (bool a, bool b)
209{
210 return a <= b;
202} 211}
203 212
204// this is only twice as fast as naive sqrtf (dx*dy+dy*dy) 213// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
205#if 0 214#if 0
206// and has a max. error of 6 in the range -100..+100. 215// and has a max. error of 6 in the range -100..+100.
… …
407 416
408// Xorshift RNGs, George Marsaglia 417// Xorshift RNGs, George Marsaglia
409// http://www.jstatsoft.org/v08/i14/paper 418// http://www.jstatsoft.org/v08/i14/paper
410// this one is about 40% faster than the tausworthe one above (i.e. not much), 419// this one is about 40% faster than the tausworthe one above (i.e. not much),
411// despite the inlining, and has the issue of only creating 2**32-1 numbers. 420// despite the inlining, and has the issue of only creating 2**32-1 numbers.
421// see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf
412struct xorshift_random_generator 422struct xorshift_random_generator
413{ 423{
414 uint32_t x, y; 424 uint32_t x, y;
415 425
416 void operator =(const xorshift_random_generator &src) 426 void operator =(const xorshift_random_generator &src)
… …
673 erase (&obj); 683 erase (&obj);
674 } 684 }
675}; 685};
676 686
677// basically does what strncpy should do, but appends "..." to strings exceeding length 687// basically does what strncpy should do, but appends "..." to strings exceeding length
688// returns the number of bytes actually used (including \0)
678void assign (char *dst, const char *src, int maxlen); 689int assign (char *dst, const char *src, int maxsize);
679 690
680// type-safe version of assign 691// type-safe version of assign
681template<int N> 692template<int N>
682inline void assign (char (&dst)[N], const char *src) 693inline int assign (char (&dst)[N], const char *src)
683{ 694{
684 assign ((char *)&dst, src, N); 695 return assign ((char *)&dst, src, N);
685} 696}
686 697
687typedef double tstamp; 698typedef double tstamp;
688 699
689// return current time as timestamp 700// return current time as timestamp
690tstamp now (); 701tstamp now ();
691 702
692int similar_direction (int a, int b); 703int similar_direction (int a, int b);
693 704
694// like sprintf, but returns a "static" buffer 705// like v?sprintf, but returns a "static" buffer
695const char *format (const char *format, ...); 706char *vformat (const char *format, va_list ap);
707char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
708
709// safety-check player input which will become object->msg
710bool msg_is_safe (const char *msg);
696 711
697///////////////////////////////////////////////////////////////////////////// 712/////////////////////////////////////////////////////////////////////////////
698// threads, very very thin wrappers around pthreads 713// threads, very very thin wrappers around pthreads
699 714
700struct thread 715struct thread

Diff Legend

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