| … | |
… | |
| 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 DEBUG_POISON 0x00 // poison memory before freeing it if != 0 |
| 26 | #define PREFER_MALLOC 0 |
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 | |
28 | |
| 28 | #if __GNUC__ >= 3 |
29 | #if __GNUC__ >= 3 |
| 29 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define is_constant(c) __builtin_constant_p (c) |
| 30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
| 31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
| … | |
… | |
| 217 | inline void sfree (T *ptr, int n = 1) throw () |
218 | inline void sfree (T *ptr, int n = 1) throw () |
| 218 | { |
219 | { |
| 219 | if (expect_true (ptr)) |
220 | if (expect_true (ptr)) |
| 220 | { |
221 | { |
| 221 | slice_alloc -= n * sizeof (T); |
222 | slice_alloc -= n * sizeof (T); |
|
|
223 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
| 222 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
224 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
| 223 | assert (slice_alloc >= 0);//D |
225 | assert (slice_alloc >= 0);//D |
| 224 | } |
226 | } |
| 225 | } |
227 | } |
| 226 | |
228 | |
|
|
229 | // nulls the pointer |
|
|
230 | template<typename T> |
|
|
231 | inline void sfree0 (T *&ptr, int n = 1) throw () |
|
|
232 | { |
|
|
233 | sfree<T> (ptr, n); |
|
|
234 | ptr = 0; |
|
|
235 | } |
|
|
236 | |
| 227 | // makes dynamically allocated objects zero-initialised |
237 | // makes dynamically allocated objects zero-initialised |
| 228 | struct zero_initialised |
238 | struct zero_initialised |
| 229 | { |
239 | { |
| 230 | void *operator new (size_t s, void *p) |
240 | void *operator new (size_t s, void *p) |
| 231 | { |
241 | { |
| … | |
… | |
| 239 | } |
249 | } |
| 240 | |
250 | |
| 241 | void *operator new[] (size_t s) |
251 | void *operator new[] (size_t s) |
| 242 | { |
252 | { |
| 243 | return salloc0<char> (s); |
253 | return salloc0<char> (s); |
|
|
254 | } |
|
|
255 | |
|
|
256 | void operator delete (void *p, size_t s) |
|
|
257 | { |
|
|
258 | sfree ((char *)p, s); |
|
|
259 | } |
|
|
260 | |
|
|
261 | void operator delete[] (void *p, size_t s) |
|
|
262 | { |
|
|
263 | sfree ((char *)p, s); |
|
|
264 | } |
|
|
265 | }; |
|
|
266 | |
|
|
267 | // makes dynamically allocated objects zero-initialised |
|
|
268 | struct slice_allocated |
|
|
269 | { |
|
|
270 | void *operator new (size_t s, void *p) |
|
|
271 | { |
|
|
272 | return p; |
|
|
273 | } |
|
|
274 | |
|
|
275 | void *operator new (size_t s) |
|
|
276 | { |
|
|
277 | return salloc<char> (s); |
|
|
278 | } |
|
|
279 | |
|
|
280 | void *operator new[] (size_t s) |
|
|
281 | { |
|
|
282 | return salloc<char> (s); |
| 244 | } |
283 | } |
| 245 | |
284 | |
| 246 | void operator delete (void *p, size_t s) |
285 | void operator delete (void *p, size_t s) |
| 247 | { |
286 | { |
| 248 | sfree ((char *)p, s); |
287 | sfree ((char *)p, s); |
