1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
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 | * |
8 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
9 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
11 | (at your option) any later version. |
11 | * (at your option) any later version. |
12 | |
12 | * |
13 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | |
17 | * |
18 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
21 | |
21 | * |
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
26 | sub/add_weight will transcend the environment updating the carrying |
26 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
27 | variable. */ |
28 | #include <global.h> |
28 | #include <global.h> |
… | |
… | |
357 | /* |
357 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
359 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
360 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
361 | */ |
362 | |
|
|
363 | char * |
362 | char * |
364 | dump_object (object *op) |
363 | dump_object (object *op) |
365 | { |
364 | { |
366 | if (!op) |
365 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
366 | return strdup ("[NULLOBJ]"); |
368 | |
367 | |
369 | object_freezer freezer; |
368 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
369 | op->write (freezer); |
371 | return freezer.as_string (); |
370 | return freezer.as_string (); |
372 | } |
371 | } |
373 | |
372 | |
374 | /* |
373 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
374 | * get_nearest_part(multi-object, object 2) returns the part of the |
… | |
… | |
395 | * Returns the object which has the count-variable equal to the argument. |
394 | * Returns the object which has the count-variable equal to the argument. |
396 | */ |
395 | */ |
397 | object * |
396 | object * |
398 | find_object (tag_t i) |
397 | find_object (tag_t i) |
399 | { |
398 | { |
400 | return ((unsigned int)i) < objects.size () |
399 | for_all_objects (op) |
401 | ? objects [i] |
400 | if (op->count == i) |
402 | : 0; |
401 | return op; |
|
|
402 | |
|
|
403 | return 0; |
403 | } |
404 | } |
404 | |
405 | |
405 | /* |
406 | /* |
406 | * Returns the first object which has a name equal to the argument. |
407 | * Returns the first object which has a name equal to the argument. |
407 | * Used only by the patch command, but not all that useful. |
408 | * Used only by the patch command, but not all that useful. |
… | |
… | |
487 | |
488 | |
488 | if (is_removed) |
489 | if (is_removed) |
489 | SET_FLAG (dst, FLAG_REMOVED); |
490 | SET_FLAG (dst, FLAG_REMOVED); |
490 | |
491 | |
491 | if (speed < 0) |
492 | if (speed < 0) |
492 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
493 | dst->speed_left = speed_left - rndm (); |
493 | |
494 | |
494 | /* Copy over key_values, if any. */ |
495 | /* Copy over key_values, if any. */ |
495 | if (key_values) |
496 | if (key_values) |
496 | { |
497 | { |
497 | key_value *tail = 0; |
498 | key_value *tail = 0; |
… | |
… | |
520 | } |
521 | } |
521 | } |
522 | } |
522 | } |
523 | } |
523 | |
524 | |
524 | dst->set_speed (dst->speed); |
525 | dst->set_speed (dst->speed); |
|
|
526 | } |
|
|
527 | |
|
|
528 | void |
|
|
529 | object::instantiate () |
|
|
530 | { |
|
|
531 | if (!uuid.seq) // HACK |
|
|
532 | uuid = gen_uuid (); |
|
|
533 | |
|
|
534 | speed_left = -0.1f; |
|
|
535 | /* copy the body_info to the body_used - this is only really |
|
|
536 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
537 | * by doing so, when a monster is created, it has good starting |
|
|
538 | * values for the body_used info, so when items are created |
|
|
539 | * for it, they can be properly equipped. |
|
|
540 | */ |
|
|
541 | memcpy (body_used, body_info, sizeof (body_used)); |
|
|
542 | |
|
|
543 | attachable::instantiate (); |
525 | } |
544 | } |
526 | |
545 | |
527 | object * |
546 | object * |
528 | object::clone () |
547 | object::clone () |
529 | { |
548 | { |
… | |
… | |
587 | * UP_OBJ_FACE: only the objects face has changed. |
606 | * UP_OBJ_FACE: only the objects face has changed. |
588 | */ |
607 | */ |
589 | void |
608 | void |
590 | update_object (object *op, int action) |
609 | update_object (object *op, int action) |
591 | { |
610 | { |
592 | MoveType move_on, move_off, move_block, move_slow; |
|
|
593 | |
|
|
594 | if (op == NULL) |
611 | if (op == NULL) |
595 | { |
612 | { |
596 | /* this should never happen */ |
613 | /* this should never happen */ |
597 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
614 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
598 | return; |
615 | return; |
… | |
… | |
658 | |
675 | |
659 | if (op->more) |
676 | if (op->more) |
660 | update_object (op->more, action); |
677 | update_object (op->more, action); |
661 | } |
678 | } |
662 | |
679 | |
663 | object *object::first; |
|
|
664 | |
|
|
665 | object::object () |
680 | object::object () |
666 | { |
681 | { |
667 | SET_FLAG (this, FLAG_REMOVED); |
682 | SET_FLAG (this, FLAG_REMOVED); |
668 | |
683 | |
669 | expmul = 1.0; |
684 | expmul = 1.0; |
670 | face = blank_face; |
685 | face = blank_face; |
671 | } |
686 | } |
672 | |
687 | |
673 | object::~object () |
688 | object::~object () |
674 | { |
689 | { |
|
|
690 | unlink (); |
|
|
691 | |
675 | free_key_values (this); |
692 | free_key_values (this); |
676 | } |
693 | } |
677 | |
694 | |
|
|
695 | static int object_count; |
|
|
696 | |
678 | void object::link () |
697 | void object::link () |
679 | { |
698 | { |
|
|
699 | assert (!index);//D |
680 | uuid = gen_uuid (); |
700 | uuid = gen_uuid (); |
|
|
701 | count = ++object_count; |
681 | |
702 | |
682 | refcnt_inc (); |
703 | refcnt_inc (); |
683 | objects.insert (this); |
704 | objects.insert (this); |
684 | } |
705 | } |
685 | |
706 | |
686 | void object::unlink () |
707 | void object::unlink () |
687 | { |
708 | { |
|
|
709 | if (!index) |
|
|
710 | return; |
|
|
711 | |
688 | objects.erase (this); |
712 | objects.erase (this); |
689 | refcnt_dec (); |
713 | refcnt_dec (); |
690 | } |
714 | } |
691 | |
715 | |
692 | void |
716 | void |
… | |
… | |
766 | * drop on that space. |
790 | * drop on that space. |
767 | */ |
791 | */ |
768 | if (!drop_to_ground |
792 | if (!drop_to_ground |
769 | || !map |
793 | || !map |
770 | || map->in_memory != MAP_IN_MEMORY |
794 | || map->in_memory != MAP_IN_MEMORY |
|
|
795 | || map->nodrop |
771 | || ms ().move_block == MOVE_ALL) |
796 | || ms ().move_block == MOVE_ALL) |
772 | { |
797 | { |
773 | while (inv) |
798 | while (inv) |
774 | { |
799 | { |
775 | inv->destroy_inv (drop_to_ground); |
800 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
803 | } |
828 | } |
804 | |
829 | |
805 | void |
830 | void |
806 | object::do_destroy () |
831 | object::do_destroy () |
807 | { |
832 | { |
|
|
833 | attachable::do_destroy (); |
|
|
834 | |
808 | if (flag [FLAG_IS_LINKED]) |
835 | if (flag [FLAG_IS_LINKED]) |
809 | remove_button_link (this); |
836 | remove_button_link (this); |
810 | |
837 | |
811 | if (flag [FLAG_FRIENDLY]) |
838 | if (flag [FLAG_FRIENDLY]) |
|
|
839 | { |
812 | remove_friendly_object (this); |
840 | remove_friendly_object (this); |
|
|
841 | |
|
|
842 | if (type == GOLEM |
|
|
843 | && owner |
|
|
844 | && owner->type == PLAYER |
|
|
845 | && owner->contr->ranges[range_golem] == this) |
|
|
846 | owner->contr->ranges[range_golem] = 0; |
|
|
847 | } |
813 | |
848 | |
814 | if (!flag [FLAG_REMOVED]) |
849 | if (!flag [FLAG_REMOVED]) |
815 | remove (); |
850 | remove (); |
816 | |
851 | |
817 | if (flag [FLAG_FREED]) |
852 | destroy_inv (true); |
818 | return; |
|
|
819 | |
853 | |
820 | set_speed (0); |
854 | deactivate (); |
|
|
855 | unlink (); |
821 | |
856 | |
822 | flag [FLAG_FREED] = 1; |
857 | flag [FLAG_FREED] = 1; |
823 | |
|
|
824 | attachable::do_destroy (); |
|
|
825 | |
|
|
826 | destroy_inv (true); |
|
|
827 | unlink (); |
|
|
828 | |
858 | |
829 | // hack to ensure that freed objects still have a valid map |
859 | // hack to ensure that freed objects still have a valid map |
830 | { |
860 | { |
831 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
861 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
832 | |
862 | |
… | |
… | |
894 | * This function removes the object op from the linked list of objects |
924 | * This function removes the object op from the linked list of objects |
895 | * which it is currently tied to. When this function is done, the |
925 | * which it is currently tied to. When this function is done, the |
896 | * object will have no environment. If the object previously had an |
926 | * object will have no environment. If the object previously had an |
897 | * environment, the x and y coordinates will be updated to |
927 | * environment, the x and y coordinates will be updated to |
898 | * the previous environment. |
928 | * the previous environment. |
899 | * Beware: This function is called from the editor as well! |
|
|
900 | */ |
929 | */ |
901 | void |
930 | void |
902 | object::remove () |
931 | object::do_remove () |
903 | { |
932 | { |
904 | object *tmp, *last = 0; |
933 | object *tmp, *last = 0; |
905 | object *otmp; |
934 | object *otmp; |
906 | |
935 | |
907 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
936 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
950 | } |
979 | } |
951 | else if (map) |
980 | else if (map) |
952 | { |
981 | { |
953 | if (type == PLAYER) |
982 | if (type == PLAYER) |
954 | { |
983 | { |
|
|
984 | // leaving a spot always closes any open container on the ground |
|
|
985 | if (container && !container->env) |
|
|
986 | // this causes spurious floorbox updates, but it ensures |
|
|
987 | // that the CLOSE event is being sent. |
|
|
988 | close_container (); |
|
|
989 | |
955 | --map->players; |
990 | --map->players; |
956 | map->touch (); |
991 | map->touch (); |
957 | } |
992 | } |
958 | |
993 | |
959 | map->dirty = true; |
994 | map->dirty = true; |
|
|
995 | mapspace &ms = this->ms (); |
960 | |
996 | |
961 | /* link the object above us */ |
997 | /* link the object above us */ |
962 | if (above) |
998 | if (above) |
963 | above->below = below; |
999 | above->below = below; |
964 | else |
1000 | else |
965 | map->at (x, y).top = below; /* we were top, set new top */ |
1001 | ms.top = below; /* we were top, set new top */ |
966 | |
1002 | |
967 | /* Relink the object below us, if there is one */ |
1003 | /* Relink the object below us, if there is one */ |
968 | if (below) |
1004 | if (below) |
969 | below->above = above; |
1005 | below->above = above; |
970 | else |
1006 | else |
… | |
… | |
972 | /* Nothing below, which means we need to relink map object for this space |
1008 | /* Nothing below, which means we need to relink map object for this space |
973 | * use translated coordinates in case some oddness with map tiling is |
1009 | * use translated coordinates in case some oddness with map tiling is |
974 | * evident |
1010 | * evident |
975 | */ |
1011 | */ |
976 | if (GET_MAP_OB (map, x, y) != this) |
1012 | if (GET_MAP_OB (map, x, y) != this) |
977 | { |
|
|
978 | char *dump = dump_object (this); |
|
|
979 | LOG (llevError, |
|
|
980 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1013 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
981 | free (dump); |
|
|
982 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
983 | LOG (llevError, "%s\n", dump); |
|
|
984 | free (dump); |
|
|
985 | } |
|
|
986 | |
1014 | |
987 | map->at (x, y).bot = above; /* goes on above it. */ |
1015 | ms.bot = above; /* goes on above it. */ |
988 | } |
1016 | } |
989 | |
1017 | |
990 | above = 0; |
1018 | above = 0; |
991 | below = 0; |
1019 | below = 0; |
992 | |
1020 | |
993 | if (map->in_memory == MAP_SAVING) |
1021 | if (map->in_memory == MAP_SAVING) |
994 | return; |
1022 | return; |
995 | |
1023 | |
996 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1024 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
997 | |
1025 | |
998 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1026 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
999 | { |
1027 | { |
1000 | /* No point updating the players look faces if he is the object |
1028 | /* No point updating the players look faces if he is the object |
1001 | * being removed. |
1029 | * being removed. |
1002 | */ |
1030 | */ |
1003 | |
1031 | |
… | |
… | |
1084 | |
1112 | |
1085 | return 0; |
1113 | return 0; |
1086 | } |
1114 | } |
1087 | |
1115 | |
1088 | /* |
1116 | /* |
1089 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1117 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1090 | * job preparing multi-part monsters |
1118 | * job preparing multi-part monsters. |
1091 | */ |
1119 | */ |
1092 | object * |
1120 | object * |
1093 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1121 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1094 | { |
1122 | { |
1095 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1123 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
… | |
… | |
1123 | */ |
1151 | */ |
1124 | object * |
1152 | object * |
1125 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1153 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1126 | { |
1154 | { |
1127 | object *tmp, *top, *floor = NULL; |
1155 | object *tmp, *top, *floor = NULL; |
1128 | sint16 x, y; |
|
|
1129 | |
1156 | |
1130 | if (QUERY_FLAG (op, FLAG_FREED)) |
1157 | if (QUERY_FLAG (op, FLAG_FREED)) |
1131 | { |
1158 | { |
1132 | LOG (llevError, "Trying to insert freed object!\n"); |
1159 | LOG (llevError, "Trying to insert freed object!\n"); |
1133 | return NULL; |
1160 | return NULL; |
1134 | } |
1161 | } |
|
|
1162 | |
|
|
1163 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1164 | LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ()); |
|
|
1165 | |
|
|
1166 | op->remove (); |
1135 | |
1167 | |
1136 | if (!m) |
1168 | if (!m) |
1137 | { |
1169 | { |
1138 | char *dump = dump_object (op); |
1170 | char *dump = dump_object (op); |
1139 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
1171 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
… | |
… | |
1154 | #endif |
1186 | #endif |
1155 | free (dump); |
1187 | free (dump); |
1156 | return op; |
1188 | return op; |
1157 | } |
1189 | } |
1158 | |
1190 | |
1159 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1160 | { |
|
|
1161 | char *dump = dump_object (op); |
|
|
1162 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1163 | free (dump); |
|
|
1164 | return op; |
|
|
1165 | } |
|
|
1166 | |
|
|
1167 | if (op->more) |
|
|
1168 | { |
|
|
1169 | /* The part may be on a different map. */ |
|
|
1170 | |
|
|
1171 | object *more = op->more; |
1191 | if (object *more = op->more) |
1172 | |
1192 | { |
1173 | /* We really need the caller to normalise coordinates - if |
|
|
1174 | * we set the map, that doesn't work if the location is within |
|
|
1175 | * a map and this is straddling an edge. So only if coordinate |
|
|
1176 | * is clear wrong do we normalise it. |
|
|
1177 | */ |
|
|
1178 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1179 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1180 | else if (!more->map) |
|
|
1181 | { |
|
|
1182 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1183 | * more->map should always point to the parent. |
|
|
1184 | */ |
|
|
1185 | more->map = m; |
|
|
1186 | } |
|
|
1187 | |
|
|
1188 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1193 | if (!insert_ob_in_map (more, m, originator, flag)) |
1189 | { |
1194 | { |
1190 | if (!op->head) |
1195 | if (!op->head) |
1191 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1196 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
1192 | |
1197 | |
1193 | return 0; |
1198 | return 0; |
… | |
… | |
1198 | |
1203 | |
1199 | /* Ideally, the caller figures this out. However, it complicates a lot |
1204 | /* Ideally, the caller figures this out. However, it complicates a lot |
1200 | * of areas of callers (eg, anything that uses find_free_spot would now |
1205 | * of areas of callers (eg, anything that uses find_free_spot would now |
1201 | * need extra work |
1206 | * need extra work |
1202 | */ |
1207 | */ |
1203 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1208 | if (!xy_normalise (m, op->x, op->y)) |
1204 | x = op->x; |
1209 | return 0; |
1205 | y = op->y; |
1210 | |
|
|
1211 | op->map = m; |
|
|
1212 | mapspace &ms = op->ms (); |
1206 | |
1213 | |
1207 | /* this has to be done after we translate the coordinates. |
1214 | /* this has to be done after we translate the coordinates. |
1208 | */ |
1215 | */ |
1209 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1216 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1210 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1217 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1211 | if (object::can_merge (op, tmp)) |
1218 | if (object::can_merge (op, tmp)) |
1212 | { |
1219 | { |
1213 | op->nrof += tmp->nrof; |
1220 | op->nrof += tmp->nrof; |
1214 | tmp->destroy (); |
1221 | tmp->destroy (); |
1215 | } |
1222 | } |
… | |
… | |
1232 | op->below = originator->below; |
1239 | op->below = originator->below; |
1233 | |
1240 | |
1234 | if (op->below) |
1241 | if (op->below) |
1235 | op->below->above = op; |
1242 | op->below->above = op; |
1236 | else |
1243 | else |
1237 | op->ms ().bot = op; |
1244 | ms.bot = op; |
1238 | |
1245 | |
1239 | /* since *below* originator, no need to update top */ |
1246 | /* since *below* originator, no need to update top */ |
1240 | originator->below = op; |
1247 | originator->below = op; |
1241 | } |
1248 | } |
1242 | else |
1249 | else |
1243 | { |
1250 | { |
|
|
1251 | top = ms.bot; |
|
|
1252 | |
1244 | /* If there are other objects, then */ |
1253 | /* If there are other objects, then */ |
1245 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1254 | if ((!(flag & INS_MAP_LOAD)) && top) |
1246 | { |
1255 | { |
1247 | object *last = 0; |
1256 | object *last = 0; |
1248 | |
1257 | |
1249 | /* |
1258 | /* |
1250 | * If there are multiple objects on this space, we do some trickier handling. |
1259 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1256 | * once we get to them. This reduces the need to traverse over all of |
1265 | * once we get to them. This reduces the need to traverse over all of |
1257 | * them when adding another one - this saves quite a bit of cpu time |
1266 | * them when adding another one - this saves quite a bit of cpu time |
1258 | * when lots of spells are cast in one area. Currently, it is presumed |
1267 | * when lots of spells are cast in one area. Currently, it is presumed |
1259 | * that flying non pickable objects are spell objects. |
1268 | * that flying non pickable objects are spell objects. |
1260 | */ |
1269 | */ |
1261 | while (top) |
1270 | for (top = ms.bot; top; top = top->above) |
1262 | { |
1271 | { |
1263 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1272 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1264 | floor = top; |
1273 | floor = top; |
1265 | |
1274 | |
1266 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1275 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1269 | top = top->below; |
1278 | top = top->below; |
1270 | break; |
1279 | break; |
1271 | } |
1280 | } |
1272 | |
1281 | |
1273 | last = top; |
1282 | last = top; |
1274 | top = top->above; |
|
|
1275 | } |
1283 | } |
1276 | |
1284 | |
1277 | /* Don't want top to be NULL, so set it to the last valid object */ |
1285 | /* Don't want top to be NULL, so set it to the last valid object */ |
1278 | top = last; |
1286 | top = last; |
1279 | |
1287 | |
… | |
… | |
1281 | * looks like instead of lots of conditions here. |
1289 | * looks like instead of lots of conditions here. |
1282 | * makes things faster, and effectively the same result. |
1290 | * makes things faster, and effectively the same result. |
1283 | */ |
1291 | */ |
1284 | |
1292 | |
1285 | /* Have object 'fall below' other objects that block view. |
1293 | /* Have object 'fall below' other objects that block view. |
1286 | * Unless those objects are exits, type 66 |
1294 | * Unless those objects are exits. |
1287 | * If INS_ON_TOP is used, don't do this processing |
1295 | * If INS_ON_TOP is used, don't do this processing |
1288 | * Need to find the object that in fact blocks view, otherwise |
1296 | * Need to find the object that in fact blocks view, otherwise |
1289 | * stacking is a bit odd. |
1297 | * stacking is a bit odd. |
1290 | */ |
1298 | */ |
1291 | if (!(flag & INS_ON_TOP) && |
1299 | if (!(flag & INS_ON_TOP) |
1292 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1300 | && ms.flags () & P_BLOCKSVIEW |
|
|
1301 | && (op->face && !faces [op->face].visibility)) |
1293 | { |
1302 | { |
1294 | for (last = top; last != floor; last = last->below) |
1303 | for (last = top; last != floor; last = last->below) |
1295 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1304 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1296 | break; |
1305 | break; |
|
|
1306 | |
1297 | /* Check to see if we found the object that blocks view, |
1307 | /* Check to see if we found the object that blocks view, |
1298 | * and make sure we have a below pointer for it so that |
1308 | * and make sure we have a below pointer for it so that |
1299 | * we can get inserted below this one, which requires we |
1309 | * we can get inserted below this one, which requires we |
1300 | * set top to the object below us. |
1310 | * set top to the object below us. |
1301 | */ |
1311 | */ |
… | |
… | |
1303 | top = last->below; |
1313 | top = last->below; |
1304 | } |
1314 | } |
1305 | } /* If objects on this space */ |
1315 | } /* If objects on this space */ |
1306 | |
1316 | |
1307 | if (flag & INS_MAP_LOAD) |
1317 | if (flag & INS_MAP_LOAD) |
1308 | top = GET_MAP_TOP (op->map, op->x, op->y); |
1318 | top = ms.top; |
1309 | |
1319 | |
1310 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1320 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1311 | top = floor; |
1321 | top = floor; |
1312 | |
1322 | |
1313 | /* Top is the object that our object (op) is going to get inserted above. |
1323 | /* Top is the object that our object (op) is going to get inserted above. |
1314 | */ |
1324 | */ |
1315 | |
1325 | |
1316 | /* First object on this space */ |
1326 | /* First object on this space */ |
1317 | if (!top) |
1327 | if (!top) |
1318 | { |
1328 | { |
1319 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1329 | op->above = ms.bot; |
1320 | |
1330 | |
1321 | if (op->above) |
1331 | if (op->above) |
1322 | op->above->below = op; |
1332 | op->above->below = op; |
1323 | |
1333 | |
1324 | op->below = 0; |
1334 | op->below = 0; |
1325 | op->ms ().bot = op; |
1335 | ms.bot = op; |
1326 | } |
1336 | } |
1327 | else |
1337 | else |
1328 | { /* get inserted into the stack above top */ |
1338 | { /* get inserted into the stack above top */ |
1329 | op->above = top->above; |
1339 | op->above = top->above; |
1330 | |
1340 | |
… | |
… | |
1334 | op->below = top; |
1344 | op->below = top; |
1335 | top->above = op; |
1345 | top->above = op; |
1336 | } |
1346 | } |
1337 | |
1347 | |
1338 | if (!op->above) |
1348 | if (!op->above) |
1339 | op->ms ().top = op; |
1349 | ms.top = op; |
1340 | } /* else not INS_BELOW_ORIGINATOR */ |
1350 | } /* else not INS_BELOW_ORIGINATOR */ |
1341 | |
1351 | |
1342 | if (op->type == PLAYER) |
1352 | if (op->type == PLAYER) |
1343 | { |
1353 | { |
1344 | op->contr->do_los = 1; |
1354 | op->contr->do_los = 1; |
… | |
… | |
1350 | |
1360 | |
1351 | /* If we have a floor, we know the player, if any, will be above |
1361 | /* If we have a floor, we know the player, if any, will be above |
1352 | * it, so save a few ticks and start from there. |
1362 | * it, so save a few ticks and start from there. |
1353 | */ |
1363 | */ |
1354 | if (!(flag & INS_MAP_LOAD)) |
1364 | if (!(flag & INS_MAP_LOAD)) |
1355 | if (object *pl = op->ms ().player ()) |
1365 | if (object *pl = ms.player ()) |
1356 | if (pl->contr->ns) |
1366 | if (pl->contr->ns) |
1357 | pl->contr->ns->floorbox_update (); |
1367 | pl->contr->ns->floorbox_update (); |
1358 | |
1368 | |
1359 | /* If this object glows, it may affect lighting conditions that are |
1369 | /* If this object glows, it may affect lighting conditions that are |
1360 | * visible to others on this map. But update_all_los is really |
1370 | * visible to others on this map. But update_all_los is really |
… | |
… | |
1419 | tmp1->x = op->x; |
1429 | tmp1->x = op->x; |
1420 | tmp1->y = op->y; |
1430 | tmp1->y = op->y; |
1421 | insert_ob_in_map (tmp1, op->map, op, 0); |
1431 | insert_ob_in_map (tmp1, op->map, op, 0); |
1422 | } |
1432 | } |
1423 | |
1433 | |
|
|
1434 | // XXX: function not returning object* |
1424 | object * |
1435 | object * |
1425 | object::insert_at (object *where, object *originator, int flags) |
1436 | object::insert_at (object *where, object *originator, int flags) |
1426 | { |
1437 | { |
1427 | where->map->insert (this, where->x, where->y, originator, flags); |
1438 | where->map->insert (this, where->x, where->y, originator, flags); |
1428 | } |
1439 | } |
… | |
… | |
1769 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1780 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1770 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1781 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1771 | { |
1782 | { |
1772 | |
1783 | |
1773 | float |
1784 | float |
1774 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1785 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1775 | |
1786 | |
1776 | if (op->type == PLAYER) |
1787 | if (op->type == PLAYER) |
1777 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1788 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1778 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1789 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1779 | diff /= 4.0; |
1790 | diff /= 4.0; |
… | |
… | |
1986 | } |
1997 | } |
1987 | |
1998 | |
1988 | if (!index) |
1999 | if (!index) |
1989 | return -1; |
2000 | return -1; |
1990 | |
2001 | |
1991 | return altern[RANDOM () % index]; |
2002 | return altern [rndm (index)]; |
1992 | } |
2003 | } |
1993 | |
2004 | |
1994 | /* |
2005 | /* |
1995 | * find_first_free_spot(archetype, maptile, x, y) works like |
2006 | * find_first_free_spot(archetype, maptile, x, y) works like |
1996 | * find_free_spot(), but it will search max number of squares. |
2007 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2017 | { |
2028 | { |
2018 | arr += begin; |
2029 | arr += begin; |
2019 | end -= begin; |
2030 | end -= begin; |
2020 | |
2031 | |
2021 | while (--end) |
2032 | while (--end) |
2022 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2033 | swap (arr [end], arr [rndm (end + 1)]); |
2023 | } |
2034 | } |
2024 | |
2035 | |
2025 | /* new function to make monster searching more efficient, and effective! |
2036 | /* new function to make monster searching more efficient, and effective! |
2026 | * This basically returns a randomized array (in the passed pointer) of |
2037 | * This basically returns a randomized array (in the passed pointer) of |
2027 | * the spaces to find monsters. In this way, it won't always look for |
2038 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2161 | |
2172 | |
2162 | return 3; |
2173 | return 3; |
2163 | } |
2174 | } |
2164 | |
2175 | |
2165 | /* |
2176 | /* |
2166 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2167 | * the "absolute" direction of a number (it actually takes care of |
|
|
2168 | * "overflow" in previous calculations of a direction). |
|
|
2169 | */ |
|
|
2170 | |
|
|
2171 | int |
|
|
2172 | absdir (int d) |
|
|
2173 | { |
|
|
2174 | while (d < 1) |
|
|
2175 | d += 8; |
|
|
2176 | |
|
|
2177 | while (d > 8) |
|
|
2178 | d -= 8; |
|
|
2179 | |
|
|
2180 | return d; |
|
|
2181 | } |
|
|
2182 | |
|
|
2183 | /* |
|
|
2184 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2177 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2185 | * between two directions (which are expected to be absolute (see absdir()) |
2178 | * between two directions (which are expected to be absolute (see absdir()) |
2186 | */ |
2179 | */ |
2187 | |
|
|
2188 | int |
2180 | int |
2189 | dirdiff (int dir1, int dir2) |
2181 | dirdiff (int dir1, int dir2) |
2190 | { |
2182 | { |
2191 | int d; |
2183 | int d; |
2192 | |
2184 | |
… | |
… | |
2358 | insert_ob_in_ob (object_create_clone (item), dst); |
2350 | insert_ob_in_ob (object_create_clone (item), dst); |
2359 | |
2351 | |
2360 | return dst; |
2352 | return dst; |
2361 | } |
2353 | } |
2362 | |
2354 | |
2363 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2364 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2365 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2366 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2367 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2368 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2369 | object * |
|
|
2370 | load_object_str (const char *obstr) |
|
|
2371 | { |
|
|
2372 | object *op; |
|
|
2373 | char filename[MAX_BUF]; |
|
|
2374 | |
|
|
2375 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2376 | |
|
|
2377 | FILE *tempfile = fopen (filename, "w"); |
|
|
2378 | |
|
|
2379 | if (tempfile == NULL) |
|
|
2380 | { |
|
|
2381 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2382 | return NULL; |
|
|
2383 | } |
|
|
2384 | |
|
|
2385 | fprintf (tempfile, obstr); |
|
|
2386 | fclose (tempfile); |
|
|
2387 | |
|
|
2388 | op = object::create (); |
|
|
2389 | |
|
|
2390 | object_thawer thawer (filename); |
|
|
2391 | |
|
|
2392 | if (thawer) |
|
|
2393 | load_object (thawer, op, 0); |
|
|
2394 | |
|
|
2395 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2396 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2397 | |
|
|
2398 | return op; |
|
|
2399 | } |
|
|
2400 | |
|
|
2401 | /* This returns the first object in who's inventory that |
2355 | /* This returns the first object in who's inventory that |
2402 | * has the same type and subtype match. |
2356 | * has the same type and subtype match. |
2403 | * returns NULL if no match. |
2357 | * returns NULL if no match. |
2404 | */ |
2358 | */ |
2405 | object * |
2359 | object * |
… | |
… | |
2458 | if (link->key == canonical_key) |
2412 | if (link->key == canonical_key) |
2459 | return link->value; |
2413 | return link->value; |
2460 | |
2414 | |
2461 | return 0; |
2415 | return 0; |
2462 | } |
2416 | } |
2463 | |
|
|
2464 | |
2417 | |
2465 | /* |
2418 | /* |
2466 | * Updates the canonical_key in op to value. |
2419 | * Updates the canonical_key in op to value. |
2467 | * |
2420 | * |
2468 | * canonical_key is a shared string (value doesn't have to be). |
2421 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2608 | { |
2561 | { |
2609 | char flagdesc[512]; |
2562 | char flagdesc[512]; |
2610 | char info2[256 * 4]; |
2563 | char info2[256 * 4]; |
2611 | char *p = info; |
2564 | char *p = info; |
2612 | |
2565 | |
2613 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2566 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2614 | count, uuid.seq, |
2567 | count, uuid.seq, |
2615 | &name, |
2568 | &name, |
2616 | title ? "\",title:" : "", |
2569 | title ? "\",title:\"" : "", |
2617 | title ? (const char *)title : "", |
2570 | title ? (const char *)title : "", |
2618 | flag_desc (flagdesc, 512), type); |
2571 | flag_desc (flagdesc, 512), type); |
2619 | |
2572 | |
2620 | if (env) |
2573 | if (env) |
2621 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2574 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
… | |
… | |
2631 | { |
2584 | { |
2632 | static char info[256 * 4]; |
2585 | static char info[256 * 4]; |
2633 | return debug_desc (info); |
2586 | return debug_desc (info); |
2634 | } |
2587 | } |
2635 | |
2588 | |
|
|
2589 | const char * |
|
|
2590 | object::debug_desc2 () const |
|
|
2591 | { |
|
|
2592 | static char info[256 * 4]; |
|
|
2593 | return debug_desc (info); |
|
|
2594 | } |
|
|
2595 | |
|
|
2596 | struct region * |
|
|
2597 | object::region () const |
|
|
2598 | { |
|
|
2599 | return map ? map->region (x, y) |
|
|
2600 | : region::default_region (); |
|
|
2601 | } |
|
|
2602 | |
|
|
2603 | const materialtype_t * |
|
|
2604 | object::dominant_material () const |
|
|
2605 | { |
|
|
2606 | if (materialtype_t *mat = name_to_material (materialname)) |
|
|
2607 | return mat; |
|
|
2608 | |
|
|
2609 | // omfg this is slow, this has to be temporary :) |
|
|
2610 | shstr unknown ("unknown"); |
|
|
2611 | |
|
|
2612 | return name_to_material (unknown); |
|
|
2613 | } |
|
|
2614 | |
|
|
2615 | void |
|
|
2616 | object::open_container (object *new_container) |
|
|
2617 | { |
|
|
2618 | if (container == new_container) |
|
|
2619 | return; |
|
|
2620 | |
|
|
2621 | if (object *old_container = container) |
|
|
2622 | { |
|
|
2623 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2624 | return; |
|
|
2625 | |
|
|
2626 | #if 0 |
|
|
2627 | // remove the "Close old_container" object. |
|
|
2628 | if (object *closer = old_container->inv) |
|
|
2629 | if (closer->type == CLOSE_CON) |
|
|
2630 | closer->destroy (); |
|
|
2631 | #endif |
|
|
2632 | |
|
|
2633 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2634 | container = 0; |
|
|
2635 | |
|
|
2636 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2637 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2638 | } |
|
|
2639 | |
|
|
2640 | if (new_container) |
|
|
2641 | { |
|
|
2642 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2643 | return; |
|
|
2644 | |
|
|
2645 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2646 | #if 0 |
|
|
2647 | // insert the "Close Container" object. |
|
|
2648 | if (archetype *closer = new_container->other_arch) |
|
|
2649 | { |
|
|
2650 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2651 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2652 | new_container->insert (closer); |
|
|
2653 | } |
|
|
2654 | #endif |
|
|
2655 | |
|
|
2656 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2657 | |
|
|
2658 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2659 | container = new_container; |
|
|
2660 | |
|
|
2661 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2662 | esrv_send_inventory (this, new_container); |
|
|
2663 | } |
|
|
2664 | } |
|
|
2665 | |
|
|
2666 | |