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.92 by root, Tue Nov 3 23:18:23 2009 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 it under
9 * under the terms of the GNU General Public License as published by the Free 9 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 11 * 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 Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25/* 25/*
26 * General convenience functions for crossfire. 26 * General convenience functions for deliantra.
27 */ 27 */
28 28
29#include <cstdlib> 29#include <cstdlib>
30#include <sys/types.h> 30#include <sys/types.h>
31#include <unistd.h> 31#include <unistd.h>
32#include <sys/time.h> 32#include <sys/time.h>
33#include <time.h> 33#include <time.h>
34#include <signal.h> 34#include <signal.h>
35 35
36#include <global.h> 36#include <global.h>
37#include <funcpoint.h>
38#include <material.h> 37#include <material.h>
38#include <object.h>
39
40#include <sys/time.h>
41#include <sys/resource.h>
39 42
40#include <glib.h> 43#include <glib.h>
41 44
42rand_gen rndm; 45refcnt_base::refcnt_t refcnt_dummy;
46ssize_t slice_alloc;
47rand_gen rndm, rmg_rndm;
43 48
44void 49void
45tausworthe_random_generator::seed (uint32_t seed) 50tausworthe_random_generator::seed (uint32_t seed)
46{ 51{
47 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; 52 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; 53 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; 54 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; 55 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
51 56
52 for (int i = 11; --i; ) 57 for (int i = 11; --i; )
53 operator ()(); 58 next ();
54} 59}
55 60
56uint32_t 61uint32_t
57tausworthe_random_generator::next () 62tausworthe_random_generator::next ()
58{ 63{
… …
62 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); 67 state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U);
63 68
64 return state [0] ^ state [1] ^ state [2] ^ state [3]; 69 return state [0] ^ state [1] ^ state [2] ^ state [3];
65} 70}
66 71
72template<class generator>
67uint32_t 73uint32_t
68tausworthe_random_generator::get_range (uint32_t num) 74random_number_generator<generator>::get_range (uint32_t num)
69{ 75{
70 return (next () * (uint64_t)num) >> 32U; 76 return (this->next () * (uint64_t)num) >> 32U;
71} 77}
72 78
73// return a number within (min .. max) 79// return a number within (min .. max)
80template<class generator>
74int 81int
75tausworthe_random_generator::get_range (int r_min, int r_max) 82random_number_generator<generator>::get_range (int r_min, int r_max)
76{ 83{
77 return r_min + get_range (max (r_max - r_min + 1, 0)); 84 return r_min + get_range (max (r_max - r_min + 1, 0));
78} 85}
86
87template struct random_number_generator<tausworthe_random_generator>;
88template struct random_number_generator<xorshift_random_generator>;
79 89
80/* 90/*
81 * The random functions here take luck into account when rolling random 91 * The random functions here take luck into account when rolling random
82 * dice or numbers. This function has less of an impact the larger the 92 * dice or numbers. This function has less of an impact the larger the
83 * difference becomes in the random numbers. IE, the effect is lessened 93 * difference becomes in the random numbers. IE, the effect is lessened
… …
93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 103 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
94 */ 104 */
95int 105int
96random_roll (int r_min, int r_max, const object *op, int goodbad) 106random_roll (int r_min, int r_max, const object *op, int goodbad)
97{ 107{
108 r_max = max (r_min, r_max);
109
98 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ 110 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 111
106 if (op->type == PLAYER) 112 if (op->type == PLAYER)
107 { 113 {
108 int luck = op->stats.luck; 114 int luck = op->stats.luck;
109 115
… …
119/* 125/*
120 * This is a 64 bit version of random_roll above. This is needed 126 * This is a 64 bit version of random_roll above. This is needed
121 * for exp loss calculations for players changing religions. 127 * for exp loss calculations for players changing religions.
122 */ 128 */
123sint64 129sint64
124random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 130random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
125{ 131{
126 sint64 omin = min; 132 sint64 omin = r_min;
127 sint64 diff = max - min + 1; 133 sint64 range = max (0, r_max - r_min + 1);
128 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ 134 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 135
136 /* 136 /*
137 * Make a call to get two 32 bit unsigned random numbers, and just to 137 * Make a call to get two 32 bit unsigned random numbers, and just to
138 * a little bitshifting. 138 * a little bitshifting.
139 */ 139 */
140 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); 140 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
141 141
142 if (op->type != PLAYER) 142 if (op->type != PLAYER)
143 return ((ran % diff) + min); 143 return ((ran % range) + r_min);
144 144
145 int luck = op->stats.luck; 145 int luck = op->stats.luck;
146 146
147 if (rndm (base) < MIN (10, abs (luck))) 147 if (rndm (base) < min (10, abs (luck)))
148 { 148 {
149 /* we have a winner */ 149 /* we have a winner */
150 ((luck > 0) ? (luck = 1) : (luck = -1)); 150 ((luck > 0) ? (luck = 1) : (luck = -1));
151 diff -= luck; 151 range -= luck;
152 if (diff < 1) 152 if (range < 1)
153 return (omin); /*check again */ 153 return (omin); /*check again */
154 154
155 ((goodbad) ? (min += luck) : (diff)); 155 ((goodbad) ? (r_min += luck) : (range));
156 156
157 return (MAX (omin, MIN (max, (ran % diff) + min))); 157 return (max (omin, min (r_max, (ran % range) + r_min)));
158 } 158 }
159 159
160 return ran % diff + min; 160 return ran % range + r_min;
161} 161}
162 162
163/* 163/*
164 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 164 * 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. 165 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
… …
204 } 204 }
205 205
206 return total; 206 return total;
207} 207}
208 208
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 */ 209/* convert materialname to materialtype_t */
278 210
279materialtype_t * 211materialtype_t *
280name_to_material (const shstr &name) 212name_to_material (const shstr_cmp name)
281{ 213{
282 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) 214 for (materialtype_t *mt = materialt; mt; mt = mt->next)
283 if (name == mt->name) 215 if (name == mt->name)
284 return mt; 216 return mt;
285 217
286 return materialt; 218 return 0;
287} 219}
288 220
289/* when doing transmutation of objects, we have to recheck the resistances, 221/* when doing transmutation of objects, we have to recheck the resistances,
290 * as some that did not apply previously, may apply now. 222 * as some that did not apply previously, may apply now.
291 */ 223 */
292
293void 224void
294transmute_materialname (object *op, const object *change) 225transmute_materialname (object *op, const object *change)
295{ 226{
296 materialtype_t *mt; 227 materialtype_t *mt;
297 int j; 228 int j;
298 229
299 if (op->materialname == NULL) 230 if (!op->materialname)
300 return; 231 return;
301 232
302 if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) 233 if (op->materialname != change->materialname)
303 return; 234 return;
304 235
305 if (!op->is_armor ()) 236 if (!op->is_armor ())
306 return; 237 return;
307 238
… …
327void 258void
328set_materialname (object *op, int difficulty, materialtype_t *nmt) 259set_materialname (object *op, int difficulty, materialtype_t *nmt)
329{ 260{
330 materialtype_t *mt, *lmt; 261 materialtype_t *mt, *lmt;
331 262
332#ifdef NEW_MATERIAL_CODE
333 int j;
334#endif
335
336 if (op->materialname != NULL) 263 if (!op->materialname)
337 return; 264 return;
338 265
339 266 if (nmt)
340 267 lmt = nmt;
341 if (nmt == NULL) 268 else
342 { 269 {
343 lmt = NULL; 270 lmt = 0;
344#ifndef NEW_MATERIAL_CODE 271
345 for (mt = materialt; mt && mt->next; mt = mt->next) 272 for (mt = materialt; mt; mt = mt->next)
346 { 273 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
347 if (op->materials & mt->material) 274 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
348 { 275 {
349 lmt = mt; 276 lmt = mt;
277 if (!(op->is_weapon () || op->is_armor ()))
350 break; 278 break;
351 } 279 }
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 }
367 else
368 { 280 }
369 lmt = nmt; 281
282 if (lmt)
370 } 283 {
371
372 if (lmt != NULL)
373 {
374#ifndef NEW_MATERIAL_CODE
375 op->materialname = lmt->name;
376 return;
377#else
378
379 if (op->stats.dam && op->is_weapon ()) 284 if (op->stats.dam && op->is_weapon ())
380 { 285 {
381 op->stats.dam += lmt->damage; 286 op->stats.dam += lmt->damage;
382 if (op->stats.dam < 1) 287 if (op->stats.dam < 1)
383 op->stats.dam = 1; 288 op->stats.dam = 1;
… …
389 op->stats.wc += lmt->wc; 294 op->stats.wc += lmt->wc;
390 if (op->is_armor ()) 295 if (op->is_armor ())
391 { 296 {
392 if (op->stats.ac) 297 if (op->stats.ac)
393 op->stats.ac += lmt->ac; 298 op->stats.ac += lmt->ac;
299
394 for (j = 0; j < NROFATTACKS; j++) 300 for (int j = 0; j < NROFATTACKS; j++)
395 if (op->resist[j] != 0) 301 if (op->resist[j] != 0)
396 { 302 {
397 op->resist[j] += lmt->mod[j]; 303 op->resist[j] += lmt->mod[j];
398 if (op->resist[j] > 100) 304 if (op->resist[j] > 100)
399 op->resist[j] = 100; 305 op->resist[j] = 100;
400 if (op->resist[j] < -100) 306 if (op->resist[j] < -100)
401 op->resist[j] = -100; 307 op->resist[j] = -100;
402 } 308 }
403 } 309 }
310
404 op->materialname = lmt->name; 311 op->materialname = lmt->name;
405 /* dont make it unstackable if it doesn't need to be */ 312 /* dont make it unstackable if it doesn't need to be */
406 if (op->is_weapon () || op->is_armor ()) 313 if (op->is_weapon () || op->is_armor ())
407 { 314 {
408 op->weight = (op->weight * lmt->weight) / 100; 315 op->weight = (op->weight * lmt->weight) / 100;
409 op->value = (op->value * lmt->value) / 100; 316 op->value = (op->value * lmt->value) / 100;
410 } 317 }
411#endif
412 } 318 }
413} 319}
414 320
415/* 321/*
416 * Strip out the media tags from a String. 322 * Strip out the media tags from a String.
… …
504 } 410 }
505 } 411 }
506 result[resultlen] = '\0'; 412 result[resultlen] = '\0';
507} 413}
508 414
509/** 415/******************************************************************************/
510 * Taking a string as an argument, mutate it into a string that looks like a list.
511 * 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.
513 * This function will also strip all trailing non alphanumeric characters.
514 * It does not insert an oxford comma.
515 */
516 416
517void 417/* Checks a player-provided string which will become the msg property of
518make_list_like (char *input) 418 * an object for dangerous input.
419 */
420bool
421msg_is_safe (const char *msg)
519{ 422{
520 char *p, tmp[MAX_BUF]; 423 bool safe = true;
521 int i;
522 424
523 if (!input || strlen (input) > MAX_BUF - 5) 425 /* Trying to cheat by getting data into the object */
524 return; 426 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
525 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ 427 || strstr (msg, "\nendmsg"))
428 safe = false;
526 429
527 strncpy (tmp, input, MAX_BUF - 5); 430 /* Trying to make the object talk, and potentially access arbitrary code */
528 /*trim all trailing commas, spaces etc. */ 431 if (object::msg_has_dialogue (msg))
529 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) 432 safe = false;
530 tmp[i] = '\0';
531 433
532 strcat (tmp, ".");
533
534 p = strrchr (tmp, ',');
535 if (p)
536 {
537 *p = '\0';
538 strcpy (input, tmp);
539 p++;
540 strcat (input, " and");
541 strcat (input, p);
542 }
543 else
544 strcpy (input, tmp);
545
546 return; 434 return safe;
547} 435}
548 436
549///////////////////////////////////////////////////////////////////////////// 437/////////////////////////////////////////////////////////////////////////////
550 438
551void 439void
552fork_abort (const char *msg) 440fork_abort (const char *msg)
553{ 441{
554 if (!fork ()) 442 if (!fork ())
555 { 443 {
444 signal (SIGINT , SIG_IGN);
445 signal (SIGTERM, SIG_IGN);
556 signal (SIGABRT, SIG_DFL); 446 signal (SIGABRT, SIG_IGN);
447
448 signal (SIGSEGV, SIG_DFL);
449 signal (SIGBUS , SIG_DFL);
450 signal (SIGILL , SIG_DFL);
451 signal (SIGTRAP, SIG_DFL);
452
557 // try to put corefiles into a subdirectory, if existing, to allow 453 // try to put corefiles into a subdirectory, if existing, to allow
558 // an administrator to reduce the I/O load. 454 // an administrator to reduce the I/O load.
559 chdir ("cores"); 455 chdir ("cores");
456
457 // try to detach us from as many external dependencies as possible
458 // as coredumping can take time by closing all fd's.
459 {
460 struct rlimit lim;
461
462 if (getrlimit (RLIMIT_NOFILE, &lim))
463 lim.rlim_cur = 1024;
464
465 for (int i = 0; i < lim.rlim_cur; ++i)
466 close (i);
467 }
468
469 {
470 sigset_t empty;
471 sigemptyset (&empty);
472 sigprocmask (SIG_SETMASK, &empty, 0);
473 }
474
475 // try to coredump with SIGTRAP
476 kill (getpid (), SIGTRAP);
560 abort (); 477 abort ();
561 } 478 }
562 479
563 LOG (llevError, "fork abort: %s\n", msg); 480 LOG (llevError, "fork abort: %s\n", msg);
564} 481}
565 482
566void *salloc_ (int n) throw (std::bad_alloc) 483void *salloc_ (int n) throw (std::bad_alloc)
567{ 484{
568#ifdef PREFER_MALLOC
569 void *ptr = malloc (n);
570#else
571 void *ptr = g_slice_alloc (n); 485 void *ptr = g_slice_alloc (n);
572#endif
573 486
574 if (!ptr) 487 if (!ptr)
575 throw std::bad_alloc (); 488 throw std::bad_alloc ();
576 489
490 slice_alloc += n;
577 return ptr; 491 return ptr;
578} 492}
579 493
580void *salloc_ (int n, void *src) throw (std::bad_alloc) 494void *salloc_ (int n, void *src) throw (std::bad_alloc)
581{ 495{
… …
587 memset (ptr, 0, n); 501 memset (ptr, 0, n);
588 502
589 return ptr; 503 return ptr;
590} 504}
591 505
506/******************************************************************************/
507
508#if DEBUG_SALLOC
509
510#define MAGIC 0xa1b2c35543deadLL
511
512void *g_slice_alloc (unsigned long size)
513{
514 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
515 *p++ = size ^ MAGIC;
516 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
517 return (void *)p;
518}
519
520void *g_slice_alloc0 (unsigned long size)
521{
522 return memset (g_slice_alloc (size), 0, size);
523}
524
525void g_slice_free1 (unsigned long size, void *ptr)
526{
527 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
528 if (expect_true (ptr))
529 {
530 unsigned long *p = (unsigned long *)ptr;
531 unsigned long s = *--p ^ MAGIC;
532
533 if (size != (unsigned long)(*p ^ MAGIC))
534 {
535 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
536 abort ();
537 }
538
539 *p = MAGIC;
540
541 (g_slice_free1)(s + sizeof (unsigned long), p);
542 }
543}
544
545#endif
546
547/******************************************************************************/
548
549int
592void assign (char *dst, const char *src, int maxlen) 550assign (char *dst, const char *src, int maxsize)
593{ 551{
594 if (!src) 552 if (!src)
595 src = ""; 553 src = "";
596 554
597 int len = strlen (src); 555 int len = strlen (src);
598 556
599 if (len >= maxlen - 1) 557 if (len >= maxsize)
600 { 558 {
601 if (maxlen <= 4) 559 if (maxsize <= 4)
602 { 560 {
603 memset (dst, '.', maxlen - 1); 561 memset (dst, '.', maxsize - 2);
604 dst [maxlen - 1] = 0; 562 dst [maxsize - 1] = 0;
605 } 563 }
606 else 564 else
607 { 565 {
608 memcpy (dst, src, maxlen - 4); 566 memcpy (dst, src, maxsize - 4);
609 memcpy (dst + maxlen - 4, "...", 4); 567 memcpy (dst + maxsize - 4, "...", 4);
610 } 568 }
569
570 len = maxsize;
611 } 571 }
612 else 572 else
613 memcpy (dst, src, len + 1); 573 memcpy (dst, src, ++len);
614}
615 574
616const std::string 575 return len;
576}
577
578char *
579vformat (const char *format, va_list ap)
580{
581 static dynbuf_text buf; buf.clear ();
582 buf.vprintf (format, ap);
583 return buf;
584}
585
586char *
617format (const char *format, ...) 587format (const char *format, ...)
618{ 588{
619 int len;
620
621 {
622 char buf[128];
623
624 va_list ap; 589 va_list ap;
625 va_start (ap, format); 590 va_start (ap, format);
626 len = vsnprintf (buf, sizeof (buf), format, ap); 591 char *buf = vformat (format, ap);
627 va_end (ap); 592 va_end (ap);
628 593
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; 594 return buf;
649 }
650} 595}
651 596
652tstamp now () 597tstamp now ()
653{ 598{
654 struct timeval tv; 599 struct timeval tv;
… …
722 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, 667 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
723 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, 668 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
724 0x2d02ef8dL 669 0x2d02ef8dL
725}; 670};
726 671
672void thread::start (void *(*start_routine)(void *), void *arg)
673{
674 pthread_attr_t attr;
727 675
676 pthread_attr_init (&attr);
677 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
678 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
679 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
680#ifdef PTHREAD_SCOPE_PROCESS
681 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
682#endif
683
684 sigset_t fullsigset, oldsigset;
685 sigfillset (&fullsigset);
686
687 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
688
689 if (pthread_create (&id, &attr, start_routine, arg))
690 cleanup ("unable to create a new thread");
691
692 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
693}
694

Diff Legend

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