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.43 by root, Mon Apr 23 18:09:57 2007 UTC vs.
Revision 1.95 by root, Tue Nov 10 00:01:31 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; }
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
123template<typename T>
124static inline T
125lerp (T val, T min_in, T max_in, T min_out, T max_out)
126{
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);
144}
49 145
50// lots of stuff taken from FXT 146// lots of stuff taken from FXT
51 147
52/* Rotate right. This is used in various places for checksumming */ 148/* Rotate right. This is used in various places for checksumming */
53//TODO: that sucks, use a better checksum algo 149//TODO: that sucks, use a better checksum algo
… …
90 int32_t d = b - a; 186 int32_t d = b - a;
91 d &= d >> 31; 187 d &= d >> 31;
92 return b - d; 188 return b - d;
93} 189}
94 190
95// this is much faster than crossfires original algorithm 191// this is much faster than crossfire's original algorithm
96// on modern cpus 192// on modern cpus
97inline int 193inline int
98isqrt (int n) 194isqrt (int n)
99{ 195{
100 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;
101} 211}
102 212
103// 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)
104#if 0 214#if 0
105// 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.
… …
130absdir (int d) 240absdir (int d)
131{ 241{
132 return ((d - 1) & 7) + 1; 242 return ((d - 1) & 7) + 1;
133} 243}
134 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
135// makes dynamically allocated objects zero-initialised 284// makes dynamically allocated objects zero-initialised
136struct zero_initialised 285struct zero_initialised
137{ 286{
138 void *operator new (size_t s, void *p) 287 void *operator new (size_t s, void *p)
139 { 288 {
… …
141 return p; 290 return p;
142 } 291 }
143 292
144 void *operator new (size_t s) 293 void *operator new (size_t s)
145 { 294 {
146 return g_slice_alloc0 (s); 295 return salloc0<char> (s);
147 } 296 }
148 297
149 void *operator new[] (size_t s) 298 void *operator new[] (size_t s)
150 { 299 {
151 return g_slice_alloc0 (s); 300 return salloc0<char> (s);
152 } 301 }
153 302
154 void operator delete (void *p, size_t s) 303 void operator delete (void *p, size_t s)
155 { 304 {
156 g_slice_free1 (s, p); 305 sfree ((char *)p, s);
157 } 306 }
158 307
159 void operator delete[] (void *p, size_t s) 308 void operator delete[] (void *p, size_t s)
160 { 309 {
161 g_slice_free1 (s, p); 310 sfree ((char *)p, s);
162 } 311 }
163}; 312};
164 313
165void *salloc_ (int n) throw (std::bad_alloc); 314// makes dynamically allocated objects zero-initialised
166void *salloc_ (int n, void *src) throw (std::bad_alloc); 315struct slice_allocated
167
168// strictly the same as g_slice_alloc, but never returns 0
169template<typename T>
170inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); }
171
172// also copies src into the new area, like "memdup"
173// if src is 0, clears the memory
174template<typename T>
175inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
176
177// clears the memory
178template<typename T>
179inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
180
181// for symmetry
182template<typename T>
183inline void sfree (T *ptr, int n = 1) throw ()
184{ 316{
185#ifdef PREFER_MALLOC 317 void *operator new (size_t s, void *p)
186 free (ptr); 318 {
187#else 319 return p;
188 g_slice_free1 (n * sizeof (T), (void *)ptr); 320 }
189#endif 321
190} 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};
191 342
192// a STL-compatible allocator that uses g_slice 343// a STL-compatible allocator that uses g_slice
193// boy, this is verbose 344// boy, this is verbose
194template<typename Tp> 345template<typename Tp>
195struct slice_allocator 346struct slice_allocator
… …
207 { 358 {
208 typedef slice_allocator<U> other; 359 typedef slice_allocator<U> other;
209 }; 360 };
210 361
211 slice_allocator () throw () { } 362 slice_allocator () throw () { }
212 slice_allocator (const slice_allocator &o) throw () { } 363 slice_allocator (const slice_allocator &) throw () { }
213 template<typename Tp2> 364 template<typename Tp2>
214 slice_allocator (const slice_allocator<Tp2> &) throw () { } 365 slice_allocator (const slice_allocator<Tp2> &) throw () { }
215 366
216 ~slice_allocator () { } 367 ~slice_allocator () { }
217 368
… …
226 void deallocate (pointer p, size_type n) 377 void deallocate (pointer p, size_type n)
227 { 378 {
228 sfree<Tp> (p, n); 379 sfree<Tp> (p, n);
229 } 380 }
230 381
231 size_type max_size ()const throw () 382 size_type max_size () const throw ()
232 { 383 {
233 return size_t (-1) / sizeof (Tp); 384 return size_t (-1) / sizeof (Tp);
234 } 385 }
235 386
236 void construct (pointer p, const Tp &val) 387 void construct (pointer p, const Tp &val)
… …
247// 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.
248// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps 399// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps
249// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps 400// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps
250struct tausworthe_random_generator 401struct tausworthe_random_generator
251{ 402{
252 // generator
253 uint32_t state [4]; 403 uint32_t state [4];
254 404
255 void operator =(const tausworthe_random_generator &src) 405 void operator =(const tausworthe_random_generator &src)
256 { 406 {
257 state [0] = src.state [0]; 407 state [0] = src.state [0];
… …
260 state [3] = src.state [3]; 410 state [3] = src.state [3];
261 } 411 }
262 412
263 void seed (uint32_t seed); 413 void seed (uint32_t seed);
264 uint32_t next (); 414 uint32_t next ();
415};
265 416
266 // 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)
267 uint32_t operator ()(uint32_t num) 451 uint32_t operator ()(uint32_t num)
268 { 452 {
269 return is_constant (num) 453 return !is_constant (num) ? get_range (num) // non-constant
270 ? (next () * (uint64_t)num) >> 32U 454 : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two
271 : get_range (num); 455 : this->next () & (num - 1); // constant, power-of-two
272 } 456 }
273 457
274 // return a number within (min .. max) 458 // return a number within (min .. max)
275 int operator () (int r_min, int r_max) 459 int operator () (int r_min, int r_max)
276 { 460 {
… …
287protected: 471protected:
288 uint32_t get_range (uint32_t r_max); 472 uint32_t get_range (uint32_t r_max);
289 int get_range (int r_min, int r_max); 473 int get_range (int r_min, int r_max);
290}; 474};
291 475
292typedef tausworthe_random_generator rand_gen; 476typedef random_number_generator<tausworthe_random_generator> rand_gen;
293 477
294extern 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;
295 494
296template<class T> 495template<class T>
297struct refptr 496struct refptr
298{ 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
299 T *p; 517 T *p;
300 518
301 refptr () : p(0) { } 519 refptr () : p(0) { }
302 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 520 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
303 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 521 refptr (T *p) : p(p) { refcnt_inc (); }
304 ~refptr () { if (p) p->refcnt_dec (); } 522 ~refptr () { refcnt_dec (); }
305 523
306 const refptr<T> &operator =(T *o) 524 const refptr<T> &operator =(T *o)
307 { 525 {
526 // if decrementing ever destroys we need to reverse the order here
308 if (p) p->refcnt_dec (); 527 refcnt_dec ();
309 p = o; 528 p = o;
310 if (p) p->refcnt_inc (); 529 refcnt_inc ();
311
312 return *this; 530 return *this;
313 } 531 }
314 532
315 const refptr<T> &operator =(const refptr<T> o) 533 const refptr<T> &operator =(const refptr<T> &o)
316 { 534 {
317 *this = o.p; 535 *this = o.p;
318 return *this; 536 return *this;
319 } 537 }
320 538
321 T &operator * () const { return *p; } 539 T &operator * () const { return *p; }
322 T *operator ->() const { return p; } 540 T *operator ->() const { return p; }
323 541
324 operator T *() const { return p; } 542 operator T *() const { return p; }
325}; 543};
326 544
327typedef refptr<maptile> maptile_ptr; 545typedef refptr<maptile> maptile_ptr;
328typedef refptr<object> object_ptr; 546typedef refptr<object> object_ptr;
329typedef refptr<archetype> arch_ptr; 547typedef refptr<archetype> arch_ptr;
330typedef refptr<client> client_ptr; 548typedef refptr<client> client_ptr;
331typedef refptr<player> player_ptr; 549typedef refptr<player> player_ptr;
332 550
551#define STRHSH_NULL 2166136261
552
553static inline uint32_t
554strhsh (const char *s)
555{
556 // use FNV-1a hash (http://isthe.com/chongo/tech/comp/fnv/)
557 // it is about twice as fast as the one-at-a-time one,
558 // with good distribution.
559 // FNV-1a is faster on many cpus because the multiplication
560 // runs concurrently with the looping logic.
561 uint32_t hash = STRHSH_NULL;
562
563 while (*s)
564 hash = (hash ^ *s++) * 16777619;
565
566 return hash;
567}
568
569static inline uint32_t
570memhsh (const char *s, size_t len)
571{
572 uint32_t hash = STRHSH_NULL;
573
574 while (len--)
575 hash = (hash ^ *s++) * 16777619;
576
577 return hash;
578}
579
333struct str_hash 580struct str_hash
334{ 581{
335 std::size_t operator ()(const char *s) const 582 std::size_t operator ()(const char *s) const
336 { 583 {
337 unsigned long hash = 0;
338
339 /* use the one-at-a-time hash function, which supposedly is
340 * better than the djb2-like one used by perl5.005, but
341 * certainly is better then the bug used here before.
342 * see http://burtleburtle.net/bob/hash/doobs.html
343 */
344 while (*s)
345 {
346 hash += *s++;
347 hash += hash << 10;
348 hash ^= hash >> 6;
349 }
350
351 hash += hash << 3;
352 hash ^= hash >> 11;
353 hash += hash << 15;
354
355 return hash; 584 return strhsh (s);
585 }
586
587 std::size_t operator ()(const shstr &s) const
588 {
589 return strhsh (s);
356 } 590 }
357}; 591};
358 592
359struct str_equal 593struct str_equal
360{ 594{
… …
362 { 596 {
363 return !strcmp (a, b); 597 return !strcmp (a, b);
364 } 598 }
365}; 599};
366 600
601// Mostly the same as std::vector, but insert/erase can reorder
602// the elements, making append(=insert)/remove O(1) instead of O(n).
603//
604// NOTE: only some forms of erase are available
367template<class T> 605template<class T>
368struct unordered_vector : std::vector<T, slice_allocator<T> > 606struct unordered_vector : std::vector<T, slice_allocator<T> >
369{ 607{
370 typedef typename unordered_vector::iterator iterator; 608 typedef typename unordered_vector::iterator iterator;
371 609
… …
381 { 619 {
382 erase ((unsigned int )(i - this->begin ())); 620 erase ((unsigned int )(i - this->begin ()));
383 } 621 }
384}; 622};
385 623
386template<class T, int T::* index> 624// This container blends advantages of linked lists
625// (efficiency) with vectors (random access) by
626// by using an unordered vector and storing the vector
627// index inside the object.
628//
629// + memory-efficient on most 64 bit archs
630// + O(1) insert/remove
631// + free unique (but varying) id for inserted objects
632// + cache-friendly iteration
633// - only works for pointers to structs
634//
635// NOTE: only some forms of erase/insert are available
636typedef int object_vector_index;
637
638template<class T, object_vector_index T::*indexmember>
387struct object_vector : std::vector<T *, slice_allocator<T *> > 639struct object_vector : std::vector<T *, slice_allocator<T *> >
388{ 640{
641 typedef typename object_vector::iterator iterator;
642
643 bool contains (const T *obj) const
644 {
645 return obj->*indexmember;
646 }
647
648 iterator find (const T *obj)
649 {
650 return obj->*indexmember
651 ? this->begin () + obj->*indexmember - 1
652 : this->end ();
653 }
654
655 void push_back (T *obj)
656 {
657 std::vector<T *, slice_allocator<T *> >::push_back (obj);
658 obj->*indexmember = this->size ();
659 }
660
389 void insert (T *obj) 661 void insert (T *obj)
390 { 662 {
391 assert (!(obj->*index));
392 push_back (obj); 663 push_back (obj);
393 obj->*index = this->size ();
394 } 664 }
395 665
396 void insert (T &obj) 666 void insert (T &obj)
397 { 667 {
398 insert (&obj); 668 insert (&obj);
399 } 669 }
400 670
401 void erase (T *obj) 671 void erase (T *obj)
402 { 672 {
403 assert (obj->*index);
404 unsigned int pos = obj->*index; 673 unsigned int pos = obj->*indexmember;
405 obj->*index = 0; 674 obj->*indexmember = 0;
406 675
407 if (pos < this->size ()) 676 if (pos < this->size ())
408 { 677 {
409 (*this)[pos - 1] = (*this)[this->size () - 1]; 678 (*this)[pos - 1] = (*this)[this->size () - 1];
410 (*this)[pos - 1]->*index = pos; 679 (*this)[pos - 1]->*indexmember = pos;
411 } 680 }
412 681
413 this->pop_back (); 682 this->pop_back ();
414 } 683 }
415 684
416 void erase (T &obj) 685 void erase (T &obj)
417 { 686 {
418 errase (&obj); 687 erase (&obj);
419 } 688 }
420}; 689};
421 690
422// basically does what strncpy should do, but appends "..." to strings exceeding length 691// basically does what strncpy should do, but appends "..." to strings exceeding length
692// returns the number of bytes actually used (including \0)
423void assign (char *dst, const char *src, int maxlen); 693int assign (char *dst, const char *src, int maxsize);
424 694
425// type-safe version of assign 695// type-safe version of assign
426template<int N> 696template<int N>
427inline void assign (char (&dst)[N], const char *src) 697inline int assign (char (&dst)[N], const char *src)
428{ 698{
429 assign ((char *)&dst, src, N); 699 return assign ((char *)&dst, src, N);
430} 700}
431 701
432typedef double tstamp; 702typedef double tstamp;
433 703
434// return current time as timestampe 704// return current time as timestamp
435tstamp now (); 705tstamp now ();
436 706
437int similar_direction (int a, int b); 707int similar_direction (int a, int b);
438 708
439// like printf, but returns a std::string 709// like v?sprintf, but returns a "static" buffer
440const std::string format (const char *format, ...); 710char *vformat (const char *format, va_list ap);
711char *format (const char *format, ...) attribute ((format (printf, 1, 2)));
441 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
442#endif 748#endif
443 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