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.62 by root, Fri Jan 25 18:13:57 2008 UTC vs.
Revision 1.66 by root, Wed Apr 2 11:13: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
26#define DEBUG_SALLOC 25#define DEBUG_SALLOC 0
26#define PREFER_MALLOC 0
27 27
28#if __GNUC__ >= 3 28#if __GNUC__ >= 3
29# define is_constant(c) __builtin_constant_p (c) 29# define is_constant(c) __builtin_constant_p (c)
30# define expect(expr,value) __builtin_expect ((expr),(value)) 30# define expect(expr,value) __builtin_expect ((expr),(value))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
… …
43// is mostly true or mosty false. note that these return 43// is mostly true or mosty false. note that these return
44// booleans, not the expression. 44// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0) 45#define expect_false(expr) expect ((expr) != 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1) 46#define expect_true(expr) expect ((expr) != 0, 1)
47 47
48#include <pthread.h>
49
48#include <cstddef> 50#include <cstddef>
49#include <cmath> 51#include <cmath>
50#include <new> 52#include <new>
51#include <vector> 53#include <vector>
52 54
53#include <glib.h> 55#include <glib.h>
54 56
55#include <shstr.h> 57#include <shstr.h>
56#include <traits.h> 58#include <traits.h>
57 59
58#ifdef DEBUG_SALLOC 60#if DEBUG_SALLOC
59# define g_slice_alloc0(s) debug_slice_alloc0(s) 61# define g_slice_alloc0(s) debug_slice_alloc0(s)
60# define g_slice_alloc(s) debug_slice_alloc(s) 62# define g_slice_alloc(s) debug_slice_alloc(s)
61# define g_slice_free1(s,p) debug_slice_free1(s,p) 63# define g_slice_free1(s,p) debug_slice_free1(s,p)
62void *g_slice_alloc (unsigned long size); 64void *g_slice_alloc (unsigned long size);
63void *g_slice_alloc0 (unsigned long size); 65void *g_slice_alloc0 (unsigned long size);
… …
80 82
81// in range excluding end 83// in range excluding end
82#define IN_RANGE_EXC(val,beg,end) \ 84#define IN_RANGE_EXC(val,beg,end) \
83 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 85 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
84 86
87void cleanup (const char *cause, bool make_core = false);
85void fork_abort (const char *msg); 88void fork_abort (const char *msg);
86 89
87// rationale for using (U) not (T) is to reduce signed/unsigned issues, 90// 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. 91// 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; } 92template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
90template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 93template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
91template<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; } 94template<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; }
92 95
93template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 96template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
97
98template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
99template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
94 100
95template<typename T> 101template<typename T>
96static inline T 102static inline T
97lerp (T val, T min_in, T max_in, T min_out, T max_out) 103lerp (T val, T min_in, T max_in, T min_out, T max_out)
98{ 104{
… …
238 244
239// for symmetry 245// for symmetry
240template<typename T> 246template<typename T>
241inline void sfree (T *ptr, int n = 1) throw () 247inline void sfree (T *ptr, int n = 1) throw ()
242{ 248{
243#ifdef PREFER_MALLOC 249#if PREFER_MALLOC
244 free (ptr); 250 free (ptr);
245#else 251#else
246 slice_alloc -= n * sizeof (T); 252 slice_alloc -= n * sizeof (T);
247 g_slice_free1 (n * sizeof (T), (void *)ptr); 253 g_slice_free1 (n * sizeof (T), (void *)ptr);
248#endif 254#endif
… …
266 { 272 {
267 typedef slice_allocator<U> other; 273 typedef slice_allocator<U> other;
268 }; 274 };
269 275
270 slice_allocator () throw () { } 276 slice_allocator () throw () { }
271 slice_allocator (const slice_allocator &o) throw () { } 277 slice_allocator (const slice_allocator &) throw () { }
272 template<typename Tp2> 278 template<typename Tp2>
273 slice_allocator (const slice_allocator<Tp2> &) throw () { } 279 slice_allocator (const slice_allocator<Tp2> &) throw () { }
274 280
275 ~slice_allocator () { } 281 ~slice_allocator () { }
276 282
… …
285 void deallocate (pointer p, size_type n) 291 void deallocate (pointer p, size_type n)
286 { 292 {
287 sfree<Tp> (p, n); 293 sfree<Tp> (p, n);
288 } 294 }
289 295
290 size_type max_size ()const throw () 296 size_type max_size () const throw ()
291 { 297 {
292 return size_t (-1) / sizeof (Tp); 298 return size_t (-1) / sizeof (Tp);
293 } 299 }
294 300
295 void construct (pointer p, const Tp &val) 301 void construct (pointer p, const Tp &val)
… …
565int similar_direction (int a, int b); 571int similar_direction (int a, int b);
566 572
567// like sprintf, but returns a "static" buffer 573// like sprintf, but returns a "static" buffer
568const char *format (const char *format, ...); 574const char *format (const char *format, ...);
569 575
570#endif 576/////////////////////////////////////////////////////////////////////////////
577// threads, very very thin wrappers around pthreads
571 578
579struct thread
580{
581 pthread_t id;
582
583 void start (void *(*start_routine)(void *), void *arg = 0);
584
585 void cancel ()
586 {
587 pthread_cancel (id);
588 }
589
590 void *join ()
591 {
592 void *ret;
593
594 if (pthread_join (id, &ret))
595 cleanup ("pthread_join failed", 1);
596
597 return ret;
598 }
599};
600
601// note that mutexes are not classes
602typedef pthread_mutex_t smutex;
603
604#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
605 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
606#else
607 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
608#endif
609
610#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
611#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
612#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
613
614#endif
615

Diff Legend

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