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.112 by root, Mon Jan 8 14:11:04 2007 UTC vs.
Revision 1.136 by root, Thu Mar 15 14:23:02 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 7 *
8 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 21 *
22 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
23*/ 23 */
24 24
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 27 variable. */
28#include <global.h> 28#include <global.h>
… …
357/* 357/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 359 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 360 * The result of the dump is stored in the static global errmsg array.
361 */ 361 */
362
363char * 362char *
364dump_object (object *op) 363dump_object (object *op)
365{ 364{
366 if (!op) 365 if (!op)
367 return strdup ("[NULLOBJ]"); 366 return strdup ("[NULLOBJ]");
368 367
369 object_freezer freezer; 368 object_freezer freezer;
370 save_object (freezer, op, 1); 369 op->write (freezer);
371 return freezer.as_string (); 370 return freezer.as_string ();
372} 371}
373 372
374/* 373/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 374 * get_nearest_part(multi-object, object 2) returns the part of the
… …
489 488
490 if (is_removed) 489 if (is_removed)
491 SET_FLAG (dst, FLAG_REMOVED); 490 SET_FLAG (dst, FLAG_REMOVED);
492 491
493 if (speed < 0) 492 if (speed < 0)
494 dst->speed_left = speed_left - RANDOM () % 200 / 100.0; 493 dst->speed_left = speed_left - rndm ();
495 494
496 /* Copy over key_values, if any. */ 495 /* Copy over key_values, if any. */
497 if (key_values) 496 if (key_values)
498 { 497 {
499 key_value *tail = 0; 498 key_value *tail = 0;
… …
522 } 521 }
523 } 522 }
524 } 523 }
525 524
526 dst->set_speed (dst->speed); 525 dst->set_speed (dst->speed);
526}
527
528void
529object::instantiate ()
530{
531 if (!uuid.seq) // HACK
532 uuid = gen_uuid ();
533
534 speed_left = -0.1f;
535 /* copy the body_info to the body_used - this is only really
536 * need for monsters, but doesn't hurt to do it for everything.
537 * by doing so, when a monster is created, it has good starting
538 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped.
540 */
541 memcpy (body_used, body_info, sizeof (body_used));
542
543 attachable::instantiate ();
527} 544}
528 545
529object * 546object *
530object::clone () 547object::clone ()
531{ 548{
… …
589 * UP_OBJ_FACE: only the objects face has changed. 606 * UP_OBJ_FACE: only the objects face has changed.
590 */ 607 */
591void 608void
592update_object (object *op, int action) 609update_object (object *op, int action)
593{ 610{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 611 if (op == NULL)
597 { 612 {
598 /* this should never happen */ 613 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 614 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 615 return;
… …
660 675
661 if (op->more) 676 if (op->more)
662 update_object (op->more, action); 677 update_object (op->more, action);
663} 678}
664 679
665object *object::first;
666
667object::object () 680object::object ()
668{ 681{
669 SET_FLAG (this, FLAG_REMOVED); 682 SET_FLAG (this, FLAG_REMOVED);
670 683
671 expmul = 1.0; 684 expmul = 1.0;
672 face = blank_face; 685 face = blank_face;
673} 686}
674 687
675object::~object () 688object::~object ()
676{ 689{
690 unlink ();
691
677 free_key_values (this); 692 free_key_values (this);
678} 693}
679 694
680static int object_count; 695static int object_count;
681 696
… …
689 objects.insert (this); 704 objects.insert (this);
690} 705}
691 706
692void object::unlink () 707void object::unlink ()
693{ 708{
694 assert (index);//D 709 if (!index)
710 return;
711
695 objects.erase (this); 712 objects.erase (this);
696 refcnt_dec (); 713 refcnt_dec ();
697} 714}
698 715
699void 716void
… …
773 * drop on that space. 790 * drop on that space.
774 */ 791 */
775 if (!drop_to_ground 792 if (!drop_to_ground
776 || !map 793 || !map
777 || map->in_memory != MAP_IN_MEMORY 794 || map->in_memory != MAP_IN_MEMORY
795 || map->nodrop
778 || ms ().move_block == MOVE_ALL) 796 || ms ().move_block == MOVE_ALL)
779 { 797 {
780 while (inv) 798 while (inv)
781 { 799 {
782 inv->destroy_inv (drop_to_ground); 800 inv->destroy_inv (drop_to_ground);
… …
816 834
817 if (flag [FLAG_IS_LINKED]) 835 if (flag [FLAG_IS_LINKED])
818 remove_button_link (this); 836 remove_button_link (this);
819 837
820 if (flag [FLAG_FRIENDLY]) 838 if (flag [FLAG_FRIENDLY])
839 {
821 remove_friendly_object (this); 840 remove_friendly_object (this);
841
842 if (type == GOLEM
843 && owner
844 && owner->type == PLAYER
845 && owner->contr->ranges[range_golem] == this)
846 owner->contr->ranges[range_golem] = 0;
847 }
822 848
823 if (!flag [FLAG_REMOVED]) 849 if (!flag [FLAG_REMOVED])
824 remove (); 850 remove ();
825 851
826 destroy_inv (true); 852 destroy_inv (true);
… …
898 * This function removes the object op from the linked list of objects 924 * This function removes the object op from the linked list of objects
899 * which it is currently tied to. When this function is done, the 925 * which it is currently tied to. When this function is done, the
900 * object will have no environment. If the object previously had an 926 * object will have no environment. If the object previously had an
901 * environment, the x and y coordinates will be updated to 927 * environment, the x and y coordinates will be updated to
902 * the previous environment. 928 * the previous environment.
903 * Beware: This function is called from the editor as well!
904 */ 929 */
905void 930void
906object::remove () 931object::do_remove ()
907{ 932{
908 object *tmp, *last = 0; 933 object *tmp, *last = 0;
909 object *otmp; 934 object *otmp;
910 935
911 if (QUERY_FLAG (this, FLAG_REMOVED)) 936 if (QUERY_FLAG (this, FLAG_REMOVED))
… …
954 } 979 }
955 else if (map) 980 else if (map)
956 { 981 {
957 if (type == PLAYER) 982 if (type == PLAYER)
958 { 983 {
984 // leaving a spot always closes any open container on the ground
985 if (container && !container->env)
986 // this causes spurious floorbox updates, but it ensures
987 // that the CLOSE event is being sent.
988 close_container ();
989
959 --map->players; 990 --map->players;
960 map->touch (); 991 map->touch ();
961 } 992 }
962 993
963 map->dirty = true; 994 map->dirty = true;
995 mapspace &ms = this->ms ();
964 996
965 /* link the object above us */ 997 /* link the object above us */
966 if (above) 998 if (above)
967 above->below = below; 999 above->below = below;
968 else 1000 else
969 map->at (x, y).top = below; /* we were top, set new top */ 1001 ms.top = below; /* we were top, set new top */
970 1002
971 /* Relink the object below us, if there is one */ 1003 /* Relink the object below us, if there is one */
972 if (below) 1004 if (below)
973 below->above = above; 1005 below->above = above;
974 else 1006 else
… …
976 /* Nothing below, which means we need to relink map object for this space 1008 /* Nothing below, which means we need to relink map object for this space
977 * use translated coordinates in case some oddness with map tiling is 1009 * use translated coordinates in case some oddness with map tiling is
978 * evident 1010 * evident
979 */ 1011 */
980 if (GET_MAP_OB (map, x, y) != this) 1012 if (GET_MAP_OB (map, x, y) != this)
981 {
982 char *dump = dump_object (this);
983 LOG (llevError,
984 "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); 1013 LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ());
985 free (dump);
986 dump = dump_object (GET_MAP_OB (map, x, y));
987 LOG (llevError, "%s\n", dump);
988 free (dump);
989 }
990 1014
991 map->at (x, y).bot = above; /* goes on above it. */ 1015 ms.bot = above; /* goes on above it. */
992 } 1016 }
993 1017
994 above = 0; 1018 above = 0;
995 below = 0; 1019 below = 0;
996 1020
997 if (map->in_memory == MAP_SAVING) 1021 if (map->in_memory == MAP_SAVING)
998 return; 1022 return;
999 1023
1000 int check_walk_off = !flag [FLAG_NO_APPLY]; 1024 int check_walk_off = !flag [FLAG_NO_APPLY];
1001 1025
1002 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) 1026 for (tmp = ms.bot; tmp; tmp = tmp->above)
1003 { 1027 {
1004 /* No point updating the players look faces if he is the object 1028 /* No point updating the players look faces if he is the object
1005 * being removed. 1029 * being removed.
1006 */ 1030 */
1007 1031
… …
1088 1112
1089 return 0; 1113 return 0;
1090} 1114}
1091 1115
1092/* 1116/*
1093 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1117 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1094 * job preparing multi-part monsters 1118 * job preparing multi-part monsters.
1095 */ 1119 */
1096object * 1120object *
1097insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1121insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1098{ 1122{
1099 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1123 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
… …
1127 */ 1151 */
1128object * 1152object *
1129insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1130{ 1154{
1131 object *tmp, *top, *floor = NULL; 1155 object *tmp, *top, *floor = NULL;
1132 sint16 x, y;
1133 1156
1134 if (QUERY_FLAG (op, FLAG_FREED)) 1157 if (QUERY_FLAG (op, FLAG_FREED))
1135 { 1158 {
1136 LOG (llevError, "Trying to insert freed object!\n"); 1159 LOG (llevError, "Trying to insert freed object!\n");
1137 return NULL; 1160 return NULL;
1138 } 1161 }
1162
1163 if (!QUERY_FLAG (op, FLAG_REMOVED))
1164 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1165
1166 op->remove ();
1139 1167
1140 if (!m) 1168 if (!m)
1141 { 1169 {
1142 char *dump = dump_object (op); 1170 char *dump = dump_object (op);
1143 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
… …
1158#endif 1186#endif
1159 free (dump); 1187 free (dump);
1160 return op; 1188 return op;
1161 } 1189 }
1162 1190
1163 if (!QUERY_FLAG (op, FLAG_REMOVED))
1164 {
1165 char *dump = dump_object (op);
1166 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1167 free (dump);
1168 return op;
1169 }
1170
1171 if (op->more)
1172 {
1173 /* The part may be on a different map. */
1174
1175 object *more = op->more; 1191 if (object *more = op->more)
1176 1192 {
1177 /* We really need the caller to normalise coordinates - if
1178 * we set the map, that doesn't work if the location is within
1179 * a map and this is straddling an edge. So only if coordinate
1180 * is clear wrong do we normalise it.
1181 */
1182 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1183 more->map = get_map_from_coord (m, &more->x, &more->y);
1184 else if (!more->map)
1185 {
1186 /* For backwards compatibility - when not dealing with tiled maps,
1187 * more->map should always point to the parent.
1188 */
1189 more->map = m;
1190 }
1191
1192 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1193 if (!insert_ob_in_map (more, m, originator, flag))
1193 { 1194 {
1194 if (!op->head) 1195 if (!op->head)
1195 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1196 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1196 1197
1197 return 0; 1198 return 0;
… …
1202 1203
1203 /* Ideally, the caller figures this out. However, it complicates a lot 1204 /* Ideally, the caller figures this out. However, it complicates a lot
1204 * of areas of callers (eg, anything that uses find_free_spot would now 1205 * of areas of callers (eg, anything that uses find_free_spot would now
1205 * need extra work 1206 * need extra work
1206 */ 1207 */
1207 op->map = get_map_from_coord (m, &op->x, &op->y); 1208 if (!xy_normalise (m, op->x, op->y))
1208 x = op->x; 1209 return 0;
1209 y = op->y; 1210
1211 op->map = m;
1212 mapspace &ms = op->ms ();
1210 1213
1211 /* this has to be done after we translate the coordinates. 1214 /* this has to be done after we translate the coordinates.
1212 */ 1215 */
1213 if (op->nrof && !(flag & INS_NO_MERGE)) 1216 if (op->nrof && !(flag & INS_NO_MERGE))
1214 for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) 1217 for (tmp = ms.bot; tmp; tmp = tmp->above)
1215 if (object::can_merge (op, tmp)) 1218 if (object::can_merge (op, tmp))
1216 { 1219 {
1217 op->nrof += tmp->nrof; 1220 op->nrof += tmp->nrof;
1218 tmp->destroy (); 1221 tmp->destroy ();
1219 } 1222 }
… …
1236 op->below = originator->below; 1239 op->below = originator->below;
1237 1240
1238 if (op->below) 1241 if (op->below)
1239 op->below->above = op; 1242 op->below->above = op;
1240 else 1243 else
1241 op->ms ().bot = op; 1244 ms.bot = op;
1242 1245
1243 /* since *below* originator, no need to update top */ 1246 /* since *below* originator, no need to update top */
1244 originator->below = op; 1247 originator->below = op;
1245 } 1248 }
1246 else 1249 else
1247 { 1250 {
1251 top = ms.bot;
1252
1248 /* If there are other objects, then */ 1253 /* If there are other objects, then */
1249 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1254 if ((!(flag & INS_MAP_LOAD)) && top)
1250 { 1255 {
1251 object *last = 0; 1256 object *last = 0;
1252 1257
1253 /* 1258 /*
1254 * If there are multiple objects on this space, we do some trickier handling. 1259 * If there are multiple objects on this space, we do some trickier handling.
… …
1260 * once we get to them. This reduces the need to traverse over all of 1265 * once we get to them. This reduces the need to traverse over all of
1261 * them when adding another one - this saves quite a bit of cpu time 1266 * them when adding another one - this saves quite a bit of cpu time
1262 * when lots of spells are cast in one area. Currently, it is presumed 1267 * when lots of spells are cast in one area. Currently, it is presumed
1263 * that flying non pickable objects are spell objects. 1268 * that flying non pickable objects are spell objects.
1264 */ 1269 */
1265 while (top) 1270 for (top = ms.bot; top; top = top->above)
1266 { 1271 {
1267 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1272 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1268 floor = top; 1273 floor = top;
1269 1274
1270 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1275 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
… …
1273 top = top->below; 1278 top = top->below;
1274 break; 1279 break;
1275 } 1280 }
1276 1281
1277 last = top; 1282 last = top;
1278 top = top->above;
1279 } 1283 }
1280 1284
1281 /* Don't want top to be NULL, so set it to the last valid object */ 1285 /* Don't want top to be NULL, so set it to the last valid object */
1282 top = last; 1286 top = last;
1283 1287
… …
1285 * looks like instead of lots of conditions here. 1289 * looks like instead of lots of conditions here.
1286 * makes things faster, and effectively the same result. 1290 * makes things faster, and effectively the same result.
1287 */ 1291 */
1288 1292
1289 /* Have object 'fall below' other objects that block view. 1293 /* Have object 'fall below' other objects that block view.
1290 * Unless those objects are exits, type 66 1294 * Unless those objects are exits.
1291 * If INS_ON_TOP is used, don't do this processing 1295 * If INS_ON_TOP is used, don't do this processing
1292 * Need to find the object that in fact blocks view, otherwise 1296 * Need to find the object that in fact blocks view, otherwise
1293 * stacking is a bit odd. 1297 * stacking is a bit odd.
1294 */ 1298 */
1295 if (!(flag & INS_ON_TOP) && 1299 if (!(flag & INS_ON_TOP)
1296 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1300 && ms.flags () & P_BLOCKSVIEW
1301 && (op->face && !faces [op->face].visibility))
1297 { 1302 {
1298 for (last = top; last != floor; last = last->below) 1303 for (last = top; last != floor; last = last->below)
1299 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1304 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1300 break; 1305 break;
1306
1301 /* Check to see if we found the object that blocks view, 1307 /* Check to see if we found the object that blocks view,
1302 * and make sure we have a below pointer for it so that 1308 * and make sure we have a below pointer for it so that
1303 * we can get inserted below this one, which requires we 1309 * we can get inserted below this one, which requires we
1304 * set top to the object below us. 1310 * set top to the object below us.
1305 */ 1311 */
… …
1307 top = last->below; 1313 top = last->below;
1308 } 1314 }
1309 } /* If objects on this space */ 1315 } /* If objects on this space */
1310 1316
1311 if (flag & INS_MAP_LOAD) 1317 if (flag & INS_MAP_LOAD)
1312 top = GET_MAP_TOP (op->map, op->x, op->y); 1318 top = ms.top;
1313 1319
1314 if (flag & INS_ABOVE_FLOOR_ONLY) 1320 if (flag & INS_ABOVE_FLOOR_ONLY)
1315 top = floor; 1321 top = floor;
1316 1322
1317 /* Top is the object that our object (op) is going to get inserted above. 1323 /* Top is the object that our object (op) is going to get inserted above.
1318 */ 1324 */
1319 1325
1320 /* First object on this space */ 1326 /* First object on this space */
1321 if (!top) 1327 if (!top)
1322 { 1328 {
1323 op->above = GET_MAP_OB (op->map, op->x, op->y); 1329 op->above = ms.bot;
1324 1330
1325 if (op->above) 1331 if (op->above)
1326 op->above->below = op; 1332 op->above->below = op;
1327 1333
1328 op->below = 0; 1334 op->below = 0;
1329 op->ms ().bot = op; 1335 ms.bot = op;
1330 } 1336 }
1331 else 1337 else
1332 { /* get inserted into the stack above top */ 1338 { /* get inserted into the stack above top */
1333 op->above = top->above; 1339 op->above = top->above;
1334 1340
… …
1338 op->below = top; 1344 op->below = top;
1339 top->above = op; 1345 top->above = op;
1340 } 1346 }
1341 1347
1342 if (!op->above) 1348 if (!op->above)
1343 op->ms ().top = op; 1349 ms.top = op;
1344 } /* else not INS_BELOW_ORIGINATOR */ 1350 } /* else not INS_BELOW_ORIGINATOR */
1345 1351
1346 if (op->type == PLAYER) 1352 if (op->type == PLAYER)
1347 { 1353 {
1348 op->contr->do_los = 1; 1354 op->contr->do_los = 1;
… …
1354 1360
1355 /* If we have a floor, we know the player, if any, will be above 1361 /* If we have a floor, we know the player, if any, will be above
1356 * it, so save a few ticks and start from there. 1362 * it, so save a few ticks and start from there.
1357 */ 1363 */
1358 if (!(flag & INS_MAP_LOAD)) 1364 if (!(flag & INS_MAP_LOAD))
1359 if (object *pl = op->ms ().player ()) 1365 if (object *pl = ms.player ())
1360 if (pl->contr->ns) 1366 if (pl->contr->ns)
1361 pl->contr->ns->floorbox_update (); 1367 pl->contr->ns->floorbox_update ();
1362 1368
1363 /* If this object glows, it may affect lighting conditions that are 1369 /* If this object glows, it may affect lighting conditions that are
1364 * visible to others on this map. But update_all_los is really 1370 * visible to others on this map. But update_all_los is really
… …
1423 tmp1->x = op->x; 1429 tmp1->x = op->x;
1424 tmp1->y = op->y; 1430 tmp1->y = op->y;
1425 insert_ob_in_map (tmp1, op->map, op, 0); 1431 insert_ob_in_map (tmp1, op->map, op, 0);
1426} 1432}
1427 1433
1434// XXX: function not returning object*
1428object * 1435object *
1429object::insert_at (object *where, object *originator, int flags) 1436object::insert_at (object *where, object *originator, int flags)
1430{ 1437{
1431 where->map->insert (this, where->x, where->y, originator, flags); 1438 where->map->insert (this, where->x, where->y, originator, flags);
1432} 1439}
… …
1773 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1780 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1774 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1781 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1775 { 1782 {
1776 1783
1777 float 1784 float
1778 diff = tmp->move_slow_penalty * FABS (op->speed); 1785 diff = tmp->move_slow_penalty * fabs (op->speed);
1779 1786
1780 if (op->type == PLAYER) 1787 if (op->type == PLAYER)
1781 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1788 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1782 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1789 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1783 diff /= 4.0; 1790 diff /= 4.0;
… …
1990 } 1997 }
1991 1998
1992 if (!index) 1999 if (!index)
1993 return -1; 2000 return -1;
1994 2001
1995 return altern[RANDOM () % index]; 2002 return altern [rndm (index)];
1996} 2003}
1997 2004
1998/* 2005/*
1999 * find_first_free_spot(archetype, maptile, x, y) works like 2006 * find_first_free_spot(archetype, maptile, x, y) works like
2000 * find_free_spot(), but it will search max number of squares. 2007 * find_free_spot(), but it will search max number of squares.
… …
2021{ 2028{
2022 arr += begin; 2029 arr += begin;
2023 end -= begin; 2030 end -= begin;
2024 2031
2025 while (--end) 2032 while (--end)
2026 swap (arr [end], arr [RANDOM () % (end + 1)]); 2033 swap (arr [end], arr [rndm (end + 1)]);
2027} 2034}
2028 2035
2029/* new function to make monster searching more efficient, and effective! 2036/* new function to make monster searching more efficient, and effective!
2030 * This basically returns a randomized array (in the passed pointer) of 2037 * This basically returns a randomized array (in the passed pointer) of
2031 * the spaces to find monsters. In this way, it won't always look for 2038 * the spaces to find monsters. In this way, it won't always look for
… …
2165 2172
2166 return 3; 2173 return 3;
2167} 2174}
2168 2175
2169/* 2176/*
2170 * absdir(int): Returns a number between 1 and 8, which represent
2171 * the "absolute" direction of a number (it actually takes care of
2172 * "overflow" in previous calculations of a direction).
2173 */
2174
2175int
2176absdir (int d)
2177{
2178 while (d < 1)
2179 d += 8;
2180
2181 while (d > 8)
2182 d -= 8;
2183
2184 return d;
2185}
2186
2187/*
2188 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2177 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2189 * between two directions (which are expected to be absolute (see absdir()) 2178 * between two directions (which are expected to be absolute (see absdir())
2190 */ 2179 */
2191
2192int 2180int
2193dirdiff (int dir1, int dir2) 2181dirdiff (int dir1, int dir2)
2194{ 2182{
2195 int d; 2183 int d;
2196 2184
… …
2362 insert_ob_in_ob (object_create_clone (item), dst); 2350 insert_ob_in_ob (object_create_clone (item), dst);
2363 2351
2364 return dst; 2352 return dst;
2365} 2353}
2366 2354
2367/* GROS - Creates an object using a string representing its content. */
2368/* Basically, we save the content of the string to a temp file, then call */
2369/* load_object on it. I admit it is a highly inefficient way to make things, */
2370/* but it was simple to make and allows reusing the load_object function. */
2371/* Remember not to use load_object_str in a time-critical situation. */
2372/* Also remember that multiparts objects are not supported for now. */
2373object *
2374load_object_str (const char *obstr)
2375{
2376 object *op;
2377 char filename[MAX_BUF];
2378
2379 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2380
2381 FILE *tempfile = fopen (filename, "w");
2382
2383 if (tempfile == NULL)
2384 {
2385 LOG (llevError, "Error - Unable to access load object temp file\n");
2386 return NULL;
2387 }
2388
2389 fprintf (tempfile, obstr);
2390 fclose (tempfile);
2391
2392 op = object::create ();
2393
2394 object_thawer thawer (filename);
2395
2396 if (thawer)
2397 load_object (thawer, op, 0);
2398
2399 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2400 CLEAR_FLAG (op, FLAG_REMOVED);
2401
2402 return op;
2403}
2404
2405/* This returns the first object in who's inventory that 2355/* This returns the first object in who's inventory that
2406 * has the same type and subtype match. 2356 * has the same type and subtype match.
2407 * returns NULL if no match. 2357 * returns NULL if no match.
2408 */ 2358 */
2409object * 2359object *
… …
2462 if (link->key == canonical_key) 2412 if (link->key == canonical_key)
2463 return link->value; 2413 return link->value;
2464 2414
2465 return 0; 2415 return 0;
2466} 2416}
2467
2468 2417
2469/* 2418/*
2470 * Updates the canonical_key in op to value. 2419 * Updates the canonical_key in op to value.
2471 * 2420 *
2472 * canonical_key is a shared string (value doesn't have to be). 2421 * canonical_key is a shared string (value doesn't have to be).
… …
2612{ 2561{
2613 char flagdesc[512]; 2562 char flagdesc[512];
2614 char info2[256 * 4]; 2563 char info2[256 * 4];
2615 char *p = info; 2564 char *p = info;
2616 2565
2617 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", 2566 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2618 count, uuid.seq, 2567 count, uuid.seq,
2619 &name, 2568 &name,
2620 title ? "\",title:" : "", 2569 title ? "\",title:\"" : "",
2621 title ? (const char *)title : "", 2570 title ? (const char *)title : "",
2622 flag_desc (flagdesc, 512), type); 2571 flag_desc (flagdesc, 512), type);
2623 2572
2624 if (env) 2573 if (env)
2625 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2574 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
… …
2635{ 2584{
2636 static char info[256 * 4]; 2585 static char info[256 * 4];
2637 return debug_desc (info); 2586 return debug_desc (info);
2638} 2587}
2639 2588
2589const char *
2590object::debug_desc2 () const
2591{
2592 static char info[256 * 4];
2593 return debug_desc (info);
2594}
2595
2596struct region *
2597object::region () const
2598{
2599 return map ? map->region (x, y)
2600 : region::default_region ();
2601}
2602
2603const materialtype_t *
2604object::dominant_material () const
2605{
2606 if (materialtype_t *mat = name_to_material (materialname))
2607 return mat;
2608
2609 // omfg this is slow, this has to be temporary :)
2610 shstr unknown ("unknown");
2611
2612 return name_to_material (unknown);
2613}
2614
2615void
2616object::open_container (object *new_container)
2617{
2618 if (container == new_container)
2619 return;
2620
2621 if (object *old_container = container)
2622 {
2623 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2624 return;
2625
2626#if 0
2627 // remove the "Close old_container" object.
2628 if (object *closer = old_container->inv)
2629 if (closer->type == CLOSE_CON)
2630 closer->destroy ();
2631#endif
2632
2633 old_container->flag [FLAG_APPLIED] = 0;
2634 container = 0;
2635
2636 esrv_update_item (UPD_FLAGS, this, old_container);
2637 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2638 }
2639
2640 if (new_container)
2641 {
2642 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2643 return;
2644
2645 // TODO: this does not seem to serve any purpose anymore?
2646#if 0
2647 // insert the "Close Container" object.
2648 if (archetype *closer = new_container->other_arch)
2649 {
2650 object *closer = arch_to_object (new_container->other_arch);
2651 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2652 new_container->insert (closer);
2653 }
2654#endif
2655
2656 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2657
2658 new_container->flag [FLAG_APPLIED] = 1;
2659 container = new_container;
2660
2661 esrv_update_item (UPD_FLAGS, this, new_container);
2662 esrv_send_inventory (this, new_container);
2663 }
2664}
2665
2666

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines