ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.28 by root, Mon Sep 11 12:10:21 2006 UTC vs.
Revision 1.39 by root, Wed Sep 13 02:05:19 2006 UTC

1
1/* 2/*
2 CrossFire, A Multiplayer game for X-windows 3 CrossFire, A Multiplayer game for X-windows
3 4
4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 Copyright (C) 1992 Frank Tore Johansen
… …
28#include <stdio.h> 29#include <stdio.h>
29#include <sys/types.h> 30#include <sys/types.h>
30#include <sys/uio.h> 31#include <sys/uio.h>
31#include <object.h> 32#include <object.h>
32#include <funcpoint.h> 33#include <funcpoint.h>
33#include <skills.h>
34#include <loader.h> 34#include <loader.h>
35 35
36int nrofallocobjects = 0; 36int nrofallocobjects = 0;
37static UUID uuid;
38const uint64 UUID_SKIP = 1<<19;
37 39
38object *objects; /* Pointer to the list of used objects */ 40object *objects; /* Pointer to the list of used objects */
39object *active_objects; /* List of active objects that need to be processed */ 41object *active_objects; /* List of active objects that need to be processed */
40 42
41short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 43short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
… …
49}; 51};
50int freedir[SIZEOFFREE] = { 52int freedir[SIZEOFFREE] = {
51 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 53 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
52 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 54 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
53}; 55};
56
57static void
58write_uuid (void)
59{
60 char filename1[MAX_BUF], filename2[MAX_BUF];
61
62 sprintf (filename1, "%s/uuid", settings.localdir);
63 sprintf (filename2, "%s/uuid~", settings.localdir);
64
65 FILE *fp;
66
67 if (!(fp = fopen (filename2, "w")))
68 {
69 LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
70 return;
71 }
72
73 fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
74 fclose (fp);
75 rename (filename2, filename1);
76}
77
78static void
79read_uuid (void)
80{
81 char filename[MAX_BUF];
82
83 sprintf (filename, "%s/uuid", settings.localdir);
84
85 FILE *fp;
86
87 if (!(fp = fopen (filename, "r")))
88 {
89 if (errno == ENOENT)
90 {
91 LOG (llevInfo, "RESET uid to 1\n");
92 uuid.seq = 0;
93 write_uuid ();
94 return;
95 }
96
97 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98 _exit (1);
99 }
100
101 int version;
102 unsigned long long uid;
103 if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)
104 {
105 LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
106 _exit (1);
107 }
108
109 uuid.seq = uid;
110 write_uuid ();
111 LOG (llevDebug, "read UID: %lld\n", uid);
112 fclose (fp);
113}
114
115UUID
116gen_uuid ()
117{
118 UUID uid;
119
120 uid.seq = ++uuid.seq;
121
122 if (!(uuid.seq & (UUID_SKIP - 1)))
123 write_uuid ();
124
125 return uid;
126}
127
128void
129init_uuid ()
130{
131 read_uuid ();
132}
54 133
55/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 134/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
56static int 135static int
57compare_ob_value_lists_one (const object *wants, const object *has) 136compare_ob_value_lists_one (const object *wants, const object *has)
58{ 137{
… …
207 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) 286 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
208 return 0; 287 return 0;
209 288
210 switch (ob1->type) 289 switch (ob1->type)
211 { 290 {
212 case SCROLL: 291 case SCROLL:
213 if (ob1->level != ob2->level) 292 if (ob1->level != ob2->level)
214 return 0; 293 return 0;
215 break; 294 break;
216 } 295 }
217 296
218 if (ob1->key_values != NULL || ob2->key_values != NULL) 297 if (ob1->key_values != NULL || ob2->key_values != NULL)
219 { 298 {
220 /* At least one of these has key_values. */ 299 /* At least one of these has key_values. */
… …
254 { 333 {
255 if (inv->inv) 334 if (inv->inv)
256 sum_weight (inv); 335 sum_weight (inv);
257 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 336 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
258 } 337 }
338
259 if (op->type == CONTAINER && op->stats.Str) 339 if (op->type == CONTAINER && op->stats.Str)
260 sum = (sum * (100 - op->stats.Str)) / 100; 340 sum = (sum * (100 - op->stats.Str)) / 100;
341
261 if (op->carrying != sum) 342 if (op->carrying != sum)
262 op->carrying = sum; 343 op->carrying = sum;
344
263 return sum; 345 return sum;
264} 346}
265 347
266/** 348/**
267 * Return the outermost environment object for a given object. 349 * Return the outermost environment object for a given object.
… …
416 */ 498 */
417 499
418object * 500object *
419find_object_name (const char *str) 501find_object_name (const char *str)
420{ 502{
421 const char *name = shstr::find (str); 503 shstr_cmp str_ (str);
422 object *op; 504 object *op;
423 505
424 for (op = objects; op != NULL; op = op->next) 506 for (op = objects; op != NULL; op = op->next)
425 if (&op->name == name) 507 if (op->name == str_)
426 break; 508 break;
427 509
428 return op; 510 return op;
429} 511}
430 512
… …
442 * Changed 2004-02-12 - if the player is setting at the play again 524 * Changed 2004-02-12 - if the player is setting at the play again
443 * prompt, he is removed, and we don't want to treat him as an owner of 525 * prompt, he is removed, and we don't want to treat him as an owner of
444 * anything, so check removed flag. I don't expect that this should break 526 * anything, so check removed flag. I don't expect that this should break
445 * anything - once an object is removed, it is basically dead anyways. 527 * anything - once an object is removed, it is basically dead anyways.
446 */ 528 */
447
448object * 529object *
449get_owner (object *op) 530object::get_owner ()
450{ 531{
451 if (op->owner == NULL) 532 if (!owner
452 return NULL; 533 || QUERY_FLAG (owner, FLAG_FREED)
534 || QUERY_FLAG (owner, FLAG_REMOVED))
535 owner = 0;
453 536
454 if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
455 return op->owner; 537 return owner;
456
457 op->owner = NULL;
458 op->ownercount = 0;
459 return NULL;
460}
461
462void
463clear_owner (object *op)
464{
465 if (!op)
466 return;
467
468 if (op->owner && op->ownercount == op->owner->count)
469 op->owner->refcount--;
470
471 op->owner = NULL;
472 op->ownercount = 0;
473} 538}
474 539
475/* 540/*
476 * Sets the owner and sets the skill and exp pointers to owner's current 541 * Sets the owner and sets the skill and exp pointers to owner's current
477 * skill and experience objects. 542 * skill and experience objects.
478 */ 543 */
479void 544void
480set_owner (object *op, object *owner) 545object::set_owner (object *owner)
481{ 546{
482 if (owner == NULL || op == NULL) 547 if (!owner)
483 return; 548 return;
484 549
485 /* next line added to allow objects which own objects */ 550 /* next line added to allow objects which own objects */
486 /* Add a check for ownercounts in here, as I got into an endless loop 551 /* Add a check for ownercounts in here, as I got into an endless loop
487 * with the fireball owning a poison cloud which then owned the 552 * with the fireball owning a poison cloud which then owned the
488 * fireball. I believe that was caused by one of the objects getting 553 * fireball. I believe that was caused by one of the objects getting
489 * freed and then another object replacing it. Since the ownercounts 554 * freed and then another object replacing it. Since the ownercounts
490 * didn't match, this check is valid and I believe that cause is valid. 555 * didn't match, this check is valid and I believe that cause is valid.
491 */ 556 */
492 while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count) 557 while (owner->owner)
493 owner = owner->owner; 558 owner = owner->owner;
494 559
495 /* IF the owner still has an owner, we did not resolve to a final owner.
496 * so lets not add to that.
497 */
498 if (owner->owner)
499 return;
500
501 op->owner = owner; 560 this->owner = owner;
502
503 op->ownercount = owner->count;
504 owner->refcount++;
505}
506
507/* Set the owner to clone's current owner and set the skill and experience
508 * objects to clone's objects (typically those objects that where the owner's
509 * current skill and experience objects at the time when clone's owner was
510 * set - not the owner's current skill and experience objects).
511 *
512 * Use this function if player created an object (e.g. fire bullet, swarm
513 * spell), and this object creates further objects whose kills should be
514 * accounted for the player's original skill, even if player has changed
515 * skills meanwhile.
516 */
517void
518copy_owner (object *op, object *clone)
519{
520 object *owner = get_owner (clone);
521
522 if (owner == NULL)
523 {
524 /* players don't have owners - they own themselves. Update
525 * as appropriate.
526 */
527 if (clone->type == PLAYER)
528 owner = clone;
529 else
530 return;
531 }
532
533 set_owner (op, owner);
534} 561}
535 562
536/* Zero the key_values on op, decrementing the shared-string 563/* Zero the key_values on op, decrementing the shared-string
537 * refcounts and freeing the links. 564 * refcounts and freeing the links.
538 */ 565 */
… …
554{ 581{
555 attachable_base::clear (); 582 attachable_base::clear ();
556 583
557 free_key_values (this); 584 free_key_values (this);
558 585
559 clear_owner (this); 586 owner = 0;
560
561 name = 0; 587 name = 0;
562 name_pl = 0; 588 name_pl = 0;
563 title = 0; 589 title = 0;
564 race = 0; 590 race = 0;
565 slaying = 0; 591 slaying = 0;
566 skill = 0; 592 skill = 0;
567 msg = 0; 593 msg = 0;
568 lore = 0; 594 lore = 0;
569 custom_name = 0; 595 custom_name = 0;
570 materialname = 0; 596 materialname = 0;
597 contr = 0;
598 below = 0;
599 above = 0;
600 inv = 0;
601 container = 0;
602 env = 0;
603 more = 0;
604 head = 0;
605 map = 0;
606 active_next = 0;
607 active_prev = 0;
571 608
572 memset (static_cast < object_pod * >(this), 0, sizeof (object_pod)); 609 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
573 610
574 SET_FLAG (this, FLAG_REMOVED); 611 SET_FLAG (this, FLAG_REMOVED);
612
613 /* What is not cleared is next, prev, and count */
614
615 expmul = 1.0;
616 face = blank_face;
617 attacked_by_count = -1;
618
619 if (settings.casting_time)
620 casting_time = -1;
575} 621}
576 622
577void object::clone (object *destination) 623void object::clone (object *destination)
578{ 624{
579 *(object_copy *) destination = *this; 625 *(object_copy *)destination = *this;
580 *(object_pod *) destination = *this; 626 *(object_pod *)destination = *this;
581 627
582 if (self || cb) 628 if (self || cb)
583 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); 629 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
584}
585
586/*
587 * clear_object() frees everything allocated by an object, and also
588 * clears all variables and flags to default settings.
589 */
590
591void
592clear_object (object *op)
593{
594 op->clear ();
595
596 op->contr = NULL;
597 op->below = NULL;
598 op->above = NULL;
599 op->inv = NULL;
600 op->container = NULL;
601 op->env = NULL;
602 op->more = NULL;
603 op->head = NULL;
604 op->map = NULL;
605 op->refcount = 0;
606 op->active_next = NULL;
607 op->active_prev = NULL;
608 /* What is not cleared is next, prev, and count */
609
610 op->expmul = 1.0;
611 op->face = blank_face;
612 op->attacked_by_count = -1;
613
614 if (settings.casting_time)
615 op->casting_time = -1;
616} 630}
617 631
618/* 632/*
619 * copy object first frees everything allocated by the second object, 633 * copy object first frees everything allocated by the second object,
620 * and then copies the contends of the first object into the second 634 * and then copies the contends of the first object into the second
621 * object, allocating what needs to be allocated. Basically, any 635 * object, allocating what needs to be allocated. Basically, any
622 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 636 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
623 * if the first object is freed, the pointers in the new object 637 * if the first object is freed, the pointers in the new object
624 * will point at garbage. 638 * will point at garbage.
625 */ 639 */
626
627void 640void
628copy_object (object *op2, object *op) 641copy_object (object *op2, object *op)
629{ 642{
630 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 643 bool is_freed = QUERY_FLAG (op, FLAG_FREED);
631 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 644 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
… …
691/* 704/*
692 * Updates the speed of an object. If the speed changes from 0 to another 705 * Updates the speed of an object. If the speed changes from 0 to another
693 * value, or vice versa, then add/remove the object from the active list. 706 * value, or vice versa, then add/remove the object from the active list.
694 * This function needs to be called whenever the speed of an object changes. 707 * This function needs to be called whenever the speed of an object changes.
695 */ 708 */
696
697void 709void
698update_ob_speed (object *op) 710update_ob_speed (object *op)
699{ 711{
700 extern int arch_init; 712 extern int arch_init;
701 713
… …
710 abort (); 722 abort ();
711#else 723#else
712 op->speed = 0; 724 op->speed = 0;
713#endif 725#endif
714 } 726 }
727
715 if (arch_init) 728 if (arch_init)
716 {
717 return; 729 return;
718 } 730
719 if (FABS (op->speed) > MIN_ACTIVE_SPEED) 731 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
720 { 732 {
721 /* If already on active list, don't do anything */ 733 /* If already on active list, don't do anything */
722 if (op->active_next || op->active_prev || op == active_objects) 734 if (op->active_next || op->active_prev || op == active_objects)
723 return; 735 return;
724 736
725 /* process_events() expects us to insert the object at the beginning 737 /* process_events() expects us to insert the object at the beginning
726 * of the list. */ 738 * of the list. */
727 op->active_next = active_objects; 739 op->active_next = active_objects;
740
728 if (op->active_next != NULL) 741 if (op->active_next != NULL)
729 op->active_next->active_prev = op; 742 op->active_next->active_prev = op;
743
730 active_objects = op; 744 active_objects = op;
731 } 745 }
732 else 746 else
733 { 747 {
734 /* If not on the active list, nothing needs to be done */ 748 /* If not on the active list, nothing needs to be done */
… …
736 return; 750 return;
737 751
738 if (op->active_prev == NULL) 752 if (op->active_prev == NULL)
739 { 753 {
740 active_objects = op->active_next; 754 active_objects = op->active_next;
755
741 if (op->active_next != NULL) 756 if (op->active_next != NULL)
742 op->active_next->active_prev = NULL; 757 op->active_next->active_prev = NULL;
743 } 758 }
744 else 759 else
745 { 760 {
746 op->active_prev->active_next = op->active_next; 761 op->active_prev->active_next = op->active_next;
762
747 if (op->active_next) 763 if (op->active_next)
748 op->active_next->active_prev = op->active_prev; 764 op->active_next->active_prev = op->active_prev;
749 } 765 }
766
750 op->active_next = NULL; 767 op->active_next = NULL;
751 op->active_prev = NULL; 768 op->active_prev = NULL;
752 } 769 }
753} 770}
754 771
… …
886 * that is being removed. 903 * that is being removed.
887 */ 904 */
888 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 905 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
889 update_now = 1; 906 update_now = 1;
890 else if (action == UP_OBJ_FACE) 907 else if (action == UP_OBJ_FACE)
891 /* Nothing to do for that case */; 908 /* Nothing to do for that case */ ;
892 else 909 else
893 LOG (llevError, "update_object called with invalid action: %d\n", action); 910 LOG (llevError, "update_object called with invalid action: %d\n", action);
894 911
895 if (update_now) 912 if (update_now)
896 { 913 {
… …
901 if (op->more != NULL) 918 if (op->more != NULL)
902 update_object (op->more, action); 919 update_object (op->more, action);
903} 920}
904 921
905static unordered_vector<object *> mortals; 922static unordered_vector<object *> mortals;
906static std::vector<object *> freed; 923static std::vector<object *, slice_allocator <object *> > freed;
907 924
908void object::free_mortals () 925void object::free_mortals ()
909{ 926{
910 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end (); ) 927 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)
911 if (!(*i)->refcount) 928 if ((*i)->refcnt)
929 ++i; // further delay freeing
930 else
912 { 931 {
913 freed.push_back (*i); 932 freed.push_back (*i);//D
933 //delete *i;
914 mortals.erase (i); 934 mortals.erase (i);
915 } 935 }
916 else 936
917 ++i; 937 if (mortals.size() && 0)//D
938 LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D
918} 939}
919 940
920object::object () 941object::object ()
921{ 942{
922 SET_FLAG (this, FLAG_REMOVED); 943 SET_FLAG (this, FLAG_REMOVED);
… …
945} 966}
946 967
947void object::unlink () 968void object::unlink ()
948{ 969{
949 count = 0; 970 count = 0;
971 uuid = gen_uuid ();
972
973 if (this == objects)
974 objects = next;
950 975
951 /* Remove this object from the list of used objects */ 976 /* Remove this object from the list of used objects */
952 if (prev) 977 if (prev)
953 { 978 {
954 prev->next = next; 979 prev->next = next;
… …
958 if (next) 983 if (next)
959 { 984 {
960 next->prev = prev; 985 next->prev = prev;
961 next = 0; 986 next = 0;
962 } 987 }
963
964 if (this == objects)
965 objects = next;
966} 988}
967 989
968object *object::create () 990object *object::create ()
969{ 991{
970 object *op; 992 object *op;
… …
972 if (freed.empty ()) 994 if (freed.empty ())
973 op = new object; 995 op = new object;
974 else 996 else
975 { 997 {
976 // highly annoying, but the only way to get it stable right now 998 // highly annoying, but the only way to get it stable right now
977 op = freed.back (); freed.pop_back (); 999 op = freed.back ();
1000 freed.pop_back ();
978 op->~object (); 1001 op->~object ();
979 new ((void *)op) object; 1002 new ((void *) op) object;
980 } 1003 }
981 1004
982 op->link (); 1005 op->link ();
983 return op; 1006 return op;
984} 1007}
… …
993 * If free_inventory is set, free inventory as well. Else drop items in 1016 * If free_inventory is set, free inventory as well. Else drop items in
994 * inventory to the ground. 1017 * inventory to the ground.
995 */ 1018 */
996void object::free (bool free_inventory) 1019void object::free (bool free_inventory)
997{ 1020{
1021 if (QUERY_FLAG (this, FLAG_FREED))
1022 return;
1023
1024 if (QUERY_FLAG (this, FLAG_FRIENDLY))
1025 remove_friendly_object (this);
1026
998 if (!QUERY_FLAG (this, FLAG_REMOVED)) 1027 if (!QUERY_FLAG (this, FLAG_REMOVED))
999 { 1028 remove_ob (this);
1000 LOG (llevDebug, "Free object called with non removed object\n");
1001 dump_object (this);
1002#ifdef MANY_CORES
1003 abort ();
1004#endif
1005 }
1006 1029
1007 if (QUERY_FLAG (this, FLAG_FRIENDLY))
1008 {
1009 LOG (llevMonster, "Warning: tried to free friendly object.\n");
1010 remove_friendly_object (this);
1011 }
1012
1013 if (QUERY_FLAG (this, FLAG_FREED)) 1030 SET_FLAG (this, FLAG_FREED);
1014 {
1015 dump_object (this);
1016 LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
1017 return;
1018 }
1019 1031
1020 if (more) 1032 if (more)
1021 { 1033 {
1022 more->free (free_inventory); 1034 more->free (free_inventory);
1023 more = 0; 1035 more = 0;
… …
1027 { 1039 {
1028 /* Only if the space blocks everything do we not process - 1040 /* Only if the space blocks everything do we not process -
1029 * if some form of movement is allowed, let objects 1041 * if some form of movement is allowed, let objects
1030 * drop on that space. 1042 * drop on that space.
1031 */ 1043 */
1032 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)) 1044 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1033 { 1045 {
1034 object * 1046 object *op = inv;
1035 op = inv;
1036 1047
1037 while (op) 1048 while (op)
1038 { 1049 {
1039 object *
1040 tmp = op->below; 1050 object *tmp = op->below;
1041
1042 remove_ob (op);
1043 op->free (free_inventory); 1051 op->free (free_inventory);
1044 op = tmp; 1052 op = tmp;
1045 } 1053 }
1046 } 1054 }
1047 else 1055 else
1048 { /* Put objects in inventory onto this space */ 1056 { /* Put objects in inventory onto this space */
1049 object * 1057 object *op = inv;
1050 op = inv;
1051 1058
1052 while (op) 1059 while (op)
1053 { 1060 {
1054 object *
1055 tmp = op->below; 1061 object *tmp = op->below;
1056 1062
1057 remove_ob (op); 1063 remove_ob (op);
1058 1064
1059 if (QUERY_FLAG (op, FLAG_STARTEQUIP) 1065 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1060 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) 1066 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
… …
1069 op = tmp; 1075 op = tmp;
1070 } 1076 }
1071 } 1077 }
1072 } 1078 }
1073 1079
1074 clear_owner (this); 1080 owner = 0;
1075 1081
1076 /* Remove object from the active list */ 1082 /* Remove object from the active list */
1077 speed = 0; 1083 speed = 0;
1078 update_ob_speed (this); 1084 update_ob_speed (this);
1079 1085
1080 unlink (); 1086 unlink ();
1081
1082 SET_FLAG (this, FLAG_FREED);
1083 1087
1084 mortals.push_back (this); 1088 mortals.push_back (this);
1085} 1089}
1086 1090
1087/* 1091/*
… …
1113 */ 1117 */
1114 1118
1115void 1119void
1116remove_ob (object *op) 1120remove_ob (object *op)
1117{ 1121{
1118 object *tmp, *last = NULL;
1119 object *otmp; 1122 object *
1123 tmp, *
1124 last = NULL;
1125 object *
1126 otmp;
1120 1127
1121 tag_t tag; 1128 tag_t
1129 tag;
1130 int
1122 int check_walk_off; 1131 check_walk_off;
1123 mapstruct *m; 1132 mapstruct *
1133 m;
1124 1134
1125 sint16 x, y; 1135 sint16
1136 x,
1137 y;
1126 1138
1127 if (QUERY_FLAG (op, FLAG_REMOVED)) 1139 if (QUERY_FLAG (op, FLAG_REMOVED))
1128 { 1140 return;
1129 dump_object (op);
1130 LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg);
1131 1141
1132 /* Changed it to always dump core in this case. As has been learned 1142 SET_FLAG (op, FLAG_REMOVED);
1133 * in the past, trying to recover from errors almost always
1134 * make things worse, and this is a real error here - something
1135 * that should not happen.
1136 * Yes, if this was a mission critical app, trying to do something
1137 * to recover may make sense, but that is because failure of the app
1138 * may have other disastrous problems. Cf runs out of a script
1139 * so is easily enough restarted without any real problems.
1140 * MSW 2001-07-01
1141 */
1142 abort ();
1143 }
1144 1143
1145 if (op->more != NULL) 1144 if (op->more != NULL)
1146 remove_ob (op->more); 1145 remove_ob (op->more);
1147
1148 SET_FLAG (op, FLAG_REMOVED);
1149 1146
1150 /* 1147 /*
1151 * In this case, the object to be removed is in someones 1148 * In this case, the object to be removed is in someones
1152 * inventory. 1149 * inventory.
1153 */ 1150 */
… …
1179 */ 1176 */
1180 op->x = op->env->x, op->y = op->env->y; 1177 op->x = op->env->x, op->y = op->env->y;
1181 op->map = op->env->map; 1178 op->map = op->env->map;
1182 op->above = NULL, op->below = NULL; 1179 op->above = NULL, op->below = NULL;
1183 op->env = NULL; 1180 op->env = NULL;
1184 return; 1181 }
1182 else if (op->map)
1185 } 1183 {
1186
1187 /* If we get here, we are removing it from a map */
1188 if (op->map == NULL)
1189 return;
1190
1191 x = op->x; 1184 x = op->x;
1192 y = op->y; 1185 y = op->y;
1193 m = get_map_from_coord (op->map, &x, &y); 1186 m = get_map_from_coord (op->map, &x, &y);
1194 1187
1195 if (!m) 1188 if (!m)
1196 { 1189 {
1197 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", 1190 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1198 op->map->path, op->x, op->y); 1191 op->map->path, op->x, op->y);
1199 /* in old days, we used to set x and y to 0 and continue. 1192 /* in old days, we used to set x and y to 0 and continue.
1200 * it seems if we get into this case, something is probablye 1193 * it seems if we get into this case, something is probablye
1201 * screwed up and should be fixed. 1194 * screwed up and should be fixed.
1195 */
1196 abort ();
1197 }
1198
1199 if (op->map != m)
1200 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1201 op->map->path, m->path, op->x, op->y, x, y);
1202
1203 /* Re did the following section of code - it looks like it had
1204 * lots of logic for things we no longer care about
1202 */ 1205 */
1203 abort ();
1204 }
1205 if (op->map != m)
1206 {
1207 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1208 op->map->path, m->path, op->x, op->y, x, y);
1209 }
1210 1206
1211 /* Re did the following section of code - it looks like it had
1212 * lots of logic for things we no longer care about
1213 */
1214
1215 /* link the object above us */ 1207 /* link the object above us */
1216 if (op->above) 1208 if (op->above)
1217 op->above->below = op->below; 1209 op->above->below = op->below;
1218 else 1210 else
1219 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ 1211 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1220 1212
1221 /* Relink the object below us, if there is one */ 1213 /* Relink the object below us, if there is one */
1222 if (op->below) 1214 if (op->below)
1223 op->below->above = op->above; 1215 op->below->above = op->above;
1224 else 1216 else
1225 { 1217 {
1226 /* Nothing below, which means we need to relink map object for this space 1218 /* Nothing below, which means we need to relink map object for this space
1227 * use translated coordinates in case some oddness with map tiling is 1219 * use translated coordinates in case some oddness with map tiling is
1228 * evident 1220 * evident
1229 */
1230 if (GET_MAP_OB (m, x, y) != op)
1231 {
1232 dump_object (op);
1233 LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n",
1234 errmsg);
1235 dump_object (GET_MAP_OB (m, x, y));
1236 LOG (llevError, "%s\n", errmsg);
1237 }
1238
1239 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1240 }
1241
1242 op->above = NULL;
1243 op->below = NULL;
1244
1245 if (op->map->in_memory == MAP_SAVING)
1246 return;
1247
1248 tag = op->count;
1249 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1250
1251 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1252 {
1253 /* No point updating the players look faces if he is the object
1254 * being removed.
1255 */
1256
1257 if (tmp->type == PLAYER && tmp != op)
1258 {
1259 /* If a container that the player is currently using somehow gets
1260 * removed (most likely destroyed), update the player view
1261 * appropriately.
1262 */ 1221 */
1263 if (tmp->container == op) 1222 if (GET_MAP_OB (m, x, y) != op)
1264 { 1223 {
1265 CLEAR_FLAG (op, FLAG_APPLIED); 1224 dump_object (op);
1266 tmp->container = NULL; 1225 LOG (llevError,
1226 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);
1227 dump_object (GET_MAP_OB (m, x, y));
1228 LOG (llevError, "%s\n", errmsg);
1267 } 1229 }
1268 1230
1269 tmp->contr->socket.update_look = 1; 1231 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1270 }
1271 /* See if player moving off should effect something */
1272 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1273 { 1232 }
1274 move_apply (tmp, op, NULL);
1275 1233
1276 if (was_destroyed (op, tag)) 1234 op->above = 0;
1235 op->below = 0;
1236
1237 if (op->map->in_memory == MAP_SAVING)
1238 return;
1239
1240 tag = op->count;
1241 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1242
1243 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1244 {
1245 /* No point updating the players look faces if he is the object
1246 * being removed.
1247 */
1248
1249 if (tmp->type == PLAYER && tmp != op)
1277 { 1250 {
1278 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1251 /* If a container that the player is currently using somehow gets
1252 * removed (most likely destroyed), update the player view
1253 * appropriately.
1254 */
1255 if (tmp->container == op)
1256 {
1257 CLEAR_FLAG (op, FLAG_APPLIED);
1258 tmp->container = NULL;
1259 }
1260
1261 tmp->contr->socket.update_look = 1;
1279 } 1262 }
1263
1264 /* See if player moving off should effect something */
1265 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1266 {
1267 move_apply (tmp, op, NULL);
1268
1269 if (was_destroyed (op, tag))
1270 {
1271 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
1272 }
1280 } 1273 }
1281 1274
1282 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1275 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1283 1276
1284 if (tmp->above == tmp) 1277 if (tmp->above == tmp)
1285 tmp->above = NULL; 1278 tmp->above = NULL;
1286 1279
1287 last = tmp; 1280 last = tmp;
1288 } 1281 }
1289 1282
1290 /* last == NULL of there are no objects on this space */ 1283 /* last == NULL of there are no objects on this space */
1291 if (last == NULL) 1284 if (last == NULL)
1292 { 1285 {
1293 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, 1286 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1294 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures 1287 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1295 * those out anyways, and if there are any flags set right now, they won't 1288 * those out anyways, and if there are any flags set right now, they won't
1296 * be correct anyways. 1289 * be correct anyways.
1297 */ 1290 */
1298 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); 1291 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1299 update_position (op->map, op->x, op->y); 1292 update_position (op->map, op->x, op->y);
1300 } 1293 }
1301 else 1294 else
1302 update_object (last, UP_OBJ_REMOVE); 1295 update_object (last, UP_OBJ_REMOVE);
1303 1296
1304 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1297 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1305 update_all_los (op->map, op->x, op->y); 1298 update_all_los (op->map, op->x, op->y);
1299 }
1306} 1300}
1307 1301
1308/* 1302/*
1309 * merge_ob(op,top): 1303 * merge_ob(op,top):
1310 * 1304 *
1311 * This function goes through all objects below and including top, and 1305 * This function goes through all objects below and including top, and
1312 * merges op to the first matching object. 1306 * merges op to the first matching object.
1313 * If top is NULL, it is calculated. 1307 * If top is NULL, it is calculated.
1314 * Returns pointer to object if it succeded in the merge, otherwise NULL 1308 * Returns pointer to object if it succeded in the merge, otherwise NULL
1315 */ 1309 */
1316
1317object * 1310object *
1318merge_ob (object *op, object *top) 1311merge_ob (object *op, object *top)
1319{ 1312{
1320 if (!op->nrof) 1313 if (!op->nrof)
1321 return 0; 1314 return 0;
1315
1322 if (top == NULL) 1316 if (top == NULL)
1323 for (top = op; top != NULL && top->above != NULL; top = top->above); 1317 for (top = op; top != NULL && top->above != NULL; top = top->above);
1318
1324 for (; top != NULL; top = top->below) 1319 for (; top != NULL; top = top->below)
1325 { 1320 {
1326 if (top == op) 1321 if (top == op)
1327 continue; 1322 continue;
1328 if (CAN_MERGE (op, top)) 1323 if (CAN_MERGE (op, top))
… …
1334 remove_ob (op); 1329 remove_ob (op);
1335 free_object (op); 1330 free_object (op);
1336 return top; 1331 return top;
1337 } 1332 }
1338 } 1333 }
1334
1339 return NULL; 1335 return NULL;
1340} 1336}
1341 1337
1342/* 1338/*
1343 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1339 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1344 * job preparing multi-part monsters 1340 * job preparing multi-part monsters
1345 */ 1341 */
1346object * 1342object *
1347insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1343insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)
1348{ 1344{
1349 object * 1345 object *tmp;
1350 tmp;
1351 1346
1352 if (op->head) 1347 if (op->head)
1353 op = op->head; 1348 op = op->head;
1349
1354 for (tmp = op; tmp; tmp = tmp->more) 1350 for (tmp = op; tmp; tmp = tmp->more)
1355 { 1351 {
1356 tmp->x = x + tmp->arch->clone.x; 1352 tmp->x = x + tmp->arch->clone.x;
1357 tmp->y = y + tmp->arch->clone.y; 1353 tmp->y = y + tmp->arch->clone.y;
1358 } 1354 }
1355
1359 return insert_ob_in_map (op, m, originator, flag); 1356 return insert_ob_in_map (op, m, originator, flag);
1360} 1357}
1361 1358
1362/* 1359/*
1363 * insert_ob_in_map (op, map, originator, flag): 1360 * insert_ob_in_map (op, map, originator, flag):
… …
1654 * op is the object to insert it under: supplies x and the map. 1651 * op is the object to insert it under: supplies x and the map.
1655 */ 1652 */
1656void 1653void
1657replace_insert_ob_in_map (const char *arch_string, object *op) 1654replace_insert_ob_in_map (const char *arch_string, object *op)
1658{ 1655{
1659 object *tmp; 1656 object *
1657 tmp;
1660 object *tmp1; 1658 object *
1659 tmp1;
1661 1660
1662 /* first search for itself and remove any old instances */ 1661 /* first search for itself and remove any old instances */
1663 1662
1664 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1663 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1665 { 1664 {
… …
1696 if (orig_ob->nrof < nr) 1695 if (orig_ob->nrof < nr)
1697 { 1696 {
1698 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1697 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1699 return NULL; 1698 return NULL;
1700 } 1699 }
1700
1701 newob = object_create_clone (orig_ob); 1701 newob = object_create_clone (orig_ob);
1702
1702 if ((orig_ob->nrof -= nr) < 1) 1703 if ((orig_ob->nrof -= nr) < 1)
1703 { 1704 {
1704 if (!is_removed) 1705 if (!is_removed)
1705 remove_ob (orig_ob); 1706 remove_ob (orig_ob);
1706 free_object2 (orig_ob, 1); 1707 free_object2 (orig_ob, 1);
… …
1714 strcpy (errmsg, "Tried to split object whose map is not in memory."); 1715 strcpy (errmsg, "Tried to split object whose map is not in memory.");
1715 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); 1716 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1716 return NULL; 1717 return NULL;
1717 } 1718 }
1718 } 1719 }
1720
1719 newob->nrof = nr; 1721 newob->nrof = nr;
1720 1722
1721 return newob; 1723 return newob;
1722} 1724}
1723 1725
… …
1730 */ 1732 */
1731 1733
1732object * 1734object *
1733decrease_ob_nr (object *op, uint32 i) 1735decrease_ob_nr (object *op, uint32 i)
1734{ 1736{
1735 object * 1737 object *tmp;
1736 tmp;
1737 player * 1738 player *pl;
1738 pl;
1739 1739
1740 if (i == 0) /* objects with op->nrof require this check */ 1740 if (i == 0) /* objects with op->nrof require this check */
1741 return op; 1741 return op;
1742 1742
1743 if (i > op->nrof) 1743 if (i > op->nrof)
1744 i = op->nrof; 1744 i = op->nrof;
1745 1745
1746 if (QUERY_FLAG (op, FLAG_REMOVED)) 1746 if (QUERY_FLAG (op, FLAG_REMOVED))
1747 {
1748 op->nrof -= i; 1747 op->nrof -= i;
1749 }
1750 else if (op->env != NULL) 1748 else if (op->env != NULL)
1751 { 1749 {
1752 /* is this object in the players inventory, or sub container 1750 /* is this object in the players inventory, or sub container
1753 * therein? 1751 * therein?
1754 */ 1752 */
… …
1789 } 1787 }
1790 } 1788 }
1791 } 1789 }
1792 else 1790 else
1793 { 1791 {
1794 object *
1795 above = op->above; 1792 object *above = op->above;
1796 1793
1797 if (i < op->nrof) 1794 if (i < op->nrof)
1798 {
1799 op->nrof -= i; 1795 op->nrof -= i;
1800 }
1801 else 1796 else
1802 { 1797 {
1803 remove_ob (op); 1798 remove_ob (op);
1804 op->nrof = 0; 1799 op->nrof = 0;
1805 } 1800 }
1801
1806 /* Since we just removed op, op->above is null */ 1802 /* Since we just removed op, op->above is null */
1807 for (tmp = above; tmp != NULL; tmp = tmp->above) 1803 for (tmp = above; tmp != NULL; tmp = tmp->above)
1808 if (tmp->type == PLAYER) 1804 if (tmp->type == PLAYER)
1809 { 1805 {
1810 if (op->nrof) 1806 if (op->nrof)
… …
1813 esrv_del_item (tmp->contr, op->count); 1809 esrv_del_item (tmp->contr, op->count);
1814 } 1810 }
1815 } 1811 }
1816 1812
1817 if (op->nrof) 1813 if (op->nrof)
1818 {
1819 return op; 1814 return op;
1820 }
1821 else 1815 else
1822 { 1816 {
1823 free_object (op); 1817 free_object (op);
1824 return NULL; 1818 return NULL;
1825 } 1819 }
… …
1834add_weight (object *op, signed long weight) 1828add_weight (object *op, signed long weight)
1835{ 1829{
1836 while (op != NULL) 1830 while (op != NULL)
1837 { 1831 {
1838 if (op->type == CONTAINER) 1832 if (op->type == CONTAINER)
1839 {
1840 weight = (signed long) (weight * (100 - op->stats.Str) / 100); 1833 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1841 } 1834
1842 op->carrying += weight; 1835 op->carrying += weight;
1843 op = op->env; 1836 op = op->env;
1844 } 1837 }
1845} 1838}
1846 1839
… …
1869 { 1862 {
1870 dump_object (op); 1863 dump_object (op);
1871 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); 1864 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1872 return op; 1865 return op;
1873 } 1866 }
1867
1874 if (where == NULL) 1868 if (where == NULL)
1875 { 1869 {
1876 dump_object (op); 1870 dump_object (op);
1877 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); 1871 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1878 return op; 1872 return op;
1879 } 1873 }
1874
1880 if (where->head) 1875 if (where->head)
1881 { 1876 {
1882 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); 1877 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1883 where = where->head; 1878 where = where->head;
1884 } 1879 }
1880
1885 if (op->more) 1881 if (op->more)
1886 { 1882 {
1887 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1883 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1888 return op; 1884 return op;
1889 } 1885 }
1886
1890 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1887 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1891 CLEAR_FLAG (op, FLAG_REMOVED); 1888 CLEAR_FLAG (op, FLAG_REMOVED);
1892 if (op->nrof) 1889 if (op->nrof)
1893 { 1890 {
1894 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1891 for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
… …
1979 */ 1976 */
1980 1977
1981int 1978int
1982check_move_on (object *op, object *originator) 1979check_move_on (object *op, object *originator)
1983{ 1980{
1984 object *tmp; 1981 object *
1985 tag_t tag; 1982 tmp;
1986 mapstruct *m = op->map; 1983 tag_t
1984 tag;
1985 mapstruct *
1986 m = op->map;
1987 int
1987 int x = op->x, y = op->y; 1988 x = op->x, y = op->y;
1988 1989
1989 MoveType move_on, move_slow, move_block; 1990 MoveType
1991 move_on,
1992 move_slow,
1993 move_block;
1990 1994
1991 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1995 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1992 return 0; 1996 return 0;
1993 1997
1994 tag = op->count; 1998 tag = op->count;
… …
2042 { 2046 {
2043 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 2047 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2044 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 2048 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
2045 { 2049 {
2046 2050
2051 float
2047 float diff = tmp->move_slow_penalty * FABS (op->speed); 2052 diff = tmp->move_slow_penalty * FABS (op->speed);
2048 2053
2049 if (op->type == PLAYER) 2054 if (op->type == PLAYER)
2050 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 2055 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
2051 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 2056 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
2052 diff /= 4.0; 2057 diff /= 4.0;
… …
2371find_dir (mapstruct *m, int x, int y, object *exclude) 2376find_dir (mapstruct *m, int x, int y, object *exclude)
2372{ 2377{
2373 int 2378 int
2374 i, 2379 i,
2375 max = SIZEOFFREE, mflags; 2380 max = SIZEOFFREE, mflags;
2376 sint16 2381
2377 nx, 2382 sint16 nx, ny;
2378 ny;
2379 object * 2383 object *
2380 tmp; 2384 tmp;
2381 mapstruct * 2385 mapstruct *
2382 mp; 2386 mp;
2383 MoveType 2387
2384 blocked, 2388 MoveType blocked, move_type;
2385 move_type;
2386 2389
2387 if (exclude && exclude->head) 2390 if (exclude && exclude->head)
2388 { 2391 {
2389 exclude = exclude->head; 2392 exclude = exclude->head;
2390 move_type = exclude->move_type; 2393 move_type = exclude->move_type;
… …
2597 2600
2598 2601
2599int 2602int
2600can_see_monsterP (mapstruct *m, int x, int y, int dir) 2603can_see_monsterP (mapstruct *m, int x, int y, int dir)
2601{ 2604{
2602 sint16 2605 sint16 dx, dy;
2603 dx,
2604 dy;
2605 int 2606 int
2606 mflags; 2607 mflags;
2607 2608
2608 if (dir < 0) 2609 if (dir < 0)
2609 return 0; /* exit condition: invalid direction */ 2610 return 0; /* exit condition: invalid direction */
… …
2740 fprintf (tempfile, obstr); 2741 fprintf (tempfile, obstr);
2741 fclose (tempfile); 2742 fclose (tempfile);
2742 2743
2743 op = get_object (); 2744 op = get_object ();
2744 2745
2745 object_thawer 2746 object_thawer thawer (filename);
2746 thawer (filename);
2747 2747
2748 if (thawer) 2748 if (thawer)
2749 load_object (thawer, op, 0); 2749 load_object (thawer, op, 0);
2750 2750
2751 LOG (llevDebug, " load str completed, object=%s\n", &op->name); 2751 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
… …
2802 * The returned string is shared. 2802 * The returned string is shared.
2803 */ 2803 */
2804const char * 2804const char *
2805get_ob_key_value (const object *op, const char *const key) 2805get_ob_key_value (const object *op, const char *const key)
2806{ 2806{
2807 key_value * 2807 key_value *link;
2808 link; 2808 shstr_cmp canonical_key (key);
2809 const char *
2810 canonical_key;
2811 2809
2812 canonical_key = shstr::find (key);
2813
2814 if (canonical_key == NULL) 2810 if (!canonical_key)
2815 { 2811 {
2816 /* 1. There being a field named key on any object 2812 /* 1. There being a field named key on any object
2817 * implies there'd be a shared string to find. 2813 * implies there'd be a shared string to find.
2818 * 2. Since there isn't, no object has this field. 2814 * 2. Since there isn't, no object has this field.
2819 * 3. Therefore, *this* object doesn't have this field. 2815 * 3. Therefore, *this* object doesn't have this field.
2820 */ 2816 */
2821 return NULL; 2817 return 0;
2822 } 2818 }
2823 2819
2824 /* This is copied from get_ob_key_link() above - 2820 /* This is copied from get_ob_key_link() above -
2825 * only 4 lines, and saves the function call overhead. 2821 * only 4 lines, and saves the function call overhead.
2826 */ 2822 */
2827 for (link = op->key_values; link != NULL; link = link->next) 2823 for (link = op->key_values; link; link = link->next)
2828 {
2829 if (link->key == canonical_key) 2824 if (link->key == canonical_key)
2830 {
2831 return link->value; 2825 return link->value;
2832 } 2826
2833 }
2834 return NULL; 2827 return 0;
2835} 2828}
2836 2829
2837 2830
2838/* 2831/*
2839 * Updates the canonical_key in op to value. 2832 * Updates the canonical_key in op to value.
… …
2875 if (last) 2868 if (last)
2876 last->next = field->next; 2869 last->next = field->next;
2877 else 2870 else
2878 op->key_values = field->next; 2871 op->key_values = field->next;
2879 2872
2880 delete
2881 field; 2873 delete field;
2882 } 2874 }
2883 } 2875 }
2884 return TRUE; 2876 return TRUE;
2885 } 2877 }
2886 /* IF we get here, key doesn't exist */ 2878 /* IF we get here, key doesn't exist */
… …
2921 * Returns TRUE on success. 2913 * Returns TRUE on success.
2922 */ 2914 */
2923int 2915int
2924set_ob_key_value (object *op, const char *key, const char *value, int add_key) 2916set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2925{ 2917{
2926 shstr
2927 key_ (key); 2918 shstr key_ (key);
2928 2919
2929 return set_ob_key_value_s (op, key_, value, add_key); 2920 return set_ob_key_value_s (op, key_, value, add_key);
2930} 2921}
2922
2923object::depth_iterator::depth_iterator (object *container)
2924: iterator_base (container)
2925{
2926 while (item->inv)
2927 item = item->inv;
2928}
2929
2930void
2931object::depth_iterator::next ()
2932{
2933 if (item->below)
2934 {
2935 item = item->below;
2936
2937 while (item->inv)
2938 item = item->inv;
2939 }
2940 else
2941 item = item->env;
2942}
2943
2944// return a suitable string describing an objetc in enough detail to find it
2945const char *
2946object::debug_desc (char *info) const
2947{
2948 char info2[256 * 3];
2949 char *p = info;
2950
2951 p += snprintf (p, 256, "%d=\"%s%s%s\"",
2952 count,
2953 &name,
2954 title ? " " : "",
2955 title ? (const char *)title : "");
2956
2957 if (env)
2958 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2959
2960 if (map)
2961 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
2962
2963 return info;
2964}
2965
2966const char *
2967object::debug_desc () const
2968{
2969 static char info[256 * 3];
2970 return debug_desc (info);
2971}
2972

Diff Legend

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