| … | |
… | |
| 254 | /* This is really a spellbook check - really, we should |
254 | /* This is really a spellbook check - really, we should |
| 255 | * check all objects in the inventory. |
255 | * check all objects in the inventory. |
| 256 | */ |
256 | */ |
| 257 | if (ob1->inv || ob2->inv) |
257 | if (ob1->inv || ob2->inv) |
| 258 | { |
258 | { |
| 259 | /* if one object has inventory but the other doesn't, not equiv */ |
259 | if (!(ob1->inv && ob2->inv)) |
| 260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
260 | return 0; /* inventories differ in length */ |
| 261 | return 0; |
|
|
| 262 | |
261 | |
| 263 | /* Now check to see if the two inventory objects could merge */ |
262 | if (ob1->inv->below || ob2->inv->below) |
|
|
263 | return 0; /* more than one object in inv */ |
|
|
264 | |
| 264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | if (!object::can_merge (ob1->inv, ob2->inv)) |
| 265 | return 0; |
266 | return 0; /* inventory objexts differ */ |
| 266 | |
267 | |
| 267 | /* inventory ok - still need to check rest of this object to see |
268 | /* inventory ok - still need to check rest of this object to see |
| 268 | * if it is valid. |
269 | * if it is valid. |
| 269 | */ |
270 | */ |
| 270 | } |
271 | } |
| … | |
… | |
| 305 | { |
306 | { |
| 306 | ob1->optimise (); |
307 | ob1->optimise (); |
| 307 | ob2->optimise (); |
308 | ob2->optimise (); |
| 308 | |
309 | |
| 309 | if (ob1->self || ob2->self) |
310 | if (ob1->self || ob2->self) |
| 310 | if (!cfperl_can_merge (ob1, ob2)) |
311 | { |
|
|
312 | int k1 = ob1->self ? HvTOTALKEYS (SvRV (ob1->self)) : 0; |
|
|
313 | int k2 = ob2->self ? HvTOTALKEYS (SvRV (ob2->self)) : 0; |
|
|
314 | |
|
|
315 | if (k1 != k2) |
| 311 | return 0; |
316 | return 0; |
|
|
317 | else if (k1 == 0) |
|
|
318 | return 1; |
|
|
319 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
320 | return 0; |
|
|
321 | } |
| 312 | } |
322 | } |
| 313 | |
323 | |
| 314 | /* Everything passes, must be OK. */ |
324 | /* Everything passes, must be OK. */ |
| 315 | return 1; |
325 | return 1; |
| 316 | } |
326 | } |
| … | |
… | |
| 374 | /* |
384 | /* |
| 375 | * get_nearest_part(multi-object, object 2) returns the part of the |
385 | * get_nearest_part(multi-object, object 2) returns the part of the |
| 376 | * multi-object 1 which is closest to the second object. |
386 | * multi-object 1 which is closest to the second object. |
| 377 | * If it's not a multi-object, it is returned. |
387 | * If it's not a multi-object, it is returned. |
| 378 | */ |
388 | */ |
| 379 | |
|
|
| 380 | object * |
389 | object * |
| 381 | get_nearest_part (object *op, const object *pl) |
390 | get_nearest_part (object *op, const object *pl) |
| 382 | { |
391 | { |
| 383 | object *tmp, *closest; |
392 | object *tmp, *closest; |
| 384 | int last_dist, i; |
393 | int last_dist, i; |
| … | |
… | |
| 579 | object::copy_to (object *dst) |
588 | object::copy_to (object *dst) |
| 580 | { |
589 | { |
| 581 | *dst = *this; |
590 | *dst = *this; |
| 582 | |
591 | |
| 583 | if (speed < 0) |
592 | if (speed < 0) |
| 584 | dst->speed_left = speed_left - rndm (); |
593 | dst->speed_left -= rndm (); |
| 585 | |
594 | |
| 586 | dst->set_speed (dst->speed); |
595 | dst->set_speed (dst->speed); |
| 587 | } |
596 | } |
| 588 | |
597 | |
| 589 | void |
598 | void |
| … | |
… | |
| 916 | |
925 | |
| 917 | if (!freed_map) |
926 | if (!freed_map) |
| 918 | { |
927 | { |
| 919 | freed_map = new maptile; |
928 | freed_map = new maptile; |
| 920 | |
929 | |
|
|
930 | freed_map->path = "<freed objects map>"; |
| 921 | freed_map->name = "/internal/freed_objects_map"; |
931 | freed_map->name = "/internal/freed_objects_map"; |
| 922 | freed_map->width = 3; |
932 | freed_map->width = 3; |
| 923 | freed_map->height = 3; |
933 | freed_map->height = 3; |
| 924 | |
934 | |
| 925 | freed_map->alloc (); |
935 | freed_map->alloc (); |
| … | |
… | |
| 1231 | |
1241 | |
| 1232 | object *top, *floor = NULL; |
1242 | object *top, *floor = NULL; |
| 1233 | |
1243 | |
| 1234 | op->remove (); |
1244 | op->remove (); |
| 1235 | |
1245 | |
| 1236 | if (out_of_map (m, op->x, op->y)) |
|
|
| 1237 | { |
|
|
| 1238 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
|
|
| 1239 | #ifdef MANY_CORES |
|
|
| 1240 | /* Better to catch this here, as otherwise the next use of this object |
|
|
| 1241 | * is likely to cause a crash. Better to find out where it is getting |
|
|
| 1242 | * improperly inserted. |
|
|
| 1243 | */ |
|
|
| 1244 | abort (); |
|
|
| 1245 | #endif |
|
|
| 1246 | return op; |
|
|
| 1247 | } |
|
|
| 1248 | |
|
|
| 1249 | if (object *more = op->more) |
|
|
| 1250 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
| 1251 | return 0; |
|
|
| 1252 | |
|
|
| 1253 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
| 1254 | |
|
|
| 1255 | /* Ideally, the caller figures this out. However, it complicates a lot |
1246 | /* Ideally, the caller figures this out. However, it complicates a lot |
| 1256 | * of areas of callers (eg, anything that uses find_free_spot would now |
1247 | * of areas of callers (eg, anything that uses find_free_spot would now |
| 1257 | * need extra work |
1248 | * need extra work |
| 1258 | */ |
1249 | */ |
| 1259 | if (!xy_normalise (m, op->x, op->y)) |
1250 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1251 | { |
|
|
1252 | op->destroy (); |
| 1260 | return 0; |
1253 | return 0; |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | if (object *more = op->more) |
|
|
1257 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1258 | return 0; |
|
|
1259 | |
|
|
1260 | CLEAR_FLAG (op, FLAG_REMOVED); |
| 1261 | |
1261 | |
| 1262 | op->map = m; |
1262 | op->map = m; |
| 1263 | mapspace &ms = op->ms (); |
1263 | mapspace &ms = op->ms (); |
| 1264 | |
1264 | |
| 1265 | /* this has to be done after we translate the coordinates. |
1265 | /* this has to be done after we translate the coordinates. |
| … | |
… | |
| 1300 | else |
1300 | else |
| 1301 | { |
1301 | { |
| 1302 | top = ms.bot; |
1302 | top = ms.bot; |
| 1303 | |
1303 | |
| 1304 | /* If there are other objects, then */ |
1304 | /* If there are other objects, then */ |
| 1305 | if ((!(flag & INS_MAP_LOAD)) && top) |
1305 | if (top) |
| 1306 | { |
1306 | { |
| 1307 | object *last = 0; |
1307 | object *last = 0; |
| 1308 | |
1308 | |
| 1309 | /* |
1309 | /* |
| 1310 | * If there are multiple objects on this space, we do some trickier handling. |
1310 | * If there are multiple objects on this space, we do some trickier handling. |
| … | |
… | |
| 1362 | */ |
1362 | */ |
| 1363 | if (last && last->below && last != floor) |
1363 | if (last && last->below && last != floor) |
| 1364 | top = last->below; |
1364 | top = last->below; |
| 1365 | } |
1365 | } |
| 1366 | } /* If objects on this space */ |
1366 | } /* If objects on this space */ |
| 1367 | if (flag & INS_MAP_LOAD) |
|
|
| 1368 | top = ms.top; |
|
|
| 1369 | |
1367 | |
| 1370 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1368 | if (flag & INS_ABOVE_FLOOR_ONLY) |
| 1371 | top = floor; |
1369 | top = floor; |
| 1372 | |
1370 | |
| 1373 | /* Top is the object that our object (op) is going to get inserted above. |
1371 | /* Top is the object that our object (op) is going to get inserted above. |
| … | |
… | |
| 1406 | op->map->touch (); |
1404 | op->map->touch (); |
| 1407 | } |
1405 | } |
| 1408 | |
1406 | |
| 1409 | op->map->dirty = true; |
1407 | op->map->dirty = true; |
| 1410 | |
1408 | |
| 1411 | if (!(flag & INS_MAP_LOAD)) |
|
|
| 1412 | if (object *pl = ms.player ()) |
1409 | if (object *pl = ms.player ()) |
| 1413 | pl->contr->ns->floorbox_update (); |
1410 | pl->contr->ns->floorbox_update (); |
| 1414 | |
1411 | |
| 1415 | /* If this object glows, it may affect lighting conditions that are |
1412 | /* If this object glows, it may affect lighting conditions that are |
| 1416 | * visible to others on this map. But update_all_los is really |
1413 | * visible to others on this map. But update_all_los is really |
| 1417 | * an inefficient way to do this, as it means los for all players |
1414 | * an inefficient way to do this, as it means los for all players |
| 1418 | * on the map will get recalculated. The players could very well |
1415 | * on the map will get recalculated. The players could very well |
| … | |
… | |
| 2001 | * customized, changed states, etc. |
1998 | * customized, changed states, etc. |
| 2002 | */ |
1999 | */ |
| 2003 | int |
2000 | int |
| 2004 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2001 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
| 2005 | { |
2002 | { |
|
|
2003 | int altern[SIZEOFFREE]; |
| 2006 | int index = 0, flag; |
2004 | int index = 0, flag; |
| 2007 | int altern[SIZEOFFREE]; |
|
|
| 2008 | |
2005 | |
| 2009 | for (int i = start; i < stop; i++) |
2006 | for (int i = start; i < stop; i++) |
| 2010 | { |
2007 | { |
| 2011 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2008 | mapxy pos (m, x, y); pos.move (i); |
| 2012 | if (!flag) |
2009 | |
|
|
2010 | if (!pos.normalise ()) |
|
|
2011 | continue; |
|
|
2012 | |
|
|
2013 | mapspace &ms = *pos; |
|
|
2014 | |
|
|
2015 | if (ms.flags () & P_IS_ALIVE) |
|
|
2016 | continue; |
|
|
2017 | |
|
|
2018 | /* However, often |
|
|
2019 | * ob doesn't have any move type (when used to place exits) |
|
|
2020 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2021 | */ |
|
|
2022 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2023 | { |
| 2013 | altern [index++] = i; |
2024 | altern [index++] = i; |
|
|
2025 | continue; |
|
|
2026 | } |
| 2014 | |
2027 | |
| 2015 | /* Basically, if we find a wall on a space, we cut down the search size. |
2028 | /* Basically, if we find a wall on a space, we cut down the search size. |
| 2016 | * In this way, we won't return spaces that are on another side of a wall. |
2029 | * In this way, we won't return spaces that are on another side of a wall. |
| 2017 | * This mostly work, but it cuts down the search size in all directions - |
2030 | * This mostly work, but it cuts down the search size in all directions - |
| 2018 | * if the space being examined only has a wall to the north and empty |
2031 | * if the space being examined only has a wall to the north and empty |
| 2019 | * spaces in all the other directions, this will reduce the search space |
2032 | * spaces in all the other directions, this will reduce the search space |
| 2020 | * to only the spaces immediately surrounding the target area, and |
2033 | * to only the spaces immediately surrounding the target area, and |
| 2021 | * won't look 2 spaces south of the target space. |
2034 | * won't look 2 spaces south of the target space. |
| 2022 | */ |
2035 | */ |
| 2023 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2036 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2037 | { |
| 2024 | stop = maxfree[i]; |
2038 | stop = maxfree[i]; |
|
|
2039 | continue; |
|
|
2040 | } |
|
|
2041 | |
|
|
2042 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2043 | * head of the object should correspond for the entire object. |
|
|
2044 | */ |
|
|
2045 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2046 | continue; |
|
|
2047 | |
|
|
2048 | altern [index++] = i; |
| 2025 | } |
2049 | } |
| 2026 | |
2050 | |
| 2027 | if (!index) |
2051 | if (!index) |
| 2028 | return -1; |
2052 | return -1; |
| 2029 | |
2053 | |
| … | |
… | |
| 2038 | */ |
2062 | */ |
| 2039 | int |
2063 | int |
| 2040 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2064 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
| 2041 | { |
2065 | { |
| 2042 | for (int i = 0; i < SIZEOFFREE; i++) |
2066 | for (int i = 0; i < SIZEOFFREE; i++) |
| 2043 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2067 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
| 2044 | return i; |
2068 | return i; |
| 2045 | |
2069 | |
| 2046 | return -1; |
2070 | return -1; |
| 2047 | } |
2071 | } |
| 2048 | |
2072 | |
