4 * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke
6 * This software may be copied and distributed for educational, research,
7 * and not for profit purposes provided that this copyright and statement
8 * are included in all such copies. Other copyrights may also apply.
11 /* Purpose: Angband utilities -BEN- */
18 static int num_more = 0;
24 * For those systems that don't have "stricmp()"
26 * Compare the two strings "a" and "b" ala "strcmp()" ignoring case.
28 int stricmp(cptr a, cptr b)
33 /* Scan the strings */
34 for (s1 = a, s2 = b; TRUE; s1++, s2++)
38 if (z1 < z2) return (-1);
39 if (z1 > z2) return (1);
44 #endif /* HAS_STRICMP */
52 * For those systems that don't have "usleep()" but need it.
54 * Fake "usleep()" function grabbed from the inl netrek server -cba
56 int usleep(huge usecs)
63 fd_set *no_fds = NULL;
69 /* Was: int readfds, writefds, exceptfds; */
70 /* Was: readfds = writefds = exceptfds = 0; */
73 /* Paranoia -- No excessive sleeping */
75 if (usecs > 4000000L) core("ÉÔÅö¤Ê usleep() ¸Æ¤Ó½Ð¤·");
77 if (usecs > 4000000L) core("Illegal usleep() call");
83 Timer.tv_sec = (usecs / 1000000L);
84 Timer.tv_usec = (usecs % 1000000L);
87 if (select(nfds, no_fds, no_fds, no_fds, &Timer) < 0)
89 /* Hack -- ignore interrupts */
90 if (errno != EINTR) return -1;
101 * Hack -- External functions
104 extern struct passwd *getpwuid(uid_t uid);
105 extern struct passwd *getpwnam(const char *name);
110 * Find a default user name from the system.
112 void user_name(char *buf, int id)
116 /* Look up the user name */
117 if ((pw = getpwuid(id)))
119 (void)strcpy(buf, pw->pw_name);
122 #ifdef CAPITALIZE_USER_NAME
123 /* Hack -- capitalize the user name */
125 if (!iskanji(buf[0]))
128 buf[0] = toupper(buf[0]);
129 #endif /* CAPITALIZE_USER_NAME */
134 /* Oops. Hack -- default to "PLAYER" */
135 strcpy(buf, "PLAYER");
144 * The concept of the "file" routines below (and elsewhere) is that all
145 * file handling should be done using as few routines as possible, since
146 * every machine is slightly different, but these routines always have the
149 * In fact, perhaps we should use the "path_parse()" routine below to convert
150 * from "canonical" filenames (optional leading tilde's, internal wildcards,
151 * slash as the path seperator, etc) to "system" filenames (no special symbols,
152 * system-specific path seperator, etc). This would allow the program itself
153 * to assume that all filenames are "Unix" filenames, and explicitly "extract"
154 * such filenames if needed (by "path_parse()", or perhaps "path_canon()").
156 * Note that "path_temp" should probably return a "canonical" filename.
158 * Note that "my_fopen()" and "my_open()" and "my_make()" and "my_kill()"
159 * and "my_move()" and "my_copy()" should all take "canonical" filenames.
161 * Note that "canonical" filenames use a leading "slash" to indicate an absolute
162 * path, and a leading "tilde" to indicate a special directory, and default to a
163 * relative path, but MSDOS uses a leading "drivename plus colon" to indicate the
164 * use of a "special drive", and then the rest of the path is parsed "normally",
165 * and MACINTOSH uses a leading colon to indicate a relative path, and an embedded
166 * colon to indicate a "drive plus absolute path", and finally defaults to a file
167 * in the current working directory, which may or may not be defined.
169 * We should probably parse a leading "~~/" as referring to "ANGBAND_DIR". (?)
177 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
187 * Extract a "parsed" path from an initial filename
188 * Normally, we simply copy the filename into the buffer
189 * But leading tilde symbols must be handled in a special way
190 * Replace "~user/" by the home directory of the user named "user"
191 * Replace "~/" by the home directory of the current user
193 errr path_parse(char *buf, int max, cptr file)
200 /* Assume no result */
204 if (!file) return (-1);
206 /* File needs no parsing */
209 (void)strnfmt(buf, max, "%s", file);
213 /* Point at the user */
216 /* Look for non-user portion of the file */
217 s = strstr(u, PATH_SEP);
219 /* Hack -- no long user names */
220 if (s && (s >= u + sizeof(user))) return (1);
222 /* Extract a user name */
226 for (i = 0; u < s; ++i) user[i] = *u++;
231 /* Look up the "current" user */
232 if (u[0] == '\0') u = getlogin();
234 /* Look up a user (or "current" user) */
235 if (u) pw = getpwnam(u);
236 else pw = getpwuid(getuid());
241 /* Make use of the info */
242 if (s) strnfmt(buf, max, "%s%s", pw->pw_dir, s);
243 else strnfmt(buf, max, "%s", pw->pw_dir);
254 * Extract a "parsed" path from an initial filename
256 * This requires no special processing on simple machines,
257 * except for verifying the size of the filename.
259 errr path_parse(char *buf, int max, cptr file)
261 /* Accept the filename */
262 (void)strnfmt(buf, max, "%s", file);
275 * Hack -- acquire a "temporary" file name if possible
277 * This filename is always in "system-specific" form.
279 static errr path_temp(char *buf, int max)
289 /* Format to length */
290 (void)strnfmt(buf, max, "%s", s);
299 * Create a new path by appending a file (or directory) to a path.
301 * This requires no special processing on simple machines, except
302 * for verifying the size of the filename, but note the ability to
303 * bypass the given "path" with certain special file-names.
305 * Note that the "file" may actually be a "sub-path", including
308 * Note that this function yields a path which must be "parsed"
309 * using the "parse" function above.
311 errr path_build(char *buf, int max, cptr path, cptr file)
316 /* Use the file itself */
317 (void)strnfmt(buf, max, "%s", file);
320 /* Absolute file, on "normal" systems */
321 else if (prefix(file, PATH_SEP) && !streq(PATH_SEP, ""))
323 /* Use the file itself */
324 (void)strnfmt(buf, max, "%s", file);
330 /* Use the file itself */
331 (void)strnfmt(buf, max, "%s", file);
337 /* Build the new path */
338 (void)strnfmt(buf, max, "%s%s%s", path, PATH_SEP, file);
347 * Hack -- replacement for "fopen()"
349 FILE *my_fopen(cptr file, cptr mode)
353 #if defined(MACINTOSH) && defined(MAC_MPW)
357 /* Hack -- Try to parse the path */
358 if (path_parse(buf, 1024, file)) return (NULL);
360 #if defined(MACINTOSH) && defined(MAC_MPW)
361 if (strchr(mode, 'w'))
363 /* setting file type/creator */
364 tempfff = fopen(buf, mode);
365 fsetfileinfo(file, _fcreator, _ftype);
370 /* Attempt to fopen the file anyway */
371 return (fopen(buf, mode));
376 * Hack -- replacement for "fclose()"
378 errr my_fclose(FILE *fff)
381 if (!fff) return (-1);
383 /* Close, check for error */
384 if (fclose(fff) == EOF) return (1);
396 FILE *my_fopen_temp(char *buf, int max)
400 /* Prepare the buffer for mkstemp */
401 strncpy(buf, "/tmp/anXXXXXX", max);
403 /* Secure creation of a temporary file */
406 /* Check the file-descriptor */
407 if (fd < 0) return (NULL);
409 /* Return a file stream */
410 return (fdopen(fd, "w"));
413 #else /* HAVE_MKSTEMP */
415 FILE *my_fopen_temp(char *buf, int max)
417 /* Generate a temporary filename */
418 if (path_temp(buf, max)) return (NULL);
421 return (my_fopen(buf, "w"));
424 #endif /* HAVE_MKSTEMP */
428 * Hack -- replacement for "fgets()"
430 * Read a string, without a newline, to a file
432 * Process tabs, strip internal non-printables
434 errr my_fgets(FILE *fff, char *buf, huge n)
443 if (fgets(tmp, 1024, fff))
445 /* Convert weirdness */
446 for (s = tmp; *s; s++)
461 /* Hack -- require room */
462 if (i + 8 >= n) break;
467 /* Append some more spaces */
468 while (!(i % 8)) buf[i++] = ' ';
472 else if (iskanji(*s))
480 else if ((((int)*s & 0xff) > 0xa1) && (((int)*s & 0xff ) < 0xdf))
487 /* Handle printables */
488 else if (isprint(*s))
497 /* No newline character, but terminate */
513 * Hack -- replacement for "fputs()"
515 * Dump a string, plus a newline, to a file
517 * XXX XXX XXX Process internal weirdness?
519 errr my_fputs(FILE *fff, cptr buf, huge n)
524 /* Dump, ignore errors */
525 (void)fprintf(fff, "%s\n", buf);
536 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
538 * Many of them can be rewritten now that only "fd_open()" and "fd_make()"
539 * and "my_fopen()" should ever create files.
547 * Code Warrior is a little weird about some functions
550 extern int open(const char *, int, ...);
551 extern int close(int);
552 extern int read(int, void *, unsigned int);
553 extern int write(int, const void *, unsigned int);
554 extern long lseek(int, long, int);
555 #endif /* BEN_HACK */
559 * The Macintosh is a little bit brain-dead sometimes
562 # define open(N,F,M) \
563 ((M), open((char*)(N),F))
564 # define write(F,B,S) \
565 write(F,(char*)(B),S)
566 #endif /* MACINTOSH */
570 * Several systems have no "O_BINARY" flag
574 #endif /* O_BINARY */
578 * Hack -- attempt to delete a file
580 errr fd_kill(cptr file)
584 /* Hack -- Try to parse the path */
585 if (path_parse(buf, 1024, file)) return (-1);
596 * Hack -- attempt to move a file
598 errr fd_move(cptr file, cptr what)
603 /* Hack -- Try to parse the path */
604 if (path_parse(buf, 1024, file)) return (-1);
606 /* Hack -- Try to parse the path */
607 if (path_parse(aux, 1024, what)) return (-1);
610 (void)rename(buf, aux);
618 * Hack -- attempt to copy a file
620 errr fd_copy(cptr file, cptr what)
627 /* Hack -- Try to parse the path */
628 if (path_parse(buf, 1024, file)) return (-1);
630 /* Hack -- Try to parse the path */
631 if (path_parse(aux, 1024, what)) return (-1);
633 /* Open source file */
634 src_fd = fd_open(buf, O_RDONLY);
635 if (src_fd < 0) return (-1);
637 /* Open destination file */
638 dst_fd = fd_open(aux, O_WRONLY|O_TRUNC|O_CREAT);
639 if (dst_fd < 0) return (-1);
642 while ((read_num = read(src_fd, buf, 1024)) > 0)
644 write(dst_fd, buf, read_num);
657 * Hack -- attempt to open a file descriptor (create file)
659 * This function should fail if the file already exists
661 * Note that we assume that the file should be "binary"
663 * XXX XXX XXX The horrible "BEN_HACK" code is for compiling under
664 * the CodeWarrior compiler, in which case, for some reason, none
665 * of the "O_*" flags are defined, and we must fake the definition
666 * of "O_RDONLY", "O_WRONLY", and "O_RDWR" in "A-win-h", and then
667 * we must simulate the effect of the proper "open()" call below.
669 int fd_make(cptr file, int mode)
673 /* Hack -- Try to parse the path */
674 if (path_parse(buf, 1024, file)) return (-1);
678 /* Check for existance */
679 /* if (fd_close(fd_open(file, O_RDONLY | O_BINARY))) return (1); */
681 /* Mega-Hack -- Create the file */
682 (void)my_fclose(my_fopen(file, "wb"));
684 /* Re-open the file for writing */
685 return (open(buf, O_WRONLY | O_BINARY, mode));
689 # if defined(MACINTOSH) && defined(MAC_MPW)
691 /* setting file type and creator -- AR */
694 errr_tmp = open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode);
695 fsetfileinfo(file, _fcreator, _ftype);
700 /* Create the file, fail if exists, write-only, binary */
701 return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
704 #endif /* BEN_HACK */
710 * Hack -- attempt to open a file descriptor (existing file)
712 * Note that we assume that the file should be "binary"
714 int fd_open(cptr file, int flags)
718 /* Hack -- Try to parse the path */
719 if (path_parse(buf, 1024, file)) return (-1);
721 /* Attempt to open the file */
722 return (open(buf, flags | O_BINARY, 0));
727 * Hack -- attempt to lock a file descriptor
729 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
731 errr fd_lock(int fd, int what)
734 what = what ? what : 0;
737 if (fd < 0) return (-1);
743 # if defined(F_ULOCK) && defined(F_LOCK)
748 /* Unlock it, Ignore errors */
749 lockf(fd, F_ULOCK, 0);
755 /* Lock the score file */
756 if (lockf(fd, F_LOCK, 0) != 0) return (1);
763 # if defined(LOCK_UN) && defined(LOCK_EX)
768 /* Unlock it, Ignore errors */
769 (void)flock(fd, LOCK_UN);
775 /* Lock the score file */
776 if (flock(fd, LOCK_EX) != 0) return (1);
791 * Hack -- attempt to seek on a file descriptor
793 errr fd_seek(int fd, huge n)
798 if (fd < 0) return (-1);
800 /* Seek to the given position */
801 p = lseek(fd, n, SEEK_SET);
804 if (p != n) return (1);
812 * Hack -- attempt to truncate a file descriptor
814 errr fd_chop(int fd, huge n)
820 if (fd < 0) return (-1);
822 #if defined(SUNOS) || defined(ULTRIX) || defined(NeXT)
833 * Hack -- attempt to read data from a file descriptor
835 errr fd_read(int fd, char *buf, huge n)
838 if (fd < 0) return (-1);
846 if (read(fd, buf, 16384) != 16384) return (1);
848 /* Shorten the task */
851 /* Shorten the task */
857 /* Read the final piece */
858 if (read(fd, buf, n) != (int)n) return (1);
866 * Hack -- Attempt to write data to a file descriptor
868 errr fd_write(int fd, cptr buf, huge n)
871 if (fd < 0) return (-1);
879 if (write(fd, buf, 16384) != 16384) return (1);
881 /* Shorten the task */
884 /* Shorten the task */
890 /* Write the final piece */
891 if (write(fd, buf, n) != (int)n) return (1);
899 * Hack -- attempt to close a file descriptor
901 errr fd_close(int fd)
904 if (fd < 0) return (-1);
920 * XXX XXX XXX Important note about "colors" XXX XXX XXX
922 * The "TERM_*" color definitions list the "composition" of each
923 * "Angband color" in terms of "quarters" of each of the three color
924 * components (Red, Green, Blue), for example, TERM_UMBER is defined
925 * as 2/4 Red, 1/4 Green, 0/4 Blue.
927 * The following info is from "Torbjorn Lindgren" (see "main-xaw.c").
929 * These values are NOT gamma-corrected. On most machines (with the
930 * Macintosh being an important exception), you must "gamma-correct"
931 * the given values, that is, "correct for the intrinsic non-linearity
932 * of the phosphor", by converting the given intensity levels based
933 * on the "gamma" of the target screen, which is usually 1.7 (or 1.5).
935 * The actual formula for conversion is unknown to me at this time,
936 * but you can use the table below for the most common gamma values.
938 * So, on most machines, simply convert the values based on the "gamma"
939 * of the target screen, which is usually in the range 1.5 to 1.7, and
940 * usually is closest to 1.7. The converted value for each of the five
941 * different "quarter" values is given below:
943 * Given Gamma 1.0 Gamma 1.5 Gamma 1.7 Hex 1.7
944 * ----- ---- ---- ---- ---
945 * 0/4 0.00 0.00 0.00 #00
946 * 1/4 0.25 0.27 0.28 #47
947 * 2/4 0.50 0.55 0.56 #8f
948 * 3/4 0.75 0.82 0.84 #d7
949 * 4/4 1.00 1.00 1.00 #ff
951 * Note that some machines (i.e. most IBM machines) are limited to a
952 * hard-coded set of colors, and so the information above is useless.
954 * Also, some machines are limited to a pre-determined set of colors,
955 * for example, the IBM can only display 16 colors, and only 14 of
956 * those colors resemble colors used by Angband, and then only when
957 * you ignore the fact that "Slate" and "cyan" are not really matches,
958 * so on the IBM, we use "orange" for both "Umber", and "Light Umber"
959 * in addition to the obvious "Orange", since by combining all of the
960 * "indeterminate" colors into a single color, the rest of the colors
961 * are left with "meaningful" values.
968 void move_cursor(int row, int col)
970 Term_gotoxy(col, row);
976 * Convert a decimal to a single digit octal number
978 static char octify(uint i)
980 return (hexsym[i%8]);
984 * Convert a decimal to a single digit hex number
986 static char hexify(uint i)
988 return (hexsym[i%16]);
993 * Convert a octal-digit into a decimal
995 static int deoct(char c)
997 if (isdigit(c)) return (D2I(c));
1002 * Convert a hexidecimal-digit into a decimal
1004 static int dehex(char c)
1006 if (isdigit(c)) return (D2I(c));
1007 if (islower(c)) return (A2I(c) + 10);
1008 if (isupper(c)) return (A2I(tolower(c)) + 10);
1013 static int my_stricmp(cptr a, cptr b)
1018 /* Scan the strings */
1019 for (s1 = a, s2 = b; TRUE; s1++, s2++)
1021 z1 = FORCEUPPER(*s1);
1022 z2 = FORCEUPPER(*s2);
1023 if (z1 < z2) return (-1);
1024 if (z1 > z2) return (1);
1025 if (!z1) return (0);
1029 static int my_strnicmp(cptr a, cptr b, int n)
1034 /* Scan the strings */
1035 for (s1 = a, s2 = b; n > 0; s1++, s2++, n--)
1037 z1 = FORCEUPPER(*s1);
1038 z2 = FORCEUPPER(*s2);
1039 if (z1 < z2) return (-1);
1040 if (z1 > z2) return (1);
1041 if (!z1) return (0);
1047 static void trigger_text_to_ascii(char **bufptr, cptr *strptr)
1051 bool mod_status[MAX_MACRO_MOD];
1054 int shiftstatus = 0;
1057 if (macro_template == NULL)
1060 for (i = 0; macro_modifier_chr[i]; i++)
1061 mod_status[i] = FALSE;
1064 /* Examine modifier keys */
1067 for (i=0; macro_modifier_chr[i]; i++)
1069 len = strlen(macro_modifier_name[i]);
1071 if(!my_strnicmp(str, macro_modifier_name[i], len))
1074 if (!macro_modifier_chr[i]) break;
1076 mod_status[i] = TRUE;
1077 if ('S' == macro_modifier_chr[i])
1080 for (i = 0; i < max_macrotrigger; i++)
1082 len = strlen(macro_trigger_name[i]);
1083 if (!my_strnicmp(str, macro_trigger_name[i], len) && ']' == str[len])
1085 /* a trigger name found */
1090 /* Invalid trigger name? */
1091 if (i == max_macrotrigger)
1093 str = strchr(str, ']');
1099 *strptr = str; /* where **strptr == ']' */
1103 key_code = macro_trigger_keycode[shiftstatus][i];
1107 for (i = 0; macro_template[i]; i++)
1109 char ch = macro_template[i];
1115 for (j = 0; macro_modifier_chr[j]; j++) {
1117 *s++ = macro_modifier_chr[j];
1121 strcpy(s, key_code);
1122 s += strlen(key_code);
1132 *strptr = str; /* where **strptr == ']' */
1138 * Hack -- convert a printable string into real ascii
1140 * I have no clue if this function correctly handles, for example,
1141 * parsing "\xFF" into a (signed) char. Whoever thought of making
1142 * the "sign" of a "char" undefined is a complete moron. Oh well.
1144 void text_to_ascii(char *buf, cptr str)
1148 /* Analyze the "ascii" string */
1151 /* Backslash codes */
1154 /* Skip the backslash */
1163 trigger_text_to_ascii(&s, &str);
1170 *s = 16 * dehex(*++str);
1171 *s++ += dehex(*++str);
1174 /* Hack -- simple way to specify "backslash" */
1175 else if (*str == '\\')
1180 /* Hack -- simple way to specify "caret" */
1181 else if (*str == '^')
1186 /* Hack -- simple way to specify "space" */
1187 else if (*str == 's')
1192 /* Hack -- simple way to specify Escape */
1193 else if (*str == 'e')
1199 else if (*str == 'b')
1205 else if (*str == 'n')
1211 else if (*str == 'r')
1217 else if (*str == 't')
1223 else if (*str == '0')
1225 *s = 8 * deoct(*++str);
1226 *s++ += deoct(*++str);
1230 else if (*str == '1')
1232 *s = 64 + 8 * deoct(*++str);
1233 *s++ += deoct(*++str);
1237 else if (*str == '2')
1239 *s = 64 * 2 + 8 * deoct(*++str);
1240 *s++ += deoct(*++str);
1244 else if (*str == '3')
1246 *s = 64 * 3 + 8 * deoct(*++str);
1247 *s++ += deoct(*++str);
1250 /* Skip the final char */
1254 /* Normal Control codes */
1255 else if (*str == '^')
1258 *s++ = (*str++ & 037);
1273 static bool trigger_ascii_to_text(char **bufptr, cptr *strptr)
1281 if (macro_template == NULL)
1287 for (i = 0; macro_template[i]; i++)
1290 char ch = macro_template[i];
1295 while ((tmp = strchr(macro_modifier_chr, *str)))
1297 j = (int)(tmp - macro_modifier_chr);
1298 tmp = macro_modifier_name[j];
1299 while(*tmp) *s++ = *tmp++;
1304 for (j = 0; *str && *str != '\r'; j++)
1305 key_code[j] = *str++;
1309 if (ch != *str) return FALSE;
1313 if (*str++ != '\r') return FALSE;
1315 for (i = 0; i < max_macrotrigger; i++)
1317 if (!my_stricmp(key_code, macro_trigger_keycode[0][i])
1318 || !my_stricmp(key_code, macro_trigger_keycode[1][i]))
1321 if (i == max_macrotrigger)
1324 tmp = macro_trigger_name[i];
1325 while (*tmp) *s++ = *tmp++;
1336 * Hack -- convert a string into a printable form
1338 void ascii_to_text(char *buf, cptr str)
1342 /* Analyze the "ascii" string */
1345 byte i = (byte)(*str++);
1350 if(!trigger_ascii_to_text(&s, &str))
1411 *s++ = octify(i / 8);
1412 *s++ = octify(i % 8);
1418 *s++ = hexify(i / 16);
1419 *s++ = hexify(i % 16);
1430 * The "macro" package
1432 * Functions are provided to manipulate a collection of macros, each
1433 * of which has a trigger pattern string and a resulting action string
1434 * and a small set of flags.
1440 * Determine if any macros have ever started with a given character.
1442 static bool macro__use[256];
1446 * Find the macro (if any) which exactly matches the given pattern
1448 sint macro_find_exact(cptr pat)
1452 /* Nothing possible */
1453 if (!macro__use[(byte)(pat[0])])
1458 /* Scan the macros */
1459 for (i = 0; i < macro__num; ++i)
1461 /* Skip macros which do not match the pattern */
1462 if (!streq(macro__pat[i], pat)) continue;
1474 * Find the first macro (if any) which contains the given pattern
1476 static sint macro_find_check(cptr pat)
1480 /* Nothing possible */
1481 if (!macro__use[(byte)(pat[0])])
1486 /* Scan the macros */
1487 for (i = 0; i < macro__num; ++i)
1489 /* Skip macros which do not contain the pattern */
1490 if (!prefix(macro__pat[i], pat)) continue;
1502 * Find the first macro (if any) which contains the given pattern and more
1504 static sint macro_find_maybe(cptr pat)
1508 /* Nothing possible */
1509 if (!macro__use[(byte)(pat[0])])
1514 /* Scan the macros */
1515 for (i = 0; i < macro__num; ++i)
1517 /* Skip macros which do not contain the pattern */
1518 if (!prefix(macro__pat[i], pat)) continue;
1520 /* Skip macros which exactly match the pattern XXX XXX */
1521 if (streq(macro__pat[i], pat)) continue;
1533 * Find the longest macro (if any) which starts with the given pattern
1535 static sint macro_find_ready(cptr pat)
1537 int i, t, n = -1, s = -1;
1539 /* Nothing possible */
1540 if (!macro__use[(byte)(pat[0])])
1545 /* Scan the macros */
1546 for (i = 0; i < macro__num; ++i)
1548 /* Skip macros which are not contained by the pattern */
1549 if (!prefix(pat, macro__pat[i])) continue;
1551 /* Obtain the length of this macro */
1552 t = strlen(macro__pat[i]);
1554 /* Only track the "longest" pattern */
1555 if ((n >= 0) && (s > t)) continue;
1557 /* Track the entry */
1568 * Add a macro definition (or redefinition).
1570 * We should use "act == NULL" to "remove" a macro, but this might make it
1571 * impossible to save the "removal" of a macro definition. XXX XXX XXX
1573 * We should consider refusing to allow macros which contain existing macros,
1574 * or which are contained in existing macros, because this would simplify the
1575 * macro analysis code. XXX XXX XXX
1577 * We should consider removing the "command macro" crap, and replacing it
1578 * with some kind of "powerful keymap" ability, but this might make it hard
1579 * to change the "roguelike" option from inside the game. XXX XXX XXX
1581 errr macro_add(cptr pat, cptr act)
1586 /* Paranoia -- require data */
1587 if (!pat || !act) return (-1);
1590 /* Look for any existing macro */
1591 n = macro_find_exact(pat);
1593 /* Replace existing macro */
1596 /* Free the old macro action */
1597 string_free(macro__act[n]);
1600 /* Create a new macro */
1603 /* Acquire a new index */
1606 /* Save the pattern */
1607 macro__pat[n] = string_make(pat);
1610 /* Save the action */
1611 macro__act[n] = string_make(act);
1614 macro__use[(byte)(pat[0])] = TRUE;
1623 * Local variable -- we are inside a "macro action"
1625 * Do not match any macros until "ascii 30" is found.
1627 static bool parse_macro = FALSE;
1630 * Local variable -- we are inside a "macro trigger"
1632 * Strip all keypresses until a low ascii value is found.
1634 static bool parse_under = FALSE;
1638 * Flush all input chars. Actually, remember the flush,
1639 * and do a "special flush" before the next "inkey()".
1641 * This is not only more efficient, but also necessary to make sure
1642 * that various "inkey()" codes are not "lost" along the way.
1652 * Flush the screen, make a noise
1656 /* Mega-Hack -- Flush the output */
1659 /* Make a bell noise (if allowed) */
1660 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1662 /* Flush the input (later!) */
1668 * Hack -- Make a (relevant?) sound
1673 if (!use_sound) return;
1675 /* Make a sound (if allowed) */
1676 Term_xtra(TERM_XTRA_SOUND, val);
1682 * Helper function called only from "inkey()"
1684 * This function does almost all of the "macro" processing.
1686 * We use the "Term_key_push()" function to handle "failed" macros, as well
1687 * as "extra" keys read in while choosing the proper macro, and also to hold
1688 * the action for the macro, plus a special "ascii 30" character indicating
1689 * that any macro action in progress is complete. Embedded macros are thus
1690 * illegal, unless a macro action includes an explicit "ascii 30" character,
1691 * which would probably be a massive hack, and might break things.
1693 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1694 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1695 * macro trigger, 500 milliseconds must pass before the key sequence is
1696 * known not to be that macro trigger. XXX XXX XXX
1698 static char inkey_aux(void)
1700 int k = 0, n, p = 0, w = 0;
1708 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£ */
1713 /* Scan next keypress from macro action */
1714 if (Term_inkey(&ch, FALSE, TRUE))
1716 /* Over-flowed? Cancel macro action */
1717 parse_macro = FALSE;
1722 /* Wait for a keypress */
1723 (void) (Term_inkey(&ch, TRUE, TRUE));
1727 /* End "macro action" */
1728 if (ch == 30) parse_macro = FALSE;
1730 /* Inside "macro action" */
1731 if (ch == 30) return (ch);
1733 /* Inside "macro action" */
1734 if (parse_macro) return (ch);
1736 /* Inside "macro trigger" */
1737 if (parse_under) return (ch);
1739 /* Parse special key only */
1740 if (inkey_special && ch != 31) return (ch);
1742 /* Save the first key, advance */
1747 /* Check for possible macro */
1748 k = macro_find_check(buf);
1750 /* No macro pending */
1751 if (k < 0) return (ch);
1754 /* Wait for a macro, or a timeout */
1757 /* Check for pending macro */
1758 k = macro_find_maybe(buf);
1760 /* No macro pending */
1763 /* Check for (and remove) a pending key */
1764 if (0 == Term_inkey(&ch, FALSE, TRUE))
1766 /* Append the key */
1777 /* Increase "wait" */
1780 /* Excessive delay */
1781 if (w >= 100) break;
1784 Term_xtra(TERM_XTRA_DELAY, w);
1789 /* Check for available macro */
1790 k = macro_find_ready(buf);
1792 /* No macro available */
1795 /* Push all the keys back on the queue */
1798 /* Push the key, notice over-flow */
1799 if (Term_key_push(buf[--p])) return (0);
1802 /* Wait for (and remove) a pending key */
1803 (void)Term_inkey(&ch, TRUE, TRUE);
1805 /* Return the key */
1810 /* Get the pattern */
1811 pat = macro__pat[k];
1813 /* Get the length of the pattern */
1816 /* Push the "extra" keys back on the queue */
1819 /* Push the key, notice over-flow */
1820 if (Term_key_push(buf[--p])) return (0);
1824 /* Begin "macro action" */
1827 /* Push the "end of macro action" key */
1828 if (Term_key_push(30)) return (0);
1831 /* Access the macro action */
1832 act = macro__act[k];
1834 /* Get the length of the action */
1837 /* Push the macro "action" onto the key queue */
1840 /* Push the key, notice over-flow */
1841 if (Term_key_push(act[--n])) return (0);
1845 /* Hack -- Force "inkey()" to call us again */
1851 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1853 * This special pointer allows a sequence of keys to be "inserted" into
1854 * the stream of keys returned by "inkey()". This key sequence will not
1855 * trigger any macros, and cannot be bypassed by the Borg. It is used
1856 * in Angband to handle "keymaps".
1858 static cptr inkey_next = NULL;
1864 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1866 * This special function hook allows the "Borg" (see elsewhere) to take
1867 * control of the "inkey()" function, and substitute in fake keypresses.
1869 char (*inkey_hack)(int flush_first) = NULL;
1871 #endif /* ALLOW_BORG */
1876 * Get a keypress from the user.
1878 * This function recognizes a few "global parameters". These are variables
1879 * which, if set to TRUE before calling this function, will have an effect
1880 * on this function, and which are always reset to FALSE by this function
1881 * before this function returns. Thus they function just like normal
1882 * parameters, except that most calls to this function can ignore them.
1884 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1885 * and any macro processing in progress will be aborted. This flag is
1886 * set by the "flush()" function, which does not actually flush anything
1887 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1889 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1890 * keypress is available, instead of waiting for a keypress.
1892 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1893 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1894 * not return immediately, but will wait for a keypress for as long as the
1895 * normal macro matching code would, allowing the direct entry of macro
1896 * triggers. The "inkey_base" flag is extremely dangerous!
1898 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1899 * normal command, and we will only show the cursor if "hilite_player" is
1900 * TRUE (or if the player is in a store), instead of always showing the
1901 * cursor. The various "main-xxx.c" files should avoid saving the game
1902 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1903 * prevent savefile corruption.
1905 * If we are waiting for a keypress, and no keypress is ready, then we will
1906 * refresh (once) the window which was active when this function was called.
1908 * Note that "back-quote" is automatically converted into "escape" for
1909 * convenience on machines with no "escape" key. This is done after the
1910 * macro matching, so the user can still make a macro for "backquote".
1912 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1913 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1914 * provide support for simple keyboard "macros". These keys are so strange
1915 * that their loss as normal keys will probably be noticed by nobody. The
1916 * "ascii 30" key is used to indicate the "end" of a macro action, which
1917 * allows recursive macros to be avoided. The "ascii 31" key is used by
1918 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1920 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1921 * which can be used to give a variety of "sub-commands" which can be used
1922 * any time. These sub-commands could include commands to take a picture of
1923 * the current screen, to start/stop recording a macro action, etc.
1925 * If "angband_term[0]" is not active, we will make it active during this
1926 * function, so that the various "main-xxx.c" files can assume that input
1927 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1929 * Mega-Hack -- This function is used as the entry point for clearing the
1930 * "signal_count" variable, and of the "character_saved" variable.
1932 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1934 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1935 * control of the keyboard from the user.
1945 /* Hack -- Use the "inkey_next" pointer */
1946 if (inkey_next && *inkey_next && !inkey_xtra)
1948 /* Get next character, and advance */
1951 /* Cancel the various "global parameters" */
1952 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
1958 /* Forget pointer */
1964 /* Mega-Hack -- Use the special hook */
1965 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1967 /* Cancel the various "global parameters" */
1968 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
1974 #endif /* ALLOW_BORG */
1977 /* Hack -- handle delayed "flush()" */
1980 /* End "macro action" */
1981 parse_macro = FALSE;
1983 /* End "macro trigger" */
1984 parse_under = FALSE;
1986 /* Forget old keypresses */
1991 /* Access cursor state */
1992 (void)Term_get_cursor(&v);
1994 /* Show the cursor if waiting, except sometimes in "command" mode */
1995 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1997 /* Show the cursor */
1998 (void)Term_set_cursor(1);
2002 /* Hack -- Activate main screen */
2003 Term_activate(angband_term[0]);
2009 /* Hack -- Handle "inkey_scan" */
2010 if (!inkey_base && inkey_scan &&
2011 (0 != Term_inkey(&kk, FALSE, FALSE)))
2017 /* Hack -- Flush output once when no key ready */
2018 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
2020 /* Hack -- activate proper term */
2026 /* Hack -- activate main screen */
2027 Term_activate(angband_term[0]);
2029 /* Mega-Hack -- reset saved flag */
2030 character_saved = FALSE;
2032 /* Mega-Hack -- reset signal counter */
2040 /* Hack -- Handle "inkey_base" */
2048 /* Wait for (and remove) a pending key */
2049 if (0 == Term_inkey(&ch, TRUE, TRUE))
2062 /* Check for (and remove) a pending key */
2063 if (0 == Term_inkey(&ch, FALSE, TRUE))
2072 /* Increase "wait" */
2075 /* Excessive delay */
2076 if (w >= 100) break;
2079 Term_xtra(TERM_XTRA_DELAY, w);
2088 /* Get a key (see above) */
2092 /* Handle "control-right-bracket" */
2095 /* Strip this key */
2103 /* Treat back-quote as escape */
2104 /* if (ch == '`') ch = ESCAPE; */
2107 /* End "macro trigger" */
2108 if (parse_under && (ch <= 32))
2110 /* Strip this key */
2113 /* End "macro trigger" */
2114 parse_under = FALSE;
2118 /* Handle "control-caret" */
2121 /* Strip this key */
2125 /* Handle "control-underscore" */
2128 /* Strip this key */
2131 /* Begin "macro trigger" */
2135 /* Inside "macro trigger" */
2136 else if (parse_under)
2138 /* Strip this key */
2144 /* Hack -- restore the term */
2148 /* Restore the cursor */
2152 /* Cancel the various "global parameters" */
2153 inkey_base = inkey_xtra = inkey_flag = inkey_scan = inkey_special = FALSE;
2155 /* Return the keypress */
2163 * We use a global array for all inscriptions to reduce the memory
2164 * spent maintaining inscriptions. Of course, it is still possible
2165 * to run out of inscription memory, especially if too many different
2166 * inscriptions are used, but hopefully this will be rare.
2168 * We use dynamic string allocation because otherwise it is necessary
2169 * to pre-guess the amount of quark activity. We limit the total
2170 * number of quarks, but this is much easier to "expand" as needed.
2172 * Any two items with the same inscription will have the same "quark"
2173 * index, which should greatly reduce the need for inscription space.
2175 * Note that "quark zero" is NULL and should not be "dereferenced".
2179 * Add a new "quark" to the set of quarks.
2181 s16b quark_add(cptr str)
2185 /* Look for an existing quark */
2186 for (i = 1; i < quark__num; i++)
2188 /* Check for equality */
2189 if (streq(quark__str[i], str)) return (i);
2192 /* Paranoia -- Require room */
2193 if (quark__num == QUARK_MAX) return (0);
2195 /* New maximal quark */
2198 /* Add a new quark */
2199 quark__str[i] = string_make(str);
2201 /* Return the index */
2207 * This function looks up a quark
2209 cptr quark_str(s16b i)
2214 if ((i < 0) || (i >= quark__num)) i = 0;
2216 /* Access the quark */
2219 /* Return the quark */
2227 * Second try for the "message" handling routines.
2229 * Each call to "message_add(s)" will add a new "most recent" message
2230 * to the "message recall list", using the contents of the string "s".
2232 * The messages will be stored in such a way as to maximize "efficiency",
2233 * that is, we attempt to maximize the number of sequential messages that
2234 * can be retrieved, given a limited amount of storage space.
2236 * We keep a buffer of chars to hold the "text" of the messages, not
2237 * necessarily in "order", and an array of offsets into that buffer,
2238 * representing the actual messages. This is made more complicated
2239 * by the fact that both the array of indexes, and the buffer itself,
2240 * are both treated as "circular arrays" for efficiency purposes, but
2241 * the strings may not be "broken" across the ends of the array.
2243 * The "message_add()" function is rather "complex", because it must be
2244 * extremely efficient, both in space and time, for use with the Borg.
2250 * How many messages are "available"?
2252 s16b message_num(void)
2256 /* Extract the indexes */
2257 last = message__last;
2258 next = message__next;
2261 if (next < last) next += MESSAGE_MAX;
2263 /* Extract the space */
2266 /* Return the result */
2273 * Recall the "text" of a saved message
2275 cptr message_str(int age)
2281 /* Forgotten messages have no text */
2282 if ((age < 0) || (age >= message_num())) return ("");
2284 /* Acquire the "logical" index */
2285 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2287 /* Get the "offset" for the message */
2288 o = message__ptr[x];
2290 /* Access the message text */
2291 s = &message__buf[o];
2293 /* Return the message text */
2300 * Add a new message, with great efficiency
2302 void message_add(cptr str)
2310 /*** Step 1 -- Analyze the message ***/
2312 /* Hack -- Ignore "non-messages" */
2315 /* Message length */
2318 /* Important Hack -- Ignore "long" messages */
2319 if (n >= MESSAGE_BUF / 4) return;
2321 /* extra step -- split the message if n>80. (added by Mogami) */
2326 for (n = 0; n < 80; n++, t++)
2331 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2333 for (n = 80; n > 60; n--)
2334 if (str[n] == ' ') break;
2338 splitted2 = str + n;
2339 strncpy(splitted1, str ,n);
2340 splitted1[n] = '\0';
2346 /*** Step 2 -- Attempt to optimize ***/
2348 /* Limit number of messages to check */
2353 /* Limit number of messages to check */
2354 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2356 /* Check previous message */
2357 for (i = message__next; m; m--)
2366 /* Back up and wrap if needed */
2367 if (i-- == 0) i = MESSAGE_MAX - 1;
2369 /* Access the old string */
2370 old = &message__buf[message__ptr[i]];
2372 /* Skip small messages */
2379 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2380 if( iskanji(*t))t++;
2382 for (t = buf; *t && (*t != '<'); t++);
2387 /* Message is too small */
2388 if (strlen(buf) < 6) break;
2390 /* Drop the space */
2393 /* Get multiplier */
2397 /* Limit the multiplier to 1000 */
2398 if (buf && streq(buf, str) && (j < 1000))
2408 sprintf(u, "%s <x%d>", buf, j);
2410 /* Message length */
2413 if (!now_message) now_message++;
2417 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
2425 /* Check the last few messages (if any to count) */
2426 for (i = message__next; k; k--)
2432 /* Back up and wrap if needed */
2433 if (i-- == 0) i = MESSAGE_MAX - 1;
2435 /* Stop before oldest message */
2436 if (i == message__last) break;
2438 /* Extract "distance" from "head" */
2439 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2441 /* Do not optimize over large distance */
2442 if (q > MESSAGE_BUF / 2) continue;
2444 /* Access the old string */
2445 old = &message__buf[message__ptr[i]];
2448 if (!streq(old, str)) continue;
2450 /* Get the next message index, advance */
2451 x = message__next++;
2454 if (message__next == MESSAGE_MAX) message__next = 0;
2456 /* Kill last message if needed */
2457 if (message__next == message__last) message__last++;
2460 if (message__last == MESSAGE_MAX) message__last = 0;
2462 /* Assign the starting address */
2463 message__ptr[x] = message__ptr[i];
2467 goto end_of_message_add;
2472 /*** Step 3 -- Ensure space before end of buffer ***/
2474 /* Kill messages and Wrap if needed */
2475 if (message__head + n + 1 >= MESSAGE_BUF)
2477 /* Kill all "dead" messages */
2478 for (i = message__last; TRUE; i++)
2480 /* Wrap if needed */
2481 if (i == MESSAGE_MAX) i = 0;
2483 /* Stop before the new message */
2484 if (i == message__next) break;
2486 /* Kill "dead" messages */
2487 if (message__ptr[i] >= message__head)
2489 /* Track oldest message */
2490 message__last = i + 1;
2494 /* Wrap "tail" if needed */
2495 if (message__tail >= message__head) message__tail = 0;
2502 /*** Step 4 -- Ensure space before next message ***/
2504 /* Kill messages if needed */
2505 if (message__head + n + 1 > message__tail)
2507 /* Grab new "tail" */
2508 message__tail = message__head + n + 1;
2510 /* Advance tail while possible past first "nul" */
2511 while (message__buf[message__tail-1]) message__tail++;
2513 /* Kill all "dead" messages */
2514 for (i = message__last; TRUE; i++)
2516 /* Wrap if needed */
2517 if (i == MESSAGE_MAX) i = 0;
2519 /* Stop before the new message */
2520 if (i == message__next) break;
2522 /* Kill "dead" messages */
2523 if ((message__ptr[i] >= message__head) &&
2524 (message__ptr[i] < message__tail))
2526 /* Track oldest message */
2527 message__last = i + 1;
2533 /*** Step 5 -- Grab a new message index ***/
2535 /* Get the next message index, advance */
2536 x = message__next++;
2539 if (message__next == MESSAGE_MAX) message__next = 0;
2541 /* Kill last message if needed */
2542 if (message__next == message__last) message__last++;
2545 if (message__last == MESSAGE_MAX) message__last = 0;
2549 /*** Step 6 -- Insert the message text ***/
2551 /* Assign the starting address */
2552 message__ptr[x] = message__head;
2554 /* Append the new part of the message */
2555 for (i = 0; i < n; i++)
2557 /* Copy the message */
2558 message__buf[message__head + i] = str[i];
2562 message__buf[message__head + i] = '\0';
2564 /* Advance the "head" pointer */
2565 message__head += n + 1;
2567 /* recursively add splitted message (added by Mogami) */
2569 if (splitted2 != NULL)
2570 message_add(splitted2);
2578 static void msg_flush(int x)
2580 byte a = TERM_L_BLUE;
2581 bool nagasu = FALSE;
2583 if ((auto_more && !now_damaged) || num_more < 0){
2585 for (i = 0; i < 8; i++)
2587 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2591 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2598 now_damaged = FALSE;
2600 if (!p_ptr->playing || !nagasu)
2602 /* Pause for response */
2604 Term_putstr(x, 0, -1, a, "-³¤¯-");
2606 Term_putstr(x, 0, -1, a, "-more-");
2610 /* Get an acceptable keypress */
2614 if (cmd == ESCAPE) {
2615 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£ */
2617 } else if (cmd == ' ') {
2618 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
2620 } else if ((cmd == '\n') || (cmd == '\r')) {
2621 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
2624 if (quick_messages) break;
2629 /* Clear the line */
2630 Term_erase(0, 0, 255);
2635 * Output a message to the top line of the screen.
2637 * Break long messages into multiple pieces (40-72 chars).
2639 * Allow multiple short messages to "share" the top line.
2641 * Prompt the user to make sure he has a chance to read them.
2643 * These messages are memorized for later reference (see above).
2645 * We could do "Term_fresh()" to provide "flicker" if needed.
2647 * The global "msg_flag" variable can be cleared to tell us to
2648 * "erase" any "pending" messages still on the screen.
2650 * XXX XXX XXX Note that we must be very careful about using the
2651 * "msg_print()" functions without explicitly calling the special
2652 * "msg_print(NULL)" function, since this may result in the loss
2653 * of information if the screen is cleared, or if anything is
2654 * displayed on the top line.
2656 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2657 * even if no messages are pending. This is probably a hack.
2659 void msg_print(cptr msg)
2669 if (world_monster) return;
2673 /* Clear the line */
2674 Term_erase(0, 0, 255);
2678 /* Message Length */
2679 n = (msg ? strlen(msg) : 0);
2681 /* Hack -- flush when requested or needed */
2682 if (p && (!msg || ((p + n) > 72)))
2699 if (n > 1000) return;
2702 /* Memorize the message */
2703 if (character_generated) message_add(msg);
2709 /* Analyze the buffer */
2716 int check, split = 72;
2719 bool k_flag = FALSE;
2722 /* Find the "best" split point */
2723 for (check = 0; check < 72; check++)
2731 /* Found a valid split point */
2732 if (iskanji(t[check]))
2737 else if (t[check] == ' ')
2750 /* Find the "best" split point */
2751 for (check = 40; check < 72; check++)
2753 /* Found a valid split point */
2754 if (t[check] == ' ') split = check;
2758 /* Save the split character */
2761 /* Split the message */
2764 /* Display part of the message */
2765 Term_putstr(0, 0, split, TERM_WHITE, t);
2768 msg_flush(split + 1);
2770 /* Memorize the piece */
2771 /* if (character_generated) message_add(t); */
2773 /* Restore the split character */
2776 /* Insert a space */
2779 /* Prepare to recurse on the rest of "buf" */
2780 t += split; n -= split;
2784 /* Display the tail of the message */
2785 Term_putstr(p, 0, n, TERM_WHITE, t);
2787 /* Memorize the tail */
2788 /* if (character_generated) message_add(t); */
2791 p_ptr->window |= (PW_MESSAGE);
2794 /* Remember the message */
2797 /* Remember the position */
2805 /* Optional refresh */
2806 if (fresh_message) Term_fresh();
2811 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2813 static int screen_depth = 0;
2817 * Save the screen, and increase the "icky" depth.
2819 * This function must match exactly one call to "screen_load()".
2821 void screen_save(void)
2823 /* Hack -- Flush messages */
2826 /* Save the screen (if legal) */
2827 if (screen_depth++ == 0) Term_save();
2829 /* Increase "icky" depth */
2835 * Load the screen, and decrease the "icky" depth.
2837 * This function must match exactly one call to "screen_save()".
2839 void screen_load(void)
2841 /* Hack -- Flush messages */
2844 /* Load the screen (if legal) */
2845 if (--screen_depth == 0) Term_load();
2847 /* Decrease "icky" depth */
2853 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2855 void msg_format(cptr fmt, ...)
2861 /* Begin the Varargs Stuff */
2864 /* Format the args, save the length */
2865 (void)vstrnfmt(buf, 1024, fmt, vp);
2867 /* End the Varargs Stuff */
2877 * Display a string on the screen using an attribute.
2879 * At the given location, using the given attribute, if allowed,
2880 * add the given string. Do not clear the line.
2882 void c_put_str(byte attr, cptr str, int row, int col)
2884 /* Position cursor, Dump the attr/text */
2885 Term_putstr(col, row, -1, attr, str);
2889 * As above, but in "white"
2891 void put_str(cptr str, int row, int col)
2894 Term_putstr(col, row, -1, TERM_WHITE, str);
2900 * Display a string on the screen using an attribute, and clear
2901 * to the end of the line.
2903 void c_prt(byte attr, cptr str, int row, int col)
2905 /* Clear line, position cursor */
2906 Term_erase(col, row, 255);
2908 /* Dump the attr/text */
2909 Term_addstr(-1, attr, str);
2913 * As above, but in "white"
2915 void prt(cptr str, int row, int col)
2918 c_prt(TERM_WHITE, str, row, col);
2925 * Print some (colored) text to the screen at the current cursor position,
2926 * automatically "wrapping" existing text (at spaces) when necessary to
2927 * avoid placing any text into the last column, and clearing every line
2928 * before placing any text in that line. Also, allow "newline" to force
2929 * a "wrap" to the next line. Advance the cursor as needed so sequential
2930 * calls to this function will work correctly.
2932 * Once this function has been called, the cursor should not be moved
2933 * until all the related "c_roff()" calls to the window are complete.
2935 * This function will correctly handle any width up to the maximum legal
2936 * value of 256, though it works best for a standard 80 character width.
2938 void c_roff(byte a, cptr str)
2946 /* Obtain the size */
2947 (void)Term_get_size(&w, &h);
2949 /* Obtain the cursor */
2950 (void)Term_locate(&x, &y);
2952 /* Hack -- No more space */
2953 if( y == h - 1 && x > w - 3) return;
2955 /* Process the string */
2956 for (s = str; *s; s++)
2961 int k_flag = iskanji(*s);
2973 /* Clear line, move cursor */
2974 Term_erase(x, y, 255);
2979 /* Clean up the char */
2981 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2983 ch = (isprint(*s) ? *s : ' ');
2987 /* Wrap words as needed */
2989 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2991 if ((x >= w - 1) && (ch != ' '))
3004 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
3008 /* Scan existing text */
3009 for (i = w - 2; i >= 0; i--)
3011 /* Grab existing attr/char */
3012 Term_what(i, y, &av[i], &cv[i]);
3014 /* Break on space */
3015 if (cv[i] == ' ') break;
3017 /* Track current word */
3020 if (cv[i] == '(') break;
3028 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
3029 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
3030 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
3031 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
3032 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
3035 Term_what(x , y, &av[x ], &cv[x ]);
3036 Term_what(x-1, y, &av[x-1], &cv[x-1]);
3037 Term_what(x-2, y, &av[x-2], &cv[x-2]);
3048 Term_erase(n, y, 255);
3057 /* Clear line, move cursor */
3058 Term_erase(x, y, 255);
3060 /* Wrap the word (if any) */
3061 for (i = n; i < w - 1; i++)
3064 if( cv[i] == '\0' ) break;
3067 Term_addch(av[i], cv[i]);
3069 /* Advance (no wrap) */
3076 Term_addch((byte)(a|0x10), ch);
3088 Term_addch((byte)(a|0x20), ch);
3097 * As above, but in "white"
3102 c_roff(TERM_WHITE, str);
3109 * Clear part of the screen
3111 void clear_from(int row)
3115 /* Erase requested rows */
3116 for (y = row; y < Term->hgt; y++)
3118 /* Erase part of the screen */
3119 Term_erase(0, y, 255);
3127 * Get some input at the cursor location.
3128 * Assume the buffer is initialized to a default string.
3129 * Note that this string is often "empty" (see below).
3130 * The default buffer is displayed in yellow until cleared.
3131 * Pressing RETURN right away accepts the default entry.
3132 * Normal chars clear the default and append the char.
3133 * Backspace clears the default or deletes the final char.
3134 * ESCAPE clears the buffer and the window and returns FALSE.
3135 * RETURN accepts the current buffer contents and returns TRUE.
3137 bool askfor_aux(char *buf, int len)
3151 /* Locate the cursor */
3152 Term_locate(&x, &y);
3155 /* Paranoia -- check len */
3156 if (len < 1) len = 1;
3158 /* Paranoia -- check column */
3159 if ((x < 0) || (x >= 80)) x = 0;
3161 /* Restrict the length */
3162 if (x + len > 80) len = 80 - x;
3165 /* Paranoia -- Clip the default entry */
3169 /* Display the default answer */
3170 Term_erase(x, y, len);
3171 Term_putstr(x, y, -1, TERM_YELLOW, buf);
3178 Term_gotoxy(x + k, y);
3183 /* Analyze the key */
3214 { /* ÊÒ»³¤µ¤óºîÀ® */
3228 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3230 if(k<len && isprint(i)){
3239 if ((k < len) && (isprint(i)))
3255 /* Update the entry */
3256 Term_erase(x, y, len);
3257 Term_putstr(x, y, -1, TERM_WHITE, buf);
3261 if (i == ESCAPE) return (FALSE);
3269 * Get a string from the user
3271 * The "prompt" should take the form "Prompt: "
3273 * Note that the initial contents of the string is used as
3274 * the default response, so be sure to "clear" it if needed.
3276 * We clear the input, and return FALSE, on "ESCAPE".
3278 bool get_string(cptr prompt, char *buf, int len)
3282 /* Paranoia XXX XXX XXX */
3285 /* Display prompt */
3288 /* Ask the user for a string */
3289 res = askfor_aux(buf, len);
3300 * Verify something with the user
3302 * The "prompt" should take the form "Query? "
3304 * Note that "[y/n]" is appended to the prompt.
3306 bool get_check(cptr prompt)
3308 return get_check_strict(prompt, 0);
3312 * Verify something with the user strictly
3314 * mode & CHECK_OKAY_CANCEL : force user to answer 'O'kay or 'C'ancel
3315 * mode & CHECK_NO_ESCAPE : don't allow ESCAPE key
3316 * mode & CHECK_NO_HISTORY : no message_add
3317 * mode & CHECK_DEFAULT_Y : accept any key as y, except n and Esc.
3319 bool get_check_strict(cptr prompt, int mode)
3327 p_ptr->window |= PW_MESSAGE;
3332 /* Paranoia XXX XXX XXX */
3335 if (!rogue_like_commands)
3336 mode &= ~CHECK_OKAY_CANCEL;
3339 /* Hack -- Build a "useful" prompt */
3340 if (mode & CHECK_OKAY_CANCEL)
3342 my_strcpy(buf, prompt, sizeof(buf)-15);
3343 strcat(buf, "[(O)k/(C)ancel]");
3345 else if (mode & CHECK_DEFAULT_Y)
3347 my_strcpy(buf, prompt, sizeof(buf)-5);
3348 strcat(buf, "[Y/n]");
3352 my_strcpy(buf, prompt, sizeof(buf)-5);
3353 strcat(buf, "[y/n]");
3359 if (!(mode & CHECK_NO_HISTORY) && p_ptr->playing)
3361 /* HACK : Add the line to message buffer */
3363 p_ptr->window |= (PW_MESSAGE);
3367 /* Get an acceptable answer */
3372 if (!(mode & CHECK_NO_ESCAPE))
3381 if (mode & CHECK_OKAY_CANCEL)
3383 if (i == 'o' || i == 'O')
3388 else if (i == 'c' || i == 'C')
3396 if (i == 'y' || i == 'Y')
3401 else if (i == 'n' || i == 'N')
3408 if (mode & CHECK_DEFAULT_Y)
3417 /* Erase the prompt */
3420 /* Return the flag */
3426 * Prompts for a keypress
3428 * The "prompt" should take the form "Command: "
3430 * Returns TRUE unless the character is "Escape"
3432 bool get_com(cptr prompt, char *command, bool z_escape)
3434 /* Paranoia XXX XXX XXX */
3437 /* Display a prompt */
3443 /* Clear the prompt */
3446 /* Handle "cancel" */
3447 if (*command == ESCAPE) return (FALSE);
3448 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3456 * Request a "quantity" from the user
3458 * Hack -- allow "command_arg" to specify a quantity
3460 s16b get_quantity(cptr prompt, int max)
3469 /* Use "command_arg" */
3472 /* Extract a number */
3475 /* Clear "command_arg" */
3478 /* Enforce the maximum */
3479 if (amt > max) amt = max;
3485 #ifdef ALLOW_REPEAT /* TNB */
3487 /* Get the item index */
3488 if ((max != 1) && repeat_pull(&amt))
3490 /* Enforce the maximum */
3491 if (amt > max) amt = max;
3493 /* Enforce the minimum */
3494 if (amt < 0) amt = 0;
3500 #endif /* ALLOW_REPEAT -- TNB */
3502 /* Build a prompt if needed */
3505 /* Build a prompt */
3507 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3509 sprintf(tmp, "Quantity (1-%d): ", max);
3513 /* Use that prompt */
3518 /* Default to one */
3521 /* Build the default */
3522 sprintf(buf, "%d", amt);
3524 /* Ask for a quantity */
3525 if (!get_string(prompt, buf, 6)) return (0);
3527 /* Extract a number */
3530 /* A letter means "all" */
3531 if (isalpha(buf[0])) amt = max;
3533 /* Enforce the maximum */
3534 if (amt > max) amt = max;
3536 /* Enforce the minimum */
3537 if (amt < 0) amt = 0;
3539 #ifdef ALLOW_REPEAT /* TNB */
3541 if (amt) repeat_push(amt);
3543 #endif /* ALLOW_REPEAT -- TNB */
3545 /* Return the result */
3551 * Pause for user response XXX XXX XXX
3553 void pause_line(int row)
3557 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3559 put_str("[Press any key to continue]", row, 23);
3568 * Hack -- special buffer to hold the action of the current keymap
3570 static char request_command_buffer[256];
3582 menu_naiyou menu_info[10][10] =
3585 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3587 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3588 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3590 {"Èâ/È¢", 6, FALSE},
3593 {"¤½¤Î¾", 9, FALSE},
3598 {"»È¤¦(m)", 'm', TRUE},
3599 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3600 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3601 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3611 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3612 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3613 {"õ¤¹(s)", 's', TRUE},
3614 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3615 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3616 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3617 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3618 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3619 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3620 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3624 {"Æɤà(r)", 'r', TRUE},
3625 {"°û¤à(q)", 'q', TRUE},
3626 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3627 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3628 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3629 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3630 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3631 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3632 {"Åꤲ¤ë(v)", 'v', TRUE},
3637 {"½¦¤¦(g)", 'g', TRUE},
3638 {"Íî¤È¤¹(d)", 'd', TRUE},
3639 {"²õ¤¹(k/^d)", 'k', TRUE},
3640 {"Ìäò¹ï¤à({)", '{', TRUE},
3641 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3642 {"Ä´ºº(I)", 'I', TRUE},
3643 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3650 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3651 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3652 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3653 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3663 {"³«¤±¤ë(o)", 'o', TRUE},
3664 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3665 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3666 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3676 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3677 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3678 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3679 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3680 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3681 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3682 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3683 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3684 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3689 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3690 {"¥Þ¥¯¥í(@)", '@', TRUE},
3691 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3692 {"¥«¥é¡¼(&)", '&', TRUE},
3693 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3694 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3695 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3702 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3703 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3704 {"¥Ø¥ë¥×(?)", '?', TRUE},
3705 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3706 {"¥á¥â(:)", ':', TRUE},
3707 {"µÇ°»£±Æ())", ')', TRUE},
3708 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3709 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3710 {"°úÂह¤ë(Q)", 'Q', TRUE},
3715 menu_naiyou menu_info[10][10] =
3718 {"Magic/Special", 1, FALSE},
3719 {"Action", 2, FALSE},
3720 {"Items(use)", 3, FALSE},
3721 {"Items(other)", 4, FALSE},
3722 {"Equip", 5, FALSE},
3723 {"Door/Box", 6, FALSE},
3724 {"Infomations", 7, FALSE},
3725 {"Options", 8, FALSE},
3726 {"Other commands", 9, FALSE},
3731 {"Use(m)", 'm', TRUE},
3732 {"See tips(b/P)", 'b', TRUE},
3733 {"Study(G)", 'G', TRUE},
3734 {"Special abilities(U/O)", 'U', TRUE},
3744 {"Rest(R)", 'R', TRUE},
3745 {"Disarm a trap(D)", 'D', TRUE},
3746 {"Search(s)", 's', TRUE},
3747 {"Look(l/x)", 'l', TRUE},
3748 {"Target(*)", '*', TRUE},
3749 {"Dig(T/^t)", 'T', TRUE},
3750 {"Go up stairs(<)", '<', TRUE},
3751 {"Go down staies(>)", '>', TRUE},
3752 {"Command pets(p)", 'p', TRUE},
3753 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3757 {"Read a scroll(r)", 'r', TRUE},
3758 {"Drink a potion(q)", 'q', TRUE},
3759 {"Use a staff(u/Z)", 'u', TRUE},
3760 {"Aim a wand(a/z)", 'a', TRUE},
3761 {"Zap a rod(z/a)", 'z', TRUE},
3762 {"Activate an equipment(A)", 'A', TRUE},
3763 {"Eat(E)", 'E', TRUE},
3764 {"Fire missile weapon(f/t)", 'f', TRUE},
3765 {"Throw an item(v)", 'v', TRUE},
3770 {"Get items(g)", 'g', TRUE},
3771 {"Drop an item(d)", 'd', TRUE},
3772 {"Destroy an item(k/^d)", 'k', TRUE},
3773 {"Inscribe an item({)", '{', TRUE},
3774 {"Uninscribe an item(})", '}', TRUE},
3775 {"Info about an item(I)", 'I', TRUE},
3776 {"Inventory list(i)", 'i', TRUE},
3783 {"Wear(w)", 'w', TRUE},
3784 {"Take off(t/T)", 't', TRUE},
3785 {"Refuel(F)", 'F', TRUE},
3786 {"Equipment list(e)", 'e', TRUE},
3796 {"Open(o)", 'o', TRUE},
3797 {"Close(c)", 'c', TRUE},
3798 {"Bash a door(B/f)", 'B', TRUE},
3799 {"Jam a door(j/S)", 'j', TRUE},
3809 {"Full map(M)", 'M', TRUE},
3810 {"Map(L/W)", 'L', TRUE},
3811 {"Level feeling(^f)", KTRL('F'), TRUE},
3812 {"Character status(C)", 'C', TRUE},
3813 {"Identify symbol(/)", '/', TRUE},
3814 {"Show prev messages(^p)", KTRL('P'), TRUE},
3815 {"Current time(^t/')", KTRL('T'), TRUE},
3816 {"Various infomations(~)", '~', TRUE},
3817 {"Play record menu(|)", '|', TRUE},
3822 {"Set options(=)", '=', TRUE},
3823 {"Interact with macros(@)", '@', TRUE},
3824 {"Interact w/ visuals(%)", '%', TRUE},
3825 {"Interact with colors(&)", '&', TRUE},
3826 {"Enter a user pref(\")", '\"', TRUE},
3827 {"Reload auto-pick pref($)", '$', TRUE},
3835 {"Save and quit(^x)", KTRL('X'), TRUE},
3836 {"Save(^s)", KTRL('S'), TRUE},
3837 {"Help(obsoleted)(?)", '?', TRUE},
3838 {"Redraw(^r)", KTRL('R'), TRUE},
3839 {"Take note(:)", ':', TRUE},
3840 {"Dump screen dump(()", ')', TRUE},
3841 {"Load screen dump())", '(', TRUE},
3842 {"Version info(V)", 'V', TRUE},
3843 {"Quit(Q)", 'Q', TRUE},
3856 } special_menu_naiyou;
3858 #define MENU_CLASS 1
3862 special_menu_naiyou special_menu_info[] =
3864 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3865 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3866 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3867 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3868 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3869 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3870 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3874 special_menu_naiyou special_menu_info[] =
3876 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3877 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3878 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3879 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3880 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3881 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3882 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3887 static char inkey_from_menu(void)
3891 int num = 0, max_num, old_num = 0;
3895 if (py - panel_row_min > 10) basey = 2;
3899 /* Clear top line */
3909 if (!menu) old_num = num;
3910 put_str("+----------------------------------------------------+", basey, basex);
3911 put_str("| |", basey+1, basex);
3912 put_str("| |", basey+2, basex);
3913 put_str("| |", basey+3, basex);
3914 put_str("| |", basey+4, basex);
3915 put_str("| |", basey+5, basex);
3916 put_str("+----------------------------------------------------+", basey+6, basex);
3918 for(i = 0; i < 10; i++)
3921 if (!menu_info[menu][i].cmd) break;
3922 menu_name = menu_info[menu][i].name;
3923 for(hoge = 0; ; hoge++)
3925 if (!special_menu_info[hoge].name[0]) break;
3926 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3927 switch(special_menu_info[hoge].jouken)
3930 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3933 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
3935 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3942 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
3945 kisuu = max_num % 2;
3947 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3949 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3952 /* Place the cursor on the player */
3953 move_cursor_relative(py, px);
3957 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r') || (sub_cmd == '\n'))
3959 if (menu_info[menu][num].fin)
3961 cmd = menu_info[menu][num].cmd;
3967 menu = menu_info[menu][num].cmd;
3973 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
3990 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
3995 num = (num + 2) % (max_num - 1);
3997 num = (num + 2) % (max_num + 1);
3999 else num = (num + 2) % max_num;
4001 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
4006 num = (num + max_num - 3) % (max_num - 1);
4008 num = (num + max_num - 1) % (max_num + 1);
4010 else num = (num + max_num - 2) % max_num;
4012 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
4014 if ((num % 2) || (num == max_num - 1))
4018 else if (num < max_num - 1)
4026 if (!inkey_next) inkey_next = "";
4032 * Request a command from the user.
4034 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
4035 * p_ptr->command_arg. May modify p_ptr->command_new.
4037 * Note that "caret" ("^") is treated specially, and is used to
4038 * allow manual input of control characters. This can be used
4039 * on many machines to request repeated tunneling (Ctrl-H) and
4040 * on the Macintosh to request "Control-Caret".
4042 * Note that "backslash" is treated specially, and is used to bypass any
4043 * keymap entry for the following character. This is useful for macros.
4045 * Note that this command is used both in the dungeon and in
4046 * stores, and must be careful to work in both situations.
4048 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
4050 void request_command(int shopping)
4063 if (rogue_like_commands)
4065 mode = KEYMAP_MODE_ROGUE;
4071 mode = KEYMAP_MODE_ORIG;
4075 /* No command yet */
4078 /* No "argument" yet */
4081 /* No "direction" yet */
4090 /* Hack -- auto-commands */
4093 /* Flush messages */
4096 /* Use auto-command */
4103 /* Get a keypress in "command" mode */
4106 /* Hack -- no flush needed */
4110 /* Activate "command mode" */
4116 if (!shopping && command_menu && ((cmd == '\r') || (cmd == '\n') || (cmd == 'x') || (cmd == 'X'))
4117 && !keymap_act[mode][(byte)(cmd)])
4118 cmd = inkey_from_menu();
4121 /* Clear top line */
4128 int old_arg = command_arg;
4133 /* Begin the input */
4135 prt("²ó¿ô: ", 0, 0);
4137 prt("Count: ", 0, 0);
4141 /* Get a command count */
4144 /* Get a new keypress */
4147 /* Simple editing (delete or backspace) */
4148 if ((cmd == 0x7F) || (cmd == KTRL('H')))
4150 /* Delete a digit */
4151 command_arg = command_arg / 10;
4153 /* Show current count */
4155 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4157 prt(format("Count: %d", command_arg), 0, 0);
4162 /* Actual numeric data */
4163 else if (cmd >= '0' && cmd <= '9')
4165 /* Stop count at 9999 */
4166 if (command_arg >= 1000)
4175 /* Increase count */
4178 /* Incorporate that digit */
4179 command_arg = command_arg * 10 + D2I(cmd);
4182 /* Show current count */
4184 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4186 prt(format("Count: %d", command_arg), 0, 0);
4191 /* Exit on "unusable" input */
4198 /* Hack -- Handle "zero" */
4199 if (command_arg == 0)
4204 /* Show current count */
4206 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4208 prt(format("Count: %d", command_arg), 0, 0);
4213 /* Hack -- Handle "old_arg" */
4216 /* Restore old_arg */
4217 command_arg = old_arg;
4219 /* Show current count */
4221 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4223 prt(format("Count: %d", command_arg), 0, 0);
4228 /* Hack -- white-space means "enter command now" */
4229 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
4231 /* Get a real command */
4233 if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
4235 if (!get_com("Command: ", (char *)&cmd, FALSE))
4249 /* Allow "keymaps" to be bypassed */
4252 /* Get a real command */
4254 (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
4256 (void)get_com("Command: ", (char *)&cmd, FALSE);
4260 /* Hack -- bypass keymaps */
4261 if (!inkey_next) inkey_next = "";
4265 /* Allow "control chars" to be entered */
4268 /* Get a new command and controlify it */
4270 if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4272 if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4278 /* Look up applicable keymap */
4279 act = keymap_act[mode][(byte)(cmd)];
4281 /* Apply keymap if not inside a keymap already */
4282 if (act && !inkey_next)
4284 /* Install the keymap (limited buffer size) */
4285 (void)strnfmt(request_command_buffer, 256, "%s", act);
4287 /* Start using the buffer */
4288 inkey_next = request_command_buffer;
4300 command_cmd = (byte)cmd;
4306 /* Hack -- Auto-repeat certain commands */
4307 if (always_repeat && (command_arg <= 0))
4309 /* Hack -- auto repeat certain commands */
4310 if (strchr("TBDoc+", command_cmd))
4312 /* Repeat 99 times */
4321 switch (command_cmd)
4323 /* Command "p" -> "purchase" (get) */
4324 case 'p': command_cmd = 'g'; break;
4326 /* Command "m" -> "purchase" (get) */
4327 case 'm': command_cmd = 'g'; break;
4329 /* Command "s" -> "sell" (drop) */
4330 case 's': command_cmd = 'd'; break;
4335 for (i = 0; i < 256; i++)
4338 if ((s = keymap_act[mode][i]) != NULL)
4340 if (*s == command_cmd && *(s+1) == 0)
4348 caretcmd = command_cmd;
4350 /* Hack -- Scan equipment */
4351 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4355 object_type *o_ptr = &inventory[i];
4357 /* Skip non-objects */
4358 if (!o_ptr->k_idx) continue;
4360 /* No inscription */
4361 if (!o_ptr->inscription) continue;
4363 /* Obtain the inscription */
4364 s = quark_str(o_ptr->inscription);
4369 /* Process preventions */
4372 /* Check the "restriction" character */
4374 if ((s[1] == caretcmd) || (s[1] == '*'))
4376 if ((s[1] == command_cmd) || (s[1] == '*'))
4380 /* Hack -- Verify command */
4382 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4384 if (!get_check("Are you sure? "))
4388 /* Hack -- Use space */
4393 /* Find another '^' */
4394 s = strchr(s + 1, '^');
4399 /* Hack -- erase the message line. */
4406 * Check a char for "vowel-hood"
4408 bool is_a_vowel(int ch)
4433 * Replace the first instance of "target" in "buf" with "insert"
4434 * If "insert" is NULL, just remove the first instance of "target"
4435 * In either case, return TRUE if "target" is found.
4437 * XXX Could be made more efficient, especially in the
4438 * case where "insert" is smaller than "target".
4440 static bool insert_str(char *buf, cptr target, cptr insert)
4443 int b_len, t_len, i_len;
4445 /* Attempt to find the target (modify "buf") */
4446 buf = strstr(buf, target);
4448 /* No target found */
4449 if (!buf) return (FALSE);
4451 /* Be sure we have an insertion string */
4452 if (!insert) insert = "";
4454 /* Extract some lengths */
4455 t_len = strlen(target);
4456 i_len = strlen(insert);
4457 b_len = strlen(buf);
4459 /* How much "movement" do we need? */
4460 len = i_len - t_len;
4462 /* We need less space (for insert) */
4465 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4468 /* We need more space (for insert) */
4471 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4474 /* If movement occured, we need a new terminator */
4475 if (len) buf[b_len+len] = '\0';
4477 /* Now copy the insertion string */
4478 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4480 /* Successful operation */
4490 * Called from cmd4.c and a few other places. Just extracts
4491 * a direction from the keymap for ch (the last direction,
4492 * in fact) byte or char here? I'm thinking that keymaps should
4493 * generally only apply to single keys, which makes it no more
4494 * than 128, so a char should suffice... but keymap_act is 256...
4496 int get_keymap_dir(char ch)
4500 /* Already a direction? */
4511 if (rogue_like_commands)
4513 mode = KEYMAP_MODE_ROGUE;
4519 mode = KEYMAP_MODE_ORIG;
4522 /* Extract the action (if any) */
4523 act = keymap_act[mode][(byte)(ch)];
4528 /* Convert to a direction */
4529 for (s = act; *s; ++s)
4531 /* Use any digits in keymap */
4532 if (isdigit(*s)) d = D2I(*s);
4540 /* Return direction */
4545 #ifdef ALLOW_REPEAT /* TNB */
4547 #define REPEAT_MAX 20
4549 /* Number of chars saved */
4550 static int repeat__cnt = 0;
4553 static int repeat__idx = 0;
4556 static int repeat__key[REPEAT_MAX];
4559 void repeat_push(int what)
4562 if (repeat__cnt == REPEAT_MAX) return;
4564 /* Push the "stuff" */
4565 repeat__key[repeat__cnt++] = what;
4567 /* Prevents us from pulling keys */
4572 bool repeat_pull(int *what)
4574 /* All out of keys */
4575 if (repeat__idx == repeat__cnt) return (FALSE);
4577 /* Grab the next key, advance */
4578 *what = repeat__key[repeat__idx++];
4584 void repeat_check(void)
4588 /* Ignore some commands */
4589 if (command_cmd == ESCAPE) return;
4590 if (command_cmd == ' ') return;
4591 if (command_cmd == '\r') return;
4592 if (command_cmd == '\n') return;
4594 /* Repeat Last Command */
4595 if (command_cmd == 'n')
4600 /* Get the command */
4601 if (repeat_pull(&what))
4603 /* Save the command */
4608 /* Start saving new command */
4617 /* Save this command */
4622 #endif /* ALLOW_REPEAT -- TNB */
4628 * Array size for which InsertionSort
4629 * is used instead of QuickSort
4635 * Exchange two sort-entries
4636 * (should probably be coded inline
4637 * for speed increase)
4639 static void swap(tag_type *a, tag_type *b)
4644 temp.pointer = a->pointer;
4647 a->pointer = b->pointer;
4650 b->pointer = temp.pointer;
4655 * Insertion-Sort algorithm
4656 * (used by the Quicksort algorithm)
4658 static void InsertionSort(tag_type elements[], int number)
4664 for (P = 1; P < number; P++)
4667 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4668 elements[j] = elements[j - 1];
4675 * Helper function for Quicksort
4677 static tag_type median3(tag_type elements[], int left, int right)
4679 int center = (left + right) / 2;
4681 if (elements[left].tag > elements[center].tag)
4682 swap(&elements[left], &elements[center]);
4683 if (elements[left].tag > elements[right].tag)
4684 swap(&elements[left], &elements[right]);
4685 if (elements[center].tag > elements[right].tag)
4686 swap(&elements[center], &elements[right]);
4688 swap(&elements[center], &elements[right - 1]);
4689 return (elements[right - 1]);
4694 * Quicksort algorithm
4696 * The "median of three" pivot selection eliminates
4697 * the bad case of already sorted input.
4699 * We use InsertionSort for smaller sub-arrays,
4700 * because it is faster in this case.
4702 * For details see: "Data Structures and Algorithm
4703 * Analysis in C" by Mark Allen Weiss.
4705 static void quicksort(tag_type elements[], int left, int right)
4710 if (left + CUTOFF <= right)
4712 pivot = median3(elements, left, right);
4714 i = left; j = right -1;
4718 while (elements[++i].tag < pivot.tag);
4719 while (elements[--j].tag > pivot.tag);
4722 swap(&elements[i], &elements[j]);
4728 swap(&elements[i], &elements[right - 1]);
4730 quicksort(elements, left, i - 1);
4731 quicksort(elements, i + 1, right);
4735 /* Use InsertionSort on small arrays */
4736 InsertionSort(elements + left, right - left + 1);
4742 * Frontend for the sorting algorithm
4744 * Sorts an array of tagged pointers
4745 * with <number> elements.
4747 void tag_sort(tag_type elements[], int number)
4749 quicksort(elements, 0, number - 1);
4752 #endif /* SORT_R_INFO */
4754 #ifdef SUPPORT_GAMMA
4756 /* Table of gamma values */
4757 byte gamma_table[256];
4759 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4760 static s16b gamma_helper[256] =
4762 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4763 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4764 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4765 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4766 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4767 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4768 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4769 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4770 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4771 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4772 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4773 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4774 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4775 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4776 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4777 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4782 * Build the gamma table so that floating point isn't needed.
4784 * Note gamma goes from 0->256. The old value of 100 is now 128.
4786 void build_gamma_table(int gamma)
4791 * value is the current sum.
4792 * diff is the new term to add to the series.
4796 /* Hack - convergence is bad in these cases. */
4798 gamma_table[255] = 255;
4800 for (i = 1; i < 255; i++)
4803 * Initialise the Taylor series
4805 * value and diff have been scaled by 256
4810 diff = ((long)gamma_helper[i]) * (gamma - 256);
4819 * Use the following identiy to calculate the gamma table.
4820 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4822 * n is the current term number.
4824 * The gamma_helper array contains a table of
4826 * This is used because a^b = exp(b*ln(a))
4832 * Note that everything is scaled by 256 for accuracy,
4833 * plus another factor of 256 for the final result to
4834 * be from 0-255. Thus gamma_helper[] * gamma must be
4835 * divided by 256*256 each itteration, to get back to
4836 * the original power series.
4838 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4842 * Store the value in the table so that the
4843 * floating point pow function isn't needed .
4845 gamma_table[i] = ((long)(value / 256) * i) / 256;
4849 #endif /* SUPPORT_GAMMA */
4853 * Add a series of keypresses to the "queue".
4855 * Return any errors generated by Term_keypress() in doing so, or SUCCESS
4856 * if there are none.
4858 * Catch the "out of space" error before anything is printed.
4860 * NB: The keys added here will be interpreted by any macros or keymaps.
4862 errr type_string(cptr str, uint len)
4869 /* Paranoia - no string. */
4870 if (!str) return -1;
4872 /* Hack - calculate the string length here if none given. */
4873 if (!len) len = strlen(str);
4875 /* Activate the main window, as all pastes go there. */
4876 Term_activate(term_screen);
4878 for (s = str; s < str+len; s++)
4880 /* Catch end of string */
4881 if (*s == '\0') break;
4883 err = Term_keypress(*s);
4889 /* Activate the original window. */
4897 void roff_to_buf(cptr str, int maxlen, char *tbuf, size_t bufsize)
4906 while (str[read_pt])
4909 bool kinsoku = FALSE;
4914 /* Prepare one character */
4915 ch[0] = str[read_pt];
4918 kanji = iskanji(ch[0]);
4922 ch[1] = str[read_pt+1];
4925 if (strcmp(ch, "¡£") == 0 ||
4926 strcmp(ch, "¡¢") == 0 ||
4927 strcmp(ch, "¥£") == 0 ||
4928 strcmp(ch, "¡¼") == 0)
4931 else if (!isprint(ch[0]))
4934 if (!isprint(ch[0]))
4938 if (line_len + ch_len > maxlen - 1 || str[read_pt] == '\n')
4942 /* return to better wrapping point. */
4943 /* Space character at the end of the line need not to be printed. */
4944 word_len = read_pt - word_punct;
4946 if (kanji && !kinsoku)
4950 if (ch[0] == ' ' || word_len >= line_len/2)
4954 read_pt = word_punct;
4955 if (str[word_punct] == ' ')
4957 write_pt -= word_len;
4960 tbuf[write_pt++] = '\0';
4962 word_punct = read_pt;
4966 word_punct = read_pt;
4968 if (!kinsoku) word_punct = read_pt;
4971 /* Not enough buffer size */
4972 if ((size_t)(write_pt + 3) >= bufsize) break;
4974 tbuf[write_pt++] = ch[0];
4980 tbuf[write_pt++] = ch[1];
4986 tbuf[write_pt] = '\0';
4987 tbuf[write_pt+1] = '\0';
4994 * The my_strcpy() function copies up to 'bufsize'-1 characters from 'src'
4995 * to 'buf' and NUL-terminates the result. The 'buf' and 'src' strings may
4998 * my_strcpy() returns strlen(src). This makes checking for truncation
4999 * easy. Example: if (my_strcpy(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
5001 * This function should be equivalent to the strlcpy() function in BSD.
5003 size_t my_strcpy(char *buf, const char *src, size_t bufsize)
5008 const char *s = src;
5011 /* reserve for NUL termination */
5014 /* Copy as many bytes as will fit */
5015 while (len < bufsize)
5019 if (len + 1 >= bufsize || !*(s+1)) break;
5037 size_t len = strlen(src);
5041 if (bufsize == 0) return ret;
5044 if (len >= bufsize) len = bufsize - 1;
5046 /* Copy the string and terminate it */
5047 (void)memcpy(buf, src, len);
5050 /* Return strlen(src) */
5058 * The my_strcat() tries to append a string to an existing NUL-terminated string.
5059 * It never writes more characters into the buffer than indicated by 'bufsize' and
5060 * NUL-terminates the buffer. The 'buf' and 'src' strings may not overlap.
5062 * my_strcat() returns strlen(buf) + strlen(src). This makes checking for
5063 * truncation easy. Example:
5064 * if (my_strcat(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
5066 * This function should be equivalent to the strlcat() function in BSD.
5068 size_t my_strcat(char *buf, const char *src, size_t bufsize)
5070 size_t dlen = strlen(buf);
5072 /* Is there room left in the buffer? */
5073 if (dlen < bufsize - 1)
5075 /* Append as much as possible */
5076 return (dlen + my_strcpy(buf + dlen, src, bufsize - dlen));
5080 /* Return without appending */
5081 return (dlen + strlen(src));