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.70 by root, Sun Apr 20 05:24:55 2008 UTC

… …
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 0xaa // 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// makes dynamically allocated objects zero-initialised
230struct zero_initialised
231{
232 void *operator new (size_t s, void *p)
233 {
234 memset (p, 0, s);
235 return p;
236 }
237
238 void *operator new (size_t s)
239 {
240 return salloc0<char> (s);
241 }
242
243 void *operator new[] (size_t s)
244 {
245 return salloc0<char> (s);
246 }
247
248 void operator delete (void *p, size_t s)
249 {
250 sfree ((char *)p, s);
251 }
252
253 void operator delete[] (void *p, size_t s)
254 {
255 sfree ((char *)p, s);
256 }
257};
253 258
254// a STL-compatible allocator that uses g_slice 259// a STL-compatible allocator that uses g_slice
255// boy, this is verbose 260// boy, this is verbose
256template<typename Tp> 261template<typename Tp>
257struct slice_allocator 262struct slice_allocator
… …
568int similar_direction (int a, int b); 573int similar_direction (int a, int b);
569 574
570// like sprintf, but returns a "static" buffer 575// like sprintf, but returns a "static" buffer
571const char *format (const char *format, ...); 576const char *format (const char *format, ...);
572 577
578/////////////////////////////////////////////////////////////////////////////
579// threads, very very thin wrappers around pthreads
580
581struct thread
582{
583 pthread_t id;
584
585 void start (void *(*start_routine)(void *), void *arg = 0);
586
587 void cancel ()
588 {
589 pthread_cancel (id);
590 }
591
592 void *join ()
593 {
594 void *ret;
595
596 if (pthread_join (id, &ret))
597 cleanup ("pthread_join failed", 1);
598
599 return ret;
600 }
601};
602
603// note that mutexes are not classes
604typedef pthread_mutex_t smutex;
605
606#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
607 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
608#else
609 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
573#endif 610#endif
574 611
612#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
613#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
614#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
615
616typedef pthread_cond_t scond;
617
618#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
619#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
620#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
621#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
622
623#endif
624

Diff Legend

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