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.36 by root, Thu Jan 25 03:54:45 2007 UTC vs.
Revision 1.46 by root, Mon May 28 21:15:56 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
4//#define PREFER_MALLOC 26//#define PREFER_MALLOC
5 27
6#if __GNUC__ >= 3 28#if __GNUC__ >= 3
7# 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)
8#else 32#else
9# define is_constant(c) 0 33# define is_constant(c) 0
34# define expect(expr,value) (expr)
35# define prefetch(addr,rw,locality)
10#endif 36#endif
37
38// put into ifs if you are very sure that the expression
39// is mostly true or mosty false. note that these return
40// booleans, not the expression.
41#define expect_false(expr) expect ((expr) != 0, 0)
42#define expect_true(expr) expect ((expr) != 0, 1)
11 43
12#include <cstddef> 44#include <cstddef>
13#include <cmath> 45#include <cmath>
14#include <new> 46#include <new>
15#include <vector> 47#include <vector>
… …
18 50
19#include <shstr.h> 51#include <shstr.h>
20#include <traits.h> 52#include <traits.h>
21 53
22// use a gcc extension for auto declarations until ISO C++ sanctifies them 54// use a gcc extension for auto declarations until ISO C++ sanctifies them
23#define AUTODECL(var,expr) typeof(expr) var = (expr) 55#define auto(var,expr) typeof(expr) var = (expr)
24 56
25// very ugly macro that basicaly declares and initialises a variable 57// very ugly macro that basicaly declares and initialises a variable
26// that is in scope for the next statement only 58// that is in scope for the next statement only
27// works only for stuff that can be assigned 0 and converts to false 59// works only for stuff that can be assigned 0 and converts to false
28// (note: works great for pointers) 60// (note: works great for pointers)
… …
44template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 76template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 77template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
46template<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; } 78template<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; }
47 79
48template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 80template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
81
82template<typename T>
83static inline T
84lerp (T val, T min_in, T max_in, T min_out, T max_out)
85{
86 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
87}
88
89// lots of stuff taken from FXT
90
91/* Rotate right. This is used in various places for checksumming */
92//TODO: that sucks, use a better checksum algo
93static inline uint32_t
94rotate_right (uint32_t c, uint32_t count = 1)
95{
96 return (c << (32 - count)) | (c >> count);
97}
98
99static inline uint32_t
100rotate_left (uint32_t c, uint32_t count = 1)
101{
102 return (c >> (32 - count)) | (c << count);
103}
104
105// Return abs(a-b)
106// Both a and b must not have the most significant bit set
107static inline uint32_t
108upos_abs_diff (uint32_t a, uint32_t b)
109{
110 long d1 = b - a;
111 long d2 = (d1 & (d1 >> 31)) << 1;
112
113 return d1 - d2; // == (b - d) - (a + d);
114}
115
116// Both a and b must not have the most significant bit set
117static inline uint32_t
118upos_min (uint32_t a, uint32_t b)
119{
120 int32_t d = b - a;
121 d &= d >> 31;
122 return a + d;
123}
124
125// Both a and b must not have the most significant bit set
126static inline uint32_t
127upos_max (uint32_t a, uint32_t b)
128{
129 int32_t d = b - a;
130 d &= d >> 31;
131 return b - d;
132}
49 133
50// this is much faster than crossfires original algorithm 134// this is much faster than crossfires original algorithm
51// on modern cpus 135// on modern cpus
52inline int 136inline int
53isqrt (int n) 137isqrt (int n)
… …
217 301
218 void seed (uint32_t seed); 302 void seed (uint32_t seed);
219 uint32_t next (); 303 uint32_t next ();
220 304
221 // uniform distribution 305 // uniform distribution
222 uint32_t operator ()(uint32_t r_max) 306 uint32_t operator ()(uint32_t num)
223 { 307 {
224 return is_constant (r_max) 308 return is_constant (num)
225 ? this->next () % r_max 309 ? (next () * (uint64_t)num) >> 32U
226 : get_range (r_max); 310 : get_range (num);
227 } 311 }
228 312
229 // return a number within (min .. max) 313 // return a number within (min .. max)
230 int operator () (int r_min, int r_max) 314 int operator () (int r_min, int r_max)
231 { 315 {
232 return is_constant (r_min) && is_constant (r_max) 316 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
233 ? r_min + (*this) (max (r_max - r_min + 1, 1)) 317 ? r_min + operator ()(r_max - r_min + 1)
234 : get_range (r_min, r_max); 318 : get_range (r_min, r_max);
235 } 319 }
236 320
237 double operator ()() 321 double operator ()()
238 { 322 {
… …
354 } 438 }
355 439
356 void erase (T *obj) 440 void erase (T *obj)
357 { 441 {
358 assert (obj->*index); 442 assert (obj->*index);
359 int pos = obj->*index; 443 unsigned int pos = obj->*index;
360 obj->*index = 0; 444 obj->*index = 0;
361 445
362 if (pos < this->size ()) 446 if (pos < this->size ())
363 { 447 {
364 (*this)[pos - 1] = (*this)[this->size () - 1]; 448 (*this)[pos - 1] = (*this)[this->size () - 1];
… …
389// return current time as timestampe 473// return current time as timestampe
390tstamp now (); 474tstamp now ();
391 475
392int similar_direction (int a, int b); 476int similar_direction (int a, int b);
393 477
478// like printf, but returns a std::string
479const std::string format (const char *format, ...);
480
394#endif 481#endif
395 482

Diff Legend

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