… | |
… | |
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_SALLOC 0 |
25 | //#define PREFER_MALLOC |
26 | #define PREFER_MALLOC 0 |
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 | #if 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 | { |
… | |
… | |
228 | |
241 | |
229 | // for symmetry |
242 | // for symmetry |
230 | template<typename T> |
243 | template<typename T> |
231 | inline void sfree (T *ptr, int n = 1) throw () |
244 | inline void sfree (T *ptr, int n = 1) throw () |
232 | { |
245 | { |
233 | #ifdef PREFER_MALLOC |
246 | #if PREFER_MALLOC |
234 | free (ptr); |
247 | free (ptr); |
235 | #else |
248 | #else |
236 | slice_alloc -= n * sizeof (T); |
249 | slice_alloc -= n * sizeof (T); |
237 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
250 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
238 | #endif |
251 | #endif |
… | |
… | |
256 | { |
269 | { |
257 | typedef slice_allocator<U> other; |
270 | typedef slice_allocator<U> other; |
258 | }; |
271 | }; |
259 | |
272 | |
260 | slice_allocator () throw () { } |
273 | slice_allocator () throw () { } |
261 | slice_allocator (const slice_allocator &o) throw () { } |
274 | slice_allocator (const slice_allocator &) throw () { } |
262 | template<typename Tp2> |
275 | template<typename Tp2> |
263 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
276 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
264 | |
277 | |
265 | ~slice_allocator () { } |
278 | ~slice_allocator () { } |
266 | |
279 | |
… | |
… | |
275 | void deallocate (pointer p, size_type n) |
288 | void deallocate (pointer p, size_type n) |
276 | { |
289 | { |
277 | sfree<Tp> (p, n); |
290 | sfree<Tp> (p, n); |
278 | } |
291 | } |
279 | |
292 | |
280 | size_type max_size ()const throw () |
293 | size_type max_size () const throw () |
281 | { |
294 | { |
282 | return size_t (-1) / sizeof (Tp); |
295 | return size_t (-1) / sizeof (Tp); |
283 | } |
296 | } |
284 | |
297 | |
285 | void construct (pointer p, const Tp &val) |
298 | void construct (pointer p, const Tp &val) |