]>
Commit | Line | Data |
---|---|---|
b0bbbd85 | 1 | /* C Compatible Compiler Preprocessor (CCCP) |
e2056677 | 2 | Copyright (C) 1986, 87, 89, 92-95, 1996 Free Software Foundation, Inc. |
2af5e9e2 RK |
3 | Written by Paul Rubin, June 1986 |
4 | Adapted to ANSI C, Richard Stallman, Jan 1987 | |
b0bbbd85 RS |
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 | |
940d9d63 RK |
18 | Foundation, 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. | |
b0bbbd85 RS |
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 | #include "pcp.h" | |
52 | ||
5c18abb4 RS |
53 | /* By default, colon separates directories in a path. */ |
54 | #ifndef PATH_SEPARATOR | |
55 | #define PATH_SEPARATOR ':' | |
56 | #endif | |
57 | ||
b0bbbd85 RS |
58 | #include <sys/types.h> |
59 | #include <sys/stat.h> | |
60 | #include <ctype.h> | |
61 | #include <stdio.h> | |
9e263fc4 | 62 | #include <signal.h> |
b0bbbd85 | 63 | |
25cbb59e RK |
64 | /* The following symbols should be autoconfigured: |
65 | HAVE_FCNTL_H | |
66 | HAVE_STDLIB_H | |
67 | HAVE_SYS_TIME_H | |
68 | HAVE_UNISTD_H | |
69 | STDC_HEADERS | |
70 | TIME_WITH_SYS_TIME | |
71 | In the mean time, we'll get by with approximations based | |
72 | on existing GCC configuration symbols. */ | |
73 | ||
74 | #ifdef POSIX | |
75 | # ifndef HAVE_STDLIB_H | |
76 | # define HAVE_STDLIB_H 1 | |
77 | # endif | |
78 | # ifndef HAVE_UNISTD_H | |
79 | # define HAVE_UNISTD_H 1 | |
80 | # endif | |
81 | # ifndef STDC_HEADERS | |
82 | # define STDC_HEADERS 1 | |
83 | # endif | |
84 | #endif /* defined (POSIX) */ | |
85 | ||
86 | #if defined (POSIX) || (defined (USG) && !defined (VMS)) | |
87 | # ifndef HAVE_FCNTL_H | |
88 | # define HAVE_FCNTL_H 1 | |
89 | # endif | |
90 | #endif | |
91 | ||
92 | #ifndef RLIMIT_STACK | |
93 | # include <time.h> | |
b0bbbd85 | 94 | #else |
25cbb59e RK |
95 | # if TIME_WITH_SYS_TIME |
96 | # include <sys/time.h> | |
97 | # include <time.h> | |
98 | # else | |
99 | # if HAVE_SYS_TIME_H | |
100 | # include <sys/time.h> | |
101 | # else | |
102 | # include <time.h> | |
103 | # endif | |
104 | # endif | |
105 | # include <sys/resource.h> | |
106 | #endif | |
107 | ||
108 | #if HAVE_FCNTL_H | |
109 | # include <fcntl.h> | |
110 | #endif | |
b0bbbd85 | 111 | |
6d34466a JW |
112 | #include <errno.h> |
113 | ||
25cbb59e RK |
114 | #if HAVE_STDLIB_H |
115 | # include <stdlib.h> | |
116 | #else | |
117 | char *getenv (); | |
118 | #endif | |
119 | ||
120 | #if STDC_HEADERS | |
121 | # include <string.h> | |
122 | # ifndef bcmp | |
123 | # define bcmp(a, b, n) memcmp (a, b, n) | |
124 | # endif | |
125 | # ifndef bcopy | |
126 | # define bcopy(s, d, n) memcpy (d, s, n) | |
127 | # endif | |
128 | # ifndef bzero | |
129 | # define bzero(d, n) memset (d, 0, n) | |
130 | # endif | |
131 | #else /* !STDC_HEADERS */ | |
132 | char *index (); | |
133 | char *rindex (); | |
134 | ||
135 | # if !defined (BSTRING) && (defined (USG) || defined (VMS)) | |
136 | ||
137 | # ifndef bcmp | |
138 | # define bcmp my_bcmp | |
139 | static int | |
140 | my_bcmp (a, b, n) | |
141 | register char *a; | |
142 | register char *b; | |
143 | register unsigned n; | |
144 | { | |
145 | while (n-- > 0) | |
146 | if (*a++ != *b++) | |
147 | return 1; | |
148 | ||
149 | return 0; | |
150 | } | |
151 | # endif /* !defined (bcmp) */ | |
152 | ||
153 | # ifndef bcopy | |
154 | # define bcopy my_bcopy | |
155 | static void | |
156 | my_bcopy (s, d, n) | |
157 | register char *s; | |
158 | register char *d; | |
159 | register unsigned n; | |
160 | { | |
161 | while (n-- > 0) | |
162 | *d++ = *s++; | |
163 | } | |
164 | # endif /* !defined (bcopy) */ | |
165 | ||
166 | # ifndef bzero | |
167 | # define bzero my_bzero | |
168 | static void | |
169 | my_bzero (b, length) | |
170 | register char *b; | |
171 | register unsigned length; | |
172 | { | |
173 | while (length-- > 0) | |
174 | *b++ = 0; | |
175 | } | |
176 | # endif /* !defined (bzero) */ | |
177 | ||
178 | # endif /* !defined (BSTRING) && (defined (USG) || defined (VMS)) */ | |
179 | #endif /* ! STDC_HEADERS */ | |
180 | ||
181 | #if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 6) | |
182 | # define __attribute__(x) | |
183 | #endif | |
184 | ||
185 | #ifndef PROTO | |
186 | # if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__) | |
187 | # define PROTO(ARGS) ARGS | |
188 | # else | |
189 | # define PROTO(ARGS) () | |
190 | # endif | |
191 | #endif | |
192 | ||
193 | #if defined (__STDC__) && defined (HAVE_VPRINTF) | |
194 | # include <stdarg.h> | |
195 | # define VA_START(va_list, var) va_start (va_list, var) | |
196 | # define PRINTF_ALIST(msg) char *msg, ... | |
197 | # define PRINTF_DCL(msg) | |
198 | # define PRINTF_PROTO(ARGS, m, n) PROTO (ARGS) __attribute__ ((format (printf, m, n))) | |
199 | #else | |
200 | # include <varargs.h> | |
201 | # define VA_START(va_list, var) va_start (va_list) | |
202 | # define PRINTF_ALIST(msg) msg, va_alist | |
203 | # define PRINTF_DCL(msg) char *msg; va_dcl | |
204 | # define PRINTF_PROTO(ARGS, m, n) () __attribute__ ((format (printf, m, n))) | |
205 | # define vfprintf(file, msg, args) \ | |
206 | { \ | |
207 | char *a0 = va_arg(args, char *); \ | |
208 | char *a1 = va_arg(args, char *); \ | |
209 | char *a2 = va_arg(args, char *); \ | |
210 | char *a3 = va_arg(args, char *); \ | |
211 | fprintf (file, msg, a0, a1, a2, a3); \ | |
212 | } | |
213 | #endif | |
214 | ||
215 | #define PRINTF_PROTO_1(ARGS) PRINTF_PROTO(ARGS, 1, 2) | |
216 | #define PRINTF_PROTO_2(ARGS) PRINTF_PROTO(ARGS, 2, 3) | |
217 | #define PRINTF_PROTO_3(ARGS) PRINTF_PROTO(ARGS, 3, 4) | |
218 | ||
219 | #if HAVE_UNISTD_H | |
220 | # include <unistd.h> | |
221 | #endif | |
222 | ||
b0bbbd85 RS |
223 | /* VMS-specific definitions */ |
224 | #ifdef VMS | |
b0bbbd85 RS |
225 | #include <descrip.h> |
226 | #define O_RDONLY 0 /* Open arg for Read/Only */ | |
227 | #define O_WRONLY 1 /* Open arg for Write/Only */ | |
ad0c9fa1 RS |
228 | #define read(fd,buf,size) VMS_read (fd,buf,size) |
229 | #define write(fd,buf,size) VMS_write (fd,buf,size) | |
230 | #define open(fname,mode,prot) VMS_open (fname,mode,prot) | |
231 | #define fopen(fname,mode) VMS_fopen (fname,mode) | |
232 | #define freopen(fname,mode,ofile) VMS_freopen (fname,mode,ofile) | |
bd8cb5e2 | 233 | #define fstat(fd,stbuf) VMS_fstat (fd,stbuf) |
bd8cb5e2 | 234 | static int VMS_fstat (), VMS_stat (); |
b0bbbd85 RS |
235 | static int VMS_read (); |
236 | static int VMS_write (); | |
237 | static int VMS_open (); | |
238 | static FILE * VMS_fopen (); | |
239 | static FILE * VMS_freopen (); | |
240 | static void hack_vms_include_specification (); | |
3e4115b7 RK |
241 | #define INO_T_EQ(a, b) (!bcmp((char *) &(a), (char *) &(b), sizeof (a))) |
242 | #define INO_T_HASH(a) 0 | |
243 | #define INCLUDE_LEN_FUDGE 12 /* leave room for VMS syntax conversion */ | |
b0bbbd85 RS |
244 | #ifdef __GNUC__ |
245 | #define BSTRING /* VMS/GCC supplies the bstring routines */ | |
246 | #endif /* __GNUC__ */ | |
247 | #endif /* VMS */ | |
248 | ||
249 | #ifndef O_RDONLY | |
250 | #define O_RDONLY 0 | |
251 | #endif | |
252 | ||
253 | #undef MIN | |
254 | #undef MAX | |
255 | #define MIN(X,Y) ((X) < (Y) ? (X) : (Y)) | |
256 | #define MAX(X,Y) ((X) > (Y) ? (X) : (Y)) | |
257 | ||
047380ca PE |
258 | /* Find the largest host integer type and set its size and type. |
259 | Don't blindly use `long'; on some crazy hosts it is shorter than `int'. */ | |
5b65a74f RK |
260 | |
261 | #ifndef HOST_BITS_PER_WIDE_INT | |
262 | ||
263 | #if HOST_BITS_PER_LONG > HOST_BITS_PER_INT | |
264 | #define HOST_BITS_PER_WIDE_INT HOST_BITS_PER_LONG | |
265 | #define HOST_WIDE_INT long | |
266 | #else | |
267 | #define HOST_BITS_PER_WIDE_INT HOST_BITS_PER_INT | |
268 | #define HOST_WIDE_INT int | |
269 | #endif | |
270 | ||
271 | #endif | |
272 | ||
b0bbbd85 RS |
273 | #ifndef S_ISREG |
274 | #define S_ISREG(m) (((m) & S_IFMT) == S_IFREG) | |
275 | #endif | |
276 | ||
2e4f4529 JW |
277 | #ifndef S_ISDIR |
278 | #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) | |
279 | #endif | |
280 | ||
3e4115b7 RK |
281 | #ifndef INO_T_EQ |
282 | #define INO_T_EQ(a, b) ((a) == (b)) | |
283 | #endif | |
284 | ||
285 | #ifndef INO_T_HASH | |
286 | #define INO_T_HASH(a) (a) | |
287 | #endif | |
288 | ||
390e01bf TW |
289 | /* Define a generic NULL if one hasn't already been defined. */ |
290 | ||
8d9bfdc5 RK |
291 | #ifndef NULL |
292 | #define NULL 0 | |
293 | #endif | |
294 | ||
390e01bf TW |
295 | #ifndef GENERIC_PTR |
296 | #if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__) | |
297 | #define GENERIC_PTR void * | |
3e06027d | 298 | #else |
390e01bf | 299 | #define GENERIC_PTR char * |
8d9bfdc5 | 300 | #endif |
3e06027d | 301 | #endif |
8d9bfdc5 | 302 | |
390e01bf | 303 | #ifndef NULL_PTR |
0f41302f | 304 | #define NULL_PTR ((GENERIC_PTR) 0) |
390e01bf TW |
305 | #endif |
306 | ||
6489924b RS |
307 | #ifndef INCLUDE_LEN_FUDGE |
308 | #define INCLUDE_LEN_FUDGE 0 | |
309 | #endif | |
310 | ||
b0bbbd85 RS |
311 | /* External declarations. */ |
312 | ||
b0bbbd85 | 313 | extern char *version_string; |
02cc38b5 RK |
314 | #ifndef VMS |
315 | #ifndef HAVE_STRERROR | |
b0bbbd85 | 316 | extern int sys_nerr; |
2d2daf45 | 317 | #if defined(bsd4_4) |
5d672cd7 JW |
318 | extern const char *const sys_errlist[]; |
319 | #else | |
b0bbbd85 | 320 | extern char *sys_errlist[]; |
5d672cd7 | 321 | #endif |
ddd5a7c1 | 322 | #else /* HAVE_STRERROR */ |
02cc38b5 RK |
323 | char *strerror (); |
324 | #endif | |
325 | #else /* VMS */ | |
326 | char *strerror (int,...); | |
327 | #endif | |
047380ca PE |
328 | HOST_WIDE_INT parse_escape PROTO((char **, HOST_WIDE_INT)); |
329 | HOST_WIDE_INT parse_c_expression PROTO((char *)); | |
b0bbbd85 RS |
330 | |
331 | #ifndef errno | |
332 | extern int errno; | |
333 | #endif | |
b0bbbd85 | 334 | \f |
b0bbbd85 RS |
335 | /* Name under which this program was invoked. */ |
336 | ||
337 | static char *progname; | |
338 | ||
eda5fa7b | 339 | /* Nonzero means use extra default include directories for C++. */ |
b0bbbd85 RS |
340 | |
341 | static int cplusplus; | |
342 | ||
eda5fa7b RS |
343 | /* Nonzero means handle cplusplus style comments */ |
344 | ||
345 | static int cplusplus_comments; | |
346 | ||
b0bbbd85 RS |
347 | /* Nonzero means handle #import, for objective C. */ |
348 | ||
349 | static int objc; | |
350 | ||
351 | /* Nonzero means this is an assembly file, and allow | |
352 | unknown directives, which could be comments. */ | |
353 | ||
354 | static int lang_asm; | |
355 | ||
356 | /* Current maximum length of directory names in the search path | |
357 | for include files. (Altered as we get more of them.) */ | |
358 | ||
359 | static int max_include_len; | |
360 | ||
361 | /* Nonzero means turn NOTREACHED into #pragma NOTREACHED etc */ | |
362 | ||
253245df | 363 | static int for_lint = 0; |
b0bbbd85 RS |
364 | |
365 | /* Nonzero means copy comments into the output file. */ | |
366 | ||
367 | static int put_out_comments = 0; | |
368 | ||
369 | /* Nonzero means don't process the ANSI trigraph sequences. */ | |
370 | ||
371 | static int no_trigraphs = 0; | |
372 | ||
373 | /* Nonzero means print the names of included files rather than | |
374 | the preprocessed output. 1 means just the #include "...", | |
375 | 2 means #include <...> as well. */ | |
376 | ||
377 | static int print_deps = 0; | |
378 | ||
86739c7b DE |
379 | /* Nonzero if missing .h files in -M output are assumed to be generated |
380 | files and not errors. */ | |
381 | ||
382 | static int print_deps_missing_files = 0; | |
383 | ||
b0bbbd85 RS |
384 | /* Nonzero means print names of header files (-H). */ |
385 | ||
386 | static int print_include_names = 0; | |
387 | ||
388 | /* Nonzero means don't output line number information. */ | |
389 | ||
adcfa681 | 390 | static int no_line_directives; |
b0bbbd85 | 391 | |
bbd4b75b RS |
392 | /* Nonzero means output the text in failing conditionals, |
393 | inside #failed ... #endfailed. */ | |
394 | ||
395 | static int output_conditionals; | |
396 | ||
b0bbbd85 RS |
397 | /* dump_only means inhibit output of the preprocessed text |
398 | and instead output the definitions of all user-defined | |
399 | macros in a form suitable for use as input to cccp. | |
400 | dump_names means pass #define and the macro name through to output. | |
401 | dump_definitions means pass the whole definition (plus #define) through | |
402 | */ | |
403 | ||
404 | static enum {dump_none, dump_only, dump_names, dump_definitions} | |
405 | dump_macros = dump_none; | |
406 | ||
407 | /* Nonzero means pass all #define and #undef directives which we actually | |
408 | process through to the output stream. This feature is used primarily | |
409 | to allow cc1 to record the #defines and #undefs for the sake of | |
410 | debuggers which understand about preprocessor macros, but it may | |
411 | also be useful with -E to figure out how symbols are defined, and | |
412 | where they are defined. */ | |
413 | static int debug_output = 0; | |
414 | ||
b0bbbd85 RS |
415 | /* Nonzero indicates special processing used by the pcp program. The |
416 | special effects of this mode are: | |
417 | ||
418 | Inhibit all macro expansion, except those inside #if directives. | |
419 | ||
420 | Process #define directives normally, and output their contents | |
421 | to the output file. | |
422 | ||
423 | Output preconditions to pcp_outfile indicating all the relevant | |
424 | preconditions for use of this file in a later cpp run. | |
425 | */ | |
426 | static FILE *pcp_outfile; | |
427 | ||
428 | /* Nonzero means we are inside an IF during a -pcp run. In this mode | |
429 | macro expansion is done, and preconditions are output for all macro | |
0f41302f | 430 | uses requiring them. */ |
b0bbbd85 RS |
431 | static int pcp_inside_if; |
432 | ||
5f12e361 RS |
433 | /* Nonzero means never to include precompiled files. |
434 | This is 1 since there's no way now to make precompiled files, | |
435 | so it's not worth testing for them. */ | |
436 | static int no_precomp = 1; | |
b0bbbd85 RS |
437 | |
438 | /* Nonzero means give all the error messages the ANSI standard requires. */ | |
439 | ||
440 | int pedantic; | |
441 | ||
442 | /* Nonzero means try to make failure to fit ANSI C an error. */ | |
443 | ||
444 | static int pedantic_errors; | |
445 | ||
446 | /* Nonzero means don't print warning messages. -w. */ | |
447 | ||
448 | static int inhibit_warnings = 0; | |
449 | ||
3e4115b7 RK |
450 | /* Nonzero means warn if slash-star appears in a slash-star comment, |
451 | or if newline-backslash appears in a slash-slash comment. */ | |
b0bbbd85 RS |
452 | |
453 | static int warn_comments; | |
454 | ||
455 | /* Nonzero means warn if a macro argument is (or would be) | |
456 | stringified with -traditional. */ | |
457 | ||
458 | static int warn_stringify; | |
459 | ||
460 | /* Nonzero means warn if there are any trigraphs. */ | |
461 | ||
462 | static int warn_trigraphs; | |
463 | ||
2aa7ec37 RS |
464 | /* Nonzero means warn if #import is used. */ |
465 | ||
466 | static int warn_import = 1; | |
467 | ||
b0bbbd85 RS |
468 | /* Nonzero means turn warnings into errors. */ |
469 | ||
470 | static int warnings_are_errors; | |
471 | ||
472 | /* Nonzero means try to imitate old fashioned non-ANSI preprocessor. */ | |
473 | ||
474 | int traditional; | |
475 | ||
476 | /* Nonzero causes output not to be done, | |
477 | but directives such as #define that have side effects | |
478 | are still obeyed. */ | |
479 | ||
480 | static int no_output; | |
481 | ||
42e2194b RK |
482 | /* Nonzero means this file was included with a -imacros or -include |
483 | command line and should not be recorded as an include file. */ | |
484 | ||
485 | static int no_record_file; | |
486 | ||
b0bbbd85 RS |
487 | /* Nonzero means that we have finished processing the command line options. |
488 | This flag is used to decide whether or not to issue certain errors | |
489 | and/or warnings. */ | |
490 | ||
491 | static int done_initializing = 0; | |
5b01bc66 JW |
492 | |
493 | /* Line where a newline was first seen in a string constant. */ | |
494 | ||
495 | static int multiline_string_line = 0; | |
b0bbbd85 RS |
496 | \f |
497 | /* I/O buffer structure. | |
498 | The `fname' field is nonzero for source files and #include files | |
499 | and for the dummy text used for -D and -U. | |
500 | It is zero for rescanning results of macro expansion | |
501 | and for expanding macro arguments. */ | |
9b1674a8 | 502 | #define INPUT_STACK_MAX 400 |
b0bbbd85 RS |
503 | static struct file_buf { |
504 | char *fname; | |
adcfa681 | 505 | /* Filename specified with #line directive. */ |
b0bbbd85 | 506 | char *nominal_fname; |
3e4115b7 RK |
507 | /* Include file description. */ |
508 | struct include_file *inc; | |
b0bbbd85 RS |
509 | /* Record where in the search path this file was found. |
510 | For #include_next. */ | |
511 | struct file_name_list *dir; | |
512 | int lineno; | |
513 | int length; | |
514 | U_CHAR *buf; | |
515 | U_CHAR *bufp; | |
516 | /* Macro that this level is the expansion of. | |
517 | Included so that we can reenable the macro | |
518 | at the end of this level. */ | |
519 | struct hashnode *macro; | |
520 | /* Value of if_stack at start of this file. | |
521 | Used to prohibit unmatched #endif (etc) in an include file. */ | |
522 | struct if_stack *if_stack; | |
523 | /* Object to be freed at end of input at this level. */ | |
524 | U_CHAR *free_ptr; | |
525 | /* True if this is a header file included using <FILENAME>. */ | |
526 | char system_header_p; | |
527 | } instack[INPUT_STACK_MAX]; | |
528 | ||
529 | static int last_error_tick; /* Incremented each time we print it. */ | |
530 | static int input_file_stack_tick; /* Incremented when the status changes. */ | |
531 | ||
532 | /* Current nesting level of input sources. | |
533 | `instack[indepth]' is the level currently being read. */ | |
534 | static int indepth = -1; | |
535 | #define CHECK_DEPTH(code) \ | |
536 | if (indepth >= (INPUT_STACK_MAX - 1)) \ | |
537 | { \ | |
538 | error_with_line (line_for_error (instack[indepth].lineno), \ | |
539 | "macro or `#include' recursion too deep"); \ | |
540 | code; \ | |
541 | } | |
542 | ||
543 | /* Current depth in #include directives that use <...>. */ | |
544 | static int system_include_depth = 0; | |
545 | ||
546 | typedef struct file_buf FILE_BUF; | |
547 | ||
548 | /* The output buffer. Its LENGTH field is the amount of room allocated | |
549 | for the buffer, not the number of chars actually present. To get | |
0f41302f | 550 | that, subtract outbuf.buf from outbuf.bufp. */ |
b0bbbd85 RS |
551 | |
552 | #define OUTBUF_SIZE 10 /* initial size of output buffer */ | |
553 | static FILE_BUF outbuf; | |
554 | ||
555 | /* Grow output buffer OBUF points at | |
556 | so it can hold at least NEEDED more chars. */ | |
557 | ||
558 | #define check_expand(OBUF, NEEDED) \ | |
559 | (((OBUF)->length - ((OBUF)->bufp - (OBUF)->buf) <= (NEEDED)) \ | |
560 | ? grow_outbuf ((OBUF), (NEEDED)) : 0) | |
561 | ||
562 | struct file_name_list | |
563 | { | |
564 | struct file_name_list *next; | |
3e4115b7 | 565 | /* If the following is 1, it is a C-language system include |
d2a22862 RS |
566 | directory. */ |
567 | int c_system_include_path; | |
6e7f952e JW |
568 | /* Mapping of file names for this directory. */ |
569 | struct file_name_map *name_map; | |
570 | /* Non-zero if name_map is valid. */ | |
571 | int got_name_map; | |
3e4115b7 RK |
572 | /* The include directory status. */ |
573 | struct stat st; | |
574 | /* The include prefix: "" denotes the working directory, | |
575 | otherwise fname must end in '/'. | |
576 | The actual size is dynamically allocated. */ | |
577 | char fname[1]; | |
b0bbbd85 RS |
578 | }; |
579 | ||
0f41302f MS |
580 | /* #include "file" looks in source file dir, then stack. */ |
581 | /* #include <file> just looks in the stack. */ | |
582 | /* -I directories are added to the end, then the defaults are added. */ | |
acf7262c JM |
583 | /* The */ |
584 | static struct default_include { | |
585 | char *fname; /* The name of the directory. */ | |
586 | int cplusplus; /* Only look here if we're compiling C++. */ | |
587 | int cxx_aware; /* Includes in this directory don't need to | |
588 | be wrapped in extern "C" when compiling | |
589 | C++. */ | |
590 | } include_defaults_array[] | |
b0bbbd85 RS |
591 | #ifdef INCLUDE_DEFAULTS |
592 | = INCLUDE_DEFAULTS; | |
593 | #else | |
594 | = { | |
595 | /* Pick up GNU C++ specific include files. */ | |
acf7262c | 596 | { GPLUSPLUS_INCLUDE_DIR, 1, 1 }, |
b039b61b | 597 | { OLD_GPLUSPLUS_INCLUDE_DIR, 1, 1 }, |
b0bbbd85 | 598 | #ifdef CROSS_COMPILE |
ee40befe RS |
599 | /* This is the dir for fixincludes. Put it just before |
600 | the files that we fix. */ | |
acf7262c | 601 | { GCC_INCLUDE_DIR, 0, 0 }, |
b0bbbd85 RS |
602 | /* For cross-compilation, this dir name is generated |
603 | automatically in Makefile.in. */ | |
acf7262c | 604 | { CROSS_INCLUDE_DIR, 0, 0 }, |
ee40befe | 605 | /* This is another place that the target system's headers might be. */ |
858072f0 | 606 | { TOOL_INCLUDE_DIR, 0, 0 }, |
b0bbbd85 | 607 | #else /* not CROSS_COMPILE */ |
acf7262c | 608 | /* This should be /usr/local/include and should come before |
ee40befe | 609 | the fixincludes-fixed header files. */ |
acf7262c | 610 | { LOCAL_INCLUDE_DIR, 0, 1 }, |
ceaff0a8 RS |
611 | /* This is here ahead of GCC_INCLUDE_DIR because assert.h goes here. |
612 | Likewise, behind LOCAL_INCLUDE_DIR, where glibc puts its assert.h. */ | |
858072f0 | 613 | { TOOL_INCLUDE_DIR, 0, 0 }, |
9d9dadd2 RS |
614 | /* This is the dir for fixincludes. Put it just before |
615 | the files that we fix. */ | |
acf7262c | 616 | { GCC_INCLUDE_DIR, 0, 0 }, |
b0bbbd85 RS |
617 | /* Some systems have an extra dir of include files. */ |
618 | #ifdef SYSTEM_INCLUDE_DIR | |
acf7262c | 619 | { SYSTEM_INCLUDE_DIR, 0, 0 }, |
b0bbbd85 | 620 | #endif |
acf7262c | 621 | { STANDARD_INCLUDE_DIR, 0, 0 }, |
b0bbbd85 | 622 | #endif /* not CROSS_COMPILE */ |
acf7262c | 623 | { 0, 0, 0 } |
b0bbbd85 RS |
624 | }; |
625 | #endif /* no INCLUDE_DEFAULTS */ | |
626 | ||
627 | /* The code looks at the defaults through this pointer, rather than through | |
628 | the constant structure above. This pointer gets changed if an environment | |
629 | variable specifies other defaults. */ | |
630 | static struct default_include *include_defaults = include_defaults_array; | |
631 | ||
632 | static struct file_name_list *include = 0; /* First dir to search */ | |
633 | /* First dir to search for <file> */ | |
6489924b RS |
634 | /* This is the first element to use for #include <...>. |
635 | If it is 0, use the entire chain for such includes. */ | |
b0bbbd85 | 636 | static struct file_name_list *first_bracket_include = 0; |
6489924b RS |
637 | /* This is the first element in the chain that corresponds to |
638 | a directory of system header files. */ | |
639 | static struct file_name_list *first_system_include = 0; | |
b0bbbd85 RS |
640 | static struct file_name_list *last_include = 0; /* Last in chain */ |
641 | ||
642 | /* Chain of include directories to put at the end of the other chain. */ | |
643 | static struct file_name_list *after_include = 0; | |
644 | static struct file_name_list *last_after_include = 0; /* Last in chain */ | |
645 | ||
b0866c74 JW |
646 | /* Chain to put at the start of the system include files. */ |
647 | static struct file_name_list *before_system = 0; | |
648 | static struct file_name_list *last_before_system = 0; /* Last in chain */ | |
649 | ||
bec42276 RS |
650 | /* Directory prefix that should replace `/usr' in the standard |
651 | include file directories. */ | |
652 | static char *include_prefix; | |
653 | ||
3e4115b7 RK |
654 | /* Maintain and search list of included files. */ |
655 | ||
656 | struct include_file { | |
657 | struct include_file *next; /* for include_hashtab */ | |
658 | struct include_file *next_ino; /* for include_ino_hashtab */ | |
659 | char *fname; | |
660 | /* If the following is the empty string, it means #pragma once | |
661 | was seen in this include file, or #import was applied to the file. | |
662 | Otherwise, if it is nonzero, it is a macro name. | |
663 | Don't include the file again if that macro is defined. */ | |
664 | U_CHAR *control_macro; | |
665 | /* Nonzero if the dependency on this include file has been output. */ | |
666 | int deps_output; | |
667 | struct stat st; | |
668 | }; | |
669 | ||
670 | /* Hash tables of files already included with #include or #import. | |
671 | include_hashtab is by full name; include_ino_hashtab is by inode number. */ | |
672 | ||
673 | #define INCLUDE_HASHSIZE 61 | |
674 | static struct include_file *include_hashtab[INCLUDE_HASHSIZE]; | |
675 | static struct include_file *include_ino_hashtab[INCLUDE_HASHSIZE]; | |
676 | ||
b0bbbd85 RS |
677 | /* Global list of strings read in from precompiled files. This list |
678 | is kept in the order the strings are read in, with new strings being | |
679 | added at the end through stringlist_tailp. We use this list to output | |
680 | the strings at the end of the run. | |
681 | */ | |
682 | static STRINGDEF *stringlist; | |
683 | static STRINGDEF **stringlist_tailp = &stringlist; | |
684 | ||
685 | ||
686 | /* Structure returned by create_definition */ | |
687 | typedef struct macrodef MACRODEF; | |
688 | struct macrodef | |
689 | { | |
690 | struct definition *defn; | |
691 | U_CHAR *symnam; | |
692 | int symlen; | |
693 | }; | |
b0bbbd85 | 694 | \f |
5bdc1512 | 695 | enum sharp_token_type { |
27027a60 | 696 | NO_SHARP_TOKEN = 0, /* token not present */ |
5bdc1512 RK |
697 | |
698 | SHARP_TOKEN = '#', /* token spelled with # only */ | |
699 | WHITE_SHARP_TOKEN, /* token spelled with # and white space */ | |
700 | ||
701 | PERCENT_COLON_TOKEN = '%', /* token spelled with %: only */ | |
702 | WHITE_PERCENT_COLON_TOKEN /* token spelled with %: and white space */ | |
703 | }; | |
704 | ||
b0bbbd85 RS |
705 | /* Structure allocated for every #define. For a simple replacement |
706 | such as | |
707 | #define foo bar , | |
708 | nargs = -1, the `pattern' list is null, and the expansion is just | |
709 | the replacement text. Nargs = 0 means a functionlike macro with no args, | |
710 | e.g., | |
711 | #define getchar() getc (stdin) . | |
712 | When there are args, the expansion is the replacement text with the | |
713 | args squashed out, and the reflist is a list describing how to | |
714 | build the output from the input: e.g., "3 chars, then the 1st arg, | |
715 | then 9 chars, then the 3rd arg, then 0 chars, then the 2nd arg". | |
716 | The chars here come from the expansion. Whatever is left of the | |
717 | expansion after the last arg-occurrence is copied after that arg. | |
718 | Note that the reflist can be arbitrarily long--- | |
719 | its length depends on the number of times the arguments appear in | |
720 | the replacement text, not how many args there are. Example: | |
721 | #define f(x) x+x+x+x+x+x+x would have replacement text "++++++" and | |
722 | pattern list | |
723 | { (0, 1), (1, 1), (1, 1), ..., (1, 1), NULL } | |
0f41302f | 724 | where (x, y) means (nchars, argno). */ |
b0bbbd85 RS |
725 | |
726 | typedef struct definition DEFINITION; | |
727 | struct definition { | |
728 | int nargs; | |
729 | int length; /* length of expansion string */ | |
730 | int predefined; /* True if the macro was builtin or */ | |
731 | /* came from the command line */ | |
732 | U_CHAR *expansion; | |
733 | int line; /* Line number of definition */ | |
734 | char *file; /* File of definition */ | |
5ff1a832 | 735 | char rest_args; /* Nonzero if last arg. absorbs the rest */ |
b0bbbd85 RS |
736 | struct reflist { |
737 | struct reflist *next; | |
91dbf5e7 | 738 | |
5bdc1512 RK |
739 | enum sharp_token_type stringify; /* set if a # operator before arg */ |
740 | enum sharp_token_type raw_before; /* set if a ## operator before arg */ | |
741 | enum sharp_token_type raw_after; /* set if a ## operator after arg */ | |
91dbf5e7 | 742 | |
5ff1a832 | 743 | char rest_args; /* Nonzero if this arg. absorbs the rest */ |
b0bbbd85 RS |
744 | int nchars; /* Number of literal chars to copy before |
745 | this arg occurrence. */ | |
746 | int argno; /* Number of arg to substitute (origin-0) */ | |
747 | } *pattern; | |
748 | union { | |
749 | /* Names of macro args, concatenated in reverse order | |
750 | with comma-space between them. | |
751 | The only use of this is that we warn on redefinition | |
752 | if this differs between the old and new definitions. */ | |
753 | U_CHAR *argnames; | |
754 | } args; | |
755 | }; | |
756 | ||
757 | /* different kinds of things that can appear in the value field | |
0f41302f | 758 | of a hash node. Actually, this may be useless now. */ |
b0bbbd85 | 759 | union hashval { |
b0bbbd85 RS |
760 | char *cpval; |
761 | DEFINITION *defn; | |
762 | KEYDEF *keydef; | |
763 | }; | |
764 | ||
5ff1a832 RS |
765 | /* |
766 | * special extension string that can be added to the last macro argument to | |
767 | * allow it to absorb the "rest" of the arguments when expanded. Ex: | |
ad0c9fa1 RS |
768 | * #define wow(a, b...) process (b, a, b) |
769 | * { wow (1, 2, 3); } -> { process (2, 3, 1, 2, 3); } | |
770 | * { wow (one, two); } -> { process (two, one, two); } | |
5ff1a832 | 771 | * if this "rest_arg" is used with the concat token '##' and if it is not |
f72aed24 | 772 | * supplied then the token attached to with ## will not be outputted. Ex: |
ad0c9fa1 RS |
773 | * #define wow (a, b...) process (b ## , a, ## b) |
774 | * { wow (1, 2); } -> { process (2, 1, 2); } | |
775 | * { wow (one); } -> { process (one); { | |
5ff1a832 RS |
776 | */ |
777 | static char rest_extension[] = "..."; | |
778 | #define REST_EXTENSION_LENGTH (sizeof (rest_extension) - 1) | |
b0bbbd85 RS |
779 | |
780 | /* The structure of a node in the hash table. The hash table | |
adcfa681 | 781 | has entries for all tokens defined by #define directives (type T_MACRO), |
b0bbbd85 RS |
782 | plus some special tokens like __LINE__ (these each have their own |
783 | type, and the appropriate code is run when that type of node is seen. | |
784 | It does not contain control words like "#define", which are recognized | |
0f41302f | 785 | by a separate piece of code. */ |
b0bbbd85 RS |
786 | |
787 | /* different flavors of hash nodes --- also used in keyword table */ | |
788 | enum node_type { | |
789 | T_DEFINE = 1, /* the `#define' keyword */ | |
790 | T_INCLUDE, /* the `#include' keyword */ | |
791 | T_INCLUDE_NEXT, /* the `#include_next' keyword */ | |
792 | T_IMPORT, /* the `#import' keyword */ | |
793 | T_IFDEF, /* the `#ifdef' keyword */ | |
794 | T_IFNDEF, /* the `#ifndef' keyword */ | |
795 | T_IF, /* the `#if' keyword */ | |
796 | T_ELSE, /* `#else' */ | |
797 | T_PRAGMA, /* `#pragma' */ | |
798 | T_ELIF, /* `#elif' */ | |
799 | T_UNDEF, /* `#undef' */ | |
800 | T_LINE, /* `#line' */ | |
801 | T_ERROR, /* `#error' */ | |
802 | T_WARNING, /* `#warning' */ | |
803 | T_ENDIF, /* `#endif' */ | |
804 | T_SCCS, /* `#sccs', used on system V. */ | |
805 | T_IDENT, /* `#ident', used on system V. */ | |
806 | T_ASSERT, /* `#assert', taken from system V. */ | |
807 | T_UNASSERT, /* `#unassert', taken from system V. */ | |
808 | T_SPECLINE, /* special symbol `__LINE__' */ | |
809 | T_DATE, /* `__DATE__' */ | |
810 | T_FILE, /* `__FILE__' */ | |
811 | T_BASE_FILE, /* `__BASE_FILE__' */ | |
812 | T_INCLUDE_LEVEL, /* `__INCLUDE_LEVEL__' */ | |
813 | T_VERSION, /* `__VERSION__' */ | |
814 | T_SIZE_TYPE, /* `__SIZE_TYPE__' */ | |
815 | T_PTRDIFF_TYPE, /* `__PTRDIFF_TYPE__' */ | |
816 | T_WCHAR_TYPE, /* `__WCHAR_TYPE__' */ | |
0df69870 ILT |
817 | T_USER_LABEL_PREFIX_TYPE, /* `__USER_LABEL_PREFIX__' */ |
818 | T_REGISTER_PREFIX_TYPE, /* `__REGISTER_PREFIX__' */ | |
a9ce110c | 819 | T_IMMEDIATE_PREFIX_TYPE, /* `__IMMEDIATE_PREFIX__' */ |
b0bbbd85 RS |
820 | T_TIME, /* `__TIME__' */ |
821 | T_CONST, /* Constant value, used by `__STDC__' */ | |
822 | T_MACRO, /* macro defined by `#define' */ | |
823 | T_DISABLED, /* macro temporarily turned off for rescan */ | |
824 | T_SPEC_DEFINED, /* special `defined' macro for use in #if statements */ | |
825 | T_PCSTRING, /* precompiled string (hashval is KEYDEF *) */ | |
826 | T_UNUSED /* Used for something not defined. */ | |
827 | }; | |
828 | ||
829 | struct hashnode { | |
830 | struct hashnode *next; /* double links for easy deletion */ | |
831 | struct hashnode *prev; | |
832 | struct hashnode **bucket_hdr; /* also, a back pointer to this node's hash | |
833 | chain is kept, in case the node is the head | |
0f41302f | 834 | of the chain and gets deleted. */ |
b0bbbd85 RS |
835 | enum node_type type; /* type of special token */ |
836 | int length; /* length of token, for quick comparison */ | |
837 | U_CHAR *name; /* the actual name */ | |
838 | union hashval value; /* pointer to expansion, or whatever */ | |
839 | }; | |
840 | ||
841 | typedef struct hashnode HASHNODE; | |
842 | ||
843 | /* Some definitions for the hash table. The hash function MUST be | |
844 | computed as shown in hashf () below. That is because the rescan | |
845 | loop computes the hash value `on the fly' for most tokens, | |
846 | in order to avoid the overhead of a lot of procedure calls to | |
847 | the hashf () function. Hashf () only exists for the sake of | |
0f41302f | 848 | politeness, for use when speed isn't so important. */ |
b0bbbd85 RS |
849 | |
850 | #define HASHSIZE 1403 | |
851 | static HASHNODE *hashtab[HASHSIZE]; | |
852 | #define HASHSTEP(old, c) ((old << 2) + c) | |
853 | #define MAKE_POS(v) (v & 0x7fffffff) /* make number positive */ | |
854 | ||
855 | /* Symbols to predefine. */ | |
856 | ||
857 | #ifdef CPP_PREDEFINES | |
858 | static char *predefs = CPP_PREDEFINES; | |
859 | #else | |
860 | static char *predefs = ""; | |
861 | #endif | |
862 | \f | |
863 | /* We let tm.h override the types used here, to handle trivial differences | |
864 | such as the choice of unsigned int or long unsigned int for size_t. | |
865 | When machines start needing nontrivial differences in the size type, | |
866 | it would be best to do something here to figure out automatically | |
867 | from other information what type to use. */ | |
868 | ||
767d412c | 869 | /* The string value for __SIZE_TYPE__. */ |
b0bbbd85 RS |
870 | |
871 | #ifndef SIZE_TYPE | |
872 | #define SIZE_TYPE "long unsigned int" | |
873 | #endif | |
874 | ||
767d412c | 875 | /* The string value for __PTRDIFF_TYPE__. */ |
b0bbbd85 RS |
876 | |
877 | #ifndef PTRDIFF_TYPE | |
878 | #define PTRDIFF_TYPE "long int" | |
879 | #endif | |
880 | ||
767d412c | 881 | /* The string value for __WCHAR_TYPE__. */ |
b0bbbd85 RS |
882 | |
883 | #ifndef WCHAR_TYPE | |
884 | #define WCHAR_TYPE "int" | |
885 | #endif | |
767d412c JM |
886 | char * wchar_type = WCHAR_TYPE; |
887 | #undef WCHAR_TYPE | |
0df69870 ILT |
888 | |
889 | /* The string value for __USER_LABEL_PREFIX__ */ | |
890 | ||
891 | #ifndef USER_LABEL_PREFIX | |
892 | #define USER_LABEL_PREFIX "" | |
893 | #endif | |
894 | ||
895 | /* The string value for __REGISTER_PREFIX__ */ | |
896 | ||
897 | #ifndef REGISTER_PREFIX | |
898 | #define REGISTER_PREFIX "" | |
899 | #endif | |
a9ce110c KR |
900 | |
901 | /* The string value for __IMMEDIATE_PREFIX__ */ | |
902 | ||
903 | #ifndef IMMEDIATE_PREFIX | |
904 | #define IMMEDIATE_PREFIX "" | |
905 | #endif | |
b0bbbd85 RS |
906 | \f |
907 | /* In the definition of a #assert name, this structure forms | |
908 | a list of the individual values asserted. | |
909 | Each value is itself a list of "tokens". | |
910 | These are strings that are compared by name. */ | |
911 | ||
912 | struct tokenlist_list { | |
913 | struct tokenlist_list *next; | |
914 | struct arglist *tokens; | |
915 | }; | |
916 | ||
917 | struct assertion_hashnode { | |
918 | struct assertion_hashnode *next; /* double links for easy deletion */ | |
919 | struct assertion_hashnode *prev; | |
920 | /* also, a back pointer to this node's hash | |
921 | chain is kept, in case the node is the head | |
0f41302f | 922 | of the chain and gets deleted. */ |
b0bbbd85 RS |
923 | struct assertion_hashnode **bucket_hdr; |
924 | int length; /* length of token, for quick comparison */ | |
925 | U_CHAR *name; /* the actual name */ | |
926 | /* List of token-sequences. */ | |
927 | struct tokenlist_list *value; | |
928 | }; | |
929 | ||
930 | typedef struct assertion_hashnode ASSERTION_HASHNODE; | |
931 | ||
932 | /* Some definitions for the hash table. The hash function MUST be | |
34a2d6f3 | 933 | computed as shown in hashf below. That is because the rescan |
b0bbbd85 RS |
934 | loop computes the hash value `on the fly' for most tokens, |
935 | in order to avoid the overhead of a lot of procedure calls to | |
34a2d6f3 | 936 | the hashf function. hashf only exists for the sake of |
0f41302f | 937 | politeness, for use when speed isn't so important. */ |
b0bbbd85 RS |
938 | |
939 | #define ASSERTION_HASHSIZE 37 | |
940 | static ASSERTION_HASHNODE *assertion_hashtab[ASSERTION_HASHSIZE]; | |
941 | ||
942 | /* Nonzero means inhibit macroexpansion of what seem to be | |
943 | assertion tests, in rescan. For #if. */ | |
944 | static int assertions_flag; | |
945 | \f | |
946 | /* `struct directive' defines one #-directive, including how to handle it. */ | |
947 | ||
25cbb59e RK |
948 | #define DO_PROTO PROTO((U_CHAR *, U_CHAR *, FILE_BUF *, struct directive *)) |
949 | ||
b0bbbd85 RS |
950 | struct directive { |
951 | int length; /* Length of name */ | |
25cbb59e | 952 | int (*func) DO_PROTO; /* Function to handle directive */ |
b0bbbd85 | 953 | char *name; /* Name of directive */ |
0f41302f | 954 | enum node_type type; /* Code which describes which directive. */ |
b0bbbd85 RS |
955 | char angle_brackets; /* Nonzero => <...> is special. */ |
956 | char traditional_comments; /* Nonzero: keep comments if -traditional. */ | |
957 | char pass_thru; /* Copy preprocessed directive to output file. */ | |
958 | }; | |
959 | ||
25cbb59e RK |
960 | /* These functions are declared to return int instead of void since they |
961 | are going to be placed in the table and some old compilers have trouble with | |
962 | pointers to functions returning void. */ | |
963 | ||
964 | static int do_assert DO_PROTO; | |
965 | static int do_define DO_PROTO; | |
966 | static int do_elif DO_PROTO; | |
967 | static int do_else DO_PROTO; | |
968 | static int do_endif DO_PROTO; | |
969 | static int do_error DO_PROTO; | |
970 | static int do_ident DO_PROTO; | |
971 | static int do_if DO_PROTO; | |
972 | static int do_include DO_PROTO; | |
973 | static int do_line DO_PROTO; | |
974 | static int do_pragma DO_PROTO; | |
975 | #ifdef SCCS_DIRECTIVE | |
976 | static int do_sccs DO_PROTO; | |
977 | #endif | |
978 | static int do_unassert DO_PROTO; | |
979 | static int do_undef DO_PROTO; | |
980 | static int do_warning DO_PROTO; | |
981 | static int do_xifdef DO_PROTO; | |
982 | ||
b0bbbd85 RS |
983 | /* Here is the actual list of #-directives, most-often-used first. */ |
984 | ||
985 | static struct directive directive_table[] = { | |
986 | { 6, do_define, "define", T_DEFINE, 0, 1}, | |
987 | { 2, do_if, "if", T_IF}, | |
988 | { 5, do_xifdef, "ifdef", T_IFDEF}, | |
989 | { 6, do_xifdef, "ifndef", T_IFNDEF}, | |
990 | { 5, do_endif, "endif", T_ENDIF}, | |
991 | { 4, do_else, "else", T_ELSE}, | |
992 | { 4, do_elif, "elif", T_ELIF}, | |
993 | { 4, do_line, "line", T_LINE}, | |
994 | { 7, do_include, "include", T_INCLUDE, 1}, | |
995 | { 12, do_include, "include_next", T_INCLUDE_NEXT, 1}, | |
996 | { 6, do_include, "import", T_IMPORT, 1}, | |
997 | { 5, do_undef, "undef", T_UNDEF}, | |
998 | { 5, do_error, "error", T_ERROR}, | |
999 | { 7, do_warning, "warning", T_WARNING}, | |
1000 | #ifdef SCCS_DIRECTIVE | |
1001 | { 4, do_sccs, "sccs", T_SCCS}, | |
1002 | #endif | |
1003 | { 6, do_pragma, "pragma", T_PRAGMA, 0, 0, 1}, | |
a3fb124a | 1004 | { 5, do_ident, "ident", T_IDENT}, |
b0bbbd85 RS |
1005 | { 6, do_assert, "assert", T_ASSERT}, |
1006 | { 8, do_unassert, "unassert", T_UNASSERT}, | |
1007 | { -1, 0, "", T_UNUSED}, | |
1008 | }; | |
1009 | ||
1010 | /* When a directive handler is called, | |
91dbf5e7 | 1011 | this points to the # (or the : of the %:) that started the directive. */ |
b0bbbd85 RS |
1012 | U_CHAR *directive_start; |
1013 | ||
0f41302f | 1014 | /* table to tell if char can be part of a C identifier. */ |
b0bbbd85 | 1015 | U_CHAR is_idchar[256]; |
0f41302f | 1016 | /* table to tell if char can be first char of a c identifier. */ |
b0bbbd85 RS |
1017 | U_CHAR is_idstart[256]; |
1018 | /* table to tell if c is horizontal space. */ | |
1019 | U_CHAR is_hor_space[256]; | |
1020 | /* table to tell if c is horizontal or vertical space. */ | |
1021 | static U_CHAR is_space[256]; | |
c03413c7 RK |
1022 | /* names of some characters */ |
1023 | static char *char_name[256]; | |
b0bbbd85 RS |
1024 | |
1025 | #define SKIP_WHITE_SPACE(p) do { while (is_hor_space[*p]) p++; } while (0) | |
1026 | #define SKIP_ALL_WHITE_SPACE(p) do { while (is_space[*p]) p++; } while (0) | |
1027 | ||
1028 | static int errors = 0; /* Error counter for exit code */ | |
1029 | ||
d50c1d49 RS |
1030 | /* Name of output file, for error messages. */ |
1031 | static char *out_fname; | |
1032 | ||
b0bbbd85 RS |
1033 | /* Zero means dollar signs are punctuation. |
1034 | -$ stores 0; -traditional may store 1. Default is 1 for VMS, 0 otherwise. | |
1035 | This must be 0 for correct processing of this ANSI C program: | |
1036 | #define foo(a) #a | |
ad0c9fa1 | 1037 | #define lose(b) foo (b) |
b0bbbd85 | 1038 | #define test$ |
ad0c9fa1 | 1039 | lose (test) */ |
b0bbbd85 RS |
1040 | static int dollars_in_ident; |
1041 | #ifndef DOLLARS_IN_IDENTIFIERS | |
1042 | #define DOLLARS_IN_IDENTIFIERS 1 | |
1043 | #endif | |
1044 | ||
b0bbbd85 RS |
1045 | |
1046 | /* Stack of conditionals currently in progress | |
1047 | (including both successful and failing conditionals). */ | |
1048 | ||
1049 | struct if_stack { | |
1050 | struct if_stack *next; /* for chaining to the next stack frame */ | |
1051 | char *fname; /* copied from input when frame is made */ | |
1052 | int lineno; /* similarly */ | |
1053 | int if_succeeded; /* true if a leg of this if-group | |
1054 | has been passed through rescan */ | |
1055 | U_CHAR *control_macro; /* For #ifndef at start of file, | |
1056 | this is the macro name tested. */ | |
1057 | enum node_type type; /* type of last directive seen in this group */ | |
1058 | }; | |
1059 | typedef struct if_stack IF_STACK_FRAME; | |
1060 | static IF_STACK_FRAME *if_stack = NULL; | |
1061 | ||
1062 | /* Buffer of -M output. */ | |
1063 | static char *deps_buffer; | |
1064 | ||
1065 | /* Number of bytes allocated in above. */ | |
1066 | static int deps_allocated_size; | |
1067 | ||
1068 | /* Number of bytes used. */ | |
1069 | static int deps_size; | |
1070 | ||
1071 | /* Number of bytes since the last newline. */ | |
1072 | static int deps_column; | |
1073 | ||
b0bbbd85 RS |
1074 | /* Nonzero means -I- has been seen, |
1075 | so don't look for #include "foo" the source-file directory. */ | |
1076 | static int ignore_srcdir; | |
1077 | \f | |
25cbb59e RK |
1078 | static int safe_read PROTO((int, char *, int)); |
1079 | static void safe_write PROTO((int, char *, int)); | |
1080 | ||
1081 | int main PROTO((int, char **)); | |
1082 | ||
1083 | static void path_include PROTO((char *)); | |
1084 | ||
1085 | static U_CHAR *index0 PROTO((U_CHAR *, int, size_t)); | |
1086 | ||
1087 | static void trigraph_pcp PROTO((FILE_BUF *)); | |
1088 | ||
1089 | static void newline_fix PROTO((U_CHAR *)); | |
1090 | static void name_newline_fix PROTO((U_CHAR *)); | |
1091 | ||
1092 | static char *get_lintcmd PROTO((U_CHAR *, U_CHAR *, U_CHAR **, int *, int *)); | |
1093 | ||
1094 | static void rescan PROTO((FILE_BUF *, int)); | |
1095 | ||
1096 | static FILE_BUF expand_to_temp_buffer PROTO((U_CHAR *, U_CHAR *, int, int)); | |
1097 | ||
1098 | static int handle_directive PROTO((FILE_BUF *, FILE_BUF *)); | |
1099 | ||
1100 | static struct tm *timestamp PROTO((void)); | |
1101 | static void special_symbol PROTO((HASHNODE *, FILE_BUF *)); | |
1102 | ||
aa6b6385 | 1103 | static int is_system_include PROTO((char *)); |
3e4115b7 RK |
1104 | static char *base_name PROTO((char *)); |
1105 | static int absolute_filename PROTO((char *)); | |
1106 | static size_t simplify_filename PROTO((char *)); | |
25cbb59e RK |
1107 | |
1108 | static char *read_filename_string PROTO((int, FILE *)); | |
1109 | static struct file_name_map *read_name_map PROTO((char *)); | |
3e4115b7 RK |
1110 | static int open_include_file PROTO((char *, struct file_name_list *, U_CHAR *, struct include_file **)); |
1111 | static char *remap_include_file PROTO((char *, struct file_name_list *)); | |
1112 | static int lookup_ino_include PROTO((struct include_file *)); | |
25cbb59e | 1113 | |
3e4115b7 RK |
1114 | static void finclude PROTO((int, struct include_file *, FILE_BUF *, int, struct file_name_list *)); |
1115 | static void record_control_macro PROTO((struct include_file *, U_CHAR *)); | |
25cbb59e | 1116 | |
3e4115b7 | 1117 | static char *check_precompiled PROTO((int, struct stat *, char *, char **)); |
25cbb59e RK |
1118 | static int check_preconditions PROTO((char *)); |
1119 | static void pcfinclude PROTO((U_CHAR *, U_CHAR *, U_CHAR *, FILE_BUF *)); | |
1120 | static void pcstring_used PROTO((HASHNODE *)); | |
1121 | static void write_output PROTO((void)); | |
1122 | static void pass_thru_directive PROTO((U_CHAR *, U_CHAR *, FILE_BUF *, struct directive *)); | |
1123 | ||
1124 | static MACRODEF create_definition PROTO((U_CHAR *, U_CHAR *, FILE_BUF *)); | |
1125 | ||
1126 | static int check_macro_name PROTO((U_CHAR *, char *)); | |
1127 | static int compare_defs PROTO((DEFINITION *, DEFINITION *)); | |
1128 | static int comp_def_part PROTO((int, U_CHAR *, int, U_CHAR *, int, int)); | |
1129 | ||
1130 | static DEFINITION *collect_expansion PROTO((U_CHAR *, U_CHAR *, int, struct arglist *)); | |
1131 | ||
1132 | int check_assertion PROTO((U_CHAR *, int, int, struct arglist *)); | |
1133 | static int compare_token_lists PROTO((struct arglist *, struct arglist *)); | |
1134 | ||
1135 | static struct arglist *read_token_list PROTO((U_CHAR **, U_CHAR *, int *)); | |
1136 | static void free_token_list PROTO((struct arglist *)); | |
1137 | ||
1138 | static ASSERTION_HASHNODE *assertion_install PROTO((U_CHAR *, int, int)); | |
1139 | static ASSERTION_HASHNODE *assertion_lookup PROTO((U_CHAR *, int, int)); | |
1140 | static void delete_assertion PROTO((ASSERTION_HASHNODE *)); | |
1141 | ||
1142 | static void do_once PROTO((void)); | |
1143 | ||
047380ca | 1144 | static HOST_WIDE_INT eval_if_expression PROTO((U_CHAR *, int)); |
25cbb59e RK |
1145 | static void conditional_skip PROTO((FILE_BUF *, int, enum node_type, U_CHAR *, FILE_BUF *)); |
1146 | static void skip_if_group PROTO((FILE_BUF *, int, FILE_BUF *)); | |
35b28a7a | 1147 | static void validate_else PROTO((U_CHAR *, U_CHAR *)); |
25cbb59e RK |
1148 | |
1149 | static U_CHAR *skip_to_end_of_comment PROTO((FILE_BUF *, int *, int)); | |
1150 | static U_CHAR *skip_quoted_string PROTO((U_CHAR *, U_CHAR *, int, int *, int *, int *)); | |
1151 | static char *quote_string PROTO((char *, char *)); | |
1152 | static U_CHAR *skip_paren_group PROTO((FILE_BUF *)); | |
1153 | ||
1154 | /* Last arg to output_line_directive. */ | |
1155 | enum file_change_code {same_file, enter_file, leave_file}; | |
1156 | static void output_line_directive PROTO((FILE_BUF *, FILE_BUF *, int, enum file_change_code)); | |
1157 | ||
1158 | static void macroexpand PROTO((HASHNODE *, FILE_BUF *)); | |
1159 | ||
1160 | struct argdata; | |
1161 | static char *macarg PROTO((struct argdata *, int)); | |
1162 | ||
1163 | static U_CHAR *macarg1 PROTO((U_CHAR *, U_CHAR *, int *, int *, int *, int)); | |
1164 | ||
1165 | static int discard_comments PROTO((U_CHAR *, int, int)); | |
1166 | ||
1167 | static int change_newlines PROTO((U_CHAR *, int)); | |
1168 | ||
1169 | char *my_strerror PROTO((int)); | |
1170 | void error PRINTF_PROTO_1((char *, ...)); | |
1171 | static void verror PROTO((char *, va_list)); | |
1172 | static void error_from_errno PROTO((char *)); | |
1173 | void warning PRINTF_PROTO_1((char *, ...)); | |
1174 | static void vwarning PROTO((char *, va_list)); | |
1175 | static void error_with_line PRINTF_PROTO_2((int, char *, ...)); | |
1176 | static void verror_with_line PROTO((int, char *, va_list)); | |
1177 | static void vwarning_with_line PROTO((int, char *, va_list)); | |
4ba09fc9 | 1178 | static void warning_with_line PRINTF_PROTO_2((int, char *, ...)); |
25cbb59e RK |
1179 | void pedwarn PRINTF_PROTO_1((char *, ...)); |
1180 | void pedwarn_with_line PRINTF_PROTO_2((int, char *, ...)); | |
1181 | static void pedwarn_with_file_and_line PRINTF_PROTO_3((char *, int, char *, ...)); | |
1182 | ||
1183 | static void print_containing_files PROTO((void)); | |
1184 | ||
1185 | static int line_for_error PROTO((int)); | |
1186 | static int grow_outbuf PROTO((FILE_BUF *, int)); | |
1187 | ||
1188 | static HASHNODE *install PROTO((U_CHAR *, int, enum node_type, char *, int)); | |
1189 | HASHNODE *lookup PROTO((U_CHAR *, int, int)); | |
1190 | static void delete_macro PROTO((HASHNODE *)); | |
1191 | static int hashf PROTO((U_CHAR *, int, int)); | |
1192 | ||
1193 | static void dump_single_macro PROTO((HASHNODE *, FILE *)); | |
1194 | static void dump_all_macros PROTO((void)); | |
1195 | static void dump_defn_1 PROTO((U_CHAR *, int, int, FILE *)); | |
1196 | static void dump_arg_n PROTO((DEFINITION *, int, FILE *)); | |
1197 | ||
1198 | static void initialize_char_syntax PROTO((void)); | |
1199 | static void initialize_builtins PROTO((FILE_BUF *, FILE_BUF *)); | |
1200 | ||
1201 | static void make_definition PROTO((char *, FILE_BUF *)); | |
1202 | static void make_undef PROTO((char *, FILE_BUF *)); | |
1203 | ||
1204 | static void make_assertion PROTO((char *, char *)); | |
1205 | ||
3e4115b7 | 1206 | static struct file_name_list *new_include_prefix PROTO((struct file_name_list *, char *, char *)); |
25cbb59e RK |
1207 | static void append_include_chain PROTO((struct file_name_list *, struct file_name_list *)); |
1208 | ||
1209 | static void deps_output PROTO((char *, int)); | |
1210 | ||
1211 | static void fatal PRINTF_PROTO_1((char *, ...)) __attribute__ ((noreturn)); | |
1212 | void fancy_abort PROTO((void)) __attribute__ ((noreturn)); | |
1213 | static void perror_with_name PROTO((char *)); | |
1214 | static void pfatal_with_name PROTO((char *)) __attribute__ ((noreturn)); | |
1215 | static void pipe_closed PROTO((int)) __attribute__ ((noreturn)); | |
1216 | ||
1217 | static void memory_full PROTO((void)) __attribute__ ((noreturn)); | |
1218 | GENERIC_PTR xmalloc PROTO((size_t)); | |
1219 | static GENERIC_PTR xrealloc PROTO((GENERIC_PTR, size_t)); | |
1220 | static GENERIC_PTR xcalloc PROTO((size_t, size_t)); | |
1221 | static char *savestring PROTO((char *)); | |
25cbb59e | 1222 | \f |
bb7de822 | 1223 | /* Read LEN bytes at PTR from descriptor DESC, for file FILENAME, |
53e52f00 RK |
1224 | retrying if necessary. Return a negative value if an error occurs, |
1225 | otherwise return the actual number of bytes read, | |
1226 | which must be LEN unless end-of-file was reached. */ | |
bb7de822 RS |
1227 | |
1228 | static int | |
1229 | safe_read (desc, ptr, len) | |
1230 | int desc; | |
1231 | char *ptr; | |
1232 | int len; | |
1233 | { | |
1234 | int left = len; | |
1235 | while (left > 0) { | |
1236 | int nchars = read (desc, ptr, left); | |
1237 | if (nchars < 0) | |
c9a8a295 RS |
1238 | { |
1239 | #ifdef EINTR | |
1240 | if (errno == EINTR) | |
1241 | continue; | |
1242 | #endif | |
1243 | return nchars; | |
1244 | } | |
bb7de822 RS |
1245 | if (nchars == 0) |
1246 | break; | |
1247 | ptr += nchars; | |
1248 | left -= nchars; | |
1249 | } | |
1250 | return len - left; | |
1251 | } | |
1252 | ||
1253 | /* Write LEN bytes at PTR to descriptor DESC, | |
1254 | retrying if necessary, and treating any real error as fatal. */ | |
1255 | ||
1256 | static void | |
1257 | safe_write (desc, ptr, len) | |
1258 | int desc; | |
1259 | char *ptr; | |
1260 | int len; | |
1261 | { | |
1262 | while (len > 0) { | |
1263 | int written = write (desc, ptr, len); | |
1264 | if (written < 0) | |
c9a8a295 RS |
1265 | { |
1266 | #ifdef EINTR | |
1267 | if (errno == EINTR) | |
1268 | continue; | |
1269 | #endif | |
1270 | pfatal_with_name (out_fname); | |
1271 | } | |
bb7de822 RS |
1272 | ptr += written; |
1273 | len -= written; | |
1274 | } | |
1275 | } | |
1276 | \f | |
b0bbbd85 RS |
1277 | int |
1278 | main (argc, argv) | |
1279 | int argc; | |
1280 | char **argv; | |
1281 | { | |
3e4115b7 | 1282 | struct stat st; |
d50c1d49 | 1283 | char *in_fname; |
25cbb59e | 1284 | char *cp; |
b0bbbd85 RS |
1285 | int f, i; |
1286 | FILE_BUF *fp; | |
1287 | char **pend_files = (char **) xmalloc (argc * sizeof (char *)); | |
1288 | char **pend_defs = (char **) xmalloc (argc * sizeof (char *)); | |
1289 | char **pend_undefs = (char **) xmalloc (argc * sizeof (char *)); | |
1290 | char **pend_assertions = (char **) xmalloc (argc * sizeof (char *)); | |
1291 | char **pend_includes = (char **) xmalloc (argc * sizeof (char *)); | |
1292 | ||
1293 | /* Record the option used with each element of pend_assertions. | |
1294 | This is preparation for supporting more than one option for making | |
1295 | an assertion. */ | |
1296 | char **pend_assertion_options = (char **) xmalloc (argc * sizeof (char *)); | |
1297 | int inhibit_predefs = 0; | |
1298 | int no_standard_includes = 0; | |
2378088a | 1299 | int no_standard_cplusplus_includes = 0; |
b0bbbd85 RS |
1300 | int missing_newline = 0; |
1301 | ||
1302 | /* Non-0 means don't output the preprocessed program. */ | |
1303 | int inhibit_output = 0; | |
e6157ab4 RS |
1304 | /* Non-0 means -v, so print the full set of include dirs. */ |
1305 | int verbose = 0; | |
b0bbbd85 | 1306 | |
566609f8 RS |
1307 | /* File name which deps are being written to. |
1308 | This is 0 if deps are being written to stdout. */ | |
1309 | char *deps_file = 0; | |
d0691cfb RS |
1310 | /* Fopen file mode to open deps_file with. */ |
1311 | char *deps_mode = "a"; | |
b0bbbd85 RS |
1312 | /* Stream on which to print the dependency information. */ |
1313 | FILE *deps_stream = 0; | |
1314 | /* Target-name to write with the dependency information. */ | |
1315 | char *deps_target = 0; | |
1316 | ||
1317 | #ifdef RLIMIT_STACK | |
1318 | /* Get rid of any avoidable limit on stack size. */ | |
1319 | { | |
1320 | struct rlimit rlim; | |
1321 | ||
1322 | /* Set the stack limit huge so that alloca (particularly stringtab | |
0f41302f | 1323 | in dbxread.c) does not fail. */ |
b0bbbd85 RS |
1324 | getrlimit (RLIMIT_STACK, &rlim); |
1325 | rlim.rlim_cur = rlim.rlim_max; | |
1326 | setrlimit (RLIMIT_STACK, &rlim); | |
1327 | } | |
1328 | #endif /* RLIMIT_STACK defined */ | |
1329 | ||
0e576005 | 1330 | #ifdef SIGPIPE |
9e263fc4 | 1331 | signal (SIGPIPE, pipe_closed); |
0e576005 | 1332 | #endif |
9e263fc4 | 1333 | |
3e4115b7 | 1334 | progname = base_name (argv[0]); |
3dac0de5 | 1335 | |
b0bbbd85 RS |
1336 | #ifdef VMS |
1337 | { | |
3e4115b7 | 1338 | /* Remove extension from PROGNAME. */ |
25cbb59e | 1339 | char *p; |
3e4115b7 | 1340 | char *s = progname = savestring (progname); |
71efde97 | 1341 | |
71efde97 RK |
1342 | if ((p = rindex (s, ';')) != 0) *p = '\0'; /* strip version number */ |
1343 | if ((p = rindex (s, '.')) != 0 /* strip type iff ".exe" */ | |
1344 | && (p[1] == 'e' || p[1] == 'E') | |
1345 | && (p[2] == 'x' || p[2] == 'X') | |
1346 | && (p[3] == 'e' || p[3] == 'E') | |
1347 | && !p[4]) | |
1348 | *p = '\0'; | |
b0bbbd85 RS |
1349 | } |
1350 | #endif | |
1351 | ||
1352 | in_fname = NULL; | |
1353 | out_fname = NULL; | |
1354 | ||
1355 | /* Initialize is_idchar to allow $. */ | |
1356 | dollars_in_ident = 1; | |
1357 | initialize_char_syntax (); | |
1358 | dollars_in_ident = DOLLARS_IN_IDENTIFIERS > 0; | |
1359 | ||
adcfa681 | 1360 | no_line_directives = 0; |
b0bbbd85 RS |
1361 | no_trigraphs = 1; |
1362 | dump_macros = dump_none; | |
1363 | no_output = 0; | |
1364 | cplusplus = 0; | |
bc35f8c2 | 1365 | cplusplus_comments = 1; |
b0bbbd85 | 1366 | |
4c9a05bc RK |
1367 | bzero ((char *) pend_files, argc * sizeof (char *)); |
1368 | bzero ((char *) pend_defs, argc * sizeof (char *)); | |
1369 | bzero ((char *) pend_undefs, argc * sizeof (char *)); | |
1370 | bzero ((char *) pend_assertions, argc * sizeof (char *)); | |
1371 | bzero ((char *) pend_includes, argc * sizeof (char *)); | |
b0bbbd85 RS |
1372 | |
1373 | /* Process switches and find input file name. */ | |
1374 | ||
1375 | for (i = 1; i < argc; i++) { | |
1376 | if (argv[i][0] != '-') { | |
1377 | if (out_fname != NULL) | |
1378 | fatal ("Usage: %s [switches] input output", argv[0]); | |
1379 | else if (in_fname != NULL) | |
1380 | out_fname = argv[i]; | |
1381 | else | |
1382 | in_fname = argv[i]; | |
1383 | } else { | |
1384 | switch (argv[i][1]) { | |
1385 | ||
1386 | case 'i': | |
1387 | if (!strcmp (argv[i], "-include")) { | |
1388 | if (i + 1 == argc) | |
d0691cfb | 1389 | fatal ("Filename missing after `-include' option"); |
b0bbbd85 | 1390 | else |
3e4115b7 | 1391 | simplify_filename (pend_includes[i] = argv[++i]); |
b0bbbd85 RS |
1392 | } |
1393 | if (!strcmp (argv[i], "-imacros")) { | |
1394 | if (i + 1 == argc) | |
d0691cfb | 1395 | fatal ("Filename missing after `-imacros' option"); |
b0bbbd85 | 1396 | else |
3e4115b7 | 1397 | simplify_filename (pend_files[i] = argv[++i]); |
b0bbbd85 | 1398 | } |
bec42276 RS |
1399 | if (!strcmp (argv[i], "-iprefix")) { |
1400 | if (i + 1 == argc) | |
d0691cfb | 1401 | fatal ("Filename missing after `-iprefix' option"); |
bec42276 RS |
1402 | else |
1403 | include_prefix = argv[++i]; | |
1404 | } | |
bbd4b75b RS |
1405 | if (!strcmp (argv[i], "-ifoutput")) { |
1406 | output_conditionals = 1; | |
1407 | } | |
b0866c74 JW |
1408 | if (!strcmp (argv[i], "-isystem")) { |
1409 | struct file_name_list *dirtmp; | |
1410 | ||
3e4115b7 RK |
1411 | if (! (dirtmp = new_include_prefix (NULL_PTR, "", argv[++i]))) |
1412 | break; | |
b0866c74 | 1413 | dirtmp->c_system_include_path = 1; |
b0866c74 JW |
1414 | |
1415 | if (before_system == 0) | |
1416 | before_system = dirtmp; | |
1417 | else | |
1418 | last_before_system->next = dirtmp; | |
1419 | last_before_system = dirtmp; /* Tail follows the last one */ | |
1420 | } | |
d0691cfb RS |
1421 | /* Add directory to end of path for includes, |
1422 | with the default prefix at the front of its name. */ | |
1423 | if (!strcmp (argv[i], "-iwithprefix")) { | |
1424 | struct file_name_list *dirtmp; | |
d19184d6 RS |
1425 | char *prefix; |
1426 | ||
1427 | if (include_prefix != 0) | |
1428 | prefix = include_prefix; | |
1429 | else { | |
1430 | prefix = savestring (GCC_INCLUDE_DIR); | |
1431 | /* Remove the `include' from /usr/local/lib/gcc.../include. */ | |
1432 | if (!strcmp (prefix + strlen (prefix) - 8, "/include")) | |
1433 | prefix[strlen (prefix) - 7] = 0; | |
1434 | } | |
d0691cfb | 1435 | |
3e4115b7 RK |
1436 | if (! (dirtmp = new_include_prefix (NULL_PTR, prefix, argv[++i]))) |
1437 | break; | |
d0691cfb RS |
1438 | |
1439 | if (after_include == 0) | |
1440 | after_include = dirtmp; | |
1441 | else | |
1442 | last_after_include->next = dirtmp; | |
1443 | last_after_include = dirtmp; /* Tail follows the last one */ | |
1444 | } | |
d19184d6 RS |
1445 | /* Add directory to main path for includes, |
1446 | with the default prefix at the front of its name. */ | |
1447 | if (!strcmp (argv[i], "-iwithprefixbefore")) { | |
1448 | struct file_name_list *dirtmp; | |
1449 | char *prefix; | |
1450 | ||
1451 | if (include_prefix != 0) | |
1452 | prefix = include_prefix; | |
1453 | else { | |
1454 | prefix = savestring (GCC_INCLUDE_DIR); | |
1455 | /* Remove the `include' from /usr/local/lib/gcc.../include. */ | |
1456 | if (!strcmp (prefix + strlen (prefix) - 8, "/include")) | |
1457 | prefix[strlen (prefix) - 7] = 0; | |
1458 | } | |
1459 | ||
3e4115b7 | 1460 | dirtmp = new_include_prefix (NULL_PTR, prefix, argv[++i]); |
d19184d6 RS |
1461 | append_include_chain (dirtmp, dirtmp); |
1462 | } | |
b0bbbd85 RS |
1463 | /* Add directory to end of path for includes. */ |
1464 | if (!strcmp (argv[i], "-idirafter")) { | |
1465 | struct file_name_list *dirtmp; | |
1466 | ||
3e4115b7 RK |
1467 | if (! (dirtmp = new_include_prefix (NULL_PTR, "", argv[++i]))) |
1468 | break; | |
b0bbbd85 | 1469 | |
6489924b RS |
1470 | if (after_include == 0) |
1471 | after_include = dirtmp; | |
1472 | else | |
1473 | last_after_include->next = dirtmp; | |
1474 | last_after_include = dirtmp; /* Tail follows the last one */ | |
b0bbbd85 RS |
1475 | } |
1476 | break; | |
1477 | ||
1478 | case 'o': | |
1479 | if (out_fname != NULL) | |
1480 | fatal ("Output filename specified twice"); | |
1481 | if (i + 1 == argc) | |
1482 | fatal ("Filename missing after -o option"); | |
1483 | out_fname = argv[++i]; | |
1484 | if (!strcmp (out_fname, "-")) | |
1485 | out_fname = ""; | |
1486 | break; | |
1487 | ||
1488 | case 'p': | |
1489 | if (!strcmp (argv[i], "-pedantic")) | |
1490 | pedantic = 1; | |
1491 | else if (!strcmp (argv[i], "-pedantic-errors")) { | |
1492 | pedantic = 1; | |
1493 | pedantic_errors = 1; | |
1494 | } else if (!strcmp (argv[i], "-pcp")) { | |
115ee359 RK |
1495 | char *pcp_fname; |
1496 | if (i + 1 == argc) | |
1497 | fatal ("Filename missing after -pcp option"); | |
1498 | pcp_fname = argv[++i]; | |
b0bbbd85 RS |
1499 | pcp_outfile = |
1500 | ((pcp_fname[0] != '-' || pcp_fname[1] != '\0') | |
1501 | ? fopen (pcp_fname, "w") | |
25cbb59e | 1502 | : stdout); |
b0bbbd85 RS |
1503 | if (pcp_outfile == 0) |
1504 | pfatal_with_name (pcp_fname); | |
1505 | no_precomp = 1; | |
1506 | } | |
1507 | break; | |
1508 | ||
1509 | case 't': | |
1510 | if (!strcmp (argv[i], "-traditional")) { | |
1511 | traditional = 1; | |
bc35f8c2 | 1512 | cplusplus_comments = 0; |
b0bbbd85 RS |
1513 | if (dollars_in_ident > 0) |
1514 | dollars_in_ident = 1; | |
1515 | } else if (!strcmp (argv[i], "-trigraphs")) { | |
1516 | no_trigraphs = 0; | |
1517 | } | |
1518 | break; | |
1519 | ||
1520 | case 'l': | |
1521 | if (! strcmp (argv[i], "-lang-c")) | |
bc35f8c2 RK |
1522 | cplusplus = 0, cplusplus_comments = 1, objc = 0; |
1523 | if (! strcmp (argv[i], "-lang-c89")) | |
eda5fa7b | 1524 | cplusplus = 0, cplusplus_comments = 0, objc = 0; |
b0bbbd85 | 1525 | if (! strcmp (argv[i], "-lang-c++")) |
eda5fa7b | 1526 | cplusplus = 1, cplusplus_comments = 1, objc = 0; |
b0bbbd85 | 1527 | if (! strcmp (argv[i], "-lang-objc")) |
eda5fa7b | 1528 | objc = 1, cplusplus = 0, cplusplus_comments = 1; |
b0bbbd85 | 1529 | if (! strcmp (argv[i], "-lang-objc++")) |
eda5fa7b | 1530 | objc = 1, cplusplus = 1, cplusplus_comments = 1; |
b0bbbd85 RS |
1531 | if (! strcmp (argv[i], "-lang-asm")) |
1532 | lang_asm = 1; | |
1533 | if (! strcmp (argv[i], "-lint")) | |
253245df | 1534 | for_lint = 1; |
b0bbbd85 RS |
1535 | break; |
1536 | ||
1537 | case '+': | |
eda5fa7b | 1538 | cplusplus = 1, cplusplus_comments = 1; |
b0bbbd85 RS |
1539 | break; |
1540 | ||
1541 | case 'w': | |
1542 | inhibit_warnings = 1; | |
1543 | break; | |
1544 | ||
1545 | case 'W': | |
1546 | if (!strcmp (argv[i], "-Wtrigraphs")) | |
1547 | warn_trigraphs = 1; | |
1548 | else if (!strcmp (argv[i], "-Wno-trigraphs")) | |
1549 | warn_trigraphs = 0; | |
1550 | else if (!strcmp (argv[i], "-Wcomment")) | |
1551 | warn_comments = 1; | |
1552 | else if (!strcmp (argv[i], "-Wno-comment")) | |
1553 | warn_comments = 0; | |
1554 | else if (!strcmp (argv[i], "-Wcomments")) | |
1555 | warn_comments = 1; | |
1556 | else if (!strcmp (argv[i], "-Wno-comments")) | |
1557 | warn_comments = 0; | |
1558 | else if (!strcmp (argv[i], "-Wtraditional")) | |
1559 | warn_stringify = 1; | |
1560 | else if (!strcmp (argv[i], "-Wno-traditional")) | |
1561 | warn_stringify = 0; | |
2aa7ec37 RS |
1562 | else if (!strcmp (argv[i], "-Wimport")) |
1563 | warn_import = 1; | |
1564 | else if (!strcmp (argv[i], "-Wno-import")) | |
1565 | warn_import = 0; | |
b0bbbd85 RS |
1566 | else if (!strcmp (argv[i], "-Werror")) |
1567 | warnings_are_errors = 1; | |
1568 | else if (!strcmp (argv[i], "-Wno-error")) | |
1569 | warnings_are_errors = 0; | |
1570 | else if (!strcmp (argv[i], "-Wall")) | |
1571 | { | |
1572 | warn_trigraphs = 1; | |
1573 | warn_comments = 1; | |
1574 | } | |
1575 | break; | |
1576 | ||
1577 | case 'M': | |
e648e0e3 | 1578 | /* The style of the choices here is a bit mixed. |
86739c7b DE |
1579 | The chosen scheme is a hybrid of keeping all options in one string |
1580 | and specifying each option in a separate argument: | |
1581 | -M|-MM|-MD file|-MMD file [-MG]. An alternative is: | |
e648e0e3 DE |
1582 | -M|-MM|-MD file|-MMD file|-MG|-MMG; or more concisely: |
1583 | -M[M][G][D file]. This is awkward to handle in specs, and is not | |
1584 | as extensible. */ | |
1585 | /* ??? -MG must be specified in addition to one of -M or -MM. | |
86739c7b DE |
1586 | This can be relaxed in the future without breaking anything. |
1587 | The converse isn't true. */ | |
1588 | ||
e648e0e3 | 1589 | /* -MG isn't valid with -MD or -MMD. This is checked for later. */ |
86739c7b DE |
1590 | if (!strcmp (argv[i], "-MG")) |
1591 | { | |
1592 | print_deps_missing_files = 1; | |
1593 | break; | |
1594 | } | |
b0bbbd85 RS |
1595 | if (!strcmp (argv[i], "-M")) |
1596 | print_deps = 2; | |
1597 | else if (!strcmp (argv[i], "-MM")) | |
1598 | print_deps = 1; | |
1599 | else if (!strcmp (argv[i], "-MD")) | |
1600 | print_deps = 2; | |
1601 | else if (!strcmp (argv[i], "-MMD")) | |
1602 | print_deps = 1; | |
1603 | /* For -MD and -MMD options, write deps on file named by next arg. */ | |
1604 | if (!strcmp (argv[i], "-MD") | |
1605 | || !strcmp (argv[i], "-MMD")) { | |
115ee359 RK |
1606 | if (i + 1 == argc) |
1607 | fatal ("Filename missing after %s option", argv[i]); | |
b0bbbd85 RS |
1608 | i++; |
1609 | deps_file = argv[i]; | |
d0691cfb | 1610 | deps_mode = "w"; |
b0bbbd85 RS |
1611 | } else { |
1612 | /* For -M and -MM, write deps on standard output | |
1613 | and suppress the usual output. */ | |
1614 | deps_stream = stdout; | |
1615 | inhibit_output = 1; | |
1616 | } | |
1617 | break; | |
1618 | ||
1619 | case 'd': | |
1620 | { | |
1621 | char *p = argv[i] + 2; | |
1622 | char c; | |
25cbb59e | 1623 | while ((c = *p++)) { |
b0bbbd85 RS |
1624 | /* Arg to -d specifies what parts of macros to dump */ |
1625 | switch (c) { | |
1626 | case 'M': | |
1627 | dump_macros = dump_only; | |
1628 | no_output = 1; | |
1629 | break; | |
1630 | case 'N': | |
1631 | dump_macros = dump_names; | |
1632 | break; | |
1633 | case 'D': | |
1634 | dump_macros = dump_definitions; | |
1635 | break; | |
1636 | } | |
1637 | } | |
1638 | } | |
1639 | break; | |
1640 | ||
1641 | case 'g': | |
1642 | if (argv[i][2] == '3') | |
1643 | debug_output = 1; | |
1644 | break; | |
1645 | ||
1646 | case 'v': | |
1647 | fprintf (stderr, "GNU CPP version %s", version_string); | |
1648 | #ifdef TARGET_VERSION | |
1649 | TARGET_VERSION; | |
1650 | #endif | |
1651 | fprintf (stderr, "\n"); | |
e6157ab4 | 1652 | verbose = 1; |
b0bbbd85 RS |
1653 | break; |
1654 | ||
1655 | case 'H': | |
1656 | print_include_names = 1; | |
1657 | break; | |
1658 | ||
1659 | case 'D': | |
2af5e9e2 RK |
1660 | if (argv[i][2] != 0) |
1661 | pend_defs[i] = argv[i] + 2; | |
1662 | else if (i + 1 == argc) | |
1663 | fatal ("Macro name missing after -D option"); | |
1664 | else | |
1665 | i++, pend_defs[i] = argv[i]; | |
b0bbbd85 RS |
1666 | break; |
1667 | ||
1668 | case 'A': | |
1669 | { | |
2af5e9e2 | 1670 | char *p; |
b0bbbd85 RS |
1671 | |
1672 | if (argv[i][2] != 0) | |
1673 | p = argv[i] + 2; | |
1674 | else if (i + 1 == argc) | |
1675 | fatal ("Assertion missing after -A option"); | |
1676 | else | |
1677 | p = argv[++i]; | |
1678 | ||
1679 | if (!strcmp (p, "-")) { | |
1680 | /* -A- eliminates all predefined macros and assertions. | |
1681 | Let's include also any that were specified earlier | |
1682 | on the command line. That way we can get rid of any | |
1683 | that were passed automatically in from GCC. */ | |
1684 | int j; | |
1685 | inhibit_predefs = 1; | |
1686 | for (j = 0; j < i; j++) | |
1687 | pend_defs[j] = pend_assertions[j] = 0; | |
1688 | } else { | |
1689 | pend_assertions[i] = p; | |
1690 | pend_assertion_options[i] = "-A"; | |
1691 | } | |
1692 | } | |
1693 | break; | |
1694 | ||
1695 | case 'U': /* JF #undef something */ | |
1696 | if (argv[i][2] != 0) | |
1697 | pend_undefs[i] = argv[i] + 2; | |
1698 | else if (i + 1 == argc) | |
1699 | fatal ("Macro name missing after -U option"); | |
1700 | else | |
1701 | pend_undefs[i] = argv[i+1], i++; | |
1702 | break; | |
1703 | ||
1704 | case 'C': | |
1705 | put_out_comments = 1; | |
1706 | break; | |
1707 | ||
1708 | case 'E': /* -E comes from cc -E; ignore it. */ | |
1709 | break; | |
1710 | ||
1711 | case 'P': | |
adcfa681 | 1712 | no_line_directives = 1; |
b0bbbd85 RS |
1713 | break; |
1714 | ||
1715 | case '$': /* Don't include $ in identifiers. */ | |
1716 | dollars_in_ident = 0; | |
1717 | break; | |
1718 | ||
1719 | case 'I': /* Add directory to path for includes. */ | |
1720 | { | |
1721 | struct file_name_list *dirtmp; | |
1722 | ||
6489924b | 1723 | if (! ignore_srcdir && !strcmp (argv[i] + 2, "-")) { |
b0bbbd85 | 1724 | ignore_srcdir = 1; |
6489924b RS |
1725 | /* Don't use any preceding -I directories for #include <...>. */ |
1726 | first_bracket_include = 0; | |
1727 | } | |
b0bbbd85 | 1728 | else { |
3e4115b7 RK |
1729 | dirtmp = new_include_prefix (last_include, "", |
1730 | argv[i][2] ? argv[i] + 2 : argv[++i]); | |
6489924b RS |
1731 | append_include_chain (dirtmp, dirtmp); |
1732 | } | |
b0bbbd85 RS |
1733 | } |
1734 | break; | |
1735 | ||
1736 | case 'n': | |
1737 | if (!strcmp (argv[i], "-nostdinc")) | |
1738 | /* -nostdinc causes no default include directories. | |
1739 | You must specify all include-file directories with -I. */ | |
1740 | no_standard_includes = 1; | |
2378088a PB |
1741 | else if (!strcmp (argv[i], "-nostdinc++")) |
1742 | /* -nostdinc++ causes no default C++-specific include directories. */ | |
1743 | no_standard_cplusplus_includes = 1; | |
b0bbbd85 RS |
1744 | else if (!strcmp (argv[i], "-noprecomp")) |
1745 | no_precomp = 1; | |
1746 | break; | |
1747 | ||
1748 | case 'u': | |
1749 | /* Sun compiler passes undocumented switch "-undef". | |
1750 | Let's assume it means to inhibit the predefined symbols. */ | |
1751 | inhibit_predefs = 1; | |
1752 | break; | |
1753 | ||
1754 | case '\0': /* JF handle '-' as file name meaning stdin or stdout */ | |
1755 | if (in_fname == NULL) { | |
1756 | in_fname = ""; | |
1757 | break; | |
1758 | } else if (out_fname == NULL) { | |
1759 | out_fname = ""; | |
1760 | break; | |
1761 | } /* else fall through into error */ | |
1762 | ||
1763 | default: | |
1764 | fatal ("Invalid option `%s'", argv[i]); | |
1765 | } | |
1766 | } | |
1767 | } | |
1768 | ||
1769 | /* Add dirs from CPATH after dirs from -I. */ | |
1770 | /* There seems to be confusion about what CPATH should do, | |
1771 | so for the moment it is not documented. */ | |
1772 | /* Some people say that CPATH should replace the standard include dirs, | |
1773 | but that seems pointless: it comes before them, so it overrides them | |
1774 | anyway. */ | |
25cbb59e RK |
1775 | cp = getenv ("CPATH"); |
1776 | if (cp && ! no_standard_includes) | |
1777 | path_include (cp); | |
b0bbbd85 RS |
1778 | |
1779 | /* Now that dollars_in_ident is known, initialize is_idchar. */ | |
1780 | initialize_char_syntax (); | |
1781 | ||
1782 | /* Initialize output buffer */ | |
1783 | ||
1784 | outbuf.buf = (U_CHAR *) xmalloc (OUTBUF_SIZE); | |
1785 | outbuf.bufp = outbuf.buf; | |
1786 | outbuf.length = OUTBUF_SIZE; | |
1787 | ||
1788 | /* Do partial setup of input buffer for the sake of generating | |
1789 | early #line directives (when -g is in effect). */ | |
1790 | ||
1791 | fp = &instack[++indepth]; | |
1792 | if (in_fname == NULL) | |
1793 | in_fname = ""; | |
1794 | fp->nominal_fname = fp->fname = in_fname; | |
1795 | fp->lineno = 0; | |
1796 | ||
767d412c JM |
1797 | /* In C++, wchar_t is a distinct basic type, and we can expect |
1798 | __wchar_t to be defined by cc1plus. */ | |
1799 | if (cplusplus) | |
1800 | wchar_type = "__wchar_t"; | |
1801 | ||
b0bbbd85 RS |
1802 | /* Install __LINE__, etc. Must follow initialize_char_syntax |
1803 | and option processing. */ | |
1804 | initialize_builtins (fp, &outbuf); | |
1805 | ||
1806 | /* Do standard #defines and assertions | |
1807 | that identify system and machine type. */ | |
1808 | ||
1809 | if (!inhibit_predefs) { | |
1810 | char *p = (char *) alloca (strlen (predefs) + 1); | |
1811 | strcpy (p, predefs); | |
1812 | while (*p) { | |
1813 | char *q; | |
1814 | while (*p == ' ' || *p == '\t') | |
1815 | p++; | |
1816 | /* Handle -D options. */ | |
1817 | if (p[0] == '-' && p[1] == 'D') { | |
1818 | q = &p[2]; | |
1819 | while (*p && *p != ' ' && *p != '\t') | |
1820 | p++; | |
1821 | if (*p != 0) | |
1822 | *p++= 0; | |
1823 | if (debug_output) | |
adcfa681 | 1824 | output_line_directive (fp, &outbuf, 0, same_file); |
b0bbbd85 RS |
1825 | make_definition (q, &outbuf); |
1826 | while (*p == ' ' || *p == '\t') | |
1827 | p++; | |
1828 | } else if (p[0] == '-' && p[1] == 'A') { | |
1829 | /* Handle -A options (assertions). */ | |
1830 | char *assertion; | |
1831 | char *past_name; | |
1832 | char *value; | |
1833 | char *past_value; | |
1834 | char *termination; | |
1835 | int save_char; | |
1836 | ||
1837 | assertion = &p[2]; | |
1838 | past_name = assertion; | |
1839 | /* Locate end of name. */ | |
1840 | while (*past_name && *past_name != ' ' | |
1841 | && *past_name != '\t' && *past_name != '(') | |
1842 | past_name++; | |
1843 | /* Locate `(' at start of value. */ | |
1844 | value = past_name; | |
1845 | while (*value && (*value == ' ' || *value == '\t')) | |
1846 | value++; | |
1847 | if (*value++ != '(') | |
1848 | abort (); | |
1849 | while (*value && (*value == ' ' || *value == '\t')) | |
1850 | value++; | |
1851 | past_value = value; | |
1852 | /* Locate end of value. */ | |
1853 | while (*past_value && *past_value != ' ' | |
1854 | && *past_value != '\t' && *past_value != ')') | |
1855 | past_value++; | |
1856 | termination = past_value; | |
1857 | while (*termination && (*termination == ' ' || *termination == '\t')) | |
1858 | termination++; | |
1859 | if (*termination++ != ')') | |
1860 | abort (); | |
1861 | if (*termination && *termination != ' ' && *termination != '\t') | |
1862 | abort (); | |
1863 | /* Temporarily null-terminate the value. */ | |
1864 | save_char = *termination; | |
1865 | *termination = '\0'; | |
1866 | /* Install the assertion. */ | |
1867 | make_assertion ("-A", assertion); | |
1868 | *termination = (char) save_char; | |
1869 | p = termination; | |
1870 | while (*p == ' ' || *p == '\t') | |
1871 | p++; | |
1872 | } else { | |
1873 | abort (); | |
1874 | } | |
1875 | } | |
1876 | } | |
1877 | ||
1878 | /* Now handle the command line options. */ | |
1879 | ||
2bbd52a8 RS |
1880 | /* Do -U's, -D's and -A's in the order they were seen. */ |
1881 | for (i = 1; i < argc; i++) { | |
49df5f37 RS |
1882 | if (pend_undefs[i]) { |
1883 | if (debug_output) | |
adcfa681 | 1884 | output_line_directive (fp, &outbuf, 0, same_file); |
49df5f37 RS |
1885 | make_undef (pend_undefs[i], &outbuf); |
1886 | } | |
b0bbbd85 RS |
1887 | if (pend_defs[i]) { |
1888 | if (debug_output) | |
adcfa681 | 1889 | output_line_directive (fp, &outbuf, 0, same_file); |
b0bbbd85 RS |
1890 | make_definition (pend_defs[i], &outbuf); |
1891 | } | |
2bbd52a8 RS |
1892 | if (pend_assertions[i]) |
1893 | make_assertion (pend_assertion_options[i], pend_assertions[i]); | |
1894 | } | |
b0bbbd85 | 1895 | |
b0bbbd85 RS |
1896 | done_initializing = 1; |
1897 | ||
0f41302f MS |
1898 | { /* Read the appropriate environment variable and if it exists |
1899 | replace include_defaults with the listed path. */ | |
b0bbbd85 RS |
1900 | char *epath = 0; |
1901 | switch ((objc << 1) + cplusplus) | |
1902 | { | |
1903 | case 0: | |
1904 | epath = getenv ("C_INCLUDE_PATH"); | |
1905 | break; | |
1906 | case 1: | |
1907 | epath = getenv ("CPLUS_INCLUDE_PATH"); | |
1908 | break; | |
1909 | case 2: | |
1910 | epath = getenv ("OBJC_INCLUDE_PATH"); | |
1911 | break; | |
1912 | case 3: | |
1913 | epath = getenv ("OBJCPLUS_INCLUDE_PATH"); | |
1914 | break; | |
1915 | } | |
1916 | /* If the environment var for this language is set, | |
1917 | add to the default list of include directories. */ | |
1918 | if (epath) { | |
b0bbbd85 RS |
1919 | int num_dirs; |
1920 | char *startp, *endp; | |
1921 | ||
1922 | for (num_dirs = 1, startp = epath; *startp; startp++) | |
4c64aaf6 | 1923 | if (*startp == PATH_SEPARATOR) |
b0bbbd85 RS |
1924 | num_dirs++; |
1925 | include_defaults | |
1926 | = (struct default_include *) xmalloc ((num_dirs | |
1927 | * sizeof (struct default_include)) | |
1928 | + sizeof (include_defaults_array)); | |
1929 | startp = endp = epath; | |
1930 | num_dirs = 0; | |
1931 | while (1) { | |
3e4115b7 RK |
1932 | char c = *endp++; |
1933 | if (c == PATH_SEPARATOR || !c) { | |
1934 | endp[-1] = 0; | |
1935 | include_defaults[num_dirs].fname | |
1936 | = startp == endp ? "." : savestring (startp); | |
1937 | endp[-1] = c; | |
b0bbbd85 | 1938 | include_defaults[num_dirs].cplusplus = cplusplus; |
acf7262c | 1939 | include_defaults[num_dirs].cxx_aware = 1; |
b0bbbd85 | 1940 | num_dirs++; |
3e4115b7 | 1941 | if (!c) |
b0bbbd85 | 1942 | break; |
3e4115b7 RK |
1943 | startp = endp; |
1944 | } | |
b0bbbd85 RS |
1945 | } |
1946 | /* Put the usual defaults back in at the end. */ | |
4c9a05bc RK |
1947 | bcopy ((char *) include_defaults_array, |
1948 | (char *) &include_defaults[num_dirs], | |
b0bbbd85 RS |
1949 | sizeof (include_defaults_array)); |
1950 | } | |
1951 | } | |
1952 | ||
b0866c74 JW |
1953 | append_include_chain (before_system, last_before_system); |
1954 | first_system_include = before_system; | |
1955 | ||
b0bbbd85 RS |
1956 | /* Unless -fnostdinc, |
1957 | tack on the standard include file dirs to the specified list */ | |
1958 | if (!no_standard_includes) { | |
1959 | struct default_include *p = include_defaults; | |
bec42276 | 1960 | char *specd_prefix = include_prefix; |
b0bbbd85 RS |
1961 | char *default_prefix = savestring (GCC_INCLUDE_DIR); |
1962 | int default_len = 0; | |
1963 | /* Remove the `include' from /usr/local/lib/gcc.../include. */ | |
1964 | if (!strcmp (default_prefix + strlen (default_prefix) - 8, "/include")) { | |
1965 | default_len = strlen (default_prefix) - 7; | |
1966 | default_prefix[default_len] = 0; | |
1967 | } | |
1968 | /* Search "translated" versions of GNU directories. | |
1969 | These have /usr/local/lib/gcc... replaced by specd_prefix. */ | |
1970 | if (specd_prefix != 0 && default_len != 0) | |
1971 | for (p = include_defaults; p->fname; p++) { | |
1972 | /* Some standard dirs are only for C++. */ | |
2378088a | 1973 | if (!p->cplusplus || (cplusplus && !no_standard_cplusplus_includes)) { |
b0bbbd85 RS |
1974 | /* Does this dir start with the prefix? */ |
1975 | if (!strncmp (p->fname, default_prefix, default_len)) { | |
1976 | /* Yes; change prefix and add to search list. */ | |
1977 | struct file_name_list *new | |
3e4115b7 RK |
1978 | = new_include_prefix (NULL_PTR, specd_prefix, |
1979 | p->fname + default_len); | |
1980 | if (new) { | |
1981 | new->c_system_include_path = !p->cxx_aware; | |
1982 | append_include_chain (new, new); | |
1983 | if (first_system_include == 0) | |
1984 | first_system_include = new; | |
1985 | } | |
b0bbbd85 RS |
1986 | } |
1987 | } | |
1988 | } | |
1989 | /* Search ordinary names for GNU include directories. */ | |
1990 | for (p = include_defaults; p->fname; p++) { | |
1991 | /* Some standard dirs are only for C++. */ | |
2378088a | 1992 | if (!p->cplusplus || (cplusplus && !no_standard_cplusplus_includes)) { |
b0bbbd85 | 1993 | struct file_name_list *new |
3e4115b7 RK |
1994 | = new_include_prefix (NULL_PTR, "", p->fname); |
1995 | if (new) { | |
1996 | new->c_system_include_path = !p->cxx_aware; | |
1997 | append_include_chain (new, new); | |
1998 | if (first_system_include == 0) | |
1999 | first_system_include = new; | |
2000 | } | |
b0bbbd85 RS |
2001 | } |
2002 | } | |
2003 | } | |
2004 | ||
2005 | /* Tack the after_include chain at the end of the include chain. */ | |
6489924b RS |
2006 | append_include_chain (after_include, last_after_include); |
2007 | if (first_system_include == 0) | |
2008 | first_system_include = after_include; | |
b0bbbd85 | 2009 | |
e6157ab4 RS |
2010 | /* With -v, print the list of dirs to search. */ |
2011 | if (verbose) { | |
2012 | struct file_name_list *p; | |
2013 | fprintf (stderr, "#include \"...\" search starts here:\n"); | |
2014 | for (p = include; p; p = p->next) { | |
2015 | if (p == first_bracket_include) | |
2016 | fprintf (stderr, "#include <...> search starts here:\n"); | |
3e4115b7 RK |
2017 | if (!p->fname[0]) |
2018 | fprintf (stderr, " .\n"); | |
2019 | else if (!strcmp (p->fname, "/") || !strcmp (p->fname, "//")) | |
2020 | fprintf (stderr, " %s\n", p->fname); | |
2021 | else | |
2022 | /* Omit trailing '/'. */ | |
2023 | fprintf (stderr, " %.*s\n", (int) strlen (p->fname) - 1, p->fname); | |
e6157ab4 RS |
2024 | } |
2025 | fprintf (stderr, "End of search list.\n"); | |
2026 | } | |
2027 | ||
e648e0e3 DE |
2028 | /* -MG doesn't select the form of output and must be specified with one of |
2029 | -M or -MM. -MG doesn't make sense with -MD or -MMD since they don't | |
2030 | inhibit compilation. */ | |
2031 | if (print_deps_missing_files && (print_deps == 0 || !inhibit_output)) | |
2032 | fatal ("-MG must be specified with one of -M or -MM"); | |
86739c7b | 2033 | |
b0bbbd85 RS |
2034 | /* Either of two environment variables can specify output of deps. |
2035 | Its value is either "OUTPUT_FILE" or "OUTPUT_FILE DEPS_TARGET", | |
2036 | where OUTPUT_FILE is the file to write deps info to | |
2037 | and DEPS_TARGET is the target to mention in the deps. */ | |
2038 | ||
2039 | if (print_deps == 0 | |
2040 | && (getenv ("SUNPRO_DEPENDENCIES") != 0 | |
2041 | || getenv ("DEPENDENCIES_OUTPUT") != 0)) { | |
2042 | char *spec = getenv ("DEPENDENCIES_OUTPUT"); | |
2043 | char *s; | |
2044 | char *output_file; | |
2045 | ||
2046 | if (spec == 0) { | |
2047 | spec = getenv ("SUNPRO_DEPENDENCIES"); | |
2048 | print_deps = 2; | |
2049 | } | |
2050 | else | |
2051 | print_deps = 1; | |
2052 | ||
2053 | s = spec; | |
2054 | /* Find the space before the DEPS_TARGET, if there is one. */ | |
43ae693e | 2055 | /* This should use index. (mrs) */ |
b0bbbd85 RS |
2056 | while (*s != 0 && *s != ' ') s++; |
2057 | if (*s != 0) { | |
2058 | deps_target = s + 1; | |
25cbb59e | 2059 | output_file = xmalloc (s - spec + 1); |
b0bbbd85 RS |
2060 | bcopy (spec, output_file, s - spec); |
2061 | output_file[s - spec] = 0; | |
2062 | } | |
2063 | else { | |
2064 | deps_target = 0; | |
2065 | output_file = spec; | |
2066 | } | |
2067 | ||
2068 | deps_file = output_file; | |
d0691cfb | 2069 | deps_mode = "a"; |
b0bbbd85 RS |
2070 | } |
2071 | ||
2072 | /* For -M, print the expected object file name | |
2073 | as the target of this Make-rule. */ | |
2074 | if (print_deps) { | |
2075 | deps_allocated_size = 200; | |
25cbb59e | 2076 | deps_buffer = xmalloc (deps_allocated_size); |
b0bbbd85 RS |
2077 | deps_buffer[0] = 0; |
2078 | deps_size = 0; | |
2079 | deps_column = 0; | |
2080 | ||
2081 | if (deps_target) { | |
389bb508 RK |
2082 | deps_output (deps_target, ':'); |
2083 | } else if (*in_fname == 0) { | |
2084 | deps_output ("-", ':'); | |
2085 | } else { | |
2086 | char *p, *q; | |
b0bbbd85 | 2087 | int len; |
389bb508 | 2088 | |
3e4115b7 | 2089 | q = base_name (in_fname); |
389bb508 RK |
2090 | |
2091 | /* Copy remainder to mungable area. */ | |
3c0e5268 | 2092 | p = (char *) alloca (strlen(q) + 8); |
389bb508 RK |
2093 | strcpy (p, q); |
2094 | ||
b0bbbd85 RS |
2095 | /* Output P, but remove known suffixes. */ |
2096 | len = strlen (p); | |
389bb508 RK |
2097 | q = p + len; |
2098 | if (len >= 2 | |
2099 | && p[len - 2] == '.' | |
2100 | && index("cCsSm", p[len - 1])) | |
2101 | q = p + (len - 2); | |
2102 | else if (len >= 3 | |
2103 | && p[len - 3] == '.' | |
b0bbbd85 RS |
2104 | && p[len - 2] == 'c' |
2105 | && p[len - 1] == 'c') | |
389bb508 RK |
2106 | q = p + (len - 3); |
2107 | else if (len >= 4 | |
2108 | && p[len - 4] == '.' | |
c9bf18a5 RS |
2109 | && p[len - 3] == 'c' |
2110 | && p[len - 2] == 'x' | |
2111 | && p[len - 1] == 'x') | |
389bb508 | 2112 | q = p + (len - 4); |
a0c2b8e9 RK |
2113 | else if (len >= 4 |
2114 | && p[len - 4] == '.' | |
2115 | && p[len - 3] == 'c' | |
2116 | && p[len - 2] == 'p' | |
2117 | && p[len - 1] == 'p') | |
2118 | q = p + (len - 4); | |
389bb508 | 2119 | |
b0bbbd85 | 2120 | /* Supply our own suffix. */ |
49df5f37 | 2121 | #ifndef VMS |
389bb508 | 2122 | strcpy (q, ".o"); |
49df5f37 | 2123 | #else |
389bb508 | 2124 | strcpy (q, ".obj"); |
49df5f37 | 2125 | #endif |
389bb508 RK |
2126 | |
2127 | deps_output (p, ':'); | |
0016a02d | 2128 | deps_output (in_fname, ' '); |
b0bbbd85 RS |
2129 | } |
2130 | } | |
2131 | ||
3e4115b7 RK |
2132 | /* Scan the -imacros files before the main input. |
2133 | Much like #including them, but with no_output set | |
2134 | so that only their macro definitions matter. */ | |
2135 | ||
2136 | no_output++; no_record_file++; | |
2137 | for (i = 1; i < argc; i++) | |
2138 | if (pend_files[i]) { | |
2139 | struct include_file *inc; | |
2140 | int fd = open_include_file (pend_files[i], NULL_PTR, NULL_PTR, &inc); | |
2141 | if (fd < 0) { | |
2142 | perror_with_name (pend_files[i]); | |
2143 | return FATAL_EXIT_CODE; | |
2144 | } | |
2145 | finclude (fd, inc, &outbuf, 0, NULL_PTR); | |
2146 | } | |
2147 | no_output--; no_record_file--; | |
2148 | ||
2149 | /* Copy the entire contents of the main input file into | |
2150 | the stacked input buffer previously allocated for it. */ | |
2151 | ||
2152 | /* JF check for stdin */ | |
2153 | if (in_fname == NULL || *in_fname == 0) { | |
2154 | in_fname = ""; | |
2155 | f = 0; | |
2156 | } else if ((f = open (in_fname, O_RDONLY, 0666)) < 0) | |
2157 | goto perror; | |
2158 | ||
2159 | if (fstat (f, &st) != 0) | |
2160 | pfatal_with_name (in_fname); | |
b0bbbd85 RS |
2161 | fp->nominal_fname = fp->fname = in_fname; |
2162 | fp->lineno = 1; | |
2163 | fp->system_header_p = 0; | |
2164 | /* JF all this is mine about reading pipes and ttys */ | |
3e4115b7 | 2165 | if (! S_ISREG (st.st_mode)) { |
b0bbbd85 RS |
2166 | /* Read input from a file that is not a normal disk file. |
2167 | We cannot preallocate a buffer with the correct size, | |
2168 | so we must read in the file a piece at the time and make it bigger. */ | |
2169 | int size; | |
2170 | int bsize; | |
2171 | int cnt; | |
b0bbbd85 | 2172 | |
3e4115b7 RK |
2173 | if (S_ISDIR (st.st_mode)) |
2174 | fatal ("Input file `%s' is a directory", in_fname); | |
2175 | ||
b0bbbd85 RS |
2176 | bsize = 2000; |
2177 | size = 0; | |
2178 | fp->buf = (U_CHAR *) xmalloc (bsize + 2); | |
b0bbbd85 | 2179 | for (;;) { |
25cbb59e | 2180 | cnt = safe_read (f, (char *) fp->buf + size, bsize - size); |
b0bbbd85 | 2181 | if (cnt < 0) goto perror; /* error! */ |
b0bbbd85 | 2182 | size += cnt; |
53e52f00 RK |
2183 | if (size != bsize) break; /* End of file */ |
2184 | bsize *= 2; | |
2185 | fp->buf = (U_CHAR *) xrealloc (fp->buf, bsize + 2); | |
b0bbbd85 RS |
2186 | } |
2187 | fp->length = size; | |
2188 | } else { | |
2189 | /* Read a file whose size we can determine in advance. | |
3e4115b7 RK |
2190 | For the sake of VMS, st.st_size is just an upper bound. */ |
2191 | fp->buf = (U_CHAR *) xmalloc (st.st_size + 2); | |
2192 | fp->length = safe_read (f, (char *) fp->buf, st.st_size); | |
53e52f00 | 2193 | if (fp->length < 0) goto perror; |
b0bbbd85 RS |
2194 | } |
2195 | fp->bufp = fp->buf; | |
2196 | fp->if_stack = if_stack; | |
2197 | ||
2198 | /* Make sure data ends with a newline. And put a null after it. */ | |
2199 | ||
2200 | if ((fp->length > 0 && fp->buf[fp->length - 1] != '\n') | |
2201 | /* Backslash-newline at end is not good enough. */ | |
2202 | || (fp->length > 1 && fp->buf[fp->length - 2] == '\\')) { | |
2203 | fp->buf[fp->length++] = '\n'; | |
2204 | missing_newline = 1; | |
2205 | } | |
2206 | fp->buf[fp->length] = '\0'; | |
2207 | ||
2208 | /* Unless inhibited, convert trigraphs in the input. */ | |
2209 | ||
2210 | if (!no_trigraphs) | |
2211 | trigraph_pcp (fp); | |
2212 | ||
2213 | /* Now that we know the input file is valid, open the output. */ | |
2214 | ||
2215 | if (!out_fname || !strcmp (out_fname, "")) | |
2216 | out_fname = "stdout"; | |
2217 | else if (! freopen (out_fname, "w", stdout)) | |
2218 | pfatal_with_name (out_fname); | |
2219 | ||
adcfa681 | 2220 | output_line_directive (fp, &outbuf, 0, same_file); |
b0bbbd85 RS |
2221 | |
2222 | /* Scan the -include files before the main input. */ | |
2223 | ||
42e2194b | 2224 | no_record_file++; |
b0bbbd85 RS |
2225 | for (i = 1; i < argc; i++) |
2226 | if (pend_includes[i]) { | |
3e4115b7 RK |
2227 | struct include_file *inc; |
2228 | int fd = open_include_file (pend_includes[i], NULL_PTR, NULL_PTR, &inc); | |
b0bbbd85 RS |
2229 | if (fd < 0) { |
2230 | perror_with_name (pend_includes[i]); | |
3efba298 | 2231 | return FATAL_EXIT_CODE; |
b0bbbd85 | 2232 | } |
3e4115b7 | 2233 | finclude (fd, inc, &outbuf, 0, NULL_PTR); |
b0bbbd85 | 2234 | } |
42e2194b | 2235 | no_record_file--; |
b0bbbd85 RS |
2236 | |
2237 | /* Scan the input, processing macros and directives. */ | |
2238 | ||
2239 | rescan (&outbuf, 0); | |
2240 | ||
5105ecec RS |
2241 | if (missing_newline) |
2242 | fp->lineno--; | |
2243 | ||
b0bbbd85 RS |
2244 | if (pedantic && missing_newline) |
2245 | pedwarn ("file does not end in newline"); | |
2246 | ||
2247 | /* Now we have processed the entire input | |
2248 | Write whichever kind of output has been requested. */ | |
2249 | ||
2250 | if (dump_macros == dump_only) | |
2251 | dump_all_macros (); | |
2252 | else if (! inhibit_output) { | |
2253 | write_output (); | |
2254 | } | |
2255 | ||
2256 | if (print_deps) { | |
566609f8 RS |
2257 | /* Don't actually write the deps file if compilation has failed. */ |
2258 | if (errors == 0) { | |
d0691cfb | 2259 | if (deps_file && ! (deps_stream = fopen (deps_file, deps_mode))) |
566609f8 | 2260 | pfatal_with_name (deps_file); |
b0bbbd85 RS |
2261 | fputs (deps_buffer, deps_stream); |
2262 | putc ('\n', deps_stream); | |
566609f8 RS |
2263 | if (deps_file) { |
2264 | if (ferror (deps_stream) || fclose (deps_stream) != 0) | |
b0bbbd85 RS |
2265 | fatal ("I/O error on output"); |
2266 | } | |
2267 | } | |
2268 | } | |
2269 | ||
c6469b46 RS |
2270 | if (pcp_outfile && pcp_outfile != stdout |
2271 | && (ferror (pcp_outfile) || fclose (pcp_outfile) != 0)) | |
2272 | fatal ("I/O error on `-pcp' output"); | |
2273 | ||
566609f8 | 2274 | if (ferror (stdout) || fclose (stdout) != 0) |
b0bbbd85 RS |
2275 | fatal ("I/O error on output"); |
2276 | ||
2277 | if (errors) | |
3efba298 | 2278 | exit (FATAL_EXIT_CODE); |
b0bbbd85 RS |
2279 | exit (SUCCESS_EXIT_CODE); |
2280 | ||
2281 | perror: | |
2282 | pfatal_with_name (in_fname); | |
2283 | return 0; | |
2284 | } | |
2285 | \f | |
2286 | /* Given a colon-separated list of file names PATH, | |
2287 | add all the names to the search path for include files. */ | |
2288 | ||
2289 | static void | |
2290 | path_include (path) | |
2291 | char *path; | |
2292 | { | |
2293 | char *p; | |
2294 | ||
2295 | p = path; | |
2296 | ||
2297 | if (*p) | |
2298 | while (1) { | |
2299 | char *q = p; | |
3e4115b7 | 2300 | char c; |
b0bbbd85 RS |
2301 | struct file_name_list *dirtmp; |
2302 | ||
2303 | /* Find the end of this name. */ | |
3e4115b7 RK |
2304 | while ((c = *q++) != PATH_SEPARATOR && c) |
2305 | continue; | |
b0bbbd85 | 2306 | |
3e4115b7 RK |
2307 | q[-1] = 0; |
2308 | dirtmp = new_include_prefix (last_include, "", p == q ? "." : p); | |
2309 | q[-1] = c; | |
6489924b | 2310 | append_include_chain (dirtmp, dirtmp); |
b0bbbd85 RS |
2311 | |
2312 | /* Advance past this name. */ | |
2313 | p = q; | |
3e4115b7 | 2314 | if (! c) |
b0bbbd85 | 2315 | break; |
b0bbbd85 RS |
2316 | } |
2317 | } | |
2318 | \f | |
0e7e3fc1 RK |
2319 | /* Return the address of the first character in S that equals C. |
2320 | S is an array of length N, possibly containing '\0's, and followed by '\0'. | |
2321 | Return 0 if there is no such character. Assume that C itself is not '\0'. | |
2322 | If we knew we could use memchr, we could just invoke memchr (S, C, N), | |
2323 | but unfortunately memchr isn't autoconfigured yet. */ | |
2324 | ||
2325 | static U_CHAR * | |
2326 | index0 (s, c, n) | |
2327 | U_CHAR *s; | |
2328 | int c; | |
25cbb59e | 2329 | size_t n; |
0e7e3fc1 | 2330 | { |
25cbb59e | 2331 | char *p = (char *) s; |
0e7e3fc1 | 2332 | for (;;) { |
25cbb59e | 2333 | char *q = index (p, c); |
0e7e3fc1 RK |
2334 | if (q) |
2335 | return (U_CHAR *) q; | |
2336 | else { | |
25cbb59e | 2337 | size_t l = strlen (p); |
0e7e3fc1 RK |
2338 | if (l == n) |
2339 | return 0; | |
2340 | l++; | |
25cbb59e | 2341 | p += l; |
0e7e3fc1 RK |
2342 | n -= l; |
2343 | } | |
2344 | } | |
2345 | } | |
2346 | \f | |
b0bbbd85 RS |
2347 | /* Pre-C-Preprocessor to translate ANSI trigraph idiocy in BUF |
2348 | before main CCCP processing. Name `pcp' is also in honor of the | |
2349 | drugs the trigraph designers must have been on. | |
2350 | ||
2351 | Using an extra pass through the buffer takes a little extra time, | |
2352 | but is infinitely less hairy than trying to handle trigraphs inside | |
2353 | strings, etc. everywhere, and also makes sure that trigraphs are | |
0f41302f | 2354 | only translated in the top level of processing. */ |
b0bbbd85 RS |
2355 | |
2356 | static void | |
2357 | trigraph_pcp (buf) | |
2358 | FILE_BUF *buf; | |
2359 | { | |
0e7e3fc1 | 2360 | register U_CHAR c, *fptr, *bptr, *sptr, *lptr; |
b0bbbd85 RS |
2361 | int len; |
2362 | ||
2363 | fptr = bptr = sptr = buf->buf; | |
0e7e3fc1 | 2364 | lptr = fptr + buf->length; |
25cbb59e | 2365 | while ((sptr = index0 (sptr, '?', (size_t) (lptr - sptr))) != NULL) { |
b0bbbd85 RS |
2366 | if (*++sptr != '?') |
2367 | continue; | |
2368 | switch (*++sptr) { | |
2369 | case '=': | |
2370 | c = '#'; | |
2371 | break; | |
2372 | case '(': | |
2373 | c = '['; | |
2374 | break; | |
2375 | case '/': | |
2376 | c = '\\'; | |
2377 | break; | |
2378 | case ')': | |
2379 | c = ']'; | |
2380 | break; | |
2381 | case '\'': | |
2382 | c = '^'; | |
2383 | break; | |
2384 | case '<': | |
2385 | c = '{'; | |
2386 | break; | |
2387 | case '!': | |
2388 | c = '|'; | |
2389 | break; | |
2390 | case '>': | |
2391 | c = '}'; | |
2392 | break; | |
2393 | case '-': | |
2394 | c = '~'; | |
2395 | break; | |
2396 | case '?': | |
2397 | sptr--; | |
2398 | continue; | |
2399 | default: | |
2400 | continue; | |
2401 | } | |
2402 | len = sptr - fptr - 2; | |
4c9a05bc RK |
2403 | |
2404 | /* BSD doc says bcopy () works right for overlapping strings. In ANSI | |
0f41302f | 2405 | C, this will be memmove (). */ |
b0bbbd85 | 2406 | if (bptr != fptr && len > 0) |
4c9a05bc RK |
2407 | bcopy ((char *) fptr, (char *) bptr, len); |
2408 | ||
b0bbbd85 RS |
2409 | bptr += len; |
2410 | *bptr++ = c; | |
2411 | fptr = ++sptr; | |
2412 | } | |
2413 | len = buf->length - (fptr - buf->buf); | |
2414 | if (bptr != fptr && len > 0) | |
4c9a05bc | 2415 | bcopy ((char *) fptr, (char *) bptr, len); |
b0bbbd85 RS |
2416 | buf->length -= fptr - bptr; |
2417 | buf->buf[buf->length] = '\0'; | |
2418 | if (warn_trigraphs && fptr != bptr) | |
047380ca PE |
2419 | warning_with_line (0, "%lu trigraph(s) encountered", |
2420 | (unsigned long) (fptr - bptr) / 2); | |
b0bbbd85 RS |
2421 | } |
2422 | \f | |
2423 | /* Move all backslash-newline pairs out of embarrassing places. | |
2424 | Exchange all such pairs following BP | |
2aa7ec37 | 2425 | with any potentially-embarrassing characters that follow them. |
b0bbbd85 RS |
2426 | Potentially-embarrassing characters are / and * |
2427 | (because a backslash-newline inside a comment delimiter | |
2428 | would cause it not to be recognized). */ | |
2429 | ||
2430 | static void | |
2431 | newline_fix (bp) | |
2432 | U_CHAR *bp; | |
2433 | { | |
2434 | register U_CHAR *p = bp; | |
b0bbbd85 RS |
2435 | |
2436 | /* First count the backslash-newline pairs here. */ | |
2437 | ||
f9cf182e RK |
2438 | while (p[0] == '\\' && p[1] == '\n') |
2439 | p += 2; | |
b0bbbd85 RS |
2440 | |
2441 | /* What follows the backslash-newlines is not embarrassing. */ | |
2442 | ||
f9cf182e | 2443 | if (*p != '/' && *p != '*') |
b0bbbd85 RS |
2444 | return; |
2445 | ||
2446 | /* Copy all potentially embarrassing characters | |
2447 | that follow the backslash-newline pairs | |
2448 | down to where the pairs originally started. */ | |
2449 | ||
2450 | while (*p == '*' || *p == '/') | |
2451 | *bp++ = *p++; | |
2452 | ||
2453 | /* Now write the same number of pairs after the embarrassing chars. */ | |
f9cf182e | 2454 | while (bp < p) { |
b0bbbd85 RS |
2455 | *bp++ = '\\'; |
2456 | *bp++ = '\n'; | |
2457 | } | |
2458 | } | |
2459 | ||
2460 | /* Like newline_fix but for use within a directive-name. | |
2461 | Move any backslash-newlines up past any following symbol constituents. */ | |
2462 | ||
2463 | static void | |
2464 | name_newline_fix (bp) | |
2465 | U_CHAR *bp; | |
2466 | { | |
2467 | register U_CHAR *p = bp; | |
b0bbbd85 RS |
2468 | |
2469 | /* First count the backslash-newline pairs here. */ | |
f9cf182e RK |
2470 | while (p[0] == '\\' && p[1] == '\n') |
2471 | p += 2; | |
b0bbbd85 RS |
2472 | |
2473 | /* What follows the backslash-newlines is not embarrassing. */ | |
2474 | ||
f9cf182e | 2475 | if (!is_idchar[*p]) |
b0bbbd85 RS |
2476 | return; |
2477 | ||
2478 | /* Copy all potentially embarrassing characters | |
2479 | that follow the backslash-newline pairs | |
2480 | down to where the pairs originally started. */ | |
2481 | ||
2482 | while (is_idchar[*p]) | |
2483 | *bp++ = *p++; | |
2484 | ||
2485 | /* Now write the same number of pairs after the embarrassing chars. */ | |
f9cf182e | 2486 | while (bp < p) { |
b0bbbd85 RS |
2487 | *bp++ = '\\'; |
2488 | *bp++ = '\n'; | |
2489 | } | |
2490 | } | |
2491 | \f | |
2492 | /* Look for lint commands in comments. | |
2493 | ||
2494 | When we come in here, ibp points into a comment. Limit is as one expects. | |
2495 | scan within the comment -- it should start, after lwsp, with a lint command. | |
2496 | If so that command is returned as a (constant) string. | |
2497 | ||
2498 | Upon return, any arg will be pointed to with argstart and will be | |
2499 | arglen long. Note that we don't parse that arg since it will just | |
0f41302f | 2500 | be printed out again. */ |
b0bbbd85 RS |
2501 | |
2502 | static char * | |
2503 | get_lintcmd (ibp, limit, argstart, arglen, cmdlen) | |
2504 | register U_CHAR *ibp; | |
2505 | register U_CHAR *limit; | |
2506 | U_CHAR **argstart; /* point to command arg */ | |
2507 | int *arglen, *cmdlen; /* how long they are */ | |
2508 | { | |
047380ca | 2509 | HOST_WIDE_INT linsize; |
b0bbbd85 RS |
2510 | register U_CHAR *numptr; /* temp for arg parsing */ |
2511 | ||
2512 | *arglen = 0; | |
2513 | ||
2514 | SKIP_WHITE_SPACE (ibp); | |
2515 | ||
2516 | if (ibp >= limit) return NULL; | |
2517 | ||
2518 | linsize = limit - ibp; | |
2519 | ||
2520 | /* Oh, I wish C had lexical functions... hell, I'll just open-code the set */ | |
25cbb59e | 2521 | if ((linsize >= 10) && !bcmp (ibp, "NOTREACHED", 10)) { |
b0bbbd85 RS |
2522 | *cmdlen = 10; |
2523 | return "NOTREACHED"; | |
2524 | } | |
25cbb59e | 2525 | if ((linsize >= 8) && !bcmp (ibp, "ARGSUSED", 8)) { |
b0bbbd85 RS |
2526 | *cmdlen = 8; |
2527 | return "ARGSUSED"; | |
2528 | } | |
25cbb59e | 2529 | if ((linsize >= 11) && !bcmp (ibp, "LINTLIBRARY", 11)) { |
a8b9d9a4 | 2530 | *cmdlen = 11; |
b0bbbd85 RS |
2531 | return "LINTLIBRARY"; |
2532 | } | |
25cbb59e | 2533 | if ((linsize >= 7) && !bcmp (ibp, "VARARGS", 7)) { |
b0bbbd85 RS |
2534 | *cmdlen = 7; |
2535 | ibp += 7; linsize -= 7; | |
2536 | if ((linsize == 0) || ! isdigit (*ibp)) return "VARARGS"; | |
2537 | ||
2538 | /* OK, read a number */ | |
2539 | for (numptr = *argstart = ibp; (numptr < limit) && isdigit (*numptr); | |
2540 | numptr++); | |
2541 | *arglen = numptr - *argstart; | |
2542 | return "VARARGS"; | |
2543 | } | |
2544 | return NULL; | |
2545 | } | |
2546 | \f | |
2547 | /* | |
2548 | * The main loop of the program. | |
2549 | * | |
2550 | * Read characters from the input stack, transferring them to the | |
2551 | * output buffer OP. | |
2552 | * | |
2553 | * Macros are expanded and push levels on the input stack. | |
2554 | * At the end of such a level it is popped off and we keep reading. | |
2555 | * At the end of any other kind of level, we return. | |
2556 | * #-directives are handled, except within macros. | |
2557 | * | |
2558 | * If OUTPUT_MARKS is nonzero, keep Newline markers found in the input | |
2559 | * and insert them when appropriate. This is set while scanning macro | |
2560 | * arguments before substitution. It is zero when scanning for final output. | |
2561 | * There are three types of Newline markers: | |
2562 | * * Newline - follows a macro name that was not expanded | |
2563 | * because it appeared inside an expansion of the same macro. | |
2564 | * This marker prevents future expansion of that identifier. | |
2565 | * When the input is rescanned into the final output, these are deleted. | |
2566 | * These are also deleted by ## concatenation. | |
2567 | * * Newline Space (or Newline and any other whitespace character) | |
2568 | * stands for a place that tokens must be separated or whitespace | |
2569 | * is otherwise desirable, but where the ANSI standard specifies there | |
2570 | * is no whitespace. This marker turns into a Space (or whichever other | |
2571 | * whitespace char appears in the marker) in the final output, | |
2572 | * but it turns into nothing in an argument that is stringified with #. | |
2573 | * Such stringified arguments are the only place where the ANSI standard | |
2574 | * specifies with precision that whitespace may not appear. | |
2575 | * | |
2576 | * During this function, IP->bufp is kept cached in IBP for speed of access. | |
2577 | * Likewise, OP->bufp is kept in OBP. Before calling a subroutine | |
2578 | * IBP, IP and OBP must be copied back to memory. IP and IBP are | |
2579 | * copied back with the RECACHE macro. OBP must be copied back from OP->bufp | |
2580 | * explicitly, and before RECACHE, since RECACHE uses OBP. | |
2581 | */ | |
2582 | ||
2583 | static void | |
2584 | rescan (op, output_marks) | |
2585 | FILE_BUF *op; | |
2586 | int output_marks; | |
2587 | { | |
2588 | /* Character being scanned in main loop. */ | |
2589 | register U_CHAR c; | |
2590 | ||
2591 | /* Length of pending accumulated identifier. */ | |
2592 | register int ident_length = 0; | |
2593 | ||
2594 | /* Hash code of pending accumulated identifier. */ | |
2595 | register int hash = 0; | |
2596 | ||
2597 | /* Current input level (&instack[indepth]). */ | |
2598 | FILE_BUF *ip; | |
2599 | ||
2600 | /* Pointer for scanning input. */ | |
2601 | register U_CHAR *ibp; | |
2602 | ||
2603 | /* Pointer to end of input. End of scan is controlled by LIMIT. */ | |
2604 | register U_CHAR *limit; | |
2605 | ||
2606 | /* Pointer for storing output. */ | |
2607 | register U_CHAR *obp; | |
2608 | ||
2609 | /* REDO_CHAR is nonzero if we are processing an identifier | |
2610 | after backing up over the terminating character. | |
2611 | Sometimes we process an identifier without backing up over | |
2612 | the terminating character, if the terminating character | |
2613 | is not special. Backing up is done so that the terminating character | |
2614 | will be dispatched on again once the identifier is dealt with. */ | |
2615 | int redo_char = 0; | |
2616 | ||
2617 | /* 1 if within an identifier inside of which a concatenation | |
2618 | marker (Newline -) has been seen. */ | |
2619 | int concatenated = 0; | |
2620 | ||
2621 | /* While scanning a comment or a string constant, | |
2622 | this records the line it started on, for error messages. */ | |
2623 | int start_line; | |
2624 | ||
b0bbbd85 RS |
2625 | /* Record position of last `real' newline. */ |
2626 | U_CHAR *beg_of_line; | |
2627 | ||
2628 | /* Pop the innermost input stack level, assuming it is a macro expansion. */ | |
2629 | ||
2630 | #define POPMACRO \ | |
2631 | do { ip->macro->type = T_MACRO; \ | |
2632 | if (ip->free_ptr) free (ip->free_ptr); \ | |
2633 | --indepth; } while (0) | |
2634 | ||
2635 | /* Reload `rescan's local variables that describe the current | |
2636 | level of the input stack. */ | |
2637 | ||
2638 | #define RECACHE \ | |
2639 | do { ip = &instack[indepth]; \ | |
2640 | ibp = ip->bufp; \ | |
2641 | limit = ip->buf + ip->length; \ | |
2642 | op->bufp = obp; \ | |
2643 | check_expand (op, limit - ibp); \ | |
2644 | beg_of_line = 0; \ | |
2645 | obp = op->bufp; } while (0) | |
2646 | ||
2647 | if (no_output && instack[indepth].fname != 0) | |
bbd4b75b | 2648 | skip_if_group (&instack[indepth], 1, NULL); |
b0bbbd85 RS |
2649 | |
2650 | obp = op->bufp; | |
2651 | RECACHE; | |
34a2d6f3 | 2652 | |
b0bbbd85 RS |
2653 | beg_of_line = ibp; |
2654 | ||
2655 | /* Our caller must always put a null after the end of | |
2656 | the input at each input stack level. */ | |
2657 | if (*limit != 0) | |
2658 | abort (); | |
2659 | ||
2660 | while (1) { | |
2661 | c = *ibp++; | |
2662 | *obp++ = c; | |
2663 | ||
2664 | switch (c) { | |
2665 | case '\\': | |
01bffe73 RK |
2666 | if (*ibp == '\n' && !ip->macro) { |
2667 | /* At the top level, always merge lines ending with backslash-newline, | |
2668 | even in middle of identifier. But do not merge lines in a macro, | |
2669 | since backslash might be followed by a newline-space marker. */ | |
b0bbbd85 RS |
2670 | ++ibp; |
2671 | ++ip->lineno; | |
2672 | --obp; /* remove backslash from obuf */ | |
2673 | break; | |
2674 | } | |
01bffe73 RK |
2675 | /* If ANSI, backslash is just another character outside a string. */ |
2676 | if (!traditional) | |
2677 | goto randomchar; | |
b0bbbd85 RS |
2678 | /* Otherwise, backslash suppresses specialness of following char, |
2679 | so copy it here to prevent the switch from seeing it. | |
2680 | But first get any pending identifier processed. */ | |
2681 | if (ident_length > 0) | |
2682 | goto specialchar; | |
01bffe73 RK |
2683 | if (ibp < limit) |
2684 | *obp++ = *ibp++; | |
b0bbbd85 RS |
2685 | break; |
2686 | ||
91dbf5e7 RK |
2687 | case '%': |
2688 | if (ident_length || ip->macro || traditional) | |
2689 | goto randomchar; | |
91dbf5e7 RK |
2690 | while (*ibp == '\\' && ibp[1] == '\n') { |
2691 | ibp += 2; | |
2692 | ++ip->lineno; | |
2693 | } | |
2694 | if (*ibp != ':') | |
2695 | break; | |
2696 | /* Treat this %: digraph as if it were #. */ | |
2697 | /* Fall through. */ | |
2698 | ||
b0bbbd85 RS |
2699 | case '#': |
2700 | if (assertions_flag) { | |
823a28aa RK |
2701 | if (ident_length) |
2702 | goto specialchar; | |
b0bbbd85 | 2703 | /* Copy #foo (bar lose) without macro expansion. */ |
0f41302f | 2704 | obp[-1] = '#'; /* In case it was '%'. */ |
b0bbbd85 RS |
2705 | SKIP_WHITE_SPACE (ibp); |
2706 | while (is_idchar[*ibp]) | |
2707 | *obp++ = *ibp++; | |
2708 | SKIP_WHITE_SPACE (ibp); | |
2709 | if (*ibp == '(') { | |
2710 | ip->bufp = ibp; | |
2711 | skip_paren_group (ip); | |
4c9a05bc | 2712 | bcopy ((char *) ibp, (char *) obp, ip->bufp - ibp); |
b0bbbd85 RS |
2713 | obp += ip->bufp - ibp; |
2714 | ibp = ip->bufp; | |
2715 | } | |
823a28aa | 2716 | break; |
b0bbbd85 RS |
2717 | } |
2718 | ||
46181992 | 2719 | /* If this is expanding a macro definition, don't recognize |
adcfa681 | 2720 | preprocessing directives. */ |
46181992 RS |
2721 | if (ip->macro != 0) |
2722 | goto randomchar; | |
3be5fb23 RK |
2723 | /* If this is expand_into_temp_buffer, |
2724 | don't recognize them either. Warn about them | |
46181992 RS |
2725 | only after an actual newline at this level, |
2726 | not at the beginning of the input level. */ | |
3be5fb23 RK |
2727 | if (! ip->fname) { |
2728 | if (ip->buf != beg_of_line) | |
2729 | warning ("preprocessing directive not recognized within macro arg"); | |
b0bbbd85 | 2730 | goto randomchar; |
3be5fb23 | 2731 | } |
b0bbbd85 RS |
2732 | if (ident_length) |
2733 | goto specialchar; | |
2734 | ||
34a2d6f3 | 2735 | |
b0bbbd85 RS |
2736 | /* # keyword: a # must be first nonblank char on the line */ |
2737 | if (beg_of_line == 0) | |
2738 | goto randomchar; | |
2739 | { | |
2740 | U_CHAR *bp; | |
2741 | ||
2742 | /* Scan from start of line, skipping whitespace, comments | |
2743 | and backslash-newlines, and see if we reach this #. | |
2744 | If not, this # is not special. */ | |
2745 | bp = beg_of_line; | |
49df5f37 | 2746 | /* If -traditional, require # to be at beginning of line. */ |
91dbf5e7 | 2747 | if (!traditional) { |
49df5f37 RS |
2748 | while (1) { |
2749 | if (is_hor_space[*bp]) | |
b0bbbd85 | 2750 | bp++; |
49df5f37 RS |
2751 | else if (*bp == '\\' && bp[1] == '\n') |
2752 | bp += 2; | |
2753 | else if (*bp == '/' && bp[1] == '*') { | |
2754 | bp += 2; | |
2755 | while (!(*bp == '*' && bp[1] == '/')) | |
2756 | bp++; | |
2757 | bp += 2; | |
2758 | } | |
80512db7 JW |
2759 | /* There is no point in trying to deal with C++ // comments here, |
2760 | because if there is one, then this # must be part of the | |
2761 | comment and we would never reach here. */ | |
49df5f37 | 2762 | else break; |
b0bbbd85 | 2763 | } |
91dbf5e7 RK |
2764 | if (c == '%') { |
2765 | if (bp[0] != '%') | |
2766 | break; | |
2767 | while (bp[1] == '\\' && bp[2] == '\n') | |
2768 | bp += 2; | |
2769 | if (bp + 1 != ibp) | |
2770 | break; | |
2771 | /* %: appears at start of line; skip past the ':' too. */ | |
2772 | bp++; | |
2773 | ibp++; | |
2774 | } | |
2775 | } | |
b0bbbd85 RS |
2776 | if (bp + 1 != ibp) |
2777 | goto randomchar; | |
2778 | } | |
2779 | ||
2780 | /* This # can start a directive. */ | |
2781 | ||
2782 | --obp; /* Don't copy the '#' */ | |
2783 | ||
2784 | ip->bufp = ibp; | |
2785 | op->bufp = obp; | |
2786 | if (! handle_directive (ip, op)) { | |
2787 | #ifdef USE_C_ALLOCA | |
2788 | alloca (0); | |
2789 | #endif | |
2790 | /* Not a known directive: treat it as ordinary text. | |
2791 | IP, OP, IBP, etc. have not been changed. */ | |
2792 | if (no_output && instack[indepth].fname) { | |
2793 | /* If not generating expanded output, | |
2794 | what we do with ordinary text is skip it. | |
2795 | Discard everything until next # directive. */ | |
bbd4b75b | 2796 | skip_if_group (&instack[indepth], 1, 0); |
b0bbbd85 RS |
2797 | RECACHE; |
2798 | beg_of_line = ibp; | |
2799 | break; | |
2800 | } | |
91dbf5e7 | 2801 | *obp++ = '#'; /* Copy # (even if it was originally %:). */ |
9e92edb4 RK |
2802 | /* Don't expand an identifier that could be a macro directive. |
2803 | (Section 3.8.3 of the ANSI C standard) */ | |
2804 | SKIP_WHITE_SPACE (ibp); | |
2805 | if (is_idstart[*ibp]) | |
2806 | { | |
2807 | *obp++ = *ibp++; | |
2808 | while (is_idchar[*ibp]) | |
2809 | *obp++ = *ibp++; | |
2810 | } | |
b0bbbd85 RS |
2811 | goto randomchar; |
2812 | } | |
2813 | #ifdef USE_C_ALLOCA | |
2814 | alloca (0); | |
2815 | #endif | |
2816 | /* A # directive has been successfully processed. */ | |
2817 | /* If not generating expanded output, ignore everything until | |
2818 | next # directive. */ | |
2819 | if (no_output && instack[indepth].fname) | |
bbd4b75b | 2820 | skip_if_group (&instack[indepth], 1, 0); |
b0bbbd85 RS |
2821 | obp = op->bufp; |
2822 | RECACHE; | |
2823 | beg_of_line = ibp; | |
2824 | break; | |
2825 | ||
2826 | case '\"': /* skip quoted string */ | |
2827 | case '\'': | |
2828 | /* A single quoted string is treated like a double -- some | |
2829 | programs (e.g., troff) are perverse this way */ | |
2830 | ||
2831 | if (ident_length) | |
2832 | goto specialchar; | |
2833 | ||
2834 | start_line = ip->lineno; | |
2835 | ||
2836 | /* Skip ahead to a matching quote. */ | |
2837 | ||
2838 | while (1) { | |
2839 | if (ibp >= limit) { | |
e8db4813 RS |
2840 | if (ip->macro != 0) { |
2841 | /* try harder: this string crosses a macro expansion boundary. | |
2842 | This can happen naturally if -traditional. | |
2843 | Otherwise, only -D can make a macro with an unmatched quote. */ | |
2844 | POPMACRO; | |
2845 | RECACHE; | |
2846 | continue; | |
2847 | } | |
2848 | if (!traditional) { | |
b0bbbd85 RS |
2849 | error_with_line (line_for_error (start_line), |
2850 | "unterminated string or character constant"); | |
2851 | error_with_line (multiline_string_line, | |
2852 | "possible real start of unterminated constant"); | |
2853 | multiline_string_line = 0; | |
2854 | } | |
2855 | break; | |
2856 | } | |
2857 | *obp++ = *ibp; | |
2858 | switch (*ibp++) { | |
2859 | case '\n': | |
2860 | ++ip->lineno; | |
2861 | ++op->lineno; | |
2862 | /* Traditionally, end of line ends a string constant with no error. | |
2863 | So exit the loop and record the new line. */ | |
2864 | if (traditional) { | |
2865 | beg_of_line = ibp; | |
2866 | goto while2end; | |
2867 | } | |
27a5574b | 2868 | if (c == '\'') { |
b0bbbd85 | 2869 | error_with_line (line_for_error (start_line), |
27a5574b | 2870 | "unterminated character constant"); |
b0bbbd85 RS |
2871 | goto while2end; |
2872 | } | |
2994a9ac RK |
2873 | if (multiline_string_line == 0) { |
2874 | if (pedantic) | |
2875 | pedwarn_with_line (line_for_error (start_line), | |
2876 | "string constant runs past end of line"); | |
b0bbbd85 | 2877 | multiline_string_line = ip->lineno - 1; |
2994a9ac | 2878 | } |
b0bbbd85 RS |
2879 | break; |
2880 | ||
2881 | case '\\': | |
2882 | if (ibp >= limit) | |
2883 | break; | |
2884 | if (*ibp == '\n') { | |
2885 | /* Backslash newline is replaced by nothing at all, | |
2886 | but keep the line counts correct. */ | |
2887 | --obp; | |
2888 | ++ibp; | |
2889 | ++ip->lineno; | |
2890 | } else { | |
2891 | /* ANSI stupidly requires that in \\ the second \ | |
2892 | is *not* prevented from combining with a newline. */ | |
2893 | while (*ibp == '\\' && ibp[1] == '\n') { | |
2894 | ibp += 2; | |
2895 | ++ip->lineno; | |
2896 | } | |
2897 | *obp++ = *ibp++; | |
2898 | } | |
2899 | break; | |
2900 | ||
2901 | case '\"': | |
2902 | case '\'': | |
2903 | if (ibp[-1] == c) | |
2904 | goto while2end; | |
2905 | break; | |
2906 | } | |
2907 | } | |
2908 | while2end: | |
2909 | break; | |
2910 | ||
2911 | case '/': | |
2912 | if (*ibp == '\\' && ibp[1] == '\n') | |
2913 | newline_fix (ibp); | |
2914 | ||
2915 | if (*ibp != '*' | |
eda5fa7b | 2916 | && !(cplusplus_comments && *ibp == '/')) |
b0bbbd85 RS |
2917 | goto randomchar; |
2918 | if (ip->macro != 0) | |
2919 | goto randomchar; | |
2920 | if (ident_length) | |
2921 | goto specialchar; | |
2922 | ||
2923 | if (*ibp == '/') { | |
0f41302f | 2924 | /* C++ style comment... */ |
b0bbbd85 RS |
2925 | start_line = ip->lineno; |
2926 | ||
0f41302f | 2927 | /* Comments are equivalent to spaces. */ |
b0bbbd85 | 2928 | if (! put_out_comments) |
a0469a32 | 2929 | obp[-1] = ' '; |
b0bbbd85 | 2930 | |
a0469a32 RK |
2931 | { |
2932 | U_CHAR *before_bp = ibp; | |
2933 | ||
2934 | while (++ibp < limit) { | |
2935 | if (*ibp == '\n') { | |
2936 | if (ibp[-1] != '\\') { | |
2937 | if (put_out_comments) { | |
2938 | bcopy ((char *) before_bp, (char *) obp, ibp - before_bp); | |
2939 | obp += ibp - before_bp; | |
2940 | } | |
2941 | break; | |
80512db7 | 2942 | } |
3e4115b7 RK |
2943 | if (warn_comments) |
2944 | warning ("multiline `//' comment"); | |
a0469a32 RK |
2945 | ++ip->lineno; |
2946 | /* Copy the newline into the output buffer, in order to | |
2947 | avoid the pain of a #line every time a multiline comment | |
2948 | is seen. */ | |
2949 | if (!put_out_comments) | |
2950 | *obp++ = '\n'; | |
2951 | ++op->lineno; | |
b0bbbd85 RS |
2952 | } |
2953 | } | |
2954 | break; | |
2955 | } | |
2956 | } | |
2957 | ||
2958 | /* Ordinary C comment. Skip it, optionally copying it to output. */ | |
2959 | ||
2960 | start_line = ip->lineno; | |
2961 | ||
0f41302f | 2962 | ++ibp; /* Skip the star. */ |
b0bbbd85 RS |
2963 | |
2964 | /* If this cpp is for lint, we peek inside the comments: */ | |
253245df | 2965 | if (for_lint) { |
b0bbbd85 RS |
2966 | U_CHAR *argbp; |
2967 | int cmdlen, arglen; | |
2968 | char *lintcmd = get_lintcmd (ibp, limit, &argbp, &arglen, &cmdlen); | |
2969 | ||
2970 | if (lintcmd != NULL) { | |
b7150e45 | 2971 | op->bufp = obp; |
b415f25e | 2972 | check_expand (op, cmdlen + arglen + 14); |
b7150e45 | 2973 | obp = op->bufp; |
b0bbbd85 RS |
2974 | /* I believe it is always safe to emit this newline: */ |
2975 | obp[-1] = '\n'; | |
4c9a05bc | 2976 | bcopy ("#pragma lint ", (char *) obp, 13); |
b0bbbd85 | 2977 | obp += 13; |
4c9a05bc | 2978 | bcopy (lintcmd, (char *) obp, cmdlen); |
b0bbbd85 RS |
2979 | obp += cmdlen; |
2980 | ||
2981 | if (arglen != 0) { | |
2982 | *(obp++) = ' '; | |
4c9a05bc | 2983 | bcopy (argbp, (char *) obp, arglen); |
b0bbbd85 RS |
2984 | obp += arglen; |
2985 | } | |
2986 | ||
2987 | /* OK, now bring us back to the state we were in before we entered | |
b7150e45 RK |
2988 | this branch. We need #line because the #pragma's newline always |
2989 | messes up the line count. */ | |
2990 | op->bufp = obp; | |
adcfa681 | 2991 | output_line_directive (ip, op, 0, same_file); |
b415f25e | 2992 | check_expand (op, limit - ibp + 2); |
b7150e45 | 2993 | obp = op->bufp; |
b0bbbd85 RS |
2994 | *(obp++) = '/'; |
2995 | } | |
2996 | } | |
2997 | ||
2998 | /* Comments are equivalent to spaces. | |
2999 | Note that we already output the slash; we might not want it. | |
3000 | For -traditional, a comment is equivalent to nothing. */ | |
3001 | if (! put_out_comments) { | |
3002 | if (traditional) | |
3003 | obp--; | |
3004 | else | |
3005 | obp[-1] = ' '; | |
3006 | } | |
3007 | else | |
3008 | *obp++ = '*'; | |
3009 | ||
3010 | { | |
3011 | U_CHAR *before_bp = ibp; | |
3012 | ||
3e4115b7 | 3013 | for (;;) { |
b0bbbd85 | 3014 | switch (*ibp++) { |
b0bbbd85 | 3015 | case '*': |
3e4115b7 RK |
3016 | if (ibp[-2] == '/' && warn_comments) |
3017 | warning ("`/*' within comment"); | |
b0bbbd85 RS |
3018 | if (*ibp == '\\' && ibp[1] == '\n') |
3019 | newline_fix (ibp); | |
3e4115b7 | 3020 | if (*ibp == '/') |
b0bbbd85 RS |
3021 | goto comment_end; |
3022 | break; | |
3e4115b7 | 3023 | |
b0bbbd85 RS |
3024 | case '\n': |
3025 | ++ip->lineno; | |
3026 | /* Copy the newline into the output buffer, in order to | |
3027 | avoid the pain of a #line every time a multiline comment | |
3028 | is seen. */ | |
3029 | if (!put_out_comments) | |
3030 | *obp++ = '\n'; | |
3031 | ++op->lineno; | |
3e4115b7 RK |
3032 | break; |
3033 | ||
3034 | case 0: | |
3035 | if (limit < ibp) { | |
3036 | error_with_line (line_for_error (start_line), | |
3037 | "unterminated comment"); | |
3038 | goto limit_reached; | |
3039 | } | |
3040 | break; | |
b0bbbd85 RS |
3041 | } |
3042 | } | |
3043 | comment_end: | |
3044 | ||
3e4115b7 RK |
3045 | ibp++; |
3046 | if (put_out_comments) { | |
3047 | bcopy ((char *) before_bp, (char *) obp, ibp - before_bp); | |
3048 | obp += ibp - before_bp; | |
b0bbbd85 RS |
3049 | } |
3050 | } | |
3051 | break; | |
3052 | ||
3053 | case '$': | |
3054 | if (!dollars_in_ident) | |
3055 | goto randomchar; | |
3056 | goto letter; | |
3057 | ||
3058 | case '0': case '1': case '2': case '3': case '4': | |
3059 | case '5': case '6': case '7': case '8': case '9': | |
3060 | /* If digit is not part of identifier, it starts a number, | |
3061 | which means that following letters are not an identifier. | |
3062 | "0x5" does not refer to an identifier "x5". | |
3063 | So copy all alphanumerics that follow without accumulating | |
3064 | as an identifier. Periods also, for sake of "3.e7". */ | |
3065 | ||
3066 | if (ident_length == 0) { | |
1942e820 RK |
3067 | for (;;) { |
3068 | while (ibp[0] == '\\' && ibp[1] == '\n') { | |
b0bbbd85 RS |
3069 | ++ip->lineno; |
3070 | ibp += 2; | |
3071 | } | |
3072 | c = *ibp++; | |
fd12bc82 | 3073 | if (!is_idchar[c] && c != '.') { |
b0bbbd85 RS |
3074 | --ibp; |
3075 | break; | |
3076 | } | |
3077 | *obp++ = c; | |
3078 | /* A sign can be part of a preprocessing number | |
3079 | if it follows an e. */ | |
3080 | if (c == 'e' || c == 'E') { | |
1942e820 | 3081 | while (ibp[0] == '\\' && ibp[1] == '\n') { |
b0bbbd85 RS |
3082 | ++ip->lineno; |
3083 | ibp += 2; | |
3084 | } | |
1942e820 | 3085 | if (*ibp == '+' || *ibp == '-') { |
b0bbbd85 RS |
3086 | *obp++ = *ibp++; |
3087 | /* But traditional C does not let the token go past the sign. */ | |
3088 | if (traditional) | |
3089 | break; | |
3090 | } | |
3091 | } | |
3092 | } | |
3093 | break; | |
3094 | } | |
3095 | /* fall through */ | |
3096 | ||
3097 | case '_': | |
3098 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': | |
3099 | case 'g': case 'h': case 'i': case 'j': case 'k': case 'l': | |
3100 | case 'm': case 'n': case 'o': case 'p': case 'q': case 'r': | |
3101 | case 's': case 't': case 'u': case 'v': case 'w': case 'x': | |
3102 | case 'y': case 'z': | |
3103 | case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': | |
3104 | case 'G': case 'H': case 'I': case 'J': case 'K': case 'L': | |
3105 | case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R': | |
3106 | case 'S': case 'T': case 'U': case 'V': case 'W': case 'X': | |
3107 | case 'Y': case 'Z': | |
3108 | letter: | |
3109 | ident_length++; | |
3110 | /* Compute step of hash function, to avoid a proc call on every token */ | |
3111 | hash = HASHSTEP (hash, c); | |
3112 | break; | |
3113 | ||
3114 | case '\n': | |
d0691cfb RS |
3115 | if (ip->fname == 0 && *ibp == '-') { |
3116 | /* Newline - inhibits expansion of preceding token. | |
3117 | If expanding a macro arg, we keep the newline -. | |
3118 | In final output, it is deleted. | |
3119 | We recognize Newline - in macro bodies and macro args. */ | |
3120 | if (! concatenated) { | |
3121 | ident_length = 0; | |
3122 | hash = 0; | |
3123 | } | |
3124 | ibp++; | |
3125 | if (!output_marks) { | |
3126 | obp--; | |
3127 | } else { | |
3128 | /* If expanding a macro arg, keep the newline -. */ | |
3129 | *obp++ = '-'; | |
3130 | } | |
3131 | break; | |
3132 | } | |
3133 | ||
b0bbbd85 | 3134 | /* If reprocessing a macro expansion, newline is a special marker. */ |
d0691cfb | 3135 | else if (ip->macro != 0) { |
b0bbbd85 RS |
3136 | /* Newline White is a "funny space" to separate tokens that are |
3137 | supposed to be separate but without space between. | |
3138 | Here White means any whitespace character. | |
3139 | Newline - marks a recursive macro use that is not | |
3140 | supposed to be expandable. */ | |
3141 | ||
d0691cfb | 3142 | if (is_space[*ibp]) { |
b0bbbd85 RS |
3143 | /* Newline Space does not prevent expansion of preceding token |
3144 | so expand the preceding token and then come back. */ | |
3145 | if (ident_length > 0) | |
3146 | goto specialchar; | |
3147 | ||
3148 | /* If generating final output, newline space makes a space. */ | |
3149 | if (!output_marks) { | |
3150 | obp[-1] = *ibp++; | |
3151 | /* And Newline Newline makes a newline, so count it. */ | |
3152 | if (obp[-1] == '\n') | |
3153 | op->lineno++; | |
3154 | } else { | |
3155 | /* If expanding a macro arg, keep the newline space. | |
3156 | If the arg gets stringified, newline space makes nothing. */ | |
3157 | *obp++ = *ibp++; | |
3158 | } | |
3159 | } else abort (); /* Newline followed by something random? */ | |
3160 | break; | |
3161 | } | |
3162 | ||
3163 | /* If there is a pending identifier, handle it and come back here. */ | |
3164 | if (ident_length > 0) | |
3165 | goto specialchar; | |
3166 | ||
3167 | beg_of_line = ibp; | |
3168 | ||
3169 | /* Update the line counts and output a #line if necessary. */ | |
3170 | ++ip->lineno; | |
3171 | ++op->lineno; | |
3172 | if (ip->lineno != op->lineno) { | |
3173 | op->bufp = obp; | |
adcfa681 | 3174 | output_line_directive (ip, op, 1, same_file); |
b415f25e | 3175 | check_expand (op, limit - ibp); |
b0bbbd85 RS |
3176 | obp = op->bufp; |
3177 | } | |
3178 | break; | |
3179 | ||
3180 | /* Come here either after (1) a null character that is part of the input | |
3181 | or (2) at the end of the input, because there is a null there. */ | |
3182 | case 0: | |
3183 | if (ibp <= limit) | |
3184 | /* Our input really contains a null character. */ | |
3185 | goto randomchar; | |
3186 | ||
3e4115b7 | 3187 | limit_reached: |
b0bbbd85 RS |
3188 | /* At end of a macro-expansion level, pop it and read next level. */ |
3189 | if (ip->macro != 0) { | |
3190 | obp--; | |
3191 | ibp--; | |
3192 | /* If traditional, and we have an identifier that ends here, | |
3193 | process it now, so we get the right error for recursion. */ | |
3194 | if (traditional && ident_length | |
3195 | && ! is_idchar[*instack[indepth - 1].bufp]) { | |
3196 | redo_char = 1; | |
3197 | goto randomchar; | |
3198 | } | |
3199 | POPMACRO; | |
3200 | RECACHE; | |
3201 | break; | |
3202 | } | |
3203 | ||
3204 | /* If we don't have a pending identifier, | |
3205 | return at end of input. */ | |
3206 | if (ident_length == 0) { | |
3207 | obp--; | |
3208 | ibp--; | |
3209 | op->bufp = obp; | |
3210 | ip->bufp = ibp; | |
3211 | goto ending; | |
3212 | } | |
3213 | ||
3214 | /* If we do have a pending identifier, just consider this null | |
3215 | a special character and arrange to dispatch on it again. | |
3216 | The second time, IDENT_LENGTH will be zero so we will return. */ | |
3217 | ||
3218 | /* Fall through */ | |
3219 | ||
3220 | specialchar: | |
3221 | ||
3222 | /* Handle the case of a character such as /, ', " or null | |
3223 | seen following an identifier. Back over it so that | |
3224 | after the identifier is processed the special char | |
3225 | will be dispatched on again. */ | |
3226 | ||
3227 | ibp--; | |
3228 | obp--; | |
3229 | redo_char = 1; | |
3230 | ||
3231 | default: | |
3232 | ||
3233 | randomchar: | |
3234 | ||
3235 | if (ident_length > 0) { | |
3236 | register HASHNODE *hp; | |
3237 | ||
3238 | /* We have just seen an identifier end. If it's a macro, expand it. | |
3239 | ||
3240 | IDENT_LENGTH is the length of the identifier | |
3241 | and HASH is its hash code. | |
3242 | ||
3243 | The identifier has already been copied to the output, | |
3244 | so if it is a macro we must remove it. | |
3245 | ||
3246 | If REDO_CHAR is 0, the char that terminated the identifier | |
3247 | has been skipped in the output and the input. | |
3248 | OBP-IDENT_LENGTH-1 points to the identifier. | |
3249 | If the identifier is a macro, we must back over the terminator. | |
3250 | ||
3251 | If REDO_CHAR is 1, the terminating char has already been | |
3252 | backed over. OBP-IDENT_LENGTH points to the identifier. */ | |
3253 | ||
3254 | if (!pcp_outfile || pcp_inside_if) { | |
b0bbbd85 RS |
3255 | for (hp = hashtab[MAKE_POS (hash) % HASHSIZE]; hp != NULL; |
3256 | hp = hp->next) { | |
3257 | ||
3258 | if (hp->length == ident_length) { | |
3259 | int obufp_before_macroname; | |
3260 | int op_lineno_before_macroname; | |
3261 | register int i = ident_length; | |
3262 | register U_CHAR *p = hp->name; | |
3263 | register U_CHAR *q = obp - i; | |
3264 | int disabled; | |
3265 | ||
3266 | if (! redo_char) | |
3267 | q--; | |
3268 | ||
3269 | do { /* All this to avoid a strncmp () */ | |
3270 | if (*p++ != *q++) | |
3271 | goto hashcollision; | |
3272 | } while (--i); | |
3273 | ||
3274 | /* We found a use of a macro name. | |
3275 | see if the context shows it is a macro call. */ | |
3276 | ||
3277 | /* Back up over terminating character if not already done. */ | |
3278 | if (! redo_char) { | |
3279 | ibp--; | |
3280 | obp--; | |
3281 | } | |
3282 | ||
3283 | /* Save this as a displacement from the beginning of the output | |
3284 | buffer. We can not save this as a position in the output | |
3285 | buffer, because it may get realloc'ed by RECACHE. */ | |
3286 | obufp_before_macroname = (obp - op->buf) - ident_length; | |
3287 | op_lineno_before_macroname = op->lineno; | |
3288 | ||
3289 | if (hp->type == T_PCSTRING) { | |
3290 | pcstring_used (hp); /* Mark the definition of this key | |
3291 | as needed, ensuring that it | |
3292 | will be output. */ | |
3293 | break; /* Exit loop, since the key cannot have a | |
3294 | definition any longer. */ | |
3295 | } | |
3296 | ||
3297 | /* Record whether the macro is disabled. */ | |
3298 | disabled = hp->type == T_DISABLED; | |
3299 | ||
3300 | /* This looks like a macro ref, but if the macro was disabled, | |
3301 | just copy its name and put in a marker if requested. */ | |
3302 | ||
3303 | if (disabled) { | |
3304 | #if 0 | |
3305 | /* This error check caught useful cases such as | |
ad0c9fa1 RS |
3306 | #define foo(x,y) bar (x (y,0), y) |
3307 | foo (foo, baz) */ | |
b0bbbd85 RS |
3308 | if (traditional) |
3309 | error ("recursive use of macro `%s'", hp->name); | |
3310 | #endif | |
3311 | ||
3312 | if (output_marks) { | |
3313 | check_expand (op, limit - ibp + 2); | |
3314 | *obp++ = '\n'; | |
3315 | *obp++ = '-'; | |
3316 | } | |
3317 | break; | |
3318 | } | |
3319 | ||
3320 | /* If macro wants an arglist, verify that a '(' follows. | |
3321 | first skip all whitespace, copying it to the output | |
3322 | after the macro name. Then, if there is no '(', | |
3323 | decide this is not a macro call and leave things that way. */ | |
3324 | if ((hp->type == T_MACRO || hp->type == T_DISABLED) | |
3325 | && hp->value.defn->nargs >= 0) | |
3326 | { | |
3327 | U_CHAR *old_ibp = ibp; | |
3328 | U_CHAR *old_obp = obp; | |
3329 | int old_iln = ip->lineno; | |
3330 | int old_oln = op->lineno; | |
3331 | ||
3332 | while (1) { | |
3333 | /* Scan forward over whitespace, copying it to the output. */ | |
3334 | if (ibp == limit && ip->macro != 0) { | |
3335 | POPMACRO; | |
3336 | RECACHE; | |
3337 | old_ibp = ibp; | |
3338 | old_obp = obp; | |
3339 | old_iln = ip->lineno; | |
3340 | old_oln = op->lineno; | |
3341 | } | |
3342 | /* A comment: copy it unchanged or discard it. */ | |
1942e820 | 3343 | else if (*ibp == '/' && ibp[1] == '*') { |
b0bbbd85 RS |
3344 | if (put_out_comments) { |
3345 | *obp++ = '/'; | |
3346 | *obp++ = '*'; | |
3347 | } else if (! traditional) { | |
3348 | *obp++ = ' '; | |
3349 | } | |
3350 | ibp += 2; | |
3351 | while (ibp + 1 != limit | |
3352 | && !(ibp[0] == '*' && ibp[1] == '/')) { | |
3353 | /* We need not worry about newline-marks, | |
3354 | since they are never found in comments. */ | |
3355 | if (*ibp == '\n') { | |
3356 | /* Newline in a file. Count it. */ | |
3357 | ++ip->lineno; | |
3358 | ++op->lineno; | |
3359 | } | |
3360 | if (put_out_comments) | |
3361 | *obp++ = *ibp++; | |
3362 | else | |
3363 | ibp++; | |
3364 | } | |
3365 | ibp += 2; | |
3366 | if (put_out_comments) { | |
3367 | *obp++ = '*'; | |
3368 | *obp++ = '/'; | |
3369 | } | |
3370 | } | |
3371 | else if (is_space[*ibp]) { | |
3372 | *obp++ = *ibp++; | |
3373 | if (ibp[-1] == '\n') { | |
3374 | if (ip->macro == 0) { | |
3375 | /* Newline in a file. Count it. */ | |
3376 | ++ip->lineno; | |
3377 | ++op->lineno; | |
3378 | } else if (!output_marks) { | |
3379 | /* A newline mark, and we don't want marks | |
3380 | in the output. If it is newline-hyphen, | |
3381 | discard it entirely. Otherwise, it is | |
3382 | newline-whitechar, so keep the whitechar. */ | |
3383 | obp--; | |
3384 | if (*ibp == '-') | |
3385 | ibp++; | |
3386 | else { | |
3387 | if (*ibp == '\n') | |
3388 | ++op->lineno; | |
3389 | *obp++ = *ibp++; | |
3390 | } | |
3391 | } else { | |
3392 | /* A newline mark; copy both chars to the output. */ | |
3393 | *obp++ = *ibp++; | |
3394 | } | |
3395 | } | |
3396 | } | |
3397 | else break; | |
3398 | } | |
3399 | if (*ibp != '(') { | |
3400 | /* It isn't a macro call. | |
3401 | Put back the space that we just skipped. */ | |
3402 | ibp = old_ibp; | |
3403 | obp = old_obp; | |
3404 | ip->lineno = old_iln; | |
3405 | op->lineno = old_oln; | |
3406 | /* Exit the for loop. */ | |
3407 | break; | |
3408 | } | |
3409 | } | |
3410 | ||
3411 | /* This is now known to be a macro call. | |
3412 | Discard the macro name from the output, | |
02c1d408 | 3413 | along with any following whitespace just copied, |
e1fe312f | 3414 | but preserve newlines if not outputting marks since this |
02c1d408 | 3415 | is more likely to do the right thing with line numbers. */ |
b0bbbd85 | 3416 | obp = op->buf + obufp_before_macroname; |
e1fe312f | 3417 | if (output_marks) |
02c1d408 RK |
3418 | op->lineno = op_lineno_before_macroname; |
3419 | else { | |
3420 | int newlines = op->lineno - op_lineno_before_macroname; | |
3421 | while (0 < newlines--) | |
3422 | *obp++ = '\n'; | |
3423 | } | |
d0691cfb RS |
3424 | |
3425 | /* Prevent accidental token-pasting with a character | |
3426 | before the macro call. */ | |
f803dcf8 RK |
3427 | if (!traditional && obp != op->buf) { |
3428 | switch (obp[-1]) { | |
15e779e8 RK |
3429 | case '!': case '%': case '&': case '*': |
3430 | case '+': case '-': case '/': case ':': | |
3431 | case '<': case '=': case '>': case '^': | |
3432 | case '|': | |
f803dcf8 RK |
3433 | /* If we are expanding a macro arg, make a newline marker |
3434 | to separate the tokens. If we are making real output, | |
3435 | a plain space will do. */ | |
3436 | if (output_marks) | |
3437 | *obp++ = '\n'; | |
3438 | *obp++ = ' '; | |
3439 | } | |
d0691cfb RS |
3440 | } |
3441 | ||
b0bbbd85 RS |
3442 | /* Expand the macro, reading arguments as needed, |
3443 | and push the expansion on the input stack. */ | |
3444 | ip->bufp = ibp; | |
3445 | op->bufp = obp; | |
3446 | macroexpand (hp, op); | |
3447 | ||
3448 | /* Reexamine input stack, since macroexpand has pushed | |
3449 | a new level on it. */ | |
3450 | obp = op->bufp; | |
3451 | RECACHE; | |
3452 | break; | |
3453 | } | |
3454 | hashcollision: | |
3455 | ; | |
3456 | } /* End hash-table-search loop */ | |
3457 | } | |
3458 | ident_length = hash = 0; /* Stop collecting identifier */ | |
3459 | redo_char = 0; | |
3460 | concatenated = 0; | |
3461 | } /* End if (ident_length > 0) */ | |
3462 | } /* End switch */ | |
3463 | } /* End per-char loop */ | |
3464 | ||
3465 | /* Come here to return -- but first give an error message | |
3466 | if there was an unterminated successful conditional. */ | |
3467 | ending: | |
2af5e9e2 RK |
3468 | if (if_stack != ip->if_stack) |
3469 | { | |
25cbb59e | 3470 | char *str; |
2af5e9e2 RK |
3471 | |
3472 | switch (if_stack->type) | |
3473 | { | |
3474 | case T_IF: | |
3475 | str = "if"; | |
3476 | break; | |
3477 | case T_IFDEF: | |
3478 | str = "ifdef"; | |
3479 | break; | |
3480 | case T_IFNDEF: | |
3481 | str = "ifndef"; | |
3482 | break; | |
3483 | case T_ELSE: | |
3484 | str = "else"; | |
3485 | break; | |
3486 | case T_ELIF: | |
3487 | str = "elif"; | |
3488 | break; | |
25cbb59e RK |
3489 | default: |
3490 | abort (); | |
2af5e9e2 RK |
3491 | } |
3492 | ||
3493 | error_with_line (line_for_error (if_stack->lineno), | |
3494 | "unterminated `#%s' conditional", str); | |
b0bbbd85 RS |
3495 | } |
3496 | if_stack = ip->if_stack; | |
3497 | } | |
3498 | \f | |
3499 | /* | |
3500 | * Rescan a string into a temporary buffer and return the result | |
3501 | * as a FILE_BUF. Note this function returns a struct, not a pointer. | |
3502 | * | |
3503 | * OUTPUT_MARKS nonzero means keep Newline markers found in the input | |
3504 | * and insert such markers when appropriate. See `rescan' for details. | |
3505 | * OUTPUT_MARKS is 1 for macroexpanding a macro argument separately | |
3506 | * before substitution; it is 0 for other uses. | |
3507 | */ | |
3508 | static FILE_BUF | |
3509 | expand_to_temp_buffer (buf, limit, output_marks, assertions) | |
3510 | U_CHAR *buf, *limit; | |
3511 | int output_marks, assertions; | |
3512 | { | |
3513 | register FILE_BUF *ip; | |
3514 | FILE_BUF obuf; | |
3515 | int length = limit - buf; | |
3516 | U_CHAR *buf1; | |
3517 | int odepth = indepth; | |
3518 | int save_assertions_flag = assertions_flag; | |
3519 | ||
3520 | assertions_flag = assertions; | |
3521 | ||
3522 | if (length < 0) | |
3523 | abort (); | |
3524 | ||
3525 | /* Set up the input on the input stack. */ | |
3526 | ||
3527 | buf1 = (U_CHAR *) alloca (length + 1); | |
3528 | { | |
3529 | register U_CHAR *p1 = buf; | |
3530 | register U_CHAR *p2 = buf1; | |
3531 | ||
3532 | while (p1 != limit) | |
3533 | *p2++ = *p1++; | |
3534 | } | |
3535 | buf1[length] = 0; | |
3536 | ||
3537 | /* Set up to receive the output. */ | |
3538 | ||
3539 | obuf.length = length * 2 + 100; /* Usually enough. Why be stingy? */ | |
3540 | obuf.bufp = obuf.buf = (U_CHAR *) xmalloc (obuf.length); | |
3541 | obuf.fname = 0; | |
3542 | obuf.macro = 0; | |
3543 | obuf.free_ptr = 0; | |
3544 | ||
3545 | CHECK_DEPTH ({return obuf;}); | |
3546 | ||
3547 | ++indepth; | |
3548 | ||
3549 | ip = &instack[indepth]; | |
3550 | ip->fname = 0; | |
3551 | ip->nominal_fname = 0; | |
3e4115b7 | 3552 | ip->inc = 0; |
b0bbbd85 RS |
3553 | ip->system_header_p = 0; |
3554 | ip->macro = 0; | |
3555 | ip->free_ptr = 0; | |
3556 | ip->length = length; | |
3557 | ip->buf = ip->bufp = buf1; | |
3558 | ip->if_stack = if_stack; | |
3559 | ||
3560 | ip->lineno = obuf.lineno = 1; | |
3561 | ||
3562 | /* Scan the input, create the output. */ | |
3563 | rescan (&obuf, output_marks); | |
3564 | ||
3565 | /* Pop input stack to original state. */ | |
3566 | --indepth; | |
3567 | ||
3568 | if (indepth != odepth) | |
3569 | abort (); | |
3570 | ||
3571 | /* Record the output. */ | |
3572 | obuf.length = obuf.bufp - obuf.buf; | |
3573 | ||
3574 | assertions_flag = save_assertions_flag; | |
3575 | return obuf; | |
3576 | } | |
3577 | \f | |
3578 | /* | |
3579 | * Process a # directive. Expects IP->bufp to point after the '#', as in | |
adcfa681 | 3580 | * `#define foo bar'. Passes to the directive handler |
b0bbbd85 | 3581 | * (do_define, do_include, etc.): the addresses of the 1st and |
adcfa681 RK |
3582 | * last chars of the directive (starting immediately after the # |
3583 | * keyword), plus op and the keyword table pointer. If the directive | |
b0bbbd85 | 3584 | * contains comments it is copied into a temporary buffer sans comments |
adcfa681 | 3585 | * and the temporary buffer is passed to the directive handler instead. |
b0bbbd85 RS |
3586 | * Likewise for backslash-newlines. |
3587 | * | |
3588 | * Returns nonzero if this was a known # directive. | |
3589 | * Otherwise, returns zero, without advancing the input pointer. | |
3590 | */ | |
3591 | ||
3592 | static int | |
3593 | handle_directive (ip, op) | |
3594 | FILE_BUF *ip, *op; | |
3595 | { | |
3596 | register U_CHAR *bp, *cp; | |
3597 | register struct directive *kt; | |
3598 | register int ident_length; | |
3599 | U_CHAR *resume_p; | |
3600 | ||
adcfa681 | 3601 | /* Nonzero means we must copy the entire directive |
b0bbbd85 | 3602 | to get rid of comments or backslash-newlines. */ |
adcfa681 | 3603 | int copy_directive = 0; |
b0bbbd85 RS |
3604 | |
3605 | U_CHAR *ident, *after_ident; | |
3606 | ||
3607 | bp = ip->bufp; | |
3608 | ||
3609 | /* Record where the directive started. do_xifdef needs this. */ | |
3610 | directive_start = bp - 1; | |
3611 | ||
3612 | /* Skip whitespace and \-newline. */ | |
3613 | while (1) { | |
3614 | if (is_hor_space[*bp]) { | |
c03413c7 RK |
3615 | if (*bp != ' ' && *bp != '\t' && pedantic) |
3616 | pedwarn ("%s in preprocessing directive", char_name[*bp]); | |
b0bbbd85 | 3617 | bp++; |
80512db7 JW |
3618 | } else if (*bp == '/' && (bp[1] == '*' |
3619 | || (cplusplus_comments && bp[1] == '/'))) { | |
3620 | ip->bufp = bp + 2; | |
2aa7ec37 | 3621 | skip_to_end_of_comment (ip, &ip->lineno, 0); |
b0bbbd85 RS |
3622 | bp = ip->bufp; |
3623 | } else if (*bp == '\\' && bp[1] == '\n') { | |
3624 | bp += 2; ip->lineno++; | |
3625 | } else break; | |
3626 | } | |
3627 | ||
3628 | /* Now find end of directive name. | |
3629 | If we encounter a backslash-newline, exchange it with any following | |
3630 | symbol-constituents so that we end up with a contiguous name. */ | |
3631 | ||
3632 | cp = bp; | |
3633 | while (1) { | |
3634 | if (is_idchar[*cp]) | |
3635 | cp++; | |
3636 | else { | |
3637 | if (*cp == '\\' && cp[1] == '\n') | |
3638 | name_newline_fix (cp); | |
3639 | if (is_idchar[*cp]) | |
3640 | cp++; | |
3641 | else break; | |
3642 | } | |
3643 | } | |
3644 | ident_length = cp - bp; | |
3645 | ident = bp; | |
3646 | after_ident = cp; | |
3647 | ||
3648 | /* A line of just `#' becomes blank. */ | |
3649 | ||
3650 | if (ident_length == 0 && *after_ident == '\n') { | |
3651 | ip->bufp = after_ident; | |
3652 | return 1; | |
3653 | } | |
3654 | ||
3655 | if (ident_length == 0 || !is_idstart[*ident]) { | |
3656 | U_CHAR *p = ident; | |
3657 | while (is_idchar[*p]) { | |
3658 | if (*p < '0' || *p > '9') | |
3659 | break; | |
3660 | p++; | |
3661 | } | |
3662 | /* Handle # followed by a line number. */ | |
3663 | if (p != ident && !is_idchar[*p]) { | |
3664 | static struct directive line_directive_table[] = { | |
3665 | { 4, do_line, "line", T_LINE}, | |
3666 | }; | |
3667 | if (pedantic) | |
3668 | pedwarn ("`#' followed by integer"); | |
3669 | after_ident = ident; | |
3670 | kt = line_directive_table; | |
3671 | goto old_linenum; | |
3672 | } | |
3673 | ||
3674 | /* Avoid error for `###' and similar cases unless -pedantic. */ | |
3675 | if (p == ident) { | |
3676 | while (*p == '#' || is_hor_space[*p]) p++; | |
3677 | if (*p == '\n') { | |
3678 | if (pedantic && !lang_asm) | |
adcfa681 | 3679 | warning ("invalid preprocessing directive"); |
b0bbbd85 RS |
3680 | return 0; |
3681 | } | |
3682 | } | |
3683 | ||
3684 | if (!lang_asm) | |
adcfa681 | 3685 | error ("invalid preprocessing directive name"); |
b0bbbd85 RS |
3686 | |
3687 | return 0; | |
3688 | } | |
3689 | ||
3690 | /* | |
3691 | * Decode the keyword and call the appropriate expansion | |
3692 | * routine, after moving the input pointer up to the next line. | |
3693 | */ | |
3694 | for (kt = directive_table; kt->length > 0; kt++) { | |
25cbb59e | 3695 | if (kt->length == ident_length && !bcmp (kt->name, ident, ident_length)) { |
b0bbbd85 RS |
3696 | register U_CHAR *buf; |
3697 | register U_CHAR *limit; | |
3698 | int unterminated; | |
3699 | int junk; | |
625bbc60 | 3700 | int *already_output; |
b0bbbd85 RS |
3701 | |
3702 | /* Nonzero means do not delete comments within the directive. | |
3703 | #define needs this when -traditional. */ | |
3704 | int keep_comments; | |
3705 | ||
3706 | old_linenum: | |
3707 | ||
3708 | limit = ip->buf + ip->length; | |
3709 | unterminated = 0; | |
625bbc60 | 3710 | already_output = 0; |
b0bbbd85 RS |
3711 | keep_comments = traditional && kt->traditional_comments; |
3712 | /* #import is defined only in Objective C, or when on the NeXT. */ | |
25cbb59e RK |
3713 | if (kt->type == T_IMPORT |
3714 | && !(objc || lookup ((U_CHAR *) "__NeXT__", -1, -1))) | |
b0bbbd85 RS |
3715 | break; |
3716 | ||
adcfa681 | 3717 | /* Find the end of this directive (first newline not backslashed |
b0bbbd85 | 3718 | and not in a string or comment). |
adcfa681 | 3719 | Set COPY_DIRECTIVE if the directive must be copied |
b0bbbd85 RS |
3720 | (it contains a backslash-newline or a comment). */ |
3721 | ||
3722 | buf = bp = after_ident; | |
3723 | while (bp < limit) { | |
3724 | register U_CHAR c = *bp++; | |
3725 | switch (c) { | |
3726 | case '\\': | |
3727 | if (bp < limit) { | |
3728 | if (*bp == '\n') { | |
3729 | ip->lineno++; | |
adcfa681 | 3730 | copy_directive = 1; |
01bffe73 RK |
3731 | bp++; |
3732 | } else if (traditional) | |
3733 | bp++; | |
b0bbbd85 RS |
3734 | } |
3735 | break; | |
3736 | ||
3737 | case '\'': | |
3738 | case '\"': | |
adcfa681 | 3739 | bp = skip_quoted_string (bp - 1, limit, ip->lineno, &ip->lineno, ©_directive, &unterminated); |
b0bbbd85 RS |
3740 | /* Don't bother calling the directive if we already got an error |
3741 | message due to unterminated string. Skip everything and pretend | |
3742 | we called the directive. */ | |
3743 | if (unterminated) { | |
3744 | if (traditional) { | |
3745 | /* Traditional preprocessing permits unterminated strings. */ | |
3746 | ip->bufp = bp; | |
3747 | goto endloop1; | |
3748 | } | |
3749 | ip->bufp = bp; | |
3750 | return 1; | |
3751 | } | |
3752 | break; | |
3753 | ||
3754 | /* <...> is special for #include. */ | |
3755 | case '<': | |
3756 | if (!kt->angle_brackets) | |
3757 | break; | |
a957c794 RK |
3758 | while (bp < limit && *bp != '>' && *bp != '\n') { |
3759 | if (*bp == '\\' && bp[1] == '\n') { | |
3760 | ip->lineno++; | |
adcfa681 | 3761 | copy_directive = 1; |
a957c794 RK |
3762 | bp++; |
3763 | } | |
3764 | bp++; | |
3765 | } | |
b0bbbd85 RS |
3766 | break; |
3767 | ||
3768 | case '/': | |
3769 | if (*bp == '\\' && bp[1] == '\n') | |
3770 | newline_fix (bp); | |
3771 | if (*bp == '*' | |
eda5fa7b | 3772 | || (cplusplus_comments && *bp == '/')) { |
b0bbbd85 RS |
3773 | U_CHAR *obp = bp - 1; |
3774 | ip->bufp = bp + 1; | |
2aa7ec37 | 3775 | skip_to_end_of_comment (ip, &ip->lineno, 0); |
b0bbbd85 | 3776 | bp = ip->bufp; |
adcfa681 | 3777 | /* No need to copy the directive because of a comment at the end; |
b0bbbd85 RS |
3778 | just don't include the comment in the directive. */ |
3779 | if (bp == limit || *bp == '\n') { | |
3780 | bp = obp; | |
3781 | goto endloop1; | |
3782 | } | |
3783 | /* Don't remove the comments if -traditional. */ | |
3784 | if (! keep_comments) | |
adcfa681 | 3785 | copy_directive++; |
b0bbbd85 RS |
3786 | } |
3787 | break; | |
3788 | ||
3789 | case '\f': | |
c03413c7 | 3790 | case '\r': |
b0bbbd85 RS |
3791 | case '\v': |
3792 | if (pedantic) | |
c03413c7 | 3793 | pedwarn ("%s in preprocessing directive", char_name[c]); |
b0bbbd85 RS |
3794 | break; |
3795 | ||
3796 | case '\n': | |
3797 | --bp; /* Point to the newline */ | |
3798 | ip->bufp = bp; | |
3799 | goto endloop1; | |
3800 | } | |
3801 | } | |
3802 | ip->bufp = bp; | |
3803 | ||
3804 | endloop1: | |
3805 | resume_p = ip->bufp; | |
3806 | /* BP is the end of the directive. | |
3807 | RESUME_P is the next interesting data after the directive. | |
3808 | A comment may come between. */ | |
3809 | ||
3810 | /* If a directive should be copied through, and -E was given, | |
3811 | pass it through before removing comments. */ | |
3812 | if (!no_output && kt->pass_thru && put_out_comments) { | |
3813 | int len; | |
3814 | ||
3815 | /* Output directive name. */ | |
3816 | check_expand (op, kt->length + 2); | |
3817 | /* Make sure # is at the start of a line */ | |
3818 | if (op->bufp > op->buf && op->bufp[-1] != '\n') { | |
3819 | op->lineno++; | |
3820 | *op->bufp++ = '\n'; | |
3821 | } | |
3822 | *op->bufp++ = '#'; | |
3823 | bcopy (kt->name, op->bufp, kt->length); | |
3824 | op->bufp += kt->length; | |
3825 | ||
3826 | /* Output arguments. */ | |
3827 | len = (bp - buf); | |
3828 | check_expand (op, len); | |
4c9a05bc | 3829 | bcopy (buf, (char *) op->bufp, len); |
b0bbbd85 RS |
3830 | op->bufp += len; |
3831 | /* Take account of any (escaped) newlines just output. */ | |
3832 | while (--len >= 0) | |
3833 | if (buf[len] == '\n') | |
3834 | op->lineno++; | |
3835 | ||
3836 | already_output = &junk; | |
3837 | } /* Don't we need a newline or #line? */ | |
3838 | ||
adcfa681 | 3839 | if (copy_directive) { |
b0bbbd85 | 3840 | register U_CHAR *xp = buf; |
adcfa681 | 3841 | /* Need to copy entire directive into temp buffer before dispatching */ |
b0bbbd85 | 3842 | |
adcfa681 | 3843 | cp = (U_CHAR *) alloca (bp - buf + 5); /* room for directive plus |
b0bbbd85 RS |
3844 | some slop */ |
3845 | buf = cp; | |
3846 | ||
3847 | /* Copy to the new buffer, deleting comments | |
3848 | and backslash-newlines (and whitespace surrounding the latter). */ | |
3849 | ||
3850 | while (xp < bp) { | |
3851 | register U_CHAR c = *xp++; | |
3852 | *cp++ = c; | |
3853 | ||
3854 | switch (c) { | |
3855 | case '\n': | |
3856 | abort (); /* A bare newline should never part of the line. */ | |
3857 | break; | |
3858 | ||
3859 | /* <...> is special for #include. */ | |
3860 | case '<': | |
3861 | if (!kt->angle_brackets) | |
3862 | break; | |
3863 | while (xp < bp && c != '>') { | |
3864 | c = *xp++; | |
3865 | if (c == '\\' && xp < bp && *xp == '\n') | |
3866 | xp++; | |
3867 | else | |
3868 | *cp++ = c; | |
3869 | } | |
3870 | break; | |
3871 | ||
3872 | case '\\': | |
3873 | if (*xp == '\n') { | |
3874 | xp++; | |
3875 | cp--; | |
a128ef19 RK |
3876 | if (cp != buf && is_hor_space[cp[-1]]) { |
3877 | while (cp - 1 != buf && is_hor_space[cp[-2]]) | |
3878 | cp--; | |
b0bbbd85 | 3879 | SKIP_WHITE_SPACE (xp); |
a128ef19 | 3880 | } else if (is_hor_space[*xp]) { |
b0bbbd85 RS |
3881 | *cp++ = *xp++; |
3882 | SKIP_WHITE_SPACE (xp); | |
3883 | } | |
2e420a17 | 3884 | } else if (traditional && xp < bp) { |
1a5b457d | 3885 | *cp++ = *xp++; |
b0bbbd85 RS |
3886 | } |
3887 | break; | |
3888 | ||
3889 | case '\'': | |
3890 | case '\"': | |
3891 | { | |
3892 | register U_CHAR *bp1 | |
8d9bfdc5 RK |
3893 | = skip_quoted_string (xp - 1, bp, ip->lineno, |
3894 | NULL_PTR, NULL_PTR, NULL_PTR); | |
b0bbbd85 RS |
3895 | while (xp != bp1) |
3896 | if (*xp == '\\') { | |
3897 | if (*++xp != '\n') | |
3898 | *cp++ = '\\'; | |
3899 | else | |
3900 | xp++; | |
3901 | } else | |
3902 | *cp++ = *xp++; | |
3903 | } | |
3904 | break; | |
3905 | ||
3906 | case '/': | |
3907 | if (*xp == '*' | |
eda5fa7b | 3908 | || (cplusplus_comments && *xp == '/')) { |
b0bbbd85 | 3909 | ip->bufp = xp + 1; |
adcfa681 | 3910 | /* If we already copied the directive through, |
b0bbbd85 | 3911 | already_output != 0 prevents outputting comment now. */ |
2aa7ec37 | 3912 | skip_to_end_of_comment (ip, already_output, 0); |
b0bbbd85 RS |
3913 | if (keep_comments) |
3914 | while (xp != ip->bufp) | |
3915 | *cp++ = *xp++; | |
3916 | /* Delete or replace the slash. */ | |
3917 | else if (traditional) | |
3918 | cp--; | |
3919 | else | |
3920 | cp[-1] = ' '; | |
3921 | xp = ip->bufp; | |
3922 | } | |
3923 | } | |
3924 | } | |
3925 | ||
3926 | /* Null-terminate the copy. */ | |
3927 | ||
3928 | *cp = 0; | |
3929 | } else | |
3930 | cp = bp; | |
3931 | ||
3932 | ip->bufp = resume_p; | |
3933 | ||
3934 | /* Some directives should be written out for cc1 to process, | |
3935 | just as if they were not defined. And sometimes we're copying | |
3936 | definitions through. */ | |
3937 | ||
3938 | if (!no_output && already_output == 0 | |
3939 | && (kt->pass_thru | |
3940 | || (kt->type == T_DEFINE | |
3941 | && (dump_macros == dump_names | |
3942 | || dump_macros == dump_definitions)))) { | |
3943 | int len; | |
3944 | ||
3945 | /* Output directive name. */ | |
3946 | check_expand (op, kt->length + 1); | |
3947 | *op->bufp++ = '#'; | |
4c9a05bc | 3948 | bcopy (kt->name, (char *) op->bufp, kt->length); |
b0bbbd85 RS |
3949 | op->bufp += kt->length; |
3950 | ||
3951 | if (kt->pass_thru || dump_macros == dump_definitions) { | |
3952 | /* Output arguments. */ | |
3953 | len = (cp - buf); | |
3954 | check_expand (op, len); | |
4c9a05bc | 3955 | bcopy (buf, (char *) op->bufp, len); |
b0bbbd85 | 3956 | op->bufp += len; |
448251cf RS |
3957 | } else if (kt->type == T_DEFINE && dump_macros == dump_names) { |
3958 | U_CHAR *xp = buf; | |
3959 | U_CHAR *yp; | |
3960 | SKIP_WHITE_SPACE (xp); | |
3961 | yp = xp; | |
3962 | while (is_idchar[*xp]) xp++; | |
3963 | len = (xp - yp); | |
3964 | check_expand (op, len + 1); | |
3965 | *op->bufp++ = ' '; | |
3966 | bcopy (yp, op->bufp, len); | |
3967 | op->bufp += len; | |
b0bbbd85 RS |
3968 | } |
3969 | } /* Don't we need a newline or #line? */ | |
3970 | ||
adcfa681 | 3971 | /* Call the appropriate directive handler. buf now points to |
b0bbbd85 RS |
3972 | either the appropriate place in the input buffer, or to |
3973 | the temp buffer if it was necessary to make one. cp | |
3974 | points to the first char after the contents of the (possibly | |
0f41302f | 3975 | copied) directive, in either case. */ |
b0bbbd85 RS |
3976 | (*kt->func) (buf, cp, op, kt); |
3977 | check_expand (op, ip->length - (ip->bufp - ip->buf)); | |
3978 | ||
3979 | return 1; | |
3980 | } | |
3981 | } | |
3982 | ||
3983 | /* It is deliberate that we don't warn about undefined directives. | |
3984 | That is the responsibility of cc1. */ | |
3985 | return 0; | |
3986 | } | |
3987 | \f | |
bfa30b22 RK |
3988 | static struct tm * |
3989 | timestamp () | |
3990 | { | |
3991 | static struct tm *timebuf; | |
3992 | if (!timebuf) { | |
0f41302f | 3993 | time_t t = time ((time_t *) 0); |
bfa30b22 RK |
3994 | timebuf = localtime (&t); |
3995 | } | |
3996 | return timebuf; | |
3997 | } | |
3998 | ||
b0bbbd85 RS |
3999 | static char *monthnames[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun", |
4000 | "Jul", "Aug", "Sep", "Oct", "Nov", "Dec", | |
4001 | }; | |
4002 | ||
4003 | /* | |
4004 | * expand things like __FILE__. Place the expansion into the output | |
4005 | * buffer *without* rescanning. | |
4006 | */ | |
4007 | ||
4008 | static void | |
4009 | special_symbol (hp, op) | |
4010 | HASHNODE *hp; | |
4011 | FILE_BUF *op; | |
4012 | { | |
4013 | char *buf; | |
4014 | int i, len; | |
4015 | int true_indepth; | |
4016 | FILE_BUF *ip = NULL; | |
bfa30b22 | 4017 | struct tm *timebuf; |
b0bbbd85 RS |
4018 | |
4019 | int paren = 0; /* For special `defined' keyword */ | |
4020 | ||
4021 | if (pcp_outfile && pcp_inside_if | |
4022 | && hp->type != T_SPEC_DEFINED && hp->type != T_CONST) | |
4023 | error ("Predefined macro `%s' used inside `#if' during precompilation", | |
4024 | hp->name); | |
4025 | ||
4026 | for (i = indepth; i >= 0; i--) | |
4027 | if (instack[i].fname != NULL) { | |
4028 | ip = &instack[i]; | |
4029 | break; | |
4030 | } | |
4031 | if (ip == NULL) { | |
4032 | error ("cccp error: not in any file?!"); | |
4033 | return; /* the show must go on */ | |
4034 | } | |
4035 | ||
4036 | switch (hp->type) { | |
4037 | case T_FILE: | |
4038 | case T_BASE_FILE: | |
4039 | { | |
4040 | char *string; | |
4041 | if (hp->type == T_FILE) | |
4042 | string = ip->nominal_fname; | |
4043 | else | |
4044 | string = instack[0].nominal_fname; | |
4045 | ||
4046 | if (string) | |
4047 | { | |
f7531123 | 4048 | buf = (char *) alloca (3 + 4 * strlen (string)); |
bb2f42b1 | 4049 | quote_string (buf, string); |
b0bbbd85 RS |
4050 | } |
4051 | else | |
4052 | buf = "\"\""; | |
4053 | ||
4054 | break; | |
4055 | } | |
4056 | ||
4057 | case T_INCLUDE_LEVEL: | |
4058 | true_indepth = 0; | |
4059 | for (i = indepth; i >= 0; i--) | |
4060 | if (instack[i].fname != NULL) | |
4061 | true_indepth++; | |
4062 | ||
4063 | buf = (char *) alloca (8); /* Eight bytes ought to be more than enough */ | |
4064 | sprintf (buf, "%d", true_indepth - 1); | |
4065 | break; | |
4066 | ||
4067 | case T_VERSION: | |
4068 | buf = (char *) alloca (3 + strlen (version_string)); | |
4069 | sprintf (buf, "\"%s\"", version_string); | |
4070 | break; | |
4071 | ||
9e7270cd | 4072 | #ifndef NO_BUILTIN_SIZE_TYPE |
b0bbbd85 | 4073 | case T_SIZE_TYPE: |
767d412c | 4074 | buf = SIZE_TYPE; |
b0bbbd85 | 4075 | break; |
9e7270cd | 4076 | #endif |
b0bbbd85 | 4077 | |
9e7270cd | 4078 | #ifndef NO_BUILTIN_PTRDIFF_TYPE |
b0bbbd85 | 4079 | case T_PTRDIFF_TYPE: |
767d412c | 4080 | buf = PTRDIFF_TYPE; |
b0bbbd85 | 4081 | break; |
9e7270cd | 4082 | #endif |
b0bbbd85 RS |
4083 | |
4084 | case T_WCHAR_TYPE: | |
767d412c | 4085 | buf = wchar_type; |
b0bbbd85 RS |
4086 | break; |
4087 | ||
0df69870 | 4088 | case T_USER_LABEL_PREFIX_TYPE: |
767d412c | 4089 | buf = USER_LABEL_PREFIX; |
0df69870 ILT |
4090 | break; |
4091 | ||
4092 | case T_REGISTER_PREFIX_TYPE: | |
767d412c | 4093 | buf = REGISTER_PREFIX; |
0df69870 ILT |
4094 | break; |
4095 | ||
a9ce110c KR |
4096 | case T_IMMEDIATE_PREFIX_TYPE: |
4097 | buf = IMMEDIATE_PREFIX; | |
4098 | break; | |
4099 | ||
b0bbbd85 | 4100 | case T_CONST: |
91dbf5e7 | 4101 | buf = hp->value.cpval; |
b0bbbd85 RS |
4102 | if (pcp_inside_if && pcp_outfile) |
4103 | /* Output a precondition for this macro use */ | |
91dbf5e7 | 4104 | fprintf (pcp_outfile, "#define %s %s\n", hp->name, buf); |
b0bbbd85 RS |
4105 | break; |
4106 | ||
4107 | case T_SPECLINE: | |
4108 | buf = (char *) alloca (10); | |
4109 | sprintf (buf, "%d", ip->lineno); | |
4110 | break; | |
4111 | ||
4112 | case T_DATE: | |
4113 | case T_TIME: | |
4114 | buf = (char *) alloca (20); | |
bfa30b22 | 4115 | timebuf = timestamp (); |
b0bbbd85 RS |
4116 | if (hp->type == T_DATE) |
4117 | sprintf (buf, "\"%s %2d %4d\"", monthnames[timebuf->tm_mon], | |
4118 | timebuf->tm_mday, timebuf->tm_year + 1900); | |
4119 | else | |
4120 | sprintf (buf, "\"%02d:%02d:%02d\"", timebuf->tm_hour, timebuf->tm_min, | |
4121 | timebuf->tm_sec); | |
4122 | break; | |
4123 | ||
4124 | case T_SPEC_DEFINED: | |
4125 | buf = " 0 "; /* Assume symbol is not defined */ | |
4126 | ip = &instack[indepth]; | |
4127 | SKIP_WHITE_SPACE (ip->bufp); | |
4128 | if (*ip->bufp == '(') { | |
4129 | paren++; | |
4130 | ip->bufp++; /* Skip over the paren */ | |
4131 | SKIP_WHITE_SPACE (ip->bufp); | |
4132 | } | |
4133 | ||
4134 | if (!is_idstart[*ip->bufp]) | |
4135 | goto oops; | |
25cbb59e | 4136 | if ((hp = lookup (ip->bufp, -1, -1))) { |
b0bbbd85 | 4137 | if (pcp_outfile && pcp_inside_if |
4f845465 RK |
4138 | && (hp->type == T_CONST |
4139 | || (hp->type == T_MACRO && hp->value.defn->predefined))) | |
0f41302f | 4140 | /* Output a precondition for this macro use. */ |
b0bbbd85 RS |
4141 | fprintf (pcp_outfile, "#define %s\n", hp->name); |
4142 | buf = " 1 "; | |
4143 | } | |
4144 | else | |
4145 | if (pcp_outfile && pcp_inside_if) { | |
4146 | /* Output a precondition for this macro use */ | |
4147 | U_CHAR *cp = ip->bufp; | |
4148 | fprintf (pcp_outfile, "#undef "); | |
4149 | while (is_idchar[*cp]) /* Ick! */ | |
4150 | fputc (*cp++, pcp_outfile); | |
4151 | putc ('\n', pcp_outfile); | |
4152 | } | |
4153 | while (is_idchar[*ip->bufp]) | |
4154 | ++ip->bufp; | |
4155 | SKIP_WHITE_SPACE (ip->bufp); | |
4156 | if (paren) { | |
4157 | if (*ip->bufp != ')') | |
4158 | goto oops; | |
4159 | ++ip->bufp; | |
4160 | } | |
4161 | break; | |
4162 | ||
4163 | oops: | |
4164 | ||
4165 | error ("`defined' without an identifier"); | |
4166 | break; | |
4167 | ||
4168 | default: | |
4169 | error ("cccp error: invalid special hash type"); /* time for gdb */ | |
4170 | abort (); | |
4171 | } | |
4172 | len = strlen (buf); | |
4173 | check_expand (op, len); | |
4c9a05bc | 4174 | bcopy (buf, (char *) op->bufp, len); |
b0bbbd85 RS |
4175 | op->bufp += len; |
4176 | ||
4177 | return; | |
4178 | } | |
4179 | ||
4180 | \f | |
4181 | /* Routines to handle #directives */ | |
4182 | ||
4183 | /* Handle #include and #import. | |
4184 | This function expects to see "fname" or <fname> on the input. */ | |
4185 | ||
4186 | static int | |
4187 | do_include (buf, limit, op, keyword) | |
4188 | U_CHAR *buf, *limit; | |
4189 | FILE_BUF *op; | |
4190 | struct directive *keyword; | |
4191 | { | |
3e4115b7 | 4192 | U_CHAR *importing = keyword->type == T_IMPORT ? (U_CHAR *) "" : (U_CHAR *) 0; |
b0bbbd85 RS |
4193 | int skip_dirs = (keyword->type == T_INCLUDE_NEXT); |
4194 | static int import_warning = 0; | |
4195 | char *fname; /* Dynamically allocated fname buffer */ | |
4196 | char *pcftry; | |
4197 | char *pcfname; | |
3e4115b7 RK |
4198 | char *fbeg, *fend; /* Beginning and end of fname */ |
4199 | U_CHAR *fin; | |
b0bbbd85 RS |
4200 | |
4201 | struct file_name_list *search_start = include; /* Chain of dirs to search */ | |
3e4115b7 | 4202 | struct file_name_list *dsp; /* First in chain, if #include "..." */ |
00ae06b5 | 4203 | struct file_name_list *searchptr = 0; |
aa6b6385 | 4204 | size_t flen; |
b0bbbd85 | 4205 | |
3e4115b7 RK |
4206 | int f = -3; /* file number */ |
4207 | struct include_file *inc = 0; | |
b0bbbd85 RS |
4208 | |
4209 | int retried = 0; /* Have already tried macro | |
4210 | expanding the include line*/ | |
1faf9603 | 4211 | int angle_brackets = 0; /* 0 for "...", 1 for <...> */ |
b0bbbd85 RS |
4212 | int pcf = -1; |
4213 | char *pcfbuf; | |
720e51b7 | 4214 | char *pcfbuflimit; |
b0bbbd85 | 4215 | int pcfnum; |
b0bbbd85 | 4216 | |
1faf9603 | 4217 | if (importing && warn_import && !inhibit_warnings |
2aa7ec37 | 4218 | && !instack[indepth].system_header_p && !import_warning) { |
b0bbbd85 RS |
4219 | import_warning = 1; |
4220 | warning ("using `#import' is not recommended"); | |
4221 | fprintf (stderr, "The fact that a certain header file need not be processed more than once\n"); | |
4222 | fprintf (stderr, "should be indicated in the header file, not where it is used.\n"); | |
4223 | fprintf (stderr, "The best way to do this is with a conditional of this form:\n\n"); | |
4224 | fprintf (stderr, " #ifndef _FOO_H_INCLUDED\n"); | |
4225 | fprintf (stderr, " #define _FOO_H_INCLUDED\n"); | |
4226 | fprintf (stderr, " ... <real contents of file> ...\n"); | |
4227 | fprintf (stderr, " #endif /* Not _FOO_H_INCLUDED */\n\n"); | |
4228 | fprintf (stderr, "Then users can use `#include' any number of times.\n"); | |
4229 | fprintf (stderr, "GNU C automatically avoids processing the file more than once\n"); | |
4230 | fprintf (stderr, "when it is equipped with such a conditional.\n"); | |
4231 | } | |
4232 | ||
4233 | get_filename: | |
4234 | ||
3e4115b7 RK |
4235 | fin = buf; |
4236 | SKIP_WHITE_SPACE (fin); | |
b0bbbd85 RS |
4237 | /* Discard trailing whitespace so we can easily see |
4238 | if we have parsed all the significant chars we were given. */ | |
3e4115b7 RK |
4239 | while (limit != fin && is_hor_space[limit[-1]]) limit--; |
4240 | fbeg = fend = (char *) alloca (limit - fin); | |
b0bbbd85 | 4241 | |
3e4115b7 | 4242 | switch (*fin++) { |
b0bbbd85 | 4243 | case '\"': |
b1af4777 | 4244 | { |
b0bbbd85 | 4245 | FILE_BUF *fp; |
b1af4777 RS |
4246 | /* Copy the operand text, concatenating the strings. */ |
4247 | { | |
b1af4777 RS |
4248 | while (fin != limit) { |
4249 | while (fin != limit && *fin != '\"') | |
4250 | *fend++ = *fin++; | |
4251 | fin++; | |
4252 | if (fin == limit) | |
4253 | break; | |
4254 | /* If not at the end, there had better be another string. */ | |
4255 | /* Skip just horiz space, and don't go past limit. */ | |
4256 | while (fin != limit && is_hor_space[*fin]) fin++; | |
4257 | if (fin != limit && *fin == '\"') | |
4258 | fin++; | |
4259 | else | |
4260 | goto fail; | |
4261 | } | |
4262 | } | |
b0bbbd85 RS |
4263 | |
4264 | /* We have "filename". Figure out directory this source | |
0f41302f | 4265 | file is coming from and put it on the front of the list. */ |
b0bbbd85 | 4266 | |
0f41302f | 4267 | /* If -I- was specified, don't search current dir, only spec'd ones. */ |
b0bbbd85 RS |
4268 | if (ignore_srcdir) break; |
4269 | ||
4270 | for (fp = &instack[indepth]; fp >= instack; fp--) | |
4271 | { | |
4272 | int n; | |
3e4115b7 | 4273 | char *nam; |
b0bbbd85 RS |
4274 | |
4275 | if ((nam = fp->nominal_fname) != NULL) { | |
4276 | /* Found a named file. Figure out dir of the file, | |
4277 | and put it in front of the search list. */ | |
3e4115b7 RK |
4278 | dsp = ((struct file_name_list *) |
4279 | alloca (sizeof (struct file_name_list) + strlen (nam))); | |
4280 | strcpy (dsp->fname, nam); | |
4281 | simplify_filename (dsp->fname); | |
4282 | nam = base_name (dsp->fname); | |
4283 | *nam = 0; | |
4284 | /* But for efficiency's sake, do not insert the dir | |
4285 | if it matches the search list's first dir. */ | |
4286 | dsp->next = search_start; | |
4287 | if (!search_start || strcmp (dsp->fname, search_start->fname)) { | |
4288 | search_start = dsp; | |
4289 | n = nam - dsp->fname; | |
6489924b RS |
4290 | if (n + INCLUDE_LEN_FUDGE > max_include_len) |
4291 | max_include_len = n + INCLUDE_LEN_FUDGE; | |
b0bbbd85 | 4292 | } |
6e7f952e | 4293 | dsp[0].got_name_map = 0; |
b0bbbd85 RS |
4294 | break; |
4295 | } | |
4296 | } | |
4297 | break; | |
4298 | } | |
b0bbbd85 RS |
4299 | |
4300 | case '<': | |
3e4115b7 RK |
4301 | while (fin != limit && *fin != '>') |
4302 | *fend++ = *fin++; | |
4303 | if (*fin == '>' && fin + 1 == limit) { | |
1faf9603 | 4304 | angle_brackets = 1; |
b0bbbd85 | 4305 | /* If -I-, start with the first -I dir after the -I-. */ |
3e4115b7 | 4306 | search_start = first_bracket_include; |
b0bbbd85 RS |
4307 | break; |
4308 | } | |
4309 | goto fail; | |
4310 | ||
4311 | default: | |
fe701b40 RK |
4312 | #ifdef VMS |
4313 | /* | |
4314 | * Support '#include xyz' like VAX-C to allow for easy use of all the | |
4315 | * decwindow include files. It defaults to '#include <xyz.h>' (so the | |
4316 | * code from case '<' is repeated here) and generates a warning. | |
71efde97 | 4317 | * (Note: macro expansion of `xyz' takes precedence.) |
fe701b40 | 4318 | */ |
0f41302f | 4319 | if (retried && isalpha(*(U_CHAR *) (--fbeg))) { |
3e4115b7 RK |
4320 | while (fin != limit && (!isspace(*fin))) |
4321 | *fend++ = *fin++; | |
fe701b40 | 4322 | warning ("VAX-C-style include specification found, use '#include <filename.h>' !"); |
3e4115b7 | 4323 | if (fin == limit) { |
fe701b40 RK |
4324 | angle_brackets = 1; |
4325 | /* If -I-, start with the first -I dir after the -I-. */ | |
3e4115b7 | 4326 | search_start = first_bracket_include; |
fe701b40 RK |
4327 | break; |
4328 | } | |
4329 | } | |
4330 | #endif | |
4331 | ||
b0bbbd85 RS |
4332 | fail: |
4333 | if (retried) { | |
50f15104 RS |
4334 | error ("`#%s' expects \"FILENAME\" or <FILENAME>", keyword->name); |
4335 | return 0; | |
b0bbbd85 | 4336 | } else { |
53afc256 RK |
4337 | /* Expand buffer and then remove any newline markers. |
4338 | We can't just tell expand_to_temp_buffer to omit the markers, | |
4339 | since it would put extra spaces in include file names. */ | |
9dff2028 RK |
4340 | FILE_BUF trybuf; |
4341 | U_CHAR *src; | |
4342 | trybuf = expand_to_temp_buffer (buf, limit, 1, 0); | |
4343 | src = trybuf.buf; | |
b0bbbd85 | 4344 | buf = (U_CHAR *) alloca (trybuf.bufp - trybuf.buf + 1); |
53afc256 RK |
4345 | limit = buf; |
4346 | while (src != trybuf.bufp) { | |
4347 | switch ((*limit++ = *src++)) { | |
4348 | case '\n': | |
4349 | limit--; | |
4350 | src++; | |
4351 | break; | |
4352 | ||
4353 | case '\'': | |
4354 | case '\"': | |
4355 | { | |
4356 | U_CHAR *src1 = skip_quoted_string (src - 1, trybuf.bufp, 0, | |
4357 | NULL_PTR, NULL_PTR, NULL_PTR); | |
4358 | while (src != src1) | |
4359 | *limit++ = *src++; | |
4360 | } | |
4361 | break; | |
4362 | } | |
4363 | } | |
4364 | *limit = 0; | |
b0bbbd85 RS |
4365 | free (trybuf.buf); |
4366 | retried++; | |
4367 | goto get_filename; | |
4368 | } | |
4369 | } | |
4370 | ||
4371 | /* For #include_next, skip in the search path | |
4372 | past the dir in which the containing file was found. */ | |
4373 | if (skip_dirs) { | |
4374 | FILE_BUF *fp; | |
4375 | for (fp = &instack[indepth]; fp >= instack; fp--) | |
4376 | if (fp->fname != NULL) { | |
4377 | /* fp->dir is null if the containing file was specified | |
4378 | with an absolute file name. In that case, don't skip anything. */ | |
4379 | if (fp->dir) | |
4380 | search_start = fp->dir->next; | |
4381 | break; | |
4382 | } | |
4383 | } | |
4384 | ||
3e4115b7 RK |
4385 | *fend = 0; |
4386 | flen = simplify_filename (fbeg); | |
33b039cc RS |
4387 | |
4388 | if (flen == 0) | |
4389 | { | |
50f15104 | 4390 | error ("empty file name in `#%s'", keyword->name); |
33b039cc RS |
4391 | return 0; |
4392 | } | |
4393 | ||
b0bbbd85 RS |
4394 | /* Allocate this permanently, because it gets stored in the definitions |
4395 | of macros. */ | |
3e4115b7 RK |
4396 | fname = xmalloc (max_include_len + flen + 1); |
4397 | /* + 1 above for terminating null. */ | |
4398 | ||
4399 | system_include_depth += angle_brackets; | |
b0bbbd85 | 4400 | |
b0bbbd85 RS |
4401 | /* If specified file name is absolute, just open it. */ |
4402 | ||
3e4115b7 RK |
4403 | if (absolute_filename (fbeg)) { |
4404 | strcpy (fname, fbeg); | |
4405 | f = open_include_file (fname, NULL_PTR, importing, &inc); | |
b0bbbd85 | 4406 | } else { |
3e4115b7 RK |
4407 | |
4408 | struct bypass_dir { | |
4409 | struct bypass_dir *next; | |
4410 | char *fname; | |
4411 | struct file_name_list *searchptr; | |
4412 | } **bypass_slot = 0; | |
4413 | ||
b0bbbd85 RS |
4414 | /* Search directory path, trying to open the file. |
4415 | Copy each filename tried into FNAME. */ | |
4416 | ||
4417 | for (searchptr = search_start; searchptr; searchptr = searchptr->next) { | |
3e4115b7 RK |
4418 | |
4419 | if (searchptr == first_bracket_include) { | |
4420 | /* Go to bypass directory if we know we've seen this file before. */ | |
4421 | static struct bypass_dir *bypass_hashtab[INCLUDE_HASHSIZE]; | |
4422 | struct bypass_dir *p; | |
4423 | bypass_slot = &bypass_hashtab[hashf ((U_CHAR *) fbeg, flen, | |
4424 | INCLUDE_HASHSIZE)]; | |
4425 | for (p = *bypass_slot; p; p = p->next) | |
4426 | if (!strcmp (fbeg, p->fname)) { | |
4427 | searchptr = p->searchptr; | |
4428 | bypass_slot = 0; | |
4429 | break; | |
4430 | } | |
b0bbbd85 | 4431 | } |
3e4115b7 RK |
4432 | |
4433 | strcpy (fname, searchptr->fname); | |
4434 | strcat (fname, fbeg); | |
b0bbbd85 RS |
4435 | #ifdef VMS |
4436 | /* Change this 1/2 Unix 1/2 VMS file specification into a | |
4437 | full VMS file specification */ | |
3e4115b7 | 4438 | if (searchptr->fname[0]) { |
b0bbbd85 RS |
4439 | /* Fix up the filename */ |
4440 | hack_vms_include_specification (fname); | |
4441 | } else { | |
4442 | /* This is a normal VMS filespec, so use it unchanged. */ | |
3e4115b7 | 4443 | strcpy (fname, fbeg); |
fe701b40 RK |
4444 | /* if it's '#include filename', add the missing .h */ |
4445 | if (index(fname,'.')==NULL) { | |
4446 | strcat (fname, ".h"); | |
4447 | } | |
b0bbbd85 RS |
4448 | } |
4449 | #endif /* VMS */ | |
3e4115b7 RK |
4450 | f = open_include_file (fname, searchptr, importing, &inc); |
4451 | if (f != -1) { | |
4452 | if (bypass_slot && searchptr != first_bracket_include) { | |
4453 | /* This is the first time we found this include file, | |
4454 | and we found it after first_bracket_include. | |
4455 | Record its location so that we can bypass to here next time. */ | |
4456 | struct bypass_dir *p | |
4457 | = (struct bypass_dir *) xmalloc (sizeof (struct bypass_dir)); | |
4458 | p->next = *bypass_slot; | |
4459 | p->fname = fname + strlen (searchptr->fname); | |
4460 | p->searchptr = searchptr; | |
4461 | *bypass_slot = p; | |
4462 | } | |
4463 | break; | |
4464 | } | |
9fb1a98e RK |
4465 | #ifdef VMS |
4466 | /* Our VMS hacks can produce invalid filespecs, so don't worry | |
4467 | about errors other than EACCES. */ | |
4468 | if (errno == EACCES) | |
4469 | break; | |
4470 | #else | |
3e4115b7 | 4471 | if (errno != ENOENT) |
b0bbbd85 | 4472 | break; |
9fb1a98e | 4473 | #endif |
b0bbbd85 RS |
4474 | } |
4475 | } | |
4476 | ||
3e4115b7 | 4477 | |
b0bbbd85 | 4478 | if (f < 0) { |
b0bbbd85 | 4479 | |
3e4115b7 RK |
4480 | if (f == -2) { |
4481 | /* The file was already included. */ | |
4482 | ||
86739c7b DE |
4483 | /* If generating dependencies and -MG was specified, we assume missing |
4484 | files are leaf files, living in the same directory as the source file | |
4485 | or other similar place; these missing files may be generated from | |
4486 | other files and may not exist yet (eg: y.tab.h). */ | |
3e4115b7 RK |
4487 | } else if (print_deps_missing_files |
4488 | && (system_include_depth != 0) < print_deps) | |
86739c7b | 4489 | { |
86739c7b DE |
4490 | /* If it was requested as a system header file, |
4491 | then assume it belongs in the first place to look for such. */ | |
4492 | if (angle_brackets) | |
4493 | { | |
3e4115b7 RK |
4494 | if (search_start) { |
4495 | char *p = (char *) alloca (strlen (search_start->fname) | |
4496 | + strlen (fbeg) + 1); | |
4497 | strcpy (p, search_start->fname); | |
4498 | strcat (p, fbeg); | |
4499 | deps_output (p, ' '); | |
4500 | } | |
86739c7b DE |
4501 | } |
4502 | else | |
4503 | { | |
4504 | /* Otherwise, omit the directory, as if the file existed | |
4505 | in the directory with the source. */ | |
3e4115b7 | 4506 | deps_output (fbeg, ' '); |
86739c7b DE |
4507 | } |
4508 | } | |
a94d16c6 JW |
4509 | /* If -M was specified, and this header file won't be added to the |
4510 | dependency list, then don't count this as an error, because we can | |
4511 | still produce correct output. Otherwise, we can't produce correct | |
4512 | output, because there may be dependencies we need inside the missing | |
4513 | file, and we don't know what directory this missing file exists in. */ | |
3e4115b7 RK |
4514 | else if (0 < print_deps && print_deps <= (system_include_depth != 0)) |
4515 | warning ("No include path in which to find %s", fbeg); | |
4516 | else if (f != -3) | |
4517 | error_from_errno (fbeg); | |
68a8ca25 | 4518 | else |
3e4115b7 | 4519 | error ("No include path in which to find %s", fbeg); |
b0bbbd85 | 4520 | |
3e4115b7 | 4521 | } else { |
b0bbbd85 RS |
4522 | |
4523 | /* Actually process the file. */ | |
b0bbbd85 RS |
4524 | |
4525 | pcftry = (char *) alloca (strlen (fname) + 30); | |
4526 | pcfbuf = 0; | |
4527 | pcfnum = 0; | |
4528 | ||
b0bbbd85 | 4529 | if (!no_precomp) |
52cf95a7 | 4530 | { |
52cf95a7 DE |
4531 | do { |
4532 | sprintf (pcftry, "%s%d", fname, pcfnum++); | |
4533 | ||
4534 | pcf = open (pcftry, O_RDONLY, 0666); | |
4535 | if (pcf != -1) | |
4536 | { | |
4537 | struct stat s; | |
4538 | ||
3e4115b7 RK |
4539 | if (fstat (pcf, &s) != 0) |
4540 | pfatal_with_name (pcftry); | |
4541 | if (! INO_T_EQ (inc->st.st_ino, s.st_ino) | |
4542 | || inc->st.st_dev != s.st_dev) | |
52cf95a7 | 4543 | { |
3e4115b7 | 4544 | pcfbuf = check_precompiled (pcf, &s, fname, &pcfbuflimit); |
52cf95a7 DE |
4545 | /* Don't need it any more. */ |
4546 | close (pcf); | |
4547 | } | |
4548 | else | |
4549 | { | |
4550 | /* Don't need it at all. */ | |
4551 | close (pcf); | |
4552 | break; | |
4553 | } | |
4554 | } | |
4555 | } while (pcf != -1 && !pcfbuf); | |
4556 | } | |
b0bbbd85 RS |
4557 | |
4558 | /* Actually process the file */ | |
4559 | if (pcfbuf) { | |
4560 | pcfname = xmalloc (strlen (pcftry) + 1); | |
4561 | strcpy (pcfname, pcftry); | |
25cbb59e RK |
4562 | pcfinclude ((U_CHAR *) pcfbuf, (U_CHAR *) pcfbuflimit, |
4563 | (U_CHAR *) fname, op); | |
b0bbbd85 RS |
4564 | } |
4565 | else | |
3e4115b7 | 4566 | finclude (f, inc, op, is_system_include (fname), searchptr); |
b0bbbd85 | 4567 | } |
b0bbbd85 | 4568 | |
3e4115b7 | 4569 | system_include_depth -= angle_brackets; |
3ed8294e | 4570 | |
3ed8294e RS |
4571 | return 0; |
4572 | } | |
4573 | ||
1faf9603 RS |
4574 | /* Return nonzero if the given FILENAME is an absolute pathname which |
4575 | designates a file within one of the known "system" include file | |
4576 | directories. We assume here that if the given FILENAME looks like | |
4577 | it is the name of a file which resides either directly in a "system" | |
4578 | include file directory, or within any subdirectory thereof, then the | |
4579 | given file must be a "system" include file. This function tells us | |
0031ac57 RS |
4580 | if we should suppress pedantic errors/warnings for the given FILENAME. |
4581 | ||
4582 | The value is 2 if the file is a C-language system header file | |
4583 | for which C++ should (on most systems) assume `extern "C"'. */ | |
1faf9603 RS |
4584 | |
4585 | static int | |
4586 | is_system_include (filename) | |
4587 | register char *filename; | |
4588 | { | |
4589 | struct file_name_list *searchptr; | |
4590 | ||
6489924b | 4591 | for (searchptr = first_system_include; searchptr; |
1faf9603 | 4592 | searchptr = searchptr->next) |
3e4115b7 RK |
4593 | if (! strncmp (searchptr->fname, filename, strlen (searchptr->fname))) |
4594 | return searchptr->c_system_include_path + 1; | |
4595 | return 0; | |
4596 | } | |
4597 | \f | |
4598 | /* Yield the non-directory suffix of a file name. */ | |
1faf9603 | 4599 | |
3e4115b7 RK |
4600 | static char * |
4601 | base_name (fname) | |
4602 | char *fname; | |
4603 | { | |
4604 | char *s = fname; | |
4605 | char *p; | |
4606 | #if defined (__MSDOS__) || defined (_WIN32) | |
4607 | if (isalpha (s[0]) && s[1] == ':') s += 2; | |
4608 | #endif | |
4609 | #ifdef VMS | |
4610 | if ((p = rindex (s, ':'))) s = p + 1; /* Skip device. */ | |
4611 | if ((p = rindex (s, ']'))) s = p + 1; /* Skip directory. */ | |
4612 | if ((p = rindex (s, '>'))) s = p + 1; /* Skip alternate (int'n'l) dir. */ | |
4613 | if (s != fname) | |
4614 | return s; | |
4615 | #endif | |
4616 | if ((p = rindex (s, '/'))) s = p + 1; | |
40ddf499 | 4617 | #ifdef DIR_SEPARATOR |
3e4115b7 RK |
4618 | if ((p = rindex (s, DIR_SEPARATOR))) s = p + 1; |
4619 | #endif | |
4620 | return s; | |
4621 | } | |
4622 | ||
4623 | /* Yield nonzero if FILENAME is absolute (i.e. not relative). */ | |
0f41302f | 4624 | |
3e4115b7 RK |
4625 | static int |
4626 | absolute_filename (filename) | |
4627 | char *filename; | |
4628 | { | |
4629 | #if defined (__MSDOS__) || defined (_WIN32) | |
4630 | if (isalpha (filename[0]) && filename[1] == ':') filename += 2; | |
4631 | #endif | |
4632 | if (filename[0] == '/') return 1; | |
4633 | #ifdef DIR_SEPARATOR | |
4634 | if (filename[0] == DIR_SEPARATOR) return 1; | |
40ddf499 | 4635 | #endif |
1faf9603 RS |
4636 | return 0; |
4637 | } | |
aa6b6385 | 4638 | |
3e4115b7 RK |
4639 | /* Remove unnecessary characters from FILENAME in place, |
4640 | to avoid unnecessary filename aliasing. | |
4641 | Return the length of the resulting string. | |
4642 | ||
4643 | Do only the simplifications allowed by Posix. | |
4644 | It is OK to miss simplifications on non-Posix hosts, | |
4645 | since this merely leads to suboptimial results. */ | |
4646 | ||
4647 | static size_t | |
4648 | simplify_filename (filename) | |
4649 | char *filename; | |
aa6b6385 | 4650 | { |
3e4115b7 RK |
4651 | register char *from = filename; |
4652 | register char *to = filename; | |
4653 | char *to0; | |
4654 | ||
4655 | /* Remove redundant initial /s. */ | |
4656 | if (*from == '/') { | |
4657 | *to++ = '/'; | |
4658 | if (*++from == '/') { | |
4659 | if (*++from == '/') { | |
4660 | /* 3 or more initial /s are equivalent to 1 /. */ | |
4661 | while (*++from == '/') | |
4662 | continue; | |
4663 | } else { | |
4664 | /* On some hosts // differs from /; Posix allows this. */ | |
4665 | static int slashslash_vs_slash; | |
4666 | if (slashslash_vs_slash == 0) { | |
4667 | struct stat s1, s2; | |
4668 | slashslash_vs_slash = ((stat ("/", &s1) == 0 && stat ("//", &s2) == 0 | |
4669 | && INO_T_EQ (s1.st_ino, s2.st_ino) | |
4670 | && s1.st_dev == s2.st_dev) | |
4671 | ? 1 : -1); | |
4672 | } | |
4673 | if (slashslash_vs_slash < 0) | |
4674 | *to++ = '/'; | |
4675 | } | |
4676 | } | |
4677 | } | |
4678 | to0 = to; | |
4679 | ||
4680 | for (;;) { | |
4681 | if (from[0] == '.' && from[1] == '/') | |
4682 | from += 2; | |
4683 | else { | |
4684 | /* Copy this component and trailing /, if any. */ | |
4685 | while ((*to++ = *from++) != '/') { | |
4686 | if (!to[-1]) { | |
4687 | /* Trim . component at end of nonempty name. */ | |
4688 | to -= filename <= to - 3 && to[-3] == '/' && to[-2] == '.'; | |
4689 | ||
4690 | /* Trim unnecessary trailing /s. */ | |
4691 | while (to0 < --to && to[-1] == '/') | |
4692 | continue; | |
4693 | ||
4694 | *to = 0; | |
4695 | return to - filename; | |
4696 | } | |
4697 | } | |
4698 | } | |
4699 | ||
4700 | /* Skip /s after a /. */ | |
4701 | while (*from == '/') | |
4702 | from++; | |
4703 | } | |
aa6b6385 RK |
4704 | } |
4705 | \f | |
6e7f952e JW |
4706 | /* The file_name_map structure holds a mapping of file names for a |
4707 | particular directory. This mapping is read from the file named | |
4708 | FILE_NAME_MAP_FILE in that directory. Such a file can be used to | |
4709 | map filenames on a file system with severe filename restrictions, | |
4710 | such as DOS. The format of the file name map file is just a series | |
4711 | of lines with two tokens on each line. The first token is the name | |
4712 | to map, and the second token is the actual name to use. */ | |
4713 | ||
4714 | struct file_name_map | |
4715 | { | |
4716 | struct file_name_map *map_next; | |
4717 | char *map_from; | |
4718 | char *map_to; | |
4719 | }; | |
4720 | ||
4721 | #define FILE_NAME_MAP_FILE "header.gcc" | |
4722 | ||
4723 | /* Read a space delimited string of unlimited length from a stdio | |
4724 | file. */ | |
4725 | ||
4726 | static char * | |
4727 | read_filename_string (ch, f) | |
4728 | int ch; | |
4729 | FILE *f; | |
4730 | { | |
4731 | char *alloc, *set; | |
4732 | int len; | |
4733 | ||
4734 | len = 20; | |
4735 | set = alloc = xmalloc (len + 1); | |
4736 | if (! is_space[ch]) | |
4737 | { | |
4738 | *set++ = ch; | |
4739 | while ((ch = getc (f)) != EOF && ! is_space[ch]) | |
4740 | { | |
4741 | if (set - alloc == len) | |
4742 | { | |
4743 | len *= 2; | |
4744 | alloc = xrealloc (alloc, len + 1); | |
4745 | set = alloc + len / 2; | |
4746 | } | |
4747 | *set++ = ch; | |
4748 | } | |
4749 | } | |
4750 | *set = '\0'; | |
4751 | ungetc (ch, f); | |
4752 | return alloc; | |
4753 | } | |
4754 | ||
3e4115b7 RK |
4755 | /* Read the file name map file for DIRNAME. |
4756 | If DIRNAME is empty, read the map file for the working directory; | |
4757 | otherwise DIRNAME must end in '/'. */ | |
6e7f952e JW |
4758 | |
4759 | static struct file_name_map * | |
4760 | read_name_map (dirname) | |
4761 | char *dirname; | |
4762 | { | |
4763 | /* This structure holds a linked list of file name maps, one per | |
4764 | directory. */ | |
4765 | struct file_name_map_list | |
4766 | { | |
4767 | struct file_name_map_list *map_list_next; | |
4768 | char *map_list_name; | |
4769 | struct file_name_map *map_list_map; | |
4770 | }; | |
4771 | static struct file_name_map_list *map_list; | |
4772 | register struct file_name_map_list *map_list_ptr; | |
4773 | char *name; | |
4774 | FILE *f; | |
aa6b6385 | 4775 | size_t dirlen; |
6e7f952e JW |
4776 | |
4777 | for (map_list_ptr = map_list; map_list_ptr; | |
4778 | map_list_ptr = map_list_ptr->map_list_next) | |
4779 | if (! strcmp (map_list_ptr->map_list_name, dirname)) | |
4780 | return map_list_ptr->map_list_map; | |
4781 | ||
4782 | map_list_ptr = ((struct file_name_map_list *) | |
4783 | xmalloc (sizeof (struct file_name_map_list))); | |
4784 | map_list_ptr->map_list_name = savestring (dirname); | |
4785 | map_list_ptr->map_list_map = NULL; | |
4786 | ||
aa6b6385 | 4787 | dirlen = strlen (dirname); |
3e4115b7 | 4788 | name = (char *) alloca (dirlen + strlen (FILE_NAME_MAP_FILE) + 1); |
6e7f952e | 4789 | strcpy (name, dirname); |
3e4115b7 | 4790 | strcat (name, FILE_NAME_MAP_FILE); |
6e7f952e JW |
4791 | f = fopen (name, "r"); |
4792 | if (!f) | |
4793 | map_list_ptr->map_list_map = NULL; | |
4794 | else | |
4795 | { | |
4796 | int ch; | |
6e7f952e JW |
4797 | |
4798 | while ((ch = getc (f)) != EOF) | |
4799 | { | |
4800 | char *from, *to; | |
4801 | struct file_name_map *ptr; | |
3e4115b7 | 4802 | size_t tolen; |
6e7f952e JW |
4803 | |
4804 | if (is_space[ch]) | |
4805 | continue; | |
4806 | from = read_filename_string (ch, f); | |
4807 | while ((ch = getc (f)) != EOF && is_hor_space[ch]) | |
4808 | ; | |
4809 | to = read_filename_string (ch, f); | |
4810 | ||
3e4115b7 RK |
4811 | simplify_filename (from); |
4812 | tolen = simplify_filename (to); | |
4813 | ||
6e7f952e JW |
4814 | ptr = ((struct file_name_map *) |
4815 | xmalloc (sizeof (struct file_name_map))); | |
4816 | ptr->map_from = from; | |
4817 | ||
4818 | /* Make the real filename absolute. */ | |
3e4115b7 | 4819 | if (absolute_filename (to)) |
6e7f952e JW |
4820 | ptr->map_to = to; |
4821 | else | |
4822 | { | |
3e4115b7 | 4823 | ptr->map_to = xmalloc (dirlen + tolen + 1); |
6e7f952e | 4824 | strcpy (ptr->map_to, dirname); |
3e4115b7 | 4825 | strcat (ptr->map_to, to); |
6e7f952e JW |
4826 | free (to); |
4827 | } | |
4828 | ||
4829 | ptr->map_next = map_list_ptr->map_list_map; | |
4830 | map_list_ptr->map_list_map = ptr; | |
4831 | ||
4832 | while ((ch = getc (f)) != '\n') | |
4833 | if (ch == EOF) | |
4834 | break; | |
4835 | } | |
4836 | fclose (f); | |
4837 | } | |
4838 | ||
4839 | map_list_ptr->map_list_next = map_list; | |
4840 | map_list = map_list_ptr; | |
4841 | ||
4842 | return map_list_ptr->map_list_map; | |
4843 | } | |
4844 | ||
4845 | /* Try to open include file FILENAME. SEARCHPTR is the directory | |
3e4115b7 RK |
4846 | being tried from the include file search path. |
4847 | IMPORTING is "" if we are importing, null otherwise. | |
4848 | Return -2 if found, either a matching name or a matching inode. | |
4849 | Otherwise, open the file and return a file descriptor if successful | |
4850 | or -1 if unsuccessful. | |
4851 | Unless unsuccessful, put a descriptor of the included file into *PINC. | |
4852 | This function maps filenames on file systems based on information read by | |
6e7f952e JW |
4853 | read_name_map. */ |
4854 | ||
4855 | static int | |
3e4115b7 RK |
4856 | open_include_file (filename, searchptr, importing, pinc) |
4857 | char *filename; | |
4858 | struct file_name_list *searchptr; | |
4859 | U_CHAR *importing; | |
4860 | struct include_file **pinc; | |
4861 | { | |
4862 | char *fname = remap_include_file (filename, searchptr); | |
4863 | int fd = -2; | |
4864 | ||
4865 | /* Look up FNAME in include_hashtab. */ | |
4866 | struct include_file **phead = &include_hashtab[hashf ((U_CHAR *) fname, | |
4867 | strlen (fname), | |
4868 | INCLUDE_HASHSIZE)]; | |
4869 | struct include_file *inc, *head = *phead; | |
4870 | for (inc = head; inc; inc = inc->next) | |
4871 | if (!strcmp (fname, inc->fname)) | |
4872 | break; | |
4873 | ||
4874 | if (!inc | |
4875 | || ! inc->control_macro | |
4876 | || (inc->control_macro[0] && ! lookup (inc->control_macro, -1, -1))) { | |
4877 | ||
4878 | fd = open (fname, O_RDONLY, 0); | |
4879 | ||
4880 | if (fd < 0) | |
4881 | return fd; | |
4882 | ||
4883 | if (!inc) { | |
4884 | /* FNAME was not in include_hashtab; insert a new entry. */ | |
4885 | inc = (struct include_file *) xmalloc (sizeof (struct include_file)); | |
4886 | inc->next = head; | |
4887 | inc->fname = fname; | |
4888 | inc->control_macro = 0; | |
4889 | inc->deps_output = 0; | |
4890 | if (fstat (fd, &inc->st) != 0) | |
4891 | pfatal_with_name (fname); | |
4892 | *phead = inc; | |
4893 | ||
4894 | /* Look for another file with the same inode and device. */ | |
4895 | if (lookup_ino_include (inc) | |
4896 | && inc->control_macro | |
4897 | && (!inc->control_macro[0] || lookup (inc->control_macro, -1, -1))) { | |
4898 | close (fd); | |
4899 | fd = -2; | |
4900 | } | |
4901 | } | |
4902 | ||
4903 | /* For -M, add this file to the dependencies. */ | |
4904 | if (! inc->deps_output && (system_include_depth != 0) < print_deps) { | |
4905 | inc->deps_output = 1; | |
4906 | deps_output (fname, ' '); | |
4907 | } | |
4908 | ||
4909 | /* Handle -H option. */ | |
4910 | if (print_include_names) | |
4911 | fprintf (stderr, "%*s%s\n", indepth, "", fname); | |
4912 | } | |
4913 | ||
4914 | if (importing) | |
4915 | inc->control_macro = importing; | |
4916 | ||
4917 | *pinc = inc; | |
4918 | return fd; | |
4919 | } | |
4920 | ||
4921 | /* Return the remapped name of the the include file FILENAME. | |
4922 | SEARCHPTR is the directory being tried from the include file path. */ | |
4923 | ||
4924 | static char * | |
4925 | remap_include_file (filename, searchptr) | |
6e7f952e JW |
4926 | char *filename; |
4927 | struct file_name_list *searchptr; | |
4928 | { | |
4929 | register struct file_name_map *map; | |
4930 | register char *from; | |
6e7f952e | 4931 | |
3e4115b7 | 4932 | if (searchptr) |
6e7f952e | 4933 | { |
3e4115b7 | 4934 | if (! searchptr->got_name_map) |
6e7f952e | 4935 | { |
3e4115b7 RK |
4936 | searchptr->name_map = read_name_map (searchptr->fname); |
4937 | searchptr->got_name_map = 1; | |
6e7f952e | 4938 | } |
6e7f952e | 4939 | |
3e4115b7 RK |
4940 | /* Check the mapping for the directory we are using. */ |
4941 | from = filename + strlen (searchptr->fname); | |
4942 | for (map = searchptr->name_map; map; map = map->map_next) | |
4943 | if (! strcmp (map->map_from, from)) | |
4944 | return map->map_to; | |
6e7f952e JW |
4945 | } |
4946 | ||
3e4115b7 RK |
4947 | from = base_name (filename); |
4948 | ||
4949 | if (from != filename || !searchptr) | |
6e7f952e | 4950 | { |
3e4115b7 RK |
4951 | /* Try to find a mapping file for the particular directory we are |
4952 | looking in. Thus #include <sys/types.h> will look up sys/types.h | |
4953 | in /usr/include/header.gcc and look up types.h in | |
4954 | /usr/include/sys/header.gcc. */ | |
4955 | ||
4956 | char *dir = (char *) alloca (from - filename + 1); | |
4957 | bcopy (filename, dir, from - filename); | |
4958 | dir[from - filename] = '\0'; | |
4959 | ||
4960 | for (map = read_name_map (dir); map; map = map->map_next) | |
4961 | if (! strcmp (map->map_from, from)) | |
4962 | return map->map_to; | |
6e7f952e | 4963 | } |
3e4115b7 RK |
4964 | |
4965 | return filename; | |
4966 | } | |
4967 | ||
4968 | /* Insert INC into the include file table, hashed by device and inode number. | |
4969 | If a file with different name but same dev+ino was already in the table, | |
4970 | return 1 and set INC's control macro to the already-known macro. */ | |
4971 | ||
4972 | static int | |
4973 | lookup_ino_include (inc) | |
4974 | struct include_file *inc; | |
4975 | { | |
4976 | int hash = ((unsigned) (inc->st.st_dev + INO_T_HASH (inc->st.st_ino)) | |
4977 | % INCLUDE_HASHSIZE); | |
4978 | struct include_file *i = include_ino_hashtab[hash]; | |
4979 | inc->next_ino = i; | |
4980 | include_ino_hashtab[hash] = inc; | |
4981 | ||
4982 | for (; i; i = i->next_ino) | |
4983 | if (INO_T_EQ (inc->st.st_ino, i->st.st_ino) | |
4984 | && inc->st.st_dev == i->st.st_dev) { | |
4985 | inc->control_macro = i->control_macro; | |
4986 | return 1; | |
6e7f952e | 4987 | } |
6e7f952e | 4988 | |
3e4115b7 | 4989 | return 0; |
6e7f952e JW |
4990 | } |
4991 | \f | |
3e4115b7 | 4992 | /* Process file descriptor F, which corresponds to include file INC, |
b0bbbd85 | 4993 | with output to OP. |
b126e7ce RS |
4994 | SYSTEM_HEADER_P is 1 if this file resides in any one of the known |
4995 | "system" include directories (as decided by the `is_system_include' | |
4996 | function above). | |
b0bbbd85 RS |
4997 | DIRPTR is the link in the dir path through which this file was found, |
4998 | or 0 if the file name was absolute. */ | |
4999 | ||
5000 | static void | |
3e4115b7 | 5001 | finclude (f, inc, op, system_header_p, dirptr) |
b0bbbd85 | 5002 | int f; |
3e4115b7 | 5003 | struct include_file *inc; |
b0bbbd85 RS |
5004 | FILE_BUF *op; |
5005 | int system_header_p; | |
5006 | struct file_name_list *dirptr; | |
5007 | { | |
3e4115b7 RK |
5008 | char *fname = inc->fname; |
5009 | int i; | |
b0bbbd85 RS |
5010 | FILE_BUF *fp; /* For input stack frame */ |
5011 | int missing_newline = 0; | |
5012 | ||
5013 | CHECK_DEPTH (return;); | |
5014 | ||
b0bbbd85 | 5015 | fp = &instack[indepth + 1]; |
4c9a05bc | 5016 | bzero ((char *) fp, sizeof (FILE_BUF)); |
b0bbbd85 | 5017 | fp->nominal_fname = fp->fname = fname; |
3e4115b7 | 5018 | fp->inc = inc; |
b0bbbd85 RS |
5019 | fp->length = 0; |
5020 | fp->lineno = 1; | |
5021 | fp->if_stack = if_stack; | |
5022 | fp->system_header_p = system_header_p; | |
5023 | fp->dir = dirptr; | |
5024 | ||
3e4115b7 RK |
5025 | if (S_ISREG (inc->st.st_mode)) { |
5026 | fp->buf = (U_CHAR *) xmalloc (inc->st.st_size + 2); | |
b0bbbd85 RS |
5027 | fp->bufp = fp->buf; |
5028 | ||
3e4115b7 | 5029 | /* Read the file contents, knowing that inc->st.st_size is an upper bound |
b0bbbd85 | 5030 | on the number of bytes we can read. */ |
3e4115b7 | 5031 | fp->length = safe_read (f, (char *) fp->buf, inc->st.st_size); |
53e52f00 | 5032 | if (fp->length < 0) goto nope; |
b0bbbd85 | 5033 | } |
3e4115b7 | 5034 | else if (S_ISDIR (inc->st.st_mode)) { |
2e4f4529 JW |
5035 | error ("directory `%s' specified in #include", fname); |
5036 | close (f); | |
5037 | return; | |
5038 | } else { | |
b0bbbd85 RS |
5039 | /* Cannot count its file size before reading. |
5040 | First read the entire file into heap and | |
0f41302f | 5041 | copy them into buffer on stack. */ |
b0bbbd85 | 5042 | |
b0bbbd85 | 5043 | int bsize = 2000; |
3e4115b7 | 5044 | int st_size = 0; |
b0bbbd85 | 5045 | |
53e52f00 | 5046 | fp->buf = (U_CHAR *) xmalloc (bsize + 2); |
b0bbbd85 RS |
5047 | |
5048 | for (;;) { | |
25cbb59e | 5049 | i = safe_read (f, (char *) fp->buf + st_size, bsize - st_size); |
b0bbbd85 RS |
5050 | if (i < 0) |
5051 | goto nope; /* error! */ | |
b0bbbd85 | 5052 | st_size += i; |
53e52f00 RK |
5053 | if (st_size != bsize) |
5054 | break; /* End of file */ | |
5055 | bsize *= 2; | |
5056 | fp->buf = (U_CHAR *) xrealloc (fp->buf, bsize + 2); | |
b0bbbd85 | 5057 | } |
b0bbbd85 | 5058 | fp->bufp = fp->buf; |
b0bbbd85 | 5059 | fp->length = st_size; |
b0bbbd85 RS |
5060 | } |
5061 | ||
625bbc60 RS |
5062 | if ((fp->length > 0 && fp->buf[fp->length - 1] != '\n') |
5063 | /* Backslash-newline at end is not good enough. */ | |
5064 | || (fp->length > 1 && fp->buf[fp->length - 2] == '\\')) { | |
5065 | fp->buf[fp->length++] = '\n'; | |
5066 | missing_newline = 1; | |
5067 | } | |
5068 | fp->buf[fp->length] = '\0'; | |
5069 | ||
b0bbbd85 RS |
5070 | /* Close descriptor now, so nesting does not use lots of descriptors. */ |
5071 | close (f); | |
5072 | ||
cd1ceb3c JW |
5073 | /* Must do this before calling trigraph_pcp, so that the correct file name |
5074 | will be printed in warning messages. */ | |
5075 | ||
5076 | indepth++; | |
5077 | input_file_stack_tick++; | |
5078 | ||
b0bbbd85 RS |
5079 | if (!no_trigraphs) |
5080 | trigraph_pcp (fp); | |
5081 | ||
adcfa681 | 5082 | output_line_directive (fp, op, 0, enter_file); |
b0bbbd85 RS |
5083 | rescan (op, 0); |
5084 | ||
5105ecec RS |
5085 | if (missing_newline) |
5086 | fp->lineno--; | |
5087 | ||
b0bbbd85 RS |
5088 | if (pedantic && missing_newline) |
5089 | pedwarn ("file does not end in newline"); | |
5090 | ||
5091 | indepth--; | |
5092 | input_file_stack_tick++; | |
adcfa681 | 5093 | output_line_directive (&instack[indepth], op, 0, leave_file); |
b576c6b6 | 5094 | free (fp->buf); |
b0bbbd85 RS |
5095 | return; |
5096 | ||
5097 | nope: | |
5098 | ||
5099 | perror_with_name (fname); | |
5100 | close (f); | |
b576c6b6 | 5101 | free (fp->buf); |
b0bbbd85 RS |
5102 | } |
5103 | ||
3e4115b7 | 5104 | /* Record that inclusion of the include file INC |
b0bbbd85 RS |
5105 | should be controlled by the macro named MACRO_NAME. |
5106 | This means that trying to include the file again | |
5107 | will do something if that macro is defined. */ | |
5108 | ||
5109 | static void | |
3e4115b7 RK |
5110 | record_control_macro (inc, macro_name) |
5111 | struct include_file *inc; | |
b0bbbd85 RS |
5112 | U_CHAR *macro_name; |
5113 | { | |
3e4115b7 RK |
5114 | if (!inc->control_macro || inc->control_macro[0]) |
5115 | inc->control_macro = macro_name; | |
b0bbbd85 RS |
5116 | } |
5117 | \f | |
5118 | /* Load the specified precompiled header into core, and verify its | |
5119 | preconditions. PCF indicates the file descriptor to read, which must | |
3e4115b7 RK |
5120 | be a regular file. *ST is its file status. |
5121 | FNAME indicates the file name of the original header. | |
5122 | *LIMIT will be set to an address one past the end of the file. | |
b0bbbd85 RS |
5123 | If the preconditions of the file are not satisfied, the buffer is |
5124 | freed and we return 0. If the preconditions are satisfied, return | |
5125 | the address of the buffer following the preconditions. The buffer, in | |
5126 | this case, should never be freed because various pieces of it will | |
5127 | be referred to until all precompiled strings are output at the end of | |
0f41302f MS |
5128 | the run. */ |
5129 | ||
b0bbbd85 | 5130 | static char * |
3e4115b7 | 5131 | check_precompiled (pcf, st, fname, limit) |
b0bbbd85 | 5132 | int pcf; |
3e4115b7 | 5133 | struct stat *st; |
b0bbbd85 RS |
5134 | char *fname; |
5135 | char **limit; | |
5136 | { | |
b0bbbd85 RS |
5137 | int length = 0; |
5138 | char *buf; | |
b0bbbd85 RS |
5139 | char *cp; |
5140 | ||
5141 | if (pcp_outfile) | |
5142 | return 0; | |
b0bbbd85 | 5143 | |
3e4115b7 | 5144 | if (S_ISREG (st->st_mode)) |
b0bbbd85 | 5145 | { |
3e4115b7 RK |
5146 | buf = xmalloc (st->st_size + 2); |
5147 | length = safe_read (pcf, buf, st->st_size); | |
53e52f00 RK |
5148 | if (length < 0) |
5149 | goto nope; | |
b0bbbd85 RS |
5150 | } |
5151 | else | |
5152 | abort (); | |
5153 | ||
5154 | if (length > 0 && buf[length-1] != '\n') | |
5155 | buf[length++] = '\n'; | |
5156 | buf[length] = '\0'; | |
5157 | ||
5158 | *limit = buf + length; | |
5159 | ||
0f41302f | 5160 | /* File is in core. Check the preconditions. */ |
b0bbbd85 RS |
5161 | if (!check_preconditions (buf)) |
5162 | goto nope; | |
5163 | for (cp = buf; *cp; cp++) | |
5164 | ; | |
5165 | #ifdef DEBUG_PCP | |
5166 | fprintf (stderr, "Using preinclude %s\n", fname); | |
5167 | #endif | |
5168 | return cp + 1; | |
5169 | ||
5170 | nope: | |
5171 | #ifdef DEBUG_PCP | |
5172 | fprintf (stderr, "Cannot use preinclude %s\n", fname); | |
5173 | #endif | |
5174 | free (buf); | |
5175 | return 0; | |
5176 | } | |
5177 | ||
5178 | /* PREC (null terminated) points to the preconditions of a | |
5179 | precompiled header. These are a series of #define and #undef | |
5180 | lines which must match the current contents of the hash | |
5181 | table. */ | |
0f41302f | 5182 | |
b0bbbd85 RS |
5183 | static int |
5184 | check_preconditions (prec) | |
5185 | char *prec; | |
5186 | { | |
5187 | MACRODEF mdef; | |
5188 | char *lineend; | |
5189 | ||
5190 | while (*prec) { | |
25cbb59e | 5191 | lineend = index (prec, '\n'); |
b0bbbd85 RS |
5192 | |
5193 | if (*prec++ != '#') { | |
5194 | error ("Bad format encountered while reading precompiled file"); | |
5195 | return 0; | |
5196 | } | |
5197 | if (!strncmp (prec, "define", 6)) { | |
5198 | HASHNODE *hp; | |
5199 | ||
5200 | prec += 6; | |
25cbb59e | 5201 | mdef = create_definition ((U_CHAR *) prec, (U_CHAR *) lineend, NULL_PTR); |
8d9bfdc5 | 5202 | |
b0bbbd85 | 5203 | if (mdef.defn == 0) |
ad0c9fa1 | 5204 | abort (); |
b0bbbd85 RS |
5205 | |
5206 | if ((hp = lookup (mdef.symnam, mdef.symlen, -1)) == NULL | |
5207 | || (hp->type != T_MACRO && hp->type != T_CONST) | |
5208 | || (hp->type == T_MACRO | |
5209 | && !compare_defs (mdef.defn, hp->value.defn) | |
5210 | && (mdef.defn->length != 2 | |
5211 | || mdef.defn->expansion[0] != '\n' | |
5212 | || mdef.defn->expansion[1] != ' '))) | |
5213 | return 0; | |
5214 | } else if (!strncmp (prec, "undef", 5)) { | |
5215 | char *name; | |
5216 | int len; | |
5217 | ||
5218 | prec += 5; | |
d0691cfb | 5219 | while (is_hor_space[(U_CHAR) *prec]) |
b0bbbd85 RS |
5220 | prec++; |
5221 | name = prec; | |
d0691cfb | 5222 | while (is_idchar[(U_CHAR) *prec]) |
b0bbbd85 RS |
5223 | prec++; |
5224 | len = prec - name; | |
5225 | ||
25cbb59e | 5226 | if (lookup ((U_CHAR *) name, len, -1)) |
b0bbbd85 RS |
5227 | return 0; |
5228 | } else { | |
5229 | error ("Bad format encountered while reading precompiled file"); | |
5230 | return 0; | |
5231 | } | |
5232 | prec = lineend + 1; | |
5233 | } | |
5234 | /* They all passed successfully */ | |
5235 | return 1; | |
5236 | } | |
5237 | ||
5238 | /* Process the main body of a precompiled file. BUF points to the | |
5239 | string section of the file, following the preconditions. LIMIT is one | |
5240 | character past the end. NAME is the name of the file being read | |
0f41302f MS |
5241 | in. OP is the main output buffer. */ |
5242 | ||
b0bbbd85 RS |
5243 | static void |
5244 | pcfinclude (buf, limit, name, op) | |
5245 | U_CHAR *buf, *limit, *name; | |
5246 | FILE_BUF *op; | |
5247 | { | |
5248 | FILE_BUF tmpbuf; | |
5249 | int nstrings; | |
5250 | U_CHAR *cp = buf; | |
5251 | ||
5252 | /* First in the file comes 4 bytes indicating the number of strings, */ | |
5253 | /* in network byte order. (MSB first). */ | |
5254 | nstrings = *cp++; | |
5255 | nstrings = (nstrings << 8) | *cp++; | |
5256 | nstrings = (nstrings << 8) | *cp++; | |
5257 | nstrings = (nstrings << 8) | *cp++; | |
5258 | ||
0f41302f | 5259 | /* Looping over each string... */ |
b0bbbd85 RS |
5260 | while (nstrings--) { |
5261 | U_CHAR *string_start; | |
5262 | U_CHAR *endofthiskey; | |
5263 | STRINGDEF *str; | |
5264 | int nkeys; | |
5265 | ||
5266 | /* Each string starts with a STRINGDEF structure (str), followed */ | |
5267 | /* by the text of the string (string_start) */ | |
5268 | ||
5269 | /* First skip to a longword boundary */ | |
6842690e | 5270 | /* ??? Why a 4-byte boundary? On all machines? */ |
5b65a74f | 5271 | /* NOTE: This works correctly even if HOST_WIDE_INT |
845e4228 RS |
5272 | is narrower than a pointer. |
5273 | Do not try risky measures here to get another type to use! | |
39d05dae | 5274 | Do not include stddef.h--it will fail! */ |
5b65a74f RK |
5275 | if ((HOST_WIDE_INT) cp & 3) |
5276 | cp += 4 - ((HOST_WIDE_INT) cp & 3); | |
b0bbbd85 | 5277 | |
0f41302f | 5278 | /* Now get the string. */ |
25cbb59e | 5279 | str = (STRINGDEF *) (GENERIC_PTR) cp; |
b0bbbd85 RS |
5280 | string_start = cp += sizeof (STRINGDEF); |
5281 | ||
5282 | for (; *cp; cp++) /* skip the string */ | |
5283 | ; | |
5284 | ||
5285 | /* We need to macro expand the string here to ensure that the | |
5286 | proper definition environment is in place. If it were only | |
5287 | expanded when we find out it is needed, macros necessary for | |
0f41302f | 5288 | its proper expansion might have had their definitions changed. */ |
b0bbbd85 RS |
5289 | tmpbuf = expand_to_temp_buffer (string_start, cp++, 0, 0); |
5290 | /* Lineno is already set in the precompiled file */ | |
5291 | str->contents = tmpbuf.buf; | |
5292 | str->len = tmpbuf.length; | |
5293 | str->writeflag = 0; | |
5294 | str->filename = name; | |
5295 | str->output_mark = outbuf.bufp - outbuf.buf; | |
5296 | ||
5297 | str->chain = 0; | |
5298 | *stringlist_tailp = str; | |
5299 | stringlist_tailp = &str->chain; | |
5300 | ||
0f41302f MS |
5301 | /* Next comes a fourbyte number indicating the number of keys |
5302 | for this string. */ | |
b0bbbd85 RS |
5303 | nkeys = *cp++; |
5304 | nkeys = (nkeys << 8) | *cp++; | |
5305 | nkeys = (nkeys << 8) | *cp++; | |
5306 | nkeys = (nkeys << 8) | *cp++; | |
5307 | ||
0f41302f | 5308 | /* If this number is -1, then the string is mandatory. */ |
b0bbbd85 RS |
5309 | if (nkeys == -1) |
5310 | str->writeflag = 1; | |
5311 | else | |
2aa7ec37 | 5312 | /* Otherwise, for each key, */ |
b0bbbd85 | 5313 | for (; nkeys--; free (tmpbuf.buf), cp = endofthiskey + 1) { |
25cbb59e | 5314 | KEYDEF *kp = (KEYDEF *) (GENERIC_PTR) cp; |
b0bbbd85 RS |
5315 | HASHNODE *hp; |
5316 | ||
5317 | /* It starts with a KEYDEF structure */ | |
5318 | cp += sizeof (KEYDEF); | |
5319 | ||
5320 | /* Find the end of the key. At the end of this for loop we | |
0f41302f | 5321 | advance CP to the start of the next key using this variable. */ |
25cbb59e | 5322 | endofthiskey = cp + strlen ((char *) cp); |
b0bbbd85 RS |
5323 | kp->str = str; |
5324 | ||
0f41302f | 5325 | /* Expand the key, and enter it into the hash table. */ |
b0bbbd85 RS |
5326 | tmpbuf = expand_to_temp_buffer (cp, endofthiskey, 0, 0); |
5327 | tmpbuf.bufp = tmpbuf.buf; | |
5328 | ||
5329 | while (is_hor_space[*tmpbuf.bufp]) | |
5330 | tmpbuf.bufp++; | |
5331 | if (!is_idstart[*tmpbuf.bufp] | |
5332 | || tmpbuf.bufp == tmpbuf.buf + tmpbuf.length) { | |
5333 | str->writeflag = 1; | |
5334 | continue; | |
5335 | } | |
5336 | ||
5337 | hp = lookup (tmpbuf.bufp, -1, -1); | |
5338 | if (hp == NULL) { | |
5339 | kp->chain = 0; | |
91dbf5e7 | 5340 | install (tmpbuf.bufp, -1, T_PCSTRING, (char *) kp, -1); |
b0bbbd85 RS |
5341 | } |
5342 | else if (hp->type == T_PCSTRING) { | |
5343 | kp->chain = hp->value.keydef; | |
5344 | hp->value.keydef = kp; | |
5345 | } | |
5346 | else | |
5347 | str->writeflag = 1; | |
5348 | } | |
5349 | } | |
adcfa681 | 5350 | /* This output_line_directive serves to switch us back to the current |
b0bbbd85 | 5351 | input file in case some of these strings get output (which will |
0f41302f | 5352 | result in line directives for the header file being output). */ |
adcfa681 | 5353 | output_line_directive (&instack[indepth], op, 0, enter_file); |
b0bbbd85 RS |
5354 | } |
5355 | ||
0f41302f MS |
5356 | /* Called from rescan when it hits a key for strings. Mark them all |
5357 | used and clean up. */ | |
5358 | ||
b0bbbd85 RS |
5359 | static void |
5360 | pcstring_used (hp) | |
5361 | HASHNODE *hp; | |
5362 | { | |
7633af95 | 5363 | KEYDEF *kp; |
b0bbbd85 RS |
5364 | |
5365 | for (kp = hp->value.keydef; kp; kp = kp->chain) | |
5366 | kp->str->writeflag = 1; | |
5367 | delete_macro (hp); | |
5368 | } | |
5369 | ||
0f41302f MS |
5370 | /* Write the output, interspersing precompiled strings in their |
5371 | appropriate places. */ | |
5372 | ||
b0bbbd85 RS |
5373 | static void |
5374 | write_output () | |
5375 | { | |
5376 | STRINGDEF *next_string; | |
5377 | U_CHAR *cur_buf_loc; | |
adcfa681 RK |
5378 | int line_directive_len = 80; |
5379 | char *line_directive = xmalloc (line_directive_len); | |
b0bbbd85 RS |
5380 | int len; |
5381 | ||
0f41302f MS |
5382 | /* In each run through the loop, either cur_buf_loc == |
5383 | next_string_loc, in which case we print a series of strings, or | |
5384 | it is less than next_string_loc, in which case we write some of | |
5385 | the buffer. */ | |
b0bbbd85 RS |
5386 | cur_buf_loc = outbuf.buf; |
5387 | next_string = stringlist; | |
5388 | ||
5389 | while (cur_buf_loc < outbuf.bufp || next_string) { | |
5390 | if (next_string | |
5391 | && cur_buf_loc - outbuf.buf == next_string->output_mark) { | |
5392 | if (next_string->writeflag) { | |
25cbb59e | 5393 | len = 4 * strlen ((char *) next_string->filename) + 32; |
adcfa681 RK |
5394 | while (len > line_directive_len) |
5395 | line_directive = xrealloc (line_directive, | |
5396 | line_directive_len *= 2); | |
5397 | sprintf (line_directive, "\n# %d ", next_string->lineno); | |
5398 | strcpy (quote_string (line_directive + strlen (line_directive), | |
25cbb59e | 5399 | (char *) next_string->filename), |
f7531123 | 5400 | "\n"); |
adcfa681 | 5401 | safe_write (fileno (stdout), line_directive, strlen (line_directive)); |
25cbb59e RK |
5402 | safe_write (fileno (stdout), |
5403 | (char *) next_string->contents, next_string->len); | |
b0bbbd85 RS |
5404 | } |
5405 | next_string = next_string->chain; | |
5406 | } | |
5407 | else { | |
5408 | len = (next_string | |
5409 | ? (next_string->output_mark | |
5410 | - (cur_buf_loc - outbuf.buf)) | |
5411 | : outbuf.bufp - cur_buf_loc); | |
5412 | ||
25cbb59e | 5413 | safe_write (fileno (stdout), (char *) cur_buf_loc, len); |
b0bbbd85 RS |
5414 | cur_buf_loc += len; |
5415 | } | |
5416 | } | |
adcfa681 | 5417 | free (line_directive); |
b0bbbd85 RS |
5418 | } |
5419 | ||
5420 | /* Pass a directive through to the output file. | |
2aa7ec37 | 5421 | BUF points to the contents of the directive, as a contiguous string. |
b0bbbd85 RS |
5422 | LIMIT points to the first character past the end of the directive. |
5423 | KEYWORD is the keyword-table entry for the directive. */ | |
5424 | ||
5425 | static void | |
5426 | pass_thru_directive (buf, limit, op, keyword) | |
5427 | U_CHAR *buf, *limit; | |
5428 | FILE_BUF *op; | |
5429 | struct directive *keyword; | |
5430 | { | |
5431 | register unsigned keyword_length = keyword->length; | |
5432 | ||
5433 | check_expand (op, 1 + keyword_length + (limit - buf)); | |
5434 | *op->bufp++ = '#'; | |
4c9a05bc | 5435 | bcopy (keyword->name, (char *) op->bufp, keyword_length); |
b0bbbd85 RS |
5436 | op->bufp += keyword_length; |
5437 | if (limit != buf && buf[0] != ' ') | |
5438 | *op->bufp++ = ' '; | |
4c9a05bc | 5439 | bcopy ((char *) buf, (char *) op->bufp, limit - buf); |
b0bbbd85 | 5440 | op->bufp += (limit - buf); |
ae34b95d | 5441 | #if 0 |
b0bbbd85 | 5442 | *op->bufp++ = '\n'; |
ae34b95d RS |
5443 | /* Count the line we have just made in the output, |
5444 | to get in sync properly. */ | |
5445 | op->lineno++; | |
5446 | #endif | |
b0bbbd85 RS |
5447 | } |
5448 | \f | |
5449 | /* The arglist structure is built by do_define to tell | |
5450 | collect_definition where the argument names begin. That | |
5451 | is, for a define like "#define f(x,y,z) foo+x-bar*y", the arglist | |
5452 | would contain pointers to the strings x, y, and z. | |
5453 | Collect_definition would then build a DEFINITION node, | |
5454 | with reflist nodes pointing to the places x, y, and z had | |
5455 | appeared. So the arglist is just convenience data passed | |
5456 | between these two routines. It is not kept around after | |
5457 | the current #define has been processed and entered into the | |
0f41302f | 5458 | hash table. */ |
b0bbbd85 RS |
5459 | |
5460 | struct arglist { | |
5461 | struct arglist *next; | |
5462 | U_CHAR *name; | |
5463 | int length; | |
5464 | int argno; | |
5ff1a832 | 5465 | char rest_args; |
b0bbbd85 RS |
5466 | }; |
5467 | ||
5468 | /* Create a DEFINITION node from a #define directive. Arguments are | |
0f41302f MS |
5469 | as for do_define. */ |
5470 | ||
b0bbbd85 RS |
5471 | static MACRODEF |
5472 | create_definition (buf, limit, op) | |
5473 | U_CHAR *buf, *limit; | |
5474 | FILE_BUF *op; | |
5475 | { | |
5476 | U_CHAR *bp; /* temp ptr into input buffer */ | |
5477 | U_CHAR *symname; /* remember where symbol name starts */ | |
5478 | int sym_length; /* and how long it is */ | |
5479 | int line = instack[indepth].lineno; | |
5480 | char *file = instack[indepth].nominal_fname; | |
5ff1a832 | 5481 | int rest_args = 0; |
b0bbbd85 RS |
5482 | |
5483 | DEFINITION *defn; | |
5484 | int arglengths = 0; /* Accumulate lengths of arg names | |
5485 | plus number of args. */ | |
5486 | MACRODEF mdef; | |
5487 | ||
5488 | bp = buf; | |
5489 | ||
5490 | while (is_hor_space[*bp]) | |
5491 | bp++; | |
5492 | ||
5493 | symname = bp; /* remember where it starts */ | |
5494 | sym_length = check_macro_name (bp, "macro"); | |
5495 | bp += sym_length; | |
5496 | ||
5497 | /* Lossage will occur if identifiers or control keywords are broken | |
5498 | across lines using backslash. This is not the right place to take | |
0f41302f | 5499 | care of that. */ |
b0bbbd85 RS |
5500 | |
5501 | if (*bp == '(') { | |
5502 | struct arglist *arg_ptrs = NULL; | |
5503 | int argno = 0; | |
5504 | ||
5505 | bp++; /* skip '(' */ | |
5506 | SKIP_WHITE_SPACE (bp); | |
5507 | ||
5508 | /* Loop over macro argument names. */ | |
5509 | while (*bp != ')') { | |
5510 | struct arglist *temp; | |
5511 | ||
5512 | temp = (struct arglist *) alloca (sizeof (struct arglist)); | |
5513 | temp->name = bp; | |
5514 | temp->next = arg_ptrs; | |
5515 | temp->argno = argno++; | |
5ff1a832 | 5516 | temp->rest_args = 0; |
b0bbbd85 RS |
5517 | arg_ptrs = temp; |
5518 | ||
5ff1a832 RS |
5519 | if (rest_args) |
5520 | pedwarn ("another parameter follows `%s'", | |
5521 | rest_extension); | |
b0bbbd85 | 5522 | |
5ff1a832 RS |
5523 | if (!is_idstart[*bp]) |
5524 | pedwarn ("invalid character in macro parameter name"); | |
5525 | ||
b0bbbd85 RS |
5526 | /* Find the end of the arg name. */ |
5527 | while (is_idchar[*bp]) { | |
5528 | bp++; | |
5ff1a832 RS |
5529 | /* do we have a "special" rest-args extension here? */ |
5530 | if (limit - bp > REST_EXTENSION_LENGTH && | |
25cbb59e | 5531 | bcmp (rest_extension, bp, REST_EXTENSION_LENGTH) == 0) { |
5ff1a832 RS |
5532 | rest_args = 1; |
5533 | temp->rest_args = 1; | |
5534 | break; | |
5535 | } | |
b0bbbd85 RS |
5536 | } |
5537 | temp->length = bp - temp->name; | |
5ff1a832 RS |
5538 | if (rest_args == 1) |
5539 | bp += REST_EXTENSION_LENGTH; | |
b0bbbd85 RS |
5540 | arglengths += temp->length + 2; |
5541 | SKIP_WHITE_SPACE (bp); | |
5542 | if (temp->length == 0 || (*bp != ',' && *bp != ')')) { | |
5543 | error ("badly punctuated parameter list in `#define'"); | |
5544 | goto nope; | |
5545 | } | |
5546 | if (*bp == ',') { | |
5547 | bp++; | |
5548 | SKIP_WHITE_SPACE (bp); | |
94d681a0 JW |
5549 | /* A comma at this point can only be followed by an identifier. */ |
5550 | if (!is_idstart[*bp]) { | |
5551 | error ("badly punctuated parameter list in `#define'"); | |
5552 | goto nope; | |
5553 | } | |
b0bbbd85 RS |
5554 | } |
5555 | if (bp >= limit) { | |
5556 | error ("unterminated parameter list in `#define'"); | |
5557 | goto nope; | |
5558 | } | |
5559 | { | |
5560 | struct arglist *otemp; | |
5561 | ||
5562 | for (otemp = temp->next; otemp != NULL; otemp = otemp->next) | |
5563 | if (temp->length == otemp->length && | |
25cbb59e RK |
5564 | bcmp (temp->name, otemp->name, temp->length) == 0) { |
5565 | error ("duplicate argument name `%.*s' in `#define'", | |
5566 | temp->length, temp->name); | |
b0bbbd85 RS |
5567 | goto nope; |
5568 | } | |
5569 | } | |
5570 | } | |
5571 | ||
5572 | ++bp; /* skip paren */ | |
c03413c7 | 5573 | SKIP_WHITE_SPACE (bp); |
0f41302f | 5574 | /* now everything from bp before limit is the definition. */ |
b0bbbd85 | 5575 | defn = collect_expansion (bp, limit, argno, arg_ptrs); |
5ff1a832 | 5576 | defn->rest_args = rest_args; |
b0bbbd85 RS |
5577 | |
5578 | /* Now set defn->args.argnames to the result of concatenating | |
5579 | the argument names in reverse order | |
5580 | with comma-space between them. */ | |
5581 | defn->args.argnames = (U_CHAR *) xmalloc (arglengths + 1); | |
5582 | { | |
5583 | struct arglist *temp; | |
5584 | int i = 0; | |
5585 | for (temp = arg_ptrs; temp; temp = temp->next) { | |
5586 | bcopy (temp->name, &defn->args.argnames[i], temp->length); | |
5587 | i += temp->length; | |
5588 | if (temp->next != 0) { | |
5589 | defn->args.argnames[i++] = ','; | |
5590 | defn->args.argnames[i++] = ' '; | |
5591 | } | |
5592 | } | |
5593 | defn->args.argnames[i] = 0; | |
5594 | } | |
5595 | } else { | |
9966b391 RK |
5596 | /* Simple expansion or empty definition. */ |
5597 | ||
fbcd3360 RK |
5598 | if (bp < limit) |
5599 | { | |
c03413c7 RK |
5600 | if (is_hor_space[*bp]) { |
5601 | bp++; | |
5602 | SKIP_WHITE_SPACE (bp); | |
19848e74 | 5603 | } else if (sym_length) { |
c03413c7 | 5604 | switch (*bp) { |
fbcd3360 RK |
5605 | case '!': case '"': case '#': case '%': case '&': case '\'': |
5606 | case ')': case '*': case '+': case ',': case '-': case '.': | |
5607 | case '/': case ':': case ';': case '<': case '=': case '>': | |
5608 | case '?': case '[': case '\\': case ']': case '^': case '{': | |
5609 | case '|': case '}': case '~': | |
5610 | warning ("missing white space after `#define %.*s'", | |
5611 | sym_length, symname); | |
5612 | break; | |
5613 | ||
5614 | default: | |
5615 | pedwarn ("missing white space after `#define %.*s'", | |
5616 | sym_length, symname); | |
5617 | break; | |
5618 | } | |
c03413c7 | 5619 | } |
fbcd3360 | 5620 | } |
0f41302f | 5621 | /* Now everything from bp before limit is the definition. */ |
8d9bfdc5 | 5622 | defn = collect_expansion (bp, limit, -1, NULL_PTR); |
b0bbbd85 RS |
5623 | defn->args.argnames = (U_CHAR *) ""; |
5624 | } | |
5625 | ||
5626 | defn->line = line; | |
5627 | defn->file = file; | |
5628 | ||
5629 | /* OP is null if this is a predefinition */ | |
5630 | defn->predefined = !op; | |
5631 | mdef.defn = defn; | |
5632 | mdef.symnam = symname; | |
5633 | mdef.symlen = sym_length; | |
5634 | ||
5635 | return mdef; | |
5636 | ||
5637 | nope: | |
5638 | mdef.defn = 0; | |
5639 | return mdef; | |
5640 | } | |
5641 | ||
adcfa681 RK |
5642 | /* Process a #define directive. |
5643 | BUF points to the contents of the #define directive, as a contiguous string. | |
b0bbbd85 RS |
5644 | LIMIT points to the first character past the end of the definition. |
5645 | KEYWORD is the keyword-table entry for #define. */ | |
5646 | ||
5647 | static int | |
5648 | do_define (buf, limit, op, keyword) | |
5649 | U_CHAR *buf, *limit; | |
5650 | FILE_BUF *op; | |
5651 | struct directive *keyword; | |
5652 | { | |
5653 | int hashcode; | |
5654 | MACRODEF mdef; | |
5655 | ||
adcfa681 | 5656 | /* If this is a precompiler run (with -pcp) pass thru #define directives. */ |
b0bbbd85 RS |
5657 | if (pcp_outfile && op) |
5658 | pass_thru_directive (buf, limit, op, keyword); | |
5659 | ||
5660 | mdef = create_definition (buf, limit, op); | |
5661 | if (mdef.defn == 0) | |
5662 | goto nope; | |
5663 | ||
5664 | hashcode = hashf (mdef.symnam, mdef.symlen, HASHSIZE); | |
5665 | ||
5666 | { | |
5667 | HASHNODE *hp; | |
5668 | if ((hp = lookup (mdef.symnam, mdef.symlen, hashcode)) != NULL) { | |
5669 | int ok = 0; | |
5670 | /* Redefining a precompiled key is ok. */ | |
5671 | if (hp->type == T_PCSTRING) | |
5672 | ok = 1; | |
5673 | /* Redefining a macro is ok if the definitions are the same. */ | |
5674 | else if (hp->type == T_MACRO) | |
5675 | ok = ! compare_defs (mdef.defn, hp->value.defn); | |
5676 | /* Redefining a constant is ok with -D. */ | |
5677 | else if (hp->type == T_CONST) | |
5678 | ok = ! done_initializing; | |
5679 | /* Print the warning if it's not ok. */ | |
5680 | if (!ok) { | |
b0bbbd85 RS |
5681 | /* If we are passing through #define and #undef directives, do |
5682 | that for this re-definition now. */ | |
5683 | if (debug_output && op) | |
5684 | pass_thru_directive (buf, limit, op, keyword); | |
5685 | ||
25cbb59e | 5686 | pedwarn ("`%.*s' redefined", mdef.symlen, mdef.symnam); |
b0bbbd85 RS |
5687 | if (hp->type == T_MACRO) |
5688 | pedwarn_with_file_and_line (hp->value.defn->file, hp->value.defn->line, | |
5689 | "this is the location of the previous definition"); | |
5690 | } | |
5691 | /* Replace the old definition. */ | |
5692 | hp->type = T_MACRO; | |
5693 | hp->value.defn = mdef.defn; | |
5694 | } else { | |
5695 | /* If we are passing through #define and #undef directives, do | |
5696 | that for this new definition now. */ | |
5697 | if (debug_output && op) | |
5698 | pass_thru_directive (buf, limit, op, keyword); | |
91dbf5e7 | 5699 | install (mdef.symnam, mdef.symlen, T_MACRO, |
47b2881e | 5700 | (char *) mdef.defn, hashcode); |
b0bbbd85 RS |
5701 | } |
5702 | } | |
5703 | ||
5704 | return 0; | |
5705 | ||
5706 | nope: | |
5707 | ||
5708 | return 1; | |
5709 | } | |
5710 | \f | |
5711 | /* Check a purported macro name SYMNAME, and yield its length. | |
5712 | USAGE is the kind of name this is intended for. */ | |
5713 | ||
5714 | static int | |
5715 | check_macro_name (symname, usage) | |
5716 | U_CHAR *symname; | |
5717 | char *usage; | |
5718 | { | |
5719 | U_CHAR *p; | |
5720 | int sym_length; | |
5721 | ||
5722 | for (p = symname; is_idchar[*p]; p++) | |
5723 | ; | |
5724 | sym_length = p - symname; | |
5725 | if (sym_length == 0) | |
5726 | error ("invalid %s name", usage); | |
25cbb59e RK |
5727 | else if (!is_idstart[*symname] |
5728 | || (sym_length == 7 && ! bcmp (symname, "defined", 7))) | |
5729 | error ("invalid %s name `%.*s'", usage, sym_length, symname); | |
b0bbbd85 RS |
5730 | return sym_length; |
5731 | } | |
5732 | ||
0f41302f MS |
5733 | /* Return zero if two DEFINITIONs are isomorphic. */ |
5734 | ||
b0bbbd85 RS |
5735 | static int |
5736 | compare_defs (d1, d2) | |
5737 | DEFINITION *d1, *d2; | |
5738 | { | |
5739 | register struct reflist *a1, *a2; | |
5740 | register U_CHAR *p1 = d1->expansion; | |
5741 | register U_CHAR *p2 = d2->expansion; | |
5742 | int first = 1; | |
5743 | ||
5744 | if (d1->nargs != d2->nargs) | |
5745 | return 1; | |
5746 | if (strcmp ((char *)d1->args.argnames, (char *)d2->args.argnames)) | |
5747 | return 1; | |
5748 | for (a1 = d1->pattern, a2 = d2->pattern; a1 && a2; | |
5749 | a1 = a1->next, a2 = a2->next) { | |
25cbb59e | 5750 | if (!((a1->nchars == a2->nchars && ! bcmp (p1, p2, a1->nchars)) |
b0bbbd85 RS |
5751 | || ! comp_def_part (first, p1, a1->nchars, p2, a2->nchars, 0)) |
5752 | || a1->argno != a2->argno | |
5753 | || a1->stringify != a2->stringify | |
5754 | || a1->raw_before != a2->raw_before | |
5755 | || a1->raw_after != a2->raw_after) | |
5756 | return 1; | |
5757 | first = 0; | |
5758 | p1 += a1->nchars; | |
5759 | p2 += a2->nchars; | |
5760 | } | |
5761 | if (a1 != a2) | |
5762 | return 1; | |
5763 | if (comp_def_part (first, p1, d1->length - (p1 - d1->expansion), | |
5764 | p2, d2->length - (p2 - d2->expansion), 1)) | |
5765 | return 1; | |
5766 | return 0; | |
5767 | } | |
5768 | ||
5769 | /* Return 1 if two parts of two macro definitions are effectively different. | |
5770 | One of the parts starts at BEG1 and has LEN1 chars; | |
5771 | the other has LEN2 chars at BEG2. | |
5772 | Any sequence of whitespace matches any other sequence of whitespace. | |
5773 | FIRST means these parts are the first of a macro definition; | |
5774 | so ignore leading whitespace entirely. | |
5775 | LAST means these parts are the last of a macro definition; | |
5776 | so ignore trailing whitespace entirely. */ | |
5777 | ||
5778 | static int | |
5779 | comp_def_part (first, beg1, len1, beg2, len2, last) | |
5780 | int first; | |
5781 | U_CHAR *beg1, *beg2; | |
5782 | int len1, len2; | |
5783 | int last; | |
5784 | { | |
5785 | register U_CHAR *end1 = beg1 + len1; | |
5786 | register U_CHAR *end2 = beg2 + len2; | |
5787 | if (first) { | |
5788 | while (beg1 != end1 && is_space[*beg1]) beg1++; | |
5789 | while (beg2 != end2 && is_space[*beg2]) beg2++; | |
5790 | } | |
5791 | if (last) { | |
5792 | while (beg1 != end1 && is_space[end1[-1]]) end1--; | |
5793 | while (beg2 != end2 && is_space[end2[-1]]) end2--; | |
5794 | } | |
5795 | while (beg1 != end1 && beg2 != end2) { | |
5796 | if (is_space[*beg1] && is_space[*beg2]) { | |
5797 | while (beg1 != end1 && is_space[*beg1]) beg1++; | |
5798 | while (beg2 != end2 && is_space[*beg2]) beg2++; | |
5799 | } else if (*beg1 == *beg2) { | |
5800 | beg1++; beg2++; | |
5801 | } else break; | |
5802 | } | |
5803 | return (beg1 != end1) || (beg2 != end2); | |
5804 | } | |
5805 | \f | |
5806 | /* Read a replacement list for a macro with parameters. | |
5807 | Build the DEFINITION structure. | |
5808 | Reads characters of text starting at BUF until END. | |
5809 | ARGLIST specifies the formal parameters to look for | |
5810 | in the text of the definition; NARGS is the number of args | |
5811 | in that list, or -1 for a macro name that wants no argument list. | |
5812 | MACRONAME is the macro name itself (so we can avoid recursive expansion) | |
5813 | and NAMELEN is its length in characters. | |
5814 | ||
c9263446 RK |
5815 | Note that comments, backslash-newlines, and leading white space |
5816 | have already been deleted from the argument. */ | |
b0bbbd85 | 5817 | |
c9263446 | 5818 | /* If there is no trailing whitespace, a Newline Space is added at the end |
b0bbbd85 RS |
5819 | to prevent concatenation that would be contrary to the standard. */ |
5820 | ||
5821 | static DEFINITION * | |
5822 | collect_expansion (buf, end, nargs, arglist) | |
5823 | U_CHAR *buf, *end; | |
5824 | int nargs; | |
5825 | struct arglist *arglist; | |
5826 | { | |
5827 | DEFINITION *defn; | |
5828 | register U_CHAR *p, *limit, *lastp, *exp_p; | |
5829 | struct reflist *endpat = NULL; | |
5830 | /* Pointer to first nonspace after last ## seen. */ | |
5831 | U_CHAR *concat = 0; | |
5832 | /* Pointer to first nonspace after last single-# seen. */ | |
5833 | U_CHAR *stringify = 0; | |
5bdc1512 RK |
5834 | /* How those tokens were spelled. */ |
5835 | enum sharp_token_type concat_sharp_token_type = NO_SHARP_TOKEN; | |
5836 | enum sharp_token_type stringify_sharp_token_type = NO_SHARP_TOKEN; | |
b0bbbd85 RS |
5837 | int maxsize; |
5838 | int expected_delimiter = '\0'; | |
5839 | ||
5840 | /* Scan thru the replacement list, ignoring comments and quoted | |
5841 | strings, picking up on the macro calls. It does a linear search | |
5842 | thru the arg list on every potential symbol. Profiling might say | |
0f41302f | 5843 | that something smarter should happen. */ |
b0bbbd85 RS |
5844 | |
5845 | if (end < buf) | |
5846 | abort (); | |
5847 | ||
5848 | /* Find the beginning of the trailing whitespace. */ | |
b0bbbd85 RS |
5849 | limit = end; |
5850 | p = buf; | |
5851 | while (p < limit && is_space[limit[-1]]) limit--; | |
b0bbbd85 RS |
5852 | |
5853 | /* Allocate space for the text in the macro definition. | |
c9263446 | 5854 | Each input char may or may not need 1 byte, |
b0bbbd85 | 5855 | so this is an upper bound. |
c9263446 | 5856 | The extra 3 are for invented trailing newline-marker and final null. */ |
b0bbbd85 | 5857 | maxsize = (sizeof (DEFINITION) |
b0bbbd85 RS |
5858 | + (limit - p) + 3); |
5859 | defn = (DEFINITION *) xcalloc (1, maxsize); | |
5860 | ||
5861 | defn->nargs = nargs; | |
5862 | exp_p = defn->expansion = (U_CHAR *) defn + sizeof (DEFINITION); | |
5863 | lastp = exp_p; | |
5864 | ||
91dbf5e7 RK |
5865 | if (p[0] == '#' |
5866 | ? p[1] == '#' | |
5867 | : p[0] == '%' && p[1] == ':' && p[2] == '%' && p[3] == ':') { | |
b0bbbd85 | 5868 | error ("`##' at start of macro definition"); |
91dbf5e7 | 5869 | p += p[0] == '#' ? 2 : 4; |
b0bbbd85 RS |
5870 | } |
5871 | ||
5872 | /* Process the main body of the definition. */ | |
5873 | while (p < limit) { | |
5874 | int skipped_arg = 0; | |
5875 | register U_CHAR c = *p++; | |
5876 | ||
5877 | *exp_p++ = c; | |
5878 | ||
5879 | if (!traditional) { | |
5880 | switch (c) { | |
5881 | case '\'': | |
5882 | case '\"': | |
5883 | if (expected_delimiter != '\0') { | |
5884 | if (c == expected_delimiter) | |
5885 | expected_delimiter = '\0'; | |
5886 | } else | |
5887 | expected_delimiter = c; | |
5888 | break; | |
5889 | ||
b0bbbd85 | 5890 | case '\\': |
01bffe73 | 5891 | if (p < limit && expected_delimiter) { |
b0bbbd85 RS |
5892 | /* In a string, backslash goes through |
5893 | and makes next char ordinary. */ | |
5894 | *exp_p++ = *p++; | |
5895 | } | |
5896 | break; | |
5897 | ||
91dbf5e7 RK |
5898 | case '%': |
5899 | if (!expected_delimiter && *p == ':') { | |
5900 | /* %: is not a digraph if preceded by an odd number of '<'s. */ | |
5901 | U_CHAR *p0 = p - 1; | |
5902 | while (buf < p0 && p0[-1] == '<') | |
5903 | p0--; | |
5904 | if ((p - p0) & 1) { | |
5905 | /* Treat %:%: as ## and %: as #. */ | |
5906 | if (p[1] == '%' && p[2] == ':') { | |
5907 | p += 2; | |
5bdc1512 | 5908 | goto sharp_sharp_token; |
91dbf5e7 RK |
5909 | } |
5910 | if (nargs >= 0) { | |
5911 | p++; | |
5bdc1512 | 5912 | goto sharp_token; |
91dbf5e7 RK |
5913 | } |
5914 | } | |
5915 | } | |
5916 | break; | |
5917 | ||
b0bbbd85 RS |
5918 | case '#': |
5919 | /* # is ordinary inside a string. */ | |
5920 | if (expected_delimiter) | |
5921 | break; | |
91dbf5e7 | 5922 | if (*p == '#') { |
5bdc1512 | 5923 | sharp_sharp_token: |
b0bbbd85 RS |
5924 | /* ##: concatenate preceding and following tokens. */ |
5925 | /* Take out the first #, discard preceding whitespace. */ | |
5926 | exp_p--; | |
5927 | while (exp_p > lastp && is_hor_space[exp_p[-1]]) | |
5928 | --exp_p; | |
5929 | /* Skip the second #. */ | |
5930 | p++; | |
5bdc1512 RK |
5931 | concat_sharp_token_type = c; |
5932 | if (is_hor_space[*p]) { | |
7ea426fe | 5933 | concat_sharp_token_type = c + 1; |
5bdc1512 RK |
5934 | p++; |
5935 | SKIP_WHITE_SPACE (p); | |
5936 | } | |
b0bbbd85 RS |
5937 | concat = p; |
5938 | if (p == limit) | |
5939 | error ("`##' at end of macro definition"); | |
2fc33352 | 5940 | } else if (nargs >= 0) { |
b0bbbd85 RS |
5941 | /* Single #: stringify following argument ref. |
5942 | Don't leave the # in the expansion. */ | |
5bdc1512 | 5943 | sharp_token: |
b0bbbd85 | 5944 | exp_p--; |
5bdc1512 RK |
5945 | stringify_sharp_token_type = c; |
5946 | if (is_hor_space[*p]) { | |
7ea426fe | 5947 | stringify_sharp_token_type = c + 1; |
5bdc1512 RK |
5948 | p++; |
5949 | SKIP_WHITE_SPACE (p); | |
5950 | } | |
91dbf5e7 | 5951 | if (! is_idstart[*p] || nargs == 0) |
b0bbbd85 | 5952 | error ("`#' operator is not followed by a macro argument name"); |
5bdc1512 | 5953 | else |
b0bbbd85 RS |
5954 | stringify = p; |
5955 | } | |
5956 | break; | |
5957 | } | |
5958 | } else { | |
5959 | /* In -traditional mode, recognize arguments inside strings and | |
5960 | and character constants, and ignore special properties of #. | |
5961 | Arguments inside strings are considered "stringified", but no | |
5962 | extra quote marks are supplied. */ | |
5963 | switch (c) { | |
5964 | case '\'': | |
5965 | case '\"': | |
5966 | if (expected_delimiter != '\0') { | |
5967 | if (c == expected_delimiter) | |
5968 | expected_delimiter = '\0'; | |
5969 | } else | |
5970 | expected_delimiter = c; | |
5971 | break; | |
5972 | ||
5973 | case '\\': | |
5974 | /* Backslash quotes delimiters and itself, but not macro args. */ | |
5975 | if (expected_delimiter != 0 && p < limit | |
5976 | && (*p == expected_delimiter || *p == '\\')) { | |
5977 | *exp_p++ = *p++; | |
5978 | continue; | |
5979 | } | |
5980 | break; | |
5981 | ||
5982 | case '/': | |
5983 | if (expected_delimiter != '\0') /* No comments inside strings. */ | |
5984 | break; | |
5985 | if (*p == '*') { | |
5986 | /* If we find a comment that wasn't removed by handle_directive, | |
5987 | this must be -traditional. So replace the comment with | |
5988 | nothing at all. */ | |
5989 | exp_p--; | |
35b28a7a PE |
5990 | while (++p < limit) { |
5991 | if (p[0] == '*' && p[1] == '/') { | |
5992 | p += 2; | |
5993 | break; | |
5994 | } | |
5995 | } | |
b0bbbd85 RS |
5996 | #if 0 |
5997 | /* Mark this as a concatenation-point, as if it had been ##. */ | |
5998 | concat = p; | |
5999 | #endif | |
6000 | } | |
6001 | break; | |
6002 | } | |
6003 | } | |
6004 | ||
6005 | /* Handle the start of a symbol. */ | |
6006 | if (is_idchar[c] && nargs > 0) { | |
6007 | U_CHAR *id_beg = p - 1; | |
6008 | int id_len; | |
6009 | ||
6010 | --exp_p; | |
6011 | while (p != limit && is_idchar[*p]) p++; | |
6012 | id_len = p - id_beg; | |
6013 | ||
6014 | if (is_idstart[c]) { | |
6015 | register struct arglist *arg; | |
6016 | ||
6017 | for (arg = arglist; arg != NULL; arg = arg->next) { | |
6018 | struct reflist *tpat; | |
6019 | ||
6020 | if (arg->name[0] == c | |
6021 | && arg->length == id_len | |
25cbb59e | 6022 | && bcmp (arg->name, id_beg, id_len) == 0) { |
c29a4cbc RK |
6023 | enum sharp_token_type tpat_stringify; |
6024 | if (expected_delimiter) { | |
6025 | if (warn_stringify) { | |
6026 | if (traditional) { | |
6027 | warning ("macro argument `%.*s' is stringified.", | |
6028 | id_len, arg->name); | |
6029 | } else { | |
6030 | warning ("macro arg `%.*s' would be stringified with -traditional.", | |
6031 | id_len, arg->name); | |
6032 | } | |
b0bbbd85 | 6033 | } |
c29a4cbc RK |
6034 | /* If ANSI, don't actually substitute inside a string. */ |
6035 | if (!traditional) | |
6036 | break; | |
6037 | tpat_stringify = SHARP_TOKEN; | |
6038 | } else { | |
6039 | tpat_stringify | |
6040 | = (stringify == id_beg | |
6041 | ? stringify_sharp_token_type : NO_SHARP_TOKEN); | |
b0bbbd85 | 6042 | } |
b0bbbd85 RS |
6043 | /* make a pat node for this arg and append it to the end of |
6044 | the pat list */ | |
6045 | tpat = (struct reflist *) xmalloc (sizeof (struct reflist)); | |
6046 | tpat->next = NULL; | |
5bdc1512 RK |
6047 | tpat->raw_before |
6048 | = concat == id_beg ? concat_sharp_token_type : NO_SHARP_TOKEN; | |
6049 | tpat->raw_after = NO_SHARP_TOKEN; | |
5ff1a832 | 6050 | tpat->rest_args = arg->rest_args; |
c29a4cbc | 6051 | tpat->stringify = tpat_stringify; |
b0bbbd85 RS |
6052 | |
6053 | if (endpat == NULL) | |
6054 | defn->pattern = tpat; | |
6055 | else | |
6056 | endpat->next = tpat; | |
6057 | endpat = tpat; | |
6058 | ||
6059 | tpat->argno = arg->argno; | |
6060 | tpat->nchars = exp_p - lastp; | |
6061 | { | |
6062 | register U_CHAR *p1 = p; | |
6063 | SKIP_WHITE_SPACE (p1); | |
91dbf5e7 RK |
6064 | if (p1[0]=='#' |
6065 | ? p1[1]=='#' | |
6066 | : p1[0]=='%' && p1[1]==':' && p1[2]=='%' && p1[3]==':') | |
5bdc1512 | 6067 | tpat->raw_after = p1[0] + (p != p1); |
b0bbbd85 RS |
6068 | } |
6069 | lastp = exp_p; /* place to start copying from next time */ | |
6070 | skipped_arg = 1; | |
6071 | break; | |
6072 | } | |
6073 | } | |
6074 | } | |
6075 | ||
6076 | /* If this was not a macro arg, copy it into the expansion. */ | |
6077 | if (! skipped_arg) { | |
6078 | register U_CHAR *lim1 = p; | |
6079 | p = id_beg; | |
6080 | while (p != lim1) | |
6081 | *exp_p++ = *p++; | |
6082 | if (stringify == id_beg) | |
6083 | error ("`#' operator should be followed by a macro argument name"); | |
6084 | } | |
6085 | } | |
6086 | } | |
6087 | ||
d52a8965 | 6088 | if (!traditional && expected_delimiter == 0) { |
aa53d0ba RK |
6089 | /* If ANSI, put in a newline-space marker to prevent token pasting. |
6090 | But not if "inside a string" (which in ANSI mode happens only for | |
6091 | -D option). */ | |
d52a8965 MM |
6092 | *exp_p++ = '\n'; |
6093 | *exp_p++ = ' '; | |
6094 | } | |
6095 | ||
b0bbbd85 RS |
6096 | *exp_p = '\0'; |
6097 | ||
6098 | defn->length = exp_p - defn->expansion; | |
6099 | ||
6100 | /* Crash now if we overrun the allocated size. */ | |
6101 | if (defn->length + 1 > maxsize) | |
6102 | abort (); | |
6103 | ||
6104 | #if 0 | |
6105 | /* This isn't worth the time it takes. */ | |
6106 | /* give back excess storage */ | |
6107 | defn->expansion = (U_CHAR *) xrealloc (defn->expansion, defn->length + 1); | |
6108 | #endif | |
6109 | ||
6110 | return defn; | |
6111 | } | |
6112 | \f | |
6113 | static int | |
6114 | do_assert (buf, limit, op, keyword) | |
6115 | U_CHAR *buf, *limit; | |
6116 | FILE_BUF *op; | |
6117 | struct directive *keyword; | |
6118 | { | |
6119 | U_CHAR *bp; /* temp ptr into input buffer */ | |
6120 | U_CHAR *symname; /* remember where symbol name starts */ | |
6121 | int sym_length; /* and how long it is */ | |
6122 | struct arglist *tokens = NULL; | |
6123 | ||
6124 | if (pedantic && done_initializing && !instack[indepth].system_header_p) | |
6125 | pedwarn ("ANSI C does not allow `#assert'"); | |
6126 | ||
6127 | bp = buf; | |
6128 | ||
6129 | while (is_hor_space[*bp]) | |
6130 | bp++; | |
6131 | ||
6132 | symname = bp; /* remember where it starts */ | |
6133 | sym_length = check_macro_name (bp, "assertion"); | |
6134 | bp += sym_length; | |
6135 | /* #define doesn't do this, but we should. */ | |
6136 | SKIP_WHITE_SPACE (bp); | |
6137 | ||
6138 | /* Lossage will occur if identifiers or control tokens are broken | |
6139 | across lines using backslash. This is not the right place to take | |
0f41302f | 6140 | care of that. */ |
b0bbbd85 RS |
6141 | |
6142 | if (*bp != '(') { | |
6143 | error ("missing token-sequence in `#assert'"); | |
6144 | return 1; | |
6145 | } | |
6146 | ||
6147 | { | |
6148 | int error_flag = 0; | |
6149 | ||
6150 | bp++; /* skip '(' */ | |
6151 | SKIP_WHITE_SPACE (bp); | |
6152 | ||
6153 | tokens = read_token_list (&bp, limit, &error_flag); | |
6154 | if (error_flag) | |
6155 | return 1; | |
6156 | if (tokens == 0) { | |
6157 | error ("empty token-sequence in `#assert'"); | |
6158 | return 1; | |
6159 | } | |
6160 | ||
6161 | ++bp; /* skip paren */ | |
6162 | SKIP_WHITE_SPACE (bp); | |
6163 | } | |
6164 | ||
6165 | /* If this name isn't already an assertion name, make it one. | |
6166 | Error if it was already in use in some other way. */ | |
6167 | ||
6168 | { | |
6169 | ASSERTION_HASHNODE *hp; | |
6170 | int hashcode = hashf (symname, sym_length, ASSERTION_HASHSIZE); | |
6171 | struct tokenlist_list *value | |
6172 | = (struct tokenlist_list *) xmalloc (sizeof (struct tokenlist_list)); | |
6173 | ||
6174 | hp = assertion_lookup (symname, sym_length, hashcode); | |
6175 | if (hp == NULL) { | |
25cbb59e | 6176 | if (sym_length == 7 && ! bcmp (symname, "defined", 7)) |
b0bbbd85 RS |
6177 | error ("`defined' redefined as assertion"); |
6178 | hp = assertion_install (symname, sym_length, hashcode); | |
6179 | } | |
6180 | ||
6181 | /* Add the spec'd token-sequence to the list of such. */ | |
6182 | value->tokens = tokens; | |
6183 | value->next = hp->value; | |
6184 | hp->value = value; | |
6185 | } | |
6186 | ||
6187 | return 0; | |
6188 | } | |
6189 | \f | |
6190 | static int | |
6191 | do_unassert (buf, limit, op, keyword) | |
6192 | U_CHAR *buf, *limit; | |
6193 | FILE_BUF *op; | |
6194 | struct directive *keyword; | |
6195 | { | |
6196 | U_CHAR *bp; /* temp ptr into input buffer */ | |
6197 | U_CHAR *symname; /* remember where symbol name starts */ | |
6198 | int sym_length; /* and how long it is */ | |
6199 | ||
6200 | struct arglist *tokens = NULL; | |
6201 | int tokens_specified = 0; | |
6202 | ||
6203 | if (pedantic && done_initializing && !instack[indepth].system_header_p) | |
6204 | pedwarn ("ANSI C does not allow `#unassert'"); | |
6205 | ||
6206 | bp = buf; | |
6207 | ||
6208 | while (is_hor_space[*bp]) | |
6209 | bp++; | |
6210 | ||
6211 | symname = bp; /* remember where it starts */ | |
6212 | sym_length = check_macro_name (bp, "assertion"); | |
6213 | bp += sym_length; | |
6214 | /* #define doesn't do this, but we should. */ | |
6215 | SKIP_WHITE_SPACE (bp); | |
6216 | ||
6217 | /* Lossage will occur if identifiers or control tokens are broken | |
6218 | across lines using backslash. This is not the right place to take | |
0f41302f | 6219 | care of that. */ |
b0bbbd85 RS |
6220 | |
6221 | if (*bp == '(') { | |
6222 | int error_flag = 0; | |
6223 | ||
6224 | bp++; /* skip '(' */ | |
6225 | SKIP_WHITE_SPACE (bp); | |
6226 | ||
6227 | tokens = read_token_list (&bp, limit, &error_flag); | |
6228 | if (error_flag) | |
6229 | return 1; | |
6230 | if (tokens == 0) { | |
6231 | error ("empty token list in `#unassert'"); | |
6232 | return 1; | |
6233 | } | |
6234 | ||
6235 | tokens_specified = 1; | |
6236 | ||
6237 | ++bp; /* skip paren */ | |
6238 | SKIP_WHITE_SPACE (bp); | |
6239 | } | |
6240 | ||
6241 | { | |
6242 | ASSERTION_HASHNODE *hp; | |
6243 | int hashcode = hashf (symname, sym_length, ASSERTION_HASHSIZE); | |
6244 | struct tokenlist_list *tail, *prev; | |
6245 | ||
6246 | hp = assertion_lookup (symname, sym_length, hashcode); | |
6247 | if (hp == NULL) | |
6248 | return 1; | |
6249 | ||
6250 | /* If no token list was specified, then eliminate this assertion | |
6251 | entirely. */ | |
6252 | if (! tokens_specified) { | |
6253 | struct tokenlist_list *next; | |
6254 | for (tail = hp->value; tail; tail = next) { | |
6255 | next = tail->next; | |
6256 | free_token_list (tail->tokens); | |
6257 | free (tail); | |
6258 | } | |
6259 | delete_assertion (hp); | |
6260 | } else { | |
6261 | /* If a list of tokens was given, then delete any matching list. */ | |
6262 | ||
6263 | tail = hp->value; | |
6264 | prev = 0; | |
6265 | while (tail) { | |
6266 | struct tokenlist_list *next = tail->next; | |
6267 | if (compare_token_lists (tail->tokens, tokens)) { | |
6268 | if (prev) | |
6269 | prev->next = next; | |
6270 | else | |
6271 | hp->value = tail->next; | |
6272 | free_token_list (tail->tokens); | |
6273 | free (tail); | |
6274 | } else { | |
6275 | prev = tail; | |
6276 | } | |
6277 | tail = next; | |
6278 | } | |
6279 | } | |
6280 | } | |
6281 | ||
6282 | return 0; | |
6283 | } | |
6284 | \f | |
6285 | /* Test whether there is an assertion named NAME | |
6286 | and optionally whether it has an asserted token list TOKENS. | |
6287 | NAME is not null terminated; its length is SYM_LENGTH. | |
6288 | If TOKENS_SPECIFIED is 0, then don't check for any token list. */ | |
6289 | ||
6290 | int | |
6291 | check_assertion (name, sym_length, tokens_specified, tokens) | |
6292 | U_CHAR *name; | |
6293 | int sym_length; | |
6294 | int tokens_specified; | |
6295 | struct arglist *tokens; | |
6296 | { | |
6297 | ASSERTION_HASHNODE *hp; | |
6298 | int hashcode = hashf (name, sym_length, ASSERTION_HASHSIZE); | |
6299 | ||
6300 | if (pedantic && !instack[indepth].system_header_p) | |
6301 | pedwarn ("ANSI C does not allow testing assertions"); | |
6302 | ||
6303 | hp = assertion_lookup (name, sym_length, hashcode); | |
6304 | if (hp == NULL) | |
6305 | /* It is not an assertion; just return false. */ | |
6306 | return 0; | |
6307 | ||
6308 | /* If no token list was specified, then value is 1. */ | |
6309 | if (! tokens_specified) | |
6310 | return 1; | |
6311 | ||
6312 | { | |
6313 | struct tokenlist_list *tail; | |
6314 | ||
6315 | tail = hp->value; | |
6316 | ||
6317 | /* If a list of tokens was given, | |
6318 | then succeed if the assertion records a matching list. */ | |
6319 | ||
6320 | while (tail) { | |
6321 | if (compare_token_lists (tail->tokens, tokens)) | |
6322 | return 1; | |
6323 | tail = tail->next; | |
6324 | } | |
6325 | ||
6326 | /* Fail if the assertion has no matching list. */ | |
6327 | return 0; | |
6328 | } | |
6329 | } | |
6330 | ||
6331 | /* Compare two lists of tokens for equality including order of tokens. */ | |
6332 | ||
6333 | static int | |
6334 | compare_token_lists (l1, l2) | |
6335 | struct arglist *l1, *l2; | |
6336 | { | |
6337 | while (l1 && l2) { | |
6338 | if (l1->length != l2->length) | |
6339 | return 0; | |
25cbb59e | 6340 | if (bcmp (l1->name, l2->name, l1->length)) |
b0bbbd85 RS |
6341 | return 0; |
6342 | l1 = l1->next; | |
6343 | l2 = l2->next; | |
6344 | } | |
6345 | ||
6346 | /* Succeed if both lists end at the same time. */ | |
6347 | return l1 == l2; | |
6348 | } | |
6349 | \f | |
6350 | /* Read a space-separated list of tokens ending in a close parenthesis. | |
6351 | Return a list of strings, in the order they were written. | |
6352 | (In case of error, return 0 and store -1 in *ERROR_FLAG.) | |
6353 | Parse the text starting at *BPP, and update *BPP. | |
6354 | Don't parse beyond LIMIT. */ | |
6355 | ||
6356 | static struct arglist * | |
6357 | read_token_list (bpp, limit, error_flag) | |
6358 | U_CHAR **bpp; | |
6359 | U_CHAR *limit; | |
6360 | int *error_flag; | |
6361 | { | |
6362 | struct arglist *token_ptrs = 0; | |
6363 | U_CHAR *bp = *bpp; | |
6364 | int depth = 1; | |
6365 | ||
6366 | *error_flag = 0; | |
6367 | ||
6368 | /* Loop over the assertion value tokens. */ | |
6369 | while (depth > 0) { | |
6370 | struct arglist *temp; | |
6371 | int eofp = 0; | |
6372 | U_CHAR *beg = bp; | |
6373 | ||
6374 | /* Find the end of the token. */ | |
6375 | if (*bp == '(') { | |
6376 | bp++; | |
6377 | depth++; | |
6378 | } else if (*bp == ')') { | |
6379 | depth--; | |
6380 | if (depth == 0) | |
6381 | break; | |
6382 | bp++; | |
6383 | } else if (*bp == '"' || *bp == '\'') | |
8d9bfdc5 | 6384 | bp = skip_quoted_string (bp, limit, 0, NULL_PTR, NULL_PTR, &eofp); |
b0bbbd85 RS |
6385 | else |
6386 | while (! is_hor_space[*bp] && *bp != '(' && *bp != ')' | |
6387 | && *bp != '"' && *bp != '\'' && bp != limit) | |
6388 | bp++; | |
6389 | ||
6390 | temp = (struct arglist *) xmalloc (sizeof (struct arglist)); | |
6391 | temp->name = (U_CHAR *) xmalloc (bp - beg + 1); | |
4c9a05bc | 6392 | bcopy ((char *) beg, (char *) temp->name, bp - beg); |
b0bbbd85 RS |
6393 | temp->name[bp - beg] = 0; |
6394 | temp->next = token_ptrs; | |
6395 | token_ptrs = temp; | |
6396 | temp->length = bp - beg; | |
6397 | ||
6398 | SKIP_WHITE_SPACE (bp); | |
6399 | ||
6400 | if (bp >= limit) { | |
6401 | error ("unterminated token sequence in `#assert' or `#unassert'"); | |
6402 | *error_flag = -1; | |
6403 | return 0; | |
6404 | } | |
6405 | } | |
6406 | *bpp = bp; | |
6407 | ||
6408 | /* We accumulated the names in reverse order. | |
6409 | Now reverse them to get the proper order. */ | |
6410 | { | |
6411 | register struct arglist *prev = 0, *this, *next; | |
6412 | for (this = token_ptrs; this; this = next) { | |
6413 | next = this->next; | |
6414 | this->next = prev; | |
6415 | prev = this; | |
6416 | } | |
6417 | return prev; | |
6418 | } | |
6419 | } | |
6420 | ||
6421 | static void | |
6422 | free_token_list (tokens) | |
6423 | struct arglist *tokens; | |
6424 | { | |
6425 | while (tokens) { | |
6426 | struct arglist *next = tokens->next; | |
6427 | free (tokens->name); | |
6428 | free (tokens); | |
6429 | tokens = next; | |
6430 | } | |
6431 | } | |
6432 | \f | |
0f41302f MS |
6433 | /* Install a name in the assertion hash table. |
6434 | ||
6435 | If LEN is >= 0, it is the length of the name. | |
6436 | Otherwise, compute the length by scanning the entire name. | |
6437 | ||
6438 | If HASH is >= 0, it is the precomputed hash code. | |
6439 | Otherwise, compute the hash code. */ | |
6440 | ||
b0bbbd85 RS |
6441 | static ASSERTION_HASHNODE * |
6442 | assertion_install (name, len, hash) | |
6443 | U_CHAR *name; | |
6444 | int len; | |
6445 | int hash; | |
6446 | { | |
6447 | register ASSERTION_HASHNODE *hp; | |
6448 | register int i, bucket; | |
6449 | register U_CHAR *p, *q; | |
6450 | ||
6451 | i = sizeof (ASSERTION_HASHNODE) + len + 1; | |
6452 | hp = (ASSERTION_HASHNODE *) xmalloc (i); | |
6453 | bucket = hash; | |
6454 | hp->bucket_hdr = &assertion_hashtab[bucket]; | |
6455 | hp->next = assertion_hashtab[bucket]; | |
6456 | assertion_hashtab[bucket] = hp; | |
6457 | hp->prev = NULL; | |
6458 | if (hp->next != NULL) | |
6459 | hp->next->prev = hp; | |
6460 | hp->length = len; | |
6461 | hp->value = 0; | |
6462 | hp->name = ((U_CHAR *) hp) + sizeof (ASSERTION_HASHNODE); | |
6463 | p = hp->name; | |
6464 | q = name; | |
6465 | for (i = 0; i < len; i++) | |
6466 | *p++ = *q++; | |
6467 | hp->name[len] = 0; | |
6468 | return hp; | |
6469 | } | |
6470 | ||
0f41302f MS |
6471 | /* Find the most recent hash node for name name (ending with first |
6472 | non-identifier char) installed by install | |
6473 | ||
6474 | If LEN is >= 0, it is the length of the name. | |
6475 | Otherwise, compute the length by scanning the entire name. | |
6476 | ||
6477 | If HASH is >= 0, it is the precomputed hash code. | |
6478 | Otherwise, compute the hash code. */ | |
6479 | ||
b0bbbd85 RS |
6480 | static ASSERTION_HASHNODE * |
6481 | assertion_lookup (name, len, hash) | |
6482 | U_CHAR *name; | |
6483 | int len; | |
6484 | int hash; | |
6485 | { | |
b0bbbd85 RS |
6486 | register ASSERTION_HASHNODE *bucket; |
6487 | ||
6488 | bucket = assertion_hashtab[hash]; | |
6489 | while (bucket) { | |
25cbb59e | 6490 | if (bucket->length == len && bcmp (bucket->name, name, len) == 0) |
b0bbbd85 RS |
6491 | return bucket; |
6492 | bucket = bucket->next; | |
6493 | } | |
6494 | return NULL; | |
6495 | } | |
6496 | ||
6497 | static void | |
6498 | delete_assertion (hp) | |
6499 | ASSERTION_HASHNODE *hp; | |
6500 | { | |
6501 | ||
6502 | if (hp->prev != NULL) | |
6503 | hp->prev->next = hp->next; | |
6504 | if (hp->next != NULL) | |
6505 | hp->next->prev = hp->prev; | |
6506 | ||
0f41302f MS |
6507 | /* Make sure that the bucket chain header that the deleted guy was |
6508 | on points to the right thing afterwards. */ | |
b0bbbd85 RS |
6509 | if (hp == *hp->bucket_hdr) |
6510 | *hp->bucket_hdr = hp->next; | |
6511 | ||
6512 | free (hp); | |
6513 | } | |
6514 | \f | |
6515 | /* | |
adcfa681 | 6516 | * interpret #line directive. Remembers previously seen fnames |
b0bbbd85 RS |
6517 | * in its very own hash table. |
6518 | */ | |
6519 | #define FNAME_HASHSIZE 37 | |
6520 | ||
6521 | static int | |
6522 | do_line (buf, limit, op, keyword) | |
6523 | U_CHAR *buf, *limit; | |
6524 | FILE_BUF *op; | |
6525 | struct directive *keyword; | |
6526 | { | |
6527 | register U_CHAR *bp; | |
6528 | FILE_BUF *ip = &instack[indepth]; | |
6529 | FILE_BUF tem; | |
6530 | int new_lineno; | |
6531 | enum file_change_code file_change = same_file; | |
6532 | ||
6533 | /* Expand any macros. */ | |
6534 | tem = expand_to_temp_buffer (buf, limit, 0, 0); | |
6535 | ||
6536 | /* Point to macroexpanded line, which is null-terminated now. */ | |
6537 | bp = tem.buf; | |
6538 | SKIP_WHITE_SPACE (bp); | |
6539 | ||
6540 | if (!isdigit (*bp)) { | |
adcfa681 | 6541 | error ("invalid format `#line' directive"); |
b0bbbd85 RS |
6542 | return 0; |
6543 | } | |
6544 | ||
6545 | /* The Newline at the end of this line remains to be processed. | |
6546 | To put the next line at the specified line number, | |
6547 | we must store a line number now that is one less. */ | |
25cbb59e | 6548 | new_lineno = atoi ((char *) bp) - 1; |
b0bbbd85 | 6549 | |
bdc680a2 JW |
6550 | /* NEW_LINENO is one less than the actual line number here. */ |
6551 | if (pedantic && new_lineno < 0) | |
adcfa681 | 6552 | pedwarn ("line number out of range in `#line' directive"); |
bdc680a2 | 6553 | |
b0bbbd85 RS |
6554 | /* skip over the line number. */ |
6555 | while (isdigit (*bp)) | |
6556 | bp++; | |
6557 | ||
6558 | #if 0 /* #line 10"foo.c" is supposed to be allowed. */ | |
6559 | if (*bp && !is_space[*bp]) { | |
adcfa681 | 6560 | error ("invalid format `#line' directive"); |
b0bbbd85 RS |
6561 | return; |
6562 | } | |
6563 | #endif | |
6564 | ||
6565 | SKIP_WHITE_SPACE (bp); | |
6566 | ||
6567 | if (*bp == '\"') { | |
6568 | static HASHNODE *fname_table[FNAME_HASHSIZE]; | |
6569 | HASHNODE *hp, **hash_bucket; | |
f7531123 | 6570 | U_CHAR *fname, *p; |
b0bbbd85 RS |
6571 | int fname_length; |
6572 | ||
6573 | fname = ++bp; | |
6574 | ||
f7531123 PE |
6575 | /* Turn the file name, which is a character string literal, |
6576 | into a null-terminated string. Do this in place. */ | |
6577 | p = bp; | |
6578 | for (;;) | |
6579 | switch ((*p++ = *bp++)) { | |
6580 | case '\0': | |
adcfa681 | 6581 | error ("invalid format `#line' directive"); |
f7531123 | 6582 | return 0; |
b0bbbd85 | 6583 | |
f7531123 PE |
6584 | case '\\': |
6585 | { | |
6586 | char *bpc = (char *) bp; | |
047380ca | 6587 | HOST_WIDE_INT c = parse_escape (&bpc, (HOST_WIDE_INT) (U_CHAR) (-1)); |
f7531123 PE |
6588 | bp = (U_CHAR *) bpc; |
6589 | if (c < 0) | |
6590 | p--; | |
6591 | else | |
6592 | p[-1] = c; | |
6593 | } | |
6594 | break; | |
6595 | ||
6596 | case '\"': | |
6597 | p[-1] = 0; | |
6598 | goto fname_done; | |
6599 | } | |
6600 | fname_done: | |
6601 | fname_length = p - fname; | |
b0bbbd85 | 6602 | |
b0bbbd85 RS |
6603 | SKIP_WHITE_SPACE (bp); |
6604 | if (*bp) { | |
bdc680a2 | 6605 | if (pedantic) |
adcfa681 | 6606 | pedwarn ("garbage at end of `#line' directive"); |
b0bbbd85 RS |
6607 | if (*bp == '1') |
6608 | file_change = enter_file; | |
6609 | else if (*bp == '2') | |
6610 | file_change = leave_file; | |
2aa7ec37 RS |
6611 | else if (*bp == '3') |
6612 | ip->system_header_p = 1; | |
65715dea RS |
6613 | else if (*bp == '4') |
6614 | ip->system_header_p = 2; | |
b0bbbd85 | 6615 | else { |
adcfa681 | 6616 | error ("invalid format `#line' directive"); |
b0bbbd85 RS |
6617 | return 0; |
6618 | } | |
6619 | ||
6620 | bp++; | |
6621 | SKIP_WHITE_SPACE (bp); | |
2aa7ec37 RS |
6622 | if (*bp == '3') { |
6623 | ip->system_header_p = 1; | |
6624 | bp++; | |
6625 | SKIP_WHITE_SPACE (bp); | |
6626 | } | |
65715dea RS |
6627 | if (*bp == '4') { |
6628 | ip->system_header_p = 2; | |
6629 | bp++; | |
6630 | SKIP_WHITE_SPACE (bp); | |
6631 | } | |
b0bbbd85 | 6632 | if (*bp) { |
adcfa681 | 6633 | error ("invalid format `#line' directive"); |
b0bbbd85 RS |
6634 | return 0; |
6635 | } | |
6636 | } | |
6637 | ||
6638 | hash_bucket = | |
6639 | &fname_table[hashf (fname, fname_length, FNAME_HASHSIZE)]; | |
6640 | for (hp = *hash_bucket; hp != NULL; hp = hp->next) | |
6641 | if (hp->length == fname_length && | |
25cbb59e | 6642 | bcmp (hp->value.cpval, fname, fname_length) == 0) { |
b0bbbd85 RS |
6643 | ip->nominal_fname = hp->value.cpval; |
6644 | break; | |
6645 | } | |
6646 | if (hp == 0) { | |
6647 | /* Didn't find it; cons up a new one. */ | |
6648 | hp = (HASHNODE *) xcalloc (1, sizeof (HASHNODE) + fname_length + 1); | |
6649 | hp->next = *hash_bucket; | |
6650 | *hash_bucket = hp; | |
6651 | ||
6652 | hp->length = fname_length; | |
6653 | ip->nominal_fname = hp->value.cpval = ((char *) hp) + sizeof (HASHNODE); | |
6654 | bcopy (fname, hp->value.cpval, fname_length); | |
6655 | } | |
6656 | } else if (*bp) { | |
adcfa681 | 6657 | error ("invalid format `#line' directive"); |
b0bbbd85 RS |
6658 | return 0; |
6659 | } | |
6660 | ||
6661 | ip->lineno = new_lineno; | |
adcfa681 | 6662 | output_line_directive (ip, op, 0, file_change); |
b0bbbd85 RS |
6663 | check_expand (op, ip->length - (ip->bufp - ip->buf)); |
6664 | return 0; | |
6665 | } | |
6666 | ||
0f41302f MS |
6667 | /* Remove the definition of a symbol from the symbol table. |
6668 | according to un*x /lib/cpp, it is not an error to undef | |
6669 | something that has no definitions, so it isn't one here either. */ | |
b0bbbd85 RS |
6670 | |
6671 | static int | |
6672 | do_undef (buf, limit, op, keyword) | |
6673 | U_CHAR *buf, *limit; | |
6674 | FILE_BUF *op; | |
6675 | struct directive *keyword; | |
6676 | { | |
6677 | int sym_length; | |
6678 | HASHNODE *hp; | |
6679 | U_CHAR *orig_buf = buf; | |
6680 | ||
adcfa681 | 6681 | /* If this is a precompiler run (with -pcp) pass thru #undef directives. */ |
b0bbbd85 RS |
6682 | if (pcp_outfile && op) |
6683 | pass_thru_directive (buf, limit, op, keyword); | |
6684 | ||
6685 | SKIP_WHITE_SPACE (buf); | |
6686 | sym_length = check_macro_name (buf, "macro"); | |
6687 | ||
6688 | while ((hp = lookup (buf, sym_length, -1)) != NULL) { | |
6689 | /* If we are generating additional info for debugging (with -g) we | |
adcfa681 | 6690 | need to pass through all effective #undef directives. */ |
b0bbbd85 RS |
6691 | if (debug_output && op) |
6692 | pass_thru_directive (orig_buf, limit, op, keyword); | |
6693 | if (hp->type != T_MACRO) | |
6694 | warning ("undefining `%s'", hp->name); | |
6695 | delete_macro (hp); | |
6696 | } | |
6697 | ||
6698 | if (pedantic) { | |
6699 | buf += sym_length; | |
6700 | SKIP_WHITE_SPACE (buf); | |
6701 | if (buf != limit) | |
6702 | pedwarn ("garbage after `#undef' directive"); | |
6703 | } | |
6704 | return 0; | |
6705 | } | |
6706 | \f | |
0f41302f MS |
6707 | /* Report an error detected by the program we are processing. |
6708 | Use the text of the line in the error message. | |
6709 | (We use error because it prints the filename & line#.) */ | |
b0bbbd85 RS |
6710 | |
6711 | static int | |
6712 | do_error (buf, limit, op, keyword) | |
6713 | U_CHAR *buf, *limit; | |
6714 | FILE_BUF *op; | |
6715 | struct directive *keyword; | |
6716 | { | |
6717 | int length = limit - buf; | |
d0691cfb | 6718 | U_CHAR *copy = (U_CHAR *) xmalloc (length + 1); |
4c9a05bc | 6719 | bcopy ((char *) buf, (char *) copy, length); |
b0bbbd85 RS |
6720 | copy[length] = 0; |
6721 | SKIP_WHITE_SPACE (copy); | |
6722 | error ("#error %s", copy); | |
b0bbbd85 RS |
6723 | return 0; |
6724 | } | |
6725 | ||
0f41302f MS |
6726 | /* Report a warning detected by the program we are processing. |
6727 | Use the text of the line in the warning message, then continue. | |
6728 | (We use error because it prints the filename & line#.) */ | |
b0bbbd85 RS |
6729 | |
6730 | static int | |
6731 | do_warning (buf, limit, op, keyword) | |
6732 | U_CHAR *buf, *limit; | |
6733 | FILE_BUF *op; | |
6734 | struct directive *keyword; | |
6735 | { | |
6736 | int length = limit - buf; | |
d0691cfb | 6737 | U_CHAR *copy = (U_CHAR *) xmalloc (length + 1); |
4c9a05bc | 6738 | bcopy ((char *) buf, (char *) copy, length); |
b0bbbd85 RS |
6739 | copy[length] = 0; |
6740 | SKIP_WHITE_SPACE (copy); | |
7cb2a67c | 6741 | warning ("#warning %s", copy); |
b0bbbd85 RS |
6742 | return 0; |
6743 | } | |
6744 | ||
6745 | /* Remember the name of the current file being read from so that we can | |
6746 | avoid ever including it again. */ | |
6747 | ||
25cbb59e | 6748 | static void |
b0bbbd85 RS |
6749 | do_once () |
6750 | { | |
6751 | int i; | |
b0bbbd85 RS |
6752 | |
6753 | for (i = indepth; i >= 0; i--) | |
3e4115b7 RK |
6754 | if (instack[i].inc) { |
6755 | record_control_macro (instack[i].inc, (U_CHAR *) ""); | |
b0bbbd85 RS |
6756 | break; |
6757 | } | |
b0bbbd85 RS |
6758 | } |
6759 | ||
6760 | /* #ident has already been copied to the output file, so just ignore it. */ | |
6761 | ||
6762 | static int | |
25cbb59e | 6763 | do_ident (buf, limit, op, keyword) |
b0bbbd85 | 6764 | U_CHAR *buf, *limit; |
25cbb59e RK |
6765 | FILE_BUF *op; |
6766 | struct directive *keyword; | |
b0bbbd85 | 6767 | { |
a3fb124a RS |
6768 | FILE_BUF trybuf; |
6769 | int len; | |
a3fb124a | 6770 | |
b0bbbd85 RS |
6771 | /* Allow #ident in system headers, since that's not user's fault. */ |
6772 | if (pedantic && !instack[indepth].system_header_p) | |
6773 | pedwarn ("ANSI C does not allow `#ident'"); | |
a3fb124a RS |
6774 | |
6775 | trybuf = expand_to_temp_buffer (buf, limit, 0, 0); | |
6776 | buf = (U_CHAR *) alloca (trybuf.bufp - trybuf.buf + 1); | |
4c9a05bc | 6777 | bcopy ((char *) trybuf.buf, (char *) buf, trybuf.bufp - trybuf.buf); |
a3fb124a RS |
6778 | limit = buf + (trybuf.bufp - trybuf.buf); |
6779 | len = (limit - buf); | |
6780 | free (trybuf.buf); | |
6781 | ||
6782 | /* Output directive name. */ | |
b415f25e | 6783 | check_expand (op, 7); |
4c9a05bc | 6784 | bcopy ("#ident ", (char *) op->bufp, 7); |
a3fb124a RS |
6785 | op->bufp += 7; |
6786 | ||
6787 | /* Output the expanded argument line. */ | |
6788 | check_expand (op, len); | |
4c9a05bc | 6789 | bcopy ((char *) buf, (char *) op->bufp, len); |
a3fb124a RS |
6790 | op->bufp += len; |
6791 | ||
b0bbbd85 RS |
6792 | return 0; |
6793 | } | |
6794 | ||
6795 | /* #pragma and its argument line have already been copied to the output file. | |
789d0ee5 | 6796 | Just check for some recognized pragmas that need validation here. */ |
b0bbbd85 RS |
6797 | |
6798 | static int | |
25cbb59e | 6799 | do_pragma (buf, limit, op, keyword) |
b0bbbd85 | 6800 | U_CHAR *buf, *limit; |
25cbb59e RK |
6801 | FILE_BUF *op; |
6802 | struct directive *keyword; | |
b0bbbd85 | 6803 | { |
c03413c7 | 6804 | SKIP_WHITE_SPACE (buf); |
25cbb59e | 6805 | if (!strncmp ((char *) buf, "once", 4)) { |
71c4681d RS |
6806 | /* Allow #pragma once in system headers, since that's not the user's |
6807 | fault. */ | |
6808 | if (!instack[indepth].system_header_p) | |
6809 | warning ("`#pragma once' is obsolete"); | |
b0bbbd85 RS |
6810 | do_once (); |
6811 | } | |
789d0ee5 | 6812 | |
25cbb59e | 6813 | if (!strncmp ((char *) buf, "implementation", 14)) { |
789d0ee5 RS |
6814 | /* Be quiet about `#pragma implementation' for a file only if it hasn't |
6815 | been included yet. */ | |
3e4115b7 RK |
6816 | |
6817 | int h; | |
6818 | U_CHAR *p = buf + 14, *fname; | |
789d0ee5 RS |
6819 | SKIP_WHITE_SPACE (p); |
6820 | if (*p == '\n' || *p != '\"') | |
6821 | return 0; | |
6822 | ||
6823 | fname = p + 1; | |
25cbb59e | 6824 | if ((p = (U_CHAR *) index ((char *) fname, '\"'))) |
789d0ee5 RS |
6825 | *p = '\0'; |
6826 | ||
3e4115b7 RK |
6827 | for (h = 0; h < INCLUDE_HASHSIZE; h++) { |
6828 | struct include_file *inc; | |
6829 | for (inc = include_hashtab[h]; inc; inc = inc->next) { | |
6830 | if (!strcmp (base_name (inc->fname), (char *) fname)) { | |
6831 | warning ("`#pragma implementation' for \"%s\" appears after its #include",fname); | |
6832 | return 0; | |
6833 | } | |
6834 | } | |
789d0ee5 RS |
6835 | } |
6836 | } | |
b0bbbd85 RS |
6837 | return 0; |
6838 | } | |
6839 | ||
6840 | #if 0 | |
6841 | /* This was a fun hack, but #pragma seems to start to be useful. | |
6842 | By failing to recognize it, we pass it through unchanged to cc1. */ | |
6843 | ||
0f41302f MS |
6844 | /* The behavior of the #pragma directive is implementation defined. |
6845 | this implementation defines it as follows. */ | |
b0bbbd85 RS |
6846 | |
6847 | static int | |
6848 | do_pragma () | |
6849 | { | |
6850 | close (0); | |
6851 | if (open ("/dev/tty", O_RDONLY, 0666) != 0) | |
6852 | goto nope; | |
6853 | close (1); | |
6854 | if (open ("/dev/tty", O_WRONLY, 0666) != 1) | |
6855 | goto nope; | |
6856 | execl ("/usr/games/hack", "#pragma", 0); | |
6857 | execl ("/usr/games/rogue", "#pragma", 0); | |
6858 | execl ("/usr/new/emacs", "-f", "hanoi", "9", "-kill", 0); | |
6859 | execl ("/usr/local/emacs", "-f", "hanoi", "9", "-kill", 0); | |
6860 | nope: | |
6861 | fatal ("You are in a maze of twisty compiler features, all different"); | |
6862 | } | |
6863 | #endif | |
6864 | ||
25cbb59e RK |
6865 | #ifdef SCCS_DIRECTIVE |
6866 | ||
b0bbbd85 RS |
6867 | /* Just ignore #sccs, on systems where we define it at all. */ |
6868 | ||
6869 | static int | |
25cbb59e RK |
6870 | do_sccs (buf, limit, op, keyword) |
6871 | U_CHAR *buf, *limit; | |
6872 | FILE_BUF *op; | |
6873 | struct directive *keyword; | |
b0bbbd85 RS |
6874 | { |
6875 | if (pedantic) | |
6876 | pedwarn ("ANSI C does not allow `#sccs'"); | |
6877 | return 0; | |
6878 | } | |
25cbb59e RK |
6879 | |
6880 | #endif /* defined (SCCS_DIRECTIVE) */ | |
b0bbbd85 | 6881 | \f |
0f41302f MS |
6882 | /* Handle #if directive by |
6883 | 1) inserting special `defined' keyword into the hash table | |
6884 | that gets turned into 0 or 1 by special_symbol (thus, | |
6885 | if the luser has a symbol called `defined' already, it won't | |
6886 | work inside the #if directive) | |
6887 | 2) rescan the input into a temporary output buffer | |
6888 | 3) pass the output buffer to the yacc parser and collect a value | |
6889 | 4) clean up the mess left from steps 1 and 2. | |
6890 | 5) call conditional_skip to skip til the next #endif (etc.), | |
6891 | or not, depending on the value from step 3. */ | |
b0bbbd85 RS |
6892 | |
6893 | static int | |
6894 | do_if (buf, limit, op, keyword) | |
6895 | U_CHAR *buf, *limit; | |
6896 | FILE_BUF *op; | |
6897 | struct directive *keyword; | |
6898 | { | |
047380ca | 6899 | HOST_WIDE_INT value; |
b0bbbd85 RS |
6900 | FILE_BUF *ip = &instack[indepth]; |
6901 | ||
6902 | value = eval_if_expression (buf, limit - buf); | |
bbd4b75b | 6903 | conditional_skip (ip, value == 0, T_IF, NULL_PTR, op); |
b0bbbd85 RS |
6904 | return 0; |
6905 | } | |
6906 | ||
0f41302f MS |
6907 | /* Handle a #elif directive by not changing if_stack either. |
6908 | see the comment above do_else. */ | |
b0bbbd85 RS |
6909 | |
6910 | static int | |
6911 | do_elif (buf, limit, op, keyword) | |
6912 | U_CHAR *buf, *limit; | |
6913 | FILE_BUF *op; | |
6914 | struct directive *keyword; | |
6915 | { | |
047380ca | 6916 | HOST_WIDE_INT value; |
b0bbbd85 RS |
6917 | FILE_BUF *ip = &instack[indepth]; |
6918 | ||
6919 | if (if_stack == instack[indepth].if_stack) { | |
6920 | error ("`#elif' not within a conditional"); | |
6921 | return 0; | |
6922 | } else { | |
6923 | if (if_stack->type != T_IF && if_stack->type != T_ELIF) { | |
6924 | error ("`#elif' after `#else'"); | |
6925 | fprintf (stderr, " (matches line %d", if_stack->lineno); | |
6926 | if (if_stack->fname != NULL && ip->fname != NULL && | |
6927 | strcmp (if_stack->fname, ip->nominal_fname) != 0) | |
6928 | fprintf (stderr, ", file %s", if_stack->fname); | |
6929 | fprintf (stderr, ")\n"); | |
6930 | } | |
6931 | if_stack->type = T_ELIF; | |
6932 | } | |
6933 | ||
6934 | if (if_stack->if_succeeded) | |
bbd4b75b | 6935 | skip_if_group (ip, 0, op); |
b0bbbd85 RS |
6936 | else { |
6937 | value = eval_if_expression (buf, limit - buf); | |
6938 | if (value == 0) | |
bbd4b75b | 6939 | skip_if_group (ip, 0, op); |
b0bbbd85 RS |
6940 | else { |
6941 | ++if_stack->if_succeeded; /* continue processing input */ | |
adcfa681 | 6942 | output_line_directive (ip, op, 1, same_file); |
b0bbbd85 RS |
6943 | } |
6944 | } | |
6945 | return 0; | |
6946 | } | |
6947 | ||
0f41302f MS |
6948 | /* Evaluate a #if expression in BUF, of length LENGTH, then parse the |
6949 | result as a C expression and return the value as an int. */ | |
6950 | ||
047380ca | 6951 | static HOST_WIDE_INT |
b0bbbd85 RS |
6952 | eval_if_expression (buf, length) |
6953 | U_CHAR *buf; | |
6954 | int length; | |
6955 | { | |
6956 | FILE_BUF temp_obuf; | |
6957 | HASHNODE *save_defined; | |
047380ca | 6958 | HOST_WIDE_INT value; |
b0bbbd85 | 6959 | |
25cbb59e RK |
6960 | save_defined = install ((U_CHAR *) "defined", -1, T_SPEC_DEFINED, |
6961 | NULL_PTR, -1); | |
b0bbbd85 RS |
6962 | pcp_inside_if = 1; |
6963 | temp_obuf = expand_to_temp_buffer (buf, buf + length, 0, 1); | |
6964 | pcp_inside_if = 0; | |
6965 | delete_macro (save_defined); /* clean up special symbol */ | |
6966 | ||
b71c5c9c | 6967 | temp_obuf.buf[temp_obuf.length] = '\n'; |
25cbb59e | 6968 | value = parse_c_expression ((char *) temp_obuf.buf); |
b0bbbd85 RS |
6969 | |
6970 | free (temp_obuf.buf); | |
6971 | ||
6972 | return value; | |
6973 | } | |
6974 | ||
0f41302f MS |
6975 | /* routine to handle ifdef/ifndef. Try to look up the symbol, then do |
6976 | or don't skip to the #endif/#else/#elif depending on what directive | |
6977 | is actually being processed. */ | |
b0bbbd85 RS |
6978 | |
6979 | static int | |
6980 | do_xifdef (buf, limit, op, keyword) | |
6981 | U_CHAR *buf, *limit; | |
6982 | FILE_BUF *op; | |
6983 | struct directive *keyword; | |
6984 | { | |
6985 | int skip; | |
6986 | FILE_BUF *ip = &instack[indepth]; | |
6987 | U_CHAR *end; | |
6988 | int start_of_file = 0; | |
6989 | U_CHAR *control_macro = 0; | |
6990 | ||
6991 | /* Detect a #ifndef at start of file (not counting comments). */ | |
6992 | if (ip->fname != 0 && keyword->type == T_IFNDEF) { | |
6993 | U_CHAR *p = ip->buf; | |
6994 | while (p != directive_start) { | |
d0691cfb | 6995 | U_CHAR c = *p++; |
49df5f37 RS |
6996 | if (is_space[c]) |
6997 | ; | |
dec5c86b RK |
6998 | /* Make no special provision for backslash-newline here; this is |
6999 | slower if backslash-newlines are present, but it's correct, | |
7000 | and it's not worth it to tune for the rare backslash-newline. */ | |
7001 | else if (c == '/' | |
23f15b0c | 7002 | && (*p == '*' || (cplusplus_comments && *p == '/'))) { |
49df5f37 | 7003 | /* Skip this comment. */ |
2af5e9e2 | 7004 | int junk = 0; |
49df5f37 RS |
7005 | U_CHAR *save_bufp = ip->bufp; |
7006 | ip->bufp = p + 1; | |
7007 | p = skip_to_end_of_comment (ip, &junk, 1); | |
7008 | ip->bufp = save_bufp; | |
7009 | } else { | |
b0bbbd85 RS |
7010 | goto fail; |
7011 | } | |
7012 | } | |
7013 | /* If we get here, this conditional is the beginning of the file. */ | |
7014 | start_of_file = 1; | |
7015 | fail: ; | |
7016 | } | |
7017 | ||
7018 | /* Discard leading and trailing whitespace. */ | |
7019 | SKIP_WHITE_SPACE (buf); | |
7020 | while (limit != buf && is_hor_space[limit[-1]]) limit--; | |
7021 | ||
7022 | /* Find the end of the identifier at the beginning. */ | |
7023 | for (end = buf; is_idchar[*end]; end++); | |
7024 | ||
7025 | if (end == buf) { | |
7026 | skip = (keyword->type == T_IFDEF); | |
7027 | if (! traditional) | |
7028 | pedwarn (end == limit ? "`#%s' with no argument" | |
7029 | : "`#%s' argument starts with punctuation", | |
7030 | keyword->name); | |
7031 | } else { | |
7032 | HASHNODE *hp; | |
7033 | ||
e2056677 RK |
7034 | if (! traditional) { |
7035 | if (isdigit (buf[0])) | |
7036 | pedwarn ("`#%s' argument starts with a digit", keyword->name); | |
7037 | else if (end != limit) | |
7038 | pedwarn ("garbage at end of `#%s' argument", keyword->name); | |
7039 | } | |
b0bbbd85 RS |
7040 | |
7041 | hp = lookup (buf, end-buf, -1); | |
7042 | ||
7043 | if (pcp_outfile) { | |
7044 | /* Output a precondition for this macro. */ | |
4f845465 RK |
7045 | if (hp && |
7046 | (hp->type == T_CONST | |
7047 | || (hp->type == T_MACRO && hp->value.defn->predefined))) | |
ad0c9fa1 | 7048 | fprintf (pcp_outfile, "#define %s\n", hp->name); |
b0bbbd85 RS |
7049 | else { |
7050 | U_CHAR *cp = buf; | |
ad0c9fa1 | 7051 | fprintf (pcp_outfile, "#undef "); |
b0bbbd85 RS |
7052 | while (is_idchar[*cp]) /* Ick! */ |
7053 | fputc (*cp++, pcp_outfile); | |
7054 | putc ('\n', pcp_outfile); | |
7055 | } | |
7056 | } | |
7057 | ||
7058 | skip = (hp == NULL) ^ (keyword->type == T_IFNDEF); | |
7059 | if (start_of_file && !skip) { | |
7060 | control_macro = (U_CHAR *) xmalloc (end - buf + 1); | |
4c9a05bc | 7061 | bcopy ((char *) buf, (char *) control_macro, end - buf); |
b0bbbd85 RS |
7062 | control_macro[end - buf] = 0; |
7063 | } | |
7064 | } | |
7065 | ||
bbd4b75b | 7066 | conditional_skip (ip, skip, T_IF, control_macro, op); |
b0bbbd85 RS |
7067 | return 0; |
7068 | } | |
7069 | ||
7070 | /* Push TYPE on stack; then, if SKIP is nonzero, skip ahead. | |
7071 | If this is a #ifndef starting at the beginning of a file, | |
7072 | CONTROL_MACRO is the macro name tested by the #ifndef. | |
7073 | Otherwise, CONTROL_MACRO is 0. */ | |
7074 | ||
7075 | static void | |
bbd4b75b | 7076 | conditional_skip (ip, skip, type, control_macro, op) |
b0bbbd85 RS |
7077 | FILE_BUF *ip; |
7078 | int skip; | |
7079 | enum node_type type; | |
7080 | U_CHAR *control_macro; | |
bbd4b75b | 7081 | FILE_BUF *op; |
b0bbbd85 RS |
7082 | { |
7083 | IF_STACK_FRAME *temp; | |
7084 | ||
7085 | temp = (IF_STACK_FRAME *) xcalloc (1, sizeof (IF_STACK_FRAME)); | |
7086 | temp->fname = ip->nominal_fname; | |
7087 | temp->lineno = ip->lineno; | |
7088 | temp->next = if_stack; | |
7089 | temp->control_macro = control_macro; | |
7090 | if_stack = temp; | |
7091 | ||
7092 | if_stack->type = type; | |
7093 | ||
7094 | if (skip != 0) { | |
bbd4b75b | 7095 | skip_if_group (ip, 0, op); |
b0bbbd85 RS |
7096 | return; |
7097 | } else { | |
7098 | ++if_stack->if_succeeded; | |
adcfa681 | 7099 | output_line_directive (ip, &outbuf, 1, same_file); |
b0bbbd85 RS |
7100 | } |
7101 | } | |
7102 | ||
0f41302f MS |
7103 | /* Skip to #endif, #else, or #elif. adjust line numbers, etc. |
7104 | Leaves input ptr at the sharp sign found. | |
7105 | If ANY is nonzero, return at next directive of any sort. */ | |
7106 | ||
b0bbbd85 | 7107 | static void |
bbd4b75b | 7108 | skip_if_group (ip, any, op) |
b0bbbd85 RS |
7109 | FILE_BUF *ip; |
7110 | int any; | |
bbd4b75b | 7111 | FILE_BUF *op; |
b0bbbd85 RS |
7112 | { |
7113 | register U_CHAR *bp = ip->bufp, *cp; | |
7114 | register U_CHAR *endb = ip->buf + ip->length; | |
7115 | struct directive *kt; | |
7116 | IF_STACK_FRAME *save_if_stack = if_stack; /* don't pop past here */ | |
7117 | U_CHAR *beg_of_line = bp; | |
7118 | register int ident_length; | |
7119 | U_CHAR *ident, *after_ident; | |
bbd4b75b RS |
7120 | /* Save info about where the group starts. */ |
7121 | U_CHAR *beg_of_group = bp; | |
7122 | int beg_lineno = ip->lineno; | |
7123 | ||
7124 | if (output_conditionals && op != 0) { | |
7125 | char *ptr = "#failed\n"; | |
7126 | int len = strlen (ptr); | |
7127 | ||
7128 | if (op->bufp > op->buf && op->bufp[-1] != '\n') | |
7129 | { | |
7130 | *op->bufp++ = '\n'; | |
7131 | op->lineno++; | |
7132 | } | |
7133 | check_expand (op, len); | |
7134 | bcopy (ptr, (char *) op->bufp, len); | |
7135 | op->bufp += len; | |
7136 | op->lineno++; | |
adcfa681 | 7137 | output_line_directive (ip, op, 1, 0); |
bbd4b75b | 7138 | } |
b0bbbd85 RS |
7139 | |
7140 | while (bp < endb) { | |
7141 | switch (*bp++) { | |
7142 | case '/': /* possible comment */ | |
7143 | if (*bp == '\\' && bp[1] == '\n') | |
7144 | newline_fix (bp); | |
7145 | if (*bp == '*' | |
eda5fa7b | 7146 | || (cplusplus_comments && *bp == '/')) { |
b0bbbd85 | 7147 | ip->bufp = ++bp; |
2aa7ec37 | 7148 | bp = skip_to_end_of_comment (ip, &ip->lineno, 0); |
b0bbbd85 RS |
7149 | } |
7150 | break; | |
7151 | case '\"': | |
7152 | case '\'': | |
8d9bfdc5 RK |
7153 | bp = skip_quoted_string (bp - 1, endb, ip->lineno, &ip->lineno, |
7154 | NULL_PTR, NULL_PTR); | |
b0bbbd85 RS |
7155 | break; |
7156 | case '\\': | |
7157 | /* Char after backslash loses its special meaning. */ | |
7158 | if (bp < endb) { | |
7159 | if (*bp == '\n') | |
7160 | ++ip->lineno; /* But do update the line-count. */ | |
7161 | bp++; | |
7162 | } | |
7163 | break; | |
7164 | case '\n': | |
7165 | ++ip->lineno; | |
7166 | beg_of_line = bp; | |
7167 | break; | |
91dbf5e7 RK |
7168 | case '%': |
7169 | if (beg_of_line == 0 || traditional) | |
7170 | break; | |
b0bbbd85 | 7171 | ip->bufp = bp - 1; |
91dbf5e7 RK |
7172 | while (bp[0] == '\\' && bp[1] == '\n') |
7173 | bp += 2; | |
7174 | if (*bp == ':') | |
5bdc1512 | 7175 | goto sharp_token; |
91dbf5e7 RK |
7176 | break; |
7177 | case '#': | |
b0bbbd85 RS |
7178 | /* # keyword: a # must be first nonblank char on the line */ |
7179 | if (beg_of_line == 0) | |
7180 | break; | |
91dbf5e7 | 7181 | ip->bufp = bp - 1; |
5bdc1512 | 7182 | sharp_token: |
b0bbbd85 RS |
7183 | /* Scan from start of line, skipping whitespace, comments |
7184 | and backslash-newlines, and see if we reach this #. | |
7185 | If not, this # is not special. */ | |
7186 | bp = beg_of_line; | |
78af79ab | 7187 | /* If -traditional, require # to be at beginning of line. */ |
91dbf5e7 | 7188 | if (!traditional) { |
78af79ab RK |
7189 | while (1) { |
7190 | if (is_hor_space[*bp]) | |
b0bbbd85 | 7191 | bp++; |
78af79ab RK |
7192 | else if (*bp == '\\' && bp[1] == '\n') |
7193 | bp += 2; | |
7194 | else if (*bp == '/' && bp[1] == '*') { | |
7195 | bp += 2; | |
7196 | while (!(*bp == '*' && bp[1] == '/')) | |
7197 | bp++; | |
7198 | bp += 2; | |
78af79ab | 7199 | } |
80512db7 JW |
7200 | /* There is no point in trying to deal with C++ // comments here, |
7201 | because if there is one, then this # must be part of the | |
7202 | comment and we would never reach here. */ | |
78af79ab RK |
7203 | else break; |
7204 | } | |
91dbf5e7 | 7205 | } |
b0bbbd85 RS |
7206 | if (bp != ip->bufp) { |
7207 | bp = ip->bufp + 1; /* Reset bp to after the #. */ | |
7208 | break; | |
7209 | } | |
7210 | ||
7211 | bp = ip->bufp + 1; /* Point after the '#' */ | |
91dbf5e7 RK |
7212 | if (ip->bufp[0] == '%') { |
7213 | /* Skip past the ':' again. */ | |
7214 | while (*bp == '\\') { | |
7215 | ip->lineno++; | |
7216 | bp += 2; | |
7217 | } | |
7218 | bp++; | |
7219 | } | |
b0bbbd85 RS |
7220 | |
7221 | /* Skip whitespace and \-newline. */ | |
7222 | while (1) { | |
7223 | if (is_hor_space[*bp]) | |
7224 | bp++; | |
7225 | else if (*bp == '\\' && bp[1] == '\n') | |
7226 | bp += 2; | |
3e4115b7 RK |
7227 | else if (*bp == '/') { |
7228 | if (bp[1] == '*') { | |
7229 | for (bp += 2; ; bp++) { | |
7230 | if (*bp == '\n') | |
7231 | ip->lineno++; | |
7232 | else if (*bp == '*') { | |
7233 | if (bp[-1] == '/' && warn_comments) | |
7234 | warning ("`/*' within comment"); | |
7235 | if (bp[1] == '/') | |
7236 | break; | |
7237 | } | |
7238 | } | |
7239 | bp += 2; | |
7240 | } else if (bp[1] == '/' && cplusplus_comments) { | |
7241 | for (bp += 2; ; bp++) { | |
7242 | if (*bp == '\n') { | |
7243 | if (bp[-1] != '\\') | |
7244 | break; | |
7245 | if (warn_comments) | |
7246 | warning ("multiline `//' comment"); | |
7247 | ip->lineno++; | |
7248 | } | |
7249 | } | |
7250 | } else | |
7251 | break; | |
7252 | } else | |
7253 | break; | |
b0bbbd85 RS |
7254 | } |
7255 | ||
7256 | cp = bp; | |
7257 | ||
7258 | /* Now find end of directive name. | |
7259 | If we encounter a backslash-newline, exchange it with any following | |
7260 | symbol-constituents so that we end up with a contiguous name. */ | |
7261 | ||
7262 | while (1) { | |
7263 | if (is_idchar[*bp]) | |
7264 | bp++; | |
7265 | else { | |
7266 | if (*bp == '\\' && bp[1] == '\n') | |
7267 | name_newline_fix (bp); | |
7268 | if (is_idchar[*bp]) | |
7269 | bp++; | |
7270 | else break; | |
7271 | } | |
7272 | } | |
7273 | ident_length = bp - cp; | |
7274 | ident = cp; | |
7275 | after_ident = bp; | |
7276 | ||
7277 | /* A line of just `#' becomes blank. */ | |
7278 | ||
7279 | if (ident_length == 0 && *after_ident == '\n') { | |
7280 | continue; | |
7281 | } | |
7282 | ||
7283 | if (ident_length == 0 || !is_idstart[*ident]) { | |
7284 | U_CHAR *p = ident; | |
7285 | while (is_idchar[*p]) { | |
7286 | if (*p < '0' || *p > '9') | |
7287 | break; | |
7288 | p++; | |
7289 | } | |
7290 | /* Handle # followed by a line number. */ | |
7291 | if (p != ident && !is_idchar[*p]) { | |
7292 | if (pedantic) | |
7293 | pedwarn ("`#' followed by integer"); | |
7294 | continue; | |
7295 | } | |
7296 | ||
7297 | /* Avoid error for `###' and similar cases unless -pedantic. */ | |
7298 | if (p == ident) { | |
7299 | while (*p == '#' || is_hor_space[*p]) p++; | |
7300 | if (*p == '\n') { | |
7301 | if (pedantic && !lang_asm) | |
adcfa681 | 7302 | pedwarn ("invalid preprocessing directive"); |
b0bbbd85 RS |
7303 | continue; |
7304 | } | |
7305 | } | |
7306 | ||
7307 | if (!lang_asm && pedantic) | |
adcfa681 | 7308 | pedwarn ("invalid preprocessing directive name"); |
b0bbbd85 RS |
7309 | continue; |
7310 | } | |
7311 | ||
7312 | for (kt = directive_table; kt->length >= 0; kt++) { | |
7313 | IF_STACK_FRAME *temp; | |
7314 | if (ident_length == kt->length | |
25cbb59e | 7315 | && bcmp (cp, kt->name, kt->length) == 0) { |
b0bbbd85 RS |
7316 | /* If we are asked to return on next directive, do so now. */ |
7317 | if (any) | |
bbd4b75b | 7318 | goto done; |
b0bbbd85 RS |
7319 | |
7320 | switch (kt->type) { | |
7321 | case T_IF: | |
7322 | case T_IFDEF: | |
7323 | case T_IFNDEF: | |
7324 | temp = (IF_STACK_FRAME *) xcalloc (1, sizeof (IF_STACK_FRAME)); | |
7325 | temp->next = if_stack; | |
7326 | if_stack = temp; | |
7327 | temp->lineno = ip->lineno; | |
7328 | temp->fname = ip->nominal_fname; | |
7329 | temp->type = kt->type; | |
7330 | break; | |
7331 | case T_ELSE: | |
7332 | case T_ENDIF: | |
7333 | if (pedantic && if_stack != save_if_stack) | |
35b28a7a | 7334 | validate_else (bp, endb); |
b0bbbd85 RS |
7335 | case T_ELIF: |
7336 | if (if_stack == instack[indepth].if_stack) { | |
7337 | error ("`#%s' not within a conditional", kt->name); | |
7338 | break; | |
7339 | } | |
7340 | else if (if_stack == save_if_stack) | |
bbd4b75b | 7341 | goto done; /* found what we came for */ |
b0bbbd85 RS |
7342 | |
7343 | if (kt->type != T_ENDIF) { | |
7344 | if (if_stack->type == T_ELSE) | |
7345 | error ("`#else' or `#elif' after `#else'"); | |
7346 | if_stack->type = kt->type; | |
7347 | break; | |
7348 | } | |
7349 | ||
7350 | temp = if_stack; | |
7351 | if_stack = if_stack->next; | |
7352 | free (temp); | |
7353 | break; | |
25cbb59e RK |
7354 | |
7355 | default: | |
7356 | break; | |
b0bbbd85 RS |
7357 | } |
7358 | break; | |
7359 | } | |
7360 | } | |
7361 | /* Don't let erroneous code go by. */ | |
7362 | if (kt->length < 0 && !lang_asm && pedantic) | |
adcfa681 | 7363 | pedwarn ("invalid preprocessing directive name"); |
b0bbbd85 RS |
7364 | } |
7365 | } | |
bbd4b75b | 7366 | |
b0bbbd85 RS |
7367 | ip->bufp = bp; |
7368 | /* after this returns, rescan will exit because ip->bufp | |
7369 | now points to the end of the buffer. | |
7370 | rescan is responsible for the error message also. */ | |
bbd4b75b RS |
7371 | |
7372 | done: | |
7373 | if (output_conditionals && op != 0) { | |
7374 | char *ptr = "#endfailed\n"; | |
7375 | int len = strlen (ptr); | |
7376 | ||
7377 | if (op->bufp > op->buf && op->bufp[-1] != '\n') | |
7378 | { | |
7379 | *op->bufp++ = '\n'; | |
7380 | op->lineno++; | |
7381 | } | |
7382 | check_expand (op, beg_of_line - beg_of_group); | |
7383 | bcopy ((char *) beg_of_group, (char *) op->bufp, | |
7384 | beg_of_line - beg_of_group); | |
7385 | op->bufp += beg_of_line - beg_of_group; | |
7386 | op->lineno += ip->lineno - beg_lineno; | |
7387 | check_expand (op, len); | |
7388 | bcopy (ptr, (char *) op->bufp, len); | |
7389 | op->bufp += len; | |
7390 | op->lineno++; | |
7391 | } | |
b0bbbd85 RS |
7392 | } |
7393 | ||
0f41302f MS |
7394 | /* Handle a #else directive. Do this by just continuing processing |
7395 | without changing if_stack ; this is so that the error message | |
7396 | for missing #endif's etc. will point to the original #if. It | |
7397 | is possible that something different would be better. */ | |
b0bbbd85 RS |
7398 | |
7399 | static int | |
7400 | do_else (buf, limit, op, keyword) | |
7401 | U_CHAR *buf, *limit; | |
7402 | FILE_BUF *op; | |
7403 | struct directive *keyword; | |
7404 | { | |
7405 | FILE_BUF *ip = &instack[indepth]; | |
7406 | ||
7407 | if (pedantic) { | |
7408 | SKIP_WHITE_SPACE (buf); | |
7409 | if (buf != limit) | |
7410 | pedwarn ("text following `#else' violates ANSI standard"); | |
7411 | } | |
7412 | ||
7413 | if (if_stack == instack[indepth].if_stack) { | |
7414 | error ("`#else' not within a conditional"); | |
7415 | return 0; | |
7416 | } else { | |
7417 | /* #ifndef can't have its special treatment for containing the whole file | |
7418 | if it has a #else clause. */ | |
7419 | if_stack->control_macro = 0; | |
7420 | ||
7421 | if (if_stack->type != T_IF && if_stack->type != T_ELIF) { | |
7422 | error ("`#else' after `#else'"); | |
7423 | fprintf (stderr, " (matches line %d", if_stack->lineno); | |
7424 | if (strcmp (if_stack->fname, ip->nominal_fname) != 0) | |
7425 | fprintf (stderr, ", file %s", if_stack->fname); | |
7426 | fprintf (stderr, ")\n"); | |
7427 | } | |
7428 | if_stack->type = T_ELSE; | |
7429 | } | |
7430 | ||
7431 | if (if_stack->if_succeeded) | |
bbd4b75b | 7432 | skip_if_group (ip, 0, op); |
b0bbbd85 RS |
7433 | else { |
7434 | ++if_stack->if_succeeded; /* continue processing input */ | |
adcfa681 | 7435 | output_line_directive (ip, op, 1, same_file); |
b0bbbd85 RS |
7436 | } |
7437 | return 0; | |
7438 | } | |
7439 | ||
0f41302f | 7440 | /* Unstack after #endif directive. */ |
b0bbbd85 RS |
7441 | |
7442 | static int | |
7443 | do_endif (buf, limit, op, keyword) | |
7444 | U_CHAR *buf, *limit; | |
7445 | FILE_BUF *op; | |
7446 | struct directive *keyword; | |
7447 | { | |
7448 | if (pedantic) { | |
7449 | SKIP_WHITE_SPACE (buf); | |
7450 | if (buf != limit) | |
7451 | pedwarn ("text following `#endif' violates ANSI standard"); | |
7452 | } | |
7453 | ||
7454 | if (if_stack == instack[indepth].if_stack) | |
7455 | error ("unbalanced `#endif'"); | |
7456 | else { | |
7457 | IF_STACK_FRAME *temp = if_stack; | |
7458 | if_stack = if_stack->next; | |
7459 | if (temp->control_macro != 0) { | |
7460 | /* This #endif matched a #ifndef at the start of the file. | |
7461 | See if it is at the end of the file. */ | |
7462 | FILE_BUF *ip = &instack[indepth]; | |
7463 | U_CHAR *p = ip->bufp; | |
7464 | U_CHAR *ep = ip->buf + ip->length; | |
7465 | ||
7466 | while (p != ep) { | |
7467 | U_CHAR c = *p++; | |
c03413c7 | 7468 | if (!is_space[c]) { |
dec5c86b | 7469 | if (c == '/' |
23f15b0c | 7470 | && (*p == '*' || (cplusplus_comments && *p == '/'))) { |
b0bbbd85 | 7471 | /* Skip this comment. */ |
2af5e9e2 | 7472 | int junk = 0; |
b0bbbd85 RS |
7473 | U_CHAR *save_bufp = ip->bufp; |
7474 | ip->bufp = p + 1; | |
2aa7ec37 | 7475 | p = skip_to_end_of_comment (ip, &junk, 1); |
b0bbbd85 | 7476 | ip->bufp = save_bufp; |
c03413c7 RK |
7477 | } else |
7478 | goto fail; | |
b0bbbd85 RS |
7479 | } |
7480 | } | |
7481 | /* If we get here, this #endif ends a #ifndef | |
7482 | that contains all of the file (aside from whitespace). | |
7483 | Arrange not to include the file again | |
42e2194b RK |
7484 | if the macro that was tested is defined. |
7485 | ||
7486 | Do not do this for the top-level file in a -include or any | |
7487 | file in a -imacros. */ | |
7488 | if (indepth != 0 | |
7489 | && ! (indepth == 1 && no_record_file) | |
7490 | && ! (no_record_file && no_output)) | |
3e4115b7 | 7491 | record_control_macro (ip->inc, temp->control_macro); |
b0bbbd85 RS |
7492 | fail: ; |
7493 | } | |
7494 | free (temp); | |
adcfa681 | 7495 | output_line_directive (&instack[indepth], op, 1, same_file); |
b0bbbd85 RS |
7496 | } |
7497 | return 0; | |
7498 | } | |
7499 | ||
7500 | /* When an #else or #endif is found while skipping failed conditional, | |
7501 | if -pedantic was specified, this is called to warn about text after | |
0f41302f MS |
7502 | the directive name. P points to the first char after the directive |
7503 | name. */ | |
b0bbbd85 RS |
7504 | |
7505 | static void | |
35b28a7a | 7506 | validate_else (p, limit) |
b0bbbd85 | 7507 | register U_CHAR *p; |
35b28a7a | 7508 | register U_CHAR *limit; |
b0bbbd85 RS |
7509 | { |
7510 | /* Advance P over whitespace and comments. */ | |
7511 | while (1) { | |
35b28a7a | 7512 | while (*p == '\\' && p[1] == '\n') |
b0bbbd85 RS |
7513 | p += 2; |
7514 | if (is_hor_space[*p]) | |
7515 | p++; | |
7516 | else if (*p == '/') { | |
35b28a7a | 7517 | while (p[1] == '\\' && p[2] == '\n') |
b0bbbd85 | 7518 | p += 2; |
35b28a7a | 7519 | if (p[1] == '*') { |
b0bbbd85 RS |
7520 | /* Don't bother warning about unterminated comments |
7521 | since that will happen later. Just be sure to exit. */ | |
35b28a7a PE |
7522 | for (p += 2; ; p++) { |
7523 | if (p == limit) | |
7524 | return; | |
7525 | if (*p == '*') { | |
7526 | while (p[1] == '\\' && p[2] == '\n') | |
7527 | p += 2; | |
7528 | if (p[1] == '/') { | |
7529 | p += 2; | |
7530 | break; | |
7531 | } | |
b0bbbd85 | 7532 | } |
b0bbbd85 RS |
7533 | } |
7534 | } | |
35b28a7a PE |
7535 | else if (cplusplus_comments && p[1] == '/') |
7536 | return; | |
7537 | else break; | |
b0bbbd85 RS |
7538 | } else break; |
7539 | } | |
35b28a7a | 7540 | if (*p != '\n') |
b0bbbd85 RS |
7541 | pedwarn ("text following `#else' or `#endif' violates ANSI standard"); |
7542 | } | |
7543 | \f | |
2aa7ec37 RS |
7544 | /* Skip a comment, assuming the input ptr immediately follows the |
7545 | initial slash-star. Bump *LINE_COUNTER for each newline. | |
7546 | (The canonical line counter is &ip->lineno.) | |
7547 | Don't use this routine (or the next one) if bumping the line | |
7548 | counter is not sufficient to deal with newlines in the string. | |
7549 | ||
7550 | If NOWARN is nonzero, don't warn about slash-star inside a comment. | |
0f41302f MS |
7551 | This feature is useful when processing a comment that is going to |
7552 | be processed or was processed at another point in the preprocessor, | |
7553 | to avoid a duplicate warning. Likewise for unterminated comment | |
7554 | errors. */ | |
e24d9a31 | 7555 | |
b0bbbd85 | 7556 | static U_CHAR * |
2aa7ec37 | 7557 | skip_to_end_of_comment (ip, line_counter, nowarn) |
b0bbbd85 RS |
7558 | register FILE_BUF *ip; |
7559 | int *line_counter; /* place to remember newlines, or NULL */ | |
2aa7ec37 | 7560 | int nowarn; |
b0bbbd85 RS |
7561 | { |
7562 | register U_CHAR *limit = ip->buf + ip->length; | |
7563 | register U_CHAR *bp = ip->bufp; | |
3e4115b7 | 7564 | FILE_BUF *op = put_out_comments && !line_counter ? &outbuf : (FILE_BUF *) 0; |
e24d9a31 | 7565 | int start_line = line_counter ? *line_counter : 0; |
b0bbbd85 RS |
7566 | |
7567 | /* JF this line_counter stuff is a crock to make sure the | |
7568 | comment is only put out once, no matter how many times | |
7569 | the comment is skipped. It almost works */ | |
3e4115b7 | 7570 | if (op) { |
b0bbbd85 | 7571 | *op->bufp++ = '/'; |
3e4115b7 | 7572 | *op->bufp++ = bp[-1]; |
b0bbbd85 | 7573 | } |
eda5fa7b | 7574 | if (cplusplus_comments && bp[-1] == '/') { |
3e4115b7 RK |
7575 | for (; bp < limit; bp++) { |
7576 | if (op) | |
80512db7 | 7577 | *op->bufp++ = *bp; |
3e4115b7 RK |
7578 | if (*bp == '\n') { |
7579 | if (bp[-1] != '\\') | |
b0bbbd85 | 7580 | break; |
3e4115b7 RK |
7581 | if (!nowarn && warn_comments) |
7582 | warning ("multiline `//' comment"); | |
7583 | if (line_counter) | |
80512db7 | 7584 | ++*line_counter; |
3e4115b7 | 7585 | if (op) |
80512db7 | 7586 | ++op->lineno; |
b0bbbd85 RS |
7587 | } |
7588 | } | |
7589 | ip->bufp = bp; | |
7590 | return bp; | |
7591 | } | |
7592 | while (bp < limit) { | |
3e4115b7 | 7593 | if (op) |
b0bbbd85 RS |
7594 | *op->bufp++ = *bp; |
7595 | switch (*bp++) { | |
b0bbbd85 | 7596 | case '\n': |
e24d9a31 DE |
7597 | /* If this is the end of the file, we have an unterminated comment. |
7598 | Don't swallow the newline. We are guaranteed that there will be a | |
7599 | trailing newline and various pieces assume it's there. */ | |
7600 | if (bp == limit) | |
7601 | { | |
7602 | --bp; | |
7603 | --limit; | |
7604 | break; | |
7605 | } | |
b0bbbd85 RS |
7606 | if (line_counter != NULL) |
7607 | ++*line_counter; | |
3e4115b7 | 7608 | if (op) |
b0bbbd85 RS |
7609 | ++op->lineno; |
7610 | break; | |
7611 | case '*': | |
3e4115b7 RK |
7612 | if (bp[-2] == '/' && !nowarn && warn_comments) |
7613 | warning ("`/*' within comment"); | |
b0bbbd85 RS |
7614 | if (*bp == '\\' && bp[1] == '\n') |
7615 | newline_fix (bp); | |
7616 | if (*bp == '/') { | |
3e4115b7 | 7617 | if (op) |
b0bbbd85 RS |
7618 | *op->bufp++ = '/'; |
7619 | ip->bufp = ++bp; | |
7620 | return bp; | |
7621 | } | |
7622 | break; | |
7623 | } | |
7624 | } | |
e24d9a31 DE |
7625 | |
7626 | if (!nowarn) | |
7627 | error_with_line (line_for_error (start_line), "unterminated comment"); | |
b0bbbd85 RS |
7628 | ip->bufp = bp; |
7629 | return bp; | |
7630 | } | |
7631 | ||
0f41302f MS |
7632 | /* Skip over a quoted string. BP points to the opening quote. |
7633 | Returns a pointer after the closing quote. Don't go past LIMIT. | |
7634 | START_LINE is the line number of the starting point (but it need | |
7635 | not be valid if the starting point is inside a macro expansion). | |
7636 | ||
7637 | The input stack state is not changed. | |
7638 | ||
7639 | If COUNT_NEWLINES is nonzero, it points to an int to increment | |
7640 | for each newline passed. | |
7641 | ||
7642 | If BACKSLASH_NEWLINES_P is nonzero, store 1 thru it | |
7643 | if we pass a backslash-newline. | |
7644 | ||
7645 | If EOFP is nonzero, set *EOFP to 1 if the string is unterminated. */ | |
7646 | ||
b0bbbd85 RS |
7647 | static U_CHAR * |
7648 | skip_quoted_string (bp, limit, start_line, count_newlines, backslash_newlines_p, eofp) | |
7649 | register U_CHAR *bp; | |
7650 | register U_CHAR *limit; | |
7651 | int start_line; | |
7652 | int *count_newlines; | |
7653 | int *backslash_newlines_p; | |
7654 | int *eofp; | |
7655 | { | |
7656 | register U_CHAR c, match; | |
7657 | ||
7658 | match = *bp++; | |
7659 | while (1) { | |
7660 | if (bp >= limit) { | |
7661 | error_with_line (line_for_error (start_line), | |
7662 | "unterminated string or character constant"); | |
5b01bc66 JW |
7663 | error_with_line (multiline_string_line, |
7664 | "possible real start of unterminated constant"); | |
7665 | multiline_string_line = 0; | |
b0bbbd85 RS |
7666 | if (eofp) |
7667 | *eofp = 1; | |
7668 | break; | |
7669 | } | |
7670 | c = *bp++; | |
7671 | if (c == '\\') { | |
7672 | while (*bp == '\\' && bp[1] == '\n') { | |
7673 | if (backslash_newlines_p) | |
7674 | *backslash_newlines_p = 1; | |
7675 | if (count_newlines) | |
7676 | ++*count_newlines; | |
7677 | bp += 2; | |
7678 | } | |
7679 | if (*bp == '\n' && count_newlines) { | |
7680 | if (backslash_newlines_p) | |
7681 | *backslash_newlines_p = 1; | |
7682 | ++*count_newlines; | |
7683 | } | |
7684 | bp++; | |
7685 | } else if (c == '\n') { | |
7686 | if (traditional) { | |
3826a3da | 7687 | /* Unterminated strings and character constants are 'valid'. */ |
0f41302f | 7688 | bp--; /* Don't consume the newline. */ |
b0bbbd85 RS |
7689 | if (eofp) |
7690 | *eofp = 1; | |
7691 | break; | |
7692 | } | |
2994a9ac | 7693 | if (match == '\'') { |
b0bbbd85 | 7694 | error_with_line (line_for_error (start_line), |
5b01bc66 | 7695 | "unterminated string or character constant"); |
b0bbbd85 RS |
7696 | bp--; |
7697 | if (eofp) | |
7698 | *eofp = 1; | |
7699 | break; | |
7700 | } | |
b0bbbd85 RS |
7701 | /* If not traditional, then allow newlines inside strings. */ |
7702 | if (count_newlines) | |
7703 | ++*count_newlines; | |
2994a9ac RK |
7704 | if (multiline_string_line == 0) { |
7705 | if (pedantic) | |
7706 | pedwarn_with_line (line_for_error (start_line), | |
7707 | "string constant runs past end of line"); | |
5b01bc66 | 7708 | multiline_string_line = start_line; |
2994a9ac | 7709 | } |
b0bbbd85 RS |
7710 | } else if (c == match) |
7711 | break; | |
7712 | } | |
7713 | return bp; | |
7714 | } | |
7715 | ||
f7531123 PE |
7716 | /* Place into DST a quoted string representing the string SRC. |
7717 | Return the address of DST's terminating null. */ | |
0f41302f | 7718 | |
f7531123 | 7719 | static char * |
bb2f42b1 PE |
7720 | quote_string (dst, src) |
7721 | char *dst, *src; | |
7722 | { | |
f7531123 | 7723 | U_CHAR c; |
bb2f42b1 | 7724 | |
f7531123 PE |
7725 | *dst++ = '\"'; |
7726 | for (;;) | |
bb2f42b1 PE |
7727 | switch ((c = *src++)) |
7728 | { | |
f7531123 PE |
7729 | default: |
7730 | if (isprint (c)) | |
7731 | *dst++ = c; | |
7732 | else | |
7733 | { | |
7734 | sprintf (dst, "\\%03o", c); | |
7735 | dst += 4; | |
7736 | } | |
7737 | break; | |
7738 | ||
bb2f42b1 PE |
7739 | case '\"': |
7740 | case '\\': | |
7741 | *dst++ = '\\'; | |
f7531123 | 7742 | *dst++ = c; |
bb2f42b1 PE |
7743 | break; |
7744 | ||
7745 | case '\0': | |
7746 | *dst++ = '\"'; | |
7747 | *dst = '\0'; | |
f7531123 | 7748 | return dst; |
bb2f42b1 PE |
7749 | } |
7750 | } | |
7751 | ||
b0bbbd85 RS |
7752 | /* Skip across a group of balanced parens, starting from IP->bufp. |
7753 | IP->bufp is updated. Use this with IP->bufp pointing at an open-paren. | |
7754 | ||
7755 | This does not handle newlines, because it's used for the arg of #if, | |
2aa7ec37 | 7756 | where there aren't any newlines. Also, backslash-newline can't appear. */ |
b0bbbd85 RS |
7757 | |
7758 | static U_CHAR * | |
7759 | skip_paren_group (ip) | |
7760 | register FILE_BUF *ip; | |
7761 | { | |
7762 | U_CHAR *limit = ip->buf + ip->length; | |
7763 | U_CHAR *p = ip->bufp; | |
7764 | int depth = 0; | |
7765 | int lines_dummy = 0; | |
7766 | ||
7767 | while (p != limit) { | |
7768 | int c = *p++; | |
7769 | switch (c) { | |
7770 | case '(': | |
7771 | depth++; | |
7772 | break; | |
7773 | ||
7774 | case ')': | |
7775 | depth--; | |
7776 | if (depth == 0) | |
7777 | return ip->bufp = p; | |
7778 | break; | |
7779 | ||
7780 | case '/': | |
7781 | if (*p == '*') { | |
7782 | ip->bufp = p; | |
2aa7ec37 | 7783 | p = skip_to_end_of_comment (ip, &lines_dummy, 0); |
b0bbbd85 RS |
7784 | p = ip->bufp; |
7785 | } | |
7786 | ||
7787 | case '"': | |
7788 | case '\'': | |
7789 | { | |
7790 | int eofp = 0; | |
8d9bfdc5 | 7791 | p = skip_quoted_string (p - 1, limit, 0, NULL_PTR, NULL_PTR, &eofp); |
b0bbbd85 RS |
7792 | if (eofp) |
7793 | return ip->bufp = p; | |
7794 | } | |
7795 | break; | |
7796 | } | |
7797 | } | |
7798 | ||
7799 | ip->bufp = p; | |
7800 | return p; | |
7801 | } | |
7802 | \f | |
0f41302f MS |
7803 | /* Write out a #line directive, for instance, after an #include file. |
7804 | If CONDITIONAL is nonzero, we can omit the #line if it would | |
7805 | appear to be a no-op, and we can output a few newlines instead | |
7806 | if we want to increase the line number by a small amount. | |
7807 | FILE_CHANGE says whether we are entering a file, leaving, or neither. */ | |
b0bbbd85 RS |
7808 | |
7809 | static void | |
adcfa681 | 7810 | output_line_directive (ip, op, conditional, file_change) |
b0bbbd85 RS |
7811 | FILE_BUF *ip, *op; |
7812 | int conditional; | |
7813 | enum file_change_code file_change; | |
7814 | { | |
7815 | int len; | |
adcfa681 | 7816 | char *line_directive_buf, *line_end; |
b0bbbd85 | 7817 | |
adcfa681 | 7818 | if (no_line_directives |
b0bbbd85 RS |
7819 | || ip->fname == NULL |
7820 | || no_output) { | |
7821 | op->lineno = ip->lineno; | |
7822 | return; | |
7823 | } | |
7824 | ||
7825 | if (conditional) { | |
7826 | if (ip->lineno == op->lineno) | |
7827 | return; | |
7828 | ||
7829 | /* If the inherited line number is a little too small, | |
adcfa681 | 7830 | output some newlines instead of a #line directive. */ |
b0bbbd85 RS |
7831 | if (ip->lineno > op->lineno && ip->lineno < op->lineno + 8) { |
7832 | check_expand (op, 10); | |
7833 | while (ip->lineno > op->lineno) { | |
7834 | *op->bufp++ = '\n'; | |
7835 | op->lineno++; | |
7836 | } | |
7837 | return; | |
7838 | } | |
7839 | } | |
7840 | ||
2aa7ec37 RS |
7841 | /* Don't output a line number of 0 if we can help it. */ |
7842 | if (ip->lineno == 0 && ip->bufp - ip->buf < ip->length | |
7843 | && *ip->bufp == '\n') { | |
7844 | ip->lineno++; | |
7845 | ip->bufp++; | |
7846 | } | |
7847 | ||
adcfa681 RK |
7848 | line_directive_buf = (char *) alloca (4 * strlen (ip->nominal_fname) + 100); |
7849 | sprintf (line_directive_buf, "# %d ", ip->lineno); | |
7850 | line_end = quote_string (line_directive_buf + strlen (line_directive_buf), | |
f7531123 PE |
7851 | ip->nominal_fname); |
7852 | if (file_change != same_file) { | |
7853 | *line_end++ = ' '; | |
7854 | *line_end++ = file_change == enter_file ? '1' : '2'; | |
7855 | } | |
b0bbbd85 | 7856 | /* Tell cc1 if following text comes from a system header file. */ |
f7531123 PE |
7857 | if (ip->system_header_p) { |
7858 | *line_end++ = ' '; | |
7859 | *line_end++ = '3'; | |
7860 | } | |
0031ac57 | 7861 | #ifndef NO_IMPLICIT_EXTERN_C |
d2a22862 | 7862 | /* Tell cc1plus if following text should be treated as C. */ |
65715dea | 7863 | if (ip->system_header_p == 2 && cplusplus) { |
d2a22862 RS |
7864 | *line_end++ = ' '; |
7865 | *line_end++ = '4'; | |
7866 | } | |
0031ac57 | 7867 | #endif |
f7531123 | 7868 | *line_end++ = '\n'; |
adcfa681 | 7869 | len = line_end - line_directive_buf; |
b0bbbd85 RS |
7870 | check_expand (op, len + 1); |
7871 | if (op->bufp > op->buf && op->bufp[-1] != '\n') | |
7872 | *op->bufp++ = '\n'; | |
adcfa681 | 7873 | bcopy ((char *) line_directive_buf, (char *) op->bufp, len); |
b0bbbd85 RS |
7874 | op->bufp += len; |
7875 | op->lineno = ip->lineno; | |
7876 | } | |
7877 | \f | |
7878 | /* This structure represents one parsed argument in a macro call. | |
7879 | `raw' points to the argument text as written (`raw_length' is its length). | |
7880 | `expanded' points to the argument's macro-expansion | |
7881 | (its length is `expand_length'). | |
7882 | `stringified_length' is the length the argument would have | |
7883 | if stringified. | |
7884 | `use_count' is the number of times this macro arg is substituted | |
7885 | into the macro. If the actual use count exceeds 10, | |
7886 | the value stored is 10. | |
7887 | `free1' and `free2', if nonzero, point to blocks to be freed | |
7888 | when the macro argument data is no longer needed. */ | |
7889 | ||
7890 | struct argdata { | |
7891 | U_CHAR *raw, *expanded; | |
7892 | int raw_length, expand_length; | |
7893 | int stringified_length; | |
7894 | U_CHAR *free1, *free2; | |
7895 | char newlines; | |
b0bbbd85 RS |
7896 | char use_count; |
7897 | }; | |
7898 | ||
7899 | /* Expand a macro call. | |
7900 | HP points to the symbol that is the macro being called. | |
7901 | Put the result of expansion onto the input stack | |
7902 | so that subsequent input by our caller will use it. | |
7903 | ||
7904 | If macro wants arguments, caller has already verified that | |
7905 | an argument list follows; arguments come from the input stack. */ | |
7906 | ||
7907 | static void | |
7908 | macroexpand (hp, op) | |
7909 | HASHNODE *hp; | |
7910 | FILE_BUF *op; | |
7911 | { | |
7912 | int nargs; | |
7913 | DEFINITION *defn = hp->value.defn; | |
7914 | register U_CHAR *xbuf; | |
7915 | int xbuf_len; | |
7916 | int start_line = instack[indepth].lineno; | |
5ff1a832 | 7917 | int rest_args, rest_zero; |
b0bbbd85 RS |
7918 | |
7919 | CHECK_DEPTH (return;); | |
7920 | ||
7921 | /* it might not actually be a macro. */ | |
7922 | if (hp->type != T_MACRO) { | |
7923 | special_symbol (hp, op); | |
7924 | return; | |
7925 | } | |
7926 | ||
7927 | /* This macro is being used inside a #if, which means it must be */ | |
7928 | /* recorded as a precondition. */ | |
7929 | if (pcp_inside_if && pcp_outfile && defn->predefined) | |
7930 | dump_single_macro (hp, pcp_outfile); | |
7931 | ||
7932 | nargs = defn->nargs; | |
7933 | ||
7934 | if (nargs >= 0) { | |
7935 | register int i; | |
7936 | struct argdata *args; | |
7937 | char *parse_error = 0; | |
7938 | ||
7939 | args = (struct argdata *) alloca ((nargs + 1) * sizeof (struct argdata)); | |
7940 | ||
7941 | for (i = 0; i < nargs; i++) { | |
2b1a049f RS |
7942 | args[i].raw = (U_CHAR *) ""; |
7943 | args[i].expanded = 0; | |
b0bbbd85 RS |
7944 | args[i].raw_length = args[i].expand_length |
7945 | = args[i].stringified_length = 0; | |
7946 | args[i].free1 = args[i].free2 = 0; | |
7947 | args[i].use_count = 0; | |
7948 | } | |
7949 | ||
7950 | /* Parse all the macro args that are supplied. I counts them. | |
7951 | The first NARGS args are stored in ARGS. | |
5ff1a832 RS |
7952 | The rest are discarded. |
7953 | If rest_args is set then we assume macarg absorbed the rest of the args. | |
7954 | */ | |
b0bbbd85 | 7955 | i = 0; |
5ff1a832 | 7956 | rest_args = 0; |
b0bbbd85 RS |
7957 | do { |
7958 | /* Discard the open-parenthesis or comma before the next arg. */ | |
7959 | ++instack[indepth].bufp; | |
5ff1a832 RS |
7960 | if (rest_args) |
7961 | continue; | |
7962 | if (i < nargs || (nargs == 0 && i == 0)) { | |
0f41302f | 7963 | /* If we are working on last arg which absorbs rest of args... */ |
5ff1a832 RS |
7964 | if (i == nargs - 1 && defn->rest_args) |
7965 | rest_args = 1; | |
7966 | parse_error = macarg (&args[i], rest_args); | |
7967 | } | |
7968 | else | |
8d9bfdc5 | 7969 | parse_error = macarg (NULL_PTR, 0); |
b0bbbd85 RS |
7970 | if (parse_error) { |
7971 | error_with_line (line_for_error (start_line), parse_error); | |
7972 | break; | |
7973 | } | |
7974 | i++; | |
7975 | } while (*instack[indepth].bufp != ')'); | |
7976 | ||
7977 | /* If we got one arg but it was just whitespace, call that 0 args. */ | |
7978 | if (i == 1) { | |
7979 | register U_CHAR *bp = args[0].raw; | |
7980 | register U_CHAR *lim = bp + args[0].raw_length; | |
148597b9 RS |
7981 | /* cpp.texi says for foo ( ) we provide one argument. |
7982 | However, if foo wants just 0 arguments, treat this as 0. */ | |
7983 | if (nargs == 0) | |
7984 | while (bp != lim && is_space[*bp]) bp++; | |
b0bbbd85 RS |
7985 | if (bp == lim) |
7986 | i = 0; | |
7987 | } | |
7988 | ||
7dcdbecb JW |
7989 | /* Don't output an error message if we have already output one for |
7990 | a parse error above. */ | |
5ff1a832 | 7991 | rest_zero = 0; |
7dcdbecb JW |
7992 | if (nargs == 0 && i > 0) { |
7993 | if (! parse_error) | |
7994 | error ("arguments given to macro `%s'", hp->name); | |
7995 | } else if (i < nargs) { | |
b0bbbd85 RS |
7996 | /* traditional C allows foo() if foo wants one argument. */ |
7997 | if (nargs == 1 && i == 0 && traditional) | |
7998 | ; | |
5ff1a832 RS |
7999 | /* the rest args token is allowed to absorb 0 tokens */ |
8000 | else if (i == nargs - 1 && defn->rest_args) | |
8001 | rest_zero = 1; | |
7dcdbecb JW |
8002 | else if (parse_error) |
8003 | ; | |
b0bbbd85 RS |
8004 | else if (i == 0) |
8005 | error ("macro `%s' used without args", hp->name); | |
8006 | else if (i == 1) | |
8007 | error ("macro `%s' used with just one arg", hp->name); | |
8008 | else | |
8009 | error ("macro `%s' used with only %d args", hp->name, i); | |
7dcdbecb JW |
8010 | } else if (i > nargs) { |
8011 | if (! parse_error) | |
8012 | error ("macro `%s' used with too many (%d) args", hp->name, i); | |
8013 | } | |
b0bbbd85 RS |
8014 | |
8015 | /* Swallow the closeparen. */ | |
8016 | ++instack[indepth].bufp; | |
8017 | ||
8018 | /* If macro wants zero args, we parsed the arglist for checking only. | |
8019 | Read directly from the macro definition. */ | |
8020 | if (nargs == 0) { | |
8021 | xbuf = defn->expansion; | |
8022 | xbuf_len = defn->length; | |
8023 | } else { | |
8024 | register U_CHAR *exp = defn->expansion; | |
8025 | register int offset; /* offset in expansion, | |
8026 | copied a piece at a time */ | |
8027 | register int totlen; /* total amount of exp buffer filled so far */ | |
8028 | ||
5ff1a832 | 8029 | register struct reflist *ap, *last_ap; |
b0bbbd85 RS |
8030 | |
8031 | /* Macro really takes args. Compute the expansion of this call. */ | |
8032 | ||
8033 | /* Compute length in characters of the macro's expansion. | |
8034 | Also count number of times each arg is used. */ | |
8035 | xbuf_len = defn->length; | |
8036 | for (ap = defn->pattern; ap != NULL; ap = ap->next) { | |
8037 | if (ap->stringify) | |
8038 | xbuf_len += args[ap->argno].stringified_length; | |
27027a60 | 8039 | else if (ap->raw_before != 0 || ap->raw_after != 0 || traditional) |
d0691cfb RS |
8040 | /* Add 4 for two newline-space markers to prevent |
8041 | token concatenation. */ | |
8042 | xbuf_len += args[ap->argno].raw_length + 4; | |
2b1a049f RS |
8043 | else { |
8044 | /* We have an ordinary (expanded) occurrence of the arg. | |
8045 | So compute its expansion, if we have not already. */ | |
8046 | if (args[ap->argno].expanded == 0) { | |
8047 | FILE_BUF obuf; | |
8048 | obuf = expand_to_temp_buffer (args[ap->argno].raw, | |
8049 | args[ap->argno].raw + args[ap->argno].raw_length, | |
8050 | 1, 0); | |
8051 | ||
8052 | args[ap->argno].expanded = obuf.buf; | |
8053 | args[ap->argno].expand_length = obuf.length; | |
8054 | args[ap->argno].free2 = obuf.buf; | |
8055 | } | |
b0bbbd85 | 8056 | |
d0691cfb RS |
8057 | /* Add 4 for two newline-space markers to prevent |
8058 | token concatenation. */ | |
8059 | xbuf_len += args[ap->argno].expand_length + 4; | |
2b1a049f | 8060 | } |
b0bbbd85 RS |
8061 | if (args[ap->argno].use_count < 10) |
8062 | args[ap->argno].use_count++; | |
8063 | } | |
8064 | ||
8065 | xbuf = (U_CHAR *) xmalloc (xbuf_len + 1); | |
8066 | ||
8067 | /* Generate in XBUF the complete expansion | |
8068 | with arguments substituted in. | |
8069 | TOTLEN is the total size generated so far. | |
8070 | OFFSET is the index in the definition | |
8071 | of where we are copying from. */ | |
8072 | offset = totlen = 0; | |
5ff1a832 RS |
8073 | for (last_ap = NULL, ap = defn->pattern; ap != NULL; |
8074 | last_ap = ap, ap = ap->next) { | |
b0bbbd85 | 8075 | register struct argdata *arg = &args[ap->argno]; |
d0691cfb | 8076 | int count_before = totlen; |
b0bbbd85 | 8077 | |
d0691cfb | 8078 | /* Add chars to XBUF. */ |
5ff1a832 | 8079 | for (i = 0; i < ap->nchars; i++, offset++) |
d0691cfb RS |
8080 | xbuf[totlen++] = exp[offset]; |
8081 | ||
8082 | /* If followed by an empty rest arg with concatenation, | |
8083 | delete the last run of nonwhite chars. */ | |
8084 | if (rest_zero && totlen > count_before | |
27027a60 | 8085 | && ((ap->rest_args && ap->raw_before != 0) |
d0691cfb | 8086 | || (last_ap != NULL && last_ap->rest_args |
27027a60 | 8087 | && last_ap->raw_after != 0))) { |
d0691cfb RS |
8088 | /* Delete final whitespace. */ |
8089 | while (totlen > count_before && is_space[xbuf[totlen - 1]]) { | |
8090 | totlen--; | |
8091 | } | |
8092 | ||
8093 | /* Delete the nonwhites before them. */ | |
8094 | while (totlen > count_before && ! is_space[xbuf[totlen - 1]]) { | |
8095 | totlen--; | |
8096 | } | |
8097 | } | |
b0bbbd85 RS |
8098 | |
8099 | if (ap->stringify != 0) { | |
8100 | int arglen = arg->raw_length; | |
8101 | int escaped = 0; | |
8102 | int in_string = 0; | |
8103 | int c; | |
8104 | i = 0; | |
8105 | while (i < arglen | |
8106 | && (c = arg->raw[i], is_space[c])) | |
8107 | i++; | |
8108 | while (i < arglen | |
8109 | && (c = arg->raw[arglen - 1], is_space[c])) | |
8110 | arglen--; | |
8111 | if (!traditional) | |
8112 | xbuf[totlen++] = '\"'; /* insert beginning quote */ | |
8113 | for (; i < arglen; i++) { | |
8114 | c = arg->raw[i]; | |
8115 | ||
8116 | /* Special markers Newline Space | |
8117 | generate nothing for a stringified argument. */ | |
8118 | if (c == '\n' && arg->raw[i+1] != '\n') { | |
8119 | i++; | |
8120 | continue; | |
8121 | } | |
8122 | ||
8123 | /* Internal sequences of whitespace are replaced by one space | |
8124 | except within an string or char token. */ | |
8125 | if (! in_string | |
8126 | && (c == '\n' ? arg->raw[i+1] == '\n' : is_space[c])) { | |
8127 | while (1) { | |
8128 | /* Note that Newline Space does occur within whitespace | |
8129 | sequences; consider it part of the sequence. */ | |
8130 | if (c == '\n' && is_space[arg->raw[i+1]]) | |
8131 | i += 2; | |
8132 | else if (c != '\n' && is_space[c]) | |
8133 | i++; | |
8134 | else break; | |
8135 | c = arg->raw[i]; | |
8136 | } | |
8137 | i--; | |
8138 | c = ' '; | |
8139 | } | |
8140 | ||
8141 | if (escaped) | |
8142 | escaped = 0; | |
8143 | else { | |
8144 | if (c == '\\') | |
8145 | escaped = 1; | |
8146 | if (in_string) { | |
8147 | if (c == in_string) | |
8148 | in_string = 0; | |
8149 | } else if (c == '\"' || c == '\'') | |
8150 | in_string = c; | |
8151 | } | |
8152 | ||
8153 | /* Escape these chars */ | |
8154 | if (c == '\"' || (in_string && c == '\\')) | |
8155 | xbuf[totlen++] = '\\'; | |
8156 | if (isprint (c)) | |
8157 | xbuf[totlen++] = c; | |
8158 | else { | |
8159 | sprintf ((char *) &xbuf[totlen], "\\%03o", (unsigned int) c); | |
8160 | totlen += 4; | |
8161 | } | |
8162 | } | |
8163 | if (!traditional) | |
8164 | xbuf[totlen++] = '\"'; /* insert ending quote */ | |
27027a60 | 8165 | } else if (ap->raw_before != 0 || ap->raw_after != 0 || traditional) { |
b0bbbd85 RS |
8166 | U_CHAR *p1 = arg->raw; |
8167 | U_CHAR *l1 = p1 + arg->raw_length; | |
27027a60 | 8168 | if (ap->raw_before != 0) { |
b0bbbd85 RS |
8169 | while (p1 != l1 && is_space[*p1]) p1++; |
8170 | while (p1 != l1 && is_idchar[*p1]) | |
8171 | xbuf[totlen++] = *p1++; | |
8172 | /* Delete any no-reexpansion marker that follows | |
8173 | an identifier at the beginning of the argument | |
8174 | if the argument is concatenated with what precedes it. */ | |
8175 | if (p1[0] == '\n' && p1[1] == '-') | |
8176 | p1 += 2; | |
d0691cfb RS |
8177 | } else if (!traditional) { |
8178 | /* Ordinary expanded use of the argument. | |
8179 | Put in newline-space markers to prevent token pasting. */ | |
8180 | xbuf[totlen++] = '\n'; | |
8181 | xbuf[totlen++] = ' '; | |
b0bbbd85 | 8182 | } |
27027a60 | 8183 | if (ap->raw_after != 0) { |
b0bbbd85 RS |
8184 | /* Arg is concatenated after: delete trailing whitespace, |
8185 | whitespace markers, and no-reexpansion markers. */ | |
8186 | while (p1 != l1) { | |
8187 | if (is_space[l1[-1]]) l1--; | |
8188 | else if (l1[-1] == '-') { | |
8189 | U_CHAR *p2 = l1 - 1; | |
8190 | /* If a `-' is preceded by an odd number of newlines then it | |
8191 | and the last newline are a no-reexpansion marker. */ | |
8192 | while (p2 != p1 && p2[-1] == '\n') p2--; | |
8193 | if ((l1 - 1 - p2) & 1) { | |
8194 | l1 -= 2; | |
8195 | } | |
8196 | else break; | |
8197 | } | |
8198 | else break; | |
8199 | } | |
8200 | } | |
d0691cfb | 8201 | |
4c9a05bc | 8202 | bcopy ((char *) p1, (char *) (xbuf + totlen), l1 - p1); |
b0bbbd85 | 8203 | totlen += l1 - p1; |
27027a60 | 8204 | if (!traditional && ap->raw_after == 0) { |
d0691cfb RS |
8205 | /* Ordinary expanded use of the argument. |
8206 | Put in newline-space markers to prevent token pasting. */ | |
8207 | xbuf[totlen++] = '\n'; | |
8208 | xbuf[totlen++] = ' '; | |
8209 | } | |
b0bbbd85 | 8210 | } else { |
d0691cfb RS |
8211 | /* Ordinary expanded use of the argument. |
8212 | Put in newline-space markers to prevent token pasting. */ | |
8213 | if (!traditional) { | |
8214 | xbuf[totlen++] = '\n'; | |
8215 | xbuf[totlen++] = ' '; | |
8216 | } | |
4c9a05bc RK |
8217 | bcopy ((char *) arg->expanded, (char *) (xbuf + totlen), |
8218 | arg->expand_length); | |
b0bbbd85 | 8219 | totlen += arg->expand_length; |
d0691cfb RS |
8220 | if (!traditional) { |
8221 | xbuf[totlen++] = '\n'; | |
8222 | xbuf[totlen++] = ' '; | |
8223 | } | |
b0bbbd85 RS |
8224 | /* If a macro argument with newlines is used multiple times, |
8225 | then only expand the newlines once. This avoids creating output | |
8226 | lines which don't correspond to any input line, which confuses | |
8227 | gdb and gcov. */ | |
8228 | if (arg->use_count > 1 && arg->newlines > 0) { | |
de5f1a5a | 8229 | /* Don't bother doing change_newlines for subsequent |
b0bbbd85 RS |
8230 | uses of arg. */ |
8231 | arg->use_count = 1; | |
8232 | arg->expand_length | |
de5f1a5a | 8233 | = change_newlines (arg->expanded, arg->expand_length); |
b0bbbd85 RS |
8234 | } |
8235 | } | |
8236 | ||
8237 | if (totlen > xbuf_len) | |
8238 | abort (); | |
8239 | } | |
8240 | ||
0f41302f MS |
8241 | /* If there is anything left of the definition after handling |
8242 | the arg list, copy that in too. */ | |
b0bbbd85 | 8243 | |
5ff1a832 RS |
8244 | for (i = offset; i < defn->length; i++) { |
8245 | /* if we've reached the end of the macro */ | |
8246 | if (exp[i] == ')') | |
8247 | rest_zero = 0; | |
8248 | if (! (rest_zero && last_ap != NULL && last_ap->rest_args | |
27027a60 | 8249 | && last_ap->raw_after != 0)) |
5ff1a832 RS |
8250 | xbuf[totlen++] = exp[i]; |
8251 | } | |
b0bbbd85 RS |
8252 | |
8253 | xbuf[totlen] = 0; | |
8254 | xbuf_len = totlen; | |
8255 | ||
8256 | for (i = 0; i < nargs; i++) { | |
8257 | if (args[i].free1 != 0) | |
8258 | free (args[i].free1); | |
8259 | if (args[i].free2 != 0) | |
8260 | free (args[i].free2); | |
8261 | } | |
8262 | } | |
8263 | } else { | |
8264 | xbuf = defn->expansion; | |
8265 | xbuf_len = defn->length; | |
8266 | } | |
8267 | ||
8268 | /* Now put the expansion on the input stack | |
8269 | so our caller will commence reading from it. */ | |
8270 | { | |
8271 | register FILE_BUF *ip2; | |
8272 | ||
8273 | ip2 = &instack[++indepth]; | |
8274 | ||
8275 | ip2->fname = 0; | |
8276 | ip2->nominal_fname = 0; | |
3e4115b7 | 8277 | ip2->inc = 0; |
3375e662 JW |
8278 | /* This may not be exactly correct, but will give much better error |
8279 | messages for nested macro calls than using a line number of zero. */ | |
8280 | ip2->lineno = start_line; | |
b0bbbd85 RS |
8281 | ip2->buf = xbuf; |
8282 | ip2->length = xbuf_len; | |
8283 | ip2->bufp = xbuf; | |
8284 | ip2->free_ptr = (nargs > 0) ? xbuf : 0; | |
8285 | ip2->macro = hp; | |
8286 | ip2->if_stack = if_stack; | |
8287 | ip2->system_header_p = 0; | |
8288 | ||
8289 | /* Recursive macro use sometimes works traditionally. | |
ad0c9fa1 RS |
8290 | #define foo(x,y) bar (x (y,0), y) |
8291 | foo (foo, baz) */ | |
b0bbbd85 RS |
8292 | |
8293 | if (!traditional) | |
8294 | hp->type = T_DISABLED; | |
8295 | } | |
8296 | } | |
8297 | \f | |
0f41302f MS |
8298 | /* Parse a macro argument and store the info on it into *ARGPTR. |
8299 | REST_ARGS is passed to macarg1 to make it absorb the rest of the args. | |
8300 | Return nonzero to indicate a syntax error. */ | |
b0bbbd85 RS |
8301 | |
8302 | static char * | |
5ff1a832 | 8303 | macarg (argptr, rest_args) |
b0bbbd85 | 8304 | register struct argdata *argptr; |
5ff1a832 | 8305 | int rest_args; |
b0bbbd85 RS |
8306 | { |
8307 | FILE_BUF *ip = &instack[indepth]; | |
8308 | int paren = 0; | |
8309 | int newlines = 0; | |
8310 | int comments = 0; | |
040c67b3 | 8311 | char *result = 0; |
b0bbbd85 RS |
8312 | |
8313 | /* Try to parse as much of the argument as exists at this | |
8314 | input stack level. */ | |
8315 | U_CHAR *bp = macarg1 (ip->bufp, ip->buf + ip->length, | |
5ff1a832 | 8316 | &paren, &newlines, &comments, rest_args); |
b0bbbd85 RS |
8317 | |
8318 | /* If we find the end of the argument at this level, | |
8319 | set up *ARGPTR to point at it in the input stack. */ | |
8320 | if (!(ip->fname != 0 && (newlines != 0 || comments != 0)) | |
8321 | && bp != ip->buf + ip->length) { | |
8322 | if (argptr != 0) { | |
8323 | argptr->raw = ip->bufp; | |
8324 | argptr->raw_length = bp - ip->bufp; | |
8325 | argptr->newlines = newlines; | |
8326 | } | |
8327 | ip->bufp = bp; | |
8328 | } else { | |
8329 | /* This input stack level ends before the macro argument does. | |
8330 | We must pop levels and keep parsing. | |
8331 | Therefore, we must allocate a temporary buffer and copy | |
8332 | the macro argument into it. */ | |
8333 | int bufsize = bp - ip->bufp; | |
8334 | int extra = newlines; | |
8335 | U_CHAR *buffer = (U_CHAR *) xmalloc (bufsize + extra + 1); | |
8336 | int final_start = 0; | |
8337 | ||
4c9a05bc | 8338 | bcopy ((char *) ip->bufp, (char *) buffer, bufsize); |
b0bbbd85 RS |
8339 | ip->bufp = bp; |
8340 | ip->lineno += newlines; | |
8341 | ||
8342 | while (bp == ip->buf + ip->length) { | |
8343 | if (instack[indepth].macro == 0) { | |
040c67b3 RK |
8344 | result = "unterminated macro call"; |
8345 | break; | |
b0bbbd85 RS |
8346 | } |
8347 | ip->macro->type = T_MACRO; | |
8348 | if (ip->free_ptr) | |
8349 | free (ip->free_ptr); | |
8350 | ip = &instack[--indepth]; | |
8351 | newlines = 0; | |
8352 | comments = 0; | |
8353 | bp = macarg1 (ip->bufp, ip->buf + ip->length, &paren, | |
5ff1a832 | 8354 | &newlines, &comments, rest_args); |
b0bbbd85 RS |
8355 | final_start = bufsize; |
8356 | bufsize += bp - ip->bufp; | |
8357 | extra += newlines; | |
8358 | buffer = (U_CHAR *) xrealloc (buffer, bufsize + extra + 1); | |
4c9a05bc RK |
8359 | bcopy ((char *) ip->bufp, (char *) (buffer + bufsize - (bp - ip->bufp)), |
8360 | bp - ip->bufp); | |
b0bbbd85 RS |
8361 | ip->bufp = bp; |
8362 | ip->lineno += newlines; | |
8363 | } | |
8364 | ||
8365 | /* Now, if arg is actually wanted, record its raw form, | |
8366 | discarding comments and duplicating newlines in whatever | |
8367 | part of it did not come from a macro expansion. | |
8368 | EXTRA space has been preallocated for duplicating the newlines. | |
8369 | FINAL_START is the index of the start of that part. */ | |
8370 | if (argptr != 0) { | |
8371 | argptr->raw = buffer; | |
8372 | argptr->raw_length = bufsize; | |
8373 | argptr->free1 = buffer; | |
8374 | argptr->newlines = newlines; | |
b0bbbd85 RS |
8375 | if ((newlines || comments) && ip->fname != 0) |
8376 | argptr->raw_length | |
8377 | = final_start + | |
8378 | discard_comments (argptr->raw + final_start, | |
8379 | argptr->raw_length - final_start, | |
8380 | newlines); | |
8381 | argptr->raw[argptr->raw_length] = 0; | |
8382 | if (argptr->raw_length > bufsize + extra) | |
8383 | abort (); | |
8384 | } | |
8385 | } | |
8386 | ||
8387 | /* If we are not discarding this argument, | |
8388 | macroexpand it and compute its length as stringified. | |
8389 | All this info goes into *ARGPTR. */ | |
8390 | ||
8391 | if (argptr != 0) { | |
b0bbbd85 RS |
8392 | register U_CHAR *buf, *lim; |
8393 | register int totlen; | |
8394 | ||
b0bbbd85 RS |
8395 | buf = argptr->raw; |
8396 | lim = buf + argptr->raw_length; | |
8397 | ||
8398 | while (buf != lim && is_space[*buf]) | |
8399 | buf++; | |
8400 | while (buf != lim && is_space[lim[-1]]) | |
8401 | lim--; | |
8402 | totlen = traditional ? 0 : 2; /* Count opening and closing quote. */ | |
8403 | while (buf != lim) { | |
8404 | register U_CHAR c = *buf++; | |
8405 | totlen++; | |
8406 | /* Internal sequences of whitespace are replaced by one space | |
8407 | in most cases, but not always. So count all the whitespace | |
8408 | in case we need to keep it all. */ | |
8409 | #if 0 | |
8410 | if (is_space[c]) | |
8411 | SKIP_ALL_WHITE_SPACE (buf); | |
8412 | else | |
8413 | #endif | |
8414 | if (c == '\"' || c == '\\') /* escape these chars */ | |
8415 | totlen++; | |
8416 | else if (!isprint (c)) | |
8417 | totlen += 3; | |
8418 | } | |
8419 | argptr->stringified_length = totlen; | |
8420 | } | |
040c67b3 | 8421 | return result; |
b0bbbd85 RS |
8422 | } |
8423 | \f | |
8424 | /* Scan text from START (inclusive) up to LIMIT (exclusive), | |
8425 | counting parens in *DEPTHPTR, | |
8426 | and return if reach LIMIT | |
8427 | or before a `)' that would make *DEPTHPTR negative | |
8428 | or before a comma when *DEPTHPTR is zero. | |
8429 | Single and double quotes are matched and termination | |
8430 | is inhibited within them. Comments also inhibit it. | |
8431 | Value returned is pointer to stopping place. | |
8432 | ||
8433 | Increment *NEWLINES each time a newline is passed. | |
5ff1a832 | 8434 | REST_ARGS notifies macarg1 that it should absorb the rest of the args. |
b0bbbd85 RS |
8435 | Set *COMMENTS to 1 if a comment is seen. */ |
8436 | ||
8437 | static U_CHAR * | |
5ff1a832 | 8438 | macarg1 (start, limit, depthptr, newlines, comments, rest_args) |
b0bbbd85 RS |
8439 | U_CHAR *start; |
8440 | register U_CHAR *limit; | |
8441 | int *depthptr, *newlines, *comments; | |
5ff1a832 | 8442 | int rest_args; |
b0bbbd85 RS |
8443 | { |
8444 | register U_CHAR *bp = start; | |
8445 | ||
8446 | while (bp < limit) { | |
8447 | switch (*bp) { | |
8448 | case '(': | |
8449 | (*depthptr)++; | |
8450 | break; | |
8451 | case ')': | |
8452 | if (--(*depthptr) < 0) | |
8453 | return bp; | |
8454 | break; | |
8455 | case '\\': | |
8456 | /* Traditionally, backslash makes following char not special. */ | |
8457 | if (bp + 1 < limit && traditional) | |
8458 | { | |
8459 | bp++; | |
8460 | /* But count source lines anyway. */ | |
8461 | if (*bp == '\n') | |
8462 | ++*newlines; | |
8463 | } | |
8464 | break; | |
8465 | case '\n': | |
8466 | ++*newlines; | |
8467 | break; | |
8468 | case '/': | |
8469 | if (bp[1] == '\\' && bp[2] == '\n') | |
8470 | newline_fix (bp + 1); | |
3e4115b7 | 8471 | if (bp[1] == '*') { |
b0bbbd85 | 8472 | *comments = 1; |
3e4115b7 RK |
8473 | for (bp += 2; bp < limit; bp++) { |
8474 | if (*bp == '\n') | |
8475 | ++*newlines; | |
8476 | else if (*bp == '*') { | |
8477 | if (bp[-1] == '/' && warn_comments) | |
8478 | warning ("`/*' within comment"); | |
8479 | if (bp[1] == '\\' && bp[2] == '\n') | |
8480 | newline_fix (bp + 1); | |
35b28a7a PE |
8481 | if (bp[1] == '/') { |
8482 | bp++; | |
3e4115b7 | 8483 | break; |
35b28a7a | 8484 | } |
3e4115b7 RK |
8485 | } |
8486 | } | |
8487 | } else if (bp[1] == '/' && cplusplus_comments) { | |
8488 | *comments = 1; | |
8489 | for (bp += 2; bp < limit; bp++) { | |
8490 | if (*bp == '\n') { | |
8491 | ++*newlines; | |
8492 | if (bp[-1] != '\\') | |
8493 | break; | |
8494 | if (warn_comments) | |
8495 | warning ("multiline `//' comment"); | |
8496 | } | |
80512db7 | 8497 | } |
b0bbbd85 RS |
8498 | } |
8499 | break; | |
8500 | case '\'': | |
8501 | case '\"': | |
8502 | { | |
8503 | int quotec; | |
8504 | for (quotec = *bp++; bp + 1 < limit && *bp != quotec; bp++) { | |
8505 | if (*bp == '\\') { | |
8506 | bp++; | |
8507 | if (*bp == '\n') | |
8508 | ++*newlines; | |
8509 | while (*bp == '\\' && bp[1] == '\n') { | |
8510 | bp += 2; | |
8511 | } | |
8512 | } else if (*bp == '\n') { | |
8513 | ++*newlines; | |
8514 | if (quotec == '\'') | |
8515 | break; | |
8516 | } | |
8517 | } | |
8518 | } | |
8519 | break; | |
8520 | case ',': | |
5ff1a832 RS |
8521 | /* if we've returned to lowest level and we aren't absorbing all args */ |
8522 | if ((*depthptr) == 0 && rest_args == 0) | |
b0bbbd85 RS |
8523 | return bp; |
8524 | break; | |
8525 | } | |
8526 | bp++; | |
8527 | } | |
8528 | ||
8529 | return bp; | |
8530 | } | |
8531 | \f | |
8532 | /* Discard comments and duplicate newlines | |
8533 | in the string of length LENGTH at START, | |
8534 | except inside of string constants. | |
8535 | The string is copied into itself with its beginning staying fixed. | |
8536 | ||
8537 | NEWLINES is the number of newlines that must be duplicated. | |
8538 | We assume that that much extra space is available past the end | |
8539 | of the string. */ | |
8540 | ||
8541 | static int | |
8542 | discard_comments (start, length, newlines) | |
8543 | U_CHAR *start; | |
8544 | int length; | |
8545 | int newlines; | |
8546 | { | |
8547 | register U_CHAR *ibp; | |
8548 | register U_CHAR *obp; | |
8549 | register U_CHAR *limit; | |
8550 | register int c; | |
8551 | ||
8552 | /* If we have newlines to duplicate, copy everything | |
8553 | that many characters up. Then, in the second part, | |
8554 | we will have room to insert the newlines | |
8555 | while copying down. | |
8556 | NEWLINES may actually be too large, because it counts | |
8557 | newlines in string constants, and we don't duplicate those. | |
8558 | But that does no harm. */ | |
8559 | if (newlines > 0) { | |
8560 | ibp = start + length; | |
8561 | obp = ibp + newlines; | |
8562 | limit = start; | |
8563 | while (limit != ibp) | |
8564 | *--obp = *--ibp; | |
8565 | } | |
8566 | ||
8567 | ibp = start + newlines; | |
8568 | limit = start + length + newlines; | |
8569 | obp = start; | |
8570 | ||
8571 | while (ibp < limit) { | |
8572 | *obp++ = c = *ibp++; | |
8573 | switch (c) { | |
8574 | case '\n': | |
8575 | /* Duplicate the newline. */ | |
8576 | *obp++ = '\n'; | |
8577 | break; | |
8578 | ||
8579 | case '\\': | |
8580 | if (*ibp == '\n') { | |
8581 | obp--; | |
8582 | ibp++; | |
8583 | } | |
8584 | break; | |
8585 | ||
8586 | case '/': | |
8587 | if (*ibp == '\\' && ibp[1] == '\n') | |
8588 | newline_fix (ibp); | |
8589 | /* Delete any comment. */ | |
eda5fa7b | 8590 | if (cplusplus_comments && ibp[0] == '/') { |
18e2b1c0 JW |
8591 | /* Comments are equivalent to spaces. */ |
8592 | obp[-1] = ' '; | |
b0bbbd85 | 8593 | ibp++; |
80512db7 JW |
8594 | while (ibp < limit && (*ibp != '\n' || ibp[-1] == '\\')) |
8595 | ibp++; | |
b0bbbd85 RS |
8596 | break; |
8597 | } | |
8598 | if (ibp[0] != '*' || ibp + 1 >= limit) | |
8599 | break; | |
b6d90143 RK |
8600 | /* Comments are equivalent to spaces. |
8601 | For -traditional, a comment is equivalent to nothing. */ | |
8602 | if (traditional) | |
8603 | obp--; | |
8604 | else | |
8605 | obp[-1] = ' '; | |
b0bbbd85 RS |
8606 | ibp++; |
8607 | while (ibp + 1 < limit) { | |
8608 | if (ibp[0] == '*' | |
8609 | && ibp[1] == '\\' && ibp[2] == '\n') | |
8610 | newline_fix (ibp + 1); | |
8611 | if (ibp[0] == '*' && ibp[1] == '/') | |
8612 | break; | |
8613 | ibp++; | |
8614 | } | |
8615 | ibp += 2; | |
8616 | break; | |
8617 | ||
8618 | case '\'': | |
8619 | case '\"': | |
8620 | /* Notice and skip strings, so that we don't | |
8621 | think that comments start inside them, | |
8622 | and so we don't duplicate newlines in them. */ | |
8623 | { | |
8624 | int quotec = c; | |
8625 | while (ibp < limit) { | |
8626 | *obp++ = c = *ibp++; | |
8627 | if (c == quotec) | |
8628 | break; | |
8629 | if (c == '\n' && quotec == '\'') | |
8630 | break; | |
8631 | if (c == '\\' && ibp < limit) { | |
8632 | while (*ibp == '\\' && ibp[1] == '\n') | |
8633 | ibp += 2; | |
8634 | *obp++ = *ibp++; | |
8635 | } | |
8636 | } | |
8637 | } | |
8638 | break; | |
8639 | } | |
8640 | } | |
8641 | ||
8642 | return obp - start; | |
8643 | } | |
8644 | \f | |
de5f1a5a RS |
8645 | /* Turn newlines to spaces in the string of length LENGTH at START, |
8646 | except inside of string constants. | |
8647 | The string is copied into itself with its beginning staying fixed. */ | |
b0bbbd85 RS |
8648 | |
8649 | static int | |
de5f1a5a | 8650 | change_newlines (start, length) |
b0bbbd85 RS |
8651 | U_CHAR *start; |
8652 | int length; | |
8653 | { | |
8654 | register U_CHAR *ibp; | |
8655 | register U_CHAR *obp; | |
8656 | register U_CHAR *limit; | |
8657 | register int c; | |
8658 | ||
8659 | ibp = start; | |
8660 | limit = start + length; | |
8661 | obp = start; | |
8662 | ||
8663 | while (ibp < limit) { | |
8664 | *obp++ = c = *ibp++; | |
8665 | switch (c) { | |
8666 | case '\n': | |
8667 | /* If this is a NEWLINE NEWLINE, then this is a real newline in the | |
de5f1a5a RS |
8668 | string. Skip past the newline and its duplicate. |
8669 | Put a space in the output. */ | |
b0bbbd85 RS |
8670 | if (*ibp == '\n') |
8671 | { | |
8672 | ibp++; | |
8673 | obp--; | |
de5f1a5a | 8674 | *obp++ = ' '; |
b0bbbd85 RS |
8675 | } |
8676 | break; | |
8677 | ||
8678 | case '\'': | |
8679 | case '\"': | |
8680 | /* Notice and skip strings, so that we don't delete newlines in them. */ | |
8681 | { | |
8682 | int quotec = c; | |
8683 | while (ibp < limit) { | |
8684 | *obp++ = c = *ibp++; | |
8685 | if (c == quotec) | |
8686 | break; | |
8687 | if (c == '\n' && quotec == '\'') | |
8688 | break; | |
8689 | } | |
8690 | } | |
8691 | break; | |
8692 | } | |
8693 | } | |
8694 | ||
8695 | return obp - start; | |
8696 | } | |
8697 | \f | |
0f41302f MS |
8698 | /* my_strerror - return the descriptive text associated with an |
8699 | `errno' code. */ | |
02cc38b5 RK |
8700 | |
8701 | char * | |
8702 | my_strerror (errnum) | |
8703 | int errnum; | |
8704 | { | |
8705 | char *result; | |
8706 | ||
8707 | #ifndef VMS | |
8708 | #ifndef HAVE_STRERROR | |
8709 | result = (char *) ((errnum < sys_nerr) ? sys_errlist[errnum] : 0); | |
8710 | #else | |
8711 | result = strerror (errnum); | |
8712 | #endif | |
8713 | #else /* VMS */ | |
8714 | /* VAXCRTL's strerror() takes an optional second argument, which only | |
8715 | matters when the first argument is EVMSERR. However, it's simplest | |
8716 | just to pass it unconditionally. `vaxc$errno' is declared in | |
8717 | <errno.h>, and maintained by the library in parallel with `errno'. | |
8718 | We assume that caller's `errnum' either matches the last setting of | |
8719 | `errno' by the library or else does not have the value `EVMSERR'. */ | |
8720 | ||
8721 | result = strerror (errnum, vaxc$errno); | |
8722 | #endif | |
8723 | ||
8724 | if (!result) | |
8725 | result = "undocumented I/O error"; | |
8726 | ||
8727 | return result; | |
8728 | } | |
8729 | ||
0f41302f | 8730 | /* error - print error message and increment count of errors. */ |
b0bbbd85 RS |
8731 | |
8732 | void | |
25cbb59e RK |
8733 | error (PRINTF_ALIST (msg)) |
8734 | PRINTF_DCL (msg) | |
8735 | { | |
8736 | va_list args; | |
8737 | ||
8738 | VA_START (args, msg); | |
8739 | verror (msg, args); | |
8740 | va_end (args); | |
8741 | } | |
8742 | ||
8743 | static void | |
8744 | verror (msg, args) | |
b0bbbd85 | 8745 | char *msg; |
25cbb59e | 8746 | va_list args; |
b0bbbd85 RS |
8747 | { |
8748 | int i; | |
8749 | FILE_BUF *ip = NULL; | |
8750 | ||
8751 | print_containing_files (); | |
8752 | ||
8753 | for (i = indepth; i >= 0; i--) | |
8754 | if (instack[i].fname != NULL) { | |
8755 | ip = &instack[i]; | |
8756 | break; | |
8757 | } | |
8758 | ||
8759 | if (ip != NULL) | |
8760 | fprintf (stderr, "%s:%d: ", ip->nominal_fname, ip->lineno); | |
25cbb59e | 8761 | vfprintf (stderr, msg, args); |
b0bbbd85 RS |
8762 | fprintf (stderr, "\n"); |
8763 | errors++; | |
8764 | } | |
8765 | ||
8766 | /* Error including a message from `errno'. */ | |
8767 | ||
8768 | static void | |
8769 | error_from_errno (name) | |
8770 | char *name; | |
8771 | { | |
8772 | int i; | |
8773 | FILE_BUF *ip = NULL; | |
8774 | ||
8775 | print_containing_files (); | |
8776 | ||
8777 | for (i = indepth; i >= 0; i--) | |
8778 | if (instack[i].fname != NULL) { | |
8779 | ip = &instack[i]; | |
8780 | break; | |
8781 | } | |
8782 | ||
8783 | if (ip != NULL) | |
8784 | fprintf (stderr, "%s:%d: ", ip->nominal_fname, ip->lineno); | |
8785 | ||
02cc38b5 | 8786 | fprintf (stderr, "%s: %s\n", name, my_strerror (errno)); |
b0bbbd85 RS |
8787 | |
8788 | errors++; | |
8789 | } | |
8790 | ||
8791 | /* Print error message but don't count it. */ | |
8792 | ||
8793 | void | |
25cbb59e RK |
8794 | warning (PRINTF_ALIST (msg)) |
8795 | PRINTF_DCL (msg) | |
8796 | { | |
8797 | va_list args; | |
8798 | ||
8799 | VA_START (args, msg); | |
8800 | vwarning (msg, args); | |
8801 | va_end (args); | |
8802 | } | |
8803 | ||
8804 | static void | |
8805 | vwarning (msg, args) | |
b0bbbd85 | 8806 | char *msg; |
25cbb59e | 8807 | va_list args; |
b0bbbd85 RS |
8808 | { |
8809 | int i; | |
8810 | FILE_BUF *ip = NULL; | |
8811 | ||
8812 | if (inhibit_warnings) | |
8813 | return; | |
8814 | ||
8815 | if (warnings_are_errors) | |
8816 | errors++; | |
8817 | ||
8818 | print_containing_files (); | |
8819 | ||
8820 | for (i = indepth; i >= 0; i--) | |
8821 | if (instack[i].fname != NULL) { | |
8822 | ip = &instack[i]; | |
8823 | break; | |
8824 | } | |
8825 | ||
8826 | if (ip != NULL) | |
8827 | fprintf (stderr, "%s:%d: ", ip->nominal_fname, ip->lineno); | |
8828 | fprintf (stderr, "warning: "); | |
25cbb59e | 8829 | vfprintf (stderr, msg, args); |
b0bbbd85 RS |
8830 | fprintf (stderr, "\n"); |
8831 | } | |
8832 | ||
8833 | static void | |
25cbb59e RK |
8834 | #if defined (__STDC__) && defined (HAVE_VPRINTF) |
8835 | error_with_line (int line, PRINTF_ALIST (msg)) | |
8836 | #else | |
8837 | error_with_line (line, PRINTF_ALIST (msg)) | |
8838 | int line; | |
8839 | PRINTF_DCL (msg) | |
8840 | #endif | |
8841 | { | |
8842 | va_list args; | |
8843 | ||
8844 | VA_START (args, msg); | |
8845 | verror_with_line (line, msg, args); | |
8846 | va_end (args); | |
8847 | } | |
8848 | ||
8849 | static void | |
8850 | verror_with_line (line, msg, args) | |
b0bbbd85 RS |
8851 | int line; |
8852 | char *msg; | |
25cbb59e | 8853 | va_list args; |
b0bbbd85 RS |
8854 | { |
8855 | int i; | |
8856 | FILE_BUF *ip = NULL; | |
8857 | ||
8858 | print_containing_files (); | |
8859 | ||
8860 | for (i = indepth; i >= 0; i--) | |
8861 | if (instack[i].fname != NULL) { | |
8862 | ip = &instack[i]; | |
8863 | break; | |
8864 | } | |
8865 | ||
8866 | if (ip != NULL) | |
8867 | fprintf (stderr, "%s:%d: ", ip->nominal_fname, line); | |
25cbb59e | 8868 | vfprintf (stderr, msg, args); |
b0bbbd85 RS |
8869 | fprintf (stderr, "\n"); |
8870 | errors++; | |
8871 | } | |
8872 | ||
254d3f88 RK |
8873 | static void |
8874 | #if defined (__STDC__) && defined (HAVE_VPRINTF) | |
8875 | warning_with_line (int line, PRINTF_ALIST (msg)) | |
8876 | #else | |
8877 | warning_with_line (line, PRINTF_ALIST (msg)) | |
8878 | int line; | |
8879 | PRINTF_DCL (msg) | |
8880 | #endif | |
8881 | { | |
8882 | va_list args; | |
8883 | ||
8884 | VA_START (args, msg); | |
8885 | vwarning_with_line (line, msg, args); | |
8886 | va_end (args); | |
8887 | } | |
8888 | ||
27a5574b | 8889 | static void |
25cbb59e | 8890 | vwarning_with_line (line, msg, args) |
27a5574b RS |
8891 | int line; |
8892 | char *msg; | |
25cbb59e | 8893 | va_list args; |
27a5574b RS |
8894 | { |
8895 | int i; | |
8896 | FILE_BUF *ip = NULL; | |
8897 | ||
8898 | if (inhibit_warnings) | |
8899 | return; | |
8900 | ||
8901 | if (warnings_are_errors) | |
8902 | errors++; | |
8903 | ||
8904 | print_containing_files (); | |
8905 | ||
8906 | for (i = indepth; i >= 0; i--) | |
8907 | if (instack[i].fname != NULL) { | |
8908 | ip = &instack[i]; | |
8909 | break; | |
8910 | } | |
8911 | ||
8912 | if (ip != NULL) | |
254d3f88 | 8913 | fprintf (stderr, line ? "%s:%d: " : "%s: ", ip->nominal_fname, line); |
27a5574b | 8914 | fprintf (stderr, "warning: "); |
25cbb59e | 8915 | vfprintf (stderr, msg, args); |
27a5574b RS |
8916 | fprintf (stderr, "\n"); |
8917 | } | |
8918 | ||
0f41302f | 8919 | /* Print an error message and maybe count it. */ |
b0bbbd85 RS |
8920 | |
8921 | void | |
25cbb59e RK |
8922 | pedwarn (PRINTF_ALIST (msg)) |
8923 | PRINTF_DCL (msg) | |
b0bbbd85 | 8924 | { |
25cbb59e RK |
8925 | va_list args; |
8926 | ||
8927 | VA_START (args, msg); | |
b0bbbd85 | 8928 | if (pedantic_errors) |
25cbb59e | 8929 | verror (msg, args); |
b0bbbd85 | 8930 | else |
25cbb59e RK |
8931 | vwarning (msg, args); |
8932 | va_end (args); | |
b0bbbd85 RS |
8933 | } |
8934 | ||
27a5574b | 8935 | void |
25cbb59e RK |
8936 | #if defined (__STDC__) && defined (HAVE_VPRINTF) |
8937 | pedwarn_with_line (int line, PRINTF_ALIST (msg)) | |
8938 | #else | |
8939 | pedwarn_with_line (line, PRINTF_ALIST (msg)) | |
27a5574b | 8940 | int line; |
25cbb59e RK |
8941 | PRINTF_DCL (msg) |
8942 | #endif | |
27a5574b | 8943 | { |
25cbb59e RK |
8944 | va_list args; |
8945 | ||
8946 | VA_START (args, msg); | |
27a5574b | 8947 | if (pedantic_errors) |
25cbb59e | 8948 | verror_with_line (line, msg, args); |
27a5574b | 8949 | else |
25cbb59e RK |
8950 | vwarning_with_line (line, msg, args); |
8951 | va_end (args); | |
27a5574b RS |
8952 | } |
8953 | ||
b0bbbd85 RS |
8954 | /* Report a warning (or an error if pedantic_errors) |
8955 | giving specified file name and line number, not current. */ | |
8956 | ||
8957 | static void | |
25cbb59e RK |
8958 | #if defined (__STDC__) && defined (HAVE_VPRINTF) |
8959 | pedwarn_with_file_and_line (char *file, int line, PRINTF_ALIST (msg)) | |
8960 | #else | |
8961 | pedwarn_with_file_and_line (file, line, PRINTF_ALIST (msg)) | |
b0bbbd85 RS |
8962 | char *file; |
8963 | int line; | |
25cbb59e RK |
8964 | PRINTF_DCL (msg) |
8965 | #endif | |
b0bbbd85 | 8966 | { |
25cbb59e RK |
8967 | va_list args; |
8968 | ||
b0bbbd85 RS |
8969 | if (!pedantic_errors && inhibit_warnings) |
8970 | return; | |
8971 | if (file != NULL) | |
8972 | fprintf (stderr, "%s:%d: ", file, line); | |
27a5574b | 8973 | if (pedantic_errors) |
b0bbbd85 RS |
8974 | errors++; |
8975 | if (!pedantic_errors) | |
8976 | fprintf (stderr, "warning: "); | |
25cbb59e RK |
8977 | VA_START (args, msg); |
8978 | vfprintf (stderr, msg, args); | |
8979 | va_end (args); | |
b0bbbd85 RS |
8980 | fprintf (stderr, "\n"); |
8981 | } | |
8982 | \f | |
8983 | /* Print the file names and line numbers of the #include | |
adcfa681 | 8984 | directives which led to the current file. */ |
b0bbbd85 RS |
8985 | |
8986 | static void | |
8987 | print_containing_files () | |
8988 | { | |
8989 | FILE_BUF *ip = NULL; | |
8990 | int i; | |
8991 | int first = 1; | |
8992 | ||
8993 | /* If stack of files hasn't changed since we last printed | |
8994 | this info, don't repeat it. */ | |
8995 | if (last_error_tick == input_file_stack_tick) | |
8996 | return; | |
8997 | ||
8998 | for (i = indepth; i >= 0; i--) | |
8999 | if (instack[i].fname != NULL) { | |
9000 | ip = &instack[i]; | |
9001 | break; | |
9002 | } | |
9003 | ||
9004 | /* Give up if we don't find a source file. */ | |
9005 | if (ip == NULL) | |
9006 | return; | |
9007 | ||
9008 | /* Find the other, outer source files. */ | |
9009 | for (i--; i >= 0; i--) | |
9010 | if (instack[i].fname != NULL) { | |
9011 | ip = &instack[i]; | |
9012 | if (first) { | |
9013 | first = 0; | |
9014 | fprintf (stderr, "In file included"); | |
9015 | } else { | |
6b46c090 | 9016 | fprintf (stderr, ",\n "); |
b0bbbd85 RS |
9017 | } |
9018 | ||
9019 | fprintf (stderr, " from %s:%d", ip->nominal_fname, ip->lineno); | |
9020 | } | |
9021 | if (! first) | |
9022 | fprintf (stderr, ":\n"); | |
9023 | ||
9024 | /* Record we have printed the status as of this time. */ | |
9025 | last_error_tick = input_file_stack_tick; | |
9026 | } | |
9027 | \f | |
9028 | /* Return the line at which an error occurred. | |
9029 | The error is not necessarily associated with the current spot | |
9030 | in the input stack, so LINE says where. LINE will have been | |
9031 | copied from ip->lineno for the current input level. | |
9032 | If the current level is for a file, we return LINE. | |
9033 | But if the current level is not for a file, LINE is meaningless. | |
9034 | In that case, we return the lineno of the innermost file. */ | |
9035 | ||
9036 | static int | |
9037 | line_for_error (line) | |
9038 | int line; | |
9039 | { | |
9040 | int i; | |
9041 | int line1 = line; | |
9042 | ||
9043 | for (i = indepth; i >= 0; ) { | |
9044 | if (instack[i].fname != 0) | |
9045 | return line1; | |
9046 | i--; | |
9047 | if (i < 0) | |
9048 | return 0; | |
9049 | line1 = instack[i].lineno; | |
9050 | } | |
9051 | abort (); | |
9052 | /*NOTREACHED*/ | |
9053 | return 0; | |
9054 | } | |
9055 | ||
9056 | /* | |
9057 | * If OBUF doesn't have NEEDED bytes after OPTR, make it bigger. | |
9058 | * | |
9059 | * As things stand, nothing is ever placed in the output buffer to be | |
9060 | * removed again except when it's KNOWN to be part of an identifier, | |
9061 | * so flushing and moving down everything left, instead of expanding, | |
9062 | * should work ok. | |
9063 | */ | |
9064 | ||
9065 | /* You might think void was cleaner for the return type, | |
9066 | but that would get type mismatch in check_expand in strict ANSI. */ | |
0f41302f | 9067 | |
b0bbbd85 RS |
9068 | static int |
9069 | grow_outbuf (obuf, needed) | |
9070 | register FILE_BUF *obuf; | |
9071 | register int needed; | |
9072 | { | |
9073 | register U_CHAR *p; | |
9074 | int minsize; | |
9075 | ||
9076 | if (obuf->length - (obuf->bufp - obuf->buf) > needed) | |
9077 | return 0; | |
9078 | ||
9079 | /* Make it at least twice as big as it is now. */ | |
9080 | obuf->length *= 2; | |
9081 | /* Make it have at least 150% of the free space we will need. */ | |
9082 | minsize = (3 * needed) / 2 + (obuf->bufp - obuf->buf); | |
9083 | if (minsize > obuf->length) | |
9084 | obuf->length = minsize; | |
9085 | ||
9086 | if ((p = (U_CHAR *) xrealloc (obuf->buf, obuf->length)) == NULL) | |
9087 | memory_full (); | |
9088 | ||
9089 | obuf->bufp = p + (obuf->bufp - obuf->buf); | |
9090 | obuf->buf = p; | |
9091 | ||
9092 | return 0; | |
9093 | } | |
9094 | \f | |
9095 | /* Symbol table for macro names and special symbols */ | |
9096 | ||
9097 | /* | |
9098 | * install a name in the main hash table, even if it is already there. | |
9099 | * name stops with first non alphanumeric, except leading '#'. | |
9100 | * caller must check against redefinition if that is desired. | |
9101 | * delete_macro () removes things installed by install () in fifo order. | |
9102 | * this is important because of the `defined' special symbol used | |
9103 | * in #if, and also if pushdef/popdef directives are ever implemented. | |
9104 | * | |
9105 | * If LEN is >= 0, it is the length of the name. | |
9106 | * Otherwise, compute the length by scanning the entire name. | |
9107 | * | |
9108 | * If HASH is >= 0, it is the precomputed hash code. | |
0f41302f | 9109 | * Otherwise, compute the hash code. |
b0bbbd85 | 9110 | */ |
0f41302f | 9111 | |
b0bbbd85 | 9112 | static HASHNODE * |
91dbf5e7 | 9113 | install (name, len, type, value, hash) |
b0bbbd85 RS |
9114 | U_CHAR *name; |
9115 | int len; | |
9116 | enum node_type type; | |
47b2881e | 9117 | char *value; |
b0bbbd85 | 9118 | int hash; |
b0bbbd85 RS |
9119 | { |
9120 | register HASHNODE *hp; | |
9121 | register int i, bucket; | |
9122 | register U_CHAR *p, *q; | |
9123 | ||
9124 | if (len < 0) { | |
9125 | p = name; | |
9126 | while (is_idchar[*p]) | |
9127 | p++; | |
9128 | len = p - name; | |
9129 | } | |
9130 | ||
9131 | if (hash < 0) | |
9132 | hash = hashf (name, len, HASHSIZE); | |
9133 | ||
9134 | i = sizeof (HASHNODE) + len + 1; | |
9135 | hp = (HASHNODE *) xmalloc (i); | |
9136 | bucket = hash; | |
9137 | hp->bucket_hdr = &hashtab[bucket]; | |
9138 | hp->next = hashtab[bucket]; | |
9139 | hashtab[bucket] = hp; | |
9140 | hp->prev = NULL; | |
9141 | if (hp->next != NULL) | |
9142 | hp->next->prev = hp; | |
9143 | hp->type = type; | |
9144 | hp->length = len; | |
91dbf5e7 | 9145 | hp->value.cpval = value; |
b0bbbd85 RS |
9146 | hp->name = ((U_CHAR *) hp) + sizeof (HASHNODE); |
9147 | p = hp->name; | |
9148 | q = name; | |
9149 | for (i = 0; i < len; i++) | |
9150 | *p++ = *q++; | |
9151 | hp->name[len] = 0; | |
9152 | return hp; | |
9153 | } | |
9154 | ||
9155 | /* | |
9156 | * find the most recent hash node for name name (ending with first | |
9157 | * non-identifier char) installed by install | |
9158 | * | |
9159 | * If LEN is >= 0, it is the length of the name. | |
9160 | * Otherwise, compute the length by scanning the entire name. | |
9161 | * | |
9162 | * If HASH is >= 0, it is the precomputed hash code. | |
9163 | * Otherwise, compute the hash code. | |
9164 | */ | |
0f41302f | 9165 | |
b0bbbd85 RS |
9166 | HASHNODE * |
9167 | lookup (name, len, hash) | |
9168 | U_CHAR *name; | |
9169 | int len; | |
9170 | int hash; | |
9171 | { | |
9172 | register U_CHAR *bp; | |
9173 | register HASHNODE *bucket; | |
9174 | ||
9175 | if (len < 0) { | |
9176 | for (bp = name; is_idchar[*bp]; bp++) ; | |
9177 | len = bp - name; | |
9178 | } | |
9179 | ||
9180 | if (hash < 0) | |
9181 | hash = hashf (name, len, HASHSIZE); | |
9182 | ||
9183 | bucket = hashtab[hash]; | |
9184 | while (bucket) { | |
25cbb59e | 9185 | if (bucket->length == len && bcmp (bucket->name, name, len) == 0) |
b0bbbd85 RS |
9186 | return bucket; |
9187 | bucket = bucket->next; | |
9188 | } | |
9189 | return NULL; | |
9190 | } | |
9191 | ||
9192 | /* | |
9193 | * Delete a hash node. Some weirdness to free junk from macros. | |
9194 | * More such weirdness will have to be added if you define more hash | |
9195 | * types that need it. | |
9196 | */ | |
9197 | ||
9198 | /* Note that the DEFINITION of a macro is removed from the hash table | |
9199 | but its storage is not freed. This would be a storage leak | |
9200 | except that it is not reasonable to keep undefining and redefining | |
9201 | large numbers of macros many times. | |
9202 | In any case, this is necessary, because a macro can be #undef'd | |
9203 | in the middle of reading the arguments to a call to it. | |
9204 | If #undef freed the DEFINITION, that would crash. */ | |
9205 | ||
9206 | static void | |
9207 | delete_macro (hp) | |
9208 | HASHNODE *hp; | |
9209 | { | |
9210 | ||
9211 | if (hp->prev != NULL) | |
9212 | hp->prev->next = hp->next; | |
9213 | if (hp->next != NULL) | |
9214 | hp->next->prev = hp->prev; | |
9215 | ||
0f41302f MS |
9216 | /* Make sure that the bucket chain header that the deleted guy was |
9217 | on points to the right thing afterwards. */ | |
b0bbbd85 RS |
9218 | if (hp == *hp->bucket_hdr) |
9219 | *hp->bucket_hdr = hp->next; | |
9220 | ||
9221 | #if 0 | |
9222 | if (hp->type == T_MACRO) { | |
9223 | DEFINITION *d = hp->value.defn; | |
9224 | struct reflist *ap, *nextap; | |
9225 | ||
9226 | for (ap = d->pattern; ap != NULL; ap = nextap) { | |
9227 | nextap = ap->next; | |
9228 | free (ap); | |
9229 | } | |
9230 | free (d); | |
9231 | } | |
9232 | #endif | |
9233 | free (hp); | |
9234 | } | |
9235 | ||
9236 | /* | |
9237 | * return hash function on name. must be compatible with the one | |
9238 | * computed a step at a time, elsewhere | |
9239 | */ | |
0f41302f | 9240 | |
b0bbbd85 RS |
9241 | static int |
9242 | hashf (name, len, hashsize) | |
9243 | register U_CHAR *name; | |
9244 | register int len; | |
9245 | int hashsize; | |
9246 | { | |
9247 | register int r = 0; | |
9248 | ||
9249 | while (len--) | |
9250 | r = HASHSTEP (r, *name++); | |
9251 | ||
9252 | return MAKE_POS (r) % hashsize; | |
9253 | } | |
9254 | \f | |
9255 | ||
9256 | /* Dump the definition of a single macro HP to OF. */ | |
0f41302f | 9257 | |
b0bbbd85 RS |
9258 | static void |
9259 | dump_single_macro (hp, of) | |
9260 | register HASHNODE *hp; | |
9261 | FILE *of; | |
9262 | { | |
9263 | register DEFINITION *defn = hp->value.defn; | |
9264 | struct reflist *ap; | |
9265 | int offset; | |
9266 | int concat; | |
9267 | ||
9268 | ||
9269 | /* Print the definition of the macro HP. */ | |
9270 | ||
9271 | fprintf (of, "#define %s", hp->name); | |
9272 | ||
9273 | if (defn->nargs >= 0) { | |
9274 | int i; | |
9275 | ||
9276 | fprintf (of, "("); | |
9277 | for (i = 0; i < defn->nargs; i++) { | |
9278 | dump_arg_n (defn, i, of); | |
9279 | if (i + 1 < defn->nargs) | |
9280 | fprintf (of, ", "); | |
9281 | } | |
9282 | fprintf (of, ")"); | |
9283 | } | |
9284 | ||
9285 | fprintf (of, " "); | |
9286 | ||
9287 | offset = 0; | |
9288 | concat = 0; | |
9289 | for (ap = defn->pattern; ap != NULL; ap = ap->next) { | |
9290 | dump_defn_1 (defn->expansion, offset, ap->nchars, of); | |
b0bbbd85 | 9291 | offset += ap->nchars; |
f46b6be4 RK |
9292 | if (!traditional) { |
9293 | if (ap->nchars != 0) | |
9294 | concat = 0; | |
5bdc1512 RK |
9295 | if (ap->stringify) { |
9296 | switch (ap->stringify) { | |
9297 | case SHARP_TOKEN: fprintf (of, "#"); break; | |
9298 | case WHITE_SHARP_TOKEN: fprintf (of, "# "); break; | |
03285371 RK |
9299 | case PERCENT_COLON_TOKEN: fprintf (of, "%%:"); break; |
9300 | case WHITE_PERCENT_COLON_TOKEN: fprintf (of, "%%: "); break; | |
25cbb59e | 9301 | default: abort (); |
5bdc1512 RK |
9302 | } |
9303 | } | |
27027a60 | 9304 | if (ap->raw_before != 0) { |
5bdc1512 RK |
9305 | if (concat) { |
9306 | switch (ap->raw_before) { | |
9307 | case WHITE_SHARP_TOKEN: | |
9308 | case WHITE_PERCENT_COLON_TOKEN: | |
9309 | fprintf (of, " "); | |
9310 | break; | |
25cbb59e RK |
9311 | default: |
9312 | break; | |
5bdc1512 RK |
9313 | } |
9314 | } else { | |
9315 | switch (ap->raw_before) { | |
9316 | case SHARP_TOKEN: fprintf (of, "##"); break; | |
9317 | case WHITE_SHARP_TOKEN: fprintf (of, "## "); break; | |
03285371 RK |
9318 | case PERCENT_COLON_TOKEN: fprintf (of, "%%:%%:"); break; |
9319 | case WHITE_PERCENT_COLON_TOKEN: fprintf (of, "%%:%%: "); break; | |
25cbb59e | 9320 | default: abort (); |
5bdc1512 RK |
9321 | } |
9322 | } | |
9323 | } | |
f46b6be4 RK |
9324 | concat = 0; |
9325 | } | |
b0bbbd85 | 9326 | dump_arg_n (defn, ap->argno, of); |
27027a60 | 9327 | if (!traditional && ap->raw_after != 0) { |
5bdc1512 RK |
9328 | switch (ap->raw_after) { |
9329 | case SHARP_TOKEN: fprintf (of, "##"); break; | |
9330 | case WHITE_SHARP_TOKEN: fprintf (of, " ##"); break; | |
03285371 RK |
9331 | case PERCENT_COLON_TOKEN: fprintf (of, "%%:%%:"); break; |
9332 | case WHITE_PERCENT_COLON_TOKEN: fprintf (of, " %%:%%:"); break; | |
25cbb59e | 9333 | default: abort (); |
5bdc1512 | 9334 | } |
b0bbbd85 RS |
9335 | concat = 1; |
9336 | } | |
9337 | } | |
9338 | dump_defn_1 (defn->expansion, offset, defn->length - offset, of); | |
9339 | fprintf (of, "\n"); | |
9340 | } | |
9341 | ||
9342 | /* Dump all macro definitions as #defines to stdout. */ | |
9343 | ||
9344 | static void | |
9345 | dump_all_macros () | |
9346 | { | |
9347 | int bucket; | |
9348 | ||
9349 | for (bucket = 0; bucket < HASHSIZE; bucket++) { | |
9350 | register HASHNODE *hp; | |
9351 | ||
9352 | for (hp = hashtab[bucket]; hp; hp= hp->next) { | |
9353 | if (hp->type == T_MACRO) | |
9354 | dump_single_macro (hp, stdout); | |
9355 | } | |
9356 | } | |
9357 | } | |
9358 | ||
9359 | /* Output to OF a substring of a macro definition. | |
9360 | BASE is the beginning of the definition. | |
9361 | Output characters START thru LENGTH. | |
f46b6be4 | 9362 | Unless traditional, discard newlines outside of strings, thus |
b0bbbd85 RS |
9363 | converting funny-space markers to ordinary spaces. */ |
9364 | ||
9365 | static void | |
9366 | dump_defn_1 (base, start, length, of) | |
9367 | U_CHAR *base; | |
9368 | int start; | |
9369 | int length; | |
9370 | FILE *of; | |
9371 | { | |
9372 | U_CHAR *p = base + start; | |
9373 | U_CHAR *limit = base + start + length; | |
9374 | ||
f46b6be4 RK |
9375 | if (traditional) |
9376 | fwrite (p, sizeof (*p), length, of); | |
9377 | else { | |
9378 | while (p < limit) { | |
9379 | if (*p == '\"' || *p =='\'') { | |
9380 | U_CHAR *p1 = skip_quoted_string (p, limit, 0, NULL_PTR, | |
9381 | NULL_PTR, NULL_PTR); | |
9382 | fwrite (p, sizeof (*p), p1 - p, of); | |
9383 | p = p1; | |
9384 | } else { | |
9385 | if (*p != '\n') | |
9386 | putc (*p, of); | |
9387 | p++; | |
9388 | } | |
b0bbbd85 | 9389 | } |
b0bbbd85 RS |
9390 | } |
9391 | } | |
9392 | ||
9393 | /* Print the name of argument number ARGNUM of macro definition DEFN | |
9394 | to OF. | |
9395 | Recall that DEFN->args.argnames contains all the arg names | |
9396 | concatenated in reverse order with comma-space in between. */ | |
9397 | ||
9398 | static void | |
9399 | dump_arg_n (defn, argnum, of) | |
9400 | DEFINITION *defn; | |
9401 | int argnum; | |
9402 | FILE *of; | |
9403 | { | |
9404 | register U_CHAR *p = defn->args.argnames; | |
9405 | while (argnum + 1 < defn->nargs) { | |
25cbb59e | 9406 | p = (U_CHAR *) index ((char *) p, ' ') + 1; |
b0bbbd85 RS |
9407 | argnum++; |
9408 | } | |
9409 | ||
9410 | while (*p && *p != ',') { | |
9411 | putc (*p, of); | |
9412 | p++; | |
9413 | } | |
9414 | } | |
9415 | \f | |
9416 | /* Initialize syntactic classifications of characters. */ | |
9417 | ||
9418 | static void | |
9419 | initialize_char_syntax () | |
9420 | { | |
9421 | register int i; | |
9422 | ||
9423 | /* | |
9424 | * Set up is_idchar and is_idstart tables. These should be | |
9425 | * faster than saying (is_alpha (c) || c == '_'), etc. | |
9426 | * Set up these things before calling any routines tthat | |
9427 | * refer to them. | |
9428 | */ | |
9429 | for (i = 'a'; i <= 'z'; i++) { | |
9430 | is_idchar[i - 'a' + 'A'] = 1; | |
9431 | is_idchar[i] = 1; | |
9432 | is_idstart[i - 'a' + 'A'] = 1; | |
9433 | is_idstart[i] = 1; | |
9434 | } | |
9435 | for (i = '0'; i <= '9'; i++) | |
9436 | is_idchar[i] = 1; | |
9437 | is_idchar['_'] = 1; | |
9438 | is_idstart['_'] = 1; | |
9439 | is_idchar['$'] = dollars_in_ident; | |
9440 | is_idstart['$'] = dollars_in_ident; | |
9441 | ||
9442 | /* horizontal space table */ | |
9443 | is_hor_space[' '] = 1; | |
9444 | is_hor_space['\t'] = 1; | |
9445 | is_hor_space['\v'] = 1; | |
9446 | is_hor_space['\f'] = 1; | |
9447 | is_hor_space['\r'] = 1; | |
9448 | ||
9449 | is_space[' '] = 1; | |
9450 | is_space['\t'] = 1; | |
9451 | is_space['\v'] = 1; | |
9452 | is_space['\f'] = 1; | |
9453 | is_space['\n'] = 1; | |
9454 | is_space['\r'] = 1; | |
c03413c7 RK |
9455 | |
9456 | char_name['\v'] = "vertical tab"; | |
9457 | char_name['\f'] = "formfeed"; | |
9458 | char_name['\r'] = "carriage return"; | |
b0bbbd85 RS |
9459 | } |
9460 | ||
9461 | /* Initialize the built-in macros. */ | |
9462 | ||
9463 | static void | |
9464 | initialize_builtins (inp, outp) | |
9465 | FILE_BUF *inp; | |
9466 | FILE_BUF *outp; | |
9467 | { | |
25cbb59e RK |
9468 | install ((U_CHAR *) "__LINE__", -1, T_SPECLINE, NULL_PTR, -1); |
9469 | install ((U_CHAR *) "__DATE__", -1, T_DATE, NULL_PTR, -1); | |
9470 | install ((U_CHAR *) "__FILE__", -1, T_FILE, NULL_PTR, -1); | |
9471 | install ((U_CHAR *) "__BASE_FILE__", -1, T_BASE_FILE, NULL_PTR, -1); | |
9472 | install ((U_CHAR *) "__INCLUDE_LEVEL__", -1, T_INCLUDE_LEVEL, NULL_PTR, -1); | |
9473 | install ((U_CHAR *) "__VERSION__", -1, T_VERSION, NULL_PTR, -1); | |
8da4cd09 | 9474 | #ifndef NO_BUILTIN_SIZE_TYPE |
25cbb59e | 9475 | install ((U_CHAR *) "__SIZE_TYPE__", -1, T_SIZE_TYPE, NULL_PTR, -1); |
8da4cd09 JW |
9476 | #endif |
9477 | #ifndef NO_BUILTIN_PTRDIFF_TYPE | |
25cbb59e | 9478 | install ((U_CHAR *) "__PTRDIFF_TYPE__ ", -1, T_PTRDIFF_TYPE, NULL_PTR, -1); |
8da4cd09 | 9479 | #endif |
25cbb59e RK |
9480 | install ((U_CHAR *) "__WCHAR_TYPE__", -1, T_WCHAR_TYPE, NULL_PTR, -1); |
9481 | install ((U_CHAR *) "__USER_LABEL_PREFIX__", -1, T_USER_LABEL_PREFIX_TYPE, | |
9482 | NULL_PTR, -1); | |
9483 | install ((U_CHAR *) "__REGISTER_PREFIX__", -1, T_REGISTER_PREFIX_TYPE, | |
9484 | NULL_PTR, -1); | |
a9ce110c KR |
9485 | install ((U_CHAR *) "__IMMEDIATE_PREFIX__", -1, T_IMMEDIATE_PREFIX_TYPE, |
9486 | NULL_PTR, -1); | |
25cbb59e | 9487 | install ((U_CHAR *) "__TIME__", -1, T_TIME, NULL_PTR, -1); |
91dbf5e7 | 9488 | if (!traditional) { |
25cbb59e RK |
9489 | install ((U_CHAR *) "__STDC__", -1, T_CONST, "1", -1); |
9490 | install ((U_CHAR *) "__STDC_VERSION__", -1, T_CONST, "199409L", -1); | |
91dbf5e7 | 9491 | } |
b0bbbd85 | 9492 | if (objc) |
25cbb59e | 9493 | install ((U_CHAR *) "__OBJC__", -1, T_CONST, "1", -1); |
b0bbbd85 RS |
9494 | /* This is supplied using a -D by the compiler driver |
9495 | so that it is present only when truly compiling with GNU C. */ | |
25cbb59e | 9496 | /* install ((U_CHAR *) "__GNUC__", -1, T_CONST, "2", -1); */ |
94e4d804 | 9497 | install ((U_CHAR *) "__HAVE_BUILTIN_SETJMP__", -1, T_CONST, "1", -1); |
b0bbbd85 RS |
9498 | |
9499 | if (debug_output) | |
9500 | { | |
9501 | char directive[2048]; | |
25cbb59e | 9502 | U_CHAR *udirective = (U_CHAR *) directive; |
b0bbbd85 | 9503 | register struct directive *dp = &directive_table[0]; |
bfa30b22 | 9504 | struct tm *timebuf = timestamp (); |
b0bbbd85 | 9505 | |
ae34b95d | 9506 | sprintf (directive, " __BASE_FILE__ \"%s\"\n", |
b0bbbd85 | 9507 | instack[0].nominal_fname); |
adcfa681 | 9508 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9509 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9510 | outp, dp); | |
b0bbbd85 | 9511 | |
ae34b95d | 9512 | sprintf (directive, " __VERSION__ \"%s\"\n", version_string); |
adcfa681 | 9513 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9514 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9515 | outp, dp); | |
b0bbbd85 | 9516 | |
9e7270cd | 9517 | #ifndef NO_BUILTIN_SIZE_TYPE |
ae34b95d | 9518 | sprintf (directive, " __SIZE_TYPE__ %s\n", SIZE_TYPE); |
adcfa681 | 9519 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9520 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9521 | outp, dp); | |
9e7270cd | 9522 | #endif |
b0bbbd85 | 9523 | |
9e7270cd | 9524 | #ifndef NO_BUILTIN_PTRDIFF_TYPE |
ae34b95d | 9525 | sprintf (directive, " __PTRDIFF_TYPE__ %s\n", PTRDIFF_TYPE); |
adcfa681 | 9526 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9527 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9528 | outp, dp); | |
9e7270cd | 9529 | #endif |
b0bbbd85 | 9530 | |
767d412c | 9531 | sprintf (directive, " __WCHAR_TYPE__ %s\n", wchar_type); |
adcfa681 | 9532 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9533 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9534 | outp, dp); | |
b0bbbd85 | 9535 | |
ae34b95d | 9536 | sprintf (directive, " __DATE__ \"%s %2d %4d\"\n", |
b0bbbd85 RS |
9537 | monthnames[timebuf->tm_mon], |
9538 | timebuf->tm_mday, timebuf->tm_year + 1900); | |
adcfa681 | 9539 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9540 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9541 | outp, dp); | |
b0bbbd85 | 9542 | |
ae34b95d | 9543 | sprintf (directive, " __TIME__ \"%02d:%02d:%02d\"\n", |
b0bbbd85 | 9544 | timebuf->tm_hour, timebuf->tm_min, timebuf->tm_sec); |
adcfa681 | 9545 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e RK |
9546 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
9547 | outp, dp); | |
b0bbbd85 RS |
9548 | |
9549 | if (!traditional) | |
9550 | { | |
9551 | sprintf (directive, " __STDC__ 1"); | |
adcfa681 | 9552 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e | 9553 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
b0bbbd85 RS |
9554 | outp, dp); |
9555 | } | |
9556 | if (objc) | |
9557 | { | |
9558 | sprintf (directive, " __OBJC__ 1"); | |
adcfa681 | 9559 | output_line_directive (inp, outp, 0, same_file); |
25cbb59e | 9560 | pass_thru_directive (udirective, &udirective[strlen (directive)], |
b0bbbd85 RS |
9561 | outp, dp); |
9562 | } | |
9563 | } | |
9564 | } | |
9565 | \f | |
9566 | /* | |
9567 | * process a given definition string, for initialization | |
9568 | * If STR is just an identifier, define it with value 1. | |
9569 | * If STR has anything after the identifier, then it should | |
9570 | * be identifier=definition. | |
9571 | */ | |
9572 | ||
9573 | static void | |
9574 | make_definition (str, op) | |
25cbb59e | 9575 | char *str; |
b0bbbd85 RS |
9576 | FILE_BUF *op; |
9577 | { | |
9578 | FILE_BUF *ip; | |
9579 | struct directive *kt; | |
9580 | U_CHAR *buf, *p; | |
9581 | ||
25cbb59e | 9582 | p = buf = (U_CHAR *) str; |
b0bbbd85 RS |
9583 | if (!is_idstart[*p]) { |
9584 | error ("malformed option `-D %s'", str); | |
9585 | return; | |
9586 | } | |
9587 | while (is_idchar[*++p]) | |
9588 | ; | |
cac9d91e RK |
9589 | if (*p == '(') { |
9590 | while (is_idchar[*++p] || *p == ',' || is_hor_space[*p]) | |
9591 | ; | |
9592 | if (*p++ != ')') | |
25cbb59e | 9593 | p = (U_CHAR *) str; /* Error */ |
cac9d91e | 9594 | } |
b0bbbd85 RS |
9595 | if (*p == 0) { |
9596 | buf = (U_CHAR *) alloca (p - buf + 4); | |
9597 | strcpy ((char *)buf, str); | |
9598 | strcat ((char *)buf, " 1"); | |
9599 | } else if (*p != '=') { | |
9600 | error ("malformed option `-D %s'", str); | |
9601 | return; | |
9602 | } else { | |
9603 | U_CHAR *q; | |
9604 | /* Copy the entire option so we can modify it. */ | |
9605 | buf = (U_CHAR *) alloca (2 * strlen (str) + 1); | |
25cbb59e | 9606 | strncpy ((char *) buf, str, p - (U_CHAR *) str); |
b0bbbd85 | 9607 | /* Change the = to a space. */ |
25cbb59e | 9608 | buf[p - (U_CHAR *) str] = ' '; |
b0bbbd85 RS |
9609 | /* Scan for any backslash-newline and remove it. */ |
9610 | p++; | |
25cbb59e | 9611 | q = &buf[p - (U_CHAR *) str]; |
b0bbbd85 | 9612 | while (*p) { |
1a6e3d52 RK |
9613 | if (*p == '\"' || *p == '\'') { |
9614 | int unterminated = 0; | |
25cbb59e | 9615 | U_CHAR *p1 = skip_quoted_string (p, p + strlen ((char *) p), 0, |
1a6e3d52 RK |
9616 | NULL_PTR, NULL_PTR, &unterminated); |
9617 | if (unterminated) | |
9618 | return; | |
9619 | while (p != p1) | |
9620 | if (*p == '\\' && p[1] == '\n') | |
9621 | p += 2; | |
9622 | else | |
9623 | *q++ = *p++; | |
9624 | } else if (*p == '\\' && p[1] == '\n') | |
b0bbbd85 RS |
9625 | p += 2; |
9626 | /* Change newline chars into newline-markers. */ | |
9627 | else if (*p == '\n') | |
9628 | { | |
9629 | *q++ = '\n'; | |
9630 | *q++ = '\n'; | |
9631 | p++; | |
9632 | } | |
9633 | else | |
9634 | *q++ = *p++; | |
9635 | } | |
9636 | *q = 0; | |
9637 | } | |
9638 | ||
9639 | ip = &instack[++indepth]; | |
9640 | ip->nominal_fname = ip->fname = "*Initialization*"; | |
9641 | ||
9642 | ip->buf = ip->bufp = buf; | |
25cbb59e | 9643 | ip->length = strlen ((char *) buf); |
b0bbbd85 RS |
9644 | ip->lineno = 1; |
9645 | ip->macro = 0; | |
9646 | ip->free_ptr = 0; | |
9647 | ip->if_stack = if_stack; | |
9648 | ip->system_header_p = 0; | |
9649 | ||
9650 | for (kt = directive_table; kt->type != T_DEFINE; kt++) | |
9651 | ; | |
9652 | ||
2b1a049f | 9653 | /* Pass NULL instead of OP, since this is a "predefined" macro. */ |
25cbb59e | 9654 | do_define (buf, buf + strlen ((char *) buf), NULL_PTR, kt); |
b0bbbd85 RS |
9655 | --indepth; |
9656 | } | |
9657 | ||
9658 | /* JF, this does the work for the -U option */ | |
9659 | ||
9660 | static void | |
9661 | make_undef (str, op) | |
25cbb59e | 9662 | char *str; |
b0bbbd85 RS |
9663 | FILE_BUF *op; |
9664 | { | |
9665 | FILE_BUF *ip; | |
9666 | struct directive *kt; | |
9667 | ||
9668 | ip = &instack[++indepth]; | |
9669 | ip->nominal_fname = ip->fname = "*undef*"; | |
9670 | ||
25cbb59e | 9671 | ip->buf = ip->bufp = (U_CHAR *) str; |
b0bbbd85 RS |
9672 | ip->length = strlen (str); |
9673 | ip->lineno = 1; | |
9674 | ip->macro = 0; | |
9675 | ip->free_ptr = 0; | |
9676 | ip->if_stack = if_stack; | |
9677 | ip->system_header_p = 0; | |
9678 | ||
9679 | for (kt = directive_table; kt->type != T_UNDEF; kt++) | |
9680 | ; | |
9681 | ||
25cbb59e | 9682 | do_undef ((U_CHAR *) str, (U_CHAR *) str + strlen (str), op, kt); |
b0bbbd85 RS |
9683 | --indepth; |
9684 | } | |
9685 | \f | |
9686 | /* Process the string STR as if it appeared as the body of a #assert. | |
9687 | OPTION is the option name for which STR was the argument. */ | |
9688 | ||
9689 | static void | |
9690 | make_assertion (option, str) | |
9691 | char *option; | |
25cbb59e | 9692 | char *str; |
b0bbbd85 RS |
9693 | { |
9694 | FILE_BUF *ip; | |
9695 | struct directive *kt; | |
9696 | U_CHAR *buf, *p, *q; | |
9697 | ||
9698 | /* Copy the entire option so we can modify it. */ | |
9699 | buf = (U_CHAR *) alloca (strlen (str) + 1); | |
9700 | strcpy ((char *) buf, str); | |
9701 | /* Scan for any backslash-newline and remove it. */ | |
9702 | p = q = buf; | |
9703 | while (*p) { | |
9704 | if (*p == '\\' && p[1] == '\n') | |
9705 | p += 2; | |
9706 | else | |
9707 | *q++ = *p++; | |
9708 | } | |
9709 | *q = 0; | |
9710 | ||
9711 | p = buf; | |
9712 | if (!is_idstart[*p]) { | |
9713 | error ("malformed option `%s %s'", option, str); | |
9714 | return; | |
9715 | } | |
9716 | while (is_idchar[*++p]) | |
9717 | ; | |
c03413c7 | 9718 | SKIP_WHITE_SPACE (p); |
b0bbbd85 RS |
9719 | if (! (*p == 0 || *p == '(')) { |
9720 | error ("malformed option `%s %s'", option, str); | |
9721 | return; | |
9722 | } | |
9723 | ||
9724 | ip = &instack[++indepth]; | |
9725 | ip->nominal_fname = ip->fname = "*Initialization*"; | |
9726 | ||
9727 | ip->buf = ip->bufp = buf; | |
25cbb59e | 9728 | ip->length = strlen ((char *) buf); |
b0bbbd85 RS |
9729 | ip->lineno = 1; |
9730 | ip->macro = 0; | |
9731 | ip->free_ptr = 0; | |
9732 | ip->if_stack = if_stack; | |
9733 | ip->system_header_p = 0; | |
9734 | ||
9735 | for (kt = directive_table; kt->type != T_ASSERT; kt++) | |
9736 | ; | |
9737 | ||
0f41302f MS |
9738 | /* Pass NULL as output ptr to do_define since we KNOW it never does |
9739 | any output.... */ | |
25cbb59e | 9740 | do_assert (buf, buf + strlen ((char *) buf) , NULL_PTR, kt); |
b0bbbd85 RS |
9741 | --indepth; |
9742 | } | |
9743 | \f | |
3e4115b7 RK |
9744 | /* The previous include prefix, if any, is PREV_FILE_NAME. |
9745 | Allocate a new include prefix whose name is the | |
9746 | simplified concatenation of PREFIX and NAME, | |
9747 | with a trailing / added if needed. | |
9748 | But return 0 if the include prefix should be ignored, | |
9749 | e.g. because it is a duplicate of PREV_FILE_NAME. */ | |
9750 | ||
9751 | static struct file_name_list * | |
9752 | new_include_prefix (prev_file_name, prefix, name) | |
9753 | struct file_name_list *prev_file_name; | |
9754 | char *prefix; | |
9755 | char *name; | |
9756 | { | |
9757 | if (!name) | |
9758 | fatal ("Directory name missing after command line option"); | |
9759 | ||
9760 | if (!*name) | |
9761 | /* Ignore the empty string. */ | |
9762 | return 0; | |
9763 | else { | |
9764 | struct file_name_list *dir | |
9765 | = ((struct file_name_list *) | |
9766 | xmalloc (sizeof (struct file_name_list) | |
9767 | + strlen (prefix) + strlen (name) + 1 /* for trailing / */)); | |
9768 | size_t len; | |
9769 | strcpy (dir->fname, prefix); | |
9770 | strcat (dir->fname, name); | |
9771 | len = simplify_filename (dir->fname); | |
9772 | ||
9773 | /* Convert directory name to a prefix. */ | |
9774 | if (dir->fname[len - 1] != '/') { | |
9775 | if (len == 1 && dir->fname[len - 1] == '.') | |
9776 | len = 0; | |
9777 | else | |
9778 | dir->fname[len++] = '/'; | |
9779 | dir->fname[len] = 0; | |
9780 | } | |
9781 | ||
9782 | /* Ignore a directory whose name matches the previous one. */ | |
9783 | if (prev_file_name && !strcmp (prev_file_name->fname, dir->fname)) { | |
9784 | /* But treat `-Idir -I- -Idir' as `-I- -Idir'. */ | |
9785 | if (!first_bracket_include) | |
9786 | first_bracket_include = prev_file_name; | |
9787 | free (dir); | |
9788 | return 0; | |
9789 | } | |
9790 | ||
9fb1a98e RK |
9791 | #ifndef VMS |
9792 | /* VMS can't stat dir prefixes, so skip these optimizations in VMS. */ | |
9793 | ||
3e4115b7 RK |
9794 | /* Ignore a nonexistent directory. */ |
9795 | if (stat (len ? dir->fname : ".", &dir->st) != 0) { | |
f14c3e3d | 9796 | if (errno != ENOENT && errno != ENOTDIR) |
3e4115b7 RK |
9797 | error_from_errno (dir->fname); |
9798 | free (dir); | |
9799 | return 0; | |
9800 | } | |
9801 | ||
9802 | /* Ignore a directory whose identity matches the previous one. */ | |
9803 | if (prev_file_name | |
9804 | && INO_T_EQ (prev_file_name->st.st_ino, dir->st.st_ino) | |
9805 | && prev_file_name->st.st_dev == dir->st.st_dev) { | |
9806 | /* But treat `-Idir -I- -Idir' as `-I- -Idir'. */ | |
9807 | if (!first_bracket_include) | |
9808 | first_bracket_include = prev_file_name; | |
9809 | free (dir); | |
9810 | return 0; | |
9811 | } | |
9fb1a98e | 9812 | #endif /* ! VMS */ |
3e4115b7 RK |
9813 | |
9814 | dir->next = 0; | |
9815 | dir->c_system_include_path = 0; | |
9816 | dir->got_name_map = 0; | |
9817 | ||
9818 | return dir; | |
9819 | } | |
9820 | } | |
9821 | ||
6489924b RS |
9822 | /* Append a chain of `struct file_name_list's |
9823 | to the end of the main include chain. | |
9824 | FIRST is the beginning of the chain to append, and LAST is the end. */ | |
9825 | ||
9826 | static void | |
9827 | append_include_chain (first, last) | |
9828 | struct file_name_list *first, *last; | |
9829 | { | |
9830 | struct file_name_list *dir; | |
9831 | ||
9832 | if (!first || !last) | |
9833 | return; | |
9834 | ||
9835 | if (include == 0) | |
9836 | include = first; | |
9837 | else | |
9838 | last_include->next = first; | |
9839 | ||
9840 | if (first_bracket_include == 0) | |
56430040 | 9841 | first_bracket_include = first; |
6489924b RS |
9842 | |
9843 | for (dir = first; ; dir = dir->next) { | |
c01b03e8 | 9844 | int len = strlen (dir->fname) + INCLUDE_LEN_FUDGE; |
6489924b RS |
9845 | if (len > max_include_len) |
9846 | max_include_len = len; | |
9847 | if (dir == last) | |
9848 | break; | |
9849 | } | |
9850 | ||
9851 | last->next = NULL; | |
9852 | last_include = last; | |
9853 | } | |
9854 | \f | |
b0bbbd85 RS |
9855 | /* Add output to `deps_buffer' for the -M switch. |
9856 | STRING points to the text to be output. | |
ba6aa38e | 9857 | SPACER is ':' for targets, ' ' for dependencies. */ |
b0bbbd85 RS |
9858 | |
9859 | static void | |
389bb508 | 9860 | deps_output (string, spacer) |
b0bbbd85 | 9861 | char *string; |
389bb508 | 9862 | int spacer; |
b0bbbd85 | 9863 | { |
389bb508 RK |
9864 | int size = strlen (string); |
9865 | ||
b0bbbd85 | 9866 | if (size == 0) |
389bb508 | 9867 | return; |
b0bbbd85 RS |
9868 | |
9869 | #ifndef MAX_OUTPUT_COLUMNS | |
389bb508 | 9870 | #define MAX_OUTPUT_COLUMNS 72 |
b0bbbd85 | 9871 | #endif |
ba6aa38e RK |
9872 | if (MAX_OUTPUT_COLUMNS - 1 /*spacer*/ - 2 /*` \'*/ < deps_column + size |
9873 | && 1 < deps_column) { | |
9874 | bcopy (" \\\n ", &deps_buffer[deps_size], 4); | |
9875 | deps_size += 4; | |
9876 | deps_column = 1; | |
9877 | if (spacer == ' ') | |
9878 | spacer = 0; | |
b0bbbd85 RS |
9879 | } |
9880 | ||
389bb508 RK |
9881 | if (deps_size + size + 8 > deps_allocated_size) { |
9882 | deps_allocated_size = (deps_size + size + 50) * 2; | |
25cbb59e | 9883 | deps_buffer = xrealloc (deps_buffer, deps_allocated_size); |
b0bbbd85 | 9884 | } |
ba6aa38e | 9885 | if (spacer == ' ') { |
389bb508 | 9886 | deps_buffer[deps_size++] = ' '; |
ba6aa38e RK |
9887 | deps_column++; |
9888 | } | |
b0bbbd85 RS |
9889 | bcopy (string, &deps_buffer[deps_size], size); |
9890 | deps_size += size; | |
9891 | deps_column += size; | |
ba6aa38e | 9892 | if (spacer == ':') { |
389bb508 | 9893 | deps_buffer[deps_size++] = ':'; |
ba6aa38e RK |
9894 | deps_column++; |
9895 | } | |
b0bbbd85 RS |
9896 | deps_buffer[deps_size] = 0; |
9897 | } | |
b0bbbd85 RS |
9898 | \f |
9899 | static void | |
25cbb59e RK |
9900 | fatal (PRINTF_ALIST (msg)) |
9901 | PRINTF_DCL (msg) | |
b0bbbd85 | 9902 | { |
25cbb59e RK |
9903 | va_list args; |
9904 | ||
b0bbbd85 | 9905 | fprintf (stderr, "%s: ", progname); |
25cbb59e RK |
9906 | VA_START (args, msg); |
9907 | vfprintf (stderr, msg, args); | |
9908 | va_end (args); | |
b0bbbd85 | 9909 | fprintf (stderr, "\n"); |
3efba298 | 9910 | exit (FATAL_EXIT_CODE); |
b0bbbd85 RS |
9911 | } |
9912 | ||
9913 | /* More 'friendly' abort that prints the line and file. | |
9914 | config.h can #define abort fancy_abort if you like that sort of thing. */ | |
9915 | ||
9916 | void | |
9917 | fancy_abort () | |
9918 | { | |
9919 | fatal ("Internal gcc abort."); | |
9920 | } | |
9921 | ||
9922 | static void | |
9923 | perror_with_name (name) | |
9924 | char *name; | |
9925 | { | |
9926 | fprintf (stderr, "%s: ", progname); | |
02cc38b5 | 9927 | fprintf (stderr, "%s: %s\n", name, my_strerror (errno)); |
b0bbbd85 RS |
9928 | errors++; |
9929 | } | |
9930 | ||
9931 | static void | |
9932 | pfatal_with_name (name) | |
9933 | char *name; | |
9934 | { | |
9935 | perror_with_name (name); | |
9936 | #ifdef VMS | |
9937 | exit (vaxc$errno); | |
9938 | #else | |
3efba298 | 9939 | exit (FATAL_EXIT_CODE); |
b0bbbd85 RS |
9940 | #endif |
9941 | } | |
9942 | ||
9e263fc4 JW |
9943 | /* Handler for SIGPIPE. */ |
9944 | ||
9945 | static void | |
9946 | pipe_closed (signo) | |
9947 | /* If this is missing, some compilers complain. */ | |
9948 | int signo; | |
9949 | { | |
9950 | fatal ("output pipe has been closed"); | |
9951 | } | |
b0bbbd85 RS |
9952 | \f |
9953 | static void | |
9954 | memory_full () | |
9955 | { | |
9956 | fatal ("Memory exhausted."); | |
9957 | } | |
9958 | ||
9959 | ||
25cbb59e | 9960 | GENERIC_PTR |
b0bbbd85 | 9961 | xmalloc (size) |
25cbb59e | 9962 | size_t size; |
b0bbbd85 | 9963 | { |
25cbb59e RK |
9964 | register GENERIC_PTR ptr = (GENERIC_PTR) malloc (size); |
9965 | if (!ptr) | |
9966 | memory_full (); | |
9967 | return ptr; | |
b0bbbd85 RS |
9968 | } |
9969 | ||
25cbb59e | 9970 | static GENERIC_PTR |
b0bbbd85 | 9971 | xrealloc (old, size) |
25cbb59e RK |
9972 | GENERIC_PTR old; |
9973 | size_t size; | |
b0bbbd85 | 9974 | { |
25cbb59e RK |
9975 | register GENERIC_PTR ptr = (GENERIC_PTR) realloc (old, size); |
9976 | if (!ptr) | |
9977 | memory_full (); | |
9978 | return ptr; | |
b0bbbd85 RS |
9979 | } |
9980 | ||
25cbb59e | 9981 | static GENERIC_PTR |
b0bbbd85 | 9982 | xcalloc (number, size) |
25cbb59e | 9983 | size_t number, size; |
b0bbbd85 | 9984 | { |
25cbb59e RK |
9985 | register size_t total = number * size; |
9986 | register GENERIC_PTR ptr = (GENERIC_PTR) malloc (total); | |
9987 | if (!ptr) | |
9988 | memory_full (); | |
9989 | bzero (ptr, total); | |
9990 | return ptr; | |
b0bbbd85 RS |
9991 | } |
9992 | ||
9993 | static char * | |
9994 | savestring (input) | |
9995 | char *input; | |
9996 | { | |
25cbb59e | 9997 | size_t size = strlen (input); |
b0bbbd85 RS |
9998 | char *output = xmalloc (size + 1); |
9999 | strcpy (output, input); | |
10000 | return output; | |
10001 | } | |
10002 | \f | |
b0bbbd85 RS |
10003 | #ifdef VMS |
10004 | ||
0f41302f MS |
10005 | /* Under VMS we need to fix up the "include" specification filename so |
10006 | that everything following the 1st slash is changed into its correct | |
10007 | VMS file specification. */ | |
b0bbbd85 RS |
10008 | |
10009 | static void | |
10010 | hack_vms_include_specification (fname) | |
10011 | char *fname; | |
10012 | { | |
10013 | register char *cp, *cp1, *cp2; | |
3e4115b7 | 10014 | int f, check_filename_before_returning; |
b0bbbd85 RS |
10015 | char Local[512]; |
10016 | ||
10017 | check_filename_before_returning = 0; | |
3e4115b7 RK |
10018 | |
10019 | cp = base_name (fname); | |
b0bbbd85 | 10020 | |
fe701b40 RK |
10021 | /* |
10022 | * Check if we have a vax-c style '#include filename' | |
10023 | * and add the missing .h | |
10024 | */ | |
3e4115b7 RK |
10025 | if (!index (cp,'.')) |
10026 | strcat (cp, ".h"); | |
fe701b40 | 10027 | |
b0bbbd85 RS |
10028 | cp2 = Local; /* initialize */ |
10029 | ||
10030 | /* We are trying to do a number of things here. First of all, we are | |
10031 | trying to hammer the filenames into a standard format, such that later | |
10032 | processing can handle them. | |
10033 | ||
10034 | If the file name contains something like [dir.], then it recognizes this | |
10035 | as a root, and strips the ".]". Later processing will add whatever is | |
10036 | needed to get things working properly. | |
10037 | ||
10038 | If no device is specified, then the first directory name is taken to be | |
0f41302f | 10039 | a device name (or a rooted logical). */ |
b0bbbd85 RS |
10040 | |
10041 | /* See if we found that 1st slash */ | |
10042 | if (cp == 0) return; /* Nothing to do!!! */ | |
10043 | if (*cp != '/') return; /* Nothing to do!!! */ | |
10044 | /* Point to the UNIX filename part (which needs to be fixed!) */ | |
10045 | cp1 = cp+1; | |
10046 | /* If the directory spec is not rooted, we can just copy | |
10047 | the UNIX filename part and we are done */ | |
10048 | if (((cp - fname) > 1) && ((cp[-1] == ']') || (cp[-1] == '>'))) { | |
10049 | if (cp[-2] != '.') { | |
10050 | /* | |
2aa7ec37 | 10051 | * The VMS part ends in a `]', and the preceding character is not a `.'. |
b0bbbd85 RS |
10052 | * We strip the `]', and then splice the two parts of the name in the |
10053 | * usual way. Given the default locations for include files in cccp.c, | |
10054 | * we will only use this code if the user specifies alternate locations | |
10055 | * with the /include (-I) switch on the command line. */ | |
10056 | cp -= 1; /* Strip "]" */ | |
10057 | cp1--; /* backspace */ | |
10058 | } else { | |
10059 | /* | |
10060 | * The VMS part has a ".]" at the end, and this will not do. Later | |
10061 | * processing will add a second directory spec, and this would be a syntax | |
10062 | * error. Thus we strip the ".]", and thus merge the directory specs. | |
10063 | * We also backspace cp1, so that it points to a '/'. This inhibits the | |
10064 | * generation of the 000000 root directory spec (which does not belong here | |
10065 | * in this case). | |
10066 | */ | |
10067 | cp -= 2; /* Strip ".]" */ | |
10068 | cp1--; }; /* backspace */ | |
10069 | } else { | |
10070 | ||
10071 | /* We drop in here if there is no VMS style directory specification yet. | |
10072 | * If there is no device specification either, we make the first dir a | |
10073 | * device and try that. If we do not do this, then we will be essentially | |
10074 | * searching the users default directory (as if they did a #include "asdf.h"). | |
10075 | * | |
10076 | * Then all we need to do is to push a '[' into the output string. Later | |
10077 | * processing will fill this in, and close the bracket. | |
10078 | */ | |
ad0c9fa1 | 10079 | if (cp[-1] != ':') *cp2++ = ':'; /* dev not in spec. take first dir */ |
b0bbbd85 RS |
10080 | *cp2++ = '['; /* Open the directory specification */ |
10081 | } | |
10082 | ||
10083 | /* at this point we assume that we have the device spec, and (at least | |
10084 | the opening "[" for a directory specification. We may have directories | |
10085 | specified already */ | |
10086 | ||
10087 | /* If there are no other slashes then the filename will be | |
10088 | in the "root" directory. Otherwise, we need to add | |
0f41302f | 10089 | directory specifications. */ |
b0bbbd85 RS |
10090 | if (index (cp1, '/') == 0) { |
10091 | /* Just add "000000]" as the directory string */ | |
10092 | strcpy (cp2, "000000]"); | |
10093 | cp2 += strlen (cp2); | |
10094 | check_filename_before_returning = 1; /* we might need to fool with this later */ | |
10095 | } else { | |
0f41302f | 10096 | /* As long as there are still subdirectories to add, do them. */ |
b0bbbd85 RS |
10097 | while (index (cp1, '/') != 0) { |
10098 | /* If this token is "." we can ignore it */ | |
10099 | if ((cp1[0] == '.') && (cp1[1] == '/')) { | |
10100 | cp1 += 2; | |
10101 | continue; | |
10102 | } | |
10103 | /* Add a subdirectory spec. Do not duplicate "." */ | |
10104 | if (cp2[-1] != '.' && cp2[-1] != '[' && cp2[-1] != '<') | |
10105 | *cp2++ = '.'; | |
10106 | /* If this is ".." then the spec becomes "-" */ | |
10107 | if ((cp1[0] == '.') && (cp1[1] == '.') && (cp[2] == '/')) { | |
10108 | /* Add "-" and skip the ".." */ | |
10109 | *cp2++ = '-'; | |
10110 | cp1 += 3; | |
10111 | continue; | |
10112 | } | |
10113 | /* Copy the subdirectory */ | |
10114 | while (*cp1 != '/') *cp2++= *cp1++; | |
10115 | cp1++; /* Skip the "/" */ | |
10116 | } | |
10117 | /* Close the directory specification */ | |
ad0c9fa1 | 10118 | if (cp2[-1] == '.') /* no trailing periods */ |
b0bbbd85 RS |
10119 | cp2--; |
10120 | *cp2++ = ']'; | |
10121 | } | |
10122 | /* Now add the filename */ | |
10123 | while (*cp1) *cp2++ = *cp1++; | |
10124 | *cp2 = 0; | |
0f41302f | 10125 | /* Now append it to the original VMS spec. */ |
b0bbbd85 RS |
10126 | strcpy (cp, Local); |
10127 | ||
10128 | /* If we put a [000000] in the filename, try to open it first. If this fails, | |
10129 | remove the [000000], and return that name. This provides flexibility | |
10130 | to the user in that they can use both rooted and non-rooted logical names | |
10131 | to point to the location of the file. */ | |
10132 | ||
3e4115b7 | 10133 | if (check_filename_before_returning) { |
b0bbbd85 RS |
10134 | f = open (fname, O_RDONLY, 0666); |
10135 | if (f >= 0) { | |
10136 | /* The file name is OK as it is, so return it as is. */ | |
10137 | close (f); | |
10138 | return; | |
10139 | } | |
10140 | /* The filename did not work. Try to remove the [000000] from the name, | |
10141 | and return it. */ | |
10142 | cp = index (fname, '['); | |
10143 | cp2 = index (fname, ']') + 1; | |
10144 | strcpy (cp, cp2); /* this gets rid of it */ | |
10145 | } | |
10146 | return; | |
10147 | } | |
10148 | #endif /* VMS */ | |
10149 | \f | |
10150 | #ifdef VMS | |
10151 | ||
10152 | /* These are the read/write replacement routines for | |
10153 | VAX-11 "C". They make read/write behave enough | |
10154 | like their UNIX counterparts that CCCP will work */ | |
10155 | ||
10156 | static int | |
10157 | read (fd, buf, size) | |
10158 | int fd; | |
10159 | char *buf; | |
10160 | int size; | |
10161 | { | |
10162 | #undef read /* Get back the REAL read routine */ | |
10163 | register int i; | |
10164 | register int total = 0; | |
10165 | ||
10166 | /* Read until the buffer is exhausted */ | |
10167 | while (size > 0) { | |
10168 | /* Limit each read to 32KB */ | |
10169 | i = (size > (32*1024)) ? (32*1024) : size; | |
10170 | i = read (fd, buf, i); | |
10171 | if (i <= 0) { | |
10172 | if (i == 0) return (total); | |
ad0c9fa1 | 10173 | return (i); |
b0bbbd85 RS |
10174 | } |
10175 | /* Account for this read */ | |
10176 | total += i; | |
10177 | buf += i; | |
10178 | size -= i; | |
10179 | } | |
10180 | return (total); | |
10181 | } | |
10182 | ||
10183 | static int | |
10184 | write (fd, buf, size) | |
10185 | int fd; | |
10186 | char *buf; | |
10187 | int size; | |
10188 | { | |
10189 | #undef write /* Get back the REAL write routine */ | |
10190 | int i; | |
10191 | int j; | |
10192 | ||
10193 | /* Limit individual writes to 32Kb */ | |
10194 | i = size; | |
10195 | while (i > 0) { | |
10196 | j = (i > (32*1024)) ? (32*1024) : i; | |
10197 | if (write (fd, buf, j) < 0) return (-1); | |
10198 | /* Account for the data written */ | |
10199 | buf += j; | |
10200 | i -= j; | |
10201 | } | |
10202 | return (size); | |
10203 | } | |
10204 | ||
10205 | /* The following wrapper functions supply additional arguments to the VMS | |
10206 | I/O routines to optimize performance with file handling. The arguments | |
10207 | are: | |
10208 | "mbc=16" - Set multi-block count to 16 (use a 8192 byte buffer). | |
10209 | "deq=64" - When extending the file, extend it in chunks of 32Kbytes. | |
10210 | "fop=tef"- Truncate unused portions of file when closing file. | |
0f41302f | 10211 | "shr=nil"- Disallow file sharing while file is open. */ |
b0bbbd85 RS |
10212 | |
10213 | static FILE * | |
10214 | freopen (fname, type, oldfile) | |
10215 | char *fname; | |
10216 | char *type; | |
10217 | FILE *oldfile; | |
10218 | { | |
10219 | #undef freopen /* Get back the REAL fopen routine */ | |
10220 | if (strcmp (type, "w") == 0) | |
10221 | return freopen (fname, type, oldfile, "mbc=16", "deq=64", "fop=tef", "shr=nil"); | |
10222 | return freopen (fname, type, oldfile, "mbc=16"); | |
10223 | } | |
10224 | ||
10225 | static FILE * | |
10226 | fopen (fname, type) | |
10227 | char *fname; | |
10228 | char *type; | |
10229 | { | |
10230 | #undef fopen /* Get back the REAL fopen routine */ | |
37c9f674 RK |
10231 | /* The gcc-vms-1.42 distribution's header files prototype fopen with two |
10232 | fixed arguments, which matches ANSI's specification but not VAXCRTL's | |
ddd5a7c1 | 10233 | pre-ANSI implementation. This hack circumvents the mismatch problem. */ |
37c9f674 RK |
10234 | FILE *(*vmslib_fopen)() = (FILE *(*)()) fopen; |
10235 | ||
10236 | if (*type == 'w') | |
10237 | return (*vmslib_fopen) (fname, type, "mbc=32", | |
10238 | "deq=64", "fop=tef", "shr=nil"); | |
10239 | else | |
10240 | return (*vmslib_fopen) (fname, type, "mbc=32"); | |
b0bbbd85 RS |
10241 | } |
10242 | ||
10243 | static int | |
10244 | open (fname, flags, prot) | |
10245 | char *fname; | |
10246 | int flags; | |
10247 | int prot; | |
10248 | { | |
10249 | #undef open /* Get back the REAL open routine */ | |
10250 | return open (fname, flags, prot, "mbc=16", "deq=64", "fop=tef"); | |
10251 | } | |
bd8cb5e2 RK |
10252 | \f |
10253 | /* more VMS hackery */ | |
10254 | #include <fab.h> | |
10255 | #include <nam.h> | |
10256 | ||
10257 | extern unsigned long sys$parse(), sys$search(); | |
10258 | ||
10259 | /* Work around another library bug. If a file is located via a searchlist, | |
10260 | and if the device it's on is not the same device as the one specified | |
10261 | in the first element of that searchlist, then both stat() and fstat() | |
10262 | will fail to return info about it. `errno' will be set to EVMSERR, and | |
10263 | `vaxc$errno' will be set to SS$_NORMAL due yet another bug in stat()! | |
10264 | We can get around this by fully parsing the filename and then passing | |
10265 | that absolute name to stat(). | |
10266 | ||
10267 | Without this fix, we can end up failing to find header files, which is | |
10268 | bad enough, but then compounding the problem by reporting the reason for | |
10269 | failure as "normal successful completion." */ | |
10270 | ||
27027a60 RK |
10271 | #undef fstat /* get back to library version */ |
10272 | ||
bd8cb5e2 | 10273 | static int |
27027a60 | 10274 | VMS_fstat (fd, statbuf) |
bd8cb5e2 RK |
10275 | int fd; |
10276 | struct stat *statbuf; | |
10277 | { | |
bd8cb5e2 RK |
10278 | int result = fstat (fd, statbuf); |
10279 | ||
10280 | if (result < 0) | |
10281 | { | |
10282 | FILE *fp; | |
10283 | char nambuf[NAM$C_MAXRSS+1]; | |
10284 | ||
10285 | if ((fp = fdopen (fd, "r")) != 0 && fgetname (fp, nambuf) != 0) | |
27027a60 | 10286 | result = VMS_stat (nambuf, statbuf); |
bd8cb5e2 RK |
10287 | /* No fclose(fp) here; that would close(fd) as well. */ |
10288 | } | |
10289 | ||
10290 | return result; | |
10291 | } | |
10292 | ||
10293 | static int | |
27027a60 | 10294 | VMS_stat (name, statbuf) |
bd8cb5e2 RK |
10295 | const char *name; |
10296 | struct stat *statbuf; | |
10297 | { | |
bd8cb5e2 RK |
10298 | int result = stat (name, statbuf); |
10299 | ||
10300 | if (result < 0) | |
10301 | { | |
10302 | struct FAB fab; | |
10303 | struct NAM nam; | |
10304 | char exp_nam[NAM$C_MAXRSS+1], /* expanded name buffer for sys$parse */ | |
10305 | res_nam[NAM$C_MAXRSS+1]; /* resultant name buffer for sys$search */ | |
10306 | ||
10307 | fab = cc$rms_fab; | |
10308 | fab.fab$l_fna = (char *) name; | |
10309 | fab.fab$b_fns = (unsigned char) strlen (name); | |
10310 | fab.fab$l_nam = (void *) &nam; | |
10311 | nam = cc$rms_nam; | |
10312 | nam.nam$l_esa = exp_nam, nam.nam$b_ess = sizeof exp_nam - 1; | |
10313 | nam.nam$l_rsa = res_nam, nam.nam$b_rss = sizeof res_nam - 1; | |
10314 | nam.nam$b_nop = NAM$M_PWD | NAM$M_NOCONCEAL; | |
10315 | if (sys$parse (&fab) & 1) | |
10316 | { | |
10317 | if (sys$search (&fab) & 1) | |
10318 | { | |
10319 | res_nam[nam.nam$b_rsl] = '\0'; | |
10320 | result = stat (res_nam, statbuf); | |
10321 | } | |
10322 | /* Clean up searchlist context cached by the system. */ | |
10323 | nam.nam$b_nop = NAM$M_SYNCHK; | |
10324 | fab.fab$l_fna = 0, fab.fab$b_fns = 0; | |
10325 | (void) sys$parse (&fab); | |
10326 | } | |
10327 | } | |
10328 | ||
10329 | return result; | |
10330 | } | |
b0bbbd85 | 10331 | #endif /* VMS */ |