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 | |
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; |
… | |
… | |
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 | |
|
|
363 | char * |
364 | char * |
364 | dump_object (object *op) |
365 | dump_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 | |
|
|
455 | void |
|
|
456 | object::set_weapon (object *ob) |
|
|
457 | { |
|
|
458 | if (current_weapon == ob) |
|
|
459 | return; |
|
|
460 | |
|
|
461 | new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
462 | |
|
|
463 | if (chosen_skill) |
|
|
464 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
465 | |
|
|
466 | current_weapon = ob; |
|
|
467 | chosen_skill = ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
468 | |
|
|
469 | if (chosen_skill) |
|
|
470 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
471 | |
|
|
472 | update_stats (); |
|
|
473 | } |
|
|
474 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
475 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
476 | * refcounts and freeing the links. |
456 | */ |
477 | */ |
457 | static void |
478 | static void |
458 | free_key_values (object *op) |
479 | free_key_values (object *op) |
459 | { |
480 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
481 | for (key_value *i = op->key_values; i; ) |
461 | { |
482 | { |
462 | key_value *next = i->next; |
483 | key_value *next = i->next; |
463 | delete i; |
484 | delete i; |
464 | |
485 | |
465 | i = next; |
486 | i = next; |
466 | } |
487 | } |
467 | |
488 | |
468 | op->key_values = 0; |
489 | op->key_values = 0; |
469 | } |
490 | } |
470 | |
491 | |
471 | /* |
492 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
493 | object::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 | */ |
|
|
479 | void |
|
|
480 | object::copy_to (object *dst) |
|
|
481 | { |
494 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
495 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
496 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
497 | |
485 | *(object_copy *)dst = *this; |
498 | *(object_copy *)this = src; |
486 | |
499 | |
487 | if (is_freed) |
500 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
501 | 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 | |
502 | |
496 | /* Copy over key_values, if any. */ |
503 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
504 | if (src.key_values) |
498 | { |
505 | { |
499 | key_value *tail = 0; |
506 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
507 | key_values = 0; |
503 | |
508 | |
504 | for (i = key_values; i; i = i->next) |
509 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
510 | { |
506 | key_value *new_link = new key_value; |
511 | key_value *new_link = new key_value; |
507 | |
512 | |
508 | new_link->next = 0; |
513 | new_link->next = 0; |
509 | new_link->key = i->key; |
514 | new_link->key = i->key; |
510 | new_link->value = i->value; |
515 | new_link->value = i->value; |
511 | |
516 | |
512 | /* Try and be clever here, too. */ |
517 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
518 | if (!key_values) |
514 | { |
519 | { |
515 | dst->key_values = new_link; |
520 | key_values = new_link; |
516 | tail = new_link; |
521 | tail = new_link; |
517 | } |
522 | } |
518 | else |
523 | else |
519 | { |
524 | { |
520 | tail->next = new_link; |
525 | tail->next = new_link; |
521 | tail = new_link; |
526 | tail = new_link; |
522 | } |
527 | } |
523 | } |
528 | } |
524 | } |
529 | } |
|
|
530 | } |
|
|
531 | |
|
|
532 | /* |
|
|
533 | * copy_to first frees everything allocated by the dst object, |
|
|
534 | * and then copies the contents of itself into the second |
|
|
535 | * object, allocating what needs to be allocated. Basically, any |
|
|
536 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
537 | * if the first object is freed, the pointers in the new object |
|
|
538 | * will point at garbage. |
|
|
539 | */ |
|
|
540 | void |
|
|
541 | object::copy_to (object *dst) |
|
|
542 | { |
|
|
543 | *dst = *this; |
|
|
544 | |
|
|
545 | if (speed < 0) |
|
|
546 | dst->speed_left = speed_left - rndm (); |
525 | |
547 | |
526 | dst->set_speed (dst->speed); |
548 | dst->set_speed (dst->speed); |
|
|
549 | } |
|
|
550 | |
|
|
551 | void |
|
|
552 | object::instantiate () |
|
|
553 | { |
|
|
554 | if (!uuid.seq) // HACK |
|
|
555 | uuid = gen_uuid (); |
|
|
556 | |
|
|
557 | speed_left = -0.1f; |
|
|
558 | /* copy the body_info to the body_used - this is only really |
|
|
559 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
560 | * by doing so, when a monster is created, it has good starting |
|
|
561 | * values for the body_used info, so when items are created |
|
|
562 | * for it, they can be properly equipped. |
|
|
563 | */ |
|
|
564 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
565 | slot[i].used = slot[i].info; |
|
|
566 | |
|
|
567 | attachable::instantiate (); |
527 | } |
568 | } |
528 | |
569 | |
529 | object * |
570 | object * |
530 | object::clone () |
571 | object::clone () |
531 | { |
572 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
630 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
631 | */ |
591 | void |
632 | void |
592 | update_object (object *op, int action) |
633 | update_object (object *op, int action) |
593 | { |
634 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
635 | if (op == NULL) |
597 | { |
636 | { |
598 | /* this should never happen */ |
637 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
638 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
639 | return; |
… | |
… | |
819 | |
858 | |
820 | if (flag [FLAG_IS_LINKED]) |
859 | if (flag [FLAG_IS_LINKED]) |
821 | remove_button_link (this); |
860 | remove_button_link (this); |
822 | |
861 | |
823 | if (flag [FLAG_FRIENDLY]) |
862 | if (flag [FLAG_FRIENDLY]) |
824 | { |
|
|
825 | remove_friendly_object (this); |
863 | remove_friendly_object (this); |
826 | |
|
|
827 | if (type == GOLEM |
|
|
828 | && owner |
|
|
829 | && owner->type == PLAYER |
|
|
830 | && owner->contr->ranges[range_golem] == this) |
|
|
831 | owner->contr->ranges[range_golem] = 0; |
|
|
832 | } |
|
|
833 | |
864 | |
834 | if (!flag [FLAG_REMOVED]) |
865 | if (!flag [FLAG_REMOVED]) |
835 | remove (); |
866 | remove (); |
836 | |
867 | |
837 | destroy_inv (true); |
868 | destroy_inv (true); |
… | |
… | |
964 | } |
995 | } |
965 | else if (map) |
996 | else if (map) |
966 | { |
997 | { |
967 | if (type == PLAYER) |
998 | if (type == PLAYER) |
968 | { |
999 | { |
|
|
1000 | // leaving a spot always closes any open container on the ground |
|
|
1001 | if (container && !container->env) |
|
|
1002 | // this causes spurious floorbox updates, but it ensures |
|
|
1003 | // that the CLOSE event is being sent. |
|
|
1004 | close_container (); |
|
|
1005 | |
969 | --map->players; |
1006 | --map->players; |
970 | map->touch (); |
1007 | map->touch (); |
971 | } |
1008 | } |
972 | |
1009 | |
973 | map->dirty = true; |
1010 | map->dirty = true; |
… | |
… | |
1088 | return top; |
1125 | return top; |
1089 | } |
1126 | } |
1090 | } |
1127 | } |
1091 | |
1128 | |
1092 | return 0; |
1129 | return 0; |
|
|
1130 | } |
|
|
1131 | |
|
|
1132 | void |
|
|
1133 | object::expand_tail () |
|
|
1134 | { |
|
|
1135 | if (more) |
|
|
1136 | return; |
|
|
1137 | |
|
|
1138 | object *prev = this; |
|
|
1139 | |
|
|
1140 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1141 | { |
|
|
1142 | object *op = arch_to_object (at); |
|
|
1143 | |
|
|
1144 | op->name = name; |
|
|
1145 | op->name_pl = name_pl; |
|
|
1146 | op->title = title; |
|
|
1147 | |
|
|
1148 | op->head = this; |
|
|
1149 | prev->more = op; |
|
|
1150 | |
|
|
1151 | prev = op; |
|
|
1152 | } |
1093 | } |
1153 | } |
1094 | |
1154 | |
1095 | /* |
1155 | /* |
1096 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1156 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1097 | * job preparing multi-part monsters. |
1157 | * job preparing multi-part monsters. |
… | |
… | |
1129 | * just 'op' otherwise |
1189 | * just 'op' otherwise |
1130 | */ |
1190 | */ |
1131 | object * |
1191 | object * |
1132 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1192 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1133 | { |
1193 | { |
|
|
1194 | assert (!op->flag [FLAG_FREED]); |
|
|
1195 | |
1134 | object *tmp, *top, *floor = NULL; |
1196 | object *tmp, *top, *floor = NULL; |
1135 | |
1197 | |
1136 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1137 | { |
|
|
1138 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1139 | return NULL; |
|
|
1140 | } |
|
|
1141 | |
|
|
1142 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1143 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1144 | |
|
|
1145 | op->remove (); |
1198 | op->remove (); |
1146 | |
1199 | |
1147 | if (!m) |
1200 | #if 0 |
1148 | { |
1201 | if (!m->active != !op->active) |
1149 | char *dump = dump_object (op); |
1202 | if (m->active) |
1150 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1203 | op->activate_recursive (); |
1151 | free (dump); |
1204 | else |
1152 | return op; |
1205 | op->deactivate_recursive (); |
1153 | } |
1206 | #endif |
1154 | |
1207 | |
1155 | if (out_of_map (m, op->x, op->y)) |
1208 | if (out_of_map (m, op->x, op->y)) |
1156 | { |
1209 | { |
1157 | char *dump = dump_object (op); |
|
|
1158 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1210 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1159 | #ifdef MANY_CORES |
1211 | #ifdef MANY_CORES |
1160 | /* Better to catch this here, as otherwise the next use of this object |
1212 | /* Better to catch this here, as otherwise the next use of this object |
1161 | * is likely to cause a crash. Better to find out where it is getting |
1213 | * is likely to cause a crash. Better to find out where it is getting |
1162 | * improperly inserted. |
1214 | * improperly inserted. |
1163 | */ |
1215 | */ |
1164 | abort (); |
1216 | abort (); |
1165 | #endif |
1217 | #endif |
1166 | free (dump); |
|
|
1167 | return op; |
1218 | return op; |
1168 | } |
1219 | } |
1169 | |
1220 | |
1170 | if (object *more = op->more) |
1221 | if (object *more = op->more) |
1171 | { |
1222 | { |
… | |
… | |
1268 | * looks like instead of lots of conditions here. |
1319 | * looks like instead of lots of conditions here. |
1269 | * makes things faster, and effectively the same result. |
1320 | * makes things faster, and effectively the same result. |
1270 | */ |
1321 | */ |
1271 | |
1322 | |
1272 | /* Have object 'fall below' other objects that block view. |
1323 | /* Have object 'fall below' other objects that block view. |
1273 | * Unless those objects are exits, type 66 |
1324 | * Unless those objects are exits. |
1274 | * If INS_ON_TOP is used, don't do this processing |
1325 | * If INS_ON_TOP is used, don't do this processing |
1275 | * Need to find the object that in fact blocks view, otherwise |
1326 | * Need to find the object that in fact blocks view, otherwise |
1276 | * stacking is a bit odd. |
1327 | * stacking is a bit odd. |
1277 | */ |
1328 | */ |
1278 | if (!(flag & INS_ON_TOP) |
1329 | if (!(flag & INS_ON_TOP) |
1279 | && ms.flags () & P_BLOCKSVIEW |
1330 | && ms.flags () & P_BLOCKSVIEW |
1280 | && (op->face && !op->face->visibility)) |
1331 | && (op->face && !faces [op->face].visibility)) |
1281 | { |
1332 | { |
1282 | for (last = top; last != floor; last = last->below) |
1333 | for (last = top; last != floor; last = last->below) |
1283 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1334 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1284 | break; |
1335 | break; |
1285 | |
1336 | |
… | |
… | |
1411 | } |
1462 | } |
1412 | |
1463 | |
1413 | object * |
1464 | object * |
1414 | object::insert_at (object *where, object *originator, int flags) |
1465 | object::insert_at (object *where, object *originator, int flags) |
1415 | { |
1466 | { |
1416 | where->map->insert (this, where->x, where->y, originator, flags); |
1467 | return where->map->insert (this, where->x, where->y, originator, flags); |
1417 | } |
1468 | } |
1418 | |
1469 | |
1419 | /* |
1470 | /* |
1420 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1471 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1421 | * is returned contains nr objects, and the remaining parts contains |
1472 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1461 | * the amount of an object. If the amount reaches 0, the object |
1512 | * the amount of an object. If the amount reaches 0, the object |
1462 | * is subsequently removed and freed. |
1513 | * is subsequently removed and freed. |
1463 | * |
1514 | * |
1464 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1515 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1465 | */ |
1516 | */ |
1466 | |
|
|
1467 | object * |
1517 | object * |
1468 | decrease_ob_nr (object *op, uint32 i) |
1518 | decrease_ob_nr (object *op, uint32 i) |
1469 | { |
1519 | { |
1470 | object *tmp; |
1520 | object *tmp; |
1471 | |
1521 | |
… | |
… | |
1546 | |
1596 | |
1547 | /* |
1597 | /* |
1548 | * add_weight(object, weight) adds the specified weight to an object, |
1598 | * add_weight(object, weight) adds the specified weight to an object, |
1549 | * and also updates how much the environment(s) is/are carrying. |
1599 | * and also updates how much the environment(s) is/are carrying. |
1550 | */ |
1600 | */ |
1551 | |
|
|
1552 | void |
1601 | void |
1553 | add_weight (object *op, signed long weight) |
1602 | add_weight (object *op, signed long weight) |
1554 | { |
1603 | { |
1555 | while (op != NULL) |
1604 | while (op != NULL) |
1556 | { |
1605 | { |
… | |
… | |
1588 | * inside the object environment. |
1637 | * inside the object environment. |
1589 | * |
1638 | * |
1590 | * The function returns now pointer to inserted item, and return value can |
1639 | * The function returns now pointer to inserted item, and return value can |
1591 | * be != op, if items are merged. -Tero |
1640 | * be != op, if items are merged. -Tero |
1592 | */ |
1641 | */ |
1593 | |
|
|
1594 | object * |
1642 | object * |
1595 | object::insert (object *op) |
1643 | object::insert (object *op) |
1596 | { |
1644 | { |
1597 | object *tmp, *otmp; |
1645 | object *tmp, *otmp; |
1598 | |
1646 | |
… | |
… | |
2328 | insert_ob_in_ob (object_create_clone (item), dst); |
2376 | insert_ob_in_ob (object_create_clone (item), dst); |
2329 | |
2377 | |
2330 | return dst; |
2378 | return dst; |
2331 | } |
2379 | } |
2332 | |
2380 | |
2333 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2334 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2335 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2336 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2337 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2338 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2339 | object * |
|
|
2340 | load_object_str (const char *obstr) |
|
|
2341 | { |
|
|
2342 | object *op; |
|
|
2343 | char filename[MAX_BUF]; |
|
|
2344 | |
|
|
2345 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2346 | |
|
|
2347 | FILE *tempfile = fopen (filename, "w"); |
|
|
2348 | |
|
|
2349 | if (tempfile == NULL) |
|
|
2350 | { |
|
|
2351 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2352 | return NULL; |
|
|
2353 | } |
|
|
2354 | |
|
|
2355 | fprintf (tempfile, obstr); |
|
|
2356 | fclose (tempfile); |
|
|
2357 | |
|
|
2358 | op = object::create (); |
|
|
2359 | |
|
|
2360 | object_thawer thawer (filename); |
|
|
2361 | |
|
|
2362 | if (thawer) |
|
|
2363 | load_object (thawer, op, 0); |
|
|
2364 | |
|
|
2365 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2366 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2367 | |
|
|
2368 | return op; |
|
|
2369 | } |
|
|
2370 | |
|
|
2371 | /* This returns the first object in who's inventory that |
2381 | /* This returns the first object in who's inventory that |
2372 | * has the same type and subtype match. |
2382 | * has the same type and subtype match. |
2373 | * returns NULL if no match. |
2383 | * returns NULL if no match. |
2374 | */ |
2384 | */ |
2375 | object * |
2385 | object * |
… | |
… | |
2428 | if (link->key == canonical_key) |
2438 | if (link->key == canonical_key) |
2429 | return link->value; |
2439 | return link->value; |
2430 | |
2440 | |
2431 | return 0; |
2441 | return 0; |
2432 | } |
2442 | } |
2433 | |
|
|
2434 | |
2443 | |
2435 | /* |
2444 | /* |
2436 | * Updates the canonical_key in op to value. |
2445 | * Updates the canonical_key in op to value. |
2437 | * |
2446 | * |
2438 | * canonical_key is a shared string (value doesn't have to be). |
2447 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2597 | } |
2606 | } |
2598 | |
2607 | |
2599 | const char * |
2608 | const char * |
2600 | object::debug_desc () const |
2609 | object::debug_desc () const |
2601 | { |
2610 | { |
2602 | static char info[256 * 4]; |
2611 | static char info[3][256 * 4]; |
|
|
2612 | static int info_idx; |
|
|
2613 | |
2603 | return debug_desc (info); |
2614 | return debug_desc (info [++info_idx % 3]); |
2604 | } |
|
|
2605 | |
|
|
2606 | const char * |
|
|
2607 | object::debug_desc2 () const |
|
|
2608 | { |
|
|
2609 | static char info[256 * 4]; |
|
|
2610 | return debug_desc (info); |
|
|
2611 | } |
2615 | } |
2612 | |
2616 | |
2613 | struct region * |
2617 | struct region * |
2614 | object::region () const |
2618 | object::region () const |
2615 | { |
2619 | { |
… | |
… | |
2627 | shstr unknown ("unknown"); |
2631 | shstr unknown ("unknown"); |
2628 | |
2632 | |
2629 | return name_to_material (unknown); |
2633 | return name_to_material (unknown); |
2630 | } |
2634 | } |
2631 | |
2635 | |
|
|
2636 | void |
|
|
2637 | object::open_container (object *new_container) |
|
|
2638 | { |
|
|
2639 | if (container == new_container) |
|
|
2640 | return; |
|
|
2641 | |
|
|
2642 | if (object *old_container = container) |
|
|
2643 | { |
|
|
2644 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2645 | return; |
|
|
2646 | |
|
|
2647 | #if 0 |
|
|
2648 | // remove the "Close old_container" object. |
|
|
2649 | if (object *closer = old_container->inv) |
|
|
2650 | if (closer->type == CLOSE_CON) |
|
|
2651 | closer->destroy (); |
|
|
2652 | #endif |
|
|
2653 | |
|
|
2654 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2655 | container = 0; |
|
|
2656 | |
|
|
2657 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2658 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2659 | } |
|
|
2660 | |
|
|
2661 | if (new_container) |
|
|
2662 | { |
|
|
2663 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2664 | return; |
|
|
2665 | |
|
|
2666 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2667 | #if 0 |
|
|
2668 | // insert the "Close Container" object. |
|
|
2669 | if (archetype *closer = new_container->other_arch) |
|
|
2670 | { |
|
|
2671 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2672 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2673 | new_container->insert (closer); |
|
|
2674 | } |
|
|
2675 | #endif |
|
|
2676 | |
|
|
2677 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2678 | |
|
|
2679 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2680 | container = new_container; |
|
|
2681 | |
|
|
2682 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2683 | esrv_send_inventory (this, new_container); |
|
|
2684 | } |
|
|
2685 | } |
|
|
2686 | |
|
|
2687 | |