|
|
1 | /* |
|
|
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
|
|
5 | * |
|
|
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 |
|
|
8 | * the Free Software Foundation, either version 3 of the License, or |
|
|
9 | * (at your option) any later version. |
|
|
10 | * |
|
|
11 | * This program is distributed in the hope that it will be useful, |
|
|
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
14 | * GNU General Public License for more details. |
|
|
15 | * |
|
|
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/>. |
|
|
18 | * |
|
|
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
|
|
20 | */ |
|
|
21 | |
1 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
2 | #define UTIL_H__ |
23 | #define UTIL_H__ |
3 | |
24 | |
4 | //#define PREFER_MALLOC |
25 | #define DEBUG_POISON 0x00 // poison memory before freeing it if != 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 |
5 | |
28 | |
6 | #if __GNUC__ >= 3 |
29 | #if __GNUC__ >= 3 |
7 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define is_constant(c) __builtin_constant_p (c) |
|
|
31 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
32 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
8 | #else |
33 | #else |
9 | # define is_constant(c) 0 |
34 | # define is_constant(c) 0 |
|
|
35 | # define expect(expr,value) (expr) |
|
|
36 | # define prefetch(addr,rw,locality) |
10 | #endif |
37 | #endif |
|
|
38 | |
|
|
39 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
40 | # define decltype(x) typeof(x) |
|
|
41 | #endif |
|
|
42 | |
|
|
43 | // put into ifs if you are very sure that the expression |
|
|
44 | // is mostly true or mosty false. note that these return |
|
|
45 | // booleans, not the expression. |
|
|
46 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
47 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
48 | |
|
|
49 | #include <pthread.h> |
11 | |
50 | |
12 | #include <cstddef> |
51 | #include <cstddef> |
13 | #include <cmath> |
52 | #include <cmath> |
14 | #include <new> |
53 | #include <new> |
15 | #include <vector> |
54 | #include <vector> |
… | |
… | |
17 | #include <glib.h> |
56 | #include <glib.h> |
18 | |
57 | |
19 | #include <shstr.h> |
58 | #include <shstr.h> |
20 | #include <traits.h> |
59 | #include <traits.h> |
21 | |
60 | |
|
|
61 | #if DEBUG_SALLOC |
|
|
62 | # define g_slice_alloc0(s) debug_slice_alloc0(s) |
|
|
63 | # define g_slice_alloc(s) debug_slice_alloc(s) |
|
|
64 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
|
|
65 | void *g_slice_alloc (unsigned long size); |
|
|
66 | void *g_slice_alloc0 (unsigned long size); |
|
|
67 | void g_slice_free1 (unsigned long size, void *ptr); |
|
|
68 | #elif PREFER_MALLOC |
|
|
69 | # define g_slice_alloc0(s) calloc (1, (s)) |
|
|
70 | # define g_slice_alloc(s) malloc ((s)) |
|
|
71 | # define g_slice_free1(s,p) free ((p)) |
|
|
72 | #endif |
|
|
73 | |
22 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
74 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
23 | #define auto(var,expr) typeof(expr) var = (expr) |
75 | #define auto(var,expr) decltype(expr) var = (expr) |
24 | |
76 | |
25 | // very ugly macro that basicaly declares and initialises a variable |
77 | // very ugly macro that basicaly declares and initialises a variable |
26 | // that is in scope for the next statement only |
78 | // that is in scope for the next statement only |
27 | // works only for stuff that can be assigned 0 and converts to false |
79 | // works only for stuff that can be assigned 0 and converts to false |
28 | // (note: works great for pointers) |
80 | // (note: works great for pointers) |
29 | // most ugly macro I ever wrote |
81 | // most ugly macro I ever wrote |
30 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
82 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
31 | |
83 | |
32 | // in range including end |
84 | // in range including end |
33 | #define IN_RANGE_INC(val,beg,end) \ |
85 | #define IN_RANGE_INC(val,beg,end) \ |
34 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
86 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
35 | |
87 | |
36 | // in range excluding end |
88 | // in range excluding end |
37 | #define IN_RANGE_EXC(val,beg,end) \ |
89 | #define IN_RANGE_EXC(val,beg,end) \ |
38 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
90 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
39 | |
91 | |
|
|
92 | void cleanup (const char *cause, bool make_core = false); |
40 | void fork_abort (const char *msg); |
93 | void fork_abort (const char *msg); |
41 | |
94 | |
42 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
95 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
43 | // 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. |
44 | 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; } |
45 | 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; } |
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; } |
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; } |
47 | |
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 | |
48 | 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; } |
|
|
106 | |
|
|
107 | template<typename T, typename U, typename V> static inline T min (T a, U b, V c) { return min (a, min (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)); } |
|
|
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 | |
|
|
117 | template<typename T> |
|
|
118 | static inline T |
|
|
119 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
120 | { |
|
|
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); |
|
|
138 | } |
49 | |
139 | |
50 | // lots of stuff taken from FXT |
140 | // lots of stuff taken from FXT |
51 | |
141 | |
52 | /* Rotate right. This is used in various places for checksumming */ |
142 | /* Rotate right. This is used in various places for checksumming */ |
53 | //TODO: that sucks, use a better checksum algo |
143 | //TODO: that sucks, use a better checksum algo |
… | |
… | |
130 | absdir (int d) |
220 | absdir (int d) |
131 | { |
221 | { |
132 | return ((d - 1) & 7) + 1; |
222 | return ((d - 1) & 7) + 1; |
133 | } |
223 | } |
134 | |
224 | |
|
|
225 | extern ssize_t slice_alloc; // statistics |
|
|
226 | |
|
|
227 | void *salloc_ (int n) throw (std::bad_alloc); |
|
|
228 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
|
|
229 | |
|
|
230 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
231 | template<typename T> |
|
|
232 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
233 | |
|
|
234 | // also copies src into the new area, like "memdup" |
|
|
235 | // if src is 0, clears the memory |
|
|
236 | template<typename T> |
|
|
237 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
238 | |
|
|
239 | // clears the memory |
|
|
240 | template<typename T> |
|
|
241 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
242 | |
|
|
243 | // for symmetry |
|
|
244 | template<typename T> |
|
|
245 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
246 | { |
|
|
247 | if (expect_true (ptr)) |
|
|
248 | { |
|
|
249 | slice_alloc -= n * sizeof (T); |
|
|
250 | if (DEBUG_POISON) memset (ptr, DEBUG_POISON, n * sizeof (T)); |
|
|
251 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
252 | assert (slice_alloc >= 0);//D |
|
|
253 | } |
|
|
254 | } |
|
|
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 | |
135 | // makes dynamically allocated objects zero-initialised |
264 | // makes dynamically allocated objects zero-initialised |
136 | struct zero_initialised |
265 | struct zero_initialised |
137 | { |
266 | { |
138 | void *operator new (size_t s, void *p) |
267 | void *operator new (size_t s, void *p) |
139 | { |
268 | { |
… | |
… | |
141 | return p; |
270 | return p; |
142 | } |
271 | } |
143 | |
272 | |
144 | void *operator new (size_t s) |
273 | void *operator new (size_t s) |
145 | { |
274 | { |
146 | return g_slice_alloc0 (s); |
275 | return salloc0<char> (s); |
147 | } |
276 | } |
148 | |
277 | |
149 | void *operator new[] (size_t s) |
278 | void *operator new[] (size_t s) |
150 | { |
279 | { |
151 | return g_slice_alloc0 (s); |
280 | return salloc0<char> (s); |
152 | } |
281 | } |
153 | |
282 | |
154 | void operator delete (void *p, size_t s) |
283 | void operator delete (void *p, size_t s) |
155 | { |
284 | { |
156 | g_slice_free1 (s, p); |
285 | sfree ((char *)p, s); |
157 | } |
286 | } |
158 | |
287 | |
159 | void operator delete[] (void *p, size_t s) |
288 | void operator delete[] (void *p, size_t s) |
160 | { |
289 | { |
161 | g_slice_free1 (s, p); |
290 | sfree ((char *)p, s); |
162 | } |
291 | } |
163 | }; |
292 | }; |
164 | |
293 | |
165 | void *salloc_ (int n) throw (std::bad_alloc); |
294 | // makes dynamically allocated objects zero-initialised |
166 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
295 | struct slice_allocated |
167 | |
|
|
168 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
169 | template<typename T> |
|
|
170 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
171 | |
|
|
172 | // also copies src into the new area, like "memdup" |
|
|
173 | // if src is 0, clears the memory |
|
|
174 | template<typename T> |
|
|
175 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
176 | |
|
|
177 | // clears the memory |
|
|
178 | template<typename T> |
|
|
179 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
180 | |
|
|
181 | // for symmetry |
|
|
182 | template<typename T> |
|
|
183 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
184 | { |
296 | { |
185 | #ifdef PREFER_MALLOC |
297 | void *operator new (size_t s, void *p) |
186 | free (ptr); |
298 | { |
187 | #else |
299 | return p; |
188 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
300 | } |
189 | #endif |
301 | |
190 | } |
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); |
|
|
310 | } |
|
|
311 | |
|
|
312 | void operator delete (void *p, size_t s) |
|
|
313 | { |
|
|
314 | sfree ((char *)p, s); |
|
|
315 | } |
|
|
316 | |
|
|
317 | void operator delete[] (void *p, size_t s) |
|
|
318 | { |
|
|
319 | sfree ((char *)p, s); |
|
|
320 | } |
|
|
321 | }; |
191 | |
322 | |
192 | // a STL-compatible allocator that uses g_slice |
323 | // a STL-compatible allocator that uses g_slice |
193 | // boy, this is verbose |
324 | // boy, this is verbose |
194 | template<typename Tp> |
325 | template<typename Tp> |
195 | struct slice_allocator |
326 | struct slice_allocator |
… | |
… | |
207 | { |
338 | { |
208 | typedef slice_allocator<U> other; |
339 | typedef slice_allocator<U> other; |
209 | }; |
340 | }; |
210 | |
341 | |
211 | slice_allocator () throw () { } |
342 | slice_allocator () throw () { } |
212 | slice_allocator (const slice_allocator &o) throw () { } |
343 | slice_allocator (const slice_allocator &) throw () { } |
213 | template<typename Tp2> |
344 | template<typename Tp2> |
214 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
345 | slice_allocator (const slice_allocator<Tp2> &) throw () { } |
215 | |
346 | |
216 | ~slice_allocator () { } |
347 | ~slice_allocator () { } |
217 | |
348 | |
… | |
… | |
226 | void deallocate (pointer p, size_type n) |
357 | void deallocate (pointer p, size_type n) |
227 | { |
358 | { |
228 | sfree<Tp> (p, n); |
359 | sfree<Tp> (p, n); |
229 | } |
360 | } |
230 | |
361 | |
231 | size_type max_size ()const throw () |
362 | size_type max_size () const throw () |
232 | { |
363 | { |
233 | return size_t (-1) / sizeof (Tp); |
364 | return size_t (-1) / sizeof (Tp); |
234 | } |
365 | } |
235 | |
366 | |
236 | void construct (pointer p, const Tp &val) |
367 | void construct (pointer p, const Tp &val) |
… | |
… | |
261 | } |
392 | } |
262 | |
393 | |
263 | void seed (uint32_t seed); |
394 | void seed (uint32_t seed); |
264 | uint32_t next (); |
395 | uint32_t next (); |
265 | |
396 | |
266 | // uniform distribution |
397 | // uniform distribution, 0 .. max (0, num - 1) |
267 | uint32_t operator ()(uint32_t r_max) |
398 | uint32_t operator ()(uint32_t num) |
268 | { |
399 | { |
269 | return is_constant (r_max) |
400 | return is_constant (num) |
270 | ? (next () * (uint64_t)r_max) >> 32U |
401 | ? (next () * (uint64_t)num) >> 32U |
271 | : get_range (r_max); |
402 | : get_range (num); |
272 | } |
403 | } |
273 | |
404 | |
274 | // return a number within (min .. max) |
405 | // return a number within (min .. max) |
275 | int operator () (int r_min, int r_max) |
406 | int operator () (int r_min, int r_max) |
276 | { |
407 | { |
277 | return is_constant (r_min) && is_constant (r_max) |
408 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
278 | ? r_min + operator ()(max (r_max - r_min + 1, 1)) |
409 | ? r_min + operator ()(r_max - r_min + 1) |
279 | : get_range (r_min, r_max); |
410 | : get_range (r_min, r_max); |
280 | } |
411 | } |
281 | |
412 | |
282 | double operator ()() |
413 | double operator ()() |
283 | { |
414 | { |
… | |
… | |
289 | int get_range (int r_min, int r_max); |
420 | int get_range (int r_min, int r_max); |
290 | }; |
421 | }; |
291 | |
422 | |
292 | typedef tausworthe_random_generator rand_gen; |
423 | typedef tausworthe_random_generator rand_gen; |
293 | |
424 | |
294 | extern rand_gen rndm; |
425 | extern rand_gen rndm, rmg_rndm; |
|
|
426 | |
|
|
427 | INTERFACE_CLASS (attachable) |
|
|
428 | struct refcnt_base |
|
|
429 | { |
|
|
430 | typedef int refcnt_t; |
|
|
431 | mutable refcnt_t ACC (RW, refcnt); |
|
|
432 | |
|
|
433 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
434 | MTH void refcnt_dec () const { --refcnt; } |
|
|
435 | |
|
|
436 | refcnt_base () : refcnt (0) { } |
|
|
437 | }; |
|
|
438 | |
|
|
439 | // to avoid branches with more advanced compilers |
|
|
440 | extern refcnt_base::refcnt_t refcnt_dummy; |
295 | |
441 | |
296 | template<class T> |
442 | template<class T> |
297 | struct refptr |
443 | struct refptr |
298 | { |
444 | { |
|
|
445 | // p if not null |
|
|
446 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
447 | |
|
|
448 | void refcnt_dec () |
|
|
449 | { |
|
|
450 | if (!is_constant (p)) |
|
|
451 | --*refcnt_ref (); |
|
|
452 | else if (p) |
|
|
453 | --p->refcnt; |
|
|
454 | } |
|
|
455 | |
|
|
456 | void refcnt_inc () |
|
|
457 | { |
|
|
458 | if (!is_constant (p)) |
|
|
459 | ++*refcnt_ref (); |
|
|
460 | else if (p) |
|
|
461 | ++p->refcnt; |
|
|
462 | } |
|
|
463 | |
299 | T *p; |
464 | T *p; |
300 | |
465 | |
301 | refptr () : p(0) { } |
466 | refptr () : p(0) { } |
302 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
467 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
303 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
468 | refptr (T *p) : p(p) { refcnt_inc (); } |
304 | ~refptr () { if (p) p->refcnt_dec (); } |
469 | ~refptr () { refcnt_dec (); } |
305 | |
470 | |
306 | const refptr<T> &operator =(T *o) |
471 | const refptr<T> &operator =(T *o) |
307 | { |
472 | { |
|
|
473 | // if decrementing ever destroys we need to reverse the order here |
308 | if (p) p->refcnt_dec (); |
474 | refcnt_dec (); |
309 | p = o; |
475 | p = o; |
310 | if (p) p->refcnt_inc (); |
476 | refcnt_inc (); |
311 | |
|
|
312 | return *this; |
477 | return *this; |
313 | } |
478 | } |
314 | |
479 | |
315 | const refptr<T> &operator =(const refptr<T> o) |
480 | const refptr<T> &operator =(const refptr<T> &o) |
316 | { |
481 | { |
317 | *this = o.p; |
482 | *this = o.p; |
318 | return *this; |
483 | return *this; |
319 | } |
484 | } |
320 | |
485 | |
321 | T &operator * () const { return *p; } |
486 | T &operator * () const { return *p; } |
322 | T *operator ->() const { return p; } |
487 | T *operator ->() const { return p; } |
323 | |
488 | |
324 | operator T *() const { return p; } |
489 | operator T *() const { return p; } |
325 | }; |
490 | }; |
326 | |
491 | |
327 | typedef refptr<maptile> maptile_ptr; |
492 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
362 | { |
527 | { |
363 | return !strcmp (a, b); |
528 | return !strcmp (a, b); |
364 | } |
529 | } |
365 | }; |
530 | }; |
366 | |
531 | |
|
|
532 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
533 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
534 | // |
|
|
535 | // NOTE: only some forms of erase are available |
367 | template<class T> |
536 | template<class T> |
368 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
537 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
369 | { |
538 | { |
370 | typedef typename unordered_vector::iterator iterator; |
539 | typedef typename unordered_vector::iterator iterator; |
371 | |
540 | |
… | |
… | |
381 | { |
550 | { |
382 | erase ((unsigned int )(i - this->begin ())); |
551 | erase ((unsigned int )(i - this->begin ())); |
383 | } |
552 | } |
384 | }; |
553 | }; |
385 | |
554 | |
386 | template<class T, int T::* index> |
555 | // This container blends advantages of linked lists |
|
|
556 | // (efficiency) with vectors (random access) by |
|
|
557 | // by using an unordered vector and storing the vector |
|
|
558 | // index inside the object. |
|
|
559 | // |
|
|
560 | // + memory-efficient on most 64 bit archs |
|
|
561 | // + O(1) insert/remove |
|
|
562 | // + free unique (but varying) id for inserted objects |
|
|
563 | // + cache-friendly iteration |
|
|
564 | // - only works for pointers to structs |
|
|
565 | // |
|
|
566 | // NOTE: only some forms of erase/insert are available |
|
|
567 | typedef int object_vector_index; |
|
|
568 | |
|
|
569 | template<class T, object_vector_index T::*indexmember> |
387 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
570 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
388 | { |
571 | { |
|
|
572 | typedef typename object_vector::iterator iterator; |
|
|
573 | |
|
|
574 | bool contains (const T *obj) const |
|
|
575 | { |
|
|
576 | return obj->*indexmember; |
|
|
577 | } |
|
|
578 | |
|
|
579 | iterator find (const T *obj) |
|
|
580 | { |
|
|
581 | return obj->*indexmember |
|
|
582 | ? this->begin () + obj->*indexmember - 1 |
|
|
583 | : this->end (); |
|
|
584 | } |
|
|
585 | |
|
|
586 | void push_back (T *obj) |
|
|
587 | { |
|
|
588 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
589 | obj->*indexmember = this->size (); |
|
|
590 | } |
|
|
591 | |
389 | void insert (T *obj) |
592 | void insert (T *obj) |
390 | { |
593 | { |
391 | assert (!(obj->*index)); |
|
|
392 | push_back (obj); |
594 | push_back (obj); |
393 | obj->*index = this->size (); |
|
|
394 | } |
595 | } |
395 | |
596 | |
396 | void insert (T &obj) |
597 | void insert (T &obj) |
397 | { |
598 | { |
398 | insert (&obj); |
599 | insert (&obj); |
399 | } |
600 | } |
400 | |
601 | |
401 | void erase (T *obj) |
602 | void erase (T *obj) |
402 | { |
603 | { |
403 | assert (obj->*index); |
|
|
404 | unsigned int pos = obj->*index; |
604 | unsigned int pos = obj->*indexmember; |
405 | obj->*index = 0; |
605 | obj->*indexmember = 0; |
406 | |
606 | |
407 | if (pos < this->size ()) |
607 | if (pos < this->size ()) |
408 | { |
608 | { |
409 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
609 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
410 | (*this)[pos - 1]->*index = pos; |
610 | (*this)[pos - 1]->*indexmember = pos; |
411 | } |
611 | } |
412 | |
612 | |
413 | this->pop_back (); |
613 | this->pop_back (); |
414 | } |
614 | } |
415 | |
615 | |
416 | void erase (T &obj) |
616 | void erase (T &obj) |
417 | { |
617 | { |
418 | errase (&obj); |
618 | erase (&obj); |
419 | } |
619 | } |
420 | }; |
620 | }; |
421 | |
621 | |
422 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
622 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
423 | void assign (char *dst, const char *src, int maxlen); |
623 | void assign (char *dst, const char *src, int maxlen); |
… | |
… | |
429 | assign ((char *)&dst, src, N); |
629 | assign ((char *)&dst, src, N); |
430 | } |
630 | } |
431 | |
631 | |
432 | typedef double tstamp; |
632 | typedef double tstamp; |
433 | |
633 | |
434 | // return current time as timestampe |
634 | // return current time as timestamp |
435 | tstamp now (); |
635 | tstamp now (); |
436 | |
636 | |
437 | int similar_direction (int a, int b); |
637 | int similar_direction (int a, int b); |
438 | |
638 | |
|
|
639 | // like sprintf, but returns a "static" buffer |
|
|
640 | const char *format (const char *format, ...); |
|
|
641 | |
|
|
642 | ///////////////////////////////////////////////////////////////////////////// |
|
|
643 | // threads, very very thin wrappers around pthreads |
|
|
644 | |
|
|
645 | struct thread |
|
|
646 | { |
|
|
647 | pthread_t id; |
|
|
648 | |
|
|
649 | void start (void *(*start_routine)(void *), void *arg = 0); |
|
|
650 | |
|
|
651 | void cancel () |
|
|
652 | { |
|
|
653 | pthread_cancel (id); |
|
|
654 | } |
|
|
655 | |
|
|
656 | void *join () |
|
|
657 | { |
|
|
658 | void *ret; |
|
|
659 | |
|
|
660 | if (pthread_join (id, &ret)) |
|
|
661 | cleanup ("pthread_join failed", 1); |
|
|
662 | |
|
|
663 | return ret; |
|
|
664 | } |
|
|
665 | }; |
|
|
666 | |
|
|
667 | // note that mutexes are not classes |
|
|
668 | typedef pthread_mutex_t smutex; |
|
|
669 | |
|
|
670 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
|
|
671 | #define SMUTEX_INITIALISER PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
|
|
672 | #else |
|
|
673 | #define SMUTEX_INITIALISER PTHREAD_MUTEX_INITIALIZER |
439 | #endif |
674 | #endif |
440 | |
675 | |
|
|
676 | #define SMUTEX(name) smutex name = SMUTEX_INITIALISER |
|
|
677 | #define SMUTEX_LOCK(name) pthread_mutex_lock (&(name)) |
|
|
678 | #define SMUTEX_UNLOCK(name) pthread_mutex_unlock (&(name)) |
|
|
679 | |
|
|
680 | typedef pthread_cond_t scond; |
|
|
681 | |
|
|
682 | #define SCOND(name) scond name = PTHREAD_COND_INITIALIZER |
|
|
683 | #define SCOND_SIGNAL(name) pthread_cond_signal (&(name)) |
|
|
684 | #define SCOND_BROADCAST(name) pthread_cond_broadcast (&(name)) |
|
|
685 | #define SCOND_WAIT(name,mutex) pthread_cond_wait (&(name), &(mutex)) |
|
|
686 | |
|
|
687 | #endif |
|
|
688 | |