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.58 by root, Mon Jun 4 12:19:08 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 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.
… …
204 } 197 }
205 198
206 return total; 199 return total;
207} 200}
208 201
209/* decay and destroy perishable items in a map */
210void
211maptile::decay_objects ()
212{
213 if (!spaces)
214 return;
215
216 for (mapspace *ms = spaces + size (); ms-- > spaces; )
217 for (object *above, *op = ms->bot; op; op = above)
218 {
219 above = op->above;
220
221 bool destroy = 0;
222
223 // do not decay anything above unique floor tiles (yet :)
224 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
225 break;
226
227 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
228 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
229 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
230 || QUERY_FLAG (op, FLAG_UNIQUE)
231 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
232 || QUERY_FLAG (op, FLAG_UNPAID)
233 || op->is_alive ())
234 ; // do not decay
235 else if (op->is_weapon ())
236 {
237 op->stats.dam--;
238 if (op->stats.dam < 0)
239 destroy = 1;
240 }
241 else if (op->is_armor ())
242 {
243 op->stats.ac--;
244 if (op->stats.ac < 0)
245 destroy = 1;
246 }
247 else if (op->type == FOOD)
248 {
249 op->stats.food -= rndm (5, 20);
250 if (op->stats.food < 0)
251 destroy = 1;
252 }
253 else
254 {
255 int mat = op->materials;
256
257 if (mat & M_PAPER
258 || mat & M_LEATHER
259 || mat & M_WOOD
260 || mat & M_ORGANIC
261 || mat & M_CLOTH
262 || mat & M_LIQUID
263 || (mat & M_IRON && rndm (1, 5) == 1)
264 || (mat & M_GLASS && rndm (1, 2) == 1)
265 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
266 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
267 || (mat & M_ICE && temp > 32))
268 destroy = 1;
269 }
270
271 /* adjust overall chance below */
272 if (destroy && rndm (0, 1))
273 op->destroy ();
274 }
275}
276
277/* convert materialname to materialtype_t */ 202/* convert materialname to materialtype_t */
278 203
279materialtype_t * 204materialtype_t *
280name_to_material (const shstr &name) 205name_to_material (const shstr &name)
281{ 206{
282 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 207 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
283 if (name == mt->name) 208 if (name == mt->name)
284 return mt; 209 return mt;
285 210
286 return materialt; 211 return 0;
287} 212}
288 213
289/* when doing transmutation of objects, we have to recheck the resistances, 214/* when doing transmutation of objects, we have to recheck the resistances,
290 * as some that did not apply previously, may apply now. 215 * as some that did not apply previously, may apply now.
291 */ 216 */
292
293void 217void
294transmute_materialname (object *op, const object *change) 218transmute_materialname (object *op, const object *change)
295{ 219{
296 materialtype_t *mt; 220 materialtype_t *mt;
297 int j; 221 int j;
… …
327void 251void
328set_materialname (object *op, int difficulty, materialtype_t *nmt) 252set_materialname (object *op, int difficulty, materialtype_t *nmt)
329{ 253{
330 materialtype_t *mt, *lmt; 254 materialtype_t *mt, *lmt;
331 255
332#ifdef NEW_MATERIAL_CODE
333 int j;
334#endif
335
336 if (op->materialname != NULL) 256 if (op->materialname != NULL)
337 return; 257 return;
338 258
339
340
341 if (nmt == NULL) 259 if (nmt == NULL)
342 { 260 {
343 lmt = NULL; 261 lmt = NULL;
344#ifndef NEW_MATERIAL_CODE 262
345 for (mt = materialt; mt && mt->next; mt = mt->next) 263 for (mt = materialt; mt && mt->next; mt = mt->next)
346 { 264 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
347 if (op->materials & mt->material) 265 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
348 { 266 {
349 lmt = mt; 267 lmt = mt;
268 if (!(op->is_weapon () || op->is_armor ()))
350 break; 269 break;
351 } 270 }
352 }
353
354#else
355 for (mt = materialt; mt && mt->next; mt = mt->next)
356 {
357 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
358 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
359 {
360 lmt = mt;
361 if (!(op->is_weapon () || op->is_armor ()))
362 break;
363 }
364 }
365#endif
366 } 271 }
367 else 272 else
368 {
369 lmt = nmt; 273 lmt = nmt;
370 }
371 274
372 if (lmt != NULL) 275 if (lmt != NULL)
373 { 276 {
374#ifndef NEW_MATERIAL_CODE
375 op->materialname = lmt->name;
376 return;
377#else
378
379 if (op->stats.dam && op->is_weapon ()) 277 if (op->stats.dam && op->is_weapon ())
380 { 278 {
381 op->stats.dam += lmt->damage; 279 op->stats.dam += lmt->damage;
382 if (op->stats.dam < 1) 280 if (op->stats.dam < 1)
383 op->stats.dam = 1; 281 op->stats.dam = 1;
… …
389 op->stats.wc += lmt->wc; 287 op->stats.wc += lmt->wc;
390 if (op->is_armor ()) 288 if (op->is_armor ())
391 { 289 {
392 if (op->stats.ac) 290 if (op->stats.ac)
393 op->stats.ac += lmt->ac; 291 op->stats.ac += lmt->ac;
292
394 for (j = 0; j < NROFATTACKS; j++) 293 for (int j = 0; j < NROFATTACKS; j++)
395 if (op->resist[j] != 0) 294 if (op->resist[j] != 0)
396 { 295 {
397 op->resist[j] += lmt->mod[j]; 296 op->resist[j] += lmt->mod[j];
398 if (op->resist[j] > 100) 297 if (op->resist[j] > 100)
399 op->resist[j] = 100; 298 op->resist[j] = 100;
400 if (op->resist[j] < -100) 299 if (op->resist[j] < -100)
401 op->resist[j] = -100; 300 op->resist[j] = -100;
402 } 301 }
403 } 302 }
303
404 op->materialname = lmt->name; 304 op->materialname = lmt->name;
405 /* dont make it unstackable if it doesn't need to be */ 305 /* dont make it unstackable if it doesn't need to be */
406 if (op->is_weapon () || op->is_armor ()) 306 if (op->is_weapon () || op->is_armor ())
407 { 307 {
408 op->weight = (op->weight * lmt->weight) / 100; 308 op->weight = (op->weight * lmt->weight) / 100;
409 op->value = (op->value * lmt->value) / 100; 309 op->value = (op->value * lmt->value) / 100;
410 } 310 }
411#endif
412 } 311 }
413} 312}
414 313
415/* 314/*
416 * Strip out the media tags from a String. 315 * Strip out the media tags from a String.
… …
511 * 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
512 * 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.
513 * This function will also strip all trailing non alphanumeric characters. 412 * This function will also strip all trailing non alphanumeric characters.
514 * It does not insert an oxford comma. 413 * It does not insert an oxford comma.
515 */ 414 */
516
517void 415void
518make_list_like (char *input) 416make_list_like (char *input)
519{ 417{
520 char *p, tmp[MAX_BUF]; 418 char *p, tmp[MAX_BUF];
521 int i; 419 int i;
… …
552fork_abort (const char *msg) 450fork_abort (const char *msg)
553{ 451{
554 if (!fork ()) 452 if (!fork ())
555 { 453 {
556 signal (SIGABRT, SIG_DFL); 454 signal (SIGABRT, SIG_DFL);
455
557 // try to put corefiles into a subdirectory, if existing, to allow 456 // try to put corefiles into a subdirectory, if existing, to allow
558 // an administrator to reduce the I/O load. 457 // an administrator to reduce the I/O load.
559 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
560 abort (); 472 abort ();
561 } 473 }
562 474
563 LOG (llevError, "fork abort: %s\n", msg); 475 LOG (llevError, "fork abort: %s\n", msg);
564} 476}
565 477
566void *salloc_ (int n) throw (std::bad_alloc) 478void *salloc_ (int n) throw (std::bad_alloc)
567{ 479{
568#ifdef PREFER_MALLOC
569 void *ptr = malloc (n);
570#else
571 void *ptr = g_slice_alloc (n); 480 void *ptr = g_slice_alloc (n);
572#endif
573 481
574 if (!ptr) 482 if (!ptr)
575 throw std::bad_alloc (); 483 throw std::bad_alloc ();
576 484
485 slice_alloc += n;
577 return ptr; 486 return ptr;
578} 487}
579 488
580void *salloc_ (int n, void *src) throw (std::bad_alloc) 489void *salloc_ (int n, void *src) throw (std::bad_alloc)
581{ 490{
… …
587 memset (ptr, 0, n); 496 memset (ptr, 0, n);
588 497
589 return ptr; 498 return ptr;
590} 499}
591 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
592void assign (char *dst, const char *src, int maxlen) 544void assign (char *dst, const char *src, int maxlen)
593{ 545{
594 if (!src) 546 if (!src)
595 src = ""; 547 src = "";
596 548
… …
611 } 563 }
612 else 564 else
613 memcpy (dst, src, len + 1); 565 memcpy (dst, src, len + 1);
614} 566}
615 567
616const std::string 568const char *
617format (const char *format, ...) 569format (const char *format, ...)
618{ 570{
619 int len; 571 static dynbuf_text buf;
620 572
621 { 573 buf.clear ();
622 char buf[128];
623 574
624 va_list ap; 575 va_list ap;
625 va_start (ap, format); 576 va_start (ap, format);
626 len = vsnprintf (buf, sizeof (buf), format, ap); 577 buf.vprintf (format, ap);
627 va_end (ap); 578 va_end (ap);
628 579
629 assert (len >= 0); // shield againstz broken vsnprintf's
630
631 // was our static buffer short enough?
632 if (len < sizeof (buf))
633 return std::string (buf, len);
634 }
635
636 {
637 // longer, try harder
638 char *buf = salloc<char> (len + 1);
639
640 va_list ap;
641 va_start (ap, format);
642 vsnprintf (buf, len + 1, format, ap);
643 va_end (ap);
644
645 const std::string s (buf, len);
646 sfree<char> (buf, len + 1);
647
648 return buf; 580 return buf;
649 }
650} 581}
651 582
652tstamp now () 583tstamp now ()
653{ 584{
654 struct timeval tv; 585 struct timeval tv;
… …
722 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 653 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
723 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 654 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
724 0x2d02ef8dL 655 0x2d02ef8dL
725}; 656};
726 657
658void thread::start (void *(*start_routine)(void *), void *arg)
659{
660 pthread_attr_t attr;
727 661
662 pthread_attr_init (&attr);
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);
668#endif
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