… | |
… | |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
28 | #include <loader.h> |
|
|
29 | |
28 | |
30 | #include <tr1/functional> |
29 | #include <tr1/functional> |
31 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
32 | |
31 | |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
… | |
… | |
52 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
53 | // the vector of loaded but not yet committed archetypes |
52 | // the vector of loaded but not yet committed archetypes |
54 | static std::vector<archetype *> postponed_arch; |
53 | static std::vector<archetype *> postponed_arch; |
55 | |
54 | |
56 | //+GPL |
55 | //+GPL |
|
|
56 | |
|
|
57 | /* |
|
|
58 | * Creates an object. This function is called by get_archetype () |
|
|
59 | * if it fails to find the appropriate archetype. |
|
|
60 | * Thus get_archetype() will be guaranteed to always return |
|
|
61 | * an object, and never NULL. |
|
|
62 | */ |
|
|
63 | static object * |
|
|
64 | create_singularity (const char *name) |
|
|
65 | { |
|
|
66 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
67 | |
|
|
68 | if (!strcmp (name, "bug")) |
|
|
69 | abort (); |
|
|
70 | |
|
|
71 | object *op = archetype::get (shstr_bug); |
|
|
72 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
73 | |
|
|
74 | return op; |
|
|
75 | } |
57 | |
76 | |
58 | /** |
77 | /** |
59 | * GROS - This function retrieves an archetype given the name that appears |
78 | * GROS - This function retrieves an archetype given the name that appears |
60 | * during the game (for example, "writing pen" instead of "stylus"). |
79 | * during the game (for example, "writing pen" instead of "stylus"). |
61 | * It does not use the hashtable system, but browse the whole archlist each time. |
80 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
329 | return 0; |
348 | return 0; |
330 | else |
349 | else |
331 | return i->second; |
350 | return i->second; |
332 | } |
351 | } |
333 | |
352 | |
|
|
353 | void |
|
|
354 | archetype::post_load_check () |
|
|
355 | { |
|
|
356 | object::post_load_check (); |
|
|
357 | |
|
|
358 | assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL])); |
|
|
359 | } |
|
|
360 | |
334 | archetype * |
361 | archetype * |
335 | archetype::read (object_thawer &f) |
362 | archetype::read (object_thawer &f) |
336 | { |
363 | { |
337 | assert (f.kw == KW_object); |
364 | assert (f.kw == KW_object); |
338 | |
365 | |
… | |
… | |
414 | goto fail; |
441 | goto fail; |
415 | } |
442 | } |
416 | } |
443 | } |
417 | |
444 | |
418 | // assemble new chain |
445 | // assemble new chain |
419 | new_head->min_x = new_head->max_x = new_head->x; |
446 | new_head->max_x = new_head->x; |
420 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
421 | |
447 | |
422 | archetype *less = new_head; |
448 | archetype *less = new_head; |
423 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
449 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
424 | { |
450 | { |
425 | archetype *at = *p; |
451 | archetype *at = *p; |
… | |
… | |
430 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
456 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
431 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
457 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
432 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
458 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
433 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
459 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
434 | |
460 | |
435 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
436 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
437 | new_head->max_x = max (new_head->max_x, at->x); |
461 | new_head->max_x = max (new_head->max_x, at->x); |
438 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
439 | |
462 | |
440 | at->head = new_head; |
463 | at->head = new_head; |
441 | less->more = at; |
464 | less->more = at; |
442 | less = at; |
465 | less = at; |
443 | } |
466 | } |
… | |
… | |
548 | } |
571 | } |
549 | |
572 | |
550 | //+GPL |
573 | //+GPL |
551 | |
574 | |
552 | /* |
575 | /* |
553 | * Creates an object. This function is called by get_archetype() |
|
|
554 | * if it fails to find the appropriate archetype. |
|
|
555 | * Thus get_archetype() will be guaranteed to always return |
|
|
556 | * an object, and never NULL. |
|
|
557 | */ |
|
|
558 | object * |
|
|
559 | create_singularity (const char *name) |
|
|
560 | { |
|
|
561 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
562 | |
|
|
563 | if (!strcmp (name, "bug")) |
|
|
564 | abort (); |
|
|
565 | |
|
|
566 | object *op = archetype::get (shstr_bug); |
|
|
567 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
568 | |
|
|
569 | return op; |
|
|
570 | } |
|
|
571 | |
|
|
572 | /* |
|
|
573 | * Finds which archetype matches the given name, and returns a new |
576 | * Finds which archetype matches the given name, and returns a new |
574 | * object containing a copy of the archetype. |
577 | * object containing a copy of the archetype. |
575 | */ |
578 | */ |
576 | object * |
579 | object * |
577 | get_archetype (const char *name) |
580 | get_archetype (const char *name) |
… | |
… | |
592 | |
595 | |
593 | /* |
596 | /* |
594 | * Returns the first archetype using the given type. |
597 | * Returns the first archetype using the given type. |
595 | * Used in treasure-generation. |
598 | * Used in treasure-generation. |
596 | */ |
599 | */ |
597 | archetype * |
600 | static archetype * |
598 | type_to_archetype (int type) |
601 | type_to_archetype (int type) |
599 | { |
602 | { |
600 | for_all_archetypes (at) |
603 | for_all_archetypes (at) |
601 | if (at->type == type && at->head_ () != at) |
604 | if (at->type == type && at->head_ () != at) |
602 | return at; |
605 | return at; |