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.63 by root, Mon Aug 6 10:54:11 2007 UTC vs.
Revision 1.79 by root, Sat Aug 30 05:19:03 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
41refcnt_base::refcnt_t refcnt_dummy; 43refcnt_base::refcnt_t refcnt_dummy;
42 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.
… …
220} 212}
221 213
222/* when doing transmutation of objects, we have to recheck the resistances, 214/* when doing transmutation of objects, we have to recheck the resistances,
223 * as some that did not apply previously, may apply now. 215 * as some that did not apply previously, may apply now.
224 */ 216 */
225
226void 217void
227transmute_materialname (object *op, const object *change) 218transmute_materialname (object *op, const object *change)
228{ 219{
229 materialtype_t *mt; 220 materialtype_t *mt;
230 int j; 221 int j;
… …
419 * 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
420 * 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.
421 * This function will also strip all trailing non alphanumeric characters. 412 * This function will also strip all trailing non alphanumeric characters.
422 * It does not insert an oxford comma. 413 * It does not insert an oxford comma.
423 */ 414 */
424
425void 415void
426make_list_like (char *input) 416make_list_like (char *input)
427{ 417{
428 char *p, tmp[MAX_BUF]; 418 char *p, tmp[MAX_BUF];
429 int i; 419 int i;
… …
460fork_abort (const char *msg) 450fork_abort (const char *msg)
461{ 451{
462 if (!fork ()) 452 if (!fork ())
463 { 453 {
464 signal (SIGABRT, SIG_DFL); 454 signal (SIGABRT, SIG_DFL);
455
465 // try to put corefiles into a subdirectory, if existing, to allow 456 // try to put corefiles into a subdirectory, if existing, to allow
466 // an administrator to reduce the I/O load. 457 // an administrator to reduce the I/O load.
467 chdir ("cores"); 458 chdir ("cores");
459
460 // try to detach us from as many external dependencies as possible
461 // as coredumping can take time by closing all fd's.
462 {
463 struct rlimit lim;
464
465 if (getrlimit (RLIMIT_NOFILE, &lim))
466 lim.rlim_cur = 1024;
467
468 for (int i = 0; i < lim.rlim_cur; ++i)
469 close (i);
470 }
471
468 abort (); 472 abort ();
469 } 473 }
470 474
471 LOG (llevError, "fork abort: %s\n", msg); 475 LOG (llevError, "fork abort: %s\n", msg);
472} 476}
473 477
474void *salloc_ (int n) throw (std::bad_alloc) 478void *salloc_ (int n) throw (std::bad_alloc)
475{ 479{
476#ifdef PREFER_MALLOC
477 void *ptr = malloc (n);
478#else
479 void *ptr = g_slice_alloc (n); 480 void *ptr = g_slice_alloc (n);
480#endif
481 481
482 if (!ptr) 482 if (!ptr)
483 throw std::bad_alloc (); 483 throw std::bad_alloc ();
484 484
485 slice_alloc += n;
485 return ptr; 486 return ptr;
486} 487}
487 488
488void *salloc_ (int n, void *src) throw (std::bad_alloc) 489void *salloc_ (int n, void *src) throw (std::bad_alloc)
489{ 490{
… …
495 memset (ptr, 0, n); 496 memset (ptr, 0, n);
496 497
497 return ptr; 498 return ptr;
498} 499}
499 500
501/******************************************************************************/
502
503#if DEBUG_SALLOC
504
505#define MAGIC 0xa1b2c35543deadLL
506
507void *g_slice_alloc (unsigned long size)
508{
509 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
510 *p++ = size ^ MAGIC;
511 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
512 return (void *)p;
513}
514
515void *g_slice_alloc0 (unsigned long size)
516{
517 return memset (g_slice_alloc (size), 0, size);
518}
519
520void g_slice_free1 (unsigned long size, void *ptr)
521{
522 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
523 if (expect_true (ptr))
524 {
525 unsigned long *p = (unsigned long *)ptr;
526 unsigned long s = *--p ^ MAGIC;
527
528 if (size != (unsigned long)(*p ^ MAGIC))
529 {
530 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
531 abort ();
532 }
533
534 *p = MAGIC;
535
536 (g_slice_free1)(s + sizeof (unsigned long), p);
537 }
538}
539
540#endif
541
542/******************************************************************************/
543
500void assign (char *dst, const char *src, int maxlen) 544void assign (char *dst, const char *src, int maxlen)
501{ 545{
502 if (!src) 546 if (!src)
503 src = ""; 547 src = "";
504 548
… …
519 } 563 }
520 else 564 else
521 memcpy (dst, src, len + 1); 565 memcpy (dst, src, len + 1);
522} 566}
523 567
524const std::string 568const char *
525format (const char *format, ...) 569format (const char *format, ...)
526{ 570{
527 int len; 571 static dynbuf_text buf;
528 572
529 { 573 buf.clear ();
530 char buf[128];
531 574
532 va_list ap; 575 va_list ap;
533 va_start (ap, format); 576 va_start (ap, format);
534 len = vsnprintf (buf, sizeof (buf), format, ap); 577 buf.vprintf (format, ap);
535 va_end (ap); 578 va_end (ap);
536 579
537 assert (len >= 0); // shield againstz broken vsnprintf's
538
539 // was our static buffer short enough?
540 if (len < sizeof (buf))
541 return std::string (buf, len);
542 }
543
544 {
545 // longer, try harder
546 char *buf = salloc<char> (len + 1);
547
548 va_list ap;
549 va_start (ap, format);
550 vsnprintf (buf, len + 1, format, ap);
551 va_end (ap);
552
553 const std::string s (buf, len);
554 sfree<char> (buf, len + 1);
555
556 return buf; 580 return buf;
557 }
558} 581}
559 582
560tstamp now () 583tstamp now ()
561{ 584{
562 struct timeval tv; 585 struct timeval tv;
… …
630 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 653 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
631 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 654 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
632 0x2d02ef8dL 655 0x2d02ef8dL
633}; 656};
634 657
635#if 0 658void thread::start (void *(*start_routine)(void *), void *arg)
636void xyzzy (object_ptr &a, object_ptr &o)
637{ 659{
638 asm volatile ("int3"); 660 pthread_attr_t attr;
639 a = o; 661
640 asm volatile ("int3"); 662 pthread_attr_init (&attr);
641} 663 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
664 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
665 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
666#ifdef PTHREAD_SCOPE_PROCESS
667 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
642#endif 668#endif
643 669
670 sigset_t fullsigset, oldsigset;
671 sigfillset (&fullsigset);
672
673 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
674
675 if (pthread_create (&id, &attr, start_routine, arg))
676 cleanup ("unable to create a new thread");
677
678 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
679}
680

Diff Legend

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