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.49 by root, Mon Jun 4 13:04:00 2007 UTC vs.
Revision 1.66 by root, Wed Apr 2 11:13:55 2008 UTC

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
25#define DEBUG_SALLOC 0
26//#define PREFER_MALLOC 26#define PREFER_MALLOC 0
27 27
28#if __GNUC__ >= 3 28#if __GNUC__ >= 3
29# define is_constant(c) __builtin_constant_p (c) 29# define is_constant(c) __builtin_constant_p (c)
30# define expect(expr,value) __builtin_expect ((expr),(value)) 30# define expect(expr,value) __builtin_expect ((expr),(value))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
… …
43// is mostly true or mosty false. note that these return 43// is mostly true or mosty false. note that these return
44// booleans, not the expression. 44// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0) 45#define expect_false(expr) expect ((expr) != 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1) 46#define expect_true(expr) expect ((expr) != 0, 1)
47 47
48#include <pthread.h>
49
48#include <cstddef> 50#include <cstddef>
49#include <cmath> 51#include <cmath>
50#include <new> 52#include <new>
51#include <vector> 53#include <vector>
52 54
53#include <glib.h> 55#include <glib.h>
54 56
55#include <shstr.h> 57#include <shstr.h>
56#include <traits.h> 58#include <traits.h>
59
60#if DEBUG_SALLOC
61# define g_slice_alloc0(s) debug_slice_alloc0(s)
62# define g_slice_alloc(s) debug_slice_alloc(s)
63# define g_slice_free1(s,p) debug_slice_free1(s,p)
64void *g_slice_alloc (unsigned long size);
65void *g_slice_alloc0 (unsigned long size);
66void g_slice_free1 (unsigned long size, void *ptr);
67#endif
57 68
58// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) 69// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
59#define auto(var,expr) decltype(expr) var = (expr) 70#define auto(var,expr) decltype(expr) var = (expr)
60 71
61// very ugly macro that basicaly declares and initialises a variable 72// very ugly macro that basicaly declares and initialises a variable
… …
71 82
72// in range excluding end 83// in range excluding end
73#define IN_RANGE_EXC(val,beg,end) \ 84#define IN_RANGE_EXC(val,beg,end) \
74 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 85 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
75 86
87void cleanup (const char *cause, bool make_core = false);
76void fork_abort (const char *msg); 88void fork_abort (const char *msg);
77 89
78// rationale for using (U) not (T) is to reduce signed/unsigned issues, 90// 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. 91// as a is often a constant while b is the variable. it is still a bug, though.
80template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 92template<typename T, typename U> static inline T min (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; } 93template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
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; } 94template<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 95
84template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 96template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
97
98template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
99template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
85 100
86template<typename T> 101template<typename T>
87static inline T 102static inline T
88lerp (T val, T min_in, T max_in, T min_out, T max_out) 103lerp (T val, T min_in, T max_in, T min_out, T max_out)
89{ 104{
… …
173absdir (int d) 188absdir (int d)
174{ 189{
175 return ((d - 1) & 7) + 1; 190 return ((d - 1) & 7) + 1;
176} 191}
177 192
193extern size_t slice_alloc; // statistics
194
178// makes dynamically allocated objects zero-initialised 195// makes dynamically allocated objects zero-initialised
179struct zero_initialised 196struct zero_initialised
180{ 197{
181 void *operator new (size_t s, void *p) 198 void *operator new (size_t s, void *p)
182 { 199 {
… …
184 return p; 201 return p;
185 } 202 }
186 203
187 void *operator new (size_t s) 204 void *operator new (size_t s)
188 { 205 {
206 slice_alloc += s;
189 return g_slice_alloc0 (s); 207 return g_slice_alloc0 (s);
190 } 208 }
191 209
192 void *operator new[] (size_t s) 210 void *operator new[] (size_t s)
193 { 211 {
212 slice_alloc += s;
194 return g_slice_alloc0 (s); 213 return g_slice_alloc0 (s);
195 } 214 }
196 215
197 void operator delete (void *p, size_t s) 216 void operator delete (void *p, size_t s)
198 { 217 {
218 slice_alloc -= s;
199 g_slice_free1 (s, p); 219 g_slice_free1 (s, p);
200 } 220 }
201 221
202 void operator delete[] (void *p, size_t s) 222 void operator delete[] (void *p, size_t s)
203 { 223 {
224 slice_alloc -= s;
204 g_slice_free1 (s, p); 225 g_slice_free1 (s, p);
205 } 226 }
206}; 227};
207 228
208void *salloc_ (int n) throw (std::bad_alloc); 229void *salloc_ (int n) throw (std::bad_alloc);
… …
223 244
224// for symmetry 245// for symmetry
225template<typename T> 246template<typename T>
226inline void sfree (T *ptr, int n = 1) throw () 247inline void sfree (T *ptr, int n = 1) throw ()
227{ 248{
228#ifdef PREFER_MALLOC 249#if PREFER_MALLOC
229 free (ptr); 250 free (ptr);
230#else 251#else
252 slice_alloc -= n * sizeof (T);
231 g_slice_free1 (n * sizeof (T), (void *)ptr); 253 g_slice_free1 (n * sizeof (T), (void *)ptr);
232#endif 254#endif
233} 255}
234 256
235// a STL-compatible allocator that uses g_slice 257// a STL-compatible allocator that uses g_slice
… …
250 { 272 {
251 typedef slice_allocator<U> other; 273 typedef slice_allocator<U> other;
252 }; 274 };
253 275
254 slice_allocator () throw () { } 276 slice_allocator () throw () { }
255 slice_allocator (const slice_allocator &o) throw () { } 277 slice_allocator (const slice_allocator &) throw () { }
256 template<typename Tp2> 278 template<typename Tp2>
257 slice_allocator (const slice_allocator<Tp2> &) throw () { } 279 slice_allocator (const slice_allocator<Tp2> &) throw () { }
258 280
259 ~slice_allocator () { } 281 ~slice_allocator () { }
260 282
… …
269 void deallocate (pointer p, size_type n) 291 void deallocate (pointer p, size_type n)
270 { 292 {
271 sfree<Tp> (p, n); 293 sfree<Tp> (p, n);
272 } 294 }
273 295
274 size_type max_size ()const throw () 296 size_type max_size () const throw ()
275 { 297 {
276 return size_t (-1) / sizeof (Tp); 298 return size_t (-1) / sizeof (Tp);
277 } 299 }
278 300
279 void construct (pointer p, const Tp &val) 301 void construct (pointer p, const Tp &val)
… …
334 356
335typedef tausworthe_random_generator rand_gen; 357typedef tausworthe_random_generator rand_gen;
336 358
337extern rand_gen rndm; 359extern rand_gen rndm;
338 360
361INTERFACE_CLASS (attachable)
362struct refcnt_base
363{
364 typedef int refcnt_t;
365 mutable refcnt_t ACC (RW, refcnt);
366
367 MTH void refcnt_inc () const { ++refcnt; }
368 MTH void refcnt_dec () const { --refcnt; }
369
370 refcnt_base () : refcnt (0) { }
371};
372
373// to avoid branches with more advanced compilers
374extern refcnt_base::refcnt_t refcnt_dummy;
375
339template<class T> 376template<class T>
340struct refptr 377struct refptr
341{ 378{
379 // p if not null
380 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
381
382 void refcnt_dec ()
383 {
384 if (!is_constant (p))
385 --*refcnt_ref ();
386 else if (p)
387 --p->refcnt;
388 }
389
390 void refcnt_inc ()
391 {
392 if (!is_constant (p))
393 ++*refcnt_ref ();
394 else if (p)
395 ++p->refcnt;
396 }
397
342 T *p; 398 T *p;
343 399
344 refptr () : p(0) { } 400 refptr () : p(0) { }
345 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 401 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
346 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 402 refptr (T *p) : p(p) { refcnt_inc (); }
347 ~refptr () { if (p) p->refcnt_dec (); } 403 ~refptr () { refcnt_dec (); }
348 404
349 const refptr<T> &operator =(T *o) 405 const refptr<T> &operator =(T *o)
350 { 406 {
407 // if decrementing ever destroys we need to reverse the order here
351 if (p) p->refcnt_dec (); 408 refcnt_dec ();
352 p = o; 409 p = o;
353 if (p) p->refcnt_inc (); 410 refcnt_inc ();
354
355 return *this; 411 return *this;
356 } 412 }
357 413
358 const refptr<T> &operator =(const refptr<T> o) 414 const refptr<T> &operator =(const refptr<T> &o)
359 { 415 {
360 *this = o.p; 416 *this = o.p;
361 return *this; 417 return *this;
362 } 418 }
363 419
364 T &operator * () const { return *p; } 420 T &operator * () const { return *p; }
365 T *operator ->() const { return p; } 421 T *operator ->() const { return p; }
366 422
367 operator T *() const { return p; } 423 operator T *() const { return p; }
368}; 424};
369 425
370typedef refptr<maptile> maptile_ptr; 426typedef refptr<maptile> maptile_ptr;
… …
406 return !strcmp (a, b); 462 return !strcmp (a, b);
407 } 463 }
408}; 464};
409 465
410// Mostly the same as std::vector, but insert/erase can reorder 466// Mostly the same as std::vector, but insert/erase can reorder
411// the elements, making insret/remove O(1) instead of O(n). 467// the elements, making append(=insert)/remove O(1) instead of O(n).
412// 468//
413// NOTE: only some forms of erase/insert are available 469// NOTE: only some forms of erase are available
414template<class T> 470template<class T>
415struct unordered_vector : std::vector<T, slice_allocator<T> > 471struct unordered_vector : std::vector<T, slice_allocator<T> >
416{ 472{
417 typedef typename unordered_vector::iterator iterator; 473 typedef typename unordered_vector::iterator iterator;
418 474
… …
440// + free unique (but varying) id for inserted objects 496// + free unique (but varying) id for inserted objects
441// + cache-friendly iteration 497// + cache-friendly iteration
442// - only works for pointers to structs 498// - only works for pointers to structs
443// 499//
444// NOTE: only some forms of erase/insert are available 500// NOTE: only some forms of erase/insert are available
445template<class T, int T::* index> 501typedef int object_vector_index;
502
503template<class T, object_vector_index T::*indexmember>
446struct object_vector : std::vector<T *, slice_allocator<T *> > 504struct object_vector : std::vector<T *, slice_allocator<T *> >
447{ 505{
448 typedef typename object_vector::iterator iterator; 506 typedef typename object_vector::iterator iterator;
449 507
450 bool contains (const T *obj) const 508 bool contains (const T *obj) const
451 { 509 {
452 return obj->*index; 510 return obj->*indexmember;
453 } 511 }
454 512
455 iterator find (const T *obj) 513 iterator find (const T *obj)
456 { 514 {
457 return obj->*index 515 return obj->*indexmember
458 ? this->begin () + obj->*index - 1 516 ? this->begin () + obj->*indexmember - 1
459 : this->end (); 517 : this->end ();
460 } 518 }
461 519
520 void push_back (T *obj)
521 {
522 std::vector<T *, slice_allocator<T *> >::push_back (obj);
523 obj->*indexmember = this->size ();
524 }
525
462 void insert (T *obj) 526 void insert (T *obj)
463 { 527 {
464 push_back (obj); 528 push_back (obj);
465 obj->*index = this->size ();
466 } 529 }
467 530
468 void insert (T &obj) 531 void insert (T &obj)
469 { 532 {
470 insert (&obj); 533 insert (&obj);
471 } 534 }
472 535
473 void erase (T *obj) 536 void erase (T *obj)
474 { 537 {
475 unsigned int pos = obj->*index; 538 unsigned int pos = obj->*indexmember;
476 obj->*index = 0; 539 obj->*indexmember = 0;
477 540
478 if (pos < this->size ()) 541 if (pos < this->size ())
479 { 542 {
480 (*this)[pos - 1] = (*this)[this->size () - 1]; 543 (*this)[pos - 1] = (*this)[this->size () - 1];
481 (*this)[pos - 1]->*index = pos; 544 (*this)[pos - 1]->*indexmember = pos;
482 } 545 }
483 546
484 this->pop_back (); 547 this->pop_back ();
485 } 548 }
486 549
487 void erase (T &obj) 550 void erase (T &obj)
488 { 551 {
489 errase (&obj); 552 erase (&obj);
490 } 553 }
491}; 554};
492 555
493// basically does what strncpy should do, but appends "..." to strings exceeding length 556// basically does what strncpy should do, but appends "..." to strings exceeding length
494void assign (char *dst, const char *src, int maxlen); 557void assign (char *dst, const char *src, int maxlen);
… …
500 assign ((char *)&dst, src, N); 563 assign ((char *)&dst, src, N);
501} 564}
502 565
503typedef double tstamp; 566typedef double tstamp;
504 567
505// return current time as timestampe 568// return current time as timestamp
506tstamp now (); 569tstamp now ();
507 570
508int similar_direction (int a, int b); 571int similar_direction (int a, int b);
509 572
510// like printf, but returns a std::string 573// like sprintf, but returns a "static" buffer
511const std::string format (const char *format, ...); 574const char *format (const char *format, ...);
512 575
513#endif 576/////////////////////////////////////////////////////////////////////////////
577// threads, very very thin wrappers around pthreads
514 578
579struct thread
580{
581 pthread_t id;
582
583 void start (void *(*start_routine)(void *), void *arg = 0);
584
585 void cancel ()
586 {
587 pthread_cancel (id);
588 }
589
590 void *join ()
591 {
592 void *ret;
593
594 if (pthread_join (id, &ret))
595 cleanup ("pthread_join failed", 1);
596
597 return ret;
598 }
599};
600
601// note that mutexes are not classes
602typedef pthread_mutex_t smutex;
603
604#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP)
605 #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP
606#else
607 #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER
608#endif
609
610#define SMUTEX(name) smutex name = SMUTEX_INITIALISER
611#define SMUTEX_LOCK(name) pthread_mutex_lock (&(name))
612#define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name))
613
614#endif
615

Diff Legend

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