dol.c revision 1.20 1 1.20 wiz /* $NetBSD: dol.c,v 1.20 2002/05/25 23:29:16 wiz 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.10 christos #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.7 cgd #if 0
39 1.7 cgd static char sccsid[] = "@(#)dol.c 8.1 (Berkeley) 5/31/93";
40 1.7 cgd #else
41 1.20 wiz __RCSID("$NetBSD: dol.c,v 1.20 2002/05/25 23:29:16 wiz Exp $");
42 1.7 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include <sys/types.h>
46 1.17 wiz
47 1.17 wiz #include <errno.h>
48 1.1 cgd #include <fcntl.h>
49 1.20 wiz #include <stdarg.h>
50 1.1 cgd #include <stdlib.h>
51 1.1 cgd #include <string.h>
52 1.1 cgd #include <unistd.h>
53 1.1 cgd
54 1.1 cgd #include "csh.h"
55 1.1 cgd #include "extern.h"
56 1.1 cgd
57 1.1 cgd /*
58 1.1 cgd * These routines perform variable substitution and quoting via ' and ".
59 1.1 cgd * To this point these constructs have been preserved in the divided
60 1.1 cgd * input words. Here we expand variables and turn quoting via ' and " into
61 1.1 cgd * QUOTE bits on characters (which prevent further interpretation).
62 1.1 cgd * If the `:q' modifier was applied during history expansion, then
63 1.1 cgd * some QUOTEing may have occurred already, so we dont "trim()" here.
64 1.1 cgd */
65 1.1 cgd
66 1.1 cgd static int Dpeekc, Dpeekrd; /* Peeks for DgetC and Dreadc */
67 1.1 cgd static Char *Dcp, **Dvp; /* Input vector for Dreadc */
68 1.1 cgd
69 1.17 wiz #define DEOF -1
70 1.17 wiz #define unDgetC(c) Dpeekc = c
71 1.17 wiz #define QUOTES (_QF|_QB|_ESC) /* \ ' " ` */
72 1.1 cgd
73 1.1 cgd /*
74 1.1 cgd * The following variables give the information about the current
75 1.1 cgd * $ expansion, recording the current word position, the remaining
76 1.1 cgd * words within this expansion, the count of remaining words, and the
77 1.1 cgd * information about any : modifier which is being applied.
78 1.1 cgd */
79 1.14 christos #define MAXWLEN (BUFSIZE - 4)
80 1.5 mycroft #define MAXMOD MAXWLEN /* This cannot overflow */
81 1.17 wiz static Char dolmod[MAXMOD]; /* : modifier character */
82 1.1 cgd static Char *dolp; /* Remaining chars from this word */
83 1.1 cgd static Char **dolnxt; /* Further words */
84 1.1 cgd static int dolcnt; /* Count of further words */
85 1.5 mycroft static int dolnmod; /* Number of modifiers */
86 1.1 cgd static int dolmcnt; /* :gx -> 10000, else 1 */
87 1.5 mycroft static int dolwcnt; /* :wx -> 10000, else 1 */
88 1.1 cgd
89 1.17 wiz static void Dfix2(Char **);
90 1.17 wiz static Char *Dpack(Char *, Char *);
91 1.17 wiz static int Dword(void);
92 1.17 wiz static void dolerror(Char *);
93 1.17 wiz static int DgetC(int);
94 1.17 wiz static void Dgetdol(void);
95 1.17 wiz static void fixDolMod(void);
96 1.17 wiz static void setDolp(Char *);
97 1.17 wiz static void unDredc(int);
98 1.17 wiz static int Dredc(void);
99 1.17 wiz static void Dtestq(int);
100 1.1 cgd
101 1.1 cgd
102 1.1 cgd /*
103 1.1 cgd * Fix up the $ expansions and quotations in the
104 1.1 cgd * argument list to command t.
105 1.1 cgd */
106 1.1 cgd void
107 1.17 wiz Dfix(struct command *t)
108 1.1 cgd {
109 1.17 wiz Char *p, **pp;
110 1.1 cgd
111 1.1 cgd if (noexec)
112 1.1 cgd return;
113 1.1 cgd /* Note that t_dcom isn't trimmed thus !...:q's aren't lost */
114 1.5 mycroft for (pp = t->t_dcom; (p = *pp++) != NULL;)
115 1.1 cgd for (; *p; p++) {
116 1.1 cgd if (cmap(*p, _DOL | QUOTES)) { /* $, \, ', ", ` */
117 1.1 cgd Dfix2(t->t_dcom); /* found one */
118 1.1 cgd blkfree(t->t_dcom);
119 1.1 cgd t->t_dcom = gargv;
120 1.1 cgd gargv = 0;
121 1.1 cgd return;
122 1.1 cgd }
123 1.1 cgd }
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd /*
127 1.1 cgd * $ substitute one word, for i/o redirection
128 1.1 cgd */
129 1.17 wiz Char *
130 1.17 wiz Dfix1(Char *cp)
131 1.1 cgd {
132 1.17 wiz Char *Dv[2];
133 1.1 cgd
134 1.1 cgd if (noexec)
135 1.1 cgd return (0);
136 1.1 cgd Dv[0] = cp;
137 1.1 cgd Dv[1] = NULL;
138 1.1 cgd Dfix2(Dv);
139 1.1 cgd if (gargc != 1) {
140 1.5 mycroft setname(vis_str(cp));
141 1.1 cgd stderror(ERR_NAME | ERR_AMBIG);
142 1.1 cgd }
143 1.1 cgd cp = Strsave(gargv[0]);
144 1.1 cgd blkfree(gargv), gargv = 0;
145 1.1 cgd return (cp);
146 1.1 cgd }
147 1.1 cgd
148 1.1 cgd /*
149 1.1 cgd * Subroutine to do actual fixing after state initialization.
150 1.1 cgd */
151 1.1 cgd static void
152 1.17 wiz Dfix2(Char **v)
153 1.1 cgd {
154 1.1 cgd ginit(); /* Initialize glob's area pointers */
155 1.1 cgd Dvp = v;
156 1.1 cgd Dcp = STRNULL; /* Setup input vector for Dreadc */
157 1.1 cgd unDgetC(0);
158 1.1 cgd unDredc(0); /* Clear out any old peeks (at error) */
159 1.1 cgd dolp = 0;
160 1.1 cgd dolcnt = 0; /* Clear out residual $ expands (...) */
161 1.1 cgd while (Dword())
162 1.1 cgd continue;
163 1.1 cgd }
164 1.1 cgd
165 1.1 cgd /*
166 1.1 cgd * Pack up more characters in this word
167 1.1 cgd */
168 1.1 cgd static Char *
169 1.17 wiz Dpack(Char *wbuf, Char *wp)
170 1.1 cgd {
171 1.17 wiz int c, i;
172 1.17 wiz
173 1.17 wiz i = MAXWLEN - (wp - wbuf);
174 1.1 cgd for (;;) {
175 1.1 cgd c = DgetC(DODOL);
176 1.1 cgd if (c == '\\') {
177 1.1 cgd c = DgetC(0);
178 1.1 cgd if (c == DEOF) {
179 1.1 cgd unDredc(c);
180 1.1 cgd *wp = 0;
181 1.1 cgd Gcat(STRNULL, wbuf);
182 1.1 cgd return (NULL);
183 1.1 cgd }
184 1.1 cgd if (c == '\n')
185 1.1 cgd c = ' ';
186 1.1 cgd else
187 1.1 cgd c |= QUOTE;
188 1.1 cgd }
189 1.1 cgd if (c == DEOF) {
190 1.1 cgd unDredc(c);
191 1.1 cgd *wp = 0;
192 1.1 cgd Gcat(STRNULL, wbuf);
193 1.1 cgd return (NULL);
194 1.1 cgd }
195 1.5 mycroft if (cmap(c, _SP | _NL | _QF | _QB)) { /* sp \t\n'"` */
196 1.1 cgd unDgetC(c);
197 1.1 cgd if (cmap(c, QUOTES))
198 1.1 cgd return (wp);
199 1.1 cgd *wp++ = 0;
200 1.1 cgd Gcat(STRNULL, wbuf);
201 1.1 cgd return (NULL);
202 1.1 cgd }
203 1.12 mycroft if (--i <= 0)
204 1.1 cgd stderror(ERR_WTOOLONG);
205 1.1 cgd *wp++ = c;
206 1.1 cgd }
207 1.1 cgd }
208 1.1 cgd
209 1.1 cgd /*
210 1.1 cgd * Get a word. This routine is analogous to the routine
211 1.1 cgd * word() in sh.lex.c for the main lexical input. One difference
212 1.1 cgd * here is that we don't get a newline to terminate our expansion.
213 1.1 cgd * Rather, DgetC will return a DEOF when we hit the end-of-input.
214 1.1 cgd */
215 1.1 cgd static int
216 1.17 wiz Dword(void)
217 1.1 cgd {
218 1.17 wiz Char wbuf[BUFSIZE], *wp;
219 1.17 wiz int c, c1, i;
220 1.17 wiz bool dolflg, done, sofar;
221 1.17 wiz
222 1.17 wiz done = 0;
223 1.17 wiz i = MAXWLEN;
224 1.17 wiz sofar = 0;
225 1.17 wiz wp = wbuf;
226 1.1 cgd
227 1.1 cgd while (!done) {
228 1.1 cgd done = 1;
229 1.1 cgd c = DgetC(DODOL);
230 1.1 cgd switch (c) {
231 1.1 cgd case DEOF:
232 1.1 cgd if (sofar == 0)
233 1.1 cgd return (0);
234 1.1 cgd /* finish this word and catch the code above the next time */
235 1.1 cgd unDredc(c);
236 1.11 mycroft /* FALLTHROUGH */
237 1.1 cgd case '\n':
238 1.1 cgd *wp = 0;
239 1.1 cgd Gcat(STRNULL, wbuf);
240 1.1 cgd return (1);
241 1.1 cgd case ' ':
242 1.1 cgd case '\t':
243 1.1 cgd done = 0;
244 1.1 cgd break;
245 1.1 cgd case '`':
246 1.1 cgd /* We preserve ` quotations which are done yet later */
247 1.1 cgd *wp++ = c, --i;
248 1.11 mycroft /* FALLTHROUGH */
249 1.1 cgd case '\'':
250 1.1 cgd case '"':
251 1.1 cgd /*
252 1.1 cgd * Note that DgetC never returns a QUOTES character from an
253 1.1 cgd * expansion, so only true input quotes will get us here or out.
254 1.1 cgd */
255 1.1 cgd c1 = c;
256 1.1 cgd dolflg = c1 == '"' ? DODOL : 0;
257 1.1 cgd for (;;) {
258 1.1 cgd c = DgetC(dolflg);
259 1.1 cgd if (c == c1)
260 1.1 cgd break;
261 1.12 mycroft if (c == '\n' || c == DEOF)
262 1.1 cgd stderror(ERR_UNMATCHED, c1);
263 1.1 cgd if ((c & (QUOTE | TRIM)) == ('\n' | QUOTE))
264 1.1 cgd --wp, ++i;
265 1.12 mycroft if (--i <= 0)
266 1.1 cgd stderror(ERR_WTOOLONG);
267 1.1 cgd switch (c1) {
268 1.1 cgd case '"':
269 1.1 cgd /*
270 1.1 cgd * Leave any `s alone for later. Other chars are all
271 1.1 cgd * quoted, thus `...` can tell it was within "...".
272 1.1 cgd */
273 1.1 cgd *wp++ = c == '`' ? '`' : c | QUOTE;
274 1.1 cgd break;
275 1.1 cgd case '\'':
276 1.1 cgd /* Prevent all further interpretation */
277 1.1 cgd *wp++ = c | QUOTE;
278 1.1 cgd break;
279 1.1 cgd case '`':
280 1.1 cgd /* Leave all text alone for later */
281 1.1 cgd *wp++ = c;
282 1.1 cgd break;
283 1.5 mycroft default:
284 1.5 mycroft break;
285 1.1 cgd }
286 1.1 cgd }
287 1.1 cgd if (c1 == '`')
288 1.5 mycroft *wp++ = '`' /* i--; eliminated */;
289 1.1 cgd sofar = 1;
290 1.1 cgd if ((wp = Dpack(wbuf, wp)) == NULL)
291 1.1 cgd return (1);
292 1.1 cgd else {
293 1.1 cgd i = MAXWLEN - (wp - wbuf);
294 1.1 cgd done = 0;
295 1.1 cgd }
296 1.1 cgd break;
297 1.1 cgd case '\\':
298 1.1 cgd c = DgetC(0); /* No $ subst! */
299 1.1 cgd if (c == '\n' || c == DEOF) {
300 1.1 cgd done = 0;
301 1.1 cgd break;
302 1.1 cgd }
303 1.1 cgd c |= QUOTE;
304 1.1 cgd break;
305 1.5 mycroft default:
306 1.5 mycroft break;
307 1.1 cgd }
308 1.1 cgd if (done) {
309 1.1 cgd unDgetC(c);
310 1.1 cgd sofar = 1;
311 1.1 cgd if ((wp = Dpack(wbuf, wp)) == NULL)
312 1.1 cgd return (1);
313 1.1 cgd else {
314 1.1 cgd i = MAXWLEN - (wp - wbuf);
315 1.1 cgd done = 0;
316 1.1 cgd }
317 1.1 cgd }
318 1.1 cgd }
319 1.1 cgd /* Really NOTREACHED */
320 1.1 cgd return (0);
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd
324 1.1 cgd /*
325 1.1 cgd * Get a character, performing $ substitution unless flag is 0.
326 1.1 cgd * Any QUOTES character which is returned from a $ expansion is
327 1.1 cgd * QUOTEd so that it will not be recognized above.
328 1.1 cgd */
329 1.1 cgd static int
330 1.17 wiz DgetC(int flag)
331 1.1 cgd {
332 1.9 tls int c;
333 1.1 cgd top:
334 1.5 mycroft if ((c = Dpeekc) != '\0') {
335 1.1 cgd Dpeekc = 0;
336 1.1 cgd return (c);
337 1.1 cgd }
338 1.1 cgd if (lap) {
339 1.1 cgd c = *lap++ & (QUOTE | TRIM);
340 1.1 cgd if (c == 0) {
341 1.1 cgd lap = 0;
342 1.1 cgd goto top;
343 1.1 cgd }
344 1.1 cgd quotspec:
345 1.1 cgd if (cmap(c, QUOTES))
346 1.1 cgd return (c | QUOTE);
347 1.1 cgd return (c);
348 1.1 cgd }
349 1.1 cgd if (dolp) {
350 1.5 mycroft if ((c = *dolp++ & (QUOTE | TRIM)) != '\0')
351 1.1 cgd goto quotspec;
352 1.1 cgd if (dolcnt > 0) {
353 1.1 cgd setDolp(*dolnxt++);
354 1.1 cgd --dolcnt;
355 1.1 cgd return (' ');
356 1.1 cgd }
357 1.1 cgd dolp = 0;
358 1.1 cgd }
359 1.1 cgd if (dolcnt > 0) {
360 1.1 cgd setDolp(*dolnxt++);
361 1.1 cgd --dolcnt;
362 1.1 cgd goto top;
363 1.1 cgd }
364 1.1 cgd c = Dredc();
365 1.1 cgd if (c == '$' && flag) {
366 1.1 cgd Dgetdol();
367 1.1 cgd goto top;
368 1.1 cgd }
369 1.1 cgd return (c);
370 1.1 cgd }
371 1.1 cgd
372 1.1 cgd static Char *nulvec[] = {0};
373 1.5 mycroft static struct varent nulargv = {nulvec, STRargv, { NULL, NULL, NULL }, 0};
374 1.1 cgd
375 1.1 cgd static void
376 1.17 wiz dolerror(Char *s)
377 1.1 cgd {
378 1.5 mycroft setname(vis_str(s));
379 1.1 cgd stderror(ERR_NAME | ERR_RANGE);
380 1.11 mycroft /* NOTREACHED */
381 1.1 cgd }
382 1.1 cgd
383 1.1 cgd /*
384 1.1 cgd * Handle the multitudinous $ expansion forms.
385 1.1 cgd * Ugh.
386 1.1 cgd */
387 1.1 cgd static void
388 1.17 wiz Dgetdol(void)
389 1.1 cgd {
390 1.17 wiz static Char *dolbang = NULL;
391 1.17 wiz Char name[4*MAXVARLEN+1];
392 1.17 wiz Char wbuf[BUFSIZE];
393 1.17 wiz struct varent *vp;
394 1.9 tls Char *np;
395 1.17 wiz int c, lwb, sc, subscr, upb;
396 1.17 wiz bool dimen, bitset;
397 1.17 wiz char tnp;
398 1.17 wiz
399 1.17 wiz bitset = 0;
400 1.17 wiz dimen = 0;
401 1.17 wiz lwb = 1;
402 1.17 wiz upb = 0;
403 1.17 wiz subscr = 0;
404 1.17 wiz vp = NULL;
405 1.1 cgd
406 1.5 mycroft dolnmod = dolmcnt = dolwcnt = 0;
407 1.1 cgd c = sc = DgetC(0);
408 1.1 cgd if (c == '{')
409 1.1 cgd c = DgetC(0); /* sc is { to take } later */
410 1.1 cgd if ((c & TRIM) == '#')
411 1.1 cgd dimen++, c = DgetC(0); /* $# takes dimension */
412 1.1 cgd else if (c == '?')
413 1.1 cgd bitset++, c = DgetC(0); /* $? tests existence */
414 1.1 cgd switch (c) {
415 1.5 mycroft case '!':
416 1.12 mycroft if (dimen || bitset)
417 1.5 mycroft stderror(ERR_SYNTAX);
418 1.5 mycroft if (backpid != 0) {
419 1.5 mycroft if (dolbang)
420 1.17 wiz xfree((ptr_t)dolbang);
421 1.5 mycroft setDolp(dolbang = putn(backpid));
422 1.5 mycroft }
423 1.5 mycroft goto eatbrac;
424 1.1 cgd case '$':
425 1.12 mycroft if (dimen || bitset)
426 1.1 cgd stderror(ERR_SYNTAX);
427 1.1 cgd setDolp(doldol);
428 1.1 cgd goto eatbrac;
429 1.1 cgd case '<' | QUOTE:
430 1.12 mycroft if (bitset)
431 1.1 cgd stderror(ERR_NOTALLOWED, "$?<");
432 1.12 mycroft if (dimen)
433 1.1 cgd stderror(ERR_NOTALLOWED, "$?#");
434 1.1 cgd for (np = wbuf; read(OLDSTD, &tnp, 1) == 1; np++) {
435 1.17 wiz *np = (unsigned char)tnp;
436 1.14 christos if (np >= &wbuf[BUFSIZE - 1])
437 1.1 cgd stderror(ERR_LTOOLONG);
438 1.5 mycroft if (tnp == '\n')
439 1.1 cgd break;
440 1.1 cgd }
441 1.1 cgd *np = 0;
442 1.1 cgd /*
443 1.1 cgd * KLUDGE: dolmod is set here because it will cause setDolp to call
444 1.1 cgd * domod and thus to copy wbuf. Otherwise setDolp would use it
445 1.1 cgd * directly. If we saved it ourselves, no one would know when to free
446 1.1 cgd * it. The actual function of the 'q' causes filename expansion not to
447 1.1 cgd * be done on the interpolated value.
448 1.1 cgd */
449 1.5 mycroft dolmod[dolnmod++] = 'q';
450 1.1 cgd dolmcnt = 10000;
451 1.1 cgd setDolp(wbuf);
452 1.1 cgd goto eatbrac;
453 1.1 cgd case DEOF:
454 1.1 cgd case '\n':
455 1.1 cgd stderror(ERR_SYNTAX);
456 1.1 cgd /* NOTREACHED */
457 1.1 cgd case '*':
458 1.1 cgd (void) Strcpy(name, STRargv);
459 1.1 cgd vp = adrof(STRargv);
460 1.1 cgd subscr = -1; /* Prevent eating [...] */
461 1.1 cgd break;
462 1.1 cgd default:
463 1.1 cgd np = name;
464 1.1 cgd if (Isdigit(c)) {
465 1.12 mycroft if (dimen)
466 1.1 cgd stderror(ERR_NOTALLOWED, "$#<num>");
467 1.1 cgd subscr = 0;
468 1.1 cgd do {
469 1.1 cgd subscr = subscr * 10 + c - '0';
470 1.1 cgd c = DgetC(0);
471 1.1 cgd } while (Isdigit(c));
472 1.1 cgd unDredc(c);
473 1.19 christos if (subscr < 0)
474 1.18 itohy stderror(ERR_RANGE);
475 1.1 cgd if (subscr == 0) {
476 1.1 cgd if (bitset) {
477 1.1 cgd dolp = ffile ? STR1 : STR0;
478 1.1 cgd goto eatbrac;
479 1.1 cgd }
480 1.12 mycroft if (ffile == 0)
481 1.1 cgd stderror(ERR_DOLZERO);
482 1.1 cgd fixDolMod();
483 1.1 cgd setDolp(ffile);
484 1.1 cgd goto eatbrac;
485 1.1 cgd }
486 1.12 mycroft if (bitset)
487 1.1 cgd stderror(ERR_DOLQUEST);
488 1.1 cgd vp = adrof(STRargv);
489 1.1 cgd if (vp == 0) {
490 1.1 cgd vp = &nulargv;
491 1.1 cgd goto eatmod;
492 1.1 cgd }
493 1.1 cgd break;
494 1.1 cgd }
495 1.12 mycroft if (!alnum(c))
496 1.1 cgd stderror(ERR_VARALNUM);
497 1.1 cgd for (;;) {
498 1.1 cgd *np++ = c;
499 1.1 cgd c = DgetC(0);
500 1.1 cgd if (!alnum(c))
501 1.1 cgd break;
502 1.12 mycroft if (np >= &name[MAXVARLEN])
503 1.1 cgd stderror(ERR_VARTOOLONG);
504 1.1 cgd }
505 1.1 cgd *np++ = 0;
506 1.1 cgd unDredc(c);
507 1.1 cgd vp = adrof(name);
508 1.1 cgd }
509 1.1 cgd if (bitset) {
510 1.1 cgd dolp = (vp || getenv(short2str(name))) ? STR1 : STR0;
511 1.1 cgd goto eatbrac;
512 1.1 cgd }
513 1.1 cgd if (vp == 0) {
514 1.1 cgd np = str2short(getenv(short2str(name)));
515 1.1 cgd if (np) {
516 1.1 cgd fixDolMod();
517 1.1 cgd setDolp(np);
518 1.1 cgd goto eatbrac;
519 1.1 cgd }
520 1.1 cgd udvar(name);
521 1.1 cgd }
522 1.1 cgd c = DgetC(0);
523 1.1 cgd upb = blklen(vp->vec);
524 1.1 cgd if (dimen == 0 && subscr == 0 && c == '[') {
525 1.1 cgd np = name;
526 1.1 cgd for (;;) {
527 1.1 cgd c = DgetC(DODOL); /* Allow $ expand within [ ] */
528 1.1 cgd if (c == ']')
529 1.1 cgd break;
530 1.12 mycroft if (c == '\n' || c == DEOF)
531 1.1 cgd stderror(ERR_INCBR);
532 1.12 mycroft if (np >= &name[sizeof(name) / sizeof(Char) - 2])
533 1.1 cgd stderror(ERR_VARTOOLONG);
534 1.1 cgd *np++ = c;
535 1.1 cgd }
536 1.1 cgd *np = 0, np = name;
537 1.12 mycroft if (dolp || dolcnt) /* $ exp must end before ] */
538 1.1 cgd stderror(ERR_EXPORD);
539 1.12 mycroft if (!*np)
540 1.1 cgd stderror(ERR_SYNTAX);
541 1.1 cgd if (Isdigit(*np)) {
542 1.1 cgd int i;
543 1.1 cgd
544 1.5 mycroft for (i = 0; Isdigit(*np); i = i * 10 + *np++ - '0')
545 1.5 mycroft continue;
546 1.1 cgd if ((i < 0 || i > upb) && !any("-*", *np)) {
547 1.1 cgd dolerror(vp->v_name);
548 1.1 cgd return;
549 1.1 cgd }
550 1.1 cgd lwb = i;
551 1.1 cgd if (!*np)
552 1.1 cgd upb = lwb, np = STRstar;
553 1.1 cgd }
554 1.1 cgd if (*np == '*')
555 1.1 cgd np++;
556 1.12 mycroft else if (*np != '-')
557 1.1 cgd stderror(ERR_MISSING, '-');
558 1.12 mycroft else {
559 1.9 tls int i = upb;
560 1.1 cgd
561 1.1 cgd np++;
562 1.1 cgd if (Isdigit(*np)) {
563 1.1 cgd i = 0;
564 1.1 cgd while (Isdigit(*np))
565 1.1 cgd i = i * 10 + *np++ - '0';
566 1.1 cgd if (i < 0 || i > upb) {
567 1.1 cgd dolerror(vp->v_name);
568 1.1 cgd return;
569 1.1 cgd }
570 1.1 cgd }
571 1.1 cgd if (i < lwb)
572 1.1 cgd upb = lwb - 1;
573 1.1 cgd else
574 1.1 cgd upb = i;
575 1.1 cgd }
576 1.1 cgd if (lwb == 0) {
577 1.1 cgd if (upb != 0) {
578 1.1 cgd dolerror(vp->v_name);
579 1.1 cgd return;
580 1.1 cgd }
581 1.1 cgd upb = -1;
582 1.1 cgd }
583 1.12 mycroft if (*np)
584 1.1 cgd stderror(ERR_SYNTAX);
585 1.1 cgd }
586 1.1 cgd else {
587 1.13 thorpej if (subscr > 0) {
588 1.1 cgd if (subscr > upb)
589 1.1 cgd lwb = 1, upb = 0;
590 1.1 cgd else
591 1.1 cgd lwb = upb = subscr;
592 1.13 thorpej }
593 1.1 cgd unDredc(c);
594 1.1 cgd }
595 1.1 cgd if (dimen) {
596 1.1 cgd Char *cp = putn(upb - lwb + 1);
597 1.1 cgd
598 1.1 cgd addla(cp);
599 1.1 cgd xfree((ptr_t) cp);
600 1.1 cgd }
601 1.1 cgd else {
602 1.1 cgd eatmod:
603 1.1 cgd fixDolMod();
604 1.1 cgd dolnxt = &vp->vec[lwb - 1];
605 1.1 cgd dolcnt = upb - lwb + 1;
606 1.1 cgd }
607 1.1 cgd eatbrac:
608 1.1 cgd if (sc == '{') {
609 1.1 cgd c = Dredc();
610 1.12 mycroft if (c != '}')
611 1.1 cgd stderror(ERR_MISSING, '}');
612 1.1 cgd }
613 1.1 cgd }
614 1.1 cgd
615 1.1 cgd static void
616 1.17 wiz fixDolMod(void)
617 1.1 cgd {
618 1.9 tls int c;
619 1.1 cgd
620 1.1 cgd c = DgetC(0);
621 1.1 cgd if (c == ':') {
622 1.5 mycroft do {
623 1.5 mycroft c = DgetC(0), dolmcnt = 1, dolwcnt = 1;
624 1.5 mycroft if (c == 'g' || c == 'a') {
625 1.5 mycroft if (c == 'g')
626 1.5 mycroft dolmcnt = 10000;
627 1.5 mycroft else
628 1.5 mycroft dolwcnt = 10000;
629 1.5 mycroft c = DgetC(0);
630 1.5 mycroft }
631 1.5 mycroft if ((c == 'g' && dolmcnt != 10000) ||
632 1.5 mycroft (c == 'a' && dolwcnt != 10000)) {
633 1.5 mycroft if (c == 'g')
634 1.5 mycroft dolmcnt = 10000;
635 1.5 mycroft else
636 1.5 mycroft dolwcnt = 10000;
637 1.5 mycroft c = DgetC(0);
638 1.5 mycroft }
639 1.5 mycroft
640 1.5 mycroft if (c == 's') { /* [eichin:19910926.0755EST] */
641 1.5 mycroft int delimcnt = 2;
642 1.5 mycroft int delim = DgetC(0);
643 1.5 mycroft dolmod[dolnmod++] = c;
644 1.5 mycroft dolmod[dolnmod++] = delim;
645 1.5 mycroft
646 1.5 mycroft if (!delim || letter(delim)
647 1.5 mycroft || Isdigit(delim) || any(" \t\n", delim)) {
648 1.5 mycroft seterror(ERR_BADSUBST);
649 1.5 mycroft break;
650 1.5 mycroft }
651 1.5 mycroft while ((c = DgetC(0)) != (-1)) {
652 1.5 mycroft dolmod[dolnmod++] = c;
653 1.5 mycroft if(c == delim) delimcnt--;
654 1.5 mycroft if(!delimcnt) break;
655 1.5 mycroft }
656 1.5 mycroft if(delimcnt) {
657 1.5 mycroft seterror(ERR_BADSUBST);
658 1.5 mycroft break;
659 1.5 mycroft }
660 1.5 mycroft continue;
661 1.5 mycroft }
662 1.12 mycroft if (!any("htrqxes", c))
663 1.5 mycroft stderror(ERR_BADMOD, c);
664 1.5 mycroft dolmod[dolnmod++] = c;
665 1.5 mycroft if (c == 'q')
666 1.5 mycroft dolmcnt = 10000;
667 1.5 mycroft }
668 1.5 mycroft while ((c = DgetC(0)) == ':');
669 1.5 mycroft unDredc(c);
670 1.1 cgd }
671 1.1 cgd else
672 1.1 cgd unDredc(c);
673 1.1 cgd }
674 1.1 cgd
675 1.1 cgd static void
676 1.17 wiz setDolp(Char *cp)
677 1.1 cgd {
678 1.9 tls Char *dp;
679 1.5 mycroft int i;
680 1.1 cgd
681 1.5 mycroft if (dolnmod == 0 || dolmcnt == 0) {
682 1.1 cgd dolp = cp;
683 1.1 cgd return;
684 1.1 cgd }
685 1.5 mycroft dp = cp = Strsave(cp);
686 1.5 mycroft for (i = 0; i < dolnmod; i++) {
687 1.5 mycroft /* handle s// [eichin:19910926.0510EST] */
688 1.5 mycroft if(dolmod[i] == 's') {
689 1.5 mycroft int delim;
690 1.5 mycroft Char *lhsub, *rhsub, *np;
691 1.5 mycroft size_t lhlen = 0, rhlen = 0;
692 1.5 mycroft int didmod = 0;
693 1.5 mycroft
694 1.5 mycroft delim = dolmod[++i];
695 1.5 mycroft if (!delim || letter(delim)
696 1.5 mycroft || Isdigit(delim) || any(" \t\n", delim)) {
697 1.5 mycroft seterror(ERR_BADSUBST);
698 1.5 mycroft break;
699 1.5 mycroft }
700 1.5 mycroft lhsub = &dolmod[++i];
701 1.5 mycroft while(dolmod[i] != delim && dolmod[++i]) {
702 1.5 mycroft lhlen++;
703 1.5 mycroft }
704 1.5 mycroft dolmod[i] = 0;
705 1.5 mycroft rhsub = &dolmod[++i];
706 1.5 mycroft while(dolmod[i] != delim && dolmod[++i]) {
707 1.5 mycroft rhlen++;
708 1.5 mycroft }
709 1.5 mycroft dolmod[i] = 0;
710 1.5 mycroft
711 1.5 mycroft do {
712 1.5 mycroft dp = Strstr(cp, lhsub);
713 1.5 mycroft if (dp) {
714 1.17 wiz np = (Char *)xmalloc(
715 1.17 wiz (size_t)((Strlen(cp) + 1 - lhlen + rhlen) *
716 1.17 wiz sizeof(Char)));
717 1.17 wiz (void)Strncpy(np, cp, dp - cp);
718 1.17 wiz (void)Strcpy(np + (dp - cp), rhsub);
719 1.17 wiz (void)Strcpy(np + (dp - cp) + rhlen, dp + lhlen);
720 1.5 mycroft
721 1.5 mycroft xfree((ptr_t) cp);
722 1.5 mycroft dp = cp = np;
723 1.5 mycroft didmod = 1;
724 1.5 mycroft } else {
725 1.5 mycroft /* should this do a seterror? */
726 1.5 mycroft break;
727 1.5 mycroft }
728 1.5 mycroft }
729 1.5 mycroft while (dolwcnt == 10000);
730 1.5 mycroft /*
731 1.5 mycroft * restore dolmod for additional words
732 1.5 mycroft */
733 1.5 mycroft dolmod[i] = rhsub[-1] = delim;
734 1.5 mycroft if (didmod)
735 1.5 mycroft dolmcnt--;
736 1.5 mycroft else
737 1.5 mycroft break;
738 1.5 mycroft } else {
739 1.5 mycroft int didmod = 0;
740 1.5 mycroft
741 1.5 mycroft do {
742 1.5 mycroft if ((dp = domod(cp, dolmod[i]))) {
743 1.5 mycroft didmod = 1;
744 1.5 mycroft if (Strcmp(cp, dp) == 0) {
745 1.5 mycroft xfree((ptr_t) cp);
746 1.5 mycroft cp = dp;
747 1.5 mycroft break;
748 1.5 mycroft }
749 1.5 mycroft else {
750 1.5 mycroft xfree((ptr_t) cp);
751 1.5 mycroft cp = dp;
752 1.5 mycroft }
753 1.5 mycroft }
754 1.5 mycroft else
755 1.5 mycroft break;
756 1.5 mycroft }
757 1.5 mycroft while (dolwcnt == 10000);
758 1.5 mycroft dp = cp;
759 1.5 mycroft if (didmod)
760 1.5 mycroft dolmcnt--;
761 1.5 mycroft else
762 1.5 mycroft break;
763 1.5 mycroft }
764 1.5 mycroft }
765 1.5 mycroft
766 1.1 cgd if (dp) {
767 1.1 cgd addla(dp);
768 1.1 cgd xfree((ptr_t) dp);
769 1.1 cgd }
770 1.1 cgd else
771 1.1 cgd addla(cp);
772 1.5 mycroft
773 1.1 cgd dolp = STRNULL;
774 1.12 mycroft if (seterr)
775 1.1 cgd stderror(ERR_OLD);
776 1.1 cgd }
777 1.1 cgd
778 1.1 cgd static void
779 1.17 wiz unDredc(int c)
780 1.1 cgd {
781 1.1 cgd Dpeekrd = c;
782 1.1 cgd }
783 1.1 cgd
784 1.1 cgd static int
785 1.17 wiz Dredc(void)
786 1.1 cgd {
787 1.9 tls int c;
788 1.1 cgd
789 1.5 mycroft if ((c = Dpeekrd) != '\0') {
790 1.1 cgd Dpeekrd = 0;
791 1.1 cgd return (c);
792 1.1 cgd }
793 1.1 cgd if (Dcp && (c = *Dcp++))
794 1.1 cgd return (c & (QUOTE | TRIM));
795 1.1 cgd if (*Dvp == 0) {
796 1.1 cgd Dcp = 0;
797 1.1 cgd return (DEOF);
798 1.1 cgd }
799 1.1 cgd Dcp = *Dvp++;
800 1.1 cgd return (' ');
801 1.1 cgd }
802 1.1 cgd
803 1.1 cgd static void
804 1.17 wiz Dtestq(int c)
805 1.1 cgd {
806 1.1 cgd if (cmap(c, QUOTES))
807 1.1 cgd gflag = 1;
808 1.1 cgd }
809 1.1 cgd
810 1.1 cgd /*
811 1.1 cgd * Form a shell temporary file (in unit 0) from the words
812 1.1 cgd * of the shell input up to EOF or a line the same as "term".
813 1.1 cgd * Unit 0 should have been closed before this call.
814 1.1 cgd */
815 1.1 cgd void
816 1.5 mycroft /*ARGSUSED*/
817 1.17 wiz heredoc(Char *term)
818 1.1 cgd {
819 1.17 wiz Char obuf[BUFSIZE], lbuf[BUFSIZE], mbuf[BUFSIZE];
820 1.15 christos struct timeval tv;
821 1.17 wiz Char *Dv[2], *lbp, *obp, *mbp, **vp;
822 1.17 wiz char *tmp;
823 1.17 wiz int c, ocnt, lcnt, mcnt;
824 1.17 wiz bool quoted;
825 1.1 cgd
826 1.15 christos again:
827 1.6 mycroft tmp = short2str(shtemp);
828 1.15 christos if (open(tmp, O_RDWR | O_CREAT | O_TRUNC | O_EXCL, 0600) < 0) {
829 1.15 christos if (errno == EEXIST) {
830 1.15 christos if (unlink(tmp) == -1) {
831 1.17 wiz (void)gettimeofday(&tv, NULL);
832 1.15 christos shtemp = Strspl(STRtmpsh, putn((((int)tv.tv_sec) ^
833 1.16 christos ((int)tv.tv_usec) ^ ((int)getpid())) & 0x00ffffff));
834 1.15 christos }
835 1.15 christos goto again;
836 1.15 christos }
837 1.1 cgd stderror(ERR_SYSTEM, tmp, strerror(errno));
838 1.15 christos }
839 1.17 wiz (void)unlink(tmp); /* 0 0 inode! */
840 1.1 cgd Dv[0] = term;
841 1.1 cgd Dv[1] = NULL;
842 1.1 cgd gflag = 0;
843 1.1 cgd trim(Dv);
844 1.1 cgd rscan(Dv, Dtestq);
845 1.1 cgd quoted = gflag;
846 1.14 christos ocnt = BUFSIZE;
847 1.1 cgd obp = obuf;
848 1.1 cgd for (;;) {
849 1.1 cgd /*
850 1.1 cgd * Read up a line
851 1.1 cgd */
852 1.1 cgd lbp = lbuf;
853 1.14 christos lcnt = BUFSIZE - 4;
854 1.1 cgd for (;;) {
855 1.1 cgd c = readc(1); /* 1 -> Want EOF returns */
856 1.1 cgd if (c < 0 || c == '\n')
857 1.1 cgd break;
858 1.5 mycroft if ((c &= TRIM) != '\0') {
859 1.1 cgd *lbp++ = c;
860 1.1 cgd if (--lcnt < 0) {
861 1.1 cgd setname("<<");
862 1.1 cgd stderror(ERR_NAME | ERR_OVERFLOW);
863 1.1 cgd }
864 1.1 cgd }
865 1.1 cgd }
866 1.1 cgd *lbp = 0;
867 1.1 cgd
868 1.1 cgd /*
869 1.1 cgd * Check for EOF or compare to terminator -- before expansion
870 1.1 cgd */
871 1.1 cgd if (c < 0 || eq(lbuf, term)) {
872 1.17 wiz (void)write(0, short2str(obuf), (size_t)(BUFSIZE - ocnt));
873 1.17 wiz (void)lseek(0, (off_t)0, SEEK_SET);
874 1.1 cgd return;
875 1.1 cgd }
876 1.1 cgd
877 1.1 cgd /*
878 1.1 cgd * If term was quoted or -n just pass it on
879 1.1 cgd */
880 1.1 cgd if (quoted || noexec) {
881 1.1 cgd *lbp++ = '\n';
882 1.1 cgd *lbp = 0;
883 1.5 mycroft for (lbp = lbuf; (c = *lbp++) != '\0';) {
884 1.1 cgd *obp++ = c;
885 1.1 cgd if (--ocnt == 0) {
886 1.14 christos (void) write(0, short2str(obuf), BUFSIZE);
887 1.1 cgd obp = obuf;
888 1.14 christos ocnt = BUFSIZE;
889 1.1 cgd }
890 1.1 cgd }
891 1.1 cgd continue;
892 1.1 cgd }
893 1.1 cgd
894 1.1 cgd /*
895 1.1 cgd * Term wasn't quoted so variable and then command expand the input
896 1.1 cgd * line
897 1.1 cgd */
898 1.1 cgd Dcp = lbuf;
899 1.1 cgd Dvp = Dv + 1;
900 1.1 cgd mbp = mbuf;
901 1.14 christos mcnt = BUFSIZE - 4;
902 1.1 cgd for (;;) {
903 1.1 cgd c = DgetC(DODOL);
904 1.1 cgd if (c == DEOF)
905 1.1 cgd break;
906 1.1 cgd if ((c &= TRIM) == 0)
907 1.1 cgd continue;
908 1.1 cgd /* \ quotes \ $ ` here */
909 1.1 cgd if (c == '\\') {
910 1.1 cgd c = DgetC(0);
911 1.1 cgd if (!any("$\\`", c))
912 1.1 cgd unDgetC(c | QUOTE), c = '\\';
913 1.1 cgd else
914 1.1 cgd c |= QUOTE;
915 1.1 cgd }
916 1.1 cgd *mbp++ = c;
917 1.1 cgd if (--mcnt == 0) {
918 1.1 cgd setname("<<");
919 1.1 cgd stderror(ERR_NAME | ERR_OVERFLOW);
920 1.1 cgd }
921 1.1 cgd }
922 1.1 cgd *mbp++ = 0;
923 1.1 cgd
924 1.1 cgd /*
925 1.1 cgd * If any ` in line do command substitution
926 1.1 cgd */
927 1.1 cgd mbp = mbuf;
928 1.1 cgd if (any(short2str(mbp), '`')) {
929 1.1 cgd /*
930 1.1 cgd * 1 arg to dobackp causes substitution to be literal. Words are
931 1.1 cgd * broken only at newlines so that all blanks and tabs are
932 1.1 cgd * preserved. Blank lines (null words) are not discarded.
933 1.1 cgd */
934 1.1 cgd vp = dobackp(mbuf, 1);
935 1.1 cgd }
936 1.1 cgd else
937 1.1 cgd /* Setup trivial vector similar to return of dobackp */
938 1.1 cgd Dv[0] = mbp, Dv[1] = NULL, vp = Dv;
939 1.1 cgd
940 1.1 cgd /*
941 1.1 cgd * Resurrect the words from the command substitution each separated by
942 1.1 cgd * a newline. Note that the last newline of a command substitution
943 1.1 cgd * will have been discarded, but we put a newline after the last word
944 1.1 cgd * because this represents the newline after the last input line!
945 1.1 cgd */
946 1.1 cgd for (; *vp; vp++) {
947 1.1 cgd for (mbp = *vp; *mbp; mbp++) {
948 1.1 cgd *obp++ = *mbp & TRIM;
949 1.1 cgd if (--ocnt == 0) {
950 1.17 wiz (void)write(0, short2str(obuf), BUFSIZE);
951 1.1 cgd obp = obuf;
952 1.14 christos ocnt = BUFSIZE;
953 1.1 cgd }
954 1.1 cgd }
955 1.1 cgd *obp++ = '\n';
956 1.1 cgd if (--ocnt == 0) {
957 1.17 wiz (void)write(0, short2str(obuf), BUFSIZE);
958 1.1 cgd obp = obuf;
959 1.14 christos ocnt = BUFSIZE;
960 1.1 cgd }
961 1.1 cgd }
962 1.1 cgd if (pargv)
963 1.1 cgd blkfree(pargv), pargv = 0;
964 1.1 cgd }
965 1.1 cgd }
966