1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
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 |
… | |
… | |
54 | static std::vector<archetype *> postponed_arch; |
53 | static std::vector<archetype *> postponed_arch; |
55 | |
54 | |
56 | //+GPL |
55 | //+GPL |
57 | |
56 | |
58 | /* |
57 | /* |
59 | * Creates an object. This function is called by get_archetype() |
58 | * Creates an object. This function is called by get_archetype () |
60 | * if it fails to find the appropriate archetype. |
59 | * if it fails to find the appropriate archetype. |
61 | * Thus get_archetype() will be guaranteed to always return |
60 | * Thus get_archetype() will be guaranteed to always return |
62 | * an object, and never NULL. |
61 | * an object, and never NULL. |
63 | */ |
62 | */ |
64 | object * |
63 | static object * |
65 | create_singularity (const char *name) |
64 | create_singularity (const char *name) |
66 | { |
65 | { |
67 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
66 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
68 | |
67 | |
69 | if (!strcmp (name, "bug")) |
68 | if (!strcmp (name, "bug")) |
… | |
… | |
213 | /* All is a very generic match - low match value */ |
212 | /* All is a very generic match - low match value */ |
214 | if (!strcmp (cp, "all")) |
213 | if (!strcmp (cp, "all")) |
215 | return 1; |
214 | return 1; |
216 | |
215 | |
217 | /* unpaid is a little more specific */ |
216 | /* unpaid is a little more specific */ |
218 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
217 | if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID]) |
219 | return 2; |
218 | return 2; |
220 | |
219 | |
221 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
220 | if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED])) |
222 | return 2; |
221 | return 2; |
223 | |
222 | |
224 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
223 | if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED]) |
225 | return 2; |
224 | return 2; |
226 | |
225 | |
227 | /* Allow for things like '100 arrows' */ |
226 | /* Allow for things like '100 arrows' */ |
228 | if ((count = atoi (cp)) != 0) |
227 | if ((count = atoi (cp)) != 0) |
229 | { |
228 | { |
… | |
… | |
300 | return 0; |
299 | return 0; |
301 | } |
300 | } |
302 | |
301 | |
303 | //-GPL |
302 | //-GPL |
304 | |
303 | |
|
|
304 | void |
|
|
305 | archetype::do_delete () |
|
|
306 | { |
|
|
307 | delete this; |
|
|
308 | } |
|
|
309 | |
305 | archetype::archetype (const char *name) |
310 | archetype::archetype (const char *name) |
306 | { |
311 | { |
307 | arch = this; |
312 | arch = this; |
308 | this->archname = this->name = this->name_pl = name; |
313 | this->archname = this->name = this->name_pl = name; |
309 | } |
314 | } |
… | |
… | |
349 | return 0; |
354 | return 0; |
350 | else |
355 | else |
351 | return i->second; |
356 | return i->second; |
352 | } |
357 | } |
353 | |
358 | |
|
|
359 | void |
|
|
360 | archetype::post_load_check () |
|
|
361 | { |
|
|
362 | assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL])); |
|
|
363 | |
|
|
364 | if (type == SKILL) |
|
|
365 | add_skill_archetype (this); |
|
|
366 | |
|
|
367 | object::post_load_check (); |
|
|
368 | } |
|
|
369 | |
354 | archetype * |
370 | archetype * |
355 | archetype::read (object_thawer &f) |
371 | archetype::read (object_thawer &f) |
356 | { |
372 | { |
357 | assert (f.kw == KW_object); |
373 | assert (f.kw == KW_object); |
358 | |
374 | |
… | |
… | |
367 | f.next (); |
383 | f.next (); |
368 | |
384 | |
369 | #if 0 |
385 | #if 0 |
370 | // implementing it here in the server does neither allow multiple inheritence |
386 | // implementing it here in the server does neither allow multiple inheritence |
371 | // nor does it cleanly "just override". it would allow use in map files, though, |
387 | // nor does it cleanly "just override". it would allow use in map files, though, |
372 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
388 | // and other resource files dynamically loaded (as opposed to being preprocessed). |
373 | // not that any of this is relevant as of yet... |
389 | // not that any of this is relevant as of yet... |
374 | if (f.kw == KW_inherit) |
390 | if (f.kw == KW_inherit) |
375 | { |
391 | { |
376 | if (archetype *at = find (f.get_str ())) |
392 | if (archetype *at = find (f.get_str ())) |
377 | *op = at->clone; |
393 | *op = at->clone; |
… | |
… | |
434 | goto fail; |
450 | goto fail; |
435 | } |
451 | } |
436 | } |
452 | } |
437 | |
453 | |
438 | // assemble new chain |
454 | // assemble new chain |
439 | new_head->min_x = new_head->max_x = new_head->x; |
455 | new_head->max_x = new_head->x; |
440 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
441 | |
456 | |
442 | archetype *less = new_head; |
457 | archetype *less = new_head; |
443 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
458 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
444 | { |
459 | { |
445 | archetype *at = *p; |
460 | archetype *at = *p; |
… | |
… | |
450 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
465 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
451 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
466 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
452 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
467 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
453 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
468 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
454 | |
469 | |
455 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
456 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
457 | new_head->max_x = max (new_head->max_x, at->x); |
470 | new_head->max_x = max (new_head->max_x, at->x); |
458 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
459 | |
471 | |
460 | at->head = new_head; |
472 | at->head = new_head; |
461 | less->more = at; |
473 | less->more = at; |
462 | less = at; |
474 | less = at; |
463 | } |
475 | } |
… | |
… | |
537 | |
549 | |
538 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
550 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
539 | ++idx; |
551 | ++idx; |
540 | else |
552 | else |
541 | { |
553 | { |
542 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
554 | //LOG (llevDebug, "garbage collect arch %s", &at->archname); |
543 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
555 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
544 | allarch.erase (idx); |
556 | allarch.erase (idx); |
545 | |
557 | |
546 | // break chain |
558 | // break chain |
547 | for (object *op = at->head_ (); op; ) |
559 | for (object *op = at->head_ (); op; ) |
… | |
… | |
592 | |
604 | |
593 | /* |
605 | /* |
594 | * Returns the first archetype using the given type. |
606 | * Returns the first archetype using the given type. |
595 | * Used in treasure-generation. |
607 | * Used in treasure-generation. |
596 | */ |
608 | */ |
597 | archetype * |
609 | static archetype * |
598 | type_to_archetype (int type) |
610 | type_to_archetype (int type) |
599 | { |
611 | { |
600 | for_all_archetypes (at) |
612 | for_all_archetypes (at) |
601 | if (at->type == type && at->head_ () != at) |
613 | if (at->type == type && at->head_ () != at) |
602 | return at; |
614 | return at; |