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.46 by root, Mon Apr 16 06:23:39 2007 UTC vs.
Revision 1.71 by root, Thu Nov 8 19:43:23 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 * Deliantra 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 <support@deliantra.net>
23 */ 22 */
24 23
25#include <cassert> 24#include <cassert>
26 25
27#include <global.h> 26#include <global.h>
… …
37 * return an object. Perhaps those should be called 'archob' functions 36 * return an object. Perhaps those should be called 'archob' functions
38 * to denote they return an object derived from the archetype. 37 * to denote they return an object derived from the archetype.
39 * MSW 2003-04-29 38 * MSW 2003-04-29
40 */ 39 */
41 40
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing 41archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43 42
44// the hashtable 43// the hashtable
45typedef std::tr1::unordered_map 44typedef std::tr1::unordered_map
46 < 45 <
47 const char *, 46 const char *,
… …
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
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 if (loading_arch && !strcmp (&loading_arch->archname, name))
337 return loading_arch;
338
339 archetype *at = find (name);
340
341 if (!at)
342 {
343 at = new archetype (name);
344 at->link ();
345 }
346
347 return at;
325} 348}
326 349
327archetype * 350archetype *
328archetype::read (object_thawer &f) 351archetype::read (object_thawer &f)
329{ 352{
330 assert (f.kw == KW_object); 353 assert (f.kw == KW_object);
331 354
332 archetype *head = get (f.get_str ()); 355 std::vector<archetype *> parts;
333 unlink (head);
334 object *op = object::create ();
335 356
336 if (!op->parse_kv (f)) 357 coroapi::cede_to_tick_every (10);
337 { 358
338 op->destroy (true); 359 for (;;)
339 // leak head
340 return 0;
341 } 360 {
361 // the archetype might have been referenced earlier
362 // so try to find an existing stub archetype first
363 archetype *at = find (f.get_str ());
342 364
343 overwrite (head, op); 365 if (!at || !at->stub)
344 op->destroy (); 366 at = new archetype (f.get_str ());
345 367
346 for (archetype *prev = head; f.kw == KW_more; )
347 {
348 f.next (); 368 f.next ();
349 assert (f.kw == KW_object);
350 369
351 archetype *more = get (f.get_str ()); 370#if 0
352 unlink (more); 371 // implementing it here in the server does neither allow multiple inheritence
353 object *op = object::create (); 372 // nor does it cleanly "just override". it would allow use in map files, though,
354 373 // and other resource files dynamically laoded (as opposed to being preprocessed).
355 if (!op->parse_kv (f)) 374 // not that any of this is relevant as of yet...
375 if (f.kw == KW_inherit)
356 { 376 {
357 op->destroy (true); 377 if (archetype *at = find (f.get_str ()))
358 // leak head more* 378 *op = at->clone;
359 return 0; 379 else
380 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
381 &at->archname, f.get_str ());
382
383 f.next ();
360 } 384 }
385#endif
361 386
362 overwrite (more, op); 387 loading_arch = at; // hack to tell parse_kv et al. to behave
363 op->destroy (); 388 bool parse_ok = at->parse_kv (f);
389 loading_arch = 0;
364 390
365 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; 391 if (!parse_ok)
366 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; 392 goto fail;
367 393
368 more->head = head; 394 loading_arch = at; // hack to tell parse_kv et al. to behave
369 more->clone.head = &head->clone; 395 at->post_load_check ();
370 prev->more = more; 396 loading_arch = 0;
371 prev->clone.more = &more->clone;
372 397
373 prev = more; 398 parts.push_back (at);
374 }
375 399
376 if (!head->next) 400 if (f.kw != KW_more)
377 { 401 break;
378 head->next = first_archetype;
379 first_archetype = head;
380 }
381 402
382 return head; 403 f.next ();
383}
384 404
385/* 405 if (f.kw != KW_object)
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 { 406 {
396 case KW_object: 407 f.parse_error ("more object");
397 loading_arch = true; 408 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 } 409 }
410 }
414 411
415 f.next (); 412 {
413 auto (at, parts.begin ());
414
415 archetype *new_head = parts.front ();
416 archetype *old_head = find (new_head->archname);
417
418 if (old_head && !old_head->is_head ())
419 {
420 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
421 &new_head->archname, &old_head->archname);
422 goto fail;
416 } 423 }
417}
418 424
425 // check that all archetypes belong to the same old object or are new
426 for (auto (at, parts.begin ()); at != parts.end (); ++at)
427 {
428 archetype *new_part = *at;
429 archetype *old_part = find (new_part->archname);
430
431 if (old_part && old_part->head_ () != old_head)
432 {
433 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
434 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
435 goto fail;
436 }
437 }
438
439 // deactivate existing archetype
440 for (archetype *at = old_head; at; at = (archetype *)at->more)
441 at->unlink ();
442
443 // assemble new chain
444 new_head->min_x = new_head->max_x = new_head->x;
445 new_head->min_y = new_head->max_y = new_head->y;
446
447 archetype *less = new_head;
448 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
449 {
450 archetype *at = *p;
451
452 // some flags get inherited formt he head (probably a lot more)
453 // doing it here doesn't feel too cozy, but it allows code
454 // to ignore head checks for these flags, which saves time
455 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
456 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
457 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
458 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
459
460 if (at->x < new_head->min_x) new_head->min_x = at->x;
461 if (at->y < new_head->min_y) new_head->min_y = at->y;
462 if (at->x > new_head->max_x) new_head->max_x = at->x;
463 if (at->y > new_head->max_y) new_head->max_y = at->y;
464
465 at->head = new_head;
466 less->more = at;
467 less = at;
468 }
469
470 // now activate it
471 for (auto (p, parts.begin ()); p != parts.end (); ++p)
472 {
473 archetype *at = *p;
474 at->stub = false;
475 at->link ();
476 }
477
478 return new_head;
479 }
480
481fail:
482 for (auto (p, parts.begin ()); p != parts.end (); ++p)
483 (*p)->destroy (true);
484
485 return 0;
486}
487
419/* 488/*
420 * First initialises the archtype hash-table (init_archetable()). 489 * Initialize global archtype pointers:
421 * Reads and parses the archetype file (with the first and second-pass
422 * functions).
423 * Then initialises treasures by calling load_treasures().
424 */ 490 */
425void 491void
426load_archetypes (void) 492init_archetype_pointers ()
427{ 493{
428 char filename[MAX_BUF]; 494 ring_arch = archetype::find ("ring");
429 495 amulet_arch = archetype::find ("amulet");
430 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); 496 staff_arch = archetype::find ("staff");
431 LOG (llevDebug, "Reading archetypes from %s:\n", filename); 497 crown_arch = archetype::find ("crown");
432 498 empty_archetype = archetype::find ("empty_archetype");
433 object_thawer f (filename);
434
435 f.next ();
436
437 if (!load_archetypes (f))
438 cleanup ("unable to load archetypes");
439
440 warn_archetypes = 1;
441} 499}
442 500
443/* 501/*
444 * Creates and returns a new object which is a copy of the given archetype. 502 * Creates and returns a new object which is a copy of the given archetype.
445 * This function returns NULL on failure. 503 * This function returns NULL on failure.
… …
447object * 505object *
448arch_to_object (archetype *at) 506arch_to_object (archetype *at)
449{ 507{
450 if (!at) 508 if (!at)
451 { 509 {
452 if (warn_archetypes)
453 LOG (llevError, "Couldn't find archetype.\n"); 510 LOG (llevError, "Couldn't find archetype.\n");
454
455 return NULL; 511 return 0;
456 } 512 }
457 513
458 object *op = at->clone.clone (); 514 object *op = at->clone ();
459 op->arch = at; 515 op->arch = at;
460 op->instantiate (); 516 op->instantiate ();
517
461 return op; 518 return op;
519}
520
521object *
522archetype::instance ()
523{
524 return arch_to_object (this);
462} 525}
463 526
464/* 527/*
465 * Creates an object. This function is called by get_archetype() 528 * Creates an object. This function is called by get_archetype()
466 * if it fails to find the appropriate archetype. 529 * if it fails to find the appropriate archetype.
… …
468 * an object, and never NULL. 531 * an object, and never NULL.
469 */ 532 */
470object * 533object *
471create_singularity (const char *name) 534create_singularity (const char *name)
472{ 535{
473 object *op; 536 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
537
538 if (!strcmp (name, "bug"))
539 abort ();
540
474 char buf[MAX_BUF]; 541 char buf[MAX_BUF];
542 sprintf (buf, "bug, please report (%s)", name);
475 543
476 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 544 object *op = get_archetype ("bug");
477 op = object::create ();
478 op->name = op->name_pl = buf; 545 op->name = op->name_pl = buf;
479 SET_FLAG (op, FLAG_NO_PICK); 546
480 return op; 547 return op;
481} 548}
482 549
483/* 550/*
484 * Finds which archetype matches the given name, and returns a new 551 * Finds which archetype matches the given name, and returns a new
… …
494 561
495 return arch_to_object (at); 562 return arch_to_object (at);
496} 563}
497 564
498/* 565/*
499 * Hash-function used by the arch-hashtable.
500 */
501
502unsigned long
503hasharch (const char *str, int tablesize)
504{
505 unsigned long hash = 0;
506 unsigned int i = 0;
507 const char *p;
508
509 /* use the one-at-a-time hash function, which supposedly is
510 * better than the djb2-like one used by perl5.005, but
511 * certainly is better then the bug used here before.
512 * see http://burtleburtle.net/bob/hash/doobs.html
513 */
514 for (p = str; i < MAXSTRING && *p; p++, i++)
515 {
516 hash += *p;
517 hash += hash << 10;
518 hash ^= hash >> 6;
519 }
520
521 hash += hash << 3;
522 hash ^= hash >> 11;
523 hash += hash << 15;
524
525 return hash % tablesize;
526}
527
528/*
529 * Finds, using the hashtable, which archetype matches the given name.
530 * returns a pointer to the found archetype, otherwise NULL.
531 */
532archetype *
533archetype::find (const char *name)
534{
535 if (!name)
536 return 0;
537
538 AUTODECL (i, ht.find (name));
539
540 if (i == ht.end ())
541 return 0;
542 else
543 return i->second;
544}
545
546archetype *
547archetype::get (const char *name)
548{
549 archetype *at = find (name);
550
551 if (!at)
552 {
553 archetypes.push_back (at = new archetype);
554 at->name = name;
555 at->hash_add ();
556 }
557
558 return at;
559}
560
561/*
562 * Adds an archetype to the hashtable.
563 */
564void
565archetype::hash_add ()
566{
567 ht.insert (std::make_pair (name, this));
568}
569
570void
571archetype::hash_del ()
572{
573 ht.erase (name);
574}
575
576/*
577 * Returns the first archetype using the given type. 566 * Returns the first archetype using the given type.
578 * Used in treasure-generation. 567 * Used in treasure-generation.
579 */ 568 */
580archetype * 569archetype *
581type_to_archetype (int type) 570type_to_archetype (int type)
582{ 571{
583 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) 572 for_all_archetypes (at)
584 if (at->clone.type == type) 573 if (at->type == type && at->head_ () != at)
585 return at; 574 return at;
586 575
587 return 0; 576 return 0;
588} 577}
589 578
… …
601 { 590 {
602 LOG (llevError, "Can't clone archetype %d\n", type); 591 LOG (llevError, "Can't clone archetype %d\n", type);
603 return 0; 592 return 0;
604 } 593 }
605 594
606 object *op = at->clone.clone (); 595 object *op = at->clone ();
607 op->instantiate (); 596 op->instantiate ();
608 return op; 597 return op;
609} 598}
610 599
611/* 600/*
612 * member: make instance from class 601 * member: make instance from class
613 */ 602 */
614
615object * 603object *
616object_create_arch (archetype *at) 604object_create_arch (archetype *at)
617{ 605{
618 object *op, *prev = 0, *head = 0; 606 object *op, *prev = 0, *head = 0;
619 607
620 while (at) 608 while (at)
621 { 609 {
622 op = arch_to_object (at); 610 op = arch_to_object (at);
611
623 op->x = at->clone.x; 612 op->x = at->x;
624 op->y = at->clone.y; 613 op->y = at->y;
625 614
626 if (head) 615 if (head)
627 op->head = head, prev->more = op; 616 op->head = head, prev->more = op;
628 617
629 if (!head) 618 if (!head)
630 head = op; 619 head = op;
631 620
632 prev = op; 621 prev = op;
633 at = at->more; 622 at = (archetype *)at->more;
634 } 623 }
635 624
636 return (head); 625 return head;
637} 626}
638 627

Diff Legend

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