… | |
… | |
141 | * objects with lists are rare, and lists stay short. If not, use a |
141 | * objects with lists are rare, and lists stay short. If not, use a |
142 | * different structure or at least keep the lists sorted... |
142 | * different structure or at least keep the lists sorted... |
143 | */ |
143 | */ |
144 | |
144 | |
145 | /* For each field in wants, */ |
145 | /* For each field in wants, */ |
146 | for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) |
146 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
147 | { |
147 | { |
148 | key_value *has_field; |
148 | key_value *has_field; |
149 | |
149 | |
150 | /* Look for a field in has with the same key. */ |
150 | /* Look for a field in has with the same key. */ |
151 | has_field = get_ob_key_link (has, wants_field->key); |
151 | has_field = get_ob_key_link (has, wants_field->key); |
… | |
… | |
190 | * Check nrof variable *before* calling can_merge() |
190 | * Check nrof variable *before* calling can_merge() |
191 | * |
191 | * |
192 | * Improvements made with merge: Better checking on potion, and also |
192 | * Improvements made with merge: Better checking on potion, and also |
193 | * check weight |
193 | * check weight |
194 | */ |
194 | */ |
195 | |
|
|
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
195 | bool object::can_merge_slow (object *ob1, object *ob2) |
197 | { |
196 | { |
198 | /* A couple quicksanity checks */ |
197 | /* A couple quicksanity checks */ |
199 | if (ob1 == ob2 |
198 | if (ob1 == ob2 |
200 | || ob1->type != ob2->type |
199 | || ob1->type != ob2->type |
… | |
… | |
364 | { |
363 | { |
365 | if (!op) |
364 | if (!op) |
366 | return strdup ("[NULLOBJ]"); |
365 | return strdup ("[NULLOBJ]"); |
367 | |
366 | |
368 | object_freezer freezer; |
367 | object_freezer freezer; |
369 | save_object (freezer, op, 3); |
368 | save_object (freezer, op, 1); |
370 | return freezer.as_string (); |
369 | return freezer.as_string (); |
371 | } |
370 | } |
372 | |
371 | |
373 | /* |
372 | /* |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
373 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
522 | tail = new_link; |
521 | tail = new_link; |
523 | } |
522 | } |
524 | } |
523 | } |
525 | } |
524 | } |
526 | |
525 | |
527 | update_ob_speed (dst); |
526 | dst->set_speed (dst->speed); |
528 | } |
527 | } |
529 | |
528 | |
530 | object * |
529 | object * |
531 | object::clone () |
530 | object::clone () |
532 | { |
531 | { |
… | |
… | |
538 | /* |
537 | /* |
539 | * If an object with the IS_TURNABLE() flag needs to be turned due |
538 | * If an object with the IS_TURNABLE() flag needs to be turned due |
540 | * to the closest player being on the other side, this function can |
539 | * to the closest player being on the other side, this function can |
541 | * be called to update the face variable, _and_ how it looks on the map. |
540 | * be called to update the face variable, _and_ how it looks on the map. |
542 | */ |
541 | */ |
543 | |
|
|
544 | void |
542 | void |
545 | update_turn_face (object *op) |
543 | update_turn_face (object *op) |
546 | { |
544 | { |
547 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
545 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
548 | return; |
546 | return; |
|
|
547 | |
549 | SET_ANIMATION (op, op->direction); |
548 | SET_ANIMATION (op, op->direction); |
550 | update_object (op, UP_OBJ_FACE); |
549 | update_object (op, UP_OBJ_FACE); |
551 | } |
550 | } |
552 | |
551 | |
553 | /* |
552 | /* |
554 | * Updates the speed of an object. If the speed changes from 0 to another |
553 | * Updates the speed of an object. If the speed changes from 0 to another |
555 | * value, or vice versa, then add/remove the object from the active list. |
554 | * value, or vice versa, then add/remove the object from the active list. |
556 | * This function needs to be called whenever the speed of an object changes. |
555 | * This function needs to be called whenever the speed of an object changes. |
557 | */ |
556 | */ |
558 | void |
557 | void |
559 | update_ob_speed (object *op) |
558 | object::set_speed (float speed) |
560 | { |
559 | { |
561 | extern int arch_init; |
560 | if (flag [FLAG_FREED] && speed) |
562 | |
|
|
563 | /* No reason putting the archetypes objects on the speed list, |
|
|
564 | * since they never really need to be updated. |
|
|
565 | */ |
|
|
566 | |
|
|
567 | if (QUERY_FLAG (op, FLAG_FREED) && op->speed) |
|
|
568 | { |
561 | { |
569 | LOG (llevError, "Object %s is freed but has speed.\n", &op->name); |
562 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
570 | #ifdef MANY_CORES |
|
|
571 | abort (); |
|
|
572 | #else |
|
|
573 | op->speed = 0; |
563 | speed = 0; |
574 | #endif |
|
|
575 | } |
564 | } |
576 | |
565 | |
577 | if (arch_init) |
566 | this->speed = speed; |
578 | return; |
|
|
579 | |
567 | |
580 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
568 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
581 | { |
569 | { |
582 | /* If already on active list, don't do anything */ |
570 | /* If already on active list, don't do anything */ |
583 | if (op->active_next || op->active_prev || op == active_objects) |
571 | if (active_next || active_prev || this == active_objects) |
584 | return; |
572 | return; |
585 | |
573 | |
586 | /* process_events() expects us to insert the object at the beginning |
574 | /* process_events() expects us to insert the object at the beginning |
587 | * of the list. */ |
575 | * of the list. */ |
588 | op->active_next = active_objects; |
576 | active_next = active_objects; |
589 | |
577 | |
590 | if (op->active_next != NULL) |
578 | if (active_next) |
591 | op->active_next->active_prev = op; |
579 | active_next->active_prev = this; |
592 | |
580 | |
593 | active_objects = op; |
581 | active_objects = this; |
594 | } |
582 | } |
595 | else |
583 | else |
596 | { |
584 | { |
597 | /* If not on the active list, nothing needs to be done */ |
585 | /* If not on the active list, nothing needs to be done */ |
598 | if (!op->active_next && !op->active_prev && op != active_objects) |
586 | if (!active_next && !active_prev && this != active_objects) |
599 | return; |
587 | return; |
600 | |
588 | |
601 | if (op->active_prev == NULL) |
589 | if (!active_prev) |
602 | { |
590 | { |
603 | active_objects = op->active_next; |
591 | active_objects = active_next; |
604 | |
592 | |
605 | if (op->active_next != NULL) |
593 | if (active_next) |
606 | op->active_next->active_prev = NULL; |
594 | active_next->active_prev = 0; |
607 | } |
595 | } |
608 | else |
596 | else |
609 | { |
597 | { |
610 | op->active_prev->active_next = op->active_next; |
598 | active_prev->active_next = active_next; |
611 | |
599 | |
612 | if (op->active_next) |
600 | if (active_next) |
613 | op->active_next->active_prev = op->active_prev; |
601 | active_next->active_prev = active_prev; |
614 | } |
602 | } |
615 | |
603 | |
616 | op->active_next = NULL; |
604 | active_next = 0; |
617 | op->active_prev = NULL; |
605 | active_prev = 0; |
618 | } |
|
|
619 | } |
|
|
620 | |
|
|
621 | /* This function removes object 'op' from the list of active |
|
|
622 | * objects. |
|
|
623 | * This should only be used for style maps or other such |
|
|
624 | * reference maps where you don't want an object that isn't |
|
|
625 | * in play chewing up cpu time getting processed. |
|
|
626 | * The reverse of this is to call update_ob_speed, which |
|
|
627 | * will do the right thing based on the speed of the object. |
|
|
628 | */ |
|
|
629 | void |
|
|
630 | remove_from_active_list (object *op) |
|
|
631 | { |
|
|
632 | /* If not on the active list, nothing needs to be done */ |
|
|
633 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
634 | return; |
|
|
635 | |
|
|
636 | if (op->active_prev == NULL) |
|
|
637 | { |
606 | } |
638 | active_objects = op->active_next; |
|
|
639 | if (op->active_next != NULL) |
|
|
640 | op->active_next->active_prev = NULL; |
|
|
641 | } |
|
|
642 | else |
|
|
643 | { |
|
|
644 | op->active_prev->active_next = op->active_next; |
|
|
645 | if (op->active_next) |
|
|
646 | op->active_next->active_prev = op->active_prev; |
|
|
647 | } |
|
|
648 | op->active_next = NULL; |
|
|
649 | op->active_prev = NULL; |
|
|
650 | } |
607 | } |
651 | |
608 | |
652 | /* |
609 | /* |
653 | * update_object() updates the the map. |
610 | * update_object() updates the the map. |
654 | * It takes into account invisible objects (and represent squares covered |
611 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
781 | |
738 | |
782 | prev = 0; |
739 | prev = 0; |
783 | next = 0; |
740 | next = 0; |
784 | } |
741 | } |
785 | |
742 | |
786 | object *object::create () |
|
|
787 | { |
|
|
788 | object *op = new object; |
|
|
789 | op->link (); |
|
|
790 | return op; |
|
|
791 | } |
|
|
792 | |
|
|
793 | /* |
|
|
794 | * free_object() frees everything allocated by an object, removes |
|
|
795 | * it from the list of used objects, and puts it on the list of |
|
|
796 | * free objects. The IS_FREED() flag is set in the object. |
|
|
797 | * The object must have been removed by remove_ob() first for |
|
|
798 | * this function to succeed. |
|
|
799 | * |
|
|
800 | * If destroy_inventory is set, free inventory as well. Else drop items in |
|
|
801 | * inventory to the ground. |
|
|
802 | */ |
|
|
803 | void |
743 | void |
804 | object::do_destroy () |
744 | object::activate (bool recursive) |
805 | { |
745 | { |
806 | attachable::do_destroy (); |
746 | // uh, hack |
|
|
747 | set_speed (speed); |
807 | |
748 | |
808 | if (flag [FLAG_IS_LINKED]) |
749 | if (recursive) |
809 | remove_button_link (this); |
750 | for (object *op = inv; op; op = op->above) |
|
|
751 | op->activate (1); |
|
|
752 | } |
810 | |
753 | |
811 | if (flag [FLAG_FRIENDLY]) |
754 | /* This function removes object 'op' from the list of active |
812 | remove_friendly_object (this); |
755 | * objects. |
813 | |
756 | * This should only be used for style maps or other such |
814 | if (!flag [FLAG_REMOVED]) |
757 | * reference maps where you don't want an object that isn't |
815 | remove (); |
758 | * in play chewing up cpu time getting processed. |
816 | |
759 | * The reverse of this is to call update_ob_speed, which |
817 | if (flag [FLAG_FREED]) |
760 | * will do the right thing based on the speed of the object. |
|
|
761 | */ |
|
|
762 | void |
|
|
763 | object::deactivate (bool recursive) |
|
|
764 | { |
|
|
765 | /* If not on the active list, nothing needs to be done */ |
|
|
766 | if (!active_next && !active_prev && this != active_objects) |
818 | return; |
767 | return; |
819 | |
768 | |
820 | flag [FLAG_FREED] = 1; |
769 | if (active_prev == 0) |
821 | |
|
|
822 | // hack to ensure that freed objects still have a valid map |
|
|
823 | { |
|
|
824 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
825 | |
|
|
826 | if (!freed_map) |
|
|
827 | { |
770 | { |
828 | freed_map = new maptile; |
771 | active_objects = active_next; |
829 | |
772 | if (active_next) |
830 | freed_map->name = "/internal/freed_objects_map"; |
773 | active_next->active_prev = 0; |
831 | freed_map->width = 3; |
|
|
832 | freed_map->height = 3; |
|
|
833 | |
|
|
834 | freed_map->allocate (); |
|
|
835 | } |
774 | } |
836 | |
775 | else |
837 | map = freed_map; |
776 | { |
838 | x = 1; |
777 | active_prev->active_next = active_next; |
839 | y = 1; |
778 | if (active_next) |
|
|
779 | active_next->active_prev = active_prev; |
840 | } |
780 | } |
841 | |
781 | |
842 | more = 0; |
782 | active_next = 0; |
843 | head = 0; |
783 | active_prev = 0; |
844 | inv = 0; |
|
|
845 | |
784 | |
846 | // clear those pointers that likely might have circular references to us |
785 | if (recursive) |
847 | owner = 0; |
786 | for (object *op = inv; op; op = op->above) |
848 | enemy = 0; |
787 | op->deactivate (1); |
849 | attacked_by = 0; |
|
|
850 | |
|
|
851 | // only relevant for players(?), but make sure of it anyways |
|
|
852 | contr = 0; |
|
|
853 | |
|
|
854 | /* Remove object from the active list */ |
|
|
855 | speed = 0; |
|
|
856 | update_ob_speed (this); |
|
|
857 | |
|
|
858 | unlink (); |
|
|
859 | } |
788 | } |
860 | |
789 | |
861 | /* |
790 | /* |
862 | * Remove and free all objects in the inventory of the given object. |
791 | * Remove and free all objects in the inventory of the given object. |
863 | * object.c ? |
792 | * object.c ? |
864 | */ |
793 | */ |
865 | void |
794 | void |
866 | object::destroy_inv (bool drop_to_ground) |
795 | object::destroy_inv (bool drop_to_ground) |
867 | { |
796 | { |
|
|
797 | // need to check first, because the checks below might segfault |
|
|
798 | // as we might be on an invalid mapspace and crossfire code |
|
|
799 | // is too buggy to ensure that the inventory is empty. |
|
|
800 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
801 | // cf will crash below with off-map x and y |
868 | if (!inv) |
802 | if (!inv) |
869 | return; |
803 | return; |
870 | |
804 | |
871 | /* Only if the space blocks everything do we not process - |
805 | /* Only if the space blocks everything do we not process - |
872 | * if some form of movement is allowed, let objects |
806 | * if some form of movement is allowed, let objects |
873 | * drop on that space. |
807 | * drop on that space. |
874 | */ |
808 | */ |
875 | if (!drop_to_ground || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
809 | if (!drop_to_ground |
|
|
810 | || !map |
|
|
811 | || map->in_memory != MAP_IN_MEMORY |
|
|
812 | || ms ().move_block == MOVE_ALL) |
876 | { |
813 | { |
877 | while (inv) |
814 | while (inv) |
878 | { |
815 | { |
879 | inv->destroy_inv (drop_to_ground); |
816 | inv->destroy_inv (drop_to_ground); |
880 | inv->destroy (); |
817 | inv->destroy (); |
… | |
… | |
891 | || op->type == RUNE |
828 | || op->type == RUNE |
892 | || op->type == TRAP |
829 | || op->type == TRAP |
893 | || op->flag [FLAG_IS_A_TEMPLATE]) |
830 | || op->flag [FLAG_IS_A_TEMPLATE]) |
894 | op->destroy (); |
831 | op->destroy (); |
895 | else |
832 | else |
896 | { |
833 | map->insert (op, x, y); |
897 | op->remove (); |
|
|
898 | op->x = x; |
|
|
899 | op->y = y; |
|
|
900 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
901 | } |
834 | } |
|
|
835 | } |
|
|
836 | } |
|
|
837 | |
|
|
838 | object *object::create () |
|
|
839 | { |
|
|
840 | object *op = new object; |
|
|
841 | op->link (); |
|
|
842 | return op; |
|
|
843 | } |
|
|
844 | |
|
|
845 | void |
|
|
846 | object::do_destroy () |
|
|
847 | { |
|
|
848 | if (flag [FLAG_IS_LINKED]) |
|
|
849 | remove_button_link (this); |
|
|
850 | |
|
|
851 | if (flag [FLAG_FRIENDLY]) |
|
|
852 | remove_friendly_object (this); |
|
|
853 | |
|
|
854 | if (!flag [FLAG_REMOVED]) |
|
|
855 | remove (); |
|
|
856 | |
|
|
857 | if (flag [FLAG_FREED]) |
|
|
858 | return; |
|
|
859 | |
|
|
860 | set_speed (0); |
|
|
861 | |
|
|
862 | flag [FLAG_FREED] = 1; |
|
|
863 | |
|
|
864 | attachable::do_destroy (); |
|
|
865 | |
|
|
866 | destroy_inv (true); |
|
|
867 | unlink (); |
|
|
868 | |
|
|
869 | // hack to ensure that freed objects still have a valid map |
|
|
870 | { |
|
|
871 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
872 | |
|
|
873 | if (!freed_map) |
|
|
874 | { |
|
|
875 | freed_map = new maptile; |
|
|
876 | |
|
|
877 | freed_map->name = "/internal/freed_objects_map"; |
|
|
878 | freed_map->width = 3; |
|
|
879 | freed_map->height = 3; |
|
|
880 | |
|
|
881 | freed_map->alloc (); |
902 | } |
882 | } |
|
|
883 | |
|
|
884 | map = freed_map; |
|
|
885 | x = 1; |
|
|
886 | y = 1; |
|
|
887 | } |
|
|
888 | |
|
|
889 | head = 0; |
|
|
890 | |
|
|
891 | if (more) |
903 | } |
892 | { |
|
|
893 | more->destroy (); |
|
|
894 | more = 0; |
|
|
895 | } |
|
|
896 | |
|
|
897 | // clear those pointers that likely might have circular references to us |
|
|
898 | owner = 0; |
|
|
899 | enemy = 0; |
|
|
900 | attacked_by = 0; |
|
|
901 | |
|
|
902 | // only relevant for players(?), but make sure of it anyways |
|
|
903 | contr = 0; |
904 | } |
904 | } |
905 | |
905 | |
906 | void |
906 | void |
907 | object::destroy (bool destroy_inventory) |
907 | object::destroy (bool destroy_inventory) |
908 | { |
908 | { |
909 | if (destroyed ()) |
909 | if (destroyed ()) |
910 | return; |
910 | return; |
911 | |
911 | |
912 | if (more) |
|
|
913 | { |
|
|
914 | //TODO: non-head objects must not have inventory |
|
|
915 | more->destroy (destroy_inventory); |
|
|
916 | more = 0; |
|
|
917 | } |
|
|
918 | |
|
|
919 | if (destroy_inventory) |
912 | if (destroy_inventory) |
920 | destroy_inv (true); |
913 | destroy_inv (false); |
921 | |
914 | |
922 | attachable::destroy (); |
915 | attachable::destroy (); |
923 | } |
916 | } |
924 | |
917 | |
925 | /* |
918 | /* |
… | |
… | |
978 | * to save cpu time. |
971 | * to save cpu time. |
979 | */ |
972 | */ |
980 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
973 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
981 | otmp->update_stats (); |
974 | otmp->update_stats (); |
982 | |
975 | |
983 | if (above != NULL) |
976 | if (above) |
984 | above->below = below; |
977 | above->below = below; |
985 | else |
978 | else |
986 | env->inv = below; |
979 | env->inv = below; |
987 | |
980 | |
988 | if (below != NULL) |
981 | if (below) |
989 | below->above = above; |
982 | below->above = above; |
990 | |
983 | |
991 | /* we set up values so that it could be inserted into |
984 | /* we set up values so that it could be inserted into |
992 | * the map, but we don't actually do that - it is up |
985 | * the map, but we don't actually do that - it is up |
993 | * to the caller to decide what we want to do. |
986 | * to the caller to decide what we want to do. |
… | |
… | |
997 | above = 0, below = 0; |
990 | above = 0, below = 0; |
998 | env = 0; |
991 | env = 0; |
999 | } |
992 | } |
1000 | else if (map) |
993 | else if (map) |
1001 | { |
994 | { |
1002 | /* Re did the following section of code - it looks like it had |
995 | if (type == PLAYER) |
1003 | * lots of logic for things we no longer care about |
|
|
1004 | */ |
996 | { |
|
|
997 | --map->players; |
|
|
998 | map->last_access = runtime; |
|
|
999 | } |
|
|
1000 | |
1005 | |
1001 | |
1006 | /* link the object above us */ |
1002 | /* link the object above us */ |
1007 | if (above) |
1003 | if (above) |
1008 | above->below = below; |
1004 | above->below = below; |
1009 | else |
1005 | else |
… | |
… | |
1038 | if (map->in_memory == MAP_SAVING) |
1034 | if (map->in_memory == MAP_SAVING) |
1039 | return; |
1035 | return; |
1040 | |
1036 | |
1041 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1037 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1042 | |
1038 | |
1043 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1039 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1044 | { |
1040 | { |
1045 | /* No point updating the players look faces if he is the object |
1041 | /* No point updating the players look faces if he is the object |
1046 | * being removed. |
1042 | * being removed. |
1047 | */ |
1043 | */ |
1048 | |
1044 | |
… | |
… | |
1060 | |
1056 | |
1061 | if (tmp->contr->ns) |
1057 | if (tmp->contr->ns) |
1062 | tmp->contr->ns->floorbox_update (); |
1058 | tmp->contr->ns->floorbox_update (); |
1063 | } |
1059 | } |
1064 | |
1060 | |
1065 | /* See if player moving off should effect something */ |
1061 | /* See if object moving off should effect something */ |
1066 | if (check_walk_off |
1062 | if (check_walk_off |
1067 | && ((move_type & tmp->move_off) |
1063 | && ((move_type & tmp->move_off) |
1068 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1064 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1069 | { |
1065 | { |
1070 | move_apply (tmp, this, 0); |
1066 | move_apply (tmp, this, 0); |
… | |
… | |
1072 | if (destroyed ()) |
1068 | if (destroyed ()) |
1073 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1069 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1074 | } |
1070 | } |
1075 | |
1071 | |
1076 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1072 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1077 | |
1073 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1078 | if (tmp->above == tmp) |
1074 | if (tmp->above == tmp) |
1079 | tmp->above = 0; |
1075 | tmp->above = 0; |
1080 | |
1076 | |
1081 | last = tmp; |
1077 | last = tmp; |
1082 | } |
1078 | } |
1083 | |
1079 | |
1084 | /* last == NULL of there are no objects on this space */ |
1080 | /* last == NULL if there are no objects on this space */ |
|
|
1081 | //TODO: this makes little sense, why only update the topmost object? |
1085 | if (!last) |
1082 | if (!last) |
1086 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1083 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1087 | else |
1084 | else |
1088 | update_object (last, UP_OBJ_REMOVE); |
1085 | update_object (last, UP_OBJ_REMOVE); |
1089 | |
1086 | |
… | |
… | |
1134 | * job preparing multi-part monsters |
1131 | * job preparing multi-part monsters |
1135 | */ |
1132 | */ |
1136 | object * |
1133 | object * |
1137 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1134 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1138 | { |
1135 | { |
1139 | object *tmp; |
|
|
1140 | |
|
|
1141 | if (op->head) |
|
|
1142 | op = op->head; |
|
|
1143 | |
|
|
1144 | for (tmp = op; tmp; tmp = tmp->more) |
1136 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1145 | { |
1137 | { |
1146 | tmp->x = x + tmp->arch->clone.x; |
1138 | tmp->x = x + tmp->arch->clone.x; |
1147 | tmp->y = y + tmp->arch->clone.y; |
1139 | tmp->y = y + tmp->arch->clone.y; |
1148 | } |
1140 | } |
1149 | |
1141 | |
… | |
… | |
1180 | { |
1172 | { |
1181 | LOG (llevError, "Trying to insert freed object!\n"); |
1173 | LOG (llevError, "Trying to insert freed object!\n"); |
1182 | return NULL; |
1174 | return NULL; |
1183 | } |
1175 | } |
1184 | |
1176 | |
1185 | if (m == NULL) |
1177 | if (!m) |
1186 | { |
1178 | { |
1187 | char *dump = dump_object (op); |
1179 | char *dump = dump_object (op); |
1188 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1180 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1189 | free (dump); |
1181 | free (dump); |
1190 | return op; |
1182 | return op; |
… | |
… | |
1254 | y = op->y; |
1246 | y = op->y; |
1255 | |
1247 | |
1256 | /* this has to be done after we translate the coordinates. |
1248 | /* this has to be done after we translate the coordinates. |
1257 | */ |
1249 | */ |
1258 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1250 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1259 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1251 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1260 | if (object::can_merge (op, tmp)) |
1252 | if (object::can_merge (op, tmp)) |
1261 | { |
1253 | { |
1262 | op->nrof += tmp->nrof; |
1254 | op->nrof += tmp->nrof; |
1263 | tmp->destroy (); |
1255 | tmp->destroy (); |
1264 | } |
1256 | } |
… | |
… | |
1291 | else |
1283 | else |
1292 | { |
1284 | { |
1293 | /* If there are other objects, then */ |
1285 | /* If there are other objects, then */ |
1294 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1286 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1295 | { |
1287 | { |
1296 | object *last = NULL; |
1288 | object *last = 0; |
1297 | |
1289 | |
1298 | /* |
1290 | /* |
1299 | * If there are multiple objects on this space, we do some trickier handling. |
1291 | * If there are multiple objects on this space, we do some trickier handling. |
1300 | * We've already dealt with merging if appropriate. |
1292 | * We've already dealt with merging if appropriate. |
1301 | * Generally, we want to put the new object on top. But if |
1293 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1305 | * once we get to them. This reduces the need to traverse over all of |
1297 | * once we get to them. This reduces the need to traverse over all of |
1306 | * them when adding another one - this saves quite a bit of cpu time |
1298 | * them when adding another one - this saves quite a bit of cpu time |
1307 | * when lots of spells are cast in one area. Currently, it is presumed |
1299 | * when lots of spells are cast in one area. Currently, it is presumed |
1308 | * that flying non pickable objects are spell objects. |
1300 | * that flying non pickable objects are spell objects. |
1309 | */ |
1301 | */ |
1310 | |
|
|
1311 | while (top != NULL) |
1302 | while (top) |
1312 | { |
1303 | { |
1313 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1304 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1314 | floor = top; |
1305 | floor = top; |
1315 | |
1306 | |
1316 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1307 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1369 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1360 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1370 | |
1361 | |
1371 | if (op->above) |
1362 | if (op->above) |
1372 | op->above->below = op; |
1363 | op->above->below = op; |
1373 | |
1364 | |
1374 | op->below = NULL; |
1365 | op->below = 0; |
1375 | op->ms ().bot = op; |
1366 | op->ms ().bot = op; |
1376 | } |
1367 | } |
1377 | else |
1368 | else |
1378 | { /* get inserted into the stack above top */ |
1369 | { /* get inserted into the stack above top */ |
1379 | op->above = top->above; |
1370 | op->above = top->above; |
… | |
… | |
1383 | |
1374 | |
1384 | op->below = top; |
1375 | op->below = top; |
1385 | top->above = op; |
1376 | top->above = op; |
1386 | } |
1377 | } |
1387 | |
1378 | |
1388 | if (op->above == NULL) |
1379 | if (!op->above) |
1389 | op->ms ().top = op; |
1380 | op->ms ().top = op; |
1390 | } /* else not INS_BELOW_ORIGINATOR */ |
1381 | } /* else not INS_BELOW_ORIGINATOR */ |
1391 | |
1382 | |
1392 | if (op->type == PLAYER) |
1383 | if (op->type == PLAYER) |
|
|
1384 | { |
1393 | op->contr->do_los = 1; |
1385 | op->contr->do_los = 1; |
|
|
1386 | ++op->map->players; |
|
|
1387 | op->map->last_access = runtime; |
|
|
1388 | } |
1394 | |
1389 | |
1395 | /* If we have a floor, we know the player, if any, will be above |
1390 | /* If we have a floor, we know the player, if any, will be above |
1396 | * it, so save a few ticks and start from there. |
1391 | * it, so save a few ticks and start from there. |
1397 | */ |
1392 | */ |
1398 | if (!(flag & INS_MAP_LOAD)) |
1393 | if (!(flag & INS_MAP_LOAD)) |
… | |
… | |
1463 | tmp1->x = op->x; |
1458 | tmp1->x = op->x; |
1464 | tmp1->y = op->y; |
1459 | tmp1->y = op->y; |
1465 | insert_ob_in_map (tmp1, op->map, op, 0); |
1460 | insert_ob_in_map (tmp1, op->map, op, 0); |
1466 | } |
1461 | } |
1467 | |
1462 | |
|
|
1463 | object * |
|
|
1464 | object::insert_at (object *where, object *originator, int flags) |
|
|
1465 | { |
|
|
1466 | where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1467 | } |
|
|
1468 | |
1468 | /* |
1469 | /* |
1469 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1470 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1470 | * is returned contains nr objects, and the remaining parts contains |
1471 | * is returned contains nr objects, and the remaining parts contains |
1471 | * the rest (or is removed and freed if that number is 0). |
1472 | * the rest (or is removed and freed if that number is 0). |
1472 | * On failure, NULL is returned, and the reason put into the |
1473 | * On failure, NULL is returned, and the reason put into the |
1473 | * global static errmsg array. |
1474 | * global static errmsg array. |
1474 | */ |
1475 | */ |
1475 | |
|
|
1476 | object * |
1476 | object * |
1477 | get_split_ob (object *orig_ob, uint32 nr) |
1477 | get_split_ob (object *orig_ob, uint32 nr) |
1478 | { |
1478 | { |
1479 | object *newob; |
1479 | object *newob; |
1480 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1480 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
… | |
… | |
1744 | * |
1744 | * |
1745 | * MSW 2001-07-08: Check all objects on space, not just those below |
1745 | * MSW 2001-07-08: Check all objects on space, not just those below |
1746 | * object being inserted. insert_ob_in_map may not put new objects |
1746 | * object being inserted. insert_ob_in_map may not put new objects |
1747 | * on top. |
1747 | * on top. |
1748 | */ |
1748 | */ |
1749 | |
|
|
1750 | int |
1749 | int |
1751 | check_move_on (object *op, object *originator) |
1750 | check_move_on (object *op, object *originator) |
1752 | { |
1751 | { |
1753 | object *tmp; |
1752 | object *tmp; |
1754 | maptile *m = op->map; |
1753 | maptile *m = op->map; |
… | |
… | |
2628 | |
2627 | |
2629 | if (env) |
2628 | if (env) |
2630 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2629 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2631 | |
2630 | |
2632 | if (map) |
2631 | if (map) |
2633 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2632 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2634 | |
2633 | |
2635 | return info; |
2634 | return info; |
2636 | } |
2635 | } |
2637 | |
2636 | |
2638 | const char * |
2637 | const char * |