| 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 | #include <cassert> |
24 | #include <cassert> |
| 26 | |
25 | |
| 27 | #include <global.h> |
26 | #include <global.h> |
| … | |
… | |
| 29 | #include <loader.h> |
28 | #include <loader.h> |
| 30 | |
29 | |
| 31 | #include <tr1/functional> |
30 | #include <tr1/functional> |
| 32 | #include <tr1/unordered_map> |
31 | #include <tr1/unordered_map> |
| 33 | |
32 | |
| 34 | /* The naming of these functions is really poor - they are all |
|
|
| 35 | * pretty much named '.._arch_...', but they may more may not |
|
|
| 36 | * return archetypes. Some make the arch_to_object call, and thus |
|
|
| 37 | * return an object. Perhaps those should be called 'archob' functions |
|
|
| 38 | * to denote they return an object derived from the archetype. |
|
|
| 39 | * MSW 2003-04-29 |
|
|
| 40 | */ |
|
|
| 41 | |
|
|
| 42 | bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
|
|
34 | arch_ptr archetype::empty; |
| 43 | |
35 | |
| 44 | // the hashtable |
36 | // the hashtable |
| 45 | typedef std::tr1::unordered_map |
37 | typedef std::tr1::unordered_map |
| 46 | < |
38 | < |
| 47 | const char *, |
39 | const char *, |
| … | |
… | |
| 49 | str_hash, |
41 | str_hash, |
| 50 | str_equal, |
42 | str_equal, |
| 51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
43 | slice_allocator< std::pair<const char *const, arch_ptr> > |
| 52 | > HT; |
44 | > HT; |
| 53 | |
45 | |
| 54 | static HT ht (5000); |
46 | static HT ht (10000); |
| 55 | archvec archetypes; |
47 | archvec archetypes; |
|
|
48 | static unordered_vector<archetype *> allarch; |
|
|
49 | static int dirtycnt; |
|
|
50 | |
|
|
51 | // the vector of other_arch references to be resolved |
|
|
52 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
|
|
53 | // the vector of loaded but not yet committed archetypes |
|
|
54 | static std::vector<archetype *> postponed_arch; |
| 56 | |
55 | |
| 57 | /** |
56 | /** |
| 58 | * GROS - This function retrieves an archetype given the name that appears |
57 | * GROS - This function retrieves an archetype given the name that appears |
| 59 | * during the game (for example, "writing pen" instead of "stylus"). |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
| 60 | * It does not use the hashtable system, but browse the whole archlist each time. |
59 | * It does not use the hashtable system, but browse the whole archlist each time. |
| … | |
… | |
| 69 | find_archetype_by_object_name (const char *name) |
68 | find_archetype_by_object_name (const char *name) |
| 70 | { |
69 | { |
| 71 | shstr_cmp name_cmp (name); |
70 | shstr_cmp name_cmp (name); |
| 72 | |
71 | |
| 73 | for_all_archetypes (at) |
72 | for_all_archetypes (at) |
| 74 | if (at->archname == name_cmp) |
73 | if (at->name == name_cmp) |
| 75 | return at; |
74 | return at; |
| 76 | |
75 | |
| 77 | return 0; |
76 | return 0; |
| 78 | } |
77 | } |
| 79 | |
78 | |
| … | |
… | |
| 86 | find_archetype_by_object_type_name (int type, const char *name) |
85 | find_archetype_by_object_type_name (int type, const char *name) |
| 87 | { |
86 | { |
| 88 | shstr_cmp name_cmp (name); |
87 | shstr_cmp name_cmp (name); |
| 89 | |
88 | |
| 90 | for_all_archetypes (at) |
89 | for_all_archetypes (at) |
| 91 | if (at->archname == name_cmp && at->type == type) |
90 | if (at->name == name_cmp && at->type == type) |
| 92 | return at; |
91 | return at; |
| 93 | |
92 | |
| 94 | return 0; |
93 | return 0; |
| 95 | } |
94 | } |
| 96 | |
95 | |
| … | |
… | |
| 277 | return 0; |
276 | return 0; |
| 278 | } |
277 | } |
| 279 | |
278 | |
| 280 | archetype::archetype (const char *name) |
279 | archetype::archetype (const char *name) |
| 281 | { |
280 | { |
| 282 | stub = true; |
|
|
| 283 | arch = this; |
281 | arch = this; |
| 284 | this->archname = this->name = this->name_pl = name; |
282 | this->archname = this->name = this->name_pl = name; |
| 285 | } |
283 | } |
| 286 | |
284 | |
| 287 | archetype::~archetype () |
285 | archetype::~archetype () |
| … | |
… | |
| 290 | } |
288 | } |
| 291 | |
289 | |
| 292 | void |
290 | void |
| 293 | archetype::link () |
291 | archetype::link () |
| 294 | { |
292 | { |
| 295 | ht.insert (std::make_pair (archname, this)); |
|
|
| 296 | |
|
|
| 297 | if (!archetypes.contains (this)) |
293 | if (!archetypes.contains (this)) |
|
|
294 | { |
| 298 | archetypes.insert (this); |
295 | archetypes.insert (this); |
|
|
296 | ht.insert (std::make_pair (archname, this)); |
|
|
297 | } |
| 299 | } |
298 | } |
| 300 | |
299 | |
| 301 | void |
300 | void |
| 302 | archetype::unlink () |
301 | archetype::unlink () |
| 303 | { |
302 | { |
| 304 | ht.erase (archname); |
|
|
| 305 | if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D |
|
|
| 306 | if (archetypes.contains (this)) |
303 | if (archetypes.contains (this)) |
|
|
304 | { |
| 307 | archetypes.erase (this); |
305 | archetypes.erase (this); |
|
|
306 | ht.erase (archname); |
|
|
307 | } |
| 308 | } |
308 | } |
| 309 | |
309 | |
| 310 | /* |
310 | /* |
| 311 | * Finds, using the hashtable, which archetype matches the given name. |
311 | * Finds, using the hashtable, which archetype matches the given name. |
| 312 | * returns a pointer to the found archetype, otherwise NULL. |
312 | * returns a pointer to the found archetype, otherwise NULL. |
| … | |
… | |
| 324 | else |
324 | else |
| 325 | return i->second; |
325 | return i->second; |
| 326 | } |
326 | } |
| 327 | |
327 | |
| 328 | archetype * |
328 | archetype * |
| 329 | archetype::get (const char *name) |
|
|
| 330 | { |
|
|
| 331 | if (!name) |
|
|
| 332 | { |
|
|
| 333 | LOG (llevError, "null archetype requested\n"); |
|
|
| 334 | name = "(null)"; |
|
|
| 335 | } |
|
|
| 336 | |
|
|
| 337 | archetype *at = find (name); |
|
|
| 338 | |
|
|
| 339 | if (!at) |
|
|
| 340 | { |
|
|
| 341 | at = new archetype (name); |
|
|
| 342 | at->link (); |
|
|
| 343 | } |
|
|
| 344 | |
|
|
| 345 | return at; |
|
|
| 346 | } |
|
|
| 347 | |
|
|
| 348 | archetype * |
|
|
| 349 | archetype::read (object_thawer &f) |
329 | archetype::read (object_thawer &f) |
| 350 | { |
330 | { |
| 351 | assert (f.kw == KW_object); |
331 | assert (f.kw == KW_object); |
| 352 | |
332 | |
| 353 | loading_arch = true; // hack to tell parse_kv et al. to behave |
|
|
| 354 | |
|
|
| 355 | std::vector<archetype *> parts; |
333 | std::vector<archetype *> parts; |
| 356 | |
334 | |
| 357 | coroapi::cede_to_tick_every (10); |
335 | coroapi::cede_to_tick (); |
| 358 | |
336 | |
| 359 | for (;;) |
337 | for (;;) |
| 360 | { |
338 | { |
| 361 | // the archetype might have been referenced earlier |
|
|
| 362 | // so try to find an existing stub archetype first |
|
|
| 363 | archetype *at = find (f.get_str ()); |
339 | archetype *at = new archetype (f.get_str ()); |
| 364 | |
|
|
| 365 | if (!at || !at->stub) |
|
|
| 366 | at = new archetype (f.get_str ()); |
|
|
| 367 | |
340 | |
| 368 | f.next (); |
341 | f.next (); |
| 369 | |
342 | |
| 370 | #if 0 |
343 | #if 0 |
| 371 | // implementing it here in the server does neither allow multiple inheritence |
344 | // implementing it here in the server does neither allow multiple inheritence |
| … | |
… | |
| 382 | |
355 | |
| 383 | f.next (); |
356 | f.next (); |
| 384 | } |
357 | } |
| 385 | #endif |
358 | #endif |
| 386 | |
359 | |
|
|
360 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
361 | bool parse_ok = at->parse_kv (f); |
|
|
362 | loading_arch = 0; |
|
|
363 | |
| 387 | if (!at->parse_kv (f)) |
364 | if (!parse_ok) |
| 388 | goto fail; |
365 | goto fail; |
| 389 | |
366 | |
|
|
367 | loading_arch = at; // hack to tell parse_kv et al. to behave |
| 390 | at->post_load_check (); |
368 | at->post_load_check (); |
|
|
369 | loading_arch = 0; |
| 391 | |
370 | |
| 392 | parts.push_back (at); |
371 | parts.push_back (at); |
| 393 | |
372 | |
| 394 | if (f.kw != KW_more) |
373 | if (f.kw != KW_more) |
| 395 | break; |
374 | break; |
| … | |
… | |
| 400 | { |
379 | { |
| 401 | f.parse_error ("more object"); |
380 | f.parse_error ("more object"); |
| 402 | goto fail; |
381 | goto fail; |
| 403 | } |
382 | } |
| 404 | } |
383 | } |
| 405 | |
|
|
| 406 | loading_arch = false; |
|
|
| 407 | |
384 | |
| 408 | { |
385 | { |
| 409 | auto (at, parts.begin ()); |
386 | auto (at, parts.begin ()); |
| 410 | |
387 | |
| 411 | archetype *new_head = parts.front (); |
388 | archetype *new_head = parts.front (); |
| … | |
… | |
| 430 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
407 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
| 431 | goto fail; |
408 | goto fail; |
| 432 | } |
409 | } |
| 433 | } |
410 | } |
| 434 | |
411 | |
| 435 | // deactivate existing archetype |
|
|
| 436 | for (archetype *at = old_head; at; at = (archetype *)at->more) |
|
|
| 437 | at->unlink (); |
|
|
| 438 | |
|
|
| 439 | // assemble new chain |
412 | // assemble new chain |
| 440 | new_head->min_x = new_head->max_x = new_head->x; |
413 | new_head->min_x = new_head->max_x = new_head->x; |
| 441 | new_head->min_y = new_head->max_y = new_head->y; |
414 | new_head->min_y = new_head->max_y = new_head->y; |
| 442 | |
415 | |
| 443 | archetype *less = new_head; |
416 | archetype *less = new_head; |
| 444 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
417 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
| 445 | { |
418 | { |
| 446 | archetype *at = *p; |
419 | archetype *at = *p; |
| 447 | |
420 | |
|
|
421 | // some flags get inherited from the head (probably a lot more) |
|
|
422 | // doing it here doesn't feel too cozy, but it allows code |
|
|
423 | // to ignore head checks for these flags, which saves time |
|
|
424 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
425 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
426 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
427 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
428 | |
| 448 | if (at->x < new_head->min_x) new_head->min_x = at->x; |
429 | new_head->min_x = min (new_head->min_x, at->x); |
| 449 | if (at->y < new_head->min_y) new_head->min_y = at->y; |
430 | new_head->min_y = min (new_head->min_y, at->y); |
| 450 | if (at->x > new_head->max_x) new_head->max_x = at->x; |
431 | new_head->max_x = max (new_head->max_x, at->x); |
| 451 | if (at->y > new_head->max_y) new_head->max_y = at->y; |
432 | new_head->max_y = max (new_head->max_y, at->y); |
| 452 | |
433 | |
| 453 | at->head = new_head; |
434 | at->head = new_head; |
| 454 | less->more = at; |
435 | less->more = at; |
| 455 | less = at; |
436 | less = at; |
| 456 | } |
437 | } |
| 457 | |
438 | |
| 458 | // now activate it |
439 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
| 459 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
| 460 | { |
|
|
| 461 | archetype *at = *p; |
|
|
| 462 | at->stub = false; |
|
|
| 463 | at->link (); |
|
|
| 464 | } |
|
|
| 465 | |
440 | |
| 466 | return new_head; |
441 | return new_head; |
| 467 | } |
442 | } |
| 468 | |
443 | |
| 469 | fail: |
444 | fail: |
| 470 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
445 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
| 471 | (*p)->destroy (true); |
446 | (*p)->destroy (true); |
| 472 | |
447 | |
| 473 | loading_arch = false; |
|
|
| 474 | return 0; |
448 | return 0; |
| 475 | } |
449 | } |
| 476 | |
450 | |
| 477 | /* |
|
|
| 478 | * Initialize global archtype pointers: |
|
|
| 479 | */ |
|
|
| 480 | void |
451 | void |
| 481 | init_archetype_pointers () |
452 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
| 482 | { |
453 | { |
| 483 | ring_arch = archetype::find ("ring"); |
454 | ref = 0; |
| 484 | amulet_arch = archetype::find ("amulet"); |
455 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
| 485 | staff_arch = archetype::find ("staff"); |
456 | } |
| 486 | crown_arch = archetype::find ("crown"); |
457 | |
| 487 | empty_archetype = archetype::find ("empty_archetype"); |
458 | void |
|
|
459 | archetype::commit_load () |
|
|
460 | { |
|
|
461 | // unlink old archetypes and link in new ones */ |
|
|
462 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
|
|
463 | { |
|
|
464 | archetype *at = *p; |
|
|
465 | |
|
|
466 | if (archetype *old = find (at->archname)) |
|
|
467 | old->unlink (); |
|
|
468 | |
|
|
469 | allarch.push_back (at); |
|
|
470 | |
|
|
471 | at->link (); |
|
|
472 | ++dirtycnt; |
|
|
473 | } |
|
|
474 | |
|
|
475 | postponed_arch.clear (); |
|
|
476 | |
|
|
477 | // now resolve arch references |
|
|
478 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
|
|
479 | { |
|
|
480 | arch_ptr *ap = p->first; |
|
|
481 | archetype *at = find (p->second); |
|
|
482 | |
|
|
483 | if (!at) |
|
|
484 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
|
|
485 | |
|
|
486 | *ap = at; |
|
|
487 | } |
|
|
488 | |
|
|
489 | postponed_arch_ref.clear (); |
|
|
490 | |
|
|
491 | empty = find (shstr_empty_archetype); |
|
|
492 | } |
|
|
493 | |
|
|
494 | void |
|
|
495 | archetype::gc () |
|
|
496 | { |
|
|
497 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
|
|
498 | dirtycnt = max (0, dirtycnt - cnt); |
|
|
499 | |
|
|
500 | do |
|
|
501 | { |
|
|
502 | static int idx; |
|
|
503 | |
|
|
504 | if (idx >= allarch.size ()) |
|
|
505 | if (idx) |
|
|
506 | idx = 0; |
|
|
507 | else |
|
|
508 | return; |
|
|
509 | |
|
|
510 | archetype *at = allarch [idx]; |
|
|
511 | |
|
|
512 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
|
|
513 | ++idx; |
|
|
514 | else |
|
|
515 | { |
|
|
516 | LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); |
|
|
517 | assert (at->arch == at); // verify that refcnt == 1 is truely valid |
|
|
518 | allarch.erase (idx); |
|
|
519 | at->arch = 0; |
|
|
520 | at->more = 0; |
|
|
521 | at->destroy (); |
|
|
522 | } |
|
|
523 | } |
|
|
524 | while (--cnt); |
| 488 | } |
525 | } |
| 489 | |
526 | |
| 490 | /* |
527 | /* |
| 491 | * Creates and returns a new object which is a copy of the given archetype. |
528 | * Creates and returns a new object which is a copy of the given archetype. |
| 492 | * This function returns NULL on failure. |
529 | * This function returns NULL on failure. |
| … | |
… | |
| 503 | object *op = at->clone (); |
540 | object *op = at->clone (); |
| 504 | op->arch = at; |
541 | op->arch = at; |
| 505 | op->instantiate (); |
542 | op->instantiate (); |
| 506 | |
543 | |
| 507 | return op; |
544 | return op; |
|
|
545 | } |
|
|
546 | |
|
|
547 | object * |
|
|
548 | archetype::instance () |
|
|
549 | { |
|
|
550 | return arch_to_object (this); |
| 508 | } |
551 | } |
| 509 | |
552 | |
| 510 | /* |
553 | /* |
| 511 | * Creates an object. This function is called by get_archetype() |
554 | * Creates an object. This function is called by get_archetype() |
| 512 | * if it fails to find the appropriate archetype. |
555 | * if it fails to find the appropriate archetype. |
| … | |
… | |
| 520 | |
563 | |
| 521 | if (!strcmp (name, "bug")) |
564 | if (!strcmp (name, "bug")) |
| 522 | abort (); |
565 | abort (); |
| 523 | |
566 | |
| 524 | char buf[MAX_BUF]; |
567 | char buf[MAX_BUF]; |
| 525 | sprintf (buf, "bug, please report (%s)", ARCH_SINGULARITY, name); |
568 | sprintf (buf, "bug, please report (%s)", name); |
| 526 | |
569 | |
| 527 | object *op = get_archetype ("bug"); |
570 | object *op = get_archetype ("bug"); |
| 528 | op->name = op->name_pl = buf; |
571 | op->name = op->name_pl = buf; |
| 529 | |
572 | |
| 530 | return op; |
573 | return op; |
