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.58 by root, Thu Nov 8 19:43:25 2007 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007 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 PREFER_MALLOC
5 26
6#if __GNUC__ >= 3 27#if __GNUC__ >= 3
7# define is_constant(c) __builtin_constant_p (c) 28# define is_constant(c) __builtin_constant_p (c)
29# define expect(expr,value) __builtin_expect ((expr),(value))
30# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
8#else 31#else
9# define is_constant(c) 0 32# define is_constant(c) 0
33# define expect(expr,value) (expr)
34# define prefetch(addr,rw,locality)
10#endif 35#endif
36
37#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
38# define decltype(x) typeof(x)
39#endif
40
41// put into ifs if you are very sure that the expression
42// is mostly true or mosty false. note that these return
43// booleans, not the expression.
44#define expect_false(expr) expect ((expr) != 0, 0)
45#define expect_true(expr) expect ((expr) != 0, 1)
11 46
12#include <cstddef> 47#include <cstddef>
13#include <cmath> 48#include <cmath>
14#include <new> 49#include <new>
15#include <vector> 50#include <vector>
… …
17#include <glib.h> 52#include <glib.h>
18 53
19#include <shstr.h> 54#include <shstr.h>
20#include <traits.h> 55#include <traits.h>
21 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 basicaly 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
… …
137absdir (int d) 172absdir (int d)
138{ 173{
139 return ((d - 1) & 7) + 1; 174 return ((d - 1) & 7) + 1;
140} 175}
141 176
177extern size_t slice_alloc; // statistics
178
142// makes dynamically allocated objects zero-initialised 179// makes dynamically allocated objects zero-initialised
143struct zero_initialised 180struct zero_initialised
144{ 181{
145 void *operator new (size_t s, void *p) 182 void *operator new (size_t s, void *p)
146 { 183 {
… …
148 return p; 185 return p;
149 } 186 }
150 187
151 void *operator new (size_t s) 188 void *operator new (size_t s)
152 { 189 {
190 slice_alloc += s;
153 return g_slice_alloc0 (s); 191 return g_slice_alloc0 (s);
154 } 192 }
155 193
156 void *operator new[] (size_t s) 194 void *operator new[] (size_t s)
157 { 195 {
196 slice_alloc += s;
158 return g_slice_alloc0 (s); 197 return g_slice_alloc0 (s);
159 } 198 }
160 199
161 void operator delete (void *p, size_t s) 200 void operator delete (void *p, size_t s)
162 { 201 {
202 slice_alloc -= s;
163 g_slice_free1 (s, p); 203 g_slice_free1 (s, p);
164 } 204 }
165 205
166 void operator delete[] (void *p, size_t s) 206 void operator delete[] (void *p, size_t s)
167 { 207 {
208 slice_alloc -= s;
168 g_slice_free1 (s, p); 209 g_slice_free1 (s, p);
169 } 210 }
170}; 211};
171 212
172void *salloc_ (int n) throw (std::bad_alloc); 213void *salloc_ (int n) throw (std::bad_alloc);
… …
190inline void sfree (T *ptr, int n = 1) throw () 231inline void sfree (T *ptr, int n = 1) throw ()
191{ 232{
192#ifdef PREFER_MALLOC 233#ifdef PREFER_MALLOC
193 free (ptr); 234 free (ptr);
194#else 235#else
236 slice_alloc -= n * sizeof (T);
195 g_slice_free1 (n * sizeof (T), (void *)ptr); 237 g_slice_free1 (n * sizeof (T), (void *)ptr);
196#endif 238#endif
197} 239}
198 240
199// a STL-compatible allocator that uses g_slice 241// a STL-compatible allocator that uses g_slice
… …
298 340
299typedef tausworthe_random_generator rand_gen; 341typedef tausworthe_random_generator rand_gen;
300 342
301extern rand_gen rndm; 343extern rand_gen rndm;
302 344
345INTERFACE_CLASS (attachable)
346struct refcnt_base
347{
348 typedef int refcnt_t;
349 mutable refcnt_t ACC (RW, refcnt);
350
351 MTH void refcnt_inc () const { ++refcnt; }
352 MTH void refcnt_dec () const { --refcnt; }
353
354 refcnt_base () : refcnt (0) { }
355};
356
357// to avoid branches with more advanced compilers
358extern refcnt_base::refcnt_t refcnt_dummy;
359
303template<class T> 360template<class T>
304struct refptr 361struct refptr
305{ 362{
363 // p if not null
364 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
365
366 void refcnt_dec ()
367 {
368 if (!is_constant (p))
369 --*refcnt_ref ();
370 else if (p)
371 --p->refcnt;
372 }
373
374 void refcnt_inc ()
375 {
376 if (!is_constant (p))
377 ++*refcnt_ref ();
378 else if (p)
379 ++p->refcnt;
380 }
381
306 T *p; 382 T *p;
307 383
308 refptr () : p(0) { } 384 refptr () : p(0) { }
309 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 385 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
310 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 386 refptr (T *p) : p(p) { refcnt_inc (); }
311 ~refptr () { if (p) p->refcnt_dec (); } 387 ~refptr () { refcnt_dec (); }
312 388
313 const refptr<T> &operator =(T *o) 389 const refptr<T> &operator =(T *o)
314 { 390 {
391 // if decrementing ever destroys we need to reverse the order here
315 if (p) p->refcnt_dec (); 392 refcnt_dec ();
316 p = o; 393 p = o;
317 if (p) p->refcnt_inc (); 394 refcnt_inc ();
318
319 return *this; 395 return *this;
320 } 396 }
321 397
322 const refptr<T> &operator =(const refptr<T> o) 398 const refptr<T> &operator =(const refptr<T> &o)
323 { 399 {
324 *this = o.p; 400 *this = o.p;
325 return *this; 401 return *this;
326 } 402 }
327 403
328 T &operator * () const { return *p; } 404 T &operator * () const { return *p; }
329 T *operator ->() const { return p; } 405 T *operator ->() const { return p; }
330 406
331 operator T *() const { return p; } 407 operator T *() const { return p; }
332}; 408};
333 409
334typedef refptr<maptile> maptile_ptr; 410typedef refptr<maptile> maptile_ptr;
… …
369 { 445 {
370 return !strcmp (a, b); 446 return !strcmp (a, b);
371 } 447 }
372}; 448};
373 449
450// Mostly the same as std::vector, but insert/erase can reorder
451// the elements, making append(=insert)/remove O(1) instead of O(n).
452//
453// NOTE: only some forms of erase are available
374template<class T> 454template<class T>
375struct unordered_vector : std::vector<T, slice_allocator<T> > 455struct unordered_vector : std::vector<T, slice_allocator<T> >
376{ 456{
377 typedef typename unordered_vector::iterator iterator; 457 typedef typename unordered_vector::iterator iterator;
378 458
… …
388 { 468 {
389 erase ((unsigned int )(i - this->begin ())); 469 erase ((unsigned int )(i - this->begin ()));
390 } 470 }
391}; 471};
392 472
393template<class T, int T::* index> 473// This container blends advantages of linked lists
474// (efficiency) with vectors (random access) by
475// by using an unordered vector and storing the vector
476// index inside the object.
477//
478// + memory-efficient on most 64 bit archs
479// + O(1) insert/remove
480// + free unique (but varying) id for inserted objects
481// + cache-friendly iteration
482// - only works for pointers to structs
483//
484// NOTE: only some forms of erase/insert are available
485typedef int object_vector_index;
486
487template<class T, object_vector_index T::*indexmember>
394struct object_vector : std::vector<T *, slice_allocator<T *> > 488struct object_vector : std::vector<T *, slice_allocator<T *> >
395{ 489{
490 typedef typename object_vector::iterator iterator;
491
492 bool contains (const T *obj) const
493 {
494 return obj->*indexmember;
495 }
496
497 iterator find (const T *obj)
498 {
499 return obj->*indexmember
500 ? this->begin () + obj->*indexmember - 1
501 : this->end ();
502 }
503
504 void push_back (T *obj)
505 {
506 std::vector<T *, slice_allocator<T *> >::push_back (obj);
507 obj->*indexmember = this->size ();
508 }
509
396 void insert (T *obj) 510 void insert (T *obj)
397 { 511 {
398 assert (!(obj->*index));
399 push_back (obj); 512 push_back (obj);
400 obj->*index = this->size ();
401 } 513 }
402 514
403 void insert (T &obj) 515 void insert (T &obj)
404 { 516 {
405 insert (&obj); 517 insert (&obj);
406 } 518 }
407 519
408 void erase (T *obj) 520 void erase (T *obj)
409 { 521 {
410 assert (obj->*index);
411 unsigned int pos = obj->*index; 522 unsigned int pos = obj->*indexmember;
412 obj->*index = 0; 523 obj->*indexmember = 0;
413 524
414 if (pos < this->size ()) 525 if (pos < this->size ())
415 { 526 {
416 (*this)[pos - 1] = (*this)[this->size () - 1]; 527 (*this)[pos - 1] = (*this)[this->size () - 1];
417 (*this)[pos - 1]->*index = pos; 528 (*this)[pos - 1]->*indexmember = pos;
418 } 529 }
419 530
420 this->pop_back (); 531 this->pop_back ();
421 } 532 }
422 533
423 void erase (T &obj) 534 void erase (T &obj)
424 { 535 {
425 errase (&obj); 536 erase (&obj);
426 } 537 }
427}; 538};
428 539
429// basically does what strncpy should do, but appends "..." to strings exceeding length 540// basically does what strncpy should do, but appends "..." to strings exceeding length
430void assign (char *dst, const char *src, int maxlen); 541void assign (char *dst, const char *src, int maxlen);
… …
441// return current time as timestampe 552// return current time as timestampe
442tstamp now (); 553tstamp now ();
443 554
444int similar_direction (int a, int b); 555int similar_direction (int a, int b);
445 556
446// like printf, but returns a std::string 557// like sprintf, but returns a "static" buffer
447const std::string format (const char *format, ...); 558const char *format (const char *format, ...);
448 559
449#endif 560#endif
450 561

Diff Legend

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