1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* |
24 | /* |
26 | * General convenience functions for crossfire. |
25 | * General convenience functions for crossfire. |
27 | */ |
26 | */ |
… | |
… | |
32 | #include <sys/time.h> |
31 | #include <sys/time.h> |
33 | #include <time.h> |
32 | #include <time.h> |
34 | #include <signal.h> |
33 | #include <signal.h> |
35 | |
34 | |
36 | #include <global.h> |
35 | #include <global.h> |
37 | #include <funcpoint.h> |
|
|
38 | #include <material.h> |
36 | #include <material.h> |
39 | |
37 | |
|
|
38 | #include <sys/time.h> |
|
|
39 | #include <sys/resource.h> |
|
|
40 | |
40 | #include <glib.h> |
41 | #include <glib.h> |
41 | |
42 | |
42 | rand_gen rndm; |
43 | refcnt_base::refcnt_t refcnt_dummy; |
|
|
44 | ssize_t slice_alloc; |
|
|
45 | rand_gen rndm, rmg_rndm; |
43 | |
46 | |
44 | void |
47 | void |
45 | tausworthe_random_generator::seed (uint32_t seed) |
48 | tausworthe_random_generator::seed (uint32_t seed) |
46 | { |
49 | { |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
50 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
51 | 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; |
52 | state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
50 | state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U; |
53 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
51 | |
54 | |
52 | for (int i = 11; --i; ) |
55 | for (int i = 11; --i; ) |
53 | operator ()(); |
56 | next (); |
54 | } |
57 | } |
55 | |
58 | |
56 | uint32_t |
59 | uint32_t |
57 | tausworthe_random_generator::next () |
60 | tausworthe_random_generator::next () |
58 | { |
61 | { |
… | |
… | |
62 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
65 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
63 | |
66 | |
64 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
67 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
65 | } |
68 | } |
66 | |
69 | |
|
|
70 | template<class generator> |
67 | uint32_t |
71 | uint32_t |
68 | tausworthe_random_generator::get_range (uint32_t num) |
72 | random_number_generator<generator>::get_range (uint32_t num) |
69 | { |
73 | { |
70 | return (next () * (uint64_t)num) >> 32U; |
74 | return (this->next () * (uint64_t)num) >> 32U; |
71 | } |
75 | } |
72 | |
76 | |
73 | // return a number within (min .. max) |
77 | // return a number within (min .. max) |
|
|
78 | template<class generator> |
74 | int |
79 | int |
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
80 | random_number_generator<generator>::get_range (int r_min, int r_max) |
76 | { |
81 | { |
77 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
82 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
78 | } |
83 | } |
|
|
84 | |
|
|
85 | template struct random_number_generator<tausworthe_random_generator>; |
|
|
86 | template struct random_number_generator<xorshift_random_generator>; |
79 | |
87 | |
80 | /* |
88 | /* |
81 | * The random functions here take luck into account when rolling random |
89 | * The random functions here take luck into account when rolling random |
82 | * 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 |
83 | * difference becomes in the random numbers. IE, the effect is lessened |
91 | * difference becomes in the random numbers. IE, the effect is lessened |
… | |
… | |
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
101 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
94 | */ |
102 | */ |
95 | int |
103 | int |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
104 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
97 | { |
105 | { |
|
|
106 | r_max = max (r_min, r_max); |
|
|
107 | |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
108 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
99 | |
|
|
100 | if (r_max < r_min) |
|
|
101 | { |
|
|
102 | LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
|
|
103 | return r_min; |
|
|
104 | } |
|
|
105 | |
109 | |
106 | if (op->type == PLAYER) |
110 | if (op->type == PLAYER) |
107 | { |
111 | { |
108 | int luck = op->stats.luck; |
112 | int luck = op->stats.luck; |
109 | |
113 | |
… | |
… | |
119 | /* |
123 | /* |
120 | * 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 |
121 | * for exp loss calculations for players changing religions. |
125 | * for exp loss calculations for players changing religions. |
122 | */ |
126 | */ |
123 | sint64 |
127 | sint64 |
124 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
128 | random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad) |
125 | { |
129 | { |
126 | sint64 omin = min; |
130 | sint64 omin = r_min; |
127 | sint64 diff = max - min + 1; |
131 | sint64 range = max (0, r_max - r_min + 1); |
128 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
132 | int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
129 | |
|
|
130 | if (diff < 0) |
|
|
131 | { |
|
|
132 | LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
|
|
133 | return (min); /* avoids a float exception */ |
|
|
134 | } |
|
|
135 | |
133 | |
136 | /* |
134 | /* |
137 | * Make a call to get two 32 bit unsigned random numbers, and just to |
135 | * Make a call to get two 32 bit unsigned random numbers, and just to |
138 | * a little bitshifting. |
136 | * a little bitshifting. |
139 | */ |
137 | */ |
140 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
138 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
141 | |
139 | |
142 | if (op->type != PLAYER) |
140 | if (op->type != PLAYER) |
143 | return ((ran % diff) + min); |
141 | return ((ran % range) + r_min); |
144 | |
142 | |
145 | int luck = op->stats.luck; |
143 | int luck = op->stats.luck; |
146 | |
144 | |
147 | if (rndm (base) < MIN (10, abs (luck))) |
145 | if (rndm (base) < min (10, abs (luck))) |
148 | { |
146 | { |
149 | /* we have a winner */ |
147 | /* we have a winner */ |
150 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
148 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
151 | diff -= luck; |
149 | range -= luck; |
152 | if (diff < 1) |
150 | if (range < 1) |
153 | return (omin); /*check again */ |
151 | return (omin); /*check again */ |
154 | |
152 | |
155 | ((goodbad) ? (min += luck) : (diff)); |
153 | ((goodbad) ? (r_min += luck) : (range)); |
156 | |
154 | |
157 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
155 | return (max (omin, min (r_max, (ran % range) + r_min))); |
158 | } |
156 | } |
159 | |
157 | |
160 | return ran % diff + min; |
158 | return ran % range + r_min; |
161 | } |
159 | } |
162 | |
160 | |
163 | /* |
161 | /* |
164 | * 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, |
165 | * 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. |
… | |
… | |
204 | } |
202 | } |
205 | |
203 | |
206 | return total; |
204 | return total; |
207 | } |
205 | } |
208 | |
206 | |
209 | /* decay and destroy perishable items in a map */ |
|
|
210 | void |
|
|
211 | maptile::decay_objects () |
|
|
212 | { |
|
|
213 | if (!spaces) |
|
|
214 | return; |
|
|
215 | |
|
|
216 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
217 | for (object *above, *op = ms->bot; op; op = above) |
|
|
218 | { |
|
|
219 | above = op->above; |
|
|
220 | |
|
|
221 | bool destroy = 0; |
|
|
222 | |
|
|
223 | // do not decay anything above unique floor tiles (yet :) |
|
|
224 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
225 | break; |
|
|
226 | |
|
|
227 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
228 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
229 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
230 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
231 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
232 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
233 | || op->is_alive ()) |
|
|
234 | ; // do not decay |
|
|
235 | else if (op->is_weapon ()) |
|
|
236 | { |
|
|
237 | op->stats.dam--; |
|
|
238 | if (op->stats.dam < 0) |
|
|
239 | destroy = 1; |
|
|
240 | } |
|
|
241 | else if (op->is_armor ()) |
|
|
242 | { |
|
|
243 | op->stats.ac--; |
|
|
244 | if (op->stats.ac < 0) |
|
|
245 | destroy = 1; |
|
|
246 | } |
|
|
247 | else if (op->type == FOOD) |
|
|
248 | { |
|
|
249 | op->stats.food -= rndm (5, 20); |
|
|
250 | if (op->stats.food < 0) |
|
|
251 | destroy = 1; |
|
|
252 | } |
|
|
253 | else |
|
|
254 | { |
|
|
255 | int mat = op->materials; |
|
|
256 | |
|
|
257 | if (mat & M_PAPER |
|
|
258 | || mat & M_LEATHER |
|
|
259 | || mat & M_WOOD |
|
|
260 | || mat & M_ORGANIC |
|
|
261 | || mat & M_CLOTH |
|
|
262 | || mat & M_LIQUID |
|
|
263 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
264 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
265 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
266 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
267 | || (mat & M_ICE && temp > 32)) |
|
|
268 | destroy = 1; |
|
|
269 | } |
|
|
270 | |
|
|
271 | /* adjust overall chance below */ |
|
|
272 | if (destroy && rndm (0, 1)) |
|
|
273 | op->destroy (); |
|
|
274 | } |
|
|
275 | } |
|
|
276 | |
|
|
277 | /* convert materialname to materialtype_t */ |
207 | /* convert materialname to materialtype_t */ |
278 | |
208 | |
279 | materialtype_t * |
209 | materialtype_t * |
280 | name_to_material (const shstr &name) |
210 | name_to_material (const shstr_cmp name) |
281 | { |
211 | { |
282 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
212 | for (materialtype_t *mt = materialt; mt; mt = mt->next) |
283 | if (name == mt->name) |
213 | if (name == mt->name) |
284 | return mt; |
214 | return mt; |
285 | |
215 | |
286 | return materialt; |
216 | return 0; |
287 | } |
217 | } |
288 | |
218 | |
289 | /* when doing transmutation of objects, we have to recheck the resistances, |
219 | /* when doing transmutation of objects, we have to recheck the resistances, |
290 | * as some that did not apply previously, may apply now. |
220 | * as some that did not apply previously, may apply now. |
291 | */ |
221 | */ |
292 | |
|
|
293 | void |
222 | void |
294 | transmute_materialname (object *op, const object *change) |
223 | transmute_materialname (object *op, const object *change) |
295 | { |
224 | { |
296 | materialtype_t *mt; |
225 | materialtype_t *mt; |
297 | int j; |
226 | int j; |
298 | |
227 | |
299 | if (op->materialname == NULL) |
228 | if (!op->materialname) |
300 | return; |
229 | return; |
301 | |
230 | |
302 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
231 | if (op->materialname != change->materialname) |
303 | return; |
232 | return; |
304 | |
233 | |
305 | if (!op->is_armor ()) |
234 | if (!op->is_armor ()) |
306 | return; |
235 | return; |
307 | |
236 | |
… | |
… | |
327 | void |
256 | void |
328 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
257 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
329 | { |
258 | { |
330 | materialtype_t *mt, *lmt; |
259 | materialtype_t *mt, *lmt; |
331 | |
260 | |
332 | #ifdef NEW_MATERIAL_CODE |
|
|
333 | int j; |
|
|
334 | #endif |
|
|
335 | |
|
|
336 | if (op->materialname != NULL) |
261 | if (!op->materialname) |
337 | return; |
262 | return; |
338 | |
263 | |
339 | |
264 | if (nmt) |
340 | |
265 | lmt = nmt; |
341 | if (nmt == NULL) |
266 | else |
342 | { |
267 | { |
343 | lmt = NULL; |
268 | lmt = 0; |
344 | #ifndef NEW_MATERIAL_CODE |
269 | |
345 | for (mt = materialt; mt && mt->next; mt = mt->next) |
270 | for (mt = materialt; mt; mt = mt->next) |
346 | { |
271 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
347 | if (op->materials & mt->material) |
272 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
348 | { |
273 | { |
349 | lmt = mt; |
274 | lmt = mt; |
|
|
275 | if (!(op->is_weapon () || op->is_armor ())) |
350 | break; |
276 | break; |
351 | } |
277 | } |
352 | } |
|
|
353 | |
|
|
354 | #else |
|
|
355 | for (mt = materialt; mt && mt->next; mt = mt->next) |
|
|
356 | { |
|
|
357 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
|
|
358 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
|
|
359 | { |
|
|
360 | lmt = mt; |
|
|
361 | if (!(op->is_weapon () || op->is_armor ())) |
|
|
362 | break; |
|
|
363 | } |
|
|
364 | } |
|
|
365 | #endif |
|
|
366 | } |
|
|
367 | else |
|
|
368 | { |
278 | } |
369 | lmt = nmt; |
279 | |
|
|
280 | if (lmt) |
370 | } |
281 | { |
371 | |
|
|
372 | if (lmt != NULL) |
|
|
373 | { |
|
|
374 | #ifndef NEW_MATERIAL_CODE |
|
|
375 | op->materialname = lmt->name; |
|
|
376 | return; |
|
|
377 | #else |
|
|
378 | |
|
|
379 | if (op->stats.dam && op->is_weapon ()) |
282 | if (op->stats.dam && op->is_weapon ()) |
380 | { |
283 | { |
381 | op->stats.dam += lmt->damage; |
284 | op->stats.dam += lmt->damage; |
382 | if (op->stats.dam < 1) |
285 | if (op->stats.dam < 1) |
383 | op->stats.dam = 1; |
286 | op->stats.dam = 1; |
… | |
… | |
389 | op->stats.wc += lmt->wc; |
292 | op->stats.wc += lmt->wc; |
390 | if (op->is_armor ()) |
293 | if (op->is_armor ()) |
391 | { |
294 | { |
392 | if (op->stats.ac) |
295 | if (op->stats.ac) |
393 | op->stats.ac += lmt->ac; |
296 | op->stats.ac += lmt->ac; |
|
|
297 | |
394 | for (j = 0; j < NROFATTACKS; j++) |
298 | for (int j = 0; j < NROFATTACKS; j++) |
395 | if (op->resist[j] != 0) |
299 | if (op->resist[j] != 0) |
396 | { |
300 | { |
397 | op->resist[j] += lmt->mod[j]; |
301 | op->resist[j] += lmt->mod[j]; |
398 | if (op->resist[j] > 100) |
302 | if (op->resist[j] > 100) |
399 | op->resist[j] = 100; |
303 | op->resist[j] = 100; |
400 | if (op->resist[j] < -100) |
304 | if (op->resist[j] < -100) |
401 | op->resist[j] = -100; |
305 | op->resist[j] = -100; |
402 | } |
306 | } |
403 | } |
307 | } |
|
|
308 | |
404 | op->materialname = lmt->name; |
309 | op->materialname = lmt->name; |
405 | /* dont make it unstackable if it doesn't need to be */ |
310 | /* dont make it unstackable if it doesn't need to be */ |
406 | if (op->is_weapon () || op->is_armor ()) |
311 | if (op->is_weapon () || op->is_armor ()) |
407 | { |
312 | { |
408 | op->weight = (op->weight * lmt->weight) / 100; |
313 | op->weight = (op->weight * lmt->weight) / 100; |
409 | op->value = (op->value * lmt->value) / 100; |
314 | op->value = (op->value * lmt->value) / 100; |
410 | } |
315 | } |
411 | #endif |
|
|
412 | } |
316 | } |
413 | } |
317 | } |
414 | |
318 | |
415 | /* |
319 | /* |
416 | * Strip out the media tags from a String. |
320 | * Strip out the media tags from a String. |
… | |
… | |
511 | * 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 |
512 | * 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. |
513 | * This function will also strip all trailing non alphanumeric characters. |
417 | * This function will also strip all trailing non alphanumeric characters. |
514 | * It does not insert an oxford comma. |
418 | * It does not insert an oxford comma. |
515 | */ |
419 | */ |
516 | |
|
|
517 | void |
420 | void |
518 | make_list_like (char *input) |
421 | make_list_like (char *input) |
519 | { |
422 | { |
520 | char *p, tmp[MAX_BUF]; |
423 | char *p, tmp[MAX_BUF]; |
521 | int i; |
424 | int i; |
… | |
… | |
551 | void |
454 | void |
552 | fork_abort (const char *msg) |
455 | fork_abort (const char *msg) |
553 | { |
456 | { |
554 | if (!fork ()) |
457 | if (!fork ()) |
555 | { |
458 | { |
|
|
459 | signal (SIGINT , SIG_IGN); |
|
|
460 | signal (SIGTERM, SIG_IGN); |
556 | signal (SIGABRT, SIG_DFL); |
461 | signal (SIGABRT, SIG_IGN); |
|
|
462 | |
|
|
463 | signal (SIGSEGV, SIG_DFL); |
|
|
464 | signal (SIGBUS , SIG_DFL); |
|
|
465 | signal (SIGILL , SIG_DFL); |
|
|
466 | signal (SIGTRAP, SIG_DFL); |
|
|
467 | |
557 | // try to put corefiles into a subdirectory, if existing, to allow |
468 | // try to put corefiles into a subdirectory, if existing, to allow |
558 | // an administrator to reduce the I/O load. |
469 | // an administrator to reduce the I/O load. |
559 | chdir ("cores"); |
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); |
560 | abort (); |
492 | abort (); |
561 | } |
493 | } |
562 | |
494 | |
563 | LOG (llevError, "fork abort: %s\n", msg); |
495 | LOG (llevError, "fork abort: %s\n", msg); |
564 | } |
496 | } |
565 | |
497 | |
566 | void *salloc_ (int n) throw (std::bad_alloc) |
498 | void *salloc_ (int n) throw (std::bad_alloc) |
567 | { |
499 | { |
568 | #ifdef PREFER_MALLOC |
|
|
569 | void *ptr = malloc (n); |
|
|
570 | #else |
|
|
571 | void *ptr = g_slice_alloc (n); |
500 | void *ptr = g_slice_alloc (n); |
572 | #endif |
|
|
573 | |
501 | |
574 | if (!ptr) |
502 | if (!ptr) |
575 | throw std::bad_alloc (); |
503 | throw std::bad_alloc (); |
576 | |
504 | |
|
|
505 | slice_alloc += n; |
577 | return ptr; |
506 | return ptr; |
578 | } |
507 | } |
579 | |
508 | |
580 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
509 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
581 | { |
510 | { |
… | |
… | |
587 | memset (ptr, 0, n); |
516 | memset (ptr, 0, n); |
588 | |
517 | |
589 | return ptr; |
518 | return ptr; |
590 | } |
519 | } |
591 | |
520 | |
|
|
521 | /******************************************************************************/ |
|
|
522 | |
|
|
523 | #if DEBUG_SALLOC |
|
|
524 | |
|
|
525 | #define MAGIC 0xa1b2c35543deadLL |
|
|
526 | |
|
|
527 | void *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 | |
|
|
535 | void *g_slice_alloc0 (unsigned long size) |
|
|
536 | { |
|
|
537 | return memset (g_slice_alloc (size), 0, size); |
|
|
538 | } |
|
|
539 | |
|
|
540 | void 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 | |
592 | void assign (char *dst, const char *src, int maxlen) |
564 | void assign (char *dst, const char *src, int maxlen) |
593 | { |
565 | { |
594 | if (!src) |
566 | if (!src) |
595 | src = ""; |
567 | src = ""; |
596 | |
568 | |
… | |
… | |
611 | } |
583 | } |
612 | else |
584 | else |
613 | memcpy (dst, src, len + 1); |
585 | memcpy (dst, src, len + 1); |
614 | } |
586 | } |
615 | |
587 | |
616 | const std::string |
588 | const char * |
617 | format (const char *format, ...) |
589 | format (const char *format, ...) |
618 | { |
590 | { |
619 | int len; |
591 | static dynbuf_text buf; |
620 | |
592 | |
621 | { |
593 | buf.clear (); |
622 | char buf[128]; |
|
|
623 | |
594 | |
624 | va_list ap; |
595 | va_list ap; |
625 | va_start (ap, format); |
596 | va_start (ap, format); |
626 | len = vsnprintf (buf, sizeof (buf), format, ap); |
597 | buf.vprintf (format, ap); |
627 | va_end (ap); |
598 | va_end (ap); |
628 | |
599 | |
629 | assert (len >= 0); // shield againstz broken vsnprintf's |
|
|
630 | |
|
|
631 | // was our static buffer short enough? |
|
|
632 | if (len < sizeof (buf)) |
|
|
633 | return std::string (buf, len); |
|
|
634 | } |
|
|
635 | |
|
|
636 | { |
|
|
637 | // longer, try harder |
|
|
638 | char *buf = salloc<char> (len + 1); |
|
|
639 | |
|
|
640 | va_list ap; |
|
|
641 | va_start (ap, format); |
|
|
642 | vsnprintf (buf, len + 1, format, ap); |
|
|
643 | va_end (ap); |
|
|
644 | |
|
|
645 | const std::string s (buf, len); |
|
|
646 | sfree<char> (buf, len + 1); |
|
|
647 | |
|
|
648 | return buf; |
600 | return buf; |
649 | } |
|
|
650 | } |
601 | } |
651 | |
602 | |
652 | tstamp now () |
603 | tstamp now () |
653 | { |
604 | { |
654 | struct timeval tv; |
605 | struct timeval tv; |
… | |
… | |
722 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
673 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
723 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
674 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
724 | 0x2d02ef8dL |
675 | 0x2d02ef8dL |
725 | }; |
676 | }; |
726 | |
677 | |
|
|
678 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
679 | { |
|
|
680 | pthread_attr_t attr; |
727 | |
681 | |
|
|
682 | pthread_attr_init (&attr); |
|
|
683 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
684 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
685 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
686 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
687 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
688 | #endif |
|
|
689 | |
|
|
690 | sigset_t fullsigset, oldsigset; |
|
|
691 | sigfillset (&fullsigset); |
|
|
692 | |
|
|
693 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
694 | |
|
|
695 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
696 | cleanup ("unable to create a new thread"); |
|
|
697 | |
|
|
698 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
699 | } |
|
|
700 | |