1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
3 | |
3 | |
|
|
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
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 |
6 | |
7 | |
7 | This program is free software; you can redistribute it and/or modify |
8 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | it under the terms of the GNU General Public License as published by |
… | |
… | |
190 | * Check nrof variable *before* calling can_merge() |
191 | * Check nrof variable *before* calling can_merge() |
191 | * |
192 | * |
192 | * Improvements made with merge: Better checking on potion, and also |
193 | * Improvements made with merge: Better checking on potion, and also |
193 | * check weight |
194 | * check weight |
194 | */ |
195 | */ |
195 | |
|
|
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
197 | { |
197 | { |
198 | /* A couple quicksanity checks */ |
198 | /* A couple quicksanity checks */ |
199 | if (ob1 == ob2 |
199 | if (ob1 == ob2 |
200 | || ob1->type != ob2->type |
200 | || ob1->type != ob2->type |
… | |
… | |
277 | |
277 | |
278 | /* Note sure why the following is the case - either the object has to |
278 | /* Note sure why the following is the case - either the object has to |
279 | * be animated or have a very low speed. Is this an attempted monster |
279 | * be animated or have a very low speed. Is this an attempted monster |
280 | * check? |
280 | * check? |
281 | */ |
281 | */ |
282 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
282 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
283 | return 0; |
283 | return 0; |
284 | |
284 | |
285 | switch (ob1->type) |
285 | switch (ob1->type) |
286 | { |
286 | { |
287 | case SCROLL: |
287 | case SCROLL: |
… | |
… | |
538 | /* |
538 | /* |
539 | * If an object with the IS_TURNABLE() flag needs to be turned due |
539 | * 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 |
540 | * 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. |
541 | * be called to update the face variable, _and_ how it looks on the map. |
542 | */ |
542 | */ |
543 | |
|
|
544 | void |
543 | void |
545 | update_turn_face (object *op) |
544 | update_turn_face (object *op) |
546 | { |
545 | { |
547 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL) |
546 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
548 | return; |
547 | return; |
|
|
548 | |
549 | SET_ANIMATION (op, op->direction); |
549 | SET_ANIMATION (op, op->direction); |
550 | update_object (op, UP_OBJ_FACE); |
550 | update_object (op, UP_OBJ_FACE); |
551 | } |
551 | } |
552 | |
552 | |
553 | /* |
553 | /* |
… | |
… | |
556 | * This function needs to be called whenever the speed of an object changes. |
556 | * This function needs to be called whenever the speed of an object changes. |
557 | */ |
557 | */ |
558 | void |
558 | void |
559 | object::set_speed (float speed) |
559 | object::set_speed (float speed) |
560 | { |
560 | { |
561 | extern int arch_init; |
|
|
562 | |
|
|
563 | /* No reason putting the archetypes objects on the speed list, |
|
|
564 | * since they never really need to be updated. |
|
|
565 | */ |
|
|
566 | if (flag [FLAG_FREED] && speed) |
561 | if (flag [FLAG_FREED] && speed) |
567 | { |
562 | { |
568 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
563 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
569 | speed = 0; |
564 | speed = 0; |
570 | } |
565 | } |
571 | |
566 | |
572 | this->speed = speed; |
567 | this->speed = speed; |
573 | |
568 | |
574 | if (arch_init) |
569 | if (has_active_speed ()) |
575 | return; |
570 | activate (); |
576 | |
|
|
577 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
|
|
578 | { |
|
|
579 | /* If already on active list, don't do anything */ |
|
|
580 | if (active_next || active_prev || this == active_objects) |
|
|
581 | return; |
|
|
582 | |
|
|
583 | /* process_events() expects us to insert the object at the beginning |
|
|
584 | * of the list. */ |
|
|
585 | active_next = active_objects; |
|
|
586 | |
|
|
587 | if (active_next) |
|
|
588 | active_next->active_prev = this; |
|
|
589 | |
|
|
590 | active_objects = this; |
|
|
591 | } |
|
|
592 | else |
571 | else |
593 | { |
572 | deactivate (); |
594 | /* If not on the active list, nothing needs to be done */ |
|
|
595 | if (!active_next && !active_prev && this != active_objects) |
|
|
596 | return; |
|
|
597 | |
|
|
598 | if (!active_prev) |
|
|
599 | { |
|
|
600 | active_objects = active_next; |
|
|
601 | |
|
|
602 | if (active_next) |
|
|
603 | active_next->active_prev = 0; |
|
|
604 | } |
|
|
605 | else |
|
|
606 | { |
|
|
607 | active_prev->active_next = active_next; |
|
|
608 | |
|
|
609 | if (active_next) |
|
|
610 | active_next->active_prev = active_prev; |
|
|
611 | } |
|
|
612 | |
|
|
613 | active_next = 0; |
|
|
614 | active_prev = 0; |
|
|
615 | } |
|
|
616 | } |
|
|
617 | |
|
|
618 | /* This function removes object 'op' from the list of active |
|
|
619 | * objects. |
|
|
620 | * This should only be used for style maps or other such |
|
|
621 | * reference maps where you don't want an object that isn't |
|
|
622 | * in play chewing up cpu time getting processed. |
|
|
623 | * The reverse of this is to call update_ob_speed, which |
|
|
624 | * will do the right thing based on the speed of the object. |
|
|
625 | */ |
|
|
626 | void |
|
|
627 | remove_from_active_list (object *op) |
|
|
628 | { |
|
|
629 | /* If not on the active list, nothing needs to be done */ |
|
|
630 | if (!op->active_next && !op->active_prev && op != active_objects) |
|
|
631 | return; |
|
|
632 | |
|
|
633 | if (op->active_prev == NULL) |
|
|
634 | { |
|
|
635 | active_objects = op->active_next; |
|
|
636 | if (op->active_next != NULL) |
|
|
637 | op->active_next->active_prev = NULL; |
|
|
638 | } |
|
|
639 | else |
|
|
640 | { |
|
|
641 | op->active_prev->active_next = op->active_next; |
|
|
642 | if (op->active_next) |
|
|
643 | op->active_next->active_prev = op->active_prev; |
|
|
644 | } |
|
|
645 | op->active_next = NULL; |
|
|
646 | op->active_prev = NULL; |
|
|
647 | } |
573 | } |
648 | |
574 | |
649 | /* |
575 | /* |
650 | * update_object() updates the the map. |
576 | * update_object() updates the the map. |
651 | * It takes into account invisible objects (and represent squares covered |
577 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
699 | return; |
625 | return; |
700 | } |
626 | } |
701 | |
627 | |
702 | mapspace &m = op->ms (); |
628 | mapspace &m = op->ms (); |
703 | |
629 | |
704 | if (m.flags_ & P_NEED_UPDATE) |
630 | if (!(m.flags_ & P_UPTODATE)) |
705 | /* nop */; |
631 | /* nop */; |
706 | else if (action == UP_OBJ_INSERT) |
632 | else if (action == UP_OBJ_INSERT) |
707 | { |
633 | { |
708 | // this is likely overkill, TODO: revisit (schmorp) |
634 | // this is likely overkill, TODO: revisit (schmorp) |
709 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
635 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
718 | /* This isn't perfect, but I don't expect a lot of objects to |
644 | /* This isn't perfect, but I don't expect a lot of objects to |
719 | * to have move_allow right now. |
645 | * to have move_allow right now. |
720 | */ |
646 | */ |
721 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
647 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
722 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
648 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
723 | m.flags_ = P_NEED_UPDATE; |
649 | m.flags_ = 0; |
724 | } |
650 | } |
725 | /* if the object is being removed, we can't make intelligent |
651 | /* if the object is being removed, we can't make intelligent |
726 | * decisions, because remove_ob can't really pass the object |
652 | * decisions, because remove_ob can't really pass the object |
727 | * that is being removed. |
653 | * that is being removed. |
728 | */ |
654 | */ |
729 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
655 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
730 | m.flags_ = P_NEED_UPDATE; |
656 | m.flags_ = 0; |
731 | else if (action == UP_OBJ_FACE) |
657 | else if (action == UP_OBJ_FACE) |
732 | /* Nothing to do for that case */ ; |
658 | /* Nothing to do for that case */ ; |
733 | else |
659 | else |
734 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
660 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
735 | |
661 | |
736 | if (op->more) |
662 | if (op->more) |
737 | update_object (op->more, action); |
663 | update_object (op->more, action); |
738 | } |
664 | } |
739 | |
665 | |
740 | object::vector object::objects; // not yet used |
|
|
741 | object *object::first; |
666 | object *object::first; |
742 | |
667 | |
743 | object::object () |
668 | object::object () |
744 | { |
669 | { |
745 | SET_FLAG (this, FLAG_REMOVED); |
670 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
778 | |
703 | |
779 | prev = 0; |
704 | prev = 0; |
780 | next = 0; |
705 | next = 0; |
781 | } |
706 | } |
782 | |
707 | |
783 | object *object::create () |
708 | bool |
|
|
709 | object::active () const |
784 | { |
710 | { |
785 | object *op = new object; |
711 | return active_next || active_prev || this == active_objects; |
786 | op->link (); |
|
|
787 | return op; |
|
|
788 | } |
712 | } |
789 | |
713 | |
790 | void |
714 | void |
791 | object::do_destroy () |
715 | object::activate () |
792 | { |
716 | { |
793 | attachable::do_destroy (); |
717 | /* If already on active list, don't do anything */ |
794 | |
718 | if (active ()) |
795 | if (flag [FLAG_IS_LINKED]) |
|
|
796 | remove_button_link (this); |
|
|
797 | |
|
|
798 | if (flag [FLAG_FRIENDLY]) |
|
|
799 | remove_friendly_object (this); |
|
|
800 | |
|
|
801 | if (!flag [FLAG_REMOVED]) |
|
|
802 | remove (); |
|
|
803 | |
|
|
804 | if (flag [FLAG_FREED]) |
|
|
805 | return; |
719 | return; |
806 | |
720 | |
807 | flag [FLAG_FREED] = 1; |
721 | if (has_active_speed ()) |
808 | |
|
|
809 | // hack to ensure that freed objects still have a valid map |
|
|
810 | { |
|
|
811 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
812 | |
|
|
813 | if (!freed_map) |
|
|
814 | { |
722 | { |
815 | freed_map = new maptile; |
723 | /* process_events() expects us to insert the object at the beginning |
|
|
724 | * of the list. */ |
|
|
725 | active_next = active_objects; |
816 | |
726 | |
817 | freed_map->name = "/internal/freed_objects_map"; |
727 | if (active_next) |
818 | freed_map->width = 3; |
728 | active_next->active_prev = this; |
819 | freed_map->height = 3; |
|
|
820 | |
729 | |
821 | freed_map->allocate (); |
730 | active_objects = this; |
822 | } |
731 | } |
|
|
732 | } |
823 | |
733 | |
824 | map = freed_map; |
734 | void |
825 | x = 1; |
735 | object::activate_recursive () |
826 | y = 1; |
736 | { |
|
|
737 | activate (); |
|
|
738 | |
|
|
739 | for (object *op = inv; op; op = op->below) |
|
|
740 | op->activate_recursive (); |
|
|
741 | } |
|
|
742 | |
|
|
743 | /* This function removes object 'op' from the list of active |
|
|
744 | * objects. |
|
|
745 | * This should only be used for style maps or other such |
|
|
746 | * reference maps where you don't want an object that isn't |
|
|
747 | * in play chewing up cpu time getting processed. |
|
|
748 | * The reverse of this is to call update_ob_speed, which |
|
|
749 | * will do the right thing based on the speed of the object. |
|
|
750 | */ |
|
|
751 | void |
|
|
752 | object::deactivate () |
|
|
753 | { |
|
|
754 | /* If not on the active list, nothing needs to be done */ |
|
|
755 | if (!active ()) |
|
|
756 | return; |
|
|
757 | |
|
|
758 | if (active_prev == 0) |
|
|
759 | { |
|
|
760 | active_objects = active_next; |
|
|
761 | if (active_next) |
|
|
762 | active_next->active_prev = 0; |
827 | } |
763 | } |
|
|
764 | else |
|
|
765 | { |
|
|
766 | active_prev->active_next = active_next; |
|
|
767 | if (active_next) |
|
|
768 | active_next->active_prev = active_prev; |
|
|
769 | } |
828 | |
770 | |
829 | more = 0; |
771 | active_next = 0; |
830 | head = 0; |
772 | active_prev = 0; |
831 | inv = 0; |
773 | } |
832 | |
774 | |
833 | // clear those pointers that likely might have circular references to us |
775 | void |
834 | owner = 0; |
776 | object::deactivate_recursive () |
835 | enemy = 0; |
777 | { |
836 | attacked_by = 0; |
778 | for (object *op = inv; op; op = op->below) |
|
|
779 | op->deactivate_recursive (); |
837 | |
780 | |
838 | // only relevant for players(?), but make sure of it anyways |
781 | deactivate (); |
839 | contr = 0; |
782 | } |
840 | |
783 | |
841 | /* Remove object from the active list */ |
784 | void |
842 | set_speed (0); |
785 | object::set_flag_inv (int flag, int value) |
843 | |
786 | { |
844 | unlink (); |
787 | for (object *op = inv; op; op = op->below) |
|
|
788 | { |
|
|
789 | op->flag [flag] = value; |
|
|
790 | op->set_flag_inv (flag, value); |
|
|
791 | } |
845 | } |
792 | } |
846 | |
793 | |
847 | /* |
794 | /* |
848 | * Remove and free all objects in the inventory of the given object. |
795 | * Remove and free all objects in the inventory of the given object. |
849 | * object.c ? |
796 | * object.c ? |
850 | */ |
797 | */ |
851 | void |
798 | void |
852 | object::destroy_inv (bool drop_to_ground) |
799 | object::destroy_inv (bool drop_to_ground) |
853 | { |
800 | { |
|
|
801 | // need to check first, because the checks below might segfault |
|
|
802 | // as we might be on an invalid mapspace and crossfire code |
|
|
803 | // is too buggy to ensure that the inventory is empty. |
|
|
804 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
805 | // cf will crash below with off-map x and y |
854 | if (!inv) |
806 | if (!inv) |
855 | return; |
807 | return; |
856 | |
808 | |
857 | /* Only if the space blocks everything do we not process - |
809 | /* Only if the space blocks everything do we not process - |
858 | * if some form of movement is allowed, let objects |
810 | * if some form of movement is allowed, let objects |
859 | * drop on that space. |
811 | * drop on that space. |
860 | */ |
812 | */ |
861 | if (!drop_to_ground || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
813 | if (!drop_to_ground |
|
|
814 | || !map |
|
|
815 | || map->in_memory != MAP_IN_MEMORY |
|
|
816 | || ms ().move_block == MOVE_ALL) |
862 | { |
817 | { |
863 | while (inv) |
818 | while (inv) |
864 | { |
819 | { |
865 | inv->destroy_inv (drop_to_ground); |
820 | inv->destroy_inv (drop_to_ground); |
866 | inv->destroy (); |
821 | inv->destroy (); |
… | |
… | |
877 | || op->type == RUNE |
832 | || op->type == RUNE |
878 | || op->type == TRAP |
833 | || op->type == TRAP |
879 | || op->flag [FLAG_IS_A_TEMPLATE]) |
834 | || op->flag [FLAG_IS_A_TEMPLATE]) |
880 | op->destroy (); |
835 | op->destroy (); |
881 | else |
836 | else |
882 | { |
837 | map->insert (op, x, y); |
883 | op->remove (); |
|
|
884 | op->x = x; |
|
|
885 | op->y = y; |
|
|
886 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
887 | } |
838 | } |
|
|
839 | } |
|
|
840 | } |
|
|
841 | |
|
|
842 | object *object::create () |
|
|
843 | { |
|
|
844 | object *op = new object; |
|
|
845 | op->link (); |
|
|
846 | return op; |
|
|
847 | } |
|
|
848 | |
|
|
849 | void |
|
|
850 | object::do_destroy () |
|
|
851 | { |
|
|
852 | if (flag [FLAG_IS_LINKED]) |
|
|
853 | remove_button_link (this); |
|
|
854 | |
|
|
855 | if (flag [FLAG_FRIENDLY]) |
|
|
856 | remove_friendly_object (this); |
|
|
857 | |
|
|
858 | if (!flag [FLAG_REMOVED]) |
|
|
859 | remove (); |
|
|
860 | |
|
|
861 | if (flag [FLAG_FREED]) |
|
|
862 | return; |
|
|
863 | |
|
|
864 | set_speed (0); |
|
|
865 | |
|
|
866 | flag [FLAG_FREED] = 1; |
|
|
867 | |
|
|
868 | attachable::do_destroy (); |
|
|
869 | |
|
|
870 | destroy_inv (true); |
|
|
871 | unlink (); |
|
|
872 | |
|
|
873 | // hack to ensure that freed objects still have a valid map |
|
|
874 | { |
|
|
875 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
876 | |
|
|
877 | if (!freed_map) |
|
|
878 | { |
|
|
879 | freed_map = new maptile; |
|
|
880 | |
|
|
881 | freed_map->name = "/internal/freed_objects_map"; |
|
|
882 | freed_map->width = 3; |
|
|
883 | freed_map->height = 3; |
|
|
884 | |
|
|
885 | freed_map->alloc (); |
|
|
886 | freed_map->in_memory = MAP_IN_MEMORY; |
888 | } |
887 | } |
|
|
888 | |
|
|
889 | map = freed_map; |
|
|
890 | x = 1; |
|
|
891 | y = 1; |
|
|
892 | } |
|
|
893 | |
|
|
894 | head = 0; |
|
|
895 | |
|
|
896 | if (more) |
889 | } |
897 | { |
|
|
898 | more->destroy (); |
|
|
899 | more = 0; |
|
|
900 | } |
|
|
901 | |
|
|
902 | // clear those pointers that likely might have circular references to us |
|
|
903 | owner = 0; |
|
|
904 | enemy = 0; |
|
|
905 | attacked_by = 0; |
|
|
906 | |
|
|
907 | // only relevant for players(?), but make sure of it anyways |
|
|
908 | contr = 0; |
890 | } |
909 | } |
891 | |
910 | |
892 | void |
911 | void |
893 | object::destroy (bool destroy_inventory) |
912 | object::destroy (bool destroy_inventory) |
894 | { |
913 | { |
895 | if (destroyed ()) |
914 | if (destroyed ()) |
896 | return; |
915 | return; |
897 | |
916 | |
898 | if (more) |
|
|
899 | { |
|
|
900 | //TODO: non-head objects must not have inventory |
|
|
901 | more->destroy (destroy_inventory); |
|
|
902 | more = 0; |
|
|
903 | } |
|
|
904 | |
|
|
905 | if (destroy_inventory) |
917 | if (destroy_inventory) |
906 | destroy_inv (true); |
918 | destroy_inv (false); |
907 | |
919 | |
908 | attachable::destroy (); |
920 | attachable::destroy (); |
909 | } |
921 | } |
910 | |
922 | |
911 | /* |
923 | /* |
… | |
… | |
964 | * to save cpu time. |
976 | * to save cpu time. |
965 | */ |
977 | */ |
966 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
978 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
967 | otmp->update_stats (); |
979 | otmp->update_stats (); |
968 | |
980 | |
969 | if (above != NULL) |
981 | if (above) |
970 | above->below = below; |
982 | above->below = below; |
971 | else |
983 | else |
972 | env->inv = below; |
984 | env->inv = below; |
973 | |
985 | |
974 | if (below != NULL) |
986 | if (below) |
975 | below->above = above; |
987 | below->above = above; |
976 | |
988 | |
977 | /* we set up values so that it could be inserted into |
989 | /* we set up values so that it could be inserted into |
978 | * the map, but we don't actually do that - it is up |
990 | * the map, but we don't actually do that - it is up |
979 | * to the caller to decide what we want to do. |
991 | * to the caller to decide what we want to do. |
… | |
… | |
983 | above = 0, below = 0; |
995 | above = 0, below = 0; |
984 | env = 0; |
996 | env = 0; |
985 | } |
997 | } |
986 | else if (map) |
998 | else if (map) |
987 | { |
999 | { |
988 | /* Re did the following section of code - it looks like it had |
1000 | if (type == PLAYER) |
989 | * lots of logic for things we no longer care about |
|
|
990 | */ |
1001 | { |
|
|
1002 | --map->players; |
|
|
1003 | map->touch (); |
|
|
1004 | } |
|
|
1005 | |
|
|
1006 | map->dirty = true; |
991 | |
1007 | |
992 | /* link the object above us */ |
1008 | /* link the object above us */ |
993 | if (above) |
1009 | if (above) |
994 | above->below = below; |
1010 | above->below = below; |
995 | else |
1011 | else |
… | |
… | |
1024 | if (map->in_memory == MAP_SAVING) |
1040 | if (map->in_memory == MAP_SAVING) |
1025 | return; |
1041 | return; |
1026 | |
1042 | |
1027 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1043 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1028 | |
1044 | |
1029 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1045 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1030 | { |
1046 | { |
1031 | /* No point updating the players look faces if he is the object |
1047 | /* No point updating the players look faces if he is the object |
1032 | * being removed. |
1048 | * being removed. |
1033 | */ |
1049 | */ |
1034 | |
1050 | |
… | |
… | |
1046 | |
1062 | |
1047 | if (tmp->contr->ns) |
1063 | if (tmp->contr->ns) |
1048 | tmp->contr->ns->floorbox_update (); |
1064 | tmp->contr->ns->floorbox_update (); |
1049 | } |
1065 | } |
1050 | |
1066 | |
1051 | /* See if player moving off should effect something */ |
1067 | /* See if object moving off should effect something */ |
1052 | if (check_walk_off |
1068 | if (check_walk_off |
1053 | && ((move_type & tmp->move_off) |
1069 | && ((move_type & tmp->move_off) |
1054 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1070 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1055 | { |
1071 | { |
1056 | move_apply (tmp, this, 0); |
1072 | move_apply (tmp, this, 0); |
… | |
… | |
1058 | if (destroyed ()) |
1074 | if (destroyed ()) |
1059 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1075 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1060 | } |
1076 | } |
1061 | |
1077 | |
1062 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1078 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1063 | |
1079 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1064 | if (tmp->above == tmp) |
1080 | if (tmp->above == tmp) |
1065 | tmp->above = 0; |
1081 | tmp->above = 0; |
1066 | |
1082 | |
1067 | last = tmp; |
1083 | last = tmp; |
1068 | } |
1084 | } |
1069 | |
1085 | |
1070 | /* last == NULL of there are no objects on this space */ |
1086 | /* last == NULL if there are no objects on this space */ |
|
|
1087 | //TODO: this makes little sense, why only update the topmost object? |
1071 | if (!last) |
1088 | if (!last) |
1072 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1089 | map->at (x, y).flags_ = 0; |
1073 | else |
1090 | else |
1074 | update_object (last, UP_OBJ_REMOVE); |
1091 | update_object (last, UP_OBJ_REMOVE); |
1075 | |
1092 | |
1076 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1093 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1077 | update_all_los (map, x, y); |
1094 | update_all_los (map, x, y); |
… | |
… | |
1120 | * job preparing multi-part monsters |
1137 | * job preparing multi-part monsters |
1121 | */ |
1138 | */ |
1122 | object * |
1139 | object * |
1123 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1140 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1124 | { |
1141 | { |
1125 | object *tmp; |
|
|
1126 | |
|
|
1127 | if (op->head) |
|
|
1128 | op = op->head; |
|
|
1129 | |
|
|
1130 | for (tmp = op; tmp; tmp = tmp->more) |
1142 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1131 | { |
1143 | { |
1132 | tmp->x = x + tmp->arch->clone.x; |
1144 | tmp->x = x + tmp->arch->clone.x; |
1133 | tmp->y = y + tmp->arch->clone.y; |
1145 | tmp->y = y + tmp->arch->clone.y; |
1134 | } |
1146 | } |
1135 | |
1147 | |
… | |
… | |
1166 | { |
1178 | { |
1167 | LOG (llevError, "Trying to insert freed object!\n"); |
1179 | LOG (llevError, "Trying to insert freed object!\n"); |
1168 | return NULL; |
1180 | return NULL; |
1169 | } |
1181 | } |
1170 | |
1182 | |
1171 | if (m == NULL) |
1183 | if (!m) |
1172 | { |
1184 | { |
1173 | char *dump = dump_object (op); |
1185 | char *dump = dump_object (op); |
1174 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1186 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1175 | free (dump); |
1187 | free (dump); |
1176 | return op; |
1188 | return op; |
… | |
… | |
1203 | { |
1215 | { |
1204 | /* The part may be on a different map. */ |
1216 | /* The part may be on a different map. */ |
1205 | |
1217 | |
1206 | object *more = op->more; |
1218 | object *more = op->more; |
1207 | |
1219 | |
1208 | /* We really need the caller to normalize coordinates - if |
1220 | /* We really need the caller to normalise coordinates - if |
1209 | * we set the map, that doesn't work if the location is within |
1221 | * we set the map, that doesn't work if the location is within |
1210 | * a map and this is straddling an edge. So only if coordinate |
1222 | * a map and this is straddling an edge. So only if coordinate |
1211 | * is clear wrong do we normalize it. |
1223 | * is clear wrong do we normalise it. |
1212 | */ |
1224 | */ |
1213 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1225 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1214 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1226 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1215 | else if (!more->map) |
1227 | else if (!more->map) |
1216 | { |
1228 | { |
… | |
… | |
1240 | y = op->y; |
1252 | y = op->y; |
1241 | |
1253 | |
1242 | /* this has to be done after we translate the coordinates. |
1254 | /* this has to be done after we translate the coordinates. |
1243 | */ |
1255 | */ |
1244 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1256 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1245 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1257 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1246 | if (object::can_merge (op, tmp)) |
1258 | if (object::can_merge (op, tmp)) |
1247 | { |
1259 | { |
1248 | op->nrof += tmp->nrof; |
1260 | op->nrof += tmp->nrof; |
1249 | tmp->destroy (); |
1261 | tmp->destroy (); |
1250 | } |
1262 | } |
… | |
… | |
1277 | else |
1289 | else |
1278 | { |
1290 | { |
1279 | /* If there are other objects, then */ |
1291 | /* If there are other objects, then */ |
1280 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1292 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1281 | { |
1293 | { |
1282 | object *last = NULL; |
1294 | object *last = 0; |
1283 | |
1295 | |
1284 | /* |
1296 | /* |
1285 | * If there are multiple objects on this space, we do some trickier handling. |
1297 | * If there are multiple objects on this space, we do some trickier handling. |
1286 | * We've already dealt with merging if appropriate. |
1298 | * We've already dealt with merging if appropriate. |
1287 | * Generally, we want to put the new object on top. But if |
1299 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1291 | * once we get to them. This reduces the need to traverse over all of |
1303 | * once we get to them. This reduces the need to traverse over all of |
1292 | * them when adding another one - this saves quite a bit of cpu time |
1304 | * them when adding another one - this saves quite a bit of cpu time |
1293 | * when lots of spells are cast in one area. Currently, it is presumed |
1305 | * when lots of spells are cast in one area. Currently, it is presumed |
1294 | * that flying non pickable objects are spell objects. |
1306 | * that flying non pickable objects are spell objects. |
1295 | */ |
1307 | */ |
1296 | |
|
|
1297 | while (top != NULL) |
1308 | while (top) |
1298 | { |
1309 | { |
1299 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1310 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1300 | floor = top; |
1311 | floor = top; |
1301 | |
1312 | |
1302 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1313 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1355 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1366 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1356 | |
1367 | |
1357 | if (op->above) |
1368 | if (op->above) |
1358 | op->above->below = op; |
1369 | op->above->below = op; |
1359 | |
1370 | |
1360 | op->below = NULL; |
1371 | op->below = 0; |
1361 | op->ms ().bot = op; |
1372 | op->ms ().bot = op; |
1362 | } |
1373 | } |
1363 | else |
1374 | else |
1364 | { /* get inserted into the stack above top */ |
1375 | { /* get inserted into the stack above top */ |
1365 | op->above = top->above; |
1376 | op->above = top->above; |
… | |
… | |
1369 | |
1380 | |
1370 | op->below = top; |
1381 | op->below = top; |
1371 | top->above = op; |
1382 | top->above = op; |
1372 | } |
1383 | } |
1373 | |
1384 | |
1374 | if (op->above == NULL) |
1385 | if (!op->above) |
1375 | op->ms ().top = op; |
1386 | op->ms ().top = op; |
1376 | } /* else not INS_BELOW_ORIGINATOR */ |
1387 | } /* else not INS_BELOW_ORIGINATOR */ |
1377 | |
1388 | |
1378 | if (op->type == PLAYER) |
1389 | if (op->type == PLAYER) |
|
|
1390 | { |
1379 | op->contr->do_los = 1; |
1391 | op->contr->do_los = 1; |
|
|
1392 | ++op->map->players; |
|
|
1393 | op->map->touch (); |
|
|
1394 | } |
|
|
1395 | |
|
|
1396 | op->map->dirty = true; |
1380 | |
1397 | |
1381 | /* If we have a floor, we know the player, if any, will be above |
1398 | /* If we have a floor, we know the player, if any, will be above |
1382 | * it, so save a few ticks and start from there. |
1399 | * it, so save a few ticks and start from there. |
1383 | */ |
1400 | */ |
1384 | if (!(flag & INS_MAP_LOAD)) |
1401 | if (!(flag & INS_MAP_LOAD)) |
… | |
… | |
1390 | * visible to others on this map. But update_all_los is really |
1407 | * visible to others on this map. But update_all_los is really |
1391 | * an inefficient way to do this, as it means los for all players |
1408 | * an inefficient way to do this, as it means los for all players |
1392 | * on the map will get recalculated. The players could very well |
1409 | * on the map will get recalculated. The players could very well |
1393 | * be far away from this change and not affected in any way - |
1410 | * be far away from this change and not affected in any way - |
1394 | * this should get redone to only look for players within range, |
1411 | * this should get redone to only look for players within range, |
1395 | * or just updating the P_NEED_UPDATE for spaces within this area |
1412 | * or just updating the P_UPTODATE for spaces within this area |
1396 | * of effect may be sufficient. |
1413 | * of effect may be sufficient. |
1397 | */ |
1414 | */ |
1398 | if (op->map->darkness && (op->glow_radius != 0)) |
1415 | if (op->map->darkness && (op->glow_radius != 0)) |
1399 | update_all_los (op->map, op->x, op->y); |
1416 | update_all_los (op->map, op->x, op->y); |
1400 | |
1417 | |
… | |
… | |
1438 | { |
1455 | { |
1439 | object *tmp, *tmp1; |
1456 | object *tmp, *tmp1; |
1440 | |
1457 | |
1441 | /* first search for itself and remove any old instances */ |
1458 | /* first search for itself and remove any old instances */ |
1442 | |
1459 | |
1443 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1460 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1444 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1461 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1445 | tmp->destroy (); |
1462 | tmp->destroy (); |
1446 | |
1463 | |
1447 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1464 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1448 | |
1465 | |
1449 | tmp1->x = op->x; |
1466 | tmp1->x = op->x; |
1450 | tmp1->y = op->y; |
1467 | tmp1->y = op->y; |
1451 | insert_ob_in_map (tmp1, op->map, op, 0); |
1468 | insert_ob_in_map (tmp1, op->map, op, 0); |
|
|
1469 | } |
|
|
1470 | |
|
|
1471 | object * |
|
|
1472 | object::insert_at (object *where, object *originator, int flags) |
|
|
1473 | { |
|
|
1474 | where->map->insert (this, where->x, where->y, originator, flags); |
1452 | } |
1475 | } |
1453 | |
1476 | |
1454 | /* |
1477 | /* |
1455 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1478 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1456 | * is returned contains nr objects, and the remaining parts contains |
1479 | * is returned contains nr objects, and the remaining parts contains |
1457 | * the rest (or is removed and freed if that number is 0). |
1480 | * the rest (or is removed and freed if that number is 0). |
1458 | * On failure, NULL is returned, and the reason put into the |
1481 | * On failure, NULL is returned, and the reason put into the |
1459 | * global static errmsg array. |
1482 | * global static errmsg array. |
1460 | */ |
1483 | */ |
1461 | |
|
|
1462 | object * |
1484 | object * |
1463 | get_split_ob (object *orig_ob, uint32 nr) |
1485 | get_split_ob (object *orig_ob, uint32 nr) |
1464 | { |
1486 | { |
1465 | object *newob; |
1487 | object *newob; |
1466 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1488 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
… | |
… | |
1730 | * |
1752 | * |
1731 | * MSW 2001-07-08: Check all objects on space, not just those below |
1753 | * MSW 2001-07-08: Check all objects on space, not just those below |
1732 | * object being inserted. insert_ob_in_map may not put new objects |
1754 | * object being inserted. insert_ob_in_map may not put new objects |
1733 | * on top. |
1755 | * on top. |
1734 | */ |
1756 | */ |
1735 | |
|
|
1736 | int |
1757 | int |
1737 | check_move_on (object *op, object *originator) |
1758 | check_move_on (object *op, object *originator) |
1738 | { |
1759 | { |
1739 | object *tmp; |
1760 | object *tmp; |
1740 | maptile *m = op->map; |
1761 | maptile *m = op->map; |
… | |
… | |
1767 | |
1788 | |
1768 | /* The objects have to be checked from top to bottom. |
1789 | /* The objects have to be checked from top to bottom. |
1769 | * Hence, we first go to the top: |
1790 | * Hence, we first go to the top: |
1770 | */ |
1791 | */ |
1771 | |
1792 | |
1772 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1793 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1773 | { |
1794 | { |
1774 | /* Trim the search when we find the first other spell effect |
1795 | /* Trim the search when we find the first other spell effect |
1775 | * this helps performance so that if a space has 50 spell objects, |
1796 | * this helps performance so that if a space has 50 spell objects, |
1776 | * we don't need to check all of them. |
1797 | * we don't need to check all of them. |
1777 | */ |
1798 | */ |
… | |
… | |
1835 | * The first matching object is returned, or NULL if none. |
1856 | * The first matching object is returned, or NULL if none. |
1836 | */ |
1857 | */ |
1837 | object * |
1858 | object * |
1838 | present_arch (const archetype *at, maptile *m, int x, int y) |
1859 | present_arch (const archetype *at, maptile *m, int x, int y) |
1839 | { |
1860 | { |
1840 | if (m == NULL || out_of_map (m, x, y)) |
1861 | if (!m || out_of_map (m, x, y)) |
1841 | { |
1862 | { |
1842 | LOG (llevError, "Present_arch called outside map.\n"); |
1863 | LOG (llevError, "Present_arch called outside map.\n"); |
1843 | return NULL; |
1864 | return NULL; |
1844 | } |
1865 | } |
1845 | |
1866 | |
1846 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1867 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1847 | if (tmp->arch == at) |
1868 | if (tmp->arch == at) |
1848 | return tmp; |
1869 | return tmp; |
1849 | |
1870 | |
1850 | return NULL; |
1871 | return NULL; |
1851 | } |
1872 | } |
… | |
… | |
1862 | { |
1883 | { |
1863 | LOG (llevError, "Present called outside map.\n"); |
1884 | LOG (llevError, "Present called outside map.\n"); |
1864 | return NULL; |
1885 | return NULL; |
1865 | } |
1886 | } |
1866 | |
1887 | |
1867 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1888 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1868 | if (tmp->type == type) |
1889 | if (tmp->type == type) |
1869 | return tmp; |
1890 | return tmp; |
1870 | |
1891 | |
1871 | return NULL; |
1892 | return NULL; |
1872 | } |
1893 | } |
… | |
… | |
2597 | } |
2618 | } |
2598 | else |
2619 | else |
2599 | item = item->env; |
2620 | item = item->env; |
2600 | } |
2621 | } |
2601 | |
2622 | |
|
|
2623 | |
|
|
2624 | const char * |
|
|
2625 | object::flag_desc (char *desc, int len) const |
|
|
2626 | { |
|
|
2627 | char *p = desc; |
|
|
2628 | bool first = true; |
|
|
2629 | |
|
|
2630 | *p = 0; |
|
|
2631 | |
|
|
2632 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2633 | { |
|
|
2634 | if (len <= 10) // magic constant! |
|
|
2635 | { |
|
|
2636 | snprintf (p, len, ",..."); |
|
|
2637 | break; |
|
|
2638 | } |
|
|
2639 | |
|
|
2640 | if (flag [i]) |
|
|
2641 | { |
|
|
2642 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2643 | len -= cnt; |
|
|
2644 | p += cnt; |
|
|
2645 | first = false; |
|
|
2646 | } |
|
|
2647 | } |
|
|
2648 | |
|
|
2649 | return desc; |
|
|
2650 | } |
|
|
2651 | |
2602 | // return a suitable string describing an objetc in enough detail to find it |
2652 | // return a suitable string describing an object in enough detail to find it |
2603 | const char * |
2653 | const char * |
2604 | object::debug_desc (char *info) const |
2654 | object::debug_desc (char *info) const |
2605 | { |
2655 | { |
|
|
2656 | char flagdesc[512]; |
2606 | char info2[256 * 3]; |
2657 | char info2[256 * 4]; |
2607 | char *p = info; |
2658 | char *p = info; |
2608 | |
2659 | |
2609 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2660 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2610 | count, |
2661 | count, uuid.seq, |
2611 | &name, |
2662 | &name, |
2612 | title ? " " : "", |
2663 | title ? "\",title:" : "", |
2613 | title ? (const char *)title : ""); |
2664 | title ? (const char *)title : "", |
|
|
2665 | flag_desc (flagdesc, 512), type); |
2614 | |
2666 | |
2615 | if (env) |
2667 | if (env) |
2616 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2668 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2617 | |
2669 | |
2618 | if (map) |
2670 | if (map) |
2619 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2671 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2620 | |
2672 | |
2621 | return info; |
2673 | return info; |
2622 | } |
2674 | } |
2623 | |
2675 | |
2624 | const char * |
2676 | const char * |
2625 | object::debug_desc () const |
2677 | object::debug_desc () const |
2626 | { |
2678 | { |
2627 | static char info[256 * 3]; |
2679 | static char info[256 * 4]; |
2628 | return debug_desc (info); |
2680 | return debug_desc (info); |
2629 | } |
2681 | } |
2630 | |
2682 | |