1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <unistd.h> |
25 | #include <unistd.h> |
26 | |
26 | |
27 | #include "global.h" |
27 | #include "global.h" |
28 | #include "loader.h" |
|
|
29 | #include "path.h" |
28 | #include "path.h" |
30 | |
29 | |
31 | //+GPL |
30 | //+GPL |
32 | |
31 | |
33 | sint8 maptile::outdoor_darkness; |
32 | sint8 maptile::outdoor_darkness; |
… | |
… | |
111 | /* We basically go through the stack of objects, and if there is |
110 | /* We basically go through the stack of objects, and if there is |
112 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
111 | * some other object that has NO_PASS or FLAG_ALIVE set, return |
113 | * true. If we get through the entire stack, that must mean |
112 | * true. If we get through the entire stack, that must mean |
114 | * ob is blocking it, so return 0. |
113 | * ob is blocking it, so return 0. |
115 | */ |
114 | */ |
116 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
115 | for (object *tmp = ms.top; tmp; tmp = tmp->below) |
117 | { |
116 | { |
118 | if (OB_MOVE_BLOCK (ob, tmp)) |
117 | if (OB_MOVE_BLOCK (ob, tmp)) |
119 | { |
118 | { |
120 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
119 | if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob)) |
121 | if (RESULT_INT (0)) |
120 | if (RESULT_INT (0)) |
… | |
… | |
145 | return 1; // unconditional block |
144 | return 1; // unconditional block |
146 | |
145 | |
147 | } else { |
146 | } else { |
148 | // space does not block the ob, directly, but |
147 | // space does not block the ob, directly, but |
149 | // anything alive that is not a door still |
148 | // anything alive that is not a door still |
150 | // blocks anything but wizards. |
149 | // blocks anything |
151 | |
150 | |
152 | if (tmp->flag [FLAG_ALIVE] |
151 | if (tmp->flag [FLAG_ALIVE] |
153 | && tmp->head_ () != ob |
|
|
154 | && tmp != ob |
|
|
155 | && tmp->type != DOOR |
152 | && tmp->type != DOOR |
156 | && !tmp->flag [FLAG_WIZPASS]) |
153 | && tmp->head_ () != ob) //TODO: maybe move these check up? |
157 | return 1; |
154 | return 1; |
158 | } |
155 | } |
159 | } |
156 | } |
160 | |
157 | |
161 | return 0; |
158 | return 0; |
162 | } |
159 | } |
163 | |
160 | |
164 | /* |
161 | /* |
165 | * Returns qthe blocking object if the given object can't fit in the given |
162 | * Returns the blocking object if the given object can't fit in the given |
166 | * spot. This is meant for multi space objects - for single space objecs, |
163 | * spot. This is meant for multi space objects - for single space objecs, |
167 | * just calling get_map_blocked and checking that against movement type |
164 | * just calling get_map_blocked and checking that against movement type |
168 | * of object. This function goes through all the parts of the multipart |
165 | * of object. This function goes through all the parts of the multipart |
169 | * object and makes sure they can be inserted. |
166 | * object and makes sure they can be inserted. |
170 | * |
167 | * |
… | |
… | |
217 | } |
214 | } |
218 | |
215 | |
219 | return 0; |
216 | return 0; |
220 | } |
217 | } |
221 | |
218 | |
222 | /* When the map is loaded, load_object does not actually insert objects |
|
|
223 | * into inventory, but just links them. What this does is go through |
|
|
224 | * and insert them properly. |
|
|
225 | * The object 'container' is the object that contains the inventory. |
|
|
226 | * This is needed so that we can update the containers weight. |
|
|
227 | */ |
|
|
228 | static void |
|
|
229 | fix_container (object *container) |
|
|
230 | { |
|
|
231 | object *tmp = container->inv, *next; |
|
|
232 | |
|
|
233 | container->inv = 0; |
|
|
234 | while (tmp) |
|
|
235 | { |
|
|
236 | next = tmp->below; |
|
|
237 | if (tmp->inv) |
|
|
238 | fix_container (tmp); |
|
|
239 | |
|
|
240 | insert_ob_in_ob (tmp, container); |
|
|
241 | tmp = next; |
|
|
242 | } |
|
|
243 | |
|
|
244 | // go through and calculate what all the containers are carrying. |
|
|
245 | //TODO: remove |
|
|
246 | container->update_weight (); |
|
|
247 | } |
|
|
248 | |
|
|
249 | //-GPL |
219 | //-GPL |
250 | |
220 | |
251 | void |
221 | void |
252 | maptile::set_object_flag (int flag, int value) |
222 | maptile::set_object_flag (int flag, int value) |
253 | { |
223 | { |
… | |
… | |
268 | set_object_flag (FLAG_OBJ_ORIGINAL); |
238 | set_object_flag (FLAG_OBJ_ORIGINAL); |
269 | |
239 | |
270 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
240 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
271 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
241 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
272 | INVOKE_OBJECT (RESET, tmp); |
242 | INVOKE_OBJECT (RESET, tmp); |
|
|
243 | } |
|
|
244 | |
|
|
245 | void |
|
|
246 | maptile::post_load () |
|
|
247 | { |
|
|
248 | #if 0 |
|
|
249 | if (!spaces) |
|
|
250 | return; |
|
|
251 | |
|
|
252 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
253 | for (object *tmp = ms->bot; tmp; tmp = tmp->above) |
|
|
254 | ; // nop |
|
|
255 | #endif |
273 | } |
256 | } |
274 | |
257 | |
275 | //+GPL |
258 | //+GPL |
276 | |
259 | |
277 | /* link_multipart_objects go through all the objects on the map looking |
260 | /* link_multipart_objects go through all the objects on the map looking |
… | |
… | |
438 | return false; |
421 | return false; |
439 | |
422 | |
440 | return freezer.save (path); |
423 | return freezer.save (path); |
441 | } |
424 | } |
442 | |
425 | |
443 | maptile::maptile () |
426 | void |
|
|
427 | maptile::init () |
444 | { |
428 | { |
445 | in_memory = MAP_SWAPPED; |
429 | in_memory = MAP_SWAPPED; |
446 | |
430 | |
447 | /* The maps used to pick up default x and y values from the |
431 | /* The maps used to pick up default x and y values from the |
448 | * map archetype. Mimic that behaviour. |
432 | * map archetype. Mimic that behaviour. |
449 | */ |
433 | */ |
450 | width = 16; |
434 | width = 16; |
451 | height = 16; |
435 | height = 16; |
452 | timeout = 300; |
436 | timeout = 300; |
453 | max_items = MAX_ITEM_PER_ACTION; |
437 | max_items = MAX_ITEM_PER_ACTION; |
454 | max_volume = 2000000; // 2m³ |
438 | max_volume = 2000000; // 2m³ |
455 | } |
|
|
456 | |
|
|
457 | maptile::maptile (int w, int h) |
|
|
458 | { |
|
|
459 | in_memory = MAP_SWAPPED; |
|
|
460 | |
|
|
461 | width = w; |
|
|
462 | height = h; |
|
|
463 | reset_timeout = 0; |
439 | reset_timeout = 0; |
464 | timeout = 300; |
|
|
465 | enter_x = 0; |
440 | enter_x = 0; |
466 | enter_y = 0; |
441 | enter_y = 0; |
|
|
442 | } |
|
|
443 | |
|
|
444 | maptile::maptile () |
|
|
445 | { |
|
|
446 | init (); |
|
|
447 | } |
|
|
448 | |
|
|
449 | maptile::maptile (int w, int h) |
|
|
450 | { |
|
|
451 | init (); |
|
|
452 | |
|
|
453 | width = w; |
|
|
454 | height = h; |
467 | |
455 | |
468 | alloc (); |
456 | alloc (); |
469 | } |
457 | } |
470 | |
458 | |
471 | /* |
459 | /* |
… | |
… | |
644 | case KW_shopgreed: thawer.get (shopgreed); break; |
632 | case KW_shopgreed: thawer.get (shopgreed); break; |
645 | case KW_shopmin: thawer.get (shopmin); break; |
633 | case KW_shopmin: thawer.get (shopmin); break; |
646 | case KW_shopmax: thawer.get (shopmax); break; |
634 | case KW_shopmax: thawer.get (shopmax); break; |
647 | case KW_shoprace: thawer.get (shoprace); break; |
635 | case KW_shoprace: thawer.get (shoprace); break; |
648 | case KW_outdoor: thawer.get (outdoor); break; |
636 | case KW_outdoor: thawer.get (outdoor); break; |
649 | case KW_temp: thawer.get (temp); break; |
|
|
650 | case KW_pressure: thawer.get (pressure); break; |
|
|
651 | case KW_humid: thawer.get (humid); break; |
|
|
652 | case KW_windspeed: thawer.get (windspeed); break; |
|
|
653 | case KW_winddir: thawer.get (winddir); break; |
|
|
654 | case KW_sky: thawer.get (sky); break; |
|
|
655 | |
637 | |
656 | case KW_per_player: thawer.get (per_player); break; |
638 | case KW_per_player: thawer.get (per_player); break; |
657 | case KW_per_party: thawer.get (per_party); break; |
639 | case KW_per_party: thawer.get (per_party); break; |
658 | case KW_no_reset: thawer.get (no_reset); break; |
640 | case KW_no_reset: thawer.get (no_reset); break; |
659 | case KW_no_drop: thawer.get (no_drop); break; |
641 | case KW_no_drop: thawer.get (no_drop); break; |
… | |
… | |
684 | case KW_end: |
666 | case KW_end: |
685 | thawer.next (); |
667 | thawer.next (); |
686 | return true; |
668 | return true; |
687 | |
669 | |
688 | default: |
670 | default: |
689 | if (!thawer.parse_error ("map", 0)) |
671 | if (!thawer.parse_error ("map")) |
690 | return false; |
672 | return false; |
691 | break; |
673 | break; |
692 | } |
674 | } |
693 | |
675 | |
694 | thawer.next (); |
676 | thawer.next (); |
… | |
… | |
712 | int unique = 0; |
694 | int unique = 0; |
713 | for (object *op = spaces [i].bot; op; ) |
695 | for (object *op = spaces [i].bot; op; ) |
714 | { |
696 | { |
715 | object *above = op->above; |
697 | object *above = op->above; |
716 | |
698 | |
717 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
699 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
718 | unique = 1; |
700 | unique = 1; |
719 | |
701 | |
720 | if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) |
702 | if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique)) |
721 | op->destroy (); |
703 | op->destroy (); |
722 | |
704 | |
723 | op = above; |
705 | op = above; |
724 | } |
706 | } |
725 | } |
707 | } |
… | |
… | |
728 | //-GPL |
710 | //-GPL |
729 | |
711 | |
730 | bool |
712 | bool |
731 | maptile::_save_header (object_freezer &freezer) |
713 | maptile::_save_header (object_freezer &freezer) |
732 | { |
714 | { |
733 | #define MAP_OUT(k) freezer.put (KW_ ## k, k) |
715 | #define MAP_OUT(k) freezer.put (KW(k), k) |
734 | #define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) |
716 | #define MAP_OUT2(k,v) freezer.put (KW(k), v) |
735 | |
717 | |
736 | MAP_OUT2 (arch, "map"); |
718 | MAP_OUT2 (arch, CS(map)); |
737 | |
719 | |
738 | if (name) MAP_OUT (name); |
720 | if (name) MAP_OUT (name); |
739 | MAP_OUT (swap_time); |
721 | MAP_OUT (swap_time); |
740 | MAP_OUT (reset_time); |
722 | MAP_OUT (reset_time); |
741 | MAP_OUT (reset_timeout); |
723 | MAP_OUT (reset_timeout); |
… | |
… | |
749 | MAP_OUT (shopgreed); |
731 | MAP_OUT (shopgreed); |
750 | MAP_OUT (shopmin); |
732 | MAP_OUT (shopmin); |
751 | MAP_OUT (shopmax); |
733 | MAP_OUT (shopmax); |
752 | if (shoprace) MAP_OUT (shoprace); |
734 | if (shoprace) MAP_OUT (shoprace); |
753 | |
735 | |
754 | MAP_OUT (darkness); |
|
|
755 | MAP_OUT (width); |
736 | MAP_OUT (width); |
756 | MAP_OUT (height); |
737 | MAP_OUT (height); |
757 | MAP_OUT (enter_x); |
738 | MAP_OUT (enter_x); |
758 | MAP_OUT (enter_y); |
739 | MAP_OUT (enter_y); |
759 | |
740 | MAP_OUT (darkness); |
760 | if (msg) freezer.put (KW_msg , KW_endmsg , msg); |
|
|
761 | if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore); |
|
|
762 | |
|
|
763 | MAP_OUT (outdoor); |
741 | MAP_OUT (outdoor); |
764 | MAP_OUT (temp); |
742 | |
765 | MAP_OUT (pressure); |
743 | if (msg) freezer.put (KW(msg) , KW(endmsg) , msg); |
766 | MAP_OUT (humid); |
744 | if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore); |
767 | MAP_OUT (windspeed); |
|
|
768 | MAP_OUT (winddir); |
|
|
769 | MAP_OUT (sky); |
|
|
770 | |
745 | |
771 | MAP_OUT (per_player); |
746 | MAP_OUT (per_player); |
772 | MAP_OUT (per_party); |
747 | MAP_OUT (per_party); |
773 | |
748 | |
774 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
749 | if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); |
775 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
750 | if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); |
776 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
751 | if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); |
777 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
752 | if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); |
778 | |
753 | |
779 | freezer.put (this); |
754 | freezer.put (this); |
780 | freezer.put (KW_end); |
755 | freezer.put (KW(end)); |
781 | |
756 | |
782 | return true; |
757 | return true; |
783 | } |
758 | } |
784 | |
759 | |
785 | bool |
760 | bool |
… | |
… | |
870 | |
845 | |
871 | clear (); |
846 | clear (); |
872 | } |
847 | } |
873 | |
848 | |
874 | /* decay and destroy perishable items in a map */ |
849 | /* decay and destroy perishable items in a map */ |
|
|
850 | // TODO: should be done regularly, not on map load? |
875 | void |
851 | void |
876 | maptile::do_decay_objects () |
852 | maptile::do_decay_objects () |
877 | { |
853 | { |
878 | if (!spaces) |
854 | if (!spaces) |
879 | return; |
855 | return; |
… | |
… | |
881 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
857 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
882 | for (object *above, *op = ms->bot; op; op = above) |
858 | for (object *above, *op = ms->bot; op; op = above) |
883 | { |
859 | { |
884 | above = op->above; |
860 | above = op->above; |
885 | |
861 | |
|
|
862 | // do not decay anything above unique floor tiles (yet :) |
|
|
863 | if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE]) |
|
|
864 | break; |
|
|
865 | |
886 | bool destroy = 0; |
866 | bool destroy = 0; |
887 | |
867 | |
888 | // do not decay anything above unique floor tiles (yet :) |
868 | if (op->flag [FLAG_IS_FLOOR] |
889 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
869 | || op->flag [FLAG_OBJ_ORIGINAL] |
890 | break; |
870 | || op->flag [FLAG_UNIQUE] |
891 | |
871 | || op->flag [FLAG_OVERLAY_FLOOR] |
892 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
872 | || op->flag [FLAG_UNPAID] |
893 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
894 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
895 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
896 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
897 | || op->is_alive ()) |
873 | || op->is_alive ()) |
898 | ; // do not decay |
874 | ; // do not decay |
899 | else if (op->is_weapon ()) |
875 | else if (op->is_weapon ()) |
900 | { |
876 | { |
901 | op->stats.dam--; |
877 | op->stats.dam--; |
… | |
… | |
926 | || mat & M_LIQUID |
902 | || mat & M_LIQUID |
927 | || (mat & M_IRON && rndm (1, 5) == 1) |
903 | || (mat & M_IRON && rndm (1, 5) == 1) |
928 | || (mat & M_GLASS && rndm (1, 2) == 1) |
904 | || (mat & M_GLASS && rndm (1, 2) == 1) |
929 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
905 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
930 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
906 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
931 | || (mat & M_ICE && temp > 32)) |
907 | //|| (mat & M_ICE && temp > 32) |
|
|
908 | ) |
932 | destroy = 1; |
909 | destroy = 1; |
933 | } |
910 | } |
934 | |
911 | |
935 | /* adjust overall chance below */ |
912 | /* adjust overall chance below */ |
936 | if (destroy && rndm (0, 1)) |
913 | if (destroy && rndm (0, 1)) |
… | |
… | |
956 | sint64 total_exp = 0; |
933 | sint64 total_exp = 0; |
957 | |
934 | |
958 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
935 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
959 | for (object *op = ms->bot; op; op = op->above) |
936 | for (object *op = ms->bot; op; op = op->above) |
960 | { |
937 | { |
961 | if (QUERY_FLAG (op, FLAG_MONSTER)) |
938 | if (op->flag [FLAG_MONSTER]) |
962 | { |
939 | { |
963 | total_exp += op->stats.exp; |
940 | total_exp += op->stats.exp; |
964 | monster_cnt++; |
941 | monster_cnt++; |
965 | } |
942 | } |
966 | |
943 | |
967 | if (QUERY_FLAG (op, FLAG_GENERATOR)) |
944 | if (op->flag [FLAG_GENERATOR]) |
968 | { |
945 | { |
969 | total_exp += op->stats.exp; |
946 | total_exp += op->stats.exp; |
970 | |
947 | |
971 | if (archetype *at = op->other_arch) |
948 | if (archetype *at = op->other_arch) |
972 | { |
949 | { |
… | |
… | |
1033 | sint8 light = 0; |
1010 | sint8 light = 0; |
1034 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1011 | MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; |
1035 | uint64_t volume = 0; |
1012 | uint64_t volume = 0; |
1036 | uint32_t items = 0; |
1013 | uint32_t items = 0; |
1037 | object *anywhere = 0; |
1014 | object *anywhere = 0; |
|
|
1015 | uint8_t middle_visibility = 0; |
1038 | |
1016 | |
1039 | //object *middle = 0; |
1017 | //object *middle = 0; |
1040 | //object *top = 0; |
1018 | //object *top = 0; |
1041 | //object *floor = 0; |
1019 | //object *floor = 0; |
1042 | // this seems to generate better code than using locals, above |
1020 | // this seems to generate better code than using locals, above |
… | |
… | |
1059 | * |
1037 | * |
1060 | * Always put the player down for drawing. |
1038 | * Always put the player down for drawing. |
1061 | */ |
1039 | */ |
1062 | if (expect_true (!tmp->invisible)) |
1040 | if (expect_true (!tmp->invisible)) |
1063 | { |
1041 | { |
1064 | if (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]) |
1042 | if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER])) |
1065 | top = tmp; |
1043 | top = tmp; |
|
|
1044 | else if (expect_false (tmp->flag [FLAG_IS_FLOOR])) |
|
|
1045 | { |
|
|
1046 | /* If we got a floor, that means middle and top were below it, |
|
|
1047 | * so should not be visible, so we clear them. |
|
|
1048 | */ |
|
|
1049 | middle = 0; |
|
|
1050 | top = 0; |
|
|
1051 | floor = tmp; |
|
|
1052 | volume = 0; |
|
|
1053 | items = 0; |
|
|
1054 | } |
1066 | else |
1055 | else |
1067 | { |
1056 | { |
1068 | if (expect_false (tmp->flag [FLAG_IS_FLOOR])) |
1057 | if (expect_true (!tmp->flag [FLAG_NO_PICK])) |
1069 | { |
1058 | { |
1070 | /* If we got a floor, that means middle and top were below it, |
|
|
1071 | * so should not be visible, so we clear them. |
|
|
1072 | */ |
|
|
1073 | middle = 0; |
|
|
1074 | top = 0; |
|
|
1075 | floor = tmp; |
|
|
1076 | volume = 0; |
|
|
1077 | items = 0; |
1059 | ++items; |
|
|
1060 | volume += tmp->volume (); |
1078 | } |
1061 | } |
|
|
1062 | |
|
|
1063 | /* Flag anywhere have high priority */ |
|
|
1064 | if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE])) |
|
|
1065 | anywhere = tmp; |
|
|
1066 | |
|
|
1067 | /* Find the highest visible face around. If equal |
|
|
1068 | * visibilities, we still want the one nearer to the |
|
|
1069 | * top |
1079 | else |
1070 | */ |
|
|
1071 | if (expect_false (::faces [tmp->face].visibility >= middle_visibility)) |
1080 | { |
1072 | { |
1081 | if (expect_true (!tmp->flag [FLAG_NO_PICK])) |
1073 | middle_visibility = ::faces [tmp->face].visibility; |
1082 | { |
|
|
1083 | ++items; |
|
|
1084 | volume += tmp->volume (); |
|
|
1085 | } |
|
|
1086 | |
|
|
1087 | /* Flag anywhere have high priority */ |
|
|
1088 | if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE])) |
|
|
1089 | anywhere = tmp; |
|
|
1090 | /* Find the highest visible face around. If equal |
|
|
1091 | * visibilities, we still want the one nearer to the |
|
|
1092 | * top |
|
|
1093 | */ |
|
|
1094 | else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility)) |
|
|
1095 | middle = tmp; |
1074 | middle = tmp; |
1096 | } |
1075 | } |
1097 | } |
1076 | } |
1098 | } |
1077 | } |
1099 | |
1078 | |
1100 | move_slow |= tmp->move_slow; |
1079 | move_slow |= tmp->move_slow; |
… | |
… | |
1152 | */ |
1131 | */ |
1153 | |
1132 | |
1154 | for (object *tmp = last; tmp; tmp = tmp->below) |
1133 | for (object *tmp = last; tmp; tmp = tmp->below) |
1155 | { |
1134 | { |
1156 | /* Once we get to a floor, stop, since we already have a floor object */ |
1135 | /* Once we get to a floor, stop, since we already have a floor object */ |
1157 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1136 | if (tmp->flag [FLAG_IS_FLOOR]) |
1158 | break; |
1137 | break; |
1159 | |
1138 | |
1160 | /* If two top faces are already set, quit processing */ |
1139 | /* If two top faces are already set, quit processing */ |
1161 | if (top && middle) |
1140 | if (top && middle) |
1162 | break; |
1141 | break; |
… | |
… | |
1445 | * |
1424 | * |
1446 | * currently, the only flag supported (0x1) is don't translate for |
1425 | * currently, the only flag supported (0x1) is don't translate for |
1447 | * closest body part of 'op1' |
1426 | * closest body part of 'op1' |
1448 | */ |
1427 | */ |
1449 | void |
1428 | void |
1450 | get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) |
1429 | get_rangevector (object *op1, object *op2, rv_vector *retval, int flags) |
1451 | { |
1430 | { |
1452 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1431 | if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) |
1453 | { |
1432 | { |
1454 | /* be conservative and fill in _some_ data */ |
1433 | /* be conservative and fill in _some_ data */ |
1455 | retval->distance = 10000; |
1434 | retval->distance = 10000; |
1456 | retval->distance_x = 10000; |
1435 | retval->distance_x = 10000; |
1457 | retval->distance_y = 10000; |
1436 | retval->distance_y = 10000; |
1458 | retval->direction = 0; |
1437 | retval->direction = 0; |
1459 | retval->part = 0; |
1438 | retval->part = 0; |
1460 | } |
1439 | } |
1461 | else |
1440 | else |
1462 | { |
1441 | { |
1463 | object *best; |
|
|
1464 | |
|
|
1465 | retval->distance_x += op2->x - op1->x; |
1442 | retval->distance_x += op2->x - op1->x; |
1466 | retval->distance_y += op2->y - op1->y; |
1443 | retval->distance_y += op2->y - op1->y; |
1467 | |
1444 | |
1468 | best = op1; |
1445 | object *best = op1; |
|
|
1446 | |
1469 | /* If this is multipart, find the closest part now */ |
1447 | /* If this is multipart, find the closest part now */ |
1470 | if (!(flags & 0x1) && op1->more) |
1448 | if (!(flags & 1) && op1->more) |
1471 | { |
1449 | { |
1472 | int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; |
1450 | int best_distance = idistance (retval->distance_x, retval->distance_y); |
1473 | |
1451 | |
1474 | /* we just take the offset of the piece to head to figure |
1452 | /* we just take the offset of the piece to head to figure |
1475 | * distance instead of doing all that work above again |
1453 | * distance instead of doing all that work above again |
1476 | * since the distance fields we set above are positive in the |
1454 | * since the distance fields we set above are positive in the |
1477 | * same axis as is used for multipart objects, the simply arithmetic |
1455 | * same axis as is used for multipart objects, the simply arithmetic |
1478 | * below works. |
1456 | * below works. |
1479 | */ |
1457 | */ |
1480 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1458 | for (object *tmp = op1->more; tmp; tmp = tmp->more) |
1481 | { |
1459 | { |
1482 | tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + |
1460 | int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y); |
1483 | (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); |
1461 | |
1484 | if (tmpi < best_distance) |
1462 | if (tmpi < best_distance) |
1485 | { |
1463 | { |
1486 | best_distance = tmpi; |
1464 | best_distance = tmpi; |
1487 | best = tmp; |
1465 | best = tmp; |
1488 | } |
1466 | } |
1489 | } |
1467 | } |
1490 | |
1468 | |
1491 | if (best != op1) |
1469 | if (best != op1) |
1492 | { |
1470 | { |
… | |
… | |
1588 | */ |
1566 | */ |
1589 | for (int i = 1000; --i;) |
1567 | for (int i = 1000; --i;) |
1590 | { |
1568 | { |
1591 | object *pick = at (gen (width), gen (height)).bot; |
1569 | object *pick = at (gen (width), gen (height)).bot; |
1592 | |
1570 | |
1593 | // do not prefer big monsters just because they are big. |
1571 | // must be head: do not prefer big monsters just because they are big. |
1594 | if (pick && pick->is_head ()) |
1572 | if (pick && pick->is_head ()) |
1595 | return pick->head_ (); |
1573 | return pick; |
1596 | } |
1574 | } |
1597 | |
1575 | |
1598 | // instead of crashing in the unlikely(?) case, try to return *something* |
1576 | // instead of crashing in the unlikely(?) case, try to return *something* |
1599 | return archetype::find (shstr_bug); |
1577 | return archetype::find (shstr_bug); |
1600 | } |
1578 | } |
… | |
… | |
1633 | |
1611 | |
1634 | if (distance <= MAX_SOUND_DISTANCE) |
1612 | if (distance <= MAX_SOUND_DISTANCE) |
1635 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1613 | ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); |
1636 | } |
1614 | } |
1637 | } |
1615 | } |
|
|
1616 | |
|
|
1617 | dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25); |
1638 | |
1618 | |
1639 | static void |
1619 | static void |
1640 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1620 | split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) |
1641 | { |
1621 | { |
1642 | // clip to map to the left |
1622 | // clip to map to the left |
… | |
… | |
1698 | r->dx = dx; |
1678 | r->dx = dx; |
1699 | r->dy = dy; |
1679 | r->dy = dy; |
1700 | } |
1680 | } |
1701 | |
1681 | |
1702 | maprect * |
1682 | maprect * |
1703 | maptile::split_to_tiles (int x0, int y0, int x1, int y1) |
1683 | maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1) |
1704 | { |
1684 | { |
1705 | static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8); |
|
|
1706 | buf.clear (); |
1685 | buf.clear (); |
1707 | |
1686 | |
1708 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1687 | ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); |
1709 | |
1688 | |
1710 | // add end marker |
1689 | // add end marker |