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.55 by root, Sun Dec 3 00:41:33 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.
910 mortals.erase (i); 842 mortals.erase (i);
911 } 843 }
912 844
913 static int lastmortals = 0;//D 845 static int lastmortals = 0;//D
914 846
915 if (mortals.size() != lastmortals)//D 847 if (mortals.size() != lastmortals && lastmortals > 100)//D
916 { 848 {
917 lastmortals = mortals.size ();//D 849 lastmortals = mortals.size ();//D
918 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D 850 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
919 } 851 }
920} 852}
946 object::first = this; 878 object::first = this;
947} 879}
948 880
949void object::unlink () 881void object::unlink ()
950{ 882{
951 //count = 0;//D
952 if (!prev && !next) return;//D
953
954 if (this == object::first) 883 if (this == object::first)
955 object::first = next; 884 object::first = next;
956 885
957 /* Remove this object from the list of used objects */ 886 /* Remove this object from the list of used objects */
958 if (prev) prev->next = next; 887 if (prev) prev->next = next;
974 * 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
975 * free objects. The IS_FREED() flag is set in the object. 904 * free objects. The IS_FREED() flag is set in the object.
976 * The object must have been removed by remove_ob() first for 905 * The object must have been removed by remove_ob() first for
977 * this function to succeed. 906 * this function to succeed.
978 * 907 *
979 * 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
980 * inventory to the ground. 909 * inventory to the ground.
981 */ 910 */
982void object::free (bool free_inventory) 911void object::destroy (bool destroy_inventory)
983{ 912{
984 if (QUERY_FLAG (this, FLAG_FREED)) 913 if (QUERY_FLAG (this, FLAG_FREED))
985 return; 914 return;
986 915
987 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 916 if (QUERY_FLAG (this, FLAG_FRIENDLY))
990 if (!QUERY_FLAG (this, FLAG_REMOVED)) 919 if (!QUERY_FLAG (this, FLAG_REMOVED))
991 remove_ob (this); 920 remove_ob (this);
992 921
993 SET_FLAG (this, FLAG_FREED); 922 SET_FLAG (this, FLAG_FREED);
994 923
924 // hack to ensure that freed objects still have a valid map
925 {
926 static maptile *freed_map; // freed objects are moved here to avoid crashes
927
928 if (!freed_map)
929 {
930 freed_map = get_empty_map (3, 3);
931 freed_map->name = "freed objects map";
932 allocate_map (freed_map);
933 }
934
935 map = freed_map;
936 x = 1;
937 y = 1;
938 }
939
995 if (more) 940 if (more)
996 { 941 {
997 more->free (free_inventory); 942 more->destroy (destroy_inventory);
998 more = 0; 943 more = 0;
999 } 944 }
1000 945
1001 if (inv) 946 if (inv)
1002 { 947 {
1003 /* Only if the space blocks everything do we not process - 948 /* Only if the space blocks everything do we not process -
1004 * if some form of movement is allowed, let objects 949 * if some form of movement is allowed, let objects
1005 * drop on that space. 950 * drop on that space.
1006 */ 951 */
1007 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) 952 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
1008 { 953 {
1009 object *op = inv; 954 object *op = inv;
1010 955
1011 while (op) 956 while (op)
1012 { 957 {
1013 object *tmp = op->below; 958 object *tmp = op->below;
1014 op->free (free_inventory); 959 op->destroy (destroy_inventory);
1015 op = tmp; 960 op = tmp;
1016 } 961 }
1017 } 962 }
1018 else 963 else
1019 { /* Put objects in inventory onto this space */ 964 { /* Put objects in inventory onto this space */
1043 // clear those pointers that likely might have circular references to us 988 // clear those pointers that likely might have circular references to us
1044 owner = 0; 989 owner = 0;
1045 enemy = 0; 990 enemy = 0;
1046 attacked_by = 0; 991 attacked_by = 0;
1047 992
993 // only relevant for players(?), but make sure of it anyways
994 contr = 0;
995
1048 /* Remove object from the active list */ 996 /* Remove object from the active list */
1049 speed = 0; 997 speed = 0;
1050 update_ob_speed (this); 998 update_ob_speed (this);
1051 999
1052 unlink (); 1000 unlink ();
1085remove_ob (object *op) 1033remove_ob (object *op)
1086{ 1034{
1087 object *tmp, *last = 0; 1035 object *tmp, *last = 0;
1088 object *otmp; 1036 object *otmp;
1089 1037
1090 tag_t tag;
1091 int check_walk_off; 1038 int check_walk_off;
1092 mapstruct *m; 1039 maptile *m;
1093 1040
1094 sint16 x, y; 1041 sint16 x, y;
1095 1042
1096 if (QUERY_FLAG (op, FLAG_REMOVED)) 1043 if (QUERY_FLAG (op, FLAG_REMOVED))
1097 return; 1044 return;
1176 * use translated coordinates in case some oddness with map tiling is 1123 * use translated coordinates in case some oddness with map tiling is
1177 * evident 1124 * evident
1178 */ 1125 */
1179 if (GET_MAP_OB (m, x, y) != op) 1126 if (GET_MAP_OB (m, x, y) != op)
1180 { 1127 {
1181 dump_object (op); 1128 char *dump = dump_object (op);
1182 LOG (llevError, 1129 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); 1130 "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);
1131 free (dump);
1184 dump_object (GET_MAP_OB (m, x, y)); 1132 dump = dump_object (GET_MAP_OB (m, x, y));
1185 LOG (llevError, "%s\n", errmsg); 1133 LOG (llevError, "%s\n", dump);
1134 free (dump);
1186 } 1135 }
1187 1136
1188 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1137 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1189 } 1138 }
1190 1139
1192 op->below = 0; 1141 op->below = 0;
1193 1142
1194 if (op->map->in_memory == MAP_SAVING) 1143 if (op->map->in_memory == MAP_SAVING)
1195 return; 1144 return;
1196 1145
1197 tag = op->count;
1198 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1146 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1199 1147
1200 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1148 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1201 { 1149 {
1202 /* No point updating the players look faces if he is the object 1150 /* No point updating the players look faces if he is the object
1217 1165
1218 tmp->contr->socket.update_look = 1; 1166 tmp->contr->socket.update_look = 1;
1219 } 1167 }
1220 1168
1221 /* See if player moving off should effect something */ 1169 /* 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)) 1170 if (check_walk_off
1171 && ((op->move_type & tmp->move_off)
1172 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1223 { 1173 {
1224 move_apply (tmp, op, NULL); 1174 move_apply (tmp, op, NULL);
1225 1175
1226 if (was_destroyed (op, tag)) 1176 if (op->destroyed ())
1227 {
1228 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1177 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1229 }
1230 } 1178 }
1231 1179
1232 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1180 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1233 1181
1234 if (tmp->above == tmp) 1182 if (tmp->above == tmp)
1295/* 1243/*
1296 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1244 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1297 * job preparing multi-part monsters 1245 * job preparing multi-part monsters
1298 */ 1246 */
1299object * 1247object *
1300insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1248insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1301{ 1249{
1302 object *tmp; 1250 object *tmp;
1303 1251
1304 if (op->head) 1252 if (op->head)
1305 op = op->head; 1253 op = op->head;
1333 * NULL if 'op' was destroyed 1281 * NULL if 'op' was destroyed
1334 * just 'op' otherwise 1282 * just 'op' otherwise
1335 */ 1283 */
1336 1284
1337object * 1285object *
1338insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1286insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1339{ 1287{
1340 object *tmp, *top, *floor = NULL; 1288 object *tmp, *top, *floor = NULL;
1341 sint16 x, y; 1289 sint16 x, y;
1342 1290
1343 if (QUERY_FLAG (op, FLAG_FREED)) 1291 if (QUERY_FLAG (op, FLAG_FREED))
1346 return NULL; 1294 return NULL;
1347 } 1295 }
1348 1296
1349 if (m == NULL) 1297 if (m == NULL)
1350 { 1298 {
1351 dump_object (op); 1299 char *dump = dump_object (op);
1352 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); 1300 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1301 free (dump);
1353 return op; 1302 return op;
1354 } 1303 }
1355 1304
1356 if (out_of_map (m, op->x, op->y)) 1305 if (out_of_map (m, op->x, op->y))
1357 { 1306 {
1358 dump_object (op); 1307 char *dump = dump_object (op);
1359 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); 1308 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1360#ifdef MANY_CORES 1309#ifdef MANY_CORES
1361 /* Better to catch this here, as otherwise the next use of this object 1310 /* 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 1311 * is likely to cause a crash. Better to find out where it is getting
1363 * improperly inserted. 1312 * improperly inserted.
1364 */ 1313 */
1365 abort (); 1314 abort ();
1366#endif 1315#endif
1316 free (dump);
1367 return op; 1317 return op;
1368 } 1318 }
1369 1319
1370 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1320 if (!QUERY_FLAG (op, FLAG_REMOVED))
1371 { 1321 {
1372 dump_object (op); 1322 char *dump = dump_object (op);
1373 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); 1323 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1324 free (dump);
1374 return op; 1325 return op;
1375 } 1326 }
1376 1327
1377 if (op->more != NULL) 1328 if (op->more != NULL)
1378 { 1329 {
1815 tmp, * 1766 tmp, *
1816 otmp; 1767 otmp;
1817 1768
1818 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1769 if (!QUERY_FLAG (op, FLAG_REMOVED))
1819 { 1770 {
1820 dump_object (op); 1771 char *dump = dump_object (op);
1821 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); 1772 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1773 free (dump);
1822 return op; 1774 return op;
1823 } 1775 }
1824 1776
1825 if (where == NULL) 1777 if (where == NULL)
1826 { 1778 {
1827 dump_object (op); 1779 char *dump = dump_object (op);
1828 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); 1780 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1781 free (dump);
1829 return op; 1782 return op;
1830 } 1783 }
1831 1784
1832 if (where->head) 1785 if (where->head)
1833 { 1786 {
1933 */ 1886 */
1934 1887
1935int 1888int
1936check_move_on (object *op, object *originator) 1889check_move_on (object *op, object *originator)
1937{ 1890{
1938 object * 1891 object *tmp;
1939 tmp; 1892 maptile *m = op->map;
1940 tag_t
1941 tag;
1942 mapstruct *
1943 m = op->map;
1944 int
1945 x = op->x, y = op->y; 1893 int x = op->x, y = op->y;
1946 1894
1947 MoveType 1895 MoveType move_on, move_slow, move_block;
1948 move_on,
1949 move_slow,
1950 move_block;
1951 1896
1952 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1897 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1953 return 0; 1898 return 0;
1954
1955 tag = op->count;
1956 1899
1957 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1900 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); 1901 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); 1902 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1960 1903
2021 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1964 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)) 1965 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
2023 { 1966 {
2024 move_apply (tmp, op, originator); 1967 move_apply (tmp, op, originator);
2025 1968
2026 if (was_destroyed (op, tag)) 1969 if (op->destroyed ())
2027 return 1; 1970 return 1;
2028 1971
2029 /* what the person/creature stepped onto has moved the object 1972 /* what the person/creature stepped onto has moved the object
2030 * someplace new. Don't process any further - if we did, 1973 * someplace new. Don't process any further - if we did,
2031 * have a feeling strange problems would result. 1974 * have a feeling strange problems would result.
2043 * a matching archetype at the given map and coordinates. 1986 * a matching archetype at the given map and coordinates.
2044 * The first matching object is returned, or NULL if none. 1987 * The first matching object is returned, or NULL if none.
2045 */ 1988 */
2046 1989
2047object * 1990object *
2048present_arch (const archetype *at, mapstruct *m, int x, int y) 1991present_arch (const archetype *at, maptile *m, int x, int y)
2049{ 1992{
2050 object * 1993 object *
2051 tmp; 1994 tmp;
2052 1995
2053 if (m == NULL || out_of_map (m, x, y)) 1996 if (m == NULL || out_of_map (m, x, y))
2066 * a matching type variable at the given map and coordinates. 2009 * a matching type variable at the given map and coordinates.
2067 * The first matching object is returned, or NULL if none. 2010 * The first matching object is returned, or NULL if none.
2068 */ 2011 */
2069 2012
2070object * 2013object *
2071present (unsigned char type, mapstruct *m, int x, int y) 2014present (unsigned char type, maptile *m, int x, int y)
2072{ 2015{
2073 object * 2016 object *
2074 tmp; 2017 tmp;
2075 2018
2076 if (out_of_map (m, x, y)) 2019 if (out_of_map (m, x, y))
2216 * the archetype because that isn't correct if the monster has been 2159 * the archetype because that isn't correct if the monster has been
2217 * customized, changed states, etc. 2160 * customized, changed states, etc.
2218 */ 2161 */
2219 2162
2220int 2163int
2221find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2164find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2222{ 2165{
2223 int 2166 int
2224 i, 2167 i,
2225 index = 0, flag; 2168 index = 0, flag;
2226 static int 2169 static int
2247 return -1; 2190 return -1;
2248 return altern[RANDOM () % index]; 2191 return altern[RANDOM () % index];
2249} 2192}
2250 2193
2251/* 2194/*
2252 * find_first_free_spot(archetype, mapstruct, x, y) works like 2195 * find_first_free_spot(archetype, maptile, x, y) works like
2253 * find_free_spot(), but it will search max number of squares. 2196 * find_free_spot(), but it will search max number of squares.
2254 * But it will return the first available spot, not a random choice. 2197 * 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. 2198 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2256 */ 2199 */
2257 2200
2258int 2201int
2259find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2202find_first_free_spot (const object *ob, maptile *m, int x, int y)
2260{ 2203{
2261 int 2204 int
2262 i; 2205 i;
2263 2206
2264 for (i = 0; i < SIZEOFFREE; i++) 2207 for (i = 0; i < SIZEOFFREE; i++)
2328 * because we have to know what movement the thing looking to move 2271 * because we have to know what movement the thing looking to move
2329 * there is capable of. 2272 * there is capable of.
2330 */ 2273 */
2331 2274
2332int 2275int
2333find_dir (mapstruct *m, int x, int y, object *exclude) 2276find_dir (maptile *m, int x, int y, object *exclude)
2334{ 2277{
2335 int 2278 int
2336 i, 2279 i,
2337 max = SIZEOFFREE, mflags; 2280 max = SIZEOFFREE, mflags;
2338 2281
2339 sint16 nx, ny; 2282 sint16 nx, ny;
2340 object * 2283 object *
2341 tmp; 2284 tmp;
2342 mapstruct * 2285 maptile *
2343 mp; 2286 mp;
2344 2287
2345 MoveType blocked, move_type; 2288 MoveType blocked, move_type;
2346 2289
2347 if (exclude && exclude->head) 2290 if (exclude && exclude->head)
2555 * Modified to be map tile aware -.MSW 2498 * Modified to be map tile aware -.MSW
2556 */ 2499 */
2557 2500
2558 2501
2559int 2502int
2560can_see_monsterP (mapstruct *m, int x, int y, int dir) 2503can_see_monsterP (maptile *m, int x, int y, int dir)
2561{ 2504{
2562 sint16 dx, dy; 2505 sint16 dx, dy;
2563 int 2506 int
2564 mflags; 2507 mflags;
2565 2508
2645 if (prev) 2588 if (prev)
2646 prev->more = tmp; 2589 prev->more = tmp;
2647 prev = tmp; 2590 prev = tmp;
2648 } 2591 }
2649 2592
2650 /*** copy inventory ***/
2651 for (item = src->inv; item; item = item->below) 2593 for (item = src->inv; item; item = item->below)
2652 {
2653 (void) insert_ob_in_ob (object_create_clone (item), dst); 2594 insert_ob_in_ob (object_create_clone (item), dst);
2654 }
2655 2595
2656 return dst; 2596 return dst;
2657} 2597}
2658 2598
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. */ 2599/* 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 */ 2600/* 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, */ 2601/* 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. */ 2602/* 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. */ 2603/* Remember not to use load_object_str in a time-critical situation. */
2677
2678/* Also remember that multiparts objects are not supported for now. */ 2604/* Also remember that multiparts objects are not supported for now. */
2679 2605
2680object * 2606object *
2681load_object_str (const char *obstr) 2607load_object_str (const char *obstr)
2682{ 2608{
2683 object * 2609 object *op;
2684 op;
2685 char
2686 filename[MAX_BUF]; 2610 char filename[MAX_BUF];
2687 2611
2688 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); 2612 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2689 2613
2690 FILE *
2691 tempfile = fopen (filename, "w"); 2614 FILE *tempfile = fopen (filename, "w");
2692 2615
2693 if (tempfile == NULL) 2616 if (tempfile == NULL)
2694 { 2617 {
2695 LOG (llevError, "Error - Unable to access load object temp file\n"); 2618 LOG (llevError, "Error - Unable to access load object temp file\n");
2696 return NULL; 2619 return NULL;
2717 * returns NULL if no match. 2640 * returns NULL if no match.
2718 */ 2641 */
2719object * 2642object *
2720find_obj_by_type_subtype (const object *who, int type, int subtype) 2643find_obj_by_type_subtype (const object *who, int type, int subtype)
2721{ 2644{
2722 object * 2645 object *tmp;
2723 tmp;
2724 2646
2725 for (tmp = who->inv; tmp; tmp = tmp->below) 2647 for (tmp = who->inv; tmp; tmp = tmp->below)
2726 if (tmp->type == type && tmp->subtype == subtype) 2648 if (tmp->type == type && tmp->subtype == subtype)
2727 return tmp; 2649 return tmp;
2728 2650
2736 * do the desired thing. 2658 * do the desired thing.
2737 */ 2659 */
2738key_value * 2660key_value *
2739get_ob_key_link (const object *ob, const char *key) 2661get_ob_key_link (const object *ob, const char *key)
2740{ 2662{
2741 key_value * 2663 key_value *link;
2742 link;
2743 2664
2744 for (link = ob->key_values; link != NULL; link = link->next) 2665 for (link = ob->key_values; link != NULL; link = link->next)
2745 {
2746 if (link->key == key) 2666 if (link->key == key)
2747 {
2748 return link; 2667 return link;
2749 }
2750 }
2751 2668
2752 return NULL; 2669 return NULL;
2753} 2670}
2754 2671
2755/* 2672/*

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines