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.68 by root, Tue Apr 15 03:16:02 2008 UTC vs.
Revision 1.80 by root, Tue Dec 23 01:51:28 2008 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 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
7 * it under the terms of the GNU General Public License as published by 7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or 8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version. 9 * (at your option) any later version.
… …
20 */ 20 */
21 21
22#ifndef UTIL_H__ 22#ifndef UTIL_H__
23#define UTIL_H__ 23#define UTIL_H__
24 24
25#define DEBUG_SALLOC 0 25#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
26#define PREFER_MALLOC 1 26#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
27#define PREFER_MALLOC 0 // use malloc and not the slice allocator
27 28
28#if __GNUC__ >= 3 29#if __GNUC__ >= 3
29# define is_constant(c) __builtin_constant_p (c) 30# define is_constant(c) __builtin_constant_p (c)
30# define expect(expr,value) __builtin_expect ((expr),(value)) 31# define expect(expr,value) __builtin_expect ((expr),(value))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 32# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
… …
95// as a is often a constant while b is the variable. it is still a bug, though. 96// as a is often a constant while b is the variable. it is still a bug, though.
96template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 97template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
97template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 98template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
98template<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; } 99template<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; }
99 100
101template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
102template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
103template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
104
100template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 105template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
101 106
102template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } 107template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
103template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } 108template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
104 109
110// sign returns -1 or +1
111template<typename T>
112static inline T sign (T v) { return v < 0 ? -1 : +1; }
113// relies on 2c representation
114template<>
115inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
116
117// sign0 returns -1, 0 or +1
118template<typename T>
119static inline T sign0 (T v) { return v ? sign (v) : 0; }
120
121// 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; }
123// div, round-up
124template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; }
125// div, round-down
126template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; }
127
105template<typename T> 128template<typename T>
106static inline T 129static inline T
107lerp (T val, T min_in, T max_in, T min_out, T max_out) 130lerp (T val, T min_in, T max_in, T min_out, T max_out)
108{ 131{
109 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; 132 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
133}
134
135// lerp, round-down
136template<typename T>
137static inline T
138lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
139{
140 return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
141}
142
143// lerp, round-up
144template<typename T>
145static inline T
146lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
147{
148 return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
110} 149}
111 150
112// lots of stuff taken from FXT 151// lots of stuff taken from FXT
113 152
114/* Rotate right. This is used in various places for checksumming */ 153/* Rotate right. This is used in various places for checksumming */
… …
217inline void sfree (T *ptr, int n = 1) throw () 256inline void sfree (T *ptr, int n = 1) throw ()
218{ 257{
219 if (expect_true (ptr)) 258 if (expect_true (ptr))
220 { 259 {
221 slice_alloc -= n * sizeof (T); 260 slice_alloc -= n * sizeof (T);
261 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
222 g_slice_free1 (n * sizeof (T), (void *)ptr); 262 g_slice_free1 (n * sizeof (T), (void *)ptr);
223 assert (slice_alloc >= 0);//D 263 assert (slice_alloc >= 0);//D
224 } 264 }
225} 265}
226 266
267// nulls the pointer
268template<typename T>
269inline void sfree0 (T *&ptr, int n = 1) throw ()
270{
271 sfree<T> (ptr, n);
272 ptr = 0;
273}
274
227// makes dynamically allocated objects zero-initialised 275// makes dynamically allocated objects zero-initialised
228struct zero_initialised 276struct zero_initialised
229{ 277{
230 void *operator new (size_t s, void *p) 278 void *operator new (size_t s, void *p)
231 { 279 {
… …
239 } 287 }
240 288
241 void *operator new[] (size_t s) 289 void *operator new[] (size_t s)
242 { 290 {
243 return salloc0<char> (s); 291 return salloc0<char> (s);
292 }
293
294 void operator delete (void *p, size_t s)
295 {
296 sfree ((char *)p, s);
297 }
298
299 void operator delete[] (void *p, size_t s)
300 {
301 sfree ((char *)p, s);
302 }
303};
304
305// makes dynamically allocated objects zero-initialised
306struct slice_allocated
307{
308 void *operator new (size_t s, void *p)
309 {
310 return p;
311 }
312
313 void *operator new (size_t s)
314 {
315 return salloc<char> (s);
316 }
317
318 void *operator new[] (size_t s)
319 {
320 return salloc<char> (s);
244 } 321 }
245 322
246 void operator delete (void *p, size_t s) 323 void operator delete (void *p, size_t s)
247 { 324 {
248 sfree ((char *)p, s); 325 sfree ((char *)p, s);
… …
326 } 403 }
327 404
328 void seed (uint32_t seed); 405 void seed (uint32_t seed);
329 uint32_t next (); 406 uint32_t next ();
330 407
331 // uniform distribution 408 // uniform distribution, 0 .. max (0, num - 1)
332 uint32_t operator ()(uint32_t num) 409 uint32_t operator ()(uint32_t num)
333 { 410 {
334 return is_constant (num) 411 return is_constant (num)
335 ? (next () * (uint64_t)num) >> 32U 412 ? (next () * (uint64_t)num) >> 32U
336 : get_range (num); 413 : get_range (num);
… …
354 int get_range (int r_min, int r_max); 431 int get_range (int r_min, int r_max);
355}; 432};
356 433
357typedef tausworthe_random_generator rand_gen; 434typedef tausworthe_random_generator rand_gen;
358 435
359extern rand_gen rndm; 436extern rand_gen rndm, rmg_rndm;
360 437
361INTERFACE_CLASS (attachable) 438INTERFACE_CLASS (attachable)
362struct refcnt_base 439struct refcnt_base
363{ 440{
364 typedef int refcnt_t; 441 typedef int refcnt_t;

Diff Legend

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