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.61 by root, Tue Jul 10 05:51:37 2007 UTC vs.
Revision 1.75 by root, Tue Apr 15 03:16:02 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 */
36#include <funcpoint.h> 36#include <funcpoint.h>
37#include <material.h> 37#include <material.h>
38 38
39#include <glib.h> 39#include <glib.h>
40 40
41refcnt_base::refcnt_t refcnt_dummy;
42ssize_t slice_alloc;
41rand_gen rndm; 43rand_gen rndm;
42 44
43void 45void
44tausworthe_random_generator::seed (uint32_t seed) 46tausworthe_random_generator::seed (uint32_t seed)
45{ 47{
46 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 48 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
47 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; 49 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; 50 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; 51 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
50 52
51 for (int i = 11; --i; ) 53 for (int i = 11; --i; )
52 operator ()(); 54 operator ()();
53} 55}
54 56
212{ 214{
213 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 215 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
214 if (name == mt->name) 216 if (name == mt->name)
215 return mt; 217 return mt;
216 218
217 return materialt; 219 return 0;
218} 220}
219 221
220/* when doing transmutation of objects, we have to recheck the resistances, 222/* when doing transmutation of objects, we have to recheck the resistances,
221 * as some that did not apply previously, may apply now. 223 * as some that did not apply previously, may apply now.
222 */ 224 */
223
224void 225void
225transmute_materialname (object *op, const object *change) 226transmute_materialname (object *op, const object *change)
226{ 227{
227 materialtype_t *mt; 228 materialtype_t *mt;
228 int j; 229 int j;
417 * a 'list' for the purposes here, is a string of items, seperated by commas, except 418 * a 'list' for the purposes here, is a string of items, seperated by commas, except
418 * for the last entry, which has an 'and' before it, and a full stop (period) after it. 419 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
419 * This function will also strip all trailing non alphanumeric characters. 420 * This function will also strip all trailing non alphanumeric characters.
420 * It does not insert an oxford comma. 421 * It does not insert an oxford comma.
421 */ 422 */
422
423void 423void
424make_list_like (char *input) 424make_list_like (char *input)
425{ 425{
426 char *p, tmp[MAX_BUF]; 426 char *p, tmp[MAX_BUF];
427 int i; 427 int i;
469 LOG (llevError, "fork abort: %s\n", msg); 469 LOG (llevError, "fork abort: %s\n", msg);
470} 470}
471 471
472void *salloc_ (int n) throw (std::bad_alloc) 472void *salloc_ (int n) throw (std::bad_alloc)
473{ 473{
474#ifdef PREFER_MALLOC
475 void *ptr = malloc (n);
476#else
477 void *ptr = g_slice_alloc (n); 474 void *ptr = g_slice_alloc (n);
478#endif
479 475
480 if (!ptr) 476 if (!ptr)
481 throw std::bad_alloc (); 477 throw std::bad_alloc ();
482 478
479 slice_alloc += n;
483 return ptr; 480 return ptr;
484} 481}
485 482
486void *salloc_ (int n, void *src) throw (std::bad_alloc) 483void *salloc_ (int n, void *src) throw (std::bad_alloc)
487{ 484{
493 memset (ptr, 0, n); 490 memset (ptr, 0, n);
494 491
495 return ptr; 492 return ptr;
496} 493}
497 494
495/******************************************************************************/
496
497#if DEBUG_SALLOC
498
499#define MAGIC 0xa1b2c35543deadLL
500
501void *g_slice_alloc (unsigned long size)
502{
503 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
504 *p++ = size ^ MAGIC;
505 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
506 return (void *)p;
507}
508
509void *g_slice_alloc0 (unsigned long size)
510{
511 return memset (g_slice_alloc (size), 0, size);
512}
513
514void g_slice_free1 (unsigned long size, void *ptr)
515{
516 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
517 if (expect_true (ptr))
518 {
519 unsigned long *p = (unsigned long *)ptr;
520 unsigned long s = *--p ^ MAGIC;
521
522 if (size != (unsigned long)(*p ^ MAGIC))
523 {
524 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
525 abort ();
526 }
527
528 *p = MAGIC;
529
530 (g_slice_free1)(s + sizeof (unsigned long), p);
531 }
532}
533
534#endif
535
536/******************************************************************************/
537
498void assign (char *dst, const char *src, int maxlen) 538void assign (char *dst, const char *src, int maxlen)
499{ 539{
500 if (!src) 540 if (!src)
501 src = ""; 541 src = "";
502 542
517 } 557 }
518 else 558 else
519 memcpy (dst, src, len + 1); 559 memcpy (dst, src, len + 1);
520} 560}
521 561
522const std::string 562const char *
523format (const char *format, ...) 563format (const char *format, ...)
524{ 564{
525 int len; 565 static dynbuf_text buf;
526 566
527 { 567 buf.clear ();
528 char buf[128];
529 568
530 va_list ap; 569 va_list ap;
531 va_start (ap, format); 570 va_start (ap, format);
532 len = vsnprintf (buf, sizeof (buf), format, ap); 571 buf.vprintf (format, ap);
533 va_end (ap); 572 va_end (ap);
534 573
535 assert (len >= 0); // shield againstz broken vsnprintf's
536
537 // was our static buffer short enough?
538 if (len < sizeof (buf))
539 return std::string (buf, len);
540 }
541
542 {
543 // longer, try harder
544 char *buf = salloc<char> (len + 1);
545
546 va_list ap;
547 va_start (ap, format);
548 vsnprintf (buf, len + 1, format, ap);
549 va_end (ap);
550
551 const std::string s (buf, len);
552 sfree<char> (buf, len + 1);
553
554 return buf; 574 return buf;
555 }
556} 575}
557 576
558tstamp now () 577tstamp now ()
559{ 578{
560 struct timeval tv; 579 struct timeval tv;
628 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 647 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
629 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 648 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
630 0x2d02ef8dL 649 0x2d02ef8dL
631}; 650};
632 651
652void thread::start (void *(*start_routine)(void *), void *arg)
653{
654 pthread_attr_t attr;
633 655
656 pthread_attr_init (&attr);
657 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
658 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
659 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
660#ifdef PTHREAD_SCOPE_PROCESS
661 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
662#endif
663
664 sigset_t fullsigset, oldsigset;
665 sigfillset (&fullsigset);
666
667 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
668
669 if (pthread_create (&id, &attr, start_routine, arg))
670 cleanup ("unable to create a new thread");
671
672 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
673}
674

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines