1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify |
7 | * it under the terms of the GNU General Public License as published by |
7 | * it under the terms of the GNU General Public License as published by |
8 | * the Free Software Foundation, either version 3 of the License, or |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * (at your option) any later version. |
9 | * (at your option) any later version. |
… | |
… | |
20 | */ |
20 | */ |
21 | |
21 | |
22 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
23 | #define UTIL_H__ |
23 | #define UTIL_H__ |
24 | |
24 | |
25 | #define DEBUG_POISON 0xaa // poison memory before freeing it if != 0 |
25 | #define DEBUG_POISON 0x00 // poison memory before freeing it if != 0 |
26 | #define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs |
26 | #define DEBUG_SALLOC 0 // add a debug wrapper around all sallocs |
27 | #define PREFER_MALLOC 0 // use malloc and not the slice allocator |
27 | #define PREFER_MALLOC 0 // use malloc and not the slice allocator |
28 | |
28 | |
29 | #if __GNUC__ >= 3 |
29 | #if __GNUC__ >= 3 |
30 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define is_constant(c) __builtin_constant_p (c) |
… | |
… | |
96 | // as a is often a constant while b is the variable. it is still a bug, though. |
96 | // as a is often a constant while b is the variable. it is still a bug, though. |
97 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
97 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
98 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
98 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
99 | 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; } |
99 | 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; } |
100 | |
100 | |
|
|
101 | template<typename T> static inline void min_it (T &v, T m) { v = min (v, m); } |
|
|
102 | template<typename T> static inline void max_it (T &v, T m) { v = max (v, m); } |
|
|
103 | template<typename T> static inline void clamp_it (T &v, T a, T b) { v = clamp (v, a, b); } |
|
|
104 | |
101 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
105 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
102 | |
106 | |
103 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
107 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
104 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
108 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
105 | |
109 | |
|
|
110 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
|
|
111 | template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; } |
|
|
112 | // div, round-up |
|
|
113 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
|
|
114 | // div, round-down |
|
|
115 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
|
|
116 | |
106 | template<typename T> |
117 | template<typename T> |
107 | static inline T |
118 | static inline T |
108 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
119 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
109 | { |
120 | { |
110 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
121 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
122 | } |
|
|
123 | |
|
|
124 | // lerp, round-down |
|
|
125 | template<typename T> |
|
|
126 | static inline T |
|
|
127 | lerp_rd (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
128 | { |
|
|
129 | return min_out + div_rd<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
|
|
130 | } |
|
|
131 | |
|
|
132 | // lerp, round-up |
|
|
133 | template<typename T> |
|
|
134 | static inline T |
|
|
135 | lerp_ru (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
136 | { |
|
|
137 | return min_out + div_ru<T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
111 | } |
138 | } |
112 | |
139 | |
113 | // lots of stuff taken from FXT |
140 | // lots of stuff taken from FXT |
114 | |
141 | |
115 | /* Rotate right. This is used in various places for checksumming */ |
142 | /* Rotate right. This is used in various places for checksumming */ |
… | |
… | |
224 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
251 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
225 | assert (slice_alloc >= 0);//D |
252 | assert (slice_alloc >= 0);//D |
226 | } |
253 | } |
227 | } |
254 | } |
228 | |
255 | |
|
|
256 | // nulls the pointer |
|
|
257 | template<typename T> |
|
|
258 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
259 | { |
|
|
260 | sfree<T> (ptr, n); |
|
|
261 | ptr = 0; |
|
|
262 | } |
|
|
263 | |
229 | // makes dynamically allocated objects zero-initialised |
264 | // makes dynamically allocated objects zero-initialised |
230 | struct zero_initialised |
265 | struct zero_initialised |
231 | { |
266 | { |
232 | void *operator new (size_t s, void *p) |
267 | void *operator new (size_t s, void *p) |
233 | { |
268 | { |
… | |
… | |
241 | } |
276 | } |
242 | |
277 | |
243 | void *operator new[] (size_t s) |
278 | void *operator new[] (size_t s) |
244 | { |
279 | { |
245 | return salloc0<char> (s); |
280 | return salloc0<char> (s); |
|
|
281 | } |
|
|
282 | |
|
|
283 | void operator delete (void *p, size_t s) |
|
|
284 | { |
|
|
285 | sfree ((char *)p, s); |
|
|
286 | } |
|
|
287 | |
|
|
288 | void operator delete[] (void *p, size_t s) |
|
|
289 | { |
|
|
290 | sfree ((char *)p, s); |
|
|
291 | } |
|
|
292 | }; |
|
|
293 | |
|
|
294 | // makes dynamically allocated objects zero-initialised |
|
|
295 | struct slice_allocated |
|
|
296 | { |
|
|
297 | void *operator new (size_t s, void *p) |
|
|
298 | { |
|
|
299 | return p; |
|
|
300 | } |
|
|
301 | |
|
|
302 | void *operator new (size_t s) |
|
|
303 | { |
|
|
304 | return salloc<char> (s); |
|
|
305 | } |
|
|
306 | |
|
|
307 | void *operator new[] (size_t s) |
|
|
308 | { |
|
|
309 | return salloc<char> (s); |
246 | } |
310 | } |
247 | |
311 | |
248 | void operator delete (void *p, size_t s) |
312 | void operator delete (void *p, size_t s) |
249 | { |
313 | { |
250 | sfree ((char *)p, s); |
314 | sfree ((char *)p, s); |
… | |
… | |
328 | } |
392 | } |
329 | |
393 | |
330 | void seed (uint32_t seed); |
394 | void seed (uint32_t seed); |
331 | uint32_t next (); |
395 | uint32_t next (); |
332 | |
396 | |
333 | // uniform distribution |
397 | // uniform distribution, 0 .. max (0, num - 1) |
334 | uint32_t operator ()(uint32_t num) |
398 | uint32_t operator ()(uint32_t num) |
335 | { |
399 | { |
336 | return is_constant (num) |
400 | return is_constant (num) |
337 | ? (next () * (uint64_t)num) >> 32U |
401 | ? (next () * (uint64_t)num) >> 32U |
338 | : get_range (num); |
402 | : get_range (num); |
… | |
… | |
356 | int get_range (int r_min, int r_max); |
420 | int get_range (int r_min, int r_max); |
357 | }; |
421 | }; |
358 | |
422 | |
359 | typedef tausworthe_random_generator rand_gen; |
423 | typedef tausworthe_random_generator rand_gen; |
360 | |
424 | |
361 | extern rand_gen rndm; |
425 | extern rand_gen rndm, rmg_rndm; |
362 | |
426 | |
363 | INTERFACE_CLASS (attachable) |
427 | INTERFACE_CLASS (attachable) |
364 | struct refcnt_base |
428 | struct refcnt_base |
365 | { |
429 | { |
366 | typedef int refcnt_t; |
430 | typedef int refcnt_t; |