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
96 extern struct passwd *getpwuid();
97 extern struct passwd *getpwnam();
101 * Find a default user name from the system.
103 void user_name(char *buf, int id)
107 /* Look up the user name */
108 if ((pw = getpwuid(id)))
110 (void)strcpy(buf, pw->pw_name);
113 #ifdef CAPITALIZE_USER_NAME
114 /* Hack -- capitalize the user name */
116 if (!iskanji(buf[0]))
119 buf[0] = toupper(buf[0]);
120 #endif /* CAPITALIZE_USER_NAME */
125 /* Oops. Hack -- default to "PLAYER" */
126 strcpy(buf, "PLAYER");
135 * The concept of the "file" routines below (and elsewhere) is that all
136 * file handling should be done using as few routines as possible, since
137 * every machine is slightly different, but these routines always have the
140 * In fact, perhaps we should use the "path_parse()" routine below to convert
141 * from "canonical" filenames (optional leading tilde's, internal wildcards,
142 * slash as the path seperator, etc) to "system" filenames (no special symbols,
143 * system-specific path seperator, etc). This would allow the program itself
144 * to assume that all filenames are "Unix" filenames, and explicitly "extract"
145 * such filenames if needed (by "path_parse()", or perhaps "path_canon()").
147 * Note that "path_temp" should probably return a "canonical" filename.
149 * Note that "my_fopen()" and "my_open()" and "my_make()" and "my_kill()"
150 * and "my_move()" and "my_copy()" should all take "canonical" filenames.
152 * Note that "canonical" filenames use a leading "slash" to indicate an absolute
153 * path, and a leading "tilde" to indicate a special directory, and default to a
154 * relative path, but MSDOS uses a leading "drivename plus colon" to indicate the
155 * use of a "special drive", and then the rest of the path is parsed "normally",
156 * and MACINTOSH uses a leading colon to indicate a relative path, and an embedded
157 * colon to indicate a "drive plus absolute path", and finally defaults to a file
158 * in the current working directory, which may or may not be defined.
160 * We should probably parse a leading "~~/" as referring to "ANGBAND_DIR". (?)
168 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
178 * Extract a "parsed" path from an initial filename
179 * Normally, we simply copy the filename into the buffer
180 * But leading tilde symbols must be handled in a special way
181 * Replace "~user/" by the home directory of the user named "user"
182 * Replace "~/" by the home directory of the current user
184 errr path_parse(char *buf, int max, cptr file)
191 /* Assume no result */
195 if (!file) return (-1);
197 /* File needs no parsing */
204 /* Point at the user */
207 /* Look for non-user portion of the file */
208 s = strstr(u, PATH_SEP);
210 /* Hack -- no long user names */
211 if (s && (s >= u + sizeof(user))) return (1);
213 /* Extract a user name */
217 for (i = 0; u < s; ++i) user[i] = *u++;
222 /* Look up the "current" user */
223 if (u[0] == '\0') u = getlogin();
225 /* Look up a user (or "current" user) */
226 if (u) pw = getpwnam(u);
227 else pw = getpwuid(getuid());
232 /* Make use of the info */
233 (void)strcpy(buf, pw->pw_dir);
235 /* Append the rest of the filename, if any */
236 if (s) (void)strcat(buf, s);
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 (void)strnfmt(buf, max, "%s", "/tmp/anXXXXXX");
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 */
685 errr_tmp = open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode);
686 fsetfileinfo(file, _fcreator, _ftype);
690 /* Create the file, fail if exists, write-only, binary */
691 return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
694 #endif /* BEN_HACK */
700 * Hack -- attempt to open a file descriptor (existing file)
702 * Note that we assume that the file should be "binary"
704 int fd_open(cptr file, int flags)
708 /* Hack -- Try to parse the path */
709 if (path_parse(buf, 1024, file)) return (-1);
711 /* Attempt to open the file */
712 return (open(buf, flags | O_BINARY, 0));
717 * Hack -- attempt to lock a file descriptor
719 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
721 errr fd_lock(int fd, int what)
724 what = what ? what : 0;
727 if (fd < 0) return (-1);
733 # if defined(F_ULOCK) && defined(F_LOCK)
738 /* Unlock it, Ignore errors */
739 lockf(fd, F_ULOCK, 0);
745 /* Lock the score file */
746 if (lockf(fd, F_LOCK, 0) != 0) return (1);
753 # if defined(LOCK_UN) && defined(LOCK_EX)
758 /* Unlock it, Ignore errors */
759 (void)flock(fd, LOCK_UN);
765 /* Lock the score file */
766 if (flock(fd, LOCK_EX) != 0) return (1);
781 * Hack -- attempt to seek on a file descriptor
783 errr fd_seek(int fd, huge n)
788 if (fd < 0) return (-1);
790 /* Seek to the given position */
791 p = lseek(fd, n, SEEK_SET);
794 if (p < 0) return (1);
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 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 * Initialize the "macro" package
1615 errr macro_init(void)
1617 /* Macro patterns */
1618 C_MAKE(macro__pat, MACRO_MAX, cptr);
1621 C_MAKE(macro__act, MACRO_MAX, cptr);
1628 * Local variable -- we are inside a "macro action"
1630 * Do not match any macros until "ascii 30" is found.
1632 static bool parse_macro = FALSE;
1635 * Local variable -- we are inside a "macro trigger"
1637 * Strip all keypresses until a low ascii value is found.
1639 static bool parse_under = FALSE;
1643 * Flush all input chars. Actually, remember the flush,
1644 * and do a "special flush" before the next "inkey()".
1646 * This is not only more efficient, but also necessary to make sure
1647 * that various "inkey()" codes are not "lost" along the way.
1657 * Flush the screen, make a noise
1661 /* Mega-Hack -- Flush the output */
1664 /* Make a bell noise (if allowed) */
1665 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1667 /* Flush the input (later!) */
1673 * Hack -- Make a (relevant?) sound
1678 if (!use_sound) return;
1680 /* Make a sound (if allowed) */
1681 Term_xtra(TERM_XTRA_SOUND, val);
1687 * Helper function called only from "inkey()"
1689 * This function does almost all of the "macro" processing.
1691 * We use the "Term_key_push()" function to handle "failed" macros, as well
1692 * as "extra" keys read in while choosing the proper macro, and also to hold
1693 * the action for the macro, plus a special "ascii 30" character indicating
1694 * that any macro action in progress is complete. Embedded macros are thus
1695 * illegal, unless a macro action includes an explicit "ascii 30" character,
1696 * which would probably be a massive hack, and might break things.
1698 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1699 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1700 * macro trigger, 500 milliseconds must pass before the key sequence is
1701 * known not to be that macro trigger. XXX XXX XXX
1703 static char inkey_aux(void)
1705 int k = 0, n, p = 0, w = 0;
1713 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£ */
1716 /* Wait for a keypress */
1717 (void)(Term_inkey(&ch, TRUE, TRUE));
1720 /* End "macro action" */
1721 if (ch == 30) parse_macro = FALSE;
1723 /* Inside "macro action" */
1724 if (ch == 30) return (ch);
1726 /* Inside "macro action" */
1727 if (parse_macro) return (ch);
1729 /* Inside "macro trigger" */
1730 if (parse_under) return (ch);
1733 /* Save the first key, advance */
1738 /* Check for possible macro */
1739 k = macro_find_check(buf);
1741 /* No macro pending */
1742 if (k < 0) return (ch);
1745 /* Wait for a macro, or a timeout */
1748 /* Check for pending macro */
1749 k = macro_find_maybe(buf);
1751 /* No macro pending */
1754 /* Check for (and remove) a pending key */
1755 if (0 == Term_inkey(&ch, FALSE, TRUE))
1757 /* Append the key */
1768 /* Increase "wait" */
1771 /* Excessive delay */
1772 if (w >= 100) break;
1775 Term_xtra(TERM_XTRA_DELAY, w);
1780 /* Check for available macro */
1781 k = macro_find_ready(buf);
1783 /* No macro available */
1786 /* Push all the keys back on the queue */
1789 /* Push the key, notice over-flow */
1790 if (Term_key_push(buf[--p])) return (0);
1793 /* Wait for (and remove) a pending key */
1794 (void)Term_inkey(&ch, TRUE, TRUE);
1796 /* Return the key */
1801 /* Get the pattern */
1802 pat = macro__pat[k];
1804 /* Get the length of the pattern */
1807 /* Push the "extra" keys back on the queue */
1810 /* Push the key, notice over-flow */
1811 if (Term_key_push(buf[--p])) return (0);
1815 /* Begin "macro action" */
1818 /* Push the "end of macro action" key */
1819 if (Term_key_push(30)) return (0);
1822 /* Access the macro action */
1823 act = macro__act[k];
1825 /* Get the length of the action */
1828 /* Push the macro "action" onto the key queue */
1831 /* Push the key, notice over-flow */
1832 if (Term_key_push(act[--n])) return (0);
1836 /* Hack -- Force "inkey()" to call us again */
1842 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1844 * This special pointer allows a sequence of keys to be "inserted" into
1845 * the stream of keys returned by "inkey()". This key sequence will not
1846 * trigger any macros, and cannot be bypassed by the Borg. It is used
1847 * in Angband to handle "keymaps".
1849 static cptr inkey_next = NULL;
1855 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1857 * This special function hook allows the "Borg" (see elsewhere) to take
1858 * control of the "inkey()" function, and substitute in fake keypresses.
1860 char (*inkey_hack)(int flush_first) = NULL;
1862 #endif /* ALLOW_BORG */
1867 * Get a keypress from the user.
1869 * This function recognizes a few "global parameters". These are variables
1870 * which, if set to TRUE before calling this function, will have an effect
1871 * on this function, and which are always reset to FALSE by this function
1872 * before this function returns. Thus they function just like normal
1873 * parameters, except that most calls to this function can ignore them.
1875 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1876 * and any macro processing in progress will be aborted. This flag is
1877 * set by the "flush()" function, which does not actually flush anything
1878 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1880 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1881 * keypress is available, instead of waiting for a keypress.
1883 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1884 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1885 * not return immediately, but will wait for a keypress for as long as the
1886 * normal macro matching code would, allowing the direct entry of macro
1887 * triggers. The "inkey_base" flag is extremely dangerous!
1889 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1890 * normal command, and we will only show the cursor if "hilite_player" is
1891 * TRUE (or if the player is in a store), instead of always showing the
1892 * cursor. The various "main-xxx.c" files should avoid saving the game
1893 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1894 * prevent savefile corruption.
1896 * If we are waiting for a keypress, and no keypress is ready, then we will
1897 * refresh (once) the window which was active when this function was called.
1899 * Note that "back-quote" is automatically converted into "escape" for
1900 * convenience on machines with no "escape" key. This is done after the
1901 * macro matching, so the user can still make a macro for "backquote".
1903 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1904 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1905 * provide support for simple keyboard "macros". These keys are so strange
1906 * that their loss as normal keys will probably be noticed by nobody. The
1907 * "ascii 30" key is used to indicate the "end" of a macro action, which
1908 * allows recursive macros to be avoided. The "ascii 31" key is used by
1909 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1911 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1912 * which can be used to give a variety of "sub-commands" which can be used
1913 * any time. These sub-commands could include commands to take a picture of
1914 * the current screen, to start/stop recording a macro action, etc.
1916 * If "angband_term[0]" is not active, we will make it active during this
1917 * function, so that the various "main-xxx.c" files can assume that input
1918 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1920 * Mega-Hack -- This function is used as the entry point for clearing the
1921 * "signal_count" variable, and of the "character_saved" variable.
1923 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1925 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1926 * control of the keyboard from the user.
1936 /* Hack -- Use the "inkey_next" pointer */
1937 if (inkey_next && *inkey_next && !inkey_xtra)
1939 /* Get next character, and advance */
1942 /* Cancel the various "global parameters" */
1943 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1949 /* Forget pointer */
1955 /* Mega-Hack -- Use the special hook */
1956 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1958 /* Cancel the various "global parameters" */
1959 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1965 #endif /* ALLOW_BORG */
1968 /* Hack -- handle delayed "flush()" */
1971 /* End "macro action" */
1972 parse_macro = FALSE;
1974 /* End "macro trigger" */
1975 parse_under = FALSE;
1977 /* Forget old keypresses */
1982 /* Access cursor state */
1983 (void)Term_get_cursor(&v);
1985 /* Show the cursor if waiting, except sometimes in "command" mode */
1986 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1988 /* Show the cursor */
1989 (void)Term_set_cursor(1);
1993 /* Hack -- Activate main screen */
1994 Term_activate(angband_term[0]);
2000 /* Hack -- Handle "inkey_scan" */
2001 if (!inkey_base && inkey_scan &&
2002 (0 != Term_inkey(&kk, FALSE, FALSE)))
2008 /* Hack -- Flush output once when no key ready */
2009 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
2011 /* Hack -- activate proper term */
2017 /* Hack -- activate main screen */
2018 Term_activate(angband_term[0]);
2020 /* Mega-Hack -- reset saved flag */
2021 character_saved = FALSE;
2023 /* Mega-Hack -- reset signal counter */
2031 /* Hack -- Handle "inkey_base" */
2039 /* Wait for (and remove) a pending key */
2040 if (0 == Term_inkey(&ch, TRUE, TRUE))
2053 /* Check for (and remove) a pending key */
2054 if (0 == Term_inkey(&ch, FALSE, TRUE))
2063 /* Increase "wait" */
2066 /* Excessive delay */
2067 if (w >= 100) break;
2070 Term_xtra(TERM_XTRA_DELAY, w);
2079 /* Get a key (see above) */
2083 /* Handle "control-right-bracket" */
2086 /* Strip this key */
2094 /* Treat back-quote as escape */
2095 /* if (ch == '`') ch = ESCAPE; */
2098 /* End "macro trigger" */
2099 if (parse_under && (ch <= 32))
2101 /* Strip this key */
2104 /* End "macro trigger" */
2105 parse_under = FALSE;
2109 /* Handle "control-caret" */
2112 /* Strip this key */
2116 /* Handle "control-underscore" */
2119 /* Strip this key */
2122 /* Begin "macro trigger" */
2126 /* Inside "macro trigger" */
2127 else if (parse_under)
2129 /* Strip this key */
2135 /* Hack -- restore the term */
2139 /* Restore the cursor */
2143 /* Cancel the various "global parameters" */
2144 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
2146 /* Return the keypress */
2154 * We use a global array for all inscriptions to reduce the memory
2155 * spent maintaining inscriptions. Of course, it is still possible
2156 * to run out of inscription memory, especially if too many different
2157 * inscriptions are used, but hopefully this will be rare.
2159 * We use dynamic string allocation because otherwise it is necessary
2160 * to pre-guess the amount of quark activity. We limit the total
2161 * number of quarks, but this is much easier to "expand" as needed.
2163 * Any two items with the same inscription will have the same "quark"
2164 * index, which should greatly reduce the need for inscription space.
2166 * Note that "quark zero" is NULL and should not be "dereferenced".
2170 * Add a new "quark" to the set of quarks.
2172 s16b quark_add(cptr str)
2176 /* Look for an existing quark */
2177 for (i = 1; i < quark__num; i++)
2179 /* Check for equality */
2180 if (streq(quark__str[i], str)) return (i);
2183 /* Paranoia -- Require room */
2184 if (quark__num == QUARK_MAX) return (0);
2186 /* New maximal quark */
2189 /* Add a new quark */
2190 quark__str[i] = string_make(str);
2192 /* Return the index */
2198 * This function looks up a quark
2200 cptr quark_str(s16b i)
2205 if ((i < 0) || (i >= quark__num)) i = 0;
2207 /* Access the quark */
2210 /* Return the quark */
2218 * Second try for the "message" handling routines.
2220 * Each call to "message_add(s)" will add a new "most recent" message
2221 * to the "message recall list", using the contents of the string "s".
2223 * The messages will be stored in such a way as to maximize "efficiency",
2224 * that is, we attempt to maximize the number of sequential messages that
2225 * can be retrieved, given a limited amount of storage space.
2227 * We keep a buffer of chars to hold the "text" of the messages, not
2228 * necessarily in "order", and an array of offsets into that buffer,
2229 * representing the actual messages. This is made more complicated
2230 * by the fact that both the array of indexes, and the buffer itself,
2231 * are both treated as "circular arrays" for efficiency purposes, but
2232 * the strings may not be "broken" across the ends of the array.
2234 * The "message_add()" function is rather "complex", because it must be
2235 * extremely efficient, both in space and time, for use with the Borg.
2241 * How many messages are "available"?
2243 s16b message_num(void)
2247 /* Extract the indexes */
2248 last = message__last;
2249 next = message__next;
2252 if (next < last) next += MESSAGE_MAX;
2254 /* Extract the space */
2257 /* Return the result */
2264 * Recall the "text" of a saved message
2266 cptr message_str(int age)
2272 /* Forgotten messages have no text */
2273 if ((age < 0) || (age >= message_num())) return ("");
2275 /* Acquire the "logical" index */
2276 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2278 /* Get the "offset" for the message */
2279 o = message__ptr[x];
2281 /* Access the message text */
2282 s = &message__buf[o];
2284 /* Return the message text */
2291 * Add a new message, with great efficiency
2293 void message_add(cptr str)
2301 /*** Step 1 -- Analyze the message ***/
2303 /* Hack -- Ignore "non-messages" */
2306 /* Message length */
2309 /* Important Hack -- Ignore "long" messages */
2310 if (n >= MESSAGE_BUF / 4) return;
2312 /* extra step -- split the message if n>80. (added by Mogami) */
2317 for (n = 0; n < 80; n++, t++)
2322 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2324 for (n = 80; n > 60; n--)
2325 if (str[n] == ' ') break;
2329 splitted2 = str + n;
2330 strncpy(splitted1, str ,n);
2331 splitted1[n] = '\0';
2337 /*** Step 2 -- Attempt to optimize ***/
2339 /* Limit number of messages to check */
2344 /* Limit number of messages to check */
2345 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2347 /* Check previous message */
2348 for (i = message__next; m; m--)
2357 /* Back up and wrap if needed */
2358 if (i-- == 0) i = MESSAGE_MAX - 1;
2360 /* Access the old string */
2361 old = &message__buf[message__ptr[i]];
2363 /* Skip small messages */
2370 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2371 if( iskanji(*t))t++;
2373 for (t = buf; *t && (*t != '<'); t++);
2378 /* Message is too small */
2379 if (strlen(buf) < 6) break;
2381 /* Drop the space */
2384 /* Get multiplier */
2388 /* Limit the multiplier to 1000 */
2389 if (buf && streq(buf, str) && (j < 1000))
2399 sprintf(u, "%s <x%d>", buf, j);
2401 /* Message length */
2404 if (!now_message) now_message++;
2408 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
2416 /* Check the last few messages (if any to count) */
2417 for (i = message__next; k; k--)
2423 /* Back up and wrap if needed */
2424 if (i-- == 0) i = MESSAGE_MAX - 1;
2426 /* Stop before oldest message */
2427 if (i == message__last) break;
2429 /* Extract "distance" from "head" */
2430 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2432 /* Do not optimize over large distance */
2433 if (q > MESSAGE_BUF / 2) continue;
2435 /* Access the old string */
2436 old = &message__buf[message__ptr[i]];
2439 if (!streq(old, str)) continue;
2441 /* Get the next message index, advance */
2442 x = message__next++;
2445 if (message__next == MESSAGE_MAX) message__next = 0;
2447 /* Kill last message if needed */
2448 if (message__next == message__last) message__last++;
2451 if (message__last == MESSAGE_MAX) message__last = 0;
2453 /* Assign the starting address */
2454 message__ptr[x] = message__ptr[i];
2458 goto end_of_message_add;
2463 /*** Step 3 -- Ensure space before end of buffer ***/
2465 /* Kill messages and Wrap if needed */
2466 if (message__head + n + 1 >= MESSAGE_BUF)
2468 /* Kill all "dead" messages */
2469 for (i = message__last; TRUE; i++)
2471 /* Wrap if needed */
2472 if (i == MESSAGE_MAX) i = 0;
2474 /* Stop before the new message */
2475 if (i == message__next) break;
2477 /* Kill "dead" messages */
2478 if (message__ptr[i] >= message__head)
2480 /* Track oldest message */
2481 message__last = i + 1;
2485 /* Wrap "tail" if needed */
2486 if (message__tail >= message__head) message__tail = 0;
2493 /*** Step 4 -- Ensure space before next message ***/
2495 /* Kill messages if needed */
2496 if (message__head + n + 1 > message__tail)
2498 /* Grab new "tail" */
2499 message__tail = message__head + n + 1;
2501 /* Advance tail while possible past first "nul" */
2502 while (message__buf[message__tail-1]) message__tail++;
2504 /* Kill all "dead" messages */
2505 for (i = message__last; TRUE; i++)
2507 /* Wrap if needed */
2508 if (i == MESSAGE_MAX) i = 0;
2510 /* Stop before the new message */
2511 if (i == message__next) break;
2513 /* Kill "dead" messages */
2514 if ((message__ptr[i] >= message__head) &&
2515 (message__ptr[i] < message__tail))
2517 /* Track oldest message */
2518 message__last = i + 1;
2524 /*** Step 5 -- Grab a new message index ***/
2526 /* Get the next message index, advance */
2527 x = message__next++;
2530 if (message__next == MESSAGE_MAX) message__next = 0;
2532 /* Kill last message if needed */
2533 if (message__next == message__last) message__last++;
2536 if (message__last == MESSAGE_MAX) message__last = 0;
2540 /*** Step 6 -- Insert the message text ***/
2542 /* Assign the starting address */
2543 message__ptr[x] = message__head;
2545 /* Append the new part of the message */
2546 for (i = 0; i < n; i++)
2548 /* Copy the message */
2549 message__buf[message__head + i] = str[i];
2553 message__buf[message__head + i] = '\0';
2555 /* Advance the "head" pointer */
2556 message__head += n + 1;
2558 /* recursively add splitted message (added by Mogami) */
2560 if (splitted2 != NULL)
2561 message_add(splitted2);
2569 static void msg_flush(int x)
2571 byte a = TERM_L_BLUE;
2572 bool nagasu = FALSE;
2574 if ((auto_more && !now_damaged) || num_more < 0){
2576 for (i = 0; i < 8; i++)
2578 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2582 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2589 now_damaged = FALSE;
2591 if (!alive || !nagasu)
2593 /* Pause for response */
2595 Term_putstr(x, 0, -1, a, "-³¤¯-");
2597 Term_putstr(x, 0, -1, a, "-more-");
2601 /* Get an acceptable keypress */
2605 if (cmd == ESCAPE) {
2606 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£ */
2608 } else if (cmd == ' ') {
2609 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
2611 } else if ((cmd == '\n') || (cmd == '\r')) {
2612 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
2615 if (quick_messages) break;
2620 /* Clear the line */
2621 Term_erase(0, 0, 255);
2626 * Output a message to the top line of the screen.
2628 * Break long messages into multiple pieces (40-72 chars).
2630 * Allow multiple short messages to "share" the top line.
2632 * Prompt the user to make sure he has a chance to read them.
2634 * These messages are memorized for later reference (see above).
2636 * We could do "Term_fresh()" to provide "flicker" if needed.
2638 * The global "msg_flag" variable can be cleared to tell us to
2639 * "erase" any "pending" messages still on the screen.
2641 * XXX XXX XXX Note that we must be very careful about using the
2642 * "msg_print()" functions without explicitly calling the special
2643 * "msg_print(NULL)" function, since this may result in the loss
2644 * of information if the screen is cleared, or if anything is
2645 * displayed on the top line.
2647 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2648 * even if no messages are pending. This is probably a hack.
2650 void msg_print(cptr msg)
2660 if (world_monster) return;
2664 /* Clear the line */
2665 Term_erase(0, 0, 255);
2669 /* Message Length */
2670 n = (msg ? strlen(msg) : 0);
2672 /* Hack -- flush when requested or needed */
2673 if (p && (!msg || ((p + n) > 72)))
2690 if (n > 1000) return;
2693 /* Memorize the message */
2694 if (character_generated) message_add(msg);
2700 /* Analyze the buffer */
2707 int check, split = 72;
2710 bool k_flag = FALSE;
2713 /* Find the "best" split point */
2714 for (check = 0; check < 72; check++)
2722 /* Found a valid split point */
2723 if (iskanji(t[check]))
2728 else if (t[check] == ' ')
2741 /* Find the "best" split point */
2742 for (check = 40; check < 72; check++)
2744 /* Found a valid split point */
2745 if (t[check] == ' ') split = check;
2749 /* Save the split character */
2752 /* Split the message */
2755 /* Display part of the message */
2756 Term_putstr(0, 0, split, TERM_WHITE, t);
2759 msg_flush(split + 1);
2761 /* Memorize the piece */
2762 /* if (character_generated) message_add(t); */
2764 /* Restore the split character */
2767 /* Insert a space */
2770 /* Prepare to recurse on the rest of "buf" */
2771 t += split; n -= split;
2775 /* Display the tail of the message */
2776 Term_putstr(p, 0, n, TERM_WHITE, t);
2778 /* Memorize the tail */
2779 /* if (character_generated) message_add(t); */
2782 p_ptr->window |= (PW_MESSAGE);
2785 /* Remember the message */
2788 /* Remember the position */
2796 /* Optional refresh */
2797 if (fresh_message) Term_fresh();
2802 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2804 static int screen_depth = 0;
2808 * Save the screen, and increase the "icky" depth.
2810 * This function must match exactly one call to "screen_load()".
2812 void screen_save(void)
2814 /* Hack -- Flush messages */
2817 /* Save the screen (if legal) */
2818 if (screen_depth++ == 0) Term_save();
2820 /* Increase "icky" depth */
2826 * Load the screen, and decrease the "icky" depth.
2828 * This function must match exactly one call to "screen_save()".
2830 void screen_load(void)
2832 /* Hack -- Flush messages */
2835 /* Load the screen (if legal) */
2836 if (--screen_depth == 0) Term_load();
2838 /* Decrease "icky" depth */
2844 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2846 void msg_format(cptr fmt, ...)
2852 /* Begin the Varargs Stuff */
2855 /* Format the args, save the length */
2856 (void)vstrnfmt(buf, 1024, fmt, vp);
2858 /* End the Varargs Stuff */
2868 * Display a string on the screen using an attribute.
2870 * At the given location, using the given attribute, if allowed,
2871 * add the given string. Do not clear the line.
2873 void c_put_str(byte attr, cptr str, int row, int col)
2875 /* Position cursor, Dump the attr/text */
2876 Term_putstr(col, row, -1, attr, str);
2880 * As above, but in "white"
2882 void put_str(cptr str, int row, int col)
2885 Term_putstr(col, row, -1, TERM_WHITE, str);
2891 * Display a string on the screen using an attribute, and clear
2892 * to the end of the line.
2894 void c_prt(byte attr, cptr str, int row, int col)
2896 /* Clear line, position cursor */
2897 Term_erase(col, row, 255);
2899 /* Dump the attr/text */
2900 Term_addstr(-1, attr, str);
2904 * As above, but in "white"
2906 void prt(cptr str, int row, int col)
2909 c_prt(TERM_WHITE, str, row, col);
2916 * Print some (colored) text to the screen at the current cursor position,
2917 * automatically "wrapping" existing text (at spaces) when necessary to
2918 * avoid placing any text into the last column, and clearing every line
2919 * before placing any text in that line. Also, allow "newline" to force
2920 * a "wrap" to the next line. Advance the cursor as needed so sequential
2921 * calls to this function will work correctly.
2923 * Once this function has been called, the cursor should not be moved
2924 * until all the related "c_roff()" calls to the window are complete.
2926 * This function will correctly handle any width up to the maximum legal
2927 * value of 256, though it works best for a standard 80 character width.
2929 void c_roff(byte a, cptr str)
2937 /* Obtain the size */
2938 (void)Term_get_size(&w, &h);
2940 /* Obtain the cursor */
2941 (void)Term_locate(&x, &y);
2943 /* Hack -- No more space */
2944 if( y == h - 1 && x > w - 3) return;
2946 /* Process the string */
2947 for (s = str; *s; s++)
2952 int k_flag = iskanji(*s);
2964 /* Clear line, move cursor */
2965 Term_erase(x, y, 255);
2968 /* Clean up the char */
2970 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2972 ch = (isprint(*s) ? *s : ' ');
2976 /* Wrap words as needed */
2978 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2980 if ((x >= w - 1) && (ch != ' '))
2993 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
2997 /* Scan existing text */
2998 for (i = w - 2; i >= 0; i--)
3000 /* Grab existing attr/char */
3001 Term_what(i, y, &av[i], &cv[i]);
3003 /* Break on space */
3004 if (cv[i] == ' ') break;
3006 /* Track current word */
3009 if (cv[i] == '(') break;
3017 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
3018 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
3019 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
3020 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
3021 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
3024 Term_what(x , y, &av[x ], &cv[x ]);
3025 Term_what(x-1, y, &av[x-1], &cv[x-1]);
3026 Term_what(x-2, y, &av[x-2], &cv[x-2]);
3037 Term_erase(n, y, 255);
3046 /* Clear line, move cursor */
3047 Term_erase(x, y, 255);
3049 /* Wrap the word (if any) */
3050 for (i = n; i < w - 1; i++)
3053 if( cv[i] == '\0' ) break;
3056 Term_addch(av[i], cv[i]);
3058 /* Advance (no wrap) */
3065 Term_addch((byte)(a|0x10), ch);
3077 Term_addch((byte)(a|0x20), ch);
3086 * As above, but in "white"
3091 c_roff(TERM_WHITE, str);
3098 * Clear part of the screen
3100 void clear_from(int row)
3104 /* Erase requested rows */
3105 for (y = row; y < Term->hgt; y++)
3107 /* Erase part of the screen */
3108 Term_erase(0, y, 255);
3116 * Get some input at the cursor location.
3117 * Assume the buffer is initialized to a default string.
3118 * Note that this string is often "empty" (see below).
3119 * The default buffer is displayed in yellow until cleared.
3120 * Pressing RETURN right away accepts the default entry.
3121 * Normal chars clear the default and append the char.
3122 * Backspace clears the default or deletes the final char.
3123 * ESCAPE clears the buffer and the window and returns FALSE.
3124 * RETURN accepts the current buffer contents and returns TRUE.
3126 bool askfor_aux(char *buf, int len)
3140 /* Locate the cursor */
3141 Term_locate(&x, &y);
3144 /* Paranoia -- check len */
3145 if (len < 1) len = 1;
3147 /* Paranoia -- check column */
3148 if ((x < 0) || (x >= 80)) x = 0;
3150 /* Restrict the length */
3151 if (x + len > 80) len = 80 - x;
3154 /* Paranoia -- Clip the default entry */
3158 /* Display the default answer */
3159 Term_erase(x, y, len);
3160 Term_putstr(x, y, -1, TERM_YELLOW, buf);
3167 Term_gotoxy(x + k, y);
3172 /* Analyze the key */
3203 { /* ÊÒ»³¤µ¤óºîÀ® */
3217 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3219 if(k<len && isprint(i)){
3228 if ((k < len) && (isprint(i)))
3244 /* Update the entry */
3245 Term_erase(x, y, len);
3246 Term_putstr(x, y, -1, TERM_WHITE, buf);
3250 if (i == ESCAPE) return (FALSE);
3258 * Get a string from the user
3260 * The "prompt" should take the form "Prompt: "
3262 * Note that the initial contents of the string is used as
3263 * the default response, so be sure to "clear" it if needed.
3265 * We clear the input, and return FALSE, on "ESCAPE".
3267 bool get_string(cptr prompt, char *buf, int len)
3271 /* Paranoia XXX XXX XXX */
3274 /* Display prompt */
3277 /* Ask the user for a string */
3278 res = askfor_aux(buf, len);
3289 * Verify something with the user
3291 * The "prompt" should take the form "Query? "
3293 * Note that "[y/n]" is appended to the prompt.
3295 bool get_check(cptr prompt)
3297 return get_check_strict(prompt, 0);
3301 * Verify something with the user strictly
3303 * mode & 0x01 : force user to answer "YES" or "N"
3304 * mode & 0x02 : don't allow ESCAPE key
3305 * mode & 0x04 : no message_add
3307 bool get_check_strict(cptr prompt, int mode)
3314 p_ptr->window |= PW_MESSAGE;
3319 /* Paranoia XXX XXX XXX */
3322 if (!rogue_like_commands)
3326 /* Hack -- Build a "useful" prompt */
3330 /* (79-8)¥Ð¥¤¥È¤Î»ØÄê, prompt¤¬Ä¹¤«¤Ã¤¿¾ì¹ç,
3331 (79-9)ʸ»ú¤Î¸å½ªÃ¼Ê¸»ú¤¬½ñ¤¹þ¤Þ¤ì¤ë.
3332 ±Ñ¸ì¤ÎÊý¤Îstrncpy¤È¤Ï°ã¤¦¤Î¤ÇÃí°Õ.
3333 else¤ÎÊý¤Îʬ´ô¤âƱÍÍ. --henkma
3335 mb_strlcpy(buf, prompt, 80-15);
3337 strncpy(buf, prompt, 79-15);
3340 strcat(buf, "[(O)k/(C)ancel]");
3346 mb_strlcpy(buf, prompt, 80-5);
3348 strncpy(buf, prompt, 79-5);
3351 strcat(buf, "[y/n]");
3359 /* HACK : Add the line to message buffer */
3361 p_ptr->window |= (PW_MESSAGE);
3365 /* Get an acceptable answer */
3371 if ( i == 'o' || i == 'O' )
3377 else if (i == 'y' || i == 'Y')
3381 if (!(mode & 2) && (i == ESCAPE)) break;
3384 if ( i == 'c' || i == 'C' )
3389 else if (i == 'n' || i == 'N')
3396 /* Erase the prompt */
3399 /* Normal negation */
3400 if ((i != 'Y') && (i != 'y')) return (FALSE);
3408 * Prompts for a keypress
3410 * The "prompt" should take the form "Command: "
3412 * Returns TRUE unless the character is "Escape"
3414 bool get_com(cptr prompt, char *command, bool z_escape)
3416 /* Paranoia XXX XXX XXX */
3419 /* Display a prompt */
3425 /* Clear the prompt */
3428 /* Handle "cancel" */
3429 if (*command == ESCAPE) return (FALSE);
3430 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3438 * Request a "quantity" from the user
3440 * Hack -- allow "command_arg" to specify a quantity
3442 s16b get_quantity(cptr prompt, int max)
3451 /* Use "command_arg" */
3454 /* Extract a number */
3457 /* Clear "command_arg" */
3460 /* Enforce the maximum */
3461 if (amt > max) amt = max;
3467 #ifdef ALLOW_REPEAT /* TNB */
3469 /* Get the item index */
3470 if ((max != 1) && repeat_pull(&amt))
3472 /* Enforce the maximum */
3473 if (amt > max) amt = max;
3475 /* Enforce the minimum */
3476 if (amt < 0) amt = 0;
3482 #endif /* ALLOW_REPEAT -- TNB */
3484 /* Build a prompt if needed */
3487 /* Build a prompt */
3489 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3491 sprintf(tmp, "Quantity (1-%d): ", max);
3495 /* Use that prompt */
3500 /* Default to one */
3503 /* Build the default */
3504 sprintf(buf, "%d", amt);
3506 /* Ask for a quantity */
3507 if (!get_string(prompt, buf, 6)) return (0);
3509 /* Extract a number */
3512 /* A letter means "all" */
3513 if (isalpha(buf[0])) amt = max;
3515 /* Enforce the maximum */
3516 if (amt > max) amt = max;
3518 /* Enforce the minimum */
3519 if (amt < 0) amt = 0;
3521 #ifdef ALLOW_REPEAT /* TNB */
3523 if (amt) repeat_push(amt);
3525 #endif /* ALLOW_REPEAT -- TNB */
3527 /* Return the result */
3533 * Pause for user response XXX XXX XXX
3535 void pause_line(int row)
3540 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3542 put_str("[Press any key to continue]", row, 23);
3551 * Hack -- special buffer to hold the action of the current keymap
3553 static char request_command_buffer[256];
3565 menu_naiyou menu_info[10][10] =
3568 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3570 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3571 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3573 {"Èâ/È¢", 6, FALSE},
3576 {"¤½¤Î¾", 9, FALSE},
3581 {"»È¤¦(m)", 'm', TRUE},
3582 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3583 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3584 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3594 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3595 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3596 {"õ¤¹(s)", 's', TRUE},
3597 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3598 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3599 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3600 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3601 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3602 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3603 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3607 {"Æɤà(r)", 'r', TRUE},
3608 {"°û¤à(q)", 'q', TRUE},
3609 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3610 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3611 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3612 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3613 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3614 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3615 {"Åꤲ¤ë(v)", 'v', TRUE},
3620 {"½¦¤¦(g)", 'g', TRUE},
3621 {"Íî¤È¤¹(d)", 'd', TRUE},
3622 {"²õ¤¹(k/^d)", 'k', TRUE},
3623 {"Ìäò¹ï¤à({)", '{', TRUE},
3624 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3625 {"Ä´ºº(I)", 'I', TRUE},
3626 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3633 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3634 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3635 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3636 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3646 {"³«¤±¤ë(o)", 'o', TRUE},
3647 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3648 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3649 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3659 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3660 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3661 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3662 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3663 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3664 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3665 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3666 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3667 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3672 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3673 {"¥Þ¥¯¥í(@)", '@', TRUE},
3674 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3675 {"¥«¥é¡¼(&)", '&', TRUE},
3676 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3677 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3678 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3685 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3686 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3687 {"¥Ø¥ë¥×(?)", '?', TRUE},
3688 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3689 {"¥á¥â(:)", ':', TRUE},
3690 {"µÇ°»£±Æ())", ')', TRUE},
3691 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3692 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3693 {"°úÂह¤ë(Q)", 'Q', TRUE},
3698 menu_naiyou menu_info[10][10] =
3701 {"Magic/Special", 1, FALSE},
3702 {"Action", 2, FALSE},
3703 {"Items(use)", 3, FALSE},
3704 {"Items(other)", 4, FALSE},
3705 {"Equip", 5, FALSE},
3706 {"Door/Box", 6, FALSE},
3707 {"Infomations", 7, FALSE},
3708 {"Options", 8, FALSE},
3709 {"Other commands", 9, FALSE},
3714 {"Use(m)", 'm', TRUE},
3715 {"See tips(b/P)", 'b', TRUE},
3716 {"Study(G)", 'G', TRUE},
3717 {"Special abilities(U/O)", 'U', TRUE},
3727 {"Rest(R)", 'R', TRUE},
3728 {"Disarm a trap(D)", 'D', TRUE},
3729 {"Search(s)", 's', TRUE},
3730 {"Look(l/x)", 'l', TRUE},
3731 {"Target(*)", '*', TRUE},
3732 {"Dig(T/^t)", 'T', TRUE},
3733 {"Go up stairs(<)", '<', TRUE},
3734 {"Go down staies(>)", '>', TRUE},
3735 {"Command pets(p)", 'p', TRUE},
3736 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3740 {"Read a scroll(r)", 'r', TRUE},
3741 {"Drink a potion(q)", 'q', TRUE},
3742 {"Use a staff(u/Z)", 'u', TRUE},
3743 {"Aim a wand(a/z)", 'a', TRUE},
3744 {"Zap a rod(z/a)", 'z', TRUE},
3745 {"Activate an equipment(A)", 'A', TRUE},
3746 {"Eat(E)", 'E', TRUE},
3747 {"Fire missile weapon(f/t)", 'f', TRUE},
3748 {"Throw an item(v)", 'v', TRUE},
3753 {"Get items(g)", 'g', TRUE},
3754 {"Drop an item(d)", 'd', TRUE},
3755 {"Destroy an item(k/^d)", 'k', TRUE},
3756 {"Inscribe an item({)", '{', TRUE},
3757 {"Uninscribe an item(})", '}', TRUE},
3758 {"Info about an item(I)", 'I', TRUE},
3759 {"Inventory list(i)", 'i', TRUE},
3766 {"Wear(w)", 'w', TRUE},
3767 {"Take off(t/T)", 't', TRUE},
3768 {"Refuel(F)", 'F', TRUE},
3769 {"Equipment list(e)", 'e', TRUE},
3779 {"Open(o)", 'o', TRUE},
3780 {"Close(c)", 'c', TRUE},
3781 {"Bash a door(B/f)", 'B', TRUE},
3782 {"Jam a door(j/S)", 'j', TRUE},
3792 {"Full map(M)", 'M', TRUE},
3793 {"Map(L/W)", 'L', TRUE},
3794 {"Level feeling(^f)", KTRL('F'), TRUE},
3795 {"Character status(C)", 'C', TRUE},
3796 {"Identify symbol(/)", '/', TRUE},
3797 {"Show prev messages(^p)", KTRL('P'), TRUE},
3798 {"Current time(^t/')", KTRL('T'), TRUE},
3799 {"Various infomations(~)", '~', TRUE},
3800 {"Play record menu(|)", '|', TRUE},
3805 {"Set options(=)", '=', TRUE},
3806 {"Interact with macros(@)", '@', TRUE},
3807 {"Interact w/ visuals(%)", '%', TRUE},
3808 {"Interact with colors(&)", '&', TRUE},
3809 {"Enter a user pref(\")", '\"', TRUE},
3810 {"Reload auto-pick pref($)", '$', TRUE},
3818 {"Save and quit(^x)", KTRL('X'), TRUE},
3819 {"Save(^s)", KTRL('S'), TRUE},
3820 {"Help(obsoleted)(?)", '?', TRUE},
3821 {"Redraw(^r)", KTRL('R'), TRUE},
3822 {"Take note(:)", ':', TRUE},
3823 {"Dump screen dump(()", ')', TRUE},
3824 {"Load screen dump())", '(', TRUE},
3825 {"Version info(V)", 'V', TRUE},
3826 {"Quit(Q)", 'Q', TRUE},
3839 } special_menu_naiyou;
3841 #define MENU_CLASS 1
3845 special_menu_naiyou special_menu_info[] =
3847 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3848 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3849 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3850 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3851 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3852 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3853 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3857 special_menu_naiyou special_menu_info[] =
3859 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3860 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3861 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3862 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3863 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3864 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3865 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3870 static char inkey_from_menu(void)
3874 int num = 0, max_num, old_num = 0;
3878 if (py - panel_row_min > 10) basey = 2;
3882 /* Clear top line */
3892 if (!menu) old_num = num;
3893 put_str("+----------------------------------------------------+", basey, basex);
3894 put_str("| |", basey+1, basex);
3895 put_str("| |", basey+2, basex);
3896 put_str("| |", basey+3, basex);
3897 put_str("| |", basey+4, basex);
3898 put_str("| |", basey+5, basex);
3899 put_str("+----------------------------------------------------+", basey+6, basex);
3901 for(i = 0; i < 10; i++)
3904 if (!menu_info[menu][i].cmd) break;
3905 menu_name = menu_info[menu][i].name;
3906 for(hoge = 0; ; hoge++)
3908 if (!special_menu_info[hoge].name[0]) break;
3909 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3910 switch(special_menu_info[hoge].jouken)
3913 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3916 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
3918 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3925 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
3928 kisuu = max_num % 2;
3930 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3932 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3935 /* Place the cursor on the player */
3936 move_cursor_relative(py, px);
3940 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r') || (sub_cmd == '\n'))
3942 if (menu_info[menu][num].fin)
3944 cmd = menu_info[menu][num].cmd;
3950 menu = menu_info[menu][num].cmd;
3956 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
3973 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
3978 num = (num + 2) % (max_num - 1);
3980 num = (num + 2) % (max_num + 1);
3982 else num = (num + 2) % max_num;
3984 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
3989 num = (num + max_num - 3) % (max_num - 1);
3991 num = (num + max_num - 1) % (max_num + 1);
3993 else num = (num + max_num - 2) % max_num;
3995 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
3997 if ((num % 2) || (num == max_num - 1))
4001 else if (num < max_num - 1)
4009 if (!inkey_next) inkey_next = "";
4015 * Request a command from the user.
4017 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
4018 * p_ptr->command_arg. May modify p_ptr->command_new.
4020 * Note that "caret" ("^") is treated specially, and is used to
4021 * allow manual input of control characters. This can be used
4022 * on many machines to request repeated tunneling (Ctrl-H) and
4023 * on the Macintosh to request "Control-Caret".
4025 * Note that "backslash" is treated specially, and is used to bypass any
4026 * keymap entry for the following character. This is useful for macros.
4028 * Note that this command is used both in the dungeon and in
4029 * stores, and must be careful to work in both situations.
4031 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
4033 void request_command(int shopping)
4046 if (rogue_like_commands)
4048 mode = KEYMAP_MODE_ROGUE;
4054 mode = KEYMAP_MODE_ORIG;
4058 /* No command yet */
4061 /* No "argument" yet */
4064 /* No "direction" yet */
4073 /* Hack -- auto-commands */
4076 /* Flush messages */
4079 /* Use auto-command */
4086 /* Get a keypress in "command" mode */
4089 /* Hack -- no flush needed */
4093 /* Activate "command mode" */
4099 if (!shopping && command_menu && ((cmd == '\r') || (cmd == '\n') || (cmd == 'x') || (cmd == 'X'))
4100 && !keymap_act[mode][(byte)(cmd)])
4101 cmd = inkey_from_menu();
4104 /* Clear top line */
4111 int old_arg = command_arg;
4116 /* Begin the input */
4118 prt("²ó¿ô: ", 0, 0);
4120 prt("Count: ", 0, 0);
4124 /* Get a command count */
4127 /* Get a new keypress */
4130 /* Simple editing (delete or backspace) */
4131 if ((cmd == 0x7F) || (cmd == KTRL('H')))
4133 /* Delete a digit */
4134 command_arg = command_arg / 10;
4136 /* Show current count */
4138 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4140 prt(format("Count: %d", command_arg), 0, 0);
4145 /* Actual numeric data */
4146 else if (cmd >= '0' && cmd <= '9')
4148 /* Stop count at 9999 */
4149 if (command_arg >= 1000)
4158 /* Increase count */
4161 /* Incorporate that digit */
4162 command_arg = command_arg * 10 + D2I(cmd);
4165 /* Show current count */
4167 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4169 prt(format("Count: %d", command_arg), 0, 0);
4174 /* Exit on "unusable" input */
4181 /* Hack -- Handle "zero" */
4182 if (command_arg == 0)
4187 /* Show current count */
4189 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4191 prt(format("Count: %d", command_arg), 0, 0);
4196 /* Hack -- Handle "old_arg" */
4199 /* Restore old_arg */
4200 command_arg = old_arg;
4202 /* Show current count */
4204 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4206 prt(format("Count: %d", command_arg), 0, 0);
4211 /* Hack -- white-space means "enter command now" */
4212 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
4214 /* Get a real command */
4216 if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
4218 if (!get_com("Command: ", (char *)&cmd, FALSE))
4232 /* Allow "keymaps" to be bypassed */
4235 /* Get a real command */
4237 (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
4239 (void)get_com("Command: ", (char *)&cmd, FALSE);
4243 /* Hack -- bypass keymaps */
4244 if (!inkey_next) inkey_next = "";
4248 /* Allow "control chars" to be entered */
4251 /* Get a new command and controlify it */
4253 if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4255 if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4261 /* Look up applicable keymap */
4262 act = keymap_act[mode][(byte)(cmd)];
4264 /* Apply keymap if not inside a keymap already */
4265 if (act && !inkey_next)
4267 /* Install the keymap (limited buffer size) */
4268 (void)strnfmt(request_command_buffer, 256, "%s", act);
4270 /* Start using the buffer */
4271 inkey_next = request_command_buffer;
4283 command_cmd = (byte)cmd;
4289 /* Hack -- Auto-repeat certain commands */
4290 if (always_repeat && (command_arg <= 0))
4292 /* Hack -- auto repeat certain commands */
4293 if (strchr("TBDoc+", command_cmd))
4295 /* Repeat 99 times */
4304 switch (command_cmd)
4306 /* Command "p" -> "purchase" (get) */
4307 case 'p': command_cmd = 'g'; break;
4309 /* Command "m" -> "purchase" (get) */
4310 case 'm': command_cmd = 'g'; break;
4312 /* Command "s" -> "sell" (drop) */
4313 case 's': command_cmd = 'd'; break;
4318 for (i = 0; i < 256; i++)
4321 if ((s = keymap_act[mode][i]) != NULL)
4323 if (*s == command_cmd && *(s+1) == 0)
4331 caretcmd = command_cmd;
4333 /* Hack -- Scan equipment */
4334 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4338 object_type *o_ptr = &inventory[i];
4340 /* Skip non-objects */
4341 if (!o_ptr->k_idx) continue;
4343 /* No inscription */
4344 if (!o_ptr->inscription) continue;
4346 /* Obtain the inscription */
4347 s = quark_str(o_ptr->inscription);
4352 /* Process preventions */
4355 /* Check the "restriction" character */
4357 if ((s[1] == caretcmd) || (s[1] == '*'))
4359 if ((s[1] == command_cmd) || (s[1] == '*'))
4363 /* Hack -- Verify command */
4365 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4367 if (!get_check("Are you sure? "))
4371 /* Hack -- Use space */
4376 /* Find another '^' */
4377 s = strchr(s + 1, '^');
4382 /* Hack -- erase the message line. */
4389 * Check a char for "vowel-hood"
4391 bool is_a_vowel(int ch)
4416 * Replace the first instance of "target" in "buf" with "insert"
4417 * If "insert" is NULL, just remove the first instance of "target"
4418 * In either case, return TRUE if "target" is found.
4420 * XXX Could be made more efficient, especially in the
4421 * case where "insert" is smaller than "target".
4423 static bool insert_str(char *buf, cptr target, cptr insert)
4426 int b_len, t_len, i_len;
4428 /* Attempt to find the target (modify "buf") */
4429 buf = strstr(buf, target);
4431 /* No target found */
4432 if (!buf) return (FALSE);
4434 /* Be sure we have an insertion string */
4435 if (!insert) insert = "";
4437 /* Extract some lengths */
4438 t_len = strlen(target);
4439 i_len = strlen(insert);
4440 b_len = strlen(buf);
4442 /* How much "movement" do we need? */
4443 len = i_len - t_len;
4445 /* We need less space (for insert) */
4448 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4451 /* We need more space (for insert) */
4454 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4457 /* If movement occured, we need a new terminator */
4458 if (len) buf[b_len+len] = '\0';
4460 /* Now copy the insertion string */
4461 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4463 /* Successful operation */
4473 * Called from cmd4.c and a few other places. Just extracts
4474 * a direction from the keymap for ch (the last direction,
4475 * in fact) byte or char here? I'm thinking that keymaps should
4476 * generally only apply to single keys, which makes it no more
4477 * than 128, so a char should suffice... but keymap_act is 256...
4479 int get_keymap_dir(char ch)
4484 if (rogue_like_commands)
4486 act = keymap_act[KEYMAP_MODE_ROGUE][(byte)ch];
4490 act = keymap_act[KEYMAP_MODE_ORIG][(byte)ch];
4495 /* Convert to a direction */
4496 for (s = act; *s; ++s)
4498 /* Use any digits in keymap */
4499 if (isdigit(*s)) d = D2I(*s);
4506 #ifdef ALLOW_REPEAT /* TNB */
4508 #define REPEAT_MAX 20
4510 /* Number of chars saved */
4511 static int repeat__cnt = 0;
4514 static int repeat__idx = 0;
4517 static int repeat__key[REPEAT_MAX];
4520 void repeat_push(int what)
4523 if (repeat__cnt == REPEAT_MAX) return;
4525 /* Push the "stuff" */
4526 repeat__key[repeat__cnt++] = what;
4528 /* Prevents us from pulling keys */
4533 bool repeat_pull(int *what)
4535 /* All out of keys */
4536 if (repeat__idx == repeat__cnt) return (FALSE);
4538 /* Grab the next key, advance */
4539 *what = repeat__key[repeat__idx++];
4545 void repeat_check(void)
4549 /* Ignore some commands */
4550 if (command_cmd == ESCAPE) return;
4551 if (command_cmd == ' ') return;
4552 if (command_cmd == '\r') return;
4553 if (command_cmd == '\n') return;
4555 /* Repeat Last Command */
4556 if (command_cmd == 'n')
4561 /* Get the command */
4562 if (repeat_pull(&what))
4564 /* Save the command */
4569 /* Start saving new command */
4578 /* Save this command */
4583 #endif /* ALLOW_REPEAT -- TNB */
4589 * Array size for which InsertionSort
4590 * is used instead of QuickSort
4596 * Exchange two sort-entries
4597 * (should probably be coded inline
4598 * for speed increase)
4600 static void swap(tag_type *a, tag_type *b)
4605 temp.pointer = a->pointer;
4608 a->pointer = b->pointer;
4611 b->pointer = temp.pointer;
4616 * Insertion-Sort algorithm
4617 * (used by the Quicksort algorithm)
4619 static void InsertionSort(tag_type elements[], int number)
4625 for (P = 1; P < number; P++)
4628 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4629 elements[j] = elements[j - 1];
4636 * Helper function for Quicksort
4638 static tag_type median3(tag_type elements[], int left, int right)
4640 int center = (left + right) / 2;
4642 if (elements[left].tag > elements[center].tag)
4643 swap(&elements[left], &elements[center]);
4644 if (elements[left].tag > elements[right].tag)
4645 swap(&elements[left], &elements[right]);
4646 if (elements[center].tag > elements[right].tag)
4647 swap(&elements[center], &elements[right]);
4649 swap(&elements[center], &elements[right - 1]);
4650 return (elements[right - 1]);
4655 * Quicksort algorithm
4657 * The "median of three" pivot selection eliminates
4658 * the bad case of already sorted input.
4660 * We use InsertionSort for smaller sub-arrays,
4661 * because it is faster in this case.
4663 * For details see: "Data Structures and Algorithm
4664 * Analysis in C" by Mark Allen Weiss.
4666 static void quicksort(tag_type elements[], int left, int right)
4671 if (left + CUTOFF <= right)
4673 pivot = median3(elements, left, right);
4675 i = left; j = right -1;
4679 while (elements[++i].tag < pivot.tag);
4680 while (elements[--j].tag > pivot.tag);
4683 swap(&elements[i], &elements[j]);
4689 swap(&elements[i], &elements[right - 1]);
4691 quicksort(elements, left, i - 1);
4692 quicksort(elements, i + 1, right);
4696 /* Use InsertionSort on small arrays */
4697 InsertionSort(elements + left, right - left + 1);
4703 * Frontend for the sorting algorithm
4705 * Sorts an array of tagged pointers
4706 * with <number> elements.
4708 void tag_sort(tag_type elements[], int number)
4710 quicksort(elements, 0, number - 1);
4713 #endif /* SORT_R_INFO */
4715 #ifdef SUPPORT_GAMMA
4717 /* Table of gamma values */
4718 byte gamma_table[256];
4720 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4721 static s16b gamma_helper[256] =
4723 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4724 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4725 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4726 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4727 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4728 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4729 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4730 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4731 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4732 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4733 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4734 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4735 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4736 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4737 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4738 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4743 * Build the gamma table so that floating point isn't needed.
4745 * Note gamma goes from 0->256. The old value of 100 is now 128.
4747 void build_gamma_table(int gamma)
4752 * value is the current sum.
4753 * diff is the new term to add to the series.
4757 /* Hack - convergence is bad in these cases. */
4759 gamma_table[255] = 255;
4761 for (i = 1; i < 255; i++)
4764 * Initialise the Taylor series
4766 * value and diff have been scaled by 256
4771 diff = ((long)gamma_helper[i]) * (gamma - 256);
4780 * Use the following identiy to calculate the gamma table.
4781 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4783 * n is the current term number.
4785 * The gamma_helper array contains a table of
4787 * This is used because a^b = exp(b*ln(a))
4793 * Note that everything is scaled by 256 for accuracy,
4794 * plus another factor of 256 for the final result to
4795 * be from 0-255. Thus gamma_helper[] * gamma must be
4796 * divided by 256*256 each itteration, to get back to
4797 * the original power series.
4799 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4803 * Store the value in the table so that the
4804 * floating point pow function isn't needed .
4806 gamma_table[i] = ((long)(value / 256) * i) / 256;
4810 #endif /* SUPPORT_GAMMA */
4812 void roff_to_buf(cptr str, int maxlen, char *tbuf)
4818 unsigned char ch[3];
4821 while (str[read_pt])
4826 ch[0] = str[read_pt];
4829 kanji = iskanji(ch[0]);
4831 ch[1] = str[read_pt+1];
4832 if (!kanji && !isprint(ch[0]))
4835 if (!isprint(ch[0]))
4839 if (line_len >= maxlen - 1 || str[read_pt] == '\n')
4843 /* return to better wrapping point. */
4844 /* Space character at the end of the line need not to be printed. */
4845 word_len = read_pt - word_punct;
4846 if (ch[0] != ' ' && word_len < line_len/2)
4848 read_pt = word_punct;
4849 if (str[word_punct] == ' ')
4851 write_pt -= word_len;
4855 tbuf[write_pt++] = '\0';
4857 word_punct = read_pt;
4861 word_punct = read_pt;
4864 strcmp((char *)ch, "¡£") != 0 && strcmp((char *)ch, "¡¢") != 0 &&
4865 strcmp((char *)ch, "¥£") != 0 && strcmp((char *)ch, "¡¼") != 0)
4866 word_punct = read_pt;
4868 tbuf[write_pt++] = ch[0];
4874 tbuf[write_pt++] = ch[1];
4880 tbuf[write_pt] = '\0';
4881 tbuf[write_pt+1] = '\0';