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 it under |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * any later version. |
11 | * 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 Affero GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* |
25 | /* |
26 | * General convenience functions for crossfire. |
26 | * General convenience functions for crossfire. |
27 | */ |
27 | */ |
… | |
… | |
32 | #include <sys/time.h> |
32 | #include <sys/time.h> |
33 | #include <time.h> |
33 | #include <time.h> |
34 | #include <signal.h> |
34 | #include <signal.h> |
35 | |
35 | |
36 | #include <global.h> |
36 | #include <global.h> |
37 | #include <funcpoint.h> |
|
|
38 | #include <material.h> |
37 | #include <material.h> |
|
|
38 | #include <object.h> |
|
|
39 | |
|
|
40 | #include <sys/time.h> |
|
|
41 | #include <sys/resource.h> |
39 | |
42 | |
40 | #include <glib.h> |
43 | #include <glib.h> |
41 | |
44 | |
42 | rand_gen rndm; |
45 | refcnt_base::refcnt_t refcnt_dummy; |
|
|
46 | ssize_t slice_alloc; |
|
|
47 | rand_gen rndm, rmg_rndm; |
43 | |
48 | |
44 | void |
49 | void |
45 | tausworthe_random_generator::seed (uint32_t seed) |
50 | tausworthe_random_generator::seed (uint32_t seed) |
46 | { |
51 | { |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
52 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
53 | 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; |
54 | 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; |
55 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
51 | |
56 | |
52 | for (int i = 11; --i; ) |
57 | for (int i = 11; --i; ) |
53 | operator ()(); |
58 | next (); |
54 | } |
59 | } |
55 | |
60 | |
56 | uint32_t |
61 | uint32_t |
57 | tausworthe_random_generator::next () |
62 | tausworthe_random_generator::next () |
58 | { |
63 | { |
… | |
… | |
62 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
67 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
63 | |
68 | |
64 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
69 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
65 | } |
70 | } |
66 | |
71 | |
|
|
72 | template<class generator> |
67 | uint32_t |
73 | uint32_t |
68 | tausworthe_random_generator::get_range (uint32_t num) |
74 | random_number_generator<generator>::get_range (uint32_t num) |
69 | { |
75 | { |
70 | return (next () * (uint64_t)num) >> 32U; |
76 | return (this->next () * (uint64_t)num) >> 32U; |
71 | } |
77 | } |
72 | |
78 | |
73 | // return a number within (min .. max) |
79 | // return a number within (min .. max) |
|
|
80 | template<class generator> |
74 | int |
81 | int |
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
82 | random_number_generator<generator>::get_range (int r_min, int r_max) |
76 | { |
83 | { |
77 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
84 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
78 | } |
85 | } |
|
|
86 | |
|
|
87 | template struct random_number_generator<tausworthe_random_generator>; |
|
|
88 | template struct random_number_generator<xorshift_random_generator>; |
79 | |
89 | |
80 | /* |
90 | /* |
81 | * The random functions here take luck into account when rolling random |
91 | * 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 |
92 | * 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 |
93 | * difference becomes in the random numbers. IE, the effect is lessened |
… | |
… | |
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
103 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
94 | */ |
104 | */ |
95 | int |
105 | int |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
106 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
97 | { |
107 | { |
|
|
108 | r_max = max (r_min, r_max); |
|
|
109 | |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
110 | 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 | |
111 | |
106 | if (op->type == PLAYER) |
112 | if (op->type == PLAYER) |
107 | { |
113 | { |
108 | int luck = op->stats.luck; |
114 | int luck = op->stats.luck; |
109 | |
115 | |
… | |
… | |
119 | /* |
125 | /* |
120 | * This is a 64 bit version of random_roll above. This is needed |
126 | * This is a 64 bit version of random_roll above. This is needed |
121 | * for exp loss calculations for players changing religions. |
127 | * for exp loss calculations for players changing religions. |
122 | */ |
128 | */ |
123 | sint64 |
129 | sint64 |
124 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
130 | random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad) |
125 | { |
131 | { |
126 | sint64 omin = min; |
132 | sint64 omin = r_min; |
127 | sint64 diff = max - min + 1; |
133 | sint64 range = max (0, r_max - r_min + 1); |
128 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
134 | 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 | |
135 | |
136 | /* |
136 | /* |
137 | * Make a call to get two 32 bit unsigned random numbers, and just to |
137 | * Make a call to get two 32 bit unsigned random numbers, and just to |
138 | * a little bitshifting. |
138 | * a little bitshifting. |
139 | */ |
139 | */ |
140 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
140 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
141 | |
141 | |
142 | if (op->type != PLAYER) |
142 | if (op->type != PLAYER) |
143 | return ((ran % diff) + min); |
143 | return ((ran % range) + r_min); |
144 | |
144 | |
145 | int luck = op->stats.luck; |
145 | int luck = op->stats.luck; |
146 | |
146 | |
147 | if (rndm (base) < MIN (10, abs (luck))) |
147 | if (rndm (base) < min (10, abs (luck))) |
148 | { |
148 | { |
149 | /* we have a winner */ |
149 | /* we have a winner */ |
150 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
150 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
151 | diff -= luck; |
151 | range -= luck; |
152 | if (diff < 1) |
152 | if (range < 1) |
153 | return (omin); /*check again */ |
153 | return (omin); /*check again */ |
154 | |
154 | |
155 | ((goodbad) ? (min += luck) : (diff)); |
155 | ((goodbad) ? (r_min += luck) : (range)); |
156 | |
156 | |
157 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
157 | return (max (omin, min (r_max, (ran % range) + r_min))); |
158 | } |
158 | } |
159 | |
159 | |
160 | return ran % diff + min; |
160 | return ran % range + r_min; |
161 | } |
161 | } |
162 | |
162 | |
163 | /* |
163 | /* |
164 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
164 | * 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. |
165 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
… | |
… | |
207 | } |
207 | } |
208 | |
208 | |
209 | /* convert materialname to materialtype_t */ |
209 | /* convert materialname to materialtype_t */ |
210 | |
210 | |
211 | materialtype_t * |
211 | materialtype_t * |
212 | name_to_material (const shstr &name) |
212 | name_to_material (const shstr_cmp name) |
213 | { |
213 | { |
214 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
214 | for (materialtype_t *mt = materialt; mt; mt = mt->next) |
215 | if (name == mt->name) |
215 | if (name == mt->name) |
216 | return mt; |
216 | return mt; |
217 | |
217 | |
218 | return materialt; |
218 | return 0; |
219 | } |
219 | } |
220 | |
220 | |
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
222 | * as some that did not apply previously, may apply now. |
222 | * as some that did not apply previously, may apply now. |
223 | */ |
223 | */ |
224 | |
|
|
225 | void |
224 | void |
226 | transmute_materialname (object *op, const object *change) |
225 | transmute_materialname (object *op, const object *change) |
227 | { |
226 | { |
228 | materialtype_t *mt; |
227 | materialtype_t *mt; |
229 | int j; |
228 | int j; |
230 | |
229 | |
231 | if (op->materialname == NULL) |
230 | if (!op->materialname) |
232 | return; |
231 | return; |
233 | |
232 | |
234 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
233 | if (op->materialname != change->materialname) |
235 | return; |
234 | return; |
236 | |
235 | |
237 | if (!op->is_armor ()) |
236 | if (!op->is_armor ()) |
238 | return; |
237 | return; |
239 | |
238 | |
… | |
… | |
259 | void |
258 | void |
260 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
259 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
261 | { |
260 | { |
262 | materialtype_t *mt, *lmt; |
261 | materialtype_t *mt, *lmt; |
263 | |
262 | |
264 | #ifdef NEW_MATERIAL_CODE |
|
|
265 | int j; |
|
|
266 | #endif |
|
|
267 | |
|
|
268 | if (op->materialname != NULL) |
263 | if (!op->materialname) |
269 | return; |
264 | return; |
270 | |
265 | |
271 | |
266 | if (nmt) |
272 | |
267 | lmt = nmt; |
273 | if (nmt == NULL) |
268 | else |
274 | { |
269 | { |
275 | lmt = NULL; |
270 | lmt = 0; |
276 | #ifndef NEW_MATERIAL_CODE |
271 | |
277 | for (mt = materialt; mt && mt->next; mt = mt->next) |
272 | for (mt = materialt; mt; mt = mt->next) |
278 | { |
273 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
279 | if (op->materials & mt->material) |
274 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
280 | { |
275 | { |
281 | lmt = mt; |
276 | lmt = mt; |
|
|
277 | if (!(op->is_weapon () || op->is_armor ())) |
282 | break; |
278 | break; |
283 | } |
279 | } |
284 | } |
|
|
285 | |
|
|
286 | #else |
|
|
287 | for (mt = materialt; mt && mt->next; mt = mt->next) |
|
|
288 | { |
|
|
289 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
|
|
290 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
|
|
291 | { |
|
|
292 | lmt = mt; |
|
|
293 | if (!(op->is_weapon () || op->is_armor ())) |
|
|
294 | break; |
|
|
295 | } |
|
|
296 | } |
|
|
297 | #endif |
|
|
298 | } |
|
|
299 | else |
|
|
300 | { |
280 | } |
301 | lmt = nmt; |
281 | |
|
|
282 | if (lmt) |
302 | } |
283 | { |
303 | |
|
|
304 | if (lmt != NULL) |
|
|
305 | { |
|
|
306 | #ifndef NEW_MATERIAL_CODE |
|
|
307 | op->materialname = lmt->name; |
|
|
308 | return; |
|
|
309 | #else |
|
|
310 | |
|
|
311 | if (op->stats.dam && op->is_weapon ()) |
284 | if (op->stats.dam && op->is_weapon ()) |
312 | { |
285 | { |
313 | op->stats.dam += lmt->damage; |
286 | op->stats.dam += lmt->damage; |
314 | if (op->stats.dam < 1) |
287 | if (op->stats.dam < 1) |
315 | op->stats.dam = 1; |
288 | op->stats.dam = 1; |
… | |
… | |
321 | op->stats.wc += lmt->wc; |
294 | op->stats.wc += lmt->wc; |
322 | if (op->is_armor ()) |
295 | if (op->is_armor ()) |
323 | { |
296 | { |
324 | if (op->stats.ac) |
297 | if (op->stats.ac) |
325 | op->stats.ac += lmt->ac; |
298 | op->stats.ac += lmt->ac; |
|
|
299 | |
326 | for (j = 0; j < NROFATTACKS; j++) |
300 | for (int j = 0; j < NROFATTACKS; j++) |
327 | if (op->resist[j] != 0) |
301 | if (op->resist[j] != 0) |
328 | { |
302 | { |
329 | op->resist[j] += lmt->mod[j]; |
303 | op->resist[j] += lmt->mod[j]; |
330 | if (op->resist[j] > 100) |
304 | if (op->resist[j] > 100) |
331 | op->resist[j] = 100; |
305 | op->resist[j] = 100; |
332 | if (op->resist[j] < -100) |
306 | if (op->resist[j] < -100) |
333 | op->resist[j] = -100; |
307 | op->resist[j] = -100; |
334 | } |
308 | } |
335 | } |
309 | } |
|
|
310 | |
336 | op->materialname = lmt->name; |
311 | op->materialname = lmt->name; |
337 | /* dont make it unstackable if it doesn't need to be */ |
312 | /* dont make it unstackable if it doesn't need to be */ |
338 | if (op->is_weapon () || op->is_armor ()) |
313 | if (op->is_weapon () || op->is_armor ()) |
339 | { |
314 | { |
340 | op->weight = (op->weight * lmt->weight) / 100; |
315 | op->weight = (op->weight * lmt->weight) / 100; |
341 | op->value = (op->value * lmt->value) / 100; |
316 | op->value = (op->value * lmt->value) / 100; |
342 | } |
317 | } |
343 | #endif |
|
|
344 | } |
318 | } |
345 | } |
319 | } |
346 | |
320 | |
347 | /* |
321 | /* |
348 | * Strip out the media tags from a String. |
322 | * Strip out the media tags from a String. |
… | |
… | |
443 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
417 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
444 | * for the last entry, which has an 'and' before it, and a full stop (period) after it. |
418 | * for the last entry, which has an 'and' before it, and a full stop (period) after it. |
445 | * This function will also strip all trailing non alphanumeric characters. |
419 | * This function will also strip all trailing non alphanumeric characters. |
446 | * It does not insert an oxford comma. |
420 | * It does not insert an oxford comma. |
447 | */ |
421 | */ |
448 | |
|
|
449 | void |
422 | void |
450 | make_list_like (char *input) |
423 | make_list_like (char *input) |
451 | { |
424 | { |
452 | char *p, tmp[MAX_BUF]; |
425 | char *p, tmp[MAX_BUF]; |
453 | int i; |
426 | int i; |
… | |
… | |
476 | strcpy (input, tmp); |
449 | strcpy (input, tmp); |
477 | |
450 | |
478 | return; |
451 | return; |
479 | } |
452 | } |
480 | |
453 | |
|
|
454 | /******************************************************************************/ |
|
|
455 | |
|
|
456 | /* Checks a player-provided string which will become the msg property of |
|
|
457 | * an object for dangerous input. |
|
|
458 | */ |
|
|
459 | bool |
|
|
460 | msg_is_safe (const char *msg) |
|
|
461 | { |
|
|
462 | bool safe = true; |
|
|
463 | |
|
|
464 | /* Trying to cheat by getting data into the object */ |
|
|
465 | if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1) |
|
|
466 | || strstr (msg, "\nendmsg")) |
|
|
467 | safe = false; |
|
|
468 | |
|
|
469 | /* Trying to make the object talk, and potentially access arbitrary code */ |
|
|
470 | if (object::msg_has_dialogue (msg)) |
|
|
471 | safe = false; |
|
|
472 | |
|
|
473 | return safe; |
|
|
474 | } |
|
|
475 | |
481 | ///////////////////////////////////////////////////////////////////////////// |
476 | ///////////////////////////////////////////////////////////////////////////// |
482 | |
477 | |
483 | void |
478 | void |
484 | fork_abort (const char *msg) |
479 | fork_abort (const char *msg) |
485 | { |
480 | { |
486 | if (!fork ()) |
481 | if (!fork ()) |
487 | { |
482 | { |
|
|
483 | signal (SIGINT , SIG_IGN); |
|
|
484 | signal (SIGTERM, SIG_IGN); |
488 | signal (SIGABRT, SIG_DFL); |
485 | signal (SIGABRT, SIG_IGN); |
|
|
486 | |
|
|
487 | signal (SIGSEGV, SIG_DFL); |
|
|
488 | signal (SIGBUS , SIG_DFL); |
|
|
489 | signal (SIGILL , SIG_DFL); |
|
|
490 | signal (SIGTRAP, SIG_DFL); |
|
|
491 | |
489 | // try to put corefiles into a subdirectory, if existing, to allow |
492 | // try to put corefiles into a subdirectory, if existing, to allow |
490 | // an administrator to reduce the I/O load. |
493 | // an administrator to reduce the I/O load. |
491 | chdir ("cores"); |
494 | chdir ("cores"); |
|
|
495 | |
|
|
496 | // try to detach us from as many external dependencies as possible |
|
|
497 | // as coredumping can take time by closing all fd's. |
|
|
498 | { |
|
|
499 | struct rlimit lim; |
|
|
500 | |
|
|
501 | if (getrlimit (RLIMIT_NOFILE, &lim)) |
|
|
502 | lim.rlim_cur = 1024; |
|
|
503 | |
|
|
504 | for (int i = 0; i < lim.rlim_cur; ++i) |
|
|
505 | close (i); |
|
|
506 | } |
|
|
507 | |
|
|
508 | { |
|
|
509 | sigset_t empty; |
|
|
510 | sigemptyset (&empty); |
|
|
511 | sigprocmask (SIG_SETMASK, &empty, 0); |
|
|
512 | } |
|
|
513 | |
|
|
514 | // try to coredump with SIGTRAP |
|
|
515 | kill (getpid (), SIGTRAP); |
492 | abort (); |
516 | abort (); |
493 | } |
517 | } |
494 | |
518 | |
495 | LOG (llevError, "fork abort: %s\n", msg); |
519 | LOG (llevError, "fork abort: %s\n", msg); |
496 | } |
520 | } |
497 | |
521 | |
498 | void *salloc_ (int n) throw (std::bad_alloc) |
522 | void *salloc_ (int n) throw (std::bad_alloc) |
499 | { |
523 | { |
500 | #ifdef PREFER_MALLOC |
|
|
501 | void *ptr = malloc (n); |
|
|
502 | #else |
|
|
503 | void *ptr = g_slice_alloc (n); |
524 | void *ptr = g_slice_alloc (n); |
504 | #endif |
|
|
505 | |
525 | |
506 | if (!ptr) |
526 | if (!ptr) |
507 | throw std::bad_alloc (); |
527 | throw std::bad_alloc (); |
508 | |
528 | |
|
|
529 | slice_alloc += n; |
509 | return ptr; |
530 | return ptr; |
510 | } |
531 | } |
511 | |
532 | |
512 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
533 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
513 | { |
534 | { |
… | |
… | |
519 | memset (ptr, 0, n); |
540 | memset (ptr, 0, n); |
520 | |
541 | |
521 | return ptr; |
542 | return ptr; |
522 | } |
543 | } |
523 | |
544 | |
|
|
545 | /******************************************************************************/ |
|
|
546 | |
|
|
547 | #if DEBUG_SALLOC |
|
|
548 | |
|
|
549 | #define MAGIC 0xa1b2c35543deadLL |
|
|
550 | |
|
|
551 | void *g_slice_alloc (unsigned long size) |
|
|
552 | { |
|
|
553 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
|
|
554 | *p++ = size ^ MAGIC; |
|
|
555 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
|
|
556 | return (void *)p; |
|
|
557 | } |
|
|
558 | |
|
|
559 | void *g_slice_alloc0 (unsigned long size) |
|
|
560 | { |
|
|
561 | return memset (g_slice_alloc (size), 0, size); |
|
|
562 | } |
|
|
563 | |
|
|
564 | void g_slice_free1 (unsigned long size, void *ptr) |
|
|
565 | { |
|
|
566 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
567 | if (expect_true (ptr)) |
|
|
568 | { |
|
|
569 | unsigned long *p = (unsigned long *)ptr; |
|
|
570 | unsigned long s = *--p ^ MAGIC; |
|
|
571 | |
|
|
572 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
573 | { |
|
|
574 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
575 | abort (); |
|
|
576 | } |
|
|
577 | |
|
|
578 | *p = MAGIC; |
|
|
579 | |
|
|
580 | (g_slice_free1)(s + sizeof (unsigned long), p); |
|
|
581 | } |
|
|
582 | } |
|
|
583 | |
|
|
584 | #endif |
|
|
585 | |
|
|
586 | /******************************************************************************/ |
|
|
587 | |
|
|
588 | int |
524 | void assign (char *dst, const char *src, int maxlen) |
589 | assign (char *dst, const char *src, int maxsize) |
525 | { |
590 | { |
526 | if (!src) |
591 | if (!src) |
527 | src = ""; |
592 | src = ""; |
528 | |
593 | |
529 | int len = strlen (src); |
594 | int len = strlen (src); |
530 | |
595 | |
531 | if (len >= maxlen - 1) |
596 | if (len >= maxsize) |
532 | { |
597 | { |
533 | if (maxlen <= 4) |
598 | if (maxsize <= 4) |
534 | { |
599 | { |
535 | memset (dst, '.', maxlen - 1); |
600 | memset (dst, '.', maxsize - 2); |
536 | dst [maxlen - 1] = 0; |
601 | dst [maxsize - 1] = 0; |
537 | } |
602 | } |
538 | else |
603 | else |
539 | { |
604 | { |
540 | memcpy (dst, src, maxlen - 4); |
605 | memcpy (dst, src, maxsize - 4); |
541 | memcpy (dst + maxlen - 4, "...", 4); |
606 | memcpy (dst + maxsize - 4, "...", 4); |
542 | } |
607 | } |
|
|
608 | |
|
|
609 | len = maxsize; |
543 | } |
610 | } |
544 | else |
611 | else |
545 | memcpy (dst, src, len + 1); |
612 | memcpy (dst, src, ++len); |
546 | } |
|
|
547 | |
613 | |
548 | const std::string |
614 | return len; |
|
|
615 | } |
|
|
616 | |
|
|
617 | const char * |
549 | format (const char *format, ...) |
618 | format (const char *format, ...) |
550 | { |
619 | { |
551 | int len; |
620 | static dynbuf_text buf; |
552 | |
621 | |
553 | { |
622 | buf.clear (); |
554 | char buf[128]; |
|
|
555 | |
623 | |
556 | va_list ap; |
624 | va_list ap; |
557 | va_start (ap, format); |
625 | va_start (ap, format); |
558 | len = vsnprintf (buf, sizeof (buf), format, ap); |
626 | buf.vprintf (format, ap); |
559 | va_end (ap); |
627 | va_end (ap); |
560 | |
628 | |
561 | assert (len >= 0); // shield againstz broken vsnprintf's |
|
|
562 | |
|
|
563 | // was our static buffer short enough? |
|
|
564 | if (len < sizeof (buf)) |
|
|
565 | return std::string (buf, len); |
|
|
566 | } |
|
|
567 | |
|
|
568 | { |
|
|
569 | // longer, try harder |
|
|
570 | char *buf = salloc<char> (len + 1); |
|
|
571 | |
|
|
572 | va_list ap; |
|
|
573 | va_start (ap, format); |
|
|
574 | vsnprintf (buf, len + 1, format, ap); |
|
|
575 | va_end (ap); |
|
|
576 | |
|
|
577 | const std::string s (buf, len); |
|
|
578 | sfree<char> (buf, len + 1); |
|
|
579 | |
|
|
580 | return buf; |
629 | return buf; |
581 | } |
|
|
582 | } |
630 | } |
583 | |
631 | |
584 | tstamp now () |
632 | tstamp now () |
585 | { |
633 | { |
586 | struct timeval tv; |
634 | struct timeval tv; |
… | |
… | |
654 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
702 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
655 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
703 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
656 | 0x2d02ef8dL |
704 | 0x2d02ef8dL |
657 | }; |
705 | }; |
658 | |
706 | |
|
|
707 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
708 | { |
|
|
709 | pthread_attr_t attr; |
659 | |
710 | |
|
|
711 | pthread_attr_init (&attr); |
|
|
712 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
713 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
714 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
715 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
716 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
717 | #endif |
|
|
718 | |
|
|
719 | sigset_t fullsigset, oldsigset; |
|
|
720 | sigfillset (&fullsigset); |
|
|
721 | |
|
|
722 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
723 | |
|
|
724 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
725 | cleanup ("unable to create a new thread"); |
|
|
726 | |
|
|
727 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
728 | } |
|
|
729 | |