… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * 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 |
9 | * 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 |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License 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 |
18 | * 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/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* |
25 | /* |
… | |
… | |
32 | #include <time.h> |
33 | #include <time.h> |
33 | #include <signal.h> |
34 | #include <signal.h> |
34 | |
35 | |
35 | #include <global.h> |
36 | #include <global.h> |
36 | #include <material.h> |
37 | #include <material.h> |
|
|
38 | #include <object.h> |
|
|
39 | |
|
|
40 | #include <sys/time.h> |
|
|
41 | #include <sys/resource.h> |
37 | |
42 | |
38 | #include <glib.h> |
43 | #include <glib.h> |
39 | |
44 | |
40 | refcnt_base::refcnt_t refcnt_dummy; |
45 | refcnt_base::refcnt_t refcnt_dummy; |
41 | ssize_t slice_alloc; |
46 | ssize_t slice_alloc; |
… | |
… | |
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] < 128U) 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 |
… | |
… | |
197 | } |
207 | } |
198 | |
208 | |
199 | /* convert materialname to materialtype_t */ |
209 | /* convert materialname to materialtype_t */ |
200 | |
210 | |
201 | materialtype_t * |
211 | materialtype_t * |
202 | name_to_material (const shstr &name) |
212 | name_to_material (const shstr_cmp name) |
203 | { |
213 | { |
204 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
214 | for (materialtype_t *mt = materialt; mt; mt = mt->next) |
205 | if (name == mt->name) |
215 | if (name == mt->name) |
206 | return mt; |
216 | return mt; |
207 | |
217 | |
208 | return 0; |
218 | return 0; |
209 | } |
219 | } |
… | |
… | |
215 | transmute_materialname (object *op, const object *change) |
225 | transmute_materialname (object *op, const object *change) |
216 | { |
226 | { |
217 | materialtype_t *mt; |
227 | materialtype_t *mt; |
218 | int j; |
228 | int j; |
219 | |
229 | |
220 | if (op->materialname == NULL) |
230 | if (!op->materialname) |
221 | return; |
231 | return; |
222 | |
232 | |
223 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
233 | if (op->materialname != change->materialname) |
224 | return; |
234 | return; |
225 | |
235 | |
226 | if (!op->is_armor ()) |
236 | if (!op->is_armor ()) |
227 | return; |
237 | return; |
228 | |
238 | |
… | |
… | |
248 | void |
258 | void |
249 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
259 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
250 | { |
260 | { |
251 | materialtype_t *mt, *lmt; |
261 | materialtype_t *mt, *lmt; |
252 | |
262 | |
253 | if (op->materialname != NULL) |
263 | if (!op->materialname) |
254 | return; |
264 | return; |
255 | |
265 | |
256 | if (nmt == NULL) |
266 | if (nmt) |
|
|
267 | lmt = nmt; |
|
|
268 | else |
257 | { |
269 | { |
258 | lmt = NULL; |
270 | lmt = 0; |
259 | |
271 | |
260 | for (mt = materialt; mt && mt->next; mt = mt->next) |
272 | for (mt = materialt; mt; mt = mt->next) |
261 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
273 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
262 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
274 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
263 | { |
275 | { |
264 | lmt = mt; |
276 | lmt = mt; |
265 | if (!(op->is_weapon () || op->is_armor ())) |
277 | if (!(op->is_weapon () || op->is_armor ())) |
266 | break; |
278 | break; |
267 | } |
279 | } |
268 | } |
280 | } |
269 | else |
|
|
270 | lmt = nmt; |
|
|
271 | |
281 | |
272 | if (lmt != NULL) |
282 | if (lmt) |
273 | { |
283 | { |
274 | if (op->stats.dam && op->is_weapon ()) |
284 | if (op->stats.dam && op->is_weapon ()) |
275 | { |
285 | { |
276 | op->stats.dam += lmt->damage; |
286 | op->stats.dam += lmt->damage; |
277 | if (op->stats.dam < 1) |
287 | if (op->stats.dam < 1) |
… | |
… | |
439 | strcpy (input, tmp); |
449 | strcpy (input, tmp); |
440 | |
450 | |
441 | return; |
451 | return; |
442 | } |
452 | } |
443 | |
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 | |
444 | ///////////////////////////////////////////////////////////////////////////// |
476 | ///////////////////////////////////////////////////////////////////////////// |
445 | |
477 | |
446 | void |
478 | void |
447 | fork_abort (const char *msg) |
479 | fork_abort (const char *msg) |
448 | { |
480 | { |
449 | if (!fork ()) |
481 | if (!fork ()) |
450 | { |
482 | { |
|
|
483 | signal (SIGINT , SIG_IGN); |
|
|
484 | signal (SIGTERM, SIG_IGN); |
451 | 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 | |
452 | // try to put corefiles into a subdirectory, if existing, to allow |
492 | // try to put corefiles into a subdirectory, if existing, to allow |
453 | // an administrator to reduce the I/O load. |
493 | // an administrator to reduce the I/O load. |
454 | 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); |
455 | abort (); |
516 | abort (); |
456 | } |
517 | } |
457 | |
518 | |
458 | LOG (llevError, "fork abort: %s\n", msg); |
519 | LOG (llevError, "fork abort: %s\n", msg); |
459 | } |
520 | } |
… | |
… | |
522 | |
583 | |
523 | #endif |
584 | #endif |
524 | |
585 | |
525 | /******************************************************************************/ |
586 | /******************************************************************************/ |
526 | |
587 | |
|
|
588 | int |
527 | void assign (char *dst, const char *src, int maxlen) |
589 | assign (char *dst, const char *src, int maxsize) |
528 | { |
590 | { |
529 | if (!src) |
591 | if (!src) |
530 | src = ""; |
592 | src = ""; |
531 | |
593 | |
532 | int len = strlen (src); |
594 | int len = strlen (src); |
533 | |
595 | |
534 | if (len >= maxlen - 1) |
596 | if (len >= maxsize) |
535 | { |
597 | { |
536 | if (maxlen <= 4) |
598 | if (maxsize <= 4) |
537 | { |
599 | { |
538 | memset (dst, '.', maxlen - 1); |
600 | memset (dst, '.', maxsize - 2); |
539 | dst [maxlen - 1] = 0; |
601 | dst [maxsize - 1] = 0; |
540 | } |
602 | } |
541 | else |
603 | else |
542 | { |
604 | { |
543 | memcpy (dst, src, maxlen - 4); |
605 | memcpy (dst, src, maxsize - 4); |
544 | memcpy (dst + maxlen - 4, "...", 4); |
606 | memcpy (dst + maxsize - 4, "...", 4); |
545 | } |
607 | } |
|
|
608 | |
|
|
609 | len = maxsize; |
546 | } |
610 | } |
547 | else |
611 | else |
548 | memcpy (dst, src, len + 1); |
612 | memcpy (dst, src, ++len); |
|
|
613 | |
|
|
614 | return len; |
549 | } |
615 | } |
550 | |
616 | |
551 | const char * |
617 | const char * |
552 | format (const char *format, ...) |
618 | format (const char *format, ...) |
553 | { |
619 | { |