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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.91 by elmex, Tue Dec 26 10:51:52 2006 UTC vs.
Revision 1.105 by pippijn, Wed Jan 3 00:21:35 2007 UTC

… …
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
196bool object::can_merge_slow (object *ob1, object *ob2) 195bool 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
544void 542void
545update_turn_face (object *op) 543update_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 */
558void 557void
559object::set_speed (float speed) 558object::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 */
626void
627remove_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
… …
699 return; 624 return;
700 } 625 }
701 626
702 mapspace &m = op->ms (); 627 mapspace &m = op->ms ();
703 628
704 if (m.flags_ & P_NEED_UPDATE) 629 if (!(m.flags_ & P_UPTODATE))
705 /* nop */; 630 /* nop */;
706 else if (action == UP_OBJ_INSERT) 631 else if (action == UP_OBJ_INSERT)
707 { 632 {
708 // this is likely overkill, TODO: revisit (schmorp) 633 // this is likely overkill, TODO: revisit (schmorp)
709 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 634 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 643 /* This isn't perfect, but I don't expect a lot of objects to
719 * to have move_allow right now. 644 * to have move_allow right now.
720 */ 645 */
721 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 646 || ((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) 647 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
723 m.flags_ = P_NEED_UPDATE; 648 m.flags_ = 0;
724 } 649 }
725 /* if the object is being removed, we can't make intelligent 650 /* if the object is being removed, we can't make intelligent
726 * decisions, because remove_ob can't really pass the object 651 * decisions, because remove_ob can't really pass the object
727 * that is being removed. 652 * that is being removed.
728 */ 653 */
729 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 654 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
730 m.flags_ = P_NEED_UPDATE; 655 m.flags_ = 0;
731 else if (action == UP_OBJ_FACE) 656 else if (action == UP_OBJ_FACE)
732 /* Nothing to do for that case */ ; 657 /* Nothing to do for that case */ ;
733 else 658 else
734 LOG (llevError, "update_object called with invalid action: %d\n", action); 659 LOG (llevError, "update_object called with invalid action: %d\n", action);
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
740object::vector object::objects; // not yet used
741object *object::first; 665object *object::first;
742 666
743object::object () 667object::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
707bool
708object::active () const
709{
710 return active_next || active_prev || this == active_objects;
711}
712
713void
714object::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
733void
734object::activate_recursive ()
735{
736 activate ();
737
738 for (object *op = inv; op; op = op->below)
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 */
750void
751object::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
774void
775object::deactivate_recursive ()
776{
777 for (object *op = inv; op; op = op->below)
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 */
787void 787void
788object::destroy_inv (bool drop_to_ground) 788object::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 || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) 802 if (!drop_to_ground
803 || !map
804 || map->in_memory != MAP_IN_MEMORY
805 || ms ().move_block == MOVE_ALL)
795 { 806 {
796 while (inv) 807 while (inv)
808 {
809 inv->destroy_inv (drop_to_ground);
797 inv->destroy (); 810 inv->destroy ();
811 }
798 } 812 }
799 else 813 else
800 { /* Put objects in inventory onto this space */ 814 { /* Put objects in inventory onto this space */
801 while (inv) 815 while (inv)
802 { 816 {
… …
807 || op->type == RUNE 821 || op->type == RUNE
808 || op->type == TRAP 822 || op->type == TRAP
809 || op->flag [FLAG_IS_A_TEMPLATE]) 823 || op->flag [FLAG_IS_A_TEMPLATE])
810 op->destroy (); 824 op->destroy ();
811 else 825 else
812 { 826 map->insert (op, x, y);
813 op->remove ();
814 op->x = x;
815 op->y = y;
816 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
817 }
818 } 827 }
819 } 828 }
820} 829}
821 830
822object *object::create () 831object *object::create ()
… …
839 remove (); 848 remove ();
840 849
841 if (flag [FLAG_FREED]) 850 if (flag [FLAG_FREED])
842 return; 851 return;
843 852
853 set_speed (0);
854
844 flag [FLAG_FREED] = 1; 855 flag [FLAG_FREED] = 1;
845 856
846 attachable::do_destroy (); 857 attachable::do_destroy ();
847 858
848 destroy_inv (true); 859 destroy_inv (true);
849 set_speed (0);
850 unlink (); 860 unlink ();
851 861
852 // hack to ensure that freed objects still have a valid map 862 // hack to ensure that freed objects still have a valid map
853 { 863 {
854 static maptile *freed_map; // freed objects are moved here to avoid crashes 864 static maptile *freed_map; // freed objects are moved here to avoid crashes
… …
859 869
860 freed_map->name = "/internal/freed_objects_map"; 870 freed_map->name = "/internal/freed_objects_map";
861 freed_map->width = 3; 871 freed_map->width = 3;
862 freed_map->height = 3; 872 freed_map->height = 3;
863 873
864 freed_map->allocate (); 874 freed_map->alloc ();
875 freed_map->in_memory = MAP_IN_MEMORY;
865 } 876 }
866 877
867 map = freed_map; 878 map = freed_map;
868 x = 1; 879 x = 1;
869 y = 1; 880 y = 1;
… …
954 * to save cpu time. 965 * to save cpu time.
955 */ 966 */
956 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 967 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
957 otmp->update_stats (); 968 otmp->update_stats ();
958 969
959 if (above != NULL) 970 if (above)
960 above->below = below; 971 above->below = below;
961 else 972 else
962 env->inv = below; 973 env->inv = below;
963 974
964 if (below != NULL) 975 if (below)
965 below->above = above; 976 below->above = above;
966 977
967 /* we set up values so that it could be inserted into 978 /* we set up values so that it could be inserted into
968 * the map, but we don't actually do that - it is up 979 * the map, but we don't actually do that - it is up
969 * to the caller to decide what we want to do. 980 * to the caller to decide what we want to do.
… …
973 above = 0, below = 0; 984 above = 0, below = 0;
974 env = 0; 985 env = 0;
975 } 986 }
976 else if (map) 987 else if (map)
977 { 988 {
978 /* Re did the following section of code - it looks like it had 989 if (type == PLAYER)
979 * lots of logic for things we no longer care about
980 */ 990 {
991 --map->players;
992 map->touch ();
993 }
994
995 map->dirty = true;
981 996
982 /* link the object above us */ 997 /* link the object above us */
983 if (above) 998 if (above)
984 above->below = below; 999 above->below = below;
985 else 1000 else
… …
1036 1051
1037 if (tmp->contr->ns) 1052 if (tmp->contr->ns)
1038 tmp->contr->ns->floorbox_update (); 1053 tmp->contr->ns->floorbox_update ();
1039 } 1054 }
1040 1055
1041 /* See if player moving off should effect something */ 1056 /* See if object moving off should effect something */
1042 if (check_walk_off 1057 if (check_walk_off
1043 && ((move_type & tmp->move_off) 1058 && ((move_type & tmp->move_off)
1044 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1059 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1045 { 1060 {
1046 move_apply (tmp, this, 0); 1061 move_apply (tmp, this, 0);
… …
1048 if (destroyed ()) 1063 if (destroyed ())
1049 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1064 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1050 } 1065 }
1051 1066
1052 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1067 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1053 1068 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1054 if (tmp->above == tmp) 1069 if (tmp->above == tmp)
1055 tmp->above = 0; 1070 tmp->above = 0;
1056 1071
1057 last = tmp; 1072 last = tmp;
1058 } 1073 }
1059 1074
1060 /* last == NULL of there are no objects on this space */ 1075 /* last == NULL if there are no objects on this space */
1076 //TODO: this makes little sense, why only update the topmost object?
1061 if (!last) 1077 if (!last)
1062 map->at (x, y).flags_ = P_NEED_UPDATE; 1078 map->at (x, y).flags_ = 0;
1063 else 1079 else
1064 update_object (last, UP_OBJ_REMOVE); 1080 update_object (last, UP_OBJ_REMOVE);
1065 1081
1066 if (flag [FLAG_BLOCKSVIEW] || glow_radius) 1082 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1067 update_all_los (map, x, y); 1083 update_all_los (map, x, y);
… …
1110 * job preparing multi-part monsters 1126 * job preparing multi-part monsters
1111 */ 1127 */
1112object * 1128object *
1113insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1129insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1114{ 1130{
1115 object *tmp;
1116
1117 if (op->head)
1118 op = op->head;
1119
1120 for (tmp = op; tmp; tmp = tmp->more) 1131 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1121 { 1132 {
1122 tmp->x = x + tmp->arch->clone.x; 1133 tmp->x = x + tmp->arch->clone.x;
1123 tmp->y = y + tmp->arch->clone.y; 1134 tmp->y = y + tmp->arch->clone.y;
1124 } 1135 }
1125 1136
… …
1156 { 1167 {
1157 LOG (llevError, "Trying to insert freed object!\n"); 1168 LOG (llevError, "Trying to insert freed object!\n");
1158 return NULL; 1169 return NULL;
1159 } 1170 }
1160 1171
1161 if (m == NULL) 1172 if (!m)
1162 { 1173 {
1163 char *dump = dump_object (op); 1174 char *dump = dump_object (op);
1164 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1175 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1165 free (dump); 1176 free (dump);
1166 return op; 1177 return op;
… …
1193 { 1204 {
1194 /* The part may be on a different map. */ 1205 /* The part may be on a different map. */
1195 1206
1196 object *more = op->more; 1207 object *more = op->more;
1197 1208
1198 /* We really need the caller to normalize coordinates - if 1209 /* We really need the caller to normalise coordinates - if
1199 * we set the map, that doesn't work if the location is within 1210 * we set the map, that doesn't work if the location is within
1200 * a map and this is straddling an edge. So only if coordinate 1211 * a map and this is straddling an edge. So only if coordinate
1201 * is clear wrong do we normalize it. 1212 * is clear wrong do we normalise it.
1202 */ 1213 */
1203 if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) 1214 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1204 more->map = get_map_from_coord (m, &more->x, &more->y); 1215 more->map = get_map_from_coord (m, &more->x, &more->y);
1205 else if (!more->map) 1216 else if (!more->map)
1206 { 1217 {
… …
1230 y = op->y; 1241 y = op->y;
1231 1242
1232 /* this has to be done after we translate the coordinates. 1243 /* this has to be done after we translate the coordinates.
1233 */ 1244 */
1234 if (op->nrof && !(flag & INS_NO_MERGE)) 1245 if (op->nrof && !(flag & INS_NO_MERGE))
1235 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1246 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above)
1236 if (object::can_merge (op, tmp)) 1247 if (object::can_merge (op, tmp))
1237 { 1248 {
1238 op->nrof += tmp->nrof; 1249 op->nrof += tmp->nrof;
1239 tmp->destroy (); 1250 tmp->destroy ();
1240 } 1251 }
… …
1267 else 1278 else
1268 { 1279 {
1269 /* If there are other objects, then */ 1280 /* If there are other objects, then */
1270 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1281 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1271 { 1282 {
1272 object *last = NULL; 1283 object *last = 0;
1273 1284
1274 /* 1285 /*
1275 * If there are multiple objects on this space, we do some trickier handling. 1286 * If there are multiple objects on this space, we do some trickier handling.
1276 * We've already dealt with merging if appropriate. 1287 * We've already dealt with merging if appropriate.
1277 * Generally, we want to put the new object on top. But if 1288 * Generally, we want to put the new object on top. But if
… …
1281 * once we get to them. This reduces the need to traverse over all of 1292 * once we get to them. This reduces the need to traverse over all of
1282 * them when adding another one - this saves quite a bit of cpu time 1293 * them when adding another one - this saves quite a bit of cpu time
1283 * when lots of spells are cast in one area. Currently, it is presumed 1294 * when lots of spells are cast in one area. Currently, it is presumed
1284 * that flying non pickable objects are spell objects. 1295 * that flying non pickable objects are spell objects.
1285 */ 1296 */
1286
1287 while (top != NULL) 1297 while (top)
1288 { 1298 {
1289 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1299 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1290 floor = top; 1300 floor = top;
1291 1301
1292 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1302 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1345 op->above = GET_MAP_OB (op->map, op->x, op->y); 1355 op->above = GET_MAP_OB (op->map, op->x, op->y);
1346 1356
1347 if (op->above) 1357 if (op->above)
1348 op->above->below = op; 1358 op->above->below = op;
1349 1359
1350 op->below = NULL; 1360 op->below = 0;
1351 op->ms ().bot = op; 1361 op->ms ().bot = op;
1352 } 1362 }
1353 else 1363 else
1354 { /* get inserted into the stack above top */ 1364 { /* get inserted into the stack above top */
1355 op->above = top->above; 1365 op->above = top->above;
… …
1359 1369
1360 op->below = top; 1370 op->below = top;
1361 top->above = op; 1371 top->above = op;
1362 } 1372 }
1363 1373
1364 if (op->above == NULL) 1374 if (!op->above)
1365 op->ms ().top = op; 1375 op->ms ().top = op;
1366 } /* else not INS_BELOW_ORIGINATOR */ 1376 } /* else not INS_BELOW_ORIGINATOR */
1367 1377
1368 if (op->type == PLAYER) 1378 if (op->type == PLAYER)
1379 {
1369 op->contr->do_los = 1; 1380 op->contr->do_los = 1;
1381 ++op->map->players;
1382 op->map->touch ();
1383 }
1384
1385 op->map->dirty = true;
1370 1386
1371 /* If we have a floor, we know the player, if any, will be above 1387 /* If we have a floor, we know the player, if any, will be above
1372 * it, so save a few ticks and start from there. 1388 * it, so save a few ticks and start from there.
1373 */ 1389 */
1374 if (!(flag & INS_MAP_LOAD)) 1390 if (!(flag & INS_MAP_LOAD))
… …
1380 * visible to others on this map. But update_all_los is really 1396 * visible to others on this map. But update_all_los is really
1381 * an inefficient way to do this, as it means los for all players 1397 * an inefficient way to do this, as it means los for all players
1382 * on the map will get recalculated. The players could very well 1398 * on the map will get recalculated. The players could very well
1383 * be far away from this change and not affected in any way - 1399 * be far away from this change and not affected in any way -
1384 * this should get redone to only look for players within range, 1400 * this should get redone to only look for players within range,
1385 * or just updating the P_NEED_UPDATE for spaces within this area 1401 * or just updating the P_UPTODATE for spaces within this area
1386 * of effect may be sufficient. 1402 * of effect may be sufficient.
1387 */ 1403 */
1388 if (op->map->darkness && (op->glow_radius != 0)) 1404 if (op->map->darkness && (op->glow_radius != 0))
1389 update_all_los (op->map, op->x, op->y); 1405 update_all_los (op->map, op->x, op->y);
1390 1406
… …
1428{ 1444{
1429 object *tmp, *tmp1; 1445 object *tmp, *tmp1;
1430 1446
1431 /* first search for itself and remove any old instances */ 1447 /* first search for itself and remove any old instances */
1432 1448
1433 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1449 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1434 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1450 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1435 tmp->destroy (); 1451 tmp->destroy ();
1436 1452
1437 tmp1 = arch_to_object (archetype::find (arch_string)); 1453 tmp1 = arch_to_object (archetype::find (arch_string));
1438 1454
1439 tmp1->x = op->x; 1455 tmp1->x = op->x;
1440 tmp1->y = op->y; 1456 tmp1->y = op->y;
1441 insert_ob_in_map (tmp1, op->map, op, 0); 1457 insert_ob_in_map (tmp1, op->map, op, 0);
1458}
1459
1460object *
1461object::insert_at (object *where, object *originator, int flags)
1462{
1463 where->map->insert (this, where->x, where->y, originator, flags);
1442} 1464}
1443 1465
1444/* 1466/*
1445 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1467 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1446 * is returned contains nr objects, and the remaining parts contains 1468 * is returned contains nr objects, and the remaining parts contains
1447 * the rest (or is removed and freed if that number is 0). 1469 * the rest (or is removed and freed if that number is 0).
1448 * On failure, NULL is returned, and the reason put into the 1470 * On failure, NULL is returned, and the reason put into the
1449 * global static errmsg array. 1471 * global static errmsg array.
1450 */ 1472 */
1451
1452object * 1473object *
1453get_split_ob (object *orig_ob, uint32 nr) 1474get_split_ob (object *orig_ob, uint32 nr)
1454{ 1475{
1455 object *newob; 1476 object *newob;
1456 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1477 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
… …
1720 * 1741 *
1721 * MSW 2001-07-08: Check all objects on space, not just those below 1742 * MSW 2001-07-08: Check all objects on space, not just those below
1722 * object being inserted. insert_ob_in_map may not put new objects 1743 * object being inserted. insert_ob_in_map may not put new objects
1723 * on top. 1744 * on top.
1724 */ 1745 */
1725
1726int 1746int
1727check_move_on (object *op, object *originator) 1747check_move_on (object *op, object *originator)
1728{ 1748{
1729 object *tmp; 1749 object *tmp;
1730 maptile *m = op->map; 1750 maptile *m = op->map;
… …
1757 1777
1758 /* The objects have to be checked from top to bottom. 1778 /* The objects have to be checked from top to bottom.
1759 * Hence, we first go to the top: 1779 * Hence, we first go to the top:
1760 */ 1780 */
1761 1781
1762 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) 1782 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1763 { 1783 {
1764 /* Trim the search when we find the first other spell effect 1784 /* Trim the search when we find the first other spell effect
1765 * this helps performance so that if a space has 50 spell objects, 1785 * this helps performance so that if a space has 50 spell objects,
1766 * we don't need to check all of them. 1786 * we don't need to check all of them.
1767 */ 1787 */
… …
1825 * The first matching object is returned, or NULL if none. 1845 * The first matching object is returned, or NULL if none.
1826 */ 1846 */
1827object * 1847object *
1828present_arch (const archetype *at, maptile *m, int x, int y) 1848present_arch (const archetype *at, maptile *m, int x, int y)
1829{ 1849{
1830 if (m == NULL || out_of_map (m, x, y)) 1850 if (!m || out_of_map (m, x, y))
1831 { 1851 {
1832 LOG (llevError, "Present_arch called outside map.\n"); 1852 LOG (llevError, "Present_arch called outside map.\n");
1833 return NULL; 1853 return NULL;
1834 } 1854 }
1835 1855
1836 for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1856 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1837 if (tmp->arch == at) 1857 if (tmp->arch == at)
1838 return tmp; 1858 return tmp;
1839 1859
1840 return NULL; 1860 return NULL;
1841} 1861}
… …
1852 { 1872 {
1853 LOG (llevError, "Present called outside map.\n"); 1873 LOG (llevError, "Present called outside map.\n");
1854 return NULL; 1874 return NULL;
1855 } 1875 }
1856 1876
1857 for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1877 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1858 if (tmp->type == type) 1878 if (tmp->type == type)
1859 return tmp; 1879 return tmp;
1860 1880
1861 return NULL; 1881 return NULL;
1862} 1882}
… …
2587 } 2607 }
2588 else 2608 else
2589 item = item->env; 2609 item = item->env;
2590} 2610}
2591 2611
2612
2613const char *
2614object::flag_desc (char *desc, int len) const
2615{
2616 char *p = desc;
2617 bool first = true;
2618
2619 *p = 0;
2620
2621 for (int i = 0; i < NUM_FLAGS; i++)
2622 {
2623 if (len <= 10) // magic constant!
2624 {
2625 snprintf (p, len, ",...");
2626 break;
2627 }
2628
2629 if (flag [i])
2630 {
2631 int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2632 len -= cnt;
2633 p += cnt;
2634 first = false;
2635 }
2636 }
2637
2638 return desc;
2639}
2640
2592// return a suitable string describing an objetc in enough detail to find it 2641// return a suitable string describing an object in enough detail to find it
2593const char * 2642const char *
2594object::debug_desc (char *info) const 2643object::debug_desc (char *info) const
2595{ 2644{
2645 char flagdesc[512];
2596 char info2[256 * 3]; 2646 char info2[256 * 4];
2597 char *p = info; 2647 char *p = info;
2598 2648
2599 p += snprintf (p, 256, "%d=\"%s%s%s\"", 2649 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}",
2600 count, 2650 count, uuid.seq,
2601 &name, 2651 &name,
2602 title ? " " : "", 2652 title ? "\",title:" : "",
2603 title ? (const char *)title : ""); 2653 title ? (const char *)title : "",
2654 flag_desc (flagdesc, 512), type);
2604 2655
2605 if (env) 2656 if (env)
2606 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2657 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2607 2658
2608 if (map) 2659 if (map)
2609 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); 2660 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2610 2661
2611 return info; 2662 return info;
2612} 2663}
2613 2664
2614const char * 2665const char *
2615object::debug_desc () const 2666object::debug_desc () const
2616{ 2667{
2617 static char info[256 * 3]; 2668 static char info[256 * 4];
2618 return debug_desc (info); 2669 return debug_desc (info);
2619} 2670}
2620 2671

Diff Legend

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