MPWでのCarbonコンパイル用の変更

[hengband/hengband.git] / src / util.c

/* File: util.c */

/*
 * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke
 *
 * This software may be copied and distributed for educational, research,
 * and not for profit purposes provided that this copyright and statement
 * are included in all such copies.  Other copyrights may also apply.
 */

/* Purpose: Angband utilities -BEN- */

#include "angband.h"




static int num_more = 0;

#if 0
#ifndef HAS_STRICMP

/*
 * For those systems that don't have "stricmp()"
 *
 * Compare the two strings "a" and "b" ala "strcmp()" ignoring case.
 */
int stricmp(cptr a, cptr b)
{
        cptr s1, s2;
        char z1, z2;

        /* Scan the strings */
        for (s1 = a, s2 = b; TRUE; s1++, s2++)
        {
                z1 = FORCEUPPER(*s1);
                z2 = FORCEUPPER(*s2);
                if (z1 < z2) return (-1);
                if (z1 > z2) return (1);
                if (!z1) return (0);
        }
}

#endif /* HAS_STRICMP */
#endif /* 0 */

#ifdef SET_UID

# ifndef HAVE_USLEEP

/*
 * For those systems that don't have "usleep()" but need it.
 *
 * Fake "usleep()" function grabbed from the inl netrek server -cba
 */
int usleep(huge usecs)
{
        struct timeval      Timer;

        int                 nfds = 0;

#ifdef FD_SET
        fd_set          *no_fds = NULL;
#else
        int                     *no_fds = NULL;
#endif


        /* Was: int readfds, writefds, exceptfds; */
        /* Was: readfds = writefds = exceptfds = 0; */


        /* Paranoia -- No excessive sleeping */
#ifdef JP
        if (usecs > 4000000L) core("ÉÔÅö¤Ê usleep() ¸Æ¤Ó½Ð¤·");
#else
        if (usecs > 4000000L) core("Illegal usleep() call");
#endif



        /* Wait for it */
        Timer.tv_sec = (usecs / 1000000L);
        Timer.tv_usec = (usecs % 1000000L);

        /* Wait for it */
        if (select(nfds, no_fds, no_fds, no_fds, &Timer) < 0)
        {
                /* Hack -- ignore interrupts */
                if (errno != EINTR) return -1;
        }

        /* Success */
        return 0;
}

# endif


/*
 * Hack -- External functions
 */
#ifdef SET_UID
extern struct passwd *getpwuid(uid_t uid);
extern struct passwd *getpwnam(const char *name);
#endif


/*
 * Find a default user name from the system.
 */
void user_name(char *buf, int id)
{
        struct passwd *pw;

        /* Look up the user name */
        if ((pw = getpwuid(id)))
        {
                (void)strcpy(buf, pw->pw_name);
                buf[16] = '\0';

#ifdef CAPITALIZE_USER_NAME
                /* Hack -- capitalize the user name */
#ifdef JP
                if (!iskanji(buf[0]))
#endif
                        if (islower(buf[0]))
                                buf[0] = toupper(buf[0]);
#endif /* CAPITALIZE_USER_NAME */

                return;
        }

        /* Oops.  Hack -- default to "PLAYER" */
        strcpy(buf, "PLAYER");
}

#endif /* SET_UID */




/*
 * The concept of the "file" routines below (and elsewhere) is that all
 * file handling should be done using as few routines as possible, since
 * every machine is slightly different, but these routines always have the
 * same semantics.
 *
 * In fact, perhaps we should use the "path_parse()" routine below to convert
 * from "canonical" filenames (optional leading tilde's, internal wildcards,
 * slash as the path seperator, etc) to "system" filenames (no special symbols,
 * system-specific path seperator, etc).  This would allow the program itself
 * to assume that all filenames are "Unix" filenames, and explicitly "extract"
 * such filenames if needed (by "path_parse()", or perhaps "path_canon()").
 *
 * Note that "path_temp" should probably return a "canonical" filename.
 *
 * Note that "my_fopen()" and "my_open()" and "my_make()" and "my_kill()"
 * and "my_move()" and "my_copy()" should all take "canonical" filenames.
 *
 * Note that "canonical" filenames use a leading "slash" to indicate an absolute
 * path, and a leading "tilde" to indicate a special directory, and default to a
 * relative path, but MSDOS uses a leading "drivename plus colon" to indicate the
 * use of a "special drive", and then the rest of the path is parsed "normally",
 * and MACINTOSH uses a leading colon to indicate a relative path, and an embedded
 * colon to indicate a "drive plus absolute path", and finally defaults to a file
 * in the current working directory, which may or may not be defined.
 *
 * We should probably parse a leading "~~/" as referring to "ANGBAND_DIR". (?)
 */


#ifdef ACORN


/*
 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
 */


#else /* ACORN */


#ifdef SET_UID

/*
 * Extract a "parsed" path from an initial filename
 * Normally, we simply copy the filename into the buffer
 * But leading tilde symbols must be handled in a special way
 * Replace "~user/" by the home directory of the user named "user"
 * Replace "~/" by the home directory of the current user
 */
errr path_parse(char *buf, int max, cptr file)
{
        cptr            u, s;
        struct passwd   *pw;
        char            user[128];


        /* Assume no result */
        buf[0] = '\0';

        /* No file? */
        if (!file) return (-1);

        /* File needs no parsing */
        if (file[0] != '~')
        {
                (void)strnfmt(buf, max, "%s", file);
                return (0);
        }

        /* Point at the user */
        u = file+1;

        /* Look for non-user portion of the file */
        s = strstr(u, PATH_SEP);

        /* Hack -- no long user names */
        if (s && (s >= u + sizeof(user))) return (1);

        /* Extract a user name */
        if (s)
        {
                int i;
                for (i = 0; u < s; ++i) user[i] = *u++;
                user[i] = '\0';
                u = user;
        }

        /* Look up the "current" user */
        if (u[0] == '\0') u = getlogin();

        /* Look up a user (or "current" user) */
        if (u) pw = getpwnam(u);
        else pw = getpwuid(getuid());

        /* Nothing found? */
        if (!pw) return (1);

        /* Make use of the info */
        if (s) strnfmt(buf, max, "%s%s", pw->pw_dir, s);
        else strnfmt(buf, max, "%s", pw->pw_dir);

        /* Success */
        return (0);
}


#else /* SET_UID */


/*
 * Extract a "parsed" path from an initial filename
 *
 * This requires no special processing on simple machines,
 * except for verifying the size of the filename.
 */
errr path_parse(char *buf, int max, cptr file)
{
        /* Accept the filename */
        (void)strnfmt(buf, max, "%s", file);

#if defined(MAC_MPW) && defined(CARBON)
     /* Fix it according to the current operating system */
    convert_pathname(buf);
#endif /* MAC_MPW && CARBON */

        /* Success */
        return (0);
}


#endif /* SET_UID */


#ifndef HAVE_MKSTEMP

/*
 * Hack -- acquire a "temporary" file name if possible
 *
 * This filename is always in "system-specific" form.
 */
static errr path_temp(char *buf, int max)
{
        cptr s;

        /* Temp file */
        s = tmpnam(NULL);

        /* Oops */
        if (!s) return (-1);

        /* Format to length */
        (void)strnfmt(buf, max, "%s", s);

        /* Success */
        return (0);
}

#endif

/*
 * Create a new path by appending a file (or directory) to a path.
 *
 * This requires no special processing on simple machines, except
 * for verifying the size of the filename, but note the ability to
 * bypass the given "path" with certain special file-names.
 *
 * Note that the "file" may actually be a "sub-path", including
 * a path and a file.
 *
 * Note that this function yields a path which must be "parsed"
 * using the "parse" function above.
 */
errr path_build(char *buf, int max, cptr path, cptr file)
{
        /* Special file */
        if (file[0] == '~')
        {
                /* Use the file itself */
                (void)strnfmt(buf, max, "%s", file);
        }

        /* Absolute file, on "normal" systems */
        else if (prefix(file, PATH_SEP) && !streq(PATH_SEP, ""))
        {
                /* Use the file itself */
                (void)strnfmt(buf, max, "%s", file);
        }

        /* No path given */
        else if (!path[0])
        {
                /* Use the file itself */
                (void)strnfmt(buf, max, "%s", file);
        }

        /* Path and File */
        else
        {
                /* Build the new path */
                (void)strnfmt(buf, max, "%s%s%s", path, PATH_SEP, file);
        }

        /* Success */
        return (0);
}


/*
 * Hack -- replacement for "fopen()"
 */
FILE *my_fopen(cptr file, cptr mode)
{
        char buf[1024];

#if defined(MACINTOSH) && defined(MAC_MPW)
        FILE *tempfff;
#endif

        /* Hack -- Try to parse the path */
        if (path_parse(buf, 1024, file)) return (NULL);

#if defined(MACINTOSH) && defined(MAC_MPW)
        if (strchr(mode, 'w'))
        {
                /* setting file type/creator */
                tempfff = fopen(buf, mode);
                fsetfileinfo(file, _fcreator, _ftype);
                fclose(tempfff);
        }
#endif

        /* Attempt to fopen the file anyway */
        return (fopen(buf, mode));
}


/*
 * Hack -- replacement for "fclose()"
 */
errr my_fclose(FILE *fff)
{
        /* Require a file */
        if (!fff) return (-1);

        /* Close, check for error */
        if (fclose(fff) == EOF) return (1);

        /* Success */
        return (0);
}


#endif /* ACORN */


#ifdef HAVE_MKSTEMP

FILE *my_fopen_temp(char *buf, int max)
{
        int fd;

        /* Prepare the buffer for mkstemp */
        strncpy(buf, "/tmp/anXXXXXX", max);

        /* Secure creation of a temporary file */
        fd = mkstemp(buf);

        /* Check the file-descriptor */
        if (fd < 0) return (NULL);

        /* Return a file stream */
        return (fdopen(fd, "w"));
}

#else /* HAVE_MKSTEMP */

FILE *my_fopen_temp(char *buf, int max)
{
        /* Generate a temporary filename */
        if (path_temp(buf, max)) return (NULL);

        /* Open the file */
        return (my_fopen(buf, "w"));
}

#endif /* HAVE_MKSTEMP */


/*
 * Hack -- replacement for "fgets()"
 *
 * Read a string, without a newline, to a file
 *
 * Process tabs, strip internal non-printables
 */
errr my_fgets(FILE *fff, char *buf, huge n)
{
        huge i = 0;

        char *s;

        char tmp[1024];

        /* Read a line */
        if (fgets(tmp, 1024, fff))
        {
                /* Convert weirdness */
                for (s = tmp; *s; s++)
                {
#if defined(MACINTOSH) || defined(MACH_O_CARBON)

                        /*
                         * Be nice to the Macintosh, where a file can have Mac or Unix
                         * end of line, especially since the introduction of OS X.
                         * MPW tools were also very tolerant to the Unix EOL.
                         */
                        if (*s == '\r') *s = '\n';

#endif /* MACINTOSH || MACH_O_CARBON */

                        /* Handle newline */
                        if (*s == '\n')
                        {
                                /* Terminate */
                                buf[i] = '\0';

                                /* Success */
                                return (0);
                        }

                        /* Handle tabs */
                        else if (*s == '\t')
                        {
                                /* Hack -- require room */
                                if (i + 8 >= n) break;

                                /* Append a space */
                                buf[i++] = ' ';

                                /* Append some more spaces */
                                while (!(i % 8)) buf[i++] = ' ';
                        }

#ifdef JP
                        else if (iskanji(*s))
                        {
                                if (!s[1]) break;
                                buf[i++] = *s++;
                                buf[i++] = *s;
                        }
# ifndef EUC
        /* Ⱦ³Ñ¤«¤Ê¤ËÂбþ */
                        else if ((((int)*s & 0xff) > 0xa1) && (((int)*s & 0xff ) < 0xdf))
                        {
                                buf[i++] = *s;
                                if (i >= n) break;
                        }
# endif
#endif
                        /* Handle printables */
                        else if (isprint(*s))
                        {
                                /* Copy */
                                buf[i++] = *s;

                                /* Check length */
                                if (i >= n) break;
                        }
                }
                /* No newline character, but terminate */
                buf[i] = '\0';

                /* Success */
                return (0);
        }

        /* Nothing */
        buf[0] = '\0';

        /* Failure */
        return (1);
}


/*
 * Hack -- replacement for "fputs()"
 *
 * Dump a string, plus a newline, to a file
 *
 * XXX XXX XXX Process internal weirdness?
 */
errr my_fputs(FILE *fff, cptr buf, huge n)
{
        /* XXX XXX */
        n = n ? n : 0;

        /* Dump, ignore errors */
        (void)fprintf(fff, "%s\n", buf);

        /* Success */
        return (0);
}


#ifdef ACORN


/*
 * Most of the "file" routines for "ACORN" should be in "main-acn.c"
 *
 * Many of them can be rewritten now that only "fd_open()" and "fd_make()"
 * and "my_fopen()" should ever create files.
 */


#else /* ACORN */


/*
 * Code Warrior is a little weird about some functions
 */
#ifdef BEN_HACK
extern int open(const char *, int, ...);
extern int close(int);
extern int read(int, void *, unsigned int);
extern int write(int, const void *, unsigned int);
extern long lseek(int, long, int);
#endif /* BEN_HACK */


/*
 * The Macintosh is a little bit brain-dead sometimes
 */
#ifdef MACINTOSH
# define open(N,F,M) \
((M), open((char*)(N),F))
# define write(F,B,S) \
write(F,(char*)(B),S)
#endif /* MACINTOSH */


/*
 * Several systems have no "O_BINARY" flag
 */
#ifndef O_BINARY
# define O_BINARY 0
#endif /* O_BINARY */


/*
 * Hack -- attempt to delete a file
 */
errr fd_kill(cptr file)
{
        char buf[1024];

        /* Hack -- Try to parse the path */
        if (path_parse(buf, 1024, file)) return (-1);

        /* Remove */
        (void)remove(buf);

        /* XXX XXX XXX */
        return (0);
}


/*
 * Hack -- attempt to move a file
 */
errr fd_move(cptr file, cptr what)
{
        char buf[1024];
        char aux[1024];

        /* Hack -- Try to parse the path */
        if (path_parse(buf, 1024, file)) return (-1);

        /* Hack -- Try to parse the path */
        if (path_parse(aux, 1024, what)) return (-1);

        /* Rename */
        (void)rename(buf, aux);

        /* XXX XXX XXX */
        return (0);
}


/*
 * Hack -- attempt to copy a file
 */
errr fd_copy(cptr file, cptr what)
{
        char buf[1024];
        char aux[1024];
        int read_num;
        int src_fd, dst_fd;

        /* Hack -- Try to parse the path */
        if (path_parse(buf, 1024, file)) return (-1);

        /* Hack -- Try to parse the path */
        if (path_parse(aux, 1024, what)) return (-1);

        /* Open source file */
        src_fd = fd_open(buf, O_RDONLY);
        if (src_fd < 0) return (-1);

        /* Open destination file */
        dst_fd = fd_open(aux, O_WRONLY|O_TRUNC|O_CREAT);
        if (dst_fd < 0) return (-1);

        /* Copy */
        while ((read_num = read(src_fd, buf, 1024)) > 0)
        {
                write(dst_fd, buf, read_num);
        }

        /* Close files */
        fd_close(src_fd);
        fd_close(dst_fd);

        /* XXX XXX XXX */
        return (0);
}


/*
 * Hack -- attempt to open a file descriptor (create file)
 *
 * This function should fail if the file already exists
 *
 * Note that we assume that the file should be "binary"
 *
 * XXX XXX XXX The horrible "BEN_HACK" code is for compiling under
 * the CodeWarrior compiler, in which case, for some reason, none
 * of the "O_*" flags are defined, and we must fake the definition
 * of "O_RDONLY", "O_WRONLY", and "O_RDWR" in "A-win-h", and then
 * we must simulate the effect of the proper "open()" call below.
 */
int fd_make(cptr file, int mode)
{
        char buf[1024];

        /* Hack -- Try to parse the path */
        if (path_parse(buf, 1024, file)) return (-1);

#ifdef BEN_HACK

        /* Check for existance */
        /* if (fd_close(fd_open(file, O_RDONLY | O_BINARY))) return (1); */

        /* Mega-Hack -- Create the file */
        (void)my_fclose(my_fopen(file, "wb"));

        /* Re-open the file for writing */
        return (open(buf, O_WRONLY | O_BINARY, mode));

#else /* BEN_HACK */

# if defined(MACINTOSH) && defined(MAC_MPW)

        /* setting file type and creator -- AR */
        {
                errr errr_tmp;
                errr_tmp = open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode);
                fsetfileinfo(file, _fcreator, _ftype);
                return(errr_tmp);
        }

# else
        /* Create the file, fail if exists, write-only, binary */
        return (open(buf, O_CREAT | O_EXCL | O_WRONLY | O_BINARY, mode));
# endif

#endif /* BEN_HACK */

}


/*
 * Hack -- attempt to open a file descriptor (existing file)
 *
 * Note that we assume that the file should be "binary"
 */
int fd_open(cptr file, int flags)
{
        char buf[1024];

        /* Hack -- Try to parse the path */
        if (path_parse(buf, 1024, file)) return (-1);

        /* Attempt to open the file */
        return (open(buf, flags | O_BINARY, 0));
}


/*
 * Hack -- attempt to lock a file descriptor
 *
 * Legal lock types -- F_UNLCK, F_RDLCK, F_WRLCK
 */
errr fd_lock(int fd, int what)
{
        /* XXX XXX */
        what = what ? what : 0;

        /* Verify the fd */
        if (fd < 0) return (-1);

#ifdef SET_UID

# ifdef USG

#  if defined(F_ULOCK) && defined(F_LOCK)

        /* Un-Lock */
        if (what == F_UNLCK)
        {
                /* Unlock it, Ignore errors */
                lockf(fd, F_ULOCK, 0);
        }

        /* Lock */
        else
        {
                /* Lock the score file */
                if (lockf(fd, F_LOCK, 0) != 0) return (1);
        }

#  endif

# else

#  if defined(LOCK_UN) && defined(LOCK_EX)

        /* Un-Lock */
        if (what == F_UNLCK)
        {
                /* Unlock it, Ignore errors */
                (void)flock(fd, LOCK_UN);
        }

        /* Lock */
        else
        {
                /* Lock the score file */
                if (flock(fd, LOCK_EX) != 0) return (1);
        }

#  endif

# endif

#endif

        /* Success */
        return (0);
}


/*
 * Hack -- attempt to seek on a file descriptor
 */
errr fd_seek(int fd, huge n)
{
        huge p;

        /* Verify fd */
        if (fd < 0) return (-1);

        /* Seek to the given position */
        p = lseek(fd, n, SEEK_SET);

        /* Failure */
        if (p != n) return (1);

        /* Success */
        return (0);
}


/*
 * Hack -- attempt to truncate a file descriptor
 */
errr fd_chop(int fd, huge n)
{
        /* XXX XXX */
        n = n ? n : 0;

        /* Verify the fd */
        if (fd < 0) return (-1);

#if defined(SUNOS) || defined(ULTRIX) || defined(NeXT)
        /* Truncate */
        ftruncate(fd, n);
#endif

        /* Success */
        return (0);
}


/*
 * Hack -- attempt to read data from a file descriptor
 */
errr fd_read(int fd, char *buf, huge n)
{
        /* Verify the fd */
        if (fd < 0) return (-1);

#ifndef SET_UID

        /* Read pieces */
        while (n >= 16384)
        {
                /* Read a piece */
                if (read(fd, buf, 16384) != 16384) return (1);

                /* Shorten the task */
                buf += 16384;

                /* Shorten the task */
                n -= 16384;
        }

#endif

        /* Read the final piece */
        if (read(fd, buf, n) != (int)n) return (1);

        /* Success */
        return (0);
}


/*
 * Hack -- Attempt to write data to a file descriptor
 */
errr fd_write(int fd, cptr buf, huge n)
{
        /* Verify the fd */
        if (fd < 0) return (-1);

#ifndef SET_UID

        /* Write pieces */
        while (n >= 16384)
        {
                /* Write a piece */
                if (write(fd, buf, 16384) != 16384) return (1);

                /* Shorten the task */
                buf += 16384;

                /* Shorten the task */
                n -= 16384;
        }

#endif

        /* Write the final piece */
        if (write(fd, buf, n) != (int)n) return (1);

        /* Success */
        return (0);
}


/*
 * Hack -- attempt to close a file descriptor
 */
errr fd_close(int fd)
{
        /* Verify the fd */
        if (fd < 0) return (-1);

        /* Close */
        (void)close(fd);

        /* XXX XXX XXX */
        return (0);
}


#endif /* ACORN */




/*
 * XXX XXX XXX Important note about "colors" XXX XXX XXX
 *
 * The "TERM_*" color definitions list the "composition" of each
 * "Angband color" in terms of "quarters" of each of the three color
 * components (Red, Green, Blue), for example, TERM_UMBER is defined
 * as 2/4 Red, 1/4 Green, 0/4 Blue.
 *
 * The following info is from "Torbjorn Lindgren" (see "main-xaw.c").
 *
 * These values are NOT gamma-corrected.  On most machines (with the
 * Macintosh being an important exception), you must "gamma-correct"
 * the given values, that is, "correct for the intrinsic non-linearity
 * of the phosphor", by converting the given intensity levels based
 * on the "gamma" of the target screen, which is usually 1.7 (or 1.5).
 *
 * The actual formula for conversion is unknown to me at this time,
 * but you can use the table below for the most common gamma values.
 *
 * So, on most machines, simply convert the values based on the "gamma"
 * of the target screen, which is usually in the range 1.5 to 1.7, and
 * usually is closest to 1.7.  The converted value for each of the five
 * different "quarter" values is given below:
 *
 *  Given     Gamma 1.0       Gamma 1.5       Gamma 1.7     Hex 1.7
 *  -----       ----            ----            ----          ---
 *   0/4        0.00            0.00            0.00          #00
 *   1/4        0.25            0.27            0.28          #47
 *   2/4        0.50            0.55            0.56          #8f
 *   3/4        0.75            0.82            0.84          #d7
 *   4/4        1.00            1.00            1.00          #ff
 *
 * Note that some machines (i.e. most IBM machines) are limited to a
 * hard-coded set of colors, and so the information above is useless.
 *
 * Also, some machines are limited to a pre-determined set of colors,
 * for example, the IBM can only display 16 colors, and only 14 of
 * those colors resemble colors used by Angband, and then only when
 * you ignore the fact that "Slate" and "cyan" are not really matches,
 * so on the IBM, we use "orange" for both "Umber", and "Light Umber"
 * in addition to the obvious "Orange", since by combining all of the
 * "indeterminate" colors into a single color, the rest of the colors
 * are left with "meaningful" values.
 */


/*
 * Move the cursor
 */
void move_cursor(int row, int col)
{
        Term_gotoxy(col, row);
}



/*
 * Convert a decimal to a single digit octal number
 */
static char octify(uint i)
{
        return (hexsym[i%8]);
}

/*
 * Convert a decimal to a single digit hex number
 */
static char hexify(uint i)
{
        return (hexsym[i%16]);
}


/*
 * Convert a octal-digit into a decimal
 */
static int deoct(char c)
{
        if (isdigit(c)) return (D2I(c));
        return (0);
}

/*
 * Convert a hexidecimal-digit into a decimal
 */
static int dehex(char c)
{
        if (isdigit(c)) return (D2I(c));
        if (islower(c)) return (A2I(c) + 10);
        if (isupper(c)) return (A2I(tolower(c)) + 10);
        return (0);
}


static int my_stricmp(cptr a, cptr b)
{
        cptr s1, s2;
        char z1, z2;

        /* Scan the strings */
        for (s1 = a, s2 = b; TRUE; s1++, s2++)
        {
                z1 = FORCEUPPER(*s1);
                z2 = FORCEUPPER(*s2);
                if (z1 < z2) return (-1);
                if (z1 > z2) return (1);
                if (!z1) return (0);
        }
}

static int my_strnicmp(cptr a, cptr b, int n)
{
        cptr s1, s2;
        char z1, z2;

        /* Scan the strings */
        for (s1 = a, s2 = b; n > 0; s1++, s2++, n--)
        {
                z1 = FORCEUPPER(*s1);
                z2 = FORCEUPPER(*s2);
                if (z1 < z2) return (-1);
                if (z1 > z2) return (1);
                if (!z1) return (0);
        }
        return 0;
}


static void trigger_text_to_ascii(char **bufptr, cptr *strptr)
{
        char *s = *bufptr;
        cptr str = *strptr;
        bool mod_status[MAX_MACRO_MOD];

        int i, len = 0;
        int shiftstatus = 0;
        cptr key_code;

        if (macro_template == NULL)
                return;
        
        for (i = 0; macro_modifier_chr[i]; i++)
                mod_status[i] = FALSE;
        str++;

        /* Examine modifier keys */
        while (1)
        {
                for (i=0; macro_modifier_chr[i]; i++)
                {
                        len = strlen(macro_modifier_name[i]);
                        
                        if(!my_strnicmp(str, macro_modifier_name[i], len))
                                break;
                }
                if (!macro_modifier_chr[i]) break;
                str += len;
                mod_status[i] = TRUE;
                if ('S' == macro_modifier_chr[i])
                        shiftstatus = 1;
        }
        for (i = 0; i < max_macrotrigger; i++)
        {
                len = strlen(macro_trigger_name[i]);
                if (!my_strnicmp(str, macro_trigger_name[i], len) && ']' == str[len])
                {
                        /* a trigger name found */
                        break;
                }
        }

        /* Invalid trigger name? */
        if (i == max_macrotrigger)
        {
                str = strchr(str, ']');
                if (str)
                {
                        *s++ = (char)31;
                        *s++ = '\r';
                        *bufptr = s;
                        *strptr = str; /* where **strptr == ']' */
                }
                return;
        }
        key_code = macro_trigger_keycode[shiftstatus][i];
        str += len;

        *s++ = (char)31;
        for (i = 0; macro_template[i]; i++)
        {
                char ch = macro_template[i];
                int j;

                switch(ch)
                {
                case '&':
                        for (j = 0; macro_modifier_chr[j]; j++) {
                                if (mod_status[j])
                                        *s++ = macro_modifier_chr[j];
                        }
                        break;
                case '#':
                        strcpy(s, key_code);
                        s += strlen(key_code);
                        break;
                default:
                        *s++ = ch;
                        break;
                }
        }
        *s++ = '\r';

        *bufptr = s;
        *strptr = str; /* where **strptr == ']' */
        return;
}


/*
 * Hack -- convert a printable string into real ascii
 *
 * I have no clue if this function correctly handles, for example,
 * parsing "\xFF" into a (signed) char.  Whoever thought of making
 * the "sign" of a "char" undefined is a complete moron.  Oh well.
 */
void text_to_ascii(char *buf, cptr str)
{
        char *s = buf;

        /* Analyze the "ascii" string */
        while (*str)
        {
                /* Backslash codes */
                if (*str == '\\')
                {
                        /* Skip the backslash */
                        str++;

                        /* Paranoia */
                        if (!(*str)) break;

                        /* Macro Trigger */
                        if (*str == '[')
                        {
                                trigger_text_to_ascii(&s, &str);
                        }
                        else

                        /* Hex-mode XXX */
                        if (*str == 'x')
                        {
                                *s = 16 * dehex(*++str);
                                *s++ += dehex(*++str);
                        }

                        /* Hack -- simple way to specify "backslash" */
                        else if (*str == '\\')
                        {
                                *s++ = '\\';
                        }

                        /* Hack -- simple way to specify "caret" */
                        else if (*str == '^')
                        {
                                *s++ = '^';
                        }

                        /* Hack -- simple way to specify "space" */
                        else if (*str == 's')
                        {
                                *s++ = ' ';
                        }

                        /* Hack -- simple way to specify Escape */
                        else if (*str == 'e')
                        {
                                *s++ = ESCAPE;
                        }

                        /* Backspace */
                        else if (*str == 'b')
                        {
                                *s++ = '\b';
                        }

                        /* Newline */
                        else if (*str == 'n')
                        {
                                *s++ = '\n';
                        }

                        /* Return */
                        else if (*str == 'r')
                        {
                                *s++ = '\r';
                        }

                        /* Tab */
                        else if (*str == 't')
                        {
                                *s++ = '\t';
                        }

                        /* Octal-mode */
                        else if (*str == '0')
                        {
                                *s = 8 * deoct(*++str);
                                *s++ += deoct(*++str);
                        }

                        /* Octal-mode */
                        else if (*str == '1')
                        {
                                *s = 64 + 8 * deoct(*++str);
                                *s++ += deoct(*++str);
                        }

                        /* Octal-mode */
                        else if (*str == '2')
                        {
                                *s = 64 * 2 + 8 * deoct(*++str);
                                *s++ += deoct(*++str);
                        }

                        /* Octal-mode */
                        else if (*str == '3')
                        {
                                *s = 64 * 3 + 8 * deoct(*++str);
                                *s++ += deoct(*++str);
                        }

                        /* Skip the final char */
                        str++;
                }

                /* Normal Control codes */
                else if (*str == '^')
                {
                        str++;
                        *s++ = (*str++ & 037);
                }

                /* Normal chars */
                else
                {
                        *s++ = *str++;
                }
        }

        /* Terminate */
        *s = '\0';
}


static bool trigger_ascii_to_text(char **bufptr, cptr *strptr)
{
        char *s = *bufptr;
        cptr str = *strptr;
        char key_code[100];
        int i;
        cptr tmp;

        if (macro_template == NULL)
                return FALSE;

        *s++ = '\\';
        *s++ = '[';

        for (i = 0; macro_template[i]; i++)
        {
                int j;
                char ch = macro_template[i];

                switch(ch)
                {
                case '&':
                        while ((tmp = strchr(macro_modifier_chr, *str)))
                        {
                                j = (int)(tmp - macro_modifier_chr);
                                tmp = macro_modifier_name[j];
                                while(*tmp) *s++ = *tmp++;
                                str++;
                        }
                        break;
                case '#':
                        for (j = 0; *str && *str != '\r'; j++)
                                key_code[j] = *str++;
                        key_code[j] = '\0';
                        break;
                default:
                        if (ch != *str) return FALSE;
                        str++;
                }
        }
        if (*str++ != '\r') return FALSE;

        for (i = 0; i < max_macrotrigger; i++)
        {
                if (!my_stricmp(key_code, macro_trigger_keycode[0][i])
                    || !my_stricmp(key_code, macro_trigger_keycode[1][i]))
                        break;
        }
        if (i == max_macrotrigger)
                return FALSE;

        tmp = macro_trigger_name[i];
        while (*tmp) *s++ = *tmp++;

        *s++ = ']';
        
        *bufptr = s;
        *strptr = str;
        return TRUE;
}


/*
 * Hack -- convert a string into a printable form
 */
void ascii_to_text(char *buf, cptr str)
{
        char *s = buf;

        /* Analyze the "ascii" string */
        while (*str)
        {
                byte i = (byte)(*str++);

                /* Macro Trigger */
                if (i == 31)
                {
                        if(!trigger_ascii_to_text(&s, &str))
                        {
                                *s++ = '^';
                                *s++ = '_';
                        }
                }
                else

                if (i == ESCAPE)
                {
                        *s++ = '\\';
                        *s++ = 'e';
                }
                else if (i == ' ')
                {
                        *s++ = '\\';
                        *s++ = 's';
                }
                else if (i == '\b')
                {
                        *s++ = '\\';
                        *s++ = 'b';
                }
                else if (i == '\t')
                {
                        *s++ = '\\';
                        *s++ = 't';
                }
                else if (i == '\n')
                {
                        *s++ = '\\';
                        *s++ = 'n';
                }
                else if (i == '\r')
                {
                        *s++ = '\\';
                        *s++ = 'r';
                }
                else if (i == '^')
                {
                        *s++ = '\\';
                        *s++ = '^';
                }
                else if (i == '\\')
                {
                        *s++ = '\\';
                        *s++ = '\\';
                }
                else if (i < 32)
                {
                        *s++ = '^';
                        *s++ = i + 64;
                }
                else if (i < 127)
                {
                        *s++ = i;
                }
                else if (i < 64)
                {
                        *s++ = '\\';
                        *s++ = '0';
                        *s++ = octify(i / 8);
                        *s++ = octify(i % 8);
                }
                else
                {
                        *s++ = '\\';
                        *s++ = 'x';
                        *s++ = hexify(i / 16);
                        *s++ = hexify(i % 16);
                }
        }

        /* Terminate */
        *s = '\0';
}



/*
 * The "macro" package
 *
 * Functions are provided to manipulate a collection of macros, each
 * of which has a trigger pattern string and a resulting action string
 * and a small set of flags.
 */



/*
 * Determine if any macros have ever started with a given character.
 */
static bool macro__use[256];


/*
 * Find the macro (if any) which exactly matches the given pattern
 */
sint macro_find_exact(cptr pat)
{
        int i;

        /* Nothing possible */
        if (!macro__use[(byte)(pat[0])])
        {
                return (-1);
        }

        /* Scan the macros */
        for (i = 0; i < macro__num; ++i)
        {
                /* Skip macros which do not match the pattern */
                if (!streq(macro__pat[i], pat)) continue;

                /* Found one */
                return (i);
        }

        /* No matches */
        return (-1);
}


/*
 * Find the first macro (if any) which contains the given pattern
 */
static sint macro_find_check(cptr pat)
{
        int i;

        /* Nothing possible */
        if (!macro__use[(byte)(pat[0])])
        {
                return (-1);
        }

        /* Scan the macros */
        for (i = 0; i < macro__num; ++i)
        {
                /* Skip macros which do not contain the pattern */
                if (!prefix(macro__pat[i], pat)) continue;

                /* Found one */
                return (i);
        }

        /* Nothing */
        return (-1);
}


/*
 * Find the first macro (if any) which contains the given pattern and more
 */
static sint macro_find_maybe(cptr pat)
{
        int i;

        /* Nothing possible */
        if (!macro__use[(byte)(pat[0])])
        {
                return (-1);
        }

        /* Scan the macros */
        for (i = 0; i < macro__num; ++i)
        {
                /* Skip macros which do not contain the pattern */
                if (!prefix(macro__pat[i], pat)) continue;

                /* Skip macros which exactly match the pattern XXX XXX */
                if (streq(macro__pat[i], pat)) continue;

                /* Found one */
                return (i);
        }

        /* Nothing */
        return (-1);
}


/*
 * Find the longest macro (if any) which starts with the given pattern
 */
static sint macro_find_ready(cptr pat)
{
        int i, t, n = -1, s = -1;

        /* Nothing possible */
        if (!macro__use[(byte)(pat[0])])
        {
                return (-1);
        }

        /* Scan the macros */
        for (i = 0; i < macro__num; ++i)
        {
                /* Skip macros which are not contained by the pattern */
                if (!prefix(pat, macro__pat[i])) continue;

                /* Obtain the length of this macro */
                t = strlen(macro__pat[i]);

                /* Only track the "longest" pattern */
                if ((n >= 0) && (s > t)) continue;

                /* Track the entry */
                n = i;
                s = t;
        }

        /* Result */
        return (n);
}


/*
 * Add a macro definition (or redefinition).
 *
 * We should use "act == NULL" to "remove" a macro, but this might make it
 * impossible to save the "removal" of a macro definition.  XXX XXX XXX
 *
 * We should consider refusing to allow macros which contain existing macros,
 * or which are contained in existing macros, because this would simplify the
 * macro analysis code.  XXX XXX XXX
 *
 * We should consider removing the "command macro" crap, and replacing it
 * with some kind of "powerful keymap" ability, but this might make it hard
 * to change the "roguelike" option from inside the game.  XXX XXX XXX
 */
errr macro_add(cptr pat, cptr act)
{
        int n;


        /* Paranoia -- require data */
        if (!pat || !act) return (-1);


        /* Look for any existing macro */
        n = macro_find_exact(pat);

        /* Replace existing macro */
        if (n >= 0)
        {
                /* Free the old macro action */
                string_free(macro__act[n]);
        }

        /* Create a new macro */
        else
        {
                /* Acquire a new index */
                n = macro__num++;

                /* Save the pattern */
                macro__pat[n] = string_make(pat);
        }

        /* Save the action */
        macro__act[n] = string_make(act);

        /* Efficiency */
        macro__use[(byte)(pat[0])] = TRUE;

        /* Success */
        return (0);
}



/*
 * Local variable -- we are inside a "macro action"
 *
 * Do not match any macros until "ascii 30" is found.
 */
static bool parse_macro = FALSE;

/*
 * Local variable -- we are inside a "macro trigger"
 *
 * Strip all keypresses until a low ascii value is found.
 */
static bool parse_under = FALSE;


/*
 * Flush all input chars.  Actually, remember the flush,
 * and do a "special flush" before the next "inkey()".
 *
 * This is not only more efficient, but also necessary to make sure
 * that various "inkey()" codes are not "lost" along the way.
 */
void flush(void)
{
        /* Do it later */
        inkey_xtra = TRUE;
}


/*
 * Flush the screen, make a noise
 */
void bell(void)
{
        /* Mega-Hack -- Flush the output */
        Term_fresh();

        /* Make a bell noise (if allowed) */
        if (ring_bell) Term_xtra(TERM_XTRA_NOISE, 0);

        /* Flush the input (later!) */
        flush();
}


/*
 * Hack -- Make a (relevant?) sound
 */
void sound(int val)
{
        /* No sound */
        if (!use_sound) return;

        /* Make a sound (if allowed) */
        Term_xtra(TERM_XTRA_SOUND, val);
}



/*
 * Helper function called only from "inkey()"
 *
 * This function does almost all of the "macro" processing.
 *
 * We use the "Term_key_push()" function to handle "failed" macros, as well
 * as "extra" keys read in while choosing the proper macro, and also to hold
 * the action for the macro, plus a special "ascii 30" character indicating
 * that any macro action in progress is complete.  Embedded macros are thus
 * illegal, unless a macro action includes an explicit "ascii 30" character,
 * which would probably be a massive hack, and might break things.
 *
 * Only 500 (0+1+2+...+29+30) milliseconds may elapse between each key in
 * the macro trigger sequence.  If a key sequence forms the "prefix" of a
 * macro trigger, 500 milliseconds must pass before the key sequence is
 * known not to be that macro trigger.  XXX XXX XXX
 */
static char inkey_aux(void)
{
        int k = 0, n, p = 0, w = 0;

        char ch;

        cptr pat, act;

        char *buf = inkey_macro_trigger_string;

        /* Hack : ¥­¡¼ÆþÎÏÂÔ¤Á¤Ç»ß¤Þ¤Ã¤Æ¤¤¤ë¤Î¤Ç¡¢Î®¤ì¤¿¹Ô¤Îµ­²±¤ÏÉÔÍס£ */
        num_more = 0;

        if (parse_macro)
        {
                /* Scan next keypress from macro action */
                if (Term_inkey(&ch, FALSE, TRUE))
                {
                        /* Over-flowed? Cancel macro action */
                        parse_macro = FALSE;
                }
        }
        else
        {
                /* Wait for a keypress */
                (void) (Term_inkey(&ch, TRUE, TRUE));
        }


        /* End "macro action" */
        if (ch == 30) parse_macro = FALSE;

        /* Inside "macro action" */
        if (ch == 30) return (ch);

        /* Inside "macro action" */
        if (parse_macro) return (ch);

        /* Inside "macro trigger" */
        if (parse_under) return (ch);

        /* Save the first key, advance */
        buf[p++] = ch;
        buf[p] = '\0';


        /* Check for possible macro */
        k = macro_find_check(buf);

        /* No macro pending */
        if (k < 0) return (ch);


        /* Wait for a macro, or a timeout */
        while (TRUE)
        {
                /* Check for pending macro */
                k = macro_find_maybe(buf);

                /* No macro pending */
                if (k < 0) break;

                /* Check for (and remove) a pending key */
                if (0 == Term_inkey(&ch, FALSE, TRUE))
                {
                        /* Append the key */
                        buf[p++] = ch;
                        buf[p] = '\0';

                        /* Restart wait */
                        w = 0;
                }

                /* No key ready */
                else
                {
                        /* Increase "wait" */
                        w += 10;

                        /* Excessive delay */
                        if (w >= 100) break;

                        /* Delay */
                        Term_xtra(TERM_XTRA_DELAY, w);
                }
        }


        /* Check for available macro */
        k = macro_find_ready(buf);

        /* No macro available */
        if (k < 0)
        {
                /* Push all the keys back on the queue */
                while (p > 0)
                {
                        /* Push the key, notice over-flow */
                        if (Term_key_push(buf[--p])) return (0);
                }

                /* Wait for (and remove) a pending key */
                (void)Term_inkey(&ch, TRUE, TRUE);

                /* Return the key */
                return (ch);
        }


        /* Get the pattern */
        pat = macro__pat[k];

        /* Get the length of the pattern */
        n = strlen(pat);

        /* Push the "extra" keys back on the queue */
        while (p > n)
        {
                /* Push the key, notice over-flow */
                if (Term_key_push(buf[--p])) return (0);
        }


        /* Begin "macro action" */
        parse_macro = TRUE;

        /* Push the "end of macro action" key */
        if (Term_key_push(30)) return (0);


        /* Access the macro action */
        act = macro__act[k];

        /* Get the length of the action */
        n = strlen(act);

        /* Push the macro "action" onto the key queue */
        while (n > 0)
        {
                /* Push the key, notice over-flow */
                if (Term_key_push(act[--n])) return (0);
        }


        /* Hack -- Force "inkey()" to call us again */
        return (0);
}


/*
 * Mega-Hack -- special "inkey_next" pointer.  XXX XXX XXX
 *
 * This special pointer allows a sequence of keys to be "inserted" into
 * the stream of keys returned by "inkey()".  This key sequence will not
 * trigger any macros, and cannot be bypassed by the Borg.  It is used
 * in Angband to handle "keymaps".
 */
static cptr inkey_next = NULL;


#ifdef ALLOW_BORG

/*
 * Mega-Hack -- special "inkey_hack" hook.  XXX XXX XXX
 *
 * This special function hook allows the "Borg" (see elsewhere) to take
 * control of the "inkey()" function, and substitute in fake keypresses.
 */
char (*inkey_hack)(int flush_first) = NULL;

#endif /* ALLOW_BORG */



/*
 * Get a keypress from the user.
 *
 * This function recognizes a few "global parameters".  These are variables
 * which, if set to TRUE before calling this function, will have an effect
 * on this function, and which are always reset to FALSE by this function
 * before this function returns.  Thus they function just like normal
 * parameters, except that most calls to this function can ignore them.
 *
 * If "inkey_xtra" is TRUE, then all pending keypresses will be flushed,
 * and any macro processing in progress will be aborted.  This flag is
 * set by the "flush()" function, which does not actually flush anything
 * itself, but rather, triggers delayed input flushing via "inkey_xtra".
 *
 * If "inkey_scan" is TRUE, then we will immediately return "zero" if no
 * keypress is available, instead of waiting for a keypress.
 *
 * If "inkey_base" is TRUE, then all macro processing will be bypassed.
 * If "inkey_base" and "inkey_scan" are both TRUE, then this function will
 * not return immediately, but will wait for a keypress for as long as the
 * normal macro matching code would, allowing the direct entry of macro
 * triggers.  The "inkey_base" flag is extremely dangerous!
 *
 * If "inkey_flag" is TRUE, then we will assume that we are waiting for a
 * normal command, and we will only show the cursor if "hilite_player" is
 * TRUE (or if the player is in a store), instead of always showing the
 * cursor.  The various "main-xxx.c" files should avoid saving the game
 * in response to a "menu item" request unless "inkey_flag" is TRUE, to
 * prevent savefile corruption.
 *
 * If we are waiting for a keypress, and no keypress is ready, then we will
 * refresh (once) the window which was active when this function was called.
 *
 * Note that "back-quote" is automatically converted into "escape" for
 * convenience on machines with no "escape" key.  This is done after the
 * macro matching, so the user can still make a macro for "backquote".
 *
 * Note the special handling of "ascii 30" (ctrl-caret, aka ctrl-shift-six)
 * and "ascii 31" (ctrl-underscore, aka ctrl-shift-minus), which are used to
 * provide support for simple keyboard "macros".  These keys are so strange
 * that their loss as normal keys will probably be noticed by nobody.  The
 * "ascii 30" key is used to indicate the "end" of a macro action, which
 * allows recursive macros to be avoided.  The "ascii 31" key is used by
 * some of the "main-xxx.c" files to introduce macro trigger sequences.
 *
 * Hack -- we use "ascii 29" (ctrl-right-bracket) as a special "magic" key,
 * which can be used to give a variety of "sub-commands" which can be used
 * any time.  These sub-commands could include commands to take a picture of
 * the current screen, to start/stop recording a macro action, etc.
 *
 * If "angband_term[0]" is not active, we will make it active during this
 * function, so that the various "main-xxx.c" files can assume that input
 * is only requested (via "Term_inkey()") when "angband_term[0]" is active.
 *
 * Mega-Hack -- This function is used as the entry point for clearing the
 * "signal_count" variable, and of the "character_saved" variable.
 *
 * Hack -- Note the use of "inkey_next" to allow "keymaps" to be processed.
 *
 * Mega-Hack -- Note the use of "inkey_hack" to allow the "Borg" to steal
 * control of the keyboard from the user.
 */
char inkey(void)
{
        int v;
        char kk;
        char ch = 0;
        bool done = FALSE;
        term *old = Term;

        /* Hack -- Use the "inkey_next" pointer */
        if (inkey_next && *inkey_next && !inkey_xtra)
        {
                /* Get next character, and advance */
                ch = *inkey_next++;

                /* Cancel the various "global parameters" */
                inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;

                /* Accept result */
                return (ch);
        }

        /* Forget pointer */
        inkey_next = NULL;


#ifdef ALLOW_BORG

        /* Mega-Hack -- Use the special hook */
        if (inkey_hack && ((ch = (*inkey_hack)(inkey_xtra)) != 0))
        {
                /* Cancel the various "global parameters" */
                inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;

                /* Accept result */
                return (ch);
        }

#endif /* ALLOW_BORG */


        /* Hack -- handle delayed "flush()" */
        if (inkey_xtra)
        {
                /* End "macro action" */
                parse_macro = FALSE;

                /* End "macro trigger" */
                parse_under = FALSE;

                /* Forget old keypresses */
                Term_flush();
        }


        /* Access cursor state */
        (void)Term_get_cursor(&v);

        /* Show the cursor if waiting, except sometimes in "command" mode */
        if (!inkey_scan && (!inkey_flag || hilite_player || character_icky))
        {
                /* Show the cursor */
                (void)Term_set_cursor(1);
        }


        /* Hack -- Activate main screen */
        Term_activate(angband_term[0]);


        /* Get a key */
        while (!ch)
        {
                /* Hack -- Handle "inkey_scan" */
                if (!inkey_base && inkey_scan &&
                        (0 != Term_inkey(&kk, FALSE, FALSE)))
                {
                        break;
                }


                /* Hack -- Flush output once when no key ready */
                if (!done && (0 != Term_inkey(&kk, FALSE, FALSE)))
                {
                        /* Hack -- activate proper term */
                        Term_activate(old);

                        /* Flush output */
                        Term_fresh();

                        /* Hack -- activate main screen */
                        Term_activate(angband_term[0]);

                        /* Mega-Hack -- reset saved flag */
                        character_saved = FALSE;

                        /* Mega-Hack -- reset signal counter */
                        signal_count = 0;

                        /* Only once */
                        done = TRUE;
                }


                /* Hack -- Handle "inkey_base" */
                if (inkey_base)
                {
                        int w = 0;

                        /* Wait forever */
                        if (!inkey_scan)
                        {
                                /* Wait for (and remove) a pending key */
                                if (0 == Term_inkey(&ch, TRUE, TRUE))
                                {
                                        /* Done */
                                        break;
                                }

                                /* Oops */
                                break;
                        }

                        /* Wait */
                        while (TRUE)
                        {
                                /* Check for (and remove) a pending key */
                                if (0 == Term_inkey(&ch, FALSE, TRUE))
                                {
                                        /* Done */
                                        break;
                                }

                                /* No key ready */
                                else
                                {
                                        /* Increase "wait" */
                                        w += 10;

                                        /* Excessive delay */
                                        if (w >= 100) break;

                                        /* Delay */
                                        Term_xtra(TERM_XTRA_DELAY, w);
                                }
                        }

                        /* Done */
                        break;
                }


                /* Get a key (see above) */
                ch = inkey_aux();


                /* Handle "control-right-bracket" */
                if (ch == 29)
                {
                        /* Strip this key */
                        ch = 0;

                        /* Continue */
                        continue;
                }


                /* Treat back-quote as escape */
/*              if (ch == '`') ch = ESCAPE; */


                /* End "macro trigger" */
                if (parse_under && (ch <= 32))
                {
                        /* Strip this key */
                        ch = 0;

                        /* End "macro trigger" */
                        parse_under = FALSE;
                }


                /* Handle "control-caret" */
                if (ch == 30)
                {
                        /* Strip this key */
                        ch = 0;
                }

                /* Handle "control-underscore" */
                else if (ch == 31)
                {
                        /* Strip this key */
                        ch = 0;

                        /* Begin "macro trigger" */
                        parse_under = TRUE;
                }

                /* Inside "macro trigger" */
                else if (parse_under)
                {
                        /* Strip this key */
                        ch = 0;
                }
        }


        /* Hack -- restore the term */
        Term_activate(old);


        /* Restore the cursor */
        Term_set_cursor(v);


        /* Cancel the various "global parameters" */
        inkey_base = inkey_xtra = inkey_flag = inkey_scan = FALSE;

        /* Return the keypress */
        return (ch);
}




/*
 * We use a global array for all inscriptions to reduce the memory
 * spent maintaining inscriptions.  Of course, it is still possible
 * to run out of inscription memory, especially if too many different
 * inscriptions are used, but hopefully this will be rare.
 *
 * We use dynamic string allocation because otherwise it is necessary
 * to pre-guess the amount of quark activity.  We limit the total
 * number of quarks, but this is much easier to "expand" as needed.
 *
 * Any two items with the same inscription will have the same "quark"
 * index, which should greatly reduce the need for inscription space.
 *
 * Note that "quark zero" is NULL and should not be "dereferenced".
 */

/*
 * Add a new "quark" to the set of quarks.
 */
s16b quark_add(cptr str)
{
        int i;

        /* Look for an existing quark */
        for (i = 1; i < quark__num; i++)
        {
                /* Check for equality */
                if (streq(quark__str[i], str)) return (i);
        }

        /* Paranoia -- Require room */
        if (quark__num == QUARK_MAX) return (0);

        /* New maximal quark */
        quark__num = i + 1;

        /* Add a new quark */
        quark__str[i] = string_make(str);

        /* Return the index */
        return (i);
}


/*
 * This function looks up a quark
 */
cptr quark_str(s16b i)
{
        cptr q;

        /* Verify */
        if ((i < 0) || (i >= quark__num)) i = 0;

        /* Access the quark */
        q = quark__str[i];

        /* Return the quark */
        return (q);
}




/*
 * Second try for the "message" handling routines.
 *
 * Each call to "message_add(s)" will add a new "most recent" message
 * to the "message recall list", using the contents of the string "s".
 *
 * The messages will be stored in such a way as to maximize "efficiency",
 * that is, we attempt to maximize the number of sequential messages that
 * can be retrieved, given a limited amount of storage space.
 *
 * We keep a buffer of chars to hold the "text" of the messages, not
 * necessarily in "order", and an array of offsets into that buffer,
 * representing the actual messages.  This is made more complicated
 * by the fact that both the array of indexes, and the buffer itself,
 * are both treated as "circular arrays" for efficiency purposes, but
 * the strings may not be "broken" across the ends of the array.
 *
 * The "message_add()" function is rather "complex", because it must be
 * extremely efficient, both in space and time, for use with the Borg.
 */



/*
 * How many messages are "available"?
 */
s16b message_num(void)
{
        int last, next, n;

        /* Extract the indexes */
        last = message__last;
        next = message__next;

        /* Handle "wrap" */
        if (next < last) next += MESSAGE_MAX;

        /* Extract the space */
        n = (next - last);

        /* Return the result */
        return (n);
}



/*
 * Recall the "text" of a saved message
 */
cptr message_str(int age)
{
        s16b x;
        s16b o;
        cptr s;

        /* Forgotten messages have no text */
        if ((age < 0) || (age >= message_num())) return ("");

        /* Acquire the "logical" index */
        x = (message__next + MESSAGE_MAX - (age + 1)) % MESSAGE_MAX;

        /* Get the "offset" for the message */
        o = message__ptr[x];

        /* Access the message text */
        s = &message__buf[o];

        /* Return the message text */
        return (s);
}



/*
 * Add a new message, with great efficiency
 */
void message_add(cptr str)
{
        int i, k, x, m, n;

        char u[1024];
        char splitted1[81];
        cptr splitted2;

        /*** Step 1 -- Analyze the message ***/

        /* Hack -- Ignore "non-messages" */
        if (!str) return;

        /* Message length */
        n = strlen(str);

        /* Important Hack -- Ignore "long" messages */
        if (n >= MESSAGE_BUF / 4) return;

        /* extra step -- split the message if n>80.   (added by Mogami) */
        if (n > 80) {
#ifdef JP
          cptr t = str;

          for (n = 0; n < 80; n++, t++)
            if(iskanji(*t)) {
              t++;
              n++;
            }
          if (n == 81) n = 79; /* ºÇ¸å¤Îʸ»ú¤¬´Á»úȾʬ */
#else
          for (n = 80; n > 60; n--)
                  if (str[n] == ' ') break;
          if (n == 60)
                  n = 80;
#endif
          splitted2 = str + n;
          strncpy(splitted1, str ,n);
          splitted1[n] = '\0';
          str = splitted1;
        } else {
          splitted2 = NULL;
        }

        /*** Step 2 -- Attempt to optimize ***/

        /* Limit number of messages to check */
        m = message_num();

        k = m / 4;

        /* Limit number of messages to check */
        if (k > MESSAGE_MAX / 32) k = MESSAGE_MAX / 32;

        /* Check previous message */
        for (i = message__next; m; m--)
        {
                int j = 1;

                char buf[1024];
                char *t;

                cptr old;

                /* Back up and wrap if needed */
                if (i-- == 0) i = MESSAGE_MAX - 1;

                /* Access the old string */
                old = &message__buf[message__ptr[i]];

                /* Skip small messages */
                if (!old) continue;

                strcpy(buf, old);

                /* Find multiple */
#ifdef JP
 for (t = buf; *t && (*t != '<' || (*(t+1) != 'x' )); t++) 
     if( iskanji(*t))t++;
#else
                for (t = buf; *t && (*t != '<'); t++);
#endif

                if (*t)
                {
                        /* Message is too small */
                        if (strlen(buf) < 6) break;

                        /* Drop the space */
                        *(t - 1) = '\0';

                        /* Get multiplier */
                        j = atoi(t+2);
                }

                /* Limit the multiplier to 1000 */
                if (buf && streq(buf, str) && (j < 1000))
                {
                        j++;

                        /* Overwrite */
                        message__next = i;

                        str = u;

                        /* Write it out */
                        sprintf(u, "%s <x%d>", buf, j);

                        /* Message length */
                        n = strlen(str);

                        if (!now_message) now_message++;
                }
                else
                {
                        num_more++;/*ή¤ì¤¿¹Ô¤Î¿ô¤ò¿ô¤¨¤Æ¤ª¤¯ */
                        now_message++;
                }

                /* Done */
                break;
        }

        /* Check the last few messages (if any to count) */
        for (i = message__next; k; k--)
        {
                u16b q;

                cptr old;

                /* Back up and wrap if needed */
                if (i-- == 0) i = MESSAGE_MAX - 1;

                /* Stop before oldest message */
                if (i == message__last) break;

                /* Extract "distance" from "head" */
                q = (message__head + MESSAGE_BUF - message__ptr[i]) % MESSAGE_BUF;

                /* Do not optimize over large distance */
                if (q > MESSAGE_BUF / 2) continue;

                /* Access the old string */
                old = &message__buf[message__ptr[i]];

                /* Compare */
                if (!streq(old, str)) continue;

                /* Get the next message index, advance */
                x = message__next++;

                /* Handle wrap */
                if (message__next == MESSAGE_MAX) message__next = 0;

                /* Kill last message if needed */
                if (message__next == message__last) message__last++;

                /* Handle wrap */
                if (message__last == MESSAGE_MAX) message__last = 0;

                /* Assign the starting address */
                message__ptr[x] = message__ptr[i];

                /* Success */
                /* return; */
                goto end_of_message_add;

        }


        /*** Step 3 -- Ensure space before end of buffer ***/

        /* Kill messages and Wrap if needed */
        if (message__head + n + 1 >= MESSAGE_BUF)
        {
                /* Kill all "dead" messages */
                for (i = message__last; TRUE; i++)
                {
                        /* Wrap if needed */
                        if (i == MESSAGE_MAX) i = 0;

                        /* Stop before the new message */
                        if (i == message__next) break;

                        /* Kill "dead" messages */
                        if (message__ptr[i] >= message__head)
                        {
                                /* Track oldest message */
                                message__last = i + 1;
                        }
                }

                /* Wrap "tail" if needed */
                if (message__tail >= message__head) message__tail = 0;

                /* Start over */
                message__head = 0;
        }


        /*** Step 4 -- Ensure space before next message ***/

        /* Kill messages if needed */
        if (message__head + n + 1 > message__tail)
        {
                /* Grab new "tail" */
                message__tail = message__head + n + 1;

                /* Advance tail while possible past first "nul" */
                while (message__buf[message__tail-1]) message__tail++;

                /* Kill all "dead" messages */
                for (i = message__last; TRUE; i++)
                {
                        /* Wrap if needed */
                        if (i == MESSAGE_MAX) i = 0;

                        /* Stop before the new message */
                        if (i == message__next) break;

                        /* Kill "dead" messages */
                        if ((message__ptr[i] >= message__head) &&
                                (message__ptr[i] < message__tail))
                        {
                                /* Track oldest message */
                                message__last = i + 1;
                        }
                }
        }


        /*** Step 5 -- Grab a new message index ***/

        /* Get the next message index, advance */
        x = message__next++;

        /* Handle wrap */
        if (message__next == MESSAGE_MAX) message__next = 0;

        /* Kill last message if needed */
        if (message__next == message__last) message__last++;

        /* Handle wrap */
        if (message__last == MESSAGE_MAX) message__last = 0;



        /*** Step 6 -- Insert the message text ***/

        /* Assign the starting address */
        message__ptr[x] = message__head;

        /* Append the new part of the message */
        for (i = 0; i < n; i++)
        {
                /* Copy the message */
                message__buf[message__head + i] = str[i];
        }

        /* Terminate */
        message__buf[message__head + i] = '\0';

        /* Advance the "head" pointer */
        message__head += n + 1;

        /* recursively add splitted message (added by Mogami) */
 end_of_message_add:
        if (splitted2 != NULL)
          message_add(splitted2);
}



/*
 * Hack -- flush
 */
static void msg_flush(int x)
{
        byte a = TERM_L_BLUE;
        bool nagasu = FALSE;

        if ((auto_more && !now_damaged) || num_more < 0){
                int i;
                for (i = 0; i < 8; i++)
                {
                        if (angband_term[i] && (window_flag[i] & PW_MESSAGE)) break;
                }
                if (i < 8)
                {
                        if (num_more < angband_term[i]->hgt) nagasu = TRUE;
                }
                else
                {
                        nagasu = TRUE;
                }
        }
        now_damaged = FALSE;

        if (!p_ptr->playing || !nagasu)
        {
                /* Pause for response */
#ifdef JP
                Term_putstr(x, 0, -1, a, "-³¤¯-");
#else
                Term_putstr(x, 0, -1, a, "-more-");
#endif


                /* Get an acceptable keypress */
                while (1)
                {
                        int cmd = inkey();
                        if (cmd == ESCAPE) {
                            num_more = -9999; /*auto_more¤Î¤È¤­¡¢Á´¤Æή¤¹¡£ */
                            break;
                        } else if (cmd == ' ') {
                            num_more = 0; /*£±²èÌ̤À¤±Î®¤¹¡£ */
                            break;
                        } else if ((cmd == '\n') || (cmd == '\r')) {
                            num_more--; /*£±¹Ô¤À¤±Î®¤¹¡£ */
                            break;
                        }
                        if (quick_messages) break;
                        bell();
                }
        }

        /* Clear the line */
        Term_erase(0, 0, 255);
}


/*
 * Output a message to the top line of the screen.
 *
 * Break long messages into multiple pieces (40-72 chars).
 *
 * Allow multiple short messages to "share" the top line.
 *
 * Prompt the user to make sure he has a chance to read them.
 *
 * These messages are memorized for later reference (see above).
 *
 * We could do "Term_fresh()" to provide "flicker" if needed.
 *
 * The global "msg_flag" variable can be cleared to tell us to
 * "erase" any "pending" messages still on the screen.
 *
 * XXX XXX XXX Note that we must be very careful about using the
 * "msg_print()" functions without explicitly calling the special
 * "msg_print(NULL)" function, since this may result in the loss
 * of information if the screen is cleared, or if anything is
 * displayed on the top line.
 *
 * XXX XXX XXX Note that "msg_print(NULL)" will clear the top line
 * even if no messages are pending.  This is probably a hack.
 */
void msg_print(cptr msg)
{
        static int p = 0;

        int n;

        char *t;

        char buf[1024];

        if (world_monster) return;

        /* Hack -- Reset */
        if (!msg_flag) {
                /* Clear the line */
                Term_erase(0, 0, 255);
                p = 0;
        }

        /* Message Length */
        n = (msg ? strlen(msg) : 0);

        /* Hack -- flush when requested or needed */
        if (p && (!msg || ((p + n) > 72)))
        {
                /* Flush */
                msg_flush(p);

                /* Forget it */
                msg_flag = FALSE;

                /* Reset */
                p = 0;
        }


        /* No message */
        if (!msg) return;

        /* Paranoia */
        if (n > 1000) return;


        /* Memorize the message */
        if (character_generated) message_add(msg);


        /* Copy it */
        strcpy(buf, msg);

        /* Analyze the buffer */
        t = buf;

        /* Split message */
        while (n > 72)
        {
                char oops;
                int check, split = 72;

#ifdef JP
                bool k_flag = FALSE;
                int wordlen = 0;

                /* Find the "best" split point */
                for (check = 0; check < 72; check++)
                {
                        if (k_flag)
                        {
                                k_flag = FALSE;
                                continue;
                        }

                        /* Found a valid split point */
                        if (iskanji(t[check]))
                        {
                                k_flag = TRUE;
                                split = check;
                        }
                        else if (t[check] == ' ')
                        {
                                split = check;
                                wordlen = 0;
                        }
                        else
                        {
                                wordlen++;
                                if (wordlen > 20)
                                        split = check;
                        }
                }
#else
                /* Find the "best" split point */
                for (check = 40; check < 72; check++)
                {
                        /* Found a valid split point */
                        if (t[check] == ' ') split = check;
                }
#endif

                /* Save the split character */
                oops = t[split];

                /* Split the message */
                t[split] = '\0';

                /* Display part of the message */
                Term_putstr(0, 0, split, TERM_WHITE, t);

                /* Flush it */
                msg_flush(split + 1);

                /* Memorize the piece */
                /* if (character_generated) message_add(t); */

                /* Restore the split character */
                t[split] = oops;

                /* Insert a space */
                t[--split] = ' ';

                /* Prepare to recurse on the rest of "buf" */
                t += split; n -= split;
        }


        /* Display the tail of the message */
        Term_putstr(p, 0, n, TERM_WHITE, t);

        /* Memorize the tail */
        /* if (character_generated) message_add(t); */

        /* Window stuff */
        p_ptr->window |= (PW_MESSAGE);
        window_stuff();

        /* Remember the message */
        msg_flag = TRUE;

        /* Remember the position */
#ifdef JP
        p += n;
#else
        p += n + 1;
#endif


        /* Optional refresh */
        if (fresh_message) Term_fresh();
}


/*
 * Hack -- prevent "accidents" in "screen_save()" or "screen_load()"
 */
static int screen_depth = 0;


/*
 * Save the screen, and increase the "icky" depth.
 *
 * This function must match exactly one call to "screen_load()".
 */
void screen_save(void)
{
        /* Hack -- Flush messages */
        msg_print(NULL);

        /* Save the screen (if legal) */
        if (screen_depth++ == 0) Term_save();

        /* Increase "icky" depth */
        character_icky++;
}


/*
 * Load the screen, and decrease the "icky" depth.
 *
 * This function must match exactly one call to "screen_save()".
 */
void screen_load(void)
{
        /* Hack -- Flush messages */
        msg_print(NULL);

        /* Load the screen (if legal) */
        if (--screen_depth == 0) Term_load();

        /* Decrease "icky" depth */
        character_icky--;
}


/*
 * Display a formatted message, using "vstrnfmt()" and "msg_print()".
 */
void msg_format(cptr fmt, ...)
{
        va_list vp;

        char buf[1024];

        /* Begin the Varargs Stuff */
        va_start(vp, fmt);

        /* Format the args, save the length */
        (void)vstrnfmt(buf, 1024, fmt, vp);

        /* End the Varargs Stuff */
        va_end(vp);

        /* Display */
        msg_print(buf);
}



/*
 * Display a string on the screen using an attribute.
 *
 * At the given location, using the given attribute, if allowed,
 * add the given string.  Do not clear the line.
 */
void c_put_str(byte attr, cptr str, int row, int col)
{
        /* Position cursor, Dump the attr/text */
        Term_putstr(col, row, -1, attr, str);
}

/*
 * As above, but in "white"
 */
void put_str(cptr str, int row, int col)
{
        /* Spawn */
        Term_putstr(col, row, -1, TERM_WHITE, str);
}



/*
 * Display a string on the screen using an attribute, and clear
 * to the end of the line.
 */
void c_prt(byte attr, cptr str, int row, int col)
{
        /* Clear line, position cursor */
        Term_erase(col, row, 255);

        /* Dump the attr/text */
        Term_addstr(-1, attr, str);
}

/*
 * As above, but in "white"
 */
void prt(cptr str, int row, int col)
{
        /* Spawn */
        c_prt(TERM_WHITE, str, row, col);
}




/*
 * Print some (colored) text to the screen at the current cursor position,
 * automatically "wrapping" existing text (at spaces) when necessary to
 * avoid placing any text into the last column, and clearing every line
 * before placing any text in that line.  Also, allow "newline" to force
 * a "wrap" to the next line.  Advance the cursor as needed so sequential
 * calls to this function will work correctly.
 *
 * Once this function has been called, the cursor should not be moved
 * until all the related "c_roff()" calls to the window are complete.
 *
 * This function will correctly handle any width up to the maximum legal
 * value of 256, though it works best for a standard 80 character width.
 */
void c_roff(byte a, cptr str)
{
        int x, y;

        int w, h;

        cptr s;

        /* Obtain the size */
        (void)Term_get_size(&w, &h);

        /* Obtain the cursor */
        (void)Term_locate(&x, &y);

        /* Hack -- No more space */
        if( y == h - 1 && x > w - 3) return;

        /* Process the string */
        for (s = str; *s; s++)
        {
                char ch;

#ifdef JP
                int k_flag = iskanji(*s);
#endif
                /* Force wrap */
                if (*s == '\n')
                {
                        /* Wrap */
                        x = 0;
                        y++;

                        /* No more space */
                        if( y == h ) break;

                        /* Clear line, move cursor */
                        Term_erase(x, y, 255);

                        break;
                }

                /* Clean up the char */
#ifdef JP
                ch = ((isprint(*s) || k_flag) ? *s : ' ');
#else
                ch = (isprint(*s) ? *s : ' ');
#endif


                /* Wrap words as needed */
#ifdef JP
                if (( x >= ( (k_flag) ? w - 2 : w - 1 ) ) && (ch != ' '))
#else
                if ((x >= w - 1) && (ch != ' '))
#endif

                {
                        int i, n = 0;

                        byte av[256];
                        char cv[256];

                        /* Wrap word */
                        if (x < w)
#ifdef JP
                        {
                        /* ¸½ºß¤¬È¾³Ñʸ»ú¤Î¾ì¹ç */
                        if( !k_flag )
#endif
                        {
                                /* Scan existing text */
                                for (i = w - 2; i >= 0; i--)
                                {
                                        /* Grab existing attr/char */
                                        Term_what(i, y, &av[i], &cv[i]);

                                        /* Break on space */
                                        if (cv[i] == ' ') break;

                                        /* Track current word */
                                        n = i;
#ifdef JP
                                        if (cv[i] == '(') break;
#endif
                                }
                        }

#ifdef JP
                        else
                        {
                                /* ¸½ºß¤¬Á´³Ñʸ»ú¤Î¤È¤­ */
                                /* ʸƬ¤¬¡Ö¡£¡×¡Ö¡¢¡×Åù¤Ë¤Ê¤ë¤È¤­¤Ï¡¢¤½¤Î£±¤ÄÁ°¤Î¸ì¤Ç²þ¹Ô */
                                if (strncmp(s, "¡£", 2) == 0 || strncmp(s, "¡¢", 2) == 0
#if 0                   /* °ìÈÌŪ¤Ë¤Ï¡Ö¥£¡×¡Ö¡¼¡×¤Ï¶Ø§¤ÎÂоݳ° */
                                        || strncmp(s, "¥£", 2) == 0 || strncmp(s, "¡¼", 2) == 0
#endif
                               ){
                                        Term_what(x  , y, &av[x  ], &cv[x  ]);
                                        Term_what(x-1, y, &av[x-1], &cv[x-1]);
                                        Term_what(x-2, y, &av[x-2], &cv[x-2]);
                                        n = x - 2;
                                        cv[ x ] = '\0';
                                }
                        }
                        }
#endif
                        /* Special case */
                        if (n == 0) n = w;

                        /* Clear line */
                        Term_erase(n, y, 255);

                        /* Wrap */
                        x = 0;
                        y++;

                        /* No more space */
                        if( y == h ) break;

                        /* Clear line, move cursor */
                        Term_erase(x, y, 255);

                        /* Wrap the word (if any) */
                        for (i = n; i < w - 1; i++)
                        {
#ifdef JP
                                if( cv[i] == '\0' ) break;
#endif
                                /* Dump */
                                Term_addch(av[i], cv[i]);

                                /* Advance (no wrap) */
                                if (++x > w) x = w;
                        }
                }

                /* Dump */
#ifdef JP
                Term_addch((byte)(a|0x10), ch);
#else
                Term_addch(a, ch);
#endif


#ifdef JP
                if (k_flag)
                {
                        s++;
                        x++;
                        ch = *s;
                        Term_addch((byte)(a|0x20), ch);
                }
#endif
                /* Advance */
                if (++x > w) x = w;
        }
}

/*
 * As above, but in "white"
 */
void roff(cptr str)
{
        /* Spawn */
        c_roff(TERM_WHITE, str);
}




/*
 * Clear part of the screen
 */
void clear_from(int row)
{
        int y;

        /* Erase requested rows */
        for (y = row; y < Term->hgt; y++)
        {
                /* Erase part of the screen */
                Term_erase(0, y, 255);
        }
}




/*
 * Get some input at the cursor location.
 * Assume the buffer is initialized to a default string.
 * Note that this string is often "empty" (see below).
 * The default buffer is displayed in yellow until cleared.
 * Pressing RETURN right away accepts the default entry.
 * Normal chars clear the default and append the char.
 * Backspace clears the default or deletes the final char.
 * ESCAPE clears the buffer and the window and returns FALSE.
 * RETURN accepts the current buffer contents and returns TRUE.
 */
bool askfor_aux(char *buf, int len)
{
        int y, x;

        int i = 0;

        int k = 0;

        bool done = FALSE;


#ifdef JP
    int k_flag[128];
#endif
        /* Locate the cursor */
        Term_locate(&x, &y);


        /* Paranoia -- check len */
        if (len < 1) len = 1;

        /* Paranoia -- check column */
        if ((x < 0) || (x >= 80)) x = 0;

        /* Restrict the length */
        if (x + len > 80) len = 80 - x;


        /* Paranoia -- Clip the default entry */
        buf[len] = '\0';


        /* Display the default answer */
        Term_erase(x, y, len);
        Term_putstr(x, y, -1, TERM_YELLOW, buf);


        /* Process input */
        while (!done)
        {
                /* Place cursor */
                Term_gotoxy(x + k, y);

                /* Get a key */
                i = inkey();

                /* Analyze the key */
                switch (i)
                {
                case ESCAPE:
                        k = 0;
                        done = TRUE;
                        break;

                case '\n':
                case '\r':
                        k = strlen(buf);
                        done = TRUE;
                        break;

                case 0x7F:
                case '\010':
#ifdef JP
                                if (k > 0)
                                {
                                        k--;
                                        if (k_flag[k] != 0)
                                                k--;
                                }
#else
                        if (k > 0) k--;
#endif

                        break;

                default:
#ifdef JP
       {                        /* ÊÒ»³¤µ¤óºîÀ® */
                int next;

                                if (iskanji (i)) {
                                        inkey_base = TRUE;
                                        next = inkey ();
                                        if (k+1 < len) {
                                                buf[k++] = i;
                                                buf[k] = next;
                                                k_flag[k++] = 1;
                                        } else
                                                bell();
                                } else {
#ifdef SJIS
                    if(k<len && (isprint(i) || (0xa0<=i && i<=0xdf))){
#else
                    if(k<len && isprint(i)){
#endif
                                                buf[k] = i;
                                                k_flag[k++] = 0;
                                        } else
                                                bell();
                               }
                 }
#else
                        if ((k < len) && (isprint(i)))
                        {
                                buf[k++] = i;
                        }
                        else
                        {
                                bell();
                        }
#endif

                        break;
                }

                /* Terminate */
                buf[k] = '\0';

                /* Update the entry */
                Term_erase(x, y, len);
                Term_putstr(x, y, -1, TERM_WHITE, buf);
        }

        /* Aborted */
        if (i == ESCAPE) return (FALSE);

        /* Success */
        return (TRUE);
}


/*
 * Get a string from the user
 *
 * The "prompt" should take the form "Prompt: "
 *
 * Note that the initial contents of the string is used as
 * the default response, so be sure to "clear" it if needed.
 *
 * We clear the input, and return FALSE, on "ESCAPE".
 */
bool get_string(cptr prompt, char *buf, int len)
{
        bool res;

        /* Paranoia XXX XXX XXX */
        msg_print(NULL);

        /* Display prompt */
        prt(prompt, 0, 0);

        /* Ask the user for a string */
        res = askfor_aux(buf, len);

        /* Clear prompt */
        prt("", 0, 0);

        /* Result */
        return (res);
}


/*
 * Verify something with the user
 *
 * The "prompt" should take the form "Query? "
 *
 * Note that "[y/n]" is appended to the prompt.
 */
bool get_check(cptr prompt)
{
        return get_check_strict(prompt, 0);
}

/*
 * Verify something with the user strictly
 *
 * mode & CHECK_OKAY_CANCEL : force user to answer 'O'kay or 'C'ancel
 * mode & CHECK_NO_ESCAPE   : don't allow ESCAPE key
 * mode & CHECK_NO_HISTORY  : no message_add
 * mode & CHECK_DEFAULT_Y   : accept any key as y, except n and Esc.
 */
bool get_check_strict(cptr prompt, int mode)
{
        int i;
        char buf[80];
        bool flag = FALSE;

        if (auto_more)
        {
                p_ptr->window |= PW_MESSAGE;
                window_stuff();
                num_more = 0;
        }

        /* Paranoia XXX XXX XXX */
        msg_print(NULL);

        if (!rogue_like_commands)
                mode &= ~CHECK_OKAY_CANCEL;


        /* Hack -- Build a "useful" prompt */
        if (mode & CHECK_OKAY_CANCEL)
        {
                my_strcpy(buf, prompt, sizeof(buf)-15);
                strcat(buf, "[(O)k/(C)ancel]");
        }
        else if (mode & CHECK_DEFAULT_Y)
        {
                my_strcpy(buf, prompt, sizeof(buf)-5);
                strcat(buf, "[Y/n]");
        }
        else
        {
                my_strcpy(buf, prompt, sizeof(buf)-5);
                strcat(buf, "[y/n]");
        }

        /* Prompt for it */
        prt(buf, 0, 0);

        if (!(mode & CHECK_NO_HISTORY) && p_ptr->playing)
        {
                /* HACK : Add the line to message buffer */
                message_add(buf);
                p_ptr->window |= (PW_MESSAGE);
                window_stuff();
        }

        /* Get an acceptable answer */
        while (TRUE)
        {
                i = inkey();

                if (!(mode & CHECK_NO_ESCAPE))
                {
                        if (i == ESCAPE)
                        {
                                flag = FALSE;
                                break;
                        }
                }

                if (mode & CHECK_OKAY_CANCEL)
                {
                        if (i == 'o' || i == 'O')
                        {
                                flag = TRUE;
                                break;
                        }
                        else if (i == 'c' || i == 'C')
                        {
                                flag = FALSE;
                                break;
                        }
                }
                else
                {
                        if (i == 'y' || i == 'Y')
                        {
                                flag = TRUE;
                                break;
                        }
                        else if (i == 'n' || i == 'N')
                        {
                                flag = FALSE;
                                break;
                        }
                }

                if (mode & CHECK_DEFAULT_Y)
                {
                        flag = TRUE;
                        break;
                }

                bell();
        }

        /* Erase the prompt */
        prt("", 0, 0);

        /* Return the flag */
        return flag;
}


/*
 * Prompts for a keypress
 *
 * The "prompt" should take the form "Command: "
 *
 * Returns TRUE unless the character is "Escape"
 */
bool get_com(cptr prompt, char *command, bool z_escape)
{
        /* Paranoia XXX XXX XXX */
        msg_print(NULL);

        /* Display a prompt */
        prt(prompt, 0, 0);

        /* Get a key */
        *command = inkey();

        /* Clear the prompt */
        prt("", 0, 0);

        /* Handle "cancel" */
        if (*command == ESCAPE) return (FALSE);
        if (z_escape && ((*command == 'z') || (*command == 'Z'))) return (FALSE);

        /* Success */
        return (TRUE);
}


/*
 * Request a "quantity" from the user
 *
 * Hack -- allow "command_arg" to specify a quantity
 */
s16b get_quantity(cptr prompt, int max)
{
        int amt;

        char tmp[80];

        char buf[80];


        /* Use "command_arg" */
        if (command_arg)
        {
                /* Extract a number */
                amt = command_arg;

                /* Clear "command_arg" */
                command_arg = 0;

                /* Enforce the maximum */
                if (amt > max) amt = max;

                /* Use it */
                return (amt);
        }

#ifdef ALLOW_REPEAT /* TNB */

        /* Get the item index */
        if ((max != 1) && repeat_pull(&amt))
        {
                /* Enforce the maximum */
                if (amt > max) amt = max;

                /* Enforce the minimum */
                if (amt < 0) amt = 0;

                /* Use it */
                return (amt);
        }

#endif /* ALLOW_REPEAT -- TNB */

        /* Build a prompt if needed */
        if (!prompt)
        {
                /* Build a prompt */
#ifdef JP
                        sprintf(tmp, "¤¤¤¯¤Ä¤Ç¤¹¤« (1-%d): ", max);
#else
                sprintf(tmp, "Quantity (1-%d): ", max);
#endif


                /* Use that prompt */
                prompt = tmp;
        }


        /* Default to one */
        amt = 1;

        /* Build the default */
        sprintf(buf, "%d", amt);

        /* Ask for a quantity */
        if (!get_string(prompt, buf, 6)) return (0);

        /* Extract a number */
        amt = atoi(buf);

        /* A letter means "all" */
        if (isalpha(buf[0])) amt = max;

        /* Enforce the maximum */
        if (amt > max) amt = max;

        /* Enforce the minimum */
        if (amt < 0) amt = 0;

#ifdef ALLOW_REPEAT /* TNB */

        if (amt) repeat_push(amt);

#endif /* ALLOW_REPEAT -- TNB */

        /* Return the result */
        return (amt);
}


/*
 * Pause for user response XXX XXX XXX
 */
void pause_line(int row)
{
        prt("", row, 0);
#ifdef JP
        put_str("[ ²¿¤«¥­¡¼¤ò²¡¤·¤Æ²¼¤µ¤¤ ]", row, 26);
#else
        put_str("[Press any key to continue]", row, 23);
#endif

        (void)inkey();
        prt("", row, 0);
}


/*
 * Hack -- special buffer to hold the action of the current keymap
 */
static char request_command_buffer[256];



typedef struct
{
        cptr name;
        byte cmd;
        bool fin;
} menu_naiyou;

#ifdef JP
menu_naiyou menu_info[10][10] =
{
        {
                {"ËâË¡/ÆüìǽÎÏ", 1, FALSE},
                {"¹ÔÆ°", 2, FALSE},
                {"Æ»¶ñ(»ÈÍÑ)", 3, FALSE},
                {"Æ»¶ñ(¤½¤Î¾)", 4, FALSE},
                {"ÁõÈ÷", 5, FALSE},
                {"Èâ/È¢", 6, FALSE},
                {"¾ðÊó", 7, FALSE},
                {"ÀßÄê", 8, FALSE},
                {"¤½¤Î¾", 9, FALSE},
                {"", 0, FALSE},
        },

        {
                {"»È¤¦(m)", 'm', TRUE},
                {"Ä´¤Ù¤ë(b/P)", 'b', TRUE},
                {"³Ð¤¨¤ë(G)", 'G', TRUE},
                {"ÆüìǽÎϤò»È¤¦(U/O)", 'U', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"µÙ©¤¹¤ë(R)", 'R', TRUE},
                {"¥È¥é¥Ã¥×²ò½ü(D)", 'D', TRUE},
                {"õ¤¹(s)", 's', TRUE},
                {"¼þ¤ê¤òÄ´¤Ù¤ë(l/x)", 'l', TRUE},
                {"¥¿¡¼¥²¥Ã¥È»ØÄê(*)", '*', TRUE},
                {"·ê¤ò·¡¤ë(T/^t)", 'T', TRUE},
                {"³¬Ãʤò¾å¤ë(<)", '<', TRUE},
                {"³¬Ãʤò²¼¤ê¤ë(>)", '>', TRUE},
                {"¥Ú¥Ã¥È¤ËÌ¿Î᤹¤ë(p)", 'p', TRUE},
                {"õº÷¥â¡¼¥É¤ÎON/OFF(S/#)", 'S', TRUE}
        },

        {
                {"Æɤà(r)", 'r', TRUE},
                {"°û¤à(q)", 'q', TRUE},
                {"¾ó¤ò»È¤¦(u/Z)", 'u', TRUE},
                {"ËâË¡ËÀ¤ÇÁÀ¤¦(a/z)", 'a', TRUE},
                {"¥í¥Ã¥É¤ò¿¶¤ë(z/a)", 'z', TRUE},
                {"»ÏÆ°¤¹¤ë(A)", 'A', TRUE},
                {"¿©¤Ù¤ë(E)", 'E', TRUE},
                {"Èô¤ÓÆ»¶ñ¤Ç·â¤Ä(f/t)", 'f', TRUE},
                {"Åꤲ¤ë(v)", 'v', TRUE},
                {"", 0, FALSE}
        },

        {
                {"½¦¤¦(g)", 'g', TRUE},
                {"Íî¤È¤¹(d)", 'd', TRUE},
                {"²õ¤¹(k/^d)", 'k', TRUE},
                {"Ìäò¹ï¤à({)", '{', TRUE},
                {"Ìäò¾Ã¤¹(})", '}', TRUE},
                {"Ä´ºº(I)", 'I', TRUE},
                {"¥¢¥¤¥Æ¥à°ìÍ÷(i)", 'i', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"ÁõÈ÷¤¹¤ë(w)", 'w', TRUE},
                {"ÁõÈ÷¤ò³°¤¹(t/T)", 't', TRUE},
                {"dzÎÁ¤òÊäµë(F)", 'F', TRUE},
                {"ÁõÈ÷°ìÍ÷(e)", 'e', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"³«¤±¤ë(o)", 'o', TRUE},
                {"ÊĤ¸¤ë(c)", 'c', TRUE},
                {"ÂÎÅö¤¿¤ê¤¹¤ë(B/f)", 'B', TRUE},
                {"¤¯¤µ¤Ó¤òÂǤÄ(j/S)", 'j', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"¥À¥ó¥¸¥ç¥ó¤ÎÁ´ÂοÞ(M)", 'M', TRUE},
                {"°ÌÃÖ¤ò³Îǧ(L/W)", 'L', TRUE},
                {"³¬¤ÎÊ·°Ïµ¤(^f)", KTRL('F'), TRUE},
                {"¥¹¥Æ¡¼¥¿¥¹(C)", 'C', TRUE},
                {"ʸ»ú¤ÎÀâÌÀ(/)", '/', TRUE},
                {"¥á¥Ã¥»¡¼¥¸ÍúÎò(^p)", KTRL('P'), TRUE},
                {"¸½ºß¤Î»þ¹ï(^t/')", KTRL('T'), TRUE},
                {"¸½ºß¤ÎÃμ±(~)", '~', TRUE},
                {"¥×¥ì¥¤µ­Ï¿(|)", '|', TRUE},
                {"", 0, FALSE}
        },

        {
                {"¥ª¥×¥·¥ç¥ó(=)", '=', TRUE},
                {"¥Þ¥¯¥í(@)", '@', TRUE},
                {"²èÌÌɽ¼¨(%)", '%', TRUE},
                {"¥«¥é¡¼(&)", '&', TRUE},
                {"ÀßÄêÊѹ¹¥³¥Þ¥ó¥É(\")", '\"', TRUE},
                {"¼«Æ°½¦¤¤¤ò¥í¡¼¥É($)", '$', TRUE},
                {"¥·¥¹¥Æ¥à(!)", '!', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"¥»¡¼¥Ö&ÃæÃÇ(^x)", KTRL('X'), TRUE},
                {"¥»¡¼¥Ö(^s)", KTRL('S'), TRUE},
                {"¥Ø¥ë¥×(?)", '?', TRUE},
                {"ºÆÉÁ²è(^r)", KTRL('R'), TRUE},
                {"¥á¥â(:)", ':', TRUE},
                {"µ­Ç°»£±Æ())", ')', TRUE},
                {"µ­Ç°»£±Æ¤Îɽ¼¨(()", '(', TRUE},
                {"¥Ð¡¼¥¸¥ç¥ó¾ðÊó(V)", 'V', TRUE},
                {"°úÂह¤ë(Q)", 'Q', TRUE},
                {"", 0, FALSE}
        },
};
#else
menu_naiyou menu_info[10][10] =
{
        {
                {"Magic/Special", 1, FALSE},
                {"Action", 2, FALSE},
                {"Items(use)", 3, FALSE},
                {"Items(other)", 4, FALSE},
                {"Equip", 5, FALSE},
                {"Door/Box", 6, FALSE},
                {"Infomations", 7, FALSE},
                {"Options", 8, FALSE},
                {"Other commands", 9, FALSE},
                {"", 0, FALSE},
        },

        {
                {"Use(m)", 'm', TRUE},
                {"See tips(b/P)", 'b', TRUE},
                {"Study(G)", 'G', TRUE},
                {"Special abilities(U/O)", 'U', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"Rest(R)", 'R', TRUE},
                {"Disarm a trap(D)", 'D', TRUE},
                {"Search(s)", 's', TRUE},
                {"Look(l/x)", 'l', TRUE},
                {"Target(*)", '*', TRUE},
                {"Dig(T/^t)", 'T', TRUE},
                {"Go up stairs(<)", '<', TRUE},
                {"Go down staies(>)", '>', TRUE},
                {"Command pets(p)", 'p', TRUE},
                {"Search mode ON/OFF(S/#)", 'S', TRUE}
        },

        {
                {"Read a scroll(r)", 'r', TRUE},
                {"Drink a potion(q)", 'q', TRUE},
                {"Use a staff(u/Z)", 'u', TRUE},
                {"Aim a wand(a/z)", 'a', TRUE},
                {"Zap a rod(z/a)", 'z', TRUE},
                {"Activate an equipment(A)", 'A', TRUE},
                {"Eat(E)", 'E', TRUE},
                {"Fire missile weapon(f/t)", 'f', TRUE},
                {"Throw an item(v)", 'v', TRUE},
                {"", 0, FALSE}
        },

        {
                {"Get items(g)", 'g', TRUE},
                {"Drop an item(d)", 'd', TRUE},
                {"Destroy an item(k/^d)", 'k', TRUE},
                {"Inscribe an item({)", '{', TRUE},
                {"Uninscribe an item(})", '}', TRUE},
                {"Info about an item(I)", 'I', TRUE},
                {"Inventory list(i)", 'i', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"Wear(w)", 'w', TRUE},
                {"Take off(t/T)", 't', TRUE},
                {"Refuel(F)", 'F', TRUE},
                {"Equipment list(e)", 'e', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"Open(o)", 'o', TRUE},
                {"Close(c)", 'c', TRUE},
                {"Bash a door(B/f)", 'B', TRUE},
                {"Jam a door(j/S)", 'j', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"Full map(M)", 'M', TRUE},
                {"Map(L/W)", 'L', TRUE},
                {"Level feeling(^f)", KTRL('F'), TRUE},
                {"Character status(C)", 'C', TRUE},
                {"Identify symbol(/)", '/', TRUE},
                {"Show prev messages(^p)", KTRL('P'), TRUE},
                {"Current time(^t/')", KTRL('T'), TRUE},
                {"Various infomations(~)", '~', TRUE},
                {"Play record menu(|)", '|', TRUE},
                {"", 0, FALSE}
        },

        {
                {"Set options(=)", '=', TRUE},
                {"Interact with macros(@)", '@', TRUE},
                {"Interact w/ visuals(%)", '%', TRUE},
                {"Interact with colors(&)", '&', TRUE},
                {"Enter a user pref(\")", '\"', TRUE},
                {"Reload auto-pick pref($)", '$', TRUE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE},
                {"", 0, FALSE}
        },

        {
                {"Save and quit(^x)", KTRL('X'), TRUE},
                {"Save(^s)", KTRL('S'), TRUE},
                {"Help(obsoleted)(?)", '?', TRUE},
                {"Redraw(^r)", KTRL('R'), TRUE},
                {"Take note(:)", ':', TRUE},
                {"Dump screen dump(()", ')', TRUE},
                {"Load screen dump())", '(', TRUE},
                {"Version info(V)", 'V', TRUE},
                {"Quit(Q)", 'Q', TRUE},
                {"", 0, FALSE}
        },
};
#endif

typedef struct
{
        cptr name;
        byte window;
        byte number;
        byte jouken;
        byte jouken_naiyou;
} special_menu_naiyou;

#define MENU_CLASS 1
#define MENU_WILD 2

#ifdef JP
special_menu_naiyou special_menu_info[] =
{
        {"ĶǽÎÏ/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
        {"¤â¤Î¤Þ¤Í/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_IMITATOR},
        {"ɬ»¦µ»/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_SAMURAI},
        {"Îýµ¤½Ñ/ËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
        {"¶ÀËâË¡/ÆüìǽÎÏ", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
        {"¹­°è¥Þ¥Ã¥×(<)", 2, 6, MENU_WILD, FALSE},
        {"Ä̾ï¥Þ¥Ã¥×(>)", 2, 7, MENU_WILD, TRUE},
        {"", 0, 0, 0, 0},
};
#else
special_menu_naiyou special_menu_info[] =
{
        {"MindCraft/Special", 0, 0, MENU_CLASS, CLASS_MINDCRAFTER},
        {"Imitation/Special", 0, 0, MENU_CLASS, CLASS_IMITATOR},
        {"Technique/Special", 0, 0, MENU_CLASS, CLASS_SAMURAI},
        {"Mind/Magic/Special", 0, 0, MENU_CLASS, CLASS_FORCETRAINER},
        {"MirrorMagic/Special", 0, 0, MENU_CLASS, CLASS_MIRROR_MASTER},
        {"Enter global map(<)", 2, 6, MENU_WILD, FALSE},
        {"Enter local map(>)", 2, 7, MENU_WILD, TRUE},
        {"", 0, 0, 0, 0},
};
#endif

static char inkey_from_menu(void)
{
        char cmd;
        int basey, basex;
        int num = 0, max_num, old_num = 0;
        int menu = 0;
        bool kisuu;

        if (py - panel_row_min > 10) basey = 2;
        else basey = 13;
        basex = 15;

        /* Clear top line */
        prt("", 0, 0);

        screen_save();

        while(1)
        {
                int i;
                char sub_cmd;
                cptr menu_name;
                if (!menu) old_num = num;
                put_str("+----------------------------------------------------+", basey, basex);
                put_str("|                                                    |", basey+1, basex);
                put_str("|                                                    |", basey+2, basex);
                put_str("|                                                    |", basey+3, basex);
                put_str("|                                                    |", basey+4, basex);
                put_str("|                                                    |", basey+5, basex);
                put_str("+----------------------------------------------------+", basey+6, basex);

                for(i = 0; i < 10; i++)
                {
                        int hoge;
                        if (!menu_info[menu][i].cmd) break;
                        menu_name = menu_info[menu][i].name;
                        for(hoge = 0; ; hoge++)
                        {
                                if (!special_menu_info[hoge].name[0]) break;
                                if ((menu != special_menu_info[hoge].window) || (i != special_menu_info[hoge].number)) continue;
                                switch(special_menu_info[hoge].jouken)
                                {
                                case MENU_CLASS:
                                        if (p_ptr->pclass == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
                                        break;
                                case MENU_WILD:
                                        if (!dun_level && !p_ptr->inside_arena && !p_ptr->inside_quest)
                                        {
                                                if ((byte)p_ptr->wild_mode == special_menu_info[hoge].jouken_naiyou) menu_name = special_menu_info[hoge].name;
                                        }
                                        break;
                                default:
                                        break;
                                }
                        }
                        put_str(menu_name, basey + 1 + i / 2, basex + 4 + (i % 2) * 24);
                }
                max_num = i;
                kisuu = max_num % 2;
#ifdef JP
                put_str("¡Õ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
#else
                put_str("> ",basey + 1 + num / 2, basex + 2 + (num % 2) * 24);
#endif

                /* Place the cursor on the player */
                move_cursor_relative(py, px);

                /* Get a command */
                sub_cmd = inkey();
                if ((sub_cmd == ' ') || (sub_cmd == 'x') || (sub_cmd == 'X') || (sub_cmd == '\r') || (sub_cmd == '\n'))
                {
                        if (menu_info[menu][num].fin)
                        {
                                cmd = menu_info[menu][num].cmd;
                                use_menu = TRUE;
                                break;
                        }
                        else
                        {
                                menu = menu_info[menu][num].cmd;
                                num = 0;
                                basey += 2;
                                basex += 8;
                        }
                }
                else if ((sub_cmd == ESCAPE) || (sub_cmd == 'z') || (sub_cmd == 'Z') || (sub_cmd == '0'))
                {
                        if (!menu)
                        {
                                cmd = ESCAPE;
                                break;
                        }
                        else
                        {
                                menu = 0;
                                num = old_num;
                                basey -= 2;
                                basex -= 8;
                                screen_load();
                                screen_save();
                        }
                }
                else if ((sub_cmd == '2') || (sub_cmd == 'j') || (sub_cmd == 'J'))
                {
                        if (kisuu)
                        {
                                if (num % 2)
                                        num = (num + 2) % (max_num - 1);
                                else
                                        num = (num + 2) % (max_num + 1);
                        }
                        else num = (num + 2) % max_num;
                }
                else if ((sub_cmd == '8') || (sub_cmd == 'k') || (sub_cmd == 'K'))
                {
                        if (kisuu)
                        {
                                if (num % 2)
                                        num = (num + max_num - 3) % (max_num - 1);
                                else
                                        num = (num + max_num - 1) % (max_num + 1);
                        }
                        else num = (num + max_num - 2) % max_num;
                }
                else if ((sub_cmd == '4') || (sub_cmd == '6') || (sub_cmd == 'h') || (sub_cmd == 'H') || (sub_cmd == 'l') || (sub_cmd == 'L'))
                {
                        if ((num % 2) || (num == max_num - 1))
                        {
                                num--;
                        }
                        else if (num < max_num - 1)
                        {
                                num++;
                        }
                }
        }

        screen_load();
        if (!inkey_next) inkey_next = "";

        return (cmd);
}

/*
 * Request a command from the user.
 *
 * Sets p_ptr->command_cmd, p_ptr->command_dir, p_ptr->command_rep,
 * p_ptr->command_arg.  May modify p_ptr->command_new.
 *
 * Note that "caret" ("^") is treated specially, and is used to
 * allow manual input of control characters.  This can be used
 * on many machines to request repeated tunneling (Ctrl-H) and
 * on the Macintosh to request "Control-Caret".
 *
 * Note that "backslash" is treated specially, and is used to bypass any
 * keymap entry for the following character.  This is useful for macros.
 *
 * Note that this command is used both in the dungeon and in
 * stores, and must be careful to work in both situations.
 *
 * Note that "p_ptr->command_new" may not work any more.  XXX XXX XXX
 */
void request_command(int shopping)
{
        int i;

        char cmd;
        int mode;

        cptr act;

#ifdef JP
        int caretcmd = 0;
#endif
        /* Roguelike */
        if (rogue_like_commands)
        {
                mode = KEYMAP_MODE_ROGUE;
        }

        /* Original */
        else
        {
                mode = KEYMAP_MODE_ORIG;
        }


        /* No command yet */
        command_cmd = 0;

        /* No "argument" yet */
        command_arg = 0;

        /* No "direction" yet */
        command_dir = 0;

        use_menu = FALSE;


        /* Get command */
        while (1)
        {
                /* Hack -- auto-commands */
                if (command_new)
                {
                        /* Flush messages */
                        msg_print(NULL);

                        /* Use auto-command */
                        cmd = command_new;

                        /* Forget it */
                        command_new = 0;
                }

                /* Get a keypress in "command" mode */
                else
                {
                        /* Hack -- no flush needed */
                        msg_flag = FALSE;
                        num_more = 0;

                        /* Activate "command mode" */
                        inkey_flag = TRUE;

                        /* Get a command */
                        cmd = inkey();

                        if (!shopping && command_menu && ((cmd == '\r') || (cmd == '\n') || (cmd == 'x') || (cmd == 'X'))
                            && !keymap_act[mode][(byte)(cmd)])
                                cmd = inkey_from_menu();
                }

                /* Clear top line */
                prt("", 0, 0);


                /* Command Count */
                if (cmd == '0')
                {
                        int old_arg = command_arg;

                        /* Reset */
                        command_arg = 0;

                        /* Begin the input */
#ifdef JP
                        prt("²ó¿ô: ", 0, 0);
#else
                        prt("Count: ", 0, 0);
#endif


                        /* Get a command count */
                        while (1)
                        {
                                /* Get a new keypress */
                                cmd = inkey();

                                /* Simple editing (delete or backspace) */
                                if ((cmd == 0x7F) || (cmd == KTRL('H')))
                                {
                                        /* Delete a digit */
                                        command_arg = command_arg / 10;

                                        /* Show current count */
#ifdef JP
                                        prt(format("²ó¿ô: %d", command_arg), 0, 0);
#else
                                        prt(format("Count: %d", command_arg), 0, 0);
#endif

                                }

                                /* Actual numeric data */
                                else if (cmd >= '0' && cmd <= '9')
                                {
                                        /* Stop count at 9999 */
                                        if (command_arg >= 1000)
                                        {
                                                /* Warn */
                                                bell();

                                                /* Limit */
                                                command_arg = 9999;
                                        }

                                        /* Increase count */
                                        else
                                        {
                                                /* Incorporate that digit */
                                                command_arg = command_arg * 10 + D2I(cmd);
                                        }

                                        /* Show current count */
#ifdef JP
                                        prt(format("²ó¿ô: %d", command_arg), 0, 0);
#else
                                        prt(format("Count: %d", command_arg), 0, 0);
#endif

                                }

                                /* Exit on "unusable" input */
                                else
                                {
                                        break;
                                }
                        }

                        /* Hack -- Handle "zero" */
                        if (command_arg == 0)
                        {
                                /* Default to 99 */
                                command_arg = 99;

                                /* Show current count */
#ifdef JP
                                prt(format("²ó¿ô: %d", command_arg), 0, 0);
#else
                                prt(format("Count: %d", command_arg), 0, 0);
#endif

                        }

                        /* Hack -- Handle "old_arg" */
                        if (old_arg != 0)
                        {
                                /* Restore old_arg */
                                command_arg = old_arg;

                                /* Show current count */
#ifdef JP
prt(format("²ó¿ô: %d", command_arg), 0, 0);
#else
                                prt(format("Count: %d", command_arg), 0, 0);
#endif

                        }

                        /* Hack -- white-space means "enter command now" */
                        if ((cmd == ' ') || (cmd == '\n') || (cmd == '\r'))
                        {
                                /* Get a real command */
#ifdef JP
                                if (!get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE))
#else
                                if (!get_com("Command: ", (char *)&cmd, FALSE))
#endif

                                {
                                        /* Clear count */
                                        command_arg = 0;

                                        /* Continue */
                                        continue;
                                }
                        }
                }


                /* Allow "keymaps" to be bypassed */
                if (cmd == '\\')
                {
                        /* Get a real command */
#ifdef JP
                        (void)get_com("¥³¥Þ¥ó¥É: ", (char *)&cmd, FALSE);
#else
                        (void)get_com("Command: ", (char *)&cmd, FALSE);
#endif


                        /* Hack -- bypass keymaps */
                        if (!inkey_next) inkey_next = "";
                }


                /* Allow "control chars" to be entered */
                if (cmd == '^')
                {
                        /* Get a new command and controlify it */
#ifdef JP
                        if (get_com("CTRL: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
#else
                        if (get_com("Control: ", (char *)&cmd, FALSE)) cmd = KTRL(cmd);
#endif

                }


                /* Look up applicable keymap */
                act = keymap_act[mode][(byte)(cmd)];

                /* Apply keymap if not inside a keymap already */
                if (act && !inkey_next)
                {
                        /* Install the keymap (limited buffer size) */
                        (void)strnfmt(request_command_buffer, 256, "%s", act);

                        /* Start using the buffer */
                        inkey_next = request_command_buffer;

                        /* Continue */
                        continue;
                }


                /* Paranoia */
                if (!cmd) continue;


                /* Use command */
                command_cmd = (byte)cmd;

                /* Done */
                break;
        }

        /* Hack -- Auto-repeat certain commands */
        if (always_repeat && (command_arg <= 0))
        {
                /* Hack -- auto repeat certain commands */
                if (strchr("TBDoc+", command_cmd))
                {
                        /* Repeat 99 times */
                        command_arg = 99;
                }
        }

        /* Shopping */
        if (shopping == 1)
        {
                /* Convert */
                switch (command_cmd)
                {
                        /* Command "p" -> "purchase" (get) */
                case 'p': command_cmd = 'g'; break;

                        /* Command "m" -> "purchase" (get) */
                case 'm': command_cmd = 'g'; break;

                        /* Command "s" -> "sell" (drop) */
                case 's': command_cmd = 'd'; break;
                }
        }

#ifdef JP
        for (i = 0; i < 256; i++)
        {
                cptr s;
                if ((s = keymap_act[mode][i]) != NULL)
                {
                        if (*s == command_cmd && *(s+1) == 0)
                        {
                                caretcmd = i;
                                break;
                        }
                }
        }
        if (!caretcmd)
                caretcmd = command_cmd;
#endif

#ifdef JP
#undef strchr
#define strchr strchr_j
#endif

        /* Hack -- Scan equipment */
        for (i = INVEN_RARM; i < INVEN_TOTAL; i++)
        {
                cptr s;

                object_type *o_ptr = &inventory[i];

                /* Skip non-objects */
                if (!o_ptr->k_idx) continue;

                /* No inscription */
                if (!o_ptr->inscription) continue;

                /* Obtain the inscription */
                s = quark_str(o_ptr->inscription);

                /* Find a '^' */
                s = strchr(s, '^');

                /* Process preventions */
                while (s)
                {
                        /* Check the "restriction" character */
#ifdef JP
                        if ((s[1] == caretcmd) || (s[1] == '*'))
#else
                        if ((s[1] == command_cmd) || (s[1] == '*'))
#endif

                        {
                                /* Hack -- Verify command */
#ifdef JP
                                if (!get_check("ËÜÅö¤Ç¤¹¤«? "))
#else
                                if (!get_check("Are you sure? "))
#endif

                                {
                                        /* Hack -- Use space */
                                        command_cmd = ' ';
                                }
                        }

                        /* Find another '^' */
                        s = strchr(s + 1, '^');
                }
        }


        /* Hack -- erase the message line. */
        prt("", 0, 0);
}



/*
 * Check a char for "vowel-hood"
 */
bool is_a_vowel(int ch)
{
        switch (ch)
        {
        case 'a':
        case 'e':
        case 'i':
        case 'o':
        case 'u':
        case 'A':
        case 'E':
        case 'I':
        case 'O':
        case 'U':
                return (TRUE);
        }

        return (FALSE);
}



#if 0

/*
 * Replace the first instance of "target" in "buf" with "insert"
 * If "insert" is NULL, just remove the first instance of "target"
 * In either case, return TRUE if "target" is found.
 *
 * XXX Could be made more efficient, especially in the
 * case where "insert" is smaller than "target".
 */
static bool insert_str(char *buf, cptr target, cptr insert)
{
        int   i, len;
        int                b_len, t_len, i_len;

        /* Attempt to find the target (modify "buf") */
        buf = strstr(buf, target);

        /* No target found */
        if (!buf) return (FALSE);

        /* Be sure we have an insertion string */
        if (!insert) insert = "";

        /* Extract some lengths */
        t_len = strlen(target);
        i_len = strlen(insert);
        b_len = strlen(buf);

        /* How much "movement" do we need? */
        len = i_len - t_len;

        /* We need less space (for insert) */
        if (len < 0)
        {
                for (i = t_len; i < b_len; ++i) buf[i+len] = buf[i];
        }

        /* We need more space (for insert) */
        else if (len > 0)
        {
                for (i = b_len-1; i >= t_len; --i) buf[i+len] = buf[i];
        }

        /* If movement occured, we need a new terminator */
        if (len) buf[b_len+len] = '\0';

        /* Now copy the insertion string */
        for (i = 0; i < i_len; ++i) buf[i] = insert[i];

        /* Successful operation */
        return (TRUE);
}


#endif


/*
 * GH
 * Called from cmd4.c and a few other places. Just extracts
 * a direction from the keymap for ch (the last direction,
 * in fact) byte or char here? I'm thinking that keymaps should
 * generally only apply to single keys, which makes it no more
 * than 128, so a char should suffice... but keymap_act is 256...
 */
int get_keymap_dir(char ch)
{
        int d = 0;

        /* Already a direction? */
        if (isdigit(ch))
        {
                d = D2I(ch);
        }
        else
        {
                int mode;
                cptr act, s;

                /* Roguelike */
                if (rogue_like_commands)
                {
                        mode = KEYMAP_MODE_ROGUE;
                }

                /* Original */
                else
                {
                        mode = KEYMAP_MODE_ORIG;
                }

                /* Extract the action (if any) */
                act = keymap_act[mode][(byte)(ch)];

                /* Analyze */
                if (act)
                {
                        /* Convert to a direction */
                        for (s = act; *s; ++s)
                        {
                                /* Use any digits in keymap */
                                if (isdigit(*s)) d = D2I(*s);
                        }
                }
        }

        /* Paranoia */
        if (d == 5) d = 0;

        /* Return direction */
        return (d);
}


#ifdef ALLOW_REPEAT /* TNB */

#define REPEAT_MAX              20

/* Number of chars saved */
static int repeat__cnt = 0;

/* Current index */
static int repeat__idx = 0;

/* Saved "stuff" */
static int repeat__key[REPEAT_MAX];


void repeat_push(int what)
{
        /* Too many keys */
        if (repeat__cnt == REPEAT_MAX) return;

        /* Push the "stuff" */
        repeat__key[repeat__cnt++] = what;

        /* Prevents us from pulling keys */
        ++repeat__idx;
}


bool repeat_pull(int *what)
{
        /* All out of keys */
        if (repeat__idx == repeat__cnt) return (FALSE);

        /* Grab the next key, advance */
        *what = repeat__key[repeat__idx++];

        /* Success */
        return (TRUE);
}

void repeat_check(void)
{
        int             what;

        /* Ignore some commands */
        if (command_cmd == ESCAPE) return;
        if (command_cmd == ' ') return;
        if (command_cmd == '\r') return;
        if (command_cmd == '\n') return;

        /* Repeat Last Command */
        if (command_cmd == 'n')
        {
                /* Reset */
                repeat__idx = 0;

                /* Get the command */
                if (repeat_pull(&what))
                {
                        /* Save the command */
                        command_cmd = what;
                }
        }

        /* Start saving new command */
        else
        {
                /* Reset */
                repeat__cnt = 0;
                repeat__idx = 0;

                what = command_cmd;

                /* Save this command */
                repeat_push(what);
        }
}

#endif /* ALLOW_REPEAT -- TNB */


#ifdef SORT_R_INFO

/*
 * Array size for which InsertionSort
 * is used instead of QuickSort
 */
#define CUTOFF 4


/*
 * Exchange two sort-entries
 * (should probably be coded inline
 * for speed increase)
 */
static void swap(tag_type *a, tag_type *b)
{
        tag_type temp;

        temp.tag = a->tag;
        temp.pointer = a->pointer;

        a->tag = b->tag;
        a->pointer = b->pointer;

        b->tag = temp.tag;
        b->pointer = temp.pointer;
}


/*
 * Insertion-Sort algorithm
 * (used by the Quicksort algorithm)
 */
static void InsertionSort(tag_type elements[], int number)
{
        int j, P;

        tag_type tmp;

        for (P = 1; P < number; P++)
        {
                tmp = elements[P];
                for (j = P; (j > 0) && (elements[j - 1].tag > tmp.tag); j--)
                        elements[j] = elements[j - 1];
                elements[j] = tmp;
        }
}


/*
 * Helper function for Quicksort
 */
static tag_type median3(tag_type elements[], int left, int right)
{
        int center = (left + right) / 2;

        if (elements[left].tag > elements[center].tag)
                swap(&elements[left], &elements[center]);
        if (elements[left].tag > elements[right].tag)
                swap(&elements[left], &elements[right]);
        if (elements[center].tag > elements[right].tag)
                swap(&elements[center], &elements[right]);

        swap(&elements[center], &elements[right - 1]);
        return (elements[right - 1]);
}


/*
 * Quicksort algorithm
 *
 * The "median of three" pivot selection eliminates
 * the bad case of already sorted input.
 *
 * We use InsertionSort for smaller sub-arrays,
 * because it is faster in this case.
 *
 * For details see: "Data Structures and Algorithm
 * Analysis in C" by Mark Allen Weiss.
 */
static void quicksort(tag_type elements[], int left, int right)
{
        int i, j;
        tag_type pivot;

        if (left + CUTOFF <= right)
        {
                pivot = median3(elements, left, right);

                i = left; j = right -1;

                while (TRUE)
                {
                        while (elements[++i].tag < pivot.tag);
                        while (elements[--j].tag > pivot.tag);

                        if (i < j)
                                swap(&elements[i], &elements[j]);
                        else
                                break;
                }

                /* Restore pivot */
                swap(&elements[i], &elements[right - 1]);

                quicksort(elements, left, i - 1);
                quicksort(elements, i + 1, right);
        }
        else
        {
                /* Use InsertionSort on small arrays */
                InsertionSort(elements + left, right - left + 1);
        }
}


/*
 * Frontend for the sorting algorithm
 *
 * Sorts an array of tagged pointers
 * with <number> elements.
 */
void tag_sort(tag_type elements[], int number)
{
        quicksort(elements, 0, number - 1);
}

#endif /* SORT_R_INFO */

#ifdef SUPPORT_GAMMA

/* Table of gamma values */
byte gamma_table[256];

/* Table of ln(x/256) * 256 for x going from 0 -> 255 */
static s16b gamma_helper[256] =
{
0,-1420,-1242,-1138,-1065,-1007,-961,-921,-887,-857,-830,-806,-783,-762,-744,-726,
-710,-694,-679,-666,-652,-640,-628,-617,-606,-596,-586,-576,-567,-577,-549,-541,
-532,-525,-517,-509,-502,-495,-488,-482,-475,-469,-463,-457,-451,-455,-439,-434,
-429,-423,-418,-413,-408,-403,-398,-394,-389,-385,-380,-376,-371,-367,-363,-359,
-355,-351,-347,-343,-339,-336,-332,-328,-325,-321,-318,-314,-311,-308,-304,-301,
-298,-295,-291,-288,-285,-282,-279,-276,-273,-271,-268,-265,-262,-259,-257,-254,
-251,-248,-246,-243,-241,-238,-236,-233,-231,-228,-226,-223,-221,-219,-216,-214,
-212,-209,-207,-205,-203,-200,-198,-196,-194,-192,-190,-188,-186,-184,-182,-180,
-178,-176,-174,-172,-170,-168,-166,-164,-162,-160,-158,-156,-155,-153,-151,-149,
-147,-146,-144,-142,-140,-139,-137,-135,-134,-132,-130,-128,-127,-125,-124,-122,
-120,-119,-117,-116,-114,-112,-111,-109,-108,-106,-105,-103,-102,-100,-99,-97,
-96,-95,-93,-92,-90,-89,-87,-86,-85,-83,-82,-80,-79,-78,-76,-75,
-74,-72,-71,-70,-68,-67,-66,-65,-63,-62,-61,-59,-58,-57,-56,-54,
-53,-52,-51,-50,-48,-47,-46,-45,-44,-42,-41,-40,-39,-38,-37,-35,
-34,-33,-32,-31,-30,-29,-27,-26,-25,-24,-23,-22,-21,-20,-19,-18,
-17,-16,-14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1
};


/* 
 * Build the gamma table so that floating point isn't needed.
 * 
 * Note gamma goes from 0->256.  The old value of 100 is now 128.
 */
void build_gamma_table(int gamma)
{
        int i, n;
        
        /*
         * value is the current sum.
         * diff is the new term to add to the series.
         */
        long value, diff;
        
        /* Hack - convergence is bad in these cases. */
        gamma_table[0] = 0;
        gamma_table[255] = 255;
        
        for (i = 1; i < 255; i++)
        {
                /* 
                 * Initialise the Taylor series
                 *
                 * value and diff have been scaled by 256
                 */
                
                n = 1;
                value = 256 * 256;
                diff = ((long)gamma_helper[i]) * (gamma - 256);
                
                while (diff)
                {
                        value += diff;
                        n++;
                        
                        
                        /*
                         * Use the following identiy to calculate the gamma table.
                         * exp(x) = 1 + x + x^2/2 + x^3/(2*3) + x^4/(2*3*4) +...
                         *
                         * n is the current term number.
                         * 
                         * The gamma_helper array contains a table of
                         * ln(x/256) * 256
                         * This is used because a^b = exp(b*ln(a))
                         *
                         * In this case:
                         * a is i / 256
                         * b is gamma.
                         *
                         * Note that everything is scaled by 256 for accuracy,
                         * plus another factor of 256 for the final result to
                         * be from 0-255.  Thus gamma_helper[] * gamma must be
                         * divided by 256*256 each itteration, to get back to
                         * the original power series.
                         */
                        diff = (((diff / 256) * gamma_helper[i]) * (gamma - 256)) / (256 * n);
                }
                
                /* 
                 * Store the value in the table so that the
                 * floating point pow function isn't needed .
                 */
                gamma_table[i] = ((long)(value / 256) * i) / 256;
        }
}

#endif /* SUPPORT_GAMMA */


/*
 * Add a series of keypresses to the "queue".
 *
 * Return any errors generated by Term_keypress() in doing so, or SUCCESS
 * if there are none.
 *
 * Catch the "out of space" error before anything is printed.
 *
 * NB: The keys added here will be interpreted by any macros or keymaps.
 */
errr type_string(cptr str, uint len)
{
        errr err = 0;
        cptr s;

        term *old = Term;

        /* Paranoia - no string. */
        if (!str) return -1;

        /* Hack - calculate the string length here if none given. */
        if (!len) len = strlen(str);

        /* Activate the main window, as all pastes go there. */
        Term_activate(term_screen);

        for (s = str; s < str+len; s++)
        {
                /* Catch end of string */
                if (*s == '\0') break;

                err = Term_keypress(*s);

                /* Catch errors */
                if (err) break;
        }

        /* Activate the original window. */
        Term_activate(old);

        return err;
}



void roff_to_buf(cptr str, int maxlen, char *tbuf, size_t bufsize)
{
        int read_pt = 0;
        int write_pt = 0;
        int line_len = 0;
        int word_punct = 0;
        char ch[3];
        ch[2] = '\0';

        while (str[read_pt])
        {
#ifdef JP
                bool kinsoku = FALSE;
                bool kanji;
#endif
                int ch_len = 1;

                /* Prepare one character */
                ch[0] = str[read_pt];
                ch[1] = '\0';
#ifdef JP
                kanji  = iskanji(ch[0]);

                if (kanji)
                {
                        ch[1] = str[read_pt+1];
                        ch_len = 2;

                        if (strcmp(ch, "¡£") == 0 ||
                            strcmp(ch, "¡¢") == 0 ||
                            strcmp(ch, "¥£") == 0 ||
                            strcmp(ch, "¡¼") == 0)
                                kinsoku = TRUE;
                }
                else if (!isprint(ch[0]))
                        ch[0] = ' ';
#else
                if (!isprint(ch[0]))
                        ch[0] = ' ';
#endif

                if (line_len + ch_len > maxlen - 1 || str[read_pt] == '\n')
                {
                        int word_len;

                        /* return to better wrapping point. */
                        /* Space character at the end of the line need not to be printed. */
                        word_len = read_pt - word_punct;
#ifdef JP
                        if (kanji && !kinsoku)
                                /* nothing */ ;
                        else
#endif
                        if (ch[0] == ' ' || word_len >= line_len/2)
                                read_pt++;
                        else
                        {
                                read_pt = word_punct;
                                if (str[word_punct] == ' ')
                                        read_pt++;
                                write_pt -= word_len;
                        }

                        tbuf[write_pt++] = '\0';
                        line_len = 0;
                        word_punct = read_pt;
                        continue;
                }
                if (ch[0] == ' ')
                        word_punct = read_pt;
#ifdef JP
                if (!kinsoku) word_punct = read_pt;
#endif

                /* Not enough buffer size */
                if ((size_t)(write_pt + 3) >= bufsize) break;

                tbuf[write_pt++] = ch[0];
                line_len++;
                read_pt++;
#ifdef JP
                if (kanji)
                {
                        tbuf[write_pt++] = ch[1];
                        line_len++;
                        read_pt++;
                }
#endif
        }
        tbuf[write_pt] = '\0';
        tbuf[write_pt+1] = '\0';

        return;
}


/*
 * The my_strcpy() function copies up to 'bufsize'-1 characters from 'src'
 * to 'buf' and NUL-terminates the result.  The 'buf' and 'src' strings may
 * not overlap.
 *
 * my_strcpy() returns strlen(src).  This makes checking for truncation
 * easy.  Example: if (my_strcpy(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
 *
 * This function should be equivalent to the strlcpy() function in BSD.
 */
size_t my_strcpy(char *buf, const char *src, size_t bufsize)
{
#ifdef JP

        char *d = buf;
        const char *s = src;
        size_t len = 0;

        /* reserve for NUL termination */
        bufsize--;

        /* Copy as many bytes as will fit */
        while (len < bufsize)
        {
                if (iskanji(*s))
                {
                        if (len + 1 >= bufsize || !*(s+1)) break;
                        *d++ = *s++;
                        *d++ = *s++;
                        len += 2;
                }
                else
                {
                        *d++ = *s++;
                        len++;
                }
        }
        *d = '\0';
        while(*s++) len++;

        return len;

#else

        size_t len = strlen(src);
        size_t ret = len;

        /* Paranoia */
        if (bufsize == 0) return ret;

        /* Truncate */
        if (len >= bufsize) len = bufsize - 1;

        /* Copy the string and terminate it */
        (void)memcpy(buf, src, len);
        buf[len] = '\0';

        /* Return strlen(src) */
        return ret;

#endif
}


/*
 * The my_strcat() tries to append a string to an existing NUL-terminated string.
 * It never writes more characters into the buffer than indicated by 'bufsize' and
 * NUL-terminates the buffer.  The 'buf' and 'src' strings may not overlap.
 *
 * my_strcat() returns strlen(buf) + strlen(src).  This makes checking for
 * truncation easy.  Example:
 * if (my_strcat(buf, src, sizeof(buf)) >= sizeof(buf)) ...;
 *
 * This function should be equivalent to the strlcat() function in BSD.
 */
size_t my_strcat(char *buf, const char *src, size_t bufsize)
{
        size_t dlen = strlen(buf);

        /* Is there room left in the buffer? */
        if (dlen < bufsize - 1)
        {
                /* Append as much as possible  */
                return (dlen + my_strcpy(buf + dlen, src, bufsize - dlen));
        }
        else
        {
                /* Return without appending */
                return (dlen + strlen(src));
        }
}