… | |
… | |
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) |
62 | void *g_slice_alloc (unsigned long size); |
65 | void *g_slice_alloc (unsigned long size); |
63 | void *g_slice_alloc0 (unsigned long size); |
66 | void *g_slice_alloc0 (unsigned long size); |
64 | void g_slice_free1 (unsigned long size, void *ptr); |
67 | void 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 | |
|
|
92 | void cleanup (const char *cause, bool make_core = false); |
85 | void fork_abort (const char *msg); |
93 | void 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. |
89 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
97 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
90 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
98 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
91 | template<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; } |
99 | template<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 | |
100 | |
93 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
101 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
102 | |
|
|
103 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
|
|
104 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
94 | |
105 | |
95 | template<typename T> |
106 | template<typename T> |
96 | static inline T |
107 | static inline T |
97 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
108 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
98 | { |
109 | { |
… | |
… | |
182 | absdir (int d) |
193 | absdir (int d) |
183 | { |
194 | { |
184 | return ((d - 1) & 7) + 1; |
195 | return ((d - 1) & 7) + 1; |
185 | } |
196 | } |
186 | |
197 | |
187 | extern size_t slice_alloc; // statistics |
198 | extern ssize_t slice_alloc; // statistics |
188 | |
|
|
189 | // makes dynamically allocated objects zero-initialised |
|
|
190 | struct zero_initialised |
|
|
191 | { |
|
|
192 | void *operator new (size_t s, void *p) |
|
|
193 | { |
|
|
194 | memset (p, 0, s); |
|
|
195 | return p; |
|
|
196 | } |
|
|
197 | |
|
|
198 | void *operator new (size_t s) |
|
|
199 | { |
|
|
200 | slice_alloc += s; |
|
|
201 | return g_slice_alloc0 (s); |
|
|
202 | } |
|
|
203 | |
|
|
204 | void *operator new[] (size_t s) |
|
|
205 | { |
|
|
206 | slice_alloc += s; |
|
|
207 | return g_slice_alloc0 (s); |
|
|
208 | } |
|
|
209 | |
|
|
210 | void operator delete (void *p, size_t s) |
|
|
211 | { |
|
|
212 | slice_alloc -= s; |
|
|
213 | g_slice_free1 (s, p); |
|
|
214 | } |
|
|
215 | |
|
|
216 | void operator delete[] (void *p, size_t s) |
|
|
217 | { |
|
|
218 | slice_alloc -= s; |
|
|
219 | g_slice_free1 (s, p); |
|
|
220 | } |
|
|
221 | }; |
|
|
222 | |
199 | |
223 | void *salloc_ (int n) throw (std::bad_alloc); |
200 | void *salloc_ (int n) throw (std::bad_alloc); |
224 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
201 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
225 | |
202 | |
226 | // strictly the same as g_slice_alloc, but never returns 0 |
203 | // strictly the same as g_slice_alloc, but never returns 0 |
… | |
… | |
238 | |
215 | |
239 | // for symmetry |
216 | // for symmetry |
240 | template<typename T> |
217 | template<typename T> |
241 | inline void sfree (T *ptr, int n = 1) throw () |
218 | inline void sfree (T *ptr, int n = 1) throw () |
242 | { |
219 | { |
243 | #ifdef PREFER_MALLOC |
220 | if (expect_true (ptr)) |
244 | free (ptr); |
221 | { |
245 | #else |
|
|
246 | slice_alloc -= n * sizeof (T); |
222 | slice_alloc -= n * sizeof (T); |
|
|
223 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
247 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
224 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
248 | #endif |
225 | assert (slice_alloc >= 0);//D |
|
|
226 | } |
249 | } |
227 | } |
|
|
228 | |
|
|
229 | // nulls the pointer |
|
|
230 | template<typename T> |
|
|
231 | inline 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 |
|
|
238 | struct 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 |
|
|
268 | struct 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 | }; |
250 | |
295 | |
251 | // a STL-compatible allocator that uses g_slice |
296 | // a STL-compatible allocator that uses g_slice |
252 | // boy, this is verbose |
297 | // boy, this is verbose |
253 | template<typename Tp> |
298 | template<typename Tp> |
254 | struct slice_allocator |
299 | struct slice_allocator |
… | |
… | |
266 | { |
311 | { |
267 | typedef slice_allocator<U> other; |
312 | typedef slice_allocator<U> other; |
268 | }; |
313 | }; |
269 | |
314 | |
270 | slice_allocator () throw () { } |
315 | slice_allocator () throw () { } |
271 | slice_allocator (const slice_allocator &o) throw () { } |
316 | slice_allocator (const slice_allocator &) throw () { } |
272 | template<typename Tp2> |
317 | template<typename Tp2> |
273 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
318 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
274 | |
319 | |
275 | ~slice_allocator () { } |
320 | ~slice_allocator () { } |
276 | |
321 | |
… | |
… | |
285 | void deallocate (pointer p, size_type n) |
330 | void deallocate (pointer p, size_type n) |
286 | { |
331 | { |
287 | sfree<Tp> (p, n); |
332 | sfree<Tp> (p, n); |
288 | } |
333 | } |
289 | |
334 | |
290 | size_type max_size ()const throw () |
335 | size_type max_size () const throw () |
291 | { |
336 | { |
292 | return size_t (-1) / sizeof (Tp); |
337 | return size_t (-1) / sizeof (Tp); |
293 | } |
338 | } |
294 | |
339 | |
295 | void construct (pointer p, const Tp &val) |
340 | void construct (pointer p, const Tp &val) |
… | |
… | |
565 | int similar_direction (int a, int b); |
610 | int similar_direction (int a, int b); |
566 | |
611 | |
567 | // like sprintf, but returns a "static" buffer |
612 | // like sprintf, but returns a "static" buffer |
568 | const char *format (const char *format, ...); |
613 | const char *format (const char *format, ...); |
569 | |
614 | |
|
|
615 | ///////////////////////////////////////////////////////////////////////////// |
|
|
616 | // threads, very very thin wrappers around pthreads |
|
|
617 | |
|
|
618 | struct 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 |
|
|
641 | typedef 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 |
570 | #endif |
647 | #endif |
571 | |
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 | |
|
|
653 | typedef 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 | |