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.119 by root, Fri Jan 19 18:06:51 2007 UTC vs.
Revision 1.147 by root, Sat May 12 16:06:42 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;
357/* 359/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 360 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 361 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 362 * The result of the dump is stored in the static global errmsg array.
361 */ 363 */
362
363char * 364char *
364dump_object (object *op) 365dump_object (object *op)
365{ 366{
366 if (!op) 367 if (!op)
367 return strdup ("[NULLOBJ]"); 368 return strdup ("[NULLOBJ]");
368 369
369 object_freezer freezer; 370 object_freezer freezer;
370 save_object (freezer, op, 1); 371 op->write (freezer);
371 return freezer.as_string (); 372 return freezer.as_string ();
372} 373}
373 374
374/* 375/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 376 * get_nearest_part(multi-object, object 2) returns the part of the
449 owner = owner->owner; 450 owner = owner->owner;
450 451
451 this->owner = owner; 452 this->owner = owner;
452} 453}
453 454
455bool
456object::change_weapon (object *ob)
457{
458 if (current_weapon == ob)
459 return true;
460
461 if (chosen_skill)
462 chosen_skill->flag [FLAG_APPLIED] = false;
463
464 current_weapon = ob;
465 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
466
467 if (chosen_skill)
468 chosen_skill->flag [FLAG_APPLIED] = true;
469
470 update_stats ();
471
472 if (ob)
473 {
474 // now check wether any body locations became invalid, in which case
475 // we cannot apply the weapon at the moment.
476 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
477 if (slot[i].used < 0)
478 {
479 current_weapon = chosen_skill = 0;
480 update_stats ();
481
482 new_draw_info_format (NDI_UNIQUE, 0, this,
483 "You try to balance your applied items all at once, but the %s is too much. "
484 "You need to unapply some items first.", &ob->name);
485 return false;
486 }
487
488 new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
489 }
490 else
491 new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
492
493 return true;
494}
495
454/* Zero the key_values on op, decrementing the shared-string 496/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 497 * refcounts and freeing the links.
456 */ 498 */
457static void 499static void
458free_key_values (object *op) 500free_key_values (object *op)
459{ 501{
460 for (key_value *i = op->key_values; i != 0;) 502 for (key_value *i = op->key_values; i; )
461 { 503 {
462 key_value *next = i->next; 504 key_value *next = i->next;
463 delete i; 505 delete i;
464 506
465 i = next; 507 i = next;
466 } 508 }
467 509
468 op->key_values = 0; 510 op->key_values = 0;
469} 511}
470 512
471/* 513object &
472 * copy_to first frees everything allocated by the dst object, 514object::operator =(const object &src)
473 * and then copies the contents of itself into the second
474 * object, allocating what needs to be allocated. Basically, any
475 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
476 * if the first object is freed, the pointers in the new object
477 * will point at garbage.
478 */
479void
480object::copy_to (object *dst)
481{ 515{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 516 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 517 bool is_removed = flag [FLAG_REMOVED];
484 518
485 *(object_copy *)dst = *this; 519 *(object_copy *)this = src;
486 520
487 if (is_freed) 521 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 522 flag [FLAG_REMOVED] = is_removed;
489
490 if (is_removed)
491 SET_FLAG (dst, FLAG_REMOVED);
492
493 if (speed < 0)
494 dst->speed_left = speed_left - rndm ();
495 523
496 /* Copy over key_values, if any. */ 524 /* Copy over key_values, if any. */
497 if (key_values) 525 if (src.key_values)
498 { 526 {
499 key_value *tail = 0; 527 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 528 key_values = 0;
503 529
504 for (i = key_values; i; i = i->next) 530 for (key_value *i = src.key_values; i; i = i->next)
505 { 531 {
506 key_value *new_link = new key_value; 532 key_value *new_link = new key_value;
507 533
508 new_link->next = 0; 534 new_link->next = 0;
509 new_link->key = i->key; 535 new_link->key = i->key;
510 new_link->value = i->value; 536 new_link->value = i->value;
511 537
512 /* Try and be clever here, too. */ 538 /* Try and be clever here, too. */
513 if (!dst->key_values) 539 if (!key_values)
514 { 540 {
515 dst->key_values = new_link; 541 key_values = new_link;
516 tail = new_link; 542 tail = new_link;
517 } 543 }
518 else 544 else
519 { 545 {
520 tail->next = new_link; 546 tail->next = new_link;
521 tail = new_link; 547 tail = new_link;
522 } 548 }
523 } 549 }
524 } 550 }
551}
552
553/*
554 * copy_to first frees everything allocated by the dst object,
555 * and then copies the contents of itself into the second
556 * object, allocating what needs to be allocated. Basically, any
557 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
558 * if the first object is freed, the pointers in the new object
559 * will point at garbage.
560 */
561void
562object::copy_to (object *dst)
563{
564 *dst = *this;
565
566 if (speed < 0)
567 dst->speed_left = speed_left - rndm ();
525 568
526 dst->set_speed (dst->speed); 569 dst->set_speed (dst->speed);
570}
571
572void
573object::instantiate ()
574{
575 if (!uuid.seq) // HACK
576 uuid = gen_uuid ();
577
578 speed_left = -0.1f;
579 /* copy the body_info to the body_used - this is only really
580 * need for monsters, but doesn't hurt to do it for everything.
581 * by doing so, when a monster is created, it has good starting
582 * values for the body_used info, so when items are created
583 * for it, they can be properly equipped.
584 */
585 for (int i = NUM_BODY_LOCATIONS; i--; )
586 slot[i].used = slot[i].info;
587
588 attachable::instantiate ();
527} 589}
528 590
529object * 591object *
530object::clone () 592object::clone ()
531{ 593{
589 * UP_OBJ_FACE: only the objects face has changed. 651 * UP_OBJ_FACE: only the objects face has changed.
590 */ 652 */
591void 653void
592update_object (object *op, int action) 654update_object (object *op, int action)
593{ 655{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 656 if (op == NULL)
597 { 657 {
598 /* this should never happen */ 658 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 659 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 660 return;
670 face = blank_face; 730 face = blank_face;
671} 731}
672 732
673object::~object () 733object::~object ()
674{ 734{
675 if (index)
676 unlink (); 735 unlink ();
677 736
678 free_key_values (this); 737 free_key_values (this);
679} 738}
680 739
681static int object_count; 740static int object_count;
690 objects.insert (this); 749 objects.insert (this);
691} 750}
692 751
693void object::unlink () 752void object::unlink ()
694{ 753{
695 assert (index);//D 754 if (!index)
755 return;
756
696 objects.erase (this); 757 objects.erase (this);
697 refcnt_dec (); 758 refcnt_dec ();
698} 759}
699 760
700void 761void
774 * drop on that space. 835 * drop on that space.
775 */ 836 */
776 if (!drop_to_ground 837 if (!drop_to_ground
777 || !map 838 || !map
778 || map->in_memory != MAP_IN_MEMORY 839 || map->in_memory != MAP_IN_MEMORY
840 || map->nodrop
779 || ms ().move_block == MOVE_ALL) 841 || ms ().move_block == MOVE_ALL)
780 { 842 {
781 while (inv) 843 while (inv)
782 { 844 {
783 inv->destroy_inv (drop_to_ground); 845 inv->destroy_inv (drop_to_ground);
899 * This function removes the object op from the linked list of objects 961 * This function removes the object op from the linked list of objects
900 * which it is currently tied to. When this function is done, the 962 * which it is currently tied to. When this function is done, the
901 * object will have no environment. If the object previously had an 963 * object will have no environment. If the object previously had an
902 * environment, the x and y coordinates will be updated to 964 * environment, the x and y coordinates will be updated to
903 * the previous environment. 965 * the previous environment.
904 * Beware: This function is called from the editor as well!
905 */ 966 */
906void 967void
907object::remove_slow () 968object::do_remove ()
908{ 969{
909 object *tmp, *last = 0; 970 object *tmp, *last = 0;
910 object *otmp; 971 object *otmp;
911 972
912 if (QUERY_FLAG (this, FLAG_REMOVED)) 973 if (QUERY_FLAG (this, FLAG_REMOVED))
955 } 1016 }
956 else if (map) 1017 else if (map)
957 { 1018 {
958 if (type == PLAYER) 1019 if (type == PLAYER)
959 { 1020 {
1021 // leaving a spot always closes any open container on the ground
1022 if (container && !container->env)
1023 // this causes spurious floorbox updates, but it ensures
1024 // that the CLOSE event is being sent.
1025 close_container ();
1026
960 --map->players; 1027 --map->players;
961 map->touch (); 1028 map->touch ();
962 } 1029 }
963 1030
964 map->dirty = true; 1031 map->dirty = true;
1079 return top; 1146 return top;
1080 } 1147 }
1081 } 1148 }
1082 1149
1083 return 0; 1150 return 0;
1151}
1152
1153void
1154object::expand_tail ()
1155{
1156 if (more)
1157 return;
1158
1159 object *prev = this;
1160
1161 for (archetype *at = arch->more; at; at = at->more)
1162 {
1163 object *op = arch_to_object (at);
1164
1165 op->name = name;
1166 op->name_pl = name_pl;
1167 op->title = title;
1168
1169 op->head = this;
1170 prev->more = op;
1171
1172 prev = op;
1173 }
1084} 1174}
1085 1175
1086/* 1176/*
1087 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1177 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1088 * job preparing multi-part monsters. 1178 * job preparing multi-part monsters.
1120 * just 'op' otherwise 1210 * just 'op' otherwise
1121 */ 1211 */
1122object * 1212object *
1123insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1213insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1124{ 1214{
1215 assert (!op->flag [FLAG_FREED]);
1216
1125 object *tmp, *top, *floor = NULL; 1217 object *tmp, *top, *floor = NULL;
1126 1218
1127 if (QUERY_FLAG (op, FLAG_FREED))
1128 {
1129 LOG (llevError, "Trying to insert freed object!\n");
1130 return NULL;
1131 }
1132
1133 if (!QUERY_FLAG (op, FLAG_REMOVED))
1134 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1135
1136 op->remove (); 1219 op->remove ();
1137 1220
1138 if (!m) 1221#if 0
1139 { 1222 if (!m->active != !op->active)
1140 char *dump = dump_object (op); 1223 if (m->active)
1141 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1224 op->activate_recursive ();
1142 free (dump); 1225 else
1143 return op; 1226 op->deactivate_recursive ();
1144 } 1227#endif
1145 1228
1146 if (out_of_map (m, op->x, op->y)) 1229 if (out_of_map (m, op->x, op->y))
1147 { 1230 {
1148 char *dump = dump_object (op);
1149 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1231 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1150#ifdef MANY_CORES 1232#ifdef MANY_CORES
1151 /* Better to catch this here, as otherwise the next use of this object 1233 /* Better to catch this here, as otherwise the next use of this object
1152 * is likely to cause a crash. Better to find out where it is getting 1234 * is likely to cause a crash. Better to find out where it is getting
1153 * improperly inserted. 1235 * improperly inserted.
1154 */ 1236 */
1155 abort (); 1237 abort ();
1156#endif 1238#endif
1157 free (dump);
1158 return op; 1239 return op;
1159 } 1240 }
1160 1241
1161 if (object *more = op->more) 1242 if (object *more = op->more)
1162 { 1243 {
1259 * looks like instead of lots of conditions here. 1340 * looks like instead of lots of conditions here.
1260 * makes things faster, and effectively the same result. 1341 * makes things faster, and effectively the same result.
1261 */ 1342 */
1262 1343
1263 /* Have object 'fall below' other objects that block view. 1344 /* Have object 'fall below' other objects that block view.
1264 * Unless those objects are exits, type 66 1345 * Unless those objects are exits.
1265 * If INS_ON_TOP is used, don't do this processing 1346 * If INS_ON_TOP is used, don't do this processing
1266 * Need to find the object that in fact blocks view, otherwise 1347 * Need to find the object that in fact blocks view, otherwise
1267 * stacking is a bit odd. 1348 * stacking is a bit odd.
1268 */ 1349 */
1269 if (!(flag & INS_ON_TOP) 1350 if (!(flag & INS_ON_TOP)
1270 && ms.flags () & P_BLOCKSVIEW 1351 && ms.flags () & P_BLOCKSVIEW
1271 && (op->face && !op->face->visibility)) 1352 && (op->face && !faces [op->face].visibility))
1272 { 1353 {
1273 for (last = top; last != floor; last = last->below) 1354 for (last = top; last != floor; last = last->below)
1274 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1355 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1275 break; 1356 break;
1276 1357
1402} 1483}
1403 1484
1404object * 1485object *
1405object::insert_at (object *where, object *originator, int flags) 1486object::insert_at (object *where, object *originator, int flags)
1406{ 1487{
1407 where->map->insert (this, where->x, where->y, originator, flags); 1488 return where->map->insert (this, where->x, where->y, originator, flags);
1408} 1489}
1409 1490
1410/* 1491/*
1411 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1492 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1412 * is returned contains nr objects, and the remaining parts contains 1493 * is returned contains nr objects, and the remaining parts contains
1452 * the amount of an object. If the amount reaches 0, the object 1533 * the amount of an object. If the amount reaches 0, the object
1453 * is subsequently removed and freed. 1534 * is subsequently removed and freed.
1454 * 1535 *
1455 * Return value: 'op' if something is left, NULL if the amount reached 0 1536 * Return value: 'op' if something is left, NULL if the amount reached 0
1456 */ 1537 */
1457
1458object * 1538object *
1459decrease_ob_nr (object *op, uint32 i) 1539decrease_ob_nr (object *op, uint32 i)
1460{ 1540{
1461 object *tmp; 1541 object *tmp;
1462 1542
1537 1617
1538/* 1618/*
1539 * add_weight(object, weight) adds the specified weight to an object, 1619 * add_weight(object, weight) adds the specified weight to an object,
1540 * and also updates how much the environment(s) is/are carrying. 1620 * and also updates how much the environment(s) is/are carrying.
1541 */ 1621 */
1542
1543void 1622void
1544add_weight (object *op, signed long weight) 1623add_weight (object *op, signed long weight)
1545{ 1624{
1546 while (op != NULL) 1625 while (op != NULL)
1547 { 1626 {
1579 * inside the object environment. 1658 * inside the object environment.
1580 * 1659 *
1581 * The function returns now pointer to inserted item, and return value can 1660 * The function returns now pointer to inserted item, and return value can
1582 * be != op, if items are merged. -Tero 1661 * be != op, if items are merged. -Tero
1583 */ 1662 */
1584
1585object * 1663object *
1586object::insert (object *op) 1664object::insert (object *op)
1587{ 1665{
1588 object *tmp, *otmp; 1666 object *tmp, *otmp;
1589 1667
1749 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1827 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1750 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1828 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1751 { 1829 {
1752 1830
1753 float 1831 float
1754 diff = tmp->move_slow_penalty * FABS (op->speed); 1832 diff = tmp->move_slow_penalty * fabs (op->speed);
1755 1833
1756 if (op->type == PLAYER) 1834 if (op->type == PLAYER)
1757 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1835 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1758 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1836 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1759 diff /= 4.0; 1837 diff /= 4.0;
1966 } 2044 }
1967 2045
1968 if (!index) 2046 if (!index)
1969 return -1; 2047 return -1;
1970 2048
1971 return altern[RANDOM () % index]; 2049 return altern [rndm (index)];
1972} 2050}
1973 2051
1974/* 2052/*
1975 * find_first_free_spot(archetype, maptile, x, y) works like 2053 * find_first_free_spot(archetype, maptile, x, y) works like
1976 * find_free_spot(), but it will search max number of squares. 2054 * find_free_spot(), but it will search max number of squares.
1997{ 2075{
1998 arr += begin; 2076 arr += begin;
1999 end -= begin; 2077 end -= begin;
2000 2078
2001 while (--end) 2079 while (--end)
2002 swap (arr [end], arr [RANDOM () % (end + 1)]); 2080 swap (arr [end], arr [rndm (end + 1)]);
2003} 2081}
2004 2082
2005/* new function to make monster searching more efficient, and effective! 2083/* new function to make monster searching more efficient, and effective!
2006 * This basically returns a randomized array (in the passed pointer) of 2084 * This basically returns a randomized array (in the passed pointer) of
2007 * the spaces to find monsters. In this way, it won't always look for 2085 * the spaces to find monsters. In this way, it won't always look for
2319 insert_ob_in_ob (object_create_clone (item), dst); 2397 insert_ob_in_ob (object_create_clone (item), dst);
2320 2398
2321 return dst; 2399 return dst;
2322} 2400}
2323 2401
2324/* GROS - Creates an object using a string representing its content. */
2325/* Basically, we save the content of the string to a temp file, then call */
2326/* load_object on it. I admit it is a highly inefficient way to make things, */
2327/* but it was simple to make and allows reusing the load_object function. */
2328/* Remember not to use load_object_str in a time-critical situation. */
2329/* Also remember that multiparts objects are not supported for now. */
2330object *
2331load_object_str (const char *obstr)
2332{
2333 object *op;
2334 char filename[MAX_BUF];
2335
2336 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2337
2338 FILE *tempfile = fopen (filename, "w");
2339
2340 if (tempfile == NULL)
2341 {
2342 LOG (llevError, "Error - Unable to access load object temp file\n");
2343 return NULL;
2344 }
2345
2346 fprintf (tempfile, obstr);
2347 fclose (tempfile);
2348
2349 op = object::create ();
2350
2351 object_thawer thawer (filename);
2352
2353 if (thawer)
2354 load_object (thawer, op, 0);
2355
2356 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2357 CLEAR_FLAG (op, FLAG_REMOVED);
2358
2359 return op;
2360}
2361
2362/* This returns the first object in who's inventory that 2402/* This returns the first object in who's inventory that
2363 * has the same type and subtype match. 2403 * has the same type and subtype match.
2364 * returns NULL if no match. 2404 * returns NULL if no match.
2365 */ 2405 */
2366object * 2406object *
2419 if (link->key == canonical_key) 2459 if (link->key == canonical_key)
2420 return link->value; 2460 return link->value;
2421 2461
2422 return 0; 2462 return 0;
2423} 2463}
2424
2425 2464
2426/* 2465/*
2427 * Updates the canonical_key in op to value. 2466 * Updates the canonical_key in op to value.
2428 * 2467 *
2429 * canonical_key is a shared string (value doesn't have to be). 2468 * canonical_key is a shared string (value doesn't have to be).
2569{ 2608{
2570 char flagdesc[512]; 2609 char flagdesc[512];
2571 char info2[256 * 4]; 2610 char info2[256 * 4];
2572 char *p = info; 2611 char *p = info;
2573 2612
2574 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2613 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2575 count, uuid.seq, 2614 count, uuid.seq,
2576 &name, 2615 &name,
2577 title ? "\",title:\"" : "", 2616 title ? "\",title:\"" : "",
2578 title ? (const char *)title : "", 2617 title ? (const char *)title : "",
2579 flag_desc (flagdesc, 512), type); 2618 flag_desc (flagdesc, 512), type);
2588} 2627}
2589 2628
2590const char * 2629const char *
2591object::debug_desc () const 2630object::debug_desc () const
2592{ 2631{
2593 static char info[256 * 4]; 2632 static char info[3][256 * 4];
2633 static int info_idx;
2634
2594 return debug_desc (info); 2635 return debug_desc (info [++info_idx % 3]);
2595} 2636}
2596 2637
2597const char * 2638struct region *
2598object::debug_desc2 () const 2639object::region () const
2599{ 2640{
2600 static char info[256 * 4]; 2641 return map ? map->region (x, y)
2601 return debug_desc (info); 2642 : region::default_region ();
2602} 2643}
2603 2644
2645const materialtype_t *
2646object::dominant_material () const
2647{
2648 if (materialtype_t *mat = name_to_material (materialname))
2649 return mat;
2650
2651 // omfg this is slow, this has to be temporary :)
2652 shstr unknown ("unknown");
2653
2654 return name_to_material (unknown);
2655}
2656
2657void
2658object::open_container (object *new_container)
2659{
2660 if (container == new_container)
2661 return;
2662
2663 if (object *old_container = container)
2664 {
2665 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2666 return;
2667
2668#if 0
2669 // remove the "Close old_container" object.
2670 if (object *closer = old_container->inv)
2671 if (closer->type == CLOSE_CON)
2672 closer->destroy ();
2673#endif
2674
2675 old_container->flag [FLAG_APPLIED] = 0;
2676 container = 0;
2677
2678 esrv_update_item (UPD_FLAGS, this, old_container);
2679 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2680 }
2681
2682 if (new_container)
2683 {
2684 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2685 return;
2686
2687 // TODO: this does not seem to serve any purpose anymore?
2688#if 0
2689 // insert the "Close Container" object.
2690 if (archetype *closer = new_container->other_arch)
2691 {
2692 object *closer = arch_to_object (new_container->other_arch);
2693 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2694 new_container->insert (closer);
2695 }
2696#endif
2697
2698 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2699
2700 new_container->flag [FLAG_APPLIED] = 1;
2701 container = new_container;
2702
2703 esrv_update_item (UPD_FLAGS, this, new_container);
2704 esrv_send_inventory (this, new_container);
2705 }
2706}
2707
2708

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines