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

Diff Legend

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