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.151 by root, Wed May 16 11:10:01 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
7 * 7 *
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 your applied items all at once, but the %s is too much. "
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
453/* Zero the key_values on op, decrementing the shared-string 520/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 521 * refcounts and freeing the links.
455 */ 522 */
456static void 523static void
457free_key_values (object *op) 524free_key_values (object *op)
458{ 525{
459 for (key_value *i = op->key_values; i != 0;) 526 for (key_value *i = op->key_values; i; )
460 { 527 {
461 key_value *next = i->next; 528 key_value *next = i->next;
462 delete i; 529 delete i;
463 530
464 i = next; 531 i = next;
465 } 532 }
466 533
467 op->key_values = 0; 534 op->key_values = 0;
468} 535}
469 536
470/* 537object &
471 * copy_to first frees everything allocated by the dst object, 538object::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{ 539{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 540 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 541 bool is_removed = flag [FLAG_REMOVED];
483 542
484 *(object_copy *)dst = *this; 543 *(object_copy *)this = src;
485 544
486 if (is_freed) 545 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 546 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 547
495 /* Copy over key_values, if any. */ 548 /* Copy over key_values, if any. */
496 if (key_values) 549 if (src.key_values)
497 { 550 {
498 key_value *tail = 0; 551 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 552 key_values = 0;
502 553
503 for (i = key_values; i; i = i->next) 554 for (key_value *i = src.key_values; i; i = i->next)
504 { 555 {
505 key_value *new_link = new key_value; 556 key_value *new_link = new key_value;
506 557
507 new_link->next = 0; 558 new_link->next = 0;
508 new_link->key = i->key; 559 new_link->key = i->key;
509 new_link->value = i->value; 560 new_link->value = i->value;
510 561
511 /* Try and be clever here, too. */ 562 /* Try and be clever here, too. */
512 if (!dst->key_values) 563 if (!key_values)
513 { 564 {
514 dst->key_values = new_link; 565 key_values = new_link;
515 tail = new_link; 566 tail = new_link;
516 } 567 }
517 else 568 else
518 { 569 {
519 tail->next = new_link; 570 tail->next = new_link;
520 tail = new_link; 571 tail = new_link;
521 } 572 }
522 } 573 }
523 } 574 }
575}
576
577/*
578 * copy_to first frees everything allocated by the dst object,
579 * and then copies the contents of itself into the second
580 * object, allocating what needs to be allocated. Basically, any
581 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
582 * if the first object is freed, the pointers in the new object
583 * will point at garbage.
584 */
585void
586object::copy_to (object *dst)
587{
588 *dst = *this;
589
590 if (speed < 0)
591 dst->speed_left = speed_left - rndm ();
524 592
525 dst->set_speed (dst->speed); 593 dst->set_speed (dst->speed);
526} 594}
527 595
528void 596void
536 * 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.
537 * 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
538 * values for the body_used info, so when items are created 606 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped. 607 * for it, they can be properly equipped.
540 */ 608 */
541 memcpy (body_used, body_info, sizeof (body_used)); 609 for (int i = NUM_BODY_LOCATIONS; i--; )
610 slot[i].used = slot[i].info;
542 611
543 attachable::instantiate (); 612 attachable::instantiate ();
544} 613}
545 614
546object * 615object *
606 * UP_OBJ_FACE: only the objects face has changed. 675 * UP_OBJ_FACE: only the objects face has changed.
607 */ 676 */
608void 677void
609update_object (object *op, int action) 678update_object (object *op, int action)
610{ 679{
611 MoveType move_on, move_off, move_block, move_slow;
612
613 if (op == NULL) 680 if (op == NULL)
614 { 681 {
615 /* this should never happen */ 682 /* this should never happen */
616 LOG (llevDebug, "update_object() called for NULL object.\n"); 683 LOG (llevDebug, "update_object() called for NULL object.\n");
617 return; 684 return;
836 903
837 if (flag [FLAG_IS_LINKED]) 904 if (flag [FLAG_IS_LINKED])
838 remove_button_link (this); 905 remove_button_link (this);
839 906
840 if (flag [FLAG_FRIENDLY]) 907 if (flag [FLAG_FRIENDLY])
841 {
842 remove_friendly_object (this); 908 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 909
851 if (!flag [FLAG_REMOVED]) 910 if (!flag [FLAG_REMOVED])
852 remove (); 911 remove ();
853 912
854 destroy_inv (true); 913 destroy_inv (true);
1111 return top; 1170 return top;
1112 } 1171 }
1113 } 1172 }
1114 1173
1115 return 0; 1174 return 0;
1175}
1176
1177void
1178object::expand_tail ()
1179{
1180 if (more)
1181 return;
1182
1183 object *prev = this;
1184
1185 for (archetype *at = arch->more; at; at = at->more)
1186 {
1187 object *op = arch_to_object (at);
1188
1189 op->name = name;
1190 op->name_pl = name_pl;
1191 op->title = title;
1192
1193 op->head = this;
1194 prev->more = op;
1195
1196 prev = op;
1197 }
1116} 1198}
1117 1199
1118/* 1200/*
1119 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1201 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1120 * job preparing multi-part monsters. 1202 * job preparing multi-part monsters.
1152 * just 'op' otherwise 1234 * just 'op' otherwise
1153 */ 1235 */
1154object * 1236object *
1155insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1237insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1156{ 1238{
1239 assert (!op->flag [FLAG_FREED]);
1240
1157 object *tmp, *top, *floor = NULL; 1241 object *tmp, *top, *floor = NULL;
1158 1242
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
1168 op->remove (); 1243 op->remove ();
1169 1244
1170 if (!m) 1245#if 0
1171 { 1246 if (!m->active != !op->active)
1172 char *dump = dump_object (op); 1247 if (m->active)
1173 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1248 op->activate_recursive ();
1174 free (dump); 1249 else
1175 return op; 1250 op->deactivate_recursive ();
1176 } 1251#endif
1177 1252
1178 if (out_of_map (m, op->x, op->y)) 1253 if (out_of_map (m, op->x, op->y))
1179 { 1254 {
1180 char *dump = dump_object (op);
1181 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1255 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1182#ifdef MANY_CORES 1256#ifdef MANY_CORES
1183 /* Better to catch this here, as otherwise the next use of this object 1257 /* 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 1258 * is likely to cause a crash. Better to find out where it is getting
1185 * improperly inserted. 1259 * improperly inserted.
1186 */ 1260 */
1187 abort (); 1261 abort ();
1188#endif 1262#endif
1189 free (dump);
1190 return op; 1263 return op;
1191 } 1264 }
1192 1265
1193 if (object *more = op->more) 1266 if (object *more = op->more)
1194 { 1267 {
1291 * looks like instead of lots of conditions here. 1364 * looks like instead of lots of conditions here.
1292 * makes things faster, and effectively the same result. 1365 * makes things faster, and effectively the same result.
1293 */ 1366 */
1294 1367
1295 /* Have object 'fall below' other objects that block view. 1368 /* Have object 'fall below' other objects that block view.
1296 * Unless those objects are exits, type 66 1369 * Unless those objects are exits.
1297 * If INS_ON_TOP is used, don't do this processing 1370 * If INS_ON_TOP is used, don't do this processing
1298 * Need to find the object that in fact blocks view, otherwise 1371 * Need to find the object that in fact blocks view, otherwise
1299 * stacking is a bit odd. 1372 * stacking is a bit odd.
1300 */ 1373 */
1301 if (!(flag & INS_ON_TOP) 1374 if (!(flag & INS_ON_TOP)
1302 && ms.flags () & P_BLOCKSVIEW 1375 && ms.flags () & P_BLOCKSVIEW
1303 && (op->face && !op->face->visibility)) 1376 && (op->face && !faces [op->face].visibility))
1304 { 1377 {
1305 for (last = top; last != floor; last = last->below) 1378 for (last = top; last != floor; last = last->below)
1306 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1379 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1307 break; 1380 break;
1308 1381
1434} 1507}
1435 1508
1436object * 1509object *
1437object::insert_at (object *where, object *originator, int flags) 1510object::insert_at (object *where, object *originator, int flags)
1438{ 1511{
1439 where->map->insert (this, where->x, where->y, originator, flags); 1512 return where->map->insert (this, where->x, where->y, originator, flags);
1440} 1513}
1441 1514
1442/* 1515/*
1443 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1516 * 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 1517 * is returned contains nr objects, and the remaining parts contains
1484 * the amount of an object. If the amount reaches 0, the object 1557 * the amount of an object. If the amount reaches 0, the object
1485 * is subsequently removed and freed. 1558 * is subsequently removed and freed.
1486 * 1559 *
1487 * Return value: 'op' if something is left, NULL if the amount reached 0 1560 * Return value: 'op' if something is left, NULL if the amount reached 0
1488 */ 1561 */
1489
1490object * 1562object *
1491decrease_ob_nr (object *op, uint32 i) 1563decrease_ob_nr (object *op, uint32 i)
1492{ 1564{
1493 object *tmp; 1565 object *tmp;
1494 1566
1569 1641
1570/* 1642/*
1571 * add_weight(object, weight) adds the specified weight to an object, 1643 * add_weight(object, weight) adds the specified weight to an object,
1572 * and also updates how much the environment(s) is/are carrying. 1644 * and also updates how much the environment(s) is/are carrying.
1573 */ 1645 */
1574
1575void 1646void
1576add_weight (object *op, signed long weight) 1647add_weight (object *op, signed long weight)
1577{ 1648{
1578 while (op != NULL) 1649 while (op != NULL)
1579 { 1650 {
1611 * inside the object environment. 1682 * inside the object environment.
1612 * 1683 *
1613 * The function returns now pointer to inserted item, and return value can 1684 * The function returns now pointer to inserted item, and return value can
1614 * be != op, if items are merged. -Tero 1685 * be != op, if items are merged. -Tero
1615 */ 1686 */
1616
1617object * 1687object *
1618object::insert (object *op) 1688object::insert (object *op)
1619{ 1689{
1620 object *tmp, *otmp; 1690 object *tmp, *otmp;
1621 1691
2414 return link->value; 2484 return link->value;
2415 2485
2416 return 0; 2486 return 0;
2417} 2487}
2418 2488
2419
2420/* 2489/*
2421 * Updates the canonical_key in op to value. 2490 * Updates the canonical_key in op to value.
2422 * 2491 *
2423 * canonical_key is a shared string (value doesn't have to be). 2492 * canonical_key is a shared string (value doesn't have to be).
2424 * 2493 *
2582} 2651}
2583 2652
2584const char * 2653const char *
2585object::debug_desc () const 2654object::debug_desc () const
2586{ 2655{
2587 static char info[256 * 4]; 2656 static char info[3][256 * 4];
2657 static int info_idx;
2658
2588 return debug_desc (info); 2659 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} 2660}
2597 2661
2598struct region * 2662struct region *
2599object::region () const 2663object::region () const
2600{ 2664{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines