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.133 by root, Fri Feb 16 19:43:40 2007 UTC vs.
Revision 1.156 by root, Fri May 18 01:01:01 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 all your items at once, "
501 "but the %s is just too much for your body. "
502 "[You need to unapply some items first.]", &ob->name);
503 return false;
504 }
505
506 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
507 }
508 else
509 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
510
511 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
512 {
513 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
514 &name, ob->debug_desc ());
515 return false;
516 }
517
518 return true;
519}
520
453/* Zero the key_values on op, decrementing the shared-string 521/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 522 * refcounts and freeing the links.
455 */ 523 */
456static void 524static void
457free_key_values (object *op) 525free_key_values (object *op)
458{ 526{
459 for (key_value *i = op->key_values; i != 0;) 527 for (key_value *i = op->key_values; i; )
460 { 528 {
461 key_value *next = i->next; 529 key_value *next = i->next;
462 delete i; 530 delete i;
463 531
464 i = next; 532 i = next;
465 } 533 }
466 534
467 op->key_values = 0; 535 op->key_values = 0;
468} 536}
469 537
470/* 538object &
471 * copy_to first frees everything allocated by the dst object, 539object::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{ 540{
481 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 541 bool is_freed = flag [FLAG_FREED];
482 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 542 bool is_removed = flag [FLAG_REMOVED];
483 543
484 *(object_copy *)dst = *this; 544 *(object_copy *)this = src;
485 545
486 if (is_freed) 546 flag [FLAG_FREED] = is_freed;
487 SET_FLAG (dst, FLAG_FREED); 547 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 548
495 /* Copy over key_values, if any. */ 549 /* Copy over key_values, if any. */
496 if (key_values) 550 if (src.key_values)
497 { 551 {
498 key_value *tail = 0; 552 key_value *tail = 0;
499 key_value *i;
500
501 dst->key_values = 0; 553 key_values = 0;
502 554
503 for (i = key_values; i; i = i->next) 555 for (key_value *i = src.key_values; i; i = i->next)
504 { 556 {
505 key_value *new_link = new key_value; 557 key_value *new_link = new key_value;
506 558
507 new_link->next = 0; 559 new_link->next = 0;
508 new_link->key = i->key; 560 new_link->key = i->key;
509 new_link->value = i->value; 561 new_link->value = i->value;
510 562
511 /* Try and be clever here, too. */ 563 /* Try and be clever here, too. */
512 if (!dst->key_values) 564 if (!key_values)
513 { 565 {
514 dst->key_values = new_link; 566 key_values = new_link;
515 tail = new_link; 567 tail = new_link;
516 } 568 }
517 else 569 else
518 { 570 {
519 tail->next = new_link; 571 tail->next = new_link;
520 tail = new_link; 572 tail = new_link;
521 } 573 }
522 } 574 }
523 } 575 }
576}
577
578/*
579 * copy_to first frees everything allocated by the dst object,
580 * and then copies the contents of itself into the second
581 * object, allocating what needs to be allocated. Basically, any
582 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
583 * if the first object is freed, the pointers in the new object
584 * will point at garbage.
585 */
586void
587object::copy_to (object *dst)
588{
589 *dst = *this;
590
591 if (speed < 0)
592 dst->speed_left = speed_left - rndm ();
524 593
525 dst->set_speed (dst->speed); 594 dst->set_speed (dst->speed);
526} 595}
527 596
528void 597void
536 * need for monsters, but doesn't hurt to do it for everything. 605 * 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 606 * by doing so, when a monster is created, it has good starting
538 * values for the body_used info, so when items are created 607 * values for the body_used info, so when items are created
539 * for it, they can be properly equipped. 608 * for it, they can be properly equipped.
540 */ 609 */
541 memcpy (body_used, body_info, sizeof (body_used)); 610 for (int i = NUM_BODY_LOCATIONS; i--; )
611 slot[i].used = slot[i].info;
542 612
543 attachable::instantiate (); 613 attachable::instantiate ();
544} 614}
545 615
546object * 616object *
606 * UP_OBJ_FACE: only the objects face has changed. 676 * UP_OBJ_FACE: only the objects face has changed.
607 */ 677 */
608void 678void
609update_object (object *op, int action) 679update_object (object *op, int action)
610{ 680{
611 MoveType move_on, move_off, move_block, move_slow;
612
613 if (op == NULL) 681 if (op == NULL)
614 { 682 {
615 /* this should never happen */ 683 /* this should never happen */
616 LOG (llevDebug, "update_object() called for NULL object.\n"); 684 LOG (llevDebug, "update_object() called for NULL object.\n");
617 return; 685 return;
836 904
837 if (flag [FLAG_IS_LINKED]) 905 if (flag [FLAG_IS_LINKED])
838 remove_button_link (this); 906 remove_button_link (this);
839 907
840 if (flag [FLAG_FRIENDLY]) 908 if (flag [FLAG_FRIENDLY])
841 {
842 remove_friendly_object (this); 909 remove_friendly_object (this);
843
844 if (type == GOLEM
845 && owner
846 && owner->type == PLAYER
847 && owner->contr->ranges[range_golem] == this)
848 owner->contr->ranges[range_golem] = 0;
849 }
850 910
851 if (!flag [FLAG_REMOVED]) 911 if (!flag [FLAG_REMOVED])
852 remove (); 912 remove ();
853 913
854 destroy_inv (true); 914 destroy_inv (true);
1111 return top; 1171 return top;
1112 } 1172 }
1113 } 1173 }
1114 1174
1115 return 0; 1175 return 0;
1176}
1177
1178void
1179object::expand_tail ()
1180{
1181 if (more)
1182 return;
1183
1184 object *prev = this;
1185
1186 for (archetype *at = arch->more; at; at = at->more)
1187 {
1188 object *op = arch_to_object (at);
1189
1190 op->name = name;
1191 op->name_pl = name_pl;
1192 op->title = title;
1193
1194 op->head = this;
1195 prev->more = op;
1196
1197 prev = op;
1198 }
1116} 1199}
1117 1200
1118/* 1201/*
1119 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1202 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1120 * job preparing multi-part monsters. 1203 * job preparing multi-part monsters.
1152 * just 'op' otherwise 1235 * just 'op' otherwise
1153 */ 1236 */
1154object * 1237object *
1155insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1156{ 1239{
1240 assert (!op->flag [FLAG_FREED]);
1241
1157 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1158
1159 if (QUERY_FLAG (op, FLAG_FREED))
1160 {
1161 LOG (llevError, "Trying to insert freed object!\n");
1162 return NULL;
1163 }
1164
1165 if (!QUERY_FLAG (op, FLAG_REMOVED))
1166 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1167 1243
1168 op->remove (); 1244 op->remove ();
1169 1245
1170 if (!m) 1246#if 0
1171 { 1247 if (!m->active != !op->active)
1172 char *dump = dump_object (op); 1248 if (m->active)
1173 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1249 op->activate_recursive ();
1174 free (dump); 1250 else
1175 return op; 1251 op->deactivate_recursive ();
1176 } 1252#endif
1177 1253
1178 if (out_of_map (m, op->x, op->y)) 1254 if (out_of_map (m, op->x, op->y))
1179 { 1255 {
1180 char *dump = dump_object (op);
1181 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1256 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1182#ifdef MANY_CORES 1257#ifdef MANY_CORES
1183 /* Better to catch this here, as otherwise the next use of this object 1258 /* Better to catch this here, as otherwise the next use of this object
1184 * is likely to cause a crash. Better to find out where it is getting 1259 * is likely to cause a crash. Better to find out where it is getting
1185 * improperly inserted. 1260 * improperly inserted.
1186 */ 1261 */
1187 abort (); 1262 abort ();
1188#endif 1263#endif
1189 free (dump);
1190 return op; 1264 return op;
1191 } 1265 }
1192 1266
1193 if (object *more = op->more) 1267 if (object *more = op->more)
1194 {
1195 if (!insert_ob_in_map (more, m, originator, flag)) 1268 if (!insert_ob_in_map (more, m, originator, flag))
1196 {
1197 if (!op->head)
1198 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1199
1200 return 0; 1269 return 0;
1201 }
1202 }
1203 1270
1204 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1205 1272
1206 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* Ideally, the caller figures this out. However, it complicates a lot
1207 * of areas of callers (eg, anything that uses find_free_spot would now 1274 * of areas of callers (eg, anything that uses find_free_spot would now
1214 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1215 1282
1216 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1217 */ 1284 */
1218 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1219 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1220 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1221 { 1288 {
1222 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1223 tmp->destroy (); 1290 tmp->destroy ();
1224 } 1291 }
1291 * looks like instead of lots of conditions here. 1358 * looks like instead of lots of conditions here.
1292 * makes things faster, and effectively the same result. 1359 * makes things faster, and effectively the same result.
1293 */ 1360 */
1294 1361
1295 /* Have object 'fall below' other objects that block view. 1362 /* Have object 'fall below' other objects that block view.
1296 * Unless those objects are exits, type 66 1363 * Unless those objects are exits.
1297 * If INS_ON_TOP is used, don't do this processing 1364 * If INS_ON_TOP is used, don't do this processing
1298 * Need to find the object that in fact blocks view, otherwise 1365 * Need to find the object that in fact blocks view, otherwise
1299 * stacking is a bit odd. 1366 * stacking is a bit odd.
1300 */ 1367 */
1301 if (!(flag & INS_ON_TOP) 1368 if (!(flag & INS_ON_TOP)
1302 && ms.flags () & P_BLOCKSVIEW 1369 && ms.flags () & P_BLOCKSVIEW
1303 && (op->face && !op->face->visibility)) 1370 && (op->face && !faces [op->face].visibility))
1304 { 1371 {
1305 for (last = top; last != floor; last = last->below) 1372 for (last = top; last != floor; last = last->below)
1306 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1373 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1307 break; 1374 break;
1308 1375
1393 * blocked() and wall() work properly), and these flags are updated by 1460 * blocked() and wall() work properly), and these flags are updated by
1394 * update_object(). 1461 * update_object().
1395 */ 1462 */
1396 1463
1397 /* if this is not the head or flag has been passed, don't check walk on status */ 1464 /* if this is not the head or flag has been passed, don't check walk on status */
1398 if (!(flag & INS_NO_WALK_ON) && !op->head) 1465 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1399 { 1466 {
1400 if (check_move_on (op, originator)) 1467 if (check_move_on (op, originator))
1401 return 0; 1468 return 0;
1402 1469
1403 /* If we are a multi part object, lets work our way through the check 1470 /* If we are a multi part object, lets work our way through the check
1404 * walk on's. 1471 * walk on's.
1405 */ 1472 */
1406 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1473 for (object *tmp = op->more; tmp; tmp = tmp->more)
1407 if (check_move_on (tmp, originator)) 1474 if (check_move_on (tmp, originator))
1408 return 0; 1475 return 0;
1409 } 1476 }
1410 1477
1411 return op; 1478 return op;
1434} 1501}
1435 1502
1436object * 1503object *
1437object::insert_at (object *where, object *originator, int flags) 1504object::insert_at (object *where, object *originator, int flags)
1438{ 1505{
1439 where->map->insert (this, where->x, where->y, originator, flags); 1506 return where->map->insert (this, where->x, where->y, originator, flags);
1440} 1507}
1441 1508
1442/* 1509/*
1443 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1510 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1444 * is returned contains nr objects, and the remaining parts contains 1511 * is returned contains nr objects, and the remaining parts contains
1484 * the amount of an object. If the amount reaches 0, the object 1551 * the amount of an object. If the amount reaches 0, the object
1485 * is subsequently removed and freed. 1552 * is subsequently removed and freed.
1486 * 1553 *
1487 * Return value: 'op' if something is left, NULL if the amount reached 0 1554 * Return value: 'op' if something is left, NULL if the amount reached 0
1488 */ 1555 */
1489
1490object * 1556object *
1491decrease_ob_nr (object *op, uint32 i) 1557decrease_ob_nr (object *op, uint32 i)
1492{ 1558{
1493 object *tmp; 1559 object *tmp;
1494 1560
1569 1635
1570/* 1636/*
1571 * add_weight(object, weight) adds the specified weight to an object, 1637 * add_weight(object, weight) adds the specified weight to an object,
1572 * and also updates how much the environment(s) is/are carrying. 1638 * and also updates how much the environment(s) is/are carrying.
1573 */ 1639 */
1574
1575void 1640void
1576add_weight (object *op, signed long weight) 1641add_weight (object *op, signed long weight)
1577{ 1642{
1578 while (op != NULL) 1643 while (op != NULL)
1579 { 1644 {
1594 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1659 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1595 free (dump); 1660 free (dump);
1596 return op; 1661 return op;
1597 } 1662 }
1598 1663
1599 if (where->head) 1664 if (where->head_ () != where)
1600 { 1665 {
1601 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1666 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1602 where = where->head; 1667 where = where->head;
1603 } 1668 }
1604 1669
1605 return where->insert (op); 1670 return where->insert (op);
1606} 1671}
1611 * inside the object environment. 1676 * inside the object environment.
1612 * 1677 *
1613 * The function returns now pointer to inserted item, and return value can 1678 * The function returns now pointer to inserted item, and return value can
1614 * be != op, if items are merged. -Tero 1679 * be != op, if items are merged. -Tero
1615 */ 1680 */
1616
1617object * 1681object *
1618object::insert (object *op) 1682object::insert (object *op)
1619{ 1683{
1620 object *tmp, *otmp; 1684 object *tmp, *otmp;
1621 1685
1935 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1999 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1936 { 2000 {
1937 CLEAR_FLAG (tmp, flag); 2001 CLEAR_FLAG (tmp, flag);
1938 unflag_inv (tmp, flag); 2002 unflag_inv (tmp, flag);
1939 } 2003 }
1940}
1941
1942/*
1943 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1944 * all it's inventory (recursively).
1945 * If checksums are used, a player will get set_cheat called for
1946 * him/her-self and all object carried by a call to this function.
1947 */
1948void
1949set_cheat (object *op)
1950{
1951 SET_FLAG (op, FLAG_WAS_WIZ);
1952 flag_inv (op, FLAG_WAS_WIZ);
1953} 2004}
1954 2005
1955/* 2006/*
1956 * find_free_spot(object, map, x, y, start, stop) will search for 2007 * find_free_spot(object, map, x, y, start, stop) will search for
1957 * a spot at the given map and coordinates which will be able to contain 2008 * a spot at the given map and coordinates which will be able to contain
2075 object *tmp; 2126 object *tmp;
2076 maptile *mp; 2127 maptile *mp;
2077 2128
2078 MoveType blocked, move_type; 2129 MoveType blocked, move_type;
2079 2130
2080 if (exclude && exclude->head) 2131 if (exclude && exclude->head_ () != exclude)
2081 { 2132 {
2082 exclude = exclude->head; 2133 exclude = exclude->head;
2083 move_type = exclude->move_type; 2134 move_type = exclude->move_type;
2084 } 2135 }
2085 else 2136 else
2108 max = maxfree[i]; 2159 max = maxfree[i];
2109 else if (mflags & P_IS_ALIVE) 2160 else if (mflags & P_IS_ALIVE)
2110 { 2161 {
2111 for (tmp = ms.bot; tmp; tmp = tmp->above) 2162 for (tmp = ms.bot; tmp; tmp = tmp->above)
2112 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2163 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2113 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2164 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2114 break; 2165 break;
2115 2166
2116 if (tmp) 2167 if (tmp)
2117 return freedir[i]; 2168 return freedir[i];
2118 } 2169 }
2313 * create clone from object to another 2364 * create clone from object to another
2314 */ 2365 */
2315object * 2366object *
2316object_create_clone (object *asrc) 2367object_create_clone (object *asrc)
2317{ 2368{
2318 object *dst = 0, *tmp, *src, *part, *prev, *item; 2369 object *dst = 0, *tmp, *src, *prev, *item;
2319 2370
2320 if (!asrc) 2371 if (!asrc)
2321 return 0; 2372 return 0;
2322 2373
2323 src = asrc;
2324 if (src->head)
2325 src = src->head; 2374 src = asrc->head_ ();
2326 2375
2327 prev = 0; 2376 prev = 0;
2328 for (part = src; part; part = part->more) 2377 for (object *part = src; part; part = part->more)
2329 { 2378 {
2330 tmp = part->clone (); 2379 tmp = part->clone ();
2331 tmp->x -= src->x; 2380 tmp->x -= src->x;
2332 tmp->y -= src->y; 2381 tmp->y -= src->y;
2333 2382
2413 if (link->key == canonical_key) 2462 if (link->key == canonical_key)
2414 return link->value; 2463 return link->value;
2415 2464
2416 return 0; 2465 return 0;
2417} 2466}
2418
2419 2467
2420/* 2468/*
2421 * Updates the canonical_key in op to value. 2469 * Updates the canonical_key in op to value.
2422 * 2470 *
2423 * canonical_key is a shared string (value doesn't have to be). 2471 * canonical_key is a shared string (value doesn't have to be).
2582} 2630}
2583 2631
2584const char * 2632const char *
2585object::debug_desc () const 2633object::debug_desc () const
2586{ 2634{
2587 static char info[256 * 4]; 2635 static char info[3][256 * 4];
2636 static int info_idx;
2637
2588 return debug_desc (info); 2638 return debug_desc (info [++info_idx % 3]);
2589}
2590
2591const char *
2592object::debug_desc2 () const
2593{
2594 static char info[256 * 4];
2595 return debug_desc (info);
2596} 2639}
2597 2640
2598struct region * 2641struct region *
2599object::region () const 2642object::region () const
2600{ 2643{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines