1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <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. |
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. */ |
… | |
… | |
29 | #include <stdio.h> |
28 | #include <stdio.h> |
30 | #include <sys/types.h> |
29 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
30 | #include <sys/uio.h> |
32 | #include <object.h> |
31 | #include <object.h> |
33 | #include <funcpoint.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
34 | #include <loader.h> |
34 | #include <loader.h> |
35 | |
35 | |
36 | #include <bitset> |
36 | #include <bitset> |
37 | |
37 | |
38 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
… | |
… | |
299 | return 0; |
299 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
301 | return 0; |
302 | } |
302 | } |
303 | |
303 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
304 | if (ob1->self || ob2->self) |
306 | { |
305 | { |
307 | ob1->optimise (); |
306 | ob1->optimise (); |
308 | ob2->optimise (); |
307 | ob2->optimise (); |
309 | |
308 | |
310 | if (ob1->self || ob2->self) |
309 | if (ob1->self || ob2->self) |
|
|
310 | if (!cfperl_can_merge (ob1, ob2)) |
311 | return 0; |
311 | return 0; |
312 | } |
312 | } |
313 | |
313 | |
314 | /* Everything passes, must be OK. */ |
314 | /* Everything passes, must be OK. */ |
315 | return 1; |
315 | return 1; |
316 | } |
316 | } |
… | |
… | |
447 | */ |
447 | */ |
448 | while (owner->owner) |
448 | while (owner->owner) |
449 | owner = owner->owner; |
449 | owner = owner->owner; |
450 | |
450 | |
451 | this->owner = owner; |
451 | this->owner = owner; |
|
|
452 | } |
|
|
453 | |
|
|
454 | int |
|
|
455 | object::slottype () const |
|
|
456 | { |
|
|
457 | if (type == SKILL) |
|
|
458 | { |
|
|
459 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
460 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
461 | } |
|
|
462 | else |
|
|
463 | { |
|
|
464 | if (slot [body_combat].info) return slot_combat; |
|
|
465 | if (slot [body_range ].info) return slot_ranged; |
|
|
466 | } |
|
|
467 | |
|
|
468 | return slot_none; |
|
|
469 | } |
|
|
470 | |
|
|
471 | bool |
|
|
472 | object::change_weapon (object *ob) |
|
|
473 | { |
|
|
474 | if (current_weapon == ob) |
|
|
475 | return true; |
|
|
476 | |
|
|
477 | if (chosen_skill) |
|
|
478 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
479 | |
|
|
480 | current_weapon = ob; |
|
|
481 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
482 | |
|
|
483 | if (chosen_skill) |
|
|
484 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
485 | |
|
|
486 | update_stats (); |
|
|
487 | |
|
|
488 | if (ob) |
|
|
489 | { |
|
|
490 | // now check wether any body locations became invalid, in which case |
|
|
491 | // we cannot apply the weapon at the moment. |
|
|
492 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
493 | if (slot[i].used < 0) |
|
|
494 | { |
|
|
495 | current_weapon = chosen_skill = 0; |
|
|
496 | update_stats (); |
|
|
497 | |
|
|
498 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
499 | "You try to balance all your items at once, " |
|
|
500 | "but the %s is just too much for your body. " |
|
|
501 | "[You need to unapply some items first.]", &ob->name); |
|
|
502 | return false; |
|
|
503 | } |
|
|
504 | |
|
|
505 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
506 | } |
|
|
507 | else |
|
|
508 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
509 | |
|
|
510 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
511 | { |
|
|
512 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
513 | &name, ob->debug_desc ()); |
|
|
514 | return false; |
|
|
515 | } |
|
|
516 | |
|
|
517 | return true; |
452 | } |
518 | } |
453 | |
519 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
520 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
521 | * refcounts and freeing the links. |
456 | */ |
522 | */ |
… | |
… | |
538 | * need for monsters, but doesn't hurt to do it for everything. |
604 | * need for monsters, but doesn't hurt to do it for everything. |
539 | * by doing so, when a monster is created, it has good starting |
605 | * by doing so, when a monster is created, it has good starting |
540 | * values for the body_used info, so when items are created |
606 | * values for the body_used info, so when items are created |
541 | * for it, they can be properly equipped. |
607 | * for it, they can be properly equipped. |
542 | */ |
608 | */ |
543 | memcpy (body_used, body_info, sizeof (body_used)); |
609 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
610 | slot[i].used = slot[i].info; |
544 | |
611 | |
545 | attachable::instantiate (); |
612 | attachable::instantiate (); |
546 | } |
613 | } |
547 | |
614 | |
548 | object * |
615 | object * |
… | |
… | |
869 | map = freed_map; |
936 | map = freed_map; |
870 | x = 1; |
937 | x = 1; |
871 | y = 1; |
938 | y = 1; |
872 | } |
939 | } |
873 | |
940 | |
874 | head = 0; |
|
|
875 | |
|
|
876 | if (more) |
941 | if (more) |
877 | { |
942 | { |
878 | more->destroy (); |
943 | more->destroy (); |
879 | more = 0; |
944 | more = 0; |
880 | } |
945 | } |
881 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
882 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
883 | owner = 0; |
950 | owner = 0; |
884 | enemy = 0; |
951 | enemy = 0; |
885 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
886 | } |
954 | } |
887 | |
955 | |
888 | void |
956 | void |
889 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
890 | { |
958 | { |
891 | if (destroyed ()) |
959 | if (destroyed ()) |
892 | return; |
960 | return; |
893 | |
961 | |
894 | if (destroy_inventory) |
962 | if (destroy_inventory) |
895 | destroy_inv (false); |
963 | destroy_inv (false); |
|
|
964 | |
|
|
965 | if (is_head ()) |
|
|
966 | if (sound_destroy) |
|
|
967 | play_sound (sound_destroy); |
|
|
968 | else if (flag [FLAG_MONSTER]) |
|
|
969 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
896 | |
970 | |
897 | attachable::destroy (); |
971 | attachable::destroy (); |
898 | } |
972 | } |
899 | |
973 | |
900 | /* |
974 | /* |
… | |
… | |
1021 | { |
1095 | { |
1022 | /* No point updating the players look faces if he is the object |
1096 | /* No point updating the players look faces if he is the object |
1023 | * being removed. |
1097 | * being removed. |
1024 | */ |
1098 | */ |
1025 | |
1099 | |
1026 | if (tmp->type == PLAYER && tmp != this) |
1100 | if (tmp->type == PLAYER && tmp->container == this) |
1027 | { |
|
|
1028 | /* If a container that the player is currently using somehow gets |
1101 | /* If a container that the player is currently using somehow gets |
1029 | * removed (most likely destroyed), update the player view |
1102 | * removed (most likely destroyed), update the player view |
1030 | * appropriately. |
1103 | * appropriately. |
1031 | */ |
1104 | */ |
1032 | if (tmp->container == this) |
|
|
1033 | { |
|
|
1034 | flag [FLAG_APPLIED] = 0; |
|
|
1035 | tmp->container = 0; |
1105 | tmp->close_container (); |
1036 | } |
|
|
1037 | |
|
|
1038 | if (tmp->contr->ns) |
|
|
1039 | tmp->contr->ns->floorbox_update (); |
|
|
1040 | } |
|
|
1041 | |
1106 | |
1042 | /* See if object moving off should effect something */ |
1107 | /* See if object moving off should effect something */ |
1043 | if (check_walk_off |
1108 | if (check_walk_off |
1044 | && ((move_type & tmp->move_off) |
1109 | && ((move_type & tmp->move_off) |
1045 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1110 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1048 | |
1113 | |
1049 | if (destroyed ()) |
1114 | if (destroyed ()) |
1050 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1115 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1051 | } |
1116 | } |
1052 | |
1117 | |
1053 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1054 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1055 | if (tmp->above == tmp) |
|
|
1056 | tmp->above = 0; |
|
|
1057 | |
|
|
1058 | last = tmp; |
1118 | last = tmp; |
1059 | } |
1119 | } |
1060 | |
1120 | |
1061 | /* last == NULL if there are no objects on this space */ |
1121 | /* last == NULL if there are no objects on this space */ |
1062 | //TODO: this makes little sense, why only update the topmost object? |
1122 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1113 | if (more) |
1173 | if (more) |
1114 | return; |
1174 | return; |
1115 | |
1175 | |
1116 | object *prev = this; |
1176 | object *prev = this; |
1117 | |
1177 | |
1118 | for (archetype *at = arch->more; at; at = at->more) |
1178 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1119 | { |
1179 | { |
1120 | object *op = arch_to_object (at); |
1180 | object *op = arch_to_object (at); |
1121 | |
1181 | |
1122 | op->name = name; |
1182 | op->name = name; |
1123 | op->name_pl = name_pl; |
1183 | op->name_pl = name_pl; |
… | |
… | |
1137 | object * |
1197 | object * |
1138 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1198 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1139 | { |
1199 | { |
1140 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1200 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1141 | { |
1201 | { |
1142 | tmp->x = x + tmp->arch->clone.x; |
1202 | tmp->x = x + tmp->arch->x; |
1143 | tmp->y = y + tmp->arch->clone.y; |
1203 | tmp->y = y + tmp->arch->y; |
1144 | } |
1204 | } |
1145 | |
1205 | |
1146 | return insert_ob_in_map (op, m, originator, flag); |
1206 | return insert_ob_in_map (op, m, originator, flag); |
1147 | } |
1207 | } |
1148 | |
1208 | |
… | |
… | |
1169 | object * |
1229 | object * |
1170 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1230 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1171 | { |
1231 | { |
1172 | assert (!op->flag [FLAG_FREED]); |
1232 | assert (!op->flag [FLAG_FREED]); |
1173 | |
1233 | |
1174 | object *tmp, *top, *floor = NULL; |
1234 | object *top, *floor = NULL; |
1175 | |
1235 | |
1176 | op->remove (); |
1236 | op->remove (); |
1177 | |
1237 | |
1178 | #if 0 |
1238 | #if 0 |
1179 | if (!m->active != !op->active) |
1239 | if (!m->active != !op->active) |
… | |
… | |
1195 | #endif |
1255 | #endif |
1196 | return op; |
1256 | return op; |
1197 | } |
1257 | } |
1198 | |
1258 | |
1199 | if (object *more = op->more) |
1259 | if (object *more = op->more) |
1200 | { |
|
|
1201 | if (!insert_ob_in_map (more, m, originator, flag)) |
1260 | if (!insert_ob_in_map (more, m, originator, flag)) |
1202 | { |
|
|
1203 | if (!op->head) |
|
|
1204 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1205 | |
|
|
1206 | return 0; |
1261 | return 0; |
1207 | } |
|
|
1208 | } |
|
|
1209 | |
1262 | |
1210 | CLEAR_FLAG (op, FLAG_REMOVED); |
1263 | CLEAR_FLAG (op, FLAG_REMOVED); |
1211 | |
1264 | |
1212 | /* Ideally, the caller figures this out. However, it complicates a lot |
1265 | /* Ideally, the caller figures this out. However, it complicates a lot |
1213 | * of areas of callers (eg, anything that uses find_free_spot would now |
1266 | * of areas of callers (eg, anything that uses find_free_spot would now |
… | |
… | |
1220 | mapspace &ms = op->ms (); |
1273 | mapspace &ms = op->ms (); |
1221 | |
1274 | |
1222 | /* this has to be done after we translate the coordinates. |
1275 | /* this has to be done after we translate the coordinates. |
1223 | */ |
1276 | */ |
1224 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1277 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1225 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1278 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1226 | if (object::can_merge (op, tmp)) |
1279 | if (object::can_merge (op, tmp)) |
1227 | { |
1280 | { |
1228 | op->nrof += tmp->nrof; |
1281 | op->nrof += tmp->nrof; |
1229 | tmp->destroy (); |
1282 | tmp->destroy (); |
1230 | } |
1283 | } |
… | |
… | |
1319 | */ |
1372 | */ |
1320 | if (last && last->below && last != floor) |
1373 | if (last && last->below && last != floor) |
1321 | top = last->below; |
1374 | top = last->below; |
1322 | } |
1375 | } |
1323 | } /* If objects on this space */ |
1376 | } /* If objects on this space */ |
1324 | |
|
|
1325 | if (flag & INS_MAP_LOAD) |
1377 | if (flag & INS_MAP_LOAD) |
1326 | top = ms.top; |
1378 | top = ms.top; |
1327 | |
1379 | |
1328 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1380 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1329 | top = floor; |
1381 | top = floor; |
… | |
… | |
1399 | * blocked() and wall() work properly), and these flags are updated by |
1451 | * blocked() and wall() work properly), and these flags are updated by |
1400 | * update_object(). |
1452 | * update_object(). |
1401 | */ |
1453 | */ |
1402 | |
1454 | |
1403 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1455 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1404 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1456 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1405 | { |
1457 | { |
1406 | if (check_move_on (op, originator)) |
1458 | if (check_move_on (op, originator)) |
1407 | return 0; |
1459 | return 0; |
1408 | |
1460 | |
1409 | /* If we are a multi part object, lets work our way through the check |
1461 | /* If we are a multi part object, lets work our way through the check |
1410 | * walk on's. |
1462 | * walk on's. |
1411 | */ |
1463 | */ |
1412 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1464 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1413 | if (check_move_on (tmp, originator)) |
1465 | if (check_move_on (tmp, originator)) |
1414 | return 0; |
1466 | return 0; |
1415 | } |
1467 | } |
1416 | |
1468 | |
1417 | return op; |
1469 | return op; |
… | |
… | |
1427 | object *tmp, *tmp1; |
1479 | object *tmp, *tmp1; |
1428 | |
1480 | |
1429 | /* first search for itself and remove any old instances */ |
1481 | /* first search for itself and remove any old instances */ |
1430 | |
1482 | |
1431 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1483 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1432 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1484 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1433 | tmp->destroy (); |
1485 | tmp->destroy (); |
1434 | |
1486 | |
1435 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1487 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1436 | |
1488 | |
1437 | tmp1->x = op->x; |
1489 | tmp1->x = op->x; |
… | |
… | |
1598 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1650 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1599 | free (dump); |
1651 | free (dump); |
1600 | return op; |
1652 | return op; |
1601 | } |
1653 | } |
1602 | |
1654 | |
1603 | if (where->head) |
1655 | if (where->head_ () != where) |
1604 | { |
1656 | { |
1605 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1657 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1606 | where = where->head; |
1658 | where = where->head; |
1607 | } |
1659 | } |
1608 | |
1660 | |
1609 | return where->insert (op); |
1661 | return where->insert (op); |
1610 | } |
1662 | } |
… | |
… | |
1938 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1990 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1939 | { |
1991 | { |
1940 | CLEAR_FLAG (tmp, flag); |
1992 | CLEAR_FLAG (tmp, flag); |
1941 | unflag_inv (tmp, flag); |
1993 | unflag_inv (tmp, flag); |
1942 | } |
1994 | } |
1943 | } |
|
|
1944 | |
|
|
1945 | /* |
|
|
1946 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1947 | * all it's inventory (recursively). |
|
|
1948 | * If checksums are used, a player will get set_cheat called for |
|
|
1949 | * him/her-self and all object carried by a call to this function. |
|
|
1950 | */ |
|
|
1951 | void |
|
|
1952 | set_cheat (object *op) |
|
|
1953 | { |
|
|
1954 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1955 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1956 | } |
1995 | } |
1957 | |
1996 | |
1958 | /* |
1997 | /* |
1959 | * find_free_spot(object, map, x, y, start, stop) will search for |
1998 | * find_free_spot(object, map, x, y, start, stop) will search for |
1960 | * a spot at the given map and coordinates which will be able to contain |
1999 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2078 | object *tmp; |
2117 | object *tmp; |
2079 | maptile *mp; |
2118 | maptile *mp; |
2080 | |
2119 | |
2081 | MoveType blocked, move_type; |
2120 | MoveType blocked, move_type; |
2082 | |
2121 | |
2083 | if (exclude && exclude->head) |
2122 | if (exclude && exclude->head_ () != exclude) |
2084 | { |
2123 | { |
2085 | exclude = exclude->head; |
2124 | exclude = exclude->head; |
2086 | move_type = exclude->move_type; |
2125 | move_type = exclude->move_type; |
2087 | } |
2126 | } |
2088 | else |
2127 | else |
… | |
… | |
2111 | max = maxfree[i]; |
2150 | max = maxfree[i]; |
2112 | else if (mflags & P_IS_ALIVE) |
2151 | else if (mflags & P_IS_ALIVE) |
2113 | { |
2152 | { |
2114 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2153 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2115 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2154 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2116 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2155 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2117 | break; |
2156 | break; |
2118 | |
2157 | |
2119 | if (tmp) |
2158 | if (tmp) |
2120 | return freedir[i]; |
2159 | return freedir[i]; |
2121 | } |
2160 | } |
… | |
… | |
2316 | * create clone from object to another |
2355 | * create clone from object to another |
2317 | */ |
2356 | */ |
2318 | object * |
2357 | object * |
2319 | object_create_clone (object *asrc) |
2358 | object_create_clone (object *asrc) |
2320 | { |
2359 | { |
2321 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2360 | object *dst = 0, *tmp, *src, *prev, *item; |
2322 | |
2361 | |
2323 | if (!asrc) |
2362 | if (!asrc) |
2324 | return 0; |
2363 | return 0; |
2325 | |
2364 | |
2326 | src = asrc; |
|
|
2327 | if (src->head) |
|
|
2328 | src = src->head; |
2365 | src = asrc->head_ (); |
2329 | |
2366 | |
2330 | prev = 0; |
2367 | prev = 0; |
2331 | for (part = src; part; part = part->more) |
2368 | for (object *part = src; part; part = part->more) |
2332 | { |
2369 | { |
2333 | tmp = part->clone (); |
2370 | tmp = part->clone (); |
2334 | tmp->x -= src->x; |
2371 | tmp->x -= src->x; |
2335 | tmp->y -= src->y; |
2372 | tmp->y -= src->y; |
2336 | |
2373 | |
… | |
… | |
2449 | /* Basically, if the archetype has this key set, |
2486 | /* Basically, if the archetype has this key set, |
2450 | * we need to store the null value so when we save |
2487 | * we need to store the null value so when we save |
2451 | * it, we save the empty value so that when we load, |
2488 | * it, we save the empty value so that when we load, |
2452 | * we get this value back again. |
2489 | * we get this value back again. |
2453 | */ |
2490 | */ |
2454 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2491 | if (get_ob_key_link (op->arch, canonical_key)) |
2455 | field->value = 0; |
2492 | field->value = 0; |
2456 | else |
2493 | else |
2457 | { |
2494 | { |
2458 | if (last) |
2495 | if (last) |
2459 | last->next = field->next; |
2496 | last->next = field->next; |
… | |
… | |
2528 | } |
2565 | } |
2529 | else |
2566 | else |
2530 | item = item->env; |
2567 | item = item->env; |
2531 | } |
2568 | } |
2532 | |
2569 | |
2533 | |
|
|
2534 | const char * |
2570 | const char * |
2535 | object::flag_desc (char *desc, int len) const |
2571 | object::flag_desc (char *desc, int len) const |
2536 | { |
2572 | { |
2537 | char *p = desc; |
2573 | char *p = desc; |
2538 | bool first = true; |
2574 | bool first = true; |
… | |
… | |
2584 | } |
2620 | } |
2585 | |
2621 | |
2586 | const char * |
2622 | const char * |
2587 | object::debug_desc () const |
2623 | object::debug_desc () const |
2588 | { |
2624 | { |
2589 | static char info[256 * 4]; |
2625 | static char info[3][256 * 4]; |
|
|
2626 | static int info_idx; |
|
|
2627 | |
2590 | return debug_desc (info); |
2628 | return debug_desc (info [++info_idx % 3]); |
2591 | } |
|
|
2592 | |
|
|
2593 | const char * |
|
|
2594 | object::debug_desc2 () const |
|
|
2595 | { |
|
|
2596 | static char info[256 * 4]; |
|
|
2597 | return debug_desc (info); |
|
|
2598 | } |
2629 | } |
2599 | |
2630 | |
2600 | struct region * |
2631 | struct region * |
2601 | object::region () const |
2632 | object::region () const |
2602 | { |
2633 | { |
… | |
… | |
2605 | } |
2636 | } |
2606 | |
2637 | |
2607 | const materialtype_t * |
2638 | const materialtype_t * |
2608 | object::dominant_material () const |
2639 | object::dominant_material () const |
2609 | { |
2640 | { |
2610 | if (materialtype_t *mat = name_to_material (materialname)) |
2641 | if (materialtype_t *mt = name_to_material (materialname)) |
2611 | return mat; |
2642 | return mt; |
2612 | |
2643 | |
2613 | // omfg this is slow, this has to be temporary :) |
|
|
2614 | shstr unknown ("unknown"); |
|
|
2615 | |
|
|
2616 | return name_to_material (unknown); |
2644 | return name_to_material (shstr_unknown); |
2617 | } |
2645 | } |
2618 | |
2646 | |
2619 | void |
2647 | void |
2620 | object::open_container (object *new_container) |
2648 | object::open_container (object *new_container) |
2621 | { |
2649 | { |
… | |
… | |
2665 | esrv_update_item (UPD_FLAGS, this, new_container); |
2693 | esrv_update_item (UPD_FLAGS, this, new_container); |
2666 | esrv_send_inventory (this, new_container); |
2694 | esrv_send_inventory (this, new_container); |
2667 | } |
2695 | } |
2668 | } |
2696 | } |
2669 | |
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); |
2670 | |
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 | |