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.50 by root, Sun Jun 24 00:33:54 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
7 * under the terms of the GNU General Public License as published by the Free
8 * Software Foundation; either version 2 of the License, or (at your option)
9 * any later version.
10 *
11 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * for more details.
15 *
16 * You should have received a copy of the GNU General Public License along
17 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
18 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 *
20 * The authors can be reached via e-mail to <crossfire@schmorp.de>
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//#define PREFER_MALLOC
5 27
6#if __GNUC__ >= 3 28#if __GNUC__ >= 3
7# 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))
31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
8#else 32#else
9# define is_constant(c) 0 33# define is_constant(c) 0
34# define expect(expr,value) (expr)
35# define prefetch(addr,rw,locality)
10#endif 36#endif
37
38#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
39# define decltype(x) typeof(x)
40#endif
41
42// put into ifs if you are very sure that the expression
43// is mostly true or mosty false. note that these return
44// booleans, not the expression.
45#define expect_false(expr) expect ((expr) != 0, 0)
46#define expect_true(expr) expect ((expr) != 0, 1)
11 47
12#include <cstddef> 48#include <cstddef>
13#include <cmath> 49#include <cmath>
14#include <new> 50#include <new>
15#include <vector> 51#include <vector>
… …
17#include <glib.h> 53#include <glib.h>
18 54
19#include <shstr.h> 55#include <shstr.h>
20#include <traits.h> 56#include <traits.h>
21 57
22// use a gcc extension for auto declarations until ISO C++ sanctifies them 58// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
23#define auto(var,expr) typeof(expr) var = (expr) 59#define auto(var,expr) decltype(expr) var = (expr)
24 60
25// very ugly macro that basicaly declares and initialises a variable 61// very ugly macro that basicaly declares and initialises a variable
26// that is in scope for the next statement only 62// that is in scope for the next statement only
27// works only for stuff that can be assigned 0 and converts to false 63// works only for stuff that can be assigned 0 and converts to false
28// (note: works great for pointers) 64// (note: works great for pointers)
29// most ugly macro I ever wrote 65// most ugly macro I ever wrote
30#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) 66#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
31 67
32// in range including end 68// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 69#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 70 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 71
… …
369 { 405 {
370 return !strcmp (a, b); 406 return !strcmp (a, b);
371 } 407 }
372}; 408};
373 409
410// Mostly the same as std::vector, but insert/erase can reorder
411// the elements, making insret/remove O(1) instead of O(n).
412//
413// NOTE: only some forms of erase/insert are available
374template<class T> 414template<class T>
375struct unordered_vector : std::vector<T, slice_allocator<T> > 415struct unordered_vector : std::vector<T, slice_allocator<T> >
376{ 416{
377 typedef typename unordered_vector::iterator iterator; 417 typedef typename unordered_vector::iterator iterator;
378 418
… …
388 { 428 {
389 erase ((unsigned int )(i - this->begin ())); 429 erase ((unsigned int )(i - this->begin ()));
390 } 430 }
391}; 431};
392 432
393template<class T, int T::* index> 433// This container blends advantages of linked lists
434// (efficiency) with vectors (random access) by
435// by using an unordered vector and storing the vector
436// index inside the object.
437//
438// + memory-efficient on most 64 bit archs
439// + O(1) insert/remove
440// + free unique (but varying) id for inserted objects
441// + cache-friendly iteration
442// - only works for pointers to structs
443//
444// NOTE: only some forms of erase/insert are available
445typedef int object_vector_index;
446
447template<class T, object_vector_index T::*indexmember>
394struct object_vector : std::vector<T *, slice_allocator<T *> > 448struct object_vector : std::vector<T *, slice_allocator<T *> >
395{ 449{
450 typedef typename object_vector::iterator iterator;
451
452 bool contains (const T *obj) const
453 {
454 return obj->*indexmember;
455 }
456
457 iterator find (const T *obj)
458 {
459 return obj->*indexmember
460 ? this->begin () + obj->*indexmember - 1
461 : this->end ();
462 }
463
396 void insert (T *obj) 464 void insert (T *obj)
397 { 465 {
398 assert (!(obj->*index));
399 push_back (obj); 466 push_back (obj);
400 obj->*index = this->size (); 467 obj->*indexmember = this->size ();
401 } 468 }
402 469
403 void insert (T &obj) 470 void insert (T &obj)
404 { 471 {
405 insert (&obj); 472 insert (&obj);
406 } 473 }
407 474
408 void erase (T *obj) 475 void erase (T *obj)
409 { 476 {
410 assert (obj->*index);
411 unsigned int pos = obj->*index; 477 unsigned int pos = obj->*indexmember;
412 obj->*index = 0; 478 obj->*indexmember = 0;
413 479
414 if (pos < this->size ()) 480 if (pos < this->size ())
415 { 481 {
416 (*this)[pos - 1] = (*this)[this->size () - 1]; 482 (*this)[pos - 1] = (*this)[this->size () - 1];
417 (*this)[pos - 1]->*index = pos; 483 (*this)[pos - 1]->*indexmember = pos;
418 } 484 }
419 485
420 this->pop_back (); 486 this->pop_back ();
421 } 487 }
422 488
423 void erase (T &obj) 489 void erase (T &obj)
424 { 490 {
425 errase (&obj); 491 erase (&obj);
426 } 492 }
427}; 493};
428 494
429// basically does what strncpy should do, but appends "..." to strings exceeding length 495// basically does what strncpy should do, but appends "..." to strings exceeding length
430void assign (char *dst, const char *src, int maxlen); 496void assign (char *dst, const char *src, int maxlen);

Diff Legend

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