1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * Deliantra is free software: you can redistribute it and/or modify |
7 | * under the terms of the GNU General Public License as published by the Free |
7 | * it under the terms of the GNU General Public License as published by |
8 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * 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, but |
11 | * This program is distributed in the hope that it will be useful, |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * 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 along |
16 | * You should have received a copy of the GNU General Public License |
17 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
18 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
19 | * |
18 | * |
20 | * 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> |
21 | */ |
20 | */ |
22 | |
21 | |
23 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
24 | #define UTIL_H__ |
23 | #define UTIL_H__ |
25 | |
24 | |
26 | //#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 |
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> |
|
|
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 |
57 | |
73 | |
58 | // 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) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
60 | |
76 | |
61 | // very ugly macro that basicaly declares and initialises a variable |
77 | // very ugly macro that basicaly declares and initialises a variable |
… | |
… | |
71 | |
87 | |
72 | // in range excluding end |
88 | // in range excluding end |
73 | #define IN_RANGE_EXC(val,beg,end) \ |
89 | #define IN_RANGE_EXC(val,beg,end) \ |
74 | ((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)) |
75 | |
91 | |
|
|
92 | void cleanup (const char *cause, bool make_core = false); |
76 | void fork_abort (const char *msg); |
93 | void fork_abort (const char *msg); |
77 | |
94 | |
78 | // 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, |
79 | // 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. |
80 | 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; } |
81 | 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; } |
82 | 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; } |
83 | |
100 | |
|
|
101 | template<typename T> static inline void min_it (T &v, T m) { v = min (v, m); } |
|
|
102 | template<typename T> static inline void max_it (T &v, T m) { v = max (v, m); } |
|
|
103 | template<typename T> static inline void clamp_it (T &v, T a, T b) { v = clamp (v, a, b); } |
|
|
104 | |
84 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
105 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
106 | |
|
|
107 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
|
|
108 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
|
|
109 | |
|
|
110 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
111 | template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; } |
|
|
112 | // div, round-up |
|
|
113 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
|
|
114 | // div, round-down |
|
|
115 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
85 | |
116 | |
86 | template<typename T> |
117 | template<typename T> |
87 | static inline T |
118 | static inline T |
88 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
119 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
89 | { |
120 | { |
90 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
121 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
122 | } |
|
|
123 | |
|
|
124 | // lerp, round-down |
|
|
125 | template<typename T> |
|
|
126 | static inline T |
|
|
127 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
128 | { |
|
|
129 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
130 | } |
|
|
131 | |
|
|
132 | // lerp, round-up |
|
|
133 | template<typename T> |
|
|
134 | static inline T |
|
|
135 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
136 | { |
|
|
137 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
91 | } |
138 | } |
92 | |
139 | |
93 | // lots of stuff taken from FXT |
140 | // lots of stuff taken from FXT |
94 | |
141 | |
95 | /* Rotate right. This is used in various places for checksumming */ |
142 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
173 | absdir (int d) |
220 | absdir (int d) |
174 | { |
221 | { |
175 | return ((d - 1) & 7) + 1; |
222 | return ((d - 1) & 7) + 1; |
176 | } |
223 | } |
177 | |
224 | |
|
|
225 | extern ssize_t slice_alloc; // statistics |
|
|
226 | |
|
|
227 | void *salloc_ (int n) throw (std::bad_alloc); |
|
|
228 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
|
|
229 | |
|
|
230 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
231 | template<typename T> |
|
|
232 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
233 | |
|
|
234 | // also copies src into the new area, like "memdup" |
|
|
235 | // if src is 0, clears the memory |
|
|
236 | template<typename T> |
|
|
237 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
238 | |
|
|
239 | // clears the memory |
|
|
240 | template<typename T> |
|
|
241 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
242 | |
|
|
243 | // for symmetry |
|
|
244 | template<typename T> |
|
|
245 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
246 | { |
|
|
247 | if (expect_true (ptr)) |
|
|
248 | { |
|
|
249 | slice_alloc -= n * sizeof (T); |
|
|
250 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
|
|
251 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
252 | assert (slice_alloc >= 0);//D |
|
|
253 | } |
|
|
254 | } |
|
|
255 | |
|
|
256 | // nulls the pointer |
|
|
257 | template<typename T> |
|
|
258 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
259 | { |
|
|
260 | sfree<T> (ptr, n); |
|
|
261 | ptr = 0; |
|
|
262 | } |
|
|
263 | |
178 | // makes dynamically allocated objects zero-initialised |
264 | // makes dynamically allocated objects zero-initialised |
179 | struct zero_initialised |
265 | struct zero_initialised |
180 | { |
266 | { |
181 | void *operator new (size_t s, void *p) |
267 | void *operator new (size_t s, void *p) |
182 | { |
268 | { |
… | |
… | |
184 | return p; |
270 | return p; |
185 | } |
271 | } |
186 | |
272 | |
187 | void *operator new (size_t s) |
273 | void *operator new (size_t s) |
188 | { |
274 | { |
189 | return g_slice_alloc0 (s); |
275 | return salloc0<char> (s); |
190 | } |
276 | } |
191 | |
277 | |
192 | void *operator new[] (size_t s) |
278 | void *operator new[] (size_t s) |
193 | { |
279 | { |
194 | return g_slice_alloc0 (s); |
280 | return salloc0<char> (s); |
195 | } |
281 | } |
196 | |
282 | |
197 | void operator delete (void *p, size_t s) |
283 | void operator delete (void *p, size_t s) |
198 | { |
284 | { |
199 | g_slice_free1 (s, p); |
285 | sfree ((char *)p, s); |
200 | } |
286 | } |
201 | |
287 | |
202 | void operator delete[] (void *p, size_t s) |
288 | void operator delete[] (void *p, size_t s) |
203 | { |
289 | { |
204 | g_slice_free1 (s, p); |
290 | sfree ((char *)p, s); |
205 | } |
291 | } |
206 | }; |
292 | }; |
207 | |
293 | |
208 | void *salloc_ (int n) throw (std::bad_alloc); |
294 | // makes dynamically allocated objects zero-initialised |
209 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
295 | struct slice_allocated |
210 | |
|
|
211 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
212 | template<typename T> |
|
|
213 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
214 | |
|
|
215 | // also copies src into the new area, like "memdup" |
|
|
216 | // if src is 0, clears the memory |
|
|
217 | template<typename T> |
|
|
218 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
219 | |
|
|
220 | // clears the memory |
|
|
221 | template<typename T> |
|
|
222 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
223 | |
|
|
224 | // for symmetry |
|
|
225 | template<typename T> |
|
|
226 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
227 | { |
296 | { |
228 | #ifdef PREFER_MALLOC |
297 | void *operator new (size_t s, void *p) |
229 | free (ptr); |
298 | { |
230 | #else |
299 | return p; |
231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
300 | } |
232 | #endif |
301 | |
233 | } |
302 | void *operator new (size_t s) |
|
|
303 | { |
|
|
304 | return salloc<char> (s); |
|
|
305 | } |
|
|
306 | |
|
|
307 | void *operator new[] (size_t s) |
|
|
308 | { |
|
|
309 | return salloc<char> (s); |
|
|
310 | } |
|
|
311 | |
|
|
312 | void operator delete (void *p, size_t s) |
|
|
313 | { |
|
|
314 | sfree ((char *)p, s); |
|
|
315 | } |
|
|
316 | |
|
|
317 | void operator delete[] (void *p, size_t s) |
|
|
318 | { |
|
|
319 | sfree ((char *)p, s); |
|
|
320 | } |
|
|
321 | }; |
234 | |
322 | |
235 | // a STL-compatible allocator that uses g_slice |
323 | // a STL-compatible allocator that uses g_slice |
236 | // boy, this is verbose |
324 | // boy, this is verbose |
237 | template<typename Tp> |
325 | template<typename Tp> |
238 | struct slice_allocator |
326 | struct slice_allocator |
… | |
… | |
250 | { |
338 | { |
251 | typedef slice_allocator<U> other; |
339 | typedef slice_allocator<U> other; |
252 | }; |
340 | }; |
253 | |
341 | |
254 | slice_allocator () throw () { } |
342 | slice_allocator () throw () { } |
255 | slice_allocator (const slice_allocator &o) throw () { } |
343 | slice_allocator (const slice_allocator &) throw () { } |
256 | template<typename Tp2> |
344 | template<typename Tp2> |
257 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
345 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
258 | |
346 | |
259 | ~slice_allocator () { } |
347 | ~slice_allocator () { } |
260 | |
348 | |
… | |
… | |
269 | void deallocate (pointer p, size_type n) |
357 | void deallocate (pointer p, size_type n) |
270 | { |
358 | { |
271 | sfree<Tp> (p, n); |
359 | sfree<Tp> (p, n); |
272 | } |
360 | } |
273 | |
361 | |
274 | size_type max_size ()const throw () |
362 | size_type max_size () const throw () |
275 | { |
363 | { |
276 | return size_t (-1) / sizeof (Tp); |
364 | return size_t (-1) / sizeof (Tp); |
277 | } |
365 | } |
278 | |
366 | |
279 | void construct (pointer p, const Tp &val) |
367 | void construct (pointer p, const Tp &val) |
… | |
… | |
304 | } |
392 | } |
305 | |
393 | |
306 | void seed (uint32_t seed); |
394 | void seed (uint32_t seed); |
307 | uint32_t next (); |
395 | uint32_t next (); |
308 | |
396 | |
309 | // uniform distribution |
397 | // uniform distribution, 0 .. max (0, num - 1) |
310 | uint32_t operator ()(uint32_t num) |
398 | uint32_t operator ()(uint32_t num) |
311 | { |
399 | { |
312 | return is_constant (num) |
400 | return is_constant (num) |
313 | ? (next () * (uint64_t)num) >> 32U |
401 | ? (next () * (uint64_t)num) >> 32U |
314 | : get_range (num); |
402 | : get_range (num); |
… | |
… | |
332 | int get_range (int r_min, int r_max); |
420 | int get_range (int r_min, int r_max); |
333 | }; |
421 | }; |
334 | |
422 | |
335 | typedef tausworthe_random_generator rand_gen; |
423 | typedef tausworthe_random_generator rand_gen; |
336 | |
424 | |
337 | extern rand_gen rndm; |
425 | extern rand_gen rndm, rmg_rndm; |
|
|
426 | |
|
|
427 | INTERFACE_CLASS (attachable) |
|
|
428 | struct refcnt_base |
|
|
429 | { |
|
|
430 | typedef int refcnt_t; |
|
|
431 | mutable refcnt_t ACC (RW, refcnt); |
|
|
432 | |
|
|
433 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
434 | MTH void refcnt_dec () const { --refcnt; } |
|
|
435 | |
|
|
436 | refcnt_base () : refcnt (0) { } |
|
|
437 | }; |
|
|
438 | |
|
|
439 | // to avoid branches with more advanced compilers |
|
|
440 | extern refcnt_base::refcnt_t refcnt_dummy; |
338 | |
441 | |
339 | template<class T> |
442 | template<class T> |
340 | struct refptr |
443 | struct refptr |
341 | { |
444 | { |
|
|
445 | // p if not null |
|
|
446 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
447 | |
|
|
448 | void refcnt_dec () |
|
|
449 | { |
|
|
450 | if (!is_constant (p)) |
|
|
451 | --*refcnt_ref (); |
|
|
452 | else if (p) |
|
|
453 | --p->refcnt; |
|
|
454 | } |
|
|
455 | |
|
|
456 | void refcnt_inc () |
|
|
457 | { |
|
|
458 | if (!is_constant (p)) |
|
|
459 | ++*refcnt_ref (); |
|
|
460 | else if (p) |
|
|
461 | ++p->refcnt; |
|
|
462 | } |
|
|
463 | |
342 | T *p; |
464 | T *p; |
343 | |
465 | |
344 | refptr () : p(0) { } |
466 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
467 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
468 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
469 | ~refptr () { refcnt_dec (); } |
348 | |
470 | |
349 | const refptr<T> &operator =(T *o) |
471 | const refptr<T> &operator =(T *o) |
350 | { |
472 | { |
|
|
473 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
474 | refcnt_dec (); |
352 | p = o; |
475 | p = o; |
353 | if (p) p->refcnt_inc (); |
476 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
477 | return *this; |
356 | } |
478 | } |
357 | |
479 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
480 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
481 | { |
360 | *this = o.p; |
482 | *this = o.p; |
361 | return *this; |
483 | return *this; |
362 | } |
484 | } |
363 | |
485 | |
364 | T &operator * () const { return *p; } |
486 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
487 | T *operator ->() const { return p; } |
366 | |
488 | |
367 | operator T *() const { return p; } |
489 | operator T *() const { return p; } |
368 | }; |
490 | }; |
369 | |
491 | |
370 | typedef refptr<maptile> maptile_ptr; |
492 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
406 | return !strcmp (a, b); |
528 | return !strcmp (a, b); |
407 | } |
529 | } |
408 | }; |
530 | }; |
409 | |
531 | |
410 | // Mostly the same as std::vector, but insert/erase can reorder |
532 | // Mostly the same as std::vector, but insert/erase can reorder |
411 | // the elements, making insret/remove O(1) instead of O(n). |
533 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
412 | // |
534 | // |
413 | // NOTE: only some forms of erase/insert are available |
535 | // NOTE: only some forms of erase are available |
414 | template<class T> |
536 | template<class T> |
415 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
537 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
416 | { |
538 | { |
417 | typedef typename unordered_vector::iterator iterator; |
539 | typedef typename unordered_vector::iterator iterator; |
418 | |
540 | |
… | |
… | |
459 | return obj->*indexmember |
581 | return obj->*indexmember |
460 | ? this->begin () + obj->*indexmember - 1 |
582 | ? this->begin () + obj->*indexmember - 1 |
461 | : this->end (); |
583 | : this->end (); |
462 | } |
584 | } |
463 | |
585 | |
|
|
586 | void push_back (T *obj) |
|
|
587 | { |
|
|
588 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
589 | obj->*indexmember = this->size (); |
|
|
590 | } |
|
|
591 | |
464 | void insert (T *obj) |
592 | void insert (T *obj) |
465 | { |
593 | { |
466 | push_back (obj); |
594 | push_back (obj); |
467 | obj->*indexmember = this->size (); |
|
|
468 | } |
595 | } |
469 | |
596 | |
470 | void insert (T &obj) |
597 | void insert (T &obj) |
471 | { |
598 | { |
472 | insert (&obj); |
599 | insert (&obj); |
… | |
… | |
502 | assign ((char *)&dst, src, N); |
629 | assign ((char *)&dst, src, N); |
503 | } |
630 | } |
504 | |
631 | |
505 | typedef double tstamp; |
632 | typedef double tstamp; |
506 | |
633 | |
507 | // return current time as timestampe |
634 | // return current time as timestamp |
508 | tstamp now (); |
635 | tstamp now (); |
509 | |
636 | |
510 | int similar_direction (int a, int b); |
637 | int similar_direction (int a, int b); |
511 | |
638 | |
512 | // like printf, but returns a std::string |
639 | // like sprintf, but returns a "static" buffer |
513 | const std::string format (const char *format, ...); |
640 | const char *format (const char *format, ...); |
514 | |
641 | |
|
|
642 | ///////////////////////////////////////////////////////////////////////////// |
|
|
643 | // threads, very very thin wrappers around pthreads |
|
|
644 | |
|
|
645 | struct thread |
|
|
646 | { |
|
|
647 | pthread_t id; |
|
|
648 | |
|
|
649 | void start (void *(*start_routine)(void *), void *arg = 0); |
|
|
650 | |
|
|
651 | void cancel () |
|
|
652 | { |
|
|
653 | pthread_cancel (id); |
|
|
654 | } |
|
|
655 | |
|
|
656 | void *join () |
|
|
657 | { |
|
|
658 | void *ret; |
|
|
659 | |
|
|
660 | if (pthread_join (id, &ret)) |
|
|
661 | cleanup ("pthread_join failed", 1); |
|
|
662 | |
|
|
663 | return ret; |
|
|
664 | } |
|
|
665 | }; |
|
|
666 | |
|
|
667 | // note that mutexes are not classes |
|
|
668 | typedef pthread_mutex_t smutex; |
|
|
669 | |
|
|
670 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
|
|
671 | #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
|
|
672 | #else |
|
|
673 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
515 | #endif |
674 | #endif |
516 | |
675 | |
|
|
676 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
|
|
677 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
|
|
678 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
|
|
679 | |
|
|
680 | typedef pthread_cond_t scond; |
|
|
681 | |
|
|
682 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
683 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
684 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
685 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
686 | |
|
|
687 | #endif |
|
|
688 | |