3 * @brief ¥À¥ó¥¸¥ç¥ó¤Î´ðÁÃÉôʬ¼ÂÁõ(¼ç¤Ë¥Þ¥¹¤Î¼ÂÁõ) / low level dungeon routines -BEN-
6 * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke\n
8 * This software may be copied and distributed for educational, research,\n
9 * and not for profit purposes provided that this copyright and statement\n
10 * are included in all such copies. Other copyrights may also apply.\n
12 * Support for Adam Bolt's tileset, lighting and transparency effects\n
13 * by Robert Ruehlmann (rr9@angband.org)\n
15 * 2013 Deskull Doxygen¸þ¤±¤Î¥³¥á¥ó¥ÈÀ°Íý\n
21 static byte display_autopick; /*!< ¼«Æ°½¦¤¤¾õÂÖ¤ÎÀßÄê¥Õ¥é¥° */
22 static int match_autopick;
23 static object_type *autopick_obj; /*!< ³Æ¼ï¼«Æ°½¦¤¤½èÍý»þ¤Ë»È¤¦¥ª¥Ö¥¸¥§¥¯¥È¥Ý¥¤¥ó¥¿ */
24 static int feat_priority; /*!< ¥Þ¥Ã¥×½Ì¾®É½¼¨»þ¤Ëɽ¼¨¤¹¤Ù¤ÃÏ·Á¤ÎÍ¥ÀèÅÙ¤òÊݴɤ¹¤ë */
27 * @brief 2ÅÀ´Ö¤Îµ÷Î¥¤ò¥Ë¥å¡¼¥È¥ó¡¦¥é¥×¥½¥óË¡¤Ç»»½Ð¤¹¤ë / Distance between two points via Newton-Raphson technique
28 * @param y1 1ÅÀÌܤÎyºÂɸ
29 * @param x1 1ÅÀÌܤÎxºÂɸ
30 * @param y2 2ÅÀÌܤÎyºÂɸ
31 * @param x2 2ÅÀÌܤÎxºÂɸ
34 int distance (int y1, int x1, int y2, int x2)
36 int dy = (y1 > y2) ? (y1 - y2) : (y2 - y1);
37 int dx = (x1 > x2) ? (x1 - x2) : (x2 - x1);
39 /* Squared distance */
40 int target = (dy * dy) + (dx * dx);
42 /* Approximate distance: hypot(dy,dx) = max(dy,dx) + min(dy,dx) / 2 */
43 int d = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));
48 if (!dy || !dx) return d;
52 /* Approximate error */
53 err = (target - d * d) / (2 * d);
55 /* No error - we are done */
66 * @brief ÃÏ·Á¤¬æ«»ý¤Á¤Ç¤¢¤ë¤«¤ÎȽÄê¤ò¹Ô¤¦¡£ / Return TRUE if the given feature is a trap
67 * @param feat ÃÏ·Á¾ðÊó¤ÎID
68 * @return æ«»ý¤Á¤ÎÃÏ·Á¤Ê¤é¤ÐTRUE¤òÊÖ¤¹¡£
70 bool is_trap(int feat)
72 return have_flag(f_info[feat].flags, FF_TRAP);
77 * Return TRUE if the given grid is a known trap
79 bool is_known_trap(cave_type *c_ptr)
81 if (!c_ptr->mimic && !cave_have_flag_grid(c_ptr, FF_SECRET) &&
82 is_trap(c_ptr->feat)) return TRUE;
89 * Return TRUE if the given grid is a closed door
91 bool is_closed_door(int feat)
93 feature_type *f_ptr = &f_info[feat];
95 return (have_flag(f_ptr->flags, FF_OPEN) || have_flag(f_ptr->flags, FF_BASH)) &&
96 !have_flag(f_ptr->flags, FF_MOVE);
101 * Return TRUE if the given grid is a hidden closed door
103 bool is_hidden_door(cave_type *c_ptr)
105 if ((c_ptr->mimic || cave_have_flag_grid(c_ptr, FF_SECRET)) &&
106 is_closed_door(c_ptr->feat))
114 * A simple, fast, integer-based line-of-sight algorithm. By Joseph Hall,
115 * 4116 Brewster Drive, Raleigh NC 27606. Email to jnh@ecemwl.ncsu.edu.
117 * Returns TRUE if a line of sight can be traced from (x1,y1) to (x2,y2).
119 * The LOS begins at the center of the tile (x1,y1) and ends at the center of
120 * the tile (x2,y2). If los() is to return TRUE, all of the tiles this line
121 * passes through must be floor tiles, except for (x1,y1) and (x2,y2).
123 * We assume that the "mathematical corner" of a non-floor tile does not
124 * block line of sight.
126 * Because this function uses (short) ints for all calculations, overflow may
127 * occur if dx and dy exceed 90.
129 * Once all the degenerate cases are eliminated, the values "qx", "qy", and
130 * "m" are multiplied by a scale factor "f1 = abs(dx * dy * 2)", so that
131 * we can use integer arithmetic.
133 * We travel from start to finish along the longer axis, starting at the border
134 * between the first and second tiles, where the y offset = .5 * slope, taking
135 * into account the scale factor. See below.
137 * Also note that this function and the "move towards target" code do NOT
138 * share the same properties. Thus, you can see someone, target them, and
139 * then fire a bolt at them, but the bolt may hit a wall, not them. However,
140 * by clever choice of target locations, you can sometimes throw a "curve".
142 * Note that "line of sight" is not "reflexive" in all cases.
144 * Use the "projectable()" routine to test "spell/missile line of sight".
146 * Use the "update_view()" function to determine player line-of-sight.
148 bool los(int y1, int x1, int y2, int x2)
168 /* Slope, or 1/Slope, of LOS */
172 /* Extract the offset */
176 /* Extract the absolute offset */
181 /* Handle adjacent (or identical) grids */
182 if ((ax < 2) && (ay < 2)) return TRUE;
185 /* Paranoia -- require "safe" origin */
186 /* if (!in_bounds(y1, x1)) return FALSE; */
187 /* if (!in_bounds(y2, x2)) return FALSE; */
190 /* Directly South/North */
193 /* South -- check for walls */
196 for (ty = y1 + 1; ty < y2; ty++)
198 if (!cave_los_bold(ty, x1)) return FALSE;
202 /* North -- check for walls */
205 for (ty = y1 - 1; ty > y2; ty--)
207 if (!cave_los_bold(ty, x1)) return FALSE;
215 /* Directly East/West */
218 /* East -- check for walls */
221 for (tx = x1 + 1; tx < x2; tx++)
223 if (!cave_los_bold(y1, tx)) return FALSE;
227 /* West -- check for walls */
230 for (tx = x1 - 1; tx > x2; tx--)
232 if (!cave_los_bold(y1, tx)) return FALSE;
241 /* Extract some signs */
242 sx = (dx < 0) ? -1 : 1;
243 sy = (dy < 0) ? -1 : 1;
246 /* Vertical "knights" */
251 if (cave_los_bold(y1 + sy, x1)) return TRUE;
255 /* Horizontal "knights" */
260 if (cave_los_bold(y1, x1 + sx)) return TRUE;
265 /* Calculate scale factor div 2 */
268 /* Calculate scale factor */
272 /* Travel horizontally */
275 /* Let m = dy / dx * 2 * (dy * dx) = 2 * dy * dy */
281 /* Consider the special case where slope == 1. */
292 /* Note (below) the case (qy == f2), where */
293 /* the LOS exactly meets the corner of a tile. */
296 if (!cave_los_bold(ty, tx)) return FALSE;
307 if (!cave_los_bold(ty, tx)) return FALSE;
320 /* Travel vertically */
323 /* Let m = dx / dy * 2 * (dx * dy) = 2 * dx * dx */
339 /* Note (below) the case (qx == f2), where */
340 /* the LOS exactly meets the corner of a tile. */
343 if (!cave_los_bold(ty, tx)) return FALSE;
354 if (!cave_los_bold(ty, tx)) return FALSE;
376 #define COMPLEX_WALL_ILLUMINATION
379 * Check for "local" illumination
381 static bool check_local_illumination(int y, int x)
383 /* Hack -- move towards player */
384 int yy = (y < py) ? (y + 1) : (y > py) ? (y - 1) : y;
385 int xx = (x < px) ? (x + 1) : (x > px) ? (x - 1) : x;
387 /* Check for "local" illumination */
389 #ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
391 /* Check for "complex" illumination */
392 if ((feat_supports_los(get_feat_mimic(&cave[yy][xx])) &&
393 (cave[yy][xx].info & CAVE_GLOW)) ||
394 (feat_supports_los(get_feat_mimic(&cave[y][xx])) &&
395 (cave[y][xx].info & CAVE_GLOW)) ||
396 (feat_supports_los(get_feat_mimic(&cave[yy][x])) &&
397 (cave[yy][x].info & CAVE_GLOW)))
403 #else /* COMPLEX_WALL_ILLUMINATION */
405 /* Check for "simple" illumination */
406 return (cave[yy][xx].info & CAVE_GLOW) ? TRUE : FALSE;
408 #endif /* COMPLEX_WALL_ILLUMINATION */
412 #define update_local_illumination_aux(Y, X) \
414 if (player_has_los_bold((Y), (X))) \
416 /* Update the monster */ \
417 if (cave[(Y)][(X)].m_idx) update_mon(cave[(Y)][(X)].m_idx, FALSE); \
419 /* Notice and redraw */ \
420 note_spot((Y), (X)); \
421 lite_spot((Y), (X)); \
427 * Update "local" illumination
429 void update_local_illumination(int y, int x)
433 if (!in_bounds(y, x)) return;
435 #ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
437 if ((y != py) && (x != px))
439 yy = (y < py) ? (y - 1) : (y + 1);
440 xx = (x < px) ? (x - 1) : (x + 1);
441 update_local_illumination_aux(yy, xx);
442 update_local_illumination_aux(y, xx);
443 update_local_illumination_aux(yy, x);
445 else if (x != px) /* y == py */
447 xx = (x < px) ? (x - 1) : (x + 1);
448 for (i = -1; i <= 1; i++)
451 update_local_illumination_aux(yy, xx);
454 update_local_illumination_aux(yy, x);
456 update_local_illumination_aux(yy, x);
458 else if (y != py) /* x == px */
460 yy = (y < py) ? (y - 1) : (y + 1);
461 for (i = -1; i <= 1; i++)
464 update_local_illumination_aux(yy, xx);
467 update_local_illumination_aux(y, xx);
469 update_local_illumination_aux(y, xx);
471 else /* Player's grid */
473 for (i = 0; i < 8; i++)
477 update_local_illumination_aux(yy, xx);
481 #else /* COMPLEX_WALL_ILLUMINATION */
483 if ((y != py) && (x != px))
485 yy = (y < py) ? (y - 1) : (y + 1);
486 xx = (x < px) ? (x - 1) : (x + 1);
487 update_local_illumination_aux(yy, xx);
489 else if (x != px) /* y == py */
491 xx = (x < px) ? (x - 1) : (x + 1);
492 for (i = -1; i <= 1; i++)
495 update_local_illumination_aux(yy, xx);
498 else if (y != py) /* x == px */
500 yy = (y < py) ? (y - 1) : (y + 1);
501 for (i = -1; i <= 1; i++)
504 update_local_illumination_aux(yy, xx);
507 else /* Player's grid */
509 for (i = 0; i < 8; i++)
513 update_local_illumination_aux(yy, xx);
517 #endif /* COMPLEX_WALL_ILLUMINATION */
522 * Can the player "see" the given grid in detail?
524 * He must have vision, illumination, and line of sight.
526 * Note -- "CAVE_LITE" is only set if the "torch" has "los()".
527 * So, given "CAVE_LITE", we know that the grid is "fully visible".
529 * Note that "CAVE_GLOW" makes little sense for a wall, since it would mean
530 * that a wall is visible from any direction. That would be odd. Except
531 * under wizard light, which might make sense. Thus, for walls, we require
532 * not only that they be "CAVE_GLOW", but also, that they be adjacent to a
533 * grid which is not only "CAVE_GLOW", but which is a non-wall, and which is
534 * in line of sight of the player.
536 * This extra check is expensive, but it provides a more "correct" semantics.
538 * Note that we should not run this check on walls which are "outer walls" of
539 * the dungeon, or we will induce a memory fault, but actually verifying all
540 * of the locations would be extremely expensive.
542 * Thus, to speed up the function, we assume that all "perma-walls" which are
543 * "CAVE_GLOW" are "illuminated" from all sides. This is correct for all cases
544 * except "vaults" and the "buildings" in town. But the town is a hack anyway,
545 * and the player has more important things on his mind when he is attacking a
546 * monster vault. It is annoying, but an extremely important optimization.
548 * Note that "glowing walls" are only considered to be "illuminated" if the
549 * grid which is next to the wall in the direction of the player is also a
550 * "glowing" grid. This prevents the player from being able to "see" the
551 * walls of illuminated rooms from a corridor outside the room.
553 bool player_can_see_bold(int y, int x)
557 /* Blind players see nothing */
558 if (p_ptr->blind) return FALSE;
560 /* Access the cave grid */
563 /* Note that "torch-lite" yields "illumination" */
564 if (c_ptr->info & (CAVE_LITE | CAVE_MNLT)) return TRUE;
566 /* Require line of sight to the grid */
567 if (!player_has_los_bold(y, x)) return FALSE;
569 /* Noctovision of Ninja */
570 if (p_ptr->see_nocto) return TRUE;
572 /* Require "perma-lite" of the grid */
573 if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW) return FALSE;
575 /* Feature code (applying "mimic" field) */
576 /* Floors are simple */
577 if (feat_supports_los(get_feat_mimic(c_ptr))) return TRUE;
579 /* Check for "local" illumination */
580 return check_local_illumination(y, x);
586 * Returns true if the player's grid is dark
590 return (!player_can_see_bold(py, px));
597 * Determine if a given location may be "destroyed"
599 * Used by destruction spells, and for placing stairs, etc.
601 bool cave_valid_bold(int y, int x)
603 cave_type *c_ptr = &cave[y][x];
605 s16b this_o_idx, next_o_idx = 0;
608 /* Forbid perma-grids */
609 if (cave_perma_grid(c_ptr)) return (FALSE);
612 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
617 o_ptr = &o_list[this_o_idx];
619 /* Acquire next object */
620 next_o_idx = o_ptr->next_o_idx;
622 /* Forbid artifact grids */
623 if (object_is_artifact(o_ptr)) return (FALSE);
634 * Hack -- Legal monster codes
636 static char image_monster_hack[] = \
637 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
640 * Hack -- Legal object codes
642 static char image_object_hack[] = "?/|\\\"!$()_-=[]{},~";
645 * Mega-Hack -- Hallucinatory monster
647 static void image_monster(byte *ap, char *cp)
649 /* Random symbol from set above */
652 monster_race *r_ptr = &r_info[randint1(max_r_idx - 1)];
661 image_object_hack[randint0(sizeof(image_object_hack) - 1)] :
662 image_monster_hack[randint0(sizeof(image_monster_hack) - 1)]);
671 * Mega-Hack -- Hallucinatory object
673 static void image_object(byte *ap, char *cp)
677 object_kind *k_ptr = &k_info[randint1(max_k_idx-1)];
684 int n = sizeof(image_object_hack) - 1;
686 *cp = image_object_hack[randint0(n)];
696 * Hack -- Random hallucination
698 static void image_random(byte *ap, char *cp)
700 /* Normally, assume monsters */
701 if (randint0(100) < 75)
703 image_monster(ap, cp);
706 /* Otherwise, assume objects */
709 image_object(ap, cp);
714 * This array lists the effects of "brightness" on various "base" colours.
716 * This is used to do dynamic lighting effects in ascii :-)
717 * At the moment, only the various "floor" tiles are affected.
719 * The layout of the array is [x][0] = light and [x][1] = dark.
722 static byte lighting_colours[16][2] =
725 {TERM_L_DARK, TERM_DARK},
728 {TERM_YELLOW, TERM_SLATE},
731 {TERM_WHITE, TERM_L_DARK},
734 {TERM_L_UMBER, TERM_UMBER},
737 {TERM_RED, TERM_RED},
740 {TERM_L_GREEN, TERM_GREEN},
743 {TERM_BLUE, TERM_BLUE},
746 {TERM_L_UMBER, TERM_RED},
749 {TERM_SLATE, TERM_L_DARK},
752 {TERM_WHITE, TERM_SLATE},
755 {TERM_L_RED, TERM_BLUE},
758 {TERM_YELLOW, TERM_ORANGE},
761 {TERM_L_RED, TERM_L_RED},
764 {TERM_L_GREEN, TERM_GREEN},
767 {TERM_L_BLUE, TERM_L_BLUE},
770 {TERM_L_UMBER, TERM_UMBER}
775 * Apply "default" feature lighting effects
777 void apply_default_feat_lighting(byte f_attr[F_LIT_MAX], byte f_char[F_LIT_MAX])
779 byte s_attr = f_attr[F_LIT_STANDARD];
780 byte s_char = f_char[F_LIT_STANDARD];
783 if (is_ascii_graphics(s_attr)) /* For ASCII */
785 f_attr[F_LIT_LITE] = lighting_colours[s_attr & 0x0f][0];
786 f_attr[F_LIT_DARK] = lighting_colours[s_attr & 0x0f][1];
787 for (i = F_LIT_NS_BEGIN; i < F_LIT_MAX; i++) f_char[i] = s_char;
789 else /* For tile graphics */
791 for (i = F_LIT_NS_BEGIN; i < F_LIT_MAX; i++) f_attr[i] = s_attr;
792 f_char[F_LIT_LITE] = s_char + 2;
793 f_char[F_LIT_DARK] = s_char + 1;
798 /* Is this grid "darkened" by monster? */
799 #define darkened_grid(C) \
800 ((((C)->info & (CAVE_VIEW | CAVE_LITE | CAVE_MNLT | CAVE_MNDK)) == (CAVE_VIEW | CAVE_MNDK)) && \
805 * Extract the attr/char to display at the given (legal) map location
807 * Basically, we "paint" the chosen attr/char in several passes, starting
808 * with any known "terrain features" (defaulting to darkness), then adding
809 * any known "objects", and finally, adding any known "monsters". This
810 * is not the fastest method but since most of the calls to this function
811 * are made for grids with no monsters or objects, it is fast enough.
813 * Note that this function, if used on the grid containing the "player",
814 * will return the attr/char of the grid underneath the player, and not
815 * the actual player attr/char itself, allowing a lot of optimization
816 * in various "display" functions.
818 * Note that the "zero" entry in the feature/object/monster arrays are
819 * used to provide "special" attr/char codes, with "monster zero" being
820 * used for the player attr/char, "object zero" being used for the "stack"
821 * attr/char, and "feature zero" being used for the "nothing" attr/char,
822 * though this function makes use of only "feature zero".
824 * Note that monsters can have some "special" flags, including "ATTR_MULTI",
825 * which means their color changes, and "ATTR_CLEAR", which means they take
826 * the color of whatever is under them, and "CHAR_CLEAR", which means that
827 * they take the symbol of whatever is under them. Technically, the flag
828 * "CHAR_MULTI" is supposed to indicate that a monster looks strange when
829 * examined, but this flag is currently ignored.
831 * Currently, we do nothing with multi-hued objects, because there are
832 * not any. If there were, they would have to set "shimmer_objects"
833 * when they were created, and then new "shimmer" code in "dungeon.c"
834 * would have to be created handle the "shimmer" effect, and the code
835 * in "cave.c" would have to be updated to create the shimmer effect.
837 * Note the effects of hallucination. Objects always appear as random
838 * "objects", monsters as random "monsters", and normal grids occasionally
839 * appear as random "monsters" or "objects", but note that these random
840 * "monsters" and "objects" are really just "colored ascii symbols".
842 * Note that "floors" and "invisible traps" (and "zero" features) are
843 * drawn as "floors" using a special check for optimization purposes,
844 * and these are the only features which get drawn using the special
845 * lighting effects activated by "view_special_lite".
847 * Note the use of the "mimic" field in the "terrain feature" processing,
848 * which allows any feature to "pretend" to be another feature. This is
849 * used to "hide" secret doors, and to make all "doors" appear the same,
850 * and all "walls" appear the same, and "hidden" treasure stay hidden.
851 * It is possible to use this field to make a feature "look" like a floor,
852 * but the "special lighting effects" for floors will not be used.
854 * Note the use of the new "terrain feature" information. Note that the
855 * assumption that all interesting "objects" and "terrain features" are
856 * memorized allows extremely optimized processing below. Note the use
857 * of separate flags on objects to mark them as memorized allows a grid
858 * to have memorized "terrain" without granting knowledge of any object
859 * which may appear in that grid.
861 * Note the efficient code used to determine if a "floor" grid is
862 * "memorized" or "viewable" by the player, where the test for the
863 * grid being "viewable" is based on the facts that (1) the grid
864 * must be "lit" (torch-lit or perma-lit), (2) the grid must be in
865 * line of sight, and (3) the player must not be blind, and uses the
866 * assumption that all torch-lit grids are in line of sight.
868 * Note that floors (and invisible traps) are the only grids which are
869 * not memorized when seen, so only these grids need to check to see if
870 * the grid is "viewable" to the player (if it is not memorized). Since
871 * most non-memorized grids are in fact walls, this induces *massive*
872 * efficiency, at the cost of *forcing* the memorization of non-floor
873 * grids when they are first seen. Note that "invisible traps" are
874 * always treated exactly like "floors", which prevents "cheating".
876 * Note the "special lighting effects" which can be activated for floor
877 * grids using the "view_special_lite" option (for "white" floor grids),
878 * causing certain grids to be displayed using special colors. If the
879 * player is "blind", we will use "dark gray", else if the grid is lit
880 * by the torch, and the "view_yellow_lite" option is set, we will use
881 * "yellow", else if the grid is "dark", we will use "dark gray", else
882 * if the grid is not "viewable", and the "view_bright_lite" option is
883 * set, and the we will use "slate" (gray). We will use "white" for all
884 * other cases, in particular, for illuminated viewable floor grids.
886 * Note the "special lighting effects" which can be activated for wall
887 * grids using the "view_granite_lite" option (for "white" wall grids),
888 * causing certain grids to be displayed using special colors. If the
889 * player is "blind", we will use "dark gray", else if the grid is lit
890 * by the torch, and the "view_yellow_lite" option is set, we will use
891 * "yellow", else if the "view_bright_lite" option is set, and the grid
892 * is not "viewable", or is "dark", or is glowing, but not when viewed
893 * from the player's current location, we will use "slate" (gray). We
894 * will use "white" for all other cases, in particular, for correctly
895 * illuminated viewable wall grids.
897 * Note that, when "view_granite_lite" is set, we use an inline version
898 * of the "player_can_see_bold()" function to check the "viewability" of
899 * grids when the "view_bright_lite" option is set, and we do NOT use
900 * any special colors for "dark" wall grids, since this would allow the
901 * player to notice the walls of illuminated rooms from a hallway that
902 * happened to run beside the room. The alternative, by the way, would
903 * be to prevent the generation of hallways next to rooms, but this
904 * would still allow problems when digging towards a room.
906 * Note that bizarre things must be done when the "attr" and/or "char"
907 * codes have the "high-bit" set, since these values are used to encode
908 * various "special" pictures in some versions, and certain situations,
909 * such as "multi-hued" or "clear" monsters, cause the attr/char codes
910 * to be "scrambled" in various ways.
912 * Note that eventually we may use the "&" symbol for embedded treasure,
913 * and use the "*" symbol to indicate multiple objects, though this will
914 * have to wait for Angband 2.8.0 or later. Note that currently, this
915 * is not important, since only one object or terrain feature is allowed
916 * in each grid. If needed, "k_info[0]" will hold the "stack" attr/char.
918 * Note the assumption that doing "x_ptr = &x_info[x]" plus a few of
919 * "x_ptr->xxx", is quicker than "x_info[x].xxx", if this is incorrect
920 * then a whole lot of code should be changed... XXX XXX
922 void map_info(int y, int x, byte *ap, char *cp, byte *tap, char *tcp)
925 cave_type *c_ptr = &cave[y][x];
927 s16b this_o_idx, next_o_idx = 0;
929 /* Feature code (applying "mimic" field) */
930 s16b feat = get_feat_mimic(c_ptr);
933 feature_type *f_ptr = &f_info[feat];
938 /* Boring grids (floors, etc) */
939 if (!have_flag(f_ptr->flags, FF_REMEMBER))
942 * Handle Memorized or visible floor
944 * No visual when blinded.
945 * (to prevent strange effects on darkness breath)
947 * - Can see grids with CAVE_MARK.
948 * - Can see grids with CAVE_LITE or CAVE_MNLT.
949 * (Such grids also have CAVE_VIEW)
950 * - Can see grids with CAVE_VIEW unless darkened by monsters.
953 ((c_ptr->info & (CAVE_MARK | CAVE_LITE | CAVE_MNLT)) ||
954 ((c_ptr->info & CAVE_VIEW) && (((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) == CAVE_GLOW) || p_ptr->see_nocto))))
956 /* Normal attr/char */
957 a = f_ptr->x_attr[F_LIT_STANDARD];
958 c = f_ptr->x_char[F_LIT_STANDARD];
960 if (p_ptr->wild_mode)
962 /* Special lighting effects */
964 if (view_special_lite && !is_daytime())
966 /* Use a darkened colour/tile */
967 a = f_ptr->x_attr[F_LIT_DARK];
968 c = f_ptr->x_char[F_LIT_DARK];
972 /* Mega-Hack -- Handle "in-sight" and "darkened" grids */
973 else if (darkened_grid(c_ptr))
975 /* Unsafe cave grid -- idea borrowed from Unangband */
976 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
978 /* Access darkness */
979 f_ptr = &f_info[feat];
981 /* Char and attr of darkness */
982 a = f_ptr->x_attr[F_LIT_STANDARD];
983 c = f_ptr->x_char[F_LIT_STANDARD];
986 /* Special lighting effects */
987 else if (view_special_lite)
989 /* Handle "torch-lit" grids */
990 if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
993 if (view_yellow_lite)
995 /* Use a brightly lit colour/tile */
996 a = f_ptr->x_attr[F_LIT_LITE];
997 c = f_ptr->x_char[F_LIT_LITE];
1001 /* Handle "dark" grids */
1002 else if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW)
1004 /* Use a darkened colour/tile */
1005 a = f_ptr->x_attr[F_LIT_DARK];
1006 c = f_ptr->x_char[F_LIT_DARK];
1009 /* Handle "out-of-sight" grids */
1010 else if (!(c_ptr->info & CAVE_VIEW))
1013 if (view_bright_lite)
1015 /* Use a darkened colour/tile */
1016 a = f_ptr->x_attr[F_LIT_DARK];
1017 c = f_ptr->x_char[F_LIT_DARK];
1026 /* Unsafe cave grid -- idea borrowed from Unangband */
1027 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
1029 /* Access darkness */
1030 f_ptr = &f_info[feat];
1032 /* Normal attr/char */
1033 a = f_ptr->x_attr[F_LIT_STANDARD];
1034 c = f_ptr->x_char[F_LIT_STANDARD];
1038 /* Interesting grids (non-floors) */
1041 /* Memorized grids */
1042 if (c_ptr->info & CAVE_MARK)
1044 /* Normal attr/char */
1045 a = f_ptr->x_attr[F_LIT_STANDARD];
1046 c = f_ptr->x_char[F_LIT_STANDARD];
1048 if (p_ptr->wild_mode)
1050 /* Special lighting effects */
1051 /* Handle "blind" or "night" */
1052 if (view_granite_lite && (p_ptr->blind || !is_daytime()))
1054 /* Use a darkened colour/tile */
1055 a = f_ptr->x_attr[F_LIT_DARK];
1056 c = f_ptr->x_char[F_LIT_DARK];
1060 /* Mega-Hack -- Handle "in-sight" and "darkened" grids */
1061 else if (darkened_grid(c_ptr) && !p_ptr->blind)
1063 if (have_flag(f_ptr->flags, FF_LOS) && have_flag(f_ptr->flags, FF_PROJECT))
1065 /* Unsafe cave grid -- idea borrowed from Unangband */
1066 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
1068 /* Access darkness */
1069 f_ptr = &f_info[feat];
1071 /* Char and attr of darkness */
1072 a = f_ptr->x_attr[F_LIT_STANDARD];
1073 c = f_ptr->x_char[F_LIT_STANDARD];
1075 else if (view_granite_lite && view_bright_lite)
1077 /* Use a darkened colour/tile */
1078 a = f_ptr->x_attr[F_LIT_DARK];
1079 c = f_ptr->x_char[F_LIT_DARK];
1083 /* Special lighting effects */
1084 else if (view_granite_lite)
1086 /* Handle "blind" */
1089 /* Use a darkened colour/tile */
1090 a = f_ptr->x_attr[F_LIT_DARK];
1091 c = f_ptr->x_char[F_LIT_DARK];
1094 /* Handle "torch-lit" grids */
1095 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
1098 if (view_yellow_lite)
1100 /* Use a brightly lit colour/tile */
1101 a = f_ptr->x_attr[F_LIT_LITE];
1102 c = f_ptr->x_char[F_LIT_LITE];
1106 /* Handle "view_bright_lite" */
1107 else if (view_bright_lite)
1110 if (!(c_ptr->info & CAVE_VIEW))
1112 /* Use a darkened colour/tile */
1113 a = f_ptr->x_attr[F_LIT_DARK];
1114 c = f_ptr->x_char[F_LIT_DARK];
1118 else if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW)
1120 /* Use a darkened colour/tile */
1121 a = f_ptr->x_attr[F_LIT_DARK];
1122 c = f_ptr->x_char[F_LIT_DARK];
1125 /* Not glowing correctly */
1126 else if (!have_flag(f_ptr->flags, FF_LOS) && !check_local_illumination(y, x))
1128 /* Use a darkened colour/tile */
1129 a = f_ptr->x_attr[F_LIT_DARK];
1130 c = f_ptr->x_char[F_LIT_DARK];
1139 /* Unsafe cave grid -- idea borrowed from Unangband */
1140 feat = (view_unsafe_grids && (c_ptr->info & CAVE_UNSAFE)) ? feat_undetected : feat_none;
1142 /* Access feature */
1143 f_ptr = &f_info[feat];
1145 /* Normal attr/char */
1146 a = f_ptr->x_attr[F_LIT_STANDARD];
1147 c = f_ptr->x_char[F_LIT_STANDARD];
1151 if (feat_priority == -1) feat_priority = f_ptr->priority;
1153 /* Save the terrain info for the transparency effects */
1161 /* Hack -- rare random hallucination, except on outer dungeon walls */
1167 image_random(ap, cp);
1172 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1176 /* Acquire object */
1177 o_ptr = &o_list[this_o_idx];
1179 /* Acquire next object */
1180 next_o_idx = o_ptr->next_o_idx;
1182 /* Memorized objects */
1183 if (o_ptr->marked & OM_FOUND)
1185 if (display_autopick)
1189 match_autopick = is_autopick(o_ptr);
1190 if(match_autopick == -1)
1193 act = autopick_list[match_autopick].action;
1195 if ((act & DO_DISPLAY) && (act & display_autopick))
1197 autopick_obj = o_ptr;
1201 match_autopick = -1;
1206 (*cp) = object_char(o_ptr);
1209 (*ap) = object_attr(o_ptr);
1213 /* Hack -- hallucination */
1214 if (p_ptr->image) image_object(ap, cp);
1222 /* Handle monsters */
1223 if (c_ptr->m_idx && display_autopick == 0 )
1225 monster_type *m_ptr = &m_list[c_ptr->m_idx];
1227 /* Visible monster */
1230 monster_race *r_ptr = &r_info[m_ptr->ap_r_idx];
1238 * Monsters with both CHAR_CLEAR and ATTR_CLEAR
1239 * flags are always unseen.
1241 if ((r_ptr->flags1 & (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR)) == (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR))
1247 /* Hallucinatory monster */
1248 image_monster(ap, cp);
1253 /* Monster attr/char */
1257 /* Normal monsters */
1258 if (!(r_ptr->flags1 & (RF1_CHAR_CLEAR | RF1_SHAPECHANGER | RF1_ATTR_CLEAR
1259 | RF1_ATTR_MULTI | RF1_ATTR_SEMIRAND)))
1261 /* Desired monster attr/char */
1267 * Monsters with both CHAR_CLEAR and ATTR_CLEAR
1268 * flags are always unseen.
1270 else if ((r_ptr->flags1 & (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR)) == (RF1_CHAR_CLEAR | RF1_ATTR_CLEAR))
1277 /*** Monster's attr ***/
1278 if ((r_ptr->flags1 & RF1_ATTR_CLEAR) && (*ap != TERM_DARK) && !use_graphics)
1283 else if ((r_ptr->flags1 & RF1_ATTR_MULTI) && !use_graphics)
1285 /* Multi-hued attr */
1286 if (r_ptr->flags2 & RF2_ATTR_ANY) *ap = randint1(15);
1287 else switch (randint1(7))
1289 case 1: *ap = TERM_RED; break;
1290 case 2: *ap = TERM_L_RED; break;
1291 case 3: *ap = TERM_WHITE; break;
1292 case 4: *ap = TERM_L_GREEN; break;
1293 case 5: *ap = TERM_BLUE; break;
1294 case 6: *ap = TERM_L_DARK; break;
1295 case 7: *ap = TERM_GREEN; break;
1298 else if ((r_ptr->flags1 & RF1_ATTR_SEMIRAND) && !use_graphics)
1300 /* Use semi-random attr (usually mimics' colors vary) */
1301 *ap = c_ptr->m_idx % 15 + 1;
1309 /*** Monster's char ***/
1310 if ((r_ptr->flags1 & RF1_CHAR_CLEAR) && (*cp != ' ') && !use_graphics)
1315 else if (r_ptr->flags1 & RF1_SHAPECHANGER)
1319 monster_race *tmp_r_ptr = &r_info[randint1(max_r_idx - 1)];
1320 *cp = tmp_r_ptr->x_char;
1321 *ap = tmp_r_ptr->x_attr;
1325 *cp = (one_in_(25) ?
1326 image_object_hack[randint0(sizeof(image_object_hack) - 1)] :
1327 image_monster_hack[randint0(sizeof(image_monster_hack) - 1)]);
1340 /* Handle "player" */
1341 if (player_bold(y, x))
1343 monster_race *r_ptr = &r_info[0];
1345 /* Get the "player" attr */
1346 *ap = r_ptr->x_attr;
1348 /* Get the "player" char */
1349 *cp = r_ptr->x_char;
1357 * Calculate panel colum of a location in the map
1359 static int panel_col_of(int col)
1361 col -= panel_col_min;
1362 if (use_bigtile) col *= 2;
1368 * Moves the cursor to a given MAP (y,x) location
1370 void move_cursor_relative(int row, int col)
1372 /* Real co-ords convert to screen positions */
1373 row -= panel_row_prt;
1376 Term_gotoxy(panel_col_of(col), row);
1382 * Place an attr/char pair at the given map coordinate, if legal.
1384 void print_rel(char c, byte a, int y, int x)
1386 /* Only do "legal" locations */
1387 if (panel_contains(y, x))
1389 /* Hack -- fake monochrome */
1392 if (world_monster) a = TERM_DARK;
1393 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1394 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1397 /* Draw the char using the attr */
1398 Term_queue_bigchar(panel_col_of(x), y-panel_row_prt, a, c, 0, 0);
1407 * Memorize interesting viewable object/features in the given grid
1409 * This function should only be called on "legal" grids.
1411 * This function will memorize the object and/or feature in the given
1412 * grid, if they are (1) viewable and (2) interesting. Note that all
1413 * objects are interesting, all terrain features except floors (and
1414 * invisible traps) are interesting, and floors (and invisible traps)
1415 * are interesting sometimes (depending on various options involving
1416 * the illumination of floor grids).
1418 * The automatic memorization of all objects and non-floor terrain
1419 * features as soon as they are displayed allows incredible amounts
1420 * of optimization in various places, especially "map_info()".
1422 * Note that the memorization of objects is completely separate from
1423 * the memorization of terrain features, preventing annoying floor
1424 * memorization when a detected object is picked up from a dark floor,
1425 * and object memorization when an object is dropped into a floor grid
1426 * which is memorized but out-of-sight.
1428 * This function should be called every time the "memorization" of
1429 * a grid (or the object in a grid) is called into question, such
1430 * as when an object is created in a grid, when a terrain feature
1431 * "changes" from "floor" to "non-floor", when any grid becomes
1432 * "illuminated" or "viewable", and when a "floor" grid becomes
1435 * Note the relatively efficient use of this function by the various
1436 * "update_view()" and "update_lite()" calls, to allow objects and
1437 * terrain features to be memorized (and drawn) whenever they become
1438 * viewable or illuminated in any way, but not when they "maintain"
1439 * or "lose" their previous viewability or illumination.
1441 * Note the butchered "internal" version of "player_can_see_bold()",
1442 * optimized primarily for the most common cases, that is, for the
1443 * non-marked floor grids.
1445 void note_spot(int y, int x)
1447 cave_type *c_ptr = &cave[y][x];
1449 s16b this_o_idx, next_o_idx = 0;
1452 /* Blind players see nothing */
1453 if (p_ptr->blind) return;
1455 /* Analyze non-torch-lit grids */
1456 if (!(c_ptr->info & (CAVE_LITE | CAVE_MNLT)))
1458 /* Require line of sight to the grid */
1459 if (!(c_ptr->info & (CAVE_VIEW))) return;
1461 /* Require "perma-lite" of the grid */
1462 if ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) != CAVE_GLOW)
1465 if (!p_ptr->see_nocto) return;
1470 /* Hack -- memorize objects */
1471 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1473 object_type *o_ptr = &o_list[this_o_idx];
1475 /* Acquire next object */
1476 next_o_idx = o_ptr->next_o_idx;
1478 /* Memorize objects */
1479 o_ptr->marked |= OM_FOUND;
1483 /* Hack -- memorize grids */
1484 if (!(c_ptr->info & (CAVE_MARK)))
1486 /* Feature code (applying "mimic" field) */
1487 feature_type *f_ptr = &f_info[get_feat_mimic(c_ptr)];
1489 /* Memorize some "boring" grids */
1490 if (!have_flag(f_ptr->flags, FF_REMEMBER))
1492 /* Option -- memorize all torch-lit floors */
1493 if (view_torch_grids &&
1494 ((c_ptr->info & (CAVE_LITE | CAVE_MNLT)) || p_ptr->see_nocto))
1497 c_ptr->info |= (CAVE_MARK);
1500 /* Option -- memorize all perma-lit floors */
1501 else if (view_perma_grids && ((c_ptr->info & (CAVE_GLOW | CAVE_MNDK)) == CAVE_GLOW))
1504 c_ptr->info |= (CAVE_MARK);
1508 /* Memorize normal grids */
1509 else if (have_flag(f_ptr->flags, FF_LOS))
1512 c_ptr->info |= (CAVE_MARK);
1515 /* Memorize torch-lit walls */
1516 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
1519 c_ptr->info |= (CAVE_MARK);
1522 /* Memorize walls seen by noctovision of Ninja */
1523 else if (p_ptr->see_nocto)
1526 c_ptr->info |= (CAVE_MARK);
1529 /* Memorize certain non-torch-lit wall grids */
1530 else if (check_local_illumination(y, x))
1533 c_ptr->info |= (CAVE_MARK);
1537 /* Memorize terrain of the grid */
1538 c_ptr->info |= (CAVE_KNOWN);
1542 void display_dungeon(void)
1551 for (x = px - Term->wid / 2 + 1; x <= px + Term->wid / 2; x++)
1553 for (y = py - Term->hgt / 2 + 1; y <= py + Term->hgt / 2; y++)
1555 if (in_bounds2(y, x))
1558 /* Examine the grid */
1559 map_info(y, x, &a, &c, &ta, &tc);
1561 /* Hack -- fake monochrome */
1564 if (world_monster) a = TERM_DARK;
1565 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1566 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1569 /* Hack -- Queue it */
1570 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c, ta, tc);
1574 /* Clear out-of-bound tiles */
1576 /* Access darkness */
1577 feature_type *f_ptr = &f_info[feat_none];
1580 a = f_ptr->x_attr[F_LIT_STANDARD];
1583 c = f_ptr->x_char[F_LIT_STANDARD];
1585 /* Hack -- Queue it */
1586 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c, ta, tc);
1594 * Redraw (on the screen) a given MAP location
1596 * This function should only be called on "legal" grids
1598 void lite_spot(int y, int x)
1600 /* Redraw if on screen */
1601 if (panel_contains(y, x) && in_bounds2(y, x))
1609 /* Examine the grid */
1610 map_info(y, x, &a, &c, &ta, &tc);
1612 /* Hack -- fake monochrome */
1615 if (world_monster) a = TERM_DARK;
1616 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1617 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1620 /* Hack -- Queue it */
1621 Term_queue_bigchar(panel_col_of(x), y-panel_row_prt, a, c, ta, tc);
1623 /* Update sub-windows */
1624 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
1630 * Prints the map of the dungeon
1632 * Note that, for efficiency, we contain an "optimized" version
1633 * of both "lite_spot()" and "print_rel()", and that we use the
1634 * "lite_spot()" function to display the player grid, if needed.
1642 s16b xmin, xmax, ymin, ymax;
1647 Term_get_size(&wid, &hgt);
1649 /* Remove map offset */
1653 /* Access the cursor state */
1654 (void)Term_get_cursor(&v);
1656 /* Hide the cursor */
1657 (void)Term_set_cursor(0);
1660 xmin = (0 < panel_col_min) ? panel_col_min : 0;
1661 xmax = (cur_wid - 1 > panel_col_max) ? panel_col_max : cur_wid - 1;
1662 ymin = (0 < panel_row_min) ? panel_row_min : 0;
1663 ymax = (cur_hgt - 1 > panel_row_max) ? panel_row_max : cur_hgt - 1;
1665 /* Bottom section of screen */
1666 for (y = 1; y <= ymin - panel_row_prt; y++)
1668 /* Erase the section */
1669 Term_erase(COL_MAP, y, wid);
1672 /* Top section of screen */
1673 for (y = ymax - panel_row_prt; y <= hgt; y++)
1675 /* Erase the section */
1676 Term_erase(COL_MAP, y, wid);
1680 for (y = ymin; y <= ymax; y++)
1682 /* Scan the columns of row "y" */
1683 for (x = xmin; x <= xmax; x++)
1691 /* Determine what is there */
1692 map_info(y, x, &a, &c, &ta, &tc);
1694 /* Hack -- fake monochrome */
1697 if (world_monster) a = TERM_DARK;
1698 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1699 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1702 /* Efficiency -- Redraw that grid of the map */
1703 Term_queue_bigchar(panel_col_of(x), y-panel_row_prt, a, c, ta, tc);
1707 /* Display player */
1710 /* Restore the cursor */
1711 (void)Term_set_cursor(v);
1717 * print project path
1719 void prt_path(int y, int x)
1724 int default_color = TERM_SLATE;
1726 if (!display_path) return;
1727 if (-1 == project_length)
1730 /* Get projection path */
1731 path_n = project_path(path_g, (project_length ? project_length : MAX_RANGE), py, px, y, x, PROJECT_PATH|PROJECT_THRU);
1734 p_ptr->redraw |= (PR_MAP);
1740 for (i = 0; i < path_n; i++)
1742 int ny = GRID_Y(path_g[i]);
1743 int nx = GRID_X(path_g[i]);
1744 cave_type *c_ptr = &cave[ny][nx];
1746 if (panel_contains(ny, nx))
1748 byte a = default_color;
1754 if (c_ptr->m_idx && m_list[c_ptr->m_idx].ml)
1756 /* Determine what is there */
1757 map_info(ny, nx, &a, &c, &ta, &tc);
1759 if (!is_ascii_graphics(a))
1761 else if (c == '.' && (a == TERM_WHITE || a == TERM_L_WHITE))
1763 else if (a == default_color)
1769 if (world_monster) a = TERM_DARK;
1770 else if (IS_INVULN() || world_player) a = TERM_WHITE;
1771 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1776 /* Hack -- Queue it */
1777 Term_queue_bigchar(panel_col_of(nx), ny-panel_row_prt, a, c, ta, tc);
1781 if ((c_ptr->info & CAVE_MARK) && !cave_have_flag_grid(c_ptr, FF_PROJECT)) break;
1784 if (nx == x && ny == y) default_color = TERM_L_DARK;
1789 static cptr simplify_list[][2] =
1796 {"^Amulet of ", "\""},
1797 {"^Scroll of ", "?"},
1798 {"^Scroll titled ", "?"},
1799 {"^Wand of " , "-"},
1801 {"^Staff of " , "_"},
1802 {"^Potion of ", "!"},
1814 static void display_shortened_item_name(object_type *o_ptr, int y)
1821 object_desc(buf, o_ptr, (OD_NO_FLAVOR | OD_OMIT_PREFIX | OD_NAME_ONLY));
1822 attr = tval_to_attr[o_ptr->tval % 128];
1828 strcpy(buf, "²¿¤«´ñ̯¤Êʪ");
1830 strcpy(buf, "something strange");
1834 for (c = buf; *c; c++)
1837 for (i = 0; simplify_list[i][1]; i++)
1839 cptr org_w = simplify_list[i][0];
1849 if (!strncmp(c, org_w, strlen(org_w)))
1852 cptr tmp = simplify_list[i][1];
1855 tmp = c + strlen(org_w);
1865 /* Ⱦ³Ñ 12 ʸ»úʬ¤ÇÀÚ¤ë */
1871 if(len + 2 > 12) break;
1878 if(len + 1 > 12) break;
1884 Term_putstr(0, y, 12, attr, buf);
1888 * Display a "small-scale" map of the dungeon in the active Term
1890 void display_map(int *cy, int *cx)
1907 /* Save lighting effects */
1908 bool old_view_special_lite = view_special_lite;
1909 bool old_view_granite_lite = view_granite_lite;
1911 int hgt, wid, yrat, xrat;
1913 int **match_autopick_yx;
1914 object_type ***object_autopick_yx;
1917 Term_get_size(&wid, &hgt);
1920 if (use_bigtile) wid /= 2;
1922 yrat = (cur_hgt + hgt - 1) / hgt;
1923 xrat = (cur_wid + wid - 1) / wid;
1925 /* Disable lighting effects */
1926 view_special_lite = FALSE;
1927 view_granite_lite = FALSE;
1929 /* Allocate the maps */
1930 C_MAKE(ma, (hgt + 2), byte_ptr);
1931 C_MAKE(mc, (hgt + 2), char_ptr);
1932 C_MAKE(mp, (hgt + 2), byte_ptr);
1933 C_MAKE(match_autopick_yx, (hgt + 2), sint_ptr);
1934 C_MAKE(object_autopick_yx, (hgt + 2), object_type **);
1936 /* Allocate and wipe each line map */
1937 for (y = 0; y < (hgt + 2); y++)
1939 /* Allocate one row each array */
1940 C_MAKE(ma[y], (wid + 2), byte);
1941 C_MAKE(mc[y], (wid + 2), char);
1942 C_MAKE(mp[y], (wid + 2), byte);
1943 C_MAKE(match_autopick_yx[y], (wid + 2), int);
1944 C_MAKE(object_autopick_yx[y], (wid + 2), object_type *);
1946 for (x = 0; x < wid + 2; ++x)
1948 match_autopick_yx[y][x] = -1;
1949 object_autopick_yx[y][x] = NULL;
1952 ma[y][x] = TERM_WHITE;
1960 /* Allocate the maps */
1961 C_MAKE(bigma, (cur_hgt + 2), byte_ptr);
1962 C_MAKE(bigmc, (cur_hgt + 2), char_ptr);
1963 C_MAKE(bigmp, (cur_hgt + 2), byte_ptr);
1965 /* Allocate and wipe each line map */
1966 for (y = 0; y < (cur_hgt + 2); y++)
1968 /* Allocate one row each array */
1969 C_MAKE(bigma[y], (cur_wid + 2), byte);
1970 C_MAKE(bigmc[y], (cur_wid + 2), char);
1971 C_MAKE(bigmp[y], (cur_wid + 2), byte);
1973 for (x = 0; x < cur_wid + 2; ++x)
1976 bigma[y][x] = TERM_WHITE;
1984 /* Fill in the map */
1985 for (i = 0; i < cur_wid; ++i)
1987 for (j = 0; j < cur_hgt; ++j)
1997 /* Extract the current attr/char at that map location */
1998 map_info(j, i, &ta, &tc, &ta, &tc);
2000 /* Extract the priority */
2003 if(match_autopick!=-1
2004 && (match_autopick_yx[y][x] == -1
2005 || match_autopick_yx[y][x] > match_autopick))
2007 match_autopick_yx[y][x] = match_autopick;
2008 object_autopick_yx[y][x] = autopick_obj;
2012 /* Save the char, attr and priority */
2013 bigmc[j+1][i+1] = tc;
2014 bigma[j+1][i+1] = ta;
2015 bigmp[j+1][i+1] = tp;
2019 for (j = 0; j < cur_hgt; ++j)
2021 for (i = 0; i < cur_wid; ++i)
2027 tc = bigmc[j+1][i+1];
2028 ta = bigma[j+1][i+1];
2029 tp = bigmp[j+1][i+1];
2031 /* rare feature has more priority */
2037 for (t = 0; t < 8; t++)
2039 if (tc == bigmc[j+1+ddy_cdd[t]][i+1+ddx_cdd[t]] &&
2040 ta == bigma[j+1+ddy_cdd[t]][i+1+ddx_cdd[t]])
2050 /* Save the char, attr and priority */
2063 /* Draw the corners */
2064 mc[0][0] = mc[0][x] = mc[y][0] = mc[y][x] = '+';
2066 /* Draw the horizontal edges */
2067 for (x = 1; x <= wid; x++) mc[0][x] = mc[y][x] = '-';
2069 /* Draw the vertical edges */
2070 for (y = 1; y <= hgt; y++) mc[y][0] = mc[y][x] = '|';
2073 /* Display each map line in order */
2074 for (y = 0; y < hgt + 2; ++y)
2076 /* Start a new line */
2077 Term_gotoxy(COL_MAP, y);
2079 /* Display the line */
2080 for (x = 0; x < wid + 2; ++x)
2085 /* Hack -- fake monochrome */
2088 if (world_monster) ta = TERM_DARK;
2089 else if (IS_INVULN() || world_player) ta = TERM_WHITE;
2090 else if (p_ptr->wraith_form) ta = TERM_L_DARK;
2093 /* Add the character */
2094 Term_add_bigch(ta, tc);
2099 for (y = 1; y < hgt + 1; ++y)
2101 match_autopick = -1;
2102 for (x = 1; x <= wid; x++){
2103 if (match_autopick_yx[y][x] != -1 &&
2104 (match_autopick > match_autopick_yx[y][x] ||
2105 match_autopick == -1)){
2106 match_autopick = match_autopick_yx[y][x];
2107 autopick_obj = object_autopick_yx[y][x];
2111 /* Clear old display */
2112 Term_putstr(0, y, 12, 0, " ");
2114 if (match_autopick != -1)
2116 display_shortened_item_name(autopick_obj, y);
2119 char buf[13] = "\0";
2120 strncpy(buf,autopick_list[match_autopick].name,12);
2128 /* Player location */
2129 (*cy) = py / yrat + 1 + ROW_MAP;
2131 (*cx) = px / xrat + 1 + COL_MAP;
2133 (*cx) = (px / xrat + 1) * 2 + COL_MAP;
2135 /* Restore lighting effects */
2136 view_special_lite = old_view_special_lite;
2137 view_granite_lite = old_view_granite_lite;
2139 /* Free each line map */
2140 for (y = 0; y < (hgt + 2); y++)
2142 /* Free one row each array */
2143 C_KILL(ma[y], (wid + 2), byte);
2144 C_KILL(mc[y], (wid + 2), char);
2145 C_KILL(mp[y], (wid + 2), byte);
2146 C_KILL(match_autopick_yx[y], (wid + 2), int);
2147 C_KILL(object_autopick_yx[y], (wid + 2), object_type *);
2150 /* Free each line map */
2151 C_KILL(ma, (hgt + 2), byte_ptr);
2152 C_KILL(mc, (hgt + 2), char_ptr);
2153 C_KILL(mp, (hgt + 2), byte_ptr);
2154 C_KILL(match_autopick_yx, (hgt + 2), sint_ptr);
2155 C_KILL(object_autopick_yx, (hgt + 2), object_type **);
2157 /* Free each line map */
2158 for (y = 0; y < (cur_hgt + 2); y++)
2160 /* Free one row each array */
2161 C_KILL(bigma[y], (cur_wid + 2), byte);
2162 C_KILL(bigmc[y], (cur_wid + 2), char);
2163 C_KILL(bigmp[y], (cur_wid + 2), byte);
2166 /* Free each line map */
2167 C_KILL(bigma, (cur_hgt + 2), byte_ptr);
2168 C_KILL(bigmc, (cur_hgt + 2), char_ptr);
2169 C_KILL(bigmp, (cur_hgt + 2), byte_ptr);
2174 * Display a "small-scale" map of the dungeon for the player
2176 * Currently, the "player" is displayed on the map. XXX XXX XXX
2178 void do_cmd_view_map(void)
2183 /* Save the screen */
2188 prt("¤ªÂÔ¤Á²¼¤µ¤¤...", 0, 0);
2190 prt("Please wait...", 0, 0);
2196 /* Clear the screen */
2199 display_autopick = 0;
2201 /* Display the map */
2202 display_map(&cy, &cx);
2205 if(max_autopick && !p_ptr->wild_mode)
2207 display_autopick = ITEM_DISPLAY;
2214 int wid, hgt, row_message;
2216 Term_get_size(&wid, &hgt);
2217 row_message = hgt - 1;
2220 put_str("²¿¤«¥¡¼¤ò²¡¤·¤Æ¤¯¤À¤µ¤¤('M':½¦¤¦ 'N':ÊüÃÖ 'D':M+N 'K':²õ¤¹¥¢¥¤¥Æ¥à¤òɽ¼¨)", row_message, 1);
2222 put_str(" Hit M, N(for ~), K(for !), or D(same as M+N) to display auto-picker items.", row_message, 1);
2225 /* Hilite the player */
2226 move_cursor(cy, cx);
2231 flag = (DO_AUTOPICK | DO_QUERY_AUTOPICK);
2233 flag = DONT_AUTOPICK;
2235 flag = DO_AUTODESTROY;
2237 flag = (DO_AUTOPICK | DO_QUERY_AUTOPICK | DONT_AUTOPICK);
2243 if (~display_autopick & flag)
2244 display_autopick |= flag;
2246 display_autopick &= ~flag;
2247 /* Display the map */
2248 display_map(&cy, &cx);
2251 display_autopick = 0;
2257 put_str("²¿¤«¥¡¼¤ò²¡¤¹¤È¥²¡¼¥à¤ËÌá¤ê¤Þ¤¹", 23, 30);
2259 put_str("Hit any key to continue", 23, 30);
2260 #endif /* Hilite the player */
2261 move_cursor(cy, cx);
2266 /* Restore the screen */
2275 * Some comments on the cave grid flags. -BEN-
2278 * One of the major bottlenecks in previous versions of Angband was in
2279 * the calculation of "line of sight" from the player to various grids,
2280 * such as monsters. This was such a nasty bottleneck that a lot of
2281 * silly things were done to reduce the dependancy on "line of sight",
2282 * for example, you could not "see" any grids in a lit room until you
2283 * actually entered the room, and there were all kinds of bizarre grid
2284 * flags to enable this behavior. This is also why the "call light"
2285 * spells always lit an entire room.
2287 * The code below provides functions to calculate the "field of view"
2288 * for the player, which, once calculated, provides extremely fast
2289 * calculation of "line of sight from the player", and to calculate
2290 * the "field of torch lite", which, again, once calculated, provides
2291 * extremely fast calculation of "which grids are lit by the player's
2292 * lite source". In addition to marking grids as "GRID_VIEW" and/or
2293 * "GRID_LITE", as appropriate, these functions maintain an array for
2294 * each of these two flags, each array containing the locations of all
2295 * of the grids marked with the appropriate flag, which can be used to
2296 * very quickly scan through all of the grids in a given set.
2298 * To allow more "semantically valid" field of view semantics, whenever
2299 * the field of view (or the set of torch lit grids) changes, all of the
2300 * grids in the field of view (or the set of torch lit grids) are "drawn"
2301 * so that changes in the world will become apparent as soon as possible.
2302 * This has been optimized so that only grids which actually "change" are
2303 * redrawn, using the "temp" array and the "GRID_TEMP" flag to keep track
2304 * of the grids which are entering or leaving the relevent set of grids.
2306 * These new methods are so efficient that the old nasty code was removed.
2308 * Note that there is no reason to "update" the "viewable space" unless
2309 * the player "moves", or walls/doors are created/destroyed, and there
2310 * is no reason to "update" the "torch lit grids" unless the field of
2311 * view changes, or the "light radius" changes. This means that when
2312 * the player is resting, or digging, or doing anything that does not
2313 * involve movement or changing the state of the dungeon, there is no
2314 * need to update the "view" or the "lite" regions, which is nice.
2316 * Note that the calls to the nasty "los()" function have been reduced
2317 * to a bare minimum by the use of the new "field of view" calculations.
2319 * I wouldn't be surprised if slight modifications to the "update_view()"
2320 * function would allow us to determine "reverse line-of-sight" as well
2321 * as "normal line-of-sight", which would allow monsters to use a more
2322 * "correct" calculation to determine if they can "see" the player. For
2323 * now, monsters simply "cheat" somewhat and assume that if the player
2324 * has "line of sight" to the monster, then the monster can "pretend"
2325 * that it has "line of sight" to the player.
2328 * The "update_lite()" function maintains the "CAVE_LITE" flag for each
2329 * grid and maintains an array of all "CAVE_LITE" grids.
2331 * This set of grids is the complete set of all grids which are lit by
2332 * the players light source, which allows the "player_can_see_bold()"
2333 * function to work very quickly.
2335 * Note that every "CAVE_LITE" grid is also a "CAVE_VIEW" grid, and in
2336 * fact, the player (unless blind) can always "see" all grids which are
2337 * marked as "CAVE_LITE", unless they are "off screen".
2340 * The "update_view()" function maintains the "CAVE_VIEW" flag for each
2341 * grid and maintains an array of all "CAVE_VIEW" grids.
2343 * This set of grids is the complete set of all grids within line of sight
2344 * of the player, allowing the "player_has_los_bold()" macro to work very
2348 * The current "update_view()" algorithm uses the "CAVE_XTRA" flag as a
2349 * temporary internal flag to mark those grids which are not only in view,
2350 * but which are also "easily" in line of sight of the player. This flag
2351 * is always cleared when we are done.
2354 * The current "update_lite()" and "update_view()" algorithms use the
2355 * "CAVE_TEMP" flag, and the array of grids which are marked as "CAVE_TEMP",
2356 * to keep track of which grids were previously marked as "CAVE_LITE" or
2357 * "CAVE_VIEW", which allows us to optimize the "screen updates".
2359 * The "CAVE_TEMP" flag, and the array of "CAVE_TEMP" grids, is also used
2360 * for various other purposes, such as spreading lite or darkness during
2361 * "lite_room()" / "unlite_room()", and for calculating monster flow.
2364 * Any grid can be marked as "CAVE_GLOW" which means that the grid itself is
2365 * in some way permanently lit. However, for the player to "see" anything
2366 * in the grid, as determined by "player_can_see()", the player must not be
2367 * blind, the grid must be marked as "CAVE_VIEW", and, in addition, "wall"
2368 * grids, even if marked as "perma lit", are only illuminated if they touch
2369 * a grid which is not a wall and is marked both "CAVE_GLOW" and "CAVE_VIEW".
2372 * To simplify various things, a grid may be marked as "CAVE_MARK", meaning
2373 * that even if the player cannot "see" the grid, he "knows" the terrain in
2374 * that grid. This is used to "remember" walls/doors/stairs/floors when they
2375 * are "seen" or "detected", and also to "memorize" floors, after "wiz_lite()",
2376 * or when one of the "memorize floor grids" options induces memorization.
2378 * Objects are "memorized" in a different way, using a special "marked" flag
2379 * on the object itself, which is set when an object is observed or detected.
2382 * A grid may be marked as "CAVE_ROOM" which means that it is part of a "room",
2383 * and should be illuminated by "lite room" and "darkness" spells.
2386 * A grid may be marked as "CAVE_ICKY" which means it is part of a "vault",
2387 * and should be unavailable for "teleportation" destinations.
2390 * The "view_perma_grids" allows the player to "memorize" every perma-lit grid
2391 * which is observed, and the "view_torch_grids" allows the player to memorize
2392 * every torch-lit grid. The player will always memorize important walls,
2393 * doors, stairs, and other terrain features, as well as any "detected" grids.
2395 * Note that the new "update_view()" method allows, among other things, a room
2396 * to be "partially" seen as the player approaches it, with a growing cone of
2397 * floor appearing as the player gets closer to the door. Also, by not turning
2398 * on the "memorize perma-lit grids" option, the player will only "see" those
2399 * floor grids which are actually in line of sight.
2401 * And my favorite "plus" is that you can now use a special option to draw the
2402 * "floors" in the "viewable region" brightly (actually, to draw the *other*
2403 * grids dimly), providing a "pretty" effect as the player runs around, and
2404 * to efficiently display the "torch lite" in a special color.
2407 * Some comments on the "update_view()" algorithm...
2409 * The algorithm is very fast, since it spreads "obvious" grids very quickly,
2410 * and only has to call "los()" on the borderline cases. The major axes/diags
2411 * even terminate early when they hit walls. I need to find a quick way
2412 * to "terminate" the other scans.
2414 * Note that in the worst case (a big empty area with say 5% scattered walls),
2415 * each of the 1500 or so nearby grids is checked once, most of them getting
2416 * an "instant" rating, and only a small portion requiring a call to "los()".
2418 * The only time that the algorithm appears to be "noticeably" too slow is
2419 * when running, and this is usually only important in town, since the town
2420 * provides about the worst scenario possible, with large open regions and
2421 * a few scattered obstructions. There is a special "efficiency" option to
2422 * allow the player to reduce his field of view in town, if needed.
2424 * In the "best" case (say, a normal stretch of corridor), the algorithm
2425 * makes one check for each viewable grid, and makes no calls to "los()".
2426 * So running in corridors is very fast, and if a lot of monsters are
2427 * nearby, it is much faster than the old methods.
2429 * Note that resting, most normal commands, and several forms of running,
2430 * plus all commands executed near large groups of monsters, are strictly
2431 * more efficient with "update_view()" that with the old "compute los() on
2432 * demand" method, primarily because once the "field of view" has been
2433 * calculated, it does not have to be recalculated until the player moves
2434 * (or a wall or door is created or destroyed).
2436 * Note that we no longer have to do as many "los()" checks, since once the
2437 * "view" region has been built, very few things cause it to be "changed"
2438 * (player movement, and the opening/closing of doors, changes in wall status).
2439 * Note that door/wall changes are only relevant when the door/wall itself is
2440 * in the "view" region.
2442 * The algorithm seems to only call "los()" from zero to ten times, usually
2443 * only when coming down a corridor into a room, or standing in a room, just
2444 * misaligned with a corridor. So if, say, there are five "nearby" monsters,
2445 * we will be reducing the calls to "los()".
2447 * I am thinking in terms of an algorithm that "walks" from the central point
2448 * out to the maximal "distance", at each point, determining the "view" code
2449 * (above). For each grid not on a major axis or diagonal, the "view" code
2450 * depends on the "cave_los_bold()" and "view" of exactly two other grids
2451 * (the one along the nearest diagonal, and the one next to that one, see
2452 * "update_view_aux()"...).
2454 * We "memorize" the viewable space array, so that at the cost of under 3000
2455 * bytes, we reduce the time taken by "forget_view()" to one assignment for
2456 * each grid actually in the "viewable space". And for another 3000 bytes,
2457 * we prevent "erase + redraw" ineffiencies via the "seen" set. These bytes
2458 * are also used by other routines, thus reducing the cost to almost nothing.
2460 * A similar thing is done for "forget_lite()" in which case the savings are
2461 * much less, but save us from doing bizarre maintenance checking.
2463 * In the worst "normal" case (in the middle of the town), the reachable space
2464 * actually reaches to more than half of the largest possible "circle" of view,
2465 * or about 800 grids, and in the worse case (in the middle of a dungeon level
2466 * where all the walls have been removed), the reachable space actually reaches
2467 * the theoretical maximum size of just under 1500 grids.
2469 * Each grid G examines the "state" of two (?) other (adjacent) grids, G1 & G2.
2470 * If G1 is lite, G is lite. Else if G2 is lite, G is half. Else if G1 and G2
2471 * are both half, G is half. Else G is dark. It only takes 2 (or 4) bits to
2472 * "name" a grid, so (for MAX_RAD of 20) we could use 1600 bytes, and scan the
2473 * entire possible space (including initialization) in one step per grid. If
2474 * we do the "clearing" as a separate step (and use an array of "view" grids),
2475 * then the clearing will take as many steps as grids that were viewed, and the
2476 * algorithm will be able to "stop" scanning at various points.
2477 * Oh, and outside of the "torch radius", only "lite" grids need to be scanned.
2488 * Actually erase the entire "lite" array, redrawing every grid
2490 void forget_lite(void)
2494 /* None to forget */
2495 if (!lite_n) return;
2497 /* Clear them all */
2498 for (i = 0; i < lite_n; i++)
2503 /* Forget "LITE" flag */
2504 cave[y][x].info &= ~(CAVE_LITE);
2507 /* lite_spot(y, x); Perhaps don't need? */
2516 * For delayed visual update
2518 #define cave_note_and_redraw_later(C,Y,X) \
2520 (C)->info |= CAVE_NOTE; \
2521 cave_redraw_later((C), (Y), (X)); \
2526 * For delayed visual update
2528 #define cave_redraw_later(C,Y,X) \
2530 if (!((C)->info & CAVE_REDRAW)) \
2532 (C)->info |= CAVE_REDRAW; \
2533 redraw_y[redraw_n] = (Y); \
2534 redraw_x[redraw_n++] = (X); \
2542 * This macro allows us to efficiently add a grid to the "lite" array,
2543 * note that we are never called for illegal grids, or for grids which
2544 * have already been placed into the "lite" array, and we are never
2545 * called when the "lite" array is full.
2547 #define cave_lite_hack(Y,X) \
2549 if (!(cave[Y][X].info & (CAVE_LITE))) \
2551 cave[Y][X].info |= (CAVE_LITE); \
2552 lite_y[lite_n] = (Y); \
2553 lite_x[lite_n++] = (X); \
2559 * Update the set of grids "illuminated" by the player's lite.
2561 * This routine needs to use the results of "update_view()"
2563 * Note that "blindness" does NOT affect "torch lite". Be careful!
2565 * We optimize most lites (all non-artifact lites) by using "obvious"
2566 * facts about the results of "small" lite radius, and we attempt to
2567 * list the "nearby" grids before the more "distant" ones in the
2568 * array of torch-lit grids.
2570 * We assume that "radius zero" lite is in fact no lite at all.
2572 * Torch Lantern Artifacts
2582 void update_lite(void)
2584 int i, x, y, min_x, max_x, min_y, max_y;
2585 int p = p_ptr->cur_lite;
2588 /*** Special case ***/
2591 /* Hack -- Player has no lite */
2594 /* Forget the old lite */
2595 /* forget_lite(); Perhaps don't need? */
2597 /* Add it to later visual update */
2598 cave_redraw_later(&cave[py][px], py, px);
2602 /*** Save the old "lite" grids for later ***/
2604 /* Clear them all */
2605 for (i = 0; i < lite_n; i++)
2610 /* Mark the grid as not "lite" */
2611 cave[y][x].info &= ~(CAVE_LITE);
2613 /* Mark the grid as "seen" */
2614 cave[y][x].info |= (CAVE_TEMP);
2616 /* Add it to the "seen" set */
2626 /*** Collect the new "lite" grids ***/
2628 /* Radius 1 -- torch radius */
2632 cave_lite_hack(py, px);
2635 cave_lite_hack(py+1, px);
2636 cave_lite_hack(py-1, px);
2637 cave_lite_hack(py, px+1);
2638 cave_lite_hack(py, px-1);
2640 /* Diagonal grids */
2641 cave_lite_hack(py+1, px+1);
2642 cave_lite_hack(py+1, px-1);
2643 cave_lite_hack(py-1, px+1);
2644 cave_lite_hack(py-1, px-1);
2647 /* Radius 2 -- lantern radius */
2650 /* South of the player */
2651 if (cave_los_bold(py + 1, px))
2653 cave_lite_hack(py+2, px);
2654 cave_lite_hack(py+2, px+1);
2655 cave_lite_hack(py+2, px-1);
2658 /* North of the player */
2659 if (cave_los_bold(py - 1, px))
2661 cave_lite_hack(py-2, px);
2662 cave_lite_hack(py-2, px+1);
2663 cave_lite_hack(py-2, px-1);
2666 /* East of the player */
2667 if (cave_los_bold(py, px + 1))
2669 cave_lite_hack(py, px+2);
2670 cave_lite_hack(py+1, px+2);
2671 cave_lite_hack(py-1, px+2);
2674 /* West of the player */
2675 if (cave_los_bold(py, px - 1))
2677 cave_lite_hack(py, px-2);
2678 cave_lite_hack(py+1, px-2);
2679 cave_lite_hack(py-1, px-2);
2683 /* Radius 3+ -- artifact radius */
2688 /* Paranoia -- see "LITE_MAX" */
2691 /* South-East of the player */
2692 if (cave_los_bold(py + 1, px + 1))
2694 cave_lite_hack(py+2, px+2);
2697 /* South-West of the player */
2698 if (cave_los_bold(py + 1, px - 1))
2700 cave_lite_hack(py+2, px-2);
2703 /* North-East of the player */
2704 if (cave_los_bold(py - 1, px + 1))
2706 cave_lite_hack(py-2, px+2);
2709 /* North-West of the player */
2710 if (cave_los_bold(py - 1, px - 1))
2712 cave_lite_hack(py-2, px-2);
2717 if (min_y < 0) min_y = 0;
2721 if (max_y > cur_hgt-1) max_y = cur_hgt-1;
2725 if (min_x < 0) min_x = 0;
2729 if (max_x > cur_wid-1) max_x = cur_wid-1;
2731 /* Scan the maximal box */
2732 for (y = min_y; y <= max_y; y++)
2734 for (x = min_x; x <= max_x; x++)
2736 int dy = (py > y) ? (py - y) : (y - py);
2737 int dx = (px > x) ? (px - x) : (x - px);
2739 /* Skip the "central" grids (above) */
2740 if ((dy <= 2) && (dx <= 2)) continue;
2742 /* Hack -- approximate the distance */
2743 d = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));
2745 /* Skip distant grids */
2746 if (d > p) continue;
2748 /* Viewable, nearby, grids get "torch lit" */
2749 if (cave[y][x].info & CAVE_VIEW)
2751 /* This grid is "torch lit" */
2752 cave_lite_hack(y, x);
2759 /*** Complete the algorithm ***/
2761 /* Draw the new grids */
2762 for (i = 0; i < lite_n; i++)
2767 c_ptr = &cave[y][x];
2769 /* Update fresh grids */
2770 if (c_ptr->info & (CAVE_TEMP)) continue;
2772 /* Add it to later visual update */
2773 cave_note_and_redraw_later(c_ptr, y, x);
2776 /* Clear them all */
2777 for (i = 0; i < temp_n; i++)
2782 c_ptr = &cave[y][x];
2784 /* No longer in the array */
2785 c_ptr->info &= ~(CAVE_TEMP);
2787 /* Update stale grids */
2788 if (c_ptr->info & (CAVE_LITE)) continue;
2790 /* Add it to later visual update */
2791 cave_redraw_later(c_ptr, y, x);
2797 /* Mega-Hack -- Visual update later */
2798 p_ptr->update |= (PU_DELAY_VIS);
2802 static bool mon_invis;
2803 static s16b mon_fy, mon_fx;
2806 * Add a square to the changes array
2808 static void mon_lite_hack(int y, int x)
2811 int midpoint, dpf, d;
2813 /* We trust this grid is in bounds */
2814 /* if (!in_bounds2(y, x)) return; */
2816 c_ptr = &cave[y][x];
2818 /* Want a unlit square in view of the player */
2819 if ((c_ptr->info & (CAVE_MNLT | CAVE_VIEW)) != CAVE_VIEW) return;
2821 if (!cave_los_grid(c_ptr))
2823 /* Hack -- Prevent monster lite leakage in walls */
2825 /* Horizontal walls between player and a monster */
2826 if (((y < py) && (y > mon_fy)) || ((y > py) && (y < mon_fy)))
2830 midpoint = mon_fx + ((px - mon_fx) * ABS(d)) / ABS(dpf);
2832 /* Only first wall viewed from mid-x is lit */
2835 if (!cave_los_bold(y, x + 1)) return;
2837 else if (x > midpoint)
2839 if (!cave_los_bold(y, x - 1)) return;
2842 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2843 else if (mon_invis) return;
2846 /* Vertical walls between player and a monster */
2847 if (((x < px) && (x > mon_fx)) || ((x > px) && (x < mon_fx)))
2851 midpoint = mon_fy + ((py - mon_fy) * ABS(d)) / ABS(dpf);
2853 /* Only first wall viewed from mid-y is lit */
2856 if (!cave_los_bold(y + 1, x)) return;
2858 else if (y > midpoint)
2860 if (!cave_los_bold(y - 1, x)) return;
2863 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2864 else if (mon_invis) return;
2868 /* We trust temp_n does not exceed TEMP_MAX */
2871 if (!(c_ptr->info & CAVE_MNDK))
2873 /* Save this square */
2882 /* No longer dark */
2883 c_ptr->info &= ~(CAVE_MNDK);
2887 c_ptr->info |= CAVE_MNLT;
2892 * Add a square to the changes array
2894 static void mon_dark_hack(int y, int x)
2897 int midpoint, dpf, d;
2899 /* We trust this grid is in bounds */
2900 /* if (!in_bounds2(y, x)) return; */
2902 c_ptr = &cave[y][x];
2904 /* Want a unlit and undarkened square in view of the player */
2905 if ((c_ptr->info & (CAVE_LITE | CAVE_MNLT | CAVE_MNDK | CAVE_VIEW)) != CAVE_VIEW) return;
2907 if (!cave_los_grid(c_ptr) && !cave_have_flag_grid(c_ptr, FF_PROJECT))
2909 /* Hack -- Prevent monster dark lite leakage in walls */
2911 /* Horizontal walls between player and a monster */
2912 if (((y < py) && (y > mon_fy)) || ((y > py) && (y < mon_fy)))
2916 midpoint = mon_fx + ((px - mon_fx) * ABS(d)) / ABS(dpf);
2918 /* Only first wall viewed from mid-x is lit */
2921 if (!cave_los_bold(y, x + 1) && !cave_have_flag_bold(y, x + 1, FF_PROJECT)) return;
2923 else if (x > midpoint)
2925 if (!cave_los_bold(y, x - 1) && !cave_have_flag_bold(y, x - 1, FF_PROJECT)) return;
2928 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2929 else if (mon_invis) return;
2932 /* Vertical walls between player and a monster */
2933 if (((x < px) && (x > mon_fx)) || ((x > px) && (x < mon_fx)))
2937 midpoint = mon_fy + ((py - mon_fy) * ABS(d)) / ABS(dpf);
2939 /* Only first wall viewed from mid-y is lit */
2942 if (!cave_los_bold(y + 1, x) && !cave_have_flag_bold(y + 1, x, FF_PROJECT)) return;
2944 else if (y > midpoint)
2946 if (!cave_los_bold(y - 1, x) && !cave_have_flag_bold(y - 1, x, FF_PROJECT)) return;
2949 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
2950 else if (mon_invis) return;
2954 /* We trust temp_n does not exceed TEMP_MAX */
2956 /* Save this square */
2962 c_ptr->info |= CAVE_MNDK;
2967 * Update squares illuminated or darkened by monsters.
2969 * Hack - use the CAVE_ROOM flag (renamed to be CAVE_MNLT) to
2970 * denote squares illuminated by monsters.
2972 * The CAVE_TEMP and CAVE_XTRA flag are used to store the state during the
2973 * updating. Only squares in view of the player, whos state
2974 * changes are drawn via lite_spot().
2976 void update_mon_lite(void)
2982 void (*add_mon_lite)(int, int);
2987 /* Non-Ninja player in the darkness */
2988 int dis_lim = ((d_info[dungeon_type].flags1 & DF1_DARKNESS) && !p_ptr->see_nocto) ?
2989 (MAX_SIGHT / 2 + 1) : (MAX_SIGHT + 3);
2991 /* Clear all monster lit squares */
2992 for (i = 0; i < mon_lite_n; i++)
2995 c_ptr = &cave[mon_lite_y[i]][mon_lite_x[i]];
2997 /* Set temp or xtra flag */
2998 c_ptr->info |= (c_ptr->info & CAVE_MNLT) ? CAVE_TEMP : CAVE_XTRA;
3000 /* Clear monster illumination flag */
3001 c_ptr->info &= ~(CAVE_MNLT | CAVE_MNDK);
3004 /* Empty temp list of new squares to lite up */
3007 /* If a monster stops time, don't process */
3010 monster_type *m_ptr;
3011 monster_race *r_ptr;
3013 /* Loop through monsters, adding newly lit squares to changes list */
3014 for (i = 1; i < m_max; i++)
3017 r_ptr = &r_info[m_ptr->r_idx];
3019 /* Skip dead monsters */
3020 if (!m_ptr->r_idx) continue;
3022 /* Is it too far away? */
3023 if (m_ptr->cdis > dis_lim) continue;
3025 /* Get lite radius */
3028 /* Note the radii are cumulative */
3029 if (r_ptr->flags7 & (RF7_HAS_LITE_1 | RF7_SELF_LITE_1)) rad++;
3030 if (r_ptr->flags7 & (RF7_HAS_LITE_2 | RF7_SELF_LITE_2)) rad += 2;
3031 if (r_ptr->flags7 & (RF7_HAS_DARK_1 | RF7_SELF_DARK_1)) rad--;
3032 if (r_ptr->flags7 & (RF7_HAS_DARK_2 | RF7_SELF_DARK_2)) rad -= 2;
3034 /* Exit if has no light */
3038 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;
3039 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) rad = 1;
3040 add_mon_lite = mon_lite_hack;
3045 if (!(r_ptr->flags7 & (RF7_SELF_DARK_1 | RF7_SELF_DARK_2)) && (MON_CSLEEP(m_ptr) || (!dun_level && !is_daytime()))) continue;
3046 add_mon_lite = mon_dark_hack;
3047 f_flag = FF_PROJECT;
3048 rad = -rad; /* Use absolute value */
3051 /* Access the location */
3055 /* Is the monster visible? */
3056 mon_invis = !(cave[mon_fy][mon_fx].info & CAVE_VIEW);
3058 /* The square it is on */
3059 add_mon_lite(mon_fy, mon_fx);
3061 /* Adjacent squares */
3062 add_mon_lite(mon_fy + 1, mon_fx);
3063 add_mon_lite(mon_fy - 1, mon_fx);
3064 add_mon_lite(mon_fy, mon_fx + 1);
3065 add_mon_lite(mon_fy, mon_fx - 1);
3066 add_mon_lite(mon_fy + 1, mon_fx + 1);
3067 add_mon_lite(mon_fy + 1, mon_fx - 1);
3068 add_mon_lite(mon_fy - 1, mon_fx + 1);
3069 add_mon_lite(mon_fy - 1, mon_fx - 1);
3074 /* South of the monster */
3075 if (cave_have_flag_bold(mon_fy + 1, mon_fx, f_flag))
3077 add_mon_lite(mon_fy + 2, mon_fx + 1);
3078 add_mon_lite(mon_fy + 2, mon_fx);
3079 add_mon_lite(mon_fy + 2, mon_fx - 1);
3081 c_ptr = &cave[mon_fy + 2][mon_fx];
3084 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3086 add_mon_lite(mon_fy + 3, mon_fx + 1);
3087 add_mon_lite(mon_fy + 3, mon_fx);
3088 add_mon_lite(mon_fy + 3, mon_fx - 1);
3092 /* North of the monster */
3093 if (cave_have_flag_bold(mon_fy - 1, mon_fx, f_flag))
3095 add_mon_lite(mon_fy - 2, mon_fx + 1);
3096 add_mon_lite(mon_fy - 2, mon_fx);
3097 add_mon_lite(mon_fy - 2, mon_fx - 1);
3099 c_ptr = &cave[mon_fy - 2][mon_fx];
3102 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3104 add_mon_lite(mon_fy - 3, mon_fx + 1);
3105 add_mon_lite(mon_fy - 3, mon_fx);
3106 add_mon_lite(mon_fy - 3, mon_fx - 1);
3110 /* East of the monster */
3111 if (cave_have_flag_bold(mon_fy, mon_fx + 1, f_flag))
3113 add_mon_lite(mon_fy + 1, mon_fx + 2);
3114 add_mon_lite(mon_fy, mon_fx + 2);
3115 add_mon_lite(mon_fy - 1, mon_fx + 2);
3117 c_ptr = &cave[mon_fy][mon_fx + 2];
3120 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3122 add_mon_lite(mon_fy + 1, mon_fx + 3);
3123 add_mon_lite(mon_fy, mon_fx + 3);
3124 add_mon_lite(mon_fy - 1, mon_fx + 3);
3128 /* West of the monster */
3129 if (cave_have_flag_bold(mon_fy, mon_fx - 1, f_flag))
3131 add_mon_lite(mon_fy + 1, mon_fx - 2);
3132 add_mon_lite(mon_fy, mon_fx - 2);
3133 add_mon_lite(mon_fy - 1, mon_fx - 2);
3135 c_ptr = &cave[mon_fy][mon_fx - 2];
3138 if ((rad == 3) && cave_have_flag_grid(c_ptr, f_flag))
3140 add_mon_lite(mon_fy + 1, mon_fx - 3);
3141 add_mon_lite(mon_fy, mon_fx - 3);
3142 add_mon_lite(mon_fy - 1, mon_fx - 3);
3150 /* South-East of the monster */
3151 if (cave_have_flag_bold(mon_fy + 1, mon_fx + 1, f_flag))
3153 add_mon_lite(mon_fy + 2, mon_fx + 2);
3156 /* South-West of the monster */
3157 if (cave_have_flag_bold(mon_fy + 1, mon_fx - 1, f_flag))
3159 add_mon_lite(mon_fy + 2, mon_fx - 2);
3162 /* North-East of the monster */
3163 if (cave_have_flag_bold(mon_fy - 1, mon_fx + 1, f_flag))
3165 add_mon_lite(mon_fy - 2, mon_fx + 2);
3168 /* North-West of the monster */
3169 if (cave_have_flag_bold(mon_fy - 1, mon_fx - 1, f_flag))
3171 add_mon_lite(mon_fy - 2, mon_fx - 2);
3177 /* Save end of list of new squares */
3181 * Look at old set flags to see if there are any changes.
3183 for (i = 0; i < mon_lite_n; i++)
3188 /* We trust this grid is in bounds */
3191 c_ptr = &cave[fy][fx];
3193 if (c_ptr->info & CAVE_TEMP) /* Pervious lit */
3195 /* It it no longer lit? */
3196 if ((c_ptr->info & (CAVE_VIEW | CAVE_MNLT)) == CAVE_VIEW)
3198 /* It is now unlit */
3199 /* Add it to later visual update */
3200 cave_note_and_redraw_later(c_ptr, fy, fx);
3203 else /* Pervious darkened */
3205 /* It it no longer darken? */
3206 if ((c_ptr->info & (CAVE_VIEW | CAVE_MNDK)) == CAVE_VIEW)
3208 /* It is now undarken */
3209 /* Add it to later visual update */
3210 cave_note_and_redraw_later(c_ptr, fy, fx);
3214 /* Add to end of temp array */
3215 temp_x[temp_n] = (byte)fx;
3216 temp_y[temp_n] = (byte)fy;
3220 /* Clear the lite array */
3223 /* Copy the temp array into the lit array lighting the new squares. */
3224 for (i = 0; i < end_temp; i++)
3229 /* We trust this grid is in bounds */
3232 c_ptr = &cave[fy][fx];
3234 if (c_ptr->info & CAVE_MNLT) /* Lit */
3236 /* The is the square newly lit and visible? */
3237 if ((c_ptr->info & (CAVE_VIEW | CAVE_TEMP)) == CAVE_VIEW)
3240 /* Add it to later visual update */
3241 cave_note_and_redraw_later(c_ptr, fy, fx);
3246 /* The is the square newly darkened and visible? */
3247 if ((c_ptr->info & (CAVE_VIEW | CAVE_XTRA)) == CAVE_VIEW)
3249 /* It is now darkened */
3250 /* Add it to later visual update */
3251 cave_note_and_redraw_later(c_ptr, fy, fx);
3255 /* Save in the monster lit or darkened array */
3256 mon_lite_x[mon_lite_n] = fx;
3257 mon_lite_y[mon_lite_n] = fy;
3261 /* Clear the temp flag for the old lit or darken grids */
3262 for (i = end_temp; i < temp_n; i++)
3264 /* We trust this grid is in bounds */
3266 cave[temp_y[i]][temp_x[i]].info &= ~(CAVE_TEMP | CAVE_XTRA);
3269 /* Finished with temp_n */
3272 /* Mega-Hack -- Visual update later */
3273 p_ptr->update |= (PU_DELAY_VIS);
3275 p_ptr->monlite = (cave[py][px].info & CAVE_MNLT) ? TRUE : FALSE;
3277 if (p_ptr->special_defense & NINJA_S_STEALTH)
3279 if (p_ptr->old_monlite != p_ptr->monlite)
3284 msg_print("±Æ¤Îʤ¤¤¤¬Çö¤ì¤¿µ¤¤¬¤¹¤ë¡£");
3286 msg_print("Your mantle of shadow become thin.");
3292 msg_print("±Æ¤Îʤ¤¤¤¬Ç»¤¯¤Ê¤Ã¤¿¡ª");
3294 msg_print("Your mantle of shadow restored its original darkness.");
3299 p_ptr->old_monlite = p_ptr->monlite;
3302 void clear_mon_lite(void)
3307 /* Clear all monster lit squares */
3308 for (i = 0; i < mon_lite_n; i++)
3311 c_ptr = &cave[mon_lite_y[i]][mon_lite_x[i]];
3313 /* Clear monster illumination flag */
3314 c_ptr->info &= ~(CAVE_MNLT | CAVE_MNDK);
3317 /* Empty the array */
3324 * Clear the viewable space
3326 void forget_view(void)
3332 /* None to forget */
3333 if (!view_n) return;
3335 /* Clear them all */
3336 for (i = 0; i < view_n; i++)
3341 /* Access the grid */
3342 c_ptr = &cave[y][x];
3344 /* Forget that the grid is viewable */
3345 c_ptr->info &= ~(CAVE_VIEW);
3347 /* if (!panel_contains(y, x)) continue; */
3349 /* Update the screen */
3350 /* lite_spot(y, x); Perhaps don't need? */
3360 * This macro allows us to efficiently add a grid to the "view" array,
3361 * note that we are never called for illegal grids, or for grids which
3362 * have already been placed into the "view" array, and we are never
3363 * called when the "view" array is full.
3365 #define cave_view_hack(C,Y,X) \
3367 if (!((C)->info & (CAVE_VIEW))){\
3368 (C)->info |= (CAVE_VIEW); \
3369 view_y[view_n] = (Y); \
3370 view_x[view_n] = (X); \
3377 * Helper function for "update_view()" below
3379 * We are checking the "viewability" of grid (y,x) by the player.
3381 * This function assumes that (y,x) is legal (i.e. on the map).
3383 * Grid (y1,x1) is on the "diagonal" between (py,px) and (y,x)
3384 * Grid (y2,x2) is "adjacent", also between (py,px) and (y,x).
3386 * Note that we are using the "CAVE_XTRA" field for marking grids as
3387 * "easily viewable". This bit is cleared at the end of "update_view()".
3389 * This function adds (y,x) to the "viewable set" if necessary.
3391 * This function now returns "TRUE" if vision is "blocked" by grid (y,x).
3393 static bool update_view_aux(int y, int x, int y1, int x1, int y2, int x2)
3395 bool f1, f2, v1, v2, z1, z2, wall;
3399 cave_type *g1_c_ptr;
3400 cave_type *g2_c_ptr;
3402 /* Access the grids */
3403 g1_c_ptr = &cave[y1][x1];
3404 g2_c_ptr = &cave[y2][x2];
3407 /* Check for walls */
3408 f1 = (cave_los_grid(g1_c_ptr));
3409 f2 = (cave_los_grid(g2_c_ptr));
3411 /* Totally blocked by physical walls */
3412 if (!f1 && !f2) return (TRUE);
3415 /* Check for visibility */
3416 v1 = (f1 && (g1_c_ptr->info & (CAVE_VIEW)));
3417 v2 = (f2 && (g2_c_ptr->info & (CAVE_VIEW)));
3419 /* Totally blocked by "unviewable neighbors" */
3420 if (!v1 && !v2) return (TRUE);
3423 /* Access the grid */
3424 c_ptr = &cave[y][x];
3427 /* Check for walls */
3428 wall = (!cave_los_grid(c_ptr));
3431 /* Check the "ease" of visibility */
3432 z1 = (v1 && (g1_c_ptr->info & (CAVE_XTRA)));
3433 z2 = (v2 && (g2_c_ptr->info & (CAVE_XTRA)));
3435 /* Hack -- "easy" plus "easy" yields "easy" */
3438 c_ptr->info |= (CAVE_XTRA);
3440 cave_view_hack(c_ptr, y, x);
3445 /* Hack -- primary "easy" yields "viewed" */
3448 cave_view_hack(c_ptr, y, x);
3453 /* Hack -- "view" plus "view" yields "view" */
3456 /* c_ptr->info |= (CAVE_XTRA); */
3458 cave_view_hack(c_ptr, y, x);
3464 /* Mega-Hack -- the "los()" function works poorly on walls */
3467 cave_view_hack(c_ptr, y, x);
3473 /* Hack -- check line of sight */
3474 if (los(py, px, y, x))
3476 cave_view_hack(c_ptr, y, x);
3482 /* Assume no line of sight. */
3489 * Calculate the viewable space
3491 * 1: Process the player
3492 * 1a: The player is always (easily) viewable
3493 * 2: Process the diagonals
3494 * 2a: The diagonals are (easily) viewable up to the first wall
3495 * 2b: But never go more than 2/3 of the "full" distance
3496 * 3: Process the main axes
3497 * 3a: The main axes are (easily) viewable up to the first wall
3498 * 3b: But never go more than the "full" distance
3499 * 4: Process sequential "strips" in each of the eight octants
3500 * 4a: Each strip runs along the previous strip
3501 * 4b: The main axes are "previous" to the first strip
3502 * 4c: Process both "sides" of each "direction" of each strip
3503 * 4c1: Each side aborts as soon as possible
3504 * 4c2: Each side tells the next strip how far it has to check
3506 * Note that the octant processing involves some pretty interesting
3507 * observations involving when a grid might possibly be viewable from
3508 * a given grid, and on the order in which the strips are processed.
3510 * Note the use of the mathematical facts shown below, which derive
3511 * from the fact that (1 < sqrt(2) < 1.5), and that the length of the
3512 * hypotenuse of a right triangle is primarily determined by the length
3513 * of the longest side, when one side is small, and is strictly less
3514 * than one-and-a-half times as long as the longest side when both of
3515 * the sides are large.
3517 * if (manhatten(dy,dx) < R) then (hypot(dy,dx) < R)
3518 * if (manhatten(dy,dx) > R*3/2) then (hypot(dy,dx) > R)
3520 * hypot(dy,dx) is approximated by (dx+dy+MAX(dx,dy)) / 2
3522 * These observations are important because the calculation of the actual
3523 * value of "hypot(dx,dy)" is extremely expensive, involving square roots,
3524 * while for small values (up to about 20 or so), the approximations above
3525 * are correct to within an error of at most one grid or so.
3527 * Observe the use of "full" and "over" in the code below, and the use of
3528 * the specialized calculation involving "limit", all of which derive from
3529 * the observations given above. Basically, we note that the "circle" of
3530 * view is completely contained in an "octagon" whose bounds are easy to
3531 * determine, and that only a few steps are needed to derive the actual
3532 * bounds of the circle given the bounds of the octagon.
3534 * Note that by skipping all the grids in the corners of the octagon, we
3535 * place an upper limit on the number of grids in the field of view, given
3536 * that "full" is never more than 20. Of the 1681 grids in the "square" of
3537 * view, only about 1475 of these are in the "octagon" of view, and even
3538 * fewer are in the "circle" of view, so 1500 or 1536 is more than enough
3539 * entries to completely contain the actual field of view.
3541 * Note also the care taken to prevent "running off the map". The use of
3542 * explicit checks on the "validity" of the "diagonal", and the fact that
3543 * the loops are never allowed to "leave" the map, lets "update_view_aux()"
3544 * use the optimized "cave_los_bold()" macro, and to avoid the overhead
3545 * of multiple checks on the validity of grids.
3547 * Note the "optimizations" involving the "se","sw","ne","nw","es","en",
3548 * "ws","wn" variables. They work like this: While travelling down the
3549 * south-bound strip just to the east of the main south axis, as soon as
3550 * we get to a grid which does not "transmit" viewing, if all of the strips
3551 * preceding us (in this case, just the main axis) had terminated at or before
3552 * the same point, then we can stop, and reset the "max distance" to ourself.
3553 * So, each strip (named by major axis plus offset, thus "se" in this case)
3554 * maintains a "blockage" variable, initialized during the main axis step,
3555 * and checks it whenever a blockage is observed. After processing each
3556 * strip as far as the previous strip told us to process, the next strip is
3557 * told not to go farther than the current strip's farthest viewable grid,
3558 * unless open space is still available. This uses the "k" variable.
3560 * Note the use of "inline" macros for efficiency. The "cave_los_grid()"
3561 * macro is a replacement for "cave_los_bold()" which takes a pointer to
3562 * a cave grid instead of its location. The "cave_view_hack()" macro is a
3563 * chunk of code which adds the given location to the "view" array if it
3564 * is not already there, using both the actual location and a pointer to
3565 * the cave grid. See above.
3567 * By the way, the purpose of this code is to reduce the dependancy on the
3568 * "los()" function which is slow, and, in some cases, not very accurate.
3570 * It is very possible that I am the only person who fully understands this
3571 * function, and for that I am truly sorry, but efficiency was very important
3572 * and the "simple" version of this function was just not fast enough. I am
3573 * more than willing to replace this function with a simpler one, if it is
3574 * equally efficient, and especially willing if the new function happens to
3575 * derive "reverse-line-of-sight" at the same time, since currently monsters
3576 * just use an optimized hack of "you see me, so I see you", and then use the
3577 * actual "projectable()" function to check spell attacks.
3579 void update_view(void)
3581 int n, m, d, k, y, x, z;
3583 int se, sw, ne, nw, es, en, ws, wn;
3587 int y_max = cur_hgt - 1;
3588 int x_max = cur_wid - 1;
3592 /*** Initialize ***/
3595 if (view_reduce_view && !dun_level)
3597 /* Full radius (10) */
3598 full = MAX_SIGHT / 2;
3600 /* Octagon factor (15) */
3601 over = MAX_SIGHT * 3 / 4;
3607 /* Full radius (20) */
3610 /* Octagon factor (30) */
3611 over = MAX_SIGHT * 3 / 2;
3615 /*** Step 0 -- Begin ***/
3617 /* Save the old "view" grids for later */
3618 for (n = 0; n < view_n; n++)
3623 /* Access the grid */
3624 c_ptr = &cave[y][x];
3626 /* Mark the grid as not in "view" */
3627 c_ptr->info &= ~(CAVE_VIEW);
3629 /* Mark the grid as "seen" */
3630 c_ptr->info |= (CAVE_TEMP);
3632 /* Add it to the "seen" set */
3638 /* Start over with the "view" array */
3641 /*** Step 1 -- adjacent grids ***/
3643 /* Now start on the player */
3647 /* Access the grid */
3648 c_ptr = &cave[y][x];
3650 /* Assume the player grid is easily viewable */
3651 c_ptr->info |= (CAVE_XTRA);
3653 /* Assume the player grid is viewable */
3654 cave_view_hack(c_ptr, y, x);
3657 /*** Step 2 -- Major Diagonals ***/
3662 /* Scan south-east */
3663 for (d = 1; d <= z; d++)
3665 c_ptr = &cave[y+d][x+d];
3666 c_ptr->info |= (CAVE_XTRA);
3667 cave_view_hack(c_ptr, y+d, x+d);
3668 if (!cave_los_grid(c_ptr)) break;
3671 /* Scan south-west */
3672 for (d = 1; d <= z; d++)
3674 c_ptr = &cave[y+d][x-d];
3675 c_ptr->info |= (CAVE_XTRA);
3676 cave_view_hack(c_ptr, y+d, x-d);
3677 if (!cave_los_grid(c_ptr)) break;
3680 /* Scan north-east */
3681 for (d = 1; d <= z; d++)
3683 c_ptr = &cave[y-d][x+d];
3684 c_ptr->info |= (CAVE_XTRA);
3685 cave_view_hack(c_ptr, y-d, x+d);
3686 if (!cave_los_grid(c_ptr)) break;
3689 /* Scan north-west */
3690 for (d = 1; d <= z; d++)
3692 c_ptr = &cave[y-d][x-d];
3693 c_ptr->info |= (CAVE_XTRA);
3694 cave_view_hack(c_ptr, y-d, x-d);
3695 if (!cave_los_grid(c_ptr)) break;
3699 /*** Step 3 -- major axes ***/
3702 for (d = 1; d <= full; d++)
3704 c_ptr = &cave[y+d][x];
3705 c_ptr->info |= (CAVE_XTRA);
3706 cave_view_hack(c_ptr, y+d, x);
3707 if (!cave_los_grid(c_ptr)) break;
3710 /* Initialize the "south strips" */
3714 for (d = 1; d <= full; d++)
3716 c_ptr = &cave[y-d][x];
3717 c_ptr->info |= (CAVE_XTRA);
3718 cave_view_hack(c_ptr, y-d, x);
3719 if (!cave_los_grid(c_ptr)) break;
3722 /* Initialize the "north strips" */
3726 for (d = 1; d <= full; d++)
3728 c_ptr = &cave[y][x+d];
3729 c_ptr->info |= (CAVE_XTRA);
3730 cave_view_hack(c_ptr, y, x+d);
3731 if (!cave_los_grid(c_ptr)) break;
3734 /* Initialize the "east strips" */
3738 for (d = 1; d <= full; d++)
3740 c_ptr = &cave[y][x-d];
3741 c_ptr->info |= (CAVE_XTRA);
3742 cave_view_hack(c_ptr, y, x-d);
3743 if (!cave_los_grid(c_ptr)) break;
3746 /* Initialize the "west strips" */
3750 /*** Step 4 -- Divide each "octant" into "strips" ***/
3752 /* Now check each "diagonal" (in parallel) */
3753 for (n = 1; n <= over / 2; n++)
3755 int ypn, ymn, xpn, xmn;
3758 /* Acquire the "bounds" of the maximal circle */
3760 if (z > full - n) z = full - n;
3761 while ((z + n + (n>>1)) > full) z--;
3764 /* Access the four diagonal grids */
3774 /* Maximum distance */
3775 m = MIN(z, y_max - ypn);
3778 if ((xpn <= x_max) && (n < se))
3781 for (k = n, d = 1; d <= m; d++)
3783 /* Check grid "d" in strip "n", notice "blockage" */
3784 if (update_view_aux(ypn+d, xpn, ypn+d-1, xpn-1, ypn+d-1, xpn))
3786 if (n + d >= se) break;
3789 /* Track most distant "non-blockage" */
3796 /* Limit the next strip */
3801 if ((xmn >= 0) && (n < sw))
3804 for (k = n, d = 1; d <= m; d++)
3806 /* Check grid "d" in strip "n", notice "blockage" */
3807 if (update_view_aux(ypn+d, xmn, ypn+d-1, xmn+1, ypn+d-1, xmn))
3809 if (n + d >= sw) break;
3812 /* Track most distant "non-blockage" */
3819 /* Limit the next strip */
3828 /* Maximum distance */
3832 if ((xpn <= x_max) && (n < ne))
3835 for (k = n, d = 1; d <= m; d++)
3837 /* Check grid "d" in strip "n", notice "blockage" */
3838 if (update_view_aux(ymn-d, xpn, ymn-d+1, xpn-1, ymn-d+1, xpn))
3840 if (n + d >= ne) break;
3843 /* Track most distant "non-blockage" */
3850 /* Limit the next strip */
3855 if ((xmn >= 0) && (n < nw))
3858 for (k = n, d = 1; d <= m; d++)
3860 /* Check grid "d" in strip "n", notice "blockage" */
3861 if (update_view_aux(ymn-d, xmn, ymn-d+1, xmn+1, ymn-d+1, xmn))
3863 if (n + d >= nw) break;
3866 /* Track most distant "non-blockage" */
3873 /* Limit the next strip */
3882 /* Maximum distance */
3883 m = MIN(z, x_max - xpn);
3886 if ((ypn <= x_max) && (n < es))
3889 for (k = n, d = 1; d <= m; d++)
3891 /* Check grid "d" in strip "n", notice "blockage" */
3892 if (update_view_aux(ypn, xpn+d, ypn-1, xpn+d-1, ypn, xpn+d-1))
3894 if (n + d >= es) break;
3897 /* Track most distant "non-blockage" */
3904 /* Limit the next strip */
3909 if ((ymn >= 0) && (n < en))
3912 for (k = n, d = 1; d <= m; d++)
3914 /* Check grid "d" in strip "n", notice "blockage" */
3915 if (update_view_aux(ymn, xpn+d, ymn+1, xpn+d-1, ymn, xpn+d-1))
3917 if (n + d >= en) break;
3920 /* Track most distant "non-blockage" */
3927 /* Limit the next strip */
3936 /* Maximum distance */
3940 if ((ypn <= y_max) && (n < ws))
3943 for (k = n, d = 1; d <= m; d++)
3945 /* Check grid "d" in strip "n", notice "blockage" */
3946 if (update_view_aux(ypn, xmn-d, ypn-1, xmn-d+1, ypn, xmn-d+1))
3948 if (n + d >= ws) break;
3951 /* Track most distant "non-blockage" */
3958 /* Limit the next strip */
3963 if ((ymn >= 0) && (n < wn))
3966 for (k = n, d = 1; d <= m; d++)
3968 /* Check grid "d" in strip "n", notice "blockage" */
3969 if (update_view_aux(ymn, xmn-d, ymn+1, xmn-d+1, ymn, xmn-d+1))
3971 if (n + d >= wn) break;
3974 /* Track most distant "non-blockage" */
3981 /* Limit the next strip */
3988 /*** Step 5 -- Complete the algorithm ***/
3990 /* Update all the new grids */
3991 for (n = 0; n < view_n; n++)
3996 /* Access the grid */
3997 c_ptr = &cave[y][x];
3999 /* Clear the "CAVE_XTRA" flag */
4000 c_ptr->info &= ~(CAVE_XTRA);
4002 /* Update only newly viewed grids */
4003 if (c_ptr->info & (CAVE_TEMP)) continue;
4005 /* Add it to later visual update */
4006 cave_note_and_redraw_later(c_ptr, y, x);
4009 /* Wipe the old grids, update as needed */
4010 for (n = 0; n < temp_n; n++)
4015 /* Access the grid */
4016 c_ptr = &cave[y][x];
4018 /* No longer in the array */
4019 c_ptr->info &= ~(CAVE_TEMP);
4021 /* Update only non-viewable grids */
4022 if (c_ptr->info & (CAVE_VIEW)) continue;
4024 /* Add it to later visual update */
4025 cave_redraw_later(c_ptr, y, x);
4031 /* Mega-Hack -- Visual update later */
4032 p_ptr->update |= (PU_DELAY_VIS);
4037 * Mega-Hack -- Delayed visual update
4038 * Only used if update_view(), update_lite() or update_mon_lite() was called
4040 void delayed_visual_update(void)
4045 /* Update needed grids */
4046 for (i = 0; i < redraw_n; i++)
4051 /* Access the grid */
4052 c_ptr = &cave[y][x];
4054 /* Update only needed grids (prevent multiple updating) */
4055 if (!(c_ptr->info & CAVE_REDRAW)) continue;
4057 /* If required, note */
4058 if (c_ptr->info & CAVE_NOTE) note_spot(y, x);
4063 /* Hack -- Visual update of monster on this grid */
4064 if (c_ptr->m_idx) update_mon(c_ptr->m_idx, FALSE);
4066 /* No longer in the array */
4067 c_ptr->info &= ~(CAVE_NOTE | CAVE_REDRAW);
4076 * Hack -- forget the "flow" information
4078 void forget_flow(void)
4082 /* Check the entire dungeon */
4083 for (y = 0; y < cur_hgt; y++)
4085 for (x = 0; x < cur_wid; x++)
4087 /* Forget the old data */
4088 cave[y][x].dist = 0;
4089 cave[y][x].cost = 0;
4090 cave[y][x].when = 0;
4097 * Hack - speed up the update_flow algorithm by only doing
4098 * it everytime the player moves out of LOS of the last
4101 static u16b flow_x = 0;
4102 static u16b flow_y = 0;
4107 * Hack -- fill in the "cost" field of every grid that the player
4108 * can "reach" with the number of steps needed to reach that grid.
4109 * This also yields the "distance" of the player from every grid.
4111 * In addition, mark the "when" of the grids that can reach
4112 * the player with the incremented value of "flow_n".
4114 * Hack -- use the "seen" array as a "circular queue".
4116 * We do not need a priority queue because the cost from grid
4117 * to grid is always "one" and we process them in order.
4119 void update_flow(void)
4125 /* Paranoia -- make sure the array is empty */
4128 /* The last way-point is on the map */
4129 if (running && in_bounds(flow_y, flow_x))
4131 /* The way point is in sight - do not update. (Speedup) */
4132 if (cave[flow_y][flow_x].info & CAVE_VIEW) return;
4135 /* Erase all of the current flow information */
4136 for (y = 0; y < cur_hgt; y++)
4138 for (x = 0; x < cur_wid; x++)
4140 cave[y][x].cost = 0;
4141 cave[y][x].dist = 0;
4145 /* Save player position */
4149 /* Add the player's grid to the queue */
4153 /* Now process the queue */
4154 while (flow_head != flow_tail)
4158 /* Extract the next entry */
4159 ty = temp_y[flow_tail];
4160 tx = temp_x[flow_tail];
4162 /* Forget that entry */
4163 if (++flow_tail == TEMP_MAX) flow_tail = 0;
4165 /* Add the "children" */
4166 for (d = 0; d < 8; d++)
4168 int old_head = flow_head;
4169 int m = cave[ty][tx].cost + 1;
4170 int n = cave[ty][tx].dist + 1;
4173 /* Child location */
4174 y = ty + ddy_ddd[d];
4175 x = tx + ddx_ddd[d];
4177 /* Ignore player's grid */
4178 if (player_bold(y, x)) continue;
4180 c_ptr = &cave[y][x];
4182 if (is_closed_door(c_ptr->feat)) m += 3;
4184 /* Ignore "pre-stamped" entries */
4185 if (c_ptr->dist != 0 && c_ptr->dist <= n && c_ptr->cost <= m) continue;
4187 /* Ignore "walls" and "rubble" */
4188 if (!cave_have_flag_grid(c_ptr, FF_MOVE) && !is_closed_door(c_ptr->feat)) continue;
4190 /* Save the flow cost */
4191 if (c_ptr->cost == 0 || c_ptr->cost > m) c_ptr->cost = m;
4192 if (c_ptr->dist == 0 || c_ptr->dist > n) c_ptr->dist = n;
4194 /* Hack -- limit flow depth */
4195 if (n == MONSTER_FLOW_DEPTH) continue;
4197 /* Enqueue that entry */
4198 temp_y[flow_head] = y;
4199 temp_x[flow_head] = x;
4201 /* Advance the queue */
4202 if (++flow_head == TEMP_MAX) flow_head = 0;
4204 /* Hack -- notice overflow by forgetting new entry */
4205 if (flow_head == flow_tail) flow_head = old_head;
4211 static int scent_when = 0;
4214 * Characters leave scent trails for perceptive monsters to track.
4216 * Smell is rather more limited than sound. Many creatures cannot use
4217 * it at all, it doesn't extend very far outwards from the character's
4218 * current position, and monsters can use it to home in the character,
4219 * but not to run away from him.
4221 * Smell is valued according to age. When a character takes his turn,
4222 * scent is aged by one, and new scent of the current age is laid down.
4223 * Speedy characters leave more scent, true, but it also ages faster,
4224 * which makes it harder to hunt them down.
4226 * Whenever the age count loops, most of the scent trail is erased and
4227 * the age of the remainder is recalculated.
4229 void update_smell(void)
4234 /* Create a table that controls the spread of scent */
4235 const int scent_adjust[5][5] =
4244 /* Loop the age and adjust scent values when necessary */
4245 if (++scent_when == 254)
4247 /* Scan the entire dungeon */
4248 for (y = 0; y < cur_hgt; y++)
4250 for (x = 0; x < cur_wid; x++)
4252 int w = cave[y][x].when;
4253 cave[y][x].when = (w > 128) ? (w - 128) : 0;
4262 /* Lay down new scent */
4263 for (i = 0; i < 5; i++)
4265 for (j = 0; j < 5; j++)
4269 /* Translate table to map grids */
4274 if (!in_bounds(y, x)) continue;
4276 c_ptr = &cave[y][x];
4278 /* Walls, water, and lava cannot hold scent. */
4279 if (!cave_have_flag_grid(c_ptr, FF_MOVE) && !is_closed_door(c_ptr->feat)) continue;
4281 /* Grid must not be blocked by walls from the character */
4282 if (!player_has_los_bold(y, x)) continue;
4284 /* Note grids that are too far away */
4285 if (scent_adjust[i][j] == -1) continue;
4287 /* Mark the grid with new scent */
4288 c_ptr->when = scent_when + scent_adjust[i][j];
4295 * Hack -- map the current panel (plus some) ala "magic mapping"
4297 void map_area(int range)
4302 feature_type *f_ptr;
4304 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) range /= 3;
4306 /* Scan that area */
4307 for (y = 1; y < cur_hgt - 1; y++)
4309 for (x = 1; x < cur_wid - 1; x++)
4311 if (distance(py, px, y, x) > range) continue;
4313 c_ptr = &cave[y][x];
4315 /* Memorize terrain of the grid */
4316 c_ptr->info |= (CAVE_KNOWN);
4318 /* Feature code (applying "mimic" field) */
4319 feat = get_feat_mimic(c_ptr);
4320 f_ptr = &f_info[feat];
4322 /* All non-walls are "checked" */
4323 if (!have_flag(f_ptr->flags, FF_WALL))
4325 /* Memorize normal features */
4326 if (have_flag(f_ptr->flags, FF_REMEMBER))
4328 /* Memorize the object */
4329 c_ptr->info |= (CAVE_MARK);
4332 /* Memorize known walls */
4333 for (i = 0; i < 8; i++)
4335 c_ptr = &cave[y + ddy_ddd[i]][x + ddx_ddd[i]];
4337 /* Feature code (applying "mimic" field) */
4338 feat = get_feat_mimic(c_ptr);
4339 f_ptr = &f_info[feat];
4341 /* Memorize walls (etc) */
4342 if (have_flag(f_ptr->flags, FF_REMEMBER))
4344 /* Memorize the walls */
4345 c_ptr->info |= (CAVE_MARK);
4353 p_ptr->redraw |= (PR_MAP);
4356 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4362 * Light up the dungeon using "clairvoyance"
4364 * This function "illuminates" every grid in the dungeon, memorizes all
4365 * "objects", memorizes all grids as with magic mapping, and, under the
4366 * standard option settings (view_perma_grids but not view_torch_grids)
4367 * memorizes all floor grids too.
4369 * Note that if "view_perma_grids" is not set, we do not memorize floor
4370 * grids, since this would defeat the purpose of "view_perma_grids", not
4371 * that anyone seems to play without this option.
4373 * Note that if "view_torch_grids" is set, we do not memorize floor grids,
4374 * since this would prevent the use of "view_torch_grids" as a method to
4375 * keep track of what grids have been observed directly.
4377 void wiz_lite(bool ninja)
4381 feature_type *f_ptr;
4383 /* Memorize objects */
4384 for (i = 1; i < o_max; i++)
4386 object_type *o_ptr = &o_list[i];
4388 /* Skip dead objects */
4389 if (!o_ptr->k_idx) continue;
4391 /* Skip held objects */
4392 if (o_ptr->held_m_idx) continue;
4395 o_ptr->marked |= OM_FOUND;
4398 /* Scan all normal grids */
4399 for (y = 1; y < cur_hgt - 1; y++)
4401 /* Scan all normal grids */
4402 for (x = 1; x < cur_wid - 1; x++)
4404 cave_type *c_ptr = &cave[y][x];
4406 /* Memorize terrain of the grid */
4407 c_ptr->info |= (CAVE_KNOWN);
4409 /* Feature code (applying "mimic" field) */
4410 feat = get_feat_mimic(c_ptr);
4411 f_ptr = &f_info[feat];
4413 /* Process all non-walls */
4414 if (!have_flag(f_ptr->flags, FF_WALL))
4416 /* Scan all neighbors */
4417 for (i = 0; i < 9; i++)
4419 int yy = y + ddy_ddd[i];
4420 int xx = x + ddx_ddd[i];
4423 c_ptr = &cave[yy][xx];
4425 /* Feature code (applying "mimic" field) */
4426 f_ptr = &f_info[get_feat_mimic(c_ptr)];
4428 /* Perma-lite the grid */
4429 if (!(d_info[dungeon_type].flags1 & DF1_DARKNESS) && !ninja)
4431 c_ptr->info |= (CAVE_GLOW);
4434 /* Memorize normal features */
4435 if (have_flag(f_ptr->flags, FF_REMEMBER))
4437 /* Memorize the grid */
4438 c_ptr->info |= (CAVE_MARK);
4441 /* Perma-lit grids (newly and previously) */
4442 else if (c_ptr->info & CAVE_GLOW)
4444 /* Normally, memorize floors (see above) */
4445 if (view_perma_grids && !view_torch_grids)
4447 /* Memorize the grid */
4448 c_ptr->info |= (CAVE_MARK);
4456 /* Update the monsters */
4457 p_ptr->update |= (PU_MONSTERS);
4460 p_ptr->redraw |= (PR_MAP);
4463 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4465 if (p_ptr->special_defense & NINJA_S_STEALTH)
4467 if (cave[py][px].info & CAVE_GLOW) set_superstealth(FALSE);
4473 * Forget the dungeon map (ala "Thinking of Maud...").
4480 /* Forget every grid */
4481 for (y = 1; y < cur_hgt - 1; y++)
4483 for (x = 1; x < cur_wid - 1; x++)
4485 cave_type *c_ptr = &cave[y][x];
4487 /* Process the grid */
4488 c_ptr->info &= ~(CAVE_MARK | CAVE_IN_DETECT | CAVE_KNOWN);
4489 c_ptr->info |= (CAVE_UNSAFE);
4493 /* Forget every grid on horizontal edge */
4494 for (x = 0; x < cur_wid; x++)
4496 cave[0][x].info &= ~(CAVE_MARK);
4497 cave[cur_hgt - 1][x].info &= ~(CAVE_MARK);
4500 /* Forget every grid on vertical edge */
4501 for (y = 1; y < (cur_hgt - 1); y++)
4503 cave[y][0].info &= ~(CAVE_MARK);
4504 cave[y][cur_wid - 1].info &= ~(CAVE_MARK);
4507 /* Forget all objects */
4508 for (i = 1; i < o_max; i++)
4510 object_type *o_ptr = &o_list[i];
4512 /* Skip dead objects */
4513 if (!o_ptr->k_idx) continue;
4515 /* Skip held objects */
4516 if (o_ptr->held_m_idx) continue;
4518 /* Forget the object */
4519 o_ptr->marked &= OM_TOUCHED;
4522 /* Forget travel route when we have forgotten map */
4523 forget_travel_flow();
4525 /* Mega-Hack -- Forget the view and lite */
4526 p_ptr->update |= (PU_UN_VIEW | PU_UN_LITE);
4528 /* Update the view and lite */
4529 p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE);
4531 /* Update the monsters */
4532 p_ptr->update |= (PU_MONSTERS);
4535 p_ptr->redraw |= (PR_MAP);
4538 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4546 * Change the "feat" flag for a grid, and notice/redraw the grid
4548 void cave_set_feat(int y, int x, int feat)
4550 cave_type *c_ptr = &cave[y][x];
4551 feature_type *f_ptr = &f_info[feat];
4552 bool old_los, old_mirror;
4554 if (!character_dungeon)
4556 /* Clear mimic type */
4559 /* Change the feature */
4562 /* Hack -- glow the GLOW terrain */
4563 if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS))
4567 for (i = 0; i < 9; i++)
4569 yy = y + ddy_ddd[i];
4570 xx = x + ddx_ddd[i];
4571 if (!in_bounds2(yy, xx)) continue;
4572 cave[yy][xx].info |= CAVE_GLOW;
4579 old_los = cave_have_flag_bold(y, x, FF_LOS);
4580 old_mirror = is_mirror_grid(c_ptr);
4582 /* Clear mimic type */
4585 /* Change the feature */
4588 /* Remove flag for mirror/glyph */
4589 c_ptr->info &= ~(CAVE_OBJECT);
4591 if (old_mirror && (d_info[dungeon_type].flags1 & DF1_DARKNESS))
4593 c_ptr->info &= ~(CAVE_GLOW);
4594 if (!view_torch_grids) c_ptr->info &= ~(CAVE_MARK);
4596 update_local_illumination(y, x);
4599 /* Check for change to boring grid */
4600 if (!have_flag(f_ptr->flags, FF_REMEMBER)) c_ptr->info &= ~(CAVE_MARK);
4602 /* Update the monster */
4603 if (c_ptr->m_idx) update_mon(c_ptr->m_idx, FALSE);
4611 /* Check if los has changed */
4612 if (old_los ^ have_flag(f_ptr->flags, FF_LOS))
4615 #ifdef COMPLEX_WALL_ILLUMINATION /* COMPLEX_WALL_ILLUMINATION */
4617 update_local_illumination(y, x);
4619 #endif /* COMPLEX_WALL_ILLUMINATION */
4621 /* Update the visuals */
4622 p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE | PU_MONSTERS);
4625 /* Hack -- glow the GLOW terrain */
4626 if (have_flag(f_ptr->flags, FF_GLOW) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS))
4631 for (i = 0; i < 9; i++)
4633 yy = y + ddy_ddd[i];
4634 xx = x + ddx_ddd[i];
4635 if (!in_bounds2(yy, xx)) continue;
4636 cc_ptr = &cave[yy][xx];
4637 cc_ptr->info |= CAVE_GLOW;
4639 if (player_has_los_grid(cc_ptr))
4641 /* Update the monster */
4642 if (cc_ptr->m_idx) update_mon(cc_ptr->m_idx, FALSE);
4651 update_local_illumination(yy, xx);
4654 if (p_ptr->special_defense & NINJA_S_STEALTH)
4656 if (cave[py][px].info & CAVE_GLOW) set_superstealth(FALSE);
4662 int conv_dungeon_feat(int newfeat)
4664 feature_type *f_ptr = &f_info[newfeat];
4666 if (have_flag(f_ptr->flags, FF_CONVERT))
4668 switch (f_ptr->subtype)
4670 case CONVERT_TYPE_FLOOR:
4671 return floor_type[randint0(100)];
4672 case CONVERT_TYPE_WALL:
4673 return fill_type[randint0(100)];
4674 case CONVERT_TYPE_INNER:
4675 return feat_wall_inner;
4676 case CONVERT_TYPE_OUTER:
4677 return feat_wall_outer;
4678 case CONVERT_TYPE_SOLID:
4679 return feat_wall_solid;
4680 case CONVERT_TYPE_STREAM1:
4681 return d_info[dungeon_type].stream1;
4682 case CONVERT_TYPE_STREAM2:
4683 return d_info[dungeon_type].stream2;
4688 else return newfeat;
4693 * Take a feature, determine what that feature becomes
4694 * through applying the given action.
4696 int feat_state(int feat, int action)
4698 feature_type *f_ptr = &f_info[feat];
4701 /* Get the new feature */
4702 for (i = 0; i < MAX_FEAT_STATES; i++)
4704 if (f_ptr->state[i].action == action) return conv_dungeon_feat(f_ptr->state[i].result);
4707 if (have_flag(f_ptr->flags, FF_PERMANENT)) return feat;
4709 return (feature_action_flags[action] & FAF_DESTROY) ? conv_dungeon_feat(f_ptr->destroyed) : feat;
4713 * Takes a location and action and changes the feature at that
4714 * location through applying the given action.
4716 void cave_alter_feat(int y, int x, int action)
4718 /* Set old feature */
4719 int oldfeat = cave[y][x].feat;
4721 /* Get the new feat */
4722 int newfeat = feat_state(oldfeat, action);
4725 if (newfeat == oldfeat) return;
4727 /* Set the new feature */
4728 cave_set_feat(y, x, newfeat);
4730 if (!(feature_action_flags[action] & FAF_NO_DROP))
4732 feature_type *old_f_ptr = &f_info[oldfeat];
4733 feature_type *f_ptr = &f_info[newfeat];
4737 if (have_flag(old_f_ptr->flags, FF_HAS_GOLD) && !have_flag(f_ptr->flags, FF_HAS_GOLD))
4739 /* Place some gold */
4745 if (have_flag(old_f_ptr->flags, FF_HAS_ITEM) && !have_flag(f_ptr->flags, FF_HAS_ITEM) && (randint0(100) < (15 - dun_level / 2)))
4748 place_object(y, x, 0L);
4752 if (found && character_dungeon && player_can_see_bold(y, x))
4755 msg_print("²¿¤«¤òȯ¸«¤·¤¿¡ª");
4757 msg_print("You have found something!");
4762 if (feature_action_flags[action] & FAF_CRASH_GLASS)
4764 feature_type *old_f_ptr = &f_info[oldfeat];
4766 if (have_flag(old_f_ptr->flags, FF_GLASS) && character_dungeon)
4768 project(PROJECT_WHO_GLASS_SHARDS, 1, y, x, MIN(dun_level, 100) / 4, GF_SHARDS,
4769 (PROJECT_GRID | PROJECT_ITEM | PROJECT_KILL | PROJECT_HIDE | PROJECT_JUMP | PROJECT_NO_HANGEKI), -1);
4775 /* Remove a mirror */
4776 void remove_mirror(int y, int x)
4778 cave_type *c_ptr = &cave[y][x];
4780 /* Remove the mirror */
4781 c_ptr->info &= ~(CAVE_OBJECT);
4784 if (d_info[dungeon_type].flags1 & DF1_DARKNESS)
4786 c_ptr->info &= ~(CAVE_GLOW);
4787 if (!view_torch_grids) c_ptr->info &= ~(CAVE_MARK);
4789 /* Update the monster */
4790 if (c_ptr->m_idx) update_mon(c_ptr->m_idx, FALSE);
4792 update_local_illumination(y, x);
4804 * Return TRUE if there is a mirror on the grid.
4806 bool is_mirror_grid(cave_type *c_ptr)
4808 if ((c_ptr->info & CAVE_OBJECT) && have_flag(f_info[c_ptr->mimic].flags, FF_MIRROR))
4816 * Return TRUE if there is a mirror on the grid.
4818 bool is_glyph_grid(cave_type *c_ptr)
4820 if ((c_ptr->info & CAVE_OBJECT) && have_flag(f_info[c_ptr->mimic].flags, FF_GLYPH))
4828 * Return TRUE if there is a mirror on the grid.
4830 bool is_explosive_rune_grid(cave_type *c_ptr)
4832 if ((c_ptr->info & CAVE_OBJECT) && have_flag(f_info[c_ptr->mimic].flags, FF_MINOR_GLYPH))
4840 * Calculate "incremental motion". Used by project() and shoot().
4841 * Assumes that (*y,*x) lies on the path from (y1,x1) to (y2,x2).
4843 void mmove2(int *y, int *x, int y1, int x1, int y2, int x2)
4845 int dy, dx, dist, shift;
4847 /* Extract the distance travelled */
4848 dy = (*y < y1) ? y1 - *y : *y - y1;
4849 dx = (*x < x1) ? x1 - *x : *x - x1;
4851 /* Number of steps */
4852 dist = (dy > dx) ? dy : dx;
4854 /* We are calculating the next location */
4858 /* Calculate the total distance along each axis */
4859 dy = (y2 < y1) ? (y1 - y2) : (y2 - y1);
4860 dx = (x2 < x1) ? (x1 - x2) : (x2 - x1);
4862 /* Paranoia -- Hack -- no motion */
4863 if (!dy && !dx) return;
4866 /* Move mostly vertically */
4869 /* Extract a shift factor */
4870 shift = (dist * dx + (dy - 1) / 2) / dy;
4872 /* Sometimes move along the minor axis */
4873 (*x) = (x2 < x1) ? (x1 - shift) : (x1 + shift);
4875 /* Always move along major axis */
4876 (*y) = (y2 < y1) ? (y1 - dist) : (y1 + dist);
4879 /* Move mostly horizontally */
4882 /* Extract a shift factor */
4883 shift = (dist * dy + (dx - 1) / 2) / dx;
4885 /* Sometimes move along the minor axis */
4886 (*y) = (y2 < y1) ? (y1 - shift) : (y1 + shift);
4888 /* Always move along major axis */
4889 (*x) = (x2 < x1) ? (x1 - dist) : (x1 + dist);
4896 * Determine if a bolt spell cast from (y1,x1) to (y2,x2) will arrive
4897 * at the final destination, assuming no monster gets in the way.
4899 * This is slightly (but significantly) different from "los(y1,x1,y2,x2)".
4901 bool projectable(int y1, int x1, int y2, int x2)
4908 /* Check the projection path */
4909 grid_n = project_path(grid_g, (project_length ? project_length : MAX_RANGE), y1, x1, y2, x2, 0);
4911 /* Identical grid */
4912 if (!grid_n) return TRUE;
4915 y = GRID_Y(grid_g[grid_n - 1]);
4916 x = GRID_X(grid_g[grid_n - 1]);
4918 /* May not end in an unrequested grid */
4919 if ((y != y2) || (x != x2)) return (FALSE);
4927 * Standard "find me a location" function
4929 * Obtains a legal location within the given distance of the initial
4930 * location, and with "los()" from the source to destination location.
4932 * This function is often called from inside a loop which searches for
4933 * locations while increasing the "d" distance.
4935 * Currently the "m" parameter is unused.
4937 void scatter(int *yp, int *xp, int y, int x, int d, int m)
4944 /* Pick a location */
4947 /* Pick a new location */
4948 ny = rand_spread(y, d);
4949 nx = rand_spread(x, d);
4951 /* Ignore annoying locations */
4952 if (!in_bounds(ny, nx)) continue;
4954 /* Ignore "excessively distant" locations */
4955 if ((d > 1) && (distance(y, x, ny, nx) > d)) continue;
4957 /* Require "line of projection" */
4958 if (projectable(y, x, ny, nx)) break;
4961 /* Save the location */
4970 * Track a new monster
4972 void health_track(int m_idx)
4974 /* Mount monster is already tracked */
4975 if (m_idx && m_idx == p_ptr->riding) return;
4977 /* Track a new guy */
4978 p_ptr->health_who = m_idx;
4980 /* Redraw (later) */
4981 p_ptr->redraw |= (PR_HEALTH);
4987 * Hack -- track the given monster race
4989 void monster_race_track(int r_idx)
4991 /* Save this monster ID */
4992 p_ptr->monster_race_idx = r_idx;
4995 p_ptr->window |= (PW_MONSTER);
5001 * Hack -- track the given object kind
5003 void object_kind_track(int k_idx)
5005 /* Save this monster ID */
5006 p_ptr->object_kind_idx = k_idx;
5009 p_ptr->window |= (PW_OBJECT);
5015 * Something has happened to disturb the player.
5017 * The first arg indicates a major disturbance, which affects search.
5019 * The second arg is currently unused, but could induce output flush.
5021 * All disturbance cancels repeated commands, resting, and running.
5023 void disturb(int stop_search, int stop_travel)
5027 stop_travel = stop_travel;
5030 /* Cancel auto-commands */
5031 /* command_new = 0; */
5033 /* Cancel repeated commands */
5039 /* Redraw the state (later) */
5040 p_ptr->redraw |= (PR_STATE);
5043 /* Cancel Resting */
5044 if ((p_ptr->action == ACTION_REST) || (p_ptr->action == ACTION_FISH) || (stop_search && (p_ptr->action == ACTION_SEARCH)))
5047 set_action(ACTION_NONE);
5050 /* Cancel running */
5056 /* Check for new panel if appropriate */
5057 if (center_player && !center_running) verify_panel();
5059 /* Calculate torch radius */
5060 p_ptr->update |= (PU_TORCH);
5062 /* Update monster flow */
5063 p_ptr->update |= (PU_FLOW);
5072 /* Check for new panel if appropriate */
5073 if (center_player && !center_running) verify_panel();
5075 /* Calculate torch radius */
5076 p_ptr->update |= (PU_TORCH);
5080 /* Flush the input if requested */
5081 if (flush_disturb) flush();
5086 * Glow deep lava and building entrances in the floor
5088 void glow_deep_lava_and_bldg(void)
5090 int y, x, i, yy, xx;
5093 /* Not in the darkness dungeon */
5094 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) return;
5096 for (y = 0; y < cur_hgt; y++)
5098 for (x = 0; x < cur_wid; x++)
5100 c_ptr = &cave[y][x];
5102 /* Feature code (applying "mimic" field) */
5104 if (have_flag(f_info[get_feat_mimic(c_ptr)].flags, FF_GLOW))
5106 for (i = 0; i < 9; i++)
5108 yy = y + ddy_ddd[i];
5109 xx = x + ddx_ddd[i];
5110 if (!in_bounds2(yy, xx)) continue;
5111 cave[yy][xx].info |= CAVE_GLOW;
5117 /* Update the view and lite */
5118 p_ptr->update |= (PU_VIEW | PU_LITE | PU_MON_LITE);
5121 p_ptr->redraw |= (PR_MAP);