ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.156 by root, Fri May 18 01:01:01 2007 UTC vs.
Revision 1.170 by root, Wed Aug 1 01:53:13 2007 UTC

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}
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
956void 956void
957object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
958{ 958{
959 if (destroyed ()) 959 if (destroyed ())
960 return; 960 return;
961 961
962 if (destroy_inventory) 962 if (destroy_inventory)
963 destroy_inv (false); 963 destroy_inv (false);
964
965 play_sound (sound_die);
964 966
965 attachable::destroy (); 967 attachable::destroy ();
966} 968}
967 969
968/* 970/*
1116 1118
1117 if (destroyed ()) 1119 if (destroyed ())
1118 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1120 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1119 } 1121 }
1120 1122
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
1126 last = tmp; 1123 last = tmp;
1127 } 1124 }
1128 1125
1129 /* last == NULL if there are no objects on this space */ 1126 /* last == NULL if there are no objects on this space */
1130 //TODO: this makes little sense, why only update the topmost object? 1127 //TODO: this makes little sense, why only update the topmost object?
1181 if (more) 1178 if (more)
1182 return; 1179 return;
1183 1180
1184 object *prev = this; 1181 object *prev = this;
1185 1182
1186 for (archetype *at = arch->more; at; at = at->more) 1183 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1187 { 1184 {
1188 object *op = arch_to_object (at); 1185 object *op = arch_to_object (at);
1189 1186
1190 op->name = name; 1187 op->name = name;
1191 op->name_pl = name_pl; 1188 op->name_pl = name_pl;
1205object * 1202object *
1206insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1203insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1207{ 1204{
1208 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1205 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1209 { 1206 {
1210 tmp->x = x + tmp->arch->clone.x; 1207 tmp->x = x + tmp->arch->x;
1211 tmp->y = y + tmp->arch->clone.y; 1208 tmp->y = y + tmp->arch->y;
1212 } 1209 }
1213 1210
1214 return insert_ob_in_map (op, m, originator, flag); 1211 return insert_ob_in_map (op, m, originator, flag);
1215} 1212}
1216 1213
1380 */ 1377 */
1381 if (last && last->below && last != floor) 1378 if (last && last->below && last != floor)
1382 top = last->below; 1379 top = last->below;
1383 } 1380 }
1384 } /* If objects on this space */ 1381 } /* If objects on this space */
1385
1386 if (flag & INS_MAP_LOAD) 1382 if (flag & INS_MAP_LOAD)
1387 top = ms.top; 1383 top = ms.top;
1388 1384
1389 if (flag & INS_ABOVE_FLOOR_ONLY) 1385 if (flag & INS_ABOVE_FLOOR_ONLY)
1390 top = floor; 1386 top = floor;
1488 object *tmp, *tmp1; 1484 object *tmp, *tmp1;
1489 1485
1490 /* first search for itself and remove any old instances */ 1486 /* first search for itself and remove any old instances */
1491 1487
1492 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1488 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1493 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1489 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1494 tmp->destroy (); 1490 tmp->destroy ();
1495 1491
1496 tmp1 = arch_to_object (archetype::find (arch_string)); 1492 tmp1 = arch_to_object (archetype::find (arch_string));
1497 1493
1498 tmp1->x = op->x; 1494 tmp1->x = op->x;
2495 /* Basically, if the archetype has this key set, 2491 /* Basically, if the archetype has this key set,
2496 * we need to store the null value so when we save 2492 * we need to store the null value so when we save
2497 * it, we save the empty value so that when we load, 2493 * it, we save the empty value so that when we load,
2498 * we get this value back again. 2494 * we get this value back again.
2499 */ 2495 */
2500 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2496 if (get_ob_key_link (op->arch, canonical_key))
2501 field->value = 0; 2497 field->value = 0;
2502 else 2498 else
2503 { 2499 {
2504 if (last) 2500 if (last)
2505 last->next = field->next; 2501 last->next = field->next;
2574 } 2570 }
2575 else 2571 else
2576 item = item->env; 2572 item = item->env;
2577} 2573}
2578 2574
2579
2580const char * 2575const char *
2581object::flag_desc (char *desc, int len) const 2576object::flag_desc (char *desc, int len) const
2582{ 2577{
2583 char *p = desc; 2578 char *p = desc;
2584 bool first = true; 2579 bool first = true;
2646} 2641}
2647 2642
2648const materialtype_t * 2643const materialtype_t *
2649object::dominant_material () const 2644object::dominant_material () const
2650{ 2645{
2651 if (materialtype_t *mat = name_to_material (materialname)) 2646 if (materialtype_t *mt = name_to_material (materialname))
2652 return mat; 2647 return mt;
2653 2648
2654 // omfg this is slow, this has to be temporary :)
2655 shstr unknown ("unknown");
2656
2657 return name_to_material (unknown); 2649 return name_to_material (shstr_unknown);
2658} 2650}
2659 2651
2660void 2652void
2661object::open_container (object *new_container) 2653object::open_container (object *new_container)
2662{ 2654{
2706 esrv_update_item (UPD_FLAGS, this, new_container); 2698 esrv_update_item (UPD_FLAGS, this, new_container);
2707 esrv_send_inventory (this, new_container); 2699 esrv_send_inventory (this, new_container);
2708 } 2700 }
2709} 2701}
2710 2702
2703object *
2704object::force_find (const shstr name)
2705{
2706 /* cycle through his inventory to look for the MARK we want to
2707 * place
2708 */
2709 for (object *tmp = inv; tmp; tmp = tmp->below)
2710 if (tmp->type == FORCE && tmp->slaying == name)
2711 return splay (tmp);
2711 2712
2713 return 0;
2714}
2715
2716void
2717object::force_add (const shstr name, int duration)
2718{
2719 if (object *force = force_find (name))
2720 force->destroy ();
2721
2722 object *force = get_archetype (FORCE_NAME);
2723
2724 force->slaying = name;
2725 force->stats.food = 1;
2726 force->speed_left = -1.f;
2727
2728 force->set_speed (duration ? 1.f / duration : 0.f);
2729 force->flag [FLAG_IS_USED_UP] = true;
2730 force->flag [FLAG_APPLIED] = true;
2731
2732 insert (force);
2733}
2734

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines