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.142 by root, Mon Apr 30 04:25:29 2007 UTC vs.
Revision 1.163 by root, Sun Jul 1 05:00:17 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. */
29#include <stdio.h> 28#include <stdio.h>
30#include <sys/types.h> 29#include <sys/types.h>
31#include <sys/uio.h> 30#include <sys/uio.h>
32#include <object.h> 31#include <object.h>
33#include <funcpoint.h> 32#include <funcpoint.h>
33#include <sproto.h>
34#include <loader.h> 34#include <loader.h>
35 35
36#include <bitset> 36#include <bitset>
37 37
38int nrofallocobjects = 0; 38int nrofallocobjects = 0;
449 owner = owner->owner; 449 owner = owner->owner;
450 450
451 this->owner = owner; 451 this->owner = owner;
452} 452}
453 453
454int
455object::slottype () const
456{
457 if (type == SKILL)
458 {
459 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
460 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
461 }
462 else
463 {
464 if (slot [body_combat].info) return slot_combat;
465 if (slot [body_range ].info) return slot_ranged;
466 }
467
468 return slot_none;
469}
470
471bool
472object::change_weapon (object *ob)
473{
474 if (current_weapon == ob)
475 return true;
476
477 if (chosen_skill)
478 chosen_skill->flag [FLAG_APPLIED] = false;
479
480 current_weapon = ob;
481 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
482
483 if (chosen_skill)
484 chosen_skill->flag [FLAG_APPLIED] = true;
485
486 update_stats ();
487
488 if (ob)
489 {
490 // now check wether any body locations became invalid, in which case
491 // we cannot apply the weapon at the moment.
492 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
493 if (slot[i].used < 0)
494 {
495 current_weapon = chosen_skill = 0;
496 update_stats ();
497
498 new_draw_info_format (NDI_UNIQUE, 0, this,
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);
502 return false;
503 }
504
505 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
506 }
507 else
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 }
516
517 return true;
518}
519
454/* Zero the key_values on op, decrementing the shared-string 520/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 521 * refcounts and freeing the links.
456 */ 522 */
457static void 523static void
458free_key_values (object *op) 524free_key_values (object *op)
538 * need for monsters, but doesn't hurt to do it for everything. 604 * need for monsters, but doesn't hurt to do it for everything.
539 * by doing so, when a monster is created, it has good starting 605 * by doing so, when a monster is created, it has good starting
540 * values for the body_used info, so when items are created 606 * values for the body_used info, so when items are created
541 * for it, they can be properly equipped. 607 * for it, they can be properly equipped.
542 */ 608 */
543 memcpy (body_used, body_info, sizeof (body_used)); 609 for (int i = NUM_BODY_LOCATIONS; i--; )
610 slot[i].used = slot[i].info;
544 611
545 attachable::instantiate (); 612 attachable::instantiate ();
546} 613}
547 614
548object * 615object *
869 map = freed_map; 936 map = freed_map;
870 x = 1; 937 x = 1;
871 y = 1; 938 y = 1;
872 } 939 }
873 940
874 head = 0;
875
876 if (more) 941 if (more)
877 { 942 {
878 more->destroy (); 943 more->destroy ();
879 more = 0; 944 more = 0;
880 } 945 }
881 946
947 head = 0;
948
882 // clear those pointers that likely might have circular references to us 949 // clear those pointers that likely might cause circular references
883 owner = 0; 950 owner = 0;
884 enemy = 0; 951 enemy = 0;
885 attacked_by = 0; 952 attacked_by = 0;
953 current_weapon = 0;
886} 954}
887 955
888void 956void
889object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
890{ 958{
1048 1116
1049 if (destroyed ()) 1117 if (destroyed ())
1050 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 ());
1051 } 1119 }
1052 1120
1053 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1054 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1055 if (tmp->above == tmp)
1056 tmp->above = 0;
1057
1058 last = tmp; 1121 last = tmp;
1059 } 1122 }
1060 1123
1061 /* last == NULL if there are no objects on this space */ 1124 /* last == NULL if there are no objects on this space */
1062 //TODO: this makes little sense, why only update the topmost object? 1125 //TODO: this makes little sense, why only update the topmost object?
1113 if (more) 1176 if (more)
1114 return; 1177 return;
1115 1178
1116 object *prev = this; 1179 object *prev = this;
1117 1180
1118 for (archetype *at = arch->more; at; at = at->more) 1181 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1119 { 1182 {
1120 object *op = arch_to_object (at); 1183 object *op = arch_to_object (at);
1121 1184
1122 op->name = name; 1185 op->name = name;
1123 op->name_pl = name_pl; 1186 op->name_pl = name_pl;
1137object * 1200object *
1138insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1201insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1139{ 1202{
1140 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1203 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1141 { 1204 {
1142 tmp->x = x + tmp->arch->clone.x; 1205 tmp->x = x + tmp->arch->x;
1143 tmp->y = y + tmp->arch->clone.y; 1206 tmp->y = y + tmp->arch->y;
1144 } 1207 }
1145 1208
1146 return insert_ob_in_map (op, m, originator, flag); 1209 return insert_ob_in_map (op, m, originator, flag);
1147} 1210}
1148 1211
1169object * 1232object *
1170insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1233insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1171{ 1234{
1172 assert (!op->flag [FLAG_FREED]); 1235 assert (!op->flag [FLAG_FREED]);
1173 1236
1174 object *tmp, *top, *floor = NULL; 1237 object *top, *floor = NULL;
1175 1238
1176 op->remove (); 1239 op->remove ();
1177 1240
1178#if 0 1241#if 0
1179 if (!m->active != !op->active) 1242 if (!m->active != !op->active)
1195#endif 1258#endif
1196 return op; 1259 return op;
1197 } 1260 }
1198 1261
1199 if (object *more = op->more) 1262 if (object *more = op->more)
1200 {
1201 if (!insert_ob_in_map (more, m, originator, flag)) 1263 if (!insert_ob_in_map (more, m, originator, flag))
1202 {
1203 if (!op->head)
1204 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1205
1206 return 0; 1264 return 0;
1207 }
1208 }
1209 1265
1210 CLEAR_FLAG (op, FLAG_REMOVED); 1266 CLEAR_FLAG (op, FLAG_REMOVED);
1211 1267
1212 /* Ideally, the caller figures this out. However, it complicates a lot 1268 /* Ideally, the caller figures this out. However, it complicates a lot
1213 * 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
1220 mapspace &ms = op->ms (); 1276 mapspace &ms = op->ms ();
1221 1277
1222 /* this has to be done after we translate the coordinates. 1278 /* this has to be done after we translate the coordinates.
1223 */ 1279 */
1224 if (op->nrof && !(flag & INS_NO_MERGE)) 1280 if (op->nrof && !(flag & INS_NO_MERGE))
1225 for (tmp = ms.bot; tmp; tmp = tmp->above) 1281 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1226 if (object::can_merge (op, tmp)) 1282 if (object::can_merge (op, tmp))
1227 { 1283 {
1228 op->nrof += tmp->nrof; 1284 op->nrof += tmp->nrof;
1229 tmp->destroy (); 1285 tmp->destroy ();
1230 } 1286 }
1399 * blocked() and wall() work properly), and these flags are updated by 1455 * blocked() and wall() work properly), and these flags are updated by
1400 * update_object(). 1456 * update_object().
1401 */ 1457 */
1402 1458
1403 /* if this is not the head or flag has been passed, don't check walk on status */ 1459 /* if this is not the head or flag has been passed, don't check walk on status */
1404 if (!(flag & INS_NO_WALK_ON) && !op->head) 1460 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1405 { 1461 {
1406 if (check_move_on (op, originator)) 1462 if (check_move_on (op, originator))
1407 return 0; 1463 return 0;
1408 1464
1409 /* If we are a multi part object, lets work our way through the check 1465 /* If we are a multi part object, lets work our way through the check
1410 * walk on's. 1466 * walk on's.
1411 */ 1467 */
1412 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1468 for (object *tmp = op->more; tmp; tmp = tmp->more)
1413 if (check_move_on (tmp, originator)) 1469 if (check_move_on (tmp, originator))
1414 return 0; 1470 return 0;
1415 } 1471 }
1416 1472
1417 return op; 1473 return op;
1427 object *tmp, *tmp1; 1483 object *tmp, *tmp1;
1428 1484
1429 /* first search for itself and remove any old instances */ 1485 /* first search for itself and remove any old instances */
1430 1486
1431 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1487 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1432 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1488 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1433 tmp->destroy (); 1489 tmp->destroy ();
1434 1490
1435 tmp1 = arch_to_object (archetype::find (arch_string)); 1491 tmp1 = arch_to_object (archetype::find (arch_string));
1436 1492
1437 tmp1->x = op->x; 1493 tmp1->x = op->x;
1598 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1654 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1599 free (dump); 1655 free (dump);
1600 return op; 1656 return op;
1601 } 1657 }
1602 1658
1603 if (where->head) 1659 if (where->head_ () != where)
1604 { 1660 {
1605 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1661 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1606 where = where->head; 1662 where = where->head;
1607 } 1663 }
1608 1664
1609 return where->insert (op); 1665 return where->insert (op);
1610} 1666}
1938 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1994 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1939 { 1995 {
1940 CLEAR_FLAG (tmp, flag); 1996 CLEAR_FLAG (tmp, flag);
1941 unflag_inv (tmp, flag); 1997 unflag_inv (tmp, flag);
1942 } 1998 }
1943}
1944
1945/*
1946 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1947 * all it's inventory (recursively).
1948 * If checksums are used, a player will get set_cheat called for
1949 * him/her-self and all object carried by a call to this function.
1950 */
1951void
1952set_cheat (object *op)
1953{
1954 SET_FLAG (op, FLAG_WAS_WIZ);
1955 flag_inv (op, FLAG_WAS_WIZ);
1956} 1999}
1957 2000
1958/* 2001/*
1959 * find_free_spot(object, map, x, y, start, stop) will search for 2002 * find_free_spot(object, map, x, y, start, stop) will search for
1960 * a spot at the given map and coordinates which will be able to contain 2003 * a spot at the given map and coordinates which will be able to contain
2078 object *tmp; 2121 object *tmp;
2079 maptile *mp; 2122 maptile *mp;
2080 2123
2081 MoveType blocked, move_type; 2124 MoveType blocked, move_type;
2082 2125
2083 if (exclude && exclude->head) 2126 if (exclude && exclude->head_ () != exclude)
2084 { 2127 {
2085 exclude = exclude->head; 2128 exclude = exclude->head;
2086 move_type = exclude->move_type; 2129 move_type = exclude->move_type;
2087 } 2130 }
2088 else 2131 else
2111 max = maxfree[i]; 2154 max = maxfree[i];
2112 else if (mflags & P_IS_ALIVE) 2155 else if (mflags & P_IS_ALIVE)
2113 { 2156 {
2114 for (tmp = ms.bot; tmp; tmp = tmp->above) 2157 for (tmp = ms.bot; tmp; tmp = tmp->above)
2115 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2158 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2116 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2159 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2117 break; 2160 break;
2118 2161
2119 if (tmp) 2162 if (tmp)
2120 return freedir[i]; 2163 return freedir[i];
2121 } 2164 }
2316 * create clone from object to another 2359 * create clone from object to another
2317 */ 2360 */
2318object * 2361object *
2319object_create_clone (object *asrc) 2362object_create_clone (object *asrc)
2320{ 2363{
2321 object *dst = 0, *tmp, *src, *part, *prev, *item; 2364 object *dst = 0, *tmp, *src, *prev, *item;
2322 2365
2323 if (!asrc) 2366 if (!asrc)
2324 return 0; 2367 return 0;
2325 2368
2326 src = asrc;
2327 if (src->head)
2328 src = src->head; 2369 src = asrc->head_ ();
2329 2370
2330 prev = 0; 2371 prev = 0;
2331 for (part = src; part; part = part->more) 2372 for (object *part = src; part; part = part->more)
2332 { 2373 {
2333 tmp = part->clone (); 2374 tmp = part->clone ();
2334 tmp->x -= src->x; 2375 tmp->x -= src->x;
2335 tmp->y -= src->y; 2376 tmp->y -= src->y;
2336 2377
2449 /* Basically, if the archetype has this key set, 2490 /* Basically, if the archetype has this key set,
2450 * we need to store the null value so when we save 2491 * we need to store the null value so when we save
2451 * it, we save the empty value so that when we load, 2492 * it, we save the empty value so that when we load,
2452 * we get this value back again. 2493 * we get this value back again.
2453 */ 2494 */
2454 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2495 if (get_ob_key_link (op->arch, canonical_key))
2455 field->value = 0; 2496 field->value = 0;
2456 else 2497 else
2457 { 2498 {
2458 if (last) 2499 if (last)
2459 last->next = field->next; 2500 last->next = field->next;
2528 } 2569 }
2529 else 2570 else
2530 item = item->env; 2571 item = item->env;
2531} 2572}
2532 2573
2533
2534const char * 2574const char *
2535object::flag_desc (char *desc, int len) const 2575object::flag_desc (char *desc, int len) const
2536{ 2576{
2537 char *p = desc; 2577 char *p = desc;
2538 bool first = true; 2578 bool first = true;
2584} 2624}
2585 2625
2586const char * 2626const char *
2587object::debug_desc () const 2627object::debug_desc () const
2588{ 2628{
2589 static char info[256 * 4]; 2629 static char info[3][256 * 4];
2630 static int info_idx;
2631
2590 return debug_desc (info); 2632 return debug_desc (info [++info_idx % 3]);
2591}
2592
2593const char *
2594object::debug_desc2 () const
2595{
2596 static char info[256 * 4];
2597 return debug_desc (info);
2598} 2633}
2599 2634
2600struct region * 2635struct region *
2601object::region () const 2636object::region () const
2602{ 2637{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines