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.142 by root, Mon Apr 30 04:25:29 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;
454 * refcounts and freeing the links. 455 * refcounts and freeing the links.
455 */ 456 */
456static void 457static void
457free_key_values (object *op) 458free_key_values (object *op)
458{ 459{
459 for (key_value *i = op->key_values; i != 0;) 460 for (key_value *i = op->key_values; i; )
460 { 461 {
461 key_value *next = i->next; 462 key_value *next = i->next;
462 delete i; 463 delete i;
463 464
464 i = next; 465 i = next;
465 } 466 }
466 467
467 op->key_values = 0; 468 op->key_values = 0;
468} 469}
469 470
470/* 471object &
471 * copy_to first frees everything allocated by the dst object, 472object::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{ 473{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 474 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 475 bool is_removed = flag [FLAG_REMOVED];
483 476
484 *(object_copy *)dst = *this; 477 *(object_copy *)this = src;
485 478
486 if (is_freed) 479 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 480 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 481
495 /* Copy over key_values, if any. */ 482 /* Copy over key_values, if any. */
496 if (key_values) 483 if (src.key_values)
497 { 484 {
498 key_value *tail = 0; 485 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 486 key_values = 0;
502 487
503 for (i = key_values; i; i = i->next) 488 for (key_value *i = src.key_values; i; i = i->next)
504 { 489 {
505 key_value *new_link = new key_value; 490 key_value *new_link = new key_value;
506 491
507 new_link->next = 0; 492 new_link->next = 0;
508 new_link->key = i->key; 493 new_link->key = i->key;
509 new_link->value = i->value; 494 new_link->value = i->value;
510 495
511 /* Try and be clever here, too. */ 496 /* Try and be clever here, too. */
512 if (!dst->key_values) 497 if (!key_values)
513 { 498 {
514 dst->key_values = new_link; 499 key_values = new_link;
515 tail = new_link; 500 tail = new_link;
516 } 501 }
517 else 502 else
518 { 503 {
519 tail->next = new_link; 504 tail->next = new_link;
520 tail = new_link; 505 tail = new_link;
521 } 506 }
522 } 507 }
523 } 508 }
509}
510
511/*
512 * copy_to first frees everything allocated by the dst object,
513 * and then copies the contents of itself into the second
514 * object, allocating what needs to be allocated. Basically, any
515 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
516 * if the first object is freed, the pointers in the new object
517 * will point at garbage.
518 */
519void
520object::copy_to (object *dst)
521{
522 *dst = *this;
523
524 if (speed < 0)
525 dst->speed_left = speed_left - rndm ();
524 526
525 dst->set_speed (dst->speed); 527 dst->set_speed (dst->speed);
526} 528}
527 529
528void 530void
834 836
835 if (flag [FLAG_IS_LINKED]) 837 if (flag [FLAG_IS_LINKED])
836 remove_button_link (this); 838 remove_button_link (this);
837 839
838 if (flag [FLAG_FRIENDLY]) 840 if (flag [FLAG_FRIENDLY])
839 {
840 remove_friendly_object (this); 841 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 842
849 if (!flag [FLAG_REMOVED]) 843 if (!flag [FLAG_REMOVED])
850 remove (); 844 remove ();
851 845
852 destroy_inv (true); 846 destroy_inv (true);
1109 return top; 1103 return top;
1110 } 1104 }
1111 } 1105 }
1112 1106
1113 return 0; 1107 return 0;
1108}
1109
1110void
1111object::expand_tail ()
1112{
1113 if (more)
1114 return;
1115
1116 object *prev = this;
1117
1118 for (archetype *at = arch->more; at; at = at->more)
1119 {
1120 object *op = arch_to_object (at);
1121
1122 op->name = name;
1123 op->name_pl = name_pl;
1124 op->title = title;
1125
1126 op->head = this;
1127 prev->more = op;
1128
1129 prev = op;
1130 }
1114} 1131}
1115 1132
1116/* 1133/*
1117 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1134 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1118 * job preparing multi-part monsters. 1135 * job preparing multi-part monsters.
1150 * just 'op' otherwise 1167 * just 'op' otherwise
1151 */ 1168 */
1152object * 1169object *
1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1170insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1154{ 1171{
1172 assert (!op->flag [FLAG_FREED]);
1173
1155 object *tmp, *top, *floor = NULL; 1174 object *tmp, *top, *floor = NULL;
1156 1175
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 (); 1176 op->remove ();
1167 1177
1168 if (!m) 1178#if 0
1169 { 1179 if (!m->active != !op->active)
1170 char *dump = dump_object (op); 1180 if (m->active)
1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1181 op->activate_recursive ();
1172 free (dump); 1182 else
1173 return op; 1183 op->deactivate_recursive ();
1174 } 1184#endif
1175 1185
1176 if (out_of_map (m, op->x, op->y)) 1186 if (out_of_map (m, op->x, op->y))
1177 { 1187 {
1178 char *dump = dump_object (op);
1179 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1188 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1180#ifdef MANY_CORES 1189#ifdef MANY_CORES
1181 /* Better to catch this here, as otherwise the next use of this object 1190 /* 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 1191 * is likely to cause a crash. Better to find out where it is getting
1183 * improperly inserted. 1192 * improperly inserted.
1184 */ 1193 */
1185 abort (); 1194 abort ();
1186#endif 1195#endif
1187 free (dump);
1188 return op; 1196 return op;
1189 } 1197 }
1190 1198
1191 if (object *more = op->more) 1199 if (object *more = op->more)
1192 { 1200 {
1429 tmp1->x = op->x; 1437 tmp1->x = op->x;
1430 tmp1->y = op->y; 1438 tmp1->y = op->y;
1431 insert_ob_in_map (tmp1, op->map, op, 0); 1439 insert_ob_in_map (tmp1, op->map, op, 0);
1432} 1440}
1433 1441
1434// XXX: function not returning object*
1435object * 1442object *
1436object::insert_at (object *where, object *originator, int flags) 1443object::insert_at (object *where, object *originator, int flags)
1437{ 1444{
1438 where->map->insert (this, where->x, where->y, originator, flags); 1445 return where->map->insert (this, where->x, where->y, originator, flags);
1439} 1446}
1440 1447
1441/* 1448/*
1442 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1449 * 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 1450 * is returned contains nr objects, and the remaining parts contains
1483 * the amount of an object. If the amount reaches 0, the object 1490 * the amount of an object. If the amount reaches 0, the object
1484 * is subsequently removed and freed. 1491 * is subsequently removed and freed.
1485 * 1492 *
1486 * Return value: 'op' if something is left, NULL if the amount reached 0 1493 * Return value: 'op' if something is left, NULL if the amount reached 0
1487 */ 1494 */
1488
1489object * 1495object *
1490decrease_ob_nr (object *op, uint32 i) 1496decrease_ob_nr (object *op, uint32 i)
1491{ 1497{
1492 object *tmp; 1498 object *tmp;
1493 1499
1568 1574
1569/* 1575/*
1570 * add_weight(object, weight) adds the specified weight to an object, 1576 * add_weight(object, weight) adds the specified weight to an object,
1571 * and also updates how much the environment(s) is/are carrying. 1577 * and also updates how much the environment(s) is/are carrying.
1572 */ 1578 */
1573
1574void 1579void
1575add_weight (object *op, signed long weight) 1580add_weight (object *op, signed long weight)
1576{ 1581{
1577 while (op != NULL) 1582 while (op != NULL)
1578 { 1583 {
1610 * inside the object environment. 1615 * inside the object environment.
1611 * 1616 *
1612 * The function returns now pointer to inserted item, and return value can 1617 * The function returns now pointer to inserted item, and return value can
1613 * be != op, if items are merged. -Tero 1618 * be != op, if items are merged. -Tero
1614 */ 1619 */
1615
1616object * 1620object *
1617object::insert (object *op) 1621object::insert (object *op)
1618{ 1622{
1619 object *tmp, *otmp; 1623 object *tmp, *otmp;
1620 1624
2413 return link->value; 2417 return link->value;
2414 2418
2415 return 0; 2419 return 0;
2416} 2420}
2417 2421
2418
2419/* 2422/*
2420 * Updates the canonical_key in op to value. 2423 * Updates the canonical_key in op to value.
2421 * 2424 *
2422 * canonical_key is a shared string (value doesn't have to be). 2425 * canonical_key is a shared string (value doesn't have to be).
2423 * 2426 *

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines