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 */
202 (void)strnfmt(buf, max, "%s", file);
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 if (s) strnfmt(buf, max, "%s%s", pw->pw_dir, s);
236 else strnfmt(buf, max, "%s", pw->pw_dir);
247 * Extract a "parsed" path from an initial filename
249 * This requires no special processing on simple machines,
250 * except for verifying the size of the filename.
252 errr path_parse(char *buf, int max, cptr file)
254 /* Accept the filename */
255 (void)strnfmt(buf, max, "%s", file);
268 * Hack -- acquire a "temporary" file name if possible
270 * This filename is always in "system-specific" form.
272 static errr path_temp(char *buf, int max)
282 /* Format to length */
283 (void)strnfmt(buf, max, "%s", s);
292 * Create a new path by appending a file (or directory) to a path.
294 * This requires no special processing on simple machines, except
295 * for verifying the size of the filename, but note the ability to
296 * bypass the given "path" with certain special file-names.
298 * Note that the "file" may actually be a "sub-path", including
301 * Note that this function yields a path which must be "parsed"
302 * using the "parse" function above.
304 errr path_build(char *buf, int max, cptr path, cptr file)
309 /* Use the file itself */
310 (void)strnfmt(buf, max, "%s", file);
313 /* Absolute file, on "normal" systems */
314 else if (prefix(file, PATH_SEP) && !streq(PATH_SEP, ""))
316 /* Use the file itself */
317 (void)strnfmt(buf, max, "%s", file);
323 /* Use the file itself */
324 (void)strnfmt(buf, max, "%s", file);
330 /* Build the new path */
331 (void)strnfmt(buf, max, "%s%s%s", path, PATH_SEP, file);
340 * Hack -- replacement for "fopen()"
342 FILE *my_fopen(cptr file, cptr mode)
346 #if defined(MACINTOSH) && defined(MAC_MPW)
350 /* Hack -- Try to parse the path */
351 if (path_parse(buf, 1024, file)) return (NULL);
353 #if defined(MACINTOSH) && defined(MAC_MPW)
354 if (strchr(mode, 'w'))
356 /* setting file type/creator */
357 tempfff = fopen(buf, mode);
358 fsetfileinfo(file, _fcreator, _ftype);
363 /* Attempt to fopen the file anyway */
364 return (fopen(buf, mode));
369 * Hack -- replacement for "fclose()"
371 errr my_fclose(FILE *fff)
374 if (!fff) return (-1);
376 /* Close, check for error */
377 if (fclose(fff) == EOF) return (1);
389 FILE *my_fopen_temp(char *buf, int max)
393 /* Prepare the buffer for mkstemp */
394 strncpy(buf, "/tmp/anXXXXXX", max);
396 /* Secure creation of a temporary file */
399 /* Check the file-descriptor */
400 if (fd < 0) return (NULL);
402 /* Return a file stream */
403 return (fdopen(fd, "w"));
406 #else /* HAVE_MKSTEMP */
408 FILE *my_fopen_temp(char *buf, int max)
410 /* Generate a temporary filename */
411 if (path_temp(buf, max)) return (NULL);
414 return (my_fopen(buf, "w"));
417 #endif /* HAVE_MKSTEMP */
421 * Hack -- replacement for "fgets()"
423 * Read a string, without a newline, to a file
425 * Process tabs, strip internal non-printables
427 errr my_fgets(FILE *fff, char *buf, huge n)
436 if (fgets(tmp, 1024, fff))
438 /* Convert weirdness */
439 for (s = tmp; *s; s++)
454 /* Hack -- require room */
455 if (i + 8 >= n) break;
460 /* Append some more spaces */
461 while (!(i % 8)) buf[i++] = ' ';
465 else if (iskanji(*s))
473 else if ((((int)*s & 0xff) > 0xa1) && (((int)*s & 0xff ) < 0xdf))
480 /* Handle printables */
481 else if (isprint(*s))
490 /* No newline character, but terminate */
506 * Hack -- replacement for "fputs()"
508 * Dump a string, plus a newline, to a file
510 * XXX XXX XXX Process internal weirdness?
512 errr my_fputs(FILE *fff, cptr buf, huge n)
517 /* Dump, ignore errors */
518 (void)fprintf(fff, "%s\n", buf);
529 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
531 * Many of them can be rewritten now that only "fd_open()" and "fd_make()"
532 * and "my_fopen()" should ever create files.
540 * Code Warrior is a little weird about some functions
543 extern int open(const char *, int, ...);
544 extern int close(int);
545 extern int read(int, void *, unsigned int);
546 extern int write(int, const void *, unsigned int);
547 extern long lseek(int, long, int);
548 #endif /* BEN_HACK */
552 * The Macintosh is a little bit brain-dead sometimes
555 # define open(N,F,M) \
556 ((M), open((char*)(N),F))
557 # define write(F,B,S) \
558 write(F,(char*)(B),S)
559 #endif /* MACINTOSH */
563 * Several systems have no "O_BINARY" flag
567 #endif /* O_BINARY */
571 * Hack -- attempt to delete a file
573 errr fd_kill(cptr file)
577 /* Hack -- Try to parse the path */
578 if (path_parse(buf, 1024, file)) return (-1);
589 * Hack -- attempt to move a file
591 errr fd_move(cptr file, cptr what)
596 /* Hack -- Try to parse the path */
597 if (path_parse(buf, 1024, file)) return (-1);
599 /* Hack -- Try to parse the path */
600 if (path_parse(aux, 1024, what)) return (-1);
603 (void)rename(buf, aux);
611 * Hack -- attempt to copy a file
613 errr fd_copy(cptr file, cptr what)
620 /* Hack -- Try to parse the path */
621 if (path_parse(buf, 1024, file)) return (-1);
623 /* Hack -- Try to parse the path */
624 if (path_parse(aux, 1024, what)) return (-1);
626 /* Open source file */
627 src_fd = fd_open(buf, O_RDONLY);
628 if (src_fd < 0) return (-1);
630 /* Open destination file */
631 dst_fd = fd_open(aux, O_WRONLY|O_TRUNC|O_CREAT);
632 if (dst_fd < 0) return (-1);
635 while ((read_num = read(src_fd, buf, 1024)) > 0)
637 write(dst_fd, buf, read_num);
650 * Hack -- attempt to open a file descriptor (create file)
652 * This function should fail if the file already exists
654 * Note that we assume that the file should be "binary"
656 * XXX XXX XXX The horrible "BEN_HACK" code is for compiling under
657 * the CodeWarrior compiler, in which case, for some reason, none
658 * of the "O_*" flags are defined, and we must fake the definition
659 * of "O_RDONLY", "O_WRONLY", and "O_RDWR" in "A-win-h", and then
660 * we must simulate the effect of the proper "open()" call below.
662 int fd_make(cptr file, int mode)
666 /* Hack -- Try to parse the path */
667 if (path_parse(buf, 1024, file)) return (-1);
671 /* Check for existance */
672 /* if (fd_close(fd_open(file, O_RDONLY | O_BINARY))) return (1); */
674 /* Mega-Hack -- Create the file */
675 (void)my_fclose(my_fopen(file, "wb"));
677 /* Re-open the file for writing */
678 return (open(buf, O_WRONLY | O_BINARY, mode));
682 # if defined(MACINTOSH) && defined(MAC_MPW)
684 /* 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);
693 /* Create the file, fail if exists, write-only, binary */
694 return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
697 #endif /* BEN_HACK */
703 * Hack -- attempt to open a file descriptor (existing file)
705 * Note that we assume that the file should be "binary"
707 int fd_open(cptr file, int flags)
711 /* Hack -- Try to parse the path */
712 if (path_parse(buf, 1024, file)) return (-1);
714 /* Attempt to open the file */
715 return (open(buf, flags | O_BINARY, 0));
720 * Hack -- attempt to lock a file descriptor
722 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
724 errr fd_lock(int fd, int what)
727 what = what ? what : 0;
730 if (fd < 0) return (-1);
736 # if defined(F_ULOCK) && defined(F_LOCK)
741 /* Unlock it, Ignore errors */
742 lockf(fd, F_ULOCK, 0);
748 /* Lock the score file */
749 if (lockf(fd, F_LOCK, 0) != 0) return (1);
756 # if defined(LOCK_UN) && defined(LOCK_EX)
761 /* Unlock it, Ignore errors */
762 (void)flock(fd, LOCK_UN);
768 /* Lock the score file */
769 if (flock(fd, LOCK_EX) != 0) return (1);
784 * Hack -- attempt to seek on a file descriptor
786 errr fd_seek(int fd, huge n)
791 if (fd < 0) return (-1);
793 /* Seek to the given position */
794 p = lseek(fd, n, SEEK_SET);
797 if (p != n) return (1);
805 * Hack -- attempt to truncate a file descriptor
807 errr fd_chop(int fd, huge n)
813 if (fd < 0) return (-1);
815 #if defined(SUNOS) || defined(ULTRIX) || defined(NeXT)
826 * Hack -- attempt to read data from a file descriptor
828 errr fd_read(int fd, char *buf, huge n)
831 if (fd < 0) return (-1);
839 if (read(fd, buf, 16384) != 16384) return (1);
841 /* Shorten the task */
844 /* Shorten the task */
850 /* Read the final piece */
851 if (read(fd, buf, n) != (int)n) return (1);
859 * Hack -- Attempt to write data to a file descriptor
861 errr fd_write(int fd, cptr buf, huge n)
864 if (fd < 0) return (-1);
872 if (write(fd, buf, 16384) != 16384) return (1);
874 /* Shorten the task */
877 /* Shorten the task */
883 /* Write the final piece */
884 if (write(fd, buf, n) != (int)n) return (1);
892 * Hack -- attempt to close a file descriptor
894 errr fd_close(int fd)
897 if (fd < 0) return (-1);
913 * XXX XXX XXX Important note about "colors" XXX XXX XXX
915 * The "TERM_*" color definitions list the "composition" of each
916 * "Angband color" in terms of "quarters" of each of the three color
917 * components (Red, Green, Blue), for example, TERM_UMBER is defined
918 * as 2/4 Red, 1/4 Green, 0/4 Blue.
920 * The following info is from "Torbjorn Lindgren" (see "main-xaw.c").
922 * These values are NOT gamma-corrected. On most machines (with the
923 * Macintosh being an important exception), you must "gamma-correct"
924 * the given values, that is, "correct for the intrinsic non-linearity
925 * of the phosphor", by converting the given intensity levels based
926 * on the "gamma" of the target screen, which is usually 1.7 (or 1.5).
928 * The actual formula for conversion is unknown to me at this time,
929 * but you can use the table below for the most common gamma values.
931 * So, on most machines, simply convert the values based on the "gamma"
932 * of the target screen, which is usually in the range 1.5 to 1.7, and
933 * usually is closest to 1.7. The converted value for each of the five
934 * different "quarter" values is given below:
936 * Given Gamma 1.0 Gamma 1.5 Gamma 1.7 Hex 1.7
937 * ----- ---- ---- ---- ---
938 * 0/4 0.00 0.00 0.00 #00
939 * 1/4 0.25 0.27 0.28 #47
940 * 2/4 0.50 0.55 0.56 #8f
941 * 3/4 0.75 0.82 0.84 #d7
942 * 4/4 1.00 1.00 1.00 #ff
944 * Note that some machines (i.e. most IBM machines) are limited to a
945 * hard-coded set of colors, and so the information above is useless.
947 * Also, some machines are limited to a pre-determined set of colors,
948 * for example, the IBM can only display 16 colors, and only 14 of
949 * those colors resemble colors used by Angband, and then only when
950 * you ignore the fact that "Slate" and "cyan" are not really matches,
951 * so on the IBM, we use "orange" for both "Umber", and "Light Umber"
952 * in addition to the obvious "Orange", since by combining all of the
953 * "indeterminate" colors into a single color, the rest of the colors
954 * are left with "meaningful" values.
961 void move_cursor(int row, int col)
963 Term_gotoxy(col, row);
969 * Convert a decimal to a single digit octal number
971 static char octify(uint i)
973 return (hexsym[i%8]);
977 * Convert a decimal to a single digit hex number
979 static char hexify(uint i)
981 return (hexsym[i%16]);
986 * Convert a octal-digit into a decimal
988 static int deoct(char c)
990 if (isdigit(c)) return (D2I(c));
995 * Convert a hexidecimal-digit into a decimal
997 static int dehex(char c)
999 if (isdigit(c)) return (D2I(c));
1000 if (islower(c)) return (A2I(c) + 10);
1001 if (isupper(c)) return (A2I(tolower(c)) + 10);
1006 static int my_stricmp(cptr a, cptr b)
1011 /* Scan the strings */
1012 for (s1 = a, s2 = b; TRUE; s1++, s2++)
1014 z1 = FORCEUPPER(*s1);
1015 z2 = FORCEUPPER(*s2);
1016 if (z1 < z2) return (-1);
1017 if (z1 > z2) return (1);
1018 if (!z1) return (0);
1022 static int my_strnicmp(cptr a, cptr b, int n)
1027 /* Scan the strings */
1028 for (s1 = a, s2 = b; n > 0; s1++, s2++, n--)
1030 z1 = FORCEUPPER(*s1);
1031 z2 = FORCEUPPER(*s2);
1032 if (z1 < z2) return (-1);
1033 if (z1 > z2) return (1);
1034 if (!z1) return (0);
1040 static void trigger_text_to_ascii(char **bufptr, cptr *strptr)
1044 bool mod_status[MAX_MACRO_MOD];
1047 int shiftstatus = 0;
1050 if (macro_template == NULL)
1053 for (i = 0; macro_modifier_chr[i]; i++)
1054 mod_status[i] = FALSE;
1057 /* Examine modifier keys */
1060 for (i=0; macro_modifier_chr[i]; i++)
1062 len = strlen(macro_modifier_name[i]);
1064 if(!my_strnicmp(str, macro_modifier_name[i], len))
1067 if (!macro_modifier_chr[i]) break;
1069 mod_status[i] = TRUE;
1070 if ('S' == macro_modifier_chr[i])
1073 for (i = 0; i < max_macrotrigger; i++)
1075 len = strlen(macro_trigger_name[i]);
1076 if (!my_strnicmp(str, macro_trigger_name[i], len) && ']' == str[len])
1078 /* a trigger name found */
1083 /* Invalid trigger name? */
1084 if (i == max_macrotrigger)
1086 str = strchr(str, ']');
1092 *strptr = str; /* where **strptr == ']' */
1096 key_code = macro_trigger_keycode[shiftstatus][i];
1100 for (i = 0; macro_template[i]; i++)
1102 char ch = macro_template[i];
1108 for (j = 0; macro_modifier_chr[j]; j++) {
1110 *s++ = macro_modifier_chr[j];
1114 strcpy(s, key_code);
1115 s += strlen(key_code);
1125 *strptr = str; /* where **strptr == ']' */
1131 * Hack -- convert a printable string into real ascii
1133 * I have no clue if this function correctly handles, for example,
1134 * parsing "\xFF" into a (signed) char. Whoever thought of making
1135 * the "sign" of a "char" undefined is a complete moron. Oh well.
1137 void text_to_ascii(char *buf, cptr str)
1141 /* Analyze the "ascii" string */
1144 /* Backslash codes */
1147 /* Skip the backslash */
1153 trigger_text_to_ascii(&s, &str);
1160 *s = 16 * dehex(*++str);
1161 *s++ += dehex(*++str);
1164 /* Hack -- simple way to specify "backslash" */
1165 else if (*str == '\\')
1170 /* Hack -- simple way to specify "caret" */
1171 else if (*str == '^')
1176 /* Hack -- simple way to specify "space" */
1177 else if (*str == 's')
1182 /* Hack -- simple way to specify Escape */
1183 else if (*str == 'e')
1189 else if (*str == 'b')
1195 else if (*str == 'n')
1201 else if (*str == 'r')
1207 else if (*str == 't')
1213 else if (*str == '0')
1215 *s = 8 * deoct(*++str);
1216 *s++ += deoct(*++str);
1220 else if (*str == '1')
1222 *s = 64 + 8 * deoct(*++str);
1223 *s++ += deoct(*++str);
1227 else if (*str == '2')
1229 *s = 64 * 2 + 8 * deoct(*++str);
1230 *s++ += deoct(*++str);
1234 else if (*str == '3')
1236 *s = 64 * 3 + 8 * deoct(*++str);
1237 *s++ += deoct(*++str);
1240 /* Skip the final char */
1244 /* Normal Control codes */
1245 else if (*str == '^')
1248 *s++ = (*str++ & 037);
1263 static bool trigger_ascii_to_text(char **bufptr, cptr *strptr)
1271 if (macro_template == NULL)
1277 for (i = 0; macro_template[i]; i++)
1280 char ch = macro_template[i];
1285 while ((tmp = strchr(macro_modifier_chr, *str)))
1287 j = (int)(tmp - macro_modifier_chr);
1288 tmp = macro_modifier_name[j];
1289 while(*tmp) *s++ = *tmp++;
1294 for (j = 0; *str && *str != '\r'; j++)
1295 key_code[j] = *str++;
1299 if (ch != *str) return FALSE;
1303 if (*str++ != '\r') return FALSE;
1305 for (i = 0; i < max_macrotrigger; i++)
1307 if (!my_stricmp(key_code, macro_trigger_keycode[0][i])
1308 || !my_stricmp(key_code, macro_trigger_keycode[1][i]))
1311 if (i == max_macrotrigger)
1314 tmp = macro_trigger_name[i];
1315 while (*tmp) *s++ = *tmp++;
1326 * Hack -- convert a string into a printable form
1328 void ascii_to_text(char *buf, cptr str)
1332 /* Analyze the "ascii" string */
1335 byte i = (byte)(*str++);
1340 if(!trigger_ascii_to_text(&s, &str))
1401 *s++ = octify(i / 8);
1402 *s++ = octify(i % 8);
1408 *s++ = hexify(i / 16);
1409 *s++ = hexify(i % 16);
1420 * The "macro" package
1422 * Functions are provided to manipulate a collection of macros, each
1423 * of which has a trigger pattern string and a resulting action string
1424 * and a small set of flags.
1430 * Determine if any macros have ever started with a given character.
1432 static bool macro__use[256];
1436 * Find the macro (if any) which exactly matches the given pattern
1438 sint macro_find_exact(cptr pat)
1442 /* Nothing possible */
1443 if (!macro__use[(byte)(pat[0])])
1448 /* Scan the macros */
1449 for (i = 0; i < macro__num; ++i)
1451 /* Skip macros which do not match the pattern */
1452 if (!streq(macro__pat[i], pat)) continue;
1464 * Find the first macro (if any) which contains the given pattern
1466 static sint macro_find_check(cptr pat)
1470 /* Nothing possible */
1471 if (!macro__use[(byte)(pat[0])])
1476 /* Scan the macros */
1477 for (i = 0; i < macro__num; ++i)
1479 /* Skip macros which do not contain the pattern */
1480 if (!prefix(macro__pat[i], pat)) continue;
1492 * Find the first macro (if any) which contains the given pattern and more
1494 static sint macro_find_maybe(cptr pat)
1498 /* Nothing possible */
1499 if (!macro__use[(byte)(pat[0])])
1504 /* Scan the macros */
1505 for (i = 0; i < macro__num; ++i)
1507 /* Skip macros which do not contain the pattern */
1508 if (!prefix(macro__pat[i], pat)) continue;
1510 /* Skip macros which exactly match the pattern XXX XXX */
1511 if (streq(macro__pat[i], pat)) continue;
1523 * Find the longest macro (if any) which starts with the given pattern
1525 static sint macro_find_ready(cptr pat)
1527 int i, t, n = -1, s = -1;
1529 /* Nothing possible */
1530 if (!macro__use[(byte)(pat[0])])
1535 /* Scan the macros */
1536 for (i = 0; i < macro__num; ++i)
1538 /* Skip macros which are not contained by the pattern */
1539 if (!prefix(pat, macro__pat[i])) continue;
1541 /* Obtain the length of this macro */
1542 t = strlen(macro__pat[i]);
1544 /* Only track the "longest" pattern */
1545 if ((n >= 0) && (s > t)) continue;
1547 /* Track the entry */
1558 * Add a macro definition (or redefinition).
1560 * We should use "act == NULL" to "remove" a macro, but this might make it
1561 * impossible to save the "removal" of a macro definition. XXX XXX XXX
1563 * We should consider refusing to allow macros which contain existing macros,
1564 * or which are contained in existing macros, because this would simplify the
1565 * macro analysis code. XXX XXX XXX
1567 * We should consider removing the "command macro" crap, and replacing it
1568 * with some kind of "powerful keymap" ability, but this might make it hard
1569 * to change the "roguelike" option from inside the game. XXX XXX XXX
1571 errr macro_add(cptr pat, cptr act)
1576 /* Paranoia -- require data */
1577 if (!pat || !act) return (-1);
1580 /* Look for any existing macro */
1581 n = macro_find_exact(pat);
1583 /* Replace existing macro */
1586 /* Free the old macro action */
1587 string_free(macro__act[n]);
1590 /* Create a new macro */
1593 /* Acquire a new index */
1596 /* Save the pattern */
1597 macro__pat[n] = string_make(pat);
1600 /* Save the action */
1601 macro__act[n] = string_make(act);
1604 macro__use[(byte)(pat[0])] = TRUE;
1613 * Local variable -- we are inside a "macro action"
1615 * Do not match any macros until "ascii 30" is found.
1617 static bool parse_macro = FALSE;
1620 * Local variable -- we are inside a "macro trigger"
1622 * Strip all keypresses until a low ascii value is found.
1624 static bool parse_under = FALSE;
1628 * Flush all input chars. Actually, remember the flush,
1629 * and do a "special flush" before the next "inkey()".
1631 * This is not only more efficient, but also necessary to make sure
1632 * that various "inkey()" codes are not "lost" along the way.
1642 * Flush the screen, make a noise
1646 /* Mega-Hack -- Flush the output */
1649 /* Make a bell noise (if allowed) */
1650 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1652 /* Flush the input (later!) */
1658 * Hack -- Make a (relevant?) sound
1663 if (!use_sound) return;
1665 /* Make a sound (if allowed) */
1666 Term_xtra(TERM_XTRA_SOUND, val);
1672 * Helper function called only from "inkey()"
1674 * This function does almost all of the "macro" processing.
1676 * We use the "Term_key_push()" function to handle "failed" macros, as well
1677 * as "extra" keys read in while choosing the proper macro, and also to hold
1678 * the action for the macro, plus a special "ascii 30" character indicating
1679 * that any macro action in progress is complete. Embedded macros are thus
1680 * illegal, unless a macro action includes an explicit "ascii 30" character,
1681 * which would probably be a massive hack, and might break things.
1683 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1684 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1685 * macro trigger, 500 milliseconds must pass before the key sequence is
1686 * known not to be that macro trigger. XXX XXX XXX
1688 static char inkey_aux(void)
1690 int k = 0, n, p = 0, w = 0;
1698 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£ */
1703 /* Scan next keypress from macro action */
1704 if (Term_inkey(&ch, FALSE, TRUE))
1706 /* Over-flowed? Cancel macro action */
1707 parse_macro = FALSE;
1712 /* Wait for a keypress */
1713 (void) (Term_inkey(&ch, TRUE, TRUE));
1717 /* End "macro action" */
1718 if (ch == 30) parse_macro = FALSE;
1720 /* Inside "macro action" */
1721 if (ch == 30) return (ch);
1723 /* Inside "macro action" */
1724 if (parse_macro) return (ch);
1726 /* Inside "macro trigger" */
1727 if (parse_under) return (ch);
1729 /* Parse special key only */
1730 if (inkey_special && ch != 31) return (ch);
1732 /* Save the first key, advance */
1737 /* Check for possible macro */
1738 k = macro_find_check(buf);
1740 /* No macro pending */
1741 if (k < 0) return (ch);
1744 /* Wait for a macro, or a timeout */
1747 /* Check for pending macro */
1748 k = macro_find_maybe(buf);
1750 /* No macro pending */
1753 /* Check for (and remove) a pending key */
1754 if (0 == Term_inkey(&ch, FALSE, TRUE))
1756 /* Append the key */
1767 /* Increase "wait" */
1770 /* Excessive delay */
1771 if (w >= 100) break;
1774 Term_xtra(TERM_XTRA_DELAY, w);
1779 /* Check for available macro */
1780 k = macro_find_ready(buf);
1782 /* No macro available */
1785 /* Push all the keys back on the queue */
1788 /* Push the key, notice over-flow */
1789 if (Term_key_push(buf[--p])) return (0);
1792 /* Wait for (and remove) a pending key */
1793 (void)Term_inkey(&ch, TRUE, TRUE);
1795 /* Return the key */
1800 /* Get the pattern */
1801 pat = macro__pat[k];
1803 /* Get the length of the pattern */
1806 /* Push the "extra" keys back on the queue */
1809 /* Push the key, notice over-flow */
1810 if (Term_key_push(buf[--p])) return (0);
1814 /* Begin "macro action" */
1817 /* Push the "end of macro action" key */
1818 if (Term_key_push(30)) return (0);
1821 /* Access the macro action */
1822 act = macro__act[k];
1824 /* Get the length of the action */
1827 /* Push the macro "action" onto the key queue */
1830 /* Push the key, notice over-flow */
1831 if (Term_key_push(act[--n])) return (0);
1835 /* Hack -- Force "inkey()" to call us again */
1841 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1843 * This special pointer allows a sequence of keys to be "inserted" into
1844 * the stream of keys returned by "inkey()". This key sequence will not
1845 * trigger any macros, and cannot be bypassed by the Borg. It is used
1846 * in Angband to handle "keymaps".
1848 static cptr inkey_next = NULL;
1854 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1856 * This special function hook allows the "Borg" (see elsewhere) to take
1857 * control of the "inkey()" function, and substitute in fake keypresses.
1859 char (*inkey_hack)(int flush_first) = NULL;
1861 #endif /* ALLOW_BORG */
1866 * Get a keypress from the user.
1868 * This function recognizes a few "global parameters". These are variables
1869 * which, if set to TRUE before calling this function, will have an effect
1870 * on this function, and which are always reset to FALSE by this function
1871 * before this function returns. Thus they function just like normal
1872 * parameters, except that most calls to this function can ignore them.
1874 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1875 * and any macro processing in progress will be aborted. This flag is
1876 * set by the "flush()" function, which does not actually flush anything
1877 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1879 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1880 * keypress is available, instead of waiting for a keypress.
1882 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1883 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1884 * not return immediately, but will wait for a keypress for as long as the
1885 * normal macro matching code would, allowing the direct entry of macro
1886 * triggers. The "inkey_base" flag is extremely dangerous!
1888 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1889 * normal command, and we will only show the cursor if "hilite_player" is
1890 * TRUE (or if the player is in a store), instead of always showing the
1891 * cursor. The various "main-xxx.c" files should avoid saving the game
1892 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1893 * prevent savefile corruption.
1895 * If we are waiting for a keypress, and no keypress is ready, then we will
1896 * refresh (once) the window which was active when this function was called.
1898 * Note that "back-quote" is automatically converted into "escape" for
1899 * convenience on machines with no "escape" key. This is done after the
1900 * macro matching, so the user can still make a macro for "backquote".
1902 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1903 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1904 * provide support for simple keyboard "macros". These keys are so strange
1905 * that their loss as normal keys will probably be noticed by nobody. The
1906 * "ascii 30" key is used to indicate the "end" of a macro action, which
1907 * allows recursive macros to be avoided. The "ascii 31" key is used by
1908 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1910 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1911 * which can be used to give a variety of "sub-commands" which can be used
1912 * any time. These sub-commands could include commands to take a picture of
1913 * the current screen, to start/stop recording a macro action, etc.
1915 * If "angband_term[0]" is not active, we will make it active during this
1916 * function, so that the various "main-xxx.c" files can assume that input
1917 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1919 * Mega-Hack -- This function is used as the entry point for clearing the
1920 * "signal_count" variable, and of the "character_saved" variable.
1922 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1924 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1925 * control of the keyboard from the user.
1935 /* Hack -- Use the "inkey_next" pointer */
1936 if (inkey_next && *inkey_next && !inkey_xtra)
1938 /* Get next character, and advance */
1941 /* Cancel the various "global parameters" */
1942 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
1948 /* Forget pointer */
1954 /* Mega-Hack -- Use the special hook */
1955 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1957 /* Cancel the various "global parameters" */
1958 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
1964 #endif /* ALLOW_BORG */
1967 /* Hack -- handle delayed "flush()" */
1970 /* End "macro action" */
1971 parse_macro = FALSE;
1973 /* End "macro trigger" */
1974 parse_under = FALSE;
1976 /* Forget old keypresses */
1981 /* Access cursor state */
1982 (void)Term_get_cursor(&v);
1984 /* Show the cursor if waiting, except sometimes in "command" mode */
1985 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1987 /* Show the cursor */
1988 (void)Term_set_cursor(1);
1992 /* Hack -- Activate main screen */
1993 Term_activate(angband_term[0]);
1999 /* Hack -- Handle "inkey_scan" */
2000 if (!inkey_base && inkey_scan &&
2001 (0 != Term_inkey(&kk, FALSE, FALSE)))
2007 /* Hack -- Flush output once when no key ready */
2008 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
2010 /* Hack -- activate proper term */
2016 /* Hack -- activate main screen */
2017 Term_activate(angband_term[0]);
2019 /* Mega-Hack -- reset saved flag */
2020 character_saved = FALSE;
2022 /* Mega-Hack -- reset signal counter */
2030 /* Hack -- Handle "inkey_base" */
2038 /* Wait for (and remove) a pending key */
2039 if (0 == Term_inkey(&ch, TRUE, TRUE))
2052 /* Check for (and remove) a pending key */
2053 if (0 == Term_inkey(&ch, FALSE, TRUE))
2062 /* Increase "wait" */
2065 /* Excessive delay */
2066 if (w >= 100) break;
2069 Term_xtra(TERM_XTRA_DELAY, w);
2078 /* Get a key (see above) */
2082 /* Handle "control-right-bracket" */
2085 /* Strip this key */
2093 /* Treat back-quote as escape */
2094 /* if (ch == '`') ch = ESCAPE; */
2097 /* End "macro trigger" */
2098 if (parse_under && (ch <= 32))
2100 /* Strip this key */
2103 /* End "macro trigger" */
2104 parse_under = FALSE;
2108 /* Handle "control-caret" */
2111 /* Strip this key */
2115 /* Handle "control-underscore" */
2118 /* Strip this key */
2121 /* Begin "macro trigger" */
2125 /* Inside "macro trigger" */
2126 else if (parse_under)
2128 /* Strip this key */
2134 /* Hack -- restore the term */
2138 /* Restore the cursor */
2142 /* Cancel the various "global parameters" */
2143 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
2145 /* Return the keypress */
2153 * We use a global array for all inscriptions to reduce the memory
2154 * spent maintaining inscriptions. Of course, it is still possible
2155 * to run out of inscription memory, especially if too many different
2156 * inscriptions are used, but hopefully this will be rare.
2158 * We use dynamic string allocation because otherwise it is necessary
2159 * to pre-guess the amount of quark activity. We limit the total
2160 * number of quarks, but this is much easier to "expand" as needed.
2162 * Any two items with the same inscription will have the same "quark"
2163 * index, which should greatly reduce the need for inscription space.
2165 * Note that "quark zero" is NULL and should not be "dereferenced".
2169 * Add a new "quark" to the set of quarks.
2171 s16b quark_add(cptr str)
2175 /* Look for an existing quark */
2176 for (i = 1; i < quark__num; i++)
2178 /* Check for equality */
2179 if (streq(quark__str[i], str)) return (i);
2182 /* Paranoia -- Require room */
2183 if (quark__num == QUARK_MAX) return (0);
2185 /* New maximal quark */
2188 /* Add a new quark */
2189 quark__str[i] = string_make(str);
2191 /* Return the index */
2197 * This function looks up a quark
2199 cptr quark_str(s16b i)
2204 if ((i < 0) || (i >= quark__num)) i = 0;
2206 /* Access the quark */
2209 /* Return the quark */
2217 * Second try for the "message" handling routines.
2219 * Each call to "message_add(s)" will add a new "most recent" message
2220 * to the "message recall list", using the contents of the string "s".
2222 * The messages will be stored in such a way as to maximize "efficiency",
2223 * that is, we attempt to maximize the number of sequential messages that
2224 * can be retrieved, given a limited amount of storage space.
2226 * We keep a buffer of chars to hold the "text" of the messages, not
2227 * necessarily in "order", and an array of offsets into that buffer,
2228 * representing the actual messages. This is made more complicated
2229 * by the fact that both the array of indexes, and the buffer itself,
2230 * are both treated as "circular arrays" for efficiency purposes, but
2231 * the strings may not be "broken" across the ends of the array.
2233 * The "message_add()" function is rather "complex", because it must be
2234 * extremely efficient, both in space and time, for use with the Borg.
2240 * How many messages are "available"?
2242 s16b message_num(void)
2246 /* Extract the indexes */
2247 last = message__last;
2248 next = message__next;
2251 if (next < last) next += MESSAGE_MAX;
2253 /* Extract the space */
2256 /* Return the result */
2263 * Recall the "text" of a saved message
2265 cptr message_str(int age)
2271 /* Forgotten messages have no text */
2272 if ((age < 0) || (age >= message_num())) return ("");
2274 /* Acquire the "logical" index */
2275 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2277 /* Get the "offset" for the message */
2278 o = message__ptr[x];
2280 /* Access the message text */
2281 s = &message__buf[o];
2283 /* Return the message text */
2290 * Add a new message, with great efficiency
2292 void message_add(cptr str)
2300 /*** Step 1 -- Analyze the message ***/
2302 /* Hack -- Ignore "non-messages" */
2305 /* Message length */
2308 /* Important Hack -- Ignore "long" messages */
2309 if (n >= MESSAGE_BUF / 4) return;
2311 /* extra step -- split the message if n>80. (added by Mogami) */
2316 for (n = 0; n < 80; n++, t++)
2321 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2323 for (n = 80; n > 60; n--)
2324 if (str[n] == ' ') break;
2328 splitted2 = str + n;
2329 strncpy(splitted1, str ,n);
2330 splitted1[n] = '\0';
2336 /*** Step 2 -- Attempt to optimize ***/
2338 /* Limit number of messages to check */
2343 /* Limit number of messages to check */
2344 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2346 /* Check previous message */
2347 for (i = message__next; m; m--)
2356 /* Back up and wrap if needed */
2357 if (i-- == 0) i = MESSAGE_MAX - 1;
2359 /* Access the old string */
2360 old = &message__buf[message__ptr[i]];
2362 /* Skip small messages */
2369 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2370 if( iskanji(*t))t++;
2372 for (t = buf; *t && (*t != '<'); t++);
2377 /* Message is too small */
2378 if (strlen(buf) < 6) break;
2380 /* Drop the space */
2383 /* Get multiplier */
2387 /* Limit the multiplier to 1000 */
2388 if (buf && streq(buf, str) && (j < 1000))
2398 sprintf(u, "%s <x%d>", buf, j);
2400 /* Message length */
2403 if (!now_message) now_message++;
2407 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
2415 /* Check the last few messages (if any to count) */
2416 for (i = message__next; k; k--)
2422 /* Back up and wrap if needed */
2423 if (i-- == 0) i = MESSAGE_MAX - 1;
2425 /* Stop before oldest message */
2426 if (i == message__last) break;
2428 /* Extract "distance" from "head" */
2429 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2431 /* Do not optimize over large distance */
2432 if (q > MESSAGE_BUF / 2) continue;
2434 /* Access the old string */
2435 old = &message__buf[message__ptr[i]];
2438 if (!streq(old, str)) continue;
2440 /* Get the next message index, advance */
2441 x = message__next++;
2444 if (message__next == MESSAGE_MAX) message__next = 0;
2446 /* Kill last message if needed */
2447 if (message__next == message__last) message__last++;
2450 if (message__last == MESSAGE_MAX) message__last = 0;
2452 /* Assign the starting address */
2453 message__ptr[x] = message__ptr[i];
2457 goto end_of_message_add;
2462 /*** Step 3 -- Ensure space before end of buffer ***/
2464 /* Kill messages and Wrap if needed */
2465 if (message__head + n + 1 >= MESSAGE_BUF)
2467 /* Kill all "dead" messages */
2468 for (i = message__last; TRUE; i++)
2470 /* Wrap if needed */
2471 if (i == MESSAGE_MAX) i = 0;
2473 /* Stop before the new message */
2474 if (i == message__next) break;
2476 /* Kill "dead" messages */
2477 if (message__ptr[i] >= message__head)
2479 /* Track oldest message */
2480 message__last = i + 1;
2484 /* Wrap "tail" if needed */
2485 if (message__tail >= message__head) message__tail = 0;
2492 /*** Step 4 -- Ensure space before next message ***/
2494 /* Kill messages if needed */
2495 if (message__head + n + 1 > message__tail)
2497 /* Grab new "tail" */
2498 message__tail = message__head + n + 1;
2500 /* Advance tail while possible past first "nul" */
2501 while (message__buf[message__tail-1]) message__tail++;
2503 /* Kill all "dead" messages */
2504 for (i = message__last; TRUE; i++)
2506 /* Wrap if needed */
2507 if (i == MESSAGE_MAX) i = 0;
2509 /* Stop before the new message */
2510 if (i == message__next) break;
2512 /* Kill "dead" messages */
2513 if ((message__ptr[i] >= message__head) &&
2514 (message__ptr[i] < message__tail))
2516 /* Track oldest message */
2517 message__last = i + 1;
2523 /*** Step 5 -- Grab a new message index ***/
2525 /* Get the next message index, advance */
2526 x = message__next++;
2529 if (message__next == MESSAGE_MAX) message__next = 0;
2531 /* Kill last message if needed */
2532 if (message__next == message__last) message__last++;
2535 if (message__last == MESSAGE_MAX) message__last = 0;
2539 /*** Step 6 -- Insert the message text ***/
2541 /* Assign the starting address */
2542 message__ptr[x] = message__head;
2544 /* Append the new part of the message */
2545 for (i = 0; i < n; i++)
2547 /* Copy the message */
2548 message__buf[message__head + i] = str[i];
2552 message__buf[message__head + i] = '\0';
2554 /* Advance the "head" pointer */
2555 message__head += n + 1;
2557 /* recursively add splitted message (added by Mogami) */
2559 if (splitted2 != NULL)
2560 message_add(splitted2);
2568 static void msg_flush(int x)
2570 byte a = TERM_L_BLUE;
2571 bool nagasu = FALSE;
2573 if ((auto_more && !now_damaged) || num_more < 0){
2575 for (i = 0; i < 8; i++)
2577 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2581 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2588 now_damaged = FALSE;
2590 if (!p_ptr->playing || !nagasu)
2592 /* Pause for response */
2594 Term_putstr(x, 0, -1, a, "-³¤¯-");
2596 Term_putstr(x, 0, -1, a, "-more-");
2600 /* Get an acceptable keypress */
2604 if (cmd == ESCAPE) {
2605 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£ */
2607 } else if (cmd == ' ') {
2608 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
2610 } else if ((cmd == '\n') || (cmd == '\r')) {
2611 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
2614 if (quick_messages) break;
2619 /* Clear the line */
2620 Term_erase(0, 0, 255);
2625 * Output a message to the top line of the screen.
2627 * Break long messages into multiple pieces (40-72 chars).
2629 * Allow multiple short messages to "share" the top line.
2631 * Prompt the user to make sure he has a chance to read them.
2633 * These messages are memorized for later reference (see above).
2635 * We could do "Term_fresh()" to provide "flicker" if needed.
2637 * The global "msg_flag" variable can be cleared to tell us to
2638 * "erase" any "pending" messages still on the screen.
2640 * XXX XXX XXX Note that we must be very careful about using the
2641 * "msg_print()" functions without explicitly calling the special
2642 * "msg_print(NULL)" function, since this may result in the loss
2643 * of information if the screen is cleared, or if anything is
2644 * displayed on the top line.
2646 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2647 * even if no messages are pending. This is probably a hack.
2649 void msg_print(cptr msg)
2659 if (world_monster) return;
2663 /* Clear the line */
2664 Term_erase(0, 0, 255);
2668 /* Message Length */
2669 n = (msg ? strlen(msg) : 0);
2671 /* Hack -- flush when requested or needed */
2672 if (p && (!msg || ((p + n) > 72)))
2689 if (n > 1000) return;
2692 /* Memorize the message */
2693 if (character_generated) message_add(msg);
2699 /* Analyze the buffer */
2706 int check, split = 72;
2709 bool k_flag = FALSE;
2712 /* Find the "best" split point */
2713 for (check = 0; check < 72; check++)
2721 /* Found a valid split point */
2722 if (iskanji(t[check]))
2727 else if (t[check] == ' ')
2740 /* Find the "best" split point */
2741 for (check = 40; check < 72; check++)
2743 /* Found a valid split point */
2744 if (t[check] == ' ') split = check;
2748 /* Save the split character */
2751 /* Split the message */
2754 /* Display part of the message */
2755 Term_putstr(0, 0, split, TERM_WHITE, t);
2758 msg_flush(split + 1);
2760 /* Memorize the piece */
2761 /* if (character_generated) message_add(t); */
2763 /* Restore the split character */
2766 /* Insert a space */
2769 /* Prepare to recurse on the rest of "buf" */
2770 t += split; n -= split;
2774 /* Display the tail of the message */
2775 Term_putstr(p, 0, n, TERM_WHITE, t);
2777 /* Memorize the tail */
2778 /* if (character_generated) message_add(t); */
2781 p_ptr->window |= (PW_MESSAGE);
2784 /* Remember the message */
2787 /* Remember the position */
2795 /* Optional refresh */
2796 if (fresh_message) Term_fresh();
2801 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2803 static int screen_depth = 0;
2807 * Save the screen, and increase the "icky" depth.
2809 * This function must match exactly one call to "screen_load()".
2811 void screen_save(void)
2813 /* Hack -- Flush messages */
2816 /* Save the screen (if legal) */
2817 if (screen_depth++ == 0) Term_save();
2819 /* Increase "icky" depth */
2825 * Load the screen, and decrease the "icky" depth.
2827 * This function must match exactly one call to "screen_save()".
2829 void screen_load(void)
2831 /* Hack -- Flush messages */
2834 /* Load the screen (if legal) */
2835 if (--screen_depth == 0) Term_load();
2837 /* Decrease "icky" depth */
2843 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2845 void msg_format(cptr fmt, ...)
2851 /* Begin the Varargs Stuff */
2854 /* Format the args, save the length */
2855 (void)vstrnfmt(buf, 1024, fmt, vp);
2857 /* End the Varargs Stuff */
2867 * Display a string on the screen using an attribute.
2869 * At the given location, using the given attribute, if allowed,
2870 * add the given string. Do not clear the line.
2872 void c_put_str(byte attr, cptr str, int row, int col)
2874 /* Position cursor, Dump the attr/text */
2875 Term_putstr(col, row, -1, attr, str);
2879 * As above, but in "white"
2881 void put_str(cptr str, int row, int col)
2884 Term_putstr(col, row, -1, TERM_WHITE, str);
2890 * Display a string on the screen using an attribute, and clear
2891 * to the end of the line.
2893 void c_prt(byte attr, cptr str, int row, int col)
2895 /* Clear line, position cursor */
2896 Term_erase(col, row, 255);
2898 /* Dump the attr/text */
2899 Term_addstr(-1, attr, str);
2903 * As above, but in "white"
2905 void prt(cptr str, int row, int col)
2908 c_prt(TERM_WHITE, str, row, col);
2915 * Print some (colored) text to the screen at the current cursor position,
2916 * automatically "wrapping" existing text (at spaces) when necessary to
2917 * avoid placing any text into the last column, and clearing every line
2918 * before placing any text in that line. Also, allow "newline" to force
2919 * a "wrap" to the next line. Advance the cursor as needed so sequential
2920 * calls to this function will work correctly.
2922 * Once this function has been called, the cursor should not be moved
2923 * until all the related "c_roff()" calls to the window are complete.
2925 * This function will correctly handle any width up to the maximum legal
2926 * value of 256, though it works best for a standard 80 character width.
2928 void c_roff(byte a, cptr str)
2936 /* Obtain the size */
2937 (void)Term_get_size(&w, &h);
2939 /* Obtain the cursor */
2940 (void)Term_locate(&x, &y);
2942 /* Hack -- No more space */
2943 if( y == h - 1 && x > w - 3) return;
2945 /* Process the string */
2946 for (s = str; *s; s++)
2951 int k_flag = iskanji(*s);
2963 /* Clear line, move cursor */
2964 Term_erase(x, y, 255);
2969 /* Clean up the char */
2971 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2973 ch = (isprint(*s) ? *s : ' ');
2977 /* Wrap words as needed */
2979 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2981 if ((x >= w - 1) && (ch != ' '))
2994 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
2998 /* Scan existing text */
2999 for (i = w - 2; i >= 0; i--)
3001 /* Grab existing attr/char */
3002 Term_what(i, y, &av[i], &cv[i]);
3004 /* Break on space */
3005 if (cv[i] == ' ') break;
3007 /* Track current word */
3010 if (cv[i] == '(') break;
3018 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
3019 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
3020 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
3021 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
3022 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
3025 Term_what(x , y, &av[x ], &cv[x ]);
3026 Term_what(x-1, y, &av[x-1], &cv[x-1]);
3027 Term_what(x-2, y, &av[x-2], &cv[x-2]);
3038 Term_erase(n, y, 255);
3047 /* Clear line, move cursor */
3048 Term_erase(x, y, 255);
3050 /* Wrap the word (if any) */
3051 for (i = n; i < w - 1; i++)
3054 if( cv[i] == '\0' ) break;
3057 Term_addch(av[i], cv[i]);
3059 /* Advance (no wrap) */
3066 Term_addch((byte)(a|0x10), ch);
3078 Term_addch((byte)(a|0x20), ch);
3087 * As above, but in "white"
3092 c_roff(TERM_WHITE, str);
3099 * Clear part of the screen
3101 void clear_from(int row)
3105 /* Erase requested rows */
3106 for (y = row; y < Term->hgt; y++)
3108 /* Erase part of the screen */
3109 Term_erase(0, y, 255);
3117 * Get some input at the cursor location.
3118 * Assume the buffer is initialized to a default string.
3119 * Note that this string is often "empty" (see below).
3120 * The default buffer is displayed in yellow until cleared.
3121 * Pressing RETURN right away accepts the default entry.
3122 * Normal chars clear the default and append the char.
3123 * Backspace clears the default or deletes the final char.
3124 * ESCAPE clears the buffer and the window and returns FALSE.
3125 * RETURN accepts the current buffer contents and returns TRUE.
3127 bool askfor_aux(char *buf, int len)
3141 /* Locate the cursor */
3142 Term_locate(&x, &y);
3145 /* Paranoia -- check len */
3146 if (len < 1) len = 1;
3148 /* Paranoia -- check column */
3149 if ((x < 0) || (x >= 80)) x = 0;
3151 /* Restrict the length */
3152 if (x + len > 80) len = 80 - x;
3155 /* Paranoia -- Clip the default entry */
3159 /* Display the default answer */
3160 Term_erase(x, y, len);
3161 Term_putstr(x, y, -1, TERM_YELLOW, buf);
3168 Term_gotoxy(x + k, y);
3173 /* Analyze the key */
3204 { /* ÊÒ»³¤µ¤óºîÀ® */
3218 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3220 if(k<len && isprint(i)){
3229 if ((k < len) && (isprint(i)))
3245 /* Update the entry */
3246 Term_erase(x, y, len);
3247 Term_putstr(x, y, -1, TERM_WHITE, buf);
3251 if (i == ESCAPE) return (FALSE);
3259 * Get a string from the user
3261 * The "prompt" should take the form "Prompt: "
3263 * Note that the initial contents of the string is used as
3264 * the default response, so be sure to "clear" it if needed.
3266 * We clear the input, and return FALSE, on "ESCAPE".
3268 bool get_string(cptr prompt, char *buf, int len)
3272 /* Paranoia XXX XXX XXX */
3275 /* Display prompt */
3278 /* Ask the user for a string */
3279 res = askfor_aux(buf, len);
3290 * Verify something with the user
3292 * The "prompt" should take the form "Query? "
3294 * Note that "[y/n]" is appended to the prompt.
3296 bool get_check(cptr prompt)
3298 return get_check_strict(prompt, 0);
3302 * Verify something with the user strictly
3304 * mode & CHECK_OKAY_CANCEL : force user to answer 'O'kay or 'C'ancel
3305 * mode & CHECK_NO_ESCAPE : don't allow ESCAPE key
3306 * mode & CHECK_NO_HISTORY : no message_add
3307 * mode & CHECK_DEFAULT_Y : accept any key as y, except n and Esc.
3309 bool get_check_strict(cptr prompt, int mode)
3317 p_ptr->window |= PW_MESSAGE;
3322 /* Paranoia XXX XXX XXX */
3325 if (!rogue_like_commands)
3326 mode &= ~CHECK_OKAY_CANCEL;
3329 /* Hack -- Build a "useful" prompt */
3330 if (mode & CHECK_OKAY_CANCEL)
3332 my_strcpy(buf, prompt, sizeof(buf)-15);
3333 strcat(buf, "[(O)k/(C)ancel]");
3335 else if (mode & CHECK_DEFAULT_Y)
3337 my_strcpy(buf, prompt, sizeof(buf)-5);
3338 strcat(buf, "[Y/n]");
3342 my_strcpy(buf, prompt, sizeof(buf)-5);
3343 strcat(buf, "[y/n]");
3349 if (!(mode & CHECK_NO_HISTORY) && p_ptr->playing)
3351 /* HACK : Add the line to message buffer */
3353 p_ptr->window |= (PW_MESSAGE);
3357 /* Get an acceptable answer */
3362 if (!(mode & CHECK_NO_ESCAPE))
3371 if (mode & CHECK_OKAY_CANCEL)
3373 if (i == 'o' || i == 'O')
3378 else if (i == 'c' || i == 'C')
3386 if (i == 'y' || i == 'Y')
3391 else if (i == 'n' || i == 'N')
3398 if (mode & CHECK_DEFAULT_Y)
3407 /* Erase the prompt */
3410 /* Return the flag */
3416 * Prompts for a keypress
3418 * The "prompt" should take the form "Command: "
3420 * Returns TRUE unless the character is "Escape"
3422 bool get_com(cptr prompt, char *command, bool z_escape)
3424 /* Paranoia XXX XXX XXX */
3427 /* Display a prompt */
3433 /* Clear the prompt */
3436 /* Handle "cancel" */
3437 if (*command == ESCAPE) return (FALSE);
3438 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3446 * Request a "quantity" from the user
3448 * Hack -- allow "command_arg" to specify a quantity
3450 s16b get_quantity(cptr prompt, int max)
3459 /* Use "command_arg" */
3462 /* Extract a number */
3465 /* Clear "command_arg" */
3468 /* Enforce the maximum */
3469 if (amt > max) amt = max;
3475 #ifdef ALLOW_REPEAT /* TNB */
3477 /* Get the item index */
3478 if ((max != 1) && repeat_pull(&amt))
3480 /* Enforce the maximum */
3481 if (amt > max) amt = max;
3483 /* Enforce the minimum */
3484 if (amt < 0) amt = 0;
3490 #endif /* ALLOW_REPEAT -- TNB */
3492 /* Build a prompt if needed */
3495 /* Build a prompt */
3497 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3499 sprintf(tmp, "Quantity (1-%d): ", max);
3503 /* Use that prompt */
3508 /* Default to one */
3511 /* Build the default */
3512 sprintf(buf, "%d", amt);
3514 /* Ask for a quantity */
3515 if (!get_string(prompt, buf, 6)) return (0);
3517 /* Extract a number */
3520 /* A letter means "all" */
3521 if (isalpha(buf[0])) amt = max;
3523 /* Enforce the maximum */
3524 if (amt > max) amt = max;
3526 /* Enforce the minimum */
3527 if (amt < 0) amt = 0;
3529 #ifdef ALLOW_REPEAT /* TNB */
3531 if (amt) repeat_push(amt);
3533 #endif /* ALLOW_REPEAT -- TNB */
3535 /* Return the result */
3541 * Pause for user response XXX XXX XXX
3543 void pause_line(int row)
3548 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3550 put_str("[Press any key to continue]", row, 23);
3559 * Hack -- special buffer to hold the action of the current keymap
3561 static char request_command_buffer[256];
3573 menu_naiyou menu_info[10][10] =
3576 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3578 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3579 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3581 {"Èâ/È¢", 6, FALSE},
3584 {"¤½¤Î¾", 9, FALSE},
3589 {"»È¤¦(m)", 'm', TRUE},
3590 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3591 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3592 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3602 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3603 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3604 {"õ¤¹(s)", 's', TRUE},
3605 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3606 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3607 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3608 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3609 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3610 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3611 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3615 {"Æɤà(r)", 'r', TRUE},
3616 {"°û¤à(q)", 'q', TRUE},
3617 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3618 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3619 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3620 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3621 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3622 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3623 {"Åꤲ¤ë(v)", 'v', TRUE},
3628 {"½¦¤¦(g)", 'g', TRUE},
3629 {"Íî¤È¤¹(d)", 'd', TRUE},
3630 {"²õ¤¹(k/^d)", 'k', TRUE},
3631 {"Ìäò¹ï¤à({)", '{', TRUE},
3632 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3633 {"Ä´ºº(I)", 'I', TRUE},
3634 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3641 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3642 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3643 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3644 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3654 {"³«¤±¤ë(o)", 'o', TRUE},
3655 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3656 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3657 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3667 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3668 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3669 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3670 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3671 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3672 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3673 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3674 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3675 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3680 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3681 {"¥Þ¥¯¥í(@)", '@', TRUE},
3682 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3683 {"¥«¥é¡¼(&)", '&', TRUE},
3684 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3685 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3686 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3693 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3694 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3695 {"¥Ø¥ë¥×(?)", '?', TRUE},
3696 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3697 {"¥á¥â(:)", ':', TRUE},
3698 {"µÇ°»£±Æ())", ')', TRUE},
3699 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3700 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3701 {"°úÂह¤ë(Q)", 'Q', TRUE},
3706 menu_naiyou menu_info[10][10] =
3709 {"Magic/Special", 1, FALSE},
3710 {"Action", 2, FALSE},
3711 {"Items(use)", 3, FALSE},
3712 {"Items(other)", 4, FALSE},
3713 {"Equip", 5, FALSE},
3714 {"Door/Box", 6, FALSE},
3715 {"Infomations", 7, FALSE},
3716 {"Options", 8, FALSE},
3717 {"Other commands", 9, FALSE},
3722 {"Use(m)", 'm', TRUE},
3723 {"See tips(b/P)", 'b', TRUE},
3724 {"Study(G)", 'G', TRUE},
3725 {"Special abilities(U/O)", 'U', TRUE},
3735 {"Rest(R)", 'R', TRUE},
3736 {"Disarm a trap(D)", 'D', TRUE},
3737 {"Search(s)", 's', TRUE},
3738 {"Look(l/x)", 'l', TRUE},
3739 {"Target(*)", '*', TRUE},
3740 {"Dig(T/^t)", 'T', TRUE},
3741 {"Go up stairs(<)", '<', TRUE},
3742 {"Go down staies(>)", '>', TRUE},
3743 {"Command pets(p)", 'p', TRUE},
3744 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3748 {"Read a scroll(r)", 'r', TRUE},
3749 {"Drink a potion(q)", 'q', TRUE},
3750 {"Use a staff(u/Z)", 'u', TRUE},
3751 {"Aim a wand(a/z)", 'a', TRUE},
3752 {"Zap a rod(z/a)", 'z', TRUE},
3753 {"Activate an equipment(A)", 'A', TRUE},
3754 {"Eat(E)", 'E', TRUE},
3755 {"Fire missile weapon(f/t)", 'f', TRUE},
3756 {"Throw an item(v)", 'v', TRUE},
3761 {"Get items(g)", 'g', TRUE},
3762 {"Drop an item(d)", 'd', TRUE},
3763 {"Destroy an item(k/^d)", 'k', TRUE},
3764 {"Inscribe an item({)", '{', TRUE},
3765 {"Uninscribe an item(})", '}', TRUE},
3766 {"Info about an item(I)", 'I', TRUE},
3767 {"Inventory list(i)", 'i', TRUE},
3774 {"Wear(w)", 'w', TRUE},
3775 {"Take off(t/T)", 't', TRUE},
3776 {"Refuel(F)", 'F', TRUE},
3777 {"Equipment list(e)", 'e', TRUE},
3787 {"Open(o)", 'o', TRUE},
3788 {"Close(c)", 'c', TRUE},
3789 {"Bash a door(B/f)", 'B', TRUE},
3790 {"Jam a door(j/S)", 'j', TRUE},
3800 {"Full map(M)", 'M', TRUE},
3801 {"Map(L/W)", 'L', TRUE},
3802 {"Level feeling(^f)", KTRL('F'), TRUE},
3803 {"Character status(C)", 'C', TRUE},
3804 {"Identify symbol(/)", '/', TRUE},
3805 {"Show prev messages(^p)", KTRL('P'), TRUE},
3806 {"Current time(^t/')", KTRL('T'), TRUE},
3807 {"Various infomations(~)", '~', TRUE},
3808 {"Play record menu(|)", '|', TRUE},
3813 {"Set options(=)", '=', TRUE},
3814 {"Interact with macros(@)", '@', TRUE},
3815 {"Interact w/ visuals(%)", '%', TRUE},
3816 {"Interact with colors(&)", '&', TRUE},
3817 {"Enter a user pref(\")", '\"', TRUE},
3818 {"Reload auto-pick pref($)", '$', TRUE},
3826 {"Save and quit(^x)", KTRL('X'), TRUE},
3827 {"Save(^s)", KTRL('S'), TRUE},
3828 {"Help(obsoleted)(?)", '?', TRUE},
3829 {"Redraw(^r)", KTRL('R'), TRUE},
3830 {"Take note(:)", ':', TRUE},
3831 {"Dump screen dump(()", ')', TRUE},
3832 {"Load screen dump())", '(', TRUE},
3833 {"Version info(V)", 'V', TRUE},
3834 {"Quit(Q)", 'Q', TRUE},
3847 } special_menu_naiyou;
3849 #define MENU_CLASS 1
3853 special_menu_naiyou special_menu_info[] =
3855 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3856 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3857 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3858 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3859 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3860 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3861 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3865 special_menu_naiyou special_menu_info[] =
3867 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3868 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3869 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3870 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3871 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3872 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3873 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3878 static char inkey_from_menu(void)
3882 int num = 0, max_num, old_num = 0;
3886 if (py - panel_row_min > 10) basey = 2;
3890 /* Clear top line */
3900 if (!menu) old_num = num;
3901 put_str("+----------------------------------------------------+", basey, basex);
3902 put_str("| |", basey+1, basex);
3903 put_str("| |", basey+2, basex);
3904 put_str("| |", basey+3, basex);
3905 put_str("| |", basey+4, basex);
3906 put_str("| |", basey+5, basex);
3907 put_str("+----------------------------------------------------+", basey+6, basex);
3909 for(i = 0; i < 10; i++)
3912 if (!menu_info[menu][i].cmd) break;
3913 menu_name = menu_info[menu][i].name;
3914 for(hoge = 0; ; hoge++)
3916 if (!special_menu_info[hoge].name[0]) break;
3917 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3918 switch(special_menu_info[hoge].jouken)
3921 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3924 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
3926 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3933 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
3936 kisuu = max_num % 2;
3938 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3940 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3943 /* Place the cursor on the player */
3944 move_cursor_relative(py, px);
3948 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r') || (sub_cmd == '\n'))
3950 if (menu_info[menu][num].fin)
3952 cmd = menu_info[menu][num].cmd;
3958 menu = menu_info[menu][num].cmd;
3964 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
3981 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
3986 num = (num + 2) % (max_num - 1);
3988 num = (num + 2) % (max_num + 1);
3990 else num = (num + 2) % max_num;
3992 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
3997 num = (num + max_num - 3) % (max_num - 1);
3999 num = (num + max_num - 1) % (max_num + 1);
4001 else num = (num + max_num - 2) % max_num;
4003 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
4005 if ((num % 2) || (num == max_num - 1))
4009 else if (num < max_num - 1)
4017 if (!inkey_next) inkey_next = "";
4023 * Request a command from the user.
4025 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
4026 * p_ptr->command_arg. May modify p_ptr->command_new.
4028 * Note that "caret" ("^") is treated specially, and is used to
4029 * allow manual input of control characters. This can be used
4030 * on many machines to request repeated tunneling (Ctrl-H) and
4031 * on the Macintosh to request "Control-Caret".
4033 * Note that "backslash" is treated specially, and is used to bypass any
4034 * keymap entry for the following character. This is useful for macros.
4036 * Note that this command is used both in the dungeon and in
4037 * stores, and must be careful to work in both situations.
4039 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
4041 void request_command(int shopping)
4054 if (rogue_like_commands)
4056 mode = KEYMAP_MODE_ROGUE;
4062 mode = KEYMAP_MODE_ORIG;
4066 /* No command yet */
4069 /* No "argument" yet */
4072 /* No "direction" yet */
4081 /* Hack -- auto-commands */
4084 /* Flush messages */
4087 /* Use auto-command */
4094 /* Get a keypress in "command" mode */
4097 /* Hack -- no flush needed */
4101 /* Activate "command mode" */
4107 if (!shopping && command_menu && ((cmd == '\r') || (cmd == '\n') || (cmd == 'x') || (cmd == 'X'))
4108 && !keymap_act[mode][(byte)(cmd)])
4109 cmd = inkey_from_menu();
4112 /* Clear top line */
4119 int old_arg = command_arg;
4124 /* Begin the input */
4126 prt("²ó¿ô: ", 0, 0);
4128 prt("Count: ", 0, 0);
4132 /* Get a command count */
4135 /* Get a new keypress */
4138 /* Simple editing (delete or backspace) */
4139 if ((cmd == 0x7F) || (cmd == KTRL('H')))
4141 /* Delete a digit */
4142 command_arg = command_arg / 10;
4144 /* Show current count */
4146 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4148 prt(format("Count: %d", command_arg), 0, 0);
4153 /* Actual numeric data */
4154 else if (cmd >= '0' && cmd <= '9')
4156 /* Stop count at 9999 */
4157 if (command_arg >= 1000)
4166 /* Increase count */
4169 /* Incorporate that digit */
4170 command_arg = command_arg * 10 + D2I(cmd);
4173 /* Show current count */
4175 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4177 prt(format("Count: %d", command_arg), 0, 0);
4182 /* Exit on "unusable" input */
4189 /* Hack -- Handle "zero" */
4190 if (command_arg == 0)
4195 /* Show current count */
4197 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4199 prt(format("Count: %d", command_arg), 0, 0);
4204 /* Hack -- Handle "old_arg" */
4207 /* Restore old_arg */
4208 command_arg = old_arg;
4210 /* Show current count */
4212 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4214 prt(format("Count: %d", command_arg), 0, 0);
4219 /* Hack -- white-space means "enter command now" */
4220 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
4222 /* Get a real command */
4224 if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
4226 if (!get_com("Command: ", (char *)&cmd, FALSE))
4240 /* Allow "keymaps" to be bypassed */
4243 /* Get a real command */
4245 (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
4247 (void)get_com("Command: ", (char *)&cmd, FALSE);
4251 /* Hack -- bypass keymaps */
4252 if (!inkey_next) inkey_next = "";
4256 /* Allow "control chars" to be entered */
4259 /* Get a new command and controlify it */
4261 if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4263 if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4269 /* Look up applicable keymap */
4270 act = keymap_act[mode][(byte)(cmd)];
4272 /* Apply keymap if not inside a keymap already */
4273 if (act && !inkey_next)
4275 /* Install the keymap (limited buffer size) */
4276 (void)strnfmt(request_command_buffer, 256, "%s", act);
4278 /* Start using the buffer */
4279 inkey_next = request_command_buffer;
4291 command_cmd = (byte)cmd;
4297 /* Hack -- Auto-repeat certain commands */
4298 if (always_repeat && (command_arg <= 0))
4300 /* Hack -- auto repeat certain commands */
4301 if (strchr("TBDoc+", command_cmd))
4303 /* Repeat 99 times */
4312 switch (command_cmd)
4314 /* Command "p" -> "purchase" (get) */
4315 case 'p': command_cmd = 'g'; break;
4317 /* Command "m" -> "purchase" (get) */
4318 case 'm': command_cmd = 'g'; break;
4320 /* Command "s" -> "sell" (drop) */
4321 case 's': command_cmd = 'd'; break;
4326 for (i = 0; i < 256; i++)
4329 if ((s = keymap_act[mode][i]) != NULL)
4331 if (*s == command_cmd && *(s+1) == 0)
4339 caretcmd = command_cmd;
4341 /* Hack -- Scan equipment */
4342 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4346 object_type *o_ptr = &inventory[i];
4348 /* Skip non-objects */
4349 if (!o_ptr->k_idx) continue;
4351 /* No inscription */
4352 if (!o_ptr->inscription) continue;
4354 /* Obtain the inscription */
4355 s = quark_str(o_ptr->inscription);
4360 /* Process preventions */
4363 /* Check the "restriction" character */
4365 if ((s[1] == caretcmd) || (s[1] == '*'))
4367 if ((s[1] == command_cmd) || (s[1] == '*'))
4371 /* Hack -- Verify command */
4373 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4375 if (!get_check("Are you sure? "))
4379 /* Hack -- Use space */
4384 /* Find another '^' */
4385 s = strchr(s + 1, '^');
4390 /* Hack -- erase the message line. */
4397 * Check a char for "vowel-hood"
4399 bool is_a_vowel(int ch)
4424 * Replace the first instance of "target" in "buf" with "insert"
4425 * If "insert" is NULL, just remove the first instance of "target"
4426 * In either case, return TRUE if "target" is found.
4428 * XXX Could be made more efficient, especially in the
4429 * case where "insert" is smaller than "target".
4431 static bool insert_str(char *buf, cptr target, cptr insert)
4434 int b_len, t_len, i_len;
4436 /* Attempt to find the target (modify "buf") */
4437 buf = strstr(buf, target);
4439 /* No target found */
4440 if (!buf) return (FALSE);
4442 /* Be sure we have an insertion string */
4443 if (!insert) insert = "";
4445 /* Extract some lengths */
4446 t_len = strlen(target);
4447 i_len = strlen(insert);
4448 b_len = strlen(buf);
4450 /* How much "movement" do we need? */
4451 len = i_len - t_len;
4453 /* We need less space (for insert) */
4456 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4459 /* We need more space (for insert) */
4462 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4465 /* If movement occured, we need a new terminator */
4466 if (len) buf[b_len+len] = '\0';
4468 /* Now copy the insertion string */
4469 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4471 /* Successful operation */
4481 * Called from cmd4.c and a few other places. Just extracts
4482 * a direction from the keymap for ch (the last direction,
4483 * in fact) byte or char here? I'm thinking that keymaps should
4484 * generally only apply to single keys, which makes it no more
4485 * than 128, so a char should suffice... but keymap_act is 256...
4487 int get_keymap_dir(char ch)
4491 /* Already a direction? */
4502 if (rogue_like_commands)
4504 mode = KEYMAP_MODE_ROGUE;
4510 mode = KEYMAP_MODE_ORIG;
4513 /* Extract the action (if any) */
4514 act = keymap_act[mode][(byte)(ch)];
4519 /* Convert to a direction */
4520 for (s = act; *s; ++s)
4522 /* Use any digits in keymap */
4523 if (isdigit(*s)) d = D2I(*s);
4531 /* Return direction */
4536 #ifdef ALLOW_REPEAT /* TNB */
4538 #define REPEAT_MAX 20
4540 /* Number of chars saved */
4541 static int repeat__cnt = 0;
4544 static int repeat__idx = 0;
4547 static int repeat__key[REPEAT_MAX];
4550 void repeat_push(int what)
4553 if (repeat__cnt == REPEAT_MAX) return;
4555 /* Push the "stuff" */
4556 repeat__key[repeat__cnt++] = what;
4558 /* Prevents us from pulling keys */
4563 bool repeat_pull(int *what)
4565 /* All out of keys */
4566 if (repeat__idx == repeat__cnt) return (FALSE);
4568 /* Grab the next key, advance */
4569 *what = repeat__key[repeat__idx++];
4575 void repeat_check(void)
4579 /* Ignore some commands */
4580 if (command_cmd == ESCAPE) return;
4581 if (command_cmd == ' ') return;
4582 if (command_cmd == '\r') return;
4583 if (command_cmd == '\n') return;
4585 /* Repeat Last Command */
4586 if (command_cmd == 'n')
4591 /* Get the command */
4592 if (repeat_pull(&what))
4594 /* Save the command */
4599 /* Start saving new command */
4608 /* Save this command */
4613 #endif /* ALLOW_REPEAT -- TNB */
4619 * Array size for which InsertionSort
4620 * is used instead of QuickSort
4626 * Exchange two sort-entries
4627 * (should probably be coded inline
4628 * for speed increase)
4630 static void swap(tag_type *a, tag_type *b)
4635 temp.pointer = a->pointer;
4638 a->pointer = b->pointer;
4641 b->pointer = temp.pointer;
4646 * Insertion-Sort algorithm
4647 * (used by the Quicksort algorithm)
4649 static void InsertionSort(tag_type elements[], int number)
4655 for (P = 1; P < number; P++)
4658 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4659 elements[j] = elements[j - 1];
4666 * Helper function for Quicksort
4668 static tag_type median3(tag_type elements[], int left, int right)
4670 int center = (left + right) / 2;
4672 if (elements[left].tag > elements[center].tag)
4673 swap(&elements[left], &elements[center]);
4674 if (elements[left].tag > elements[right].tag)
4675 swap(&elements[left], &elements[right]);
4676 if (elements[center].tag > elements[right].tag)
4677 swap(&elements[center], &elements[right]);
4679 swap(&elements[center], &elements[right - 1]);
4680 return (elements[right - 1]);
4685 * Quicksort algorithm
4687 * The "median of three" pivot selection eliminates
4688 * the bad case of already sorted input.
4690 * We use InsertionSort for smaller sub-arrays,
4691 * because it is faster in this case.
4693 * For details see: "Data Structures and Algorithm
4694 * Analysis in C" by Mark Allen Weiss.
4696 static void quicksort(tag_type elements[], int left, int right)
4701 if (left + CUTOFF <= right)
4703 pivot = median3(elements, left, right);
4705 i = left; j = right -1;
4709 while (elements[++i].tag < pivot.tag);
4710 while (elements[--j].tag > pivot.tag);
4713 swap(&elements[i], &elements[j]);
4719 swap(&elements[i], &elements[right - 1]);
4721 quicksort(elements, left, i - 1);
4722 quicksort(elements, i + 1, right);
4726 /* Use InsertionSort on small arrays */
4727 InsertionSort(elements + left, right - left + 1);
4733 * Frontend for the sorting algorithm
4735 * Sorts an array of tagged pointers
4736 * with <number> elements.
4738 void tag_sort(tag_type elements[], int number)
4740 quicksort(elements, 0, number - 1);
4743 #endif /* SORT_R_INFO */
4745 #ifdef SUPPORT_GAMMA
4747 /* Table of gamma values */
4748 byte gamma_table[256];
4750 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4751 static s16b gamma_helper[256] =
4753 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4754 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4755 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4756 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4757 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4758 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4759 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4760 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4761 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4762 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4763 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4764 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4765 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4766 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4767 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4768 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4773 * Build the gamma table so that floating point isn't needed.
4775 * Note gamma goes from 0->256. The old value of 100 is now 128.
4777 void build_gamma_table(int gamma)
4782 * value is the current sum.
4783 * diff is the new term to add to the series.
4787 /* Hack - convergence is bad in these cases. */
4789 gamma_table[255] = 255;
4791 for (i = 1; i < 255; i++)
4794 * Initialise the Taylor series
4796 * value and diff have been scaled by 256
4801 diff = ((long)gamma_helper[i]) * (gamma - 256);
4810 * Use the following identiy to calculate the gamma table.
4811 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4813 * n is the current term number.
4815 * The gamma_helper array contains a table of
4817 * This is used because a^b = exp(b*ln(a))
4823 * Note that everything is scaled by 256 for accuracy,
4824 * plus another factor of 256 for the final result to
4825 * be from 0-255. Thus gamma_helper[] * gamma must be
4826 * divided by 256*256 each itteration, to get back to
4827 * the original power series.
4829 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4833 * Store the value in the table so that the
4834 * floating point pow function isn't needed .
4836 gamma_table[i] = ((long)(value / 256) * i) / 256;
4840 #endif /* SUPPORT_GAMMA */
4842 void roff_to_buf(cptr str, int maxlen, char *tbuf, size_t bufsize)
4851 while (str[read_pt])
4854 bool kinsoku = FALSE;
4859 /* Prepare one character */
4860 ch[0] = str[read_pt];
4863 kanji = iskanji(ch[0]);
4867 ch[1] = str[read_pt+1];
4870 if (strcmp(ch, "¡£") == 0 ||
4871 strcmp(ch, "¡¢") == 0 ||
4872 strcmp(ch, "¥£") == 0 ||
4873 strcmp(ch, "¡¼") == 0)
4876 else if (!isprint(ch[0]))
4879 if (!isprint(ch[0]))
4883 if (line_len + ch_len > maxlen - 1 || str[read_pt] == '\n')
4887 /* return to better wrapping point. */
4888 /* Space character at the end of the line need not to be printed. */
4889 word_len = read_pt - word_punct;
4891 if (kanji && !kinsoku)
4895 if (ch[0] == ' ' || word_len >= line_len/2)
4899 read_pt = word_punct;
4900 if (str[word_punct] == ' ')
4902 write_pt -= word_len;
4905 tbuf[write_pt++] = '\0';
4907 word_punct = read_pt;
4911 word_punct = read_pt;
4913 if (!kinsoku) word_punct = read_pt;
4916 /* Not enough buffer size */
4917 if (write_pt + 3 >= bufsize) break;
4919 tbuf[write_pt++] = ch[0];
4925 tbuf[write_pt++] = ch[1];
4931 tbuf[write_pt] = '\0';
4932 tbuf[write_pt+1] = '\0';
4939 * The my_strcpy() function copies up to 'bufsize'-1 characters from 'src'
4940 * to 'buf' and NUL-terminates the result. The 'buf' and 'src' strings may
4943 * my_strcpy() returns strlen(src). This makes checking for truncation
4944 * easy. Example: if (my_strcpy(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
4946 * This function should be equivalent to the strlcpy() function in BSD.
4948 size_t my_strcpy(char *buf, const char *src, size_t bufsize)
4953 const char *s = src;
4956 /* reserve for NUL termination */
4959 /* Copy as many bytes as will fit */
4960 while (len < bufsize)
4964 if (len + 1 >= bufsize || !*(s+1)) break;
4982 size_t len = strlen(src);
4986 if (bufsize == 0) return ret;
4989 if (len >= bufsize) len = bufsize - 1;
4991 /* Copy the string and terminate it */
4992 (void)memcpy(buf, src, len);
4995 /* Return strlen(src) */
5003 * The my_strcat() tries to append a string to an existing NUL-terminated string.
5004 * It never writes more characters into the buffer than indicated by 'bufsize' and
5005 * NUL-terminates the buffer. The 'buf' and 'src' strings may not overlap.
5007 * my_strcat() returns strlen(buf) + strlen(src). This makes checking for
5008 * truncation easy. Example:
5009 * if (my_strcat(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
5011 * This function should be equivalent to the strlcat() function in BSD.
5013 size_t my_strcat(char *buf, const char *src, size_t bufsize)
5015 size_t dlen = strlen(buf);
5017 /* Is there room left in the buffer? */
5018 if (dlen < bufsize - 1)
5020 /* Append as much as possible */
5021 return (dlen + my_strcpy(buf + dlen, src, bufsize - dlen));
5025 /* Return without appending */
5026 return (dlen + strlen(src));