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 */
134 if (islower(buf[0])) buf[0] = toupper(buf[0]);
135 #endif /* CAPITALIZE_USER_NAME */
141 /* Oops. Hack -- default to "PLAYER" */
142 strcpy(buf, "PLAYER");
151 * The concept of the "file" routines below (and elsewhere) is that all
152 * file handling should be done using as few routines as possible, since
153 * every machine is slightly different, but these routines always have the
156 * In fact, perhaps we should use the "path_parse()" routine below to convert
157 * from "canonical" filenames (optional leading tilde's, internal wildcards,
158 * slash as the path seperator, etc) to "system" filenames (no special symbols,
159 * system-specific path seperator, etc). This would allow the program itself
160 * to assume that all filenames are "Unix" filenames, and explicitly "extract"
161 * such filenames if needed (by "path_parse()", or perhaps "path_canon()").
163 * Note that "path_temp" should probably return a "canonical" filename.
165 * Note that "my_fopen()" and "my_open()" and "my_make()" and "my_kill()"
166 * and "my_move()" and "my_copy()" should all take "canonical" filenames.
168 * Note that "canonical" filenames use a leading "slash" to indicate an absolute
169 * path, and a leading "tilde" to indicate a special directory, and default to a
170 * relative path, but MSDOS uses a leading "drivename plus colon" to indicate the
171 * use of a "special drive", and then the rest of the path is parsed "normally",
172 * and MACINTOSH uses a leading colon to indicate a relative path, and an embedded
173 * colon to indicate a "drive plus absolute path", and finally defaults to a file
174 * in the current working directory, which may or may not be defined.
176 * We should probably parse a leading "~~/" as referring to "ANGBAND_DIR". (?)
184 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
194 * Extract a "parsed" path from an initial filename
195 * Normally, we simply copy the filename into the buffer
196 * But leading tilde symbols must be handled in a special way
197 * Replace "~user/" by the home directory of the user named "user"
198 * Replace "~/" by the home directory of the current user
200 errr path_parse(char *buf, int max, cptr file)
207 /* Assume no result */
211 if (!file) return (-1);
213 /* File needs no parsing */
220 /* Point at the user */
223 /* Look for non-user portion of the file */
224 s = strstr(u, PATH_SEP);
226 /* Hack -- no long user names */
227 if (s && (s >= u + sizeof(user))) return (1);
229 /* Extract a user name */
233 for (i = 0; u < s; ++i) user[i] = *u++;
238 /* Look up the "current" user */
239 if (u[0] == '\0') u = getlogin();
241 /* Look up a user (or "current" user) */
242 if (u) pw = getpwnam(u);
243 else pw = getpwuid(getuid());
248 /* Make use of the info */
249 (void)strcpy(buf, pw->pw_dir);
251 /* Append the rest of the filename, if any */
252 if (s) (void)strcat(buf, s);
263 * Extract a "parsed" path from an initial filename
265 * This requires no special processing on simple machines,
266 * except for verifying the size of the filename.
268 errr path_parse(char *buf, int max, cptr file)
270 /* Accept the filename */
271 (void)strnfmt(buf, max, "%s", file);
284 * Hack -- acquire a "temporary" file name if possible
286 * This filename is always in "system-specific" form.
288 static errr path_temp(char *buf, int max)
298 /* Format to length */
299 (void)strnfmt(buf, max, "%s", s);
308 * Create a new path by appending a file (or directory) to a path.
310 * This requires no special processing on simple machines, except
311 * for verifying the size of the filename, but note the ability to
312 * bypass the given "path" with certain special file-names.
314 * Note that the "file" may actually be a "sub-path", including
317 * Note that this function yields a path which must be "parsed"
318 * using the "parse" function above.
320 errr path_build(char *buf, int max, cptr path, cptr file)
325 /* Use the file itself */
326 (void)strnfmt(buf, max, "%s", file);
329 /* Absolute file, on "normal" systems */
330 else if (prefix(file, PATH_SEP) && !streq(PATH_SEP, ""))
332 /* Use the file itself */
333 (void)strnfmt(buf, max, "%s", file);
339 /* Use the file itself */
340 (void)strnfmt(buf, max, "%s", file);
346 /* Build the new path */
347 (void)strnfmt(buf, max, "%s%s%s", path, PATH_SEP, file);
356 * Hack -- replacement for "fopen()"
358 FILE *my_fopen(cptr file, cptr mode)
362 /* Hack -- Try to parse the path */
363 if (path_parse(buf, 1024, file)) return (NULL);
365 /* Attempt to fopen the file anyway */
366 return (fopen(buf, mode));
371 * Hack -- replacement for "fclose()"
373 errr my_fclose(FILE *fff)
376 if (!fff) return (-1);
378 /* Close, check for error */
379 if (fclose(fff) == EOF) return (1);
391 FILE *my_fopen_temp(char *buf, int max)
395 /* Prepare the buffer for mkstemp */
396 strncpy(buf, "/tmp/anXXXXXX", max);
398 /* Secure creation of a temporary file */
401 /* Check the file-descriptor */
402 if (fd < 0) return (NULL);
404 /* Return a file stream */
405 return (fdopen(fd, "w"));
408 #else /* HAVE_MKSTEMP */
410 FILE *my_fopen_temp(char *buf, int max)
412 /* Generate a temporary filename */
413 if (path_temp(buf, max)) return (NULL);
416 return (my_fopen(buf, "w"));
419 #endif /* HAVE_MKSTEMP */
423 * Hack -- replacement for "fgets()"
425 * Read a string, without a newline, to a file
427 * Process tabs, strip internal non-printables
429 errr my_fgets(FILE *fff, char *buf, huge n)
438 if (fgets(tmp, 1024, fff))
440 /* Convert weirdness */
441 for (s = tmp; *s; s++)
456 /* Hack -- require room */
457 if (i + 8 >= n) break;
462 /* Append some more spaces */
463 while (!(i % 8)) buf[i++] = ' ';
467 else if (iskanji(*s))
475 else if ((((int)*s & 0xff) > 0xa1) && (((int)*s & 0xff ) < 0xdf))
482 /* Handle printables */
483 else if (isprint(*s))
492 /* No newline character, but terminate */
508 * Hack -- replacement for "fputs()"
510 * Dump a string, plus a newline, to a file
512 * XXX XXX XXX Process internal weirdness?
514 errr my_fputs(FILE *fff, cptr buf, huge n)
519 /* Dump, ignore errors */
520 (void)fprintf(fff, "%s\n", buf);
531 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
533 * Many of them can be rewritten now that only "fd_open()" and "fd_make()"
534 * and "my_fopen()" should ever create files.
542 * Code Warrior is a little weird about some functions
545 extern int open(const char *, int, ...);
546 extern int close(int);
547 extern int read(int, void *, unsigned int);
548 extern int write(int, const void *, unsigned int);
549 extern long lseek(int, long, int);
550 #endif /* BEN_HACK */
554 * The Macintosh is a little bit brain-dead sometimes
557 # define open(N,F,M) \
558 ((M), open((char*)(N),F))
559 # define write(F,B,S) \
560 write(F,(char*)(B),S)
561 #endif /* MACINTOSH */
565 * Several systems have no "O_BINARY" flag
569 #endif /* O_BINARY */
573 * Hack -- attempt to delete a file
575 errr fd_kill(cptr file)
579 /* Hack -- Try to parse the path */
580 if (path_parse(buf, 1024, file)) return (-1);
591 * Hack -- attempt to move a file
593 errr fd_move(cptr file, cptr what)
598 /* Hack -- Try to parse the path */
599 if (path_parse(buf, 1024, file)) return (-1);
601 /* Hack -- Try to parse the path */
602 if (path_parse(aux, 1024, what)) return (-1);
605 (void)rename(buf, aux);
613 * Hack -- attempt to copy a file
615 errr fd_copy(cptr file, cptr what)
620 /* Hack -- Try to parse the path */
621 if (path_parse(buf, 1024, file)) return (-1);
623 /* Hack -- Try to parse the path */
624 if (path_parse(aux, 1024, what)) return (-1);
626 /* Copy XXX XXX XXX */
627 /* (void)rename(buf, aux); */
635 * Hack -- attempt to open a file descriptor (create file)
637 * This function should fail if the file already exists
639 * Note that we assume that the file should be "binary"
641 * XXX XXX XXX The horrible "BEN_HACK" code is for compiling under
642 * the CodeWarrior compiler, in which case, for some reason, none
643 * of the "O_*" flags are defined, and we must fake the definition
644 * of "O_RDONLY", "O_WRONLY", and "O_RDWR" in "A-win-h", and then
645 * we must simulate the effect of the proper "open()" call below.
647 int fd_make(cptr file, int mode)
651 /* Hack -- Try to parse the path */
652 if (path_parse(buf, 1024, file)) return (-1);
656 /* Check for existance */
657 /* if (fd_close(fd_open(file, O_RDONLY | O_BINARY))) return (1); */
659 /* Mega-Hack -- Create the file */
660 (void)my_fclose(my_fopen(file, "wb"));
662 /* Re-open the file for writing */
663 return (open(buf, O_WRONLY | O_BINARY, mode));
667 /* Create the file, fail if exists, write-only, binary */
668 return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
670 #endif /* BEN_HACK */
676 * Hack -- attempt to open a file descriptor (existing file)
678 * Note that we assume that the file should be "binary"
680 int fd_open(cptr file, int flags)
684 /* Hack -- Try to parse the path */
685 if (path_parse(buf, 1024, file)) return (-1);
687 /* Attempt to open the file */
688 return (open(buf, flags | O_BINARY, 0));
693 * Hack -- attempt to lock a file descriptor
695 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
697 errr fd_lock(int fd, int what)
700 what = what ? what : 0;
703 if (fd < 0) return (-1);
709 # if defined(F_ULOCK) && defined(F_LOCK)
714 /* Unlock it, Ignore errors */
715 lockf(fd, F_ULOCK, 0);
721 /* Lock the score file */
722 if (lockf(fd, F_LOCK, 0) != 0) return (1);
729 # if defined(LOCK_UN) && defined(LOCK_EX)
734 /* Unlock it, Ignore errors */
735 (void)flock(fd, LOCK_UN);
741 /* Lock the score file */
742 if (flock(fd, LOCK_EX) != 0) return (1);
757 * Hack -- attempt to seek on a file descriptor
759 errr fd_seek(int fd, huge n)
764 if (fd < 0) return (-1);
766 /* Seek to the given position */
767 p = lseek(fd, n, SEEK_SET);
770 if (p < 0) return (1);
773 if (p != n) return (1);
781 * Hack -- attempt to truncate a file descriptor
783 errr fd_chop(int fd, huge n)
789 if (fd < 0) return (-1);
791 #if defined(SUNOS) || defined(ULTRIX) || defined(NeXT)
802 * Hack -- attempt to read data from a file descriptor
804 errr fd_read(int fd, char *buf, huge n)
807 if (fd < 0) return (-1);
815 if (read(fd, buf, 16384) != 16384) return (1);
817 /* Shorten the task */
820 /* Shorten the task */
826 /* Read the final piece */
827 if (read(fd, buf, n) != (int)n) return (1);
835 * Hack -- Attempt to write data to a file descriptor
837 errr fd_write(int fd, cptr buf, huge n)
840 if (fd < 0) return (-1);
848 if (write(fd, buf, 16384) != 16384) return (1);
850 /* Shorten the task */
853 /* Shorten the task */
859 /* Write the final piece */
860 if (write(fd, buf, n) != (int)n) return (1);
868 * Hack -- attempt to close a file descriptor
870 errr fd_close(int fd)
873 if (fd < 0) return (-1);
889 * XXX XXX XXX Important note about "colors" XXX XXX XXX
891 * The "TERM_*" color definitions list the "composition" of each
892 * "Angband color" in terms of "quarters" of each of the three color
893 * components (Red, Green, Blue), for example, TERM_UMBER is defined
894 * as 2/4 Red, 1/4 Green, 0/4 Blue.
896 * The following info is from "Torbjorn Lindgren" (see "main-xaw.c").
898 * These values are NOT gamma-corrected. On most machines (with the
899 * Macintosh being an important exception), you must "gamma-correct"
900 * the given values, that is, "correct for the intrinsic non-linearity
901 * of the phosphor", by converting the given intensity levels based
902 * on the "gamma" of the target screen, which is usually 1.7 (or 1.5).
904 * The actual formula for conversion is unknown to me at this time,
905 * but you can use the table below for the most common gamma values.
907 * So, on most machines, simply convert the values based on the "gamma"
908 * of the target screen, which is usually in the range 1.5 to 1.7, and
909 * usually is closest to 1.7. The converted value for each of the five
910 * different "quarter" values is given below:
912 * Given Gamma 1.0 Gamma 1.5 Gamma 1.7 Hex 1.7
913 * ----- ---- ---- ---- ---
914 * 0/4 0.00 0.00 0.00 #00
915 * 1/4 0.25 0.27 0.28 #47
916 * 2/4 0.50 0.55 0.56 #8f
917 * 3/4 0.75 0.82 0.84 #d7
918 * 4/4 1.00 1.00 1.00 #ff
920 * Note that some machines (i.e. most IBM machines) are limited to a
921 * hard-coded set of colors, and so the information above is useless.
923 * Also, some machines are limited to a pre-determined set of colors,
924 * for example, the IBM can only display 16 colors, and only 14 of
925 * those colors resemble colors used by Angband, and then only when
926 * you ignore the fact that "Slate" and "cyan" are not really matches,
927 * so on the IBM, we use "orange" for both "Umber", and "Light Umber"
928 * in addition to the obvious "Orange", since by combining all of the
929 * "indeterminate" colors into a single color, the rest of the colors
930 * are left with "meaningful" values.
937 void move_cursor(int row, int col)
939 Term_gotoxy(col, row);
945 * Convert a decimal to a single digit octal number
947 static char octify(uint i)
949 return (hexsym[i%8]);
953 * Convert a decimal to a single digit hex number
955 static char hexify(uint i)
957 return (hexsym[i%16]);
962 * Convert a octal-digit into a decimal
964 static int deoct(char c)
966 if (isdigit(c)) return (D2I(c));
971 * Convert a hexidecimal-digit into a decimal
973 static int dehex(char c)
975 if (isdigit(c)) return (D2I(c));
976 if (islower(c)) return (A2I(c) + 10);
977 if (isupper(c)) return (A2I(tolower(c)) + 10);
983 * Hack -- convert a printable string into real ascii
985 * I have no clue if this function correctly handles, for example,
986 * parsing "\xFF" into a (signed) char. Whoever thought of making
987 * the "sign" of a "char" undefined is a complete moron. Oh well.
989 void text_to_ascii(char *buf, cptr str)
993 /* Analyze the "ascii" string */
996 /* Backslash codes */
999 /* Skip the backslash */
1005 *s = 16 * dehex(*++str);
1006 *s++ += dehex(*++str);
1009 /* Hack -- simple way to specify "backslash" */
1010 else if (*str == '\\')
1015 /* Hack -- simple way to specify "caret" */
1016 else if (*str == '^')
1021 /* Hack -- simple way to specify "space" */
1022 else if (*str == 's')
1027 /* Hack -- simple way to specify Escape */
1028 else if (*str == 'e')
1034 else if (*str == 'b')
1040 else if (*str == 'n')
1046 else if (*str == 'r')
1052 else if (*str == 't')
1058 else if (*str == '0')
1060 *s = 8 * deoct(*++str);
1061 *s++ += deoct(*++str);
1065 else if (*str == '1')
1067 *s = 64 + 8 * deoct(*++str);
1068 *s++ += deoct(*++str);
1072 else if (*str == '2')
1074 *s = 64 * 2 + 8 * deoct(*++str);
1075 *s++ += deoct(*++str);
1079 else if (*str == '3')
1081 *s = 64 * 3 + 8 * deoct(*++str);
1082 *s++ += deoct(*++str);
1085 /* Skip the final char */
1089 /* Normal Control codes */
1090 else if (*str == '^')
1093 *s++ = (*str++ & 037);
1109 * Hack -- convert a string into a printable form
1111 void ascii_to_text(char *buf, cptr str)
1115 /* Analyze the "ascii" string */
1118 byte i = (byte)(*str++);
1173 *s++ = octify(i / 8);
1174 *s++ = octify(i % 8);
1180 *s++ = hexify(i / 16);
1181 *s++ = hexify(i % 16);
1192 * The "macro" package
1194 * Functions are provided to manipulate a collection of macros, each
1195 * of which has a trigger pattern string and a resulting action string
1196 * and a small set of flags.
1202 * Determine if any macros have ever started with a given character.
1204 static bool macro__use[256];
1208 * Find the macro (if any) which exactly matches the given pattern
1210 sint macro_find_exact(cptr pat)
1214 /* Nothing possible */
1215 if (!macro__use[(byte)(pat[0])])
1220 /* Scan the macros */
1221 for (i = 0; i < macro__num; ++i)
1223 /* Skip macros which do not match the pattern */
1224 if (!streq(macro__pat[i], pat)) continue;
1236 * Find the first macro (if any) which contains the given pattern
1238 static sint macro_find_check(cptr pat)
1242 /* Nothing possible */
1243 if (!macro__use[(byte)(pat[0])])
1248 /* Scan the macros */
1249 for (i = 0; i < macro__num; ++i)
1251 /* Skip macros which do not contain the pattern */
1252 if (!prefix(macro__pat[i], pat)) continue;
1264 * Find the first macro (if any) which contains the given pattern and more
1266 static sint macro_find_maybe(cptr pat)
1270 /* Nothing possible */
1271 if (!macro__use[(byte)(pat[0])])
1276 /* Scan the macros */
1277 for (i = 0; i < macro__num; ++i)
1279 /* Skip macros which do not contain the pattern */
1280 if (!prefix(macro__pat[i], pat)) continue;
1282 /* Skip macros which exactly match the pattern XXX XXX */
1283 if (streq(macro__pat[i], pat)) continue;
1295 * Find the longest macro (if any) which starts with the given pattern
1297 static sint macro_find_ready(cptr pat)
1299 int i, t, n = -1, s = -1;
1301 /* Nothing possible */
1302 if (!macro__use[(byte)(pat[0])])
1307 /* Scan the macros */
1308 for (i = 0; i < macro__num; ++i)
1310 /* Skip macros which are not contained by the pattern */
1311 if (!prefix(pat, macro__pat[i])) continue;
1313 /* Obtain the length of this macro */
1314 t = strlen(macro__pat[i]);
1316 /* Only track the "longest" pattern */
1317 if ((n >= 0) && (s > t)) continue;
1319 /* Track the entry */
1330 * Add a macro definition (or redefinition).
1332 * We should use "act == NULL" to "remove" a macro, but this might make it
1333 * impossible to save the "removal" of a macro definition. XXX XXX XXX
1335 * We should consider refusing to allow macros which contain existing macros,
1336 * or which are contained in existing macros, because this would simplify the
1337 * macro analysis code. XXX XXX XXX
1339 * We should consider removing the "command macro" crap, and replacing it
1340 * with some kind of "powerful keymap" ability, but this might make it hard
1341 * to change the "roguelike" option from inside the game. XXX XXX XXX
1343 errr macro_add(cptr pat, cptr act)
1348 /* Paranoia -- require data */
1349 if (!pat || !act) return (-1);
1352 /* Look for any existing macro */
1353 n = macro_find_exact(pat);
1355 /* Replace existing macro */
1358 /* Free the old macro action */
1359 string_free(macro__act[n]);
1362 /* Create a new macro */
1365 /* Acquire a new index */
1368 /* Save the pattern */
1369 macro__pat[n] = string_make(pat);
1372 /* Save the action */
1373 macro__act[n] = string_make(act);
1376 macro__use[(byte)(pat[0])] = TRUE;
1385 * Initialize the "macro" package
1387 errr macro_init(void)
1389 /* Macro patterns */
1390 C_MAKE(macro__pat, MACRO_MAX, cptr);
1393 C_MAKE(macro__act, MACRO_MAX, cptr);
1400 * Local variable -- we are inside a "macro action"
1402 * Do not match any macros until "ascii 30" is found.
1404 static bool parse_macro = FALSE;
1407 * Local variable -- we are inside a "macro trigger"
1409 * Strip all keypresses until a low ascii value is found.
1411 static bool parse_under = FALSE;
1415 * Flush all input chars. Actually, remember the flush,
1416 * and do a "special flush" before the next "inkey()".
1418 * This is not only more efficient, but also necessary to make sure
1419 * that various "inkey()" codes are not "lost" along the way.
1429 * Flush the screen, make a noise
1433 /* Mega-Hack -- Flush the output */
1436 /* Make a bell noise (if allowed) */
1437 if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);
1439 /* Flush the input (later!) */
1445 * Hack -- Make a (relevant?) sound
1450 if (!use_sound) return;
1452 /* Make a sound (if allowed) */
1453 Term_xtra(TERM_XTRA_SOUND, val);
1459 * Helper function called only from "inkey()"
1461 * This function does almost all of the "macro" processing.
1463 * We use the "Term_key_push()" function to handle "failed" macros, as well
1464 * as "extra" keys read in while choosing the proper macro, and also to hold
1465 * the action for the macro, plus a special "ascii 30" character indicating
1466 * that any macro action in progress is complete. Embedded macros are thus
1467 * illegal, unless a macro action includes an explicit "ascii 30" character,
1468 * which would probably be a massive hack, and might break things.
1470 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
1471 * the macro trigger sequence. If a key sequence forms the "prefix" of a
1472 * macro trigger, 500 milliseconds must pass before the key sequence is
1473 * known not to be that macro trigger. XXX XXX XXX
1475 static char inkey_aux(void)
1477 int k = 0, n, p = 0, w = 0;
1485 /* Hack : ¥¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ²±¤ÏÉÔÍס£*/
1488 /* Wait for a keypress */
1489 (void)(Term_inkey(&ch, TRUE, TRUE));
1492 /* End "macro action" */
1493 if (ch == 30) parse_macro = FALSE;
1495 /* Inside "macro action" */
1496 if (ch == 30) return (ch);
1498 /* Inside "macro action" */
1499 if (parse_macro) return (ch);
1501 /* Inside "macro trigger" */
1502 if (parse_under) return (ch);
1505 /* Save the first key, advance */
1510 /* Check for possible macro */
1511 k = macro_find_check(buf);
1513 /* No macro pending */
1514 if (k < 0) return (ch);
1517 /* Wait for a macro, or a timeout */
1520 /* Check for pending macro */
1521 k = macro_find_maybe(buf);
1523 /* No macro pending */
1526 /* Check for (and remove) a pending key */
1527 if (0 == Term_inkey(&ch, FALSE, TRUE))
1529 /* Append the key */
1540 /* Increase "wait" */
1543 /* Excessive delay */
1544 if (w >= 100) break;
1547 Term_xtra(TERM_XTRA_DELAY, w);
1552 /* Check for available macro */
1553 k = macro_find_ready(buf);
1555 /* No macro available */
1558 /* Push all the keys back on the queue */
1561 /* Push the key, notice over-flow */
1562 if (Term_key_push(buf[--p])) return (0);
1565 /* Wait for (and remove) a pending key */
1566 (void)Term_inkey(&ch, TRUE, TRUE);
1568 /* Return the key */
1573 /* Get the pattern */
1574 pat = macro__pat[k];
1576 /* Get the length of the pattern */
1579 /* Push the "extra" keys back on the queue */
1582 /* Push the key, notice over-flow */
1583 if (Term_key_push(buf[--p])) return (0);
1587 /* Begin "macro action" */
1590 /* Push the "end of macro action" key */
1591 if (Term_key_push(30)) return (0);
1594 /* Access the macro action */
1595 act = macro__act[k];
1597 /* Get the length of the action */
1600 /* Push the macro "action" onto the key queue */
1603 /* Push the key, notice over-flow */
1604 if (Term_key_push(act[--n])) return (0);
1608 /* Hack -- Force "inkey()" to call us again */
1614 * Mega-Hack -- special "inkey_next" pointer. XXX XXX XXX
1616 * This special pointer allows a sequence of keys to be "inserted" into
1617 * the stream of keys returned by "inkey()". This key sequence will not
1618 * trigger any macros, and cannot be bypassed by the Borg. It is used
1619 * in Angband to handle "keymaps".
1621 static cptr inkey_next = NULL;
1627 * Mega-Hack -- special "inkey_hack" hook. XXX XXX XXX
1629 * This special function hook allows the "Borg" (see elsewhere) to take
1630 * control of the "inkey()" function, and substitute in fake keypresses.
1632 char (*inkey_hack)(int flush_first) = NULL;
1634 #endif /* ALLOW_BORG */
1639 * Get a keypress from the user.
1641 * This function recognizes a few "global parameters". These are variables
1642 * which, if set to TRUE before calling this function, will have an effect
1643 * on this function, and which are always reset to FALSE by this function
1644 * before this function returns. Thus they function just like normal
1645 * parameters, except that most calls to this function can ignore them.
1647 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
1648 * and any macro processing in progress will be aborted. This flag is
1649 * set by the "flush()" function, which does not actually flush anything
1650 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
1652 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
1653 * keypress is available, instead of waiting for a keypress.
1655 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
1656 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
1657 * not return immediately, but will wait for a keypress for as long as the
1658 * normal macro matching code would, allowing the direct entry of macro
1659 * triggers. The "inkey_base" flag is extremely dangerous!
1661 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
1662 * normal command, and we will only show the cursor if "hilite_player" is
1663 * TRUE (or if the player is in a store), instead of always showing the
1664 * cursor. The various "main-xxx.c" files should avoid saving the game
1665 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
1666 * prevent savefile corruption.
1668 * If we are waiting for a keypress, and no keypress is ready, then we will
1669 * refresh (once) the window which was active when this function was called.
1671 * Note that "back-quote" is automatically converted into "escape" for
1672 * convenience on machines with no "escape" key. This is done after the
1673 * macro matching, so the user can still make a macro for "backquote".
1675 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
1676 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
1677 * provide support for simple keyboard "macros". These keys are so strange
1678 * that their loss as normal keys will probably be noticed by nobody. The
1679 * "ascii 30" key is used to indicate the "end" of a macro action, which
1680 * allows recursive macros to be avoided. The "ascii 31" key is used by
1681 * some of the "main-xxx.c" files to introduce macro trigger sequences.
1683 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
1684 * which can be used to give a variety of "sub-commands" which can be used
1685 * any time. These sub-commands could include commands to take a picture of
1686 * the current screen, to start/stop recording a macro action, etc.
1688 * If "angband_term[0]" is not active, we will make it active during this
1689 * function, so that the various "main-xxx.c" files can assume that input
1690 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
1692 * Mega-Hack -- This function is used as the entry point for clearing the
1693 * "signal_count" variable, and of the "character_saved" variable.
1695 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
1697 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
1698 * control of the keyboard from the user.
1710 #endif /* USE_SCRIPT */
1712 /* Hack -- Use the "inkey_next" pointer */
1713 if (inkey_next && *inkey_next && !inkey_xtra)
1715 /* Get next character, and advance */
1718 /* Cancel the various "global parameters" */
1719 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1725 /* Forget pointer */
1731 /* Mega-Hack -- Use the special hook */
1732 if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
1734 /* Cancel the various "global parameters" */
1735 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1741 #endif /* ALLOW_BORG */
1745 if ((result = inkey_borg_callback(inkey_base, inkey_xtra, inkey_flag, inkey_scan)))
1747 /* Cancel the various "global parameters" */
1748 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1753 #endif /* USE_SCRIPT */
1756 /* Hack -- handle delayed "flush()" */
1759 /* End "macro action" */
1760 parse_macro = FALSE;
1762 /* End "macro trigger" */
1763 parse_under = FALSE;
1765 /* Forget old keypresses */
1770 /* Access cursor state */
1771 (void)Term_get_cursor(&v);
1773 /* Show the cursor if waiting, except sometimes in "command" mode */
1774 if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
1776 /* Show the cursor */
1777 (void)Term_set_cursor(1);
1781 /* Hack -- Activate main screen */
1782 Term_activate(angband_term[0]);
1788 /* Hack -- Handle "inkey_scan" */
1789 if (!inkey_base && inkey_scan &&
1790 (0 != Term_inkey(&kk, FALSE, FALSE)))
1796 /* Hack -- Flush output once when no key ready */
1797 if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
1799 /* Hack -- activate proper term */
1805 /* Hack -- activate main screen */
1806 Term_activate(angband_term[0]);
1808 /* Mega-Hack -- reset saved flag */
1809 character_saved = FALSE;
1811 /* Mega-Hack -- reset signal counter */
1819 /* Hack -- Handle "inkey_base" */
1827 /* Wait for (and remove) a pending key */
1828 if (0 == Term_inkey(&ch, TRUE, TRUE))
1841 /* Check for (and remove) a pending key */
1842 if (0 == Term_inkey(&ch, FALSE, TRUE))
1851 /* Increase "wait" */
1854 /* Excessive delay */
1855 if (w >= 100) break;
1858 Term_xtra(TERM_XTRA_DELAY, w);
1867 /* Get a key (see above) */
1871 /* Handle "control-right-bracket" */
1874 /* Strip this key */
1882 /* Treat back-quote as escape */
1883 // if (ch == '`') ch = ESCAPE;
1886 /* End "macro trigger" */
1887 if (parse_under && (ch <= 32))
1889 /* Strip this key */
1892 /* End "macro trigger" */
1893 parse_under = FALSE;
1897 /* Handle "control-caret" */
1900 /* Strip this key */
1904 /* Handle "control-underscore" */
1907 /* Strip this key */
1910 /* Begin "macro trigger" */
1914 /* Inside "macro trigger" */
1915 else if (parse_under)
1917 /* Strip this key */
1923 /* Hack -- restore the term */
1927 /* Restore the cursor */
1931 /* Cancel the various "global parameters" */
1932 inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;
1936 if ((result = inkey_callback(ch))) return result;
1938 #endif /* USE_SCRIPT */
1940 /* Return the keypress */
1948 * We use a global array for all inscriptions to reduce the memory
1949 * spent maintaining inscriptions. Of course, it is still possible
1950 * to run out of inscription memory, especially if too many different
1951 * inscriptions are used, but hopefully this will be rare.
1953 * We use dynamic string allocation because otherwise it is necessary
1954 * to pre-guess the amount of quark activity. We limit the total
1955 * number of quarks, but this is much easier to "expand" as needed.
1957 * Any two items with the same inscription will have the same "quark"
1958 * index, which should greatly reduce the need for inscription space.
1960 * Note that "quark zero" is NULL and should not be "dereferenced".
1964 * Add a new "quark" to the set of quarks.
1966 s16b quark_add(cptr str)
1970 /* Look for an existing quark */
1971 for (i = 1; i < quark__num; i++)
1973 /* Check for equality */
1974 if (streq(quark__str[i], str)) return (i);
1977 /* Paranoia -- Require room */
1978 if (quark__num == QUARK_MAX) return (0);
1980 /* New maximal quark */
1983 /* Add a new quark */
1984 quark__str[i] = string_make(str);
1986 /* Return the index */
1992 * This function looks up a quark
1994 cptr quark_str(s16b i)
1999 if ((i < 0) || (i >= quark__num)) i = 0;
2001 /* Access the quark */
2004 /* Return the quark */
2012 * Second try for the "message" handling routines.
2014 * Each call to "message_add(s)" will add a new "most recent" message
2015 * to the "message recall list", using the contents of the string "s".
2017 * The messages will be stored in such a way as to maximize "efficiency",
2018 * that is, we attempt to maximize the number of sequential messages that
2019 * can be retrieved, given a limited amount of storage space.
2021 * We keep a buffer of chars to hold the "text" of the messages, not
2022 * necessarily in "order", and an array of offsets into that buffer,
2023 * representing the actual messages. This is made more complicated
2024 * by the fact that both the array of indexes, and the buffer itself,
2025 * are both treated as "circular arrays" for efficiency purposes, but
2026 * the strings may not be "broken" across the ends of the array.
2028 * The "message_add()" function is rather "complex", because it must be
2029 * extremely efficient, both in space and time, for use with the Borg.
2035 * How many messages are "available"?
2037 s16b message_num(void)
2041 /* Extract the indexes */
2042 last = message__last;
2043 next = message__next;
2046 if (next < last) next += MESSAGE_MAX;
2048 /* Extract the space */
2051 /* Return the result */
2058 * Recall the "text" of a saved message
2060 cptr message_str(int age)
2066 /* Forgotten messages have no text */
2067 if ((age < 0) || (age >= message_num())) return ("");
2069 /* Acquire the "logical" index */
2070 x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;
2072 /* Get the "offset" for the message */
2073 o = message__ptr[x];
2075 /* Access the message text */
2076 s = &message__buf[o];
2078 /* Return the message text */
2085 * Add a new message, with great efficiency
2087 void message_add(cptr str)
2095 /*** Step 1 -- Analyze the message ***/
2097 /* Hack -- Ignore "non-messages" */
2100 /* Message length */
2103 /* Important Hack -- Ignore "long" messages */
2104 if (n >= MESSAGE_BUF / 4) return;
2106 /* extra step -- split the message if n>80. (added by Mogami) */
2111 for (n = 0; n < 80; n++, t++)
2116 if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
2118 for (n = 80; n > 60; n--)
2119 if (str[n] == ' ') break;
2123 splitted2 = str + n;
2124 strncpy(splitted1, str ,n);
2125 splitted1[n] = '\0';
2131 /*** Step 2 -- Attempt to optimize ***/
2133 /* Limit number of messages to check */
2138 /* Limit number of messages to check */
2139 if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;
2141 /* Check previous message */
2142 for (i = message__next; m; m--)
2151 /* Back up and wrap if needed */
2152 if (i-- == 0) i = MESSAGE_MAX - 1;
2154 /* Access the old string */
2155 old = &message__buf[message__ptr[i]];
2157 /* Skip small messages */
2164 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++)
2165 if( iskanji(*t))t++;
2167 for (t = buf; *t && (*t != '<'); t++);
2172 /* Message is too small */
2173 if (strlen(buf) < 6) break;
2175 /* Drop the space */
2178 /* Get multiplier */
2182 /* Limit the multiplier to 1000 */
2183 if (buf && streq(buf, str) && (j < 1000))
2193 sprintf(u, "%s <x%d>", buf, j);
2195 /* Message length */
2198 if (!now_message) now_message++;
2202 num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯*/
2210 /* Check the last few messages (if any to count) */
2211 for (i = message__next; k; k--)
2217 /* Back up and wrap if needed */
2218 if (i-- == 0) i = MESSAGE_MAX - 1;
2220 /* Stop before oldest message */
2221 if (i == message__last) break;
2223 /* Extract "distance" from "head" */
2224 q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;
2226 /* Do not optimize over large distance */
2227 if (q > MESSAGE_BUF / 2) continue;
2229 /* Access the old string */
2230 old = &message__buf[message__ptr[i]];
2233 if (!streq(old, str)) continue;
2235 /* Get the next message index, advance */
2236 x = message__next++;
2239 if (message__next == MESSAGE_MAX) message__next = 0;
2241 /* Kill last message if needed */
2242 if (message__next == message__last) message__last++;
2245 if (message__last == MESSAGE_MAX) message__last = 0;
2247 /* Assign the starting address */
2248 message__ptr[x] = message__ptr[i];
2252 goto end_of_message_add;
2257 /*** Step 3 -- Ensure space before end of buffer ***/
2259 /* Kill messages and Wrap if needed */
2260 if (message__head + n + 1 >= MESSAGE_BUF)
2262 /* Kill all "dead" messages */
2263 for (i = message__last; TRUE; i++)
2265 /* Wrap if needed */
2266 if (i == MESSAGE_MAX) i = 0;
2268 /* Stop before the new message */
2269 if (i == message__next) break;
2271 /* Kill "dead" messages */
2272 if (message__ptr[i] >= message__head)
2274 /* Track oldest message */
2275 message__last = i + 1;
2279 /* Wrap "tail" if needed */
2280 if (message__tail >= message__head) message__tail = 0;
2287 /*** Step 4 -- Ensure space before next message ***/
2289 /* Kill messages if needed */
2290 if (message__head + n + 1 > message__tail)
2292 /* Grab new "tail" */
2293 message__tail = message__head + n + 1;
2295 /* Advance tail while possible past first "nul" */
2296 while (message__buf[message__tail-1]) message__tail++;
2298 /* Kill all "dead" messages */
2299 for (i = message__last; TRUE; i++)
2301 /* Wrap if needed */
2302 if (i == MESSAGE_MAX) i = 0;
2304 /* Stop before the new message */
2305 if (i == message__next) break;
2307 /* Kill "dead" messages */
2308 if ((message__ptr[i] >= message__head) &&
2309 (message__ptr[i] < message__tail))
2311 /* Track oldest message */
2312 message__last = i + 1;
2318 /*** Step 5 -- Grab a new message index ***/
2320 /* Get the next message index, advance */
2321 x = message__next++;
2324 if (message__next == MESSAGE_MAX) message__next = 0;
2326 /* Kill last message if needed */
2327 if (message__next == message__last) message__last++;
2330 if (message__last == MESSAGE_MAX) message__last = 0;
2334 /*** Step 6 -- Insert the message text ***/
2336 /* Assign the starting address */
2337 message__ptr[x] = message__head;
2339 /* Append the new part of the message */
2340 for (i = 0; i < n; i++)
2342 /* Copy the message */
2343 message__buf[message__head + i] = str[i];
2347 message__buf[message__head + i] = '\0';
2349 /* Advance the "head" pointer */
2350 message__head += n + 1;
2352 /* recursively add splitted message (added by Mogami) */
2354 if (splitted2 != NULL)
2355 message_add(splitted2);
2363 static void msg_flush(int x)
2365 byte a = TERM_L_BLUE;
2366 bool nagasu = FALSE;
2368 if ((auto_more && !now_damaged) || num_more < 0){
2370 for (i = 0; i < 8; i++)
2372 if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
2376 if (num_more < angband_term[i]->hgt) nagasu = TRUE;
2383 now_damaged = FALSE;
2387 /* Pause for response */
2389 Term_putstr(x, 0, -1, a, "-³¤¯-");
2391 Term_putstr(x, 0, -1, a, "-more-");
2395 /* Get an acceptable keypress */
2399 if (cmd == ESCAPE) {
2400 num_more = -9999; /*auto_more¤Î¤È¤¡¢Á´¤Æή¤¹¡£*/
2402 } else if (cmd == ' ') {
2403 num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£*/
2405 } else if ((cmd == '\n') || (cmd == '\r')) {
2406 num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£*/
2409 if (quick_messages) break;
2414 /* Clear the line */
2415 Term_erase(0, 0, 255);
2420 * Output a message to the top line of the screen.
2422 * Break long messages into multiple pieces (40-72 chars).
2424 * Allow multiple short messages to "share" the top line.
2426 * Prompt the user to make sure he has a chance to read them.
2428 * These messages are memorized for later reference (see above).
2430 * We could do "Term_fresh()" to provide "flicker" if needed.
2432 * The global "msg_flag" variable can be cleared to tell us to
2433 * "erase" any "pending" messages still on the screen.
2435 * XXX XXX XXX Note that we must be very careful about using the
2436 * "msg_print()" functions without explicitly calling the special
2437 * "msg_print(NULL)" function, since this may result in the loss
2438 * of information if the screen is cleared, or if anything is
2439 * displayed on the top line.
2441 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
2442 * even if no messages are pending. This is probably a hack.
2444 void msg_print(cptr msg)
2454 if (world_monster) return;
2458 /* Clear the line */
2459 Term_erase(0, 0, 255);
2463 /* Message Length */
2464 n = (msg ? strlen(msg) : 0);
2466 /* Hack -- flush when requested or needed */
2467 if (p && (!msg || ((p + n) > 72)))
2484 if (n > 1000) return;
2487 /* Memorize the message */
2488 if (character_generated) message_add(msg);
2494 /* Analyze the buffer */
2501 int check, split = 72;
2504 bool k_flag = FALSE;
2507 /* Find the "best" split point */
2508 for (check = 0; check < 72; check++)
2516 /* Found a valid split point */
2517 if (iskanji(t[check]))
2522 else if (t[check] == ' ')
2535 /* Find the "best" split point */
2536 for (check = 40; check < 72; check++)
2538 /* Found a valid split point */
2539 if (t[check] == ' ') split = check;
2543 /* Save the split character */
2546 /* Split the message */
2549 /* Display part of the message */
2550 Term_putstr(0, 0, split, TERM_WHITE, t);
2553 msg_flush(split + 1);
2555 /* Memorize the piece */
2556 /* if (character_generated) message_add(t); */
2558 /* Restore the split character */
2561 /* Insert a space */
2564 /* Prepare to recurse on the rest of "buf" */
2565 t += split; n -= split;
2569 /* Display the tail of the message */
2570 Term_putstr(p, 0, n, TERM_WHITE, t);
2572 /* Memorize the tail */
2573 /* if (character_generated) message_add(t); */
2576 p_ptr->window |= (PW_MESSAGE);
2579 /* Remember the message */
2582 /* Remember the position */
2590 /* Optional refresh */
2591 if (fresh_message) Term_fresh();
2596 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
2598 static int screen_depth = 0;
2602 * Save the screen, and increase the "icky" depth.
2604 * This function must match exactly one call to "screen_load()".
2606 void screen_save(void)
2608 /* Hack -- Flush messages */
2611 /* Save the screen (if legal) */
2612 if (screen_depth++ == 0) Term_save();
2614 /* Increase "icky" depth */
2620 * Load the screen, and decrease the "icky" depth.
2622 * This function must match exactly one call to "screen_save()".
2624 void screen_load(void)
2626 /* Hack -- Flush messages */
2629 /* Load the screen (if legal) */
2630 if (--screen_depth == 0) Term_load();
2632 /* Decrease "icky" depth */
2638 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
2640 void msg_format(cptr fmt, ...)
2646 /* Begin the Varargs Stuff */
2649 /* Format the args, save the length */
2650 (void)vstrnfmt(buf, 1024, fmt, vp);
2652 /* End the Varargs Stuff */
2662 * Display a string on the screen using an attribute.
2664 * At the given location, using the given attribute, if allowed,
2665 * add the given string. Do not clear the line.
2667 void c_put_str(byte attr, cptr str, int row, int col)
2669 /* Position cursor, Dump the attr/text */
2670 Term_putstr(col, row, -1, attr, str);
2674 * As above, but in "white"
2676 void put_str(cptr str, int row, int col)
2679 Term_putstr(col, row, -1, TERM_WHITE, str);
2685 * Display a string on the screen using an attribute, and clear
2686 * to the end of the line.
2688 void c_prt(byte attr, cptr str, int row, int col)
2690 /* Clear line, position cursor */
2691 Term_erase(col, row, 255);
2693 /* Dump the attr/text */
2694 Term_addstr(-1, attr, str);
2698 * As above, but in "white"
2700 void prt(cptr str, int row, int col)
2703 c_prt(TERM_WHITE, str, row, col);
2710 * Print some (colored) text to the screen at the current cursor position,
2711 * automatically "wrapping" existing text (at spaces) when necessary to
2712 * avoid placing any text into the last column, and clearing every line
2713 * before placing any text in that line. Also, allow "newline" to force
2714 * a "wrap" to the next line. Advance the cursor as needed so sequential
2715 * calls to this function will work correctly.
2717 * Once this function has been called, the cursor should not be moved
2718 * until all the related "c_roff()" calls to the window are complete.
2720 * This function will correctly handle any width up to the maximum legal
2721 * value of 256, though it works best for a standard 80 character width.
2723 void c_roff(byte a, cptr str)
2731 /* Obtain the size */
2732 (void)Term_get_size(&w, &h);
2734 /* Obtain the cursor */
2735 (void)Term_locate(&x, &y);
2737 /* Hack -- No more space */
2738 if( y == h - 1 && x > w - 3) return;
2740 /* Process the string */
2741 for (s = str; *s; s++)
2746 int k_flag = iskanji(*s);
2758 /* Clear line, move cursor */
2759 Term_erase(x, y, 255);
2762 /* Clean up the char */
2764 ch = ((isprint(*s) || k_flag) ? *s : ' ');
2766 ch = (isprint(*s) ? *s : ' ');
2770 /* Wrap words as needed */
2772 if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
2774 if ((x >= w - 1) && (ch != ' '))
2787 /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
2791 /* Scan existing text */
2792 for (i = w - 2; i >= 0; i--)
2794 /* Grab existing attr/char */
2795 Term_what(i, y, &av[i], &cv[i]);
2797 /* Break on space */
2798 if (cv[i] == ' ') break;
2800 /* Track current word */
2803 if (cv[i] == '(') break;
2811 /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤ */
2812 /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
2813 if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
2814 #if 0 /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
2815 || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
2818 Term_what(x , y, &av[x ], &cv[x ]);
2819 Term_what(x-1, y, &av[x-1], &cv[x-1]);
2820 Term_what(x-2, y, &av[x-2], &cv[x-2]);
2831 Term_erase(n, y, 255);
2840 /* Clear line, move cursor */
2841 Term_erase(x, y, 255);
2843 /* Wrap the word (if any) */
2844 for (i = n; i < w - 1; i++)
2847 if( cv[i] == '\0' ) break;
2850 Term_addch(av[i], cv[i]);
2852 /* Advance (no wrap) */
2859 Term_addch(a|0x10, ch);
2871 Term_addch(a|0x20, ch);
2880 * As above, but in "white"
2885 c_roff(TERM_WHITE, str);
2892 * Clear part of the screen
2894 void clear_from(int row)
2898 /* Erase requested rows */
2899 for (y = row; y < Term->hgt; y++)
2901 /* Erase part of the screen */
2902 Term_erase(0, y, 255);
2910 * Get some input at the cursor location.
2911 * Assume the buffer is initialized to a default string.
2912 * Note that this string is often "empty" (see below).
2913 * The default buffer is displayed in yellow until cleared.
2914 * Pressing RETURN right away accepts the default entry.
2915 * Normal chars clear the default and append the char.
2916 * Backspace clears the default or deletes the final char.
2917 * ESCAPE clears the buffer and the window and returns FALSE.
2918 * RETURN accepts the current buffer contents and returns TRUE.
2920 bool askfor_aux(char *buf, int len)
2934 /* Locate the cursor */
2935 Term_locate(&x, &y);
2938 /* Paranoia -- check len */
2939 if (len < 1) len = 1;
2941 /* Paranoia -- check column */
2942 if ((x < 0) || (x >= 80)) x = 0;
2944 /* Restrict the length */
2945 if (x + len > 80) len = 80 - x;
2948 /* Paranoia -- Clip the default entry */
2952 /* Display the default answer */
2953 Term_erase(x, y, len);
2954 Term_putstr(x, y, -1, TERM_YELLOW, buf);
2961 Term_gotoxy(x + k, y);
2966 /* Analyze the key */
2997 { /* ÊÒ»³¤µ¤óºîÀ® */
3011 if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
3013 if(k<len && isprint(i)){
3022 if ((k < len) && (isprint(i)))
3038 /* Update the entry */
3039 Term_erase(x, y, len);
3040 Term_putstr(x, y, -1, TERM_WHITE, buf);
3044 if (i == ESCAPE) return (FALSE);
3052 * Get a string from the user
3054 * The "prompt" should take the form "Prompt: "
3056 * Note that the initial contents of the string is used as
3057 * the default response, so be sure to "clear" it if needed.
3059 * We clear the input, and return FALSE, on "ESCAPE".
3061 bool get_string(cptr prompt, char *buf, int len)
3065 /* Paranoia XXX XXX XXX */
3068 /* Display prompt */
3071 /* Ask the user for a string */
3072 res = askfor_aux(buf, len);
3083 * Verify something with the user
3085 * The "prompt" should take the form "Query? "
3087 * Note that "[y/n]" is appended to the prompt.
3089 bool get_check(cptr prompt)
3097 p_ptr->window |= PW_MESSAGE;
3102 /* Paranoia XXX XXX XXX */
3105 /* Hack -- Build a "useful" prompt */
3106 (void)strnfmt(buf, 78, "%.70s[y/n] ", prompt);
3111 /* Get an acceptable answer */
3115 // if (quick_messages) break;
3116 if (i == ESCAPE) break;
3117 if (strchr("YyNn", i)) break;
3121 /* Erase the prompt */
3124 /* Normal negation */
3125 if ((i != 'Y') && (i != 'y')) return (FALSE);
3133 * Prompts for a keypress
3135 * The "prompt" should take the form "Command: "
3137 * Returns TRUE unless the character is "Escape"
3139 bool get_com(cptr prompt, char *command, bool z_escape)
3141 /* Paranoia XXX XXX XXX */
3144 /* Display a prompt */
3150 /* Clear the prompt */
3153 /* Handle "cancel" */
3154 if (*command == ESCAPE) return (FALSE);
3155 if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);
3163 * Request a "quantity" from the user
3165 * Hack -- allow "command_arg" to specify a quantity
3167 s16b get_quantity(cptr prompt, int max)
3176 /* Use "command_arg" */
3179 /* Extract a number */
3182 /* Clear "command_arg" */
3185 /* Enforce the maximum */
3186 if (amt > max) amt = max;
3192 #ifdef ALLOW_REPEAT /* TNB */
3194 /* Get the item index */
3195 if ((max != 1) && repeat_pull(&amt))
3197 /* Enforce the maximum */
3198 if (amt > max) amt = max;
3200 /* Enforce the minimum */
3201 if (amt < 0) amt = 0;
3207 #endif /* ALLOW_REPEAT -- TNB */
3209 /* Build a prompt if needed */
3212 /* Build a prompt */
3214 sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
3216 sprintf(tmp, "Quantity (1-%d): ", max);
3220 /* Use that prompt */
3225 /* Default to one */
3228 /* Build the default */
3229 sprintf(buf, "%d", amt);
3231 /* Ask for a quantity */
3232 if (!get_string(prompt, buf, 6)) return (0);
3234 /* Extract a number */
3237 /* A letter means "all" */
3238 if (isalpha(buf[0])) amt = max;
3240 /* Enforce the maximum */
3241 if (amt > max) amt = max;
3243 /* Enforce the minimum */
3244 if (amt < 0) amt = 0;
3246 #ifdef ALLOW_REPEAT /* TNB */
3248 if (amt) repeat_push(amt);
3250 #endif /* ALLOW_REPEAT -- TNB */
3252 /* Return the result */
3258 * Pause for user response XXX XXX XXX
3260 void pause_line(int row)
3265 put_str("[ ²¿¤«¥¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
3267 put_str("[Press any key to continue]", row, 23);
3276 * Hack -- special buffer to hold the action of the current keymap
3278 static char request_command_buffer[256];
3290 menu_naiyou menu_info[10][10] =
3293 {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
3295 {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
3296 {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
3298 {"Èâ/È¢", 6, FALSE},
3301 {"¤½¤Î¾", 9, FALSE},
3306 {"»È¤¦(m)", 'm', TRUE},
3307 {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
3308 {"³Ð¤¨¤ë(G)", 'G', TRUE},
3309 {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
3319 {"µÙ©¤¹¤ë(R)", 'R', TRUE},
3320 {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
3321 {"õ¤¹(s)", 's', TRUE},
3322 {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
3323 {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
3324 {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
3325 {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
3326 {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
3327 {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
3328 {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
3332 {"Æɤà(r)", 'r', TRUE},
3333 {"°û¤à(q)", 'q', TRUE},
3334 {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
3335 {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
3336 {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
3337 {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
3338 {"¿©¤Ù¤ë(E)", 'E', TRUE},
3339 {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
3340 {"Åꤲ¤ë(v)", 'v', TRUE},
3345 {"½¦¤¦(g)", 'g', TRUE},
3346 {"Íî¤È¤¹(d)", 'd', TRUE},
3347 {"²õ¤¹(k/^d)", 'k', TRUE},
3348 {"Ìäò¹ï¤à({)", '{', TRUE},
3349 {"Ìäò¾Ã¤¹(})", '}', TRUE},
3350 {"Ä´ºº(I)", 'I', TRUE},
3351 {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
3358 {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
3359 {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
3360 {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
3361 {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
3371 {"³«¤±¤ë(o)", 'o', TRUE},
3372 {"ÊĤ¸¤ë(c)", 'c', TRUE},
3373 {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
3374 {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
3384 {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
3385 {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
3386 {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
3387 {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
3388 {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
3389 {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
3390 {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
3391 {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
3392 {"¥×¥ì¥¤µÏ¿(|)", '|', TRUE},
3397 {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
3398 {"¥Þ¥¯¥í(@)", '@', TRUE},
3399 {"²èÌÌɽ¼¨(%)", '%', TRUE},
3400 {"¥«¥é¡¼(&)", '&', TRUE},
3401 {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
3402 {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
3403 {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
3410 {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
3411 {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
3412 {"¥Ø¥ë¥×(?)", '?', TRUE},
3413 {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
3414 {"¥á¥â(:)", ':', TRUE},
3415 {"µÇ°»£±Æ())", ')', TRUE},
3416 {"µÇ°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
3417 {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
3418 {"°úÂह¤ë(Q)", 'Q', TRUE},
3423 menu_naiyou menu_info[10][10] =
3426 {"Magic/Special", 1, FALSE},
3427 {"Action", 2, FALSE},
3428 {"Items(use)", 3, FALSE},
3429 {"Items(other)", 4, FALSE},
3430 {"Equip", 5, FALSE},
3431 {"Door/Box", 6, FALSE},
3432 {"Infomations", 7, FALSE},
3433 {"Options", 8, FALSE},
3434 {"Other commands", 9, FALSE},
3439 {"Use(m)", 'm', TRUE},
3440 {"See tips(b/P)", 'b', TRUE},
3441 {"Study(G)", 'G', TRUE},
3442 {"Special abilities(U/O)", 'U', TRUE},
3452 {"Rest(R)", 'R', TRUE},
3453 {"Disarm a trap(D)", 'D', TRUE},
3454 {"Search(s)", 's', TRUE},
3455 {"Look(l/x)", 'l', TRUE},
3456 {"Target(*)", '*', TRUE},
3457 {"Dig(T/^t)", 'T', TRUE},
3458 {"Go up stairs(<)", '<', TRUE},
3459 {"Go down staies(>)", '>', TRUE},
3460 {"Command pets(p)", 'p', TRUE},
3461 {"Search mode ON/OFF(S/#)", 'S', TRUE}
3465 {"Read a scroll(r)", 'r', TRUE},
3466 {"Drink a potion(q)", 'q', TRUE},
3467 {"Use a staff(u/Z)", 'u', TRUE},
3468 {"Aim a wand(a/z)", 'a', TRUE},
3469 {"Zap a rod(z/a)", 'z', TRUE},
3470 {"Activate an equipment(A)", 'A', TRUE},
3471 {"Eat(E)", 'E', TRUE},
3472 {"Fire missile weapon(f/t)", 'f', TRUE},
3473 {"Throw an item(v)", 'v', TRUE},
3478 {"Get items(g)", 'g', TRUE},
3479 {"Drop an item(d)", 'd', TRUE},
3480 {"Destroy an item(k/^d)", 'k', TRUE},
3481 {"Inscribe an item({)", '{', TRUE},
3482 {"Uninscribe an item(})", '}', TRUE},
3483 {"Info about an item(I)", 'I', TRUE},
3484 {"Inventory list(i)", 'i', TRUE},
3491 {"Wear(w)", 'w', TRUE},
3492 {"Take off(t/T)", 't', TRUE},
3493 {"Refuel(F)", 'F', TRUE},
3494 {"Equipment list(e)", 'e', TRUE},
3504 {"Open(o)", 'o', TRUE},
3505 {"Close(c)", 'c', TRUE},
3506 {"Bash a door(B/f)", 'B', TRUE},
3507 {"Jam a door(j/S)", 'j', TRUE},
3517 {"Full map(M)", 'M', TRUE},
3518 {"Map(L/W)", 'L', TRUE},
3519 {"Level feeling(^f)", KTRL('F'), TRUE},
3520 {"Character status(C)", 'C', TRUE},
3521 {"Identify symbol(/)", '/', TRUE},
3522 {"Show prev messages(^p)", KTRL('P'), TRUE},
3523 {"Current time(^t/')", KTRL('T'), TRUE},
3524 {"Various infomations(~)", '~', TRUE},
3525 {"Play record menu(|)", '|', TRUE},
3530 {"Set options(=)", '=', TRUE},
3531 {"Interact with macros(@)", '@', TRUE},
3532 {"Interact w/ visuals(%)", '%', TRUE},
3533 {"Interact with colors(&)", '&', TRUE},
3534 {"Enter a user pref(\")", '\"', TRUE},
3535 {"Reload auto-pick pref($)", '$', TRUE},
3543 {"Save and quit(^x)", KTRL('X'), TRUE},
3544 {"Save(^s)", KTRL('S'), TRUE},
3545 {"Help(obsoleted)(?)", '?', TRUE},
3546 {"Redraw(^r)", KTRL('R'), TRUE},
3547 {"Take note(:)", ':', TRUE},
3548 {"Dump screen dump(()", ')', TRUE},
3549 {"Load screen dump())", '(', TRUE},
3550 {"Version info(V)", 'V', TRUE},
3551 {"Quit(Q)", 'Q', TRUE},
3564 } special_menu_naiyou;
3566 #define MENU_CLASS 1
3570 special_menu_naiyou special_menu_info[] =
3572 {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3573 {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3574 {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3575 {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3576 {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3577 {"¹°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
3578 {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
3582 special_menu_naiyou special_menu_info[] =
3584 {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
3585 {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
3586 {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
3587 {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
3588 {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
3589 {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
3590 {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
3596 * Request a command from the user.
3598 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
3599 * p_ptr->command_arg. May modify p_ptr->command_new.
3601 * Note that "caret" ("^") is treated specially, and is used to
3602 * allow manual input of control characters. This can be used
3603 * on many machines to request repeated tunneling (Ctrl-H) and
3604 * on the Macintosh to request "Control-Caret".
3606 * Note that "backslash" is treated specially, and is used to bypass any
3607 * keymap entry for the following character. This is useful for macros.
3609 * Note that this command is used both in the dungeon and in
3610 * stores, and must be careful to work in both situations.
3612 * Note that "p_ptr->command_new" may not work any more. XXX XXX XXX
3614 void request_command(int shopping)
3628 if (rogue_like_commands)
3630 mode = KEYMAP_MODE_ROGUE;
3636 mode = KEYMAP_MODE_ORIG;
3640 /* No command yet */
3643 /* No "argument" yet */
3646 /* No "direction" yet */
3655 /* Hack -- auto-commands */
3658 /* Flush messages */
3661 /* Use auto-command */
3662 cmd = (unsigned char)command_new;
3668 /* Get a keypress in "command" mode */
3673 /* Hack -- no flush needed */
3677 /* Activate "command mode" */
3683 if (!shopping && command_menu && ((sub_cmd == '\r') || (sub_cmd == 'x') || (sub_cmd == 'X'))
3684 && !keymap_act[mode][(byte)(sub_cmd)])
3687 int num = 0, max_num, old_num = 0;
3691 if (py - panel_row_min > 10) basey = 2;
3695 /* Clear top line */
3703 if (!menu) old_num = num;
3704 put_str("+----------------------------------------------------+", basey, basex);
3705 put_str("| |", basey+1, basex);
3706 put_str("| |", basey+2, basex);
3707 put_str("| |", basey+3, basex);
3708 put_str("| |", basey+4, basex);
3709 put_str("| |", basey+5, basex);
3710 put_str("+----------------------------------------------------+", basey+6, basex);
3712 for(i = 0; i < 10; i++)
3715 if (!menu_info[menu][i].cmd) break;
3716 menu_name = menu_info[menu][i].name;
3717 for(hoge = 0; ; hoge++)
3719 if (!special_menu_info[hoge].name[0]) break;
3720 if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
3721 switch(special_menu_info[hoge].jouken)
3724 if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3727 if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
3729 if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
3736 put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
3739 kisuu = max_num % 2;
3741 put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3743 put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
3746 /* Place the cursor on the player */
3747 move_cursor_relative(py, px);
3751 if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r'))
3753 if (menu_info[menu][num].fin)
3755 cmd = menu_info[menu][num].cmd;
3761 menu = menu_info[menu][num].cmd;
3767 else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
3784 else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
3789 num = (num + 2) % (max_num - 1);
3791 num = (num + 2) % (max_num + 1);
3793 else num = (num + 2) % max_num;
3795 else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
3800 num = (num + max_num - 3) % (max_num - 1);
3802 num = (num + max_num - 1) % (max_num + 1);
3804 else num = (num + max_num - 2) % max_num;
3806 else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
3808 if ((num % 2) || (num == max_num - 1))
3812 else if (num < max_num - 1)
3820 if (!inkey_next) inkey_next = "";
3825 /* Clear top line */
3832 int old_arg = command_arg;
3837 /* Begin the input */
3839 prt("²ó¿ô: ", 0, 0);
3841 prt("Count: ", 0, 0);
3845 /* Get a command count */
3848 /* Get a new keypress */
3851 /* Simple editing (delete or backspace) */
3852 if ((cmd == 0x7F) || (cmd == KTRL('H')))
3854 /* Delete a digit */
3855 command_arg = command_arg / 10;
3857 /* Show current count */
3859 prt(format("²ó¿ô: %d", command_arg), 0, 0);
3861 prt(format("Count: %d", command_arg), 0, 0);
3866 /* Actual numeric data */
3867 else if (cmd >= '0' && cmd <= '9')
3869 /* Stop count at 9999 */
3870 if (command_arg >= 1000)
3879 /* Increase count */
3882 /* Incorporate that digit */
3883 command_arg = command_arg * 10 + D2I(cmd);
3886 /* Show current count */
3888 prt(format("²ó¿ô: %d", command_arg), 0, 0);
3890 prt(format("Count: %d", command_arg), 0, 0);
3895 /* Exit on "unusable" input */
3902 /* Hack -- Handle "zero" */
3903 if (command_arg == 0)
3908 /* Show current count */
3910 prt(format("²ó¿ô: %d", command_arg), 0, 0);
3912 prt(format("Count: %d", command_arg), 0, 0);
3917 /* Hack -- Handle "old_arg" */
3920 /* Restore old_arg */
3921 command_arg = old_arg;
3923 /* Show current count */
3925 prt(format("²ó¿ô: %d", command_arg), 0, 0);
3927 prt(format("Count: %d", command_arg), 0, 0);
3932 /* Hack -- white-space means "enter command now" */
3933 if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
3935 /* Get a real command */
3937 if (!get_com("¥³¥Þ¥ó¥É: ", &cmd, FALSE))
3939 if (!get_com("Command: ", &cmd, FALSE))
3953 /* Allow "keymaps" to be bypassed */
3956 /* Get a real command */
3958 (void)get_com("¥³¥Þ¥ó¥É: ", &cmd, FALSE);
3960 (void)get_com("Command: ", &cmd, FALSE);
3964 /* Hack -- bypass keymaps */
3965 if (!inkey_next) inkey_next = "";
3969 /* Allow "control chars" to be entered */
3972 /* Get a new command and controlify it */
3974 if (get_com("CTRL: ", &cmd, FALSE)) cmd = KTRL(cmd);
3976 if (get_com("Control: ", &cmd, FALSE)) cmd = KTRL(cmd);
3982 /* Look up applicable keymap */
3983 act = keymap_act[mode][(byte)(cmd)];
3985 /* Apply keymap if not inside a keymap already */
3986 if (act && !inkey_next)
3988 /* Install the keymap (limited buffer size) */
3989 (void)strnfmt(request_command_buffer, 256, "%s", act);
3991 /* Start using the buffer */
3992 inkey_next = request_command_buffer;
4010 /* Hack -- Auto-repeat certain commands */
4011 if (always_repeat && (command_arg <= 0))
4013 /* Hack -- auto repeat certain commands */
4014 if (strchr("TBDoc+", command_cmd))
4016 /* Repeat 99 times */
4025 switch (command_cmd)
4027 /* Command "p" -> "purchase" (get) */
4028 case 'p': command_cmd = 'g'; break;
4030 /* Command "m" -> "purchase" (get) */
4031 case 'm': command_cmd = 'g'; break;
4033 /* Command "s" -> "sell" (drop) */
4034 case 's': command_cmd = 'd'; break;
4039 for (i = 0; i < 256; i++)
4042 if ((s = keymap_act[mode][i]) != NULL)
4044 if (*s == command_cmd && *(s+1) == 0)
4052 caretcmd = command_cmd;
4054 /* Hack -- Scan equipment */
4055 for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
4059 object_type *o_ptr = &inventory[i];
4061 /* Skip non-objects */
4062 if (!o_ptr->k_idx) continue;
4064 /* No inscription */
4065 if (!o_ptr->inscription) continue;
4067 /* Obtain the inscription */
4068 s = quark_str(o_ptr->inscription);
4073 /* Process preventions */
4076 /* Check the "restriction" character */
4078 if ((s[1] == caretcmd) || (s[1] == '*'))
4080 if ((s[1] == command_cmd) || (s[1] == '*'))
4084 /* Hack -- Verify command */
4086 if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
4088 if (!get_check("Are you sure? "))
4092 /* Hack -- Use space */
4097 /* Find another '^' */
4098 s = strchr(s + 1, '^');
4103 /* Hack -- erase the message line. */
4110 * Check a char for "vowel-hood"
4112 bool is_a_vowel(int ch)
4137 * Replace the first instance of "target" in "buf" with "insert"
4138 * If "insert" is NULL, just remove the first instance of "target"
4139 * In either case, return TRUE if "target" is found.
4141 * XXX Could be made more efficient, especially in the
4142 * case where "insert" is smaller than "target".
4144 static bool insert_str(char *buf, cptr target, cptr insert)
4147 int b_len, t_len, i_len;
4149 /* Attempt to find the target (modify "buf") */
4150 buf = strstr(buf, target);
4152 /* No target found */
4153 if (!buf) return (FALSE);
4155 /* Be sure we have an insertion string */
4156 if (!insert) insert = "";
4158 /* Extract some lengths */
4159 t_len = strlen(target);
4160 i_len = strlen(insert);
4161 b_len = strlen(buf);
4163 /* How much "movement" do we need? */
4164 len = i_len - t_len;
4166 /* We need less space (for insert) */
4169 for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
4172 /* We need more space (for insert) */
4175 for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
4178 /* If movement occured, we need a new terminator */
4179 if (len) buf[b_len+len] = '\0';
4181 /* Now copy the insertion string */
4182 for (i = 0; i < i_len; ++i) buf[i] = insert[i];
4184 /* Successful operation */
4194 * Called from cmd4.c and a few other places. Just extracts
4195 * a direction from the keymap for ch (the last direction,
4196 * in fact) byte or char here? I'm thinking that keymaps should
4197 * generally only apply to single keys, which makes it no more
4198 * than 128, so a char should suffice... but keymap_act is 256...
4200 int get_keymap_dir(char ch)
4205 if (rogue_like_commands)
4207 act = keymap_act[KEYMAP_MODE_ROGUE][(byte)ch];
4211 act = keymap_act[KEYMAP_MODE_ORIG][(byte)ch];
4216 /* Convert to a direction */
4217 for (s = act; *s; ++s)
4219 /* Use any digits in keymap */
4220 if (isdigit(*s)) d = D2I(*s);
4227 #ifdef ALLOW_REPEAT /* TNB */
4229 #define REPEAT_MAX 20
4231 /* Number of chars saved */
4232 static int repeat__cnt = 0;
4235 static int repeat__idx = 0;
4238 static int repeat__key[REPEAT_MAX];
4241 void repeat_push(int what)
4244 if (repeat__cnt == REPEAT_MAX) return;
4246 /* Push the "stuff" */
4247 repeat__key[repeat__cnt++] = what;
4249 /* Prevents us from pulling keys */
4254 bool repeat_pull(int *what)
4256 /* All out of keys */
4257 if (repeat__idx == repeat__cnt) return (FALSE);
4259 /* Grab the next key, advance */
4260 *what = repeat__key[repeat__idx++];
4266 void repeat_check(void)
4270 /* Ignore some commands */
4271 if (command_cmd == ESCAPE) return;
4272 if (command_cmd == ' ') return;
4273 if (command_cmd == '\r') return;
4274 if (command_cmd == '\n') return;
4276 /* Repeat Last Command */
4277 if (command_cmd == 'n')
4282 /* Get the command */
4283 if (repeat_pull(&what))
4285 /* Save the command */
4290 /* Start saving new command */
4299 /* Save this command */
4304 #endif /* ALLOW_REPEAT -- TNB */
4310 * Array size for which InsertionSort
4311 * is used instead of QuickSort
4317 * Exchange two sort-entries
4318 * (should probably be coded inline
4319 * for speed increase)
4321 static void swap(tag_type *a, tag_type *b)
4326 temp.pointer = a->pointer;
4329 a->pointer = b->pointer;
4332 b->pointer = temp.pointer;
4337 * Insertion-Sort algorithm
4338 * (used by the Quicksort algorithm)
4340 static void InsertionSort(tag_type elements[], int number)
4346 for (P = 1; P < number; P++)
4349 for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
4350 elements[j] = elements[j - 1];
4357 * Helper function for Quicksort
4359 static tag_type median3(tag_type elements[], int left, int right)
4361 int center = (left + right) / 2;
4363 if (elements[left].tag > elements[center].tag)
4364 swap(&elements[left], &elements[center]);
4365 if (elements[left].tag > elements[right].tag)
4366 swap(&elements[left], &elements[right]);
4367 if (elements[center].tag > elements[right].tag)
4368 swap(&elements[center], &elements[right]);
4370 swap(&elements[center], &elements[right - 1]);
4371 return (elements[right - 1]);
4376 * Quicksort algorithm
4378 * The "median of three" pivot selection eliminates
4379 * the bad case of already sorted input.
4381 * We use InsertionSort for smaller sub-arrays,
4382 * because it is faster in this case.
4384 * For details see: "Data Structures and Algorithm
4385 * Analysis in C" by Mark Allen Weiss.
4387 static void quicksort(tag_type elements[], int left, int right)
4392 if (left + CUTOFF <= right)
4394 pivot = median3(elements, left, right);
4396 i = left; j = right -1;
4400 while (elements[++i].tag < pivot.tag);
4401 while (elements[--j].tag > pivot.tag);
4404 swap(&elements[i], &elements[j]);
4410 swap(&elements[i], &elements[right - 1]);
4412 quicksort(elements, left, i - 1);
4413 quicksort(elements, i + 1, right);
4417 /* Use InsertionSort on small arrays */
4418 InsertionSort(elements + left, right - left + 1);
4424 * Frontend for the sorting algorithm
4426 * Sorts an array of tagged pointers
4427 * with <number> elements.
4429 void tag_sort(tag_type elements[], int number)
4431 quicksort(elements, 0, number - 1);
4434 #endif /* SORT_R_INFO */
4436 #ifdef SUPPORT_GAMMA
4438 /* Table of gamma values */
4439 byte gamma_table[256];
4441 /* Table of ln(x/256) * 256 for x going from 0 -> 255 */
4442 static s16b gamma_helper[256] =
4444 0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
4445 -710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
4446 -532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
4447 -429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
4448 -355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
4449 -298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
4450 -251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
4451 -212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
4452 -178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
4453 -147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
4454 -120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
4455 -96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
4456 -74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
4457 -53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
4458 -34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
4459 -17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
4464 * Build the gamma table so that floating point isn't needed.
4466 * Note gamma goes from 0->256. The old value of 100 is now 128.
4468 void build_gamma_table(int gamma)
4473 * value is the current sum.
4474 * diff is the new term to add to the series.
4478 /* Hack - convergence is bad in these cases. */
4480 gamma_table[255] = 255;
4482 for (i = 1; i < 255; i++)
4485 * Initialise the Taylor series
4487 * value and diff have been scaled by 256
4492 diff = ((long)gamma_helper[i]) * (gamma - 256);
4501 * Use the following identiy to calculate the gamma table.
4502 * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
4504 * n is the current term number.
4506 * The gamma_helper array contains a table of
4508 * This is used because a^b = exp(b*ln(a))
4514 * Note that everything is scaled by 256 for accuracy,
4515 * plus another factor of 256 for the final result to
4516 * be from 0-255. Thus gamma_helper[] * gamma must be
4517 * divided by 256*256 each itteration, to get back to
4518 * the original power series.
4520 diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
4524 * Store the value in the table so that the
4525 * floating point pow function isn't needed .
4527 gamma_table[i] = ((long)(value / 256) * i) / 256;
4531 #endif /* SUPPORT_GAMMA */
4533 void roff_to_buf(cptr str, int maxlen, char *tbuf)
4539 unsigned char ch[3];
4542 while (str[read_pt])
4547 ch[0] = str[read_pt];
4550 kanji = iskanji(ch[0]);
4552 ch[1] = str[read_pt+1];
4553 if (!kanji && !isprint(ch[0]))
4556 if (!isprint(ch[0]))
4560 if (line_len >= maxlen || str[read_pt] == '\n')
4564 /* return to better wrapping point. */
4565 /* Space character at the end of the line need not to be printed. */
4566 word_len = read_pt - word_punct;
4567 if (ch[0] != ' ' && word_len < line_len/2)
4569 read_pt = word_punct;
4570 if (str[word_punct] == ' ')
4572 write_pt -= word_len;
4576 tbuf[write_pt++] = '\0';
4578 word_punct = read_pt;
4582 word_punct = read_pt;
4585 strcmp(ch, "¡£") != 0 && strcmp(ch, "¡¢") != 0 &&
4586 strcmp(ch, "¥£") != 0 && strcmp(ch, "¡¼") != 0)
4587 word_punct = read_pt;
4589 tbuf[write_pt++] = ch[0];
4595 tbuf[write_pt++] = ch[1];
4601 tbuf[write_pt] = '\0';
4602 tbuf[write_pt+1] = '\0';