]> gcc.gnu.org Git - gcc.git/blob - gcc/cccp.c
(main): cplusplus_comments now defaults to 1.
[gcc.git] / gcc / cccp.c
1 /* C Compatible Compiler Preprocessor (CCCP)
2 Copyright (C) 1986, 87, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
3 Written by Paul Rubin, June 1986
4 Adapted to ANSI C, Richard Stallman, Jan 1987
5
6 This program is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 2, or (at your option) any
9 later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA.
20
21 In other words, you are welcome to use, share and improve this program.
22 You are forbidden to forbid anyone else to use, share and improve
23 what you give them. Help stamp out software-hoarding! */
24 \f
25 typedef unsigned char U_CHAR;
26
27 #ifdef EMACS
28 #define NO_SHORTNAMES
29 #include "../src/config.h"
30 #ifdef open
31 #undef open
32 #undef read
33 #undef write
34 #endif /* open */
35 #endif /* EMACS */
36
37 /* The macro EMACS is defined when cpp is distributed as part of Emacs,
38 for the sake of machines with limited C compilers. */
39 #ifndef EMACS
40 #include "config.h"
41 #endif /* not EMACS */
42
43 #ifndef STANDARD_INCLUDE_DIR
44 #define STANDARD_INCLUDE_DIR "/usr/include"
45 #endif
46
47 #ifndef LOCAL_INCLUDE_DIR
48 #define LOCAL_INCLUDE_DIR "/usr/local/include"
49 #endif
50
51 #if 0 /* We can't get ptrdiff_t, so I arranged not to need PTR_INT_TYPE. */
52 #ifdef __STDC__
53 #define PTR_INT_TYPE ptrdiff_t
54 #else
55 #define PTR_INT_TYPE long
56 #endif
57 #endif /* 0 */
58
59 #include "pcp.h"
60
61 /* By default, colon separates directories in a path. */
62 #ifndef PATH_SEPARATOR
63 #define PATH_SEPARATOR ':'
64 #endif
65
66 #include <sys/types.h>
67 #include <sys/stat.h>
68 #include <ctype.h>
69 #include <stdio.h>
70 #include <signal.h>
71
72 /* The following symbols should be autoconfigured:
73 HAVE_FCNTL_H
74 HAVE_STDLIB_H
75 HAVE_SYS_TIME_H
76 HAVE_UNISTD_H
77 STDC_HEADERS
78 TIME_WITH_SYS_TIME
79 In the mean time, we'll get by with approximations based
80 on existing GCC configuration symbols. */
81
82 #ifdef POSIX
83 # ifndef HAVE_STDLIB_H
84 # define HAVE_STDLIB_H 1
85 # endif
86 # ifndef HAVE_UNISTD_H
87 # define HAVE_UNISTD_H 1
88 # endif
89 # ifndef STDC_HEADERS
90 # define STDC_HEADERS 1
91 # endif
92 #endif /* defined (POSIX) */
93
94 #if defined (POSIX) || (defined (USG) && !defined (VMS))
95 # ifndef HAVE_FCNTL_H
96 # define HAVE_FCNTL_H 1
97 # endif
98 #endif
99
100 #ifndef RLIMIT_STACK
101 # include <time.h>
102 #else
103 # if TIME_WITH_SYS_TIME
104 # include <sys/time.h>
105 # include <time.h>
106 # else
107 # if HAVE_SYS_TIME_H
108 # include <sys/time.h>
109 # else
110 # include <time.h>
111 # endif
112 # endif
113 # include <sys/resource.h>
114 #endif
115
116 #if HAVE_FCNTL_H
117 # include <fcntl.h>
118 #endif
119
120 /* This defines "errno" properly for VMS, and gives us EACCES. */
121 #include <errno.h>
122
123 #if HAVE_STDLIB_H
124 # include <stdlib.h>
125 #else
126 char *getenv ();
127 #endif
128
129 #if STDC_HEADERS
130 # include <string.h>
131 # ifndef bcmp
132 # define bcmp(a, b, n) memcmp (a, b, n)
133 # endif
134 # ifndef bcopy
135 # define bcopy(s, d, n) memcpy (d, s, n)
136 # endif
137 # ifndef bzero
138 # define bzero(d, n) memset (d, 0, n)
139 # endif
140 #else /* !STDC_HEADERS */
141 char *index ();
142 char *rindex ();
143
144 # if !defined (BSTRING) && (defined (USG) || defined (VMS))
145
146 # ifndef bcmp
147 # define bcmp my_bcmp
148 static int
149 my_bcmp (a, b, n)
150 register char *a;
151 register char *b;
152 register unsigned n;
153 {
154 while (n-- > 0)
155 if (*a++ != *b++)
156 return 1;
157
158 return 0;
159 }
160 # endif /* !defined (bcmp) */
161
162 # ifndef bcopy
163 # define bcopy my_bcopy
164 static void
165 my_bcopy (s, d, n)
166 register char *s;
167 register char *d;
168 register unsigned n;
169 {
170 while (n-- > 0)
171 *d++ = *s++;
172 }
173 # endif /* !defined (bcopy) */
174
175 # ifndef bzero
176 # define bzero my_bzero
177 static void
178 my_bzero (b, length)
179 register char *b;
180 register unsigned length;
181 {
182 while (length-- > 0)
183 *b++ = 0;
184 }
185 # endif /* !defined (bzero) */
186
187 # endif /* !defined (BSTRING) && (defined (USG) || defined (VMS)) */
188 #endif /* ! STDC_HEADERS */
189
190 #if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 6)
191 # define __attribute__(x)
192 #endif
193
194 #ifndef PROTO
195 # if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
196 # define PROTO(ARGS) ARGS
197 # else
198 # define PROTO(ARGS) ()
199 # endif
200 #endif
201
202 #if defined (__STDC__) && defined (HAVE_VPRINTF)
203 # include <stdarg.h>
204 # define VA_START(va_list, var) va_start (va_list, var)
205 # define PRINTF_ALIST(msg) char *msg, ...
206 # define PRINTF_DCL(msg)
207 # define PRINTF_PROTO(ARGS, m, n) PROTO (ARGS) __attribute__ ((format (printf, m, n)))
208 #else
209 # include <varargs.h>
210 # define VA_START(va_list, var) va_start (va_list)
211 # define PRINTF_ALIST(msg) msg, va_alist
212 # define PRINTF_DCL(msg) char *msg; va_dcl
213 # define PRINTF_PROTO(ARGS, m, n) () __attribute__ ((format (printf, m, n)))
214 # define vfprintf(file, msg, args) \
215 { \
216 char *a0 = va_arg(args, char *); \
217 char *a1 = va_arg(args, char *); \
218 char *a2 = va_arg(args, char *); \
219 char *a3 = va_arg(args, char *); \
220 fprintf (file, msg, a0, a1, a2, a3); \
221 }
222 #endif
223
224 #define PRINTF_PROTO_1(ARGS) PRINTF_PROTO(ARGS, 1, 2)
225 #define PRINTF_PROTO_2(ARGS) PRINTF_PROTO(ARGS, 2, 3)
226 #define PRINTF_PROTO_3(ARGS) PRINTF_PROTO(ARGS, 3, 4)
227
228 #if HAVE_UNISTD_H
229 # include <unistd.h>
230 #endif
231
232 /* VMS-specific definitions */
233 #ifdef VMS
234 #include <descrip.h>
235 #define O_RDONLY 0 /* Open arg for Read/Only */
236 #define O_WRONLY 1 /* Open arg for Write/Only */
237 #define read(fd,buf,size) VMS_read (fd,buf,size)
238 #define write(fd,buf,size) VMS_write (fd,buf,size)
239 #define open(fname,mode,prot) VMS_open (fname,mode,prot)
240 #define fopen(fname,mode) VMS_fopen (fname,mode)
241 #define freopen(fname,mode,ofile) VMS_freopen (fname,mode,ofile)
242 #define strncat(dst,src,cnt) VMS_strncat (dst,src,cnt)
243 #define fstat(fd,stbuf) VMS_fstat (fd,stbuf)
244 static int VMS_fstat (), VMS_stat ();
245 static char * VMS_strncat ();
246 static int VMS_read ();
247 static int VMS_write ();
248 static int VMS_open ();
249 static FILE * VMS_fopen ();
250 static FILE * VMS_freopen ();
251 static void hack_vms_include_specification ();
252 typedef struct { unsigned :16, :16, :16; } vms_ino_t;
253 #define ino_t vms_ino_t
254 #define INCLUDE_LEN_FUDGE 10 /* leave room for VMS syntax conversion */
255 #ifdef __GNUC__
256 #define BSTRING /* VMS/GCC supplies the bstring routines */
257 #endif /* __GNUC__ */
258 #endif /* VMS */
259
260 #ifndef O_RDONLY
261 #define O_RDONLY 0
262 #endif
263
264 #undef MIN
265 #undef MAX
266 #define MIN(X,Y) ((X) < (Y) ? (X) : (Y))
267 #define MAX(X,Y) ((X) > (Y) ? (X) : (Y))
268
269 /* Find the largest host integer type and set its size and type. */
270
271 #ifndef HOST_BITS_PER_WIDE_INT
272
273 #if HOST_BITS_PER_LONG > HOST_BITS_PER_INT
274 #define HOST_BITS_PER_WIDE_INT HOST_BITS_PER_LONG
275 #define HOST_WIDE_INT long
276 #else
277 #define HOST_BITS_PER_WIDE_INT HOST_BITS_PER_INT
278 #define HOST_WIDE_INT int
279 #endif
280
281 #endif
282
283 #ifndef S_ISREG
284 #define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
285 #endif
286
287 #ifndef S_ISDIR
288 #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
289 #endif
290
291 /* Define a generic NULL if one hasn't already been defined. */
292
293 #ifndef NULL
294 #define NULL 0
295 #endif
296
297 #ifndef GENERIC_PTR
298 #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
299 #define GENERIC_PTR void *
300 #else
301 #define GENERIC_PTR char *
302 #endif
303 #endif
304
305 #ifndef NULL_PTR
306 #define NULL_PTR ((GENERIC_PTR)0)
307 #endif
308
309 #ifndef INCLUDE_LEN_FUDGE
310 #define INCLUDE_LEN_FUDGE 0
311 #endif
312
313 /* External declarations. */
314
315 extern char *version_string;
316 #ifndef VMS
317 #ifndef HAVE_STRERROR
318 extern int sys_nerr;
319 #if defined(bsd4_4)
320 extern const char *const sys_errlist[];
321 #else
322 extern char *sys_errlist[];
323 #endif
324 #else /* HAVE_STRERROR */
325 char *strerror ();
326 #endif
327 #else /* VMS */
328 char *strerror (int,...);
329 #endif
330 int parse_escape PROTO((char **));
331 HOST_WIDE_INT parse_c_expression PROTO((char *));
332
333 #ifndef errno
334 extern int errno;
335 #endif
336 \f
337 /* Name under which this program was invoked. */
338
339 static char *progname;
340
341 /* Nonzero means use extra default include directories for C++. */
342
343 static int cplusplus;
344
345 /* Nonzero means handle cplusplus style comments */
346
347 static int cplusplus_comments;
348
349 /* Nonzero means handle #import, for objective C. */
350
351 static int objc;
352
353 /* Nonzero means this is an assembly file, and allow
354 unknown directives, which could be comments. */
355
356 static int lang_asm;
357
358 /* Current maximum length of directory names in the search path
359 for include files. (Altered as we get more of them.) */
360
361 static int max_include_len;
362
363 /* Nonzero means turn NOTREACHED into #pragma NOTREACHED etc */
364
365 static int for_lint = 0;
366
367 /* Nonzero means copy comments into the output file. */
368
369 static int put_out_comments = 0;
370
371 /* Nonzero means don't process the ANSI trigraph sequences. */
372
373 static int no_trigraphs = 0;
374
375 /* Nonzero means print the names of included files rather than
376 the preprocessed output. 1 means just the #include "...",
377 2 means #include <...> as well. */
378
379 static int print_deps = 0;
380
381 /* Nonzero if missing .h files in -M output are assumed to be generated
382 files and not errors. */
383
384 static int print_deps_missing_files = 0;
385
386 /* Nonzero means print names of header files (-H). */
387
388 static int print_include_names = 0;
389
390 /* Nonzero means don't output line number information. */
391
392 static int no_line_directives;
393
394 /* Nonzero means output the text in failing conditionals,
395 inside #failed ... #endfailed. */
396
397 static int output_conditionals;
398
399 /* dump_only means inhibit output of the preprocessed text
400 and instead output the definitions of all user-defined
401 macros in a form suitable for use as input to cccp.
402 dump_names means pass #define and the macro name through to output.
403 dump_definitions means pass the whole definition (plus #define) through
404 */
405
406 static enum {dump_none, dump_only, dump_names, dump_definitions}
407 dump_macros = dump_none;
408
409 /* Nonzero means pass all #define and #undef directives which we actually
410 process through to the output stream. This feature is used primarily
411 to allow cc1 to record the #defines and #undefs for the sake of
412 debuggers which understand about preprocessor macros, but it may
413 also be useful with -E to figure out how symbols are defined, and
414 where they are defined. */
415 static int debug_output = 0;
416
417 /* Nonzero indicates special processing used by the pcp program. The
418 special effects of this mode are:
419
420 Inhibit all macro expansion, except those inside #if directives.
421
422 Process #define directives normally, and output their contents
423 to the output file.
424
425 Output preconditions to pcp_outfile indicating all the relevant
426 preconditions for use of this file in a later cpp run.
427 */
428 static FILE *pcp_outfile;
429
430 /* Nonzero means we are inside an IF during a -pcp run. In this mode
431 macro expansion is done, and preconditions are output for all macro
432 uses requiring them. */
433 static int pcp_inside_if;
434
435 /* Nonzero means never to include precompiled files.
436 This is 1 since there's no way now to make precompiled files,
437 so it's not worth testing for them. */
438 static int no_precomp = 1;
439
440 /* Nonzero means give all the error messages the ANSI standard requires. */
441
442 int pedantic;
443
444 /* Nonzero means try to make failure to fit ANSI C an error. */
445
446 static int pedantic_errors;
447
448 /* Nonzero means don't print warning messages. -w. */
449
450 static int inhibit_warnings = 0;
451
452 /* Nonzero means warn if slash-star appears in a comment. */
453
454 static int warn_comments;
455
456 /* Nonzero means warn if a macro argument is (or would be)
457 stringified with -traditional. */
458
459 static int warn_stringify;
460
461 /* Nonzero means warn if there are any trigraphs. */
462
463 static int warn_trigraphs;
464
465 /* Nonzero means warn if #import is used. */
466
467 static int warn_import = 1;
468
469 /* Nonzero means turn warnings into errors. */
470
471 static int warnings_are_errors;
472
473 /* Nonzero means try to imitate old fashioned non-ANSI preprocessor. */
474
475 int traditional;
476
477 /* Nonzero causes output not to be done,
478 but directives such as #define that have side effects
479 are still obeyed. */
480
481 static int no_output;
482
483 /* Nonzero means this file was included with a -imacros or -include
484 command line and should not be recorded as an include file. */
485
486 static int no_record_file;
487
488 /* Nonzero means that we have finished processing the command line options.
489 This flag is used to decide whether or not to issue certain errors
490 and/or warnings. */
491
492 static int done_initializing = 0;
493
494 /* Line where a newline was first seen in a string constant. */
495
496 static int multiline_string_line = 0;
497 \f
498 /* I/O buffer structure.
499 The `fname' field is nonzero for source files and #include files
500 and for the dummy text used for -D and -U.
501 It is zero for rescanning results of macro expansion
502 and for expanding macro arguments. */
503 #define INPUT_STACK_MAX 400
504 static struct file_buf {
505 char *fname;
506 /* Filename specified with #line directive. */
507 char *nominal_fname;
508 /* Record where in the search path this file was found.
509 For #include_next. */
510 struct file_name_list *dir;
511 int lineno;
512 int length;
513 U_CHAR *buf;
514 U_CHAR *bufp;
515 /* Macro that this level is the expansion of.
516 Included so that we can reenable the macro
517 at the end of this level. */
518 struct hashnode *macro;
519 /* Value of if_stack at start of this file.
520 Used to prohibit unmatched #endif (etc) in an include file. */
521 struct if_stack *if_stack;
522 /* Object to be freed at end of input at this level. */
523 U_CHAR *free_ptr;
524 /* True if this is a header file included using <FILENAME>. */
525 char system_header_p;
526 } instack[INPUT_STACK_MAX];
527
528 static int last_error_tick; /* Incremented each time we print it. */
529 static int input_file_stack_tick; /* Incremented when the status changes. */
530
531 /* Current nesting level of input sources.
532 `instack[indepth]' is the level currently being read. */
533 static int indepth = -1;
534 #define CHECK_DEPTH(code) \
535 if (indepth >= (INPUT_STACK_MAX - 1)) \
536 { \
537 error_with_line (line_for_error (instack[indepth].lineno), \
538 "macro or `#include' recursion too deep"); \
539 code; \
540 }
541
542 /* Current depth in #include directives that use <...>. */
543 static int system_include_depth = 0;
544
545 typedef struct file_buf FILE_BUF;
546
547 /* The output buffer. Its LENGTH field is the amount of room allocated
548 for the buffer, not the number of chars actually present. To get
549 that, subtract outbuf.buf from outbuf.bufp. */
550
551 #define OUTBUF_SIZE 10 /* initial size of output buffer */
552 static FILE_BUF outbuf;
553
554 /* Grow output buffer OBUF points at
555 so it can hold at least NEEDED more chars. */
556
557 #define check_expand(OBUF, NEEDED) \
558 (((OBUF)->length - ((OBUF)->bufp - (OBUF)->buf) <= (NEEDED)) \
559 ? grow_outbuf ((OBUF), (NEEDED)) : 0)
560
561 struct file_name_list
562 {
563 struct file_name_list *next;
564 char *fname;
565 /* If the following is nonzero, it is a macro name.
566 Don't include the file again if that macro is defined. */
567 U_CHAR *control_macro;
568 /* If the following is nonzero, it is a C-language system include
569 directory. */
570 int c_system_include_path;
571 /* Mapping of file names for this directory. */
572 struct file_name_map *name_map;
573 /* Non-zero if name_map is valid. */
574 int got_name_map;
575 };
576
577 /* #include "file" looks in source file dir, then stack. */
578 /* #include <file> just looks in the stack. */
579 /* -I directories are added to the end, then the defaults are added. */
580 /* The */
581 static struct default_include {
582 char *fname; /* The name of the directory. */
583 int cplusplus; /* Only look here if we're compiling C++. */
584 int cxx_aware; /* Includes in this directory don't need to
585 be wrapped in extern "C" when compiling
586 C++. */
587 } include_defaults_array[]
588 #ifdef INCLUDE_DEFAULTS
589 = INCLUDE_DEFAULTS;
590 #else
591 = {
592 /* Pick up GNU C++ specific include files. */
593 { GPLUSPLUS_INCLUDE_DIR, 1, 1 },
594 #ifdef CROSS_COMPILE
595 /* This is the dir for fixincludes. Put it just before
596 the files that we fix. */
597 { GCC_INCLUDE_DIR, 0, 0 },
598 /* For cross-compilation, this dir name is generated
599 automatically in Makefile.in. */
600 { CROSS_INCLUDE_DIR, 0, 0 },
601 /* This is another place that the target system's headers might be. */
602 { TOOL_INCLUDE_DIR, 0, 0 },
603 #else /* not CROSS_COMPILE */
604 /* This should be /usr/local/include and should come before
605 the fixincludes-fixed header files. */
606 { LOCAL_INCLUDE_DIR, 0, 1 },
607 /* This is here ahead of GCC_INCLUDE_DIR because assert.h goes here.
608 Likewise, behind LOCAL_INCLUDE_DIR, where glibc puts its assert.h. */
609 { TOOL_INCLUDE_DIR, 0, 0 },
610 /* This is the dir for fixincludes. Put it just before
611 the files that we fix. */
612 { GCC_INCLUDE_DIR, 0, 0 },
613 /* Some systems have an extra dir of include files. */
614 #ifdef SYSTEM_INCLUDE_DIR
615 { SYSTEM_INCLUDE_DIR, 0, 0 },
616 #endif
617 { STANDARD_INCLUDE_DIR, 0, 0 },
618 #endif /* not CROSS_COMPILE */
619 { 0, 0, 0 }
620 };
621 #endif /* no INCLUDE_DEFAULTS */
622
623 /* The code looks at the defaults through this pointer, rather than through
624 the constant structure above. This pointer gets changed if an environment
625 variable specifies other defaults. */
626 static struct default_include *include_defaults = include_defaults_array;
627
628 static struct file_name_list *include = 0; /* First dir to search */
629 /* First dir to search for <file> */
630 /* This is the first element to use for #include <...>.
631 If it is 0, use the entire chain for such includes. */
632 static struct file_name_list *first_bracket_include = 0;
633 /* This is the first element in the chain that corresponds to
634 a directory of system header files. */
635 static struct file_name_list *first_system_include = 0;
636 static struct file_name_list *last_include = 0; /* Last in chain */
637
638 /* Chain of include directories to put at the end of the other chain. */
639 static struct file_name_list *after_include = 0;
640 static struct file_name_list *last_after_include = 0; /* Last in chain */
641
642 /* Chain to put at the start of the system include files. */
643 static struct file_name_list *before_system = 0;
644 static struct file_name_list *last_before_system = 0; /* Last in chain */
645
646 /* List of included files that contained #pragma once. */
647 static struct file_name_list *dont_repeat_files = 0;
648
649 /* List of other included files.
650 If ->control_macro if nonzero, the file had a #ifndef
651 around the entire contents, and ->control_macro gives the macro name. */
652 static struct file_name_list *all_include_files = 0;
653
654 /* Directory prefix that should replace `/usr' in the standard
655 include file directories. */
656 static char *include_prefix;
657
658 /* Global list of strings read in from precompiled files. This list
659 is kept in the order the strings are read in, with new strings being
660 added at the end through stringlist_tailp. We use this list to output
661 the strings at the end of the run.
662 */
663 static STRINGDEF *stringlist;
664 static STRINGDEF **stringlist_tailp = &stringlist;
665
666
667 /* Structure returned by create_definition */
668 typedef struct macrodef MACRODEF;
669 struct macrodef
670 {
671 struct definition *defn;
672 U_CHAR *symnam;
673 int symlen;
674 };
675 \f
676 enum sharp_token_type {
677 NO_SHARP_TOKEN = 0, /* token not present */
678
679 SHARP_TOKEN = '#', /* token spelled with # only */
680 WHITE_SHARP_TOKEN, /* token spelled with # and white space */
681
682 PERCENT_COLON_TOKEN = '%', /* token spelled with %: only */
683 WHITE_PERCENT_COLON_TOKEN /* token spelled with %: and white space */
684 };
685
686 /* Structure allocated for every #define. For a simple replacement
687 such as
688 #define foo bar ,
689 nargs = -1, the `pattern' list is null, and the expansion is just
690 the replacement text. Nargs = 0 means a functionlike macro with no args,
691 e.g.,
692 #define getchar() getc (stdin) .
693 When there are args, the expansion is the replacement text with the
694 args squashed out, and the reflist is a list describing how to
695 build the output from the input: e.g., "3 chars, then the 1st arg,
696 then 9 chars, then the 3rd arg, then 0 chars, then the 2nd arg".
697 The chars here come from the expansion. Whatever is left of the
698 expansion after the last arg-occurrence is copied after that arg.
699 Note that the reflist can be arbitrarily long---
700 its length depends on the number of times the arguments appear in
701 the replacement text, not how many args there are. Example:
702 #define f(x) x+x+x+x+x+x+x would have replacement text "++++++" and
703 pattern list
704 { (0, 1), (1, 1), (1, 1), ..., (1, 1), NULL }
705 where (x, y) means (nchars, argno). */
706
707 typedef struct definition DEFINITION;
708 struct definition {
709 int nargs;
710 int length; /* length of expansion string */
711 int predefined; /* True if the macro was builtin or */
712 /* came from the command line */
713 U_CHAR *expansion;
714 int line; /* Line number of definition */
715 char *file; /* File of definition */
716 char rest_args; /* Nonzero if last arg. absorbs the rest */
717 struct reflist {
718 struct reflist *next;
719
720 enum sharp_token_type stringify; /* set if a # operator before arg */
721 enum sharp_token_type raw_before; /* set if a ## operator before arg */
722 enum sharp_token_type raw_after; /* set if a ## operator after arg */
723
724 char rest_args; /* Nonzero if this arg. absorbs the rest */
725 int nchars; /* Number of literal chars to copy before
726 this arg occurrence. */
727 int argno; /* Number of arg to substitute (origin-0) */
728 } *pattern;
729 union {
730 /* Names of macro args, concatenated in reverse order
731 with comma-space between them.
732 The only use of this is that we warn on redefinition
733 if this differs between the old and new definitions. */
734 U_CHAR *argnames;
735 } args;
736 };
737
738 /* different kinds of things that can appear in the value field
739 of a hash node. Actually, this may be useless now. */
740 union hashval {
741 char *cpval;
742 DEFINITION *defn;
743 KEYDEF *keydef;
744 };
745
746 /*
747 * special extension string that can be added to the last macro argument to
748 * allow it to absorb the "rest" of the arguments when expanded. Ex:
749 * #define wow(a, b...) process (b, a, b)
750 * { wow (1, 2, 3); } -> { process (2, 3, 1, 2, 3); }
751 * { wow (one, two); } -> { process (two, one, two); }
752 * if this "rest_arg" is used with the concat token '##' and if it is not
753 * supplied then the token attached to with ## will not be outputted. Ex:
754 * #define wow (a, b...) process (b ## , a, ## b)
755 * { wow (1, 2); } -> { process (2, 1, 2); }
756 * { wow (one); } -> { process (one); {
757 */
758 static char rest_extension[] = "...";
759 #define REST_EXTENSION_LENGTH (sizeof (rest_extension) - 1)
760
761 /* The structure of a node in the hash table. The hash table
762 has entries for all tokens defined by #define directives (type T_MACRO),
763 plus some special tokens like __LINE__ (these each have their own
764 type, and the appropriate code is run when that type of node is seen.
765 It does not contain control words like "#define", which are recognized
766 by a separate piece of code. */
767
768 /* different flavors of hash nodes --- also used in keyword table */
769 enum node_type {
770 T_DEFINE = 1, /* the `#define' keyword */
771 T_INCLUDE, /* the `#include' keyword */
772 T_INCLUDE_NEXT, /* the `#include_next' keyword */
773 T_IMPORT, /* the `#import' keyword */
774 T_IFDEF, /* the `#ifdef' keyword */
775 T_IFNDEF, /* the `#ifndef' keyword */
776 T_IF, /* the `#if' keyword */
777 T_ELSE, /* `#else' */
778 T_PRAGMA, /* `#pragma' */
779 T_ELIF, /* `#elif' */
780 T_UNDEF, /* `#undef' */
781 T_LINE, /* `#line' */
782 T_ERROR, /* `#error' */
783 T_WARNING, /* `#warning' */
784 T_ENDIF, /* `#endif' */
785 T_SCCS, /* `#sccs', used on system V. */
786 T_IDENT, /* `#ident', used on system V. */
787 T_ASSERT, /* `#assert', taken from system V. */
788 T_UNASSERT, /* `#unassert', taken from system V. */
789 T_SPECLINE, /* special symbol `__LINE__' */
790 T_DATE, /* `__DATE__' */
791 T_FILE, /* `__FILE__' */
792 T_BASE_FILE, /* `__BASE_FILE__' */
793 T_INCLUDE_LEVEL, /* `__INCLUDE_LEVEL__' */
794 T_VERSION, /* `__VERSION__' */
795 T_SIZE_TYPE, /* `__SIZE_TYPE__' */
796 T_PTRDIFF_TYPE, /* `__PTRDIFF_TYPE__' */
797 T_WCHAR_TYPE, /* `__WCHAR_TYPE__' */
798 T_USER_LABEL_PREFIX_TYPE, /* `__USER_LABEL_PREFIX__' */
799 T_REGISTER_PREFIX_TYPE, /* `__REGISTER_PREFIX__' */
800 T_IMMEDIATE_PREFIX_TYPE, /* `__IMMEDIATE_PREFIX__' */
801 T_TIME, /* `__TIME__' */
802 T_CONST, /* Constant value, used by `__STDC__' */
803 T_MACRO, /* macro defined by `#define' */
804 T_DISABLED, /* macro temporarily turned off for rescan */
805 T_SPEC_DEFINED, /* special `defined' macro for use in #if statements */
806 T_PCSTRING, /* precompiled string (hashval is KEYDEF *) */
807 T_UNUSED /* Used for something not defined. */
808 };
809
810 struct hashnode {
811 struct hashnode *next; /* double links for easy deletion */
812 struct hashnode *prev;
813 struct hashnode **bucket_hdr; /* also, a back pointer to this node's hash
814 chain is kept, in case the node is the head
815 of the chain and gets deleted. */
816 enum node_type type; /* type of special token */
817 int length; /* length of token, for quick comparison */
818 U_CHAR *name; /* the actual name */
819 union hashval value; /* pointer to expansion, or whatever */
820 };
821
822 typedef struct hashnode HASHNODE;
823
824 /* Some definitions for the hash table. The hash function MUST be
825 computed as shown in hashf () below. That is because the rescan
826 loop computes the hash value `on the fly' for most tokens,
827 in order to avoid the overhead of a lot of procedure calls to
828 the hashf () function. Hashf () only exists for the sake of
829 politeness, for use when speed isn't so important. */
830
831 #define HASHSIZE 1403
832 static HASHNODE *hashtab[HASHSIZE];
833 #define HASHSTEP(old, c) ((old << 2) + c)
834 #define MAKE_POS(v) (v & 0x7fffffff) /* make number positive */
835
836 /* Symbols to predefine. */
837
838 #ifdef CPP_PREDEFINES
839 static char *predefs = CPP_PREDEFINES;
840 #else
841 static char *predefs = "";
842 #endif
843 \f
844 /* We let tm.h override the types used here, to handle trivial differences
845 such as the choice of unsigned int or long unsigned int for size_t.
846 When machines start needing nontrivial differences in the size type,
847 it would be best to do something here to figure out automatically
848 from other information what type to use. */
849
850 /* The string value for __SIZE_TYPE__. */
851
852 #ifndef SIZE_TYPE
853 #define SIZE_TYPE "long unsigned int"
854 #endif
855
856 /* The string value for __PTRDIFF_TYPE__. */
857
858 #ifndef PTRDIFF_TYPE
859 #define PTRDIFF_TYPE "long int"
860 #endif
861
862 /* The string value for __WCHAR_TYPE__. */
863
864 #ifndef WCHAR_TYPE
865 #define WCHAR_TYPE "int"
866 #endif
867 char * wchar_type = WCHAR_TYPE;
868 #undef WCHAR_TYPE
869
870 /* The string value for __USER_LABEL_PREFIX__ */
871
872 #ifndef USER_LABEL_PREFIX
873 #define USER_LABEL_PREFIX ""
874 #endif
875
876 /* The string value for __REGISTER_PREFIX__ */
877
878 #ifndef REGISTER_PREFIX
879 #define REGISTER_PREFIX ""
880 #endif
881
882 /* The string value for __IMMEDIATE_PREFIX__ */
883
884 #ifndef IMMEDIATE_PREFIX
885 #define IMMEDIATE_PREFIX ""
886 #endif
887 \f
888 /* In the definition of a #assert name, this structure forms
889 a list of the individual values asserted.
890 Each value is itself a list of "tokens".
891 These are strings that are compared by name. */
892
893 struct tokenlist_list {
894 struct tokenlist_list *next;
895 struct arglist *tokens;
896 };
897
898 struct assertion_hashnode {
899 struct assertion_hashnode *next; /* double links for easy deletion */
900 struct assertion_hashnode *prev;
901 /* also, a back pointer to this node's hash
902 chain is kept, in case the node is the head
903 of the chain and gets deleted. */
904 struct assertion_hashnode **bucket_hdr;
905 int length; /* length of token, for quick comparison */
906 U_CHAR *name; /* the actual name */
907 /* List of token-sequences. */
908 struct tokenlist_list *value;
909 };
910
911 typedef struct assertion_hashnode ASSERTION_HASHNODE;
912
913 /* Some definitions for the hash table. The hash function MUST be
914 computed as shown in hashf below. That is because the rescan
915 loop computes the hash value `on the fly' for most tokens,
916 in order to avoid the overhead of a lot of procedure calls to
917 the hashf function. hashf only exists for the sake of
918 politeness, for use when speed isn't so important. */
919
920 #define ASSERTION_HASHSIZE 37
921 static ASSERTION_HASHNODE *assertion_hashtab[ASSERTION_HASHSIZE];
922
923 /* Nonzero means inhibit macroexpansion of what seem to be
924 assertion tests, in rescan. For #if. */
925 static int assertions_flag;
926 \f
927 /* `struct directive' defines one #-directive, including how to handle it. */
928
929 #define DO_PROTO PROTO((U_CHAR *, U_CHAR *, FILE_BUF *, struct directive *))
930
931 struct directive {
932 int length; /* Length of name */
933 int (*func) DO_PROTO; /* Function to handle directive */
934 char *name; /* Name of directive */
935 enum node_type type; /* Code which describes which directive. */
936 char angle_brackets; /* Nonzero => <...> is special. */
937 char traditional_comments; /* Nonzero: keep comments if -traditional. */
938 char pass_thru; /* Copy preprocessed directive to output file. */
939 };
940
941 /* These functions are declared to return int instead of void since they
942 are going to be placed in the table and some old compilers have trouble with
943 pointers to functions returning void. */
944
945 static int do_assert DO_PROTO;
946 static int do_define DO_PROTO;
947 static int do_elif DO_PROTO;
948 static int do_else DO_PROTO;
949 static int do_endif DO_PROTO;
950 static int do_error DO_PROTO;
951 static int do_ident DO_PROTO;
952 static int do_if DO_PROTO;
953 static int do_include DO_PROTO;
954 static int do_line DO_PROTO;
955 static int do_pragma DO_PROTO;
956 #ifdef SCCS_DIRECTIVE
957 static int do_sccs DO_PROTO;
958 #endif
959 static int do_unassert DO_PROTO;
960 static int do_undef DO_PROTO;
961 static int do_warning DO_PROTO;
962 static int do_xifdef DO_PROTO;
963
964 /* Here is the actual list of #-directives, most-often-used first. */
965
966 static struct directive directive_table[] = {
967 { 6, do_define, "define", T_DEFINE, 0, 1},
968 { 2, do_if, "if", T_IF},
969 { 5, do_xifdef, "ifdef", T_IFDEF},
970 { 6, do_xifdef, "ifndef", T_IFNDEF},
971 { 5, do_endif, "endif", T_ENDIF},
972 { 4, do_else, "else", T_ELSE},
973 { 4, do_elif, "elif", T_ELIF},
974 { 4, do_line, "line", T_LINE},
975 { 7, do_include, "include", T_INCLUDE, 1},
976 { 12, do_include, "include_next", T_INCLUDE_NEXT, 1},
977 { 6, do_include, "import", T_IMPORT, 1},
978 { 5, do_undef, "undef", T_UNDEF},
979 { 5, do_error, "error", T_ERROR},
980 { 7, do_warning, "warning", T_WARNING},
981 #ifdef SCCS_DIRECTIVE
982 { 4, do_sccs, "sccs", T_SCCS},
983 #endif
984 { 6, do_pragma, "pragma", T_PRAGMA, 0, 0, 1},
985 { 5, do_ident, "ident", T_IDENT},
986 { 6, do_assert, "assert", T_ASSERT},
987 { 8, do_unassert, "unassert", T_UNASSERT},
988 { -1, 0, "", T_UNUSED},
989 };
990
991 /* When a directive handler is called,
992 this points to the # (or the : of the %:) that started the directive. */
993 U_CHAR *directive_start;
994
995 /* table to tell if char can be part of a C identifier. */
996 U_CHAR is_idchar[256];
997 /* table to tell if char can be first char of a c identifier. */
998 U_CHAR is_idstart[256];
999 /* table to tell if c is horizontal space. */
1000 U_CHAR is_hor_space[256];
1001 /* table to tell if c is horizontal or vertical space. */
1002 static U_CHAR is_space[256];
1003 /* names of some characters */
1004 static char *char_name[256];
1005
1006 #define SKIP_WHITE_SPACE(p) do { while (is_hor_space[*p]) p++; } while (0)
1007 #define SKIP_ALL_WHITE_SPACE(p) do { while (is_space[*p]) p++; } while (0)
1008
1009 static int errors = 0; /* Error counter for exit code */
1010
1011 /* Name of output file, for error messages. */
1012 static char *out_fname;
1013
1014 /* Zero means dollar signs are punctuation.
1015 -$ stores 0; -traditional may store 1. Default is 1 for VMS, 0 otherwise.
1016 This must be 0 for correct processing of this ANSI C program:
1017 #define foo(a) #a
1018 #define lose(b) foo (b)
1019 #define test$
1020 lose (test) */
1021 static int dollars_in_ident;
1022 #ifndef DOLLARS_IN_IDENTIFIERS
1023 #define DOLLARS_IN_IDENTIFIERS 1
1024 #endif
1025
1026
1027 /* Stack of conditionals currently in progress
1028 (including both successful and failing conditionals). */
1029
1030 struct if_stack {
1031 struct if_stack *next; /* for chaining to the next stack frame */
1032 char *fname; /* copied from input when frame is made */
1033 int lineno; /* similarly */
1034 int if_succeeded; /* true if a leg of this if-group
1035 has been passed through rescan */
1036 U_CHAR *control_macro; /* For #ifndef at start of file,
1037 this is the macro name tested. */
1038 enum node_type type; /* type of last directive seen in this group */
1039 };
1040 typedef struct if_stack IF_STACK_FRAME;
1041 static IF_STACK_FRAME *if_stack = NULL;
1042
1043 /* Buffer of -M output. */
1044 static char *deps_buffer;
1045
1046 /* Number of bytes allocated in above. */
1047 static int deps_allocated_size;
1048
1049 /* Number of bytes used. */
1050 static int deps_size;
1051
1052 /* Number of bytes since the last newline. */
1053 static int deps_column;
1054
1055 /* Nonzero means -I- has been seen,
1056 so don't look for #include "foo" the source-file directory. */
1057 static int ignore_srcdir;
1058 \f
1059 static int safe_read PROTO((int, char *, int));
1060 static void safe_write PROTO((int, char *, int));
1061
1062 int main PROTO((int, char **));
1063
1064 static void path_include PROTO((char *));
1065
1066 static U_CHAR *index0 PROTO((U_CHAR *, int, size_t));
1067
1068 static void trigraph_pcp PROTO((FILE_BUF *));
1069
1070 static void newline_fix PROTO((U_CHAR *));
1071 static void name_newline_fix PROTO((U_CHAR *));
1072
1073 static char *get_lintcmd PROTO((U_CHAR *, U_CHAR *, U_CHAR **, int *, int *));
1074
1075 static void rescan PROTO((FILE_BUF *, int));
1076
1077 static FILE_BUF expand_to_temp_buffer PROTO((U_CHAR *, U_CHAR *, int, int));
1078
1079 static int handle_directive PROTO((FILE_BUF *, FILE_BUF *));
1080
1081 static struct tm *timestamp PROTO((void));
1082 static void special_symbol PROTO((HASHNODE *, FILE_BUF *));
1083
1084 static int redundant_include_p PROTO((char *));
1085 static is_system_include PROTO((char *));
1086
1087 static char *read_filename_string PROTO((int, FILE *));
1088 static struct file_name_map *read_name_map PROTO((char *));
1089 static int open_include_file PROTO((char *, struct file_name_list *));
1090
1091 static void finclude PROTO((int, char *, FILE_BUF *, int, struct file_name_list *));
1092 static void record_control_macro PROTO((char *, U_CHAR *));
1093
1094 static int import_hash PROTO((char *));
1095 static int lookup_import PROTO((char *, struct file_name_list *));
1096 static void add_import PROTO((int, char *));
1097
1098 static char *check_precompiled PROTO((int, char *, char **));
1099 static int check_preconditions PROTO((char *));
1100 static void pcfinclude PROTO((U_CHAR *, U_CHAR *, U_CHAR *, FILE_BUF *));
1101 static void pcstring_used PROTO((HASHNODE *));
1102 static void write_output PROTO((void));
1103 static void pass_thru_directive PROTO((U_CHAR *, U_CHAR *, FILE_BUF *, struct directive *));
1104
1105 static MACRODEF create_definition PROTO((U_CHAR *, U_CHAR *, FILE_BUF *));
1106
1107 static int check_macro_name PROTO((U_CHAR *, char *));
1108 static int compare_defs PROTO((DEFINITION *, DEFINITION *));
1109 static int comp_def_part PROTO((int, U_CHAR *, int, U_CHAR *, int, int));
1110
1111 static DEFINITION *collect_expansion PROTO((U_CHAR *, U_CHAR *, int, struct arglist *));
1112
1113 int check_assertion PROTO((U_CHAR *, int, int, struct arglist *));
1114 static int compare_token_lists PROTO((struct arglist *, struct arglist *));
1115
1116 static struct arglist *read_token_list PROTO((U_CHAR **, U_CHAR *, int *));
1117 static void free_token_list PROTO((struct arglist *));
1118
1119 static ASSERTION_HASHNODE *assertion_install PROTO((U_CHAR *, int, int));
1120 static ASSERTION_HASHNODE *assertion_lookup PROTO((U_CHAR *, int, int));
1121 static void delete_assertion PROTO((ASSERTION_HASHNODE *));
1122
1123 static void do_once PROTO((void));
1124
1125 static HOST_WIDE_INT eval_if_expression PROTO((U_CHAR *, int));
1126 static void conditional_skip PROTO((FILE_BUF *, int, enum node_type, U_CHAR *, FILE_BUF *));
1127 static void skip_if_group PROTO((FILE_BUF *, int, FILE_BUF *));
1128 static void validate_else PROTO((U_CHAR *));
1129
1130 static U_CHAR *skip_to_end_of_comment PROTO((FILE_BUF *, int *, int));
1131 static U_CHAR *skip_quoted_string PROTO((U_CHAR *, U_CHAR *, int, int *, int *, int *));
1132 static char *quote_string PROTO((char *, char *));
1133 static U_CHAR *skip_paren_group PROTO((FILE_BUF *));
1134
1135 /* Last arg to output_line_directive. */
1136 enum file_change_code {same_file, enter_file, leave_file};
1137 static void output_line_directive PROTO((FILE_BUF *, FILE_BUF *, int, enum file_change_code));
1138
1139 static void macroexpand PROTO((HASHNODE *, FILE_BUF *));
1140
1141 struct argdata;
1142 static char *macarg PROTO((struct argdata *, int));
1143
1144 static U_CHAR *macarg1 PROTO((U_CHAR *, U_CHAR *, int *, int *, int *, int));
1145
1146 static int discard_comments PROTO((U_CHAR *, int, int));
1147
1148 static int change_newlines PROTO((U_CHAR *, int));
1149
1150 char *my_strerror PROTO((int));
1151 void error PRINTF_PROTO_1((char *, ...));
1152 static void verror PROTO((char *, va_list));
1153 static void error_from_errno PROTO((char *));
1154 void warning PRINTF_PROTO_1((char *, ...));
1155 static void vwarning PROTO((char *, va_list));
1156 static void error_with_line PRINTF_PROTO_2((int, char *, ...));
1157 static void verror_with_line PROTO((int, char *, va_list));
1158 static void vwarning_with_line PROTO((int, char *, va_list));
1159 void pedwarn PRINTF_PROTO_1((char *, ...));
1160 void pedwarn_with_line PRINTF_PROTO_2((int, char *, ...));
1161 static void pedwarn_with_file_and_line PRINTF_PROTO_3((char *, int, char *, ...));
1162
1163 static void print_containing_files PROTO((void));
1164
1165 static int line_for_error PROTO((int));
1166 static int grow_outbuf PROTO((FILE_BUF *, int));
1167
1168 static HASHNODE *install PROTO((U_CHAR *, int, enum node_type, char *, int));
1169 HASHNODE *lookup PROTO((U_CHAR *, int, int));
1170 static void delete_macro PROTO((HASHNODE *));
1171 static int hashf PROTO((U_CHAR *, int, int));
1172
1173 static void dump_single_macro PROTO((HASHNODE *, FILE *));
1174 static void dump_all_macros PROTO((void));
1175 static void dump_defn_1 PROTO((U_CHAR *, int, int, FILE *));
1176 static void dump_arg_n PROTO((DEFINITION *, int, FILE *));
1177
1178 static void initialize_char_syntax PROTO((void));
1179 static void initialize_builtins PROTO((FILE_BUF *, FILE_BUF *));
1180
1181 static void make_definition PROTO((char *, FILE_BUF *));
1182 static void make_undef PROTO((char *, FILE_BUF *));
1183
1184 static void make_assertion PROTO((char *, char *));
1185
1186 static void append_include_chain PROTO((struct file_name_list *, struct file_name_list *));
1187
1188 static void deps_output PROTO((char *, int));
1189
1190 static void fatal PRINTF_PROTO_1((char *, ...)) __attribute__ ((noreturn));
1191 void fancy_abort PROTO((void)) __attribute__ ((noreturn));
1192 static void perror_with_name PROTO((char *));
1193 static void pfatal_with_name PROTO((char *)) __attribute__ ((noreturn));
1194 static void pipe_closed PROTO((int)) __attribute__ ((noreturn));
1195
1196 static void memory_full PROTO((void)) __attribute__ ((noreturn));
1197 GENERIC_PTR xmalloc PROTO((size_t));
1198 static GENERIC_PTR xrealloc PROTO((GENERIC_PTR, size_t));
1199 static GENERIC_PTR xcalloc PROTO((size_t, size_t));
1200 static char *savestring PROTO((char *));
1201
1202 static int file_size_and_mode PROTO((int, int *, long int *));
1203 static void output_dots PROTO((FILE *, int));
1204 \f
1205 /* Read LEN bytes at PTR from descriptor DESC, for file FILENAME,
1206 retrying if necessary. Return a negative value if an error occurs,
1207 otherwise return the actual number of bytes read,
1208 which must be LEN unless end-of-file was reached. */
1209
1210 static int
1211 safe_read (desc, ptr, len)
1212 int desc;
1213 char *ptr;
1214 int len;
1215 {
1216 int left = len;
1217 while (left > 0) {
1218 int nchars = read (desc, ptr, left);
1219 if (nchars < 0)
1220 {
1221 #ifdef EINTR
1222 if (errno == EINTR)
1223 continue;
1224 #endif
1225 return nchars;
1226 }
1227 if (nchars == 0)
1228 break;
1229 ptr += nchars;
1230 left -= nchars;
1231 }
1232 return len - left;
1233 }
1234
1235 /* Write LEN bytes at PTR to descriptor DESC,
1236 retrying if necessary, and treating any real error as fatal. */
1237
1238 static void
1239 safe_write (desc, ptr, len)
1240 int desc;
1241 char *ptr;
1242 int len;
1243 {
1244 while (len > 0) {
1245 int written = write (desc, ptr, len);
1246 if (written < 0)
1247 {
1248 #ifdef EINTR
1249 if (errno == EINTR)
1250 continue;
1251 #endif
1252 pfatal_with_name (out_fname);
1253 }
1254 ptr += written;
1255 len -= written;
1256 }
1257 }
1258 \f
1259 int
1260 main (argc, argv)
1261 int argc;
1262 char **argv;
1263 {
1264 int st_mode;
1265 long st_size;
1266 char *in_fname;
1267 char *cp;
1268 int f, i;
1269 FILE_BUF *fp;
1270 char **pend_files = (char **) xmalloc (argc * sizeof (char *));
1271 char **pend_defs = (char **) xmalloc (argc * sizeof (char *));
1272 char **pend_undefs = (char **) xmalloc (argc * sizeof (char *));
1273 char **pend_assertions = (char **) xmalloc (argc * sizeof (char *));
1274 char **pend_includes = (char **) xmalloc (argc * sizeof (char *));
1275
1276 /* Record the option used with each element of pend_assertions.
1277 This is preparation for supporting more than one option for making
1278 an assertion. */
1279 char **pend_assertion_options = (char **) xmalloc (argc * sizeof (char *));
1280 int inhibit_predefs = 0;
1281 int no_standard_includes = 0;
1282 int no_standard_cplusplus_includes = 0;
1283 int missing_newline = 0;
1284
1285 /* Non-0 means don't output the preprocessed program. */
1286 int inhibit_output = 0;
1287 /* Non-0 means -v, so print the full set of include dirs. */
1288 int verbose = 0;
1289
1290 /* File name which deps are being written to.
1291 This is 0 if deps are being written to stdout. */
1292 char *deps_file = 0;
1293 /* Fopen file mode to open deps_file with. */
1294 char *deps_mode = "a";
1295 /* Stream on which to print the dependency information. */
1296 FILE *deps_stream = 0;
1297 /* Target-name to write with the dependency information. */
1298 char *deps_target = 0;
1299
1300 #ifdef RLIMIT_STACK
1301 /* Get rid of any avoidable limit on stack size. */
1302 {
1303 struct rlimit rlim;
1304
1305 /* Set the stack limit huge so that alloca (particularly stringtab
1306 * in dbxread.c) does not fail. */
1307 getrlimit (RLIMIT_STACK, &rlim);
1308 rlim.rlim_cur = rlim.rlim_max;
1309 setrlimit (RLIMIT_STACK, &rlim);
1310 }
1311 #endif /* RLIMIT_STACK defined */
1312
1313 #ifdef SIGPIPE
1314 signal (SIGPIPE, pipe_closed);
1315 #endif
1316
1317 cp = argv[0] + strlen (argv[0]);
1318 while (cp != argv[0] && cp[-1] != '/'
1319 #ifdef DIR_SEPARATOR
1320 && cp[-1] != DIR_SEPARATOR
1321 #endif
1322 )
1323 --cp;
1324 progname = cp;
1325
1326 #ifdef VMS
1327 {
1328 /* Remove directories from PROGNAME. */
1329 char *p;
1330 char *s = progname;
1331
1332 if ((p = rindex (s, ':')) != 0) s = p + 1; /* skip device */
1333 if ((p = rindex (s, ']')) != 0) s = p + 1; /* skip directory */
1334 if ((p = rindex (s, '>')) != 0) s = p + 1; /* alternate (int'n'l) dir */
1335 s = progname = savestring (s);
1336 if ((p = rindex (s, ';')) != 0) *p = '\0'; /* strip version number */
1337 if ((p = rindex (s, '.')) != 0 /* strip type iff ".exe" */
1338 && (p[1] == 'e' || p[1] == 'E')
1339 && (p[2] == 'x' || p[2] == 'X')
1340 && (p[3] == 'e' || p[3] == 'E')
1341 && !p[4])
1342 *p = '\0';
1343 }
1344 #endif
1345
1346 in_fname = NULL;
1347 out_fname = NULL;
1348
1349 /* Initialize is_idchar to allow $. */
1350 dollars_in_ident = 1;
1351 initialize_char_syntax ();
1352 dollars_in_ident = DOLLARS_IN_IDENTIFIERS > 0;
1353
1354 no_line_directives = 0;
1355 no_trigraphs = 1;
1356 dump_macros = dump_none;
1357 no_output = 0;
1358 cplusplus = 0;
1359 cplusplus_comments = 1;
1360
1361 bzero ((char *) pend_files, argc * sizeof (char *));
1362 bzero ((char *) pend_defs, argc * sizeof (char *));
1363 bzero ((char *) pend_undefs, argc * sizeof (char *));
1364 bzero ((char *) pend_assertions, argc * sizeof (char *));
1365 bzero ((char *) pend_includes, argc * sizeof (char *));
1366
1367 /* Process switches and find input file name. */
1368
1369 for (i = 1; i < argc; i++) {
1370 if (argv[i][0] != '-') {
1371 if (out_fname != NULL)
1372 fatal ("Usage: %s [switches] input output", argv[0]);
1373 else if (in_fname != NULL)
1374 out_fname = argv[i];
1375 else
1376 in_fname = argv[i];
1377 } else {
1378 switch (argv[i][1]) {
1379
1380 case 'i':
1381 if (!strcmp (argv[i], "-include")) {
1382 if (i + 1 == argc)
1383 fatal ("Filename missing after `-include' option");
1384 else
1385 pend_includes[i] = argv[i+1], i++;
1386 }
1387 if (!strcmp (argv[i], "-imacros")) {
1388 if (i + 1 == argc)
1389 fatal ("Filename missing after `-imacros' option");
1390 else
1391 pend_files[i] = argv[i+1], i++;
1392 }
1393 if (!strcmp (argv[i], "-iprefix")) {
1394 if (i + 1 == argc)
1395 fatal ("Filename missing after `-iprefix' option");
1396 else
1397 include_prefix = argv[++i];
1398 }
1399 if (!strcmp (argv[i], "-ifoutput")) {
1400 output_conditionals = 1;
1401 }
1402 if (!strcmp (argv[i], "-isystem")) {
1403 struct file_name_list *dirtmp;
1404
1405 if (i + 1 == argc)
1406 fatal ("Filename missing after `-isystem' option");
1407
1408 dirtmp = (struct file_name_list *)
1409 xmalloc (sizeof (struct file_name_list));
1410 dirtmp->next = 0;
1411 dirtmp->control_macro = 0;
1412 dirtmp->c_system_include_path = 1;
1413 dirtmp->fname = xmalloc (strlen (argv[i+1]) + 1);
1414 strcpy (dirtmp->fname, argv[++i]);
1415 dirtmp->got_name_map = 0;
1416
1417 if (before_system == 0)
1418 before_system = dirtmp;
1419 else
1420 last_before_system->next = dirtmp;
1421 last_before_system = dirtmp; /* Tail follows the last one */
1422 }
1423 /* Add directory to end of path for includes,
1424 with the default prefix at the front of its name. */
1425 if (!strcmp (argv[i], "-iwithprefix")) {
1426 struct file_name_list *dirtmp;
1427 char *prefix;
1428
1429 if (include_prefix != 0)
1430 prefix = include_prefix;
1431 else {
1432 prefix = savestring (GCC_INCLUDE_DIR);
1433 /* Remove the `include' from /usr/local/lib/gcc.../include. */
1434 if (!strcmp (prefix + strlen (prefix) - 8, "/include"))
1435 prefix[strlen (prefix) - 7] = 0;
1436 }
1437
1438 dirtmp = (struct file_name_list *)
1439 xmalloc (sizeof (struct file_name_list));
1440 dirtmp->next = 0; /* New one goes on the end */
1441 dirtmp->control_macro = 0;
1442 dirtmp->c_system_include_path = 0;
1443 if (i + 1 == argc)
1444 fatal ("Directory name missing after `-iwithprefix' option");
1445
1446 dirtmp->fname = xmalloc (strlen (argv[i+1]) + strlen (prefix) + 1);
1447 strcpy (dirtmp->fname, prefix);
1448 strcat (dirtmp->fname, argv[++i]);
1449 dirtmp->got_name_map = 0;
1450
1451 if (after_include == 0)
1452 after_include = dirtmp;
1453 else
1454 last_after_include->next = dirtmp;
1455 last_after_include = dirtmp; /* Tail follows the last one */
1456 }
1457 /* Add directory to main path for includes,
1458 with the default prefix at the front of its name. */
1459 if (!strcmp (argv[i], "-iwithprefixbefore")) {
1460 struct file_name_list *dirtmp;
1461 char *prefix;
1462
1463 if (include_prefix != 0)
1464 prefix = include_prefix;
1465 else {
1466 prefix = savestring (GCC_INCLUDE_DIR);
1467 /* Remove the `include' from /usr/local/lib/gcc.../include. */
1468 if (!strcmp (prefix + strlen (prefix) - 8, "/include"))
1469 prefix[strlen (prefix) - 7] = 0;
1470 }
1471
1472 dirtmp = (struct file_name_list *)
1473 xmalloc (sizeof (struct file_name_list));
1474 dirtmp->next = 0; /* New one goes on the end */
1475 dirtmp->control_macro = 0;
1476 dirtmp->c_system_include_path = 0;
1477 if (i + 1 == argc)
1478 fatal ("Directory name missing after `-iwithprefixbefore' option");
1479
1480 dirtmp->fname = xmalloc (strlen (argv[i+1]) + strlen (prefix) + 1);
1481 strcpy (dirtmp->fname, prefix);
1482 strcat (dirtmp->fname, argv[++i]);
1483 dirtmp->got_name_map = 0;
1484
1485 append_include_chain (dirtmp, dirtmp);
1486 }
1487 /* Add directory to end of path for includes. */
1488 if (!strcmp (argv[i], "-idirafter")) {
1489 struct file_name_list *dirtmp;
1490
1491 dirtmp = (struct file_name_list *)
1492 xmalloc (sizeof (struct file_name_list));
1493 dirtmp->next = 0; /* New one goes on the end */
1494 dirtmp->control_macro = 0;
1495 dirtmp->c_system_include_path = 0;
1496 if (i + 1 == argc)
1497 fatal ("Directory name missing after `-idirafter' option");
1498 else
1499 dirtmp->fname = argv[++i];
1500 dirtmp->got_name_map = 0;
1501
1502 if (after_include == 0)
1503 after_include = dirtmp;
1504 else
1505 last_after_include->next = dirtmp;
1506 last_after_include = dirtmp; /* Tail follows the last one */
1507 }
1508 break;
1509
1510 case 'o':
1511 if (out_fname != NULL)
1512 fatal ("Output filename specified twice");
1513 if (i + 1 == argc)
1514 fatal ("Filename missing after -o option");
1515 out_fname = argv[++i];
1516 if (!strcmp (out_fname, "-"))
1517 out_fname = "";
1518 break;
1519
1520 case 'p':
1521 if (!strcmp (argv[i], "-pedantic"))
1522 pedantic = 1;
1523 else if (!strcmp (argv[i], "-pedantic-errors")) {
1524 pedantic = 1;
1525 pedantic_errors = 1;
1526 } else if (!strcmp (argv[i], "-pcp")) {
1527 char *pcp_fname;
1528 if (i + 1 == argc)
1529 fatal ("Filename missing after -pcp option");
1530 pcp_fname = argv[++i];
1531 pcp_outfile =
1532 ((pcp_fname[0] != '-' || pcp_fname[1] != '\0')
1533 ? fopen (pcp_fname, "w")
1534 : stdout);
1535 if (pcp_outfile == 0)
1536 pfatal_with_name (pcp_fname);
1537 no_precomp = 1;
1538 }
1539 break;
1540
1541 case 't':
1542 if (!strcmp (argv[i], "-traditional")) {
1543 traditional = 1;
1544 cplusplus_comments = 0;
1545 if (dollars_in_ident > 0)
1546 dollars_in_ident = 1;
1547 } else if (!strcmp (argv[i], "-trigraphs")) {
1548 no_trigraphs = 0;
1549 }
1550 break;
1551
1552 case 'l':
1553 if (! strcmp (argv[i], "-lang-c"))
1554 cplusplus = 0, cplusplus_comments = 1, objc = 0;
1555 if (! strcmp (argv[i], "-lang-c89"))
1556 cplusplus = 0, cplusplus_comments = 0, objc = 0;
1557 if (! strcmp (argv[i], "-lang-c++"))
1558 cplusplus = 1, cplusplus_comments = 1, objc = 0;
1559 if (! strcmp (argv[i], "-lang-objc"))
1560 objc = 1, cplusplus = 0, cplusplus_comments = 1;
1561 if (! strcmp (argv[i], "-lang-objc++"))
1562 objc = 1, cplusplus = 1, cplusplus_comments = 1;
1563 if (! strcmp (argv[i], "-lang-asm"))
1564 lang_asm = 1;
1565 if (! strcmp (argv[i], "-lint"))
1566 for_lint = 1;
1567 break;
1568
1569 case '+':
1570 cplusplus = 1, cplusplus_comments = 1;
1571 break;
1572
1573 case 'w':
1574 inhibit_warnings = 1;
1575 break;
1576
1577 case 'W':
1578 if (!strcmp (argv[i], "-Wtrigraphs"))
1579 warn_trigraphs = 1;
1580 else if (!strcmp (argv[i], "-Wno-trigraphs"))
1581 warn_trigraphs = 0;
1582 else if (!strcmp (argv[i], "-Wcomment"))
1583 warn_comments = 1;
1584 else if (!strcmp (argv[i], "-Wno-comment"))
1585 warn_comments = 0;
1586 else if (!strcmp (argv[i], "-Wcomments"))
1587 warn_comments = 1;
1588 else if (!strcmp (argv[i], "-Wno-comments"))
1589 warn_comments = 0;
1590 else if (!strcmp (argv[i], "-Wtraditional"))
1591 warn_stringify = 1;
1592 else if (!strcmp (argv[i], "-Wno-traditional"))
1593 warn_stringify = 0;
1594 else if (!strcmp (argv[i], "-Wimport"))
1595 warn_import = 1;
1596 else if (!strcmp (argv[i], "-Wno-import"))
1597 warn_import = 0;
1598 else if (!strcmp (argv[i], "-Werror"))
1599 warnings_are_errors = 1;
1600 else if (!strcmp (argv[i], "-Wno-error"))
1601 warnings_are_errors = 0;
1602 else if (!strcmp (argv[i], "-Wall"))
1603 {
1604 warn_trigraphs = 1;
1605 warn_comments = 1;
1606 }
1607 break;
1608
1609 case 'M':
1610 /* The style of the choices here is a bit mixed.
1611 The chosen scheme is a hybrid of keeping all options in one string
1612 and specifying each option in a separate argument:
1613 -M|-MM|-MD file|-MMD file [-MG]. An alternative is:
1614 -M|-MM|-MD file|-MMD file|-MG|-MMG; or more concisely:
1615 -M[M][G][D file]. This is awkward to handle in specs, and is not
1616 as extensible. */
1617 /* ??? -MG must be specified in addition to one of -M or -MM.
1618 This can be relaxed in the future without breaking anything.
1619 The converse isn't true. */
1620
1621 /* -MG isn't valid with -MD or -MMD. This is checked for later. */
1622 if (!strcmp (argv[i], "-MG"))
1623 {
1624 print_deps_missing_files = 1;
1625 break;
1626 }
1627 if (!strcmp (argv[i], "-M"))
1628 print_deps = 2;
1629 else if (!strcmp (argv[i], "-MM"))
1630 print_deps = 1;
1631 else if (!strcmp (argv[i], "-MD"))
1632 print_deps = 2;
1633 else if (!strcmp (argv[i], "-MMD"))
1634 print_deps = 1;
1635 /* For -MD and -MMD options, write deps on file named by next arg. */
1636 if (!strcmp (argv[i], "-MD")
1637 || !strcmp (argv[i], "-MMD")) {
1638 if (i + 1 == argc)
1639 fatal ("Filename missing after %s option", argv[i]);
1640 i++;
1641 deps_file = argv[i];
1642 deps_mode = "w";
1643 } else {
1644 /* For -M and -MM, write deps on standard output
1645 and suppress the usual output. */
1646 deps_stream = stdout;
1647 inhibit_output = 1;
1648 }
1649 break;
1650
1651 case 'd':
1652 {
1653 char *p = argv[i] + 2;
1654 char c;
1655 while ((c = *p++)) {
1656 /* Arg to -d specifies what parts of macros to dump */
1657 switch (c) {
1658 case 'M':
1659 dump_macros = dump_only;
1660 no_output = 1;
1661 break;
1662 case 'N':
1663 dump_macros = dump_names;
1664 break;
1665 case 'D':
1666 dump_macros = dump_definitions;
1667 break;
1668 }
1669 }
1670 }
1671 break;
1672
1673 case 'g':
1674 if (argv[i][2] == '3')
1675 debug_output = 1;
1676 break;
1677
1678 case 'v':
1679 fprintf (stderr, "GNU CPP version %s", version_string);
1680 #ifdef TARGET_VERSION
1681 TARGET_VERSION;
1682 #endif
1683 fprintf (stderr, "\n");
1684 verbose = 1;
1685 break;
1686
1687 case 'H':
1688 print_include_names = 1;
1689 break;
1690
1691 case 'D':
1692 if (argv[i][2] != 0)
1693 pend_defs[i] = argv[i] + 2;
1694 else if (i + 1 == argc)
1695 fatal ("Macro name missing after -D option");
1696 else
1697 i++, pend_defs[i] = argv[i];
1698 break;
1699
1700 case 'A':
1701 {
1702 char *p;
1703
1704 if (argv[i][2] != 0)
1705 p = argv[i] + 2;
1706 else if (i + 1 == argc)
1707 fatal ("Assertion missing after -A option");
1708 else
1709 p = argv[++i];
1710
1711 if (!strcmp (p, "-")) {
1712 /* -A- eliminates all predefined macros and assertions.
1713 Let's include also any that were specified earlier
1714 on the command line. That way we can get rid of any
1715 that were passed automatically in from GCC. */
1716 int j;
1717 inhibit_predefs = 1;
1718 for (j = 0; j < i; j++)
1719 pend_defs[j] = pend_assertions[j] = 0;
1720 } else {
1721 pend_assertions[i] = p;
1722 pend_assertion_options[i] = "-A";
1723 }
1724 }
1725 break;
1726
1727 case 'U': /* JF #undef something */
1728 if (argv[i][2] != 0)
1729 pend_undefs[i] = argv[i] + 2;
1730 else if (i + 1 == argc)
1731 fatal ("Macro name missing after -U option");
1732 else
1733 pend_undefs[i] = argv[i+1], i++;
1734 break;
1735
1736 case 'C':
1737 put_out_comments = 1;
1738 break;
1739
1740 case 'E': /* -E comes from cc -E; ignore it. */
1741 break;
1742
1743 case 'P':
1744 no_line_directives = 1;
1745 break;
1746
1747 case '$': /* Don't include $ in identifiers. */
1748 dollars_in_ident = 0;
1749 break;
1750
1751 case 'I': /* Add directory to path for includes. */
1752 {
1753 struct file_name_list *dirtmp;
1754
1755 if (! ignore_srcdir && !strcmp (argv[i] + 2, "-")) {
1756 ignore_srcdir = 1;
1757 /* Don't use any preceding -I directories for #include <...>. */
1758 first_bracket_include = 0;
1759 }
1760 else {
1761 dirtmp = (struct file_name_list *)
1762 xmalloc (sizeof (struct file_name_list));
1763 dirtmp->next = 0; /* New one goes on the end */
1764 dirtmp->control_macro = 0;
1765 dirtmp->c_system_include_path = 0;
1766 if (argv[i][2] != 0)
1767 dirtmp->fname = argv[i] + 2;
1768 else if (i + 1 == argc)
1769 fatal ("Directory name missing after -I option");
1770 else
1771 dirtmp->fname = argv[++i];
1772 dirtmp->got_name_map = 0;
1773 append_include_chain (dirtmp, dirtmp);
1774 }
1775 }
1776 break;
1777
1778 case 'n':
1779 if (!strcmp (argv[i], "-nostdinc"))
1780 /* -nostdinc causes no default include directories.
1781 You must specify all include-file directories with -I. */
1782 no_standard_includes = 1;
1783 else if (!strcmp (argv[i], "-nostdinc++"))
1784 /* -nostdinc++ causes no default C++-specific include directories. */
1785 no_standard_cplusplus_includes = 1;
1786 else if (!strcmp (argv[i], "-noprecomp"))
1787 no_precomp = 1;
1788 break;
1789
1790 case 'u':
1791 /* Sun compiler passes undocumented switch "-undef".
1792 Let's assume it means to inhibit the predefined symbols. */
1793 inhibit_predefs = 1;
1794 break;
1795
1796 case '\0': /* JF handle '-' as file name meaning stdin or stdout */
1797 if (in_fname == NULL) {
1798 in_fname = "";
1799 break;
1800 } else if (out_fname == NULL) {
1801 out_fname = "";
1802 break;
1803 } /* else fall through into error */
1804
1805 default:
1806 fatal ("Invalid option `%s'", argv[i]);
1807 }
1808 }
1809 }
1810
1811 /* Add dirs from CPATH after dirs from -I. */
1812 /* There seems to be confusion about what CPATH should do,
1813 so for the moment it is not documented. */
1814 /* Some people say that CPATH should replace the standard include dirs,
1815 but that seems pointless: it comes before them, so it overrides them
1816 anyway. */
1817 cp = getenv ("CPATH");
1818 if (cp && ! no_standard_includes)
1819 path_include (cp);
1820
1821 /* Now that dollars_in_ident is known, initialize is_idchar. */
1822 initialize_char_syntax ();
1823
1824 /* Initialize output buffer */
1825
1826 outbuf.buf = (U_CHAR *) xmalloc (OUTBUF_SIZE);
1827 outbuf.bufp = outbuf.buf;
1828 outbuf.length = OUTBUF_SIZE;
1829
1830 /* Do partial setup of input buffer for the sake of generating
1831 early #line directives (when -g is in effect). */
1832
1833 fp = &instack[++indepth];
1834 if (in_fname == NULL)
1835 in_fname = "";
1836 fp->nominal_fname = fp->fname = in_fname;
1837 fp->lineno = 0;
1838
1839 /* In C++, wchar_t is a distinct basic type, and we can expect
1840 __wchar_t to be defined by cc1plus. */
1841 if (cplusplus)
1842 wchar_type = "__wchar_t";
1843
1844 /* Install __LINE__, etc. Must follow initialize_char_syntax
1845 and option processing. */
1846 initialize_builtins (fp, &outbuf);
1847
1848 /* Do standard #defines and assertions
1849 that identify system and machine type. */
1850
1851 if (!inhibit_predefs) {
1852 char *p = (char *) alloca (strlen (predefs) + 1);
1853 strcpy (p, predefs);
1854 while (*p) {
1855 char *q;
1856 while (*p == ' ' || *p == '\t')
1857 p++;
1858 /* Handle -D options. */
1859 if (p[0] == '-' && p[1] == 'D') {
1860 q = &p[2];
1861 while (*p && *p != ' ' && *p != '\t')
1862 p++;
1863 if (*p != 0)
1864 *p++= 0;
1865 if (debug_output)
1866 output_line_directive (fp, &outbuf, 0, same_file);
1867 make_definition (q, &outbuf);
1868 while (*p == ' ' || *p == '\t')
1869 p++;
1870 } else if (p[0] == '-' && p[1] == 'A') {
1871 /* Handle -A options (assertions). */
1872 char *assertion;
1873 char *past_name;
1874 char *value;
1875 char *past_value;
1876 char *termination;
1877 int save_char;
1878
1879 assertion = &p[2];
1880 past_name = assertion;
1881 /* Locate end of name. */
1882 while (*past_name && *past_name != ' '
1883 && *past_name != '\t' && *past_name != '(')
1884 past_name++;
1885 /* Locate `(' at start of value. */
1886 value = past_name;
1887 while (*value && (*value == ' ' || *value == '\t'))
1888 value++;
1889 if (*value++ != '(')
1890 abort ();
1891 while (*value && (*value == ' ' || *value == '\t'))
1892 value++;
1893 past_value = value;
1894 /* Locate end of value. */
1895 while (*past_value && *past_value != ' '
1896 && *past_value != '\t' && *past_value != ')')
1897 past_value++;
1898 termination = past_value;
1899 while (*termination && (*termination == ' ' || *termination == '\t'))
1900 termination++;
1901 if (*termination++ != ')')
1902 abort ();
1903 if (*termination && *termination != ' ' && *termination != '\t')
1904 abort ();
1905 /* Temporarily null-terminate the value. */
1906 save_char = *termination;
1907 *termination = '\0';
1908 /* Install the assertion. */
1909 make_assertion ("-A", assertion);
1910 *termination = (char) save_char;
1911 p = termination;
1912 while (*p == ' ' || *p == '\t')
1913 p++;
1914 } else {
1915 abort ();
1916 }
1917 }
1918 }
1919
1920 /* Now handle the command line options. */
1921
1922 /* Do -U's, -D's and -A's in the order they were seen. */
1923 for (i = 1; i < argc; i++) {
1924 if (pend_undefs[i]) {
1925 if (debug_output)
1926 output_line_directive (fp, &outbuf, 0, same_file);
1927 make_undef (pend_undefs[i], &outbuf);
1928 }
1929 if (pend_defs[i]) {
1930 if (debug_output)
1931 output_line_directive (fp, &outbuf, 0, same_file);
1932 make_definition (pend_defs[i], &outbuf);
1933 }
1934 if (pend_assertions[i])
1935 make_assertion (pend_assertion_options[i], pend_assertions[i]);
1936 }
1937
1938 done_initializing = 1;
1939
1940 { /* read the appropriate environment variable and if it exists
1941 replace include_defaults with the listed path. */
1942 char *epath = 0;
1943 switch ((objc << 1) + cplusplus)
1944 {
1945 case 0:
1946 epath = getenv ("C_INCLUDE_PATH");
1947 break;
1948 case 1:
1949 epath = getenv ("CPLUS_INCLUDE_PATH");
1950 break;
1951 case 2:
1952 epath = getenv ("OBJC_INCLUDE_PATH");
1953 break;
1954 case 3:
1955 epath = getenv ("OBJCPLUS_INCLUDE_PATH");
1956 break;
1957 }
1958 /* If the environment var for this language is set,
1959 add to the default list of include directories. */
1960 if (epath) {
1961 char *nstore = (char *) alloca (strlen (epath) + 2);
1962 int num_dirs;
1963 char *startp, *endp;
1964
1965 for (num_dirs = 1, startp = epath; *startp; startp++)
1966 if (*startp == PATH_SEPARATOR)
1967 num_dirs++;
1968 include_defaults
1969 = (struct default_include *) xmalloc ((num_dirs
1970 * sizeof (struct default_include))
1971 + sizeof (include_defaults_array));
1972 startp = endp = epath;
1973 num_dirs = 0;
1974 while (1) {
1975 /* Handle cases like c:/usr/lib:d:/gcc/lib */
1976 if ((*endp == PATH_SEPARATOR
1977 #if 0 /* Obsolete, now that we use semicolons as the path separator. */
1978 #ifdef __MSDOS__
1979 && (endp-startp != 1 || !isalpha (*startp))
1980 #endif
1981 #endif
1982 )
1983 || *endp == 0) {
1984 strncpy (nstore, startp, endp-startp);
1985 if (endp == startp)
1986 strcpy (nstore, ".");
1987 else
1988 nstore[endp-startp] = '\0';
1989
1990 include_defaults[num_dirs].fname = savestring (nstore);
1991 include_defaults[num_dirs].cplusplus = cplusplus;
1992 include_defaults[num_dirs].cxx_aware = 1;
1993 num_dirs++;
1994 if (*endp == '\0')
1995 break;
1996 endp = startp = endp + 1;
1997 } else
1998 endp++;
1999 }
2000 /* Put the usual defaults back in at the end. */
2001 bcopy ((char *) include_defaults_array,
2002 (char *) &include_defaults[num_dirs],
2003 sizeof (include_defaults_array));
2004 }
2005 }
2006
2007 append_include_chain (before_system, last_before_system);
2008 first_system_include = before_system;
2009
2010 /* Unless -fnostdinc,
2011 tack on the standard include file dirs to the specified list */
2012 if (!no_standard_includes) {
2013 struct default_include *p = include_defaults;
2014 char *specd_prefix = include_prefix;
2015 char *default_prefix = savestring (GCC_INCLUDE_DIR);
2016 int default_len = 0;
2017 /* Remove the `include' from /usr/local/lib/gcc.../include. */
2018 if (!strcmp (default_prefix + strlen (default_prefix) - 8, "/include")) {
2019 default_len = strlen (default_prefix) - 7;
2020 default_prefix[default_len] = 0;
2021 }
2022 /* Search "translated" versions of GNU directories.
2023 These have /usr/local/lib/gcc... replaced by specd_prefix. */
2024 if (specd_prefix != 0 && default_len != 0)
2025 for (p = include_defaults; p->fname; p++) {
2026 /* Some standard dirs are only for C++. */
2027 if (!p->cplusplus || (cplusplus && !no_standard_cplusplus_includes)) {
2028 /* Does this dir start with the prefix? */
2029 if (!strncmp (p->fname, default_prefix, default_len)) {
2030 /* Yes; change prefix and add to search list. */
2031 struct file_name_list *new
2032 = (struct file_name_list *) xmalloc (sizeof (struct file_name_list));
2033 int this_len = strlen (specd_prefix) + strlen (p->fname) - default_len;
2034 char *str = xmalloc (this_len + 1);
2035 strcpy (str, specd_prefix);
2036 strcat (str, p->fname + default_len);
2037 new->fname = str;
2038 new->control_macro = 0;
2039 new->c_system_include_path = !p->cxx_aware;
2040 new->got_name_map = 0;
2041 append_include_chain (new, new);
2042 if (first_system_include == 0)
2043 first_system_include = new;
2044 }
2045 }
2046 }
2047 /* Search ordinary names for GNU include directories. */
2048 for (p = include_defaults; p->fname; p++) {
2049 /* Some standard dirs are only for C++. */
2050 if (!p->cplusplus || (cplusplus && !no_standard_cplusplus_includes)) {
2051 struct file_name_list *new
2052 = (struct file_name_list *) xmalloc (sizeof (struct file_name_list));
2053 new->control_macro = 0;
2054 new->c_system_include_path = !p->cxx_aware;
2055 new->fname = p->fname;
2056 new->got_name_map = 0;
2057 append_include_chain (new, new);
2058 if (first_system_include == 0)
2059 first_system_include = new;
2060 }
2061 }
2062 }
2063
2064 /* Tack the after_include chain at the end of the include chain. */
2065 append_include_chain (after_include, last_after_include);
2066 if (first_system_include == 0)
2067 first_system_include = after_include;
2068
2069 /* With -v, print the list of dirs to search. */
2070 if (verbose) {
2071 struct file_name_list *p;
2072 fprintf (stderr, "#include \"...\" search starts here:\n");
2073 for (p = include; p; p = p->next) {
2074 if (p == first_bracket_include)
2075 fprintf (stderr, "#include <...> search starts here:\n");
2076 fprintf (stderr, " %s\n", p->fname);
2077 }
2078 fprintf (stderr, "End of search list.\n");
2079 }
2080
2081 /* Scan the -imacros files before the main input.
2082 Much like #including them, but with no_output set
2083 so that only their macro definitions matter. */
2084
2085 no_output++; no_record_file++;
2086 for (i = 1; i < argc; i++)
2087 if (pend_files[i]) {
2088 int fd = open (pend_files[i], O_RDONLY, 0666);
2089 if (fd < 0) {
2090 perror_with_name (pend_files[i]);
2091 return FATAL_EXIT_CODE;
2092 }
2093 finclude (fd, pend_files[i], &outbuf, 0, NULL_PTR);
2094 }
2095 no_output--; no_record_file--;
2096
2097 /* Copy the entire contents of the main input file into
2098 the stacked input buffer previously allocated for it. */
2099
2100 /* JF check for stdin */
2101 if (in_fname == NULL || *in_fname == 0) {
2102 in_fname = "";
2103 f = 0;
2104 } else if ((f = open (in_fname, O_RDONLY, 0666)) < 0)
2105 goto perror;
2106
2107 /* -MG doesn't select the form of output and must be specified with one of
2108 -M or -MM. -MG doesn't make sense with -MD or -MMD since they don't
2109 inhibit compilation. */
2110 if (print_deps_missing_files && (print_deps == 0 || !inhibit_output))
2111 fatal ("-MG must be specified with one of -M or -MM");
2112
2113 /* Either of two environment variables can specify output of deps.
2114 Its value is either "OUTPUT_FILE" or "OUTPUT_FILE DEPS_TARGET",
2115 where OUTPUT_FILE is the file to write deps info to
2116 and DEPS_TARGET is the target to mention in the deps. */
2117
2118 if (print_deps == 0
2119 && (getenv ("SUNPRO_DEPENDENCIES") != 0
2120 || getenv ("DEPENDENCIES_OUTPUT") != 0)) {
2121 char *spec = getenv ("DEPENDENCIES_OUTPUT");
2122 char *s;
2123 char *output_file;
2124
2125 if (spec == 0) {
2126 spec = getenv ("SUNPRO_DEPENDENCIES");
2127 print_deps = 2;
2128 }
2129 else
2130 print_deps = 1;
2131
2132 s = spec;
2133 /* Find the space before the DEPS_TARGET, if there is one. */
2134 /* This should use index. (mrs) */
2135 while (*s != 0 && *s != ' ') s++;
2136 if (*s != 0) {
2137 deps_target = s + 1;
2138 output_file = xmalloc (s - spec + 1);
2139 bcopy (spec, output_file, s - spec);
2140 output_file[s - spec] = 0;
2141 }
2142 else {
2143 deps_target = 0;
2144 output_file = spec;
2145 }
2146
2147 deps_file = output_file;
2148 deps_mode = "a";
2149 }
2150
2151 /* For -M, print the expected object file name
2152 as the target of this Make-rule. */
2153 if (print_deps) {
2154 deps_allocated_size = 200;
2155 deps_buffer = xmalloc (deps_allocated_size);
2156 deps_buffer[0] = 0;
2157 deps_size = 0;
2158 deps_column = 0;
2159
2160 if (deps_target) {
2161 deps_output (deps_target, ':');
2162 } else if (*in_fname == 0) {
2163 deps_output ("-", ':');
2164 } else {
2165 char *p, *q;
2166 int len;
2167
2168 /* Discard all directory prefixes from filename. */
2169 if ((q = rindex (in_fname, '/')) != NULL
2170 #ifdef DIR_SEPARATOR
2171 && (q = rindex (in_fname, DIR_SEPARATOR)) != NULL
2172 #endif
2173 )
2174 ++q;
2175 else
2176 q = in_fname;
2177
2178 /* Copy remainder to mungable area. */
2179 p = (char *) alloca (strlen(q) + 8);
2180 strcpy (p, q);
2181
2182 /* Output P, but remove known suffixes. */
2183 len = strlen (p);
2184 q = p + len;
2185 if (len >= 2
2186 && p[len - 2] == '.'
2187 && index("cCsSm", p[len - 1]))
2188 q = p + (len - 2);
2189 else if (len >= 3
2190 && p[len - 3] == '.'
2191 && p[len - 2] == 'c'
2192 && p[len - 1] == 'c')
2193 q = p + (len - 3);
2194 else if (len >= 4
2195 && p[len - 4] == '.'
2196 && p[len - 3] == 'c'
2197 && p[len - 2] == 'x'
2198 && p[len - 1] == 'x')
2199 q = p + (len - 4);
2200 else if (len >= 4
2201 && p[len - 4] == '.'
2202 && p[len - 3] == 'c'
2203 && p[len - 2] == 'p'
2204 && p[len - 1] == 'p')
2205 q = p + (len - 4);
2206
2207 /* Supply our own suffix. */
2208 #ifndef VMS
2209 strcpy (q, ".o");
2210 #else
2211 strcpy (q, ".obj");
2212 #endif
2213
2214 deps_output (p, ':');
2215 deps_output (in_fname, ' ');
2216 }
2217 }
2218
2219 file_size_and_mode (f, &st_mode, &st_size);
2220 fp->nominal_fname = fp->fname = in_fname;
2221 fp->lineno = 1;
2222 fp->system_header_p = 0;
2223 /* JF all this is mine about reading pipes and ttys */
2224 if (! S_ISREG (st_mode)) {
2225 /* Read input from a file that is not a normal disk file.
2226 We cannot preallocate a buffer with the correct size,
2227 so we must read in the file a piece at the time and make it bigger. */
2228 int size;
2229 int bsize;
2230 int cnt;
2231
2232 bsize = 2000;
2233 size = 0;
2234 fp->buf = (U_CHAR *) xmalloc (bsize + 2);
2235 for (;;) {
2236 cnt = safe_read (f, (char *) fp->buf + size, bsize - size);
2237 if (cnt < 0) goto perror; /* error! */
2238 size += cnt;
2239 if (size != bsize) break; /* End of file */
2240 bsize *= 2;
2241 fp->buf = (U_CHAR *) xrealloc (fp->buf, bsize + 2);
2242 }
2243 fp->length = size;
2244 } else {
2245 /* Read a file whose size we can determine in advance.
2246 For the sake of VMS, st_size is just an upper bound. */
2247 fp->buf = (U_CHAR *) xmalloc (st_size + 2);
2248 fp->length = safe_read (f, (char *) fp->buf, st_size);
2249 if (fp->length < 0) goto perror;
2250 }
2251 fp->bufp = fp->buf;
2252 fp->if_stack = if_stack;
2253
2254 /* Make sure data ends with a newline. And put a null after it. */
2255
2256 if ((fp->length > 0 && fp->buf[fp->length - 1] != '\n')
2257 /* Backslash-newline at end is not good enough. */
2258 || (fp->length > 1 && fp->buf[fp->length - 2] == '\\')) {
2259 fp->buf[fp->length++] = '\n';
2260 missing_newline = 1;
2261 }
2262 fp->buf[fp->length] = '\0';
2263
2264 /* Unless inhibited, convert trigraphs in the input. */
2265
2266 if (!no_trigraphs)
2267 trigraph_pcp (fp);
2268
2269 /* Now that we know the input file is valid, open the output. */
2270
2271 if (!out_fname || !strcmp (out_fname, ""))
2272 out_fname = "stdout";
2273 else if (! freopen (out_fname, "w", stdout))
2274 pfatal_with_name (out_fname);
2275
2276 output_line_directive (fp, &outbuf, 0, same_file);
2277
2278 /* Scan the -include files before the main input. */
2279
2280 no_record_file++;
2281 for (i = 1; i < argc; i++)
2282 if (pend_includes[i]) {
2283 int fd = open (pend_includes[i], O_RDONLY, 0666);
2284 if (fd < 0) {
2285 perror_with_name (pend_includes[i]);
2286 return FATAL_EXIT_CODE;
2287 }
2288 finclude (fd, pend_includes[i], &outbuf, 0, NULL_PTR);
2289 }
2290 no_record_file--;
2291
2292 /* Scan the input, processing macros and directives. */
2293
2294 rescan (&outbuf, 0);
2295
2296 if (missing_newline)
2297 fp->lineno--;
2298
2299 if (pedantic && missing_newline)
2300 pedwarn ("file does not end in newline");
2301
2302 /* Now we have processed the entire input
2303 Write whichever kind of output has been requested. */
2304
2305 if (dump_macros == dump_only)
2306 dump_all_macros ();
2307 else if (! inhibit_output) {
2308 write_output ();
2309 }
2310
2311 if (print_deps) {
2312 /* Don't actually write the deps file if compilation has failed. */
2313 if (errors == 0) {
2314 if (deps_file && ! (deps_stream = fopen (deps_file, deps_mode)))
2315 pfatal_with_name (deps_file);
2316 fputs (deps_buffer, deps_stream);
2317 putc ('\n', deps_stream);
2318 if (deps_file) {
2319 if (ferror (deps_stream) || fclose (deps_stream) != 0)
2320 fatal ("I/O error on output");
2321 }
2322 }
2323 }
2324
2325 if (pcp_outfile && pcp_outfile != stdout
2326 && (ferror (pcp_outfile) || fclose (pcp_outfile) != 0))
2327 fatal ("I/O error on `-pcp' output");
2328
2329 if (ferror (stdout) || fclose (stdout) != 0)
2330 fatal ("I/O error on output");
2331
2332 if (errors)
2333 exit (FATAL_EXIT_CODE);
2334 exit (SUCCESS_EXIT_CODE);
2335
2336 perror:
2337 pfatal_with_name (in_fname);
2338 return 0;
2339 }
2340 \f
2341 /* Given a colon-separated list of file names PATH,
2342 add all the names to the search path for include files. */
2343
2344 static void
2345 path_include (path)
2346 char *path;
2347 {
2348 char *p;
2349
2350 p = path;
2351
2352 if (*p)
2353 while (1) {
2354 char *q = p;
2355 char *name;
2356 struct file_name_list *dirtmp;
2357
2358 /* Find the end of this name. */
2359 while (*q != 0 && *q != PATH_SEPARATOR) q++;
2360 if (p == q) {
2361 /* An empty name in the path stands for the current directory. */
2362 name = xmalloc (2);
2363 name[0] = '.';
2364 name[1] = 0;
2365 } else {
2366 /* Otherwise use the directory that is named. */
2367 name = xmalloc (q - p + 1);
2368 bcopy (p, name, q - p);
2369 name[q - p] = 0;
2370 }
2371
2372 dirtmp = (struct file_name_list *)
2373 xmalloc (sizeof (struct file_name_list));
2374 dirtmp->next = 0; /* New one goes on the end */
2375 dirtmp->control_macro = 0;
2376 dirtmp->c_system_include_path = 0;
2377 dirtmp->fname = name;
2378 dirtmp->got_name_map = 0;
2379 append_include_chain (dirtmp, dirtmp);
2380
2381 /* Advance past this name. */
2382 p = q;
2383 if (*p == 0)
2384 break;
2385 /* Skip the colon. */
2386 p++;
2387 }
2388 }
2389 \f
2390 /* Return the address of the first character in S that equals C.
2391 S is an array of length N, possibly containing '\0's, and followed by '\0'.
2392 Return 0 if there is no such character. Assume that C itself is not '\0'.
2393 If we knew we could use memchr, we could just invoke memchr (S, C, N),
2394 but unfortunately memchr isn't autoconfigured yet. */
2395
2396 static U_CHAR *
2397 index0 (s, c, n)
2398 U_CHAR *s;
2399 int c;
2400 size_t n;
2401 {
2402 char *p = (char *) s;
2403 for (;;) {
2404 char *q = index (p, c);
2405 if (q)
2406 return (U_CHAR *) q;
2407 else {
2408 size_t l = strlen (p);
2409 if (l == n)
2410 return 0;
2411 l++;
2412 p += l;
2413 n -= l;
2414 }
2415 }
2416 }
2417 \f
2418 /* Pre-C-Preprocessor to translate ANSI trigraph idiocy in BUF
2419 before main CCCP processing. Name `pcp' is also in honor of the
2420 drugs the trigraph designers must have been on.
2421
2422 Using an extra pass through the buffer takes a little extra time,
2423 but is infinitely less hairy than trying to handle trigraphs inside
2424 strings, etc. everywhere, and also makes sure that trigraphs are
2425 only translated in the top level of processing. */
2426
2427 static void
2428 trigraph_pcp (buf)
2429 FILE_BUF *buf;
2430 {
2431 register U_CHAR c, *fptr, *bptr, *sptr, *lptr;
2432 int len;
2433
2434 fptr = bptr = sptr = buf->buf;
2435 lptr = fptr + buf->length;
2436 while ((sptr = index0 (sptr, '?', (size_t) (lptr - sptr))) != NULL) {
2437 if (*++sptr != '?')
2438 continue;
2439 switch (*++sptr) {
2440 case '=':
2441 c = '#';
2442 break;
2443 case '(':
2444 c = '[';
2445 break;
2446 case '/':
2447 c = '\\';
2448 break;
2449 case ')':
2450 c = ']';
2451 break;
2452 case '\'':
2453 c = '^';
2454 break;
2455 case '<':
2456 c = '{';
2457 break;
2458 case '!':
2459 c = '|';
2460 break;
2461 case '>':
2462 c = '}';
2463 break;
2464 case '-':
2465 c = '~';
2466 break;
2467 case '?':
2468 sptr--;
2469 continue;
2470 default:
2471 continue;
2472 }
2473 len = sptr - fptr - 2;
2474
2475 /* BSD doc says bcopy () works right for overlapping strings. In ANSI
2476 C, this will be memmove (). */
2477 if (bptr != fptr && len > 0)
2478 bcopy ((char *) fptr, (char *) bptr, len);
2479
2480 bptr += len;
2481 *bptr++ = c;
2482 fptr = ++sptr;
2483 }
2484 len = buf->length - (fptr - buf->buf);
2485 if (bptr != fptr && len > 0)
2486 bcopy ((char *) fptr, (char *) bptr, len);
2487 buf->length -= fptr - bptr;
2488 buf->buf[buf->length] = '\0';
2489 if (warn_trigraphs && fptr != bptr)
2490 warning ("%d trigraph(s) encountered", (fptr - bptr) / 2);
2491 }
2492 \f
2493 /* Move all backslash-newline pairs out of embarrassing places.
2494 Exchange all such pairs following BP
2495 with any potentially-embarrassing characters that follow them.
2496 Potentially-embarrassing characters are / and *
2497 (because a backslash-newline inside a comment delimiter
2498 would cause it not to be recognized). */
2499
2500 static void
2501 newline_fix (bp)
2502 U_CHAR *bp;
2503 {
2504 register U_CHAR *p = bp;
2505
2506 /* First count the backslash-newline pairs here. */
2507
2508 while (p[0] == '\\' && p[1] == '\n')
2509 p += 2;
2510
2511 /* What follows the backslash-newlines is not embarrassing. */
2512
2513 if (*p != '/' && *p != '*')
2514 return;
2515
2516 /* Copy all potentially embarrassing characters
2517 that follow the backslash-newline pairs
2518 down to where the pairs originally started. */
2519
2520 while (*p == '*' || *p == '/')
2521 *bp++ = *p++;
2522
2523 /* Now write the same number of pairs after the embarrassing chars. */
2524 while (bp < p) {
2525 *bp++ = '\\';
2526 *bp++ = '\n';
2527 }
2528 }
2529
2530 /* Like newline_fix but for use within a directive-name.
2531 Move any backslash-newlines up past any following symbol constituents. */
2532
2533 static void
2534 name_newline_fix (bp)
2535 U_CHAR *bp;
2536 {
2537 register U_CHAR *p = bp;
2538
2539 /* First count the backslash-newline pairs here. */
2540 while (p[0] == '\\' && p[1] == '\n')
2541 p += 2;
2542
2543 /* What follows the backslash-newlines is not embarrassing. */
2544
2545 if (!is_idchar[*p])
2546 return;
2547
2548 /* Copy all potentially embarrassing characters
2549 that follow the backslash-newline pairs
2550 down to where the pairs originally started. */
2551
2552 while (is_idchar[*p])
2553 *bp++ = *p++;
2554
2555 /* Now write the same number of pairs after the embarrassing chars. */
2556 while (bp < p) {
2557 *bp++ = '\\';
2558 *bp++ = '\n';
2559 }
2560 }
2561 \f
2562 /* Look for lint commands in comments.
2563
2564 When we come in here, ibp points into a comment. Limit is as one expects.
2565 scan within the comment -- it should start, after lwsp, with a lint command.
2566 If so that command is returned as a (constant) string.
2567
2568 Upon return, any arg will be pointed to with argstart and will be
2569 arglen long. Note that we don't parse that arg since it will just
2570 be printed out again.
2571 */
2572
2573 static char *
2574 get_lintcmd (ibp, limit, argstart, arglen, cmdlen)
2575 register U_CHAR *ibp;
2576 register U_CHAR *limit;
2577 U_CHAR **argstart; /* point to command arg */
2578 int *arglen, *cmdlen; /* how long they are */
2579 {
2580 long linsize;
2581 register U_CHAR *numptr; /* temp for arg parsing */
2582
2583 *arglen = 0;
2584
2585 SKIP_WHITE_SPACE (ibp);
2586
2587 if (ibp >= limit) return NULL;
2588
2589 linsize = limit - ibp;
2590
2591 /* Oh, I wish C had lexical functions... hell, I'll just open-code the set */
2592 if ((linsize >= 10) && !bcmp (ibp, "NOTREACHED", 10)) {
2593 *cmdlen = 10;
2594 return "NOTREACHED";
2595 }
2596 if ((linsize >= 8) && !bcmp (ibp, "ARGSUSED", 8)) {
2597 *cmdlen = 8;
2598 return "ARGSUSED";
2599 }
2600 if ((linsize >= 11) && !bcmp (ibp, "LINTLIBRARY", 11)) {
2601 *cmdlen = 11;
2602 return "LINTLIBRARY";
2603 }
2604 if ((linsize >= 7) && !bcmp (ibp, "VARARGS", 7)) {
2605 *cmdlen = 7;
2606 ibp += 7; linsize -= 7;
2607 if ((linsize == 0) || ! isdigit (*ibp)) return "VARARGS";
2608
2609 /* OK, read a number */
2610 for (numptr = *argstart = ibp; (numptr < limit) && isdigit (*numptr);
2611 numptr++);
2612 *arglen = numptr - *argstart;
2613 return "VARARGS";
2614 }
2615 return NULL;
2616 }
2617 \f
2618 /*
2619 * The main loop of the program.
2620 *
2621 * Read characters from the input stack, transferring them to the
2622 * output buffer OP.
2623 *
2624 * Macros are expanded and push levels on the input stack.
2625 * At the end of such a level it is popped off and we keep reading.
2626 * At the end of any other kind of level, we return.
2627 * #-directives are handled, except within macros.
2628 *
2629 * If OUTPUT_MARKS is nonzero, keep Newline markers found in the input
2630 * and insert them when appropriate. This is set while scanning macro
2631 * arguments before substitution. It is zero when scanning for final output.
2632 * There are three types of Newline markers:
2633 * * Newline - follows a macro name that was not expanded
2634 * because it appeared inside an expansion of the same macro.
2635 * This marker prevents future expansion of that identifier.
2636 * When the input is rescanned into the final output, these are deleted.
2637 * These are also deleted by ## concatenation.
2638 * * Newline Space (or Newline and any other whitespace character)
2639 * stands for a place that tokens must be separated or whitespace
2640 * is otherwise desirable, but where the ANSI standard specifies there
2641 * is no whitespace. This marker turns into a Space (or whichever other
2642 * whitespace char appears in the marker) in the final output,
2643 * but it turns into nothing in an argument that is stringified with #.
2644 * Such stringified arguments are the only place where the ANSI standard
2645 * specifies with precision that whitespace may not appear.
2646 *
2647 * During this function, IP->bufp is kept cached in IBP for speed of access.
2648 * Likewise, OP->bufp is kept in OBP. Before calling a subroutine
2649 * IBP, IP and OBP must be copied back to memory. IP and IBP are
2650 * copied back with the RECACHE macro. OBP must be copied back from OP->bufp
2651 * explicitly, and before RECACHE, since RECACHE uses OBP.
2652 */
2653
2654 static void
2655 rescan (op, output_marks)
2656 FILE_BUF *op;
2657 int output_marks;
2658 {
2659 /* Character being scanned in main loop. */
2660 register U_CHAR c;
2661
2662 /* Length of pending accumulated identifier. */
2663 register int ident_length = 0;
2664
2665 /* Hash code of pending accumulated identifier. */
2666 register int hash = 0;
2667
2668 /* Current input level (&instack[indepth]). */
2669 FILE_BUF *ip;
2670
2671 /* Pointer for scanning input. */
2672 register U_CHAR *ibp;
2673
2674 /* Pointer to end of input. End of scan is controlled by LIMIT. */
2675 register U_CHAR *limit;
2676
2677 /* Pointer for storing output. */
2678 register U_CHAR *obp;
2679
2680 /* REDO_CHAR is nonzero if we are processing an identifier
2681 after backing up over the terminating character.
2682 Sometimes we process an identifier without backing up over
2683 the terminating character, if the terminating character
2684 is not special. Backing up is done so that the terminating character
2685 will be dispatched on again once the identifier is dealt with. */
2686 int redo_char = 0;
2687
2688 /* 1 if within an identifier inside of which a concatenation
2689 marker (Newline -) has been seen. */
2690 int concatenated = 0;
2691
2692 /* While scanning a comment or a string constant,
2693 this records the line it started on, for error messages. */
2694 int start_line;
2695
2696 /* Record position of last `real' newline. */
2697 U_CHAR *beg_of_line;
2698
2699 /* Pop the innermost input stack level, assuming it is a macro expansion. */
2700
2701 #define POPMACRO \
2702 do { ip->macro->type = T_MACRO; \
2703 if (ip->free_ptr) free (ip->free_ptr); \
2704 --indepth; } while (0)
2705
2706 /* Reload `rescan's local variables that describe the current
2707 level of the input stack. */
2708
2709 #define RECACHE \
2710 do { ip = &instack[indepth]; \
2711 ibp = ip->bufp; \
2712 limit = ip->buf + ip->length; \
2713 op->bufp = obp; \
2714 check_expand (op, limit - ibp); \
2715 beg_of_line = 0; \
2716 obp = op->bufp; } while (0)
2717
2718 if (no_output && instack[indepth].fname != 0)
2719 skip_if_group (&instack[indepth], 1, NULL);
2720
2721 obp = op->bufp;
2722 RECACHE;
2723
2724 beg_of_line = ibp;
2725
2726 /* Our caller must always put a null after the end of
2727 the input at each input stack level. */
2728 if (*limit != 0)
2729 abort ();
2730
2731 while (1) {
2732 c = *ibp++;
2733 *obp++ = c;
2734
2735 switch (c) {
2736 case '\\':
2737 if (*ibp == '\n' && !ip->macro) {
2738 /* At the top level, always merge lines ending with backslash-newline,
2739 even in middle of identifier. But do not merge lines in a macro,
2740 since backslash might be followed by a newline-space marker. */
2741 ++ibp;
2742 ++ip->lineno;
2743 --obp; /* remove backslash from obuf */
2744 break;
2745 }
2746 /* If ANSI, backslash is just another character outside a string. */
2747 if (!traditional)
2748 goto randomchar;
2749 /* Otherwise, backslash suppresses specialness of following char,
2750 so copy it here to prevent the switch from seeing it.
2751 But first get any pending identifier processed. */
2752 if (ident_length > 0)
2753 goto specialchar;
2754 if (ibp < limit)
2755 *obp++ = *ibp++;
2756 break;
2757
2758 case '%':
2759 if (ident_length || ip->macro || traditional)
2760 goto randomchar;
2761 while (*ibp == '\\' && ibp[1] == '\n') {
2762 ibp += 2;
2763 ++ip->lineno;
2764 }
2765 if (*ibp != ':')
2766 break;
2767 /* Treat this %: digraph as if it were #. */
2768 /* Fall through. */
2769
2770 case '#':
2771 if (assertions_flag) {
2772 /* Copy #foo (bar lose) without macro expansion. */
2773 obp[-1] = '#'; /* In case it was '%'. */
2774 SKIP_WHITE_SPACE (ibp);
2775 while (is_idchar[*ibp])
2776 *obp++ = *ibp++;
2777 SKIP_WHITE_SPACE (ibp);
2778 if (*ibp == '(') {
2779 ip->bufp = ibp;
2780 skip_paren_group (ip);
2781 bcopy ((char *) ibp, (char *) obp, ip->bufp - ibp);
2782 obp += ip->bufp - ibp;
2783 ibp = ip->bufp;
2784 }
2785 }
2786
2787 /* If this is expanding a macro definition, don't recognize
2788 preprocessing directives. */
2789 if (ip->macro != 0)
2790 goto randomchar;
2791 /* If this is expand_into_temp_buffer,
2792 don't recognize them either. Warn about them
2793 only after an actual newline at this level,
2794 not at the beginning of the input level. */
2795 if (! ip->fname) {
2796 if (ip->buf != beg_of_line)
2797 warning ("preprocessing directive not recognized within macro arg");
2798 goto randomchar;
2799 }
2800 if (ident_length)
2801 goto specialchar;
2802
2803
2804 /* # keyword: a # must be first nonblank char on the line */
2805 if (beg_of_line == 0)
2806 goto randomchar;
2807 {
2808 U_CHAR *bp;
2809
2810 /* Scan from start of line, skipping whitespace, comments
2811 and backslash-newlines, and see if we reach this #.
2812 If not, this # is not special. */
2813 bp = beg_of_line;
2814 /* If -traditional, require # to be at beginning of line. */
2815 if (!traditional) {
2816 while (1) {
2817 if (is_hor_space[*bp])
2818 bp++;
2819 else if (*bp == '\\' && bp[1] == '\n')
2820 bp += 2;
2821 else if (*bp == '/' && bp[1] == '*') {
2822 bp += 2;
2823 while (!(*bp == '*' && bp[1] == '/'))
2824 bp++;
2825 bp += 2;
2826 }
2827 /* There is no point in trying to deal with C++ // comments here,
2828 because if there is one, then this # must be part of the
2829 comment and we would never reach here. */
2830 else break;
2831 }
2832 if (c == '%') {
2833 if (bp[0] != '%')
2834 break;
2835 while (bp[1] == '\\' && bp[2] == '\n')
2836 bp += 2;
2837 if (bp + 1 != ibp)
2838 break;
2839 /* %: appears at start of line; skip past the ':' too. */
2840 bp++;
2841 ibp++;
2842 }
2843 }
2844 if (bp + 1 != ibp)
2845 goto randomchar;
2846 }
2847
2848 /* This # can start a directive. */
2849
2850 --obp; /* Don't copy the '#' */
2851
2852 ip->bufp = ibp;
2853 op->bufp = obp;
2854 if (! handle_directive (ip, op)) {
2855 #ifdef USE_C_ALLOCA
2856 alloca (0);
2857 #endif
2858 /* Not a known directive: treat it as ordinary text.
2859 IP, OP, IBP, etc. have not been changed. */
2860 if (no_output && instack[indepth].fname) {
2861 /* If not generating expanded output,
2862 what we do with ordinary text is skip it.
2863 Discard everything until next # directive. */
2864 skip_if_group (&instack[indepth], 1, 0);
2865 RECACHE;
2866 beg_of_line = ibp;
2867 break;
2868 }
2869 *obp++ = '#'; /* Copy # (even if it was originally %:). */
2870 /* Don't expand an identifier that could be a macro directive.
2871 (Section 3.8.3 of the ANSI C standard) */
2872 SKIP_WHITE_SPACE (ibp);
2873 if (is_idstart[*ibp])
2874 {
2875 *obp++ = *ibp++;
2876 while (is_idchar[*ibp])
2877 *obp++ = *ibp++;
2878 }
2879 goto randomchar;
2880 }
2881 #ifdef USE_C_ALLOCA
2882 alloca (0);
2883 #endif
2884 /* A # directive has been successfully processed. */
2885 /* If not generating expanded output, ignore everything until
2886 next # directive. */
2887 if (no_output && instack[indepth].fname)
2888 skip_if_group (&instack[indepth], 1, 0);
2889 obp = op->bufp;
2890 RECACHE;
2891 beg_of_line = ibp;
2892 break;
2893
2894 case '\"': /* skip quoted string */
2895 case '\'':
2896 /* A single quoted string is treated like a double -- some
2897 programs (e.g., troff) are perverse this way */
2898
2899 if (ident_length)
2900 goto specialchar;
2901
2902 start_line = ip->lineno;
2903
2904 /* Skip ahead to a matching quote. */
2905
2906 while (1) {
2907 if (ibp >= limit) {
2908 if (ip->macro != 0) {
2909 /* try harder: this string crosses a macro expansion boundary.
2910 This can happen naturally if -traditional.
2911 Otherwise, only -D can make a macro with an unmatched quote. */
2912 POPMACRO;
2913 RECACHE;
2914 continue;
2915 }
2916 if (!traditional) {
2917 error_with_line (line_for_error (start_line),
2918 "unterminated string or character constant");
2919 error_with_line (multiline_string_line,
2920 "possible real start of unterminated constant");
2921 multiline_string_line = 0;
2922 }
2923 break;
2924 }
2925 *obp++ = *ibp;
2926 switch (*ibp++) {
2927 case '\n':
2928 ++ip->lineno;
2929 ++op->lineno;
2930 /* Traditionally, end of line ends a string constant with no error.
2931 So exit the loop and record the new line. */
2932 if (traditional) {
2933 beg_of_line = ibp;
2934 goto while2end;
2935 }
2936 if (c == '\'') {
2937 error_with_line (line_for_error (start_line),
2938 "unterminated character constant");
2939 goto while2end;
2940 }
2941 if (pedantic && multiline_string_line == 0) {
2942 pedwarn_with_line (line_for_error (start_line),
2943 "string constant runs past end of line");
2944 }
2945 if (multiline_string_line == 0)
2946 multiline_string_line = ip->lineno - 1;
2947 break;
2948
2949 case '\\':
2950 if (ibp >= limit)
2951 break;
2952 if (*ibp == '\n') {
2953 /* Backslash newline is replaced by nothing at all,
2954 but keep the line counts correct. */
2955 --obp;
2956 ++ibp;
2957 ++ip->lineno;
2958 } else {
2959 /* ANSI stupidly requires that in \\ the second \
2960 is *not* prevented from combining with a newline. */
2961 while (*ibp == '\\' && ibp[1] == '\n') {
2962 ibp += 2;
2963 ++ip->lineno;
2964 }
2965 *obp++ = *ibp++;
2966 }
2967 break;
2968
2969 case '\"':
2970 case '\'':
2971 if (ibp[-1] == c)
2972 goto while2end;
2973 break;
2974 }
2975 }
2976 while2end:
2977 break;
2978
2979 case '/':
2980 if (*ibp == '\\' && ibp[1] == '\n')
2981 newline_fix (ibp);
2982
2983 if (*ibp != '*'
2984 && !(cplusplus_comments && *ibp == '/'))
2985 goto randomchar;
2986 if (ip->macro != 0)
2987 goto randomchar;
2988 if (ident_length)
2989 goto specialchar;
2990
2991 if (*ibp == '/') {
2992 /* C++ style comment... */
2993 start_line = ip->lineno;
2994
2995 /* Comments are equivalent to spaces. */
2996 if (! put_out_comments)
2997 obp[-1] = ' ';
2998
2999 {
3000 U_CHAR *before_bp = ibp;
3001
3002 while (++ibp < limit) {
3003 if (*ibp == '\n') {
3004 if (ibp[-1] != '\\') {
3005 if (put_out_comments) {
3006 bcopy ((char *) before_bp, (char *) obp, ibp - before_bp);
3007 obp += ibp - before_bp;
3008 }
3009 break;
3010 }
3011 ++ip->lineno;
3012 /* Copy the newline into the output buffer, in order to
3013 avoid the pain of a #line every time a multiline comment
3014 is seen. */
3015 if (!put_out_comments)
3016 *obp++ = '\n';
3017 ++op->lineno;
3018 }
3019 }
3020 break;
3021 }
3022 }
3023
3024 /* Ordinary C comment. Skip it, optionally copying it to output. */
3025
3026 start_line = ip->lineno;
3027
3028 ++ibp; /* Skip the star. */
3029
3030 /* If this cpp is for lint, we peek inside the comments: */
3031 if (for_lint) {
3032 U_CHAR *argbp;
3033 int cmdlen, arglen;
3034 char *lintcmd = get_lintcmd (ibp, limit, &argbp, &arglen, &cmdlen);
3035
3036 if (lintcmd != NULL) {
3037 op->bufp = obp;
3038 check_expand (op, cmdlen + arglen + 14);
3039 obp = op->bufp;
3040 /* I believe it is always safe to emit this newline: */
3041 obp[-1] = '\n';
3042 bcopy ("#pragma lint ", (char *) obp, 13);
3043 obp += 13;
3044 bcopy (lintcmd, (char *) obp, cmdlen);
3045 obp += cmdlen;
3046
3047 if (arglen != 0) {
3048 *(obp++) = ' ';
3049 bcopy (argbp, (char *) obp, arglen);
3050 obp += arglen;
3051 }
3052
3053 /* OK, now bring us back to the state we were in before we entered
3054 this branch. We need #line because the #pragma's newline always
3055 messes up the line count. */
3056 op->bufp = obp;
3057 output_line_directive (ip, op, 0, same_file);
3058 check_expand (op, limit - ibp + 2);
3059 obp = op->bufp;
3060 *(obp++) = '/';
3061 }
3062 }
3063
3064 /* Comments are equivalent to spaces.
3065 Note that we already output the slash; we might not want it.
3066 For -traditional, a comment is equivalent to nothing. */
3067 if (! put_out_comments) {
3068 if (traditional)
3069 obp--;
3070 else
3071 obp[-1] = ' ';
3072 }
3073 else
3074 *obp++ = '*';
3075
3076 {
3077 U_CHAR *before_bp = ibp;
3078
3079 while (ibp < limit) {
3080 switch (*ibp++) {
3081 case '/':
3082 if (warn_comments && *ibp == '*')
3083 warning ("`/*' within comment");
3084 break;
3085 case '*':
3086 if (*ibp == '\\' && ibp[1] == '\n')
3087 newline_fix (ibp);
3088 if (ibp >= limit || *ibp == '/')
3089 goto comment_end;
3090 break;
3091 case '\n':
3092 ++ip->lineno;
3093 /* Copy the newline into the output buffer, in order to
3094 avoid the pain of a #line every time a multiline comment
3095 is seen. */
3096 if (!put_out_comments)
3097 *obp++ = '\n';
3098 ++op->lineno;
3099 }
3100 }
3101 comment_end:
3102
3103 if (ibp >= limit)
3104 error_with_line (line_for_error (start_line),
3105 "unterminated comment");
3106 else {
3107 ibp++;
3108 if (put_out_comments) {
3109 bcopy ((char *) before_bp, (char *) obp, ibp - before_bp);
3110 obp += ibp - before_bp;
3111 }
3112 }
3113 }
3114 break;
3115
3116 case '$':
3117 if (!dollars_in_ident)
3118 goto randomchar;
3119 goto letter;
3120
3121 case '0': case '1': case '2': case '3': case '4':
3122 case '5': case '6': case '7': case '8': case '9':
3123 /* If digit is not part of identifier, it starts a number,
3124 which means that following letters are not an identifier.
3125 "0x5" does not refer to an identifier "x5".
3126 So copy all alphanumerics that follow without accumulating
3127 as an identifier. Periods also, for sake of "3.e7". */
3128
3129 if (ident_length == 0) {
3130 for (;;) {
3131 while (ibp[0] == '\\' && ibp[1] == '\n') {
3132 ++ip->lineno;
3133 ibp += 2;
3134 }
3135 c = *ibp++;
3136 if (!is_idchar[c] && c != '.') {
3137 --ibp;
3138 break;
3139 }
3140 *obp++ = c;
3141 /* A sign can be part of a preprocessing number
3142 if it follows an e. */
3143 if (c == 'e' || c == 'E') {
3144 while (ibp[0] == '\\' && ibp[1] == '\n') {
3145 ++ip->lineno;
3146 ibp += 2;
3147 }
3148 if (*ibp == '+' || *ibp == '-') {
3149 *obp++ = *ibp++;
3150 /* But traditional C does not let the token go past the sign. */
3151 if (traditional)
3152 break;
3153 }
3154 }
3155 }
3156 break;
3157 }
3158 /* fall through */
3159
3160 case '_':
3161 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
3162 case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
3163 case 'm': case 'n': case 'o': case 'p': case 'q': case 'r':
3164 case 's': case 't': case 'u': case 'v': case 'w': case 'x':
3165 case 'y': case 'z':
3166 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
3167 case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
3168 case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
3169 case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
3170 case 'Y': case 'Z':
3171 letter:
3172 ident_length++;
3173 /* Compute step of hash function, to avoid a proc call on every token */
3174 hash = HASHSTEP (hash, c);
3175 break;
3176
3177 case '\n':
3178 if (ip->fname == 0 && *ibp == '-') {
3179 /* Newline - inhibits expansion of preceding token.
3180 If expanding a macro arg, we keep the newline -.
3181 In final output, it is deleted.
3182 We recognize Newline - in macro bodies and macro args. */
3183 if (! concatenated) {
3184 ident_length = 0;
3185 hash = 0;
3186 }
3187 ibp++;
3188 if (!output_marks) {
3189 obp--;
3190 } else {
3191 /* If expanding a macro arg, keep the newline -. */
3192 *obp++ = '-';
3193 }
3194 break;
3195 }
3196
3197 /* If reprocessing a macro expansion, newline is a special marker. */
3198 else if (ip->macro != 0) {
3199 /* Newline White is a "funny space" to separate tokens that are
3200 supposed to be separate but without space between.
3201 Here White means any whitespace character.
3202 Newline - marks a recursive macro use that is not
3203 supposed to be expandable. */
3204
3205 if (is_space[*ibp]) {
3206 /* Newline Space does not prevent expansion of preceding token
3207 so expand the preceding token and then come back. */
3208 if (ident_length > 0)
3209 goto specialchar;
3210
3211 /* If generating final output, newline space makes a space. */
3212 if (!output_marks) {
3213 obp[-1] = *ibp++;
3214 /* And Newline Newline makes a newline, so count it. */
3215 if (obp[-1] == '\n')
3216 op->lineno++;
3217 } else {
3218 /* If expanding a macro arg, keep the newline space.
3219 If the arg gets stringified, newline space makes nothing. */
3220 *obp++ = *ibp++;
3221 }
3222 } else abort (); /* Newline followed by something random? */
3223 break;
3224 }
3225
3226 /* If there is a pending identifier, handle it and come back here. */
3227 if (ident_length > 0)
3228 goto specialchar;
3229
3230 beg_of_line = ibp;
3231
3232 /* Update the line counts and output a #line if necessary. */
3233 ++ip->lineno;
3234 ++op->lineno;
3235 if (ip->lineno != op->lineno) {
3236 op->bufp = obp;
3237 output_line_directive (ip, op, 1, same_file);
3238 check_expand (op, limit - ibp);
3239 obp = op->bufp;
3240 }
3241 break;
3242
3243 /* Come here either after (1) a null character that is part of the input
3244 or (2) at the end of the input, because there is a null there. */
3245 case 0:
3246 if (ibp <= limit)
3247 /* Our input really contains a null character. */
3248 goto randomchar;
3249
3250 /* At end of a macro-expansion level, pop it and read next level. */
3251 if (ip->macro != 0) {
3252 obp--;
3253 ibp--;
3254 /* If traditional, and we have an identifier that ends here,
3255 process it now, so we get the right error for recursion. */
3256 if (traditional && ident_length
3257 && ! is_idchar[*instack[indepth - 1].bufp]) {
3258 redo_char = 1;
3259 goto randomchar;
3260 }
3261 POPMACRO;
3262 RECACHE;
3263 break;
3264 }
3265
3266 /* If we don't have a pending identifier,
3267 return at end of input. */
3268 if (ident_length == 0) {
3269 obp--;
3270 ibp--;
3271 op->bufp = obp;
3272 ip->bufp = ibp;
3273 goto ending;
3274 }
3275
3276 /* If we do have a pending identifier, just consider this null
3277 a special character and arrange to dispatch on it again.
3278 The second time, IDENT_LENGTH will be zero so we will return. */
3279
3280 /* Fall through */
3281
3282 specialchar:
3283
3284 /* Handle the case of a character such as /, ', " or null
3285 seen following an identifier. Back over it so that
3286 after the identifier is processed the special char
3287 will be dispatched on again. */
3288
3289 ibp--;
3290 obp--;
3291 redo_char = 1;
3292
3293 default:
3294
3295 randomchar:
3296
3297 if (ident_length > 0) {
3298 register HASHNODE *hp;
3299
3300 /* We have just seen an identifier end. If it's a macro, expand it.
3301
3302 IDENT_LENGTH is the length of the identifier
3303 and HASH is its hash code.
3304
3305 The identifier has already been copied to the output,
3306 so if it is a macro we must remove it.
3307
3308 If REDO_CHAR is 0, the char that terminated the identifier
3309 has been skipped in the output and the input.
3310 OBP-IDENT_LENGTH-1 points to the identifier.
3311 If the identifier is a macro, we must back over the terminator.
3312
3313 If REDO_CHAR is 1, the terminating char has already been
3314 backed over. OBP-IDENT_LENGTH points to the identifier. */
3315
3316 if (!pcp_outfile || pcp_inside_if) {
3317 for (hp = hashtab[MAKE_POS (hash) % HASHSIZE]; hp != NULL;
3318 hp = hp->next) {
3319
3320 if (hp->length == ident_length) {
3321 int obufp_before_macroname;
3322 int op_lineno_before_macroname;
3323 register int i = ident_length;
3324 register U_CHAR *p = hp->name;
3325 register U_CHAR *q = obp - i;
3326 int disabled;
3327
3328 if (! redo_char)
3329 q--;
3330
3331 do { /* All this to avoid a strncmp () */
3332 if (*p++ != *q++)
3333 goto hashcollision;
3334 } while (--i);
3335
3336 /* We found a use of a macro name.
3337 see if the context shows it is a macro call. */
3338
3339 /* Back up over terminating character if not already done. */
3340 if (! redo_char) {
3341 ibp--;
3342 obp--;
3343 }
3344
3345 /* Save this as a displacement from the beginning of the output
3346 buffer. We can not save this as a position in the output
3347 buffer, because it may get realloc'ed by RECACHE. */
3348 obufp_before_macroname = (obp - op->buf) - ident_length;
3349 op_lineno_before_macroname = op->lineno;
3350
3351 if (hp->type == T_PCSTRING) {
3352 pcstring_used (hp); /* Mark the definition of this key
3353 as needed, ensuring that it
3354 will be output. */
3355 break; /* Exit loop, since the key cannot have a
3356 definition any longer. */
3357 }
3358
3359 /* Record whether the macro is disabled. */
3360 disabled = hp->type == T_DISABLED;
3361
3362 /* This looks like a macro ref, but if the macro was disabled,
3363 just copy its name and put in a marker if requested. */
3364
3365 if (disabled) {
3366 #if 0
3367 /* This error check caught useful cases such as
3368 #define foo(x,y) bar (x (y,0), y)
3369 foo (foo, baz) */
3370 if (traditional)
3371 error ("recursive use of macro `%s'", hp->name);
3372 #endif
3373
3374 if (output_marks) {
3375 check_expand (op, limit - ibp + 2);
3376 *obp++ = '\n';
3377 *obp++ = '-';
3378 }
3379 break;
3380 }
3381
3382 /* If macro wants an arglist, verify that a '(' follows.
3383 first skip all whitespace, copying it to the output
3384 after the macro name. Then, if there is no '(',
3385 decide this is not a macro call and leave things that way. */
3386 if ((hp->type == T_MACRO || hp->type == T_DISABLED)
3387 && hp->value.defn->nargs >= 0)
3388 {
3389 U_CHAR *old_ibp = ibp;
3390 U_CHAR *old_obp = obp;
3391 int old_iln = ip->lineno;
3392 int old_oln = op->lineno;
3393
3394 while (1) {
3395 /* Scan forward over whitespace, copying it to the output. */
3396 if (ibp == limit && ip->macro != 0) {
3397 POPMACRO;
3398 RECACHE;
3399 old_ibp = ibp;
3400 old_obp = obp;
3401 old_iln = ip->lineno;
3402 old_oln = op->lineno;
3403 }
3404 /* A comment: copy it unchanged or discard it. */
3405 else if (*ibp == '/' && ibp[1] == '*') {
3406 if (put_out_comments) {
3407 *obp++ = '/';
3408 *obp++ = '*';
3409 } else if (! traditional) {
3410 *obp++ = ' ';
3411 }
3412 ibp += 2;
3413 while (ibp + 1 != limit
3414 && !(ibp[0] == '*' && ibp[1] == '/')) {
3415 /* We need not worry about newline-marks,
3416 since they are never found in comments. */
3417 if (*ibp == '\n') {
3418 /* Newline in a file. Count it. */
3419 ++ip->lineno;
3420 ++op->lineno;
3421 }
3422 if (put_out_comments)
3423 *obp++ = *ibp++;
3424 else
3425 ibp++;
3426 }
3427 ibp += 2;
3428 if (put_out_comments) {
3429 *obp++ = '*';
3430 *obp++ = '/';
3431 }
3432 }
3433 else if (is_space[*ibp]) {
3434 *obp++ = *ibp++;
3435 if (ibp[-1] == '\n') {
3436 if (ip->macro == 0) {
3437 /* Newline in a file. Count it. */
3438 ++ip->lineno;
3439 ++op->lineno;
3440 } else if (!output_marks) {
3441 /* A newline mark, and we don't want marks
3442 in the output. If it is newline-hyphen,
3443 discard it entirely. Otherwise, it is
3444 newline-whitechar, so keep the whitechar. */
3445 obp--;
3446 if (*ibp == '-')
3447 ibp++;
3448 else {
3449 if (*ibp == '\n')
3450 ++op->lineno;
3451 *obp++ = *ibp++;
3452 }
3453 } else {
3454 /* A newline mark; copy both chars to the output. */
3455 *obp++ = *ibp++;
3456 }
3457 }
3458 }
3459 else break;
3460 }
3461 if (*ibp != '(') {
3462 /* It isn't a macro call.
3463 Put back the space that we just skipped. */
3464 ibp = old_ibp;
3465 obp = old_obp;
3466 ip->lineno = old_iln;
3467 op->lineno = old_oln;
3468 /* Exit the for loop. */
3469 break;
3470 }
3471 }
3472
3473 /* This is now known to be a macro call.
3474 Discard the macro name from the output,
3475 along with any following whitespace just copied,
3476 but preserve newlines if not outputting marks since this
3477 is more likely to do the right thing with line numbers. */
3478 obp = op->buf + obufp_before_macroname;
3479 if (output_marks)
3480 op->lineno = op_lineno_before_macroname;
3481 else {
3482 int newlines = op->lineno - op_lineno_before_macroname;
3483 while (0 < newlines--)
3484 *obp++ = '\n';
3485 }
3486
3487 /* Prevent accidental token-pasting with a character
3488 before the macro call. */
3489 if (!traditional && obp != op->buf) {
3490 switch (obp[-1]) {
3491 case '!': case '%': case '&': case '*':
3492 case '+': case '-': case '/': case ':':
3493 case '<': case '=': case '>': case '^':
3494 case '|':
3495 /* If we are expanding a macro arg, make a newline marker
3496 to separate the tokens. If we are making real output,
3497 a plain space will do. */
3498 if (output_marks)
3499 *obp++ = '\n';
3500 *obp++ = ' ';
3501 }
3502 }
3503
3504 /* Expand the macro, reading arguments as needed,
3505 and push the expansion on the input stack. */
3506 ip->bufp = ibp;
3507 op->bufp = obp;
3508 macroexpand (hp, op);
3509
3510 /* Reexamine input stack, since macroexpand has pushed
3511 a new level on it. */
3512 obp = op->bufp;
3513 RECACHE;
3514 break;
3515 }
3516 hashcollision:
3517 ;
3518 } /* End hash-table-search loop */
3519 }
3520 ident_length = hash = 0; /* Stop collecting identifier */
3521 redo_char = 0;
3522 concatenated = 0;
3523 } /* End if (ident_length > 0) */
3524 } /* End switch */
3525 } /* End per-char loop */
3526
3527 /* Come here to return -- but first give an error message
3528 if there was an unterminated successful conditional. */
3529 ending:
3530 if (if_stack != ip->if_stack)
3531 {
3532 char *str;
3533
3534 switch (if_stack->type)
3535 {
3536 case T_IF:
3537 str = "if";
3538 break;
3539 case T_IFDEF:
3540 str = "ifdef";
3541 break;
3542 case T_IFNDEF:
3543 str = "ifndef";
3544 break;
3545 case T_ELSE:
3546 str = "else";
3547 break;
3548 case T_ELIF:
3549 str = "elif";
3550 break;
3551 default:
3552 abort ();
3553 }
3554
3555 error_with_line (line_for_error (if_stack->lineno),
3556 "unterminated `#%s' conditional", str);
3557 }
3558 if_stack = ip->if_stack;
3559 }
3560 \f
3561 /*
3562 * Rescan a string into a temporary buffer and return the result
3563 * as a FILE_BUF. Note this function returns a struct, not a pointer.
3564 *
3565 * OUTPUT_MARKS nonzero means keep Newline markers found in the input
3566 * and insert such markers when appropriate. See `rescan' for details.
3567 * OUTPUT_MARKS is 1 for macroexpanding a macro argument separately
3568 * before substitution; it is 0 for other uses.
3569 */
3570 static FILE_BUF
3571 expand_to_temp_buffer (buf, limit, output_marks, assertions)
3572 U_CHAR *buf, *limit;
3573 int output_marks, assertions;
3574 {
3575 register FILE_BUF *ip;
3576 FILE_BUF obuf;
3577 int length = limit - buf;
3578 U_CHAR *buf1;
3579 int odepth = indepth;
3580 int save_assertions_flag = assertions_flag;
3581
3582 assertions_flag = assertions;
3583
3584 if (length < 0)
3585 abort ();
3586
3587 /* Set up the input on the input stack. */
3588
3589 buf1 = (U_CHAR *) alloca (length + 1);
3590 {
3591 register U_CHAR *p1 = buf;
3592 register U_CHAR *p2 = buf1;
3593
3594 while (p1 != limit)
3595 *p2++ = *p1++;
3596 }
3597 buf1[length] = 0;
3598
3599 /* Set up to receive the output. */
3600
3601 obuf.length = length * 2 + 100; /* Usually enough. Why be stingy? */
3602 obuf.bufp = obuf.buf = (U_CHAR *) xmalloc (obuf.length);
3603 obuf.fname = 0;
3604 obuf.macro = 0;
3605 obuf.free_ptr = 0;
3606
3607 CHECK_DEPTH ({return obuf;});
3608
3609 ++indepth;
3610
3611 ip = &instack[indepth];
3612 ip->fname = 0;
3613 ip->nominal_fname = 0;
3614 ip->system_header_p = 0;
3615 ip->macro = 0;
3616 ip->free_ptr = 0;
3617 ip->length = length;
3618 ip->buf = ip->bufp = buf1;
3619 ip->if_stack = if_stack;
3620
3621 ip->lineno = obuf.lineno = 1;
3622
3623 /* Scan the input, create the output. */
3624 rescan (&obuf, output_marks);
3625
3626 /* Pop input stack to original state. */
3627 --indepth;
3628
3629 if (indepth != odepth)
3630 abort ();
3631
3632 /* Record the output. */
3633 obuf.length = obuf.bufp - obuf.buf;
3634
3635 assertions_flag = save_assertions_flag;
3636 return obuf;
3637 }
3638 \f
3639 /*
3640 * Process a # directive. Expects IP->bufp to point after the '#', as in
3641 * `#define foo bar'. Passes to the directive handler
3642 * (do_define, do_include, etc.): the addresses of the 1st and
3643 * last chars of the directive (starting immediately after the #
3644 * keyword), plus op and the keyword table pointer. If the directive
3645 * contains comments it is copied into a temporary buffer sans comments
3646 * and the temporary buffer is passed to the directive handler instead.
3647 * Likewise for backslash-newlines.
3648 *
3649 * Returns nonzero if this was a known # directive.
3650 * Otherwise, returns zero, without advancing the input pointer.
3651 */
3652
3653 static int
3654 handle_directive (ip, op)
3655 FILE_BUF *ip, *op;
3656 {
3657 register U_CHAR *bp, *cp;
3658 register struct directive *kt;
3659 register int ident_length;
3660 U_CHAR *resume_p;
3661
3662 /* Nonzero means we must copy the entire directive
3663 to get rid of comments or backslash-newlines. */
3664 int copy_directive = 0;
3665
3666 U_CHAR *ident, *after_ident;
3667
3668 bp = ip->bufp;
3669
3670 /* Record where the directive started. do_xifdef needs this. */
3671 directive_start = bp - 1;
3672
3673 /* Skip whitespace and \-newline. */
3674 while (1) {
3675 if (is_hor_space[*bp]) {
3676 if (*bp != ' ' && *bp != '\t' && pedantic)
3677 pedwarn ("%s in preprocessing directive", char_name[*bp]);
3678 bp++;
3679 } else if (*bp == '/' && (bp[1] == '*'
3680 || (cplusplus_comments && bp[1] == '/'))) {
3681 ip->bufp = bp + 2;
3682 skip_to_end_of_comment (ip, &ip->lineno, 0);
3683 bp = ip->bufp;
3684 } else if (*bp == '\\' && bp[1] == '\n') {
3685 bp += 2; ip->lineno++;
3686 } else break;
3687 }
3688
3689 /* Now find end of directive name.
3690 If we encounter a backslash-newline, exchange it with any following
3691 symbol-constituents so that we end up with a contiguous name. */
3692
3693 cp = bp;
3694 while (1) {
3695 if (is_idchar[*cp])
3696 cp++;
3697 else {
3698 if (*cp == '\\' && cp[1] == '\n')
3699 name_newline_fix (cp);
3700 if (is_idchar[*cp])
3701 cp++;
3702 else break;
3703 }
3704 }
3705 ident_length = cp - bp;
3706 ident = bp;
3707 after_ident = cp;
3708
3709 /* A line of just `#' becomes blank. */
3710
3711 if (ident_length == 0 && *after_ident == '\n') {
3712 ip->bufp = after_ident;
3713 return 1;
3714 }
3715
3716 if (ident_length == 0 || !is_idstart[*ident]) {
3717 U_CHAR *p = ident;
3718 while (is_idchar[*p]) {
3719 if (*p < '0' || *p > '9')
3720 break;
3721 p++;
3722 }
3723 /* Handle # followed by a line number. */
3724 if (p != ident && !is_idchar[*p]) {
3725 static struct directive line_directive_table[] = {
3726 { 4, do_line, "line", T_LINE},
3727 };
3728 if (pedantic)
3729 pedwarn ("`#' followed by integer");
3730 after_ident = ident;
3731 kt = line_directive_table;
3732 goto old_linenum;
3733 }
3734
3735 /* Avoid error for `###' and similar cases unless -pedantic. */
3736 if (p == ident) {
3737 while (*p == '#' || is_hor_space[*p]) p++;
3738 if (*p == '\n') {
3739 if (pedantic && !lang_asm)
3740 warning ("invalid preprocessing directive");
3741 return 0;
3742 }
3743 }
3744
3745 if (!lang_asm)
3746 error ("invalid preprocessing directive name");
3747
3748 return 0;
3749 }
3750
3751 /*
3752 * Decode the keyword and call the appropriate expansion
3753 * routine, after moving the input pointer up to the next line.
3754 */
3755 for (kt = directive_table; kt->length > 0; kt++) {
3756 if (kt->length == ident_length && !bcmp (kt->name, ident, ident_length)) {
3757 register U_CHAR *buf;
3758 register U_CHAR *limit;
3759 int unterminated;
3760 int junk;
3761 int *already_output;
3762
3763 /* Nonzero means do not delete comments within the directive.
3764 #define needs this when -traditional. */
3765 int keep_comments;
3766
3767 old_linenum:
3768
3769 limit = ip->buf + ip->length;
3770 unterminated = 0;
3771 already_output = 0;
3772 keep_comments = traditional && kt->traditional_comments;
3773 /* #import is defined only in Objective C, or when on the NeXT. */
3774 if (kt->type == T_IMPORT
3775 && !(objc || lookup ((U_CHAR *) "__NeXT__", -1, -1)))
3776 break;
3777
3778 /* Find the end of this directive (first newline not backslashed
3779 and not in a string or comment).
3780 Set COPY_DIRECTIVE if the directive must be copied
3781 (it contains a backslash-newline or a comment). */
3782
3783 buf = bp = after_ident;
3784 while (bp < limit) {
3785 register U_CHAR c = *bp++;
3786 switch (c) {
3787 case '\\':
3788 if (bp < limit) {
3789 if (*bp == '\n') {
3790 ip->lineno++;
3791 copy_directive = 1;
3792 bp++;
3793 } else if (traditional)
3794 bp++;
3795 }
3796 break;
3797
3798 case '\'':
3799 case '\"':
3800 bp = skip_quoted_string (bp - 1, limit, ip->lineno, &ip->lineno, &copy_directive, &unterminated);
3801 /* Don't bother calling the directive if we already got an error
3802 message due to unterminated string. Skip everything and pretend
3803 we called the directive. */
3804 if (unterminated) {
3805 if (traditional) {
3806 /* Traditional preprocessing permits unterminated strings. */
3807 ip->bufp = bp;
3808 goto endloop1;
3809 }
3810 ip->bufp = bp;
3811 return 1;
3812 }
3813 break;
3814
3815 /* <...> is special for #include. */
3816 case '<':
3817 if (!kt->angle_brackets)
3818 break;
3819 while (bp < limit && *bp != '>' && *bp != '\n') {
3820 if (*bp == '\\' && bp[1] == '\n') {
3821 ip->lineno++;
3822 copy_directive = 1;
3823 bp++;
3824 }
3825 bp++;
3826 }
3827 break;
3828
3829 case '/':
3830 if (*bp == '\\' && bp[1] == '\n')
3831 newline_fix (bp);
3832 if (*bp == '*'
3833 || (cplusplus_comments && *bp == '/')) {
3834 U_CHAR *obp = bp - 1;
3835 ip->bufp = bp + 1;
3836 skip_to_end_of_comment (ip, &ip->lineno, 0);
3837 bp = ip->bufp;
3838 /* No need to copy the directive because of a comment at the end;
3839 just don't include the comment in the directive. */
3840 if (bp == limit || *bp == '\n') {
3841 bp = obp;
3842 goto endloop1;
3843 }
3844 /* Don't remove the comments if -traditional. */
3845 if (! keep_comments)
3846 copy_directive++;
3847 }
3848 break;
3849
3850 case '\f':
3851 case '\r':
3852 case '\v':
3853 if (pedantic)
3854 pedwarn ("%s in preprocessing directive", char_name[c]);
3855 break;
3856
3857 case '\n':
3858 --bp; /* Point to the newline */
3859 ip->bufp = bp;
3860 goto endloop1;
3861 }
3862 }
3863 ip->bufp = bp;
3864
3865 endloop1:
3866 resume_p = ip->bufp;
3867 /* BP is the end of the directive.
3868 RESUME_P is the next interesting data after the directive.
3869 A comment may come between. */
3870
3871 /* If a directive should be copied through, and -E was given,
3872 pass it through before removing comments. */
3873 if (!no_output && kt->pass_thru && put_out_comments) {
3874 int len;
3875
3876 /* Output directive name. */
3877 check_expand (op, kt->length + 2);
3878 /* Make sure # is at the start of a line */
3879 if (op->bufp > op->buf && op->bufp[-1] != '\n') {
3880 op->lineno++;
3881 *op->bufp++ = '\n';
3882 }
3883 *op->bufp++ = '#';
3884 bcopy (kt->name, op->bufp, kt->length);
3885 op->bufp += kt->length;
3886
3887 /* Output arguments. */
3888 len = (bp - buf);
3889 check_expand (op, len);
3890 bcopy (buf, (char *) op->bufp, len);
3891 op->bufp += len;
3892 /* Take account of any (escaped) newlines just output. */
3893 while (--len >= 0)
3894 if (buf[len] == '\n')
3895 op->lineno++;
3896
3897 already_output = &junk;
3898 } /* Don't we need a newline or #line? */
3899
3900 if (copy_directive) {
3901 register U_CHAR *xp = buf;
3902 /* Need to copy entire directive into temp buffer before dispatching */
3903
3904 cp = (U_CHAR *) alloca (bp - buf + 5); /* room for directive plus
3905 some slop */
3906 buf = cp;
3907
3908 /* Copy to the new buffer, deleting comments
3909 and backslash-newlines (and whitespace surrounding the latter). */
3910
3911 while (xp < bp) {
3912 register U_CHAR c = *xp++;
3913 *cp++ = c;
3914
3915 switch (c) {
3916 case '\n':
3917 abort (); /* A bare newline should never part of the line. */
3918 break;
3919
3920 /* <...> is special for #include. */
3921 case '<':
3922 if (!kt->angle_brackets)
3923 break;
3924 while (xp < bp && c != '>') {
3925 c = *xp++;
3926 if (c == '\\' && xp < bp && *xp == '\n')
3927 xp++;
3928 else
3929 *cp++ = c;
3930 }
3931 break;
3932
3933 case '\\':
3934 if (*xp == '\n') {
3935 xp++;
3936 cp--;
3937 if (cp != buf && is_space[cp[-1]]) {
3938 while (cp != buf && is_space[cp[-1]]) cp--;
3939 cp++;
3940 SKIP_WHITE_SPACE (xp);
3941 } else if (is_space[*xp]) {
3942 *cp++ = *xp++;
3943 SKIP_WHITE_SPACE (xp);
3944 }
3945 } else if (traditional && xp < bp) {
3946 *cp++ = *xp++;
3947 }
3948 break;
3949
3950 case '\'':
3951 case '\"':
3952 {
3953 register U_CHAR *bp1
3954 = skip_quoted_string (xp - 1, bp, ip->lineno,
3955 NULL_PTR, NULL_PTR, NULL_PTR);
3956 while (xp != bp1)
3957 if (*xp == '\\') {
3958 if (*++xp != '\n')
3959 *cp++ = '\\';
3960 else
3961 xp++;
3962 } else
3963 *cp++ = *xp++;
3964 }
3965 break;
3966
3967 case '/':
3968 if (*xp == '*'
3969 || (cplusplus_comments && *xp == '/')) {
3970 ip->bufp = xp + 1;
3971 /* If we already copied the directive through,
3972 already_output != 0 prevents outputting comment now. */
3973 skip_to_end_of_comment (ip, already_output, 0);
3974 if (keep_comments)
3975 while (xp != ip->bufp)
3976 *cp++ = *xp++;
3977 /* Delete or replace the slash. */
3978 else if (traditional)
3979 cp--;
3980 else
3981 cp[-1] = ' ';
3982 xp = ip->bufp;
3983 }
3984 }
3985 }
3986
3987 /* Null-terminate the copy. */
3988
3989 *cp = 0;
3990 } else
3991 cp = bp;
3992
3993 ip->bufp = resume_p;
3994
3995 /* Some directives should be written out for cc1 to process,
3996 just as if they were not defined. And sometimes we're copying
3997 definitions through. */
3998
3999 if (!no_output && already_output == 0
4000 && (kt->pass_thru
4001 || (kt->type == T_DEFINE
4002 && (dump_macros == dump_names
4003 || dump_macros == dump_definitions)))) {
4004 int len;
4005
4006 /* Output directive name. */
4007 check_expand (op, kt->length + 1);
4008 *op->bufp++ = '#';
4009 bcopy (kt->name, (char *) op->bufp, kt->length);
4010 op->bufp += kt->length;
4011
4012 if (kt->pass_thru || dump_macros == dump_definitions) {
4013 /* Output arguments. */
4014 len = (cp - buf);
4015 check_expand (op, len);
4016 bcopy (buf, (char *) op->bufp, len);
4017 op->bufp += len;
4018 } else if (kt->type == T_DEFINE && dump_macros == dump_names) {
4019 U_CHAR *xp = buf;
4020 U_CHAR *yp;
4021 SKIP_WHITE_SPACE (xp);
4022 yp = xp;
4023 while (is_idchar[*xp]) xp++;
4024 len = (xp - yp);
4025 check_expand (op, len + 1);
4026 *op->bufp++ = ' ';
4027 bcopy (yp, op->bufp, len);
4028 op->bufp += len;
4029 }
4030 } /* Don't we need a newline or #line? */
4031
4032 /* Call the appropriate directive handler. buf now points to
4033 either the appropriate place in the input buffer, or to
4034 the temp buffer if it was necessary to make one. cp
4035 points to the first char after the contents of the (possibly
4036 copied) directive, in either case. */
4037 (*kt->func) (buf, cp, op, kt);
4038 check_expand (op, ip->length - (ip->bufp - ip->buf));
4039
4040 return 1;
4041 }
4042 }
4043
4044 /* It is deliberate that we don't warn about undefined directives.
4045 That is the responsibility of cc1. */
4046 return 0;
4047 }
4048 \f
4049 static struct tm *
4050 timestamp ()
4051 {
4052 static struct tm *timebuf;
4053 if (!timebuf) {
4054 time_t t = time ((time_t *)0);
4055 timebuf = localtime (&t);
4056 }
4057 return timebuf;
4058 }
4059
4060 static char *monthnames[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun",
4061 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec",
4062 };
4063
4064 /*
4065 * expand things like __FILE__. Place the expansion into the output
4066 * buffer *without* rescanning.
4067 */
4068
4069 static void
4070 special_symbol (hp, op)
4071 HASHNODE *hp;
4072 FILE_BUF *op;
4073 {
4074 char *buf;
4075 int i, len;
4076 int true_indepth;
4077 FILE_BUF *ip = NULL;
4078 struct tm *timebuf;
4079
4080 int paren = 0; /* For special `defined' keyword */
4081
4082 if (pcp_outfile && pcp_inside_if
4083 && hp->type != T_SPEC_DEFINED && hp->type != T_CONST)
4084 error ("Predefined macro `%s' used inside `#if' during precompilation",
4085 hp->name);
4086
4087 for (i = indepth; i >= 0; i--)
4088 if (instack[i].fname != NULL) {
4089 ip = &instack[i];
4090 break;
4091 }
4092 if (ip == NULL) {
4093 error ("cccp error: not in any file?!");
4094 return; /* the show must go on */
4095 }
4096
4097 switch (hp->type) {
4098 case T_FILE:
4099 case T_BASE_FILE:
4100 {
4101 char *string;
4102 if (hp->type == T_FILE)
4103 string = ip->nominal_fname;
4104 else
4105 string = instack[0].nominal_fname;
4106
4107 if (string)
4108 {
4109 buf = (char *) alloca (3 + 4 * strlen (string));
4110 quote_string (buf, string);
4111 }
4112 else
4113 buf = "\"\"";
4114
4115 break;
4116 }
4117
4118 case T_INCLUDE_LEVEL:
4119 true_indepth = 0;
4120 for (i = indepth; i >= 0; i--)
4121 if (instack[i].fname != NULL)
4122 true_indepth++;
4123
4124 buf = (char *) alloca (8); /* Eight bytes ought to be more than enough */
4125 sprintf (buf, "%d", true_indepth - 1);
4126 break;
4127
4128 case T_VERSION:
4129 buf = (char *) alloca (3 + strlen (version_string));
4130 sprintf (buf, "\"%s\"", version_string);
4131 break;
4132
4133 #ifndef NO_BUILTIN_SIZE_TYPE
4134 case T_SIZE_TYPE:
4135 buf = SIZE_TYPE;
4136 break;
4137 #endif
4138
4139 #ifndef NO_BUILTIN_PTRDIFF_TYPE
4140 case T_PTRDIFF_TYPE:
4141 buf = PTRDIFF_TYPE;
4142 break;
4143 #endif
4144
4145 case T_WCHAR_TYPE:
4146 buf = wchar_type;
4147 break;
4148
4149 case T_USER_LABEL_PREFIX_TYPE:
4150 buf = USER_LABEL_PREFIX;
4151 break;
4152
4153 case T_REGISTER_PREFIX_TYPE:
4154 buf = REGISTER_PREFIX;
4155 break;
4156
4157 case T_IMMEDIATE_PREFIX_TYPE:
4158 buf = IMMEDIATE_PREFIX;
4159 break;
4160
4161 case T_CONST:
4162 buf = hp->value.cpval;
4163 if (pcp_inside_if && pcp_outfile)
4164 /* Output a precondition for this macro use */
4165 fprintf (pcp_outfile, "#define %s %s\n", hp->name, buf);
4166 break;
4167
4168 case T_SPECLINE:
4169 buf = (char *) alloca (10);
4170 sprintf (buf, "%d", ip->lineno);
4171 break;
4172
4173 case T_DATE:
4174 case T_TIME:
4175 buf = (char *) alloca (20);
4176 timebuf = timestamp ();
4177 if (hp->type == T_DATE)
4178 sprintf (buf, "\"%s %2d %4d\"", monthnames[timebuf->tm_mon],
4179 timebuf->tm_mday, timebuf->tm_year + 1900);
4180 else
4181 sprintf (buf, "\"%02d:%02d:%02d\"", timebuf->tm_hour, timebuf->tm_min,
4182 timebuf->tm_sec);
4183 break;
4184
4185 case T_SPEC_DEFINED:
4186 buf = " 0 "; /* Assume symbol is not defined */
4187 ip = &instack[indepth];
4188 SKIP_WHITE_SPACE (ip->bufp);
4189 if (*ip->bufp == '(') {
4190 paren++;
4191 ip->bufp++; /* Skip over the paren */
4192 SKIP_WHITE_SPACE (ip->bufp);
4193 }
4194
4195 if (!is_idstart[*ip->bufp])
4196 goto oops;
4197 if ((hp = lookup (ip->bufp, -1, -1))) {
4198 if (pcp_outfile && pcp_inside_if
4199 && (hp->type == T_CONST
4200 || (hp->type == T_MACRO && hp->value.defn->predefined)))
4201 /* Output a precondition for this macro use. */
4202 fprintf (pcp_outfile, "#define %s\n", hp->name);
4203 buf = " 1 ";
4204 }
4205 else
4206 if (pcp_outfile && pcp_inside_if) {
4207 /* Output a precondition for this macro use */
4208 U_CHAR *cp = ip->bufp;
4209 fprintf (pcp_outfile, "#undef ");
4210 while (is_idchar[*cp]) /* Ick! */
4211 fputc (*cp++, pcp_outfile);
4212 putc ('\n', pcp_outfile);
4213 }
4214 while (is_idchar[*ip->bufp])
4215 ++ip->bufp;
4216 SKIP_WHITE_SPACE (ip->bufp);
4217 if (paren) {
4218 if (*ip->bufp != ')')
4219 goto oops;
4220 ++ip->bufp;
4221 }
4222 break;
4223
4224 oops:
4225
4226 error ("`defined' without an identifier");
4227 break;
4228
4229 default:
4230 error ("cccp error: invalid special hash type"); /* time for gdb */
4231 abort ();
4232 }
4233 len = strlen (buf);
4234 check_expand (op, len);
4235 bcopy (buf, (char *) op->bufp, len);
4236 op->bufp += len;
4237
4238 return;
4239 }
4240
4241 \f
4242 /* Routines to handle #directives */
4243
4244 /* Handle #include and #import.
4245 This function expects to see "fname" or <fname> on the input. */
4246
4247 static int
4248 do_include (buf, limit, op, keyword)
4249 U_CHAR *buf, *limit;
4250 FILE_BUF *op;
4251 struct directive *keyword;
4252 {
4253 int importing = (keyword->type == T_IMPORT);
4254 int skip_dirs = (keyword->type == T_INCLUDE_NEXT);
4255 static int import_warning = 0;
4256 char *fname; /* Dynamically allocated fname buffer */
4257 char *pcftry;
4258 char *pcfname;
4259 U_CHAR *fbeg, *fend; /* Beginning and end of fname */
4260
4261 struct file_name_list *search_start = include; /* Chain of dirs to search */
4262 struct file_name_list dsp[1]; /* First in chain, if #include "..." */
4263 struct file_name_list *searchptr = 0;
4264 int flen;
4265
4266 int f; /* file number */
4267
4268 int retried = 0; /* Have already tried macro
4269 expanding the include line*/
4270 int angle_brackets = 0; /* 0 for "...", 1 for <...> */
4271 int pcf = -1;
4272 char *pcfbuf;
4273 char *pcfbuflimit;
4274 int pcfnum;
4275 f= -1; /* JF we iz paranoid! */
4276
4277 if (importing && warn_import && !inhibit_warnings
4278 && !instack[indepth].system_header_p && !import_warning) {
4279 import_warning = 1;
4280 warning ("using `#import' is not recommended");
4281 fprintf (stderr, "The fact that a certain header file need not be processed more than once\n");
4282 fprintf (stderr, "should be indicated in the header file, not where it is used.\n");
4283 fprintf (stderr, "The best way to do this is with a conditional of this form:\n\n");
4284 fprintf (stderr, " #ifndef _FOO_H_INCLUDED\n");
4285 fprintf (stderr, " #define _FOO_H_INCLUDED\n");
4286 fprintf (stderr, " ... <real contents of file> ...\n");
4287 fprintf (stderr, " #endif /* Not _FOO_H_INCLUDED */\n\n");
4288 fprintf (stderr, "Then users can use `#include' any number of times.\n");
4289 fprintf (stderr, "GNU C automatically avoids processing the file more than once\n");
4290 fprintf (stderr, "when it is equipped with such a conditional.\n");
4291 }
4292
4293 get_filename:
4294
4295 fbeg = buf;
4296 SKIP_WHITE_SPACE (fbeg);
4297 /* Discard trailing whitespace so we can easily see
4298 if we have parsed all the significant chars we were given. */
4299 while (limit != fbeg && is_hor_space[limit[-1]]) limit--;
4300
4301 switch (*fbeg++) {
4302 case '\"':
4303 {
4304 FILE_BUF *fp;
4305 /* Copy the operand text, concatenating the strings. */
4306 {
4307 U_CHAR *fin = fbeg;
4308 fbeg = (U_CHAR *) alloca (limit - fbeg + 1);
4309 fend = fbeg;
4310 while (fin != limit) {
4311 while (fin != limit && *fin != '\"')
4312 *fend++ = *fin++;
4313 fin++;
4314 if (fin == limit)
4315 break;
4316 /* If not at the end, there had better be another string. */
4317 /* Skip just horiz space, and don't go past limit. */
4318 while (fin != limit && is_hor_space[*fin]) fin++;
4319 if (fin != limit && *fin == '\"')
4320 fin++;
4321 else
4322 goto fail;
4323 }
4324 }
4325 *fend = 0;
4326
4327 /* We have "filename". Figure out directory this source
4328 file is coming from and put it on the front of the list. */
4329
4330 /* If -I- was specified, don't search current dir, only spec'd ones. */
4331 if (ignore_srcdir) break;
4332
4333 for (fp = &instack[indepth]; fp >= instack; fp--)
4334 {
4335 int n;
4336 char *ep,*nam;
4337
4338 if ((nam = fp->nominal_fname) != NULL) {
4339 /* Found a named file. Figure out dir of the file,
4340 and put it in front of the search list. */
4341 dsp[0].next = search_start;
4342 search_start = dsp;
4343 #ifndef VMS
4344 ep = rindex (nam, '/');
4345 #ifdef DIR_SEPARATOR
4346 if (ep == NULL) ep = rindex (nam, DIR_SEPARATOR);
4347 else {
4348 char *tmp = rindex (nam, DIR_SEPARATOR);
4349 if (tmp != NULL && tmp > ep) ep = tmp;
4350 }
4351 #endif
4352 #else /* VMS */
4353 ep = rindex (nam, ']');
4354 if (ep == NULL) ep = rindex (nam, '>');
4355 if (ep == NULL) ep = rindex (nam, ':');
4356 if (ep != NULL) ep++;
4357 #endif /* VMS */
4358 if (ep != NULL) {
4359 n = ep - nam;
4360 dsp[0].fname = (char *) alloca (n + 1);
4361 strncpy (dsp[0].fname, nam, n);
4362 dsp[0].fname[n] = '\0';
4363 if (n + INCLUDE_LEN_FUDGE > max_include_len)
4364 max_include_len = n + INCLUDE_LEN_FUDGE;
4365 } else {
4366 dsp[0].fname = 0; /* Current directory */
4367 }
4368 dsp[0].got_name_map = 0;
4369 break;
4370 }
4371 }
4372 break;
4373 }
4374
4375 case '<':
4376 fend = fbeg;
4377 while (fend != limit && *fend != '>') fend++;
4378 if (*fend == '>' && fend + 1 == limit) {
4379 angle_brackets = 1;
4380 /* If -I-, start with the first -I dir after the -I-. */
4381 if (first_bracket_include)
4382 search_start = first_bracket_include;
4383 break;
4384 }
4385 goto fail;
4386
4387 default:
4388 #ifdef VMS
4389 /*
4390 * Support '#include xyz' like VAX-C to allow for easy use of all the
4391 * decwindow include files. It defaults to '#include <xyz.h>' (so the
4392 * code from case '<' is repeated here) and generates a warning.
4393 * (Note: macro expansion of `xyz' takes precedence.)
4394 */
4395 if (retried && isalpha(*(--fbeg))) {
4396 fend = fbeg;
4397 while (fend != limit && (!isspace(*fend))) fend++;
4398 warning ("VAX-C-style include specification found, use '#include <filename.h>' !");
4399 if (fend == limit) {
4400 angle_brackets = 1;
4401 /* If -I-, start with the first -I dir after the -I-. */
4402 if (first_bracket_include)
4403 search_start = first_bracket_include;
4404 break;
4405 }
4406 }
4407 #endif
4408
4409 fail:
4410 if (retried) {
4411 error ("`#%s' expects \"FILENAME\" or <FILENAME>", keyword->name);
4412 return 0;
4413 } else {
4414 /* Expand buffer and then remove any newline markers.
4415 We can't just tell expand_to_temp_buffer to omit the markers,
4416 since it would put extra spaces in include file names. */
4417 FILE_BUF trybuf;
4418 U_CHAR *src;
4419 trybuf = expand_to_temp_buffer (buf, limit, 1, 0);
4420 src = trybuf.buf;
4421 buf = (U_CHAR *) alloca (trybuf.bufp - trybuf.buf + 1);
4422 limit = buf;
4423 while (src != trybuf.bufp) {
4424 switch ((*limit++ = *src++)) {
4425 case '\n':
4426 limit--;
4427 src++;
4428 break;
4429
4430 case '\'':
4431 case '\"':
4432 {
4433 U_CHAR *src1 = skip_quoted_string (src - 1, trybuf.bufp, 0,
4434 NULL_PTR, NULL_PTR, NULL_PTR);
4435 while (src != src1)
4436 *limit++ = *src++;
4437 }
4438 break;
4439 }
4440 }
4441 *limit = 0;
4442 free (trybuf.buf);
4443 retried++;
4444 goto get_filename;
4445 }
4446 }
4447
4448 /* For #include_next, skip in the search path
4449 past the dir in which the containing file was found. */
4450 if (skip_dirs) {
4451 FILE_BUF *fp;
4452 for (fp = &instack[indepth]; fp >= instack; fp--)
4453 if (fp->fname != NULL) {
4454 /* fp->dir is null if the containing file was specified
4455 with an absolute file name. In that case, don't skip anything. */
4456 if (fp->dir)
4457 search_start = fp->dir->next;
4458 break;
4459 }
4460 }
4461
4462 flen = fend - fbeg;
4463
4464 if (flen == 0)
4465 {
4466 error ("empty file name in `#%s'", keyword->name);
4467 return 0;
4468 }
4469
4470 /* Allocate this permanently, because it gets stored in the definitions
4471 of macros. */
4472 fname = xmalloc (max_include_len + flen + 4);
4473 /* + 2 above for slash and terminating null. */
4474 /* + 2 added for '.h' on VMS (to support '#include filename') */
4475
4476 /* If specified file name is absolute, just open it. */
4477
4478 if (*fbeg == '/'
4479 #ifdef DIR_SEPARATOR
4480 || *fbeg == DIR_SEPARATOR
4481 #endif
4482 ) {
4483 strncpy (fname, (char *) fbeg, flen);
4484 fname[flen] = 0;
4485 if (redundant_include_p (fname))
4486 return 0;
4487 if (importing)
4488 f = lookup_import (fname, NULL_PTR);
4489 else
4490 f = open_include_file (fname, NULL_PTR);
4491 if (f == -2)
4492 return 0; /* Already included this file */
4493 } else {
4494 /* Search directory path, trying to open the file.
4495 Copy each filename tried into FNAME. */
4496
4497 for (searchptr = search_start; searchptr; searchptr = searchptr->next) {
4498 if (searchptr->fname) {
4499 /* The empty string in a search path is ignored.
4500 This makes it possible to turn off entirely
4501 a standard piece of the list. */
4502 if (searchptr->fname[0] == 0)
4503 continue;
4504 strcpy (fname, searchptr->fname);
4505 strcat (fname, "/");
4506 fname[strlen (fname) + flen] = 0;
4507 } else {
4508 fname[0] = 0;
4509 }
4510 strncat (fname, (char *) fbeg, flen);
4511 #ifdef VMS
4512 /* Change this 1/2 Unix 1/2 VMS file specification into a
4513 full VMS file specification */
4514 if (searchptr->fname && (searchptr->fname[0] != 0)) {
4515 /* Fix up the filename */
4516 hack_vms_include_specification (fname);
4517 } else {
4518 /* This is a normal VMS filespec, so use it unchanged. */
4519 strncpy (fname, fbeg, flen);
4520 fname[flen] = 0;
4521 /* if it's '#include filename', add the missing .h */
4522 if (index(fname,'.')==NULL) {
4523 strcat (fname, ".h");
4524 }
4525 }
4526 #endif /* VMS */
4527 /* ??? There are currently 3 separate mechanisms for avoiding processing
4528 of redundant include files: #import, #pragma once, and
4529 redundant_include_p. It would be nice if they were unified. */
4530 if (redundant_include_p (fname))
4531 return 0;
4532 if (importing)
4533 f = lookup_import (fname, searchptr);
4534 else
4535 f = open_include_file (fname, searchptr);
4536 if (f == -2)
4537 return 0; /* Already included this file */
4538 #ifdef EACCES
4539 else if (f == -1 && errno == EACCES)
4540 warning ("Header file %s exists, but is not readable", fname);
4541 #endif
4542 if (f >= 0)
4543 break;
4544 }
4545 }
4546
4547 if (f < 0) {
4548 /* A file that was not found. */
4549
4550 strncpy (fname, (char *) fbeg, flen);
4551 fname[flen] = 0;
4552 /* If generating dependencies and -MG was specified, we assume missing
4553 files are leaf files, living in the same directory as the source file
4554 or other similar place; these missing files may be generated from
4555 other files and may not exist yet (eg: y.tab.h). */
4556 if (print_deps_missing_files
4557 && print_deps > (angle_brackets || (system_include_depth > 0)))
4558 {
4559 /* If it was requested as a system header file,
4560 then assume it belongs in the first place to look for such. */
4561 if (angle_brackets)
4562 {
4563 for (searchptr = search_start; searchptr; searchptr = searchptr->next)
4564 {
4565 if (searchptr->fname)
4566 {
4567 char *p;
4568
4569 if (searchptr->fname[0] == 0)
4570 continue;
4571 p = (char *) alloca (strlen (searchptr->fname)
4572 + strlen (fname) + 2);
4573 strcpy (p, searchptr->fname);
4574 strcat (p, "/");
4575 strcat (p, fname);
4576 deps_output (p, ' ');
4577 break;
4578 }
4579 }
4580 }
4581 else
4582 {
4583 /* Otherwise, omit the directory, as if the file existed
4584 in the directory with the source. */
4585 deps_output (fname, ' ');
4586 }
4587 }
4588 /* If -M was specified, and this header file won't be added to the
4589 dependency list, then don't count this as an error, because we can
4590 still produce correct output. Otherwise, we can't produce correct
4591 output, because there may be dependencies we need inside the missing
4592 file, and we don't know what directory this missing file exists in. */
4593 else if (print_deps
4594 && (print_deps <= (angle_brackets || (system_include_depth > 0))))
4595 warning ("No include path in which to find %s", fname);
4596 else if (search_start)
4597 error_from_errno (fname);
4598 else
4599 error ("No include path in which to find %s", fname);
4600 } else {
4601 /* Check to see if this include file is a once-only include file.
4602 If so, give up. */
4603
4604 struct file_name_list* ptr;
4605
4606 for (ptr = dont_repeat_files; ptr; ptr = ptr->next) {
4607 if (!strcmp (ptr->fname, fname)) {
4608 close (f);
4609 return 0; /* This file was once'd. */
4610 }
4611 }
4612
4613 for (ptr = all_include_files; ptr; ptr = ptr->next) {
4614 if (!strcmp (ptr->fname, fname))
4615 break; /* This file was included before. */
4616 }
4617
4618 if (ptr == 0) {
4619 /* This is the first time for this file. */
4620 /* Add it to list of files included. */
4621
4622 ptr = (struct file_name_list *) xmalloc (sizeof (struct file_name_list));
4623 ptr->control_macro = 0;
4624 ptr->c_system_include_path = 0;
4625 ptr->next = all_include_files;
4626 all_include_files = ptr;
4627 ptr->fname = savestring (fname);
4628 ptr->got_name_map = 0;
4629
4630 /* For -M, add this file to the dependencies. */
4631 if (print_deps > (angle_brackets || (system_include_depth > 0)))
4632 deps_output (fname, ' ');
4633 }
4634
4635 /* Handle -H option. */
4636 if (print_include_names) {
4637 output_dots (stderr, indepth);
4638 fprintf (stderr, "%s\n", fname);
4639 }
4640
4641 if (angle_brackets)
4642 system_include_depth++;
4643
4644 /* Actually process the file. */
4645 add_import (f, fname); /* Record file on "seen" list for #import. */
4646
4647 pcftry = (char *) alloca (strlen (fname) + 30);
4648 pcfbuf = 0;
4649 pcfnum = 0;
4650
4651 if (!no_precomp)
4652 {
4653 struct stat stat_f;
4654
4655 fstat (f, &stat_f);
4656
4657 do {
4658 sprintf (pcftry, "%s%d", fname, pcfnum++);
4659
4660 pcf = open (pcftry, O_RDONLY, 0666);
4661 if (pcf != -1)
4662 {
4663 struct stat s;
4664
4665 fstat (pcf, &s);
4666 if (bcmp ((char *) &stat_f.st_ino, (char *) &s.st_ino,
4667 sizeof (s.st_ino))
4668 || stat_f.st_dev != s.st_dev)
4669 {
4670 pcfbuf = check_precompiled (pcf, fname, &pcfbuflimit);
4671 /* Don't need it any more. */
4672 close (pcf);
4673 }
4674 else
4675 {
4676 /* Don't need it at all. */
4677 close (pcf);
4678 break;
4679 }
4680 }
4681 } while (pcf != -1 && !pcfbuf);
4682 }
4683
4684 /* Actually process the file */
4685 if (pcfbuf) {
4686 pcfname = xmalloc (strlen (pcftry) + 1);
4687 strcpy (pcfname, pcftry);
4688 pcfinclude ((U_CHAR *) pcfbuf, (U_CHAR *) pcfbuflimit,
4689 (U_CHAR *) fname, op);
4690 }
4691 else
4692 finclude (f, fname, op, is_system_include (fname), searchptr);
4693
4694 if (angle_brackets)
4695 system_include_depth--;
4696 }
4697 return 0;
4698 }
4699
4700 /* Return nonzero if there is no need to include file NAME
4701 because it has already been included and it contains a conditional
4702 to make a repeated include do nothing. */
4703
4704 static int
4705 redundant_include_p (name)
4706 char *name;
4707 {
4708 struct file_name_list *l = all_include_files;
4709 for (; l; l = l->next)
4710 if (! strcmp (name, l->fname)
4711 && l->control_macro
4712 && lookup (l->control_macro, -1, -1))
4713 return 1;
4714 return 0;
4715 }
4716
4717 /* Return nonzero if the given FILENAME is an absolute pathname which
4718 designates a file within one of the known "system" include file
4719 directories. We assume here that if the given FILENAME looks like
4720 it is the name of a file which resides either directly in a "system"
4721 include file directory, or within any subdirectory thereof, then the
4722 given file must be a "system" include file. This function tells us
4723 if we should suppress pedantic errors/warnings for the given FILENAME.
4724
4725 The value is 2 if the file is a C-language system header file
4726 for which C++ should (on most systems) assume `extern "C"'. */
4727
4728 static int
4729 is_system_include (filename)
4730 register char *filename;
4731 {
4732 struct file_name_list *searchptr;
4733
4734 for (searchptr = first_system_include; searchptr;
4735 searchptr = searchptr->next)
4736 if (searchptr->fname) {
4737 register char *sys_dir = searchptr->fname;
4738 register unsigned length = strlen (sys_dir);
4739
4740 if (! strncmp (sys_dir, filename, length)
4741 && (filename[length] == '/'
4742 #ifdef DIR_SEPARATOR
4743 || filename[length] == DIR_SEPARATOR
4744 #endif
4745 )) {
4746 if (searchptr->c_system_include_path)
4747 return 2;
4748 else
4749 return 1;
4750 }
4751 }
4752 return 0;
4753 }
4754 \f
4755 /* The file_name_map structure holds a mapping of file names for a
4756 particular directory. This mapping is read from the file named
4757 FILE_NAME_MAP_FILE in that directory. Such a file can be used to
4758 map filenames on a file system with severe filename restrictions,
4759 such as DOS. The format of the file name map file is just a series
4760 of lines with two tokens on each line. The first token is the name
4761 to map, and the second token is the actual name to use. */
4762
4763 struct file_name_map
4764 {
4765 struct file_name_map *map_next;
4766 char *map_from;
4767 char *map_to;
4768 };
4769
4770 #define FILE_NAME_MAP_FILE "header.gcc"
4771
4772 /* Read a space delimited string of unlimited length from a stdio
4773 file. */
4774
4775 static char *
4776 read_filename_string (ch, f)
4777 int ch;
4778 FILE *f;
4779 {
4780 char *alloc, *set;
4781 int len;
4782
4783 len = 20;
4784 set = alloc = xmalloc (len + 1);
4785 if (! is_space[ch])
4786 {
4787 *set++ = ch;
4788 while ((ch = getc (f)) != EOF && ! is_space[ch])
4789 {
4790 if (set - alloc == len)
4791 {
4792 len *= 2;
4793 alloc = xrealloc (alloc, len + 1);
4794 set = alloc + len / 2;
4795 }
4796 *set++ = ch;
4797 }
4798 }
4799 *set = '\0';
4800 ungetc (ch, f);
4801 return alloc;
4802 }
4803
4804 /* Read the file name map file for DIRNAME. */
4805
4806 static struct file_name_map *
4807 read_name_map (dirname)
4808 char *dirname;
4809 {
4810 /* This structure holds a linked list of file name maps, one per
4811 directory. */
4812 struct file_name_map_list
4813 {
4814 struct file_name_map_list *map_list_next;
4815 char *map_list_name;
4816 struct file_name_map *map_list_map;
4817 };
4818 static struct file_name_map_list *map_list;
4819 register struct file_name_map_list *map_list_ptr;
4820 char *name;
4821 FILE *f;
4822
4823 for (map_list_ptr = map_list; map_list_ptr;
4824 map_list_ptr = map_list_ptr->map_list_next)
4825 if (! strcmp (map_list_ptr->map_list_name, dirname))
4826 return map_list_ptr->map_list_map;
4827
4828 map_list_ptr = ((struct file_name_map_list *)
4829 xmalloc (sizeof (struct file_name_map_list)));
4830 map_list_ptr->map_list_name = savestring (dirname);
4831 map_list_ptr->map_list_map = NULL;
4832
4833 name = (char *) alloca (strlen (dirname) + strlen (FILE_NAME_MAP_FILE) + 2);
4834 strcpy (name, dirname);
4835 if (*dirname)
4836 strcat (name, "/");
4837 strcat (name, FILE_NAME_MAP_FILE);
4838 f = fopen (name, "r");
4839 if (!f)
4840 map_list_ptr->map_list_map = NULL;
4841 else
4842 {
4843 int ch;
4844 int dirlen = strlen (dirname);
4845
4846 while ((ch = getc (f)) != EOF)
4847 {
4848 char *from, *to;
4849 struct file_name_map *ptr;
4850
4851 if (is_space[ch])
4852 continue;
4853 from = read_filename_string (ch, f);
4854 while ((ch = getc (f)) != EOF && is_hor_space[ch])
4855 ;
4856 to = read_filename_string (ch, f);
4857
4858 ptr = ((struct file_name_map *)
4859 xmalloc (sizeof (struct file_name_map)));
4860 ptr->map_from = from;
4861
4862 /* Make the real filename absolute. */
4863 if (*to == '/')
4864 ptr->map_to = to;
4865 else
4866 {
4867 ptr->map_to = xmalloc (dirlen + strlen (to) + 2);
4868 strcpy (ptr->map_to, dirname);
4869 ptr->map_to[dirlen] = '/';
4870 strcpy (ptr->map_to + dirlen + 1, to);
4871 free (to);
4872 }
4873
4874 ptr->map_next = map_list_ptr->map_list_map;
4875 map_list_ptr->map_list_map = ptr;
4876
4877 while ((ch = getc (f)) != '\n')
4878 if (ch == EOF)
4879 break;
4880 }
4881 fclose (f);
4882 }
4883
4884 map_list_ptr->map_list_next = map_list;
4885 map_list = map_list_ptr;
4886
4887 return map_list_ptr->map_list_map;
4888 }
4889
4890 /* Try to open include file FILENAME. SEARCHPTR is the directory
4891 being tried from the include file search path. This function maps
4892 filenames on file systems based on information read by
4893 read_name_map. */
4894
4895 static int
4896 open_include_file (filename, searchptr)
4897 char *filename;
4898 struct file_name_list *searchptr;
4899 {
4900 register struct file_name_map *map;
4901 register char *from;
4902 char *p, *dir;
4903
4904 if (searchptr && ! searchptr->got_name_map)
4905 {
4906 searchptr->name_map = read_name_map (searchptr->fname
4907 ? searchptr->fname : ".");
4908 searchptr->got_name_map = 1;
4909 }
4910
4911 /* First check the mapping for the directory we are using. */
4912 if (searchptr && searchptr->name_map)
4913 {
4914 from = filename;
4915 if (searchptr->fname)
4916 from += strlen (searchptr->fname) + 1;
4917 for (map = searchptr->name_map; map; map = map->map_next)
4918 {
4919 if (! strcmp (map->map_from, from))
4920 {
4921 /* Found a match. */
4922 return open (map->map_to, O_RDONLY, 0666);
4923 }
4924 }
4925 }
4926
4927 /* Try to find a mapping file for the particular directory we are
4928 looking in. Thus #include <sys/types.h> will look up sys/types.h
4929 in /usr/include/header.gcc and look up types.h in
4930 /usr/include/sys/header.gcc. */
4931 p = rindex (filename, '/');
4932 #ifdef DIR_SEPARATOR
4933 if (! p) p = rindex (filename, DIR_SEPARATOR);
4934 else {
4935 char *tmp = rindex (filename, DIR_SEPARATOR);
4936 if (tmp != NULL && tmp > p) p = tmp;
4937 }
4938 #endif
4939 if (! p)
4940 p = filename;
4941 if (searchptr
4942 && searchptr->fname
4943 && strlen (searchptr->fname) == p - filename
4944 && ! strncmp (searchptr->fname, filename, p - filename))
4945 {
4946 /* FILENAME is in SEARCHPTR, which we've already checked. */
4947 return open (filename, O_RDONLY, 0666);
4948 }
4949
4950 if (p == filename)
4951 {
4952 dir = ".";
4953 from = filename;
4954 }
4955 else
4956 {
4957 dir = (char *) alloca (p - filename + 1);
4958 bcopy (filename, dir, p - filename);
4959 dir[p - filename] = '\0';
4960 from = p + 1;
4961 }
4962 for (map = read_name_map (dir); map; map = map->map_next)
4963 if (! strcmp (map->map_from, from))
4964 return open (map->map_to, O_RDONLY, 0666);
4965
4966 return open (filename, O_RDONLY, 0666);
4967 }
4968 \f
4969 /* Process the contents of include file FNAME, already open on descriptor F,
4970 with output to OP.
4971 SYSTEM_HEADER_P is 1 if this file resides in any one of the known
4972 "system" include directories (as decided by the `is_system_include'
4973 function above).
4974 DIRPTR is the link in the dir path through which this file was found,
4975 or 0 if the file name was absolute. */
4976
4977 static void
4978 finclude (f, fname, op, system_header_p, dirptr)
4979 int f;
4980 char *fname;
4981 FILE_BUF *op;
4982 int system_header_p;
4983 struct file_name_list *dirptr;
4984 {
4985 int st_mode;
4986 long st_size;
4987 long i;
4988 FILE_BUF *fp; /* For input stack frame */
4989 int missing_newline = 0;
4990
4991 CHECK_DEPTH (return;);
4992
4993 if (file_size_and_mode (f, &st_mode, &st_size) < 0)
4994 {
4995 perror_with_name (fname);
4996 close (f);
4997 return;
4998 }
4999
5000 fp = &instack[indepth + 1];
5001 bzero ((char *) fp, sizeof (FILE_BUF));
5002 fp->nominal_fname = fp->fname = fname;
5003 fp->length = 0;
5004 fp->lineno = 1;
5005 fp->if_stack = if_stack;
5006 fp->system_header_p = system_header_p;
5007 fp->dir = dirptr;
5008
5009 if (S_ISREG (st_mode)) {
5010 fp->buf = (U_CHAR *) xmalloc (st_size + 2);
5011 fp->bufp = fp->buf;
5012
5013 /* Read the file contents, knowing that st_size is an upper bound
5014 on the number of bytes we can read. */
5015 fp->length = safe_read (f, (char *) fp->buf, st_size);
5016 if (fp->length < 0) goto nope;
5017 }
5018 else if (S_ISDIR (st_mode)) {
5019 error ("directory `%s' specified in #include", fname);
5020 close (f);
5021 return;
5022 } else {
5023 /* Cannot count its file size before reading.
5024 First read the entire file into heap and
5025 copy them into buffer on stack. */
5026
5027 int bsize = 2000;
5028
5029 st_size = 0;
5030 fp->buf = (U_CHAR *) xmalloc (bsize + 2);
5031
5032 for (;;) {
5033 i = safe_read (f, (char *) fp->buf + st_size, bsize - st_size);
5034 if (i < 0)
5035 goto nope; /* error! */
5036 st_size += i;
5037 if (st_size != bsize)
5038 break; /* End of file */
5039 bsize *= 2;
5040 fp->buf = (U_CHAR *) xrealloc (fp->buf, bsize + 2);
5041 }
5042 fp->bufp = fp->buf;
5043 fp->length = st_size;
5044 }
5045
5046 if ((fp->length > 0 && fp->buf[fp->length - 1] != '\n')
5047 /* Backslash-newline at end is not good enough. */
5048 || (fp->length > 1 && fp->buf[fp->length - 2] == '\\')) {
5049 fp->buf[fp->length++] = '\n';
5050 missing_newline = 1;
5051 }
5052 fp->buf[fp->length] = '\0';
5053
5054 /* Close descriptor now, so nesting does not use lots of descriptors. */
5055 close (f);
5056
5057 /* Must do this before calling trigraph_pcp, so that the correct file name
5058 will be printed in warning messages. */
5059
5060 indepth++;
5061 input_file_stack_tick++;
5062
5063 if (!no_trigraphs)
5064 trigraph_pcp (fp);
5065
5066 output_line_directive (fp, op, 0, enter_file);
5067 rescan (op, 0);
5068
5069 if (missing_newline)
5070 fp->lineno--;
5071
5072 if (pedantic && missing_newline)
5073 pedwarn ("file does not end in newline");
5074
5075 indepth--;
5076 input_file_stack_tick++;
5077 output_line_directive (&instack[indepth], op, 0, leave_file);
5078 free (fp->buf);
5079 return;
5080
5081 nope:
5082
5083 perror_with_name (fname);
5084 close (f);
5085 free (fp->buf);
5086 }
5087
5088 /* Record that inclusion of the file named FILE
5089 should be controlled by the macro named MACRO_NAME.
5090 This means that trying to include the file again
5091 will do something if that macro is defined. */
5092
5093 static void
5094 record_control_macro (file, macro_name)
5095 char *file;
5096 U_CHAR *macro_name;
5097 {
5098 struct file_name_list *new;
5099
5100 for (new = all_include_files; new; new = new->next) {
5101 if (!strcmp (new->fname, file)) {
5102 new->control_macro = macro_name;
5103 return;
5104 }
5105 }
5106
5107 /* If the file is not in all_include_files, something's wrong. */
5108 abort ();
5109 }
5110 \f
5111 /* Maintain and search list of included files, for #import. */
5112
5113 #define IMPORT_HASH_SIZE 31
5114
5115 struct import_file {
5116 char *name;
5117 ino_t inode;
5118 dev_t dev;
5119 struct import_file *next;
5120 };
5121
5122 /* Hash table of files already included with #include or #import. */
5123
5124 static struct import_file *import_hash_table[IMPORT_HASH_SIZE];
5125
5126 /* Hash a file name for import_hash_table. */
5127
5128 static int
5129 import_hash (f)
5130 char *f;
5131 {
5132 int val = 0;
5133
5134 while (*f) val += *f++;
5135 return (val%IMPORT_HASH_SIZE);
5136 }
5137
5138 /* Search for file FILENAME in import_hash_table.
5139 Return -2 if found, either a matching name or a matching inode.
5140 Otherwise, open the file and return a file descriptor if successful
5141 or -1 if unsuccessful. */
5142
5143 static int
5144 lookup_import (filename, searchptr)
5145 char *filename;
5146 struct file_name_list *searchptr;
5147 {
5148 struct import_file *i;
5149 int h;
5150 int hashval;
5151 struct stat sb;
5152 int fd;
5153
5154 hashval = import_hash (filename);
5155
5156 /* Attempt to find file in list of already included files */
5157 i = import_hash_table[hashval];
5158
5159 while (i) {
5160 if (!strcmp (filename, i->name))
5161 return -2; /* return found */
5162 i = i->next;
5163 }
5164 /* Open it and try a match on inode/dev */
5165 fd = open_include_file (filename, searchptr);
5166 if (fd < 0)
5167 return fd;
5168 fstat (fd, &sb);
5169 for (h = 0; h < IMPORT_HASH_SIZE; h++) {
5170 i = import_hash_table[h];
5171 while (i) {
5172 /* Compare the inode and the device.
5173 Supposedly on some systems the inode is not a scalar. */
5174 if (!bcmp ((char *) &i->inode, (char *) &sb.st_ino, sizeof (sb.st_ino))
5175 && i->dev == sb.st_dev) {
5176 close (fd);
5177 return -2; /* return found */
5178 }
5179 i = i->next;
5180 }
5181 }
5182 return fd; /* Not found, return open file */
5183 }
5184
5185 /* Add the file FNAME, open on descriptor FD, to import_hash_table. */
5186
5187 static void
5188 add_import (fd, fname)
5189 int fd;
5190 char *fname;
5191 {
5192 struct import_file *i;
5193 int hashval;
5194 struct stat sb;
5195
5196 hashval = import_hash (fname);
5197 fstat (fd, &sb);
5198 i = (struct import_file *)xmalloc (sizeof (struct import_file));
5199 i->name = xmalloc (strlen (fname)+1);
5200 strcpy (i->name, fname);
5201 bcopy ((char *) &sb.st_ino, (char *) &i->inode, sizeof (sb.st_ino));
5202 i->dev = sb.st_dev;
5203 i->next = import_hash_table[hashval];
5204 import_hash_table[hashval] = i;
5205 }
5206 \f
5207 /* Load the specified precompiled header into core, and verify its
5208 preconditions. PCF indicates the file descriptor to read, which must
5209 be a regular file. FNAME indicates the file name of the original
5210 header. *LIMIT will be set to an address one past the end of the file.
5211 If the preconditions of the file are not satisfied, the buffer is
5212 freed and we return 0. If the preconditions are satisfied, return
5213 the address of the buffer following the preconditions. The buffer, in
5214 this case, should never be freed because various pieces of it will
5215 be referred to until all precompiled strings are output at the end of
5216 the run.
5217 */
5218 static char *
5219 check_precompiled (pcf, fname, limit)
5220 int pcf;
5221 char *fname;
5222 char **limit;
5223 {
5224 int st_mode;
5225 long st_size;
5226 int length = 0;
5227 char *buf;
5228 char *cp;
5229
5230 if (pcp_outfile)
5231 return 0;
5232
5233 if (file_size_and_mode (pcf, &st_mode, &st_size) < 0)
5234 return 0;
5235
5236 if (S_ISREG (st_mode))
5237 {
5238 buf = xmalloc (st_size + 2);
5239 length = safe_read (pcf, buf, st_size);
5240 if (length < 0)
5241 goto nope;
5242 }
5243 else
5244 abort ();
5245
5246 if (length > 0 && buf[length-1] != '\n')
5247 buf[length++] = '\n';
5248 buf[length] = '\0';
5249
5250 *limit = buf + length;
5251
5252 /* File is in core. Check the preconditions. */
5253 if (!check_preconditions (buf))
5254 goto nope;
5255 for (cp = buf; *cp; cp++)
5256 ;
5257 #ifdef DEBUG_PCP
5258 fprintf (stderr, "Using preinclude %s\n", fname);
5259 #endif
5260 return cp + 1;
5261
5262 nope:
5263 #ifdef DEBUG_PCP
5264 fprintf (stderr, "Cannot use preinclude %s\n", fname);
5265 #endif
5266 free (buf);
5267 return 0;
5268 }
5269
5270 /* PREC (null terminated) points to the preconditions of a
5271 precompiled header. These are a series of #define and #undef
5272 lines which must match the current contents of the hash
5273 table. */
5274 static int
5275 check_preconditions (prec)
5276 char *prec;
5277 {
5278 MACRODEF mdef;
5279 char *lineend;
5280
5281 while (*prec) {
5282 lineend = index (prec, '\n');
5283
5284 if (*prec++ != '#') {
5285 error ("Bad format encountered while reading precompiled file");
5286 return 0;
5287 }
5288 if (!strncmp (prec, "define", 6)) {
5289 HASHNODE *hp;
5290
5291 prec += 6;
5292 mdef = create_definition ((U_CHAR *) prec, (U_CHAR *) lineend, NULL_PTR);
5293
5294 if (mdef.defn == 0)
5295 abort ();
5296
5297 if ((hp = lookup (mdef.symnam, mdef.symlen, -1)) == NULL
5298 || (hp->type != T_MACRO && hp->type != T_CONST)
5299 || (hp->type == T_MACRO
5300 && !compare_defs (mdef.defn, hp->value.defn)
5301 && (mdef.defn->length != 2
5302 || mdef.defn->expansion[0] != '\n'
5303 || mdef.defn->expansion[1] != ' ')))
5304 return 0;
5305 } else if (!strncmp (prec, "undef", 5)) {
5306 char *name;
5307 int len;
5308
5309 prec += 5;
5310 while (is_hor_space[(U_CHAR) *prec])
5311 prec++;
5312 name = prec;
5313 while (is_idchar[(U_CHAR) *prec])
5314 prec++;
5315 len = prec - name;
5316
5317 if (lookup ((U_CHAR *) name, len, -1))
5318 return 0;
5319 } else {
5320 error ("Bad format encountered while reading precompiled file");
5321 return 0;
5322 }
5323 prec = lineend + 1;
5324 }
5325 /* They all passed successfully */
5326 return 1;
5327 }
5328
5329 /* Process the main body of a precompiled file. BUF points to the
5330 string section of the file, following the preconditions. LIMIT is one
5331 character past the end. NAME is the name of the file being read
5332 in. OP is the main output buffer */
5333 static void
5334 pcfinclude (buf, limit, name, op)
5335 U_CHAR *buf, *limit, *name;
5336 FILE_BUF *op;
5337 {
5338 FILE_BUF tmpbuf;
5339 int nstrings;
5340 U_CHAR *cp = buf;
5341
5342 /* First in the file comes 4 bytes indicating the number of strings, */
5343 /* in network byte order. (MSB first). */
5344 nstrings = *cp++;
5345 nstrings = (nstrings << 8) | *cp++;
5346 nstrings = (nstrings << 8) | *cp++;
5347 nstrings = (nstrings << 8) | *cp++;
5348
5349 /* Looping over each string... */
5350 while (nstrings--) {
5351 U_CHAR *string_start;
5352 U_CHAR *endofthiskey;
5353 STRINGDEF *str;
5354 int nkeys;
5355
5356 /* Each string starts with a STRINGDEF structure (str), followed */
5357 /* by the text of the string (string_start) */
5358
5359 /* First skip to a longword boundary */
5360 /* ??? Why a 4-byte boundary? On all machines? */
5361 /* NOTE: This works correctly even if HOST_WIDE_INT
5362 is narrower than a pointer.
5363 Do not try risky measures here to get another type to use!
5364 Do not include stddef.h--it will fail! */
5365 if ((HOST_WIDE_INT) cp & 3)
5366 cp += 4 - ((HOST_WIDE_INT) cp & 3);
5367
5368 /* Now get the string. */
5369 str = (STRINGDEF *) (GENERIC_PTR) cp;
5370 string_start = cp += sizeof (STRINGDEF);
5371
5372 for (; *cp; cp++) /* skip the string */
5373 ;
5374
5375 /* We need to macro expand the string here to ensure that the
5376 proper definition environment is in place. If it were only
5377 expanded when we find out it is needed, macros necessary for
5378 its proper expansion might have had their definitions changed. */
5379 tmpbuf = expand_to_temp_buffer (string_start, cp++, 0, 0);
5380 /* Lineno is already set in the precompiled file */
5381 str->contents = tmpbuf.buf;
5382 str->len = tmpbuf.length;
5383 str->writeflag = 0;
5384 str->filename = name;
5385 str->output_mark = outbuf.bufp - outbuf.buf;
5386
5387 str->chain = 0;
5388 *stringlist_tailp = str;
5389 stringlist_tailp = &str->chain;
5390
5391 /* Next comes a fourbyte number indicating the number of keys */
5392 /* for this string. */
5393 nkeys = *cp++;
5394 nkeys = (nkeys << 8) | *cp++;
5395 nkeys = (nkeys << 8) | *cp++;
5396 nkeys = (nkeys << 8) | *cp++;
5397
5398 /* If this number is -1, then the string is mandatory. */
5399 if (nkeys == -1)
5400 str->writeflag = 1;
5401 else
5402 /* Otherwise, for each key, */
5403 for (; nkeys--; free (tmpbuf.buf), cp = endofthiskey + 1) {
5404 KEYDEF *kp = (KEYDEF *) (GENERIC_PTR) cp;
5405 HASHNODE *hp;
5406
5407 /* It starts with a KEYDEF structure */
5408 cp += sizeof (KEYDEF);
5409
5410 /* Find the end of the key. At the end of this for loop we
5411 advance CP to the start of the next key using this variable. */
5412 endofthiskey = cp + strlen ((char *) cp);
5413 kp->str = str;
5414
5415 /* Expand the key, and enter it into the hash table. */
5416 tmpbuf = expand_to_temp_buffer (cp, endofthiskey, 0, 0);
5417 tmpbuf.bufp = tmpbuf.buf;
5418
5419 while (is_hor_space[*tmpbuf.bufp])
5420 tmpbuf.bufp++;
5421 if (!is_idstart[*tmpbuf.bufp]
5422 || tmpbuf.bufp == tmpbuf.buf + tmpbuf.length) {
5423 str->writeflag = 1;
5424 continue;
5425 }
5426
5427 hp = lookup (tmpbuf.bufp, -1, -1);
5428 if (hp == NULL) {
5429 kp->chain = 0;
5430 install (tmpbuf.bufp, -1, T_PCSTRING, (char *) kp, -1);
5431 }
5432 else if (hp->type == T_PCSTRING) {
5433 kp->chain = hp->value.keydef;
5434 hp->value.keydef = kp;
5435 }
5436 else
5437 str->writeflag = 1;
5438 }
5439 }
5440 /* This output_line_directive serves to switch us back to the current
5441 input file in case some of these strings get output (which will
5442 result in line directives for the header file being output). */
5443 output_line_directive (&instack[indepth], op, 0, enter_file);
5444 }
5445
5446 /* Called from rescan when it hits a key for strings. Mark them all */
5447 /* used and clean up. */
5448 static void
5449 pcstring_used (hp)
5450 HASHNODE *hp;
5451 {
5452 KEYDEF *kp;
5453
5454 for (kp = hp->value.keydef; kp; kp = kp->chain)
5455 kp->str->writeflag = 1;
5456 delete_macro (hp);
5457 }
5458
5459 /* Write the output, interspersing precompiled strings in their */
5460 /* appropriate places. */
5461 static void
5462 write_output ()
5463 {
5464 STRINGDEF *next_string;
5465 U_CHAR *cur_buf_loc;
5466 int line_directive_len = 80;
5467 char *line_directive = xmalloc (line_directive_len);
5468 int len;
5469
5470 /* In each run through the loop, either cur_buf_loc == */
5471 /* next_string_loc, in which case we print a series of strings, or */
5472 /* it is less than next_string_loc, in which case we write some of */
5473 /* the buffer. */
5474 cur_buf_loc = outbuf.buf;
5475 next_string = stringlist;
5476
5477 while (cur_buf_loc < outbuf.bufp || next_string) {
5478 if (next_string
5479 && cur_buf_loc - outbuf.buf == next_string->output_mark) {
5480 if (next_string->writeflag) {
5481 len = 4 * strlen ((char *) next_string->filename) + 32;
5482 while (len > line_directive_len)
5483 line_directive = xrealloc (line_directive,
5484 line_directive_len *= 2);
5485 sprintf (line_directive, "\n# %d ", next_string->lineno);
5486 strcpy (quote_string (line_directive + strlen (line_directive),
5487 (char *) next_string->filename),
5488 "\n");
5489 safe_write (fileno (stdout), line_directive, strlen (line_directive));
5490 safe_write (fileno (stdout),
5491 (char *) next_string->contents, next_string->len);
5492 }
5493 next_string = next_string->chain;
5494 }
5495 else {
5496 len = (next_string
5497 ? (next_string->output_mark
5498 - (cur_buf_loc - outbuf.buf))
5499 : outbuf.bufp - cur_buf_loc);
5500
5501 safe_write (fileno (stdout), (char *) cur_buf_loc, len);
5502 cur_buf_loc += len;
5503 }
5504 }
5505 free (line_directive);
5506 }
5507
5508 /* Pass a directive through to the output file.
5509 BUF points to the contents of the directive, as a contiguous string.
5510 LIMIT points to the first character past the end of the directive.
5511 KEYWORD is the keyword-table entry for the directive. */
5512
5513 static void
5514 pass_thru_directive (buf, limit, op, keyword)
5515 U_CHAR *buf, *limit;
5516 FILE_BUF *op;
5517 struct directive *keyword;
5518 {
5519 register unsigned keyword_length = keyword->length;
5520
5521 check_expand (op, 1 + keyword_length + (limit - buf));
5522 *op->bufp++ = '#';
5523 bcopy (keyword->name, (char *) op->bufp, keyword_length);
5524 op->bufp += keyword_length;
5525 if (limit != buf && buf[0] != ' ')
5526 *op->bufp++ = ' ';
5527 bcopy ((char *) buf, (char *) op->bufp, limit - buf);
5528 op->bufp += (limit - buf);
5529 #if 0
5530 *op->bufp++ = '\n';
5531 /* Count the line we have just made in the output,
5532 to get in sync properly. */
5533 op->lineno++;
5534 #endif
5535 }
5536 \f
5537 /* The arglist structure is built by do_define to tell
5538 collect_definition where the argument names begin. That
5539 is, for a define like "#define f(x,y,z) foo+x-bar*y", the arglist
5540 would contain pointers to the strings x, y, and z.
5541 Collect_definition would then build a DEFINITION node,
5542 with reflist nodes pointing to the places x, y, and z had
5543 appeared. So the arglist is just convenience data passed
5544 between these two routines. It is not kept around after
5545 the current #define has been processed and entered into the
5546 hash table. */
5547
5548 struct arglist {
5549 struct arglist *next;
5550 U_CHAR *name;
5551 int length;
5552 int argno;
5553 char rest_args;
5554 };
5555
5556 /* Create a DEFINITION node from a #define directive. Arguments are
5557 as for do_define. */
5558 static MACRODEF
5559 create_definition (buf, limit, op)
5560 U_CHAR *buf, *limit;
5561 FILE_BUF *op;
5562 {
5563 U_CHAR *bp; /* temp ptr into input buffer */
5564 U_CHAR *symname; /* remember where symbol name starts */
5565 int sym_length; /* and how long it is */
5566 int line = instack[indepth].lineno;
5567 char *file = instack[indepth].nominal_fname;
5568 int rest_args = 0;
5569
5570 DEFINITION *defn;
5571 int arglengths = 0; /* Accumulate lengths of arg names
5572 plus number of args. */
5573 MACRODEF mdef;
5574
5575 bp = buf;
5576
5577 while (is_hor_space[*bp])
5578 bp++;
5579
5580 symname = bp; /* remember where it starts */
5581 sym_length = check_macro_name (bp, "macro");
5582 bp += sym_length;
5583
5584 /* Lossage will occur if identifiers or control keywords are broken
5585 across lines using backslash. This is not the right place to take
5586 care of that. */
5587
5588 if (*bp == '(') {
5589 struct arglist *arg_ptrs = NULL;
5590 int argno = 0;
5591
5592 bp++; /* skip '(' */
5593 SKIP_WHITE_SPACE (bp);
5594
5595 /* Loop over macro argument names. */
5596 while (*bp != ')') {
5597 struct arglist *temp;
5598
5599 temp = (struct arglist *) alloca (sizeof (struct arglist));
5600 temp->name = bp;
5601 temp->next = arg_ptrs;
5602 temp->argno = argno++;
5603 temp->rest_args = 0;
5604 arg_ptrs = temp;
5605
5606 if (rest_args)
5607 pedwarn ("another parameter follows `%s'",
5608 rest_extension);
5609
5610 if (!is_idstart[*bp])
5611 pedwarn ("invalid character in macro parameter name");
5612
5613 /* Find the end of the arg name. */
5614 while (is_idchar[*bp]) {
5615 bp++;
5616 /* do we have a "special" rest-args extension here? */
5617 if (limit - bp > REST_EXTENSION_LENGTH &&
5618 bcmp (rest_extension, bp, REST_EXTENSION_LENGTH) == 0) {
5619 rest_args = 1;
5620 temp->rest_args = 1;
5621 break;
5622 }
5623 }
5624 temp->length = bp - temp->name;
5625 if (rest_args == 1)
5626 bp += REST_EXTENSION_LENGTH;
5627 arglengths += temp->length + 2;
5628 SKIP_WHITE_SPACE (bp);
5629 if (temp->length == 0 || (*bp != ',' && *bp != ')')) {
5630 error ("badly punctuated parameter list in `#define'");
5631 goto nope;
5632 }
5633 if (*bp == ',') {
5634 bp++;
5635 SKIP_WHITE_SPACE (bp);
5636 /* A comma at this point can only be followed by an identifier. */
5637 if (!is_idstart[*bp]) {
5638 error ("badly punctuated parameter list in `#define'");
5639 goto nope;
5640 }
5641 }
5642 if (bp >= limit) {
5643 error ("unterminated parameter list in `#define'");
5644 goto nope;
5645 }
5646 {
5647 struct arglist *otemp;
5648
5649 for (otemp = temp->next; otemp != NULL; otemp = otemp->next)
5650 if (temp->length == otemp->length &&
5651 bcmp (temp->name, otemp->name, temp->length) == 0) {
5652 error ("duplicate argument name `%.*s' in `#define'",
5653 temp->length, temp->name);
5654 goto nope;
5655 }
5656 }
5657 }
5658
5659 ++bp; /* skip paren */
5660 SKIP_WHITE_SPACE (bp);
5661 /* now everything from bp before limit is the definition. */
5662 defn = collect_expansion (bp, limit, argno, arg_ptrs);
5663 defn->rest_args = rest_args;
5664
5665 /* Now set defn->args.argnames to the result of concatenating
5666 the argument names in reverse order
5667 with comma-space between them. */
5668 defn->args.argnames = (U_CHAR *) xmalloc (arglengths + 1);
5669 {
5670 struct arglist *temp;
5671 int i = 0;
5672 for (temp = arg_ptrs; temp; temp = temp->next) {
5673 bcopy (temp->name, &defn->args.argnames[i], temp->length);
5674 i += temp->length;
5675 if (temp->next != 0) {
5676 defn->args.argnames[i++] = ',';
5677 defn->args.argnames[i++] = ' ';
5678 }
5679 }
5680 defn->args.argnames[i] = 0;
5681 }
5682 } else {
5683 /* Simple expansion or empty definition. */
5684
5685 if (bp < limit)
5686 {
5687 if (is_hor_space[*bp]) {
5688 bp++;
5689 SKIP_WHITE_SPACE (bp);
5690 } else {
5691 switch (*bp) {
5692 case '!': case '"': case '#': case '%': case '&': case '\'':
5693 case ')': case '*': case '+': case ',': case '-': case '.':
5694 case '/': case ':': case ';': case '<': case '=': case '>':
5695 case '?': case '[': case '\\': case ']': case '^': case '{':
5696 case '|': case '}': case '~':
5697 warning ("missing white space after `#define %.*s'",
5698 sym_length, symname);
5699 break;
5700
5701 default:
5702 pedwarn ("missing white space after `#define %.*s'",
5703 sym_length, symname);
5704 break;
5705 }
5706 }
5707 }
5708 /* Now everything from bp before limit is the definition. */
5709 defn = collect_expansion (bp, limit, -1, NULL_PTR);
5710 defn->args.argnames = (U_CHAR *) "";
5711 }
5712
5713 defn->line = line;
5714 defn->file = file;
5715
5716 /* OP is null if this is a predefinition */
5717 defn->predefined = !op;
5718 mdef.defn = defn;
5719 mdef.symnam = symname;
5720 mdef.symlen = sym_length;
5721
5722 return mdef;
5723
5724 nope:
5725 mdef.defn = 0;
5726 return mdef;
5727 }
5728
5729 /* Process a #define directive.
5730 BUF points to the contents of the #define directive, as a contiguous string.
5731 LIMIT points to the first character past the end of the definition.
5732 KEYWORD is the keyword-table entry for #define. */
5733
5734 static int
5735 do_define (buf, limit, op, keyword)
5736 U_CHAR *buf, *limit;
5737 FILE_BUF *op;
5738 struct directive *keyword;
5739 {
5740 int hashcode;
5741 MACRODEF mdef;
5742
5743 /* If this is a precompiler run (with -pcp) pass thru #define directives. */
5744 if (pcp_outfile && op)
5745 pass_thru_directive (buf, limit, op, keyword);
5746
5747 mdef = create_definition (buf, limit, op);
5748 if (mdef.defn == 0)
5749 goto nope;
5750
5751 hashcode = hashf (mdef.symnam, mdef.symlen, HASHSIZE);
5752
5753 {
5754 HASHNODE *hp;
5755 if ((hp = lookup (mdef.symnam, mdef.symlen, hashcode)) != NULL) {
5756 int ok = 0;
5757 /* Redefining a precompiled key is ok. */
5758 if (hp->type == T_PCSTRING)
5759 ok = 1;
5760 /* Redefining a macro is ok if the definitions are the same. */
5761 else if (hp->type == T_MACRO)
5762 ok = ! compare_defs (mdef.defn, hp->value.defn);
5763 /* Redefining a constant is ok with -D. */
5764 else if (hp->type == T_CONST)
5765 ok = ! done_initializing;
5766 /* Print the warning if it's not ok. */
5767 if (!ok) {
5768 /* If we are passing through #define and #undef directives, do
5769 that for this re-definition now. */
5770 if (debug_output && op)
5771 pass_thru_directive (buf, limit, op, keyword);
5772
5773 pedwarn ("`%.*s' redefined", mdef.symlen, mdef.symnam);
5774 if (hp->type == T_MACRO)
5775 pedwarn_with_file_and_line (hp->value.defn->file, hp->value.defn->line,
5776 "this is the location of the previous definition");
5777 }
5778 /* Replace the old definition. */
5779 hp->type = T_MACRO;
5780 hp->value.defn = mdef.defn;
5781 } else {
5782 /* If we are passing through #define and #undef directives, do
5783 that for this new definition now. */
5784 if (debug_output && op)
5785 pass_thru_directive (buf, limit, op, keyword);
5786 install (mdef.symnam, mdef.symlen, T_MACRO,
5787 (char *) mdef.defn, hashcode);
5788 }
5789 }
5790
5791 return 0;
5792
5793 nope:
5794
5795 return 1;
5796 }
5797 \f
5798 /* Check a purported macro name SYMNAME, and yield its length.
5799 USAGE is the kind of name this is intended for. */
5800
5801 static int
5802 check_macro_name (symname, usage)
5803 U_CHAR *symname;
5804 char *usage;
5805 {
5806 U_CHAR *p;
5807 int sym_length;
5808
5809 for (p = symname; is_idchar[*p]; p++)
5810 ;
5811 sym_length = p - symname;
5812 if (sym_length == 0)
5813 error ("invalid %s name", usage);
5814 else if (!is_idstart[*symname]
5815 || (sym_length == 7 && ! bcmp (symname, "defined", 7)))
5816 error ("invalid %s name `%.*s'", usage, sym_length, symname);
5817 return sym_length;
5818 }
5819
5820 /*
5821 * return zero if two DEFINITIONs are isomorphic
5822 */
5823 static int
5824 compare_defs (d1, d2)
5825 DEFINITION *d1, *d2;
5826 {
5827 register struct reflist *a1, *a2;
5828 register U_CHAR *p1 = d1->expansion;
5829 register U_CHAR *p2 = d2->expansion;
5830 int first = 1;
5831
5832 if (d1->nargs != d2->nargs)
5833 return 1;
5834 if (strcmp ((char *)d1->args.argnames, (char *)d2->args.argnames))
5835 return 1;
5836 for (a1 = d1->pattern, a2 = d2->pattern; a1 && a2;
5837 a1 = a1->next, a2 = a2->next) {
5838 if (!((a1->nchars == a2->nchars && ! bcmp (p1, p2, a1->nchars))
5839 || ! comp_def_part (first, p1, a1->nchars, p2, a2->nchars, 0))
5840 || a1->argno != a2->argno
5841 || a1->stringify != a2->stringify
5842 || a1->raw_before != a2->raw_before
5843 || a1->raw_after != a2->raw_after)
5844 return 1;
5845 first = 0;
5846 p1 += a1->nchars;
5847 p2 += a2->nchars;
5848 }
5849 if (a1 != a2)
5850 return 1;
5851 if (comp_def_part (first, p1, d1->length - (p1 - d1->expansion),
5852 p2, d2->length - (p2 - d2->expansion), 1))
5853 return 1;
5854 return 0;
5855 }
5856
5857 /* Return 1 if two parts of two macro definitions are effectively different.
5858 One of the parts starts at BEG1 and has LEN1 chars;
5859 the other has LEN2 chars at BEG2.
5860 Any sequence of whitespace matches any other sequence of whitespace.
5861 FIRST means these parts are the first of a macro definition;
5862 so ignore leading whitespace entirely.
5863 LAST means these parts are the last of a macro definition;
5864 so ignore trailing whitespace entirely. */
5865
5866 static int
5867 comp_def_part (first, beg1, len1, beg2, len2, last)
5868 int first;
5869 U_CHAR *beg1, *beg2;
5870 int len1, len2;
5871 int last;
5872 {
5873 register U_CHAR *end1 = beg1 + len1;
5874 register U_CHAR *end2 = beg2 + len2;
5875 if (first) {
5876 while (beg1 != end1 && is_space[*beg1]) beg1++;
5877 while (beg2 != end2 && is_space[*beg2]) beg2++;
5878 }
5879 if (last) {
5880 while (beg1 != end1 && is_space[end1[-1]]) end1--;
5881 while (beg2 != end2 && is_space[end2[-1]]) end2--;
5882 }
5883 while (beg1 != end1 && beg2 != end2) {
5884 if (is_space[*beg1] && is_space[*beg2]) {
5885 while (beg1 != end1 && is_space[*beg1]) beg1++;
5886 while (beg2 != end2 && is_space[*beg2]) beg2++;
5887 } else if (*beg1 == *beg2) {
5888 beg1++; beg2++;
5889 } else break;
5890 }
5891 return (beg1 != end1) || (beg2 != end2);
5892 }
5893 \f
5894 /* Read a replacement list for a macro with parameters.
5895 Build the DEFINITION structure.
5896 Reads characters of text starting at BUF until END.
5897 ARGLIST specifies the formal parameters to look for
5898 in the text of the definition; NARGS is the number of args
5899 in that list, or -1 for a macro name that wants no argument list.
5900 MACRONAME is the macro name itself (so we can avoid recursive expansion)
5901 and NAMELEN is its length in characters.
5902
5903 Note that comments, backslash-newlines, and leading white space
5904 have already been deleted from the argument. */
5905
5906 /* If there is no trailing whitespace, a Newline Space is added at the end
5907 to prevent concatenation that would be contrary to the standard. */
5908
5909 static DEFINITION *
5910 collect_expansion (buf, end, nargs, arglist)
5911 U_CHAR *buf, *end;
5912 int nargs;
5913 struct arglist *arglist;
5914 {
5915 DEFINITION *defn;
5916 register U_CHAR *p, *limit, *lastp, *exp_p;
5917 struct reflist *endpat = NULL;
5918 /* Pointer to first nonspace after last ## seen. */
5919 U_CHAR *concat = 0;
5920 /* Pointer to first nonspace after last single-# seen. */
5921 U_CHAR *stringify = 0;
5922 /* How those tokens were spelled. */
5923 enum sharp_token_type concat_sharp_token_type = NO_SHARP_TOKEN;
5924 enum sharp_token_type stringify_sharp_token_type = NO_SHARP_TOKEN;
5925 int maxsize;
5926 int expected_delimiter = '\0';
5927
5928 /* Scan thru the replacement list, ignoring comments and quoted
5929 strings, picking up on the macro calls. It does a linear search
5930 thru the arg list on every potential symbol. Profiling might say
5931 that something smarter should happen. */
5932
5933 if (end < buf)
5934 abort ();
5935
5936 /* Find the beginning of the trailing whitespace. */
5937 limit = end;
5938 p = buf;
5939 while (p < limit && is_space[limit[-1]]) limit--;
5940
5941 /* Allocate space for the text in the macro definition.
5942 Each input char may or may not need 1 byte,
5943 so this is an upper bound.
5944 The extra 3 are for invented trailing newline-marker and final null. */
5945 maxsize = (sizeof (DEFINITION)
5946 + (limit - p) + 3);
5947 defn = (DEFINITION *) xcalloc (1, maxsize);
5948
5949 defn->nargs = nargs;
5950 exp_p = defn->expansion = (U_CHAR *) defn + sizeof (DEFINITION);
5951 lastp = exp_p;
5952
5953 if (p[0] == '#'
5954 ? p[1] == '#'
5955 : p[0] == '%' && p[1] == ':' && p[2] == '%' && p[3] == ':') {
5956 error ("`##' at start of macro definition");
5957 p += p[0] == '#' ? 2 : 4;
5958 }
5959
5960 /* Process the main body of the definition. */
5961 while (p < limit) {
5962 int skipped_arg = 0;
5963 register U_CHAR c = *p++;
5964
5965 *exp_p++ = c;
5966
5967 if (!traditional) {
5968 switch (c) {
5969 case '\'':
5970 case '\"':
5971 if (expected_delimiter != '\0') {
5972 if (c == expected_delimiter)
5973 expected_delimiter = '\0';
5974 } else
5975 expected_delimiter = c;
5976 break;
5977
5978 case '\\':
5979 if (p < limit && expected_delimiter) {
5980 /* In a string, backslash goes through
5981 and makes next char ordinary. */
5982 *exp_p++ = *p++;
5983 }
5984 break;
5985
5986 case '%':
5987 if (!expected_delimiter && *p == ':') {
5988 /* %: is not a digraph if preceded by an odd number of '<'s. */
5989 U_CHAR *p0 = p - 1;
5990 while (buf < p0 && p0[-1] == '<')
5991 p0--;
5992 if ((p - p0) & 1) {
5993 /* Treat %:%: as ## and %: as #. */
5994 if (p[1] == '%' && p[2] == ':') {
5995 p += 2;
5996 goto sharp_sharp_token;
5997 }
5998 if (nargs >= 0) {
5999 p++;
6000 goto sharp_token;
6001 }
6002 }
6003 }
6004 break;
6005
6006 case '#':
6007 /* # is ordinary inside a string. */
6008 if (expected_delimiter)
6009 break;
6010 if (*p == '#') {
6011 sharp_sharp_token:
6012 /* ##: concatenate preceding and following tokens. */
6013 /* Take out the first #, discard preceding whitespace. */
6014 exp_p--;
6015 while (exp_p > lastp && is_hor_space[exp_p[-1]])
6016 --exp_p;
6017 /* Skip the second #. */
6018 p++;
6019 concat_sharp_token_type = c;
6020 if (is_hor_space[*p]) {
6021 concat_sharp_token_type = c + 1;
6022 p++;
6023 SKIP_WHITE_SPACE (p);
6024 }
6025 concat = p;
6026 if (p == limit)
6027 error ("`##' at end of macro definition");
6028 } else if (nargs >= 0) {
6029 /* Single #: stringify following argument ref.
6030 Don't leave the # in the expansion. */
6031 sharp_token:
6032 exp_p--;
6033 stringify_sharp_token_type = c;
6034 if (is_hor_space[*p]) {
6035 stringify_sharp_token_type = c + 1;
6036 p++;
6037 SKIP_WHITE_SPACE (p);
6038 }
6039 if (! is_idstart[*p] || nargs == 0)
6040 error ("`#' operator is not followed by a macro argument name");
6041 else
6042 stringify = p;
6043 }
6044 break;
6045 }
6046 } else {
6047 /* In -traditional mode, recognize arguments inside strings and
6048 and character constants, and ignore special properties of #.
6049 Arguments inside strings are considered "stringified", but no
6050 extra quote marks are supplied. */
6051 switch (c) {
6052 case '\'':
6053 case '\"':
6054 if (expected_delimiter != '\0') {
6055 if (c == expected_delimiter)
6056 expected_delimiter = '\0';
6057 } else
6058 expected_delimiter = c;
6059 break;
6060
6061 case '\\':
6062 /* Backslash quotes delimiters and itself, but not macro args. */
6063 if (expected_delimiter != 0 && p < limit
6064 && (*p == expected_delimiter || *p == '\\')) {
6065 *exp_p++ = *p++;
6066 continue;
6067 }
6068 break;
6069
6070 case '/':
6071 if (expected_delimiter != '\0') /* No comments inside strings. */
6072 break;
6073 if (*p == '*') {
6074 /* If we find a comment that wasn't removed by handle_directive,
6075 this must be -traditional. So replace the comment with
6076 nothing at all. */
6077 exp_p--;
6078 p += 1;
6079 while (p < limit && !(p[-2] == '*' && p[-1] == '/'))
6080 p++;
6081 #if 0
6082 /* Mark this as a concatenation-point, as if it had been ##. */
6083 concat = p;
6084 #endif
6085 }
6086 break;
6087 }
6088 }
6089
6090 /* Handle the start of a symbol. */
6091 if (is_idchar[c] && nargs > 0) {
6092 U_CHAR *id_beg = p - 1;
6093 int id_len;
6094
6095 --exp_p;
6096 while (p != limit && is_idchar[*p]) p++;
6097 id_len = p - id_beg;
6098
6099 if (is_idstart[c]) {
6100 register struct arglist *arg;
6101
6102 for (arg = arglist; arg != NULL; arg = arg->next) {
6103 struct reflist *tpat;
6104
6105 if (arg->name[0] == c
6106 && arg->length == id_len
6107 && bcmp (arg->name, id_beg, id_len) == 0) {
6108 enum sharp_token_type tpat_stringify;
6109 if (expected_delimiter) {
6110 if (warn_stringify) {
6111 if (traditional) {
6112 warning ("macro argument `%.*s' is stringified.",
6113 id_len, arg->name);
6114 } else {
6115 warning ("macro arg `%.*s' would be stringified with -traditional.",
6116 id_len, arg->name);
6117 }
6118 }
6119 /* If ANSI, don't actually substitute inside a string. */
6120 if (!traditional)
6121 break;
6122 tpat_stringify = SHARP_TOKEN;
6123 } else {
6124 tpat_stringify
6125 = (stringify == id_beg
6126 ? stringify_sharp_token_type : NO_SHARP_TOKEN);
6127 }
6128 /* make a pat node for this arg and append it to the end of
6129 the pat list */
6130 tpat = (struct reflist *) xmalloc (sizeof (struct reflist));
6131 tpat->next = NULL;
6132 tpat->raw_before
6133 = concat == id_beg ? concat_sharp_token_type : NO_SHARP_TOKEN;
6134 tpat->raw_after = NO_SHARP_TOKEN;
6135 tpat->rest_args = arg->rest_args;
6136 tpat->stringify = tpat_stringify;
6137
6138 if (endpat == NULL)
6139 defn->pattern = tpat;
6140 else
6141 endpat->next = tpat;
6142 endpat = tpat;
6143
6144 tpat->argno = arg->argno;
6145 tpat->nchars = exp_p - lastp;
6146 {
6147 register U_CHAR *p1 = p;
6148 SKIP_WHITE_SPACE (p1);
6149 if (p1[0]=='#'
6150 ? p1[1]=='#'
6151 : p1[0]=='%' && p1[1]==':' && p1[2]=='%' && p1[3]==':')
6152 tpat->raw_after = p1[0] + (p != p1);
6153 }
6154 lastp = exp_p; /* place to start copying from next time */
6155 skipped_arg = 1;
6156 break;
6157 }
6158 }
6159 }
6160
6161 /* If this was not a macro arg, copy it into the expansion. */
6162 if (! skipped_arg) {
6163 register U_CHAR *lim1 = p;
6164 p = id_beg;
6165 while (p != lim1)
6166 *exp_p++ = *p++;
6167 if (stringify == id_beg)
6168 error ("`#' operator should be followed by a macro argument name");
6169 }
6170 }
6171 }
6172
6173 if (!traditional && expected_delimiter == 0) {
6174 /* If ANSI, put in a newline-space marker to prevent token pasting.
6175 But not if "inside a string" (which in ANSI mode happens only for
6176 -D option). */
6177 *exp_p++ = '\n';
6178 *exp_p++ = ' ';
6179 }
6180
6181 *exp_p = '\0';
6182
6183 defn->length = exp_p - defn->expansion;
6184
6185 /* Crash now if we overrun the allocated size. */
6186 if (defn->length + 1 > maxsize)
6187 abort ();
6188
6189 #if 0
6190 /* This isn't worth the time it takes. */
6191 /* give back excess storage */
6192 defn->expansion = (U_CHAR *) xrealloc (defn->expansion, defn->length + 1);
6193 #endif
6194
6195 return defn;
6196 }
6197 \f
6198 static int
6199 do_assert (buf, limit, op, keyword)
6200 U_CHAR *buf, *limit;
6201 FILE_BUF *op;
6202 struct directive *keyword;
6203 {
6204 U_CHAR *bp; /* temp ptr into input buffer */
6205 U_CHAR *symname; /* remember where symbol name starts */
6206 int sym_length; /* and how long it is */
6207 struct arglist *tokens = NULL;
6208
6209 if (pedantic && done_initializing && !instack[indepth].system_header_p)
6210 pedwarn ("ANSI C does not allow `#assert'");
6211
6212 bp = buf;
6213
6214 while (is_hor_space[*bp])
6215 bp++;
6216
6217 symname = bp; /* remember where it starts */
6218 sym_length = check_macro_name (bp, "assertion");
6219 bp += sym_length;
6220 /* #define doesn't do this, but we should. */
6221 SKIP_WHITE_SPACE (bp);
6222
6223 /* Lossage will occur if identifiers or control tokens are broken
6224 across lines using backslash. This is not the right place to take
6225 care of that. */
6226
6227 if (*bp != '(') {
6228 error ("missing token-sequence in `#assert'");
6229 return 1;
6230 }
6231
6232 {
6233 int error_flag = 0;
6234
6235 bp++; /* skip '(' */
6236 SKIP_WHITE_SPACE (bp);
6237
6238 tokens = read_token_list (&bp, limit, &error_flag);
6239 if (error_flag)
6240 return 1;
6241 if (tokens == 0) {
6242 error ("empty token-sequence in `#assert'");
6243 return 1;
6244 }
6245
6246 ++bp; /* skip paren */
6247 SKIP_WHITE_SPACE (bp);
6248 }
6249
6250 /* If this name isn't already an assertion name, make it one.
6251 Error if it was already in use in some other way. */
6252
6253 {
6254 ASSERTION_HASHNODE *hp;
6255 int hashcode = hashf (symname, sym_length, ASSERTION_HASHSIZE);
6256 struct tokenlist_list *value
6257 = (struct tokenlist_list *) xmalloc (sizeof (struct tokenlist_list));
6258
6259 hp = assertion_lookup (symname, sym_length, hashcode);
6260 if (hp == NULL) {
6261 if (sym_length == 7 && ! bcmp (symname, "defined", 7))
6262 error ("`defined' redefined as assertion");
6263 hp = assertion_install (symname, sym_length, hashcode);
6264 }
6265
6266 /* Add the spec'd token-sequence to the list of such. */
6267 value->tokens = tokens;
6268 value->next = hp->value;
6269 hp->value = value;
6270 }
6271
6272 return 0;
6273 }
6274 \f
6275 static int
6276 do_unassert (buf, limit, op, keyword)
6277 U_CHAR *buf, *limit;
6278 FILE_BUF *op;
6279 struct directive *keyword;
6280 {
6281 U_CHAR *bp; /* temp ptr into input buffer */
6282 U_CHAR *symname; /* remember where symbol name starts */
6283 int sym_length; /* and how long it is */
6284
6285 struct arglist *tokens = NULL;
6286 int tokens_specified = 0;
6287
6288 if (pedantic && done_initializing && !instack[indepth].system_header_p)
6289 pedwarn ("ANSI C does not allow `#unassert'");
6290
6291 bp = buf;
6292
6293 while (is_hor_space[*bp])
6294 bp++;
6295
6296 symname = bp; /* remember where it starts */
6297 sym_length = check_macro_name (bp, "assertion");
6298 bp += sym_length;
6299 /* #define doesn't do this, but we should. */
6300 SKIP_WHITE_SPACE (bp);
6301
6302 /* Lossage will occur if identifiers or control tokens are broken
6303 across lines using backslash. This is not the right place to take
6304 care of that. */
6305
6306 if (*bp == '(') {
6307 int error_flag = 0;
6308
6309 bp++; /* skip '(' */
6310 SKIP_WHITE_SPACE (bp);
6311
6312 tokens = read_token_list (&bp, limit, &error_flag);
6313 if (error_flag)
6314 return 1;
6315 if (tokens == 0) {
6316 error ("empty token list in `#unassert'");
6317 return 1;
6318 }
6319
6320 tokens_specified = 1;
6321
6322 ++bp; /* skip paren */
6323 SKIP_WHITE_SPACE (bp);
6324 }
6325
6326 {
6327 ASSERTION_HASHNODE *hp;
6328 int hashcode = hashf (symname, sym_length, ASSERTION_HASHSIZE);
6329 struct tokenlist_list *tail, *prev;
6330
6331 hp = assertion_lookup (symname, sym_length, hashcode);
6332 if (hp == NULL)
6333 return 1;
6334
6335 /* If no token list was specified, then eliminate this assertion
6336 entirely. */
6337 if (! tokens_specified) {
6338 struct tokenlist_list *next;
6339 for (tail = hp->value; tail; tail = next) {
6340 next = tail->next;
6341 free_token_list (tail->tokens);
6342 free (tail);
6343 }
6344 delete_assertion (hp);
6345 } else {
6346 /* If a list of tokens was given, then delete any matching list. */
6347
6348 tail = hp->value;
6349 prev = 0;
6350 while (tail) {
6351 struct tokenlist_list *next = tail->next;
6352 if (compare_token_lists (tail->tokens, tokens)) {
6353 if (prev)
6354 prev->next = next;
6355 else
6356 hp->value = tail->next;
6357 free_token_list (tail->tokens);
6358 free (tail);
6359 } else {
6360 prev = tail;
6361 }
6362 tail = next;
6363 }
6364 }
6365 }
6366
6367 return 0;
6368 }
6369 \f
6370 /* Test whether there is an assertion named NAME
6371 and optionally whether it has an asserted token list TOKENS.
6372 NAME is not null terminated; its length is SYM_LENGTH.
6373 If TOKENS_SPECIFIED is 0, then don't check for any token list. */
6374
6375 int
6376 check_assertion (name, sym_length, tokens_specified, tokens)
6377 U_CHAR *name;
6378 int sym_length;
6379 int tokens_specified;
6380 struct arglist *tokens;
6381 {
6382 ASSERTION_HASHNODE *hp;
6383 int hashcode = hashf (name, sym_length, ASSERTION_HASHSIZE);
6384
6385 if (pedantic && !instack[indepth].system_header_p)
6386 pedwarn ("ANSI C does not allow testing assertions");
6387
6388 hp = assertion_lookup (name, sym_length, hashcode);
6389 if (hp == NULL)
6390 /* It is not an assertion; just return false. */
6391 return 0;
6392
6393 /* If no token list was specified, then value is 1. */
6394 if (! tokens_specified)
6395 return 1;
6396
6397 {
6398 struct tokenlist_list *tail;
6399
6400 tail = hp->value;
6401
6402 /* If a list of tokens was given,
6403 then succeed if the assertion records a matching list. */
6404
6405 while (tail) {
6406 if (compare_token_lists (tail->tokens, tokens))
6407 return 1;
6408 tail = tail->next;
6409 }
6410
6411 /* Fail if the assertion has no matching list. */
6412 return 0;
6413 }
6414 }
6415
6416 /* Compare two lists of tokens for equality including order of tokens. */
6417
6418 static int
6419 compare_token_lists (l1, l2)
6420 struct arglist *l1, *l2;
6421 {
6422 while (l1 && l2) {
6423 if (l1->length != l2->length)
6424 return 0;
6425 if (bcmp (l1->name, l2->name, l1->length))
6426 return 0;
6427 l1 = l1->next;
6428 l2 = l2->next;
6429 }
6430
6431 /* Succeed if both lists end at the same time. */
6432 return l1 == l2;
6433 }
6434 \f
6435 /* Read a space-separated list of tokens ending in a close parenthesis.
6436 Return a list of strings, in the order they were written.
6437 (In case of error, return 0 and store -1 in *ERROR_FLAG.)
6438 Parse the text starting at *BPP, and update *BPP.
6439 Don't parse beyond LIMIT. */
6440
6441 static struct arglist *
6442 read_token_list (bpp, limit, error_flag)
6443 U_CHAR **bpp;
6444 U_CHAR *limit;
6445 int *error_flag;
6446 {
6447 struct arglist *token_ptrs = 0;
6448 U_CHAR *bp = *bpp;
6449 int depth = 1;
6450
6451 *error_flag = 0;
6452
6453 /* Loop over the assertion value tokens. */
6454 while (depth > 0) {
6455 struct arglist *temp;
6456 int eofp = 0;
6457 U_CHAR *beg = bp;
6458
6459 /* Find the end of the token. */
6460 if (*bp == '(') {
6461 bp++;
6462 depth++;
6463 } else if (*bp == ')') {
6464 depth--;
6465 if (depth == 0)
6466 break;
6467 bp++;
6468 } else if (*bp == '"' || *bp == '\'')
6469 bp = skip_quoted_string (bp, limit, 0, NULL_PTR, NULL_PTR, &eofp);
6470 else
6471 while (! is_hor_space[*bp] && *bp != '(' && *bp != ')'
6472 && *bp != '"' && *bp != '\'' && bp != limit)
6473 bp++;
6474
6475 temp = (struct arglist *) xmalloc (sizeof (struct arglist));
6476 temp->name = (U_CHAR *) xmalloc (bp - beg + 1);
6477 bcopy ((char *) beg, (char *) temp->name, bp - beg);
6478 temp->name[bp - beg] = 0;
6479 temp->next = token_ptrs;
6480 token_ptrs = temp;
6481 temp->length = bp - beg;
6482
6483 SKIP_WHITE_SPACE (bp);
6484
6485 if (bp >= limit) {
6486 error ("unterminated token sequence in `#assert' or `#unassert'");
6487 *error_flag = -1;
6488 return 0;
6489 }
6490 }
6491 *bpp = bp;
6492
6493 /* We accumulated the names in reverse order.
6494 Now reverse them to get the proper order. */
6495 {
6496 register struct arglist *prev = 0, *this, *next;
6497 for (this = token_ptrs; this; this = next) {
6498 next = this->next;
6499 this->next = prev;
6500 prev = this;
6501 }
6502 return prev;
6503 }
6504 }
6505
6506 static void
6507 free_token_list (tokens)
6508 struct arglist *tokens;
6509 {
6510 while (tokens) {
6511 struct arglist *next = tokens->next;
6512 free (tokens->name);
6513 free (tokens);
6514 tokens = next;
6515 }
6516 }
6517 \f
6518 /*
6519 * Install a name in the assertion hash table.
6520 *
6521 * If LEN is >= 0, it is the length of the name.
6522 * Otherwise, compute the length by scanning the entire name.
6523 *
6524 * If HASH is >= 0, it is the precomputed hash code.
6525 * Otherwise, compute the hash code.
6526 */
6527 static ASSERTION_HASHNODE *
6528 assertion_install (name, len, hash)
6529 U_CHAR *name;
6530 int len;
6531 int hash;
6532 {
6533 register ASSERTION_HASHNODE *hp;
6534 register int i, bucket;
6535 register U_CHAR *p, *q;
6536
6537 i = sizeof (ASSERTION_HASHNODE) + len + 1;
6538 hp = (ASSERTION_HASHNODE *) xmalloc (i);
6539 bucket = hash;
6540 hp->bucket_hdr = &assertion_hashtab[bucket];
6541 hp->next = assertion_hashtab[bucket];
6542 assertion_hashtab[bucket] = hp;
6543 hp->prev = NULL;
6544 if (hp->next != NULL)
6545 hp->next->prev = hp;
6546 hp->length = len;
6547 hp->value = 0;
6548 hp->name = ((U_CHAR *) hp) + sizeof (ASSERTION_HASHNODE);
6549 p = hp->name;
6550 q = name;
6551 for (i = 0; i < len; i++)
6552 *p++ = *q++;
6553 hp->name[len] = 0;
6554 return hp;
6555 }
6556
6557 /*
6558 * find the most recent hash node for name name (ending with first
6559 * non-identifier char) installed by install
6560 *
6561 * If LEN is >= 0, it is the length of the name.
6562 * Otherwise, compute the length by scanning the entire name.
6563 *
6564 * If HASH is >= 0, it is the precomputed hash code.
6565 * Otherwise, compute the hash code.
6566 */
6567 static ASSERTION_HASHNODE *
6568 assertion_lookup (name, len, hash)
6569 U_CHAR *name;
6570 int len;
6571 int hash;
6572 {
6573 register ASSERTION_HASHNODE *bucket;
6574
6575 bucket = assertion_hashtab[hash];
6576 while (bucket) {
6577 if (bucket->length == len && bcmp (bucket->name, name, len) == 0)
6578 return bucket;
6579 bucket = bucket->next;
6580 }
6581 return NULL;
6582 }
6583
6584 static void
6585 delete_assertion (hp)
6586 ASSERTION_HASHNODE *hp;
6587 {
6588
6589 if (hp->prev != NULL)
6590 hp->prev->next = hp->next;
6591 if (hp->next != NULL)
6592 hp->next->prev = hp->prev;
6593
6594 /* make sure that the bucket chain header that
6595 the deleted guy was on points to the right thing afterwards. */
6596 if (hp == *hp->bucket_hdr)
6597 *hp->bucket_hdr = hp->next;
6598
6599 free (hp);
6600 }
6601 \f
6602 /*
6603 * interpret #line directive. Remembers previously seen fnames
6604 * in its very own hash table.
6605 */
6606 #define FNAME_HASHSIZE 37
6607
6608 static int
6609 do_line (buf, limit, op, keyword)
6610 U_CHAR *buf, *limit;
6611 FILE_BUF *op;
6612 struct directive *keyword;
6613 {
6614 register U_CHAR *bp;
6615 FILE_BUF *ip = &instack[indepth];
6616 FILE_BUF tem;
6617 int new_lineno;
6618 enum file_change_code file_change = same_file;
6619
6620 /* Expand any macros. */
6621 tem = expand_to_temp_buffer (buf, limit, 0, 0);
6622
6623 /* Point to macroexpanded line, which is null-terminated now. */
6624 bp = tem.buf;
6625 SKIP_WHITE_SPACE (bp);
6626
6627 if (!isdigit (*bp)) {
6628 error ("invalid format `#line' directive");
6629 return 0;
6630 }
6631
6632 /* The Newline at the end of this line remains to be processed.
6633 To put the next line at the specified line number,
6634 we must store a line number now that is one less. */
6635 new_lineno = atoi ((char *) bp) - 1;
6636
6637 /* NEW_LINENO is one less than the actual line number here. */
6638 if (pedantic && new_lineno < 0)
6639 pedwarn ("line number out of range in `#line' directive");
6640
6641 /* skip over the line number. */
6642 while (isdigit (*bp))
6643 bp++;
6644
6645 #if 0 /* #line 10"foo.c" is supposed to be allowed. */
6646 if (*bp && !is_space[*bp]) {
6647 error ("invalid format `#line' directive");
6648 return;
6649 }
6650 #endif
6651
6652 SKIP_WHITE_SPACE (bp);
6653
6654 if (*bp == '\"') {
6655 static HASHNODE *fname_table[FNAME_HASHSIZE];
6656 HASHNODE *hp, **hash_bucket;
6657 U_CHAR *fname, *p;
6658 int fname_length;
6659
6660 fname = ++bp;
6661
6662 /* Turn the file name, which is a character string literal,
6663 into a null-terminated string. Do this in place. */
6664 p = bp;
6665 for (;;)
6666 switch ((*p++ = *bp++)) {
6667 case '\0':
6668 error ("invalid format `#line' directive");
6669 return 0;
6670
6671 case '\\':
6672 {
6673 char *bpc = (char *) bp;
6674 int c = parse_escape (&bpc);
6675 bp = (U_CHAR *) bpc;
6676 if (c < 0)
6677 p--;
6678 else
6679 p[-1] = c;
6680 }
6681 break;
6682
6683 case '\"':
6684 p[-1] = 0;
6685 goto fname_done;
6686 }
6687 fname_done:
6688 fname_length = p - fname;
6689
6690 SKIP_WHITE_SPACE (bp);
6691 if (*bp) {
6692 if (pedantic)
6693 pedwarn ("garbage at end of `#line' directive");
6694 if (*bp == '1')
6695 file_change = enter_file;
6696 else if (*bp == '2')
6697 file_change = leave_file;
6698 else if (*bp == '3')
6699 ip->system_header_p = 1;
6700 else if (*bp == '4')
6701 ip->system_header_p = 2;
6702 else {
6703 error ("invalid format `#line' directive");
6704 return 0;
6705 }
6706
6707 bp++;
6708 SKIP_WHITE_SPACE (bp);
6709 if (*bp == '3') {
6710 ip->system_header_p = 1;
6711 bp++;
6712 SKIP_WHITE_SPACE (bp);
6713 }
6714 if (*bp == '4') {
6715 ip->system_header_p = 2;
6716 bp++;
6717 SKIP_WHITE_SPACE (bp);
6718 }
6719 if (*bp) {
6720 error ("invalid format `#line' directive");
6721 return 0;
6722 }
6723 }
6724
6725 hash_bucket =
6726 &fname_table[hashf (fname, fname_length, FNAME_HASHSIZE)];
6727 for (hp = *hash_bucket; hp != NULL; hp = hp->next)
6728 if (hp->length == fname_length &&
6729 bcmp (hp->value.cpval, fname, fname_length) == 0) {
6730 ip->nominal_fname = hp->value.cpval;
6731 break;
6732 }
6733 if (hp == 0) {
6734 /* Didn't find it; cons up a new one. */
6735 hp = (HASHNODE *) xcalloc (1, sizeof (HASHNODE) + fname_length + 1);
6736 hp->next = *hash_bucket;
6737 *hash_bucket = hp;
6738
6739 hp->length = fname_length;
6740 ip->nominal_fname = hp->value.cpval = ((char *) hp) + sizeof (HASHNODE);
6741 bcopy (fname, hp->value.cpval, fname_length);
6742 }
6743 } else if (*bp) {
6744 error ("invalid format `#line' directive");
6745 return 0;
6746 }
6747
6748 ip->lineno = new_lineno;
6749 output_line_directive (ip, op, 0, file_change);
6750 check_expand (op, ip->length - (ip->bufp - ip->buf));
6751 return 0;
6752 }
6753
6754 /*
6755 * remove the definition of a symbol from the symbol table.
6756 * according to un*x /lib/cpp, it is not an error to undef
6757 * something that has no definitions, so it isn't one here either.
6758 */
6759
6760 static int
6761 do_undef (buf, limit, op, keyword)
6762 U_CHAR *buf, *limit;
6763 FILE_BUF *op;
6764 struct directive *keyword;
6765 {
6766 int sym_length;
6767 HASHNODE *hp;
6768 U_CHAR *orig_buf = buf;
6769
6770 /* If this is a precompiler run (with -pcp) pass thru #undef directives. */
6771 if (pcp_outfile && op)
6772 pass_thru_directive (buf, limit, op, keyword);
6773
6774 SKIP_WHITE_SPACE (buf);
6775 sym_length = check_macro_name (buf, "macro");
6776
6777 while ((hp = lookup (buf, sym_length, -1)) != NULL) {
6778 /* If we are generating additional info for debugging (with -g) we
6779 need to pass through all effective #undef directives. */
6780 if (debug_output && op)
6781 pass_thru_directive (orig_buf, limit, op, keyword);
6782 if (hp->type != T_MACRO)
6783 warning ("undefining `%s'", hp->name);
6784 delete_macro (hp);
6785 }
6786
6787 if (pedantic) {
6788 buf += sym_length;
6789 SKIP_WHITE_SPACE (buf);
6790 if (buf != limit)
6791 pedwarn ("garbage after `#undef' directive");
6792 }
6793 return 0;
6794 }
6795 \f
6796 /*
6797 * Report an error detected by the program we are processing.
6798 * Use the text of the line in the error message.
6799 * (We use error because it prints the filename & line#.)
6800 */
6801
6802 static int
6803 do_error (buf, limit, op, keyword)
6804 U_CHAR *buf, *limit;
6805 FILE_BUF *op;
6806 struct directive *keyword;
6807 {
6808 int length = limit - buf;
6809 U_CHAR *copy = (U_CHAR *) xmalloc (length + 1);
6810 bcopy ((char *) buf, (char *) copy, length);
6811 copy[length] = 0;
6812 SKIP_WHITE_SPACE (copy);
6813 error ("#error %s", copy);
6814 return 0;
6815 }
6816
6817 /*
6818 * Report a warning detected by the program we are processing.
6819 * Use the text of the line in the warning message, then continue.
6820 * (We use error because it prints the filename & line#.)
6821 */
6822
6823 static int
6824 do_warning (buf, limit, op, keyword)
6825 U_CHAR *buf, *limit;
6826 FILE_BUF *op;
6827 struct directive *keyword;
6828 {
6829 int length = limit - buf;
6830 U_CHAR *copy = (U_CHAR *) xmalloc (length + 1);
6831 bcopy ((char *) buf, (char *) copy, length);
6832 copy[length] = 0;
6833 SKIP_WHITE_SPACE (copy);
6834 warning ("#warning %s", copy);
6835 return 0;
6836 }
6837
6838 /* Remember the name of the current file being read from so that we can
6839 avoid ever including it again. */
6840
6841 static void
6842 do_once ()
6843 {
6844 int i;
6845 FILE_BUF *ip = NULL;
6846
6847 for (i = indepth; i >= 0; i--)
6848 if (instack[i].fname != NULL) {
6849 ip = &instack[i];
6850 break;
6851 }
6852
6853 if (ip != NULL) {
6854 struct file_name_list *new;
6855
6856 new = (struct file_name_list *) xmalloc (sizeof (struct file_name_list));
6857 new->next = dont_repeat_files;
6858 dont_repeat_files = new;
6859 new->fname = savestring (ip->fname);
6860 new->control_macro = 0;
6861 new->got_name_map = 0;
6862 new->c_system_include_path = 0;
6863 }
6864 }
6865
6866 /* #ident has already been copied to the output file, so just ignore it. */
6867
6868 static int
6869 do_ident (buf, limit, op, keyword)
6870 U_CHAR *buf, *limit;
6871 FILE_BUF *op;
6872 struct directive *keyword;
6873 {
6874 FILE_BUF trybuf;
6875 int len;
6876
6877 /* Allow #ident in system headers, since that's not user's fault. */
6878 if (pedantic && !instack[indepth].system_header_p)
6879 pedwarn ("ANSI C does not allow `#ident'");
6880
6881 trybuf = expand_to_temp_buffer (buf, limit, 0, 0);
6882 buf = (U_CHAR *) alloca (trybuf.bufp - trybuf.buf + 1);
6883 bcopy ((char *) trybuf.buf, (char *) buf, trybuf.bufp - trybuf.buf);
6884 limit = buf + (trybuf.bufp - trybuf.buf);
6885 len = (limit - buf);
6886 free (trybuf.buf);
6887
6888 /* Output directive name. */
6889 check_expand (op, 7);
6890 bcopy ("#ident ", (char *) op->bufp, 7);
6891 op->bufp += 7;
6892
6893 /* Output the expanded argument line. */
6894 check_expand (op, len);
6895 bcopy ((char *) buf, (char *) op->bufp, len);
6896 op->bufp += len;
6897
6898 return 0;
6899 }
6900
6901 /* #pragma and its argument line have already been copied to the output file.
6902 Just check for some recognized pragmas that need validation here. */
6903
6904 static int
6905 do_pragma (buf, limit, op, keyword)
6906 U_CHAR *buf, *limit;
6907 FILE_BUF *op;
6908 struct directive *keyword;
6909 {
6910 SKIP_WHITE_SPACE (buf);
6911 if (!strncmp ((char *) buf, "once", 4)) {
6912 /* Allow #pragma once in system headers, since that's not the user's
6913 fault. */
6914 if (!instack[indepth].system_header_p)
6915 warning ("`#pragma once' is obsolete");
6916 do_once ();
6917 }
6918
6919 if (!strncmp ((char *) buf, "implementation", 14)) {
6920 /* Be quiet about `#pragma implementation' for a file only if it hasn't
6921 been included yet. */
6922 struct file_name_list *ptr;
6923 U_CHAR *p = buf + 14, *fname, *inc_fname;
6924 SKIP_WHITE_SPACE (p);
6925 if (*p == '\n' || *p != '\"')
6926 return 0;
6927
6928 fname = p + 1;
6929 if ((p = (U_CHAR *) index ((char *) fname, '\"')))
6930 *p = '\0';
6931
6932 for (ptr = all_include_files; ptr; ptr = ptr->next) {
6933 inc_fname = (U_CHAR *) rindex (ptr->fname, '/');
6934 inc_fname = inc_fname ? inc_fname + 1 : (U_CHAR *) ptr->fname;
6935 if (inc_fname && !strcmp ((char *) inc_fname, (char *) fname))
6936 warning ("`#pragma implementation' for `%s' appears after file is included",
6937 fname);
6938 }
6939 }
6940
6941 return 0;
6942 }
6943
6944 #if 0
6945 /* This was a fun hack, but #pragma seems to start to be useful.
6946 By failing to recognize it, we pass it through unchanged to cc1. */
6947
6948 /*
6949 * the behavior of the #pragma directive is implementation defined.
6950 * this implementation defines it as follows.
6951 */
6952
6953 static int
6954 do_pragma ()
6955 {
6956 close (0);
6957 if (open ("/dev/tty", O_RDONLY, 0666) != 0)
6958 goto nope;
6959 close (1);
6960 if (open ("/dev/tty", O_WRONLY, 0666) != 1)
6961 goto nope;
6962 execl ("/usr/games/hack", "#pragma", 0);
6963 execl ("/usr/games/rogue", "#pragma", 0);
6964 execl ("/usr/new/emacs", "-f", "hanoi", "9", "-kill", 0);
6965 execl ("/usr/local/emacs", "-f", "hanoi", "9", "-kill", 0);
6966 nope:
6967 fatal ("You are in a maze of twisty compiler features, all different");
6968 }
6969 #endif
6970
6971 #ifdef SCCS_DIRECTIVE
6972
6973 /* Just ignore #sccs, on systems where we define it at all. */
6974
6975 static int
6976 do_sccs (buf, limit, op, keyword)
6977 U_CHAR *buf, *limit;
6978 FILE_BUF *op;
6979 struct directive *keyword;
6980 {
6981 if (pedantic)
6982 pedwarn ("ANSI C does not allow `#sccs'");
6983 return 0;
6984 }
6985
6986 #endif /* defined (SCCS_DIRECTIVE) */
6987 \f
6988 /*
6989 * handle #if directive by
6990 * 1) inserting special `defined' keyword into the hash table
6991 * that gets turned into 0 or 1 by special_symbol (thus,
6992 * if the luser has a symbol called `defined' already, it won't
6993 * work inside the #if directive)
6994 * 2) rescan the input into a temporary output buffer
6995 * 3) pass the output buffer to the yacc parser and collect a value
6996 * 4) clean up the mess left from steps 1 and 2.
6997 * 5) call conditional_skip to skip til the next #endif (etc.),
6998 * or not, depending on the value from step 3.
6999 */
7000
7001 static int
7002 do_if (buf, limit, op, keyword)
7003 U_CHAR *buf, *limit;
7004 FILE_BUF *op;
7005 struct directive *keyword;
7006 {
7007 HOST_WIDE_INT value;
7008 FILE_BUF *ip = &instack[indepth];
7009
7010 value = eval_if_expression (buf, limit - buf);
7011 conditional_skip (ip, value == 0, T_IF, NULL_PTR, op);
7012 return 0;
7013 }
7014
7015 /*
7016 * handle a #elif directive by not changing if_stack either.
7017 * see the comment above do_else.
7018 */
7019
7020 static int
7021 do_elif (buf, limit, op, keyword)
7022 U_CHAR *buf, *limit;
7023 FILE_BUF *op;
7024 struct directive *keyword;
7025 {
7026 HOST_WIDE_INT value;
7027 FILE_BUF *ip = &instack[indepth];
7028
7029 if (if_stack == instack[indepth].if_stack) {
7030 error ("`#elif' not within a conditional");
7031 return 0;
7032 } else {
7033 if (if_stack->type != T_IF && if_stack->type != T_ELIF) {
7034 error ("`#elif' after `#else'");
7035 fprintf (stderr, " (matches line %d", if_stack->lineno);
7036 if (if_stack->fname != NULL && ip->fname != NULL &&
7037 strcmp (if_stack->fname, ip->nominal_fname) != 0)
7038 fprintf (stderr, ", file %s", if_stack->fname);
7039 fprintf (stderr, ")\n");
7040 }
7041 if_stack->type = T_ELIF;
7042 }
7043
7044 if (if_stack->if_succeeded)
7045 skip_if_group (ip, 0, op);
7046 else {
7047 value = eval_if_expression (buf, limit - buf);
7048 if (value == 0)
7049 skip_if_group (ip, 0, op);
7050 else {
7051 ++if_stack->if_succeeded; /* continue processing input */
7052 output_line_directive (ip, op, 1, same_file);
7053 }
7054 }
7055 return 0;
7056 }
7057
7058 /*
7059 * evaluate a #if expression in BUF, of length LENGTH,
7060 * then parse the result as a C expression and return the value as an int.
7061 */
7062 static HOST_WIDE_INT
7063 eval_if_expression (buf, length)
7064 U_CHAR *buf;
7065 int length;
7066 {
7067 FILE_BUF temp_obuf;
7068 HASHNODE *save_defined;
7069 HOST_WIDE_INT value;
7070
7071 save_defined = install ((U_CHAR *) "defined", -1, T_SPEC_DEFINED,
7072 NULL_PTR, -1);
7073 pcp_inside_if = 1;
7074 temp_obuf = expand_to_temp_buffer (buf, buf + length, 0, 1);
7075 pcp_inside_if = 0;
7076 delete_macro (save_defined); /* clean up special symbol */
7077
7078 value = parse_c_expression ((char *) temp_obuf.buf);
7079
7080 free (temp_obuf.buf);
7081
7082 return value;
7083 }
7084
7085 /*
7086 * routine to handle ifdef/ifndef. Try to look up the symbol,
7087 * then do or don't skip to the #endif/#else/#elif depending
7088 * on what directive is actually being processed.
7089 */
7090
7091 static int
7092 do_xifdef (buf, limit, op, keyword)
7093 U_CHAR *buf, *limit;
7094 FILE_BUF *op;
7095 struct directive *keyword;
7096 {
7097 int skip;
7098 FILE_BUF *ip = &instack[indepth];
7099 U_CHAR *end;
7100 int start_of_file = 0;
7101 U_CHAR *control_macro = 0;
7102
7103 /* Detect a #ifndef at start of file (not counting comments). */
7104 if (ip->fname != 0 && keyword->type == T_IFNDEF) {
7105 U_CHAR *p = ip->buf;
7106 while (p != directive_start) {
7107 U_CHAR c = *p++;
7108 if (is_space[c])
7109 ;
7110 /* Make no special provision for backslash-newline here; this is
7111 slower if backslash-newlines are present, but it's correct,
7112 and it's not worth it to tune for the rare backslash-newline. */
7113 else if (c == '/'
7114 && (*p == '*' || (cplusplus_comments && *p == '/'))) {
7115 /* Skip this comment. */
7116 int junk = 0;
7117 U_CHAR *save_bufp = ip->bufp;
7118 ip->bufp = p + 1;
7119 p = skip_to_end_of_comment (ip, &junk, 1);
7120 ip->bufp = save_bufp;
7121 } else {
7122 goto fail;
7123 }
7124 }
7125 /* If we get here, this conditional is the beginning of the file. */
7126 start_of_file = 1;
7127 fail: ;
7128 }
7129
7130 /* Discard leading and trailing whitespace. */
7131 SKIP_WHITE_SPACE (buf);
7132 while (limit != buf && is_hor_space[limit[-1]]) limit--;
7133
7134 /* Find the end of the identifier at the beginning. */
7135 for (end = buf; is_idchar[*end]; end++);
7136
7137 if (end == buf) {
7138 skip = (keyword->type == T_IFDEF);
7139 if (! traditional)
7140 pedwarn (end == limit ? "`#%s' with no argument"
7141 : "`#%s' argument starts with punctuation",
7142 keyword->name);
7143 } else {
7144 HASHNODE *hp;
7145
7146 if (pedantic && buf[0] >= '0' && buf[0] <= '9')
7147 pedwarn ("`#%s' argument starts with a digit", keyword->name);
7148 else if (end != limit && !traditional)
7149 pedwarn ("garbage at end of `#%s' argument", keyword->name);
7150
7151 hp = lookup (buf, end-buf, -1);
7152
7153 if (pcp_outfile) {
7154 /* Output a precondition for this macro. */
7155 if (hp &&
7156 (hp->type == T_CONST
7157 || (hp->type == T_MACRO && hp->value.defn->predefined)))
7158 fprintf (pcp_outfile, "#define %s\n", hp->name);
7159 else {
7160 U_CHAR *cp = buf;
7161 fprintf (pcp_outfile, "#undef ");
7162 while (is_idchar[*cp]) /* Ick! */
7163 fputc (*cp++, pcp_outfile);
7164 putc ('\n', pcp_outfile);
7165 }
7166 }
7167
7168 skip = (hp == NULL) ^ (keyword->type == T_IFNDEF);
7169 if (start_of_file && !skip) {
7170 control_macro = (U_CHAR *) xmalloc (end - buf + 1);
7171 bcopy ((char *) buf, (char *) control_macro, end - buf);
7172 control_macro[end - buf] = 0;
7173 }
7174 }
7175
7176 conditional_skip (ip, skip, T_IF, control_macro, op);
7177 return 0;
7178 }
7179
7180 /* Push TYPE on stack; then, if SKIP is nonzero, skip ahead.
7181 If this is a #ifndef starting at the beginning of a file,
7182 CONTROL_MACRO is the macro name tested by the #ifndef.
7183 Otherwise, CONTROL_MACRO is 0. */
7184
7185 static void
7186 conditional_skip (ip, skip, type, control_macro, op)
7187 FILE_BUF *ip;
7188 int skip;
7189 enum node_type type;
7190 U_CHAR *control_macro;
7191 FILE_BUF *op;
7192 {
7193 IF_STACK_FRAME *temp;
7194
7195 temp = (IF_STACK_FRAME *) xcalloc (1, sizeof (IF_STACK_FRAME));
7196 temp->fname = ip->nominal_fname;
7197 temp->lineno = ip->lineno;
7198 temp->next = if_stack;
7199 temp->control_macro = control_macro;
7200 if_stack = temp;
7201
7202 if_stack->type = type;
7203
7204 if (skip != 0) {
7205 skip_if_group (ip, 0, op);
7206 return;
7207 } else {
7208 ++if_stack->if_succeeded;
7209 output_line_directive (ip, &outbuf, 1, same_file);
7210 }
7211 }
7212
7213 /*
7214 * skip to #endif, #else, or #elif. adjust line numbers, etc.
7215 * leaves input ptr at the sharp sign found.
7216 * If ANY is nonzero, return at next directive of any sort.
7217 */
7218 static void
7219 skip_if_group (ip, any, op)
7220 FILE_BUF *ip;
7221 int any;
7222 FILE_BUF *op;
7223 {
7224 register U_CHAR *bp = ip->bufp, *cp;
7225 register U_CHAR *endb = ip->buf + ip->length;
7226 struct directive *kt;
7227 IF_STACK_FRAME *save_if_stack = if_stack; /* don't pop past here */
7228 U_CHAR *beg_of_line = bp;
7229 register int ident_length;
7230 U_CHAR *ident, *after_ident;
7231 /* Save info about where the group starts. */
7232 U_CHAR *beg_of_group = bp;
7233 int beg_lineno = ip->lineno;
7234
7235 if (output_conditionals && op != 0) {
7236 char *ptr = "#failed\n";
7237 int len = strlen (ptr);
7238
7239 if (op->bufp > op->buf && op->bufp[-1] != '\n')
7240 {
7241 *op->bufp++ = '\n';
7242 op->lineno++;
7243 }
7244 check_expand (op, len);
7245 bcopy (ptr, (char *) op->bufp, len);
7246 op->bufp += len;
7247 op->lineno++;
7248 output_line_directive (ip, op, 1, 0);
7249 }
7250
7251 while (bp < endb) {
7252 switch (*bp++) {
7253 case '/': /* possible comment */
7254 if (*bp == '\\' && bp[1] == '\n')
7255 newline_fix (bp);
7256 if (*bp == '*'
7257 || (cplusplus_comments && *bp == '/')) {
7258 ip->bufp = ++bp;
7259 bp = skip_to_end_of_comment (ip, &ip->lineno, 0);
7260 }
7261 break;
7262 case '\"':
7263 case '\'':
7264 bp = skip_quoted_string (bp - 1, endb, ip->lineno, &ip->lineno,
7265 NULL_PTR, NULL_PTR);
7266 break;
7267 case '\\':
7268 /* Char after backslash loses its special meaning. */
7269 if (bp < endb) {
7270 if (*bp == '\n')
7271 ++ip->lineno; /* But do update the line-count. */
7272 bp++;
7273 }
7274 break;
7275 case '\n':
7276 ++ip->lineno;
7277 beg_of_line = bp;
7278 break;
7279 case '%':
7280 if (beg_of_line == 0 || traditional)
7281 break;
7282 ip->bufp = bp - 1;
7283 while (bp[0] == '\\' && bp[1] == '\n')
7284 bp += 2;
7285 if (*bp == ':')
7286 goto sharp_token;
7287 break;
7288 case '#':
7289 /* # keyword: a # must be first nonblank char on the line */
7290 if (beg_of_line == 0)
7291 break;
7292 ip->bufp = bp - 1;
7293 sharp_token:
7294 /* Scan from start of line, skipping whitespace, comments
7295 and backslash-newlines, and see if we reach this #.
7296 If not, this # is not special. */
7297 bp = beg_of_line;
7298 /* If -traditional, require # to be at beginning of line. */
7299 if (!traditional) {
7300 while (1) {
7301 if (is_hor_space[*bp])
7302 bp++;
7303 else if (*bp == '\\' && bp[1] == '\n')
7304 bp += 2;
7305 else if (*bp == '/' && bp[1] == '*') {
7306 bp += 2;
7307 while (!(*bp == '*' && bp[1] == '/'))
7308 bp++;
7309 bp += 2;
7310 }
7311 /* There is no point in trying to deal with C++ // comments here,
7312 because if there is one, then this # must be part of the
7313 comment and we would never reach here. */
7314 else break;
7315 }
7316 }
7317 if (bp != ip->bufp) {
7318 bp = ip->bufp + 1; /* Reset bp to after the #. */
7319 break;
7320 }
7321
7322 bp = ip->bufp + 1; /* Point after the '#' */
7323 if (ip->bufp[0] == '%') {
7324 /* Skip past the ':' again. */
7325 while (*bp == '\\') {
7326 ip->lineno++;
7327 bp += 2;
7328 }
7329 bp++;
7330 }
7331
7332 /* Skip whitespace and \-newline. */
7333 while (1) {
7334 if (is_hor_space[*bp])
7335 bp++;
7336 else if (*bp == '\\' && bp[1] == '\n')
7337 bp += 2;
7338 else if (*bp == '/' && bp[1] == '*') {
7339 bp += 2;
7340 while (!(*bp == '*' && bp[1] == '/')) {
7341 if (*bp == '\n')
7342 ip->lineno++;
7343 bp++;
7344 }
7345 bp += 2;
7346 } else if (cplusplus_comments && *bp == '/' && bp[1] == '/') {
7347 bp += 2;
7348 while (bp[-1] == '\\' || *bp != '\n') {
7349 if (*bp == '\n')
7350 ip->lineno++;
7351 bp++;
7352 }
7353 }
7354 else break;
7355 }
7356
7357 cp = bp;
7358
7359 /* Now find end of directive name.
7360 If we encounter a backslash-newline, exchange it with any following
7361 symbol-constituents so that we end up with a contiguous name. */
7362
7363 while (1) {
7364 if (is_idchar[*bp])
7365 bp++;
7366 else {
7367 if (*bp == '\\' && bp[1] == '\n')
7368 name_newline_fix (bp);
7369 if (is_idchar[*bp])
7370 bp++;
7371 else break;
7372 }
7373 }
7374 ident_length = bp - cp;
7375 ident = cp;
7376 after_ident = bp;
7377
7378 /* A line of just `#' becomes blank. */
7379
7380 if (ident_length == 0 && *after_ident == '\n') {
7381 continue;
7382 }
7383
7384 if (ident_length == 0 || !is_idstart[*ident]) {
7385 U_CHAR *p = ident;
7386 while (is_idchar[*p]) {
7387 if (*p < '0' || *p > '9')
7388 break;
7389 p++;
7390 }
7391 /* Handle # followed by a line number. */
7392 if (p != ident && !is_idchar[*p]) {
7393 if (pedantic)
7394 pedwarn ("`#' followed by integer");
7395 continue;
7396 }
7397
7398 /* Avoid error for `###' and similar cases unless -pedantic. */
7399 if (p == ident) {
7400 while (*p == '#' || is_hor_space[*p]) p++;
7401 if (*p == '\n') {
7402 if (pedantic && !lang_asm)
7403 pedwarn ("invalid preprocessing directive");
7404 continue;
7405 }
7406 }
7407
7408 if (!lang_asm && pedantic)
7409 pedwarn ("invalid preprocessing directive name");
7410 continue;
7411 }
7412
7413 for (kt = directive_table; kt->length >= 0; kt++) {
7414 IF_STACK_FRAME *temp;
7415 if (ident_length == kt->length
7416 && bcmp (cp, kt->name, kt->length) == 0) {
7417 /* If we are asked to return on next directive, do so now. */
7418 if (any)
7419 goto done;
7420
7421 switch (kt->type) {
7422 case T_IF:
7423 case T_IFDEF:
7424 case T_IFNDEF:
7425 temp = (IF_STACK_FRAME *) xcalloc (1, sizeof (IF_STACK_FRAME));
7426 temp->next = if_stack;
7427 if_stack = temp;
7428 temp->lineno = ip->lineno;
7429 temp->fname = ip->nominal_fname;
7430 temp->type = kt->type;
7431 break;
7432 case T_ELSE:
7433 case T_ENDIF:
7434 if (pedantic && if_stack != save_if_stack)
7435 validate_else (bp);
7436 case T_ELIF:
7437 if (if_stack == instack[indepth].if_stack) {
7438 error ("`#%s' not within a conditional", kt->name);
7439 break;
7440 }
7441 else if (if_stack == save_if_stack)
7442 goto done; /* found what we came for */
7443
7444 if (kt->type != T_ENDIF) {
7445 if (if_stack->type == T_ELSE)
7446 error ("`#else' or `#elif' after `#else'");
7447 if_stack->type = kt->type;
7448 break;
7449 }
7450
7451 temp = if_stack;
7452 if_stack = if_stack->next;
7453 free (temp);
7454 break;
7455
7456 default:
7457 break;
7458 }
7459 break;
7460 }
7461 }
7462 /* Don't let erroneous code go by. */
7463 if (kt->length < 0 && !lang_asm && pedantic)
7464 pedwarn ("invalid preprocessing directive name");
7465 }
7466 }
7467
7468 ip->bufp = bp;
7469 /* after this returns, rescan will exit because ip->bufp
7470 now points to the end of the buffer.
7471 rescan is responsible for the error message also. */
7472
7473 done:
7474 if (output_conditionals && op != 0) {
7475 char *ptr = "#endfailed\n";
7476 int len = strlen (ptr);
7477
7478 if (op->bufp > op->buf && op->bufp[-1] != '\n')
7479 {
7480 *op->bufp++ = '\n';
7481 op->lineno++;
7482 }
7483 check_expand (op, beg_of_line - beg_of_group);
7484 bcopy ((char *) beg_of_group, (char *) op->bufp,
7485 beg_of_line - beg_of_group);
7486 op->bufp += beg_of_line - beg_of_group;
7487 op->lineno += ip->lineno - beg_lineno;
7488 check_expand (op, len);
7489 bcopy (ptr, (char *) op->bufp, len);
7490 op->bufp += len;
7491 op->lineno++;
7492 }
7493 }
7494
7495 /*
7496 * handle a #else directive. Do this by just continuing processing
7497 * without changing if_stack ; this is so that the error message
7498 * for missing #endif's etc. will point to the original #if. It
7499 * is possible that something different would be better.
7500 */
7501
7502 static int
7503 do_else (buf, limit, op, keyword)
7504 U_CHAR *buf, *limit;
7505 FILE_BUF *op;
7506 struct directive *keyword;
7507 {
7508 FILE_BUF *ip = &instack[indepth];
7509
7510 if (pedantic) {
7511 SKIP_WHITE_SPACE (buf);
7512 if (buf != limit)
7513 pedwarn ("text following `#else' violates ANSI standard");
7514 }
7515
7516 if (if_stack == instack[indepth].if_stack) {
7517 error ("`#else' not within a conditional");
7518 return 0;
7519 } else {
7520 /* #ifndef can't have its special treatment for containing the whole file
7521 if it has a #else clause. */
7522 if_stack->control_macro = 0;
7523
7524 if (if_stack->type != T_IF && if_stack->type != T_ELIF) {
7525 error ("`#else' after `#else'");
7526 fprintf (stderr, " (matches line %d", if_stack->lineno);
7527 if (strcmp (if_stack->fname, ip->nominal_fname) != 0)
7528 fprintf (stderr, ", file %s", if_stack->fname);
7529 fprintf (stderr, ")\n");
7530 }
7531 if_stack->type = T_ELSE;
7532 }
7533
7534 if (if_stack->if_succeeded)
7535 skip_if_group (ip, 0, op);
7536 else {
7537 ++if_stack->if_succeeded; /* continue processing input */
7538 output_line_directive (ip, op, 1, same_file);
7539 }
7540 return 0;
7541 }
7542
7543 /*
7544 * unstack after #endif directive
7545 */
7546
7547 static int
7548 do_endif (buf, limit, op, keyword)
7549 U_CHAR *buf, *limit;
7550 FILE_BUF *op;
7551 struct directive *keyword;
7552 {
7553 if (pedantic) {
7554 SKIP_WHITE_SPACE (buf);
7555 if (buf != limit)
7556 pedwarn ("text following `#endif' violates ANSI standard");
7557 }
7558
7559 if (if_stack == instack[indepth].if_stack)
7560 error ("unbalanced `#endif'");
7561 else {
7562 IF_STACK_FRAME *temp = if_stack;
7563 if_stack = if_stack->next;
7564 if (temp->control_macro != 0) {
7565 /* This #endif matched a #ifndef at the start of the file.
7566 See if it is at the end of the file. */
7567 FILE_BUF *ip = &instack[indepth];
7568 U_CHAR *p = ip->bufp;
7569 U_CHAR *ep = ip->buf + ip->length;
7570
7571 while (p != ep) {
7572 U_CHAR c = *p++;
7573 if (!is_space[c]) {
7574 if (c == '/'
7575 && (*p == '*' || (cplusplus_comments && *p == '/'))) {
7576 /* Skip this comment. */
7577 int junk = 0;
7578 U_CHAR *save_bufp = ip->bufp;
7579 ip->bufp = p + 1;
7580 p = skip_to_end_of_comment (ip, &junk, 1);
7581 ip->bufp = save_bufp;
7582 } else
7583 goto fail;
7584 }
7585 }
7586 /* If we get here, this #endif ends a #ifndef
7587 that contains all of the file (aside from whitespace).
7588 Arrange not to include the file again
7589 if the macro that was tested is defined.
7590
7591 Do not do this for the top-level file in a -include or any
7592 file in a -imacros. */
7593 if (indepth != 0
7594 && ! (indepth == 1 && no_record_file)
7595 && ! (no_record_file && no_output))
7596 record_control_macro (ip->fname, temp->control_macro);
7597 fail: ;
7598 }
7599 free (temp);
7600 output_line_directive (&instack[indepth], op, 1, same_file);
7601 }
7602 return 0;
7603 }
7604
7605 /* When an #else or #endif is found while skipping failed conditional,
7606 if -pedantic was specified, this is called to warn about text after
7607 the directive name. P points to the first char after the directive name. */
7608
7609 static void
7610 validate_else (p)
7611 register U_CHAR *p;
7612 {
7613 /* Advance P over whitespace and comments. */
7614 while (1) {
7615 if (*p == '\\' && p[1] == '\n')
7616 p += 2;
7617 if (is_hor_space[*p])
7618 p++;
7619 else if (*p == '/') {
7620 if (p[1] == '\\' && p[2] == '\n')
7621 newline_fix (p + 1);
7622 if (p[1] == '*') {
7623 p += 2;
7624 /* Don't bother warning about unterminated comments
7625 since that will happen later. Just be sure to exit. */
7626 while (*p) {
7627 if (p[1] == '\\' && p[2] == '\n')
7628 newline_fix (p + 1);
7629 if (*p == '*' && p[1] == '/') {
7630 p += 2;
7631 break;
7632 }
7633 p++;
7634 }
7635 }
7636 else if (cplusplus_comments && p[1] == '/') {
7637 p += 2;
7638 while (*p && (*p != '\n' || p[-1] == '\\'))
7639 p++;
7640 }
7641 } else break;
7642 }
7643 if (*p && *p != '\n')
7644 pedwarn ("text following `#else' or `#endif' violates ANSI standard");
7645 }
7646 \f
7647 /* Skip a comment, assuming the input ptr immediately follows the
7648 initial slash-star. Bump *LINE_COUNTER for each newline.
7649 (The canonical line counter is &ip->lineno.)
7650 Don't use this routine (or the next one) if bumping the line
7651 counter is not sufficient to deal with newlines in the string.
7652
7653 If NOWARN is nonzero, don't warn about slash-star inside a comment.
7654 This feature is useful when processing a comment that is going to be
7655 processed or was processed at another point in the preprocessor,
7656 to avoid a duplicate warning. Likewise for unterminated comment errors. */
7657
7658 static U_CHAR *
7659 skip_to_end_of_comment (ip, line_counter, nowarn)
7660 register FILE_BUF *ip;
7661 int *line_counter; /* place to remember newlines, or NULL */
7662 int nowarn;
7663 {
7664 register U_CHAR *limit = ip->buf + ip->length;
7665 register U_CHAR *bp = ip->bufp;
7666 FILE_BUF *op = &outbuf; /* JF */
7667 int output = put_out_comments && !line_counter;
7668 int start_line = line_counter ? *line_counter : 0;
7669
7670 /* JF this line_counter stuff is a crock to make sure the
7671 comment is only put out once, no matter how many times
7672 the comment is skipped. It almost works */
7673 if (output) {
7674 *op->bufp++ = '/';
7675 *op->bufp++ = '*';
7676 }
7677 if (cplusplus_comments && bp[-1] == '/') {
7678 if (output) {
7679 while (bp < limit) {
7680 *op->bufp++ = *bp;
7681 if (*bp == '\n' && bp[-1] != '\\')
7682 break;
7683 if (*bp == '\n') {
7684 ++*line_counter;
7685 ++op->lineno;
7686 }
7687 bp++;
7688 }
7689 op->bufp[-1] = '*';
7690 *op->bufp++ = '/';
7691 *op->bufp++ = '\n';
7692 } else {
7693 while (bp < limit) {
7694 if (bp[-1] != '\\' && *bp == '\n') {
7695 break;
7696 } else {
7697 if (*bp == '\n' && line_counter)
7698 ++*line_counter;
7699 bp++;
7700 }
7701 }
7702 }
7703 ip->bufp = bp;
7704 return bp;
7705 }
7706 while (bp < limit) {
7707 if (output)
7708 *op->bufp++ = *bp;
7709 switch (*bp++) {
7710 case '/':
7711 if (warn_comments && !nowarn && bp < limit && *bp == '*')
7712 warning ("`/*' within comment");
7713 break;
7714 case '\n':
7715 /* If this is the end of the file, we have an unterminated comment.
7716 Don't swallow the newline. We are guaranteed that there will be a
7717 trailing newline and various pieces assume it's there. */
7718 if (bp == limit)
7719 {
7720 --bp;
7721 --limit;
7722 break;
7723 }
7724 if (line_counter != NULL)
7725 ++*line_counter;
7726 if (output)
7727 ++op->lineno;
7728 break;
7729 case '*':
7730 if (*bp == '\\' && bp[1] == '\n')
7731 newline_fix (bp);
7732 if (*bp == '/') {
7733 if (output)
7734 *op->bufp++ = '/';
7735 ip->bufp = ++bp;
7736 return bp;
7737 }
7738 break;
7739 }
7740 }
7741
7742 if (!nowarn)
7743 error_with_line (line_for_error (start_line), "unterminated comment");
7744 ip->bufp = bp;
7745 return bp;
7746 }
7747
7748 /*
7749 * Skip over a quoted string. BP points to the opening quote.
7750 * Returns a pointer after the closing quote. Don't go past LIMIT.
7751 * START_LINE is the line number of the starting point (but it need
7752 * not be valid if the starting point is inside a macro expansion).
7753 *
7754 * The input stack state is not changed.
7755 *
7756 * If COUNT_NEWLINES is nonzero, it points to an int to increment
7757 * for each newline passed.
7758 *
7759 * If BACKSLASH_NEWLINES_P is nonzero, store 1 thru it
7760 * if we pass a backslash-newline.
7761 *
7762 * If EOFP is nonzero, set *EOFP to 1 if the string is unterminated.
7763 */
7764 static U_CHAR *
7765 skip_quoted_string (bp, limit, start_line, count_newlines, backslash_newlines_p, eofp)
7766 register U_CHAR *bp;
7767 register U_CHAR *limit;
7768 int start_line;
7769 int *count_newlines;
7770 int *backslash_newlines_p;
7771 int *eofp;
7772 {
7773 register U_CHAR c, match;
7774
7775 match = *bp++;
7776 while (1) {
7777 if (bp >= limit) {
7778 error_with_line (line_for_error (start_line),
7779 "unterminated string or character constant");
7780 error_with_line (multiline_string_line,
7781 "possible real start of unterminated constant");
7782 multiline_string_line = 0;
7783 if (eofp)
7784 *eofp = 1;
7785 break;
7786 }
7787 c = *bp++;
7788 if (c == '\\') {
7789 while (*bp == '\\' && bp[1] == '\n') {
7790 if (backslash_newlines_p)
7791 *backslash_newlines_p = 1;
7792 if (count_newlines)
7793 ++*count_newlines;
7794 bp += 2;
7795 }
7796 if (*bp == '\n' && count_newlines) {
7797 if (backslash_newlines_p)
7798 *backslash_newlines_p = 1;
7799 ++*count_newlines;
7800 }
7801 bp++;
7802 } else if (c == '\n') {
7803 if (traditional) {
7804 /* Unterminated strings and character constants are 'valid'. */
7805 bp--; /* Don't consume the newline. */
7806 if (eofp)
7807 *eofp = 1;
7808 break;
7809 }
7810 if (pedantic || match == '\'') {
7811 error_with_line (line_for_error (start_line),
7812 "unterminated string or character constant");
7813 bp--;
7814 if (eofp)
7815 *eofp = 1;
7816 break;
7817 }
7818 /* If not traditional, then allow newlines inside strings. */
7819 if (count_newlines)
7820 ++*count_newlines;
7821 if (multiline_string_line == 0)
7822 multiline_string_line = start_line;
7823 } else if (c == match)
7824 break;
7825 }
7826 return bp;
7827 }
7828
7829 /* Place into DST a quoted string representing the string SRC.
7830 Return the address of DST's terminating null. */
7831 static char *
7832 quote_string (dst, src)
7833 char *dst, *src;
7834 {
7835 U_CHAR c;
7836
7837 *dst++ = '\"';
7838 for (;;)
7839 switch ((c = *src++))
7840 {
7841 default:
7842 if (isprint (c))
7843 *dst++ = c;
7844 else
7845 {
7846 sprintf (dst, "\\%03o", c);
7847 dst += 4;
7848 }
7849 break;
7850
7851 case '\"':
7852 case '\\':
7853 *dst++ = '\\';
7854 *dst++ = c;
7855 break;
7856
7857 case '\0':
7858 *dst++ = '\"';
7859 *dst = '\0';
7860 return dst;
7861 }
7862 }
7863
7864 /* Skip across a group of balanced parens, starting from IP->bufp.
7865 IP->bufp is updated. Use this with IP->bufp pointing at an open-paren.
7866
7867 This does not handle newlines, because it's used for the arg of #if,
7868 where there aren't any newlines. Also, backslash-newline can't appear. */
7869
7870 static U_CHAR *
7871 skip_paren_group (ip)
7872 register FILE_BUF *ip;
7873 {
7874 U_CHAR *limit = ip->buf + ip->length;
7875 U_CHAR *p = ip->bufp;
7876 int depth = 0;
7877 int lines_dummy = 0;
7878
7879 while (p != limit) {
7880 int c = *p++;
7881 switch (c) {
7882 case '(':
7883 depth++;
7884 break;
7885
7886 case ')':
7887 depth--;
7888 if (depth == 0)
7889 return ip->bufp = p;
7890 break;
7891
7892 case '/':
7893 if (*p == '*') {
7894 ip->bufp = p;
7895 p = skip_to_end_of_comment (ip, &lines_dummy, 0);
7896 p = ip->bufp;
7897 }
7898
7899 case '"':
7900 case '\'':
7901 {
7902 int eofp = 0;
7903 p = skip_quoted_string (p - 1, limit, 0, NULL_PTR, NULL_PTR, &eofp);
7904 if (eofp)
7905 return ip->bufp = p;
7906 }
7907 break;
7908 }
7909 }
7910
7911 ip->bufp = p;
7912 return p;
7913 }
7914 \f
7915 /*
7916 * write out a #line directive, for instance, after an #include file.
7917 * If CONDITIONAL is nonzero, we can omit the #line if it would
7918 * appear to be a no-op, and we can output a few newlines instead
7919 * if we want to increase the line number by a small amount.
7920 * FILE_CHANGE says whether we are entering a file, leaving, or neither.
7921 */
7922
7923 static void
7924 output_line_directive (ip, op, conditional, file_change)
7925 FILE_BUF *ip, *op;
7926 int conditional;
7927 enum file_change_code file_change;
7928 {
7929 int len;
7930 char *line_directive_buf, *line_end;
7931
7932 if (no_line_directives
7933 || ip->fname == NULL
7934 || no_output) {
7935 op->lineno = ip->lineno;
7936 return;
7937 }
7938
7939 if (conditional) {
7940 if (ip->lineno == op->lineno)
7941 return;
7942
7943 /* If the inherited line number is a little too small,
7944 output some newlines instead of a #line directive. */
7945 if (ip->lineno > op->lineno && ip->lineno < op->lineno + 8) {
7946 check_expand (op, 10);
7947 while (ip->lineno > op->lineno) {
7948 *op->bufp++ = '\n';
7949 op->lineno++;
7950 }
7951 return;
7952 }
7953 }
7954
7955 /* Don't output a line number of 0 if we can help it. */
7956 if (ip->lineno == 0 && ip->bufp - ip->buf < ip->length
7957 && *ip->bufp == '\n') {
7958 ip->lineno++;
7959 ip->bufp++;
7960 }
7961
7962 line_directive_buf = (char *) alloca (4 * strlen (ip->nominal_fname) + 100);
7963 sprintf (line_directive_buf, "# %d ", ip->lineno);
7964 line_end = quote_string (line_directive_buf + strlen (line_directive_buf),
7965 ip->nominal_fname);
7966 if (file_change != same_file) {
7967 *line_end++ = ' ';
7968 *line_end++ = file_change == enter_file ? '1' : '2';
7969 }
7970 /* Tell cc1 if following text comes from a system header file. */
7971 if (ip->system_header_p) {
7972 *line_end++ = ' ';
7973 *line_end++ = '3';
7974 }
7975 #ifndef NO_IMPLICIT_EXTERN_C
7976 /* Tell cc1plus if following text should be treated as C. */
7977 if (ip->system_header_p == 2 && cplusplus) {
7978 *line_end++ = ' ';
7979 *line_end++ = '4';
7980 }
7981 #endif
7982 *line_end++ = '\n';
7983 len = line_end - line_directive_buf;
7984 check_expand (op, len + 1);
7985 if (op->bufp > op->buf && op->bufp[-1] != '\n')
7986 *op->bufp++ = '\n';
7987 bcopy ((char *) line_directive_buf, (char *) op->bufp, len);
7988 op->bufp += len;
7989 op->lineno = ip->lineno;
7990 }
7991 \f
7992 /* This structure represents one parsed argument in a macro call.
7993 `raw' points to the argument text as written (`raw_length' is its length).
7994 `expanded' points to the argument's macro-expansion
7995 (its length is `expand_length').
7996 `stringified_length' is the length the argument would have
7997 if stringified.
7998 `use_count' is the number of times this macro arg is substituted
7999 into the macro. If the actual use count exceeds 10,
8000 the value stored is 10.
8001 `free1' and `free2', if nonzero, point to blocks to be freed
8002 when the macro argument data is no longer needed. */
8003
8004 struct argdata {
8005 U_CHAR *raw, *expanded;
8006 int raw_length, expand_length;
8007 int stringified_length;
8008 U_CHAR *free1, *free2;
8009 char newlines;
8010 char use_count;
8011 };
8012
8013 /* Expand a macro call.
8014 HP points to the symbol that is the macro being called.
8015 Put the result of expansion onto the input stack
8016 so that subsequent input by our caller will use it.
8017
8018 If macro wants arguments, caller has already verified that
8019 an argument list follows; arguments come from the input stack. */
8020
8021 static void
8022 macroexpand (hp, op)
8023 HASHNODE *hp;
8024 FILE_BUF *op;
8025 {
8026 int nargs;
8027 DEFINITION *defn = hp->value.defn;
8028 register U_CHAR *xbuf;
8029 int xbuf_len;
8030 int start_line = instack[indepth].lineno;
8031 int rest_args, rest_zero;
8032
8033 CHECK_DEPTH (return;);
8034
8035 /* it might not actually be a macro. */
8036 if (hp->type != T_MACRO) {
8037 special_symbol (hp, op);
8038 return;
8039 }
8040
8041 /* This macro is being used inside a #if, which means it must be */
8042 /* recorded as a precondition. */
8043 if (pcp_inside_if && pcp_outfile && defn->predefined)
8044 dump_single_macro (hp, pcp_outfile);
8045
8046 nargs = defn->nargs;
8047
8048 if (nargs >= 0) {
8049 register int i;
8050 struct argdata *args;
8051 char *parse_error = 0;
8052
8053 args = (struct argdata *) alloca ((nargs + 1) * sizeof (struct argdata));
8054
8055 for (i = 0; i < nargs; i++) {
8056 args[i].raw = (U_CHAR *) "";
8057 args[i].expanded = 0;
8058 args[i].raw_length = args[i].expand_length
8059 = args[i].stringified_length = 0;
8060 args[i].free1 = args[i].free2 = 0;
8061 args[i].use_count = 0;
8062 }
8063
8064 /* Parse all the macro args that are supplied. I counts them.
8065 The first NARGS args are stored in ARGS.
8066 The rest are discarded.
8067 If rest_args is set then we assume macarg absorbed the rest of the args.
8068 */
8069 i = 0;
8070 rest_args = 0;
8071 do {
8072 /* Discard the open-parenthesis or comma before the next arg. */
8073 ++instack[indepth].bufp;
8074 if (rest_args)
8075 continue;
8076 if (i < nargs || (nargs == 0 && i == 0)) {
8077 /* if we are working on last arg which absorbs rest of args... */
8078 if (i == nargs - 1 && defn->rest_args)
8079 rest_args = 1;
8080 parse_error = macarg (&args[i], rest_args);
8081 }
8082 else
8083 parse_error = macarg (NULL_PTR, 0);
8084 if (parse_error) {
8085 error_with_line (line_for_error (start_line), parse_error);
8086 break;
8087 }
8088 i++;
8089 } while (*instack[indepth].bufp != ')');
8090
8091 /* If we got one arg but it was just whitespace, call that 0 args. */
8092 if (i == 1) {
8093 register U_CHAR *bp = args[0].raw;
8094 register U_CHAR *lim = bp + args[0].raw_length;
8095 /* cpp.texi says for foo ( ) we provide one argument.
8096 However, if foo wants just 0 arguments, treat this as 0. */
8097 if (nargs == 0)
8098 while (bp != lim && is_space[*bp]) bp++;
8099 if (bp == lim)
8100 i = 0;
8101 }
8102
8103 /* Don't output an error message if we have already output one for
8104 a parse error above. */
8105 rest_zero = 0;
8106 if (nargs == 0 && i > 0) {
8107 if (! parse_error)
8108 error ("arguments given to macro `%s'", hp->name);
8109 } else if (i < nargs) {
8110 /* traditional C allows foo() if foo wants one argument. */
8111 if (nargs == 1 && i == 0 && traditional)
8112 ;
8113 /* the rest args token is allowed to absorb 0 tokens */
8114 else if (i == nargs - 1 && defn->rest_args)
8115 rest_zero = 1;
8116 else if (parse_error)
8117 ;
8118 else if (i == 0)
8119 error ("macro `%s' used without args", hp->name);
8120 else if (i == 1)
8121 error ("macro `%s' used with just one arg", hp->name);
8122 else
8123 error ("macro `%s' used with only %d args", hp->name, i);
8124 } else if (i > nargs) {
8125 if (! parse_error)
8126 error ("macro `%s' used with too many (%d) args", hp->name, i);
8127 }
8128
8129 /* Swallow the closeparen. */
8130 ++instack[indepth].bufp;
8131
8132 /* If macro wants zero args, we parsed the arglist for checking only.
8133 Read directly from the macro definition. */
8134 if (nargs == 0) {
8135 xbuf = defn->expansion;
8136 xbuf_len = defn->length;
8137 } else {
8138 register U_CHAR *exp = defn->expansion;
8139 register int offset; /* offset in expansion,
8140 copied a piece at a time */
8141 register int totlen; /* total amount of exp buffer filled so far */
8142
8143 register struct reflist *ap, *last_ap;
8144
8145 /* Macro really takes args. Compute the expansion of this call. */
8146
8147 /* Compute length in characters of the macro's expansion.
8148 Also count number of times each arg is used. */
8149 xbuf_len = defn->length;
8150 for (ap = defn->pattern; ap != NULL; ap = ap->next) {
8151 if (ap->stringify)
8152 xbuf_len += args[ap->argno].stringified_length;
8153 else if (ap->raw_before != 0 || ap->raw_after != 0 || traditional)
8154 /* Add 4 for two newline-space markers to prevent
8155 token concatenation. */
8156 xbuf_len += args[ap->argno].raw_length + 4;
8157 else {
8158 /* We have an ordinary (expanded) occurrence of the arg.
8159 So compute its expansion, if we have not already. */
8160 if (args[ap->argno].expanded == 0) {
8161 FILE_BUF obuf;
8162 obuf = expand_to_temp_buffer (args[ap->argno].raw,
8163 args[ap->argno].raw + args[ap->argno].raw_length,
8164 1, 0);
8165
8166 args[ap->argno].expanded = obuf.buf;
8167 args[ap->argno].expand_length = obuf.length;
8168 args[ap->argno].free2 = obuf.buf;
8169 }
8170
8171 /* Add 4 for two newline-space markers to prevent
8172 token concatenation. */
8173 xbuf_len += args[ap->argno].expand_length + 4;
8174 }
8175 if (args[ap->argno].use_count < 10)
8176 args[ap->argno].use_count++;
8177 }
8178
8179 xbuf = (U_CHAR *) xmalloc (xbuf_len + 1);
8180
8181 /* Generate in XBUF the complete expansion
8182 with arguments substituted in.
8183 TOTLEN is the total size generated so far.
8184 OFFSET is the index in the definition
8185 of where we are copying from. */
8186 offset = totlen = 0;
8187 for (last_ap = NULL, ap = defn->pattern; ap != NULL;
8188 last_ap = ap, ap = ap->next) {
8189 register struct argdata *arg = &args[ap->argno];
8190 int count_before = totlen;
8191
8192 /* Add chars to XBUF. */
8193 for (i = 0; i < ap->nchars; i++, offset++)
8194 xbuf[totlen++] = exp[offset];
8195
8196 /* If followed by an empty rest arg with concatenation,
8197 delete the last run of nonwhite chars. */
8198 if (rest_zero && totlen > count_before
8199 && ((ap->rest_args && ap->raw_before != 0)
8200 || (last_ap != NULL && last_ap->rest_args
8201 && last_ap->raw_after != 0))) {
8202 /* Delete final whitespace. */
8203 while (totlen > count_before && is_space[xbuf[totlen - 1]]) {
8204 totlen--;
8205 }
8206
8207 /* Delete the nonwhites before them. */
8208 while (totlen > count_before && ! is_space[xbuf[totlen - 1]]) {
8209 totlen--;
8210 }
8211 }
8212
8213 if (ap->stringify != 0) {
8214 int arglen = arg->raw_length;
8215 int escaped = 0;
8216 int in_string = 0;
8217 int c;
8218 i = 0;
8219 while (i < arglen
8220 && (c = arg->raw[i], is_space[c]))
8221 i++;
8222 while (i < arglen
8223 && (c = arg->raw[arglen - 1], is_space[c]))
8224 arglen--;
8225 if (!traditional)
8226 xbuf[totlen++] = '\"'; /* insert beginning quote */
8227 for (; i < arglen; i++) {
8228 c = arg->raw[i];
8229
8230 /* Special markers Newline Space
8231 generate nothing for a stringified argument. */
8232 if (c == '\n' && arg->raw[i+1] != '\n') {
8233 i++;
8234 continue;
8235 }
8236
8237 /* Internal sequences of whitespace are replaced by one space
8238 except within an string or char token. */
8239 if (! in_string
8240 && (c == '\n' ? arg->raw[i+1] == '\n' : is_space[c])) {
8241 while (1) {
8242 /* Note that Newline Space does occur within whitespace
8243 sequences; consider it part of the sequence. */
8244 if (c == '\n' && is_space[arg->raw[i+1]])
8245 i += 2;
8246 else if (c != '\n' && is_space[c])
8247 i++;
8248 else break;
8249 c = arg->raw[i];
8250 }
8251 i--;
8252 c = ' ';
8253 }
8254
8255 if (escaped)
8256 escaped = 0;
8257 else {
8258 if (c == '\\')
8259 escaped = 1;
8260 if (in_string) {
8261 if (c == in_string)
8262 in_string = 0;
8263 } else if (c == '\"' || c == '\'')
8264 in_string = c;
8265 }
8266
8267 /* Escape these chars */
8268 if (c == '\"' || (in_string && c == '\\'))
8269 xbuf[totlen++] = '\\';
8270 if (isprint (c))
8271 xbuf[totlen++] = c;
8272 else {
8273 sprintf ((char *) &xbuf[totlen], "\\%03o", (unsigned int) c);
8274 totlen += 4;
8275 }
8276 }
8277 if (!traditional)
8278 xbuf[totlen++] = '\"'; /* insert ending quote */
8279 } else if (ap->raw_before != 0 || ap->raw_after != 0 || traditional) {
8280 U_CHAR *p1 = arg->raw;
8281 U_CHAR *l1 = p1 + arg->raw_length;
8282 if (ap->raw_before != 0) {
8283 while (p1 != l1 && is_space[*p1]) p1++;
8284 while (p1 != l1 && is_idchar[*p1])
8285 xbuf[totlen++] = *p1++;
8286 /* Delete any no-reexpansion marker that follows
8287 an identifier at the beginning of the argument
8288 if the argument is concatenated with what precedes it. */
8289 if (p1[0] == '\n' && p1[1] == '-')
8290 p1 += 2;
8291 } else if (!traditional) {
8292 /* Ordinary expanded use of the argument.
8293 Put in newline-space markers to prevent token pasting. */
8294 xbuf[totlen++] = '\n';
8295 xbuf[totlen++] = ' ';
8296 }
8297 if (ap->raw_after != 0) {
8298 /* Arg is concatenated after: delete trailing whitespace,
8299 whitespace markers, and no-reexpansion markers. */
8300 while (p1 != l1) {
8301 if (is_space[l1[-1]]) l1--;
8302 else if (l1[-1] == '-') {
8303 U_CHAR *p2 = l1 - 1;
8304 /* If a `-' is preceded by an odd number of newlines then it
8305 and the last newline are a no-reexpansion marker. */
8306 while (p2 != p1 && p2[-1] == '\n') p2--;
8307 if ((l1 - 1 - p2) & 1) {
8308 l1 -= 2;
8309 }
8310 else break;
8311 }
8312 else break;
8313 }
8314 }
8315
8316 bcopy ((char *) p1, (char *) (xbuf + totlen), l1 - p1);
8317 totlen += l1 - p1;
8318 if (!traditional && ap->raw_after == 0) {
8319 /* Ordinary expanded use of the argument.
8320 Put in newline-space markers to prevent token pasting. */
8321 xbuf[totlen++] = '\n';
8322 xbuf[totlen++] = ' ';
8323 }
8324 } else {
8325 /* Ordinary expanded use of the argument.
8326 Put in newline-space markers to prevent token pasting. */
8327 if (!traditional) {
8328 xbuf[totlen++] = '\n';
8329 xbuf[totlen++] = ' ';
8330 }
8331 bcopy ((char *) arg->expanded, (char *) (xbuf + totlen),
8332 arg->expand_length);
8333 totlen += arg->expand_length;
8334 if (!traditional) {
8335 xbuf[totlen++] = '\n';
8336 xbuf[totlen++] = ' ';
8337 }
8338 /* If a macro argument with newlines is used multiple times,
8339 then only expand the newlines once. This avoids creating output
8340 lines which don't correspond to any input line, which confuses
8341 gdb and gcov. */
8342 if (arg->use_count > 1 && arg->newlines > 0) {
8343 /* Don't bother doing change_newlines for subsequent
8344 uses of arg. */
8345 arg->use_count = 1;
8346 arg->expand_length
8347 = change_newlines (arg->expanded, arg->expand_length);
8348 }
8349 }
8350
8351 if (totlen > xbuf_len)
8352 abort ();
8353 }
8354
8355 /* if there is anything left of the definition
8356 after handling the arg list, copy that in too. */
8357
8358 for (i = offset; i < defn->length; i++) {
8359 /* if we've reached the end of the macro */
8360 if (exp[i] == ')')
8361 rest_zero = 0;
8362 if (! (rest_zero && last_ap != NULL && last_ap->rest_args
8363 && last_ap->raw_after != 0))
8364 xbuf[totlen++] = exp[i];
8365 }
8366
8367 xbuf[totlen] = 0;
8368 xbuf_len = totlen;
8369
8370 for (i = 0; i < nargs; i++) {
8371 if (args[i].free1 != 0)
8372 free (args[i].free1);
8373 if (args[i].free2 != 0)
8374 free (args[i].free2);
8375 }
8376 }
8377 } else {
8378 xbuf = defn->expansion;
8379 xbuf_len = defn->length;
8380 }
8381
8382 /* Now put the expansion on the input stack
8383 so our caller will commence reading from it. */
8384 {
8385 register FILE_BUF *ip2;
8386
8387 ip2 = &instack[++indepth];
8388
8389 ip2->fname = 0;
8390 ip2->nominal_fname = 0;
8391 /* This may not be exactly correct, but will give much better error
8392 messages for nested macro calls than using a line number of zero. */
8393 ip2->lineno = start_line;
8394 ip2->buf = xbuf;
8395 ip2->length = xbuf_len;
8396 ip2->bufp = xbuf;
8397 ip2->free_ptr = (nargs > 0) ? xbuf : 0;
8398 ip2->macro = hp;
8399 ip2->if_stack = if_stack;
8400 ip2->system_header_p = 0;
8401
8402 /* Recursive macro use sometimes works traditionally.
8403 #define foo(x,y) bar (x (y,0), y)
8404 foo (foo, baz) */
8405
8406 if (!traditional)
8407 hp->type = T_DISABLED;
8408 }
8409 }
8410 \f
8411 /*
8412 * Parse a macro argument and store the info on it into *ARGPTR.
8413 * REST_ARGS is passed to macarg1 to make it absorb the rest of the args.
8414 * Return nonzero to indicate a syntax error.
8415 */
8416
8417 static char *
8418 macarg (argptr, rest_args)
8419 register struct argdata *argptr;
8420 int rest_args;
8421 {
8422 FILE_BUF *ip = &instack[indepth];
8423 int paren = 0;
8424 int newlines = 0;
8425 int comments = 0;
8426 char *result = 0;
8427
8428 /* Try to parse as much of the argument as exists at this
8429 input stack level. */
8430 U_CHAR *bp = macarg1 (ip->bufp, ip->buf + ip->length,
8431 &paren, &newlines, &comments, rest_args);
8432
8433 /* If we find the end of the argument at this level,
8434 set up *ARGPTR to point at it in the input stack. */
8435 if (!(ip->fname != 0 && (newlines != 0 || comments != 0))
8436 && bp != ip->buf + ip->length) {
8437 if (argptr != 0) {
8438 argptr->raw = ip->bufp;
8439 argptr->raw_length = bp - ip->bufp;
8440 argptr->newlines = newlines;
8441 }
8442 ip->bufp = bp;
8443 } else {
8444 /* This input stack level ends before the macro argument does.
8445 We must pop levels and keep parsing.
8446 Therefore, we must allocate a temporary buffer and copy
8447 the macro argument into it. */
8448 int bufsize = bp - ip->bufp;
8449 int extra = newlines;
8450 U_CHAR *buffer = (U_CHAR *) xmalloc (bufsize + extra + 1);
8451 int final_start = 0;
8452
8453 bcopy ((char *) ip->bufp, (char *) buffer, bufsize);
8454 ip->bufp = bp;
8455 ip->lineno += newlines;
8456
8457 while (bp == ip->buf + ip->length) {
8458 if (instack[indepth].macro == 0) {
8459 result = "unterminated macro call";
8460 break;
8461 }
8462 ip->macro->type = T_MACRO;
8463 if (ip->free_ptr)
8464 free (ip->free_ptr);
8465 ip = &instack[--indepth];
8466 newlines = 0;
8467 comments = 0;
8468 bp = macarg1 (ip->bufp, ip->buf + ip->length, &paren,
8469 &newlines, &comments, rest_args);
8470 final_start = bufsize;
8471 bufsize += bp - ip->bufp;
8472 extra += newlines;
8473 buffer = (U_CHAR *) xrealloc (buffer, bufsize + extra + 1);
8474 bcopy ((char *) ip->bufp, (char *) (buffer + bufsize - (bp - ip->bufp)),
8475 bp - ip->bufp);
8476 ip->bufp = bp;
8477 ip->lineno += newlines;
8478 }
8479
8480 /* Now, if arg is actually wanted, record its raw form,
8481 discarding comments and duplicating newlines in whatever
8482 part of it did not come from a macro expansion.
8483 EXTRA space has been preallocated for duplicating the newlines.
8484 FINAL_START is the index of the start of that part. */
8485 if (argptr != 0) {
8486 argptr->raw = buffer;
8487 argptr->raw_length = bufsize;
8488 argptr->free1 = buffer;
8489 argptr->newlines = newlines;
8490 if ((newlines || comments) && ip->fname != 0)
8491 argptr->raw_length
8492 = final_start +
8493 discard_comments (argptr->raw + final_start,
8494 argptr->raw_length - final_start,
8495 newlines);
8496 argptr->raw[argptr->raw_length] = 0;
8497 if (argptr->raw_length > bufsize + extra)
8498 abort ();
8499 }
8500 }
8501
8502 /* If we are not discarding this argument,
8503 macroexpand it and compute its length as stringified.
8504 All this info goes into *ARGPTR. */
8505
8506 if (argptr != 0) {
8507 register U_CHAR *buf, *lim;
8508 register int totlen;
8509
8510 buf = argptr->raw;
8511 lim = buf + argptr->raw_length;
8512
8513 while (buf != lim && is_space[*buf])
8514 buf++;
8515 while (buf != lim && is_space[lim[-1]])
8516 lim--;
8517 totlen = traditional ? 0 : 2; /* Count opening and closing quote. */
8518 while (buf != lim) {
8519 register U_CHAR c = *buf++;
8520 totlen++;
8521 /* Internal sequences of whitespace are replaced by one space
8522 in most cases, but not always. So count all the whitespace
8523 in case we need to keep it all. */
8524 #if 0
8525 if (is_space[c])
8526 SKIP_ALL_WHITE_SPACE (buf);
8527 else
8528 #endif
8529 if (c == '\"' || c == '\\') /* escape these chars */
8530 totlen++;
8531 else if (!isprint (c))
8532 totlen += 3;
8533 }
8534 argptr->stringified_length = totlen;
8535 }
8536 return result;
8537 }
8538 \f
8539 /* Scan text from START (inclusive) up to LIMIT (exclusive),
8540 counting parens in *DEPTHPTR,
8541 and return if reach LIMIT
8542 or before a `)' that would make *DEPTHPTR negative
8543 or before a comma when *DEPTHPTR is zero.
8544 Single and double quotes are matched and termination
8545 is inhibited within them. Comments also inhibit it.
8546 Value returned is pointer to stopping place.
8547
8548 Increment *NEWLINES each time a newline is passed.
8549 REST_ARGS notifies macarg1 that it should absorb the rest of the args.
8550 Set *COMMENTS to 1 if a comment is seen. */
8551
8552 static U_CHAR *
8553 macarg1 (start, limit, depthptr, newlines, comments, rest_args)
8554 U_CHAR *start;
8555 register U_CHAR *limit;
8556 int *depthptr, *newlines, *comments;
8557 int rest_args;
8558 {
8559 register U_CHAR *bp = start;
8560
8561 while (bp < limit) {
8562 switch (*bp) {
8563 case '(':
8564 (*depthptr)++;
8565 break;
8566 case ')':
8567 if (--(*depthptr) < 0)
8568 return bp;
8569 break;
8570 case '\\':
8571 /* Traditionally, backslash makes following char not special. */
8572 if (bp + 1 < limit && traditional)
8573 {
8574 bp++;
8575 /* But count source lines anyway. */
8576 if (*bp == '\n')
8577 ++*newlines;
8578 }
8579 break;
8580 case '\n':
8581 ++*newlines;
8582 break;
8583 case '/':
8584 if (bp[1] == '\\' && bp[2] == '\n')
8585 newline_fix (bp + 1);
8586 if (cplusplus_comments && bp[1] == '/') {
8587 *comments = 1;
8588 bp += 2;
8589 while (bp < limit && (*bp != '\n' || bp[-1] == '\\')) {
8590 if (*bp == '\n') ++*newlines;
8591 bp++;
8592 }
8593 /* Now count the newline that we are about to skip. */
8594 ++*newlines;
8595 break;
8596 }
8597 if (bp[1] != '*' || bp + 1 >= limit)
8598 break;
8599 *comments = 1;
8600 bp += 2;
8601 while (bp + 1 < limit) {
8602 if (bp[0] == '*'
8603 && bp[1] == '\\' && bp[2] == '\n')
8604 newline_fix (bp + 1);
8605 if (bp[0] == '*' && bp[1] == '/')
8606 break;
8607 if (*bp == '\n') ++*newlines;
8608 bp++;
8609 }
8610 break;
8611 case '\'':
8612 case '\"':
8613 {
8614 int quotec;
8615 for (quotec = *bp++; bp + 1 < limit && *bp != quotec; bp++) {
8616 if (*bp == '\\') {
8617 bp++;
8618 if (*bp == '\n')
8619 ++*newlines;
8620 while (*bp == '\\' && bp[1] == '\n') {
8621 bp += 2;
8622 }
8623 } else if (*bp == '\n') {
8624 ++*newlines;
8625 if (quotec == '\'')
8626 break;
8627 }
8628 }
8629 }
8630 break;
8631 case ',':
8632 /* if we've returned to lowest level and we aren't absorbing all args */
8633 if ((*depthptr) == 0 && rest_args == 0)
8634 return bp;
8635 break;
8636 }
8637 bp++;
8638 }
8639
8640 return bp;
8641 }
8642 \f
8643 /* Discard comments and duplicate newlines
8644 in the string of length LENGTH at START,
8645 except inside of string constants.
8646 The string is copied into itself with its beginning staying fixed.
8647
8648 NEWLINES is the number of newlines that must be duplicated.
8649 We assume that that much extra space is available past the end
8650 of the string. */
8651
8652 static int
8653 discard_comments (start, length, newlines)
8654 U_CHAR *start;
8655 int length;
8656 int newlines;
8657 {
8658 register U_CHAR *ibp;
8659 register U_CHAR *obp;
8660 register U_CHAR *limit;
8661 register int c;
8662
8663 /* If we have newlines to duplicate, copy everything
8664 that many characters up. Then, in the second part,
8665 we will have room to insert the newlines
8666 while copying down.
8667 NEWLINES may actually be too large, because it counts
8668 newlines in string constants, and we don't duplicate those.
8669 But that does no harm. */
8670 if (newlines > 0) {
8671 ibp = start + length;
8672 obp = ibp + newlines;
8673 limit = start;
8674 while (limit != ibp)
8675 *--obp = *--ibp;
8676 }
8677
8678 ibp = start + newlines;
8679 limit = start + length + newlines;
8680 obp = start;
8681
8682 while (ibp < limit) {
8683 *obp++ = c = *ibp++;
8684 switch (c) {
8685 case '\n':
8686 /* Duplicate the newline. */
8687 *obp++ = '\n';
8688 break;
8689
8690 case '\\':
8691 if (*ibp == '\n') {
8692 obp--;
8693 ibp++;
8694 }
8695 break;
8696
8697 case '/':
8698 if (*ibp == '\\' && ibp[1] == '\n')
8699 newline_fix (ibp);
8700 /* Delete any comment. */
8701 if (cplusplus_comments && ibp[0] == '/') {
8702 /* Comments are equivalent to spaces. */
8703 obp[-1] = ' ';
8704 ibp++;
8705 while (ibp < limit && (*ibp != '\n' || ibp[-1] == '\\'))
8706 ibp++;
8707 break;
8708 }
8709 if (ibp[0] != '*' || ibp + 1 >= limit)
8710 break;
8711 /* Comments are equivalent to spaces.
8712 For -traditional, a comment is equivalent to nothing. */
8713 if (traditional)
8714 obp--;
8715 else
8716 obp[-1] = ' ';
8717 ibp++;
8718 while (ibp + 1 < limit) {
8719 if (ibp[0] == '*'
8720 && ibp[1] == '\\' && ibp[2] == '\n')
8721 newline_fix (ibp + 1);
8722 if (ibp[0] == '*' && ibp[1] == '/')
8723 break;
8724 ibp++;
8725 }
8726 ibp += 2;
8727 break;
8728
8729 case '\'':
8730 case '\"':
8731 /* Notice and skip strings, so that we don't
8732 think that comments start inside them,
8733 and so we don't duplicate newlines in them. */
8734 {
8735 int quotec = c;
8736 while (ibp < limit) {
8737 *obp++ = c = *ibp++;
8738 if (c == quotec)
8739 break;
8740 if (c == '\n' && quotec == '\'')
8741 break;
8742 if (c == '\\' && ibp < limit) {
8743 while (*ibp == '\\' && ibp[1] == '\n')
8744 ibp += 2;
8745 *obp++ = *ibp++;
8746 }
8747 }
8748 }
8749 break;
8750 }
8751 }
8752
8753 return obp - start;
8754 }
8755 \f
8756 /* Turn newlines to spaces in the string of length LENGTH at START,
8757 except inside of string constants.
8758 The string is copied into itself with its beginning staying fixed. */
8759
8760 static int
8761 change_newlines (start, length)
8762 U_CHAR *start;
8763 int length;
8764 {
8765 register U_CHAR *ibp;
8766 register U_CHAR *obp;
8767 register U_CHAR *limit;
8768 register int c;
8769
8770 ibp = start;
8771 limit = start + length;
8772 obp = start;
8773
8774 while (ibp < limit) {
8775 *obp++ = c = *ibp++;
8776 switch (c) {
8777 case '\n':
8778 /* If this is a NEWLINE NEWLINE, then this is a real newline in the
8779 string. Skip past the newline and its duplicate.
8780 Put a space in the output. */
8781 if (*ibp == '\n')
8782 {
8783 ibp++;
8784 obp--;
8785 *obp++ = ' ';
8786 }
8787 break;
8788
8789 case '\'':
8790 case '\"':
8791 /* Notice and skip strings, so that we don't delete newlines in them. */
8792 {
8793 int quotec = c;
8794 while (ibp < limit) {
8795 *obp++ = c = *ibp++;
8796 if (c == quotec)
8797 break;
8798 if (c == '\n' && quotec == '\'')
8799 break;
8800 }
8801 }
8802 break;
8803 }
8804 }
8805
8806 return obp - start;
8807 }
8808 \f
8809 /*
8810 * my_strerror - return the descriptive text associated with an `errno' code.
8811 */
8812
8813 char *
8814 my_strerror (errnum)
8815 int errnum;
8816 {
8817 char *result;
8818
8819 #ifndef VMS
8820 #ifndef HAVE_STRERROR
8821 result = (char *) ((errnum < sys_nerr) ? sys_errlist[errnum] : 0);
8822 #else
8823 result = strerror (errnum);
8824 #endif
8825 #else /* VMS */
8826 /* VAXCRTL's strerror() takes an optional second argument, which only
8827 matters when the first argument is EVMSERR. However, it's simplest
8828 just to pass it unconditionally. `vaxc$errno' is declared in
8829 <errno.h>, and maintained by the library in parallel with `errno'.
8830 We assume that caller's `errnum' either matches the last setting of
8831 `errno' by the library or else does not have the value `EVMSERR'. */
8832
8833 result = strerror (errnum, vaxc$errno);
8834 #endif
8835
8836 if (!result)
8837 result = "undocumented I/O error";
8838
8839 return result;
8840 }
8841
8842 /*
8843 * error - print error message and increment count of errors.
8844 */
8845
8846 void
8847 error (PRINTF_ALIST (msg))
8848 PRINTF_DCL (msg)
8849 {
8850 va_list args;
8851
8852 VA_START (args, msg);
8853 verror (msg, args);
8854 va_end (args);
8855 }
8856
8857 static void
8858 verror (msg, args)
8859 char *msg;
8860 va_list args;
8861 {
8862 int i;
8863 FILE_BUF *ip = NULL;
8864
8865 print_containing_files ();
8866
8867 for (i = indepth; i >= 0; i--)
8868 if (instack[i].fname != NULL) {
8869 ip = &instack[i];
8870 break;
8871 }
8872
8873 if (ip != NULL)
8874 fprintf (stderr, "%s:%d: ", ip->nominal_fname, ip->lineno);
8875 vfprintf (stderr, msg, args);
8876 fprintf (stderr, "\n");
8877 errors++;
8878 }
8879
8880 /* Error including a message from `errno'. */
8881
8882 static void
8883 error_from_errno (name)
8884 char *name;
8885 {
8886 int i;
8887 FILE_BUF *ip = NULL;
8888
8889 print_containing_files ();
8890
8891 for (i = indepth; i >= 0; i--)
8892 if (instack[i].fname != NULL) {
8893 ip = &instack[i];
8894 break;
8895 }
8896
8897 if (ip != NULL)
8898 fprintf (stderr, "%s:%d: ", ip->nominal_fname, ip->lineno);
8899
8900 fprintf (stderr, "%s: %s\n", name, my_strerror (errno));
8901
8902 errors++;
8903 }
8904
8905 /* Print error message but don't count it. */
8906
8907 void
8908 warning (PRINTF_ALIST (msg))
8909 PRINTF_DCL (msg)
8910 {
8911 va_list args;
8912
8913 VA_START (args, msg);
8914 vwarning (msg, args);
8915 va_end (args);
8916 }
8917
8918 static void
8919 vwarning (msg, args)
8920 char *msg;
8921 va_list args;
8922 {
8923 int i;
8924 FILE_BUF *ip = NULL;
8925
8926 if (inhibit_warnings)
8927 return;
8928
8929 if (warnings_are_errors)
8930 errors++;
8931
8932 print_containing_files ();
8933
8934 for (i = indepth; i >= 0; i--)
8935 if (instack[i].fname != NULL) {
8936 ip = &instack[i];
8937 break;
8938 }
8939
8940 if (ip != NULL)
8941 fprintf (stderr, "%s:%d: ", ip->nominal_fname, ip->lineno);
8942 fprintf (stderr, "warning: ");
8943 vfprintf (stderr, msg, args);
8944 fprintf (stderr, "\n");
8945 }
8946
8947 static void
8948 #if defined (__STDC__) && defined (HAVE_VPRINTF)
8949 error_with_line (int line, PRINTF_ALIST (msg))
8950 #else
8951 error_with_line (line, PRINTF_ALIST (msg))
8952 int line;
8953 PRINTF_DCL (msg)
8954 #endif
8955 {
8956 va_list args;
8957
8958 VA_START (args, msg);
8959 verror_with_line (line, msg, args);
8960 va_end (args);
8961 }
8962
8963 static void
8964 verror_with_line (line, msg, args)
8965 int line;
8966 char *msg;
8967 va_list args;
8968 {
8969 int i;
8970 FILE_BUF *ip = NULL;
8971
8972 print_containing_files ();
8973
8974 for (i = indepth; i >= 0; i--)
8975 if (instack[i].fname != NULL) {
8976 ip = &instack[i];
8977 break;
8978 }
8979
8980 if (ip != NULL)
8981 fprintf (stderr, "%s:%d: ", ip->nominal_fname, line);
8982 vfprintf (stderr, msg, args);
8983 fprintf (stderr, "\n");
8984 errors++;
8985 }
8986
8987 static void
8988 vwarning_with_line (line, msg, args)
8989 int line;
8990 char *msg;
8991 va_list args;
8992 {
8993 int i;
8994 FILE_BUF *ip = NULL;
8995
8996 if (inhibit_warnings)
8997 return;
8998
8999 if (warnings_are_errors)
9000 errors++;
9001
9002 print_containing_files ();
9003
9004 for (i = indepth; i >= 0; i--)
9005 if (instack[i].fname != NULL) {
9006 ip = &instack[i];
9007 break;
9008 }
9009
9010 if (ip != NULL)
9011 fprintf (stderr, "%s:%d: ", ip->nominal_fname, line);
9012 fprintf (stderr, "warning: ");
9013 vfprintf (stderr, msg, args);
9014 fprintf (stderr, "\n");
9015 }
9016
9017 /* print an error message and maybe count it. */
9018
9019 void
9020 pedwarn (PRINTF_ALIST (msg))
9021 PRINTF_DCL (msg)
9022 {
9023 va_list args;
9024
9025 VA_START (args, msg);
9026 if (pedantic_errors)
9027 verror (msg, args);
9028 else
9029 vwarning (msg, args);
9030 va_end (args);
9031 }
9032
9033 void
9034 #if defined (__STDC__) && defined (HAVE_VPRINTF)
9035 pedwarn_with_line (int line, PRINTF_ALIST (msg))
9036 #else
9037 pedwarn_with_line (line, PRINTF_ALIST (msg))
9038 int line;
9039 PRINTF_DCL (msg)
9040 #endif
9041 {
9042 va_list args;
9043
9044 VA_START (args, msg);
9045 if (pedantic_errors)
9046 verror_with_line (line, msg, args);
9047 else
9048 vwarning_with_line (line, msg, args);
9049 va_end (args);
9050 }
9051
9052 /* Report a warning (or an error if pedantic_errors)
9053 giving specified file name and line number, not current. */
9054
9055 static void
9056 #if defined (__STDC__) && defined (HAVE_VPRINTF)
9057 pedwarn_with_file_and_line (char *file, int line, PRINTF_ALIST (msg))
9058 #else
9059 pedwarn_with_file_and_line (file, line, PRINTF_ALIST (msg))
9060 char *file;
9061 int line;
9062 PRINTF_DCL (msg)
9063 #endif
9064 {
9065 va_list args;
9066
9067 if (!pedantic_errors && inhibit_warnings)
9068 return;
9069 if (file != NULL)
9070 fprintf (stderr, "%s:%d: ", file, line);
9071 if (pedantic_errors)
9072 errors++;
9073 if (!pedantic_errors)
9074 fprintf (stderr, "warning: ");
9075 VA_START (args, msg);
9076 vfprintf (stderr, msg, args);
9077 va_end (args);
9078 fprintf (stderr, "\n");
9079 }
9080 \f
9081 /* Print the file names and line numbers of the #include
9082 directives which led to the current file. */
9083
9084 static void
9085 print_containing_files ()
9086 {
9087 FILE_BUF *ip = NULL;
9088 int i;
9089 int first = 1;
9090
9091 /* If stack of files hasn't changed since we last printed
9092 this info, don't repeat it. */
9093 if (last_error_tick == input_file_stack_tick)
9094 return;
9095
9096 for (i = indepth; i >= 0; i--)
9097 if (instack[i].fname != NULL) {
9098 ip = &instack[i];
9099 break;
9100 }
9101
9102 /* Give up if we don't find a source file. */
9103 if (ip == NULL)
9104 return;
9105
9106 /* Find the other, outer source files. */
9107 for (i--; i >= 0; i--)
9108 if (instack[i].fname != NULL) {
9109 ip = &instack[i];
9110 if (first) {
9111 first = 0;
9112 fprintf (stderr, "In file included");
9113 } else {
9114 fprintf (stderr, ",\n ");
9115 }
9116
9117 fprintf (stderr, " from %s:%d", ip->nominal_fname, ip->lineno);
9118 }
9119 if (! first)
9120 fprintf (stderr, ":\n");
9121
9122 /* Record we have printed the status as of this time. */
9123 last_error_tick = input_file_stack_tick;
9124 }
9125 \f
9126 /* Return the line at which an error occurred.
9127 The error is not necessarily associated with the current spot
9128 in the input stack, so LINE says where. LINE will have been
9129 copied from ip->lineno for the current input level.
9130 If the current level is for a file, we return LINE.
9131 But if the current level is not for a file, LINE is meaningless.
9132 In that case, we return the lineno of the innermost file. */
9133
9134 static int
9135 line_for_error (line)
9136 int line;
9137 {
9138 int i;
9139 int line1 = line;
9140
9141 for (i = indepth; i >= 0; ) {
9142 if (instack[i].fname != 0)
9143 return line1;
9144 i--;
9145 if (i < 0)
9146 return 0;
9147 line1 = instack[i].lineno;
9148 }
9149 abort ();
9150 /*NOTREACHED*/
9151 return 0;
9152 }
9153
9154 /*
9155 * If OBUF doesn't have NEEDED bytes after OPTR, make it bigger.
9156 *
9157 * As things stand, nothing is ever placed in the output buffer to be
9158 * removed again except when it's KNOWN to be part of an identifier,
9159 * so flushing and moving down everything left, instead of expanding,
9160 * should work ok.
9161 */
9162
9163 /* You might think void was cleaner for the return type,
9164 but that would get type mismatch in check_expand in strict ANSI. */
9165 static int
9166 grow_outbuf (obuf, needed)
9167 register FILE_BUF *obuf;
9168 register int needed;
9169 {
9170 register U_CHAR *p;
9171 int minsize;
9172
9173 if (obuf->length - (obuf->bufp - obuf->buf) > needed)
9174 return 0;
9175
9176 /* Make it at least twice as big as it is now. */
9177 obuf->length *= 2;
9178 /* Make it have at least 150% of the free space we will need. */
9179 minsize = (3 * needed) / 2 + (obuf->bufp - obuf->buf);
9180 if (minsize > obuf->length)
9181 obuf->length = minsize;
9182
9183 if ((p = (U_CHAR *) xrealloc (obuf->buf, obuf->length)) == NULL)
9184 memory_full ();
9185
9186 obuf->bufp = p + (obuf->bufp - obuf->buf);
9187 obuf->buf = p;
9188
9189 return 0;
9190 }
9191 \f
9192 /* Symbol table for macro names and special symbols */
9193
9194 /*
9195 * install a name in the main hash table, even if it is already there.
9196 * name stops with first non alphanumeric, except leading '#'.
9197 * caller must check against redefinition if that is desired.
9198 * delete_macro () removes things installed by install () in fifo order.
9199 * this is important because of the `defined' special symbol used
9200 * in #if, and also if pushdef/popdef directives are ever implemented.
9201 *
9202 * If LEN is >= 0, it is the length of the name.
9203 * Otherwise, compute the length by scanning the entire name.
9204 *
9205 * If HASH is >= 0, it is the precomputed hash code.
9206 * Otherwise, compute the hash code.
9207 */
9208 static HASHNODE *
9209 install (name, len, type, value, hash)
9210 U_CHAR *name;
9211 int len;
9212 enum node_type type;
9213 char *value;
9214 int hash;
9215 {
9216 register HASHNODE *hp;
9217 register int i, bucket;
9218 register U_CHAR *p, *q;
9219
9220 if (len < 0) {
9221 p = name;
9222 while (is_idchar[*p])
9223 p++;
9224 len = p - name;
9225 }
9226
9227 if (hash < 0)
9228 hash = hashf (name, len, HASHSIZE);
9229
9230 i = sizeof (HASHNODE) + len + 1;
9231 hp = (HASHNODE *) xmalloc (i);
9232 bucket = hash;
9233 hp->bucket_hdr = &hashtab[bucket];
9234 hp->next = hashtab[bucket];
9235 hashtab[bucket] = hp;
9236 hp->prev = NULL;
9237 if (hp->next != NULL)
9238 hp->next->prev = hp;
9239 hp->type = type;
9240 hp->length = len;
9241 hp->value.cpval = value;
9242 hp->name = ((U_CHAR *) hp) + sizeof (HASHNODE);
9243 p = hp->name;
9244 q = name;
9245 for (i = 0; i < len; i++)
9246 *p++ = *q++;
9247 hp->name[len] = 0;
9248 return hp;
9249 }
9250
9251 /*
9252 * find the most recent hash node for name name (ending with first
9253 * non-identifier char) installed by install
9254 *
9255 * If LEN is >= 0, it is the length of the name.
9256 * Otherwise, compute the length by scanning the entire name.
9257 *
9258 * If HASH is >= 0, it is the precomputed hash code.
9259 * Otherwise, compute the hash code.
9260 */
9261 HASHNODE *
9262 lookup (name, len, hash)
9263 U_CHAR *name;
9264 int len;
9265 int hash;
9266 {
9267 register U_CHAR *bp;
9268 register HASHNODE *bucket;
9269
9270 if (len < 0) {
9271 for (bp = name; is_idchar[*bp]; bp++) ;
9272 len = bp - name;
9273 }
9274
9275 if (hash < 0)
9276 hash = hashf (name, len, HASHSIZE);
9277
9278 bucket = hashtab[hash];
9279 while (bucket) {
9280 if (bucket->length == len && bcmp (bucket->name, name, len) == 0)
9281 return bucket;
9282 bucket = bucket->next;
9283 }
9284 return NULL;
9285 }
9286
9287 /*
9288 * Delete a hash node. Some weirdness to free junk from macros.
9289 * More such weirdness will have to be added if you define more hash
9290 * types that need it.
9291 */
9292
9293 /* Note that the DEFINITION of a macro is removed from the hash table
9294 but its storage is not freed. This would be a storage leak
9295 except that it is not reasonable to keep undefining and redefining
9296 large numbers of macros many times.
9297 In any case, this is necessary, because a macro can be #undef'd
9298 in the middle of reading the arguments to a call to it.
9299 If #undef freed the DEFINITION, that would crash. */
9300
9301 static void
9302 delete_macro (hp)
9303 HASHNODE *hp;
9304 {
9305
9306 if (hp->prev != NULL)
9307 hp->prev->next = hp->next;
9308 if (hp->next != NULL)
9309 hp->next->prev = hp->prev;
9310
9311 /* make sure that the bucket chain header that
9312 the deleted guy was on points to the right thing afterwards. */
9313 if (hp == *hp->bucket_hdr)
9314 *hp->bucket_hdr = hp->next;
9315
9316 #if 0
9317 if (hp->type == T_MACRO) {
9318 DEFINITION *d = hp->value.defn;
9319 struct reflist *ap, *nextap;
9320
9321 for (ap = d->pattern; ap != NULL; ap = nextap) {
9322 nextap = ap->next;
9323 free (ap);
9324 }
9325 free (d);
9326 }
9327 #endif
9328 free (hp);
9329 }
9330
9331 /*
9332 * return hash function on name. must be compatible with the one
9333 * computed a step at a time, elsewhere
9334 */
9335 static int
9336 hashf (name, len, hashsize)
9337 register U_CHAR *name;
9338 register int len;
9339 int hashsize;
9340 {
9341 register int r = 0;
9342
9343 while (len--)
9344 r = HASHSTEP (r, *name++);
9345
9346 return MAKE_POS (r) % hashsize;
9347 }
9348 \f
9349
9350 /* Dump the definition of a single macro HP to OF. */
9351 static void
9352 dump_single_macro (hp, of)
9353 register HASHNODE *hp;
9354 FILE *of;
9355 {
9356 register DEFINITION *defn = hp->value.defn;
9357 struct reflist *ap;
9358 int offset;
9359 int concat;
9360
9361
9362 /* Print the definition of the macro HP. */
9363
9364 fprintf (of, "#define %s", hp->name);
9365
9366 if (defn->nargs >= 0) {
9367 int i;
9368
9369 fprintf (of, "(");
9370 for (i = 0; i < defn->nargs; i++) {
9371 dump_arg_n (defn, i, of);
9372 if (i + 1 < defn->nargs)
9373 fprintf (of, ", ");
9374 }
9375 fprintf (of, ")");
9376 }
9377
9378 fprintf (of, " ");
9379
9380 offset = 0;
9381 concat = 0;
9382 for (ap = defn->pattern; ap != NULL; ap = ap->next) {
9383 dump_defn_1 (defn->expansion, offset, ap->nchars, of);
9384 offset += ap->nchars;
9385 if (!traditional) {
9386 if (ap->nchars != 0)
9387 concat = 0;
9388 if (ap->stringify) {
9389 switch (ap->stringify) {
9390 case SHARP_TOKEN: fprintf (of, "#"); break;
9391 case WHITE_SHARP_TOKEN: fprintf (of, "# "); break;
9392 case PERCENT_COLON_TOKEN: fprintf (of, "%%:"); break;
9393 case WHITE_PERCENT_COLON_TOKEN: fprintf (of, "%%: "); break;
9394 default: abort ();
9395 }
9396 }
9397 if (ap->raw_before != 0) {
9398 if (concat) {
9399 switch (ap->raw_before) {
9400 case WHITE_SHARP_TOKEN:
9401 case WHITE_PERCENT_COLON_TOKEN:
9402 fprintf (of, " ");
9403 break;
9404 default:
9405 break;
9406 }
9407 } else {
9408 switch (ap->raw_before) {
9409 case SHARP_TOKEN: fprintf (of, "##"); break;
9410 case WHITE_SHARP_TOKEN: fprintf (of, "## "); break;
9411 case PERCENT_COLON_TOKEN: fprintf (of, "%%:%%:"); break;
9412 case WHITE_PERCENT_COLON_TOKEN: fprintf (of, "%%:%%: "); break;
9413 default: abort ();
9414 }
9415 }
9416 }
9417 concat = 0;
9418 }
9419 dump_arg_n (defn, ap->argno, of);
9420 if (!traditional && ap->raw_after != 0) {
9421 switch (ap->raw_after) {
9422 case SHARP_TOKEN: fprintf (of, "##"); break;
9423 case WHITE_SHARP_TOKEN: fprintf (of, " ##"); break;
9424 case PERCENT_COLON_TOKEN: fprintf (of, "%%:%%:"); break;
9425 case WHITE_PERCENT_COLON_TOKEN: fprintf (of, " %%:%%:"); break;
9426 default: abort ();
9427 }
9428 concat = 1;
9429 }
9430 }
9431 dump_defn_1 (defn->expansion, offset, defn->length - offset, of);
9432 fprintf (of, "\n");
9433 }
9434
9435 /* Dump all macro definitions as #defines to stdout. */
9436
9437 static void
9438 dump_all_macros ()
9439 {
9440 int bucket;
9441
9442 for (bucket = 0; bucket < HASHSIZE; bucket++) {
9443 register HASHNODE *hp;
9444
9445 for (hp = hashtab[bucket]; hp; hp= hp->next) {
9446 if (hp->type == T_MACRO)
9447 dump_single_macro (hp, stdout);
9448 }
9449 }
9450 }
9451
9452 /* Output to OF a substring of a macro definition.
9453 BASE is the beginning of the definition.
9454 Output characters START thru LENGTH.
9455 Unless traditional, discard newlines outside of strings, thus
9456 converting funny-space markers to ordinary spaces. */
9457
9458 static void
9459 dump_defn_1 (base, start, length, of)
9460 U_CHAR *base;
9461 int start;
9462 int length;
9463 FILE *of;
9464 {
9465 U_CHAR *p = base + start;
9466 U_CHAR *limit = base + start + length;
9467
9468 if (traditional)
9469 fwrite (p, sizeof (*p), length, of);
9470 else {
9471 while (p < limit) {
9472 if (*p == '\"' || *p =='\'') {
9473 U_CHAR *p1 = skip_quoted_string (p, limit, 0, NULL_PTR,
9474 NULL_PTR, NULL_PTR);
9475 fwrite (p, sizeof (*p), p1 - p, of);
9476 p = p1;
9477 } else {
9478 if (*p != '\n')
9479 putc (*p, of);
9480 p++;
9481 }
9482 }
9483 }
9484 }
9485
9486 /* Print the name of argument number ARGNUM of macro definition DEFN
9487 to OF.
9488 Recall that DEFN->args.argnames contains all the arg names
9489 concatenated in reverse order with comma-space in between. */
9490
9491 static void
9492 dump_arg_n (defn, argnum, of)
9493 DEFINITION *defn;
9494 int argnum;
9495 FILE *of;
9496 {
9497 register U_CHAR *p = defn->args.argnames;
9498 while (argnum + 1 < defn->nargs) {
9499 p = (U_CHAR *) index ((char *) p, ' ') + 1;
9500 argnum++;
9501 }
9502
9503 while (*p && *p != ',') {
9504 putc (*p, of);
9505 p++;
9506 }
9507 }
9508 \f
9509 /* Initialize syntactic classifications of characters. */
9510
9511 static void
9512 initialize_char_syntax ()
9513 {
9514 register int i;
9515
9516 /*
9517 * Set up is_idchar and is_idstart tables. These should be
9518 * faster than saying (is_alpha (c) || c == '_'), etc.
9519 * Set up these things before calling any routines tthat
9520 * refer to them.
9521 */
9522 for (i = 'a'; i <= 'z'; i++) {
9523 is_idchar[i - 'a' + 'A'] = 1;
9524 is_idchar[i] = 1;
9525 is_idstart[i - 'a' + 'A'] = 1;
9526 is_idstart[i] = 1;
9527 }
9528 for (i = '0'; i <= '9'; i++)
9529 is_idchar[i] = 1;
9530 is_idchar['_'] = 1;
9531 is_idstart['_'] = 1;
9532 is_idchar['$'] = dollars_in_ident;
9533 is_idstart['$'] = dollars_in_ident;
9534
9535 /* horizontal space table */
9536 is_hor_space[' '] = 1;
9537 is_hor_space['\t'] = 1;
9538 is_hor_space['\v'] = 1;
9539 is_hor_space['\f'] = 1;
9540 is_hor_space['\r'] = 1;
9541
9542 is_space[' '] = 1;
9543 is_space['\t'] = 1;
9544 is_space['\v'] = 1;
9545 is_space['\f'] = 1;
9546 is_space['\n'] = 1;
9547 is_space['\r'] = 1;
9548
9549 char_name['\v'] = "vertical tab";
9550 char_name['\f'] = "formfeed";
9551 char_name['\r'] = "carriage return";
9552 }
9553
9554 /* Initialize the built-in macros. */
9555
9556 static void
9557 initialize_builtins (inp, outp)
9558 FILE_BUF *inp;
9559 FILE_BUF *outp;
9560 {
9561 install ((U_CHAR *) "__LINE__", -1, T_SPECLINE, NULL_PTR, -1);
9562 install ((U_CHAR *) "__DATE__", -1, T_DATE, NULL_PTR, -1);
9563 install ((U_CHAR *) "__FILE__", -1, T_FILE, NULL_PTR, -1);
9564 install ((U_CHAR *) "__BASE_FILE__", -1, T_BASE_FILE, NULL_PTR, -1);
9565 install ((U_CHAR *) "__INCLUDE_LEVEL__", -1, T_INCLUDE_LEVEL, NULL_PTR, -1);
9566 install ((U_CHAR *) "__VERSION__", -1, T_VERSION, NULL_PTR, -1);
9567 #ifndef NO_BUILTIN_SIZE_TYPE
9568 install ((U_CHAR *) "__SIZE_TYPE__", -1, T_SIZE_TYPE, NULL_PTR, -1);
9569 #endif
9570 #ifndef NO_BUILTIN_PTRDIFF_TYPE
9571 install ((U_CHAR *) "__PTRDIFF_TYPE__ ", -1, T_PTRDIFF_TYPE, NULL_PTR, -1);
9572 #endif
9573 install ((U_CHAR *) "__WCHAR_TYPE__", -1, T_WCHAR_TYPE, NULL_PTR, -1);
9574 install ((U_CHAR *) "__USER_LABEL_PREFIX__", -1, T_USER_LABEL_PREFIX_TYPE,
9575 NULL_PTR, -1);
9576 install ((U_CHAR *) "__REGISTER_PREFIX__", -1, T_REGISTER_PREFIX_TYPE,
9577 NULL_PTR, -1);
9578 install ((U_CHAR *) "__IMMEDIATE_PREFIX__", -1, T_IMMEDIATE_PREFIX_TYPE,
9579 NULL_PTR, -1);
9580 install ((U_CHAR *) "__TIME__", -1, T_TIME, NULL_PTR, -1);
9581 if (!traditional) {
9582 install ((U_CHAR *) "__STDC__", -1, T_CONST, "1", -1);
9583 install ((U_CHAR *) "__STDC_VERSION__", -1, T_CONST, "199409L", -1);
9584 }
9585 if (objc)
9586 install ((U_CHAR *) "__OBJC__", -1, T_CONST, "1", -1);
9587 /* This is supplied using a -D by the compiler driver
9588 so that it is present only when truly compiling with GNU C. */
9589 /* install ((U_CHAR *) "__GNUC__", -1, T_CONST, "2", -1); */
9590
9591 if (debug_output)
9592 {
9593 char directive[2048];
9594 U_CHAR *udirective = (U_CHAR *) directive;
9595 register struct directive *dp = &directive_table[0];
9596 struct tm *timebuf = timestamp ();
9597
9598 sprintf (directive, " __BASE_FILE__ \"%s\"\n",
9599 instack[0].nominal_fname);
9600 output_line_directive (inp, outp, 0, same_file);
9601 pass_thru_directive (udirective, &udirective[strlen (directive)],
9602 outp, dp);
9603
9604 sprintf (directive, " __VERSION__ \"%s\"\n", version_string);
9605 output_line_directive (inp, outp, 0, same_file);
9606 pass_thru_directive (udirective, &udirective[strlen (directive)],
9607 outp, dp);
9608
9609 #ifndef NO_BUILTIN_SIZE_TYPE
9610 sprintf (directive, " __SIZE_TYPE__ %s\n", SIZE_TYPE);
9611 output_line_directive (inp, outp, 0, same_file);
9612 pass_thru_directive (udirective, &udirective[strlen (directive)],
9613 outp, dp);
9614 #endif
9615
9616 #ifndef NO_BUILTIN_PTRDIFF_TYPE
9617 sprintf (directive, " __PTRDIFF_TYPE__ %s\n", PTRDIFF_TYPE);
9618 output_line_directive (inp, outp, 0, same_file);
9619 pass_thru_directive (udirective, &udirective[strlen (directive)],
9620 outp, dp);
9621 #endif
9622
9623 sprintf (directive, " __WCHAR_TYPE__ %s\n", wchar_type);
9624 output_line_directive (inp, outp, 0, same_file);
9625 pass_thru_directive (udirective, &udirective[strlen (directive)],
9626 outp, dp);
9627
9628 sprintf (directive, " __DATE__ \"%s %2d %4d\"\n",
9629 monthnames[timebuf->tm_mon],
9630 timebuf->tm_mday, timebuf->tm_year + 1900);
9631 output_line_directive (inp, outp, 0, same_file);
9632 pass_thru_directive (udirective, &udirective[strlen (directive)],
9633 outp, dp);
9634
9635 sprintf (directive, " __TIME__ \"%02d:%02d:%02d\"\n",
9636 timebuf->tm_hour, timebuf->tm_min, timebuf->tm_sec);
9637 output_line_directive (inp, outp, 0, same_file);
9638 pass_thru_directive (udirective, &udirective[strlen (directive)],
9639 outp, dp);
9640
9641 if (!traditional)
9642 {
9643 sprintf (directive, " __STDC__ 1");
9644 output_line_directive (inp, outp, 0, same_file);
9645 pass_thru_directive (udirective, &udirective[strlen (directive)],
9646 outp, dp);
9647 }
9648 if (objc)
9649 {
9650 sprintf (directive, " __OBJC__ 1");
9651 output_line_directive (inp, outp, 0, same_file);
9652 pass_thru_directive (udirective, &udirective[strlen (directive)],
9653 outp, dp);
9654 }
9655 }
9656 }
9657 \f
9658 /*
9659 * process a given definition string, for initialization
9660 * If STR is just an identifier, define it with value 1.
9661 * If STR has anything after the identifier, then it should
9662 * be identifier=definition.
9663 */
9664
9665 static void
9666 make_definition (str, op)
9667 char *str;
9668 FILE_BUF *op;
9669 {
9670 FILE_BUF *ip;
9671 struct directive *kt;
9672 U_CHAR *buf, *p;
9673
9674 p = buf = (U_CHAR *) str;
9675 if (!is_idstart[*p]) {
9676 error ("malformed option `-D %s'", str);
9677 return;
9678 }
9679 while (is_idchar[*++p])
9680 ;
9681 if (*p == '(') {
9682 while (is_idchar[*++p] || *p == ',' || is_hor_space[*p])
9683 ;
9684 if (*p++ != ')')
9685 p = (U_CHAR *) str; /* Error */
9686 }
9687 if (*p == 0) {
9688 buf = (U_CHAR *) alloca (p - buf + 4);
9689 strcpy ((char *)buf, str);
9690 strcat ((char *)buf, " 1");
9691 } else if (*p != '=') {
9692 error ("malformed option `-D %s'", str);
9693 return;
9694 } else {
9695 U_CHAR *q;
9696 /* Copy the entire option so we can modify it. */
9697 buf = (U_CHAR *) alloca (2 * strlen (str) + 1);
9698 strncpy ((char *) buf, str, p - (U_CHAR *) str);
9699 /* Change the = to a space. */
9700 buf[p - (U_CHAR *) str] = ' ';
9701 /* Scan for any backslash-newline and remove it. */
9702 p++;
9703 q = &buf[p - (U_CHAR *) str];
9704 while (*p) {
9705 if (*p == '\"' || *p == '\'') {
9706 int unterminated = 0;
9707 U_CHAR *p1 = skip_quoted_string (p, p + strlen ((char *) p), 0,
9708 NULL_PTR, NULL_PTR, &unterminated);
9709 if (unterminated)
9710 return;
9711 while (p != p1)
9712 if (*p == '\\' && p[1] == '\n')
9713 p += 2;
9714 else
9715 *q++ = *p++;
9716 } else if (*p == '\\' && p[1] == '\n')
9717 p += 2;
9718 /* Change newline chars into newline-markers. */
9719 else if (*p == '\n')
9720 {
9721 *q++ = '\n';
9722 *q++ = '\n';
9723 p++;
9724 }
9725 else
9726 *q++ = *p++;
9727 }
9728 *q = 0;
9729 }
9730
9731 ip = &instack[++indepth];
9732 ip->nominal_fname = ip->fname = "*Initialization*";
9733
9734 ip->buf = ip->bufp = buf;
9735 ip->length = strlen ((char *) buf);
9736 ip->lineno = 1;
9737 ip->macro = 0;
9738 ip->free_ptr = 0;
9739 ip->if_stack = if_stack;
9740 ip->system_header_p = 0;
9741
9742 for (kt = directive_table; kt->type != T_DEFINE; kt++)
9743 ;
9744
9745 /* Pass NULL instead of OP, since this is a "predefined" macro. */
9746 do_define (buf, buf + strlen ((char *) buf), NULL_PTR, kt);
9747 --indepth;
9748 }
9749
9750 /* JF, this does the work for the -U option */
9751
9752 static void
9753 make_undef (str, op)
9754 char *str;
9755 FILE_BUF *op;
9756 {
9757 FILE_BUF *ip;
9758 struct directive *kt;
9759
9760 ip = &instack[++indepth];
9761 ip->nominal_fname = ip->fname = "*undef*";
9762
9763 ip->buf = ip->bufp = (U_CHAR *) str;
9764 ip->length = strlen (str);
9765 ip->lineno = 1;
9766 ip->macro = 0;
9767 ip->free_ptr = 0;
9768 ip->if_stack = if_stack;
9769 ip->system_header_p = 0;
9770
9771 for (kt = directive_table; kt->type != T_UNDEF; kt++)
9772 ;
9773
9774 do_undef ((U_CHAR *) str, (U_CHAR *) str + strlen (str), op, kt);
9775 --indepth;
9776 }
9777 \f
9778 /* Process the string STR as if it appeared as the body of a #assert.
9779 OPTION is the option name for which STR was the argument. */
9780
9781 static void
9782 make_assertion (option, str)
9783 char *option;
9784 char *str;
9785 {
9786 FILE_BUF *ip;
9787 struct directive *kt;
9788 U_CHAR *buf, *p, *q;
9789
9790 /* Copy the entire option so we can modify it. */
9791 buf = (U_CHAR *) alloca (strlen (str) + 1);
9792 strcpy ((char *) buf, str);
9793 /* Scan for any backslash-newline and remove it. */
9794 p = q = buf;
9795 while (*p) {
9796 if (*p == '\\' && p[1] == '\n')
9797 p += 2;
9798 else
9799 *q++ = *p++;
9800 }
9801 *q = 0;
9802
9803 p = buf;
9804 if (!is_idstart[*p]) {
9805 error ("malformed option `%s %s'", option, str);
9806 return;
9807 }
9808 while (is_idchar[*++p])
9809 ;
9810 SKIP_WHITE_SPACE (p);
9811 if (! (*p == 0 || *p == '(')) {
9812 error ("malformed option `%s %s'", option, str);
9813 return;
9814 }
9815
9816 ip = &instack[++indepth];
9817 ip->nominal_fname = ip->fname = "*Initialization*";
9818
9819 ip->buf = ip->bufp = buf;
9820 ip->length = strlen ((char *) buf);
9821 ip->lineno = 1;
9822 ip->macro = 0;
9823 ip->free_ptr = 0;
9824 ip->if_stack = if_stack;
9825 ip->system_header_p = 0;
9826
9827 for (kt = directive_table; kt->type != T_ASSERT; kt++)
9828 ;
9829
9830 /* pass NULL as output ptr to do_define since we KNOW it never
9831 does any output.... */
9832 do_assert (buf, buf + strlen ((char *) buf) , NULL_PTR, kt);
9833 --indepth;
9834 }
9835 \f
9836 /* Append a chain of `struct file_name_list's
9837 to the end of the main include chain.
9838 FIRST is the beginning of the chain to append, and LAST is the end. */
9839
9840 static void
9841 append_include_chain (first, last)
9842 struct file_name_list *first, *last;
9843 {
9844 struct file_name_list *dir;
9845
9846 if (!first || !last)
9847 return;
9848
9849 if (include == 0)
9850 include = first;
9851 else
9852 last_include->next = first;
9853
9854 if (first_bracket_include == 0)
9855 first_bracket_include = first;
9856
9857 for (dir = first; ; dir = dir->next) {
9858 int len = strlen (dir->fname) + INCLUDE_LEN_FUDGE;
9859 if (len > max_include_len)
9860 max_include_len = len;
9861 if (dir == last)
9862 break;
9863 }
9864
9865 last->next = NULL;
9866 last_include = last;
9867 }
9868 \f
9869 /* Add output to `deps_buffer' for the -M switch.
9870 STRING points to the text to be output.
9871 SPACER is ':' for targets, ' ' for dependencies. */
9872
9873 static void
9874 deps_output (string, spacer)
9875 char *string;
9876 int spacer;
9877 {
9878 int size = strlen (string);
9879
9880 if (size == 0)
9881 return;
9882
9883 #ifndef MAX_OUTPUT_COLUMNS
9884 #define MAX_OUTPUT_COLUMNS 72
9885 #endif
9886 if (MAX_OUTPUT_COLUMNS - 1 /*spacer*/ - 2 /*` \'*/ < deps_column + size
9887 && 1 < deps_column) {
9888 bcopy (" \\\n ", &deps_buffer[deps_size], 4);
9889 deps_size += 4;
9890 deps_column = 1;
9891 if (spacer == ' ')
9892 spacer = 0;
9893 }
9894
9895 if (deps_size + size + 8 > deps_allocated_size) {
9896 deps_allocated_size = (deps_size + size + 50) * 2;
9897 deps_buffer = xrealloc (deps_buffer, deps_allocated_size);
9898 }
9899 if (spacer == ' ') {
9900 deps_buffer[deps_size++] = ' ';
9901 deps_column++;
9902 }
9903 bcopy (string, &deps_buffer[deps_size], size);
9904 deps_size += size;
9905 deps_column += size;
9906 if (spacer == ':') {
9907 deps_buffer[deps_size++] = ':';
9908 deps_column++;
9909 }
9910 deps_buffer[deps_size] = 0;
9911 }
9912 \f
9913 static void
9914 fatal (PRINTF_ALIST (msg))
9915 PRINTF_DCL (msg)
9916 {
9917 va_list args;
9918
9919 fprintf (stderr, "%s: ", progname);
9920 VA_START (args, msg);
9921 vfprintf (stderr, msg, args);
9922 va_end (args);
9923 fprintf (stderr, "\n");
9924 exit (FATAL_EXIT_CODE);
9925 }
9926
9927 /* More 'friendly' abort that prints the line and file.
9928 config.h can #define abort fancy_abort if you like that sort of thing. */
9929
9930 void
9931 fancy_abort ()
9932 {
9933 fatal ("Internal gcc abort.");
9934 }
9935
9936 static void
9937 perror_with_name (name)
9938 char *name;
9939 {
9940 fprintf (stderr, "%s: ", progname);
9941 fprintf (stderr, "%s: %s\n", name, my_strerror (errno));
9942 errors++;
9943 }
9944
9945 static void
9946 pfatal_with_name (name)
9947 char *name;
9948 {
9949 perror_with_name (name);
9950 #ifdef VMS
9951 exit (vaxc$errno);
9952 #else
9953 exit (FATAL_EXIT_CODE);
9954 #endif
9955 }
9956
9957 /* Handler for SIGPIPE. */
9958
9959 static void
9960 pipe_closed (signo)
9961 /* If this is missing, some compilers complain. */
9962 int signo;
9963 {
9964 fatal ("output pipe has been closed");
9965 }
9966 \f
9967 static void
9968 memory_full ()
9969 {
9970 fatal ("Memory exhausted.");
9971 }
9972
9973
9974 GENERIC_PTR
9975 xmalloc (size)
9976 size_t size;
9977 {
9978 register GENERIC_PTR ptr = (GENERIC_PTR) malloc (size);
9979 if (!ptr)
9980 memory_full ();
9981 return ptr;
9982 }
9983
9984 static GENERIC_PTR
9985 xrealloc (old, size)
9986 GENERIC_PTR old;
9987 size_t size;
9988 {
9989 register GENERIC_PTR ptr = (GENERIC_PTR) realloc (old, size);
9990 if (!ptr)
9991 memory_full ();
9992 return ptr;
9993 }
9994
9995 static GENERIC_PTR
9996 xcalloc (number, size)
9997 size_t number, size;
9998 {
9999 register size_t total = number * size;
10000 register GENERIC_PTR ptr = (GENERIC_PTR) malloc (total);
10001 if (!ptr)
10002 memory_full ();
10003 bzero (ptr, total);
10004 return ptr;
10005 }
10006
10007 static char *
10008 savestring (input)
10009 char *input;
10010 {
10011 size_t size = strlen (input);
10012 char *output = xmalloc (size + 1);
10013 strcpy (output, input);
10014 return output;
10015 }
10016 \f
10017 /* Get the file-mode and data size of the file open on FD
10018 and store them in *MODE_POINTER and *SIZE_POINTER. */
10019
10020 static int
10021 file_size_and_mode (fd, mode_pointer, size_pointer)
10022 int fd;
10023 int *mode_pointer;
10024 long int *size_pointer;
10025 {
10026 struct stat sbuf;
10027
10028 if (fstat (fd, &sbuf) < 0) return (-1);
10029 if (mode_pointer) *mode_pointer = sbuf.st_mode;
10030 if (size_pointer) *size_pointer = sbuf.st_size;
10031 return 0;
10032 }
10033
10034 static void
10035 output_dots (fd, depth)
10036 FILE* fd;
10037 int depth;
10038 {
10039 while (depth > 0) {
10040 putc ('.', fd);
10041 depth--;
10042 }
10043 }
10044
10045 \f
10046 #ifdef VMS
10047
10048 /* Under VMS we need to fix up the "include" specification
10049 filename so that everything following the 1st slash is
10050 changed into its correct VMS file specification. */
10051
10052 static void
10053 hack_vms_include_specification (fname)
10054 char *fname;
10055 {
10056 register char *cp, *cp1, *cp2;
10057 int f, check_filename_before_returning, no_prefix_seen;
10058 char Local[512];
10059
10060 check_filename_before_returning = 0;
10061 no_prefix_seen = 0;
10062
10063 /* Ignore leading "./"s */
10064 while (fname[0] == '.' && fname[1] == '/') {
10065 strcpy (fname, fname+2);
10066 no_prefix_seen = 1; /* mark this for later */
10067 }
10068 /* Look for the boundary between the VMS and UNIX filespecs */
10069 cp = rindex (fname, ']'); /* Look for end of dirspec. */
10070 if (cp == 0) cp = rindex (fname, '>'); /* ... Ditto */
10071 if (cp == 0) cp = rindex (fname, ':'); /* Look for end of devspec. */
10072 if (cp) {
10073 cp++;
10074 } else {
10075 cp = index (fname, '/'); /* Look for the "/" */
10076 }
10077
10078 /*
10079 * Check if we have a vax-c style '#include filename'
10080 * and add the missing .h
10081 */
10082 if (cp == 0) {
10083 if (index(fname,'.') == 0)
10084 strcat(fname, ".h");
10085 } else {
10086 if (index(cp,'.') == 0)
10087 strcat(cp, ".h");
10088 }
10089
10090 cp2 = Local; /* initialize */
10091
10092 /* We are trying to do a number of things here. First of all, we are
10093 trying to hammer the filenames into a standard format, such that later
10094 processing can handle them.
10095
10096 If the file name contains something like [dir.], then it recognizes this
10097 as a root, and strips the ".]". Later processing will add whatever is
10098 needed to get things working properly.
10099
10100 If no device is specified, then the first directory name is taken to be
10101 a device name (or a rooted logical). */
10102
10103 /* See if we found that 1st slash */
10104 if (cp == 0) return; /* Nothing to do!!! */
10105 if (*cp != '/') return; /* Nothing to do!!! */
10106 /* Point to the UNIX filename part (which needs to be fixed!) */
10107 cp1 = cp+1;
10108 /* If the directory spec is not rooted, we can just copy
10109 the UNIX filename part and we are done */
10110 if (((cp - fname) > 1) && ((cp[-1] == ']') || (cp[-1] == '>'))) {
10111 if (cp[-2] != '.') {
10112 /*
10113 * The VMS part ends in a `]', and the preceding character is not a `.'.
10114 * We strip the `]', and then splice the two parts of the name in the
10115 * usual way. Given the default locations for include files in cccp.c,
10116 * we will only use this code if the user specifies alternate locations
10117 * with the /include (-I) switch on the command line. */
10118 cp -= 1; /* Strip "]" */
10119 cp1--; /* backspace */
10120 } else {
10121 /*
10122 * The VMS part has a ".]" at the end, and this will not do. Later
10123 * processing will add a second directory spec, and this would be a syntax
10124 * error. Thus we strip the ".]", and thus merge the directory specs.
10125 * We also backspace cp1, so that it points to a '/'. This inhibits the
10126 * generation of the 000000 root directory spec (which does not belong here
10127 * in this case).
10128 */
10129 cp -= 2; /* Strip ".]" */
10130 cp1--; }; /* backspace */
10131 } else {
10132
10133 /* We drop in here if there is no VMS style directory specification yet.
10134 * If there is no device specification either, we make the first dir a
10135 * device and try that. If we do not do this, then we will be essentially
10136 * searching the users default directory (as if they did a #include "asdf.h").
10137 *
10138 * Then all we need to do is to push a '[' into the output string. Later
10139 * processing will fill this in, and close the bracket.
10140 */
10141 if (cp[-1] != ':') *cp2++ = ':'; /* dev not in spec. take first dir */
10142 *cp2++ = '['; /* Open the directory specification */
10143 }
10144
10145 /* at this point we assume that we have the device spec, and (at least
10146 the opening "[" for a directory specification. We may have directories
10147 specified already */
10148
10149 /* If there are no other slashes then the filename will be
10150 in the "root" directory. Otherwise, we need to add
10151 directory specifications. */
10152 if (index (cp1, '/') == 0) {
10153 /* Just add "000000]" as the directory string */
10154 strcpy (cp2, "000000]");
10155 cp2 += strlen (cp2);
10156 check_filename_before_returning = 1; /* we might need to fool with this later */
10157 } else {
10158 /* As long as there are still subdirectories to add, do them. */
10159 while (index (cp1, '/') != 0) {
10160 /* If this token is "." we can ignore it */
10161 if ((cp1[0] == '.') && (cp1[1] == '/')) {
10162 cp1 += 2;
10163 continue;
10164 }
10165 /* Add a subdirectory spec. Do not duplicate "." */
10166 if (cp2[-1] != '.' && cp2[-1] != '[' && cp2[-1] != '<')
10167 *cp2++ = '.';
10168 /* If this is ".." then the spec becomes "-" */
10169 if ((cp1[0] == '.') && (cp1[1] == '.') && (cp[2] == '/')) {
10170 /* Add "-" and skip the ".." */
10171 *cp2++ = '-';
10172 cp1 += 3;
10173 continue;
10174 }
10175 /* Copy the subdirectory */
10176 while (*cp1 != '/') *cp2++= *cp1++;
10177 cp1++; /* Skip the "/" */
10178 }
10179 /* Close the directory specification */
10180 if (cp2[-1] == '.') /* no trailing periods */
10181 cp2--;
10182 *cp2++ = ']';
10183 }
10184 /* Now add the filename */
10185 while (*cp1) *cp2++ = *cp1++;
10186 *cp2 = 0;
10187 /* Now append it to the original VMS spec. */
10188 strcpy (cp, Local);
10189
10190 /* If we put a [000000] in the filename, try to open it first. If this fails,
10191 remove the [000000], and return that name. This provides flexibility
10192 to the user in that they can use both rooted and non-rooted logical names
10193 to point to the location of the file. */
10194
10195 if (check_filename_before_returning && no_prefix_seen) {
10196 f = open (fname, O_RDONLY, 0666);
10197 if (f >= 0) {
10198 /* The file name is OK as it is, so return it as is. */
10199 close (f);
10200 return;
10201 }
10202 /* The filename did not work. Try to remove the [000000] from the name,
10203 and return it. */
10204 cp = index (fname, '[');
10205 cp2 = index (fname, ']') + 1;
10206 strcpy (cp, cp2); /* this gets rid of it */
10207 }
10208 return;
10209 }
10210 #endif /* VMS */
10211 \f
10212 #ifdef VMS
10213
10214 /* These are the read/write replacement routines for
10215 VAX-11 "C". They make read/write behave enough
10216 like their UNIX counterparts that CCCP will work */
10217
10218 static int
10219 read (fd, buf, size)
10220 int fd;
10221 char *buf;
10222 int size;
10223 {
10224 #undef read /* Get back the REAL read routine */
10225 register int i;
10226 register int total = 0;
10227
10228 /* Read until the buffer is exhausted */
10229 while (size > 0) {
10230 /* Limit each read to 32KB */
10231 i = (size > (32*1024)) ? (32*1024) : size;
10232 i = read (fd, buf, i);
10233 if (i <= 0) {
10234 if (i == 0) return (total);
10235 return (i);
10236 }
10237 /* Account for this read */
10238 total += i;
10239 buf += i;
10240 size -= i;
10241 }
10242 return (total);
10243 }
10244
10245 static int
10246 write (fd, buf, size)
10247 int fd;
10248 char *buf;
10249 int size;
10250 {
10251 #undef write /* Get back the REAL write routine */
10252 int i;
10253 int j;
10254
10255 /* Limit individual writes to 32Kb */
10256 i = size;
10257 while (i > 0) {
10258 j = (i > (32*1024)) ? (32*1024) : i;
10259 if (write (fd, buf, j) < 0) return (-1);
10260 /* Account for the data written */
10261 buf += j;
10262 i -= j;
10263 }
10264 return (size);
10265 }
10266
10267 /* The following wrapper functions supply additional arguments to the VMS
10268 I/O routines to optimize performance with file handling. The arguments
10269 are:
10270 "mbc=16" - Set multi-block count to 16 (use a 8192 byte buffer).
10271 "deq=64" - When extending the file, extend it in chunks of 32Kbytes.
10272 "fop=tef"- Truncate unused portions of file when closing file.
10273 "shr=nil"- Disallow file sharing while file is open.
10274 */
10275
10276 static FILE *
10277 freopen (fname, type, oldfile)
10278 char *fname;
10279 char *type;
10280 FILE *oldfile;
10281 {
10282 #undef freopen /* Get back the REAL fopen routine */
10283 if (strcmp (type, "w") == 0)
10284 return freopen (fname, type, oldfile, "mbc=16", "deq=64", "fop=tef", "shr=nil");
10285 return freopen (fname, type, oldfile, "mbc=16");
10286 }
10287
10288 static FILE *
10289 fopen (fname, type)
10290 char *fname;
10291 char *type;
10292 {
10293 #undef fopen /* Get back the REAL fopen routine */
10294 /* The gcc-vms-1.42 distribution's header files prototype fopen with two
10295 fixed arguments, which matches ANSI's specification but not VAXCRTL's
10296 pre-ANSI implementation. This hack circumvents the mismatch problem. */
10297 FILE *(*vmslib_fopen)() = (FILE *(*)()) fopen;
10298
10299 if (*type == 'w')
10300 return (*vmslib_fopen) (fname, type, "mbc=32",
10301 "deq=64", "fop=tef", "shr=nil");
10302 else
10303 return (*vmslib_fopen) (fname, type, "mbc=32");
10304 }
10305
10306 static int
10307 open (fname, flags, prot)
10308 char *fname;
10309 int flags;
10310 int prot;
10311 {
10312 #undef open /* Get back the REAL open routine */
10313 return open (fname, flags, prot, "mbc=16", "deq=64", "fop=tef");
10314 }
10315
10316 /* Avoid run-time library bug, where copying M out of N+M characters with
10317 N >= 65535 results in VAXCRTL's strncat falling into an infinite loop.
10318 gcc-cpp exercises this particular bug. [Fixed in V5.5-2's VAXCRTL.] */
10319
10320 static char *
10321 strncat (dst, src, cnt)
10322 char *dst;
10323 const char *src;
10324 unsigned cnt;
10325 {
10326 register char *d = dst, *s = (char *) src;
10327 register int n = cnt; /* convert to _signed_ type */
10328
10329 while (*d) d++; /* advance to end */
10330 while (--n >= 0)
10331 if (!(*d++ = *s++)) break;
10332 if (n < 0) *d = '\0';
10333 return dst;
10334 }
10335 \f
10336 /* more VMS hackery */
10337 #include <fab.h>
10338 #include <nam.h>
10339
10340 extern unsigned long sys$parse(), sys$search();
10341
10342 /* Work around another library bug. If a file is located via a searchlist,
10343 and if the device it's on is not the same device as the one specified
10344 in the first element of that searchlist, then both stat() and fstat()
10345 will fail to return info about it. `errno' will be set to EVMSERR, and
10346 `vaxc$errno' will be set to SS$_NORMAL due yet another bug in stat()!
10347 We can get around this by fully parsing the filename and then passing
10348 that absolute name to stat().
10349
10350 Without this fix, we can end up failing to find header files, which is
10351 bad enough, but then compounding the problem by reporting the reason for
10352 failure as "normal successful completion." */
10353
10354 #undef fstat /* get back to library version */
10355
10356 static int
10357 VMS_fstat (fd, statbuf)
10358 int fd;
10359 struct stat *statbuf;
10360 {
10361 int result = fstat (fd, statbuf);
10362
10363 if (result < 0)
10364 {
10365 FILE *fp;
10366 char nambuf[NAM$C_MAXRSS+1];
10367
10368 if ((fp = fdopen (fd, "r")) != 0 && fgetname (fp, nambuf) != 0)
10369 result = VMS_stat (nambuf, statbuf);
10370 /* No fclose(fp) here; that would close(fd) as well. */
10371 }
10372
10373 return result;
10374 }
10375
10376 static int
10377 VMS_stat (name, statbuf)
10378 const char *name;
10379 struct stat *statbuf;
10380 {
10381 int result = stat (name, statbuf);
10382
10383 if (result < 0)
10384 {
10385 struct FAB fab;
10386 struct NAM nam;
10387 char exp_nam[NAM$C_MAXRSS+1], /* expanded name buffer for sys$parse */
10388 res_nam[NAM$C_MAXRSS+1]; /* resultant name buffer for sys$search */
10389
10390 fab = cc$rms_fab;
10391 fab.fab$l_fna = (char *) name;
10392 fab.fab$b_fns = (unsigned char) strlen (name);
10393 fab.fab$l_nam = (void *) &nam;
10394 nam = cc$rms_nam;
10395 nam.nam$l_esa = exp_nam, nam.nam$b_ess = sizeof exp_nam - 1;
10396 nam.nam$l_rsa = res_nam, nam.nam$b_rss = sizeof res_nam - 1;
10397 nam.nam$b_nop = NAM$M_PWD | NAM$M_NOCONCEAL;
10398 if (sys$parse (&fab) & 1)
10399 {
10400 if (sys$search (&fab) & 1)
10401 {
10402 res_nam[nam.nam$b_rsl] = '\0';
10403 result = stat (res_nam, statbuf);
10404 }
10405 /* Clean up searchlist context cached by the system. */
10406 nam.nam$b_nop = NAM$M_SYNCHK;
10407 fab.fab$l_fna = 0, fab.fab$b_fns = 0;
10408 (void) sys$parse (&fab);
10409 }
10410 }
10411
10412 return result;
10413 }
10414 #endif /* VMS */
This page took 0.517483 seconds and 6 git commands to generate.