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.36 by root, Thu Jan 25 03:54:45 2007 UTC vs.
Revision 1.51 by root, Sun Jul 1 05:00:18 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 AUTODECL(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}
91
92// lots of stuff taken from FXT
93
94/* Rotate right. This is used in various places for checksumming */
95//TODO: that sucks, use a better checksum algo
96static inline uint32_t
97rotate_right (uint32_t c, uint32_t count = 1)
98{
99 return (c << (32 - count)) | (c >> count);
100}
101
102static inline uint32_t
103rotate_left (uint32_t c, uint32_t count = 1)
104{
105 return (c >> (32 - count)) | (c << count);
106}
107
108// Return abs(a-b)
109// Both a and b must not have the most significant bit set
110static inline uint32_t
111upos_abs_diff (uint32_t a, uint32_t b)
112{
113 long d1 = b - a;
114 long d2 = (d1 & (d1 >> 31)) << 1;
115
116 return d1 - d2; // == (b - d) - (a + d);
117}
118
119// Both a and b must not have the most significant bit set
120static inline uint32_t
121upos_min (uint32_t a, uint32_t b)
122{
123 int32_t d = b - a;
124 d &= d >> 31;
125 return a + d;
126}
127
128// Both a and b must not have the most significant bit set
129static inline uint32_t
130upos_max (uint32_t a, uint32_t b)
131{
132 int32_t d = b - a;
133 d &= d >> 31;
134 return b - d;
135}
49 136
50// this is much faster than crossfires original algorithm 137// this is much faster than crossfires original algorithm
51// on modern cpus 138// on modern cpus
52inline int 139inline int
53isqrt (int n) 140isqrt (int n)
… …
217 304
218 void seed (uint32_t seed); 305 void seed (uint32_t seed);
219 uint32_t next (); 306 uint32_t next ();
220 307
221 // uniform distribution 308 // uniform distribution
222 uint32_t operator ()(uint32_t r_max) 309 uint32_t operator ()(uint32_t num)
223 { 310 {
224 return is_constant (r_max) 311 return is_constant (num)
225 ? this->next () % r_max 312 ? (next () * (uint64_t)num) >> 32U
226 : get_range (r_max); 313 : get_range (num);
227 } 314 }
228 315
229 // return a number within (min .. max) 316 // return a number within (min .. max)
230 int operator () (int r_min, int r_max) 317 int operator () (int r_min, int r_max)
231 { 318 {
232 return is_constant (r_min) && is_constant (r_max) 319 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
233 ? r_min + (*this) (max (r_max - r_min + 1, 1)) 320 ? r_min + operator ()(r_max - r_min + 1)
234 : get_range (r_min, r_max); 321 : get_range (r_min, r_max);
235 } 322 }
236 323
237 double operator ()() 324 double operator ()()
238 { 325 {
… …
317 { 404 {
318 return !strcmp (a, b); 405 return !strcmp (a, b);
319 } 406 }
320}; 407};
321 408
409// Mostly the same as std::vector, but insert/erase can reorder
410// the elements, making insret/remove O(1) instead of O(n).
411//
412// NOTE: only some forms of erase/insert are available
322template<class T> 413template<class T>
323struct unordered_vector : std::vector<T, slice_allocator<T> > 414struct unordered_vector : std::vector<T, slice_allocator<T> >
324{ 415{
325 typedef typename unordered_vector::iterator iterator; 416 typedef typename unordered_vector::iterator iterator;
326 417
… …
336 { 427 {
337 erase ((unsigned int )(i - this->begin ())); 428 erase ((unsigned int )(i - this->begin ()));
338 } 429 }
339}; 430};
340 431
341template<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>
342struct object_vector : std::vector<T *, slice_allocator<T *> > 447struct object_vector : std::vector<T *, slice_allocator<T *> >
343{ 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
344 void insert (T *obj) 463 void insert (T *obj)
345 { 464 {
346 assert (!(obj->*index));
347 push_back (obj); 465 push_back (obj);
348 obj->*index = this->size (); 466 obj->*indexmember = this->size ();
349 } 467 }
350 468
351 void insert (T &obj) 469 void insert (T &obj)
352 { 470 {
353 insert (&obj); 471 insert (&obj);
354 } 472 }
355 473
356 void erase (T *obj) 474 void erase (T *obj)
357 { 475 {
358 assert (obj->*index);
359 int pos = obj->*index; 476 unsigned int pos = obj->*indexmember;
360 obj->*index = 0; 477 obj->*indexmember = 0;
361 478
362 if (pos < this->size ()) 479 if (pos < this->size ())
363 { 480 {
364 (*this)[pos - 1] = (*this)[this->size () - 1]; 481 (*this)[pos - 1] = (*this)[this->size () - 1];
365 (*this)[pos - 1]->*index = pos; 482 (*this)[pos - 1]->*indexmember = pos;
366 } 483 }
367 484
368 this->pop_back (); 485 this->pop_back ();
369 } 486 }
370 487
371 void erase (T &obj) 488 void erase (T &obj)
372 { 489 {
373 errase (&obj); 490 erase (&obj);
374 } 491 }
375}; 492};
376 493
377// basically does what strncpy should do, but appends "..." to strings exceeding length 494// basically does what strncpy should do, but appends "..." to strings exceeding length
378void assign (char *dst, const char *src, int maxlen); 495void assign (char *dst, const char *src, int maxlen);
… …
389// return current time as timestampe 506// return current time as timestampe
390tstamp now (); 507tstamp now ();
391 508
392int similar_direction (int a, int b); 509int similar_direction (int a, int b);
393 510
511// like printf, but returns a std::string
512const std::string format (const char *format, ...);
513
394#endif 514#endif
395 515

Diff Legend

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