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