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.140 by root, Tue Apr 24 12:32:14 2007 UTC vs.
Revision 1.162 by root, Sat Jun 16 00:12:20 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;
324sum_weight (object *op) 325sum_weight (object *op)
325{ 326{
326 long sum; 327 long sum;
327 object *inv; 328 object *inv;
328 329
329 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 330 for (sum = 0, inv = op->inv; inv; inv = inv->below)
330 { 331 {
331 if (inv->inv) 332 if (inv->inv)
332 sum_weight (inv); 333 sum_weight (inv);
334
333 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 335 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334 } 336 }
335 337
336 if (op->type == CONTAINER && op->stats.Str) 338 if (op->type == CONTAINER && op->stats.Str)
337 sum = (sum * (100 - op->stats.Str)) / 100; 339 sum = (sum * (100 - op->stats.Str)) / 100;
446 */ 448 */
447 while (owner->owner) 449 while (owner->owner)
448 owner = owner->owner; 450 owner = owner->owner;
449 451
450 this->owner = owner; 452 this->owner = owner;
453}
454
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
473object::change_weapon (object *ob)
474{
475 if (current_weapon == ob)
476 return true;
477
478 if (chosen_skill)
479 chosen_skill->flag [FLAG_APPLIED] = false;
480
481 current_weapon = ob;
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
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;
451} 519}
452 520
453/* Zero the key_values on op, decrementing the shared-string 521/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 522 * refcounts and freeing the links.
455 */ 523 */
537 * need for monsters, but doesn't hurt to do it for everything. 605 * need for monsters, but doesn't hurt to do it for everything.
538 * by doing so, when a monster is created, it has good starting 606 * by doing so, when a monster is created, it has good starting
539 * values for the body_used info, so when items are created 607 * values for the body_used info, so when items are created
540 * for it, they can be properly equipped. 608 * for it, they can be properly equipped.
541 */ 609 */
542 memcpy (body_used, body_info, sizeof (body_used)); 610 for (int i = NUM_BODY_LOCATIONS; i--; )
611 slot[i].used = slot[i].info;
543 612
544 attachable::instantiate (); 613 attachable::instantiate ();
545} 614}
546 615
547object * 616object *
868 map = freed_map; 937 map = freed_map;
869 x = 1; 938 x = 1;
870 y = 1; 939 y = 1;
871 } 940 }
872 941
873 head = 0;
874
875 if (more) 942 if (more)
876 { 943 {
877 more->destroy (); 944 more->destroy ();
878 more = 0; 945 more = 0;
879 } 946 }
880 947
948 head = 0;
949
881 // clear those pointers that likely might have circular references to us 950 // clear those pointers that likely might cause circular references
882 owner = 0; 951 owner = 0;
883 enemy = 0; 952 enemy = 0;
884 attacked_by = 0; 953 attacked_by = 0;
954 current_weapon = 0;
885} 955}
886 956
887void 957void
888object::destroy (bool destroy_inventory) 958object::destroy (bool destroy_inventory)
889{ 959{
1047 1117
1048 if (destroyed ()) 1118 if (destroyed ())
1049 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1119 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1050 } 1120 }
1051 1121
1052 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1053 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1054 if (tmp->above == tmp)
1055 tmp->above = 0;
1056
1057 last = tmp; 1122 last = tmp;
1058 } 1123 }
1059 1124
1060 /* last == NULL if there are no objects on this space */ 1125 /* last == NULL if there are no objects on this space */
1061 //TODO: this makes little sense, why only update the topmost object? 1126 //TODO: this makes little sense, why only update the topmost object?
1112 if (more) 1177 if (more)
1113 return; 1178 return;
1114 1179
1115 object *prev = this; 1180 object *prev = this;
1116 1181
1117 for (archetype *at = arch->more; at; at = at->more) 1182 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1118 { 1183 {
1119 object *op = arch_to_object (at); 1184 object *op = arch_to_object (at);
1120 1185
1121 op->name = name; 1186 op->name = name;
1122 op->name_pl = name_pl; 1187 op->name_pl = name_pl;
1136object * 1201object *
1137insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1202insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1138{ 1203{
1139 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1204 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1140 { 1205 {
1141 tmp->x = x + tmp->arch->clone.x; 1206 tmp->x = x + tmp->arch->x;
1142 tmp->y = y + tmp->arch->clone.y; 1207 tmp->y = y + tmp->arch->y;
1143 } 1208 }
1144 1209
1145 return insert_ob_in_map (op, m, originator, flag); 1210 return insert_ob_in_map (op, m, originator, flag);
1146} 1211}
1147 1212
1168object * 1233object *
1169insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1234insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1170{ 1235{
1171 assert (!op->flag [FLAG_FREED]); 1236 assert (!op->flag [FLAG_FREED]);
1172 1237
1173 object *tmp, *top, *floor = NULL; 1238 object *top, *floor = NULL;
1174 1239
1175 op->remove (); 1240 op->remove ();
1176 1241
1177#if 0 1242#if 0
1178 if (!m->active != !op->active) 1243 if (!m->active != !op->active)
1194#endif 1259#endif
1195 return op; 1260 return op;
1196 } 1261 }
1197 1262
1198 if (object *more = op->more) 1263 if (object *more = op->more)
1199 {
1200 if (!insert_ob_in_map (more, m, originator, flag)) 1264 if (!insert_ob_in_map (more, m, originator, flag))
1201 {
1202 if (!op->head)
1203 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1204
1205 return 0; 1265 return 0;
1206 }
1207 }
1208 1266
1209 CLEAR_FLAG (op, FLAG_REMOVED); 1267 CLEAR_FLAG (op, FLAG_REMOVED);
1210 1268
1211 /* Ideally, the caller figures this out. However, it complicates a lot 1269 /* Ideally, the caller figures this out. However, it complicates a lot
1212 * of areas of callers (eg, anything that uses find_free_spot would now 1270 * of areas of callers (eg, anything that uses find_free_spot would now
1219 mapspace &ms = op->ms (); 1277 mapspace &ms = op->ms ();
1220 1278
1221 /* this has to be done after we translate the coordinates. 1279 /* this has to be done after we translate the coordinates.
1222 */ 1280 */
1223 if (op->nrof && !(flag & INS_NO_MERGE)) 1281 if (op->nrof && !(flag & INS_NO_MERGE))
1224 for (tmp = ms.bot; tmp; tmp = tmp->above) 1282 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1225 if (object::can_merge (op, tmp)) 1283 if (object::can_merge (op, tmp))
1226 { 1284 {
1227 op->nrof += tmp->nrof; 1285 op->nrof += tmp->nrof;
1228 tmp->destroy (); 1286 tmp->destroy ();
1229 } 1287 }
1398 * blocked() and wall() work properly), and these flags are updated by 1456 * blocked() and wall() work properly), and these flags are updated by
1399 * update_object(). 1457 * update_object().
1400 */ 1458 */
1401 1459
1402 /* 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 */
1403 if (!(flag & INS_NO_WALK_ON) && !op->head) 1461 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1404 { 1462 {
1405 if (check_move_on (op, originator)) 1463 if (check_move_on (op, originator))
1406 return 0; 1464 return 0;
1407 1465
1408 /* 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
1409 * walk on's. 1467 * walk on's.
1410 */ 1468 */
1411 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1469 for (object *tmp = op->more; tmp; tmp = tmp->more)
1412 if (check_move_on (tmp, originator)) 1470 if (check_move_on (tmp, originator))
1413 return 0; 1471 return 0;
1414 } 1472 }
1415 1473
1416 return op; 1474 return op;
1426 object *tmp, *tmp1; 1484 object *tmp, *tmp1;
1427 1485
1428 /* first search for itself and remove any old instances */ 1486 /* first search for itself and remove any old instances */
1429 1487
1430 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1488 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1431 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1489 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1432 tmp->destroy (); 1490 tmp->destroy ();
1433 1491
1434 tmp1 = arch_to_object (archetype::find (arch_string)); 1492 tmp1 = arch_to_object (archetype::find (arch_string));
1435 1493
1436 tmp1->x = op->x; 1494 tmp1->x = op->x;
1597 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);
1598 free (dump); 1656 free (dump);
1599 return op; 1657 return op;
1600 } 1658 }
1601 1659
1602 if (where->head) 1660 if (where->head_ () != where)
1603 { 1661 {
1604 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");
1605 where = where->head; 1663 where = where->head;
1606 } 1664 }
1607 1665
1608 return where->insert (op); 1666 return where->insert (op);
1609} 1667}
1937 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1995 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1938 { 1996 {
1939 CLEAR_FLAG (tmp, flag); 1997 CLEAR_FLAG (tmp, flag);
1940 unflag_inv (tmp, flag); 1998 unflag_inv (tmp, flag);
1941 } 1999 }
1942}
1943
1944/*
1945 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1946 * all it's inventory (recursively).
1947 * If checksums are used, a player will get set_cheat called for
1948 * him/her-self and all object carried by a call to this function.
1949 */
1950void
1951set_cheat (object *op)
1952{
1953 SET_FLAG (op, FLAG_WAS_WIZ);
1954 flag_inv (op, FLAG_WAS_WIZ);
1955} 2000}
1956 2001
1957/* 2002/*
1958 * 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
1959 * 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
2077 object *tmp; 2122 object *tmp;
2078 maptile *mp; 2123 maptile *mp;
2079 2124
2080 MoveType blocked, move_type; 2125 MoveType blocked, move_type;
2081 2126
2082 if (exclude && exclude->head) 2127 if (exclude && exclude->head_ () != exclude)
2083 { 2128 {
2084 exclude = exclude->head; 2129 exclude = exclude->head;
2085 move_type = exclude->move_type; 2130 move_type = exclude->move_type;
2086 } 2131 }
2087 else 2132 else
2110 max = maxfree[i]; 2155 max = maxfree[i];
2111 else if (mflags & P_IS_ALIVE) 2156 else if (mflags & P_IS_ALIVE)
2112 { 2157 {
2113 for (tmp = ms.bot; tmp; tmp = tmp->above) 2158 for (tmp = ms.bot; tmp; tmp = tmp->above)
2114 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2159 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2115 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2160 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2116 break; 2161 break;
2117 2162
2118 if (tmp) 2163 if (tmp)
2119 return freedir[i]; 2164 return freedir[i];
2120 } 2165 }
2315 * create clone from object to another 2360 * create clone from object to another
2316 */ 2361 */
2317object * 2362object *
2318object_create_clone (object *asrc) 2363object_create_clone (object *asrc)
2319{ 2364{
2320 object *dst = 0, *tmp, *src, *part, *prev, *item; 2365 object *dst = 0, *tmp, *src, *prev, *item;
2321 2366
2322 if (!asrc) 2367 if (!asrc)
2323 return 0; 2368 return 0;
2324 2369
2325 src = asrc;
2326 if (src->head)
2327 src = src->head; 2370 src = asrc->head_ ();
2328 2371
2329 prev = 0; 2372 prev = 0;
2330 for (part = src; part; part = part->more) 2373 for (object *part = src; part; part = part->more)
2331 { 2374 {
2332 tmp = part->clone (); 2375 tmp = part->clone ();
2333 tmp->x -= src->x; 2376 tmp->x -= src->x;
2334 tmp->y -= src->y; 2377 tmp->y -= src->y;
2335 2378
2448 /* Basically, if the archetype has this key set, 2491 /* Basically, if the archetype has this key set,
2449 * we need to store the null value so when we save 2492 * we need to store the null value so when we save
2450 * it, we save the empty value so that when we load, 2493 * it, we save the empty value so that when we load,
2451 * we get this value back again. 2494 * we get this value back again.
2452 */ 2495 */
2453 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2496 if (get_ob_key_link (op->arch, canonical_key))
2454 field->value = 0; 2497 field->value = 0;
2455 else 2498 else
2456 { 2499 {
2457 if (last) 2500 if (last)
2458 last->next = field->next; 2501 last->next = field->next;
2527 } 2570 }
2528 else 2571 else
2529 item = item->env; 2572 item = item->env;
2530} 2573}
2531 2574
2532
2533const char * 2575const char *
2534object::flag_desc (char *desc, int len) const 2576object::flag_desc (char *desc, int len) const
2535{ 2577{
2536 char *p = desc; 2578 char *p = desc;
2537 bool first = true; 2579 bool first = true;
2583} 2625}
2584 2626
2585const char * 2627const char *
2586object::debug_desc () const 2628object::debug_desc () const
2587{ 2629{
2588 static char info[256 * 4]; 2630 static char info[3][256 * 4];
2631 static int info_idx;
2632
2589 return debug_desc (info); 2633 return debug_desc (info [++info_idx % 3]);
2590}
2591
2592const char *
2593object::debug_desc2 () const
2594{
2595 static char info[256 * 4];
2596 return debug_desc (info);
2597} 2634}
2598 2635
2599struct region * 2636struct region *
2600object::region () const 2637object::region () const
2601{ 2638{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines