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.46 by root, Mon May 28 21:15:56 2007 UTC vs.
Revision 1.56 by root, Sun Sep 9 06:25:46 2007 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
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 Crossfire TRT team
5 * 5 *
6 * Crossfire TRT is free software; you can redistribute it and/or modify it 6 * Crossfire TRT 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 <crossfire@schmorp.de>
21 */ 20 */
22 21
23#ifndef UTIL_H__ 22#ifndef UTIL_H__
… …
33# define is_constant(c) 0 32# define is_constant(c) 0
34# define expect(expr,value) (expr) 33# define expect(expr,value) (expr)
35# define prefetch(addr,rw,locality) 34# define prefetch(addr,rw,locality)
36#endif 35#endif
37 36
37#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
38# define decltype(x) typeof(x)
39#endif
40
38// put into ifs if you are very sure that the expression 41// put into ifs if you are very sure that the expression
39// is mostly true or mosty false. note that these return 42// is mostly true or mosty false. note that these return
40// booleans, not the expression. 43// booleans, not the expression.
41#define expect_false(expr) expect ((expr) != 0, 0) 44#define expect_false(expr) expect ((expr) != 0, 0)
42#define expect_true(expr) expect ((expr) != 0, 1) 45#define expect_true(expr) expect ((expr) != 0, 1)
… …
49#include <glib.h> 52#include <glib.h>
50 53
51#include <shstr.h> 54#include <shstr.h>
52#include <traits.h> 55#include <traits.h>
53 56
54// 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)
55#define auto(var,expr) typeof(expr) var = (expr) 58#define auto(var,expr) decltype(expr) var = (expr)
56 59
57// very ugly macro that basicaly declares and initialises a variable 60// very ugly macro that basicaly declares and initialises a variable
58// that is in scope for the next statement only 61// that is in scope for the next statement only
59// 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
60// (note: works great for pointers) 63// (note: works great for pointers)
61// most ugly macro I ever wrote 64// most ugly macro I ever wrote
62#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)
63 66
64// in range including end 67// in range including end
65#define IN_RANGE_INC(val,beg,end) \ 68#define IN_RANGE_INC(val,beg,end) \
66 ((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))
67 70
… …
330 333
331typedef tausworthe_random_generator rand_gen; 334typedef tausworthe_random_generator rand_gen;
332 335
333extern rand_gen rndm; 336extern rand_gen rndm;
334 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
335template<class T> 353template<class T>
336struct refptr 354struct refptr
337{ 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
338 T *p; 375 T *p;
339 376
340 refptr () : p(0) { } 377 refptr () : p(0) { }
341 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 378 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
342 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 379 refptr (T *p) : p(p) { refcnt_inc (); }
343 ~refptr () { if (p) p->refcnt_dec (); } 380 ~refptr () { refcnt_dec (); }
344 381
345 const refptr<T> &operator =(T *o) 382 const refptr<T> &operator =(T *o)
346 { 383 {
384 // if decrementing ever destroys we need to reverse the order here
347 if (p) p->refcnt_dec (); 385 refcnt_dec ();
348 p = o; 386 p = o;
349 if (p) p->refcnt_inc (); 387 refcnt_inc ();
350
351 return *this; 388 return *this;
352 } 389 }
353 390
354 const refptr<T> &operator =(const refptr<T> o) 391 const refptr<T> &operator =(const refptr<T> &o)
355 { 392 {
356 *this = o.p; 393 *this = o.p;
357 return *this; 394 return *this;
358 } 395 }
359 396
360 T &operator * () const { return *p; } 397 T &operator * () const { return *p; }
361 T *operator ->() const { return p; } 398 T *operator ->() const { return p; }
362 399
363 operator T *() const { return p; } 400 operator T *() const { return p; }
364}; 401};
365 402
366typedef refptr<maptile> maptile_ptr; 403typedef refptr<maptile> maptile_ptr;
… …
401 { 438 {
402 return !strcmp (a, b); 439 return !strcmp (a, b);
403 } 440 }
404}; 441};
405 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
406template<class T> 447template<class T>
407struct unordered_vector : std::vector<T, slice_allocator<T> > 448struct unordered_vector : std::vector<T, slice_allocator<T> >
408{ 449{
409 typedef typename unordered_vector::iterator iterator; 450 typedef typename unordered_vector::iterator iterator;
410 451
… …
420 { 461 {
421 erase ((unsigned int )(i - this->begin ())); 462 erase ((unsigned int )(i - this->begin ()));
422 } 463 }
423}; 464};
424 465
425template<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>
426struct object_vector : std::vector<T *, slice_allocator<T *> > 481struct object_vector : std::vector<T *, slice_allocator<T *> >
427{ 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
428 void insert (T *obj) 503 void insert (T *obj)
429 { 504 {
430 assert (!(obj->*index));
431 push_back (obj); 505 push_back (obj);
432 obj->*index = this->size ();
433 } 506 }
434 507
435 void insert (T &obj) 508 void insert (T &obj)
436 { 509 {
437 insert (&obj); 510 insert (&obj);
438 } 511 }
439 512
440 void erase (T *obj) 513 void erase (T *obj)
441 { 514 {
442 assert (obj->*index);
443 unsigned int pos = obj->*index; 515 unsigned int pos = obj->*indexmember;
444 obj->*index = 0; 516 obj->*indexmember = 0;
445 517
446 if (pos < this->size ()) 518 if (pos < this->size ())
447 { 519 {
448 (*this)[pos - 1] = (*this)[this->size () - 1]; 520 (*this)[pos - 1] = (*this)[this->size () - 1];
449 (*this)[pos - 1]->*index = pos; 521 (*this)[pos - 1]->*indexmember = pos;
450 } 522 }
451 523
452 this->pop_back (); 524 this->pop_back ();
453 } 525 }
454 526
455 void erase (T &obj) 527 void erase (T &obj)
456 { 528 {
457 errase (&obj); 529 erase (&obj);
458 } 530 }
459}; 531};
460 532
461// 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
462void assign (char *dst, const char *src, int maxlen); 534void assign (char *dst, const char *src, int maxlen);
… …
473// return current time as timestampe 545// return current time as timestampe
474tstamp now (); 546tstamp now ();
475 547
476int similar_direction (int a, int b); 548int similar_direction (int a, int b);
477 549
478// like printf, but returns a std::string 550// like sprintf, but returns a "static" buffer
479const std::string format (const char *format, ...); 551const char *format (const char *format, ...);
480 552
481#endif 553#endif
482 554

Diff Legend

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