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

Diff Legend

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