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.40 by root, Fri Feb 2 22:08:23 2007 UTC vs.
Revision 1.63 by root, Mon Jun 4 13:04:00 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25#include <cassert> 25#include <cassert>
26 26
27#include <global.h> 27#include <global.h>
28#include <funcpoint.h> 28#include <funcpoint.h>
29#include <loader.h> 29#include <loader.h>
30 30
31#include <tr1/functional> 31#include <tr1/functional>
32#include <tr1/unordered_map> 32#include <tr1/unordered_map>
33
34int arch_init; /* True if doing arch initialization */
35 33
36/* The naming of these functions is really poor - they are all 34/* The naming of these functions is really poor - they are all
37 * pretty much named '.._arch_...', but they may more may not 35 * pretty much named '.._arch_...', but they may more may not
38 * return archetypes. Some make the arch_to_object call, and thus 36 * return archetypes. Some make the arch_to_object call, and thus
39 * return an object. Perhaps those should be called 'archob' functions 37 * return an object. Perhaps those should be called 'archob' functions
40 * to denote they return an object derived from the archetype. 38 * to denote they return an object derived from the archetype.
41 * MSW 2003-04-29 39 * MSW 2003-04-29
42 */ 40 */
41
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43 43
44// the hashtable 44// the hashtable
45typedef std::tr1::unordered_map 45typedef std::tr1::unordered_map
46 < 46 <
47 const char *, 47 const char *,
… …
50 str_equal, 50 str_equal,
51 slice_allocator< std::pair<const char *const, arch_ptr> > 51 slice_allocator< std::pair<const char *const, arch_ptr> >
52 > HT; 52 > HT;
53 53
54static HT ht (5000); 54static HT ht (5000);
55archvec archetypes;
55 56
56/** 57/**
57 * GROS - This function retrieves an archetype given the name that appears 58 * GROS - This function retrieves an archetype given the name that appears
58 * during the game (for example, "writing pen" instead of "stylus"). 59 * 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. 60 * It does not use the hashtable system, but browse the whole archlist each time.
… …
67archetype * 68archetype *
68find_archetype_by_object_name (const char *name) 69find_archetype_by_object_name (const char *name)
69{ 70{
70 shstr_cmp name_cmp (name); 71 shstr_cmp name_cmp (name);
71 72
72 for (archetype *at = first_archetype; at; at = at->next) 73 for_all_archetypes (at)
73 if (at->clone.name == name_cmp) 74 if (at->archname == name_cmp)
74 return at; 75 return at;
75 76
76 return 0; 77 return 0;
77} 78}
78 79
… …
84archetype * 85archetype *
85find_archetype_by_object_type_name (int type, const char *name) 86find_archetype_by_object_type_name (int type, const char *name)
86{ 87{
87 shstr_cmp name_cmp (name); 88 shstr_cmp name_cmp (name);
88 89
89 for (archetype *at = first_archetype; at; at = at->next) 90 for_all_archetypes (at)
90 if (at->clone.name == name_cmp && at->clone.type == type) 91 if (at->archname == name_cmp && at->type == type)
91 return at; 92 return at;
92 93
93 return 0; 94 return 0;
94} 95}
95 96
… …
101object * 102object *
102get_archetype_by_skill_name (const char *skill, int type) 103get_archetype_by_skill_name (const char *skill, int type)
103{ 104{
104 shstr_cmp skill_cmp (skill); 105 shstr_cmp skill_cmp (skill);
105 106
106 for (archetype *at = first_archetype; at; at = at->next) 107 for_all_archetypes (at)
107 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) 108 if (at->skill == skill_cmp && (type == -1 || type == at->type))
108 return arch_to_object (at); 109 return arch_to_object (at);
109 110
110 return 0; 111 return 0;
111} 112}
112 113
… …
118 * (eg, skills) 119 * (eg, skills)
119 */ 120 */
120archetype * 121archetype *
121get_archetype_by_type_subtype (int type, int subtype) 122get_archetype_by_type_subtype (int type, int subtype)
122{ 123{
123 for (archetype *at = first_archetype; at; at = at->next) 124 for_all_archetypes (at)
124 if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) 125 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
125 return at; 126 return at;
126 127
127 return 0; 128 return 0;
128} 129}
129 130
… …
274 } 275 }
275 276
276 return 0; 277 return 0;
277} 278}
278 279
279/* 280archetype::archetype (const char *name)
280 * Initialises the internal linked list of archetypes (read from file). 281{
281 * Then the global "empty_archetype" pointer is initialised. 282 stub = true;
282 * Then the blocksview[] array is initialised. 283 arch = this;
283 */ 284 this->archname = this->name = this->name_pl = name;
285}
286
287archetype::~archetype ()
288{
289 unlink ();
290}
284 291
285void 292void
286init_archetypes (void) 293archetype::link ()
287{ /* called from add_player() and edit() */ 294{
288 if (first_archetype != NULL) /* Only do this once */ 295 ht.insert (std::make_pair (archname, this));
296
297 if (!archetypes.contains (this))
298 archetypes.insert (this);
299}
300
301void
302archetype::unlink ()
303{
304 ht.erase (archname);
305
306 if (archetypes.contains (this))
307 archetypes.erase (this);
308}
309
310/*
311 * Finds, using the hashtable, which archetype matches the given name.
312 * returns a pointer to the found archetype, otherwise NULL.
313 */
314archetype *
315archetype::find (const char *name)
316{
317 if (!name)
289 return; 318 return 0;
290 319
291 arch_init = 1; 320 auto (i, ht.find (name));
292 load_archetypes (); 321
293 arch_init = 0; 322 if (i == ht.end ())
323 return 0;
324 else
325 return i->second;
326}
327
328archetype *
329archetype::get (const char *name)
330{
331 if (!name)
332 {
333 LOG (llevError, "null archetype requested\n");
334 name = "(null)";
335 }
336
337 archetype *at = find (name);
338
339 if (loading_arch && at && !at->stub)
340 {
341 at->unlink ();
342 at = 0;
343 }
344
345 if (!at || (!at->stub && loading_arch))
346 {
347 at = new archetype (name);
348 at->link ();
349 }
350
351 return at;
352}
353
354archetype *
355archetype::read (object_thawer &f)
356{
357 assert (f.kw == KW_object);
358
359 loading_arch = true; // hack to tell parse_kv et al. to behave
360
361 std::vector<archetype *> parts;
362
363 coroapi::cede_to_tick_every (10);
364
365 for (;;)
366 {
367 // the archetype might have been referenced earlier
368 // so try to find an existing stub archetype first
369 archetype *at = find (f.get_str ());
370
371 if (!at || !at->stub)
372 at = new archetype (f.get_str ());
373
374 f.next ();
375
376#if 0
377 // implementing it here in the server does neither allow multiple inheritence
378 // nor does it cleanly "just override". it would allow use in map files, though,
379 // and other resource files dynamically laoded (as opposed to being preprocessed).
380 // not that any of this is relevant as of yet...
381 if (f.kw == KW_inherit)
382 {
383 if (archetype *at = find (f.get_str ()))
384 *op = at->clone;
385 else
386 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
387 &at->archname, f.get_str ());
388
389 f.next ();
390 }
391#endif
392
393 if (!at->parse_kv (f))
394 goto fail;
395
396 at->post_load_check ();
397
398 parts.push_back (at);
399
400 if (f.kw != KW_more)
401 break;
402
403 f.next ();
404
405 if (f.kw != KW_object)
406 {
407 f.parse_error ("more object");
408 goto fail;
409 }
410 }
411
412 loading_arch = false;
413
414 {
415 auto (at, parts.begin ());
416
417 archetype *new_head = parts.front ();
418 archetype *old_head = find (new_head->archname);
419
420 for (auto (at, parts.begin ()); at != parts.end (); ++at)
421 fprintf (stderr, "%d: %s\n", at - parts.begin(), &(*at)->archname);//D
422
423 // check that all archetypes belong to the same old object or are new
424 for (auto (at, parts.begin ()); at != parts.end (); ++at)
425 {
426 archetype *new_part = *at;
427 archetype *old_part = find (new_part->archname);
428
429 if (old_part && old_part->head_ () != old_head)
430 {
431 fprintf (stderr, "nhn %s\n", &new_head->archname);//D
432 fprintf (stderr, "old_head %p,%p new_head %p,%p ph %p\n", old_head, old_part, new_head, new_part, old_part->head_());
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 fprintf (stderr, "oh %p %s\n", old_head, &new_head->archname);//D
440
441 // deactivate existing archetype
442 for (archetype *at = old_head; at; at = (archetype *)at->more)
443 at->unlink ();
444
445 // reassemble new chain
446 new_head->min_x = new_head->max_x = new_head->x;
447 new_head->min_y = new_head->max_y = new_head->y;
448
449 archetype *less = new_head;
450 archetype *head = 0;
451 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
452 {
453 archetype *at = *p;
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 = head; head = new_head;
461 less->more = at; less = at;
462 }
463
464 // now activate it
465 for (auto (p, parts.begin ()); p != parts.end (); ++p)
466 {
467 archetype *at = *p;
468 at->stub = false;
469 at->link ();
470 }
471
472 return new_head;
473 }
474
475fail:
476 for (auto (p, parts.begin ()); p != parts.end (); ++p)
477 (*p)->destroy (true);
478
479 loading_arch = false;
480 return 0;
481}
482
483/*
484 * Initialize global archtype pointers:
485 */
486void
487init_archetype_pointers ()
488{
489 ring_arch = archetype::find ("ring");
490 amulet_arch = archetype::find ("amulet");
491 staff_arch = archetype::find ("staff");
492 crown_arch = archetype::find ("crown");
294 empty_archetype = archetype::find ("empty_archetype"); 493 empty_archetype = archetype::find ("empty_archetype");
295
296/* init_blocksview();*/
297}
298
299/*
300 * An alternative way to init the hashtable which is slower, but _works_...
301 */
302void
303init_archetable (void)
304{
305 archetype *at;
306
307 LOG (llevDebug, " Setting up archetable...\n");
308
309 for (at = first_archetype; at; at = at->more ? at->more : at->next)
310 at->hash_add ();
311
312 LOG (llevDebug, "done\n");
313}
314
315void
316free_all_archs (void)
317{
318 archetype *at, *next;
319 int i = 0, f = 0;
320
321 for (at = first_archetype; at; at = next)
322 {
323 if (at->more)
324 next = at->more;
325 else
326 next = at->next;
327
328 delete
329 at;
330
331 i++;
332 }
333
334 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
335}
336
337archetype::archetype ()
338{
339 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
340 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
341}
342
343archetype::~archetype ()
344{
345}
346
347/*
348 * Reads/parses the archetype-file, and copies into a linked list
349 * of archetype-structures.
350 */
351void
352first_arch_pass (object_thawer & fp)
353{
354 archetype *head = 0, *last_more = 0;
355
356 archetype *at = new archetype;
357 at->clone.arch = first_archetype = at;
358
359 while (int i = load_object (fp, &at->clone, 0))
360 {
361 at->clone.speed_left = (float) (-0.1);
362 /* copy the body_info to the body_used - this is only really
363 * need for monsters, but doesn't hurt to do it for everything.
364 * by doing so, when a monster is created, it has good starting
365 * values for the body_used info, so when items are created
366 * for it, they can be properly equipped.
367 */
368 memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
369
370 switch (i)
371 {
372 case LL_NORMAL: /* A new archetype, just link it with the previous */
373 if (last_more != NULL)
374 last_more->next = at;
375 if (head != NULL)
376 head->next = at;
377 head = last_more = at;
378#if 0
379 if (!op->type)
380 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
381#endif
382 at->tail_x = 0;
383 at->tail_y = 0;
384 break;
385
386 case LL_MORE: /* Another part of the previous archetype, link it correctly */
387
388 at->head = head;
389 at->clone.head = &head->clone;
390 if (last_more != NULL)
391 {
392 last_more->more = at;
393 last_more->clone.more = &at->clone;
394 }
395 last_more = at;
396
397 /* If this multipart image is still composed of individual small
398 * images, don't set the tail_.. values. We can't use them anyways,
399 * and setting these to zero makes the map sending to the client much
400 * easier as just looking at the head, we know what to do.
401 */
402 if (at->clone.face != head->clone.face)
403 {
404 head->tail_x = 0;
405 head->tail_y = 0;
406 }
407 else
408 {
409 if (at->clone.x > head->tail_x)
410 head->tail_x = at->clone.x;
411 if (at->clone.y > head->tail_y)
412 head->tail_y = at->clone.y;
413 }
414 break;
415
416 }
417
418 at = new archetype;
419
420 at->clone.arch = at;
421 }
422
423 delete at;
424}
425
426/*
427 * Reads the archetype file once more, and links all pointers between
428 * archetypes.
429 */
430
431void
432second_arch_pass (object_thawer & thawer)
433{
434 char buf[MAX_BUF], *variable = buf, *argument, *cp;
435 archetype *at = NULL, *other;
436
437 while (fgets (buf, MAX_BUF, thawer) != NULL)
438 {
439 if (*buf == '#')
440 continue;
441 if ((argument = strchr (buf, ' ')) != NULL)
442 {
443 *argument = '\0', argument++;
444 cp = argument + strlen (argument) - 1;
445 while (isspace (*cp))
446 {
447 *cp = '\0';
448 cp--;
449 }
450 }
451 if (!strcmp ("Object", variable))
452 {
453 if ((at = archetype::find (argument)) == NULL)
454 LOG (llevError, "Warning: failed to find arch %s\n", argument);
455 }
456 else if (!strcmp ("other_arch", variable))
457 {
458 if (at != NULL && at->clone.other_arch == NULL)
459 {
460 if ((other = archetype::find (argument)) == NULL)
461 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462 else if (at != NULL)
463 at->clone.other_arch = other;
464 }
465 }
466 else if (!strcmp ("randomitems", variable))
467 {
468 if (at != NULL)
469 {
470 treasurelist *tl = find_treasurelist (argument);
471
472 if (tl == NULL)
473 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474 else
475 at->clone.randomitems = tl;
476 }
477 }
478 }
479}
480
481#ifdef DEBUG
482void
483check_generators (void)
484{
485 archetype *at;
486
487 for (at = first_archetype; at != NULL; at = at->next)
488 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490}
491#endif
492
493/*
494 * First initialises the archtype hash-table (init_archetable()).
495 * Reads and parses the archetype file (with the first and second-pass
496 * functions).
497 * Then initialises treasures by calling load_treasures().
498 */
499
500void
501load_archetypes (void)
502{
503 char filename[MAX_BUF];
504
505 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507
508 {
509 object_thawer
510 thawer (filename);
511
512 LOG (llevDebug, " arch-pass 1...\n");
513 first_arch_pass (thawer);
514 LOG (llevDebug, " done\n");
515 }
516
517 init_archetable ();
518 warn_archetypes = 1;
519
520 {
521 object_thawer
522 thawer (filename);
523
524 LOG (llevDebug, " loading treasure...\n");
525 load_treasures ();
526 LOG (llevDebug, " done\n");
527 LOG (llevDebug, " arch-pass 2...\n");
528 second_arch_pass (thawer);
529 LOG (llevDebug, " done\n");
530#ifdef DEBUG
531 check_generators ();
532#endif
533 }
534 LOG (llevDebug, " done\n");
535} 494}
536 495
537/* 496/*
538 * Creates and returns a new object which is a copy of the given archetype. 497 * Creates and returns a new object which is a copy of the given archetype.
539 * This function returns NULL on failure. 498 * This function returns NULL on failure.
540 */ 499 */
541object * 500object *
542arch_to_object (archetype *at) 501arch_to_object (archetype *at)
543{ 502{
544 object *op; 503 if (!at)
545
546 if (at == NULL)
547 { 504 {
548 if (warn_archetypes)
549 LOG (llevError, "Couldn't find archetype.\n"); 505 LOG (llevError, "Couldn't find archetype.\n");
550
551 return NULL; 506 return 0;
552 } 507 }
553 508
554 op = at->clone.clone (); 509 object *op = at->clone ();
555 op->arch = at; 510 op->arch = at;
556 op->instantiate (); 511 op->instantiate ();
512
557 return op; 513 return op;
558} 514}
559 515
560/* 516/*
561 * Creates an object. This function is called by get_archetype() 517 * Creates an object. This function is called by get_archetype()
… …
590 546
591 return arch_to_object (at); 547 return arch_to_object (at);
592} 548}
593 549
594/* 550/*
595 * Hash-function used by the arch-hashtable.
596 */
597
598unsigned long
599hasharch (const char *str, int tablesize)
600{
601 unsigned long hash = 0;
602 unsigned int i = 0;
603 const char *p;
604
605 /* use the one-at-a-time hash function, which supposedly is
606 * better than the djb2-like one used by perl5.005, but
607 * certainly is better then the bug used here before.
608 * see http://burtleburtle.net/bob/hash/doobs.html
609 */
610 for (p = str; i < MAXSTRING && *p; p++, i++)
611 {
612 hash += *p;
613 hash += hash << 10;
614 hash ^= hash >> 6;
615 }
616
617 hash += hash << 3;
618 hash ^= hash >> 11;
619 hash += hash << 15;
620
621 return hash % tablesize;
622}
623
624/*
625 * Finds, using the hashtable, which archetype matches the given name.
626 * returns a pointer to the found archetype, otherwise NULL.
627 */
628archetype *
629archetype::find (const char *name)
630{
631 if (!name)
632 return 0;
633
634 AUTODECL (i, ht.find (name));
635
636 if (i == ht.end ())
637 return 0;
638 else
639 return i->second;
640}
641
642/*
643 * Adds an archetype to the hashtable.
644 */
645void
646archetype::hash_add ()
647{
648 ht.insert (std::make_pair (name, this));
649}
650
651void
652archetype::hash_del ()
653{
654 ht.erase (name);
655}
656
657/*
658 * Returns the first archetype using the given type. 551 * Returns the first archetype using the given type.
659 * Used in treasure-generation. 552 * Used in treasure-generation.
660 */ 553 */
661archetype * 554archetype *
662type_to_archetype (int type) 555type_to_archetype (int type)
663{ 556{
664 archetype *at; 557 for_all_archetypes (at)
665 558 if (at->type == type && at->head_ () != at)
666 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
667 if (at->clone.type == type)
668 return at; 559 return at;
669 560
670 return 0; 561 return 0;
671} 562}
672 563
673/* 564/*
674 * Returns a new object copied from the first archetype matching 565 * Returns a new object copied from the first archetype matching
675 * the given type. 566 * the given type.
676 * Used in treasure-generation. 567 * Used in treasure-generation.
677 */ 568 */
678
679object * 569object *
680clone_arch (int type) 570clone_arch (int type)
681{ 571{
682 archetype *at; 572 archetype *at;
683 573
… …
685 { 575 {
686 LOG (llevError, "Can't clone archetype %d\n", type); 576 LOG (llevError, "Can't clone archetype %d\n", type);
687 return 0; 577 return 0;
688 } 578 }
689 579
690 object *op = at->clone.clone (); 580 object *op = at->clone ();
691 op->instantiate (); 581 op->instantiate ();
692 return op; 582 return op;
693} 583}
694 584
695/* 585/*
696 * member: make instance from class 586 * member: make instance from class
697 */ 587 */
698
699object * 588object *
700object_create_arch (archetype *at) 589object_create_arch (archetype *at)
701{ 590{
702 object *op, *prev = 0, *head = 0; 591 object *op, *prev = 0, *head = 0;
703 592
704 while (at) 593 while (at)
705 { 594 {
706 op = arch_to_object (at); 595 op = arch_to_object (at);
596
707 op->x = at->clone.x; 597 op->x = at->x;
708 op->y = at->clone.y; 598 op->y = at->y;
709 599
710 if (head) 600 if (head)
711 op->head = head, prev->more = op; 601 op->head = head, prev->more = op;
712 602
713 if (!head) 603 if (!head)
714 head = op; 604 head = op;
715 605
716 prev = op; 606 prev = op;
717 at = at->more; 607 at = (archetype *)at->more;
718 } 608 }
719 609
720 return (head); 610 return head;
721} 611}
722 612

Diff Legend

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