4 * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke
6 * This software may be copied and distributed for educational, research,
7 * and not for profit purposes provided that this copyright and statement
8 * are included in all such copies. Other copyrights may also apply.
11 /* Purpose: low level dungeon routines -BEN- */
18 * Support for Adam Bolt's tileset, lighting and transparency effects
19 * by Robert Ruehlmann (rr9@angband.org)
22 static byte display_autopick;
23 static int match_autopick;
24 static object_type *autopick_obj;
25 static int feat_priority;
28 * Distance between two points via Newton-Raphson technique
30 int distance (int y1, int x1, int y2, int x2)
32 int dy = (y1 > y2) ? (y1 - y2) : (y2 - y1);
33 int dx = (x1 > x2) ? (x1 - x2) : (x2 - x1);
35 /* Squared distance */
36 int target = (dy * dy) + (dx * dx);
38 /* Approximate distance: hypot(dy,dx) = max(dy,dx) + min(dy,dx) / 2 */
39 int d = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));
44 if (!dy || !dx) return d;
48 /* Approximate error */
49 err = (target - d * d) / (2 * d);
51 /* No error - we are done */
63 * Return TRUE if the given feature is a trap
65 bool is_trap(int feat)
67 return have_flag(f_info[feat].flags, FF_TRAP);
72 * Return TRUE if the given grid is a known trap
74 bool is_known_trap(cave_type *c_ptr)
76 if (!c_ptr->mimic && !cave_have_flag_grid(c_ptr, FF_SECRET) &&
77 is_trap(c_ptr->feat)) return TRUE;
84 * Return TRUE if the given grid is a closed door
86 bool is_closed_door(int feat)
88 feature_type *f_ptr = &f_info[feat];
90 return (have_flag(f_ptr->flags, FF_OPEN) || have_flag(f_ptr->flags, FF_BASH)) &&
91 !have_flag(f_ptr->flags, FF_MOVE);
96 * Return TRUE if the given grid is a hidden closed door
98 bool is_hidden_door(cave_type *c_ptr)
100 if ((c_ptr->mimic || cave_have_flag_grid(c_ptr, FF_SECRET)) &&
101 is_closed_door(c_ptr->feat))
109 * A simple, fast, integer-based line-of-sight algorithm. By Joseph Hall,
110 * 4116 Brewster Drive, Raleigh NC 27606. Email to jnh@ecemwl.ncsu.edu.
112 * Returns TRUE if a line of sight can be traced from (x1,y1) to (x2,y2).
114 * The LOS begins at the center of the tile (x1,y1) and ends at the center of
115 * the tile (x2,y2). If los() is to return TRUE, all of the tiles this line
116 * passes through must be floor tiles, except for (x1,y1) and (x2,y2).
118 * We assume that the "mathematical corner" of a non-floor tile does not
119 * block line of sight.
121 * Because this function uses (short) ints for all calculations, overflow may
122 * occur if dx and dy exceed 90.
124 * Once all the degenerate cases are eliminated, the values "qx", "qy", and
125 * "m" are multiplied by a scale factor "f1 = abs(dx * dy * 2)", so that
126 * we can use integer arithmetic.
128 * We travel from start to finish along the longer axis, starting at the border
129 * between the first and second tiles, where the y offset = .5 * slope, taking
130 * into account the scale factor. See below.
132 * Also note that this function and the "move towards target" code do NOT
133 * share the same properties. Thus, you can see someone, target them, and
134 * then fire a bolt at them, but the bolt may hit a wall, not them. However,
135 * by clever choice of target locations, you can sometimes throw a "curve".
137 * Note that "line of sight" is not "reflexive" in all cases.
139 * Use the "projectable()" routine to test "spell/missile line of sight".
141 * Use the "update_view()" function to determine player line-of-sight.
143 bool los(int y1, int x1, int y2, int x2)
163 /* Slope, or 1/Slope, of LOS */
167 /* Extract the offset */
171 /* Extract the absolute offset */
176 /* Handle adjacent (or identical) grids */
177 if ((ax < 2) && (ay < 2)) return TRUE;
180 /* Paranoia -- require "safe" origin */
181 /* if (!in_bounds(y1, x1)) return FALSE; */
182 /* if (!in_bounds(y2, x2)) return FALSE; */
185 /* Directly South/North */
188 /* South -- check for walls */
191 for (ty = y1 + 1; ty < y2; ty++)
193 if (!cave_los_bold(ty, x1)) return FALSE;
197 /* North -- check for walls */
200 for (ty = y1 - 1; ty > y2; ty--)
202 if (!cave_los_bold(ty, x1)) return FALSE;
210 /* Directly East/West */
213 /* East -- check for walls */
216 for (tx = x1 + 1; tx < x2; tx++)
218 if (!cave_los_bold(y1, tx)) return FALSE;
222 /* West -- check for walls */
225 for (tx = x1 - 1; tx > x2; tx--)
227 if (!cave_los_bold(y1, tx)) return FALSE;
236 /* Extract some signs */
237 sx = (dx < 0) ? -1 : 1;
238 sy = (dy < 0) ? -1 : 1;
241 /* Vertical "knights" */
246 if (cave_los_bold(y1 + sy, x1)) return TRUE;
250 /* Horizontal "knights" */
255 if (cave_los_bold(y1, x1 + sx)) return TRUE;
260 /* Calculate scale factor div 2 */
263 /* Calculate scale factor */
267 /* Travel horizontally */
270 /* Let m = dy / dx * 2 * (dy * dx) = 2 * dy * dy */
276 /* Consider the special case where slope == 1. */
287 /* Note (below) the case (qy == f2), where */
288 /* the LOS exactly meets the corner of a tile. */
291 if (!cave_los_bold(ty, tx)) return FALSE;
302 if (!cave_los_bold(ty, tx)) return FALSE;
315 /* Travel vertically */
318 /* Let m = dx / dy * 2 * (dx * dy) = 2 * dx * dx */
334 /* Note (below) the case (qx == f2), where */
335 /* the LOS exactly meets the corner of a tile. */
338 if (!cave_los_bold(ty, tx)) return FALSE;
349 if (!cave_los_bold(ty, tx)) return FALSE;
371 #define COMPLEX_WALL_ILLUMINATION
374 * Check for "local" illumination
376 static bool check_local_illumination(int y, int x)
378 /* Hack -- move towards player */
379 int yy = (y < py) ? (y + 1) : (y > py) ? (y - 1) : y;
380 int xx = (x < px) ? (x + 1) : (x > px) ? (x - 1) : x;
382 /* Check for "local" illumination */
384 #ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
386 /* Check for "complex" illumination */
387 if ((feat_supports_los(get_feat_mimic(&cave[yy][xx])) &&
388 (cave[yy][xx].info & CAVE_GLOW)) ||
389 (feat_supports_los(get_feat_mimic(&cave[y][xx])) &&
390 (cave[y][xx].info & CAVE_GLOW)) ||
391 (feat_supports_los(get_feat_mimic(&cave[yy][x])) &&
392 (cave[yy][x].info & CAVE_GLOW)))
398 #else /* COMPLEX_WALL_ILLUMINATION */
400 /* Check for "simple" illumination */
401 return (cave[yy][xx].info & CAVE_GLOW) ? TRUE : FALSE;
403 #endif /* COMPLEX_WALL_ILLUMINATION */
407 #define update_local_illumination_aux(Y, X) \
409 if (player_has_los_bold((Y), (X))) \
411 /* Update the monster */ \
412 if (cave[(Y)][(X)].m_idx) update_mon(cave[(Y)][(X)].m_idx, FALSE); \
414 /* Notice and redraw */ \
415 note_spot((Y), (X)); \
416 lite_spot((Y), (X)); \
422 * Update "local" illumination
424 void update_local_illumination(int y, int x)
428 if (!in_bounds(y, x)) return;
430 #ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
432 if ((y != py) && (x != px))
434 yy = (y < py) ? (y - 1) : (y + 1);
435 xx = (x < px) ? (x - 1) : (x + 1);
436 update_local_illumination_aux(yy, xx);
437 update_local_illumination_aux(y, xx);
438 update_local_illumination_aux(yy, x);
440 else if (x != px) /* y == py */
442 xx = (x < px) ? (x - 1) : (x + 1);
443 for (i = -1; i <= 1; i++)
446 update_local_illumination_aux(yy, xx);
449 update_local_illumination_aux(yy, x);
451 update_local_illumination_aux(yy, x);
453 else if (y != py) /* x == px */
455 yy = (y < py) ? (y - 1) : (y + 1);
456 for (i = -1; i <= 1; i++)
459 update_local_illumination_aux(yy, xx);
462 update_local_illumination_aux(y, xx);
464 update_local_illumination_aux(y, xx);
466 else /* Player's grid */
468 for (i = 0; i < 8; i++)
472 update_local_illumination_aux(yy, xx);
476 #else /* COMPLEX_WALL_ILLUMINATION */
478 if ((y != py) && (x != px))
480 yy = (y < py) ? (y - 1) : (y + 1);
481 xx = (x < px) ? (x - 1) : (x + 1);
482 update_local_illumination_aux(yy, xx);
484 else if (x != px) /* y == py */
486 xx = (x < px) ? (x - 1) : (x + 1);
487 for (i = -1; i <= 1; i++)
490 update_local_illumination_aux(yy, xx);
493 else if (y != py) /* x == px */
495 yy = (y < py) ? (y - 1) : (y + 1);
496 for (i = -1; i <= 1; i++)
499 update_local_illumination_aux(yy, xx);
502 else /* Player's grid */
504 for (i = 0; i < 8; i++)
508 update_local_illumination_aux(yy, xx);
512 #endif /* COMPLEX_WALL_ILLUMINATION */
517 * Can the player "see" the given grid in detail?
519 * He must have vision, illumination, and line of sight.
521 * Note -- "CAVE_LITE" is only set if the "torch" has "los()".
522 * So, given "CAVE_LITE", we know that the grid is "fully visible".
524 * Note that "CAVE_GLOW" makes little sense for a wall, since it would mean
525 * that a wall is visible from any direction. That would be odd. Except
526 * under wizard light, which might make sense. Thus, for walls, we require
527 * not only that they be "CAVE_GLOW", but also, that they be adjacent to a
528 * grid which is not only "CAVE_GLOW", but which is a non-wall, and which is
529 * in line of sight of the player.
531 * This extra check is expensive, but it provides a more "correct" semantics.
533 * Note that we should not run this check on walls which are "outer walls" of
534 * the dungeon, or we will induce a memory fault, but actually verifying all
535 * of the locations would be extremely expensive.
537 * Thus, to speed up the function, we assume that all "perma-walls" which are
538 * "CAVE_GLOW" are "illuminated" from all sides. This is correct for all cases
539 * except "vaults" and the "buildings" in town. But the town is a hack anyway,
540 * and the player has more important things on his mind when he is attacking a
541 * monster vault. It is annoying, but an extremely important optimization.
543 * Note that "glowing walls" are only considered to be "illuminated" if the
544 * grid which is next to the wall in the direction of the player is also a
545 * "glowing" grid. This prevents the player from being able to "see" the
546 * walls of illuminated rooms from a corridor outside the room.
548 bool player_can_see_bold(int y, int x)
552 /* Blind players see nothing */
553 if (p_ptr->blind) return FALSE;
555 /* Access the cave grid */
558 /* Note that "torch-lite" yields "illumination" */
559 if (c_ptr->info & (CAVE_LITE | CAVE_MNLT)) return TRUE;
561 /* Require line of sight to the grid */
562 if (!player_has_los_bold(y, x)) return FALSE;
564 /* Noctovision of Ninja */
565 if (p_ptr->see_nocto) return TRUE;
567 /* Require "perma-lite" of the grid */
568 if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW) return FALSE;
570 /* Feature code (applying "mimic" field) */
571 /* Floors are simple */
572 if (feat_supports_los(get_feat_mimic(c_ptr))) return TRUE;
574 /* Check for "local" illumination */
575 return check_local_illumination(y, x);
581 * Returns true if the player's grid is dark
585 return (!player_can_see_bold(py, px));
592 * Determine if a given location may be "destroyed"
594 * Used by destruction spells, and for placing stairs, etc.
596 bool cave_valid_bold(int y, int x)
598 cave_type *c_ptr = &cave[y][x];
600 s16b this_o_idx, next_o_idx = 0;
603 /* Forbid perma-grids */
604 if (cave_perma_grid(c_ptr)) return (FALSE);
607 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
612 o_ptr = &o_list[this_o_idx];
614 /* Acquire next object */
615 next_o_idx = o_ptr->next_o_idx;
617 /* Forbid artifact grids */
618 if (object_is_artifact(o_ptr)) return (FALSE);
629 * Hack -- Legal monster codes
631 static char image_monster_hack[] = \
632 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
635 * Hack -- Legal object codes
637 static char image_object_hack[] = "?/|\\\"!$()_-=[]{},~";
640 * Mega-Hack -- Hallucinatory monster
642 static void image_monster(byte *ap, char *cp)
644 /* Random symbol from set above */
647 monster_race *r_ptr = &r_info[randint1(max_r_idx - 1)];
656 image_object_hack[randint0(sizeof(image_object_hack) - 1)] :
657 image_monster_hack[randint0(sizeof(image_monster_hack) - 1)]);
666 * Mega-Hack -- Hallucinatory object
668 static void image_object(byte *ap, char *cp)
672 object_kind *k_ptr = &k_info[randint1(max_k_idx-1)];
679 int n = sizeof(image_object_hack) - 1;
681 *cp = image_object_hack[randint0(n)];
691 * Hack -- Random hallucination
693 static void image_random(byte *ap, char *cp)
695 /* Normally, assume monsters */
696 if (randint0(100) < 75)
698 image_monster(ap, cp);
701 /* Otherwise, assume objects */
704 image_object(ap, cp);
709 * This array lists the effects of "brightness" on various "base" colours.
711 * This is used to do dynamic lighting effects in ascii :-)
712 * At the moment, only the various "floor" tiles are affected.
714 * The layout of the array is [x][0] = light and [x][1] = dark.
717 static byte lighting_colours[16][2] =
720 {TERM_L_DARK, TERM_DARK},
723 {TERM_YELLOW, TERM_SLATE},
726 {TERM_WHITE, TERM_L_DARK},
729 {TERM_L_UMBER, TERM_UMBER},
732 {TERM_RED, TERM_RED},
735 {TERM_L_GREEN, TERM_GREEN},
738 {TERM_BLUE, TERM_BLUE},
741 {TERM_L_UMBER, TERM_RED},
744 {TERM_SLATE, TERM_L_DARK},
747 {TERM_WHITE, TERM_SLATE},
750 {TERM_L_RED, TERM_BLUE},
753 {TERM_YELLOW, TERM_ORANGE},
756 {TERM_L_RED, TERM_L_RED},
759 {TERM_L_GREEN, TERM_GREEN},
762 {TERM_L_BLUE, TERM_L_BLUE},
765 {TERM_L_UMBER, TERM_UMBER}
770 * Apply "default" feature lighting effects
772 void apply_default_feat_lighting(byte f_attr[F_LIT_MAX], byte f_char[F_LIT_MAX])
774 byte s_attr = f_attr[F_LIT_STANDARD];
775 byte s_char = f_char[F_LIT_STANDARD];
778 if (is_ascii_graphics(s_attr)) /* For ASCII */
780 f_attr[F_LIT_LITE] = lighting_colours[s_attr & 0x0f][0];
781 f_attr[F_LIT_DARK] = lighting_colours[s_attr & 0x0f][1];
782 for (i = F_LIT_NS_BEGIN; i < F_LIT_MAX; i++) f_char[i] = s_char;
784 else /* For tile graphics */
786 for (i = F_LIT_NS_BEGIN; i < F_LIT_MAX; i++) f_attr[i] = s_attr;
787 f_char[F_LIT_LITE] = s_char + 2;
788 f_char[F_LIT_DARK] = s_char + 1;
793 /* Is this grid "darkened" by monster? */
794 #define darkened_grid(C) \
795 ((((C)->info & (CAVE_VIEW | CAVE_LITE | CAVE_MNLT | CAVE_MNDK)) == (CAVE_VIEW | CAVE_MNDK)) && \
800 * Extract the attr/char to display at the given (legal) map location
802 * Basically, we "paint" the chosen attr/char in several passes, starting
803 * with any known "terrain features" (defaulting to darkness), then adding
804 * any known "objects", and finally, adding any known "monsters". This
805 * is not the fastest method but since most of the calls to this function
806 * are made for grids with no monsters or objects, it is fast enough.
808 * Note that this function, if used on the grid containing the "player",
809 * will return the attr/char of the grid underneath the player, and not
810 * the actual player attr/char itself, allowing a lot of optimization
811 * in various "display" functions.
813 * Note that the "zero" entry in the feature/object/monster arrays are
814 * used to provide "special" attr/char codes, with "monster zero" being
815 * used for the player attr/char, "object zero" being used for the "stack"
816 * attr/char, and "feature zero" being used for the "nothing" attr/char,
817 * though this function makes use of only "feature zero".
819 * Note that monsters can have some "special" flags, including "ATTR_MULTI",
820 * which means their color changes, and "ATTR_CLEAR", which means they take
821 * the color of whatever is under them, and "CHAR_CLEAR", which means that
822 * they take the symbol of whatever is under them. Technically, the flag
823 * "CHAR_MULTI" is supposed to indicate that a monster looks strange when
824 * examined, but this flag is currently ignored.
826 * Currently, we do nothing with multi-hued objects, because there are
827 * not any. If there were, they would have to set "shimmer_objects"
828 * when they were created, and then new "shimmer" code in "dungeon.c"
829 * would have to be created handle the "shimmer" effect, and the code
830 * in "cave.c" would have to be updated to create the shimmer effect.
832 * Note the effects of hallucination. Objects always appear as random
833 * "objects", monsters as random "monsters", and normal grids occasionally
834 * appear as random "monsters" or "objects", but note that these random
835 * "monsters" and "objects" are really just "colored ascii symbols".
837 * Note that "floors" and "invisible traps" (and "zero" features) are
838 * drawn as "floors" using a special check for optimization purposes,
839 * and these are the only features which get drawn using the special
840 * lighting effects activated by "view_special_lite".
842 * Note the use of the "mimic" field in the "terrain feature" processing,
843 * which allows any feature to "pretend" to be another feature. This is
844 * used to "hide" secret doors, and to make all "doors" appear the same,
845 * and all "walls" appear the same, and "hidden" treasure stay hidden.
846 * It is possible to use this field to make a feature "look" like a floor,
847 * but the "special lighting effects" for floors will not be used.
849 * Note the use of the new "terrain feature" information. Note that the
850 * assumption that all interesting "objects" and "terrain features" are
851 * memorized allows extremely optimized processing below. Note the use
852 * of separate flags on objects to mark them as memorized allows a grid
853 * to have memorized "terrain" without granting knowledge of any object
854 * which may appear in that grid.
856 * Note the efficient code used to determine if a "floor" grid is
857 * "memorized" or "viewable" by the player, where the test for the
858 * grid being "viewable" is based on the facts that (1) the grid
859 * must be "lit" (torch-lit or perma-lit), (2) the grid must be in
860 * line of sight, and (3) the player must not be blind, and uses the
861 * assumption that all torch-lit grids are in line of sight.
863 * Note that floors (and invisible traps) are the only grids which are
864 * not memorized when seen, so only these grids need to check to see if
865 * the grid is "viewable" to the player (if it is not memorized). Since
866 * most non-memorized grids are in fact walls, this induces *massive*
867 * efficiency, at the cost of *forcing* the memorization of non-floor
868 * grids when they are first seen. Note that "invisible traps" are
869 * always treated exactly like "floors", which prevents "cheating".
871 * Note the "special lighting effects" which can be activated for floor
872 * grids using the "view_special_lite" option (for "white" floor grids),
873 * causing certain grids to be displayed using special colors. If the
874 * player is "blind", we will use "dark gray", else if the grid is lit
875 * by the torch, and the "view_yellow_lite" option is set, we will use
876 * "yellow", else if the grid is "dark", we will use "dark gray", else
877 * if the grid is not "viewable", and the "view_bright_lite" option is
878 * set, and the we will use "slate" (gray). We will use "white" for all
879 * other cases, in particular, for illuminated viewable floor grids.
881 * Note the "special lighting effects" which can be activated for wall
882 * grids using the "view_granite_lite" option (for "white" wall grids),
883 * causing certain grids to be displayed using special colors. If the
884 * player is "blind", we will use "dark gray", else if the grid is lit
885 * by the torch, and the "view_yellow_lite" option is set, we will use
886 * "yellow", else if the "view_bright_lite" option is set, and the grid
887 * is not "viewable", or is "dark", or is glowing, but not when viewed
888 * from the player's current location, we will use "slate" (gray). We
889 * will use "white" for all other cases, in particular, for correctly
890 * illuminated viewable wall grids.
892 * Note that, when "view_granite_lite" is set, we use an inline version
893 * of the "player_can_see_bold()" function to check the "viewability" of
894 * grids when the "view_bright_lite" option is set, and we do NOT use
895 * any special colors for "dark" wall grids, since this would allow the
896 * player to notice the walls of illuminated rooms from a hallway that
897 * happened to run beside the room. The alternative, by the way, would
898 * be to prevent the generation of hallways next to rooms, but this
899 * would still allow problems when digging towards a room.
901 * Note that bizarre things must be done when the "attr" and/or "char"
902 * codes have the "high-bit" set, since these values are used to encode
903 * various "special" pictures in some versions, and certain situations,
904 * such as "multi-hued" or "clear" monsters, cause the attr/char codes
905 * to be "scrambled" in various ways.
907 * Note that eventually we may use the "&" symbol for embedded treasure,
908 * and use the "*" symbol to indicate multiple objects, though this will
909 * have to wait for Angband 2.8.0 or later. Note that currently, this
910 * is not important, since only one object or terrain feature is allowed
911 * in each grid. If needed, "k_info[0]" will hold the "stack" attr/char.
913 * Note the assumption that doing "x_ptr = &x_info[x]" plus a few of
914 * "x_ptr->xxx", is quicker than "x_info[x].xxx", if this is incorrect
915 * then a whole lot of code should be changed... XXX XXX
917 void map_info(int y, int x, byte *ap, char *cp, byte *tap, char *tcp)
920 cave_type *c_ptr = &cave[y][x];
922 s16b this_o_idx, next_o_idx = 0;
924 /* Feature code (applying "mimic" field) */
925 s16b feat = get_feat_mimic(c_ptr);
928 feature_type *f_ptr = &f_info[feat];
933 /* Boring grids (floors, etc) */
934 if (!have_flag(f_ptr->flags, FF_REMEMBER))
937 * Handle Memorized or visible floor
939 * No visual when blinded.
940 * (to prevent strange effects on darkness breath)
942 * - Can see grids with CAVE_MARK.
943 * - Can see grids with CAVE_LITE or CAVE_MNLT.
944 * (Such grids also have CAVE_VIEW)
945 * - Can see grids with CAVE_VIEW unless darkened by monsters.
948 ((c_ptr->info & (CAVE_MARK | CAVE_LITE | CAVE_MNLT)) ||
949 ((c_ptr->info & CAVE_VIEW) && (((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) == CAVE_GLOW) || p_ptr->see_nocto))))
951 /* Normal attr/char */
952 a = f_ptr->x_attr[F_LIT_STANDARD];
953 c = f_ptr->x_char[F_LIT_STANDARD];
955 if (p_ptr->wild_mode)
957 /* Special lighting effects */
959 if (view_special_lite && !is_daytime())
961 /* Use a darkened colour/tile */
962 a = f_ptr->x_attr[F_LIT_DARK];
963 c = f_ptr->x_char[F_LIT_DARK];
967 /* Mega-Hack -- Handle "in-sight" and "darkened" grids */
968 else if (darkened_grid(c_ptr))
970 /* Unsafe cave grid -- idea borrowed from Unangband */
971 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
973 /* Access darkness */
974 f_ptr = &f_info[feat];
976 /* Char and attr of darkness */
977 a = f_ptr->x_attr[F_LIT_STANDARD];
978 c = f_ptr->x_char[F_LIT_STANDARD];
981 /* Special lighting effects */
982 else if (view_special_lite)
984 /* Handle "torch-lit" grids */
985 if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
988 if (view_yellow_lite)
990 /* Use a brightly lit colour/tile */
991 a = f_ptr->x_attr[F_LIT_LITE];
992 c = f_ptr->x_char[F_LIT_LITE];
996 /* Handle "dark" grids */
997 else if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW)
999 /* Use a darkened colour/tile */
1000 a = f_ptr->x_attr[F_LIT_DARK];
1001 c = f_ptr->x_char[F_LIT_DARK];
1004 /* Handle "out-of-sight" grids */
1005 else if (!(c_ptr->info & CAVE_VIEW))
1008 if (view_bright_lite)
1010 /* Use a darkened colour/tile */
1011 a = f_ptr->x_attr[F_LIT_DARK];
1012 c = f_ptr->x_char[F_LIT_DARK];
1021 /* Unsafe cave grid -- idea borrowed from Unangband */
1022 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
1024 /* Access darkness */
1025 f_ptr = &f_info[feat];
1027 /* Normal attr/char */
1028 a = f_ptr->x_attr[F_LIT_STANDARD];
1029 c = f_ptr->x_char[F_LIT_STANDARD];
1033 /* Interesting grids (non-floors) */
1036 /* Memorized grids */
1037 if (c_ptr->info & CAVE_MARK)
1039 /* Normal attr/char */
1040 a = f_ptr->x_attr[F_LIT_STANDARD];
1041 c = f_ptr->x_char[F_LIT_STANDARD];
1043 if (p_ptr->wild_mode)
1045 /* Special lighting effects */
1046 /* Handle "blind" or "night" */
1047 if (view_granite_lite && (p_ptr->blind || !is_daytime()))
1049 /* Use a darkened colour/tile */
1050 a = f_ptr->x_attr[F_LIT_DARK];
1051 c = f_ptr->x_char[F_LIT_DARK];
1055 /* Mega-Hack -- Handle "in-sight" and "darkened" grids */
1056 else if (darkened_grid(c_ptr) && !p_ptr->blind)
1058 if (have_flag(f_ptr->flags, FF_LOS) && have_flag(f_ptr->flags, FF_PROJECT))
1060 /* Unsafe cave grid -- idea borrowed from Unangband */
1061 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
1063 /* Access darkness */
1064 f_ptr = &f_info[feat];
1066 /* Char and attr of darkness */
1067 a = f_ptr->x_attr[F_LIT_STANDARD];
1068 c = f_ptr->x_char[F_LIT_STANDARD];
1070 else if (view_granite_lite && view_bright_lite)
1072 /* Use a darkened colour/tile */
1073 a = f_ptr->x_attr[F_LIT_DARK];
1074 c = f_ptr->x_char[F_LIT_DARK];
1078 /* Special lighting effects */
1079 else if (view_granite_lite)
1081 /* Handle "blind" */
1084 /* Use a darkened colour/tile */
1085 a = f_ptr->x_attr[F_LIT_DARK];
1086 c = f_ptr->x_char[F_LIT_DARK];
1089 /* Handle "torch-lit" grids */
1090 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
1093 if (view_yellow_lite)
1095 /* Use a brightly lit colour/tile */
1096 a = f_ptr->x_attr[F_LIT_LITE];
1097 c = f_ptr->x_char[F_LIT_LITE];
1101 /* Handle "view_bright_lite" */
1102 else if (view_bright_lite)
1105 if (!(c_ptr->info & CAVE_VIEW))
1107 /* Use a darkened colour/tile */
1108 a = f_ptr->x_attr[F_LIT_DARK];
1109 c = f_ptr->x_char[F_LIT_DARK];
1113 else if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW)
1115 /* Use a darkened colour/tile */
1116 a = f_ptr->x_attr[F_LIT_DARK];
1117 c = f_ptr->x_char[F_LIT_DARK];
1120 /* Not glowing correctly */
1121 else if (!have_flag(f_ptr->flags, FF_LOS) && !check_local_illumination(y, x))
1123 /* Use a darkened colour/tile */
1124 a = f_ptr->x_attr[F_LIT_DARK];
1125 c = f_ptr->x_char[F_LIT_DARK];
1134 /* Unsafe cave grid -- idea borrowed from Unangband */
1135 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
1137 /* Access feature */
1138 f_ptr = &f_info[feat];
1140 /* Normal attr/char */
1141 a = f_ptr->x_attr[F_LIT_STANDARD];
1142 c = f_ptr->x_char[F_LIT_STANDARD];
1146 if (feat_priority == -1) feat_priority = f_ptr->priority;
1148 /* Save the terrain info for the transparency effects */
1156 /* Hack -- rare random hallucination, except on outer dungeon walls */
1162 image_random(ap, cp);
1167 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1171 /* Acquire object */
1172 o_ptr = &o_list[this_o_idx];
1174 /* Acquire next object */
1175 next_o_idx = o_ptr->next_o_idx;
1177 /* Memorized objects */
1178 if (o_ptr->marked & OM_FOUND)
1180 if (display_autopick)
1184 match_autopick = is_autopick(o_ptr);
1185 if(match_autopick == -1)
1188 act = autopick_list[match_autopick].action;
1190 if ((act & DO_DISPLAY) && (act & display_autopick))
1192 autopick_obj = o_ptr;
1196 match_autopick = -1;
1201 (*cp) = object_char(o_ptr);
1204 (*ap) = object_attr(o_ptr);
1208 /* Hack -- hallucination */
1209 if (p_ptr->image) image_object(ap, cp);
1217 /* Handle monsters */
1218 if (c_ptr->m_idx && display_autopick == 0 )
1220 monster_type *m_ptr = &m_list[c_ptr->m_idx];
1222 /* Visible monster */
1225 monster_race *r_ptr = &r_info[m_ptr->ap_r_idx];
1233 * Monsters with both CHAR_CLEAR and ATTR_CLEAR
1234 * flags are always unseen.
1236 if ((r_ptr->flags1 & (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR)) == (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR))
1242 /* Hallucinatory monster */
1243 image_monster(ap, cp);
1248 /* Monster attr/char */
1252 /* Normal monsters */
1253 if (!(r_ptr->flags1 & (RF1_CHAR_CLEAR | RF1_SHAPECHANGER | RF1_ATTR_CLEAR
1254 | RF1_ATTR_MULTI | RF1_ATTR_SEMIRAND)))
1256 /* Desired monster attr/char */
1262 * Monsters with both CHAR_CLEAR and ATTR_CLEAR
1263 * flags are always unseen.
1265 else if ((r_ptr->flags1 & (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR)) == (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR))
1272 /*** Monster's attr ***/
1273 if ((r_ptr->flags1 & RF1_ATTR_CLEAR) && (*ap != TERM_DARK) && !use_graphics)
1278 else if ((r_ptr->flags1 & RF1_ATTR_MULTI) && !use_graphics)
1280 /* Multi-hued attr */
1281 if (r_ptr->flags2 & RF2_ATTR_ANY) *ap = randint1(15);
1282 else switch (randint1(7))
1284 case 1: *ap = TERM_RED; break;
1285 case 2: *ap = TERM_L_RED; break;
1286 case 3: *ap = TERM_WHITE; break;
1287 case 4: *ap = TERM_L_GREEN; break;
1288 case 5: *ap = TERM_BLUE; break;
1289 case 6: *ap = TERM_L_DARK; break;
1290 case 7: *ap = TERM_GREEN; break;
1293 else if ((r_ptr->flags1 & RF1_ATTR_SEMIRAND) && !use_graphics)
1295 /* Use semi-random attr (usually mimics' colors vary) */
1296 *ap = c_ptr->m_idx % 15 + 1;
1304 /*** Monster's char ***/
1305 if ((r_ptr->flags1 & RF1_CHAR_CLEAR) && (*cp != ' ') && !use_graphics)
1310 else if (r_ptr->flags1 & RF1_SHAPECHANGER)
1314 monster_race *tmp_r_ptr = &r_info[randint1(max_r_idx - 1)];
1315 *cp = tmp_r_ptr->x_char;
1316 *ap = tmp_r_ptr->x_attr;
1320 *cp = (one_in_(25) ?
1321 image_object_hack[randint0(sizeof(image_object_hack) - 1)] :
1322 image_monster_hack[randint0(sizeof(image_monster_hack) - 1)]);
1335 /* Handle "player" */
1336 if (player_bold(y, x))
1338 monster_race *r_ptr = &r_info[0];
1340 /* Get the "player" attr */
1341 *ap = r_ptr->x_attr;
1343 /* Get the "player" char */
1344 *cp = r_ptr->x_char;
1352 * Calculate panel colum of a location in the map
1354 static int panel_col_of(int col)
1356 col -= panel_col_min;
1357 if (use_bigtile) col *= 2;
1363 * Moves the cursor to a given MAP (y,x) location
1365 void move_cursor_relative(int row, int col)
1367 /* Real co-ords convert to screen positions */
1368 row -= panel_row_prt;
1371 Term_gotoxy(panel_col_of(col), row);
1377 * Place an attr/char pair at the given map coordinate, if legal.
1379 void print_rel(char c, byte a, int y, int x)
1381 /* Only do "legal" locations */
1382 if (panel_contains(y, x))
1384 /* Hack -- fake monochrome */
1387 if (world_monster) a = TERM_DARK;
1388 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1389 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1392 /* Draw the char using the attr */
1393 Term_queue_bigchar(panel_col_of(x), y-panel_row_prt, a, c, 0, 0);
1402 * Memorize interesting viewable object/features in the given grid
1404 * This function should only be called on "legal" grids.
1406 * This function will memorize the object and/or feature in the given
1407 * grid, if they are (1) viewable and (2) interesting. Note that all
1408 * objects are interesting, all terrain features except floors (and
1409 * invisible traps) are interesting, and floors (and invisible traps)
1410 * are interesting sometimes (depending on various options involving
1411 * the illumination of floor grids).
1413 * The automatic memorization of all objects and non-floor terrain
1414 * features as soon as they are displayed allows incredible amounts
1415 * of optimization in various places, especially "map_info()".
1417 * Note that the memorization of objects is completely separate from
1418 * the memorization of terrain features, preventing annoying floor
1419 * memorization when a detected object is picked up from a dark floor,
1420 * and object memorization when an object is dropped into a floor grid
1421 * which is memorized but out-of-sight.
1423 * This function should be called every time the "memorization" of
1424 * a grid (or the object in a grid) is called into question, such
1425 * as when an object is created in a grid, when a terrain feature
1426 * "changes" from "floor" to "non-floor", when any grid becomes
1427 * "illuminated" or "viewable", and when a "floor" grid becomes
1430 * Note the relatively efficient use of this function by the various
1431 * "update_view()" and "update_lite()" calls, to allow objects and
1432 * terrain features to be memorized (and drawn) whenever they become
1433 * viewable or illuminated in any way, but not when they "maintain"
1434 * or "lose" their previous viewability or illumination.
1436 * Note the butchered "internal" version of "player_can_see_bold()",
1437 * optimized primarily for the most common cases, that is, for the
1438 * non-marked floor grids.
1440 void note_spot(int y, int x)
1442 cave_type *c_ptr = &cave[y][x];
1444 s16b this_o_idx, next_o_idx = 0;
1447 /* Blind players see nothing */
1448 if (p_ptr->blind) return;
1450 /* Analyze non-torch-lit grids */
1451 if (!(c_ptr->info & (CAVE_LITE | CAVE_MNLT)))
1453 /* Require line of sight to the grid */
1454 if (!(c_ptr->info & (CAVE_VIEW))) return;
1456 /* Require "perma-lite" of the grid */
1457 if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW)
1460 if (!p_ptr->see_nocto) return;
1465 /* Hack -- memorize objects */
1466 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1468 object_type *o_ptr = &o_list[this_o_idx];
1470 /* Acquire next object */
1471 next_o_idx = o_ptr->next_o_idx;
1473 /* Memorize objects */
1474 o_ptr->marked |= OM_FOUND;
1478 /* Hack -- memorize grids */
1479 if (!(c_ptr->info & (CAVE_MARK)))
1481 /* Feature code (applying "mimic" field) */
1482 feature_type *f_ptr = &f_info[get_feat_mimic(c_ptr)];
1484 /* Memorize some "boring" grids */
1485 if (!have_flag(f_ptr->flags, FF_REMEMBER))
1487 /* Option -- memorize all torch-lit floors */
1488 if (view_torch_grids &&
1489 ((c_ptr->info & (CAVE_LITE | CAVE_MNLT)) || p_ptr->see_nocto))
1492 c_ptr->info |= (CAVE_MARK);
1495 /* Option -- memorize all perma-lit floors */
1496 else if (view_perma_grids && ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) == CAVE_GLOW))
1499 c_ptr->info |= (CAVE_MARK);
1503 /* Memorize normal grids */
1504 else if (have_flag(f_ptr->flags, FF_LOS))
1507 c_ptr->info |= (CAVE_MARK);
1510 /* Memorize torch-lit walls */
1511 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
1514 c_ptr->info |= (CAVE_MARK);
1517 /* Memorize walls seen by noctovision of Ninja */
1518 else if (p_ptr->see_nocto)
1521 c_ptr->info |= (CAVE_MARK);
1524 /* Memorize certain non-torch-lit wall grids */
1525 else if (check_local_illumination(y, x))
1528 c_ptr->info |= (CAVE_MARK);
1532 /* Memorize terrain of the grid */
1533 c_ptr->info |= (CAVE_KNOWN);
1537 void display_dungeon(void)
1546 for (x = px - Term->wid / 2 + 1; x <= px + Term->wid / 2; x++)
1548 for (y = py - Term->hgt / 2 + 1; y <= py + Term->hgt / 2; y++)
1550 if (in_bounds2(y, x))
1553 /* Examine the grid */
1554 map_info(y, x, &a, &c, &ta, &tc);
1556 /* Hack -- fake monochrome */
1559 if (world_monster) a = TERM_DARK;
1560 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1561 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1564 /* Hack -- Queue it */
1565 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c, ta, tc);
1569 /* Clear out-of-bound tiles */
1571 /* Access darkness */
1572 feature_type *f_ptr = &f_info[feat_none];
1575 a = f_ptr->x_attr[F_LIT_STANDARD];
1578 c = f_ptr->x_char[F_LIT_STANDARD];
1580 /* Hack -- Queue it */
1581 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c, ta, tc);
1589 * Redraw (on the screen) a given MAP location
1591 * This function should only be called on "legal" grids
1593 void lite_spot(int y, int x)
1595 /* Redraw if on screen */
1596 if (panel_contains(y, x) && in_bounds2(y, x))
1604 /* Examine the grid */
1605 map_info(y, x, &a, &c, &ta, &tc);
1607 /* Hack -- fake monochrome */
1610 if (world_monster) a = TERM_DARK;
1611 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1612 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1615 /* Hack -- Queue it */
1616 Term_queue_bigchar(panel_col_of(x), y-panel_row_prt, a, c, ta, tc);
1618 /* Update sub-windows */
1619 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
1625 * Prints the map of the dungeon
1627 * Note that, for efficiency, we contain an "optimized" version
1628 * of both "lite_spot()" and "print_rel()", and that we use the
1629 * "lite_spot()" function to display the player grid, if needed.
1637 s16b xmin, xmax, ymin, ymax;
1642 Term_get_size(&wid, &hgt);
1644 /* Remove map offset */
1648 /* Access the cursor state */
1649 (void)Term_get_cursor(&v);
1651 /* Hide the cursor */
1652 (void)Term_set_cursor(0);
1655 xmin = (0 < panel_col_min) ? panel_col_min : 0;
1656 xmax = (cur_wid - 1 > panel_col_max) ? panel_col_max : cur_wid - 1;
1657 ymin = (0 < panel_row_min) ? panel_row_min : 0;
1658 ymax = (cur_hgt - 1 > panel_row_max) ? panel_row_max : cur_hgt - 1;
1660 /* Bottom section of screen */
1661 for (y = 1; y <= ymin - panel_row_prt; y++)
1663 /* Erase the section */
1664 Term_erase(COL_MAP, y, wid);
1667 /* Top section of screen */
1668 for (y = ymax - panel_row_prt; y <= hgt; y++)
1670 /* Erase the section */
1671 Term_erase(COL_MAP, y, wid);
1675 for (y = ymin; y <= ymax; y++)
1677 /* Scan the columns of row "y" */
1678 for (x = xmin; x <= xmax; x++)
1686 /* Determine what is there */
1687 map_info(y, x, &a, &c, &ta, &tc);
1689 /* Hack -- fake monochrome */
1692 if (world_monster) a = TERM_DARK;
1693 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1694 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1697 /* Efficiency -- Redraw that grid of the map */
1698 Term_queue_bigchar(panel_col_of(x), y-panel_row_prt, a, c, ta, tc);
1702 /* Display player */
1705 /* Restore the cursor */
1706 (void)Term_set_cursor(v);
1712 * print project path
1714 void prt_path(int y, int x)
1719 int default_color = TERM_SLATE;
1721 if (!display_path) return;
1722 if (-1 == project_length)
1725 /* Get projection path */
1726 path_n = project_path(path_g, (project_length ? project_length : MAX_RANGE), py, px, y, x, PROJECT_PATH|PROJECT_THRU);
1729 p_ptr->redraw |= (PR_MAP);
1735 for (i = 0; i < path_n; i++)
1737 int ny = GRID_Y(path_g[i]);
1738 int nx = GRID_X(path_g[i]);
1739 cave_type *c_ptr = &cave[ny][nx];
1741 if (panel_contains(ny, nx))
1743 byte a = default_color;
1749 if (c_ptr->m_idx && m_list[c_ptr->m_idx].ml)
1751 /* Determine what is there */
1752 map_info(ny, nx, &a, &c, &ta, &tc);
1754 if (!is_ascii_graphics(a))
1756 else if (c == '.' && (a == TERM_WHITE || a == TERM_L_WHITE))
1758 else if (a == default_color)
1764 if (world_monster) a = TERM_DARK;
1765 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1766 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1771 /* Hack -- Queue it */
1772 Term_queue_bigchar(panel_col_of(nx), ny-panel_row_prt, a, c, ta, tc);
1776 if ((c_ptr->info & CAVE_MARK) && !cave_have_flag_grid(c_ptr, FF_PROJECT)) break;
1779 if (nx == x && ny == y) default_color = TERM_L_DARK;
1784 static cptr simplify_list[][2] =
1791 {"^Amulet of ", "\""},
1792 {"^Scroll of ", "?"},
1793 {"^Scroll titled ", "?"},
1794 {"^Wand of " , "-"},
1796 {"^Staff of " , "_"},
1797 {"^Potion of ", "!"},
1809 static void display_shortened_item_name(object_type *o_ptr, int y)
1816 object_desc(buf, o_ptr, (OD_NO_FLAVOR | OD_OMIT_PREFIX | OD_NAME_ONLY));
1817 attr = tval_to_attr[o_ptr->tval % 128];
1823 strcpy(buf, "²¿¤«´ñ̯¤Êʪ");
1825 strcpy(buf, "something strange");
1829 for (c = buf; *c; c++)
1832 for (i = 0; simplify_list[i][1]; i++)
1834 cptr org_w = simplify_list[i][0];
1844 if (!strncmp(c, org_w, strlen(org_w)))
1847 cptr tmp = simplify_list[i][1];
1850 tmp = c + strlen(org_w);
1860 /* Ⱦ³Ñ 12 ʸ»úʬ¤ÇÀÚ¤ë */
1866 if(len + 2 > 12) break;
1873 if(len + 1 > 12) break;
1879 Term_putstr(0, y, 12, attr, buf);
1883 * Display a "small-scale" map of the dungeon in the active Term
1885 void display_map(int *cy, int *cx)
1902 /* Save lighting effects */
1903 bool old_view_special_lite = view_special_lite;
1904 bool old_view_granite_lite = view_granite_lite;
1906 int hgt, wid, yrat, xrat;
1908 int **match_autopick_yx;
1909 object_type ***object_autopick_yx;
1912 Term_get_size(&wid, &hgt);
1915 if (use_bigtile) wid /= 2;
1917 yrat = (cur_hgt + hgt - 1) / hgt;
1918 xrat = (cur_wid + wid - 1) / wid;
1920 /* Disable lighting effects */
1921 view_special_lite = FALSE;
1922 view_granite_lite = FALSE;
1924 /* Allocate the maps */
1925 C_MAKE(ma, (hgt + 2), byte_ptr);
1926 C_MAKE(mc, (hgt + 2), char_ptr);
1927 C_MAKE(mp, (hgt + 2), byte_ptr);
1928 C_MAKE(match_autopick_yx, (hgt + 2), sint_ptr);
1929 C_MAKE(object_autopick_yx, (hgt + 2), object_type **);
1931 /* Allocate and wipe each line map */
1932 for (y = 0; y < (hgt + 2); y++)
1934 /* Allocate one row each array */
1935 C_MAKE(ma[y], (wid + 2), byte);
1936 C_MAKE(mc[y], (wid + 2), char);
1937 C_MAKE(mp[y], (wid + 2), byte);
1938 C_MAKE(match_autopick_yx[y], (wid + 2), int);
1939 C_MAKE(object_autopick_yx[y], (wid + 2), object_type *);
1941 for (x = 0; x < wid + 2; ++x)
1943 match_autopick_yx[y][x] = -1;
1944 object_autopick_yx[y][x] = NULL;
1947 ma[y][x] = TERM_WHITE;
1955 /* Allocate the maps */
1956 C_MAKE(bigma, (cur_hgt + 2), byte_ptr);
1957 C_MAKE(bigmc, (cur_hgt + 2), char_ptr);
1958 C_MAKE(bigmp, (cur_hgt + 2), byte_ptr);
1960 /* Allocate and wipe each line map */
1961 for (y = 0; y < (cur_hgt + 2); y++)
1963 /* Allocate one row each array */
1964 C_MAKE(bigma[y], (cur_wid + 2), byte);
1965 C_MAKE(bigmc[y], (cur_wid + 2), char);
1966 C_MAKE(bigmp[y], (cur_wid + 2), byte);
1968 for (x = 0; x < cur_wid + 2; ++x)
1971 bigma[y][x] = TERM_WHITE;
1979 /* Fill in the map */
1980 for (i = 0; i < cur_wid; ++i)
1982 for (j = 0; j < cur_hgt; ++j)
1992 /* Extract the current attr/char at that map location */
1993 map_info(j, i, &ta, &tc, &ta, &tc);
1995 /* Extract the priority */
1998 if(match_autopick!=-1
1999 && (match_autopick_yx[y][x] == -1
2000 || match_autopick_yx[y][x] > match_autopick))
2002 match_autopick_yx[y][x] = match_autopick;
2003 object_autopick_yx[y][x] = autopick_obj;
2007 /* Save the char, attr and priority */
2008 bigmc[j+1][i+1] = tc;
2009 bigma[j+1][i+1] = ta;
2010 bigmp[j+1][i+1] = tp;
2014 for (j = 0; j < cur_hgt; ++j)
2016 for (i = 0; i < cur_wid; ++i)
2022 tc = bigmc[j+1][i+1];
2023 ta = bigma[j+1][i+1];
2024 tp = bigmp[j+1][i+1];
2026 /* rare feature has more priority */
2032 for (t = 0; t < 8; t++)
2034 if (tc == bigmc[j+1+ddy_cdd[t]][i+1+ddx_cdd[t]] &&
2035 ta == bigma[j+1+ddy_cdd[t]][i+1+ddx_cdd[t]])
2045 /* Save the char, attr and priority */
2058 /* Draw the corners */
2059 mc[0][0] = mc[0][x] = mc[y][0] = mc[y][x] = '+';
2061 /* Draw the horizontal edges */
2062 for (x = 1; x <= wid; x++) mc[0][x] = mc[y][x] = '-';
2064 /* Draw the vertical edges */
2065 for (y = 1; y <= hgt; y++) mc[y][0] = mc[y][x] = '|';
2068 /* Display each map line in order */
2069 for (y = 0; y < hgt + 2; ++y)
2071 /* Start a new line */
2072 Term_gotoxy(COL_MAP, y);
2074 /* Display the line */
2075 for (x = 0; x < wid + 2; ++x)
2080 /* Hack -- fake monochrome */
2083 if (world_monster) ta = TERM_DARK;
2084 else if (IS_INVULN() || world_player) ta = TERM_WHITE;
2085 else if (p_ptr->wraith_form) ta = TERM_L_DARK;
2088 /* Add the character */
2089 Term_add_bigch(ta, tc);
2094 for (y = 1; y < hgt + 1; ++y)
2096 match_autopick = -1;
2097 for (x = 1; x <= wid; x++){
2098 if (match_autopick_yx[y][x] != -1 &&
2099 (match_autopick > match_autopick_yx[y][x] ||
2100 match_autopick == -1)){
2101 match_autopick = match_autopick_yx[y][x];
2102 autopick_obj = object_autopick_yx[y][x];
2106 /* Clear old display */
2107 Term_putstr(0, y, 12, 0, " ");
2109 if (match_autopick != -1)
2111 display_shortened_item_name(autopick_obj, y);
2114 char buf[13] = "\0";
2115 strncpy(buf,autopick_list[match_autopick].name,12);
2123 /* Player location */
2124 (*cy) = py / yrat + 1 + ROW_MAP;
2126 (*cx) = px / xrat + 1 + COL_MAP;
2128 (*cx) = (px / xrat + 1) * 2 + COL_MAP;
2130 /* Restore lighting effects */
2131 view_special_lite = old_view_special_lite;
2132 view_granite_lite = old_view_granite_lite;
2134 /* Free each line map */
2135 for (y = 0; y < (hgt + 2); y++)
2137 /* Free one row each array */
2138 C_KILL(ma[y], (wid + 2), byte);
2139 C_KILL(mc[y], (wid + 2), char);
2140 C_KILL(mp[y], (wid + 2), byte);
2141 C_KILL(match_autopick_yx[y], (wid + 2), int);
2142 C_KILL(object_autopick_yx[y], (wid + 2), object_type *);
2145 /* Free each line map */
2146 C_KILL(ma, (hgt + 2), byte_ptr);
2147 C_KILL(mc, (hgt + 2), char_ptr);
2148 C_KILL(mp, (hgt + 2), byte_ptr);
2149 C_KILL(match_autopick_yx, (hgt + 2), sint_ptr);
2150 C_KILL(object_autopick_yx, (hgt + 2), object_type **);
2152 /* Free each line map */
2153 for (y = 0; y < (cur_hgt + 2); y++)
2155 /* Free one row each array */
2156 C_KILL(bigma[y], (cur_wid + 2), byte);
2157 C_KILL(bigmc[y], (cur_wid + 2), char);
2158 C_KILL(bigmp[y], (cur_wid + 2), byte);
2161 /* Free each line map */
2162 C_KILL(bigma, (cur_hgt + 2), byte_ptr);
2163 C_KILL(bigmc, (cur_hgt + 2), char_ptr);
2164 C_KILL(bigmp, (cur_hgt + 2), byte_ptr);
2169 * Display a "small-scale" map of the dungeon for the player
2171 * Currently, the "player" is displayed on the map. XXX XXX XXX
2173 void do_cmd_view_map(void)
2178 /* Save the screen */
2183 prt("¤ªÂÔ¤Á²¼¤µ¤¤...", 0, 0);
2185 prt("Please wait...", 0, 0);
2191 /* Clear the screen */
2194 display_autopick = 0;
2196 /* Display the map */
2197 display_map(&cy, &cx);
2200 if(max_autopick && !p_ptr->wild_mode)
2202 display_autopick = ITEM_DISPLAY;
2209 int wid, hgt, row_message;
2211 Term_get_size(&wid, &hgt);
2212 row_message = hgt - 1;
2215 put_str("²¿¤«¥¡¼¤ò²¡¤·¤Æ¤¯¤À¤µ¤¤('M':½¦¤¦ 'N':ÊüÃÖ 'D':M+N 'K':²õ¤¹¥¢¥¤¥Æ¥à¤òɽ¼¨)", row_message, 1);
2217 put_str(" Hit M, N(for ~), K(for !), or D(same as M+N) to display auto-picker items.", row_message, 1);
2220 /* Hilite the player */
2221 move_cursor(cy, cx);
2226 flag = (DO_AUTOPICK | DO_QUERY_AUTOPICK);
2228 flag = DONT_AUTOPICK;
2230 flag = DO_AUTODESTROY;
2232 flag = (DO_AUTOPICK | DO_QUERY_AUTOPICK | DONT_AUTOPICK);
2238 if (~display_autopick & flag)
2239 display_autopick |= flag;
2241 display_autopick &= ~flag;
2242 /* Display the map */
2243 display_map(&cy, &cx);
2246 display_autopick = 0;
2252 put_str("²¿¤«¥¡¼¤ò²¡¤¹¤È¥²¡¼¥à¤ËÌá¤ê¤Þ¤¹", 23, 30);
2254 put_str("Hit any key to continue", 23, 30);
2255 #endif /* Hilite the player */
2256 move_cursor(cy, cx);
2261 /* Restore the screen */
2270 * Some comments on the cave grid flags. -BEN-
2273 * One of the major bottlenecks in previous versions of Angband was in
2274 * the calculation of "line of sight" from the player to various grids,
2275 * such as monsters. This was such a nasty bottleneck that a lot of
2276 * silly things were done to reduce the dependancy on "line of sight",
2277 * for example, you could not "see" any grids in a lit room until you
2278 * actually entered the room, and there were all kinds of bizarre grid
2279 * flags to enable this behavior. This is also why the "call light"
2280 * spells always lit an entire room.
2282 * The code below provides functions to calculate the "field of view"
2283 * for the player, which, once calculated, provides extremely fast
2284 * calculation of "line of sight from the player", and to calculate
2285 * the "field of torch lite", which, again, once calculated, provides
2286 * extremely fast calculation of "which grids are lit by the player's
2287 * lite source". In addition to marking grids as "GRID_VIEW" and/or
2288 * "GRID_LITE", as appropriate, these functions maintain an array for
2289 * each of these two flags, each array containing the locations of all
2290 * of the grids marked with the appropriate flag, which can be used to
2291 * very quickly scan through all of the grids in a given set.
2293 * To allow more "semantically valid" field of view semantics, whenever
2294 * the field of view (or the set of torch lit grids) changes, all of the
2295 * grids in the field of view (or the set of torch lit grids) are "drawn"
2296 * so that changes in the world will become apparent as soon as possible.
2297 * This has been optimized so that only grids which actually "change" are
2298 * redrawn, using the "temp" array and the "GRID_TEMP" flag to keep track
2299 * of the grids which are entering or leaving the relevent set of grids.
2301 * These new methods are so efficient that the old nasty code was removed.
2303 * Note that there is no reason to "update" the "viewable space" unless
2304 * the player "moves", or walls/doors are created/destroyed, and there
2305 * is no reason to "update" the "torch lit grids" unless the field of
2306 * view changes, or the "light radius" changes. This means that when
2307 * the player is resting, or digging, or doing anything that does not
2308 * involve movement or changing the state of the dungeon, there is no
2309 * need to update the "view" or the "lite" regions, which is nice.
2311 * Note that the calls to the nasty "los()" function have been reduced
2312 * to a bare minimum by the use of the new "field of view" calculations.
2314 * I wouldn't be surprised if slight modifications to the "update_view()"
2315 * function would allow us to determine "reverse line-of-sight" as well
2316 * as "normal line-of-sight", which would allow monsters to use a more
2317 * "correct" calculation to determine if they can "see" the player. For
2318 * now, monsters simply "cheat" somewhat and assume that if the player
2319 * has "line of sight" to the monster, then the monster can "pretend"
2320 * that it has "line of sight" to the player.
2323 * The "update_lite()" function maintains the "CAVE_LITE" flag for each
2324 * grid and maintains an array of all "CAVE_LITE" grids.
2326 * This set of grids is the complete set of all grids which are lit by
2327 * the players light source, which allows the "player_can_see_bold()"
2328 * function to work very quickly.
2330 * Note that every "CAVE_LITE" grid is also a "CAVE_VIEW" grid, and in
2331 * fact, the player (unless blind) can always "see" all grids which are
2332 * marked as "CAVE_LITE", unless they are "off screen".
2335 * The "update_view()" function maintains the "CAVE_VIEW" flag for each
2336 * grid and maintains an array of all "CAVE_VIEW" grids.
2338 * This set of grids is the complete set of all grids within line of sight
2339 * of the player, allowing the "player_has_los_bold()" macro to work very
2343 * The current "update_view()" algorithm uses the "CAVE_XTRA" flag as a
2344 * temporary internal flag to mark those grids which are not only in view,
2345 * but which are also "easily" in line of sight of the player. This flag
2346 * is always cleared when we are done.
2349 * The current "update_lite()" and "update_view()" algorithms use the
2350 * "CAVE_TEMP" flag, and the array of grids which are marked as "CAVE_TEMP",
2351 * to keep track of which grids were previously marked as "CAVE_LITE" or
2352 * "CAVE_VIEW", which allows us to optimize the "screen updates".
2354 * The "CAVE_TEMP" flag, and the array of "CAVE_TEMP" grids, is also used
2355 * for various other purposes, such as spreading lite or darkness during
2356 * "lite_room()" / "unlite_room()", and for calculating monster flow.
2359 * Any grid can be marked as "CAVE_GLOW" which means that the grid itself is
2360 * in some way permanently lit. However, for the player to "see" anything
2361 * in the grid, as determined by "player_can_see()", the player must not be
2362 * blind, the grid must be marked as "CAVE_VIEW", and, in addition, "wall"
2363 * grids, even if marked as "perma lit", are only illuminated if they touch
2364 * a grid which is not a wall and is marked both "CAVE_GLOW" and "CAVE_VIEW".
2367 * To simplify various things, a grid may be marked as "CAVE_MARK", meaning
2368 * that even if the player cannot "see" the grid, he "knows" the terrain in
2369 * that grid. This is used to "remember" walls/doors/stairs/floors when they
2370 * are "seen" or "detected", and also to "memorize" floors, after "wiz_lite()",
2371 * or when one of the "memorize floor grids" options induces memorization.
2373 * Objects are "memorized" in a different way, using a special "marked" flag
2374 * on the object itself, which is set when an object is observed or detected.
2377 * A grid may be marked as "CAVE_ROOM" which means that it is part of a "room",
2378 * and should be illuminated by "lite room" and "darkness" spells.
2381 * A grid may be marked as "CAVE_ICKY" which means it is part of a "vault",
2382 * and should be unavailable for "teleportation" destinations.
2385 * The "view_perma_grids" allows the player to "memorize" every perma-lit grid
2386 * which is observed, and the "view_torch_grids" allows the player to memorize
2387 * every torch-lit grid. The player will always memorize important walls,
2388 * doors, stairs, and other terrain features, as well as any "detected" grids.
2390 * Note that the new "update_view()" method allows, among other things, a room
2391 * to be "partially" seen as the player approaches it, with a growing cone of
2392 * floor appearing as the player gets closer to the door. Also, by not turning
2393 * on the "memorize perma-lit grids" option, the player will only "see" those
2394 * floor grids which are actually in line of sight.
2396 * And my favorite "plus" is that you can now use a special option to draw the
2397 * "floors" in the "viewable region" brightly (actually, to draw the *other*
2398 * grids dimly), providing a "pretty" effect as the player runs around, and
2399 * to efficiently display the "torch lite" in a special color.
2402 * Some comments on the "update_view()" algorithm...
2404 * The algorithm is very fast, since it spreads "obvious" grids very quickly,
2405 * and only has to call "los()" on the borderline cases. The major axes/diags
2406 * even terminate early when they hit walls. I need to find a quick way
2407 * to "terminate" the other scans.
2409 * Note that in the worst case (a big empty area with say 5% scattered walls),
2410 * each of the 1500 or so nearby grids is checked once, most of them getting
2411 * an "instant" rating, and only a small portion requiring a call to "los()".
2413 * The only time that the algorithm appears to be "noticeably" too slow is
2414 * when running, and this is usually only important in town, since the town
2415 * provides about the worst scenario possible, with large open regions and
2416 * a few scattered obstructions. There is a special "efficiency" option to
2417 * allow the player to reduce his field of view in town, if needed.
2419 * In the "best" case (say, a normal stretch of corridor), the algorithm
2420 * makes one check for each viewable grid, and makes no calls to "los()".
2421 * So running in corridors is very fast, and if a lot of monsters are
2422 * nearby, it is much faster than the old methods.
2424 * Note that resting, most normal commands, and several forms of running,
2425 * plus all commands executed near large groups of monsters, are strictly
2426 * more efficient with "update_view()" that with the old "compute los() on
2427 * demand" method, primarily because once the "field of view" has been
2428 * calculated, it does not have to be recalculated until the player moves
2429 * (or a wall or door is created or destroyed).
2431 * Note that we no longer have to do as many "los()" checks, since once the
2432 * "view" region has been built, very few things cause it to be "changed"
2433 * (player movement, and the opening/closing of doors, changes in wall status).
2434 * Note that door/wall changes are only relevant when the door/wall itself is
2435 * in the "view" region.
2437 * The algorithm seems to only call "los()" from zero to ten times, usually
2438 * only when coming down a corridor into a room, or standing in a room, just
2439 * misaligned with a corridor. So if, say, there are five "nearby" monsters,
2440 * we will be reducing the calls to "los()".
2442 * I am thinking in terms of an algorithm that "walks" from the central point
2443 * out to the maximal "distance", at each point, determining the "view" code
2444 * (above). For each grid not on a major axis or diagonal, the "view" code
2445 * depends on the "cave_los_bold()" and "view" of exactly two other grids
2446 * (the one along the nearest diagonal, and the one next to that one, see
2447 * "update_view_aux()"...).
2449 * We "memorize" the viewable space array, so that at the cost of under 3000
2450 * bytes, we reduce the time taken by "forget_view()" to one assignment for
2451 * each grid actually in the "viewable space". And for another 3000 bytes,
2452 * we prevent "erase + redraw" ineffiencies via the "seen" set. These bytes
2453 * are also used by other routines, thus reducing the cost to almost nothing.
2455 * A similar thing is done for "forget_lite()" in which case the savings are
2456 * much less, but save us from doing bizarre maintenance checking.
2458 * In the worst "normal" case (in the middle of the town), the reachable space
2459 * actually reaches to more than half of the largest possible "circle" of view,
2460 * or about 800 grids, and in the worse case (in the middle of a dungeon level
2461 * where all the walls have been removed), the reachable space actually reaches
2462 * the theoretical maximum size of just under 1500 grids.
2464 * Each grid G examines the "state" of two (?) other (adjacent) grids, G1 & G2.
2465 * If G1 is lite, G is lite. Else if G2 is lite, G is half. Else if G1 and G2
2466 * are both half, G is half. Else G is dark. It only takes 2 (or 4) bits to
2467 * "name" a grid, so (for MAX_RAD of 20) we could use 1600 bytes, and scan the
2468 * entire possible space (including initialization) in one step per grid. If
2469 * we do the "clearing" as a separate step (and use an array of "view" grids),
2470 * then the clearing will take as many steps as grids that were viewed, and the
2471 * algorithm will be able to "stop" scanning at various points.
2472 * Oh, and outside of the "torch radius", only "lite" grids need to be scanned.
2483 * Actually erase the entire "lite" array, redrawing every grid
2485 void forget_lite(void)
2489 /* None to forget */
2490 if (!lite_n) return;
2492 /* Clear them all */
2493 for (i = 0; i < lite_n; i++)
2498 /* Forget "LITE" flag */
2499 cave[y][x].info &= ~(CAVE_LITE);
2502 /* lite_spot(y, x); Perhaps don't need? */
2511 * For delayed visual update
2513 #define cave_note_and_redraw_later(C,Y,X) \
2515 (C)->info |= CAVE_NOTE; \
2516 cave_redraw_later((C), (Y), (X)); \
2521 * For delayed visual update
2523 #define cave_redraw_later(C,Y,X) \
2525 if (!((C)->info & CAVE_REDRAW)) \
2527 (C)->info |= CAVE_REDRAW; \
2528 redraw_y[redraw_n] = (Y); \
2529 redraw_x[redraw_n++] = (X); \
2537 * This macro allows us to efficiently add a grid to the "lite" array,
2538 * note that we are never called for illegal grids, or for grids which
2539 * have already been placed into the "lite" array, and we are never
2540 * called when the "lite" array is full.
2542 #define cave_lite_hack(Y,X) \
2544 if (!(cave[Y][X].info & (CAVE_LITE))) \
2546 cave[Y][X].info |= (CAVE_LITE); \
2547 lite_y[lite_n] = (Y); \
2548 lite_x[lite_n++] = (X); \
2554 * Update the set of grids "illuminated" by the player's lite.
2556 * This routine needs to use the results of "update_view()"
2558 * Note that "blindness" does NOT affect "torch lite". Be careful!
2560 * We optimize most lites (all non-artifact lites) by using "obvious"
2561 * facts about the results of "small" lite radius, and we attempt to
2562 * list the "nearby" grids before the more "distant" ones in the
2563 * array of torch-lit grids.
2565 * We assume that "radius zero" lite is in fact no lite at all.
2567 * Torch Lantern Artifacts
2577 void update_lite(void)
2579 int i, x, y, min_x, max_x, min_y, max_y;
2580 int p = p_ptr->cur_lite;
2583 /*** Special case ***/
2586 /* Hack -- Player has no lite */
2589 /* Forget the old lite */
2590 /* forget_lite(); Perhaps don't need? */
2592 /* Add it to later visual update */
2593 cave_redraw_later(&cave[py][px], py, px);
2597 /*** Save the old "lite" grids for later ***/
2599 /* Clear them all */
2600 for (i = 0; i < lite_n; i++)
2605 /* Mark the grid as not "lite" */
2606 cave[y][x].info &= ~(CAVE_LITE);
2608 /* Mark the grid as "seen" */
2609 cave[y][x].info |= (CAVE_TEMP);
2611 /* Add it to the "seen" set */
2621 /*** Collect the new "lite" grids ***/
2623 /* Radius 1 -- torch radius */
2627 cave_lite_hack(py, px);
2630 cave_lite_hack(py+1, px);
2631 cave_lite_hack(py-1, px);
2632 cave_lite_hack(py, px+1);
2633 cave_lite_hack(py, px-1);
2635 /* Diagonal grids */
2636 cave_lite_hack(py+1, px+1);
2637 cave_lite_hack(py+1, px-1);
2638 cave_lite_hack(py-1, px+1);
2639 cave_lite_hack(py-1, px-1);
2642 /* Radius 2 -- lantern radius */
2645 /* South of the player */
2646 if (cave_los_bold(py + 1, px))
2648 cave_lite_hack(py+2, px);
2649 cave_lite_hack(py+2, px+1);
2650 cave_lite_hack(py+2, px-1);
2653 /* North of the player */
2654 if (cave_los_bold(py - 1, px))
2656 cave_lite_hack(py-2, px);
2657 cave_lite_hack(py-2, px+1);
2658 cave_lite_hack(py-2, px-1);
2661 /* East of the player */
2662 if (cave_los_bold(py, px + 1))
2664 cave_lite_hack(py, px+2);
2665 cave_lite_hack(py+1, px+2);
2666 cave_lite_hack(py-1, px+2);
2669 /* West of the player */
2670 if (cave_los_bold(py, px - 1))
2672 cave_lite_hack(py, px-2);
2673 cave_lite_hack(py+1, px-2);
2674 cave_lite_hack(py-1, px-2);
2678 /* Radius 3+ -- artifact radius */
2683 /* Paranoia -- see "LITE_MAX" */
2686 /* South-East of the player */
2687 if (cave_los_bold(py + 1, px + 1))
2689 cave_lite_hack(py+2, px+2);
2692 /* South-West of the player */
2693 if (cave_los_bold(py + 1, px - 1))
2695 cave_lite_hack(py+2, px-2);
2698 /* North-East of the player */
2699 if (cave_los_bold(py - 1, px + 1))
2701 cave_lite_hack(py-2, px+2);
2704 /* North-West of the player */
2705 if (cave_los_bold(py - 1, px - 1))
2707 cave_lite_hack(py-2, px-2);
2712 if (min_y < 0) min_y = 0;
2716 if (max_y > cur_hgt-1) max_y = cur_hgt-1;
2720 if (min_x < 0) min_x = 0;
2724 if (max_x > cur_wid-1) max_x = cur_wid-1;
2726 /* Scan the maximal box */
2727 for (y = min_y; y <= max_y; y++)
2729 for (x = min_x; x <= max_x; x++)
2731 int dy = (py > y) ? (py - y) : (y - py);
2732 int dx = (px > x) ? (px - x) : (x - px);
2734 /* Skip the "central" grids (above) */
2735 if ((dy <= 2) && (dx <= 2)) continue;
2737 /* Hack -- approximate the distance */
2738 d = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));
2740 /* Skip distant grids */
2741 if (d > p) continue;
2743 /* Viewable, nearby, grids get "torch lit" */
2744 if (cave[y][x].info & CAVE_VIEW)
2746 /* This grid is "torch lit" */
2747 cave_lite_hack(y, x);
2754 /*** Complete the algorithm ***/
2756 /* Draw the new grids */
2757 for (i = 0; i < lite_n; i++)
2762 c_ptr = &cave[y][x];
2764 /* Update fresh grids */
2765 if (c_ptr->info & (CAVE_TEMP)) continue;
2767 /* Add it to later visual update */
2768 cave_note_and_redraw_later(c_ptr, y, x);
2771 /* Clear them all */
2772 for (i = 0; i < temp_n; i++)
2777 c_ptr = &cave[y][x];
2779 /* No longer in the array */
2780 c_ptr->info &= ~(CAVE_TEMP);
2782 /* Update stale grids */
2783 if (c_ptr->info & (CAVE_LITE)) continue;
2785 /* Add it to later visual update */
2786 cave_redraw_later(c_ptr, y, x);
2792 /* Mega-Hack -- Visual update later */
2793 p_ptr->update |= (PU_DELAY_VIS);
2797 static bool mon_invis;
2798 static s16b mon_fy, mon_fx;
2801 * Add a square to the changes array
2803 static void mon_lite_hack(int y, int x)
2806 int midpoint, dpf, d;
2808 /* We trust this grid is in bounds */
2809 /* if (!in_bounds2(y, x)) return; */
2811 c_ptr = &cave[y][x];
2813 /* Want a unlit square in view of the player */
2814 if ((c_ptr->info & (CAVE_MNLT | CAVE_VIEW)) != CAVE_VIEW) return;
2816 if (!cave_los_grid(c_ptr))
2818 /* Hack -- Prevent monster lite leakage in walls */
2820 /* Horizontal walls between player and a monster */
2821 if (((y < py) && (y > mon_fy)) || ((y > py) && (y < mon_fy)))
2825 midpoint = mon_fx + ((px - mon_fx) * ABS(d)) / ABS(dpf);
2827 /* Only first wall viewed from mid-x is lit */
2830 if (!cave_los_bold(y, x + 1)) return;
2832 else if (x > midpoint)
2834 if (!cave_los_bold(y, x - 1)) return;
2837 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2838 else if (mon_invis) return;
2841 /* Vertical walls between player and a monster */
2842 if (((x < px) && (x > mon_fx)) || ((x > px) && (x < mon_fx)))
2846 midpoint = mon_fy + ((py - mon_fy) * ABS(d)) / ABS(dpf);
2848 /* Only first wall viewed from mid-y is lit */
2851 if (!cave_los_bold(y + 1, x)) return;
2853 else if (y > midpoint)
2855 if (!cave_los_bold(y - 1, x)) return;
2858 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2859 else if (mon_invis) return;
2863 /* We trust temp_n does not exceed TEMP_MAX */
2866 if (!(c_ptr->info & CAVE_MNDK))
2868 /* Save this square */
2877 /* No longer dark */
2878 c_ptr->info &= ~(CAVE_MNDK);
2882 c_ptr->info |= CAVE_MNLT;
2887 * Add a square to the changes array
2889 static void mon_dark_hack(int y, int x)
2892 int midpoint, dpf, d;
2894 /* We trust this grid is in bounds */
2895 /* if (!in_bounds2(y, x)) return; */
2897 c_ptr = &cave[y][x];
2899 /* Want a unlit and undarkened square in view of the player */
2900 if ((c_ptr->info & (CAVE_LITE | CAVE_MNLT | CAVE_MNDK | CAVE_VIEW)) != CAVE_VIEW) return;
2902 if (!cave_los_grid(c_ptr) && !cave_have_flag_grid(c_ptr, FF_PROJECT))
2904 /* Hack -- Prevent monster dark lite leakage in walls */
2906 /* Horizontal walls between player and a monster */
2907 if (((y < py) && (y > mon_fy)) || ((y > py) && (y < mon_fy)))
2911 midpoint = mon_fx + ((px - mon_fx) * ABS(d)) / ABS(dpf);
2913 /* Only first wall viewed from mid-x is lit */
2916 if (!cave_los_bold(y, x + 1) && !cave_have_flag_bold(y, x + 1, FF_PROJECT)) return;
2918 else if (x > midpoint)
2920 if (!cave_los_bold(y, x - 1) && !cave_have_flag_bold(y, x - 1, FF_PROJECT)) return;
2923 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2924 else if (mon_invis) return;
2927 /* Vertical walls between player and a monster */
2928 if (((x < px) && (x > mon_fx)) || ((x > px) && (x < mon_fx)))
2932 midpoint = mon_fy + ((py - mon_fy) * ABS(d)) / ABS(dpf);
2934 /* Only first wall viewed from mid-y is lit */
2937 if (!cave_los_bold(y + 1, x) && !cave_have_flag_bold(y + 1, x, FF_PROJECT)) return;
2939 else if (y > midpoint)
2941 if (!cave_los_bold(y - 1, x) && !cave_have_flag_bold(y - 1, x, FF_PROJECT)) return;
2944 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2945 else if (mon_invis) return;
2949 /* We trust temp_n does not exceed TEMP_MAX */
2951 /* Save this square */
2957 c_ptr->info |= CAVE_MNDK;
2962 * Update squares illuminated or darkened by monsters.
2964 * Hack - use the CAVE_ROOM flag (renamed to be CAVE_MNLT) to
2965 * denote squares illuminated by monsters.
2967 * The CAVE_TEMP and CAVE_XTRA flag are used to store the state during the
2968 * updating. Only squares in view of the player, whos state
2969 * changes are drawn via lite_spot().
2971 void update_mon_lite(void)
2977 void (*add_mon_lite)(int, int);
2982 /* Non-Ninja player in the darkness */
2983 int dis_lim = ((d_info[dungeon_type].flags1 & DF1_DARKNESS) && !p_ptr->see_nocto) ?
2984 (MAX_SIGHT / 2 + 1) : (MAX_SIGHT + 3);
2986 /* Clear all monster lit squares */
2987 for (i = 0; i < mon_lite_n; i++)
2990 c_ptr = &cave[mon_lite_y[i]][mon_lite_x[i]];
2992 /* Set temp or xtra flag */
2993 c_ptr->info |= (c_ptr->info & CAVE_MNLT) ? CAVE_TEMP : CAVE_XTRA;
2995 /* Clear monster illumination flag */
2996 c_ptr->info &= ~(CAVE_MNLT | CAVE_MNDK);
2999 /* Empty temp list of new squares to lite up */
3002 /* If a monster stops time, don't process */
3005 monster_type *m_ptr;
3006 monster_race *r_ptr;
3008 /* Loop through monsters, adding newly lit squares to changes list */
3009 for (i = 1; i < m_max; i++)
3012 r_ptr = &r_info[m_ptr->r_idx];
3014 /* Skip dead monsters */
3015 if (!m_ptr->r_idx) continue;
3017 /* Is it too far away? */
3018 if (m_ptr->cdis > dis_lim) continue;
3020 /* Get lite radius */
3023 /* Note the radii are cumulative */
3024 if (r_ptr->flags7 & (RF7_HAS_LITE_1 | RF7_SELF_LITE_1)) rad++;
3025 if (r_ptr->flags7 & (RF7_HAS_LITE_2 | RF7_SELF_LITE_2)) rad += 2;
3026 if (r_ptr->flags7 & (RF7_HAS_DARK_1 | RF7_SELF_DARK_1)) rad--;
3027 if (r_ptr->flags7 & (RF7_HAS_DARK_2 | RF7_SELF_DARK_2)) rad -= 2;
3029 /* Exit if has no light */
3033 if (!(r_ptr->flags7 & (RF7_SELF_LITE_1 | RF7_SELF_LITE_2)) && (MON_CSLEEP(m_ptr) || (!dun_level && is_daytime()) || p_ptr->inside_battle)) continue;
3034 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) rad = 1;
3035 add_mon_lite = mon_lite_hack;
3040 if (!(r_ptr->flags7 & (RF7_SELF_DARK_1 | RF7_SELF_DARK_2)) && (MON_CSLEEP(m_ptr) || (!dun_level && !is_daytime()))) continue;
3041 add_mon_lite = mon_dark_hack;
3042 f_flag = FF_PROJECT;
3043 rad = -rad; /* Use absolute value */
3046 /* Access the location */
3050 /* Is the monster visible? */
3051 mon_invis = !(cave[mon_fy][mon_fx].info & CAVE_VIEW);
3053 /* The square it is on */
3054 add_mon_lite(mon_fy, mon_fx);
3056 /* Adjacent squares */
3057 add_mon_lite(mon_fy + 1, mon_fx);
3058 add_mon_lite(mon_fy - 1, mon_fx);
3059 add_mon_lite(mon_fy, mon_fx + 1);
3060 add_mon_lite(mon_fy, mon_fx - 1);
3061 add_mon_lite(mon_fy + 1, mon_fx + 1);
3062 add_mon_lite(mon_fy + 1, mon_fx - 1);
3063 add_mon_lite(mon_fy - 1, mon_fx + 1);
3064 add_mon_lite(mon_fy - 1, mon_fx - 1);
3069 /* South of the monster */
3070 if (cave_have_flag_bold(mon_fy + 1, mon_fx, f_flag))
3072 add_mon_lite(mon_fy + 2, mon_fx + 1);
3073 add_mon_lite(mon_fy + 2, mon_fx);
3074 add_mon_lite(mon_fy + 2, mon_fx - 1);
3076 c_ptr = &cave[mon_fy + 2][mon_fx];
3079 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3081 add_mon_lite(mon_fy + 3, mon_fx + 1);
3082 add_mon_lite(mon_fy + 3, mon_fx);
3083 add_mon_lite(mon_fy + 3, mon_fx - 1);
3087 /* North of the monster */
3088 if (cave_have_flag_bold(mon_fy - 1, mon_fx, f_flag))
3090 add_mon_lite(mon_fy - 2, mon_fx + 1);
3091 add_mon_lite(mon_fy - 2, mon_fx);
3092 add_mon_lite(mon_fy - 2, mon_fx - 1);
3094 c_ptr = &cave[mon_fy - 2][mon_fx];
3097 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3099 add_mon_lite(mon_fy - 3, mon_fx + 1);
3100 add_mon_lite(mon_fy - 3, mon_fx);
3101 add_mon_lite(mon_fy - 3, mon_fx - 1);
3105 /* East of the monster */
3106 if (cave_have_flag_bold(mon_fy, mon_fx + 1, f_flag))
3108 add_mon_lite(mon_fy + 1, mon_fx + 2);
3109 add_mon_lite(mon_fy, mon_fx + 2);
3110 add_mon_lite(mon_fy - 1, mon_fx + 2);
3112 c_ptr = &cave[mon_fy][mon_fx + 2];
3115 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3117 add_mon_lite(mon_fy + 1, mon_fx + 3);
3118 add_mon_lite(mon_fy, mon_fx + 3);
3119 add_mon_lite(mon_fy - 1, mon_fx + 3);
3123 /* West of the monster */
3124 if (cave_have_flag_bold(mon_fy, mon_fx - 1, f_flag))
3126 add_mon_lite(mon_fy + 1, mon_fx - 2);
3127 add_mon_lite(mon_fy, mon_fx - 2);
3128 add_mon_lite(mon_fy - 1, mon_fx - 2);
3130 c_ptr = &cave[mon_fy][mon_fx - 2];
3133 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3135 add_mon_lite(mon_fy + 1, mon_fx - 3);
3136 add_mon_lite(mon_fy, mon_fx - 3);
3137 add_mon_lite(mon_fy - 1, mon_fx - 3);
3145 /* South-East of the monster */
3146 if (cave_have_flag_bold(mon_fy + 1, mon_fx + 1, f_flag))
3148 add_mon_lite(mon_fy + 2, mon_fx + 2);
3151 /* South-West of the monster */
3152 if (cave_have_flag_bold(mon_fy + 1, mon_fx - 1, f_flag))
3154 add_mon_lite(mon_fy + 2, mon_fx - 2);
3157 /* North-East of the monster */
3158 if (cave_have_flag_bold(mon_fy - 1, mon_fx + 1, f_flag))
3160 add_mon_lite(mon_fy - 2, mon_fx + 2);
3163 /* North-West of the monster */
3164 if (cave_have_flag_bold(mon_fy - 1, mon_fx - 1, f_flag))
3166 add_mon_lite(mon_fy - 2, mon_fx - 2);
3172 /* Save end of list of new squares */
3176 * Look at old set flags to see if there are any changes.
3178 for (i = 0; i < mon_lite_n; i++)
3183 /* We trust this grid is in bounds */
3186 c_ptr = &cave[fy][fx];
3188 if (c_ptr->info & CAVE_TEMP) /* Pervious lit */
3190 /* It it no longer lit? */
3191 if ((c_ptr->info & (CAVE_VIEW | CAVE_MNLT)) == CAVE_VIEW)
3193 /* It is now unlit */
3194 /* Add it to later visual update */
3195 cave_note_and_redraw_later(c_ptr, fy, fx);
3198 else /* Pervious darkened */
3200 /* It it no longer darken? */
3201 if ((c_ptr->info & (CAVE_VIEW | CAVE_MNDK)) == CAVE_VIEW)
3203 /* It is now undarken */
3204 /* Add it to later visual update */
3205 cave_note_and_redraw_later(c_ptr, fy, fx);
3209 /* Add to end of temp array */
3210 temp_x[temp_n] = (byte)fx;
3211 temp_y[temp_n] = (byte)fy;
3215 /* Clear the lite array */
3218 /* Copy the temp array into the lit array lighting the new squares. */
3219 for (i = 0; i < end_temp; i++)
3224 /* We trust this grid is in bounds */
3227 c_ptr = &cave[fy][fx];
3229 if (c_ptr->info & CAVE_MNLT) /* Lit */
3231 /* The is the square newly lit and visible? */
3232 if ((c_ptr->info & (CAVE_VIEW | CAVE_TEMP)) == CAVE_VIEW)
3235 /* Add it to later visual update */
3236 cave_note_and_redraw_later(c_ptr, fy, fx);
3241 /* The is the square newly darkened and visible? */
3242 if ((c_ptr->info & (CAVE_VIEW | CAVE_XTRA)) == CAVE_VIEW)
3244 /* It is now darkened */
3245 /* Add it to later visual update */
3246 cave_note_and_redraw_later(c_ptr, fy, fx);
3250 /* Save in the monster lit or darkened array */
3251 mon_lite_x[mon_lite_n] = fx;
3252 mon_lite_y[mon_lite_n] = fy;
3256 /* Clear the temp flag for the old lit or darken grids */
3257 for (i = end_temp; i < temp_n; i++)
3259 /* We trust this grid is in bounds */
3261 cave[temp_y[i]][temp_x[i]].info &= ~(CAVE_TEMP | CAVE_XTRA);
3264 /* Finished with temp_n */
3267 /* Mega-Hack -- Visual update later */
3268 p_ptr->update |= (PU_DELAY_VIS);
3270 p_ptr->monlite = (cave[py][px].info & CAVE_MNLT) ? TRUE : FALSE;
3272 if (p_ptr->special_defense & NINJA_S_STEALTH)
3274 if (p_ptr->old_monlite != p_ptr->monlite)
3279 msg_print("±Æ¤Îʤ¤¤¤¬Çö¤ì¤¿µ¤¤¬¤¹¤ë¡£");
3281 msg_print("Your mantle of shadow become thin.");
3287 msg_print("±Æ¤Îʤ¤¤¤¬Ç»¤¯¤Ê¤Ã¤¿¡ª");
3289 msg_print("Your mantle of shadow restored its original darkness.");
3294 p_ptr->old_monlite = p_ptr->monlite;
3297 void clear_mon_lite(void)
3302 /* Clear all monster lit squares */
3303 for (i = 0; i < mon_lite_n; i++)
3306 c_ptr = &cave[mon_lite_y[i]][mon_lite_x[i]];
3308 /* Clear monster illumination flag */
3309 c_ptr->info &= ~(CAVE_MNLT | CAVE_MNDK);
3312 /* Empty the array */
3319 * Clear the viewable space
3321 void forget_view(void)
3327 /* None to forget */
3328 if (!view_n) return;
3330 /* Clear them all */
3331 for (i = 0; i < view_n; i++)
3336 /* Access the grid */
3337 c_ptr = &cave[y][x];
3339 /* Forget that the grid is viewable */
3340 c_ptr->info &= ~(CAVE_VIEW);
3342 /* if (!panel_contains(y, x)) continue; */
3344 /* Update the screen */
3345 /* lite_spot(y, x); Perhaps don't need? */
3355 * This macro allows us to efficiently add a grid to the "view" array,
3356 * note that we are never called for illegal grids, or for grids which
3357 * have already been placed into the "view" array, and we are never
3358 * called when the "view" array is full.
3360 #define cave_view_hack(C,Y,X) \
3362 if (!((C)->info & (CAVE_VIEW))){\
3363 (C)->info |= (CAVE_VIEW); \
3364 view_y[view_n] = (Y); \
3365 view_x[view_n] = (X); \
3372 * Helper function for "update_view()" below
3374 * We are checking the "viewability" of grid (y,x) by the player.
3376 * This function assumes that (y,x) is legal (i.e. on the map).
3378 * Grid (y1,x1) is on the "diagonal" between (py,px) and (y,x)
3379 * Grid (y2,x2) is "adjacent", also between (py,px) and (y,x).
3381 * Note that we are using the "CAVE_XTRA" field for marking grids as
3382 * "easily viewable". This bit is cleared at the end of "update_view()".
3384 * This function adds (y,x) to the "viewable set" if necessary.
3386 * This function now returns "TRUE" if vision is "blocked" by grid (y,x).
3388 static bool update_view_aux(int y, int x, int y1, int x1, int y2, int x2)
3390 bool f1, f2, v1, v2, z1, z2, wall;
3394 cave_type *g1_c_ptr;
3395 cave_type *g2_c_ptr;
3397 /* Access the grids */
3398 g1_c_ptr = &cave[y1][x1];
3399 g2_c_ptr = &cave[y2][x2];
3402 /* Check for walls */
3403 f1 = (cave_los_grid(g1_c_ptr));
3404 f2 = (cave_los_grid(g2_c_ptr));
3406 /* Totally blocked by physical walls */
3407 if (!f1 && !f2) return (TRUE);
3410 /* Check for visibility */
3411 v1 = (f1 && (g1_c_ptr->info & (CAVE_VIEW)));
3412 v2 = (f2 && (g2_c_ptr->info & (CAVE_VIEW)));
3414 /* Totally blocked by "unviewable neighbors" */
3415 if (!v1 && !v2) return (TRUE);
3418 /* Access the grid */
3419 c_ptr = &cave[y][x];
3422 /* Check for walls */
3423 wall = (!cave_los_grid(c_ptr));
3426 /* Check the "ease" of visibility */
3427 z1 = (v1 && (g1_c_ptr->info & (CAVE_XTRA)));
3428 z2 = (v2 && (g2_c_ptr->info & (CAVE_XTRA)));
3430 /* Hack -- "easy" plus "easy" yields "easy" */
3433 c_ptr->info |= (CAVE_XTRA);
3435 cave_view_hack(c_ptr, y, x);
3440 /* Hack -- primary "easy" yields "viewed" */
3443 cave_view_hack(c_ptr, y, x);
3448 /* Hack -- "view" plus "view" yields "view" */
3451 /* c_ptr->info |= (CAVE_XTRA); */
3453 cave_view_hack(c_ptr, y, x);
3459 /* Mega-Hack -- the "los()" function works poorly on walls */
3462 cave_view_hack(c_ptr, y, x);
3468 /* Hack -- check line of sight */
3469 if (los(py, px, y, x))
3471 cave_view_hack(c_ptr, y, x);
3477 /* Assume no line of sight. */
3484 * Calculate the viewable space
3486 * 1: Process the player
3487 * 1a: The player is always (easily) viewable
3488 * 2: Process the diagonals
3489 * 2a: The diagonals are (easily) viewable up to the first wall
3490 * 2b: But never go more than 2/3 of the "full" distance
3491 * 3: Process the main axes
3492 * 3a: The main axes are (easily) viewable up to the first wall
3493 * 3b: But never go more than the "full" distance
3494 * 4: Process sequential "strips" in each of the eight octants
3495 * 4a: Each strip runs along the previous strip
3496 * 4b: The main axes are "previous" to the first strip
3497 * 4c: Process both "sides" of each "direction" of each strip
3498 * 4c1: Each side aborts as soon as possible
3499 * 4c2: Each side tells the next strip how far it has to check
3501 * Note that the octant processing involves some pretty interesting
3502 * observations involving when a grid might possibly be viewable from
3503 * a given grid, and on the order in which the strips are processed.
3505 * Note the use of the mathematical facts shown below, which derive
3506 * from the fact that (1 < sqrt(2) < 1.5), and that the length of the
3507 * hypotenuse of a right triangle is primarily determined by the length
3508 * of the longest side, when one side is small, and is strictly less
3509 * than one-and-a-half times as long as the longest side when both of
3510 * the sides are large.
3512 * if (manhatten(dy,dx) < R) then (hypot(dy,dx) < R)
3513 * if (manhatten(dy,dx) > R*3/2) then (hypot(dy,dx) > R)
3515 * hypot(dy,dx) is approximated by (dx+dy+MAX(dx,dy)) / 2
3517 * These observations are important because the calculation of the actual
3518 * value of "hypot(dx,dy)" is extremely expensive, involving square roots,
3519 * while for small values (up to about 20 or so), the approximations above
3520 * are correct to within an error of at most one grid or so.
3522 * Observe the use of "full" and "over" in the code below, and the use of
3523 * the specialized calculation involving "limit", all of which derive from
3524 * the observations given above. Basically, we note that the "circle" of
3525 * view is completely contained in an "octagon" whose bounds are easy to
3526 * determine, and that only a few steps are needed to derive the actual
3527 * bounds of the circle given the bounds of the octagon.
3529 * Note that by skipping all the grids in the corners of the octagon, we
3530 * place an upper limit on the number of grids in the field of view, given
3531 * that "full" is never more than 20. Of the 1681 grids in the "square" of
3532 * view, only about 1475 of these are in the "octagon" of view, and even
3533 * fewer are in the "circle" of view, so 1500 or 1536 is more than enough
3534 * entries to completely contain the actual field of view.
3536 * Note also the care taken to prevent "running off the map". The use of
3537 * explicit checks on the "validity" of the "diagonal", and the fact that
3538 * the loops are never allowed to "leave" the map, lets "update_view_aux()"
3539 * use the optimized "cave_los_bold()" macro, and to avoid the overhead
3540 * of multiple checks on the validity of grids.
3542 * Note the "optimizations" involving the "se","sw","ne","nw","es","en",
3543 * "ws","wn" variables. They work like this: While travelling down the
3544 * south-bound strip just to the east of the main south axis, as soon as
3545 * we get to a grid which does not "transmit" viewing, if all of the strips
3546 * preceding us (in this case, just the main axis) had terminated at or before
3547 * the same point, then we can stop, and reset the "max distance" to ourself.
3548 * So, each strip (named by major axis plus offset, thus "se" in this case)
3549 * maintains a "blockage" variable, initialized during the main axis step,
3550 * and checks it whenever a blockage is observed. After processing each
3551 * strip as far as the previous strip told us to process, the next strip is
3552 * told not to go farther than the current strip's farthest viewable grid,
3553 * unless open space is still available. This uses the "k" variable.
3555 * Note the use of "inline" macros for efficiency. The "cave_los_grid()"
3556 * macro is a replacement for "cave_los_bold()" which takes a pointer to
3557 * a cave grid instead of its location. The "cave_view_hack()" macro is a
3558 * chunk of code which adds the given location to the "view" array if it
3559 * is not already there, using both the actual location and a pointer to
3560 * the cave grid. See above.
3562 * By the way, the purpose of this code is to reduce the dependancy on the
3563 * "los()" function which is slow, and, in some cases, not very accurate.
3565 * It is very possible that I am the only person who fully understands this
3566 * function, and for that I am truly sorry, but efficiency was very important
3567 * and the "simple" version of this function was just not fast enough. I am
3568 * more than willing to replace this function with a simpler one, if it is
3569 * equally efficient, and especially willing if the new function happens to
3570 * derive "reverse-line-of-sight" at the same time, since currently monsters
3571 * just use an optimized hack of "you see me, so I see you", and then use the
3572 * actual "projectable()" function to check spell attacks.
3574 void update_view(void)
3576 int n, m, d, k, y, x, z;
3578 int se, sw, ne, nw, es, en, ws, wn;
3582 int y_max = cur_hgt - 1;
3583 int x_max = cur_wid - 1;
3587 /*** Initialize ***/
3590 if (view_reduce_view && !dun_level)
3592 /* Full radius (10) */
3593 full = MAX_SIGHT / 2;
3595 /* Octagon factor (15) */
3596 over = MAX_SIGHT * 3 / 4;
3602 /* Full radius (20) */
3605 /* Octagon factor (30) */
3606 over = MAX_SIGHT * 3 / 2;
3610 /*** Step 0 -- Begin ***/
3612 /* Save the old "view" grids for later */
3613 for (n = 0; n < view_n; n++)
3618 /* Access the grid */
3619 c_ptr = &cave[y][x];
3621 /* Mark the grid as not in "view" */
3622 c_ptr->info &= ~(CAVE_VIEW);
3624 /* Mark the grid as "seen" */
3625 c_ptr->info |= (CAVE_TEMP);
3627 /* Add it to the "seen" set */
3633 /* Start over with the "view" array */
3636 /*** Step 1 -- adjacent grids ***/
3638 /* Now start on the player */
3642 /* Access the grid */
3643 c_ptr = &cave[y][x];
3645 /* Assume the player grid is easily viewable */
3646 c_ptr->info |= (CAVE_XTRA);
3648 /* Assume the player grid is viewable */
3649 cave_view_hack(c_ptr, y, x);
3652 /*** Step 2 -- Major Diagonals ***/
3657 /* Scan south-east */
3658 for (d = 1; d <= z; d++)
3660 c_ptr = &cave[y+d][x+d];
3661 c_ptr->info |= (CAVE_XTRA);
3662 cave_view_hack(c_ptr, y+d, x+d);
3663 if (!cave_los_grid(c_ptr)) break;
3666 /* Scan south-west */
3667 for (d = 1; d <= z; d++)
3669 c_ptr = &cave[y+d][x-d];
3670 c_ptr->info |= (CAVE_XTRA);
3671 cave_view_hack(c_ptr, y+d, x-d);
3672 if (!cave_los_grid(c_ptr)) break;
3675 /* Scan north-east */
3676 for (d = 1; d <= z; d++)
3678 c_ptr = &cave[y-d][x+d];
3679 c_ptr->info |= (CAVE_XTRA);
3680 cave_view_hack(c_ptr, y-d, x+d);
3681 if (!cave_los_grid(c_ptr)) break;
3684 /* Scan north-west */
3685 for (d = 1; d <= z; d++)
3687 c_ptr = &cave[y-d][x-d];
3688 c_ptr->info |= (CAVE_XTRA);
3689 cave_view_hack(c_ptr, y-d, x-d);
3690 if (!cave_los_grid(c_ptr)) break;
3694 /*** Step 3 -- major axes ***/
3697 for (d = 1; d <= full; d++)
3699 c_ptr = &cave[y+d][x];
3700 c_ptr->info |= (CAVE_XTRA);
3701 cave_view_hack(c_ptr, y+d, x);
3702 if (!cave_los_grid(c_ptr)) break;
3705 /* Initialize the "south strips" */
3709 for (d = 1; d <= full; d++)
3711 c_ptr = &cave[y-d][x];
3712 c_ptr->info |= (CAVE_XTRA);
3713 cave_view_hack(c_ptr, y-d, x);
3714 if (!cave_los_grid(c_ptr)) break;
3717 /* Initialize the "north strips" */
3721 for (d = 1; d <= full; d++)
3723 c_ptr = &cave[y][x+d];
3724 c_ptr->info |= (CAVE_XTRA);
3725 cave_view_hack(c_ptr, y, x+d);
3726 if (!cave_los_grid(c_ptr)) break;
3729 /* Initialize the "east strips" */
3733 for (d = 1; d <= full; d++)
3735 c_ptr = &cave[y][x-d];
3736 c_ptr->info |= (CAVE_XTRA);
3737 cave_view_hack(c_ptr, y, x-d);
3738 if (!cave_los_grid(c_ptr)) break;
3741 /* Initialize the "west strips" */
3745 /*** Step 4 -- Divide each "octant" into "strips" ***/
3747 /* Now check each "diagonal" (in parallel) */
3748 for (n = 1; n <= over / 2; n++)
3750 int ypn, ymn, xpn, xmn;
3753 /* Acquire the "bounds" of the maximal circle */
3755 if (z > full - n) z = full - n;
3756 while ((z + n + (n>>1)) > full) z--;
3759 /* Access the four diagonal grids */
3769 /* Maximum distance */
3770 m = MIN(z, y_max - ypn);
3773 if ((xpn <= x_max) && (n < se))
3776 for (k = n, d = 1; d <= m; d++)
3778 /* Check grid "d" in strip "n", notice "blockage" */
3779 if (update_view_aux(ypn+d, xpn, ypn+d-1, xpn-1, ypn+d-1, xpn))
3781 if (n + d >= se) break;
3784 /* Track most distant "non-blockage" */
3791 /* Limit the next strip */
3796 if ((xmn >= 0) && (n < sw))
3799 for (k = n, d = 1; d <= m; d++)
3801 /* Check grid "d" in strip "n", notice "blockage" */
3802 if (update_view_aux(ypn+d, xmn, ypn+d-1, xmn+1, ypn+d-1, xmn))
3804 if (n + d >= sw) break;
3807 /* Track most distant "non-blockage" */
3814 /* Limit the next strip */
3823 /* Maximum distance */
3827 if ((xpn <= x_max) && (n < ne))
3830 for (k = n, d = 1; d <= m; d++)
3832 /* Check grid "d" in strip "n", notice "blockage" */
3833 if (update_view_aux(ymn-d, xpn, ymn-d+1, xpn-1, ymn-d+1, xpn))
3835 if (n + d >= ne) break;
3838 /* Track most distant "non-blockage" */
3845 /* Limit the next strip */
3850 if ((xmn >= 0) && (n < nw))
3853 for (k = n, d = 1; d <= m; d++)
3855 /* Check grid "d" in strip "n", notice "blockage" */
3856 if (update_view_aux(ymn-d, xmn, ymn-d+1, xmn+1, ymn-d+1, xmn))
3858 if (n + d >= nw) break;
3861 /* Track most distant "non-blockage" */
3868 /* Limit the next strip */
3877 /* Maximum distance */
3878 m = MIN(z, x_max - xpn);
3881 if ((ypn <= x_max) && (n < es))
3884 for (k = n, d = 1; d <= m; d++)
3886 /* Check grid "d" in strip "n", notice "blockage" */
3887 if (update_view_aux(ypn, xpn+d, ypn-1, xpn+d-1, ypn, xpn+d-1))
3889 if (n + d >= es) break;
3892 /* Track most distant "non-blockage" */
3899 /* Limit the next strip */
3904 if ((ymn >= 0) && (n < en))
3907 for (k = n, d = 1; d <= m; d++)
3909 /* Check grid "d" in strip "n", notice "blockage" */
3910 if (update_view_aux(ymn, xpn+d, ymn+1, xpn+d-1, ymn, xpn+d-1))
3912 if (n + d >= en) break;
3915 /* Track most distant "non-blockage" */
3922 /* Limit the next strip */
3931 /* Maximum distance */
3935 if ((ypn <= y_max) && (n < ws))
3938 for (k = n, d = 1; d <= m; d++)
3940 /* Check grid "d" in strip "n", notice "blockage" */
3941 if (update_view_aux(ypn, xmn-d, ypn-1, xmn-d+1, ypn, xmn-d+1))
3943 if (n + d >= ws) break;
3946 /* Track most distant "non-blockage" */
3953 /* Limit the next strip */
3958 if ((ymn >= 0) && (n < wn))
3961 for (k = n, d = 1; d <= m; d++)
3963 /* Check grid "d" in strip "n", notice "blockage" */
3964 if (update_view_aux(ymn, xmn-d, ymn+1, xmn-d+1, ymn, xmn-d+1))
3966 if (n + d >= wn) break;
3969 /* Track most distant "non-blockage" */
3976 /* Limit the next strip */
3983 /*** Step 5 -- Complete the algorithm ***/
3985 /* Update all the new grids */
3986 for (n = 0; n < view_n; n++)
3991 /* Access the grid */
3992 c_ptr = &cave[y][x];
3994 /* Clear the "CAVE_XTRA" flag */
3995 c_ptr->info &= ~(CAVE_XTRA);
3997 /* Update only newly viewed grids */
3998 if (c_ptr->info & (CAVE_TEMP)) continue;
4000 /* Add it to later visual update */
4001 cave_note_and_redraw_later(c_ptr, y, x);
4004 /* Wipe the old grids, update as needed */
4005 for (n = 0; n < temp_n; n++)
4010 /* Access the grid */
4011 c_ptr = &cave[y][x];
4013 /* No longer in the array */
4014 c_ptr->info &= ~(CAVE_TEMP);
4016 /* Update only non-viewable grids */
4017 if (c_ptr->info & (CAVE_VIEW)) continue;
4019 /* Add it to later visual update */
4020 cave_redraw_later(c_ptr, y, x);
4026 /* Mega-Hack -- Visual update later */
4027 p_ptr->update |= (PU_DELAY_VIS);
4032 * Mega-Hack -- Delayed visual update
4033 * Only used if update_view(), update_lite() or update_mon_lite() was called
4035 void delayed_visual_update(void)
4040 /* Update needed grids */
4041 for (i = 0; i < redraw_n; i++)
4046 /* Access the grid */
4047 c_ptr = &cave[y][x];
4049 /* Update only needed grids (prevent multiple updating) */
4050 if (!(c_ptr->info & CAVE_REDRAW)) continue;
4052 /* If required, note */
4053 if (c_ptr->info & CAVE_NOTE) note_spot(y, x);
4058 /* Hack -- Visual update of monster on this grid */
4059 if (c_ptr->m_idx) update_mon(c_ptr->m_idx, FALSE);
4061 /* No longer in the array */
4062 c_ptr->info &= ~(CAVE_NOTE | CAVE_REDRAW);
4071 * Hack -- forget the "flow" information
4073 void forget_flow(void)
4077 /* Check the entire dungeon */
4078 for (y = 0; y < cur_hgt; y++)
4080 for (x = 0; x < cur_wid; x++)
4082 /* Forget the old data */
4083 cave[y][x].dist = 0;
4084 cave[y][x].cost = 0;
4085 cave[y][x].when = 0;
4092 * Hack - speed up the update_flow algorithm by only doing
4093 * it everytime the player moves out of LOS of the last
4096 static u16b flow_x = 0;
4097 static u16b flow_y = 0;
4102 * Hack -- fill in the "cost" field of every grid that the player
4103 * can "reach" with the number of steps needed to reach that grid.
4104 * This also yields the "distance" of the player from every grid.
4106 * In addition, mark the "when" of the grids that can reach
4107 * the player with the incremented value of "flow_n".
4109 * Hack -- use the "seen" array as a "circular queue".
4111 * We do not need a priority queue because the cost from grid
4112 * to grid is always "one" and we process them in order.
4114 void update_flow(void)
4120 /* Paranoia -- make sure the array is empty */
4123 /* The last way-point is on the map */
4124 if (running && in_bounds(flow_y, flow_x))
4126 /* The way point is in sight - do not update. (Speedup) */
4127 if (cave[flow_y][flow_x].info & CAVE_VIEW) return;
4130 /* Erase all of the current flow information */
4131 for (y = 0; y < cur_hgt; y++)
4133 for (x = 0; x < cur_wid; x++)
4135 cave[y][x].cost = 0;
4136 cave[y][x].dist = 0;
4140 /* Save player position */
4144 /* Add the player's grid to the queue */
4148 /* Now process the queue */
4149 while (flow_head != flow_tail)
4153 /* Extract the next entry */
4154 ty = temp_y[flow_tail];
4155 tx = temp_x[flow_tail];
4157 /* Forget that entry */
4158 if (++flow_tail == TEMP_MAX) flow_tail = 0;
4160 /* Add the "children" */
4161 for (d = 0; d < 8; d++)
4163 int old_head = flow_head;
4164 int m = cave[ty][tx].cost + 1;
4165 int n = cave[ty][tx].dist + 1;
4168 /* Child location */
4169 y = ty + ddy_ddd[d];
4170 x = tx + ddx_ddd[d];
4172 /* Ignore player's grid */
4173 if (player_bold(y, x)) continue;
4175 c_ptr = &cave[y][x];
4177 if (is_closed_door(c_ptr->feat)) m += 3;
4179 /* Ignore "pre-stamped" entries */
4180 if (c_ptr->dist != 0 && c_ptr->dist <= n && c_ptr->cost <= m) continue;
4182 /* Ignore "walls" and "rubble" */
4183 if (!cave_have_flag_grid(c_ptr, FF_MOVE) && !is_closed_door(c_ptr->feat)) continue;
4185 /* Save the flow cost */
4186 if (c_ptr->cost == 0 || c_ptr->cost > m) c_ptr->cost = m;
4187 if (c_ptr->dist == 0 || c_ptr->dist > n) c_ptr->dist = n;
4189 /* Hack -- limit flow depth */
4190 if (n == MONSTER_FLOW_DEPTH) continue;
4192 /* Enqueue that entry */
4193 temp_y[flow_head] = y;
4194 temp_x[flow_head] = x;
4196 /* Advance the queue */
4197 if (++flow_head == TEMP_MAX) flow_head = 0;
4199 /* Hack -- notice overflow by forgetting new entry */
4200 if (flow_head == flow_tail) flow_head = old_head;
4206 static int scent_when = 0;
4209 * Characters leave scent trails for perceptive monsters to track.
4211 * Smell is rather more limited than sound. Many creatures cannot use
4212 * it at all, it doesn't extend very far outwards from the character's
4213 * current position, and monsters can use it to home in the character,
4214 * but not to run away from him.
4216 * Smell is valued according to age. When a character takes his turn,
4217 * scent is aged by one, and new scent of the current age is laid down.
4218 * Speedy characters leave more scent, true, but it also ages faster,
4219 * which makes it harder to hunt them down.
4221 * Whenever the age count loops, most of the scent trail is erased and
4222 * the age of the remainder is recalculated.
4224 void update_smell(void)
4229 /* Create a table that controls the spread of scent */
4230 const int scent_adjust[5][5] =
4239 /* Loop the age and adjust scent values when necessary */
4240 if (++scent_when == 254)
4242 /* Scan the entire dungeon */
4243 for (y = 0; y < cur_hgt; y++)
4245 for (x = 0; x < cur_wid; x++)
4247 int w = cave[y][x].when;
4248 cave[y][x].when = (w > 128) ? (w - 128) : 0;
4257 /* Lay down new scent */
4258 for (i = 0; i < 5; i++)
4260 for (j = 0; j < 5; j++)
4264 /* Translate table to map grids */
4269 if (!in_bounds(y, x)) continue;
4271 c_ptr = &cave[y][x];
4273 /* Walls, water, and lava cannot hold scent. */
4274 if (!cave_have_flag_grid(c_ptr, FF_MOVE) && !is_closed_door(c_ptr->feat)) continue;
4276 /* Grid must not be blocked by walls from the character */
4277 if (!player_has_los_bold(y, x)) continue;
4279 /* Note grids that are too far away */
4280 if (scent_adjust[i][j] == -1) continue;
4282 /* Mark the grid with new scent */
4283 c_ptr->when = scent_when + scent_adjust[i][j];
4290 * Hack -- map the current panel (plus some) ala "magic mapping"
4292 void map_area(int range)
4297 feature_type *f_ptr;
4299 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) range /= 3;
4301 /* Scan that area */
4302 for (y = 1; y < cur_hgt - 1; y++)
4304 for (x = 1; x < cur_wid - 1; x++)
4306 if (distance(py, px, y, x) > range) continue;
4308 c_ptr = &cave[y][x];
4310 /* Memorize terrain of the grid */
4311 c_ptr->info |= (CAVE_KNOWN);
4313 /* Feature code (applying "mimic" field) */
4314 feat = get_feat_mimic(c_ptr);
4315 f_ptr = &f_info[feat];
4317 /* All non-walls are "checked" */
4318 if (!have_flag(f_ptr->flags, FF_WALL))
4320 /* Memorize normal features */
4321 if (have_flag(f_ptr->flags, FF_REMEMBER))
4323 /* Memorize the object */
4324 c_ptr->info |= (CAVE_MARK);
4327 /* Memorize known walls */
4328 for (i = 0; i < 8; i++)
4330 c_ptr = &cave[y + ddy_ddd[i]][x + ddx_ddd[i]];
4332 /* Feature code (applying "mimic" field) */
4333 feat = get_feat_mimic(c_ptr);
4334 f_ptr = &f_info[feat];
4336 /* Memorize walls (etc) */
4337 if (have_flag(f_ptr->flags, FF_REMEMBER))
4339 /* Memorize the walls */
4340 c_ptr->info |= (CAVE_MARK);
4348 p_ptr->redraw |= (PR_MAP);
4351 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4357 * Light up the dungeon using "clairvoyance"
4359 * This function "illuminates" every grid in the dungeon, memorizes all
4360 * "objects", memorizes all grids as with magic mapping, and, under the
4361 * standard option settings (view_perma_grids but not view_torch_grids)
4362 * memorizes all floor grids too.
4364 * Note that if "view_perma_grids" is not set, we do not memorize floor
4365 * grids, since this would defeat the purpose of "view_perma_grids", not
4366 * that anyone seems to play without this option.
4368 * Note that if "view_torch_grids" is set, we do not memorize floor grids,
4369 * since this would prevent the use of "view_torch_grids" as a method to
4370 * keep track of what grids have been observed directly.
4372 void wiz_lite(bool ninja)
4376 feature_type *f_ptr;
4378 /* Memorize objects */
4379 for (i = 1; i < o_max; i++)
4381 object_type *o_ptr = &o_list[i];
4383 /* Skip dead objects */
4384 if (!o_ptr->k_idx) continue;
4386 /* Skip held objects */
4387 if (o_ptr->held_m_idx) continue;
4390 o_ptr->marked |= OM_FOUND;
4393 /* Scan all normal grids */
4394 for (y = 1; y < cur_hgt - 1; y++)
4396 /* Scan all normal grids */
4397 for (x = 1; x < cur_wid - 1; x++)
4399 cave_type *c_ptr = &cave[y][x];
4401 /* Memorize terrain of the grid */
4402 c_ptr->info |= (CAVE_KNOWN);
4404 /* Feature code (applying "mimic" field) */
4405 feat = get_feat_mimic(c_ptr);
4406 f_ptr = &f_info[feat];
4408 /* Process all non-walls */
4409 if (!have_flag(f_ptr->flags, FF_WALL))
4411 /* Scan all neighbors */
4412 for (i = 0; i < 9; i++)
4414 int yy = y + ddy_ddd[i];
4415 int xx = x + ddx_ddd[i];
4418 c_ptr = &cave[yy][xx];
4420 /* Feature code (applying "mimic" field) */
4421 f_ptr = &f_info[get_feat_mimic(c_ptr)];
4423 /* Perma-lite the grid */
4424 if (!(d_info[dungeon_type].flags1 & DF1_DARKNESS) && !ninja)
4426 c_ptr->info |= (CAVE_GLOW);
4429 /* Memorize normal features */
4430 if (have_flag(f_ptr->flags, FF_REMEMBER))
4432 /* Memorize the grid */
4433 c_ptr->info |= (CAVE_MARK);
4436 /* Perma-lit grids (newly and previously) */
4437 else if (c_ptr->info & CAVE_GLOW)
4439 /* Normally, memorize floors (see above) */
4440 if (view_perma_grids && !view_torch_grids)
4442 /* Memorize the grid */
4443 c_ptr->info |= (CAVE_MARK);
4451 /* Update the monsters */
4452 p_ptr->update |= (PU_MONSTERS);
4455 p_ptr->redraw |= (PR_MAP);
4458 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4460 if (p_ptr->special_defense & NINJA_S_STEALTH)
4462 if (cave[py][px].info & CAVE_GLOW) set_superstealth(FALSE);
4468 * Forget the dungeon map (ala "Thinking of Maud...").
4475 /* Forget every grid */
4476 for (y = 1; y < cur_hgt - 1; y++)
4478 for (x = 1; x < cur_wid - 1; x++)
4480 cave_type *c_ptr = &cave[y][x];
4482 /* Process the grid */
4483 c_ptr->info &= ~(CAVE_MARK | CAVE_IN_DETECT | CAVE_KNOWN);
4484 c_ptr->info |= (CAVE_UNSAFE);
4488 /* Forget every grid on horizontal edge */
4489 for (x = 0; x < cur_wid; x++)
4491 cave[0][x].info &= ~(CAVE_MARK);
4492 cave[cur_hgt - 1][x].info &= ~(CAVE_MARK);
4495 /* Forget every grid on vertical edge */
4496 for (y = 1; y < (cur_hgt - 1); y++)
4498 cave[y][0].info &= ~(CAVE_MARK);
4499 cave[y][cur_wid - 1].info &= ~(CAVE_MARK);
4502 /* Forget all objects */
4503 for (i = 1; i < o_max; i++)
4505 object_type *o_ptr = &o_list[i];
4507 /* Skip dead objects */
4508 if (!o_ptr->k_idx) continue;
4510 /* Skip held objects */
4511 if (o_ptr->held_m_idx) continue;
4513 /* Forget the object */
4514 o_ptr->marked &= OM_TOUCHED;
4517 /* Forget travel route when we have forgotten map */
4518 forget_travel_flow();
4520 /* Mega-Hack -- Forget the view and lite */
4521 p_ptr->update |= (PU_UN_VIEW | PU_UN_LITE);
4523 /* Update the view and lite */
4524 p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE);
4526 /* Update the monsters */
4527 p_ptr->update |= (PU_MONSTERS);
4530 p_ptr->redraw |= (PR_MAP);
4533 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4541 * Change the "feat" flag for a grid, and notice/redraw the grid
4543 void cave_set_feat(int y, int x, int feat)
4545 cave_type *c_ptr = &cave[y][x];
4546 feature_type *f_ptr = &f_info[feat];
4547 bool old_los, old_mirror;
4549 if (!character_dungeon)
4551 /* Clear mimic type */
4554 /* Change the feature */
4557 /* Hack -- glow the GLOW terrain */
4558 if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS))
4562 for (i = 0; i < 9; i++)
4564 yy = y + ddy_ddd[i];
4565 xx = x + ddx_ddd[i];
4566 if (!in_bounds2(yy, xx)) continue;
4567 cave[yy][xx].info |= CAVE_GLOW;
4574 old_los = cave_have_flag_bold(y, x, FF_LOS);
4575 old_mirror = is_mirror_grid(c_ptr);
4577 /* Clear mimic type */
4580 /* Change the feature */
4583 /* Remove flag for mirror/glyph */
4584 c_ptr->info &= ~(CAVE_OBJECT);
4586 if (old_mirror && (d_info[dungeon_type].flags1 & DF1_DARKNESS))
4588 c_ptr->info &= ~(CAVE_GLOW);
4589 if (!view_torch_grids) c_ptr->info &= ~(CAVE_MARK);
4591 update_local_illumination(y, x);
4594 /* Check for change to boring grid */
4595 if (!have_flag(f_ptr->flags, FF_REMEMBER)) c_ptr->info &= ~(CAVE_MARK);
4597 /* Update the monster */
4598 if (c_ptr->m_idx) update_mon(c_ptr->m_idx, FALSE);
4606 /* Check if los has changed */
4607 if (old_los ^ have_flag(f_ptr->flags, FF_LOS))
4610 #ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
4612 update_local_illumination(y, x);
4614 #endif /* COMPLEX_WALL_ILLUMINATION */
4616 /* Update the visuals */
4617 p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE | PU_MONSTERS);
4620 /* Hack -- glow the GLOW terrain */
4621 if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS))
4626 for (i = 0; i < 9; i++)
4628 yy = y + ddy_ddd[i];
4629 xx = x + ddx_ddd[i];
4630 if (!in_bounds2(yy, xx)) continue;
4631 cc_ptr = &cave[yy][xx];
4632 cc_ptr->info |= CAVE_GLOW;
4634 if (player_has_los_grid(cc_ptr))
4636 /* Update the monster */
4637 if (cc_ptr->m_idx) update_mon(cc_ptr->m_idx, FALSE);
4646 update_local_illumination(yy, xx);
4649 if (p_ptr->special_defense & NINJA_S_STEALTH)
4651 if (cave[py][px].info & CAVE_GLOW) set_superstealth(FALSE);
4657 int conv_dungeon_feat(int newfeat)
4659 feature_type *f_ptr = &f_info[newfeat];
4661 if (have_flag(f_ptr->flags, FF_CONVERT))
4663 switch (f_ptr->subtype)
4665 case CONVERT_TYPE_FLOOR:
4666 return floor_type[randint0(100)];
4667 case CONVERT_TYPE_WALL:
4668 return fill_type[randint0(100)];
4669 case CONVERT_TYPE_INNER:
4670 return feat_wall_inner;
4671 case CONVERT_TYPE_OUTER:
4672 return feat_wall_outer;
4673 case CONVERT_TYPE_SOLID:
4674 return feat_wall_solid;
4675 case CONVERT_TYPE_STREAM1:
4676 return d_info[dungeon_type].stream1;
4677 case CONVERT_TYPE_STREAM2:
4678 return d_info[dungeon_type].stream2;
4683 else return newfeat;
4688 * Take a feature, determine what that feature becomes
4689 * through applying the given action.
4691 int feat_state(int feat, int action)
4693 feature_type *f_ptr = &f_info[feat];
4696 /* Get the new feature */
4697 for (i = 0; i < MAX_FEAT_STATES; i++)
4699 if (f_ptr->state[i].action == action) return conv_dungeon_feat(f_ptr->state[i].result);
4702 if (have_flag(f_ptr->flags, FF_PERMANENT)) return feat;
4704 return (feature_action_flags[action] & FAF_DESTROY) ? conv_dungeon_feat(f_ptr->destroyed) : feat;
4708 * Takes a location and action and changes the feature at that
4709 * location through applying the given action.
4711 void cave_alter_feat(int y, int x, int action)
4713 /* Set old feature */
4714 int oldfeat = cave[y][x].feat;
4716 /* Get the new feat */
4717 int newfeat = feat_state(oldfeat, action);
4720 if (newfeat == oldfeat) return;
4722 /* Set the new feature */
4723 cave_set_feat(y, x, newfeat);
4725 if (!(feature_action_flags[action] & FAF_NO_DROP))
4727 feature_type *old_f_ptr = &f_info[oldfeat];
4728 feature_type *f_ptr = &f_info[newfeat];
4732 if (have_flag(old_f_ptr->flags, FF_HAS_GOLD) && !have_flag(f_ptr->flags, FF_HAS_GOLD))
4734 /* Place some gold */
4740 if (have_flag(old_f_ptr->flags, FF_HAS_ITEM) && !have_flag(f_ptr->flags, FF_HAS_ITEM) && (randint0(100) < (15 - dun_level / 2)))
4743 place_object(y, x, 0L);
4747 if (found && character_dungeon && player_can_see_bold(y, x))
4750 msg_print("²¿¤«¤òȯ¸«¤·¤¿¡ª");
4752 msg_print("You have found something!");
4757 if (feature_action_flags[action] & FAF_CRASH_GLASS)
4759 feature_type *old_f_ptr = &f_info[oldfeat];
4761 if (have_flag(old_f_ptr->flags, FF_GLASS) && character_dungeon)
4763 project(PROJECT_WHO_GLASS_SHARDS, 1, y, x, MIN(dun_level, 100) / 4, GF_SHARDS,
4764 (PROJECT_GRID | PROJECT_ITEM | PROJECT_KILL | PROJECT_HIDE | PROJECT_JUMP | PROJECT_NO_HANGEKI), -1);
4770 /* Remove a mirror */
4771 void remove_mirror(int y, int x)
4773 cave_type *c_ptr = &cave[y][x];
4775 /* Remove the mirror */
4776 c_ptr->info &= ~(CAVE_OBJECT);
4779 if (d_info[dungeon_type].flags1 & DF1_DARKNESS)
4781 c_ptr->info &= ~(CAVE_GLOW);
4782 if (!view_torch_grids) c_ptr->info &= ~(CAVE_MARK);
4784 /* Update the monster */
4785 if (c_ptr->m_idx) update_mon(c_ptr->m_idx, FALSE);
4787 update_local_illumination(y, x);
4799 * Return TRUE if there is a mirror on the grid.
4801 bool is_mirror_grid(cave_type *c_ptr)
4803 if ((c_ptr->info & CAVE_OBJECT) && have_flag(f_info[c_ptr->mimic].flags, FF_MIRROR))
4811 * Return TRUE if there is a mirror on the grid.
4813 bool is_glyph_grid(cave_type *c_ptr)
4815 if ((c_ptr->info & CAVE_OBJECT) && have_flag(f_info[c_ptr->mimic].flags, FF_GLYPH))
4823 * Return TRUE if there is a mirror on the grid.
4825 bool is_explosive_rune_grid(cave_type *c_ptr)
4827 if ((c_ptr->info & CAVE_OBJECT) && have_flag(f_info[c_ptr->mimic].flags, FF_MINOR_GLYPH))
4835 * Calculate "incremental motion". Used by project() and shoot().
4836 * Assumes that (*y,*x) lies on the path from (y1,x1) to (y2,x2).
4838 void mmove2(int *y, int *x, int y1, int x1, int y2, int x2)
4840 int dy, dx, dist, shift;
4842 /* Extract the distance travelled */
4843 dy = (*y < y1) ? y1 - *y : *y - y1;
4844 dx = (*x < x1) ? x1 - *x : *x - x1;
4846 /* Number of steps */
4847 dist = (dy > dx) ? dy : dx;
4849 /* We are calculating the next location */
4853 /* Calculate the total distance along each axis */
4854 dy = (y2 < y1) ? (y1 - y2) : (y2 - y1);
4855 dx = (x2 < x1) ? (x1 - x2) : (x2 - x1);
4857 /* Paranoia -- Hack -- no motion */
4858 if (!dy && !dx) return;
4861 /* Move mostly vertically */
4864 /* Extract a shift factor */
4865 shift = (dist * dx + (dy - 1) / 2) / dy;
4867 /* Sometimes move along the minor axis */
4868 (*x) = (x2 < x1) ? (x1 - shift) : (x1 + shift);
4870 /* Always move along major axis */
4871 (*y) = (y2 < y1) ? (y1 - dist) : (y1 + dist);
4874 /* Move mostly horizontally */
4877 /* Extract a shift factor */
4878 shift = (dist * dy + (dx - 1) / 2) / dx;
4880 /* Sometimes move along the minor axis */
4881 (*y) = (y2 < y1) ? (y1 - shift) : (y1 + shift);
4883 /* Always move along major axis */
4884 (*x) = (x2 < x1) ? (x1 - dist) : (x1 + dist);
4891 * Determine if a bolt spell cast from (y1,x1) to (y2,x2) will arrive
4892 * at the final destination, assuming no monster gets in the way.
4894 * This is slightly (but significantly) different from "los(y1,x1,y2,x2)".
4896 bool projectable(int y1, int x1, int y2, int x2)
4903 /* Check the projection path */
4904 grid_n = project_path(grid_g, (project_length ? project_length : MAX_RANGE), y1, x1, y2, x2, 0);
4906 /* Identical grid */
4907 if (!grid_n) return TRUE;
4910 y = GRID_Y(grid_g[grid_n - 1]);
4911 x = GRID_X(grid_g[grid_n - 1]);
4913 /* May not end in an unrequested grid */
4914 if ((y != y2) || (x != x2)) return (FALSE);
4922 * Standard "find me a location" function
4924 * Obtains a legal location within the given distance of the initial
4925 * location, and with "los()" from the source to destination location.
4927 * This function is often called from inside a loop which searches for
4928 * locations while increasing the "d" distance.
4930 * Currently the "m" parameter is unused.
4932 void scatter(int *yp, int *xp, int y, int x, int d, int m)
4939 /* Pick a location */
4942 /* Pick a new location */
4943 ny = rand_spread(y, d);
4944 nx = rand_spread(x, d);
4946 /* Ignore annoying locations */
4947 if (!in_bounds(ny, nx)) continue;
4949 /* Ignore "excessively distant" locations */
4950 if ((d > 1) && (distance(y, x, ny, nx) > d)) continue;
4952 /* Require "line of projection" */
4953 if (projectable(y, x, ny, nx)) break;
4956 /* Save the location */
4965 * Track a new monster
4967 void health_track(int m_idx)
4969 /* Mount monster is already tracked */
4970 if (m_idx && m_idx == p_ptr->riding) return;
4972 /* Track a new guy */
4973 p_ptr->health_who = m_idx;
4975 /* Redraw (later) */
4976 p_ptr->redraw |= (PR_HEALTH);
4982 * Hack -- track the given monster race
4984 void monster_race_track(int r_idx)
4986 /* Save this monster ID */
4987 p_ptr->monster_race_idx = r_idx;
4990 p_ptr->window |= (PW_MONSTER);
4996 * Hack -- track the given object kind
4998 void object_kind_track(int k_idx)
5000 /* Save this monster ID */
5001 p_ptr->object_kind_idx = k_idx;
5004 p_ptr->window |= (PW_OBJECT);
5010 * Something has happened to disturb the player.
5012 * The first arg indicates a major disturbance, which affects search.
5014 * The second arg is currently unused, but could induce output flush.
5016 * All disturbance cancels repeated commands, resting, and running.
5018 void disturb(int stop_search, int stop_travel)
5022 stop_travel = stop_travel;
5025 /* Cancel auto-commands */
5026 /* command_new = 0; */
5028 /* Cancel repeated commands */
5034 /* Redraw the state (later) */
5035 p_ptr->redraw |= (PR_STATE);
5038 /* Cancel Resting */
5039 if ((p_ptr->action == ACTION_REST) || (p_ptr->action == ACTION_FISH) || (stop_search && (p_ptr->action == ACTION_SEARCH)))
5042 set_action(ACTION_NONE);
5045 /* Cancel running */
5051 /* Check for new panel if appropriate */
5052 if (center_player && !center_running) verify_panel();
5054 /* Calculate torch radius */
5055 p_ptr->update |= (PU_TORCH);
5057 /* Update monster flow */
5058 p_ptr->update |= (PU_FLOW);
5067 /* Check for new panel if appropriate */
5068 if (center_player && !center_running) verify_panel();
5070 /* Calculate torch radius */
5071 p_ptr->update |= (PU_TORCH);
5075 /* Flush the input if requested */
5076 if (flush_disturb) flush();
5081 * Glow deep lava and building entrances in the floor
5083 void glow_deep_lava_and_bldg(void)
5085 int y, x, i, yy, xx;
5088 /* Not in the darkness dungeon */
5089 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) return;
5091 for (y = 0; y < cur_hgt; y++)
5093 for (x = 0; x < cur_wid; x++)
5095 c_ptr = &cave[y][x];
5097 /* Feature code (applying "mimic" field) */
5099 if (have_flag(f_info[get_feat_mimic(c_ptr)].flags, FF_GLOW))
5101 for (i = 0; i < 9; i++)
5103 yy = y + ddy_ddd[i];
5104 xx = x + ddx_ddd[i];
5105 if (!in_bounds2(yy, xx)) continue;
5106 cave[yy][xx].info |= CAVE_GLOW;
5112 /* Update the view and lite */
5113 p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE);
5116 p_ptr->redraw |= (PR_MAP);