ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.74 by root, Sun Apr 20 05:24:55 2008 UTC vs.
Revision 1.89 by root, Mon Oct 12 14:00:57 2009 UTC

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>
25 26
26#include <global.h> 27#include <global.h>
27#include <funcpoint.h>
28#include <loader.h> 28#include <loader.h>
29 29
30#include <tr1/functional> 30#include <tr1/functional>
31#include <tr1/unordered_map> 31#include <tr1/unordered_map>
32 32
103{ 103{
104 shstr_cmp skill_cmp (skill); 104 shstr_cmp skill_cmp (skill);
105 105
106 for_all_archetypes (at) 106 for_all_archetypes (at)
107 if (at->skill == skill_cmp && (type == -1 || type == at->type)) 107 if (at->skill == skill_cmp && (type == -1 || type == at->type))
108 return arch_to_object (at); 108 return at->instance ();
109 109
110 return 0; 110 return 0;
111} 111}
112 112
113/* similiar to above - this returns the first archetype 113/* similiar to above - this returns the first archetype
134 * - name: The name we're searching for (ex: "writing pen"); 134 * - name: The name we're searching for (ex: "writing pen");
135 * Return value: 135 * Return value:
136 * - a corresponding object if found; a singularity object if not found. 136 * - a corresponding object if found; a singularity object if not found.
137 * 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
138 * 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
139 * 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,
140 * but it otherwise had a big memory leak. 140 * but it otherwise had a big memory leak.
141 */ 141 */
142object * 142object *
143get_archetype_by_object_name (const char *name) 143get_archetype_by_object_name (const char *name)
144{ 144{
150 for (i = strlen (tmpname); i > 0; i--) 150 for (i = strlen (tmpname); i > 0; i--)
151 { 151 {
152 tmpname[i] = 0; 152 tmpname[i] = 0;
153 153
154 if (archetype *at = find_archetype_by_object_name (tmpname)) 154 if (archetype *at = find_archetype_by_object_name (tmpname))
155 return arch_to_object (at); 155 return at->instance ();
156 } 156 }
157 157
158 return create_singularity (name); 158 return create_singularity (name);
159} 159}
160 160
259 retval = 6; 259 retval = 6;
260 /* base name matched - not bad */ 260 /* base name matched - not bad */
261 else if (strcasecmp (cp, op->name) == 0 && !count) 261 else if (strcasecmp (cp, op->name) == 0 && !count)
262 retval = 4; 262 retval = 4;
263 /* Check for partial custom name, but give a real low priority */ 263 /* Check for partial custom name, but give a real low priority */
264 else if (op->custom_name && strstr (op->custom_name, cp)) 264 else if (op->custom_name.contains (cp))
265 retval = 3; 265 retval = 3;
266 266
267 if (retval) 267 if (retval)
268 { 268 {
269 if (pl->type == PLAYER) 269 if (pl->type == PLAYER)
441 return new_head; 441 return new_head;
442 } 442 }
443 443
444fail: 444fail:
445 for (auto (p, parts.begin ()); p != parts.end (); ++p) 445 for (auto (p, parts.begin ()); p != parts.end (); ++p)
446 (*p)->destroy (true); 446 (*p)->destroy ();
447 447
448 return 0; 448 return 0;
449} 449}
450 450
451void 451void
511 511
512 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
513 ++idx; 513 ++idx;
514 else 514 else
515 { 515 {
516 LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); 516 LOG (llevDebug, "garbage collect arch %s", &at->archname);
517 assert (at->arch == at); // verify that refcnt == 1 is truely valid 517 assert (at->arch == at); // verify that refcnt == 1 is truly valid
518 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 ();
519 at->arch = 0; 530 at->arch = 0;
520 at->more = 0;
521 at->destroy ();
522 } 531 }
523 } 532 }
524 while (--cnt); 533 while (--cnt);
525} 534}
526 535
527/*
528 * Creates and returns a new object which is a copy of the given archetype.
529 * This function returns NULL on failure.
530 */
531object * 536object *
532arch_to_object (archetype *at) 537archetype::instance ()
533{ 538{
534 if (!at)
535 {
536 LOG (llevError, "Couldn't find archetype.\n");
537 return 0;
538 }
539
540 object *op = at->clone (); 539 object *op = clone ();
541 op->arch = at;
542 op->instantiate (); 540 op->instantiate ();
543
544 return op; 541 return op;
545}
546
547object *
548archetype::instance ()
549{
550 return arch_to_object (this);
551} 542}
552 543
553/* 544/*
554 * Creates an object. This function is called by get_archetype() 545 * Creates an object. This function is called by get_archetype()
555 * if it fails to find the appropriate archetype. 546 * if it fails to find the appropriate archetype.
562 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); 553 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
563 554
564 if (!strcmp (name, "bug")) 555 if (!strcmp (name, "bug"))
565 abort (); 556 abort ();
566 557
567 char buf[MAX_BUF];
568 sprintf (buf, "bug, please report (%s)", name);
569
570 object *op = get_archetype ("bug"); 558 object *op = archetype::get (shstr_bug);
571 op->name = op->name_pl = buf; 559 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
572 560
573 return op; 561 return op;
574} 562}
575 563
576/* 564/*
578 * object containing a copy of the archetype. 566 * object containing a copy of the archetype.
579 */ 567 */
580object * 568object *
581get_archetype (const char *name) 569get_archetype (const char *name)
582{ 570{
571 return archetype::get (name);
572}
573
574object *
575archetype::get (const char *name)
576{
583 archetype *at = archetype::find (name); 577 archetype *at = find (name);
584 578
585 if (!at) 579 if (!at)
586 return create_singularity (name); 580 return create_singularity (name);
587 581
588 return arch_to_object (at); 582 return at->instance ();
589} 583}
590 584
591/* 585/*
592 * Returns the first archetype using the given type. 586 * Returns the first archetype using the given type.
593 * Used in treasure-generation. 587 * Used in treasure-generation.
608 * Used in treasure-generation. 602 * Used in treasure-generation.
609 */ 603 */
610object * 604object *
611clone_arch (int type) 605clone_arch (int type)
612{ 606{
613 archetype *at; 607 archetype *at = type_to_archetype (type);
614 608
615 if ((at = type_to_archetype (type)) == NULL) 609 if (!at)
616 { 610 {
617 LOG (llevError, "Can't clone archetype %d\n", type); 611 LOG (llevError, "Can't clone archetype %d\n", type);
618 return 0; 612 return 0;
619 } 613 }
620 614
621 object *op = at->clone (); 615 return at->instance ();
622 op->instantiate ();
623 return op;
624} 616}
625 617
626/* 618/*
627 * member: make instance from class 619 * member: make instance from class
628 */ 620 */
631{ 623{
632 object *op, *prev = 0, *head = 0; 624 object *op, *prev = 0, *head = 0;
633 625
634 while (at) 626 while (at)
635 { 627 {
636 op = arch_to_object (at); 628 op = at->instance ();
637 629
638 op->x = at->x; 630 op->x = at->x;
639 op->y = at->y; 631 op->y = at->y;
640 632
641 if (head) 633 if (head)

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines