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.78 by root, Fri May 16 17:09:38 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
39#include <glib.h> 38#include <glib.h>
40 39
41rand_gen rndm; 40refcnt_base::refcnt_t refcnt_dummy;
41ssize_t slice_alloc;
42rand_gen rndm, rmg_rndm;
42 43
43void 44void
44tausworthe_random_generator::seed (uint32_t seed) 45tausworthe_random_generator::seed (uint32_t seed)
45{ 46{
46 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 47 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
47 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;
48 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;
49 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;
50 51
51 for (int i = 11; --i; ) 52 for (int i = 11; --i; )
52 operator ()(); 53 operator ()();
53} 54}
54 55
… …
92 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
93 */ 94 */
94int 95int
95random_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)
96{ 97{
98 r_max = max (r_min, r_max);
99
97 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 */
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 101
105 if (op->type == PLAYER) 102 if (op->type == PLAYER)
106 { 103 {
107 int luck = op->stats.luck; 104 int luck = op->stats.luck;
108 105
… …
118/* 115/*
119 * 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
120 * for exp loss calculations for players changing religions. 117 * for exp loss calculations for players changing religions.
121 */ 118 */
122sint64 119sint64
123random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 120random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
124{ 121{
125 sint64 omin = min; 122 sint64 omin = r_min;
126 sint64 diff = max - min + 1; 123 sint64 range = max (0, r_max - r_min + 1);
127 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 */
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 125
135 /* 126 /*
136 * 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
137 * a little bitshifting. 128 * a little bitshifting.
138 */ 129 */
139 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 130 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
140 131
141 if (op->type != PLAYER) 132 if (op->type != PLAYER)
142 return ((ran % diff) + min); 133 return ((ran % range) + r_min);
143 134
144 int luck = op->stats.luck; 135 int luck = op->stats.luck;
145 136
146 if (rndm (base) < MIN (10, abs (luck))) 137 if (rndm (base) < min (10, abs (luck)))
147 { 138 {
148 /* we have a winner */ 139 /* we have a winner */
149 ((luck > 0) ? (luck = 1) : (luck = -1)); 140 ((luck > 0) ? (luck = 1) : (luck = -1));
150 diff -= luck; 141 range -= luck;
151 if (diff < 1) 142 if (range < 1)
152 return (omin); /*check again */ 143 return (omin); /*check again */
153 144
154 ((goodbad) ? (min += luck) : (diff)); 145 ((goodbad) ? (r_min += luck) : (range));
155 146
156 return (MAX (omin, MIN (max, (ran % diff) + min))); 147 return (max (omin, min (r_max, (ran % range) + r_min)));
157 } 148 }
158 149
159 return ran % diff + min; 150 return ran % range + r_min;
160} 151}
161 152
162/* 153/*
163 * 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,
164 * 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.
… …
212{ 203{
213 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 204 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
214 if (name == mt->name) 205 if (name == mt->name)
215 return mt; 206 return mt;
216 207
217 return materialt; 208 return 0;
218} 209}
219 210
220/* when doing transmutation of objects, we have to recheck the resistances, 211/* when doing transmutation of objects, we have to recheck the resistances,
221 * as some that did not apply previously, may apply now. 212 * as some that did not apply previously, may apply now.
222 */ 213 */
223
224void 214void
225transmute_materialname (object *op, const object *change) 215transmute_materialname (object *op, const object *change)
226{ 216{
227 materialtype_t *mt; 217 materialtype_t *mt;
228 int j; 218 int j;
… …
258void 248void
259set_materialname (object *op, int difficulty, materialtype_t *nmt) 249set_materialname (object *op, int difficulty, materialtype_t *nmt)
260{ 250{
261 materialtype_t *mt, *lmt; 251 materialtype_t *mt, *lmt;
262 252
263#ifdef NEW_MATERIAL_CODE
264 int j;
265#endif
266
267 if (op->materialname != NULL) 253 if (op->materialname != NULL)
268 return; 254 return;
269 255
270
271
272 if (nmt == NULL) 256 if (nmt == NULL)
273 { 257 {
274 lmt = NULL; 258 lmt = NULL;
275#ifndef NEW_MATERIAL_CODE 259
276 for (mt = materialt; mt && mt->next; mt = mt->next) 260 for (mt = materialt; mt && mt->next; mt = mt->next)
277 { 261 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
278 if (op->materials & mt->material) 262 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
279 { 263 {
280 lmt = mt; 264 lmt = mt;
265 if (!(op->is_weapon () || op->is_armor ()))
281 break; 266 break;
282 } 267 }
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 } 268 }
298 else 269 else
299 {
300 lmt = nmt; 270 lmt = nmt;
301 }
302 271
303 if (lmt != NULL) 272 if (lmt != NULL)
304 { 273 {
305#ifndef NEW_MATERIAL_CODE
306 op->materialname = lmt->name;
307 return;
308#else
309
310 if (op->stats.dam && op->is_weapon ()) 274 if (op->stats.dam && op->is_weapon ())
311 { 275 {
312 op->stats.dam += lmt->damage; 276 op->stats.dam += lmt->damage;
313 if (op->stats.dam < 1) 277 if (op->stats.dam < 1)
314 op->stats.dam = 1; 278 op->stats.dam = 1;
… …
320 op->stats.wc += lmt->wc; 284 op->stats.wc += lmt->wc;
321 if (op->is_armor ()) 285 if (op->is_armor ())
322 { 286 {
323 if (op->stats.ac) 287 if (op->stats.ac)
324 op->stats.ac += lmt->ac; 288 op->stats.ac += lmt->ac;
289
325 for (j = 0; j < NROFATTACKS; j++) 290 for (int j = 0; j < NROFATTACKS; j++)
326 if (op->resist[j] != 0) 291 if (op->resist[j] != 0)
327 { 292 {
328 op->resist[j] += lmt->mod[j]; 293 op->resist[j] += lmt->mod[j];
329 if (op->resist[j] > 100) 294 if (op->resist[j] > 100)
330 op->resist[j] = 100; 295 op->resist[j] = 100;
331 if (op->resist[j] < -100) 296 if (op->resist[j] < -100)
332 op->resist[j] = -100; 297 op->resist[j] = -100;
333 } 298 }
334 } 299 }
300
335 op->materialname = lmt->name; 301 op->materialname = lmt->name;
336 /* dont make it unstackable if it doesn't need to be */ 302 /* dont make it unstackable if it doesn't need to be */
337 if (op->is_weapon () || op->is_armor ()) 303 if (op->is_weapon () || op->is_armor ())
338 { 304 {
339 op->weight = (op->weight * lmt->weight) / 100; 305 op->weight = (op->weight * lmt->weight) / 100;
340 op->value = (op->value * lmt->value) / 100; 306 op->value = (op->value * lmt->value) / 100;
341 } 307 }
342#endif
343 } 308 }
344} 309}
345 310
346/* 311/*
347 * Strip out the media tags from a String. 312 * Strip out the media tags from a String.
… …
442 * a 'list' for the purposes here, is a string of items, seperated by commas, except 407 * 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. 408 * 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. 409 * This function will also strip all trailing non alphanumeric characters.
445 * It does not insert an oxford comma. 410 * It does not insert an oxford comma.
446 */ 411 */
447
448void 412void
449make_list_like (char *input) 413make_list_like (char *input)
450{ 414{
451 char *p, tmp[MAX_BUF]; 415 char *p, tmp[MAX_BUF];
452 int i; 416 int i;
… …
494 LOG (llevError, "fork abort: %s\n", msg); 458 LOG (llevError, "fork abort: %s\n", msg);
495} 459}
496 460
497void *salloc_ (int n) throw (std::bad_alloc) 461void *salloc_ (int n) throw (std::bad_alloc)
498{ 462{
499#ifdef PREFER_MALLOC
500 void *ptr = malloc (n);
501#else
502 void *ptr = g_slice_alloc (n); 463 void *ptr = g_slice_alloc (n);
503#endif
504 464
505 if (!ptr) 465 if (!ptr)
506 throw std::bad_alloc (); 466 throw std::bad_alloc ();
507 467
468 slice_alloc += n;
508 return ptr; 469 return ptr;
509} 470}
510 471
511void *salloc_ (int n, void *src) throw (std::bad_alloc) 472void *salloc_ (int n, void *src) throw (std::bad_alloc)
512{ 473{
… …
518 memset (ptr, 0, n); 479 memset (ptr, 0, n);
519 480
520 return ptr; 481 return ptr;
521} 482}
522 483
484/******************************************************************************/
485
486#if DEBUG_SALLOC
487
488#define MAGIC 0xa1b2c35543deadLL
489
490void *g_slice_alloc (unsigned long size)
491{
492 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
493 *p++ = size ^ MAGIC;
494 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
495 return (void *)p;
496}
497
498void *g_slice_alloc0 (unsigned long size)
499{
500 return memset (g_slice_alloc (size), 0, size);
501}
502
503void g_slice_free1 (unsigned long size, void *ptr)
504{
505 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
506 if (expect_true (ptr))
507 {
508 unsigned long *p = (unsigned long *)ptr;
509 unsigned long s = *--p ^ MAGIC;
510
511 if (size != (unsigned long)(*p ^ MAGIC))
512 {
513 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
514 abort ();
515 }
516
517 *p = MAGIC;
518
519 (g_slice_free1)(s + sizeof (unsigned long), p);
520 }
521}
522
523#endif
524
525/******************************************************************************/
526
523void assign (char *dst, const char *src, int maxlen) 527void assign (char *dst, const char *src, int maxlen)
524{ 528{
525 if (!src) 529 if (!src)
526 src = ""; 530 src = "";
527 531
… …
542 } 546 }
543 else 547 else
544 memcpy (dst, src, len + 1); 548 memcpy (dst, src, len + 1);
545} 549}
546 550
547const std::string 551const char *
548format (const char *format, ...) 552format (const char *format, ...)
549{ 553{
550 int len; 554 static dynbuf_text buf;
551 555
552 { 556 buf.clear ();
553 char buf[128];
554 557
555 va_list ap; 558 va_list ap;
556 va_start (ap, format); 559 va_start (ap, format);
557 len = vsnprintf (buf, sizeof (buf), format, ap); 560 buf.vprintf (format, ap);
558 va_end (ap); 561 va_end (ap);
559 562
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; 563 return buf;
580 }
581} 564}
582 565
583tstamp now () 566tstamp now ()
584{ 567{
585 struct timeval tv; 568 struct timeval tv;
… …
653 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 636 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
654 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 637 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
655 0x2d02ef8dL 638 0x2d02ef8dL
656}; 639};
657 640
641void thread::start (void *(*start_routine)(void *), void *arg)
642{
643 pthread_attr_t attr;
658 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