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.64 by root, Mon Mar 24 20:39:34 2008 UTC vs.
Revision 1.76 by root, Thu May 8 11:39:23 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 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)
43// is mostly true or mosty false. note that these return 44// is mostly true or mosty false. note that these return
44// booleans, not the expression. 45// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0) 46#define expect_false(expr) expect ((expr) != 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1) 47#define expect_true(expr) expect ((expr) != 0, 1)
47 48
49#include <pthread.h>
50
48#include <cstddef> 51#include <cstddef>
49#include <cmath> 52#include <cmath>
50#include <new> 53#include <new>
51#include <vector> 54#include <vector>
52 55
53#include <glib.h> 56#include <glib.h>
54 57
55#include <shstr.h> 58#include <shstr.h>
56#include <traits.h> 59#include <traits.h>
57 60
58#ifdef DEBUG_SALLOC 61#if DEBUG_SALLOC
59# define g_slice_alloc0(s) debug_slice_alloc0(s) 62# define g_slice_alloc0(s) debug_slice_alloc0(s)
60# define g_slice_alloc(s) debug_slice_alloc(s) 63# define g_slice_alloc(s) debug_slice_alloc(s)
61# define g_slice_free1(s,p) debug_slice_free1(s,p) 64# define g_slice_free1(s,p) debug_slice_free1(s,p)
62void *g_slice_alloc (unsigned long size); 65void *g_slice_alloc (unsigned long size);
63void *g_slice_alloc0 (unsigned long size); 66void *g_slice_alloc0 (unsigned long size);
64void g_slice_free1 (unsigned long size, void *ptr); 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))
65#endif 72#endif
66 73
67// 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)
68#define auto(var,expr) decltype(expr) var = (expr) 75#define auto(var,expr) decltype(expr) var = (expr)
69 76
80 87
81// in range excluding end 88// in range excluding end
82#define IN_RANGE_EXC(val,beg,end) \ 89#define IN_RANGE_EXC(val,beg,end) \
83 ((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))
84 91
92void cleanup (const char *cause, bool make_core = false);
85void fork_abort (const char *msg); 93void fork_abort (const char *msg);
86 94
87// 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,
88// 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.
89template<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; }
185absdir (int d) 193absdir (int d)
186{ 194{
187 return ((d - 1) & 7) + 1; 195 return ((d - 1) & 7) + 1;
188} 196}
189 197
190extern size_t slice_alloc; // statistics 198extern ssize_t slice_alloc; // statistics
191
192// makes dynamically allocated objects zero-initialised
193struct zero_initialised
194{
195 void *operator new (size_t s, void *p)
196 {
197 memset (p, 0, s);
198 return p;
199 }
200
201 void *operator new (size_t s)
202 {
203 slice_alloc += s;
204 return g_slice_alloc0 (s);
205 }
206
207 void *operator new[] (size_t s)
208 {
209 slice_alloc += s;
210 return g_slice_alloc0 (s);
211 }
212
213 void operator delete (void *p, size_t s)
214 {
215 slice_alloc -= s;
216 g_slice_free1 (s, p);
217 }
218
219 void operator delete[] (void *p, size_t s)
220 {
221 slice_alloc -= s;
222 g_slice_free1 (s, p);
223 }
224};
225 199
226void *salloc_ (int n) throw (std::bad_alloc); 200void *salloc_ (int n) throw (std::bad_alloc);
227void *salloc_ (int n, void *src) throw (std::bad_alloc); 201void *salloc_ (int n, void *src) throw (std::bad_alloc);
228 202
229// strictly the same as g_slice_alloc, but never returns 0 203// strictly the same as g_slice_alloc, but never returns 0
241 215
242// for symmetry 216// for symmetry
243template<typename T> 217template<typename T>
244inline void sfree (T *ptr, int n = 1) throw () 218inline void sfree (T *ptr, int n = 1) throw ()
245{ 219{
246#ifdef PREFER_MALLOC 220 if (expect_true (ptr))
247 free (ptr); 221 {
248#else
249 slice_alloc -= n * sizeof (T); 222 slice_alloc -= n * sizeof (T);
223 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
250 g_slice_free1 (n * sizeof (T), (void *)ptr); 224 g_slice_free1 (n * sizeof (T), (void *)ptr);
251#endif 225 assert (slice_alloc >= 0);//D
226 }
252} 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};
253 295
254// a STL-compatible allocator that uses g_slice 296// a STL-compatible allocator that uses g_slice
255// boy, this is verbose 297// boy, this is verbose
256template<typename Tp> 298template<typename Tp>
257struct slice_allocator 299struct slice_allocator
323 } 365 }
324 366
325 void seed (uint32_t seed); 367 void seed (uint32_t seed);
326 uint32_t next (); 368 uint32_t next ();
327 369
328 // uniform distribution 370 // uniform distribution, 0 .. num - 1
329 uint32_t operator ()(uint32_t num) 371 uint32_t operator ()(uint32_t num)
330 { 372 {
331 return is_constant (num) 373 return is_constant (num)
332 ? (next () * (uint64_t)num) >> 32U 374 ? (next () * (uint64_t)num) >> 32U
333 : get_range (num); 375 : get_range (num);
351 int get_range (int r_min, int r_max); 393 int get_range (int r_min, int r_max);
352}; 394};
353 395
354typedef tausworthe_random_generator rand_gen; 396typedef tausworthe_random_generator rand_gen;
355 397
356extern rand_gen rndm; 398extern rand_gen rndm, rmg_rndm;
357 399
358INTERFACE_CLASS (attachable) 400INTERFACE_CLASS (attachable)
359struct refcnt_base 401struct refcnt_base
360{ 402{
361 typedef int refcnt_t; 403 typedef int refcnt_t;
568int similar_direction (int a, int b); 610int similar_direction (int a, int b);
569 611
570// like sprintf, but returns a "static" buffer 612// like sprintf, but returns a "static" buffer
571const char *format (const char *format, ...); 613const char *format (const char *format, ...);
572 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
573#endif 647#endif
574 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