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.60 by root, Sun Jul 1 05:00:18 2007 UTC vs.
Revision 1.82 by root, Thu Sep 11 12:43:17 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
… …
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/* 24/*
25 * General convenience functions for crossfire. 25 * General convenience functions for crossfire.
26 */ 26 */
… …
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
41rand_gen rndm; 43refcnt_base::refcnt_t refcnt_dummy;
44ssize_t slice_alloc;
45rand_gen rndm, rmg_rndm;
42 46
43void 47void
44tausworthe_random_generator::seed (uint32_t seed) 48tausworthe_random_generator::seed (uint32_t seed)
45{ 49{
46 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 50 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
47 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;
48 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;
49 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;
50 54
51 for (int i = 11; --i; ) 55 for (int i = 11; --i; )
52 operator ()(); 56 operator ()();
53} 57}
54 58
… …
92 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 96 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
93 */ 97 */
94int 98int
95random_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)
96{ 100{
101 r_max = max (r_min, r_max);
102
97 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 */
98
99 if (r_max < r_min)
100 {
101 LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max);
102 return r_min;
103 }
104 104
105 if (op->type == PLAYER) 105 if (op->type == PLAYER)
106 { 106 {
107 int luck = op->stats.luck; 107 int luck = op->stats.luck;
108 108
… …
118/* 118/*
119 * 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
120 * for exp loss calculations for players changing religions. 120 * for exp loss calculations for players changing religions.
121 */ 121 */
122sint64 122sint64
123random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 123random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
124{ 124{
125 sint64 omin = min; 125 sint64 omin = r_min;
126 sint64 diff = max - min + 1; 126 sint64 range = max (0, r_max - r_min + 1);
127 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 */
128
129 if (diff < 0)
130 {
131 LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max);
132 return (min); /* avoids a float exception */
133 }
134 128
135 /* 129 /*
136 * 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
137 * a little bitshifting. 131 * a little bitshifting.
138 */ 132 */
139 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 133 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
140 134
141 if (op->type != PLAYER) 135 if (op->type != PLAYER)
142 return ((ran % diff) + min); 136 return ((ran % range) + r_min);
143 137
144 int luck = op->stats.luck; 138 int luck = op->stats.luck;
145 139
146 if (rndm (base) < MIN (10, abs (luck))) 140 if (rndm (base) < min (10, abs (luck)))
147 { 141 {
148 /* we have a winner */ 142 /* we have a winner */
149 ((luck > 0) ? (luck = 1) : (luck = -1)); 143 ((luck > 0) ? (luck = 1) : (luck = -1));
150 diff -= luck; 144 range -= luck;
151 if (diff < 1) 145 if (range < 1)
152 return (omin); /*check again */ 146 return (omin); /*check again */
153 147
154 ((goodbad) ? (min += luck) : (diff)); 148 ((goodbad) ? (r_min += luck) : (range));
155 149
156 return (MAX (omin, MIN (max, (ran % diff) + min))); 150 return (max (omin, min (r_max, (ran % range) + r_min)));
157 } 151 }
158 152
159 return ran % diff + min; 153 return ran % range + r_min;
160} 154}
161 155
162/* 156/*
163 * 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,
164 * 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.
… …
212{ 206{
213 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 207 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
214 if (name == mt->name) 208 if (name == mt->name)
215 return mt; 209 return mt;
216 210
217 return materialt; 211 return 0;
218} 212}
219 213
220/* when doing transmutation of objects, we have to recheck the resistances, 214/* when doing transmutation of objects, we have to recheck the resistances,
221 * as some that did not apply previously, may apply now. 215 * as some that did not apply previously, may apply now.
222 */ 216 */
223
224void 217void
225transmute_materialname (object *op, const object *change) 218transmute_materialname (object *op, const object *change)
226{ 219{
227 materialtype_t *mt; 220 materialtype_t *mt;
228 int j; 221 int j;
… …
258void 251void
259set_materialname (object *op, int difficulty, materialtype_t *nmt) 252set_materialname (object *op, int difficulty, materialtype_t *nmt)
260{ 253{
261 materialtype_t *mt, *lmt; 254 materialtype_t *mt, *lmt;
262 255
263#ifdef NEW_MATERIAL_CODE
264 int j;
265#endif
266
267 if (op->materialname != NULL) 256 if (op->materialname != NULL)
268 return; 257 return;
269 258
270
271
272 if (nmt == NULL) 259 if (nmt == NULL)
273 { 260 {
274 lmt = NULL; 261 lmt = NULL;
275#ifndef NEW_MATERIAL_CODE 262
276 for (mt = materialt; mt && mt->next; mt = mt->next) 263 for (mt = materialt; mt && mt->next; mt = mt->next)
277 { 264 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
278 if (op->materials & mt->material) 265 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
279 { 266 {
280 lmt = mt; 267 lmt = mt;
268 if (!(op->is_weapon () || op->is_armor ()))
281 break; 269 break;
282 } 270 }
283 }
284
285#else
286 for (mt = materialt; mt && mt->next; mt = mt->next)
287 {
288 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
289 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
290 {
291 lmt = mt;
292 if (!(op->is_weapon () || op->is_armor ()))
293 break;
294 }
295 }
296#endif
297 } 271 }
298 else 272 else
299 {
300 lmt = nmt; 273 lmt = nmt;
301 }
302 274
303 if (lmt != NULL) 275 if (lmt != NULL)
304 { 276 {
305#ifndef NEW_MATERIAL_CODE
306 op->materialname = lmt->name;
307 return;
308#else
309
310 if (op->stats.dam && op->is_weapon ()) 277 if (op->stats.dam && op->is_weapon ())
311 { 278 {
312 op->stats.dam += lmt->damage; 279 op->stats.dam += lmt->damage;
313 if (op->stats.dam < 1) 280 if (op->stats.dam < 1)
314 op->stats.dam = 1; 281 op->stats.dam = 1;
… …
320 op->stats.wc += lmt->wc; 287 op->stats.wc += lmt->wc;
321 if (op->is_armor ()) 288 if (op->is_armor ())
322 { 289 {
323 if (op->stats.ac) 290 if (op->stats.ac)
324 op->stats.ac += lmt->ac; 291 op->stats.ac += lmt->ac;
292
325 for (j = 0; j < NROFATTACKS; j++) 293 for (int j = 0; j < NROFATTACKS; j++)
326 if (op->resist[j] != 0) 294 if (op->resist[j] != 0)
327 { 295 {
328 op->resist[j] += lmt->mod[j]; 296 op->resist[j] += lmt->mod[j];
329 if (op->resist[j] > 100) 297 if (op->resist[j] > 100)
330 op->resist[j] = 100; 298 op->resist[j] = 100;
331 if (op->resist[j] < -100) 299 if (op->resist[j] < -100)
332 op->resist[j] = -100; 300 op->resist[j] = -100;
333 } 301 }
334 } 302 }
303
335 op->materialname = lmt->name; 304 op->materialname = lmt->name;
336 /* dont make it unstackable if it doesn't need to be */ 305 /* dont make it unstackable if it doesn't need to be */
337 if (op->is_weapon () || op->is_armor ()) 306 if (op->is_weapon () || op->is_armor ())
338 { 307 {
339 op->weight = (op->weight * lmt->weight) / 100; 308 op->weight = (op->weight * lmt->weight) / 100;
340 op->value = (op->value * lmt->value) / 100; 309 op->value = (op->value * lmt->value) / 100;
341 } 310 }
342#endif
343 } 311 }
344} 312}
345 313
346/* 314/*
347 * Strip out the media tags from a String. 315 * Strip out the media tags from a String.
… …
442 * a 'list' for the purposes here, is a string of items, seperated by commas, except 410 * a 'list' for the purposes here, is a string of items, seperated by commas, except
443 * for the last entry, which has an 'and' before it, and a full stop (period) after it. 411 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
444 * This function will also strip all trailing non alphanumeric characters. 412 * This function will also strip all trailing non alphanumeric characters.
445 * It does not insert an oxford comma. 413 * It does not insert an oxford comma.
446 */ 414 */
447
448void 415void
449make_list_like (char *input) 416make_list_like (char *input)
450{ 417{
451 char *p, tmp[MAX_BUF]; 418 char *p, tmp[MAX_BUF];
452 int i; 419 int i;
… …
482void 449void
483fork_abort (const char *msg) 450fork_abort (const char *msg)
484{ 451{
485 if (!fork ()) 452 if (!fork ())
486 { 453 {
454 signal (SIGINT , SIG_IGN);
455 signal (SIGTERM, SIG_IGN);
487 signal (SIGABRT, SIG_DFL); 456 signal (SIGABRT, SIG_IGN);
457
458 signal (SIGSEGV, SIG_DFL);
459 signal (SIGBUS , SIG_DFL);
460 signal (SIGILL , SIG_DFL);
461 signal (SIGTRAP, SIG_DFL);
462
488 // try to put corefiles into a subdirectory, if existing, to allow 463 // try to put corefiles into a subdirectory, if existing, to allow
489 // an administrator to reduce the I/O load. 464 // an administrator to reduce the I/O load.
490 chdir ("cores"); 465 chdir ("cores");
466
467 // try to detach us from as many external dependencies as possible
468 // as coredumping can take time by closing all fd's.
469 {
470 struct rlimit lim;
471
472 if (getrlimit (RLIMIT_NOFILE, &lim))
473 lim.rlim_cur = 1024;
474
475 for (int i = 0; i < lim.rlim_cur; ++i)
476 close (i);
477 }
478
479 {
480 sigset_t empty;
481 sigemptyset (&empty);
482 sigprocmask (SIG_SETMASK, &empty, 0);
483 }
484
485 // try to coredump with SIGTRAP
486 kill (getpid (), SIGTRAP);
491 abort (); 487 abort ();
492 } 488 }
493 489
494 LOG (llevError, "fork abort: %s\n", msg); 490 LOG (llevError, "fork abort: %s\n", msg);
495} 491}
496 492
497void *salloc_ (int n) throw (std::bad_alloc) 493void *salloc_ (int n) throw (std::bad_alloc)
498{ 494{
499#ifdef PREFER_MALLOC
500 void *ptr = malloc (n);
501#else
502 void *ptr = g_slice_alloc (n); 495 void *ptr = g_slice_alloc (n);
503#endif
504 496
505 if (!ptr) 497 if (!ptr)
506 throw std::bad_alloc (); 498 throw std::bad_alloc ();
507 499
500 slice_alloc += n;
508 return ptr; 501 return ptr;
509} 502}
510 503
511void *salloc_ (int n, void *src) throw (std::bad_alloc) 504void *salloc_ (int n, void *src) throw (std::bad_alloc)
512{ 505{
… …
518 memset (ptr, 0, n); 511 memset (ptr, 0, n);
519 512
520 return ptr; 513 return ptr;
521} 514}
522 515
516/******************************************************************************/
517
518#if DEBUG_SALLOC
519
520#define MAGIC 0xa1b2c35543deadLL
521
522void *g_slice_alloc (unsigned long size)
523{
524 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
525 *p++ = size ^ MAGIC;
526 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
527 return (void *)p;
528}
529
530void *g_slice_alloc0 (unsigned long size)
531{
532 return memset (g_slice_alloc (size), 0, size);
533}
534
535void g_slice_free1 (unsigned long size, void *ptr)
536{
537 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
538 if (expect_true (ptr))
539 {
540 unsigned long *p = (unsigned long *)ptr;
541 unsigned long s = *--p ^ MAGIC;
542
543 if (size != (unsigned long)(*p ^ MAGIC))
544 {
545 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
546 abort ();
547 }
548
549 *p = MAGIC;
550
551 (g_slice_free1)(s + sizeof (unsigned long), p);
552 }
553}
554
555#endif
556
557/******************************************************************************/
558
523void assign (char *dst, const char *src, int maxlen) 559void assign (char *dst, const char *src, int maxlen)
524{ 560{
525 if (!src) 561 if (!src)
526 src = ""; 562 src = "";
527 563
… …
542 } 578 }
543 else 579 else
544 memcpy (dst, src, len + 1); 580 memcpy (dst, src, len + 1);
545} 581}
546 582
547const std::string 583const char *
548format (const char *format, ...) 584format (const char *format, ...)
549{ 585{
550 int len; 586 static dynbuf_text buf;
551 587
552 { 588 buf.clear ();
553 char buf[128];
554 589
555 va_list ap; 590 va_list ap;
556 va_start (ap, format); 591 va_start (ap, format);
557 len = vsnprintf (buf, sizeof (buf), format, ap); 592 buf.vprintf (format, ap);
558 va_end (ap); 593 va_end (ap);
559 594
560 assert (len >= 0); // shield againstz broken vsnprintf's
561
562 // was our static buffer short enough?
563 if (len < sizeof (buf))
564 return std::string (buf, len);
565 }
566
567 {
568 // longer, try harder
569 char *buf = salloc<char> (len + 1);
570
571 va_list ap;
572 va_start (ap, format);
573 vsnprintf (buf, len + 1, format, ap);
574 va_end (ap);
575
576 const std::string s (buf, len);
577 sfree<char> (buf, len + 1);
578
579 return buf; 595 return buf;
580 }
581} 596}
582 597
583tstamp now () 598tstamp now ()
584{ 599{
585 struct timeval tv; 600 struct timeval tv;
… …
653 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 668 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
654 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 669 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
655 0x2d02ef8dL 670 0x2d02ef8dL
656}; 671};
657 672
673void thread::start (void *(*start_routine)(void *), void *arg)
674{
675 pthread_attr_t attr;
658 676
677 pthread_attr_init (&attr);
678 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
679 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
680 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
681#ifdef PTHREAD_SCOPE_PROCESS
682 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
683#endif
684
685 sigset_t fullsigset, oldsigset;
686 sigfillset (&fullsigset);
687
688 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
689
690 if (pthread_create (&id, &attr, start_routine, arg))
691 cleanup ("unable to create a new thread");
692
693 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
694}
695

Diff Legend

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