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.77 by root, Wed Apr 30 08:29:31 2008 UTC vs.
Revision 1.97 by root, Sun Nov 8 22:28:10 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>
… …
49 50
50// the vector of other_arch references to be resolved 51// the vector of other_arch references to be resolved
51static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; 52static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
52// the vector of loaded but not yet committed archetypes 53// the vector of loaded but not yet committed archetypes
53static 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}
54 77
55/** 78/**
56 * GROS - This function retrieves an archetype given the name that appears 79 * GROS - This function retrieves an archetype given the name that appears
57 * during the game (for example, "writing pen" instead of "stylus"). 80 * during the game (for example, "writing pen" instead of "stylus").
58 * 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.
… …
102{ 125{
103 shstr_cmp skill_cmp (skill); 126 shstr_cmp skill_cmp (skill);
104 127
105 for_all_archetypes (at) 128 for_all_archetypes (at)
106 if (at->skill == skill_cmp && (type == -1 || type == at->type)) 129 if (at->skill == skill_cmp && (type == -1 || type == at->type))
107 return arch_to_object (at); 130 return at->instance ();
108 131
109 return 0; 132 return 0;
110} 133}
111 134
112/* similiar to above - this returns the first archetype 135/* similiar to above - this returns the first archetype
… …
133 * - name: The name we're searching for (ex: "writing pen"); 156 * - name: The name we're searching for (ex: "writing pen");
134 * Return value: 157 * Return value:
135 * - a corresponding object if found; a singularity object if not found. 158 * - 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 159 * 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 160 * 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, 161 * doesn't allocate it each time - not that this function is used much,
139 * but it otherwise had a big memory leak. 162 * but it otherwise had a big memory leak.
140 */ 163 */
141object * 164object *
142get_archetype_by_object_name (const char *name) 165get_archetype_by_object_name (const char *name)
143{ 166{
144 char tmpname[MAX_BUF]; 167 char tmpname[MAX_BUF];
145 int i;
146 168
147 assign (tmpname, name); 169 assign (tmpname, name);
148 170
149 for (i = strlen (tmpname); i > 0; i--) 171 for (int i = strlen (tmpname); i > 0; i--)
150 { 172 {
151 tmpname[i] = 0; 173 tmpname[i] = 0;
152 174
153 if (archetype *at = find_archetype_by_object_name (tmpname)) 175 if (archetype *at = find_archetype_by_object_name (tmpname))
154 return arch_to_object (at); 176 return at->instance ();
155 } 177 }
156 178
157 return create_singularity (name); 179 return create_singularity (name);
158} 180}
159 181
… …
193 return 1; 215 return 1;
194 216
195 /* unpaid is a little more specific */ 217 /* unpaid is a little more specific */
196 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 218 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
197 return 2; 219 return 2;
220
198 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)))
199 return 2; 222 return 2;
200 223
201 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 224 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
202 return 2; 225 return 2;
… …
224 * 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
225 * 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
226 * 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
227 * match first, and work downward. 250 * match first, and work downward.
228 */ 251 */
252 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
253
229 if (!strcasecmp (cp, query_name (op))) 254 if (!strcasecmp (cp, query_name (op)))
230 retval = 20; 255 retval = 20;
231 else if (!strcasecmp (cp, query_short_name (op))) 256 else if (!strcasecmp (cp, qsn = query_short_name (op)))
232 retval = 18; 257 retval = 18;
233 else if (!strcasecmp (cp, query_base_name (op, 0))) 258 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
234 retval = 16; 259 retval = 16;
235 else if (!strcasecmp (cp, query_base_name (op, 1))) 260 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
236 retval = 16; 261 retval = 16;
237 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 262 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
238 retval = 15; 263 retval = 15;
239 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 264 else if (!strncasecmp (cp, qbn0, strlen (cp)))
240 retval = 14; 265 retval = 14;
241 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 266 else if (!strncasecmp (cp, qbn1, strlen (cp)))
242 retval = 14; 267 retval = 14;
243 /* Do substring checks, so things like 'Str+1' will match. 268 /* Do substring checks, so things like 'Str+1' will match.
244 * retval of these should perhaps be lower - they are lower 269 * retval of these should perhaps be lower - they are lower
245 * then the specific strcasecmp aboves, but still higher than 270 * then the specific strcasecmp aboves, but still higher than
246 * some other match criteria. 271 * some other match criteria.
247 */ 272 */
248 else if (strstr (query_base_name (op, 1), cp)) 273 else if (strstr (qbn1, cp))
249 retval = 12; 274 retval = 12;
250 else if (strstr (query_base_name (op, 0), cp)) 275 else if (strstr (qbn0, cp))
251 retval = 12; 276 retval = 12;
252 else if (strstr (query_short_name (op), cp)) 277 else if (strstr (qsn, cp))
253 retval = 12; 278 retval = 12;
254 /* Check against plural/non plural based on count. */ 279 /* Check against plural/non plural based on count. */
255 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 280 else if (count > 1 && !strcasecmp (cp, op->name_pl))
256 retval = 6; 281 retval = 6;
257 else if (count == 1 && !strcasecmp (op->name, cp)) 282 else if (count == 1 && !strcasecmp (op->name, cp))
258 retval = 6; 283 retval = 6;
259 /* base name matched - not bad */ 284 /* base name matched - not bad */
260 else if (strcasecmp (cp, op->name) == 0 && !count) 285 else if (strcasecmp (cp, op->name) == 0 && !count)
261 retval = 4; 286 retval = 4;
262 /* Check for partial custom name, but give a real low priority */ 287 /* Check for partial custom name, but give a real low priority */
263 else if (op->custom_name && strstr (op->custom_name, cp)) 288 else if (op->custom_name.contains (cp))
264 retval = 3; 289 retval = 3;
265 290
266 if (retval) 291 if (retval)
267 { 292 {
268 if (pl->type == PLAYER) 293 if (pl->type == PLAYER)
… …
273 } 298 }
274 299
275 return 0; 300 return 0;
276} 301}
277 302
303//-GPL
304
278archetype::archetype (const char *name) 305archetype::archetype (const char *name)
279{ 306{
280 arch = this; 307 arch = this;
281 this->archname = this->name = this->name_pl = name; 308 this->archname = this->name = this->name_pl = name;
282} 309}
… …
320 347
321 if (i == ht.end ()) 348 if (i == ht.end ())
322 return 0; 349 return 0;
323 else 350 else
324 return i->second; 351 return i->second;
352}
353
354void
355archetype::post_load_check ()
356{
357 object::post_load_check ();
358
359 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
325} 360}
326 361
327archetype * 362archetype *
328archetype::read (object_thawer &f) 363archetype::read (object_thawer &f)
329{ 364{
… …
440 return new_head; 475 return new_head;
441 } 476 }
442 477
443fail: 478fail:
444 for (auto (p, parts.begin ()); p != parts.end (); ++p) 479 for (auto (p, parts.begin ()); p != parts.end (); ++p)
445 (*p)->destroy (true); 480 (*p)->destroy ();
446 481
447 return 0; 482 return 0;
448} 483}
449 484
450void 485void
… …
510 545
511 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object 546 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
512 ++idx; 547 ++idx;
513 else 548 else
514 { 549 {
515 LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); 550 LOG (llevDebug, "garbage collect arch %s", &at->archname);
516 assert (at->arch == at); // verify that refcnt == 1 is truely valid 551 assert (at->arch == at); // verify that refcnt == 1 is truly valid
517 allarch.erase (idx); 552 allarch.erase (idx);
518 553
519 // break chain 554 // break chain
520 for (object *op = at->head_ (); op; ) 555 for (object *op = at->head_ (); op; )
521 { 556 {
… …
530 } 565 }
531 } 566 }
532 while (--cnt); 567 while (--cnt);
533} 568}
534 569
535/*
536 * Creates and returns a new object which is a copy of the given archetype.
537 * This function returns NULL on failure.
538 */
539object *
540arch_to_object (archetype *at)
541{
542 if (!at)
543 {
544 LOG (llevError, "Couldn't find archetype.\n");
545 return 0;
546 }
547
548 object *op = at->clone ();
549 op->arch = at;
550 op->instantiate ();
551
552 return op;
553}
554
555object * 570object *
556archetype::instance () 571archetype::instance ()
557{ 572{
558 return arch_to_object (this); 573 object *op = clone ();
559} 574 op->instantiate ();
560
561/*
562 * Creates an object. This function is called by get_archetype()
563 * if it fails to find the appropriate archetype.
564 * Thus get_archetype() will be guaranteed to always return
565 * an object, and never NULL.
566 */
567object *
568create_singularity (const char *name)
569{
570 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
571
572 if (!strcmp (name, "bug"))
573 abort ();
574
575 char buf[MAX_BUF];
576 sprintf (buf, "bug, please report (%s)", name);
577
578 object *op = get_archetype ("bug");
579 op->name = op->name_pl = buf;
580
581 return op; 575 return op;
582} 576}
577
578//+GPL
583 579
584/* 580/*
585 * Finds which archetype matches the given name, and returns a new 581 * Finds which archetype matches the given name, and returns a new
586 * object containing a copy of the archetype. 582 * object containing a copy of the archetype.
587 */ 583 */
588object * 584object *
589get_archetype (const char *name) 585get_archetype (const char *name)
590{ 586{
587 return archetype::get (name);
588}
589
590object *
591archetype::get (const char *name)
592{
591 archetype *at = archetype::find (name); 593 archetype *at = find (name);
592 594
593 if (!at) 595 if (!at)
594 return create_singularity (name); 596 return create_singularity (name);
595 597
596 return arch_to_object (at); 598 return at->instance ();
597}
598
599object *
600archetype::get (const char *name)
601{
602 return get_archetype (name);
603} 599}
604 600
605/* 601/*
606 * Returns the first archetype using the given type. 602 * Returns the first archetype using the given type.
607 * Used in treasure-generation. 603 * Used in treasure-generation.
608 */ 604 */
609archetype * 605static archetype *
610type_to_archetype (int type) 606type_to_archetype (int type)
611{ 607{
612 for_all_archetypes (at) 608 for_all_archetypes (at)
613 if (at->type == type && at->head_ () != at) 609 if (at->type == type && at->head_ () != at)
614 return at; 610 return at;
… …
622 * Used in treasure-generation. 618 * Used in treasure-generation.
623 */ 619 */
624object * 620object *
625clone_arch (int type) 621clone_arch (int type)
626{ 622{
627 archetype *at; 623 archetype *at = type_to_archetype (type);
628 624
629 if ((at = type_to_archetype (type)) == NULL) 625 if (!at)
630 { 626 {
631 LOG (llevError, "Can't clone archetype %d\n", type); 627 LOG (llevError, "Can't clone archetype %d\n", type);
632 return 0; 628 return 0;
633 } 629 }
634 630
635 object *op = at->clone (); 631 return at->instance ();
636 op->instantiate ();
637 return op;
638} 632}
639 633
640/* 634/*
641 * member: make instance from class 635 * member: make instance from class
642 */ 636 */
… …
645{ 639{
646 object *op, *prev = 0, *head = 0; 640 object *op, *prev = 0, *head = 0;
647 641
648 while (at) 642 while (at)
649 { 643 {
650 op = arch_to_object (at); 644 op = at->instance ();
651 645
652 op->x = at->x; 646 op->x = at->x;
653 op->y = at->y; 647 op->y = at->y;
654 648
655 if (head) 649 if (head)
… …
663 } 657 }
664 658
665 return head; 659 return head;
666} 660}
667 661
662//-GPL
663

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines