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.67 by root, Fri Apr 11 21:09:53 2008 UTC vs.
Revision 1.78 by root, Thu Dec 4 03:48:19 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 0 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)
… …
65void *g_slice_alloc0 (unsigned long size); 66void *g_slice_alloc0 (unsigned long size);
66void g_slice_free1 (unsigned long size, void *ptr); 67void g_slice_free1 (unsigned long size, void *ptr);
67#elif PREFER_MALLOC 68#elif PREFER_MALLOC
68# define g_slice_alloc0(s) calloc (1, (s)) 69# define g_slice_alloc0(s) calloc (1, (s))
69# define g_slice_alloc(s) malloc ((s)) 70# define g_slice_alloc(s) malloc ((s))
70# define g_slice_free1(s,p) free ((s)) 71# define g_slice_free1(s,p) free ((p))
71#endif 72#endif
72 73
73// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) 74// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
74#define auto(var,expr) decltype(expr) var = (expr) 75#define auto(var,expr) decltype(expr) var = (expr)
75 76
… …
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> static inline void min_it (T &v, T m) { v = min (v, m); }
102template<typename T> static inline void max_it (T &v, T m) { v = max (v, m); }
103template<typename T> static inline void clamp_it (T &v, T a, T b) { v = clamp (v, a, 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// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
111template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; }
112// div, round-up
113template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; }
114// div, round-down
115template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; }
116
105template<typename T> 117template<typename T>
106static inline T 118static inline T
107lerp (T val, T min_in, T max_in, T min_out, T max_out) 119lerp (T val, T min_in, T max_in, T min_out, T max_out)
108{ 120{
109 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; 121 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
122}
123
124// lerp, round-down
125template<typename T>
126static inline T
127lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
128{
129 return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
130}
131
132// lerp, round-up
133template<typename T>
134static inline T
135lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
136{
137 return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
110} 138}
111 139
112// lots of stuff taken from FXT 140// lots of stuff taken from FXT
113 141
114/* Rotate right. This is used in various places for checksumming */ 142/* Rotate right. This is used in various places for checksumming */
… …
217inline void sfree (T *ptr, int n = 1) throw () 245inline void sfree (T *ptr, int n = 1) throw ()
218{ 246{
219 if (expect_true (ptr)) 247 if (expect_true (ptr))
220 { 248 {
221 slice_alloc -= n * sizeof (T); 249 slice_alloc -= n * sizeof (T);
250 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
222 g_slice_free1 (n * sizeof (T), (void *)ptr); 251 g_slice_free1 (n * sizeof (T), (void *)ptr);
223 assert (slice_alloc >= 0);//D 252 assert (slice_alloc >= 0);//D
224 } 253 }
225} 254}
226 255
256// nulls the pointer
257template<typename T>
258inline void sfree0 (T *&ptr, int n = 1) throw ()
259{
260 sfree<T> (ptr, n);
261 ptr = 0;
262}
263
227// makes dynamically allocated objects zero-initialised 264// makes dynamically allocated objects zero-initialised
228struct zero_initialised 265struct zero_initialised
229{ 266{
230 void *operator new (size_t s, void *p) 267 void *operator new (size_t s, void *p)
231 { 268 {
… …
239 } 276 }
240 277
241 void *operator new[] (size_t s) 278 void *operator new[] (size_t s)
242 { 279 {
243 return salloc0<char> (s); 280 return salloc0<char> (s);
281 }
282
283 void operator delete (void *p, size_t s)
284 {
285 sfree ((char *)p, s);
286 }
287
288 void operator delete[] (void *p, size_t s)
289 {
290 sfree ((char *)p, s);
291 }
292};
293
294// makes dynamically allocated objects zero-initialised
295struct slice_allocated
296{
297 void *operator new (size_t s, void *p)
298 {
299 return p;
300 }
301
302 void *operator new (size_t s)
303 {
304 return salloc<char> (s);
305 }
306
307 void *operator new[] (size_t s)
308 {
309 return salloc<char> (s);
244 } 310 }
245 311
246 void operator delete (void *p, size_t s) 312 void operator delete (void *p, size_t s)
247 { 313 {
248 sfree ((char *)p, s); 314 sfree ((char *)p, s);
… …
326 } 392 }
327 393
328 void seed (uint32_t seed); 394 void seed (uint32_t seed);
329 uint32_t next (); 395 uint32_t next ();
330 396
331 // uniform distribution 397 // uniform distribution, 0 .. max (0, num - 1)
332 uint32_t operator ()(uint32_t num) 398 uint32_t operator ()(uint32_t num)
333 { 399 {
334 return is_constant (num) 400 return is_constant (num)
335 ? (next () * (uint64_t)num) >> 32U 401 ? (next () * (uint64_t)num) >> 32U
336 : get_range (num); 402 : get_range (num);
… …
354 int get_range (int r_min, int r_max); 420 int get_range (int r_min, int r_max);
355}; 421};
356 422
357typedef tausworthe_random_generator rand_gen; 423typedef tausworthe_random_generator rand_gen;
358 424
359extern rand_gen rndm; 425extern rand_gen rndm, rmg_rndm;
360 426
361INTERFACE_CLASS (attachable) 427INTERFACE_CLASS (attachable)
362struct refcnt_base 428struct refcnt_base
363{ 429{
364 typedef int refcnt_t; 430 typedef int refcnt_t;
… …
606#else 672#else
607 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER 673 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
608#endif 674#endif
609 675
610#define SMUTEX(name) smutex name = SMUTEX_INITIALISER 676#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
611#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) 677#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
612#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) 678#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
613 679
680typedef pthread_cond_t scond;
681
682#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
683#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
684#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
685#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
686
614#endif 687#endif
615 688

Diff Legend

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