| 1 | /* |
1 | /* |
| 2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
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 (©) 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 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
| 9 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
| 10 | * the Free Software Foundation, either version 3 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
| 11 | * (at your option) any later version. |
9 | * option) any later version. |
| 12 | * |
10 | * |
| 13 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
| 14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 16 | * GNU General Public License 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 |
16 | * You should have received a copy of the Affero GNU General Public License |
| 19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
| 20 | * |
19 | * |
| 21 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
| 22 | */ |
21 | */ |
| 23 | |
22 | |
| 24 | /* |
23 | /* |
| 25 | * General convenience functions for crossfire. |
24 | * General convenience functions for deliantra. |
| 26 | */ |
25 | */ |
| 27 | |
26 | |
| 28 | #include <cstdlib> |
27 | #include <cstdlib> |
| 29 | #include <sys/types.h> |
28 | #include <sys/types.h> |
| 30 | #include <unistd.h> |
29 | #include <unistd.h> |
| … | |
… | |
| 32 | #include <time.h> |
31 | #include <time.h> |
| 33 | #include <signal.h> |
32 | #include <signal.h> |
| 34 | |
33 | |
| 35 | #include <global.h> |
34 | #include <global.h> |
| 36 | #include <material.h> |
35 | #include <material.h> |
|
|
36 | #include <object.h> |
|
|
37 | |
|
|
38 | #include <sys/time.h> |
|
|
39 | #include <sys/resource.h> |
| 37 | |
40 | |
| 38 | #include <glib.h> |
41 | #include <glib.h> |
| 39 | |
42 | |
| 40 | refcnt_base::refcnt_t refcnt_dummy; |
43 | refcnt_base::refcnt_t refcnt_dummy; |
| 41 | ssize_t slice_alloc; |
44 | ssize_t slice_alloc; |
| 42 | rand_gen rndm; |
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] < 128U) 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 | } |
| 79 | |
84 | |
| 80 | /* |
85 | template struct random_number_generator<tausworthe_random_generator>; |
| 81 | * The random functions here take luck into account when rolling random |
86 | template struct random_number_generator<xorshift_random_generator>; |
| 82 | * dice or numbers. This function has less of an impact the larger the |
87 | |
| 83 | * difference becomes in the random numbers. IE, the effect is lessened |
88 | /******************************************************************************/ |
| 84 | * on a 1-1000 roll, vs a 1-6 roll. This can be used by crafty programmers, |
89 | |
| 85 | * to specifically disable luck in certain rolls, simply by making the |
90 | /* Checks a player-provided string which will become the msg property of |
| 86 | * numbers larger (ie, 1d1000 > 500 vs 1d6 > 3) |
91 | * an object for dangerous input. |
| 87 | */ |
92 | */ |
| 88 | |
93 | bool |
| 89 | /* |
94 | 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 | { |
95 | { |
| 98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
96 | bool safe = true; |
| 99 | |
97 | |
| 100 | if (r_max < r_min) |
98 | /* Trying to cheat by getting data into the object */ |
| 101 | { |
99 | if (!strncmp (msg, "endmsg", sizeof ("endmsg") - 1) |
| 102 | LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
100 | || strstr (msg, "\nendmsg")) |
| 103 | return r_min; |
101 | safe = false; |
| 104 | } |
|
|
| 105 | |
102 | |
| 106 | if (op->type == PLAYER) |
103 | /* Trying to make the object talk, and potentially access arbitrary code */ |
| 107 | { |
104 | if (object::msg_has_dialogue (msg)) |
| 108 | int luck = op->stats.luck; |
105 | safe = false; |
| 109 | |
106 | |
| 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 0; |
107 | return safe; |
| 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 | void |
|
|
| 225 | transmute_materialname (object *op, const object *change) |
|
|
| 226 | { |
|
|
| 227 | materialtype_t *mt; |
|
|
| 228 | int j; |
|
|
| 229 | |
|
|
| 230 | if (op->materialname == NULL) |
|
|
| 231 | return; |
|
|
| 232 | |
|
|
| 233 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
|
|
| 234 | return; |
|
|
| 235 | |
|
|
| 236 | if (!op->is_armor ()) |
|
|
| 237 | return; |
|
|
| 238 | |
|
|
| 239 | mt = name_to_material (op->materialname); |
|
|
| 240 | if (!mt) |
|
|
| 241 | { |
|
|
| 242 | LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname); |
|
|
| 243 | return; |
|
|
| 244 | } |
|
|
| 245 | |
|
|
| 246 | for (j = 0; j < NROFATTACKS; j++) |
|
|
| 247 | if (op->resist[j] == 0 && change->resist[j] != 0) |
|
|
| 248 | { |
|
|
| 249 | op->resist[j] += mt->mod[j]; |
|
|
| 250 | if (op->resist[j] > 100) |
|
|
| 251 | op->resist[j] = 100; |
|
|
| 252 | if (op->resist[j] < -100) |
|
|
| 253 | op->resist[j] = -100; |
|
|
| 254 | } |
|
|
| 255 | } |
|
|
| 256 | |
|
|
| 257 | /* set the materialname and type for an item */ |
|
|
| 258 | void |
|
|
| 259 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
|
|
| 260 | { |
|
|
| 261 | materialtype_t *mt, *lmt; |
|
|
| 262 | |
|
|
| 263 | if (op->materialname != NULL) |
|
|
| 264 | return; |
|
|
| 265 | |
|
|
| 266 | if (nmt == NULL) |
|
|
| 267 | { |
|
|
| 268 | lmt = NULL; |
|
|
| 269 | |
|
|
| 270 | for (mt = materialt; mt && mt->next; mt = mt->next) |
|
|
| 271 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
|
|
| 272 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
|
|
| 273 | { |
|
|
| 274 | lmt = mt; |
|
|
| 275 | if (!(op->is_weapon () || op->is_armor ())) |
|
|
| 276 | break; |
|
|
| 277 | } |
|
|
| 278 | } |
|
|
| 279 | else |
|
|
| 280 | lmt = nmt; |
|
|
| 281 | |
|
|
| 282 | if (lmt != NULL) |
|
|
| 283 | { |
|
|
| 284 | if (op->stats.dam && op->is_weapon ()) |
|
|
| 285 | { |
|
|
| 286 | op->stats.dam += lmt->damage; |
|
|
| 287 | if (op->stats.dam < 1) |
|
|
| 288 | op->stats.dam = 1; |
|
|
| 289 | } |
|
|
| 290 | |
|
|
| 291 | if (op->stats.sp && op->type == BOW) |
|
|
| 292 | op->stats.sp += lmt->sp; |
|
|
| 293 | if (op->stats.wc && op->is_weapon ()) |
|
|
| 294 | op->stats.wc += lmt->wc; |
|
|
| 295 | if (op->is_armor ()) |
|
|
| 296 | { |
|
|
| 297 | if (op->stats.ac) |
|
|
| 298 | op->stats.ac += lmt->ac; |
|
|
| 299 | |
|
|
| 300 | for (int j = 0; j < NROFATTACKS; j++) |
|
|
| 301 | if (op->resist[j] != 0) |
|
|
| 302 | { |
|
|
| 303 | op->resist[j] += lmt->mod[j]; |
|
|
| 304 | if (op->resist[j] > 100) |
|
|
| 305 | op->resist[j] = 100; |
|
|
| 306 | if (op->resist[j] < -100) |
|
|
| 307 | op->resist[j] = -100; |
|
|
| 308 | } |
|
|
| 309 | } |
|
|
| 310 | |
|
|
| 311 | op->materialname = lmt->name; |
|
|
| 312 | /* dont make it unstackable if it doesn't need to be */ |
|
|
| 313 | if (op->is_weapon () || op->is_armor ()) |
|
|
| 314 | { |
|
|
| 315 | op->weight = (op->weight * lmt->weight) / 100; |
|
|
| 316 | op->value = (op->value * lmt->value) / 100; |
|
|
| 317 | } |
|
|
| 318 | } |
|
|
| 319 | } |
|
|
| 320 | |
|
|
| 321 | /* |
|
|
| 322 | * Strip out the media tags from a String. |
|
|
| 323 | * Warning the input string will contain the result string |
|
|
| 324 | */ |
|
|
| 325 | void |
|
|
| 326 | strip_media_tag (char *message) |
|
|
| 327 | { |
|
|
| 328 | int in_tag = 0; |
|
|
| 329 | char *dest; |
|
|
| 330 | char *src; |
|
|
| 331 | |
|
|
| 332 | src = dest = message; |
|
|
| 333 | while (*src != '\0') |
|
|
| 334 | { |
|
|
| 335 | if (*src == '[') |
|
|
| 336 | { |
|
|
| 337 | in_tag = 1; |
|
|
| 338 | } |
|
|
| 339 | else if (in_tag && (*src == ']')) |
|
|
| 340 | in_tag = 0; |
|
|
| 341 | else if (!in_tag) |
|
|
| 342 | { |
|
|
| 343 | *dest = *src; |
|
|
| 344 | dest++; |
|
|
| 345 | } |
|
|
| 346 | src++; |
|
|
| 347 | } |
|
|
| 348 | *dest = '\0'; |
|
|
| 349 | } |
|
|
| 350 | |
|
|
| 351 | const char * |
|
|
| 352 | strrstr (const char *haystack, const char *needle) |
|
|
| 353 | { |
|
|
| 354 | const char *lastneedle; |
|
|
| 355 | |
|
|
| 356 | lastneedle = NULL; |
|
|
| 357 | while ((haystack = strstr (haystack, needle)) != NULL) |
|
|
| 358 | { |
|
|
| 359 | lastneedle = haystack; |
|
|
| 360 | haystack++; |
|
|
| 361 | } |
|
|
| 362 | return lastneedle; |
|
|
| 363 | |
|
|
| 364 | } |
|
|
| 365 | |
|
|
| 366 | #define EOL_SIZE (sizeof("\n")-1) |
|
|
| 367 | void |
|
|
| 368 | strip_endline (char *buf) |
|
|
| 369 | { |
|
|
| 370 | if (strlen (buf) < sizeof ("\n")) |
|
|
| 371 | { |
|
|
| 372 | return; |
|
|
| 373 | } |
|
|
| 374 | if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n")) |
|
|
| 375 | buf[strlen (buf) - EOL_SIZE] = '\0'; |
|
|
| 376 | } |
|
|
| 377 | |
|
|
| 378 | /** |
|
|
| 379 | * Replace in string src all occurrences of key by replacement. The resulting |
|
|
| 380 | * string is put into result; at most resultsize characters (including the |
|
|
| 381 | * terminating null character) will be written to result. |
|
|
| 382 | */ |
|
|
| 383 | void |
|
|
| 384 | replace (const char *src, const char *key, const char *replacement, char *result, size_t resultsize) |
|
|
| 385 | { |
|
|
| 386 | size_t resultlen; |
|
|
| 387 | size_t keylen; |
|
|
| 388 | |
|
|
| 389 | /* special case to prevent infinite loop if key==replacement=="" */ |
|
|
| 390 | if (strcmp (key, replacement) == 0) |
|
|
| 391 | { |
|
|
| 392 | snprintf (result, resultsize, "%s", src); |
|
|
| 393 | return; |
|
|
| 394 | } |
|
|
| 395 | |
|
|
| 396 | keylen = strlen (key); |
|
|
| 397 | |
|
|
| 398 | resultlen = 0; |
|
|
| 399 | while (*src != '\0' && resultlen + 1 < resultsize) |
|
|
| 400 | { |
|
|
| 401 | if (strncmp (src, key, keylen) == 0) |
|
|
| 402 | { |
|
|
| 403 | snprintf (result + resultlen, resultsize - resultlen, "%s", replacement); |
|
|
| 404 | resultlen += strlen (result + resultlen); |
|
|
| 405 | src += keylen; |
|
|
| 406 | } |
|
|
| 407 | else |
|
|
| 408 | { |
|
|
| 409 | result[resultlen++] = *src++; |
|
|
| 410 | } |
|
|
| 411 | } |
|
|
| 412 | result[resultlen] = '\0'; |
|
|
| 413 | } |
|
|
| 414 | |
|
|
| 415 | /** |
|
|
| 416 | * Taking a string as an argument, mutate it into a string that looks like a list. |
|
|
| 417 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
|
|
| 418 | * for the last entry, which has an 'and' before it, and a full stop (period) after it. |
|
|
| 419 | * This function will also strip all trailing non alphanumeric characters. |
|
|
| 420 | * It does not insert an oxford comma. |
|
|
| 421 | */ |
|
|
| 422 | void |
|
|
| 423 | make_list_like (char *input) |
|
|
| 424 | { |
|
|
| 425 | char *p, tmp[MAX_BUF]; |
|
|
| 426 | int i; |
|
|
| 427 | |
|
|
| 428 | if (!input || strlen (input) > MAX_BUF - 5) |
|
|
| 429 | return; |
|
|
| 430 | /* bad stuff would happen if we continued here, the -5 is to make space for ' and ' */ |
|
|
| 431 | |
|
|
| 432 | strncpy (tmp, input, MAX_BUF - 5); |
|
|
| 433 | /*trim all trailing commas, spaces etc. */ |
|
|
| 434 | for (i = strlen (tmp); !isalnum (tmp[i]) && i >= 0; i--) |
|
|
| 435 | tmp[i] = '\0'; |
|
|
| 436 | |
|
|
| 437 | strcat (tmp, "."); |
|
|
| 438 | |
|
|
| 439 | p = strrchr (tmp, ','); |
|
|
| 440 | if (p) |
|
|
| 441 | { |
|
|
| 442 | *p = '\0'; |
|
|
| 443 | strcpy (input, tmp); |
|
|
| 444 | p++; |
|
|
| 445 | strcat (input, " and"); |
|
|
| 446 | strcat (input, p); |
|
|
| 447 | } |
|
|
| 448 | else |
|
|
| 449 | strcpy (input, tmp); |
|
|
| 450 | |
|
|
| 451 | return; |
|
|
| 452 | } |
108 | } |
| 453 | |
109 | |
| 454 | ///////////////////////////////////////////////////////////////////////////// |
110 | ///////////////////////////////////////////////////////////////////////////// |
| 455 | |
111 | |
| 456 | void |
112 | void |
| 457 | fork_abort (const char *msg) |
113 | fork_abort (const char *msg) |
| 458 | { |
114 | { |
| 459 | if (!fork ()) |
115 | if (!fork ()) |
| 460 | { |
116 | { |
|
|
117 | signal (SIGINT , SIG_IGN); |
|
|
118 | signal (SIGTERM, SIG_IGN); |
| 461 | signal (SIGABRT, SIG_DFL); |
119 | signal (SIGABRT, SIG_IGN); |
|
|
120 | |
|
|
121 | signal (SIGSEGV, SIG_DFL); |
|
|
122 | signal (SIGBUS , SIG_DFL); |
|
|
123 | signal (SIGILL , SIG_DFL); |
|
|
124 | signal (SIGTRAP, SIG_DFL); |
|
|
125 | |
| 462 | // try to put corefiles into a subdirectory, if existing, to allow |
126 | // try to put corefiles into a subdirectory, if existing, to allow |
| 463 | // an administrator to reduce the I/O load. |
127 | // an administrator to reduce the I/O load. |
| 464 | chdir ("cores"); |
128 | chdir ("cores"); |
|
|
129 | |
|
|
130 | // try to detach us from as many external dependencies as possible |
|
|
131 | // as coredumping can take time by closing all fd's. |
|
|
132 | { |
|
|
133 | struct rlimit lim; |
|
|
134 | |
|
|
135 | if (getrlimit (RLIMIT_NOFILE, &lim)) |
|
|
136 | lim.rlim_cur = 1024; |
|
|
137 | |
|
|
138 | for (int i = 0; i < lim.rlim_cur; ++i) |
|
|
139 | close (i); |
|
|
140 | } |
|
|
141 | |
|
|
142 | { |
|
|
143 | sigset_t empty; |
|
|
144 | sigemptyset (&empty); |
|
|
145 | sigprocmask (SIG_SETMASK, &empty, 0); |
|
|
146 | } |
|
|
147 | |
|
|
148 | // try to coredump with SIGTRAP |
|
|
149 | kill (getpid (), SIGTRAP); |
| 465 | abort (); |
150 | abort (); |
| 466 | } |
151 | } |
| 467 | |
152 | |
| 468 | LOG (llevError, "fork abort: %s\n", msg); |
153 | LOG (llevError, "fork abort: %s\n", msg); |
| 469 | } |
154 | } |
| … | |
… | |
| 532 | |
217 | |
| 533 | #endif |
218 | #endif |
| 534 | |
219 | |
| 535 | /******************************************************************************/ |
220 | /******************************************************************************/ |
| 536 | |
221 | |
|
|
222 | int |
| 537 | void assign (char *dst, const char *src, int maxlen) |
223 | assign (char *dst, const char *src, int maxsize) |
| 538 | { |
224 | { |
| 539 | if (!src) |
225 | if (!src) |
| 540 | src = ""; |
226 | src = ""; |
| 541 | |
227 | |
| 542 | int len = strlen (src); |
228 | int len = strlen (src); |
| 543 | |
229 | |
| 544 | if (len >= maxlen - 1) |
230 | if (len >= maxsize) |
| 545 | { |
231 | { |
| 546 | if (maxlen <= 4) |
232 | if (maxsize <= 4) |
| 547 | { |
233 | { |
| 548 | memset (dst, '.', maxlen - 1); |
234 | memset (dst, '.', maxsize - 2); |
| 549 | dst [maxlen - 1] = 0; |
235 | dst [maxsize - 1] = 0; |
| 550 | } |
236 | } |
| 551 | else |
237 | else |
| 552 | { |
238 | { |
| 553 | memcpy (dst, src, maxlen - 4); |
239 | memcpy (dst, src, maxsize - 4); |
| 554 | memcpy (dst + maxlen - 4, "...", 4); |
240 | memcpy (dst + maxsize - 4, "...", 4); |
| 555 | } |
241 | } |
|
|
242 | |
|
|
243 | len = maxsize; |
| 556 | } |
244 | } |
| 557 | else |
245 | else |
| 558 | memcpy (dst, src, len + 1); |
246 | memcpy (dst, src, ++len); |
| 559 | } |
|
|
| 560 | |
247 | |
| 561 | const char * |
248 | return len; |
|
|
249 | } |
|
|
250 | |
|
|
251 | char * |
|
|
252 | vformat (const char *format, va_list ap) |
|
|
253 | { |
|
|
254 | static dynbuf_text buf; buf.clear (); |
|
|
255 | buf.vprintf (format, ap); |
|
|
256 | return buf; |
|
|
257 | } |
|
|
258 | |
|
|
259 | char * |
| 562 | format (const char *format, ...) |
260 | format (const char *format, ...) |
| 563 | { |
261 | { |
| 564 | static dynbuf_text buf; |
|
|
| 565 | |
|
|
| 566 | buf.clear (); |
|
|
| 567 | |
|
|
| 568 | va_list ap; |
262 | va_list ap; |
| 569 | va_start (ap, format); |
263 | va_start (ap, format); |
| 570 | buf.vprintf (format, ap); |
264 | char *buf = vformat (format, ap); |
| 571 | va_end (ap); |
265 | va_end (ap); |
| 572 | |
266 | |
| 573 | return buf; |
267 | return buf; |
| 574 | } |
268 | } |
| 575 | |
269 | |
