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.134 by pippijn, Thu Mar 1 12:28:16 2007 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 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
455bool
456object::change_weapon (object *ob)
457{
458 if (current_weapon == ob)
459 return true;
460
461 if (chosen_skill)
462 chosen_skill->flag [FLAG_APPLIED] = false;
463
464 current_weapon = ob;
465 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
466
467 if (chosen_skill)
468 chosen_skill->flag [FLAG_APPLIED] = true;
469
470 update_stats ();
471
472 if (ob)
473 {
474 // now check wether any body locations became invalid, in which case
475 // we cannot apply the weapon at the moment.
476 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
477 if (slot[i].used < 0)
478 {
479 current_weapon = chosen_skill = 0;
480 update_stats ();
481
482 new_draw_info_format (NDI_UNIQUE, 0, this,
483 "You try to balance your applied items all at once, but the %s is too much. "
484 "You need to unapply some items first.", &ob->name);
485 return false;
486 }
487
488 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
489 }
490 else
491 new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
492
493 return true;
494}
495
453/* Zero the key_values on op, decrementing the shared-string 496/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 497 * refcounts and freeing the links.
455 */ 498 */
456static void 499static void
457free_key_values (object *op) 500free_key_values (object *op)
458{ 501{
459 for (key_value *i = op->key_values; i != 0;) 502 for (key_value *i = op->key_values; i; )
460 { 503 {
461 key_value *next = i->next; 504 key_value *next = i->next;
462 delete i; 505 delete i;
463 506
464 i = next; 507 i = next;
465 } 508 }
466 509
467 op->key_values = 0; 510 op->key_values = 0;
468} 511}
469 512
470/* 513object &
471 * copy_to first frees everything allocated by the dst object, 514object::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{ 515{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 516 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 517 bool is_removed = flag [FLAG_REMOVED];
483 518
484 *(object_copy *)dst = *this; 519 *(object_copy *)this = src;
485 520
486 if (is_freed) 521 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 522 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 523
495 /* Copy over key_values, if any. */ 524 /* Copy over key_values, if any. */
496 if (key_values) 525 if (src.key_values)
497 { 526 {
498 key_value *tail = 0; 527 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 528 key_values = 0;
502 529
503 for (i = key_values; i; i = i->next) 530 for (key_value *i = src.key_values; i; i = i->next)
504 { 531 {
505 key_value *new_link = new key_value; 532 key_value *new_link = new key_value;
506 533
507 new_link->next = 0; 534 new_link->next = 0;
508 new_link->key = i->key; 535 new_link->key = i->key;
509 new_link->value = i->value; 536 new_link->value = i->value;
510 537
511 /* Try and be clever here, too. */ 538 /* Try and be clever here, too. */
512 if (!dst->key_values) 539 if (!key_values)
513 { 540 {
514 dst->key_values = new_link; 541 key_values = new_link;
515 tail = new_link; 542 tail = new_link;
516 } 543 }
517 else 544 else
518 { 545 {
519 tail->next = new_link; 546 tail->next = new_link;
520 tail = new_link; 547 tail = new_link;
521 } 548 }
522 } 549 }
523 } 550 }
551}
552
553/*
554 * copy_to first frees everything allocated by the dst object,
555 * and then copies the contents of itself into the second
556 * object, allocating what needs to be allocated. Basically, any
557 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
558 * if the first object is freed, the pointers in the new object
559 * will point at garbage.
560 */
561void
562object::copy_to (object *dst)
563{
564 *dst = *this;
565
566 if (speed < 0)
567 dst->speed_left = speed_left - rndm ();
524 568
525 dst->set_speed (dst->speed); 569 dst->set_speed (dst->speed);
526} 570}
527 571
528void 572void
536 * need for monsters, but doesn't hurt to do it for everything. 580 * 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 581 * by doing so, when a monster is created, it has good starting
538 * values for the body_used info, so when items are created 582 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped. 583 * for it, they can be properly equipped.
540 */ 584 */
541 memcpy (body_used, body_info, sizeof (body_used)); 585 for (int i = NUM_BODY_LOCATIONS; i--; )
586 slot[i].used = slot[i].info;
542 587
543 attachable::instantiate (); 588 attachable::instantiate ();
544} 589}
545 590
546object * 591object *
834 879
835 if (flag [FLAG_IS_LINKED]) 880 if (flag [FLAG_IS_LINKED])
836 remove_button_link (this); 881 remove_button_link (this);
837 882
838 if (flag [FLAG_FRIENDLY]) 883 if (flag [FLAG_FRIENDLY])
839 {
840 remove_friendly_object (this); 884 remove_friendly_object (this);
841
842 if (type == GOLEM
843 && owner
844 && owner->type == PLAYER
845 && owner->contr->ranges[range_golem] == this)
846 owner->contr->ranges[range_golem] = 0;
847 }
848 885
849 if (!flag [FLAG_REMOVED]) 886 if (!flag [FLAG_REMOVED])
850 remove (); 887 remove ();
851 888
852 destroy_inv (true); 889 destroy_inv (true);
1109 return top; 1146 return top;
1110 } 1147 }
1111 } 1148 }
1112 1149
1113 return 0; 1150 return 0;
1151}
1152
1153void
1154object::expand_tail ()
1155{
1156 if (more)
1157 return;
1158
1159 object *prev = this;
1160
1161 for (archetype *at = arch->more; at; at = at->more)
1162 {
1163 object *op = arch_to_object (at);
1164
1165 op->name = name;
1166 op->name_pl = name_pl;
1167 op->title = title;
1168
1169 op->head = this;
1170 prev->more = op;
1171
1172 prev = op;
1173 }
1114} 1174}
1115 1175
1116/* 1176/*
1117 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1177 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1118 * job preparing multi-part monsters. 1178 * job preparing multi-part monsters.
1150 * just 'op' otherwise 1210 * just 'op' otherwise
1151 */ 1211 */
1152object * 1212object *
1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1213insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1154{ 1214{
1215 assert (!op->flag [FLAG_FREED]);
1216
1155 object *tmp, *top, *floor = NULL; 1217 object *tmp, *top, *floor = NULL;
1156 1218
1157 if (QUERY_FLAG (op, FLAG_FREED))
1158 {
1159 LOG (llevError, "Trying to insert freed object!\n");
1160 return NULL;
1161 }
1162
1163 if (!QUERY_FLAG (op, FLAG_REMOVED))
1164 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1165
1166 op->remove (); 1219 op->remove ();
1167 1220
1168 if (!m) 1221#if 0
1169 { 1222 if (!m->active != !op->active)
1170 char *dump = dump_object (op); 1223 if (m->active)
1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1224 op->activate_recursive ();
1172 free (dump); 1225 else
1173 return op; 1226 op->deactivate_recursive ();
1174 } 1227#endif
1175 1228
1176 if (out_of_map (m, op->x, op->y)) 1229 if (out_of_map (m, op->x, op->y))
1177 { 1230 {
1178 char *dump = dump_object (op);
1179 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1231 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1180#ifdef MANY_CORES 1232#ifdef MANY_CORES
1181 /* Better to catch this here, as otherwise the next use of this object 1233 /* Better to catch this here, as otherwise the next use of this object
1182 * is likely to cause a crash. Better to find out where it is getting 1234 * is likely to cause a crash. Better to find out where it is getting
1183 * improperly inserted. 1235 * improperly inserted.
1184 */ 1236 */
1185 abort (); 1237 abort ();
1186#endif 1238#endif
1187 free (dump);
1188 return op; 1239 return op;
1189 } 1240 }
1190 1241
1191 if (object *more = op->more) 1242 if (object *more = op->more)
1192 { 1243 {
1289 * looks like instead of lots of conditions here. 1340 * looks like instead of lots of conditions here.
1290 * makes things faster, and effectively the same result. 1341 * makes things faster, and effectively the same result.
1291 */ 1342 */
1292 1343
1293 /* Have object 'fall below' other objects that block view. 1344 /* Have object 'fall below' other objects that block view.
1294 * Unless those objects are exits, type 66 1345 * Unless those objects are exits.
1295 * If INS_ON_TOP is used, don't do this processing 1346 * If INS_ON_TOP is used, don't do this processing
1296 * Need to find the object that in fact blocks view, otherwise 1347 * Need to find the object that in fact blocks view, otherwise
1297 * stacking is a bit odd. 1348 * stacking is a bit odd.
1298 */ 1349 */
1299 if (!(flag & INS_ON_TOP) 1350 if (!(flag & INS_ON_TOP)
1300 && ms.flags () & P_BLOCKSVIEW 1351 && ms.flags () & P_BLOCKSVIEW
1301 && (op->face && !op->face->visibility)) 1352 && (op->face && !faces [op->face].visibility))
1302 { 1353 {
1303 for (last = top; last != floor; last = last->below) 1354 for (last = top; last != floor; last = last->below)
1304 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1355 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1305 break; 1356 break;
1306 1357
1429 tmp1->x = op->x; 1480 tmp1->x = op->x;
1430 tmp1->y = op->y; 1481 tmp1->y = op->y;
1431 insert_ob_in_map (tmp1, op->map, op, 0); 1482 insert_ob_in_map (tmp1, op->map, op, 0);
1432} 1483}
1433 1484
1434// XXX: function not returning object*
1435object * 1485object *
1436object::insert_at (object *where, object *originator, int flags) 1486object::insert_at (object *where, object *originator, int flags)
1437{ 1487{
1438 where->map->insert (this, where->x, where->y, originator, flags); 1488 return where->map->insert (this, where->x, where->y, originator, flags);
1439} 1489}
1440 1490
1441/* 1491/*
1442 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1492 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1443 * is returned contains nr objects, and the remaining parts contains 1493 * is returned contains nr objects, and the remaining parts contains
1483 * the amount of an object. If the amount reaches 0, the object 1533 * the amount of an object. If the amount reaches 0, the object
1484 * is subsequently removed and freed. 1534 * is subsequently removed and freed.
1485 * 1535 *
1486 * Return value: 'op' if something is left, NULL if the amount reached 0 1536 * Return value: 'op' if something is left, NULL if the amount reached 0
1487 */ 1537 */
1488
1489object * 1538object *
1490decrease_ob_nr (object *op, uint32 i) 1539decrease_ob_nr (object *op, uint32 i)
1491{ 1540{
1492 object *tmp; 1541 object *tmp;
1493 1542
1568 1617
1569/* 1618/*
1570 * add_weight(object, weight) adds the specified weight to an object, 1619 * add_weight(object, weight) adds the specified weight to an object,
1571 * and also updates how much the environment(s) is/are carrying. 1620 * and also updates how much the environment(s) is/are carrying.
1572 */ 1621 */
1573
1574void 1622void
1575add_weight (object *op, signed long weight) 1623add_weight (object *op, signed long weight)
1576{ 1624{
1577 while (op != NULL) 1625 while (op != NULL)
1578 { 1626 {
1610 * inside the object environment. 1658 * inside the object environment.
1611 * 1659 *
1612 * The function returns now pointer to inserted item, and return value can 1660 * The function returns now pointer to inserted item, and return value can
1613 * be != op, if items are merged. -Tero 1661 * be != op, if items are merged. -Tero
1614 */ 1662 */
1615
1616object * 1663object *
1617object::insert (object *op) 1664object::insert (object *op)
1618{ 1665{
1619 object *tmp, *otmp; 1666 object *tmp, *otmp;
1620 1667
2413 return link->value; 2460 return link->value;
2414 2461
2415 return 0; 2462 return 0;
2416} 2463}
2417 2464
2418
2419/* 2465/*
2420 * Updates the canonical_key in op to value. 2466 * Updates the canonical_key in op to value.
2421 * 2467 *
2422 * canonical_key is a shared string (value doesn't have to be). 2468 * canonical_key is a shared string (value doesn't have to be).
2423 * 2469 *
2581} 2627}
2582 2628
2583const char * 2629const char *
2584object::debug_desc () const 2630object::debug_desc () const
2585{ 2631{
2586 static char info[256 * 4]; 2632 static char info[3][256 * 4];
2633 static int info_idx;
2634
2587 return debug_desc (info); 2635 return debug_desc (info [++info_idx % 3]);
2588}
2589
2590const char *
2591object::debug_desc2 () const
2592{
2593 static char info[256 * 4];
2594 return debug_desc (info);
2595} 2636}
2596 2637
2597struct region * 2638struct region *
2598object::region () const 2639object::region () const
2599{ 2640{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines