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.133 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.161 by root, Wed Jun 13 21:09:39 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 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;
448 owner = owner->owner; 450 owner = owner->owner;
449 451
450 this->owner = owner; 452 this->owner = owner;
451} 453}
452 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;
519}
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 */
456static void 524static void
457free_key_values (object *op) 525free_key_values (object *op)
458{ 526{
459 for (key_value *i = op->key_values; i != 0;) 527 for (key_value *i = op->key_values; i; )
460 { 528 {
461 key_value *next = i->next; 529 key_value *next = i->next;
462 delete i; 530 delete i;
463 531
464 i = next; 532 i = next;
465 } 533 }
466 534
467 op->key_values = 0; 535 op->key_values = 0;
468} 536}
469 537
470/* 538object &
471 * copy_to first frees everything allocated by the dst object, 539object::operator =(const object &src)
472 * and then copies the contents of itself into the second
473 * object, allocating what needs to be allocated. Basically, any
474 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
475 * if the first object is freed, the pointers in the new object
476 * will point at garbage.
477 */
478void
479object::copy_to (object *dst)
480{ 540{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 541 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 542 bool is_removed = flag [FLAG_REMOVED];
483 543
484 *(object_copy *)dst = *this; 544 *(object_copy *)this = src;
485 545
486 if (is_freed) 546 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 547 flag [FLAG_REMOVED] = is_removed;
488
489 if (is_removed)
490 SET_FLAG (dst, FLAG_REMOVED);
491
492 if (speed < 0)
493 dst->speed_left = speed_left - rndm ();
494 548
495 /* Copy over key_values, if any. */ 549 /* Copy over key_values, if any. */
496 if (key_values) 550 if (src.key_values)
497 { 551 {
498 key_value *tail = 0; 552 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 553 key_values = 0;
502 554
503 for (i = key_values; i; i = i->next) 555 for (key_value *i = src.key_values; i; i = i->next)
504 { 556 {
505 key_value *new_link = new key_value; 557 key_value *new_link = new key_value;
506 558
507 new_link->next = 0; 559 new_link->next = 0;
508 new_link->key = i->key; 560 new_link->key = i->key;
509 new_link->value = i->value; 561 new_link->value = i->value;
510 562
511 /* Try and be clever here, too. */ 563 /* Try and be clever here, too. */
512 if (!dst->key_values) 564 if (!key_values)
513 { 565 {
514 dst->key_values = new_link; 566 key_values = new_link;
515 tail = new_link; 567 tail = new_link;
516 } 568 }
517 else 569 else
518 { 570 {
519 tail->next = new_link; 571 tail->next = new_link;
520 tail = new_link; 572 tail = new_link;
521 } 573 }
522 } 574 }
523 } 575 }
576}
577
578/*
579 * copy_to first frees everything allocated by the dst object,
580 * and then copies the contents of itself into the second
581 * object, allocating what needs to be allocated. Basically, any
582 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
583 * if the first object is freed, the pointers in the new object
584 * will point at garbage.
585 */
586void
587object::copy_to (object *dst)
588{
589 *dst = *this;
590
591 if (speed < 0)
592 dst->speed_left = speed_left - rndm ();
524 593
525 dst->set_speed (dst->speed); 594 dst->set_speed (dst->speed);
526} 595}
527 596
528void 597void
536 * 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.
537 * 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
538 * values for the body_used info, so when items are created 607 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped. 608 * for it, they can be properly equipped.
540 */ 609 */
541 memcpy (body_used, body_info, sizeof (body_used)); 610 for (int i = NUM_BODY_LOCATIONS; i--; )
611 slot[i].used = slot[i].info;
542 612
543 attachable::instantiate (); 613 attachable::instantiate ();
544} 614}
545 615
546object * 616object *
606 * UP_OBJ_FACE: only the objects face has changed. 676 * UP_OBJ_FACE: only the objects face has changed.
607 */ 677 */
608void 678void
609update_object (object *op, int action) 679update_object (object *op, int action)
610{ 680{
611 MoveType move_on, move_off, move_block, move_slow;
612
613 if (op == NULL) 681 if (op == NULL)
614 { 682 {
615 /* this should never happen */ 683 /* this should never happen */
616 LOG (llevDebug, "update_object() called for NULL object.\n"); 684 LOG (llevDebug, "update_object() called for NULL object.\n");
617 return; 685 return;
836 904
837 if (flag [FLAG_IS_LINKED]) 905 if (flag [FLAG_IS_LINKED])
838 remove_button_link (this); 906 remove_button_link (this);
839 907
840 if (flag [FLAG_FRIENDLY]) 908 if (flag [FLAG_FRIENDLY])
841 {
842 remove_friendly_object (this); 909 remove_friendly_object (this);
843
844 if (type == GOLEM
845 && owner
846 && owner->type == PLAYER
847 && owner->contr->ranges[range_golem] == this)
848 owner->contr->ranges[range_golem] = 0;
849 }
850 910
851 if (!flag [FLAG_REMOVED]) 911 if (!flag [FLAG_REMOVED])
852 remove (); 912 remove ();
853 913
854 destroy_inv (true); 914 destroy_inv (true);
1056 1116
1057 if (destroyed ()) 1117 if (destroyed ())
1058 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 ());
1059 } 1119 }
1060 1120
1061 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1062 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1063 if (tmp->above == tmp)
1064 tmp->above = 0;
1065
1066 last = tmp; 1121 last = tmp;
1067 } 1122 }
1068 1123
1069 /* last == NULL if there are no objects on this space */ 1124 /* last == NULL if there are no objects on this space */
1070 //TODO: this makes little sense, why only update the topmost object? 1125 //TODO: this makes little sense, why only update the topmost object?
1113 } 1168 }
1114 1169
1115 return 0; 1170 return 0;
1116} 1171}
1117 1172
1173void
1174object::expand_tail ()
1175{
1176 if (more)
1177 return;
1178
1179 object *prev = this;
1180
1181 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1182 {
1183 object *op = arch_to_object (at);
1184
1185 op->name = name;
1186 op->name_pl = name_pl;
1187 op->title = title;
1188
1189 op->head = this;
1190 prev->more = op;
1191
1192 prev = op;
1193 }
1194}
1195
1118/* 1196/*
1119 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1197 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1120 * job preparing multi-part monsters. 1198 * job preparing multi-part monsters.
1121 */ 1199 */
1122object * 1200object *
1123insert_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)
1124{ 1202{
1125 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1203 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1126 { 1204 {
1127 tmp->x = x + tmp->arch->clone.x; 1205 tmp->x = x + tmp->arch->x;
1128 tmp->y = y + tmp->arch->clone.y; 1206 tmp->y = y + tmp->arch->y;
1129 } 1207 }
1130 1208
1131 return insert_ob_in_map (op, m, originator, flag); 1209 return insert_ob_in_map (op, m, originator, flag);
1132} 1210}
1133 1211
1152 * just 'op' otherwise 1230 * just 'op' otherwise
1153 */ 1231 */
1154object * 1232object *
1155insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1233insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1156{ 1234{
1235 assert (!op->flag [FLAG_FREED]);
1236
1157 object *tmp, *top, *floor = NULL; 1237 object *top, *floor = NULL;
1158
1159 if (QUERY_FLAG (op, FLAG_FREED))
1160 {
1161 LOG (llevError, "Trying to insert freed object!\n");
1162 return NULL;
1163 }
1164
1165 if (!QUERY_FLAG (op, FLAG_REMOVED))
1166 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1167 1238
1168 op->remove (); 1239 op->remove ();
1169 1240
1170 if (!m) 1241#if 0
1171 { 1242 if (!m->active != !op->active)
1172 char *dump = dump_object (op); 1243 if (m->active)
1173 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1244 op->activate_recursive ();
1174 free (dump); 1245 else
1175 return op; 1246 op->deactivate_recursive ();
1176 } 1247#endif
1177 1248
1178 if (out_of_map (m, op->x, op->y)) 1249 if (out_of_map (m, op->x, op->y))
1179 { 1250 {
1180 char *dump = dump_object (op);
1181 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1251 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1182#ifdef MANY_CORES 1252#ifdef MANY_CORES
1183 /* Better to catch this here, as otherwise the next use of this object 1253 /* Better to catch this here, as otherwise the next use of this object
1184 * is likely to cause a crash. Better to find out where it is getting 1254 * is likely to cause a crash. Better to find out where it is getting
1185 * improperly inserted. 1255 * improperly inserted.
1186 */ 1256 */
1187 abort (); 1257 abort ();
1188#endif 1258#endif
1189 free (dump);
1190 return op; 1259 return op;
1191 } 1260 }
1192 1261
1193 if (object *more = op->more) 1262 if (object *more = op->more)
1194 {
1195 if (!insert_ob_in_map (more, m, originator, flag)) 1263 if (!insert_ob_in_map (more, m, originator, flag))
1196 {
1197 if (!op->head)
1198 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1199
1200 return 0; 1264 return 0;
1201 }
1202 }
1203 1265
1204 CLEAR_FLAG (op, FLAG_REMOVED); 1266 CLEAR_FLAG (op, FLAG_REMOVED);
1205 1267
1206 /* Ideally, the caller figures this out. However, it complicates a lot 1268 /* Ideally, the caller figures this out. However, it complicates a lot
1207 * 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
1214 mapspace &ms = op->ms (); 1276 mapspace &ms = op->ms ();
1215 1277
1216 /* this has to be done after we translate the coordinates. 1278 /* this has to be done after we translate the coordinates.
1217 */ 1279 */
1218 if (op->nrof && !(flag & INS_NO_MERGE)) 1280 if (op->nrof && !(flag & INS_NO_MERGE))
1219 for (tmp = ms.bot; tmp; tmp = tmp->above) 1281 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1220 if (object::can_merge (op, tmp)) 1282 if (object::can_merge (op, tmp))
1221 { 1283 {
1222 op->nrof += tmp->nrof; 1284 op->nrof += tmp->nrof;
1223 tmp->destroy (); 1285 tmp->destroy ();
1224 } 1286 }
1291 * looks like instead of lots of conditions here. 1353 * looks like instead of lots of conditions here.
1292 * makes things faster, and effectively the same result. 1354 * makes things faster, and effectively the same result.
1293 */ 1355 */
1294 1356
1295 /* Have object 'fall below' other objects that block view. 1357 /* Have object 'fall below' other objects that block view.
1296 * Unless those objects are exits, type 66 1358 * Unless those objects are exits.
1297 * If INS_ON_TOP is used, don't do this processing 1359 * If INS_ON_TOP is used, don't do this processing
1298 * Need to find the object that in fact blocks view, otherwise 1360 * Need to find the object that in fact blocks view, otherwise
1299 * stacking is a bit odd. 1361 * stacking is a bit odd.
1300 */ 1362 */
1301 if (!(flag & INS_ON_TOP) 1363 if (!(flag & INS_ON_TOP)
1302 && ms.flags () & P_BLOCKSVIEW 1364 && ms.flags () & P_BLOCKSVIEW
1303 && (op->face && !op->face->visibility)) 1365 && (op->face && !faces [op->face].visibility))
1304 { 1366 {
1305 for (last = top; last != floor; last = last->below) 1367 for (last = top; last != floor; last = last->below)
1306 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1368 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1307 break; 1369 break;
1308 1370
1393 * blocked() and wall() work properly), and these flags are updated by 1455 * blocked() and wall() work properly), and these flags are updated by
1394 * update_object(). 1456 * update_object().
1395 */ 1457 */
1396 1458
1397 /* 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 */
1398 if (!(flag & INS_NO_WALK_ON) && !op->head) 1460 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1399 { 1461 {
1400 if (check_move_on (op, originator)) 1462 if (check_move_on (op, originator))
1401 return 0; 1463 return 0;
1402 1464
1403 /* 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
1404 * walk on's. 1466 * walk on's.
1405 */ 1467 */
1406 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1468 for (object *tmp = op->more; tmp; tmp = tmp->more)
1407 if (check_move_on (tmp, originator)) 1469 if (check_move_on (tmp, originator))
1408 return 0; 1470 return 0;
1409 } 1471 }
1410 1472
1411 return op; 1473 return op;
1421 object *tmp, *tmp1; 1483 object *tmp, *tmp1;
1422 1484
1423 /* first search for itself and remove any old instances */ 1485 /* first search for itself and remove any old instances */
1424 1486
1425 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1487 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1426 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1488 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1427 tmp->destroy (); 1489 tmp->destroy ();
1428 1490
1429 tmp1 = arch_to_object (archetype::find (arch_string)); 1491 tmp1 = arch_to_object (archetype::find (arch_string));
1430 1492
1431 tmp1->x = op->x; 1493 tmp1->x = op->x;
1434} 1496}
1435 1497
1436object * 1498object *
1437object::insert_at (object *where, object *originator, int flags) 1499object::insert_at (object *where, object *originator, int flags)
1438{ 1500{
1439 where->map->insert (this, where->x, where->y, originator, flags); 1501 return where->map->insert (this, where->x, where->y, originator, flags);
1440} 1502}
1441 1503
1442/* 1504/*
1443 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1505 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1444 * is returned contains nr objects, and the remaining parts contains 1506 * is returned contains nr objects, and the remaining parts contains
1484 * the amount of an object. If the amount reaches 0, the object 1546 * the amount of an object. If the amount reaches 0, the object
1485 * is subsequently removed and freed. 1547 * is subsequently removed and freed.
1486 * 1548 *
1487 * Return value: 'op' if something is left, NULL if the amount reached 0 1549 * Return value: 'op' if something is left, NULL if the amount reached 0
1488 */ 1550 */
1489
1490object * 1551object *
1491decrease_ob_nr (object *op, uint32 i) 1552decrease_ob_nr (object *op, uint32 i)
1492{ 1553{
1493 object *tmp; 1554 object *tmp;
1494 1555
1569 1630
1570/* 1631/*
1571 * add_weight(object, weight) adds the specified weight to an object, 1632 * add_weight(object, weight) adds the specified weight to an object,
1572 * and also updates how much the environment(s) is/are carrying. 1633 * and also updates how much the environment(s) is/are carrying.
1573 */ 1634 */
1574
1575void 1635void
1576add_weight (object *op, signed long weight) 1636add_weight (object *op, signed long weight)
1577{ 1637{
1578 while (op != NULL) 1638 while (op != NULL)
1579 { 1639 {
1594 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);
1595 free (dump); 1655 free (dump);
1596 return op; 1656 return op;
1597 } 1657 }
1598 1658
1599 if (where->head) 1659 if (where->head_ () != where)
1600 { 1660 {
1601 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");
1602 where = where->head; 1662 where = where->head;
1603 } 1663 }
1604 1664
1605 return where->insert (op); 1665 return where->insert (op);
1606} 1666}
1611 * inside the object environment. 1671 * inside the object environment.
1612 * 1672 *
1613 * The function returns now pointer to inserted item, and return value can 1673 * The function returns now pointer to inserted item, and return value can
1614 * be != op, if items are merged. -Tero 1674 * be != op, if items are merged. -Tero
1615 */ 1675 */
1616
1617object * 1676object *
1618object::insert (object *op) 1677object::insert (object *op)
1619{ 1678{
1620 object *tmp, *otmp; 1679 object *tmp, *otmp;
1621 1680
1935 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1994 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1936 { 1995 {
1937 CLEAR_FLAG (tmp, flag); 1996 CLEAR_FLAG (tmp, flag);
1938 unflag_inv (tmp, flag); 1997 unflag_inv (tmp, flag);
1939 } 1998 }
1940}
1941
1942/*
1943 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1944 * all it's inventory (recursively).
1945 * If checksums are used, a player will get set_cheat called for
1946 * him/her-self and all object carried by a call to this function.
1947 */
1948void
1949set_cheat (object *op)
1950{
1951 SET_FLAG (op, FLAG_WAS_WIZ);
1952 flag_inv (op, FLAG_WAS_WIZ);
1953} 1999}
1954 2000
1955/* 2001/*
1956 * 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
1957 * 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
2075 object *tmp; 2121 object *tmp;
2076 maptile *mp; 2122 maptile *mp;
2077 2123
2078 MoveType blocked, move_type; 2124 MoveType blocked, move_type;
2079 2125
2080 if (exclude && exclude->head) 2126 if (exclude && exclude->head_ () != exclude)
2081 { 2127 {
2082 exclude = exclude->head; 2128 exclude = exclude->head;
2083 move_type = exclude->move_type; 2129 move_type = exclude->move_type;
2084 } 2130 }
2085 else 2131 else
2108 max = maxfree[i]; 2154 max = maxfree[i];
2109 else if (mflags & P_IS_ALIVE) 2155 else if (mflags & P_IS_ALIVE)
2110 { 2156 {
2111 for (tmp = ms.bot; tmp; tmp = tmp->above) 2157 for (tmp = ms.bot; tmp; tmp = tmp->above)
2112 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2158 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2113 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2159 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2114 break; 2160 break;
2115 2161
2116 if (tmp) 2162 if (tmp)
2117 return freedir[i]; 2163 return freedir[i];
2118 } 2164 }
2313 * create clone from object to another 2359 * create clone from object to another
2314 */ 2360 */
2315object * 2361object *
2316object_create_clone (object *asrc) 2362object_create_clone (object *asrc)
2317{ 2363{
2318 object *dst = 0, *tmp, *src, *part, *prev, *item; 2364 object *dst = 0, *tmp, *src, *prev, *item;
2319 2365
2320 if (!asrc) 2366 if (!asrc)
2321 return 0; 2367 return 0;
2322 2368
2323 src = asrc;
2324 if (src->head)
2325 src = src->head; 2369 src = asrc->head_ ();
2326 2370
2327 prev = 0; 2371 prev = 0;
2328 for (part = src; part; part = part->more) 2372 for (object *part = src; part; part = part->more)
2329 { 2373 {
2330 tmp = part->clone (); 2374 tmp = part->clone ();
2331 tmp->x -= src->x; 2375 tmp->x -= src->x;
2332 tmp->y -= src->y; 2376 tmp->y -= src->y;
2333 2377
2413 if (link->key == canonical_key) 2457 if (link->key == canonical_key)
2414 return link->value; 2458 return link->value;
2415 2459
2416 return 0; 2460 return 0;
2417} 2461}
2418
2419 2462
2420/* 2463/*
2421 * Updates the canonical_key in op to value. 2464 * Updates the canonical_key in op to value.
2422 * 2465 *
2423 * canonical_key is a shared string (value doesn't have to be). 2466 * canonical_key is a shared string (value doesn't have to be).
2447 /* Basically, if the archetype has this key set, 2490 /* Basically, if the archetype has this key set,
2448 * we need to store the null value so when we save 2491 * we need to store the null value so when we save
2449 * it, we save the empty value so that when we load, 2492 * it, we save the empty value so that when we load,
2450 * we get this value back again. 2493 * we get this value back again.
2451 */ 2494 */
2452 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2495 if (get_ob_key_link (op->arch, canonical_key))
2453 field->value = 0; 2496 field->value = 0;
2454 else 2497 else
2455 { 2498 {
2456 if (last) 2499 if (last)
2457 last->next = field->next; 2500 last->next = field->next;
2582} 2625}
2583 2626
2584const char * 2627const char *
2585object::debug_desc () const 2628object::debug_desc () const
2586{ 2629{
2587 static char info[256 * 4]; 2630 static char info[3][256 * 4];
2631 static int info_idx;
2632
2588 return debug_desc (info); 2633 return debug_desc (info [++info_idx % 3]);
2589}
2590
2591const char *
2592object::debug_desc2 () const
2593{
2594 static char info[256 * 4];
2595 return debug_desc (info);
2596} 2634}
2597 2635
2598struct region * 2636struct region *
2599object::region () const 2637object::region () const
2600{ 2638{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines