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 | } |
507 | else |
507 | else |
508 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
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 | } |
509 | |
516 | |
510 | return true; |
517 | return true; |
511 | } |
518 | } |
512 | |
519 | |
513 | /* Zero the key_values on op, decrementing the shared-string |
520 | /* Zero the key_values on op, decrementing the shared-string |
… | |
… | |
929 | map = freed_map; |
936 | map = freed_map; |
930 | x = 1; |
937 | x = 1; |
931 | y = 1; |
938 | y = 1; |
932 | } |
939 | } |
933 | |
940 | |
934 | head = 0; |
|
|
935 | |
|
|
936 | if (more) |
941 | if (more) |
937 | { |
942 | { |
938 | more->destroy (); |
943 | more->destroy (); |
939 | more = 0; |
944 | more = 0; |
940 | } |
945 | } |
941 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
942 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
943 | owner = 0; |
950 | owner = 0; |
944 | enemy = 0; |
951 | enemy = 0; |
945 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
946 | } |
954 | } |
947 | |
955 | |
948 | void |
956 | void |
949 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
950 | { |
958 | { |
… | |
… | |
1108 | |
1116 | |
1109 | if (destroyed ()) |
1117 | if (destroyed ()) |
1110 | 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 ()); |
1111 | } |
1119 | } |
1112 | |
1120 | |
1113 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1114 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1115 | if (tmp->above == tmp) |
|
|
1116 | tmp->above = 0; |
|
|
1117 | |
|
|
1118 | last = tmp; |
1121 | last = tmp; |
1119 | } |
1122 | } |
1120 | |
1123 | |
1121 | /* last == NULL if there are no objects on this space */ |
1124 | /* last == NULL if there are no objects on this space */ |
1122 | //TODO: this makes little sense, why only update the topmost object? |
1125 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1173 | if (more) |
1176 | if (more) |
1174 | return; |
1177 | return; |
1175 | |
1178 | |
1176 | object *prev = this; |
1179 | object *prev = this; |
1177 | |
1180 | |
1178 | for (archetype *at = arch->more; at; at = at->more) |
1181 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1179 | { |
1182 | { |
1180 | object *op = arch_to_object (at); |
1183 | object *op = arch_to_object (at); |
1181 | |
1184 | |
1182 | op->name = name; |
1185 | op->name = name; |
1183 | op->name_pl = name_pl; |
1186 | op->name_pl = name_pl; |
… | |
… | |
1197 | object * |
1200 | object * |
1198 | 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) |
1199 | { |
1202 | { |
1200 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1203 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1201 | { |
1204 | { |
1202 | tmp->x = x + tmp->arch->clone.x; |
1205 | tmp->x = x + tmp->arch->x; |
1203 | tmp->y = y + tmp->arch->clone.y; |
1206 | tmp->y = y + tmp->arch->y; |
1204 | } |
1207 | } |
1205 | |
1208 | |
1206 | return insert_ob_in_map (op, m, originator, flag); |
1209 | return insert_ob_in_map (op, m, originator, flag); |
1207 | } |
1210 | } |
1208 | |
1211 | |
… | |
… | |
1229 | object * |
1232 | object * |
1230 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1233 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1231 | { |
1234 | { |
1232 | assert (!op->flag [FLAG_FREED]); |
1235 | assert (!op->flag [FLAG_FREED]); |
1233 | |
1236 | |
1234 | object *tmp, *top, *floor = NULL; |
1237 | object *top, *floor = NULL; |
1235 | |
1238 | |
1236 | op->remove (); |
1239 | op->remove (); |
1237 | |
1240 | |
1238 | #if 0 |
1241 | #if 0 |
1239 | if (!m->active != !op->active) |
1242 | if (!m->active != !op->active) |
… | |
… | |
1255 | #endif |
1258 | #endif |
1256 | return op; |
1259 | return op; |
1257 | } |
1260 | } |
1258 | |
1261 | |
1259 | if (object *more = op->more) |
1262 | if (object *more = op->more) |
1260 | { |
|
|
1261 | if (!insert_ob_in_map (more, m, originator, flag)) |
1263 | if (!insert_ob_in_map (more, m, originator, flag)) |
1262 | { |
|
|
1263 | if (!op->head) |
|
|
1264 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1265 | |
|
|
1266 | return 0; |
1264 | return 0; |
1267 | } |
|
|
1268 | } |
|
|
1269 | |
1265 | |
1270 | CLEAR_FLAG (op, FLAG_REMOVED); |
1266 | CLEAR_FLAG (op, FLAG_REMOVED); |
1271 | |
1267 | |
1272 | /* Ideally, the caller figures this out. However, it complicates a lot |
1268 | /* Ideally, the caller figures this out. However, it complicates a lot |
1273 | * of areas of callers (eg, anything that uses find_free_spot would now |
1269 | * of areas of callers (eg, anything that uses find_free_spot would now |
… | |
… | |
1280 | mapspace &ms = op->ms (); |
1276 | mapspace &ms = op->ms (); |
1281 | |
1277 | |
1282 | /* this has to be done after we translate the coordinates. |
1278 | /* this has to be done after we translate the coordinates. |
1283 | */ |
1279 | */ |
1284 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1280 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1285 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1281 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1286 | if (object::can_merge (op, tmp)) |
1282 | if (object::can_merge (op, tmp)) |
1287 | { |
1283 | { |
1288 | op->nrof += tmp->nrof; |
1284 | op->nrof += tmp->nrof; |
1289 | tmp->destroy (); |
1285 | tmp->destroy (); |
1290 | } |
1286 | } |
… | |
… | |
1459 | * blocked() and wall() work properly), and these flags are updated by |
1455 | * blocked() and wall() work properly), and these flags are updated by |
1460 | * update_object(). |
1456 | * update_object(). |
1461 | */ |
1457 | */ |
1462 | |
1458 | |
1463 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1459 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1464 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1460 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1465 | { |
1461 | { |
1466 | if (check_move_on (op, originator)) |
1462 | if (check_move_on (op, originator)) |
1467 | return 0; |
1463 | return 0; |
1468 | |
1464 | |
1469 | /* If we are a multi part object, lets work our way through the check |
1465 | /* If we are a multi part object, lets work our way through the check |
1470 | * walk on's. |
1466 | * walk on's. |
1471 | */ |
1467 | */ |
1472 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1468 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1473 | if (check_move_on (tmp, originator)) |
1469 | if (check_move_on (tmp, originator)) |
1474 | return 0; |
1470 | return 0; |
1475 | } |
1471 | } |
1476 | |
1472 | |
1477 | return op; |
1473 | return op; |
… | |
… | |
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; |
… | |
… | |
1658 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1654 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1659 | free (dump); |
1655 | free (dump); |
1660 | return op; |
1656 | return op; |
1661 | } |
1657 | } |
1662 | |
1658 | |
1663 | if (where->head) |
1659 | if (where->head_ () != where) |
1664 | { |
1660 | { |
1665 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1661 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1666 | where = where->head; |
1662 | where = where->head; |
1667 | } |
1663 | } |
1668 | |
1664 | |
1669 | return where->insert (op); |
1665 | return where->insert (op); |
1670 | } |
1666 | } |
… | |
… | |
1998 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1994 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1999 | { |
1995 | { |
2000 | CLEAR_FLAG (tmp, flag); |
1996 | CLEAR_FLAG (tmp, flag); |
2001 | unflag_inv (tmp, flag); |
1997 | unflag_inv (tmp, flag); |
2002 | } |
1998 | } |
2003 | } |
|
|
2004 | |
|
|
2005 | /* |
|
|
2006 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
2007 | * all it's inventory (recursively). |
|
|
2008 | * If checksums are used, a player will get set_cheat called for |
|
|
2009 | * him/her-self and all object carried by a call to this function. |
|
|
2010 | */ |
|
|
2011 | void |
|
|
2012 | set_cheat (object *op) |
|
|
2013 | { |
|
|
2014 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
2015 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
2016 | } |
1999 | } |
2017 | |
2000 | |
2018 | /* |
2001 | /* |
2019 | * find_free_spot(object, map, x, y, start, stop) will search for |
2002 | * find_free_spot(object, map, x, y, start, stop) will search for |
2020 | * a spot at the given map and coordinates which will be able to contain |
2003 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2138 | object *tmp; |
2121 | object *tmp; |
2139 | maptile *mp; |
2122 | maptile *mp; |
2140 | |
2123 | |
2141 | MoveType blocked, move_type; |
2124 | MoveType blocked, move_type; |
2142 | |
2125 | |
2143 | if (exclude && exclude->head) |
2126 | if (exclude && exclude->head_ () != exclude) |
2144 | { |
2127 | { |
2145 | exclude = exclude->head; |
2128 | exclude = exclude->head; |
2146 | move_type = exclude->move_type; |
2129 | move_type = exclude->move_type; |
2147 | } |
2130 | } |
2148 | else |
2131 | else |
… | |
… | |
2171 | max = maxfree[i]; |
2154 | max = maxfree[i]; |
2172 | else if (mflags & P_IS_ALIVE) |
2155 | else if (mflags & P_IS_ALIVE) |
2173 | { |
2156 | { |
2174 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2157 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2175 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2158 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2176 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2159 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2177 | break; |
2160 | break; |
2178 | |
2161 | |
2179 | if (tmp) |
2162 | if (tmp) |
2180 | return freedir[i]; |
2163 | return freedir[i]; |
2181 | } |
2164 | } |
… | |
… | |
2376 | * create clone from object to another |
2359 | * create clone from object to another |
2377 | */ |
2360 | */ |
2378 | object * |
2361 | object * |
2379 | object_create_clone (object *asrc) |
2362 | object_create_clone (object *asrc) |
2380 | { |
2363 | { |
2381 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2364 | object *dst = 0, *tmp, *src, *prev, *item; |
2382 | |
2365 | |
2383 | if (!asrc) |
2366 | if (!asrc) |
2384 | return 0; |
2367 | return 0; |
2385 | |
2368 | |
2386 | src = asrc; |
|
|
2387 | if (src->head) |
|
|
2388 | src = src->head; |
2369 | src = asrc->head_ (); |
2389 | |
2370 | |
2390 | prev = 0; |
2371 | prev = 0; |
2391 | for (part = src; part; part = part->more) |
2372 | for (object *part = src; part; part = part->more) |
2392 | { |
2373 | { |
2393 | tmp = part->clone (); |
2374 | tmp = part->clone (); |
2394 | tmp->x -= src->x; |
2375 | tmp->x -= src->x; |
2395 | tmp->y -= src->y; |
2376 | tmp->y -= src->y; |
2396 | |
2377 | |
… | |
… | |
2509 | /* Basically, if the archetype has this key set, |
2490 | /* Basically, if the archetype has this key set, |
2510 | * we need to store the null value so when we save |
2491 | * we need to store the null value so when we save |
2511 | * it, we save the empty value so that when we load, |
2492 | * it, we save the empty value so that when we load, |
2512 | * we get this value back again. |
2493 | * we get this value back again. |
2513 | */ |
2494 | */ |
2514 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2495 | if (get_ob_key_link (op->arch, canonical_key)) |
2515 | field->value = 0; |
2496 | field->value = 0; |
2516 | else |
2497 | else |
2517 | { |
2498 | { |
2518 | if (last) |
2499 | if (last) |
2519 | last->next = field->next; |
2500 | last->next = field->next; |
… | |
… | |
2587 | item = item->inv; |
2568 | item = item->inv; |
2588 | } |
2569 | } |
2589 | else |
2570 | else |
2590 | item = item->env; |
2571 | item = item->env; |
2591 | } |
2572 | } |
2592 | |
|
|
2593 | |
2573 | |
2594 | const char * |
2574 | const char * |
2595 | object::flag_desc (char *desc, int len) const |
2575 | object::flag_desc (char *desc, int len) const |
2596 | { |
2576 | { |
2597 | char *p = desc; |
2577 | char *p = desc; |
… | |
… | |
2720 | esrv_update_item (UPD_FLAGS, this, new_container); |
2700 | esrv_update_item (UPD_FLAGS, this, new_container); |
2721 | esrv_send_inventory (this, new_container); |
2701 | esrv_send_inventory (this, new_container); |
2722 | } |
2702 | } |
2723 | } |
2703 | } |
2724 | |
2704 | |
|
|
2705 | object * |
|
|
2706 | object::force_find (const shstr name) |
|
|
2707 | { |
|
|
2708 | /* cycle through his inventory to look for the MARK we want to |
|
|
2709 | * place |
|
|
2710 | */ |
|
|
2711 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2712 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2713 | return splay (tmp); |
2725 | |
2714 | |
|
|
2715 | return 0; |
|
|
2716 | } |
|
|
2717 | |
|
|
2718 | void |
|
|
2719 | object::force_add (const shstr name, int duration) |
|
|
2720 | { |
|
|
2721 | if (object *force = force_find (name)) |
|
|
2722 | force->destroy (); |
|
|
2723 | |
|
|
2724 | object *force = get_archetype (FORCE_NAME); |
|
|
2725 | |
|
|
2726 | force->slaying = name; |
|
|
2727 | force->stats.food = 1; |
|
|
2728 | force->speed_left = -1.f; |
|
|
2729 | |
|
|
2730 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2731 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2732 | force->flag [FLAG_APPLIED] = true; |
|
|
2733 | |
|
|
2734 | insert (force); |
|
|
2735 | } |
|
|
2736 | |
|
|
2737 | |