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.45 by root, Thu Sep 14 18:13:01 2006 UTC vs.
Revision 1.58 by pippijn, Mon Dec 4 17:48:35 2006 UTC

1
2/* 1/*
3 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
4 3
5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 5 Copyright (C) 1992 Frank Tore Johansen
17 16
18 You should have received a copy of the GNU General Public License 17 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 20
22 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 22*/
24 23
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 25 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 26 variable. */
375 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 374 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
376 * Some error messages. 375 * Some error messages.
377 * The result of the dump is stored in the static global errmsg array. 376 * The result of the dump is stored in the static global errmsg array.
378 */ 377 */
379 378
380void 379char *
381dump_object2 (object *op)
382{
383 errmsg[0] = 0;
384 return;
385 //TODO//D#d#
386#if 0
387 char *cp;
388
389/* object *tmp;*/
390
391 if (op->arch != NULL)
392 {
393 strcat (errmsg, "arch ");
394 strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
395 strcat (errmsg, "\n");
396 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
397 strcat (errmsg, cp);
398# if 0
399 /* Don't dump player diffs - they are too long, mostly meaningless, and
400 * will overflow the buffer.
401 * Changed so that we don't dump inventory either. This may
402 * also overflow the buffer.
403 */
404 if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
405 strcat (errmsg, cp);
406 for (tmp = op->inv; tmp; tmp = tmp->below)
407 dump_object2 (tmp);
408# endif
409 strcat (errmsg, "end\n");
410 }
411 else
412 {
413 strcat (errmsg, "Object ");
414 if (op->name == NULL)
415 strcat (errmsg, "(null)");
416 else
417 strcat (errmsg, op->name);
418 strcat (errmsg, "\n");
419# if 0
420 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
421 strcat (errmsg, cp);
422 for (tmp = op->inv; tmp; tmp = tmp->below)
423 dump_object2 (tmp);
424# endif
425 strcat (errmsg, "end\n");
426 }
427#endif
428}
429
430/*
431 * Dumps an object. Returns output in the static global errmsg array.
432 */
433
434void
435dump_object (object *op) 380dump_object (object *op)
436{ 381{
437 if (op == NULL) 382 if (!op)
438 { 383 return strdup ("[NULLOBJ]");
439 strcpy (errmsg, "[NULL pointer]");
440 return;
441 }
442 errmsg[0] = '\0';
443 dump_object2 (op);
444}
445 384
446void 385 object_freezer freezer;
447dump_all_objects (void) 386 save_object (freezer, op, 3);
448{ 387 return freezer.as_string ();
449 object *op;
450
451 for (op = object::first; op != NULL; op = op->next)
452 {
453 dump_object (op);
454 fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
455 }
456} 388}
457 389
458/* 390/*
459 * get_nearest_part(multi-object, object 2) returns the part of the 391 * get_nearest_part(multi-object, object 2) returns the part of the
460 * multi-object 1 which is closest to the second object. 392 * multi-object 1 which is closest to the second object.
480 */ 412 */
481 413
482object * 414object *
483find_object (tag_t i) 415find_object (tag_t i)
484{ 416{
485 object *op;
486
487 for (op = object::first; op != NULL; op = op->next) 417 for (object *op = object::first; op; op = op->next)
488 if (op->count == i) 418 if (op->count == i)
489 break; 419 return op;
420
490 return op; 421 return 0;
491} 422}
492 423
493/* 424/*
494 * Returns the first object which has a name equal to the argument. 425 * Returns the first object which has a name equal to the argument.
495 * Used only by the patch command, but not all that useful. 426 * Used only by the patch command, but not all that useful.
908 else 839 else
909 { 840 {
910 delete *i; 841 delete *i;
911 mortals.erase (i); 842 mortals.erase (i);
912 } 843 }
913
914 static int lastmortals = 0;//D
915
916 if (mortals.size() != lastmortals)//D
917 {
918 lastmortals = mortals.size ();//D
919 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
920 }
921} 844}
922 845
923object::object () 846object::object ()
924{ 847{
925 SET_FLAG (this, FLAG_REMOVED); 848 SET_FLAG (this, FLAG_REMOVED);
947 object::first = this; 870 object::first = this;
948} 871}
949 872
950void object::unlink () 873void object::unlink ()
951{ 874{
952 //count = 0;//D
953 if (!prev && !next) return;//D
954
955 if (this == object::first) 875 if (this == object::first)
956 object::first = next; 876 object::first = next;
957 877
958 /* Remove this object from the list of used objects */ 878 /* Remove this object from the list of used objects */
959 if (prev) prev->next = next; 879 if (prev) prev->next = next;
975 * it from the list of used objects, and puts it on the list of 895 * it from the list of used objects, and puts it on the list of
976 * free objects. The IS_FREED() flag is set in the object. 896 * free objects. The IS_FREED() flag is set in the object.
977 * The object must have been removed by remove_ob() first for 897 * The object must have been removed by remove_ob() first for
978 * this function to succeed. 898 * this function to succeed.
979 * 899 *
980 * If free_inventory is set, free inventory as well. Else drop items in 900 * If destroy_inventory is set, free inventory as well. Else drop items in
981 * inventory to the ground. 901 * inventory to the ground.
982 */ 902 */
983void object::free (bool free_inventory) 903void object::destroy (bool destroy_inventory)
984{ 904{
985 if (QUERY_FLAG (this, FLAG_FREED)) 905 if (QUERY_FLAG (this, FLAG_FREED))
986 return; 906 return;
987 907
988 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 908 if (QUERY_FLAG (this, FLAG_FRIENDLY))
993 913
994 SET_FLAG (this, FLAG_FREED); 914 SET_FLAG (this, FLAG_FREED);
995 915
996 if (more) 916 if (more)
997 { 917 {
998 more->free (free_inventory); 918 more->destroy (destroy_inventory);
999 more = 0; 919 more = 0;
1000 } 920 }
1001 921
1002 if (inv) 922 if (inv)
1003 { 923 {
1004 /* Only if the space blocks everything do we not process - 924 /* Only if the space blocks everything do we not process -
1005 * if some form of movement is allowed, let objects 925 * if some form of movement is allowed, let objects
1006 * drop on that space. 926 * drop on that space.
1007 */ 927 */
1008 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) 928 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1009 { 929 {
1010 object *op = inv; 930 object *op = inv;
1011 931
1012 while (op) 932 while (op)
1013 { 933 {
1014 object *tmp = op->below; 934 object *tmp = op->below;
1015 op->free (free_inventory); 935 op->destroy (destroy_inventory);
1016 op = tmp; 936 op = tmp;
1017 } 937 }
1018 } 938 }
1019 else 939 else
1020 { /* Put objects in inventory onto this space */ 940 { /* Put objects in inventory onto this space */
1039 op = tmp; 959 op = tmp;
1040 } 960 }
1041 } 961 }
1042 } 962 }
1043 963
964 // hack to ensure that freed objects still have a valid map
965 {
966 static maptile *freed_map; // freed objects are moved here to avoid crashes
967
968 if (!freed_map)
969 {
970 freed_map = new maptile;
971
972 freed_map->name = "/internal/freed_objects_map";
973 freed_map->width = 3;
974 freed_map->height = 3;
975
976 freed_map->allocate ();
977 }
978
979 map = freed_map;
980 x = 1;
981 y = 1;
982 }
983
1044 // clear those pointers that likely might have circular references to us 984 // clear those pointers that likely might have circular references to us
1045 owner = 0; 985 owner = 0;
1046 enemy = 0; 986 enemy = 0;
1047 attacked_by = 0; 987 attacked_by = 0;
988
989 // only relevant for players(?), but make sure of it anyways
990 contr = 0;
1048 991
1049 /* Remove object from the active list */ 992 /* Remove object from the active list */
1050 speed = 0; 993 speed = 0;
1051 update_ob_speed (this); 994 update_ob_speed (this);
1052 995
1086remove_ob (object *op) 1029remove_ob (object *op)
1087{ 1030{
1088 object *tmp, *last = 0; 1031 object *tmp, *last = 0;
1089 object *otmp; 1032 object *otmp;
1090 1033
1091 tag_t tag;
1092 int check_walk_off; 1034 int check_walk_off;
1093 mapstruct *m; 1035 maptile *m;
1094 1036
1095 sint16 x, y; 1037 sint16 x, y;
1096 1038
1097 if (QUERY_FLAG (op, FLAG_REMOVED)) 1039 if (QUERY_FLAG (op, FLAG_REMOVED))
1098 return; 1040 return;
1177 * use translated coordinates in case some oddness with map tiling is 1119 * use translated coordinates in case some oddness with map tiling is
1178 * evident 1120 * evident
1179 */ 1121 */
1180 if (GET_MAP_OB (m, x, y) != op) 1122 if (GET_MAP_OB (m, x, y) != op)
1181 { 1123 {
1182 dump_object (op); 1124 char *dump = dump_object (op);
1183 LOG (llevError, 1125 LOG (llevError,
1184 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg); 1126 "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);
1127 free (dump);
1185 dump_object (GET_MAP_OB (m, x, y)); 1128 dump = dump_object (GET_MAP_OB (m, x, y));
1186 LOG (llevError, "%s\n", errmsg); 1129 LOG (llevError, "%s\n", dump);
1130 free (dump);
1187 } 1131 }
1188 1132
1189 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1133 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1190 } 1134 }
1191 1135
1193 op->below = 0; 1137 op->below = 0;
1194 1138
1195 if (op->map->in_memory == MAP_SAVING) 1139 if (op->map->in_memory == MAP_SAVING)
1196 return; 1140 return;
1197 1141
1198 tag = op->count;
1199 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1142 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1200 1143
1201 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1144 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1202 { 1145 {
1203 /* No point updating the players look faces if he is the object 1146 /* No point updating the players look faces if he is the object
1218 1161
1219 tmp->contr->socket.update_look = 1; 1162 tmp->contr->socket.update_look = 1;
1220 } 1163 }
1221 1164
1222 /* See if player moving off should effect something */ 1165 /* See if player moving off should effect something */
1223 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1166 if (check_walk_off
1167 && ((op->move_type & tmp->move_off)
1168 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1224 { 1169 {
1225 move_apply (tmp, op, NULL); 1170 move_apply (tmp, op, NULL);
1226 1171
1227 if (was_destroyed (op, tag)) 1172 if (op->destroyed ())
1228 {
1229 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1173 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1230 }
1231 } 1174 }
1232 1175
1233 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1176 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1234 1177
1235 if (tmp->above == tmp) 1178 if (tmp->above == tmp)
1296/* 1239/*
1297 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1240 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1298 * job preparing multi-part monsters 1241 * job preparing multi-part monsters
1299 */ 1242 */
1300object * 1243object *
1301insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1244insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1302{ 1245{
1303 object *tmp; 1246 object *tmp;
1304 1247
1305 if (op->head) 1248 if (op->head)
1306 op = op->head; 1249 op = op->head;
1334 * NULL if 'op' was destroyed 1277 * NULL if 'op' was destroyed
1335 * just 'op' otherwise 1278 * just 'op' otherwise
1336 */ 1279 */
1337 1280
1338object * 1281object *
1339insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1282insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1340{ 1283{
1341 object *tmp, *top, *floor = NULL; 1284 object *tmp, *top, *floor = NULL;
1342 sint16 x, y; 1285 sint16 x, y;
1343 1286
1344 if (QUERY_FLAG (op, FLAG_FREED)) 1287 if (QUERY_FLAG (op, FLAG_FREED))
1347 return NULL; 1290 return NULL;
1348 } 1291 }
1349 1292
1350 if (m == NULL) 1293 if (m == NULL)
1351 { 1294 {
1352 dump_object (op); 1295 char *dump = dump_object (op);
1353 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); 1296 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1297 free (dump);
1354 return op; 1298 return op;
1355 } 1299 }
1356 1300
1357 if (out_of_map (m, op->x, op->y)) 1301 if (out_of_map (m, op->x, op->y))
1358 { 1302 {
1359 dump_object (op); 1303 char *dump = dump_object (op);
1360 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); 1304 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1361#ifdef MANY_CORES 1305#ifdef MANY_CORES
1362 /* Better to catch this here, as otherwise the next use of this object 1306 /* Better to catch this here, as otherwise the next use of this object
1363 * is likely to cause a crash. Better to find out where it is getting 1307 * is likely to cause a crash. Better to find out where it is getting
1364 * improperly inserted. 1308 * improperly inserted.
1365 */ 1309 */
1366 abort (); 1310 abort ();
1367#endif 1311#endif
1312 free (dump);
1368 return op; 1313 return op;
1369 } 1314 }
1370 1315
1371 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1316 if (!QUERY_FLAG (op, FLAG_REMOVED))
1372 { 1317 {
1373 dump_object (op); 1318 char *dump = dump_object (op);
1374 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); 1319 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1320 free (dump);
1375 return op; 1321 return op;
1376 } 1322 }
1377 1323
1378 if (op->more != NULL) 1324 if (op->more != NULL)
1379 { 1325 {
1625 remove_ob (tmp); 1571 remove_ob (tmp);
1626 free_object (tmp); 1572 free_object (tmp);
1627 } 1573 }
1628 } 1574 }
1629 1575
1630 tmp1 = arch_to_object (find_archetype (arch_string)); 1576 tmp1 = arch_to_object (archetype::find (arch_string));
1631 1577
1632 tmp1->x = op->x; 1578 tmp1->x = op->x;
1633 tmp1->y = op->y; 1579 tmp1->y = op->y;
1634 insert_ob_in_map (tmp1, op->map, op, 0); 1580 insert_ob_in_map (tmp1, op->map, op, 0);
1635} 1581}
1816 tmp, * 1762 tmp, *
1817 otmp; 1763 otmp;
1818 1764
1819 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1765 if (!QUERY_FLAG (op, FLAG_REMOVED))
1820 { 1766 {
1821 dump_object (op); 1767 char *dump = dump_object (op);
1822 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); 1768 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1769 free (dump);
1823 return op; 1770 return op;
1824 } 1771 }
1825 1772
1826 if (where == NULL) 1773 if (where == NULL)
1827 { 1774 {
1828 dump_object (op); 1775 char *dump = dump_object (op);
1829 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); 1776 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1777 free (dump);
1830 return op; 1778 return op;
1831 } 1779 }
1832 1780
1833 if (where->head) 1781 if (where->head)
1834 { 1782 {
1934 */ 1882 */
1935 1883
1936int 1884int
1937check_move_on (object *op, object *originator) 1885check_move_on (object *op, object *originator)
1938{ 1886{
1939 object * 1887 object *tmp;
1940 tmp; 1888 maptile *m = op->map;
1941 tag_t
1942 tag;
1943 mapstruct *
1944 m = op->map;
1945 int
1946 x = op->x, y = op->y; 1889 int x = op->x, y = op->y;
1947 1890
1948 MoveType 1891 MoveType move_on, move_slow, move_block;
1949 move_on,
1950 move_slow,
1951 move_block;
1952 1892
1953 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1893 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1954 return 0; 1894 return 0;
1955
1956 tag = op->count;
1957 1895
1958 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1896 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1959 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1897 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1960 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1898 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1961 1899
2022 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1960 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2023 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) 1961 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2024 { 1962 {
2025 move_apply (tmp, op, originator); 1963 move_apply (tmp, op, originator);
2026 1964
2027 if (was_destroyed (op, tag)) 1965 if (op->destroyed ())
2028 return 1; 1966 return 1;
2029 1967
2030 /* what the person/creature stepped onto has moved the object 1968 /* what the person/creature stepped onto has moved the object
2031 * someplace new. Don't process any further - if we did, 1969 * someplace new. Don't process any further - if we did,
2032 * have a feeling strange problems would result. 1970 * have a feeling strange problems would result.
2044 * a matching archetype at the given map and coordinates. 1982 * a matching archetype at the given map and coordinates.
2045 * The first matching object is returned, or NULL if none. 1983 * The first matching object is returned, or NULL if none.
2046 */ 1984 */
2047 1985
2048object * 1986object *
2049present_arch (const archetype *at, mapstruct *m, int x, int y) 1987present_arch (const archetype *at, maptile *m, int x, int y)
2050{ 1988{
2051 object * 1989 object *
2052 tmp; 1990 tmp;
2053 1991
2054 if (m == NULL || out_of_map (m, x, y)) 1992 if (m == NULL || out_of_map (m, x, y))
2067 * a matching type variable at the given map and coordinates. 2005 * a matching type variable at the given map and coordinates.
2068 * The first matching object is returned, or NULL if none. 2006 * The first matching object is returned, or NULL if none.
2069 */ 2007 */
2070 2008
2071object * 2009object *
2072present (unsigned char type, mapstruct *m, int x, int y) 2010present (unsigned char type, maptile *m, int x, int y)
2073{ 2011{
2074 object * 2012 object *
2075 tmp; 2013 tmp;
2076 2014
2077 if (out_of_map (m, x, y)) 2015 if (out_of_map (m, x, y))
2217 * the archetype because that isn't correct if the monster has been 2155 * the archetype because that isn't correct if the monster has been
2218 * customized, changed states, etc. 2156 * customized, changed states, etc.
2219 */ 2157 */
2220 2158
2221int 2159int
2222find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2160find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2223{ 2161{
2224 int 2162 int
2225 i, 2163 i,
2226 index = 0, flag; 2164 index = 0, flag;
2227 static int 2165 static int
2248 return -1; 2186 return -1;
2249 return altern[RANDOM () % index]; 2187 return altern[RANDOM () % index];
2250} 2188}
2251 2189
2252/* 2190/*
2253 * find_first_free_spot(archetype, mapstruct, x, y) works like 2191 * find_first_free_spot(archetype, maptile, x, y) works like
2254 * find_free_spot(), but it will search max number of squares. 2192 * find_free_spot(), but it will search max number of squares.
2255 * But it will return the first available spot, not a random choice. 2193 * But it will return the first available spot, not a random choice.
2256 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2194 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2257 */ 2195 */
2258 2196
2259int 2197int
2260find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2198find_first_free_spot (const object *ob, maptile *m, int x, int y)
2261{ 2199{
2262 int 2200 int
2263 i; 2201 i;
2264 2202
2265 for (i = 0; i < SIZEOFFREE; i++) 2203 for (i = 0; i < SIZEOFFREE; i++)
2329 * because we have to know what movement the thing looking to move 2267 * because we have to know what movement the thing looking to move
2330 * there is capable of. 2268 * there is capable of.
2331 */ 2269 */
2332 2270
2333int 2271int
2334find_dir (mapstruct *m, int x, int y, object *exclude) 2272find_dir (maptile *m, int x, int y, object *exclude)
2335{ 2273{
2336 int 2274 int
2337 i, 2275 i,
2338 max = SIZEOFFREE, mflags; 2276 max = SIZEOFFREE, mflags;
2339 2277
2340 sint16 nx, ny; 2278 sint16 nx, ny;
2341 object * 2279 object *
2342 tmp; 2280 tmp;
2343 mapstruct * 2281 maptile *
2344 mp; 2282 mp;
2345 2283
2346 MoveType blocked, move_type; 2284 MoveType blocked, move_type;
2347 2285
2348 if (exclude && exclude->head) 2286 if (exclude && exclude->head)
2556 * Modified to be map tile aware -.MSW 2494 * Modified to be map tile aware -.MSW
2557 */ 2495 */
2558 2496
2559 2497
2560int 2498int
2561can_see_monsterP (mapstruct *m, int x, int y, int dir) 2499can_see_monsterP (maptile *m, int x, int y, int dir)
2562{ 2500{
2563 sint16 dx, dy; 2501 sint16 dx, dy;
2564 int 2502 int
2565 mflags; 2503 mflags;
2566 2504
2646 if (prev) 2584 if (prev)
2647 prev->more = tmp; 2585 prev->more = tmp;
2648 prev = tmp; 2586 prev = tmp;
2649 } 2587 }
2650 2588
2651 /*** copy inventory ***/
2652 for (item = src->inv; item; item = item->below) 2589 for (item = src->inv; item; item = item->below)
2653 {
2654 (void) insert_ob_in_ob (object_create_clone (item), dst); 2590 insert_ob_in_ob (object_create_clone (item), dst);
2655 }
2656 2591
2657 return dst; 2592 return dst;
2658} 2593}
2659 2594
2660/* return true if the object was destroyed, 0 otherwise */
2661int
2662was_destroyed (const object *op, tag_t old_tag)
2663{
2664 /* checking for FLAG_FREED isn't necessary, but makes this function more
2665 * robust */
2666 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2667}
2668
2669/* GROS - Creates an object using a string representing its content. */ 2595/* GROS - Creates an object using a string representing its content. */
2670
2671/* Basically, we save the content of the string to a temp file, then call */ 2596/* Basically, we save the content of the string to a temp file, then call */
2672
2673/* load_object on it. I admit it is a highly inefficient way to make things, */ 2597/* load_object on it. I admit it is a highly inefficient way to make things, */
2674
2675/* but it was simple to make and allows reusing the load_object function. */ 2598/* but it was simple to make and allows reusing the load_object function. */
2676
2677/* Remember not to use load_object_str in a time-critical situation. */ 2599/* Remember not to use load_object_str in a time-critical situation. */
2678
2679/* Also remember that multiparts objects are not supported for now. */ 2600/* Also remember that multiparts objects are not supported for now. */
2680 2601
2681object * 2602object *
2682load_object_str (const char *obstr) 2603load_object_str (const char *obstr)
2683{ 2604{
2684 object * 2605 object *op;
2685 op;
2686 char
2687 filename[MAX_BUF]; 2606 char filename[MAX_BUF];
2688 2607
2689 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); 2608 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2690 2609
2691 FILE *
2692 tempfile = fopen (filename, "w"); 2610 FILE *tempfile = fopen (filename, "w");
2693 2611
2694 if (tempfile == NULL) 2612 if (tempfile == NULL)
2695 { 2613 {
2696 LOG (llevError, "Error - Unable to access load object temp file\n"); 2614 LOG (llevError, "Error - Unable to access load object temp file\n");
2697 return NULL; 2615 return NULL;
2718 * returns NULL if no match. 2636 * returns NULL if no match.
2719 */ 2637 */
2720object * 2638object *
2721find_obj_by_type_subtype (const object *who, int type, int subtype) 2639find_obj_by_type_subtype (const object *who, int type, int subtype)
2722{ 2640{
2723 object * 2641 object *tmp;
2724 tmp;
2725 2642
2726 for (tmp = who->inv; tmp; tmp = tmp->below) 2643 for (tmp = who->inv; tmp; tmp = tmp->below)
2727 if (tmp->type == type && tmp->subtype == subtype) 2644 if (tmp->type == type && tmp->subtype == subtype)
2728 return tmp; 2645 return tmp;
2729 2646
2737 * do the desired thing. 2654 * do the desired thing.
2738 */ 2655 */
2739key_value * 2656key_value *
2740get_ob_key_link (const object *ob, const char *key) 2657get_ob_key_link (const object *ob, const char *key)
2741{ 2658{
2742 key_value * 2659 key_value *link;
2743 link;
2744 2660
2745 for (link = ob->key_values; link != NULL; link = link->next) 2661 for (link = ob->key_values; link != NULL; link = link->next)
2746 {
2747 if (link->key == key) 2662 if (link->key == key)
2748 {
2749 return link; 2663 return link;
2750 }
2751 }
2752 2664
2753 return NULL; 2665 return NULL;
2754} 2666}
2755 2667
2756/* 2668/*

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines