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.135 by root, Sun Mar 11 02:12:44 2007 UTC vs.
Revision 1.155 by root, Thu May 17 21:32:08 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 *
834 903
835 if (flag [FLAG_IS_LINKED]) 904 if (flag [FLAG_IS_LINKED])
836 remove_button_link (this); 905 remove_button_link (this);
837 906
838 if (flag [FLAG_FRIENDLY]) 907 if (flag [FLAG_FRIENDLY])
839 {
840 remove_friendly_object (this); 908 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 909
849 if (!flag [FLAG_REMOVED]) 910 if (!flag [FLAG_REMOVED])
850 remove (); 911 remove ();
851 912
852 destroy_inv (true); 913 destroy_inv (true);
1109 return top; 1170 return top;
1110 } 1171 }
1111 } 1172 }
1112 1173
1113 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 }
1114} 1198}
1115 1199
1116/* 1200/*
1117 * 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
1118 * job preparing multi-part monsters. 1202 * job preparing multi-part monsters.
1150 * just 'op' otherwise 1234 * just 'op' otherwise
1151 */ 1235 */
1152object * 1236object *
1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1237insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1154{ 1238{
1239 assert (!op->flag [FLAG_FREED]);
1240
1155 object *tmp, *top, *floor = NULL; 1241 object *top, *floor = NULL;
1156
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 1242
1166 op->remove (); 1243 op->remove ();
1167 1244
1168 if (!m) 1245#if 0
1169 { 1246 if (!m->active != !op->active)
1170 char *dump = dump_object (op); 1247 if (m->active)
1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1248 op->activate_recursive ();
1172 free (dump); 1249 else
1173 return op; 1250 op->deactivate_recursive ();
1174 } 1251#endif
1175 1252
1176 if (out_of_map (m, op->x, op->y)) 1253 if (out_of_map (m, op->x, op->y))
1177 { 1254 {
1178 char *dump = dump_object (op);
1179 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 ());
1180#ifdef MANY_CORES 1256#ifdef MANY_CORES
1181 /* 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
1182 * 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
1183 * improperly inserted. 1259 * improperly inserted.
1184 */ 1260 */
1185 abort (); 1261 abort ();
1186#endif 1262#endif
1187 free (dump);
1188 return op; 1263 return op;
1189 } 1264 }
1190 1265
1191 if (object *more = op->more) 1266 if (object *more = op->more)
1192 {
1193 if (!insert_ob_in_map (more, m, originator, flag)) 1267 if (!insert_ob_in_map (more, m, originator, flag))
1194 {
1195 if (!op->head)
1196 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1197
1198 return 0; 1268 return 0;
1199 }
1200 }
1201 1269
1202 CLEAR_FLAG (op, FLAG_REMOVED); 1270 CLEAR_FLAG (op, FLAG_REMOVED);
1203 1271
1204 /* Ideally, the caller figures this out. However, it complicates a lot 1272 /* Ideally, the caller figures this out. However, it complicates a lot
1205 * of areas of callers (eg, anything that uses find_free_spot would now 1273 * of areas of callers (eg, anything that uses find_free_spot would now
1212 mapspace &ms = op->ms (); 1280 mapspace &ms = op->ms ();
1213 1281
1214 /* this has to be done after we translate the coordinates. 1282 /* this has to be done after we translate the coordinates.
1215 */ 1283 */
1216 if (op->nrof && !(flag & INS_NO_MERGE)) 1284 if (op->nrof && !(flag & INS_NO_MERGE))
1217 for (tmp = ms.bot; tmp; tmp = tmp->above) 1285 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1218 if (object::can_merge (op, tmp)) 1286 if (object::can_merge (op, tmp))
1219 { 1287 {
1220 op->nrof += tmp->nrof; 1288 op->nrof += tmp->nrof;
1221 tmp->destroy (); 1289 tmp->destroy ();
1222 } 1290 }
1391 * blocked() and wall() work properly), and these flags are updated by 1459 * blocked() and wall() work properly), and these flags are updated by
1392 * update_object(). 1460 * update_object().
1393 */ 1461 */
1394 1462
1395 /* if this is not the head or flag has been passed, don't check walk on status */ 1463 /* if this is not the head or flag has been passed, don't check walk on status */
1396 if (!(flag & INS_NO_WALK_ON) && !op->head) 1464 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1397 { 1465 {
1398 if (check_move_on (op, originator)) 1466 if (check_move_on (op, originator))
1399 return 0; 1467 return 0;
1400 1468
1401 /* If we are a multi part object, lets work our way through the check 1469 /* If we are a multi part object, lets work our way through the check
1402 * walk on's. 1470 * walk on's.
1403 */ 1471 */
1404 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1472 for (object *tmp = op->more; tmp; tmp = tmp->more)
1405 if (check_move_on (tmp, originator)) 1473 if (check_move_on (tmp, originator))
1406 return 0; 1474 return 0;
1407 } 1475 }
1408 1476
1409 return op; 1477 return op;
1429 tmp1->x = op->x; 1497 tmp1->x = op->x;
1430 tmp1->y = op->y; 1498 tmp1->y = op->y;
1431 insert_ob_in_map (tmp1, op->map, op, 0); 1499 insert_ob_in_map (tmp1, op->map, op, 0);
1432} 1500}
1433 1501
1434// XXX: function not returning object*
1435object * 1502object *
1436object::insert_at (object *where, object *originator, int flags) 1503object::insert_at (object *where, object *originator, int flags)
1437{ 1504{
1438 where->map->insert (this, where->x, where->y, originator, flags); 1505 return where->map->insert (this, where->x, where->y, originator, flags);
1439} 1506}
1440 1507
1441/* 1508/*
1442 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1509 * 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 1510 * is returned contains nr objects, and the remaining parts contains
1483 * the amount of an object. If the amount reaches 0, the object 1550 * the amount of an object. If the amount reaches 0, the object
1484 * is subsequently removed and freed. 1551 * is subsequently removed and freed.
1485 * 1552 *
1486 * Return value: 'op' if something is left, NULL if the amount reached 0 1553 * Return value: 'op' if something is left, NULL if the amount reached 0
1487 */ 1554 */
1488
1489object * 1555object *
1490decrease_ob_nr (object *op, uint32 i) 1556decrease_ob_nr (object *op, uint32 i)
1491{ 1557{
1492 object *tmp; 1558 object *tmp;
1493 1559
1568 1634
1569/* 1635/*
1570 * add_weight(object, weight) adds the specified weight to an object, 1636 * add_weight(object, weight) adds the specified weight to an object,
1571 * and also updates how much the environment(s) is/are carrying. 1637 * and also updates how much the environment(s) is/are carrying.
1572 */ 1638 */
1573
1574void 1639void
1575add_weight (object *op, signed long weight) 1640add_weight (object *op, signed long weight)
1576{ 1641{
1577 while (op != NULL) 1642 while (op != NULL)
1578 { 1643 {
1593 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1658 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1594 free (dump); 1659 free (dump);
1595 return op; 1660 return op;
1596 } 1661 }
1597 1662
1598 if (where->head) 1663 if (where->head_ () != where)
1599 { 1664 {
1600 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1665 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1601 where = where->head; 1666 where = where->head;
1602 } 1667 }
1603 1668
1604 return where->insert (op); 1669 return where->insert (op);
1605} 1670}
1610 * inside the object environment. 1675 * inside the object environment.
1611 * 1676 *
1612 * The function returns now pointer to inserted item, and return value can 1677 * The function returns now pointer to inserted item, and return value can
1613 * be != op, if items are merged. -Tero 1678 * be != op, if items are merged. -Tero
1614 */ 1679 */
1615
1616object * 1680object *
1617object::insert (object *op) 1681object::insert (object *op)
1618{ 1682{
1619 object *tmp, *otmp; 1683 object *tmp, *otmp;
1620 1684
1934 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1998 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1935 { 1999 {
1936 CLEAR_FLAG (tmp, flag); 2000 CLEAR_FLAG (tmp, flag);
1937 unflag_inv (tmp, flag); 2001 unflag_inv (tmp, flag);
1938 } 2002 }
1939}
1940
1941/*
1942 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1943 * all it's inventory (recursively).
1944 * If checksums are used, a player will get set_cheat called for
1945 * him/her-self and all object carried by a call to this function.
1946 */
1947void
1948set_cheat (object *op)
1949{
1950 SET_FLAG (op, FLAG_WAS_WIZ);
1951 flag_inv (op, FLAG_WAS_WIZ);
1952} 2003}
1953 2004
1954/* 2005/*
1955 * find_free_spot(object, map, x, y, start, stop) will search for 2006 * find_free_spot(object, map, x, y, start, stop) will search for
1956 * a spot at the given map and coordinates which will be able to contain 2007 * a spot at the given map and coordinates which will be able to contain
2074 object *tmp; 2125 object *tmp;
2075 maptile *mp; 2126 maptile *mp;
2076 2127
2077 MoveType blocked, move_type; 2128 MoveType blocked, move_type;
2078 2129
2079 if (exclude && exclude->head) 2130 if (exclude && exclude->head_ () != exclude)
2080 { 2131 {
2081 exclude = exclude->head; 2132 exclude = exclude->head;
2082 move_type = exclude->move_type; 2133 move_type = exclude->move_type;
2083 } 2134 }
2084 else 2135 else
2107 max = maxfree[i]; 2158 max = maxfree[i];
2108 else if (mflags & P_IS_ALIVE) 2159 else if (mflags & P_IS_ALIVE)
2109 { 2160 {
2110 for (tmp = ms.bot; tmp; tmp = tmp->above) 2161 for (tmp = ms.bot; tmp; tmp = tmp->above)
2111 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2162 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2112 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2163 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2113 break; 2164 break;
2114 2165
2115 if (tmp) 2166 if (tmp)
2116 return freedir[i]; 2167 return freedir[i];
2117 } 2168 }
2312 * create clone from object to another 2363 * create clone from object to another
2313 */ 2364 */
2314object * 2365object *
2315object_create_clone (object *asrc) 2366object_create_clone (object *asrc)
2316{ 2367{
2317 object *dst = 0, *tmp, *src, *part, *prev, *item; 2368 object *dst = 0, *tmp, *src, *prev, *item;
2318 2369
2319 if (!asrc) 2370 if (!asrc)
2320 return 0; 2371 return 0;
2321 2372
2322 src = asrc;
2323 if (src->head)
2324 src = src->head; 2373 src = asrc->head_ ();
2325 2374
2326 prev = 0; 2375 prev = 0;
2327 for (part = src; part; part = part->more) 2376 for (object *part = src; part; part = part->more)
2328 { 2377 {
2329 tmp = part->clone (); 2378 tmp = part->clone ();
2330 tmp->x -= src->x; 2379 tmp->x -= src->x;
2331 tmp->y -= src->y; 2380 tmp->y -= src->y;
2332 2381
2412 if (link->key == canonical_key) 2461 if (link->key == canonical_key)
2413 return link->value; 2462 return link->value;
2414 2463
2415 return 0; 2464 return 0;
2416} 2465}
2417
2418 2466
2419/* 2467/*
2420 * Updates the canonical_key in op to value. 2468 * Updates the canonical_key in op to value.
2421 * 2469 *
2422 * canonical_key is a shared string (value doesn't have to be). 2470 * canonical_key is a shared string (value doesn't have to be).
2581} 2629}
2582 2630
2583const char * 2631const char *
2584object::debug_desc () const 2632object::debug_desc () const
2585{ 2633{
2586 static char info[256 * 4]; 2634 static char info[3][256 * 4];
2635 static int info_idx;
2636
2587 return debug_desc (info); 2637 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} 2638}
2596 2639
2597struct region * 2640struct region *
2598object::region () const 2641object::region () const
2599{ 2642{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines