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 */
1079 if (i == max_macrotrigger)
1081 key_code = macro_trigger_keycode[shiftstatus][i];
1085 for (i = 0; macro_template[i]; i++)
1087 char ch = macro_template[i];
1093 for (j = 0; macro_modifier_chr[j]; j++) {
1095 *s++ = macro_modifier_chr[j];
1099 strcpy(s, key_code);
1100 s += strlen(key_code);
1110 *strptr = str; /* where **strptr == ']' */
1116 * Hack -- convert a printable string into real ascii
1118 * I have no clue if this function correctly handles, for example,
1119 * parsing "\xFF" into a (signed) char. Whoever thought of making
1120 * the "sign" of a "char" undefined is a complete moron. Oh well.
1122 void text_to_ascii(char *buf, cptr str)
1126 /* Analyze the "ascii" string */
1129 /* Backslash codes */
1132 /* Skip the backslash */
1138 trigger_text_to_ascii(&s, &str);
1145 *s = 16 * dehex(*++str);
1146 *s++ += dehex(*++str);
1149 /* Hack -- simple way to specify "backslash" */
1150 else if (*str == '\\')
1155 /* Hack -- simple way to specify "caret" */
1156 else if (*str == '^')
1161 /* Hack -- simple way to specify "space" */
1162 else if (*str == 's')
1167 /* Hack -- simple way to specify Escape */
1168 else if (*str == 'e')
1174 else if (*str == 'b')
1180 else if (*str == 'n')
1186 else if (*str == 'r')
1192 else if (*str == 't')
1198 else if (*str == '0')
1200 *s = 8 * deoct(*++str);
1201 *s++ += deoct(*++str);
1205 else if (*str == '1')
1207 *s = 64 + 8 * deoct(*++str);
1208 *s++ += deoct(*++str);
1212 else if (*str == '2')
1214 *s = 64 * 2 + 8 * deoct(*++str);
1215 *s++ += deoct(*++str);
1219 else if (*str == '3')
1221 *s = 64 * 3 + 8 * deoct(*++str);
1222 *s++ += deoct(*++str);
1225 /* Skip the final char */
1229 /* Normal Control codes */
1230 else if (*str == '^')
1233 *s++ = (*str++ & 037);
1248 bool trigger_ascii_to_text(char **bufptr, cptr *strptr)
1256 if (macro_template == NULL)
1262 for (i = 0; macro_template[i]; i++)
1265 char ch = macro_template[i];
1270 while ((tmp = strchr(macro_modifier_chr, *str)))
1272 j = (int)(tmp - macro_modifier_chr);
1273 tmp = macro_modifier_name[j];
1274 while(*tmp) *s++ = *tmp++;
1279 for (j = 0; *str && *str != (char)13; j++)
1280 key_code[j] = *str++;
1284 if (ch != *str) return FALSE;
1288 if (*str++ != (char)13) return FALSE;
1290 for (i = 0; i < max_macrotrigger; i++)
1292 if (!my_stricmp(key_code, macro_trigger_keycode[0][i])
1293 || !my_stricmp(key_code, macro_trigger_keycode[1][i]))
1296 if (i == max_macrotrigger)
1299 tmp = macro_trigger_name[i];
1300 while (*tmp) *s++ = *tmp++;
1311 * Hack -- convert a string into a printable form
1313 void ascii_to_text(char *buf, cptr str)
1317 /* Analyze the "ascii" string */
1320 byte i = (byte)(*str++);
1325 if(!trigger_ascii_to_text(&s, &str))
1386 *s++ = octify(i / 8);
1387 *s++ = octify(i % 8);
1393 *s++ = hexify(i / 16);
1394 *s++ = hexify(i % 16);
1405 * The "macro" package
1407 * Functions are provided to manipulate a collection of macros, each
1408 * of which has a trigger pattern string and a resulting action string
1409 * and a small set of flags.
1415 * Determine if any macros have ever started with a given character.
1417 static bool macro__use[256];
1421 * Find the macro (if any) which exactly matches the given pattern
1423 sint macro_find_exact(cptr pat)
1427 /* Nothing possible */
1428 if (!macro__use[(byte)(pat[0])])
1433 /* Scan the macros */
1434 for (i = 0; i < macro__num; ++i)
1436 /* Skip macros which do not match the pattern */
1437 if (!streq(macro__pat[i], pat)) continue;
1449 * Find the first macro (if any) which contains the given pattern
1451 static sint macro_find_check(cptr pat)
1455 /* Nothing possible */
1456 if (!macro__use[(byte)(pat[0])])
1461 /* Scan the macros */
1462 for (i = 0; i < macro__num; ++i)
1464 /* Skip macros which do not contain the pattern */
1465 if (!prefix(macro__pat[i], pat)) continue;
1477 * Find the first macro (if any) which contains the given pattern and more
1479 static sint macro_find_maybe(cptr pat)
1483 /* Nothing possible */
1484 if (!macro__use[(byte)(pat[0])])
1489 /* Scan the macros */
1490 for (i = 0; i < macro__num; ++i)
1492 /* Skip macros which do not contain the pattern */
1493 if (!prefix(macro__pat[i], pat)) continue;
1495 /* Skip macros which exactly match the pattern XXX XXX */
1496 if (streq(macro__pat[i], pat)) continue;
1508 * Find the longest macro (if any) which starts with the given pattern
1510 static sint macro_find_ready(cptr pat)
1512 int i, t, n = -1, s = -1;
1514 /* Nothing possible */
1515 if (!macro__use[(byte)(pat[0])])
1520 /* Scan the macros */
1521 for (i = 0; i < macro__num; ++i)
1523 /* Skip macros which are not contained by the pattern */
1524 if (!prefix(pat, macro__pat[i])) continue;
1526 /* Obtain the length of this macro */
1527 t = strlen(macro__pat[i]);
1529 /* Only track the "longest" pattern */
1530 if ((n >= 0) && (s > t)) continue;
1532 /* Track the entry */
1543 * Add a macro definition (or redefinition).
1545 * We should use "act == NULL" to "remove" a macro, but this might make it
1546 * impossible to save the "removal" of a macro definition. XXX XXX XXX
1548 * We should consider refusing to allow macros which contain existing macros,
1549 * or which are contained in existing macros, because this would simplify the
1550 * macro analysis code. XXX XXX XXX
1552 * We should consider removing the "command macro" crap, and replacing it
1553 * with some kind of "powerful keymap" ability, but this might make it hard
1554 * to change the "roguelike" option from inside the game. XXX XXX XXX
1556 errr macro_add(cptr pat, cptr act)
1561 /* Paranoia -- require data */
1562 if (!pat || !act) return (-1);
1565 /* Look for any existing macro */
1566 n = macro_find_exact(pat);
1568 /* Replace existing macro */
1571 /* Free the old macro action */
1572 string_free(macro__act[n]);
1575 /* Create a new macro */
1578 /* Acquire a new index */
1581 /* Save the pattern */
1582 macro__pat[n] = string_make(pat);
1585 /* Save the action */
1586 macro__act[n] = string_make(act);
1589 macro__use[(byte)(pat[0])] = TRUE;
1598 * Initialize the "macro" package
1600 errr macro_init(void)
1602 /* Macro patterns */
1603 C_MAKE(macro__pat, MACRO_MAX, cptr);
1606 C_MAKE(macro__act, MACRO_MAX, cptr);
1613 * Local variable -- we are inside a "macro action"
1615 * Do not match any macros until "ascii 30" is found.
1617 static bool parse_macro = FALSE;
1620 * Local variable -- we are inside a "macro trigger"
1622 * Strip all keypresses until a low ascii value is found.
1624 static bool parse_under = FALSE;
1628 * Flush all input chars. Actually, remember the flush,
1629 * and do a "special flush" before the next "inkey()".
1631 * This is not only more efficient, but also necessary to make sure
1632 * that various "inkey()" codes are not "lost" along the way.
1642 * Flush the screen, make a noise
1646 /* Mega-Hack -- Flush the output */
1649 /* Make a bell noise (if allowed) */
1650 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1652 /* Flush the input (later!) */
1658 * Hack -- Make a (relevant?) sound
1663 if (!use_sound) return;
1665 /* Make a sound (if allowed) */
1666 Term_xtra(TERM_XTRA_SOUND, val);
1672 * Helper function called only from "inkey()"
1674 * This function does almost all of the "macro" processing.
1676 * We use the "Term_key_push()" function to handle "failed" macros, as well
1677 * as "extra" keys read in while choosing the proper macro, and also to hold
1678 * the action for the macro, plus a special "ascii 30" character indicating
1679 * that any macro action in progress is complete. Embedded macros are thus
1680 * illegal, unless a macro action includes an explicit "ascii 30" character,
1681 * which would probably be a massive hack, and might break things.
1683 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1684 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1685 * macro trigger, 500 milliseconds must pass before the key sequence is
1686 * known not to be that macro trigger. XXX XXX XXX
1688 static char inkey_aux(void)
1690 int k = 0, n, p = 0, w = 0;
1698 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£ */
1701 /* Wait for a keypress */
1702 (void)(Term_inkey(&ch, TRUE, TRUE));
1705 /* End "macro action" */
1706 if (ch == 30) parse_macro = FALSE;
1708 /* Inside "macro action" */
1709 if (ch == 30) return (ch);
1711 /* Inside "macro action" */
1712 if (parse_macro) return (ch);
1714 /* Inside "macro trigger" */
1715 if (parse_under) return (ch);
1718 /* Save the first key, advance */
1723 /* Check for possible macro */
1724 k = macro_find_check(buf);
1726 /* No macro pending */
1727 if (k < 0) return (ch);
1730 /* Wait for a macro, or a timeout */
1733 /* Check for pending macro */
1734 k = macro_find_maybe(buf);
1736 /* No macro pending */
1739 /* Check for (and remove) a pending key */
1740 if (0 == Term_inkey(&ch, FALSE, TRUE))
1742 /* Append the key */
1753 /* Increase "wait" */
1756 /* Excessive delay */
1757 if (w >= 100) break;
1760 Term_xtra(TERM_XTRA_DELAY, w);
1765 /* Check for available macro */
1766 k = macro_find_ready(buf);
1768 /* No macro available */
1771 /* Push all the keys back on the queue */
1774 /* Push the key, notice over-flow */
1775 if (Term_key_push(buf[--p])) return (0);
1778 /* Wait for (and remove) a pending key */
1779 (void)Term_inkey(&ch, TRUE, TRUE);
1781 /* Return the key */
1786 /* Get the pattern */
1787 pat = macro__pat[k];
1789 /* Get the length of the pattern */
1792 /* Push the "extra" keys back on the queue */
1795 /* Push the key, notice over-flow */
1796 if (Term_key_push(buf[--p])) return (0);
1800 /* Begin "macro action" */
1803 /* Push the "end of macro action" key */
1804 if (Term_key_push(30)) return (0);
1807 /* Access the macro action */
1808 act = macro__act[k];
1810 /* Get the length of the action */
1813 /* Push the macro "action" onto the key queue */
1816 /* Push the key, notice over-flow */
1817 if (Term_key_push(act[--n])) return (0);
1821 /* Hack -- Force "inkey()" to call us again */
1827 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1829 * This special pointer allows a sequence of keys to be "inserted" into
1830 * the stream of keys returned by "inkey()". This key sequence will not
1831 * trigger any macros, and cannot be bypassed by the Borg. It is used
1832 * in Angband to handle "keymaps".
1834 static cptr inkey_next = NULL;
1840 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1842 * This special function hook allows the "Borg" (see elsewhere) to take
1843 * control of the "inkey()" function, and substitute in fake keypresses.
1845 char (*inkey_hack)(int flush_first) = NULL;
1847 #endif /* ALLOW_BORG */
1852 * Get a keypress from the user.
1854 * This function recognizes a few "global parameters". These are variables
1855 * which, if set to TRUE before calling this function, will have an effect
1856 * on this function, and which are always reset to FALSE by this function
1857 * before this function returns. Thus they function just like normal
1858 * parameters, except that most calls to this function can ignore them.
1860 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1861 * and any macro processing in progress will be aborted. This flag is
1862 * set by the "flush()" function, which does not actually flush anything
1863 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1865 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1866 * keypress is available, instead of waiting for a keypress.
1868 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1869 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1870 * not return immediately, but will wait for a keypress for as long as the
1871 * normal macro matching code would, allowing the direct entry of macro
1872 * triggers. The "inkey_base" flag is extremely dangerous!
1874 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1875 * normal command, and we will only show the cursor if "hilite_player" is
1876 * TRUE (or if the player is in a store), instead of always showing the
1877 * cursor. The various "main-xxx.c" files should avoid saving the game
1878 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1879 * prevent savefile corruption.
1881 * If we are waiting for a keypress, and no keypress is ready, then we will
1882 * refresh (once) the window which was active when this function was called.
1884 * Note that "back-quote" is automatically converted into "escape" for
1885 * convenience on machines with no "escape" key. This is done after the
1886 * macro matching, so the user can still make a macro for "backquote".
1888 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1889 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1890 * provide support for simple keyboard "macros". These keys are so strange
1891 * that their loss as normal keys will probably be noticed by nobody. The
1892 * "ascii 30" key is used to indicate the "end" of a macro action, which
1893 * allows recursive macros to be avoided. The "ascii 31" key is used by
1894 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1896 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1897 * which can be used to give a variety of "sub-commands" which can be used
1898 * any time. These sub-commands could include commands to take a picture of
1899 * the current screen, to start/stop recording a macro action, etc.
1901 * If "angband_term[0]" is not active, we will make it active during this
1902 * function, so that the various "main-xxx.c" files can assume that input
1903 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1905 * Mega-Hack -- This function is used as the entry point for clearing the
1906 * "signal_count" variable, and of the "character_saved" variable.
1908 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1910 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1911 * control of the keyboard from the user.
1921 /* Hack -- Use the "inkey_next" pointer */
1922 if (inkey_next && *inkey_next && !inkey_xtra)
1924 /* Get next character, and advance */
1927 /* Cancel the various "global parameters" */
1928 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1934 /* Forget pointer */
1940 /* Mega-Hack -- Use the special hook */
1941 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1943 /* Cancel the various "global parameters" */
1944 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1950 #endif /* ALLOW_BORG */
1953 /* Hack -- handle delayed "flush()" */
1956 /* End "macro action" */
1957 parse_macro = FALSE;
1959 /* End "macro trigger" */
1960 parse_under = FALSE;
1962 /* Forget old keypresses */
1967 /* Access cursor state */
1968 (void)Term_get_cursor(&v);
1970 /* Show the cursor if waiting, except sometimes in "command" mode */
1971 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1973 /* Show the cursor */
1974 (void)Term_set_cursor(1);
1978 /* Hack -- Activate main screen */
1979 Term_activate(angband_term[0]);
1985 /* Hack -- Handle "inkey_scan" */
1986 if (!inkey_base && inkey_scan &&
1987 (0 != Term_inkey(&kk, FALSE, FALSE)))
1993 /* Hack -- Flush output once when no key ready */
1994 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
1996 /* Hack -- activate proper term */
2002 /* Hack -- activate main screen */
2003 Term_activate(angband_term[0]);
2005 /* Mega-Hack -- reset saved flag */
2006 character_saved = FALSE;
2008 /* Mega-Hack -- reset signal counter */
2016 /* Hack -- Handle "inkey_base" */
2024 /* Wait for (and remove) a pending key */
2025 if (0 == Term_inkey(&ch, TRUE, TRUE))
2038 /* Check for (and remove) a pending key */
2039 if (0 == Term_inkey(&ch, FALSE, TRUE))
2048 /* Increase "wait" */
2051 /* Excessive delay */
2052 if (w >= 100) break;
2055 Term_xtra(TERM_XTRA_DELAY, w);
2064 /* Get a key (see above) */
2068 /* Handle "control-right-bracket" */
2071 /* Strip this key */
2079 /* Treat back-quote as escape */
2080 /* if (ch == '`') ch = ESCAPE; */
2083 /* End "macro trigger" */
2084 if (parse_under && (ch <= 32))
2086 /* Strip this key */
2089 /* End "macro trigger" */
2090 parse_under = FALSE;
2094 /* Handle "control-caret" */
2097 /* Strip this key */
2101 /* Handle "control-underscore" */
2104 /* Strip this key */
2107 /* Begin "macro trigger" */
2111 /* Inside "macro trigger" */
2112 else if (parse_under)
2114 /* Strip this key */
2120 /* Hack -- restore the term */
2124 /* Restore the cursor */
2128 /* Cancel the various "global parameters" */
2129 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
2131 /* Return the keypress */
2139 * We use a global array for all inscriptions to reduce the memory
2140 * spent maintaining inscriptions. Of course, it is still possible
2141 * to run out of inscription memory, especially if too many different
2142 * inscriptions are used, but hopefully this will be rare.
2144 * We use dynamic string allocation because otherwise it is necessary
2145 * to pre-guess the amount of quark activity. We limit the total
2146 * number of quarks, but this is much easier to "expand" as needed.
2148 * Any two items with the same inscription will have the same "quark"
2149 * index, which should greatly reduce the need for inscription space.
2151 * Note that "quark zero" is NULL and should not be "dereferenced".
2155 * Add a new "quark" to the set of quarks.
2157 s16b quark_add(cptr str)
2161 /* Look for an existing quark */
2162 for (i = 1; i < quark__num; i++)
2164 /* Check for equality */
2165 if (streq(quark__str[i], str)) return (i);
2168 /* Paranoia -- Require room */
2169 if (quark__num == QUARK_MAX) return (0);
2171 /* New maximal quark */
2174 /* Add a new quark */
2175 quark__str[i] = string_make(str);
2177 /* Return the index */
2183 * This function looks up a quark
2185 cptr quark_str(s16b i)
2190 if ((i < 0) || (i >= quark__num)) i = 0;
2192 /* Access the quark */
2195 /* Return the quark */
2203 * Second try for the "message" handling routines.
2205 * Each call to "message_add(s)" will add a new "most recent" message
2206 * to the "message recall list", using the contents of the string "s".
2208 * The messages will be stored in such a way as to maximize "efficiency",
2209 * that is, we attempt to maximize the number of sequential messages that
2210 * can be retrieved, given a limited amount of storage space.
2212 * We keep a buffer of chars to hold the "text" of the messages, not
2213 * necessarily in "order", and an array of offsets into that buffer,
2214 * representing the actual messages. This is made more complicated
2215 * by the fact that both the array of indexes, and the buffer itself,
2216 * are both treated as "circular arrays" for efficiency purposes, but
2217 * the strings may not be "broken" across the ends of the array.
2219 * The "message_add()" function is rather "complex", because it must be
2220 * extremely efficient, both in space and time, for use with the Borg.
2226 * How many messages are "available"?
2228 s16b message_num(void)
2232 /* Extract the indexes */
2233 last = message__last;
2234 next = message__next;
2237 if (next < last) next += MESSAGE_MAX;
2239 /* Extract the space */
2242 /* Return the result */
2249 * Recall the "text" of a saved message
2251 cptr message_str(int age)
2257 /* Forgotten messages have no text */
2258 if ((age < 0) || (age >= message_num())) return ("");
2260 /* Acquire the "logical" index */
2261 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2263 /* Get the "offset" for the message */
2264 o = message__ptr[x];
2266 /* Access the message text */
2267 s = &message__buf[o];
2269 /* Return the message text */
2276 * Add a new message, with great efficiency
2278 void message_add(cptr str)
2286 /*** Step 1 -- Analyze the message ***/
2288 /* Hack -- Ignore "non-messages" */
2291 /* Message length */
2294 /* Important Hack -- Ignore "long" messages */
2295 if (n >= MESSAGE_BUF / 4) return;
2297 /* extra step -- split the message if n>80. (added by Mogami) */
2302 for (n = 0; n < 80; n++, t++)
2307 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2309 for (n = 80; n > 60; n--)
2310 if (str[n] == ' ') break;
2314 splitted2 = str + n;
2315 strncpy(splitted1, str ,n);
2316 splitted1[n] = '\0';
2322 /*** Step 2 -- Attempt to optimize ***/
2324 /* Limit number of messages to check */
2329 /* Limit number of messages to check */
2330 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2332 /* Check previous message */
2333 for (i = message__next; m; m--)
2342 /* Back up and wrap if needed */
2343 if (i-- == 0) i = MESSAGE_MAX - 1;
2345 /* Access the old string */
2346 old = &message__buf[message__ptr[i]];
2348 /* Skip small messages */
2355 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2356 if( iskanji(*t))t++;
2358 for (t = buf; *t && (*t != '<'); t++);
2363 /* Message is too small */
2364 if (strlen(buf) < 6) break;
2366 /* Drop the space */
2369 /* Get multiplier */
2373 /* Limit the multiplier to 1000 */
2374 if (buf && streq(buf, str) && (j < 1000))
2384 sprintf(u, "%s <x%d>", buf, j);
2386 /* Message length */
2389 if (!now_message) now_message++;
2393 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
2401 /* Check the last few messages (if any to count) */
2402 for (i = message__next; k; k--)
2408 /* Back up and wrap if needed */
2409 if (i-- == 0) i = MESSAGE_MAX - 1;
2411 /* Stop before oldest message */
2412 if (i == message__last) break;
2414 /* Extract "distance" from "head" */
2415 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2417 /* Do not optimize over large distance */
2418 if (q > MESSAGE_BUF / 2) continue;
2420 /* Access the old string */
2421 old = &message__buf[message__ptr[i]];
2424 if (!streq(old, str)) continue;
2426 /* Get the next message index, advance */
2427 x = message__next++;
2430 if (message__next == MESSAGE_MAX) message__next = 0;
2432 /* Kill last message if needed */
2433 if (message__next == message__last) message__last++;
2436 if (message__last == MESSAGE_MAX) message__last = 0;
2438 /* Assign the starting address */
2439 message__ptr[x] = message__ptr[i];
2443 goto end_of_message_add;
2448 /*** Step 3 -- Ensure space before end of buffer ***/
2450 /* Kill messages and Wrap if needed */
2451 if (message__head + n + 1 >= MESSAGE_BUF)
2453 /* Kill all "dead" messages */
2454 for (i = message__last; TRUE; i++)
2456 /* Wrap if needed */
2457 if (i == MESSAGE_MAX) i = 0;
2459 /* Stop before the new message */
2460 if (i == message__next) break;
2462 /* Kill "dead" messages */
2463 if (message__ptr[i] >= message__head)
2465 /* Track oldest message */
2466 message__last = i + 1;
2470 /* Wrap "tail" if needed */
2471 if (message__tail >= message__head) message__tail = 0;
2478 /*** Step 4 -- Ensure space before next message ***/
2480 /* Kill messages if needed */
2481 if (message__head + n + 1 > message__tail)
2483 /* Grab new "tail" */
2484 message__tail = message__head + n + 1;
2486 /* Advance tail while possible past first "nul" */
2487 while (message__buf[message__tail-1]) message__tail++;
2489 /* Kill all "dead" messages */
2490 for (i = message__last; TRUE; i++)
2492 /* Wrap if needed */
2493 if (i == MESSAGE_MAX) i = 0;
2495 /* Stop before the new message */
2496 if (i == message__next) break;
2498 /* Kill "dead" messages */
2499 if ((message__ptr[i] >= message__head) &&
2500 (message__ptr[i] < message__tail))
2502 /* Track oldest message */
2503 message__last = i + 1;
2509 /*** Step 5 -- Grab a new message index ***/
2511 /* Get the next message index, advance */
2512 x = message__next++;
2515 if (message__next == MESSAGE_MAX) message__next = 0;
2517 /* Kill last message if needed */
2518 if (message__next == message__last) message__last++;
2521 if (message__last == MESSAGE_MAX) message__last = 0;
2525 /*** Step 6 -- Insert the message text ***/
2527 /* Assign the starting address */
2528 message__ptr[x] = message__head;
2530 /* Append the new part of the message */
2531 for (i = 0; i < n; i++)
2533 /* Copy the message */
2534 message__buf[message__head + i] = str[i];
2538 message__buf[message__head + i] = '\0';
2540 /* Advance the "head" pointer */
2541 message__head += n + 1;
2543 /* recursively add splitted message (added by Mogami) */
2545 if (splitted2 != NULL)
2546 message_add(splitted2);
2554 static void msg_flush(int x)
2556 byte a = TERM_L_BLUE;
2557 bool nagasu = FALSE;
2559 if ((auto_more && !now_damaged) || num_more < 0){
2561 for (i = 0; i < 8; i++)
2563 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2567 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2574 now_damaged = FALSE;
2576 if (!alive || !nagasu)
2578 /* Pause for response */
2580 Term_putstr(x, 0, -1, a, "-³¤¯-");
2582 Term_putstr(x, 0, -1, a, "-more-");
2586 /* Get an acceptable keypress */
2590 if (cmd == ESCAPE) {
2591 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£ */
2593 } else if (cmd == ' ') {
2594 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
2596 } else if ((cmd == '\n') || (cmd == '\r')) {
2597 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
2600 if (quick_messages) break;
2605 /* Clear the line */
2606 Term_erase(0, 0, 255);
2611 * Output a message to the top line of the screen.
2613 * Break long messages into multiple pieces (40-72 chars).
2615 * Allow multiple short messages to "share" the top line.
2617 * Prompt the user to make sure he has a chance to read them.
2619 * These messages are memorized for later reference (see above).
2621 * We could do "Term_fresh()" to provide "flicker" if needed.
2623 * The global "msg_flag" variable can be cleared to tell us to
2624 * "erase" any "pending" messages still on the screen.
2626 * XXX XXX XXX Note that we must be very careful about using the
2627 * "msg_print()" functions without explicitly calling the special
2628 * "msg_print(NULL)" function, since this may result in the loss
2629 * of information if the screen is cleared, or if anything is
2630 * displayed on the top line.
2632 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2633 * even if no messages are pending. This is probably a hack.
2635 void msg_print(cptr msg)
2645 if (world_monster) return;
2649 /* Clear the line */
2650 Term_erase(0, 0, 255);
2654 /* Message Length */
2655 n = (msg ? strlen(msg) : 0);
2657 /* Hack -- flush when requested or needed */
2658 if (p && (!msg || ((p + n) > 72)))
2675 if (n > 1000) return;
2678 /* Memorize the message */
2679 if (character_generated) message_add(msg);
2685 /* Analyze the buffer */
2692 int check, split = 72;
2695 bool k_flag = FALSE;
2698 /* Find the "best" split point */
2699 for (check = 0; check < 72; check++)
2707 /* Found a valid split point */
2708 if (iskanji(t[check]))
2713 else if (t[check] == ' ')
2726 /* Find the "best" split point */
2727 for (check = 40; check < 72; check++)
2729 /* Found a valid split point */
2730 if (t[check] == ' ') split = check;
2734 /* Save the split character */
2737 /* Split the message */
2740 /* Display part of the message */
2741 Term_putstr(0, 0, split, TERM_WHITE, t);
2744 msg_flush(split + 1);
2746 /* Memorize the piece */
2747 /* if (character_generated) message_add(t); */
2749 /* Restore the split character */
2752 /* Insert a space */
2755 /* Prepare to recurse on the rest of "buf" */
2756 t += split; n -= split;
2760 /* Display the tail of the message */
2761 Term_putstr(p, 0, n, TERM_WHITE, t);
2763 /* Memorize the tail */
2764 /* if (character_generated) message_add(t); */
2767 p_ptr->window |= (PW_MESSAGE);
2770 /* Remember the message */
2773 /* Remember the position */
2781 /* Optional refresh */
2782 if (fresh_message) Term_fresh();
2787 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2789 static int screen_depth = 0;
2793 * Save the screen, and increase the "icky" depth.
2795 * This function must match exactly one call to "screen_load()".
2797 void screen_save(void)
2799 /* Hack -- Flush messages */
2802 /* Save the screen (if legal) */
2803 if (screen_depth++ == 0) Term_save();
2805 /* Increase "icky" depth */
2811 * Load the screen, and decrease the "icky" depth.
2813 * This function must match exactly one call to "screen_save()".
2815 void screen_load(void)
2817 /* Hack -- Flush messages */
2820 /* Load the screen (if legal) */
2821 if (--screen_depth == 0) Term_load();
2823 /* Decrease "icky" depth */
2829 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2831 void msg_format(cptr fmt, ...)
2837 /* Begin the Varargs Stuff */
2840 /* Format the args, save the length */
2841 (void)vstrnfmt(buf, 1024, fmt, vp);
2843 /* End the Varargs Stuff */
2853 * Display a string on the screen using an attribute.
2855 * At the given location, using the given attribute, if allowed,
2856 * add the given string. Do not clear the line.
2858 void c_put_str(byte attr, cptr str, int row, int col)
2860 /* Position cursor, Dump the attr/text */
2861 Term_putstr(col, row, -1, attr, str);
2865 * As above, but in "white"
2867 void put_str(cptr str, int row, int col)
2870 Term_putstr(col, row, -1, TERM_WHITE, str);
2876 * Display a string on the screen using an attribute, and clear
2877 * to the end of the line.
2879 void c_prt(byte attr, cptr str, int row, int col)
2881 /* Clear line, position cursor */
2882 Term_erase(col, row, 255);
2884 /* Dump the attr/text */
2885 Term_addstr(-1, attr, str);
2889 * As above, but in "white"
2891 void prt(cptr str, int row, int col)
2894 c_prt(TERM_WHITE, str, row, col);
2901 * Print some (colored) text to the screen at the current cursor position,
2902 * automatically "wrapping" existing text (at spaces) when necessary to
2903 * avoid placing any text into the last column, and clearing every line
2904 * before placing any text in that line. Also, allow "newline" to force
2905 * a "wrap" to the next line. Advance the cursor as needed so sequential
2906 * calls to this function will work correctly.
2908 * Once this function has been called, the cursor should not be moved
2909 * until all the related "c_roff()" calls to the window are complete.
2911 * This function will correctly handle any width up to the maximum legal
2912 * value of 256, though it works best for a standard 80 character width.
2914 void c_roff(byte a, cptr str)
2922 /* Obtain the size */
2923 (void)Term_get_size(&w, &h);
2925 /* Obtain the cursor */
2926 (void)Term_locate(&x, &y);
2928 /* Hack -- No more space */
2929 if( y == h - 1 && x > w - 3) return;
2931 /* Process the string */
2932 for (s = str; *s; s++)
2937 int k_flag = iskanji(*s);
2949 /* Clear line, move cursor */
2950 Term_erase(x, y, 255);
2953 /* Clean up the char */
2955 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2957 ch = (isprint(*s) ? *s : ' ');
2961 /* Wrap words as needed */
2963 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2965 if ((x >= w - 1) && (ch != ' '))
2978 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
2982 /* Scan existing text */
2983 for (i = w - 2; i >= 0; i--)
2985 /* Grab existing attr/char */
2986 Term_what(i, y, &av[i], &cv[i]);
2988 /* Break on space */
2989 if (cv[i] == ' ') break;
2991 /* Track current word */
2994 if (cv[i] == '(') break;
3002 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
3003 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
3004 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
3005 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
3006 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
3009 Term_what(x , y, &av[x ], &cv[x ]);
3010 Term_what(x-1, y, &av[x-1], &cv[x-1]);
3011 Term_what(x-2, y, &av[x-2], &cv[x-2]);
3022 Term_erase(n, y, 255);
3031 /* Clear line, move cursor */
3032 Term_erase(x, y, 255);
3034 /* Wrap the word (if any) */
3035 for (i = n; i < w - 1; i++)
3038 if( cv[i] == '\0' ) break;
3041 Term_addch(av[i], cv[i]);
3043 /* Advance (no wrap) */
3050 Term_addch((byte)(a|0x10), ch);
3062 Term_addch((byte)(a|0x20), ch);
3071 * As above, but in "white"
3076 c_roff(TERM_WHITE, str);
3083 * Clear part of the screen
3085 void clear_from(int row)
3089 /* Erase requested rows */
3090 for (y = row; y < Term->hgt; y++)
3092 /* Erase part of the screen */
3093 Term_erase(0, y, 255);
3101 * Get some input at the cursor location.
3102 * Assume the buffer is initialized to a default string.
3103 * Note that this string is often "empty" (see below).
3104 * The default buffer is displayed in yellow until cleared.
3105 * Pressing RETURN right away accepts the default entry.
3106 * Normal chars clear the default and append the char.
3107 * Backspace clears the default or deletes the final char.
3108 * ESCAPE clears the buffer and the window and returns FALSE.
3109 * RETURN accepts the current buffer contents and returns TRUE.
3111 bool askfor_aux(char *buf, int len)
3125 /* Locate the cursor */
3126 Term_locate(&x, &y);
3129 /* Paranoia -- check len */
3130 if (len < 1) len = 1;
3132 /* Paranoia -- check column */
3133 if ((x < 0) || (x >= 80)) x = 0;
3135 /* Restrict the length */
3136 if (x + len > 80) len = 80 - x;
3139 /* Paranoia -- Clip the default entry */
3143 /* Display the default answer */
3144 Term_erase(x, y, len);
3145 Term_putstr(x, y, -1, TERM_YELLOW, buf);
3152 Term_gotoxy(x + k, y);
3157 /* Analyze the key */
3188 { /* ÊÒ»³¤µ¤óºîÀ® */
3202 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3204 if(k<len && isprint(i)){
3213 if ((k < len) && (isprint(i)))
3229 /* Update the entry */
3230 Term_erase(x, y, len);
3231 Term_putstr(x, y, -1, TERM_WHITE, buf);
3235 if (i == ESCAPE) return (FALSE);
3243 * Get a string from the user
3245 * The "prompt" should take the form "Prompt: "
3247 * Note that the initial contents of the string is used as
3248 * the default response, so be sure to "clear" it if needed.
3250 * We clear the input, and return FALSE, on "ESCAPE".
3252 bool get_string(cptr prompt, char *buf, int len)
3256 /* Paranoia XXX XXX XXX */
3259 /* Display prompt */
3262 /* Ask the user for a string */
3263 res = askfor_aux(buf, len);
3274 * Verify something with the user
3276 * The "prompt" should take the form "Query? "
3278 * Note that "[y/n]" is appended to the prompt.
3280 bool get_check(cptr prompt)
3282 return get_check_strict(prompt, 0);
3286 * Verify something with the user strictly
3288 * mode & 0x01 : force user to answer "YES" or "N"
3289 * mode & 0x02 : don't allow ESCAPE key
3291 bool get_check_strict(cptr prompt, int mode)
3298 p_ptr->window |= PW_MESSAGE;
3303 /* Paranoia XXX XXX XXX */
3306 if (!rogue_like_commands)
3309 /* Hack -- Build a "useful" prompt */
3313 mb_strlcpy(buf, prompt, 78-8);
3315 strncpy(buf, prompt, 78-8);
3317 strcat(buf, "[yes/no]");
3322 mb_strlcpy(buf, prompt, 78-5);
3324 strncpy(buf, prompt, 78-5);
3326 strcat(buf, "[y/n]");
3332 /* Get an acceptable answer */
3337 if (i == 'y' || i == 'Y')
3344 prt("y (YES¤ÈÆþÎϤ·¤Æ¤¯¤À¤µ¤¤)", 0, strlen(buf));
3346 prt("y (Please answer YES.)", 0, strlen(buf));
3349 if (i == 'e' || i == 'E')
3352 prt("e (YES¤ÈÆþÎϤ·¤Æ¤¯¤À¤µ¤¤)", 0, strlen(buf)+1);
3354 prt("e (Please answer YES.)", 0, strlen(buf)+1);
3357 if (i == 's' || i == 'S')
3362 prt("", 0, strlen(buf)+1);
3364 prt("", 0, strlen(buf));
3367 if (!(mode & 2) && (i == ESCAPE)) break;
3368 if (strchr("Nn", i)) break;
3372 /* Erase the prompt */
3375 /* Normal negation */
3376 if ((i != 'Y') && (i != 'y')) return (FALSE);
3384 * Prompts for a keypress
3386 * The "prompt" should take the form "Command: "
3388 * Returns TRUE unless the character is "Escape"
3390 bool get_com(cptr prompt, char *command, bool z_escape)
3392 /* Paranoia XXX XXX XXX */
3395 /* Display a prompt */
3401 /* Clear the prompt */
3404 /* Handle "cancel" */
3405 if (*command == ESCAPE) return (FALSE);
3406 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3414 * Request a "quantity" from the user
3416 * Hack -- allow "command_arg" to specify a quantity
3418 s16b get_quantity(cptr prompt, int max)
3427 /* Use "command_arg" */
3430 /* Extract a number */
3433 /* Clear "command_arg" */
3436 /* Enforce the maximum */
3437 if (amt > max) amt = max;
3443 #ifdef ALLOW_REPEAT /* TNB */
3445 /* Get the item index */
3446 if ((max != 1) && repeat_pull(&amt))
3448 /* Enforce the maximum */
3449 if (amt > max) amt = max;
3451 /* Enforce the minimum */
3452 if (amt < 0) amt = 0;
3458 #endif /* ALLOW_REPEAT -- TNB */
3460 /* Build a prompt if needed */
3463 /* Build a prompt */
3465 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3467 sprintf(tmp, "Quantity (1-%d): ", max);
3471 /* Use that prompt */
3476 /* Default to one */
3479 /* Build the default */
3480 sprintf(buf, "%d", amt);
3482 /* Ask for a quantity */
3483 if (!get_string(prompt, buf, 6)) return (0);
3485 /* Extract a number */
3488 /* A letter means "all" */
3489 if (isalpha(buf[0])) amt = max;
3491 /* Enforce the maximum */
3492 if (amt > max) amt = max;
3494 /* Enforce the minimum */
3495 if (amt < 0) amt = 0;
3497 #ifdef ALLOW_REPEAT /* TNB */
3499 if (amt) repeat_push(amt);
3501 #endif /* ALLOW_REPEAT -- TNB */
3503 /* Return the result */
3509 * Pause for user response XXX XXX XXX
3511 void pause_line(int row)
3516 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3518 put_str("[Press any key to continue]", row, 23);
3527 * Hack -- special buffer to hold the action of the current keymap
3529 static char request_command_buffer[256];
3541 menu_naiyou menu_info[10][10] =
3544 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3546 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3547 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3549 {"Èâ/È¢", 6, FALSE},
3552 {"¤½¤Î¾", 9, FALSE},
3557 {"»È¤¦(m)", 'm', TRUE},
3558 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3559 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3560 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3570 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3571 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3572 {"õ¤¹(s)", 's', TRUE},
3573 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3574 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3575 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3576 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3577 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3578 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3579 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3583 {"Æɤà(r)", 'r', TRUE},
3584 {"°û¤à(q)", 'q', TRUE},
3585 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3586 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3587 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3588 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3589 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3590 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3591 {"Åꤲ¤ë(v)", 'v', TRUE},
3596 {"½¦¤¦(g)", 'g', TRUE},
3597 {"Íî¤È¤¹(d)", 'd', TRUE},
3598 {"²õ¤¹(k/^d)", 'k', TRUE},
3599 {"Ìäò¹ï¤à({)", '{', TRUE},
3600 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3601 {"Ä´ºº(I)", 'I', TRUE},
3602 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3609 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3610 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3611 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3612 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3622 {"³«¤±¤ë(o)", 'o', TRUE},
3623 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3624 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3625 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3635 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3636 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3637 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3638 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3639 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3640 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3641 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3642 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3643 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3648 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3649 {"¥Þ¥¯¥í(@)", '@', TRUE},
3650 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3651 {"¥«¥é¡¼(&)", '&', TRUE},
3652 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3653 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3654 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3661 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3662 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3663 {"¥Ø¥ë¥×(?)", '?', TRUE},
3664 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3665 {"¥á¥â(:)", ':', TRUE},
3666 {"µÇ°»£±Æ())", ')', TRUE},
3667 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3668 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3669 {"°úÂह¤ë(Q)", 'Q', TRUE},
3674 menu_naiyou menu_info[10][10] =
3677 {"Magic/Special", 1, FALSE},
3678 {"Action", 2, FALSE},
3679 {"Items(use)", 3, FALSE},
3680 {"Items(other)", 4, FALSE},
3681 {"Equip", 5, FALSE},
3682 {"Door/Box", 6, FALSE},
3683 {"Infomations", 7, FALSE},
3684 {"Options", 8, FALSE},
3685 {"Other commands", 9, FALSE},
3690 {"Use(m)", 'm', TRUE},
3691 {"See tips(b/P)", 'b', TRUE},
3692 {"Study(G)", 'G', TRUE},
3693 {"Special abilities(U/O)", 'U', TRUE},
3703 {"Rest(R)", 'R', TRUE},
3704 {"Disarm a trap(D)", 'D', TRUE},
3705 {"Search(s)", 's', TRUE},
3706 {"Look(l/x)", 'l', TRUE},
3707 {"Target(*)", '*', TRUE},
3708 {"Dig(T/^t)", 'T', TRUE},
3709 {"Go up stairs(<)", '<', TRUE},
3710 {"Go down staies(>)", '>', TRUE},
3711 {"Command pets(p)", 'p', TRUE},
3712 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3716 {"Read a scroll(r)", 'r', TRUE},
3717 {"Drink a potion(q)", 'q', TRUE},
3718 {"Use a staff(u/Z)", 'u', TRUE},
3719 {"Aim a wand(a/z)", 'a', TRUE},
3720 {"Zap a rod(z/a)", 'z', TRUE},
3721 {"Activate an equipment(A)", 'A', TRUE},
3722 {"Eat(E)", 'E', TRUE},
3723 {"Fire missile weapon(f/t)", 'f', TRUE},
3724 {"Throw an item(v)", 'v', TRUE},
3729 {"Get items(g)", 'g', TRUE},
3730 {"Drop an item(d)", 'd', TRUE},
3731 {"Destroy an item(k/^d)", 'k', TRUE},
3732 {"Inscribe an item({)", '{', TRUE},
3733 {"Uninscribe an item(})", '}', TRUE},
3734 {"Info about an item(I)", 'I', TRUE},
3735 {"Inventory list(i)", 'i', TRUE},
3742 {"Wear(w)", 'w', TRUE},
3743 {"Take off(t/T)", 't', TRUE},
3744 {"Refuel(F)", 'F', TRUE},
3745 {"Equipment list(e)", 'e', TRUE},
3755 {"Open(o)", 'o', TRUE},
3756 {"Close(c)", 'c', TRUE},
3757 {"Bash a door(B/f)", 'B', TRUE},
3758 {"Jam a door(j/S)", 'j', TRUE},
3768 {"Full map(M)", 'M', TRUE},
3769 {"Map(L/W)", 'L', TRUE},
3770 {"Level feeling(^f)", KTRL('F'), TRUE},
3771 {"Character status(C)", 'C', TRUE},
3772 {"Identify symbol(/)", '/', TRUE},
3773 {"Show prev messages(^p)", KTRL('P'), TRUE},
3774 {"Current time(^t/')", KTRL('T'), TRUE},
3775 {"Various infomations(~)", '~', TRUE},
3776 {"Play record menu(|)", '|', TRUE},
3781 {"Set options(=)", '=', TRUE},
3782 {"Interact with macros(@)", '@', TRUE},
3783 {"Interact w/ visuals(%)", '%', TRUE},
3784 {"Interact with colors(&)", '&', TRUE},
3785 {"Enter a user pref(\")", '\"', TRUE},
3786 {"Reload auto-pick pref($)", '$', TRUE},
3794 {"Save and quit(^x)", KTRL('X'), TRUE},
3795 {"Save(^s)", KTRL('S'), TRUE},
3796 {"Help(obsoleted)(?)", '?', TRUE},
3797 {"Redraw(^r)", KTRL('R'), TRUE},
3798 {"Take note(:)", ':', TRUE},
3799 {"Dump screen dump(()", ')', TRUE},
3800 {"Load screen dump())", '(', TRUE},
3801 {"Version info(V)", 'V', TRUE},
3802 {"Quit(Q)", 'Q', TRUE},
3815 } special_menu_naiyou;
3817 #define MENU_CLASS 1
3821 special_menu_naiyou special_menu_info[] =
3823 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3824 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3825 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3826 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3827 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3828 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3829 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3833 special_menu_naiyou special_menu_info[] =
3835 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3836 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3837 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3838 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3839 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3840 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3841 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3847 * Request a command from the user.
3849 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
3850 * p_ptr->command_arg. May modify p_ptr->command_new.
3852 * Note that "caret" ("^") is treated specially, and is used to
3853 * allow manual input of control characters. This can be used
3854 * on many machines to request repeated tunneling (Ctrl-H) and
3855 * on the Macintosh to request "Control-Caret".
3857 * Note that "backslash" is treated specially, and is used to bypass any
3858 * keymap entry for the following character. This is useful for macros.
3860 * Note that this command is used both in the dungeon and in
3861 * stores, and must be careful to work in both situations.
3863 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
3865 void request_command(int shopping)
3879 if (rogue_like_commands)
3881 mode = KEYMAP_MODE_ROGUE;
3887 mode = KEYMAP_MODE_ORIG;
3891 /* No command yet */
3894 /* No "argument" yet */
3897 /* No "direction" yet */
3906 /* Hack -- auto-commands */
3909 /* Flush messages */
3912 /* Use auto-command */
3913 cmd = (unsigned char)command_new;
3919 /* Get a keypress in "command" mode */
3924 /* Hack -- no flush needed */
3928 /* Activate "command mode" */
3934 if (!shopping && command_menu && ((sub_cmd == '\r') || (sub_cmd == 'x') || (sub_cmd == 'X'))
3935 && !keymap_act[mode][(byte)(sub_cmd)])
3938 int num = 0, max_num, old_num = 0;
3942 if (py - panel_row_min > 10) basey = 2;
3946 /* Clear top line */
3954 if (!menu) old_num = num;
3955 put_str("+----------------------------------------------------+", basey, basex);
3956 put_str("| |", basey+1, basex);
3957 put_str("| |", basey+2, basex);
3958 put_str("| |", basey+3, basex);
3959 put_str("| |", basey+4, basex);
3960 put_str("| |", basey+5, basex);
3961 put_str("+----------------------------------------------------+", basey+6, basex);
3963 for(i = 0; i < 10; i++)
3966 if (!menu_info[menu][i].cmd) break;
3967 menu_name = menu_info[menu][i].name;
3968 for(hoge = 0; ; hoge++)
3970 if (!special_menu_info[hoge].name[0]) break;
3971 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3972 switch(special_menu_info[hoge].jouken)
3975 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3978 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
3980 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3987 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
3990 kisuu = max_num % 2;
3992 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3994 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3997 /* Place the cursor on the player */
3998 move_cursor_relative(py, px);
4002 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r'))
4004 if (menu_info[menu][num].fin)
4006 cmd = menu_info[menu][num].cmd;
4012 menu = menu_info[menu][num].cmd;
4018 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
4035 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
4040 num = (num + 2) % (max_num - 1);
4042 num = (num + 2) % (max_num + 1);
4044 else num = (num + 2) % max_num;
4046 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
4051 num = (num + max_num - 3) % (max_num - 1);
4053 num = (num + max_num - 1) % (max_num + 1);
4055 else num = (num + max_num - 2) % max_num;
4057 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
4059 if ((num % 2) || (num == max_num - 1))
4063 else if (num < max_num - 1)
4071 if (!inkey_next) inkey_next = "";
4076 /* Clear top line */
4083 int old_arg = command_arg;
4088 /* Begin the input */
4090 prt("²ó¿ô: ", 0, 0);
4092 prt("Count: ", 0, 0);
4096 /* Get a command count */
4099 /* Get a new keypress */
4102 /* Simple editing (delete or backspace) */
4103 if ((cmd == 0x7F) || (cmd == KTRL('H')))
4105 /* Delete a digit */
4106 command_arg = command_arg / 10;
4108 /* Show current count */
4110 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4112 prt(format("Count: %d", command_arg), 0, 0);
4117 /* Actual numeric data */
4118 else if (cmd >= '0' && cmd <= '9')
4120 /* Stop count at 9999 */
4121 if (command_arg >= 1000)
4130 /* Increase count */
4133 /* Incorporate that digit */
4134 command_arg = command_arg * 10 + D2I(cmd);
4137 /* Show current count */
4139 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4141 prt(format("Count: %d", command_arg), 0, 0);
4146 /* Exit on "unusable" input */
4153 /* Hack -- Handle "zero" */
4154 if (command_arg == 0)
4159 /* Show current count */
4161 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4163 prt(format("Count: %d", command_arg), 0, 0);
4168 /* Hack -- Handle "old_arg" */
4171 /* Restore old_arg */
4172 command_arg = old_arg;
4174 /* Show current count */
4176 prt(format("²ó¿ô: %d", command_arg), 0, 0);
4178 prt(format("Count: %d", command_arg), 0, 0);
4183 /* Hack -- white-space means "enter command now" */
4184 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
4186 /* Get a real command */
4188 if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
4190 if (!get_com("Command: ", (char *)&cmd, FALSE))
4204 /* Allow "keymaps" to be bypassed */
4207 /* Get a real command */
4209 (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
4211 (void)get_com("Command: ", (char *)&cmd, FALSE);
4215 /* Hack -- bypass keymaps */
4216 if (!inkey_next) inkey_next = "";
4220 /* Allow "control chars" to be entered */
4223 /* Get a new command and controlify it */
4225 if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4227 if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
4233 /* Look up applicable keymap */
4234 act = keymap_act[mode][(byte)(cmd)];
4236 /* Apply keymap if not inside a keymap already */
4237 if (act && !inkey_next)
4239 /* Install the keymap (limited buffer size) */
4240 (void)strnfmt(request_command_buffer, 256, "%s", act);
4242 /* Start using the buffer */
4243 inkey_next = request_command_buffer;
4261 /* Hack -- Auto-repeat certain commands */
4262 if (always_repeat && (command_arg <= 0))
4264 /* Hack -- auto repeat certain commands */
4265 if (strchr("TBDoc+", command_cmd))
4267 /* Repeat 99 times */
4276 switch (command_cmd)
4278 /* Command "p" -> "purchase" (get) */
4279 case 'p': command_cmd = 'g'; break;
4281 /* Command "m" -> "purchase" (get) */
4282 case 'm': command_cmd = 'g'; break;
4284 /* Command "s" -> "sell" (drop) */
4285 case 's': command_cmd = 'd'; break;
4290 for (i = 0; i < 256; i++)
4293 if ((s = keymap_act[mode][i]) != NULL)
4295 if (*s == command_cmd && *(s+1) == 0)
4303 caretcmd = command_cmd;
4305 /* Hack -- Scan equipment */
4306 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4310 object_type *o_ptr = &inventory[i];
4312 /* Skip non-objects */
4313 if (!o_ptr->k_idx) continue;
4315 /* No inscription */
4316 if (!o_ptr->inscription) continue;
4318 /* Obtain the inscription */
4319 s = quark_str(o_ptr->inscription);
4324 /* Process preventions */
4327 /* Check the "restriction" character */
4329 if ((s[1] == caretcmd) || (s[1] == '*'))
4331 if ((s[1] == command_cmd) || (s[1] == '*'))
4335 /* Hack -- Verify command */
4337 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4339 if (!get_check("Are you sure? "))
4343 /* Hack -- Use space */
4348 /* Find another '^' */
4349 s = strchr(s + 1, '^');
4354 /* Hack -- erase the message line. */
4361 * Check a char for "vowel-hood"
4363 bool is_a_vowel(int ch)
4388 * Replace the first instance of "target" in "buf" with "insert"
4389 * If "insert" is NULL, just remove the first instance of "target"
4390 * In either case, return TRUE if "target" is found.
4392 * XXX Could be made more efficient, especially in the
4393 * case where "insert" is smaller than "target".
4395 static bool insert_str(char *buf, cptr target, cptr insert)
4398 int b_len, t_len, i_len;
4400 /* Attempt to find the target (modify "buf") */
4401 buf = strstr(buf, target);
4403 /* No target found */
4404 if (!buf) return (FALSE);
4406 /* Be sure we have an insertion string */
4407 if (!insert) insert = "";
4409 /* Extract some lengths */
4410 t_len = strlen(target);
4411 i_len = strlen(insert);
4412 b_len = strlen(buf);
4414 /* How much "movement" do we need? */
4415 len = i_len - t_len;
4417 /* We need less space (for insert) */
4420 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4423 /* We need more space (for insert) */
4426 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4429 /* If movement occured, we need a new terminator */
4430 if (len) buf[b_len+len] = '\0';
4432 /* Now copy the insertion string */
4433 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4435 /* Successful operation */
4445 * Called from cmd4.c and a few other places. Just extracts
4446 * a direction from the keymap for ch (the last direction,
4447 * in fact) byte or char here? I'm thinking that keymaps should
4448 * generally only apply to single keys, which makes it no more
4449 * than 128, so a char should suffice... but keymap_act is 256...
4451 int get_keymap_dir(char ch)
4456 if (rogue_like_commands)
4458 act = keymap_act[KEYMAP_MODE_ROGUE][(byte)ch];
4462 act = keymap_act[KEYMAP_MODE_ORIG][(byte)ch];
4467 /* Convert to a direction */
4468 for (s = act; *s; ++s)
4470 /* Use any digits in keymap */
4471 if (isdigit(*s)) d = D2I(*s);
4478 #ifdef ALLOW_REPEAT /* TNB */
4480 #define REPEAT_MAX 20
4482 /* Number of chars saved */
4483 static int repeat__cnt = 0;
4486 static int repeat__idx = 0;
4489 static int repeat__key[REPEAT_MAX];
4492 void repeat_push(int what)
4495 if (repeat__cnt == REPEAT_MAX) return;
4497 /* Push the "stuff" */
4498 repeat__key[repeat__cnt++] = what;
4500 /* Prevents us from pulling keys */
4505 bool repeat_pull(int *what)
4507 /* All out of keys */
4508 if (repeat__idx == repeat__cnt) return (FALSE);
4510 /* Grab the next key, advance */
4511 *what = repeat__key[repeat__idx++];
4517 void repeat_check(void)
4521 /* Ignore some commands */
4522 if (command_cmd == ESCAPE) return;
4523 if (command_cmd == ' ') return;
4524 if (command_cmd == '\r') return;
4525 if (command_cmd == '\n') return;
4527 /* Repeat Last Command */
4528 if (command_cmd == 'n')
4533 /* Get the command */
4534 if (repeat_pull(&what))
4536 /* Save the command */
4541 /* Start saving new command */
4550 /* Save this command */
4555 #endif /* ALLOW_REPEAT -- TNB */
4561 * Array size for which InsertionSort
4562 * is used instead of QuickSort
4568 * Exchange two sort-entries
4569 * (should probably be coded inline
4570 * for speed increase)
4572 static void swap(tag_type *a, tag_type *b)
4577 temp.pointer = a->pointer;
4580 a->pointer = b->pointer;
4583 b->pointer = temp.pointer;
4588 * Insertion-Sort algorithm
4589 * (used by the Quicksort algorithm)
4591 static void InsertionSort(tag_type elements[], int number)
4597 for (P = 1; P < number; P++)
4600 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4601 elements[j] = elements[j - 1];
4608 * Helper function for Quicksort
4610 static tag_type median3(tag_type elements[], int left, int right)
4612 int center = (left + right) / 2;
4614 if (elements[left].tag > elements[center].tag)
4615 swap(&elements[left], &elements[center]);
4616 if (elements[left].tag > elements[right].tag)
4617 swap(&elements[left], &elements[right]);
4618 if (elements[center].tag > elements[right].tag)
4619 swap(&elements[center], &elements[right]);
4621 swap(&elements[center], &elements[right - 1]);
4622 return (elements[right - 1]);
4627 * Quicksort algorithm
4629 * The "median of three" pivot selection eliminates
4630 * the bad case of already sorted input.
4632 * We use InsertionSort for smaller sub-arrays,
4633 * because it is faster in this case.
4635 * For details see: "Data Structures and Algorithm
4636 * Analysis in C" by Mark Allen Weiss.
4638 static void quicksort(tag_type elements[], int left, int right)
4643 if (left + CUTOFF <= right)
4645 pivot = median3(elements, left, right);
4647 i = left; j = right -1;
4651 while (elements[++i].tag < pivot.tag);
4652 while (elements[--j].tag > pivot.tag);
4655 swap(&elements[i], &elements[j]);
4661 swap(&elements[i], &elements[right - 1]);
4663 quicksort(elements, left, i - 1);
4664 quicksort(elements, i + 1, right);
4668 /* Use InsertionSort on small arrays */
4669 InsertionSort(elements + left, right - left + 1);
4675 * Frontend for the sorting algorithm
4677 * Sorts an array of tagged pointers
4678 * with <number> elements.
4680 void tag_sort(tag_type elements[], int number)
4682 quicksort(elements, 0, number - 1);
4685 #endif /* SORT_R_INFO */
4687 #ifdef SUPPORT_GAMMA
4689 /* Table of gamma values */
4690 byte gamma_table[256];
4692 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4693 static s16b gamma_helper[256] =
4695 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4696 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4697 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4698 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4699 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4700 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4701 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4702 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4703 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4704 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4705 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4706 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4707 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4708 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4709 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4710 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4715 * Build the gamma table so that floating point isn't needed.
4717 * Note gamma goes from 0->256. The old value of 100 is now 128.
4719 void build_gamma_table(int gamma)
4724 * value is the current sum.
4725 * diff is the new term to add to the series.
4729 /* Hack - convergence is bad in these cases. */
4731 gamma_table[255] = 255;
4733 for (i = 1; i < 255; i++)
4736 * Initialise the Taylor series
4738 * value and diff have been scaled by 256
4743 diff = ((long)gamma_helper[i]) * (gamma - 256);
4752 * Use the following identiy to calculate the gamma table.
4753 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4755 * n is the current term number.
4757 * The gamma_helper array contains a table of
4759 * This is used because a^b = exp(b*ln(a))
4765 * Note that everything is scaled by 256 for accuracy,
4766 * plus another factor of 256 for the final result to
4767 * be from 0-255. Thus gamma_helper[] * gamma must be
4768 * divided by 256*256 each itteration, to get back to
4769 * the original power series.
4771 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4775 * Store the value in the table so that the
4776 * floating point pow function isn't needed .
4778 gamma_table[i] = ((long)(value / 256) * i) / 256;
4782 #endif /* SUPPORT_GAMMA */
4784 void roff_to_buf(cptr str, int maxlen, char *tbuf)
4790 unsigned char ch[3];
4793 while (str[read_pt])
4798 ch[0] = str[read_pt];
4801 kanji = iskanji(ch[0]);
4803 ch[1] = str[read_pt+1];
4804 if (!kanji && !isprint(ch[0]))
4807 if (!isprint(ch[0]))
4811 if (line_len >= maxlen - 1 || str[read_pt] == '\n')
4815 /* return to better wrapping point. */
4816 /* Space character at the end of the line need not to be printed. */
4817 word_len = read_pt - word_punct;
4818 if (ch[0] != ' ' && word_len < line_len/2)
4820 read_pt = word_punct;
4821 if (str[word_punct] == ' ')
4823 write_pt -= word_len;
4827 tbuf[write_pt++] = '\0';
4829 word_punct = read_pt;
4833 word_punct = read_pt;
4836 strcmp((char *)ch, "¡£") != 0 && strcmp((char *)ch, "¡¢") != 0 &&
4837 strcmp((char *)ch, "¥£") != 0 && strcmp((char *)ch, "¡¼") != 0)
4838 word_punct = read_pt;
4840 tbuf[write_pt++] = ch[0];
4846 tbuf[write_pt++] = ch[1];
4852 tbuf[write_pt] = '\0';
4853 tbuf[write_pt+1] = '\0';