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.145 by root, Mon May 7 03:05:58 2007 UTC vs.
Revision 1.160 by root, Tue Jun 5 13:05:02 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 27 variable. */
29#include <stdio.h> 29#include <stdio.h>
30#include <sys/types.h> 30#include <sys/types.h>
31#include <sys/uio.h> 31#include <sys/uio.h>
32#include <object.h> 32#include <object.h>
33#include <funcpoint.h> 33#include <funcpoint.h>
34#include <sproto.h>
34#include <loader.h> 35#include <loader.h>
35 36
36#include <bitset> 37#include <bitset>
37 38
38int nrofallocobjects = 0; 39int nrofallocobjects = 0;
449 owner = owner->owner; 450 owner = owner->owner;
450 451
451 this->owner = owner; 452 this->owner = owner;
452} 453}
453 454
454void 455int
456object::slottype () const
457{
458 if (type == SKILL)
459 {
460 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
461 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
462 }
463 else
464 {
465 if (slot [body_combat].info) return slot_combat;
466 if (slot [body_range ].info) return slot_ranged;
467 }
468
469 return slot_none;
470}
471
472bool
455object::set_weapon (object *ob) 473object::change_weapon (object *ob)
456{ 474{
457 if (current_weapon == ob) 475 if (current_weapon == ob)
458 return; 476 return true;
477
478 if (chosen_skill)
479 chosen_skill->flag [FLAG_APPLIED] = false;
459 480
460 current_weapon = ob; 481 current_weapon = ob;
461 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); 482 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
483
484 if (chosen_skill)
485 chosen_skill->flag [FLAG_APPLIED] = true;
486
462 update_stats (); 487 update_stats ();
488
489 if (ob)
490 {
491 // now check wether any body locations became invalid, in which case
492 // we cannot apply the weapon at the moment.
493 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
494 if (slot[i].used < 0)
495 {
496 current_weapon = chosen_skill = 0;
497 update_stats ();
498
499 new_draw_info_format (NDI_UNIQUE, 0, this,
500 "You try to balance all your items at once, "
501 "but the %s is just too much for your body. "
502 "[You need to unapply some items first.]", &ob->name);
503 return false;
504 }
505
506 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
507 }
508 else
509 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
510
511 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
512 {
513 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
514 &name, ob->debug_desc ());
515 return false;
516 }
517
518 return true;
463} 519}
464 520
465/* Zero the key_values on op, decrementing the shared-string 521/* Zero the key_values on op, decrementing the shared-string
466 * refcounts and freeing the links. 522 * refcounts and freeing the links.
467 */ 523 */
1125 if (more) 1181 if (more)
1126 return; 1182 return;
1127 1183
1128 object *prev = this; 1184 object *prev = this;
1129 1185
1130 for (archetype *at = arch->more; at; at = at->more) 1186 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1131 { 1187 {
1132 object *op = arch_to_object (at); 1188 object *op = arch_to_object (at);
1133 1189
1134 op->name = name; 1190 op->name = name;
1135 op->name_pl = name_pl; 1191 op->name_pl = name_pl;
1149object * 1205object *
1150insert_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)
1151{ 1207{
1152 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1208 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1153 { 1209 {
1154 tmp->x = x + tmp->arch->clone.x; 1210 tmp->x = x + tmp->arch->x;
1155 tmp->y = y + tmp->arch->clone.y; 1211 tmp->y = y + tmp->arch->y;
1156 } 1212 }
1157 1213
1158 return insert_ob_in_map (op, m, originator, flag); 1214 return insert_ob_in_map (op, m, originator, flag);
1159} 1215}
1160 1216
1181object * 1237object *
1182insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1183{ 1239{
1184 assert (!op->flag [FLAG_FREED]); 1240 assert (!op->flag [FLAG_FREED]);
1185 1241
1186 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1187 1243
1188 op->remove (); 1244 op->remove ();
1189 1245
1190#if 0 1246#if 0
1191 if (!m->active != !op->active) 1247 if (!m->active != !op->active)
1207#endif 1263#endif
1208 return op; 1264 return op;
1209 } 1265 }
1210 1266
1211 if (object *more = op->more) 1267 if (object *more = op->more)
1212 {
1213 if (!insert_ob_in_map (more, m, originator, flag)) 1268 if (!insert_ob_in_map (more, m, originator, flag))
1214 {
1215 if (!op->head)
1216 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1217
1218 return 0; 1269 return 0;
1219 }
1220 }
1221 1270
1222 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1223 1272
1224 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* Ideally, the caller figures this out. However, it complicates a lot
1225 * 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
1232 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1233 1282
1234 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1235 */ 1284 */
1236 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1237 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1238 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1239 { 1288 {
1240 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1241 tmp->destroy (); 1290 tmp->destroy ();
1242 } 1291 }
1411 * blocked() and wall() work properly), and these flags are updated by 1460 * blocked() and wall() work properly), and these flags are updated by
1412 * update_object(). 1461 * update_object().
1413 */ 1462 */
1414 1463
1415 /* if this is not the head or flag has been passed, don't check walk on status */ 1464 /* if this is not the head or flag has been passed, don't check walk on status */
1416 if (!(flag & INS_NO_WALK_ON) && !op->head) 1465 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1417 { 1466 {
1418 if (check_move_on (op, originator)) 1467 if (check_move_on (op, originator))
1419 return 0; 1468 return 0;
1420 1469
1421 /* If we are a multi part object, lets work our way through the check 1470 /* If we are a multi part object, lets work our way through the check
1422 * walk on's. 1471 * walk on's.
1423 */ 1472 */
1424 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1473 for (object *tmp = op->more; tmp; tmp = tmp->more)
1425 if (check_move_on (tmp, originator)) 1474 if (check_move_on (tmp, originator))
1426 return 0; 1475 return 0;
1427 } 1476 }
1428 1477
1429 return op; 1478 return op;
1439 object *tmp, *tmp1; 1488 object *tmp, *tmp1;
1440 1489
1441 /* first search for itself and remove any old instances */ 1490 /* first search for itself and remove any old instances */
1442 1491
1443 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1492 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1444 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1493 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1445 tmp->destroy (); 1494 tmp->destroy ();
1446 1495
1447 tmp1 = arch_to_object (archetype::find (arch_string)); 1496 tmp1 = arch_to_object (archetype::find (arch_string));
1448 1497
1449 tmp1->x = op->x; 1498 tmp1->x = op->x;
1610 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1659 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1611 free (dump); 1660 free (dump);
1612 return op; 1661 return op;
1613 } 1662 }
1614 1663
1615 if (where->head) 1664 if (where->head_ () != where)
1616 { 1665 {
1617 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1666 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1618 where = where->head; 1667 where = where->head;
1619 } 1668 }
1620 1669
1621 return where->insert (op); 1670 return where->insert (op);
1622} 1671}
1950 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1999 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1951 { 2000 {
1952 CLEAR_FLAG (tmp, flag); 2001 CLEAR_FLAG (tmp, flag);
1953 unflag_inv (tmp, flag); 2002 unflag_inv (tmp, flag);
1954 } 2003 }
1955}
1956
1957/*
1958 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1959 * all it's inventory (recursively).
1960 * If checksums are used, a player will get set_cheat called for
1961 * him/her-self and all object carried by a call to this function.
1962 */
1963void
1964set_cheat (object *op)
1965{
1966 SET_FLAG (op, FLAG_WAS_WIZ);
1967 flag_inv (op, FLAG_WAS_WIZ);
1968} 2004}
1969 2005
1970/* 2006/*
1971 * find_free_spot(object, map, x, y, start, stop) will search for 2007 * find_free_spot(object, map, x, y, start, stop) will search for
1972 * a spot at the given map and coordinates which will be able to contain 2008 * a spot at the given map and coordinates which will be able to contain
2090 object *tmp; 2126 object *tmp;
2091 maptile *mp; 2127 maptile *mp;
2092 2128
2093 MoveType blocked, move_type; 2129 MoveType blocked, move_type;
2094 2130
2095 if (exclude && exclude->head) 2131 if (exclude && exclude->head_ () != exclude)
2096 { 2132 {
2097 exclude = exclude->head; 2133 exclude = exclude->head;
2098 move_type = exclude->move_type; 2134 move_type = exclude->move_type;
2099 } 2135 }
2100 else 2136 else
2123 max = maxfree[i]; 2159 max = maxfree[i];
2124 else if (mflags & P_IS_ALIVE) 2160 else if (mflags & P_IS_ALIVE)
2125 { 2161 {
2126 for (tmp = ms.bot; tmp; tmp = tmp->above) 2162 for (tmp = ms.bot; tmp; tmp = tmp->above)
2127 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2163 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2128 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2164 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2129 break; 2165 break;
2130 2166
2131 if (tmp) 2167 if (tmp)
2132 return freedir[i]; 2168 return freedir[i];
2133 } 2169 }
2328 * create clone from object to another 2364 * create clone from object to another
2329 */ 2365 */
2330object * 2366object *
2331object_create_clone (object *asrc) 2367object_create_clone (object *asrc)
2332{ 2368{
2333 object *dst = 0, *tmp, *src, *part, *prev, *item; 2369 object *dst = 0, *tmp, *src, *prev, *item;
2334 2370
2335 if (!asrc) 2371 if (!asrc)
2336 return 0; 2372 return 0;
2337 2373
2338 src = asrc;
2339 if (src->head)
2340 src = src->head; 2374 src = asrc->head_ ();
2341 2375
2342 prev = 0; 2376 prev = 0;
2343 for (part = src; part; part = part->more) 2377 for (object *part = src; part; part = part->more)
2344 { 2378 {
2345 tmp = part->clone (); 2379 tmp = part->clone ();
2346 tmp->x -= src->x; 2380 tmp->x -= src->x;
2347 tmp->y -= src->y; 2381 tmp->y -= src->y;
2348 2382
2461 /* Basically, if the archetype has this key set, 2495 /* Basically, if the archetype has this key set,
2462 * we need to store the null value so when we save 2496 * we need to store the null value so when we save
2463 * it, we save the empty value so that when we load, 2497 * it, we save the empty value so that when we load,
2464 * we get this value back again. 2498 * we get this value back again.
2465 */ 2499 */
2466 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2500 if (get_ob_key_link (op->arch, canonical_key))
2467 field->value = 0; 2501 field->value = 0;
2468 else 2502 else
2469 { 2503 {
2470 if (last) 2504 if (last)
2471 last->next = field->next; 2505 last->next = field->next;

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines