1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * 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, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <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. |
… | |
… | |
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 | } |
… | |
… | |
937 | map = freed_map; |
936 | map = freed_map; |
938 | x = 1; |
937 | x = 1; |
939 | y = 1; |
938 | y = 1; |
940 | } |
939 | } |
941 | |
940 | |
942 | head = 0; |
|
|
943 | |
|
|
944 | if (more) |
941 | if (more) |
945 | { |
942 | { |
946 | more->destroy (); |
943 | more->destroy (); |
947 | more = 0; |
944 | more = 0; |
948 | } |
945 | } |
949 | |
946 | |
|
|
947 | head = 0; |
|
|
948 | |
950 | // clear those pointers that likely might have circular references to us |
949 | // clear those pointers that likely might cause circular references |
951 | owner = 0; |
950 | owner = 0; |
952 | enemy = 0; |
951 | enemy = 0; |
953 | attacked_by = 0; |
952 | attacked_by = 0; |
|
|
953 | current_weapon = 0; |
954 | } |
954 | } |
955 | |
955 | |
956 | void |
956 | void |
957 | object::destroy (bool destroy_inventory) |
957 | object::destroy (bool destroy_inventory) |
958 | { |
958 | { |
… | |
… | |
1115 | move_apply (tmp, this, 0); |
1115 | move_apply (tmp, this, 0); |
1116 | |
1116 | |
1117 | if (destroyed ()) |
1117 | if (destroyed ()) |
1118 | 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 ()); |
1119 | } |
1119 | } |
1120 | |
|
|
1121 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1122 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1123 | if (tmp->above == tmp) |
|
|
1124 | tmp->above = 0; |
|
|
1125 | |
1120 | |
1126 | last = tmp; |
1121 | last = tmp; |
1127 | } |
1122 | } |
1128 | |
1123 | |
1129 | /* last == NULL if there are no objects on this space */ |
1124 | /* last == NULL if there are no objects on this space */ |
… | |
… | |
1380 | */ |
1375 | */ |
1381 | if (last && last->below && last != floor) |
1376 | if (last && last->below && last != floor) |
1382 | top = last->below; |
1377 | top = last->below; |
1383 | } |
1378 | } |
1384 | } /* If objects on this space */ |
1379 | } /* If objects on this space */ |
1385 | |
|
|
1386 | if (flag & INS_MAP_LOAD) |
1380 | if (flag & INS_MAP_LOAD) |
1387 | top = ms.top; |
1381 | top = ms.top; |
1388 | |
1382 | |
1389 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1383 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1390 | top = floor; |
1384 | top = floor; |
… | |
… | |
2574 | } |
2568 | } |
2575 | else |
2569 | else |
2576 | item = item->env; |
2570 | item = item->env; |
2577 | } |
2571 | } |
2578 | |
2572 | |
2579 | |
|
|
2580 | const char * |
2573 | const char * |
2581 | object::flag_desc (char *desc, int len) const |
2574 | object::flag_desc (char *desc, int len) const |
2582 | { |
2575 | { |
2583 | char *p = desc; |
2576 | char *p = desc; |
2584 | bool first = true; |
2577 | bool first = true; |
… | |
… | |
2646 | } |
2639 | } |
2647 | |
2640 | |
2648 | const materialtype_t * |
2641 | const materialtype_t * |
2649 | object::dominant_material () const |
2642 | object::dominant_material () const |
2650 | { |
2643 | { |
2651 | if (materialtype_t *mat = name_to_material (materialname)) |
2644 | if (materialtype_t *mt = name_to_material (materialname)) |
2652 | return mat; |
2645 | return mt; |
2653 | |
2646 | |
2654 | // omfg this is slow, this has to be temporary :) |
|
|
2655 | shstr unknown ("unknown"); |
|
|
2656 | |
|
|
2657 | return name_to_material (unknown); |
2647 | return name_to_material (shstr_unknown); |
2658 | } |
2648 | } |
2659 | |
2649 | |
2660 | void |
2650 | void |
2661 | object::open_container (object *new_container) |
2651 | object::open_container (object *new_container) |
2662 | { |
2652 | { |
… | |
… | |
2706 | esrv_update_item (UPD_FLAGS, this, new_container); |
2696 | esrv_update_item (UPD_FLAGS, this, new_container); |
2707 | esrv_send_inventory (this, new_container); |
2697 | esrv_send_inventory (this, new_container); |
2708 | } |
2698 | } |
2709 | } |
2699 | } |
2710 | |
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); |
2711 | |
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 | |