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.148 by root, Mon May 14 19:08:25 2007 UTC vs.
Revision 1.169 by root, Wed Aug 1 01:07:42 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 }
507 else 507 else
508 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); 508 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
509
510 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
511 {
512 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
513 &name, ob->debug_desc ());
514 return false;
515 }
509 516
510 return true; 517 return true;
511} 518}
512 519
513/* Zero the key_values on op, decrementing the shared-string 520/* Zero the key_values on op, decrementing the shared-string
… …
929 map = freed_map; 936 map = freed_map;
930 x = 1; 937 x = 1;
931 y = 1; 938 y = 1;
932 } 939 }
933 940
934 head = 0;
935
936 if (more) 941 if (more)
937 { 942 {
938 more->destroy (); 943 more->destroy ();
939 more = 0; 944 more = 0;
940 } 945 }
941 946
947 head = 0;
948
942 // clear those pointers that likely might have circular references to us 949 // clear those pointers that likely might cause circular references
943 owner = 0; 950 owner = 0;
944 enemy = 0; 951 enemy = 0;
945 attacked_by = 0; 952 attacked_by = 0;
953 current_weapon = 0;
946} 954}
947 955
948void 956void
949object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
950{ 958{
951 if (destroyed ()) 959 if (destroyed ())
952 return; 960 return;
953 961
954 if (destroy_inventory) 962 if (destroy_inventory)
955 destroy_inv (false); 963 destroy_inv (false);
964
965 play_sound (sound_die);
956 966
957 attachable::destroy (); 967 attachable::destroy ();
958} 968}
959 969
960/* 970/*
… …
1108 1118
1109 if (destroyed ()) 1119 if (destroyed ())
1110 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 ());
1111 } 1121 }
1112 1122
1113 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1114 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1115 if (tmp->above == tmp)
1116 tmp->above = 0;
1117
1118 last = tmp; 1123 last = tmp;
1119 } 1124 }
1120 1125
1121 /* last == NULL if there are no objects on this space */ 1126 /* last == NULL if there are no objects on this space */
1122 //TODO: this makes little sense, why only update the topmost object? 1127 //TODO: this makes little sense, why only update the topmost object?
… …
1173 if (more) 1178 if (more)
1174 return; 1179 return;
1175 1180
1176 object *prev = this; 1181 object *prev = this;
1177 1182
1178 for (archetype *at = arch->more; at; at = at->more) 1183 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1179 { 1184 {
1180 object *op = arch_to_object (at); 1185 object *op = arch_to_object (at);
1181 1186
1182 op->name = name; 1187 op->name = name;
1183 op->name_pl = name_pl; 1188 op->name_pl = name_pl;
… …
1197object * 1202object *
1198insert_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)
1199{ 1204{
1200 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1205 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1201 { 1206 {
1202 tmp->x = x + tmp->arch->clone.x; 1207 tmp->x = x + tmp->arch->x;
1203 tmp->y = y + tmp->arch->clone.y; 1208 tmp->y = y + tmp->arch->y;
1204 } 1209 }
1205 1210
1206 return insert_ob_in_map (op, m, originator, flag); 1211 return insert_ob_in_map (op, m, originator, flag);
1207} 1212}
1208 1213
… …
1229object * 1234object *
1230insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1235insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1231{ 1236{
1232 assert (!op->flag [FLAG_FREED]); 1237 assert (!op->flag [FLAG_FREED]);
1233 1238
1234 object *tmp, *top, *floor = NULL; 1239 object *top, *floor = NULL;
1235 1240
1236 op->remove (); 1241 op->remove ();
1237 1242
1238#if 0 1243#if 0
1239 if (!m->active != !op->active) 1244 if (!m->active != !op->active)
… …
1255#endif 1260#endif
1256 return op; 1261 return op;
1257 } 1262 }
1258 1263
1259 if (object *more = op->more) 1264 if (object *more = op->more)
1260 {
1261 if (!insert_ob_in_map (more, m, originator, flag)) 1265 if (!insert_ob_in_map (more, m, originator, flag))
1262 {
1263 if (!op->head)
1264 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1265
1266 return 0; 1266 return 0;
1267 }
1268 }
1269 1267
1270 CLEAR_FLAG (op, FLAG_REMOVED); 1268 CLEAR_FLAG (op, FLAG_REMOVED);
1271 1269
1272 /* Ideally, the caller figures this out. However, it complicates a lot 1270 /* Ideally, the caller figures this out. However, it complicates a lot
1273 * of areas of callers (eg, anything that uses find_free_spot would now 1271 * of areas of callers (eg, anything that uses find_free_spot would now
… …
1280 mapspace &ms = op->ms (); 1278 mapspace &ms = op->ms ();
1281 1279
1282 /* this has to be done after we translate the coordinates. 1280 /* this has to be done after we translate the coordinates.
1283 */ 1281 */
1284 if (op->nrof && !(flag & INS_NO_MERGE)) 1282 if (op->nrof && !(flag & INS_NO_MERGE))
1285 for (tmp = ms.bot; tmp; tmp = tmp->above) 1283 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1286 if (object::can_merge (op, tmp)) 1284 if (object::can_merge (op, tmp))
1287 { 1285 {
1288 op->nrof += tmp->nrof; 1286 op->nrof += tmp->nrof;
1289 tmp->destroy (); 1287 tmp->destroy ();
1290 } 1288 }
… …
1379 */ 1377 */
1380 if (last && last->below && last != floor) 1378 if (last && last->below && last != floor)
1381 top = last->below; 1379 top = last->below;
1382 } 1380 }
1383 } /* If objects on this space */ 1381 } /* If objects on this space */
1384
1385 if (flag & INS_MAP_LOAD) 1382 if (flag & INS_MAP_LOAD)
1386 top = ms.top; 1383 top = ms.top;
1387 1384
1388 if (flag & INS_ABOVE_FLOOR_ONLY) 1385 if (flag & INS_ABOVE_FLOOR_ONLY)
1389 top = floor; 1386 top = floor;
… …
1459 * blocked() and wall() work properly), and these flags are updated by 1456 * blocked() and wall() work properly), and these flags are updated by
1460 * update_object(). 1457 * update_object().
1461 */ 1458 */
1462 1459
1463 /* 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 */
1464 if (!(flag & INS_NO_WALK_ON) && !op->head) 1461 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1465 { 1462 {
1466 if (check_move_on (op, originator)) 1463 if (check_move_on (op, originator))
1467 return 0; 1464 return 0;
1468 1465
1469 /* 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
1470 * walk on's. 1467 * walk on's.
1471 */ 1468 */
1472 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1469 for (object *tmp = op->more; tmp; tmp = tmp->more)
1473 if (check_move_on (tmp, originator)) 1470 if (check_move_on (tmp, originator))
1474 return 0; 1471 return 0;
1475 } 1472 }
1476 1473
1477 return op; 1474 return op;
… …
1487 object *tmp, *tmp1; 1484 object *tmp, *tmp1;
1488 1485
1489 /* first search for itself and remove any old instances */ 1486 /* first search for itself and remove any old instances */
1490 1487
1491 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1488 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1492 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1489 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1493 tmp->destroy (); 1490 tmp->destroy ();
1494 1491
1495 tmp1 = arch_to_object (archetype::find (arch_string)); 1492 tmp1 = arch_to_object (archetype::find (arch_string));
1496 1493
1497 tmp1->x = op->x; 1494 tmp1->x = op->x;
… …
1658 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);
1659 free (dump); 1656 free (dump);
1660 return op; 1657 return op;
1661 } 1658 }
1662 1659
1663 if (where->head) 1660 if (where->head_ () != where)
1664 { 1661 {
1665 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");
1666 where = where->head; 1663 where = where->head;
1667 } 1664 }
1668 1665
1669 return where->insert (op); 1666 return where->insert (op);
1670} 1667}
… …
1998 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1995 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1999 { 1996 {
2000 CLEAR_FLAG (tmp, flag); 1997 CLEAR_FLAG (tmp, flag);
2001 unflag_inv (tmp, flag); 1998 unflag_inv (tmp, flag);
2002 } 1999 }
2003}
2004
2005/*
2006 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2007 * all it's inventory (recursively).
2008 * If checksums are used, a player will get set_cheat called for
2009 * him/her-self and all object carried by a call to this function.
2010 */
2011void
2012set_cheat (object *op)
2013{
2014 SET_FLAG (op, FLAG_WAS_WIZ);
2015 flag_inv (op, FLAG_WAS_WIZ);
2016} 2000}
2017 2001
2018/* 2002/*
2019 * 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
2020 * 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
… …
2138 object *tmp; 2122 object *tmp;
2139 maptile *mp; 2123 maptile *mp;
2140 2124
2141 MoveType blocked, move_type; 2125 MoveType blocked, move_type;
2142 2126
2143 if (exclude && exclude->head) 2127 if (exclude && exclude->head_ () != exclude)
2144 { 2128 {
2145 exclude = exclude->head; 2129 exclude = exclude->head;
2146 move_type = exclude->move_type; 2130 move_type = exclude->move_type;
2147 } 2131 }
2148 else 2132 else
… …
2171 max = maxfree[i]; 2155 max = maxfree[i];
2172 else if (mflags & P_IS_ALIVE) 2156 else if (mflags & P_IS_ALIVE)
2173 { 2157 {
2174 for (tmp = ms.bot; tmp; tmp = tmp->above) 2158 for (tmp = ms.bot; tmp; tmp = tmp->above)
2175 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2159 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2176 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2160 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2177 break; 2161 break;
2178 2162
2179 if (tmp) 2163 if (tmp)
2180 return freedir[i]; 2164 return freedir[i];
2181 } 2165 }
… …
2376 * create clone from object to another 2360 * create clone from object to another
2377 */ 2361 */
2378object * 2362object *
2379object_create_clone (object *asrc) 2363object_create_clone (object *asrc)
2380{ 2364{
2381 object *dst = 0, *tmp, *src, *part, *prev, *item; 2365 object *dst = 0, *tmp, *src, *prev, *item;
2382 2366
2383 if (!asrc) 2367 if (!asrc)
2384 return 0; 2368 return 0;
2385 2369
2386 src = asrc;
2387 if (src->head)
2388 src = src->head; 2370 src = asrc->head_ ();
2389 2371
2390 prev = 0; 2372 prev = 0;
2391 for (part = src; part; part = part->more) 2373 for (object *part = src; part; part = part->more)
2392 { 2374 {
2393 tmp = part->clone (); 2375 tmp = part->clone ();
2394 tmp->x -= src->x; 2376 tmp->x -= src->x;
2395 tmp->y -= src->y; 2377 tmp->y -= src->y;
2396 2378
… …
2509 /* Basically, if the archetype has this key set, 2491 /* Basically, if the archetype has this key set,
2510 * we need to store the null value so when we save 2492 * we need to store the null value so when we save
2511 * it, we save the empty value so that when we load, 2493 * it, we save the empty value so that when we load,
2512 * we get this value back again. 2494 * we get this value back again.
2513 */ 2495 */
2514 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2496 if (get_ob_key_link (op->arch, canonical_key))
2515 field->value = 0; 2497 field->value = 0;
2516 else 2498 else
2517 { 2499 {
2518 if (last) 2500 if (last)
2519 last->next = field->next; 2501 last->next = field->next;
… …
2588 } 2570 }
2589 else 2571 else
2590 item = item->env; 2572 item = item->env;
2591} 2573}
2592 2574
2593
2594const char * 2575const char *
2595object::flag_desc (char *desc, int len) const 2576object::flag_desc (char *desc, int len) const
2596{ 2577{
2597 char *p = desc; 2578 char *p = desc;
2598 bool first = true; 2579 bool first = true;
… …
2660} 2641}
2661 2642
2662const materialtype_t * 2643const materialtype_t *
2663object::dominant_material () const 2644object::dominant_material () const
2664{ 2645{
2665 if (materialtype_t *mat = name_to_material (materialname)) 2646 if (materialtype_t *mt = name_to_material (materialname))
2666 return mat; 2647 return mt;
2667 2648
2668 // omfg this is slow, this has to be temporary :)
2669 shstr unknown ("unknown");
2670
2671 return name_to_material (unknown); 2649 return name_to_material (shstr_unknown);
2672} 2650}
2673 2651
2674void 2652void
2675object::open_container (object *new_container) 2653object::open_container (object *new_container)
2676{ 2654{
… …
2720 esrv_update_item (UPD_FLAGS, this, new_container); 2698 esrv_update_item (UPD_FLAGS, this, new_container);
2721 esrv_send_inventory (this, new_container); 2699 esrv_send_inventory (this, new_container);
2722 } 2700 }
2723} 2701}
2724 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);
2725 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
2735void
2736object::play_sound (faceidx sound) const
2737{
2738 if (map)
2739 map->play_sound (sound, x, y);
2740}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines