|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * |
|
|
6 | * Crossfire TRT 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 <crossfire@schmorp.de> |
|
|
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 | |
… | |
… | |
11 | # define is_constant(c) 0 |
32 | # define is_constant(c) 0 |
12 | # define expect(expr,value) (expr) |
33 | # define expect(expr,value) (expr) |
13 | # define prefetch(addr,rw,locality) |
34 | # define prefetch(addr,rw,locality) |
14 | #endif |
35 | #endif |
15 | |
36 | |
|
|
37 | #if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4) |
|
|
38 | # define decltype(x) typeof(x) |
|
|
39 | #endif |
|
|
40 | |
16 | // put into ifs if you are very sure that the expression |
41 | // put into ifs if you are very sure that the expression |
17 | // is mostly true or mosty false. note that these return |
42 | // is mostly true or mosty false. note that these return |
18 | // booleans, not the expression. |
43 | // booleans, not the expression. |
19 | #define expect_false(expr) expect ((expr) != 0, 0) |
44 | #define expect_false(expr) expect ((expr) != 0, 0) |
20 | #define expect_true(expr) expect ((expr) != 0, 1) |
45 | #define expect_true(expr) expect ((expr) != 0, 1) |
… | |
… | |
27 | #include <glib.h> |
52 | #include <glib.h> |
28 | |
53 | |
29 | #include <shstr.h> |
54 | #include <shstr.h> |
30 | #include <traits.h> |
55 | #include <traits.h> |
31 | |
56 | |
32 | // 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) |
33 | #define auto(var,expr) typeof(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
34 | |
59 | |
35 | // very ugly macro that basicaly declares and initialises a variable |
60 | // very ugly macro that basicaly declares and initialises a variable |
36 | // that is in scope for the next statement only |
61 | // that is in scope for the next statement only |
37 | // 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 |
38 | // (note: works great for pointers) |
63 | // (note: works great for pointers) |
39 | // most ugly macro I ever wrote |
64 | // most ugly macro I ever wrote |
40 | #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) |
41 | |
66 | |
42 | // in range including end |
67 | // in range including end |
43 | #define IN_RANGE_INC(val,beg,end) \ |
68 | #define IN_RANGE_INC(val,beg,end) \ |
44 | ((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)) |
45 | |
70 | |
… | |
… | |
308 | |
333 | |
309 | typedef tausworthe_random_generator rand_gen; |
334 | typedef tausworthe_random_generator rand_gen; |
310 | |
335 | |
311 | extern rand_gen rndm; |
336 | extern rand_gen rndm; |
312 | |
337 | |
|
|
338 | INTERFACE_CLASS (attachable) |
|
|
339 | struct refcnt_base |
|
|
340 | { |
|
|
341 | typedef int refcnt_t; |
|
|
342 | mutable refcnt_t ACC (RW, refcnt); |
|
|
343 | |
|
|
344 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
345 | MTH void refcnt_dec () const { --refcnt; } |
|
|
346 | |
|
|
347 | refcnt_base () : refcnt (0) { } |
|
|
348 | }; |
|
|
349 | |
|
|
350 | extern refcnt_base::refcnt_t refcnt_dummy; |
|
|
351 | |
313 | template<class T> |
352 | template<class T> |
314 | struct refptr |
353 | struct refptr |
315 | { |
354 | { |
|
|
355 | // p if not null |
|
|
356 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
357 | |
|
|
358 | void refcnt_dec () |
|
|
359 | { |
|
|
360 | if (!is_constant (p)) |
|
|
361 | --*refcnt_ref (); |
|
|
362 | else if (p) |
|
|
363 | --p->refcnt; |
|
|
364 | } |
|
|
365 | |
|
|
366 | void refcnt_inc () |
|
|
367 | { |
|
|
368 | if (!is_constant (p)) |
|
|
369 | ++*refcnt_ref (); |
|
|
370 | else if (p) |
|
|
371 | ++p->refcnt; |
|
|
372 | } |
|
|
373 | |
316 | T *p; |
374 | T *p; |
317 | |
375 | |
318 | refptr () : p(0) { } |
376 | refptr () : p(0) { } |
319 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
377 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
320 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
378 | refptr (T *p) : p(p) { refcnt_inc (); } |
321 | ~refptr () { if (p) p->refcnt_dec (); } |
379 | ~refptr () { refcnt_dec (); } |
322 | |
380 | |
323 | const refptr<T> &operator =(T *o) |
381 | const refptr<T> &operator =(T *o) |
324 | { |
382 | { |
|
|
383 | // if decrementing ever destroys we need to reverse the order here |
325 | if (p) p->refcnt_dec (); |
384 | refcnt_dec (); |
326 | p = o; |
385 | p = o; |
327 | if (p) p->refcnt_inc (); |
386 | refcnt_inc (); |
328 | |
|
|
329 | return *this; |
387 | return *this; |
330 | } |
388 | } |
331 | |
389 | |
332 | const refptr<T> &operator =(const refptr<T> o) |
390 | const refptr<T> &operator =(const refptr<T> &o) |
333 | { |
391 | { |
334 | *this = o.p; |
392 | *this = o.p; |
335 | return *this; |
393 | return *this; |
336 | } |
394 | } |
337 | |
395 | |
338 | T &operator * () const { return *p; } |
396 | T &operator * () const { return *p; } |
339 | T *operator ->() const { return p; } |
397 | T *operator ->() const { return p; } |
340 | |
398 | |
341 | operator T *() const { return p; } |
399 | operator T *() const { return p; } |
342 | }; |
400 | }; |
343 | |
401 | |
344 | typedef refptr<maptile> maptile_ptr; |
402 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
379 | { |
437 | { |
380 | return !strcmp (a, b); |
438 | return !strcmp (a, b); |
381 | } |
439 | } |
382 | }; |
440 | }; |
383 | |
441 | |
|
|
442 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
443 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
444 | // |
|
|
445 | // NOTE: only some forms of erase are available |
384 | template<class T> |
446 | template<class T> |
385 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
447 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
386 | { |
448 | { |
387 | typedef typename unordered_vector::iterator iterator; |
449 | typedef typename unordered_vector::iterator iterator; |
388 | |
450 | |
… | |
… | |
398 | { |
460 | { |
399 | erase ((unsigned int )(i - this->begin ())); |
461 | erase ((unsigned int )(i - this->begin ())); |
400 | } |
462 | } |
401 | }; |
463 | }; |
402 | |
464 | |
403 | template<class T, int T::* index> |
465 | // This container blends advantages of linked lists |
|
|
466 | // (efficiency) with vectors (random access) by |
|
|
467 | // by using an unordered vector and storing the vector |
|
|
468 | // index inside the object. |
|
|
469 | // |
|
|
470 | // + memory-efficient on most 64 bit archs |
|
|
471 | // + O(1) insert/remove |
|
|
472 | // + free unique (but varying) id for inserted objects |
|
|
473 | // + cache-friendly iteration |
|
|
474 | // - only works for pointers to structs |
|
|
475 | // |
|
|
476 | // NOTE: only some forms of erase/insert are available |
|
|
477 | typedef int object_vector_index; |
|
|
478 | |
|
|
479 | template<class T, object_vector_index T::*indexmember> |
404 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
480 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
405 | { |
481 | { |
|
|
482 | typedef typename object_vector::iterator iterator; |
|
|
483 | |
|
|
484 | bool contains (const T *obj) const |
|
|
485 | { |
|
|
486 | return obj->*indexmember; |
|
|
487 | } |
|
|
488 | |
|
|
489 | iterator find (const T *obj) |
|
|
490 | { |
|
|
491 | return obj->*indexmember |
|
|
492 | ? this->begin () + obj->*indexmember - 1 |
|
|
493 | : this->end (); |
|
|
494 | } |
|
|
495 | |
|
|
496 | void push_back (T *obj) |
|
|
497 | { |
|
|
498 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
499 | obj->*indexmember = this->size (); |
|
|
500 | } |
|
|
501 | |
406 | void insert (T *obj) |
502 | void insert (T *obj) |
407 | { |
503 | { |
408 | assert (!(obj->*index)); |
|
|
409 | push_back (obj); |
504 | push_back (obj); |
410 | obj->*index = this->size (); |
|
|
411 | } |
505 | } |
412 | |
506 | |
413 | void insert (T &obj) |
507 | void insert (T &obj) |
414 | { |
508 | { |
415 | insert (&obj); |
509 | insert (&obj); |
416 | } |
510 | } |
417 | |
511 | |
418 | void erase (T *obj) |
512 | void erase (T *obj) |
419 | { |
513 | { |
420 | assert (obj->*index); |
|
|
421 | unsigned int pos = obj->*index; |
514 | unsigned int pos = obj->*indexmember; |
422 | obj->*index = 0; |
515 | obj->*indexmember = 0; |
423 | |
516 | |
424 | if (pos < this->size ()) |
517 | if (pos < this->size ()) |
425 | { |
518 | { |
426 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
519 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
427 | (*this)[pos - 1]->*index = pos; |
520 | (*this)[pos - 1]->*indexmember = pos; |
428 | } |
521 | } |
429 | |
522 | |
430 | this->pop_back (); |
523 | this->pop_back (); |
431 | } |
524 | } |
432 | |
525 | |
433 | void erase (T &obj) |
526 | void erase (T &obj) |
434 | { |
527 | { |
435 | errase (&obj); |
528 | erase (&obj); |
436 | } |
529 | } |
437 | }; |
530 | }; |
438 | |
531 | |
439 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
532 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
440 | void assign (char *dst, const char *src, int maxlen); |
533 | void assign (char *dst, const char *src, int maxlen); |