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.47 by root, Thu Sep 14 22:33:59 2006 UTC vs.
Revision 1.58 by pippijn, Mon Dec 4 17:48:35 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines