[unix-history] / usr / src / usr.sbin / lpr / common_source / printcap.c

/*	printcap.c	1.5	83/05/13	*/
/* Copyright (c) 1979 Regents of the University of California */
#define	BUFSIZ	1024
#define MAXHOP	32	/* max number of tc= indirections */

#include <ctype.h>
#include <stdio.h>
/*
 * 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.
 */

#define PRINTCAP

#ifdef PRINTCAP
#define tgetent	pgetent
#define tskip	pskip
#define tgetstr	pgetstr
#define tdecode pdecode
#define tgetnum	pgetnum
#define	tgetflag pgetflag
#define tdecode pdecode
#define tnchktc	pnchktc
#define	tnamatch pnamatch
#undef E_TERMCAP
#define E_TERMCAP "/etc/printcap"
#define V6
#endif

static	FILE *pfp = NULL;	/* printcap data base file pointer */
static	char *tbuf;
static	int hopcount;		/* detect infinite loops in termcap, init 0 */
char	*tskip();
char	*tgetstr();
char	*tdecode();
char	*getenv();

/*
 * Similar to tgetent except it returns the next enrty instead of
 * doing a lookup.
 */
getprent(bp)
	register char *bp;
{
	register int c, skip = 0;

	if (pfp == NULL && (pfp = fopen(E_TERMCAP, "r")) == NULL)
		return(-1);
	tbuf = bp;
	for (;;) {
		switch (c = getc(pfp)) {
		case EOF:
			fclose(pfp);
			pfp = NULL;
			return(0);
		case '\n':
			if (bp == tbuf) {
				skip = 0;
				continue;
			}
			if (bp[-1] == '\\') {
				bp--;
				continue;
			}
			*bp = '\0';
			return(1);
		case '#':
			if (bp == tbuf)
				skip++;
		default:
			if (skip)
				continue;
			if (bp >= tbuf+BUFSIZ) {
				write(2, "Termcap entry too long\n", 23);
				*bp = '\0';
				return(1);
			}
			*bp++ = c;
		}
	}
}

endprent()
{
	if (pfp != NULL)
		fclose(pfp);
}

/*
 * Get an entry for terminal name in buffer bp,
 * from the termcap file.  Parse is very rudimentary;
 * we just notice escaped newlines.
 */
tgetent(bp, name)
	char *bp, *name;
{
	register char *cp;
	register int c;
	register int i = 0, cnt = 0;
	char ibuf[BUFSIZ];
	char *cp2;
	int tf;

	tbuf = bp;
	tf = 0;
#ifndef V6
	cp = getenv("TERMCAP");
	/*
	 * 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.
	 */
	if (cp && *cp) {
		if (*cp!='/') {
			cp2 = getenv("TERM");
			if (cp2==(char *) 0 || strcmp(name,cp2)==0) {
				strcpy(bp,cp);
				return(tnchktc());
			} else {
				tf = open(E_TERMCAP, 0);
			}
		} else
			tf = open(cp, 0);
	}
	if (tf==0)
		tf = open(E_TERMCAP, 0);
#else
	tf = open(E_TERMCAP, 0);
#endif
	if (tf < 0)
		return (-1);
	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;
			}
			if (cp >= bp+BUFSIZ) {
				write(2,"Termcap entry too long\n", 23);
				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.
 */
tnchktc()
{
	register char *p, *q;
	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 != ':')
		if (p<tbuf) {
			write(2, "Bad termcap entry\n", 18);
			return (0);
		}
	p++;
	/* p now points to beginning of last field */
	if (p[0] != 't' || p[1] != 'c')
		return(1);
	strcpy(tcname,p+3);
	q = tcname;
	while (q && *q != ':')
		q++;
	*q = 0;
	if (++hopcount > MAXHOP) {
		write(2, "Infinite tc= loop\n", 18);
		return (0);
	}
	if (tgetent(tcbuf, tcname) != 1)
		return(0);
	for (q=tcbuf; *q != ':'; q++)
		;
	l = p - holdtbuf + strlen(q);
	if (l > BUFSIZ) {
		write(2, "Termcap entry too long\n", 23);
		q[BUFSIZ - (p-tbuf)] = 0;
	}
	strcpy(p, q+1);
	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.
 */
tnamatch(np)
	char *np;
{
	register char *Np, *Bp;

	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 *
tskip(bp)
	register char *bp;
{

	while (*bp && *bp != ':')
		bp++;
	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.
 */
tgetnum(id)
	char *id;
{
	register int i, base;
	register char *bp = tbuf;

	for (;;) {
		bp = tskip(bp);
		if (*bp == 0)
			return (-1);
		if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
			continue;
		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.
 */
tgetflag(id)
	char *id;
{
	register char *bp = tbuf;

	for (;;) {
		bp = tskip(bp);
		if (!*bp)
			return (0);
		if (*bp++ == id[0] && *bp != 0 && *bp++ == id[1]) {
			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 *
tgetstr(id, area)
	char *id, **area;
{
	register char *bp = tbuf;

	for (;;) {
		bp = tskip(bp);
		if (!*bp)
			return (0);
		if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
			continue;
		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 *
tdecode(str, area)
	register char *str;
	char **area;
{
	register char *cp;
	register int c;
	register char *dp;
	int i;

	cp = *area;
	while ((c = *str++) && c != ':') {
		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;
	}
	*cp++ = 0;
	str = *area;
	*area = cp;
	return (str);
}
Commit	Line	Data
4d4caa50	1	/* printcap.c 1.5 83/05/13 */
2fd90732	2	/* Copyright (c) 1979 Regents of the University of California */
60d01856 SL	3	#define BUFSIZ 1024
60d01856 SL	4	#define MAXHOP 32 /* max number of tc= indirections */
2fd90732 BJ	5
2fd90732 BJ	6	#include <ctype.h>
4d4caa50	7	#include <stdio.h>
2fd90732	8	/*
60d01856	9	* termcap - routines for dealing with the terminal capability data base
2fd90732 BJ	10	*
	11	* BUG: Should use a "last" pointer in tbuf, so that searching
	12	* for capabilities alphabetically would not be a n**2/2
	13	* process when large numbers of capabilities are given.
60d01856 SL	14	* Note: If we add a last pointer now we will screw up the
60d01856 SL	15	* tc capability. We really should compile termcap.
2fd90732 BJ	16	*
	17	* Essentially all the work here is scanning and decoding escapes
	18	* in string capabilities. We don't use stdio because the editor
	19	* doesn't, and because living w/o it is not hard.
	20	*/
	21
60d01856 SL	22	#define PRINTCAP
	23
	24	#ifdef PRINTCAP
	25	#define tgetent pgetent
	26	#define tskip pskip
	27	#define tgetstr pgetstr
	28	#define tdecode pdecode
	29	#define tgetnum pgetnum
	30	#define tgetflag pgetflag
	31	#define tdecode pdecode
	32	#define tnchktc pnchktc
	33	#define tnamatch pnamatch
	34	#undef E_TERMCAP
	35	#define E_TERMCAP "/etc/printcap"
	36	#define V6
	37	#endif
	38
4d4caa50	39	static FILE pfp = NULL; / printcap data base file pointer */
60d01856	40	static char *tbuf;
4d4caa50	41	static int hopcount; /* detect infinite loops in termcap, init 0 */
60d01856 SL	42	char *tskip();
	43	char *tgetstr();
	44	char *tdecode();
	45	char *getenv();
2fd90732	46
4d4caa50 RC	47	/*
	48	* Similar to tgetent except it returns the next enrty instead of
	49	* doing a lookup.
	50	*/
	51	getprent(bp)
	52	register char *bp;
	53	{
	54	register int c, skip = 0;
	55
	56	if (pfp == NULL && (pfp = fopen(E_TERMCAP, "r")) == NULL)
	57	return(-1);
	58	tbuf = bp;
	59	for (;;) {
	60	switch (c = getc(pfp)) {
	61	case EOF:
	62	fclose(pfp);
	63	pfp = NULL;
	64	return(0);
	65	case '\n':
	66	if (bp == tbuf) {
	67	skip = 0;
	68	continue;
	69	}
	70	if (bp[-1] == '\\') {
	71	bp--;
	72	continue;
	73	}
	74	*bp = '\0';
	75	return(1);
	76	case '#':
	77	if (bp == tbuf)
	78	skip++;
	79	default:
	80	if (skip)
	81	continue;
	82	if (bp >= tbuf+BUFSIZ) {
	83	write(2, "Termcap entry too long\n", 23);
	84	*bp = '\0';
	85	return(1);
	86	}
	87	*bp++ = c;
	88	}
	89	}
	90	}
	91
	92	endprent()
	93	{
	94	if (pfp != NULL)
	95	fclose(pfp);
	96	}
	97
2fd90732	98	/*
60d01856 SL	99	* Get an entry for terminal name in buffer bp,
60d01856 SL	100	* from the termcap file. Parse is very rudimentary;
2fd90732 BJ	101	* we just notice escaped newlines.
2fd90732 BJ	102	*/
60d01856	103	tgetent(bp, name)
2fd90732 BJ	104	char bp, name;
	105	{
	106	register char *cp;
	107	register int c;
	108	register int i = 0, cnt = 0;
	109	char ibuf[BUFSIZ];
60d01856	110	char *cp2;
2fd90732 BJ	111	int tf;
2fd90732 BJ	112
60d01856 SL	113	tbuf = bp;
	114	tf = 0;
	115	#ifndef V6
	116	cp = getenv("TERMCAP");
	117	/*
	118	* TERMCAP can have one of two things in it. It can be the
	119	* name of a file to use instead of /etc/termcap. In this
	120	* case it better start with a "/". Or it can be an entry to
	121	* use so we don't have to read the file. In this case it
	122	* has to already have the newlines crunched out.
	123	*/
	124	if (cp && *cp) {
	125	if (*cp!='/') {
	126	cp2 = getenv("TERM");
	127	if (cp2==(char *) 0 \|\| strcmp(name,cp2)==0) {
	128	strcpy(bp,cp);
	129	return(tnchktc());
	130	} else {
	131	tf = open(E_TERMCAP, 0);
	132	}
	133	} else
	134	tf = open(cp, 0);
	135	}
	136	if (tf==0)
	137	tf = open(E_TERMCAP, 0);
	138	#else
	139	tf = open(E_TERMCAP, 0);
	140	#endif
2fd90732 BJ	141	if (tf < 0)
	142	return (-1);
	143	for (;;) {
	144	cp = bp;
	145	for (;;) {
	146	if (i == cnt) {
	147	cnt = read(tf, ibuf, BUFSIZ);
	148	if (cnt <= 0) {
	149	close(tf);
	150	return (0);
	151	}
	152	i = 0;
	153	}
	154	c = ibuf[i++];
	155	if (c == '\n') {
	156	if (cp > bp && cp[-1] == '\\'){
	157	cp--;
	158	continue;
	159	}
	160	break;
	161	}
60d01856 SL	162	if (cp >= bp+BUFSIZ) {
	163	write(2,"Termcap entry too long\n", 23);
	164	break;
	165	} else
	166	*cp++ = c;
2fd90732 BJ	167	}
	168	*cp = 0;
	169
	170	/*
	171	* The real work for the match.
	172	*/
60d01856	173	if (tnamatch(name)) {
2fd90732	174	close(tf);
60d01856 SL	175	return(tnchktc());
	176	}
	177	}
	178	}
	179
	180	/*
	181	* tnchktc: check the last entry, see if it's tc=xxx. If so,
	182	* recursively find xxx and append that entry (minus the names)
	183	* to take the place of the tc=xxx entry. This allows termcap
	184	* entries to say "like an HP2621 but doesn't turn on the labels".
	185	* Note that this works because of the left to right scan.
	186	*/
	187	tnchktc()
	188	{
	189	register char p, q;
	190	char tcname[16]; /* name of similar terminal */
	191	char tcbuf[BUFSIZ];
	192	char *holdtbuf = tbuf;
	193	int l;
	194
	195	p = tbuf + strlen(tbuf) - 2; /* before the last colon */
	196	while (*--p != ':')
	197	if (p<tbuf) {
	198	write(2, "Bad termcap entry\n", 18);
	199	return (0);
2fd90732	200	}
60d01856 SL	201	p++;
	202	/* p now points to beginning of last field */
	203	if (p[0] != 't' \|\| p[1] != 'c')
	204	return(1);
	205	strcpy(tcname,p+3);
	206	q = tcname;
	207	while (q && *q != ':')
	208	q++;
	209	*q = 0;
	210	if (++hopcount > MAXHOP) {
	211	write(2, "Infinite tc= loop\n", 18);
	212	return (0);
	213	}
	214	if (tgetent(tcbuf, tcname) != 1)
	215	return(0);
	216	for (q=tcbuf; *q != ':'; q++)
	217	;
	218	l = p - holdtbuf + strlen(q);
	219	if (l > BUFSIZ) {
	220	write(2, "Termcap entry too long\n", 23);
	221	q[BUFSIZ - (p-tbuf)] = 0;
2fd90732	222	}
60d01856 SL	223	strcpy(p, q+1);
	224	tbuf = holdtbuf;
	225	return(1);
2fd90732 BJ	226	}
	227
	228	/*
60d01856	229	* Tnamatch deals with name matching. The first field of the termcap
2fd90732 BJ	230	* entry is a sequence of names separated by \|'s, so we compare
	231	* against each such name. The normal : terminator after the last
	232	* name (before the first field) stops us.
	233	*/
60d01856	234	tnamatch(np)
2fd90732 BJ	235	char *np;
	236	{
	237	register char Np, Bp;
	238
60d01856 SL	239	Bp = tbuf;
	240	if (*Bp == '#')
	241	return(0);
2fd90732 BJ	242	for (;;) {
	243	for (Np = np; Np && Bp == *Np; Bp++, Np++)
	244	continue;
	245	if (Np == 0 && (Bp == '\|' \|\| Bp == ':' \|\| Bp == 0))
	246	return (1);
	247	while (Bp && Bp != ':' && *Bp != '\|')
	248	Bp++;
	249	if (Bp == 0 \|\| Bp == ':')
	250	return (0);
	251	Bp++;
	252	}
	253	}
	254
	255	/*
	256	* Skip to the next field. Notice that this is very dumb, not
	257	* knowing about \: escapes or any such. If necessary, :'s can be put
60d01856	258	* into the termcap file in octal.
2fd90732 BJ	259	*/
2fd90732 BJ	260	static char *
60d01856	261	tskip(bp)
2fd90732 BJ	262	register char *bp;
	263	{
	264
	265	while (bp && bp != ':')
	266	bp++;
	267	if (*bp == ':')
	268	bp++;
	269	return (bp);
	270	}
	271
	272	/*
	273	* Return the (numeric) option id.
	274	* Numeric options look like
	275	* li#80
	276	* i.e. the option string is separated from the numeric value by
	277	* a # character. If the option is not found we return -1.
	278	* Note that we handle octal numbers beginning with 0.
	279	*/
60d01856	280	tgetnum(id)
2fd90732 BJ	281	char *id;
	282	{
	283	register int i, base;
60d01856	284	register char *bp = tbuf;
2fd90732 BJ	285
2fd90732 BJ	286	for (;;) {
60d01856	287	bp = tskip(bp);
2fd90732 BJ	288	if (*bp == 0)
	289	return (-1);
	290	if (bp++ != id[0] \|\| bp == 0 \|\| *bp++ != id[1])
	291	continue;
60d01856 SL	292	if (*bp == '@')
60d01856 SL	293	return(-1);
2fd90732 BJ	294	if (*bp != '#')
	295	continue;
	296	bp++;
	297	base = 10;
	298	if (*bp == '0')
	299	base = 8;
	300	i = 0;
	301	while (isdigit(*bp))
	302	i = base, i += bp++ - '0';
	303	return (i);
	304	}
	305	}
	306
	307	/*
	308	* Handle a flag option.
	309	* Flag options are given "naked", i.e. followed by a : or the end
	310	* of the buffer. Return 1 if we find the option, or 0 if it is
	311	* not given.
	312	*/
60d01856	313	tgetflag(id)
2fd90732 BJ	314	char *id;
2fd90732 BJ	315	{
60d01856	316	register char *bp = tbuf;
2fd90732 BJ	317
2fd90732 BJ	318	for (;;) {
60d01856	319	bp = tskip(bp);
2fd90732 BJ	320	if (!*bp)
2fd90732 BJ	321	return (0);
60d01856 SL	322	if (bp++ == id[0] && bp != 0 && *bp++ == id[1]) {
	323	if (!bp \|\| bp == ':')
	324	return (1);
	325	else if (*bp == '@')
	326	return(0);
	327	}
2fd90732 BJ	328	}
	329	}
	330
	331	/*
	332	* Get a string valued option.
	333	* These are given as
	334	* cl=^Z
	335	* Much decoding is done on the strings, and the strings are
	336	* placed in area, which is a ref parameter which is updated.
	337	* No checking on area overflow.
	338	*/
	339	char *
60d01856	340	tgetstr(id, area)
2fd90732 BJ	341	char id, *area;
2fd90732 BJ	342	{
60d01856	343	register char *bp = tbuf;
2fd90732 BJ	344
2fd90732 BJ	345	for (;;) {
60d01856	346	bp = tskip(bp);
2fd90732 BJ	347	if (!*bp)
	348	return (0);
	349	if (bp++ != id[0] \|\| bp == 0 \|\| *bp++ != id[1])
	350	continue;
60d01856 SL	351	if (*bp == '@')
60d01856 SL	352	return(0);
2fd90732 BJ	353	if (*bp != '=')
	354	continue;
	355	bp++;
60d01856	356	return (tdecode(bp, area));
2fd90732 BJ	357	}
	358	}
	359
	360	/*
	361	* Tdecode does the grung work to decode the
	362	* string capability escapes.
	363	*/
	364	static char *
60d01856	365	tdecode(str, area)
2fd90732 BJ	366	register char *str;
	367	char **area;
	368	{
	369	register char *cp;
	370	register int c;
	371	register char *dp;
	372	int i;
	373
	374	cp = *area;
	375	while ((c = *str++) && c != ':') {
	376	switch (c) {
	377
	378	case '^':
	379	c = *str++ & 037;
	380	break;
	381
	382	case '\\':
	383	dp = "E\033^^\\\\::n\nr\rt\tb\bf\f";
	384	c = *str++;
	385	nextc:
	386	if (*dp++ == c) {
	387	c = *dp++;
	388	break;
	389	}
	390	dp++;
	391	if (*dp)
	392	goto nextc;
	393	if (isdigit(c)) {
	394	c -= '0', i = 2;
	395	do
	396	c <<= 3, c \|= *str++ - '0';
	397	while (--i && isdigit(*str));
	398	}
	399	break;
	400	}
	401	*cp++ = c;
	402	}
	403	*cp++ = 0;
	404	str = *area;
	405	*area = cp;
	406	return (str);
	407	}