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. */ |
… | |
… | |
495 | { |
494 | { |
496 | current_weapon = chosen_skill = 0; |
495 | current_weapon = chosen_skill = 0; |
497 | update_stats (); |
496 | update_stats (); |
498 | |
497 | |
499 | new_draw_info_format (NDI_UNIQUE, 0, this, |
498 | new_draw_info_format (NDI_UNIQUE, 0, this, |
500 | "You try to balance your applied items all at once, but the %s is too much. " |
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); |
501 | "[You need to unapply some items first.]", &ob->name); |
502 | return false; |
502 | return false; |
503 | } |
503 | } |
504 | |
504 | |
505 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
505 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
506 | } |
506 | } |
… | |
… | |
936 | map = freed_map; |
936 | map = freed_map; |
937 | x = 1; |
937 | x = 1; |
938 | y = 1; |
938 | y = 1; |
939 | } |
939 | } |
940 | |
940 | |
941 | head = 0; |
|
|
942 | |
|
|
943 | if (more) |
941 | if (more) |
944 | { |
942 | { |
945 | more->destroy (); |
943 | more->destroy (); |
946 | more = 0; |
944 | more = 0; |
947 | } |
945 | } |
948 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
949 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
950 | owner = 0; |
950 | owner = 0; |
951 | enemy = 0; |
951 | enemy = 0; |
952 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
953 | } |
954 | } |
954 | |
955 | |
955 | void |
956 | void |
956 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
957 | { |
958 | { |
… | |
… | |
1115 | |
1116 | |
1116 | if (destroyed ()) |
1117 | if (destroyed ()) |
1117 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1118 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1118 | } |
1119 | } |
1119 | |
1120 | |
1120 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1121 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1122 | if (tmp->above == tmp) |
|
|
1123 | tmp->above = 0; |
|
|
1124 | |
|
|
1125 | last = tmp; |
1121 | last = tmp; |
1126 | } |
1122 | } |
1127 | |
1123 | |
1128 | /* last == NULL if there are no objects on this space */ |
1124 | /* last == NULL if there are no objects on this space */ |
1129 | //TODO: this makes little sense, why only update the topmost object? |
1125 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1180 | if (more) |
1176 | if (more) |
1181 | return; |
1177 | return; |
1182 | |
1178 | |
1183 | object *prev = this; |
1179 | object *prev = this; |
1184 | |
1180 | |
1185 | for (archetype *at = arch->more; at; at = at->more) |
1181 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1186 | { |
1182 | { |
1187 | object *op = arch_to_object (at); |
1183 | object *op = arch_to_object (at); |
1188 | |
1184 | |
1189 | op->name = name; |
1185 | op->name = name; |
1190 | op->name_pl = name_pl; |
1186 | op->name_pl = name_pl; |
… | |
… | |
1204 | object * |
1200 | object * |
1205 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1201 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1206 | { |
1202 | { |
1207 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1203 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1208 | { |
1204 | { |
1209 | tmp->x = x + tmp->arch->clone.x; |
1205 | tmp->x = x + tmp->arch->x; |
1210 | tmp->y = y + tmp->arch->clone.y; |
1206 | tmp->y = y + tmp->arch->y; |
1211 | } |
1207 | } |
1212 | |
1208 | |
1213 | return insert_ob_in_map (op, m, originator, flag); |
1209 | return insert_ob_in_map (op, m, originator, flag); |
1214 | } |
1210 | } |
1215 | |
1211 | |
… | |
… | |
1487 | object *tmp, *tmp1; |
1483 | object *tmp, *tmp1; |
1488 | |
1484 | |
1489 | /* first search for itself and remove any old instances */ |
1485 | /* first search for itself and remove any old instances */ |
1490 | |
1486 | |
1491 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1487 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1492 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1488 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1493 | tmp->destroy (); |
1489 | tmp->destroy (); |
1494 | |
1490 | |
1495 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1491 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1496 | |
1492 | |
1497 | tmp1->x = op->x; |
1493 | tmp1->x = op->x; |
… | |
… | |
2494 | /* Basically, if the archetype has this key set, |
2490 | /* Basically, if the archetype has this key set, |
2495 | * we need to store the null value so when we save |
2491 | * we need to store the null value so when we save |
2496 | * it, we save the empty value so that when we load, |
2492 | * it, we save the empty value so that when we load, |
2497 | * we get this value back again. |
2493 | * we get this value back again. |
2498 | */ |
2494 | */ |
2499 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2495 | if (get_ob_key_link (op->arch, canonical_key)) |
2500 | field->value = 0; |
2496 | field->value = 0; |
2501 | else |
2497 | else |
2502 | { |
2498 | { |
2503 | if (last) |
2499 | if (last) |
2504 | last->next = field->next; |
2500 | last->next = field->next; |
… | |
… | |
2572 | item = item->inv; |
2568 | item = item->inv; |
2573 | } |
2569 | } |
2574 | else |
2570 | else |
2575 | item = item->env; |
2571 | item = item->env; |
2576 | } |
2572 | } |
2577 | |
|
|
2578 | |
2573 | |
2579 | const char * |
2574 | const char * |
2580 | object::flag_desc (char *desc, int len) const |
2575 | object::flag_desc (char *desc, int len) const |
2581 | { |
2576 | { |
2582 | char *p = desc; |
2577 | char *p = desc; |