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 | |
38 | int nrofallocobjects = 0; |
39 | int nrofallocobjects = 0; |
… | |
… | |
324 | sum_weight (object *op) |
325 | sum_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; |
… | |
… | |
446 | */ |
448 | */ |
447 | while (owner->owner) |
449 | while (owner->owner) |
448 | owner = owner->owner; |
450 | owner = owner->owner; |
449 | |
451 | |
450 | this->owner = owner; |
452 | this->owner = owner; |
|
|
453 | } |
|
|
454 | |
|
|
455 | int |
|
|
456 | object::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 | |
|
|
472 | bool |
|
|
473 | object::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; |
451 | } |
519 | } |
452 | |
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 | */ |
… | |
… | |
537 | * 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. |
538 | * 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 |
539 | * values for the body_used info, so when items are created |
607 | * values for the body_used info, so when items are created |
540 | * for it, they can be properly equipped. |
608 | * for it, they can be properly equipped. |
541 | */ |
609 | */ |
542 | memcpy (body_used, body_info, sizeof (body_used)); |
610 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
611 | slot[i].used = slot[i].info; |
543 | |
612 | |
544 | attachable::instantiate (); |
613 | attachable::instantiate (); |
545 | } |
614 | } |
546 | |
615 | |
547 | object * |
616 | object * |
… | |
… | |
835 | |
904 | |
836 | if (flag [FLAG_IS_LINKED]) |
905 | if (flag [FLAG_IS_LINKED]) |
837 | remove_button_link (this); |
906 | remove_button_link (this); |
838 | |
907 | |
839 | if (flag [FLAG_FRIENDLY]) |
908 | if (flag [FLAG_FRIENDLY]) |
840 | { |
|
|
841 | remove_friendly_object (this); |
909 | remove_friendly_object (this); |
842 | |
|
|
843 | if (type == GOLEM |
|
|
844 | && owner |
|
|
845 | && owner->type == PLAYER |
|
|
846 | && owner->contr->ranges[range_golem] == this) |
|
|
847 | owner->contr->ranges[range_golem] = 0; |
|
|
848 | } |
|
|
849 | |
910 | |
850 | if (!flag [FLAG_REMOVED]) |
911 | if (!flag [FLAG_REMOVED]) |
851 | remove (); |
912 | remove (); |
852 | |
913 | |
853 | destroy_inv (true); |
914 | destroy_inv (true); |
… | |
… | |
1055 | |
1116 | |
1056 | if (destroyed ()) |
1117 | if (destroyed ()) |
1057 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1118 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1058 | } |
1119 | } |
1059 | |
1120 | |
1060 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1061 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1062 | if (tmp->above == tmp) |
|
|
1063 | tmp->above = 0; |
|
|
1064 | |
|
|
1065 | last = tmp; |
1121 | last = tmp; |
1066 | } |
1122 | } |
1067 | |
1123 | |
1068 | /* last == NULL if there are no objects on this space */ |
1124 | /* last == NULL if there are no objects on this space */ |
1069 | //TODO: this makes little sense, why only update the topmost object? |
1125 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1120 | if (more) |
1176 | if (more) |
1121 | return; |
1177 | return; |
1122 | |
1178 | |
1123 | object *prev = this; |
1179 | object *prev = this; |
1124 | |
1180 | |
1125 | for (archetype *at = arch->more; at; at = at->more) |
1181 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1126 | { |
1182 | { |
1127 | object *op = arch_to_object (at); |
1183 | object *op = arch_to_object (at); |
1128 | |
1184 | |
1129 | op->name = name; |
1185 | op->name = name; |
1130 | op->name_pl = name_pl; |
1186 | op->name_pl = name_pl; |
… | |
… | |
1144 | object * |
1200 | object * |
1145 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1201 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1146 | { |
1202 | { |
1147 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1203 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1148 | { |
1204 | { |
1149 | tmp->x = x + tmp->arch->clone.x; |
1205 | tmp->x = x + tmp->arch->x; |
1150 | tmp->y = y + tmp->arch->clone.y; |
1206 | tmp->y = y + tmp->arch->y; |
1151 | } |
1207 | } |
1152 | |
1208 | |
1153 | return insert_ob_in_map (op, m, originator, flag); |
1209 | return insert_ob_in_map (op, m, originator, flag); |
1154 | } |
1210 | } |
1155 | |
1211 | |
… | |
… | |
1176 | object * |
1232 | object * |
1177 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1233 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1178 | { |
1234 | { |
1179 | assert (!op->flag [FLAG_FREED]); |
1235 | assert (!op->flag [FLAG_FREED]); |
1180 | |
1236 | |
1181 | object *tmp, *top, *floor = NULL; |
1237 | object *top, *floor = NULL; |
1182 | |
1238 | |
1183 | op->remove (); |
1239 | op->remove (); |
1184 | |
1240 | |
1185 | #if 0 |
1241 | #if 0 |
1186 | if (!m->active != !op->active) |
1242 | if (!m->active != !op->active) |
… | |
… | |
1202 | #endif |
1258 | #endif |
1203 | return op; |
1259 | return op; |
1204 | } |
1260 | } |
1205 | |
1261 | |
1206 | if (object *more = op->more) |
1262 | if (object *more = op->more) |
1207 | { |
|
|
1208 | if (!insert_ob_in_map (more, m, originator, flag)) |
1263 | if (!insert_ob_in_map (more, m, originator, flag)) |
1209 | { |
|
|
1210 | if (!op->head) |
|
|
1211 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1212 | |
|
|
1213 | return 0; |
1264 | return 0; |
1214 | } |
|
|
1215 | } |
|
|
1216 | |
1265 | |
1217 | CLEAR_FLAG (op, FLAG_REMOVED); |
1266 | CLEAR_FLAG (op, FLAG_REMOVED); |
1218 | |
1267 | |
1219 | /* Ideally, the caller figures this out. However, it complicates a lot |
1268 | /* Ideally, the caller figures this out. However, it complicates a lot |
1220 | * of areas of callers (eg, anything that uses find_free_spot would now |
1269 | * of areas of callers (eg, anything that uses find_free_spot would now |
… | |
… | |
1227 | mapspace &ms = op->ms (); |
1276 | mapspace &ms = op->ms (); |
1228 | |
1277 | |
1229 | /* this has to be done after we translate the coordinates. |
1278 | /* this has to be done after we translate the coordinates. |
1230 | */ |
1279 | */ |
1231 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1280 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1232 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1281 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1233 | if (object::can_merge (op, tmp)) |
1282 | if (object::can_merge (op, tmp)) |
1234 | { |
1283 | { |
1235 | op->nrof += tmp->nrof; |
1284 | op->nrof += tmp->nrof; |
1236 | tmp->destroy (); |
1285 | tmp->destroy (); |
1237 | } |
1286 | } |
… | |
… | |
1406 | * blocked() and wall() work properly), and these flags are updated by |
1455 | * blocked() and wall() work properly), and these flags are updated by |
1407 | * update_object(). |
1456 | * update_object(). |
1408 | */ |
1457 | */ |
1409 | |
1458 | |
1410 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1459 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1411 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1460 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1412 | { |
1461 | { |
1413 | if (check_move_on (op, originator)) |
1462 | if (check_move_on (op, originator)) |
1414 | return 0; |
1463 | return 0; |
1415 | |
1464 | |
1416 | /* If we are a multi part object, lets work our way through the check |
1465 | /* If we are a multi part object, lets work our way through the check |
1417 | * walk on's. |
1466 | * walk on's. |
1418 | */ |
1467 | */ |
1419 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1468 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1420 | if (check_move_on (tmp, originator)) |
1469 | if (check_move_on (tmp, originator)) |
1421 | return 0; |
1470 | return 0; |
1422 | } |
1471 | } |
1423 | |
1472 | |
1424 | return op; |
1473 | return op; |
… | |
… | |
1434 | object *tmp, *tmp1; |
1483 | object *tmp, *tmp1; |
1435 | |
1484 | |
1436 | /* first search for itself and remove any old instances */ |
1485 | /* first search for itself and remove any old instances */ |
1437 | |
1486 | |
1438 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1487 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1439 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1488 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1440 | tmp->destroy (); |
1489 | tmp->destroy (); |
1441 | |
1490 | |
1442 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1491 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1443 | |
1492 | |
1444 | tmp1->x = op->x; |
1493 | tmp1->x = op->x; |
… | |
… | |
1605 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1654 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1606 | free (dump); |
1655 | free (dump); |
1607 | return op; |
1656 | return op; |
1608 | } |
1657 | } |
1609 | |
1658 | |
1610 | if (where->head) |
1659 | if (where->head_ () != where) |
1611 | { |
1660 | { |
1612 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1661 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1613 | where = where->head; |
1662 | where = where->head; |
1614 | } |
1663 | } |
1615 | |
1664 | |
1616 | return where->insert (op); |
1665 | return where->insert (op); |
1617 | } |
1666 | } |
… | |
… | |
1945 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1994 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1946 | { |
1995 | { |
1947 | CLEAR_FLAG (tmp, flag); |
1996 | CLEAR_FLAG (tmp, flag); |
1948 | unflag_inv (tmp, flag); |
1997 | unflag_inv (tmp, flag); |
1949 | } |
1998 | } |
1950 | } |
|
|
1951 | |
|
|
1952 | /* |
|
|
1953 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1954 | * all it's inventory (recursively). |
|
|
1955 | * If checksums are used, a player will get set_cheat called for |
|
|
1956 | * him/her-self and all object carried by a call to this function. |
|
|
1957 | */ |
|
|
1958 | void |
|
|
1959 | set_cheat (object *op) |
|
|
1960 | { |
|
|
1961 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1962 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1963 | } |
1999 | } |
1964 | |
2000 | |
1965 | /* |
2001 | /* |
1966 | * find_free_spot(object, map, x, y, start, stop) will search for |
2002 | * find_free_spot(object, map, x, y, start, stop) will search for |
1967 | * a spot at the given map and coordinates which will be able to contain |
2003 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2085 | object *tmp; |
2121 | object *tmp; |
2086 | maptile *mp; |
2122 | maptile *mp; |
2087 | |
2123 | |
2088 | MoveType blocked, move_type; |
2124 | MoveType blocked, move_type; |
2089 | |
2125 | |
2090 | if (exclude && exclude->head) |
2126 | if (exclude && exclude->head_ () != exclude) |
2091 | { |
2127 | { |
2092 | exclude = exclude->head; |
2128 | exclude = exclude->head; |
2093 | move_type = exclude->move_type; |
2129 | move_type = exclude->move_type; |
2094 | } |
2130 | } |
2095 | else |
2131 | else |
… | |
… | |
2118 | max = maxfree[i]; |
2154 | max = maxfree[i]; |
2119 | else if (mflags & P_IS_ALIVE) |
2155 | else if (mflags & P_IS_ALIVE) |
2120 | { |
2156 | { |
2121 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2157 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2122 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2158 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2123 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2159 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2124 | break; |
2160 | break; |
2125 | |
2161 | |
2126 | if (tmp) |
2162 | if (tmp) |
2127 | return freedir[i]; |
2163 | return freedir[i]; |
2128 | } |
2164 | } |
… | |
… | |
2323 | * create clone from object to another |
2359 | * create clone from object to another |
2324 | */ |
2360 | */ |
2325 | object * |
2361 | object * |
2326 | object_create_clone (object *asrc) |
2362 | object_create_clone (object *asrc) |
2327 | { |
2363 | { |
2328 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2364 | object *dst = 0, *tmp, *src, *prev, *item; |
2329 | |
2365 | |
2330 | if (!asrc) |
2366 | if (!asrc) |
2331 | return 0; |
2367 | return 0; |
2332 | |
2368 | |
2333 | src = asrc; |
|
|
2334 | if (src->head) |
|
|
2335 | src = src->head; |
2369 | src = asrc->head_ (); |
2336 | |
2370 | |
2337 | prev = 0; |
2371 | prev = 0; |
2338 | for (part = src; part; part = part->more) |
2372 | for (object *part = src; part; part = part->more) |
2339 | { |
2373 | { |
2340 | tmp = part->clone (); |
2374 | tmp = part->clone (); |
2341 | tmp->x -= src->x; |
2375 | tmp->x -= src->x; |
2342 | tmp->y -= src->y; |
2376 | tmp->y -= src->y; |
2343 | |
2377 | |
… | |
… | |
2456 | /* Basically, if the archetype has this key set, |
2490 | /* Basically, if the archetype has this key set, |
2457 | * we need to store the null value so when we save |
2491 | * we need to store the null value so when we save |
2458 | * it, we save the empty value so that when we load, |
2492 | * it, we save the empty value so that when we load, |
2459 | * we get this value back again. |
2493 | * we get this value back again. |
2460 | */ |
2494 | */ |
2461 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2495 | if (get_ob_key_link (op->arch, canonical_key)) |
2462 | field->value = 0; |
2496 | field->value = 0; |
2463 | else |
2497 | else |
2464 | { |
2498 | { |
2465 | if (last) |
2499 | if (last) |
2466 | last->next = field->next; |
2500 | last->next = field->next; |
… | |
… | |
2591 | } |
2625 | } |
2592 | |
2626 | |
2593 | const char * |
2627 | const char * |
2594 | object::debug_desc () const |
2628 | object::debug_desc () const |
2595 | { |
2629 | { |
2596 | static char info[256 * 4]; |
2630 | static char info[3][256 * 4]; |
|
|
2631 | static int info_idx; |
|
|
2632 | |
2597 | return debug_desc (info); |
2633 | return debug_desc (info [++info_idx % 3]); |
2598 | } |
|
|
2599 | |
|
|
2600 | const char * |
|
|
2601 | object::debug_desc2 () const |
|
|
2602 | { |
|
|
2603 | static char info[256 * 4]; |
|
|
2604 | return debug_desc (info); |
|
|
2605 | } |
2634 | } |
2606 | |
2635 | |
2607 | struct region * |
2636 | struct region * |
2608 | object::region () const |
2637 | object::region () const |
2609 | { |
2638 | { |