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

Diff Legend

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