1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Crossfire TRT 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. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
… | |
… | |
14 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the GNU General Public License |
16 | * You should have received a copy of the GNU General Public License |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
18 | * |
18 | * |
19 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | */ |
20 | */ |
21 | |
21 | |
22 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
23 | #define UTIL_H__ |
23 | #define UTIL_H__ |
24 | |
24 | |
25 | //#define PREFER_MALLOC |
25 | //#define PREFER_MALLOC |
|
|
26 | #define DEBUG_SALLOC |
26 | |
27 | |
27 | #if __GNUC__ >= 3 |
28 | #if __GNUC__ >= 3 |
28 | # define is_constant(c) __builtin_constant_p (c) |
29 | # define is_constant(c) __builtin_constant_p (c) |
29 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
30 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
… | |
… | |
52 | #include <glib.h> |
53 | #include <glib.h> |
53 | |
54 | |
54 | #include <shstr.h> |
55 | #include <shstr.h> |
55 | #include <traits.h> |
56 | #include <traits.h> |
56 | |
57 | |
|
|
58 | #ifdef DEBUG_SALLOC |
|
|
59 | # define g_slice_alloc0(s) debug_slice_alloc0(s) |
|
|
60 | # define g_slice_alloc(s) debug_slice_alloc(s) |
|
|
61 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
|
|
62 | void *g_slice_alloc (unsigned long size); |
|
|
63 | void *g_slice_alloc0 (unsigned long size); |
|
|
64 | void g_slice_free1 (unsigned long size, void *ptr); |
|
|
65 | #endif |
|
|
66 | |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
67 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
68 | #define auto(var,expr) decltype(expr) var = (expr) |
59 | |
69 | |
60 | // very ugly macro that basicaly declares and initialises a variable |
70 | // very ugly macro that basicaly declares and initialises a variable |
61 | // that is in scope for the next statement only |
71 | // that is in scope for the next statement only |
… | |
… | |
79 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
89 | 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 max (T a, U b) { return (U)a > b ? (U)a : b; } |
90 | 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, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
91 | 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 | |
92 | |
83 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
93 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
94 | |
|
|
95 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (b, c)); } |
|
|
96 | template<typename T, typename U, typename V> static inline T max (T a, U b, V c) { return max (a, max (b, c)); } |
84 | |
97 | |
85 | template<typename T> |
98 | template<typename T> |
86 | static inline T |
99 | static inline T |
87 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
100 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
88 | { |
101 | { |
… | |
… | |
172 | absdir (int d) |
185 | absdir (int d) |
173 | { |
186 | { |
174 | return ((d - 1) & 7) + 1; |
187 | return ((d - 1) & 7) + 1; |
175 | } |
188 | } |
176 | |
189 | |
|
|
190 | extern size_t slice_alloc; // statistics |
|
|
191 | |
177 | // makes dynamically allocated objects zero-initialised |
192 | // makes dynamically allocated objects zero-initialised |
178 | struct zero_initialised |
193 | struct zero_initialised |
179 | { |
194 | { |
180 | void *operator new (size_t s, void *p) |
195 | void *operator new (size_t s, void *p) |
181 | { |
196 | { |
… | |
… | |
183 | return p; |
198 | return p; |
184 | } |
199 | } |
185 | |
200 | |
186 | void *operator new (size_t s) |
201 | void *operator new (size_t s) |
187 | { |
202 | { |
|
|
203 | slice_alloc += s; |
188 | return g_slice_alloc0 (s); |
204 | return g_slice_alloc0 (s); |
189 | } |
205 | } |
190 | |
206 | |
191 | void *operator new[] (size_t s) |
207 | void *operator new[] (size_t s) |
192 | { |
208 | { |
|
|
209 | slice_alloc += s; |
193 | return g_slice_alloc0 (s); |
210 | return g_slice_alloc0 (s); |
194 | } |
211 | } |
195 | |
212 | |
196 | void operator delete (void *p, size_t s) |
213 | void operator delete (void *p, size_t s) |
197 | { |
214 | { |
|
|
215 | slice_alloc -= s; |
198 | g_slice_free1 (s, p); |
216 | g_slice_free1 (s, p); |
199 | } |
217 | } |
200 | |
218 | |
201 | void operator delete[] (void *p, size_t s) |
219 | void operator delete[] (void *p, size_t s) |
202 | { |
220 | { |
|
|
221 | slice_alloc -= s; |
203 | g_slice_free1 (s, p); |
222 | g_slice_free1 (s, p); |
204 | } |
223 | } |
205 | }; |
224 | }; |
206 | |
225 | |
207 | void *salloc_ (int n) throw (std::bad_alloc); |
226 | void *salloc_ (int n) throw (std::bad_alloc); |
… | |
… | |
225 | inline void sfree (T *ptr, int n = 1) throw () |
244 | inline void sfree (T *ptr, int n = 1) throw () |
226 | { |
245 | { |
227 | #ifdef PREFER_MALLOC |
246 | #ifdef PREFER_MALLOC |
228 | free (ptr); |
247 | free (ptr); |
229 | #else |
248 | #else |
|
|
249 | slice_alloc -= n * sizeof (T); |
230 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
250 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
231 | #endif |
251 | #endif |
232 | } |
252 | } |
233 | |
253 | |
234 | // a STL-compatible allocator that uses g_slice |
254 | // a STL-compatible allocator that uses g_slice |
… | |
… | |
249 | { |
269 | { |
250 | typedef slice_allocator<U> other; |
270 | typedef slice_allocator<U> other; |
251 | }; |
271 | }; |
252 | |
272 | |
253 | slice_allocator () throw () { } |
273 | slice_allocator () throw () { } |
254 | slice_allocator (const slice_allocator &o) throw () { } |
274 | slice_allocator (const slice_allocator &) throw () { } |
255 | template<typename Tp2> |
275 | template<typename Tp2> |
256 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
276 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
257 | |
277 | |
258 | ~slice_allocator () { } |
278 | ~slice_allocator () { } |
259 | |
279 | |
… | |
… | |
268 | void deallocate (pointer p, size_type n) |
288 | void deallocate (pointer p, size_type n) |
269 | { |
289 | { |
270 | sfree<Tp> (p, n); |
290 | sfree<Tp> (p, n); |
271 | } |
291 | } |
272 | |
292 | |
273 | size_type max_size ()const throw () |
293 | size_type max_size () const throw () |
274 | { |
294 | { |
275 | return size_t (-1) / sizeof (Tp); |
295 | return size_t (-1) / sizeof (Tp); |
276 | } |
296 | } |
277 | |
297 | |
278 | void construct (pointer p, const Tp &val) |
298 | void construct (pointer p, const Tp &val) |
… | |
… | |
540 | assign ((char *)&dst, src, N); |
560 | assign ((char *)&dst, src, N); |
541 | } |
561 | } |
542 | |
562 | |
543 | typedef double tstamp; |
563 | typedef double tstamp; |
544 | |
564 | |
545 | // return current time as timestampe |
565 | // return current time as timestamp |
546 | tstamp now (); |
566 | tstamp now (); |
547 | |
567 | |
548 | int similar_direction (int a, int b); |
568 | int similar_direction (int a, int b); |
549 | |
569 | |
550 | // like sprintf, but returns a "static" buffer |
570 | // like sprintf, but returns a "static" buffer |