1 /*
2 * C command
3 * written by John F. Reiser
4 * July/August 1978
5 */
6 /* Copyright (c) 2012 Joyent, Inc. All rights reserved. */
7 /*
8 * This implementation is based on the UNIX 32V release from 1978
9 * with permission from Caldera Inc.
10 *
11 * Copyright (c) 2010 J. Schilling
12 * All rights reserved.
13 *
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions
16 * are met:
17 * 1. Redistributions of source code must retain the above copyright
18 * notice, this list of conditions and the following disclaimer.
19 * 2. Redistributions in binary form must reproduce the above copyright
20 * notice, this list of conditions and the following disclaimer in the
21 * documentation and/or other materials provided with the distribution.
22 * 3. Neither the name of the copyright holder nor the names of contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 */
38 /*
39 * Copyright(C) Caldera International Inc. 2001-2002. All rights reserved.
40 *
41 * Redistribution and use in source and binary forms, with or without
42 * modification, are permitted provided that the following conditions are
43 * met:
44 * 1. Redistributions of source code and documentation must retain the above
45 * copyright notice, this list of conditions and the following
46 * disclaimer.
47 *
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 *
52 * 3. All advertising materials mentioning features or use of this software
53 * must display the following acknowledgement: This product includes
54 * software developed or owned by Caldera International, Inc.
55 *
56 * 4. Neither the name of Caldera International, Inc. nor the names of other
57 * contributors may be used to endorse or promote products derived from
58 * this software without specific prior written permission.
59 *
60 * USE OF THE SOFTWARE PROVIDED FOR UNDER THIS LICENSE BY CALDERA
61 * INTERNATIONAL, INC. AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
62 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
63 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
64 * DISCLAIMED. IN NO EVENT SHALL CALDERA INTERNATIONAL, INC. BE LIABLE FOR
65 * ANY DIRECT, INDIRECT INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
66 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
67 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
68 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
69 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
70 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
71 * POSSIBILITY OF SUCH DAMAGE.
72 */
73 #include <stdio.h>
74 #include <unistd.h>
75 #include <stdlib.h>
76 #include <fcntl.h>
77 #include <string.h>
78 #include <stdarg.h>
79
80 #include "cpp.h"
81
82 #define SYMLEN 128
83 static int symlen = SYMLEN;
84
85
86 #define SALT '#'
87 #ifndef BUFSIZ
88 #define BUFSIZ 512
89 #endif
90
91 static char *pbeg;
92 static char *pbuf;
93 static char *pend;
94 char *outp,*inp;
95 char *newp;
96 static char cinit;
97
98 /* some code depends on whether characters are sign or zero extended */
99 /* #if '\377' < 0 not used here, old cpp doesn't understand */
100 #if pdp11 | vax | '\377' < 0
101 #define COFF 128
102 #else
103 #define COFF 0
104 #endif
105
106 #define ALFSIZ 256 /* alphabet size */
107 static char macbit[ALFSIZ+11];
108 static char toktyp[ALFSIZ];
109 #define BLANK 1 /* white space (" \t\v\f\r") */
110 #define IDENT 2 /* valid char for identifier names */
111 #define NUMBR 3 /* chars is of "0123456789." */
112
113 /*
114 * a superimposed code is used to reduce the number of calls to the
115 * symbol table lookup routine. (if the kth character of an identifier
116 * is 'a' and there are no macro names whose kth character is 'a'
117 * then the identifier cannot be a macro name, hence there is no need
118 * to look in the symbol table.) 'scw1' enables the test based on
119 * single characters and their position in the identifier. 'scw2'
120 * enables the test based on adjacent pairs of characters and their
121 * position in the identifier. scw1 typically costs 1 indexed fetch,
122 * an AND, and a jump per character of identifier, until the identifier
123 * is known as a non-macro name or until the end of the identifier.
124 * scw1 is inexpensive. scw2 typically costs 4 indexed fetches,
125 * an add, an AND, and a jump per character of identifier, but it is also
126 * slightly more effective at reducing symbol table searches.
127 * scw2 usually costs too much because the symbol table search is
128 * usually short; but if symbol table search should become expensive,
129 * the code is here.
130 * using both scw1 and scw2 is of dubious value.
131 */
132 #define scw1 1
133 #define scw2 0
134
135 #if scw2
136 char t21[ALFSIZ],t22[ALFSIZ],t23[ALFSIZ+SYMLEN];
137 #endif
138
139 #if scw1
140 #define b0 1
141 #define b1 2
142 #define b2 4
143 #define b3 8
144 #define b4 16
145 #define b5 32
146 #define b6 64
147 #define b7 128
148 #endif
149
150 #define IB 1
151 #define SB 2
152 #define NB 4
153 #define CB 8
154 #define QB 16
155 #define WB 32
156 char fastab[ALFSIZ];
157 static char slotab[ALFSIZ];
158 static char *ptrtab;
159
160 /*
161 * Cast the array index to int in order to avoid GCCs warnings:
162 * warning: subscript has type `char'
163 */
164 #define isslo (ptrtab==(slotab+COFF))
165 #define isid(a) ((fastab+COFF)[(int)a]&IB)
166 #define isspc(a) (ptrtab[(int)a]&SB)
167 #define isnum(a) ((fastab+COFF)[(int)a]&NB)
168 #define iscom(a) ((fastab+COFF)[(int)a]&CB)
169 #define isquo(a) ((fastab+COFF)[(int)a]&QB)
170 #define iswarn(a) ((fastab+COFF)[(int)a]&WB)
171
172 #define eob(a) ((a)>=pend)
173 #define bob(a) (pbeg>=(a))
174
175 #define BUFFERSIZ 8192
176 static char buffer[SYMLEN+BUFFERSIZ+BUFFERSIZ+SYMLEN];
177
178 /*
179 * SBSIZE was 12000 in 1978, we need to have a way to
180 * malloc more space.
181 */
182 #define SBSIZE 512000
183 static char sbf[SBSIZE];
184 static char *savch = sbf;
185
186 # define DROP 0xFE /* special character not legal ASCII or EBCDIC */
187 # define WARN DROP
188 # define SAME 0
189 # define MAXINC 16 /* max include nesting depth */
190 # define MAXIDIRS 20 /* max # of -I directories */
191 # define MAXFRE 14 /* max buffers of macro pushback */
192 # define MAXFRM 31 /* max number of formals/actuals to a macro */
193
194 static char warnc = (char)WARN;
195
196 static int mactop;
197 static int fretop;
198 static char *instack[MAXFRE];
199 static char *bufstack[MAXFRE];
200 static char *endbuf[MAXFRE];
201
202 static int plvl; /* parenthesis level during scan for macro actuals */
203 static int maclin; /* line number of macro call requiring actuals */
204 static char *macfil; /* file name of macro call requiring actuals */
205 static char *macnam; /* name of macro requiring actuals */
206 static int maclvl; /* # calls since last decrease in nesting level */
207 static char *macforw; /* ptr which must be exceeded to decrease nesting lvl */
208 static int macdam; /* offset to macforw due to buffer shifting */
209
210 #if tgp
211 int tgpscan; /* flag for dump(); */
212 #endif
213
214 static int inctop[MAXINC];
215 static char *fnames[MAXINC];
216 static char *dirnams[MAXINC]; /* actual directory of #include files */
217 static int fins[MAXINC];
218 static int lineno[MAXINC];
219
220 /*
221 * We need:
222 * "" include dir as dirs[0] +
223 * MAXIDIRS +
224 * system default include dir +
225 * a NULL pointer at the end
226 */
227 static char *dirs[MAXIDIRS+3]; /* -I and <> directories */
228 static int fin = STDIN_FILENO;
229 static FILE *fout; /* Init in main(), Mac OS is nonPOSIX */
230 static int nd = 1;
231 static int pflag; /* don't put out lines "# 12 foo.c" */
232 static int passcom; /* don't delete comments */
233 static int rflag; /* allow macro recursion */
234 static int hflag; /* Print included filenames */
235 static int nopredef; /* -undef all */
236 static int ifno;
237 # define NPREDEF 64
238 static char *prespc[NPREDEF];
239 static char **predef = prespc;
240 static char *punspc[NPREDEF];
241 static char **prund = punspc;
242 static int exfail;
243 static struct symtab *lastsym;
244
245
246 static void sayline(char *);
247 static void dump(void);
248 static char *refill(char *);
249 static char *cotoken(char *);
250 char *skipbl(char *);
251 static char *unfill(char *);
252 static char *doincl(char *);
253 static int equfrm(char *, char *, char *);
254 static char *dodef(char *);
255 static char *control(char *);
256 static struct symtab *stsym(char *);
257 static struct symtab *ppsym(char *);
258 void pperror(char *fmt, ...);
259 void yyerror(char *fmt, ...);
260 static void ppwarn(char *fmt, ...);
261 struct symtab *lookup(char *, int);
262 static struct symtab *slookup(char *, char *, int);
263 static char *subst(char *, struct symtab *);
264 static char *trmdir(char *);
265 static char *copy(char *);
266 static char *strdex(char *, int);
267 int yywrap(void);
268 int main(int argc, char **argav);
269
270
271 #define symsiz 4000
272 static struct symtab stab[symsiz];
273
274 static struct symtab *defloc;
275 static struct symtab *udfloc;
276 static struct symtab *incloc;
277 static struct symtab *ifloc;
278 static struct symtab *elsloc;
279 static struct symtab *eifloc;
280 static struct symtab *elifloc;
281 static struct symtab *ifdloc;
282 static struct symtab *ifnloc;
283 static struct symtab *ysysloc;
284 static struct symtab *varloc;
285 static struct symtab *lneloc;
286 static struct symtab *ulnloc;
287 static struct symtab *uflloc;
288 static struct symtab *idtloc;
289 static struct symtab *pragmaloc;
290 static struct symtab *errorloc;
291 static int trulvl;
292 int flslvl;
293 static int elflvl;
294 static int elslvl;
295
296 /*
297 * The sun cpp prints a classification token past the
298 * "# linenumber filename" lines:
299 */
300 #define NOINCLUDE "" /* Not related to enter/leave incl. file */
301 #define ENTERINCLUDE "1" /* We are just entering an include file */
302 #define LEAVEINCLUDE "2" /* We are just leaving an include file */
303
304 /* ARGSUSED */
305 static void
306 sayline(what)
307 char *what;
308 {
309 if (pflag==0)
310 fprintf(fout,"# %d \"%s\" %s\n", lineno[ifno], fnames[ifno], what);
311 }
312
313 /*
314 * data structure guide
315 *
316 * most of the scanning takes place in the buffer:
317 *
318 * (low address) (high address)
319 * pbeg pbuf pend
320 * | <-- BUFFERSIZ chars --> | <-- BUFFERSIZ chars --> |
321 * _______________________________________________________________________
322 * |_______________________________________________________________________|
323 * | | |
324 * |<-- waiting -->| |<-- waiting -->
325 * | to be |<-- current -->| to be
326 * | written | token | scanned
327 * | | |
328 * outp inp p
329 *
330 * *outp first char not yet written to output file
331 * *inp first char of current token
332 * *p first char not yet scanned
333 *
334 * macro expansion: write from *outp to *inp (chars waiting to be written),
335 * ignore from *inp to *p (chars of the macro call), place generated
336 * characters in front of *p (in reverse order), update pointers,
337 * resume scanning.
338 *
339 * symbol table pointers point to just beyond the end of macro definitions;
340 * the first preceding character is the number of formal parameters.
341 * the appearance of a formal in the body of a definition is marked by
342 * 2 chars: the char WARN, and a char containing the parameter number.
343 * the first char of a definition is preceded by a zero character.
344 *
345 * when macro expansion attempts to back up over the beginning of the
346 * buffer, some characters preceding *pend are saved in a side buffer,
347 * the address of the side buffer is put on 'instack', and the rest
348 * of the main buffer is moved to the right. the end of the saved buffer
349 * is kept in 'endbuf' since there may be nulls in the saved buffer.
350 *
351 * similar action is taken when an 'include' statement is processed,
352 * except that the main buffer must be completely emptied. the array
353 * element 'inctop[ifno]' records the last side buffer saved when
354 * file 'ifno' was included. these buffers remain dormant while
355 * the file is being read, and are reactivated at end-of-file.
356 *
357 * instack[0 : mactop] holds the addresses of all pending side buffers.
358 * instack[inctop[ifno]+1 : mactop-1] holds the addresses of the side
359 * buffers which are "live"; the side buffers instack[0 : inctop[ifno]]
360 * are dormant, waiting for end-of-file on the current file.
361 *
362 * space for side buffers is obtained from 'savch' and is never returned.
363 * bufstack[0:fretop-1] holds addresses of side buffers which
364 * are available for use.
365 */
366
367 static void
368 dump() {
369 /*
370 * write part of buffer which lies between outp and inp .
371 * this should be a direct call to 'write', but the system slows to a crawl
372 * if it has to do an unaligned copy. thus we buffer. this silly loop
373 * is 15% of the total time, thus even the 'putc' macro is too slow.
374 */
375 register char *p1;
376 #if tgp
377 register char *p2;
378 #endif
379 register FILE *f;
380 if ((p1=outp)==inp || flslvl!=0) return;
381 #if tgp
382 #define MAXOUT 80
383 if (!tgpscan) {
384 /* scan again to insure <= MAXOUT chars between linefeeds */
385 register char c,*pblank; char savc,stopc,brk;
386 tgpscan=1; brk=stopc=pblank=0; p2=inp; savc= *p2; *p2='\0';
387 while (c= *p1++) {
388 if (c=='\\') c= *p1++;
389 if (stopc==c) stopc=0;
390 else if (c=='"' || c=='\'') stopc=c;
391 if (p1-outp>MAXOUT && pblank!=0) {
392 *pblank++='\n';
393 inp=pblank;
394 dump();
395 brk=1;
396 pblank=0;
397 }
398 if (c==' ' && stopc==0) pblank=p1-1;
399 }
400 if (brk) sayline(NOINCLUDE);
401 *p2=savc; inp=p2; p1=outp; tgpscan=0;
402 }
403 #endif
404 f=fout;
405 while (p1<inp)
406 putc(*p1++,f);
407 outp=p1;
408 }
409
410 static char *
411 refill(p) register char *p; {
412 /*
413 * dump buffer. save chars from inp to p. read into buffer at pbuf,
414 * contiguous with p. update pointers, return new p.
415 */
416 register char *np,*op; register int ninbuf;
417 dump(); np=pbuf-(p-inp); op=inp;
418 if (bob(np+1)) {pperror("token too long"); np=pbeg; p=inp+BUFFERSIZ;}
419 macdam += np-inp; outp=inp=np;
420 while (op<p) *np++= *op++;
421 p=np;
422 for (;;) {
423 if (mactop>inctop[ifno]) {
424 /* retrieve hunk of pushed-back macro text */
425 op=instack[--mactop]; np=pbuf;
426 do {
427 while ((*np++= *op++) != '\0');
428 } while (op<endbuf[mactop]); pend=np-1;
429 /* make buffer space avail for 'include' processing */
430 if (fretop<MAXFRE) bufstack[fretop++]=instack[mactop];
431 return(p);
432 } else {/* get more text from file(s) */
433 maclvl=0;
434 if (0<(ninbuf=read(fin,pbuf,BUFFERSIZ))) {
435 pend=pbuf+ninbuf; *pend='\0';
436 return(p);
437 }
438 /* end of #include file */
439 if (ifno==0) {/* end of input */
440 if (plvl!=0) {
441 int n=plvl,tlin=lineno[ifno];
442 char *tfil=fnames[ifno];
443 lineno[ifno]=maclin;
444 fnames[ifno]=macfil;
445 pperror("%s: unterminated macro call",
446 macnam);
447 lineno[ifno]=tlin; fnames[ifno]=tfil;
448 np=p;
449 /*
450 * shut off unterminated quoted string
451 */
452 *np++='\n';
453 /* supply missing parens */
454 while (--n>=0) *np++=')';
455 pend=np; *np='\0';
456 if (plvl<0) plvl=0;
457 return(p);
458 }
459 inp=p; dump(); exit(exfail);
460 }
461 close(fin);
462 fin=fins[--ifno];
463 dirs[0]=dirnams[ifno];
464 sayline(LEAVEINCLUDE);
465 }
466 }
467 }
468
469 #define BEG 0
470 #define LF 1
471
472 static char *
473 cotoken(p) register char *p; {
474 register int c,i; char quoc;
475 static int state = BEG;
476
477 if (state!=BEG) goto prevlf;
478 for (;;) {
479 again:
480 while (!isspc(*p++));
481 switch (*(inp=p-1)) {
482 case 0: {
483 if (eob(--p)) {p=refill(p); goto again;}
484 else ++p; /* ignore null byte */
485 } break;
486 case '|': case '&': for (;;) {/* sloscan only */
487 if (*p++== *inp) break;
488 if (eob(--p)) p=refill(p);
489 else break;
490 } break;
491 case '=': case '!': for (;;) {/* sloscan only */
492 if (*p++=='=') break;
493 if (eob(--p)) p=refill(p);
494 else break;
495 } break;
496 case '<': case '>': for (;;) {/* sloscan only */
497 if (*p++=='=' || p[-2]==p[-1]) break;
498 if (eob(--p)) p=refill(p);
499 else break;
500 } break;
501 case '\\': for (;;) {
502 if (*p++=='\n') {++lineno[ifno]; break;}
503 if (eob(--p)) p=refill(p);
504 else {++p; break;}
505 } break;
506 case '/': for (;;) {
507 if (*p++=='*') {/* comment */
508 if (!passcom) {inp=p-2; dump(); ++flslvl;}
509 for (;;) {
510 while (!iscom(*p++));
511 if (p[-1]=='*') for (;;) {
512 if (*p++=='/') goto endcom;
513 if (eob(--p)) {
514 if (!passcom) {
515 inp=p;
516 p=refill(p);
517 } else if ((p-inp)>=BUFFERSIZ) {
518 /* split long comment */
519 inp=p;
520 /*
521 * last char written
522 * is '*'
523 */
524 p=refill(p);
525 /*
526 * terminate first part
527 */
528 putc('/',fout);
529 /*
530 * and fake start of 2nd
531 */
532 outp=inp=p-=3;
533 *p++='/';
534 *p++='*';
535 *p++='*';
536 } else {
537 p=refill(p);
538 }
539 } else {
540 break;
541 }
542 } else if (p[-1]=='\n') {
543 ++lineno[ifno];
544 if (!passcom)
545 putc('\n',fout);
546 } else if (eob(--p)) {
547 if (!passcom) {
548 inp=p; p=refill(p);
549 } else if ((p-inp)>=BUFFERSIZ) {
550 /* split long comment */
551 inp=p; p=refill(p);
552 putc('*',fout); putc('/',fout);
553 outp=inp=p-=2;
554 *p++='/';
555 *p++='*';
556 } else {
557 p=refill(p);
558 }
559 } else {
560 ++p; /* ignore null byte */
561 }
562 }
563 endcom:
564 if (!passcom) {outp=inp=p; --flslvl; goto again;}
565 break;
566 }
567 if (eob(--p)) p=refill(p);
568 else break;
569 } break;
570 case '"': case '\'': {
571 quoc=p[-1];
572 for (;;) {
573 while (!isquo(*p++));
574 if (p[-1]==quoc)
575 break;
576 if (p[-1]=='\n') {
577 --p;
578 break;
579 } /* bare \n terminates quotation */
580 if (p[-1]=='\\') {
581 for (;;) {
582 if (*p++=='\n') {
583 ++lineno[ifno];
584 break;
585 } /* escaped \n ignored */
586 if (eob(--p)) {
587 p=refill(p);
588 } else {
589 ++p;
590 break;
591 }
592 }
593 } else if (eob(--p)) {
594 p=refill(p);
595 } else {
596 ++p; /* it was a different quote character */
597 }
598 }
599 } break;
600 case '\n': {
601 ++lineno[ifno]; if (isslo) {state=LF; return(p);}
602 prevlf:
603 state=BEG;
604 for (;;) {
605 if (*p++=='#') return(p);
606 if (eob(inp= --p)) p=refill(p);
607 else goto again;
608 }
609 }
610 /* NOTREACHED */
611 case '0': case '1': case '2': case '3': case '4':
612 case '5': case '6': case '7': case '8': case '9':
613 for (;;) {
614 while (isnum(*p++));
615 if (eob(--p)) p=refill(p);
616 else break;
617 } break;
618 case 'A': case 'B': case 'C': case 'D': case 'E':
619 case 'F': case 'G': case 'H': case 'I': case 'J':
620 case 'K': case 'L': case 'M': case 'N': case 'O':
621 case 'P': case 'Q': case 'R': case 'S': case 'T':
622 case 'U': case 'V': case 'W': case 'X': case 'Y':
623 case 'Z': case '_':
624 case 'a': case 'b': case 'c': case 'd': case 'e':
625 case 'f': case 'g': case 'h': case 'i': case 'j':
626 case 'k': case 'l': case 'm': case 'n': case 'o':
627 case 'p': case 'q': case 'r': case 's': case 't':
628 case 'u': case 'v': case 'w': case 'x': case 'y':
629 case 'z':
630 #if scw1
631 #define tmac1(c,bit) if (!xmac1(c,bit,&)) goto nomac
632 #define xmac1(c,bit,op) ((macbit+COFF)[c] op (bit))
633 #else
634 #define tmac1(c,bit)
635 #define xmac1(c,bit,op)
636 #endif
637
638 #if scw2
639 #define tmac2(c0,c1,cpos) if (!xmac2(c0,c1,cpos,&)) goto nomac
640 #define xmac2(c0,c1,cpos,op)\
641 ((macbit+COFF)[(t21+COFF)[c0]+(t22+COFF)[c1]] op (t23+COFF+cpos)[c0])
642 #else
643 #define tmac2(c0,c1,cpos)
644 #define xmac2(c0,c1,cpos,op)
645 #endif
646
647 if (flslvl) goto nomac;
648 for (;;) {
649 c= p[-1]; tmac1(c,b0);
650 i= *p++; if (!isid(i)) goto endid; tmac1(i,b1); tmac2(c,i,0);
651 c= *p++; if (!isid(c)) goto endid; tmac1(c,b2); tmac2(i,c,1);
652 i= *p++; if (!isid(i)) goto endid; tmac1(i,b3); tmac2(c,i,2);
653 c= *p++; if (!isid(c)) goto endid; tmac1(c,b4); tmac2(i,c,3);
654 i= *p++; if (!isid(i)) goto endid; tmac1(i,b5); tmac2(c,i,4);
655 c= *p++; if (!isid(c)) goto endid; tmac1(c,b6); tmac2(i,c,5);
656 i= *p++; if (!isid(i)) goto endid; tmac1(i,b7); tmac2(c,i,6);
657 tmac2(i,0,7);
658 while (isid(*p++));
659 if (eob(--p)) {refill(p); p=inp+1; continue;}
660 goto lokid;
661 endid:
662 if (eob(--p)) {refill(p); p=inp+1; continue;}
663 tmac2(p[-1],0,-1+(p-inp));
664 lokid:
665 slookup(inp,p,0); if (newp) {p=newp; goto again;}
666 else break;
667 nomac:
668 while (isid(*p++));
669 if (eob(--p)) {p=refill(p); goto nomac;}
670 else break;
671 } break;
672 } /* end of switch */
673
674 if (isslo) return(p);
675 } /* end of infinite loop */
676 }
677
678 char *
679 skipbl(p) register char *p; {/* get next non-blank token */
680 do {
681 outp=inp=p;
682 p=cotoken(p);
683 } while ((toktyp+COFF)[(int)*inp]==BLANK);
684 return(p);
685 }
686
687 static char *
688 unfill(p) register char *p; {
689 /*
690 * take <= BUFFERSIZ chars from right end of buffer and put them on instack .
691 * slide rest of buffer to the right, update pointers, return new p.
692 */
693 register char *np,*op; register int d;
694 if (mactop>=MAXFRE) {
695 pperror("%s: too much pushback",macnam);
696 p=inp=pend; dump(); /* begin flushing pushback */
697 while (mactop>inctop[ifno]) {p=refill(p); p=inp=pend; dump();}
698 }
699 if (fretop>0)
700 np=bufstack[--fretop];
701 else {
702 np=savch; savch+=BUFFERSIZ;
703 if (savch>=sbf+SBSIZE) {pperror("no space"); exit(exfail);}
704 *savch++='\0';
705 }
706 instack[mactop]=np; op=pend-BUFFERSIZ; if (op<p) op=p;
707 for (;;) {
708 while ((*np++= *op++) != '\0');
709 if (eob(op))
710 break;
711 } /* out with old */
712 endbuf[mactop++]=np; /* mark end of saved text */
713 np=pbuf+BUFFERSIZ;
714 op=pend-BUFFERSIZ;
715 pend=np;
716 if (op<p)
717 op=p;
718 while (outp<op) *--np= *--op; /* slide over new */
719 if (bob(np))
720 pperror("token too long");
721 d=np-outp; outp+=d; inp+=d; macdam+=d;
722 return(p+d);
723 }
724
725 static char *
726 doincl(p) register char *p; {
727 int filok,inctype;
728 register char *cp; char **dirp,*nfil; char filname[BUFFERSIZ];
729
730 filname[0] = '\0'; /* Make lint quiet */
731 p=skipbl(p); cp=filname;
732 if (*inp++=='<') {/* special <> syntax */
733 inctype=1;
734 for (;;) {
735 outp=inp=p; p=cotoken(p);
736 if (*inp=='\n') {--p; *cp='\0'; break;}
737 if (*inp=='>') { *cp='\0'; break;}
738 # ifdef gimpel
739 if (*inp=='.' && !intss()) *inp='#';
740 # endif
741 while (inp<p) *cp++= *inp++;
742 }
743 } else if (inp[-1]=='"') {/* regular "" syntax */
744 inctype=0;
745 # ifdef gimpel
746 while (inp<p) {if (*inp=='.' && !intss()) *inp='#'; *cp++= *inp++;}
747 # else
748 while (inp<p) *cp++= *inp++;
749 # endif
750 if (*--cp=='"') *cp='\0';
751 } else {pperror("bad include syntax",0); inctype=2;}
752 /* flush current file to \n , then write \n */
753 ++flslvl; do {outp=inp=p; p=cotoken(p);} while (*inp!='\n'); --flslvl;
754 inp=p; dump(); if (inctype==2) return(p);
755 /* look for included file */
756 if (ifno+1 >=MAXINC) {
757 pperror("Unreasonable include nesting",0); return(p);
758 }
759 if ((nfil=savch)>sbf+SBSIZE-BUFFERSIZ) {
760 pperror("no space");
761 exit(exfail);
762 }
763 filok=0;
764 for (dirp=dirs+inctype; *dirp; ++dirp) {
765 if (filname[0]=='/' || **dirp=='\0') {
766 strcpy(nfil,filname);
767 } else {
768 strcpy(nfil,*dirp);
769 # if unix
770 strcat(nfil,"/");
771 # endif
772 strcat(nfil,filname);
773 }
774 if (0<(fins[ifno+1]=open(nfil, O_RDONLY))) {
775 filok=1; fin=fins[++ifno]; break;
776 }
777 }
778 if (filok==0) {
779 pperror("Can't find include file %s",filname);
780 } else {
781 lineno[ifno]=1; fnames[ifno]=cp=nfil; while (*cp++); savch=cp;
782 dirnams[ifno]=dirs[0]=trmdir(copy(nfil));
783 sayline(ENTERINCLUDE);
784 if (hflag)
785 fprintf(stderr, "%s\n", nfil);
786 /* save current contents of buffer */
787 while (!eob(p)) p=unfill(p);
788 inctop[ifno]=mactop;
789 }
790 return(p);
791 }
792
793 static int
794 equfrm(a,p1,p2) register char *a,*p1,*p2; {
795 register char c; int flag;
796 c= *p2; *p2='\0';
797 flag=strcmp(a,p1); *p2=c; return(flag==SAME);
798 }
799
800 static char *
801 dodef(p) char *p; {/* process '#define' */
802 register char *pin,*psav,*cf;
803 char **pf,**qf; int b,c,params; struct symtab *np;
804 char *oldval,*oldsavch;
805 char *formal[MAXFRM]; /* formal[n] is name of nth formal */
806 char formtxt[BUFFERSIZ]; /* space for formal names */
807
808 formtxt[0] = '\0'; /* Make lint quiet */
809
810 if (savch>sbf+SBSIZE-BUFFERSIZ) {
811 pperror("too much defining");
812 return(p);
813 }
814 oldsavch=savch; /* to reclaim space if redefinition */
815 ++flslvl; /* prevent macro expansion during 'define' */
816 p=skipbl(p); pin=inp;
817 if ((toktyp+COFF)[(int)*pin]!=IDENT) {
818 ppwarn("illegal macro name");
819 while (*inp!='\n')
820 p=skipbl(p);
821 return(p);
822 }
823 np=slookup(pin,p,1);
824 if ((oldval=np->value) != NULL)
825 savch=oldsavch; /* was previously defined */
826 b=1; cf=pin;
827 while (cf<p) {/* update macbit */
828 c= *cf++; xmac1(c,b,|=); b=(b+b)&0xFF;
829 if (cf!=p) {
830 xmac2(c,*cf,-1+(cf-pin),|=);
831 } else {
832 xmac2(c,0,-1+(cf-pin),|=);
833 }
834 }
835 params=0; outp=inp=p; p=cotoken(p); pin=inp;
836 formal[0] = ""; /* Prepare for hack at next line... */
837 pf = formal; /* Make gcc/lint quiet, pf only used with params!=0 */
838 if (*pin=='(') {/* with parameters; identify the formals */
839 cf=formtxt; pf=formal;
840 for (;;) {
841 p=skipbl(p); pin=inp;
842 if (*pin=='\n') {
843 --lineno[ifno];
844 --p;
845 pperror("%s: missing )",np->name);
846 break;
847 }
848 if (*pin==')') break;
849 if (*pin==',') continue;
850 if ((toktyp+COFF)[(int)*pin]!=IDENT) {
851 c= *p;
852 *p='\0';
853 pperror("bad formal: %s",pin);
854 *p=c;
855 } else if (pf>= &formal[MAXFRM]) {
856 c= *p;
857 *p='\0';
858 pperror("too many formals: %s",pin);
859 *p=c;
860 } else {
861 *pf++=cf;
862 while (pin<p)
863 *cf++= *pin++;
864 *cf++='\0';
865 ++params;
866 }
867 }
868 if (params==0)
869 --params; /* #define foo() ... */
870 } else if (*pin=='\n') {
871 --lineno[ifno];
872 --p;
873 }
874 /*
875 * remember beginning of macro body, so that we can
876 * warn if a redefinition is different from old value.
877 */
878 oldsavch=psav=savch;
879 for (;;) {/* accumulate definition until linefeed */
880 outp=inp=p; p=cotoken(p); pin=inp;
881 if (*pin=='\\' && pin[1]=='\n')
882 continue; /* ignore escaped lf */
883 if (*pin=='\n') break;
884 if (params) {
885 /* mark the appearance of formals in the definiton */
886 if ((toktyp+COFF)[(int)*pin]==IDENT) {
887 for (qf=pf; --qf>=formal; ) {
888 if (equfrm(*qf,pin,p)) {
889 *psav++=qf-formal+1;
890 *psav++=WARN;
891 pin=p;
892 break;
893 }
894 }
895 } else if (*pin=='"' || *pin=='\'') {
896 /* inside quotation marks, too */
897 char quoc= *pin;
898 for (*psav++= *pin++; pin<p && *pin!=quoc; ) {
899 while (pin<p && !isid(*pin))
900 *psav++= *pin++;
901 cf=pin;
902 while (cf<p && isid(*cf))
903 ++cf;
904 for (qf=pf; --qf>=formal; ) {
905 if (equfrm(*qf,pin,cf)) {
906 *psav++=qf-formal+1;
907 *psav++=WARN;
908 pin=cf;
909 break;
910 }
911 }
912 while (pin<cf)
913 *psav++= *pin++;
914 }
915 }
916 }
917 while (pin<p) *psav++= *pin++;
918 }
919 *psav++=params; *psav++='\0';
920 if ((cf=oldval)!=NULL) {/* redefinition */
921 --cf; /* skip no. of params, which may be zero */
922 while (*--cf); /* go back to the beginning */
923 if (0!=strcmp(++cf,oldsavch)) {
924 /* redefinition different from old */
925 --lineno[ifno];
926 ppwarn("%s redefined",np->name);
927 ++lineno[ifno];
928 np->value=psav-1;
929 } else {
930 psav=oldsavch; /* identical redef.; reclaim space */
931 }
932 } else {
933 np->value=psav-1;
934 }
935 --flslvl; inp=pin; savch=psav; return(p);
936 }
937
938 #define fasscan() ptrtab=fastab+COFF
939 #define sloscan() ptrtab=slotab+COFF
940
941 static char *
942 control(p) register char *p; {/* find and handle preprocessor control lines */
943 register struct symtab *np;
944 for (;;) {
945 fasscan(); p=cotoken(p); if (*inp=='\n') ++inp; dump();
946 sloscan(); p=skipbl(p);
947 *--inp=SALT; outp=inp; ++flslvl; np=slookup(inp,p,0); --flslvl;
948 if (np==defloc) {/* define */
949 if (flslvl==0) {p=dodef(p); continue;}
950 } else if (np==incloc) {/* include */
951 if (flslvl==0) {p=doincl(p); continue;}
952 } else if (np==ifnloc) {/* ifndef */
953 ++flslvl; p=skipbl(p); np=slookup(inp,p,0); --flslvl;
954 if (flslvl==0 && np->value==0) ++trulvl;
955 else ++flslvl;
956 } else if (np==ifdloc) {/* ifdef */
957 ++flslvl; p=skipbl(p); np=slookup(inp,p,0); --flslvl;
958 if (flslvl==0 && np->value!=0) ++trulvl;
959 else ++flslvl;
960 } else if (np==eifloc) {/* endif */
961 if (flslvl) {if (--flslvl==0) sayline(NOINCLUDE);}
962 else if (trulvl) --trulvl;
963 else pperror("If-less endif",0);
964
965 if (flslvl == 0)
966 elflvl = 0;
967 elslvl = 0;
968 } else if (np==elifloc) {/* elif */
969 if (flslvl == 0)
970 elflvl = trulvl;
971 if (flslvl) {
972 if (elflvl > trulvl) {
973 ;
974 } else if (--flslvl != 0) {
975 ++flslvl;
976 } else {
977 newp = p;
978 if (yyparse()) {
979 ++trulvl;
980 sayline(NOINCLUDE);
981 } else {
982 ++flslvl;
983 }
984 p = newp;
985 }
986 } else if (trulvl) {
987 ++flslvl;
988 --trulvl;
989 } else
990 pperror("If-less elif");
991
992 } else if (np==elsloc) {/* else */
993 if (flslvl) {
994 if (elflvl > trulvl)
995 ;
996 else if (--flslvl!=0) ++flslvl;
997 else {++trulvl; sayline(NOINCLUDE);}
998 }
999 else if (trulvl) {++flslvl; --trulvl;}
1000 else pperror("If-less else",0);
1001
1002 if (elslvl==trulvl+flslvl)
1003 pperror("Too many #else's");
1004 elslvl=trulvl+flslvl;
1005
1006 } else if (np==udfloc) {/* undefine */
1007 if (flslvl==0) {
1008 ++flslvl; p=skipbl(p); slookup(inp,p,DROP); --flslvl;
1009 }
1010 } else if (np==ifloc) {/* if */
1011 #if tgp
1012 pperror(" IF not implemented, true assumed", 0);
1013 if (flslvl==0) ++trulvl; else ++flslvl;
1014 #else
1015 newp=p;
1016 if (flslvl==0 && yyparse()) ++trulvl; else ++flslvl;
1017 p=newp;
1018 #endif
1019 } else if (np == idtloc) { /* ident */
1020 if (pflag == 0)
1021 while (*inp != '\n') /* pass text */
1022 p = cotoken(p);
1023 } else if (np == pragmaloc) { /* pragma */
1024 while (*inp != '\n') /* pass text */
1025 p = cotoken(p);
1026 } else if (np == errorloc) { /* error */
1027 #ifdef EXIT_ON_ERROR
1028 if (trulvl > 0) {
1029 char ebuf[BUFFERSIZ];
1030
1031 p = ebuf;
1032 while (*inp != '\n') {
1033 if (*inp == '\0')
1034 if (eob(--inp)) {
1035 inp = refill(inp);
1036 continue;
1037 }
1038 *p++ = *inp++;
1039 if (p >= &ebuf[BUFFERSIZ-1])
1040 break;
1041 }
1042 *p = '\0';
1043 pperror(ebuf);
1044 exit(exfail);
1045 }
1046 #else
1047 while (*inp != '\n') /* pass text */
1048 p = cotoken(p);
1049 #endif
1050 } else if (np==lneloc) {/* line */
1051 if (flslvl==0 && pflag==0) {
1052 outp=inp=p;
1053 *--outp='#';
1054 while (*inp!='\n')
1055 p=cotoken(p);
1056 continue;
1057 }
1058 } else if (*++inp=='\n') {
1059 outp=inp; /* allows blank line after # */
1060 } else {
1061 pperror("undefined control",0);
1062 }
1063 /* flush to lf */
1064 ++flslvl;
1065 while (*inp!='\n') {
1066 outp=inp=p;
1067 p=cotoken(p);
1068 }
1069 --flslvl;
1070 }
1071 }
1072
1073 static struct symtab *
1074 stsym(s) register char *s; {
1075 char buf[BUFFERSIZ]; register char *p;
1076
1077 /* make definition look exactly like end of #define line */
1078 /* copy to avoid running off end of world when param list is at end */
1079 p=buf; while ((*p++= *s++) != '\0');
1080 p=buf; while (isid(*p++)); /* skip first identifier */
1081 if (*--p=='=') {*p++=' '; while (*p++);}
1082 else {s=" 1"; while ((*p++= *s++) != '\0');}
1083 pend=p; *--p='\n';
1084 sloscan(); dodef(buf); return(lastsym);
1085 }
1086
1087 static struct symtab *
1088 ppsym(s) char *s; {/* kluge */
1089 register struct symtab *sp;
1090 cinit=SALT; *savch++=SALT; sp=stsym(s); --sp->name; cinit=0; return(sp);
1091 }
1092
1093 void
1094 verror(char *fmt, va_list args)
1095 {
1096 if (fnames[ifno][0])
1097 fprintf(stderr, "%s: ", fnames[ifno]);
1098 fprintf(stderr, "%d: ",lineno[ifno]);
1099
1100 (void)vfprintf(stderr, fmt, args);
1101 fputc('\n', stderr);
1102 }
1103
1104 /* VARARGS1 */
1105 void
1106 pperror(char *fmt, ...)
1107 {
1108 va_list args;
1109
1110 va_start(args, fmt);
1111 verror(fmt, args);
1112 va_end(args);
1113
1114 ++exfail;
1115 }
1116
1117 /* VARARGS1 */
1118 void
1119 yyerror(char *fmt, ...)
1120 {
1121 va_list args;
1122
1123 va_start(args, fmt);
1124 verror(fmt, args);
1125 va_end(args);
1126 }
1127
1128 /* VARARGS1 */
1129 static void
1130 ppwarn(char *fmt, ...)
1131 {
1132 va_list args;
1133 int fail = exfail;
1134 exfail = -1;
1135
1136 va_start(args, fmt);
1137 verror(fmt, args);
1138 va_end(args);
1139
1140 exfail = fail;
1141 }
1142
1143 struct symtab *
1144 lookup(namep, enterf)
1145 char *namep;
1146 int enterf;
1147 {
1148 register char *np, *snp;
1149 register int c, i; int around;
1150 register struct symtab *sp;
1151
1152 /* namep had better not be too long (currently, <=symlen chars) */
1153 np=namep; around=0; i=cinit;
1154 while ((c = *np++) != '\0')
1155 i += i+c;
1156 c=i; /* c=i for register usage on pdp11 */
1157 c %= symsiz;
1158 if (c<0)
1159 c += symsiz;
1160 sp = &stab[c];
1161 while ((snp=sp->name) != NULL) {
1162 np = namep;
1163 while (*snp++ == *np)
1164 if (*np++ == '\0') {
1165 if (enterf==DROP) {
1166 sp->name[0]= DROP;
1167 sp->value=0;
1168 }
1169 return(lastsym=sp);
1170 }
1171 if (--sp < &stab[0]) {
1172 if (around) {
1173 pperror("too many defines", 0);
1174 exit(exfail);
1175 } else {
1176 ++around;
1177 sp = &stab[symsiz-1];
1178 }
1179 }
1180 }
1181 if (enterf>0)
1182 sp->name=namep;
1183 return (lastsym=sp);
1184 }
1185
1186 static struct symtab *
1187 slookup(p1,p2,enterf) register char *p1,*p2; int enterf;{
1188 register char *p3; char c2,c3; struct symtab *np;
1189 c2= *p2; *p2='\0'; /* mark end of token */
1190 if ((p2-p1)>symlen)
1191 p3=p1+symlen;
1192 else
1193 p3=p2;
1194 c3= *p3; *p3='\0'; /* truncate to symlen chars or less */
1195 if (enterf==1)
1196 p1=copy(p1);
1197 np=lookup(p1,enterf); *p3=c3; *p2=c2;
1198 if (np->value!=0 && flslvl==0)
1199 newp=subst(p2,np);
1200 else
1201 newp=0;
1202 return(np);
1203 }
1204
1205 static char *
1206 subst(p,sp) register char *p; struct symtab *sp; {
1207 static char match[]="%s: argument mismatch";
1208 register char *ca,*vp; int params;
1209 char *actual[MAXFRM]; /* actual[n] is text of nth actual */
1210 char acttxt[BUFFERSIZ]; /* space for actuals */
1211
1212 if (0==(vp=sp->value)) return(p);
1213 if ((p-macforw)<=macdam) {
1214 if (++maclvl>symsiz && !rflag) {
1215 pperror("%s: macro recursion",sp->name);
1216 return(p);
1217 }
1218 } else {
1219 maclvl=0; /* level decreased */
1220 }
1221 macforw=p; macdam=0; /* new target for decrease in level */
1222 macnam=sp->name;
1223 dump();
1224 if (sp==ulnloc) {
1225 vp=acttxt; *vp++='\0';
1226 sprintf(vp,"%d",lineno[ifno]); while (*vp++);
1227 } else if (sp==uflloc) {
1228 vp=acttxt; *vp++='\0';
1229 sprintf(vp,"\"%s\"",fnames[ifno]); while (*vp++);
1230 }
1231 if (0!=(params= *--vp&0xFF)) {/* definition calls for params */
1232 register char **pa;
1233 ca=acttxt; pa=actual;
1234 if (params==0xFF)
1235 params=1; /* #define foo() ... */
1236 sloscan();
1237 ++flslvl; /* no expansion during search for actuals */
1238 plvl= -1;
1239 do p=skipbl(p); while (*inp=='\n'); /* skip \n too */
1240 if (*inp=='(') {
1241 maclin=lineno[ifno]; macfil=fnames[ifno];
1242 for (plvl=1; plvl!=0; ) {
1243 *ca++='\0';
1244 for (;;) {
1245 outp=inp=p; p=cotoken(p);
1246 if (*inp=='(') ++plvl;
1247 if (*inp==')' && --plvl==0) {
1248 --params;
1249 break;
1250 }
1251 if (plvl==1 && *inp==',') {
1252 --params;
1253 break;
1254 }
1255 while (inp<p) {
1256 /*
1257 * Sun cpp compatibility.
1258 * Needed for kernel assembler
1259 * preprocessing.
1260 * Replace newlines in actual
1261 * macro parameters by spaces.
1262 * Keep escaped newlines, they
1263 * are assumed to be inside a
1264 * string.
1265 */
1266 if (*inp == '\n' &&
1267 inp[-1] != '\\')
1268 *inp = ' ';
1269 *ca++= *inp++;
1270 }
1271 if (ca> &acttxt[BUFFERSIZ])
1272 pperror("%s: actuals too long",
1273 sp->name);
1274 }
1275 if (pa>= &actual[MAXFRM])
1276 ppwarn(match,sp->name);
1277 else
1278 *pa++=ca;
1279 }
1280 }
1281 if (params!=0)
1282 ppwarn(match,sp->name);
1283 while (--params>=0)
1284 *pa++=""+1; /* null string for missing actuals */
1285 --flslvl; fasscan();
1286 }
1287 for (;;) {/* push definition onto front of input stack */
1288 while (!iswarn(*--vp)) {
1289 if (bob(p)) {outp=inp=p; p=unfill(p);}
1290 *--p= *vp;
1291 }
1292 if (*vp==warnc) {/* insert actual param */
1293 ca=actual[*--vp-1];
1294 while (*--ca) {
1295 if (bob(p)) {outp=inp=p; p=unfill(p);}
1296 *--p= *ca;
1297 }
1298 } else break;
1299 }
1300 outp=inp=p;
1301 return(p);
1302 }
1303
1304 static char *
1305 trmdir(s) register char *s; {
1306 register char *p = s;
1307 while (*p++); --p; while (p>s && *--p!='/');
1308 # if unix
1309 if (p==s) *p++='.';
1310 # endif
1311 *p='\0';
1312 return(s);
1313 }
1314
1315 static char *
1316 copy(s) register char *s; {
1317 register char *old;
1318
1319 old = savch; while ((*savch++ = *s++) != '\0');
1320 return(old);
1321 }
1322
1323 static char *
1324 strdex(s,c) char *s,c; {
1325 while (*s) if (*s++==c) return(--s);
1326 return(0);
1327 }
1328
1329 int
1330 yywrap() {
1331 return(1);
1332 }
1333
1334 int
1335 main(argc,argv)
1336 char *argv[];
1337 int argc;
1338 {
1339 register int i,c;
1340 register char *p;
1341 char *tf,**cp2;
1342 char *sysdir = NULL;
1343
1344 fout = stdout; /* Mac OS X is not POSIX compliant (stdout nonconst.) */
1345
1346 p="_ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
1347 i=0;
1348 while ((c= *p++) != '\0') {
1349 (fastab+COFF)[c] |= IB|NB|SB;
1350 (toktyp+COFF)[c]=IDENT;
1351 #if scw2
1352 /*
1353 * 53 == 63-10; digits rarely appear in identifiers,
1354 * and can never be the first char of an identifier.
1355 * 11 == 53*53/sizeof(macbit) .
1356 */
1357 ++i; (t21+COFF)[c]=(53*i)/11; (t22+COFF)[c]=i%11;
1358 #endif
1359 }
1360 p="0123456789.";
1361 while ((c = *p++) != '\0') {
1362 (fastab+COFF)[c] |= NB|SB;
1363 (toktyp+COFF)[c]=NUMBR;
1364 }
1365 p="\n\"'/\\";
1366 while ((c = *p++) != '\0')
1367 (fastab+COFF)[c] |= SB;
1368 p="\n\"'\\";
1369 while ((c = *p++) != '\0')
1370 (fastab+COFF)[c] |= QB;
1371 p="*\n";
1372 while ((c = *p++)!= '\0')
1373 (fastab+COFF)[c] |= CB;
1374 (fastab+COFF)[(int)warnc] |= WB;
1375 (fastab+COFF)['\0'] |= CB|QB|SB|WB;
1376 for (i=ALFSIZ; --i>=0; )
1377 slotab[i]=fastab[i]|SB;
1378 p=" \t\013\f\r"; /* note no \n; \v not legal for vertical tab? */
1379 while ((c = *p++) != '\0')
1380 (toktyp+COFF)[c]=BLANK;
1381 #if scw2
1382 for ((t23+COFF)[i=ALFSIZ+7-COFF]=1; --i>=-COFF; )
1383 if (((t23+COFF)[i]=(t23+COFF+1)[i]<<1)==0)
1384 (t23+COFF)[i]=1;
1385 #endif
1386
1387 # if unix
1388 fnames[ifno=0] = "";
1389 dirs[0]=dirnams[0]= ".";
1390 # endif
1391 # if ibm
1392 fnames[ifno=0] = "";
1393 # endif
1394 # if gimpel
1395 fnames[ifno=0] = (char *)inquire(stdin, _FILENAME);
1396 dirnams[0] = dirs[0] = trmdir(copy(fnames[0]));
1397 # endif
1398 for (i=1; i<argc; i++) {
1399 switch(argv[i][0]) {
1400 case '-':
1401 switch(argv[i][1]) {
1402 case 'P':
1403 pflag++;
1404 continue;
1405 case 'E':
1406 continue;
1407 case 'R':
1408 ++rflag;
1409 continue;
1410 case 'C':
1411 passcom++;
1412 continue;
1413 case 'D':
1414 if (predef>prespc+NPREDEF) {
1415 pperror("too many -D options, "
1416 "ignoring %s", argv[i]);
1417 continue;
1418 }
1419 /* ignore plain "-D" (no argument) */
1420 if (*(argv[i]+2))
1421 *predef++ = argv[i]+2;
1422 continue;
1423 case 'U':
1424 if (prund>punspc+NPREDEF) {
1425 pperror("too many -U options, "
1426 "ignoring %s", argv[i]);
1427 continue;
1428 }
1429 *prund++ = argv[i]+2;
1430 continue;
1431 case 'u':
1432 if (strcmp(argv[i], "-undef") == 0)
1433 nopredef = 1;
1434 else
1435 goto unknown;
1436 continue;
1437 case 'I':
1438 if (nd>=MAXIDIRS)
1439 pperror("excessive -I file "
1440 "(%s) ignored", argv[i]);
1441 else
1442 dirs[nd++] = argv[i]+2;
1443 continue;
1444 case 'T':
1445 symlen = 8;
1446 /* Compatibility with V7 */
1447 continue;
1448 case 'H':
1449 /* Print included filenames */
1450 hflag++;
1451 continue;
1452 case 'Y':
1453 /* Replace system include dir */
1454 sysdir = argv[i]+2;
1455 continue;
1456 case '\0': continue;
1457 default:
1458 unknown:
1459 pperror("unknown flag %s", argv[i]);
1460 continue;
1461 }
1462 default:
1463 if (fin == STDIN_FILENO) {
1464 if (0>(fin=open(argv[i], O_RDONLY))) {
1465 pperror("No source file %s",
1466 argv[i]);
1467 exit(8);
1468 }
1469 fnames[ifno]=copy(argv[i]);
1470 dirs[0]=dirnams[ifno]=trmdir(argv[i]);
1471 /* too dangerous to have file name in same syntactic position
1472 be input or output file depending on file redirections,
1473 so force output to stdout, willy-nilly
1474 [i don't see what the problem is. jfr]
1475 */
1476 } else if (fout==stdout) {
1477 static char _sobuff[BUFSIZ];
1478 if (NULL==(fout=fopen(argv[i], "w"))) {
1479 pperror("Can't create %s",
1480 argv[i]);
1481 exit(8);
1482 } else {
1483 fclose(stdout);
1484 setbuf(fout,_sobuff);
1485 }
1486 } else {
1487 pperror("extraneous name %s", argv[i]);
1488 }
1489 }
1490 }
1491
1492 fins[ifno]=fin;
1493 exfail = 0;
1494 /* after user -I files here are the standard include libraries */
1495 if (sysdir != NULL) {
1496 dirs[nd++] = sysdir;
1497 } else {
1498 # if unix
1499 dirs[nd++] = "/usr/include";
1500 # endif
1501 /* dirs[nd++] = "/compool"; */
1502 }
1503 dirs[nd++] = 0;
1504 defloc=ppsym("define");
1505 udfloc=ppsym("undef");
1506 incloc=ppsym("include");
1507 elsloc=ppsym("else");
1508 eifloc=ppsym("endif");
1509 elifloc=ppsym("elif");
1510 ifdloc=ppsym("ifdef");
1511 ifnloc=ppsym("ifndef");
1512 ifloc=ppsym("if");
1513 lneloc=ppsym("line");
1514 idtloc=ppsym("ident");
1515 pragmaloc=ppsym("pragma");
1516 errorloc=ppsym("error");
1517 for (i=sizeof(macbit)/sizeof(macbit[0]); --i>=0; )
1518 macbit[i]=0;
1519
1520 if (! nopredef) {
1521 # if unix
1522 ysysloc=stsym("unix");
1523 # endif
1524 # if __sparc__
1525 varloc=stsym ("sparc");
1526 # endif
1527 # if __i386__
1528 varloc=stsym ("i386");
1529 # endif
1530 }
1531 ulnloc=stsym ("__LINE__");
1532 uflloc=stsym ("__FILE__");
1533 varloc=stsym ("__BUILTIN_VA_ARG_INCR");
1534
1535 tf=fnames[ifno]; fnames[ifno]="command line"; lineno[ifno]=1;
1536 cp2=prespc;
1537 while (cp2<predef) stsym(*cp2++);
1538 cp2=punspc;
1539 while (cp2<prund) {
1540 if ((p=strdex(*cp2, '=')) != NULL) *p++='\0';
1541 if (strlen(*cp2) > symlen)
1542 (*cp2)[symlen] = '\0';
1543 lookup(*cp2++, DROP);
1544 }
1545 fnames[ifno]=tf;
1546 pbeg=buffer+symlen; pbuf=pbeg+BUFFERSIZ; pend=pbuf+BUFFERSIZ;
1547
1548 trulvl = 0; flslvl = 0;
1549 lineno[0] = 1; sayline(NOINCLUDE);
1550 outp=inp=pend;
1551 control(pend);
1552 return (exfail);
1553 }