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.34 by root, Fri Jan 19 15:15:50 2007 UTC vs.
Revision 1.37 by root, Thu Feb 15 15:43:36 2007 UTC

1#ifndef UTIL_H__ 1#ifndef UTIL_H__
2#define UTIL_H__ 2#define UTIL_H__
3
4//#define PREFER_MALLOC
3 5
4#if __GNUC__ >= 3 6#if __GNUC__ >= 3
5# define is_constant(c) __builtin_constant_p (c) 7# define is_constant(c) __builtin_constant_p (c)
6#else 8#else
7# define is_constant(c) 0 9# define is_constant(c) 0
35#define IN_RANGE_EXC(val,beg,end) \ 37#define IN_RANGE_EXC(val,beg,end) \
36 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 38 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
37 39
38void fork_abort (const char *msg); 40void fork_abort (const char *msg);
39 41
42// rationale for using (U) not (T) is to reduce signed/unsigned issues,
43// as a is often a constant while b is the variable. it is still a bug, though.
40template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 44template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; }
41template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 45template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; }
42template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } 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; }
43 47
44template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 48template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
49
50// lots of stuff taken from FXT
51
52/* Rotate right. This is used in various places for checksumming */
53//TODO: this sucks, use a better checksum algo
54static inline uint32_t
55rotate_right (uint32_t c)
56{
57 return (c << 31) | (c >> 1);
58}
59
60// Return abs(a-b)
61// Both a and b must not have the most significant bit set
62static inline uint32_t
63upos_abs_diff (uint32_t a, uint32_t b)
64{
65 long d1 = b - a;
66 long d2 = (d1 & (d1 >> 31)) << 1;
67
68 return d1 - d2; // == (b - d) - (a + d);
69}
70
71// Both a and b must not have the most significant bit set
72static inline uint32_t
73upos_min (uint32_t a, uint32_t b)
74{
75 int32_t d = b - a;
76 d &= d >> 31;
77 return a + d;
78}
79
80// Both a and b must not have the most significant bit set
81static inline uint32_t
82upos_max (uint32_t a, uint32_t b)
83{
84 int32_t d = b - a;
85 d &= d >> 31;
86 return b - d;
87}
45 88
46// this is much faster than crossfires original algorithm 89// this is much faster than crossfires original algorithm
47// on modern cpus 90// on modern cpus
48inline int 91inline int
49isqrt (int n) 92isqrt (int n)
131 174
132// for symmetry 175// for symmetry
133template<typename T> 176template<typename T>
134inline void sfree (T *ptr, int n = 1) throw () 177inline void sfree (T *ptr, int n = 1) throw ()
135{ 178{
179#ifdef PREFER_MALLOC
180 free (ptr);
181#else
136 g_slice_free1 (n * sizeof (T), (void *)ptr); 182 g_slice_free1 (n * sizeof (T), (void *)ptr);
183#endif
137} 184}
138 185
139// a STL-compatible allocator that uses g_slice 186// a STL-compatible allocator that uses g_slice
140// boy, this is verbose 187// boy, this is verbose
141template<typename Tp> 188template<typename Tp>

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines