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.53 by root, Tue Nov 7 16:30:54 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.
485 object *op; 417 object *op;
486 418
487 for (op = object::first; op != NULL; op = op->next) 419 for (op = object::first; op != NULL; op = op->next)
488 if (op->count == i) 420 if (op->count == i)
489 break; 421 break;
422
490 return op; 423 return op;
491} 424}
492 425
493/* 426/*
494 * Returns the first object which has a name equal to the argument. 427 * Returns the first object which has a name equal to the argument.
911 mortals.erase (i); 844 mortals.erase (i);
912 } 845 }
913 846
914 static int lastmortals = 0;//D 847 static int lastmortals = 0;//D
915 848
916 if (mortals.size() != lastmortals)//D 849 if (mortals.size() != lastmortals && lastmortals > 100)//D
917 { 850 {
918 lastmortals = mortals.size ();//D 851 lastmortals = mortals.size ();//D
919 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D 852 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
920 } 853 }
921} 854}
947 object::first = this; 880 object::first = this;
948} 881}
949 882
950void object::unlink () 883void object::unlink ()
951{ 884{
952 //count = 0;//D
953 if (!prev && !next) return;//D
954
955 if (this == object::first) 885 if (this == object::first)
956 object::first = next; 886 object::first = next;
957 887
958 /* Remove this object from the list of used objects */ 888 /* Remove this object from the list of used objects */
959 if (prev) prev->next = next; 889 if (prev) prev->next = next;
975 * it from the list of used objects, and puts it on the list of 905 * 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. 906 * free objects. The IS_FREED() flag is set in the object.
977 * The object must have been removed by remove_ob() first for 907 * The object must have been removed by remove_ob() first for
978 * this function to succeed. 908 * this function to succeed.
979 * 909 *
980 * If free_inventory is set, free inventory as well. Else drop items in 910 * If destroy_inventory is set, free inventory as well. Else drop items in
981 * inventory to the ground. 911 * inventory to the ground.
982 */ 912 */
983void object::free (bool free_inventory) 913void object::destroy (bool destroy_inventory)
984{ 914{
985 if (QUERY_FLAG (this, FLAG_FREED)) 915 if (QUERY_FLAG (this, FLAG_FREED))
986 return; 916 return;
987 917
988 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 918 if (QUERY_FLAG (this, FLAG_FRIENDLY))
993 923
994 SET_FLAG (this, FLAG_FREED); 924 SET_FLAG (this, FLAG_FREED);
995 925
996 if (more) 926 if (more)
997 { 927 {
998 more->free (free_inventory); 928 more->destroy (destroy_inventory);
999 more = 0; 929 more = 0;
1000 } 930 }
1001 931
1002 if (inv) 932 if (inv)
1003 { 933 {
1004 /* Only if the space blocks everything do we not process - 934 /* Only if the space blocks everything do we not process -
1005 * if some form of movement is allowed, let objects 935 * if some form of movement is allowed, let objects
1006 * drop on that space. 936 * drop on that space.
1007 */ 937 */
1008 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) 938 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1009 { 939 {
1010 object *op = inv; 940 object *op = inv;
1011 941
1012 while (op) 942 while (op)
1013 { 943 {
1014 object *tmp = op->below; 944 object *tmp = op->below;
1015 op->free (free_inventory); 945 op->destroy (destroy_inventory);
1016 op = tmp; 946 op = tmp;
1017 } 947 }
1018 } 948 }
1019 else 949 else
1020 { /* Put objects in inventory onto this space */ 950 { /* Put objects in inventory onto this space */
1044 // clear those pointers that likely might have circular references to us 974 // clear those pointers that likely might have circular references to us
1045 owner = 0; 975 owner = 0;
1046 enemy = 0; 976 enemy = 0;
1047 attacked_by = 0; 977 attacked_by = 0;
1048 978
979 // only relevant for players(?), but make sure of it anyways
980 contr = 0;
981
1049 /* Remove object from the active list */ 982 /* Remove object from the active list */
1050 speed = 0; 983 speed = 0;
1051 update_ob_speed (this); 984 update_ob_speed (this);
1052 985
1053 unlink (); 986 unlink ();
1086remove_ob (object *op) 1019remove_ob (object *op)
1087{ 1020{
1088 object *tmp, *last = 0; 1021 object *tmp, *last = 0;
1089 object *otmp; 1022 object *otmp;
1090 1023
1091 tag_t tag;
1092 int check_walk_off; 1024 int check_walk_off;
1093 mapstruct *m; 1025 maptile *m;
1094 1026
1095 sint16 x, y; 1027 sint16 x, y;
1096 1028
1097 if (QUERY_FLAG (op, FLAG_REMOVED)) 1029 if (QUERY_FLAG (op, FLAG_REMOVED))
1098 return; 1030 return;
1177 * use translated coordinates in case some oddness with map tiling is 1109 * use translated coordinates in case some oddness with map tiling is
1178 * evident 1110 * evident
1179 */ 1111 */
1180 if (GET_MAP_OB (m, x, y) != op) 1112 if (GET_MAP_OB (m, x, y) != op)
1181 { 1113 {
1182 dump_object (op); 1114 char *dump = dump_object (op);
1183 LOG (llevError, 1115 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); 1116 "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);
1117 free (dump);
1185 dump_object (GET_MAP_OB (m, x, y)); 1118 dump = dump_object (GET_MAP_OB (m, x, y));
1186 LOG (llevError, "%s\n", errmsg); 1119 LOG (llevError, "%s\n", dump);
1120 free (dump);
1187 } 1121 }
1188 1122
1189 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1123 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1190 } 1124 }
1191 1125
1193 op->below = 0; 1127 op->below = 0;
1194 1128
1195 if (op->map->in_memory == MAP_SAVING) 1129 if (op->map->in_memory == MAP_SAVING)
1196 return; 1130 return;
1197 1131
1198 tag = op->count;
1199 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1132 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1200 1133
1201 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1134 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1202 { 1135 {
1203 /* No point updating the players look faces if he is the object 1136 /* No point updating the players look faces if he is the object
1218 1151
1219 tmp->contr->socket.update_look = 1; 1152 tmp->contr->socket.update_look = 1;
1220 } 1153 }
1221 1154
1222 /* See if player moving off should effect something */ 1155 /* 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)) 1156 if (check_walk_off
1157 && ((op->move_type & tmp->move_off)
1158 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1224 { 1159 {
1225 move_apply (tmp, op, NULL); 1160 move_apply (tmp, op, NULL);
1226 1161
1227 if (was_destroyed (op, tag)) 1162 if (op->destroyed ())
1228 {
1229 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1163 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1230 }
1231 } 1164 }
1232 1165
1233 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1166 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1234 1167
1235 if (tmp->above == tmp) 1168 if (tmp->above == tmp)
1296/* 1229/*
1297 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1230 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1298 * job preparing multi-part monsters 1231 * job preparing multi-part monsters
1299 */ 1232 */
1300object * 1233object *
1301insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1234insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1302{ 1235{
1303 object *tmp; 1236 object *tmp;
1304 1237
1305 if (op->head) 1238 if (op->head)
1306 op = op->head; 1239 op = op->head;
1334 * NULL if 'op' was destroyed 1267 * NULL if 'op' was destroyed
1335 * just 'op' otherwise 1268 * just 'op' otherwise
1336 */ 1269 */
1337 1270
1338object * 1271object *
1339insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1272insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1340{ 1273{
1341 object *tmp, *top, *floor = NULL; 1274 object *tmp, *top, *floor = NULL;
1342 sint16 x, y; 1275 sint16 x, y;
1343 1276
1344 if (QUERY_FLAG (op, FLAG_FREED)) 1277 if (QUERY_FLAG (op, FLAG_FREED))
1347 return NULL; 1280 return NULL;
1348 } 1281 }
1349 1282
1350 if (m == NULL) 1283 if (m == NULL)
1351 { 1284 {
1352 dump_object (op); 1285 char *dump = dump_object (op);
1353 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); 1286 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1287 free (dump);
1354 return op; 1288 return op;
1355 } 1289 }
1356 1290
1357 if (out_of_map (m, op->x, op->y)) 1291 if (out_of_map (m, op->x, op->y))
1358 { 1292 {
1359 dump_object (op); 1293 char *dump = dump_object (op);
1360 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); 1294 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1361#ifdef MANY_CORES 1295#ifdef MANY_CORES
1362 /* Better to catch this here, as otherwise the next use of this object 1296 /* 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 1297 * is likely to cause a crash. Better to find out where it is getting
1364 * improperly inserted. 1298 * improperly inserted.
1365 */ 1299 */
1366 abort (); 1300 abort ();
1367#endif 1301#endif
1302 free (dump);
1368 return op; 1303 return op;
1369 } 1304 }
1370 1305
1371 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1306 if (!QUERY_FLAG (op, FLAG_REMOVED))
1372 { 1307 {
1373 dump_object (op); 1308 char *dump = dump_object (op);
1374 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); 1309 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1310 free (dump);
1375 return op; 1311 return op;
1376 } 1312 }
1377 1313
1378 if (op->more != NULL) 1314 if (op->more != NULL)
1379 { 1315 {
1625 remove_ob (tmp); 1561 remove_ob (tmp);
1626 free_object (tmp); 1562 free_object (tmp);
1627 } 1563 }
1628 } 1564 }
1629 1565
1630 tmp1 = arch_to_object (find_archetype (arch_string)); 1566 tmp1 = arch_to_object (archetype::find (arch_string));
1631 1567
1632 tmp1->x = op->x; 1568 tmp1->x = op->x;
1633 tmp1->y = op->y; 1569 tmp1->y = op->y;
1634 insert_ob_in_map (tmp1, op->map, op, 0); 1570 insert_ob_in_map (tmp1, op->map, op, 0);
1635} 1571}
1816 tmp, * 1752 tmp, *
1817 otmp; 1753 otmp;
1818 1754
1819 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1755 if (!QUERY_FLAG (op, FLAG_REMOVED))
1820 { 1756 {
1821 dump_object (op); 1757 char *dump = dump_object (op);
1822 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); 1758 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1759 free (dump);
1823 return op; 1760 return op;
1824 } 1761 }
1825 1762
1826 if (where == NULL) 1763 if (where == NULL)
1827 { 1764 {
1828 dump_object (op); 1765 char *dump = dump_object (op);
1829 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); 1766 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1767 free (dump);
1830 return op; 1768 return op;
1831 } 1769 }
1832 1770
1833 if (where->head) 1771 if (where->head)
1834 { 1772 {
1934 */ 1872 */
1935 1873
1936int 1874int
1937check_move_on (object *op, object *originator) 1875check_move_on (object *op, object *originator)
1938{ 1876{
1939 object * 1877 object *tmp;
1940 tmp; 1878 maptile *m = op->map;
1941 tag_t
1942 tag;
1943 mapstruct *
1944 m = op->map;
1945 int
1946 x = op->x, y = op->y; 1879 int x = op->x, y = op->y;
1947 1880
1948 MoveType 1881 MoveType move_on, move_slow, move_block;
1949 move_on,
1950 move_slow,
1951 move_block;
1952 1882
1953 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1883 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1954 return 0; 1884 return 0;
1955
1956 tag = op->count;
1957 1885
1958 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1886 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); 1887 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); 1888 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1961 1889
2022 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1950 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)) 1951 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2024 { 1952 {
2025 move_apply (tmp, op, originator); 1953 move_apply (tmp, op, originator);
2026 1954
2027 if (was_destroyed (op, tag)) 1955 if (op->destroyed ())
2028 return 1; 1956 return 1;
2029 1957
2030 /* what the person/creature stepped onto has moved the object 1958 /* what the person/creature stepped onto has moved the object
2031 * someplace new. Don't process any further - if we did, 1959 * someplace new. Don't process any further - if we did,
2032 * have a feeling strange problems would result. 1960 * have a feeling strange problems would result.
2044 * a matching archetype at the given map and coordinates. 1972 * a matching archetype at the given map and coordinates.
2045 * The first matching object is returned, or NULL if none. 1973 * The first matching object is returned, or NULL if none.
2046 */ 1974 */
2047 1975
2048object * 1976object *
2049present_arch (const archetype *at, mapstruct *m, int x, int y) 1977present_arch (const archetype *at, maptile *m, int x, int y)
2050{ 1978{
2051 object * 1979 object *
2052 tmp; 1980 tmp;
2053 1981
2054 if (m == NULL || out_of_map (m, x, y)) 1982 if (m == NULL || out_of_map (m, x, y))
2067 * a matching type variable at the given map and coordinates. 1995 * a matching type variable at the given map and coordinates.
2068 * The first matching object is returned, or NULL if none. 1996 * The first matching object is returned, or NULL if none.
2069 */ 1997 */
2070 1998
2071object * 1999object *
2072present (unsigned char type, mapstruct *m, int x, int y) 2000present (unsigned char type, maptile *m, int x, int y)
2073{ 2001{
2074 object * 2002 object *
2075 tmp; 2003 tmp;
2076 2004
2077 if (out_of_map (m, x, y)) 2005 if (out_of_map (m, x, y))
2217 * the archetype because that isn't correct if the monster has been 2145 * the archetype because that isn't correct if the monster has been
2218 * customized, changed states, etc. 2146 * customized, changed states, etc.
2219 */ 2147 */
2220 2148
2221int 2149int
2222find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2150find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2223{ 2151{
2224 int 2152 int
2225 i, 2153 i,
2226 index = 0, flag; 2154 index = 0, flag;
2227 static int 2155 static int
2248 return -1; 2176 return -1;
2249 return altern[RANDOM () % index]; 2177 return altern[RANDOM () % index];
2250} 2178}
2251 2179
2252/* 2180/*
2253 * find_first_free_spot(archetype, mapstruct, x, y) works like 2181 * find_first_free_spot(archetype, maptile, x, y) works like
2254 * find_free_spot(), but it will search max number of squares. 2182 * find_free_spot(), but it will search max number of squares.
2255 * But it will return the first available spot, not a random choice. 2183 * 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. 2184 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2257 */ 2185 */
2258 2186
2259int 2187int
2260find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2188find_first_free_spot (const object *ob, maptile *m, int x, int y)
2261{ 2189{
2262 int 2190 int
2263 i; 2191 i;
2264 2192
2265 for (i = 0; i < SIZEOFFREE; i++) 2193 for (i = 0; i < SIZEOFFREE; i++)
2329 * because we have to know what movement the thing looking to move 2257 * because we have to know what movement the thing looking to move
2330 * there is capable of. 2258 * there is capable of.
2331 */ 2259 */
2332 2260
2333int 2261int
2334find_dir (mapstruct *m, int x, int y, object *exclude) 2262find_dir (maptile *m, int x, int y, object *exclude)
2335{ 2263{
2336 int 2264 int
2337 i, 2265 i,
2338 max = SIZEOFFREE, mflags; 2266 max = SIZEOFFREE, mflags;
2339 2267
2340 sint16 nx, ny; 2268 sint16 nx, ny;
2341 object * 2269 object *
2342 tmp; 2270 tmp;
2343 mapstruct * 2271 maptile *
2344 mp; 2272 mp;
2345 2273
2346 MoveType blocked, move_type; 2274 MoveType blocked, move_type;
2347 2275
2348 if (exclude && exclude->head) 2276 if (exclude && exclude->head)
2556 * Modified to be map tile aware -.MSW 2484 * Modified to be map tile aware -.MSW
2557 */ 2485 */
2558 2486
2559 2487
2560int 2488int
2561can_see_monsterP (mapstruct *m, int x, int y, int dir) 2489can_see_monsterP (maptile *m, int x, int y, int dir)
2562{ 2490{
2563 sint16 dx, dy; 2491 sint16 dx, dy;
2564 int 2492 int
2565 mflags; 2493 mflags;
2566 2494
2646 if (prev) 2574 if (prev)
2647 prev->more = tmp; 2575 prev->more = tmp;
2648 prev = tmp; 2576 prev = tmp;
2649 } 2577 }
2650 2578
2651 /*** copy inventory ***/
2652 for (item = src->inv; item; item = item->below) 2579 for (item = src->inv; item; item = item->below)
2653 {
2654 (void) insert_ob_in_ob (object_create_clone (item), dst); 2580 insert_ob_in_ob (object_create_clone (item), dst);
2655 }
2656 2581
2657 return dst; 2582 return dst;
2658} 2583}
2659 2584
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. */ 2585/* 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 */ 2586/* 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, */ 2587/* 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. */ 2588/* 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. */ 2589/* Remember not to use load_object_str in a time-critical situation. */
2678
2679/* Also remember that multiparts objects are not supported for now. */ 2590/* Also remember that multiparts objects are not supported for now. */
2680 2591
2681object * 2592object *
2682load_object_str (const char *obstr) 2593load_object_str (const char *obstr)
2683{ 2594{
2684 object * 2595 object *op;
2685 op;
2686 char
2687 filename[MAX_BUF]; 2596 char filename[MAX_BUF];
2688 2597
2689 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); 2598 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2690 2599
2691 FILE *
2692 tempfile = fopen (filename, "w"); 2600 FILE *tempfile = fopen (filename, "w");
2693 2601
2694 if (tempfile == NULL) 2602 if (tempfile == NULL)
2695 { 2603 {
2696 LOG (llevError, "Error - Unable to access load object temp file\n"); 2604 LOG (llevError, "Error - Unable to access load object temp file\n");
2697 return NULL; 2605 return NULL;
2718 * returns NULL if no match. 2626 * returns NULL if no match.
2719 */ 2627 */
2720object * 2628object *
2721find_obj_by_type_subtype (const object *who, int type, int subtype) 2629find_obj_by_type_subtype (const object *who, int type, int subtype)
2722{ 2630{
2723 object * 2631 object *tmp;
2724 tmp;
2725 2632
2726 for (tmp = who->inv; tmp; tmp = tmp->below) 2633 for (tmp = who->inv; tmp; tmp = tmp->below)
2727 if (tmp->type == type && tmp->subtype == subtype) 2634 if (tmp->type == type && tmp->subtype == subtype)
2728 return tmp; 2635 return tmp;
2729 2636
2737 * do the desired thing. 2644 * do the desired thing.
2738 */ 2645 */
2739key_value * 2646key_value *
2740get_ob_key_link (const object *ob, const char *key) 2647get_ob_key_link (const object *ob, const char *key)
2741{ 2648{
2742 key_value * 2649 key_value *link;
2743 link;
2744 2650
2745 for (link = ob->key_values; link != NULL; link = link->next) 2651 for (link = ob->key_values; link != NULL; link = link->next)
2746 {
2747 if (link->key == key) 2652 if (link->key == key)
2748 {
2749 return link; 2653 return link;
2750 }
2751 }
2752 2654
2753 return NULL; 2655 return NULL;
2754} 2656}
2755 2657
2756/* 2658/*

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines