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.45 by root, Sat May 26 15:44:05 2007 UTC vs.
Revision 1.56 by root, Sun Sep 9 06:25:46 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 *
6 * Crossfire TRT 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 <crossfire@schmorp.de>
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
… …
11# define is_constant(c) 0 32# define is_constant(c) 0
12# define expect(expr,value) (expr) 33# define expect(expr,value) (expr)
13# define prefetch(addr,rw,locality) 34# define prefetch(addr,rw,locality)
14#endif 35#endif
15 36
37#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
38# define decltype(x) typeof(x)
39#endif
40
16// put into ifs if you are very sure that the expression 41// put into ifs if you are very sure that the expression
17// is mostly true or mosty false. note that these return 42// is mostly true or mosty false. note that these return
18// booleans, not the expression. 43// booleans, not the expression.
19#define expect_false(expr) expect ((expr) != 0, 0) 44#define expect_false(expr) expect ((expr) != 0, 0)
20#define expect_true(expr) expect ((expr) != 0, 1) 45#define expect_true(expr) expect ((expr) != 0, 1)
… …
27#include <glib.h> 52#include <glib.h>
28 53
29#include <shstr.h> 54#include <shstr.h>
30#include <traits.h> 55#include <traits.h>
31 56
32// 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)
33#define auto(var,expr) typeof(expr) var = (expr) 58#define auto(var,expr) decltype(expr) var = (expr)
34 59
35// very ugly macro that basicaly declares and initialises a variable 60// very ugly macro that basicaly declares and initialises a variable
36// that is in scope for the next statement only 61// that is in scope for the next statement only
37// 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
38// (note: works great for pointers) 63// (note: works great for pointers)
39// most ugly macro I ever wrote 64// most ugly macro I ever wrote
40#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)
41 66
42// in range including end 67// in range including end
43#define IN_RANGE_INC(val,beg,end) \ 68#define IN_RANGE_INC(val,beg,end) \
44 ((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))
45 70
… …
308 333
309typedef tausworthe_random_generator rand_gen; 334typedef tausworthe_random_generator rand_gen;
310 335
311extern rand_gen rndm; 336extern rand_gen rndm;
312 337
338INTERFACE_CLASS (attachable)
339struct refcnt_base
340{
341 typedef int refcnt_t;
342 mutable refcnt_t ACC (RW, refcnt);
343
344 MTH void refcnt_inc () const { ++refcnt; }
345 MTH void refcnt_dec () const { --refcnt; }
346
347 refcnt_base () : refcnt (0) { }
348};
349
350// to avoid branches with more advanced compilers
351extern refcnt_base::refcnt_t refcnt_dummy;
352
313template<class T> 353template<class T>
314struct refptr 354struct refptr
315{ 355{
356 // p if not null
357 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
358
359 void refcnt_dec ()
360 {
361 if (!is_constant (p))
362 --*refcnt_ref ();
363 else if (p)
364 --p->refcnt;
365 }
366
367 void refcnt_inc ()
368 {
369 if (!is_constant (p))
370 ++*refcnt_ref ();
371 else if (p)
372 ++p->refcnt;
373 }
374
316 T *p; 375 T *p;
317 376
318 refptr () : p(0) { } 377 refptr () : p(0) { }
319 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 378 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
320 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 379 refptr (T *p) : p(p) { refcnt_inc (); }
321 ~refptr () { if (p) p->refcnt_dec (); } 380 ~refptr () { refcnt_dec (); }
322 381
323 const refptr<T> &operator =(T *o) 382 const refptr<T> &operator =(T *o)
324 { 383 {
384 // if decrementing ever destroys we need to reverse the order here
325 if (p) p->refcnt_dec (); 385 refcnt_dec ();
326 p = o; 386 p = o;
327 if (p) p->refcnt_inc (); 387 refcnt_inc ();
328
329 return *this; 388 return *this;
330 } 389 }
331 390
332 const refptr<T> &operator =(const refptr<T> o) 391 const refptr<T> &operator =(const refptr<T> &o)
333 { 392 {
334 *this = o.p; 393 *this = o.p;
335 return *this; 394 return *this;
336 } 395 }
337 396
338 T &operator * () const { return *p; } 397 T &operator * () const { return *p; }
339 T *operator ->() const { return p; } 398 T *operator ->() const { return p; }
340 399
341 operator T *() const { return p; } 400 operator T *() const { return p; }
342}; 401};
343 402
344typedef refptr<maptile> maptile_ptr; 403typedef refptr<maptile> maptile_ptr;
… …
379 { 438 {
380 return !strcmp (a, b); 439 return !strcmp (a, b);
381 } 440 }
382}; 441};
383 442
443// Mostly the same as std::vector, but insert/erase can reorder
444// the elements, making append(=insert)/remove O(1) instead of O(n).
445//
446// NOTE: only some forms of erase are available
384template<class T> 447template<class T>
385struct unordered_vector : std::vector<T, slice_allocator<T> > 448struct unordered_vector : std::vector<T, slice_allocator<T> >
386{ 449{
387 typedef typename unordered_vector::iterator iterator; 450 typedef typename unordered_vector::iterator iterator;
388 451
… …
398 { 461 {
399 erase ((unsigned int )(i - this->begin ())); 462 erase ((unsigned int )(i - this->begin ()));
400 } 463 }
401}; 464};
402 465
403template<class T, int T::* index> 466// This container blends advantages of linked lists
467// (efficiency) with vectors (random access) by
468// by using an unordered vector and storing the vector
469// index inside the object.
470//
471// + memory-efficient on most 64 bit archs
472// + O(1) insert/remove
473// + free unique (but varying) id for inserted objects
474// + cache-friendly iteration
475// - only works for pointers to structs
476//
477// NOTE: only some forms of erase/insert are available
478typedef int object_vector_index;
479
480template<class T, object_vector_index T::*indexmember>
404struct object_vector : std::vector<T *, slice_allocator<T *> > 481struct object_vector : std::vector<T *, slice_allocator<T *> >
405{ 482{
483 typedef typename object_vector::iterator iterator;
484
485 bool contains (const T *obj) const
486 {
487 return obj->*indexmember;
488 }
489
490 iterator find (const T *obj)
491 {
492 return obj->*indexmember
493 ? this->begin () + obj->*indexmember - 1
494 : this->end ();
495 }
496
497 void push_back (T *obj)
498 {
499 std::vector<T *, slice_allocator<T *> >::push_back (obj);
500 obj->*indexmember = this->size ();
501 }
502
406 void insert (T *obj) 503 void insert (T *obj)
407 { 504 {
408 assert (!(obj->*index));
409 push_back (obj); 505 push_back (obj);
410 obj->*index = this->size ();
411 } 506 }
412 507
413 void insert (T &obj) 508 void insert (T &obj)
414 { 509 {
415 insert (&obj); 510 insert (&obj);
416 } 511 }
417 512
418 void erase (T *obj) 513 void erase (T *obj)
419 { 514 {
420 assert (obj->*index);
421 unsigned int pos = obj->*index; 515 unsigned int pos = obj->*indexmember;
422 obj->*index = 0; 516 obj->*indexmember = 0;
423 517
424 if (pos < this->size ()) 518 if (pos < this->size ())
425 { 519 {
426 (*this)[pos - 1] = (*this)[this->size () - 1]; 520 (*this)[pos - 1] = (*this)[this->size () - 1];
427 (*this)[pos - 1]->*index = pos; 521 (*this)[pos - 1]->*indexmember = pos;
428 } 522 }
429 523
430 this->pop_back (); 524 this->pop_back ();
431 } 525 }
432 526
433 void erase (T &obj) 527 void erase (T &obj)
434 { 528 {
435 errase (&obj); 529 erase (&obj);
436 } 530 }
437}; 531};
438 532
439// basically does what strncpy should do, but appends "..." to strings exceeding length 533// basically does what strncpy should do, but appends "..." to strings exceeding length
440void assign (char *dst, const char *src, int maxlen); 534void assign (char *dst, const char *src, int maxlen);
… …
451// return current time as timestampe 545// return current time as timestampe
452tstamp now (); 546tstamp now ();
453 547
454int similar_direction (int a, int b); 548int similar_direction (int a, int b);
455 549
456// like printf, but returns a std::string 550// like sprintf, but returns a "static" buffer
457const std::string format (const char *format, ...); 551const char *format (const char *format, ...);
458 552
459#endif 553#endif
460 554

Diff Legend

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