3 /* Purpose: low level dungeon routines -BEN- */
10 * Support for Adam Bolt's tileset, lighting and transparency effects
11 * by Robert Ruehlmann (rr9@angband.org)
14 static byte display_autopick;
15 static int match_autopick;
16 static object_type *autopick_obj;
17 static int feat_priority;
20 * Distance between two points via Newton-Raphson technique
22 int distance (int y1, int x1, int y2, int x2)
24 int dy = (y1 > y2) ? (y1 - y2) : (y2 - y1);
25 int dx = (x1 > x2) ? (x1 - x2) : (x2 - x1);
27 /* Squared distance */
28 int target = (dy * dy) + (dx * dx);
30 /* Approximate distance: hypot(dy,dx) = max(dy,dx) + min(dy,dx) / 2 */
31 int d = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));
36 if (!dy || !dx) return d;
40 /* Approximate error */
41 err = (target - d * d) / (2 * d);
43 /* No error - we are done */
55 * Return TRUE if the given feature is a trap
57 bool is_trap(int feat)
61 case FEAT_TRAP_TRAPDOOR:
63 case FEAT_TRAP_SPIKED_PIT:
64 case FEAT_TRAP_POISON_PIT:
65 case FEAT_TRAP_TY_CURSE:
66 case FEAT_TRAP_TELEPORT:
70 case FEAT_TRAP_LOSE_STR:
71 case FEAT_TRAP_LOSE_DEX:
72 case FEAT_TRAP_LOSE_CON:
74 case FEAT_TRAP_CONFUSE:
75 case FEAT_TRAP_POISON:
93 * A simple, fast, integer-based line-of-sight algorithm. By Joseph Hall,
94 * 4116 Brewster Drive, Raleigh NC 27606. Email to jnh@ecemwl.ncsu.edu.
96 * Returns TRUE if a line of sight can be traced from (x1,y1) to (x2,y2).
98 * The LOS begins at the center of the tile (x1,y1) and ends at the center of
99 * the tile (x2,y2). If los() is to return TRUE, all of the tiles this line
100 * passes through must be floor tiles, except for (x1,y1) and (x2,y2).
102 * We assume that the "mathematical corner" of a non-floor tile does not
103 * block line of sight.
105 * Because this function uses (short) ints for all calculations, overflow may
106 * occur if dx and dy exceed 90.
108 * Once all the degenerate cases are eliminated, the values "qx", "qy", and
109 * "m" are multiplied by a scale factor "f1 = abs(dx * dy * 2)", so that
110 * we can use integer arithmetic.
112 * We travel from start to finish along the longer axis, starting at the border
113 * between the first and second tiles, where the y offset = .5 * slope, taking
114 * into account the scale factor. See below.
116 * Also note that this function and the "move towards target" code do NOT
117 * share the same properties. Thus, you can see someone, target them, and
118 * then fire a bolt at them, but the bolt may hit a wall, not them. However,
119 * by clever choice of target locations, you can sometimes throw a "curve".
121 * Note that "line of sight" is not "reflexive" in all cases.
123 * Use the "projectable()" routine to test "spell/missile line of sight".
125 * Use the "update_view()" function to determine player line-of-sight.
127 bool los(int y1, int x1, int y2, int x2)
147 /* Slope, or 1/Slope, of LOS */
151 /* Extract the offset */
155 /* Extract the absolute offset */
160 /* Handle adjacent (or identical) grids */
161 if ((ax < 2) && (ay < 2)) return (TRUE);
164 /* Paranoia -- require "safe" origin */
165 /* if (!in_bounds(y1, x1)) return (FALSE); */
166 /* if (!in_bounds(y2, x2)) return (FALSE); */
169 /* Directly South/North */
172 /* South -- check for walls */
175 for (ty = y1 + 1; ty < y2; ty++)
177 if (!cave_floor_bold(ty, x1)) return (FALSE);
181 /* North -- check for walls */
184 for (ty = y1 - 1; ty > y2; ty--)
186 if (!cave_floor_bold(ty, x1)) return (FALSE);
194 /* Directly East/West */
197 /* East -- check for walls */
200 for (tx = x1 + 1; tx < x2; tx++)
202 if (!cave_floor_bold(y1, tx)) return (FALSE);
206 /* West -- check for walls */
209 for (tx = x1 - 1; tx > x2; tx--)
211 if (!cave_floor_bold(y1, tx)) return (FALSE);
220 /* Extract some signs */
221 sx = (dx < 0) ? -1 : 1;
222 sy = (dy < 0) ? -1 : 1;
225 /* Vertical "knights" */
230 if (cave_floor_bold(y1 + sy, x1)) return (TRUE);
234 /* Horizontal "knights" */
239 if (cave_floor_bold(y1, x1 + sx)) return (TRUE);
244 /* Calculate scale factor div 2 */
247 /* Calculate scale factor */
251 /* Travel horizontally */
254 /* Let m = dy / dx * 2 * (dy * dx) = 2 * dy * dy */
260 /* Consider the special case where slope == 1. */
271 /* Note (below) the case (qy == f2), where */
272 /* the LOS exactly meets the corner of a tile. */
275 if (!cave_floor_bold(ty, tx)) return (FALSE);
286 if (!cave_floor_bold(ty, tx)) return (FALSE);
299 /* Travel vertically */
302 /* Let m = dx / dy * 2 * (dx * dy) = 2 * dx * dx */
318 /* Note (below) the case (qx == f2), where */
319 /* the LOS exactly meets the corner of a tile. */
322 if (!cave_floor_bold(ty, tx)) return (FALSE);
333 if (!cave_floor_bold(ty, tx)) return (FALSE);
356 * Can the player "see" the given grid in detail?
358 * He must have vision, illumination, and line of sight.
360 * Note -- "CAVE_LITE" is only set if the "torch" has "los()".
361 * So, given "CAVE_LITE", we know that the grid is "fully visible".
363 * Note that "CAVE_GLOW" makes little sense for a wall, since it would mean
364 * that a wall is visible from any direction. That would be odd. Except
365 * under wizard light, which might make sense. Thus, for walls, we require
366 * not only that they be "CAVE_GLOW", but also, that they be adjacent to a
367 * grid which is not only "CAVE_GLOW", but which is a non-wall, and which is
368 * in line of sight of the player.
370 * This extra check is expensive, but it provides a more "correct" semantics.
372 * Note that we should not run this check on walls which are "outer walls" of
373 * the dungeon, or we will induce a memory fault, but actually verifying all
374 * of the locations would be extremely expensive.
376 * Thus, to speed up the function, we assume that all "perma-walls" which are
377 * "CAVE_GLOW" are "illuminated" from all sides. This is correct for all cases
378 * except "vaults" and the "buildings" in town. But the town is a hack anyway,
379 * and the player has more important things on his mind when he is attacking a
380 * monster vault. It is annoying, but an extremely important optimization.
382 * Note that "glowing walls" are only considered to be "illuminated" if the
383 * grid which is next to the wall in the direction of the player is also a
384 * "glowing" grid. This prevents the player from being able to "see" the
385 * walls of illuminated rooms from a corridor outside the room.
387 bool player_can_see_bold(int y, int x)
393 /* Blind players see nothing */
394 if (p_ptr->blind) return (FALSE);
396 /* Access the cave grid */
399 /* Note that "torch-lite" yields "illumination" */
400 if (c_ptr->info & (CAVE_LITE)) return (TRUE);
402 /* Require line of sight to the grid */
403 if (!player_has_los_bold(y, x)) return (FALSE);
405 if (p_ptr->pclass == CLASS_NINJA) return TRUE;
407 /* Require "perma-lite" of the grid */
408 if (!(c_ptr->info & (CAVE_GLOW | CAVE_MNLT))) return (FALSE);
410 /* Floors are simple */
411 if (cave_floor_bold(y, x)) return (TRUE);
413 /* Hack -- move towards player */
414 yy = (y < py) ? (y + 1) : (y > py) ? (y - 1) : y;
415 xx = (x < px) ? (x + 1) : (x > px) ? (x - 1) : x;
417 /* Check for "local" illumination */
418 if (cave[yy][xx].info & (CAVE_GLOW | CAVE_MNLT))
420 /* Assume the wall is really illuminated */
424 /* Assume not visible */
431 * Returns true if the player's grid is dark
435 return (!player_can_see_bold(py, px));
442 * Determine if a given location may be "destroyed"
444 * Used by destruction spells, and for placing stairs, etc.
446 bool cave_valid_bold(int y, int x)
448 cave_type *c_ptr = &cave[y][x];
450 s16b this_o_idx, next_o_idx = 0;
453 /* Forbid perma-grids */
454 if (cave_perma_grid(c_ptr)) return (FALSE);
457 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
462 o_ptr = &o_list[this_o_idx];
464 /* Acquire next object */
465 next_o_idx = o_ptr->next_o_idx;
467 /* Forbid artifact grids */
468 if ((o_ptr->art_name) || artifact_p(o_ptr)) return (FALSE);
479 * Determine if a given location may be "destroyed"
481 * Used by destruction spells, and for placing stairs, etc.
483 bool cave_valid_grid(cave_type *c_ptr)
485 s16b this_o_idx, next_o_idx = 0;
488 /* Forbid perma-grids */
489 if (cave_perma_grid(c_ptr)) return (FALSE);
492 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
497 o_ptr = &o_list[this_o_idx];
499 /* Acquire next object */
500 next_o_idx = o_ptr->next_o_idx;
502 /* Forbid artifact grids */
503 if ((o_ptr->art_name) || artifact_p(o_ptr)) return (FALSE);
514 * Hack -- Legal monster codes
516 static cptr image_monster_hack = \
517 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
520 * Hack -- Legal monster codes for IBM pseudo-graphics
522 static cptr image_monster_hack_ibm = \
526 * Mega-Hack -- Hallucinatory monster
528 static void image_monster(byte *ap, char *cp)
530 int n = strlen(image_monster_hack);
532 /* Random symbol from set above */
535 /* Normal graphics */
536 if (!(streq(ANGBAND_SYS, "ibm")))
538 (*cp) = r_info[randint1(max_r_idx-1)].x_char;
539 (*ap) = r_info[randint1(max_r_idx-1)].x_attr;
542 /* IBM-pseudo graphics */
544 n = strlen(image_monster_hack_ibm);
545 (*cp) = (image_monster_hack_ibm[randint0(n)]);
548 (*ap) = randint1(15);
554 (*cp) = (image_monster_hack[randint0(n)]);
557 (*ap) = randint1(15);
564 * Hack -- Legal object codes
566 static cptr image_object_hack = \
567 "?/|\\\"!$()_-=[]{},~";
569 static cptr image_object_hack_ibm = \
573 * Mega-Hack -- Hallucinatory object
575 static void image_object(byte *ap, char *cp)
577 int n = strlen(image_object_hack);
581 if (!(streq(ANGBAND_SYS, "ibm")))
583 (*cp) = k_info[randint1(max_k_idx-1)].x_char;
584 (*ap) = k_info[randint1(max_k_idx-1)].x_attr;
588 n = strlen(image_object_hack_ibm);
589 (*cp) = (image_object_hack_ibm[randint0(n)]);
592 (*ap) = randint1(15);
597 (*cp) = (image_object_hack[randint0(n)]);
600 (*ap) = randint1(15);
607 * Hack -- Random hallucination
609 static void image_random(byte *ap, char *cp)
611 /* Normally, assume monsters */
612 if (randint0(100) < 75)
614 image_monster(ap, cp);
617 /* Otherwise, assume objects */
620 image_object(ap, cp);
625 * Not using graphical tiles for this feature?
627 #define is_ascii_graphics(C , A) \
628 (!(((C) & 0x80) && ((A) & 0x80)))
631 * The 16x16 tile of the terrain supports lighting
633 static bool feat_supports_lighting(byte feat)
635 if (is_trap(feat)) return streq(ANGBAND_GRAF, "new");
654 case FEAT_WALL_EXTRA:
655 case FEAT_WALL_INNER:
656 case FEAT_WALL_OUTER:
657 case FEAT_WALL_SOLID:
658 case FEAT_PERM_EXTRA:
659 case FEAT_PERM_INNER:
660 case FEAT_PERM_OUTER:
661 case FEAT_PERM_SOLID:
662 case FEAT_MINOR_GLYPH:
663 case FEAT_DEEP_WATER:
664 case FEAT_SHAL_WATER:
671 case FEAT_DEEP_GRASS:
682 * This array lists the effects of "brightness" on various "base" colours.
684 * This is used to do dynamic lighting effects in ascii :-)
685 * At the moment, only the various "floor" tiles are affected.
687 * The layout of the array is [x][0] = light and [x][1] = dark.
690 static byte lighting_colours[16][2] =
693 {TERM_L_DARK, TERM_DARK},
696 {TERM_YELLOW, TERM_SLATE},
699 {TERM_WHITE, TERM_L_DARK},
702 {TERM_L_UMBER, TERM_UMBER},
705 {TERM_RED, TERM_RED},
708 {TERM_L_GREEN, TERM_GREEN},
711 {TERM_BLUE, TERM_BLUE},
714 {TERM_L_UMBER, TERM_RED},
717 {TERM_SLATE, TERM_L_DARK},
720 {TERM_WHITE, TERM_SLATE},
723 {TERM_L_RED, TERM_BLUE},
726 {TERM_YELLOW, TERM_ORANGE},
729 {TERM_L_RED, TERM_L_RED},
732 {TERM_L_GREEN, TERM_GREEN},
735 {TERM_L_BLUE, TERM_L_BLUE},
738 {TERM_L_UMBER, TERM_UMBER}
742 * Extract the attr/char to display at the given (legal) map location
744 * Basically, we "paint" the chosen attr/char in several passes, starting
745 * with any known "terrain features" (defaulting to darkness), then adding
746 * any known "objects", and finally, adding any known "monsters". This
747 * is not the fastest method but since most of the calls to this function
748 * are made for grids with no monsters or objects, it is fast enough.
750 * Note that this function, if used on the grid containing the "player",
751 * will return the attr/char of the grid underneath the player, and not
752 * the actual player attr/char itself, allowing a lot of optimization
753 * in various "display" functions.
755 * Note that the "zero" entry in the feature/object/monster arrays are
756 * used to provide "special" attr/char codes, with "monster zero" being
757 * used for the player attr/char, "object zero" being used for the "stack"
758 * attr/char, and "feature zero" being used for the "nothing" attr/char,
759 * though this function makes use of only "feature zero".
761 * Note that monsters can have some "special" flags, including "ATTR_MULTI",
762 * which means their color changes, and "ATTR_CLEAR", which means they take
763 * the color of whatever is under them, and "CHAR_CLEAR", which means that
764 * they take the symbol of whatever is under them. Technically, the flag
765 * "CHAR_MULTI" is supposed to indicate that a monster looks strange when
766 * examined, but this flag is currently ignored.
768 * Currently, we do nothing with multi-hued objects, because there are
769 * not any. If there were, they would have to set "shimmer_objects"
770 * when they were created, and then new "shimmer" code in "dungeon.c"
771 * would have to be created handle the "shimmer" effect, and the code
772 * in "cave.c" would have to be updated to create the shimmer effect.
774 * Note the effects of hallucination. Objects always appear as random
775 * "objects", monsters as random "monsters", and normal grids occasionally
776 * appear as random "monsters" or "objects", but note that these random
777 * "monsters" and "objects" are really just "colored ascii symbols".
779 * Note that "floors" and "invisible traps" (and "zero" features) are
780 * drawn as "floors" using a special check for optimization purposes,
781 * and these are the only features which get drawn using the special
782 * lighting effects activated by "view_special_lite".
784 * Note the use of the "mimic" field in the "terrain feature" processing,
785 * which allows any feature to "pretend" to be another feature. This is
786 * used to "hide" secret doors, and to make all "doors" appear the same,
787 * and all "walls" appear the same, and "hidden" treasure stay hidden.
788 * It is possible to use this field to make a feature "look" like a floor,
789 * but the "special lighting effects" for floors will not be used.
791 * Note the use of the new "terrain feature" information. Note that the
792 * assumption that all interesting "objects" and "terrain features" are
793 * memorized allows extremely optimized processing below. Note the use
794 * of separate flags on objects to mark them as memorized allows a grid
795 * to have memorized "terrain" without granting knowledge of any object
796 * which may appear in that grid.
798 * Note the efficient code used to determine if a "floor" grid is
799 * "memorized" or "viewable" by the player, where the test for the
800 * grid being "viewable" is based on the facts that (1) the grid
801 * must be "lit" (torch-lit or perma-lit), (2) the grid must be in
802 * line of sight, and (3) the player must not be blind, and uses the
803 * assumption that all torch-lit grids are in line of sight.
805 * Note that floors (and invisible traps) are the only grids which are
806 * not memorized when seen, so only these grids need to check to see if
807 * the grid is "viewable" to the player (if it is not memorized). Since
808 * most non-memorized grids are in fact walls, this induces *massive*
809 * efficiency, at the cost of *forcing* the memorization of non-floor
810 * grids when they are first seen. Note that "invisible traps" are
811 * always treated exactly like "floors", which prevents "cheating".
813 * Note the "special lighting effects" which can be activated for floor
814 * grids using the "view_special_lite" option (for "white" floor grids),
815 * causing certain grids to be displayed using special colors. If the
816 * player is "blind", we will use "dark gray", else if the grid is lit
817 * by the torch, and the "view_yellow_lite" option is set, we will use
818 * "yellow", else if the grid is "dark", we will use "dark gray", else
819 * if the grid is not "viewable", and the "view_bright_lite" option is
820 * set, and the we will use "slate" (gray). We will use "white" for all
821 * other cases, in particular, for illuminated viewable floor grids.
823 * Note the "special lighting effects" which can be activated for wall
824 * grids using the "view_granite_lite" option (for "white" wall grids),
825 * causing certain grids to be displayed using special colors. If the
826 * player is "blind", we will use "dark gray", else if the grid is lit
827 * by the torch, and the "view_yellow_lite" option is set, we will use
828 * "yellow", else if the "view_bright_lite" option is set, and the grid
829 * is not "viewable", or is "dark", or is glowing, but not when viewed
830 * from the player's current location, we will use "slate" (gray). We
831 * will use "white" for all other cases, in particular, for correctly
832 * illuminated viewable wall grids.
834 * Note that, when "view_granite_lite" is set, we use an inline version
835 * of the "player_can_see_bold()" function to check the "viewability" of
836 * grids when the "view_bright_lite" option is set, and we do NOT use
837 * any special colors for "dark" wall grids, since this would allow the
838 * player to notice the walls of illuminated rooms from a hallway that
839 * happened to run beside the room. The alternative, by the way, would
840 * be to prevent the generation of hallways next to rooms, but this
841 * would still allow problems when digging towards a room.
843 * Note that bizarre things must be done when the "attr" and/or "char"
844 * codes have the "high-bit" set, since these values are used to encode
845 * various "special" pictures in some versions, and certain situations,
846 * such as "multi-hued" or "clear" monsters, cause the attr/char codes
847 * to be "scrambled" in various ways.
849 * Note that eventually we may use the "&" symbol for embedded treasure,
850 * and use the "*" symbol to indicate multiple objects, though this will
851 * have to wait for Angband 2.8.0 or later. Note that currently, this
852 * is not important, since only one object or terrain feature is allowed
853 * in each grid. If needed, "k_info[0]" will hold the "stack" attr/char.
855 * Note the assumption that doing "x_ptr = &x_info[x]" plus a few of
856 * "x_ptr->xxx", is quicker than "x_info[x].xxx", if this is incorrect
857 * then a whole lot of code should be changed... XXX XXX
859 #ifdef USE_TRANSPARENCY
860 void map_info(int y, int x, byte *ap, char *cp, byte *tap, char *tcp)
861 #else /* USE_TRANSPARENCY */
862 void map_info(int y, int x, byte *ap, char *cp)
863 #endif /* USE_TRANSPARENCY */
869 s16b this_o_idx, next_o_idx = 0;
880 feat = c_ptr->mimic ? c_ptr->mimic : c_ptr->feat;
881 feat = (c_ptr->info & CAVE_IN_MIRROR) ? FEAT_MIRROR : c_ptr->feat;
884 if ((feat <= FEAT_INVIS) || (feat == FEAT_DIRT) || (feat == FEAT_GRASS))
886 /* Memorized (or visible) floor */
887 if ((c_ptr->info & CAVE_MARK) ||
888 (((c_ptr->info & CAVE_LITE) || (c_ptr->info & CAVE_MNLT) ||
889 ((c_ptr->info & CAVE_GLOW) &&
890 (c_ptr->info & CAVE_VIEW))) &&
894 f_ptr = &f_info[feat];
902 /* Special lighting effects */
903 if (view_special_lite && (!p_ptr->wild_mode) && ((a == TERM_WHITE) || use_graphics))
911 * feat_supports_lighting(feat)
912 * is always TRUE here
915 /* Use a dark tile */
920 /* Use "dark gray" */
925 /* Handle "torch-lit" grids */
926 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
929 if (view_yellow_lite && !p_ptr->wild_mode)
934 * feat_supports_lighting(feat)
935 * is always TRUE here
938 /* Use a brightly lit tile */
949 /* Handle "dark" grids */
950 else if (!(c_ptr->info & CAVE_GLOW))
955 * feat_supports_lighting(feat)
956 * is always TRUE here
959 /* Use a dark tile */
964 /* Use "dark gray" */
969 /* Handle "out-of-sight" grids */
970 else if (!(c_ptr->info & CAVE_VIEW))
973 if (view_bright_lite && !p_ptr->wild_mode)
978 * feat_supports_lighting(feat)
979 * is always TRUE here
982 /* Use a dark tile */
998 /* Unsafe cave grid -- idea borrowed from Unangband */
999 if (view_unsafe_grids && (c_ptr->info & (CAVE_UNSAFE)))
1000 feat = FEAT_UNDETECTD;
1004 /* Access darkness */
1005 f_ptr = &f_info[feat];
1018 /* Memorized grids */
1019 if ((c_ptr->info & CAVE_MARK) && (view_granite_lite || new_ascii_graphics))
1021 /* Apply "mimic" field */
1023 feat = c_ptr->mimic;
1025 feat = f_info[feat].mimic;
1027 /* Access feature */
1028 f_ptr = &f_info[feat];
1036 if (new_ascii_graphics)
1038 /* Handle "blind" */
1041 if (is_ascii_graphics(c,a))
1043 /* Use darkened colour */
1044 a = lighting_colours[a][1];
1046 else if (use_graphics && feat_supports_lighting(feat))
1048 /* Use a dark tile */
1053 /* Handle "torch-lit" grids */
1054 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
1057 if (view_yellow_lite && !p_ptr->wild_mode && ((use_graphics && feat_supports_lighting(feat)) || is_ascii_graphics(c,a)))
1059 if (is_ascii_graphics(c,a))
1061 /* Use lightened colour */
1062 a = lighting_colours[a][0];
1064 else if (use_graphics &&
1065 feat_supports_lighting(c_ptr->feat))
1067 /* Use a brightly lit tile */
1073 /* Handle "view_bright_lite" */
1074 else if (view_bright_lite && !p_ptr->wild_mode && ((use_graphics && feat_supports_lighting(feat)) || is_ascii_graphics(c,a)))
1077 if (!(c_ptr->info & CAVE_VIEW))
1079 if (is_ascii_graphics(c,a))
1081 /* Use darkened colour */
1082 a = lighting_colours[a][1];
1084 else if (use_graphics && feat_supports_lighting(feat))
1086 /* Use a dark tile */
1092 else if (!(c_ptr->info & CAVE_GLOW))
1094 if (is_ascii_graphics(c,a))
1096 /* Use darkened colour */
1097 a = lighting_colours[a][1];
1102 /* Special lighting effects */
1103 else if (view_granite_lite && !p_ptr->wild_mode &&
1104 (((a == TERM_WHITE) && !use_graphics) ||
1105 (use_graphics && feat_supports_lighting(c_ptr->feat))))
1107 /* Handle "blind" */
1112 /* Use a dark tile */
1117 /* Use "dark gray" */
1122 /* Handle "torch-lit" grids */
1123 else if (c_ptr->info & (CAVE_LITE | CAVE_MNLT))
1126 if (view_yellow_lite && !p_ptr->wild_mode)
1130 /* Use a brightly lit tile */
1141 /* Handle "view_bright_lite" */
1142 else if (view_bright_lite && !p_ptr->wild_mode)
1145 if (!(c_ptr->info & CAVE_VIEW))
1149 /* Use a dark tile */
1160 else if (!(c_ptr->info & CAVE_GLOW))
1164 /* Use a lit tile */
1173 /* Not glowing correctly */
1178 /* Hack -- move towards player */
1179 yy = (y < py) ? (y + 1) : (y > py) ? (y - 1) : y;
1180 xx = (x < px) ? (x + 1) : (x > px) ? (x - 1) : x;
1182 /* Check for "local" illumination */
1183 if (!(cave[yy][xx].info & CAVE_GLOW))
1187 /* Use a lit tile */
1200 /* "Simple Lighting" */
1203 /* Handle "blind" */
1204 if (!(c_ptr->info & CAVE_MARK))
1206 /* Unsafe cave grid -- idea borrowed from Unangband */
1207 if (view_unsafe_grids && (c_ptr->info & (CAVE_UNSAFE)))
1208 feat = FEAT_UNDETECTD;
1213 /* Access feature */
1214 f_ptr = &f_info[feat];
1224 if (feat_priority == -1)
1229 case FEAT_UNDETECTD:
1236 case FEAT_TRAP_TRAPDOOR:
1238 case FEAT_TRAP_SPIKED_PIT:
1239 case FEAT_TRAP_POISON_PIT:
1240 case FEAT_TRAP_TY_CURSE:
1241 case FEAT_TRAP_TELEPORT:
1242 case FEAT_TRAP_FIRE:
1243 case FEAT_TRAP_ACID:
1244 case FEAT_TRAP_SLOW:
1245 case FEAT_TRAP_LOSE_STR:
1246 case FEAT_TRAP_LOSE_DEX:
1247 case FEAT_TRAP_LOSE_CON:
1248 case FEAT_TRAP_BLIND:
1249 case FEAT_TRAP_CONFUSE:
1250 case FEAT_TRAP_POISON:
1251 case FEAT_TRAP_SLEEP:
1252 case FEAT_TRAP_TRAPS:
1253 case FEAT_TRAP_ALARM:
1257 case FEAT_DEEP_GRASS:
1266 case FEAT_WALL_EXTRA:
1267 case FEAT_WALL_INNER:
1268 case FEAT_WALL_OUTER:
1269 case FEAT_WALL_SOLID:
1270 case FEAT_DEEP_WATER:
1271 case FEAT_SHAL_WATER:
1272 case FEAT_DEEP_LAVA:
1273 case FEAT_SHAL_LAVA:
1283 case FEAT_PERM_EXTRA:
1284 case FEAT_PERM_INNER:
1285 case FEAT_PERM_OUTER:
1286 case FEAT_PERM_SOLID:
1290 /* default is feat_priority = 20; (doors and stores) */
1293 case FEAT_MINOR_GLYPH:
1295 case FEAT_PATTERN_START:
1296 case FEAT_PATTERN_1:
1297 case FEAT_PATTERN_2:
1298 case FEAT_PATTERN_3:
1299 case FEAT_PATTERN_4:
1300 case FEAT_PATTERN_END:
1301 case FEAT_PATTERN_OLD:
1302 case FEAT_PATTERN_XTRA1:
1303 case FEAT_PATTERN_XTRA2:
1307 /* objects have feat_priority = 20 */
1308 /* monsters have feat_priority = 30 */
1312 case FEAT_QUEST_ENTER:
1313 case FEAT_QUEST_EXIT:
1314 case FEAT_QUEST_DOWN:
1316 case FEAT_LESS_LESS:
1317 case FEAT_MORE_MORE:
1329 #ifdef USE_TRANSPARENCY
1330 /* Save the terrain info for the transparency effects */
1333 #endif /* USE_TRANSPARENCY */
1339 /* Hack -- rare random hallucination, except on outer dungeon walls */
1340 if (p_ptr->image && (c_ptr->feat < FEAT_PERM_SOLID) && !randint0(256))
1343 image_random(ap, cp);
1347 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1351 /* Acquire object */
1352 o_ptr = &o_list[this_o_idx];
1354 /* Acquire next object */
1355 next_o_idx = o_ptr->next_o_idx;
1357 /* Memorized objects */
1360 if (display_autopick)
1364 match_autopick = is_autopick(o_ptr);
1365 if(match_autopick == -1)
1368 act = autopick_list[match_autopick].action;
1370 if ((act & DO_DISPLAY) && (act & display_autopick))
1372 autopick_obj = o_ptr;
1376 match_autopick = -1;
1381 (*cp) = object_char(o_ptr);
1384 (*ap) = object_attr(o_ptr);
1388 /* Hack -- hallucination */
1389 if (p_ptr->image) image_object(ap, cp);
1397 /* Handle monsters */
1398 if (c_ptr->m_idx && display_autopick == 0 )
1400 monster_type *m_ptr = &m_list[c_ptr->m_idx];
1402 /* Visible monster */
1405 monster_race *r_ptr;
1406 r_ptr = &r_info[m_ptr->ap_r_idx];
1416 /* Mimics' colors vary */
1417 if (strchr("\"!=", c) && !(r_ptr->flags1 & RF1_UNIQUE))
1422 /* Use semi-random attr */
1423 (*ap) = c_ptr->m_idx % 15 + 1;
1426 /* Special attr/char codes */
1427 else if ((a & 0x80) && (c & 0x80))
1436 /* Multi-hued monster */
1437 else if (r_ptr->flags1 & (RF1_ATTR_MULTI))
1439 /* Is it a shapechanger? */
1440 if (r_ptr->flags2 & (RF2_SHAPECHANGER))
1444 if (!(streq(ANGBAND_SYS, "ibm")))
1446 (*cp) = r_info[randint1(max_r_idx-1)].x_char;
1447 (*ap) = r_info[randint1(max_r_idx-1)].x_attr;
1451 int n = strlen(image_monster_hack_ibm);
1452 (*cp) = (image_monster_hack_ibm[randint0(n)]);
1455 (*ap) = randint1(15);
1460 (*cp) = (one_in_(25) ?
1461 image_object_hack[randint0(strlen(image_object_hack))] :
1462 image_monster_hack[randint0(strlen(image_monster_hack))]);
1468 /* Multi-hued attr */
1469 if (r_ptr->flags2 & RF2_ATTR_ANY)
1470 (*ap) = randint1(15);
1471 else switch (randint1(7))
1483 (*ap) = TERM_L_GREEN;
1489 (*ap) = TERM_L_DARK;
1497 /* Normal monster (not "clear" in any way) */
1498 else if (!(r_ptr->flags1 & (RF1_ATTR_CLEAR | RF1_CHAR_CLEAR)))
1507 /* Hack -- Bizarre grid under monster */
1508 else if ((*ap & 0x80) || (*cp & 0x80))
1520 /* Normal (non-clear char) monster */
1521 if (!(r_ptr->flags1 & (RF1_CHAR_CLEAR)))
1527 /* Normal (non-clear attr) monster */
1528 else if (!(r_ptr->flags1 & (RF1_ATTR_CLEAR)))
1535 /* Hack -- hallucination */
1538 /* Hallucinatory monster */
1539 image_monster(ap, cp);
1544 /* Handle "player" */
1545 if ((y == py) && (x == px))
1547 monster_race *r_ptr = &r_info[0];
1551 /* Get the "player" attr */
1554 /* Get the "player" char */
1557 #ifdef VARIABLE_PLAYER_GRAPH
1559 if (!streq(ANGBAND_GRAF, "new"))
1561 if (streq(ANGBAND_SYS,"ibm"))
1563 if (use_graphics && player_symbols)
1565 if (p_ptr->psex == SEX_FEMALE) c = (char)242;
1566 switch (p_ptr->pclass)
1569 if (p_ptr->lev < 20)
1575 case CLASS_WARRIOR_MAGE:
1576 case CLASS_RED_MAGE:
1577 if (p_ptr->lev < 20)
1582 case CLASS_CHAOS_WARRIOR:
1587 while (a == TERM_DARK);
1590 case CLASS_HIGH_MAGE:
1591 case CLASS_SORCERER:
1592 case CLASS_MAGIC_EATER:
1593 case CLASS_BLUE_MAGE:
1594 if (p_ptr->lev < 20)
1602 if (p_ptr->lev < 20)
1610 if (p_ptr->lev < 20)
1617 if (p_ptr->lev < 20)
1624 case CLASS_BERSERKER:
1626 if (p_ptr->lev < 20)
1632 case CLASS_MINDCRAFTER:
1633 case CLASS_FORCETRAINER:
1634 case CLASS_MIRROR_MASTER:
1635 if (p_ptr->lev < 20)
1641 default: /* Unknown */
1645 switch (p_ptr->prace)
1657 case RACE_HALF_TROLL:
1667 case RACE_HALF_OGRE:
1670 case RACE_HALF_GIANT:
1671 case RACE_HALF_TITAN:
1690 case RACE_DRACONIAN:
1691 if (p_ptr->lev < 20)
1693 else if (p_ptr->lev < 40)
1698 case RACE_MIND_FLAYER:
1709 if (p_ptr->pclass == CLASS_MAGE ||
1710 p_ptr->pclass == CLASS_PRIEST ||
1711 p_ptr->pclass == CLASS_HIGH_MAGE ||
1712 p_ptr->pclass == CLASS_SORCERER ||
1713 p_ptr->pclass == CLASS_MONK ||
1714 p_ptr->pclass == CLASS_FORCETRAINER ||
1715 p_ptr->pclass == CLASS_BLUE_MAGE ||
1716 p_ptr->pclass == CLASS_MIRROR_MASTER ||
1717 p_ptr->pclass == CLASS_MINDCRAFTER)
1751 #endif /* VARIABLE_PLAYER_GRAPH */
1759 * Table of Ascii-to-Zenkaku
1760 * ¡Ö¢£¡×¤ÏÆóÇÜÉýƦÉå¤ÎÆâÉô¥³¡¼¥É¤Ë»ÈÍÑ¡£
1762 static char ascii_to_zenkaku[2*128+1] = "\
1763 ¡¡¡ª¡É¡ô¡ð¡ó¡õ¡Ç¡Ê¡Ë¡ö¡Ü¡¤¡Ý¡¥¡¿\
1764 £°£±£²£³£´£µ£¶£·£¸£¹¡§¡¨¡ã¡á¡ä¡©\
1765 ¡÷£Á£Â£Ã£Ä£Å£Æ£Ç£È£É£Ê£Ë£Ì£Í£Î£Ï\
1766 £Ð£Ñ£Ò£Ó£Ô£Õ£Ö£×£Ø£Ù£Ú¡Î¡À¡Ï¡°¡²\
1767 ¡Æ£á£â£ã£ä£å£æ£ç£è£é£ê£ë£ì£í£î£ï\
1768 £ð£ñ£ò£ó£ô£õ£ö£÷£ø£ù£ú¡Ð¡Ã¡Ñ¡Á¢£";
1772 * Prepare Bigtile or 2-bytes character attr/char pairs
1774 static void bigtile_attr(char *cp, byte *ap, char *cp2, byte *ap2)
1784 if (isprint(*cp) || *cp == 127)
1786 *ap2 = (*ap) | 0xf0;
1787 *cp2 = ascii_to_zenkaku[2*(*cp-' ') + 1];
1788 *cp = ascii_to_zenkaku[2*(*cp-' ')];
1799 * Calculate panel colum of a location in the map
1801 static int panel_col_of(int col)
1803 col -= panel_col_min;
1804 if (use_bigtile) col *= 2;
1810 * Moves the cursor to a given MAP (y,x) location
1812 void move_cursor_relative(int row, int col)
1814 /* Real co-ords convert to screen positions */
1815 row -= panel_row_prt;
1818 Term_gotoxy(panel_col_of(col), row);
1824 * Place an attr/char pair at the given map coordinate, if legal.
1826 void print_rel(char c, byte a, int y, int x)
1831 /* Only do "legal" locations */
1832 if (panel_contains(y, x))
1834 /* Hack -- fake monochrome */
1835 if (!use_graphics || streq(ANGBAND_SYS, "ibm"))
1837 if (world_monster) a = TERM_DARK;
1838 else if (p_ptr->invuln || world_player) a = TERM_WHITE;
1839 else if ((p_ptr->pclass == CLASS_BARD) && (p_ptr->magic_num1[0] == MUSIC_INVULN)) a = TERM_WHITE;
1840 else if (p_ptr->wraith_form) a = TERM_L_DARK;
1843 if (use_bigtile) bigtile_attr(&c, &a, &c2, &a2);
1845 /* Draw the char using the attr */
1846 Term_draw(panel_col_of(x), y-panel_row_prt, a, c);
1848 Term_draw(panel_col_of(x)+1, y-panel_row_prt, a2, c2);
1857 * Memorize interesting viewable object/features in the given grid
1859 * This function should only be called on "legal" grids.
1861 * This function will memorize the object and/or feature in the given
1862 * grid, if they are (1) viewable and (2) interesting. Note that all
1863 * objects are interesting, all terrain features except floors (and
1864 * invisible traps) are interesting, and floors (and invisible traps)
1865 * are interesting sometimes (depending on various options involving
1866 * the illumination of floor grids).
1868 * The automatic memorization of all objects and non-floor terrain
1869 * features as soon as they are displayed allows incredible amounts
1870 * of optimization in various places, especially "map_info()".
1872 * Note that the memorization of objects is completely separate from
1873 * the memorization of terrain features, preventing annoying floor
1874 * memorization when a detected object is picked up from a dark floor,
1875 * and object memorization when an object is dropped into a floor grid
1876 * which is memorized but out-of-sight.
1878 * This function should be called every time the "memorization" of
1879 * a grid (or the object in a grid) is called into question, such
1880 * as when an object is created in a grid, when a terrain feature
1881 * "changes" from "floor" to "non-floor", when any grid becomes
1882 * "illuminated" or "viewable", and when a "floor" grid becomes
1885 * Note the relatively efficient use of this function by the various
1886 * "update_view()" and "update_lite()" calls, to allow objects and
1887 * terrain features to be memorized (and drawn) whenever they become
1888 * viewable or illuminated in any way, but not when they "maintain"
1889 * or "lose" their previous viewability or illumination.
1891 * Note the butchered "internal" version of "player_can_see_bold()",
1892 * optimized primarily for the most common cases, that is, for the
1893 * non-marked floor grids.
1895 void note_spot(int y, int x)
1897 cave_type *c_ptr = &cave[y][x];
1899 s16b this_o_idx, next_o_idx = 0;
1902 /* Blind players see nothing */
1903 if (p_ptr->blind) return;
1905 /* Analyze non-torch-lit grids */
1906 if (!(c_ptr->info & (CAVE_LITE)))
1908 /* Require line of sight to the grid */
1909 if (!(c_ptr->info & (CAVE_VIEW))) return;
1911 if (p_ptr->pclass != CLASS_NINJA)
1913 /* Require "perma-lite" of the grid */
1914 if (!(c_ptr->info & (CAVE_GLOW | CAVE_MNLT))) return;
1919 /* Hack -- memorize objects */
1920 for (this_o_idx = c_ptr->o_idx; this_o_idx; this_o_idx = next_o_idx)
1922 object_type *o_ptr = &o_list[this_o_idx];
1924 /* Acquire next object */
1925 next_o_idx = o_ptr->next_o_idx;
1927 /* Memorize objects */
1928 o_ptr->marked = TRUE;
1932 /* Hack -- memorize grids */
1933 if (!(c_ptr->info & (CAVE_MARK)))
1935 if (p_ptr->pclass == CLASS_NINJA)
1937 c_ptr->info |= (CAVE_MARK);
1939 /* Handle floor grids first */
1940 if ((c_ptr->feat <= FEAT_INVIS) || (c_ptr->feat == FEAT_DIRT) || (c_ptr->feat == FEAT_GRASS))
1942 /* Option -- memorize all torch-lit floors */
1943 if (view_torch_grids && (c_ptr->info & (CAVE_LITE)))
1946 c_ptr->info |= (CAVE_MARK);
1949 /* Option -- memorize all perma-lit floors */
1950 else if (view_perma_grids && (c_ptr->info & (CAVE_GLOW)))
1953 c_ptr->info |= (CAVE_MARK);
1957 /* Memorize normal grids */
1958 else if (cave_floor_grid(c_ptr))
1961 c_ptr->info |= (CAVE_MARK);
1964 /* Memorize torch-lit walls */
1965 else if (c_ptr->info & (CAVE_LITE))
1968 c_ptr->info |= (CAVE_MARK);
1971 /* Memorize certain non-torch-lit wall grids */
1976 /* Hack -- move one grid towards player */
1977 yy = (y < py) ? (y + 1) : (y > py) ? (y - 1) : y;
1978 xx = (x < px) ? (x + 1) : (x > px) ? (x - 1) : x;
1980 /* Check for "local" illumination */
1981 if (cave[yy][xx].info & (CAVE_GLOW))
1984 c_ptr->info |= (CAVE_MARK);
1991 void display_dungeon(void)
1997 #ifdef USE_TRANSPARENCY
2000 #endif /* USE_TRANSPARENCY */
2002 for (x = px - Term->wid / 2 + 1; x <= px + Term->wid / 2; x++)
2004 for (y = py - Term->hgt / 2 + 1; y <= py + Term->hgt / 2; y++)
2006 if (in_bounds2(y, x))
2009 #ifdef USE_TRANSPARENCY
2010 /* Examine the grid */
2011 map_info(y, x, &a, &c, &ta, &tc);
2012 #else /* USE_TRANSPARENCY */
2013 /* Examine the grid */
2014 map_info(y, x, &a, &c);
2015 #endif /* USE_TRANSPARENCY */
2017 /* Hack -- fake monochrome */
2018 if (!use_graphics || streq(ANGBAND_SYS, "ibm"))
2020 if (world_monster) a = TERM_DARK;
2021 else if (p_ptr->invuln || world_player) a = TERM_WHITE;
2022 else if ((p_ptr->pclass == CLASS_BARD) && (p_ptr->magic_num1[0] == MUSIC_INVULN)) a = TERM_WHITE;
2023 else if (p_ptr->wraith_form) a = TERM_L_DARK;
2026 #ifdef USE_TRANSPARENCY
2027 /* Hack -- Queue it */
2028 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c, ta, tc);
2029 #else /* USE_TRANSPARENCY */
2030 /* Hack -- Queue it */
2031 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c);
2032 #endif /* USE_TRANSPARENCY */
2037 /* Clear out-of-bound tiles */
2039 /* Access darkness */
2040 feature_type *f_ptr = &f_info[FEAT_NONE];
2048 #ifdef USE_TRANSPARENCY
2049 /* Hack -- Queue it */
2050 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c, ta, tc);
2051 #else /* USE_TRANSPARENCY */
2052 /* Hack -- Queue it */
2053 Term_queue_char(x - px + Term->wid / 2 - 1, y - py + Term->hgt / 2 - 1, a, c);
2054 #endif /* USE_TRANSPARENCY */
2062 * Redraw (on the screen) a given MAP location
2064 * This function should only be called on "legal" grids
2066 void lite_spot(int y, int x)
2068 /* Redraw if on screen */
2069 if (panel_contains(y, x) && in_bounds2(y, x))
2074 #ifdef USE_TRANSPARENCY
2078 /* Examine the grid */
2079 map_info(y, x, &a, &c, &ta, &tc);
2080 #else /* USE_TRANSPARENCY */
2081 /* Examine the grid */
2082 map_info(y, x, &a, &c);
2083 #endif /* USE_TRANSPARENCY */
2085 /* Hack -- fake monochrome */
2086 if (!use_graphics || streq(ANGBAND_SYS, "ibm"))
2088 if (world_monster) a = TERM_DARK;
2089 else if (p_ptr->invuln || world_player) a = TERM_WHITE;
2090 else if ((p_ptr->pclass == CLASS_BARD) && (p_ptr->magic_num1[0] == MUSIC_INVULN)) a = TERM_WHITE;
2091 else if (p_ptr->wraith_form) a = TERM_L_DARK;
2095 if (use_bigtile && !(a & 0x80) && (isprint(c) || c == 127))
2097 /* Term_queue_chars ¤ÏÁ´³ÑASCIIÃÏ·Á¤òÀµ¤·¤¯update¤¹¤ë¡£ */
2098 Term_queue_chars(panel_col_of(x), y-panel_row_prt, 2, a, &ascii_to_zenkaku[2*(c-' ')]);
2103 #ifdef USE_TRANSPARENCY
2104 /* Hack -- Queue it */
2105 Term_queue_char(panel_col_of(x), y-panel_row_prt, a, c, ta, tc);
2107 Term_queue_char(panel_col_of(x)+1, y-panel_row_prt, 255, -1, 0, 0);
2108 #else /* USE_TRANSPARENCY */
2109 /* Hack -- Queue it */
2110 Term_queue_char(panel_col_of(x), y-panel_row_prt, a, c);
2112 Term_queue_char(panel_col_of(x)+1, y-panel_row_prt, 255, -1);
2113 #endif /* USE_TRANSPARENCY */
2119 * Prints the map of the dungeon
2121 * Note that, for efficiency, we contain an "optimized" version
2122 * of both "lite_spot()" and "print_rel()", and that we use the
2123 * "lite_spot()" function to display the player grid, if needed.
2131 s16b xmin, xmax, ymin, ymax;
2135 bool fake_monochrome = (!use_graphics || streq(ANGBAND_SYS, "ibm"));
2138 Term_get_size(&wid, &hgt);
2140 /* Remove map offset */
2144 /* Access the cursor state */
2145 (void)Term_get_cursor(&v);
2147 /* Hide the cursor */
2148 (void)Term_set_cursor(0);
2151 xmin = (0 < panel_col_min) ? panel_col_min : 0;
2152 xmax = (cur_wid - 1 > panel_col_max) ? panel_col_max : cur_wid - 1;
2153 ymin = (0 < panel_row_min) ? panel_row_min : 0;
2154 ymax = (cur_hgt - 1 > panel_row_max) ? panel_row_max : cur_hgt - 1;
2156 /* Bottom section of screen */
2157 for (y = 1; y <= ymin - panel_row_prt; y++)
2159 /* Erase the section */
2160 Term_erase(COL_MAP, y, wid);
2163 /* Top section of screen */
2164 for (y = ymax - panel_row_prt; y <= hgt; y++)
2166 /* Erase the section */
2167 Term_erase(COL_MAP, y, wid);
2171 for (y = ymin; y <= ymax; y++)
2173 /* Scan the columns of row "y" */
2174 for (x = xmin; x <= xmax; x++)
2179 #ifdef USE_TRANSPARENCY
2183 /* Determine what is there */
2184 map_info(y, x, &a, &c, &ta, &tc);
2186 /* Determine what is there */
2187 map_info(y, x, &a, &c);
2190 /* Hack -- fake monochrome */
2191 if (fake_monochrome)
2193 if (world_monster) a = TERM_DARK;
2194 else if (p_ptr->invuln || world_player) a = TERM_WHITE;
2195 else if ((p_ptr->pclass == CLASS_BARD) && (p_ptr->magic_num1[0] == MUSIC_INVULN)) a = TERM_WHITE;
2196 else if (p_ptr->wraith_form) a = TERM_L_DARK;
2199 if (use_bigtile) bigtile_attr(&c, &a, &c2, &a2);
2201 /* Efficiency -- Redraw that grid of the map */
2202 #ifdef USE_TRANSPARENCY
2203 Term_queue_char(panel_col_of(x), y-panel_row_prt, a, c, ta, tc);
2204 if (use_bigtile) Term_queue_char(panel_col_of(x)+1, y-panel_row_prt, a2, c2, 0, 0);
2206 Term_queue_char(panel_col_of(x), y-panel_row_prt, a, c);
2207 if (use_bigtile) Term_queue_char(panel_col_of(x)+1, y-panel_row_prt, a2, c2);
2212 /* Display player */
2215 /* Restore the cursor */
2216 (void)Term_set_cursor(v);
2222 * print project path
2224 void prt_path(int y, int x)
2229 int default_color = TERM_SLATE;
2230 bool fake_monochrome = (!use_graphics || streq(ANGBAND_SYS, "ibm"));
2232 if (!display_path) return;
2233 if (-1 == project_length)
2236 /* Get projection path */
2237 path_n = project_path(path_g, (project_length ? project_length : MAX_RANGE), py, px, y, x, PROJECT_PATH|PROJECT_THRU);
2240 p_ptr->redraw |= (PR_MAP);
2246 for (i = 0; i < path_n; i++)
2248 int ny = GRID_Y(path_g[i]);
2249 int nx = GRID_X(path_g[i]);
2251 if (panel_contains(ny, nx))
2253 byte a2, a = default_color;
2256 #ifdef USE_TRANSPARENCY
2261 if (cave[ny][nx].m_idx && m_list[cave[ny][nx].m_idx].ml)
2263 /* Determine what is there */
2264 #ifdef USE_TRANSPARENCY
2265 map_info(ny, nx, &a, &c, &ta, &tc);
2267 map_info(ny, nx, &a, &c);
2271 else if (c == '.' && (a == TERM_WHITE || a == TERM_L_WHITE))
2273 else if (a == default_color)
2277 if (fake_monochrome)
2279 if (world_monster) a = TERM_DARK;
2280 else if (p_ptr->invuln || world_player) a = TERM_WHITE;
2281 else if ((p_ptr->pclass == CLASS_BARD) && (p_ptr->magic_num1[0] == MUSIC_INVULN)) a = TERM_WHITE;
2282 else if (p_ptr->wraith_form) a = TERM_L_DARK;
2286 if (use_bigtile) bigtile_attr(&c, &a, &c2, &a2);
2288 /* Hack -- Queue it */
2289 #ifdef USE_TRANSPARENCY
2290 Term_queue_char(panel_col_of(nx), ny-panel_row_prt, a, c, ta, tc);
2291 if (use_bigtile) Term_queue_char(panel_col_of(nx)+1, ny-panel_row_prt, a, c2, 0, 0);
2293 Term_queue_char(panel_col_of(nx), ny-panel_row_prt, a, c);
2294 if (use_bigtile) Term_queue_char(panel_col_of(nx)+1, ny-panel_row_prt, a, c2);
2299 if ((cave[ny][nx].info & CAVE_MARK) && !cave_floor_bold(ny, nx)) break;
2302 if (nx == x && ny == y) default_color = TERM_L_DARK;
2307 static cptr simplify_list[][2] =
2314 {"^Amulet of ", "\""},
2315 {"^Scroll of ", "?"},
2316 {"^Scroll titled ", "?"},
2317 {"^Wand of " , "-"},
2319 {"^Staff of " , "_"},
2320 {"^Potion of ", "!"},
2332 static void display_shortened_item_name(object_type *o_ptr, int y)
2339 object_desc(buf, o_ptr, FALSE, 0);
2340 attr = tval_to_attr[o_ptr->tval % 128];
2346 strcpy(buf, "²¿¤«´ñ̯¤Êʪ");
2348 strcpy(buf, "something strange");
2352 for (c = buf; *c; c++)
2355 for (i = 0; simplify_list[i][1]; i++)
2357 cptr org_w = simplify_list[i][0];
2367 if (!strncmp(c, org_w, strlen(org_w)))
2370 cptr tmp = simplify_list[i][1];
2373 tmp = c + strlen(org_w);
2383 /* Ⱦ³Ñ 12 ʸ»úʬ¤ÇÀÚ¤ë */
2389 if(len + 2 > 12) break;
2396 if(len + 1 > 12) break;
2402 Term_putstr(0, y, 12, attr, buf);
2406 * Display a "small-scale" map of the dungeon in the active Term
2408 void display_map(int *cy, int *cx)
2425 /* Save lighting effects */
2426 bool old_view_special_lite = view_special_lite;
2427 bool old_view_granite_lite = view_granite_lite;
2429 bool fake_monochrome = (!use_graphics || streq(ANGBAND_SYS, "ibm"));
2431 int hgt, wid, yrat, xrat;
2433 int **match_autopick_yx;
2434 object_type ***object_autopick_yx;
2437 Term_get_size(&wid, &hgt);
2440 if (use_bigtile) wid /= 2;
2442 yrat = (cur_hgt + hgt - 1) / hgt;
2443 xrat = (cur_wid + wid - 1) / wid;
2445 /* Disable lighting effects */
2446 view_special_lite = FALSE;
2447 view_granite_lite = FALSE;
2449 /* Allocate the maps */
2450 C_MAKE(ma, (hgt + 2), byte_ptr);
2451 C_MAKE(mc, (hgt + 2), char_ptr);
2452 C_MAKE(mp, (hgt + 2), byte_ptr);
2453 C_MAKE(match_autopick_yx, (hgt + 2), sint_ptr);
2454 C_MAKE(object_autopick_yx, (hgt + 2), object_type **);
2456 /* Allocate and wipe each line map */
2457 for (y = 0; y < (hgt + 2); y++)
2459 /* Allocate one row each array */
2460 C_MAKE(ma[y], (wid + 2), byte);
2461 C_MAKE(mc[y], (wid + 2), char);
2462 C_MAKE(mp[y], (wid + 2), byte);
2463 C_MAKE(match_autopick_yx[y], (wid + 2), int);
2464 C_MAKE(object_autopick_yx[y], (wid + 2), object_type *);
2466 for (x = 0; x < wid + 2; ++x)
2468 match_autopick_yx[y][x] = -1;
2469 object_autopick_yx[y][x] = NULL;
2472 ma[y][x] = TERM_WHITE;
2480 /* Allocate the maps */
2481 C_MAKE(bigma, (cur_hgt + 2), byte_ptr);
2482 C_MAKE(bigmc, (cur_hgt + 2), char_ptr);
2483 C_MAKE(bigmp, (cur_hgt + 2), byte_ptr);
2485 /* Allocate and wipe each line map */
2486 for (y = 0; y < (cur_hgt + 2); y++)
2488 /* Allocate one row each array */
2489 C_MAKE(bigma[y], (cur_wid + 2), byte);
2490 C_MAKE(bigmc[y], (cur_wid + 2), char);
2491 C_MAKE(bigmp[y], (cur_wid + 2), byte);
2493 for (x = 0; x < cur_wid + 2; ++x)
2496 bigma[y][x] = TERM_WHITE;
2504 /* Fill in the map */
2505 for (i = 0; i < cur_wid; ++i)
2507 for (j = 0; j < cur_hgt; ++j)
2517 /* Extract the current attr/char at that map location */
2518 #ifdef USE_TRANSPARENCY
2519 map_info(j, i, &ta, &tc, &ta, &tc);
2520 #else /* USE_TRANSPARENCY */
2521 map_info(j, i, &ta, &tc);
2522 #endif /* USE_TRANSPARENCY */
2524 /* Extract the priority */
2527 if(match_autopick!=-1
2528 && (match_autopick_yx[y][x] == -1
2529 || match_autopick_yx[y][x] > match_autopick))
2531 match_autopick_yx[y][x] = match_autopick;
2532 object_autopick_yx[y][x] = autopick_obj;
2536 /* Save the char, attr and priority */
2537 bigmc[j+1][i+1] = tc;
2538 bigma[j+1][i+1] = ta;
2539 bigmp[j+1][i+1] = tp;
2543 for (j = 0; j < cur_hgt; ++j)
2545 for (i = 0; i < cur_wid; ++i)
2551 tc = bigmc[j+1][i+1];
2552 ta = bigma[j+1][i+1];
2553 tp = bigmp[j+1][i+1];
2555 /* rare feature has more priority */
2561 for (t = 0; t < 8; t++)
2563 if (tc == bigmc[j+1+ddy_cdd[t]][i+1+ddx_cdd[t]] &&
2564 ta == bigma[j+1+ddy_cdd[t]][i+1+ddx_cdd[t]])
2574 /* Save the char, attr and priority */
2587 /* Draw the corners */
2588 mc[0][0] = mc[0][x] = mc[y][0] = mc[y][x] = '+';
2590 /* Draw the horizontal edges */
2591 for (x = 1; x <= wid; x++) mc[0][x] = mc[y][x] = '-';
2593 /* Draw the vertical edges */
2594 for (y = 1; y <= hgt; y++) mc[y][0] = mc[y][x] = '|';
2597 /* Display each map line in order */
2598 for (y = 0; y < hgt + 2; ++y)
2600 /* Start a new line */
2601 Term_gotoxy(COL_MAP, y);
2603 /* Display the line */
2604 for (x = 0; x < wid + 2; ++x)
2609 /* Hack -- fake monochrome */
2610 if (fake_monochrome)
2612 if (world_monster) ta = TERM_DARK;
2613 else if (p_ptr->invuln || world_player) ta = TERM_WHITE;
2614 else if ((p_ptr->pclass == CLASS_BARD) && (p_ptr->magic_num1[0] == MUSIC_INVULN)) ta = TERM_WHITE;
2615 else if (p_ptr->wraith_form) ta = TERM_L_DARK;
2618 if (use_bigtile) bigtile_attr(&tc, &ta, &c2, &a2);
2620 /* Add the character */
2622 if (use_bigtile) Term_addch(a2, c2);
2627 for (y = 1; y < hgt + 1; ++y)
2629 match_autopick = -1;
2630 for (x = 1; x <= wid; x++){
2631 if (match_autopick_yx[y][x] != -1 &&
2632 (match_autopick > match_autopick_yx[y][x] ||
2633 match_autopick == -1)){
2634 match_autopick = match_autopick_yx[y][x];
2635 autopick_obj = object_autopick_yx[y][x];
2639 /* Clear old display */
2640 Term_putstr(0, y, 12, 0, " ");
2642 if (match_autopick != -1)
2644 display_shortened_item_name(autopick_obj, y);
2647 char buf[13] = "\0";
2648 strncpy(buf,autopick_list[match_autopick].name,12);
2656 /* Player location */
2657 (*cy) = py / yrat + 1 + ROW_MAP;
2659 (*cx) = px / xrat + 1 + COL_MAP;
2661 (*cx) = (px / xrat + 1) * 2 + COL_MAP;
2663 /* Restore lighting effects */
2664 view_special_lite = old_view_special_lite;
2665 view_granite_lite = old_view_granite_lite;
2667 /* Free each line map */
2668 for (y = 0; y < (hgt + 2); y++)
2670 /* Free one row each array */
2671 C_FREE(ma[y], (wid + 2), byte);
2672 C_FREE(mc[y], (wid + 2), char);
2673 C_FREE(mp[y], (wid + 2), byte);
2674 C_FREE(match_autopick_yx[y], (wid + 2), int);
2675 C_FREE(object_autopick_yx[y], (wid + 2), object_type **);
2678 /* Free each line map */
2679 C_FREE(ma, (hgt + 2), byte_ptr);
2680 C_FREE(mc, (hgt + 2), char_ptr);
2681 C_FREE(mp, (hgt + 2), byte_ptr);
2682 C_FREE(match_autopick_yx, (hgt + 2), sint_ptr);
2683 C_FREE(object_autopick_yx, (hgt + 2), object_type **);
2685 /* Free each line map */
2686 for (y = 0; y < (cur_hgt + 2); y++)
2688 /* Free one row each array */
2689 C_FREE(bigma[y], (cur_wid + 2), byte);
2690 C_FREE(bigmc[y], (cur_wid + 2), char);
2691 C_FREE(bigmp[y], (cur_wid + 2), byte);
2694 /* Free each line map */
2695 C_FREE(bigma, (cur_hgt + 2), byte_ptr);
2696 C_FREE(bigmc, (cur_hgt + 2), char_ptr);
2697 C_FREE(bigmp, (cur_hgt + 2), byte_ptr);
2702 * Display a "small-scale" map of the dungeon for the player
2704 * Currently, the "player" is displayed on the map. XXX XXX XXX
2706 void do_cmd_view_map(void)
2711 /* Save the screen */
2716 prt("¤ªÂÔ¤Á²¼¤µ¤¤...", 0, 0);
2718 prt("Please wait...", 0, 0);
2724 /* Clear the screen */
2727 display_autopick = 0;
2729 /* Display the map */
2730 display_map(&cy, &cx);
2733 if(max_autopick && !p_ptr->wild_mode)
2735 display_autopick = ITEM_DISPLAY;
2742 int wid, hgt, row_message;
2744 Term_get_size(&wid, &hgt);
2745 row_message = hgt - 1;
2748 put_str("²¿¤«¥¡¼¤ò²¡¤·¤Æ¤¯¤À¤µ¤¤('M':½¦¤¦ 'N':ÊüÃÖ 'D':M+N 'K':²õ¤¹¥¢¥¤¥Æ¥à¤òɽ¼¨)", row_message, 1);
2750 put_str(" Hit M, N(for ~), K(for !), or D(same as M+N) to display auto-picker items.", row_message, 1);
2753 /* Hilite the player */
2754 move_cursor(cy, cx);
2761 flag = DONT_AUTOPICK;
2763 flag = DO_AUTODESTROY;
2765 flag = (DO_AUTOPICK | DONT_AUTOPICK);
2771 if (~display_autopick & flag)
2772 display_autopick |= flag;
2774 display_autopick &= ~flag;
2775 /* Display the map */
2776 display_map(&cy, &cx);
2779 display_autopick = 0;
2785 put_str("²¿¤«¥¡¼¤ò²¡¤¹¤È¥²¡¼¥à¤ËÌá¤ê¤Þ¤¹", 23, 30);
2787 put_str("Hit any key to continue", 23, 30);
2788 #endif /* Hilite the player */
2789 move_cursor(cy, cx);
2794 /* Restore the screen */
2803 * Some comments on the cave grid flags. -BEN-
2806 * One of the major bottlenecks in previous versions of Angband was in
2807 * the calculation of "line of sight" from the player to various grids,
2808 * such as monsters. This was such a nasty bottleneck that a lot of
2809 * silly things were done to reduce the dependancy on "line of sight",
2810 * for example, you could not "see" any grids in a lit room until you
2811 * actually entered the room, and there were all kinds of bizarre grid
2812 * flags to enable this behavior. This is also why the "call light"
2813 * spells always lit an entire room.
2815 * The code below provides functions to calculate the "field of view"
2816 * for the player, which, once calculated, provides extremely fast
2817 * calculation of "line of sight from the player", and to calculate
2818 * the "field of torch lite", which, again, once calculated, provides
2819 * extremely fast calculation of "which grids are lit by the player's
2820 * lite source". In addition to marking grids as "GRID_VIEW" and/or
2821 * "GRID_LITE", as appropriate, these functions maintain an array for
2822 * each of these two flags, each array containing the locations of all
2823 * of the grids marked with the appropriate flag, which can be used to
2824 * very quickly scan through all of the grids in a given set.
2826 * To allow more "semantically valid" field of view semantics, whenever
2827 * the field of view (or the set of torch lit grids) changes, all of the
2828 * grids in the field of view (or the set of torch lit grids) are "drawn"
2829 * so that changes in the world will become apparent as soon as possible.
2830 * This has been optimized so that only grids which actually "change" are
2831 * redrawn, using the "temp" array and the "GRID_TEMP" flag to keep track
2832 * of the grids which are entering or leaving the relevent set of grids.
2834 * These new methods are so efficient that the old nasty code was removed.
2836 * Note that there is no reason to "update" the "viewable space" unless
2837 * the player "moves", or walls/doors are created/destroyed, and there
2838 * is no reason to "update" the "torch lit grids" unless the field of
2839 * view changes, or the "light radius" changes. This means that when
2840 * the player is resting, or digging, or doing anything that does not
2841 * involve movement or changing the state of the dungeon, there is no
2842 * need to update the "view" or the "lite" regions, which is nice.
2844 * Note that the calls to the nasty "los()" function have been reduced
2845 * to a bare minimum by the use of the new "field of view" calculations.
2847 * I wouldn't be surprised if slight modifications to the "update_view()"
2848 * function would allow us to determine "reverse line-of-sight" as well
2849 * as "normal line-of-sight", which would allow monsters to use a more
2850 * "correct" calculation to determine if they can "see" the player. For
2851 * now, monsters simply "cheat" somewhat and assume that if the player
2852 * has "line of sight" to the monster, then the monster can "pretend"
2853 * that it has "line of sight" to the player.
2856 * The "update_lite()" function maintains the "CAVE_LITE" flag for each
2857 * grid and maintains an array of all "CAVE_LITE" grids.
2859 * This set of grids is the complete set of all grids which are lit by
2860 * the players light source, which allows the "player_can_see_bold()"
2861 * function to work very quickly.
2863 * Note that every "CAVE_LITE" grid is also a "CAVE_VIEW" grid, and in
2864 * fact, the player (unless blind) can always "see" all grids which are
2865 * marked as "CAVE_LITE", unless they are "off screen".
2868 * The "update_view()" function maintains the "CAVE_VIEW" flag for each
2869 * grid and maintains an array of all "CAVE_VIEW" grids.
2871 * This set of grids is the complete set of all grids within line of sight
2872 * of the player, allowing the "player_has_los_bold()" macro to work very
2876 * The current "update_view()" algorithm uses the "CAVE_XTRA" flag as a
2877 * temporary internal flag to mark those grids which are not only in view,
2878 * but which are also "easily" in line of sight of the player. This flag
2879 * is always cleared when we are done.
2882 * The current "update_lite()" and "update_view()" algorithms use the
2883 * "CAVE_TEMP" flag, and the array of grids which are marked as "CAVE_TEMP",
2884 * to keep track of which grids were previously marked as "CAVE_LITE" or
2885 * "CAVE_VIEW", which allows us to optimize the "screen updates".
2887 * The "CAVE_TEMP" flag, and the array of "CAVE_TEMP" grids, is also used
2888 * for various other purposes, such as spreading lite or darkness during
2889 * "lite_room()" / "unlite_room()", and for calculating monster flow.
2892 * Any grid can be marked as "CAVE_GLOW" which means that the grid itself is
2893 * in some way permanently lit. However, for the player to "see" anything
2894 * in the grid, as determined by "player_can_see()", the player must not be
2895 * blind, the grid must be marked as "CAVE_VIEW", and, in addition, "wall"
2896 * grids, even if marked as "perma lit", are only illuminated if they touch
2897 * a grid which is not a wall and is marked both "CAVE_GLOW" and "CAVE_VIEW".
2900 * To simplify various things, a grid may be marked as "CAVE_MARK", meaning
2901 * that even if the player cannot "see" the grid, he "knows" the terrain in
2902 * that grid. This is used to "remember" walls/doors/stairs/floors when they
2903 * are "seen" or "detected", and also to "memorize" floors, after "wiz_lite()",
2904 * or when one of the "memorize floor grids" options induces memorization.
2906 * Objects are "memorized" in a different way, using a special "marked" flag
2907 * on the object itself, which is set when an object is observed or detected.
2910 * A grid may be marked as "CAVE_ROOM" which means that it is part of a "room",
2911 * and should be illuminated by "lite room" and "darkness" spells.
2914 * A grid may be marked as "CAVE_ICKY" which means it is part of a "vault",
2915 * and should be unavailable for "teleportation" destinations.
2918 * The "view_perma_grids" allows the player to "memorize" every perma-lit grid
2919 * which is observed, and the "view_torch_grids" allows the player to memorize
2920 * every torch-lit grid. The player will always memorize important walls,
2921 * doors, stairs, and other terrain features, as well as any "detected" grids.
2923 * Note that the new "update_view()" method allows, among other things, a room
2924 * to be "partially" seen as the player approaches it, with a growing cone of
2925 * floor appearing as the player gets closer to the door. Also, by not turning
2926 * on the "memorize perma-lit grids" option, the player will only "see" those
2927 * floor grids which are actually in line of sight.
2929 * And my favorite "plus" is that you can now use a special option to draw the
2930 * "floors" in the "viewable region" brightly (actually, to draw the *other*
2931 * grids dimly), providing a "pretty" effect as the player runs around, and
2932 * to efficiently display the "torch lite" in a special color.
2935 * Some comments on the "update_view()" algorithm...
2937 * The algorithm is very fast, since it spreads "obvious" grids very quickly,
2938 * and only has to call "los()" on the borderline cases. The major axes/diags
2939 * even terminate early when they hit walls. I need to find a quick way
2940 * to "terminate" the other scans.
2942 * Note that in the worst case (a big empty area with say 5% scattered walls),
2943 * each of the 1500 or so nearby grids is checked once, most of them getting
2944 * an "instant" rating, and only a small portion requiring a call to "los()".
2946 * The only time that the algorithm appears to be "noticeably" too slow is
2947 * when running, and this is usually only important in town, since the town
2948 * provides about the worst scenario possible, with large open regions and
2949 * a few scattered obstructions. There is a special "efficiency" option to
2950 * allow the player to reduce his field of view in town, if needed.
2952 * In the "best" case (say, a normal stretch of corridor), the algorithm
2953 * makes one check for each viewable grid, and makes no calls to "los()".
2954 * So running in corridors is very fast, and if a lot of monsters are
2955 * nearby, it is much faster than the old methods.
2957 * Note that resting, most normal commands, and several forms of running,
2958 * plus all commands executed near large groups of monsters, are strictly
2959 * more efficient with "update_view()" that with the old "compute los() on
2960 * demand" method, primarily because once the "field of view" has been
2961 * calculated, it does not have to be recalculated until the player moves
2962 * (or a wall or door is created or destroyed).
2964 * Note that we no longer have to do as many "los()" checks, since once the
2965 * "view" region has been built, very few things cause it to be "changed"
2966 * (player movement, and the opening/closing of doors, changes in wall status).
2967 * Note that door/wall changes are only relevant when the door/wall itself is
2968 * in the "view" region.
2970 * The algorithm seems to only call "los()" from zero to ten times, usually
2971 * only when coming down a corridor into a room, or standing in a room, just
2972 * misaligned with a corridor. So if, say, there are five "nearby" monsters,
2973 * we will be reducing the calls to "los()".
2975 * I am thinking in terms of an algorithm that "walks" from the central point
2976 * out to the maximal "distance", at each point, determining the "view" code
2977 * (above). For each grid not on a major axis or diagonal, the "view" code
2978 * depends on the "cave_floor_bold()" and "view" of exactly two other grids
2979 * (the one along the nearest diagonal, and the one next to that one, see
2980 * "update_view_aux()"...).
2982 * We "memorize" the viewable space array, so that at the cost of under 3000
2983 * bytes, we reduce the time taken by "forget_view()" to one assignment for
2984 * each grid actually in the "viewable space". And for another 3000 bytes,
2985 * we prevent "erase + redraw" ineffiencies via the "seen" set. These bytes
2986 * are also used by other routines, thus reducing the cost to almost nothing.
2988 * A similar thing is done for "forget_lite()" in which case the savings are
2989 * much less, but save us from doing bizarre maintenance checking.
2991 * In the worst "normal" case (in the middle of the town), the reachable space
2992 * actually reaches to more than half of the largest possible "circle" of view,
2993 * or about 800 grids, and in the worse case (in the middle of a dungeon level
2994 * where all the walls have been removed), the reachable space actually reaches
2995 * the theoretical maximum size of just under 1500 grids.
2997 * Each grid G examines the "state" of two (?) other (adjacent) grids, G1 & G2.
2998 * If G1 is lite, G is lite. Else if G2 is lite, G is half. Else if G1 and G2
2999 * are both half, G is half. Else G is dark. It only takes 2 (or 4) bits to
3000 * "name" a grid, so (for MAX_RAD of 20) we could use 1600 bytes, and scan the
3001 * entire possible space (including initialization) in one step per grid. If
3002 * we do the "clearing" as a separate step (and use an array of "view" grids),
3003 * then the clearing will take as many steps as grids that were viewed, and the
3004 * algorithm will be able to "stop" scanning at various points.
3005 * Oh, and outside of the "torch radius", only "lite" grids need to be scanned.
3016 * Actually erase the entire "lite" array, redrawing every grid
3018 void forget_lite(void)
3022 /* None to forget */
3023 if (!lite_n) return;
3025 /* Clear them all */
3026 for (i = 0; i < lite_n; i++)
3031 /* Forget "LITE" flag */
3032 cave[y][x].info &= ~(CAVE_LITE);
3046 * This macro allows us to efficiently add a grid to the "lite" array,
3047 * note that we are never called for illegal grids, or for grids which
3048 * have already been placed into the "lite" array, and we are never
3049 * called when the "lite" array is full.
3051 #define cave_lite_hack(Y,X) \
3053 if (!(cave[Y][X].info & (CAVE_LITE))) { \
3054 cave[Y][X].info |= (CAVE_LITE); \
3055 lite_y[lite_n] = (Y); \
3056 lite_x[lite_n] = (X); \
3062 * Update the set of grids "illuminated" by the player's lite.
3064 * This routine needs to use the results of "update_view()"
3066 * Note that "blindness" does NOT affect "torch lite". Be careful!
3068 * We optimize most lites (all non-artifact lites) by using "obvious"
3069 * facts about the results of "small" lite radius, and we attempt to
3070 * list the "nearby" grids before the more "distant" ones in the
3071 * array of torch-lit grids.
3073 * We assume that "radius zero" lite is in fact no lite at all.
3075 * Torch Lantern Artifacts
3085 void update_lite(void)
3087 int i, x, y, min_x, max_x, min_y, max_y;
3088 int p = p_ptr->cur_lite;
3090 /*** Special case ***/
3092 /* Hack -- Player has no lite */
3095 /* Forget the old lite */
3098 /* Draw the player */
3103 /*** Save the old "lite" grids for later ***/
3105 /* Clear them all */
3106 for (i = 0; i < lite_n; i++)
3111 /* Mark the grid as not "lite" */
3112 cave[y][x].info &= ~(CAVE_LITE);
3114 /* Mark the grid as "seen" */
3115 cave[y][x].info |= (CAVE_TEMP);
3117 /* Add it to the "seen" set */
3127 /*** Collect the new "lite" grids ***/
3129 /* Radius 1 -- torch radius */
3133 cave_lite_hack(py, px);
3136 cave_lite_hack(py+1, px);
3137 cave_lite_hack(py-1, px);
3138 cave_lite_hack(py, px+1);
3139 cave_lite_hack(py, px-1);
3141 /* Diagonal grids */
3142 cave_lite_hack(py+1, px+1);
3143 cave_lite_hack(py+1, px-1);
3144 cave_lite_hack(py-1, px+1);
3145 cave_lite_hack(py-1, px-1);
3148 /* Radius 2 -- lantern radius */
3151 /* South of the player */
3152 if (cave_floor_bold(py+1, px))
3154 cave_lite_hack(py+2, px);
3155 cave_lite_hack(py+2, px+1);
3156 cave_lite_hack(py+2, px-1);
3159 /* North of the player */
3160 if (cave_floor_bold(py-1, px))
3162 cave_lite_hack(py-2, px);
3163 cave_lite_hack(py-2, px+1);
3164 cave_lite_hack(py-2, px-1);
3167 /* East of the player */
3168 if (cave_floor_bold(py, px+1))
3170 cave_lite_hack(py, px+2);
3171 cave_lite_hack(py+1, px+2);
3172 cave_lite_hack(py-1, px+2);
3175 /* West of the player */
3176 if (cave_floor_bold(py, px-1))
3178 cave_lite_hack(py, px-2);
3179 cave_lite_hack(py+1, px-2);
3180 cave_lite_hack(py-1, px-2);
3184 /* Radius 3+ -- artifact radius */
3189 /* Paranoia -- see "LITE_MAX" */
3192 /* South-East of the player */
3193 if (cave_floor_bold(py+1, px+1))
3195 cave_lite_hack(py+2, px+2);
3198 /* South-West of the player */
3199 if (cave_floor_bold(py+1, px-1))
3201 cave_lite_hack(py+2, px-2);
3204 /* North-East of the player */
3205 if (cave_floor_bold(py-1, px+1))
3207 cave_lite_hack(py-2, px+2);
3210 /* North-West of the player */
3211 if (cave_floor_bold(py-1, px-1))
3213 cave_lite_hack(py-2, px-2);
3218 if (min_y < 0) min_y = 0;
3222 if (max_y > cur_hgt-1) max_y = cur_hgt-1;
3226 if (min_x < 0) min_x = 0;
3230 if (max_x > cur_wid-1) max_x = cur_wid-1;
3232 /* Scan the maximal box */
3233 for (y = min_y; y <= max_y; y++)
3235 for (x = min_x; x <= max_x; x++)
3237 int dy = (py > y) ? (py - y) : (y - py);
3238 int dx = (px > x) ? (px - x) : (x - px);
3240 /* Skip the "central" grids (above) */
3241 if ((dy <= 2) && (dx <= 2)) continue;
3243 /* Hack -- approximate the distance */
3244 d = (dy > dx) ? (dy + (dx>>1)) : (dx + (dy>>1));
3246 /* Skip distant grids */
3247 if (d > p) continue;
3249 /* Viewable, nearby, grids get "torch lit" */
3250 if (player_has_los_bold(y, x))
3252 /* This grid is "torch lit" */
3253 cave_lite_hack(y, x);
3260 /*** Complete the algorithm ***/
3262 /* Draw the new grids */
3263 for (i = 0; i < lite_n; i++)
3268 /* Update fresh grids */
3269 if (cave[y][x].info & (CAVE_TEMP)) continue;
3278 /* Clear them all */
3279 for (i = 0; i < temp_n; i++)
3284 /* No longer in the array */
3285 cave[y][x].info &= ~(CAVE_TEMP);
3287 /* Update stale grids */
3288 if (cave[y][x].info & (CAVE_LITE)) continue;
3299 static bool mon_invis;
3302 * Add a square to the changes array
3304 static void mon_lite_hack(int y, int x)
3309 if (!in_bounds2(y, x)) return;
3311 c_ptr = &cave[y][x];
3313 /* Want a unlit square in view of the player */
3314 if ((c_ptr->info & (CAVE_MNLT | CAVE_VIEW)) != CAVE_VIEW) return;
3316 /* Hack XXX XXX - Is it a wall and monster not in LOS? */
3317 if (!cave_floor_grid(c_ptr) && mon_invis) return;
3319 /* Save this square */
3320 if (temp_n < TEMP_MAX)
3328 c_ptr->info |= CAVE_MNLT;
3335 * Update squares illuminated by monsters.
3337 * Hack - use the CAVE_ROOM flag (renamed to be CAVE_MNLT) to
3338 * denote squares illuminated by monsters.
3340 * The CAVE_TEMP flag is used to store the state during the
3341 * updating. Only squares in view of the player, whos state
3342 * changes are drawn via lite_spot().
3344 void update_mon_lite(void)
3353 /* Clear all monster lit squares */
3354 for (i = 0; i < mon_lite_n; i++)
3357 c_ptr = &cave[mon_lite_y[i]][mon_lite_x[i]];
3360 c_ptr->info |= (CAVE_TEMP);
3362 /* Clear monster illumination flag */
3363 c_ptr->info &= ~(CAVE_MNLT);
3366 /* Empty temp list of new squares to lite up */
3369 /* Loop through monsters, adding newly lit squares to changes list */
3370 for (i = 1; i < m_max; i++)
3372 monster_type *m_ptr = &m_list[i];
3373 monster_race *r_ptr = &r_info[m_ptr->r_idx];
3375 /* Skip dead monsters */
3376 if (!m_ptr->r_idx) continue;
3378 /* Is it too far away? */
3379 if (m_ptr->cdis > ((d_info[dungeon_type].flags1 & DF1_DARKNESS) ? MAX_SIGHT / 2 + 1 : MAX_SIGHT + 3)) continue;
3381 /* Get lite radius */
3384 /* Note the radii are cumulative */
3385 if (r_ptr->flags7 & (RF7_HAS_LITE_1 | RF7_SELF_LITE_1)) rad++;
3386 if (r_ptr->flags7 & (RF7_HAS_LITE_2 | RF7_SELF_LITE_2)) rad += 2;
3388 /* Exit if has no light */
3390 if (!(r_ptr->flags7 & (RF7_SELF_LITE_1 | RF7_SELF_LITE_2)) && (m_ptr->csleep || (!dun_level && is_daytime()) || p_ptr->inside_battle)) continue;
3392 if (world_monster) continue;
3394 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) rad = 1;
3396 /* Access the location */
3400 /* Is the monster visible? */
3401 mon_invis = !(cave[fy][fx].info & CAVE_VIEW);
3403 /* The square it is on */
3404 mon_lite_hack(fy, fx);
3406 /* Adjacent squares */
3407 mon_lite_hack(fy + 1, fx);
3408 mon_lite_hack(fy - 1, fx);
3409 mon_lite_hack(fy, fx + 1);
3410 mon_lite_hack(fy, fx - 1);
3411 mon_lite_hack(fy + 1, fx + 1);
3412 mon_lite_hack(fy + 1, fx - 1);
3413 mon_lite_hack(fy - 1, fx + 1);
3414 mon_lite_hack(fy - 1, fx - 1);
3419 /* South of the monster */
3420 if (cave_floor_bold(fy + 1, fx))
3422 mon_lite_hack(fy + 2, fx + 1);
3423 mon_lite_hack(fy + 2, fx);
3424 mon_lite_hack(fy + 2, fx - 1);
3426 c_ptr = &cave[fy + 2][fx];
3429 if ((rad == 3) && cave_floor_grid(c_ptr))
3431 mon_lite_hack(fy + 3, fx + 1);
3432 mon_lite_hack(fy + 3, fx);
3433 mon_lite_hack(fy + 3, fx - 1);
3437 /* North of the monster */
3438 if (cave_floor_bold(fy - 1, fx))
3440 mon_lite_hack(fy - 2, fx + 1);
3441 mon_lite_hack(fy - 2, fx);
3442 mon_lite_hack(fy - 2, fx - 1);
3444 c_ptr = &cave[fy - 2][fx];
3447 if ((rad == 3) && cave_floor_grid(c_ptr))
3449 mon_lite_hack(fy - 3, fx + 1);
3450 mon_lite_hack(fy - 3, fx);
3451 mon_lite_hack(fy - 3, fx - 1);
3455 /* East of the monster */
3456 if (cave_floor_bold(fy, fx + 1))
3458 mon_lite_hack(fy + 1, fx + 2);
3459 mon_lite_hack(fy, fx + 2);
3460 mon_lite_hack(fy - 1, fx + 2);
3462 c_ptr = &cave[fy][fx + 2];
3465 if ((rad == 3) && cave_floor_grid(c_ptr))
3467 mon_lite_hack(fy + 1, fx + 3);
3468 mon_lite_hack(fy, fx + 3);
3469 mon_lite_hack(fy - 1, fx + 3);
3473 /* West of the monster */
3474 if (cave_floor_bold(fy, fx - 1))
3476 mon_lite_hack(fy + 1, fx - 2);
3477 mon_lite_hack(fy, fx - 2);
3478 mon_lite_hack(fy - 1, fx - 2);
3480 c_ptr = &cave[fy][fx - 2];
3483 if ((rad == 3) && cave_floor_grid(c_ptr))
3485 mon_lite_hack(fy + 1, fx - 3);
3486 mon_lite_hack(fy, fx - 3);
3487 mon_lite_hack(fy - 1, fx - 3);
3495 /* South-East of the monster */
3496 if (cave_floor_bold(fy + 1, fx + 1))
3498 mon_lite_hack(fy + 2, fx + 2);
3501 /* South-West of the monster */
3502 if (cave_floor_bold(fy + 1, fx - 1))
3504 mon_lite_hack(fy + 2, fx - 2);
3507 /* North-East of the monster */
3508 if (cave_floor_bold(fy - 1, fx + 1))
3510 mon_lite_hack(fy - 2, fx + 2);
3513 /* North-West of the monster */
3514 if (cave_floor_bold(fy - 1, fx - 1))
3516 mon_lite_hack(fy - 2, fx - 2);
3521 /* Save end of list of new squares */
3525 * Look at old set flags to see if there are any changes.
3527 for (i = 0; i < mon_lite_n; i++)
3532 if (!in_bounds2(fy, fx)) continue;
3535 c_ptr = &cave[fy][fx];
3537 /* It it no longer lit? */
3538 if (!(c_ptr->info & CAVE_MNLT) && player_has_los_grid(c_ptr))
3540 /* It is now unlit */
3545 /* Add to end of temp array */
3546 temp_x[temp_n] = (byte)fx;
3547 temp_y[temp_n] = (byte)fy;
3551 /* Clear the lite array */
3554 /* Copy the temp array into the lit array lighting the new squares. */
3555 for (i = 0; i < temp_n; i++)
3560 if (!in_bounds2(fy, fx)) continue;
3563 c_ptr = &cave[fy][fx];
3567 /* Clear the temp flag for the old lit grids */
3568 c_ptr->info &= ~(CAVE_TEMP);
3572 /* The is the square newly lit and visible? */
3573 if ((c_ptr->info & (CAVE_VIEW | CAVE_TEMP)) == CAVE_VIEW)
3580 /* Save in the monster lit array */
3581 mon_lite_x[mon_lite_n] = fx;
3582 mon_lite_y[mon_lite_n] = fy;
3587 /* Finished with temp_n */
3590 p_ptr->monlite = (cave[py][px].info & CAVE_MNLT) ? TRUE : FALSE;
3592 if (p_ptr->special_defense & NINJA_S_STEALTH)
3594 if (p_ptr->old_monlite != p_ptr->monlite)
3599 msg_print("±Æ¤Îʤ¤¤¤¬Çö¤ì¤¿µ¤¤¬¤¹¤ë¡£");
3601 msg_print("Your mantle of shadow become thin.");
3607 msg_print("±Æ¤Îʤ¤¤¤¬Ç»¤¯¤Ê¤Ã¤¿¡ª");
3609 msg_print("Your mantle of shadow restored its original darkness.");
3614 p_ptr->old_monlite = p_ptr->monlite;
3617 void clear_mon_lite(void)
3622 /* Clear all monster lit squares */
3623 for (i = 0; i < mon_lite_n; i++)
3626 c_ptr = &cave[mon_lite_y[i]][mon_lite_x[i]];
3628 /* Clear monster illumination flag */
3629 c_ptr->info &= ~(CAVE_MNLT);
3632 /* Empty the array */
3639 * Clear the viewable space
3641 void forget_view(void)
3647 /* None to forget */
3648 if (!view_n) return;
3650 /* Clear them all */
3651 for (i = 0; i < view_n; i++)
3656 /* Access the grid */
3657 c_ptr = &cave[y][x];
3659 /* Forget that the grid is viewable */
3660 c_ptr->info &= ~(CAVE_VIEW);
3662 if (!panel_contains(y, x)) continue;
3664 /* Update the screen */
3675 * This macro allows us to efficiently add a grid to the "view" array,
3676 * note that we are never called for illegal grids, or for grids which
3677 * have already been placed into the "view" array, and we are never
3678 * called when the "view" array is full.
3680 #define cave_view_hack(C,Y,X) \
3682 if (!((C)->info & (CAVE_VIEW))){\
3683 (C)->info |= (CAVE_VIEW); \
3684 view_y[view_n] = (Y); \
3685 view_x[view_n] = (X); \
3692 * Helper function for "update_view()" below
3694 * We are checking the "viewability" of grid (y,x) by the player.
3696 * This function assumes that (y,x) is legal (i.e. on the map).
3698 * Grid (y1,x1) is on the "diagonal" between (py,px) and (y,x)
3699 * Grid (y2,x2) is "adjacent", also between (py,px) and (y,x).
3701 * Note that we are using the "CAVE_XTRA" field for marking grids as
3702 * "easily viewable". This bit is cleared at the end of "update_view()".
3704 * This function adds (y,x) to the "viewable set" if necessary.
3706 * This function now returns "TRUE" if vision is "blocked" by grid (y,x).
3708 static bool update_view_aux(int y, int x, int y1, int x1, int y2, int x2)
3710 bool f1, f2, v1, v2, z1, z2, wall;
3714 cave_type *g1_c_ptr;
3715 cave_type *g2_c_ptr;
3717 /* Access the grids */
3718 g1_c_ptr = &cave[y1][x1];
3719 g2_c_ptr = &cave[y2][x2];
3722 /* Check for walls */
3723 f1 = (cave_floor_grid(g1_c_ptr));
3724 f2 = (cave_floor_grid(g2_c_ptr));
3726 /* Totally blocked by physical walls */
3727 if (!f1 && !f2) return (TRUE);
3730 /* Check for visibility */
3731 v1 = (f1 && (g1_c_ptr->info & (CAVE_VIEW)));
3732 v2 = (f2 && (g2_c_ptr->info & (CAVE_VIEW)));
3734 /* Totally blocked by "unviewable neighbors" */
3735 if (!v1 && !v2) return (TRUE);
3738 /* Access the grid */
3739 c_ptr = &cave[y][x];
3742 /* Check for walls */
3743 wall = (!cave_floor_grid(c_ptr));
3746 /* Check the "ease" of visibility */
3747 z1 = (v1 && (g1_c_ptr->info & (CAVE_XTRA)));
3748 z2 = (v2 && (g2_c_ptr->info & (CAVE_XTRA)));
3750 /* Hack -- "easy" plus "easy" yields "easy" */
3753 c_ptr->info |= (CAVE_XTRA);
3755 cave_view_hack(c_ptr, y, x);
3760 /* Hack -- primary "easy" yields "viewed" */
3763 cave_view_hack(c_ptr, y, x);
3768 /* Hack -- "view" plus "view" yields "view" */
3771 /* c_ptr->info |= (CAVE_XTRA); */
3773 cave_view_hack(c_ptr, y, x);
3779 /* Mega-Hack -- the "los()" function works poorly on walls */
3782 cave_view_hack(c_ptr, y, x);
3788 /* Hack -- check line of sight */
3789 if (los(py, px, y, x))
3791 cave_view_hack(c_ptr, y, x);
3797 /* Assume no line of sight. */
3804 * Calculate the viewable space
3806 * 1: Process the player
3807 * 1a: The player is always (easily) viewable
3808 * 2: Process the diagonals
3809 * 2a: The diagonals are (easily) viewable up to the first wall
3810 * 2b: But never go more than 2/3 of the "full" distance
3811 * 3: Process the main axes
3812 * 3a: The main axes are (easily) viewable up to the first wall
3813 * 3b: But never go more than the "full" distance
3814 * 4: Process sequential "strips" in each of the eight octants
3815 * 4a: Each strip runs along the previous strip
3816 * 4b: The main axes are "previous" to the first strip
3817 * 4c: Process both "sides" of each "direction" of each strip
3818 * 4c1: Each side aborts as soon as possible
3819 * 4c2: Each side tells the next strip how far it has to check
3821 * Note that the octant processing involves some pretty interesting
3822 * observations involving when a grid might possibly be viewable from
3823 * a given grid, and on the order in which the strips are processed.
3825 * Note the use of the mathematical facts shown below, which derive
3826 * from the fact that (1 < sqrt(2) < 1.5), and that the length of the
3827 * hypotenuse of a right triangle is primarily determined by the length
3828 * of the longest side, when one side is small, and is strictly less
3829 * than one-and-a-half times as long as the longest side when both of
3830 * the sides are large.
3832 * if (manhatten(dy,dx) < R) then (hypot(dy,dx) < R)
3833 * if (manhatten(dy,dx) > R*3/2) then (hypot(dy,dx) > R)
3835 * hypot(dy,dx) is approximated by (dx+dy+MAX(dx,dy)) / 2
3837 * These observations are important because the calculation of the actual
3838 * value of "hypot(dx,dy)" is extremely expensive, involving square roots,
3839 * while for small values (up to about 20 or so), the approximations above
3840 * are correct to within an error of at most one grid or so.
3842 * Observe the use of "full" and "over" in the code below, and the use of
3843 * the specialized calculation involving "limit", all of which derive from
3844 * the observations given above. Basically, we note that the "circle" of
3845 * view is completely contained in an "octagon" whose bounds are easy to
3846 * determine, and that only a few steps are needed to derive the actual
3847 * bounds of the circle given the bounds of the octagon.
3849 * Note that by skipping all the grids in the corners of the octagon, we
3850 * place an upper limit on the number of grids in the field of view, given
3851 * that "full" is never more than 20. Of the 1681 grids in the "square" of
3852 * view, only about 1475 of these are in the "octagon" of view, and even
3853 * fewer are in the "circle" of view, so 1500 or 1536 is more than enough
3854 * entries to completely contain the actual field of view.
3856 * Note also the care taken to prevent "running off the map". The use of
3857 * explicit checks on the "validity" of the "diagonal", and the fact that
3858 * the loops are never allowed to "leave" the map, lets "update_view_aux()"
3859 * use the optimized "cave_floor_bold()" macro, and to avoid the overhead
3860 * of multiple checks on the validity of grids.
3862 * Note the "optimizations" involving the "se","sw","ne","nw","es","en",
3863 * "ws","wn" variables. They work like this: While travelling down the
3864 * south-bound strip just to the east of the main south axis, as soon as
3865 * we get to a grid which does not "transmit" viewing, if all of the strips
3866 * preceding us (in this case, just the main axis) had terminated at or before
3867 * the same point, then we can stop, and reset the "max distance" to ourself.
3868 * So, each strip (named by major axis plus offset, thus "se" in this case)
3869 * maintains a "blockage" variable, initialized during the main axis step,
3870 * and checks it whenever a blockage is observed. After processing each
3871 * strip as far as the previous strip told us to process, the next strip is
3872 * told not to go farther than the current strip's farthest viewable grid,
3873 * unless open space is still available. This uses the "k" variable.
3875 * Note the use of "inline" macros for efficiency. The "cave_floor_grid()"
3876 * macro is a replacement for "cave_floor_bold()" which takes a pointer to
3877 * a cave grid instead of its location. The "cave_view_hack()" macro is a
3878 * chunk of code which adds the given location to the "view" array if it
3879 * is not already there, using both the actual location and a pointer to
3880 * the cave grid. See above.
3882 * By the way, the purpose of this code is to reduce the dependancy on the
3883 * "los()" function which is slow, and, in some cases, not very accurate.
3885 * It is very possible that I am the only person who fully understands this
3886 * function, and for that I am truly sorry, but efficiency was very important
3887 * and the "simple" version of this function was just not fast enough. I am
3888 * more than willing to replace this function with a simpler one, if it is
3889 * equally efficient, and especially willing if the new function happens to
3890 * derive "reverse-line-of-sight" at the same time, since currently monsters
3891 * just use an optimized hack of "you see me, so I see you", and then use the
3892 * actual "projectable()" function to check spell attacks.
3894 void update_view(void)
3896 int n, m, d, k, y, x, z;
3898 int se, sw, ne, nw, es, en, ws, wn;
3902 int y_max = cur_hgt - 1;
3903 int x_max = cur_wid - 1;
3907 /*** Initialize ***/
3910 if (view_reduce_view && !dun_level)
3912 /* Full radius (10) */
3913 full = MAX_SIGHT / 2;
3915 /* Octagon factor (15) */
3916 over = MAX_SIGHT * 3 / 4;
3922 /* Full radius (20) */
3925 /* Octagon factor (30) */
3926 over = MAX_SIGHT * 3 / 2;
3930 /*** Step 0 -- Begin ***/
3932 /* Save the old "view" grids for later */
3933 for (n = 0; n < view_n; n++)
3938 /* Access the grid */
3939 c_ptr = &cave[y][x];
3941 /* Mark the grid as not in "view" */
3942 c_ptr->info &= ~(CAVE_VIEW);
3944 /* Mark the grid as "seen" */
3945 c_ptr->info |= (CAVE_TEMP);
3947 /* Add it to the "seen" set */
3953 /* Start over with the "view" array */
3956 /*** Step 1 -- adjacent grids ***/
3958 /* Now start on the player */
3962 /* Access the grid */
3963 c_ptr = &cave[y][x];
3965 /* Assume the player grid is easily viewable */
3966 c_ptr->info |= (CAVE_XTRA);
3968 /* Assume the player grid is viewable */
3969 cave_view_hack(c_ptr, y, x);
3972 /*** Step 2 -- Major Diagonals ***/
3977 /* Scan south-east */
3978 for (d = 1; d <= z; d++)
3980 c_ptr = &cave[y+d][x+d];
3981 c_ptr->info |= (CAVE_XTRA);
3982 cave_view_hack(c_ptr, y+d, x+d);
3983 if (!cave_floor_grid(c_ptr)) break;
3986 /* Scan south-west */
3987 for (d = 1; d <= z; d++)
3989 c_ptr = &cave[y+d][x-d];
3990 c_ptr->info |= (CAVE_XTRA);
3991 cave_view_hack(c_ptr, y+d, x-d);
3992 if (!cave_floor_grid(c_ptr)) break;
3995 /* Scan north-east */
3996 for (d = 1; d <= z; d++)
3998 c_ptr = &cave[y-d][x+d];
3999 c_ptr->info |= (CAVE_XTRA);
4000 cave_view_hack(c_ptr, y-d, x+d);
4001 if (!cave_floor_grid(c_ptr)) break;
4004 /* Scan north-west */
4005 for (d = 1; d <= z; d++)
4007 c_ptr = &cave[y-d][x-d];
4008 c_ptr->info |= (CAVE_XTRA);
4009 cave_view_hack(c_ptr, y-d, x-d);
4010 if (!cave_floor_grid(c_ptr)) break;
4014 /*** Step 3 -- major axes ***/
4017 for (d = 1; d <= full; d++)
4019 c_ptr = &cave[y+d][x];
4020 c_ptr->info |= (CAVE_XTRA);
4021 cave_view_hack(c_ptr, y+d, x);
4022 if (!cave_floor_grid(c_ptr)) break;
4025 /* Initialize the "south strips" */
4029 for (d = 1; d <= full; d++)
4031 c_ptr = &cave[y-d][x];
4032 c_ptr->info |= (CAVE_XTRA);
4033 cave_view_hack(c_ptr, y-d, x);
4034 if (!cave_floor_grid(c_ptr)) break;
4037 /* Initialize the "north strips" */
4041 for (d = 1; d <= full; d++)
4043 c_ptr = &cave[y][x+d];
4044 c_ptr->info |= (CAVE_XTRA);
4045 cave_view_hack(c_ptr, y, x+d);
4046 if (!cave_floor_grid(c_ptr)) break;
4049 /* Initialize the "east strips" */
4053 for (d = 1; d <= full; d++)
4055 c_ptr = &cave[y][x-d];
4056 c_ptr->info |= (CAVE_XTRA);
4057 cave_view_hack(c_ptr, y, x-d);
4058 if (!cave_floor_grid(c_ptr)) break;
4061 /* Initialize the "west strips" */
4065 /*** Step 4 -- Divide each "octant" into "strips" ***/
4067 /* Now check each "diagonal" (in parallel) */
4068 for (n = 1; n <= over / 2; n++)
4070 int ypn, ymn, xpn, xmn;
4073 /* Acquire the "bounds" of the maximal circle */
4075 if (z > full - n) z = full - n;
4076 while ((z + n + (n>>1)) > full) z--;
4079 /* Access the four diagonal grids */
4089 /* Maximum distance */
4090 m = MIN(z, y_max - ypn);
4093 if ((xpn <= x_max) && (n < se))
4096 for (k = n, d = 1; d <= m; d++)
4098 /* Check grid "d" in strip "n", notice "blockage" */
4099 if (update_view_aux(ypn+d, xpn, ypn+d-1, xpn-1, ypn+d-1, xpn))
4101 if (n + d >= se) break;
4104 /* Track most distant "non-blockage" */
4111 /* Limit the next strip */
4116 if ((xmn >= 0) && (n < sw))
4119 for (k = n, d = 1; d <= m; d++)
4121 /* Check grid "d" in strip "n", notice "blockage" */
4122 if (update_view_aux(ypn+d, xmn, ypn+d-1, xmn+1, ypn+d-1, xmn))
4124 if (n + d >= sw) break;
4127 /* Track most distant "non-blockage" */
4134 /* Limit the next strip */
4143 /* Maximum distance */
4147 if ((xpn <= x_max) && (n < ne))
4150 for (k = n, d = 1; d <= m; d++)
4152 /* Check grid "d" in strip "n", notice "blockage" */
4153 if (update_view_aux(ymn-d, xpn, ymn-d+1, xpn-1, ymn-d+1, xpn))
4155 if (n + d >= ne) break;
4158 /* Track most distant "non-blockage" */
4165 /* Limit the next strip */
4170 if ((xmn >= 0) && (n < nw))
4173 for (k = n, d = 1; d <= m; d++)
4175 /* Check grid "d" in strip "n", notice "blockage" */
4176 if (update_view_aux(ymn-d, xmn, ymn-d+1, xmn+1, ymn-d+1, xmn))
4178 if (n + d >= nw) break;
4181 /* Track most distant "non-blockage" */
4188 /* Limit the next strip */
4197 /* Maximum distance */
4198 m = MIN(z, x_max - xpn);
4201 if ((ypn <= x_max) && (n < es))
4204 for (k = n, d = 1; d <= m; d++)
4206 /* Check grid "d" in strip "n", notice "blockage" */
4207 if (update_view_aux(ypn, xpn+d, ypn-1, xpn+d-1, ypn, xpn+d-1))
4209 if (n + d >= es) break;
4212 /* Track most distant "non-blockage" */
4219 /* Limit the next strip */
4224 if ((ymn >= 0) && (n < en))
4227 for (k = n, d = 1; d <= m; d++)
4229 /* Check grid "d" in strip "n", notice "blockage" */
4230 if (update_view_aux(ymn, xpn+d, ymn+1, xpn+d-1, ymn, xpn+d-1))
4232 if (n + d >= en) break;
4235 /* Track most distant "non-blockage" */
4242 /* Limit the next strip */
4251 /* Maximum distance */
4255 if ((ypn <= y_max) && (n < ws))
4258 for (k = n, d = 1; d <= m; d++)
4260 /* Check grid "d" in strip "n", notice "blockage" */
4261 if (update_view_aux(ypn, xmn-d, ypn-1, xmn-d+1, ypn, xmn-d+1))
4263 if (n + d >= ws) break;
4266 /* Track most distant "non-blockage" */
4273 /* Limit the next strip */
4278 if ((ymn >= 0) && (n < wn))
4281 for (k = n, d = 1; d <= m; d++)
4283 /* Check grid "d" in strip "n", notice "blockage" */
4284 if (update_view_aux(ymn, xmn-d, ymn+1, xmn-d+1, ymn, xmn-d+1))
4286 if (n + d >= wn) break;
4289 /* Track most distant "non-blockage" */
4296 /* Limit the next strip */
4303 /*** Step 5 -- Complete the algorithm ***/
4305 /* Update all the new grids */
4306 for (n = 0; n < view_n; n++)
4311 /* Access the grid */
4312 c_ptr = &cave[y][x];
4314 /* Clear the "CAVE_XTRA" flag */
4315 c_ptr->info &= ~(CAVE_XTRA);
4317 /* Update only newly viewed grids */
4318 if (c_ptr->info & (CAVE_TEMP)) continue;
4327 /* Wipe the old grids, update as needed */
4328 for (n = 0; n < temp_n; n++)
4333 /* Access the grid */
4334 c_ptr = &cave[y][x];
4336 /* No longer in the array */
4337 c_ptr->info &= ~(CAVE_TEMP);
4339 /* Update only non-viewable grids */
4340 if (c_ptr->info & (CAVE_VIEW)) continue;
4356 * Hack -- provide some "speed" for the "flow" code
4357 * This entry is the "current index" for the "when" field
4358 * Note that a "when" value of "zero" means "not used".
4360 * Note that the "cost" indexes from 1 to 127 are for
4361 * "old" data, and from 128 to 255 are for "new" data.
4363 * This means that as long as the player does not "teleport",
4364 * then any monster up to 128 + MONSTER_FLOW_DEPTH will be
4365 * able to track down the player, and in general, will be
4366 * able to track down either the player or a position recently
4367 * occupied by the player.
4369 static int flow_n = 0;
4373 * Hack -- forget the "flow" information
4375 void forget_flow(void)
4379 /* Nothing to forget */
4380 if (!flow_n) return;
4382 /* Check the entire dungeon */
4383 for (y = 0; y < cur_hgt; y++)
4385 for (x = 0; x < cur_wid; x++)
4387 /* Forget the old data */
4388 cave[y][x].dist = 0;
4389 cave[y][x].cost = 0;
4390 cave[y][x].when = 0;
4400 * Hack - speed up the update_flow algorithm by only doing
4401 * it everytime the player moves out of LOS of the last
4404 static u16b flow_x = 0;
4405 static u16b flow_y = 0;
4410 * Hack -- fill in the "cost" field of every grid that the player
4411 * can "reach" with the number of steps needed to reach that grid.
4412 * This also yields the "distance" of the player from every grid.
4414 * In addition, mark the "when" of the grids that can reach
4415 * the player with the incremented value of "flow_n".
4417 * Hack -- use the "seen" array as a "circular queue".
4419 * We do not need a priority queue because the cost from grid
4420 * to grid is always "one" and we process them in order.
4422 void update_flow(void)
4428 /* Hack -- disabled */
4429 if (stupid_monsters) return;
4431 /* Paranoia -- make sure the array is empty */
4434 /* The last way-point is on the map */
4435 if (running && in_bounds(flow_y, flow_x))
4437 /* The way point is in sight - do not update. (Speedup) */
4438 if (cave[flow_y][flow_x].info & CAVE_VIEW) return;
4441 /* Erase all of the current flow information */
4442 for (y = 0; y < cur_hgt; y++)
4444 for (x = 0; x < cur_wid; x++)
4446 cave[y][x].cost = 0;
4447 cave[y][x].dist = 0;
4451 /* Save player position */
4455 /* Add the player's grid to the queue */
4459 /* Now process the queue */
4460 while (flow_head != flow_tail)
4464 /* Extract the next entry */
4465 ty = temp_y[flow_tail];
4466 tx = temp_x[flow_tail];
4468 /* Forget that entry */
4469 if (++flow_tail == TEMP_MAX) flow_tail = 0;
4471 /* Add the "children" */
4472 for (d = 0; d < 8; d++)
4474 int old_head = flow_head;
4475 int m = cave[ty][tx].cost + 1;
4476 int n = cave[ty][tx].dist + 1;
4479 /* Child location */
4480 y = ty + ddy_ddd[d];
4481 x = tx + ddx_ddd[d];
4483 /* Ignore player's grid */
4484 if (x == px && y == py) continue;
4486 c_ptr = &cave[y][x];
4488 if ((c_ptr->feat >= FEAT_DOOR_HEAD) && (c_ptr->feat <= FEAT_SECRET)) m += 3;
4490 /* Ignore "pre-stamped" entries */
4491 if (c_ptr->dist != 0 && c_ptr->dist <= n && c_ptr->cost <= m) continue;
4493 /* Ignore "walls" and "rubble" */
4494 if ((c_ptr->feat > FEAT_SECRET) && (c_ptr->feat != FEAT_TREES) && !cave_floor_grid(c_ptr)) continue;
4496 /* Save the flow cost */
4497 if (c_ptr->cost == 0 || c_ptr->cost > m) c_ptr->cost = m;
4498 if (c_ptr->dist == 0 || c_ptr->dist > n) c_ptr->dist = n;
4500 /* Hack -- limit flow depth */
4501 if (n == MONSTER_FLOW_DEPTH) continue;
4503 /* Enqueue that entry */
4504 temp_y[flow_head] = y;
4505 temp_x[flow_head] = x;
4507 /* Advance the queue */
4508 if (++flow_head == TEMP_MAX) flow_head = 0;
4510 /* Hack -- notice overflow by forgetting new entry */
4511 if (flow_head == flow_tail) flow_head = old_head;
4517 static int scent_when = 0;
4520 * Characters leave scent trails for perceptive monsters to track.
4522 * Smell is rather more limited than sound. Many creatures cannot use
4523 * it at all, it doesn't extend very far outwards from the character's
4524 * current position, and monsters can use it to home in the character,
4525 * but not to run away from him.
4527 * Smell is valued according to age. When a character takes his turn,
4528 * scent is aged by one, and new scent of the current age is laid down.
4529 * Speedy characters leave more scent, true, but it also ages faster,
4530 * which makes it harder to hunt them down.
4532 * Whenever the age count loops, most of the scent trail is erased and
4533 * the age of the remainder is recalculated.
4535 void update_smell(void)
4540 /* Create a table that controls the spread of scent */
4541 const int scent_adjust[5][5] =
4550 /* Loop the age and adjust scent values when necessary */
4551 if (++scent_when == 254)
4553 /* Scan the entire dungeon */
4554 for (y = 0; y < cur_hgt; y++)
4556 for (x = 0; x < cur_wid; x++)
4558 int w = cave[y][x].when;
4559 cave[y][x].when = (w > 128) ? (w - 128) : 0;
4568 /* Lay down new scent */
4569 for (i = 0; i < 5; i++)
4571 for (j = 0; j < 5; j++)
4575 /* Translate table to map grids */
4580 if (!in_bounds(y, x)) continue;
4582 c_ptr = &cave[y][x];
4584 /* Walls, water, and lava cannot hold scent. */
4585 if ((c_ptr->feat > FEAT_SECRET) && (c_ptr->feat != FEAT_TREES) && !cave_floor_grid(c_ptr)) continue;
4587 /* Grid must not be blocked by walls from the character */
4588 if (!player_has_los_bold(y, x)) continue;
4590 /* Note grids that are too far away */
4591 if (scent_adjust[i][j] == -1) continue;
4593 /* Mark the grid with new scent */
4594 c_ptr->when = scent_when + scent_adjust[i][j];
4601 * Hack -- map the current panel (plus some) ala "magic mapping"
4603 void map_area(int range)
4609 if (d_info[dungeon_type].flags1 & DF1_DARKNESS) range /= 3;
4611 /* Scan that area */
4612 for (y = 1; y < cur_hgt - 1; y++)
4614 for (x = 1; x < cur_wid - 1; x++)
4616 if (distance(py, px, y, x) > range) continue;
4618 c_ptr = &cave[y][x];
4620 /* All non-walls are "checked" */
4621 if ((c_ptr->feat < FEAT_SECRET) ||
4622 (c_ptr->feat == FEAT_RUBBLE) ||
4623 ((c_ptr->feat >= FEAT_MINOR_GLYPH) &&
4624 (c_ptr->feat <= FEAT_TREES)) ||
4625 (c_ptr->feat >= FEAT_TOWN))
4627 /* Memorize normal features */
4628 if ((c_ptr->feat > FEAT_INVIS) && (c_ptr->feat != FEAT_DIRT) && (c_ptr->feat != FEAT_GRASS))
4630 /* Memorize the object */
4631 c_ptr->info |= (CAVE_MARK);
4634 /* Memorize known walls */
4635 for (i = 0; i < 8; i++)
4637 c_ptr = &cave[y + ddy_ddd[i]][x + ddx_ddd[i]];
4639 /* Memorize walls (etc) */
4640 if ((c_ptr->feat >= FEAT_SECRET) && (c_ptr->feat != FEAT_DIRT) && (c_ptr->feat != FEAT_GRASS))
4642 /* Memorize the walls */
4643 c_ptr->info |= (CAVE_MARK);
4651 p_ptr->redraw |= (PR_MAP);
4654 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4660 * Light up the dungeon using "clairvoyance"
4662 * This function "illuminates" every grid in the dungeon, memorizes all
4663 * "objects", memorizes all grids as with magic mapping, and, under the
4664 * standard option settings (view_perma_grids but not view_torch_grids)
4665 * memorizes all floor grids too.
4667 * Note that if "view_perma_grids" is not set, we do not memorize floor
4668 * grids, since this would defeat the purpose of "view_perma_grids", not
4669 * that anyone seems to play without this option.
4671 * Note that if "view_torch_grids" is set, we do not memorize floor grids,
4672 * since this would prevent the use of "view_torch_grids" as a method to
4673 * keep track of what grids have been observed directly.
4675 void wiz_lite(bool wizard, bool ninja)
4679 /* Memorize objects */
4680 for (i = 1; i < o_max; i++)
4682 object_type *o_ptr = &o_list[i];
4684 /* Skip dead objects */
4685 if (!o_ptr->k_idx) continue;
4687 /* Skip held objects */
4688 if (o_ptr->held_m_idx) continue;
4691 /* Skip objects in vaults, if not a wizard. -LM- */
4692 if ((wizard == FALSE) &&
4693 (cave[o_ptr->iy][o_ptr->ix].info & (CAVE_ICKY))) continue;
4697 o_ptr->marked = TRUE;
4700 /* Scan all normal grids */
4701 for (y = 1; y < cur_hgt - 1; y++)
4703 /* Scan all normal grids */
4704 for (x = 1; x < cur_wid - 1; x++)
4706 cave_type *c_ptr = &cave[y][x];
4708 /* Process all non-walls */
4709 if (cave_floor_bold(y, x) || (c_ptr->feat == FEAT_RUBBLE) || (c_ptr->feat == FEAT_TREES) || (c_ptr->feat == FEAT_MOUNTAIN))
4711 /* Scan all neighbors */
4712 for (i = 0; i < 9; i++)
4714 int yy = y + ddy_ddd[i];
4715 int xx = x + ddx_ddd[i];
4718 c_ptr = &cave[yy][xx];
4720 /* Memorize normal features */
4723 /* Memorize the grid */
4724 c_ptr->info |= (CAVE_MARK);
4728 if ((c_ptr->feat > FEAT_INVIS))
4730 /* Memorize the grid */
4731 c_ptr->info |= (CAVE_MARK);
4734 /* Perma-lite the grid */
4735 if (!(d_info[dungeon_type].flags1 & DF1_DARKNESS))
4737 c_ptr->info |= (CAVE_GLOW);
4739 /* Normally, memorize floors (see above) */
4740 if (view_perma_grids && !view_torch_grids)
4742 /* Memorize the grid */
4743 c_ptr->info |= (CAVE_MARK);
4752 /* Update the monsters */
4753 p_ptr->update |= (PU_MONSTERS);
4756 p_ptr->redraw |= (PR_MAP);
4759 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4764 * Forget the dungeon map (ala "Thinking of Maud...").
4771 /* Forget every grid */
4772 for (y = 0; y < cur_hgt; y++)
4774 for (x = 0; x < cur_wid; x++)
4776 cave_type *c_ptr = &cave[y][x];
4778 /* Process the grid */
4779 c_ptr->info &= ~(CAVE_MARK);
4783 /* Forget all objects */
4784 for (i = 1; i < o_max; i++)
4786 object_type *o_ptr = &o_list[i];
4788 /* Skip dead objects */
4789 if (!o_ptr->k_idx) continue;
4791 /* Skip held objects */
4792 if (o_ptr->held_m_idx) continue;
4794 /* Forget the object */
4795 o_ptr->marked = FALSE;
4798 /* Mega-Hack -- Forget the view and lite */
4799 p_ptr->update |= (PU_UN_VIEW | PU_UN_LITE);
4801 /* Update the view and lite */
4802 p_ptr->update |= (PU_VIEW | PU_LITE);
4804 /* Update the monsters */
4805 p_ptr->update |= (PU_MONSTERS);
4808 p_ptr->redraw |= (PR_MAP);
4811 p_ptr->window |= (PW_OVERHEAD | PW_DUNGEON);
4819 * Change the "feat" flag for a grid, and notice/redraw the grid
4821 void cave_set_feat(int y, int x, int feat)
4823 cave_type *c_ptr = &cave[y][x];
4825 /* Change the feature */
4835 /* Remove a mirror */
4836 void remove_mirror(int y, int x)
4838 /* Remove the mirror */
4839 cave[y][x].info &= ~(CAVE_IN_MIRROR);
4849 * Calculate "incremental motion". Used by project() and shoot().
4850 * Assumes that (*y,*x) lies on the path from (y1,x1) to (y2,x2).
4852 void mmove2(int *y, int *x, int y1, int x1, int y2, int x2)
4854 int dy, dx, dist, shift;
4856 /* Extract the distance travelled */
4857 dy = (*y < y1) ? y1 - *y : *y - y1;
4858 dx = (*x < x1) ? x1 - *x : *x - x1;
4860 /* Number of steps */
4861 dist = (dy > dx) ? dy : dx;
4863 /* We are calculating the next location */
4867 /* Calculate the total distance along each axis */
4868 dy = (y2 < y1) ? (y1 - y2) : (y2 - y1);
4869 dx = (x2 < x1) ? (x1 - x2) : (x2 - x1);
4871 /* Paranoia -- Hack -- no motion */
4872 if (!dy && !dx) return;
4875 /* Move mostly vertically */
4878 /* Extract a shift factor */
4879 shift = (dist * dx + (dy - 1) / 2) / dy;
4881 /* Sometimes move along the minor axis */
4882 (*x) = (x2 < x1) ? (x1 - shift) : (x1 + shift);
4884 /* Always move along major axis */
4885 (*y) = (y2 < y1) ? (y1 - dist) : (y1 + dist);
4888 /* Move mostly horizontally */
4891 /* Extract a shift factor */
4892 shift = (dist * dy + (dx - 1) / 2) / dx;
4894 /* Sometimes move along the minor axis */
4895 (*y) = (y2 < y1) ? (y1 - shift) : (y1 + shift);
4897 /* Always move along major axis */
4898 (*x) = (x2 < x1) ? (x1 - dist) : (x1 + dist);
4905 * Determine if a bolt spell cast from (y1,x1) to (y2,x2) will arrive
4906 * at the final destination, assuming no monster gets in the way.
4908 * This is slightly (but significantly) different from "los(y1,x1,y2,x2)".
4910 bool projectable(int y1, int x1, int y2, int x2)
4917 /* Check the projection path */
4918 grid_n = project_path(grid_g, (project_length ? project_length : MAX_RANGE), y1, x1, y2, x2, 0);
4920 /* No grid is ever projectable from itself */
4921 if (!grid_n) return (FALSE);
4924 y = GRID_Y(grid_g[grid_n - 1]);
4925 x = GRID_X(grid_g[grid_n - 1]);
4927 /* May not end in an unrequested grid */
4928 if ((y != y2) || (x != x2)) return (FALSE);
4936 * Standard "find me a location" function
4938 * Obtains a legal location within the given distance of the initial
4939 * location, and with "los()" from the source to destination location.
4941 * This function is often called from inside a loop which searches for
4942 * locations while increasing the "d" distance.
4944 * Currently the "m" parameter is unused.
4946 void scatter(int *yp, int *xp, int y, int x, int d, int m)
4953 /* Pick a location */
4956 /* Pick a new location */
4957 ny = rand_spread(y, d);
4958 nx = rand_spread(x, d);
4960 /* Ignore annoying locations */
4961 if (!in_bounds(ny, nx)) continue;
4963 /* Ignore "excessively distant" locations */
4964 if ((d > 1) && (distance(y, x, ny, nx) > d)) continue;
4966 /* Require "line of sight" */
4967 if (los(y, x, ny, nx)) break;
4970 /* Save the location */
4979 * Track a new monster
4981 void health_track(int m_idx)
4983 /* Track a new guy */
4984 p_ptr->health_who = m_idx;
4986 /* Redraw (later) */
4987 p_ptr->redraw |= (PR_HEALTH);
4993 * Hack -- track the given monster race
4995 void monster_race_track(int r_idx)
4997 /* Save this monster ID */
4998 p_ptr->monster_race_idx = r_idx;
5001 p_ptr->window |= (PW_MONSTER);
5007 * Hack -- track the given object kind
5009 void object_kind_track(int k_idx)
5011 /* Save this monster ID */
5012 p_ptr->object_kind_idx = k_idx;
5015 p_ptr->window |= (PW_OBJECT);
5021 * Something has happened to disturb the player.
5023 * The first arg indicates a major disturbance, which affects search.
5025 * The second arg is currently unused, but could induce output flush.
5027 * All disturbance cancels repeated commands, resting, and running.
5029 void disturb(int stop_search, int unused_flag)
5032 unused_flag = unused_flag;
5034 /* Cancel auto-commands */
5035 /* command_new = 0; */
5037 /* Cancel repeated commands */
5043 /* Redraw the state (later) */
5044 p_ptr->redraw |= (PR_STATE);
5047 /* Cancel Resting */
5048 if ((p_ptr->action == ACTION_REST) || (p_ptr->action == ACTION_FISH) || (stop_search && (p_ptr->action == ACTION_SEARCH)))
5051 set_action(ACTION_NONE);
5054 /* Cancel running */
5060 /* Check for new panel if appropriate */
5061 if (center_player && !center_running) verify_panel();
5063 /* Calculate torch radius */
5064 p_ptr->update |= (PU_TORCH);
5066 /* Update monster flow */
5067 p_ptr->update |= (PU_FLOW);
5070 /* Flush the input if requested */
5071 if (flush_disturb) flush();