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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines