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.33 by root, Thu Jan 18 22:20:00 2007 UTC vs.
Revision 1.47 by root, Sat Jun 2 03:48:29 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 *
6 * Crossfire TRT is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License as published by the Free
8 * Software Foundation; either version 2 of the License, or (at your option)
9 * any later version.
10 *
11 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * for more details.
15 *
16 * You should have received a copy of the GNU General Public License along
17 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
18 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 *
20 * The authors can be reached via e-mail to <crossfire@schmorp.de>
21 */
22
1#ifndef UTIL_H__ 23#ifndef UTIL_H__
2#define UTIL_H__ 24#define UTIL_H__
3 25
26//#define PREFER_MALLOC
27
4#if __GNUC__ >= 3 28#if __GNUC__ >= 3
5# define is_constant(c) __builtin_constant_p (c) 29# define is_constant(c) __builtin_constant_p (c)
30# define expect(expr,value) __builtin_expect ((expr),(value))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
6#else 32#else
7# define is_constant(c) 0 33# define is_constant(c) 0
34# define expect(expr,value) (expr)
35# define prefetch(addr,rw,locality)
8#endif 36#endif
37
38#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
39# define decltype(x) typeof(x)
40#endif
41
42// put into ifs if you are very sure that the expression
43// is mostly true or mosty false. note that these return
44// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1)
9 47
10#include <cstddef> 48#include <cstddef>
11#include <cmath> 49#include <cmath>
12#include <new> 50#include <new>
13#include <vector> 51#include <vector>
… …
16 54
17#include <shstr.h> 55#include <shstr.h>
18#include <traits.h> 56#include <traits.h>
19 57
20// use a gcc extension for auto declarations until ISO C++ sanctifies them 58// use a gcc extension for auto declarations until ISO C++ sanctifies them
21#define AUTODECL(var,expr) typeof(expr) var = (expr) 59#define auto(var,expr) decltype(expr) var = (expr)
22 60
23// very ugly macro that basicaly declares and initialises a variable 61// very ugly macro that basicaly declares and initialises a variable
24// that is in scope for the next statement only 62// that is in scope for the next statement only
25// works only for stuff that can be assigned 0 and converts to false 63// works only for stuff that can be assigned 0 and converts to false
26// (note: works great for pointers) 64// (note: works great for pointers)
… …
35#define IN_RANGE_EXC(val,beg,end) \ 73#define IN_RANGE_EXC(val,beg,end) \
36 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 74 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
37 75
38void fork_abort (const char *msg); 76void fork_abort (const char *msg);
39 77
78// rationale for using (U) not (T) is to reduce signed/unsigned issues,
79// as a is often a constant while b is the variable. it is still a bug, though.
40template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 80template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
41template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 81template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
42template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } 82template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; }
43 83
44template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 84template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
85
86template<typename T>
87static inline T
88lerp (T val, T min_in, T max_in, T min_out, T max_out)
89{
90 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
91}
92
93// lots of stuff taken from FXT
94
95/* Rotate right. This is used in various places for checksumming */
96//TODO: that sucks, use a better checksum algo
97static inline uint32_t
98rotate_right (uint32_t c, uint32_t count = 1)
99{
100 return (c << (32 - count)) | (c >> count);
101}
102
103static inline uint32_t
104rotate_left (uint32_t c, uint32_t count = 1)
105{
106 return (c >> (32 - count)) | (c << count);
107}
108
109// Return abs(a-b)
110// Both a and b must not have the most significant bit set
111static inline uint32_t
112upos_abs_diff (uint32_t a, uint32_t b)
113{
114 long d1 = b - a;
115 long d2 = (d1 & (d1 >> 31)) << 1;
116
117 return d1 - d2; // == (b - d) - (a + d);
118}
119
120// Both a and b must not have the most significant bit set
121static inline uint32_t
122upos_min (uint32_t a, uint32_t b)
123{
124 int32_t d = b - a;
125 d &= d >> 31;
126 return a + d;
127}
128
129// Both a and b must not have the most significant bit set
130static inline uint32_t
131upos_max (uint32_t a, uint32_t b)
132{
133 int32_t d = b - a;
134 d &= d >> 31;
135 return b - d;
136}
45 137
46// this is much faster than crossfires original algorithm 138// this is much faster than crossfires original algorithm
47// on modern cpus 139// on modern cpus
48inline int 140inline int
49isqrt (int n) 141isqrt (int n)
… …
131 223
132// for symmetry 224// for symmetry
133template<typename T> 225template<typename T>
134inline void sfree (T *ptr, int n = 1) throw () 226inline void sfree (T *ptr, int n = 1) throw ()
135{ 227{
228#ifdef PREFER_MALLOC
229 free (ptr);
230#else
136 g_slice_free1 (n * sizeof (T), (void *)ptr); 231 g_slice_free1 (n * sizeof (T), (void *)ptr);
232#endif
137} 233}
138 234
139// a STL-compatible allocator that uses g_slice 235// a STL-compatible allocator that uses g_slice
140// boy, this is verbose 236// boy, this is verbose
141template<typename Tp> 237template<typename Tp>
… …
194// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. 290// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
195// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 291// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
196// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 292// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
197struct tausworthe_random_generator 293struct tausworthe_random_generator
198{ 294{
295 // generator
199 uint32_t state [4]; 296 uint32_t state [4];
200 297
201 tausworthe_random_generator (uint32_t seed); 298 void operator =(const tausworthe_random_generator &src)
299 {
300 state [0] = src.state [0];
301 state [1] = src.state [1];
302 state [2] = src.state [2];
303 state [3] = src.state [3];
304 }
305
306 void seed (uint32_t seed);
202 uint32_t next (); 307 uint32_t next ();
203 308
309 // uniform distribution
204 uint32_t operator ()(uint32_t r_max) 310 uint32_t operator ()(uint32_t num)
205 { 311 {
206 return next () % r_max; 312 return is_constant (num)
313 ? (next () * (uint64_t)num) >> 32U
314 : get_range (num);
207 } 315 }
208 316
209 // return a number within (min .. max) 317 // return a number within (min .. max)
210 int operator () (int r_min, int r_max) 318 int operator () (int r_min, int r_max)
211 { 319 {
212 return r_min + (*this) (max (r_max - r_min + 1, 1)); 320 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
321 ? r_min + operator ()(r_max - r_min + 1)
322 : get_range (r_min, r_max);
213 } 323 }
214 324
215 double operator ()() 325 double operator ()()
216 { 326 {
217 return next () / (double)0xFFFFFFFFU; 327 return this->next () / (double)0xFFFFFFFFU;
218 } 328 }
329
330protected:
331 uint32_t get_range (uint32_t r_max);
332 int get_range (int r_min, int r_max);
219}; 333};
220 334
221typedef tausworthe_random_generator rand_gen; 335typedef tausworthe_random_generator rand_gen;
222 336
223extern rand_gen rndm; 337extern rand_gen rndm;
… …
328 } 442 }
329 443
330 void erase (T *obj) 444 void erase (T *obj)
331 { 445 {
332 assert (obj->*index); 446 assert (obj->*index);
333 int pos = obj->*index; 447 unsigned int pos = obj->*index;
334 obj->*index = 0; 448 obj->*index = 0;
335 449
336 if (pos < this->size ()) 450 if (pos < this->size ())
337 { 451 {
338 (*this)[pos - 1] = (*this)[this->size () - 1]; 452 (*this)[pos - 1] = (*this)[this->size () - 1];
… …
363// return current time as timestampe 477// return current time as timestampe
364tstamp now (); 478tstamp now ();
365 479
366int similar_direction (int a, int b); 480int similar_direction (int a, int b);
367 481
368#endif 482// like printf, but returns a std::string
483const std::string format (const char *format, ...);
369 484
485#endif
486

Diff Legend

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