1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra 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 |
… | |
… | |
31 | #include <sys/time.h> |
31 | #include <sys/time.h> |
32 | #include <time.h> |
32 | #include <time.h> |
33 | #include <signal.h> |
33 | #include <signal.h> |
34 | |
34 | |
35 | #include <global.h> |
35 | #include <global.h> |
36 | #include <funcpoint.h> |
|
|
37 | #include <material.h> |
36 | #include <material.h> |
38 | |
37 | |
39 | #include <glib.h> |
38 | #include <glib.h> |
40 | |
39 | |
41 | refcnt_base::refcnt_t refcnt_dummy; |
40 | refcnt_base::refcnt_t refcnt_dummy; |
42 | size_t slice_alloc; |
41 | ssize_t slice_alloc; |
43 | rand_gen rndm; |
42 | rand_gen rndm; |
44 | |
43 | |
45 | void |
44 | void |
46 | tausworthe_random_generator::seed (uint32_t seed) |
45 | tausworthe_random_generator::seed (uint32_t seed) |
47 | { |
46 | { |
48 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
49 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
48 | 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; |
49 | 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; |
50 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
52 | |
51 | |
53 | for (int i = 11; --i; ) |
52 | for (int i = 11; --i; ) |
54 | operator ()(); |
53 | operator ()(); |
55 | } |
54 | } |
56 | |
55 | |
… | |
… | |
469 | LOG (llevError, "fork abort: %s\n", msg); |
468 | LOG (llevError, "fork abort: %s\n", msg); |
470 | } |
469 | } |
471 | |
470 | |
472 | void *salloc_ (int n) throw (std::bad_alloc) |
471 | void *salloc_ (int n) throw (std::bad_alloc) |
473 | { |
472 | { |
474 | #if PREFER_MALLOC |
|
|
475 | void *ptr = malloc (n); |
|
|
476 | #else |
|
|
477 | slice_alloc += n; |
|
|
478 | void *ptr = g_slice_alloc (n); |
473 | void *ptr = g_slice_alloc (n); |
479 | #endif |
|
|
480 | |
474 | |
481 | if (!ptr) |
475 | if (!ptr) |
482 | throw std::bad_alloc (); |
476 | throw std::bad_alloc (); |
483 | |
477 | |
|
|
478 | slice_alloc += n; |
484 | return ptr; |
479 | return ptr; |
485 | } |
480 | } |
486 | |
481 | |
487 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
482 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
488 | { |
483 | { |
… | |
… | |
515 | return memset (g_slice_alloc (size), 0, size); |
510 | return memset (g_slice_alloc (size), 0, size); |
516 | } |
511 | } |
517 | |
512 | |
518 | void g_slice_free1 (unsigned long size, void *ptr) |
513 | void g_slice_free1 (unsigned long size, void *ptr) |
519 | { |
514 | { |
|
|
515 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
520 | if (expect_true (ptr)) |
516 | if (expect_true (ptr)) |
521 | { |
517 | { |
522 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
523 | unsigned long *p = (unsigned long *)ptr; |
518 | unsigned long *p = (unsigned long *)ptr; |
524 | unsigned long s = *--p ^ MAGIC; |
519 | unsigned long s = *--p ^ MAGIC; |
525 | |
520 | |
526 | if (size != (unsigned long)(*p ^ MAGIC)) |
521 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
522 | { |
527 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
523 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
524 | abort (); |
|
|
525 | } |
528 | |
526 | |
529 | *p = MAGIC; |
527 | *p = MAGIC; |
530 | |
528 | |
531 | (g_slice_free1)(s + sizeof (unsigned long), p); |
529 | (g_slice_free1)(s + sizeof (unsigned long), p); |
532 | } |
530 | } |
… | |
… | |
650 | 0x2d02ef8dL |
648 | 0x2d02ef8dL |
651 | }; |
649 | }; |
652 | |
650 | |
653 | void thread::start (void *(*start_routine)(void *), void *arg) |
651 | void thread::start (void *(*start_routine)(void *), void *arg) |
654 | { |
652 | { |
|
|
653 | pthread_attr_t attr; |
|
|
654 | |
|
|
655 | pthread_attr_init (&attr); |
|
|
656 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
657 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
658 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
659 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
660 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
661 | #endif |
|
|
662 | |
655 | sigset_t fullsigset, oldsigset; |
663 | sigset_t fullsigset, oldsigset; |
656 | sigfillset (&fullsigset); |
664 | sigfillset (&fullsigset); |
657 | |
665 | |
658 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
666 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
659 | |
667 | |
660 | if (pthread_create (&id, 0, start_routine, arg)) |
668 | if (pthread_create (&id, &attr, start_routine, arg)) |
661 | cleanup ("unable to create a new thread"); |
669 | cleanup ("unable to create a new thread"); |
662 | |
670 | |
663 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
671 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
664 | } |
672 | } |
|
|
673 | |