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.94 by root, Fri Nov 6 12:49:19 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
50 50
51// the vector of other_arch references to be resolved 51// the vector of other_arch references to be resolved
52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; 52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
53// the vector of loaded but not yet committed archetypes 53// the vector of loaded but not yet committed archetypes
54static std::vector<archetype *> postponed_arch; 54static std::vector<archetype *> postponed_arch;
55
56//+GPL
57
58/*
59 * Creates an object. This function is called by get_archetype()
60 * if it fails to find the appropriate archetype.
61 * Thus get_archetype() will be guaranteed to always return
62 * an object, and never NULL.
63 */
64static object *
65create_singularity (const char *name)
66{
67 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
68
69 if (!strcmp (name, "bug"))
70 abort ();
71
72 object *op = archetype::get (shstr_bug);
73 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
74
75 return op;
76}
55 77
56/** 78/**
57 * GROS - This function retrieves an archetype given the name that appears 79 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 80 * during the game (for example, "writing pen" instead of "stylus").
59 * It does not use the hashtable system, but browse the whole archlist each time. 81 * It does not use the hashtable system, but browse the whole archlist each time.
103{ 125{
104 shstr_cmp skill_cmp (skill); 126 shstr_cmp skill_cmp (skill);
105 127
106 for_all_archetypes (at) 128 for_all_archetypes (at)
107 if (at->skill == skill_cmp && (type == -1 || type == at->type)) 129 if (at->skill == skill_cmp && (type == -1 || type == at->type))
108 return arch_to_object (at); 130 return at->instance ();
109 131
110 return 0; 132 return 0;
111} 133}
112 134
113/* similiar to above - this returns the first archetype 135/* similiar to above - this returns the first archetype
134 * - name: The name we're searching for (ex: "writing pen"); 156 * - name: The name we're searching for (ex: "writing pen");
135 * Return value: 157 * Return value:
136 * - a corresponding object if found; a singularity object if not found. 158 * - 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 159 * 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 160 * 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, 161 * doesn't allocate it each time - not that this function is used much,
140 * but it otherwise had a big memory leak. 162 * but it otherwise had a big memory leak.
141 */ 163 */
142object * 164object *
143get_archetype_by_object_name (const char *name) 165get_archetype_by_object_name (const char *name)
144{ 166{
145 char tmpname[MAX_BUF]; 167 char tmpname[MAX_BUF];
146 int i;
147 168
148 assign (tmpname, name); 169 assign (tmpname, name);
149 170
150 for (i = strlen (tmpname); i > 0; i--) 171 for (int i = strlen (tmpname); i > 0; i--)
151 { 172 {
152 tmpname[i] = 0; 173 tmpname[i] = 0;
153 174
154 if (archetype *at = find_archetype_by_object_name (tmpname)) 175 if (archetype *at = find_archetype_by_object_name (tmpname))
155 return arch_to_object (at); 176 return at->instance ();
156 } 177 }
157 178
158 return create_singularity (name); 179 return create_singularity (name);
159} 180}
160 181
194 return 1; 215 return 1;
195 216
196 /* unpaid is a little more specific */ 217 /* unpaid is a little more specific */
197 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 218 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
198 return 2; 219 return 2;
220
199 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 221 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
200 return 2; 222 return 2;
201 223
202 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 224 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
203 return 2; 225 return 2;
225 * is because of the 'else' handling - we don't want to match on 247 * is because of the 'else' handling - we don't want to match on
226 * something and set a low retval, even though it may match a higher retcal 248 * something and set a low retval, even though it may match a higher retcal
227 * later. So keep it in descending order here, so we try for the best 249 * later. So keep it in descending order here, so we try for the best
228 * match first, and work downward. 250 * match first, and work downward.
229 */ 251 */
252 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
253
230 if (!strcasecmp (cp, query_name (op))) 254 if (!strcasecmp (cp, query_name (op)))
231 retval = 20; 255 retval = 20;
232 else if (!strcasecmp (cp, query_short_name (op))) 256 else if (!strcasecmp (cp, qsn = query_short_name (op)))
233 retval = 18; 257 retval = 18;
234 else if (!strcasecmp (cp, query_base_name (op, 0))) 258 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
235 retval = 16; 259 retval = 16;
236 else if (!strcasecmp (cp, query_base_name (op, 1))) 260 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
237 retval = 16; 261 retval = 16;
238 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 262 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
239 retval = 15; 263 retval = 15;
240 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 264 else if (!strncasecmp (cp, qbn0, strlen (cp)))
241 retval = 14; 265 retval = 14;
242 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 266 else if (!strncasecmp (cp, qbn1, strlen (cp)))
243 retval = 14; 267 retval = 14;
244 /* Do substring checks, so things like 'Str+1' will match. 268 /* Do substring checks, so things like 'Str+1' will match.
245 * retval of these should perhaps be lower - they are lower 269 * retval of these should perhaps be lower - they are lower
246 * then the specific strcasecmp aboves, but still higher than 270 * then the specific strcasecmp aboves, but still higher than
247 * some other match criteria. 271 * some other match criteria.
248 */ 272 */
249 else if (strstr (query_base_name (op, 1), cp)) 273 else if (strstr (qbn1, cp))
250 retval = 12; 274 retval = 12;
251 else if (strstr (query_base_name (op, 0), cp)) 275 else if (strstr (qbn0, cp))
252 retval = 12; 276 retval = 12;
253 else if (strstr (query_short_name (op), cp)) 277 else if (strstr (qsn, cp))
254 retval = 12; 278 retval = 12;
255 /* Check against plural/non plural based on count. */ 279 /* Check against plural/non plural based on count. */
256 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 280 else if (count > 1 && !strcasecmp (cp, op->name_pl))
257 retval = 6; 281 retval = 6;
258 else if (count == 1 && !strcasecmp (op->name, cp)) 282 else if (count == 1 && !strcasecmp (op->name, cp))
259 retval = 6; 283 retval = 6;
260 /* base name matched - not bad */ 284 /* base name matched - not bad */
261 else if (strcasecmp (cp, op->name) == 0 && !count) 285 else if (strcasecmp (cp, op->name) == 0 && !count)
262 retval = 4; 286 retval = 4;
263 /* Check for partial custom name, but give a real low priority */ 287 /* Check for partial custom name, but give a real low priority */
264 else if (op->custom_name && strstr (op->custom_name, cp)) 288 else if (op->custom_name.contains (cp))
265 retval = 3; 289 retval = 3;
266 290
267 if (retval) 291 if (retval)
268 { 292 {
269 if (pl->type == PLAYER) 293 if (pl->type == PLAYER)
273 } 297 }
274 } 298 }
275 299
276 return 0; 300 return 0;
277} 301}
302
303//-GPL
278 304
279archetype::archetype (const char *name) 305archetype::archetype (const char *name)
280{ 306{
281 arch = this; 307 arch = this;
282 this->archname = this->name = this->name_pl = name; 308 this->archname = this->name = this->name_pl = name;
441 return new_head; 467 return new_head;
442 } 468 }
443 469
444fail: 470fail:
445 for (auto (p, parts.begin ()); p != parts.end (); ++p) 471 for (auto (p, parts.begin ()); p != parts.end (); ++p)
446 (*p)->destroy (true); 472 (*p)->destroy ();
447 473
448 return 0; 474 return 0;
449} 475}
450 476
451void 477void
511 537
512 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object 538 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
513 ++idx; 539 ++idx;
514 else 540 else
515 { 541 {
516 LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); 542 LOG (llevDebug, "garbage collect arch %s", &at->archname);
517 assert (at->arch == at); // verify that refcnt == 1 is truely valid 543 assert (at->arch == at); // verify that refcnt == 1 is truly valid
518 allarch.erase (idx); 544 allarch.erase (idx);
545
546 // break chain
547 for (object *op = at->head_ (); op; )
548 {
549 object *next = op->more;
550 op->head = 0;
551 op->more = 0;
552 op = next;
553 }
554
555 at->destroy ();
519 at->arch = 0; 556 at->arch = 0;
520 at->more = 0;
521 at->destroy ();
522 } 557 }
523 } 558 }
524 while (--cnt); 559 while (--cnt);
525}
526
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 *
532arch_to_object (archetype *at)
533{
534 if (!at)
535 {
536 LOG (llevError, "Couldn't find archetype.\n");
537 return 0;
538 }
539
540 object *op = at->clone ();
541 op->arch = at;
542 op->instantiate ();
543
544 return op;
545} 560}
546 561
547object * 562object *
548archetype::instance () 563archetype::instance ()
549{ 564{
550 return arch_to_object (this); 565 object *op = clone ();
551} 566 op->instantiate ();
552
553/*
554 * Creates an object. This function is called by get_archetype()
555 * if it fails to find the appropriate archetype.
556 * Thus get_archetype() will be guaranteed to always return
557 * an object, and never NULL.
558 */
559object *
560create_singularity (const char *name)
561{
562 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
563
564 if (!strcmp (name, "bug"))
565 abort ();
566
567 char buf[MAX_BUF];
568 sprintf (buf, "bug, please report (%s)", name);
569
570 object *op = get_archetype ("bug");
571 op->name = op->name_pl = buf;
572
573 return op; 567 return op;
574} 568}
569
570//+GPL
575 571
576/* 572/*
577 * Finds which archetype matches the given name, and returns a new 573 * Finds which archetype matches the given name, and returns a new
578 * object containing a copy of the archetype. 574 * object containing a copy of the archetype.
579 */ 575 */
580object * 576object *
581get_archetype (const char *name) 577get_archetype (const char *name)
582{ 578{
579 return archetype::get (name);
580}
581
582object *
583archetype::get (const char *name)
584{
583 archetype *at = archetype::find (name); 585 archetype *at = find (name);
584 586
585 if (!at) 587 if (!at)
586 return create_singularity (name); 588 return create_singularity (name);
587 589
588 return arch_to_object (at); 590 return at->instance ();
589} 591}
590 592
591/* 593/*
592 * Returns the first archetype using the given type. 594 * Returns the first archetype using the given type.
593 * Used in treasure-generation. 595 * Used in treasure-generation.
608 * Used in treasure-generation. 610 * Used in treasure-generation.
609 */ 611 */
610object * 612object *
611clone_arch (int type) 613clone_arch (int type)
612{ 614{
613 archetype *at; 615 archetype *at = type_to_archetype (type);
614 616
615 if ((at = type_to_archetype (type)) == NULL) 617 if (!at)
616 { 618 {
617 LOG (llevError, "Can't clone archetype %d\n", type); 619 LOG (llevError, "Can't clone archetype %d\n", type);
618 return 0; 620 return 0;
619 } 621 }
620 622
621 object *op = at->clone (); 623 return at->instance ();
622 op->instantiate ();
623 return op;
624} 624}
625 625
626/* 626/*
627 * member: make instance from class 627 * member: make instance from class
628 */ 628 */
631{ 631{
632 object *op, *prev = 0, *head = 0; 632 object *op, *prev = 0, *head = 0;
633 633
634 while (at) 634 while (at)
635 { 635 {
636 op = arch_to_object (at); 636 op = at->instance ();
637 637
638 op->x = at->x; 638 op->x = at->x;
639 op->y = at->y; 639 op->y = at->y;
640 640
641 if (head) 641 if (head)
649 } 649 }
650 650
651 return head; 651 return head;
652} 652}
653 653
654//-GPL
655

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines