--- deliantra/server/include/util.h 2007/01/25 03:54:45 1.36
+++ deliantra/server/include/util.h 2007/08/16 06:36:56 1.55
@@ -1,14 +1,49 @@
+/*
+ * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
+ *
+ * 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 3 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 this program. If not, see .
+ *
+ * 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
@@ -19,15 +54,15 @@
#include
#include
-// use a gcc extension for auto declarations until ISO C++ sanctifies them
-#define AUTODECL(var,expr) typeof(expr) var = (expr)
+// use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever)
+#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)
+#define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1)
// in range including end
#define IN_RANGE_INC(val,beg,end) \
@@ -47,6 +82,58 @@
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
@@ -219,18 +306,18 @@
uint32_t next ();
// uniform distribution
- uint32_t operator ()(uint32_t r_max)
+ uint32_t operator ()(uint32_t num)
{
- return is_constant (r_max)
- ? this->next () % r_max
- : get_range (r_max);
+ 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 + (*this) (max (r_max - r_min + 1, 1))
+ 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);
}
@@ -248,33 +335,66 @@
extern rand_gen rndm;
+INTERFACE_CLASS (attachable)
+struct refcnt_base
+{
+ typedef int refcnt_t;
+ mutable refcnt_t ACC (RW, refcnt);
+
+ MTH void refcnt_inc () const { ++refcnt; }
+ MTH void refcnt_dec () const { --refcnt; }
+
+ refcnt_base () : refcnt (0) { }
+};
+
+extern refcnt_base::refcnt_t refcnt_dummy;
+
template
struct refptr
{
+ // p if not null
+ refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; }
+
+ void refcnt_dec ()
+ {
+ if (!is_constant (p))
+ --*refcnt_ref ();
+ else if (p)
+ --p->refcnt;
+ }
+
+ void refcnt_inc ()
+ {
+ if (!is_constant (p))
+ ++*refcnt_ref ();
+ else if (p)
+ ++p->refcnt;
+ }
+
T *p;
refptr () : p(0) { }
- refptr (const refptr &p) : p(p.p) { if (p) p->refcnt_inc (); }
- refptr (T *p) : p(p) { if (p) p->refcnt_inc (); }
- ~refptr () { if (p) p->refcnt_dec (); }
+ refptr (const refptr &p) : p(p.p) { refcnt_inc (); }
+ refptr (T *p) : p(p) { refcnt_inc (); }
+ ~refptr () { refcnt_dec (); }
const refptr &operator =(T *o)
{
- if (p) p->refcnt_dec ();
+ // if decrementing ever destroys we need to reverse the order here
+ refcnt_dec ();
p = o;
- if (p) p->refcnt_inc ();
-
+ refcnt_inc ();
return *this;
}
- const refptr &operator =(const refptr o)
+ const refptr &operator =(const refptr &o)
{
*this = o.p;
return *this;
}
T &operator * () const { return *p; }
- T *operator ->() const { return p; }
+ T *operator ->() const { return p; }
operator T *() const { return p; }
};
@@ -319,6 +439,10 @@
}
};
+// Mostly the same as std::vector, but insert/erase can reorder
+// the elements, making append(=insert)/remove O(1) instead of O(n).
+//
+// NOTE: only some forms of erase are available
template
struct unordered_vector : std::vector >
{
@@ -338,14 +462,46 @@
}
};
-template
+// This container blends advantages of linked lists
+// (efficiency) with vectors (random access) by
+// by using an unordered vector and storing the vector
+// index inside the object.
+//
+// + memory-efficient on most 64 bit archs
+// + O(1) insert/remove
+// + free unique (but varying) id for inserted objects
+// + cache-friendly iteration
+// - only works for pointers to structs
+//
+// NOTE: only some forms of erase/insert are available
+typedef int object_vector_index;
+
+template
struct object_vector : std::vector >
{
+ typedef typename object_vector::iterator iterator;
+
+ bool contains (const T *obj) const
+ {
+ return obj->*indexmember;
+ }
+
+ iterator find (const T *obj)
+ {
+ return obj->*indexmember
+ ? this->begin () + obj->*indexmember - 1
+ : this->end ();
+ }
+
+ void push_back (T *obj)
+ {
+ std::vector >::push_back (obj);
+ obj->*indexmember = this->size ();
+ }
+
void insert (T *obj)
{
- assert (!(obj->*index));
push_back (obj);
- obj->*index = this->size ();
}
void insert (T &obj)
@@ -355,14 +511,13 @@
void erase (T *obj)
{
- assert (obj->*index);
- int pos = obj->*index;
- obj->*index = 0;
+ unsigned int pos = obj->*indexmember;
+ obj->*indexmember = 0;
if (pos < this->size ())
{
(*this)[pos - 1] = (*this)[this->size () - 1];
- (*this)[pos - 1]->*index = pos;
+ (*this)[pos - 1]->*indexmember = pos;
}
this->pop_back ();
@@ -370,7 +525,7 @@
void erase (T &obj)
{
- errase (&obj);
+ erase (&obj);
}
};
@@ -391,5 +546,8 @@
int similar_direction (int a, int b);
+// like sprintf, but returns a "static" buffer
+const char *format (const char *format, ...);
+
#endif