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.151 by root, Wed May 16 11:10:01 2007 UTC vs.
Revision 1.172 by root, Wed Aug 1 20:44:11 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}
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
955void 956void
956object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
957{ 958{
958 if (destroyed ()) 959 if (destroyed ())
959 return; 960 return;
960 961
961 if (destroy_inventory) 962 if (destroy_inventory)
962 destroy_inv (false); 963 destroy_inv (false);
964
965 if (sound_destroy)
966 play_sound (sound_destroy);
967 else if (flag [FLAG_MONSTER])
968 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
963 969
964 attachable::destroy (); 970 attachable::destroy ();
965} 971}
966 972
967/* 973/*
1115 1121
1116 if (destroyed ()) 1122 if (destroyed ())
1117 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1123 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1118 } 1124 }
1119 1125
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; 1126 last = tmp;
1126 } 1127 }
1127 1128
1128 /* last == NULL if there are no objects on this space */ 1129 /* last == NULL if there are no objects on this space */
1129 //TODO: this makes little sense, why only update the topmost object? 1130 //TODO: this makes little sense, why only update the topmost object?
1180 if (more) 1181 if (more)
1181 return; 1182 return;
1182 1183
1183 object *prev = this; 1184 object *prev = this;
1184 1185
1185 for (archetype *at = arch->more; at; at = at->more) 1186 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1186 { 1187 {
1187 object *op = arch_to_object (at); 1188 object *op = arch_to_object (at);
1188 1189
1189 op->name = name; 1190 op->name = name;
1190 op->name_pl = name_pl; 1191 op->name_pl = name_pl;
1204object * 1205object *
1205insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1206insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1206{ 1207{
1207 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1208 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1208 { 1209 {
1209 tmp->x = x + tmp->arch->clone.x; 1210 tmp->x = x + tmp->arch->x;
1210 tmp->y = y + tmp->arch->clone.y; 1211 tmp->y = y + tmp->arch->y;
1211 } 1212 }
1212 1213
1213 return insert_ob_in_map (op, m, originator, flag); 1214 return insert_ob_in_map (op, m, originator, flag);
1214} 1215}
1215 1216
1236object * 1237object *
1237insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1238{ 1239{
1239 assert (!op->flag [FLAG_FREED]); 1240 assert (!op->flag [FLAG_FREED]);
1240 1241
1241 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1242 1243
1243 op->remove (); 1244 op->remove ();
1244 1245
1245#if 0 1246#if 0
1246 if (!m->active != !op->active) 1247 if (!m->active != !op->active)
1262#endif 1263#endif
1263 return op; 1264 return op;
1264 } 1265 }
1265 1266
1266 if (object *more = op->more) 1267 if (object *more = op->more)
1267 {
1268 if (!insert_ob_in_map (more, m, originator, flag)) 1268 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; 1269 return 0;
1274 }
1275 }
1276 1270
1277 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1278 1272
1279 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* 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 1274 * of areas of callers (eg, anything that uses find_free_spot would now
1287 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1288 1282
1289 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1290 */ 1284 */
1291 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1292 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1293 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1294 { 1288 {
1295 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1296 tmp->destroy (); 1290 tmp->destroy ();
1297 } 1291 }
1386 */ 1380 */
1387 if (last && last->below && last != floor) 1381 if (last && last->below && last != floor)
1388 top = last->below; 1382 top = last->below;
1389 } 1383 }
1390 } /* If objects on this space */ 1384 } /* If objects on this space */
1391
1392 if (flag & INS_MAP_LOAD) 1385 if (flag & INS_MAP_LOAD)
1393 top = ms.top; 1386 top = ms.top;
1394 1387
1395 if (flag & INS_ABOVE_FLOOR_ONLY) 1388 if (flag & INS_ABOVE_FLOOR_ONLY)
1396 top = floor; 1389 top = floor;
1466 * blocked() and wall() work properly), and these flags are updated by 1459 * blocked() and wall() work properly), and these flags are updated by
1467 * update_object(). 1460 * update_object().
1468 */ 1461 */
1469 1462
1470 /* if this is not the head or flag has been passed, don't check walk on status */ 1463 /* 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) 1464 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1472 { 1465 {
1473 if (check_move_on (op, originator)) 1466 if (check_move_on (op, originator))
1474 return 0; 1467 return 0;
1475 1468
1476 /* If we are a multi part object, lets work our way through the check 1469 /* If we are a multi part object, lets work our way through the check
1477 * walk on's. 1470 * walk on's.
1478 */ 1471 */
1479 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1472 for (object *tmp = op->more; tmp; tmp = tmp->more)
1480 if (check_move_on (tmp, originator)) 1473 if (check_move_on (tmp, originator))
1481 return 0; 1474 return 0;
1482 } 1475 }
1483 1476
1484 return op; 1477 return op;
1494 object *tmp, *tmp1; 1487 object *tmp, *tmp1;
1495 1488
1496 /* first search for itself and remove any old instances */ 1489 /* first search for itself and remove any old instances */
1497 1490
1498 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1491 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1499 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1492 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1500 tmp->destroy (); 1493 tmp->destroy ();
1501 1494
1502 tmp1 = arch_to_object (archetype::find (arch_string)); 1495 tmp1 = arch_to_object (archetype::find (arch_string));
1503 1496
1504 tmp1->x = op->x; 1497 tmp1->x = op->x;
1665 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1658 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1666 free (dump); 1659 free (dump);
1667 return op; 1660 return op;
1668 } 1661 }
1669 1662
1670 if (where->head) 1663 if (where->head_ () != where)
1671 { 1664 {
1672 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1665 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1673 where = where->head; 1666 where = where->head;
1674 } 1667 }
1675 1668
1676 return where->insert (op); 1669 return where->insert (op);
1677} 1670}
2005 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1998 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2006 { 1999 {
2007 CLEAR_FLAG (tmp, flag); 2000 CLEAR_FLAG (tmp, flag);
2008 unflag_inv (tmp, flag); 2001 unflag_inv (tmp, flag);
2009 } 2002 }
2010}
2011
2012/*
2013 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2014 * all it's inventory (recursively).
2015 * If checksums are used, a player will get set_cheat called for
2016 * him/her-self and all object carried by a call to this function.
2017 */
2018void
2019set_cheat (object *op)
2020{
2021 SET_FLAG (op, FLAG_WAS_WIZ);
2022 flag_inv (op, FLAG_WAS_WIZ);
2023} 2003}
2024 2004
2025/* 2005/*
2026 * find_free_spot(object, map, x, y, start, stop) will search for 2006 * find_free_spot(object, map, x, y, start, stop) will search for
2027 * a spot at the given map and coordinates which will be able to contain 2007 * a spot at the given map and coordinates which will be able to contain
2145 object *tmp; 2125 object *tmp;
2146 maptile *mp; 2126 maptile *mp;
2147 2127
2148 MoveType blocked, move_type; 2128 MoveType blocked, move_type;
2149 2129
2150 if (exclude && exclude->head) 2130 if (exclude && exclude->head_ () != exclude)
2151 { 2131 {
2152 exclude = exclude->head; 2132 exclude = exclude->head;
2153 move_type = exclude->move_type; 2133 move_type = exclude->move_type;
2154 } 2134 }
2155 else 2135 else
2178 max = maxfree[i]; 2158 max = maxfree[i];
2179 else if (mflags & P_IS_ALIVE) 2159 else if (mflags & P_IS_ALIVE)
2180 { 2160 {
2181 for (tmp = ms.bot; tmp; tmp = tmp->above) 2161 for (tmp = ms.bot; tmp; tmp = tmp->above)
2182 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2162 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2183 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2163 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2184 break; 2164 break;
2185 2165
2186 if (tmp) 2166 if (tmp)
2187 return freedir[i]; 2167 return freedir[i];
2188 } 2168 }
2383 * create clone from object to another 2363 * create clone from object to another
2384 */ 2364 */
2385object * 2365object *
2386object_create_clone (object *asrc) 2366object_create_clone (object *asrc)
2387{ 2367{
2388 object *dst = 0, *tmp, *src, *part, *prev, *item; 2368 object *dst = 0, *tmp, *src, *prev, *item;
2389 2369
2390 if (!asrc) 2370 if (!asrc)
2391 return 0; 2371 return 0;
2392 2372
2393 src = asrc;
2394 if (src->head)
2395 src = src->head; 2373 src = asrc->head_ ();
2396 2374
2397 prev = 0; 2375 prev = 0;
2398 for (part = src; part; part = part->more) 2376 for (object *part = src; part; part = part->more)
2399 { 2377 {
2400 tmp = part->clone (); 2378 tmp = part->clone ();
2401 tmp->x -= src->x; 2379 tmp->x -= src->x;
2402 tmp->y -= src->y; 2380 tmp->y -= src->y;
2403 2381
2516 /* Basically, if the archetype has this key set, 2494 /* Basically, if the archetype has this key set,
2517 * we need to store the null value so when we save 2495 * we need to store the null value so when we save
2518 * it, we save the empty value so that when we load, 2496 * it, we save the empty value so that when we load,
2519 * we get this value back again. 2497 * we get this value back again.
2520 */ 2498 */
2521 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2499 if (get_ob_key_link (op->arch, canonical_key))
2522 field->value = 0; 2500 field->value = 0;
2523 else 2501 else
2524 { 2502 {
2525 if (last) 2503 if (last)
2526 last->next = field->next; 2504 last->next = field->next;
2595 } 2573 }
2596 else 2574 else
2597 item = item->env; 2575 item = item->env;
2598} 2576}
2599 2577
2600
2601const char * 2578const char *
2602object::flag_desc (char *desc, int len) const 2579object::flag_desc (char *desc, int len) const
2603{ 2580{
2604 char *p = desc; 2581 char *p = desc;
2605 bool first = true; 2582 bool first = true;
2667} 2644}
2668 2645
2669const materialtype_t * 2646const materialtype_t *
2670object::dominant_material () const 2647object::dominant_material () const
2671{ 2648{
2672 if (materialtype_t *mat = name_to_material (materialname)) 2649 if (materialtype_t *mt = name_to_material (materialname))
2673 return mat; 2650 return mt;
2674 2651
2675 // omfg this is slow, this has to be temporary :)
2676 shstr unknown ("unknown");
2677
2678 return name_to_material (unknown); 2652 return name_to_material (shstr_unknown);
2679} 2653}
2680 2654
2681void 2655void
2682object::open_container (object *new_container) 2656object::open_container (object *new_container)
2683{ 2657{
2727 esrv_update_item (UPD_FLAGS, this, new_container); 2701 esrv_update_item (UPD_FLAGS, this, new_container);
2728 esrv_send_inventory (this, new_container); 2702 esrv_send_inventory (this, new_container);
2729 } 2703 }
2730} 2704}
2731 2705
2706object *
2707object::force_find (const shstr name)
2708{
2709 /* cycle through his inventory to look for the MARK we want to
2710 * place
2711 */
2712 for (object *tmp = inv; tmp; tmp = tmp->below)
2713 if (tmp->type == FORCE && tmp->slaying == name)
2714 return splay (tmp);
2732 2715
2716 return 0;
2717}
2718
2719void
2720object::force_add (const shstr name, int duration)
2721{
2722 if (object *force = force_find (name))
2723 force->destroy ();
2724
2725 object *force = get_archetype (FORCE_NAME);
2726
2727 force->slaying = name;
2728 force->stats.food = 1;
2729 force->speed_left = -1.f;
2730
2731 force->set_speed (duration ? 1.f / duration : 0.f);
2732 force->flag [FLAG_IS_USED_UP] = true;
2733 force->flag [FLAG_APPLIED] = true;
2734
2735 insert (force);
2736}
2737

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines