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 |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * any later version. |
11 | * (at your 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 GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* |
24 | /* |
26 | * General convenience functions for crossfire. |
25 | * General convenience functions for crossfire. |
27 | */ |
26 | */ |
… | |
… | |
32 | #include <sys/time.h> |
31 | #include <sys/time.h> |
33 | #include <time.h> |
32 | #include <time.h> |
34 | #include <signal.h> |
33 | #include <signal.h> |
35 | |
34 | |
36 | #include <global.h> |
35 | #include <global.h> |
37 | #include <funcpoint.h> |
|
|
38 | #include <material.h> |
36 | #include <material.h> |
39 | |
37 | |
40 | #include <glib.h> |
38 | #include <glib.h> |
41 | |
39 | |
42 | rand_gen rndm; |
40 | refcnt_base::refcnt_t refcnt_dummy; |
|
|
41 | ssize_t slice_alloc; |
|
|
42 | rand_gen rndm, rmg_rndm; |
43 | |
43 | |
44 | void |
44 | void |
45 | tausworthe_random_generator::seed (uint32_t seed) |
45 | tausworthe_random_generator::seed (uint32_t seed) |
46 | { |
46 | { |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
48 | 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; |
49 | 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; |
50 | state [3] = state [2] * 69069U; if (state [0] < 128U) state [0] += 128U; |
51 | |
51 | |
52 | for (int i = 11; --i; ) |
52 | for (int i = 11; --i; ) |
53 | operator ()(); |
53 | operator ()(); |
54 | } |
54 | } |
55 | |
55 | |
… | |
… | |
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
93 | * not the recipient (ie, the poor slob getting hit). [garbled 20010916] |
94 | */ |
94 | */ |
95 | int |
95 | int |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
97 | { |
97 | { |
|
|
98 | r_max = max (r_min, r_max); |
|
|
99 | |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
100 | 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 | |
101 | |
106 | if (op->type == PLAYER) |
102 | if (op->type == PLAYER) |
107 | { |
103 | { |
108 | int luck = op->stats.luck; |
104 | int luck = op->stats.luck; |
109 | |
105 | |
… | |
… | |
119 | /* |
115 | /* |
120 | * This is a 64 bit version of random_roll above. This is needed |
116 | * This is a 64 bit version of random_roll above. This is needed |
121 | * for exp loss calculations for players changing religions. |
117 | * for exp loss calculations for players changing religions. |
122 | */ |
118 | */ |
123 | sint64 |
119 | sint64 |
124 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
120 | random_roll64 (sint64 r_min, sint64 r_max, const object *op, int goodbad) |
125 | { |
121 | { |
126 | sint64 omin = min; |
122 | sint64 omin = r_min; |
127 | sint64 diff = max - min + 1; |
123 | sint64 range = max (0, r_max - r_min + 1); |
128 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
124 | 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 | |
125 | |
136 | /* |
126 | /* |
137 | * Make a call to get two 32 bit unsigned random numbers, and just to |
127 | * Make a call to get two 32 bit unsigned random numbers, and just to |
138 | * a little bitshifting. |
128 | * a little bitshifting. |
139 | */ |
129 | */ |
140 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
130 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
141 | |
131 | |
142 | if (op->type != PLAYER) |
132 | if (op->type != PLAYER) |
143 | return ((ran % diff) + min); |
133 | return ((ran % range) + r_min); |
144 | |
134 | |
145 | int luck = op->stats.luck; |
135 | int luck = op->stats.luck; |
146 | |
136 | |
147 | if (rndm (base) < MIN (10, abs (luck))) |
137 | if (rndm (base) < min (10, abs (luck))) |
148 | { |
138 | { |
149 | /* we have a winner */ |
139 | /* we have a winner */ |
150 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
140 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
151 | diff -= luck; |
141 | range -= luck; |
152 | if (diff < 1) |
142 | if (range < 1) |
153 | return (omin); /*check again */ |
143 | return (omin); /*check again */ |
154 | |
144 | |
155 | ((goodbad) ? (min += luck) : (diff)); |
145 | ((goodbad) ? (r_min += luck) : (range)); |
156 | |
146 | |
157 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
147 | return (max (omin, min (r_max, (ran % range) + r_min))); |
158 | } |
148 | } |
159 | |
149 | |
160 | return ran % diff + min; |
150 | return ran % range + r_min; |
161 | } |
151 | } |
162 | |
152 | |
163 | /* |
153 | /* |
164 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
154 | * 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. |
155 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
… | |
… | |
213 | { |
203 | { |
214 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
204 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
215 | if (name == mt->name) |
205 | if (name == mt->name) |
216 | return mt; |
206 | return mt; |
217 | |
207 | |
218 | return materialt; |
208 | return 0; |
219 | } |
209 | } |
220 | |
210 | |
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
211 | /* when doing transmutation of objects, we have to recheck the resistances, |
222 | * as some that did not apply previously, may apply now. |
212 | * as some that did not apply previously, may apply now. |
223 | */ |
213 | */ |
224 | |
|
|
225 | void |
214 | void |
226 | transmute_materialname (object *op, const object *change) |
215 | transmute_materialname (object *op, const object *change) |
227 | { |
216 | { |
228 | materialtype_t *mt; |
217 | materialtype_t *mt; |
229 | int j; |
218 | int j; |
… | |
… | |
259 | void |
248 | void |
260 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
249 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
261 | { |
250 | { |
262 | materialtype_t *mt, *lmt; |
251 | materialtype_t *mt, *lmt; |
263 | |
252 | |
264 | #ifdef NEW_MATERIAL_CODE |
|
|
265 | int j; |
|
|
266 | #endif |
|
|
267 | |
|
|
268 | if (op->materialname != NULL) |
253 | if (op->materialname != NULL) |
269 | return; |
254 | return; |
270 | |
255 | |
271 | |
|
|
272 | |
|
|
273 | if (nmt == NULL) |
256 | if (nmt == NULL) |
274 | { |
257 | { |
275 | lmt = NULL; |
258 | lmt = NULL; |
276 | #ifndef NEW_MATERIAL_CODE |
259 | |
277 | for (mt = materialt; mt && mt->next; mt = mt->next) |
260 | for (mt = materialt; mt && mt->next; mt = mt->next) |
278 | { |
261 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
279 | if (op->materials & mt->material) |
262 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
280 | { |
263 | { |
281 | lmt = mt; |
264 | lmt = mt; |
|
|
265 | if (!(op->is_weapon () || op->is_armor ())) |
282 | break; |
266 | break; |
283 | } |
267 | } |
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 | } |
268 | } |
299 | else |
269 | else |
300 | { |
|
|
301 | lmt = nmt; |
270 | lmt = nmt; |
302 | } |
|
|
303 | |
271 | |
304 | if (lmt != NULL) |
272 | if (lmt != NULL) |
305 | { |
273 | { |
306 | #ifndef NEW_MATERIAL_CODE |
|
|
307 | op->materialname = lmt->name; |
|
|
308 | return; |
|
|
309 | #else |
|
|
310 | |
|
|
311 | if (op->stats.dam && op->is_weapon ()) |
274 | if (op->stats.dam && op->is_weapon ()) |
312 | { |
275 | { |
313 | op->stats.dam += lmt->damage; |
276 | op->stats.dam += lmt->damage; |
314 | if (op->stats.dam < 1) |
277 | if (op->stats.dam < 1) |
315 | op->stats.dam = 1; |
278 | op->stats.dam = 1; |
… | |
… | |
321 | op->stats.wc += lmt->wc; |
284 | op->stats.wc += lmt->wc; |
322 | if (op->is_armor ()) |
285 | if (op->is_armor ()) |
323 | { |
286 | { |
324 | if (op->stats.ac) |
287 | if (op->stats.ac) |
325 | op->stats.ac += lmt->ac; |
288 | op->stats.ac += lmt->ac; |
|
|
289 | |
326 | for (j = 0; j < NROFATTACKS; j++) |
290 | for (int j = 0; j < NROFATTACKS; j++) |
327 | if (op->resist[j] != 0) |
291 | if (op->resist[j] != 0) |
328 | { |
292 | { |
329 | op->resist[j] += lmt->mod[j]; |
293 | op->resist[j] += lmt->mod[j]; |
330 | if (op->resist[j] > 100) |
294 | if (op->resist[j] > 100) |
331 | op->resist[j] = 100; |
295 | op->resist[j] = 100; |
332 | if (op->resist[j] < -100) |
296 | if (op->resist[j] < -100) |
333 | op->resist[j] = -100; |
297 | op->resist[j] = -100; |
334 | } |
298 | } |
335 | } |
299 | } |
|
|
300 | |
336 | op->materialname = lmt->name; |
301 | op->materialname = lmt->name; |
337 | /* dont make it unstackable if it doesn't need to be */ |
302 | /* dont make it unstackable if it doesn't need to be */ |
338 | if (op->is_weapon () || op->is_armor ()) |
303 | if (op->is_weapon () || op->is_armor ()) |
339 | { |
304 | { |
340 | op->weight = (op->weight * lmt->weight) / 100; |
305 | op->weight = (op->weight * lmt->weight) / 100; |
341 | op->value = (op->value * lmt->value) / 100; |
306 | op->value = (op->value * lmt->value) / 100; |
342 | } |
307 | } |
343 | #endif |
|
|
344 | } |
308 | } |
345 | } |
309 | } |
346 | |
310 | |
347 | /* |
311 | /* |
348 | * Strip out the media tags from a String. |
312 | * Strip out the media tags from a String. |
… | |
… | |
443 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
407 | * 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. |
408 | * 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. |
409 | * This function will also strip all trailing non alphanumeric characters. |
446 | * It does not insert an oxford comma. |
410 | * It does not insert an oxford comma. |
447 | */ |
411 | */ |
448 | |
|
|
449 | void |
412 | void |
450 | make_list_like (char *input) |
413 | make_list_like (char *input) |
451 | { |
414 | { |
452 | char *p, tmp[MAX_BUF]; |
415 | char *p, tmp[MAX_BUF]; |
453 | int i; |
416 | int i; |
… | |
… | |
495 | LOG (llevError, "fork abort: %s\n", msg); |
458 | LOG (llevError, "fork abort: %s\n", msg); |
496 | } |
459 | } |
497 | |
460 | |
498 | void *salloc_ (int n) throw (std::bad_alloc) |
461 | void *salloc_ (int n) throw (std::bad_alloc) |
499 | { |
462 | { |
500 | #ifdef PREFER_MALLOC |
|
|
501 | void *ptr = malloc (n); |
|
|
502 | #else |
|
|
503 | void *ptr = g_slice_alloc (n); |
463 | void *ptr = g_slice_alloc (n); |
504 | #endif |
|
|
505 | |
464 | |
506 | if (!ptr) |
465 | if (!ptr) |
507 | throw std::bad_alloc (); |
466 | throw std::bad_alloc (); |
508 | |
467 | |
|
|
468 | slice_alloc += n; |
509 | return ptr; |
469 | return ptr; |
510 | } |
470 | } |
511 | |
471 | |
512 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
472 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
513 | { |
473 | { |
… | |
… | |
519 | memset (ptr, 0, n); |
479 | memset (ptr, 0, n); |
520 | |
480 | |
521 | return ptr; |
481 | return ptr; |
522 | } |
482 | } |
523 | |
483 | |
|
|
484 | /******************************************************************************/ |
|
|
485 | |
|
|
486 | #if DEBUG_SALLOC |
|
|
487 | |
|
|
488 | #define MAGIC 0xa1b2c35543deadLL |
|
|
489 | |
|
|
490 | void *g_slice_alloc (unsigned long size) |
|
|
491 | { |
|
|
492 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
|
|
493 | *p++ = size ^ MAGIC; |
|
|
494 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
|
|
495 | return (void *)p; |
|
|
496 | } |
|
|
497 | |
|
|
498 | void *g_slice_alloc0 (unsigned long size) |
|
|
499 | { |
|
|
500 | return memset (g_slice_alloc (size), 0, size); |
|
|
501 | } |
|
|
502 | |
|
|
503 | void g_slice_free1 (unsigned long size, void *ptr) |
|
|
504 | { |
|
|
505 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
506 | if (expect_true (ptr)) |
|
|
507 | { |
|
|
508 | unsigned long *p = (unsigned long *)ptr; |
|
|
509 | unsigned long s = *--p ^ MAGIC; |
|
|
510 | |
|
|
511 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
512 | { |
|
|
513 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
514 | abort (); |
|
|
515 | } |
|
|
516 | |
|
|
517 | *p = MAGIC; |
|
|
518 | |
|
|
519 | (g_slice_free1)(s + sizeof (unsigned long), p); |
|
|
520 | } |
|
|
521 | } |
|
|
522 | |
|
|
523 | #endif |
|
|
524 | |
|
|
525 | /******************************************************************************/ |
|
|
526 | |
524 | void assign (char *dst, const char *src, int maxlen) |
527 | void assign (char *dst, const char *src, int maxlen) |
525 | { |
528 | { |
526 | if (!src) |
529 | if (!src) |
527 | src = ""; |
530 | src = ""; |
528 | |
531 | |
… | |
… | |
543 | } |
546 | } |
544 | else |
547 | else |
545 | memcpy (dst, src, len + 1); |
548 | memcpy (dst, src, len + 1); |
546 | } |
549 | } |
547 | |
550 | |
548 | const std::string |
551 | const char * |
549 | format (const char *format, ...) |
552 | format (const char *format, ...) |
550 | { |
553 | { |
551 | int len; |
554 | static dynbuf_text buf; |
552 | |
555 | |
553 | { |
556 | buf.clear (); |
554 | char buf[128]; |
|
|
555 | |
557 | |
556 | va_list ap; |
558 | va_list ap; |
557 | va_start (ap, format); |
559 | va_start (ap, format); |
558 | len = vsnprintf (buf, sizeof (buf), format, ap); |
560 | buf.vprintf (format, ap); |
559 | va_end (ap); |
561 | va_end (ap); |
560 | |
562 | |
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; |
563 | return buf; |
581 | } |
|
|
582 | } |
564 | } |
583 | |
565 | |
584 | tstamp now () |
566 | tstamp now () |
585 | { |
567 | { |
586 | struct timeval tv; |
568 | struct timeval tv; |
… | |
… | |
654 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
636 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
655 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
637 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
656 | 0x2d02ef8dL |
638 | 0x2d02ef8dL |
657 | }; |
639 | }; |
658 | |
640 | |
|
|
641 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
642 | { |
|
|
643 | pthread_attr_t attr; |
659 | |
644 | |
|
|
645 | pthread_attr_init (&attr); |
|
|
646 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
647 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
648 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
649 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
650 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
651 | #endif |
|
|
652 | |
|
|
653 | sigset_t fullsigset, oldsigset; |
|
|
654 | sigfillset (&fullsigset); |
|
|
655 | |
|
|
656 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
657 | |
|
|
658 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
659 | cleanup ("unable to create a new thread"); |
|
|
660 | |
|
|
661 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
662 | } |
|
|
663 | |