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 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> |
57 | |
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 |
|
|
73 | |
58 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
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 |
62 | // that is in scope for the next statement only |
78 | // that is in scope for the next statement only |
63 | // works only for stuff that can be assigned 0 and converts to false |
79 | // works only for stuff that can be assigned 0 and converts to false |
64 | // (note: works great for pointers) |
80 | // (note: works great for pointers) |
65 | // most ugly macro I ever wrote |
81 | // most ugly macro I ever wrote |
66 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
67 | |
83 | |
68 | // in range including end |
84 | // in range including end |
69 | #define IN_RANGE_INC(val,beg,end) \ |
85 | #define IN_RANGE_INC(val,beg,end) \ |
70 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
86 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
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 | |
84 | 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)); } |
85 | |
105 | |
86 | template<typename T> |
106 | template<typename T> |
87 | static inline T |
107 | static inline T |
88 | 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) |
89 | { |
109 | { |
… | |
… | |
173 | absdir (int d) |
193 | absdir (int d) |
174 | { |
194 | { |
175 | return ((d - 1) & 7) + 1; |
195 | return ((d - 1) & 7) + 1; |
176 | } |
196 | } |
177 | |
197 | |
178 | // makes dynamically allocated objects zero-initialised |
198 | extern ssize_t slice_alloc; // statistics |
179 | struct zero_initialised |
|
|
180 | { |
|
|
181 | void *operator new (size_t s, void *p) |
|
|
182 | { |
|
|
183 | memset (p, 0, s); |
|
|
184 | return p; |
|
|
185 | } |
|
|
186 | |
|
|
187 | void *operator new (size_t s) |
|
|
188 | { |
|
|
189 | return g_slice_alloc0 (s); |
|
|
190 | } |
|
|
191 | |
|
|
192 | void *operator new[] (size_t s) |
|
|
193 | { |
|
|
194 | return g_slice_alloc0 (s); |
|
|
195 | } |
|
|
196 | |
|
|
197 | void operator delete (void *p, size_t s) |
|
|
198 | { |
|
|
199 | g_slice_free1 (s, p); |
|
|
200 | } |
|
|
201 | |
|
|
202 | void operator delete[] (void *p, size_t s) |
|
|
203 | { |
|
|
204 | g_slice_free1 (s, p); |
|
|
205 | } |
|
|
206 | }; |
|
|
207 | |
199 | |
208 | void *salloc_ (int n) throw (std::bad_alloc); |
200 | void *salloc_ (int n) throw (std::bad_alloc); |
209 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
201 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
210 | |
202 | |
211 | // strictly the same as g_slice_alloc, but never returns 0 |
203 | // strictly the same as g_slice_alloc, but never returns 0 |
… | |
… | |
223 | |
215 | |
224 | // for symmetry |
216 | // for symmetry |
225 | template<typename T> |
217 | template<typename T> |
226 | inline void sfree (T *ptr, int n = 1) throw () |
218 | inline void sfree (T *ptr, int n = 1) throw () |
227 | { |
219 | { |
228 | #ifdef PREFER_MALLOC |
220 | if (expect_true (ptr)) |
229 | free (ptr); |
221 | { |
230 | #else |
222 | slice_alloc -= n * sizeof (T); |
|
|
223 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
224 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
232 | #endif |
225 | assert (slice_alloc >= 0);//D |
|
|
226 | } |
233 | } |
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 | }; |
234 | |
295 | |
235 | // a STL-compatible allocator that uses g_slice |
296 | // a STL-compatible allocator that uses g_slice |
236 | // boy, this is verbose |
297 | // boy, this is verbose |
237 | template<typename Tp> |
298 | template<typename Tp> |
238 | struct slice_allocator |
299 | struct slice_allocator |
… | |
… | |
250 | { |
311 | { |
251 | typedef slice_allocator<U> other; |
312 | typedef slice_allocator<U> other; |
252 | }; |
313 | }; |
253 | |
314 | |
254 | slice_allocator () throw () { } |
315 | slice_allocator () throw () { } |
255 | slice_allocator (const slice_allocator &o) throw () { } |
316 | slice_allocator (const slice_allocator &) throw () { } |
256 | template<typename Tp2> |
317 | template<typename Tp2> |
257 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
318 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
258 | |
319 | |
259 | ~slice_allocator () { } |
320 | ~slice_allocator () { } |
260 | |
321 | |
… | |
… | |
269 | void deallocate (pointer p, size_type n) |
330 | void deallocate (pointer p, size_type n) |
270 | { |
331 | { |
271 | sfree<Tp> (p, n); |
332 | sfree<Tp> (p, n); |
272 | } |
333 | } |
273 | |
334 | |
274 | size_type max_size ()const throw () |
335 | size_type max_size () const throw () |
275 | { |
336 | { |
276 | return size_t (-1) / sizeof (Tp); |
337 | return size_t (-1) / sizeof (Tp); |
277 | } |
338 | } |
278 | |
339 | |
279 | void construct (pointer p, const Tp &val) |
340 | void construct (pointer p, const Tp &val) |
… | |
… | |
332 | int get_range (int r_min, int r_max); |
393 | int get_range (int r_min, int r_max); |
333 | }; |
394 | }; |
334 | |
395 | |
335 | typedef tausworthe_random_generator rand_gen; |
396 | typedef tausworthe_random_generator rand_gen; |
336 | |
397 | |
337 | extern rand_gen rndm; |
398 | extern rand_gen rndm, rmg_rndm; |
|
|
399 | |
|
|
400 | INTERFACE_CLASS (attachable) |
|
|
401 | struct refcnt_base |
|
|
402 | { |
|
|
403 | typedef int refcnt_t; |
|
|
404 | mutable refcnt_t ACC (RW, refcnt); |
|
|
405 | |
|
|
406 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
407 | MTH void refcnt_dec () const { --refcnt; } |
|
|
408 | |
|
|
409 | refcnt_base () : refcnt (0) { } |
|
|
410 | }; |
|
|
411 | |
|
|
412 | // to avoid branches with more advanced compilers |
|
|
413 | extern refcnt_base::refcnt_t refcnt_dummy; |
338 | |
414 | |
339 | template<class T> |
415 | template<class T> |
340 | struct refptr |
416 | struct refptr |
341 | { |
417 | { |
|
|
418 | // p if not null |
|
|
419 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
420 | |
|
|
421 | void refcnt_dec () |
|
|
422 | { |
|
|
423 | if (!is_constant (p)) |
|
|
424 | --*refcnt_ref (); |
|
|
425 | else if (p) |
|
|
426 | --p->refcnt; |
|
|
427 | } |
|
|
428 | |
|
|
429 | void refcnt_inc () |
|
|
430 | { |
|
|
431 | if (!is_constant (p)) |
|
|
432 | ++*refcnt_ref (); |
|
|
433 | else if (p) |
|
|
434 | ++p->refcnt; |
|
|
435 | } |
|
|
436 | |
342 | T *p; |
437 | T *p; |
343 | |
438 | |
344 | refptr () : p(0) { } |
439 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
440 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
441 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
442 | ~refptr () { refcnt_dec (); } |
348 | |
443 | |
349 | const refptr<T> &operator =(T *o) |
444 | const refptr<T> &operator =(T *o) |
350 | { |
445 | { |
|
|
446 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
447 | refcnt_dec (); |
352 | p = o; |
448 | p = o; |
353 | if (p) p->refcnt_inc (); |
449 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
450 | return *this; |
356 | } |
451 | } |
357 | |
452 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
453 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
454 | { |
360 | *this = o.p; |
455 | *this = o.p; |
361 | return *this; |
456 | return *this; |
362 | } |
457 | } |
363 | |
458 | |
364 | T &operator * () const { return *p; } |
459 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
460 | T *operator ->() const { return p; } |
366 | |
461 | |
367 | operator T *() const { return p; } |
462 | operator T *() const { return p; } |
368 | }; |
463 | }; |
369 | |
464 | |
370 | typedef refptr<maptile> maptile_ptr; |
465 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
405 | { |
500 | { |
406 | return !strcmp (a, b); |
501 | return !strcmp (a, b); |
407 | } |
502 | } |
408 | }; |
503 | }; |
409 | |
504 | |
|
|
505 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
506 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
507 | // |
|
|
508 | // NOTE: only some forms of erase are available |
410 | template<class T> |
509 | template<class T> |
411 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
510 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
412 | { |
511 | { |
413 | typedef typename unordered_vector::iterator iterator; |
512 | typedef typename unordered_vector::iterator iterator; |
414 | |
513 | |
… | |
… | |
424 | { |
523 | { |
425 | erase ((unsigned int )(i - this->begin ())); |
524 | erase ((unsigned int )(i - this->begin ())); |
426 | } |
525 | } |
427 | }; |
526 | }; |
428 | |
527 | |
429 | template<class T, int T::* index> |
528 | // This container blends advantages of linked lists |
|
|
529 | // (efficiency) with vectors (random access) by |
|
|
530 | // by using an unordered vector and storing the vector |
|
|
531 | // index inside the object. |
|
|
532 | // |
|
|
533 | // + memory-efficient on most 64 bit archs |
|
|
534 | // + O(1) insert/remove |
|
|
535 | // + free unique (but varying) id for inserted objects |
|
|
536 | // + cache-friendly iteration |
|
|
537 | // - only works for pointers to structs |
|
|
538 | // |
|
|
539 | // NOTE: only some forms of erase/insert are available |
|
|
540 | typedef int object_vector_index; |
|
|
541 | |
|
|
542 | template<class T, object_vector_index T::*indexmember> |
430 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
543 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
431 | { |
544 | { |
|
|
545 | typedef typename object_vector::iterator iterator; |
|
|
546 | |
|
|
547 | bool contains (const T *obj) const |
|
|
548 | { |
|
|
549 | return obj->*indexmember; |
|
|
550 | } |
|
|
551 | |
|
|
552 | iterator find (const T *obj) |
|
|
553 | { |
|
|
554 | return obj->*indexmember |
|
|
555 | ? this->begin () + obj->*indexmember - 1 |
|
|
556 | : this->end (); |
|
|
557 | } |
|
|
558 | |
|
|
559 | void push_back (T *obj) |
|
|
560 | { |
|
|
561 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
562 | obj->*indexmember = this->size (); |
|
|
563 | } |
|
|
564 | |
432 | void insert (T *obj) |
565 | void insert (T *obj) |
433 | { |
566 | { |
434 | assert (!(obj->*index)); |
|
|
435 | push_back (obj); |
567 | push_back (obj); |
436 | obj->*index = this->size (); |
|
|
437 | } |
568 | } |
438 | |
569 | |
439 | void insert (T &obj) |
570 | void insert (T &obj) |
440 | { |
571 | { |
441 | insert (&obj); |
572 | insert (&obj); |
442 | } |
573 | } |
443 | |
574 | |
444 | void erase (T *obj) |
575 | void erase (T *obj) |
445 | { |
576 | { |
446 | assert (obj->*index); |
|
|
447 | unsigned int pos = obj->*index; |
577 | unsigned int pos = obj->*indexmember; |
448 | obj->*index = 0; |
578 | obj->*indexmember = 0; |
449 | |
579 | |
450 | if (pos < this->size ()) |
580 | if (pos < this->size ()) |
451 | { |
581 | { |
452 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
582 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
453 | (*this)[pos - 1]->*index = pos; |
583 | (*this)[pos - 1]->*indexmember = pos; |
454 | } |
584 | } |
455 | |
585 | |
456 | this->pop_back (); |
586 | this->pop_back (); |
457 | } |
587 | } |
458 | |
588 | |
459 | void erase (T &obj) |
589 | void erase (T &obj) |
460 | { |
590 | { |
461 | errase (&obj); |
591 | erase (&obj); |
462 | } |
592 | } |
463 | }; |
593 | }; |
464 | |
594 | |
465 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
595 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
466 | void assign (char *dst, const char *src, int maxlen); |
596 | void assign (char *dst, const char *src, int maxlen); |
… | |
… | |
472 | assign ((char *)&dst, src, N); |
602 | assign ((char *)&dst, src, N); |
473 | } |
603 | } |
474 | |
604 | |
475 | typedef double tstamp; |
605 | typedef double tstamp; |
476 | |
606 | |
477 | // return current time as timestampe |
607 | // return current time as timestamp |
478 | tstamp now (); |
608 | tstamp now (); |
479 | |
609 | |
480 | int similar_direction (int a, int b); |
610 | int similar_direction (int a, int b); |
481 | |
611 | |
482 | // like printf, but returns a std::string |
612 | // like sprintf, but returns a "static" buffer |
483 | const std::string format (const char *format, ...); |
613 | const char *format (const char *format, ...); |
484 | |
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 |
485 | #endif |
647 | #endif |
486 | |
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 | |