--- deliantra/server/include/util.h 2006/12/21 06:12:36 1.21 +++ deliantra/server/include/util.h 2007/06/02 03:48:29 1.47 @@ -1,18 +1,179 @@ +/* + * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. + * + * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team + * + * Crossfire TRT is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License as published by the Free + * Software Foundation; either version 2 of the License, or (at your option) + * any later version. + * + * This program is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY + * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * for more details. + * + * You should have received a copy of the GNU General Public License along + * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 + * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + * + * The authors can be reached via e-mail to + */ + #ifndef UTIL_H__ #define UTIL_H__ +//#define PREFER_MALLOC + #if __GNUC__ >= 3 -# define is_constant(c) __builtin_constant_p (c) +# define is_constant(c) __builtin_constant_p (c) +# define expect(expr,value) __builtin_expect ((expr),(value)) +# define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) #else -# define is_constant(c) 0 +# define is_constant(c) 0 +# define expect(expr,value) (expr) +# define prefetch(addr,rw,locality) +#endif + +#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) +# define decltype(x) typeof(x) #endif +// put into ifs if you are very sure that the expression +// is mostly true or mosty false. note that these return +// booleans, not the expression. +#define expect_false(expr) expect ((expr) != 0, 0) +#define expect_true(expr) expect ((expr) != 0, 1) + #include +#include +#include +#include #include +#include +#include + // use a gcc extension for auto declarations until ISO C++ sanctifies them -#define AUTODECL(var,expr) typeof(expr) var = (expr) +#define auto(var,expr) decltype(expr) var = (expr) + +// very ugly macro that basicaly declares and initialises a variable +// that is in scope for the next statement only +// works only for stuff that can be assigned 0 and converts to false +// (note: works great for pointers) +// most ugly macro I ever wrote +#define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) + +// in range including end +#define IN_RANGE_INC(val,beg,end) \ + ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) + +// in range excluding end +#define IN_RANGE_EXC(val,beg,end) \ + ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) + +void fork_abort (const char *msg); + +// rationale for using (U) not (T) is to reduce signed/unsigned issues, +// as a is often a constant while b is the variable. it is still a bug, though. +template static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } +template static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } +template static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } + +template static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } + +template +static inline T +lerp (T val, T min_in, T max_in, T min_out, T max_out) +{ + return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; +} + +// lots of stuff taken from FXT + +/* Rotate right. This is used in various places for checksumming */ +//TODO: that sucks, use a better checksum algo +static inline uint32_t +rotate_right (uint32_t c, uint32_t count = 1) +{ + return (c << (32 - count)) | (c >> count); +} + +static inline uint32_t +rotate_left (uint32_t c, uint32_t count = 1) +{ + return (c >> (32 - count)) | (c << count); +} + +// Return abs(a-b) +// Both a and b must not have the most significant bit set +static inline uint32_t +upos_abs_diff (uint32_t a, uint32_t b) +{ + long d1 = b - a; + long d2 = (d1 & (d1 >> 31)) << 1; + + return d1 - d2; // == (b - d) - (a + d); +} + +// Both a and b must not have the most significant bit set +static inline uint32_t +upos_min (uint32_t a, uint32_t b) +{ + int32_t d = b - a; + d &= d >> 31; + return a + d; +} + +// Both a and b must not have the most significant bit set +static inline uint32_t +upos_max (uint32_t a, uint32_t b) +{ + int32_t d = b - a; + d &= d >> 31; + return b - d; +} + +// this is much faster than crossfires original algorithm +// on modern cpus +inline int +isqrt (int n) +{ + return (int)sqrtf ((float)n); +} + +// this is only twice as fast as naive sqrtf (dx*dy+dy*dy) +#if 0 +// and has a max. error of 6 in the range -100..+100. +#else +// and has a max. error of 9 in the range -100..+100. +#endif +inline int +idistance (int dx, int dy) +{ + unsigned int dx_ = abs (dx); + unsigned int dy_ = abs (dy); + +#if 0 + return dx_ > dy_ + ? (dx_ * 61685 + dy_ * 26870) >> 16 + : (dy_ * 61685 + dx_ * 26870) >> 16; +#else + return dx_ + dy_ - min (dx_, dy_) * 5 / 8; +#endif +} + +/* + * absdir(int): Returns a number between 1 and 8, which represent + * the "absolute" direction of a number (it actually takes care of + * "overflow" in previous calculations of a direction). + */ +inline int +absdir (int d) +{ + return ((d - 1) & 7) + 1; +} // makes dynamically allocated objects zero-initialised struct zero_initialised @@ -64,7 +225,11 @@ template inline void sfree (T *ptr, int n = 1) throw () { +#ifdef PREFER_MALLOC + free (ptr); +#else g_slice_free1 (n * sizeof (T), (void *)ptr); +#endif } // a STL-compatible allocator that uses g_slice @@ -122,21 +287,55 @@ } }; -struct refcounted +// P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. +// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps +// http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps +struct tausworthe_random_generator { - refcounted () : refcnt (0) { } -// virtual ~refcounted (); - void refcnt_inc () { ++refcnt; } - void refcnt_dec () { --refcnt; } - bool dead () { return refcnt == 0; } - mutable int refcnt; -#if 0 -private: - static refcounted *rc_first; - refcounted *rc_next; -#endif + // generator + uint32_t state [4]; + + void operator =(const tausworthe_random_generator &src) + { + state [0] = src.state [0]; + state [1] = src.state [1]; + state [2] = src.state [2]; + state [3] = src.state [3]; + } + + void seed (uint32_t seed); + uint32_t next (); + + // uniform distribution + uint32_t operator ()(uint32_t num) + { + return is_constant (num) + ? (next () * (uint64_t)num) >> 32U + : get_range (num); + } + + // return a number within (min .. max) + int operator () (int r_min, int r_max) + { + return is_constant (r_min) && is_constant (r_max) && r_min <= r_max + ? r_min + operator ()(r_max - r_min + 1) + : get_range (r_min, r_max); + } + + double operator ()() + { + return this->next () / (double)0xFFFFFFFFU; + } + +protected: + uint32_t get_range (uint32_t r_max); + int get_range (int r_min, int r_max); }; +typedef tausworthe_random_generator rand_gen; + +extern rand_gen rndm; + template struct refptr { @@ -168,6 +367,12 @@ operator T *() const { return p; } }; +typedef refptr maptile_ptr; +typedef refptr object_ptr; +typedef refptr arch_ptr; +typedef refptr client_ptr; +typedef refptr player_ptr; + struct str_hash { std::size_t operator ()(const char *s) const @@ -202,10 +407,8 @@ } }; -#include - -template -struct unordered_vector : std::vector > +template +struct unordered_vector : std::vector > { typedef typename unordered_vector::iterator iterator; @@ -223,11 +426,41 @@ } }; -template static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } -template static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } -template static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } +template +struct object_vector : std::vector > +{ + void insert (T *obj) + { + assert (!(obj->*index)); + push_back (obj); + obj->*index = this->size (); + } -template static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } + void insert (T &obj) + { + insert (&obj); + } + + void erase (T *obj) + { + assert (obj->*index); + unsigned int pos = obj->*index; + obj->*index = 0; + + if (pos < this->size ()) + { + (*this)[pos - 1] = (*this)[this->size () - 1]; + (*this)[pos - 1]->*index = pos; + } + + this->pop_back (); + } + + void erase (T &obj) + { + errase (&obj); + } +}; // basically does what strncpy should do, but appends "..." to strings exceeding length void assign (char *dst, const char *src, int maxlen); @@ -244,5 +477,10 @@ // return current time as timestampe tstamp now (); +int similar_direction (int a, int b); + +// like printf, but returns a std::string +const std::string format (const char *format, ...); + #endif