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.136 by root, Thu Mar 15 14:23:02 2007 UTC vs.
Revision 1.149 by root, Mon May 14 19:56:45 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 current_weapon = ob;
479 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
480
481 update_stats ();
482
483 if (ob)
484 {
485 // now check wether any body locations became invalid, in which case
486 // we cannot apply the weapon at the moment.
487 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
488 if (slot[i].used < 0)
489 {
490 current_weapon = chosen_skill = 0;
491 update_stats ();
492
493 new_draw_info_format (NDI_UNIQUE, 0, this,
494 "You try to balance your applied items all at once, but the %s is too much. "
495 "You need to unapply some items first.", &ob->name);
496 return false;
497 }
498
499 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
500 }
501 else
502 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
503
504 return true;
505}
506
453/* Zero the key_values on op, decrementing the shared-string 507/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 508 * refcounts and freeing the links.
455 */ 509 */
456static void 510static void
457free_key_values (object *op) 511free_key_values (object *op)
458{ 512{
459 for (key_value *i = op->key_values; i != 0;) 513 for (key_value *i = op->key_values; i; )
460 { 514 {
461 key_value *next = i->next; 515 key_value *next = i->next;
462 delete i; 516 delete i;
463 517
464 i = next; 518 i = next;
465 } 519 }
466 520
467 op->key_values = 0; 521 op->key_values = 0;
468} 522}
469 523
470/* 524object &
471 * copy_to first frees everything allocated by the dst object, 525object::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{ 526{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 527 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 528 bool is_removed = flag [FLAG_REMOVED];
483 529
484 *(object_copy *)dst = *this; 530 *(object_copy *)this = src;
485 531
486 if (is_freed) 532 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 533 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 534
495 /* Copy over key_values, if any. */ 535 /* Copy over key_values, if any. */
496 if (key_values) 536 if (src.key_values)
497 { 537 {
498 key_value *tail = 0; 538 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 539 key_values = 0;
502 540
503 for (i = key_values; i; i = i->next) 541 for (key_value *i = src.key_values; i; i = i->next)
504 { 542 {
505 key_value *new_link = new key_value; 543 key_value *new_link = new key_value;
506 544
507 new_link->next = 0; 545 new_link->next = 0;
508 new_link->key = i->key; 546 new_link->key = i->key;
509 new_link->value = i->value; 547 new_link->value = i->value;
510 548
511 /* Try and be clever here, too. */ 549 /* Try and be clever here, too. */
512 if (!dst->key_values) 550 if (!key_values)
513 { 551 {
514 dst->key_values = new_link; 552 key_values = new_link;
515 tail = new_link; 553 tail = new_link;
516 } 554 }
517 else 555 else
518 { 556 {
519 tail->next = new_link; 557 tail->next = new_link;
520 tail = new_link; 558 tail = new_link;
521 } 559 }
522 } 560 }
523 } 561 }
562}
563
564/*
565 * copy_to first frees everything allocated by the dst object,
566 * and then copies the contents of itself into the second
567 * object, allocating what needs to be allocated. Basically, any
568 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
569 * if the first object is freed, the pointers in the new object
570 * will point at garbage.
571 */
572void
573object::copy_to (object *dst)
574{
575 *dst = *this;
576
577 if (speed < 0)
578 dst->speed_left = speed_left - rndm ();
524 579
525 dst->set_speed (dst->speed); 580 dst->set_speed (dst->speed);
526} 581}
527 582
528void 583void
536 * need for monsters, but doesn't hurt to do it for everything. 591 * 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 592 * by doing so, when a monster is created, it has good starting
538 * values for the body_used info, so when items are created 593 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped. 594 * for it, they can be properly equipped.
540 */ 595 */
541 memcpy (body_used, body_info, sizeof (body_used)); 596 for (int i = NUM_BODY_LOCATIONS; i--; )
597 slot[i].used = slot[i].info;
542 598
543 attachable::instantiate (); 599 attachable::instantiate ();
544} 600}
545 601
546object * 602object *
834 890
835 if (flag [FLAG_IS_LINKED]) 891 if (flag [FLAG_IS_LINKED])
836 remove_button_link (this); 892 remove_button_link (this);
837 893
838 if (flag [FLAG_FRIENDLY]) 894 if (flag [FLAG_FRIENDLY])
839 {
840 remove_friendly_object (this); 895 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 896
849 if (!flag [FLAG_REMOVED]) 897 if (!flag [FLAG_REMOVED])
850 remove (); 898 remove ();
851 899
852 destroy_inv (true); 900 destroy_inv (true);
1109 return top; 1157 return top;
1110 } 1158 }
1111 } 1159 }
1112 1160
1113 return 0; 1161 return 0;
1162}
1163
1164void
1165object::expand_tail ()
1166{
1167 if (more)
1168 return;
1169
1170 object *prev = this;
1171
1172 for (archetype *at = arch->more; at; at = at->more)
1173 {
1174 object *op = arch_to_object (at);
1175
1176 op->name = name;
1177 op->name_pl = name_pl;
1178 op->title = title;
1179
1180 op->head = this;
1181 prev->more = op;
1182
1183 prev = op;
1184 }
1114} 1185}
1115 1186
1116/* 1187/*
1117 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1188 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1118 * job preparing multi-part monsters. 1189 * job preparing multi-part monsters.
1150 * just 'op' otherwise 1221 * just 'op' otherwise
1151 */ 1222 */
1152object * 1223object *
1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1224insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1154{ 1225{
1226 assert (!op->flag [FLAG_FREED]);
1227
1155 object *tmp, *top, *floor = NULL; 1228 object *tmp, *top, *floor = NULL;
1156 1229
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 (); 1230 op->remove ();
1167 1231
1168 if (!m) 1232#if 0
1169 { 1233 if (!m->active != !op->active)
1170 char *dump = dump_object (op); 1234 if (m->active)
1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1235 op->activate_recursive ();
1172 free (dump); 1236 else
1173 return op; 1237 op->deactivate_recursive ();
1174 } 1238#endif
1175 1239
1176 if (out_of_map (m, op->x, op->y)) 1240 if (out_of_map (m, op->x, op->y))
1177 { 1241 {
1178 char *dump = dump_object (op);
1179 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1242 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1180#ifdef MANY_CORES 1243#ifdef MANY_CORES
1181 /* Better to catch this here, as otherwise the next use of this object 1244 /* 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 1245 * is likely to cause a crash. Better to find out where it is getting
1183 * improperly inserted. 1246 * improperly inserted.
1184 */ 1247 */
1185 abort (); 1248 abort ();
1186#endif 1249#endif
1187 free (dump);
1188 return op; 1250 return op;
1189 } 1251 }
1190 1252
1191 if (object *more = op->more) 1253 if (object *more = op->more)
1192 { 1254 {
1429 tmp1->x = op->x; 1491 tmp1->x = op->x;
1430 tmp1->y = op->y; 1492 tmp1->y = op->y;
1431 insert_ob_in_map (tmp1, op->map, op, 0); 1493 insert_ob_in_map (tmp1, op->map, op, 0);
1432} 1494}
1433 1495
1434// XXX: function not returning object*
1435object * 1496object *
1436object::insert_at (object *where, object *originator, int flags) 1497object::insert_at (object *where, object *originator, int flags)
1437{ 1498{
1438 where->map->insert (this, where->x, where->y, originator, flags); 1499 return where->map->insert (this, where->x, where->y, originator, flags);
1439} 1500}
1440 1501
1441/* 1502/*
1442 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1503 * 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 1504 * is returned contains nr objects, and the remaining parts contains
1483 * the amount of an object. If the amount reaches 0, the object 1544 * the amount of an object. If the amount reaches 0, the object
1484 * is subsequently removed and freed. 1545 * is subsequently removed and freed.
1485 * 1546 *
1486 * Return value: 'op' if something is left, NULL if the amount reached 0 1547 * Return value: 'op' if something is left, NULL if the amount reached 0
1487 */ 1548 */
1488
1489object * 1549object *
1490decrease_ob_nr (object *op, uint32 i) 1550decrease_ob_nr (object *op, uint32 i)
1491{ 1551{
1492 object *tmp; 1552 object *tmp;
1493 1553
1568 1628
1569/* 1629/*
1570 * add_weight(object, weight) adds the specified weight to an object, 1630 * add_weight(object, weight) adds the specified weight to an object,
1571 * and also updates how much the environment(s) is/are carrying. 1631 * and also updates how much the environment(s) is/are carrying.
1572 */ 1632 */
1573
1574void 1633void
1575add_weight (object *op, signed long weight) 1634add_weight (object *op, signed long weight)
1576{ 1635{
1577 while (op != NULL) 1636 while (op != NULL)
1578 { 1637 {
1610 * inside the object environment. 1669 * inside the object environment.
1611 * 1670 *
1612 * The function returns now pointer to inserted item, and return value can 1671 * The function returns now pointer to inserted item, and return value can
1613 * be != op, if items are merged. -Tero 1672 * be != op, if items are merged. -Tero
1614 */ 1673 */
1615
1616object * 1674object *
1617object::insert (object *op) 1675object::insert (object *op)
1618{ 1676{
1619 object *tmp, *otmp; 1677 object *tmp, *otmp;
1620 1678
2580} 2638}
2581 2639
2582const char * 2640const char *
2583object::debug_desc () const 2641object::debug_desc () const
2584{ 2642{
2585 static char info[256 * 4]; 2643 static char info[3][256 * 4];
2644 static int info_idx;
2645
2586 return debug_desc (info); 2646 return debug_desc (info [++info_idx % 3]);
2587}
2588
2589const char *
2590object::debug_desc2 () const
2591{
2592 static char info[256 * 4];
2593 return debug_desc (info);
2594} 2647}
2595 2648
2596struct region * 2649struct region *
2597object::region () const 2650object::region () const
2598{ 2651{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines