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 | |
|
|
40 | refcnt_base::refcnt_t refcnt_dummy; |
|
|
41 | ssize_t slice_alloc; |
42 | rand_gen rndm; |
42 | rand_gen 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 | |
… | |
… | |
213 | { |
213 | { |
214 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
214 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
215 | if (name == mt->name) |
215 | if (name == mt->name) |
216 | return mt; |
216 | return mt; |
217 | |
217 | |
218 | return materialt; |
218 | return 0; |
219 | } |
219 | } |
220 | |
220 | |
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
222 | * as some that did not apply previously, may apply now. |
222 | * as some that did not apply previously, may apply now. |
223 | */ |
223 | */ |
224 | |
|
|
225 | void |
224 | void |
226 | transmute_materialname (object *op, const object *change) |
225 | transmute_materialname (object *op, const object *change) |
227 | { |
226 | { |
228 | materialtype_t *mt; |
227 | materialtype_t *mt; |
229 | int j; |
228 | int j; |
… | |
… | |
259 | void |
258 | void |
260 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
259 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
261 | { |
260 | { |
262 | materialtype_t *mt, *lmt; |
261 | materialtype_t *mt, *lmt; |
263 | |
262 | |
264 | #ifdef NEW_MATERIAL_CODE |
|
|
265 | int j; |
|
|
266 | #endif |
|
|
267 | |
|
|
268 | if (op->materialname != NULL) |
263 | if (op->materialname != NULL) |
269 | return; |
264 | return; |
270 | |
265 | |
271 | |
|
|
272 | |
|
|
273 | if (nmt == NULL) |
266 | if (nmt == NULL) |
274 | { |
267 | { |
275 | lmt = NULL; |
268 | lmt = NULL; |
276 | #ifndef NEW_MATERIAL_CODE |
269 | |
277 | for (mt = materialt; mt && mt->next; mt = mt->next) |
270 | for (mt = materialt; mt && mt->next; mt = mt->next) |
278 | { |
271 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
279 | if (op->materials & mt->material) |
272 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
280 | { |
273 | { |
281 | lmt = mt; |
274 | lmt = mt; |
|
|
275 | if (!(op->is_weapon () || op->is_armor ())) |
282 | break; |
276 | break; |
283 | } |
277 | } |
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 | } |
278 | } |
299 | else |
279 | else |
300 | { |
|
|
301 | lmt = nmt; |
280 | lmt = nmt; |
302 | } |
|
|
303 | |
281 | |
304 | if (lmt != NULL) |
282 | if (lmt != NULL) |
305 | { |
283 | { |
306 | #ifndef NEW_MATERIAL_CODE |
|
|
307 | op->materialname = lmt->name; |
|
|
308 | return; |
|
|
309 | #else |
|
|
310 | |
|
|
311 | if (op->stats.dam && op->is_weapon ()) |
284 | if (op->stats.dam && op->is_weapon ()) |
312 | { |
285 | { |
313 | op->stats.dam += lmt->damage; |
286 | op->stats.dam += lmt->damage; |
314 | if (op->stats.dam < 1) |
287 | if (op->stats.dam < 1) |
315 | op->stats.dam = 1; |
288 | op->stats.dam = 1; |
… | |
… | |
321 | op->stats.wc += lmt->wc; |
294 | op->stats.wc += lmt->wc; |
322 | if (op->is_armor ()) |
295 | if (op->is_armor ()) |
323 | { |
296 | { |
324 | if (op->stats.ac) |
297 | if (op->stats.ac) |
325 | op->stats.ac += lmt->ac; |
298 | op->stats.ac += lmt->ac; |
|
|
299 | |
326 | for (j = 0; j < NROFATTACKS; j++) |
300 | for (int j = 0; j < NROFATTACKS; j++) |
327 | if (op->resist[j] != 0) |
301 | if (op->resist[j] != 0) |
328 | { |
302 | { |
329 | op->resist[j] += lmt->mod[j]; |
303 | op->resist[j] += lmt->mod[j]; |
330 | if (op->resist[j] > 100) |
304 | if (op->resist[j] > 100) |
331 | op->resist[j] = 100; |
305 | op->resist[j] = 100; |
332 | if (op->resist[j] < -100) |
306 | if (op->resist[j] < -100) |
333 | op->resist[j] = -100; |
307 | op->resist[j] = -100; |
334 | } |
308 | } |
335 | } |
309 | } |
|
|
310 | |
336 | op->materialname = lmt->name; |
311 | op->materialname = lmt->name; |
337 | /* dont make it unstackable if it doesn't need to be */ |
312 | /* dont make it unstackable if it doesn't need to be */ |
338 | if (op->is_weapon () || op->is_armor ()) |
313 | if (op->is_weapon () || op->is_armor ()) |
339 | { |
314 | { |
340 | op->weight = (op->weight * lmt->weight) / 100; |
315 | op->weight = (op->weight * lmt->weight) / 100; |
341 | op->value = (op->value * lmt->value) / 100; |
316 | op->value = (op->value * lmt->value) / 100; |
342 | } |
317 | } |
343 | #endif |
|
|
344 | } |
318 | } |
345 | } |
319 | } |
346 | |
320 | |
347 | /* |
321 | /* |
348 | * Strip out the media tags from a String. |
322 | * Strip out the media tags from a String. |
… | |
… | |
443 | * a 'list' for the purposes here, is a string of items, seperated by commas, except |
417 | * 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. |
418 | * 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. |
419 | * This function will also strip all trailing non alphanumeric characters. |
446 | * It does not insert an oxford comma. |
420 | * It does not insert an oxford comma. |
447 | */ |
421 | */ |
448 | |
|
|
449 | void |
422 | void |
450 | make_list_like (char *input) |
423 | make_list_like (char *input) |
451 | { |
424 | { |
452 | char *p, tmp[MAX_BUF]; |
425 | char *p, tmp[MAX_BUF]; |
453 | int i; |
426 | int i; |
… | |
… | |
495 | LOG (llevError, "fork abort: %s\n", msg); |
468 | LOG (llevError, "fork abort: %s\n", msg); |
496 | } |
469 | } |
497 | |
470 | |
498 | void *salloc_ (int n) throw (std::bad_alloc) |
471 | void *salloc_ (int n) throw (std::bad_alloc) |
499 | { |
472 | { |
500 | #ifdef PREFER_MALLOC |
|
|
501 | void *ptr = malloc (n); |
|
|
502 | #else |
|
|
503 | void *ptr = g_slice_alloc (n); |
473 | void *ptr = g_slice_alloc (n); |
504 | #endif |
|
|
505 | |
474 | |
506 | if (!ptr) |
475 | if (!ptr) |
507 | throw std::bad_alloc (); |
476 | throw std::bad_alloc (); |
508 | |
477 | |
|
|
478 | slice_alloc += n; |
509 | return ptr; |
479 | return ptr; |
510 | } |
480 | } |
511 | |
481 | |
512 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
482 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
513 | { |
483 | { |
… | |
… | |
519 | memset (ptr, 0, n); |
489 | memset (ptr, 0, n); |
520 | |
490 | |
521 | return ptr; |
491 | return ptr; |
522 | } |
492 | } |
523 | |
493 | |
|
|
494 | /******************************************************************************/ |
|
|
495 | |
|
|
496 | #if DEBUG_SALLOC |
|
|
497 | |
|
|
498 | #define MAGIC 0xa1b2c35543deadLL |
|
|
499 | |
|
|
500 | void *g_slice_alloc (unsigned long size) |
|
|
501 | { |
|
|
502 | unsigned long *p = (unsigned long *) (g_slice_alloc)(size + sizeof (unsigned long)); |
|
|
503 | *p++ = size ^ MAGIC; |
|
|
504 | //fprintf (stderr, "g_slice_alloc %ld %p\n", size, p);//D |
|
|
505 | return (void *)p; |
|
|
506 | } |
|
|
507 | |
|
|
508 | void *g_slice_alloc0 (unsigned long size) |
|
|
509 | { |
|
|
510 | return memset (g_slice_alloc (size), 0, size); |
|
|
511 | } |
|
|
512 | |
|
|
513 | void g_slice_free1 (unsigned long size, void *ptr) |
|
|
514 | { |
|
|
515 | //fprintf (stderr, "g_slice_free %ld %p\n", size, ptr);//D |
|
|
516 | if (expect_true (ptr)) |
|
|
517 | { |
|
|
518 | unsigned long *p = (unsigned long *)ptr; |
|
|
519 | unsigned long s = *--p ^ MAGIC; |
|
|
520 | |
|
|
521 | if (size != (unsigned long)(*p ^ MAGIC)) |
|
|
522 | { |
|
|
523 | LOG (logBacktrace | llevError, "slice free size (%lx) doesn't match alloc size (%lx)\n", size, s); |
|
|
524 | abort (); |
|
|
525 | } |
|
|
526 | |
|
|
527 | *p = MAGIC; |
|
|
528 | |
|
|
529 | (g_slice_free1)(s + sizeof (unsigned long), p); |
|
|
530 | } |
|
|
531 | } |
|
|
532 | |
|
|
533 | #endif |
|
|
534 | |
|
|
535 | /******************************************************************************/ |
|
|
536 | |
524 | void assign (char *dst, const char *src, int maxlen) |
537 | void assign (char *dst, const char *src, int maxlen) |
525 | { |
538 | { |
526 | if (!src) |
539 | if (!src) |
527 | src = ""; |
540 | src = ""; |
528 | |
541 | |
… | |
… | |
543 | } |
556 | } |
544 | else |
557 | else |
545 | memcpy (dst, src, len + 1); |
558 | memcpy (dst, src, len + 1); |
546 | } |
559 | } |
547 | |
560 | |
548 | const std::string |
561 | const char * |
549 | format (const char *format, ...) |
562 | format (const char *format, ...) |
550 | { |
563 | { |
551 | int len; |
564 | static dynbuf_text buf; |
552 | |
565 | |
553 | { |
566 | buf.clear (); |
554 | char buf[128]; |
|
|
555 | |
567 | |
556 | va_list ap; |
568 | va_list ap; |
557 | va_start (ap, format); |
569 | va_start (ap, format); |
558 | len = vsnprintf (buf, sizeof (buf), format, ap); |
570 | buf.vprintf (format, ap); |
559 | va_end (ap); |
571 | va_end (ap); |
560 | |
572 | |
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; |
573 | return buf; |
581 | } |
|
|
582 | } |
574 | } |
583 | |
575 | |
584 | tstamp now () |
576 | tstamp now () |
585 | { |
577 | { |
586 | struct timeval tv; |
578 | struct timeval tv; |
… | |
… | |
654 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
646 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
655 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
647 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
656 | 0x2d02ef8dL |
648 | 0x2d02ef8dL |
657 | }; |
649 | }; |
658 | |
650 | |
|
|
651 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
652 | { |
|
|
653 | pthread_attr_t attr; |
659 | |
654 | |
|
|
655 | pthread_attr_init (&attr); |
|
|
656 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
657 | pthread_attr_setstacksize (&attr, PTHREAD_STACK_MIN < sizeof (long) * 4096 |
|
|
658 | ? sizeof (long) * 4096 : PTHREAD_STACK_MIN); |
|
|
659 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
660 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
661 | #endif |
|
|
662 | |
|
|
663 | sigset_t fullsigset, oldsigset; |
|
|
664 | sigfillset (&fullsigset); |
|
|
665 | |
|
|
666 | pthread_sigmask (SIG_SETMASK, &fullsigset, &oldsigset); |
|
|
667 | |
|
|
668 | if (pthread_create (&id, &attr, start_routine, arg)) |
|
|
669 | cleanup ("unable to create a new thread"); |
|
|
670 | |
|
|
671 | pthread_sigmask (SIG_SETMASK, &oldsigset, 0); |
|
|
672 | } |
|
|
673 | |