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.37 by root, Thu Feb 15 15:43:36 2007 UTC vs.
Revision 1.60 by root, Tue Jan 22 15:53:01 2008 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 *
6 * Deliantra 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 <support@deliantra.net>
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
26#define DEBUG_SALLOC
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
58#ifdef DEBUG_SALLOC
59# define g_slice_alloc0(s) debug_slice_alloc0(s)
60# define g_slice_alloc(s) debug_slice_alloc(s)
61# define g_slice_free1(s,p) debug_slice_free1(s,p)
62void *g_slice_alloc (unsigned long size);
63void *g_slice_alloc0 (unsigned long size);
64void g_slice_free1 (unsigned long size, void *ptr);
65#endif
66
22// use a gcc extension for auto declarations until ISO C++ sanctifies them 67// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
23#define AUTODECL(var,expr) typeof(expr) var = (expr) 68#define auto(var,expr) decltype(expr) var = (expr)
24 69
25// very ugly macro that basicaly declares and initialises a variable 70// very ugly macro that basicaly declares and initialises a variable
26// that is in scope for the next statement only 71// that is in scope for the next statement only
27// works only for stuff that can be assigned 0 and converts to false 72// works only for stuff that can be assigned 0 and converts to false
28// (note: works great for pointers) 73// (note: works great for pointers)
29// most ugly macro I ever wrote 74// most ugly macro I ever wrote
30#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) 75#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
31 76
32// in range including end 77// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 78#define IN_RANGE_INC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 79 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
35 80
… …
45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } 90template<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; } 91template<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 92
48template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 93template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
49 94
95template<typename T>
96static inline T
97lerp (T val, T min_in, T max_in, T min_out, T max_out)
98{
99 return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out;
100}
101
50// lots of stuff taken from FXT 102// lots of stuff taken from FXT
51 103
52/* Rotate right. This is used in various places for checksumming */ 104/* Rotate right. This is used in various places for checksumming */
53//TODO: this sucks, use a better checksum algo 105//TODO: that sucks, use a better checksum algo
54static inline uint32_t 106static inline uint32_t
55rotate_right (uint32_t c) 107rotate_right (uint32_t c, uint32_t count = 1)
56{ 108{
57 return (c << 31) | (c >> 1); 109 return (c << (32 - count)) | (c >> count);
110}
111
112static inline uint32_t
113rotate_left (uint32_t c, uint32_t count = 1)
114{
115 return (c >> (32 - count)) | (c << count);
58} 116}
59 117
60// Return abs(a-b) 118// Return abs(a-b)
61// Both a and b must not have the most significant bit set 119// Both a and b must not have the most significant bit set
62static inline uint32_t 120static inline uint32_t
… …
124absdir (int d) 182absdir (int d)
125{ 183{
126 return ((d - 1) & 7) + 1; 184 return ((d - 1) & 7) + 1;
127} 185}
128 186
187extern size_t slice_alloc; // statistics
188
129// makes dynamically allocated objects zero-initialised 189// makes dynamically allocated objects zero-initialised
130struct zero_initialised 190struct zero_initialised
131{ 191{
132 void *operator new (size_t s, void *p) 192 void *operator new (size_t s, void *p)
133 { 193 {
… …
135 return p; 195 return p;
136 } 196 }
137 197
138 void *operator new (size_t s) 198 void *operator new (size_t s)
139 { 199 {
200 slice_alloc += s;
140 return g_slice_alloc0 (s); 201 return g_slice_alloc0 (s);
141 } 202 }
142 203
143 void *operator new[] (size_t s) 204 void *operator new[] (size_t s)
144 { 205 {
206 slice_alloc += s;
145 return g_slice_alloc0 (s); 207 return g_slice_alloc0 (s);
146 } 208 }
147 209
148 void operator delete (void *p, size_t s) 210 void operator delete (void *p, size_t s)
149 { 211 {
212 slice_alloc -= s;
150 g_slice_free1 (s, p); 213 g_slice_free1 (s, p);
151 } 214 }
152 215
153 void operator delete[] (void *p, size_t s) 216 void operator delete[] (void *p, size_t s)
154 { 217 {
218 slice_alloc -= s;
155 g_slice_free1 (s, p); 219 g_slice_free1 (s, p);
156 } 220 }
157}; 221};
158 222
159void *salloc_ (int n) throw (std::bad_alloc); 223void *salloc_ (int n) throw (std::bad_alloc);
… …
177inline void sfree (T *ptr, int n = 1) throw () 241inline void sfree (T *ptr, int n = 1) throw ()
178{ 242{
179#ifdef PREFER_MALLOC 243#ifdef PREFER_MALLOC
180 free (ptr); 244 free (ptr);
181#else 245#else
246 slice_alloc -= n * sizeof (T);
182 g_slice_free1 (n * sizeof (T), (void *)ptr); 247 g_slice_free1 (n * sizeof (T), (void *)ptr);
183#endif 248#endif
184} 249}
185 250
186// a STL-compatible allocator that uses g_slice 251// a STL-compatible allocator that uses g_slice
… …
256 321
257 void seed (uint32_t seed); 322 void seed (uint32_t seed);
258 uint32_t next (); 323 uint32_t next ();
259 324
260 // uniform distribution 325 // uniform distribution
261 uint32_t operator ()(uint32_t r_max) 326 uint32_t operator ()(uint32_t num)
262 { 327 {
263 return is_constant (r_max) 328 return is_constant (num)
264 ? this->next () % r_max 329 ? (next () * (uint64_t)num) >> 32U
265 : get_range (r_max); 330 : get_range (num);
266 } 331 }
267 332
268 // return a number within (min .. max) 333 // return a number within (min .. max)
269 int operator () (int r_min, int r_max) 334 int operator () (int r_min, int r_max)
270 { 335 {
271 return is_constant (r_min) && is_constant (r_max) 336 return is_constant (r_min) && is_constant (r_max) && r_min <= r_max
272 ? r_min + (*this) (max (r_max - r_min + 1, 1)) 337 ? r_min + operator ()(r_max - r_min + 1)
273 : get_range (r_min, r_max); 338 : get_range (r_min, r_max);
274 } 339 }
275 340
276 double operator ()() 341 double operator ()()
277 { 342 {
… …
285 350
286typedef tausworthe_random_generator rand_gen; 351typedef tausworthe_random_generator rand_gen;
287 352
288extern rand_gen rndm; 353extern rand_gen rndm;
289 354
355INTERFACE_CLASS (attachable)
356struct refcnt_base
357{
358 typedef int refcnt_t;
359 mutable refcnt_t ACC (RW, refcnt);
360
361 MTH void refcnt_inc () const { ++refcnt; }
362 MTH void refcnt_dec () const { --refcnt; }
363
364 refcnt_base () : refcnt (0) { }
365};
366
367// to avoid branches with more advanced compilers
368extern refcnt_base::refcnt_t refcnt_dummy;
369
290template<class T> 370template<class T>
291struct refptr 371struct refptr
292{ 372{
373 // p if not null
374 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
375
376 void refcnt_dec ()
377 {
378 if (!is_constant (p))
379 --*refcnt_ref ();
380 else if (p)
381 --p->refcnt;
382 }
383
384 void refcnt_inc ()
385 {
386 if (!is_constant (p))
387 ++*refcnt_ref ();
388 else if (p)
389 ++p->refcnt;
390 }
391
293 T *p; 392 T *p;
294 393
295 refptr () : p(0) { } 394 refptr () : p(0) { }
296 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 395 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
297 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 396 refptr (T *p) : p(p) { refcnt_inc (); }
298 ~refptr () { if (p) p->refcnt_dec (); } 397 ~refptr () { refcnt_dec (); }
299 398
300 const refptr<T> &operator =(T *o) 399 const refptr<T> &operator =(T *o)
301 { 400 {
401 // if decrementing ever destroys we need to reverse the order here
302 if (p) p->refcnt_dec (); 402 refcnt_dec ();
303 p = o; 403 p = o;
304 if (p) p->refcnt_inc (); 404 refcnt_inc ();
305
306 return *this; 405 return *this;
307 } 406 }
308 407
309 const refptr<T> &operator =(const refptr<T> o) 408 const refptr<T> &operator =(const refptr<T> &o)
310 { 409 {
311 *this = o.p; 410 *this = o.p;
312 return *this; 411 return *this;
313 } 412 }
314 413
315 T &operator * () const { return *p; } 414 T &operator * () const { return *p; }
316 T *operator ->() const { return p; } 415 T *operator ->() const { return p; }
317 416
318 operator T *() const { return p; } 417 operator T *() const { return p; }
319}; 418};
320 419
321typedef refptr<maptile> maptile_ptr; 420typedef refptr<maptile> maptile_ptr;
… …
356 { 455 {
357 return !strcmp (a, b); 456 return !strcmp (a, b);
358 } 457 }
359}; 458};
360 459
460// Mostly the same as std::vector, but insert/erase can reorder
461// the elements, making append(=insert)/remove O(1) instead of O(n).
462//
463// NOTE: only some forms of erase are available
361template<class T> 464template<class T>
362struct unordered_vector : std::vector<T, slice_allocator<T> > 465struct unordered_vector : std::vector<T, slice_allocator<T> >
363{ 466{
364 typedef typename unordered_vector::iterator iterator; 467 typedef typename unordered_vector::iterator iterator;
365 468
… …
375 { 478 {
376 erase ((unsigned int )(i - this->begin ())); 479 erase ((unsigned int )(i - this->begin ()));
377 } 480 }
378}; 481};
379 482
380template<class T, int T::* index> 483// This container blends advantages of linked lists
484// (efficiency) with vectors (random access) by
485// by using an unordered vector and storing the vector
486// index inside the object.
487//
488// + memory-efficient on most 64 bit archs
489// + O(1) insert/remove
490// + free unique (but varying) id for inserted objects
491// + cache-friendly iteration
492// - only works for pointers to structs
493//
494// NOTE: only some forms of erase/insert are available
495typedef int object_vector_index;
496
497template<class T, object_vector_index T::*indexmember>
381struct object_vector : std::vector<T *, slice_allocator<T *> > 498struct object_vector : std::vector<T *, slice_allocator<T *> >
382{ 499{
500 typedef typename object_vector::iterator iterator;
501
502 bool contains (const T *obj) const
503 {
504 return obj->*indexmember;
505 }
506
507 iterator find (const T *obj)
508 {
509 return obj->*indexmember
510 ? this->begin () + obj->*indexmember - 1
511 : this->end ();
512 }
513
514 void push_back (T *obj)
515 {
516 std::vector<T *, slice_allocator<T *> >::push_back (obj);
517 obj->*indexmember = this->size ();
518 }
519
383 void insert (T *obj) 520 void insert (T *obj)
384 { 521 {
385 assert (!(obj->*index));
386 push_back (obj); 522 push_back (obj);
387 obj->*index = this->size ();
388 } 523 }
389 524
390 void insert (T &obj) 525 void insert (T &obj)
391 { 526 {
392 insert (&obj); 527 insert (&obj);
393 } 528 }
394 529
395 void erase (T *obj) 530 void erase (T *obj)
396 { 531 {
397 assert (obj->*index);
398 int pos = obj->*index; 532 unsigned int pos = obj->*indexmember;
399 obj->*index = 0; 533 obj->*indexmember = 0;
400 534
401 if (pos < this->size ()) 535 if (pos < this->size ())
402 { 536 {
403 (*this)[pos - 1] = (*this)[this->size () - 1]; 537 (*this)[pos - 1] = (*this)[this->size () - 1];
404 (*this)[pos - 1]->*index = pos; 538 (*this)[pos - 1]->*indexmember = pos;
405 } 539 }
406 540
407 this->pop_back (); 541 this->pop_back ();
408 } 542 }
409 543
410 void erase (T &obj) 544 void erase (T &obj)
411 { 545 {
412 errase (&obj); 546 erase (&obj);
413 } 547 }
414}; 548};
415 549
416// basically does what strncpy should do, but appends "..." to strings exceeding length 550// basically does what strncpy should do, but appends "..." to strings exceeding length
417void assign (char *dst, const char *src, int maxlen); 551void assign (char *dst, const char *src, int maxlen);
… …
423 assign ((char *)&dst, src, N); 557 assign ((char *)&dst, src, N);
424} 558}
425 559
426typedef double tstamp; 560typedef double tstamp;
427 561
428// return current time as timestampe 562// return current time as timestamp
429tstamp now (); 563tstamp now ();
430 564
431int similar_direction (int a, int b); 565int similar_direction (int a, int b);
432 566
433#endif 567// like sprintf, but returns a "static" buffer
568const char *format (const char *format, ...);
434 569
570#endif
571

Diff Legend

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