|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * |
|
|
6 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
|
|
7 | * under the terms of the GNU General Public License as published by the Free |
|
|
8 | * Software Foundation; either version 2 of the License, or (at your option) |
|
|
9 | * any later version. |
|
|
10 | * |
|
|
11 | * This program is distributed in the hope that it will be useful, but |
|
|
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
|
|
13 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
14 | * for more details. |
|
|
15 | * |
|
|
16 | * You should have received a copy of the GNU General Public License along |
|
|
17 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
|
|
18 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
19 | * |
|
|
20 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
21 | */ |
|
|
22 | |
1 | #ifndef UTIL_H__ |
23 | #ifndef UTIL_H__ |
2 | #define UTIL_H__ |
24 | #define UTIL_H__ |
3 | |
25 | |
|
|
26 | //#define PREFER_MALLOC |
|
|
27 | |
4 | #if __GNUC__ >= 3 |
28 | #if __GNUC__ >= 3 |
5 | # define is_constant(c) __builtin_constant_p (c) |
29 | # define is_constant(c) __builtin_constant_p (c) |
|
|
30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
6 | #else |
32 | #else |
7 | # define is_constant(c) 0 |
33 | # define is_constant(c) 0 |
|
|
34 | # define expect(expr,value) (expr) |
|
|
35 | # define prefetch(addr,rw,locality) |
8 | #endif |
36 | #endif |
|
|
37 | |
|
|
38 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
39 | # define decltype(x) typeof(x) |
|
|
40 | #endif |
|
|
41 | |
|
|
42 | // put into ifs if you are very sure that the expression |
|
|
43 | // is mostly true or mosty false. note that these return |
|
|
44 | // booleans, not the expression. |
|
|
45 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
46 | #define expect_true(expr) expect ((expr) != 0, 1) |
9 | |
47 | |
10 | #include <cstddef> |
48 | #include <cstddef> |
11 | #include <cmath> |
49 | #include <cmath> |
12 | #include <new> |
50 | #include <new> |
13 | #include <vector> |
51 | #include <vector> |
… | |
… | |
16 | |
54 | |
17 | #include <shstr.h> |
55 | #include <shstr.h> |
18 | #include <traits.h> |
56 | #include <traits.h> |
19 | |
57 | |
20 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
58 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
21 | #define AUTODECL(var,expr) typeof(expr) var = (expr) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
22 | |
60 | |
23 | // very ugly macro that basicaly declares and initialises a variable |
61 | // very ugly macro that basicaly declares and initialises a variable |
24 | // that is in scope for the next statement only |
62 | // that is in scope for the next statement only |
25 | // works only for stuff that can be assigned 0 and converts to false |
63 | // works only for stuff that can be assigned 0 and converts to false |
26 | // (note: works great for pointers) |
64 | // (note: works great for pointers) |
… | |
… | |
42 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
80 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
43 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
81 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
44 | 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; } |
82 | 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; } |
45 | |
83 | |
46 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
84 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
85 | |
|
|
86 | template<typename T> |
|
|
87 | static inline T |
|
|
88 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
89 | { |
|
|
90 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
|
|
91 | } |
|
|
92 | |
|
|
93 | // lots of stuff taken from FXT |
|
|
94 | |
|
|
95 | /* Rotate right. This is used in various places for checksumming */ |
|
|
96 | //TODO: that sucks, use a better checksum algo |
|
|
97 | static inline uint32_t |
|
|
98 | rotate_right (uint32_t c, uint32_t count = 1) |
|
|
99 | { |
|
|
100 | return (c << (32 - count)) | (c >> count); |
|
|
101 | } |
|
|
102 | |
|
|
103 | static inline uint32_t |
|
|
104 | rotate_left (uint32_t c, uint32_t count = 1) |
|
|
105 | { |
|
|
106 | return (c >> (32 - count)) | (c << count); |
|
|
107 | } |
|
|
108 | |
|
|
109 | // Return abs(a-b) |
|
|
110 | // Both a and b must not have the most significant bit set |
|
|
111 | static inline uint32_t |
|
|
112 | upos_abs_diff (uint32_t a, uint32_t b) |
|
|
113 | { |
|
|
114 | long d1 = b - a; |
|
|
115 | long d2 = (d1 & (d1 >> 31)) << 1; |
|
|
116 | |
|
|
117 | return d1 - d2; // == (b - d) - (a + d); |
|
|
118 | } |
|
|
119 | |
|
|
120 | // Both a and b must not have the most significant bit set |
|
|
121 | static inline uint32_t |
|
|
122 | upos_min (uint32_t a, uint32_t b) |
|
|
123 | { |
|
|
124 | int32_t d = b - a; |
|
|
125 | d &= d >> 31; |
|
|
126 | return a + d; |
|
|
127 | } |
|
|
128 | |
|
|
129 | // Both a and b must not have the most significant bit set |
|
|
130 | static inline uint32_t |
|
|
131 | upos_max (uint32_t a, uint32_t b) |
|
|
132 | { |
|
|
133 | int32_t d = b - a; |
|
|
134 | d &= d >> 31; |
|
|
135 | return b - d; |
|
|
136 | } |
47 | |
137 | |
48 | // this is much faster than crossfires original algorithm |
138 | // this is much faster than crossfires original algorithm |
49 | // on modern cpus |
139 | // on modern cpus |
50 | inline int |
140 | inline int |
51 | isqrt (int n) |
141 | isqrt (int n) |
… | |
… | |
133 | |
223 | |
134 | // for symmetry |
224 | // for symmetry |
135 | template<typename T> |
225 | template<typename T> |
136 | inline void sfree (T *ptr, int n = 1) throw () |
226 | inline void sfree (T *ptr, int n = 1) throw () |
137 | { |
227 | { |
|
|
228 | #ifdef PREFER_MALLOC |
|
|
229 | free (ptr); |
|
|
230 | #else |
138 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
232 | #endif |
139 | } |
233 | } |
140 | |
234 | |
141 | // a STL-compatible allocator that uses g_slice |
235 | // a STL-compatible allocator that uses g_slice |
142 | // boy, this is verbose |
236 | // boy, this is verbose |
143 | template<typename Tp> |
237 | template<typename Tp> |
… | |
… | |
211 | |
305 | |
212 | void seed (uint32_t seed); |
306 | void seed (uint32_t seed); |
213 | uint32_t next (); |
307 | uint32_t next (); |
214 | |
308 | |
215 | // uniform distribution |
309 | // uniform distribution |
216 | uint32_t operator ()(uint32_t r_max) |
310 | uint32_t operator ()(uint32_t num) |
217 | { |
311 | { |
218 | return is_constant (r_max) |
312 | return is_constant (num) |
219 | ? this->next () % r_max |
313 | ? (next () * (uint64_t)num) >> 32U |
220 | : get_range (r_max); |
314 | : get_range (num); |
221 | } |
315 | } |
222 | |
316 | |
223 | // return a number within (min .. max) |
317 | // return a number within (min .. max) |
224 | int operator () (int r_min, int r_max) |
318 | int operator () (int r_min, int r_max) |
225 | { |
319 | { |
226 | return is_constant (r_min) && is_constant (r_max) |
320 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
227 | ? r_min + (*this) (max (r_max - r_min + 1, 1)) |
321 | ? r_min + operator ()(r_max - r_min + 1) |
228 | : get_range (r_min, r_max); |
322 | : get_range (r_min, r_max); |
229 | } |
323 | } |
230 | |
324 | |
231 | double operator ()() |
325 | double operator ()() |
232 | { |
326 | { |
… | |
… | |
348 | } |
442 | } |
349 | |
443 | |
350 | void erase (T *obj) |
444 | void erase (T *obj) |
351 | { |
445 | { |
352 | assert (obj->*index); |
446 | assert (obj->*index); |
353 | int pos = obj->*index; |
447 | unsigned int pos = obj->*index; |
354 | obj->*index = 0; |
448 | obj->*index = 0; |
355 | |
449 | |
356 | if (pos < this->size ()) |
450 | if (pos < this->size ()) |
357 | { |
451 | { |
358 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
452 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
383 | // return current time as timestampe |
477 | // return current time as timestampe |
384 | tstamp now (); |
478 | tstamp now (); |
385 | |
479 | |
386 | int similar_direction (int a, int b); |
480 | int similar_direction (int a, int b); |
387 | |
481 | |
388 | #endif |
482 | // like printf, but returns a std::string |
|
|
483 | const std::string format (const char *format, ...); |
389 | |
484 | |
|
|
485 | #endif |
|
|
486 | |