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 | * |
… | |
… | |
324 | sum_weight (object *op) |
324 | sum_weight (object *op) |
325 | { |
325 | { |
326 | long sum; |
326 | long sum; |
327 | object *inv; |
327 | object *inv; |
328 | |
328 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
329 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
330 | { |
330 | { |
331 | if (inv->inv) |
331 | if (inv->inv) |
332 | sum_weight (inv); |
332 | sum_weight (inv); |
|
|
333 | |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
334 | } |
335 | } |
335 | |
336 | |
336 | if (op->type == CONTAINER && op->stats.Str) |
337 | if (op->type == CONTAINER && op->stats.Str) |
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
338 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
357 | /* |
358 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
360 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
361 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
362 | */ |
362 | |
|
|
363 | char * |
363 | char * |
364 | dump_object (object *op) |
364 | dump_object (object *op) |
365 | { |
365 | { |
366 | if (!op) |
366 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
367 | return strdup ("[NULLOBJ]"); |
368 | |
368 | |
369 | object_freezer freezer; |
369 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
370 | op->write (freezer); |
371 | return freezer.as_string (); |
371 | return freezer.as_string (); |
372 | } |
372 | } |
373 | |
373 | |
374 | /* |
374 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
455 | * refcounts and freeing the links. |
455 | * refcounts and freeing the links. |
456 | */ |
456 | */ |
457 | static void |
457 | static void |
458 | free_key_values (object *op) |
458 | free_key_values (object *op) |
459 | { |
459 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
460 | for (key_value *i = op->key_values; i; ) |
461 | { |
461 | { |
462 | key_value *next = i->next; |
462 | key_value *next = i->next; |
463 | delete i; |
463 | delete i; |
464 | |
464 | |
465 | i = next; |
465 | i = next; |
466 | } |
466 | } |
467 | |
467 | |
468 | op->key_values = 0; |
468 | op->key_values = 0; |
469 | } |
469 | } |
470 | |
470 | |
471 | /* |
471 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
472 | 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 | { |
473 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
474 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
475 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
476 | |
485 | *(object_copy *)dst = *this; |
477 | *(object_copy *)this = src; |
486 | |
478 | |
487 | if (is_freed) |
479 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
480 | 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 | |
481 | |
496 | /* Copy over key_values, if any. */ |
482 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
483 | if (src.key_values) |
498 | { |
484 | { |
499 | key_value *tail = 0; |
485 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
486 | key_values = 0; |
503 | |
487 | |
504 | for (i = key_values; i; i = i->next) |
488 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
489 | { |
506 | key_value *new_link = new key_value; |
490 | key_value *new_link = new key_value; |
507 | |
491 | |
508 | new_link->next = 0; |
492 | new_link->next = 0; |
509 | new_link->key = i->key; |
493 | new_link->key = i->key; |
510 | new_link->value = i->value; |
494 | new_link->value = i->value; |
511 | |
495 | |
512 | /* Try and be clever here, too. */ |
496 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
497 | if (!key_values) |
514 | { |
498 | { |
515 | dst->key_values = new_link; |
499 | key_values = new_link; |
516 | tail = new_link; |
500 | tail = new_link; |
517 | } |
501 | } |
518 | else |
502 | else |
519 | { |
503 | { |
520 | tail->next = new_link; |
504 | tail->next = new_link; |
521 | tail = new_link; |
505 | tail = new_link; |
522 | } |
506 | } |
523 | } |
507 | } |
524 | } |
508 | } |
|
|
509 | } |
|
|
510 | |
|
|
511 | /* |
|
|
512 | * copy_to first frees everything allocated by the dst object, |
|
|
513 | * and then copies the contents of itself into the second |
|
|
514 | * object, allocating what needs to be allocated. Basically, any |
|
|
515 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
516 | * if the first object is freed, the pointers in the new object |
|
|
517 | * will point at garbage. |
|
|
518 | */ |
|
|
519 | void |
|
|
520 | object::copy_to (object *dst) |
|
|
521 | { |
|
|
522 | *dst = *this; |
|
|
523 | |
|
|
524 | if (speed < 0) |
|
|
525 | dst->speed_left = speed_left - rndm (); |
525 | |
526 | |
526 | dst->set_speed (dst->speed); |
527 | dst->set_speed (dst->speed); |
|
|
528 | } |
|
|
529 | |
|
|
530 | void |
|
|
531 | object::instantiate () |
|
|
532 | { |
|
|
533 | if (!uuid.seq) // HACK |
|
|
534 | uuid = gen_uuid (); |
|
|
535 | |
|
|
536 | speed_left = -0.1f; |
|
|
537 | /* copy the body_info to the body_used - this is only really |
|
|
538 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
539 | * by doing so, when a monster is created, it has good starting |
|
|
540 | * values for the body_used info, so when items are created |
|
|
541 | * for it, they can be properly equipped. |
|
|
542 | */ |
|
|
543 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
544 | |
|
|
545 | attachable::instantiate (); |
527 | } |
546 | } |
528 | |
547 | |
529 | object * |
548 | object * |
530 | object::clone () |
549 | object::clone () |
531 | { |
550 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
608 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
609 | */ |
591 | void |
610 | void |
592 | update_object (object *op, int action) |
611 | update_object (object *op, int action) |
593 | { |
612 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
613 | if (op == NULL) |
597 | { |
614 | { |
598 | /* this should never happen */ |
615 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
616 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
617 | return; |
… | |
… | |
670 | face = blank_face; |
687 | face = blank_face; |
671 | } |
688 | } |
672 | |
689 | |
673 | object::~object () |
690 | object::~object () |
674 | { |
691 | { |
|
|
692 | unlink (); |
|
|
693 | |
675 | free_key_values (this); |
694 | free_key_values (this); |
676 | } |
695 | } |
677 | |
696 | |
678 | static int object_count; |
697 | static int object_count; |
679 | |
698 | |
… | |
… | |
687 | objects.insert (this); |
706 | objects.insert (this); |
688 | } |
707 | } |
689 | |
708 | |
690 | void object::unlink () |
709 | void object::unlink () |
691 | { |
710 | { |
692 | assert (index);//D |
711 | if (!index) |
|
|
712 | return; |
|
|
713 | |
693 | objects.erase (this); |
714 | objects.erase (this); |
694 | refcnt_dec (); |
715 | refcnt_dec (); |
695 | } |
716 | } |
696 | |
717 | |
697 | void |
718 | void |
… | |
… | |
771 | * drop on that space. |
792 | * drop on that space. |
772 | */ |
793 | */ |
773 | if (!drop_to_ground |
794 | if (!drop_to_ground |
774 | || !map |
795 | || !map |
775 | || map->in_memory != MAP_IN_MEMORY |
796 | || map->in_memory != MAP_IN_MEMORY |
|
|
797 | || map->nodrop |
776 | || ms ().move_block == MOVE_ALL) |
798 | || ms ().move_block == MOVE_ALL) |
777 | { |
799 | { |
778 | while (inv) |
800 | while (inv) |
779 | { |
801 | { |
780 | inv->destroy_inv (drop_to_ground); |
802 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
896 | * This function removes the object op from the linked list of objects |
918 | * This function removes the object op from the linked list of objects |
897 | * which it is currently tied to. When this function is done, the |
919 | * which it is currently tied to. When this function is done, the |
898 | * object will have no environment. If the object previously had an |
920 | * object will have no environment. If the object previously had an |
899 | * environment, the x and y coordinates will be updated to |
921 | * environment, the x and y coordinates will be updated to |
900 | * the previous environment. |
922 | * the previous environment. |
901 | * Beware: This function is called from the editor as well! |
|
|
902 | */ |
923 | */ |
903 | void |
924 | void |
904 | object::remove_slow () |
925 | object::do_remove () |
905 | { |
926 | { |
906 | object *tmp, *last = 0; |
927 | object *tmp, *last = 0; |
907 | object *otmp; |
928 | object *otmp; |
908 | |
929 | |
909 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
930 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
952 | } |
973 | } |
953 | else if (map) |
974 | else if (map) |
954 | { |
975 | { |
955 | if (type == PLAYER) |
976 | if (type == PLAYER) |
956 | { |
977 | { |
|
|
978 | // leaving a spot always closes any open container on the ground |
|
|
979 | if (container && !container->env) |
|
|
980 | // this causes spurious floorbox updates, but it ensures |
|
|
981 | // that the CLOSE event is being sent. |
|
|
982 | close_container (); |
|
|
983 | |
957 | --map->players; |
984 | --map->players; |
958 | map->touch (); |
985 | map->touch (); |
959 | } |
986 | } |
960 | |
987 | |
961 | map->dirty = true; |
988 | map->dirty = true; |
… | |
… | |
1076 | return top; |
1103 | return top; |
1077 | } |
1104 | } |
1078 | } |
1105 | } |
1079 | |
1106 | |
1080 | return 0; |
1107 | return 0; |
|
|
1108 | } |
|
|
1109 | |
|
|
1110 | void |
|
|
1111 | object::expand_tail () |
|
|
1112 | { |
|
|
1113 | if (more) |
|
|
1114 | return; |
|
|
1115 | |
|
|
1116 | object *prev = this; |
|
|
1117 | |
|
|
1118 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1119 | { |
|
|
1120 | object *op = arch_to_object (at); |
|
|
1121 | |
|
|
1122 | op->name = name; |
|
|
1123 | op->name_pl = name_pl; |
|
|
1124 | op->title = title; |
|
|
1125 | |
|
|
1126 | op->head = this; |
|
|
1127 | prev->more = op; |
|
|
1128 | |
|
|
1129 | prev = op; |
|
|
1130 | } |
1081 | } |
1131 | } |
1082 | |
1132 | |
1083 | /* |
1133 | /* |
1084 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1134 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1085 | * job preparing multi-part monsters. |
1135 | * job preparing multi-part monsters. |
… | |
… | |
1117 | * just 'op' otherwise |
1167 | * just 'op' otherwise |
1118 | */ |
1168 | */ |
1119 | object * |
1169 | object * |
1120 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1170 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1121 | { |
1171 | { |
|
|
1172 | assert (!op->flag [FLAG_FREED]); |
|
|
1173 | |
1122 | object *tmp, *top, *floor = NULL; |
1174 | object *tmp, *top, *floor = NULL; |
1123 | |
1175 | |
1124 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1125 | { |
|
|
1126 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1127 | return NULL; |
|
|
1128 | } |
|
|
1129 | |
|
|
1130 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1131 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1132 | |
|
|
1133 | op->remove (); |
1176 | op->remove (); |
1134 | |
1177 | |
1135 | if (!m) |
1178 | #if 0 |
1136 | { |
1179 | if (!m->active != !op->active) |
1137 | char *dump = dump_object (op); |
1180 | if (m->active) |
1138 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1181 | op->activate_recursive (); |
1139 | free (dump); |
1182 | else |
1140 | return op; |
1183 | op->deactivate_recursive (); |
1141 | } |
1184 | #endif |
1142 | |
1185 | |
1143 | if (out_of_map (m, op->x, op->y)) |
1186 | if (out_of_map (m, op->x, op->y)) |
1144 | { |
1187 | { |
1145 | char *dump = dump_object (op); |
|
|
1146 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1188 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1147 | #ifdef MANY_CORES |
1189 | #ifdef MANY_CORES |
1148 | /* Better to catch this here, as otherwise the next use of this object |
1190 | /* Better to catch this here, as otherwise the next use of this object |
1149 | * is likely to cause a crash. Better to find out where it is getting |
1191 | * is likely to cause a crash. Better to find out where it is getting |
1150 | * improperly inserted. |
1192 | * improperly inserted. |
1151 | */ |
1193 | */ |
1152 | abort (); |
1194 | abort (); |
1153 | #endif |
1195 | #endif |
1154 | free (dump); |
|
|
1155 | return op; |
1196 | return op; |
1156 | } |
1197 | } |
1157 | |
1198 | |
1158 | if (object *more = op->more) |
1199 | if (object *more = op->more) |
1159 | { |
1200 | { |
… | |
… | |
1256 | * looks like instead of lots of conditions here. |
1297 | * looks like instead of lots of conditions here. |
1257 | * makes things faster, and effectively the same result. |
1298 | * makes things faster, and effectively the same result. |
1258 | */ |
1299 | */ |
1259 | |
1300 | |
1260 | /* Have object 'fall below' other objects that block view. |
1301 | /* Have object 'fall below' other objects that block view. |
1261 | * Unless those objects are exits, type 66 |
1302 | * Unless those objects are exits. |
1262 | * If INS_ON_TOP is used, don't do this processing |
1303 | * If INS_ON_TOP is used, don't do this processing |
1263 | * Need to find the object that in fact blocks view, otherwise |
1304 | * Need to find the object that in fact blocks view, otherwise |
1264 | * stacking is a bit odd. |
1305 | * stacking is a bit odd. |
1265 | */ |
1306 | */ |
1266 | if (!(flag & INS_ON_TOP) |
1307 | if (!(flag & INS_ON_TOP) |
1267 | && ms.flags () & P_BLOCKSVIEW |
1308 | && ms.flags () & P_BLOCKSVIEW |
1268 | && (op->face && !op->face->visibility)) |
1309 | && (op->face && !faces [op->face].visibility)) |
1269 | { |
1310 | { |
1270 | for (last = top; last != floor; last = last->below) |
1311 | for (last = top; last != floor; last = last->below) |
1271 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1312 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1272 | break; |
1313 | break; |
1273 | |
1314 | |
… | |
… | |
1399 | } |
1440 | } |
1400 | |
1441 | |
1401 | object * |
1442 | object * |
1402 | object::insert_at (object *where, object *originator, int flags) |
1443 | object::insert_at (object *where, object *originator, int flags) |
1403 | { |
1444 | { |
1404 | where->map->insert (this, where->x, where->y, originator, flags); |
1445 | return where->map->insert (this, where->x, where->y, originator, flags); |
1405 | } |
1446 | } |
1406 | |
1447 | |
1407 | /* |
1448 | /* |
1408 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1449 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1409 | * is returned contains nr objects, and the remaining parts contains |
1450 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1449 | * the amount of an object. If the amount reaches 0, the object |
1490 | * the amount of an object. If the amount reaches 0, the object |
1450 | * is subsequently removed and freed. |
1491 | * is subsequently removed and freed. |
1451 | * |
1492 | * |
1452 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1493 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1453 | */ |
1494 | */ |
1454 | |
|
|
1455 | object * |
1495 | object * |
1456 | decrease_ob_nr (object *op, uint32 i) |
1496 | decrease_ob_nr (object *op, uint32 i) |
1457 | { |
1497 | { |
1458 | object *tmp; |
1498 | object *tmp; |
1459 | |
1499 | |
… | |
… | |
1534 | |
1574 | |
1535 | /* |
1575 | /* |
1536 | * add_weight(object, weight) adds the specified weight to an object, |
1576 | * add_weight(object, weight) adds the specified weight to an object, |
1537 | * and also updates how much the environment(s) is/are carrying. |
1577 | * and also updates how much the environment(s) is/are carrying. |
1538 | */ |
1578 | */ |
1539 | |
|
|
1540 | void |
1579 | void |
1541 | add_weight (object *op, signed long weight) |
1580 | add_weight (object *op, signed long weight) |
1542 | { |
1581 | { |
1543 | while (op != NULL) |
1582 | while (op != NULL) |
1544 | { |
1583 | { |
… | |
… | |
1576 | * inside the object environment. |
1615 | * inside the object environment. |
1577 | * |
1616 | * |
1578 | * The function returns now pointer to inserted item, and return value can |
1617 | * The function returns now pointer to inserted item, and return value can |
1579 | * be != op, if items are merged. -Tero |
1618 | * be != op, if items are merged. -Tero |
1580 | */ |
1619 | */ |
1581 | |
|
|
1582 | object * |
1620 | object * |
1583 | object::insert (object *op) |
1621 | object::insert (object *op) |
1584 | { |
1622 | { |
1585 | object *tmp, *otmp; |
1623 | object *tmp, *otmp; |
1586 | |
1624 | |
… | |
… | |
1746 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1784 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1747 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1785 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1748 | { |
1786 | { |
1749 | |
1787 | |
1750 | float |
1788 | float |
1751 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1789 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1752 | |
1790 | |
1753 | if (op->type == PLAYER) |
1791 | if (op->type == PLAYER) |
1754 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1792 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1755 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1793 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1756 | diff /= 4.0; |
1794 | diff /= 4.0; |
… | |
… | |
1963 | } |
2001 | } |
1964 | |
2002 | |
1965 | if (!index) |
2003 | if (!index) |
1966 | return -1; |
2004 | return -1; |
1967 | |
2005 | |
1968 | return altern[RANDOM () % index]; |
2006 | return altern [rndm (index)]; |
1969 | } |
2007 | } |
1970 | |
2008 | |
1971 | /* |
2009 | /* |
1972 | * find_first_free_spot(archetype, maptile, x, y) works like |
2010 | * find_first_free_spot(archetype, maptile, x, y) works like |
1973 | * find_free_spot(), but it will search max number of squares. |
2011 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
1994 | { |
2032 | { |
1995 | arr += begin; |
2033 | arr += begin; |
1996 | end -= begin; |
2034 | end -= begin; |
1997 | |
2035 | |
1998 | while (--end) |
2036 | while (--end) |
1999 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2037 | swap (arr [end], arr [rndm (end + 1)]); |
2000 | } |
2038 | } |
2001 | |
2039 | |
2002 | /* new function to make monster searching more efficient, and effective! |
2040 | /* new function to make monster searching more efficient, and effective! |
2003 | * This basically returns a randomized array (in the passed pointer) of |
2041 | * This basically returns a randomized array (in the passed pointer) of |
2004 | * the spaces to find monsters. In this way, it won't always look for |
2042 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2316 | insert_ob_in_ob (object_create_clone (item), dst); |
2354 | insert_ob_in_ob (object_create_clone (item), dst); |
2317 | |
2355 | |
2318 | return dst; |
2356 | return dst; |
2319 | } |
2357 | } |
2320 | |
2358 | |
2321 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2322 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2323 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2324 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2325 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2326 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2327 | object * |
|
|
2328 | load_object_str (const char *obstr) |
|
|
2329 | { |
|
|
2330 | object *op; |
|
|
2331 | char filename[MAX_BUF]; |
|
|
2332 | |
|
|
2333 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2334 | |
|
|
2335 | FILE *tempfile = fopen (filename, "w"); |
|
|
2336 | |
|
|
2337 | if (tempfile == NULL) |
|
|
2338 | { |
|
|
2339 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2340 | return NULL; |
|
|
2341 | } |
|
|
2342 | |
|
|
2343 | fprintf (tempfile, obstr); |
|
|
2344 | fclose (tempfile); |
|
|
2345 | |
|
|
2346 | op = object::create (); |
|
|
2347 | |
|
|
2348 | object_thawer thawer (filename); |
|
|
2349 | |
|
|
2350 | if (thawer) |
|
|
2351 | load_object (thawer, op, 0); |
|
|
2352 | |
|
|
2353 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2354 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2355 | |
|
|
2356 | return op; |
|
|
2357 | } |
|
|
2358 | |
|
|
2359 | /* This returns the first object in who's inventory that |
2359 | /* This returns the first object in who's inventory that |
2360 | * has the same type and subtype match. |
2360 | * has the same type and subtype match. |
2361 | * returns NULL if no match. |
2361 | * returns NULL if no match. |
2362 | */ |
2362 | */ |
2363 | object * |
2363 | object * |
… | |
… | |
2416 | if (link->key == canonical_key) |
2416 | if (link->key == canonical_key) |
2417 | return link->value; |
2417 | return link->value; |
2418 | |
2418 | |
2419 | return 0; |
2419 | return 0; |
2420 | } |
2420 | } |
2421 | |
|
|
2422 | |
2421 | |
2423 | /* |
2422 | /* |
2424 | * Updates the canonical_key in op to value. |
2423 | * Updates the canonical_key in op to value. |
2425 | * |
2424 | * |
2426 | * canonical_key is a shared string (value doesn't have to be). |
2425 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2566 | { |
2565 | { |
2567 | char flagdesc[512]; |
2566 | char flagdesc[512]; |
2568 | char info2[256 * 4]; |
2567 | char info2[256 * 4]; |
2569 | char *p = info; |
2568 | char *p = info; |
2570 | |
2569 | |
2571 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2570 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2572 | count, uuid.seq, |
2571 | count, uuid.seq, |
2573 | &name, |
2572 | &name, |
2574 | title ? "\",title:\"" : "", |
2573 | title ? "\",title:\"" : "", |
2575 | title ? (const char *)title : "", |
2574 | title ? (const char *)title : "", |
2576 | flag_desc (flagdesc, 512), type); |
2575 | flag_desc (flagdesc, 512), type); |
… | |
… | |
2596 | { |
2595 | { |
2597 | static char info[256 * 4]; |
2596 | static char info[256 * 4]; |
2598 | return debug_desc (info); |
2597 | return debug_desc (info); |
2599 | } |
2598 | } |
2600 | |
2599 | |
|
|
2600 | struct region * |
|
|
2601 | object::region () const |
|
|
2602 | { |
|
|
2603 | return map ? map->region (x, y) |
|
|
2604 | : region::default_region (); |
|
|
2605 | } |
|
|
2606 | |
|
|
2607 | const materialtype_t * |
|
|
2608 | object::dominant_material () const |
|
|
2609 | { |
|
|
2610 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2611 | return mat; |
|
|
2612 | |
|
|
2613 | // omfg this is slow, this has to be temporary :) |
|
|
2614 | shstr unknown ("unknown"); |
|
|
2615 | |
|
|
2616 | return name_to_material (unknown); |
|
|
2617 | } |
|
|
2618 | |
|
|
2619 | void |
|
|
2620 | object::open_container (object *new_container) |
|
|
2621 | { |
|
|
2622 | if (container == new_container) |
|
|
2623 | return; |
|
|
2624 | |
|
|
2625 | if (object *old_container = container) |
|
|
2626 | { |
|
|
2627 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2628 | return; |
|
|
2629 | |
|
|
2630 | #if 0 |
|
|
2631 | // remove the "Close old_container" object. |
|
|
2632 | if (object *closer = old_container->inv) |
|
|
2633 | if (closer->type == CLOSE_CON) |
|
|
2634 | closer->destroy (); |
|
|
2635 | #endif |
|
|
2636 | |
|
|
2637 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2638 | container = 0; |
|
|
2639 | |
|
|
2640 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2641 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2642 | } |
|
|
2643 | |
|
|
2644 | if (new_container) |
|
|
2645 | { |
|
|
2646 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2647 | return; |
|
|
2648 | |
|
|
2649 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2650 | #if 0 |
|
|
2651 | // insert the "Close Container" object. |
|
|
2652 | if (archetype *closer = new_container->other_arch) |
|
|
2653 | { |
|
|
2654 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2655 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2656 | new_container->insert (closer); |
|
|
2657 | } |
|
|
2658 | #endif |
|
|
2659 | |
|
|
2660 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2661 | |
|
|
2662 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2663 | container = new_container; |
|
|
2664 | |
|
|
2665 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2666 | esrv_send_inventory (this, new_container); |
|
|
2667 | } |
|
|
2668 | } |
|
|
2669 | |
|
|
2670 | |