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

Diff Legend

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