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. */ |
… | |
… | |
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 | } |
… | |
… | |
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 | |
… | |
… | |
1236 | object * |
1232 | object * |
1237 | 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) |
1238 | { |
1234 | { |
1239 | assert (!op->flag [FLAG_FREED]); |
1235 | assert (!op->flag [FLAG_FREED]); |
1240 | |
1236 | |
1241 | object *tmp, *top, *floor = NULL; |
1237 | object *top, *floor = NULL; |
1242 | |
1238 | |
1243 | op->remove (); |
1239 | op->remove (); |
1244 | |
1240 | |
1245 | #if 0 |
1241 | #if 0 |
1246 | if (!m->active != !op->active) |
1242 | if (!m->active != !op->active) |
… | |
… | |
1262 | #endif |
1258 | #endif |
1263 | return op; |
1259 | return op; |
1264 | } |
1260 | } |
1265 | |
1261 | |
1266 | if (object *more = op->more) |
1262 | if (object *more = op->more) |
1267 | { |
|
|
1268 | if (!insert_ob_in_map (more, m, originator, flag)) |
1263 | if (!insert_ob_in_map (more, m, originator, flag)) |
1269 | { |
|
|
1270 | if (!op->head) |
|
|
1271 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1272 | |
|
|
1273 | return 0; |
1264 | return 0; |
1274 | } |
|
|
1275 | } |
|
|
1276 | |
1265 | |
1277 | CLEAR_FLAG (op, FLAG_REMOVED); |
1266 | CLEAR_FLAG (op, FLAG_REMOVED); |
1278 | |
1267 | |
1279 | /* Ideally, the caller figures this out. However, it complicates a lot |
1268 | /* Ideally, the caller figures this out. However, it complicates a lot |
1280 | * 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 |
… | |
… | |
1287 | mapspace &ms = op->ms (); |
1276 | mapspace &ms = op->ms (); |
1288 | |
1277 | |
1289 | /* this has to be done after we translate the coordinates. |
1278 | /* this has to be done after we translate the coordinates. |
1290 | */ |
1279 | */ |
1291 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1280 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1292 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1281 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1293 | if (object::can_merge (op, tmp)) |
1282 | if (object::can_merge (op, tmp)) |
1294 | { |
1283 | { |
1295 | op->nrof += tmp->nrof; |
1284 | op->nrof += tmp->nrof; |
1296 | tmp->destroy (); |
1285 | tmp->destroy (); |
1297 | } |
1286 | } |
… | |
… | |
1386 | */ |
1375 | */ |
1387 | if (last && last->below && last != floor) |
1376 | if (last && last->below && last != floor) |
1388 | top = last->below; |
1377 | top = last->below; |
1389 | } |
1378 | } |
1390 | } /* If objects on this space */ |
1379 | } /* If objects on this space */ |
1391 | |
|
|
1392 | if (flag & INS_MAP_LOAD) |
1380 | if (flag & INS_MAP_LOAD) |
1393 | top = ms.top; |
1381 | top = ms.top; |
1394 | |
1382 | |
1395 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1383 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1396 | top = floor; |
1384 | top = floor; |
… | |
… | |
1466 | * blocked() and wall() work properly), and these flags are updated by |
1454 | * blocked() and wall() work properly), and these flags are updated by |
1467 | * update_object(). |
1455 | * update_object(). |
1468 | */ |
1456 | */ |
1469 | |
1457 | |
1470 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1458 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1471 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1459 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1472 | { |
1460 | { |
1473 | if (check_move_on (op, originator)) |
1461 | if (check_move_on (op, originator)) |
1474 | return 0; |
1462 | return 0; |
1475 | |
1463 | |
1476 | /* If we are a multi part object, lets work our way through the check |
1464 | /* If we are a multi part object, lets work our way through the check |
1477 | * walk on's. |
1465 | * walk on's. |
1478 | */ |
1466 | */ |
1479 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1467 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1480 | if (check_move_on (tmp, originator)) |
1468 | if (check_move_on (tmp, originator)) |
1481 | return 0; |
1469 | return 0; |
1482 | } |
1470 | } |
1483 | |
1471 | |
1484 | return op; |
1472 | return op; |
… | |
… | |
1494 | object *tmp, *tmp1; |
1482 | object *tmp, *tmp1; |
1495 | |
1483 | |
1496 | /* first search for itself and remove any old instances */ |
1484 | /* first search for itself and remove any old instances */ |
1497 | |
1485 | |
1498 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1486 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1499 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1487 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1500 | tmp->destroy (); |
1488 | tmp->destroy (); |
1501 | |
1489 | |
1502 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1490 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1503 | |
1491 | |
1504 | tmp1->x = op->x; |
1492 | tmp1->x = op->x; |
… | |
… | |
1665 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1653 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1666 | free (dump); |
1654 | free (dump); |
1667 | return op; |
1655 | return op; |
1668 | } |
1656 | } |
1669 | |
1657 | |
1670 | if (where->head) |
1658 | if (where->head_ () != where) |
1671 | { |
1659 | { |
1672 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1660 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1673 | where = where->head; |
1661 | where = where->head; |
1674 | } |
1662 | } |
1675 | |
1663 | |
… | |
… | |
2132 | object *tmp; |
2120 | object *tmp; |
2133 | maptile *mp; |
2121 | maptile *mp; |
2134 | |
2122 | |
2135 | MoveType blocked, move_type; |
2123 | MoveType blocked, move_type; |
2136 | |
2124 | |
2137 | if (exclude && exclude->head) |
2125 | if (exclude && exclude->head_ () != exclude) |
2138 | { |
2126 | { |
2139 | exclude = exclude->head; |
2127 | exclude = exclude->head; |
2140 | move_type = exclude->move_type; |
2128 | move_type = exclude->move_type; |
2141 | } |
2129 | } |
2142 | else |
2130 | else |
… | |
… | |
2165 | max = maxfree[i]; |
2153 | max = maxfree[i]; |
2166 | else if (mflags & P_IS_ALIVE) |
2154 | else if (mflags & P_IS_ALIVE) |
2167 | { |
2155 | { |
2168 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2156 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2169 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2157 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2170 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2158 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2171 | break; |
2159 | break; |
2172 | |
2160 | |
2173 | if (tmp) |
2161 | if (tmp) |
2174 | return freedir[i]; |
2162 | return freedir[i]; |
2175 | } |
2163 | } |
… | |
… | |
2370 | * create clone from object to another |
2358 | * create clone from object to another |
2371 | */ |
2359 | */ |
2372 | object * |
2360 | object * |
2373 | object_create_clone (object *asrc) |
2361 | object_create_clone (object *asrc) |
2374 | { |
2362 | { |
2375 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2363 | object *dst = 0, *tmp, *src, *prev, *item; |
2376 | |
2364 | |
2377 | if (!asrc) |
2365 | if (!asrc) |
2378 | return 0; |
2366 | return 0; |
2379 | |
2367 | |
2380 | src = asrc; |
|
|
2381 | if (src->head) |
|
|
2382 | src = src->head; |
2368 | src = asrc->head_ (); |
2383 | |
2369 | |
2384 | prev = 0; |
2370 | prev = 0; |
2385 | for (part = src; part; part = part->more) |
2371 | for (object *part = src; part; part = part->more) |
2386 | { |
2372 | { |
2387 | tmp = part->clone (); |
2373 | tmp = part->clone (); |
2388 | tmp->x -= src->x; |
2374 | tmp->x -= src->x; |
2389 | tmp->y -= src->y; |
2375 | tmp->y -= src->y; |
2390 | |
2376 | |
… | |
… | |
2503 | /* Basically, if the archetype has this key set, |
2489 | /* Basically, if the archetype has this key set, |
2504 | * we need to store the null value so when we save |
2490 | * we need to store the null value so when we save |
2505 | * it, we save the empty value so that when we load, |
2491 | * it, we save the empty value so that when we load, |
2506 | * we get this value back again. |
2492 | * we get this value back again. |
2507 | */ |
2493 | */ |
2508 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2494 | if (get_ob_key_link (op->arch, canonical_key)) |
2509 | field->value = 0; |
2495 | field->value = 0; |
2510 | else |
2496 | else |
2511 | { |
2497 | { |
2512 | if (last) |
2498 | if (last) |
2513 | last->next = field->next; |
2499 | last->next = field->next; |
… | |
… | |
2582 | } |
2568 | } |
2583 | else |
2569 | else |
2584 | item = item->env; |
2570 | item = item->env; |
2585 | } |
2571 | } |
2586 | |
2572 | |
2587 | |
|
|
2588 | const char * |
2573 | const char * |
2589 | object::flag_desc (char *desc, int len) const |
2574 | object::flag_desc (char *desc, int len) const |
2590 | { |
2575 | { |
2591 | char *p = desc; |
2576 | char *p = desc; |
2592 | bool first = true; |
2577 | bool first = true; |
… | |
… | |
2654 | } |
2639 | } |
2655 | |
2640 | |
2656 | const materialtype_t * |
2641 | const materialtype_t * |
2657 | object::dominant_material () const |
2642 | object::dominant_material () const |
2658 | { |
2643 | { |
2659 | if (materialtype_t *mat = name_to_material (materialname)) |
2644 | if (materialtype_t *mt = name_to_material (materialname)) |
2660 | return mat; |
2645 | return mt; |
2661 | |
2646 | |
2662 | // omfg this is slow, this has to be temporary :) |
|
|
2663 | shstr unknown ("unknown"); |
|
|
2664 | |
|
|
2665 | return name_to_material (unknown); |
2647 | return name_to_material (shstr_unknown); |
2666 | } |
2648 | } |
2667 | |
2649 | |
2668 | void |
2650 | void |
2669 | object::open_container (object *new_container) |
2651 | object::open_container (object *new_container) |
2670 | { |
2652 | { |
… | |
… | |
2714 | esrv_update_item (UPD_FLAGS, this, new_container); |
2696 | esrv_update_item (UPD_FLAGS, this, new_container); |
2715 | esrv_send_inventory (this, new_container); |
2697 | esrv_send_inventory (this, new_container); |
2716 | } |
2698 | } |
2717 | } |
2699 | } |
2718 | |
2700 | |
|
|
2701 | object * |
|
|
2702 | object::force_find (const shstr name) |
|
|
2703 | { |
|
|
2704 | /* cycle through his inventory to look for the MARK we want to |
|
|
2705 | * place |
|
|
2706 | */ |
|
|
2707 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2708 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2709 | return splay (tmp); |
2719 | |
2710 | |
|
|
2711 | return 0; |
|
|
2712 | } |
|
|
2713 | |
|
|
2714 | void |
|
|
2715 | object::force_add (const shstr name, int duration) |
|
|
2716 | { |
|
|
2717 | if (object *force = force_find (name)) |
|
|
2718 | force->destroy (); |
|
|
2719 | |
|
|
2720 | object *force = get_archetype (FORCE_NAME); |
|
|
2721 | |
|
|
2722 | force->slaying = name; |
|
|
2723 | force->stats.food = 1; |
|
|
2724 | force->speed_left = -1.f; |
|
|
2725 | |
|
|
2726 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2727 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2728 | force->flag [FLAG_APPLIED] = true; |
|
|
2729 | |
|
|
2730 | insert (force); |
|
|
2731 | } |
|
|
2732 | |
|
|
2733 | |