381 lines
8.7 KiB
Modula-2
381 lines
8.7 KiB
Modula-2
/* $NetBSD: msg_sys.def,v 1.17 1999/07/04 22:55:48 cgd Exp $ */
|
|
|
|
/*
|
|
* Copyright 1997 Piermont Information Systems Inc.
|
|
* All rights reserved.
|
|
*
|
|
* Written by Philip A. Nelson for Piermont Information Systems Inc.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software develooped for the NetBSD Project by
|
|
* Piermont Information Systems Inc.
|
|
* 4. The name of Piermont Information Systems Inc. may not be used to endorse
|
|
* or promote products derived from this software without specific prior
|
|
* written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY PIERMONT INFORMATION SYSTEMS INC. ``AS IS''
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL PIERMONT INFORMATION SYSTEMS INC. BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
|
* THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
*/
|
|
|
|
static WINDOW *msg_win = NULL;
|
|
static char *cbuffer;
|
|
static size_t cbuffersize;
|
|
|
|
static int last_i_was_nl, last_i_was_space;
|
|
static int last_o_was_punct, last_o_was_space;
|
|
|
|
static void _msg_beep(void);
|
|
static int _msg_vprintf(int auto_fill, const char *fmt, va_list ap);
|
|
static void _msg_vprompt(const char *msg, int do_echo, const char *def,
|
|
char *val, int max_chars, va_list ap);
|
|
|
|
/* Routines */
|
|
|
|
static void
|
|
_msg_beep(void)
|
|
{
|
|
fprintf(stderr, "\a");
|
|
}
|
|
|
|
int msg_window(WINDOW *window)
|
|
{
|
|
size_t ncbuffersize;
|
|
char *ncbuffer;
|
|
|
|
msg_win = window;
|
|
|
|
ncbuffersize = getmaxx(window) * getmaxy(window) + 1;
|
|
if (ncbuffersize > cbuffersize) {
|
|
ncbuffer = malloc(ncbuffersize);
|
|
if (ncbuffer == NULL)
|
|
return 1;
|
|
if (cbuffer != NULL)
|
|
free(cbuffer);
|
|
cbuffer = ncbuffer;
|
|
cbuffersize = ncbuffersize;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
const char *msg_string (msg msg_no)
|
|
{
|
|
return msg_list[(long)msg_no];
|
|
}
|
|
|
|
void msg_clear(void)
|
|
{
|
|
wclear (msg_win);
|
|
wrefresh (msg_win);
|
|
last_o_was_punct = 0;
|
|
last_o_was_space = 1;
|
|
}
|
|
|
|
void msg_standout(void)
|
|
{
|
|
wstandout(msg_win);
|
|
}
|
|
|
|
void msg_standend(void)
|
|
{
|
|
wstandend(msg_win);
|
|
}
|
|
|
|
static int
|
|
_msg_vprintf(int auto_fill, const char *fmt, va_list ap)
|
|
{
|
|
const char *wstart, *afterw;
|
|
int wordlen, nspaces;
|
|
int ret;
|
|
|
|
ret = vsnprintf (cbuffer, cbuffersize, fmt, ap);
|
|
|
|
if (!auto_fill) {
|
|
waddstr(msg_win, cbuffer);
|
|
|
|
/*
|
|
* nothing is perfect if they flow text after a table,
|
|
* but this may be decent.
|
|
*/
|
|
last_i_was_nl = last_i_was_space = 1;
|
|
last_o_was_punct = 0;
|
|
last_o_was_space = 1;
|
|
goto out;
|
|
}
|
|
|
|
for (wstart = afterw = cbuffer; *wstart; wstart = afterw) {
|
|
|
|
/* eat one space, or a whole word of non-spaces */
|
|
if (isspace(*afterw))
|
|
afterw++;
|
|
else
|
|
while (*afterw && !isspace(*afterw))
|
|
afterw++;
|
|
|
|
/* this is an nl: special formatting necessary */
|
|
if (*wstart == '\n') {
|
|
if (last_i_was_nl || last_i_was_space) {
|
|
|
|
if (getcurx(msg_win) != 0)
|
|
waddch(msg_win, '\n');
|
|
if (last_i_was_nl) {
|
|
/* last was an nl: paragraph break */
|
|
waddch(msg_win, '\n');
|
|
} else {
|
|
/* last was space: line break */
|
|
}
|
|
last_o_was_punct = 0;
|
|
last_o_was_space = 1;
|
|
} else {
|
|
/* last_o_was_punct unchanged */
|
|
/* last_o_was_space unchanged */
|
|
}
|
|
last_i_was_space = 1;
|
|
last_i_was_nl = 1;
|
|
continue;
|
|
}
|
|
|
|
/* this is a tab: special formatting necessary. */
|
|
if (*wstart == '\t') {
|
|
if (last_i_was_nl) {
|
|
/* last was an nl: list indent */
|
|
if (getcurx(msg_win) != 0)
|
|
waddch(msg_win, '\n');
|
|
} else {
|
|
/* last was not an nl: columns */
|
|
}
|
|
waddch(msg_win, '\t');
|
|
last_i_was_nl = 0;
|
|
last_i_was_space = 1;
|
|
last_o_was_punct = 0;
|
|
last_o_was_space = 1;
|
|
continue;
|
|
}
|
|
|
|
/* this is a space: ignore it but set flags */
|
|
last_i_was_nl = 0; /* all newlines handled above */
|
|
last_i_was_space = isspace(*wstart);
|
|
if (last_i_was_space)
|
|
continue;
|
|
|
|
/*
|
|
* we have a real "word," i.e. a sequence of non-space
|
|
* characters. wstart is now the start of the word,
|
|
* afterw is the next character after the end.
|
|
*/
|
|
wordlen = afterw - wstart;
|
|
nspaces = last_o_was_space ? 0 : (last_o_was_punct ? 2 : 1);
|
|
if ((getcurx(msg_win) + nspaces + wordlen) >=
|
|
getmaxx(msg_win) &&
|
|
wordlen < (getmaxx(msg_win) / 3)) {
|
|
/* wrap the line */
|
|
waddch(msg_win, '\n');
|
|
nspaces = 0;
|
|
}
|
|
|
|
/* output the word, preceded by spaces if necessary */
|
|
while (nspaces-- > 0)
|
|
waddch(msg_win, ' ');
|
|
waddbytes(msg_win, wstart, wordlen);
|
|
|
|
/* set up the 'last' state for the next time around */
|
|
switch (afterw[-1]) {
|
|
case '.':
|
|
case '?':
|
|
case '!':
|
|
last_o_was_punct = 1;
|
|
break;
|
|
default:
|
|
last_o_was_punct = 0;
|
|
break;
|
|
}
|
|
last_o_was_space = 0;
|
|
|
|
/* ... and do it all again! */
|
|
}
|
|
|
|
/* String ended with a newline. They really want a line break. */
|
|
if (last_i_was_nl) {
|
|
if (getcurx(msg_win) != 0)
|
|
waddch(msg_win, '\n');
|
|
last_o_was_punct = 0;
|
|
last_o_was_space = 1;
|
|
}
|
|
|
|
out:
|
|
wrefresh (msg_win);
|
|
return ret;
|
|
}
|
|
|
|
void msg_display(msg msg_no, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
msg_clear();
|
|
|
|
va_start(ap, msg_no);
|
|
(void)_msg_vprintf(1, msg_string(msg_no), ap);
|
|
va_end(ap);
|
|
}
|
|
|
|
void msg_display_add(msg msg_no, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
va_start (ap, msg_no);
|
|
(void)_msg_vprintf(1, msg_string(msg_no), ap);
|
|
va_end (ap);
|
|
}
|
|
|
|
|
|
static void
|
|
_msg_vprompt(const char *msg, int do_echo, const char *def, char *val,
|
|
int max_chars, va_list ap)
|
|
{
|
|
int ch;
|
|
int count = 0;
|
|
int y,x;
|
|
char *ibuf = alloca(max_chars);
|
|
|
|
_msg_vprintf(0, msg, ap);
|
|
if (def != NULL && *def) {
|
|
waddstr (msg_win, " [");
|
|
waddstr (msg_win, def);
|
|
waddstr (msg_win, "]");
|
|
}
|
|
waddstr (msg_win, ": ");
|
|
wrefresh (msg_win);
|
|
|
|
while ((ch = wgetch(msg_win)) != '\n') {
|
|
if (ch == 0x08 || ch == 0x7f) { /* bs or del */
|
|
if (count > 0) {
|
|
count--;
|
|
if (do_echo) {
|
|
getyx(msg_win, y, x);
|
|
x--;
|
|
wmove(msg_win, y, x);
|
|
wdelch(msg_win);
|
|
}
|
|
} else
|
|
_msg_beep();
|
|
} else if (ch == 0x15) { /* ^U; line kill */
|
|
while (count > 0) {
|
|
count--;
|
|
if (do_echo) {
|
|
getyx(msg_win, y, x);
|
|
x--;
|
|
wmove(msg_win, y, x);
|
|
wdelch(msg_win);
|
|
}
|
|
}
|
|
} else if (ch == 0x17) { /* ^W; word kill */
|
|
/*
|
|
* word kill kills the spaces and the 'word'
|
|
* (non-spaces) last typed. the spaces before
|
|
* the 'word' aren't killed.
|
|
*/
|
|
while (count > 0 && isspace(ibuf[count - 1])) {
|
|
count--;
|
|
if (do_echo) {
|
|
getyx(msg_win, y, x);
|
|
x--;
|
|
wmove(msg_win, y, x);
|
|
wdelch(msg_win);
|
|
}
|
|
}
|
|
while (count > 0 && !isspace(ibuf[count - 1])) {
|
|
count--;
|
|
if (do_echo) {
|
|
getyx(msg_win, y, x);
|
|
x--;
|
|
wmove(msg_win, y, x);
|
|
wdelch(msg_win);
|
|
}
|
|
}
|
|
} else if (count < (max_chars - 1) && isprint(ch)) {
|
|
if (do_echo)
|
|
waddch (msg_win, ch);
|
|
ibuf[count++] = ch;
|
|
} else
|
|
_msg_beep();
|
|
if (do_echo)
|
|
wrefresh(msg_win);
|
|
}
|
|
if (do_echo) {
|
|
waddch(msg_win, '\n');
|
|
last_o_was_punct = 0;
|
|
last_o_was_space = 1;
|
|
}
|
|
|
|
/* copy the appropriate string to the output */
|
|
if (count != 0) {
|
|
ibuf[count] = '\0';
|
|
strcpy(val, ibuf); /* size known to be OK */
|
|
} else if (def != NULL && val != def) {
|
|
strncpy(val, def, max_chars);
|
|
val[max_chars - 1] = '\0';
|
|
}
|
|
}
|
|
|
|
void
|
|
msg_prompt(msg msg_no, const char *def, char *val, int max_chars, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
msg_clear();
|
|
|
|
va_start (ap, max_chars);
|
|
_msg_vprompt(msg_string(msg_no), 1, def, val, max_chars, ap);
|
|
va_end (ap);
|
|
}
|
|
|
|
void
|
|
msg_prompt_add(msg msg_no, const char *def, char *val, int max_chars, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
va_start (ap, max_chars);
|
|
_msg_vprompt(msg_string(msg_no), 1, def, val, max_chars, ap);
|
|
va_end(ap);
|
|
}
|
|
|
|
void
|
|
msg_prompt_noecho(msg msg_no, const char *def, char *val, int max_chars, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
msg_clear();
|
|
|
|
va_start (ap, max_chars);
|
|
_msg_vprompt(msg_string(msg_no), 0, def, val, max_chars, ap);
|
|
va_end (ap);
|
|
}
|
|
|
|
void msg_table_add(msg msg_no, ...)
|
|
{
|
|
va_list ap;
|
|
|
|
va_start (ap, msg_no);
|
|
(void)_msg_vprintf(0, msg_string(msg_no), ap);
|
|
va_end (ap);
|
|
}
|
|
|