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.70 by root, Fri Jan 25 18:09:23 2008 UTC vs.
Revision 1.81 by root, Wed Sep 10 21:29:39 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
38#include <sys/time.h>
39#include <sys/resource.h>
40
39#include <glib.h> 41#include <glib.h>
40 42
41refcnt_base::refcnt_t refcnt_dummy; 43refcnt_base::refcnt_t refcnt_dummy;
42size_t slice_alloc; 44ssize_t slice_alloc;
43rand_gen rndm; 45rand_gen rndm, rmg_rndm;
44 46
45void 47void
46tausworthe_random_generator::seed (uint32_t seed) 48tausworthe_random_generator::seed (uint32_t seed)
47{ 49{
48 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 50 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
49 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; 51 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; 52 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; 53 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
52 54
53 for (int i = 11; --i; ) 55 for (int i = 11; --i; )
54 operator ()(); 56 operator ()();
55} 57}
56 58
94 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 96 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
95 */ 97 */
96int 98int
97random_roll (int r_min, int r_max, const object *op, int goodbad) 99random_roll (int r_min, int r_max, const object *op, int goodbad)
98{ 100{
101 r_max = max (r_min, r_max);
102
99 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 103 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
100
101 if (r_max < r_min)
102 {
103 LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
104 return r_min;
105 }
106 104
107 if (op->type == PLAYER) 105 if (op->type == PLAYER)
108 { 106 {
109 int luck = op->stats.luck; 107 int luck = op->stats.luck;
110 108
120/* 118/*
121 * This is a 64 bit version of random_roll above. This is needed 119 * This is a 64 bit version of random_roll above. This is needed
122 * for exp loss calculations for players changing religions. 120 * for exp loss calculations for players changing religions.
123 */ 121 */
124sint64 122sint64
125random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 123random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
126{ 124{
127 sint64 omin = min; 125 sint64 omin = r_min;
128 sint64 diff = max - min + 1; 126 sint64 range = max (0, r_max - r_min + 1);
129 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ 127 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
130
131 if (diff < 0)
132 {
133 LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
134 return (min); /* avoids a float exception */
135 }
136 128
137 /* 129 /*
138 * Make a call to get two 32 bit unsigned random numbers, and just to 130 * Make a call to get two 32 bit unsigned random numbers, and just to
139 * a little bitshifting. 131 * a little bitshifting.
140 */ 132 */
141 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 133 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
142 134
143 if (op->type != PLAYER) 135 if (op->type != PLAYER)
144 return ((ran % diff) + min); 136 return ((ran % range) + r_min);
145 137
146 int luck = op->stats.luck; 138 int luck = op->stats.luck;
147 139
148 if (rndm (base) < MIN (10, abs (luck))) 140 if (rndm (base) < min (10, abs (luck)))
149 { 141 {
150 /* we have a winner */ 142 /* we have a winner */
151 ((luck > 0) ? (luck = 1) : (luck = -1)); 143 ((luck > 0) ? (luck = 1) : (luck = -1));
152 diff -= luck; 144 range -= luck;
153 if (diff < 1) 145 if (range < 1)
154 return (omin); /*check again */ 146 return (omin); /*check again */
155 147
156 ((goodbad) ? (min += luck) : (diff)); 148 ((goodbad) ? (r_min += luck) : (range));
157 149
158 return (MAX (omin, MIN (max, (ran % diff) + min))); 150 return (max (omin, min (r_max, (ran % range) + r_min)));
159 } 151 }
160 152
161 return ran % diff + min; 153 return ran % range + r_min;
162} 154}
163 155
164/* 156/*
165 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 157 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
166 * If goodbad is non-zero, luck increases the roll, if zero, it decreases. 158 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
457void 449void
458fork_abort (const char *msg) 450fork_abort (const char *msg)
459{ 451{
460 if (!fork ()) 452 if (!fork ())
461 { 453 {
454 fprintf (stderr, "background fork_abort in progress, remove me when debugged.\n");//D
455
456 signal (SIGINT , SIG_IGN);
457 signal (SIGTERM, SIG_IGN);
462 signal (SIGABRT, SIG_DFL); 458 signal (SIGABRT, SIG_IGN);
459
460 signal (SIGSEGV, SIG_DFL);
461 signal (SIGBUS , SIG_DFL);
462 signal (SIGILL , SIG_DFL);
463 signal (SIGTRAP, SIG_DFL);
464
463 // try to put corefiles into a subdirectory, if existing, to allow 465 // try to put corefiles into a subdirectory, if existing, to allow
464 // an administrator to reduce the I/O load. 466 // an administrator to reduce the I/O load.
465 chdir ("cores"); 467 chdir ("cores");
468
469 // try to detach us from as many external dependencies as possible
470 // as coredumping can take time by closing all fd's.
471 {
472 struct rlimit lim;
473
474 if (getrlimit (RLIMIT_NOFILE, &lim))
475 lim.rlim_cur = 1024;
476
477 for (int i = 0; i < lim.rlim_cur; ++i)
478 close (i);
479 }
480
481 {
482 sigset_t empty;
483 sigemptyset (&empty);
484 sigprocmask (SIG_SETMASK, &empty, 0);
485 }
486
487 // try to coredump with SIGTRAP
488 kill (getpid (), SIGTRAP);
466 abort (); 489 abort ();
467 } 490 }
468 491
469 LOG (llevError, "fork abort: %s\n", msg); 492 LOG (llevError, "fork abort: %s\n", msg);
470} 493}
471 494
472void *salloc_ (int n) throw (std::bad_alloc) 495void *salloc_ (int n) throw (std::bad_alloc)
473{ 496{
474#ifdef PREFER_MALLOC
475 void *ptr = malloc (n);
476#else
477 slice_alloc += n;
478 void *ptr = g_slice_alloc (n); 497 void *ptr = g_slice_alloc (n);
479#endif
480 498
481 if (!ptr) 499 if (!ptr)
482 throw std::bad_alloc (); 500 throw std::bad_alloc ();
483 501
502 slice_alloc += n;
484 return ptr; 503 return ptr;
485} 504}
486 505
487void *salloc_ (int n, void *src) throw (std::bad_alloc) 506void *salloc_ (int n, void *src) throw (std::bad_alloc)
488{ 507{
496 return ptr; 515 return ptr;
497} 516}
498 517
499/******************************************************************************/ 518/******************************************************************************/
500 519
501#ifdef DEBUG_SALLOC 520#if DEBUG_SALLOC
502 521
503#define MAGIC 0xa1b2c35543deadLL 522#define MAGIC 0xa1b2c35543deadLL
504 523
505void *g_slice_alloc (unsigned long size) 524void *g_slice_alloc (unsigned long size)
506{ 525{
515 return memset (g_slice_alloc (size), 0, size); 534 return memset (g_slice_alloc (size), 0, size);
516} 535}
517 536
518void g_slice_free1 (unsigned long size, void *ptr) 537void g_slice_free1 (unsigned long size, void *ptr)
519{ 538{
539 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
520 if (expect_true (ptr)) 540 if (expect_true (ptr))
521 { 541 {
522 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
523 unsigned long *p = (unsigned long *)ptr; 542 unsigned long *p = (unsigned long *)ptr;
524 unsigned long s = *--p ^ MAGIC; 543 unsigned long s = *--p ^ MAGIC;
525 544
526 if ((*p ^ MAGIC) != size) 545 if (size != (unsigned long)(*p ^ MAGIC))
546 {
527 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); 547 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
548 abort ();
549 }
528 550
529 *p = MAGIC; 551 *p = MAGIC;
530 552
531 (g_slice_free1)(s + sizeof (unsigned long), p); 553 (g_slice_free1)(s + sizeof (unsigned long), p);
532 } 554 }
648 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 670 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
649 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 671 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
650 0x2d02ef8dL 672 0x2d02ef8dL
651}; 673};
652 674
675void thread::start (void *(*start_routine)(void *), void *arg)
676{
677 pthread_attr_t attr;
678
679 pthread_attr_init (&attr);
680 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
681 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
682 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
683#ifdef PTHREAD_SCOPE_PROCESS
684 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
685#endif
686
687 sigset_t fullsigset, oldsigset;
688 sigfillset (&fullsigset);
689
690 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
691
692 if (pthread_create (&id, &attr, start_routine, arg))
693 cleanup ("unable to create a new thread");
694
695 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
696}
697

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines