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.79 by root, Sun May 4 11:12:40 2008 UTC vs.
Revision 1.104 by root, Mon Apr 12 05:22:37 2010 UTC

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 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 <loader.h>
28 28
29#include <tr1/functional> 29#include <tr1/functional>
30#include <tr1/unordered_map> 30#include <tr1/unordered_map>
31 31
32archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing 32archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
… …
49 49
50// the vector of other_arch references to be resolved 50// the vector of other_arch references to be resolved
51static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; 51static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
52// the vector of loaded but not yet committed archetypes 52// the vector of loaded but not yet committed archetypes
53static std::vector<archetype *> postponed_arch; 53static std::vector<archetype *> postponed_arch;
54
55//+GPL
56
57/*
58 * Creates an object. This function is called by get_archetype ()
59 * if it fails to find the appropriate archetype.
60 * Thus get_archetype() will be guaranteed to always return
61 * an object, and never NULL.
62 */
63static object *
64create_singularity (const char *name)
65{
66 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
67
68 if (!strcmp (name, "bug"))
69 abort ();
70
71 object *op = archetype::get (shstr_bug);
72 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
73
74 return op;
75}
54 76
55/** 77/**
56 * GROS - This function retrieves an archetype given the name that appears 78 * GROS - This function retrieves an archetype given the name that appears
57 * during the game (for example, "writing pen" instead of "stylus"). 79 * 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. 80 * It does not use the hashtable system, but browse the whole archlist each time.
… …
102{ 124{
103 shstr_cmp skill_cmp (skill); 125 shstr_cmp skill_cmp (skill);
104 126
105 for_all_archetypes (at) 127 for_all_archetypes (at)
106 if (at->skill == skill_cmp && (type == -1 || type == at->type)) 128 if (at->skill == skill_cmp && (type == -1 || type == at->type))
107 return arch_to_object (at); 129 return at->instance ();
108 130
109 return 0; 131 return 0;
110} 132}
111 133
112/* similiar to above - this returns the first archetype 134/* similiar to above - this returns the first archetype
… …
140 */ 162 */
141object * 163object *
142get_archetype_by_object_name (const char *name) 164get_archetype_by_object_name (const char *name)
143{ 165{
144 char tmpname[MAX_BUF]; 166 char tmpname[MAX_BUF];
145 int i;
146 167
147 assign (tmpname, name); 168 assign (tmpname, name);
148 169
149 for (i = strlen (tmpname); i > 0; i--) 170 for (int i = strlen (tmpname); i > 0; i--)
150 { 171 {
151 tmpname[i] = 0; 172 tmpname[i] = 0;
152 173
153 if (archetype *at = find_archetype_by_object_name (tmpname)) 174 if (archetype *at = find_archetype_by_object_name (tmpname))
154 return arch_to_object (at); 175 return at->instance ();
155 } 176 }
156 177
157 return create_singularity (name); 178 return create_singularity (name);
158} 179}
159 180
… …
191 /* All is a very generic match - low match value */ 212 /* All is a very generic match - low match value */
192 if (!strcmp (cp, "all")) 213 if (!strcmp (cp, "all"))
193 return 1; 214 return 1;
194 215
195 /* unpaid is a little more specific */ 216 /* unpaid is a little more specific */
196 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 217 if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
197 return 2; 218 return 2;
198 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 219
220 if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED]))
199 return 2; 221 return 2;
200 222
201 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 223 if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
202 return 2; 224 return 2;
203 225
204 /* Allow for things like '100 arrows' */ 226 /* Allow for things like '100 arrows' */
205 if ((count = atoi (cp)) != 0) 227 if ((count = atoi (cp)) != 0)
206 { 228 {
… …
224 * is because of the 'else' handling - we don't want to match on 246 * 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 247 * 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 248 * later. So keep it in descending order here, so we try for the best
227 * match first, and work downward. 249 * match first, and work downward.
228 */ 250 */
251 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
252
229 if (!strcasecmp (cp, query_name (op))) 253 if (!strcasecmp (cp, query_name (op)))
230 retval = 20; 254 retval = 20;
231 else if (!strcasecmp (cp, query_short_name (op))) 255 else if (!strcasecmp (cp, qsn = query_short_name (op)))
232 retval = 18; 256 retval = 18;
233 else if (!strcasecmp (cp, query_base_name (op, 0))) 257 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
234 retval = 16; 258 retval = 16;
235 else if (!strcasecmp (cp, query_base_name (op, 1))) 259 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
236 retval = 16; 260 retval = 16;
237 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 261 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
238 retval = 15; 262 retval = 15;
239 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 263 else if (!strncasecmp (cp, qbn0, strlen (cp)))
240 retval = 14; 264 retval = 14;
241 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 265 else if (!strncasecmp (cp, qbn1, strlen (cp)))
242 retval = 14; 266 retval = 14;
243 /* Do substring checks, so things like 'Str+1' will match. 267 /* Do substring checks, so things like 'Str+1' will match.
244 * retval of these should perhaps be lower - they are lower 268 * retval of these should perhaps be lower - they are lower
245 * then the specific strcasecmp aboves, but still higher than 269 * then the specific strcasecmp aboves, but still higher than
246 * some other match criteria. 270 * some other match criteria.
247 */ 271 */
248 else if (strstr (query_base_name (op, 1), cp)) 272 else if (strstr (qbn1, cp))
249 retval = 12; 273 retval = 12;
250 else if (strstr (query_base_name (op, 0), cp)) 274 else if (strstr (qbn0, cp))
251 retval = 12; 275 retval = 12;
252 else if (strstr (query_short_name (op), cp)) 276 else if (strstr (qsn, cp))
253 retval = 12; 277 retval = 12;
254 /* Check against plural/non plural based on count. */ 278 /* Check against plural/non plural based on count. */
255 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 279 else if (count > 1 && !strcasecmp (cp, op->name_pl))
256 retval = 6; 280 retval = 6;
257 else if (count == 1 && !strcasecmp (op->name, cp)) 281 else if (count == 1 && !strcasecmp (op->name, cp))
258 retval = 6; 282 retval = 6;
259 /* base name matched - not bad */ 283 /* base name matched - not bad */
260 else if (strcasecmp (cp, op->name) == 0 && !count) 284 else if (strcasecmp (cp, op->name) == 0 && !count)
261 retval = 4; 285 retval = 4;
262 /* Check for partial custom name, but give a real low priority */ 286 /* Check for partial custom name, but give a real low priority */
263 else if (op->custom_name && strstr (op->custom_name, cp)) 287 else if (op->custom_name.contains (cp))
264 retval = 3; 288 retval = 3;
265 289
266 if (retval) 290 if (retval)
267 { 291 {
268 if (pl->type == PLAYER) 292 if (pl->type == PLAYER)
… …
273 } 297 }
274 298
275 return 0; 299 return 0;
276} 300}
277 301
302//-GPL
303
304void
305archetype::do_delete ()
306{
307 delete this;
308}
309
278archetype::archetype (const char *name) 310archetype::archetype (const char *name)
279{ 311{
280 arch = this; 312 arch = this;
281 this->archname = this->name = this->name_pl = name; 313 this->archname = this->name = this->name_pl = name;
282} 314}
… …
322 return 0; 354 return 0;
323 else 355 else
324 return i->second; 356 return i->second;
325} 357}
326 358
359void
360archetype::post_load_check ()
361{
362 object::post_load_check ();
363
364 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
365}
366
327archetype * 367archetype *
328archetype::read (object_thawer &f) 368archetype::read (object_thawer &f)
329{ 369{
330 assert (f.kw == KW_object); 370 assert (f.kw == KW_object);
331 371
… …
340 f.next (); 380 f.next ();
341 381
342#if 0 382#if 0
343 // implementing it here in the server does neither allow multiple inheritence 383 // implementing it here in the server does neither allow multiple inheritence
344 // nor does it cleanly "just override". it would allow use in map files, though, 384 // nor does it cleanly "just override". it would allow use in map files, though,
345 // and other resource files dynamically laoded (as opposed to being preprocessed). 385 // and other resource files dynamically loaded (as opposed to being preprocessed).
346 // not that any of this is relevant as of yet... 386 // not that any of this is relevant as of yet...
347 if (f.kw == KW_inherit) 387 if (f.kw == KW_inherit)
348 { 388 {
349 if (archetype *at = find (f.get_str ())) 389 if (archetype *at = find (f.get_str ()))
350 *op = at->clone; 390 *op = at->clone;
… …
407 goto fail; 447 goto fail;
408 } 448 }
409 } 449 }
410 450
411 // assemble new chain 451 // assemble new chain
412 new_head->min_x = new_head->max_x = new_head->x; 452 new_head->max_x = new_head->x;
413 new_head->min_y = new_head->max_y = new_head->y;
414 453
415 archetype *less = new_head; 454 archetype *less = new_head;
416 for (auto (p, parts.begin () + 1); p != parts.end (); ++p) 455 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
417 { 456 {
418 archetype *at = *p; 457 archetype *at = *p;
… …
423 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; 462 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
424 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; 463 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
425 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; 464 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
426 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; 465 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
427 466
428 new_head->min_x = min (new_head->min_x, at->x);
429 new_head->min_y = min (new_head->min_y, at->y);
430 new_head->max_x = max (new_head->max_x, at->x); 467 new_head->max_x = max (new_head->max_x, at->x);
431 new_head->max_y = max (new_head->max_y, at->y);
432 468
433 at->head = new_head; 469 at->head = new_head;
434 less->more = at; 470 less->more = at;
435 less = at; 471 less = at;
436 } 472 }
… …
440 return new_head; 476 return new_head;
441 } 477 }
442 478
443fail: 479fail:
444 for (auto (p, parts.begin ()); p != parts.end (); ++p) 480 for (auto (p, parts.begin ()); p != parts.end (); ++p)
445 (*p)->destroy (true); 481 (*p)->destroy ();
446 482
447 return 0; 483 return 0;
448} 484}
449 485
450void 486void
… …
510 546
511 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object 547 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
512 ++idx; 548 ++idx;
513 else 549 else
514 { 550 {
515 LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); 551 LOG (llevDebug, "garbage collect arch %s", &at->archname);
516 assert (at->arch == at); // verify that refcnt == 1 is truly valid 552 assert (at->arch == at); // verify that refcnt == 1 is truly valid
517 allarch.erase (idx); 553 allarch.erase (idx);
518 554
519 // break chain 555 // break chain
520 for (object *op = at->head_ (); op; ) 556 for (object *op = at->head_ (); op; )
… …
530 } 566 }
531 } 567 }
532 while (--cnt); 568 while (--cnt);
533} 569}
534 570
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 * 571object *
556archetype::instance () 572archetype::instance ()
557{ 573{
558 return arch_to_object (this); 574 object *op = clone ();
559} 575 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; 576 return op;
582} 577}
578
579//+GPL
583 580
584/* 581/*
585 * Finds which archetype matches the given name, and returns a new 582 * Finds which archetype matches the given name, and returns a new
586 * object containing a copy of the archetype. 583 * object containing a copy of the archetype.
587 */ 584 */
588object * 585object *
589get_archetype (const char *name) 586get_archetype (const char *name)
590{ 587{
588 return archetype::get (name);
589}
590
591object *
592archetype::get (const char *name)
593{
591 archetype *at = archetype::find (name); 594 archetype *at = find (name);
592 595
593 if (!at) 596 if (!at)
594 return create_singularity (name); 597 return create_singularity (name);
595 598
596 return arch_to_object (at); 599 return at->instance ();
597}
598
599object *
600archetype::get (const char *name)
601{
602 return get_archetype (name);
603} 600}
604 601
605/* 602/*
606 * Returns the first archetype using the given type. 603 * Returns the first archetype using the given type.
607 * Used in treasure-generation. 604 * Used in treasure-generation.
608 */ 605 */
609archetype * 606static archetype *
610type_to_archetype (int type) 607type_to_archetype (int type)
611{ 608{
612 for_all_archetypes (at) 609 for_all_archetypes (at)
613 if (at->type == type && at->head_ () != at) 610 if (at->type == type && at->head_ () != at)
614 return at; 611 return at;
… …
622 * Used in treasure-generation. 619 * Used in treasure-generation.
623 */ 620 */
624object * 621object *
625clone_arch (int type) 622clone_arch (int type)
626{ 623{
627 archetype *at; 624 archetype *at = type_to_archetype (type);
628 625
629 if ((at = type_to_archetype (type)) == NULL) 626 if (!at)
630 { 627 {
631 LOG (llevError, "Can't clone archetype %d\n", type); 628 LOG (llevError, "Can't clone archetype %d\n", type);
632 return 0; 629 return 0;
633 } 630 }
634 631
635 object *op = at->clone (); 632 return at->instance ();
636 op->instantiate ();
637 return op;
638} 633}
639 634
640/* 635/*
641 * member: make instance from class 636 * member: make instance from class
642 */ 637 */
… …
645{ 640{
646 object *op, *prev = 0, *head = 0; 641 object *op, *prev = 0, *head = 0;
647 642
648 while (at) 643 while (at)
649 { 644 {
650 op = arch_to_object (at); 645 op = at->instance ();
651 646
652 op->x = at->x; 647 op->x = at->x;
653 op->y = at->y; 648 op->y = at->y;
654 649
655 if (head) 650 if (head)
… …
663 } 658 }
664 659
665 return head; 660 return head;
666} 661}
667 662
663//-GPL
664

Diff Legend

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