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.43 by root, Mon Apr 23 18:09:57 2007 UTC vs.
Revision 1.53 by root, Fri Jul 13 15:54:40 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
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
… …
44template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 79template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 80template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
46template<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; } 81template<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; }
47 82
48template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 83template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
84
85template<typename T>
86static inline T
87lerp (T val, T min_in, T max_in, T min_out, T max_out)
88{
89 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
90}
49 91
50// lots of stuff taken from FXT 92// lots of stuff taken from FXT
51 93
52/* Rotate right. This is used in various places for checksumming */ 94/* Rotate right. This is used in various places for checksumming */
53//TODO: that sucks, use a better checksum algo 95//TODO: that sucks, use a better checksum algo
… …
362 { 404 {
363 return !strcmp (a, b); 405 return !strcmp (a, b);
364 } 406 }
365}; 407};
366 408
409// Mostly the same as std::vector, but insert/erase can reorder
410// the elements, making append(=insert)/remove O(1) instead of O(n).
411//
412// NOTE: only some forms of erase are available
367template<class T> 413template<class T>
368struct unordered_vector : std::vector<T, slice_allocator<T> > 414struct unordered_vector : std::vector<T, slice_allocator<T> >
369{ 415{
370 typedef typename unordered_vector::iterator iterator; 416 typedef typename unordered_vector::iterator iterator;
371 417
… …
381 { 427 {
382 erase ((unsigned int )(i - this->begin ())); 428 erase ((unsigned int )(i - this->begin ()));
383 } 429 }
384}; 430};
385 431
386template<class T, int T::* index> 432// This container blends advantages of linked lists
433// (efficiency) with vectors (random access) by
434// by using an unordered vector and storing the vector
435// index inside the object.
436//
437// + memory-efficient on most 64 bit archs
438// + O(1) insert/remove
439// + free unique (but varying) id for inserted objects
440// + cache-friendly iteration
441// - only works for pointers to structs
442//
443// NOTE: only some forms of erase/insert are available
444typedef int object_vector_index;
445
446template<class T, object_vector_index T::*indexmember>
387struct object_vector : std::vector<T *, slice_allocator<T *> > 447struct object_vector : std::vector<T *, slice_allocator<T *> >
388{ 448{
449 typedef typename object_vector::iterator iterator;
450
451 bool contains (const T *obj) const
452 {
453 return obj->*indexmember;
454 }
455
456 iterator find (const T *obj)
457 {
458 return obj->*indexmember
459 ? this->begin () + obj->*indexmember - 1
460 : this->end ();
461 }
462
463 void push_back (T *obj)
464 {
465 std::vector<T *, slice_allocator<T *> >::push_back (obj);
466 obj->*indexmember = this->size ();
467 }
468
389 void insert (T *obj) 469 void insert (T *obj)
390 { 470 {
391 assert (!(obj->*index));
392 push_back (obj); 471 push_back (obj);
393 obj->*index = this->size ();
394 } 472 }
395 473
396 void insert (T &obj) 474 void insert (T &obj)
397 { 475 {
398 insert (&obj); 476 insert (&obj);
399 } 477 }
400 478
401 void erase (T *obj) 479 void erase (T *obj)
402 { 480 {
403 assert (obj->*index);
404 unsigned int pos = obj->*index; 481 unsigned int pos = obj->*indexmember;
405 obj->*index = 0; 482 obj->*indexmember = 0;
406 483
407 if (pos < this->size ()) 484 if (pos < this->size ())
408 { 485 {
409 (*this)[pos - 1] = (*this)[this->size () - 1]; 486 (*this)[pos - 1] = (*this)[this->size () - 1];
410 (*this)[pos - 1]->*index = pos; 487 (*this)[pos - 1]->*indexmember = pos;
411 } 488 }
412 489
413 this->pop_back (); 490 this->pop_back ();
414 } 491 }
415 492
416 void erase (T &obj) 493 void erase (T &obj)
417 { 494 {
418 errase (&obj); 495 erase (&obj);
419 } 496 }
420}; 497};
421 498
422// basically does what strncpy should do, but appends "..." to strings exceeding length 499// basically does what strncpy should do, but appends "..." to strings exceeding length
423void assign (char *dst, const char *src, int maxlen); 500void assign (char *dst, const char *src, int maxlen);

Diff Legend

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