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.19 by root, Thu Sep 14 18:13:01 2006 UTC vs.
Revision 1.25 by root, Tue Nov 7 16:30:54 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>
75 * - the archetype found or null if nothing was found. 75 * - the archetype found or null if nothing was found.
76 */ 76 */
77archetype * 77archetype *
78find_archetype_by_object_name (const char *name) 78find_archetype_by_object_name (const char *name)
79{ 79{
80 archetype * 80 archetype *at;
81 at;
82 81
83 if (name == NULL) 82 if (name == NULL)
84 return (archetype *) NULL; 83 return (archetype *) NULL;
85 84
86 for (at = first_archetype; at != NULL; at = at->next) 85 for (at = first_archetype; at != NULL; at = at->next)
97 * except that it considers only items of the given type. 96 * except that it considers only items of the given type.
98 */ 97 */
99archetype * 98archetype *
100find_archetype_by_object_type_name (int type, const char *name) 99find_archetype_by_object_type_name (int type, const char *name)
101{ 100{
102 archetype * 101 archetype *at;
103 at;
104 102
105 if (name == NULL) 103 if (name == NULL)
106 return NULL; 104 return NULL;
107 105
108 for (at = first_archetype; at != NULL; at = at->next) 106 for (at = first_archetype; at != NULL; at = at->next)
182 { 180 {
183 tmpname[i] = 0; 181 tmpname[i] = 0;
184 at = find_archetype_by_object_name (tmpname); 182 at = find_archetype_by_object_name (tmpname);
185 183
186 if (at != NULL) 184 if (at != NULL)
187 {
188 return arch_to_object (at); 185 return arch_to_object (at);
189 }
190 } 186 }
191 187
192 return create_singularity (name); 188 return create_singularity (name);
193} 189}
194 190
210 * Last, make a check on the full name. 206 * Last, make a check on the full name.
211 */ 207 */
212int 208int
213item_matched_string (object *pl, object *op, const char *name) 209item_matched_string (object *pl, object *op, const char *name)
214{ 210{
215 char *
216 cp,
217 local_name[MAX_BUF]; 211 char *cp, local_name[MAX_BUF];
218 int 212 int count, retval = 0;
219 count,
220 retval = 0;
221 213
222 strcpy (local_name, name); /* strtok is destructive to name */ 214 strcpy (local_name, name); /* strtok is destructive to name */
223 215
224 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 216 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
225 { 217 {
277 retval = 15; 269 retval = 15;
278 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 270 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
279 retval = 14; 271 retval = 14;
280 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 272 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
281 retval = 14; 273 retval = 14;
282
283 /* Do substring checks, so things like 'Str+1' will match. 274 /* Do substring checks, so things like 'Str+1' will match.
284 * retval of these should perhaps be lower - they are lower 275 * retval of these should perhaps be lower - they are lower
285 * then the specific strcasecmp aboves, but still higher than 276 * then the specific strcasecmp aboves, but still higher than
286 * some other match criteria. 277 * some other match criteria.
287 */ 278 */
289 retval = 12; 280 retval = 12;
290 else if (strstr (query_base_name (op, 0), cp)) 281 else if (strstr (query_base_name (op, 0), cp))
291 retval = 12; 282 retval = 12;
292 else if (strstr (query_short_name (op), cp)) 283 else if (strstr (query_short_name (op), cp))
293 retval = 12; 284 retval = 12;
294
295 /* Check against plural/non plural based on count. */ 285 /* Check against plural/non plural based on count. */
296 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 286 else if (count > 1 && !strcasecmp (cp, op->name_pl))
297 {
298 retval = 6; 287 retval = 6;
299 }
300 else if (count == 1 && !strcasecmp (op->name, cp)) 288 else if (count == 1 && !strcasecmp (op->name, cp))
301 {
302 retval = 6; 289 retval = 6;
303 }
304 /* base name matched - not bad */ 290 /* base name matched - not bad */
305 else if (strcasecmp (cp, op->name) == 0 && !count) 291 else if (strcasecmp (cp, op->name) == 0 && !count)
306 retval = 4; 292 retval = 4;
307 /* Check for partial custom name, but give a real low priority */ 293 /* Check for partial custom name, but give a real low priority */
308 else if (op->custom_name && strstr (op->custom_name, cp)) 294 else if (op->custom_name && strstr (op->custom_name, cp))
310 296
311 if (retval) 297 if (retval)
312 { 298 {
313 if (pl->type == PLAYER) 299 if (pl->type == PLAYER)
314 pl->contr->count = count; 300 pl->contr->count = count;
301
315 return retval; 302 return retval;
316 } 303 }
317 } 304 }
305
318 return 0; 306 return 0;
319} 307}
320 308
321/* 309/*
322 * Initialises the internal linked list of archetypes (read from file). 310 * Initialises the internal linked list of archetypes (read from file).
327void 315void
328init_archetypes (void) 316init_archetypes (void)
329{ /* called from add_player() and edit() */ 317{ /* called from add_player() and edit() */
330 if (first_archetype != NULL) /* Only do this once */ 318 if (first_archetype != NULL) /* Only do this once */
331 return; 319 return;
320
332 arch_init = 1; 321 arch_init = 1;
333 load_archetypes (); 322 load_archetypes ();
334 arch_init = 0; 323 arch_init = 0;
335 empty_archetype = find_archetype ("empty_archetype"); 324 empty_archetype = archetype::find ("empty_archetype");
336 325
337/* init_blocksview();*/ 326/* init_blocksview();*/
338} 327}
339 328
340/* 329/*
364 */ 353 */
365 354
366void 355void
367init_archetable (void) 356init_archetable (void)
368{ 357{
369 archetype * 358 archetype *at;
370 at;
371 359
372 LOG (llevDebug, " Setting up archetable...\n"); 360 LOG (llevDebug, " Setting up archetable...\n");
373 361
374 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)
375 add_arch (at); 363 add_arch (at);
376 364
377 LOG (llevDebug, "done\n"); 365 LOG (llevDebug, "done\n");
378} 366}
379 367
380/*
381 * Dumps an archetype to debug-level output.
382 */
383
384void
385dump_arch (archetype *at)
386{
387 dump_object (&at->clone);
388}
389
390/*
391 * Dumps _all_ archetypes to debug-level output.
392 * If you run crossfire with debug, and enter DM-mode, you can trigger
393 * this with the O key.
394 */
395
396void
397dump_all_archetypes (void)
398{
399 archetype *
400 at;
401
402 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
403 {
404 dump_arch (at);
405 fprintf (logfile, "%s\n", errmsg);
406 }
407}
408
409void 368void
410free_all_archs (void) 369free_all_archs (void)
411{ 370{
412 archetype * 371 archetype *at, *next;
413 at, *
414 next;
415 int
416 i = 0, f = 0; 372 int i = 0, f = 0;
417 373
418 for (at = first_archetype; at != NULL; at = next) 374 for (at = first_archetype; at != NULL; at = next)
419 { 375 {
420 if (at->more) 376 if (at->more)
421 next = at->more; 377 next = at->more;
446 * of archetype-structures. 402 * of archetype-structures.
447 */ 403 */
448void 404void
449first_arch_pass (object_thawer & fp) 405first_arch_pass (object_thawer & fp)
450{ 406{
451 archetype *
452 at, *
453 head = NULL, *last_more = NULL; 407 archetype *at, *head = NULL, *last_more = NULL;
454 408
455 at->clone.arch = first_archetype = at = new archetype; 409 at->clone.arch = first_archetype = at = new archetype;
456 410
457 while (int i = load_object (fp, &at->clone, 0)) 411 while (int i = load_object (fp, &at->clone, 0))
458 { 412 {
527 */ 481 */
528 482
529void 483void
530second_arch_pass (object_thawer & thawer) 484second_arch_pass (object_thawer & thawer)
531{ 485{
532 char
533 buf[MAX_BUF], *
534 variable = buf, *argument, *cp; 486 char buf[MAX_BUF], *variable = buf, *argument, *cp;
535 archetype *
536 at = NULL, *other; 487 archetype *at = NULL, *other;
537 488
538 while (fgets (buf, MAX_BUF, thawer) != NULL) 489 while (fgets (buf, MAX_BUF, thawer) != NULL)
539 { 490 {
540 if (*buf == '#') 491 if (*buf == '#')
541 continue; 492 continue;
549 cp--; 500 cp--;
550 } 501 }
551 } 502 }
552 if (!strcmp ("Object", variable)) 503 if (!strcmp ("Object", variable))
553 { 504 {
554 if ((at = find_archetype (argument)) == NULL) 505 if ((at = archetype::find (argument)) == NULL)
555 LOG (llevError, "Warning: failed to find arch %s\n", argument); 506 LOG (llevError, "Warning: failed to find arch %s\n", argument);
556 } 507 }
557 else if (!strcmp ("other_arch", variable)) 508 else if (!strcmp ("other_arch", variable))
558 { 509 {
559 if (at != NULL && at->clone.other_arch == NULL) 510 if (at != NULL && at->clone.other_arch == NULL)
560 { 511 {
561 if ((other = find_archetype (argument)) == NULL) 512 if ((other = archetype::find (argument)) == NULL)
562 LOG (llevError, "Warning: failed to find other_arch %s\n", argument); 513 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
563 else if (at != NULL) 514 else if (at != NULL)
564 at->clone.other_arch = other; 515 at->clone.other_arch = other;
565 } 516 }
566 } 517 }
567 else if (!strcmp ("randomitems", variable)) 518 else if (!strcmp ("randomitems", variable))
568 { 519 {
569 if (at != NULL) 520 if (at != NULL)
570 { 521 {
571 treasurelist *
572 tl = find_treasurelist (argument); 522 treasurelist *tl = find_treasurelist (argument);
573 523
574 if (tl == NULL) 524 if (tl == NULL)
575 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); 525 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
576 else 526 else
577 at->clone.randomitems = tl; 527 at->clone.randomitems = tl;
582 532
583#ifdef DEBUG 533#ifdef DEBUG
584void 534void
585check_generators (void) 535check_generators (void)
586{ 536{
587 archetype * 537 archetype *at;
588 at;
589 538
590 for (at = first_archetype; at != NULL; at = at->next) 539 for (at = first_archetype; at != NULL; at = at->next)
591 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) 540 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
592 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); 541 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
593} 542}
601 */ 550 */
602 551
603void 552void
604load_archetypes (void) 553load_archetypes (void)
605{ 554{
606 char
607 filename[MAX_BUF]; 555 char filename[MAX_BUF];
608 556
609#if TIME_ARCH_LOAD 557#if TIME_ARCH_LOAD
610 struct timeval 558 struct timeval
611 tv1, 559 tv1,
612 tv2; 560 tv2;
650 */ 598 */
651 599
652object * 600object *
653arch_to_object (archetype *at) 601arch_to_object (archetype *at)
654{ 602{
655 object * 603 object *op;
656 op;
657 604
658 if (at == NULL) 605 if (at == NULL)
659 { 606 {
660 if (warn_archetypes) 607 if (warn_archetypes)
661 LOG (llevError, "Couldn't find archetype.\n"); 608 LOG (llevError, "Couldn't find archetype.\n");
678 */ 625 */
679 626
680object * 627object *
681create_singularity (const char *name) 628create_singularity (const char *name)
682{ 629{
683 object * 630 object *op;
684 op;
685 char
686 buf[MAX_BUF]; 631 char buf[MAX_BUF];
687 632
688 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); 633 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
689 op = get_object (); 634 op = get_object ();
690 op->name = op->name_pl = buf; 635 op->name = op->name_pl = buf;
691 SET_FLAG (op, FLAG_NO_PICK); 636 SET_FLAG (op, FLAG_NO_PICK);
698 */ 643 */
699 644
700object * 645object *
701get_archetype (const char *name) 646get_archetype (const char *name)
702{ 647{
703 archetype * 648 archetype *at = archetype::find (name);
704 at;
705 649
706 at = find_archetype (name); 650 if (!at)
707 if (at == NULL)
708 return create_singularity (name); 651 return create_singularity (name);
709 652
710 return arch_to_object (at); 653 return arch_to_object (at);
711} 654}
712 655
715 */ 658 */
716 659
717unsigned long 660unsigned long
718hasharch (const char *str, int tablesize) 661hasharch (const char *str, int tablesize)
719{ 662{
720 unsigned long 663 unsigned long hash = 0;
721 hash = 0;
722 unsigned int 664 unsigned int i = 0;
723 i = 0;
724 const char * 665 const char *p;
725 p;
726 666
727 /* use the one-at-a-time hash function, which supposedly is 667 /* use the one-at-a-time hash function, which supposedly is
728 * better than the djb2-like one used by perl5.005, but 668 * better than the djb2-like one used by perl5.005, but
729 * certainly is better then the bug used here before. 669 * certainly is better then the bug used here before.
730 * see http://burtleburtle.net/bob/hash/doobs.html 670 * see http://burtleburtle.net/bob/hash/doobs.html
747 * Finds, using the hashtable, which archetype matches the given name. 687 * Finds, using the hashtable, which archetype matches the given name.
748 * returns a pointer to the found archetype, otherwise NULL. 688 * returns a pointer to the found archetype, otherwise NULL.
749 */ 689 */
750 690
751archetype * 691archetype *
752find_archetype (const char *name) 692archetype::find (const char *name)
753{ 693{
754#if USE_UNORDERED_MAP
755 name = shstr::find (name);
756
757 if (!name) 694 if (!name)
758 return 0; 695 return 0;
759 696
697#if USE_UNORDERED_MAP
760 AUTODECL (i, ht.find ((size_t) name)); 698 AUTODECL (i, ht.find ((size_t) name));
761 699
762 if (i == ht.end ()) 700 if (i == ht.end ())
763 return 0; 701 return 0;
764 else 702 else
765 return i->second; 703 return i->second;
766#endif 704#endif
767 705
768 archetype * 706 archetype *at;
769 at;
770 unsigned long 707 unsigned long index;
771 index;
772
773 if (name == NULL)
774 return (archetype *) NULL;
775 708
776 index = hasharch (name, ARCHTABLE); 709 index = hasharch (name, ARCHTABLE);
777 arch_search++; 710 arch_search++;
778 for (;;) 711 for (;;)
779 { 712 {
780 at = arch_table[index]; 713 at = arch_table[index];
714
781 if (at == NULL) 715 if (at == NULL)
782 { 716 {
783 if (warn_archetypes) 717 if (warn_archetypes)
784 LOG (llevError, "Couldn't find archetype %s\n", name); 718 LOG (llevError, "Couldn't find archetype %s\n", name);
719
785 return NULL; 720 return NULL;
786 } 721 }
722
787 arch_cmp++; 723 arch_cmp++;
724
788 if (!strcmp ((const char *) at->name, name)) 725 if (!strcmp ((const char *) at->name, name))
789 return at; 726 return at;
727
790 if (++index >= ARCHTABLE) 728 if (++index >= ARCHTABLE)
791 index = 0; 729 index = 0;
792 } 730 }
793} 731}
794 732
801{ 739{
802#if USE_UNORDERED_MAP 740#if USE_UNORDERED_MAP
803 ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); 741 ht.insert (std::make_pair ((size_t) (const char *) at->name, at));
804#endif 742#endif
805 743
806 int
807 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 744 int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index;
808 745
809 for (;;) 746 for (;;)
810 { 747 {
811 if (arch_table[index] == NULL) 748 if (arch_table[index] == NULL)
812 { 749 {
828 */ 765 */
829 766
830archetype * 767archetype *
831type_to_archetype (int type) 768type_to_archetype (int type)
832{ 769{
833 archetype * 770 archetype *at;
834 at;
835 771
836 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) 772 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
837 if (at->clone.type == type) 773 if (at->clone.type == type)
838 return at; 774 return at;
775
839 return NULL; 776 return 0;
840} 777}
841 778
842/* 779/*
843 * Returns a new object copied from the first archetype matching 780 * Returns a new object copied from the first archetype matching
844 * the given type. 781 * the given type.
846 */ 783 */
847 784
848object * 785object *
849clone_arch (int type) 786clone_arch (int type)
850{ 787{
851 archetype * 788 archetype *at;
852 at;
853 object *
854 op = get_object (); 789 object *op = get_object ();
855 790
856 if ((at = type_to_archetype (type)) == NULL) 791 if ((at = type_to_archetype (type)) == NULL)
857 { 792 {
858 LOG (llevError, "Can't clone archetype %d\n", type); 793 LOG (llevError, "Can't clone archetype %d\n", type);
859 free_object (op); 794 free_object (op);
860 return NULL; 795 return NULL;
861 } 796 }
797
862 copy_object (&at->clone, op); 798 copy_object (&at->clone, op);
863 op->instantiate (); 799 op->instantiate ();
864 return op; 800 return op;
865} 801}
866 802
869 */ 805 */
870 806
871object * 807object *
872object_create_arch (archetype *at) 808object_create_arch (archetype *at)
873{ 809{
874 object * 810 object *op, *prev = 0, *head = 0;
875 op, *
876 prev = NULL, *head = NULL;
877 811
878 while (at) 812 while (at)
879 { 813 {
880 op = arch_to_object (at); 814 op = arch_to_object (at);
881 op->x = at->clone.x; 815 op->x = at->clone.x;
882 op->y = at->clone.y; 816 op->y = at->clone.y;
817
883 if (head) 818 if (head)
884 op->head = head, prev->more = op; 819 op->head = head, prev->more = op;
820
885 if (!head) 821 if (!head)
886 head = op; 822 head = op;
823
887 prev = op; 824 prev = op;
888 at = at->more; 825 at = at->more;
889 } 826 }
827
890 return (head); 828 return (head);
891} 829}
892 830
893/*** end of arch.c ***/

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines