ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/utils.C
(Generate patch)

Comparing deliantra/server/common/utils.C (file contents):
Revision 1.68 by root, Thu Nov 8 19:43:24 2007 UTC vs.
Revision 1.76 by root, Mon Apr 21 23:35:24 2008 UTC

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
41refcnt_base::refcnt_t refcnt_dummy; 40refcnt_base::refcnt_t refcnt_dummy;
42size_t slice_alloc; 41ssize_t slice_alloc;
43rand_gen rndm; 42rand_gen rndm;
44 43
45void 44void
46tausworthe_random_generator::seed (uint32_t seed) 45tausworthe_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
472void *salloc_ (int n) throw (std::bad_alloc) 471void *salloc_ (int n) throw (std::bad_alloc)
473{ 472{
474#ifdef 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
487void *salloc_ (int n, void *src) throw (std::bad_alloc) 482void *salloc_ (int n, void *src) throw (std::bad_alloc)
488{ 483{
… …
493 else 488 else
494 memset (ptr, 0, n); 489 memset (ptr, 0, n);
495 490
496 return ptr; 491 return ptr;
497} 492}
493
494/******************************************************************************/
495
496#if DEBUG_SALLOC
497
498#define MAGIC 0xa1b2c35543deadLL
499
500void *g_slice_alloc (unsigned long size)
501{
502 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
503 *p++ = size ^ MAGIC;
504 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
505 return (void *)p;
506}
507
508void *g_slice_alloc0 (unsigned long size)
509{
510 return memset (g_slice_alloc (size), 0, size);
511}
512
513void g_slice_free1 (unsigned long size, void *ptr)
514{
515 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
516 if (expect_true (ptr))
517 {
518 unsigned long *p = (unsigned long *)ptr;
519 unsigned long s = *--p ^ MAGIC;
520
521 if (size != (unsigned long)(*p ^ MAGIC))
522 {
523 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
524 abort ();
525 }
526
527 *p = MAGIC;
528
529 (g_slice_free1)(s + sizeof (unsigned long), p);
530 }
531}
532
533#endif
534
535/******************************************************************************/
498 536
499void assign (char *dst, const char *src, int maxlen) 537void assign (char *dst, const char *src, int maxlen)
500{ 538{
501 if (!src) 539 if (!src)
502 src = ""; 540 src = "";
… …
608 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 646 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
609 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 647 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
610 0x2d02ef8dL 648 0x2d02ef8dL
611}; 649};
612 650
651void thread::start (void *(*start_routine)(void *), void *arg)
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
663 sigset_t fullsigset, oldsigset;
664 sigfillset (&fullsigset);
665
666 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
667
668 if (pthread_create (&id, &attr, start_routine, arg))
669 cleanup ("unable to create a new thread");
670
671 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
672}
673

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines