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.54 by root, Mon Aug 6 10:54:12 2007 UTC vs.
Revision 1.72 by root, Wed Apr 30 16:26:28 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * 5 *
6 * Crossfire TRT 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.
10 * 10 *
11 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
14 * GNU General Public License for more details. 14 * GNU General Public License for more details.
15 * 15 *
16 * You should have received a copy of the GNU General Public License 16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 * 18 *
19 * The authors can be reached via e-mail to <crossfire@schmorp.de> 19 * The authors can be reached via e-mail to <support@deliantra.net>
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
177// makes dynamically allocated objects zero-initialised 198extern ssize_t slice_alloc; // statistics
178struct zero_initialised
179{
180 void *operator new (size_t s, void *p)
181 {
182 memset (p, 0, s);
183 return p;
184 }
185
186 void *operator new (size_t s)
187 {
188 return g_slice_alloc0 (s);
189 }
190
191 void *operator new[] (size_t s)
192 {
193 return g_slice_alloc0 (s);
194 }
195
196 void operator delete (void *p, size_t s)
197 {
198 g_slice_free1 (s, p);
199 }
200
201 void operator delete[] (void *p, size_t s)
202 {
203 g_slice_free1 (s, p);
204 }
205};
206 199
207void *salloc_ (int n) throw (std::bad_alloc); 200void *salloc_ (int n) throw (std::bad_alloc);
208void *salloc_ (int n, void *src) throw (std::bad_alloc); 201void *salloc_ (int n, void *src) throw (std::bad_alloc);
209 202
210// strictly the same as g_slice_alloc, but never returns 0 203// strictly the same as g_slice_alloc, but never returns 0
222 215
223// for symmetry 216// for symmetry
224template<typename T> 217template<typename T>
225inline void sfree (T *ptr, int n = 1) throw () 218inline void sfree (T *ptr, int n = 1) throw ()
226{ 219{
227#ifdef PREFER_MALLOC 220 if (expect_true (ptr))
228 free (ptr); 221 {
229#else 222 slice_alloc -= n * sizeof (T);
223 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
230 g_slice_free1 (n * sizeof (T), (void *)ptr); 224 g_slice_free1 (n * sizeof (T), (void *)ptr);
231#endif 225 assert (slice_alloc >= 0);//D
226 }
232} 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};
233 266
234// a STL-compatible allocator that uses g_slice 267// a STL-compatible allocator that uses g_slice
235// boy, this is verbose 268// boy, this is verbose
236template<typename Tp> 269template<typename Tp>
237struct slice_allocator 270struct slice_allocator
249 { 282 {
250 typedef slice_allocator<U> other; 283 typedef slice_allocator<U> other;
251 }; 284 };
252 285
253 slice_allocator () throw () { } 286 slice_allocator () throw () { }
254 slice_allocator (const slice_allocator &o) throw () { } 287 slice_allocator (const slice_allocator &) throw () { }
255 template<typename Tp2> 288 template<typename Tp2>
256 slice_allocator (const slice_allocator<Tp2> &) throw () { } 289 slice_allocator (const slice_allocator<Tp2> &) throw () { }
257 290
258 ~slice_allocator () { } 291 ~slice_allocator () { }
259 292
268 void deallocate (pointer p, size_type n) 301 void deallocate (pointer p, size_type n)
269 { 302 {
270 sfree<Tp> (p, n); 303 sfree<Tp> (p, n);
271 } 304 }
272 305
273 size_type max_size ()const throw () 306 size_type max_size () const throw ()
274 { 307 {
275 return size_t (-1) / sizeof (Tp); 308 return size_t (-1) / sizeof (Tp);
276 } 309 }
277 310
278 void construct (pointer p, const Tp &val) 311 void construct (pointer p, const Tp &val)
345 MTH void refcnt_dec () const { --refcnt; } 378 MTH void refcnt_dec () const { --refcnt; }
346 379
347 refcnt_base () : refcnt (0) { } 380 refcnt_base () : refcnt (0) { }
348}; 381};
349 382
383// to avoid branches with more advanced compilers
350extern refcnt_base::refcnt_t refcnt_dummy; 384extern refcnt_base::refcnt_t refcnt_dummy;
351 385
352template<class T> 386template<class T>
353struct refptr 387struct refptr
354{ 388{
539 assign ((char *)&dst, src, N); 573 assign ((char *)&dst, src, N);
540} 574}
541 575
542typedef double tstamp; 576typedef double tstamp;
543 577
544// return current time as timestampe 578// return current time as timestamp
545tstamp now (); 579tstamp now ();
546 580
547int similar_direction (int a, int b); 581int similar_direction (int a, int b);
548 582
549// like printf, but returns a std::string 583// like sprintf, but returns a "static" buffer
550const std::string format (const char *format, ...); 584const char *format (const char *format, ...);
551 585
586/////////////////////////////////////////////////////////////////////////////
587// threads, very very thin wrappers around pthreads
588
589struct thread
590{
591 pthread_t id;
592
593 void start (void *(*start_routine)(void *), void *arg = 0);
594
595 void cancel ()
596 {
597 pthread_cancel (id);
598 }
599
600 void *join ()
601 {
602 void *ret;
603
604 if (pthread_join (id, &ret))
605 cleanup ("pthread_join failed", 1);
606
607 return ret;
608 }
609};
610
611// note that mutexes are not classes
612typedef pthread_mutex_t smutex;
613
614#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
615 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
616#else
617 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
552#endif 618#endif
553 619
620#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
621#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
622#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
623
624typedef pthread_cond_t scond;
625
626#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
627#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
628#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
629#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
630
631#endif
632

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines