advcap.c revision 1.5 1 1.5 itojun /* $NetBSD: advcap.c,v 1.5 2000/05/23 11:37:58 itojun Exp $ */
2 1.5 itojun /* $KAME: advcap.c,v 1.4 2000/05/23 11:17:40 itojun Exp $ */
3 1.2 itojun
4 1.1 itojun /*
5 1.1 itojun * Copyright (c) 1983 The Regents of the University of California.
6 1.1 itojun * All rights reserved.
7 1.1 itojun *
8 1.1 itojun * Redistribution and use in source and binary forms, with or without
9 1.1 itojun * modification, are permitted provided that the following conditions
10 1.1 itojun * are met:
11 1.1 itojun * 1. Redistributions of source code must retain the above copyright
12 1.1 itojun * notice, this list of conditions and the following disclaimer.
13 1.1 itojun * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 itojun * notice, this list of conditions and the following disclaimer in the
15 1.1 itojun * documentation and/or other materials provided with the distribution.
16 1.1 itojun * 3. All advertising materials mentioning features or use of this software
17 1.1 itojun * must display the following acknowledgement:
18 1.1 itojun * This product includes software developed by the University of
19 1.1 itojun * California, Berkeley and its contributors.
20 1.1 itojun * 4. Neither the name of the University nor the names of its contributors
21 1.1 itojun * may be used to endorse or promote products derived from this software
22 1.1 itojun * without specific prior written permission.
23 1.1 itojun *
24 1.1 itojun * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 itojun * SUCH DAMAGE.
35 1.1 itojun */
36 1.1 itojun
37 1.1 itojun /*
38 1.1 itojun * remcap - routines for dealing with the remote host data base
39 1.1 itojun *
40 1.1 itojun * derived from termcap
41 1.1 itojun */
42 1.1 itojun #include <sys/types.h>
43 1.1 itojun #include <sys/uio.h>
44 1.1 itojun #include <unistd.h>
45 1.1 itojun #include <fcntl.h>
46 1.1 itojun #include <ctype.h>
47 1.1 itojun #include <stdlib.h>
48 1.1 itojun #include <stdio.h>
49 1.1 itojun #include <syslog.h>
50 1.1 itojun #include <errno.h>
51 1.1 itojun #include <string.h>
52 1.1 itojun #include "pathnames.h"
53 1.1 itojun
54 1.1 itojun #ifndef BUFSIZ
55 1.1 itojun #define BUFSIZ 1024
56 1.1 itojun #endif
57 1.1 itojun #define MAXHOP 32 /* max number of tc= indirections */
58 1.1 itojun
59 1.1 itojun #define tgetent agetent
60 1.1 itojun #define tnchktc anchktc
61 1.1 itojun #define tnamatch anamatch
62 1.1 itojun #define tgetnum agetnum
63 1.1 itojun #define tgetflag agetflag
64 1.1 itojun #define tgetstr agetstr
65 1.1 itojun
66 1.1 itojun #if 0
67 1.1 itojun #define V_TERMCAP "REMOTE"
68 1.1 itojun #define V_TERM "HOST"
69 1.1 itojun #endif
70 1.1 itojun
71 1.1 itojun char *RM;
72 1.1 itojun
73 1.1 itojun /*
74 1.1 itojun * termcap - routines for dealing with the terminal capability data base
75 1.1 itojun *
76 1.1 itojun * BUG: Should use a "last" pointer in tbuf, so that searching
77 1.1 itojun * for capabilities alphabetically would not be a n**2/2
78 1.1 itojun * process when large numbers of capabilities are given.
79 1.1 itojun * Note: If we add a last pointer now we will screw up the
80 1.1 itojun * tc capability. We really should compile termcap.
81 1.1 itojun *
82 1.1 itojun * Essentially all the work here is scanning and decoding escapes
83 1.1 itojun * in string capabilities. We don't use stdio because the editor
84 1.1 itojun * doesn't, and because living w/o it is not hard.
85 1.1 itojun */
86 1.1 itojun
87 1.1 itojun static char *tbuf;
88 1.1 itojun static int hopcount; /* detect infinite loops in termcap, init 0 */
89 1.1 itojun
90 1.1 itojun static char *remotefile;
91 1.1 itojun
92 1.1 itojun extern char *conffile;
93 1.1 itojun
94 1.1 itojun int tgetent __P((char *, char *));
95 1.1 itojun int getent __P((char *, char *, char *));
96 1.1 itojun int tnchktc __P((void));
97 1.1 itojun int tnamatch __P((char *));
98 1.1 itojun static char *tskip __P((char *));
99 1.1 itojun int tgetnum __P((char *));
100 1.1 itojun int tgetflag __P((char *));
101 1.1 itojun char *tgetstr __P((char *, char **));
102 1.1 itojun static char *tdecode __P((char *, char **));
103 1.1 itojun
104 1.1 itojun /*
105 1.1 itojun * Get an entry for terminal name in buffer bp,
106 1.1 itojun * from the termcap file. Parse is very rudimentary;
107 1.1 itojun * we just notice escaped newlines.
108 1.1 itojun */
109 1.1 itojun int
110 1.1 itojun tgetent(bp, name)
111 1.1 itojun char *bp, *name;
112 1.1 itojun {
113 1.1 itojun char *cp;
114 1.1 itojun
115 1.1 itojun remotefile = cp = conffile ? conffile : _PATH_RTADVDCONF;
116 1.1 itojun return (getent(bp, name, cp));
117 1.1 itojun }
118 1.1 itojun
119 1.1 itojun int
120 1.1 itojun getent(bp, name, cp)
121 1.1 itojun char *bp, *name, *cp;
122 1.1 itojun {
123 1.1 itojun register int c;
124 1.1 itojun register int i = 0, cnt = 0;
125 1.1 itojun char ibuf[BUFSIZ];
126 1.1 itojun int tf;
127 1.1 itojun
128 1.1 itojun tbuf = bp;
129 1.1 itojun tf = 0;
130 1.1 itojun /*
131 1.1 itojun * TERMCAP can have one of two things in it. It can be the
132 1.1 itojun * name of a file to use instead of /etc/termcap. In this
133 1.1 itojun * case it better start with a "/". Or it can be an entry to
134 1.1 itojun * use so we don't have to read the file. In this case it
135 1.1 itojun * has to already have the newlines crunched out.
136 1.1 itojun */
137 1.1 itojun if (cp && *cp) {
138 1.1 itojun tf = open(RM = cp, O_RDONLY);
139 1.1 itojun }
140 1.1 itojun if (tf < 0) {
141 1.5 itojun syslog(LOG_INFO,
142 1.1 itojun "<%s> open: %s", __FUNCTION__, strerror(errno));
143 1.1 itojun return (-2);
144 1.1 itojun }
145 1.1 itojun for (;;) {
146 1.1 itojun cp = bp;
147 1.1 itojun for (;;) {
148 1.1 itojun if (i == cnt) {
149 1.1 itojun cnt = read(tf, ibuf, BUFSIZ);
150 1.1 itojun if (cnt <= 0) {
151 1.1 itojun close(tf);
152 1.1 itojun return (0);
153 1.1 itojun }
154 1.1 itojun i = 0;
155 1.1 itojun }
156 1.1 itojun c = ibuf[i++];
157 1.1 itojun if (c == '\n') {
158 1.1 itojun if (cp > bp && cp[-1] == '\\') {
159 1.1 itojun cp--;
160 1.1 itojun continue;
161 1.1 itojun }
162 1.1 itojun break;
163 1.1 itojun }
164 1.1 itojun if (cp >= bp+BUFSIZ) {
165 1.1 itojun write(2,"Remcap entry too long\n", 23);
166 1.1 itojun break;
167 1.1 itojun } else
168 1.1 itojun *cp++ = c;
169 1.1 itojun }
170 1.1 itojun *cp = 0;
171 1.1 itojun
172 1.1 itojun /*
173 1.1 itojun * The real work for the match.
174 1.1 itojun */
175 1.1 itojun if (tnamatch(name)) {
176 1.1 itojun close(tf);
177 1.1 itojun return (tnchktc());
178 1.1 itojun }
179 1.1 itojun }
180 1.1 itojun }
181 1.1 itojun
182 1.1 itojun /*
183 1.1 itojun * tnchktc: check the last entry, see if it's tc=xxx. If so,
184 1.1 itojun * recursively find xxx and append that entry (minus the names)
185 1.1 itojun * to take the place of the tc=xxx entry. This allows termcap
186 1.1 itojun * entries to say "like an HP2621 but doesn't turn on the labels".
187 1.1 itojun * Note that this works because of the left to right scan.
188 1.1 itojun */
189 1.1 itojun int
190 1.1 itojun tnchktc()
191 1.1 itojun {
192 1.1 itojun register char *p, *q;
193 1.1 itojun char tcname[16]; /* name of similar terminal */
194 1.1 itojun char tcbuf[BUFSIZ];
195 1.1 itojun char *holdtbuf = tbuf;
196 1.1 itojun int l;
197 1.1 itojun
198 1.1 itojun p = tbuf + strlen(tbuf) - 2; /* before the last colon */
199 1.1 itojun while (*--p != ':')
200 1.1 itojun if (p<tbuf) {
201 1.1 itojun write(2, "Bad remcap entry\n", 18);
202 1.1 itojun return (0);
203 1.1 itojun }
204 1.1 itojun p++;
205 1.1 itojun /* p now points to beginning of last field */
206 1.1 itojun if (p[0] != 't' || p[1] != 'c')
207 1.1 itojun return (1);
208 1.1 itojun strcpy(tcname, p+3);
209 1.1 itojun q = tcname;
210 1.1 itojun while (*q && *q != ':')
211 1.1 itojun q++;
212 1.1 itojun *q = 0;
213 1.1 itojun if (++hopcount > MAXHOP) {
214 1.1 itojun write(2, "Infinite tc= loop\n", 18);
215 1.1 itojun return (0);
216 1.1 itojun }
217 1.1 itojun if (getent(tcbuf, tcname, remotefile) != 1) {
218 1.1 itojun return (0);
219 1.1 itojun }
220 1.1 itojun for (q = tcbuf; *q++ != ':'; )
221 1.1 itojun ;
222 1.1 itojun l = p - holdtbuf + strlen(q);
223 1.1 itojun if (l > BUFSIZ) {
224 1.1 itojun write(2, "Remcap entry too long\n", 23);
225 1.1 itojun q[BUFSIZ - (p-holdtbuf)] = 0;
226 1.1 itojun }
227 1.1 itojun strcpy(p, q);
228 1.1 itojun tbuf = holdtbuf;
229 1.1 itojun return (1);
230 1.1 itojun }
231 1.1 itojun
232 1.1 itojun /*
233 1.1 itojun * Tnamatch deals with name matching. The first field of the termcap
234 1.1 itojun * entry is a sequence of names separated by |'s, so we compare
235 1.1 itojun * against each such name. The normal : terminator after the last
236 1.1 itojun * name (before the first field) stops us.
237 1.1 itojun */
238 1.1 itojun int
239 1.1 itojun tnamatch(np)
240 1.1 itojun char *np;
241 1.1 itojun {
242 1.1 itojun register char *Np, *Bp;
243 1.1 itojun
244 1.1 itojun Bp = tbuf;
245 1.1 itojun if (*Bp == '#')
246 1.1 itojun return (0);
247 1.1 itojun for (;;) {
248 1.1 itojun for (Np = np; *Np && *Bp == *Np; Bp++, Np++)
249 1.1 itojun continue;
250 1.1 itojun if (*Np == 0 && (*Bp == '|' || *Bp == ':' || *Bp == 0))
251 1.1 itojun return (1);
252 1.1 itojun while (*Bp && *Bp != ':' && *Bp != '|')
253 1.1 itojun Bp++;
254 1.1 itojun if (*Bp == 0 || *Bp == ':')
255 1.1 itojun return (0);
256 1.1 itojun Bp++;
257 1.1 itojun }
258 1.1 itojun }
259 1.1 itojun
260 1.1 itojun /*
261 1.1 itojun * Skip to the next field. Notice that this is very dumb, not
262 1.1 itojun * knowing about \: escapes or any such. If necessary, :'s can be put
263 1.1 itojun * into the termcap file in octal.
264 1.1 itojun */
265 1.1 itojun static char *
266 1.1 itojun tskip(bp)
267 1.1 itojun register char *bp;
268 1.1 itojun {
269 1.1 itojun int dquote;
270 1.1 itojun
271 1.1 itojun dquote = 0;
272 1.1 itojun while (*bp) {
273 1.1 itojun switch (*bp) {
274 1.1 itojun case ':':
275 1.1 itojun if (!dquote)
276 1.1 itojun goto breakbreak;
277 1.1 itojun else
278 1.1 itojun bp++;
279 1.1 itojun break;
280 1.1 itojun case '\\':
281 1.1 itojun bp++;
282 1.1 itojun if (isdigit(*bp)) {
283 1.1 itojun while (isdigit(*bp++))
284 1.1 itojun ;
285 1.1 itojun } else
286 1.1 itojun bp++;
287 1.1 itojun case '"':
288 1.1 itojun dquote = (dquote ? 1 : 0);
289 1.1 itojun bp++;
290 1.1 itojun break;
291 1.1 itojun default:
292 1.1 itojun bp++;
293 1.1 itojun break;
294 1.1 itojun }
295 1.1 itojun }
296 1.1 itojun breakbreak:
297 1.1 itojun if (*bp == ':')
298 1.1 itojun bp++;
299 1.1 itojun return (bp);
300 1.1 itojun }
301 1.1 itojun
302 1.1 itojun /*
303 1.1 itojun * Return the (numeric) option id.
304 1.1 itojun * Numeric options look like
305 1.1 itojun * li#80
306 1.1 itojun * i.e. the option string is separated from the numeric value by
307 1.1 itojun * a # character. If the option is not found we return -1.
308 1.1 itojun * Note that we handle octal numbers beginning with 0.
309 1.1 itojun */
310 1.1 itojun int
311 1.1 itojun tgetnum(id)
312 1.1 itojun char *id;
313 1.1 itojun {
314 1.1 itojun register long int i;
315 1.1 itojun register int base;
316 1.1 itojun register char *bp = tbuf;
317 1.1 itojun
318 1.1 itojun for (;;) {
319 1.1 itojun bp = tskip(bp);
320 1.1 itojun if (*bp == 0)
321 1.1 itojun return (-1);
322 1.1 itojun if (strncmp(bp, id, strlen(id)) != 0)
323 1.1 itojun continue;
324 1.1 itojun bp += strlen(id);
325 1.1 itojun if (*bp == '@')
326 1.1 itojun return (-1);
327 1.1 itojun if (*bp != '#')
328 1.1 itojun continue;
329 1.1 itojun bp++;
330 1.1 itojun base = 10;
331 1.1 itojun if (*bp == '0')
332 1.1 itojun base = 8;
333 1.1 itojun i = 0;
334 1.1 itojun while (isdigit(*bp))
335 1.1 itojun i *= base, i += *bp++ - '0';
336 1.1 itojun return (i);
337 1.1 itojun }
338 1.1 itojun }
339 1.1 itojun
340 1.1 itojun /*
341 1.1 itojun * Handle a flag option.
342 1.1 itojun * Flag options are given "naked", i.e. followed by a : or the end
343 1.1 itojun * of the buffer. Return 1 if we find the option, or 0 if it is
344 1.1 itojun * not given.
345 1.1 itojun */
346 1.1 itojun int
347 1.1 itojun tgetflag(id)
348 1.1 itojun char *id;
349 1.1 itojun {
350 1.1 itojun register char *bp = tbuf;
351 1.1 itojun
352 1.1 itojun for (;;) {
353 1.1 itojun bp = tskip(bp);
354 1.1 itojun if (!*bp)
355 1.1 itojun return (0);
356 1.1 itojun if (strncmp(bp, id, strlen(id)) == 0) {
357 1.1 itojun bp += strlen(id);
358 1.1 itojun if (!*bp || *bp == ':')
359 1.1 itojun return (1);
360 1.1 itojun else if (*bp == '@')
361 1.1 itojun return (0);
362 1.1 itojun }
363 1.1 itojun }
364 1.1 itojun }
365 1.1 itojun
366 1.1 itojun /*
367 1.1 itojun * Get a string valued option.
368 1.1 itojun * These are given as
369 1.1 itojun * cl=^Z
370 1.1 itojun * Much decoding is done on the strings, and the strings are
371 1.1 itojun * placed in area, which is a ref parameter which is updated.
372 1.1 itojun * No checking on area overflow.
373 1.1 itojun */
374 1.1 itojun char *
375 1.1 itojun tgetstr(id, area)
376 1.1 itojun char *id, **area;
377 1.1 itojun {
378 1.1 itojun register char *bp = tbuf;
379 1.1 itojun
380 1.1 itojun for (;;) {
381 1.1 itojun bp = tskip(bp);
382 1.1 itojun if (!*bp)
383 1.1 itojun return (0);
384 1.1 itojun if (strncmp(bp, id, strlen(id)) != 0)
385 1.1 itojun continue;
386 1.1 itojun bp += strlen(id);
387 1.1 itojun if (*bp == '@')
388 1.1 itojun return (0);
389 1.1 itojun if (*bp != '=')
390 1.1 itojun continue;
391 1.1 itojun bp++;
392 1.1 itojun return (tdecode(bp, area));
393 1.1 itojun }
394 1.1 itojun }
395 1.1 itojun
396 1.1 itojun /*
397 1.1 itojun * Tdecode does the grung work to decode the
398 1.1 itojun * string capability escapes.
399 1.1 itojun */
400 1.1 itojun static char *
401 1.1 itojun tdecode(str, area)
402 1.1 itojun register char *str;
403 1.1 itojun char **area;
404 1.1 itojun {
405 1.1 itojun register char *cp;
406 1.1 itojun register int c;
407 1.1 itojun register char *dp;
408 1.1 itojun int i;
409 1.1 itojun char term;
410 1.1 itojun
411 1.1 itojun term = ':';
412 1.1 itojun cp = *area;
413 1.1 itojun again:
414 1.1 itojun if (*str == '"') {
415 1.1 itojun term = '"';
416 1.1 itojun str++;
417 1.1 itojun }
418 1.1 itojun while ((c = *str++) && c != term) {
419 1.1 itojun switch (c) {
420 1.1 itojun
421 1.1 itojun case '^':
422 1.1 itojun c = *str++ & 037;
423 1.1 itojun break;
424 1.1 itojun
425 1.1 itojun case '\\':
426 1.1 itojun dp = "E\033^^\\\\::n\nr\rt\tb\bf\f\"\"";
427 1.1 itojun c = *str++;
428 1.1 itojun nextc:
429 1.1 itojun if (*dp++ == c) {
430 1.1 itojun c = *dp++;
431 1.1 itojun break;
432 1.1 itojun }
433 1.1 itojun dp++;
434 1.1 itojun if (*dp)
435 1.1 itojun goto nextc;
436 1.1 itojun if (isdigit(c)) {
437 1.1 itojun c -= '0', i = 2;
438 1.1 itojun do
439 1.1 itojun c <<= 3, c |= *str++ - '0';
440 1.1 itojun while (--i && isdigit(*str));
441 1.1 itojun }
442 1.1 itojun break;
443 1.1 itojun }
444 1.1 itojun *cp++ = c;
445 1.1 itojun }
446 1.1 itojun if (c == term && term != ':') {
447 1.1 itojun term = ':';
448 1.1 itojun goto again;
449 1.1 itojun }
450 1.1 itojun *cp++ = 0;
451 1.1 itojun str = *area;
452 1.1 itojun *area = cp;
453 1.1 itojun return (str);
454 1.1 itojun }
455