2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
39 #define MAXHOP 32 /* max number of tc= indirections */
45 * grindcap - routines for dealing with the language definitions data base
46 * (code stolen almost totally from termcap)
48 * BUG: Should use a "last" pointer in tbuf, so that searching
49 * for capabilities alphabetically would not be a n**2/2
50 * process when large numbers of capabilities are given.
51 * Note: If we add a last pointer now we will screw up the
52 * tc capability. We really should compile termcap.
54 * Essentially all the work here is scanning and decoding escapes
55 * in string capabilities. We don't use stdio because the editor
56 * doesn't, and because living w/o it is not hard.
60 static char *filename;
61 static int hopcount; /* detect infinite loops in termcap, init 0 */
68 * Get an entry for terminal name in buffer bp,
69 * from the termcap file. Parse is very rudimentary;
70 * we just notice escaped newlines.
72 tgetent(bp, name, file)
73 char *bp, *name, *file;
77 register int i = 0, cnt = 0;
85 tf = open(filename, 0);
92 cnt = read(tf, ibuf, BUFSIZ);
101 if (cp > bp && cp[-1] == '\\'){
107 if (cp >= bp+BUFSIZ) {
108 write(STDERR_FILENO, "Vgrind entry too long\n", 23);
116 * The real work for the match.
118 if (tnamatch(name)) {
126 * tnchktc: check the last entry, see if it's tc=xxx. If so,
127 * recursively find xxx and append that entry (minus the names)
128 * to take the place of the tc=xxx entry. This allows termcap
129 * entries to say "like an HP2621 but doesn't turn on the labels".
130 * Note that this works because of the left to right scan.
134 register char *p, *q;
135 char tcname[16]; /* name of similar terminal */
137 char *holdtbuf = tbuf;
140 p = tbuf + strlen(tbuf) - 2; /* before the last colon */
143 write(STDERR_FILENO, "Bad vgrind entry\n", 18);
147 /* p now points to beginning of last field */
148 if (p[0] != 't' || p[1] != 'c')
152 while (q && *q != ':')
155 if (++hopcount > MAXHOP) {
156 write(STDERR_FILENO, "Infinite tc= loop\n", 18);
159 if (tgetent(tcbuf, tcname, filename) != 1)
161 for (q=tcbuf; *q != ':'; q++)
163 l = p - holdtbuf + strlen(q);
165 write(STDERR_FILENO, "Vgrind entry too long\n", 23);
166 q[BUFSIZ - (p-tbuf)] = 0;
174 * Tnamatch deals with name matching. The first field of the termcap
175 * entry is a sequence of names separated by |'s, so we compare
176 * against each such name. The normal : terminator after the last
177 * name (before the first field) stops us.
182 register char *Np, *Bp;
188 for (Np = np; *Np && *Bp == *Np; Bp++, Np++)
190 if (*Np == 0 && (*Bp == '|' || *Bp == ':' || *Bp == 0))
192 while (*Bp && *Bp != ':' && *Bp != '|')
194 if (*Bp == 0 || *Bp == ':')
201 * Skip to the next field. Notice that this is very dumb, not
202 * knowing about \: escapes or any such. If necessary, :'s can be put
203 * into the termcap file in octal.
210 while (*bp && *bp != ':')
218 * Return the (numeric) option id.
219 * Numeric options look like
221 * i.e. the option string is separated from the numeric value by
222 * a # character. If the option is not found we return -1.
223 * Note that we handle octal numbers beginning with 0.
228 register int i, base;
229 register char *bp = tbuf;
235 if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
247 i *= base, i += *bp++ - '0';
253 * Handle a flag option.
254 * Flag options are given "naked", i.e. followed by a : or the end
255 * of the buffer. Return 1 if we find the option, or 0 if it is
261 register char *bp = tbuf;
267 if (*bp++ == id[0] && *bp != 0 && *bp++ == id[1]) {
268 if (!*bp || *bp == ':')
277 * Get a string valued option.
280 * Much decoding is done on the strings, and the strings are
281 * placed in area, which is a ref parameter which is updated.
282 * No checking on area overflow.
288 register char *bp = tbuf;
294 if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
301 return (tdecode(bp, area));
306 * Tdecode does the grung work to decode the
307 * string capability escapes.
320 if (c == ':' && *(cp-1) != '\\')