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,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
5 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * 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 |
7 | * 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) |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * any later version. |
9 | * option) any later version. |
12 | * |
10 | * |
13 | * This program is distributed in the hope that it will be useful, but |
11 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * for more details. |
14 | * GNU General Public License for more details. |
17 | * |
15 | * |
18 | * You should have received a copy of the GNU General Public License along |
16 | * 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 |
17 | * and the GNU General Public License along with this program. If not, see |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
18 | * <http://www.gnu.org/licenses/>. |
21 | * |
19 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
21 | */ |
24 | |
22 | |
25 | /* |
23 | /* |
26 | * General convenience functions for crossfire. |
24 | * General convenience functions for deliantra. |
27 | */ |
25 | */ |
28 | |
26 | |
29 | #include <cstdlib> |
27 | #include <cstdlib> |
30 | #include <sys/types.h> |
28 | #include <sys/types.h> |
31 | #include <unistd.h> |
29 | #include <unistd.h> |
32 | #include <sys/time.h> |
30 | #include <sys/time.h> |
33 | #include <time.h> |
31 | #include <time.h> |
34 | #include <signal.h> |
32 | #include <signal.h> |
35 | |
33 | |
36 | #include <global.h> |
34 | #include <global.h> |
37 | #include <funcpoint.h> |
|
|
38 | #include <material.h> |
35 | #include <material.h> |
|
|
36 | #include <object.h> |
|
|
37 | |
|
|
38 | #include <sys/time.h> |
|
|
39 | #include <sys/resource.h> |
39 | |
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; |
|
|
46 | |
|
|
47 | #if !GCC_VERSION(3,4) |
|
|
48 | int least_significant_bit (uint32_t x) |
|
|
49 | { |
|
|
50 | x &= -x; // this isolates the lowest bit |
|
|
51 | |
|
|
52 | int r = 0; |
|
|
53 | |
|
|
54 | if (x & 0xaaaaaaaa) r += 1; |
|
|
55 | if (x & 0xcccccccc) r += 2; |
|
|
56 | if (x & 0xf0f0f0f0) r += 4; |
|
|
57 | if (x & 0xff00ff00) r += 8; |
|
|
58 | if (x & 0xffff0000) r += 16; |
|
|
59 | |
|
|
60 | return r; |
|
|
61 | } |
|
|
62 | #endif |
43 | |
63 | |
44 | void |
64 | void |
45 | tausworthe_random_generator::seed (uint32_t seed) |
65 | tausworthe_random_generator::seed (uint32_t seed) |
46 | { |
66 | { |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
67 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
68 | 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; |
69 | 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; |
70 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
51 | |
71 | |
52 | for (int i = 11; --i; ) |
72 | for (int i = 11; --i; ) |
53 | operator ()(); |
73 | next (); |
54 | } |
74 | } |
55 | |
75 | |
56 | uint32_t |
76 | uint32_t |
57 | tausworthe_random_generator::next () |
77 | tausworthe_random_generator::next () |
58 | { |
78 | { |
… | |
… | |
62 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
82 | state [3] = ((state [3] & 0xFFFFFF80U) << 13U) ^ (((state [3] << 3U) ^ state [3]) >> 12U); |
63 | |
83 | |
64 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
84 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
65 | } |
85 | } |
66 | |
86 | |
|
|
87 | template<class generator> |
67 | uint32_t |
88 | uint32_t |
68 | tausworthe_random_generator::get_range (uint32_t num) |
89 | random_number_generator<generator>::get_range (uint32_t num) |
69 | { |
90 | { |
70 | return (next () * (uint64_t)num) >> 32U; |
91 | return (this->next () * (uint64_t)num) >> 32U; |
71 | } |
92 | } |
72 | |
93 | |
73 | // return a number within (min .. max) |
94 | // return a number within (min .. max) |
|
|
95 | template<class generator> |
74 | int |
96 | int |
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
97 | random_number_generator<generator>::get_range (int r_min, int r_max) |
76 | { |
98 | { |
77 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
99 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
78 | } |
100 | } |
79 | |
101 | |
80 | /* |
102 | template struct random_number_generator<tausworthe_random_generator>; |
81 | * The random functions here take luck into account when rolling random |
103 | template struct random_number_generator<xorshift_random_generator>; |
82 | * dice or numbers. This function has less of an impact the larger the |
104 | |
83 | * difference becomes in the random numbers. IE, the effect is lessened |
105 | /******************************************************************************/ |
84 | * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers, |
106 | |
85 | * to specifically disable luck in certain rolls, simply by making the |
107 | /* Checks a player-provided string which will become the msg property of |
86 | * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3) |
108 | * an object for dangerous input. |
87 | */ |
109 | */ |
88 | |
110 | bool |
89 | /* |
111 | msg_is_safe (const char *msg) |
90 | * Roll a random number between min and max. Uses op to determine luck, |
|
|
91 | * and if goodbad is non-zero, luck increases the roll, if zero, it decreases. |
|
|
92 | * Generally, op should be the player/caster/hitter requesting the roll, |
|
|
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
|
|
94 | */ |
|
|
95 | int |
|
|
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
|
|
97 | { |
112 | { |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
113 | bool safe = true; |
99 | |
114 | |
100 | if (r_max < r_min) |
115 | /* Trying to cheat by getting data into the object */ |
101 | { |
116 | if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1) |
102 | LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
117 | || strstr (msg, "\nendmsg")) |
103 | return r_min; |
118 | safe = false; |
104 | } |
|
|
105 | |
119 | |
106 | if (op->type == PLAYER) |
120 | /* Trying to make the object talk, and potentially access arbitrary code */ |
107 | { |
121 | if (object::msg_has_dialogue (msg)) |
108 | int luck = op->stats.luck; |
122 | safe = false; |
109 | |
123 | |
110 | if (rndm (base) < min (10, abs (luck))) |
|
|
111 | { |
|
|
112 | //TODO: take luck into account |
|
|
113 | } |
|
|
114 | } |
|
|
115 | |
|
|
116 | return rndm (r_min, r_max); |
|
|
117 | } |
|
|
118 | |
|
|
119 | /* |
|
|
120 | * This is a 64 bit version of random_roll above. This is needed |
|
|
121 | * for exp loss calculations for players changing religions. |
|
|
122 | */ |
|
|
123 | sint64 |
|
|
124 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
|
|
125 | { |
|
|
126 | sint64 omin = min; |
|
|
127 | sint64 diff = max - min + 1; |
|
|
128 | int base = diff > 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 | |
|
|
136 | /* |
|
|
137 | * Make a call to get two 32 bit unsigned random numbers, and just to |
|
|
138 | * a little bitshifting. |
|
|
139 | */ |
|
|
140 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
|
|
141 | |
|
|
142 | if (op->type != PLAYER) |
|
|
143 | return ((ran % diff) + min); |
|
|
144 | |
|
|
145 | int luck = op->stats.luck; |
|
|
146 | |
|
|
147 | if (rndm (base) < MIN (10, abs (luck))) |
|
|
148 | { |
|
|
149 | /* we have a winner */ |
|
|
150 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
|
|
151 | diff -= luck; |
|
|
152 | if (diff < 1) |
|
|
153 | return (omin); /*check again */ |
|
|
154 | |
|
|
155 | ((goodbad) ? (min += luck) : (diff)); |
|
|
156 | |
|
|
157 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
|
|
158 | } |
|
|
159 | |
|
|
160 | return ran % diff + min; |
|
|
161 | } |
|
|
162 | |
|
|
163 | /* |
|
|
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. |
|
|
166 | * Generally, op should be the player/caster/hitter requesting the roll, |
|
|
167 | * not the recipient (ie, the poor slob getting hit). |
|
|
168 | * The args are num D size (ie 4d6) [garbled 20010916] |
|
|
169 | */ |
|
|
170 | int |
|
|
171 | die_roll (int num, int size, const object *op, int goodbad) |
|
|
172 | { |
|
|
173 | int min, luck, total, i, gotlucky; |
|
|
174 | |
|
|
175 | int diff = size; |
|
|
176 | min = 1; |
|
|
177 | luck = total = gotlucky = 0; |
|
|
178 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
|
|
179 | |
|
|
180 | if (size < 2 || diff < 1) |
|
|
181 | { |
|
|
182 | LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); |
|
|
183 | return num; /* avoids a float exception */ |
|
|
184 | } |
|
|
185 | |
|
|
186 | if (op->type == PLAYER) |
|
|
187 | luck = op->stats.luck; |
|
|
188 | |
|
|
189 | for (i = 0; i < num; i++) |
|
|
190 | { |
|
|
191 | if (rndm (base) < MIN (10, abs (luck)) && !gotlucky) |
|
|
192 | { |
|
|
193 | /* we have a winner */ |
|
|
194 | gotlucky++; |
|
|
195 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
|
|
196 | diff -= luck; |
|
|
197 | if (diff < 1) |
|
|
198 | return (num); /*check again */ |
|
|
199 | ((goodbad) ? (min += luck) : (diff)); |
|
|
200 | total += MAX (1, MIN (size, rndm (diff) + min)); |
|
|
201 | } |
|
|
202 | else |
|
|
203 | total += rndm (size) + 1; |
|
|
204 | } |
|
|
205 | |
|
|
206 | return total; |
|
|
207 | } |
|
|
208 | |
|
|
209 | /* convert materialname to materialtype_t */ |
|
|
210 | |
|
|
211 | materialtype_t * |
|
|
212 | name_to_material (const shstr &name) |
|
|
213 | { |
|
|
214 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
|
|
215 | if (name == mt->name) |
|
|
216 | return mt; |
|
|
217 | |
|
|
218 | return materialt; |
|
|
219 | } |
|
|
220 | |
|
|
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
|
|
222 | * as some that did not apply previously, may apply now. |
|
|
223 | */ |
|
|
224 | |
|
|
225 | void |
|
|
226 | transmute_materialname (object *op, const object *change) |
|
|
227 | { |
|
|
228 | materialtype_t *mt; |
|
|
229 | int j; |
|
|
230 | |
|
|
231 | if (op->materialname == NULL) |
|
|
232 | return; |
|
|
233 | |
|
|
234 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
|
|
235 | return; |
|
|
236 | |
|
|
237 | if (!op->is_armor ()) |
|
|
238 | return; |
|
|
239 | |
|
|
240 | mt = name_to_material (op->materialname); |
|
|
241 | if (!mt) |
|
|
242 | { |
|
|
243 | LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname); |
|
|
244 | return; |
|
|
245 | } |
|
|
246 | |
|
|
247 | for (j = 0; j < NROFATTACKS; j++) |
|
|
248 | if (op->resist[j] == 0 && change->resist[j] != 0) |
|
|
249 | { |
|
|
250 | op->resist[j] += mt->mod[j]; |
|
|
251 | if (op->resist[j] > 100) |
|
|
252 | op->resist[j] = 100; |
|
|
253 | if (op->resist[j] < -100) |
|
|
254 | op->resist[j] = -100; |
|
|
255 | } |
|
|
256 | } |
|
|
257 | |
|
|
258 | /* set the materialname and type for an item */ |
|
|
259 | void |
|
|
260 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
|
|
261 | { |
|
|
262 | materialtype_t *mt, *lmt; |
|
|
263 | |
|
|
264 | #ifdef NEW_MATERIAL_CODE |
|
|
265 | int j; |
|
|
266 | #endif |
|
|
267 | |
|
|
268 | if (op->materialname != NULL) |
|
|
269 | return; |
|
|
270 | |
|
|
271 | |
|
|
272 | |
|
|
273 | if (nmt == NULL) |
|
|
274 | { |
|
|
275 | lmt = NULL; |
|
|
276 | #ifndef NEW_MATERIAL_CODE |
|
|
277 | for (mt = materialt; mt && mt->next; mt = mt->next) |
|
|
278 | { |
|
|
279 | if (op->materials & mt->material) |
|
|
280 | { |
|
|
281 | lmt = mt; |
|
|
282 | break; |
|
|
283 | } |
|
|
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 | { |
|
|
301 | lmt = nmt; |
|
|
302 | } |
|
|
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 ()) |
|
|
312 | { |
|
|
313 | op->stats.dam += lmt->damage; |
|
|
314 | if (op->stats.dam < 1) |
|
|
315 | op->stats.dam = 1; |
|
|
316 | } |
|
|
317 | |
|
|
318 | if (op->stats.sp && op->type == BOW) |
|
|
319 | op->stats.sp += lmt->sp; |
|
|
320 | if (op->stats.wc && op->is_weapon ()) |
|
|
321 | op->stats.wc += lmt->wc; |
|
|
322 | if (op->is_armor ()) |
|
|
323 | { |
|
|
324 | if (op->stats.ac) |
|
|
325 | op->stats.ac += lmt->ac; |
|
|
326 | for (j = 0; j < NROFATTACKS; j++) |
|
|
327 | if (op->resist[j] != 0) |
|
|
328 | { |
|
|
329 | op->resist[j] += lmt->mod[j]; |
|
|
330 | if (op->resist[j] > 100) |
|
|
331 | op->resist[j] = 100; |
|
|
332 | if (op->resist[j] < -100) |
|
|
333 | op->resist[j] = -100; |
|
|
334 | } |
|
|
335 | } |
|
|
336 | op->materialname = lmt->name; |
|
|
337 | /* dont make it unstackable if it doesn't need to be */ |
|
|
338 | if (op->is_weapon () || op->is_armor ()) |
|
|
339 | { |
|
|
340 | op->weight = (op->weight * lmt->weight) / 100; |
|
|
341 | op->value = (op->value * lmt->value) / 100; |
|
|
342 | } |
|
|
343 | #endif |
|
|
344 | } |
|
|
345 | } |
|
|
346 | |
|
|
347 | /* |
|
|
348 | * Strip out the media tags from a String. |
|
|
349 | * Warning the input string will contain the result string |
|
|
350 | */ |
|
|
351 | void |
|
|
352 | strip_media_tag (char *message) |
|
|
353 | { |
|
|
354 | int in_tag = 0; |
|
|
355 | char *dest; |
|
|
356 | char *src; |
|
|
357 | |
|
|
358 | src = dest = message; |
|
|
359 | while (*src != '\0') |
|
|
360 | { |
|
|
361 | if (*src == '[') |
|
|
362 | { |
|
|
363 | in_tag = 1; |
|
|
364 | } |
|
|
365 | else if (in_tag && (*src == ']')) |
|
|
366 | in_tag = 0; |
|
|
367 | else if (!in_tag) |
|
|
368 | { |
|
|
369 | *dest = *src; |
|
|
370 | dest++; |
|
|
371 | } |
|
|
372 | src++; |
|
|
373 | } |
|
|
374 | *dest = '\0'; |
|
|
375 | } |
|
|
376 | |
|
|
377 | const char * |
|
|
378 | strrstr (const char *haystack, const char *needle) |
|
|
379 | { |
|
|
380 | const char *lastneedle; |
|
|
381 | |
|
|
382 | lastneedle = NULL; |
|
|
383 | while ((haystack = strstr (haystack, needle)) != NULL) |
|
|
384 | { |
|
|
385 | lastneedle = haystack; |
|
|
386 | haystack++; |
|
|
387 | } |
|
|
388 | return lastneedle; |
|
|
389 | |
|
|
390 | } |
|
|
391 | |
|
|
392 | #define EOL_SIZE (sizeof("\n")-1) |
|
|
393 | void |
|
|
394 | strip_endline (char *buf) |
|
|
395 | { |
|
|
396 | if (strlen (buf) < sizeof ("\n")) |
|
|
397 | { |
|
|
398 | return; |
|
|
399 | } |
|
|
400 | if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n")) |
|
|
401 | buf[strlen (buf) - EOL_SIZE] = '\0'; |
|
|
402 | } |
|
|
403 | |
|
|
404 | /** |
|
|
405 | * Replace in string src all occurrences of key by replacement. The resulting |
|
|
406 | * string is put into result; at most resultsize characters (including the |
|
|
407 | * terminating null character) will be written to result. |
|
|
408 | */ |
|
|
409 | void |
|
|
410 | replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize) |
|
|
411 | { |
|
|
412 | size_t resultlen; |
|
|
413 | size_t keylen; |
|
|
414 | |
|
|
415 | /* special case to prevent infinite loop if key==replacement=="" */ |
|
|
416 | if (strcmp (key, replacement) == 0) |
|
|
417 | { |
|
|
418 | snprintf (result, resultsize, "%s", src); |
|
|
419 | return; |
|
|
420 | } |
|
|
421 | |
|
|
422 | keylen = strlen (key); |
|
|
423 | |
|
|
424 | resultlen = 0; |
|
|
425 | while (*src != '\0' && resultlen + 1 < resultsize) |
|
|
426 | { |
|
|
427 | if (strncmp (src, key, keylen) == 0) |
|
|
428 | { |
|
|
429 | snprintf (result + resultlen, resultsize - resultlen, "%s", replacement); |
|
|
430 | resultlen += strlen (result + resultlen); |
|
|
431 | src += keylen; |
|
|
432 | } |
|
|
433 | else |
|
|
434 | { |
|
|
435 | result[resultlen++] = *src++; |
|
|
436 | } |
|
|
437 | } |
|
|
438 | result[resultlen] = '\0'; |
|
|
439 | } |
|
|
440 | |
|
|
441 | /** |
|
|
442 | * Taking a string as an argument, mutate it into a string that looks like a list. |
|
|
443 | * 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. |
|
|
445 | * This function will also strip all trailing non alphanumeric characters. |
|
|
446 | * It does not insert an oxford comma. |
|
|
447 | */ |
|
|
448 | |
|
|
449 | void |
|
|
450 | make_list_like (char *input) |
|
|
451 | { |
|
|
452 | char *p, tmp[MAX_BUF]; |
|
|
453 | int i; |
|
|
454 | |
|
|
455 | if (!input || strlen (input) > MAX_BUF - 5) |
|
|
456 | return; |
|
|
457 | /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ |
|
|
458 | |
|
|
459 | strncpy (tmp, input, MAX_BUF - 5); |
|
|
460 | /*trim all trailing commas, spaces etc. */ |
|
|
461 | for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) |
|
|
462 | tmp[i] = '\0'; |
|
|
463 | |
|
|
464 | strcat (tmp, "."); |
|
|
465 | |
|
|
466 | p = strrchr (tmp, ','); |
|
|
467 | if (p) |
|
|
468 | { |
|
|
469 | *p = '\0'; |
|
|
470 | strcpy (input, tmp); |
|
|
471 | p++; |
|
|
472 | strcat (input, " and"); |
|
|
473 | strcat (input, p); |
|
|
474 | } |
|
|
475 | else |
|
|
476 | strcpy (input, tmp); |
|
|
477 | |
|
|
478 | return; |
124 | return safe; |
479 | } |
125 | } |
480 | |
126 | |
481 | ///////////////////////////////////////////////////////////////////////////// |
127 | ///////////////////////////////////////////////////////////////////////////// |
482 | |
128 | |
483 | void |
129 | void |
484 | fork_abort (const char *msg) |
130 | fork_abort (const char *msg) |
485 | { |
131 | { |
486 | if (!fork ()) |
132 | if (!fork ()) |
487 | { |
133 | { |
|
|
134 | signal (SIGINT , SIG_IGN); |
|
|
135 | signal (SIGTERM, SIG_IGN); |
488 | signal (SIGABRT, SIG_DFL); |
136 | signal (SIGABRT, SIG_IGN); |
|
|
137 | |
|
|
138 | signal (SIGSEGV, SIG_DFL); |
|
|
139 | signal (SIGBUS , SIG_DFL); |
|
|
140 | signal (SIGILL , SIG_DFL); |
|
|
141 | signal (SIGTRAP, SIG_DFL); |
|
|
142 | |
489 | // try to put corefiles into a subdirectory, if existing, to allow |
143 | // try to put corefiles into a subdirectory, if existing, to allow |
490 | // an administrator to reduce the I/O load. |
144 | // an administrator to reduce the I/O load. |
491 | chdir ("cores"); |
145 | chdir ("cores"); |
|
|
146 | |
|
|
147 | // try to detach us from as many external dependencies as possible |
|
|
148 | // as coredumping can take time by closing all fd's. |
|
|
149 | { |
|
|
150 | struct rlimit lim; |
|
|
151 | |
|
|
152 | if (getrlimit (RLIMIT_NOFILE, &lim)) |
|
|
153 | lim.rlim_cur = 1024; |
|
|
154 | |
|
|
155 | for (int i = 0; i < lim.rlim_cur; ++i) |
|
|
156 | close (i); |
|
|
157 | } |
|
|
158 | |
|
|
159 | { |
|
|
160 | sigset_t empty; |
|
|
161 | sigemptyset (&empty); |
|
|
162 | sigprocmask (SIG_SETMASK, &empty, 0); |
|
|
163 | } |
|
|
164 | |
|
|
165 | // try to coredump with SIGTRAP |
|
|
166 | kill (getpid (), SIGTRAP); |
492 | abort (); |
167 | abort (); |
493 | } |
168 | } |
494 | |
169 | |
495 | LOG (llevError, "fork abort: %s\n", msg); |
170 | LOG (llevError, "fork abort: %s\n", msg); |
496 | } |
171 | } |
497 | |
172 | |
498 | void *salloc_ (int n) throw (std::bad_alloc) |
173 | void *salloc_ (int n) throw (std::bad_alloc) |
499 | { |
174 | { |
500 | #ifdef PREFER_MALLOC |
|
|
501 | void *ptr = malloc (n); |
|
|
502 | #else |
|
|
503 | void *ptr = g_slice_alloc (n); |
175 | void *ptr = g_slice_alloc (n); |
504 | #endif |
|
|
505 | |
176 | |
506 | if (!ptr) |
177 | if (!ptr) |
507 | throw std::bad_alloc (); |
178 | throw std::bad_alloc (); |
508 | |
179 | |
|
|
180 | slice_alloc += n; |
509 | return ptr; |
181 | return ptr; |
510 | } |
182 | } |
511 | |
183 | |
512 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
184 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
513 | { |
185 | { |
… | |
… | |
519 | memset (ptr, 0, n); |
191 | memset (ptr, 0, n); |
520 | |
192 | |
521 | return ptr; |
193 | return ptr; |
522 | } |
194 | } |
523 | |
195 | |
|
|
196 | /******************************************************************************/ |
|
|
197 | |
|
|
198 | #if DEBUG_SALLOC |
|
|
199 | |
|
|
200 | #define MAGIC 0xa1b2c35543deadLL |
|
|
201 | |
|
|
202 | void *g_slice_alloc (unsigned long size) |
|
|
203 | { |
|
|
204 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
|
|
205 | *p++ = size ^ MAGIC; |
|
|
206 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
|
|
207 | return (void *)p; |
|
|
208 | } |
|
|
209 | |
|
|
210 | void *g_slice_alloc0 (unsigned long size) |
|
|
211 | { |
|
|
212 | return memset (g_slice_alloc (size), 0, size); |
|
|
213 | } |
|
|
214 | |
|
|
215 | void g_slice_free1 (unsigned long size, void *ptr) |
|
|
216 | { |
|
|
217 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
218 | if (expect_true (ptr)) |
|
|
219 | { |
|
|
220 | unsigned long *p = (unsigned long *)ptr; |
|
|
221 | unsigned long s = *--p ^ MAGIC; |
|
|
222 | |
|
|
223 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
224 | { |
|
|
225 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
226 | abort (); |
|
|
227 | } |
|
|
228 | |
|
|
229 | *p = MAGIC; |
|
|
230 | |
|
|
231 | (g_slice_free1)(s + sizeof (unsigned long), p); |
|
|
232 | } |
|
|
233 | } |
|
|
234 | |
|
|
235 | #endif |
|
|
236 | |
|
|
237 | /******************************************************************************/ |
|
|
238 | |
|
|
239 | int |
524 | void assign (char *dst, const char *src, int maxlen) |
240 | assign (char *dst, const char *src, int maxsize) |
525 | { |
241 | { |
526 | if (!src) |
242 | if (!src) |
527 | src = ""; |
243 | src = ""; |
528 | |
244 | |
529 | int len = strlen (src); |
245 | int len = strlen (src); |
530 | |
246 | |
531 | if (len >= maxlen - 1) |
247 | if (len >= maxsize) |
532 | { |
248 | { |
533 | if (maxlen <= 4) |
249 | if (maxsize <= 4) |
534 | { |
250 | { |
535 | memset (dst, '.', maxlen - 1); |
251 | memset (dst, '.', maxsize - 2); |
536 | dst [maxlen - 1] = 0; |
252 | dst [maxsize - 1] = 0; |
537 | } |
253 | } |
538 | else |
254 | else |
539 | { |
255 | { |
540 | memcpy (dst, src, maxlen - 4); |
256 | memcpy (dst, src, maxsize - 4); |
541 | memcpy (dst + maxlen - 4, "...", 4); |
257 | memcpy (dst + maxsize - 4, "...", 4); |
542 | } |
258 | } |
|
|
259 | |
|
|
260 | len = maxsize; |
543 | } |
261 | } |
544 | else |
262 | else |
545 | memcpy (dst, src, len + 1); |
263 | memcpy (dst, src, ++len); |
546 | } |
|
|
547 | |
264 | |
548 | const std::string |
265 | return len; |
|
|
266 | } |
|
|
267 | |
|
|
268 | char * |
|
|
269 | vformat (const char *format, va_list ap) |
|
|
270 | { |
|
|
271 | static dynbuf_text buf; buf.clear (); |
|
|
272 | buf.vprintf (format, ap); |
|
|
273 | return buf; |
|
|
274 | } |
|
|
275 | |
|
|
276 | char * |
549 | format (const char *format, ...) |
277 | format (const char *format, ...) |
550 | { |
278 | { |
551 | int len; |
|
|
552 | |
|
|
553 | { |
|
|
554 | char buf[128]; |
|
|
555 | |
|
|
556 | va_list ap; |
279 | va_list ap; |
557 | va_start (ap, format); |
280 | va_start (ap, format); |
558 | len = vsnprintf (buf, sizeof (buf), format, ap); |
281 | char *buf = vformat (format, ap); |
559 | va_end (ap); |
282 | va_end (ap); |
560 | |
283 | |
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; |
284 | return buf; |
581 | } |
|
|
582 | } |
285 | } |
583 | |
286 | |
584 | tstamp now () |
287 | tstamp now () |
585 | { |
288 | { |
586 | struct timeval tv; |
289 | struct timeval tv; |
… | |
… | |
654 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
357 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
655 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
358 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
656 | 0x2d02ef8dL |
359 | 0x2d02ef8dL |
657 | }; |
360 | }; |
658 | |
361 | |
|
|
362 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
363 | { |
|
|
364 | pthread_attr_t attr; |
659 | |
365 | |
|
|
366 | pthread_attr_init (&attr); |
|
|
367 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
368 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
369 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
370 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
371 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
372 | #endif |
|
|
373 | |
|
|
374 | sigset_t fullsigset, oldsigset; |
|
|
375 | sigfillset (&fullsigset); |
|
|
376 | |
|
|
377 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
378 | |
|
|
379 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
380 | cleanup ("unable to create a new thread"); |
|
|
381 | |
|
|
382 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
383 | } |
|
|
384 | |