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.59 by root, Thu Jun 7 19:12:22 2007 UTC vs.
Revision 1.80 by root, Wed Sep 10 18:18:10 2008 UTC

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

Diff Legend

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