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.48 by root, Thu Sep 14 23:13:48 2006 UTC vs.
Revision 1.57 by root, Sun Dec 3 02:46: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 %s\n", 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;
489 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}
972 * 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
973 * free objects. The IS_FREED() flag is set in the object. 904 * free objects. The IS_FREED() flag is set in the object.
974 * The object must have been removed by remove_ob() first for 905 * The object must have been removed by remove_ob() first for
975 * this function to succeed. 906 * this function to succeed.
976 * 907 *
977 * 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
978 * inventory to the ground. 909 * inventory to the ground.
979 */ 910 */
980void object::free (bool free_inventory) 911void object::destroy (bool destroy_inventory)
981{ 912{
982 if (QUERY_FLAG (this, FLAG_FREED)) 913 if (QUERY_FLAG (this, FLAG_FREED))
983 return; 914 return;
984 915
985 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 916 if (QUERY_FLAG (this, FLAG_FRIENDLY))
990 921
991 SET_FLAG (this, FLAG_FREED); 922 SET_FLAG (this, FLAG_FREED);
992 923
993 if (more) 924 if (more)
994 { 925 {
995 more->free (free_inventory); 926 more->destroy (destroy_inventory);
996 more = 0; 927 more = 0;
997 } 928 }
998 929
999 if (inv) 930 if (inv)
1000 { 931 {
1001 /* Only if the space blocks everything do we not process - 932 /* Only if the space blocks everything do we not process -
1002 * if some form of movement is allowed, let objects 933 * if some form of movement is allowed, let objects
1003 * drop on that space. 934 * drop on that space.
1004 */ 935 */
1005 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)
1006 { 937 {
1007 object *op = inv; 938 object *op = inv;
1008 939
1009 while (op) 940 while (op)
1010 { 941 {
1011 object *tmp = op->below; 942 object *tmp = op->below;
1012 op->free (free_inventory); 943 op->destroy (destroy_inventory);
1013 op = tmp; 944 op = tmp;
1014 } 945 }
1015 } 946 }
1016 else 947 else
1017 { /* Put objects in inventory onto this space */ 948 { /* Put objects in inventory onto this space */
1036 op = tmp; 967 op = tmp;
1037 } 968 }
1038 } 969 }
1039 } 970 }
1040 971
972 // hack to ensure that freed objects still have a valid map
973 {
974 static maptile *freed_map; // freed objects are moved here to avoid crashes
975
976 if (!freed_map)
977 {
978 freed_map = new maptile;
979
980 freed_map->name = "/internal/freed_objects_map";
981 freed_map->width = 3;
982 freed_map->height = 3;
983
984 freed_map->allocate ();
985 }
986
987 map = freed_map;
988 x = 1;
989 y = 1;
990 }
991
1041 // clear those pointers that likely might have circular references to us 992 // clear those pointers that likely might have circular references to us
1042 owner = 0; 993 owner = 0;
1043 enemy = 0; 994 enemy = 0;
1044 attacked_by = 0; 995 attacked_by = 0;
996
997 // only relevant for players(?), but make sure of it anyways
998 contr = 0;
1045 999
1046 /* Remove object from the active list */ 1000 /* Remove object from the active list */
1047 speed = 0; 1001 speed = 0;
1048 update_ob_speed (this); 1002 update_ob_speed (this);
1049 1003
1084{ 1038{
1085 object *tmp, *last = 0; 1039 object *tmp, *last = 0;
1086 object *otmp; 1040 object *otmp;
1087 1041
1088 int check_walk_off; 1042 int check_walk_off;
1089 mapstruct *m; 1043 maptile *m;
1090 1044
1091 sint16 x, y; 1045 sint16 x, y;
1092 1046
1093 if (QUERY_FLAG (op, FLAG_REMOVED)) 1047 if (QUERY_FLAG (op, FLAG_REMOVED))
1094 return; 1048 return;
1173 * use translated coordinates in case some oddness with map tiling is 1127 * use translated coordinates in case some oddness with map tiling is
1174 * evident 1128 * evident
1175 */ 1129 */
1176 if (GET_MAP_OB (m, x, y) != op) 1130 if (GET_MAP_OB (m, x, y) != op)
1177 { 1131 {
1178 dump_object (op); 1132 char *dump = dump_object (op);
1179 LOG (llevError, 1133 LOG (llevError,
1180 "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); 1134 "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);
1135 free (dump);
1181 dump_object (GET_MAP_OB (m, x, y)); 1136 dump = dump_object (GET_MAP_OB (m, x, y));
1182 LOG (llevError, "%s\n", errmsg); 1137 LOG (llevError, "%s\n", dump);
1138 free (dump);
1183 } 1139 }
1184 1140
1185 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1141 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1186 } 1142 }
1187 1143
1213 1169
1214 tmp->contr->socket.update_look = 1; 1170 tmp->contr->socket.update_look = 1;
1215 } 1171 }
1216 1172
1217 /* See if player moving off should effect something */ 1173 /* See if player moving off should effect something */
1218 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1174 if (check_walk_off
1175 && ((op->move_type & tmp->move_off)
1176 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1219 { 1177 {
1220 move_apply (tmp, op, NULL); 1178 move_apply (tmp, op, NULL);
1221 1179
1222 if (op->destroyed ()); 1180 if (op->destroyed ())
1223 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); 1181 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1224 } 1182 }
1225 1183
1226 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1184 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1227 1185
1228 if (tmp->above == tmp) 1186 if (tmp->above == tmp)
1289/* 1247/*
1290 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1248 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1291 * job preparing multi-part monsters 1249 * job preparing multi-part monsters
1292 */ 1250 */
1293object * 1251object *
1294insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y) 1252insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1295{ 1253{
1296 object *tmp; 1254 object *tmp;
1297 1255
1298 if (op->head) 1256 if (op->head)
1299 op = op->head; 1257 op = op->head;
1327 * NULL if 'op' was destroyed 1285 * NULL if 'op' was destroyed
1328 * just 'op' otherwise 1286 * just 'op' otherwise
1329 */ 1287 */
1330 1288
1331object * 1289object *
1332insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1290insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1333{ 1291{
1334 object *tmp, *top, *floor = NULL; 1292 object *tmp, *top, *floor = NULL;
1335 sint16 x, y; 1293 sint16 x, y;
1336 1294
1337 if (QUERY_FLAG (op, FLAG_FREED)) 1295 if (QUERY_FLAG (op, FLAG_FREED))
1340 return NULL; 1298 return NULL;
1341 } 1299 }
1342 1300
1343 if (m == NULL) 1301 if (m == NULL)
1344 { 1302 {
1345 dump_object (op); 1303 char *dump = dump_object (op);
1346 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); 1304 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1305 free (dump);
1347 return op; 1306 return op;
1348 } 1307 }
1349 1308
1350 if (out_of_map (m, op->x, op->y)) 1309 if (out_of_map (m, op->x, op->y))
1351 { 1310 {
1352 dump_object (op); 1311 char *dump = dump_object (op);
1353 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); 1312 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1354#ifdef MANY_CORES 1313#ifdef MANY_CORES
1355 /* Better to catch this here, as otherwise the next use of this object 1314 /* Better to catch this here, as otherwise the next use of this object
1356 * is likely to cause a crash. Better to find out where it is getting 1315 * is likely to cause a crash. Better to find out where it is getting
1357 * improperly inserted. 1316 * improperly inserted.
1358 */ 1317 */
1359 abort (); 1318 abort ();
1360#endif 1319#endif
1320 free (dump);
1361 return op; 1321 return op;
1362 } 1322 }
1363 1323
1364 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1324 if (!QUERY_FLAG (op, FLAG_REMOVED))
1365 { 1325 {
1366 dump_object (op); 1326 char *dump = dump_object (op);
1367 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); 1327 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1328 free (dump);
1368 return op; 1329 return op;
1369 } 1330 }
1370 1331
1371 if (op->more != NULL) 1332 if (op->more != NULL)
1372 { 1333 {
1809 tmp, * 1770 tmp, *
1810 otmp; 1771 otmp;
1811 1772
1812 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1773 if (!QUERY_FLAG (op, FLAG_REMOVED))
1813 { 1774 {
1814 dump_object (op); 1775 char *dump = dump_object (op);
1815 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); 1776 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1777 free (dump);
1816 return op; 1778 return op;
1817 } 1779 }
1818 1780
1819 if (where == NULL) 1781 if (where == NULL)
1820 { 1782 {
1821 dump_object (op); 1783 char *dump = dump_object (op);
1822 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); 1784 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1785 free (dump);
1823 return op; 1786 return op;
1824 } 1787 }
1825 1788
1826 if (where->head) 1789 if (where->head)
1827 { 1790 {
1928 1891
1929int 1892int
1930check_move_on (object *op, object *originator) 1893check_move_on (object *op, object *originator)
1931{ 1894{
1932 object *tmp; 1895 object *tmp;
1933 mapstruct *m = op->map; 1896 maptile *m = op->map;
1934 int x = op->x, y = op->y; 1897 int x = op->x, y = op->y;
1935 1898
1936 MoveType move_on, move_slow, move_block; 1899 MoveType move_on, move_slow, move_block;
1937 1900
1938 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1901 if (QUERY_FLAG (op, FLAG_NO_APPLY))
2027 * a matching archetype at the given map and coordinates. 1990 * a matching archetype at the given map and coordinates.
2028 * The first matching object is returned, or NULL if none. 1991 * The first matching object is returned, or NULL if none.
2029 */ 1992 */
2030 1993
2031object * 1994object *
2032present_arch (const archetype *at, mapstruct *m, int x, int y) 1995present_arch (const archetype *at, maptile *m, int x, int y)
2033{ 1996{
2034 object * 1997 object *
2035 tmp; 1998 tmp;
2036 1999
2037 if (m == NULL || out_of_map (m, x, y)) 2000 if (m == NULL || out_of_map (m, x, y))
2050 * a matching type variable at the given map and coordinates. 2013 * a matching type variable at the given map and coordinates.
2051 * The first matching object is returned, or NULL if none. 2014 * The first matching object is returned, or NULL if none.
2052 */ 2015 */
2053 2016
2054object * 2017object *
2055present (unsigned char type, mapstruct *m, int x, int y) 2018present (unsigned char type, maptile *m, int x, int y)
2056{ 2019{
2057 object * 2020 object *
2058 tmp; 2021 tmp;
2059 2022
2060 if (out_of_map (m, x, y)) 2023 if (out_of_map (m, x, y))
2200 * the archetype because that isn't correct if the monster has been 2163 * the archetype because that isn't correct if the monster has been
2201 * customized, changed states, etc. 2164 * customized, changed states, etc.
2202 */ 2165 */
2203 2166
2204int 2167int
2205find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop) 2168find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2206{ 2169{
2207 int 2170 int
2208 i, 2171 i,
2209 index = 0, flag; 2172 index = 0, flag;
2210 static int 2173 static int
2231 return -1; 2194 return -1;
2232 return altern[RANDOM () % index]; 2195 return altern[RANDOM () % index];
2233} 2196}
2234 2197
2235/* 2198/*
2236 * find_first_free_spot(archetype, mapstruct, x, y) works like 2199 * find_first_free_spot(archetype, maptile, x, y) works like
2237 * find_free_spot(), but it will search max number of squares. 2200 * find_free_spot(), but it will search max number of squares.
2238 * But it will return the first available spot, not a random choice. 2201 * But it will return the first available spot, not a random choice.
2239 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2202 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2240 */ 2203 */
2241 2204
2242int 2205int
2243find_first_free_spot (const object *ob, mapstruct *m, int x, int y) 2206find_first_free_spot (const object *ob, maptile *m, int x, int y)
2244{ 2207{
2245 int 2208 int
2246 i; 2209 i;
2247 2210
2248 for (i = 0; i < SIZEOFFREE; i++) 2211 for (i = 0; i < SIZEOFFREE; i++)
2312 * because we have to know what movement the thing looking to move 2275 * because we have to know what movement the thing looking to move
2313 * there is capable of. 2276 * there is capable of.
2314 */ 2277 */
2315 2278
2316int 2279int
2317find_dir (mapstruct *m, int x, int y, object *exclude) 2280find_dir (maptile *m, int x, int y, object *exclude)
2318{ 2281{
2319 int 2282 int
2320 i, 2283 i,
2321 max = SIZEOFFREE, mflags; 2284 max = SIZEOFFREE, mflags;
2322 2285
2323 sint16 nx, ny; 2286 sint16 nx, ny;
2324 object * 2287 object *
2325 tmp; 2288 tmp;
2326 mapstruct * 2289 maptile *
2327 mp; 2290 mp;
2328 2291
2329 MoveType blocked, move_type; 2292 MoveType blocked, move_type;
2330 2293
2331 if (exclude && exclude->head) 2294 if (exclude && exclude->head)
2539 * Modified to be map tile aware -.MSW 2502 * Modified to be map tile aware -.MSW
2540 */ 2503 */
2541 2504
2542 2505
2543int 2506int
2544can_see_monsterP (mapstruct *m, int x, int y, int dir) 2507can_see_monsterP (maptile *m, int x, int y, int dir)
2545{ 2508{
2546 sint16 dx, dy; 2509 sint16 dx, dy;
2547 int 2510 int
2548 mflags; 2511 mflags;
2549 2512

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines