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.25 by root, Mon Sep 11 01:16:20 2006 UTC vs.
Revision 1.41 by root, Thu Sep 14 01:12:28 2006 UTC

1
2/*
3 * static char *rcsid_object_c =
4 * "$Id: object.C,v 1.25 2006/09/11 01:16:20 root Exp $";
5 */
6 1
7/* 2/*
8 CrossFire, A Multiplayer game for X-windows 3 CrossFire, A Multiplayer game for X-windows
9 4
10 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
… …
29 24
30/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
31 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
32 variable. */ 27 variable. */
33#include <global.h> 28#include <global.h>
34#ifndef WIN32 /* ---win32 exclude headers */
35# include <stdio.h> 29#include <stdio.h>
36# include <sys/types.h> 30#include <sys/types.h>
37# include <sys/uio.h> 31#include <sys/uio.h>
38#endif /* win32 */
39#include <object.h> 32#include <object.h>
40#include <funcpoint.h> 33#include <funcpoint.h>
41#include <skills.h>
42#include <loader.h> 34#include <loader.h>
35
43int nrofallocobjects = 0; 36int nrofallocobjects = 0;
37static UUID uuid;
38const uint64 UUID_SKIP = 1<<19;
44 39
45object *objects; /* Pointer to the list of used objects */ 40object *objects; /* Pointer to the list of used objects */
46object *active_objects; /* List of active objects that need to be processed */ 41object *active_objects; /* List of active objects that need to be processed */
47 42
48short 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,
… …
56}; 51};
57int freedir[SIZEOFFREE] = { 52int freedir[SIZEOFFREE] = {
58 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,
59 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
60}; 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}
61 133
62/* 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. */
63static int 135static int
64compare_ob_value_lists_one (const object *wants, const object *has) 136compare_ob_value_lists_one (const object *wants, const object *has)
65{ 137{
… …
214 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)
215 return 0; 287 return 0;
216 288
217 switch (ob1->type) 289 switch (ob1->type)
218 { 290 {
219 case SCROLL: 291 case SCROLL:
220 if (ob1->level != ob2->level) 292 if (ob1->level != ob2->level)
221 return 0; 293 return 0;
222 break; 294 break;
223 } 295 }
224 296
225 if (ob1->key_values != NULL || ob2->key_values != NULL) 297 if (ob1->key_values != NULL || ob2->key_values != NULL)
226 { 298 {
227 /* At least one of these has key_values. */ 299 /* At least one of these has key_values. */
… …
249/* 321/*
250 * sum_weight() is a recursive function which calculates the weight 322 * sum_weight() is a recursive function which calculates the weight
251 * an object is carrying. It goes through in figures out how much 323 * an object is carrying. It goes through in figures out how much
252 * containers are carrying, and sums it up. 324 * containers are carrying, and sums it up.
253 */ 325 */
254signed long 326long
255sum_weight (object *op) 327sum_weight (object *op)
256{ 328{
257 signed long sum; 329 long sum;
258 object *inv; 330 object *inv;
259 331
260 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 332 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
261 { 333 {
262 if (inv->inv) 334 if (inv->inv)
263 sum_weight (inv); 335 sum_weight (inv);
264 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 336 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
265 } 337 }
338
266 if (op->type == CONTAINER && op->stats.Str) 339 if (op->type == CONTAINER && op->stats.Str)
267 sum = (sum * (100 - op->stats.Str)) / 100; 340 sum = (sum * (100 - op->stats.Str)) / 100;
341
268 if (op->carrying != sum) 342 if (op->carrying != sum)
269 op->carrying = sum; 343 op->carrying = sum;
344
270 return sum; 345 return sum;
271} 346}
272 347
273/** 348/**
274 * Return the outermost environment object for a given object. 349 * Return the outermost environment object for a given object.
… …
423 */ 498 */
424 499
425object * 500object *
426find_object_name (const char *str) 501find_object_name (const char *str)
427{ 502{
428 const char *name = shstr::find (str); 503 shstr_cmp str_ (str);
429 object *op; 504 object *op;
430 505
431 for (op = objects; op != NULL; op = op->next) 506 for (op = objects; op != NULL; op = op->next)
432 if (&op->name == name) 507 if (op->name == str_)
433 break; 508 break;
434 509
435 return op; 510 return op;
436} 511}
437 512
… …
449 * 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
450 * 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
451 * 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
452 * anything - once an object is removed, it is basically dead anyways. 527 * anything - once an object is removed, it is basically dead anyways.
453 */ 528 */
454
455object * 529object *
456get_owner (object *op) 530object::get_owner ()
457{ 531{
458 if (op->owner == NULL) 532 if (!owner
459 return NULL; 533 || QUERY_FLAG (owner, FLAG_FREED)
534 || QUERY_FLAG (owner, FLAG_REMOVED))
535 owner = 0;
460 536
461 if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount)
462 return op->owner; 537 return owner;
463
464 op->owner = NULL;
465 op->ownercount = 0;
466 return NULL;
467}
468
469void
470clear_owner (object *op)
471{
472 if (!op)
473 return;
474
475 if (op->owner && op->ownercount == op->owner->count)
476 op->owner->refcount--;
477
478 op->owner = NULL;
479 op->ownercount = 0;
480} 538}
481 539
482/* 540/*
483 * 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
484 * skill and experience objects. 542 * skill and experience objects.
485 */ 543 */
486void 544void
487set_owner (object *op, object *owner) 545object::set_owner (object *owner)
488{ 546{
489 if (owner == NULL || op == NULL) 547 if (!owner)
490 return; 548 return;
491 549
492 /* next line added to allow objects which own objects */ 550 /* next line added to allow objects which own objects */
493 /* 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
494 * with the fireball owning a poison cloud which then owned the 552 * with the fireball owning a poison cloud which then owned the
495 * 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
496 * freed and then another object replacing it. Since the ownercounts 554 * freed and then another object replacing it. Since the ownercounts
497 * 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.
498 */ 556 */
499 while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count) 557 while (owner->owner)
500 owner = owner->owner; 558 owner = owner->owner;
501 559
502 /* IF the owner still has an owner, we did not resolve to a final owner.
503 * so lets not add to that.
504 */
505 if (owner->owner)
506 return;
507
508 op->owner = owner; 560 this->owner = owner;
509
510 op->ownercount = owner->count;
511 owner->refcount++;
512}
513
514/* Set the owner to clone's current owner and set the skill and experience
515 * objects to clone's objects (typically those objects that where the owner's
516 * current skill and experience objects at the time when clone's owner was
517 * set - not the owner's current skill and experience objects).
518 *
519 * Use this function if player created an object (e.g. fire bullet, swarm
520 * spell), and this object creates further objects whose kills should be
521 * accounted for the player's original skill, even if player has changed
522 * skills meanwhile.
523 */
524void
525copy_owner (object *op, object *clone)
526{
527 object *owner = get_owner (clone);
528
529 if (owner == NULL)
530 {
531 /* players don't have owners - they own themselves. Update
532 * as appropriate.
533 */
534 if (clone->type == PLAYER)
535 owner = clone;
536 else
537 return;
538 }
539
540 set_owner (op, owner);
541} 561}
542 562
543/* Zero the key_values on op, decrementing the shared-string 563/* Zero the key_values on op, decrementing the shared-string
544 * refcounts and freeing the links. 564 * refcounts and freeing the links.
545 */ 565 */
… …
561{ 581{
562 attachable_base::clear (); 582 attachable_base::clear ();
563 583
564 free_key_values (this); 584 free_key_values (this);
565 585
566 clear_owner (this); 586 owner = 0;
567
568 name = 0; 587 name = 0;
569 name_pl = 0; 588 name_pl = 0;
570 title = 0; 589 title = 0;
571 race = 0; 590 race = 0;
572 slaying = 0; 591 slaying = 0;
573 skill = 0; 592 skill = 0;
574 msg = 0; 593 msg = 0;
575 lore = 0; 594 lore = 0;
576 custom_name = 0; 595 custom_name = 0;
577 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;
578 608
579 memset (static_cast < object_pod * >(this), 0, sizeof (object_pod)); 609 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
580 610
581 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;
582} 621}
583 622
584void object::clone (object *destination) 623void object::clone (object *destination)
585{ 624{
586 *(object_copy *) destination = *this; 625 *(object_copy *)destination = *this;
587 *(object_pod *) destination = *this; 626 *(object_pod *)destination = *this;
588 627
589 if (self || cb) 628 if (self || cb)
590 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); 629 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
591}
592
593/*
594 * clear_object() frees everything allocated by an object, and also
595 * clears all variables and flags to default settings.
596 */
597
598void
599clear_object (object *op)
600{
601 op->clear ();
602
603 op->contr = NULL;
604 op->below = NULL;
605 op->above = NULL;
606 op->inv = NULL;
607 op->container = NULL;
608 op->env = NULL;
609 op->more = NULL;
610 op->head = NULL;
611 op->map = NULL;
612 op->refcount = 0;
613 op->active_next = NULL;
614 op->active_prev = NULL;
615 /* What is not cleared is next, prev, and count */
616
617 op->expmul = 1.0;
618 op->face = blank_face;
619 op->attacked_by_count = -1;
620
621 if (settings.casting_time)
622 op->casting_time = -1;
623} 630}
624 631
625/* 632/*
626 * copy object first frees everything allocated by the second object, 633 * copy object first frees everything allocated by the second object,
627 * 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
628 * object, allocating what needs to be allocated. Basically, any 635 * object, allocating what needs to be allocated. Basically, any
629 * 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,
630 * 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
631 * will point at garbage. 638 * will point at garbage.
632 */ 639 */
633
634void 640void
635copy_object (object *op2, object *op) 641copy_object (object *op2, object *op)
636{ 642{
637 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 643 bool is_freed = QUERY_FLAG (op, FLAG_FREED);
638 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 644 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
… …
698/* 704/*
699 * 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
700 * 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.
701 * 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.
702 */ 708 */
703
704void 709void
705update_ob_speed (object *op) 710update_ob_speed (object *op)
706{ 711{
707 extern int arch_init; 712 extern int arch_init;
708 713
… …
717 abort (); 722 abort ();
718#else 723#else
719 op->speed = 0; 724 op->speed = 0;
720#endif 725#endif
721 } 726 }
727
722 if (arch_init) 728 if (arch_init)
723 {
724 return; 729 return;
725 } 730
726 if (FABS (op->speed) > MIN_ACTIVE_SPEED) 731 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
727 { 732 {
728 /* If already on active list, don't do anything */ 733 /* If already on active list, don't do anything */
729 if (op->active_next || op->active_prev || op == active_objects) 734 if (op->active_next || op->active_prev || op == active_objects)
730 return; 735 return;
731 736
732 /* process_events() expects us to insert the object at the beginning 737 /* process_events() expects us to insert the object at the beginning
733 * of the list. */ 738 * of the list. */
734 op->active_next = active_objects; 739 op->active_next = active_objects;
740
735 if (op->active_next != NULL) 741 if (op->active_next != NULL)
736 op->active_next->active_prev = op; 742 op->active_next->active_prev = op;
743
737 active_objects = op; 744 active_objects = op;
738 } 745 }
739 else 746 else
740 { 747 {
741 /* If not on the active list, nothing needs to be done */ 748 /* If not on the active list, nothing needs to be done */
… …
743 return; 750 return;
744 751
745 if (op->active_prev == NULL) 752 if (op->active_prev == NULL)
746 { 753 {
747 active_objects = op->active_next; 754 active_objects = op->active_next;
755
748 if (op->active_next != NULL) 756 if (op->active_next != NULL)
749 op->active_next->active_prev = NULL; 757 op->active_next->active_prev = NULL;
750 } 758 }
751 else 759 else
752 { 760 {
753 op->active_prev->active_next = op->active_next; 761 op->active_prev->active_next = op->active_next;
762
754 if (op->active_next) 763 if (op->active_next)
755 op->active_next->active_prev = op->active_prev; 764 op->active_next->active_prev = op->active_prev;
756 } 765 }
766
757 op->active_next = NULL; 767 op->active_next = NULL;
758 op->active_prev = NULL; 768 op->active_prev = NULL;
759 } 769 }
760} 770}
761 771
… …
891 /* if the object is being removed, we can't make intelligent 901 /* if the object is being removed, we can't make intelligent
892 * decisions, because remove_ob can't really pass the object 902 * decisions, because remove_ob can't really pass the object
893 * that is being removed. 903 * that is being removed.
894 */ 904 */
895 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 905 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
896 {
897 update_now = 1; 906 update_now = 1;
898 }
899 else if (action == UP_OBJ_FACE) 907 else if (action == UP_OBJ_FACE)
900 {
901 /* Nothing to do for that case */ 908 /* Nothing to do for that case */ ;
902 }
903 else 909 else
904 {
905 LOG (llevError, "update_object called with invalid action: %d\n", action); 910 LOG (llevError, "update_object called with invalid action: %d\n", action);
906 }
907 911
908 if (update_now) 912 if (update_now)
909 { 913 {
910 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); 914 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
911 update_position (op->map, op->x, op->y); 915 update_position (op->map, op->x, op->y);
… …
914 if (op->more != NULL) 918 if (op->more != NULL)
915 update_object (op->more, action); 919 update_object (op->more, action);
916} 920}
917 921
918static unordered_vector<object *> mortals; 922static unordered_vector<object *> mortals;
919static std::vector<object *> freed; 923static std::vector<object *, slice_allocator <object *> > freed;
920 924
921void object::free_mortals () 925void object::free_mortals ()
922{ 926{
923 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end (); ) 927 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)
924 if (!(*i)->refcount) 928 if ((*i)->refcnt)
929 ++i; // further delay freeing
930 else
925 { 931 {
932 //printf ("free_mortal(%p,%ld,%ld)\n", *i, pticks, (*i)->count);//D
926 freed.push_back (*i); 933 //freed.push_back (*i);//D
934 delete *i;
927 mortals.erase (i); 935 mortals.erase (i);
928 } 936 }
929 else 937
930 ++i; 938 if (mortals.size() && 0)//D
939 LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D
931} 940}
932 941
933object::object () 942object::object ()
934{ 943{
935 SET_FLAG (this, FLAG_REMOVED); 944 SET_FLAG (this, FLAG_REMOVED);
… …
945} 954}
946 955
947void object::link () 956void object::link ()
948{ 957{
949 count = ++ob_count; 958 count = ++ob_count;
959 uuid = gen_uuid ();
950 960
951 prev = 0; 961 prev = 0;
952 next = objects; 962 next = objects;
953 963
954 if (objects) 964 if (objects)
… …
957 objects = this; 967 objects = this;
958} 968}
959 969
960void object::unlink () 970void object::unlink ()
961{ 971{
962 count = 0; 972 //count = 0;//D
963 973 if (!prev && !next) return;//D
964 /* Remove this object from the list of used objects */
965 if (prev)
966 {
967 prev->next = next;
968 prev = 0;
969 }
970
971 if (next)
972 {
973 next->prev = prev;
974 next = 0;
975 }
976 974
977 if (this == objects) 975 if (this == objects)
978 objects = next; 976 objects = next;
977
978 /* Remove this object from the list of used objects */
979 if (prev) prev->next = next;
980 if (next) next->prev = prev;
981
982 prev = 0;
983 next = 0;
979} 984}
980 985
981object *object::create () 986object *object::create ()
982{ 987{
983 object *op; 988 object *op;
… …
985 if (freed.empty ()) 990 if (freed.empty ())
986 op = new object; 991 op = new object;
987 else 992 else
988 { 993 {
989 // highly annoying, but the only way to get it stable right now 994 // highly annoying, but the only way to get it stable right now
990 op = freed.back (); freed.pop_back (); 995 op = freed.back ();
996 freed.pop_back ();
991 op->~object (); 997 op->~object ();
992 new ((void *)op) object; 998 new ((void *) op) object;
993 } 999 }
994 1000
995 op->link (); 1001 op->link ();
996 return op; 1002 return op;
997} 1003}
… …
1006 * If free_inventory is set, free inventory as well. Else drop items in 1012 * If free_inventory is set, free inventory as well. Else drop items in
1007 * inventory to the ground. 1013 * inventory to the ground.
1008 */ 1014 */
1009void object::free (bool free_inventory) 1015void object::free (bool free_inventory)
1010{ 1016{
1017 if (QUERY_FLAG (this, FLAG_FREED))
1018 return;
1019
1020 if (QUERY_FLAG (this, FLAG_FRIENDLY))
1021 remove_friendly_object (this);
1022
1011 if (!QUERY_FLAG (this, FLAG_REMOVED)) 1023 if (!QUERY_FLAG (this, FLAG_REMOVED))
1012 { 1024 remove_ob (this);
1013 LOG (llevDebug, "Free object called with non removed object\n");
1014 dump_object (this);
1015#ifdef MANY_CORES
1016 abort ();
1017#endif
1018 }
1019 1025
1020 if (QUERY_FLAG (this, FLAG_FRIENDLY))
1021 {
1022 LOG (llevMonster, "Warning: tried to free friendly object.\n");
1023 remove_friendly_object (this);
1024 }
1025
1026 if (QUERY_FLAG (this, FLAG_FREED)) 1026 SET_FLAG (this, FLAG_FREED);
1027 { 1027
1028 dump_object (this); 1028 //printf ("free(%p,%ld,%ld)\n", this, pticks, count);//D
1029 LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
1030 return;
1031 }
1032 1029
1033 if (more) 1030 if (more)
1034 { 1031 {
1035 more->free (free_inventory); 1032 more->free (free_inventory);
1036 more = 0; 1033 more = 0;
… …
1040 { 1037 {
1041 /* Only if the space blocks everything do we not process - 1038 /* Only if the space blocks everything do we not process -
1042 * if some form of movement is allowed, let objects 1039 * if some form of movement is allowed, let objects
1043 * drop on that space. 1040 * drop on that space.
1044 */ 1041 */
1045 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)) 1042 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1046 { 1043 {
1047 object * 1044 object *op = inv;
1048 op = inv;
1049 1045
1050 while (op) 1046 while (op)
1051 { 1047 {
1052 object *
1053 tmp = op->below; 1048 object *tmp = op->below;
1054
1055 remove_ob (op);
1056 op->free (free_inventory); 1049 op->free (free_inventory);
1057 op = tmp; 1050 op = tmp;
1058 } 1051 }
1059 } 1052 }
1060 else 1053 else
1061 { /* Put objects in inventory onto this space */ 1054 { /* Put objects in inventory onto this space */
1062 object * 1055 object *op = inv;
1063 op = inv;
1064 1056
1065 while (op) 1057 while (op)
1066 { 1058 {
1067 object *
1068 tmp = op->below; 1059 object *tmp = op->below;
1069 1060
1070 remove_ob (op); 1061 remove_ob (op);
1071 1062
1072 if (QUERY_FLAG (op, FLAG_STARTEQUIP) 1063 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
1073 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) 1064 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
… …
1082 op = tmp; 1073 op = tmp;
1083 } 1074 }
1084 } 1075 }
1085 } 1076 }
1086 1077
1087 clear_owner (this); 1078 owner = 0;
1088 1079
1089 /* Remove object from the active list */ 1080 /* Remove object from the active list */
1090 speed = 0; 1081 speed = 0;
1091 update_ob_speed (this); 1082 update_ob_speed (this);
1092 1083
1093 unlink (); 1084 unlink ();
1094
1095 SET_FLAG (this, FLAG_FREED);
1096 1085
1097 mortals.push_back (this); 1086 mortals.push_back (this);
1098} 1087}
1099 1088
1100/* 1089/*
… …
1131 object * 1120 object *
1132 tmp, * 1121 tmp, *
1133 last = NULL; 1122 last = NULL;
1134 object * 1123 object *
1135 otmp; 1124 otmp;
1125
1136 tag_t 1126 tag_t
1137 tag; 1127 tag;
1138 int 1128 int
1139 check_walk_off; 1129 check_walk_off;
1140 mapstruct * 1130 mapstruct *
1141 m; 1131 m;
1132
1142 sint16 1133 sint16
1143 x, 1134 x,
1144 y; 1135 y;
1145 1136
1146
1147 if (QUERY_FLAG (op, FLAG_REMOVED)) 1137 if (QUERY_FLAG (op, FLAG_REMOVED))
1148 { 1138 return;
1149 dump_object (op);
1150 LOG (llevError, "Trying to remove removed object.\n%s\n", errmsg);
1151 1139
1152 /* Changed it to always dump core in this case. As has been learned 1140 SET_FLAG (op, FLAG_REMOVED);
1153 * in the past, trying to recover from errors almost always 1141
1154 * make things worse, and this is a real error here - something
1155 * that should not happen.
1156 * Yes, if this was a mission critical app, trying to do something
1157 * to recover may make sense, but that is because failure of the app
1158 * may have other disastrous problems. Cf runs out of a script
1159 * so is easily enough restarted without any real problems.
1160 * MSW 2001-07-01
1161 */
1162 abort ();
1163 }
1164 if (op->more != NULL) 1142 if (op->more != NULL)
1165 remove_ob (op->more); 1143 remove_ob (op->more);
1166
1167 SET_FLAG (op, FLAG_REMOVED);
1168 1144
1169 /* 1145 /*
1170 * In this case, the object to be removed is in someones 1146 * In this case, the object to be removed is in someones
1171 * inventory. 1147 * inventory.
1172 */ 1148 */
… …
1198 */ 1174 */
1199 op->x = op->env->x, op->y = op->env->y; 1175 op->x = op->env->x, op->y = op->env->y;
1200 op->map = op->env->map; 1176 op->map = op->env->map;
1201 op->above = NULL, op->below = NULL; 1177 op->above = NULL, op->below = NULL;
1202 op->env = NULL; 1178 op->env = NULL;
1203 return; 1179 }
1180 else if (op->map)
1204 } 1181 {
1205
1206 /* If we get here, we are removing it from a map */
1207 if (op->map == NULL)
1208 return;
1209
1210 x = op->x; 1182 x = op->x;
1211 y = op->y; 1183 y = op->y;
1212 m = get_map_from_coord (op->map, &x, &y); 1184 m = get_map_from_coord (op->map, &x, &y);
1213 1185
1214 if (!m) 1186 if (!m)
1215 { 1187 {
1216 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", 1188 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1217 op->map->path, op->x, op->y); 1189 op->map->path, op->x, op->y);
1218 /* in old days, we used to set x and y to 0 and continue. 1190 /* in old days, we used to set x and y to 0 and continue.
1219 * it seems if we get into this case, something is probablye 1191 * it seems if we get into this case, something is probablye
1220 * screwed up and should be fixed. 1192 * screwed up and should be fixed.
1193 */
1194 abort ();
1195 }
1196
1197 if (op->map != m)
1198 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1199 op->map->path, m->path, op->x, op->y, x, y);
1200
1201 /* Re did the following section of code - it looks like it had
1202 * lots of logic for things we no longer care about
1221 */ 1203 */
1222 abort ();
1223 }
1224 if (op->map != m)
1225 {
1226 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1227 op->map->path, m->path, op->x, op->y, x, y);
1228 }
1229 1204
1230 /* Re did the following section of code - it looks like it had
1231 * lots of logic for things we no longer care about
1232 */
1233
1234 /* link the object above us */ 1205 /* link the object above us */
1235 if (op->above) 1206 if (op->above)
1236 op->above->below = op->below; 1207 op->above->below = op->below;
1237 else 1208 else
1238 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ 1209 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1239 1210
1240 /* Relink the object below us, if there is one */ 1211 /* Relink the object below us, if there is one */
1241 if (op->below) 1212 if (op->below)
1242 {
1243 op->below->above = op->above; 1213 op->below->above = op->above;
1244 }
1245 else 1214 else
1246 { 1215 {
1247 /* Nothing below, which means we need to relink map object for this space 1216 /* Nothing below, which means we need to relink map object for this space
1248 * use translated coordinates in case some oddness with map tiling is 1217 * use translated coordinates in case some oddness with map tiling is
1249 * evident 1218 * evident
1250 */
1251 if (GET_MAP_OB (m, x, y) != op)
1252 {
1253 dump_object (op);
1254 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",
1255 errmsg);
1256 dump_object (GET_MAP_OB (m, x, y));
1257 LOG (llevError, "%s\n", errmsg);
1258 }
1259 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1260 }
1261 op->above = NULL;
1262 op->below = NULL;
1263
1264 if (op->map->in_memory == MAP_SAVING)
1265 return;
1266
1267 tag = op->count;
1268 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1269 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1270 {
1271 /* No point updating the players look faces if he is the object
1272 * being removed.
1273 */
1274
1275 if (tmp->type == PLAYER && tmp != op)
1276 {
1277 /* If a container that the player is currently using somehow gets
1278 * removed (most likely destroyed), update the player view
1279 * appropriately.
1280 */ 1219 */
1281 if (tmp->container == op) 1220 if (GET_MAP_OB (m, x, y) != op)
1282 { 1221 {
1283 CLEAR_FLAG (op, FLAG_APPLIED); 1222 dump_object (op);
1284 tmp->container = NULL; 1223 LOG (llevError,
1224 "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);
1225 dump_object (GET_MAP_OB (m, x, y));
1226 LOG (llevError, "%s\n", errmsg);
1285 } 1227 }
1286 tmp->contr->socket.update_look = 1; 1228
1287 } 1229 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1288 /* See if player moving off should effect something */
1289 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1290 { 1230 }
1291 1231
1292 move_apply (tmp, op, NULL); 1232 op->above = 0;
1293 if (was_destroyed (op, tag)) 1233 op->below = 0;
1234
1235 if (op->map->in_memory == MAP_SAVING)
1236 return;
1237
1238 tag = op->count;
1239 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1240
1241 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1242 {
1243 /* No point updating the players look faces if he is the object
1244 * being removed.
1245 */
1246
1247 if (tmp->type == PLAYER && tmp != op)
1294 { 1248 {
1295 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1249 /* If a container that the player is currently using somehow gets
1250 * removed (most likely destroyed), update the player view
1251 * appropriately.
1252 */
1253 if (tmp->container == op)
1254 {
1255 CLEAR_FLAG (op, FLAG_APPLIED);
1256 tmp->container = NULL;
1257 }
1258
1259 tmp->contr->socket.update_look = 1;
1296 } 1260 }
1261
1262 /* See if player moving off should effect something */
1263 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1264 {
1265 move_apply (tmp, op, NULL);
1266
1267 if (was_destroyed (op, tag))
1268 {
1269 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
1270 }
1297 } 1271 }
1298 1272
1299 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1273 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1300 1274
1301 if (tmp->above == tmp) 1275 if (tmp->above == tmp)
1302 tmp->above = NULL; 1276 tmp->above = NULL;
1277
1303 last = tmp; 1278 last = tmp;
1304 } 1279 }
1280
1305 /* last == NULL of there are no objects on this space */ 1281 /* last == NULL of there are no objects on this space */
1306 if (last == NULL) 1282 if (last == NULL)
1307 { 1283 {
1308 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, 1284 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1309 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures 1285 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1310 * those out anyways, and if there are any flags set right now, they won't 1286 * those out anyways, and if there are any flags set right now, they won't
1311 * be correct anyways. 1287 * be correct anyways.
1312 */ 1288 */
1313 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); 1289 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1314 update_position (op->map, op->x, op->y); 1290 update_position (op->map, op->x, op->y);
1315 } 1291 }
1316 else 1292 else
1317 update_object (last, UP_OBJ_REMOVE); 1293 update_object (last, UP_OBJ_REMOVE);
1318 1294
1319 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1295 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1320 update_all_los (op->map, op->x, op->y); 1296 update_all_los (op->map, op->x, op->y);
1321 1297 }
1322} 1298}
1323 1299
1324/* 1300/*
1325 * merge_ob(op,top): 1301 * merge_ob(op,top):
1326 * 1302 *
1327 * This function goes through all objects below and including top, and 1303 * This function goes through all objects below and including top, and
1328 * merges op to the first matching object. 1304 * merges op to the first matching object.
1329 * If top is NULL, it is calculated. 1305 * If top is NULL, it is calculated.
1330 * Returns pointer to object if it succeded in the merge, otherwise NULL 1306 * Returns pointer to object if it succeded in the merge, otherwise NULL
1331 */ 1307 */
1332
1333object * 1308object *
1334merge_ob (object *op, object *top) 1309merge_ob (object *op, object *top)
1335{ 1310{
1336 if (!op->nrof) 1311 if (!op->nrof)
1337 return 0; 1312 return 0;
1313
1338 if (top == NULL) 1314 if (top == NULL)
1339 for (top = op; top != NULL && top->above != NULL; top = top->above); 1315 for (top = op; top != NULL && top->above != NULL; top = top->above);
1316
1340 for (; top != NULL; top = top->below) 1317 for (; top != NULL; top = top->below)
1341 { 1318 {
1342 if (top == op) 1319 if (top == op)
1343 continue; 1320 continue;
1344 if (CAN_MERGE (op, top)) 1321 if (CAN_MERGE (op, top))
… …
1350 remove_ob (op); 1327 remove_ob (op);
1351 free_object (op); 1328 free_object (op);
1352 return top; 1329 return top;
1353 } 1330 }
1354 } 1331 }
1332
1355 return NULL; 1333 return NULL;
1356} 1334}
1357 1335
1358/* 1336/*
1359 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1337 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1360 * job preparing multi-part monsters 1338 * job preparing multi-part monsters
1361 */ 1339 */
1362object * 1340object *
1363insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1341insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)
1364{ 1342{
1365 object * 1343 object *tmp;
1366 tmp;
1367 1344
1368 if (op->head) 1345 if (op->head)
1369 op = op->head; 1346 op = op->head;
1347
1370 for (tmp = op; tmp; tmp = tmp->more) 1348 for (tmp = op; tmp; tmp = tmp->more)
1371 { 1349 {
1372 tmp->x = x + tmp->arch->clone.x; 1350 tmp->x = x + tmp->arch->clone.x;
1373 tmp->y = y + tmp->arch->clone.y; 1351 tmp->y = y + tmp->arch->clone.y;
1374 } 1352 }
1353
1375 return insert_ob_in_map (op, m, originator, flag); 1354 return insert_ob_in_map (op, m, originator, flag);
1376} 1355}
1377 1356
1378/* 1357/*
1379 * insert_ob_in_map (op, map, originator, flag): 1358 * insert_ob_in_map (op, map, originator, flag):
… …
1438 1417
1439 if (op->more != NULL) 1418 if (op->more != NULL)
1440 { 1419 {
1441 /* The part may be on a different map. */ 1420 /* The part may be on a different map. */
1442 1421
1443 object *
1444 more = op->more; 1422 object *more = op->more;
1445 1423
1446 /* We really need the caller to normalize coordinates - if 1424 /* We really need the caller to normalize coordinates - if
1447 * we set the map, that doesn't work if the location is within 1425 * we set the map, that doesn't work if the location is within
1448 * a map and this is straddling an edge. So only if coordinate 1426 * a map and this is straddling an edge. So only if coordinate
1449 * is clear wrong do we normalize it. 1427 * is clear wrong do we normalize it.
1450 */ 1428 */
1451 if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) 1429 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1452 {
1453 more->map = get_map_from_coord (m, &more->x, &more->y); 1430 more->map = get_map_from_coord (m, &more->x, &more->y);
1454 }
1455 else if (!more->map) 1431 else if (!more->map)
1456 { 1432 {
1457 /* For backwards compatibility - when not dealing with tiled maps, 1433 /* For backwards compatibility - when not dealing with tiled maps,
1458 * more->map should always point to the parent. 1434 * more->map should always point to the parent.
1459 */ 1435 */
… …
1462 1438
1463 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1439 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1464 { 1440 {
1465 if (!op->head) 1441 if (!op->head)
1466 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1442 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1443
1467 return NULL; 1444 return NULL;
1468 } 1445 }
1469 } 1446 }
1470 1447
1471 CLEAR_FLAG (op, FLAG_REMOVED); 1448 CLEAR_FLAG (op, FLAG_REMOVED);
… …
1536 1513
1537 while (top != NULL) 1514 while (top != NULL)
1538 { 1515 {
1539 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1516 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1540 floor = top; 1517 floor = top;
1518
1541 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1519 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
1542 { 1520 {
1543 /* We insert above top, so we want this object below this */ 1521 /* We insert above top, so we want this object below this */
1544 top = top->below; 1522 top = top->below;
1545 break; 1523 break;
1546 } 1524 }
1525
1547 last = top; 1526 last = top;
1548 top = top->above; 1527 top = top->above;
1549 } 1528 }
1529
1550 /* Don't want top to be NULL, so set it to the last valid object */ 1530 /* Don't want top to be NULL, so set it to the last valid object */
1551 top = last; 1531 top = last;
1552 1532
1553 /* We let update_position deal with figuring out what the space 1533 /* We let update_position deal with figuring out what the space
1554 * looks like instead of lots of conditions here. 1534 * looks like instead of lots of conditions here.
… …
1633 * of effect may be sufficient. 1613 * of effect may be sufficient.
1634 */ 1614 */
1635 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1615 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
1636 update_all_los (op->map, op->x, op->y); 1616 update_all_los (op->map, op->x, op->y);
1637 1617
1638
1639 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1618 /* updates flags (blocked, alive, no magic, etc) for this map space */
1640 update_object (op, UP_OBJ_INSERT); 1619 update_object (op, UP_OBJ_INSERT);
1641
1642 1620
1643 /* Don't know if moving this to the end will break anything. However, 1621 /* Don't know if moving this to the end will break anything. However,
1644 * we want to have update_look set above before calling this. 1622 * we want to have update_look set above before calling this.
1645 * 1623 *
1646 * check_move_on() must be after this because code called from 1624 * check_move_on() must be after this because code called from
… …
1671 * op is the object to insert it under: supplies x and the map. 1649 * op is the object to insert it under: supplies x and the map.
1672 */ 1650 */
1673void 1651void
1674replace_insert_ob_in_map (const char *arch_string, object *op) 1652replace_insert_ob_in_map (const char *arch_string, object *op)
1675{ 1653{
1676 object *tmp; 1654 object *
1655 tmp;
1677 object *tmp1; 1656 object *
1657 tmp1;
1678 1658
1679 /* first search for itself and remove any old instances */ 1659 /* first search for itself and remove any old instances */
1680 1660
1681 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1661 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1682 { 1662 {
… …
1713 if (orig_ob->nrof < nr) 1693 if (orig_ob->nrof < nr)
1714 { 1694 {
1715 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1695 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1716 return NULL; 1696 return NULL;
1717 } 1697 }
1698
1718 newob = object_create_clone (orig_ob); 1699 newob = object_create_clone (orig_ob);
1700
1719 if ((orig_ob->nrof -= nr) < 1) 1701 if ((orig_ob->nrof -= nr) < 1)
1720 { 1702 {
1721 if (!is_removed) 1703 if (!is_removed)
1722 remove_ob (orig_ob); 1704 remove_ob (orig_ob);
1723 free_object2 (orig_ob, 1); 1705 free_object2 (orig_ob, 1);
… …
1731 strcpy (errmsg, "Tried to split object whose map is not in memory."); 1713 strcpy (errmsg, "Tried to split object whose map is not in memory.");
1732 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); 1714 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1733 return NULL; 1715 return NULL;
1734 } 1716 }
1735 } 1717 }
1718
1736 newob->nrof = nr; 1719 newob->nrof = nr;
1737 1720
1738 return newob; 1721 return newob;
1739} 1722}
1740 1723
… …
1747 */ 1730 */
1748 1731
1749object * 1732object *
1750decrease_ob_nr (object *op, uint32 i) 1733decrease_ob_nr (object *op, uint32 i)
1751{ 1734{
1752 object * 1735 object *tmp;
1753 tmp;
1754 player * 1736 player *pl;
1755 pl;
1756 1737
1757 if (i == 0) /* objects with op->nrof require this check */ 1738 if (i == 0) /* objects with op->nrof require this check */
1758 return op; 1739 return op;
1759 1740
1760 if (i > op->nrof) 1741 if (i > op->nrof)
1761 i = op->nrof; 1742 i = op->nrof;
1762 1743
1763 if (QUERY_FLAG (op, FLAG_REMOVED)) 1744 if (QUERY_FLAG (op, FLAG_REMOVED))
1764 {
1765 op->nrof -= i; 1745 op->nrof -= i;
1766 }
1767 else if (op->env != NULL) 1746 else if (op->env != NULL)
1768 { 1747 {
1769 /* is this object in the players inventory, or sub container 1748 /* is this object in the players inventory, or sub container
1770 * therein? 1749 * therein?
1771 */ 1750 */
… …
1806 } 1785 }
1807 } 1786 }
1808 } 1787 }
1809 else 1788 else
1810 { 1789 {
1811 object *
1812 above = op->above; 1790 object *above = op->above;
1813 1791
1814 if (i < op->nrof) 1792 if (i < op->nrof)
1815 {
1816 op->nrof -= i; 1793 op->nrof -= i;
1817 }
1818 else 1794 else
1819 { 1795 {
1820 remove_ob (op); 1796 remove_ob (op);
1821 op->nrof = 0; 1797 op->nrof = 0;
1822 } 1798 }
1799
1823 /* Since we just removed op, op->above is null */ 1800 /* Since we just removed op, op->above is null */
1824 for (tmp = above; tmp != NULL; tmp = tmp->above) 1801 for (tmp = above; tmp != NULL; tmp = tmp->above)
1825 if (tmp->type == PLAYER) 1802 if (tmp->type == PLAYER)
1826 { 1803 {
1827 if (op->nrof) 1804 if (op->nrof)
… …
1830 esrv_del_item (tmp->contr, op->count); 1807 esrv_del_item (tmp->contr, op->count);
1831 } 1808 }
1832 } 1809 }
1833 1810
1834 if (op->nrof) 1811 if (op->nrof)
1835 {
1836 return op; 1812 return op;
1837 }
1838 else 1813 else
1839 { 1814 {
1840 free_object (op); 1815 free_object (op);
1841 return NULL; 1816 return NULL;
1842 } 1817 }
… …
1851add_weight (object *op, signed long weight) 1826add_weight (object *op, signed long weight)
1852{ 1827{
1853 while (op != NULL) 1828 while (op != NULL)
1854 { 1829 {
1855 if (op->type == CONTAINER) 1830 if (op->type == CONTAINER)
1856 {
1857 weight = (signed long) (weight * (100 - op->stats.Str) / 100); 1831 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1858 } 1832
1859 op->carrying += weight; 1833 op->carrying += weight;
1860 op = op->env; 1834 op = op->env;
1861 } 1835 }
1862} 1836}
1863 1837
… …
1886 { 1860 {
1887 dump_object (op); 1861 dump_object (op);
1888 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); 1862 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1889 return op; 1863 return op;
1890 } 1864 }
1865
1891 if (where == NULL) 1866 if (where == NULL)
1892 { 1867 {
1893 dump_object (op); 1868 dump_object (op);
1894 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); 1869 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1895 return op; 1870 return op;
1896 } 1871 }
1872
1897 if (where->head) 1873 if (where->head)
1898 { 1874 {
1899 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); 1875 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1900 where = where->head; 1876 where = where->head;
1901 } 1877 }
1878
1902 if (op->more) 1879 if (op->more)
1903 { 1880 {
1904 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1881 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1905 return op; 1882 return op;
1906 } 1883 }
1884
1907 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1885 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1908 CLEAR_FLAG (op, FLAG_REMOVED); 1886 CLEAR_FLAG (op, FLAG_REMOVED);
1909 if (op->nrof) 1887 if (op->nrof)
1910 { 1888 {
1911 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1889 for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
… …
2004 tag; 1982 tag;
2005 mapstruct * 1983 mapstruct *
2006 m = op->map; 1984 m = op->map;
2007 int 1985 int
2008 x = op->x, y = op->y; 1986 x = op->x, y = op->y;
1987
2009 MoveType 1988 MoveType
2010 move_on, 1989 move_on,
2011 move_slow, 1990 move_slow,
2012 move_block; 1991 move_block;
2013 1992
… …
2047 * we don't need to check all of them. 2026 * we don't need to check all of them.
2048 */ 2027 */
2049 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) 2028 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
2050 break; 2029 break;
2051 } 2030 }
2031
2052 for (; tmp != NULL; tmp = tmp->below) 2032 for (; tmp; tmp = tmp->below)
2053 { 2033 {
2054 if (tmp == op) 2034 if (tmp == op)
2055 continue; /* Can't apply yourself */ 2035 continue; /* Can't apply yourself */
2056 2036
2057 /* Check to see if one of the movement types should be slowed down. 2037 /* Check to see if one of the movement types should be slowed down.
… …
2065 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 2045 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2066 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 2046 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
2067 { 2047 {
2068 2048
2069 float 2049 float
2070 diff;
2071
2072 diff = tmp->move_slow_penalty * FABS (op->speed); 2050 diff = tmp->move_slow_penalty * FABS (op->speed);
2051
2073 if (op->type == PLAYER) 2052 if (op->type == PLAYER)
2074 {
2075 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 2053 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
2076 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 2054 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
2077 {
2078 diff /= 4.0; 2055 diff /= 4.0;
2079 } 2056
2080 }
2081 op->speed_left -= diff; 2057 op->speed_left -= diff;
2082 } 2058 }
2083 } 2059 }
2084 2060
2085 /* Basically same logic as above, except now for actual apply. */ 2061 /* Basically same logic as above, except now for actual apply. */
2086 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 2062 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2087 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) 2063 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2088 { 2064 {
2089
2090 move_apply (tmp, op, originator); 2065 move_apply (tmp, op, originator);
2066
2091 if (was_destroyed (op, tag)) 2067 if (was_destroyed (op, tag))
2092 return 1; 2068 return 1;
2093 2069
2094 /* what the person/creature stepped onto has moved the object 2070 /* what the person/creature stepped onto has moved the object
2095 * someplace new. Don't process any further - if we did, 2071 * someplace new. Don't process any further - if we did,
… …
2097 */ 2073 */
2098 if (op->map != m || op->x != x || op->y != y) 2074 if (op->map != m || op->x != x || op->y != y)
2099 return 0; 2075 return 0;
2100 } 2076 }
2101 } 2077 }
2078
2102 return 0; 2079 return 0;
2103} 2080}
2104 2081
2105/* 2082/*
2106 * present_arch(arch, map, x, y) searches for any objects with 2083 * present_arch(arch, map, x, y) searches for any objects with
… …
2397find_dir (mapstruct *m, int x, int y, object *exclude) 2374find_dir (mapstruct *m, int x, int y, object *exclude)
2398{ 2375{
2399 int 2376 int
2400 i, 2377 i,
2401 max = SIZEOFFREE, mflags; 2378 max = SIZEOFFREE, mflags;
2402 sint16 2379
2403 nx, 2380 sint16 nx, ny;
2404 ny;
2405 object * 2381 object *
2406 tmp; 2382 tmp;
2407 mapstruct * 2383 mapstruct *
2408 mp; 2384 mp;
2409 MoveType 2385
2410 blocked, 2386 MoveType blocked, move_type;
2411 move_type;
2412 2387
2413 if (exclude && exclude->head) 2388 if (exclude && exclude->head)
2414 { 2389 {
2415 exclude = exclude->head; 2390 exclude = exclude->head;
2416 move_type = exclude->move_type; 2391 move_type = exclude->move_type;
… …
2623 2598
2624 2599
2625int 2600int
2626can_see_monsterP (mapstruct *m, int x, int y, int dir) 2601can_see_monsterP (mapstruct *m, int x, int y, int dir)
2627{ 2602{
2628 sint16 2603 sint16 dx, dy;
2629 dx,
2630 dy;
2631 int 2604 int
2632 mflags; 2605 mflags;
2633 2606
2634 if (dir < 0) 2607 if (dir < 0)
2635 return 0; /* exit condition: invalid direction */ 2608 return 0; /* exit condition: invalid direction */
… …
2760 2733
2761 if (tempfile == NULL) 2734 if (tempfile == NULL)
2762 { 2735 {
2763 LOG (llevError, "Error - Unable to access load object temp file\n"); 2736 LOG (llevError, "Error - Unable to access load object temp file\n");
2764 return NULL; 2737 return NULL;
2765 }; 2738 }
2739
2766 fprintf (tempfile, obstr); 2740 fprintf (tempfile, obstr);
2767 fclose (tempfile); 2741 fclose (tempfile);
2768 2742
2769 op = get_object (); 2743 op = get_object ();
2770 2744
2771 object_thawer 2745 object_thawer thawer (filename);
2772 thawer (filename);
2773 2746
2774 if (thawer) 2747 if (thawer)
2775 load_object (thawer, op, 0); 2748 load_object (thawer, op, 0);
2776 2749
2777 LOG (llevDebug, " load str completed, object=%s\n", &op->name); 2750 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
… …
2828 * The returned string is shared. 2801 * The returned string is shared.
2829 */ 2802 */
2830const char * 2803const char *
2831get_ob_key_value (const object *op, const char *const key) 2804get_ob_key_value (const object *op, const char *const key)
2832{ 2805{
2833 key_value * 2806 key_value *link;
2834 link; 2807 shstr_cmp canonical_key (key);
2835 const char *
2836 canonical_key;
2837 2808
2838 canonical_key = shstr::find (key);
2839
2840 if (canonical_key == NULL) 2809 if (!canonical_key)
2841 { 2810 {
2842 /* 1. There being a field named key on any object 2811 /* 1. There being a field named key on any object
2843 * implies there'd be a shared string to find. 2812 * implies there'd be a shared string to find.
2844 * 2. Since there isn't, no object has this field. 2813 * 2. Since there isn't, no object has this field.
2845 * 3. Therefore, *this* object doesn't have this field. 2814 * 3. Therefore, *this* object doesn't have this field.
2846 */ 2815 */
2847 return NULL; 2816 return 0;
2848 } 2817 }
2849 2818
2850 /* This is copied from get_ob_key_link() above - 2819 /* This is copied from get_ob_key_link() above -
2851 * only 4 lines, and saves the function call overhead. 2820 * only 4 lines, and saves the function call overhead.
2852 */ 2821 */
2853 for (link = op->key_values; link != NULL; link = link->next) 2822 for (link = op->key_values; link; link = link->next)
2854 {
2855 if (link->key == canonical_key) 2823 if (link->key == canonical_key)
2856 {
2857 return link->value; 2824 return link->value;
2858 } 2825
2859 }
2860 return NULL; 2826 return 0;
2861} 2827}
2862 2828
2863 2829
2864/* 2830/*
2865 * Updates the canonical_key in op to value. 2831 * Updates the canonical_key in op to value.
… …
2901 if (last) 2867 if (last)
2902 last->next = field->next; 2868 last->next = field->next;
2903 else 2869 else
2904 op->key_values = field->next; 2870 op->key_values = field->next;
2905 2871
2906 delete
2907 field; 2872 delete field;
2908 } 2873 }
2909 } 2874 }
2910 return TRUE; 2875 return TRUE;
2911 } 2876 }
2912 /* IF we get here, key doesn't exist */ 2877 /* IF we get here, key doesn't exist */
… …
2947 * Returns TRUE on success. 2912 * Returns TRUE on success.
2948 */ 2913 */
2949int 2914int
2950set_ob_key_value (object *op, const char *key, const char *value, int add_key) 2915set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2951{ 2916{
2952 shstr
2953 key_ (key); 2917 shstr key_ (key);
2954 2918
2955 return set_ob_key_value_s (op, key_, value, add_key); 2919 return set_ob_key_value_s (op, key_, value, add_key);
2956} 2920}
2921
2922object::depth_iterator::depth_iterator (object *container)
2923: iterator_base (container)
2924{
2925 while (item->inv)
2926 item = item->inv;
2927}
2928
2929void
2930object::depth_iterator::next ()
2931{
2932 if (item->below)
2933 {
2934 item = item->below;
2935
2936 while (item->inv)
2937 item = item->inv;
2938 }
2939 else
2940 item = item->env;
2941}
2942
2943// return a suitable string describing an objetc in enough detail to find it
2944const char *
2945object::debug_desc (char *info) const
2946{
2947 char info2[256 * 3];
2948 char *p = info;
2949
2950 p += snprintf (p, 256, "%d=\"%s%s%s\"",
2951 count,
2952 &name,
2953 title ? " " : "",
2954 title ? (const char *)title : "");
2955
2956 if (env)
2957 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2958
2959 if (map)
2960 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
2961
2962 return info;
2963}
2964
2965const char *
2966object::debug_desc () const
2967{
2968 static char info[256 * 3];
2969 return debug_desc (info);
2970}
2971

Diff Legend

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