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 | |
26 | //#define PREFER_MALLOC |
25 | //#define PREFER_MALLOC |
|
|
26 | #define DEBUG_SALLOC |
27 | |
27 | |
28 | #if __GNUC__ >= 3 |
28 | #if __GNUC__ >= 3 |
29 | # define is_constant(c) __builtin_constant_p (c) |
29 | # define is_constant(c) __builtin_constant_p (c) |
30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
30 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
31 | # define prefetch(addr,rw,locality) __builtin_prefetch (addr, rw, locality) |
… | |
… | |
53 | #include <glib.h> |
53 | #include <glib.h> |
54 | |
54 | |
55 | #include <shstr.h> |
55 | #include <shstr.h> |
56 | #include <traits.h> |
56 | #include <traits.h> |
57 | |
57 | |
|
|
58 | #ifdef DEBUG_SALLOC |
|
|
59 | # define g_slice_alloc0(s) debug_slice_alloc0(s) |
|
|
60 | # define g_slice_alloc(s) debug_slice_alloc(s) |
|
|
61 | # define g_slice_free1(s,p) debug_slice_free1(s,p) |
|
|
62 | void *g_slice_alloc (unsigned long size); |
|
|
63 | void *g_slice_alloc0 (unsigned long size); |
|
|
64 | void g_slice_free1 (unsigned long size, void *ptr); |
|
|
65 | #endif |
|
|
66 | |
58 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
67 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
68 | #define auto(var,expr) decltype(expr) var = (expr) |
60 | |
69 | |
61 | // very ugly macro that basicaly declares and initialises a variable |
70 | // very ugly macro that basicaly declares and initialises a variable |
62 | // that is in scope for the next statement only |
71 | // that is in scope for the next statement only |
63 | // works only for stuff that can be assigned 0 and converts to false |
72 | // works only for stuff that can be assigned 0 and converts to false |
… | |
… | |
173 | absdir (int d) |
182 | absdir (int d) |
174 | { |
183 | { |
175 | return ((d - 1) & 7) + 1; |
184 | return ((d - 1) & 7) + 1; |
176 | } |
185 | } |
177 | |
186 | |
|
|
187 | extern size_t slice_alloc; // statistics |
|
|
188 | |
178 | // makes dynamically allocated objects zero-initialised |
189 | // makes dynamically allocated objects zero-initialised |
179 | struct zero_initialised |
190 | struct zero_initialised |
180 | { |
191 | { |
181 | void *operator new (size_t s, void *p) |
192 | void *operator new (size_t s, void *p) |
182 | { |
193 | { |
… | |
… | |
184 | return p; |
195 | return p; |
185 | } |
196 | } |
186 | |
197 | |
187 | void *operator new (size_t s) |
198 | void *operator new (size_t s) |
188 | { |
199 | { |
|
|
200 | slice_alloc += s; |
189 | return g_slice_alloc0 (s); |
201 | return g_slice_alloc0 (s); |
190 | } |
202 | } |
191 | |
203 | |
192 | void *operator new[] (size_t s) |
204 | void *operator new[] (size_t s) |
193 | { |
205 | { |
|
|
206 | slice_alloc += s; |
194 | return g_slice_alloc0 (s); |
207 | return g_slice_alloc0 (s); |
195 | } |
208 | } |
196 | |
209 | |
197 | void operator delete (void *p, size_t s) |
210 | void operator delete (void *p, size_t s) |
198 | { |
211 | { |
|
|
212 | slice_alloc -= s; |
199 | g_slice_free1 (s, p); |
213 | g_slice_free1 (s, p); |
200 | } |
214 | } |
201 | |
215 | |
202 | void operator delete[] (void *p, size_t s) |
216 | void operator delete[] (void *p, size_t s) |
203 | { |
217 | { |
|
|
218 | slice_alloc -= s; |
204 | g_slice_free1 (s, p); |
219 | g_slice_free1 (s, p); |
205 | } |
220 | } |
206 | }; |
221 | }; |
207 | |
222 | |
208 | void *salloc_ (int n) throw (std::bad_alloc); |
223 | void *salloc_ (int n) throw (std::bad_alloc); |
… | |
… | |
226 | inline void sfree (T *ptr, int n = 1) throw () |
241 | inline void sfree (T *ptr, int n = 1) throw () |
227 | { |
242 | { |
228 | #ifdef PREFER_MALLOC |
243 | #ifdef PREFER_MALLOC |
229 | free (ptr); |
244 | free (ptr); |
230 | #else |
245 | #else |
|
|
246 | slice_alloc -= n * sizeof (T); |
231 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
247 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
232 | #endif |
248 | #endif |
233 | } |
249 | } |
234 | |
250 | |
235 | // a STL-compatible allocator that uses g_slice |
251 | // a STL-compatible allocator that uses g_slice |
… | |
… | |
334 | |
350 | |
335 | typedef tausworthe_random_generator rand_gen; |
351 | typedef tausworthe_random_generator rand_gen; |
336 | |
352 | |
337 | extern rand_gen rndm; |
353 | extern rand_gen rndm; |
338 | |
354 | |
|
|
355 | INTERFACE_CLASS (attachable) |
|
|
356 | struct refcnt_base |
|
|
357 | { |
|
|
358 | typedef int refcnt_t; |
|
|
359 | mutable refcnt_t ACC (RW, refcnt); |
|
|
360 | |
|
|
361 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
362 | MTH void refcnt_dec () const { --refcnt; } |
|
|
363 | |
|
|
364 | refcnt_base () : refcnt (0) { } |
|
|
365 | }; |
|
|
366 | |
|
|
367 | // to avoid branches with more advanced compilers |
|
|
368 | extern refcnt_base::refcnt_t refcnt_dummy; |
|
|
369 | |
339 | template<class T> |
370 | template<class T> |
340 | struct refptr |
371 | struct refptr |
341 | { |
372 | { |
|
|
373 | // p if not null |
|
|
374 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
375 | |
|
|
376 | void refcnt_dec () |
|
|
377 | { |
|
|
378 | if (!is_constant (p)) |
|
|
379 | --*refcnt_ref (); |
|
|
380 | else if (p) |
|
|
381 | --p->refcnt; |
|
|
382 | } |
|
|
383 | |
|
|
384 | void refcnt_inc () |
|
|
385 | { |
|
|
386 | if (!is_constant (p)) |
|
|
387 | ++*refcnt_ref (); |
|
|
388 | else if (p) |
|
|
389 | ++p->refcnt; |
|
|
390 | } |
|
|
391 | |
342 | T *p; |
392 | T *p; |
343 | |
393 | |
344 | refptr () : p(0) { } |
394 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
395 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
396 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
397 | ~refptr () { refcnt_dec (); } |
348 | |
398 | |
349 | const refptr<T> &operator =(T *o) |
399 | const refptr<T> &operator =(T *o) |
350 | { |
400 | { |
|
|
401 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
402 | refcnt_dec (); |
352 | p = o; |
403 | p = o; |
353 | if (p) p->refcnt_inc (); |
404 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
405 | return *this; |
356 | } |
406 | } |
357 | |
407 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
408 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
409 | { |
360 | *this = o.p; |
410 | *this = o.p; |
361 | return *this; |
411 | return *this; |
362 | } |
412 | } |
363 | |
413 | |
364 | T &operator * () const { return *p; } |
414 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
415 | T *operator ->() const { return p; } |
366 | |
416 | |
367 | operator T *() const { return p; } |
417 | operator T *() const { return p; } |
368 | }; |
418 | }; |
369 | |
419 | |
370 | typedef refptr<maptile> maptile_ptr; |
420 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
405 | { |
455 | { |
406 | return !strcmp (a, b); |
456 | return !strcmp (a, b); |
407 | } |
457 | } |
408 | }; |
458 | }; |
409 | |
459 | |
|
|
460 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
461 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
462 | // |
|
|
463 | // NOTE: only some forms of erase are available |
410 | template<class T> |
464 | template<class T> |
411 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
465 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
412 | { |
466 | { |
413 | typedef typename unordered_vector::iterator iterator; |
467 | typedef typename unordered_vector::iterator iterator; |
414 | |
468 | |
… | |
… | |
424 | { |
478 | { |
425 | erase ((unsigned int )(i - this->begin ())); |
479 | erase ((unsigned int )(i - this->begin ())); |
426 | } |
480 | } |
427 | }; |
481 | }; |
428 | |
482 | |
429 | template<class T, int T::* index> |
483 | // This container blends advantages of linked lists |
|
|
484 | // (efficiency) with vectors (random access) by |
|
|
485 | // by using an unordered vector and storing the vector |
|
|
486 | // index inside the object. |
|
|
487 | // |
|
|
488 | // + memory-efficient on most 64 bit archs |
|
|
489 | // + O(1) insert/remove |
|
|
490 | // + free unique (but varying) id for inserted objects |
|
|
491 | // + cache-friendly iteration |
|
|
492 | // - only works for pointers to structs |
|
|
493 | // |
|
|
494 | // NOTE: only some forms of erase/insert are available |
|
|
495 | typedef int object_vector_index; |
|
|
496 | |
|
|
497 | template<class T, object_vector_index T::*indexmember> |
430 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
498 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
431 | { |
499 | { |
432 | typedef typename object_vector::iterator iterator; |
500 | typedef typename object_vector::iterator iterator; |
433 | |
501 | |
434 | bool contains (const T *obj) const |
502 | bool contains (const T *obj) const |
435 | { |
503 | { |
436 | return obj->*index; |
504 | return obj->*indexmember; |
437 | } |
505 | } |
438 | |
506 | |
439 | iterator find (const T *obj) |
507 | iterator find (const T *obj) |
440 | { |
508 | { |
441 | return obj->*index |
509 | return obj->*indexmember |
442 | ? this->begin () + obj->*index - 1 |
510 | ? this->begin () + obj->*indexmember - 1 |
443 | : this->end (); |
511 | : this->end (); |
444 | } |
512 | } |
445 | |
513 | |
|
|
514 | void push_back (T *obj) |
|
|
515 | { |
|
|
516 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
517 | obj->*indexmember = this->size (); |
|
|
518 | } |
|
|
519 | |
446 | void insert (T *obj) |
520 | void insert (T *obj) |
447 | { |
521 | { |
448 | assert (!(obj->*index)); |
|
|
449 | push_back (obj); |
522 | push_back (obj); |
450 | obj->*index = this->size (); |
|
|
451 | } |
523 | } |
452 | |
524 | |
453 | void insert (T &obj) |
525 | void insert (T &obj) |
454 | { |
526 | { |
455 | insert (&obj); |
527 | insert (&obj); |
456 | } |
528 | } |
457 | |
529 | |
458 | void erase (T *obj) |
530 | void erase (T *obj) |
459 | { |
531 | { |
460 | assert (obj->*index); |
|
|
461 | unsigned int pos = obj->*index; |
532 | unsigned int pos = obj->*indexmember; |
462 | obj->*index = 0; |
533 | obj->*indexmember = 0; |
463 | |
534 | |
464 | if (pos < this->size ()) |
535 | if (pos < this->size ()) |
465 | { |
536 | { |
466 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
537 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
467 | (*this)[pos - 1]->*index = pos; |
538 | (*this)[pos - 1]->*indexmember = pos; |
468 | } |
539 | } |
469 | |
540 | |
470 | this->pop_back (); |
541 | this->pop_back (); |
471 | } |
542 | } |
472 | |
543 | |
473 | void erase (T &obj) |
544 | void erase (T &obj) |
474 | { |
545 | { |
475 | errase (&obj); |
546 | erase (&obj); |
476 | } |
547 | } |
477 | }; |
548 | }; |
478 | |
549 | |
479 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
550 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
480 | void assign (char *dst, const char *src, int maxlen); |
551 | void assign (char *dst, const char *src, int maxlen); |
… | |
… | |
486 | assign ((char *)&dst, src, N); |
557 | assign ((char *)&dst, src, N); |
487 | } |
558 | } |
488 | |
559 | |
489 | typedef double tstamp; |
560 | typedef double tstamp; |
490 | |
561 | |
491 | // return current time as timestampe |
562 | // return current time as timestamp |
492 | tstamp now (); |
563 | tstamp now (); |
493 | |
564 | |
494 | int similar_direction (int a, int b); |
565 | int similar_direction (int a, int b); |
495 | |
566 | |
496 | // like printf, but returns a std::string |
567 | // like sprintf, but returns a "static" buffer |
497 | const std::string format (const char *format, ...); |
568 | const char *format (const char *format, ...); |
498 | |
569 | |
499 | #endif |
570 | #endif |
500 | |
571 | |