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.47 by root, Mon Apr 16 10:14:25 2007 UTC vs.
Revision 1.68 by root, Sun Jul 1 05:00:17 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 22 */
24 23
25#include <cassert> 24#include <cassert>
26 25
27#include <global.h> 26#include <global.h>
… …
50 str_equal, 49 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> > 50 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 51 > HT;
53 52
54static HT ht (5000); 53static HT ht (5000);
55static std::vector<archetype *> archetypes; 54archvec archetypes;
56 55
57/** 56/**
58 * GROS - This function retrieves an archetype given the name that appears 57 * GROS - This function retrieves an archetype given the name that appears
59 * during the game (for example, "writing pen" instead of "stylus"). 58 * during the game (for example, "writing pen" instead of "stylus").
60 * It does not use the hashtable system, but browse the whole archlist each time. 59 * It does not use the hashtable system, but browse the whole archlist each time.
… …
68archetype * 67archetype *
69find_archetype_by_object_name (const char *name) 68find_archetype_by_object_name (const char *name)
70{ 69{
71 shstr_cmp name_cmp (name); 70 shstr_cmp name_cmp (name);
72 71
73 for (archetype *at = first_archetype; at; at = at->next) 72 for_all_archetypes (at)
74 if (at->clone.name == name_cmp) 73 if (at->name == name_cmp)
75 return at; 74 return at;
76 75
77 return 0; 76 return 0;
78} 77}
79 78
… …
85archetype * 84archetype *
86find_archetype_by_object_type_name (int type, const char *name) 85find_archetype_by_object_type_name (int type, const char *name)
87{ 86{
88 shstr_cmp name_cmp (name); 87 shstr_cmp name_cmp (name);
89 88
90 for (archetype *at = first_archetype; at; at = at->next) 89 for_all_archetypes (at)
91 if (at->clone.name == name_cmp && at->clone.type == type) 90 if (at->name == name_cmp && at->type == type)
92 return at; 91 return at;
93 92
94 return 0; 93 return 0;
95} 94}
96 95
… …
102object * 101object *
103get_archetype_by_skill_name (const char *skill, int type) 102get_archetype_by_skill_name (const char *skill, int type)
104{ 103{
105 shstr_cmp skill_cmp (skill); 104 shstr_cmp skill_cmp (skill);
106 105
107 for (archetype *at = first_archetype; at; at = at->next) 106 for_all_archetypes (at)
108 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) 107 if (at->skill == skill_cmp && (type == -1 || type == at->type))
109 return arch_to_object (at); 108 return arch_to_object (at);
110 109
111 return 0; 110 return 0;
112} 111}
113 112
… …
119 * (eg, skills) 118 * (eg, skills)
120 */ 119 */
121archetype * 120archetype *
122get_archetype_by_type_subtype (int type, int subtype) 121get_archetype_by_type_subtype (int type, int subtype)
123{ 122{
124 for (archetype *at = first_archetype; at; at = at->next) 123 for_all_archetypes (at)
125 if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) 124 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
126 return at; 125 return at;
127 126
128 return 0; 127 return 0;
129} 128}
130 129
… …
157 } 156 }
158 157
159 return create_singularity (name); 158 return create_singularity (name);
160} 159}
161 160
162 /* This is a subset of the parse_id command. Basically, name can be 161/* This is a subset of the parse_id command. Basically, name can be
163 * a string seperated lists of things to match, with certain keywords. 162 * a string seperated lists of things to match, with certain keywords.
164 * pl is the player (only needed to set count properly) 163 * pl is the player (only needed to set count properly)
165 * op is the item we are trying to match. Calling function takes care 164 * op is the item we are trying to match. Calling function takes care
166 * of what action might need to be done and if it is valid 165 * of what action might need to be done and if it is valid
167 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher 166 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher
168 * value means a better match. 0 means no match. 167 * value means a better match. 0 means no match.
169 * 168 *
170 * Brief outline of the procedure: 169 * Brief outline of the procedure:
171 * We take apart the name variable into the individual components. 170 * We take apart the name variable into the individual components.
172 * cases for 'all' and unpaid are pretty obvious. 171 * cases for 'all' and unpaid are pretty obvious.
173 * Next, we check for a count (either specified in name, or in the 172 * Next, we check for a count (either specified in name, or in the
174 * player object.) 173 * player object.)
175 * If count is 1, make a quick check on the name. 174 * If count is 1, make a quick check on the name.
176 * IF count is >1, we need to make plural name. Return if match. 175 * IF count is >1, we need to make plural name. Return if match.
177 * Last, make a check on the full name. 176 * Last, make a check on the full name.
178 */ 177 */
179int 178int
180item_matched_string (object *pl, object *op, const char *name) 179item_matched_string (object *pl, object *op, const char *name)
181{ 180{
182 char *cp, local_name[MAX_BUF]; 181 char *cp, local_name[MAX_BUF];
183 int count, retval = 0; 182 int count, retval = 0;
… …
275 } 274 }
276 275
277 return 0; 276 return 0;
278} 277}
279 278
279archetype::archetype (const char *name)
280{
281 stub = true;
282 arch = this;
283 this->archname = this->name = this->name_pl = name;
284}
285
286archetype::~archetype ()
287{
288 unlink ();
289}
290
280void 291void
281init_archetypes (void) 292archetype::link ()
282{ 293{
283 load_archetypes (); 294 ht.insert (std::make_pair (archname, this));
284 295
285 empty_archetype = archetype::find ("empty_archetype"); 296 if (!archetypes.contains (this))
297 archetypes.insert (this);
286} 298}
287 299
288archetype::archetype ()
289{
290 clone.arch = this;
291
292 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
293 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
294}
295
296archetype::~archetype ()
297{
298 //TODO: nuke ->more's
299}
300
301static void
302unlink (archetype *at)
303{
304 if (at->head)
305 at = at->head;
306
307 // destroy this archetype's link, making singletons out of its parts
308 while (at)
309 {
310 archetype *more = at->more;
311 at->clone.destroy_inv ();
312 at->head = at->more = 0;
313 at = more;
314 }
315}
316
317// dire hack, need to rationalise
318void 300void
319overwrite (archetype *at, object *op) 301archetype::unlink ()
320{ 302{
321 at->clone = *op; 303 ht.erase (archname);
322 304 if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D
323 at->clone.arch = at; 305 if (archetypes.contains (this))
324 //TODO: inv et al. 306 archetypes.erase (this);
307}
308
309/*
310 * Finds, using the hashtable, which archetype matches the given name.
311 * returns a pointer to the found archetype, otherwise NULL.
312 */
313archetype *
314archetype::find (const char *name)
315{
316 if (!name)
317 return 0;
318
319 auto (i, ht.find (name));
320
321 if (i == ht.end ())
322 return 0;
323 else
324 return i->second;
325}
326
327archetype *
328archetype::get (const char *name)
329{
330 if (!name)
331 {
332 LOG (llevError, "null archetype requested\n");
333 name = "(null)";
334 }
335
336 archetype *at = find (name);
337
338 if (!at)
339 {
340 at = new archetype (name);
341 at->link ();
342 }
343
344 return at;
325} 345}
326 346
327archetype * 347archetype *
328archetype::read (object_thawer &f) 348archetype::read (object_thawer &f)
329{ 349{
330 assert (f.kw == KW_object); 350 assert (f.kw == KW_object);
331 351
332 archetype *head = get (f.get_str ()); 352 loading_arch = true; // hack to tell parse_kv et al. to behave
333 unlink (head);
334 object *op = object::create ();
335 353
336 if (!op->parse_kv (f)) 354 std::vector<archetype *> parts;
337 { 355
338 op->destroy (true); 356 coroapi::cede_to_tick_every (10);
339 // leak head 357
340 return 0; 358 for (;;)
341 } 359 {
360 // the archetype might have been referenced earlier
361 // so try to find an existing stub archetype first
362 archetype *at = find (f.get_str ());
342 363
343 overwrite (head, op); 364 if (!at || !at->stub)
344 op->destroy (); 365 at = new archetype (f.get_str ());
345 366
346 for (archetype *prev = head; f.kw == KW_more; )
347 {
348 f.next (); 367 f.next ();
349 assert (f.kw == KW_object);
350 368
351 archetype *more = get (f.get_str ()); 369#if 0
352 unlink (more); 370 // implementing it here in the server does neither allow multiple inheritence
353 object *op = object::create (); 371 // nor does it cleanly "just override". it would allow use in map files, though,
354 372 // and other resource files dynamically laoded (as opposed to being preprocessed).
355 if (!op->parse_kv (f)) 373 // not that any of this is relevant as of yet...
374 if (f.kw == KW_inherit)
356 { 375 {
357 op->destroy (true); 376 if (archetype *at = find (f.get_str ()))
358 // leak head more* 377 *op = at->clone;
359 return 0; 378 else
379 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
380 &at->archname, f.get_str ());
381
382 f.next ();
360 } 383 }
384#endif
361 385
362 overwrite (more, op); 386 if (!at->parse_kv (f))
363 op->destroy (); 387 goto fail;
364 388
365 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; 389 at->post_load_check ();
366 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;
367 390
368 more->head = head; 391 parts.push_back (at);
369 more->clone.head = &head->clone;
370 prev->more = more;
371 prev->clone.more = &more->clone;
372 392
373 prev = more; 393 if (f.kw != KW_more)
374 } 394 break;
375 395
376 if (!head->next) 396 f.next ();
377 {
378 head->next = first_archetype;
379 first_archetype = head;
380 }
381 397
382 return head; 398 if (f.kw != KW_object)
383}
384
385/*
386 * Reads/parses the archetype-file, and copies into a linked list
387 * of archetype-structures.
388 */
389static bool
390load_archetypes (object_thawer &f)
391{
392 for (;;)
393 {
394 switch (f.kw)
395 { 399 {
396 case KW_object: 400 f.parse_error ("more object");
397 loading_arch = true; 401 goto fail;
398 if (!archetype::read (f))
399 {
400 loading_arch = false;
401 return false;
402 }
403
404 loading_arch = false;
405 continue;
406
407 case KW_EOF:
408 return true;
409
410 default:
411 if (!f.parse_error ("archetypes file"))
412 return false;
413 } 402 }
403 }
414 404
415 f.next (); 405 loading_arch = false;
406
407 {
408 auto (at, parts.begin ());
409
410 archetype *new_head = parts.front ();
411 archetype *old_head = find (new_head->archname);
412
413 if (old_head && !old_head->is_head ())
414 {
415 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
416 &new_head->archname, &old_head->archname);
417 goto fail;
416 } 418 }
417}
418 419
420 // check that all archetypes belong to the same old object or are new
421 for (auto (at, parts.begin ()); at != parts.end (); ++at)
422 {
423 archetype *new_part = *at;
424 archetype *old_part = find (new_part->archname);
425
426 if (old_part && old_part->head_ () != old_head)
427 {
428 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
429 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
430 goto fail;
431 }
432 }
433
434 // deactivate existing archetype
435 for (archetype *at = old_head; at; at = (archetype *)at->more)
436 at->unlink ();
437
438 // assemble new chain
439 new_head->min_x = new_head->max_x = new_head->x;
440 new_head->min_y = new_head->max_y = new_head->y;
441
442 archetype *less = new_head;
443 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
444 {
445 archetype *at = *p;
446
447 // some flags get inherited formt he head (probably a lot more)
448 // doing it here doesn't feel too cozy, but it allows code
449 // to ignore head checks for these flags, which saves time
450 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
451 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
452 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
453 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
454
455 if (at->x < new_head->min_x) new_head->min_x = at->x;
456 if (at->y < new_head->min_y) new_head->min_y = at->y;
457 if (at->x > new_head->max_x) new_head->max_x = at->x;
458 if (at->y > new_head->max_y) new_head->max_y = at->y;
459
460 at->head = new_head;
461 less->more = at;
462 less = at;
463 }
464
465 // now activate it
466 for (auto (p, parts.begin ()); p != parts.end (); ++p)
467 {
468 archetype *at = *p;
469 at->stub = false;
470 at->link ();
471 }
472
473 return new_head;
474 }
475
476fail:
477 for (auto (p, parts.begin ()); p != parts.end (); ++p)
478 (*p)->destroy (true);
479
480 loading_arch = false;
481 return 0;
482}
483
419/* 484/*
420 * First initialises the archtype hash-table (init_archetable()). 485 * Initialize global archtype pointers:
421 * Reads and parses the archetype file (with the first and second-pass
422 * functions).
423 */ 486 */
424void 487void
425load_archetypes (void) 488init_archetype_pointers ()
426{ 489{
427 char filename[MAX_BUF]; 490 ring_arch = archetype::find ("ring");
428 491 amulet_arch = archetype::find ("amulet");
429 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 492 staff_arch = archetype::find ("staff");
430 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 493 crown_arch = archetype::find ("crown");
431 494 empty_archetype = archetype::find ("empty_archetype");
432 object_thawer f (filename);
433
434 f.next ();
435
436 if (!load_archetypes (f))
437 cleanup ("unable to load archetypes");
438
439 warn_archetypes = 1;
440
441 load_treasures ();
442} 495}
443 496
444/* 497/*
445 * Creates and returns a new object which is a copy of the given archetype. 498 * Creates and returns a new object which is a copy of the given archetype.
446 * This function returns NULL on failure. 499 * This function returns NULL on failure.
… …
448object * 501object *
449arch_to_object (archetype *at) 502arch_to_object (archetype *at)
450{ 503{
451 if (!at) 504 if (!at)
452 { 505 {
453 if (warn_archetypes)
454 LOG (llevError, "Couldn't find archetype.\n"); 506 LOG (llevError, "Couldn't find archetype.\n");
455
456 return NULL; 507 return 0;
457 } 508 }
458 509
459 object *op = at->clone.clone (); 510 object *op = at->clone ();
460 op->arch = at; 511 op->arch = at;
461 op->instantiate (); 512 op->instantiate ();
513
462 return op; 514 return op;
463} 515}
464 516
465/* 517/*
466 * Creates an object. This function is called by get_archetype() 518 * Creates an object. This function is called by get_archetype()
… …
469 * an object, and never NULL. 521 * an object, and never NULL.
470 */ 522 */
471object * 523object *
472create_singularity (const char *name) 524create_singularity (const char *name)
473{ 525{
474 object *op; 526 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
527
528 if (!strcmp (name, "bug"))
529 abort ();
530
475 char buf[MAX_BUF]; 531 char buf[MAX_BUF];
532 sprintf (buf, "bug, please report (%s)", name);
476 533
477 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 534 object *op = get_archetype ("bug");
478 op = object::create ();
479 op->name = op->name_pl = buf; 535 op->name = op->name_pl = buf;
480 SET_FLAG (op, FLAG_NO_PICK); 536
481 return op; 537 return op;
482} 538}
483 539
484/* 540/*
485 * Finds which archetype matches the given name, and returns a new 541 * Finds which archetype matches the given name, and returns a new
… …
495 551
496 return arch_to_object (at); 552 return arch_to_object (at);
497} 553}
498 554
499/* 555/*
500 * Hash-function used by the arch-hashtable.
501 */
502
503unsigned long
504hasharch (const char *str, int tablesize)
505{
506 unsigned long hash = 0;
507 unsigned int i = 0;
508 const char *p;
509
510 /* use the one-at-a-time hash function, which supposedly is
511 * better than the djb2-like one used by perl5.005, but
512 * certainly is better then the bug used here before.
513 * see http://burtleburtle.net/bob/hash/doobs.html
514 */
515 for (p = str; i < MAXSTRING && *p; p++, i++)
516 {
517 hash += *p;
518 hash += hash << 10;
519 hash ^= hash >> 6;
520 }
521
522 hash += hash << 3;
523 hash ^= hash >> 11;
524 hash += hash << 15;
525
526 return hash % tablesize;
527}
528
529/*
530 * Finds, using the hashtable, which archetype matches the given name.
531 * returns a pointer to the found archetype, otherwise NULL.
532 */
533archetype *
534archetype::find (const char *name)
535{
536 if (!name)
537 return 0;
538
539 AUTODECL (i, ht.find (name));
540
541 if (i == ht.end ())
542 return 0;
543 else
544 return i->second;
545}
546
547archetype *
548archetype::get (const char *name)
549{
550 archetype *at = find (name);
551
552 if (!at)
553 {
554 archetypes.push_back (at = new archetype);
555 at->name = name;
556 at->hash_add ();
557 }
558
559 return at;
560}
561
562/*
563 * Adds an archetype to the hashtable.
564 */
565void
566archetype::hash_add ()
567{
568 ht.insert (std::make_pair (name, this));
569}
570
571void
572archetype::hash_del ()
573{
574 ht.erase (name);
575}
576
577/*
578 * Returns the first archetype using the given type. 556 * Returns the first archetype using the given type.
579 * Used in treasure-generation. 557 * Used in treasure-generation.
580 */ 558 */
581archetype * 559archetype *
582type_to_archetype (int type) 560type_to_archetype (int type)
583{ 561{
584 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 562 for_all_archetypes (at)
585 if (at->clone.type == type) 563 if (at->type == type && at->head_ () != at)
586 return at; 564 return at;
587 565
588 return 0; 566 return 0;
589} 567}
590 568
… …
602 { 580 {
603 LOG (llevError, "Can't clone archetype %d\n", type); 581 LOG (llevError, "Can't clone archetype %d\n", type);
604 return 0; 582 return 0;
605 } 583 }
606 584
607 object *op = at->clone.clone (); 585 object *op = at->clone ();
608 op->instantiate (); 586 op->instantiate ();
609 return op; 587 return op;
610} 588}
611 589
612/* 590/*
613 * member: make instance from class 591 * member: make instance from class
614 */ 592 */
615
616object * 593object *
617object_create_arch (archetype *at) 594object_create_arch (archetype *at)
618{ 595{
619 object *op, *prev = 0, *head = 0; 596 object *op, *prev = 0, *head = 0;
620 597
621 while (at) 598 while (at)
622 { 599 {
623 op = arch_to_object (at); 600 op = arch_to_object (at);
601
624 op->x = at->clone.x; 602 op->x = at->x;
625 op->y = at->clone.y; 603 op->y = at->y;
626 604
627 if (head) 605 if (head)
628 op->head = head, prev->more = op; 606 op->head = head, prev->more = op;
629 607
630 if (!head) 608 if (!head)
631 head = op; 609 head = op;
632 610
633 prev = op; 611 prev = op;
634 at = at->more; 612 at = (archetype *)at->more;
635 } 613 }
636 614
637 return (head); 615 return head;
638} 616}
639 617

Diff Legend

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