|
|
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 | |
4 | //#define PREFER_MALLOC |
26 | //#define PREFER_MALLOC |
5 | |
27 | |
6 | #if __GNUC__ >= 3 |
28 | #if __GNUC__ >= 3 |
7 | # 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) |
8 | #else |
32 | #else |
9 | # define is_constant(c) 0 |
33 | # define is_constant(c) 0 |
|
|
34 | # define expect(expr,value) (expr) |
|
|
35 | # define prefetch(addr,rw,locality) |
10 | #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) |
11 | |
47 | |
12 | #include <cstddef> |
48 | #include <cstddef> |
13 | #include <cmath> |
49 | #include <cmath> |
14 | #include <new> |
50 | #include <new> |
15 | #include <vector> |
51 | #include <vector> |
… | |
… | |
18 | |
54 | |
19 | #include <shstr.h> |
55 | #include <shstr.h> |
20 | #include <traits.h> |
56 | #include <traits.h> |
21 | |
57 | |
22 | // 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 |
23 | #define AUTODECL(var,expr) typeof(expr) var = (expr) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
24 | |
60 | |
25 | // very ugly macro that basicaly declares and initialises a variable |
61 | // very ugly macro that basicaly declares and initialises a variable |
26 | // that is in scope for the next statement only |
62 | // that is in scope for the next statement only |
27 | // 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 |
28 | // (note: works great for pointers) |
64 | // (note: works great for pointers) |
… | |
… | |
45 | 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; } |
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; } |
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; } |
47 | |
83 | |
48 | 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; } |
49 | |
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 | |
50 | // lots of stuff taken from FXT |
93 | // lots of stuff taken from FXT |
51 | |
94 | |
52 | /* Rotate right. This is used in various places for checksumming */ |
95 | /* Rotate right. This is used in various places for checksumming */ |
53 | //TODO: this sucks, use a better checksum algo |
96 | //TODO: that sucks, use a better checksum algo |
54 | static inline uint32_t |
97 | static inline uint32_t |
55 | rotate_right (uint32_t c) |
98 | rotate_right (uint32_t c, uint32_t count = 1) |
56 | { |
99 | { |
57 | return (c << 31) | (c >> 1); |
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); |
58 | } |
107 | } |
59 | |
108 | |
60 | // Return abs(a-b) |
109 | // Return abs(a-b) |
61 | // Both a and b must not have the most significant bit set |
110 | // Both a and b must not have the most significant bit set |
62 | static inline uint32_t |
111 | static inline uint32_t |
… | |
… | |
256 | |
305 | |
257 | void seed (uint32_t seed); |
306 | void seed (uint32_t seed); |
258 | uint32_t next (); |
307 | uint32_t next (); |
259 | |
308 | |
260 | // uniform distribution |
309 | // uniform distribution |
261 | uint32_t operator ()(uint32_t r_max) |
310 | uint32_t operator ()(uint32_t num) |
262 | { |
311 | { |
263 | return is_constant (r_max) |
312 | return is_constant (num) |
264 | ? this->next () % r_max |
313 | ? (next () * (uint64_t)num) >> 32U |
265 | : get_range (r_max); |
314 | : get_range (num); |
266 | } |
315 | } |
267 | |
316 | |
268 | // return a number within (min .. max) |
317 | // return a number within (min .. max) |
269 | int operator () (int r_min, int r_max) |
318 | int operator () (int r_min, int r_max) |
270 | { |
319 | { |
271 | return is_constant (r_min) && is_constant (r_max) |
320 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
272 | ? r_min + (*this) (max (r_max - r_min + 1, 1)) |
321 | ? r_min + operator ()(r_max - r_min + 1) |
273 | : get_range (r_min, r_max); |
322 | : get_range (r_min, r_max); |
274 | } |
323 | } |
275 | |
324 | |
276 | double operator ()() |
325 | double operator ()() |
277 | { |
326 | { |
… | |
… | |
393 | } |
442 | } |
394 | |
443 | |
395 | void erase (T *obj) |
444 | void erase (T *obj) |
396 | { |
445 | { |
397 | assert (obj->*index); |
446 | assert (obj->*index); |
398 | int pos = obj->*index; |
447 | unsigned int pos = obj->*index; |
399 | obj->*index = 0; |
448 | obj->*index = 0; |
400 | |
449 | |
401 | if (pos < this->size ()) |
450 | if (pos < this->size ()) |
402 | { |
451 | { |
403 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
452 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
… | |
… | |
428 | // return current time as timestampe |
477 | // return current time as timestampe |
429 | tstamp now (); |
478 | tstamp now (); |
430 | |
479 | |
431 | int similar_direction (int a, int b); |
480 | int similar_direction (int a, int b); |
432 | |
481 | |
433 | #endif |
482 | // like printf, but returns a std::string |
|
|
483 | const std::string format (const char *format, ...); |
434 | |
484 | |
|
|
485 | #endif |
|
|
486 | |