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.145 by root, Mon May 7 03:05:58 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 *
324sum_weight (object *op) 324sum_weight (object *op)
325{ 325{
326 long sum; 326 long sum;
327 object *inv; 327 object *inv;
328 328
329 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 329 for (sum = 0, inv = op->inv; inv; inv = inv->below)
330 { 330 {
331 if (inv->inv) 331 if (inv->inv)
332 sum_weight (inv); 332 sum_weight (inv);
333
333 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 334 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334 } 335 }
335 336
336 if (op->type == CONTAINER && op->stats.Str) 337 if (op->type == CONTAINER && op->stats.Str)
337 sum = (sum * (100 - op->stats.Str)) / 100; 338 sum = (sum * (100 - op->stats.Str)) / 100;
448 owner = owner->owner; 449 owner = owner->owner;
449 450
450 this->owner = owner; 451 this->owner = owner;
451} 452}
452 453
454void
455object::set_weapon (object *ob)
456{
457 if (current_weapon == ob)
458 return;
459
460 current_weapon = ob;
461 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
462 update_stats ();
463}
464
453/* Zero the key_values on op, decrementing the shared-string 465/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 466 * refcounts and freeing the links.
455 */ 467 */
456static void 468static void
457free_key_values (object *op) 469free_key_values (object *op)
458{ 470{
459 for (key_value *i = op->key_values; i != 0;) 471 for (key_value *i = op->key_values; i; )
460 { 472 {
461 key_value *next = i->next; 473 key_value *next = i->next;
462 delete i; 474 delete i;
463 475
464 i = next; 476 i = next;
465 } 477 }
466 478
467 op->key_values = 0; 479 op->key_values = 0;
468} 480}
469 481
470/* 482object &
471 * copy_to first frees everything allocated by the dst object, 483object::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{ 484{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 485 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 486 bool is_removed = flag [FLAG_REMOVED];
483 487
484 *(object_copy *)dst = *this; 488 *(object_copy *)this = src;
485 489
486 if (is_freed) 490 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 491 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 492
495 /* Copy over key_values, if any. */ 493 /* Copy over key_values, if any. */
496 if (key_values) 494 if (src.key_values)
497 { 495 {
498 key_value *tail = 0; 496 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 497 key_values = 0;
502 498
503 for (i = key_values; i; i = i->next) 499 for (key_value *i = src.key_values; i; i = i->next)
504 { 500 {
505 key_value *new_link = new key_value; 501 key_value *new_link = new key_value;
506 502
507 new_link->next = 0; 503 new_link->next = 0;
508 new_link->key = i->key; 504 new_link->key = i->key;
509 new_link->value = i->value; 505 new_link->value = i->value;
510 506
511 /* Try and be clever here, too. */ 507 /* Try and be clever here, too. */
512 if (!dst->key_values) 508 if (!key_values)
513 { 509 {
514 dst->key_values = new_link; 510 key_values = new_link;
515 tail = new_link; 511 tail = new_link;
516 } 512 }
517 else 513 else
518 { 514 {
519 tail->next = new_link; 515 tail->next = new_link;
520 tail = new_link; 516 tail = new_link;
521 } 517 }
522 } 518 }
523 } 519 }
520}
521
522/*
523 * copy_to first frees everything allocated by the dst object,
524 * and then copies the contents of itself into the second
525 * object, allocating what needs to be allocated. Basically, any
526 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
527 * if the first object is freed, the pointers in the new object
528 * will point at garbage.
529 */
530void
531object::copy_to (object *dst)
532{
533 *dst = *this;
534
535 if (speed < 0)
536 dst->speed_left = speed_left - rndm ();
524 537
525 dst->set_speed (dst->speed); 538 dst->set_speed (dst->speed);
526} 539}
527 540
528void 541void
536 * need for monsters, but doesn't hurt to do it for everything. 549 * 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 550 * by doing so, when a monster is created, it has good starting
538 * values for the body_used info, so when items are created 551 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped. 552 * for it, they can be properly equipped.
540 */ 553 */
541 memcpy (body_used, body_info, sizeof (body_used)); 554 for (int i = NUM_BODY_LOCATIONS; i--; )
555 slot[i].used = slot[i].info;
542 556
543 attachable::instantiate (); 557 attachable::instantiate ();
544} 558}
545 559
546object * 560object *
834 848
835 if (flag [FLAG_IS_LINKED]) 849 if (flag [FLAG_IS_LINKED])
836 remove_button_link (this); 850 remove_button_link (this);
837 851
838 if (flag [FLAG_FRIENDLY]) 852 if (flag [FLAG_FRIENDLY])
839 {
840 remove_friendly_object (this); 853 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 854
849 if (!flag [FLAG_REMOVED]) 855 if (!flag [FLAG_REMOVED])
850 remove (); 856 remove ();
851 857
852 destroy_inv (true); 858 destroy_inv (true);
1109 return top; 1115 return top;
1110 } 1116 }
1111 } 1117 }
1112 1118
1113 return 0; 1119 return 0;
1120}
1121
1122void
1123object::expand_tail ()
1124{
1125 if (more)
1126 return;
1127
1128 object *prev = this;
1129
1130 for (archetype *at = arch->more; at; at = at->more)
1131 {
1132 object *op = arch_to_object (at);
1133
1134 op->name = name;
1135 op->name_pl = name_pl;
1136 op->title = title;
1137
1138 op->head = this;
1139 prev->more = op;
1140
1141 prev = op;
1142 }
1114} 1143}
1115 1144
1116/* 1145/*
1117 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1146 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1118 * job preparing multi-part monsters. 1147 * job preparing multi-part monsters.
1150 * just 'op' otherwise 1179 * just 'op' otherwise
1151 */ 1180 */
1152object * 1181object *
1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1182insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1154{ 1183{
1184 assert (!op->flag [FLAG_FREED]);
1185
1155 object *tmp, *top, *floor = NULL; 1186 object *tmp, *top, *floor = NULL;
1156 1187
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 (); 1188 op->remove ();
1167 1189
1168 if (!m) 1190#if 0
1169 { 1191 if (!m->active != !op->active)
1170 char *dump = dump_object (op); 1192 if (m->active)
1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1193 op->activate_recursive ();
1172 free (dump); 1194 else
1173 return op; 1195 op->deactivate_recursive ();
1174 } 1196#endif
1175 1197
1176 if (out_of_map (m, op->x, op->y)) 1198 if (out_of_map (m, op->x, op->y))
1177 { 1199 {
1178 char *dump = dump_object (op);
1179 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1200 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1180#ifdef MANY_CORES 1201#ifdef MANY_CORES
1181 /* Better to catch this here, as otherwise the next use of this object 1202 /* 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 1203 * is likely to cause a crash. Better to find out where it is getting
1183 * improperly inserted. 1204 * improperly inserted.
1184 */ 1205 */
1185 abort (); 1206 abort ();
1186#endif 1207#endif
1187 free (dump);
1188 return op; 1208 return op;
1189 } 1209 }
1190 1210
1191 if (object *more = op->more) 1211 if (object *more = op->more)
1192 { 1212 {
1429 tmp1->x = op->x; 1449 tmp1->x = op->x;
1430 tmp1->y = op->y; 1450 tmp1->y = op->y;
1431 insert_ob_in_map (tmp1, op->map, op, 0); 1451 insert_ob_in_map (tmp1, op->map, op, 0);
1432} 1452}
1433 1453
1434// XXX: function not returning object*
1435object * 1454object *
1436object::insert_at (object *where, object *originator, int flags) 1455object::insert_at (object *where, object *originator, int flags)
1437{ 1456{
1438 where->map->insert (this, where->x, where->y, originator, flags); 1457 return where->map->insert (this, where->x, where->y, originator, flags);
1439} 1458}
1440 1459
1441/* 1460/*
1442 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1461 * 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 1462 * is returned contains nr objects, and the remaining parts contains
1483 * the amount of an object. If the amount reaches 0, the object 1502 * the amount of an object. If the amount reaches 0, the object
1484 * is subsequently removed and freed. 1503 * is subsequently removed and freed.
1485 * 1504 *
1486 * Return value: 'op' if something is left, NULL if the amount reached 0 1505 * Return value: 'op' if something is left, NULL if the amount reached 0
1487 */ 1506 */
1488
1489object * 1507object *
1490decrease_ob_nr (object *op, uint32 i) 1508decrease_ob_nr (object *op, uint32 i)
1491{ 1509{
1492 object *tmp; 1510 object *tmp;
1493 1511
1568 1586
1569/* 1587/*
1570 * add_weight(object, weight) adds the specified weight to an object, 1588 * add_weight(object, weight) adds the specified weight to an object,
1571 * and also updates how much the environment(s) is/are carrying. 1589 * and also updates how much the environment(s) is/are carrying.
1572 */ 1590 */
1573
1574void 1591void
1575add_weight (object *op, signed long weight) 1592add_weight (object *op, signed long weight)
1576{ 1593{
1577 while (op != NULL) 1594 while (op != NULL)
1578 { 1595 {
1610 * inside the object environment. 1627 * inside the object environment.
1611 * 1628 *
1612 * The function returns now pointer to inserted item, and return value can 1629 * The function returns now pointer to inserted item, and return value can
1613 * be != op, if items are merged. -Tero 1630 * be != op, if items are merged. -Tero
1614 */ 1631 */
1615
1616object * 1632object *
1617object::insert (object *op) 1633object::insert (object *op)
1618{ 1634{
1619 object *tmp, *otmp; 1635 object *tmp, *otmp;
1620 1636
2413 return link->value; 2429 return link->value;
2414 2430
2415 return 0; 2431 return 0;
2416} 2432}
2417 2433
2418
2419/* 2434/*
2420 * Updates the canonical_key in op to value. 2435 * Updates the canonical_key in op to value.
2421 * 2436 *
2422 * canonical_key is a shared string (value doesn't have to be). 2437 * canonical_key is a shared string (value doesn't have to be).
2423 * 2438 *
2581} 2596}
2582 2597
2583const char * 2598const char *
2584object::debug_desc () const 2599object::debug_desc () const
2585{ 2600{
2586 static char info[256 * 4]; 2601 static char info[3][256 * 4];
2602 static int info_idx;
2603
2587 return debug_desc (info); 2604 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} 2605}
2596 2606
2597struct region * 2607struct region *
2598object::region () const 2608object::region () const
2599{ 2609{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines