| 1 | /* |
1 | /* |
| 2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
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,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
| 6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 | * |
7 | * |
| 8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
| 9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
| 11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
| 12 | * |
12 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
| … | |
… | |
| 16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
| 17 | * |
17 | * |
| 18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 20 | * |
20 | * |
| 21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
22 | */ |
| 23 | |
23 | |
| 24 | /* |
24 | /* |
| 25 | * General convenience functions for crossfire. |
25 | * General convenience functions for crossfire. |
| 26 | */ |
26 | */ |
| … | |
… | |
| 37 | #include <material.h> |
37 | #include <material.h> |
| 38 | |
38 | |
| 39 | #include <glib.h> |
39 | #include <glib.h> |
| 40 | |
40 | |
| 41 | refcnt_base::refcnt_t refcnt_dummy; |
41 | refcnt_base::refcnt_t refcnt_dummy; |
| 42 | |
42 | ssize_t slice_alloc; |
| 43 | rand_gen rndm; |
43 | rand_gen rndm; |
| 44 | |
44 | |
| 45 | void |
45 | void |
| 46 | tausworthe_random_generator::seed (uint32_t seed) |
46 | tausworthe_random_generator::seed (uint32_t seed) |
| 47 | { |
47 | { |
| 48 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
| 49 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
49 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
| 50 | state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
50 | state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
| 51 | state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U; |
51 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
| 52 | |
52 | |
| 53 | for (int i = 11; --i; ) |
53 | for (int i = 11; --i; ) |
| 54 | operator ()(); |
54 | operator ()(); |
| 55 | } |
55 | } |
| 56 | |
56 | |
| … | |
… | |
| 469 | LOG (llevError, "fork abort: %s\n", msg); |
469 | LOG (llevError, "fork abort: %s\n", msg); |
| 470 | } |
470 | } |
| 471 | |
471 | |
| 472 | void *salloc_ (int n) throw (std::bad_alloc) |
472 | void *salloc_ (int n) throw (std::bad_alloc) |
| 473 | { |
473 | { |
| 474 | #ifdef PREFER_MALLOC |
|
|
| 475 | void *ptr = malloc (n); |
|
|
| 476 | #else |
|
|
| 477 | void *ptr = g_slice_alloc (n); |
474 | void *ptr = g_slice_alloc (n); |
| 478 | #endif |
|
|
| 479 | |
475 | |
| 480 | if (!ptr) |
476 | if (!ptr) |
| 481 | throw std::bad_alloc (); |
477 | throw std::bad_alloc (); |
| 482 | |
478 | |
|
|
479 | slice_alloc += n; |
| 483 | return ptr; |
480 | return ptr; |
| 484 | } |
481 | } |
| 485 | |
482 | |
| 486 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
483 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
| 487 | { |
484 | { |
| … | |
… | |
| 492 | else |
489 | else |
| 493 | memset (ptr, 0, n); |
490 | memset (ptr, 0, n); |
| 494 | |
491 | |
| 495 | return ptr; |
492 | return ptr; |
| 496 | } |
493 | } |
|
|
494 | |
|
|
495 | /******************************************************************************/ |
|
|
496 | |
|
|
497 | #if DEBUG_SALLOC |
|
|
498 | |
|
|
499 | #define MAGIC 0xa1b2c35543deadLL |
|
|
500 | |
|
|
501 | void *g_slice_alloc (unsigned long size) |
|
|
502 | { |
|
|
503 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
|
|
504 | *p++ = size ^ MAGIC; |
|
|
505 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
|
|
506 | return (void *)p; |
|
|
507 | } |
|
|
508 | |
|
|
509 | void *g_slice_alloc0 (unsigned long size) |
|
|
510 | { |
|
|
511 | return memset (g_slice_alloc (size), 0, size); |
|
|
512 | } |
|
|
513 | |
|
|
514 | void g_slice_free1 (unsigned long size, void *ptr) |
|
|
515 | { |
|
|
516 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
517 | if (expect_true (ptr)) |
|
|
518 | { |
|
|
519 | unsigned long *p = (unsigned long *)ptr; |
|
|
520 | unsigned long s = *--p ^ MAGIC; |
|
|
521 | |
|
|
522 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
523 | { |
|
|
524 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
525 | abort (); |
|
|
526 | } |
|
|
527 | |
|
|
528 | *p = MAGIC; |
|
|
529 | |
|
|
530 | (g_slice_free1)(s + sizeof (unsigned long), p); |
|
|
531 | } |
|
|
532 | } |
|
|
533 | |
|
|
534 | #endif |
|
|
535 | |
|
|
536 | /******************************************************************************/ |
| 497 | |
537 | |
| 498 | void assign (char *dst, const char *src, int maxlen) |
538 | void assign (char *dst, const char *src, int maxlen) |
| 499 | { |
539 | { |
| 500 | if (!src) |
540 | if (!src) |
| 501 | src = ""; |
541 | src = ""; |
| … | |
… | |
| 607 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
647 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
| 608 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
648 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
| 609 | 0x2d02ef8dL |
649 | 0x2d02ef8dL |
| 610 | }; |
650 | }; |
| 611 | |
651 | |
|
|
652 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
653 | { |
|
|
654 | pthread_attr_t attr; |
|
|
655 | |
|
|
656 | pthread_attr_init (&attr); |
|
|
657 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
658 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
659 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
660 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
661 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
662 | #endif |
|
|
663 | |
|
|
664 | sigset_t fullsigset, oldsigset; |
|
|
665 | sigfillset (&fullsigset); |
|
|
666 | |
|
|
667 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
668 | |
|
|
669 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
670 | cleanup ("unable to create a new thread"); |
|
|
671 | |
|
|
672 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
673 | } |
|
|
674 | |
