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

Diff Legend

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