1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
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 it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * 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 along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
27 | variable. */ |
… | |
… | |
473 | object::change_weapon (object *ob) |
473 | object::change_weapon (object *ob) |
474 | { |
474 | { |
475 | if (current_weapon == ob) |
475 | if (current_weapon == ob) |
476 | return true; |
476 | return true; |
477 | |
477 | |
|
|
478 | if (chosen_skill) |
|
|
479 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
480 | |
478 | current_weapon = ob; |
481 | current_weapon = ob; |
479 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
482 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
483 | |
|
|
484 | if (chosen_skill) |
|
|
485 | chosen_skill->flag [FLAG_APPLIED] = true; |
480 | |
486 | |
481 | update_stats (); |
487 | update_stats (); |
482 | |
488 | |
483 | if (ob) |
489 | if (ob) |
484 | { |
490 | { |
… | |
… | |
489 | { |
495 | { |
490 | current_weapon = chosen_skill = 0; |
496 | current_weapon = chosen_skill = 0; |
491 | update_stats (); |
497 | update_stats (); |
492 | |
498 | |
493 | new_draw_info_format (NDI_UNIQUE, 0, this, |
499 | new_draw_info_format (NDI_UNIQUE, 0, this, |
494 | "You try to balance your applied items all at once, but the %s is too much. " |
500 | "You try to balance all your items at once, " |
|
|
501 | "but the %s is just too much for your body. " |
495 | "You need to unapply some items first.", &ob->name); |
502 | "[You need to unapply some items first.]", &ob->name); |
496 | return false; |
503 | return false; |
497 | } |
504 | } |
498 | |
505 | |
499 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
506 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
500 | } |
507 | } |
501 | else |
508 | else |
502 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
509 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
510 | |
|
|
511 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
512 | { |
|
|
513 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
514 | &name, ob->debug_desc ()); |
|
|
515 | return false; |
|
|
516 | } |
503 | |
517 | |
504 | return true; |
518 | return true; |
505 | } |
519 | } |
506 | |
520 | |
507 | /* Zero the key_values on op, decrementing the shared-string |
521 | /* Zero the key_values on op, decrementing the shared-string |
… | |
… | |
923 | map = freed_map; |
937 | map = freed_map; |
924 | x = 1; |
938 | x = 1; |
925 | y = 1; |
939 | y = 1; |
926 | } |
940 | } |
927 | |
941 | |
928 | head = 0; |
|
|
929 | |
|
|
930 | if (more) |
942 | if (more) |
931 | { |
943 | { |
932 | more->destroy (); |
944 | more->destroy (); |
933 | more = 0; |
945 | more = 0; |
934 | } |
946 | } |
935 | |
947 | |
|
|
948 | head = 0; |
|
|
949 | |
936 | // clear those pointers that likely might have circular references to us |
950 | // clear those pointers that likely might cause circular references |
937 | owner = 0; |
951 | owner = 0; |
938 | enemy = 0; |
952 | enemy = 0; |
939 | attacked_by = 0; |
953 | attacked_by = 0; |
|
|
954 | current_weapon = 0; |
940 | } |
955 | } |
941 | |
956 | |
942 | void |
957 | void |
943 | object::destroy (bool destroy_inventory) |
958 | object::destroy (bool destroy_inventory) |
944 | { |
959 | { |
… | |
… | |
1102 | |
1117 | |
1103 | if (destroyed ()) |
1118 | if (destroyed ()) |
1104 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1119 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1105 | } |
1120 | } |
1106 | |
1121 | |
1107 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1108 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1109 | if (tmp->above == tmp) |
|
|
1110 | tmp->above = 0; |
|
|
1111 | |
|
|
1112 | last = tmp; |
1122 | last = tmp; |
1113 | } |
1123 | } |
1114 | |
1124 | |
1115 | /* last == NULL if there are no objects on this space */ |
1125 | /* last == NULL if there are no objects on this space */ |
1116 | //TODO: this makes little sense, why only update the topmost object? |
1126 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1167 | if (more) |
1177 | if (more) |
1168 | return; |
1178 | return; |
1169 | |
1179 | |
1170 | object *prev = this; |
1180 | object *prev = this; |
1171 | |
1181 | |
1172 | for (archetype *at = arch->more; at; at = at->more) |
1182 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1173 | { |
1183 | { |
1174 | object *op = arch_to_object (at); |
1184 | object *op = arch_to_object (at); |
1175 | |
1185 | |
1176 | op->name = name; |
1186 | op->name = name; |
1177 | op->name_pl = name_pl; |
1187 | op->name_pl = name_pl; |
… | |
… | |
1191 | object * |
1201 | object * |
1192 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1202 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1193 | { |
1203 | { |
1194 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1204 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1195 | { |
1205 | { |
1196 | tmp->x = x + tmp->arch->clone.x; |
1206 | tmp->x = x + tmp->arch->x; |
1197 | tmp->y = y + tmp->arch->clone.y; |
1207 | tmp->y = y + tmp->arch->y; |
1198 | } |
1208 | } |
1199 | |
1209 | |
1200 | return insert_ob_in_map (op, m, originator, flag); |
1210 | return insert_ob_in_map (op, m, originator, flag); |
1201 | } |
1211 | } |
1202 | |
1212 | |
… | |
… | |
1223 | object * |
1233 | object * |
1224 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1234 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1225 | { |
1235 | { |
1226 | assert (!op->flag [FLAG_FREED]); |
1236 | assert (!op->flag [FLAG_FREED]); |
1227 | |
1237 | |
1228 | object *tmp, *top, *floor = NULL; |
1238 | object *top, *floor = NULL; |
1229 | |
1239 | |
1230 | op->remove (); |
1240 | op->remove (); |
1231 | |
1241 | |
1232 | #if 0 |
1242 | #if 0 |
1233 | if (!m->active != !op->active) |
1243 | if (!m->active != !op->active) |
… | |
… | |
1249 | #endif |
1259 | #endif |
1250 | return op; |
1260 | return op; |
1251 | } |
1261 | } |
1252 | |
1262 | |
1253 | if (object *more = op->more) |
1263 | if (object *more = op->more) |
1254 | { |
|
|
1255 | if (!insert_ob_in_map (more, m, originator, flag)) |
1264 | if (!insert_ob_in_map (more, m, originator, flag)) |
1256 | { |
|
|
1257 | if (!op->head) |
|
|
1258 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1259 | |
|
|
1260 | return 0; |
1265 | return 0; |
1261 | } |
|
|
1262 | } |
|
|
1263 | |
1266 | |
1264 | CLEAR_FLAG (op, FLAG_REMOVED); |
1267 | CLEAR_FLAG (op, FLAG_REMOVED); |
1265 | |
1268 | |
1266 | /* Ideally, the caller figures this out. However, it complicates a lot |
1269 | /* Ideally, the caller figures this out. However, it complicates a lot |
1267 | * of areas of callers (eg, anything that uses find_free_spot would now |
1270 | * of areas of callers (eg, anything that uses find_free_spot would now |
… | |
… | |
1274 | mapspace &ms = op->ms (); |
1277 | mapspace &ms = op->ms (); |
1275 | |
1278 | |
1276 | /* this has to be done after we translate the coordinates. |
1279 | /* this has to be done after we translate the coordinates. |
1277 | */ |
1280 | */ |
1278 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1281 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1279 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1282 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1280 | if (object::can_merge (op, tmp)) |
1283 | if (object::can_merge (op, tmp)) |
1281 | { |
1284 | { |
1282 | op->nrof += tmp->nrof; |
1285 | op->nrof += tmp->nrof; |
1283 | tmp->destroy (); |
1286 | tmp->destroy (); |
1284 | } |
1287 | } |
… | |
… | |
1453 | * blocked() and wall() work properly), and these flags are updated by |
1456 | * blocked() and wall() work properly), and these flags are updated by |
1454 | * update_object(). |
1457 | * update_object(). |
1455 | */ |
1458 | */ |
1456 | |
1459 | |
1457 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1460 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1458 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1461 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1459 | { |
1462 | { |
1460 | if (check_move_on (op, originator)) |
1463 | if (check_move_on (op, originator)) |
1461 | return 0; |
1464 | return 0; |
1462 | |
1465 | |
1463 | /* If we are a multi part object, lets work our way through the check |
1466 | /* If we are a multi part object, lets work our way through the check |
1464 | * walk on's. |
1467 | * walk on's. |
1465 | */ |
1468 | */ |
1466 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1469 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1467 | if (check_move_on (tmp, originator)) |
1470 | if (check_move_on (tmp, originator)) |
1468 | return 0; |
1471 | return 0; |
1469 | } |
1472 | } |
1470 | |
1473 | |
1471 | return op; |
1474 | return op; |
… | |
… | |
1481 | object *tmp, *tmp1; |
1484 | object *tmp, *tmp1; |
1482 | |
1485 | |
1483 | /* first search for itself and remove any old instances */ |
1486 | /* first search for itself and remove any old instances */ |
1484 | |
1487 | |
1485 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1488 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1486 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1489 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1487 | tmp->destroy (); |
1490 | tmp->destroy (); |
1488 | |
1491 | |
1489 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1492 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1490 | |
1493 | |
1491 | tmp1->x = op->x; |
1494 | tmp1->x = op->x; |
… | |
… | |
1652 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1655 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1653 | free (dump); |
1656 | free (dump); |
1654 | return op; |
1657 | return op; |
1655 | } |
1658 | } |
1656 | |
1659 | |
1657 | if (where->head) |
1660 | if (where->head_ () != where) |
1658 | { |
1661 | { |
1659 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1662 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1660 | where = where->head; |
1663 | where = where->head; |
1661 | } |
1664 | } |
1662 | |
1665 | |
1663 | return where->insert (op); |
1666 | return where->insert (op); |
1664 | } |
1667 | } |
… | |
… | |
1992 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1995 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1993 | { |
1996 | { |
1994 | CLEAR_FLAG (tmp, flag); |
1997 | CLEAR_FLAG (tmp, flag); |
1995 | unflag_inv (tmp, flag); |
1998 | unflag_inv (tmp, flag); |
1996 | } |
1999 | } |
1997 | } |
|
|
1998 | |
|
|
1999 | /* |
|
|
2000 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
2001 | * all it's inventory (recursively). |
|
|
2002 | * If checksums are used, a player will get set_cheat called for |
|
|
2003 | * him/her-self and all object carried by a call to this function. |
|
|
2004 | */ |
|
|
2005 | void |
|
|
2006 | set_cheat (object *op) |
|
|
2007 | { |
|
|
2008 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
2009 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
2010 | } |
2000 | } |
2011 | |
2001 | |
2012 | /* |
2002 | /* |
2013 | * find_free_spot(object, map, x, y, start, stop) will search for |
2003 | * find_free_spot(object, map, x, y, start, stop) will search for |
2014 | * a spot at the given map and coordinates which will be able to contain |
2004 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2132 | object *tmp; |
2122 | object *tmp; |
2133 | maptile *mp; |
2123 | maptile *mp; |
2134 | |
2124 | |
2135 | MoveType blocked, move_type; |
2125 | MoveType blocked, move_type; |
2136 | |
2126 | |
2137 | if (exclude && exclude->head) |
2127 | if (exclude && exclude->head_ () != exclude) |
2138 | { |
2128 | { |
2139 | exclude = exclude->head; |
2129 | exclude = exclude->head; |
2140 | move_type = exclude->move_type; |
2130 | move_type = exclude->move_type; |
2141 | } |
2131 | } |
2142 | else |
2132 | else |
… | |
… | |
2165 | max = maxfree[i]; |
2155 | max = maxfree[i]; |
2166 | else if (mflags & P_IS_ALIVE) |
2156 | else if (mflags & P_IS_ALIVE) |
2167 | { |
2157 | { |
2168 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2158 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2169 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2159 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2170 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2160 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2171 | break; |
2161 | break; |
2172 | |
2162 | |
2173 | if (tmp) |
2163 | if (tmp) |
2174 | return freedir[i]; |
2164 | return freedir[i]; |
2175 | } |
2165 | } |
… | |
… | |
2370 | * create clone from object to another |
2360 | * create clone from object to another |
2371 | */ |
2361 | */ |
2372 | object * |
2362 | object * |
2373 | object_create_clone (object *asrc) |
2363 | object_create_clone (object *asrc) |
2374 | { |
2364 | { |
2375 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2365 | object *dst = 0, *tmp, *src, *prev, *item; |
2376 | |
2366 | |
2377 | if (!asrc) |
2367 | if (!asrc) |
2378 | return 0; |
2368 | return 0; |
2379 | |
2369 | |
2380 | src = asrc; |
|
|
2381 | if (src->head) |
|
|
2382 | src = src->head; |
2370 | src = asrc->head_ (); |
2383 | |
2371 | |
2384 | prev = 0; |
2372 | prev = 0; |
2385 | for (part = src; part; part = part->more) |
2373 | for (object *part = src; part; part = part->more) |
2386 | { |
2374 | { |
2387 | tmp = part->clone (); |
2375 | tmp = part->clone (); |
2388 | tmp->x -= src->x; |
2376 | tmp->x -= src->x; |
2389 | tmp->y -= src->y; |
2377 | tmp->y -= src->y; |
2390 | |
2378 | |
… | |
… | |
2503 | /* Basically, if the archetype has this key set, |
2491 | /* Basically, if the archetype has this key set, |
2504 | * we need to store the null value so when we save |
2492 | * we need to store the null value so when we save |
2505 | * it, we save the empty value so that when we load, |
2493 | * it, we save the empty value so that when we load, |
2506 | * we get this value back again. |
2494 | * we get this value back again. |
2507 | */ |
2495 | */ |
2508 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2496 | if (get_ob_key_link (op->arch, canonical_key)) |
2509 | field->value = 0; |
2497 | field->value = 0; |
2510 | else |
2498 | else |
2511 | { |
2499 | { |
2512 | if (last) |
2500 | if (last) |
2513 | last->next = field->next; |
2501 | last->next = field->next; |
… | |
… | |
2581 | item = item->inv; |
2569 | item = item->inv; |
2582 | } |
2570 | } |
2583 | else |
2571 | else |
2584 | item = item->env; |
2572 | item = item->env; |
2585 | } |
2573 | } |
2586 | |
|
|
2587 | |
2574 | |
2588 | const char * |
2575 | const char * |
2589 | object::flag_desc (char *desc, int len) const |
2576 | object::flag_desc (char *desc, int len) const |
2590 | { |
2577 | { |
2591 | char *p = desc; |
2578 | char *p = desc; |