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.158 by root, Mon Jun 4 12:19:08 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software; you can redistribute it and/or modify it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 27 variable. */
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 *
834 904
835 if (flag [FLAG_IS_LINKED]) 905 if (flag [FLAG_IS_LINKED])
836 remove_button_link (this); 906 remove_button_link (this);
837 907
838 if (flag [FLAG_FRIENDLY]) 908 if (flag [FLAG_FRIENDLY])
839 {
840 remove_friendly_object (this); 909 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 910
849 if (!flag [FLAG_REMOVED]) 911 if (!flag [FLAG_REMOVED])
850 remove (); 912 remove ();
851 913
852 destroy_inv (true); 914 destroy_inv (true);
1109 return top; 1171 return top;
1110 } 1172 }
1111 } 1173 }
1112 1174
1113 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 }
1114} 1199}
1115 1200
1116/* 1201/*
1117 * 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
1118 * job preparing multi-part monsters. 1203 * job preparing multi-part monsters.
1150 * just 'op' otherwise 1235 * just 'op' otherwise
1151 */ 1236 */
1152object * 1237object *
1153insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1154{ 1239{
1240 assert (!op->flag [FLAG_FREED]);
1241
1155 object *tmp, *top, *floor = NULL; 1242 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 1243
1166 op->remove (); 1244 op->remove ();
1167 1245
1168 if (!m) 1246#if 0
1169 { 1247 if (!m->active != !op->active)
1170 char *dump = dump_object (op); 1248 if (m->active)
1171 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1249 op->activate_recursive ();
1172 free (dump); 1250 else
1173 return op; 1251 op->deactivate_recursive ();
1174 } 1252#endif
1175 1253
1176 if (out_of_map (m, op->x, op->y)) 1254 if (out_of_map (m, op->x, op->y))
1177 { 1255 {
1178 char *dump = dump_object (op);
1179 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 ());
1180#ifdef MANY_CORES 1257#ifdef MANY_CORES
1181 /* 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
1182 * 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
1183 * improperly inserted. 1260 * improperly inserted.
1184 */ 1261 */
1185 abort (); 1262 abort ();
1186#endif 1263#endif
1187 free (dump);
1188 return op; 1264 return op;
1189 } 1265 }
1190 1266
1191 if (object *more = op->more) 1267 if (object *more = op->more)
1192 {
1193 if (!insert_ob_in_map (more, m, originator, flag)) 1268 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; 1269 return 0;
1199 }
1200 }
1201 1270
1202 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1203 1272
1204 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* 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 1274 * of areas of callers (eg, anything that uses find_free_spot would now
1212 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1213 1282
1214 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1215 */ 1284 */
1216 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1217 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1218 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1219 { 1288 {
1220 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1221 tmp->destroy (); 1290 tmp->destroy ();
1222 } 1291 }
1391 * blocked() and wall() work properly), and these flags are updated by 1460 * blocked() and wall() work properly), and these flags are updated by
1392 * update_object(). 1461 * update_object().
1393 */ 1462 */
1394 1463
1395 /* 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 */
1396 if (!(flag & INS_NO_WALK_ON) && !op->head) 1465 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1397 { 1466 {
1398 if (check_move_on (op, originator)) 1467 if (check_move_on (op, originator))
1399 return 0; 1468 return 0;
1400 1469
1401 /* 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
1402 * walk on's. 1471 * walk on's.
1403 */ 1472 */
1404 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1473 for (object *tmp = op->more; tmp; tmp = tmp->more)
1405 if (check_move_on (tmp, originator)) 1474 if (check_move_on (tmp, originator))
1406 return 0; 1475 return 0;
1407 } 1476 }
1408 1477
1409 return op; 1478 return op;
1419 object *tmp, *tmp1; 1488 object *tmp, *tmp1;
1420 1489
1421 /* first search for itself and remove any old instances */ 1490 /* first search for itself and remove any old instances */
1422 1491
1423 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1492 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1424 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1493 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1425 tmp->destroy (); 1494 tmp->destroy ();
1426 1495
1427 tmp1 = arch_to_object (archetype::find (arch_string)); 1496 tmp1 = arch_to_object (archetype::find (arch_string));
1428 1497
1429 tmp1->x = op->x; 1498 tmp1->x = op->x;
1430 tmp1->y = op->y; 1499 tmp1->y = op->y;
1431 insert_ob_in_map (tmp1, op->map, op, 0); 1500 insert_ob_in_map (tmp1, op->map, op, 0);
1432} 1501}
1433 1502
1434// XXX: function not returning object*
1435object * 1503object *
1436object::insert_at (object *where, object *originator, int flags) 1504object::insert_at (object *where, object *originator, int flags)
1437{ 1505{
1438 where->map->insert (this, where->x, where->y, originator, flags); 1506 return where->map->insert (this, where->x, where->y, originator, flags);
1439} 1507}
1440 1508
1441/* 1509/*
1442 * 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
1443 * is returned contains nr objects, and the remaining parts contains 1511 * is returned contains nr objects, and the remaining parts contains
1483 * 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
1484 * is subsequently removed and freed. 1552 * is subsequently removed and freed.
1485 * 1553 *
1486 * 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
1487 */ 1555 */
1488
1489object * 1556object *
1490decrease_ob_nr (object *op, uint32 i) 1557decrease_ob_nr (object *op, uint32 i)
1491{ 1558{
1492 object *tmp; 1559 object *tmp;
1493 1560
1568 1635
1569/* 1636/*
1570 * add_weight(object, weight) adds the specified weight to an object, 1637 * add_weight(object, weight) adds the specified weight to an object,
1571 * and also updates how much the environment(s) is/are carrying. 1638 * and also updates how much the environment(s) is/are carrying.
1572 */ 1639 */
1573
1574void 1640void
1575add_weight (object *op, signed long weight) 1641add_weight (object *op, signed long weight)
1576{ 1642{
1577 while (op != NULL) 1643 while (op != NULL)
1578 { 1644 {
1593 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);
1594 free (dump); 1660 free (dump);
1595 return op; 1661 return op;
1596 } 1662 }
1597 1663
1598 if (where->head) 1664 if (where->head_ () != where)
1599 { 1665 {
1600 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");
1601 where = where->head; 1667 where = where->head;
1602 } 1668 }
1603 1669
1604 return where->insert (op); 1670 return where->insert (op);
1605} 1671}
1610 * inside the object environment. 1676 * inside the object environment.
1611 * 1677 *
1612 * 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
1613 * be != op, if items are merged. -Tero 1679 * be != op, if items are merged. -Tero
1614 */ 1680 */
1615
1616object * 1681object *
1617object::insert (object *op) 1682object::insert (object *op)
1618{ 1683{
1619 object *tmp, *otmp; 1684 object *tmp, *otmp;
1620 1685
1934 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1999 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1935 { 2000 {
1936 CLEAR_FLAG (tmp, flag); 2001 CLEAR_FLAG (tmp, flag);
1937 unflag_inv (tmp, flag); 2002 unflag_inv (tmp, flag);
1938 } 2003 }
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} 2004}
1953 2005
1954/* 2006/*
1955 * 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
1956 * 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
2074 object *tmp; 2126 object *tmp;
2075 maptile *mp; 2127 maptile *mp;
2076 2128
2077 MoveType blocked, move_type; 2129 MoveType blocked, move_type;
2078 2130
2079 if (exclude && exclude->head) 2131 if (exclude && exclude->head_ () != exclude)
2080 { 2132 {
2081 exclude = exclude->head; 2133 exclude = exclude->head;
2082 move_type = exclude->move_type; 2134 move_type = exclude->move_type;
2083 } 2135 }
2084 else 2136 else
2107 max = maxfree[i]; 2159 max = maxfree[i];
2108 else if (mflags & P_IS_ALIVE) 2160 else if (mflags & P_IS_ALIVE)
2109 { 2161 {
2110 for (tmp = ms.bot; tmp; tmp = tmp->above) 2162 for (tmp = ms.bot; tmp; tmp = tmp->above)
2111 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2163 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2112 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2164 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2113 break; 2165 break;
2114 2166
2115 if (tmp) 2167 if (tmp)
2116 return freedir[i]; 2168 return freedir[i];
2117 } 2169 }
2312 * create clone from object to another 2364 * create clone from object to another
2313 */ 2365 */
2314object * 2366object *
2315object_create_clone (object *asrc) 2367object_create_clone (object *asrc)
2316{ 2368{
2317 object *dst = 0, *tmp, *src, *part, *prev, *item; 2369 object *dst = 0, *tmp, *src, *prev, *item;
2318 2370
2319 if (!asrc) 2371 if (!asrc)
2320 return 0; 2372 return 0;
2321 2373
2322 src = asrc;
2323 if (src->head)
2324 src = src->head; 2374 src = asrc->head_ ();
2325 2375
2326 prev = 0; 2376 prev = 0;
2327 for (part = src; part; part = part->more) 2377 for (object *part = src; part; part = part->more)
2328 { 2378 {
2329 tmp = part->clone (); 2379 tmp = part->clone ();
2330 tmp->x -= src->x; 2380 tmp->x -= src->x;
2331 tmp->y -= src->y; 2381 tmp->y -= src->y;
2332 2382
2412 if (link->key == canonical_key) 2462 if (link->key == canonical_key)
2413 return link->value; 2463 return link->value;
2414 2464
2415 return 0; 2465 return 0;
2416} 2466}
2417
2418 2467
2419/* 2468/*
2420 * Updates the canonical_key in op to value. 2469 * Updates the canonical_key in op to value.
2421 * 2470 *
2422 * 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).
2581} 2630}
2582 2631
2583const char * 2632const char *
2584object::debug_desc () const 2633object::debug_desc () const
2585{ 2634{
2586 static char info[256 * 4]; 2635 static char info[3][256 * 4];
2636 static int info_idx;
2637
2587 return debug_desc (info); 2638 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} 2639}
2596 2640
2597struct region * 2641struct region *
2598object::region () const 2642object::region () const
2599{ 2643{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines