lex.c revision 1.7 1 1.7 cgd /* $NetBSD: lex.c,v 1.7 1995/03/21 09:03:07 cgd Exp $ */
2 1.7 cgd
3 1.1 cgd /*-
4 1.5 mycroft * Copyright (c) 1980, 1991, 1993
5 1.5 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #ifndef lint
37 1.7 cgd #if 0
38 1.7 cgd static char sccsid[] = "@(#)lex.c 8.1 (Berkeley) 5/31/93";
39 1.7 cgd #else
40 1.7 cgd static char rcsid[] = "$NetBSD: lex.c,v 1.7 1995/03/21 09:03:07 cgd Exp $";
41 1.7 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd #include <sys/types.h>
45 1.1 cgd #include <sys/ioctl.h>
46 1.1 cgd #include <termios.h>
47 1.1 cgd #include <errno.h>
48 1.1 cgd #include <stdlib.h>
49 1.1 cgd #include <string.h>
50 1.1 cgd #include <unistd.h>
51 1.1 cgd #if __STDC__
52 1.1 cgd # include <stdarg.h>
53 1.1 cgd #else
54 1.1 cgd # include <varargs.h>
55 1.1 cgd #endif
56 1.1 cgd
57 1.1 cgd #include "csh.h"
58 1.1 cgd #include "extern.h"
59 1.1 cgd
60 1.1 cgd /*
61 1.1 cgd * These lexical routines read input and form lists of words.
62 1.1 cgd * There is some involved processing here, because of the complications
63 1.1 cgd * of input buffering, and especially because of history substitution.
64 1.1 cgd */
65 1.1 cgd
66 1.1 cgd static Char *word __P((void));
67 1.1 cgd static int getC1 __P((int));
68 1.1 cgd static void getdol __P((void));
69 1.1 cgd static void getexcl __P((int));
70 1.5 mycroft static struct Hist
71 1.1 cgd *findev __P((Char *, bool));
72 1.1 cgd static void setexclp __P((Char *));
73 1.1 cgd static int bgetc __P((void));
74 1.1 cgd static void bfree __P((void));
75 1.5 mycroft static struct wordent
76 1.1 cgd *gethent __P((int));
77 1.1 cgd static int matchs __P((Char *, Char *));
78 1.1 cgd static int getsel __P((int *, int *, int));
79 1.5 mycroft static struct wordent
80 1.1 cgd *getsub __P((struct wordent *));
81 1.5 mycroft static Char *subword __P((Char *, int, bool *));
82 1.5 mycroft static struct wordent
83 1.1 cgd *dosub __P((int, struct wordent *, bool));
84 1.1 cgd
85 1.1 cgd /*
86 1.1 cgd * Peekc is a peek character for getC, peekread for readc.
87 1.1 cgd * There is a subtlety here in many places... history routines
88 1.1 cgd * will read ahead and then insert stuff into the input stream.
89 1.1 cgd * If they push back a character then they must push it behind
90 1.1 cgd * the text substituted by the history substitution. On the other
91 1.1 cgd * hand in several places we need 2 peek characters. To make this
92 1.1 cgd * all work, the history routines read with getC, and make use both
93 1.1 cgd * of ungetC and unreadc. The key observation is that the state
94 1.1 cgd * of getC at the call of a history reference is such that calls
95 1.1 cgd * to getC from the history routines will always yield calls of
96 1.1 cgd * readc, unless this peeking is involved. That is to say that during
97 1.1 cgd * getexcl the variables lap, exclp, and exclnxt are all zero.
98 1.1 cgd *
99 1.1 cgd * Getdol invokes history substitution, hence the extra peek, peekd,
100 1.1 cgd * which it can ungetD to be before history substitutions.
101 1.1 cgd */
102 1.1 cgd static Char peekc = 0, peekd = 0;
103 1.1 cgd static Char peekread = 0;
104 1.1 cgd
105 1.1 cgd /* (Tail of) current word from ! subst */
106 1.1 cgd static Char *exclp = NULL;
107 1.1 cgd
108 1.1 cgd /* The rest of the ! subst words */
109 1.1 cgd static struct wordent *exclnxt = NULL;
110 1.1 cgd
111 1.1 cgd /* Count of remaining words in ! subst */
112 1.1 cgd static int exclc = 0;
113 1.1 cgd
114 1.1 cgd /* "Globp" for alias resubstitution */
115 1.5 mycroft Char *alvecp = NULL;
116 1.5 mycroft int aret = F_SEEK;
117 1.1 cgd
118 1.1 cgd /*
119 1.1 cgd * Labuf implements a general buffer for lookahead during lexical operations.
120 1.1 cgd * Text which is to be placed in the input stream can be stuck here.
121 1.1 cgd * We stick parsed ahead $ constructs during initial input,
122 1.1 cgd * process id's from `$$', and modified variable values (from qualifiers
123 1.1 cgd * during expansion in sh.dol.c) here.
124 1.1 cgd */
125 1.1 cgd static Char labuf[BUFSIZ];
126 1.1 cgd
127 1.1 cgd /*
128 1.1 cgd * Lex returns to its caller not only a wordlist (as a "var" parameter)
129 1.1 cgd * but also whether a history substitution occurred. This is used in
130 1.1 cgd * the main (process) routine to determine whether to echo, and also
131 1.1 cgd * when called by the alias routine to determine whether to keep the
132 1.1 cgd * argument list.
133 1.1 cgd */
134 1.1 cgd static bool hadhist = 0;
135 1.1 cgd
136 1.1 cgd /*
137 1.1 cgd * Avoid alias expansion recursion via \!#
138 1.1 cgd */
139 1.1 cgd int hleft;
140 1.1 cgd
141 1.1 cgd static Char getCtmp;
142 1.1 cgd
143 1.1 cgd #define getC(f) ((getCtmp = peekc) ? (peekc = 0, getCtmp) : getC1(f))
144 1.1 cgd #define ungetC(c) peekc = c
145 1.1 cgd #define ungetD(c) peekd = c
146 1.1 cgd
147 1.1 cgd int
148 1.1 cgd lex(hp)
149 1.1 cgd register struct wordent *hp;
150 1.1 cgd {
151 1.1 cgd register struct wordent *wdp;
152 1.1 cgd int c;
153 1.1 cgd
154 1.5 mycroft btell(&lineloc);
155 1.1 cgd hp->next = hp->prev = hp;
156 1.1 cgd hp->word = STRNULL;
157 1.5 mycroft hadhist = 0;
158 1.1 cgd do
159 1.1 cgd c = readc(0);
160 1.1 cgd while (c == ' ' || c == '\t');
161 1.1 cgd if (c == HISTSUB && intty)
162 1.1 cgd /* ^lef^rit from tty is short !:s^lef^rit */
163 1.1 cgd getexcl(c);
164 1.1 cgd else
165 1.1 cgd unreadc(c);
166 1.1 cgd wdp = hp;
167 1.1 cgd /*
168 1.1 cgd * The following loop is written so that the links needed by freelex will
169 1.1 cgd * be ready and rarin to go even if it is interrupted.
170 1.1 cgd */
171 1.1 cgd do {
172 1.1 cgd register struct wordent *new;
173 1.1 cgd
174 1.1 cgd new = (struct wordent *) xmalloc((size_t) sizeof(*wdp));
175 1.1 cgd new->word = 0;
176 1.1 cgd new->prev = wdp;
177 1.1 cgd new->next = hp;
178 1.1 cgd wdp->next = new;
179 1.1 cgd wdp = new;
180 1.1 cgd wdp->word = word();
181 1.1 cgd } while (wdp->word[0] != '\n');
182 1.1 cgd hp->prev = wdp;
183 1.1 cgd return (hadhist);
184 1.1 cgd }
185 1.1 cgd
186 1.1 cgd void
187 1.5 mycroft prlex(fp, sp0)
188 1.5 mycroft FILE *fp;
189 1.1 cgd struct wordent *sp0;
190 1.1 cgd {
191 1.1 cgd register struct wordent *sp = sp0->next;
192 1.1 cgd
193 1.1 cgd for (;;) {
194 1.5 mycroft (void) fprintf(fp, "%s", vis_str(sp->word));
195 1.1 cgd sp = sp->next;
196 1.1 cgd if (sp == sp0)
197 1.1 cgd break;
198 1.1 cgd if (sp->word[0] != '\n')
199 1.5 mycroft (void) fputc(' ', fp);
200 1.1 cgd }
201 1.1 cgd }
202 1.1 cgd
203 1.1 cgd void
204 1.1 cgd copylex(hp, fp)
205 1.1 cgd register struct wordent *hp;
206 1.1 cgd register struct wordent *fp;
207 1.1 cgd {
208 1.1 cgd register struct wordent *wdp;
209 1.1 cgd
210 1.1 cgd wdp = hp;
211 1.1 cgd fp = fp->next;
212 1.1 cgd do {
213 1.1 cgd register struct wordent *new;
214 1.1 cgd
215 1.1 cgd new = (struct wordent *) xmalloc((size_t) sizeof(*wdp));
216 1.1 cgd new->prev = wdp;
217 1.1 cgd new->next = hp;
218 1.1 cgd wdp->next = new;
219 1.1 cgd wdp = new;
220 1.1 cgd wdp->word = Strsave(fp->word);
221 1.1 cgd fp = fp->next;
222 1.1 cgd } while (wdp->word[0] != '\n');
223 1.1 cgd hp->prev = wdp;
224 1.1 cgd }
225 1.1 cgd
226 1.1 cgd void
227 1.1 cgd freelex(vp)
228 1.1 cgd register struct wordent *vp;
229 1.1 cgd {
230 1.1 cgd register struct wordent *fp;
231 1.1 cgd
232 1.1 cgd while (vp->next != vp) {
233 1.1 cgd fp = vp->next;
234 1.1 cgd vp->next = fp->next;
235 1.1 cgd xfree((ptr_t) fp->word);
236 1.1 cgd xfree((ptr_t) fp);
237 1.1 cgd }
238 1.1 cgd vp->prev = vp;
239 1.1 cgd }
240 1.1 cgd
241 1.1 cgd static Char *
242 1.1 cgd word()
243 1.1 cgd {
244 1.1 cgd register Char c, c1;
245 1.1 cgd register Char *wp;
246 1.1 cgd Char wbuf[BUFSIZ];
247 1.1 cgd register bool dolflg;
248 1.1 cgd register int i;
249 1.1 cgd
250 1.1 cgd wp = wbuf;
251 1.1 cgd i = BUFSIZ - 4;
252 1.1 cgd loop:
253 1.5 mycroft while ((c = getC(DOALL)) == ' ' || c == '\t')
254 1.5 mycroft continue;
255 1.1 cgd if (cmap(c, _META | _ESC))
256 1.1 cgd switch (c) {
257 1.1 cgd case '&':
258 1.1 cgd case '|':
259 1.1 cgd case '<':
260 1.1 cgd case '>':
261 1.1 cgd *wp++ = c;
262 1.1 cgd c1 = getC(DOALL);
263 1.1 cgd if (c1 == c)
264 1.1 cgd *wp++ = c1;
265 1.1 cgd else
266 1.1 cgd ungetC(c1);
267 1.1 cgd goto ret;
268 1.1 cgd
269 1.1 cgd case '#':
270 1.1 cgd if (intty)
271 1.1 cgd break;
272 1.1 cgd c = 0;
273 1.1 cgd do {
274 1.1 cgd c1 = c;
275 1.1 cgd c = getC(0);
276 1.1 cgd } while (c != '\n');
277 1.1 cgd if (c1 == '\\')
278 1.1 cgd goto loop;
279 1.1 cgd /* fall into ... */
280 1.1 cgd
281 1.1 cgd case ';':
282 1.1 cgd case '(':
283 1.1 cgd case ')':
284 1.1 cgd case '\n':
285 1.1 cgd *wp++ = c;
286 1.1 cgd goto ret;
287 1.1 cgd
288 1.1 cgd case '\\':
289 1.1 cgd c = getC(0);
290 1.1 cgd if (c == '\n') {
291 1.1 cgd if (onelflg == 1)
292 1.1 cgd onelflg = 2;
293 1.1 cgd goto loop;
294 1.1 cgd }
295 1.1 cgd if (c != HIST)
296 1.1 cgd *wp++ = '\\', --i;
297 1.1 cgd c |= QUOTE;
298 1.1 cgd }
299 1.1 cgd c1 = 0;
300 1.1 cgd dolflg = DOALL;
301 1.1 cgd for (;;) {
302 1.1 cgd if (c1) {
303 1.1 cgd if (c == c1) {
304 1.1 cgd c1 = 0;
305 1.1 cgd dolflg = DOALL;
306 1.1 cgd }
307 1.1 cgd else if (c == '\\') {
308 1.1 cgd c = getC(0);
309 1.1 cgd if (c == HIST)
310 1.1 cgd c |= QUOTE;
311 1.1 cgd else {
312 1.1 cgd if (c == '\n')
313 1.1 cgd /*
314 1.1 cgd * if (c1 == '`') c = ' '; else
315 1.1 cgd */
316 1.1 cgd c |= QUOTE;
317 1.1 cgd ungetC(c);
318 1.1 cgd c = '\\';
319 1.1 cgd }
320 1.1 cgd }
321 1.1 cgd else if (c == '\n') {
322 1.1 cgd seterror(ERR_UNMATCHED, c1);
323 1.1 cgd ungetC(c);
324 1.1 cgd break;
325 1.1 cgd }
326 1.1 cgd }
327 1.5 mycroft else if (cmap(c, _META | _QF | _QB | _ESC)) {
328 1.1 cgd if (c == '\\') {
329 1.1 cgd c = getC(0);
330 1.1 cgd if (c == '\n') {
331 1.1 cgd if (onelflg == 1)
332 1.1 cgd onelflg = 2;
333 1.1 cgd break;
334 1.1 cgd }
335 1.1 cgd if (c != HIST)
336 1.1 cgd *wp++ = '\\', --i;
337 1.1 cgd c |= QUOTE;
338 1.1 cgd }
339 1.5 mycroft else if (cmap(c, _QF | _QB)) { /* '"` */
340 1.1 cgd c1 = c;
341 1.1 cgd dolflg = c == '"' ? DOALL : DOEXCL;
342 1.1 cgd }
343 1.1 cgd else if (c != '#' || !intty) {
344 1.1 cgd ungetC(c);
345 1.1 cgd break;
346 1.1 cgd }
347 1.1 cgd }
348 1.1 cgd if (--i > 0) {
349 1.1 cgd *wp++ = c;
350 1.1 cgd c = getC(dolflg);
351 1.1 cgd }
352 1.1 cgd else {
353 1.1 cgd seterror(ERR_WTOOLONG);
354 1.1 cgd wp = &wbuf[1];
355 1.1 cgd break;
356 1.1 cgd }
357 1.1 cgd }
358 1.1 cgd ret:
359 1.1 cgd *wp = 0;
360 1.1 cgd return (Strsave(wbuf));
361 1.1 cgd }
362 1.1 cgd
363 1.1 cgd static int
364 1.1 cgd getC1(flag)
365 1.1 cgd register int flag;
366 1.1 cgd {
367 1.1 cgd register Char c;
368 1.1 cgd
369 1.1 cgd while (1) {
370 1.5 mycroft if ((c = peekc) != '\0') {
371 1.1 cgd peekc = 0;
372 1.1 cgd return (c);
373 1.1 cgd }
374 1.1 cgd if (lap) {
375 1.1 cgd if ((c = *lap++) == 0)
376 1.1 cgd lap = 0;
377 1.1 cgd else {
378 1.5 mycroft if (cmap(c, _META | _QF | _QB))
379 1.1 cgd c |= QUOTE;
380 1.1 cgd return (c);
381 1.1 cgd }
382 1.1 cgd }
383 1.5 mycroft if ((c = peekd) != '\0') {
384 1.1 cgd peekd = 0;
385 1.1 cgd return (c);
386 1.1 cgd }
387 1.1 cgd if (exclp) {
388 1.5 mycroft if ((c = *exclp++) != '\0')
389 1.1 cgd return (c);
390 1.1 cgd if (exclnxt && --exclc >= 0) {
391 1.1 cgd exclnxt = exclnxt->next;
392 1.1 cgd setexclp(exclnxt->word);
393 1.1 cgd return (' ');
394 1.1 cgd }
395 1.1 cgd exclp = 0;
396 1.1 cgd exclnxt = 0;
397 1.1 cgd }
398 1.1 cgd if (exclnxt) {
399 1.1 cgd exclnxt = exclnxt->next;
400 1.1 cgd if (--exclc < 0)
401 1.1 cgd exclnxt = 0;
402 1.1 cgd else
403 1.1 cgd setexclp(exclnxt->word);
404 1.1 cgd continue;
405 1.1 cgd }
406 1.1 cgd c = readc(0);
407 1.1 cgd if (c == '$' && (flag & DODOL)) {
408 1.1 cgd getdol();
409 1.1 cgd continue;
410 1.1 cgd }
411 1.1 cgd if (c == HIST && (flag & DOEXCL)) {
412 1.1 cgd getexcl(0);
413 1.1 cgd continue;
414 1.1 cgd }
415 1.1 cgd break;
416 1.1 cgd }
417 1.1 cgd return (c);
418 1.1 cgd }
419 1.1 cgd
420 1.1 cgd static void
421 1.1 cgd getdol()
422 1.1 cgd {
423 1.1 cgd register Char *np, *ep;
424 1.1 cgd Char name[4 * MAXVARLEN + 1];
425 1.1 cgd register int c;
426 1.1 cgd int sc;
427 1.1 cgd bool special = 0, toolong;
428 1.1 cgd
429 1.1 cgd np = name, *np++ = '$';
430 1.1 cgd c = sc = getC(DOEXCL);
431 1.1 cgd if (any("\t \n", c)) {
432 1.1 cgd ungetD(c);
433 1.1 cgd ungetC('$' | QUOTE);
434 1.1 cgd return;
435 1.1 cgd }
436 1.1 cgd if (c == '{')
437 1.1 cgd *np++ = c, c = getC(DOEXCL);
438 1.1 cgd if (c == '#' || c == '?')
439 1.1 cgd special++, *np++ = c, c = getC(DOEXCL);
440 1.1 cgd *np++ = c;
441 1.1 cgd switch (c) {
442 1.1 cgd
443 1.1 cgd case '<':
444 1.1 cgd case '$':
445 1.5 mycroft case '!':
446 1.1 cgd if (special)
447 1.1 cgd seterror(ERR_SPDOLLT);
448 1.1 cgd *np = 0;
449 1.1 cgd addla(name);
450 1.1 cgd return;
451 1.1 cgd
452 1.1 cgd case '\n':
453 1.1 cgd ungetD(c);
454 1.1 cgd np--;
455 1.1 cgd seterror(ERR_NEWLINE);
456 1.1 cgd *np = 0;
457 1.1 cgd addla(name);
458 1.1 cgd return;
459 1.1 cgd
460 1.1 cgd case '*':
461 1.1 cgd if (special)
462 1.1 cgd seterror(ERR_SPSTAR);
463 1.1 cgd *np = 0;
464 1.1 cgd addla(name);
465 1.1 cgd return;
466 1.1 cgd
467 1.1 cgd default:
468 1.1 cgd toolong = 0;
469 1.1 cgd if (Isdigit(c)) {
470 1.1 cgd #ifdef notdef
471 1.1 cgd /* let $?0 pass for now */
472 1.1 cgd if (special) {
473 1.1 cgd seterror(ERR_DIGIT);
474 1.1 cgd *np = 0;
475 1.1 cgd addla(name);
476 1.1 cgd return;
477 1.1 cgd }
478 1.1 cgd #endif
479 1.1 cgd /* we know that np < &name[4] */
480 1.1 cgd ep = &np[MAXVARLEN];
481 1.5 mycroft while ((c = getC(DOEXCL)) != '\0'){
482 1.1 cgd if (!Isdigit(c))
483 1.1 cgd break;
484 1.1 cgd if (np < ep)
485 1.1 cgd *np++ = c;
486 1.1 cgd else
487 1.1 cgd toolong = 1;
488 1.1 cgd }
489 1.1 cgd }
490 1.1 cgd else if (letter(c)) {
491 1.1 cgd /* we know that np < &name[4] */
492 1.1 cgd ep = &np[MAXVARLEN];
493 1.1 cgd toolong = 0;
494 1.5 mycroft while ((c = getC(DOEXCL)) != '\0') {
495 1.1 cgd /* Bugfix for ${v123x} from Chris Torek, DAS DEC-90. */
496 1.1 cgd if (!letter(c) && !Isdigit(c))
497 1.1 cgd break;
498 1.1 cgd if (np < ep)
499 1.1 cgd *np++ = c;
500 1.1 cgd else
501 1.1 cgd toolong = 1;
502 1.1 cgd }
503 1.1 cgd }
504 1.1 cgd else {
505 1.1 cgd *np = 0;
506 1.1 cgd seterror(ERR_VARILL);
507 1.1 cgd addla(name);
508 1.1 cgd return;
509 1.1 cgd }
510 1.1 cgd if (toolong) {
511 1.1 cgd seterror(ERR_VARTOOLONG);
512 1.1 cgd *np = 0;
513 1.1 cgd addla(name);
514 1.1 cgd return;
515 1.1 cgd }
516 1.1 cgd break;
517 1.1 cgd }
518 1.1 cgd if (c == '[') {
519 1.1 cgd *np++ = c;
520 1.1 cgd /*
521 1.1 cgd * Name up to here is a max of MAXVARLEN + 8.
522 1.1 cgd */
523 1.1 cgd ep = &np[2 * MAXVARLEN + 8];
524 1.1 cgd do {
525 1.1 cgd /*
526 1.1 cgd * Michael Greim: Allow $ expansion to take place in selector
527 1.1 cgd * expressions. (limits the number of characters returned)
528 1.1 cgd */
529 1.1 cgd c = getC(DOEXCL | DODOL);
530 1.1 cgd if (c == '\n') {
531 1.1 cgd ungetD(c);
532 1.1 cgd np--;
533 1.1 cgd seterror(ERR_NLINDEX);
534 1.1 cgd *np = 0;
535 1.1 cgd addla(name);
536 1.1 cgd return;
537 1.1 cgd }
538 1.1 cgd if (np < ep)
539 1.1 cgd *np++ = c;
540 1.1 cgd } while (c != ']');
541 1.1 cgd *np = '\0';
542 1.1 cgd if (np >= ep) {
543 1.1 cgd seterror(ERR_SELOVFL);
544 1.1 cgd addla(name);
545 1.1 cgd return;
546 1.1 cgd }
547 1.1 cgd c = getC(DOEXCL);
548 1.1 cgd }
549 1.1 cgd /*
550 1.1 cgd * Name up to here is a max of 2 * MAXVARLEN + 8.
551 1.1 cgd */
552 1.1 cgd if (c == ':') {
553 1.1 cgd /*
554 1.1 cgd * if the :g modifier is followed by a newline, then error right away!
555 1.1 cgd * -strike
556 1.1 cgd */
557 1.1 cgd
558 1.5 mycroft int gmodflag = 0, amodflag = 0;
559 1.1 cgd
560 1.5 mycroft do {
561 1.5 mycroft *np++ = c, c = getC(DOEXCL);
562 1.5 mycroft if (c == 'g' || c == 'a') {
563 1.5 mycroft if (c == 'g')
564 1.5 mycroft gmodflag++;
565 1.5 mycroft else
566 1.5 mycroft amodflag++;
567 1.5 mycroft *np++ = c; c = getC(DOEXCL);
568 1.5 mycroft }
569 1.5 mycroft if ((c == 'g' && !gmodflag) || (c == 'a' && !amodflag)) {
570 1.5 mycroft if (c == 'g')
571 1.5 mycroft gmodflag++;
572 1.5 mycroft else
573 1.5 mycroft amodflag++;
574 1.5 mycroft *np++ = c; c = getC(DOEXCL);
575 1.5 mycroft }
576 1.5 mycroft *np++ = c;
577 1.5 mycroft /* scan s// [eichin:19910926.0512EST] */
578 1.5 mycroft if (c == 's') {
579 1.5 mycroft int delimcnt = 2;
580 1.5 mycroft int delim = getC(0);
581 1.5 mycroft *np++ = delim;
582 1.5 mycroft
583 1.5 mycroft if (!delim || letter(delim)
584 1.5 mycroft || Isdigit(delim) || any(" \t\n", delim)) {
585 1.5 mycroft seterror(ERR_BADSUBST);
586 1.5 mycroft break;
587 1.5 mycroft }
588 1.5 mycroft while ((c = getC(0)) != (-1)) {
589 1.5 mycroft *np++ = c;
590 1.5 mycroft if(c == delim) delimcnt--;
591 1.5 mycroft if(!delimcnt) break;
592 1.5 mycroft }
593 1.5 mycroft if(delimcnt) {
594 1.5 mycroft seterror(ERR_BADSUBST);
595 1.5 mycroft break;
596 1.5 mycroft }
597 1.5 mycroft c = 's';
598 1.5 mycroft }
599 1.5 mycroft if (!any("htrqxes", c)) {
600 1.5 mycroft if ((amodflag || gmodflag) && c == '\n')
601 1.5 mycroft stderror(ERR_VARSYN); /* strike */
602 1.5 mycroft seterror(ERR_VARMOD, c);
603 1.5 mycroft *np = 0;
604 1.5 mycroft addla(name);
605 1.5 mycroft return;
606 1.5 mycroft }
607 1.1 cgd }
608 1.5 mycroft while ((c = getC(DOEXCL)) == ':');
609 1.5 mycroft ungetD(c);
610 1.1 cgd }
611 1.1 cgd else
612 1.1 cgd ungetD(c);
613 1.1 cgd if (sc == '{') {
614 1.1 cgd c = getC(DOEXCL);
615 1.1 cgd if (c != '}') {
616 1.1 cgd ungetD(c);
617 1.1 cgd seterror(ERR_MISSING, '}');
618 1.1 cgd *np = 0;
619 1.1 cgd addla(name);
620 1.1 cgd return;
621 1.1 cgd }
622 1.1 cgd *np++ = c;
623 1.1 cgd }
624 1.1 cgd *np = 0;
625 1.1 cgd addla(name);
626 1.1 cgd return;
627 1.1 cgd }
628 1.1 cgd
629 1.1 cgd void
630 1.1 cgd addla(cp)
631 1.1 cgd Char *cp;
632 1.1 cgd {
633 1.1 cgd Char buf[BUFSIZ];
634 1.1 cgd
635 1.1 cgd if (Strlen(cp) + (lap ? Strlen(lap) : 0) >=
636 1.1 cgd (sizeof(labuf) - 4) / sizeof(Char)) {
637 1.1 cgd seterror(ERR_EXPOVFL);
638 1.1 cgd return;
639 1.1 cgd }
640 1.1 cgd if (lap)
641 1.1 cgd (void) Strcpy(buf, lap);
642 1.1 cgd (void) Strcpy(labuf, cp);
643 1.1 cgd if (lap)
644 1.1 cgd (void) Strcat(labuf, buf);
645 1.1 cgd lap = labuf;
646 1.1 cgd }
647 1.1 cgd
648 1.1 cgd static Char lhsb[32];
649 1.1 cgd static Char slhs[32];
650 1.1 cgd static Char rhsb[64];
651 1.1 cgd static int quesarg;
652 1.1 cgd
653 1.1 cgd static void
654 1.1 cgd getexcl(sc)
655 1.1 cgd int sc;
656 1.1 cgd {
657 1.1 cgd register struct wordent *hp, *ip;
658 1.1 cgd int left, right, dol;
659 1.1 cgd register int c;
660 1.1 cgd
661 1.1 cgd if (sc == 0) {
662 1.1 cgd sc = getC(0);
663 1.1 cgd if (sc != '{') {
664 1.1 cgd ungetC(sc);
665 1.1 cgd sc = 0;
666 1.1 cgd }
667 1.1 cgd }
668 1.1 cgd quesarg = -1;
669 1.1 cgd lastev = eventno;
670 1.1 cgd hp = gethent(sc);
671 1.1 cgd if (hp == 0)
672 1.1 cgd return;
673 1.1 cgd hadhist = 1;
674 1.1 cgd dol = 0;
675 1.1 cgd if (hp == alhistp)
676 1.1 cgd for (ip = hp->next->next; ip != alhistt; ip = ip->next)
677 1.1 cgd dol++;
678 1.1 cgd else
679 1.1 cgd for (ip = hp->next->next; ip != hp->prev; ip = ip->next)
680 1.1 cgd dol++;
681 1.1 cgd left = 0, right = dol;
682 1.1 cgd if (sc == HISTSUB) {
683 1.1 cgd ungetC('s'), unreadc(HISTSUB), c = ':';
684 1.1 cgd goto subst;
685 1.1 cgd }
686 1.1 cgd c = getC(0);
687 1.1 cgd if (!any(":^$*-%", c))
688 1.1 cgd goto subst;
689 1.1 cgd left = right = -1;
690 1.1 cgd if (c == ':') {
691 1.1 cgd c = getC(0);
692 1.1 cgd unreadc(c);
693 1.1 cgd if (letter(c) || c == '&') {
694 1.1 cgd c = ':';
695 1.1 cgd left = 0, right = dol;
696 1.1 cgd goto subst;
697 1.1 cgd }
698 1.1 cgd }
699 1.1 cgd else
700 1.1 cgd ungetC(c);
701 1.1 cgd if (!getsel(&left, &right, dol))
702 1.1 cgd return;
703 1.1 cgd c = getC(0);
704 1.1 cgd if (c == '*')
705 1.1 cgd ungetC(c), c = '-';
706 1.1 cgd if (c == '-') {
707 1.1 cgd if (!getsel(&left, &right, dol))
708 1.1 cgd return;
709 1.1 cgd c = getC(0);
710 1.1 cgd }
711 1.1 cgd subst:
712 1.1 cgd exclc = right - left + 1;
713 1.1 cgd while (--left >= 0)
714 1.1 cgd hp = hp->next;
715 1.1 cgd if (sc == HISTSUB || c == ':') {
716 1.1 cgd do {
717 1.1 cgd hp = getsub(hp);
718 1.1 cgd c = getC(0);
719 1.1 cgd } while (c == ':');
720 1.1 cgd }
721 1.1 cgd unreadc(c);
722 1.1 cgd if (sc == '{') {
723 1.1 cgd c = getC(0);
724 1.1 cgd if (c != '}')
725 1.1 cgd seterror(ERR_BADBANG);
726 1.1 cgd }
727 1.1 cgd exclnxt = hp;
728 1.1 cgd }
729 1.1 cgd
730 1.1 cgd static struct wordent *
731 1.1 cgd getsub(en)
732 1.1 cgd struct wordent *en;
733 1.1 cgd {
734 1.1 cgd register Char *cp;
735 1.1 cgd int delim;
736 1.1 cgd register int c;
737 1.1 cgd int sc;
738 1.5 mycroft bool global;
739 1.1 cgd Char orhsb[sizeof(rhsb) / sizeof(Char)];
740 1.1 cgd
741 1.5 mycroft do {
742 1.5 mycroft exclnxt = 0;
743 1.5 mycroft global = 0;
744 1.5 mycroft sc = c = getC(0);
745 1.5 mycroft if (c == 'g' || c == 'a') {
746 1.5 mycroft global |= (c == 'g') ? 1 : 2;
747 1.5 mycroft sc = c = getC(0);
748 1.5 mycroft }
749 1.5 mycroft if (((c =='g') && !(global & 1)) || ((c == 'a') && !(global & 2))) {
750 1.5 mycroft global |= (c == 'g') ? 1 : 2;
751 1.5 mycroft sc = c = getC(0);
752 1.5 mycroft }
753 1.1 cgd
754 1.5 mycroft switch (c) {
755 1.5 mycroft case 'p':
756 1.5 mycroft justpr++;
757 1.5 mycroft return (en);
758 1.1 cgd
759 1.5 mycroft case 'x':
760 1.5 mycroft case 'q':
761 1.5 mycroft global |= 1;
762 1.1 cgd
763 1.5 mycroft /* fall into ... */
764 1.1 cgd
765 1.5 mycroft case 'h':
766 1.5 mycroft case 'r':
767 1.5 mycroft case 't':
768 1.5 mycroft case 'e':
769 1.5 mycroft break;
770 1.1 cgd
771 1.5 mycroft case '&':
772 1.5 mycroft if (slhs[0] == 0) {
773 1.5 mycroft seterror(ERR_NOSUBST);
774 1.5 mycroft return (en);
775 1.5 mycroft }
776 1.5 mycroft (void) Strcpy(lhsb, slhs);
777 1.5 mycroft break;
778 1.1 cgd
779 1.1 cgd #ifdef notdef
780 1.5 mycroft case '~':
781 1.5 mycroft if (lhsb[0] == 0)
782 1.5 mycroft goto badlhs;
783 1.5 mycroft break;
784 1.1 cgd #endif
785 1.1 cgd
786 1.5 mycroft case 's':
787 1.5 mycroft delim = getC(0);
788 1.5 mycroft if (letter(delim) || Isdigit(delim) || any(" \t\n", delim)) {
789 1.5 mycroft unreadc(delim);
790 1.1 cgd lhsb[0] = 0;
791 1.1 cgd seterror(ERR_BADSUBST);
792 1.1 cgd return (en);
793 1.1 cgd }
794 1.5 mycroft cp = lhsb;
795 1.5 mycroft for (;;) {
796 1.1 cgd c = getC(0);
797 1.5 mycroft if (c == '\n') {
798 1.5 mycroft unreadc(c);
799 1.5 mycroft break;
800 1.5 mycroft }
801 1.5 mycroft if (c == delim)
802 1.5 mycroft break;
803 1.5 mycroft if (cp > &lhsb[sizeof(lhsb) / sizeof(Char) - 2]) {
804 1.5 mycroft lhsb[0] = 0;
805 1.5 mycroft seterror(ERR_BADSUBST);
806 1.5 mycroft return (en);
807 1.5 mycroft }
808 1.5 mycroft if (c == '\\') {
809 1.5 mycroft c = getC(0);
810 1.5 mycroft if (c != delim && c != '\\')
811 1.5 mycroft *cp++ = '\\';
812 1.5 mycroft }
813 1.5 mycroft *cp++ = c;
814 1.1 cgd }
815 1.5 mycroft if (cp != lhsb)
816 1.5 mycroft *cp++ = 0;
817 1.5 mycroft else if (lhsb[0] == 0) {
818 1.5 mycroft seterror(ERR_LHS);
819 1.5 mycroft return (en);
820 1.1 cgd }
821 1.5 mycroft cp = rhsb;
822 1.5 mycroft (void) Strcpy(orhsb, cp);
823 1.5 mycroft for (;;) {
824 1.5 mycroft c = getC(0);
825 1.5 mycroft if (c == '\n') {
826 1.5 mycroft unreadc(c);
827 1.5 mycroft break;
828 1.5 mycroft }
829 1.5 mycroft if (c == delim)
830 1.5 mycroft break;
831 1.1 cgd #ifdef notdef
832 1.5 mycroft if (c == '~') {
833 1.5 mycroft if (&cp[Strlen(orhsb)] > &rhsb[sizeof(rhsb) /
834 1.5 mycroft sizeof(Char) - 2])
835 1.5 mycroft goto toorhs;
836 1.5 mycroft (void) Strcpy(cp, orhsb);
837 1.5 mycroft cp = Strend(cp);
838 1.5 mycroft continue;
839 1.5 mycroft }
840 1.1 cgd #endif
841 1.5 mycroft if (cp > &rhsb[sizeof(rhsb) / sizeof(Char) - 2]) {
842 1.5 mycroft seterror(ERR_RHSLONG);
843 1.5 mycroft return (en);
844 1.5 mycroft }
845 1.5 mycroft if (c == '\\') {
846 1.5 mycroft c = getC(0);
847 1.5 mycroft if (c != delim /* && c != '~' */ )
848 1.5 mycroft *cp++ = '\\';
849 1.5 mycroft }
850 1.5 mycroft *cp++ = c;
851 1.1 cgd }
852 1.5 mycroft *cp++ = 0;
853 1.5 mycroft break;
854 1.5 mycroft
855 1.5 mycroft default:
856 1.5 mycroft if (c == '\n')
857 1.5 mycroft unreadc(c);
858 1.5 mycroft seterror(ERR_BADBANGMOD, c);
859 1.5 mycroft return (en);
860 1.1 cgd }
861 1.5 mycroft (void) Strcpy(slhs, lhsb);
862 1.5 mycroft if (exclc)
863 1.5 mycroft en = dosub(sc, en, global);
864 1.1 cgd }
865 1.5 mycroft while ((c = getC(0)) == ':');
866 1.5 mycroft unreadc(c);
867 1.1 cgd return (en);
868 1.1 cgd }
869 1.1 cgd
870 1.1 cgd static struct wordent *
871 1.1 cgd dosub(sc, en, global)
872 1.1 cgd int sc;
873 1.1 cgd struct wordent *en;
874 1.1 cgd bool global;
875 1.1 cgd {
876 1.1 cgd struct wordent lexi;
877 1.5 mycroft bool didsub = 0, didone = 0;
878 1.1 cgd struct wordent *hp = &lexi;
879 1.1 cgd register struct wordent *wdp;
880 1.1 cgd register int i = exclc;
881 1.1 cgd
882 1.1 cgd wdp = hp;
883 1.1 cgd while (--i >= 0) {
884 1.5 mycroft register struct wordent *new =
885 1.5 mycroft (struct wordent *) xcalloc(1, sizeof *wdp);
886 1.1 cgd
887 1.1 cgd new->word = 0;
888 1.1 cgd new->prev = wdp;
889 1.1 cgd new->next = hp;
890 1.1 cgd wdp->next = new;
891 1.1 cgd wdp = new;
892 1.1 cgd en = en->next;
893 1.5 mycroft if (en->word) {
894 1.5 mycroft Char *tword, *otword;
895 1.5 mycroft
896 1.5 mycroft if ((global & 1) || didsub == 0) {
897 1.5 mycroft tword = subword(en->word, sc, &didone);
898 1.5 mycroft if (didone)
899 1.5 mycroft didsub = 1;
900 1.5 mycroft if (global & 2) {
901 1.5 mycroft while (didone && tword != STRNULL) {
902 1.5 mycroft otword = tword;
903 1.5 mycroft tword = subword(otword, sc, &didone);
904 1.5 mycroft if (Strcmp(tword, otword) == 0) {
905 1.5 mycroft xfree((ptr_t) otword);
906 1.5 mycroft break;
907 1.5 mycroft }
908 1.5 mycroft else
909 1.5 mycroft xfree((ptr_t) otword);
910 1.5 mycroft }
911 1.5 mycroft }
912 1.5 mycroft }
913 1.5 mycroft else
914 1.5 mycroft tword = Strsave(en->word);
915 1.5 mycroft wdp->word = tword;
916 1.5 mycroft }
917 1.1 cgd }
918 1.1 cgd if (didsub == 0)
919 1.1 cgd seterror(ERR_MODFAIL);
920 1.1 cgd hp->prev = wdp;
921 1.1 cgd return (&enthist(-1000, &lexi, 0)->Hlex);
922 1.1 cgd }
923 1.1 cgd
924 1.1 cgd static Char *
925 1.1 cgd subword(cp, type, adid)
926 1.1 cgd Char *cp;
927 1.1 cgd int type;
928 1.1 cgd bool *adid;
929 1.1 cgd {
930 1.1 cgd Char wbuf[BUFSIZ];
931 1.1 cgd register Char *wp, *mp, *np;
932 1.1 cgd register int i;
933 1.1 cgd
934 1.5 mycroft *adid = 0;
935 1.1 cgd switch (type) {
936 1.1 cgd
937 1.1 cgd case 'r':
938 1.1 cgd case 'e':
939 1.1 cgd case 'h':
940 1.1 cgd case 't':
941 1.1 cgd case 'q':
942 1.1 cgd case 'x':
943 1.1 cgd wp = domod(cp, type);
944 1.1 cgd if (wp == 0)
945 1.1 cgd return (Strsave(cp));
946 1.1 cgd *adid = 1;
947 1.1 cgd return (wp);
948 1.1 cgd
949 1.1 cgd default:
950 1.1 cgd wp = wbuf;
951 1.1 cgd i = BUFSIZ - 4;
952 1.1 cgd for (mp = cp; *mp; mp++)
953 1.1 cgd if (matchs(mp, lhsb)) {
954 1.1 cgd for (np = cp; np < mp;)
955 1.1 cgd *wp++ = *np++, --i;
956 1.1 cgd for (np = rhsb; *np; np++)
957 1.1 cgd switch (*np) {
958 1.1 cgd
959 1.1 cgd case '\\':
960 1.1 cgd if (np[1] == '&')
961 1.1 cgd np++;
962 1.1 cgd /* fall into ... */
963 1.1 cgd
964 1.1 cgd default:
965 1.1 cgd if (--i < 0) {
966 1.1 cgd seterror(ERR_SUBOVFL);
967 1.1 cgd return (STRNULL);
968 1.1 cgd }
969 1.1 cgd *wp++ = *np;
970 1.1 cgd continue;
971 1.1 cgd
972 1.1 cgd case '&':
973 1.1 cgd i -= Strlen(lhsb);
974 1.1 cgd if (i < 0) {
975 1.1 cgd seterror(ERR_SUBOVFL);
976 1.1 cgd return (STRNULL);
977 1.1 cgd }
978 1.1 cgd *wp = 0;
979 1.1 cgd (void) Strcat(wp, lhsb);
980 1.1 cgd wp = Strend(wp);
981 1.1 cgd continue;
982 1.1 cgd }
983 1.1 cgd mp += Strlen(lhsb);
984 1.1 cgd i -= Strlen(mp);
985 1.1 cgd if (i < 0) {
986 1.1 cgd seterror(ERR_SUBOVFL);
987 1.1 cgd return (STRNULL);
988 1.1 cgd }
989 1.1 cgd *wp = 0;
990 1.1 cgd (void) Strcat(wp, mp);
991 1.1 cgd *adid = 1;
992 1.1 cgd return (Strsave(wbuf));
993 1.1 cgd }
994 1.1 cgd return (Strsave(cp));
995 1.1 cgd }
996 1.1 cgd }
997 1.1 cgd
998 1.1 cgd Char *
999 1.1 cgd domod(cp, type)
1000 1.1 cgd Char *cp;
1001 1.1 cgd int type;
1002 1.1 cgd {
1003 1.1 cgd register Char *wp, *xp;
1004 1.1 cgd register int c;
1005 1.1 cgd
1006 1.1 cgd switch (type) {
1007 1.1 cgd
1008 1.1 cgd case 'x':
1009 1.1 cgd case 'q':
1010 1.1 cgd wp = Strsave(cp);
1011 1.5 mycroft for (xp = wp; (c = *xp) != '\0'; xp++)
1012 1.1 cgd if ((c != ' ' && c != '\t') || type == 'q')
1013 1.1 cgd *xp |= QUOTE;
1014 1.1 cgd return (wp);
1015 1.1 cgd
1016 1.1 cgd case 'h':
1017 1.1 cgd case 't':
1018 1.1 cgd if (!any(short2str(cp), '/'))
1019 1.1 cgd return (type == 't' ? Strsave(cp) : 0);
1020 1.1 cgd wp = Strend(cp);
1021 1.1 cgd while (*--wp != '/')
1022 1.1 cgd continue;
1023 1.1 cgd if (type == 'h')
1024 1.1 cgd xp = Strsave(cp), xp[wp - cp] = 0;
1025 1.1 cgd else
1026 1.1 cgd xp = Strsave(wp + 1);
1027 1.1 cgd return (xp);
1028 1.1 cgd
1029 1.1 cgd case 'e':
1030 1.1 cgd case 'r':
1031 1.1 cgd wp = Strend(cp);
1032 1.1 cgd for (wp--; wp >= cp && *wp != '/'; wp--)
1033 1.1 cgd if (*wp == '.') {
1034 1.1 cgd if (type == 'e')
1035 1.1 cgd xp = Strsave(wp + 1);
1036 1.1 cgd else
1037 1.1 cgd xp = Strsave(cp), xp[wp - cp] = 0;
1038 1.1 cgd return (xp);
1039 1.1 cgd }
1040 1.1 cgd return (Strsave(type == 'e' ? STRNULL : cp));
1041 1.5 mycroft default:
1042 1.5 mycroft break;
1043 1.1 cgd }
1044 1.1 cgd return (0);
1045 1.1 cgd }
1046 1.1 cgd
1047 1.1 cgd static int
1048 1.1 cgd matchs(str, pat)
1049 1.1 cgd register Char *str, *pat;
1050 1.1 cgd {
1051 1.1 cgd while (*str && *pat && *str == *pat)
1052 1.1 cgd str++, pat++;
1053 1.1 cgd return (*pat == 0);
1054 1.1 cgd }
1055 1.1 cgd
1056 1.1 cgd static int
1057 1.1 cgd getsel(al, ar, dol)
1058 1.1 cgd register int *al, *ar;
1059 1.1 cgd int dol;
1060 1.1 cgd {
1061 1.1 cgd register int c = getC(0);
1062 1.1 cgd register int i;
1063 1.1 cgd bool first = *al < 0;
1064 1.1 cgd
1065 1.1 cgd switch (c) {
1066 1.1 cgd
1067 1.1 cgd case '%':
1068 1.1 cgd if (quesarg == -1) {
1069 1.1 cgd seterror(ERR_BADBANGARG);
1070 1.1 cgd return (0);
1071 1.1 cgd }
1072 1.1 cgd if (*al < 0)
1073 1.1 cgd *al = quesarg;
1074 1.1 cgd *ar = quesarg;
1075 1.1 cgd break;
1076 1.1 cgd
1077 1.1 cgd case '-':
1078 1.1 cgd if (*al < 0) {
1079 1.1 cgd *al = 0;
1080 1.1 cgd *ar = dol - 1;
1081 1.1 cgd unreadc(c);
1082 1.1 cgd }
1083 1.1 cgd return (1);
1084 1.1 cgd
1085 1.1 cgd case '^':
1086 1.1 cgd if (*al < 0)
1087 1.1 cgd *al = 1;
1088 1.1 cgd *ar = 1;
1089 1.1 cgd break;
1090 1.1 cgd
1091 1.1 cgd case '$':
1092 1.1 cgd if (*al < 0)
1093 1.1 cgd *al = dol;
1094 1.1 cgd *ar = dol;
1095 1.1 cgd break;
1096 1.1 cgd
1097 1.1 cgd case '*':
1098 1.1 cgd if (*al < 0)
1099 1.1 cgd *al = 1;
1100 1.1 cgd *ar = dol;
1101 1.1 cgd if (*ar < *al) {
1102 1.1 cgd *ar = 0;
1103 1.1 cgd *al = 1;
1104 1.1 cgd return (1);
1105 1.1 cgd }
1106 1.1 cgd break;
1107 1.1 cgd
1108 1.1 cgd default:
1109 1.1 cgd if (Isdigit(c)) {
1110 1.1 cgd i = 0;
1111 1.1 cgd while (Isdigit(c)) {
1112 1.1 cgd i = i * 10 + c - '0';
1113 1.1 cgd c = getC(0);
1114 1.1 cgd }
1115 1.1 cgd if (i < 0)
1116 1.1 cgd i = dol + 1;
1117 1.1 cgd if (*al < 0)
1118 1.1 cgd *al = i;
1119 1.1 cgd *ar = i;
1120 1.1 cgd }
1121 1.1 cgd else if (*al < 0)
1122 1.1 cgd *al = 0, *ar = dol;
1123 1.1 cgd else
1124 1.1 cgd *ar = dol - 1;
1125 1.1 cgd unreadc(c);
1126 1.1 cgd break;
1127 1.1 cgd }
1128 1.1 cgd if (first) {
1129 1.1 cgd c = getC(0);
1130 1.1 cgd unreadc(c);
1131 1.1 cgd if (any("-$*", c))
1132 1.1 cgd return (1);
1133 1.1 cgd }
1134 1.1 cgd if (*al > *ar || *ar > dol) {
1135 1.1 cgd seterror(ERR_BADBANGARG);
1136 1.1 cgd return (0);
1137 1.1 cgd }
1138 1.1 cgd return (1);
1139 1.1 cgd
1140 1.1 cgd }
1141 1.1 cgd
1142 1.1 cgd static struct wordent *
1143 1.1 cgd gethent(sc)
1144 1.1 cgd int sc;
1145 1.1 cgd {
1146 1.1 cgd register struct Hist *hp;
1147 1.1 cgd register Char *np;
1148 1.1 cgd register int c;
1149 1.1 cgd int event;
1150 1.1 cgd bool back = 0;
1151 1.1 cgd
1152 1.1 cgd c = sc == HISTSUB ? HIST : getC(0);
1153 1.1 cgd if (c == HIST) {
1154 1.1 cgd if (alhistp)
1155 1.1 cgd return (alhistp);
1156 1.1 cgd event = eventno;
1157 1.1 cgd }
1158 1.1 cgd else
1159 1.1 cgd switch (c) {
1160 1.1 cgd
1161 1.1 cgd case ':':
1162 1.1 cgd case '^':
1163 1.1 cgd case '$':
1164 1.1 cgd case '*':
1165 1.1 cgd case '%':
1166 1.1 cgd ungetC(c);
1167 1.1 cgd if (lastev == eventno && alhistp)
1168 1.1 cgd return (alhistp);
1169 1.1 cgd event = lastev;
1170 1.1 cgd break;
1171 1.1 cgd
1172 1.1 cgd case '#': /* !# is command being typed in (mrh) */
1173 1.1 cgd if (--hleft == 0) {
1174 1.1 cgd seterror(ERR_HISTLOOP);
1175 1.1 cgd return (0);
1176 1.1 cgd }
1177 1.1 cgd else
1178 1.1 cgd return (¶ml);
1179 1.1 cgd /* NOTREACHED */
1180 1.1 cgd
1181 1.1 cgd case '-':
1182 1.1 cgd back = 1;
1183 1.1 cgd c = getC(0);
1184 1.1 cgd /* FALLSTHROUGH */
1185 1.1 cgd
1186 1.1 cgd default:
1187 1.1 cgd if (any("(=~", c)) {
1188 1.1 cgd unreadc(c);
1189 1.1 cgd ungetC(HIST);
1190 1.1 cgd return (0);
1191 1.1 cgd }
1192 1.1 cgd np = lhsb;
1193 1.1 cgd event = 0;
1194 1.5 mycroft while (!cmap(c, _ESC | _META | _QF | _QB) && !any("${}:", c)) {
1195 1.1 cgd if (event != -1 && Isdigit(c))
1196 1.1 cgd event = event * 10 + c - '0';
1197 1.1 cgd else
1198 1.1 cgd event = -1;
1199 1.1 cgd if (np < &lhsb[sizeof(lhsb) / sizeof(Char) - 2])
1200 1.1 cgd *np++ = c;
1201 1.1 cgd c = getC(0);
1202 1.1 cgd }
1203 1.1 cgd unreadc(c);
1204 1.1 cgd if (np == lhsb) {
1205 1.1 cgd ungetC(HIST);
1206 1.1 cgd return (0);
1207 1.1 cgd }
1208 1.1 cgd *np++ = 0;
1209 1.1 cgd if (event != -1) {
1210 1.1 cgd /*
1211 1.1 cgd * History had only digits
1212 1.1 cgd */
1213 1.1 cgd if (back)
1214 1.1 cgd event = eventno + (alhistp == 0) - (event ? event : 0);
1215 1.1 cgd break;
1216 1.1 cgd }
1217 1.1 cgd hp = findev(lhsb, 0);
1218 1.1 cgd if (hp)
1219 1.1 cgd lastev = hp->Hnum;
1220 1.1 cgd return (&hp->Hlex);
1221 1.1 cgd
1222 1.1 cgd case '?':
1223 1.1 cgd np = lhsb;
1224 1.1 cgd for (;;) {
1225 1.1 cgd c = getC(0);
1226 1.1 cgd if (c == '\n') {
1227 1.1 cgd unreadc(c);
1228 1.1 cgd break;
1229 1.1 cgd }
1230 1.1 cgd if (c == '?')
1231 1.1 cgd break;
1232 1.1 cgd if (np < &lhsb[sizeof(lhsb) / sizeof(Char) - 2])
1233 1.1 cgd *np++ = c;
1234 1.1 cgd }
1235 1.1 cgd if (np == lhsb) {
1236 1.1 cgd if (lhsb[0] == 0) {
1237 1.1 cgd seterror(ERR_NOSEARCH);
1238 1.1 cgd return (0);
1239 1.1 cgd }
1240 1.1 cgd }
1241 1.1 cgd else
1242 1.1 cgd *np++ = 0;
1243 1.1 cgd hp = findev(lhsb, 1);
1244 1.1 cgd if (hp)
1245 1.1 cgd lastev = hp->Hnum;
1246 1.1 cgd return (&hp->Hlex);
1247 1.1 cgd }
1248 1.1 cgd
1249 1.1 cgd for (hp = Histlist.Hnext; hp; hp = hp->Hnext)
1250 1.1 cgd if (hp->Hnum == event) {
1251 1.1 cgd hp->Href = eventno;
1252 1.1 cgd lastev = hp->Hnum;
1253 1.1 cgd return (&hp->Hlex);
1254 1.1 cgd }
1255 1.1 cgd np = putn(event);
1256 1.5 mycroft seterror(ERR_NOEVENT, vis_str(np));
1257 1.1 cgd return (0);
1258 1.1 cgd }
1259 1.1 cgd
1260 1.1 cgd static struct Hist *
1261 1.1 cgd findev(cp, anyarg)
1262 1.1 cgd Char *cp;
1263 1.1 cgd bool anyarg;
1264 1.1 cgd {
1265 1.1 cgd register struct Hist *hp;
1266 1.1 cgd
1267 1.1 cgd for (hp = Histlist.Hnext; hp; hp = hp->Hnext) {
1268 1.1 cgd Char *dp;
1269 1.1 cgd register Char *p, *q;
1270 1.1 cgd register struct wordent *lp = hp->Hlex.next;
1271 1.1 cgd int argno = 0;
1272 1.1 cgd
1273 1.1 cgd /*
1274 1.1 cgd * The entries added by alias substitution don't have a newline but do
1275 1.1 cgd * have a negative event number. Savehist() trims off these entries,
1276 1.1 cgd * but it happens before alias expansion, too early to delete those
1277 1.1 cgd * from the previous command.
1278 1.1 cgd */
1279 1.1 cgd if (hp->Hnum < 0)
1280 1.1 cgd continue;
1281 1.1 cgd if (lp->word[0] == '\n')
1282 1.1 cgd continue;
1283 1.1 cgd if (!anyarg) {
1284 1.1 cgd p = cp;
1285 1.1 cgd q = lp->word;
1286 1.1 cgd do
1287 1.1 cgd if (!*p)
1288 1.1 cgd return (hp);
1289 1.1 cgd while (*p++ == *q++);
1290 1.1 cgd continue;
1291 1.1 cgd }
1292 1.1 cgd do {
1293 1.1 cgd for (dp = lp->word; *dp; dp++) {
1294 1.1 cgd p = cp;
1295 1.1 cgd q = dp;
1296 1.1 cgd do
1297 1.1 cgd if (!*p) {
1298 1.1 cgd quesarg = argno;
1299 1.1 cgd return (hp);
1300 1.1 cgd }
1301 1.1 cgd while (*p++ == *q++);
1302 1.1 cgd }
1303 1.1 cgd lp = lp->next;
1304 1.1 cgd argno++;
1305 1.1 cgd } while (lp->word[0] != '\n');
1306 1.1 cgd }
1307 1.5 mycroft seterror(ERR_NOEVENT, vis_str(cp));
1308 1.1 cgd return (0);
1309 1.1 cgd }
1310 1.1 cgd
1311 1.1 cgd
1312 1.1 cgd static void
1313 1.1 cgd setexclp(cp)
1314 1.1 cgd register Char *cp;
1315 1.1 cgd {
1316 1.1 cgd if (cp && cp[0] == '\n')
1317 1.1 cgd return;
1318 1.1 cgd exclp = cp;
1319 1.1 cgd }
1320 1.1 cgd
1321 1.1 cgd void
1322 1.1 cgd unreadc(c)
1323 1.1 cgd int c;
1324 1.1 cgd {
1325 1.1 cgd peekread = c;
1326 1.1 cgd }
1327 1.1 cgd
1328 1.1 cgd int
1329 1.1 cgd readc(wanteof)
1330 1.1 cgd bool wanteof;
1331 1.1 cgd {
1332 1.1 cgd register int c;
1333 1.1 cgd static sincereal;
1334 1.1 cgd
1335 1.5 mycroft aret = F_SEEK;
1336 1.5 mycroft if ((c = peekread) != '\0') {
1337 1.1 cgd peekread = 0;
1338 1.1 cgd return (c);
1339 1.1 cgd }
1340 1.1 cgd top:
1341 1.5 mycroft aret = F_SEEK;
1342 1.1 cgd if (alvecp) {
1343 1.5 mycroft aret = A_SEEK;
1344 1.5 mycroft if ((c = *alvecp++) != '\0')
1345 1.1 cgd return (c);
1346 1.5 mycroft if (alvec && *alvec) {
1347 1.5 mycroft alvecp = *alvec++;
1348 1.5 mycroft return (' ');
1349 1.5 mycroft }
1350 1.5 mycroft else {
1351 1.5 mycroft aret = F_SEEK;
1352 1.5 mycroft alvecp = NULL;
1353 1.5 mycroft return('\n');
1354 1.1 cgd }
1355 1.1 cgd }
1356 1.1 cgd if (alvec) {
1357 1.5 mycroft if ((alvecp = *alvec) != '\0') {
1358 1.1 cgd alvec++;
1359 1.1 cgd goto top;
1360 1.1 cgd }
1361 1.1 cgd /* Infinite source! */
1362 1.1 cgd return ('\n');
1363 1.1 cgd }
1364 1.1 cgd if (evalp) {
1365 1.5 mycroft aret = E_SEEK;
1366 1.5 mycroft if ((c = *evalp++) != '\0')
1367 1.1 cgd return (c);
1368 1.5 mycroft if (evalvec && *evalvec) {
1369 1.1 cgd evalp = *evalvec++;
1370 1.1 cgd return (' ');
1371 1.1 cgd }
1372 1.5 mycroft aret = F_SEEK;
1373 1.1 cgd evalp = 0;
1374 1.1 cgd }
1375 1.1 cgd if (evalvec) {
1376 1.1 cgd if (evalvec == (Char **) 1) {
1377 1.1 cgd doneinp = 1;
1378 1.1 cgd reset();
1379 1.1 cgd }
1380 1.5 mycroft if ((evalp = *evalvec) != '\0') {
1381 1.1 cgd evalvec++;
1382 1.1 cgd goto top;
1383 1.1 cgd }
1384 1.1 cgd evalvec = (Char **) 1;
1385 1.1 cgd return ('\n');
1386 1.1 cgd }
1387 1.1 cgd do {
1388 1.1 cgd if (arginp == (Char *) 1 || onelflg == 1) {
1389 1.1 cgd if (wanteof)
1390 1.1 cgd return (-1);
1391 1.1 cgd exitstat();
1392 1.1 cgd }
1393 1.1 cgd if (arginp) {
1394 1.1 cgd if ((c = *arginp++) == 0) {
1395 1.1 cgd arginp = (Char *) 1;
1396 1.1 cgd return ('\n');
1397 1.1 cgd }
1398 1.1 cgd return (c);
1399 1.1 cgd }
1400 1.1 cgd reread:
1401 1.1 cgd c = bgetc();
1402 1.1 cgd if (c < 0) {
1403 1.1 cgd struct termios tty;
1404 1.1 cgd if (wanteof)
1405 1.1 cgd return (-1);
1406 1.1 cgd /* was isatty but raw with ignoreeof yields problems */
1407 1.1 cgd if (tcgetattr(SHIN, &tty) == 0 && (tty.c_lflag & ICANON))
1408 1.1 cgd {
1409 1.1 cgd /* was 'short' for FILEC */
1410 1.1 cgd int ctpgrp;
1411 1.1 cgd
1412 1.1 cgd if (++sincereal > 25)
1413 1.1 cgd goto oops;
1414 1.1 cgd if (tpgrp != -1 &&
1415 1.1 cgd (ctpgrp = tcgetpgrp(FSHTTY)) != -1 &&
1416 1.1 cgd tpgrp != ctpgrp) {
1417 1.1 cgd (void) tcsetpgrp(FSHTTY, tpgrp);
1418 1.1 cgd (void) killpg((pid_t) ctpgrp, SIGHUP);
1419 1.5 mycroft (void) fprintf(csherr, "Reset tty pgrp from %d to %d\n",
1420 1.5 mycroft ctpgrp, tpgrp);
1421 1.1 cgd goto reread;
1422 1.1 cgd }
1423 1.1 cgd if (adrof(STRignoreeof)) {
1424 1.1 cgd if (loginsh)
1425 1.5 mycroft (void) fprintf(csherr,"\nUse \"logout\" to logout.\n");
1426 1.1 cgd else
1427 1.5 mycroft (void) fprintf(csherr,"\nUse \"exit\" to leave csh.\n");
1428 1.1 cgd reset();
1429 1.1 cgd }
1430 1.1 cgd if (chkstop == 0)
1431 1.1 cgd panystop(1);
1432 1.1 cgd }
1433 1.1 cgd oops:
1434 1.1 cgd doneinp = 1;
1435 1.1 cgd reset();
1436 1.1 cgd }
1437 1.1 cgd sincereal = 0;
1438 1.1 cgd if (c == '\n' && onelflg)
1439 1.1 cgd onelflg--;
1440 1.1 cgd } while (c == 0);
1441 1.1 cgd return (c);
1442 1.1 cgd }
1443 1.1 cgd
1444 1.1 cgd static int
1445 1.1 cgd bgetc()
1446 1.1 cgd {
1447 1.1 cgd register int buf, off, c;
1448 1.1 cgd
1449 1.1 cgd #ifdef FILEC
1450 1.1 cgd register int numleft = 0, roomleft;
1451 1.1 cgd Char ttyline[BUFSIZ];
1452 1.1 cgd #endif
1453 1.1 cgd char tbuf[BUFSIZ + 1];
1454 1.1 cgd
1455 1.1 cgd if (cantell) {
1456 1.1 cgd if (fseekp < fbobp || fseekp > feobp) {
1457 1.1 cgd fbobp = feobp = fseekp;
1458 1.1 cgd (void) lseek(SHIN, fseekp, L_SET);
1459 1.1 cgd }
1460 1.1 cgd if (fseekp == feobp) {
1461 1.1 cgd int i;
1462 1.1 cgd
1463 1.1 cgd fbobp = feobp;
1464 1.1 cgd do
1465 1.1 cgd c = read(SHIN, tbuf, BUFSIZ);
1466 1.1 cgd while (c < 0 && errno == EINTR);
1467 1.1 cgd if (c <= 0)
1468 1.1 cgd return (-1);
1469 1.1 cgd for (i = 0; i < c; i++)
1470 1.1 cgd fbuf[0][i] = (unsigned char) tbuf[i];
1471 1.1 cgd feobp += c;
1472 1.1 cgd }
1473 1.1 cgd c = fbuf[0][fseekp - fbobp];
1474 1.1 cgd fseekp++;
1475 1.1 cgd return (c);
1476 1.1 cgd }
1477 1.1 cgd
1478 1.1 cgd again:
1479 1.1 cgd buf = (int) fseekp / BUFSIZ;
1480 1.1 cgd if (buf >= fblocks) {
1481 1.1 cgd register Char **nfbuf =
1482 1.1 cgd (Char **) xcalloc((size_t) (fblocks + 2),
1483 1.1 cgd sizeof(Char **));
1484 1.1 cgd
1485 1.1 cgd if (fbuf) {
1486 1.1 cgd (void) blkcpy(nfbuf, fbuf);
1487 1.1 cgd xfree((ptr_t) fbuf);
1488 1.1 cgd }
1489 1.1 cgd fbuf = nfbuf;
1490 1.1 cgd fbuf[fblocks] = (Char *) xcalloc(BUFSIZ, sizeof(Char));
1491 1.1 cgd fblocks++;
1492 1.1 cgd if (!intty)
1493 1.1 cgd goto again;
1494 1.1 cgd }
1495 1.1 cgd if (fseekp >= feobp) {
1496 1.1 cgd buf = (int) feobp / BUFSIZ;
1497 1.1 cgd off = (int) feobp % BUFSIZ;
1498 1.1 cgd roomleft = BUFSIZ - off;
1499 1.1 cgd
1500 1.1 cgd #ifdef FILEC
1501 1.1 cgd roomleft = BUFSIZ - off;
1502 1.1 cgd for (;;) {
1503 1.1 cgd if (filec && intty) {
1504 1.1 cgd c = numleft ? numleft : tenex(ttyline, BUFSIZ);
1505 1.1 cgd if (c > roomleft) {
1506 1.1 cgd /* start with fresh buffer */
1507 1.1 cgd feobp = fseekp = fblocks * BUFSIZ;
1508 1.1 cgd numleft = c;
1509 1.1 cgd goto again;
1510 1.1 cgd }
1511 1.1 cgd if (c > 0)
1512 1.6 mycroft memcpy(fbuf[buf] + off, ttyline, c * sizeof(Char));
1513 1.1 cgd numleft = 0;
1514 1.1 cgd }
1515 1.1 cgd else {
1516 1.1 cgd #endif
1517 1.1 cgd c = read(SHIN, tbuf, roomleft);
1518 1.1 cgd if (c > 0) {
1519 1.1 cgd int i;
1520 1.1 cgd Char *ptr = fbuf[buf] + off;
1521 1.1 cgd
1522 1.1 cgd for (i = 0; i < c; i++)
1523 1.1 cgd ptr[i] = (unsigned char) tbuf[i];
1524 1.1 cgd }
1525 1.1 cgd #ifdef FILEC
1526 1.1 cgd }
1527 1.1 cgd #endif
1528 1.1 cgd if (c >= 0)
1529 1.1 cgd break;
1530 1.1 cgd if (errno == EWOULDBLOCK) {
1531 1.1 cgd int off = 0;
1532 1.1 cgd
1533 1.1 cgd (void) ioctl(SHIN, FIONBIO, (ioctl_t) & off);
1534 1.1 cgd }
1535 1.1 cgd else if (errno != EINTR)
1536 1.1 cgd break;
1537 1.1 cgd }
1538 1.1 cgd if (c <= 0)
1539 1.1 cgd return (-1);
1540 1.1 cgd feobp += c;
1541 1.1 cgd #ifndef FILEC
1542 1.1 cgd goto again;
1543 1.1 cgd #else
1544 1.1 cgd if (filec && !intty)
1545 1.1 cgd goto again;
1546 1.1 cgd #endif
1547 1.1 cgd }
1548 1.1 cgd c = fbuf[buf][(int) fseekp % BUFSIZ];
1549 1.1 cgd fseekp++;
1550 1.1 cgd return (c);
1551 1.1 cgd }
1552 1.1 cgd
1553 1.1 cgd static void
1554 1.1 cgd bfree()
1555 1.1 cgd {
1556 1.1 cgd register int sb, i;
1557 1.1 cgd
1558 1.1 cgd if (cantell)
1559 1.1 cgd return;
1560 1.1 cgd if (whyles)
1561 1.1 cgd return;
1562 1.1 cgd sb = (int) (fseekp - 1) / BUFSIZ;
1563 1.1 cgd if (sb > 0) {
1564 1.1 cgd for (i = 0; i < sb; i++)
1565 1.1 cgd xfree((ptr_t) fbuf[i]);
1566 1.1 cgd (void) blkcpy(fbuf, &fbuf[sb]);
1567 1.1 cgd fseekp -= BUFSIZ * sb;
1568 1.1 cgd feobp -= BUFSIZ * sb;
1569 1.1 cgd fblocks -= sb;
1570 1.1 cgd }
1571 1.1 cgd }
1572 1.1 cgd
1573 1.1 cgd void
1574 1.1 cgd bseek(l)
1575 1.5 mycroft struct Ain *l;
1576 1.5 mycroft {
1577 1.5 mycroft switch (aret = l->type) {
1578 1.5 mycroft case E_SEEK:
1579 1.5 mycroft evalvec = l->a_seek;
1580 1.5 mycroft evalp = l->c_seek;
1581 1.5 mycroft return;
1582 1.5 mycroft case A_SEEK:
1583 1.5 mycroft alvec = l->a_seek;
1584 1.5 mycroft alvecp = l->c_seek;
1585 1.5 mycroft return;
1586 1.5 mycroft case F_SEEK:
1587 1.5 mycroft fseekp = l->f_seek;
1588 1.5 mycroft return;
1589 1.5 mycroft default:
1590 1.5 mycroft (void) fprintf(csherr, "Bad seek type %d\n", aret);
1591 1.5 mycroft abort();
1592 1.5 mycroft }
1593 1.5 mycroft }
1594 1.1 cgd
1595 1.5 mycroft void
1596 1.5 mycroft btell(l)
1597 1.5 mycroft struct Ain *l;
1598 1.1 cgd {
1599 1.5 mycroft switch (l->type = aret) {
1600 1.5 mycroft case E_SEEK:
1601 1.5 mycroft l->a_seek = evalvec;
1602 1.5 mycroft l->c_seek = evalp;
1603 1.5 mycroft return;
1604 1.5 mycroft case A_SEEK:
1605 1.5 mycroft l->a_seek = alvec;
1606 1.5 mycroft l->c_seek = alvecp;
1607 1.5 mycroft return;
1608 1.5 mycroft case F_SEEK:
1609 1.5 mycroft l->f_seek = fseekp;
1610 1.5 mycroft l->a_seek = NULL;
1611 1.5 mycroft return;
1612 1.5 mycroft default:
1613 1.5 mycroft (void) fprintf(csherr, "Bad seek type %d\n", aret);
1614 1.5 mycroft abort();
1615 1.1 cgd }
1616 1.1 cgd }
1617 1.1 cgd
1618 1.1 cgd void
1619 1.1 cgd btoeof()
1620 1.1 cgd {
1621 1.1 cgd (void) lseek(SHIN, (off_t) 0, L_XTND);
1622 1.5 mycroft aret = F_SEEK;
1623 1.1 cgd fseekp = feobp;
1624 1.5 mycroft alvec = NULL;
1625 1.5 mycroft alvecp = NULL;
1626 1.5 mycroft evalvec = NULL;
1627 1.5 mycroft evalp = NULL;
1628 1.1 cgd wfree();
1629 1.1 cgd bfree();
1630 1.1 cgd }
1631 1.1 cgd
1632 1.1 cgd void
1633 1.1 cgd settell()
1634 1.1 cgd {
1635 1.1 cgd cantell = 0;
1636 1.1 cgd if (arginp || onelflg || intty)
1637 1.1 cgd return;
1638 1.1 cgd if (lseek(SHIN, (off_t) 0, L_INCR) < 0 || errno == ESPIPE)
1639 1.1 cgd return;
1640 1.1 cgd fbuf = (Char **) xcalloc(2, sizeof(Char **));
1641 1.1 cgd fblocks = 1;
1642 1.1 cgd fbuf[0] = (Char *) xcalloc(BUFSIZ, sizeof(Char));
1643 1.1 cgd fseekp = fbobp = feobp = lseek(SHIN, (off_t) 0, L_INCR);
1644 1.1 cgd cantell = 1;
1645 1.1 cgd }
1646