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) |
|
|
65 | void *g_slice_alloc (unsigned long size); |
|
|
66 | void *g_slice_alloc0 (unsigned long size); |
|
|
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)) |
|
|
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 | |
|
|
92 | void cleanup (const char *cause, bool make_core = false); |
75 | void fork_abort (const char *msg); |
93 | void 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. |
79 | 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; } |
80 | 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; } |
81 | 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; } |
82 | |
100 | |
83 | 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)); } |
84 | |
105 | |
85 | template<typename T> |
106 | template<typename T> |
86 | static inline T |
107 | static inline T |
87 | 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) |
88 | { |
109 | { |
… | |
… | |
172 | absdir (int d) |
193 | absdir (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 |
198 | extern ssize_t slice_alloc; // statistics |
178 | struct 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 | |
207 | void *salloc_ (int n) throw (std::bad_alloc); |
200 | void *salloc_ (int n) throw (std::bad_alloc); |
208 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
201 | void *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 |
224 | template<typename T> |
217 | template<typename T> |
225 | inline void sfree (T *ptr, int n = 1) throw () |
218 | inline 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 |
|
|
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 | }; |
233 | |
295 | |
234 | // a STL-compatible allocator that uses g_slice |
296 | // a STL-compatible allocator that uses g_slice |
235 | // boy, this is verbose |
297 | // boy, this is verbose |
236 | template<typename Tp> |
298 | template<typename Tp> |
237 | struct slice_allocator |
299 | struct slice_allocator |
… | |
… | |
249 | { |
311 | { |
250 | typedef slice_allocator<U> other; |
312 | typedef slice_allocator<U> other; |
251 | }; |
313 | }; |
252 | |
314 | |
253 | slice_allocator () throw () { } |
315 | slice_allocator () throw () { } |
254 | slice_allocator (const slice_allocator &o) throw () { } |
316 | slice_allocator (const slice_allocator &) throw () { } |
255 | template<typename Tp2> |
317 | template<typename Tp2> |
256 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
318 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
257 | |
319 | |
258 | ~slice_allocator () { } |
320 | ~slice_allocator () { } |
259 | |
321 | |
… | |
… | |
268 | void deallocate (pointer p, size_type n) |
330 | void deallocate (pointer p, size_type n) |
269 | { |
331 | { |
270 | sfree<Tp> (p, n); |
332 | sfree<Tp> (p, n); |
271 | } |
333 | } |
272 | |
334 | |
273 | size_type max_size ()const throw () |
335 | size_type max_size () const throw () |
274 | { |
336 | { |
275 | return size_t (-1) / sizeof (Tp); |
337 | return size_t (-1) / sizeof (Tp); |
276 | } |
338 | } |
277 | |
339 | |
278 | void construct (pointer p, const Tp &val) |
340 | void construct (pointer p, const Tp &val) |
… | |
… | |
331 | int get_range (int r_min, int r_max); |
393 | int get_range (int r_min, int r_max); |
332 | }; |
394 | }; |
333 | |
395 | |
334 | typedef tausworthe_random_generator rand_gen; |
396 | typedef tausworthe_random_generator rand_gen; |
335 | |
397 | |
336 | extern rand_gen rndm; |
398 | extern rand_gen rndm, rmg_rndm; |
337 | |
399 | |
338 | INTERFACE_CLASS (attachable) |
400 | INTERFACE_CLASS (attachable) |
339 | struct refcnt_base |
401 | struct refcnt_base |
340 | { |
402 | { |
341 | typedef int refcnt_t; |
403 | typedef int refcnt_t; |
… | |
… | |
345 | MTH void refcnt_dec () const { --refcnt; } |
407 | MTH void refcnt_dec () const { --refcnt; } |
346 | |
408 | |
347 | refcnt_base () : refcnt (0) { } |
409 | refcnt_base () : refcnt (0) { } |
348 | }; |
410 | }; |
349 | |
411 | |
|
|
412 | // to avoid branches with more advanced compilers |
350 | extern refcnt_base::refcnt_t refcnt_dummy; |
413 | extern refcnt_base::refcnt_t refcnt_dummy; |
351 | |
414 | |
352 | template<class T> |
415 | template<class T> |
353 | struct refptr |
416 | struct refptr |
354 | { |
417 | { |
… | |
… | |
539 | assign ((char *)&dst, src, N); |
602 | assign ((char *)&dst, src, N); |
540 | } |
603 | } |
541 | |
604 | |
542 | typedef double tstamp; |
605 | typedef double tstamp; |
543 | |
606 | |
544 | // return current time as timestampe |
607 | // return current time as timestamp |
545 | tstamp now (); |
608 | tstamp now (); |
546 | |
609 | |
547 | int similar_direction (int a, int b); |
610 | int similar_direction (int a, int b); |
548 | |
611 | |
549 | // like sprintf, but returns a "static" buffer |
612 | // like sprintf, but returns a "static" buffer |
550 | const char *format (const char *format, ...); |
613 | const char *format (const char *format, ...); |
551 | |
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 |
552 | #endif |
647 | #endif |
553 | |
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 | |