3 /* Purpose: Angband utilities -BEN- */
11 static int num_more = 0;
17 * For those systems that don't have "stricmp()"
19 * Compare the two strings "a" and "b" ala "strcmp()" ignoring case.
21 int stricmp(cptr a, cptr b)
26 /* Scan the strings */
27 for (s1 = a, s2 = b; TRUE; s1++, s2++)
31 if (z1 < z2) return (-1);
32 if (z1 > z2) return (1);
37 #endif /* HAS_STRICMP */
45 * For those systems that don't have "usleep()" but need it.
47 * Fake "usleep()" function grabbed from the inl netrek server -cba
49 int usleep(huge usecs)
56 fd_set *no_fds = NULL;
62 /* Was: int readfds, writefds, exceptfds; */
63 /* Was: readfds = writefds = exceptfds = 0; */
66 /* Paranoia -- No excessive sleeping */
68 if (usecs > 4000000L) core("ÉÔÅö¤Ê usleep() ¸Æ¤Ó½Ð¤·");
70 if (usecs > 4000000L) core("Illegal usleep() call");
76 Timer.tv_sec = (usecs / 1000000L);
77 Timer.tv_usec = (usecs % 1000000L);
80 if (select(nfds, no_fds, no_fds, no_fds, &Timer) < 0)
82 /* Hack -- ignore interrupts */
83 if (errno != EINTR) return -1;
94 * Hack -- External functions
97 extern struct passwd *getpwuid(uid_t uid);
98 extern struct passwd *getpwnam(const char *name);
103 * Find a default user name from the system.
105 void user_name(char *buf, int id)
109 /* Look up the user name */
110 if ((pw = getpwuid(id)))
112 (void)strcpy(buf, pw->pw_name);
115 #ifdef CAPITALIZE_USER_NAME
116 /* Hack -- capitalize the user name */
118 if (!iskanji(buf[0]))
121 buf[0] = toupper(buf[0]);
122 #endif /* CAPITALIZE_USER_NAME */
127 /* Oops. Hack -- default to "PLAYER" */
128 strcpy(buf, "PLAYER");
137 * The concept of the "file" routines below (and elsewhere) is that all
138 * file handling should be done using as few routines as possible, since
139 * every machine is slightly different, but these routines always have the
142 * In fact, perhaps we should use the "path_parse()" routine below to convert
143 * from "canonical" filenames (optional leading tilde's, internal wildcards,
144 * slash as the path seperator, etc) to "system" filenames (no special symbols,
145 * system-specific path seperator, etc). This would allow the program itself
146 * to assume that all filenames are "Unix" filenames, and explicitly "extract"
147 * such filenames if needed (by "path_parse()", or perhaps "path_canon()").
149 * Note that "path_temp" should probably return a "canonical" filename.
151 * Note that "my_fopen()" and "my_open()" and "my_make()" and "my_kill()"
152 * and "my_move()" and "my_copy()" should all take "canonical" filenames.
154 * Note that "canonical" filenames use a leading "slash" to indicate an absolute
155 * path, and a leading "tilde" to indicate a special directory, and default to a
156 * relative path, but MSDOS uses a leading "drivename plus colon" to indicate the
157 * use of a "special drive", and then the rest of the path is parsed "normally",
158 * and MACINTOSH uses a leading colon to indicate a relative path, and an embedded
159 * colon to indicate a "drive plus absolute path", and finally defaults to a file
160 * in the current working directory, which may or may not be defined.
162 * We should probably parse a leading "~~/" as referring to "ANGBAND_DIR". (?)
170 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
180 * Extract a "parsed" path from an initial filename
181 * Normally, we simply copy the filename into the buffer
182 * But leading tilde symbols must be handled in a special way
183 * Replace "~user/" by the home directory of the user named "user"
184 * Replace "~/" by the home directory of the current user
186 errr path_parse(char *buf, int max, cptr file)
193 /* Assume no result */
197 if (!file) return (-1);
199 /* File needs no parsing */
206 /* Point at the user */
209 /* Look for non-user portion of the file */
210 s = strstr(u, PATH_SEP);
212 /* Hack -- no long user names */
213 if (s && (s >= u + sizeof(user))) return (1);
215 /* Extract a user name */
219 for (i = 0; u < s; ++i) user[i] = *u++;
224 /* Look up the "current" user */
225 if (u[0] == '\0') u = getlogin();
227 /* Look up a user (or "current" user) */
228 if (u) pw = getpwnam(u);
229 else pw = getpwuid(getuid());
234 /* Make use of the info */
235 (void)strcpy(buf, pw->pw_dir);
237 /* Append the rest of the filename, if any */
238 if (s) (void)strcat(buf, s);
249 * Extract a "parsed" path from an initial filename
251 * This requires no special processing on simple machines,
252 * except for verifying the size of the filename.
254 errr path_parse(char *buf, int max, cptr file)
256 /* Accept the filename */
257 (void)strnfmt(buf, max, "%s", file);
270 * Hack -- acquire a "temporary" file name if possible
272 * This filename is always in "system-specific" form.
274 static errr path_temp(char *buf, int max)
284 /* Format to length */
285 (void)strnfmt(buf, max, "%s", s);
294 * Create a new path by appending a file (or directory) to a path.
296 * This requires no special processing on simple machines, except
297 * for verifying the size of the filename, but note the ability to
298 * bypass the given "path" with certain special file-names.
300 * Note that the "file" may actually be a "sub-path", including
303 * Note that this function yields a path which must be "parsed"
304 * using the "parse" function above.
306 errr path_build(char *buf, int max, cptr path, cptr file)
311 /* Use the file itself */
312 (void)strnfmt(buf, max, "%s", file);
315 /* Absolute file, on "normal" systems */
316 else if (prefix(file, PATH_SEP) && !streq(PATH_SEP, ""))
318 /* Use the file itself */
319 (void)strnfmt(buf, max, "%s", file);
325 /* Use the file itself */
326 (void)strnfmt(buf, max, "%s", file);
332 /* Build the new path */
333 (void)strnfmt(buf, max, "%s%s%s", path, PATH_SEP, file);
342 * Hack -- replacement for "fopen()"
344 FILE *my_fopen(cptr file, cptr mode)
348 #if defined(MACINTOSH) && defined(MAC_MPW)
352 /* Hack -- Try to parse the path */
353 if (path_parse(buf, 1024, file)) return (NULL);
355 #if defined(MACINTOSH) && defined(MAC_MPW)
356 if (strchr(mode, 'w'))
358 /* setting file type/creator */
359 tempfff = fopen(buf, mode);
360 fsetfileinfo(file, _fcreator, _ftype);
365 /* Attempt to fopen the file anyway */
366 return (fopen(buf, mode));
371 * Hack -- replacement for "fclose()"
373 errr my_fclose(FILE *fff)
376 if (!fff) return (-1);
378 /* Close, check for error */
379 if (fclose(fff) == EOF) return (1);
391 FILE *my_fopen_temp(char *buf, int max)
395 /* Prepare the buffer for mkstemp */
396 strncpy(buf, "/tmp/anXXXXXX", max);
398 /* Secure creation of a temporary file */
401 /* Check the file-descriptor */
402 if (fd < 0) return (NULL);
404 /* Return a file stream */
405 return (fdopen(fd, "w"));
408 #else /* HAVE_MKSTEMP */
410 FILE *my_fopen_temp(char *buf, int max)
412 /* Generate a temporary filename */
413 if (path_temp(buf, max)) return (NULL);
416 return (my_fopen(buf, "w"));
419 #endif /* HAVE_MKSTEMP */
423 * Hack -- replacement for "fgets()"
425 * Read a string, without a newline, to a file
427 * Process tabs, strip internal non-printables
429 errr my_fgets(FILE *fff, char *buf, huge n)
438 if (fgets(tmp, 1024, fff))
440 /* Convert weirdness */
441 for (s = tmp; *s; s++)
456 /* Hack -- require room */
457 if (i + 8 >= n) break;
462 /* Append some more spaces */
463 while (!(i % 8)) buf[i++] = ' ';
467 else if (iskanji(*s))
475 else if ((((int)*s & 0xff) > 0xa1) && (((int)*s & 0xff ) < 0xdf))
482 /* Handle printables */
483 else if (isprint(*s))
492 /* No newline character, but terminate */
508 * Hack -- replacement for "fputs()"
510 * Dump a string, plus a newline, to a file
512 * XXX XXX XXX Process internal weirdness?
514 errr my_fputs(FILE *fff, cptr buf, huge n)
519 /* Dump, ignore errors */
520 (void)fprintf(fff, "%s\n", buf);
531 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
533 * Many of them can be rewritten now that only "fd_open()" and "fd_make()"
534 * and "my_fopen()" should ever create files.
542 * Code Warrior is a little weird about some functions
545 extern int open(const char *, int, ...);
546 extern int close(int);
547 extern int read(int, void *, unsigned int);
548 extern int write(int, const void *, unsigned int);
549 extern long lseek(int, long, int);
550 #endif /* BEN_HACK */
554 * The Macintosh is a little bit brain-dead sometimes
557 # define open(N,F,M) \
558 ((M), open((char*)(N),F))
559 # define write(F,B,S) \
560 write(F,(char*)(B),S)
561 #endif /* MACINTOSH */
565 * Several systems have no "O_BINARY" flag
569 #endif /* O_BINARY */
573 * Hack -- attempt to delete a file
575 errr fd_kill(cptr file)
579 /* Hack -- Try to parse the path */
580 if (path_parse(buf, 1024, file)) return (-1);
591 * Hack -- attempt to move a file
593 errr fd_move(cptr file, cptr what)
598 /* Hack -- Try to parse the path */
599 if (path_parse(buf, 1024, file)) return (-1);
601 /* Hack -- Try to parse the path */
602 if (path_parse(aux, 1024, what)) return (-1);
605 (void)rename(buf, aux);
613 * Hack -- attempt to copy a file
615 errr fd_copy(cptr file, cptr what)
622 /* Hack -- Try to parse the path */
623 if (path_parse(buf, 1024, file)) return (-1);
625 /* Hack -- Try to parse the path */
626 if (path_parse(aux, 1024, what)) return (-1);
628 /* Open source file */
629 src_fd = fd_open(buf, O_RDONLY);
630 if (src_fd < 0) return (-1);
632 /* Open destination file */
633 dst_fd = fd_open(aux, O_WRONLY|O_TRUNC|O_CREAT);
634 if (dst_fd < 0) return (-1);
637 while ((read_num = read(src_fd, buf, 1024)) > 0)
639 write(dst_fd, buf, read_num);
652 * Hack -- attempt to open a file descriptor (create file)
654 * This function should fail if the file already exists
656 * Note that we assume that the file should be "binary"
658 * XXX XXX XXX The horrible "BEN_HACK" code is for compiling under
659 * the CodeWarrior compiler, in which case, for some reason, none
660 * of the "O_*" flags are defined, and we must fake the definition
661 * of "O_RDONLY", "O_WRONLY", and "O_RDWR" in "A-win-h", and then
662 * we must simulate the effect of the proper "open()" call below.
664 int fd_make(cptr file, int mode)
668 /* Hack -- Try to parse the path */
669 if (path_parse(buf, 1024, file)) return (-1);
673 /* Check for existance */
674 /* if (fd_close(fd_open(file, O_RDONLY | O_BINARY))) return (1); */
676 /* Mega-Hack -- Create the file */
677 (void)my_fclose(my_fopen(file, "wb"));
679 /* Re-open the file for writing */
680 return (open(buf, O_WRONLY | O_BINARY, mode));
684 # if defined(MACINTOSH) && defined(MAC_MPW)
686 /* setting file type and creator -- AR */
687 errr_tmp = open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode);
688 fsetfileinfo(file, _fcreator, _ftype);
692 /* Create the file, fail if exists, write-only, binary */
693 return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
696 #endif /* BEN_HACK */
702 * Hack -- attempt to open a file descriptor (existing file)
704 * Note that we assume that the file should be "binary"
706 int fd_open(cptr file, int flags)
710 /* Hack -- Try to parse the path */
711 if (path_parse(buf, 1024, file)) return (-1);
713 /* Attempt to open the file */
714 return (open(buf, flags | O_BINARY, 0));
719 * Hack -- attempt to lock a file descriptor
721 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
723 errr fd_lock(int fd, int what)
726 what = what ? what : 0;
729 if (fd < 0) return (-1);
735 # if defined(F_ULOCK) && defined(F_LOCK)
740 /* Unlock it, Ignore errors */
741 lockf(fd, F_ULOCK, 0);
747 /* Lock the score file */
748 if (lockf(fd, F_LOCK, 0) != 0) return (1);
755 # if defined(LOCK_UN) && defined(LOCK_EX)
760 /* Unlock it, Ignore errors */
761 (void)flock(fd, LOCK_UN);
767 /* Lock the score file */
768 if (flock(fd, LOCK_EX) != 0) return (1);
783 * Hack -- attempt to seek on a file descriptor
785 errr fd_seek(int fd, huge n)
790 if (fd < 0) return (-1);
792 /* Seek to the given position */
793 p = lseek(fd, n, SEEK_SET);
796 if (p != n) return (1);
804 * Hack -- attempt to truncate a file descriptor
806 errr fd_chop(int fd, huge n)
812 if (fd < 0) return (-1);
814 #if defined(SUNOS) || defined(ULTRIX) || defined(NeXT)
825 * Hack -- attempt to read data from a file descriptor
827 errr fd_read(int fd, char *buf, huge n)
830 if (fd < 0) return (-1);
838 if (read(fd, buf, 16384) != 16384) return (1);
840 /* Shorten the task */
843 /* Shorten the task */
849 /* Read the final piece */
850 if (read(fd, buf, n) != (int)n) return (1);
858 * Hack -- Attempt to write data to a file descriptor
860 errr fd_write(int fd, cptr buf, huge n)
863 if (fd < 0) return (-1);
871 if (write(fd, buf, 16384) != 16384) return (1);
873 /* Shorten the task */
876 /* Shorten the task */
882 /* Write the final piece */
883 if (write(fd, buf, n) != (int)n) return (1);
891 * Hack -- attempt to close a file descriptor
893 errr fd_close(int fd)
896 if (fd < 0) return (-1);
912 * XXX XXX XXX Important note about "colors" XXX XXX XXX
914 * The "TERM_*" color definitions list the "composition" of each
915 * "Angband color" in terms of "quarters" of each of the three color
916 * components (Red, Green, Blue), for example, TERM_UMBER is defined
917 * as 2/4 Red, 1/4 Green, 0/4 Blue.
919 * The following info is from "Torbjorn Lindgren" (see "main-xaw.c").
921 * These values are NOT gamma-corrected. On most machines (with the
922 * Macintosh being an important exception), you must "gamma-correct"
923 * the given values, that is, "correct for the intrinsic non-linearity
924 * of the phosphor", by converting the given intensity levels based
925 * on the "gamma" of the target screen, which is usually 1.7 (or 1.5).
927 * The actual formula for conversion is unknown to me at this time,
928 * but you can use the table below for the most common gamma values.
930 * So, on most machines, simply convert the values based on the "gamma"
931 * of the target screen, which is usually in the range 1.5 to 1.7, and
932 * usually is closest to 1.7. The converted value for each of the five
933 * different "quarter" values is given below:
935 * Given Gamma 1.0 Gamma 1.5 Gamma 1.7 Hex 1.7
936 * ----- ---- ---- ---- ---
937 * 0/4 0.00 0.00 0.00 #00
938 * 1/4 0.25 0.27 0.28 #47
939 * 2/4 0.50 0.55 0.56 #8f
940 * 3/4 0.75 0.82 0.84 #d7
941 * 4/4 1.00 1.00 1.00 #ff
943 * Note that some machines (i.e. most IBM machines) are limited to a
944 * hard-coded set of colors, and so the information above is useless.
946 * Also, some machines are limited to a pre-determined set of colors,
947 * for example, the IBM can only display 16 colors, and only 14 of
948 * those colors resemble colors used by Angband, and then only when
949 * you ignore the fact that "Slate" and "cyan" are not really matches,
950 * so on the IBM, we use "orange" for both "Umber", and "Light Umber"
951 * in addition to the obvious "Orange", since by combining all of the
952 * "indeterminate" colors into a single color, the rest of the colors
953 * are left with "meaningful" values.
960 void move_cursor(int row, int col)
962 Term_gotoxy(col, row);
968 * Convert a decimal to a single digit octal number
970 static char octify(uint i)
972 return (hexsym[i%8]);
976 * Convert a decimal to a single digit hex number
978 static char hexify(uint i)
980 return (hexsym[i%16]);
985 * Convert a octal-digit into a decimal
987 static int deoct(char c)
989 if (isdigit(c)) return (D2I(c));
994 * Convert a hexidecimal-digit into a decimal
996 static int dehex(char c)
998 if (isdigit(c)) return (D2I(c));
999 if (islower(c)) return (A2I(c) + 10);
1000 if (isupper(c)) return (A2I(tolower(c)) + 10);
1005 static int my_stricmp(cptr a, cptr b)
1010 /* Scan the strings */
1011 for (s1 = a, s2 = b; TRUE; s1++, s2++)
1013 z1 = FORCEUPPER(*s1);
1014 z2 = FORCEUPPER(*s2);
1015 if (z1 < z2) return (-1);
1016 if (z1 > z2) return (1);
1017 if (!z1) return (0);
1021 static int my_strnicmp(cptr a, cptr b, int n)
1026 /* Scan the strings */
1027 for (s1 = a, s2 = b; n > 0; s1++, s2++, n--)
1029 z1 = FORCEUPPER(*s1);
1030 z2 = FORCEUPPER(*s2);
1031 if (z1 < z2) return (-1);
1032 if (z1 > z2) return (1);
1033 if (!z1) return (0);
1039 static void trigger_text_to_ascii(char **bufptr, cptr *strptr)
1043 bool mod_status[MAX_MACRO_MOD];
1046 int shiftstatus = 0;
1049 if (macro_template == NULL)
1052 for (i = 0; macro_modifier_chr[i]; i++)
1053 mod_status[i] = FALSE;
1056 /* Examine modifier keys */
1059 for (i=0; macro_modifier_chr[i]; i++)
1061 len = strlen(macro_modifier_name[i]);
1063 if(!my_strnicmp(str, macro_modifier_name[i], len))
1066 if (!macro_modifier_chr[i]) break;
1068 mod_status[i] = TRUE;
1069 if ('S' == macro_modifier_chr[i])
1072 for (i = 0; i < max_macrotrigger; i++)
1074 len = strlen(macro_trigger_name[i]);
1075 if (!my_strnicmp(str, macro_trigger_name[i], len) && ']' == str[len])
1077 /* a trigger name found */
1082 /* Invalid trigger name? */
1083 if (i == max_macrotrigger)
1085 str = strchr(str, ']');
1091 *strptr = str; /* where **strptr == ']' */
1095 key_code = macro_trigger_keycode[shiftstatus][i];
1099 for (i = 0; macro_template[i]; i++)
1101 char ch = macro_template[i];
1107 for (j = 0; macro_modifier_chr[j]; j++) {
1109 *s++ = macro_modifier_chr[j];
1113 strcpy(s, key_code);
1114 s += strlen(key_code);
1124 *strptr = str; /* where **strptr == ']' */
1130 * Hack -- convert a printable string into real ascii
1132 * I have no clue if this function correctly handles, for example,
1133 * parsing "\xFF" into a (signed) char. Whoever thought of making
1134 * the "sign" of a "char" undefined is a complete moron. Oh well.
1136 void text_to_ascii(char *buf, cptr str)
1140 /* Analyze the "ascii" string */
1143 /* Backslash codes */
1146 /* Skip the backslash */
1152 trigger_text_to_ascii(&s, &str);
1159 *s = 16 * dehex(*++str);
1160 *s++ += dehex(*++str);
1163 /* Hack -- simple way to specify "backslash" */
1164 else if (*str == '\\')
1169 /* Hack -- simple way to specify "caret" */
1170 else if (*str == '^')
1175 /* Hack -- simple way to specify "space" */
1176 else if (*str == 's')
1181 /* Hack -- simple way to specify Escape */
1182 else if (*str == 'e')
1188 else if (*str == 'b')
1194 else if (*str == 'n')
1200 else if (*str == 'r')
1206 else if (*str == 't')
1212 else if (*str == '0')
1214 *s = 8 * deoct(*++str);
1215 *s++ += deoct(*++str);
1219 else if (*str == '1')
1221 *s = 64 + 8 * deoct(*++str);
1222 *s++ += deoct(*++str);
1226 else if (*str == '2')
1228 *s = 64 * 2 + 8 * deoct(*++str);
1229 *s++ += deoct(*++str);
1233 else if (*str == '3')
1235 *s = 64 * 3 + 8 * deoct(*++str);
1236 *s++ += deoct(*++str);
1239 /* Skip the final char */
1243 /* Normal Control codes */
1244 else if (*str == '^')
1247 *s++ = (*str++ & 037);
1262 static bool trigger_ascii_to_text(char **bufptr, cptr *strptr)
1270 if (macro_template == NULL)
1276 for (i = 0; macro_template[i]; i++)
1279 char ch = macro_template[i];
1284 while ((tmp = strchr(macro_modifier_chr, *str)))
1286 j = (int)(tmp - macro_modifier_chr);
1287 tmp = macro_modifier_name[j];
1288 while(*tmp) *s++ = *tmp++;
1293 for (j = 0; *str && *str != '\r'; j++)
1294 key_code[j] = *str++;
1298 if (ch != *str) return FALSE;
1302 if (*str++ != '\r') return FALSE;
1304 for (i = 0; i < max_macrotrigger; i++)
1306 if (!my_stricmp(key_code, macro_trigger_keycode[0][i])
1307 || !my_stricmp(key_code, macro_trigger_keycode[1][i]))
1310 if (i == max_macrotrigger)
1313 tmp = macro_trigger_name[i];
1314 while (*tmp) *s++ = *tmp++;
1325 * Hack -- convert a string into a printable form
1327 void ascii_to_text(char *buf, cptr str)
1331 /* Analyze the "ascii" string */
1334 byte i = (byte)(*str++);
1339 if(!trigger_ascii_to_text(&s, &str))
1400 *s++ = octify(i / 8);
1401 *s++ = octify(i % 8);
1407 *s++ = hexify(i / 16);
1408 *s++ = hexify(i % 16);
1419 * The "macro" package
1421 * Functions are provided to manipulate a collection of macros, each
1422 * of which has a trigger pattern string and a resulting action string
1423 * and a small set of flags.
1429 * Determine if any macros have ever started with a given character.
1431 static bool macro__use[256];
1435 * Find the macro (if any) which exactly matches the given pattern
1437 sint macro_find_exact(cptr pat)
1441 /* Nothing possible */
1442 if (!macro__use[(byte)(pat[0])])
1447 /* Scan the macros */
1448 for (i = 0; i < macro__num; ++i)
1450 /* Skip macros which do not match the pattern */
1451 if (!streq(macro__pat[i], pat)) continue;
1463 * Find the first macro (if any) which contains the given pattern
1465 static sint macro_find_check(cptr pat)
1469 /* Nothing possible */
1470 if (!macro__use[(byte)(pat[0])])
1475 /* Scan the macros */
1476 for (i = 0; i < macro__num; ++i)
1478 /* Skip macros which do not contain the pattern */
1479 if (!prefix(macro__pat[i], pat)) continue;
1491 * Find the first macro (if any) which contains the given pattern and more
1493 static sint macro_find_maybe(cptr pat)
1497 /* Nothing possible */
1498 if (!macro__use[(byte)(pat[0])])
1503 /* Scan the macros */
1504 for (i = 0; i < macro__num; ++i)
1506 /* Skip macros which do not contain the pattern */
1507 if (!prefix(macro__pat[i], pat)) continue;
1509 /* Skip macros which exactly match the pattern XXX XXX */
1510 if (streq(macro__pat[i], pat)) continue;
1522 * Find the longest macro (if any) which starts with the given pattern
1524 static sint macro_find_ready(cptr pat)
1526 int i, t, n = -1, s = -1;
1528 /* Nothing possible */
1529 if (!macro__use[(byte)(pat[0])])
1534 /* Scan the macros */
1535 for (i = 0; i < macro__num; ++i)
1537 /* Skip macros which are not contained by the pattern */
1538 if (!prefix(pat, macro__pat[i])) continue;
1540 /* Obtain the length of this macro */
1541 t = strlen(macro__pat[i]);
1543 /* Only track the "longest" pattern */
1544 if ((n >= 0) && (s > t)) continue;
1546 /* Track the entry */
1557 * Add a macro definition (or redefinition).
1559 * We should use "act == NULL" to "remove" a macro, but this might make it
1560 * impossible to save the "removal" of a macro definition. XXX XXX XXX
1562 * We should consider refusing to allow macros which contain existing macros,
1563 * or which are contained in existing macros, because this would simplify the
1564 * macro analysis code. XXX XXX XXX
1566 * We should consider removing the "command macro" crap, and replacing it
1567 * with some kind of "powerful keymap" ability, but this might make it hard
1568 * to change the "roguelike" option from inside the game. XXX XXX XXX
1570 errr macro_add(cptr pat, cptr act)
1575 /* Paranoia -- require data */
1576 if (!pat || !act) return (-1);
1579 /* Look for any existing macro */
1580 n = macro_find_exact(pat);
1582 /* Replace existing macro */
1585 /* Free the old macro action */
1586 string_free(macro__act[n]);
1589 /* Create a new macro */
1592 /* Acquire a new index */
1595 /* Save the pattern */
1596 macro__pat[n] = string_make(pat);
1599 /* Save the action */
1600 macro__act[n] = string_make(act);
1603 macro__use[(byte)(pat[0])] = TRUE;
1612 * Local variable -- we are inside a "macro action"
1614 * Do not match any macros until "ascii 30" is found.
1616 static bool parse_macro = FALSE;
1619 * Local variable -- we are inside a "macro trigger"
1621 * Strip all keypresses until a low ascii value is found.
1623 static bool parse_under = FALSE;
1627 * Flush all input chars. Actually, remember the flush,
1628 * and do a "special flush" before the next "inkey()".
1630 * This is not only more efficient, but also necessary to make sure
1631 * that various "inkey()" codes are not "lost" along the way.
1641 * Flush the screen, make a noise
1645 /* Mega-Hack -- Flush the output */
1648 /* Make a bell noise (if allowed) */
1649 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1651 /* Flush the input (later!) */
1657 * Hack -- Make a (relevant?) sound
1662 if (!use_sound) return;
1664 /* Make a sound (if allowed) */
1665 Term_xtra(TERM_XTRA_SOUND, val);
1671 * Helper function called only from "inkey()"
1673 * This function does almost all of the "macro" processing.
1675 * We use the "Term_key_push()" function to handle "failed" macros, as well
1676 * as "extra" keys read in while choosing the proper macro, and also to hold
1677 * the action for the macro, plus a special "ascii 30" character indicating
1678 * that any macro action in progress is complete. Embedded macros are thus
1679 * illegal, unless a macro action includes an explicit "ascii 30" character,
1680 * which would probably be a massive hack, and might break things.
1682 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1683 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1684 * macro trigger, 500 milliseconds must pass before the key sequence is
1685 * known not to be that macro trigger. XXX XXX XXX
1687 static char inkey_aux(void)
1689 int k = 0, n, p = 0, w = 0;
1697 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£ */
1700 /* Wait for a keypress */
1701 (void)(Term_inkey(&ch, TRUE, TRUE));
1704 /* End "macro action" */
1705 if (ch == 30) parse_macro = FALSE;
1707 /* Inside "macro action" */
1708 if (ch == 30) return (ch);
1710 /* Inside "macro action" */
1711 if (parse_macro) return (ch);
1713 /* Inside "macro trigger" */
1714 if (parse_under) return (ch);
1716 /* Parse special key only */
1717 if (inkey_special && ch != 31) return (ch);
1719 /* Save the first key, advance */
1724 /* Check for possible macro */
1725 k = macro_find_check(buf);
1727 /* No macro pending */
1728 if (k < 0) return (ch);
1731 /* Wait for a macro, or a timeout */
1734 /* Check for pending macro */
1735 k = macro_find_maybe(buf);
1737 /* No macro pending */
1740 /* Check for (and remove) a pending key */
1741 if (0 == Term_inkey(&ch, FALSE, TRUE))
1743 /* Append the key */
1754 /* Increase "wait" */
1757 /* Excessive delay */
1758 if (w >= 100) break;
1761 Term_xtra(TERM_XTRA_DELAY, w);
1766 /* Check for available macro */
1767 k = macro_find_ready(buf);
1769 /* No macro available */
1772 /* Push all the keys back on the queue */
1775 /* Push the key, notice over-flow */
1776 if (Term_key_push(buf[--p])) return (0);
1779 /* Wait for (and remove) a pending key */
1780 (void)Term_inkey(&ch, TRUE, TRUE);
1782 /* Return the key */
1787 /* Get the pattern */
1788 pat = macro__pat[k];
1790 /* Get the length of the pattern */
1793 /* Push the "extra" keys back on the queue */
1796 /* Push the key, notice over-flow */
1797 if (Term_key_push(buf[--p])) return (0);
1801 /* Begin "macro action" */
1804 /* Push the "end of macro action" key */
1805 if (Term_key_push(30)) return (0);
1808 /* Access the macro action */
1809 act = macro__act[k];
1811 /* Get the length of the action */
1814 /* Push the macro "action" onto the key queue */
1817 /* Push the key, notice over-flow */
1818 if (Term_key_push(act[--n])) return (0);
1822 /* Hack -- Force "inkey()" to call us again */
1828 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1830 * This special pointer allows a sequence of keys to be "inserted" into
1831 * the stream of keys returned by "inkey()". This key sequence will not
1832 * trigger any macros, and cannot be bypassed by the Borg. It is used
1833 * in Angband to handle "keymaps".
1835 static cptr inkey_next = NULL;
1841 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1843 * This special function hook allows the "Borg" (see elsewhere) to take
1844 * control of the "inkey()" function, and substitute in fake keypresses.
1846 char (*inkey_hack)(int flush_first) = NULL;
1848 #endif /* ALLOW_BORG */
1853 * Get a keypress from the user.
1855 * This function recognizes a few "global parameters". These are variables
1856 * which, if set to TRUE before calling this function, will have an effect
1857 * on this function, and which are always reset to FALSE by this function
1858 * before this function returns. Thus they function just like normal
1859 * parameters, except that most calls to this function can ignore them.
1861 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1862 * and any macro processing in progress will be aborted. This flag is
1863 * set by the "flush()" function, which does not actually flush anything
1864 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1866 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1867 * keypress is available, instead of waiting for a keypress.
1869 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1870 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1871 * not return immediately, but will wait for a keypress for as long as the
1872 * normal macro matching code would, allowing the direct entry of macro
1873 * triggers. The "inkey_base" flag is extremely dangerous!
1875 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1876 * normal command, and we will only show the cursor if "hilite_player" is
1877 * TRUE (or if the player is in a store), instead of always showing the
1878 * cursor. The various "main-xxx.c" files should avoid saving the game
1879 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1880 * prevent savefile corruption.
1882 * If we are waiting for a keypress, and no keypress is ready, then we will
1883 * refresh (once) the window which was active when this function was called.
1885 * Note that "back-quote" is automatically converted into "escape" for
1886 * convenience on machines with no "escape" key. This is done after the
1887 * macro matching, so the user can still make a macro for "backquote".
1889 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1890 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1891 * provide support for simple keyboard "macros". These keys are so strange
1892 * that their loss as normal keys will probably be noticed by nobody. The
1893 * "ascii 30" key is used to indicate the "end" of a macro action, which
1894 * allows recursive macros to be avoided. The "ascii 31" key is used by
1895 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1897 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1898 * which can be used to give a variety of "sub-commands" which can be used
1899 * any time. These sub-commands could include commands to take a picture of
1900 * the current screen, to start/stop recording a macro action, etc.
1902 * If "angband_term[0]" is not active, we will make it active during this
1903 * function, so that the various "main-xxx.c" files can assume that input
1904 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1906 * Mega-Hack -- This function is used as the entry point for clearing the
1907 * "signal_count" variable, and of the "character_saved" variable.
1909 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1911 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1912 * control of the keyboard from the user.
1922 /* Hack -- Use the "inkey_next" pointer */
1923 if (inkey_next && *inkey_next && !inkey_xtra)
1925 /* Get next character, and advance */
1928 /* Cancel the various "global parameters" */
1929 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
1935 /* Forget pointer */
1941 /* Mega-Hack -- Use the special hook */
1942 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1944 /* Cancel the various "global parameters" */
1945 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
1951 #endif /* ALLOW_BORG */
1954 /* Hack -- handle delayed "flush()" */
1957 /* End "macro action" */
1958 parse_macro = FALSE;
1960 /* End "macro trigger" */
1961 parse_under = FALSE;
1963 /* Forget old keypresses */
1968 /* Access cursor state */
1969 (void)Term_get_cursor(&v);
1971 /* Show the cursor if waiting, except sometimes in "command" mode */
1972 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1974 /* Show the cursor */
1975 (void)Term_set_cursor(1);
1979 /* Hack -- Activate main screen */
1980 Term_activate(angband_term[0]);
1986 /* Hack -- Handle "inkey_scan" */
1987 if (!inkey_base && inkey_scan &&
1988 (0 != Term_inkey(&kk, FALSE, FALSE)))
1994 /* Hack -- Flush output once when no key ready */
1995 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
1997 /* Hack -- activate proper term */
2003 /* Hack -- activate main screen */
2004 Term_activate(angband_term[0]);
2006 /* Mega-Hack -- reset saved flag */
2007 character_saved = FALSE;
2009 /* Mega-Hack -- reset signal counter */
2017 /* Hack -- Handle "inkey_base" */
2025 /* Wait for (and remove) a pending key */
2026 if (0 == Term_inkey(&ch, TRUE, TRUE))
2039 /* Check for (and remove) a pending key */
2040 if (0 == Term_inkey(&ch, FALSE, TRUE))
2049 /* Increase "wait" */
2052 /* Excessive delay */
2053 if (w >= 100) break;
2056 Term_xtra(TERM_XTRA_DELAY, w);
2065 /* Get a key (see above) */
2069 /* Handle "control-right-bracket" */
2072 /* Strip this key */
2080 /* Treat back-quote as escape */
2081 /* if (ch == '`') ch = ESCAPE; */
2084 /* End "macro trigger" */
2085 if (parse_under && (ch <= 32))
2087 /* Strip this key */
2090 /* End "macro trigger" */
2091 parse_under = FALSE;
2095 /* Handle "control-caret" */
2098 /* Strip this key */
2102 /* Handle "control-underscore" */
2105 /* Strip this key */
2108 /* Begin "macro trigger" */
2112 /* Inside "macro trigger" */
2113 else if (parse_under)
2115 /* Strip this key */
2121 /* Hack -- restore the term */
2125 /* Restore the cursor */
2129 /* Cancel the various "global parameters" */
2130 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
2132 /* Return the keypress */
2140 * We use a global array for all inscriptions to reduce the memory
2141 * spent maintaining inscriptions. Of course, it is still possible
2142 * to run out of inscription memory, especially if too many different
2143 * inscriptions are used, but hopefully this will be rare.
2145 * We use dynamic string allocation because otherwise it is necessary
2146 * to pre-guess the amount of quark activity. We limit the total
2147 * number of quarks, but this is much easier to "expand" as needed.
2149 * Any two items with the same inscription will have the same "quark"
2150 * index, which should greatly reduce the need for inscription space.
2152 * Note that "quark zero" is NULL and should not be "dereferenced".
2156 * Add a new "quark" to the set of quarks.
2158 s16b quark_add(cptr str)
2162 /* Look for an existing quark */
2163 for (i = 1; i < quark__num; i++)
2165 /* Check for equality */
2166 if (streq(quark__str[i], str)) return (i);
2169 /* Paranoia -- Require room */
2170 if (quark__num == QUARK_MAX) return (0);
2172 /* New maximal quark */
2175 /* Add a new quark */
2176 quark__str[i] = string_make(str);
2178 /* Return the index */
2184 * This function looks up a quark
2186 cptr quark_str(s16b i)
2191 if ((i < 0) || (i >= quark__num)) i = 0;
2193 /* Access the quark */
2196 /* Return the quark */
2204 * Second try for the "message" handling routines.
2206 * Each call to "message_add(s)" will add a new "most recent" message
2207 * to the "message recall list", using the contents of the string "s".
2209 * The messages will be stored in such a way as to maximize "efficiency",
2210 * that is, we attempt to maximize the number of sequential messages that
2211 * can be retrieved, given a limited amount of storage space.
2213 * We keep a buffer of chars to hold the "text" of the messages, not
2214 * necessarily in "order", and an array of offsets into that buffer,
2215 * representing the actual messages. This is made more complicated
2216 * by the fact that both the array of indexes, and the buffer itself,
2217 * are both treated as "circular arrays" for efficiency purposes, but
2218 * the strings may not be "broken" across the ends of the array.
2220 * The "message_add()" function is rather "complex", because it must be
2221 * extremely efficient, both in space and time, for use with the Borg.
2227 * How many messages are "available"?
2229 s16b message_num(void)
2233 /* Extract the indexes */
2234 last = message__last;
2235 next = message__next;
2238 if (next < last) next += MESSAGE_MAX;
2240 /* Extract the space */
2243 /* Return the result */
2250 * Recall the "text" of a saved message
2252 cptr message_str(int age)
2258 /* Forgotten messages have no text */
2259 if ((age < 0) || (age >= message_num())) return ("");
2261 /* Acquire the "logical" index */
2262 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2264 /* Get the "offset" for the message */
2265 o = message__ptr[x];
2267 /* Access the message text */
2268 s = &message__buf[o];
2270 /* Return the message text */
2277 * Add a new message, with great efficiency
2279 void message_add(cptr str)
2287 /*** Step 1 -- Analyze the message ***/
2289 /* Hack -- Ignore "non-messages" */
2292 /* Message length */
2295 /* Important Hack -- Ignore "long" messages */
2296 if (n >= MESSAGE_BUF / 4) return;
2298 /* extra step -- split the message if n>80. (added by Mogami) */
2303 for (n = 0; n < 80; n++, t++)
2308 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2310 for (n = 80; n > 60; n--)
2311 if (str[n] == ' ') break;
2315 splitted2 = str + n;
2316 strncpy(splitted1, str ,n);
2317 splitted1[n] = '\0';
2323 /*** Step 2 -- Attempt to optimize ***/
2325 /* Limit number of messages to check */
2330 /* Limit number of messages to check */
2331 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2333 /* Check previous message */
2334 for (i = message__next; m; m--)
2343 /* Back up and wrap if needed */
2344 if (i-- == 0) i = MESSAGE_MAX - 1;
2346 /* Access the old string */
2347 old = &message__buf[message__ptr[i]];
2349 /* Skip small messages */
2356 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2357 if( iskanji(*t))t++;
2359 for (t = buf; *t && (*t != '<'); t++);
2364 /* Message is too small */
2365 if (strlen(buf) < 6) break;
2367 /* Drop the space */
2370 /* Get multiplier */
2374 /* Limit the multiplier to 1000 */
2375 if (buf && streq(buf, str) && (j < 1000))
2385 sprintf(u, "%s <x%d>", buf, j);
2387 /* Message length */
2390 if (!now_message) now_message++;
2394 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
2402 /* Check the last few messages (if any to count) */
2403 for (i = message__next; k; k--)
2409 /* Back up and wrap if needed */
2410 if (i-- == 0) i = MESSAGE_MAX - 1;
2412 /* Stop before oldest message */
2413 if (i == message__last) break;
2415 /* Extract "distance" from "head" */
2416 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2418 /* Do not optimize over large distance */
2419 if (q > MESSAGE_BUF / 2) continue;
2421 /* Access the old string */
2422 old = &message__buf[message__ptr[i]];
2425 if (!streq(old, str)) continue;
2427 /* Get the next message index, advance */
2428 x = message__next++;
2431 if (message__next == MESSAGE_MAX) message__next = 0;
2433 /* Kill last message if needed */
2434 if (message__next == message__last) message__last++;
2437 if (message__last == MESSAGE_MAX) message__last = 0;
2439 /* Assign the starting address */
2440 message__ptr[x] = message__ptr[i];
2444 goto end_of_message_add;
2449 /*** Step 3 -- Ensure space before end of buffer ***/
2451 /* Kill messages and Wrap if needed */
2452 if (message__head + n + 1 >= MESSAGE_BUF)
2454 /* Kill all "dead" messages */
2455 for (i = message__last; TRUE; i++)
2457 /* Wrap if needed */
2458 if (i == MESSAGE_MAX) i = 0;
2460 /* Stop before the new message */
2461 if (i == message__next) break;
2463 /* Kill "dead" messages */
2464 if (message__ptr[i] >= message__head)
2466 /* Track oldest message */
2467 message__last = i + 1;
2471 /* Wrap "tail" if needed */
2472 if (message__tail >= message__head) message__tail = 0;
2479 /*** Step 4 -- Ensure space before next message ***/
2481 /* Kill messages if needed */
2482 if (message__head + n + 1 > message__tail)
2484 /* Grab new "tail" */
2485 message__tail = message__head + n + 1;
2487 /* Advance tail while possible past first "nul" */
2488 while (message__buf[message__tail-1]) message__tail++;
2490 /* Kill all "dead" messages */
2491 for (i = message__last; TRUE; i++)
2493 /* Wrap if needed */
2494 if (i == MESSAGE_MAX) i = 0;
2496 /* Stop before the new message */
2497 if (i == message__next) break;
2499 /* Kill "dead" messages */
2500 if ((message__ptr[i] >= message__head) &&
2501 (message__ptr[i] < message__tail))
2503 /* Track oldest message */
2504 message__last = i + 1;
2510 /*** Step 5 -- Grab a new message index ***/
2512 /* Get the next message index, advance */
2513 x = message__next++;
2516 if (message__next == MESSAGE_MAX) message__next = 0;
2518 /* Kill last message if needed */
2519 if (message__next == message__last) message__last++;
2522 if (message__last == MESSAGE_MAX) message__last = 0;
2526 /*** Step 6 -- Insert the message text ***/
2528 /* Assign the starting address */
2529 message__ptr[x] = message__head;
2531 /* Append the new part of the message */
2532 for (i = 0; i < n; i++)
2534 /* Copy the message */
2535 message__buf[message__head + i] = str[i];
2539 message__buf[message__head + i] = '\0';
2541 /* Advance the "head" pointer */
2542 message__head += n + 1;
2544 /* recursively add splitted message (added by Mogami) */
2546 if (splitted2 != NULL)
2547 message_add(splitted2);
2555 static void msg_flush(int x)
2557 byte a = TERM_L_BLUE;
2558 bool nagasu = FALSE;
2560 if ((auto_more && !now_damaged) || num_more < 0){
2562 for (i = 0; i < 8; i++)
2564 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2568 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2575 now_damaged = FALSE;
2577 if (!p_ptr->playing || !nagasu)
2579 /* Pause for response */
2581 Term_putstr(x, 0, -1, a, "-³¤¯-");
2583 Term_putstr(x, 0, -1, a, "-more-");
2587 /* Get an acceptable keypress */
2591 if (cmd == ESCAPE) {
2592 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£ */
2594 } else if (cmd == ' ') {
2595 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
2597 } else if ((cmd == '\n') || (cmd == '\r')) {
2598 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
2601 if (quick_messages) break;
2606 /* Clear the line */
2607 Term_erase(0, 0, 255);
2612 * Output a message to the top line of the screen.
2614 * Break long messages into multiple pieces (40-72 chars).
2616 * Allow multiple short messages to "share" the top line.
2618 * Prompt the user to make sure he has a chance to read them.
2620 * These messages are memorized for later reference (see above).
2622 * We could do "Term_fresh()" to provide "flicker" if needed.
2624 * The global "msg_flag" variable can be cleared to tell us to
2625 * "erase" any "pending" messages still on the screen.
2627 * XXX XXX XXX Note that we must be very careful about using the
2628 * "msg_print()" functions without explicitly calling the special
2629 * "msg_print(NULL)" function, since this may result in the loss
2630 * of information if the screen is cleared, or if anything is
2631 * displayed on the top line.
2633 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2634 * even if no messages are pending. This is probably a hack.
2636 void msg_print(cptr msg)
2646 if (world_monster) return;
2650 /* Clear the line */
2651 Term_erase(0, 0, 255);
2655 /* Message Length */
2656 n = (msg ? strlen(msg) : 0);
2658 /* Hack -- flush when requested or needed */
2659 if (p && (!msg || ((p + n) > 72)))
2676 if (n > 1000) return;
2679 /* Memorize the message */
2680 if (character_generated) message_add(msg);
2686 /* Analyze the buffer */
2693 int check, split = 72;
2696 bool k_flag = FALSE;
2699 /* Find the "best" split point */
2700 for (check = 0; check < 72; check++)
2708 /* Found a valid split point */
2709 if (iskanji(t[check]))
2714 else if (t[check] == ' ')
2727 /* Find the "best" split point */
2728 for (check = 40; check < 72; check++)
2730 /* Found a valid split point */
2731 if (t[check] == ' ') split = check;
2735 /* Save the split character */
2738 /* Split the message */
2741 /* Display part of the message */
2742 Term_putstr(0, 0, split, TERM_WHITE, t);
2745 msg_flush(split + 1);
2747 /* Memorize the piece */
2748 /* if (character_generated) message_add(t); */
2750 /* Restore the split character */
2753 /* Insert a space */
2756 /* Prepare to recurse on the rest of "buf" */
2757 t += split; n -= split;
2761 /* Display the tail of the message */
2762 Term_putstr(p, 0, n, TERM_WHITE, t);
2764 /* Memorize the tail */
2765 /* if (character_generated) message_add(t); */
2768 p_ptr->window |= (PW_MESSAGE);
2771 /* Remember the message */
2774 /* Remember the position */
2782 /* Optional refresh */
2783 if (fresh_message) Term_fresh();
2788 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2790 static int screen_depth = 0;
2794 * Save the screen, and increase the "icky" depth.
2796 * This function must match exactly one call to "screen_load()".
2798 void screen_save(void)
2800 /* Hack -- Flush messages */
2803 /* Save the screen (if legal) */
2804 if (screen_depth++ == 0) Term_save();
2806 /* Increase "icky" depth */
2812 * Load the screen, and decrease the "icky" depth.
2814 * This function must match exactly one call to "screen_save()".
2816 void screen_load(void)
2818 /* Hack -- Flush messages */
2821 /* Load the screen (if legal) */
2822 if (--screen_depth == 0) Term_load();
2824 /* Decrease "icky" depth */
2830 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2832 void msg_format(cptr fmt, ...)
2838 /* Begin the Varargs Stuff */
2841 /* Format the args, save the length */
2842 (void)vstrnfmt(buf, 1024, fmt, vp);
2844 /* End the Varargs Stuff */
2854 * Display a string on the screen using an attribute.
2856 * At the given location, using the given attribute, if allowed,
2857 * add the given string. Do not clear the line.
2859 void c_put_str(byte attr, cptr str, int row, int col)
2861 /* Position cursor, Dump the attr/text */
2862 Term_putstr(col, row, -1, attr, str);
2866 * As above, but in "white"
2868 void put_str(cptr str, int row, int col)
2871 Term_putstr(col, row, -1, TERM_WHITE, str);
2877 * Display a string on the screen using an attribute, and clear
2878 * to the end of the line.
2880 void c_prt(byte attr, cptr str, int row, int col)
2882 /* Clear line, position cursor */
2883 Term_erase(col, row, 255);
2885 /* Dump the attr/text */
2886 Term_addstr(-1, attr, str);
2890 * As above, but in "white"
2892 void prt(cptr str, int row, int col)
2895 c_prt(TERM_WHITE, str, row, col);
2902 * Print some (colored) text to the screen at the current cursor position,
2903 * automatically "wrapping" existing text (at spaces) when necessary to
2904 * avoid placing any text into the last column, and clearing every line
2905 * before placing any text in that line. Also, allow "newline" to force
2906 * a "wrap" to the next line. Advance the cursor as needed so sequential
2907 * calls to this function will work correctly.
2909 * Once this function has been called, the cursor should not be moved
2910 * until all the related "c_roff()" calls to the window are complete.
2912 * This function will correctly handle any width up to the maximum legal
2913 * value of 256, though it works best for a standard 80 character width.
2915 void c_roff(byte a, cptr str)
2923 /* Obtain the size */
2924 (void)Term_get_size(&w, &h);
2926 /* Obtain the cursor */
2927 (void)Term_locate(&x, &y);
2929 /* Hack -- No more space */
2930 if( y == h - 1 && x > w - 3) return;
2932 /* Process the string */
2933 for (s = str; *s; s++)
2938 int k_flag = iskanji(*s);
2950 /* Clear line, move cursor */
2951 Term_erase(x, y, 255);
2956 /* Clean up the char */
2958 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2960 ch = (isprint(*s) ? *s : ' ');
2964 /* Wrap words as needed */
2966 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2968 if ((x >= w - 1) && (ch != ' '))
2981 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
2985 /* Scan existing text */
2986 for (i = w - 2; i >= 0; i--)
2988 /* Grab existing attr/char */
2989 Term_what(i, y, &av[i], &cv[i]);
2991 /* Break on space */
2992 if (cv[i] == ' ') break;
2994 /* Track current word */
2997 if (cv[i] == '(') break;
3005 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
3006 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
3007 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
3008 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
3009 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
3012 Term_what(x , y, &av[x ], &cv[x ]);
3013 Term_what(x-1, y, &av[x-1], &cv[x-1]);
3014 Term_what(x-2, y, &av[x-2], &cv[x-2]);
3025 Term_erase(n, y, 255);
3034 /* Clear line, move cursor */
3035 Term_erase(x, y, 255);
3037 /* Wrap the word (if any) */
3038 for (i = n; i < w - 1; i++)
3041 if( cv[i] == '\0' ) break;
3044 Term_addch(av[i], cv[i]);
3046 /* Advance (no wrap) */
3053 Term_addch((byte)(a|0x10), ch);
3065 Term_addch((byte)(a|0x20), ch);
3074 * As above, but in "white"
3079 c_roff(TERM_WHITE, str);
3086 * Clear part of the screen
3088 void clear_from(int row)
3092 /* Erase requested rows */
3093 for (y = row; y < Term->hgt; y++)
3095 /* Erase part of the screen */
3096 Term_erase(0, y, 255);
3104 * Get some input at the cursor location.
3105 * Assume the buffer is initialized to a default string.
3106 * Note that this string is often "empty" (see below).
3107 * The default buffer is displayed in yellow until cleared.
3108 * Pressing RETURN right away accepts the default entry.
3109 * Normal chars clear the default and append the char.
3110 * Backspace clears the default or deletes the final char.
3111 * ESCAPE clears the buffer and the window and returns FALSE.
3112 * RETURN accepts the current buffer contents and returns TRUE.
3114 bool askfor_aux(char *buf, int len)
3128 /* Locate the cursor */
3129 Term_locate(&x, &y);
3132 /* Paranoia -- check len */
3133 if (len < 1) len = 1;
3135 /* Paranoia -- check column */
3136 if ((x < 0) || (x >= 80)) x = 0;
3138 /* Restrict the length */
3139 if (x + len > 80) len = 80 - x;
3142 /* Paranoia -- Clip the default entry */
3146 /* Display the default answer */
3147 Term_erase(x, y, len);
3148 Term_putstr(x, y, -1, TERM_YELLOW, buf);
3155 Term_gotoxy(x + k, y);
3160 /* Analyze the key */
3191 { /* ÊÒ»³¤µ¤óºîÀ® */
3205 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3207 if(k<len && isprint(i)){
3216 if ((k < len) && (isprint(i)))
3232 /* Update the entry */
3233 Term_erase(x, y, len);
3234 Term_putstr(x, y, -1, TERM_WHITE, buf);
3238 if (i == ESCAPE) return (FALSE);
3246 * Get a string from the user
3248 * The "prompt" should take the form "Prompt: "
3250 * Note that the initial contents of the string is used as
3251 * the default response, so be sure to "clear" it if needed.
3253 * We clear the input, and return FALSE, on "ESCAPE".
3255 bool get_string(cptr prompt, char *buf, int len)
3259 /* Paranoia XXX XXX XXX */
3262 /* Display prompt */
3265 /* Ask the user for a string */
3266 res = askfor_aux(buf, len);
3277 * Verify something with the user
3279 * The "prompt" should take the form "Query? "
3281 * Note that "[y/n]" is appended to the prompt.
3283 bool get_check(cptr prompt)
3285 return get_check_strict(prompt, 0);
3289 * Verify something with the user strictly
3291 * mode & CHECK_OKAY_CANCEL : force user to answer 'O'kay or 'C'ancel
3292 * mode & CHECK_NO_ESCAPE : don't allow ESCAPE key
3293 * mode & CHECK_NO_HISTORY : no message_add
3295 bool get_check_strict(cptr prompt, int mode)
3302 p_ptr->window |= PW_MESSAGE;
3307 /* Paranoia XXX XXX XXX */
3310 if (!rogue_like_commands)
3311 mode &= ~CHECK_OKAY_CANCEL;
3314 /* Hack -- Build a "useful" prompt */
3315 if (mode & CHECK_OKAY_CANCEL)
3317 my_strcpy(buf, prompt, sizeof(buf)-15);
3318 strcat(buf, "[(O)k/(C)ancel]");
3322 my_strcpy(buf, prompt, sizeof(buf)-5);
3323 strcat(buf, "[y/n]");
3329 if (!(mode & CHECK_NO_HISTORY) && p_ptr->playing)
3331 /* HACK : Add the line to message buffer */
3333 p_ptr->window |= (PW_MESSAGE);
3337 /* Get an acceptable answer */
3341 if (mode & CHECK_OKAY_CANCEL)
3343 if ( i == 'o' || i == 'O' )
3349 else if (i == 'y' || i == 'Y')
3353 if (!(mode & CHECK_NO_ESCAPE) && (i == ESCAPE)) break;
3354 if ( mode & CHECK_OKAY_CANCEL )
3356 if ( i == 'c' || i == 'C' )
3361 else if (i == 'n' || i == 'N')
3368 /* Erase the prompt */
3371 /* Normal negation */
3372 if ((i != 'Y') && (i != 'y')) return (FALSE);
3380 * Prompts for a keypress
3382 * The "prompt" should take the form "Command: "
3384 * Returns TRUE unless the character is "Escape"
3386 bool get_com(cptr prompt, char *command, bool z_escape)
3388 /* Paranoia XXX XXX XXX */
3391 /* Display a prompt */
3397 /* Clear the prompt */
3400 /* Handle "cancel" */
3401 if (*command == ESCAPE) return (FALSE);
3402 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3410 * Request a "quantity" from the user
3412 * Hack -- allow "command_arg" to specify a quantity
3414 s16b get_quantity(cptr prompt, int max)
3423 /* Use "command_arg" */
3426 /* Extract a number */
3429 /* Clear "command_arg" */
3432 /* Enforce the maximum */
3433 if (amt > max) amt = max;
3439 #ifdef ALLOW_REPEAT /* TNB */
3441 /* Get the item index */
3442 if ((max != 1) && repeat_pull(&amt))
3444 /* Enforce the maximum */
3445 if (amt > max) amt = max;
3447 /* Enforce the minimum */
3448 if (amt < 0) amt = 0;
3454 #endif /* ALLOW_REPEAT -- TNB */
3456 /* Build a prompt if needed */
3459 /* Build a prompt */
3461 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3463 sprintf(tmp, "Quantity (1-%d): ", max);
3467 /* Use that prompt */
3472 /* Default to one */
3475 /* Build the default */
3476 sprintf(buf, "%d", amt);
3478 /* Ask for a quantity */
3479 if (!get_string(prompt, buf, 6)) return (0);
3481 /* Extract a number */
3484 /* A letter means "all" */
3485 if (isalpha(buf[0])) amt = max;
3487 /* Enforce the maximum */
3488 if (amt > max) amt = max;
3490 /* Enforce the minimum */
3491 if (amt < 0) amt = 0;
3493 #ifdef ALLOW_REPEAT /* TNB */
3495 if (amt) repeat_push(amt);
3497 #endif /* ALLOW_REPEAT -- TNB */
3499 /* Return the result */
3505 * Pause for user response XXX XXX XXX
3507 void pause_line(int row)
3512 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3514 put_str("[Press any key to continue]", row, 23);
3523 * Hack -- special buffer to hold the action of the current keymap
3525 static char request_command_buffer[256];
3537 menu_naiyou menu_info[10][10] =
3540 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3542 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3543 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3545 {"Èâ/È¢", 6, FALSE},
3548 {"¤½¤Î¾", 9, FALSE},
3553 {"»È¤¦(m)", 'm', TRUE},
3554 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3555 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3556 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3566 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3567 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3568 {"õ¤¹(s)", 's', TRUE},
3569 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3570 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3571 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3572 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3573 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3574 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3575 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3579 {"Æɤà(r)", 'r', TRUE},
3580 {"°û¤à(q)", 'q', TRUE},
3581 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3582 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3583 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3584 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3585 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3586 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3587 {"Åꤲ¤ë(v)", 'v', TRUE},
3592 {"½¦¤¦(g)", 'g', TRUE},
3593 {"Íî¤È¤¹(d)", 'd', TRUE},
3594 {"²õ¤¹(k/^d)", 'k', TRUE},
3595 {"Ìäò¹ï¤à({)", '{', TRUE},
3596 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3597 {"Ä´ºº(I)", 'I', TRUE},
3598 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3605 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3606 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3607 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3608 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3618 {"³«¤±¤ë(o)", 'o', TRUE},
3619 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3620 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3621 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3631 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3632 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3633 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3634 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3635 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3636 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3637 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3638 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3639 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3644 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3645 {"¥Þ¥¯¥í(@)", '@', TRUE},
3646 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3647 {"¥«¥é¡¼(&)", '&', TRUE},
3648 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3649 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3650 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3657 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3658 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3659 {"¥Ø¥ë¥×(?)", '?', TRUE},
3660 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3661 {"¥á¥â(:)", ':', TRUE},
3662 {"µÇ°»£±Æ())", ')', TRUE},
3663 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3664 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3665 {"°úÂह¤ë(Q)", 'Q', TRUE},
3670 menu_naiyou menu_info[10][10] =
3673 {"Magic/Special", 1, FALSE},
3674 {"Action", 2, FALSE},
3675 {"Items(use)", 3, FALSE},
3676 {"Items(other)", 4, FALSE},
3677 {"Equip", 5, FALSE},
3678 {"Door/Box", 6, FALSE},
3679 {"Infomations", 7, FALSE},
3680 {"Options", 8, FALSE},
3681 {"Other commands", 9, FALSE},
3686 {"Use(m)", 'm', TRUE},
3687 {"See tips(b/P)", 'b', TRUE},
3688 {"Study(G)", 'G', TRUE},
3689 {"Special abilities(U/O)", 'U', TRUE},
3699 {"Rest(R)", 'R', TRUE},
3700 {"Disarm a trap(D)", 'D', TRUE},
3701 {"Search(s)", 's', TRUE},
3702 {"Look(l/x)", 'l', TRUE},
3703 {"Target(*)", '*', TRUE},
3704 {"Dig(T/^t)", 'T', TRUE},
3705 {"Go up stairs(<)", '<', TRUE},
3706 {"Go down staies(>)", '>', TRUE},
3707 {"Command pets(p)", 'p', TRUE},
3708 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3712 {"Read a scroll(r)", 'r', TRUE},
3713 {"Drink a potion(q)", 'q', TRUE},
3714 {"Use a staff(u/Z)", 'u', TRUE},
3715 {"Aim a wand(a/z)", 'a', TRUE},
3716 {"Zap a rod(z/a)", 'z', TRUE},
3717 {"Activate an equipment(A)", 'A', TRUE},
3718 {"Eat(E)", 'E', TRUE},
3719 {"Fire missile weapon(f/t)", 'f', TRUE},
3720 {"Throw an item(v)", 'v', TRUE},
3725 {"Get items(g)", 'g', TRUE},
3726 {"Drop an item(d)", 'd', TRUE},
3727 {"Destroy an item(k/^d)", 'k', TRUE},
3728 {"Inscribe an item({)", '{', TRUE},
3729 {"Uninscribe an item(})", '}', TRUE},
3730 {"Info about an item(I)", 'I', TRUE},
3731 {"Inventory list(i)", 'i', TRUE},
3738 {"Wear(w)", 'w', TRUE},
3739 {"Take off(t/T)", 't', TRUE},
3740 {"Refuel(F)", 'F', TRUE},
3741 {"Equipment list(e)", 'e', TRUE},
3751 {"Open(o)", 'o', TRUE},
3752 {"Close(c)", 'c', TRUE},
3753 {"Bash a door(B/f)", 'B', TRUE},
3754 {"Jam a door(j/S)", 'j', TRUE},
3764 {"Full map(M)", 'M', TRUE},
3765 {"Map(L/W)", 'L', TRUE},
3766 {"Level feeling(^f)", KTRL('F'), TRUE},
3767 {"Character status(C)", 'C', TRUE},
3768 {"Identify symbol(/)", '/', TRUE},
3769 {"Show prev messages(^p)", KTRL('P'), TRUE},
3770 {"Current time(^t/')", KTRL('T'), TRUE},
3771 {"Various infomations(~)", '~', TRUE},
3772 {"Play record menu(|)", '|', TRUE},
3777 {"Set options(=)", '=', TRUE},
3778 {"Interact with macros(@)", '@', TRUE},
3779 {"Interact w/ visuals(%)", '%', TRUE},
3780 {"Interact with colors(&)", '&', TRUE},
3781 {"Enter a user pref(\")", '\"', TRUE},
3782 {"Reload auto-pick pref($)", '$', TRUE},
3790 {"Save and quit(^x)", KTRL('X'), TRUE},
3791 {"Save(^s)", KTRL('S'), TRUE},
3792 {"Help(obsoleted)(?)", '?', TRUE},
3793 {"Redraw(^r)", KTRL('R'), TRUE},
3794 {"Take note(:)", ':', TRUE},
3795 {"Dump screen dump(()", ')', TRUE},
3796 {"Load screen dump())", '(', TRUE},
3797 {"Version info(V)", 'V', TRUE},
3798 {"Quit(Q)", 'Q', TRUE},
3811 } special_menu_naiyou;
3813 #define MENU_CLASS 1
3817 special_menu_naiyou special_menu_info[] =
3819 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3820 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3821 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3822 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3823 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3824 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3825 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3829 special_menu_naiyou special_menu_info[] =
3831 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3832 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3833 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3834 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3835 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3836 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3837 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3842 static char inkey_from_menu(void)
3846 int num = 0, max_num, old_num = 0;
3850 if (py - panel_row_min > 10) basey = 2;
3854 /* Clear top line */
3864 if (!menu) old_num = num;
3865 put_str("+----------------------------------------------------+", basey, basex);
3866 put_str("| |", basey+1, basex);
3867 put_str("| |", basey+2, basex);
3868 put_str("| |", basey+3, basex);
3869 put_str("| |", basey+4, basex);
3870 put_str("| |", basey+5, basex);
3871 put_str("+----------------------------------------------------+", basey+6, basex);
3873 for(i = 0; i < 10; i++)
3876 if (!menu_info[menu][i].cmd) break;
3877 menu_name = menu_info[menu][i].name;
3878 for(hoge = 0; ; hoge++)
3880 if (!special_menu_info[hoge].name[0]) break;
3881 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3882 switch(special_menu_info[hoge].jouken)
3885 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3888 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
3890 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3897 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
3900 kisuu = max_num % 2;
3902 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3904 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3907 /* Place the cursor on the player */
3908 move_cursor_relative(py, px);
3912 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r') || (sub_cmd == '\n'))
3914 if (menu_info[menu][num].fin)
3916 cmd = menu_info[menu][num].cmd;
3922 menu = menu_info[menu][num].cmd;
3928 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
3945 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
3950 num = (num + 2) % (max_num - 1);
3952 num = (num + 2) % (max_num + 1);
3954 else num = (num + 2) % max_num;
3956 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
3961 num = (num + max_num - 3) % (max_num - 1);
3963 num = (num + max_num - 1) % (max_num + 1);
3965 else num = (num + max_num - 2) % max_num;
3967 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
3969 if ((num % 2) || (num == max_num - 1))
3973 else if (num < max_num - 1)
3981 if (!inkey_next) inkey_next = "";
3987 * Request a command from the user.
3989 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
3990 * p_ptr->command_arg. May modify p_ptr->command_new.
3992 * Note that "caret" ("^") is treated specially, and is used to
3993 * allow manual input of control characters. This can be used
3994 * on many machines to request repeated tunneling (Ctrl-H) and
3995 * on the Macintosh to request "Control-Caret".
3997 * Note that "backslash" is treated specially, and is used to bypass any
3998 * keymap entry for the following character. This is useful for macros.
4000 * Note that this command is used both in the dungeon and in
4001 * stores, and must be careful to work in both situations.
4003 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
4005 void request_command(int shopping)
4018 if (rogue_like_commands)
4020 mode = KEYMAP_MODE_ROGUE;
4026 mode = KEYMAP_MODE_ORIG;
4030 /* No command yet */
4033 /* No "argument" yet */
4036 /* No "direction" yet */
4045 /* Hack -- auto-commands */
4048 /* Flush messages */
4051 /* Use auto-command */
4058 /* Get a keypress in "command" mode */
4061 /* Hack -- no flush needed */
4065 /* Activate "command mode" */
4071 if (!shopping && command_menu && ((cmd == '\r') || (cmd == '\n') || (cmd == 'x') || (cmd == 'X'))
4072 && !keymap_act[mode][(byte)(cmd)])
4073 cmd = inkey_from_menu();
4076 /* Clear top line */
4083 int old_arg = command_arg;
4088 /* Begin the input */
4090 prt("²ó¿ô: ", 0, 0);
4092 prt("Count: ", 0, 0);
4096 /* Get a command count */
4099 /* Get a new keypress */
4102 /* Simple editing (delete or backspace) */
4103 if ((cmd == 0x7F) || (cmd == KTRL('H')))
4105 /* Delete a digit */
4106 command_arg = command_arg / 10;
4108 /* Show current count */
4110 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4112 prt(format("Count: %d", command_arg), 0, 0);
4117 /* Actual numeric data */
4118 else if (cmd >= '0' && cmd <= '9')
4120 /* Stop count at 9999 */
4121 if (command_arg >= 1000)
4130 /* Increase count */
4133 /* Incorporate that digit */
4134 command_arg = command_arg * 10 + D2I(cmd);
4137 /* Show current count */
4139 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4141 prt(format("Count: %d", command_arg), 0, 0);
4146 /* Exit on "unusable" input */
4153 /* Hack -- Handle "zero" */
4154 if (command_arg == 0)
4159 /* Show current count */
4161 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4163 prt(format("Count: %d", command_arg), 0, 0);
4168 /* Hack -- Handle "old_arg" */
4171 /* Restore old_arg */
4172 command_arg = old_arg;
4174 /* Show current count */
4176 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4178 prt(format("Count: %d", command_arg), 0, 0);
4183 /* Hack -- white-space means "enter command now" */
4184 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
4186 /* Get a real command */
4188 if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
4190 if (!get_com("Command: ", (char *)&cmd, FALSE))
4204 /* Allow "keymaps" to be bypassed */
4207 /* Get a real command */
4209 (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
4211 (void)get_com("Command: ", (char *)&cmd, FALSE);
4215 /* Hack -- bypass keymaps */
4216 if (!inkey_next) inkey_next = "";
4220 /* Allow "control chars" to be entered */
4223 /* Get a new command and controlify it */
4225 if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4227 if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4233 /* Look up applicable keymap */
4234 act = keymap_act[mode][(byte)(cmd)];
4236 /* Apply keymap if not inside a keymap already */
4237 if (act && !inkey_next)
4239 /* Install the keymap (limited buffer size) */
4240 (void)strnfmt(request_command_buffer, 256, "%s", act);
4242 /* Start using the buffer */
4243 inkey_next = request_command_buffer;
4255 command_cmd = (byte)cmd;
4261 /* Hack -- Auto-repeat certain commands */
4262 if (always_repeat && (command_arg <= 0))
4264 /* Hack -- auto repeat certain commands */
4265 if (strchr("TBDoc+", command_cmd))
4267 /* Repeat 99 times */
4276 switch (command_cmd)
4278 /* Command "p" -> "purchase" (get) */
4279 case 'p': command_cmd = 'g'; break;
4281 /* Command "m" -> "purchase" (get) */
4282 case 'm': command_cmd = 'g'; break;
4284 /* Command "s" -> "sell" (drop) */
4285 case 's': command_cmd = 'd'; break;
4290 for (i = 0; i < 256; i++)
4293 if ((s = keymap_act[mode][i]) != NULL)
4295 if (*s == command_cmd && *(s+1) == 0)
4303 caretcmd = command_cmd;
4305 /* Hack -- Scan equipment */
4306 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4310 object_type *o_ptr = &inventory[i];
4312 /* Skip non-objects */
4313 if (!o_ptr->k_idx) continue;
4315 /* No inscription */
4316 if (!o_ptr->inscription) continue;
4318 /* Obtain the inscription */
4319 s = quark_str(o_ptr->inscription);
4324 /* Process preventions */
4327 /* Check the "restriction" character */
4329 if ((s[1] == caretcmd) || (s[1] == '*'))
4331 if ((s[1] == command_cmd) || (s[1] == '*'))
4335 /* Hack -- Verify command */
4337 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4339 if (!get_check("Are you sure? "))
4343 /* Hack -- Use space */
4348 /* Find another '^' */
4349 s = strchr(s + 1, '^');
4354 /* Hack -- erase the message line. */
4361 * Check a char for "vowel-hood"
4363 bool is_a_vowel(int ch)
4388 * Replace the first instance of "target" in "buf" with "insert"
4389 * If "insert" is NULL, just remove the first instance of "target"
4390 * In either case, return TRUE if "target" is found.
4392 * XXX Could be made more efficient, especially in the
4393 * case where "insert" is smaller than "target".
4395 static bool insert_str(char *buf, cptr target, cptr insert)
4398 int b_len, t_len, i_len;
4400 /* Attempt to find the target (modify "buf") */
4401 buf = strstr(buf, target);
4403 /* No target found */
4404 if (!buf) return (FALSE);
4406 /* Be sure we have an insertion string */
4407 if (!insert) insert = "";
4409 /* Extract some lengths */
4410 t_len = strlen(target);
4411 i_len = strlen(insert);
4412 b_len = strlen(buf);
4414 /* How much "movement" do we need? */
4415 len = i_len - t_len;
4417 /* We need less space (for insert) */
4420 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4423 /* We need more space (for insert) */
4426 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4429 /* If movement occured, we need a new terminator */
4430 if (len) buf[b_len+len] = '\0';
4432 /* Now copy the insertion string */
4433 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4435 /* Successful operation */
4445 * Called from cmd4.c and a few other places. Just extracts
4446 * a direction from the keymap for ch (the last direction,
4447 * in fact) byte or char here? I'm thinking that keymaps should
4448 * generally only apply to single keys, which makes it no more
4449 * than 128, so a char should suffice... but keymap_act is 256...
4451 int get_keymap_dir(char ch)
4455 /* Already a direction? */
4466 if (rogue_like_commands)
4468 mode = KEYMAP_MODE_ROGUE;
4474 mode = KEYMAP_MODE_ORIG;
4477 /* Extract the action (if any) */
4478 act = keymap_act[mode][(byte)(ch)];
4483 /* Convert to a direction */
4484 for (s = act; *s; ++s)
4486 /* Use any digits in keymap */
4487 if (isdigit(*s)) d = D2I(*s);
4495 /* Return direction */
4500 #ifdef ALLOW_REPEAT /* TNB */
4502 #define REPEAT_MAX 20
4504 /* Number of chars saved */
4505 static int repeat__cnt = 0;
4508 static int repeat__idx = 0;
4511 static int repeat__key[REPEAT_MAX];
4514 void repeat_push(int what)
4517 if (repeat__cnt == REPEAT_MAX) return;
4519 /* Push the "stuff" */
4520 repeat__key[repeat__cnt++] = what;
4522 /* Prevents us from pulling keys */
4527 bool repeat_pull(int *what)
4529 /* All out of keys */
4530 if (repeat__idx == repeat__cnt) return (FALSE);
4532 /* Grab the next key, advance */
4533 *what = repeat__key[repeat__idx++];
4539 void repeat_check(void)
4543 /* Ignore some commands */
4544 if (command_cmd == ESCAPE) return;
4545 if (command_cmd == ' ') return;
4546 if (command_cmd == '\r') return;
4547 if (command_cmd == '\n') return;
4549 /* Repeat Last Command */
4550 if (command_cmd == 'n')
4555 /* Get the command */
4556 if (repeat_pull(&what))
4558 /* Save the command */
4563 /* Start saving new command */
4572 /* Save this command */
4577 #endif /* ALLOW_REPEAT -- TNB */
4583 * Array size for which InsertionSort
4584 * is used instead of QuickSort
4590 * Exchange two sort-entries
4591 * (should probably be coded inline
4592 * for speed increase)
4594 static void swap(tag_type *a, tag_type *b)
4599 temp.pointer = a->pointer;
4602 a->pointer = b->pointer;
4605 b->pointer = temp.pointer;
4610 * Insertion-Sort algorithm
4611 * (used by the Quicksort algorithm)
4613 static void InsertionSort(tag_type elements[], int number)
4619 for (P = 1; P < number; P++)
4622 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4623 elements[j] = elements[j - 1];
4630 * Helper function for Quicksort
4632 static tag_type median3(tag_type elements[], int left, int right)
4634 int center = (left + right) / 2;
4636 if (elements[left].tag > elements[center].tag)
4637 swap(&elements[left], &elements[center]);
4638 if (elements[left].tag > elements[right].tag)
4639 swap(&elements[left], &elements[right]);
4640 if (elements[center].tag > elements[right].tag)
4641 swap(&elements[center], &elements[right]);
4643 swap(&elements[center], &elements[right - 1]);
4644 return (elements[right - 1]);
4649 * Quicksort algorithm
4651 * The "median of three" pivot selection eliminates
4652 * the bad case of already sorted input.
4654 * We use InsertionSort for smaller sub-arrays,
4655 * because it is faster in this case.
4657 * For details see: "Data Structures and Algorithm
4658 * Analysis in C" by Mark Allen Weiss.
4660 static void quicksort(tag_type elements[], int left, int right)
4665 if (left + CUTOFF <= right)
4667 pivot = median3(elements, left, right);
4669 i = left; j = right -1;
4673 while (elements[++i].tag < pivot.tag);
4674 while (elements[--j].tag > pivot.tag);
4677 swap(&elements[i], &elements[j]);
4683 swap(&elements[i], &elements[right - 1]);
4685 quicksort(elements, left, i - 1);
4686 quicksort(elements, i + 1, right);
4690 /* Use InsertionSort on small arrays */
4691 InsertionSort(elements + left, right - left + 1);
4697 * Frontend for the sorting algorithm
4699 * Sorts an array of tagged pointers
4700 * with <number> elements.
4702 void tag_sort(tag_type elements[], int number)
4704 quicksort(elements, 0, number - 1);
4707 #endif /* SORT_R_INFO */
4709 #ifdef SUPPORT_GAMMA
4711 /* Table of gamma values */
4712 byte gamma_table[256];
4714 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4715 static s16b gamma_helper[256] =
4717 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4718 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4719 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4720 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4721 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4722 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4723 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4724 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4725 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4726 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4727 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4728 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4729 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4730 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4731 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4732 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4737 * Build the gamma table so that floating point isn't needed.
4739 * Note gamma goes from 0->256. The old value of 100 is now 128.
4741 void build_gamma_table(int gamma)
4746 * value is the current sum.
4747 * diff is the new term to add to the series.
4751 /* Hack - convergence is bad in these cases. */
4753 gamma_table[255] = 255;
4755 for (i = 1; i < 255; i++)
4758 * Initialise the Taylor series
4760 * value and diff have been scaled by 256
4765 diff = ((long)gamma_helper[i]) * (gamma - 256);
4774 * Use the following identiy to calculate the gamma table.
4775 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4777 * n is the current term number.
4779 * The gamma_helper array contains a table of
4781 * This is used because a^b = exp(b*ln(a))
4787 * Note that everything is scaled by 256 for accuracy,
4788 * plus another factor of 256 for the final result to
4789 * be from 0-255. Thus gamma_helper[] * gamma must be
4790 * divided by 256*256 each itteration, to get back to
4791 * the original power series.
4793 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4797 * Store the value in the table so that the
4798 * floating point pow function isn't needed .
4800 gamma_table[i] = ((long)(value / 256) * i) / 256;
4804 #endif /* SUPPORT_GAMMA */
4806 void roff_to_buf(cptr str, int maxlen, char *tbuf)
4815 while (str[read_pt])
4818 bool kinsoku = FALSE;
4823 /* Prepare one character */
4824 ch[0] = str[read_pt];
4827 kanji = iskanji(ch[0]);
4831 ch[1] = str[read_pt+1];
4834 if (strcmp(ch, "¡£") == 0 ||
4835 strcmp(ch, "¡¢") == 0 ||
4836 strcmp(ch, "¥£") == 0 ||
4837 strcmp(ch, "¡¼") == 0)
4840 else if (!isprint(ch[0]))
4843 if (!isprint(ch[0]))
4847 if (line_len + ch_len > maxlen - 1 || str[read_pt] == '\n')
4851 /* return to better wrapping point. */
4852 /* Space character at the end of the line need not to be printed. */
4853 word_len = read_pt - word_punct;
4855 if (kanji && !kinsoku)
4859 if (ch[0] == ' ' || word_len >= line_len/2)
4863 read_pt = word_punct;
4864 if (str[word_punct] == ' ')
4866 write_pt -= word_len;
4869 tbuf[write_pt++] = '\0';
4871 word_punct = read_pt;
4875 word_punct = read_pt;
4877 if (!kinsoku) word_punct = read_pt;
4879 tbuf[write_pt++] = ch[0];
4885 tbuf[write_pt++] = ch[1];
4891 tbuf[write_pt] = '\0';
4892 tbuf[write_pt+1] = '\0';
4899 * The my_strcpy() function copies up to 'bufsize'-1 characters from 'src'
4900 * to 'buf' and NUL-terminates the result. The 'buf' and 'src' strings may
4903 * my_strcpy() returns strlen(src). This makes checking for truncation
4904 * easy. Example: if (my_strcpy(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
4906 * This function should be equivalent to the strlcpy() function in BSD.
4908 size_t my_strcpy(char *buf, const char *src, size_t bufsize)
4913 const char *s = src;
4916 /* reserve for NUL termination */
4919 /* Copy as many bytes as will fit */
4920 while (len < bufsize)
4924 if (len + 1 >= bufsize || !*(s+1)) break;
4942 size_t len = strlen(src);
4946 if (bufsize == 0) return ret;
4949 if (len >= bufsize) len = bufsize - 1;
4951 /* Copy the string and terminate it */
4952 (void)memcpy(buf, src, len);
4955 /* Return strlen(src) */
4963 * The my_strcat() tries to append a string to an existing NUL-terminated string.
4964 * It never writes more characters into the buffer than indicated by 'bufsize' and
4965 * NUL-terminates the buffer. The 'buf' and 'src' strings may not overlap.
4967 * my_strcat() returns strlen(buf) + strlen(src). This makes checking for
4968 * truncation easy. Example:
4969 * if (my_strcat(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
4971 * This function should be equivalent to the strlcat() function in BSD.
4973 size_t my_strcat(char *buf, const char *src, size_t bufsize)
4975 size_t dlen = strlen(buf);
4977 /* Is there room left in the buffer? */
4978 if (dlen < bufsize - 1)
4980 /* Append as much as possible */
4981 return (dlen + my_strcpy(buf + dlen, src, bufsize - dlen));
4985 /* Return without appending */
4986 return (dlen + strlen(src));