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