1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * 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, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <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. |
… | |
… | |
300 | return 0; |
299 | return 0; |
301 | else if (!compare_ob_value_lists (ob1, ob2)) |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
302 | return 0; |
301 | return 0; |
303 | } |
302 | } |
304 | |
303 | |
305 | //TODO: generate an event or call into perl for additional checks |
|
|
306 | if (ob1->self || ob2->self) |
304 | if (ob1->self || ob2->self) |
307 | { |
305 | { |
308 | ob1->optimise (); |
306 | ob1->optimise (); |
309 | ob2->optimise (); |
307 | ob2->optimise (); |
310 | |
308 | |
311 | if (ob1->self || ob2->self) |
309 | if (ob1->self || ob2->self) |
|
|
310 | if (!cfperl_can_merge (ob1, ob2)) |
312 | return 0; |
311 | return 0; |
313 | } |
312 | } |
314 | |
313 | |
315 | /* Everything passes, must be OK. */ |
314 | /* Everything passes, must be OK. */ |
316 | return 1; |
315 | return 1; |
317 | } |
316 | } |
… | |
… | |
375 | /* |
374 | /* |
376 | * get_nearest_part(multi-object, object 2) returns the part of the |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
377 | * multi-object 1 which is closest to the second object. |
376 | * multi-object 1 which is closest to the second object. |
378 | * If it's not a multi-object, it is returned. |
377 | * If it's not a multi-object, it is returned. |
379 | */ |
378 | */ |
380 | |
|
|
381 | object * |
379 | object * |
382 | get_nearest_part (object *op, const object *pl) |
380 | get_nearest_part (object *op, const object *pl) |
383 | { |
381 | { |
384 | object *tmp, *closest; |
382 | object *tmp, *closest; |
385 | int last_dist, i; |
383 | int last_dist, i; |
… | |
… | |
430 | } |
428 | } |
431 | |
429 | |
432 | /* |
430 | /* |
433 | * Sets the owner and sets the skill and exp pointers to owner's current |
431 | * Sets the owner and sets the skill and exp pointers to owner's current |
434 | * skill and experience objects. |
432 | * skill and experience objects. |
|
|
433 | * ACTUALLY NO! investigate! TODO |
435 | */ |
434 | */ |
436 | void |
435 | void |
437 | object::set_owner (object *owner) |
436 | object::set_owner (object *owner) |
438 | { |
437 | { |
|
|
438 | // allow objects which own objects |
439 | if (!owner) |
439 | if (owner) |
440 | return; |
|
|
441 | |
|
|
442 | /* next line added to allow objects which own objects */ |
|
|
443 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
444 | * with the fireball owning a poison cloud which then owned the |
|
|
445 | * fireball. I believe that was caused by one of the objects getting |
|
|
446 | * freed and then another object replacing it. Since the ownercounts |
|
|
447 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
448 | */ |
|
|
449 | while (owner->owner) |
440 | while (owner->owner) |
450 | owner = owner->owner; |
441 | owner = owner->owner; |
451 | |
442 | |
452 | this->owner = owner; |
443 | this->owner = owner; |
453 | } |
444 | } |
454 | |
445 | |
455 | int |
446 | int |
… | |
… | |
587 | object::copy_to (object *dst) |
578 | object::copy_to (object *dst) |
588 | { |
579 | { |
589 | *dst = *this; |
580 | *dst = *this; |
590 | |
581 | |
591 | if (speed < 0) |
582 | if (speed < 0) |
592 | dst->speed_left = speed_left - rndm (); |
583 | dst->speed_left -= rndm (); |
593 | |
584 | |
594 | dst->set_speed (dst->speed); |
585 | dst->set_speed (dst->speed); |
595 | } |
586 | } |
596 | |
587 | |
597 | void |
588 | void |
… | |
… | |
924 | |
915 | |
925 | if (!freed_map) |
916 | if (!freed_map) |
926 | { |
917 | { |
927 | freed_map = new maptile; |
918 | freed_map = new maptile; |
928 | |
919 | |
|
|
920 | freed_map->path = "<freed objects map>"; |
929 | freed_map->name = "/internal/freed_objects_map"; |
921 | freed_map->name = "/internal/freed_objects_map"; |
930 | freed_map->width = 3; |
922 | freed_map->width = 3; |
931 | freed_map->height = 3; |
923 | freed_map->height = 3; |
932 | |
924 | |
933 | freed_map->alloc (); |
925 | freed_map->alloc (); |
… | |
… | |
960 | if (destroyed ()) |
952 | if (destroyed ()) |
961 | return; |
953 | return; |
962 | |
954 | |
963 | if (destroy_inventory) |
955 | if (destroy_inventory) |
964 | destroy_inv (false); |
956 | destroy_inv (false); |
|
|
957 | |
|
|
958 | if (is_head ()) |
|
|
959 | if (sound_destroy) |
|
|
960 | play_sound (sound_destroy); |
|
|
961 | else if (flag [FLAG_MONSTER]) |
|
|
962 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
965 | |
963 | |
966 | attachable::destroy (); |
964 | attachable::destroy (); |
967 | } |
965 | } |
968 | |
966 | |
969 | /* |
967 | /* |
… | |
… | |
1084 | if (map->in_memory == MAP_SAVING) |
1082 | if (map->in_memory == MAP_SAVING) |
1085 | return; |
1083 | return; |
1086 | |
1084 | |
1087 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1085 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1088 | |
1086 | |
|
|
1087 | if (object *pl = ms.player ()) |
|
|
1088 | { |
|
|
1089 | if (pl->container == this) |
|
|
1090 | /* If a container that the player is currently using somehow gets |
|
|
1091 | * removed (most likely destroyed), update the player view |
|
|
1092 | * appropriately. |
|
|
1093 | */ |
|
|
1094 | pl->close_container (); |
|
|
1095 | |
|
|
1096 | pl->contr->ns->floorbox_update (); |
|
|
1097 | } |
|
|
1098 | |
1089 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1099 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1090 | { |
1100 | { |
1091 | /* No point updating the players look faces if he is the object |
1101 | /* No point updating the players look faces if he is the object |
1092 | * being removed. |
1102 | * being removed. |
1093 | */ |
1103 | */ |
1094 | |
|
|
1095 | if (tmp->type == PLAYER && tmp != this) |
|
|
1096 | { |
|
|
1097 | /* If a container that the player is currently using somehow gets |
|
|
1098 | * removed (most likely destroyed), update the player view |
|
|
1099 | * appropriately. |
|
|
1100 | */ |
|
|
1101 | if (tmp->container == this) |
|
|
1102 | { |
|
|
1103 | flag [FLAG_APPLIED] = 0; |
|
|
1104 | tmp->container = 0; |
|
|
1105 | } |
|
|
1106 | |
|
|
1107 | if (tmp->contr->ns) |
|
|
1108 | tmp->contr->ns->floorbox_update (); |
|
|
1109 | } |
|
|
1110 | |
1104 | |
1111 | /* See if object moving off should effect something */ |
1105 | /* See if object moving off should effect something */ |
1112 | if (check_walk_off |
1106 | if (check_walk_off |
1113 | && ((move_type & tmp->move_off) |
1107 | && ((move_type & tmp->move_off) |
1114 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1108 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1237 | |
1231 | |
1238 | object *top, *floor = NULL; |
1232 | object *top, *floor = NULL; |
1239 | |
1233 | |
1240 | op->remove (); |
1234 | op->remove (); |
1241 | |
1235 | |
1242 | #if 0 |
|
|
1243 | if (!m->active != !op->active) |
|
|
1244 | if (m->active) |
|
|
1245 | op->activate_recursive (); |
|
|
1246 | else |
|
|
1247 | op->deactivate_recursive (); |
|
|
1248 | #endif |
|
|
1249 | |
|
|
1250 | if (out_of_map (m, op->x, op->y)) |
|
|
1251 | { |
|
|
1252 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
|
|
1253 | #ifdef MANY_CORES |
|
|
1254 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1255 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1256 | * improperly inserted. |
|
|
1257 | */ |
|
|
1258 | abort (); |
|
|
1259 | #endif |
|
|
1260 | return op; |
|
|
1261 | } |
|
|
1262 | |
|
|
1263 | if (object *more = op->more) |
|
|
1264 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1265 | return 0; |
|
|
1266 | |
|
|
1267 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1268 | |
|
|
1269 | /* Ideally, the caller figures this out. However, it complicates a lot |
1236 | /* Ideally, the caller figures this out. However, it complicates a lot |
1270 | * of areas of callers (eg, anything that uses find_free_spot would now |
1237 | * of areas of callers (eg, anything that uses find_free_spot would now |
1271 | * need extra work |
1238 | * need extra work |
1272 | */ |
1239 | */ |
1273 | if (!xy_normalise (m, op->x, op->y)) |
1240 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1241 | { |
|
|
1242 | op->destroy (); |
1274 | return 0; |
1243 | return 0; |
|
|
1244 | } |
|
|
1245 | |
|
|
1246 | if (object *more = op->more) |
|
|
1247 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1248 | return 0; |
|
|
1249 | |
|
|
1250 | CLEAR_FLAG (op, FLAG_REMOVED); |
1275 | |
1251 | |
1276 | op->map = m; |
1252 | op->map = m; |
1277 | mapspace &ms = op->ms (); |
1253 | mapspace &ms = op->ms (); |
1278 | |
1254 | |
1279 | /* this has to be done after we translate the coordinates. |
1255 | /* this has to be done after we translate the coordinates. |
… | |
… | |
1314 | else |
1290 | else |
1315 | { |
1291 | { |
1316 | top = ms.bot; |
1292 | top = ms.bot; |
1317 | |
1293 | |
1318 | /* If there are other objects, then */ |
1294 | /* If there are other objects, then */ |
1319 | if ((!(flag & INS_MAP_LOAD)) && top) |
1295 | if (top) |
1320 | { |
1296 | { |
1321 | object *last = 0; |
1297 | object *last = 0; |
1322 | |
1298 | |
1323 | /* |
1299 | /* |
1324 | * If there are multiple objects on this space, we do some trickier handling. |
1300 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1377 | if (last && last->below && last != floor) |
1353 | if (last && last->below && last != floor) |
1378 | top = last->below; |
1354 | top = last->below; |
1379 | } |
1355 | } |
1380 | } /* If objects on this space */ |
1356 | } /* If objects on this space */ |
1381 | |
1357 | |
1382 | if (flag & INS_MAP_LOAD) |
|
|
1383 | top = ms.top; |
|
|
1384 | |
|
|
1385 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1358 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1386 | top = floor; |
1359 | top = floor; |
1387 | |
1360 | |
1388 | /* Top is the object that our object (op) is going to get inserted above. |
1361 | /* Top is the object that our object (op) is going to get inserted above. |
1389 | */ |
1362 | */ |
… | |
… | |
1421 | op->map->touch (); |
1394 | op->map->touch (); |
1422 | } |
1395 | } |
1423 | |
1396 | |
1424 | op->map->dirty = true; |
1397 | op->map->dirty = true; |
1425 | |
1398 | |
1426 | /* If we have a floor, we know the player, if any, will be above |
|
|
1427 | * it, so save a few ticks and start from there. |
|
|
1428 | */ |
|
|
1429 | if (!(flag & INS_MAP_LOAD)) |
|
|
1430 | if (object *pl = ms.player ()) |
1399 | if (object *pl = ms.player ()) |
1431 | if (pl->contr->ns) |
|
|
1432 | pl->contr->ns->floorbox_update (); |
1400 | pl->contr->ns->floorbox_update (); |
1433 | |
1401 | |
1434 | /* If this object glows, it may affect lighting conditions that are |
1402 | /* If this object glows, it may affect lighting conditions that are |
1435 | * visible to others on this map. But update_all_los is really |
1403 | * visible to others on this map. But update_all_los is really |
1436 | * an inefficient way to do this, as it means los for all players |
1404 | * an inefficient way to do this, as it means los for all players |
1437 | * on the map will get recalculated. The players could very well |
1405 | * on the map will get recalculated. The players could very well |
… | |
… | |
1675 | * be != op, if items are merged. -Tero |
1643 | * be != op, if items are merged. -Tero |
1676 | */ |
1644 | */ |
1677 | object * |
1645 | object * |
1678 | object::insert (object *op) |
1646 | object::insert (object *op) |
1679 | { |
1647 | { |
1680 | object *tmp, *otmp; |
|
|
1681 | |
|
|
1682 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1648 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1683 | op->remove (); |
1649 | op->remove (); |
1684 | |
1650 | |
1685 | if (op->more) |
1651 | if (op->more) |
1686 | { |
1652 | { |
… | |
… | |
1688 | return op; |
1654 | return op; |
1689 | } |
1655 | } |
1690 | |
1656 | |
1691 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1657 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1692 | CLEAR_FLAG (op, FLAG_REMOVED); |
1658 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1659 | |
1693 | if (op->nrof) |
1660 | if (op->nrof) |
1694 | { |
1661 | { |
1695 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1662 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1696 | if (object::can_merge (tmp, op)) |
1663 | if (object::can_merge (tmp, op)) |
1697 | { |
1664 | { |
1698 | /* return the original object and remove inserted object |
1665 | /* return the original object and remove inserted object |
1699 | (client needs the original object) */ |
1666 | (client needs the original object) */ |
1700 | tmp->nrof += op->nrof; |
1667 | tmp->nrof += op->nrof; |
… | |
… | |
1719 | add_weight (this, op->weight * op->nrof); |
1686 | add_weight (this, op->weight * op->nrof); |
1720 | } |
1687 | } |
1721 | else |
1688 | else |
1722 | add_weight (this, (op->weight + op->carrying)); |
1689 | add_weight (this, (op->weight + op->carrying)); |
1723 | |
1690 | |
1724 | otmp = this->in_player (); |
1691 | if (object *otmp = this->in_player ()) |
1725 | if (otmp && otmp->contr) |
|
|
1726 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1692 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1727 | otmp->update_stats (); |
1693 | otmp->update_stats (); |
1728 | |
1694 | |
|
|
1695 | op->owner = 0; // its his/hers now. period. |
1729 | op->map = 0; |
1696 | op->map = 0; |
1730 | op->env = this; |
1697 | op->env = this; |
1731 | op->above = 0; |
1698 | op->above = 0; |
1732 | op->below = 0; |
1699 | op->below = 0; |
1733 | op->x = 0, op->y = 0; |
1700 | op->x = op->y = 0; |
1734 | |
1701 | |
1735 | /* reset the light list and los of the players on the map */ |
1702 | /* reset the light list and los of the players on the map */ |
1736 | if ((op->glow_radius != 0) && map) |
1703 | if (op->glow_radius && map) |
1737 | { |
1704 | { |
1738 | #ifdef DEBUG_LIGHTS |
1705 | #ifdef DEBUG_LIGHTS |
1739 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1706 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1740 | #endif /* DEBUG_LIGHTS */ |
1707 | #endif /* DEBUG_LIGHTS */ |
1741 | if (map->darkness) |
1708 | if (map->darkness) |
… | |
… | |
2021 | * customized, changed states, etc. |
1988 | * customized, changed states, etc. |
2022 | */ |
1989 | */ |
2023 | int |
1990 | int |
2024 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1991 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2025 | { |
1992 | { |
|
|
1993 | int altern[SIZEOFFREE]; |
2026 | int index = 0, flag; |
1994 | int index = 0, flag; |
2027 | int altern[SIZEOFFREE]; |
|
|
2028 | |
1995 | |
2029 | for (int i = start; i < stop; i++) |
1996 | for (int i = start; i < stop; i++) |
2030 | { |
1997 | { |
2031 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1998 | mapxy pos (m, x, y); pos.move (i); |
2032 | if (!flag) |
1999 | |
|
|
2000 | if (!pos.normalise ()) |
|
|
2001 | continue; |
|
|
2002 | |
|
|
2003 | mapspace &ms = *pos; |
|
|
2004 | |
|
|
2005 | if (ms.flags () & P_IS_ALIVE) |
|
|
2006 | continue; |
|
|
2007 | |
|
|
2008 | /* However, often |
|
|
2009 | * ob doesn't have any move type (when used to place exits) |
|
|
2010 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2011 | */ |
|
|
2012 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2013 | { |
2033 | altern [index++] = i; |
2014 | altern [index++] = i; |
|
|
2015 | continue; |
|
|
2016 | } |
2034 | |
2017 | |
2035 | /* Basically, if we find a wall on a space, we cut down the search size. |
2018 | /* Basically, if we find a wall on a space, we cut down the search size. |
2036 | * In this way, we won't return spaces that are on another side of a wall. |
2019 | * In this way, we won't return spaces that are on another side of a wall. |
2037 | * This mostly work, but it cuts down the search size in all directions - |
2020 | * This mostly work, but it cuts down the search size in all directions - |
2038 | * if the space being examined only has a wall to the north and empty |
2021 | * if the space being examined only has a wall to the north and empty |
2039 | * spaces in all the other directions, this will reduce the search space |
2022 | * spaces in all the other directions, this will reduce the search space |
2040 | * to only the spaces immediately surrounding the target area, and |
2023 | * to only the spaces immediately surrounding the target area, and |
2041 | * won't look 2 spaces south of the target space. |
2024 | * won't look 2 spaces south of the target space. |
2042 | */ |
2025 | */ |
2043 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2026 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2027 | { |
2044 | stop = maxfree[i]; |
2028 | stop = maxfree[i]; |
|
|
2029 | continue; |
|
|
2030 | } |
|
|
2031 | |
|
|
2032 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2033 | * head of the object should correspond for the entire object. |
|
|
2034 | */ |
|
|
2035 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2036 | continue; |
|
|
2037 | |
|
|
2038 | altern [index++] = i; |
2045 | } |
2039 | } |
2046 | |
2040 | |
2047 | if (!index) |
2041 | if (!index) |
2048 | return -1; |
2042 | return -1; |
2049 | |
2043 | |
… | |
… | |
2058 | */ |
2052 | */ |
2059 | int |
2053 | int |
2060 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2054 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2061 | { |
2055 | { |
2062 | for (int i = 0; i < SIZEOFFREE; i++) |
2056 | for (int i = 0; i < SIZEOFFREE; i++) |
2063 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2057 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2064 | return i; |
2058 | return i; |
2065 | |
2059 | |
2066 | return -1; |
2060 | return -1; |
2067 | } |
2061 | } |
2068 | |
2062 | |
… | |
… | |
2345 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2339 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2346 | * core dumps if they do. |
2340 | * core dumps if they do. |
2347 | * |
2341 | * |
2348 | * Add a check so we can't pick up invisible objects (0.93.8) |
2342 | * Add a check so we can't pick up invisible objects (0.93.8) |
2349 | */ |
2343 | */ |
2350 | |
|
|
2351 | int |
2344 | int |
2352 | can_pick (const object *who, const object *item) |
2345 | can_pick (const object *who, const object *item) |
2353 | { |
2346 | { |
2354 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2347 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2355 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2348 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2613 | &name, |
2606 | &name, |
2614 | title ? "\",title:\"" : "", |
2607 | title ? "\",title:\"" : "", |
2615 | title ? (const char *)title : "", |
2608 | title ? (const char *)title : "", |
2616 | flag_desc (flagdesc, 512), type); |
2609 | flag_desc (flagdesc, 512), type); |
2617 | |
2610 | |
2618 | if (env) |
2611 | if (!this->flag[FLAG_REMOVED] && env) |
2619 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2612 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2620 | |
2613 | |
2621 | if (map) |
2614 | if (map) |
2622 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2615 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2623 | |
2616 | |
… | |
… | |
2641 | } |
2634 | } |
2642 | |
2635 | |
2643 | const materialtype_t * |
2636 | const materialtype_t * |
2644 | object::dominant_material () const |
2637 | object::dominant_material () const |
2645 | { |
2638 | { |
2646 | if (materialtype_t *mat = name_to_material (materialname)) |
2639 | if (materialtype_t *mt = name_to_material (materialname)) |
2647 | return mat; |
2640 | return mt; |
2648 | |
2641 | |
2649 | // omfg this is slow, this has to be temporary :) |
|
|
2650 | shstr unknown ("unknown"); |
|
|
2651 | |
|
|
2652 | return name_to_material (unknown); |
2642 | return name_to_material (shstr_unknown); |
2653 | } |
2643 | } |
2654 | |
2644 | |
2655 | void |
2645 | void |
2656 | object::open_container (object *new_container) |
2646 | object::open_container (object *new_container) |
2657 | { |
2647 | { |
… | |
… | |
2673 | old_container->flag [FLAG_APPLIED] = 0; |
2663 | old_container->flag [FLAG_APPLIED] = 0; |
2674 | container = 0; |
2664 | container = 0; |
2675 | |
2665 | |
2676 | esrv_update_item (UPD_FLAGS, this, old_container); |
2666 | esrv_update_item (UPD_FLAGS, this, old_container); |
2677 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2667 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2668 | play_sound (sound_find ("chest_close")); |
2678 | } |
2669 | } |
2679 | |
2670 | |
2680 | if (new_container) |
2671 | if (new_container) |
2681 | { |
2672 | { |
2682 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2673 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
… | |
… | |
2698 | new_container->flag [FLAG_APPLIED] = 1; |
2689 | new_container->flag [FLAG_APPLIED] = 1; |
2699 | container = new_container; |
2690 | container = new_container; |
2700 | |
2691 | |
2701 | esrv_update_item (UPD_FLAGS, this, new_container); |
2692 | esrv_update_item (UPD_FLAGS, this, new_container); |
2702 | esrv_send_inventory (this, new_container); |
2693 | esrv_send_inventory (this, new_container); |
|
|
2694 | play_sound (sound_find ("chest_open")); |
|
|
2695 | } |
|
|
2696 | } |
|
|
2697 | |
|
|
2698 | object * |
|
|
2699 | object::force_find (const shstr name) |
|
|
2700 | { |
|
|
2701 | /* cycle through his inventory to look for the MARK we want to |
|
|
2702 | * place |
|
|
2703 | */ |
|
|
2704 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2705 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2706 | return splay (tmp); |
|
|
2707 | |
|
|
2708 | return 0; |
|
|
2709 | } |
|
|
2710 | |
|
|
2711 | void |
|
|
2712 | object::force_add (const shstr name, int duration) |
|
|
2713 | { |
|
|
2714 | if (object *force = force_find (name)) |
|
|
2715 | force->destroy (); |
|
|
2716 | |
|
|
2717 | object *force = get_archetype (FORCE_NAME); |
|
|
2718 | |
|
|
2719 | force->slaying = name; |
|
|
2720 | force->stats.food = 1; |
|
|
2721 | force->speed_left = -1.f; |
|
|
2722 | |
|
|
2723 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2724 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2725 | force->flag [FLAG_APPLIED] = true; |
|
|
2726 | |
|
|
2727 | insert (force); |
|
|
2728 | } |
|
|
2729 | |
|
|
2730 | void |
|
|
2731 | object::play_sound (faceidx sound) const |
|
|
2732 | { |
|
|
2733 | if (!sound) |
|
|
2734 | return; |
|
|
2735 | |
|
|
2736 | if (flag [FLAG_REMOVED]) |
|
|
2737 | return; |
|
|
2738 | |
|
|
2739 | if (env) |
2703 | } |
2740 | { |
|
|
2741 | if (object *pl = in_player ()) |
|
|
2742 | pl->contr->play_sound (sound); |
|
|
2743 | } |
|
|
2744 | else |
|
|
2745 | map->play_sound (sound, x, y); |
2704 | } |
2746 | } |
2705 | |
2747 | |
2706 | |
|
|