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.17 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.23 by root, Thu Sep 14 23:13:48 2006 UTC

16 16
17 You should have received a copy of the GNU General Public License 17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 20
21 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22*/
23 23
24#include <cassert> 24#include <cassert>
25 25
26#include <tr1/unordered_map> 26#include <tr1/unordered_map>
48 * MSW 2003-04-29 48 * MSW 2003-04-29
49 */ 49 */
50 50
51#if USE_UNORDERED_MAP 51#if USE_UNORDERED_MAP
52// the hashtable 52// the hashtable
53typedef
54 std::tr1::unordered_map < 53typedef std::tr1::unordered_map
55size_t, archetype *> 54 <
55 std::size_t,
56 archetype *,
57 std::hash<size_t>,
58 std::equal_to<size_t>,
59 slice_allocator< std::pair<const std::size_t, archetype *> >
60 true,
56 HT; 61 > HT;
57 62
58static 63static HT ht;
59 HT
60 ht;
61#endif 64#endif
62 65
63/** 66/**
64 * GROS - This function retrieves an archetype given the name that appears 67 * GROS - This function retrieves an archetype given the name that appears
65 * during the game (for example, "writing pen" instead of "stylus"). 68 * during the game (for example, "writing pen" instead of "stylus").
72 * - the archetype found or null if nothing was found. 75 * - the archetype found or null if nothing was found.
73 */ 76 */
74archetype * 77archetype *
75find_archetype_by_object_name (const char *name) 78find_archetype_by_object_name (const char *name)
76{ 79{
77 archetype * 80 archetype *at;
78 at;
79 81
80 if (name == NULL) 82 if (name == NULL)
81 return (archetype *) NULL; 83 return (archetype *) NULL;
82 84
83 for (at = first_archetype; at != NULL; at = at->next) 85 for (at = first_archetype; at != NULL; at = at->next)
94 * except that it considers only items of the given type. 96 * except that it considers only items of the given type.
95 */ 97 */
96archetype * 98archetype *
97find_archetype_by_object_type_name (int type, const char *name) 99find_archetype_by_object_type_name (int type, const char *name)
98{ 100{
99 archetype * 101 archetype *at;
100 at;
101 102
102 if (name == NULL) 103 if (name == NULL)
103 return NULL; 104 return NULL;
104 105
105 for (at = first_archetype; at != NULL; at = at->next) 106 for (at = first_archetype; at != NULL; at = at->next)
179 { 180 {
180 tmpname[i] = 0; 181 tmpname[i] = 0;
181 at = find_archetype_by_object_name (tmpname); 182 at = find_archetype_by_object_name (tmpname);
182 183
183 if (at != NULL) 184 if (at != NULL)
184 {
185 return arch_to_object (at); 185 return arch_to_object (at);
186 }
187 } 186 }
188 187
189 return create_singularity (name); 188 return create_singularity (name);
190} 189}
191 190
207 * Last, make a check on the full name. 206 * Last, make a check on the full name.
208 */ 207 */
209int 208int
210item_matched_string (object *pl, object *op, const char *name) 209item_matched_string (object *pl, object *op, const char *name)
211{ 210{
212 char *
213 cp,
214 local_name[MAX_BUF]; 211 char *cp, local_name[MAX_BUF];
215 int 212 int count, retval = 0;
216 count,
217 retval = 0;
218 213
219 strcpy (local_name, name); /* strtok is destructive to name */ 214 strcpy (local_name, name); /* strtok is destructive to name */
220 215
221 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 216 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
222 { 217 {
274 retval = 15; 269 retval = 15;
275 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 270 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
276 retval = 14; 271 retval = 14;
277 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 272 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
278 retval = 14; 273 retval = 14;
279
280 /* Do substring checks, so things like 'Str+1' will match. 274 /* Do substring checks, so things like 'Str+1' will match.
281 * retval of these should perhaps be lower - they are lower 275 * retval of these should perhaps be lower - they are lower
282 * then the specific strcasecmp aboves, but still higher than 276 * then the specific strcasecmp aboves, but still higher than
283 * some other match criteria. 277 * some other match criteria.
284 */ 278 */
286 retval = 12; 280 retval = 12;
287 else if (strstr (query_base_name (op, 0), cp)) 281 else if (strstr (query_base_name (op, 0), cp))
288 retval = 12; 282 retval = 12;
289 else if (strstr (query_short_name (op), cp)) 283 else if (strstr (query_short_name (op), cp))
290 retval = 12; 284 retval = 12;
291
292 /* Check against plural/non plural based on count. */ 285 /* Check against plural/non plural based on count. */
293 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 286 else if (count > 1 && !strcasecmp (cp, op->name_pl))
294 {
295 retval = 6; 287 retval = 6;
296 }
297 else if (count == 1 && !strcasecmp (op->name, cp)) 288 else if (count == 1 && !strcasecmp (op->name, cp))
298 {
299 retval = 6; 289 retval = 6;
300 }
301 /* base name matched - not bad */ 290 /* base name matched - not bad */
302 else if (strcasecmp (cp, op->name) == 0 && !count) 291 else if (strcasecmp (cp, op->name) == 0 && !count)
303 retval = 4; 292 retval = 4;
304 /* Check for partial custom name, but give a real low priority */ 293 /* Check for partial custom name, but give a real low priority */
305 else if (op->custom_name && strstr (op->custom_name, cp)) 294 else if (op->custom_name && strstr (op->custom_name, cp))
307 296
308 if (retval) 297 if (retval)
309 { 298 {
310 if (pl->type == PLAYER) 299 if (pl->type == PLAYER)
311 pl->contr->count = count; 300 pl->contr->count = count;
301
312 return retval; 302 return retval;
313 } 303 }
314 } 304 }
305
315 return 0; 306 return 0;
316} 307}
317 308
318/* 309/*
319 * Initialises the internal linked list of archetypes (read from file). 310 * Initialises the internal linked list of archetypes (read from file).
324void 315void
325init_archetypes (void) 316init_archetypes (void)
326{ /* called from add_player() and edit() */ 317{ /* called from add_player() and edit() */
327 if (first_archetype != NULL) /* Only do this once */ 318 if (first_archetype != NULL) /* Only do this once */
328 return; 319 return;
320
329 arch_init = 1; 321 arch_init = 1;
330 load_archetypes (); 322 load_archetypes ();
331 arch_init = 0; 323 arch_init = 0;
332 empty_archetype = find_archetype ("empty_archetype"); 324 empty_archetype = archetype::find ("empty_archetype");
333 325
334/* init_blocksview();*/ 326/* init_blocksview();*/
335} 327}
336 328
337/* 329/*
361 */ 353 */
362 354
363void 355void
364init_archetable (void) 356init_archetable (void)
365{ 357{
366 archetype * 358 archetype *at;
367 at;
368 359
369 LOG (llevDebug, " Setting up archetable...\n"); 360 LOG (llevDebug, " Setting up archetable...\n");
370 361
371 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 362 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
372 add_arch (at); 363 add_arch (at);
391 */ 382 */
392 383
393void 384void
394dump_all_archetypes (void) 385dump_all_archetypes (void)
395{ 386{
396 archetype * 387 archetype *at;
397 at;
398 388
399 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 389 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
400 { 390 {
401 dump_arch (at); 391 dump_arch (at);
402 fprintf (logfile, "%s\n", errmsg); 392 fprintf (logfile, "%s\n", errmsg);
404} 394}
405 395
406void 396void
407free_all_archs (void) 397free_all_archs (void)
408{ 398{
409 archetype * 399 archetype *at, *next;
410 at, *
411 next;
412 int
413 i = 0, f = 0; 400 int i = 0, f = 0;
414 401
415 for (at = first_archetype; at != NULL; at = next) 402 for (at = first_archetype; at != NULL; at = next)
416 { 403 {
417 if (at->more) 404 if (at->more)
418 next = at->more; 405 next = at->more;
443 * of archetype-structures. 430 * of archetype-structures.
444 */ 431 */
445void 432void
446first_arch_pass (object_thawer & fp) 433first_arch_pass (object_thawer & fp)
447{ 434{
448 archetype *
449 at, *
450 head = NULL, *last_more = NULL; 435 archetype *at, *head = NULL, *last_more = NULL;
451 436
452 at->clone.arch = first_archetype = at = new archetype; 437 at->clone.arch = first_archetype = at = new archetype;
453 438
454 while (int i = load_object (fp, &at->clone, 0)) 439 while (int i = load_object (fp, &at->clone, 0))
455 { 440 {
524 */ 509 */
525 510
526void 511void
527second_arch_pass (object_thawer & thawer) 512second_arch_pass (object_thawer & thawer)
528{ 513{
529 char
530 buf[MAX_BUF], *
531 variable = buf, *argument, *cp; 514 char buf[MAX_BUF], *variable = buf, *argument, *cp;
532 archetype *
533 at = NULL, *other; 515 archetype *at = NULL, *other;
534 516
535 while (fgets (buf, MAX_BUF, thawer) != NULL) 517 while (fgets (buf, MAX_BUF, thawer) != NULL)
536 { 518 {
537 if (*buf == '#') 519 if (*buf == '#')
538 continue; 520 continue;
546 cp--; 528 cp--;
547 } 529 }
548 } 530 }
549 if (!strcmp ("Object", variable)) 531 if (!strcmp ("Object", variable))
550 { 532 {
551 if ((at = find_archetype (argument)) == NULL) 533 if ((at = archetype::find (argument)) == NULL)
552 LOG (llevError, "Warning: failed to find arch %s\n", argument); 534 LOG (llevError, "Warning: failed to find arch %s\n", argument);
553 } 535 }
554 else if (!strcmp ("other_arch", variable)) 536 else if (!strcmp ("other_arch", variable))
555 { 537 {
556 if (at != NULL && at->clone.other_arch == NULL) 538 if (at != NULL && at->clone.other_arch == NULL)
557 { 539 {
558 if ((other = find_archetype (argument)) == NULL) 540 if ((other = archetype::find (argument)) == NULL)
559 LOG (llevError, "Warning: failed to find other_arch %s\n", argument); 541 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
560 else if (at != NULL) 542 else if (at != NULL)
561 at->clone.other_arch = other; 543 at->clone.other_arch = other;
562 } 544 }
563 } 545 }
579 561
580#ifdef DEBUG 562#ifdef DEBUG
581void 563void
582check_generators (void) 564check_generators (void)
583{ 565{
584 archetype * 566 archetype *at;
585 at;
586 567
587 for (at = first_archetype; at != NULL; at = at->next) 568 for (at = first_archetype; at != NULL; at = at->next)
588 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) 569 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
589 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); 570 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
590} 571}
598 */ 579 */
599 580
600void 581void
601load_archetypes (void) 582load_archetypes (void)
602{ 583{
603 char
604 filename[MAX_BUF]; 584 char filename[MAX_BUF];
605 585
606#if TIME_ARCH_LOAD 586#if TIME_ARCH_LOAD
607 struct timeval 587 struct timeval
608 tv1, 588 tv1,
609 tv2; 589 tv2;
647 */ 627 */
648 628
649object * 629object *
650arch_to_object (archetype *at) 630arch_to_object (archetype *at)
651{ 631{
652 object * 632 object *op;
653 op;
654 633
655 if (at == NULL) 634 if (at == NULL)
656 { 635 {
657 if (warn_archetypes) 636 if (warn_archetypes)
658 LOG (llevError, "Couldn't find archetype.\n"); 637 LOG (llevError, "Couldn't find archetype.\n");
675 */ 654 */
676 655
677object * 656object *
678create_singularity (const char *name) 657create_singularity (const char *name)
679{ 658{
680 object * 659 object *op;
681 op;
682 char
683 buf[MAX_BUF]; 660 char buf[MAX_BUF];
684 661
685 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 662 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
686 op = get_object (); 663 op = get_object ();
687 op->name = op->name_pl = buf; 664 op->name = op->name_pl = buf;
688 SET_FLAG (op, FLAG_NO_PICK); 665 SET_FLAG (op, FLAG_NO_PICK);
695 */ 672 */
696 673
697object * 674object *
698get_archetype (const char *name) 675get_archetype (const char *name)
699{ 676{
700 archetype * 677 archetype *at = archetype::find (name);
701 at;
702 678
703 at = find_archetype (name); 679 if (!at)
704 if (at == NULL)
705 return create_singularity (name); 680 return create_singularity (name);
706 681
707 return arch_to_object (at); 682 return arch_to_object (at);
708} 683}
709 684
712 */ 687 */
713 688
714unsigned long 689unsigned long
715hasharch (const char *str, int tablesize) 690hasharch (const char *str, int tablesize)
716{ 691{
717 unsigned long 692 unsigned long hash = 0;
718 hash = 0;
719 unsigned int 693 unsigned int i = 0;
720 i = 0;
721 const char * 694 const char *p;
722 p;
723 695
724 /* use the one-at-a-time hash function, which supposedly is 696 /* use the one-at-a-time hash function, which supposedly is
725 * better than the djb2-like one used by perl5.005, but 697 * better than the djb2-like one used by perl5.005, but
726 * certainly is better then the bug used here before. 698 * certainly is better then the bug used here before.
727 * see http://burtleburtle.net/bob/hash/doobs.html 699 * see http://burtleburtle.net/bob/hash/doobs.html
744 * Finds, using the hashtable, which archetype matches the given name. 716 * Finds, using the hashtable, which archetype matches the given name.
745 * returns a pointer to the found archetype, otherwise NULL. 717 * returns a pointer to the found archetype, otherwise NULL.
746 */ 718 */
747 719
748archetype * 720archetype *
749find_archetype (const char *name) 721archetype::find (const char *name)
750{ 722{
751#if USE_UNORDERED_MAP
752 name = shstr::find (name);
753
754 if (!name) 723 if (!name)
755 return 0; 724 return 0;
756 725
757 HT::const_iterator i = ht.find ((size_t) name); 726#if USE_UNORDERED_MAP
727 AUTODECL (i, ht.find ((size_t) name));
758 728
759 if (i == ht.end ()) 729 if (i == ht.end ())
760 return 0; 730 return 0;
761 else 731 else
762 return i->second; 732 return i->second;
763#endif 733#endif
764 734
765 archetype * 735 archetype *at;
766 at;
767 unsigned long 736 unsigned long index;
768 index;
769
770 if (name == NULL)
771 return (archetype *) NULL;
772 737
773 index = hasharch (name, ARCHTABLE); 738 index = hasharch (name, ARCHTABLE);
774 arch_search++; 739 arch_search++;
775 for (;;) 740 for (;;)
776 { 741 {
777 at = arch_table[index]; 742 at = arch_table[index];
743
778 if (at == NULL) 744 if (at == NULL)
779 { 745 {
780 if (warn_archetypes) 746 if (warn_archetypes)
781 LOG (llevError, "Couldn't find archetype %s\n", name); 747 LOG (llevError, "Couldn't find archetype %s\n", name);
748
782 return NULL; 749 return NULL;
783 } 750 }
751
784 arch_cmp++; 752 arch_cmp++;
753
785 if (!strcmp ((const char *) at->name, name)) 754 if (!strcmp ((const char *) at->name, name))
786 return at; 755 return at;
756
787 if (++index >= ARCHTABLE) 757 if (++index >= ARCHTABLE)
788 index = 0; 758 index = 0;
789 } 759 }
790} 760}
791 761
798{ 768{
799#if USE_UNORDERED_MAP 769#if USE_UNORDERED_MAP
800 ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); 770 ht.insert (std::make_pair ((size_t) (const char *) at->name, at));
801#endif 771#endif
802 772
803 int
804 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 773 int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;
805 774
806 for (;;) 775 for (;;)
807 { 776 {
808 if (arch_table[index] == NULL) 777 if (arch_table[index] == NULL)
809 { 778 {
825 */ 794 */
826 795
827archetype * 796archetype *
828type_to_archetype (int type) 797type_to_archetype (int type)
829{ 798{
830 archetype * 799 archetype *at;
831 at;
832 800
833 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 801 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
834 if (at->clone.type == type) 802 if (at->clone.type == type)
835 return at; 803 return at;
804
836 return NULL; 805 return 0;
837} 806}
838 807
839/* 808/*
840 * Returns a new object copied from the first archetype matching 809 * Returns a new object copied from the first archetype matching
841 * the given type. 810 * the given type.
843 */ 812 */
844 813
845object * 814object *
846clone_arch (int type) 815clone_arch (int type)
847{ 816{
848 archetype * 817 archetype *at;
849 at;
850 object *
851 op = get_object (); 818 object *op = get_object ();
852 819
853 if ((at = type_to_archetype (type)) == NULL) 820 if ((at = type_to_archetype (type)) == NULL)
854 { 821 {
855 LOG (llevError, "Can't clone archetype %d\n", type); 822 LOG (llevError, "Can't clone archetype %d\n", type);
856 free_object (op); 823 free_object (op);
857 return NULL; 824 return NULL;
858 } 825 }
826
859 copy_object (&at->clone, op); 827 copy_object (&at->clone, op);
860 op->instantiate (); 828 op->instantiate ();
861 return op; 829 return op;
862} 830}
863 831
866 */ 834 */
867 835
868object * 836object *
869object_create_arch (archetype *at) 837object_create_arch (archetype *at)
870{ 838{
871 object * 839 object *op, *prev = 0, *head = 0;
872 op, *
873 prev = NULL, *head = NULL;
874 840
875 while (at) 841 while (at)
876 { 842 {
877 op = arch_to_object (at); 843 op = arch_to_object (at);
878 op->x = at->clone.x; 844 op->x = at->clone.x;
879 op->y = at->clone.y; 845 op->y = at->clone.y;
846
880 if (head) 847 if (head)
881 op->head = head, prev->more = op; 848 op->head = head, prev->more = op;
849
882 if (!head) 850 if (!head)
883 head = op; 851 head = op;
852
884 prev = op; 853 prev = op;
885 at = at->more; 854 at = at->more;
886 } 855 }
856
887 return (head); 857 return (head);
888} 858}
889 859
890/*** end of arch.c ***/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines