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.139 by root, Sat Apr 21 17:34:22 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines