|
|
1 | /* |
|
|
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 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 PREFER_MALLOC |
5 | |
26 | |
6 | #if __GNUC__ >= 3 |
27 | #if __GNUC__ >= 3 |
7 | # define is_constant(c) __builtin_constant_p (c) |
28 | # define is_constant(c) __builtin_constant_p (c) |
|
|
29 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
30 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
8 | #else |
31 | #else |
9 | # define is_constant(c) 0 |
32 | # define is_constant(c) 0 |
|
|
33 | # define expect(expr,value) (expr) |
|
|
34 | # define prefetch(addr,rw,locality) |
10 | #endif |
35 | #endif |
|
|
36 | |
|
|
37 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
38 | # define decltype(x) typeof(x) |
|
|
39 | #endif |
|
|
40 | |
|
|
41 | // put into ifs if you are very sure that the expression |
|
|
42 | // is mostly true or mosty false. note that these return |
|
|
43 | // booleans, not the expression. |
|
|
44 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
45 | #define expect_true(expr) expect ((expr) != 0, 1) |
11 | |
46 | |
12 | #include <cstddef> |
47 | #include <cstddef> |
13 | #include <cmath> |
48 | #include <cmath> |
14 | #include <new> |
49 | #include <new> |
15 | #include <vector> |
50 | #include <vector> |
… | |
… | |
17 | #include <glib.h> |
52 | #include <glib.h> |
18 | |
53 | |
19 | #include <shstr.h> |
54 | #include <shstr.h> |
20 | #include <traits.h> |
55 | #include <traits.h> |
21 | |
56 | |
22 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
23 | #define auto(var,expr) typeof(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
24 | |
59 | |
25 | // very ugly macro that basicaly declares and initialises a variable |
60 | // very ugly macro that basicaly declares and initialises a variable |
26 | // that is in scope for the next statement only |
61 | // that is in scope for the next statement only |
27 | // works only for stuff that can be assigned 0 and converts to false |
62 | // works only for stuff that can be assigned 0 and converts to false |
28 | // (note: works great for pointers) |
63 | // (note: works great for pointers) |
29 | // most ugly macro I ever wrote |
64 | // most ugly macro I ever wrote |
30 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
65 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
31 | |
66 | |
32 | // in range including end |
67 | // in range including end |
33 | #define IN_RANGE_INC(val,beg,end) \ |
68 | #define IN_RANGE_INC(val,beg,end) \ |
34 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
69 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
35 | |
70 | |
… | |
… | |
44 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
79 | 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; } |
80 | 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; } |
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; } |
47 | |
82 | |
48 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
83 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
84 | |
|
|
85 | template<typename T> |
|
|
86 | static inline T |
|
|
87 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
|
|
88 | { |
|
|
89 | return (val - min_in) * (max_out - min_out) / (max_in - min_in) + min_out; |
|
|
90 | } |
49 | |
91 | |
50 | // lots of stuff taken from FXT |
92 | // lots of stuff taken from FXT |
51 | |
93 | |
52 | /* Rotate right. This is used in various places for checksumming */ |
94 | /* Rotate right. This is used in various places for checksumming */ |
53 | //TODO: that sucks, use a better checksum algo |
95 | //TODO: that sucks, use a better checksum algo |
… | |
… | |
130 | absdir (int d) |
172 | absdir (int d) |
131 | { |
173 | { |
132 | return ((d - 1) & 7) + 1; |
174 | return ((d - 1) & 7) + 1; |
133 | } |
175 | } |
134 | |
176 | |
|
|
177 | extern size_t slice_alloc; // statistics |
|
|
178 | |
135 | // makes dynamically allocated objects zero-initialised |
179 | // makes dynamically allocated objects zero-initialised |
136 | struct zero_initialised |
180 | struct zero_initialised |
137 | { |
181 | { |
138 | void *operator new (size_t s, void *p) |
182 | void *operator new (size_t s, void *p) |
139 | { |
183 | { |
… | |
… | |
141 | return p; |
185 | return p; |
142 | } |
186 | } |
143 | |
187 | |
144 | void *operator new (size_t s) |
188 | void *operator new (size_t s) |
145 | { |
189 | { |
|
|
190 | slice_alloc += s; |
146 | return g_slice_alloc0 (s); |
191 | return g_slice_alloc0 (s); |
147 | } |
192 | } |
148 | |
193 | |
149 | void *operator new[] (size_t s) |
194 | void *operator new[] (size_t s) |
150 | { |
195 | { |
|
|
196 | slice_alloc += s; |
151 | return g_slice_alloc0 (s); |
197 | return g_slice_alloc0 (s); |
152 | } |
198 | } |
153 | |
199 | |
154 | void operator delete (void *p, size_t s) |
200 | void operator delete (void *p, size_t s) |
155 | { |
201 | { |
|
|
202 | slice_alloc -= s; |
156 | g_slice_free1 (s, p); |
203 | g_slice_free1 (s, p); |
157 | } |
204 | } |
158 | |
205 | |
159 | void operator delete[] (void *p, size_t s) |
206 | void operator delete[] (void *p, size_t s) |
160 | { |
207 | { |
|
|
208 | slice_alloc -= s; |
161 | g_slice_free1 (s, p); |
209 | g_slice_free1 (s, p); |
162 | } |
210 | } |
163 | }; |
211 | }; |
164 | |
212 | |
165 | void *salloc_ (int n) throw (std::bad_alloc); |
213 | void *salloc_ (int n) throw (std::bad_alloc); |
… | |
… | |
183 | inline void sfree (T *ptr, int n = 1) throw () |
231 | inline void sfree (T *ptr, int n = 1) throw () |
184 | { |
232 | { |
185 | #ifdef PREFER_MALLOC |
233 | #ifdef PREFER_MALLOC |
186 | free (ptr); |
234 | free (ptr); |
187 | #else |
235 | #else |
|
|
236 | slice_alloc -= n * sizeof (T); |
188 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
237 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
189 | #endif |
238 | #endif |
190 | } |
239 | } |
191 | |
240 | |
192 | // a STL-compatible allocator that uses g_slice |
241 | // a STL-compatible allocator that uses g_slice |
… | |
… | |
262 | |
311 | |
263 | void seed (uint32_t seed); |
312 | void seed (uint32_t seed); |
264 | uint32_t next (); |
313 | uint32_t next (); |
265 | |
314 | |
266 | // uniform distribution |
315 | // uniform distribution |
267 | uint32_t operator ()(uint32_t r_max) |
316 | uint32_t operator ()(uint32_t num) |
268 | { |
317 | { |
269 | return is_constant (r_max) |
318 | return is_constant (num) |
270 | ? (next () * (uint64_t)r_max) >> 32U |
319 | ? (next () * (uint64_t)num) >> 32U |
271 | : get_range (r_max); |
320 | : get_range (num); |
272 | } |
321 | } |
273 | |
322 | |
274 | // return a number within (min .. max) |
323 | // return a number within (min .. max) |
275 | int operator () (int r_min, int r_max) |
324 | int operator () (int r_min, int r_max) |
276 | { |
325 | { |
277 | return is_constant (r_min) && is_constant (r_max) |
326 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
278 | ? r_min + operator ()(max (r_max - r_min + 1, 1)) |
327 | ? r_min + operator ()(r_max - r_min + 1) |
279 | : get_range (r_min, r_max); |
328 | : get_range (r_min, r_max); |
280 | } |
329 | } |
281 | |
330 | |
282 | double operator ()() |
331 | double operator ()() |
283 | { |
332 | { |
… | |
… | |
291 | |
340 | |
292 | typedef tausworthe_random_generator rand_gen; |
341 | typedef tausworthe_random_generator rand_gen; |
293 | |
342 | |
294 | extern rand_gen rndm; |
343 | extern rand_gen rndm; |
295 | |
344 | |
|
|
345 | INTERFACE_CLASS (attachable) |
|
|
346 | struct refcnt_base |
|
|
347 | { |
|
|
348 | typedef int refcnt_t; |
|
|
349 | mutable refcnt_t ACC (RW, refcnt); |
|
|
350 | |
|
|
351 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
352 | MTH void refcnt_dec () const { --refcnt; } |
|
|
353 | |
|
|
354 | refcnt_base () : refcnt (0) { } |
|
|
355 | }; |
|
|
356 | |
|
|
357 | // to avoid branches with more advanced compilers |
|
|
358 | extern refcnt_base::refcnt_t refcnt_dummy; |
|
|
359 | |
296 | template<class T> |
360 | template<class T> |
297 | struct refptr |
361 | struct refptr |
298 | { |
362 | { |
|
|
363 | // p if not null |
|
|
364 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
365 | |
|
|
366 | void refcnt_dec () |
|
|
367 | { |
|
|
368 | if (!is_constant (p)) |
|
|
369 | --*refcnt_ref (); |
|
|
370 | else if (p) |
|
|
371 | --p->refcnt; |
|
|
372 | } |
|
|
373 | |
|
|
374 | void refcnt_inc () |
|
|
375 | { |
|
|
376 | if (!is_constant (p)) |
|
|
377 | ++*refcnt_ref (); |
|
|
378 | else if (p) |
|
|
379 | ++p->refcnt; |
|
|
380 | } |
|
|
381 | |
299 | T *p; |
382 | T *p; |
300 | |
383 | |
301 | refptr () : p(0) { } |
384 | refptr () : p(0) { } |
302 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
385 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
303 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
386 | refptr (T *p) : p(p) { refcnt_inc (); } |
304 | ~refptr () { if (p) p->refcnt_dec (); } |
387 | ~refptr () { refcnt_dec (); } |
305 | |
388 | |
306 | const refptr<T> &operator =(T *o) |
389 | const refptr<T> &operator =(T *o) |
307 | { |
390 | { |
|
|
391 | // if decrementing ever destroys we need to reverse the order here |
308 | if (p) p->refcnt_dec (); |
392 | refcnt_dec (); |
309 | p = o; |
393 | p = o; |
310 | if (p) p->refcnt_inc (); |
394 | refcnt_inc (); |
311 | |
|
|
312 | return *this; |
395 | return *this; |
313 | } |
396 | } |
314 | |
397 | |
315 | const refptr<T> &operator =(const refptr<T> o) |
398 | const refptr<T> &operator =(const refptr<T> &o) |
316 | { |
399 | { |
317 | *this = o.p; |
400 | *this = o.p; |
318 | return *this; |
401 | return *this; |
319 | } |
402 | } |
320 | |
403 | |
321 | T &operator * () const { return *p; } |
404 | T &operator * () const { return *p; } |
322 | T *operator ->() const { return p; } |
405 | T *operator ->() const { return p; } |
323 | |
406 | |
324 | operator T *() const { return p; } |
407 | operator T *() const { return p; } |
325 | }; |
408 | }; |
326 | |
409 | |
327 | typedef refptr<maptile> maptile_ptr; |
410 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
362 | { |
445 | { |
363 | return !strcmp (a, b); |
446 | return !strcmp (a, b); |
364 | } |
447 | } |
365 | }; |
448 | }; |
366 | |
449 | |
|
|
450 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
451 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
452 | // |
|
|
453 | // NOTE: only some forms of erase are available |
367 | template<class T> |
454 | template<class T> |
368 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
455 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
369 | { |
456 | { |
370 | typedef typename unordered_vector::iterator iterator; |
457 | typedef typename unordered_vector::iterator iterator; |
371 | |
458 | |
… | |
… | |
381 | { |
468 | { |
382 | erase ((unsigned int )(i - this->begin ())); |
469 | erase ((unsigned int )(i - this->begin ())); |
383 | } |
470 | } |
384 | }; |
471 | }; |
385 | |
472 | |
386 | template<class T, int T::* index> |
473 | // This container blends advantages of linked lists |
|
|
474 | // (efficiency) with vectors (random access) by |
|
|
475 | // by using an unordered vector and storing the vector |
|
|
476 | // index inside the object. |
|
|
477 | // |
|
|
478 | // + memory-efficient on most 64 bit archs |
|
|
479 | // + O(1) insert/remove |
|
|
480 | // + free unique (but varying) id for inserted objects |
|
|
481 | // + cache-friendly iteration |
|
|
482 | // - only works for pointers to structs |
|
|
483 | // |
|
|
484 | // NOTE: only some forms of erase/insert are available |
|
|
485 | typedef int object_vector_index; |
|
|
486 | |
|
|
487 | template<class T, object_vector_index T::*indexmember> |
387 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
488 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
388 | { |
489 | { |
|
|
490 | typedef typename object_vector::iterator iterator; |
|
|
491 | |
|
|
492 | bool contains (const T *obj) const |
|
|
493 | { |
|
|
494 | return obj->*indexmember; |
|
|
495 | } |
|
|
496 | |
|
|
497 | iterator find (const T *obj) |
|
|
498 | { |
|
|
499 | return obj->*indexmember |
|
|
500 | ? this->begin () + obj->*indexmember - 1 |
|
|
501 | : this->end (); |
|
|
502 | } |
|
|
503 | |
|
|
504 | void push_back (T *obj) |
|
|
505 | { |
|
|
506 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
507 | obj->*indexmember = this->size (); |
|
|
508 | } |
|
|
509 | |
389 | void insert (T *obj) |
510 | void insert (T *obj) |
390 | { |
511 | { |
391 | assert (!(obj->*index)); |
|
|
392 | push_back (obj); |
512 | push_back (obj); |
393 | obj->*index = this->size (); |
|
|
394 | } |
513 | } |
395 | |
514 | |
396 | void insert (T &obj) |
515 | void insert (T &obj) |
397 | { |
516 | { |
398 | insert (&obj); |
517 | insert (&obj); |
399 | } |
518 | } |
400 | |
519 | |
401 | void erase (T *obj) |
520 | void erase (T *obj) |
402 | { |
521 | { |
403 | assert (obj->*index); |
|
|
404 | unsigned int pos = obj->*index; |
522 | unsigned int pos = obj->*indexmember; |
405 | obj->*index = 0; |
523 | obj->*indexmember = 0; |
406 | |
524 | |
407 | if (pos < this->size ()) |
525 | if (pos < this->size ()) |
408 | { |
526 | { |
409 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
527 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
410 | (*this)[pos - 1]->*index = pos; |
528 | (*this)[pos - 1]->*indexmember = pos; |
411 | } |
529 | } |
412 | |
530 | |
413 | this->pop_back (); |
531 | this->pop_back (); |
414 | } |
532 | } |
415 | |
533 | |
416 | void erase (T &obj) |
534 | void erase (T &obj) |
417 | { |
535 | { |
418 | errase (&obj); |
536 | erase (&obj); |
419 | } |
537 | } |
420 | }; |
538 | }; |
421 | |
539 | |
422 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
540 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
423 | void assign (char *dst, const char *src, int maxlen); |
541 | void assign (char *dst, const char *src, int maxlen); |
… | |
… | |
434 | // return current time as timestampe |
552 | // return current time as timestampe |
435 | tstamp now (); |
553 | tstamp now (); |
436 | |
554 | |
437 | int similar_direction (int a, int b); |
555 | int similar_direction (int a, int b); |
438 | |
556 | |
|
|
557 | // like sprintf, but returns a "static" buffer |
|
|
558 | const char *format (const char *format, ...); |
|
|
559 | |
439 | #endif |
560 | #endif |
440 | |
561 | |