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.35 by root, Fri Jan 19 22:47:57 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
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// 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)
9 43
10#include <cstddef> 44#include <cstddef>
11#include <cmath> 45#include <cmath>
12#include <new> 46#include <new>
13#include <vector> 47#include <vector>
… …
16 50
17#include <shstr.h> 51#include <shstr.h>
18#include <traits.h> 52#include <traits.h>
19 53
20// 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
21#define AUTODECL(var,expr) typeof(expr) var = (expr) 55#define auto(var,expr) typeof(expr) var = (expr)
22 56
23// very ugly macro that basicaly declares and initialises a variable 57// very ugly macro that basicaly declares and initialises a variable
24// that is in scope for the next statement only 58// that is in scope for the next statement only
25// 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
26// (note: works great for pointers) 60// (note: works great for pointers)
… …
42template<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; }
43template<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; }
44template<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; }
45 79
46template<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}
47 133
48// this is much faster than crossfires original algorithm 134// this is much faster than crossfires original algorithm
49// on modern cpus 135// on modern cpus
50inline int 136inline int
51isqrt (int n) 137isqrt (int n)
… …
133 219
134// for symmetry 220// for symmetry
135template<typename T> 221template<typename T>
136inline void sfree (T *ptr, int n = 1) throw () 222inline void sfree (T *ptr, int n = 1) throw ()
137{ 223{
224#ifdef PREFER_MALLOC
225 free (ptr);
226#else
138 g_slice_free1 (n * sizeof (T), (void *)ptr); 227 g_slice_free1 (n * sizeof (T), (void *)ptr);
228#endif
139} 229}
140 230
141// a STL-compatible allocator that uses g_slice 231// a STL-compatible allocator that uses g_slice
142// boy, this is verbose 232// boy, this is verbose
143template<typename Tp> 233template<typename Tp>
… …
211 301
212 void seed (uint32_t seed); 302 void seed (uint32_t seed);
213 uint32_t next (); 303 uint32_t next ();
214 304
215 // uniform distribution 305 // uniform distribution
216 uint32_t operator ()(uint32_t r_max) 306 uint32_t operator ()(uint32_t num)
217 { 307 {
218 return is_constant (r_max) 308 return is_constant (num)
219 ? this->next () % r_max 309 ? (next () * (uint64_t)num) >> 32U
220 : get_range (r_max); 310 : get_range (num);
221 } 311 }
222 312
223 // return a number within (min .. max) 313 // return a number within (min .. max)
224 int operator () (int r_min, int r_max) 314 int operator () (int r_min, int r_max)
225 { 315 {
226 return is_constant (r_min) && is_constant (r_max) 316 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
227 ? r_min + (*this) (max (r_max - r_min + 1, 1)) 317 ? r_min + operator ()(r_max - r_min + 1)
228 : get_range (r_min, r_max); 318 : get_range (r_min, r_max);
229 } 319 }
230 320
231 double operator ()() 321 double operator ()()
232 { 322 {
… …
348 } 438 }
349 439
350 void erase (T *obj) 440 void erase (T *obj)
351 { 441 {
352 assert (obj->*index); 442 assert (obj->*index);
353 int pos = obj->*index; 443 unsigned int pos = obj->*index;
354 obj->*index = 0; 444 obj->*index = 0;
355 445
356 if (pos < this->size ()) 446 if (pos < this->size ())
357 { 447 {
358 (*this)[pos - 1] = (*this)[this->size () - 1]; 448 (*this)[pos - 1] = (*this)[this->size () - 1];
… …
383// return current time as timestampe 473// return current time as timestampe
384tstamp now (); 474tstamp now ();
385 475
386int similar_direction (int a, int b); 476int similar_direction (int a, int b);
387 477
478// like printf, but returns a std::string
479const std::string format (const char *format, ...);
480
388#endif 481#endif
389 482

Diff Legend

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