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 |
… | |
… | |
16 | |
18 | |
17 | #include <shstr.h> |
19 | #include <shstr.h> |
18 | #include <traits.h> |
20 | #include <traits.h> |
19 | |
21 | |
20 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
22 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
21 | #define AUTODECL(var,expr) typeof(expr) var = (expr) |
23 | #define auto(var,expr) typeof(expr) var = (expr) |
22 | |
24 | |
23 | // very ugly macro that basicaly declares and initialises a variable |
25 | // very ugly macro that basicaly declares and initialises a variable |
24 | // that is in scope for the next statement only |
26 | // that is in scope for the next statement only |
25 | // works only for stuff that can be assigned 0 and converts to false |
27 | // works only for stuff that can be assigned 0 and converts to false |
26 | // (note: works great for pointers) |
28 | // (note: works great for pointers) |
… | |
… | |
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 | |
38 | void fork_abort (const char *msg); |
40 | void 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. |
40 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
44 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
41 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
45 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
42 | template<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; } |
46 | template<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 | |
44 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
48 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
49 | |
|
|
50 | template<typename T> |
|
|
51 | static inline T |
|
|
52 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
53 | { |
|
|
54 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
|
|
55 | } |
|
|
56 | |
|
|
57 | // lots of stuff taken from FXT |
|
|
58 | |
|
|
59 | /* Rotate right. This is used in various places for checksumming */ |
|
|
60 | //TODO: that sucks, use a better checksum algo |
|
|
61 | static inline uint32_t |
|
|
62 | rotate_right (uint32_t c, uint32_t count = 1) |
|
|
63 | { |
|
|
64 | return (c << (32 - count)) | (c >> count); |
|
|
65 | } |
|
|
66 | |
|
|
67 | static inline uint32_t |
|
|
68 | rotate_left (uint32_t c, uint32_t count = 1) |
|
|
69 | { |
|
|
70 | return (c >> (32 - count)) | (c << count); |
|
|
71 | } |
|
|
72 | |
|
|
73 | // Return abs(a-b) |
|
|
74 | // Both a and b must not have the most significant bit set |
|
|
75 | static inline uint32_t |
|
|
76 | upos_abs_diff (uint32_t a, uint32_t b) |
|
|
77 | { |
|
|
78 | long d1 = b - a; |
|
|
79 | long d2 = (d1 & (d1 >> 31)) << 1; |
|
|
80 | |
|
|
81 | return d1 - d2; // == (b - d) - (a + d); |
|
|
82 | } |
|
|
83 | |
|
|
84 | // Both a and b must not have the most significant bit set |
|
|
85 | static inline uint32_t |
|
|
86 | upos_min (uint32_t a, uint32_t b) |
|
|
87 | { |
|
|
88 | int32_t d = b - a; |
|
|
89 | d &= d >> 31; |
|
|
90 | return a + d; |
|
|
91 | } |
|
|
92 | |
|
|
93 | // Both a and b must not have the most significant bit set |
|
|
94 | static inline uint32_t |
|
|
95 | upos_max (uint32_t a, uint32_t b) |
|
|
96 | { |
|
|
97 | int32_t d = b - a; |
|
|
98 | d &= d >> 31; |
|
|
99 | return b - d; |
|
|
100 | } |
45 | |
101 | |
46 | // this is much faster than crossfires original algorithm |
102 | // this is much faster than crossfires original algorithm |
47 | // on modern cpus |
103 | // on modern cpus |
48 | inline int |
104 | inline int |
49 | isqrt (int n) |
105 | isqrt (int n) |
… | |
… | |
131 | |
187 | |
132 | // for symmetry |
188 | // for symmetry |
133 | template<typename T> |
189 | template<typename T> |
134 | inline void sfree (T *ptr, int n = 1) throw () |
190 | inline void sfree (T *ptr, int n = 1) throw () |
135 | { |
191 | { |
|
|
192 | #ifdef PREFER_MALLOC |
|
|
193 | free (ptr); |
|
|
194 | #else |
136 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
195 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
196 | #endif |
137 | } |
197 | } |
138 | |
198 | |
139 | // a STL-compatible allocator that uses g_slice |
199 | // a STL-compatible allocator that uses g_slice |
140 | // boy, this is verbose |
200 | // boy, this is verbose |
141 | template<typename Tp> |
201 | template<typename Tp> |
… | |
… | |
209 | |
269 | |
210 | void seed (uint32_t seed); |
270 | void seed (uint32_t seed); |
211 | uint32_t next (); |
271 | uint32_t next (); |
212 | |
272 | |
213 | // uniform distribution |
273 | // uniform distribution |
214 | uint32_t operator ()(uint32_t r_max) |
274 | uint32_t operator ()(uint32_t num) |
215 | { |
275 | { |
216 | return is_constant (r_max) |
276 | return is_constant (num) |
217 | ? this->next () % r_max |
277 | ? (next () * (uint64_t)num) >> 32U |
218 | : get_range (r_max); |
278 | : get_range (num); |
219 | } |
279 | } |
220 | |
280 | |
221 | // return a number within (min .. max) |
281 | // return a number within (min .. max) |
222 | int operator () (int r_min, int r_max) |
282 | int operator () (int r_min, int r_max) |
223 | { |
283 | { |
224 | return is_constant (r_min) && is_constant (r_max) |
284 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
225 | ? r_min + (*this) (max (r_max - r_min + 1, 1)) |
285 | ? r_min + operator ()(r_max - r_min + 1) |
226 | : get_range (r_min, r_max); |
286 | : get_range (r_min, r_max); |
227 | } |
287 | } |
228 | |
288 | |
229 | double operator ()() |
289 | double operator ()() |
230 | { |
290 | { |
… | |
… | |
346 | } |
406 | } |
347 | |
407 | |
348 | void erase (T *obj) |
408 | void erase (T *obj) |
349 | { |
409 | { |
350 | assert (obj->*index); |
410 | assert (obj->*index); |
351 | int pos = obj->*index; |
411 | unsigned int pos = obj->*index; |
352 | obj->*index = 0; |
412 | obj->*index = 0; |
353 | |
413 | |
354 | if (pos < this->size ()) |
414 | if (pos < this->size ()) |
355 | { |
415 | { |
356 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
416 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
381 | // return current time as timestampe |
441 | // return current time as timestampe |
382 | tstamp now (); |
442 | tstamp now (); |
383 | |
443 | |
384 | int similar_direction (int a, int b); |
444 | int similar_direction (int a, int b); |
385 | |
445 | |
|
|
446 | // like printf, but returns a std::string |
|
|
447 | const std::string format (const char *format, ...); |
|
|
448 | |
386 | #endif |
449 | #endif |
387 | |
450 | |