2 * $Id: printcap.c,v 1.10 2005-04-28 20:49:49 bfernhomberg Exp $
4 * Copyright (c) 1990,1994 Regents of The University of Michigan.
5 * All Rights Reserved. See COPYRIGHT.
7 * Copyright (c) 1983 Regents of the University of California.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 #endif /* HAVE_CONFIG_H */
48 #endif /* HAVE_UNISTD_H */
49 #include <sys/types.h>
53 #endif /* HAVE_FCNTL_H */
54 #include <atalk/paths.h>
61 #define MAXHOP 32 /* max number of tc= indirections */
64 * termcap - routines for dealing with the terminal capability data base
66 * BUG: Should use a "last" pointer in tbuf, so that searching
67 * for capabilities alphabetically would not be a n**2/2
68 * process when large numbers of capabilities are given.
69 * Note: If we add a last pointer now we will screw up the
70 * tc capability. We really should compile termcap.
72 * Essentially all the work here is scanning and decoding escapes
73 * in string capabilities. We don't use stdio because the editor
74 * doesn't, and because living w/o it is not hard.
80 #define tgetent pgetent
82 #define tgetstr pgetstr
83 #define tdecode pdecode
84 #define tgetnum pgetnum
85 #define tgetflag pgetflag
86 #define tdecode pdecode
87 #define tnchktc pnchktc
88 #define tnamatch pnamatch
92 static FILE *pfp = NULL; /* printcap data base file pointer */
94 static int hopcount; /* detect infinite loops in termcap, init 0 */
97 static char *tdecode();
101 * Similar to tgetent except it returns the next entry instead of
104 * Added a "cap" parameter, so we can use these calls for printcap
107 int getprent( cap, bp, bufsize )
110 register int bufsize;
112 register int c, skip = 0, i;
114 if (pfp == NULL && (pfp = fopen( cap, "r")) == NULL)
119 switch (c = getc(pfp)) {
133 if (bp[-1] == '\\') {
145 if (bp >= tbuf+BUFSIZ) {
146 write(2, "Termcap entry too long\n", 23);
151 if (++i >= bufsize) {
152 write(2, "config file too large\n", 22);
169 * Get an entry for terminal name in buffer bp,
170 * from the termcap file. Parse is very rudimentary;
171 * we just notice escaped newlines.
173 * Added a "cap" parameter, so we can use these calls for printcap
176 int tgetent( cap, bp, name)
177 char *cap, *bp, *name;
181 register int i = 0, cnt = 0;
190 cp = getenv("TERMCAP");
192 * TERMCAP can have one of two things in it. It can be the
193 * name of a file to use instead of /etc/termcap. In this
194 * case it better start with a "/". Or it can be an entry to
195 * use so we don't have to read the file. In this case it
196 * has to already have the newlines crunched out.
200 cp2 = getenv("TERM");
201 if (cp2==(char *) 0 || strcmp(name,cp2)==0) {
203 return(tnchktc(cap));
222 cnt = read(tf, ibuf, BUFSIZ);
231 if (!skip && cp > bp && cp[-1] == '\\') {
241 if (c == '#' && cp == bp)
245 if (cp >= bp+BUFSIZ) {
246 write(2,"Termcap entry too long\n", 23);
254 * The real work for the match.
256 if (tnamatch(name)) {
258 return(tnchktc(cap));
264 * tnchktc: check the last entry, see if it's tc=xxx. If so,
265 * recursively find xxx and append that entry (minus the names)
266 * to take the place of the tc=xxx entry. This allows termcap
267 * entries to say "like an HP2621 but doesn't turn on the labels".
268 * Note that this works because of the left to right scan.
270 * Added a "cap" parameter, so we can use these calls for printcap
276 register char *p, *q;
277 char tcname[16]; /* name of similar terminal */
279 char *holdtbuf = tbuf;
282 p = tbuf + strlen(tbuf) - 2; /* before the last colon */
285 write(2, "Bad termcap entry\n", 18);
289 /* p now points to beginning of last field */
290 if (p[0] != 't' || p[1] != 'c')
294 while (q && *q != ':')
297 if (++hopcount > MAXHOP) {
298 write(2, "Infinite tc= loop\n", 18);
301 if (tgetent( cap, tcbuf, tcname) != 1)
303 for (q=tcbuf; *q != ':'; q++)
305 l = p - holdtbuf + strlen(q);
307 write(2, "Termcap entry too long\n", 23);
308 q[BUFSIZ - (p-tbuf)] = 0;
316 * Tnamatch deals with name matching. The first field of the termcap
317 * entry is a sequence of names separated by |'s, so we compare
318 * against each such name. The normal : terminator after the last
319 * name (before the first field) stops us.
324 register char *Np, *Bp;
330 for (Np = np; *Np && *Bp == *Np; Bp++, Np++)
332 if (*Np == 0 && (*Bp == '|' || *Bp == ':' || *Bp == 0))
334 while (*Bp && *Bp != ':' && *Bp != '|')
336 if (*Bp == 0 || *Bp == ':')
343 * Skip to the next field. Notice that this is very dumb, not
344 * knowing about \: escapes or any such. If necessary, :'s can be put
345 * into the termcap file in octal.
352 while (*bp && *bp != ':')
354 while (*bp && *bp == ':')
360 * Return the (numeric) option id.
361 * Numeric options look like
363 * i.e. the option string is separated from the numeric value by
364 * a # character. If the option is not found we return -1.
365 * Note that we handle octal numbers beginning with 0.
370 register int i, base;
371 register char *bp = tbuf;
377 if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
389 i *= base, i += *bp++ - '0';
395 * Handle a flag option.
396 * Flag options are given "naked", i.e. followed by a : or the end
397 * of the buffer. Return 1 if we find the option, or 0 if it is
403 register char *bp = tbuf;
409 if (*bp++ == id[0] && *bp != 0 && *bp++ == id[1]) {
410 if (!*bp || *bp == ':')
419 * Get a string valued option.
422 * Much decoding is done on the strings, and the strings are
423 * placed in area, which is a ref parameter which is updated.
424 * No checking on area overflow.
430 register char *bp = tbuf;
436 if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
443 return (tdecode(bp, area));
448 * Tdecode does the grung work to decode the
449 * string capability escapes.
462 while ((c = *str++) && c != ':') {
470 dp = "E\033^^\\\\::n\nr\rt\tb\bf\f";
483 c <<= 3, c |= *str++ - '0';
484 while (--i && isdigit(*str));
497 decodename(str, area, bufsize)
508 while ((c = *str++) && --bufsize && c != ':' && c != '|' ) {
516 dp = "E\033^^\\\\::n\nr\rt\tb\bf\f";
529 c <<= 3, c |= *str++ - '0';
530 while (--i && isdigit(*str));
543 getpname( area, bufsize )
547 return( decodename( tbuf, area, bufsize));