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

Diff Legend

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