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.31 by root, Mon Dec 25 14:54:44 2006 UTC vs.
Revision 1.78 by root, Fri May 16 17:09:38 2008 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20 21 * The authors can be reached via e-mail to <support@deliantra.net>
21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22 */
23 23
24/* 24/*
25 * General convenience functions for crossfire. 25 * General convenience functions for crossfire.
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
34#include <glib.h> 38#include <glib.h>
39
40refcnt_base::refcnt_t refcnt_dummy;
41ssize_t slice_alloc;
42rand_gen rndm, rmg_rndm;
43
44void
45tausworthe_random_generator::seed (uint32_t seed)
46{
47 state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U;
48 state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U;
49 state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U;
50 state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U;
51
52 for (int i = 11; --i; )
53 operator ()();
54}
55
56uint32_t
57tausworthe_random_generator::next ()
58{
59 state [0] = ((state [0] & 0xFFFFFFFEU) << 18U) ^ (((state [0] << 6U) ^ state [0]) >> 13U);
60 state [1] = ((state [1] & 0xFFFFFFF8U) << 2U) ^ (((state [1] << 2U) ^ state [1]) >> 27U);
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
64 return state [0] ^ state [1] ^ state [2] ^ state [3];
65}
66
67uint32_t
68tausworthe_random_generator::get_range (uint32_t num)
69{
70 return (next () * (uint64_t)num) >> 32U;
71}
72
73// return a number within (min .. max)
74int
75tausworthe_random_generator::get_range (int r_min, int r_max)
76{
77 return r_min + get_range (max (r_max - r_min + 1, 0));
78}
35 79
36/* 80/*
37 * The random functions here take luck into account when rolling random 81 * The random functions here take luck into account when rolling random
38 * dice or numbers. This function has less of an impact the larger the 82 * dice or numbers. This function has less of an impact the larger the
39 * difference becomes in the random numbers. IE, the effect is lessened 83 * difference becomes in the random numbers. IE, the effect is lessened
… …
46 * Roll a random number between min and max. Uses op to determine luck, 90 * 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. 91 * 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, 92 * Generally, op should be the player/caster/hitter requesting the roll,
49 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
50 */ 94 */
51
52int 95int
53random_roll (int min, int max, const object *op, int goodbad) 96random_roll (int r_min, int r_max, const object *op, int goodbad)
54{ 97{
55 int omin, diff, luck, base, ran; 98 r_max = max (r_min, r_max);
56 99
57 omin = min; 100 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
58 diff = max - min + 1;
59 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
60 101
61 if (max < 1 || diff < 1)
62 {
63 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);
64 return (min); /* avoids a float exception */
65 }
66
67 ran = RANDOM ();
68
69 if (op->type != PLAYER) 102 if (op->type == PLAYER)
70 return ((ran % diff) + min); 103 {
71
72 luck = op->stats.luck; 104 int luck = op->stats.luck;
73 if (RANDOM () % base < MIN (10, abs (luck))) 105
106 if (rndm (base) < min (10, abs (luck)))
107 {
108 //TODO: take luck into account
109 }
74 { 110 }
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 111
82 return (MAX (omin, MIN (max, (ran % diff) + min))); 112 return rndm (r_min, r_max);
83 }
84 return ((ran % diff) + min);
85} 113}
86 114
87/* 115/*
88 * This is a 64 bit version of random_roll above. This is needed 116 * This is a 64 bit version of random_roll above. This is needed
89 * for exp loss calculations for players changing religions. 117 * for exp loss calculations for players changing religions.
90 */ 118 */
91
92sint64 119sint64
93random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 120random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
94{ 121{
95 sint64 omin, diff, luck, ran; 122 sint64 omin = r_min;
96 int base; 123 sint64 range = max (0, r_max - r_min + 1);
124 int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */
97 125
98 omin = min; 126 /*
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 127 * Make a call to get two 32 bit unsigned random numbers, and just to
110 * a little byteshifting. Do make sure the first one is only 128 * a little bitshifting.
111 * 32 bit, so we don't get skewed results
112 */ 129 */
113 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32); 130 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
114 131
115 if (op->type != PLAYER) 132 if (op->type != PLAYER)
116 return ((ran % diff) + min); 133 return ((ran % range) + r_min);
117 134
118 luck = op->stats.luck; 135 int luck = op->stats.luck;
136
119 if (RANDOM () % base < MIN (10, abs (luck))) 137 if (rndm (base) < min (10, abs (luck)))
120 { 138 {
121 /* we have a winner */ 139 /* we have a winner */
122 ((luck > 0) ? (luck = 1) : (luck = -1)); 140 ((luck > 0) ? (luck = 1) : (luck = -1));
123 diff -= luck; 141 range -= luck;
124 if (diff < 1) 142 if (range < 1)
125 return (omin); /*check again */ 143 return (omin); /*check again */
144
126 ((goodbad) ? (min += luck) : (diff)); 145 ((goodbad) ? (r_min += luck) : (range));
127 146
128 return (MAX (omin, MIN (max, (ran % diff) + min))); 147 return (max (omin, min (r_max, (ran % range) + r_min)));
129 } 148 }
130 return ((ran % diff) + min); 149
150 return ran % range + r_min;
131} 151}
132 152
133/* 153/*
134 * Roll a number of dice (2d3, 4d6). Uses op to determine luck, 154 * 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. 155 * 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, 156 * Generally, op should be the player/caster/hitter requesting the roll,
137 * not the recipient (ie, the poor slob getting hit). 157 * not the recipient (ie, the poor slob getting hit).
138 * The args are num D size (ie 4d6) [garbled 20010916] 158 * The args are num D size (ie 4d6) [garbled 20010916]
139 */ 159 */
140
141int 160int
142die_roll (int num, int size, const object *op, int goodbad) 161die_roll (int num, int size, const object *op, int goodbad)
143{ 162{
144 int min, diff, luck, total, i, gotlucky, base, ran; 163 int min, luck, total, i, gotlucky;
145 164
146 diff = size; 165 int diff = size;
147 min = 1; 166 min = 1;
148 luck = total = gotlucky = 0; 167 luck = total = gotlucky = 0;
149 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ 168 int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */
169
150 if (size < 2 || diff < 1) 170 if (size < 2 || diff < 1)
151 { 171 {
152 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); 172 LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size);
153 return (num); /* avoids a float exception */ 173 return num; /* avoids a float exception */
154 } 174 }
155 175
156 if (op->type == PLAYER) 176 if (op->type == PLAYER)
157 luck = op->stats.luck; 177 luck = op->stats.luck;
158 178
159 for (i = 0; i < num; i++) 179 for (i = 0; i < num; i++)
160 { 180 {
161 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky) 181 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
162 { 182 {
163 /* we have a winner */ 183 /* we have a winner */
164 gotlucky++; 184 gotlucky++;
165 ((luck > 0) ? (luck = 1) : (luck = -1)); 185 ((luck > 0) ? (luck = 1) : (luck = -1));
166 diff -= luck; 186 diff -= luck;
167 if (diff < 1) 187 if (diff < 1)
168 return (num); /*check again */ 188 return (num); /*check again */
169 ((goodbad) ? (min += luck) : (diff)); 189 ((goodbad) ? (min += luck) : (diff));
170 ran = RANDOM ();
171 total += MAX (1, MIN (size, (ran % diff) + min)); 190 total += MAX (1, MIN (size, rndm (diff) + min));
172 } 191 }
173 else 192 else
174 {
175 total += RANDOM () % size + 1; 193 total += rndm (size) + 1;
176 }
177 } 194 }
195
178 return (total); 196 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
203decay_objects (maptile *m)
204{
205 int x, y, destroy;
206 object *op, *otmp;
207
208 if (m->unique)
209 return;
210
211 for (x = 0; x < m->width; x++)
212 for (y = 0; y < m->height; 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 && m->temp > 32)
261 destroy = 1;
262 }
263 /* adjust overall chance below */
264 if (destroy && rndm (0, 1))
265 op->destroy ();
266 }
267} 197}
268 198
269/* convert materialname to materialtype_t */ 199/* convert materialname to materialtype_t */
270 200
271materialtype_t * 201materialtype_t *
272name_to_material (const char *name) 202name_to_material (const shstr &name)
273{ 203{
274 materialtype_t *mt, *nmt; 204 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
205 if (name == mt->name)
206 return mt;
275 207
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; 208 return 0;
286} 209}
287 210
288/* when doing transmutation of objects, we have to recheck the resistances, 211/* when doing transmutation of objects, we have to recheck the resistances,
289 * as some that did not apply previously, may apply now. 212 * as some that did not apply previously, may apply now.
290 */ 213 */
291
292void 214void
293transmute_materialname (object *op, const object *change) 215transmute_materialname (object *op, const object *change)
294{ 216{
295 materialtype_t *mt; 217 materialtype_t *mt;
296 int j; 218 int j;
… …
305 return; 227 return;
306 228
307 mt = name_to_material (op->materialname); 229 mt = name_to_material (op->materialname);
308 if (!mt) 230 if (!mt)
309 { 231 {
310 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); 232 LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname);
311 return; 233 return;
312 } 234 }
313 235
314 for (j = 0; j < NROFATTACKS; j++) 236 for (j = 0; j < NROFATTACKS; j++)
315 if (op->resist[j] == 0 && change->resist[j] != 0) 237 if (op->resist[j] == 0 && change->resist[j] != 0)
… …
326void 248void
327set_materialname (object *op, int difficulty, materialtype_t *nmt) 249set_materialname (object *op, int difficulty, materialtype_t *nmt)
328{ 250{
329 materialtype_t *mt, *lmt; 251 materialtype_t *mt, *lmt;
330 252
331#ifdef NEW_MATERIAL_CODE
332 int j;
333#endif
334
335 if (op->materialname != NULL) 253 if (op->materialname != NULL)
336 return; 254 return;
337 255
338
339
340 if (nmt == NULL) 256 if (nmt == NULL)
341 { 257 {
342 lmt = NULL; 258 lmt = NULL;
343#ifndef NEW_MATERIAL_CODE 259
344 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next) 260 for (mt = materialt; mt && mt->next; mt = mt->next)
345 { 261 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
346 if (op->material & mt->material) 262 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
347 { 263 {
348 lmt = mt; 264 lmt = mt;
265 if (!(op->is_weapon () || op->is_armor ()))
349 break; 266 break;
350 } 267 }
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 } 268 }
366 else 269 else
367 {
368 lmt = nmt; 270 lmt = nmt;
369 }
370 271
371 if (lmt != NULL) 272 if (lmt != NULL)
372 { 273 {
373#ifndef NEW_MATERIAL_CODE
374 op->materialname = lmt->name;
375 return;
376#else
377
378 if (op->stats.dam && op->is_weapon ()) 274 if (op->stats.dam && op->is_weapon ())
379 { 275 {
380 op->stats.dam += lmt->damage; 276 op->stats.dam += lmt->damage;
381 if (op->stats.dam < 1) 277 if (op->stats.dam < 1)
382 op->stats.dam = 1; 278 op->stats.dam = 1;
383 } 279 }
280
384 if (op->stats.sp && op->type == BOW) 281 if (op->stats.sp && op->type == BOW)
385 op->stats.sp += lmt->sp; 282 op->stats.sp += lmt->sp;
386 if (op->stats.wc && op->is_weapon ()) 283 if (op->stats.wc && op->is_weapon ())
387 op->stats.wc += lmt->wc; 284 op->stats.wc += lmt->wc;
388 if (op->is_armor ()) 285 if (op->is_armor ())
389 { 286 {
390 if (op->stats.ac) 287 if (op->stats.ac)
391 op->stats.ac += lmt->ac; 288 op->stats.ac += lmt->ac;
289
392 for (j = 0; j < NROFATTACKS; j++) 290 for (int j = 0; j < NROFATTACKS; j++)
393 if (op->resist[j] != 0) 291 if (op->resist[j] != 0)
394 { 292 {
395 op->resist[j] += lmt->mod[j]; 293 op->resist[j] += lmt->mod[j];
396 if (op->resist[j] > 100) 294 if (op->resist[j] > 100)
397 op->resist[j] = 100; 295 op->resist[j] = 100;
398 if (op->resist[j] < -100) 296 if (op->resist[j] < -100)
399 op->resist[j] = -100; 297 op->resist[j] = -100;
400 } 298 }
401 } 299 }
300
402 op->materialname = add_string (lmt->name); 301 op->materialname = lmt->name;
403 /* dont make it unstackable if it doesn't need to be */ 302 /* dont make it unstackable if it doesn't need to be */
404 if (op->is_weapon () || op->is_armor ()) 303 if (op->is_weapon () || op->is_armor ())
405 { 304 {
406 op->weight = (op->weight * lmt->weight) / 100; 305 op->weight = (op->weight * lmt->weight) / 100;
407 op->value = (op->value * lmt->value) / 100; 306 op->value = (op->value * lmt->value) / 100;
408 } 307 }
409#endif
410 } 308 }
411} 309}
412 310
413/* 311/*
414 * Strip out the media tags from a String. 312 * Strip out the media tags from a String.
… …
509 * a 'list' for the purposes here, is a string of items, seperated by commas, except 407 * 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. 408 * 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. 409 * This function will also strip all trailing non alphanumeric characters.
512 * It does not insert an oxford comma. 410 * It does not insert an oxford comma.
513 */ 411 */
514
515void 412void
516make_list_like (char *input) 413make_list_like (char *input)
517{ 414{
518 char *p, tmp[MAX_BUF]; 415 char *p, tmp[MAX_BUF];
519 int i; 416 int i;
… …
544 return; 441 return;
545} 442}
546 443
547///////////////////////////////////////////////////////////////////////////// 444/////////////////////////////////////////////////////////////////////////////
548 445
446void
447fork_abort (const char *msg)
448{
449 if (!fork ())
450 {
451 signal (SIGABRT, SIG_DFL);
452 // try to put corefiles into a subdirectory, if existing, to allow
453 // an administrator to reduce the I/O load.
454 chdir ("cores");
455 abort ();
456 }
457
458 LOG (llevError, "fork abort: %s\n", msg);
459}
460
549void *salloc_ (int n) throw (std::bad_alloc) 461void *salloc_ (int n) throw (std::bad_alloc)
550{ 462{
551 void *ptr = g_slice_alloc (n); 463 void *ptr = g_slice_alloc (n);
552 464
553 if (!ptr) 465 if (!ptr)
554 throw std::bad_alloc (); 466 throw std::bad_alloc ();
555 467
468 slice_alloc += n;
556 return ptr; 469 return ptr;
557} 470}
558 471
559void *salloc_ (int n, void *src) throw (std::bad_alloc) 472void *salloc_ (int n, void *src) throw (std::bad_alloc)
560{ 473{
… …
566 memset (ptr, 0, n); 479 memset (ptr, 0, n);
567 480
568 return ptr; 481 return ptr;
569} 482}
570 483
484/******************************************************************************/
485
486#if DEBUG_SALLOC
487
488#define MAGIC 0xa1b2c35543deadLL
489
490void *g_slice_alloc (unsigned long size)
491{
492 unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long));
493 *p++ = size ^ MAGIC;
494 //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D
495 return (void *)p;
496}
497
498void *g_slice_alloc0 (unsigned long size)
499{
500 return memset (g_slice_alloc (size), 0, size);
501}
502
503void g_slice_free1 (unsigned long size, void *ptr)
504{
505 //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D
506 if (expect_true (ptr))
507 {
508 unsigned long *p = (unsigned long *)ptr;
509 unsigned long s = *--p ^ MAGIC;
510
511 if (size != (unsigned long)(*p ^ MAGIC))
512 {
513 LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s);
514 abort ();
515 }
516
517 *p = MAGIC;
518
519 (g_slice_free1)(s + sizeof (unsigned long), p);
520 }
521}
522
523#endif
524
525/******************************************************************************/
526
571void assign (char *dst, const char *src, int maxlen) 527void assign (char *dst, const char *src, int maxlen)
572{ 528{
573 if (!src) 529 if (!src)
574 src = ""; 530 src = "";
575 531
… …
590 } 546 }
591 else 547 else
592 memcpy (dst, src, len + 1); 548 memcpy (dst, src, len + 1);
593} 549}
594 550
551const char *
552format (const char *format, ...)
553{
554 static dynbuf_text buf;
555
556 buf.clear ();
557
558 va_list ap;
559 va_start (ap, format);
560 buf.vprintf (format, ap);
561 va_end (ap);
562
563 return buf;
564}
565
595tstamp now () 566tstamp now ()
596{ 567{
597 struct timeval tv; 568 struct timeval tv;
598 569
599 gettimeofday (&tv, 0); 570 gettimeofday (&tv, 0);
600 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6); 571 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
601} 572}
602 573
574int
575similar_direction (int a, int b)
576{
577 if (!a || !b)
578 return 0;
579
580 int diff = (b - a) & 7;
581 return diff <= 1 || diff >= 7;
582}
583
584/* crc32 0xdebb20e3 table and supplementary functions. */
585extern const uint32_t crc_32_tab[256] =
586{
587 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
588 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
589 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
590 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
591 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
592 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
593 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
594 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
595 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
596 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
597 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
598 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
599 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
600 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
601 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
602 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
603 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
604 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
605 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
606 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
607 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
608 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
609 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
610 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
611 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
612 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
613 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
614 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
615 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
616 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
617 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
618 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
619 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
620 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
621 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
622 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
623 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
624 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
625 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
626 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
627 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
628 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
629 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
630 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
631 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
632 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
633 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
634 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
635 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
636 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
637 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
638 0x2d02ef8dL
639};
640
641void thread::start (void *(*start_routine)(void *), void *arg)
642{
643 pthread_attr_t attr;
644
645 pthread_attr_init (&attr);
646 pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED);
647 pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096
648 ? sizeof (long) * 4096 : PTHREAD_STACK_MIN);
649#ifdef PTHREAD_SCOPE_PROCESS
650 pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS);
651#endif
652
653 sigset_t fullsigset, oldsigset;
654 sigfillset (&fullsigset);
655
656 pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset);
657
658 if (pthread_create (&id, &attr, start_routine, arg))
659 cleanup ("unable to create a new thread");
660
661 pthread_sigmask (SIG_SETMASK, &oldsigset, 0);
662}
663

Diff Legend

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