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.44 by root, Fri May 11 08:00:00 2007 UTC vs.
Revision 1.93 by root, Sat Nov 7 18:30:05 2009 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 *
6 * Deliantra is free software: you can redistribute it and/or modify it under
7 * the terms of the Affero GNU General Public License as published by the
8 * Free Software Foundation, either version 3 of the License, or (at your
9 * option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the Affero GNU General Public License
17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
19 *
20 * The authors can be reached via e-mail to <support@deliantra.net>
21 */
22
1#ifndef UTIL_H__ 23#ifndef UTIL_H__
2#define UTIL_H__ 24#define UTIL_H__
3 25
4//#define PREFER_MALLOC 26#include <compiler.h>
5 27
6#if __GNUC__ >= 3 28#define DEBUG_POISON 0x00 // poison memory before freeing it if != 0
7# define is_constant(c) __builtin_constant_p (c) 29#define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs
8#else 30#define PREFER_MALLOC 0 // use malloc and not the slice allocator
9# define is_constant(c) 0 31
10#endif 32#include <pthread.h>
11 33
12#include <cstddef> 34#include <cstddef>
13#include <cmath> 35#include <cmath>
14#include <new> 36#include <new>
15#include <vector> 37#include <vector>
… …
17#include <glib.h> 39#include <glib.h>
18 40
19#include <shstr.h> 41#include <shstr.h>
20#include <traits.h> 42#include <traits.h>
21 43
44#if DEBUG_SALLOC
45# define g_slice_alloc0(s) debug_slice_alloc0(s)
46# define g_slice_alloc(s) debug_slice_alloc(s)
47# define g_slice_free1(s,p) debug_slice_free1(s,p)
48void *g_slice_alloc (unsigned long size);
49void *g_slice_alloc0 (unsigned long size);
50void g_slice_free1 (unsigned long size, void *ptr);
51#elif PREFER_MALLOC
52# define g_slice_alloc0(s) calloc (1, (s))
53# define g_slice_alloc(s) malloc ((s))
54# define g_slice_free1(s,p) free ((p))
55#endif
56
22// use a gcc extension for auto declarations until ISO C++ sanctifies them 57// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
23#define auto(var,expr) typeof(expr) var = (expr) 58#define auto(var,expr) decltype(expr) var = (expr)
24 59
25// very ugly macro that basicaly declares and initialises a variable 60// very ugly macro that basically declares and initialises a variable
26// that is in scope for the next statement only 61// that is in scope for the next statement only
27// works only for stuff that can be assigned 0 and converts to false 62// works only for stuff that can be assigned 0 and converts to false
28// (note: works great for pointers) 63// (note: works great for pointers)
29// most ugly macro I ever wrote 64// most ugly macro I ever wrote
30#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) 65#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
31 66
32// in range including end 67// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 68#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 69 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 70
36// in range excluding end 71// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \ 72#define IN_RANGE_EXC(val,beg,end) \
38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 73 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
39 74
75void cleanup (const char *cause, bool make_core = false);
40void fork_abort (const char *msg); 76void fork_abort (const char *msg);
41 77
42// rationale for using (U) not (T) is to reduce signed/unsigned issues, 78// rationale for using (U) not (T) is to reduce signed/unsigned issues,
43// as a is often a constant while b is the variable. it is still a bug, though. 79// as a is often a constant while b is the variable. it is still a bug, though.
44template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 80template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 81template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
46template<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; } 82template<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; }
47 83
84template<typename T, typename U> static inline void min_it (T &v, U m) { v = min (v, (T)m); }
85template<typename T, typename U> static inline void max_it (T &v, U m) { v = max (v, (T)m); }
86template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = clamp (v, (T)a, (T)b); }
87
48template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 88template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
49 89
90template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
91template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
92
93// sign returns -1 or +1
94template<typename T>
95static inline T sign (T v) { return v < 0 ? -1 : +1; }
96// relies on 2c representation
97template<>
98inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); }
99
100// sign0 returns -1, 0 or +1
101template<typename T>
102static inline T sign0 (T v) { return v ? sign (v) : 0; }
103
104// div* only work correctly for div > 0
105// div, with correct rounding (< 0.5 downwards, >=0.5 upwards)
106template<typename T> static inline T div (T val, T div)
107{
108 return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div;
109}
110// div, round-up
111template<typename T> static inline T div_ru (T val, T div)
112{
113 return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div;
114}
115// div, round-down
116template<typename T> static inline T div_rd (T val, T div)
117{
118 return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div;
119}
120
121// lerp* only work correctly for min_in < max_in
122// Linear intERPolate, scales val from min_in..max_in to min_out..max_out
50template<typename T> 123template<typename T>
51static inline T 124static inline T
52lerp (T val, T min_in, T max_in, T min_out, T max_out) 125lerp (T val, T min_in, T max_in, T min_out, T max_out)
53{ 126{
54 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; 127 return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in);
128}
129
130// lerp, round-down
131template<typename T>
132static inline T
133lerp_rd (T val, T min_in, T max_in, T min_out, T max_out)
134{
135 return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
136}
137
138// lerp, round-up
139template<typename T>
140static inline T
141lerp_ru (T val, T min_in, T max_in, T min_out, T max_out)
142{
143 return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in);
55} 144}
56 145
57// lots of stuff taken from FXT 146// lots of stuff taken from FXT
58 147
59/* Rotate right. This is used in various places for checksumming */ 148/* Rotate right. This is used in various places for checksumming */
… …
103// on modern cpus 192// on modern cpus
104inline int 193inline int
105isqrt (int n) 194isqrt (int n)
106{ 195{
107 return (int)sqrtf ((float)n); 196 return (int)sqrtf ((float)n);
197}
198
199// this is kind of like the ^^ operator, if it would exist, without sequence point.
200// more handy than it looks like, due to the implicit !! done on its arguments
201inline bool
202logical_xor (bool a, bool b)
203{
204 return a != b;
205}
206
207inline bool
208logical_implies (bool a, bool b)
209{
210 return a <= b;
108} 211}
109 212
110// this is only twice as fast as naive sqrtf (dx*dy+dy*dy) 213// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
111#if 0 214#if 0
112// and has a max. error of 6 in the range -100..+100. 215// and has a max. error of 6 in the range -100..+100.
… …
137absdir (int d) 240absdir (int d)
138{ 241{
139 return ((d - 1) & 7) + 1; 242 return ((d - 1) & 7) + 1;
140} 243}
141 244
245extern ssize_t slice_alloc; // statistics
246
247void *salloc_ (int n) throw (std::bad_alloc);
248void *salloc_ (int n, void *src) throw (std::bad_alloc);
249
250// strictly the same as g_slice_alloc, but never returns 0
251template<typename T>
252inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
253
254// also copies src into the new area, like "memdup"
255// if src is 0, clears the memory
256template<typename T>
257inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
258
259// clears the memory
260template<typename T>
261inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
262
263// for symmetry
264template<typename T>
265inline void sfree (T *ptr, int n = 1) throw ()
266{
267 if (expect_true (ptr))
268 {
269 slice_alloc -= n * sizeof (T);
270 if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T));
271 g_slice_free1 (n * sizeof (T), (void *)ptr);
272 assert (slice_alloc >= 0);//D
273 }
274}
275
276// nulls the pointer
277template<typename T>
278inline void sfree0 (T *&ptr, int n = 1) throw ()
279{
280 sfree<T> (ptr, n);
281 ptr = 0;
282}
283
142// makes dynamically allocated objects zero-initialised 284// makes dynamically allocated objects zero-initialised
143struct zero_initialised 285struct zero_initialised
144{ 286{
145 void *operator new (size_t s, void *p) 287 void *operator new (size_t s, void *p)
146 { 288 {
… …
148 return p; 290 return p;
149 } 291 }
150 292
151 void *operator new (size_t s) 293 void *operator new (size_t s)
152 { 294 {
153 return g_slice_alloc0 (s); 295 return salloc0<char> (s);
154 } 296 }
155 297
156 void *operator new[] (size_t s) 298 void *operator new[] (size_t s)
157 { 299 {
158 return g_slice_alloc0 (s); 300 return salloc0<char> (s);
159 } 301 }
160 302
161 void operator delete (void *p, size_t s) 303 void operator delete (void *p, size_t s)
162 { 304 {
163 g_slice_free1 (s, p); 305 sfree ((char *)p, s);
164 } 306 }
165 307
166 void operator delete[] (void *p, size_t s) 308 void operator delete[] (void *p, size_t s)
167 { 309 {
168 g_slice_free1 (s, p); 310 sfree ((char *)p, s);
169 } 311 }
170}; 312};
171 313
172void *salloc_ (int n) throw (std::bad_alloc); 314// makes dynamically allocated objects zero-initialised
173void *salloc_ (int n, void *src) throw (std::bad_alloc); 315struct slice_allocated
174
175// strictly the same as g_slice_alloc, but never returns 0
176template<typename T>
177inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
178
179// also copies src into the new area, like "memdup"
180// if src is 0, clears the memory
181template<typename T>
182inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
183
184// clears the memory
185template<typename T>
186inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
187
188// for symmetry
189template<typename T>
190inline void sfree (T *ptr, int n = 1) throw ()
191{ 316{
192#ifdef PREFER_MALLOC 317 void *operator new (size_t s, void *p)
193 free (ptr); 318 {
194#else 319 return p;
195 g_slice_free1 (n * sizeof (T), (void *)ptr); 320 }
196#endif 321
197} 322 void *operator new (size_t s)
323 {
324 return salloc<char> (s);
325 }
326
327 void *operator new[] (size_t s)
328 {
329 return salloc<char> (s);
330 }
331
332 void operator delete (void *p, size_t s)
333 {
334 sfree ((char *)p, s);
335 }
336
337 void operator delete[] (void *p, size_t s)
338 {
339 sfree ((char *)p, s);
340 }
341};
198 342
199// a STL-compatible allocator that uses g_slice 343// a STL-compatible allocator that uses g_slice
200// boy, this is verbose 344// boy, this is verbose
201template<typename Tp> 345template<typename Tp>
202struct slice_allocator 346struct slice_allocator
… …
214 { 358 {
215 typedef slice_allocator<U> other; 359 typedef slice_allocator<U> other;
216 }; 360 };
217 361
218 slice_allocator () throw () { } 362 slice_allocator () throw () { }
219 slice_allocator (const slice_allocator &o) throw () { } 363 slice_allocator (const slice_allocator &) throw () { }
220 template<typename Tp2> 364 template<typename Tp2>
221 slice_allocator (const slice_allocator<Tp2> &) throw () { } 365 slice_allocator (const slice_allocator<Tp2> &) throw () { }
222 366
223 ~slice_allocator () { } 367 ~slice_allocator () { }
224 368
… …
233 void deallocate (pointer p, size_type n) 377 void deallocate (pointer p, size_type n)
234 { 378 {
235 sfree<Tp> (p, n); 379 sfree<Tp> (p, n);
236 } 380 }
237 381
238 size_type max_size ()const throw () 382 size_type max_size () const throw ()
239 { 383 {
240 return size_t (-1) / sizeof (Tp); 384 return size_t (-1) / sizeof (Tp);
241 } 385 }
242 386
243 void construct (pointer p, const Tp &val) 387 void construct (pointer p, const Tp &val)
… …
254// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. 398// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213.
255// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 399// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
256// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 400// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
257struct tausworthe_random_generator 401struct tausworthe_random_generator
258{ 402{
259 // generator
260 uint32_t state [4]; 403 uint32_t state [4];
261 404
262 void operator =(const tausworthe_random_generator &src) 405 void operator =(const tausworthe_random_generator &src)
263 { 406 {
264 state [0] = src.state [0]; 407 state [0] = src.state [0];
… …
267 state [3] = src.state [3]; 410 state [3] = src.state [3];
268 } 411 }
269 412
270 void seed (uint32_t seed); 413 void seed (uint32_t seed);
271 uint32_t next (); 414 uint32_t next ();
415};
272 416
273 // uniform distribution 417// Xorshift RNGs, George Marsaglia
418// http://www.jstatsoft.org/v08/i14/paper
419// this one is about 40% faster than the tausworthe one above (i.e. not much),
420// despite the inlining, and has the issue of only creating 2**32-1 numbers.
421// see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf
422struct xorshift_random_generator
423{
424 uint32_t x, y;
425
426 void operator =(const xorshift_random_generator &src)
427 {
428 x = src.x;
429 y = src.y;
430 }
431
432 void seed (uint32_t seed)
433 {
434 x = seed;
435 y = seed * 69069U;
436 }
437
438 uint32_t next ()
439 {
440 uint32_t t = x ^ (x << 10);
441 x = y;
442 y = y ^ (y >> 13) ^ t ^ (t >> 10);
443 return y;
444 }
445};
446
447template<class generator>
448struct random_number_generator : generator
449{
450 // uniform distribution, 0 .. max (0, num - 1)
274 uint32_t operator ()(uint32_t num) 451 uint32_t operator ()(uint32_t num)
275 { 452 {
276 return is_constant (num) 453 return !is_constant (num) ? get_range (num) // non-constant
277 ? (next () * (uint64_t)num) >> 32U 454 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
278 : get_range (num); 455 : this->next () & (num - 1); // constant, power-of-two
279 } 456 }
280 457
281 // return a number within (min .. max) 458 // return a number within (min .. max)
282 int operator () (int r_min, int r_max) 459 int operator () (int r_min, int r_max)
283 { 460 {
… …
294protected: 471protected:
295 uint32_t get_range (uint32_t r_max); 472 uint32_t get_range (uint32_t r_max);
296 int get_range (int r_min, int r_max); 473 int get_range (int r_min, int r_max);
297}; 474};
298 475
299typedef tausworthe_random_generator rand_gen; 476typedef random_number_generator<tausworthe_random_generator> rand_gen;
300 477
301extern rand_gen rndm; 478extern rand_gen rndm, rmg_rndm;
479
480INTERFACE_CLASS (attachable)
481struct refcnt_base
482{
483 typedef int refcnt_t;
484 mutable refcnt_t ACC (RW, refcnt);
485
486 MTH void refcnt_inc () const { ++refcnt; }
487 MTH void refcnt_dec () const { --refcnt; }
488
489 refcnt_base () : refcnt (0) { }
490};
491
492// to avoid branches with more advanced compilers
493extern refcnt_base::refcnt_t refcnt_dummy;
302 494
303template<class T> 495template<class T>
304struct refptr 496struct refptr
305{ 497{
498 // p if not null
499 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
500
501 void refcnt_dec ()
502 {
503 if (!is_constant (p))
504 --*refcnt_ref ();
505 else if (p)
506 --p->refcnt;
507 }
508
509 void refcnt_inc ()
510 {
511 if (!is_constant (p))
512 ++*refcnt_ref ();
513 else if (p)
514 ++p->refcnt;
515 }
516
306 T *p; 517 T *p;
307 518
308 refptr () : p(0) { } 519 refptr () : p(0) { }
309 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 520 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
310 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 521 refptr (T *p) : p(p) { refcnt_inc (); }
311 ~refptr () { if (p) p->refcnt_dec (); } 522 ~refptr () { refcnt_dec (); }
312 523
313 const refptr<T> &operator =(T *o) 524 const refptr<T> &operator =(T *o)
314 { 525 {
526 // if decrementing ever destroys we need to reverse the order here
315 if (p) p->refcnt_dec (); 527 refcnt_dec ();
316 p = o; 528 p = o;
317 if (p) p->refcnt_inc (); 529 refcnt_inc ();
318
319 return *this; 530 return *this;
320 } 531 }
321 532
322 const refptr<T> &operator =(const refptr<T> o) 533 const refptr<T> &operator =(const refptr<T> &o)
323 { 534 {
324 *this = o.p; 535 *this = o.p;
325 return *this; 536 return *this;
326 } 537 }
327 538
328 T &operator * () const { return *p; } 539 T &operator * () const { return *p; }
329 T *operator ->() const { return p; } 540 T *operator ->() const { return p; }
330 541
331 operator T *() const { return p; } 542 operator T *() const { return p; }
332}; 543};
333 544
334typedef refptr<maptile> maptile_ptr; 545typedef refptr<maptile> maptile_ptr;
… …
339 550
340struct str_hash 551struct str_hash
341{ 552{
342 std::size_t operator ()(const char *s) const 553 std::size_t operator ()(const char *s) const
343 { 554 {
344 unsigned long hash = 0; 555#if 0
556 uint32_t hash = 0;
345 557
346 /* use the one-at-a-time hash function, which supposedly is 558 /* use the one-at-a-time hash function, which supposedly is
347 * better than the djb2-like one used by perl5.005, but 559 * better than the djb2-like one used by perl5.005, but
348 * certainly is better then the bug used here before. 560 * certainly is better then the bug used here before.
349 * see http://burtleburtle.net/bob/hash/doobs.html 561 * see http://burtleburtle.net/bob/hash/doobs.html
… …
356 } 568 }
357 569
358 hash += hash << 3; 570 hash += hash << 3;
359 hash ^= hash >> 11; 571 hash ^= hash >> 11;
360 hash += hash << 15; 572 hash += hash << 15;
573#else
574 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
575 // it is about twice as fast as the one-at-a-time one,
576 // with good distribution.
577 // FNV-1a is faster on many cpus because the multiplication
578 // runs concurrent with the looping logic.
579 uint32_t hash = 2166136261;
580
581 while (*s)
582 hash = (hash ^ *s++) * 16777619;
583#endif
361 584
362 return hash; 585 return hash;
363 } 586 }
364}; 587};
365 588
… …
369 { 592 {
370 return !strcmp (a, b); 593 return !strcmp (a, b);
371 } 594 }
372}; 595};
373 596
597// Mostly the same as std::vector, but insert/erase can reorder
598// the elements, making append(=insert)/remove O(1) instead of O(n).
599//
600// NOTE: only some forms of erase are available
374template<class T> 601template<class T>
375struct unordered_vector : std::vector<T, slice_allocator<T> > 602struct unordered_vector : std::vector<T, slice_allocator<T> >
376{ 603{
377 typedef typename unordered_vector::iterator iterator; 604 typedef typename unordered_vector::iterator iterator;
378 605
… …
388 { 615 {
389 erase ((unsigned int )(i - this->begin ())); 616 erase ((unsigned int )(i - this->begin ()));
390 } 617 }
391}; 618};
392 619
393template<class T, int T::* index> 620// This container blends advantages of linked lists
621// (efficiency) with vectors (random access) by
622// by using an unordered vector and storing the vector
623// index inside the object.
624//
625// + memory-efficient on most 64 bit archs
626// + O(1) insert/remove
627// + free unique (but varying) id for inserted objects
628// + cache-friendly iteration
629// - only works for pointers to structs
630//
631// NOTE: only some forms of erase/insert are available
632typedef int object_vector_index;
633
634template<class T, object_vector_index T::*indexmember>
394struct object_vector : std::vector<T *, slice_allocator<T *> > 635struct object_vector : std::vector<T *, slice_allocator<T *> >
395{ 636{
637 typedef typename object_vector::iterator iterator;
638
639 bool contains (const T *obj) const
640 {
641 return obj->*indexmember;
642 }
643
644 iterator find (const T *obj)
645 {
646 return obj->*indexmember
647 ? this->begin () + obj->*indexmember - 1
648 : this->end ();
649 }
650
651 void push_back (T *obj)
652 {
653 std::vector<T *, slice_allocator<T *> >::push_back (obj);
654 obj->*indexmember = this->size ();
655 }
656
396 void insert (T *obj) 657 void insert (T *obj)
397 { 658 {
398 assert (!(obj->*index));
399 push_back (obj); 659 push_back (obj);
400 obj->*index = this->size ();
401 } 660 }
402 661
403 void insert (T &obj) 662 void insert (T &obj)
404 { 663 {
405 insert (&obj); 664 insert (&obj);
406 } 665 }
407 666
408 void erase (T *obj) 667 void erase (T *obj)
409 { 668 {
410 assert (obj->*index);
411 unsigned int pos = obj->*index; 669 unsigned int pos = obj->*indexmember;
412 obj->*index = 0; 670 obj->*indexmember = 0;
413 671
414 if (pos < this->size ()) 672 if (pos < this->size ())
415 { 673 {
416 (*this)[pos - 1] = (*this)[this->size () - 1]; 674 (*this)[pos - 1] = (*this)[this->size () - 1];
417 (*this)[pos - 1]->*index = pos; 675 (*this)[pos - 1]->*indexmember = pos;
418 } 676 }
419 677
420 this->pop_back (); 678 this->pop_back ();
421 } 679 }
422 680
423 void erase (T &obj) 681 void erase (T &obj)
424 { 682 {
425 errase (&obj); 683 erase (&obj);
426 } 684 }
427}; 685};
428 686
429// basically does what strncpy should do, but appends "..." to strings exceeding length 687// basically does what strncpy should do, but appends "..." to strings exceeding length
688// returns the number of bytes actually used (including \0)
430void assign (char *dst, const char *src, int maxlen); 689int assign (char *dst, const char *src, int maxsize);
431 690
432// type-safe version of assign 691// type-safe version of assign
433template<int N> 692template<int N>
434inline void assign (char (&dst)[N], const char *src) 693inline int assign (char (&dst)[N], const char *src)
435{ 694{
436 assign ((char *)&dst, src, N); 695 return assign ((char *)&dst, src, N);
437} 696}
438 697
439typedef double tstamp; 698typedef double tstamp;
440 699
441// return current time as timestampe 700// return current time as timestamp
442tstamp now (); 701tstamp now ();
443 702
444int similar_direction (int a, int b); 703int similar_direction (int a, int b);
445 704
446// like printf, but returns a std::string 705// like v?sprintf, but returns a "static" buffer
447const std::string format (const char *format, ...); 706char *vformat (const char *format, va_list ap);
707char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
448 708
709// safety-check player input which will become object->msg
710bool msg_is_safe (const char *msg);
711
712/////////////////////////////////////////////////////////////////////////////
713// threads, very very thin wrappers around pthreads
714
715struct thread
716{
717 pthread_t id;
718
719 void start (void *(*start_routine)(void *), void *arg = 0);
720
721 void cancel ()
722 {
723 pthread_cancel (id);
724 }
725
726 void *join ()
727 {
728 void *ret;
729
730 if (pthread_join (id, &ret))
731 cleanup ("pthread_join failed", 1);
732
733 return ret;
734 }
735};
736
737// note that mutexes are not classes
738typedef pthread_mutex_t smutex;
739
740#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
741 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
742#else
743 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
449#endif 744#endif
450 745
746#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
747#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
748#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
749
750typedef pthread_cond_t scond;
751
752#define SCOND(name) scond name = PTHREAD_COND_INITIALIZER
753#define SCOND_SIGNAL(name) pthread_cond_signal (&(name))
754#define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name))
755#define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex))
756
757#endif
758

Diff Legend

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