… | |
… | |
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 |
… | |
… | |
277 | |
276 | |
278 | /* Note sure why the following is the case - either the object has to |
277 | /* 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 |
278 | * be animated or have a very low speed. Is this an attempted monster |
280 | * check? |
279 | * check? |
281 | */ |
280 | */ |
282 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
281 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
283 | return 0; |
282 | return 0; |
284 | |
283 | |
285 | switch (ob1->type) |
284 | switch (ob1->type) |
286 | { |
285 | { |
287 | case SCROLL: |
286 | case SCROLL: |
… | |
… | |
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 | /* |
… | |
… | |
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 | object::set_speed (float speed) |
558 | object::set_speed (float speed) |
560 | { |
559 | { |
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) |
560 | if (flag [FLAG_FREED] && speed) |
567 | { |
561 | { |
568 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
562 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
569 | speed = 0; |
563 | speed = 0; |
570 | } |
564 | } |
571 | |
565 | |
572 | this->speed = speed; |
566 | this->speed = speed; |
573 | |
567 | |
574 | if (arch_init) |
568 | if (has_active_speed ()) |
575 | return; |
569 | 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 |
570 | else |
593 | { |
571 | 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 | } |
572 | } |
648 | |
573 | |
649 | /* |
574 | /* |
650 | * update_object() updates the the map. |
575 | * update_object() updates the the map. |
651 | * It takes into account invisible objects (and represent squares covered |
576 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
735 | |
660 | |
736 | if (op->more) |
661 | if (op->more) |
737 | update_object (op->more, action); |
662 | update_object (op->more, action); |
738 | } |
663 | } |
739 | |
664 | |
740 | object::vector object::objects; // not yet used |
|
|
741 | object *object::first; |
665 | object *object::first; |
742 | |
666 | |
743 | object::object () |
667 | object::object () |
744 | { |
668 | { |
745 | SET_FLAG (this, FLAG_REMOVED); |
669 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
778 | |
702 | |
779 | prev = 0; |
703 | prev = 0; |
780 | next = 0; |
704 | next = 0; |
781 | } |
705 | } |
782 | |
706 | |
|
|
707 | bool |
|
|
708 | object::active () const |
|
|
709 | { |
|
|
710 | return active_next || active_prev || this == active_objects; |
|
|
711 | } |
|
|
712 | |
|
|
713 | void |
|
|
714 | object::activate () |
|
|
715 | { |
|
|
716 | /* If already on active list, don't do anything */ |
|
|
717 | if (active ()) |
|
|
718 | return; |
|
|
719 | |
|
|
720 | if (has_active_speed ()) |
|
|
721 | { |
|
|
722 | /* process_events() expects us to insert the object at the beginning |
|
|
723 | * of the list. */ |
|
|
724 | active_next = active_objects; |
|
|
725 | |
|
|
726 | if (active_next) |
|
|
727 | active_next->active_prev = this; |
|
|
728 | |
|
|
729 | active_objects = this; |
|
|
730 | } |
|
|
731 | } |
|
|
732 | |
|
|
733 | void |
|
|
734 | object::activate_recursive () |
|
|
735 | { |
|
|
736 | activate (); |
|
|
737 | |
|
|
738 | for (object *op = inv; op; op = op->above) |
|
|
739 | op->activate_recursive (); |
|
|
740 | } |
|
|
741 | |
|
|
742 | /* This function removes object 'op' from the list of active |
|
|
743 | * objects. |
|
|
744 | * This should only be used for style maps or other such |
|
|
745 | * reference maps where you don't want an object that isn't |
|
|
746 | * in play chewing up cpu time getting processed. |
|
|
747 | * The reverse of this is to call update_ob_speed, which |
|
|
748 | * will do the right thing based on the speed of the object. |
|
|
749 | */ |
|
|
750 | void |
|
|
751 | object::deactivate () |
|
|
752 | { |
|
|
753 | /* If not on the active list, nothing needs to be done */ |
|
|
754 | if (!active ()) |
|
|
755 | return; |
|
|
756 | |
|
|
757 | if (active_prev == 0) |
|
|
758 | { |
|
|
759 | active_objects = active_next; |
|
|
760 | if (active_next) |
|
|
761 | active_next->active_prev = 0; |
|
|
762 | } |
|
|
763 | else |
|
|
764 | { |
|
|
765 | active_prev->active_next = active_next; |
|
|
766 | if (active_next) |
|
|
767 | active_next->active_prev = active_prev; |
|
|
768 | } |
|
|
769 | |
|
|
770 | active_next = 0; |
|
|
771 | active_prev = 0; |
|
|
772 | } |
|
|
773 | |
|
|
774 | void |
|
|
775 | object::deactivate_recursive () |
|
|
776 | { |
|
|
777 | for (object *op = inv; op; op = op->above) |
|
|
778 | op->deactivate_recursive (); |
|
|
779 | |
|
|
780 | deactivate (); |
|
|
781 | } |
|
|
782 | |
783 | /* |
783 | /* |
784 | * Remove and free all objects in the inventory of the given object. |
784 | * Remove and free all objects in the inventory of the given object. |
785 | * object.c ? |
785 | * object.c ? |
786 | */ |
786 | */ |
787 | void |
787 | void |
788 | object::destroy_inv (bool drop_to_ground) |
788 | object::destroy_inv (bool drop_to_ground) |
789 | { |
789 | { |
|
|
790 | // need to check first, because the checks below might segfault |
|
|
791 | // as we might be on an invalid mapspace and crossfire code |
|
|
792 | // is too buggy to ensure that the inventory is empty. |
|
|
793 | // corollary: if you create arrows etc. with stuff in tis inventory, |
|
|
794 | // cf will crash below with off-map x and y |
|
|
795 | if (!inv) |
|
|
796 | return; |
|
|
797 | |
790 | /* Only if the space blocks everything do we not process - |
798 | /* Only if the space blocks everything do we not process - |
791 | * if some form of movement is allowed, let objects |
799 | * if some form of movement is allowed, let objects |
792 | * drop on that space. |
800 | * drop on that space. |
793 | */ |
801 | */ |
794 | if (!drop_to_ground |
802 | if (!drop_to_ground |
795 | || !map |
803 | || !map |
796 | || map->in_memory != MAP_IN_MEMORY |
804 | || map->in_memory != MAP_IN_MEMORY |
797 | || map->at (x, y).move_block == MOVE_ALL) |
805 | || ms ().move_block == MOVE_ALL) |
798 | { |
806 | { |
799 | while (inv) |
807 | while (inv) |
800 | { |
808 | { |
801 | inv->destroy_inv (drop_to_ground); |
809 | inv->destroy_inv (drop_to_ground); |
802 | inv->destroy (); |
810 | inv->destroy (); |
… | |
… | |
813 | || op->type == RUNE |
821 | || op->type == RUNE |
814 | || op->type == TRAP |
822 | || op->type == TRAP |
815 | || op->flag [FLAG_IS_A_TEMPLATE]) |
823 | || op->flag [FLAG_IS_A_TEMPLATE]) |
816 | op->destroy (); |
824 | op->destroy (); |
817 | else |
825 | else |
818 | { |
826 | map->insert (op, x, y); |
819 | op->remove (); |
|
|
820 | op->x = x; |
|
|
821 | op->y = y; |
|
|
822 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
823 | } |
|
|
824 | } |
827 | } |
825 | } |
828 | } |
826 | } |
829 | } |
827 | |
830 | |
828 | object *object::create () |
831 | object *object::create () |
… | |
… | |
866 | |
869 | |
867 | freed_map->name = "/internal/freed_objects_map"; |
870 | freed_map->name = "/internal/freed_objects_map"; |
868 | freed_map->width = 3; |
871 | freed_map->width = 3; |
869 | freed_map->height = 3; |
872 | freed_map->height = 3; |
870 | |
873 | |
871 | freed_map->allocate (); |
874 | freed_map->alloc (); |
872 | } |
875 | } |
873 | |
876 | |
874 | map = freed_map; |
877 | map = freed_map; |
875 | x = 1; |
878 | x = 1; |
876 | y = 1; |
879 | y = 1; |
… | |
… | |
961 | * to save cpu time. |
964 | * to save cpu time. |
962 | */ |
965 | */ |
963 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
966 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
964 | otmp->update_stats (); |
967 | otmp->update_stats (); |
965 | |
968 | |
966 | if (above != NULL) |
969 | if (above) |
967 | above->below = below; |
970 | above->below = below; |
968 | else |
971 | else |
969 | env->inv = below; |
972 | env->inv = below; |
970 | |
973 | |
971 | if (below != NULL) |
974 | if (below) |
972 | below->above = above; |
975 | below->above = above; |
973 | |
976 | |
974 | /* we set up values so that it could be inserted into |
977 | /* we set up values so that it could be inserted into |
975 | * the map, but we don't actually do that - it is up |
978 | * the map, but we don't actually do that - it is up |
976 | * to the caller to decide what we want to do. |
979 | * to the caller to decide what we want to do. |
… | |
… | |
980 | above = 0, below = 0; |
983 | above = 0, below = 0; |
981 | env = 0; |
984 | env = 0; |
982 | } |
985 | } |
983 | else if (map) |
986 | else if (map) |
984 | { |
987 | { |
985 | /* Re did the following section of code - it looks like it had |
988 | if (type == PLAYER) |
986 | * lots of logic for things we no longer care about |
|
|
987 | */ |
989 | { |
|
|
990 | --map->players; |
|
|
991 | map->last_access = runtime; |
|
|
992 | } |
|
|
993 | |
|
|
994 | map->dirty = true; |
988 | |
995 | |
989 | /* link the object above us */ |
996 | /* link the object above us */ |
990 | if (above) |
997 | if (above) |
991 | above->below = below; |
998 | above->below = below; |
992 | else |
999 | else |
… | |
… | |
1043 | |
1050 | |
1044 | if (tmp->contr->ns) |
1051 | if (tmp->contr->ns) |
1045 | tmp->contr->ns->floorbox_update (); |
1052 | tmp->contr->ns->floorbox_update (); |
1046 | } |
1053 | } |
1047 | |
1054 | |
1048 | /* See if player moving off should effect something */ |
1055 | /* See if object moving off should effect something */ |
1049 | if (check_walk_off |
1056 | if (check_walk_off |
1050 | && ((move_type & tmp->move_off) |
1057 | && ((move_type & tmp->move_off) |
1051 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1058 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1052 | { |
1059 | { |
1053 | move_apply (tmp, this, 0); |
1060 | move_apply (tmp, this, 0); |
… | |
… | |
1055 | if (destroyed ()) |
1062 | if (destroyed ()) |
1056 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1063 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1057 | } |
1064 | } |
1058 | |
1065 | |
1059 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1066 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1060 | |
1067 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
1061 | if (tmp->above == tmp) |
1068 | if (tmp->above == tmp) |
1062 | tmp->above = 0; |
1069 | tmp->above = 0; |
1063 | |
1070 | |
1064 | last = tmp; |
1071 | last = tmp; |
1065 | } |
1072 | } |
1066 | |
1073 | |
1067 | /* last == NULL of there are no objects on this space */ |
1074 | /* last == NULL if there are no objects on this space */ |
|
|
1075 | //TODO: this makes little sense, why only update the topmost object? |
1068 | if (!last) |
1076 | if (!last) |
1069 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1077 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1070 | else |
1078 | else |
1071 | update_object (last, UP_OBJ_REMOVE); |
1079 | update_object (last, UP_OBJ_REMOVE); |
1072 | |
1080 | |
… | |
… | |
1117 | * job preparing multi-part monsters |
1125 | * job preparing multi-part monsters |
1118 | */ |
1126 | */ |
1119 | object * |
1127 | object * |
1120 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1128 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1121 | { |
1129 | { |
1122 | object *tmp; |
|
|
1123 | |
|
|
1124 | if (op->head) |
|
|
1125 | op = op->head; |
|
|
1126 | |
|
|
1127 | for (tmp = op; tmp; tmp = tmp->more) |
1130 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1128 | { |
1131 | { |
1129 | tmp->x = x + tmp->arch->clone.x; |
1132 | tmp->x = x + tmp->arch->clone.x; |
1130 | tmp->y = y + tmp->arch->clone.y; |
1133 | tmp->y = y + tmp->arch->clone.y; |
1131 | } |
1134 | } |
1132 | |
1135 | |
… | |
… | |
1163 | { |
1166 | { |
1164 | LOG (llevError, "Trying to insert freed object!\n"); |
1167 | LOG (llevError, "Trying to insert freed object!\n"); |
1165 | return NULL; |
1168 | return NULL; |
1166 | } |
1169 | } |
1167 | |
1170 | |
1168 | if (m == NULL) |
1171 | if (!m) |
1169 | { |
1172 | { |
1170 | char *dump = dump_object (op); |
1173 | char *dump = dump_object (op); |
1171 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1174 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1172 | free (dump); |
1175 | free (dump); |
1173 | return op; |
1176 | return op; |
… | |
… | |
1237 | y = op->y; |
1240 | y = op->y; |
1238 | |
1241 | |
1239 | /* this has to be done after we translate the coordinates. |
1242 | /* this has to be done after we translate the coordinates. |
1240 | */ |
1243 | */ |
1241 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1244 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1242 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1245 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1243 | if (object::can_merge (op, tmp)) |
1246 | if (object::can_merge (op, tmp)) |
1244 | { |
1247 | { |
1245 | op->nrof += tmp->nrof; |
1248 | op->nrof += tmp->nrof; |
1246 | tmp->destroy (); |
1249 | tmp->destroy (); |
1247 | } |
1250 | } |
… | |
… | |
1274 | else |
1277 | else |
1275 | { |
1278 | { |
1276 | /* If there are other objects, then */ |
1279 | /* If there are other objects, then */ |
1277 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1280 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1278 | { |
1281 | { |
1279 | object *last = NULL; |
1282 | object *last = 0; |
1280 | |
1283 | |
1281 | /* |
1284 | /* |
1282 | * If there are multiple objects on this space, we do some trickier handling. |
1285 | * If there are multiple objects on this space, we do some trickier handling. |
1283 | * We've already dealt with merging if appropriate. |
1286 | * We've already dealt with merging if appropriate. |
1284 | * Generally, we want to put the new object on top. But if |
1287 | * Generally, we want to put the new object on top. But if |
… | |
… | |
1288 | * once we get to them. This reduces the need to traverse over all of |
1291 | * once we get to them. This reduces the need to traverse over all of |
1289 | * them when adding another one - this saves quite a bit of cpu time |
1292 | * them when adding another one - this saves quite a bit of cpu time |
1290 | * when lots of spells are cast in one area. Currently, it is presumed |
1293 | * when lots of spells are cast in one area. Currently, it is presumed |
1291 | * that flying non pickable objects are spell objects. |
1294 | * that flying non pickable objects are spell objects. |
1292 | */ |
1295 | */ |
1293 | |
|
|
1294 | while (top != NULL) |
1296 | while (top) |
1295 | { |
1297 | { |
1296 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1298 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1297 | floor = top; |
1299 | floor = top; |
1298 | |
1300 | |
1299 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1301 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1352 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1354 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1353 | |
1355 | |
1354 | if (op->above) |
1356 | if (op->above) |
1355 | op->above->below = op; |
1357 | op->above->below = op; |
1356 | |
1358 | |
1357 | op->below = NULL; |
1359 | op->below = 0; |
1358 | op->ms ().bot = op; |
1360 | op->ms ().bot = op; |
1359 | } |
1361 | } |
1360 | else |
1362 | else |
1361 | { /* get inserted into the stack above top */ |
1363 | { /* get inserted into the stack above top */ |
1362 | op->above = top->above; |
1364 | op->above = top->above; |
… | |
… | |
1366 | |
1368 | |
1367 | op->below = top; |
1369 | op->below = top; |
1368 | top->above = op; |
1370 | top->above = op; |
1369 | } |
1371 | } |
1370 | |
1372 | |
1371 | if (op->above == NULL) |
1373 | if (!op->above) |
1372 | op->ms ().top = op; |
1374 | op->ms ().top = op; |
1373 | } /* else not INS_BELOW_ORIGINATOR */ |
1375 | } /* else not INS_BELOW_ORIGINATOR */ |
1374 | |
1376 | |
1375 | if (op->type == PLAYER) |
1377 | if (op->type == PLAYER) |
|
|
1378 | { |
1376 | op->contr->do_los = 1; |
1379 | op->contr->do_los = 1; |
|
|
1380 | ++op->map->players; |
|
|
1381 | op->map->last_access = runtime; |
|
|
1382 | } |
|
|
1383 | |
|
|
1384 | op->map->dirty = true; |
1377 | |
1385 | |
1378 | /* If we have a floor, we know the player, if any, will be above |
1386 | /* If we have a floor, we know the player, if any, will be above |
1379 | * it, so save a few ticks and start from there. |
1387 | * it, so save a few ticks and start from there. |
1380 | */ |
1388 | */ |
1381 | if (!(flag & INS_MAP_LOAD)) |
1389 | if (!(flag & INS_MAP_LOAD)) |
… | |
… | |
1446 | tmp1->x = op->x; |
1454 | tmp1->x = op->x; |
1447 | tmp1->y = op->y; |
1455 | tmp1->y = op->y; |
1448 | insert_ob_in_map (tmp1, op->map, op, 0); |
1456 | insert_ob_in_map (tmp1, op->map, op, 0); |
1449 | } |
1457 | } |
1450 | |
1458 | |
|
|
1459 | object * |
|
|
1460 | object::insert_at (object *where, object *originator, int flags) |
|
|
1461 | { |
|
|
1462 | where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1463 | } |
|
|
1464 | |
1451 | /* |
1465 | /* |
1452 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1466 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1453 | * is returned contains nr objects, and the remaining parts contains |
1467 | * is returned contains nr objects, and the remaining parts contains |
1454 | * the rest (or is removed and freed if that number is 0). |
1468 | * the rest (or is removed and freed if that number is 0). |
1455 | * On failure, NULL is returned, and the reason put into the |
1469 | * On failure, NULL is returned, and the reason put into the |
1456 | * global static errmsg array. |
1470 | * global static errmsg array. |
1457 | */ |
1471 | */ |
1458 | |
|
|
1459 | object * |
1472 | object * |
1460 | get_split_ob (object *orig_ob, uint32 nr) |
1473 | get_split_ob (object *orig_ob, uint32 nr) |
1461 | { |
1474 | { |
1462 | object *newob; |
1475 | object *newob; |
1463 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1476 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
… | |
… | |
1727 | * |
1740 | * |
1728 | * MSW 2001-07-08: Check all objects on space, not just those below |
1741 | * MSW 2001-07-08: Check all objects on space, not just those below |
1729 | * object being inserted. insert_ob_in_map may not put new objects |
1742 | * object being inserted. insert_ob_in_map may not put new objects |
1730 | * on top. |
1743 | * on top. |
1731 | */ |
1744 | */ |
1732 | |
|
|
1733 | int |
1745 | int |
1734 | check_move_on (object *op, object *originator) |
1746 | check_move_on (object *op, object *originator) |
1735 | { |
1747 | { |
1736 | object *tmp; |
1748 | object *tmp; |
1737 | maptile *m = op->map; |
1749 | maptile *m = op->map; |
… | |
… | |
2594 | } |
2606 | } |
2595 | else |
2607 | else |
2596 | item = item->env; |
2608 | item = item->env; |
2597 | } |
2609 | } |
2598 | |
2610 | |
|
|
2611 | |
|
|
2612 | const char * |
|
|
2613 | object::flag_desc (char *desc, int len) const |
|
|
2614 | { |
|
|
2615 | char *p = desc; |
|
|
2616 | bool first = true; |
|
|
2617 | |
|
|
2618 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2619 | { |
|
|
2620 | if (len <= 10) // magic constant! |
|
|
2621 | { |
|
|
2622 | snprintf (p, len, ",..."); |
|
|
2623 | break; |
|
|
2624 | } |
|
|
2625 | |
|
|
2626 | if (flag[i]) |
|
|
2627 | { |
|
|
2628 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2629 | len -= cnt; |
|
|
2630 | p += cnt; |
|
|
2631 | first = false; |
|
|
2632 | } |
|
|
2633 | } |
|
|
2634 | |
|
|
2635 | return desc; |
|
|
2636 | } |
|
|
2637 | |
2599 | // return a suitable string describing an objetc in enough detail to find it |
2638 | // return a suitable string describing an objetc in enough detail to find it |
2600 | const char * |
2639 | const char * |
2601 | object::debug_desc (char *info) const |
2640 | object::debug_desc (char *info) const |
2602 | { |
2641 | { |
|
|
2642 | char flagdesc[512]; |
2603 | char info2[256 * 3]; |
2643 | char info2[256 * 4]; |
2604 | char *p = info; |
2644 | char *p = info; |
2605 | |
2645 | |
2606 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2646 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2607 | count, |
2647 | count, uuid.seq, |
2608 | &name, |
2648 | &name, |
2609 | title ? " " : "", |
2649 | title ? "\",title:" : "", |
2610 | title ? (const char *)title : ""); |
2650 | title ? (const char *)title : "", |
|
|
2651 | flag_desc (flagdesc, 512), type); |
2611 | |
2652 | |
2612 | if (env) |
2653 | if (env) |
2613 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2654 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2614 | |
2655 | |
2615 | if (map) |
2656 | if (map) |
2616 | p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); |
2657 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2617 | |
2658 | |
2618 | return info; |
2659 | return info; |
2619 | } |
2660 | } |
2620 | |
2661 | |
2621 | const char * |
2662 | const char * |