NetBSD/lib/libterm/tgoto.c

299 lines
8.2 KiB
C
Raw Normal View History

/* $NetBSD: tgoto.c,v 1.15 1999/09/16 11:45:49 lukem Exp $ */
1993-03-21 12:45:37 +03:00
/*
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* 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 developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 THE REGENTS OR CONTRIBUTORS 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.
*/
1997-10-09 15:58:15 +04:00
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
#if 0
static char sccsid[] = "@(#)tgoto.c 8.1 (Berkeley) 6/4/93";
#else
__RCSID("$NetBSD: tgoto.c,v 1.15 1999/09/16 11:45:49 lukem Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
#include <errno.h>
1994-10-19 05:57:11 +03:00
#include <string.h>
#include <termcap.h>
1994-10-19 05:57:11 +03:00
1993-03-21 12:45:37 +03:00
#define CTRL(c) ((c) & 037)
#define MAXRETURNSIZE 64
char *UP;
char *BC;
/*
* Routine to perform cursor addressing.
* CM is a string containing printf type escapes to allow
* cursor addressing. We start out ready to print the destination
* line, and switch each time we print row or column.
* The following escapes are defined for substituting row/column:
*
* %d as in printf
* %2 like %2d
* %3 like %3d
* %. gives %c hacking special case characters
* %+x like %c but adding x first
*
* The codes below affect the state but don't use up a value.
*
* %>xy if value > x add y
* %r reverses row/column
* %i increments row/column (for one origin indexing)
* %% gives %
* %B BCD (2 decimal digits encoded in one byte)
* %D Delta Data (backwards bcd)
*
* all other characters are ``self-inserting''.
*/
char *
tgoto(CM, destcol, destline)
1998-07-27 05:55:23 +04:00
const char *CM;
1993-03-21 12:45:37 +03:00
int destcol, destline;
{
static char result[MAXRETURNSIZE];
if (t_goto(NULL, CM, destcol, destline, result, MAXRETURNSIZE) >= 0)
return result;
else
return ("OOPS");
}
/*
* New interface. Functionally the same as tgoto but uses the tinfo struct
* to set UP and BC. The arg buffer is filled with the result string, limit
* defines the maximum number of chars allowed in buffer. The function
* returns 0 on success, -1 otherwise.
*/
int
t_goto(info, CM, destcol, destline, buffer, limit)
struct tinfo *info;
const char *CM;
int destcol;
int destline;
char *buffer;
size_t limit;
{
1993-03-21 12:45:37 +03:00
static char added[10];
1998-07-27 05:55:23 +04:00
const char *cp = CM;
char *dp = buffer;
char *old_up = UP, *old_bc = BC;
char new_up[MAXRETURNSIZE], new_bc[MAXRETURNSIZE], *up_ptr, *bc_ptr;
int c;
size_t count = MAXRETURNSIZE;
1993-03-21 12:45:37 +03:00
int oncol = 0;
int which = destline;
1993-03-21 12:45:37 +03:00
/* CM is checked below */
if (info != NULL)
{
up_ptr = new_up;
bc_ptr = new_bc;
UP = t_getstr(info, "up", &up_ptr, &count);
count = MAXRETURNSIZE;
BC = t_getstr(info, "bc", &bc_ptr, &count);
}
1993-03-21 12:45:37 +03:00
if (cp == 0) {
errno = EINVAL;
1993-03-21 12:45:37 +03:00
toohard:
UP = old_up;
BC = old_bc;
return -1;
1993-03-21 12:45:37 +03:00
}
added[0] = '\0';
1995-06-05 23:45:48 +04:00
while ((c = *cp++) != '\0') {
1993-03-21 12:45:37 +03:00
if (c != '%') {
copy:
1993-03-21 12:45:37 +03:00
*dp++ = c;
if (dp >= &buffer[limit])
{
errno = E2BIG;
goto toohard;
}
1993-03-21 12:45:37 +03:00
continue;
}
switch (c = *cp++) {
#ifdef CM_N
case 'n':
destcol ^= 0140;
destline ^= 0140;
goto setwhich;
#endif
case 'd':
if (which < 10)
goto one;
if (which < 100)
goto two;
/* FALLTHROUGH */
1993-03-21 12:45:37 +03:00
case '3':
if (which >= 1000) {
errno = E2BIG;
goto toohard;
}
*dp++ = (which / 100) | '0';
if (dp >= &buffer[limit]) {
errno = E2BIG;
goto toohard;
}
1993-03-21 12:45:37 +03:00
which %= 100;
/* FALLTHROUGH */
1993-03-21 12:45:37 +03:00
case '2':
1999-07-02 19:46:05 +04:00
two:
1993-03-21 12:45:37 +03:00
*dp++ = which / 10 | '0';
if (dp >= &buffer[limit]) {
errno = E2BIG;
goto toohard;
}
1993-03-21 12:45:37 +03:00
one:
*dp++ = which % 10 | '0';
if (dp >= &buffer[limit]) {
errno = E2BIG;
goto toohard;
}
1993-03-21 12:45:37 +03:00
swap:
oncol = 1 - oncol;
setwhich:
which = oncol ? destcol : destline;
continue;
#ifdef CM_GT
case '>':
if (which > *cp++)
which += *cp++;
else
cp++;
continue;
#endif
case '+':
which += *cp++;
/* FALLTHROUGH */
1993-03-21 12:45:37 +03:00
case '.':
/*
* This code is worth scratching your head at for a
* while. The idea is that various weird things can
* happen to nulls, EOT's, tabs, and newlines by the
* tty driver, arpanet, and so on, so we don't send
* them if we can help it.
*
* Tab is taken out to get Ann Arbors to work, otherwise
* when they go to column 9 we increment which is wrong
* because bcd isn't continuous. We should take out
* the rest too, or run the thing through more than
* once until it doesn't make any of these, but that
* would make termlib (and hence pdp-11 ex) bigger,
* and also somewhat slower. This requires all
* programs which use termlib to stty tabs so they
* don't get expanded. They should do this anyway
* because some terminals use ^I for other things,
* like nondestructive space.
*/
if (which == 0 || which == CTRL('d') || /* which == '\t' || */ which == '\n') {
if (oncol || UP) { /* Assumption: backspace works */
char *add = oncol ? (BC ? BC : "\b") : UP;
1993-03-21 12:45:37 +03:00
/*
* Loop needed because newline happens
* to be the successor of tab.
*/
do {
if (strlen(added) + strlen(add) >= sizeof(added))
{
errno = E2BIG;
goto toohard;
}
(void)strcat(added, add);
1993-03-21 12:45:37 +03:00
which++;
} while (which == '\n');
}
1993-03-21 12:45:37 +03:00
}
*dp++ = which;
if (dp >= &buffer[limit])
{
errno = E2BIG;
goto toohard;
}
1993-03-21 12:45:37 +03:00
goto swap;
case 'r':
oncol = 1;
goto setwhich;
case 'i':
destcol++;
destline++;
which++;
continue;
case '%':
goto copy;
1993-03-21 12:45:37 +03:00
#ifdef CM_B
case 'B':
which = (which/10 << 4) + which%10;
continue;
#endif
#ifdef CM_D
case 'D':
which = which - 2 * (which%16);
continue;
#endif
default:
errno = EINVAL;
goto toohard;
1993-03-21 12:45:37 +03:00
}
}
if (dp + strlen(added) >= &buffer[limit])
{
errno = E2BIG;
goto toohard;
}
(void)strcpy(dp, added);
UP = old_up;
BC = old_bc;
return 0;
1993-03-21 12:45:37 +03:00
}