3 /* Purpose: Angband utilities -BEN- */
11 static int num_more = 0;
16 * For those systems that don't have "memset()"
18 * Set the value of each of 'n' bytes starting at 's' to 'c', return 's'
19 * If 'n' is negative, you will erase a whole lot of memory.
21 char *memset(char *s, int c, huge n)
24 for (t = s; len--; ) *t++ = c;
35 * For those systems that don't have "stricmp()"
37 * Compare the two strings "a" and "b" ala "strcmp()" ignoring case.
39 int stricmp(cptr a, cptr b)
44 /* Scan the strings */
45 for (s1 = a, s2 = b; TRUE; s1++, s2++)
49 if (z1 < z2) return (-1);
50 if (z1 > z2) return (1);
55 #endif /* HAS_STRICMP */
63 * For those systems that don't have "usleep()" but need it.
65 * Fake "usleep()" function grabbed from the inl netrek server -cba
67 int usleep(huge usecs)
74 fd_set *no_fds = NULL;
80 /* Was: int readfds, writefds, exceptfds; */
81 /* Was: readfds = writefds = exceptfds = 0; */
84 /* Paranoia -- No excessive sleeping */
86 if (usecs > 4000000L) core("ÉÔÅö¤Ê usleep() ¸Æ¤Ó½Ð¤·");
88 if (usecs > 4000000L) core("Illegal usleep() call");
94 Timer.tv_sec = (usecs / 1000000L);
95 Timer.tv_usec = (usecs % 1000000L);
98 if (select(nfds, no_fds, no_fds, no_fds, &Timer) < 0)
100 /* Hack -- ignore interrupts */
101 if (errno != EINTR) return -1;
112 * Hack -- External functions
114 extern struct passwd *getpwuid();
115 extern struct passwd *getpwnam();
119 * Find a default user name from the system.
121 void user_name(char *buf, int id)
126 /* Look up the user name */
127 if ((pw = getpwuid(id)))
129 (void)strcpy(buf, pw->pw_name);
132 #ifdef CAPITALIZE_USER_NAME
133 /* Hack -- capitalize the user name */
135 if (!iskanji(buf[0]))
138 buf[0] = toupper(buf[0]);
139 #endif /* CAPITALIZE_USER_NAME */
145 /* Oops. Hack -- default to "PLAYER" */
146 strcpy(buf, "PLAYER");
155 * The concept of the "file" routines below (and elsewhere) is that all
156 * file handling should be done using as few routines as possible, since
157 * every machine is slightly different, but these routines always have the
160 * In fact, perhaps we should use the "path_parse()" routine below to convert
161 * from "canonical" filenames (optional leading tilde's, internal wildcards,
162 * slash as the path seperator, etc) to "system" filenames (no special symbols,
163 * system-specific path seperator, etc). This would allow the program itself
164 * to assume that all filenames are "Unix" filenames, and explicitly "extract"
165 * such filenames if needed (by "path_parse()", or perhaps "path_canon()").
167 * Note that "path_temp" should probably return a "canonical" filename.
169 * Note that "my_fopen()" and "my_open()" and "my_make()" and "my_kill()"
170 * and "my_move()" and "my_copy()" should all take "canonical" filenames.
172 * Note that "canonical" filenames use a leading "slash" to indicate an absolute
173 * path, and a leading "tilde" to indicate a special directory, and default to a
174 * relative path, but MSDOS uses a leading "drivename plus colon" to indicate the
175 * use of a "special drive", and then the rest of the path is parsed "normally",
176 * and MACINTOSH uses a leading colon to indicate a relative path, and an embedded
177 * colon to indicate a "drive plus absolute path", and finally defaults to a file
178 * in the current working directory, which may or may not be defined.
180 * We should probably parse a leading "~~/" as referring to "ANGBAND_DIR". (?)
188 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
198 * Extract a "parsed" path from an initial filename
199 * Normally, we simply copy the filename into the buffer
200 * But leading tilde symbols must be handled in a special way
201 * Replace "~user/" by the home directory of the user named "user"
202 * Replace "~/" by the home directory of the current user
204 errr path_parse(char *buf, int max, cptr file)
211 /* Assume no result */
215 if (!file) return (-1);
217 /* File needs no parsing */
224 /* Point at the user */
227 /* Look for non-user portion of the file */
228 s = strstr(u, PATH_SEP);
230 /* Hack -- no long user names */
231 if (s && (s >= u + sizeof(user))) return (1);
233 /* Extract a user name */
237 for (i = 0; u < s; ++i) user[i] = *u++;
242 /* Look up the "current" user */
243 if (u[0] == '\0') u = getlogin();
245 /* Look up a user (or "current" user) */
246 if (u) pw = getpwnam(u);
247 else pw = getpwuid(getuid());
252 /* Make use of the info */
253 (void)strcpy(buf, pw->pw_dir);
255 /* Append the rest of the filename, if any */
256 if (s) (void)strcat(buf, s);
267 * Extract a "parsed" path from an initial filename
269 * This requires no special processing on simple machines,
270 * except for verifying the size of the filename.
272 errr path_parse(char *buf, int max, cptr file)
274 /* Accept the filename */
275 (void)strnfmt(buf, max, "%s", file);
288 * Hack -- acquire a "temporary" file name if possible
290 * This filename is always in "system-specific" form.
292 static errr path_temp(char *buf, int max)
302 /* Format to length */
303 (void)strnfmt(buf, max, "%s", s);
312 * Create a new path by appending a file (or directory) to a path.
314 * This requires no special processing on simple machines, except
315 * for verifying the size of the filename, but note the ability to
316 * bypass the given "path" with certain special file-names.
318 * Note that the "file" may actually be a "sub-path", including
321 * Note that this function yields a path which must be "parsed"
322 * using the "parse" function above.
324 errr path_build(char *buf, int max, cptr path, cptr file)
329 /* Use the file itself */
330 (void)strnfmt(buf, max, "%s", file);
333 /* Absolute file, on "normal" systems */
334 else if (prefix(file, PATH_SEP) && !streq(PATH_SEP, ""))
336 /* Use the file itself */
337 (void)strnfmt(buf, max, "%s", file);
343 /* Use the file itself */
344 (void)strnfmt(buf, max, "%s", file);
350 /* Build the new path */
351 (void)strnfmt(buf, max, "%s%s%s", path, PATH_SEP, file);
360 * Hack -- replacement for "fopen()"
362 FILE *my_fopen(cptr file, cptr mode)
366 /* Hack -- Try to parse the path */
367 if (path_parse(buf, 1024, file)) return (NULL);
369 /* Attempt to fopen the file anyway */
370 return (fopen(buf, mode));
375 * Hack -- replacement for "fclose()"
377 errr my_fclose(FILE *fff)
380 if (!fff) return (-1);
382 /* Close, check for error */
383 if (fclose(fff) == EOF) return (1);
395 FILE *my_fopen_temp(char *buf, int max)
399 /* Prepare the buffer for mkstemp */
400 strncpy(buf, "/tmp/anXXXXXX", max);
402 /* Secure creation of a temporary file */
405 /* Check the file-descriptor */
406 if (fd < 0) return (NULL);
408 /* Return a file stream */
409 return (fdopen(fd, "w"));
412 #else /* HAVE_MKSTEMP */
414 FILE *my_fopen_temp(char *buf, int max)
416 /* Generate a temporary filename */
417 if (path_temp(buf, max)) return (NULL);
420 return (my_fopen(buf, "w"));
423 #endif /* HAVE_MKSTEMP */
427 * Hack -- replacement for "fgets()"
429 * Read a string, without a newline, to a file
431 * Process tabs, strip internal non-printables
433 errr my_fgets(FILE *fff, char *buf, huge n)
442 if (fgets(tmp, 1024, fff))
444 /* Convert weirdness */
445 for (s = tmp; *s; s++)
460 /* Hack -- require room */
461 if (i + 8 >= n) break;
466 /* Append some more spaces */
467 while (!(i % 8)) buf[i++] = ' ';
471 else if (iskanji(*s))
479 else if ((((int)*s & 0xff) > 0xa1) && (((int)*s & 0xff ) < 0xdf))
486 /* Handle printables */
487 else if (isprint(*s))
496 /* No newline character, but terminate */
512 * Hack -- replacement for "fputs()"
514 * Dump a string, plus a newline, to a file
516 * XXX XXX XXX Process internal weirdness?
518 errr my_fputs(FILE *fff, cptr buf, huge n)
523 /* Dump, ignore errors */
524 (void)fprintf(fff, "%s\n", buf);
535 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
537 * Many of them can be rewritten now that only "fd_open()" and "fd_make()"
538 * and "my_fopen()" should ever create files.
546 * Code Warrior is a little weird about some functions
549 extern int open(const char *, int, ...);
550 extern int close(int);
551 extern int read(int, void *, unsigned int);
552 extern int write(int, const void *, unsigned int);
553 extern long lseek(int, long, int);
554 #endif /* BEN_HACK */
558 * The Macintosh is a little bit brain-dead sometimes
561 # define open(N,F,M) \
562 ((M), open((char*)(N),F))
563 # define write(F,B,S) \
564 write(F,(char*)(B),S)
565 #endif /* MACINTOSH */
569 * Several systems have no "O_BINARY" flag
573 #endif /* O_BINARY */
577 * Hack -- attempt to delete a file
579 errr fd_kill(cptr file)
583 /* Hack -- Try to parse the path */
584 if (path_parse(buf, 1024, file)) return (-1);
595 * Hack -- attempt to move a file
597 errr fd_move(cptr file, cptr what)
602 /* Hack -- Try to parse the path */
603 if (path_parse(buf, 1024, file)) return (-1);
605 /* Hack -- Try to parse the path */
606 if (path_parse(aux, 1024, what)) return (-1);
609 (void)rename(buf, aux);
617 * Hack -- attempt to copy a file
619 errr fd_copy(cptr file, cptr what)
626 /* Hack -- Try to parse the path */
627 if (path_parse(buf, 1024, file)) return (-1);
629 /* Hack -- Try to parse the path */
630 if (path_parse(aux, 1024, what)) return (-1);
632 /* Open source file */
633 src_fd = fd_open(buf, O_RDONLY);
634 if (src_fd < 0) return (-1);
636 /* Open destination file */
637 dst_fd = fd_open(aux, O_WRONLY|O_TRUNC|O_CREAT);
638 if (dst_fd < 0) return (-1);
641 while ((read_num = read(src_fd, buf, 1024)) > 0)
643 write(dst_fd, buf, read_num);
656 * Hack -- attempt to open a file descriptor (create file)
658 * This function should fail if the file already exists
660 * Note that we assume that the file should be "binary"
662 * XXX XXX XXX The horrible "BEN_HACK" code is for compiling under
663 * the CodeWarrior compiler, in which case, for some reason, none
664 * of the "O_*" flags are defined, and we must fake the definition
665 * of "O_RDONLY", "O_WRONLY", and "O_RDWR" in "A-win-h", and then
666 * we must simulate the effect of the proper "open()" call below.
668 int fd_make(cptr file, int mode)
672 /* Hack -- Try to parse the path */
673 if (path_parse(buf, 1024, file)) return (-1);
677 /* Check for existance */
678 /* if (fd_close(fd_open(file, O_RDONLY | O_BINARY))) return (1); */
680 /* Mega-Hack -- Create the file */
681 (void)my_fclose(my_fopen(file, "wb"));
683 /* Re-open the file for writing */
684 return (open(buf, O_WRONLY | O_BINARY, mode));
688 /* Create the file, fail if exists, write-only, binary */
689 return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
691 #endif /* BEN_HACK */
697 * Hack -- attempt to open a file descriptor (existing file)
699 * Note that we assume that the file should be "binary"
701 int fd_open(cptr file, int flags)
705 /* Hack -- Try to parse the path */
706 if (path_parse(buf, 1024, file)) return (-1);
708 /* Attempt to open the file */
709 return (open(buf, flags | O_BINARY, 0));
714 * Hack -- attempt to lock a file descriptor
716 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
718 errr fd_lock(int fd, int what)
721 what = what ? what : 0;
724 if (fd < 0) return (-1);
730 # if defined(F_ULOCK) && defined(F_LOCK)
735 /* Unlock it, Ignore errors */
736 lockf(fd, F_ULOCK, 0);
742 /* Lock the score file */
743 if (lockf(fd, F_LOCK, 0) != 0) return (1);
750 # if defined(LOCK_UN) && defined(LOCK_EX)
755 /* Unlock it, Ignore errors */
756 (void)flock(fd, LOCK_UN);
762 /* Lock the score file */
763 if (flock(fd, LOCK_EX) != 0) return (1);
778 * Hack -- attempt to seek on a file descriptor
780 errr fd_seek(int fd, huge n)
785 if (fd < 0) return (-1);
787 /* Seek to the given position */
788 p = lseek(fd, n, SEEK_SET);
791 if (p < 0) return (1);
794 if (p != n) return (1);
802 * Hack -- attempt to truncate a file descriptor
804 errr fd_chop(int fd, huge n)
810 if (fd < 0) return (-1);
812 #if defined(SUNOS) || defined(ULTRIX) || defined(NeXT)
823 * Hack -- attempt to read data from a file descriptor
825 errr fd_read(int fd, char *buf, huge n)
828 if (fd < 0) return (-1);
836 if (read(fd, buf, 16384) != 16384) return (1);
838 /* Shorten the task */
841 /* Shorten the task */
847 /* Read the final piece */
848 if (read(fd, buf, n) != (int)n) return (1);
856 * Hack -- Attempt to write data to a file descriptor
858 errr fd_write(int fd, cptr buf, huge n)
861 if (fd < 0) return (-1);
869 if (write(fd, buf, 16384) != 16384) return (1);
871 /* Shorten the task */
874 /* Shorten the task */
880 /* Write the final piece */
881 if (write(fd, buf, n) != (int)n) return (1);
889 * Hack -- attempt to close a file descriptor
891 errr fd_close(int fd)
894 if (fd < 0) return (-1);
910 * XXX XXX XXX Important note about "colors" XXX XXX XXX
912 * The "TERM_*" color definitions list the "composition" of each
913 * "Angband color" in terms of "quarters" of each of the three color
914 * components (Red, Green, Blue), for example, TERM_UMBER is defined
915 * as 2/4 Red, 1/4 Green, 0/4 Blue.
917 * The following info is from "Torbjorn Lindgren" (see "main-xaw.c").
919 * These values are NOT gamma-corrected. On most machines (with the
920 * Macintosh being an important exception), you must "gamma-correct"
921 * the given values, that is, "correct for the intrinsic non-linearity
922 * of the phosphor", by converting the given intensity levels based
923 * on the "gamma" of the target screen, which is usually 1.7 (or 1.5).
925 * The actual formula for conversion is unknown to me at this time,
926 * but you can use the table below for the most common gamma values.
928 * So, on most machines, simply convert the values based on the "gamma"
929 * of the target screen, which is usually in the range 1.5 to 1.7, and
930 * usually is closest to 1.7. The converted value for each of the five
931 * different "quarter" values is given below:
933 * Given Gamma 1.0 Gamma 1.5 Gamma 1.7 Hex 1.7
934 * ----- ---- ---- ---- ---
935 * 0/4 0.00 0.00 0.00 #00
936 * 1/4 0.25 0.27 0.28 #47
937 * 2/4 0.50 0.55 0.56 #8f
938 * 3/4 0.75 0.82 0.84 #d7
939 * 4/4 1.00 1.00 1.00 #ff
941 * Note that some machines (i.e. most IBM machines) are limited to a
942 * hard-coded set of colors, and so the information above is useless.
944 * Also, some machines are limited to a pre-determined set of colors,
945 * for example, the IBM can only display 16 colors, and only 14 of
946 * those colors resemble colors used by Angband, and then only when
947 * you ignore the fact that "Slate" and "cyan" are not really matches,
948 * so on the IBM, we use "orange" for both "Umber", and "Light Umber"
949 * in addition to the obvious "Orange", since by combining all of the
950 * "indeterminate" colors into a single color, the rest of the colors
951 * are left with "meaningful" values.
958 void move_cursor(int row, int col)
960 Term_gotoxy(col, row);
966 * Convert a decimal to a single digit octal number
968 static char octify(uint i)
970 return (hexsym[i%8]);
974 * Convert a decimal to a single digit hex number
976 static char hexify(uint i)
978 return (hexsym[i%16]);
983 * Convert a octal-digit into a decimal
985 static int deoct(char c)
987 if (isdigit(c)) return (D2I(c));
992 * Convert a hexidecimal-digit into a decimal
994 static int dehex(char c)
996 if (isdigit(c)) return (D2I(c));
997 if (islower(c)) return (A2I(c) + 10);
998 if (isupper(c)) return (A2I(tolower(c)) + 10);
1003 static int my_stricmp(cptr a, cptr b)
1008 /* Scan the strings */
1009 for (s1 = a, s2 = b; TRUE; s1++, s2++)
1011 z1 = FORCEUPPER(*s1);
1012 z2 = FORCEUPPER(*s2);
1013 if (z1 < z2) return (-1);
1014 if (z1 > z2) return (1);
1015 if (!z1) return (0);
1019 static int my_strnicmp(cptr a, cptr b, int n)
1024 /* Scan the strings */
1025 for (s1 = a, s2 = b; n > 0; s1++, s2++, n--)
1027 z1 = FORCEUPPER(*s1);
1028 z2 = FORCEUPPER(*s2);
1029 if (z1 < z2) return (-1);
1030 if (z1 > z2) return (1);
1031 if (!z1) return (0);
1037 static void trigger_text_to_ascii(char **bufptr, cptr *strptr)
1041 bool mod_status[MAX_MACRO_MOD];
1044 int shiftstatus = 0;
1047 if (macro_template == NULL)
1050 for (i = 0; macro_modifier_chr[i]; i++)
1051 mod_status[i] = FALSE;
1054 /* Examine modifier keys */
1057 for (i=0; macro_modifier_chr[i]; i++)
1059 len = strlen(macro_modifier_name[i]);
1061 if(!my_strnicmp(str, macro_modifier_name[i], len))
1064 if (!macro_modifier_chr[i]) break;
1066 mod_status[i] = TRUE;
1067 if ('S' == macro_modifier_chr[i])
1070 for (i = 0; i < max_macrotrigger; i++)
1072 len = strlen(macro_trigger_name[i]);
1073 if (!my_strnicmp(str, macro_trigger_name[i], len) && ']' == str[len])
1075 /* a trigger name found */
1080 /* Invalid trigger name? */
1081 if (i == max_macrotrigger)
1083 str = strchr(str, ']');
1089 *strptr = str; /* where **strptr == ']' */
1093 key_code = macro_trigger_keycode[shiftstatus][i];
1097 for (i = 0; macro_template[i]; i++)
1099 char ch = macro_template[i];
1105 for (j = 0; macro_modifier_chr[j]; j++) {
1107 *s++ = macro_modifier_chr[j];
1111 strcpy(s, key_code);
1112 s += strlen(key_code);
1122 *strptr = str; /* where **strptr == ']' */
1128 * Hack -- convert a printable string into real ascii
1130 * I have no clue if this function correctly handles, for example,
1131 * parsing "\xFF" into a (signed) char. Whoever thought of making
1132 * the "sign" of a "char" undefined is a complete moron. Oh well.
1134 void text_to_ascii(char *buf, cptr str)
1138 /* Analyze the "ascii" string */
1141 /* Backslash codes */
1144 /* Skip the backslash */
1150 trigger_text_to_ascii(&s, &str);
1157 *s = 16 * dehex(*++str);
1158 *s++ += dehex(*++str);
1161 /* Hack -- simple way to specify "backslash" */
1162 else if (*str == '\\')
1167 /* Hack -- simple way to specify "caret" */
1168 else if (*str == '^')
1173 /* Hack -- simple way to specify "space" */
1174 else if (*str == 's')
1179 /* Hack -- simple way to specify Escape */
1180 else if (*str == 'e')
1186 else if (*str == 'b')
1192 else if (*str == 'n')
1198 else if (*str == 'r')
1204 else if (*str == 't')
1210 else if (*str == '0')
1212 *s = 8 * deoct(*++str);
1213 *s++ += deoct(*++str);
1217 else if (*str == '1')
1219 *s = 64 + 8 * deoct(*++str);
1220 *s++ += deoct(*++str);
1224 else if (*str == '2')
1226 *s = 64 * 2 + 8 * deoct(*++str);
1227 *s++ += deoct(*++str);
1231 else if (*str == '3')
1233 *s = 64 * 3 + 8 * deoct(*++str);
1234 *s++ += deoct(*++str);
1237 /* Skip the final char */
1241 /* Normal Control codes */
1242 else if (*str == '^')
1245 *s++ = (*str++ & 037);
1260 bool trigger_ascii_to_text(char **bufptr, cptr *strptr)
1268 if (macro_template == NULL)
1274 for (i = 0; macro_template[i]; i++)
1277 char ch = macro_template[i];
1282 while ((tmp = strchr(macro_modifier_chr, *str)))
1284 j = (int)(tmp - macro_modifier_chr);
1285 tmp = macro_modifier_name[j];
1286 while(*tmp) *s++ = *tmp++;
1291 for (j = 0; *str && *str != (char)13; j++)
1292 key_code[j] = *str++;
1296 if (ch != *str) return FALSE;
1300 if (*str++ != (char)13) return FALSE;
1302 for (i = 0; i < max_macrotrigger; i++)
1304 if (!my_stricmp(key_code, macro_trigger_keycode[0][i])
1305 || !my_stricmp(key_code, macro_trigger_keycode[1][i]))
1308 if (i == max_macrotrigger)
1311 tmp = macro_trigger_name[i];
1312 while (*tmp) *s++ = *tmp++;
1323 * Hack -- convert a string into a printable form
1325 void ascii_to_text(char *buf, cptr str)
1329 /* Analyze the "ascii" string */
1332 byte i = (byte)(*str++);
1337 if(!trigger_ascii_to_text(&s, &str))
1398 *s++ = octify(i / 8);
1399 *s++ = octify(i % 8);
1405 *s++ = hexify(i / 16);
1406 *s++ = hexify(i % 16);
1417 * The "macro" package
1419 * Functions are provided to manipulate a collection of macros, each
1420 * of which has a trigger pattern string and a resulting action string
1421 * and a small set of flags.
1427 * Determine if any macros have ever started with a given character.
1429 static bool macro__use[256];
1433 * Find the macro (if any) which exactly matches the given pattern
1435 sint macro_find_exact(cptr pat)
1439 /* Nothing possible */
1440 if (!macro__use[(byte)(pat[0])])
1445 /* Scan the macros */
1446 for (i = 0; i < macro__num; ++i)
1448 /* Skip macros which do not match the pattern */
1449 if (!streq(macro__pat[i], pat)) continue;
1461 * Find the first macro (if any) which contains the given pattern
1463 static sint macro_find_check(cptr pat)
1467 /* Nothing possible */
1468 if (!macro__use[(byte)(pat[0])])
1473 /* Scan the macros */
1474 for (i = 0; i < macro__num; ++i)
1476 /* Skip macros which do not contain the pattern */
1477 if (!prefix(macro__pat[i], pat)) continue;
1489 * Find the first macro (if any) which contains the given pattern and more
1491 static sint macro_find_maybe(cptr pat)
1495 /* Nothing possible */
1496 if (!macro__use[(byte)(pat[0])])
1501 /* Scan the macros */
1502 for (i = 0; i < macro__num; ++i)
1504 /* Skip macros which do not contain the pattern */
1505 if (!prefix(macro__pat[i], pat)) continue;
1507 /* Skip macros which exactly match the pattern XXX XXX */
1508 if (streq(macro__pat[i], pat)) continue;
1520 * Find the longest macro (if any) which starts with the given pattern
1522 static sint macro_find_ready(cptr pat)
1524 int i, t, n = -1, s = -1;
1526 /* Nothing possible */
1527 if (!macro__use[(byte)(pat[0])])
1532 /* Scan the macros */
1533 for (i = 0; i < macro__num; ++i)
1535 /* Skip macros which are not contained by the pattern */
1536 if (!prefix(pat, macro__pat[i])) continue;
1538 /* Obtain the length of this macro */
1539 t = strlen(macro__pat[i]);
1541 /* Only track the "longest" pattern */
1542 if ((n >= 0) && (s > t)) continue;
1544 /* Track the entry */
1555 * Add a macro definition (or redefinition).
1557 * We should use "act == NULL" to "remove" a macro, but this might make it
1558 * impossible to save the "removal" of a macro definition. XXX XXX XXX
1560 * We should consider refusing to allow macros which contain existing macros,
1561 * or which are contained in existing macros, because this would simplify the
1562 * macro analysis code. XXX XXX XXX
1564 * We should consider removing the "command macro" crap, and replacing it
1565 * with some kind of "powerful keymap" ability, but this might make it hard
1566 * to change the "roguelike" option from inside the game. XXX XXX XXX
1568 errr macro_add(cptr pat, cptr act)
1573 /* Paranoia -- require data */
1574 if (!pat || !act) return (-1);
1577 /* Look for any existing macro */
1578 n = macro_find_exact(pat);
1580 /* Replace existing macro */
1583 /* Free the old macro action */
1584 string_free(macro__act[n]);
1587 /* Create a new macro */
1590 /* Acquire a new index */
1593 /* Save the pattern */
1594 macro__pat[n] = string_make(pat);
1597 /* Save the action */
1598 macro__act[n] = string_make(act);
1601 macro__use[(byte)(pat[0])] = TRUE;
1610 * Initialize the "macro" package
1612 errr macro_init(void)
1614 /* Macro patterns */
1615 C_MAKE(macro__pat, MACRO_MAX, cptr);
1618 C_MAKE(macro__act, MACRO_MAX, cptr);
1625 * Local variable -- we are inside a "macro action"
1627 * Do not match any macros until "ascii 30" is found.
1629 static bool parse_macro = FALSE;
1632 * Local variable -- we are inside a "macro trigger"
1634 * Strip all keypresses until a low ascii value is found.
1636 static bool parse_under = FALSE;
1640 * Flush all input chars. Actually, remember the flush,
1641 * and do a "special flush" before the next "inkey()".
1643 * This is not only more efficient, but also necessary to make sure
1644 * that various "inkey()" codes are not "lost" along the way.
1654 * Flush the screen, make a noise
1658 /* Mega-Hack -- Flush the output */
1661 /* Make a bell noise (if allowed) */
1662 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1664 /* Flush the input (later!) */
1670 * Hack -- Make a (relevant?) sound
1675 if (!use_sound) return;
1677 /* Make a sound (if allowed) */
1678 Term_xtra(TERM_XTRA_SOUND, val);
1684 * Helper function called only from "inkey()"
1686 * This function does almost all of the "macro" processing.
1688 * We use the "Term_key_push()" function to handle "failed" macros, as well
1689 * as "extra" keys read in while choosing the proper macro, and also to hold
1690 * the action for the macro, plus a special "ascii 30" character indicating
1691 * that any macro action in progress is complete. Embedded macros are thus
1692 * illegal, unless a macro action includes an explicit "ascii 30" character,
1693 * which would probably be a massive hack, and might break things.
1695 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1696 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1697 * macro trigger, 500 milliseconds must pass before the key sequence is
1698 * known not to be that macro trigger. XXX XXX XXX
1700 static char inkey_aux(void)
1702 int k = 0, n, p = 0, w = 0;
1710 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£ */
1713 /* Wait for a keypress */
1714 (void)(Term_inkey(&ch, TRUE, TRUE));
1717 /* End "macro action" */
1718 if (ch == 30) parse_macro = FALSE;
1720 /* Inside "macro action" */
1721 if (ch == 30) return (ch);
1723 /* Inside "macro action" */
1724 if (parse_macro) return (ch);
1726 /* Inside "macro trigger" */
1727 if (parse_under) return (ch);
1730 /* Save the first key, advance */
1735 /* Check for possible macro */
1736 k = macro_find_check(buf);
1738 /* No macro pending */
1739 if (k < 0) return (ch);
1742 /* Wait for a macro, or a timeout */
1745 /* Check for pending macro */
1746 k = macro_find_maybe(buf);
1748 /* No macro pending */
1751 /* Check for (and remove) a pending key */
1752 if (0 == Term_inkey(&ch, FALSE, TRUE))
1754 /* Append the key */
1765 /* Increase "wait" */
1768 /* Excessive delay */
1769 if (w >= 100) break;
1772 Term_xtra(TERM_XTRA_DELAY, w);
1777 /* Check for available macro */
1778 k = macro_find_ready(buf);
1780 /* No macro available */
1783 /* Push all the keys back on the queue */
1786 /* Push the key, notice over-flow */
1787 if (Term_key_push(buf[--p])) return (0);
1790 /* Wait for (and remove) a pending key */
1791 (void)Term_inkey(&ch, TRUE, TRUE);
1793 /* Return the key */
1798 /* Get the pattern */
1799 pat = macro__pat[k];
1801 /* Get the length of the pattern */
1804 /* Push the "extra" keys back on the queue */
1807 /* Push the key, notice over-flow */
1808 if (Term_key_push(buf[--p])) return (0);
1812 /* Begin "macro action" */
1815 /* Push the "end of macro action" key */
1816 if (Term_key_push(30)) return (0);
1819 /* Access the macro action */
1820 act = macro__act[k];
1822 /* Get the length of the action */
1825 /* Push the macro "action" onto the key queue */
1828 /* Push the key, notice over-flow */
1829 if (Term_key_push(act[--n])) return (0);
1833 /* Hack -- Force "inkey()" to call us again */
1839 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1841 * This special pointer allows a sequence of keys to be "inserted" into
1842 * the stream of keys returned by "inkey()". This key sequence will not
1843 * trigger any macros, and cannot be bypassed by the Borg. It is used
1844 * in Angband to handle "keymaps".
1846 static cptr inkey_next = NULL;
1852 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1854 * This special function hook allows the "Borg" (see elsewhere) to take
1855 * control of the "inkey()" function, and substitute in fake keypresses.
1857 char (*inkey_hack)(int flush_first) = NULL;
1859 #endif /* ALLOW_BORG */
1864 * Get a keypress from the user.
1866 * This function recognizes a few "global parameters". These are variables
1867 * which, if set to TRUE before calling this function, will have an effect
1868 * on this function, and which are always reset to FALSE by this function
1869 * before this function returns. Thus they function just like normal
1870 * parameters, except that most calls to this function can ignore them.
1872 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1873 * and any macro processing in progress will be aborted. This flag is
1874 * set by the "flush()" function, which does not actually flush anything
1875 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1877 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1878 * keypress is available, instead of waiting for a keypress.
1880 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1881 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1882 * not return immediately, but will wait for a keypress for as long as the
1883 * normal macro matching code would, allowing the direct entry of macro
1884 * triggers. The "inkey_base" flag is extremely dangerous!
1886 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1887 * normal command, and we will only show the cursor if "hilite_player" is
1888 * TRUE (or if the player is in a store), instead of always showing the
1889 * cursor. The various "main-xxx.c" files should avoid saving the game
1890 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1891 * prevent savefile corruption.
1893 * If we are waiting for a keypress, and no keypress is ready, then we will
1894 * refresh (once) the window which was active when this function was called.
1896 * Note that "back-quote" is automatically converted into "escape" for
1897 * convenience on machines with no "escape" key. This is done after the
1898 * macro matching, so the user can still make a macro for "backquote".
1900 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1901 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1902 * provide support for simple keyboard "macros". These keys are so strange
1903 * that their loss as normal keys will probably be noticed by nobody. The
1904 * "ascii 30" key is used to indicate the "end" of a macro action, which
1905 * allows recursive macros to be avoided. The "ascii 31" key is used by
1906 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1908 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1909 * which can be used to give a variety of "sub-commands" which can be used
1910 * any time. These sub-commands could include commands to take a picture of
1911 * the current screen, to start/stop recording a macro action, etc.
1913 * If "angband_term[0]" is not active, we will make it active during this
1914 * function, so that the various "main-xxx.c" files can assume that input
1915 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1917 * Mega-Hack -- This function is used as the entry point for clearing the
1918 * "signal_count" variable, and of the "character_saved" variable.
1920 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1922 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1923 * control of the keyboard from the user.
1933 /* Hack -- Use the "inkey_next" pointer */
1934 if (inkey_next && *inkey_next && !inkey_xtra)
1936 /* Get next character, and advance */
1939 /* Cancel the various "global parameters" */
1940 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1946 /* Forget pointer */
1952 /* Mega-Hack -- Use the special hook */
1953 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1955 /* Cancel the various "global parameters" */
1956 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1962 #endif /* ALLOW_BORG */
1965 /* Hack -- handle delayed "flush()" */
1968 /* End "macro action" */
1969 parse_macro = FALSE;
1971 /* End "macro trigger" */
1972 parse_under = FALSE;
1974 /* Forget old keypresses */
1979 /* Access cursor state */
1980 (void)Term_get_cursor(&v);
1982 /* Show the cursor if waiting, except sometimes in "command" mode */
1983 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1985 /* Show the cursor */
1986 (void)Term_set_cursor(1);
1990 /* Hack -- Activate main screen */
1991 Term_activate(angband_term[0]);
1997 /* Hack -- Handle "inkey_scan" */
1998 if (!inkey_base && inkey_scan &&
1999 (0 != Term_inkey(&kk, FALSE, FALSE)))
2005 /* Hack -- Flush output once when no key ready */
2006 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
2008 /* Hack -- activate proper term */
2014 /* Hack -- activate main screen */
2015 Term_activate(angband_term[0]);
2017 /* Mega-Hack -- reset saved flag */
2018 character_saved = FALSE;
2020 /* Mega-Hack -- reset signal counter */
2028 /* Hack -- Handle "inkey_base" */
2036 /* Wait for (and remove) a pending key */
2037 if (0 == Term_inkey(&ch, TRUE, TRUE))
2050 /* Check for (and remove) a pending key */
2051 if (0 == Term_inkey(&ch, FALSE, TRUE))
2060 /* Increase "wait" */
2063 /* Excessive delay */
2064 if (w >= 100) break;
2067 Term_xtra(TERM_XTRA_DELAY, w);
2076 /* Get a key (see above) */
2080 /* Handle "control-right-bracket" */
2083 /* Strip this key */
2091 /* Treat back-quote as escape */
2092 /* if (ch == '`') ch = ESCAPE; */
2095 /* End "macro trigger" */
2096 if (parse_under && (ch <= 32))
2098 /* Strip this key */
2101 /* End "macro trigger" */
2102 parse_under = FALSE;
2106 /* Handle "control-caret" */
2109 /* Strip this key */
2113 /* Handle "control-underscore" */
2116 /* Strip this key */
2119 /* Begin "macro trigger" */
2123 /* Inside "macro trigger" */
2124 else if (parse_under)
2126 /* Strip this key */
2132 /* Hack -- restore the term */
2136 /* Restore the cursor */
2140 /* Cancel the various "global parameters" */
2141 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
2143 /* Return the keypress */
2151 * We use a global array for all inscriptions to reduce the memory
2152 * spent maintaining inscriptions. Of course, it is still possible
2153 * to run out of inscription memory, especially if too many different
2154 * inscriptions are used, but hopefully this will be rare.
2156 * We use dynamic string allocation because otherwise it is necessary
2157 * to pre-guess the amount of quark activity. We limit the total
2158 * number of quarks, but this is much easier to "expand" as needed.
2160 * Any two items with the same inscription will have the same "quark"
2161 * index, which should greatly reduce the need for inscription space.
2163 * Note that "quark zero" is NULL and should not be "dereferenced".
2167 * Add a new "quark" to the set of quarks.
2169 s16b quark_add(cptr str)
2173 /* Look for an existing quark */
2174 for (i = 1; i < quark__num; i++)
2176 /* Check for equality */
2177 if (streq(quark__str[i], str)) return (i);
2180 /* Paranoia -- Require room */
2181 if (quark__num == QUARK_MAX) return (0);
2183 /* New maximal quark */
2186 /* Add a new quark */
2187 quark__str[i] = string_make(str);
2189 /* Return the index */
2195 * This function looks up a quark
2197 cptr quark_str(s16b i)
2202 if ((i < 0) || (i >= quark__num)) i = 0;
2204 /* Access the quark */
2207 /* Return the quark */
2215 * Second try for the "message" handling routines.
2217 * Each call to "message_add(s)" will add a new "most recent" message
2218 * to the "message recall list", using the contents of the string "s".
2220 * The messages will be stored in such a way as to maximize "efficiency",
2221 * that is, we attempt to maximize the number of sequential messages that
2222 * can be retrieved, given a limited amount of storage space.
2224 * We keep a buffer of chars to hold the "text" of the messages, not
2225 * necessarily in "order", and an array of offsets into that buffer,
2226 * representing the actual messages. This is made more complicated
2227 * by the fact that both the array of indexes, and the buffer itself,
2228 * are both treated as "circular arrays" for efficiency purposes, but
2229 * the strings may not be "broken" across the ends of the array.
2231 * The "message_add()" function is rather "complex", because it must be
2232 * extremely efficient, both in space and time, for use with the Borg.
2238 * How many messages are "available"?
2240 s16b message_num(void)
2244 /* Extract the indexes */
2245 last = message__last;
2246 next = message__next;
2249 if (next < last) next += MESSAGE_MAX;
2251 /* Extract the space */
2254 /* Return the result */
2261 * Recall the "text" of a saved message
2263 cptr message_str(int age)
2269 /* Forgotten messages have no text */
2270 if ((age < 0) || (age >= message_num())) return ("");
2272 /* Acquire the "logical" index */
2273 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2275 /* Get the "offset" for the message */
2276 o = message__ptr[x];
2278 /* Access the message text */
2279 s = &message__buf[o];
2281 /* Return the message text */
2288 * Add a new message, with great efficiency
2290 void message_add(cptr str)
2298 /*** Step 1 -- Analyze the message ***/
2300 /* Hack -- Ignore "non-messages" */
2303 /* Message length */
2306 /* Important Hack -- Ignore "long" messages */
2307 if (n >= MESSAGE_BUF / 4) return;
2309 /* extra step -- split the message if n>80. (added by Mogami) */
2314 for (n = 0; n < 80; n++, t++)
2319 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2321 for (n = 80; n > 60; n--)
2322 if (str[n] == ' ') break;
2326 splitted2 = str + n;
2327 strncpy(splitted1, str ,n);
2328 splitted1[n] = '\0';
2334 /*** Step 2 -- Attempt to optimize ***/
2336 /* Limit number of messages to check */
2341 /* Limit number of messages to check */
2342 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2344 /* Check previous message */
2345 for (i = message__next; m; m--)
2354 /* Back up and wrap if needed */
2355 if (i-- == 0) i = MESSAGE_MAX - 1;
2357 /* Access the old string */
2358 old = &message__buf[message__ptr[i]];
2360 /* Skip small messages */
2367 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2368 if( iskanji(*t))t++;
2370 for (t = buf; *t && (*t != '<'); t++);
2375 /* Message is too small */
2376 if (strlen(buf) < 6) break;
2378 /* Drop the space */
2381 /* Get multiplier */
2385 /* Limit the multiplier to 1000 */
2386 if (buf && streq(buf, str) && (j < 1000))
2396 sprintf(u, "%s <x%d>", buf, j);
2398 /* Message length */
2401 if (!now_message) now_message++;
2405 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
2413 /* Check the last few messages (if any to count) */
2414 for (i = message__next; k; k--)
2420 /* Back up and wrap if needed */
2421 if (i-- == 0) i = MESSAGE_MAX - 1;
2423 /* Stop before oldest message */
2424 if (i == message__last) break;
2426 /* Extract "distance" from "head" */
2427 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2429 /* Do not optimize over large distance */
2430 if (q > MESSAGE_BUF / 2) continue;
2432 /* Access the old string */
2433 old = &message__buf[message__ptr[i]];
2436 if (!streq(old, str)) continue;
2438 /* Get the next message index, advance */
2439 x = message__next++;
2442 if (message__next == MESSAGE_MAX) message__next = 0;
2444 /* Kill last message if needed */
2445 if (message__next == message__last) message__last++;
2448 if (message__last == MESSAGE_MAX) message__last = 0;
2450 /* Assign the starting address */
2451 message__ptr[x] = message__ptr[i];
2455 goto end_of_message_add;
2460 /*** Step 3 -- Ensure space before end of buffer ***/
2462 /* Kill messages and Wrap if needed */
2463 if (message__head + n + 1 >= MESSAGE_BUF)
2465 /* Kill all "dead" messages */
2466 for (i = message__last; TRUE; i++)
2468 /* Wrap if needed */
2469 if (i == MESSAGE_MAX) i = 0;
2471 /* Stop before the new message */
2472 if (i == message__next) break;
2474 /* Kill "dead" messages */
2475 if (message__ptr[i] >= message__head)
2477 /* Track oldest message */
2478 message__last = i + 1;
2482 /* Wrap "tail" if needed */
2483 if (message__tail >= message__head) message__tail = 0;
2490 /*** Step 4 -- Ensure space before next message ***/
2492 /* Kill messages if needed */
2493 if (message__head + n + 1 > message__tail)
2495 /* Grab new "tail" */
2496 message__tail = message__head + n + 1;
2498 /* Advance tail while possible past first "nul" */
2499 while (message__buf[message__tail-1]) message__tail++;
2501 /* Kill all "dead" messages */
2502 for (i = message__last; TRUE; i++)
2504 /* Wrap if needed */
2505 if (i == MESSAGE_MAX) i = 0;
2507 /* Stop before the new message */
2508 if (i == message__next) break;
2510 /* Kill "dead" messages */
2511 if ((message__ptr[i] >= message__head) &&
2512 (message__ptr[i] < message__tail))
2514 /* Track oldest message */
2515 message__last = i + 1;
2521 /*** Step 5 -- Grab a new message index ***/
2523 /* Get the next message index, advance */
2524 x = message__next++;
2527 if (message__next == MESSAGE_MAX) message__next = 0;
2529 /* Kill last message if needed */
2530 if (message__next == message__last) message__last++;
2533 if (message__last == MESSAGE_MAX) message__last = 0;
2537 /*** Step 6 -- Insert the message text ***/
2539 /* Assign the starting address */
2540 message__ptr[x] = message__head;
2542 /* Append the new part of the message */
2543 for (i = 0; i < n; i++)
2545 /* Copy the message */
2546 message__buf[message__head + i] = str[i];
2550 message__buf[message__head + i] = '\0';
2552 /* Advance the "head" pointer */
2553 message__head += n + 1;
2555 /* recursively add splitted message (added by Mogami) */
2557 if (splitted2 != NULL)
2558 message_add(splitted2);
2566 static void msg_flush(int x)
2568 byte a = TERM_L_BLUE;
2569 bool nagasu = FALSE;
2571 if ((auto_more && !now_damaged) || num_more < 0){
2573 for (i = 0; i < 8; i++)
2575 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2579 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2586 now_damaged = FALSE;
2588 if (!alive || !nagasu)
2590 /* Pause for response */
2592 Term_putstr(x, 0, -1, a, "-³¤¯-");
2594 Term_putstr(x, 0, -1, a, "-more-");
2598 /* Get an acceptable keypress */
2602 if (cmd == ESCAPE) {
2603 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£ */
2605 } else if (cmd == ' ') {
2606 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
2608 } else if ((cmd == '\n') || (cmd == '\r')) {
2609 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
2612 if (quick_messages) break;
2617 /* Clear the line */
2618 Term_erase(0, 0, 255);
2623 * Output a message to the top line of the screen.
2625 * Break long messages into multiple pieces (40-72 chars).
2627 * Allow multiple short messages to "share" the top line.
2629 * Prompt the user to make sure he has a chance to read them.
2631 * These messages are memorized for later reference (see above).
2633 * We could do "Term_fresh()" to provide "flicker" if needed.
2635 * The global "msg_flag" variable can be cleared to tell us to
2636 * "erase" any "pending" messages still on the screen.
2638 * XXX XXX XXX Note that we must be very careful about using the
2639 * "msg_print()" functions without explicitly calling the special
2640 * "msg_print(NULL)" function, since this may result in the loss
2641 * of information if the screen is cleared, or if anything is
2642 * displayed on the top line.
2644 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2645 * even if no messages are pending. This is probably a hack.
2647 void msg_print(cptr msg)
2657 if (world_monster) return;
2661 /* Clear the line */
2662 Term_erase(0, 0, 255);
2666 /* Message Length */
2667 n = (msg ? strlen(msg) : 0);
2669 /* Hack -- flush when requested or needed */
2670 if (p && (!msg || ((p + n) > 72)))
2687 if (n > 1000) return;
2690 /* Memorize the message */
2691 if (character_generated) message_add(msg);
2697 /* Analyze the buffer */
2704 int check, split = 72;
2707 bool k_flag = FALSE;
2710 /* Find the "best" split point */
2711 for (check = 0; check < 72; check++)
2719 /* Found a valid split point */
2720 if (iskanji(t[check]))
2725 else if (t[check] == ' ')
2738 /* Find the "best" split point */
2739 for (check = 40; check < 72; check++)
2741 /* Found a valid split point */
2742 if (t[check] == ' ') split = check;
2746 /* Save the split character */
2749 /* Split the message */
2752 /* Display part of the message */
2753 Term_putstr(0, 0, split, TERM_WHITE, t);
2756 msg_flush(split + 1);
2758 /* Memorize the piece */
2759 /* if (character_generated) message_add(t); */
2761 /* Restore the split character */
2764 /* Insert a space */
2767 /* Prepare to recurse on the rest of "buf" */
2768 t += split; n -= split;
2772 /* Display the tail of the message */
2773 Term_putstr(p, 0, n, TERM_WHITE, t);
2775 /* Memorize the tail */
2776 /* if (character_generated) message_add(t); */
2779 p_ptr->window |= (PW_MESSAGE);
2782 /* Remember the message */
2785 /* Remember the position */
2793 /* Optional refresh */
2794 if (fresh_message) Term_fresh();
2799 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2801 static int screen_depth = 0;
2805 * Save the screen, and increase the "icky" depth.
2807 * This function must match exactly one call to "screen_load()".
2809 void screen_save(void)
2811 /* Hack -- Flush messages */
2814 /* Save the screen (if legal) */
2815 if (screen_depth++ == 0) Term_save();
2817 /* Increase "icky" depth */
2823 * Load the screen, and decrease the "icky" depth.
2825 * This function must match exactly one call to "screen_save()".
2827 void screen_load(void)
2829 /* Hack -- Flush messages */
2832 /* Load the screen (if legal) */
2833 if (--screen_depth == 0) Term_load();
2835 /* Decrease "icky" depth */
2841 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2843 void msg_format(cptr fmt, ...)
2849 /* Begin the Varargs Stuff */
2852 /* Format the args, save the length */
2853 (void)vstrnfmt(buf, 1024, fmt, vp);
2855 /* End the Varargs Stuff */
2865 * Display a string on the screen using an attribute.
2867 * At the given location, using the given attribute, if allowed,
2868 * add the given string. Do not clear the line.
2870 void c_put_str(byte attr, cptr str, int row, int col)
2872 /* Position cursor, Dump the attr/text */
2873 Term_putstr(col, row, -1, attr, str);
2877 * As above, but in "white"
2879 void put_str(cptr str, int row, int col)
2882 Term_putstr(col, row, -1, TERM_WHITE, str);
2888 * Display a string on the screen using an attribute, and clear
2889 * to the end of the line.
2891 void c_prt(byte attr, cptr str, int row, int col)
2893 /* Clear line, position cursor */
2894 Term_erase(col, row, 255);
2896 /* Dump the attr/text */
2897 Term_addstr(-1, attr, str);
2901 * As above, but in "white"
2903 void prt(cptr str, int row, int col)
2906 c_prt(TERM_WHITE, str, row, col);
2913 * Print some (colored) text to the screen at the current cursor position,
2914 * automatically "wrapping" existing text (at spaces) when necessary to
2915 * avoid placing any text into the last column, and clearing every line
2916 * before placing any text in that line. Also, allow "newline" to force
2917 * a "wrap" to the next line. Advance the cursor as needed so sequential
2918 * calls to this function will work correctly.
2920 * Once this function has been called, the cursor should not be moved
2921 * until all the related "c_roff()" calls to the window are complete.
2923 * This function will correctly handle any width up to the maximum legal
2924 * value of 256, though it works best for a standard 80 character width.
2926 void c_roff(byte a, cptr str)
2934 /* Obtain the size */
2935 (void)Term_get_size(&w, &h);
2937 /* Obtain the cursor */
2938 (void)Term_locate(&x, &y);
2940 /* Hack -- No more space */
2941 if( y == h - 1 && x > w - 3) return;
2943 /* Process the string */
2944 for (s = str; *s; s++)
2949 int k_flag = iskanji(*s);
2961 /* Clear line, move cursor */
2962 Term_erase(x, y, 255);
2965 /* Clean up the char */
2967 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2969 ch = (isprint(*s) ? *s : ' ');
2973 /* Wrap words as needed */
2975 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2977 if ((x >= w - 1) && (ch != ' '))
2990 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
2994 /* Scan existing text */
2995 for (i = w - 2; i >= 0; i--)
2997 /* Grab existing attr/char */
2998 Term_what(i, y, &av[i], &cv[i]);
3000 /* Break on space */
3001 if (cv[i] == ' ') break;
3003 /* Track current word */
3006 if (cv[i] == '(') break;
3014 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
3015 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
3016 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
3017 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
3018 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
3021 Term_what(x , y, &av[x ], &cv[x ]);
3022 Term_what(x-1, y, &av[x-1], &cv[x-1]);
3023 Term_what(x-2, y, &av[x-2], &cv[x-2]);
3034 Term_erase(n, y, 255);
3043 /* Clear line, move cursor */
3044 Term_erase(x, y, 255);
3046 /* Wrap the word (if any) */
3047 for (i = n; i < w - 1; i++)
3050 if( cv[i] == '\0' ) break;
3053 Term_addch(av[i], cv[i]);
3055 /* Advance (no wrap) */
3062 Term_addch((byte)(a|0x10), ch);
3074 Term_addch((byte)(a|0x20), ch);
3083 * As above, but in "white"
3088 c_roff(TERM_WHITE, str);
3095 * Clear part of the screen
3097 void clear_from(int row)
3101 /* Erase requested rows */
3102 for (y = row; y < Term->hgt; y++)
3104 /* Erase part of the screen */
3105 Term_erase(0, y, 255);
3113 * Get some input at the cursor location.
3114 * Assume the buffer is initialized to a default string.
3115 * Note that this string is often "empty" (see below).
3116 * The default buffer is displayed in yellow until cleared.
3117 * Pressing RETURN right away accepts the default entry.
3118 * Normal chars clear the default and append the char.
3119 * Backspace clears the default or deletes the final char.
3120 * ESCAPE clears the buffer and the window and returns FALSE.
3121 * RETURN accepts the current buffer contents and returns TRUE.
3123 bool askfor_aux(char *buf, int len)
3137 /* Locate the cursor */
3138 Term_locate(&x, &y);
3141 /* Paranoia -- check len */
3142 if (len < 1) len = 1;
3144 /* Paranoia -- check column */
3145 if ((x < 0) || (x >= 80)) x = 0;
3147 /* Restrict the length */
3148 if (x + len > 80) len = 80 - x;
3151 /* Paranoia -- Clip the default entry */
3155 /* Display the default answer */
3156 Term_erase(x, y, len);
3157 Term_putstr(x, y, -1, TERM_YELLOW, buf);
3164 Term_gotoxy(x + k, y);
3169 /* Analyze the key */
3200 { /* ÊÒ»³¤µ¤óºîÀ® */
3214 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3216 if(k<len && isprint(i)){
3225 if ((k < len) && (isprint(i)))
3241 /* Update the entry */
3242 Term_erase(x, y, len);
3243 Term_putstr(x, y, -1, TERM_WHITE, buf);
3247 if (i == ESCAPE) return (FALSE);
3255 * Get a string from the user
3257 * The "prompt" should take the form "Prompt: "
3259 * Note that the initial contents of the string is used as
3260 * the default response, so be sure to "clear" it if needed.
3262 * We clear the input, and return FALSE, on "ESCAPE".
3264 bool get_string(cptr prompt, char *buf, int len)
3268 /* Paranoia XXX XXX XXX */
3271 /* Display prompt */
3274 /* Ask the user for a string */
3275 res = askfor_aux(buf, len);
3286 * Verify something with the user
3288 * The "prompt" should take the form "Query? "
3290 * Note that "[y/n]" is appended to the prompt.
3292 bool get_check(cptr prompt)
3294 return get_check_strict(prompt, 0);
3298 * Verify something with the user strictly
3300 * mode & 0x01 : force user to answer "YES" or "N"
3301 * mode & 0x02 : don't allow ESCAPE key
3303 bool get_check_strict(cptr prompt, int mode)
3310 p_ptr->window |= PW_MESSAGE;
3315 /* Paranoia XXX XXX XXX */
3318 if (!rogue_like_commands)
3322 /* Hack -- Build a "useful" prompt */
3326 /* (79-8)¥Ð¥¤¥È¤Î»ØÄê, prompt¤¬Ä¹¤«¤Ã¤¿¾ì¹ç,
3327 (79-9)ʸ»ú¤Î¸å½ªÃ¼Ê¸»ú¤¬½ñ¤¹þ¤Þ¤ì¤ë.
3328 ±Ñ¸ì¤ÎÊý¤Îstrncpy¤È¤Ï°ã¤¦¤Î¤ÇÃí°Õ.
3329 else¤ÎÊý¤Îʬ´ô¤âƱÍÍ. --henkma
3331 mb_strlcpy(buf, prompt, 80-8);
3333 strncpy(buf, prompt, 79-8);
3336 strcat(buf, "[yes/no]");
3341 mb_strlcpy(buf, prompt, 80-5);
3343 strncpy(buf, prompt, 79-5);
3346 strcat(buf, "[y/n]");
3352 /* Get an acceptable answer */
3357 if (i == 'y' || i == 'Y')
3364 prt("y (YES¤ÈÆþÎϤ·¤Æ¤¯¤À¤µ¤¤)", 0, strlen(buf));
3366 prt("y (Please answer YES.)", 0, strlen(buf));
3369 if (i == 'e' || i == 'E')
3372 prt("e (YES¤ÈÆþÎϤ·¤Æ¤¯¤À¤µ¤¤)", 0, strlen(buf)+1);
3374 prt("e (Please answer YES.)", 0, strlen(buf)+1);
3377 if (i == 's' || i == 'S')
3382 prt("", 0, strlen(buf)+1);
3384 prt("", 0, strlen(buf));
3387 if (!(mode & 2) && (i == ESCAPE)) break;
3388 if (strchr("Nn", i)) break;
3392 /* Erase the prompt */
3395 /* Normal negation */
3396 if ((i != 'Y') && (i != 'y')) return (FALSE);
3404 * Prompts for a keypress
3406 * The "prompt" should take the form "Command: "
3408 * Returns TRUE unless the character is "Escape"
3410 bool get_com(cptr prompt, char *command, bool z_escape)
3412 /* Paranoia XXX XXX XXX */
3415 /* Display a prompt */
3421 /* Clear the prompt */
3424 /* Handle "cancel" */
3425 if (*command == ESCAPE) return (FALSE);
3426 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3434 * Request a "quantity" from the user
3436 * Hack -- allow "command_arg" to specify a quantity
3438 s16b get_quantity(cptr prompt, int max)
3447 /* Use "command_arg" */
3450 /* Extract a number */
3453 /* Clear "command_arg" */
3456 /* Enforce the maximum */
3457 if (amt > max) amt = max;
3463 #ifdef ALLOW_REPEAT /* TNB */
3465 /* Get the item index */
3466 if ((max != 1) && repeat_pull(&amt))
3468 /* Enforce the maximum */
3469 if (amt > max) amt = max;
3471 /* Enforce the minimum */
3472 if (amt < 0) amt = 0;
3478 #endif /* ALLOW_REPEAT -- TNB */
3480 /* Build a prompt if needed */
3483 /* Build a prompt */
3485 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3487 sprintf(tmp, "Quantity (1-%d): ", max);
3491 /* Use that prompt */
3496 /* Default to one */
3499 /* Build the default */
3500 sprintf(buf, "%d", amt);
3502 /* Ask for a quantity */
3503 if (!get_string(prompt, buf, 6)) return (0);
3505 /* Extract a number */
3508 /* A letter means "all" */
3509 if (isalpha(buf[0])) amt = max;
3511 /* Enforce the maximum */
3512 if (amt > max) amt = max;
3514 /* Enforce the minimum */
3515 if (amt < 0) amt = 0;
3517 #ifdef ALLOW_REPEAT /* TNB */
3519 if (amt) repeat_push(amt);
3521 #endif /* ALLOW_REPEAT -- TNB */
3523 /* Return the result */
3529 * Pause for user response XXX XXX XXX
3531 void pause_line(int row)
3536 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3538 put_str("[Press any key to continue]", row, 23);
3547 * Hack -- special buffer to hold the action of the current keymap
3549 static char request_command_buffer[256];
3561 menu_naiyou menu_info[10][10] =
3564 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3566 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3567 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3569 {"Èâ/È¢", 6, FALSE},
3572 {"¤½¤Î¾", 9, FALSE},
3577 {"»È¤¦(m)", 'm', TRUE},
3578 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3579 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3580 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3590 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3591 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3592 {"õ¤¹(s)", 's', TRUE},
3593 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3594 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3595 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3596 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3597 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3598 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3599 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3603 {"Æɤà(r)", 'r', TRUE},
3604 {"°û¤à(q)", 'q', TRUE},
3605 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3606 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3607 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3608 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3609 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3610 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3611 {"Åꤲ¤ë(v)", 'v', TRUE},
3616 {"½¦¤¦(g)", 'g', TRUE},
3617 {"Íî¤È¤¹(d)", 'd', TRUE},
3618 {"²õ¤¹(k/^d)", 'k', TRUE},
3619 {"Ìäò¹ï¤à({)", '{', TRUE},
3620 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3621 {"Ä´ºº(I)", 'I', TRUE},
3622 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3629 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3630 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3631 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3632 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3642 {"³«¤±¤ë(o)", 'o', TRUE},
3643 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3644 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3645 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3655 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3656 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3657 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3658 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3659 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3660 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3661 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3662 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3663 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3668 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3669 {"¥Þ¥¯¥í(@)", '@', TRUE},
3670 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3671 {"¥«¥é¡¼(&)", '&', TRUE},
3672 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3673 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3674 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3681 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3682 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3683 {"¥Ø¥ë¥×(?)", '?', TRUE},
3684 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3685 {"¥á¥â(:)", ':', TRUE},
3686 {"µÇ°»£±Æ())", ')', TRUE},
3687 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3688 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3689 {"°úÂह¤ë(Q)", 'Q', TRUE},
3694 menu_naiyou menu_info[10][10] =
3697 {"Magic/Special", 1, FALSE},
3698 {"Action", 2, FALSE},
3699 {"Items(use)", 3, FALSE},
3700 {"Items(other)", 4, FALSE},
3701 {"Equip", 5, FALSE},
3702 {"Door/Box", 6, FALSE},
3703 {"Infomations", 7, FALSE},
3704 {"Options", 8, FALSE},
3705 {"Other commands", 9, FALSE},
3710 {"Use(m)", 'm', TRUE},
3711 {"See tips(b/P)", 'b', TRUE},
3712 {"Study(G)", 'G', TRUE},
3713 {"Special abilities(U/O)", 'U', TRUE},
3723 {"Rest(R)", 'R', TRUE},
3724 {"Disarm a trap(D)", 'D', TRUE},
3725 {"Search(s)", 's', TRUE},
3726 {"Look(l/x)", 'l', TRUE},
3727 {"Target(*)", '*', TRUE},
3728 {"Dig(T/^t)", 'T', TRUE},
3729 {"Go up stairs(<)", '<', TRUE},
3730 {"Go down staies(>)", '>', TRUE},
3731 {"Command pets(p)", 'p', TRUE},
3732 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3736 {"Read a scroll(r)", 'r', TRUE},
3737 {"Drink a potion(q)", 'q', TRUE},
3738 {"Use a staff(u/Z)", 'u', TRUE},
3739 {"Aim a wand(a/z)", 'a', TRUE},
3740 {"Zap a rod(z/a)", 'z', TRUE},
3741 {"Activate an equipment(A)", 'A', TRUE},
3742 {"Eat(E)", 'E', TRUE},
3743 {"Fire missile weapon(f/t)", 'f', TRUE},
3744 {"Throw an item(v)", 'v', TRUE},
3749 {"Get items(g)", 'g', TRUE},
3750 {"Drop an item(d)", 'd', TRUE},
3751 {"Destroy an item(k/^d)", 'k', TRUE},
3752 {"Inscribe an item({)", '{', TRUE},
3753 {"Uninscribe an item(})", '}', TRUE},
3754 {"Info about an item(I)", 'I', TRUE},
3755 {"Inventory list(i)", 'i', TRUE},
3762 {"Wear(w)", 'w', TRUE},
3763 {"Take off(t/T)", 't', TRUE},
3764 {"Refuel(F)", 'F', TRUE},
3765 {"Equipment list(e)", 'e', TRUE},
3775 {"Open(o)", 'o', TRUE},
3776 {"Close(c)", 'c', TRUE},
3777 {"Bash a door(B/f)", 'B', TRUE},
3778 {"Jam a door(j/S)", 'j', TRUE},
3788 {"Full map(M)", 'M', TRUE},
3789 {"Map(L/W)", 'L', TRUE},
3790 {"Level feeling(^f)", KTRL('F'), TRUE},
3791 {"Character status(C)", 'C', TRUE},
3792 {"Identify symbol(/)", '/', TRUE},
3793 {"Show prev messages(^p)", KTRL('P'), TRUE},
3794 {"Current time(^t/')", KTRL('T'), TRUE},
3795 {"Various infomations(~)", '~', TRUE},
3796 {"Play record menu(|)", '|', TRUE},
3801 {"Set options(=)", '=', TRUE},
3802 {"Interact with macros(@)", '@', TRUE},
3803 {"Interact w/ visuals(%)", '%', TRUE},
3804 {"Interact with colors(&)", '&', TRUE},
3805 {"Enter a user pref(\")", '\"', TRUE},
3806 {"Reload auto-pick pref($)", '$', TRUE},
3814 {"Save and quit(^x)", KTRL('X'), TRUE},
3815 {"Save(^s)", KTRL('S'), TRUE},
3816 {"Help(obsoleted)(?)", '?', TRUE},
3817 {"Redraw(^r)", KTRL('R'), TRUE},
3818 {"Take note(:)", ':', TRUE},
3819 {"Dump screen dump(()", ')', TRUE},
3820 {"Load screen dump())", '(', TRUE},
3821 {"Version info(V)", 'V', TRUE},
3822 {"Quit(Q)", 'Q', TRUE},
3835 } special_menu_naiyou;
3837 #define MENU_CLASS 1
3841 special_menu_naiyou special_menu_info[] =
3843 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3844 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3845 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3846 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3847 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3848 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3849 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3853 special_menu_naiyou special_menu_info[] =
3855 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3856 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3857 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3858 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3859 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3860 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3861 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3867 * Request a command from the user.
3869 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
3870 * p_ptr->command_arg. May modify p_ptr->command_new.
3872 * Note that "caret" ("^") is treated specially, and is used to
3873 * allow manual input of control characters. This can be used
3874 * on many machines to request repeated tunneling (Ctrl-H) and
3875 * on the Macintosh to request "Control-Caret".
3877 * Note that "backslash" is treated specially, and is used to bypass any
3878 * keymap entry for the following character. This is useful for macros.
3880 * Note that this command is used both in the dungeon and in
3881 * stores, and must be careful to work in both situations.
3883 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
3885 void request_command(int shopping)
3899 if (rogue_like_commands)
3901 mode = KEYMAP_MODE_ROGUE;
3907 mode = KEYMAP_MODE_ORIG;
3911 /* No command yet */
3914 /* No "argument" yet */
3917 /* No "direction" yet */
3926 /* Hack -- auto-commands */
3929 /* Flush messages */
3932 /* Use auto-command */
3933 cmd = (unsigned char)command_new;
3939 /* Get a keypress in "command" mode */
3944 /* Hack -- no flush needed */
3948 /* Activate "command mode" */
3954 if (!shopping && command_menu && ((sub_cmd == '\r') || (sub_cmd == 'x') || (sub_cmd == 'X'))
3955 && !keymap_act[mode][(byte)(sub_cmd)])
3958 int num = 0, max_num, old_num = 0;
3962 if (py - panel_row_min > 10) basey = 2;
3966 /* Clear top line */
3974 if (!menu) old_num = num;
3975 put_str("+----------------------------------------------------+", basey, basex);
3976 put_str("| |", basey+1, basex);
3977 put_str("| |", basey+2, basex);
3978 put_str("| |", basey+3, basex);
3979 put_str("| |", basey+4, basex);
3980 put_str("| |", basey+5, basex);
3981 put_str("+----------------------------------------------------+", basey+6, basex);
3983 for(i = 0; i < 10; i++)
3986 if (!menu_info[menu][i].cmd) break;
3987 menu_name = menu_info[menu][i].name;
3988 for(hoge = 0; ; hoge++)
3990 if (!special_menu_info[hoge].name[0]) break;
3991 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3992 switch(special_menu_info[hoge].jouken)
3995 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3998 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
4000 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
4007 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
4010 kisuu = max_num % 2;
4012 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
4014 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
4017 /* Place the cursor on the player */
4018 move_cursor_relative(py, px);
4022 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r'))
4024 if (menu_info[menu][num].fin)
4026 cmd = menu_info[menu][num].cmd;
4032 menu = menu_info[menu][num].cmd;
4038 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
4055 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
4060 num = (num + 2) % (max_num - 1);
4062 num = (num + 2) % (max_num + 1);
4064 else num = (num + 2) % max_num;
4066 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
4071 num = (num + max_num - 3) % (max_num - 1);
4073 num = (num + max_num - 1) % (max_num + 1);
4075 else num = (num + max_num - 2) % max_num;
4077 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
4079 if ((num % 2) || (num == max_num - 1))
4083 else if (num < max_num - 1)
4091 if (!inkey_next) inkey_next = "";
4096 /* Clear top line */
4103 int old_arg = command_arg;
4108 /* Begin the input */
4110 prt("²ó¿ô: ", 0, 0);
4112 prt("Count: ", 0, 0);
4116 /* Get a command count */
4119 /* Get a new keypress */
4122 /* Simple editing (delete or backspace) */
4123 if ((cmd == 0x7F) || (cmd == KTRL('H')))
4125 /* Delete a digit */
4126 command_arg = command_arg / 10;
4128 /* Show current count */
4130 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4132 prt(format("Count: %d", command_arg), 0, 0);
4137 /* Actual numeric data */
4138 else if (cmd >= '0' && cmd <= '9')
4140 /* Stop count at 9999 */
4141 if (command_arg >= 1000)
4150 /* Increase count */
4153 /* Incorporate that digit */
4154 command_arg = command_arg * 10 + D2I(cmd);
4157 /* Show current count */
4159 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4161 prt(format("Count: %d", command_arg), 0, 0);
4166 /* Exit on "unusable" input */
4173 /* Hack -- Handle "zero" */
4174 if (command_arg == 0)
4179 /* Show current count */
4181 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4183 prt(format("Count: %d", command_arg), 0, 0);
4188 /* Hack -- Handle "old_arg" */
4191 /* Restore old_arg */
4192 command_arg = old_arg;
4194 /* Show current count */
4196 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4198 prt(format("Count: %d", command_arg), 0, 0);
4203 /* Hack -- white-space means "enter command now" */
4204 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
4206 /* Get a real command */
4208 if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
4210 if (!get_com("Command: ", (char *)&cmd, FALSE))
4224 /* Allow "keymaps" to be bypassed */
4227 /* Get a real command */
4229 (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
4231 (void)get_com("Command: ", (char *)&cmd, FALSE);
4235 /* Hack -- bypass keymaps */
4236 if (!inkey_next) inkey_next = "";
4240 /* Allow "control chars" to be entered */
4243 /* Get a new command and controlify it */
4245 if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4247 if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4253 /* Look up applicable keymap */
4254 act = keymap_act[mode][(byte)(cmd)];
4256 /* Apply keymap if not inside a keymap already */
4257 if (act && !inkey_next)
4259 /* Install the keymap (limited buffer size) */
4260 (void)strnfmt(request_command_buffer, 256, "%s", act);
4262 /* Start using the buffer */
4263 inkey_next = request_command_buffer;
4281 /* Hack -- Auto-repeat certain commands */
4282 if (always_repeat && (command_arg <= 0))
4284 /* Hack -- auto repeat certain commands */
4285 if (strchr("TBDoc+", command_cmd))
4287 /* Repeat 99 times */
4296 switch (command_cmd)
4298 /* Command "p" -> "purchase" (get) */
4299 case 'p': command_cmd = 'g'; break;
4301 /* Command "m" -> "purchase" (get) */
4302 case 'm': command_cmd = 'g'; break;
4304 /* Command "s" -> "sell" (drop) */
4305 case 's': command_cmd = 'd'; break;
4310 for (i = 0; i < 256; i++)
4313 if ((s = keymap_act[mode][i]) != NULL)
4315 if (*s == command_cmd && *(s+1) == 0)
4323 caretcmd = command_cmd;
4325 /* Hack -- Scan equipment */
4326 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4330 object_type *o_ptr = &inventory[i];
4332 /* Skip non-objects */
4333 if (!o_ptr->k_idx) continue;
4335 /* No inscription */
4336 if (!o_ptr->inscription) continue;
4338 /* Obtain the inscription */
4339 s = quark_str(o_ptr->inscription);
4344 /* Process preventions */
4347 /* Check the "restriction" character */
4349 if ((s[1] == caretcmd) || (s[1] == '*'))
4351 if ((s[1] == command_cmd) || (s[1] == '*'))
4355 /* Hack -- Verify command */
4357 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4359 if (!get_check("Are you sure? "))
4363 /* Hack -- Use space */
4368 /* Find another '^' */
4369 s = strchr(s + 1, '^');
4374 /* Hack -- erase the message line. */
4381 * Check a char for "vowel-hood"
4383 bool is_a_vowel(int ch)
4408 * Replace the first instance of "target" in "buf" with "insert"
4409 * If "insert" is NULL, just remove the first instance of "target"
4410 * In either case, return TRUE if "target" is found.
4412 * XXX Could be made more efficient, especially in the
4413 * case where "insert" is smaller than "target".
4415 static bool insert_str(char *buf, cptr target, cptr insert)
4418 int b_len, t_len, i_len;
4420 /* Attempt to find the target (modify "buf") */
4421 buf = strstr(buf, target);
4423 /* No target found */
4424 if (!buf) return (FALSE);
4426 /* Be sure we have an insertion string */
4427 if (!insert) insert = "";
4429 /* Extract some lengths */
4430 t_len = strlen(target);
4431 i_len = strlen(insert);
4432 b_len = strlen(buf);
4434 /* How much "movement" do we need? */
4435 len = i_len - t_len;
4437 /* We need less space (for insert) */
4440 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4443 /* We need more space (for insert) */
4446 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4449 /* If movement occured, we need a new terminator */
4450 if (len) buf[b_len+len] = '\0';
4452 /* Now copy the insertion string */
4453 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4455 /* Successful operation */
4465 * Called from cmd4.c and a few other places. Just extracts
4466 * a direction from the keymap for ch (the last direction,
4467 * in fact) byte or char here? I'm thinking that keymaps should
4468 * generally only apply to single keys, which makes it no more
4469 * than 128, so a char should suffice... but keymap_act is 256...
4471 int get_keymap_dir(char ch)
4476 if (rogue_like_commands)
4478 act = keymap_act[KEYMAP_MODE_ROGUE][(byte)ch];
4482 act = keymap_act[KEYMAP_MODE_ORIG][(byte)ch];
4487 /* Convert to a direction */
4488 for (s = act; *s; ++s)
4490 /* Use any digits in keymap */
4491 if (isdigit(*s)) d = D2I(*s);
4498 #ifdef ALLOW_REPEAT /* TNB */
4500 #define REPEAT_MAX 20
4502 /* Number of chars saved */
4503 static int repeat__cnt = 0;
4506 static int repeat__idx = 0;
4509 static int repeat__key[REPEAT_MAX];
4512 void repeat_push(int what)
4515 if (repeat__cnt == REPEAT_MAX) return;
4517 /* Push the "stuff" */
4518 repeat__key[repeat__cnt++] = what;
4520 /* Prevents us from pulling keys */
4525 bool repeat_pull(int *what)
4527 /* All out of keys */
4528 if (repeat__idx == repeat__cnt) return (FALSE);
4530 /* Grab the next key, advance */
4531 *what = repeat__key[repeat__idx++];
4537 void repeat_check(void)
4541 /* Ignore some commands */
4542 if (command_cmd == ESCAPE) return;
4543 if (command_cmd == ' ') return;
4544 if (command_cmd == '\r') return;
4545 if (command_cmd == '\n') return;
4547 /* Repeat Last Command */
4548 if (command_cmd == 'n')
4553 /* Get the command */
4554 if (repeat_pull(&what))
4556 /* Save the command */
4561 /* Start saving new command */
4570 /* Save this command */
4575 #endif /* ALLOW_REPEAT -- TNB */
4581 * Array size for which InsertionSort
4582 * is used instead of QuickSort
4588 * Exchange two sort-entries
4589 * (should probably be coded inline
4590 * for speed increase)
4592 static void swap(tag_type *a, tag_type *b)
4597 temp.pointer = a->pointer;
4600 a->pointer = b->pointer;
4603 b->pointer = temp.pointer;
4608 * Insertion-Sort algorithm
4609 * (used by the Quicksort algorithm)
4611 static void InsertionSort(tag_type elements[], int number)
4617 for (P = 1; P < number; P++)
4620 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4621 elements[j] = elements[j - 1];
4628 * Helper function for Quicksort
4630 static tag_type median3(tag_type elements[], int left, int right)
4632 int center = (left + right) / 2;
4634 if (elements[left].tag > elements[center].tag)
4635 swap(&elements[left], &elements[center]);
4636 if (elements[left].tag > elements[right].tag)
4637 swap(&elements[left], &elements[right]);
4638 if (elements[center].tag > elements[right].tag)
4639 swap(&elements[center], &elements[right]);
4641 swap(&elements[center], &elements[right - 1]);
4642 return (elements[right - 1]);
4647 * Quicksort algorithm
4649 * The "median of three" pivot selection eliminates
4650 * the bad case of already sorted input.
4652 * We use InsertionSort for smaller sub-arrays,
4653 * because it is faster in this case.
4655 * For details see: "Data Structures and Algorithm
4656 * Analysis in C" by Mark Allen Weiss.
4658 static void quicksort(tag_type elements[], int left, int right)
4663 if (left + CUTOFF <= right)
4665 pivot = median3(elements, left, right);
4667 i = left; j = right -1;
4671 while (elements[++i].tag < pivot.tag);
4672 while (elements[--j].tag > pivot.tag);
4675 swap(&elements[i], &elements[j]);
4681 swap(&elements[i], &elements[right - 1]);
4683 quicksort(elements, left, i - 1);
4684 quicksort(elements, i + 1, right);
4688 /* Use InsertionSort on small arrays */
4689 InsertionSort(elements + left, right - left + 1);
4695 * Frontend for the sorting algorithm
4697 * Sorts an array of tagged pointers
4698 * with <number> elements.
4700 void tag_sort(tag_type elements[], int number)
4702 quicksort(elements, 0, number - 1);
4705 #endif /* SORT_R_INFO */
4707 #ifdef SUPPORT_GAMMA
4709 /* Table of gamma values */
4710 byte gamma_table[256];
4712 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4713 static s16b gamma_helper[256] =
4715 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4716 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4717 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4718 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4719 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4720 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4721 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4722 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4723 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4724 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4725 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4726 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4727 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4728 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4729 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4730 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4735 * Build the gamma table so that floating point isn't needed.
4737 * Note gamma goes from 0->256. The old value of 100 is now 128.
4739 void build_gamma_table(int gamma)
4744 * value is the current sum.
4745 * diff is the new term to add to the series.
4749 /* Hack - convergence is bad in these cases. */
4751 gamma_table[255] = 255;
4753 for (i = 1; i < 255; i++)
4756 * Initialise the Taylor series
4758 * value and diff have been scaled by 256
4763 diff = ((long)gamma_helper[i]) * (gamma - 256);
4772 * Use the following identiy to calculate the gamma table.
4773 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4775 * n is the current term number.
4777 * The gamma_helper array contains a table of
4779 * This is used because a^b = exp(b*ln(a))
4785 * Note that everything is scaled by 256 for accuracy,
4786 * plus another factor of 256 for the final result to
4787 * be from 0-255. Thus gamma_helper[] * gamma must be
4788 * divided by 256*256 each itteration, to get back to
4789 * the original power series.
4791 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4795 * Store the value in the table so that the
4796 * floating point pow function isn't needed .
4798 gamma_table[i] = ((long)(value / 256) * i) / 256;
4802 #endif /* SUPPORT_GAMMA */
4804 void roff_to_buf(cptr str, int maxlen, char *tbuf)
4810 unsigned char ch[3];
4813 while (str[read_pt])
4818 ch[0] = str[read_pt];
4821 kanji = iskanji(ch[0]);
4823 ch[1] = str[read_pt+1];
4824 if (!kanji && !isprint(ch[0]))
4827 if (!isprint(ch[0]))
4831 if (line_len >= maxlen - 1 || str[read_pt] == '\n')
4835 /* return to better wrapping point. */
4836 /* Space character at the end of the line need not to be printed. */
4837 word_len = read_pt - word_punct;
4838 if (ch[0] != ' ' && word_len < line_len/2)
4840 read_pt = word_punct;
4841 if (str[word_punct] == ' ')
4843 write_pt -= word_len;
4847 tbuf[write_pt++] = '\0';
4849 word_punct = read_pt;
4853 word_punct = read_pt;
4856 strcmp((char *)ch, "¡£") != 0 && strcmp((char *)ch, "¡¢") != 0 &&
4857 strcmp((char *)ch, "¥£") != 0 && strcmp((char *)ch, "¡¼") != 0)
4858 word_punct = read_pt;
4860 tbuf[write_pt++] = ch[0];
4866 tbuf[write_pt++] = ch[1];
4872 tbuf[write_pt] = '\0';
4873 tbuf[write_pt+1] = '\0';