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.59 by root, Sun Dec 16 02:50:33 2007 UTC vs.
Revision 1.77 by root, Thu May 8 14:20: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 PREFER_MALLOC 25#define DEBUG_POISON 0x00 // poison memory before freeing it if != 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
26 28
27#if __GNUC__ >= 3 29#if __GNUC__ >= 3
28# define is_constant(c) __builtin_constant_p (c) 30# define is_constant(c) __builtin_constant_p (c)
29# define expect(expr,value) __builtin_expect ((expr),(value)) 31# define expect(expr,value) __builtin_expect ((expr),(value))
30# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 32# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
42// is mostly true or mosty false. note that these return 44// is mostly true or mosty false. note that these return
43// booleans, not the expression. 45// booleans, not the expression.
44#define expect_false(expr) expect ((expr) != 0, 0) 46#define expect_false(expr) expect ((expr) != 0, 0)
45#define expect_true(expr) expect ((expr) != 0, 1) 47#define expect_true(expr) expect ((expr) != 0, 1)
46 48
49#include <pthread.h>
50
47#include <cstddef> 51#include <cstddef>
48#include <cmath> 52#include <cmath>
49#include <new> 53#include <new>
50#include <vector> 54#include <vector>
51 55
52#include <glib.h> 56#include <glib.h>
53 57
54#include <shstr.h> 58#include <shstr.h>
55#include <traits.h> 59#include <traits.h>
60
61#if DEBUG_SALLOC
62# define g_slice_alloc0(s) debug_slice_alloc0(s)
63# define g_slice_alloc(s) debug_slice_alloc(s)
64# define g_slice_free1(s,p) debug_slice_free1(s,p)
65void *g_slice_alloc (unsigned long size);
66void *g_slice_alloc0 (unsigned long size);
67void g_slice_free1 (unsigned long size, void *ptr);
68#elif PREFER_MALLOC
69# define g_slice_alloc0(s) calloc (1, (s))
70# define g_slice_alloc(s) malloc ((s))
71# define g_slice_free1(s,p) free ((p))
72#endif
56 73
57// 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)
58#define auto(var,expr) decltype(expr) var = (expr) 75#define auto(var,expr) decltype(expr) var = (expr)
59 76
60// very ugly macro that basicaly declares and initialises a variable 77// very ugly macro that basicaly declares and initialises a variable
70 87
71// in range excluding end 88// in range excluding end
72#define IN_RANGE_EXC(val,beg,end) \ 89#define IN_RANGE_EXC(val,beg,end) \
73 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 90 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
74 91
92void cleanup (const char *cause, bool make_core = false);
75void fork_abort (const char *msg); 93void fork_abort (const char *msg);
76 94
77// rationale for using (U) not (T) is to reduce signed/unsigned issues, 95// rationale for using (U) not (T) is to reduce signed/unsigned issues,
78// 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.
79template<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; }
80template<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; }
81template<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; }
82 100
83template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 101template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
102
103template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
104template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
84 105
85template<typename T> 106template<typename T>
86static inline T 107static inline T
87lerp (T val, T min_in, T max_in, T min_out, T max_out) 108lerp (T val, T min_in, T max_in, T min_out, T max_out)
88{ 109{
172absdir (int d) 193absdir (int d)
173{ 194{
174 return ((d - 1) & 7) + 1; 195 return ((d - 1) & 7) + 1;
175} 196}
176 197
177extern size_t slice_alloc; // statistics 198extern ssize_t slice_alloc; // statistics
178
179// makes dynamically allocated objects zero-initialised
180struct zero_initialised
181{
182 void *operator new (size_t s, void *p)
183 {
184 memset (p, 0, s);
185 return p;
186 }
187
188 void *operator new (size_t s)
189 {
190 slice_alloc += s;
191 return g_slice_alloc0 (s);
192 }
193
194 void *operator new[] (size_t s)
195 {
196 slice_alloc += s;
197 return g_slice_alloc0 (s);
198 }
199
200 void operator delete (void *p, size_t s)
201 {
202 slice_alloc -= s;
203 g_slice_free1 (s, p);
204 }
205
206 void operator delete[] (void *p, size_t s)
207 {
208 slice_alloc -= s;
209 g_slice_free1 (s, p);
210 }
211};
212 199
213void *salloc_ (int n) throw (std::bad_alloc); 200void *salloc_ (int n) throw (std::bad_alloc);
214void *salloc_ (int n, void *src) throw (std::bad_alloc); 201void *salloc_ (int n, void *src) throw (std::bad_alloc);
215 202
216// strictly the same as g_slice_alloc, but never returns 0 203// strictly the same as g_slice_alloc, but never returns 0
228 215
229// for symmetry 216// for symmetry
230template<typename T> 217template<typename T>
231inline void sfree (T *ptr, int n = 1) throw () 218inline void sfree (T *ptr, int n = 1) throw ()
232{ 219{
233#ifdef PREFER_MALLOC 220 if (expect_true (ptr))
234 free (ptr); 221 {
235#else
236 slice_alloc -= n * sizeof (T); 222 slice_alloc -= n * sizeof (T);
223 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
237 g_slice_free1 (n * sizeof (T), (void *)ptr); 224 g_slice_free1 (n * sizeof (T), (void *)ptr);
238#endif 225 assert (slice_alloc >= 0);//D
226 }
239} 227}
228
229// nulls the pointer
230template<typename T>
231inline void sfree0 (T *&ptr, int n = 1) throw ()
232{
233 sfree<T> (ptr, n);
234 ptr = 0;
235}
236
237// makes dynamically allocated objects zero-initialised
238struct zero_initialised
239{
240 void *operator new (size_t s, void *p)
241 {
242 memset (p, 0, s);
243 return p;
244 }
245
246 void *operator new (size_t s)
247 {
248 return salloc0<char> (s);
249 }
250
251 void *operator new[] (size_t s)
252 {
253 return salloc0<char> (s);
254 }
255
256 void operator delete (void *p, size_t s)
257 {
258 sfree ((char *)p, s);
259 }
260
261 void operator delete[] (void *p, size_t s)
262 {
263 sfree ((char *)p, s);
264 }
265};
266
267// makes dynamically allocated objects zero-initialised
268struct slice_allocated
269{
270 void *operator new (size_t s, void *p)
271 {
272 return p;
273 }
274
275 void *operator new (size_t s)
276 {
277 return salloc<char> (s);
278 }
279
280 void *operator new[] (size_t s)
281 {
282 return salloc<char> (s);
283 }
284
285 void operator delete (void *p, size_t s)
286 {
287 sfree ((char *)p, s);
288 }
289
290 void operator delete[] (void *p, size_t s)
291 {
292 sfree ((char *)p, s);
293 }
294};
240 295
241// a STL-compatible allocator that uses g_slice 296// a STL-compatible allocator that uses g_slice
242// boy, this is verbose 297// boy, this is verbose
243template<typename Tp> 298template<typename Tp>
244struct slice_allocator 299struct slice_allocator
256 { 311 {
257 typedef slice_allocator<U> other; 312 typedef slice_allocator<U> other;
258 }; 313 };
259 314
260 slice_allocator () throw () { } 315 slice_allocator () throw () { }
261 slice_allocator (const slice_allocator &o) throw () { } 316 slice_allocator (const slice_allocator &) throw () { }
262 template<typename Tp2> 317 template<typename Tp2>
263 slice_allocator (const slice_allocator<Tp2> &) throw () { } 318 slice_allocator (const slice_allocator<Tp2> &) throw () { }
264 319
265 ~slice_allocator () { } 320 ~slice_allocator () { }
266 321
275 void deallocate (pointer p, size_type n) 330 void deallocate (pointer p, size_type n)
276 { 331 {
277 sfree<Tp> (p, n); 332 sfree<Tp> (p, n);
278 } 333 }
279 334
280 size_type max_size ()const throw () 335 size_type max_size () const throw ()
281 { 336 {
282 return size_t (-1) / sizeof (Tp); 337 return size_t (-1) / sizeof (Tp);
283 } 338 }
284 339
285 void construct (pointer p, const Tp &val) 340 void construct (pointer p, const Tp &val)
310 } 365 }
311 366
312 void seed (uint32_t seed); 367 void seed (uint32_t seed);
313 uint32_t next (); 368 uint32_t next ();
314 369
315 // uniform distribution 370 // uniform distribution, 0 .. max (0, num - 1)
316 uint32_t operator ()(uint32_t num) 371 uint32_t operator ()(uint32_t num)
317 { 372 {
318 return is_constant (num) 373 return is_constant (num)
319 ? (next () * (uint64_t)num) >> 32U 374 ? (next () * (uint64_t)num) >> 32U
320 : get_range (num); 375 : get_range (num);
338 int get_range (int r_min, int r_max); 393 int get_range (int r_min, int r_max);
339}; 394};
340 395
341typedef tausworthe_random_generator rand_gen; 396typedef tausworthe_random_generator rand_gen;
342 397
343extern rand_gen rndm; 398extern rand_gen rndm, rmg_rndm;
344 399
345INTERFACE_CLASS (attachable) 400INTERFACE_CLASS (attachable)
346struct refcnt_base 401struct refcnt_base
347{ 402{
348 typedef int refcnt_t; 403 typedef int refcnt_t;
555int similar_direction (int a, int b); 610int similar_direction (int a, int b);
556 611
557// like sprintf, but returns a "static" buffer 612// like sprintf, but returns a "static" buffer
558const char *format (const char *format, ...); 613const char *format (const char *format, ...);
559 614
615/////////////////////////////////////////////////////////////////////////////
616// threads, very very thin wrappers around pthreads
617
618struct thread
619{
620 pthread_t id;
621
622 void start (void *(*start_routine)(void *), void *arg = 0);
623
624 void cancel ()
625 {
626 pthread_cancel (id);
627 }
628
629 void *join ()
630 {
631 void *ret;
632
633 if (pthread_join (id, &ret))
634 cleanup ("pthread_join failed", 1);
635
636 return ret;
637 }
638};
639
640// note that mutexes are not classes
641typedef pthread_mutex_t smutex;
642
643#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
644 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
645#else
646 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
560#endif 647#endif
561 648
649#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
650#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
651#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
652
653typedef pthread_cond_t scond;
654
655#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
656#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
657#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
658#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
659
660#endif
661

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines