… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License 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 |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <cassert> |
25 | #include <cassert> |
… | |
… | |
102 | { |
103 | { |
103 | shstr_cmp skill_cmp (skill); |
104 | shstr_cmp skill_cmp (skill); |
104 | |
105 | |
105 | for_all_archetypes (at) |
106 | for_all_archetypes (at) |
106 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
107 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
107 | return arch_to_object (at); |
108 | return at->instance (); |
108 | |
109 | |
109 | return 0; |
110 | return 0; |
110 | } |
111 | } |
111 | |
112 | |
112 | /* similiar to above - this returns the first archetype |
113 | /* similiar to above - this returns the first archetype |
… | |
… | |
133 | * - name: The name we're searching for (ex: "writing pen"); |
134 | * - name: The name we're searching for (ex: "writing pen"); |
134 | * Return value: |
135 | * Return value: |
135 | * - a corresponding object if found; a singularity object if not found. |
136 | * - a corresponding object if found; a singularity object if not found. |
136 | * Note by MSW - it appears that it takes the full name and keeps |
137 | * Note by MSW - it appears that it takes the full name and keeps |
137 | * shortening it until it finds a match. I re-wrote this so that it |
138 | * shortening it until it finds a match. I re-wrote this so that it |
138 | * doesn't malloc it each time - not that this function is used much, |
139 | * doesn't allocate it each time - not that this function is used much, |
139 | * but it otherwise had a big memory leak. |
140 | * but it otherwise had a big memory leak. |
140 | */ |
141 | */ |
141 | object * |
142 | object * |
142 | get_archetype_by_object_name (const char *name) |
143 | get_archetype_by_object_name (const char *name) |
143 | { |
144 | { |
… | |
… | |
149 | for (i = strlen (tmpname); i > 0; i--) |
150 | for (i = strlen (tmpname); i > 0; i--) |
150 | { |
151 | { |
151 | tmpname[i] = 0; |
152 | tmpname[i] = 0; |
152 | |
153 | |
153 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
154 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
154 | return arch_to_object (at); |
155 | return at->instance (); |
155 | } |
156 | } |
156 | |
157 | |
157 | return create_singularity (name); |
158 | return create_singularity (name); |
158 | } |
159 | } |
159 | |
160 | |
… | |
… | |
258 | retval = 6; |
259 | retval = 6; |
259 | /* base name matched - not bad */ |
260 | /* base name matched - not bad */ |
260 | else if (strcasecmp (cp, op->name) == 0 && !count) |
261 | else if (strcasecmp (cp, op->name) == 0 && !count) |
261 | retval = 4; |
262 | retval = 4; |
262 | /* Check for partial custom name, but give a real low priority */ |
263 | /* Check for partial custom name, but give a real low priority */ |
263 | else if (op->custom_name && strstr (op->custom_name, cp)) |
264 | else if (op->custom_name.contains (cp)) |
264 | retval = 3; |
265 | retval = 3; |
265 | |
266 | |
266 | if (retval) |
267 | if (retval) |
267 | { |
268 | { |
268 | if (pl->type == PLAYER) |
269 | if (pl->type == PLAYER) |
… | |
… | |
440 | return new_head; |
441 | return new_head; |
441 | } |
442 | } |
442 | |
443 | |
443 | fail: |
444 | fail: |
444 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
445 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
445 | (*p)->destroy (true); |
446 | (*p)->destroy (); |
446 | |
447 | |
447 | return 0; |
448 | return 0; |
448 | } |
449 | } |
449 | |
450 | |
450 | void |
451 | void |
… | |
… | |
510 | |
511 | |
511 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
512 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
512 | ++idx; |
513 | ++idx; |
513 | else |
514 | else |
514 | { |
515 | { |
515 | LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); |
516 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
516 | assert (at->arch == at); // verify that refcnt == 1 is truely valid |
517 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
517 | allarch.erase (idx); |
518 | allarch.erase (idx); |
|
|
519 | |
|
|
520 | // break chain |
|
|
521 | for (object *op = at->head_ (); op; ) |
|
|
522 | { |
|
|
523 | object *next = op->more; |
|
|
524 | op->head = 0; |
|
|
525 | op->more = 0; |
|
|
526 | op = next; |
|
|
527 | } |
|
|
528 | |
|
|
529 | at->destroy (); |
518 | at->arch = 0; |
530 | at->arch = 0; |
519 | at->more = 0; |
|
|
520 | at->destroy (); |
|
|
521 | } |
531 | } |
522 | } |
532 | } |
523 | while (--cnt); |
533 | while (--cnt); |
524 | } |
534 | } |
525 | |
535 | |
526 | /* |
|
|
527 | * Creates and returns a new object which is a copy of the given archetype. |
|
|
528 | * This function returns NULL on failure. |
|
|
529 | */ |
|
|
530 | object * |
536 | object * |
531 | arch_to_object (archetype *at) |
537 | archetype::instance () |
532 | { |
538 | { |
533 | if (!at) |
|
|
534 | { |
|
|
535 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
536 | return 0; |
|
|
537 | } |
|
|
538 | |
|
|
539 | object *op = at->clone (); |
539 | object *op = clone (); |
540 | op->arch = at; |
|
|
541 | op->instantiate (); |
540 | op->instantiate (); |
542 | |
|
|
543 | return op; |
541 | return op; |
544 | } |
|
|
545 | |
|
|
546 | object * |
|
|
547 | archetype::instance () |
|
|
548 | { |
|
|
549 | return arch_to_object (this); |
|
|
550 | } |
542 | } |
551 | |
543 | |
552 | /* |
544 | /* |
553 | * Creates an object. This function is called by get_archetype() |
545 | * Creates an object. This function is called by get_archetype() |
554 | * if it fails to find the appropriate archetype. |
546 | * if it fails to find the appropriate archetype. |
… | |
… | |
561 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
553 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
562 | |
554 | |
563 | if (!strcmp (name, "bug")) |
555 | if (!strcmp (name, "bug")) |
564 | abort (); |
556 | abort (); |
565 | |
557 | |
566 | char buf[MAX_BUF]; |
|
|
567 | sprintf (buf, "bug, please report (%s)", name); |
|
|
568 | |
|
|
569 | object *op = get_archetype ("bug"); |
558 | object *op = archetype::get (shstr_bug); |
570 | op->name = op->name_pl = buf; |
559 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
571 | |
560 | |
572 | return op; |
561 | return op; |
573 | } |
562 | } |
574 | |
563 | |
575 | /* |
564 | /* |
… | |
… | |
577 | * object containing a copy of the archetype. |
566 | * object containing a copy of the archetype. |
578 | */ |
567 | */ |
579 | object * |
568 | object * |
580 | get_archetype (const char *name) |
569 | get_archetype (const char *name) |
581 | { |
570 | { |
|
|
571 | return archetype::get (name); |
|
|
572 | } |
|
|
573 | |
|
|
574 | object * |
|
|
575 | archetype::get (const char *name) |
|
|
576 | { |
582 | archetype *at = archetype::find (name); |
577 | archetype *at = find (name); |
583 | |
578 | |
584 | if (!at) |
579 | if (!at) |
585 | return create_singularity (name); |
580 | return create_singularity (name); |
586 | |
581 | |
587 | return arch_to_object (at); |
582 | return at->instance (); |
588 | } |
|
|
589 | |
|
|
590 | object * |
|
|
591 | archetype::get (const char *name) |
|
|
592 | { |
|
|
593 | return get_archetype (name); |
|
|
594 | } |
583 | } |
595 | |
584 | |
596 | /* |
585 | /* |
597 | * Returns the first archetype using the given type. |
586 | * Returns the first archetype using the given type. |
598 | * Used in treasure-generation. |
587 | * Used in treasure-generation. |
… | |
… | |
613 | * Used in treasure-generation. |
602 | * Used in treasure-generation. |
614 | */ |
603 | */ |
615 | object * |
604 | object * |
616 | clone_arch (int type) |
605 | clone_arch (int type) |
617 | { |
606 | { |
618 | archetype *at; |
607 | archetype *at = type_to_archetype (type); |
619 | |
608 | |
620 | if ((at = type_to_archetype (type)) == NULL) |
609 | if (!at) |
621 | { |
610 | { |
622 | LOG (llevError, "Can't clone archetype %d\n", type); |
611 | LOG (llevError, "Can't clone archetype %d\n", type); |
623 | return 0; |
612 | return 0; |
624 | } |
613 | } |
625 | |
614 | |
626 | object *op = at->clone (); |
615 | return at->instance (); |
627 | op->instantiate (); |
|
|
628 | return op; |
|
|
629 | } |
616 | } |
630 | |
617 | |
631 | /* |
618 | /* |
632 | * member: make instance from class |
619 | * member: make instance from class |
633 | */ |
620 | */ |
… | |
… | |
636 | { |
623 | { |
637 | object *op, *prev = 0, *head = 0; |
624 | object *op, *prev = 0, *head = 0; |
638 | |
625 | |
639 | while (at) |
626 | while (at) |
640 | { |
627 | { |
641 | op = arch_to_object (at); |
628 | op = at->instance (); |
642 | |
629 | |
643 | op->x = at->x; |
630 | op->x = at->x; |
644 | op->y = at->y; |
631 | op->y = at->y; |
645 | |
632 | |
646 | if (head) |
633 | if (head) |