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.72 by root, Tue Apr 1 19:50:36 2008 UTC vs.
Revision 1.78 by root, Fri May 16 17:09:38 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, rmg_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
94 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
95 */ 94 */
96int 95int
97random_roll (int r_min, int r_max, const object *op, int goodbad) 96random_roll (int r_min, int r_max, const object *op, int goodbad)
98{ 97{
98 r_max = max (r_min, r_max);
99
99 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 100 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 101
107 if (op->type == PLAYER) 102 if (op->type == PLAYER)
108 { 103 {
109 int luck = op->stats.luck; 104 int luck = op->stats.luck;
110 105
120/* 115/*
121 * This is a 64 bit version of random_roll above. This is needed 116 * This is a 64 bit version of random_roll above. This is needed
122 * for exp loss calculations for players changing religions. 117 * for exp loss calculations for players changing religions.
123 */ 118 */
124sint64 119sint64
125random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 120random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
126{ 121{
127 sint64 omin = min; 122 sint64 omin = r_min;
128 sint64 diff = max - min + 1; 123 sint64 range = max (0, r_max - r_min + 1);
129 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ 124 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 125
137 /* 126 /*
138 * Make a call to get two 32 bit unsigned random numbers, and just to 127 * Make a call to get two 32 bit unsigned random numbers, and just to
139 * a little bitshifting. 128 * a little bitshifting.
140 */ 129 */
141 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 130 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
142 131
143 if (op->type != PLAYER) 132 if (op->type != PLAYER)
144 return ((ran % diff) + min); 133 return ((ran % range) + r_min);
145 134
146 int luck = op->stats.luck; 135 int luck = op->stats.luck;
147 136
148 if (rndm (base) < MIN (10, abs (luck))) 137 if (rndm (base) < min (10, abs (luck)))
149 { 138 {
150 /* we have a winner */ 139 /* we have a winner */
151 ((luck > 0) ? (luck = 1) : (luck = -1)); 140 ((luck > 0) ? (luck = 1) : (luck = -1));
152 diff -= luck; 141 range -= luck;
153 if (diff < 1) 142 if (range < 1)
154 return (omin); /*check again */ 143 return (omin); /*check again */
155 144
156 ((goodbad) ? (min += luck) : (diff)); 145 ((goodbad) ? (r_min += luck) : (range));
157 146
158 return (MAX (omin, MIN (max, (ran % diff) + min))); 147 return (max (omin, min (r_max, (ran % range) + r_min)));
159 } 148 }
160 149
161 return ran % diff + min; 150 return ran % range + r_min;
162} 151}
163 152
164/* 153/*
165 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 154 * 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. 155 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
469 LOG (llevError, "fork abort: %s\n", msg); 458 LOG (llevError, "fork abort: %s\n", msg);
470} 459}
471 460
472void *salloc_ (int n) throw (std::bad_alloc) 461void *salloc_ (int n) throw (std::bad_alloc)
473{ 462{
474#if PREFER_MALLOC
475 void *ptr = malloc (n);
476#else
477 slice_alloc += n;
478 void *ptr = g_slice_alloc (n); 463 void *ptr = g_slice_alloc (n);
479#endif
480 464
481 if (!ptr) 465 if (!ptr)
482 throw std::bad_alloc (); 466 throw std::bad_alloc ();
483 467
468 slice_alloc += n;
484 return ptr; 469 return ptr;
485} 470}
486 471
487void *salloc_ (int n, void *src) throw (std::bad_alloc) 472void *salloc_ (int n, void *src) throw (std::bad_alloc)
488{ 473{
515 return memset (g_slice_alloc (size), 0, size); 500 return memset (g_slice_alloc (size), 0, size);
516} 501}
517 502
518void g_slice_free1 (unsigned long size, void *ptr) 503void g_slice_free1 (unsigned long size, void *ptr)
519{ 504{
505 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
520 if (expect_true (ptr)) 506 if (expect_true (ptr))
521 { 507 {
522 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
523 unsigned long *p = (unsigned long *)ptr; 508 unsigned long *p = (unsigned long *)ptr;
524 unsigned long s = *--p ^ MAGIC; 509 unsigned long s = *--p ^ MAGIC;
525 510
526 if (size != (unsigned long)(*p ^ MAGIC)) 511 if (size != (unsigned long)(*p ^ MAGIC))
512 {
527 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); 513 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
514 abort ();
515 }
528 516
529 *p = MAGIC; 517 *p = MAGIC;
530 518
531 (g_slice_free1)(s + sizeof (unsigned long), p); 519 (g_slice_free1)(s + sizeof (unsigned long), p);
532 } 520 }
648 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 636 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
649 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 637 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
650 0x2d02ef8dL 638 0x2d02ef8dL
651}; 639};
652 640
641void thread::start (void *(*start_routine)(void *), void *arg)
642{
643 pthread_attr_t attr;
644
645 pthread_attr_init (&attr);
646 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
647 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
648 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
649#ifdef PTHREAD_SCOPE_PROCESS
650 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
651#endif
652
653 sigset_t fullsigset, oldsigset;
654 sigfillset (&fullsigset);
655
656 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
657
658 if (pthread_create (&id, &attr, start_routine, arg))
659 cleanup ("unable to create a new thread");
660
661 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
662}
663

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines