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.86 by root, Mon Jan 12 03:40:21 2009 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 next ();
55} 57}
56 58
57uint32_t 59uint32_t
58tausworthe_random_generator::next () 60tausworthe_random_generator::next ()
59{ 61{
… …
63 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); 65 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
64 66
65 return state [0] ^ state [1] ^ state [2] ^ state [3]; 67 return state [0] ^ state [1] ^ state [2] ^ state [3];
66} 68}
67 69
70template<class generator>
68uint32_t 71uint32_t
69tausworthe_random_generator::get_range (uint32_t num) 72random_number_generator<generator>::get_range (uint32_t num)
70{ 73{
71 return (next () * (uint64_t)num) >> 32U; 74 return (this->next () * (uint64_t)num) >> 32U;
72} 75}
73 76
74// return a number within (min .. max) 77// return a number within (min .. max)
78template<class generator>
75int 79int
76tausworthe_random_generator::get_range (int r_min, int r_max) 80random_number_generator<generator>::get_range (int r_min, int r_max)
77{ 81{
78 return r_min + get_range (max (r_max - r_min + 1, 0)); 82 return r_min + get_range (max (r_max - r_min + 1, 0));
79} 83}
84
85template struct random_number_generator<tausworthe_random_generator>;
86template struct random_number_generator<xorshift_random_generator>;
80 87
81/* 88/*
82 * The random functions here take luck into account when rolling random 89 * The random functions here take luck into account when rolling random
83 * dice or numbers. This function has less of an impact the larger the 90 * dice or numbers. This function has less of an impact the larger the
84 * difference becomes in the random numbers. IE, the effect is lessened 91 * difference becomes in the random numbers. IE, the effect is lessened
… …
94 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 101 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
95 */ 102 */
96int 103int
97random_roll (int r_min, int r_max, const object *op, int goodbad) 104random_roll (int r_min, int r_max, const object *op, int goodbad)
98{ 105{
106 r_max = max (r_min, r_max);
107
99 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 108 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 109
107 if (op->type == PLAYER) 110 if (op->type == PLAYER)
108 { 111 {
109 int luck = op->stats.luck; 112 int luck = op->stats.luck;
110 113
… …
120/* 123/*
121 * This is a 64 bit version of random_roll above. This is needed 124 * This is a 64 bit version of random_roll above. This is needed
122 * for exp loss calculations for players changing religions. 125 * for exp loss calculations for players changing religions.
123 */ 126 */
124sint64 127sint64
125random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 128random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
126{ 129{
127 sint64 omin = min; 130 sint64 omin = r_min;
128 sint64 diff = max - min + 1; 131 sint64 range = max (0, r_max - r_min + 1);
129 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ 132 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 133
137 /* 134 /*
138 * Make a call to get two 32 bit unsigned random numbers, and just to 135 * Make a call to get two 32 bit unsigned random numbers, and just to
139 * a little bitshifting. 136 * a little bitshifting.
140 */ 137 */
141 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 138 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
142 139
143 if (op->type != PLAYER) 140 if (op->type != PLAYER)
144 return ((ran % diff) + min); 141 return ((ran % range) + r_min);
145 142
146 int luck = op->stats.luck; 143 int luck = op->stats.luck;
147 144
148 if (rndm (base) < MIN (10, abs (luck))) 145 if (rndm (base) < min (10, abs (luck)))
149 { 146 {
150 /* we have a winner */ 147 /* we have a winner */
151 ((luck > 0) ? (luck = 1) : (luck = -1)); 148 ((luck > 0) ? (luck = 1) : (luck = -1));
152 diff -= luck; 149 range -= luck;
153 if (diff < 1) 150 if (range < 1)
154 return (omin); /*check again */ 151 return (omin); /*check again */
155 152
156 ((goodbad) ? (min += luck) : (diff)); 153 ((goodbad) ? (r_min += luck) : (range));
157 154
158 return (MAX (omin, MIN (max, (ran % diff) + min))); 155 return (max (omin, min (r_max, (ran % range) + r_min)));
159 } 156 }
160 157
161 return ran % diff + min; 158 return ran % range + r_min;
162} 159}
163 160
164/* 161/*
165 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 162 * 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. 163 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
… …
208} 205}
209 206
210/* convert materialname to materialtype_t */ 207/* convert materialname to materialtype_t */
211 208
212materialtype_t * 209materialtype_t *
213name_to_material (const shstr &name) 210name_to_material (const shstr_cmp name)
214{ 211{
215 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 212 for (materialtype_t *mt = materialt; mt; mt = mt->next)
216 if (name == mt->name) 213 if (name == mt->name)
217 return mt; 214 return mt;
218 215
219 return 0; 216 return 0;
220} 217}
… …
226transmute_materialname (object *op, const object *change) 223transmute_materialname (object *op, const object *change)
227{ 224{
228 materialtype_t *mt; 225 materialtype_t *mt;
229 int j; 226 int j;
230 227
231 if (op->materialname == NULL) 228 if (!op->materialname)
232 return; 229 return;
233 230
234 if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) 231 if (op->materialname != change->materialname)
235 return; 232 return;
236 233
237 if (!op->is_armor ()) 234 if (!op->is_armor ())
238 return; 235 return;
239 236
… …
259void 256void
260set_materialname (object *op, int difficulty, materialtype_t *nmt) 257set_materialname (object *op, int difficulty, materialtype_t *nmt)
261{ 258{
262 materialtype_t *mt, *lmt; 259 materialtype_t *mt, *lmt;
263 260
264 if (op->materialname != NULL) 261 if (!op->materialname)
265 return; 262 return;
266 263
267 if (nmt == NULL) 264 if (nmt)
265 lmt = nmt;
266 else
268 { 267 {
269 lmt = NULL; 268 lmt = 0;
270 269
271 for (mt = materialt; mt && mt->next; mt = mt->next) 270 for (mt = materialt; mt; mt = mt->next)
272 if (op->materials & mt->material && rndm (1, 100) <= mt->chance && 271 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
273 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) 272 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
274 { 273 {
275 lmt = mt; 274 lmt = mt;
276 if (!(op->is_weapon () || op->is_armor ())) 275 if (!(op->is_weapon () || op->is_armor ()))
277 break; 276 break;
278 } 277 }
279 } 278 }
280 else
281 lmt = nmt;
282 279
283 if (lmt != NULL) 280 if (lmt)
284 { 281 {
285 if (op->stats.dam && op->is_weapon ()) 282 if (op->stats.dam && op->is_weapon ())
286 { 283 {
287 op->stats.dam += lmt->damage; 284 op->stats.dam += lmt->damage;
288 if (op->stats.dam < 1) 285 if (op->stats.dam < 1)
… …
457void 454void
458fork_abort (const char *msg) 455fork_abort (const char *msg)
459{ 456{
460 if (!fork ()) 457 if (!fork ())
461 { 458 {
459 signal (SIGINT , SIG_IGN);
460 signal (SIGTERM, SIG_IGN);
462 signal (SIGABRT, SIG_DFL); 461 signal (SIGABRT, SIG_IGN);
462
463 signal (SIGSEGV, SIG_DFL);
464 signal (SIGBUS , SIG_DFL);
465 signal (SIGILL , SIG_DFL);
466 signal (SIGTRAP, SIG_DFL);
467
463 // try to put corefiles into a subdirectory, if existing, to allow 468 // try to put corefiles into a subdirectory, if existing, to allow
464 // an administrator to reduce the I/O load. 469 // an administrator to reduce the I/O load.
465 chdir ("cores"); 470 chdir ("cores");
471
472 // try to detach us from as many external dependencies as possible
473 // as coredumping can take time by closing all fd's.
474 {
475 struct rlimit lim;
476
477 if (getrlimit (RLIMIT_NOFILE, &lim))
478 lim.rlim_cur = 1024;
479
480 for (int i = 0; i < lim.rlim_cur; ++i)
481 close (i);
482 }
483
484 {
485 sigset_t empty;
486 sigemptyset (&empty);
487 sigprocmask (SIG_SETMASK, &empty, 0);
488 }
489
490 // try to coredump with SIGTRAP
491 kill (getpid (), SIGTRAP);
466 abort (); 492 abort ();
467 } 493 }
468 494
469 LOG (llevError, "fork abort: %s\n", msg); 495 LOG (llevError, "fork abort: %s\n", msg);
470} 496}
471 497
472void *salloc_ (int n) throw (std::bad_alloc) 498void *salloc_ (int n) throw (std::bad_alloc)
473{ 499{
474#if PREFER_MALLOC
475 void *ptr = malloc (n);
476#else
477 slice_alloc += n;
478 void *ptr = g_slice_alloc (n); 500 void *ptr = g_slice_alloc (n);
479#endif
480 501
481 if (!ptr) 502 if (!ptr)
482 throw std::bad_alloc (); 503 throw std::bad_alloc ();
483 504
505 slice_alloc += n;
484 return ptr; 506 return ptr;
485} 507}
486 508
487void *salloc_ (int n, void *src) throw (std::bad_alloc) 509void *salloc_ (int n, void *src) throw (std::bad_alloc)
488{ 510{
… …
515 return memset (g_slice_alloc (size), 0, size); 537 return memset (g_slice_alloc (size), 0, size);
516} 538}
517 539
518void g_slice_free1 (unsigned long size, void *ptr) 540void g_slice_free1 (unsigned long size, void *ptr)
519{ 541{
542 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
520 if (expect_true (ptr)) 543 if (expect_true (ptr))
521 { 544 {
522 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
523 unsigned long *p = (unsigned long *)ptr; 545 unsigned long *p = (unsigned long *)ptr;
524 unsigned long s = *--p ^ MAGIC; 546 unsigned long s = *--p ^ MAGIC;
525 547
526 if (size != (unsigned long)(*p ^ MAGIC)) 548 if (size != (unsigned long)(*p ^ MAGIC))
549 {
527 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); 550 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
551 abort ();
552 }
528 553
529 *p = MAGIC; 554 *p = MAGIC;
530 555
531 (g_slice_free1)(s + sizeof (unsigned long), p); 556 (g_slice_free1)(s + sizeof (unsigned long), p);
532 } 557 }
… …
534 559
535#endif 560#endif
536 561
537/******************************************************************************/ 562/******************************************************************************/
538 563
564int
539void assign (char *dst, const char *src, int maxlen) 565assign (char *dst, const char *src, int maxsize)
540{ 566{
541 if (!src) 567 if (!src)
542 src = ""; 568 src = "";
543 569
544 int len = strlen (src); 570 int len = strlen (src);
545 571
546 if (len >= maxlen - 1) 572 if (len >= maxsize)
547 { 573 {
548 if (maxlen <= 4) 574 if (maxsize <= 4)
549 { 575 {
550 memset (dst, '.', maxlen - 1); 576 memset (dst, '.', maxsize - 2);
551 dst [maxlen - 1] = 0; 577 dst [maxsize - 1] = 0;
552 } 578 }
553 else 579 else
554 { 580 {
555 memcpy (dst, src, maxlen - 4); 581 memcpy (dst, src, maxsize - 4);
556 memcpy (dst + maxlen - 4, "...", 4); 582 memcpy (dst + maxsize - 4, "...", 4);
557 } 583 }
584
585 len = maxsize;
558 } 586 }
559 else 587 else
560 memcpy (dst, src, len + 1); 588 memcpy (dst, src, ++len);
589
590 return len;
561} 591}
562 592
563const char * 593const char *
564format (const char *format, ...) 594format (const char *format, ...)
565{ 595{
… …
648 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 678 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
649 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 679 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
650 0x2d02ef8dL 680 0x2d02ef8dL
651}; 681};
652 682
683void thread::start (void *(*start_routine)(void *), void *arg)
684{
685 pthread_attr_t attr;
686
687 pthread_attr_init (&attr);
688 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
689 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
690 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
691#ifdef PTHREAD_SCOPE_PROCESS
692 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
693#endif
694
695 sigset_t fullsigset, oldsigset;
696 sigfillset (&fullsigset);
697
698 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
699
700 if (pthread_create (&id, &attr, start_routine, arg))
701 cleanup ("unable to create a new thread");
702
703 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
704}
705

Diff Legend

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