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 |
… | |
… | |
449 | owner = owner->owner; |
449 | owner = owner->owner; |
450 | |
450 | |
451 | this->owner = owner; |
451 | this->owner = owner; |
452 | } |
452 | } |
453 | |
453 | |
|
|
454 | void |
|
|
455 | object::set_weapon (object *ob) |
|
|
456 | { |
|
|
457 | if (current_weapon == ob) |
|
|
458 | return; |
|
|
459 | |
|
|
460 | current_weapon = ob; |
|
|
461 | new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
462 | update_stats (); |
|
|
463 | } |
|
|
464 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
465 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
466 | * refcounts and freeing the links. |
456 | */ |
467 | */ |
457 | static void |
468 | static void |
458 | free_key_values (object *op) |
469 | free_key_values (object *op) |
459 | { |
470 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
471 | for (key_value *i = op->key_values; i; ) |
461 | { |
472 | { |
462 | key_value *next = i->next; |
473 | key_value *next = i->next; |
463 | delete i; |
474 | delete i; |
464 | |
475 | |
465 | i = next; |
476 | i = next; |
466 | } |
477 | } |
467 | |
478 | |
468 | op->key_values = 0; |
479 | op->key_values = 0; |
469 | } |
480 | } |
470 | |
481 | |
471 | /* |
482 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
483 | 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 | { |
484 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
485 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
486 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
487 | |
485 | *(object_copy *)dst = *this; |
488 | *(object_copy *)this = src; |
486 | |
489 | |
487 | if (is_freed) |
490 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
491 | 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 | |
492 | |
496 | /* Copy over key_values, if any. */ |
493 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
494 | if (src.key_values) |
498 | { |
495 | { |
499 | key_value *tail = 0; |
496 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
497 | key_values = 0; |
503 | |
498 | |
504 | for (i = key_values; i; i = i->next) |
499 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
500 | { |
506 | key_value *new_link = new key_value; |
501 | key_value *new_link = new key_value; |
507 | |
502 | |
508 | new_link->next = 0; |
503 | new_link->next = 0; |
509 | new_link->key = i->key; |
504 | new_link->key = i->key; |
510 | new_link->value = i->value; |
505 | new_link->value = i->value; |
511 | |
506 | |
512 | /* Try and be clever here, too. */ |
507 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
508 | if (!key_values) |
514 | { |
509 | { |
515 | dst->key_values = new_link; |
510 | key_values = new_link; |
516 | tail = new_link; |
511 | tail = new_link; |
517 | } |
512 | } |
518 | else |
513 | else |
519 | { |
514 | { |
520 | tail->next = new_link; |
515 | tail->next = new_link; |
521 | tail = new_link; |
516 | tail = new_link; |
522 | } |
517 | } |
523 | } |
518 | } |
524 | } |
519 | } |
|
|
520 | } |
|
|
521 | |
|
|
522 | /* |
|
|
523 | * copy_to first frees everything allocated by the dst object, |
|
|
524 | * and then copies the contents of itself into the second |
|
|
525 | * object, allocating what needs to be allocated. Basically, any |
|
|
526 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
527 | * if the first object is freed, the pointers in the new object |
|
|
528 | * will point at garbage. |
|
|
529 | */ |
|
|
530 | void |
|
|
531 | object::copy_to (object *dst) |
|
|
532 | { |
|
|
533 | *dst = *this; |
|
|
534 | |
|
|
535 | if (speed < 0) |
|
|
536 | dst->speed_left = speed_left - rndm (); |
525 | |
537 | |
526 | dst->set_speed (dst->speed); |
538 | dst->set_speed (dst->speed); |
|
|
539 | } |
|
|
540 | |
|
|
541 | void |
|
|
542 | object::instantiate () |
|
|
543 | { |
|
|
544 | if (!uuid.seq) // HACK |
|
|
545 | uuid = gen_uuid (); |
|
|
546 | |
|
|
547 | speed_left = -0.1f; |
|
|
548 | /* copy the body_info to the body_used - this is only really |
|
|
549 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
550 | * by doing so, when a monster is created, it has good starting |
|
|
551 | * values for the body_used info, so when items are created |
|
|
552 | * for it, they can be properly equipped. |
|
|
553 | */ |
|
|
554 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
555 | |
|
|
556 | attachable::instantiate (); |
527 | } |
557 | } |
528 | |
558 | |
529 | object * |
559 | object * |
530 | object::clone () |
560 | object::clone () |
531 | { |
561 | { |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
619 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
620 | */ |
591 | void |
621 | void |
592 | update_object (object *op, int action) |
622 | update_object (object *op, int action) |
593 | { |
623 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
|
|
595 | |
|
|
596 | if (op == NULL) |
624 | if (op == NULL) |
597 | { |
625 | { |
598 | /* this should never happen */ |
626 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
627 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
600 | return; |
628 | return; |
… | |
… | |
901 | * This function removes the object op from the linked list of objects |
929 | * This function removes the object op from the linked list of objects |
902 | * which it is currently tied to. When this function is done, the |
930 | * which it is currently tied to. When this function is done, the |
903 | * object will have no environment. If the object previously had an |
931 | * object will have no environment. If the object previously had an |
904 | * environment, the x and y coordinates will be updated to |
932 | * environment, the x and y coordinates will be updated to |
905 | * the previous environment. |
933 | * the previous environment. |
906 | * Beware: This function is called from the editor as well! |
|
|
907 | */ |
934 | */ |
908 | void |
935 | void |
909 | object::remove_slow () |
936 | object::do_remove () |
910 | { |
937 | { |
911 | object *tmp, *last = 0; |
938 | object *tmp, *last = 0; |
912 | object *otmp; |
939 | object *otmp; |
913 | |
940 | |
914 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
941 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
957 | } |
984 | } |
958 | else if (map) |
985 | else if (map) |
959 | { |
986 | { |
960 | if (type == PLAYER) |
987 | if (type == PLAYER) |
961 | { |
988 | { |
|
|
989 | // leaving a spot always closes any open container on the ground |
|
|
990 | if (container && !container->env) |
|
|
991 | // this causes spurious floorbox updates, but it ensures |
|
|
992 | // that the CLOSE event is being sent. |
|
|
993 | close_container (); |
|
|
994 | |
962 | --map->players; |
995 | --map->players; |
963 | map->touch (); |
996 | map->touch (); |
964 | } |
997 | } |
965 | |
998 | |
966 | map->dirty = true; |
999 | map->dirty = true; |
… | |
… | |
1081 | return top; |
1114 | return top; |
1082 | } |
1115 | } |
1083 | } |
1116 | } |
1084 | |
1117 | |
1085 | return 0; |
1118 | return 0; |
|
|
1119 | } |
|
|
1120 | |
|
|
1121 | void |
|
|
1122 | object::expand_tail () |
|
|
1123 | { |
|
|
1124 | if (more) |
|
|
1125 | return; |
|
|
1126 | |
|
|
1127 | object *prev = this; |
|
|
1128 | |
|
|
1129 | for (archetype *at = arch->more; at; at = at->more) |
|
|
1130 | { |
|
|
1131 | object *op = arch_to_object (at); |
|
|
1132 | |
|
|
1133 | op->name = name; |
|
|
1134 | op->name_pl = name_pl; |
|
|
1135 | op->title = title; |
|
|
1136 | |
|
|
1137 | op->head = this; |
|
|
1138 | prev->more = op; |
|
|
1139 | |
|
|
1140 | prev = op; |
|
|
1141 | } |
1086 | } |
1142 | } |
1087 | |
1143 | |
1088 | /* |
1144 | /* |
1089 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1145 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1090 | * job preparing multi-part monsters. |
1146 | * job preparing multi-part monsters. |
… | |
… | |
1122 | * just 'op' otherwise |
1178 | * just 'op' otherwise |
1123 | */ |
1179 | */ |
1124 | object * |
1180 | object * |
1125 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1181 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1126 | { |
1182 | { |
|
|
1183 | assert (!op->flag [FLAG_FREED]); |
|
|
1184 | |
1127 | object *tmp, *top, *floor = NULL; |
1185 | object *tmp, *top, *floor = NULL; |
1128 | |
1186 | |
1129 | if (QUERY_FLAG (op, FLAG_FREED)) |
|
|
1130 | { |
|
|
1131 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1132 | return NULL; |
|
|
1133 | } |
|
|
1134 | |
|
|
1135 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1136 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1137 | |
|
|
1138 | op->remove (); |
1187 | op->remove (); |
1139 | |
1188 | |
1140 | if (!m) |
1189 | #if 0 |
1141 | { |
1190 | if (!m->active != !op->active) |
1142 | char *dump = dump_object (op); |
1191 | if (m->active) |
1143 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1192 | op->activate_recursive (); |
1144 | free (dump); |
1193 | else |
1145 | return op; |
1194 | op->deactivate_recursive (); |
1146 | } |
1195 | #endif |
1147 | |
1196 | |
1148 | if (out_of_map (m, op->x, op->y)) |
1197 | if (out_of_map (m, op->x, op->y)) |
1149 | { |
1198 | { |
1150 | char *dump = dump_object (op); |
|
|
1151 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1199 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1152 | #ifdef MANY_CORES |
1200 | #ifdef MANY_CORES |
1153 | /* Better to catch this here, as otherwise the next use of this object |
1201 | /* Better to catch this here, as otherwise the next use of this object |
1154 | * is likely to cause a crash. Better to find out where it is getting |
1202 | * is likely to cause a crash. Better to find out where it is getting |
1155 | * improperly inserted. |
1203 | * improperly inserted. |
1156 | */ |
1204 | */ |
1157 | abort (); |
1205 | abort (); |
1158 | #endif |
1206 | #endif |
1159 | free (dump); |
|
|
1160 | return op; |
1207 | return op; |
1161 | } |
1208 | } |
1162 | |
1209 | |
1163 | if (object *more = op->more) |
1210 | if (object *more = op->more) |
1164 | { |
1211 | { |
… | |
… | |
1261 | * looks like instead of lots of conditions here. |
1308 | * looks like instead of lots of conditions here. |
1262 | * makes things faster, and effectively the same result. |
1309 | * makes things faster, and effectively the same result. |
1263 | */ |
1310 | */ |
1264 | |
1311 | |
1265 | /* Have object 'fall below' other objects that block view. |
1312 | /* Have object 'fall below' other objects that block view. |
1266 | * Unless those objects are exits, type 66 |
1313 | * Unless those objects are exits. |
1267 | * If INS_ON_TOP is used, don't do this processing |
1314 | * If INS_ON_TOP is used, don't do this processing |
1268 | * Need to find the object that in fact blocks view, otherwise |
1315 | * Need to find the object that in fact blocks view, otherwise |
1269 | * stacking is a bit odd. |
1316 | * stacking is a bit odd. |
1270 | */ |
1317 | */ |
1271 | if (!(flag & INS_ON_TOP) |
1318 | if (!(flag & INS_ON_TOP) |
1272 | && ms.flags () & P_BLOCKSVIEW |
1319 | && ms.flags () & P_BLOCKSVIEW |
1273 | && (op->face && !op->face->visibility)) |
1320 | && (op->face && !faces [op->face].visibility)) |
1274 | { |
1321 | { |
1275 | for (last = top; last != floor; last = last->below) |
1322 | for (last = top; last != floor; last = last->below) |
1276 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1323 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1277 | break; |
1324 | break; |
1278 | |
1325 | |
… | |
… | |
1404 | } |
1451 | } |
1405 | |
1452 | |
1406 | object * |
1453 | object * |
1407 | object::insert_at (object *where, object *originator, int flags) |
1454 | object::insert_at (object *where, object *originator, int flags) |
1408 | { |
1455 | { |
1409 | where->map->insert (this, where->x, where->y, originator, flags); |
1456 | return where->map->insert (this, where->x, where->y, originator, flags); |
1410 | } |
1457 | } |
1411 | |
1458 | |
1412 | /* |
1459 | /* |
1413 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1460 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1414 | * is returned contains nr objects, and the remaining parts contains |
1461 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1454 | * the amount of an object. If the amount reaches 0, the object |
1501 | * the amount of an object. If the amount reaches 0, the object |
1455 | * is subsequently removed and freed. |
1502 | * is subsequently removed and freed. |
1456 | * |
1503 | * |
1457 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1504 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1458 | */ |
1505 | */ |
1459 | |
|
|
1460 | object * |
1506 | object * |
1461 | decrease_ob_nr (object *op, uint32 i) |
1507 | decrease_ob_nr (object *op, uint32 i) |
1462 | { |
1508 | { |
1463 | object *tmp; |
1509 | object *tmp; |
1464 | |
1510 | |
… | |
… | |
1539 | |
1585 | |
1540 | /* |
1586 | /* |
1541 | * add_weight(object, weight) adds the specified weight to an object, |
1587 | * add_weight(object, weight) adds the specified weight to an object, |
1542 | * and also updates how much the environment(s) is/are carrying. |
1588 | * and also updates how much the environment(s) is/are carrying. |
1543 | */ |
1589 | */ |
1544 | |
|
|
1545 | void |
1590 | void |
1546 | add_weight (object *op, signed long weight) |
1591 | add_weight (object *op, signed long weight) |
1547 | { |
1592 | { |
1548 | while (op != NULL) |
1593 | while (op != NULL) |
1549 | { |
1594 | { |
… | |
… | |
1581 | * inside the object environment. |
1626 | * inside the object environment. |
1582 | * |
1627 | * |
1583 | * The function returns now pointer to inserted item, and return value can |
1628 | * The function returns now pointer to inserted item, and return value can |
1584 | * be != op, if items are merged. -Tero |
1629 | * be != op, if items are merged. -Tero |
1585 | */ |
1630 | */ |
1586 | |
|
|
1587 | object * |
1631 | object * |
1588 | object::insert (object *op) |
1632 | object::insert (object *op) |
1589 | { |
1633 | { |
1590 | object *tmp, *otmp; |
1634 | object *tmp, *otmp; |
1591 | |
1635 | |
… | |
… | |
1968 | } |
2012 | } |
1969 | |
2013 | |
1970 | if (!index) |
2014 | if (!index) |
1971 | return -1; |
2015 | return -1; |
1972 | |
2016 | |
1973 | return altern[RANDOM () % index]; |
2017 | return altern [rndm (index)]; |
1974 | } |
2018 | } |
1975 | |
2019 | |
1976 | /* |
2020 | /* |
1977 | * find_first_free_spot(archetype, maptile, x, y) works like |
2021 | * find_first_free_spot(archetype, maptile, x, y) works like |
1978 | * find_free_spot(), but it will search max number of squares. |
2022 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
1999 | { |
2043 | { |
2000 | arr += begin; |
2044 | arr += begin; |
2001 | end -= begin; |
2045 | end -= begin; |
2002 | |
2046 | |
2003 | while (--end) |
2047 | while (--end) |
2004 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2048 | swap (arr [end], arr [rndm (end + 1)]); |
2005 | } |
2049 | } |
2006 | |
2050 | |
2007 | /* new function to make monster searching more efficient, and effective! |
2051 | /* new function to make monster searching more efficient, and effective! |
2008 | * This basically returns a randomized array (in the passed pointer) of |
2052 | * This basically returns a randomized array (in the passed pointer) of |
2009 | * the spaces to find monsters. In this way, it won't always look for |
2053 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2321 | insert_ob_in_ob (object_create_clone (item), dst); |
2365 | insert_ob_in_ob (object_create_clone (item), dst); |
2322 | |
2366 | |
2323 | return dst; |
2367 | return dst; |
2324 | } |
2368 | } |
2325 | |
2369 | |
2326 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2327 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2328 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2329 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2330 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2331 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2332 | object * |
|
|
2333 | load_object_str (const char *obstr) |
|
|
2334 | { |
|
|
2335 | object *op; |
|
|
2336 | char filename[MAX_BUF]; |
|
|
2337 | |
|
|
2338 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2339 | |
|
|
2340 | FILE *tempfile = fopen (filename, "w"); |
|
|
2341 | |
|
|
2342 | if (tempfile == NULL) |
|
|
2343 | { |
|
|
2344 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2345 | return NULL; |
|
|
2346 | } |
|
|
2347 | |
|
|
2348 | fprintf (tempfile, obstr); |
|
|
2349 | fclose (tempfile); |
|
|
2350 | |
|
|
2351 | op = object::create (); |
|
|
2352 | |
|
|
2353 | object_thawer thawer (filename); |
|
|
2354 | |
|
|
2355 | if (thawer) |
|
|
2356 | load_object (thawer, op, 0); |
|
|
2357 | |
|
|
2358 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2359 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2360 | |
|
|
2361 | return op; |
|
|
2362 | } |
|
|
2363 | |
|
|
2364 | /* This returns the first object in who's inventory that |
2370 | /* This returns the first object in who's inventory that |
2365 | * has the same type and subtype match. |
2371 | * has the same type and subtype match. |
2366 | * returns NULL if no match. |
2372 | * returns NULL if no match. |
2367 | */ |
2373 | */ |
2368 | object * |
2374 | object * |
… | |
… | |
2421 | if (link->key == canonical_key) |
2427 | if (link->key == canonical_key) |
2422 | return link->value; |
2428 | return link->value; |
2423 | |
2429 | |
2424 | return 0; |
2430 | return 0; |
2425 | } |
2431 | } |
2426 | |
|
|
2427 | |
2432 | |
2428 | /* |
2433 | /* |
2429 | * Updates the canonical_key in op to value. |
2434 | * Updates the canonical_key in op to value. |
2430 | * |
2435 | * |
2431 | * canonical_key is a shared string (value doesn't have to be). |
2436 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2571 | { |
2576 | { |
2572 | char flagdesc[512]; |
2577 | char flagdesc[512]; |
2573 | char info2[256 * 4]; |
2578 | char info2[256 * 4]; |
2574 | char *p = info; |
2579 | char *p = info; |
2575 | |
2580 | |
2576 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2581 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2577 | count, uuid.seq, |
2582 | count, uuid.seq, |
2578 | &name, |
2583 | &name, |
2579 | title ? "\",title:\"" : "", |
2584 | title ? "\",title:\"" : "", |
2580 | title ? (const char *)title : "", |
2585 | title ? (const char *)title : "", |
2581 | flag_desc (flagdesc, 512), type); |
2586 | flag_desc (flagdesc, 512), type); |
… | |
… | |
2590 | } |
2595 | } |
2591 | |
2596 | |
2592 | const char * |
2597 | const char * |
2593 | object::debug_desc () const |
2598 | object::debug_desc () const |
2594 | { |
2599 | { |
2595 | static char info[256 * 4]; |
2600 | static char info[3][256 * 4]; |
|
|
2601 | static int info_idx; |
|
|
2602 | |
2596 | return debug_desc (info); |
2603 | return debug_desc (info [++info_idx % 3]); |
2597 | } |
2604 | } |
2598 | |
2605 | |
2599 | const char * |
2606 | struct region * |
2600 | object::debug_desc2 () const |
2607 | object::region () const |
2601 | { |
2608 | { |
2602 | static char info[256 * 4]; |
2609 | return map ? map->region (x, y) |
2603 | return debug_desc (info); |
2610 | : region::default_region (); |
2604 | } |
2611 | } |
2605 | |
2612 | |
|
|
2613 | const materialtype_t * |
|
|
2614 | object::dominant_material () const |
|
|
2615 | { |
|
|
2616 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2617 | return mat; |
|
|
2618 | |
|
|
2619 | // omfg this is slow, this has to be temporary :) |
|
|
2620 | shstr unknown ("unknown"); |
|
|
2621 | |
|
|
2622 | return name_to_material (unknown); |
|
|
2623 | } |
|
|
2624 | |
|
|
2625 | void |
|
|
2626 | object::open_container (object *new_container) |
|
|
2627 | { |
|
|
2628 | if (container == new_container) |
|
|
2629 | return; |
|
|
2630 | |
|
|
2631 | if (object *old_container = container) |
|
|
2632 | { |
|
|
2633 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2634 | return; |
|
|
2635 | |
|
|
2636 | #if 0 |
|
|
2637 | // remove the "Close old_container" object. |
|
|
2638 | if (object *closer = old_container->inv) |
|
|
2639 | if (closer->type == CLOSE_CON) |
|
|
2640 | closer->destroy (); |
|
|
2641 | #endif |
|
|
2642 | |
|
|
2643 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2644 | container = 0; |
|
|
2645 | |
|
|
2646 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2647 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2648 | } |
|
|
2649 | |
|
|
2650 | if (new_container) |
|
|
2651 | { |
|
|
2652 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2653 | return; |
|
|
2654 | |
|
|
2655 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2656 | #if 0 |
|
|
2657 | // insert the "Close Container" object. |
|
|
2658 | if (archetype *closer = new_container->other_arch) |
|
|
2659 | { |
|
|
2660 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2661 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2662 | new_container->insert (closer); |
|
|
2663 | } |
|
|
2664 | #endif |
|
|
2665 | |
|
|
2666 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2667 | |
|
|
2668 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2669 | container = new_container; |
|
|
2670 | |
|
|
2671 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2672 | esrv_send_inventory (this, new_container); |
|
|
2673 | } |
|
|
2674 | } |
|
|
2675 | |
|
|
2676 | |