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 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 |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
… | |
… | |
31 | #include <sys/time.h> |
31 | #include <sys/time.h> |
32 | #include <time.h> |
32 | #include <time.h> |
33 | #include <signal.h> |
33 | #include <signal.h> |
34 | |
34 | |
35 | #include <global.h> |
35 | #include <global.h> |
36 | #include <funcpoint.h> |
|
|
37 | #include <material.h> |
36 | #include <material.h> |
38 | |
37 | |
|
|
38 | #include <sys/time.h> |
|
|
39 | #include <sys/resource.h> |
|
|
40 | |
39 | #include <glib.h> |
41 | #include <glib.h> |
40 | |
42 | |
41 | refcnt_base::refcnt_t refcnt_dummy; |
43 | refcnt_base::refcnt_t refcnt_dummy; |
42 | size_t slice_alloc; |
44 | ssize_t slice_alloc; |
43 | rand_gen rndm; |
45 | rand_gen rndm, rmg_rndm; |
44 | |
46 | |
45 | void |
47 | void |
46 | tausworthe_random_generator::seed (uint32_t seed) |
48 | tausworthe_random_generator::seed (uint32_t seed) |
47 | { |
49 | { |
48 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
50 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
49 | 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; |
50 | 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; |
51 | 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; |
52 | |
54 | |
53 | for (int i = 11; --i; ) |
55 | for (int i = 11; --i; ) |
54 | operator ()(); |
56 | operator ()(); |
55 | } |
57 | } |
56 | |
58 | |
… | |
… | |
94 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
96 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
95 | */ |
97 | */ |
96 | int |
98 | int |
97 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
99 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
98 | { |
100 | { |
|
|
101 | r_max = max (r_min, r_max); |
|
|
102 | |
99 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
103 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
100 | |
|
|
101 | if (r_max < r_min) |
|
|
102 | { |
|
|
103 | LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
|
|
104 | return r_min; |
|
|
105 | } |
|
|
106 | |
104 | |
107 | if (op->type == PLAYER) |
105 | if (op->type == PLAYER) |
108 | { |
106 | { |
109 | int luck = op->stats.luck; |
107 | int luck = op->stats.luck; |
110 | |
108 | |
… | |
… | |
120 | /* |
118 | /* |
121 | * This is a 64 bit version of random_roll above. This is needed |
119 | * This is a 64 bit version of random_roll above. This is needed |
122 | * for exp loss calculations for players changing religions. |
120 | * for exp loss calculations for players changing religions. |
123 | */ |
121 | */ |
124 | sint64 |
122 | sint64 |
125 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
123 | random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad) |
126 | { |
124 | { |
127 | sint64 omin = min; |
125 | sint64 omin = r_min; |
128 | sint64 diff = max - min + 1; |
126 | sint64 range = max (0, r_max - r_min + 1); |
129 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
127 | int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
130 | |
|
|
131 | if (diff < 0) |
|
|
132 | { |
|
|
133 | LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
|
|
134 | return (min); /* avoids a float exception */ |
|
|
135 | } |
|
|
136 | |
128 | |
137 | /* |
129 | /* |
138 | * Make a call to get two 32 bit unsigned random numbers, and just to |
130 | * Make a call to get two 32 bit unsigned random numbers, and just to |
139 | * a little bitshifting. |
131 | * a little bitshifting. |
140 | */ |
132 | */ |
141 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
133 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
142 | |
134 | |
143 | if (op->type != PLAYER) |
135 | if (op->type != PLAYER) |
144 | return ((ran % diff) + min); |
136 | return ((ran % range) + r_min); |
145 | |
137 | |
146 | int luck = op->stats.luck; |
138 | int luck = op->stats.luck; |
147 | |
139 | |
148 | if (rndm (base) < MIN (10, abs (luck))) |
140 | if (rndm (base) < min (10, abs (luck))) |
149 | { |
141 | { |
150 | /* we have a winner */ |
142 | /* we have a winner */ |
151 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
143 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
152 | diff -= luck; |
144 | range -= luck; |
153 | if (diff < 1) |
145 | if (range < 1) |
154 | return (omin); /*check again */ |
146 | return (omin); /*check again */ |
155 | |
147 | |
156 | ((goodbad) ? (min += luck) : (diff)); |
148 | ((goodbad) ? (r_min += luck) : (range)); |
157 | |
149 | |
158 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
150 | return (max (omin, min (r_max, (ran % range) + r_min))); |
159 | } |
151 | } |
160 | |
152 | |
161 | return ran % diff + min; |
153 | return ran % range + r_min; |
162 | } |
154 | } |
163 | |
155 | |
164 | /* |
156 | /* |
165 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
157 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
166 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
158 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
… | |
… | |
208 | } |
200 | } |
209 | |
201 | |
210 | /* convert materialname to materialtype_t */ |
202 | /* convert materialname to materialtype_t */ |
211 | |
203 | |
212 | materialtype_t * |
204 | materialtype_t * |
213 | name_to_material (const shstr &name) |
205 | name_to_material (const shstr_cmp name) |
214 | { |
206 | { |
215 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
207 | for (materialtype_t *mt = materialt; mt; mt = mt->next) |
216 | if (name == mt->name) |
208 | if (name == mt->name) |
217 | return mt; |
209 | return mt; |
218 | |
210 | |
219 | return 0; |
211 | return 0; |
220 | } |
212 | } |
… | |
… | |
226 | transmute_materialname (object *op, const object *change) |
218 | transmute_materialname (object *op, const object *change) |
227 | { |
219 | { |
228 | materialtype_t *mt; |
220 | materialtype_t *mt; |
229 | int j; |
221 | int j; |
230 | |
222 | |
231 | if (op->materialname == NULL) |
223 | if (!op->materialname) |
232 | return; |
224 | return; |
233 | |
225 | |
234 | if (change->materialname != NULL && strcmp (op->materialname, change->materialname)) |
226 | if (change->materialname && strcmp (op->materialname, change->materialname)) |
235 | return; |
227 | return; |
236 | |
228 | |
237 | if (!op->is_armor ()) |
229 | if (!op->is_armor ()) |
238 | return; |
230 | return; |
239 | |
231 | |
… | |
… | |
259 | void |
251 | void |
260 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
252 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
261 | { |
253 | { |
262 | materialtype_t *mt, *lmt; |
254 | materialtype_t *mt, *lmt; |
263 | |
255 | |
264 | if (op->materialname != NULL) |
256 | if (!op->materialname) |
265 | return; |
257 | return; |
266 | |
258 | |
267 | if (nmt == NULL) |
259 | if (nmt) |
|
|
260 | lmt = nmt; |
|
|
261 | else |
268 | { |
262 | { |
269 | lmt = NULL; |
263 | lmt = 0; |
270 | |
264 | |
271 | for (mt = materialt; mt && mt->next; mt = mt->next) |
265 | for (mt = materialt; mt; mt = mt->next) |
272 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
266 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
273 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
267 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
274 | { |
268 | { |
275 | lmt = mt; |
269 | lmt = mt; |
276 | if (!(op->is_weapon () || op->is_armor ())) |
270 | if (!(op->is_weapon () || op->is_armor ())) |
277 | break; |
271 | break; |
278 | } |
272 | } |
279 | } |
273 | } |
280 | else |
|
|
281 | lmt = nmt; |
|
|
282 | |
274 | |
283 | if (lmt != NULL) |
275 | if (lmt) |
284 | { |
276 | { |
285 | if (op->stats.dam && op->is_weapon ()) |
277 | if (op->stats.dam && op->is_weapon ()) |
286 | { |
278 | { |
287 | op->stats.dam += lmt->damage; |
279 | op->stats.dam += lmt->damage; |
288 | if (op->stats.dam < 1) |
280 | if (op->stats.dam < 1) |
… | |
… | |
457 | void |
449 | void |
458 | fork_abort (const char *msg) |
450 | fork_abort (const char *msg) |
459 | { |
451 | { |
460 | if (!fork ()) |
452 | if (!fork ()) |
461 | { |
453 | { |
|
|
454 | signal (SIGINT , SIG_IGN); |
|
|
455 | signal (SIGTERM, SIG_IGN); |
462 | signal (SIGABRT, SIG_DFL); |
456 | signal (SIGABRT, SIG_IGN); |
|
|
457 | |
|
|
458 | signal (SIGSEGV, SIG_DFL); |
|
|
459 | signal (SIGBUS , SIG_DFL); |
|
|
460 | signal (SIGILL , SIG_DFL); |
|
|
461 | signal (SIGTRAP, SIG_DFL); |
|
|
462 | |
463 | // try to put corefiles into a subdirectory, if existing, to allow |
463 | // try to put corefiles into a subdirectory, if existing, to allow |
464 | // an administrator to reduce the I/O load. |
464 | // an administrator to reduce the I/O load. |
465 | chdir ("cores"); |
465 | chdir ("cores"); |
|
|
466 | |
|
|
467 | // try to detach us from as many external dependencies as possible |
|
|
468 | // as coredumping can take time by closing all fd's. |
|
|
469 | { |
|
|
470 | struct rlimit lim; |
|
|
471 | |
|
|
472 | if (getrlimit (RLIMIT_NOFILE, &lim)) |
|
|
473 | lim.rlim_cur = 1024; |
|
|
474 | |
|
|
475 | for (int i = 0; i < lim.rlim_cur; ++i) |
|
|
476 | close (i); |
|
|
477 | } |
|
|
478 | |
|
|
479 | { |
|
|
480 | sigset_t empty; |
|
|
481 | sigemptyset (&empty); |
|
|
482 | sigprocmask (SIG_SETMASK, &empty, 0); |
|
|
483 | } |
|
|
484 | |
|
|
485 | // try to coredump with SIGTRAP |
|
|
486 | kill (getpid (), SIGTRAP); |
466 | abort (); |
487 | abort (); |
467 | } |
488 | } |
468 | |
489 | |
469 | LOG (llevError, "fork abort: %s\n", msg); |
490 | LOG (llevError, "fork abort: %s\n", msg); |
470 | } |
491 | } |
471 | |
492 | |
472 | void *salloc_ (int n) throw (std::bad_alloc) |
493 | void *salloc_ (int n) throw (std::bad_alloc) |
473 | { |
494 | { |
474 | #if PREFER_MALLOC |
|
|
475 | void *ptr = malloc (n); |
|
|
476 | #else |
|
|
477 | slice_alloc += n; |
|
|
478 | void *ptr = g_slice_alloc (n); |
495 | void *ptr = g_slice_alloc (n); |
479 | #endif |
|
|
480 | |
496 | |
481 | if (!ptr) |
497 | if (!ptr) |
482 | throw std::bad_alloc (); |
498 | throw std::bad_alloc (); |
483 | |
499 | |
|
|
500 | slice_alloc += n; |
484 | return ptr; |
501 | return ptr; |
485 | } |
502 | } |
486 | |
503 | |
487 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
504 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
488 | { |
505 | { |
… | |
… | |
515 | return memset (g_slice_alloc (size), 0, size); |
532 | return memset (g_slice_alloc (size), 0, size); |
516 | } |
533 | } |
517 | |
534 | |
518 | void g_slice_free1 (unsigned long size, void *ptr) |
535 | void g_slice_free1 (unsigned long size, void *ptr) |
519 | { |
536 | { |
|
|
537 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
520 | if (expect_true (ptr)) |
538 | if (expect_true (ptr)) |
521 | { |
539 | { |
522 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
523 | unsigned long *p = (unsigned long *)ptr; |
540 | unsigned long *p = (unsigned long *)ptr; |
524 | unsigned long s = *--p ^ MAGIC; |
541 | unsigned long s = *--p ^ MAGIC; |
525 | |
542 | |
526 | if (size != (unsigned long)(*p ^ MAGIC)) |
543 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
544 | { |
527 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
545 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
546 | abort (); |
|
|
547 | } |
528 | |
548 | |
529 | *p = MAGIC; |
549 | *p = MAGIC; |
530 | |
550 | |
531 | (g_slice_free1)(s + sizeof (unsigned long), p); |
551 | (g_slice_free1)(s + sizeof (unsigned long), p); |
532 | } |
552 | } |
… | |
… | |
648 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
668 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
649 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
669 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
650 | 0x2d02ef8dL |
670 | 0x2d02ef8dL |
651 | }; |
671 | }; |
652 | |
672 | |
|
|
673 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
674 | { |
|
|
675 | pthread_attr_t attr; |
|
|
676 | |
|
|
677 | pthread_attr_init (&attr); |
|
|
678 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
679 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
680 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
681 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
682 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
683 | #endif |
|
|
684 | |
|
|
685 | sigset_t fullsigset, oldsigset; |
|
|
686 | sigfillset (&fullsigset); |
|
|
687 | |
|
|
688 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
689 | |
|
|
690 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
691 | cleanup ("unable to create a new thread"); |
|
|
692 | |
|
|
693 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
694 | } |
|
|
695 | |