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. */ |
… | |
… | |
35 | |
34 | |
36 | int nrofallocobjects = 0; |
35 | int nrofallocobjects = 0; |
37 | static UUID uuid; |
36 | static UUID uuid; |
38 | const uint64 UUID_SKIP = 1<<19; |
37 | const uint64 UUID_SKIP = 1<<19; |
39 | |
38 | |
40 | object *objects; /* Pointer to the list of used objects */ |
|
|
41 | object *active_objects; /* List of active objects that need to be processed */ |
39 | object *active_objects; /* List of active objects that need to be processed */ |
42 | |
40 | |
43 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
41 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
42 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
43 | }; |
… | |
… | |
447 | void |
445 | void |
448 | dump_all_objects (void) |
446 | dump_all_objects (void) |
449 | { |
447 | { |
450 | object *op; |
448 | object *op; |
451 | |
449 | |
452 | for (op = objects; op != NULL; op = op->next) |
450 | for (op = object::first; op != NULL; op = op->next) |
453 | { |
451 | { |
454 | dump_object (op); |
452 | dump_object (op); |
455 | fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg); |
453 | fprintf (logfile, "Object %s\n", errmsg); |
456 | } |
454 | } |
457 | } |
455 | } |
458 | |
456 | |
459 | /* |
457 | /* |
460 | * get_nearest_part(multi-object, object 2) returns the part of the |
458 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
483 | object * |
481 | object * |
484 | find_object (tag_t i) |
482 | find_object (tag_t i) |
485 | { |
483 | { |
486 | object *op; |
484 | object *op; |
487 | |
485 | |
488 | for (op = objects; op != NULL; op = op->next) |
486 | for (op = object::first; op != NULL; op = op->next) |
489 | if (op->count == i) |
487 | if (op->count == i) |
490 | break; |
488 | break; |
|
|
489 | |
491 | return op; |
490 | return op; |
492 | } |
491 | } |
493 | |
492 | |
494 | /* |
493 | /* |
495 | * Returns the first object which has a name equal to the argument. |
494 | * Returns the first object which has a name equal to the argument. |
… | |
… | |
501 | find_object_name (const char *str) |
500 | find_object_name (const char *str) |
502 | { |
501 | { |
503 | shstr_cmp str_ (str); |
502 | shstr_cmp str_ (str); |
504 | object *op; |
503 | object *op; |
505 | |
504 | |
506 | for (op = objects; op != NULL; op = op->next) |
505 | for (op = object::first; op != NULL; op = op->next) |
507 | if (op->name == str_) |
506 | if (op->name == str_) |
508 | break; |
507 | break; |
509 | |
508 | |
510 | return op; |
509 | return op; |
511 | } |
510 | } |
… | |
… | |
895 | |
894 | |
896 | if (op->more != NULL) |
895 | if (op->more != NULL) |
897 | update_object (op->more, action); |
896 | update_object (op->more, action); |
898 | } |
897 | } |
899 | |
898 | |
900 | static unordered_vector<object *> mortals; |
899 | object::vector object::mortals; |
|
|
900 | object::vector object::objects; // not yet used |
|
|
901 | object *object::first; |
901 | |
902 | |
902 | void object::free_mortals () |
903 | void object::free_mortals () |
903 | { |
904 | { |
904 | for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();) |
905 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
905 | if ((*i)->refcnt) |
906 | if ((*i)->refcnt) |
906 | ++i; // further delay freeing |
907 | ++i; // further delay freeing |
907 | else |
908 | else |
908 | { |
909 | { |
909 | delete *i; |
910 | delete *i; |
910 | mortals.erase (i); |
911 | mortals.erase (i); |
911 | } |
912 | } |
912 | |
913 | |
913 | static int lastmortals = 0;//D |
914 | static int lastmortals = 0;//D |
914 | |
915 | |
915 | if (mortals.size() != lastmortals)//D |
916 | if (mortals.size() != lastmortals && lastmortals > 100)//D |
916 | { |
917 | { |
917 | lastmortals = mortals.size ();//D |
918 | lastmortals = mortals.size ();//D |
918 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
919 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
919 | } |
920 | } |
920 | } |
921 | } |
… | |
… | |
936 | { |
937 | { |
937 | count = ++ob_count; |
938 | count = ++ob_count; |
938 | uuid = gen_uuid (); |
939 | uuid = gen_uuid (); |
939 | |
940 | |
940 | prev = 0; |
941 | prev = 0; |
941 | next = objects; |
942 | next = object::first; |
942 | |
943 | |
943 | if (objects) |
944 | if (object::first) |
944 | objects->prev = this; |
945 | object::first->prev = this; |
945 | |
946 | |
946 | objects = this; |
947 | object::first = this; |
947 | } |
948 | } |
948 | |
949 | |
949 | void object::unlink () |
950 | void object::unlink () |
950 | { |
951 | { |
951 | //count = 0;//D |
|
|
952 | if (!prev && !next) return;//D |
|
|
953 | |
|
|
954 | if (this == objects) |
952 | if (this == object::first) |
955 | objects = next; |
953 | object::first = next; |
956 | |
954 | |
957 | /* Remove this object from the list of used objects */ |
955 | /* Remove this object from the list of used objects */ |
958 | if (prev) prev->next = next; |
956 | if (prev) prev->next = next; |
959 | if (next) next->prev = prev; |
957 | if (next) next->prev = prev; |
960 | |
958 | |
… | |
… | |
1063 | sub_weight (object *op, signed long weight) |
1061 | sub_weight (object *op, signed long weight) |
1064 | { |
1062 | { |
1065 | while (op != NULL) |
1063 | while (op != NULL) |
1066 | { |
1064 | { |
1067 | if (op->type == CONTAINER) |
1065 | if (op->type == CONTAINER) |
1068 | { |
|
|
1069 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1066 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
1070 | } |
1067 | |
1071 | op->carrying -= weight; |
1068 | op->carrying -= weight; |
1072 | op = op->env; |
1069 | op = op->env; |
1073 | } |
1070 | } |
1074 | } |
1071 | } |
1075 | |
1072 | |
… | |
… | |
1083 | */ |
1080 | */ |
1084 | |
1081 | |
1085 | void |
1082 | void |
1086 | remove_ob (object *op) |
1083 | remove_ob (object *op) |
1087 | { |
1084 | { |
|
|
1085 | object *tmp, *last = 0; |
1088 | object * |
1086 | object *otmp; |
1089 | tmp, * |
|
|
1090 | last = NULL; |
|
|
1091 | object * |
|
|
1092 | otmp; |
|
|
1093 | |
1087 | |
1094 | tag_t |
|
|
1095 | tag; |
|
|
1096 | int |
|
|
1097 | check_walk_off; |
1088 | int check_walk_off; |
1098 | mapstruct * |
1089 | maptile *m; |
1099 | m; |
|
|
1100 | |
1090 | |
1101 | sint16 |
1091 | sint16 x, y; |
1102 | x, |
|
|
1103 | y; |
|
|
1104 | |
1092 | |
1105 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1093 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1106 | return; |
1094 | return; |
1107 | |
1095 | |
1108 | SET_FLAG (op, FLAG_REMOVED); |
1096 | SET_FLAG (op, FLAG_REMOVED); |
… | |
… | |
1201 | op->below = 0; |
1189 | op->below = 0; |
1202 | |
1190 | |
1203 | if (op->map->in_memory == MAP_SAVING) |
1191 | if (op->map->in_memory == MAP_SAVING) |
1204 | return; |
1192 | return; |
1205 | |
1193 | |
1206 | tag = op->count; |
|
|
1207 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1194 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1208 | |
1195 | |
1209 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1196 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1210 | { |
1197 | { |
1211 | /* No point updating the players look faces if he is the object |
1198 | /* No point updating the players look faces if he is the object |
… | |
… | |
1226 | |
1213 | |
1227 | tmp->contr->socket.update_look = 1; |
1214 | tmp->contr->socket.update_look = 1; |
1228 | } |
1215 | } |
1229 | |
1216 | |
1230 | /* See if player moving off should effect something */ |
1217 | /* See if player moving off should effect something */ |
1231 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1218 | if (check_walk_off |
|
|
1219 | && ((op->move_type & tmp->move_off) |
|
|
1220 | && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1232 | { |
1221 | { |
1233 | move_apply (tmp, op, NULL); |
1222 | move_apply (tmp, op, NULL); |
1234 | |
1223 | |
1235 | if (was_destroyed (op, tag)) |
1224 | if (op->destroyed ()) |
1236 | { |
|
|
1237 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
1225 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1238 | } |
|
|
1239 | } |
1226 | } |
1240 | |
1227 | |
1241 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1228 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1242 | |
1229 | |
1243 | if (tmp->above == tmp) |
1230 | if (tmp->above == tmp) |
… | |
… | |
1296 | free_object (op); |
1283 | free_object (op); |
1297 | return top; |
1284 | return top; |
1298 | } |
1285 | } |
1299 | } |
1286 | } |
1300 | |
1287 | |
1301 | return NULL; |
1288 | return 0; |
1302 | } |
1289 | } |
1303 | |
1290 | |
1304 | /* |
1291 | /* |
1305 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1292 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1306 | * job preparing multi-part monsters |
1293 | * job preparing multi-part monsters |
1307 | */ |
1294 | */ |
1308 | object * |
1295 | object * |
1309 | insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) |
1296 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1310 | { |
1297 | { |
1311 | object *tmp; |
1298 | object *tmp; |
1312 | |
1299 | |
1313 | if (op->head) |
1300 | if (op->head) |
1314 | op = op->head; |
1301 | op = op->head; |
… | |
… | |
1342 | * NULL if 'op' was destroyed |
1329 | * NULL if 'op' was destroyed |
1343 | * just 'op' otherwise |
1330 | * just 'op' otherwise |
1344 | */ |
1331 | */ |
1345 | |
1332 | |
1346 | object * |
1333 | object * |
1347 | insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) |
1334 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1348 | { |
1335 | { |
1349 | object *tmp, *top, *floor = NULL; |
1336 | object *tmp, *top, *floor = NULL; |
1350 | sint16 x, y; |
1337 | sint16 x, y; |
1351 | |
1338 | |
1352 | if (QUERY_FLAG (op, FLAG_FREED)) |
1339 | if (QUERY_FLAG (op, FLAG_FREED)) |
… | |
… | |
1633 | remove_ob (tmp); |
1620 | remove_ob (tmp); |
1634 | free_object (tmp); |
1621 | free_object (tmp); |
1635 | } |
1622 | } |
1636 | } |
1623 | } |
1637 | |
1624 | |
1638 | tmp1 = arch_to_object (find_archetype (arch_string)); |
1625 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1639 | |
1626 | |
1640 | tmp1->x = op->x; |
1627 | tmp1->x = op->x; |
1641 | tmp1->y = op->y; |
1628 | tmp1->y = op->y; |
1642 | insert_ob_in_map (tmp1, op->map, op, 0); |
1629 | insert_ob_in_map (tmp1, op->map, op, 0); |
1643 | } |
1630 | } |
… | |
… | |
1942 | */ |
1929 | */ |
1943 | |
1930 | |
1944 | int |
1931 | int |
1945 | check_move_on (object *op, object *originator) |
1932 | check_move_on (object *op, object *originator) |
1946 | { |
1933 | { |
1947 | object * |
1934 | object *tmp; |
1948 | tmp; |
1935 | maptile *m = op->map; |
1949 | tag_t |
|
|
1950 | tag; |
|
|
1951 | mapstruct * |
|
|
1952 | m = op->map; |
|
|
1953 | int |
|
|
1954 | x = op->x, y = op->y; |
1936 | int x = op->x, y = op->y; |
1955 | |
1937 | |
1956 | MoveType |
1938 | MoveType move_on, move_slow, move_block; |
1957 | move_on, |
|
|
1958 | move_slow, |
|
|
1959 | move_block; |
|
|
1960 | |
1939 | |
1961 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1940 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1962 | return 0; |
1941 | return 0; |
1963 | |
|
|
1964 | tag = op->count; |
|
|
1965 | |
1942 | |
1966 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1943 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1967 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1944 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1968 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1945 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1969 | |
1946 | |
… | |
… | |
2030 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2007 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
2031 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2008 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
2032 | { |
2009 | { |
2033 | move_apply (tmp, op, originator); |
2010 | move_apply (tmp, op, originator); |
2034 | |
2011 | |
2035 | if (was_destroyed (op, tag)) |
2012 | if (op->destroyed ()) |
2036 | return 1; |
2013 | return 1; |
2037 | |
2014 | |
2038 | /* what the person/creature stepped onto has moved the object |
2015 | /* what the person/creature stepped onto has moved the object |
2039 | * someplace new. Don't process any further - if we did, |
2016 | * someplace new. Don't process any further - if we did, |
2040 | * have a feeling strange problems would result. |
2017 | * have a feeling strange problems would result. |
… | |
… | |
2052 | * a matching archetype at the given map and coordinates. |
2029 | * a matching archetype at the given map and coordinates. |
2053 | * The first matching object is returned, or NULL if none. |
2030 | * The first matching object is returned, or NULL if none. |
2054 | */ |
2031 | */ |
2055 | |
2032 | |
2056 | object * |
2033 | object * |
2057 | present_arch (const archetype *at, mapstruct *m, int x, int y) |
2034 | present_arch (const archetype *at, maptile *m, int x, int y) |
2058 | { |
2035 | { |
2059 | object * |
2036 | object * |
2060 | tmp; |
2037 | tmp; |
2061 | |
2038 | |
2062 | if (m == NULL || out_of_map (m, x, y)) |
2039 | if (m == NULL || out_of_map (m, x, y)) |
… | |
… | |
2075 | * a matching type variable at the given map and coordinates. |
2052 | * a matching type variable at the given map and coordinates. |
2076 | * The first matching object is returned, or NULL if none. |
2053 | * The first matching object is returned, or NULL if none. |
2077 | */ |
2054 | */ |
2078 | |
2055 | |
2079 | object * |
2056 | object * |
2080 | present (unsigned char type, mapstruct *m, int x, int y) |
2057 | present (unsigned char type, maptile *m, int x, int y) |
2081 | { |
2058 | { |
2082 | object * |
2059 | object * |
2083 | tmp; |
2060 | tmp; |
2084 | |
2061 | |
2085 | if (out_of_map (m, x, y)) |
2062 | if (out_of_map (m, x, y)) |
… | |
… | |
2225 | * the archetype because that isn't correct if the monster has been |
2202 | * the archetype because that isn't correct if the monster has been |
2226 | * customized, changed states, etc. |
2203 | * customized, changed states, etc. |
2227 | */ |
2204 | */ |
2228 | |
2205 | |
2229 | int |
2206 | int |
2230 | find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) |
2207 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2231 | { |
2208 | { |
2232 | int |
2209 | int |
2233 | i, |
2210 | i, |
2234 | index = 0, flag; |
2211 | index = 0, flag; |
2235 | static int |
2212 | static int |
… | |
… | |
2256 | return -1; |
2233 | return -1; |
2257 | return altern[RANDOM () % index]; |
2234 | return altern[RANDOM () % index]; |
2258 | } |
2235 | } |
2259 | |
2236 | |
2260 | /* |
2237 | /* |
2261 | * find_first_free_spot(archetype, mapstruct, x, y) works like |
2238 | * find_first_free_spot(archetype, maptile, x, y) works like |
2262 | * find_free_spot(), but it will search max number of squares. |
2239 | * find_free_spot(), but it will search max number of squares. |
2263 | * But it will return the first available spot, not a random choice. |
2240 | * But it will return the first available spot, not a random choice. |
2264 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2241 | * Changed 0.93.2: Have it return -1 if there is no free spot available. |
2265 | */ |
2242 | */ |
2266 | |
2243 | |
2267 | int |
2244 | int |
2268 | find_first_free_spot (const object *ob, mapstruct *m, int x, int y) |
2245 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2269 | { |
2246 | { |
2270 | int |
2247 | int |
2271 | i; |
2248 | i; |
2272 | |
2249 | |
2273 | for (i = 0; i < SIZEOFFREE; i++) |
2250 | for (i = 0; i < SIZEOFFREE; i++) |
… | |
… | |
2337 | * because we have to know what movement the thing looking to move |
2314 | * because we have to know what movement the thing looking to move |
2338 | * there is capable of. |
2315 | * there is capable of. |
2339 | */ |
2316 | */ |
2340 | |
2317 | |
2341 | int |
2318 | int |
2342 | find_dir (mapstruct *m, int x, int y, object *exclude) |
2319 | find_dir (maptile *m, int x, int y, object *exclude) |
2343 | { |
2320 | { |
2344 | int |
2321 | int |
2345 | i, |
2322 | i, |
2346 | max = SIZEOFFREE, mflags; |
2323 | max = SIZEOFFREE, mflags; |
2347 | |
2324 | |
2348 | sint16 nx, ny; |
2325 | sint16 nx, ny; |
2349 | object * |
2326 | object * |
2350 | tmp; |
2327 | tmp; |
2351 | mapstruct * |
2328 | maptile * |
2352 | mp; |
2329 | mp; |
2353 | |
2330 | |
2354 | MoveType blocked, move_type; |
2331 | MoveType blocked, move_type; |
2355 | |
2332 | |
2356 | if (exclude && exclude->head) |
2333 | if (exclude && exclude->head) |
… | |
… | |
2564 | * Modified to be map tile aware -.MSW |
2541 | * Modified to be map tile aware -.MSW |
2565 | */ |
2542 | */ |
2566 | |
2543 | |
2567 | |
2544 | |
2568 | int |
2545 | int |
2569 | can_see_monsterP (mapstruct *m, int x, int y, int dir) |
2546 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2570 | { |
2547 | { |
2571 | sint16 dx, dy; |
2548 | sint16 dx, dy; |
2572 | int |
2549 | int |
2573 | mflags; |
2550 | mflags; |
2574 | |
2551 | |
… | |
… | |
2654 | if (prev) |
2631 | if (prev) |
2655 | prev->more = tmp; |
2632 | prev->more = tmp; |
2656 | prev = tmp; |
2633 | prev = tmp; |
2657 | } |
2634 | } |
2658 | |
2635 | |
2659 | /*** copy inventory ***/ |
|
|
2660 | for (item = src->inv; item; item = item->below) |
2636 | for (item = src->inv; item; item = item->below) |
2661 | { |
|
|
2662 | (void) insert_ob_in_ob (object_create_clone (item), dst); |
2637 | insert_ob_in_ob (object_create_clone (item), dst); |
2663 | } |
|
|
2664 | |
2638 | |
2665 | return dst; |
2639 | return dst; |
2666 | } |
2640 | } |
2667 | |
2641 | |
2668 | /* return true if the object was destroyed, 0 otherwise */ |
|
|
2669 | int |
|
|
2670 | was_destroyed (const object *op, tag_t old_tag) |
|
|
2671 | { |
|
|
2672 | /* checking for FLAG_FREED isn't necessary, but makes this function more |
|
|
2673 | * robust */ |
|
|
2674 | return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED); |
|
|
2675 | } |
|
|
2676 | |
|
|
2677 | /* GROS - Creates an object using a string representing its content. */ |
2642 | /* GROS - Creates an object using a string representing its content. */ |
2678 | |
|
|
2679 | /* Basically, we save the content of the string to a temp file, then call */ |
2643 | /* Basically, we save the content of the string to a temp file, then call */ |
2680 | |
|
|
2681 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2644 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
2682 | |
|
|
2683 | /* but it was simple to make and allows reusing the load_object function. */ |
2645 | /* but it was simple to make and allows reusing the load_object function. */ |
2684 | |
|
|
2685 | /* Remember not to use load_object_str in a time-critical situation. */ |
2646 | /* Remember not to use load_object_str in a time-critical situation. */ |
2686 | |
|
|
2687 | /* Also remember that multiparts objects are not supported for now. */ |
2647 | /* Also remember that multiparts objects are not supported for now. */ |
2688 | |
2648 | |
2689 | object * |
2649 | object * |
2690 | load_object_str (const char *obstr) |
2650 | load_object_str (const char *obstr) |
2691 | { |
2651 | { |
2692 | object * |
2652 | object *op; |
2693 | op; |
|
|
2694 | char |
|
|
2695 | filename[MAX_BUF]; |
2653 | char filename[MAX_BUF]; |
2696 | |
2654 | |
2697 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2655 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
2698 | |
2656 | |
2699 | FILE * |
|
|
2700 | tempfile = fopen (filename, "w"); |
2657 | FILE *tempfile = fopen (filename, "w"); |
2701 | |
2658 | |
2702 | if (tempfile == NULL) |
2659 | if (tempfile == NULL) |
2703 | { |
2660 | { |
2704 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2661 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
2705 | return NULL; |
2662 | return NULL; |
… | |
… | |
2726 | * returns NULL if no match. |
2683 | * returns NULL if no match. |
2727 | */ |
2684 | */ |
2728 | object * |
2685 | object * |
2729 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2686 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2730 | { |
2687 | { |
2731 | object * |
2688 | object *tmp; |
2732 | tmp; |
|
|
2733 | |
2689 | |
2734 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2690 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2735 | if (tmp->type == type && tmp->subtype == subtype) |
2691 | if (tmp->type == type && tmp->subtype == subtype) |
2736 | return tmp; |
2692 | return tmp; |
2737 | |
2693 | |
… | |
… | |
2745 | * do the desired thing. |
2701 | * do the desired thing. |
2746 | */ |
2702 | */ |
2747 | key_value * |
2703 | key_value * |
2748 | get_ob_key_link (const object *ob, const char *key) |
2704 | get_ob_key_link (const object *ob, const char *key) |
2749 | { |
2705 | { |
2750 | key_value * |
2706 | key_value *link; |
2751 | link; |
|
|
2752 | |
2707 | |
2753 | for (link = ob->key_values; link != NULL; link = link->next) |
2708 | for (link = ob->key_values; link != NULL; link = link->next) |
2754 | { |
|
|
2755 | if (link->key == key) |
2709 | if (link->key == key) |
2756 | { |
|
|
2757 | return link; |
2710 | return link; |
2758 | } |
|
|
2759 | } |
|
|
2760 | |
2711 | |
2761 | return NULL; |
2712 | return NULL; |
2762 | } |
2713 | } |
2763 | |
2714 | |
2764 | /* |
2715 | /* |