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.102 by root, Mon Jan 1 17:34:11 2007 UTC vs.
Revision 1.118 by root, Thu Jan 18 19:42:09 2007 UTC

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
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 21 *
21 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 23 */
23 24
24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
25 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
26 variable. */ 27 variable. */
27#include <global.h> 28#include <global.h>
… …
36 37
37int nrofallocobjects = 0; 38int nrofallocobjects = 0;
38static UUID uuid; 39static UUID uuid;
39const uint64 UUID_SKIP = 1<<19; 40const uint64 UUID_SKIP = 1<<19;
40 41
41object *active_objects; /* List of active objects that need to be processed */ 42objectvec objects;
43activevec actives;
42 44
43short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 45short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
44 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 46 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
45}; 47};
46short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 48short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
… …
390} 392}
391 393
392/* 394/*
393 * Returns the object which has the count-variable equal to the argument. 395 * Returns the object which has the count-variable equal to the argument.
394 */ 396 */
395
396object * 397object *
397find_object (tag_t i) 398find_object (tag_t i)
398{ 399{
399 for (object *op = object::first; op; op = op->next) 400 for_all_objects (op)
400 if (op->count == i) 401 if (op->count == i)
401 return op; 402 return op;
402 403
403 return 0; 404 return 0;
404} 405}
405 406
406/* 407/*
407 * Returns the first object which has a name equal to the argument. 408 * Returns the first object which has a name equal to the argument.
408 * Used only by the patch command, but not all that useful. 409 * Used only by the patch command, but not all that useful.
409 * Enables features like "patch <name-of-other-player> food 999" 410 * Enables features like "patch <name-of-other-player> food 999"
410 */ 411 */
411
412object * 412object *
413find_object_name (const char *str) 413find_object_name (const char *str)
414{ 414{
415 shstr_cmp str_ (str); 415 shstr_cmp str_ (str);
416 object *op; 416 object *op;
417 417
418 for (op = object::first; op != NULL; op = op->next) 418 for_all_objects (op)
419 if (op->name == str_) 419 if (op->name == str_)
420 break; 420 break;
421 421
422 return op; 422 return op;
423} 423}
… …
489 489
490 if (is_removed) 490 if (is_removed)
491 SET_FLAG (dst, FLAG_REMOVED); 491 SET_FLAG (dst, FLAG_REMOVED);
492 492
493 if (speed < 0) 493 if (speed < 0)
494 dst->speed_left = speed_left - RANDOM () % 200 / 100.0; 494 dst->speed_left = speed_left - rndm ();
495 495
496 /* Copy over key_values, if any. */ 496 /* Copy over key_values, if any. */
497 if (key_values) 497 if (key_values)
498 { 498 {
499 key_value *tail = 0; 499 key_value *tail = 0;
… …
660 660
661 if (op->more) 661 if (op->more)
662 update_object (op->more, action); 662 update_object (op->more, action);
663} 663}
664 664
665object *object::first;
666
667object::object () 665object::object ()
668{ 666{
669 SET_FLAG (this, FLAG_REMOVED); 667 SET_FLAG (this, FLAG_REMOVED);
670 668
671 expmul = 1.0; 669 expmul = 1.0;
… …
675object::~object () 673object::~object ()
676{ 674{
677 free_key_values (this); 675 free_key_values (this);
678} 676}
679 677
678static int object_count;
679
680void object::link () 680void object::link ()
681{ 681{
682 count = ++ob_count; 682 assert (!index);//D
683 uuid = gen_uuid (); 683 uuid = gen_uuid ();
684 count = ++object_count;
684 685
685 prev = 0; 686 refcnt_inc ();
686 next = object::first; 687 objects.insert (this);
687
688 if (object::first)
689 object::first->prev = this;
690
691 object::first = this;
692} 688}
693 689
694void object::unlink () 690void object::unlink ()
695{ 691{
696 if (this == object::first) 692 assert (index);//D
697 object::first = next; 693 objects.erase (this);
698 694 refcnt_dec ();
699 /* Remove this object from the list of used objects */
700 if (prev) prev->next = next;
701 if (next) next->prev = prev;
702
703 prev = 0;
704 next = 0;
705}
706
707bool
708object::active () const
709{
710 return active_next || active_prev || this == active_objects;
711} 695}
712 696
713void 697void
714object::activate () 698object::activate ()
715{ 699{
716 /* If already on active list, don't do anything */ 700 /* If already on active list, don't do anything */
717 if (active ()) 701 if (active)
718 return; 702 return;
719 703
720 if (has_active_speed ()) 704 if (has_active_speed ())
721 { 705 actives.insert (this);
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} 706}
732 707
733void 708void
734object::activate_recursive () 709object::activate_recursive ()
735{ 710{
736 activate (); 711 activate ();
737 712
738 for (object *op = inv; op; op = op->above) 713 for (object *op = inv; op; op = op->below)
739 op->activate_recursive (); 714 op->activate_recursive ();
740} 715}
741 716
742/* This function removes object 'op' from the list of active 717/* This function removes object 'op' from the list of active
743 * objects. 718 * objects.
… …
749 */ 724 */
750void 725void
751object::deactivate () 726object::deactivate ()
752{ 727{
753 /* If not on the active list, nothing needs to be done */ 728 /* If not on the active list, nothing needs to be done */
754 if (!active ()) 729 if (!active)
755 return; 730 return;
756 731
757 if (active_prev == 0) 732 actives.erase (this);
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} 733}
773 734
774void 735void
775object::deactivate_recursive () 736object::deactivate_recursive ()
776{ 737{
777 for (object *op = inv; op; op = op->above) 738 for (object *op = inv; op; op = op->below)
778 op->deactivate_recursive (); 739 op->deactivate_recursive ();
779 740
780 deactivate (); 741 deactivate ();
742}
743
744void
745object::set_flag_inv (int flag, int value)
746{
747 for (object *op = inv; op; op = op->below)
748 {
749 op->flag [flag] = value;
750 op->set_flag_inv (flag, value);
751 }
781} 752}
782 753
783/* 754/*
784 * Remove and free all objects in the inventory of the given object. 755 * Remove and free all objects in the inventory of the given object.
785 * object.c ? 756 * object.c ?
… …
818 789
819 if (op->flag [FLAG_STARTEQUIP] 790 if (op->flag [FLAG_STARTEQUIP]
820 || op->flag [FLAG_NO_DROP] 791 || op->flag [FLAG_NO_DROP]
821 || op->type == RUNE 792 || op->type == RUNE
822 || op->type == TRAP 793 || op->type == TRAP
823 || op->flag [FLAG_IS_A_TEMPLATE]) 794 || op->flag [FLAG_IS_A_TEMPLATE]
795 || op->flag [FLAG_DESTROY_ON_DEATH])
824 op->destroy (); 796 op->destroy ();
825 else 797 else
826 map->insert (op, x, y); 798 map->insert (op, x, y);
827 } 799 }
828 } 800 }
… …
836} 808}
837 809
838void 810void
839object::do_destroy () 811object::do_destroy ()
840{ 812{
813 attachable::do_destroy ();
814
841 if (flag [FLAG_IS_LINKED]) 815 if (flag [FLAG_IS_LINKED])
842 remove_button_link (this); 816 remove_button_link (this);
843 817
844 if (flag [FLAG_FRIENDLY]) 818 if (flag [FLAG_FRIENDLY])
845 remove_friendly_object (this); 819 remove_friendly_object (this);
846 820
847 if (!flag [FLAG_REMOVED]) 821 if (!flag [FLAG_REMOVED])
848 remove (); 822 remove ();
849 823
850 if (flag [FLAG_FREED]) 824 destroy_inv (true);
851 return;
852 825
853 set_speed (0); 826 deactivate ();
827 unlink ();
854 828
855 flag [FLAG_FREED] = 1; 829 flag [FLAG_FREED] = 1;
856
857 attachable::do_destroy ();
858
859 destroy_inv (true);
860 unlink ();
861 830
862 // hack to ensure that freed objects still have a valid map 831 // hack to ensure that freed objects still have a valid map
863 { 832 {
864 static maptile *freed_map; // freed objects are moved here to avoid crashes 833 static maptile *freed_map; // freed objects are moved here to avoid crashes
865 834
… …
870 freed_map->name = "/internal/freed_objects_map"; 839 freed_map->name = "/internal/freed_objects_map";
871 freed_map->width = 3; 840 freed_map->width = 3;
872 freed_map->height = 3; 841 freed_map->height = 3;
873 842
874 freed_map->alloc (); 843 freed_map->alloc ();
844 freed_map->in_memory = MAP_IN_MEMORY;
875 } 845 }
876 846
877 map = freed_map; 847 map = freed_map;
878 x = 1; 848 x = 1;
879 y = 1; 849 y = 1;
… …
889 859
890 // clear those pointers that likely might have circular references to us 860 // clear those pointers that likely might have circular references to us
891 owner = 0; 861 owner = 0;
892 enemy = 0; 862 enemy = 0;
893 attacked_by = 0; 863 attacked_by = 0;
894
895 // only relevant for players(?), but make sure of it anyways
896 contr = 0;
897} 864}
898 865
899void 866void
900object::destroy (bool destroy_inventory) 867object::destroy (bool destroy_inventory)
901{ 868{
… …
932 * environment, the x and y coordinates will be updated to 899 * environment, the x and y coordinates will be updated to
933 * the previous environment. 900 * the previous environment.
934 * Beware: This function is called from the editor as well! 901 * Beware: This function is called from the editor as well!
935 */ 902 */
936void 903void
937object::remove () 904object::remove_slow ()
938{ 905{
939 object *tmp, *last = 0; 906 object *tmp, *last = 0;
940 object *otmp; 907 object *otmp;
941 908
942 if (QUERY_FLAG (this, FLAG_REMOVED)) 909 if (QUERY_FLAG (this, FLAG_REMOVED))
… …
990 --map->players; 957 --map->players;
991 map->touch (); 958 map->touch ();
992 } 959 }
993 960
994 map->dirty = true; 961 map->dirty = true;
962 mapspace &ms = this->ms ();
995 963
996 /* link the object above us */ 964 /* link the object above us */
997 if (above) 965 if (above)
998 above->below = below; 966 above->below = below;
999 else 967 else
1000 map->at (x, y).top = below; /* we were top, set new top */ 968 ms.top = below; /* we were top, set new top */
1001 969
1002 /* Relink the object below us, if there is one */ 970 /* Relink the object below us, if there is one */
1003 if (below) 971 if (below)
1004 below->above = above; 972 below->above = above;
1005 else 973 else
… …
1007 /* Nothing below, which means we need to relink map object for this space 975 /* Nothing below, which means we need to relink map object for this space
1008 * use translated coordinates in case some oddness with map tiling is 976 * use translated coordinates in case some oddness with map tiling is
1009 * evident 977 * evident
1010 */ 978 */
1011 if (GET_MAP_OB (map, x, y) != this) 979 if (GET_MAP_OB (map, x, y) != this)
1012 {
1013 char *dump = dump_object (this);
1014 LOG (llevError,
1015 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); 980 LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
1016 free (dump);
1017 dump = dump_object (GET_MAP_OB (map, x, y));
1018 LOG (llevError, "%s\n", dump);
1019 free (dump);
1020 }
1021 981
1022 map->at (x, y).bot = above; /* goes on above it. */ 982 ms.bot = above; /* goes on above it. */
1023 } 983 }
1024 984
1025 above = 0; 985 above = 0;
1026 below = 0; 986 below = 0;
1027 987
1028 if (map->in_memory == MAP_SAVING) 988 if (map->in_memory == MAP_SAVING)
1029 return; 989 return;
1030 990
1031 int check_walk_off = !flag [FLAG_NO_APPLY]; 991 int check_walk_off = !flag [FLAG_NO_APPLY];
1032 992
1033 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) 993 for (tmp = ms.bot; tmp; tmp = tmp->above)
1034 { 994 {
1035 /* No point updating the players look faces if he is the object 995 /* No point updating the players look faces if he is the object
1036 * being removed. 996 * being removed.
1037 */ 997 */
1038 998
… …
1119 1079
1120 return 0; 1080 return 0;
1121} 1081}
1122 1082
1123/* 1083/*
1124 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1084 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1125 * job preparing multi-part monsters 1085 * job preparing multi-part monsters.
1126 */ 1086 */
1127object * 1087object *
1128insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1088insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1129{ 1089{
1130 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1090 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
… …
1158 */ 1118 */
1159object * 1119object *
1160insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1120insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1161{ 1121{
1162 object *tmp, *top, *floor = NULL; 1122 object *tmp, *top, *floor = NULL;
1163 sint16 x, y;
1164 1123
1165 if (QUERY_FLAG (op, FLAG_FREED)) 1124 if (QUERY_FLAG (op, FLAG_FREED))
1166 { 1125 {
1167 LOG (llevError, "Trying to insert freed object!\n"); 1126 LOG (llevError, "Trying to insert freed object!\n");
1168 return NULL; 1127 return NULL;
1169 } 1128 }
1129
1130 if (!QUERY_FLAG (op, FLAG_REMOVED))
1131 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1132
1133 op->remove ();
1170 1134
1171 if (!m) 1135 if (!m)
1172 { 1136 {
1173 char *dump = dump_object (op); 1137 char *dump = dump_object (op);
1174 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1138 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
… …
1189#endif 1153#endif
1190 free (dump); 1154 free (dump);
1191 return op; 1155 return op;
1192 } 1156 }
1193 1157
1194 if (!QUERY_FLAG (op, FLAG_REMOVED))
1195 {
1196 char *dump = dump_object (op);
1197 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1198 free (dump);
1199 return op;
1200 }
1201
1202 if (op->more)
1203 {
1204 /* The part may be on a different map. */
1205
1206 object *more = op->more; 1158 if (object *more = op->more)
1207 1159 {
1208 /* We really need the caller to normalize coordinates - if
1209 * 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
1211 * is clear wrong do we normalize it.
1212 */
1213 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1214 more->map = get_map_from_coord (m, &more->x, &more->y);
1215 else if (!more->map)
1216 {
1217 /* For backwards compatibility - when not dealing with tiled maps,
1218 * more->map should always point to the parent.
1219 */
1220 more->map = m;
1221 }
1222
1223 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1160 if (!insert_ob_in_map (more, m, originator, flag))
1224 { 1161 {
1225 if (!op->head) 1162 if (!op->head)
1226 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1163 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1227 1164
1228 return 0; 1165 return 0;
… …
1233 1170
1234 /* Ideally, the caller figures this out. However, it complicates a lot 1171 /* Ideally, the caller figures this out. However, it complicates a lot
1235 * of areas of callers (eg, anything that uses find_free_spot would now 1172 * of areas of callers (eg, anything that uses find_free_spot would now
1236 * need extra work 1173 * need extra work
1237 */ 1174 */
1238 op->map = get_map_from_coord (m, &op->x, &op->y); 1175 if (!xy_normalise (m, op->x, op->y))
1239 x = op->x; 1176 return 0;
1240 y = op->y; 1177
1178 op->map = m;
1179 mapspace &ms = op->ms ();
1241 1180
1242 /* this has to be done after we translate the coordinates. 1181 /* this has to be done after we translate the coordinates.
1243 */ 1182 */
1244 if (op->nrof && !(flag & INS_NO_MERGE)) 1183 if (op->nrof && !(flag & INS_NO_MERGE))
1245 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) 1184 for (tmp = ms.bot; tmp; tmp = tmp->above)
1246 if (object::can_merge (op, tmp)) 1185 if (object::can_merge (op, tmp))
1247 { 1186 {
1248 op->nrof += tmp->nrof; 1187 op->nrof += tmp->nrof;
1249 tmp->destroy (); 1188 tmp->destroy ();
1250 } 1189 }
… …
1267 op->below = originator->below; 1206 op->below = originator->below;
1268 1207
1269 if (op->below) 1208 if (op->below)
1270 op->below->above = op; 1209 op->below->above = op;
1271 else 1210 else
1272 op->ms ().bot = op; 1211 ms.bot = op;
1273 1212
1274 /* since *below* originator, no need to update top */ 1213 /* since *below* originator, no need to update top */
1275 originator->below = op; 1214 originator->below = op;
1276 } 1215 }
1277 else 1216 else
1278 { 1217 {
1218 top = ms.bot;
1219
1279 /* If there are other objects, then */ 1220 /* If there are other objects, then */
1280 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1221 if ((!(flag & INS_MAP_LOAD)) && top)
1281 { 1222 {
1282 object *last = 0; 1223 object *last = 0;
1283 1224
1284 /* 1225 /*
1285 * If there are multiple objects on this space, we do some trickier handling. 1226 * If there are multiple objects on this space, we do some trickier handling.
… …
1291 * once we get to them. This reduces the need to traverse over all of 1232 * 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 1233 * 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 1234 * when lots of spells are cast in one area. Currently, it is presumed
1294 * that flying non pickable objects are spell objects. 1235 * that flying non pickable objects are spell objects.
1295 */ 1236 */
1296 while (top) 1237 for (top = ms.bot; top; top = top->above)
1297 { 1238 {
1298 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1239 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1299 floor = top; 1240 floor = top;
1300 1241
1301 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1242 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1304 top = top->below; 1245 top = top->below;
1305 break; 1246 break;
1306 } 1247 }
1307 1248
1308 last = top; 1249 last = top;
1309 top = top->above;
1310 } 1250 }
1311 1251
1312 /* Don't want top to be NULL, so set it to the last valid object */ 1252 /* Don't want top to be NULL, so set it to the last valid object */
1313 top = last; 1253 top = last;
1314 1254
… …
1321 * Unless those objects are exits, type 66 1261 * Unless those objects are exits, type 66
1322 * If INS_ON_TOP is used, don't do this processing 1262 * If INS_ON_TOP is used, don't do this processing
1323 * Need to find the object that in fact blocks view, otherwise 1263 * Need to find the object that in fact blocks view, otherwise
1324 * stacking is a bit odd. 1264 * stacking is a bit odd.
1325 */ 1265 */
1326 if (!(flag & INS_ON_TOP) && 1266 if (!(flag & INS_ON_TOP)
1327 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1267 && ms.flags () & P_BLOCKSVIEW
1268 && (op->face && !op->face->visibility))
1328 { 1269 {
1329 for (last = top; last != floor; last = last->below) 1270 for (last = top; last != floor; last = last->below)
1330 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1271 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1331 break; 1272 break;
1273
1332 /* Check to see if we found the object that blocks view, 1274 /* Check to see if we found the object that blocks view,
1333 * and make sure we have a below pointer for it so that 1275 * and make sure we have a below pointer for it so that
1334 * we can get inserted below this one, which requires we 1276 * we can get inserted below this one, which requires we
1335 * set top to the object below us. 1277 * set top to the object below us.
1336 */ 1278 */
… …
1338 top = last->below; 1280 top = last->below;
1339 } 1281 }
1340 } /* If objects on this space */ 1282 } /* If objects on this space */
1341 1283
1342 if (flag & INS_MAP_LOAD) 1284 if (flag & INS_MAP_LOAD)
1343 top = GET_MAP_TOP (op->map, op->x, op->y); 1285 top = ms.top;
1344 1286
1345 if (flag & INS_ABOVE_FLOOR_ONLY) 1287 if (flag & INS_ABOVE_FLOOR_ONLY)
1346 top = floor; 1288 top = floor;
1347 1289
1348 /* Top is the object that our object (op) is going to get inserted above. 1290 /* Top is the object that our object (op) is going to get inserted above.
1349 */ 1291 */
1350 1292
1351 /* First object on this space */ 1293 /* First object on this space */
1352 if (!top) 1294 if (!top)
1353 { 1295 {
1354 op->above = GET_MAP_OB (op->map, op->x, op->y); 1296 op->above = ms.bot;
1355 1297
1356 if (op->above) 1298 if (op->above)
1357 op->above->below = op; 1299 op->above->below = op;
1358 1300
1359 op->below = 0; 1301 op->below = 0;
1360 op->ms ().bot = op; 1302 ms.bot = op;
1361 } 1303 }
1362 else 1304 else
1363 { /* get inserted into the stack above top */ 1305 { /* get inserted into the stack above top */
1364 op->above = top->above; 1306 op->above = top->above;
1365 1307
… …
1369 op->below = top; 1311 op->below = top;
1370 top->above = op; 1312 top->above = op;
1371 } 1313 }
1372 1314
1373 if (!op->above) 1315 if (!op->above)
1374 op->ms ().top = op; 1316 ms.top = op;
1375 } /* else not INS_BELOW_ORIGINATOR */ 1317 } /* else not INS_BELOW_ORIGINATOR */
1376 1318
1377 if (op->type == PLAYER) 1319 if (op->type == PLAYER)
1378 { 1320 {
1379 op->contr->do_los = 1; 1321 op->contr->do_los = 1;
… …
1385 1327
1386 /* If we have a floor, we know the player, if any, will be above 1328 /* If we have a floor, we know the player, if any, will be above
1387 * it, so save a few ticks and start from there. 1329 * it, so save a few ticks and start from there.
1388 */ 1330 */
1389 if (!(flag & INS_MAP_LOAD)) 1331 if (!(flag & INS_MAP_LOAD))
1390 if (object *pl = op->ms ().player ()) 1332 if (object *pl = ms.player ())
1391 if (pl->contr->ns) 1333 if (pl->contr->ns)
1392 pl->contr->ns->floorbox_update (); 1334 pl->contr->ns->floorbox_update ();
1393 1335
1394 /* If this object glows, it may affect lighting conditions that are 1336 /* If this object glows, it may affect lighting conditions that are
1395 * visible to others on this map. But update_all_los is really 1337 * visible to others on this map. But update_all_los is really
… …
1443{ 1385{
1444 object *tmp, *tmp1; 1386 object *tmp, *tmp1;
1445 1387
1446 /* first search for itself and remove any old instances */ 1388 /* first search for itself and remove any old instances */
1447 1389
1448 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1390 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1449 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1391 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1450 tmp->destroy (); 1392 tmp->destroy ();
1451 1393
1452 tmp1 = arch_to_object (archetype::find (arch_string)); 1394 tmp1 = arch_to_object (archetype::find (arch_string));
1453 1395
… …
1776 1718
1777 /* The objects have to be checked from top to bottom. 1719 /* The objects have to be checked from top to bottom.
1778 * Hence, we first go to the top: 1720 * Hence, we first go to the top:
1779 */ 1721 */
1780 1722
1781 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) 1723 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1782 { 1724 {
1783 /* Trim the search when we find the first other spell effect 1725 /* Trim the search when we find the first other spell effect
1784 * this helps performance so that if a space has 50 spell objects, 1726 * this helps performance so that if a space has 50 spell objects,
1785 * we don't need to check all of them. 1727 * we don't need to check all of them.
1786 */ 1728 */
… …
1844 * The first matching object is returned, or NULL if none. 1786 * The first matching object is returned, or NULL if none.
1845 */ 1787 */
1846object * 1788object *
1847present_arch (const archetype *at, maptile *m, int x, int y) 1789present_arch (const archetype *at, maptile *m, int x, int y)
1848{ 1790{
1849 if (m == NULL || out_of_map (m, x, y)) 1791 if (!m || out_of_map (m, x, y))
1850 { 1792 {
1851 LOG (llevError, "Present_arch called outside map.\n"); 1793 LOG (llevError, "Present_arch called outside map.\n");
1852 return NULL; 1794 return NULL;
1853 } 1795 }
1854 1796
1855 for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1797 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1856 if (tmp->arch == at) 1798 if (tmp->arch == at)
1857 return tmp; 1799 return tmp;
1858 1800
1859 return NULL; 1801 return NULL;
1860} 1802}
… …
1871 { 1813 {
1872 LOG (llevError, "Present called outside map.\n"); 1814 LOG (llevError, "Present called outside map.\n");
1873 return NULL; 1815 return NULL;
1874 } 1816 }
1875 1817
1876 for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1818 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1877 if (tmp->type == type) 1819 if (tmp->type == type)
1878 return tmp; 1820 return tmp;
1879 1821
1880 return NULL; 1822 return NULL;
1881} 1823}
… …
2196 2138
2197 return 3; 2139 return 3;
2198} 2140}
2199 2141
2200/* 2142/*
2201 * absdir(int): Returns a number between 1 and 8, which represent
2202 * the "absolute" direction of a number (it actually takes care of
2203 * "overflow" in previous calculations of a direction).
2204 */
2205
2206int
2207absdir (int d)
2208{
2209 while (d < 1)
2210 d += 8;
2211
2212 while (d > 8)
2213 d -= 8;
2214
2215 return d;
2216}
2217
2218/*
2219 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2143 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2220 * between two directions (which are expected to be absolute (see absdir()) 2144 * between two directions (which are expected to be absolute (see absdir())
2221 */ 2145 */
2222
2223int 2146int
2224dirdiff (int dir1, int dir2) 2147dirdiff (int dir1, int dir2)
2225{ 2148{
2226 int d; 2149 int d;
2227 2150
… …
2643{ 2566{
2644 char flagdesc[512]; 2567 char flagdesc[512];
2645 char info2[256 * 4]; 2568 char info2[256 * 4];
2646 char *p = info; 2569 char *p = info;
2647 2570
2648 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", 2571 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2649 count, uuid.seq, 2572 count, uuid.seq,
2650 &name, 2573 &name,
2651 title ? "\",title:" : "", 2574 title ? "\",title:\"" : "",
2652 title ? (const char *)title : "", 2575 title ? (const char *)title : "",
2653 flag_desc (flagdesc, 512), type); 2576 flag_desc (flagdesc, 512), type);
2654 2577
2655 if (env) 2578 if (env)
2656 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2579 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
… …
2666{ 2589{
2667 static char info[256 * 4]; 2590 static char info[256 * 4];
2668 return debug_desc (info); 2591 return debug_desc (info);
2669} 2592}
2670 2593
2594const char *
2595object::debug_desc2 () const
2596{
2597 static char info[256 * 4];
2598 return debug_desc (info);
2599}
2600

Diff Legend

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