| 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 | |
| … | |
… | |
| 204 | } |
204 | } |
| 205 | |
205 | |
| 206 | return total; |
206 | return total; |
| 207 | } |
207 | } |
| 208 | |
208 | |
| 209 | /* decay and destroy perishable items in a map */ |
|
|
| 210 | void |
|
|
| 211 | maptile::decay_objects () |
|
|
| 212 | { |
|
|
| 213 | if (!spaces) |
|
|
| 214 | return; |
|
|
| 215 | |
|
|
| 216 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
| 217 | for (object *above, *op = ms->bot; op; op = above) |
|
|
| 218 | { |
|
|
| 219 | above = op->above; |
|
|
| 220 | |
|
|
| 221 | bool destroy = 0; |
|
|
| 222 | |
|
|
| 223 | // do not decay anything above unique floor tiles (yet :) |
|
|
| 224 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
| 225 | break; |
|
|
| 226 | |
|
|
| 227 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
| 228 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
| 229 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
| 230 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
| 231 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
| 232 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
| 233 | || op->is_alive ()) |
|
|
| 234 | ; // do not decay |
|
|
| 235 | else if (op->is_weapon ()) |
|
|
| 236 | { |
|
|
| 237 | op->stats.dam--; |
|
|
| 238 | if (op->stats.dam < 0) |
|
|
| 239 | destroy = 1; |
|
|
| 240 | } |
|
|
| 241 | else if (op->is_armor ()) |
|
|
| 242 | { |
|
|
| 243 | op->stats.ac--; |
|
|
| 244 | if (op->stats.ac < 0) |
|
|
| 245 | destroy = 1; |
|
|
| 246 | } |
|
|
| 247 | else if (op->type == FOOD) |
|
|
| 248 | { |
|
|
| 249 | op->stats.food -= rndm (5, 20); |
|
|
| 250 | if (op->stats.food < 0) |
|
|
| 251 | destroy = 1; |
|
|
| 252 | } |
|
|
| 253 | else |
|
|
| 254 | { |
|
|
| 255 | int mat = op->materials; |
|
|
| 256 | |
|
|
| 257 | if (mat & M_PAPER |
|
|
| 258 | || mat & M_LEATHER |
|
|
| 259 | || mat & M_WOOD |
|
|
| 260 | || mat & M_ORGANIC |
|
|
| 261 | || mat & M_CLOTH |
|
|
| 262 | || mat & M_LIQUID |
|
|
| 263 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
| 264 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
| 265 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
| 266 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
| 267 | || (mat & M_ICE && temp > 32)) |
|
|
| 268 | destroy = 1; |
|
|
| 269 | } |
|
|
| 270 | |
|
|
| 271 | /* adjust overall chance below */ |
|
|
| 272 | if (destroy && rndm (0, 1)) |
|
|
| 273 | op->destroy (); |
|
|
| 274 | } |
|
|
| 275 | } |
|
|
| 276 | |
|
|
| 277 | /* convert materialname to materialtype_t */ |
209 | /* convert materialname to materialtype_t */ |
| 278 | |
210 | |
| 279 | materialtype_t * |
211 | materialtype_t * |
| 280 | name_to_material (const shstr &name) |
212 | name_to_material (const shstr &name) |
| 281 | { |
213 | { |
| 282 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
214 | for (materialtype_t *mt = materialt; mt && mt->next; mt = mt->next) |
| 283 | if (name == mt->name) |
215 | if (name == mt->name) |
| 284 | return mt; |
216 | return mt; |
| 285 | |
217 | |
| 286 | return materialt; |
218 | return 0; |
| 287 | } |
219 | } |
| 288 | |
220 | |
| 289 | /* when doing transmutation of objects, we have to recheck the resistances, |
221 | /* when doing transmutation of objects, we have to recheck the resistances, |
| 290 | * as some that did not apply previously, may apply now. |
222 | * as some that did not apply previously, may apply now. |
| 291 | */ |
223 | */ |
| 292 | |
|
|
| 293 | void |
224 | void |
| 294 | transmute_materialname (object *op, const object *change) |
225 | transmute_materialname (object *op, const object *change) |
| 295 | { |
226 | { |
| 296 | materialtype_t *mt; |
227 | materialtype_t *mt; |
| 297 | int j; |
228 | int j; |
| … | |
… | |
| 327 | void |
258 | void |
| 328 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
259 | set_materialname (object *op, int difficulty, materialtype_t *nmt) |
| 329 | { |
260 | { |
| 330 | materialtype_t *mt, *lmt; |
261 | materialtype_t *mt, *lmt; |
| 331 | |
262 | |
| 332 | #ifdef NEW_MATERIAL_CODE |
|
|
| 333 | int j; |
|
|
| 334 | #endif |
|
|
| 335 | |
|
|
| 336 | if (op->materialname != NULL) |
263 | if (op->materialname != NULL) |
| 337 | return; |
264 | return; |
| 338 | |
265 | |
| 339 | |
|
|
| 340 | |
|
|
| 341 | if (nmt == NULL) |
266 | if (nmt == NULL) |
| 342 | { |
267 | { |
| 343 | lmt = NULL; |
268 | lmt = NULL; |
| 344 | #ifndef NEW_MATERIAL_CODE |
269 | |
| 345 | for (mt = materialt; mt && mt->next; mt = mt->next) |
270 | for (mt = materialt; mt && mt->next; mt = mt->next) |
| 346 | { |
271 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
| 347 | if (op->materials & mt->material) |
272 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
| 348 | { |
273 | { |
| 349 | lmt = mt; |
274 | lmt = mt; |
|
|
275 | if (!(op->is_weapon () || op->is_armor ())) |
| 350 | break; |
276 | break; |
| 351 | } |
277 | } |
| 352 | } |
|
|
| 353 | |
|
|
| 354 | #else |
|
|
| 355 | for (mt = materialt; mt && mt->next; mt = mt->next) |
|
|
| 356 | { |
|
|
| 357 | if (op->materials & mt->material && rndm (1, 100) <= mt->chance && |
|
|
| 358 | difficulty >= mt->difficulty && (op->magic >= mt->magic || mt->magic == 0)) |
|
|
| 359 | { |
|
|
| 360 | lmt = mt; |
|
|
| 361 | if (!(op->is_weapon () || op->is_armor ())) |
|
|
| 362 | break; |
|
|
| 363 | } |
|
|
| 364 | } |
|
|
| 365 | #endif |
|
|
| 366 | } |
278 | } |
| 367 | else |
279 | else |
| 368 | { |
|
|
| 369 | lmt = nmt; |
280 | lmt = nmt; |
| 370 | } |
|
|
| 371 | |
281 | |
| 372 | if (lmt != NULL) |
282 | if (lmt != NULL) |
| 373 | { |
283 | { |
| 374 | #ifndef NEW_MATERIAL_CODE |
|
|
| 375 | op->materialname = lmt->name; |
|
|
| 376 | return; |
|
|
| 377 | #else |
|
|
| 378 | |
|
|
| 379 | if (op->stats.dam && op->is_weapon ()) |
284 | if (op->stats.dam && op->is_weapon ()) |
| 380 | { |
285 | { |
| 381 | op->stats.dam += lmt->damage; |
286 | op->stats.dam += lmt->damage; |
| 382 | if (op->stats.dam < 1) |
287 | if (op->stats.dam < 1) |
| 383 | op->stats.dam = 1; |
288 | op->stats.dam = 1; |
| … | |
… | |
| 389 | op->stats.wc += lmt->wc; |
294 | op->stats.wc += lmt->wc; |
| 390 | if (op->is_armor ()) |
295 | if (op->is_armor ()) |
| 391 | { |
296 | { |
| 392 | if (op->stats.ac) |
297 | if (op->stats.ac) |
| 393 | op->stats.ac += lmt->ac; |
298 | op->stats.ac += lmt->ac; |
|
|
299 | |
| 394 | for (j = 0; j < NROFATTACKS; j++) |
300 | for (int j = 0; j < NROFATTACKS; j++) |
| 395 | if (op->resist[j] != 0) |
301 | if (op->resist[j] != 0) |
| 396 | { |
302 | { |
| 397 | op->resist[j] += lmt->mod[j]; |
303 | op->resist[j] += lmt->mod[j]; |
| 398 | if (op->resist[j] > 100) |
304 | if (op->resist[j] > 100) |
| 399 | op->resist[j] = 100; |
305 | op->resist[j] = 100; |
| 400 | if (op->resist[j] < -100) |
306 | if (op->resist[j] < -100) |
| 401 | op->resist[j] = -100; |
307 | op->resist[j] = -100; |
| 402 | } |
308 | } |
| 403 | } |
309 | } |
|
|
310 | |
| 404 | op->materialname = lmt->name; |
311 | op->materialname = lmt->name; |
| 405 | /* dont make it unstackable if it doesn't need to be */ |
312 | /* dont make it unstackable if it doesn't need to be */ |
| 406 | if (op->is_weapon () || op->is_armor ()) |
313 | if (op->is_weapon () || op->is_armor ()) |
| 407 | { |
314 | { |
| 408 | op->weight = (op->weight * lmt->weight) / 100; |
315 | op->weight = (op->weight * lmt->weight) / 100; |
| 409 | op->value = (op->value * lmt->value) / 100; |
316 | op->value = (op->value * lmt->value) / 100; |
| 410 | } |
317 | } |
| 411 | #endif |
|
|
| 412 | } |
318 | } |
| 413 | } |
319 | } |
| 414 | |
320 | |
| 415 | /* |
321 | /* |
| 416 | * Strip out the media tags from a String. |
322 | * Strip out the media tags from a String. |
| … | |
… | |
| 511 | * 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 |
| 512 | * 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. |
| 513 | * This function will also strip all trailing non alphanumeric characters. |
419 | * This function will also strip all trailing non alphanumeric characters. |
| 514 | * It does not insert an oxford comma. |
420 | * It does not insert an oxford comma. |
| 515 | */ |
421 | */ |
| 516 | |
|
|
| 517 | void |
422 | void |
| 518 | make_list_like (char *input) |
423 | make_list_like (char *input) |
| 519 | { |
424 | { |
| 520 | char *p, tmp[MAX_BUF]; |
425 | char *p, tmp[MAX_BUF]; |
| 521 | int i; |
426 | int i; |
| … | |
… | |
| 563 | LOG (llevError, "fork abort: %s\n", msg); |
468 | LOG (llevError, "fork abort: %s\n", msg); |
| 564 | } |
469 | } |
| 565 | |
470 | |
| 566 | void *salloc_ (int n) throw (std::bad_alloc) |
471 | void *salloc_ (int n) throw (std::bad_alloc) |
| 567 | { |
472 | { |
| 568 | #ifdef PREFER_MALLOC |
|
|
| 569 | void *ptr = malloc (n); |
|
|
| 570 | #else |
|
|
| 571 | void *ptr = g_slice_alloc (n); |
473 | void *ptr = g_slice_alloc (n); |
| 572 | #endif |
|
|
| 573 | |
474 | |
| 574 | if (!ptr) |
475 | if (!ptr) |
| 575 | throw std::bad_alloc (); |
476 | throw std::bad_alloc (); |
| 576 | |
477 | |
|
|
478 | slice_alloc += n; |
| 577 | return ptr; |
479 | return ptr; |
| 578 | } |
480 | } |
| 579 | |
481 | |
| 580 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
482 | void *salloc_ (int n, void *src) throw (std::bad_alloc) |
| 581 | { |
483 | { |
| … | |
… | |
| 587 | memset (ptr, 0, n); |
489 | memset (ptr, 0, n); |
| 588 | |
490 | |
| 589 | return ptr; |
491 | return ptr; |
| 590 | } |
492 | } |
| 591 | |
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 | |
| 592 | void assign (char *dst, const char *src, int maxlen) |
537 | void assign (char *dst, const char *src, int maxlen) |
| 593 | { |
538 | { |
| 594 | if (!src) |
539 | if (!src) |
| 595 | src = ""; |
540 | src = ""; |
| 596 | |
541 | |
| … | |
… | |
| 611 | } |
556 | } |
| 612 | else |
557 | else |
| 613 | memcpy (dst, src, len + 1); |
558 | memcpy (dst, src, len + 1); |
| 614 | } |
559 | } |
| 615 | |
560 | |
| 616 | const std::string |
561 | const char * |
| 617 | format (const char *format, ...) |
562 | format (const char *format, ...) |
| 618 | { |
563 | { |
| 619 | int len; |
564 | static dynbuf_text buf; |
| 620 | |
565 | |
| 621 | { |
566 | buf.clear (); |
| 622 | char buf[128]; |
|
|
| 623 | |
567 | |
| 624 | va_list ap; |
568 | va_list ap; |
| 625 | va_start (ap, format); |
569 | va_start (ap, format); |
| 626 | len = vsnprintf (buf, sizeof (buf), format, ap); |
570 | buf.vprintf (format, ap); |
| 627 | va_end (ap); |
571 | va_end (ap); |
| 628 | |
572 | |
| 629 | assert (len >= 0); // shield againstz broken vsnprintf's |
|
|
| 630 | |
|
|
| 631 | // was our static buffer short enough? |
|
|
| 632 | if (len < sizeof (buf)) |
|
|
| 633 | return std::string (buf, len); |
|
|
| 634 | } |
|
|
| 635 | |
|
|
| 636 | { |
|
|
| 637 | // longer, try harder |
|
|
| 638 | char *buf = salloc<char> (len + 1); |
|
|
| 639 | |
|
|
| 640 | va_list ap; |
|
|
| 641 | va_start (ap, format); |
|
|
| 642 | vsnprintf (buf, len + 1, format, ap); |
|
|
| 643 | va_end (ap); |
|
|
| 644 | |
|
|
| 645 | const std::string s (buf, len); |
|
|
| 646 | sfree<char> (buf, len + 1); |
|
|
| 647 | |
|
|
| 648 | return buf; |
573 | return buf; |
| 649 | } |
|
|
| 650 | } |
574 | } |
| 651 | |
575 | |
| 652 | tstamp now () |
576 | tstamp now () |
| 653 | { |
577 | { |
| 654 | struct timeval tv; |
578 | struct timeval tv; |
| … | |
… | |
| 722 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
646 | 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL, |
| 723 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
647 | 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL, |
| 724 | 0x2d02ef8dL |
648 | 0x2d02ef8dL |
| 725 | }; |
649 | }; |
| 726 | |
650 | |
|
|
651 | void thread::start (void *(*start_routine)(void *), void *arg) |
|
|
652 | { |
|
|
653 | pthread_attr_t attr; |
| 727 | |
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 | |
