gram.y revision 1.3 1 1.1 cgd %{
2 1.1 cgd /*
3 1.3 cgd * Copyright (c) 1983, 1993
4 1.3 cgd * The Regents of the University of California. All rights reserved.
5 1.1 cgd *
6 1.1 cgd * Redistribution and use in source and binary forms, with or without
7 1.1 cgd * modification, are permitted provided that the following conditions
8 1.1 cgd * are met:
9 1.1 cgd * 1. Redistributions of source code must retain the above copyright
10 1.1 cgd * notice, this list of conditions and the following disclaimer.
11 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer in the
13 1.1 cgd * documentation and/or other materials provided with the distribution.
14 1.1 cgd * 3. All advertising materials mentioning features or use of this software
15 1.1 cgd * must display the following acknowledgement:
16 1.1 cgd * This product includes software developed by the University of
17 1.1 cgd * California, Berkeley and its contributors.
18 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.1 cgd #ifndef lint
36 1.3 cgd /* from: static char sccsid[] = "@(#)gram.y 8.1 (Berkeley) 6/9/93"; */
37 1.3 cgd static char *rcsid = "$Id: gram.y,v 1.3 1994/03/07 05:05:30 cgd Exp $";
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.1 cgd #include "defs.h"
41 1.1 cgd
42 1.1 cgd struct cmd *cmds = NULL;
43 1.1 cgd struct cmd *last_cmd;
44 1.1 cgd struct namelist *last_n;
45 1.1 cgd struct subcmd *last_sc;
46 1.1 cgd
47 1.3 cgd static char *makestr __P((char *));
48 1.3 cgd
49 1.1 cgd %}
50 1.1 cgd
51 1.1 cgd %term EQUAL 1
52 1.1 cgd %term LP 2
53 1.1 cgd %term RP 3
54 1.1 cgd %term SM 4
55 1.1 cgd %term ARROW 5
56 1.1 cgd %term COLON 6
57 1.1 cgd %term DCOLON 7
58 1.1 cgd %term NAME 8
59 1.1 cgd %term STRING 9
60 1.1 cgd %term INSTALL 10
61 1.1 cgd %term NOTIFY 11
62 1.1 cgd %term EXCEPT 12
63 1.1 cgd %term PATTERN 13
64 1.1 cgd %term SPECIAL 14
65 1.1 cgd %term OPTION 15
66 1.1 cgd
67 1.1 cgd %union {
68 1.1 cgd int intval;
69 1.1 cgd char *string;
70 1.1 cgd struct subcmd *subcmd;
71 1.1 cgd struct namelist *namel;
72 1.1 cgd }
73 1.1 cgd
74 1.1 cgd %type <intval> OPTION, options
75 1.1 cgd %type <string> NAME, STRING
76 1.1 cgd %type <subcmd> INSTALL, NOTIFY, EXCEPT, PATTERN, SPECIAL, cmdlist, cmd
77 1.1 cgd %type <namel> namelist, names, opt_namelist
78 1.1 cgd
79 1.1 cgd %%
80 1.1 cgd
81 1.1 cgd file: /* VOID */
82 1.1 cgd | file command
83 1.1 cgd ;
84 1.1 cgd
85 1.1 cgd command: NAME EQUAL namelist = {
86 1.1 cgd (void) lookup($1, INSERT, $3);
87 1.1 cgd }
88 1.1 cgd | namelist ARROW namelist cmdlist = {
89 1.1 cgd insert(NULL, $1, $3, $4);
90 1.1 cgd }
91 1.1 cgd | NAME COLON namelist ARROW namelist cmdlist = {
92 1.1 cgd insert($1, $3, $5, $6);
93 1.1 cgd }
94 1.1 cgd | namelist DCOLON NAME cmdlist = {
95 1.1 cgd append(NULL, $1, $3, $4);
96 1.1 cgd }
97 1.1 cgd | NAME COLON namelist DCOLON NAME cmdlist = {
98 1.1 cgd append($1, $3, $5, $6);
99 1.1 cgd }
100 1.1 cgd | error
101 1.1 cgd ;
102 1.1 cgd
103 1.1 cgd namelist: NAME = {
104 1.1 cgd $$ = makenl($1);
105 1.1 cgd }
106 1.1 cgd | LP names RP = {
107 1.1 cgd $$ = $2;
108 1.1 cgd }
109 1.1 cgd ;
110 1.1 cgd
111 1.1 cgd names: /* VOID */ {
112 1.1 cgd $$ = last_n = NULL;
113 1.1 cgd }
114 1.1 cgd | names NAME = {
115 1.1 cgd if (last_n == NULL)
116 1.1 cgd $$ = last_n = makenl($2);
117 1.1 cgd else {
118 1.1 cgd last_n->n_next = makenl($2);
119 1.1 cgd last_n = last_n->n_next;
120 1.1 cgd $$ = $1;
121 1.1 cgd }
122 1.1 cgd }
123 1.1 cgd ;
124 1.1 cgd
125 1.1 cgd cmdlist: /* VOID */ {
126 1.1 cgd $$ = last_sc = NULL;
127 1.1 cgd }
128 1.1 cgd | cmdlist cmd = {
129 1.1 cgd if (last_sc == NULL)
130 1.1 cgd $$ = last_sc = $2;
131 1.1 cgd else {
132 1.1 cgd last_sc->sc_next = $2;
133 1.1 cgd last_sc = $2;
134 1.1 cgd $$ = $1;
135 1.1 cgd }
136 1.1 cgd }
137 1.1 cgd ;
138 1.1 cgd
139 1.1 cgd cmd: INSTALL options opt_namelist SM = {
140 1.1 cgd register struct namelist *nl;
141 1.1 cgd
142 1.1 cgd $1->sc_options = $2 | options;
143 1.1 cgd if ($3 != NULL) {
144 1.1 cgd nl = expand($3, E_VARS);
145 1.1 cgd if (nl) {
146 1.1 cgd if (nl->n_next != NULL)
147 1.1 cgd yyerror("only one name allowed\n");
148 1.1 cgd $1->sc_name = nl->n_name;
149 1.1 cgd free(nl);
150 1.1 cgd } else
151 1.1 cgd $1->sc_name = NULL;
152 1.1 cgd }
153 1.1 cgd $$ = $1;
154 1.1 cgd }
155 1.1 cgd | NOTIFY namelist SM = {
156 1.1 cgd if ($2 != NULL)
157 1.1 cgd $1->sc_args = expand($2, E_VARS);
158 1.1 cgd $$ = $1;
159 1.1 cgd }
160 1.1 cgd | EXCEPT namelist SM = {
161 1.1 cgd if ($2 != NULL)
162 1.1 cgd $1->sc_args = expand($2, E_ALL);
163 1.1 cgd $$ = $1;
164 1.1 cgd }
165 1.1 cgd | PATTERN namelist SM = {
166 1.1 cgd struct namelist *nl;
167 1.1 cgd char *cp, *re_comp();
168 1.1 cgd
169 1.1 cgd for (nl = $2; nl != NULL; nl = nl->n_next)
170 1.1 cgd if ((cp = re_comp(nl->n_name)) != NULL)
171 1.1 cgd yyerror(cp);
172 1.1 cgd $1->sc_args = expand($2, E_VARS);
173 1.1 cgd $$ = $1;
174 1.1 cgd }
175 1.1 cgd | SPECIAL opt_namelist STRING SM = {
176 1.1 cgd if ($2 != NULL)
177 1.1 cgd $1->sc_args = expand($2, E_ALL);
178 1.1 cgd $1->sc_name = $3;
179 1.1 cgd $$ = $1;
180 1.1 cgd }
181 1.1 cgd ;
182 1.1 cgd
183 1.1 cgd options: /* VOID */ = {
184 1.1 cgd $$ = 0;
185 1.1 cgd }
186 1.1 cgd | options OPTION = {
187 1.1 cgd $$ |= $2;
188 1.1 cgd }
189 1.1 cgd ;
190 1.1 cgd
191 1.1 cgd opt_namelist: /* VOID */ = {
192 1.1 cgd $$ = NULL;
193 1.1 cgd }
194 1.1 cgd | namelist = {
195 1.1 cgd $$ = $1;
196 1.1 cgd }
197 1.1 cgd ;
198 1.1 cgd
199 1.1 cgd %%
200 1.1 cgd
201 1.1 cgd int yylineno = 1;
202 1.1 cgd extern FILE *fin;
203 1.1 cgd
204 1.3 cgd int
205 1.1 cgd yylex()
206 1.1 cgd {
207 1.1 cgd static char yytext[INMAX];
208 1.1 cgd register int c;
209 1.1 cgd register char *cp1, *cp2;
210 1.1 cgd static char quotechars[] = "[]{}*?$";
211 1.1 cgd
212 1.1 cgd again:
213 1.1 cgd switch (c = getc(fin)) {
214 1.1 cgd case EOF: /* end of file */
215 1.1 cgd return(0);
216 1.1 cgd
217 1.1 cgd case '#': /* start of comment */
218 1.1 cgd while ((c = getc(fin)) != EOF && c != '\n')
219 1.1 cgd ;
220 1.1 cgd if (c == EOF)
221 1.1 cgd return(0);
222 1.1 cgd case '\n':
223 1.1 cgd yylineno++;
224 1.1 cgd case ' ':
225 1.1 cgd case '\t': /* skip blanks */
226 1.1 cgd goto again;
227 1.1 cgd
228 1.1 cgd case '=': /* EQUAL */
229 1.1 cgd return(EQUAL);
230 1.1 cgd
231 1.1 cgd case '(': /* LP */
232 1.1 cgd return(LP);
233 1.1 cgd
234 1.1 cgd case ')': /* RP */
235 1.1 cgd return(RP);
236 1.1 cgd
237 1.1 cgd case ';': /* SM */
238 1.1 cgd return(SM);
239 1.1 cgd
240 1.1 cgd case '-': /* -> */
241 1.1 cgd if ((c = getc(fin)) == '>')
242 1.1 cgd return(ARROW);
243 1.1 cgd ungetc(c, fin);
244 1.1 cgd c = '-';
245 1.1 cgd break;
246 1.1 cgd
247 1.1 cgd case '"': /* STRING */
248 1.1 cgd cp1 = yytext;
249 1.1 cgd cp2 = &yytext[INMAX - 1];
250 1.1 cgd for (;;) {
251 1.1 cgd if (cp1 >= cp2) {
252 1.1 cgd yyerror("command string too long\n");
253 1.1 cgd break;
254 1.1 cgd }
255 1.1 cgd c = getc(fin);
256 1.1 cgd if (c == EOF || c == '"')
257 1.1 cgd break;
258 1.1 cgd if (c == '\\') {
259 1.1 cgd if ((c = getc(fin)) == EOF) {
260 1.1 cgd *cp1++ = '\\';
261 1.1 cgd break;
262 1.1 cgd }
263 1.1 cgd }
264 1.1 cgd if (c == '\n') {
265 1.1 cgd yylineno++;
266 1.1 cgd c = ' '; /* can't send '\n' */
267 1.1 cgd }
268 1.1 cgd *cp1++ = c;
269 1.1 cgd }
270 1.1 cgd if (c != '"')
271 1.1 cgd yyerror("missing closing '\"'\n");
272 1.1 cgd *cp1 = '\0';
273 1.1 cgd yylval.string = makestr(yytext);
274 1.1 cgd return(STRING);
275 1.1 cgd
276 1.1 cgd case ':': /* : or :: */
277 1.1 cgd if ((c = getc(fin)) == ':')
278 1.1 cgd return(DCOLON);
279 1.1 cgd ungetc(c, fin);
280 1.1 cgd return(COLON);
281 1.1 cgd }
282 1.1 cgd cp1 = yytext;
283 1.1 cgd cp2 = &yytext[INMAX - 1];
284 1.1 cgd for (;;) {
285 1.1 cgd if (cp1 >= cp2) {
286 1.1 cgd yyerror("input line too long\n");
287 1.1 cgd break;
288 1.1 cgd }
289 1.1 cgd if (c == '\\') {
290 1.1 cgd if ((c = getc(fin)) != EOF) {
291 1.1 cgd if (any(c, quotechars))
292 1.1 cgd c |= QUOTE;
293 1.1 cgd } else {
294 1.1 cgd *cp1++ = '\\';
295 1.1 cgd break;
296 1.1 cgd }
297 1.1 cgd }
298 1.1 cgd *cp1++ = c;
299 1.1 cgd c = getc(fin);
300 1.1 cgd if (c == EOF || any(c, " \"'\t()=;:\n")) {
301 1.1 cgd ungetc(c, fin);
302 1.1 cgd break;
303 1.1 cgd }
304 1.1 cgd }
305 1.1 cgd *cp1 = '\0';
306 1.1 cgd if (yytext[0] == '-' && yytext[2] == '\0') {
307 1.1 cgd switch (yytext[1]) {
308 1.1 cgd case 'b':
309 1.1 cgd yylval.intval = COMPARE;
310 1.1 cgd return(OPTION);
311 1.1 cgd
312 1.1 cgd case 'R':
313 1.1 cgd yylval.intval = REMOVE;
314 1.1 cgd return(OPTION);
315 1.1 cgd
316 1.1 cgd case 'v':
317 1.1 cgd yylval.intval = VERIFY;
318 1.1 cgd return(OPTION);
319 1.1 cgd
320 1.1 cgd case 'w':
321 1.1 cgd yylval.intval = WHOLE;
322 1.1 cgd return(OPTION);
323 1.1 cgd
324 1.1 cgd case 'y':
325 1.1 cgd yylval.intval = YOUNGER;
326 1.1 cgd return(OPTION);
327 1.1 cgd
328 1.1 cgd case 'h':
329 1.1 cgd yylval.intval = FOLLOW;
330 1.1 cgd return(OPTION);
331 1.1 cgd
332 1.1 cgd case 'i':
333 1.1 cgd yylval.intval = IGNLNKS;
334 1.1 cgd return(OPTION);
335 1.1 cgd }
336 1.1 cgd }
337 1.1 cgd if (!strcmp(yytext, "install"))
338 1.1 cgd c = INSTALL;
339 1.1 cgd else if (!strcmp(yytext, "notify"))
340 1.1 cgd c = NOTIFY;
341 1.1 cgd else if (!strcmp(yytext, "except"))
342 1.1 cgd c = EXCEPT;
343 1.1 cgd else if (!strcmp(yytext, "except_pat"))
344 1.1 cgd c = PATTERN;
345 1.1 cgd else if (!strcmp(yytext, "special"))
346 1.1 cgd c = SPECIAL;
347 1.1 cgd else {
348 1.1 cgd yylval.string = makestr(yytext);
349 1.1 cgd return(NAME);
350 1.1 cgd }
351 1.1 cgd yylval.subcmd = makesubcmd(c);
352 1.1 cgd return(c);
353 1.1 cgd }
354 1.1 cgd
355 1.3 cgd int
356 1.1 cgd any(c, str)
357 1.1 cgd register int c;
358 1.1 cgd register char *str;
359 1.1 cgd {
360 1.1 cgd while (*str)
361 1.1 cgd if (c == *str++)
362 1.1 cgd return(1);
363 1.1 cgd return(0);
364 1.1 cgd }
365 1.1 cgd
366 1.1 cgd /*
367 1.1 cgd * Insert or append ARROW command to list of hosts to be updated.
368 1.1 cgd */
369 1.3 cgd void
370 1.1 cgd insert(label, files, hosts, subcmds)
371 1.1 cgd char *label;
372 1.1 cgd struct namelist *files, *hosts;
373 1.1 cgd struct subcmd *subcmds;
374 1.1 cgd {
375 1.1 cgd register struct cmd *c, *prev, *nc;
376 1.1 cgd register struct namelist *h;
377 1.1 cgd
378 1.1 cgd files = expand(files, E_VARS|E_SHELL);
379 1.1 cgd hosts = expand(hosts, E_ALL);
380 1.1 cgd for (h = hosts; h != NULL; free(h), h = h->n_next) {
381 1.1 cgd /*
382 1.1 cgd * Search command list for an update to the same host.
383 1.1 cgd */
384 1.1 cgd for (prev = NULL, c = cmds; c!=NULL; prev = c, c = c->c_next) {
385 1.1 cgd if (strcmp(c->c_name, h->n_name) == 0) {
386 1.1 cgd do {
387 1.1 cgd prev = c;
388 1.1 cgd c = c->c_next;
389 1.1 cgd } while (c != NULL &&
390 1.1 cgd strcmp(c->c_name, h->n_name) == 0);
391 1.1 cgd break;
392 1.1 cgd }
393 1.1 cgd }
394 1.1 cgd /*
395 1.1 cgd * Insert new command to update host.
396 1.1 cgd */
397 1.1 cgd nc = ALLOC(cmd);
398 1.1 cgd if (nc == NULL)
399 1.1 cgd fatal("ran out of memory\n");
400 1.1 cgd nc->c_type = ARROW;
401 1.1 cgd nc->c_name = h->n_name;
402 1.1 cgd nc->c_label = label;
403 1.1 cgd nc->c_files = files;
404 1.1 cgd nc->c_cmds = subcmds;
405 1.1 cgd nc->c_next = c;
406 1.1 cgd if (prev == NULL)
407 1.1 cgd cmds = nc;
408 1.1 cgd else
409 1.1 cgd prev->c_next = nc;
410 1.1 cgd /* update last_cmd if appending nc to cmds */
411 1.1 cgd if (c == NULL)
412 1.1 cgd last_cmd = nc;
413 1.1 cgd }
414 1.1 cgd }
415 1.1 cgd
416 1.1 cgd /*
417 1.1 cgd * Append DCOLON command to the end of the command list since these are always
418 1.1 cgd * executed in the order they appear in the distfile.
419 1.1 cgd */
420 1.3 cgd void
421 1.1 cgd append(label, files, stamp, subcmds)
422 1.1 cgd char *label;
423 1.1 cgd struct namelist *files;
424 1.1 cgd char *stamp;
425 1.1 cgd struct subcmd *subcmds;
426 1.1 cgd {
427 1.1 cgd register struct cmd *c;
428 1.1 cgd
429 1.1 cgd c = ALLOC(cmd);
430 1.1 cgd if (c == NULL)
431 1.1 cgd fatal("ran out of memory\n");
432 1.1 cgd c->c_type = DCOLON;
433 1.1 cgd c->c_name = stamp;
434 1.1 cgd c->c_label = label;
435 1.1 cgd c->c_files = expand(files, E_ALL);
436 1.1 cgd c->c_cmds = subcmds;
437 1.1 cgd c->c_next = NULL;
438 1.1 cgd if (cmds == NULL)
439 1.1 cgd cmds = last_cmd = c;
440 1.1 cgd else {
441 1.1 cgd last_cmd->c_next = c;
442 1.1 cgd last_cmd = c;
443 1.1 cgd }
444 1.1 cgd }
445 1.1 cgd
446 1.1 cgd /*
447 1.1 cgd * Error printing routine in parser.
448 1.1 cgd */
449 1.3 cgd void
450 1.1 cgd yyerror(s)
451 1.1 cgd char *s;
452 1.1 cgd {
453 1.3 cgd ++nerrs;
454 1.1 cgd fflush(stdout);
455 1.1 cgd fprintf(stderr, "rdist: line %d: %s\n", yylineno, s);
456 1.1 cgd }
457 1.1 cgd
458 1.1 cgd /*
459 1.1 cgd * Return a copy of the string.
460 1.1 cgd */
461 1.3 cgd static char *
462 1.1 cgd makestr(str)
463 1.1 cgd char *str;
464 1.1 cgd {
465 1.1 cgd register char *cp, *s;
466 1.1 cgd
467 1.1 cgd str = cp = malloc(strlen(s = str) + 1);
468 1.1 cgd if (cp == NULL)
469 1.1 cgd fatal("ran out of memory\n");
470 1.1 cgd while (*cp++ = *s++)
471 1.1 cgd ;
472 1.1 cgd return(str);
473 1.1 cgd }
474 1.1 cgd
475 1.1 cgd /*
476 1.1 cgd * Allocate a namelist structure.
477 1.1 cgd */
478 1.1 cgd struct namelist *
479 1.1 cgd makenl(name)
480 1.1 cgd char *name;
481 1.1 cgd {
482 1.1 cgd register struct namelist *nl;
483 1.1 cgd
484 1.1 cgd nl = ALLOC(namelist);
485 1.1 cgd if (nl == NULL)
486 1.1 cgd fatal("ran out of memory\n");
487 1.1 cgd nl->n_name = name;
488 1.1 cgd nl->n_next = NULL;
489 1.1 cgd return(nl);
490 1.1 cgd }
491 1.1 cgd
492 1.1 cgd /*
493 1.1 cgd * Make a sub command for lists of variables, commands, etc.
494 1.1 cgd */
495 1.1 cgd struct subcmd *
496 1.3 cgd makesubcmd(type)
497 1.1 cgd int type;
498 1.1 cgd {
499 1.1 cgd register struct subcmd *sc;
500 1.1 cgd
501 1.1 cgd sc = ALLOC(subcmd);
502 1.1 cgd if (sc == NULL)
503 1.1 cgd fatal("ran out of memory\n");
504 1.1 cgd sc->sc_type = type;
505 1.1 cgd sc->sc_args = NULL;
506 1.1 cgd sc->sc_next = NULL;
507 1.1 cgd sc->sc_name = NULL;
508 1.1 cgd return(sc);
509 1.1 cgd }
510