1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * Deliantra is free software: you can redistribute it and/or modify |
7 | * under the terms of the GNU General Public License as published by the Free |
7 | * it under the terms of the GNU General Public License as published by |
8 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * any later version. |
9 | * (at your option) any later version. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, but |
11 | * This program is distributed in the hope that it will be useful, |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the GNU General Public License along |
16 | * You should have received a copy of the GNU General Public License |
17 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
18 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
19 | * |
18 | * |
20 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
20 | */ |
22 | |
21 | |
23 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
24 | #define UTIL_H__ |
23 | #define UTIL_H__ |
25 | |
24 | |
… | |
… | |
53 | #include <glib.h> |
52 | #include <glib.h> |
54 | |
53 | |
55 | #include <shstr.h> |
54 | #include <shstr.h> |
56 | #include <traits.h> |
55 | #include <traits.h> |
57 | |
56 | |
58 | // 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) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
60 | |
59 | |
61 | // very ugly macro that basicaly declares and initialises a variable |
60 | // very ugly macro that basicaly declares and initialises a variable |
62 | // that is in scope for the next statement only |
61 | // that is in scope for the next statement only |
63 | // 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 |
… | |
… | |
173 | absdir (int d) |
172 | absdir (int d) |
174 | { |
173 | { |
175 | return ((d - 1) & 7) + 1; |
174 | return ((d - 1) & 7) + 1; |
176 | } |
175 | } |
177 | |
176 | |
|
|
177 | extern size_t slice_alloc; // statistics |
|
|
178 | |
178 | // makes dynamically allocated objects zero-initialised |
179 | // makes dynamically allocated objects zero-initialised |
179 | struct zero_initialised |
180 | struct zero_initialised |
180 | { |
181 | { |
181 | void *operator new (size_t s, void *p) |
182 | void *operator new (size_t s, void *p) |
182 | { |
183 | { |
… | |
… | |
184 | return p; |
185 | return p; |
185 | } |
186 | } |
186 | |
187 | |
187 | void *operator new (size_t s) |
188 | void *operator new (size_t s) |
188 | { |
189 | { |
|
|
190 | slice_alloc += s; |
189 | return g_slice_alloc0 (s); |
191 | return g_slice_alloc0 (s); |
190 | } |
192 | } |
191 | |
193 | |
192 | void *operator new[] (size_t s) |
194 | void *operator new[] (size_t s) |
193 | { |
195 | { |
|
|
196 | slice_alloc += s; |
194 | return g_slice_alloc0 (s); |
197 | return g_slice_alloc0 (s); |
195 | } |
198 | } |
196 | |
199 | |
197 | void operator delete (void *p, size_t s) |
200 | void operator delete (void *p, size_t s) |
198 | { |
201 | { |
|
|
202 | slice_alloc -= s; |
199 | g_slice_free1 (s, p); |
203 | g_slice_free1 (s, p); |
200 | } |
204 | } |
201 | |
205 | |
202 | void operator delete[] (void *p, size_t s) |
206 | void operator delete[] (void *p, size_t s) |
203 | { |
207 | { |
|
|
208 | slice_alloc -= s; |
204 | g_slice_free1 (s, p); |
209 | g_slice_free1 (s, p); |
205 | } |
210 | } |
206 | }; |
211 | }; |
207 | |
212 | |
208 | void *salloc_ (int n) throw (std::bad_alloc); |
213 | void *salloc_ (int n) throw (std::bad_alloc); |
… | |
… | |
226 | inline void sfree (T *ptr, int n = 1) throw () |
231 | inline void sfree (T *ptr, int n = 1) throw () |
227 | { |
232 | { |
228 | #ifdef PREFER_MALLOC |
233 | #ifdef PREFER_MALLOC |
229 | free (ptr); |
234 | free (ptr); |
230 | #else |
235 | #else |
|
|
236 | slice_alloc -= n * sizeof (T); |
231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
237 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
232 | #endif |
238 | #endif |
233 | } |
239 | } |
234 | |
240 | |
235 | // a STL-compatible allocator that uses g_slice |
241 | // a STL-compatible allocator that uses g_slice |
… | |
… | |
334 | |
340 | |
335 | typedef tausworthe_random_generator rand_gen; |
341 | typedef tausworthe_random_generator rand_gen; |
336 | |
342 | |
337 | extern rand_gen rndm; |
343 | extern rand_gen rndm; |
338 | |
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 | |
339 | template<class T> |
360 | template<class T> |
340 | struct refptr |
361 | struct refptr |
341 | { |
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 | |
342 | T *p; |
382 | T *p; |
343 | |
383 | |
344 | refptr () : p(0) { } |
384 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
385 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
386 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
387 | ~refptr () { refcnt_dec (); } |
348 | |
388 | |
349 | const refptr<T> &operator =(T *o) |
389 | const refptr<T> &operator =(T *o) |
350 | { |
390 | { |
|
|
391 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
392 | refcnt_dec (); |
352 | p = o; |
393 | p = o; |
353 | if (p) p->refcnt_inc (); |
394 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
395 | return *this; |
356 | } |
396 | } |
357 | |
397 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
398 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
399 | { |
360 | *this = o.p; |
400 | *this = o.p; |
361 | return *this; |
401 | return *this; |
362 | } |
402 | } |
363 | |
403 | |
364 | T &operator * () const { return *p; } |
404 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
405 | T *operator ->() const { return p; } |
366 | |
406 | |
367 | operator T *() const { return p; } |
407 | operator T *() const { return p; } |
368 | }; |
408 | }; |
369 | |
409 | |
370 | typedef refptr<maptile> maptile_ptr; |
410 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
405 | { |
445 | { |
406 | return !strcmp (a, b); |
446 | return !strcmp (a, b); |
407 | } |
447 | } |
408 | }; |
448 | }; |
409 | |
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 |
410 | template<class T> |
454 | template<class T> |
411 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
455 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
412 | { |
456 | { |
413 | typedef typename unordered_vector::iterator iterator; |
457 | typedef typename unordered_vector::iterator iterator; |
414 | |
458 | |
… | |
… | |
424 | { |
468 | { |
425 | erase ((unsigned int )(i - this->begin ())); |
469 | erase ((unsigned int )(i - this->begin ())); |
426 | } |
470 | } |
427 | }; |
471 | }; |
428 | |
472 | |
429 | 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> |
430 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
488 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
431 | { |
489 | { |
432 | typedef typename object_vector::iterator iterator; |
490 | typedef typename object_vector::iterator iterator; |
433 | |
491 | |
434 | bool contains (const T *obj) const |
492 | bool contains (const T *obj) const |
435 | { |
493 | { |
436 | return obj->*index; |
494 | return obj->*indexmember; |
437 | } |
495 | } |
438 | |
496 | |
439 | iterator find (const T *obj) |
497 | iterator find (const T *obj) |
440 | { |
498 | { |
441 | return obj->*index |
499 | return obj->*indexmember |
442 | ? this->begin () + obj->*index - 1 |
500 | ? this->begin () + obj->*indexmember - 1 |
443 | : this->end (); |
501 | : this->end (); |
444 | } |
502 | } |
445 | |
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 | |
446 | void insert (T *obj) |
510 | void insert (T *obj) |
447 | { |
511 | { |
448 | assert (!(obj->*index)); |
|
|
449 | push_back (obj); |
512 | push_back (obj); |
450 | obj->*index = this->size (); |
|
|
451 | } |
513 | } |
452 | |
514 | |
453 | void insert (T &obj) |
515 | void insert (T &obj) |
454 | { |
516 | { |
455 | insert (&obj); |
517 | insert (&obj); |
456 | } |
518 | } |
457 | |
519 | |
458 | void erase (T *obj) |
520 | void erase (T *obj) |
459 | { |
521 | { |
460 | assert (obj->*index); |
|
|
461 | unsigned int pos = obj->*index; |
522 | unsigned int pos = obj->*indexmember; |
462 | obj->*index = 0; |
523 | obj->*indexmember = 0; |
463 | |
524 | |
464 | if (pos < this->size ()) |
525 | if (pos < this->size ()) |
465 | { |
526 | { |
466 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
527 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
467 | (*this)[pos - 1]->*index = pos; |
528 | (*this)[pos - 1]->*indexmember = pos; |
468 | } |
529 | } |
469 | |
530 | |
470 | this->pop_back (); |
531 | this->pop_back (); |
471 | } |
532 | } |
472 | |
533 | |
473 | void erase (T &obj) |
534 | void erase (T &obj) |
474 | { |
535 | { |
475 | errase (&obj); |
536 | erase (&obj); |
476 | } |
537 | } |
477 | }; |
538 | }; |
478 | |
539 | |
479 | // 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 |
480 | void assign (char *dst, const char *src, int maxlen); |
541 | void assign (char *dst, const char *src, int maxlen); |
… | |
… | |
491 | // return current time as timestampe |
552 | // return current time as timestampe |
492 | tstamp now (); |
553 | tstamp now (); |
493 | |
554 | |
494 | int similar_direction (int a, int b); |
555 | int similar_direction (int a, int b); |
495 | |
556 | |
496 | // like printf, but returns a std::string |
557 | // like sprintf, but returns a "static" buffer |
497 | const std::string format (const char *format, ...); |
558 | const char *format (const char *format, ...); |
498 | |
559 | |
499 | #endif |
560 | #endif |
500 | |
561 | |