2001-01-21 15:25:46 +00:00
|
|
|
/* $FreeBSD$ */
|
2003-08-11 15:49:47 +00:00
|
|
|
/* $KAME: advcap.c,v 1.11 2003/05/19 09:46:50 keiichi Exp $ */
|
2000-07-05 22:09:50 +00:00
|
|
|
|
2017-11-20 19:49:47 +00:00
|
|
|
/*-
|
|
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
*
|
2000-01-06 12:40:54 +00:00
|
|
|
* Copyright (c) 1983 The Regents of the University of California.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* 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.
|
2017-02-28 23:42:47 +00:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
2000-01-06 12:40:54 +00:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* remcap - routines for dealing with the remote host data base
|
|
|
|
*
|
|
|
|
* derived from termcap
|
|
|
|
*/
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/uio.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <syslog.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include "pathnames.h"
|
|
|
|
|
|
|
|
#ifndef BUFSIZ
|
|
|
|
#define BUFSIZ 1024
|
|
|
|
#endif
|
|
|
|
#define MAXHOP 32 /* max number of tc= indirections */
|
|
|
|
|
|
|
|
#define tgetent agetent
|
|
|
|
#define tnchktc anchktc
|
|
|
|
#define tnamatch anamatch
|
|
|
|
#define tgetnum agetnum
|
|
|
|
#define tgetflag agetflag
|
|
|
|
#define tgetstr agetstr
|
|
|
|
|
2000-07-05 22:09:50 +00:00
|
|
|
#if 0
|
|
|
|
#define V_TERMCAP "REMOTE"
|
|
|
|
#define V_TERM "HOST"
|
|
|
|
#endif
|
|
|
|
|
2000-01-06 12:40:54 +00:00
|
|
|
/*
|
|
|
|
* termcap - routines for dealing with the terminal capability data base
|
|
|
|
*
|
|
|
|
* BUG: Should use a "last" pointer in tbuf, so that searching
|
|
|
|
* for capabilities alphabetically would not be a n**2/2
|
|
|
|
* process when large numbers of capabilities are given.
|
|
|
|
* Note: If we add a last pointer now we will screw up the
|
|
|
|
* tc capability. We really should compile termcap.
|
|
|
|
*
|
|
|
|
* Essentially all the work here is scanning and decoding escapes
|
|
|
|
* in string capabilities. We don't use stdio because the editor
|
|
|
|
* doesn't, and because living w/o it is not hard.
|
|
|
|
*/
|
|
|
|
|
2000-07-05 22:09:50 +00:00
|
|
|
static char *tbuf;
|
|
|
|
static int hopcount; /* detect infinite loops in termcap, init 0 */
|
2000-01-06 12:40:54 +00:00
|
|
|
|
2011-06-06 03:06:43 +00:00
|
|
|
extern const char *conffile;
|
2000-01-06 12:40:54 +00:00
|
|
|
|
2007-11-07 10:53:41 +00:00
|
|
|
int tgetent(char *, char *);
|
2011-06-06 03:06:43 +00:00
|
|
|
int getent(char *, char *, const char *);
|
2007-11-07 10:53:41 +00:00
|
|
|
int tnchktc(void);
|
|
|
|
int tnamatch(char *);
|
|
|
|
static char *tskip(char *);
|
|
|
|
int64_t tgetnum(char *);
|
|
|
|
int tgetflag(char *);
|
|
|
|
char *tgetstr(char *, char **);
|
|
|
|
static char *tdecode(char *, char **);
|
2000-01-06 12:40:54 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Get an entry for terminal name in buffer bp,
|
|
|
|
* from the termcap file. Parse is very rudimentary;
|
|
|
|
* we just notice escaped newlines.
|
|
|
|
*/
|
|
|
|
int
|
2011-06-06 03:06:43 +00:00
|
|
|
tgetent(char *bp, char *name)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2011-06-06 03:06:43 +00:00
|
|
|
return (getent(bp, name, conffile));
|
2000-01-06 12:40:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2011-06-06 03:06:43 +00:00
|
|
|
getent(char *bp, char *name, const char *cfile)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-08 16:47:06 +00:00
|
|
|
int c;
|
|
|
|
int i = 0, cnt = 0;
|
2000-01-06 12:40:54 +00:00
|
|
|
char ibuf[BUFSIZ];
|
2011-06-06 03:06:43 +00:00
|
|
|
char *cp;
|
2000-01-06 12:40:54 +00:00
|
|
|
int tf;
|
|
|
|
|
|
|
|
tbuf = bp;
|
|
|
|
tf = 0;
|
|
|
|
/*
|
|
|
|
* TERMCAP can have one of two things in it. It can be the
|
|
|
|
* name of a file to use instead of /etc/termcap. In this
|
|
|
|
* case it better start with a "/". Or it can be an entry to
|
|
|
|
* use so we don't have to read the file. In this case it
|
|
|
|
* has to already have the newlines crunched out.
|
|
|
|
*/
|
2011-06-06 03:06:43 +00:00
|
|
|
if (cfile && *cfile)
|
|
|
|
tf = open(cfile, O_RDONLY);
|
|
|
|
|
2000-01-06 12:40:54 +00:00
|
|
|
if (tf < 0) {
|
2000-07-05 22:09:50 +00:00
|
|
|
syslog(LOG_INFO,
|
2003-08-08 16:38:23 +00:00
|
|
|
"<%s> open: %s", __func__, strerror(errno));
|
2000-01-06 12:40:54 +00:00
|
|
|
return (-2);
|
|
|
|
}
|
|
|
|
for (;;) {
|
|
|
|
cp = bp;
|
|
|
|
for (;;) {
|
|
|
|
if (i == cnt) {
|
|
|
|
cnt = read(tf, ibuf, BUFSIZ);
|
|
|
|
if (cnt <= 0) {
|
|
|
|
close(tf);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
i = 0;
|
|
|
|
}
|
|
|
|
c = ibuf[i++];
|
|
|
|
if (c == '\n') {
|
|
|
|
if (cp > bp && cp[-1] == '\\') {
|
|
|
|
cp--;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2014-10-11 23:08:00 +00:00
|
|
|
if (cp >= bp + BUFSIZ - 1) {
|
2001-07-26 11:02:39 +00:00
|
|
|
write(STDERR_FILENO, "Remcap entry too long\n",
|
2014-10-11 23:08:00 +00:00
|
|
|
22);
|
2000-01-06 12:40:54 +00:00
|
|
|
break;
|
|
|
|
} else
|
|
|
|
*cp++ = c;
|
|
|
|
}
|
|
|
|
*cp = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The real work for the match.
|
|
|
|
*/
|
|
|
|
if (tnamatch(name)) {
|
|
|
|
close(tf);
|
|
|
|
return (tnchktc());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* tnchktc: check the last entry, see if it's tc=xxx. If so,
|
|
|
|
* recursively find xxx and append that entry (minus the names)
|
|
|
|
* to take the place of the tc=xxx entry. This allows termcap
|
|
|
|
* entries to say "like an HP2621 but doesn't turn on the labels".
|
|
|
|
* Note that this works because of the left to right scan.
|
|
|
|
*/
|
|
|
|
int
|
2011-06-06 03:06:43 +00:00
|
|
|
tnchktc(void)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-08 16:47:06 +00:00
|
|
|
char *p, *q;
|
2000-01-06 12:40:54 +00:00
|
|
|
char tcname[16]; /* name of similar terminal */
|
|
|
|
char tcbuf[BUFSIZ];
|
|
|
|
char *holdtbuf = tbuf;
|
|
|
|
int l;
|
|
|
|
|
|
|
|
p = tbuf + strlen(tbuf) - 2; /* before the last colon */
|
|
|
|
while (*--p != ':')
|
2003-08-08 16:56:01 +00:00
|
|
|
if (p < tbuf) {
|
2001-07-26 11:02:39 +00:00
|
|
|
write(STDERR_FILENO, "Bad remcap entry\n", 18);
|
2000-01-06 12:40:54 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
p++;
|
|
|
|
/* p now points to beginning of last field */
|
|
|
|
if (p[0] != 't' || p[1] != 'c')
|
|
|
|
return (1);
|
2003-08-11 15:49:47 +00:00
|
|
|
strlcpy(tcname, p + 3, sizeof tcname);
|
2000-01-06 12:40:54 +00:00
|
|
|
q = tcname;
|
|
|
|
while (*q && *q != ':')
|
|
|
|
q++;
|
|
|
|
*q = 0;
|
|
|
|
if (++hopcount > MAXHOP) {
|
2001-07-26 11:02:39 +00:00
|
|
|
write(STDERR_FILENO, "Infinite tc= loop\n", 18);
|
2000-01-06 12:40:54 +00:00
|
|
|
return (0);
|
|
|
|
}
|
2011-06-07 15:40:17 +00:00
|
|
|
if (getent(tcbuf, tcname, conffile) != 1) {
|
2000-01-06 12:40:54 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
for (q = tcbuf; *q++ != ':'; )
|
|
|
|
;
|
|
|
|
l = p - holdtbuf + strlen(q);
|
|
|
|
if (l > BUFSIZ) {
|
2001-07-26 11:02:39 +00:00
|
|
|
write(STDERR_FILENO, "Remcap entry too long\n", 23);
|
2000-01-06 12:40:54 +00:00
|
|
|
q[BUFSIZ - (p-holdtbuf)] = 0;
|
|
|
|
}
|
|
|
|
strcpy(p, q);
|
|
|
|
tbuf = holdtbuf;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Tnamatch deals with name matching. The first field of the termcap
|
|
|
|
* entry is a sequence of names separated by |'s, so we compare
|
|
|
|
* against each such name. The normal : terminator after the last
|
|
|
|
* name (before the first field) stops us.
|
|
|
|
*/
|
|
|
|
int
|
2011-06-06 03:06:43 +00:00
|
|
|
tnamatch(char *np)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-08 16:47:06 +00:00
|
|
|
char *Np, *Bp;
|
2000-01-06 12:40:54 +00:00
|
|
|
|
|
|
|
Bp = tbuf;
|
|
|
|
if (*Bp == '#')
|
|
|
|
return (0);
|
|
|
|
for (;;) {
|
|
|
|
for (Np = np; *Np && *Bp == *Np; Bp++, Np++)
|
|
|
|
continue;
|
|
|
|
if (*Np == 0 && (*Bp == '|' || *Bp == ':' || *Bp == 0))
|
|
|
|
return (1);
|
|
|
|
while (*Bp && *Bp != ':' && *Bp != '|')
|
|
|
|
Bp++;
|
|
|
|
if (*Bp == 0 || *Bp == ':')
|
|
|
|
return (0);
|
|
|
|
Bp++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Skip to the next field. Notice that this is very dumb, not
|
|
|
|
* knowing about \: escapes or any such. If necessary, :'s can be put
|
|
|
|
* into the termcap file in octal.
|
|
|
|
*/
|
|
|
|
static char *
|
2011-06-06 03:06:43 +00:00
|
|
|
tskip(char *bp)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
|
|
|
int dquote;
|
|
|
|
|
|
|
|
dquote = 0;
|
|
|
|
while (*bp) {
|
|
|
|
switch (*bp) {
|
|
|
|
case ':':
|
|
|
|
if (!dquote)
|
|
|
|
goto breakbreak;
|
|
|
|
else
|
|
|
|
bp++;
|
|
|
|
break;
|
|
|
|
case '\\':
|
|
|
|
bp++;
|
|
|
|
if (isdigit(*bp)) {
|
|
|
|
while (isdigit(*bp++))
|
|
|
|
;
|
|
|
|
} else
|
|
|
|
bp++;
|
|
|
|
case '"':
|
|
|
|
dquote = (dquote ? 1 : 0);
|
|
|
|
bp++;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
bp++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
breakbreak:
|
|
|
|
if (*bp == ':')
|
|
|
|
bp++;
|
|
|
|
return (bp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the (numeric) option id.
|
|
|
|
* Numeric options look like
|
|
|
|
* li#80
|
|
|
|
* i.e. the option string is separated from the numeric value by
|
|
|
|
* a # character. If the option is not found we return -1.
|
|
|
|
* Note that we handle octal numbers beginning with 0.
|
|
|
|
*/
|
2003-08-11 15:46:37 +00:00
|
|
|
int64_t
|
2011-06-06 03:06:43 +00:00
|
|
|
tgetnum(char *id)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-11 15:46:37 +00:00
|
|
|
int64_t i;
|
2003-08-08 16:47:06 +00:00
|
|
|
int base;
|
|
|
|
char *bp = tbuf;
|
2000-01-06 12:40:54 +00:00
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
bp = tskip(bp);
|
|
|
|
if (*bp == 0)
|
|
|
|
return (-1);
|
|
|
|
if (strncmp(bp, id, strlen(id)) != 0)
|
|
|
|
continue;
|
|
|
|
bp += strlen(id);
|
|
|
|
if (*bp == '@')
|
|
|
|
return (-1);
|
|
|
|
if (*bp != '#')
|
|
|
|
continue;
|
|
|
|
bp++;
|
|
|
|
base = 10;
|
|
|
|
if (*bp == '0')
|
|
|
|
base = 8;
|
|
|
|
i = 0;
|
|
|
|
while (isdigit(*bp))
|
|
|
|
i *= base, i += *bp++ - '0';
|
|
|
|
return (i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle a flag option.
|
|
|
|
* Flag options are given "naked", i.e. followed by a : or the end
|
|
|
|
* of the buffer. Return 1 if we find the option, or 0 if it is
|
|
|
|
* not given.
|
|
|
|
*/
|
|
|
|
int
|
2011-06-06 03:06:43 +00:00
|
|
|
tgetflag(char *id)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-08 16:47:06 +00:00
|
|
|
char *bp = tbuf;
|
2000-01-06 12:40:54 +00:00
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
bp = tskip(bp);
|
|
|
|
if (!*bp)
|
|
|
|
return (0);
|
|
|
|
if (strncmp(bp, id, strlen(id)) == 0) {
|
|
|
|
bp += strlen(id);
|
|
|
|
if (!*bp || *bp == ':')
|
|
|
|
return (1);
|
|
|
|
else if (*bp == '@')
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get a string valued option.
|
|
|
|
* These are given as
|
|
|
|
* cl=^Z
|
|
|
|
* Much decoding is done on the strings, and the strings are
|
|
|
|
* placed in area, which is a ref parameter which is updated.
|
|
|
|
* No checking on area overflow.
|
|
|
|
*/
|
|
|
|
char *
|
2011-06-06 03:06:43 +00:00
|
|
|
tgetstr(char *id, char **area)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-08 16:47:06 +00:00
|
|
|
char *bp = tbuf;
|
2000-01-06 12:40:54 +00:00
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
bp = tskip(bp);
|
|
|
|
if (!*bp)
|
|
|
|
return (0);
|
|
|
|
if (strncmp(bp, id, strlen(id)) != 0)
|
|
|
|
continue;
|
|
|
|
bp += strlen(id);
|
|
|
|
if (*bp == '@')
|
|
|
|
return (0);
|
|
|
|
if (*bp != '=')
|
|
|
|
continue;
|
|
|
|
bp++;
|
|
|
|
return (tdecode(bp, area));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Tdecode does the grung work to decode the
|
|
|
|
* string capability escapes.
|
|
|
|
*/
|
|
|
|
static char *
|
2011-06-06 03:06:43 +00:00
|
|
|
tdecode(char *str, char **area)
|
2000-01-06 12:40:54 +00:00
|
|
|
{
|
2003-08-08 16:47:06 +00:00
|
|
|
char *cp;
|
|
|
|
int c;
|
2011-06-06 03:06:43 +00:00
|
|
|
const char *dp;
|
2000-01-06 12:40:54 +00:00
|
|
|
int i;
|
|
|
|
char term;
|
|
|
|
|
|
|
|
term = ':';
|
|
|
|
cp = *area;
|
|
|
|
again:
|
|
|
|
if (*str == '"') {
|
|
|
|
term = '"';
|
|
|
|
str++;
|
|
|
|
}
|
|
|
|
while ((c = *str++) && c != term) {
|
|
|
|
switch (c) {
|
|
|
|
|
|
|
|
case '^':
|
|
|
|
c = *str++ & 037;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\\':
|
|
|
|
dp = "E\033^^\\\\::n\nr\rt\tb\bf\f\"\"";
|
|
|
|
c = *str++;
|
|
|
|
nextc:
|
|
|
|
if (*dp++ == c) {
|
|
|
|
c = *dp++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
dp++;
|
|
|
|
if (*dp)
|
|
|
|
goto nextc;
|
|
|
|
if (isdigit(c)) {
|
|
|
|
c -= '0', i = 2;
|
|
|
|
do
|
|
|
|
c <<= 3, c |= *str++ - '0';
|
|
|
|
while (--i && isdigit(*str));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
*cp++ = c;
|
|
|
|
}
|
|
|
|
if (c == term && term != ':') {
|
|
|
|
term = ':';
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
*cp++ = 0;
|
|
|
|
str = *area;
|
|
|
|
*area = cp;
|
|
|
|
return (str);
|
|
|
|
}
|