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.53 by root, Fri Jul 13 15:54:40 2007 UTC vs.
Revision 1.63 by root, Sat Mar 15 13:52:38 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
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 Deliantra team
5 * 5 *
6 * Crossfire TRT is free software: you can redistribute it and/or modify 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 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 8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) 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, 11 * This program is distributed in the hope that it will be useful,
… …
14 * GNU General Public License 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 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/>. 17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 * 18 *
19 * The authors can be reached via e-mail to <crossfire@schmorp.de> 19 * The authors can be reached via e-mail to <support@deliantra.net>
20 */ 20 */
21 21
22#ifndef UTIL_H__ 22#ifndef UTIL_H__
23#define UTIL_H__ 23#define UTIL_H__
24 24
25//#define PREFER_MALLOC 25//#define PREFER_MALLOC
26#define DEBUG_SALLOC
26 27
27#if __GNUC__ >= 3 28#if __GNUC__ >= 3
28# define is_constant(c) __builtin_constant_p (c) 29# define is_constant(c) __builtin_constant_p (c)
29# define expect(expr,value) __builtin_expect ((expr),(value)) 30# define expect(expr,value) __builtin_expect ((expr),(value))
30# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) 31# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality)
… …
52#include <glib.h> 53#include <glib.h>
53 54
54#include <shstr.h> 55#include <shstr.h>
55#include <traits.h> 56#include <traits.h>
56 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
57// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) 67// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
58#define auto(var,expr) decltype(expr) var = (expr) 68#define auto(var,expr) decltype(expr) var = (expr)
59 69
60// very ugly macro that basicaly declares and initialises a variable 70// very ugly macro that basicaly declares and initialises a variable
61// that is in scope for the next statement only 71// that is in scope for the next statement only
… …
79template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } 89template<typename T, typename U> static inline T min (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; } 90template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
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; } 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; }
82 92
83template<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; }
94
95template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); }
96template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); }
84 97
85template<typename T> 98template<typename T>
86static inline T 99static inline T
87lerp (T val, T min_in, T max_in, T min_out, T max_out) 100lerp (T val, T min_in, T max_in, T min_out, T max_out)
88{ 101{
… …
172absdir (int d) 185absdir (int d)
173{ 186{
174 return ((d - 1) & 7) + 1; 187 return ((d - 1) & 7) + 1;
175} 188}
176 189
190extern size_t slice_alloc; // statistics
191
177// makes dynamically allocated objects zero-initialised 192// makes dynamically allocated objects zero-initialised
178struct zero_initialised 193struct zero_initialised
179{ 194{
180 void *operator new (size_t s, void *p) 195 void *operator new (size_t s, void *p)
181 { 196 {
… …
183 return p; 198 return p;
184 } 199 }
185 200
186 void *operator new (size_t s) 201 void *operator new (size_t s)
187 { 202 {
203 slice_alloc += s;
188 return g_slice_alloc0 (s); 204 return g_slice_alloc0 (s);
189 } 205 }
190 206
191 void *operator new[] (size_t s) 207 void *operator new[] (size_t s)
192 { 208 {
209 slice_alloc += s;
193 return g_slice_alloc0 (s); 210 return g_slice_alloc0 (s);
194 } 211 }
195 212
196 void operator delete (void *p, size_t s) 213 void operator delete (void *p, size_t s)
197 { 214 {
215 slice_alloc -= s;
198 g_slice_free1 (s, p); 216 g_slice_free1 (s, p);
199 } 217 }
200 218
201 void operator delete[] (void *p, size_t s) 219 void operator delete[] (void *p, size_t s)
202 { 220 {
221 slice_alloc -= s;
203 g_slice_free1 (s, p); 222 g_slice_free1 (s, p);
204 } 223 }
205}; 224};
206 225
207void *salloc_ (int n) throw (std::bad_alloc); 226void *salloc_ (int n) throw (std::bad_alloc);
… …
225inline void sfree (T *ptr, int n = 1) throw () 244inline void sfree (T *ptr, int n = 1) throw ()
226{ 245{
227#ifdef PREFER_MALLOC 246#ifdef PREFER_MALLOC
228 free (ptr); 247 free (ptr);
229#else 248#else
249 slice_alloc -= n * sizeof (T);
230 g_slice_free1 (n * sizeof (T), (void *)ptr); 250 g_slice_free1 (n * sizeof (T), (void *)ptr);
231#endif 251#endif
232} 252}
233 253
234// a STL-compatible allocator that uses g_slice 254// a STL-compatible allocator that uses g_slice
… …
333 353
334typedef tausworthe_random_generator rand_gen; 354typedef tausworthe_random_generator rand_gen;
335 355
336extern rand_gen rndm; 356extern rand_gen rndm;
337 357
358INTERFACE_CLASS (attachable)
359struct refcnt_base
360{
361 typedef int refcnt_t;
362 mutable refcnt_t ACC (RW, refcnt);
363
364 MTH void refcnt_inc () const { ++refcnt; }
365 MTH void refcnt_dec () const { --refcnt; }
366
367 refcnt_base () : refcnt (0) { }
368};
369
370// to avoid branches with more advanced compilers
371extern refcnt_base::refcnt_t refcnt_dummy;
372
338template<class T> 373template<class T>
339struct refptr 374struct refptr
340{ 375{
376 // p if not null
377 refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
378
379 void refcnt_dec ()
380 {
381 if (!is_constant (p))
382 --*refcnt_ref ();
383 else if (p)
384 --p->refcnt;
385 }
386
387 void refcnt_inc ()
388 {
389 if (!is_constant (p))
390 ++*refcnt_ref ();
391 else if (p)
392 ++p->refcnt;
393 }
394
341 T *p; 395 T *p;
342 396
343 refptr () : p(0) { } 397 refptr () : p(0) { }
344 refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } 398 refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); }
345 refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } 399 refptr (T *p) : p(p) { refcnt_inc (); }
346 ~refptr () { if (p) p->refcnt_dec (); } 400 ~refptr () { refcnt_dec (); }
347 401
348 const refptr<T> &operator =(T *o) 402 const refptr<T> &operator =(T *o)
349 { 403 {
404 // if decrementing ever destroys we need to reverse the order here
350 if (p) p->refcnt_dec (); 405 refcnt_dec ();
351 p = o; 406 p = o;
352 if (p) p->refcnt_inc (); 407 refcnt_inc ();
353
354 return *this; 408 return *this;
355 } 409 }
356 410
357 const refptr<T> &operator =(const refptr<T> o) 411 const refptr<T> &operator =(const refptr<T> &o)
358 { 412 {
359 *this = o.p; 413 *this = o.p;
360 return *this; 414 return *this;
361 } 415 }
362 416
363 T &operator * () const { return *p; } 417 T &operator * () const { return *p; }
364 T *operator ->() const { return p; } 418 T *operator ->() const { return p; }
365 419
366 operator T *() const { return p; } 420 operator T *() const { return p; }
367}; 421};
368 422
369typedef refptr<maptile> maptile_ptr; 423typedef refptr<maptile> maptile_ptr;
… …
506 assign ((char *)&dst, src, N); 560 assign ((char *)&dst, src, N);
507} 561}
508 562
509typedef double tstamp; 563typedef double tstamp;
510 564
511// return current time as timestampe 565// return current time as timestamp
512tstamp now (); 566tstamp now ();
513 567
514int similar_direction (int a, int b); 568int similar_direction (int a, int b);
515 569
516// like printf, but returns a std::string 570// like sprintf, but returns a "static" buffer
517const std::string format (const char *format, ...); 571const char *format (const char *format, ...);
518 572
519#endif 573#endif
520 574

Diff Legend

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