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.17 by root, Fri Nov 17 19:40:53 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 <cstdlib>
29#include <sys/types.h>
30#include <unistd.h>
31#include <sys/time.h>
32#include <time.h>
33#include <signal.h>
34
28#include <global.h> 35#include <global.h>
29#include <funcpoint.h>
30#include <material.h> 36#include <material.h>
31 37
32#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}
33 79
34/* 80/*
35 * The random functions here take luck into account when rolling random 81 * The random functions here take luck into account when rolling random
36 * 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
37 * difference becomes in the random numbers. IE, the effect is lessened 83 * difference becomes in the random numbers. IE, the effect is lessened
… …
44 * 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,
45 * 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.
46 * Generally, op should be the player/caster/hitter requesting the roll, 92 * Generally, op should be the player/caster/hitter requesting the roll,
47 * not the recipient (ie, the poor slob getting hit). [garbled 20010916] 93 * not the recipient (ie, the poor slob getting hit). [garbled 20010916]
48 */ 94 */
49
50int 95int
51random_roll (int min, int max, const object *op, int goodbad) 96random_roll (int r_min, int r_max, const object *op, int goodbad)
52{ 97{
53 int omin, diff, luck, base, ran; 98 r_max = max (r_min, r_max);
54 99
55 omin = min; 100 int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */
56 diff = max - min + 1;
57 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
58 101
59 if (max < 1 || diff < 1)
60 {
61 LOG (llevError, "Calling random_roll with min=%d max=%d\n", min, max);
62 return (min); /* avoids a float exception */
63 }
64
65 ran = RANDOM ();
66
67 if (op->type != PLAYER) 102 if (op->type == PLAYER)
68 return ((ran % diff) + min); 103 {
69
70 luck = op->stats.luck; 104 int luck = op->stats.luck;
71 if (RANDOM () % base < MIN (10, abs (luck))) 105
106 if (rndm (base) < min (10, abs (luck)))
107 {
108 //TODO: take luck into account
109 }
72 { 110 }
73 /* we have a winner */
74 ((luck > 0) ? (luck = 1) : (luck = -1));
75 diff -= luck;
76 if (diff < 1)
77 return (omin); /*check again */
78 ((goodbad) ? (min += luck) : (diff));
79 111
80 return (MAX (omin, MIN (max, (ran % diff) + min))); 112 return rndm (r_min, r_max);
81 }
82 return ((ran % diff) + min);
83} 113}
84 114
85/* 115/*
86 * 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
87 * for exp loss calculations for players changing religions. 117 * for exp loss calculations for players changing religions.
88 */ 118 */
89
90sint64 119sint64
91random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) 120random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad)
92{ 121{
93 sint64 omin, diff, luck, ran; 122 sint64 omin = r_min;
94 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 */
95 125
96 omin = min; 126 /*
97 diff = max - min + 1;
98 ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */
99
100 if (max < 1 || diff < 1)
101 {
102#ifndef WIN32
103 LOG (llevError, "Calling random_roll with min=%lld max=%lld\n", min, max);
104#else
105 LOG (llevError, "Calling random_roll with min=%I64d max=%I64d\n", min, max);
106#endif
107 return (min); /* avoids a float exception */
108 }
109
110 /* Don't know of a portable call to get 64 bit random values.
111 * 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
112 * a little byteshifting. Do make sure the first one is only 128 * a little bitshifting.
113 * 32 bit, so we don't get skewed results
114 */ 129 */
115 ran = (RANDOM () & 0xffffffff) | ((sint64) RANDOM () << 32); 130 sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31);
116 131
117 if (op->type != PLAYER) 132 if (op->type != PLAYER)
118 return ((ran % diff) + min); 133 return ((ran % range) + r_min);
119 134
120 luck = op->stats.luck; 135 int luck = op->stats.luck;
136
121 if (RANDOM () % base < MIN (10, abs (luck))) 137 if (rndm (base) < min (10, abs (luck)))
122 { 138 {
123 /* we have a winner */ 139 /* we have a winner */
124 ((luck > 0) ? (luck = 1) : (luck = -1)); 140 ((luck > 0) ? (luck = 1) : (luck = -1));
125 diff -= luck; 141 range -= luck;
126 if (diff < 1) 142 if (range < 1)
127 return (omin); /*check again */ 143 return (omin); /*check again */
144
128 ((goodbad) ? (min += luck) : (diff)); 145 ((goodbad) ? (r_min += luck) : (range));
129 146
130 return (MAX (omin, MIN (max, (ran % diff) + min))); 147 return (max (omin, min (r_max, (ran % range) + r_min)));
131 } 148 }
132 return ((ran % diff) + min); 149
150 return ran % range + r_min;
133} 151}
134 152
135/* 153/*
136 * 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,
137 * 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.
138 * Generally, op should be the player/caster/hitter requesting the roll, 156 * Generally, op should be the player/caster/hitter requesting the roll,
139 * not the recipient (ie, the poor slob getting hit). 157 * not the recipient (ie, the poor slob getting hit).
140 * The args are num D size (ie 4d6) [garbled 20010916] 158 * The args are num D size (ie 4d6) [garbled 20010916]
141 */ 159 */
142
143int 160int
144die_roll (int num, int size, const object *op, int goodbad) 161die_roll (int num, int size, const object *op, int goodbad)
145{ 162{
146 int min, diff, luck, total, i, gotlucky, base, ran; 163 int min, luck, total, i, gotlucky;
147 164
148 diff = size; 165 int diff = size;
149 min = 1; 166 min = 1;
150 luck = total = gotlucky = 0; 167 luck = total = gotlucky = 0;
151 ((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
152 if (size < 2 || diff < 1) 170 if (size < 2 || diff < 1)
153 { 171 {
154 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);
155 return (num); /* avoids a float exception */ 173 return num; /* avoids a float exception */
156 } 174 }
157 175
158 if (op->type == PLAYER) 176 if (op->type == PLAYER)
159 luck = op->stats.luck; 177 luck = op->stats.luck;
160 178
161 for (i = 0; i < num; i++) 179 for (i = 0; i < num; i++)
162 { 180 {
163 if (RANDOM () % base < MIN (10, abs (luck)) && !gotlucky) 181 if (rndm (base) < MIN (10, abs (luck)) && !gotlucky)
164 { 182 {
165 /* we have a winner */ 183 /* we have a winner */
166 gotlucky++; 184 gotlucky++;
167 ((luck > 0) ? (luck = 1) : (luck = -1)); 185 ((luck > 0) ? (luck = 1) : (luck = -1));
168 diff -= luck; 186 diff -= luck;
169 if (diff < 1) 187 if (diff < 1)
170 return (num); /*check again */ 188 return (num); /*check again */
171 ((goodbad) ? (min += luck) : (diff)); 189 ((goodbad) ? (min += luck) : (diff));
172 ran = RANDOM ();
173 total += MAX (1, MIN (size, (ran % diff) + min)); 190 total += MAX (1, MIN (size, rndm (diff) + min));
174 } 191 }
175 else 192 else
176 {
177 total += RANDOM () % size + 1; 193 total += rndm (size) + 1;
178 }
179 } 194 }
195
180 return (total); 196 return total;
181}
182
183/*
184 * Another convenience function. Returns a number between min and max.
185 * It is suggested one use these functions rather than RANDOM()%, as it
186 * would appear that a number of off-by-one-errors exist due to improper
187 * use of %. This should also prevent SIGFPE.
188 */
189
190int
191rndm (int min, int max)
192{
193 int diff;
194
195 diff = max - min + 1;
196 if (max < 1 || diff < 1)
197 return (min);
198
199 return (RANDOM () % diff + min);
200}
201
202/* decay and destroy persihable items in a map */
203
204void
205decay_objects (maptile *m)
206{
207 int x, y, destroy;
208 object *op, *otmp;
209
210 if (m->unique)
211 return;
212
213 for (x = 0; x < MAP_WIDTH (m); x++)
214 for (y = 0; y < MAP_HEIGHT (m); y++)
215 for (op = get_map_ob (m, x, y); op; op = otmp)
216 {
217 destroy = 0;
218 otmp = op->above;
219 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
220 break;
221 if (QUERY_FLAG (op, FLAG_IS_FLOOR) ||
222 QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) ||
223 QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) ||
224 QUERY_FLAG (op, FLAG_UNIQUE) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) || QUERY_FLAG (op, FLAG_UNPAID) || IS_LIVE (op))
225 continue;
226 /* otherwise, we decay and destroy */
227 if (IS_WEAPON (op))
228 {
229 op->stats.dam--;
230 if (op->stats.dam < 0)
231 destroy = 1;
232 }
233 else if (IS_ARMOR (op))
234 {
235 op->stats.ac--;
236 if (op->stats.ac < 0)
237 destroy = 1;
238 }
239 else if (op->type == FOOD)
240 {
241 op->stats.food -= rndm (5, 20);
242 if (op->stats.food < 0)
243 destroy = 1;
244 }
245 else
246 {
247 if (op->material & M_PAPER || op->material & M_LEATHER ||
248 op->material & M_WOOD || op->material & M_ORGANIC || op->material & M_CLOTH || op->material & M_LIQUID)
249 destroy = 1;
250 if (op->material & M_IRON && rndm (1, 5) == 1)
251 destroy = 1;
252 if (op->material & M_GLASS && rndm (1, 2) == 1)
253 destroy = 1;
254 if ((op->material & M_STONE || op->material & M_ADAMANT) && rndm (1, 10) == 1)
255 destroy = 1;
256 if ((op->material & M_SOFT_METAL || op->material & M_BONE) && rndm (1, 3) == 1)
257 destroy = 1;
258 if (op->material & M_ICE && MAP_TEMP (m) > 32)
259 destroy = 1;
260 }
261 /* adjust overall chance below */
262 if (destroy && rndm (0, 1))
263 {
264 remove_ob (op);
265 free_object (op);
266 }
267 }
268} 197}
269 198
270/* convert materialname to materialtype_t */ 199/* convert materialname to materialtype_t */
271 200
272materialtype_t * 201materialtype_t *
273name_to_material (const char *name) 202name_to_material (const shstr &name)
274{ 203{
275 materialtype_t *mt, *nmt; 204 for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next)
205 if (name == mt->name)
206 return mt;
276 207
277 mt = NULL;
278 for (nmt = materialt; nmt != NULL && nmt->next != NULL; nmt = nmt->next)
279 {
280 if (strcmp (name, nmt->name) == 0)
281 {
282 mt = nmt;
283 break;
284 }
285 }
286 return mt; 208 return 0;
287} 209}
288 210
289/* when doing transmutation of objects, we have to recheck the resistances, 211/* when doing transmutation of objects, we have to recheck the resistances,
290 * as some that did not apply previously, may apply now. 212 * as some that did not apply previously, may apply now.
291 */ 213 */
292
293void 214void
294transmute_materialname (object *op, const object *change) 215transmute_materialname (object *op, const object *change)
295{ 216{
296 materialtype_t *mt; 217 materialtype_t *mt;
297 int j; 218 int j;
… …
300 return; 221 return;
301 222
302 if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) 223 if (change->materialname != NULL && strcmp (op->materialname, change->materialname))
303 return; 224 return;
304 225
305 if (!IS_ARMOR (op)) 226 if (!op->is_armor ())
306 return; 227 return;
307 228
308 mt = name_to_material (op->materialname); 229 mt = name_to_material (op->materialname);
309 if (!mt) 230 if (!mt)
310 { 231 {
311 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);
312 return; 233 return;
313 } 234 }
314 235
315 for (j = 0; j < NROFATTACKS; j++) 236 for (j = 0; j < NROFATTACKS; j++)
316 if (op->resist[j] == 0 && change->resist[j] != 0) 237 if (op->resist[j] == 0 && change->resist[j] != 0)
… …
327void 248void
328set_materialname (object *op, int difficulty, materialtype_t *nmt) 249set_materialname (object *op, int difficulty, materialtype_t *nmt)
329{ 250{
330 materialtype_t *mt, *lmt; 251 materialtype_t *mt, *lmt;
331 252
332#ifdef NEW_MATERIAL_CODE
333 int j;
334#endif
335
336 if (op->materialname != NULL) 253 if (op->materialname != NULL)
337 return; 254 return;
338 255
339
340
341 if (nmt == NULL) 256 if (nmt == NULL)
342 { 257 {
343 lmt = NULL; 258 lmt = NULL;
344#ifndef NEW_MATERIAL_CODE 259
345 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next) 260 for (mt = materialt; mt && mt->next; mt = mt->next)
346 { 261 if (op->materials & mt->material && rndm (1, 100) <= mt->chance &&
347 if (op->material & mt->material) 262 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
348 { 263 {
349 lmt = mt; 264 lmt = mt;
265 if (!(op->is_weapon () || op->is_armor ()))
350 break; 266 break;
351 } 267 }
352 }
353
354#else
355 for (mt = materialt; mt != NULL && mt->next != NULL; mt = mt->next)
356 {
357 if (op->material & mt->material && rndm (1, 100) <= mt->chance &&
358 difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0))
359 {
360 lmt = mt;
361 if (!(IS_WEAPON (op) || IS_ARMOR (op)))
362 break;
363 }
364 }
365#endif
366 } 268 }
367 else 269 else
368 {
369 lmt = nmt; 270 lmt = nmt;
370 }
371 271
372 if (lmt != NULL) 272 if (lmt != NULL)
373 { 273 {
374#ifndef NEW_MATERIAL_CODE 274 if (op->stats.dam && op->is_weapon ())
375 op->materialname = lmt->name;
376 return;
377#else
378
379 if (op->stats.dam && IS_WEAPON (op))
380 { 275 {
381 op->stats.dam += lmt->damage; 276 op->stats.dam += lmt->damage;
382 if (op->stats.dam < 1) 277 if (op->stats.dam < 1)
383 op->stats.dam = 1; 278 op->stats.dam = 1;
384 } 279 }
280
385 if (op->stats.sp && op->type == BOW) 281 if (op->stats.sp && op->type == BOW)
386 op->stats.sp += lmt->sp; 282 op->stats.sp += lmt->sp;
387 if (op->stats.wc && IS_WEAPON (op)) 283 if (op->stats.wc && op->is_weapon ())
388 op->stats.wc += lmt->wc; 284 op->stats.wc += lmt->wc;
389 if (IS_ARMOR (op)) 285 if (op->is_armor ())
390 { 286 {
391 if (op->stats.ac) 287 if (op->stats.ac)
392 op->stats.ac += lmt->ac; 288 op->stats.ac += lmt->ac;
289
393 for (j = 0; j < NROFATTACKS; j++) 290 for (int j = 0; j < NROFATTACKS; j++)
394 if (op->resist[j] != 0) 291 if (op->resist[j] != 0)
395 { 292 {
396 op->resist[j] += lmt->mod[j]; 293 op->resist[j] += lmt->mod[j];
397 if (op->resist[j] > 100) 294 if (op->resist[j] > 100)
398 op->resist[j] = 100; 295 op->resist[j] = 100;
399 if (op->resist[j] < -100) 296 if (op->resist[j] < -100)
400 op->resist[j] = -100; 297 op->resist[j] = -100;
401 } 298 }
402 } 299 }
300
403 op->materialname = add_string (lmt->name); 301 op->materialname = lmt->name;
404 /* dont make it unstackable if it doesn't need to be */ 302 /* dont make it unstackable if it doesn't need to be */
405 if (IS_WEAPON (op) || IS_ARMOR (op)) 303 if (op->is_weapon () || op->is_armor ())
406 { 304 {
407 op->weight = (op->weight * lmt->weight) / 100; 305 op->weight = (op->weight * lmt->weight) / 100;
408 op->value = (op->value * lmt->value) / 100; 306 op->value = (op->value * lmt->value) / 100;
409 } 307 }
410#endif
411 } 308 }
412} 309}
413 310
414/* 311/*
415 * Strip out the media tags from a String. 312 * Strip out the media tags from a String.
… …
510 * 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
511 * 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.
512 * This function will also strip all trailing non alphanumeric characters. 409 * This function will also strip all trailing non alphanumeric characters.
513 * It does not insert an oxford comma. 410 * It does not insert an oxford comma.
514 */ 411 */
515
516void 412void
517make_list_like (char *input) 413make_list_like (char *input)
518{ 414{
519 char *p, tmp[MAX_BUF]; 415 char *p, tmp[MAX_BUF];
520 int i; 416 int i;
… …
545 return; 441 return;
546} 442}
547 443
548///////////////////////////////////////////////////////////////////////////// 444/////////////////////////////////////////////////////////////////////////////
549 445
550#if 0 446void
551refcounted *refcounted::rc_first; 447fork_abort (const char *msg)
552
553refcounted::refcounted ()
554{ 448{
555 refcnt = 0; 449 if (!fork ())
556 rc_next = rc_first; 450 {
557 rc_first = this; 451 signal (SIGABRT, SIG_DFL);
558} 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 }
559 457
560refcounted::~refcounted () 458 LOG (llevError, "fork abort: %s\n", msg);
561{
562 assert (!rc_next);
563 assert (!refcnt);
564} 459}
460
461void *salloc_ (int n) throw (std::bad_alloc)
462{
463 void *ptr = g_slice_alloc (n);
464
465 if (!ptr)
466 throw std::bad_alloc ();
467
468 slice_alloc += n;
469 return ptr;
470}
471
472void *salloc_ (int n, void *src) throw (std::bad_alloc)
473{
474 void *ptr = salloc_ (n);
475
476 if (src)
477 memcpy (ptr, src, n);
478 else
479 memset (ptr, 0, n);
480
481 return ptr;
482}
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
565#endif 523#endif
566 524
567void *alloc (int s) throw (std::bad_alloc) 525/******************************************************************************/
568{
569 void *p = g_slice_alloc (s);
570
571 if (!p)
572 throw std::bad_alloc ();
573
574 return p;
575}
576 526
577void assign (char *dst, const char *src, int maxlen) 527void assign (char *dst, const char *src, int maxlen)
578{ 528{
579 if (!src) 529 if (!src)
580 src = ""; 530 src = "";
… …
596 } 546 }
597 else 547 else
598 memcpy (dst, src, len + 1); 548 memcpy (dst, src, len + 1);
599} 549}
600 550
551const char *
552format (const char *format, ...)
553{
554 static dynbuf_text buf;
601 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
566tstamp now ()
567{
568 struct timeval tv;
569
570 gettimeofday (&tv, 0);
571 return tstamp (tv.tv_sec) + tstamp (tv.tv_usec) * tstamp (1e-6);
572}
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