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.32 by root, Sat Dec 30 10:16:10 2006 UTC vs.
Revision 1.110 by root, Sat Oct 8 21:54:05 2022 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 4 * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
5 Copyright (C) 1992 Frank Tore Johansen 5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
6 6 *
7 This program is free software; you can redistribute it and/or modify 7 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 8 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 9 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 10 * option) any later version.
11 11 *
12 This program is distributed in the hope that it will be useful, 12 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 15 * GNU General Public License for more details.
16 16 *
17 You should have received a copy of the GNU General Public License 17 * You should have received a copy of the Affero GNU General Public License
18 along with this program; if not, write to the Free Software 18 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 * <http://www.gnu.org/licenses/>.
20 20 *
21 The authors can be reached via e-mail at <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 deliantra.
26 */ 26 */
27 27
28#include <global.h> 28#include <cstdlib>
29#include <sys/types.h>
29#include <funcpoint.h> 30#include <unistd.h>
30#include <material.h>
31
32#include <sys/time.h> 31#include <sys/time.h>
33#include <time.h> 32#include <time.h>
33#include <signal.h>
34
35#include <global.h>
36#include <material.h>
37#include <object.h>
38
39#include <sys/time.h>
40#include <sys/resource.h>
41
34#include <glib.h> 42#include <glib.h>
35 43
36/* 44refcnt_base::refcnt_t refcnt_dummy;
37 * The random functions here take luck into account when rolling random 45ssize_t slice_alloc;
38 * dice or numbers. This function has less of an impact the larger the 46
39 * difference becomes in the random numbers. IE, the effect is lessened 47/******************************************************************************/
40 * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers, 48
41 * to specifically disable luck in certain rolls, simply by making the 49/* Checks a player-provided string which will become the msg property of
42 * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3) 50 * an object for dangerous input.
43 */ 51 */
44 52bool
45/* 53msg_is_safe (const char *msg)
46 * Roll a random number between min and max. Uses op to determine luck,
47 * and if goodbad is non-zero, luck increases the roll, if zero, it decreases.
48 * Generally, op should be the player/caster/hitter requesting the roll,
49 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50 */
51
52int
53random_roll (int min, int max, const object *op, int goodbad)
54{ 54{
55 int omin, diff, luck, base, ran; 55 bool safe = true;
56 56
57 omin = min; 57 /* Trying to cheat by getting data into the object */
58 diff = max - min + 1; 58 if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1)
59 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 59 || strstr (msg, "\nendmsg"))
60 safe = false;
60 61
61 if (max < 1 || diff < 1) 62 /* Trying to make the object talk, and potentially access arbitrary code */
63 if (object::msg_has_dialogue (msg))
64 safe = false;
65
66 return safe;
67}
68
69/////////////////////////////////////////////////////////////////////////////
70
71void
72fork_abort (const char *msg)
73{
74 if (!fork ())
62 { 75 {
63 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max); 76 signal (SIGINT , SIG_IGN);
64 return (min); /* avoids a float exception */ 77 signal (SIGTERM, SIG_IGN);
78 signal (SIGABRT, SIG_IGN);
79
80 signal (SIGSEGV, SIG_DFL);
81 signal (SIGFPE , SIG_DFL);
82#ifdef SIGBUS
83 signal (SIGBUS , SIG_DFL);
84#endif
85 signal (SIGILL , SIG_DFL);
86 signal (SIGTRAP, SIG_DFL);
87
88 // try to put corefiles into a subdirectory, if existing, to allow
89 // an administrator to reduce the I/O load.
90 chdir ("cores");
91
92 // try to detach us from as many external dependencies as possible
93 // as coredumping can take time by closing all fd's.
94 {
95 struct rlimit lim;
96
97 if (getrlimit (RLIMIT_NOFILE, &lim))
98 lim.rlim_cur = 1024;
99
100 for (int i = 0; i < lim.rlim_cur; ++i)
101 close (i);
102 }
103
104 {
105 sigset_t empty;
106 sigemptyset (&empty);
107 sigprocmask (SIG_SETMASK, &empty, 0);
108 }
109
110 // try to coredump with SIGTRAP
111 kill (getpid (), SIGTRAP);
112 abort ();
65 } 113 }
66 114
67 ran = RANDOM (); 115 LOG (llevError, "fork abort: %s\n", msg);
116}
68 117
69 if (op->type != PLAYER) 118void *
70 return ((ran % diff) + min); 119salloc_ (int n) noexcept
120{
121 void *ptr = g_slice_alloc (n);
71 122
72 luck = op->stats.luck; 123 if (ecb_expect_false (!ptr))
73 if (RANDOM () % base < MIN (10, abs (luck)))
74 { 124 {
75 /* we have a winner */ 125 LOG (llevError, "out of memory allocating %d bytes, aborting.\n", n);
76 ((luck > 0) ? (luck = 1) : (luck = -1)); 126 abort ();
77 diff -= luck;
78 if (diff < 1)
79 return (omin); /*check again */
80 ((goodbad) ? (min += luck) : (diff));
81
82 return (MAX (omin, MIN (max, (ran % diff) + min)));
83 } 127 }
84 return ((ran % diff) + min);
85}
86 128
87/* 129 slice_alloc += n;
88 * This is a 64 bit version of random_roll above. This is needed
89 * for exp loss calculations for players changing religions.
90 */
91
92sint64
93random_roll64 (sint64 min, sint64 max, const object *op, int goodbad)
94{
95 sint64 omin, diff, luck, ran;
96 int base;
97
98 omin = min;
99 diff = max - min + 1;
100 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
101
102 if (max < 1 || diff < 1)
103 {
104 LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max);
105 return (min); /* avoids a float exception */
106 }
107
108 /* Don't know of a portable call to get 64 bit random values.
109 * So make a call to get two 32 bit random numbers, and just to
110 * a little byteshifting. Do make sure the first one is only
111 * 32 bit, so we don't get skewed results
112 */
113 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32);
114
115 if (op->type != PLAYER)
116 return ((ran % diff) + min);
117
118 luck = op->stats.luck;
119 if (RANDOM () % base < MIN (10, abs (luck)))
120 {
121 /* we have a winner */
122 ((luck > 0) ? (luck = 1) : (luck = -1));
123 diff -= luck;
124 if (diff < 1)
125 return (omin); /*check again */
126 ((goodbad) ? (min += luck) : (diff));
127
128 return (MAX (omin, MIN (max, (ran % diff) + min)));
129 }
130 return ((ran % diff) + min);
131}
132
133/*
134 * Roll a number of dice (2d3, 4d6). Uses op to determine luck,
135 * If goodbad is non-zero, luck increases the roll, if zero, it decreases.
136 * Generally, op should be the player/caster/hitter requesting the roll,
137 * not the recipient (ie, the poor slob getting hit).
138 * The args are num D size (ie 4d6) [garbled 20010916]
139 */
140
141int
142die_roll (int num, int size, const object *op, int goodbad)
143{
144 int min, diff, luck, total, i, gotlucky, base, ran;
145
146 diff = size;
147 min = 1;
148 luck = total = gotlucky = 0;
149 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
150 if (size < 2 || diff < 1)
151 {
152 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
153 return (num); /* avoids a float exception */
154 }
155
156 if (op->type == PLAYER)
157 luck = op->stats.luck;
158
159 for (i = 0; i < num; i++)
160 {
161 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky)
162 {
163 /* we have a winner */
164 gotlucky++;
165 ((luck > 0) ? (luck = 1) : (luck = -1));
166 diff -= luck;
167 if (diff < 1)
168 return (num); /*check again */
169 ((goodbad) ? (min += luck) : (diff));
170 ran = RANDOM ();
171 total += MAX (1, MIN (size, (ran % diff) + min));
172 }
173 else
174 {
175 total += RANDOM () % size + 1;
176 }
177 }
178 return (total);
179}
180
181/*
182 * Another convenience function. Returns a number between min and max.
183 * It is suggested one use these functions rather than RANDOM()%, as it
184 * would appear that a number of off-by-one-errors exist due to improper
185 * use of %. This should also prevent SIGFPE.
186 */
187
188int
189rndm (int min, int max)
190{
191 int diff;
192
193 diff = max - min + 1;
194 if (max < 1 || diff < 1)
195 return (min);
196
197 return (RANDOM () % diff + min);
198}
199
200/* decay and destroy persihable items in a map */
201void
202maptile::decay_objects ()
203{
204 int x, y, destroy;
205 object *op, *otmp;
206
207 for (x = 0; x < width; x++)
208 for (y = 0; y < height; y++)
209 for (op = at (x, y).bot; op; op = otmp)
210 {
211 destroy = 0;
212 otmp = op->above;
213
214 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
215 break;
216
217 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
218 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
219 || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL)
220 || QUERY_FLAG (op, FLAG_UNIQUE)
221 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
222 || QUERY_FLAG (op, FLAG_UNPAID)
223 || op->is_alive ())
224 continue;
225
226 /* otherwise, we decay and destroy */
227 if (op->is_weapon ())
228 {
229 op->stats.dam--;
230 if (op->stats.dam < 0)
231 destroy = 1;
232 }
233 else if (op->is_armor ())
234 {
235 op->stats.ac--;
236 if (op->stats.ac < 0)
237 destroy = 1;
238 }
239 else if (op->type == FOOD)
240 {
241 op->stats.food -= rndm (5, 20);
242 if (op->stats.food < 0)
243 destroy = 1;
244 }
245 else
246 {
247 if (op->material & M_PAPER || op->material & M_LEATHER ||
248 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID)
249 destroy = 1;
250
251 if (op->material & M_IRON && rndm (1, 5) == 1)
252 destroy = 1;
253
254 if (op->material & M_GLASS && rndm (1, 2) == 1)
255 destroy = 1;
256
257 if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
258 destroy = 1;
259
260 if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
261 destroy = 1;
262
263 if (op->material & M_ICE && temp > 32)
264 destroy = 1;
265 }
266
267 /* adjust overall chance below */
268 if (destroy && rndm (0, 1))
269 op->destroy ();
270 }
271}
272
273/* convert materialname to materialtype_t */
274
275materialtype_t *
276name_to_material (const char *name)
277{
278 materialtype_t *mt, *nmt;
279
280 mt = NULL;
281 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
282 {
283 if (strcmp (name, nmt->name) == 0)
284 {
285 mt = nmt;
286 break;
287 }
288 }
289 return mt;
290}
291
292/* when doing transmutation of objects, we have to recheck the resistances,
293 * as some that did not apply previously, may apply now.
294 */
295
296void
297transmute_materialname (object *op, const object *change)
298{
299 materialtype_t *mt;
300 int j;
301
302 if (op->materialname == NULL)
303 return;
304
305 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
306 return;
307
308 if (!op->is_armor ())
309 return;
310
311 mt = name_to_material (op->materialname);
312 if (!mt)
313 {
314 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname);
315 return;
316 }
317
318 for (j = 0; j < NROFATTACKS; j++)
319 if (op->resist[j] == 0 && change->resist[j] != 0)
320 {
321 op->resist[j] += mt->mod[j];
322 if (op->resist[j] > 100)
323 op->resist[j] = 100;
324 if (op->resist[j] < -100)
325 op->resist[j] = -100;
326 }
327}
328
329/* set the materialname and type for an item */
330void
331set_materialname (object *op, int difficulty, materialtype_t *nmt)
332{
333 materialtype_t *mt, *lmt;
334
335#ifdef NEW_MATERIAL_CODE
336 int j;
337#endif
338
339 if (op->materialname != NULL)
340 return;
341
342
343
344 if (nmt == NULL)
345 {
346 lmt = NULL;
347#ifndef NEW_MATERIAL_CODE
348 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
349 {
350 if (op->material & mt->material)
351 {
352 lmt = mt;
353 break;
354 }
355 }
356
357#else
358 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
359 {
360 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
361 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
362 {
363 lmt = mt;
364 if (!(op->is_weapon () || op->is_armor ()))
365 break;
366 }
367 }
368#endif
369 }
370 else
371 {
372 lmt = nmt;
373 }
374
375 if (lmt != NULL)
376 {
377#ifndef NEW_MATERIAL_CODE
378 op->materialname = lmt->name;
379 return;
380#else
381
382 if (op->stats.dam && op->is_weapon ())
383 {
384 op->stats.dam += lmt->damage;
385 if (op->stats.dam < 1)
386 op->stats.dam = 1;
387 }
388 if (op->stats.sp && op->type == BOW)
389 op->stats.sp += lmt->sp;
390 if (op->stats.wc && op->is_weapon ())
391 op->stats.wc += lmt->wc;
392 if (op->is_armor ())
393 {
394 if (op->stats.ac)
395 op->stats.ac += lmt->ac;
396 for (j = 0; j < NROFATTACKS; j++)
397 if (op->resist[j] != 0)
398 {
399 op->resist[j] += lmt->mod[j];
400 if (op->resist[j] > 100)
401 op->resist[j] = 100;
402 if (op->resist[j] < -100)
403 op->resist[j] = -100;
404 }
405 }
406 op->materialname = add_string (lmt->name);
407 /* dont make it unstackable if it doesn't need to be */
408 if (op->is_weapon () || op->is_armor ())
409 {
410 op->weight = (op->weight * lmt->weight) / 100;
411 op->value = (op->value * lmt->value) / 100;
412 }
413#endif
414 }
415}
416
417/*
418 * Strip out the media tags from a String.
419 * Warning the input string will contain the result string
420 */
421void
422strip_media_tag (char *message)
423{
424 int in_tag = 0;
425 char *dest;
426 char *src;
427
428 src = dest = message;
429 while (*src != '\0')
430 {
431 if (*src == '[')
432 {
433 in_tag = 1;
434 }
435 else if (in_tag && (*src == ']'))
436 in_tag = 0;
437 else if (!in_tag)
438 {
439 *dest = *src;
440 dest++;
441 }
442 src++;
443 }
444 *dest = '\0';
445}
446
447const char *
448strrstr (const char *haystack, const char *needle)
449{
450 const char *lastneedle;
451
452 lastneedle = NULL;
453 while ((haystack = strstr (haystack, needle)) != NULL)
454 {
455 lastneedle = haystack;
456 haystack++;
457 }
458 return lastneedle;
459
460}
461
462#define EOL_SIZE (sizeof("\n")-1)
463void
464strip_endline (char *buf)
465{
466 if (strlen (buf) < sizeof ("\n"))
467 {
468 return;
469 }
470 if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n"))
471 buf[strlen (buf) - EOL_SIZE] = '\0';
472}
473
474/**
475 * Replace in string src all occurrences of key by replacement. The resulting
476 * string is put into result; at most resultsize characters (including the
477 * terminating null character) will be written to result.
478 */
479void
480replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize)
481{
482 size_t resultlen;
483 size_t keylen;
484
485 /* special case to prevent infinite loop if key==replacement=="" */
486 if (strcmp (key, replacement) == 0)
487 {
488 snprintf (result, resultsize, "%s", src);
489 return;
490 }
491
492 keylen = strlen (key);
493
494 resultlen = 0;
495 while (*src != '\0' && resultlen + 1 < resultsize)
496 {
497 if (strncmp (src, key, keylen) == 0)
498 {
499 snprintf (result + resultlen, resultsize - resultlen, "%s", replacement);
500 resultlen += strlen (result + resultlen);
501 src += keylen;
502 }
503 else
504 {
505 result[resultlen++] = *src++;
506 }
507 }
508 result[resultlen] = '\0';
509}
510
511/**
512 * Taking a string as an argument, mutate it into a string that looks like a list.
513 * a 'list' for the purposes here, is a string of items, seperated by commas, except
514 * for the last entry, which has an 'and' before it, and a full stop (period) after it.
515 * This function will also strip all trailing non alphanumeric characters.
516 * It does not insert an oxford comma.
517 */
518
519void
520make_list_like (char *input)
521{
522 char *p, tmp[MAX_BUF];
523 int i;
524
525 if (!input || strlen (input) > MAX_BUF - 5)
526 return;
527 /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */
528
529 strncpy (tmp, input, MAX_BUF - 5);
530 /*trim all trailing commas, spaces etc. */
531 for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--)
532 tmp[i] = '\0';
533
534 strcat (tmp, ".");
535
536 p = strrchr (tmp, ',');
537 if (p)
538 {
539 *p = '\0';
540 strcpy (input, tmp);
541 p++;
542 strcat (input, " and");
543 strcat (input, p);
544 }
545 else
546 strcpy (input, tmp);
547
548 return;
549}
550
551/////////////////////////////////////////////////////////////////////////////
552
553void *salloc_ (int n) throw (std::bad_alloc)
554{
555 void *ptr = g_slice_alloc (n);
556
557 if (!ptr)
558 throw std::bad_alloc ();
559
560 return ptr; 130 return ptr;
561} 131}
562 132
563void *salloc_ (int n, void *src) throw (std::bad_alloc) 133// thos noinline works around a bug in gcc10, which otherwise inlines
134// this fucntion and, only in the inlined versions, optimises out
135// the memset, leasving memory uninitialised.
136ecb_noinline
137void *
138salloc_ (int n, void *src) noexcept
564{ 139{
565 void *ptr = salloc_ (n); 140 void *ptr = salloc_ (n);
566 141
567 if (src) 142 if (src)
568 memcpy (ptr, src, n); 143 memcpy (ptr, src, n);
… …
570 memset (ptr, 0, n); 145 memset (ptr, 0, n);
571 146
572 return ptr; 147 return ptr;
573} 148}
574 149
150/******************************************************************************/
151
152#if DEBUG_SALLOC
153
154#define MAGIC 0xa1b2c35543deadLL
155
156void *
157g_slice_alloc (unsigned long size)
158{
159 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
160 *p++ = size ^ MAGIC;
161 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
162 return (void *)p;
163}
164
165void *
166g_slice_alloc0 (unsigned long size)
167{
168 return memset (g_slice_alloc (size), 0, size);
169}
170
171void
172g_slice_free1 (unsigned long size, void *ptr)
173{
174 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
175 if (ecb_expect_true (ptr))
176 {
177 unsigned long *p = (unsigned long *)ptr;
178 unsigned long s = *--p ^ MAGIC;
179
180 if (size != (unsigned long)(*p ^ MAGIC))
181 {
182 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
183 abort ();
184 }
185
186 *p = MAGIC;
187
188 (g_slice_free1)(s + sizeof (unsigned long), p);
189 }
190}
191
192#endif
193
194/******************************************************************************/
195
196refcnt_buf::refcnt_buf (size_t size)
197{
198 static uint32_t empty_buf [2] = { 0, 1 }; // 2 == never deallocated
199 data = (char *)empty_buf + overhead;
200 assert (overhead == sizeof (empty_buf));
201 inc ();
202}
203
204refcnt_buf::refcnt_buf (void *data, size_t size)
205{
206 _alloc (size);
207 memcpy (this->data, data, size);
208}
209
210refcnt_buf::~refcnt_buf ()
211{
212 dec ();
213}
214
215void
216refcnt_buf::_dealloc ()
217{
218 sfree<char> (data - overhead, size () + overhead);
219}
220
221refcnt_buf &
222refcnt_buf::operator =(const refcnt_buf &src)
223{
224 dec ();
225 data = src.data;
226 inc ();
227 return *this;
228}
229
230/******************************************************************************/
231
232int
575void assign (char *dst, const char *src, int maxlen) 233assign (char *dst, const char *src, int maxsize)
576{ 234{
577 if (!src) 235 if (!src)
578 src = ""; 236 src = "";
579 237
580 int len = strlen (src); 238 int len = strlen (src);
581 239
582 if (len >= maxlen - 1) 240 if (len >= maxsize)
583 { 241 {
584 if (maxlen <= 4) 242 if (maxsize <= 4)
585 { 243 {
586 memset (dst, '.', maxlen - 1); 244 memset (dst, '.', maxsize - 2);
587 dst [maxlen - 1] = 0; 245 dst [maxsize - 1] = 0;
588 } 246 }
589 else 247 else
590 { 248 {
591 memcpy (dst, src, maxlen - 4); 249 memcpy (dst, src, maxsize - 4);
592 memcpy (dst + maxlen - 4, "...", 4); 250 memcpy (dst + maxsize - 4, "...", 4);
593 } 251 }
252
253 len = maxsize;
594 } 254 }
595 else 255 else
596 memcpy (dst, src, len + 1); 256 memcpy (dst, src, ++len);
597}
598 257
599tstamp now () 258 return len;
259}
260
261char *
262vformat (const char *format, va_list ap)
263{
264 static dynbuf_text bufs[8];
265 static int bufidx;
266
267 dynbuf_text &buf = bufs [++bufidx & 7];
268
269 buf.clear ();
270 buf.vprintf (format, ap);
271 return buf;
272}
273
274char *
275format (const char *format, ...)
276{
277 va_list ap;
278 va_start (ap, format);
279 char *buf = vformat (format, ap);
280 va_end (ap);
281
282 return buf;
283}
284
285tstamp
286now ()
600{ 287{
601 struct timeval tv; 288 struct timeval tv;
602 289
603 gettimeofday (&tv, 0); 290 gettimeofday (&tv, 0);
604 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 291 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
… …
612 299
613 int diff = (b - a) & 7; 300 int diff = (b - a) & 7;
614 return diff <= 1 || diff >= 7; 301 return diff <= 1 || diff >= 7;
615} 302}
616 303
304/* crc32 0xdebb20e3 table and supplementary functions. */
305extern const uint32_t crc_32_tab[256] =
306{
307 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
308 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
309 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
310 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
311 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
312 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
313 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
314 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
315 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
316 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
317 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
318 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
319 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
320 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
321 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
322 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
323 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
324 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
325 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
326 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
327 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
328 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
329 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
330 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
331 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
332 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
333 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
334 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
335 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
336 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
337 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
338 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
339 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
340 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
341 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
342 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
343 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
344 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
345 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
346 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
347 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
348 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
349 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
350 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
351 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
352 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
353 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
354 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
355 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
356 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
357 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
358 0x2d02ef8dL
359};
360
361void
362thread::start (void *(*start_routine)(void *), void *arg)
363{
364 pthread_attr_t attr;
365
366 pthread_attr_init (&attr);
367 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
368 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
369 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
370#ifdef PTHREAD_SCOPE_PROCESS
371 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
372#endif
373
374 sigset_t fullsigset, oldsigset;
375 sigfillset (&fullsigset);
376
377 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
378
379 if (pthread_create (&id, &attr, start_routine, arg))
380 cleanup ("unable to create a new thread");
381
382 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
383}
384

Diff Legend

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