1 /* Separate lexical analyzer for GNU C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file is the lexical analyzer for GNU C++. */
25 /* Cause the `yydebug' variable to be defined. */
28 #include <sys/types.h>
42 #ifdef MULTIBYTE_CHARS
48 extern int errno; /* needed for VAX. */
50 extern jmp_buf toplevel;
52 #define obstack_chunk_alloc xmalloc
53 #define obstack_chunk_free free
55 extern struct obstack *expression_obstack, permanent_obstack;
56 extern struct obstack *current_obstack, *saveable_obstack;
58 extern double atof ();
60 extern char *get_directive_line (); /* In c-common.c */
62 /* Given a file name X, return the nondirectory portion.
63 Keep in mind that X can be computed more than once. */
64 #ifndef FILE_NAME_NONDIRECTORY
65 #define FILE_NAME_NONDIRECTORY(X) \
66 (rindex (X, '/') != 0 ? rindex (X, '/') + 1 : X)
69 extern char *index ();
70 extern char *rindex ();
72 void extract_interface_info ();
75 /* This obstack is needed to hold text. It is not safe to use
76 TOKEN_BUFFER because `check_newline' calls `yylex'. */
77 struct obstack inline_text_obstack;
78 static char *inline_text_firstobj;
80 /* This obstack is used to hold information about methods to be
81 synthesized. It should go away when synthesized methods are handled
82 properly (i.e. only when needed). */
83 struct obstack synth_obstack;
84 static char *synth_firstobj;
88 /* Pending language change.
89 Positive is push count, negative is pop count. */
90 int pending_lang_change = 0;
92 /* Wrap the current header file in extern "C". */
93 static int c_header_level = 0;
95 extern int first_token;
96 extern struct obstack token_obstack;
98 /* ??? Don't really know where this goes yet. */
102 extern void put_back (/* int */);
103 extern int input_redirected ();
104 extern void feed_input (/* char *, int, struct obstack * */);
107 /* Holds translations from TREE_CODEs to operator name strings,
108 i.e., opname_tab[PLUS_EXPR] == "+". */
112 extern int yychar; /* the lookahead symbol */
113 extern YYSTYPE yylval; /* the semantic value of the */
114 /* lookahead symbol */
117 YYLTYPE yylloc; /* location data for the lookahead */
122 /* the declaration found for the last IDENTIFIER token read in.
123 yylex must look this up to detect typedefs, which get token type TYPENAME,
124 so it is left around in case the identifier is not a typedef but is
125 used in a context which makes it a reference to a variable. */
128 /* The elements of `ridpointers' are identifier nodes
129 for the reserved type names and storage classes.
130 It is indexed by a RID_... value. */
131 tree ridpointers[(int) RID_MAX];
133 /* We may keep statistics about how long which files took to compile. */
134 static int header_time, body_time;
135 static tree get_time_identifier ();
136 static tree filename_times;
137 static tree this_filename_time;
139 /* For implementing #pragma unit. */
140 tree current_unit_name;
141 tree current_unit_language;
143 /* Array for holding counts of the numbers of tokens seen. */
144 extern int *token_count;
146 /* Textual definition used for default functions. */
147 static void default_copy_constructor_body ();
148 static void default_assign_ref_body ();
150 /* Return something to represent absolute declarators containing a *.
151 TARGET is the absolute declarator that the * contains.
152 TYPE_QUALS is a list of modifiers such as const or volatile
153 to apply to the pointer type, represented as identifiers.
155 We return an INDIRECT_REF whose "contents" are TARGET
156 and whose type is the modifier list. */
159 make_pointer_declarator (type_quals, target)
160 tree type_quals, target;
162 if (target && TREE_CODE (target) == IDENTIFIER_NODE
163 && ANON_AGGRNAME_P (target))
164 error ("type name expected before `*'");
165 target = build_parse_node (INDIRECT_REF, target);
166 TREE_TYPE (target) = type_quals;
170 /* Return something to represent absolute declarators containing a &.
171 TARGET is the absolute declarator that the & contains.
172 TYPE_QUALS is a list of modifiers such as const or volatile
173 to apply to the reference type, represented as identifiers.
175 We return an ADDR_EXPR whose "contents" are TARGET
176 and whose type is the modifier list. */
179 make_reference_declarator (type_quals, target)
180 tree type_quals, target;
184 if (TREE_CODE (target) == ADDR_EXPR)
186 error ("cannot declare references to references");
189 if (TREE_CODE (target) == INDIRECT_REF)
191 error ("cannot declare pointers to references");
194 if (TREE_CODE (target) == IDENTIFIER_NODE && ANON_AGGRNAME_P (target))
195 error ("type name expected before `&'");
197 target = build_parse_node (ADDR_EXPR, target);
198 TREE_TYPE (target) = type_quals;
202 /* Build names and nodes for overloaded operators. */
204 tree ansi_opname[LAST_CPLUS_TREE_CODE];
205 tree ansi_assopname[LAST_CPLUS_TREE_CODE];
208 operator_name_string (name)
211 char *opname = IDENTIFIER_POINTER (name) + 2;
215 /* Works for builtin and user defined types. */
216 if (IDENTIFIER_GLOBAL_VALUE (name)
217 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (name)) == TYPE_DECL)
218 return IDENTIFIER_POINTER (name);
220 if (opname[0] == 'a' && opname[2] != '\0' && opname[2] != '_')
224 opname_table = ansi_assopname;
229 opname_table = ansi_opname;
232 for (i = 0; i < (int) LAST_CPLUS_TREE_CODE; i++)
234 if (opname[0] == IDENTIFIER_POINTER (opname_table[i])[2+assign]
235 && opname[1] == IDENTIFIER_POINTER (opname_table[i])[3+assign])
239 if (i == LAST_CPLUS_TREE_CODE)
240 return "<invalid operator>";
243 return assignop_tab[i];
245 return opname_tab[i];
248 int interface_only; /* whether or not current file is only for
249 interface definitions. */
250 int interface_unknown; /* whether or not we know this class
251 to behave according to #pragma interface. */
253 /* lexical analyzer */
255 /* File used for outputting assembler code. */
256 extern FILE *asm_out_file;
258 #ifndef WCHAR_TYPE_SIZE
260 #define WCHAR_TYPE_SIZE INT_TYPE_SIZE
262 #define WCHAR_TYPE_SIZE BITS_PER_WORD
266 /* Number of bytes in a wide character. */
267 #define WCHAR_BYTES (WCHAR_TYPE_SIZE / BITS_PER_UNIT)
269 static int maxtoken; /* Current nominal length of token buffer. */
270 char *token_buffer; /* Pointer to token buffer.
271 Actual allocated length is maxtoken + 2. */
275 int check_newline ();
277 /* Nonzero tells yylex to ignore \ in string constants. */
278 static int ignore_escape_flag = 0;
280 static int skip_white_space ();
283 get_time_identifier (name)
286 tree time_identifier;
287 int len = strlen (name);
288 char *buf = (char *) alloca (len + 6);
289 strcpy (buf, "file ");
290 bcopy (name, buf+5, len);
292 time_identifier = get_identifier (buf);
293 if (IDENTIFIER_LOCAL_VALUE (time_identifier) == NULL_TREE)
295 push_obstacks_nochange ();
296 end_temporary_allocation ();
297 IDENTIFIER_LOCAL_VALUE (time_identifier) = build_int_2 (0, 0);
298 IDENTIFIER_CLASS_VALUE (time_identifier) = build_int_2 (0, 1);
299 IDENTIFIER_GLOBAL_VALUE (time_identifier) = filename_times;
300 filename_times = time_identifier;
303 return time_identifier;
312 int old_quiet_flag = quiet_flag;
315 this_time = get_run_time ();
316 quiet_flag = old_quiet_flag;
320 /* Table indexed by tree code giving a string containing a character
321 classifying the tree code. Possibilities are
322 t, d, s, c, r, <, 1 and 2. See cp/tree.def for details. */
324 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
326 char *cplus_tree_code_type[] = {
332 /* Table indexed by tree code giving number of expression
333 operands beyond the fixed part of the node structure.
334 Not used for types or decls. */
336 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
338 int cplus_tree_code_length[] = {
344 /* Names of tree components.
345 Used for printing out the tree and error messages. */
346 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
348 char *cplus_tree_code_name[] = {
354 /* toplev.c needs to call these. */
359 /* the beginning of the file is a new line; check for # */
360 /* With luck, we discover the real source file's name from that
361 and put it in input_filename. */
362 put_back (check_newline ());
366 if (flag_gnu_xref) GNU_xref_begin (input_filename);
367 init_repo (input_filename);
373 extern int errorcount, sorrycount;
374 if (flag_gnu_xref) GNU_xref_end (errorcount+sorrycount);
384 init_filename_times ()
386 this_filename_time = get_time_identifier ("<top level>");
387 if (flag_detailed_statistics)
390 body_time = my_get_run_time ();
391 TREE_INT_CST_LOW (IDENTIFIER_LOCAL_VALUE (this_filename_time)) = body_time;
395 /* Change by Bryan Boreham, Kewill, Thu Jul 27 09:46:05 1989.
396 Stuck this hack in to get the files open correctly; this is called
397 in place of init_lex if we are an unexec'd binary. */
399 reinit_lang_specific ()
401 init_filename_times ();
402 reinit_search_statistics ();
408 extern char *(*decl_printable_name) ();
409 extern int flag_no_gnu_keywords;
410 extern int flag_operator_names;
414 /* Initialize the lookahead machinery. */
417 /* Make identifier nodes long enough for the language-specific slots. */
418 set_identifier_size (sizeof (struct lang_identifier));
419 decl_printable_name = lang_printable_name;
421 init_cplus_expand ();
424 = (char **) realloc (tree_code_type,
425 sizeof (char *) * LAST_CPLUS_TREE_CODE);
427 = (int *) realloc (tree_code_length,
428 sizeof (int) * LAST_CPLUS_TREE_CODE);
430 = (char **) realloc (tree_code_name,
431 sizeof (char *) * LAST_CPLUS_TREE_CODE);
432 bcopy ((char *)cplus_tree_code_type,
433 (char *)(tree_code_type + (int) LAST_AND_UNUSED_TREE_CODE),
434 (LAST_CPLUS_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (char *));
435 bcopy ((char *)cplus_tree_code_length,
436 (char *)(tree_code_length + (int) LAST_AND_UNUSED_TREE_CODE),
437 (LAST_CPLUS_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (int));
438 bcopy ((char *)cplus_tree_code_name,
439 (char *)(tree_code_name + (int) LAST_AND_UNUSED_TREE_CODE),
440 (LAST_CPLUS_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (char *));
442 opname_tab = (char **)oballoc ((int)LAST_CPLUS_TREE_CODE * sizeof (char *));
443 bzero ((char *)opname_tab, (int)LAST_CPLUS_TREE_CODE * sizeof (char *));
444 assignop_tab = (char **)oballoc ((int)LAST_CPLUS_TREE_CODE * sizeof (char *));
445 bzero ((char *)assignop_tab, (int)LAST_CPLUS_TREE_CODE * sizeof (char *));
447 ansi_opname[0] = get_identifier ("<invalid operator>");
448 for (i = 0; i < (int) LAST_CPLUS_TREE_CODE; i++)
450 ansi_opname[i] = ansi_opname[0];
451 ansi_assopname[i] = ansi_opname[0];
454 ansi_opname[(int) MULT_EXPR] = get_identifier ("__ml");
455 IDENTIFIER_OPNAME_P (ansi_opname[(int) MULT_EXPR]) = 1;
456 ansi_opname[(int) INDIRECT_REF] = ansi_opname[(int) MULT_EXPR];
457 ansi_assopname[(int) MULT_EXPR] = get_identifier ("__aml");
458 IDENTIFIER_OPNAME_P (ansi_assopname[(int) MULT_EXPR]) = 1;
459 ansi_assopname[(int) INDIRECT_REF] = ansi_assopname[(int) MULT_EXPR];
460 ansi_opname[(int) TRUNC_MOD_EXPR] = get_identifier ("__md");
461 IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUNC_MOD_EXPR]) = 1;
462 ansi_assopname[(int) TRUNC_MOD_EXPR] = get_identifier ("__amd");
463 IDENTIFIER_OPNAME_P (ansi_assopname[(int) TRUNC_MOD_EXPR]) = 1;
464 ansi_opname[(int) CEIL_MOD_EXPR] = ansi_opname[(int) TRUNC_MOD_EXPR];
465 ansi_opname[(int) FLOOR_MOD_EXPR] = ansi_opname[(int) TRUNC_MOD_EXPR];
466 ansi_opname[(int) ROUND_MOD_EXPR] = ansi_opname[(int) TRUNC_MOD_EXPR];
467 ansi_opname[(int) MINUS_EXPR] = get_identifier ("__mi");
468 IDENTIFIER_OPNAME_P (ansi_opname[(int) MINUS_EXPR]) = 1;
469 ansi_opname[(int) NEGATE_EXPR] = ansi_opname[(int) MINUS_EXPR];
470 ansi_assopname[(int) MINUS_EXPR] = get_identifier ("__ami");
471 IDENTIFIER_OPNAME_P (ansi_assopname[(int) MINUS_EXPR]) = 1;
472 ansi_assopname[(int) NEGATE_EXPR] = ansi_assopname[(int) MINUS_EXPR];
473 ansi_opname[(int) RSHIFT_EXPR] = get_identifier ("__rs");
474 IDENTIFIER_OPNAME_P (ansi_opname[(int) RSHIFT_EXPR]) = 1;
475 ansi_assopname[(int) RSHIFT_EXPR] = get_identifier ("__ars");
476 IDENTIFIER_OPNAME_P (ansi_assopname[(int) RSHIFT_EXPR]) = 1;
477 ansi_opname[(int) NE_EXPR] = get_identifier ("__ne");
478 IDENTIFIER_OPNAME_P (ansi_opname[(int) NE_EXPR]) = 1;
479 ansi_opname[(int) GT_EXPR] = get_identifier ("__gt");
480 IDENTIFIER_OPNAME_P (ansi_opname[(int) GT_EXPR]) = 1;
481 ansi_opname[(int) GE_EXPR] = get_identifier ("__ge");
482 IDENTIFIER_OPNAME_P (ansi_opname[(int) GE_EXPR]) = 1;
483 ansi_opname[(int) BIT_IOR_EXPR] = get_identifier ("__or");
484 IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_IOR_EXPR]) = 1;
485 ansi_assopname[(int) BIT_IOR_EXPR] = get_identifier ("__aor");
486 IDENTIFIER_OPNAME_P (ansi_assopname[(int) BIT_IOR_EXPR]) = 1;
487 ansi_opname[(int) TRUTH_ANDIF_EXPR] = get_identifier ("__aa");
488 IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUTH_ANDIF_EXPR]) = 1;
489 ansi_opname[(int) TRUTH_NOT_EXPR] = get_identifier ("__nt");
490 IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUTH_NOT_EXPR]) = 1;
491 ansi_opname[(int) PREINCREMENT_EXPR] = get_identifier ("__pp");
492 IDENTIFIER_OPNAME_P (ansi_opname[(int) PREINCREMENT_EXPR]) = 1;
493 ansi_opname[(int) POSTINCREMENT_EXPR] = ansi_opname[(int) PREINCREMENT_EXPR];
494 ansi_opname[(int) MODIFY_EXPR] = get_identifier ("__as");
495 IDENTIFIER_OPNAME_P (ansi_opname[(int) MODIFY_EXPR]) = 1;
496 ansi_assopname[(int) NOP_EXPR] = ansi_opname[(int) MODIFY_EXPR];
497 ansi_opname[(int) COMPOUND_EXPR] = get_identifier ("__cm");
498 IDENTIFIER_OPNAME_P (ansi_opname[(int) COMPOUND_EXPR]) = 1;
499 ansi_opname[(int) EXACT_DIV_EXPR] = get_identifier ("__dv");
500 IDENTIFIER_OPNAME_P (ansi_opname[(int) EXACT_DIV_EXPR]) = 1;
501 ansi_assopname[(int) EXACT_DIV_EXPR] = get_identifier ("__adv");
502 IDENTIFIER_OPNAME_P (ansi_assopname[(int) EXACT_DIV_EXPR]) = 1;
503 ansi_opname[(int) TRUNC_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR];
504 ansi_opname[(int) CEIL_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR];
505 ansi_opname[(int) FLOOR_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR];
506 ansi_opname[(int) ROUND_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR];
507 ansi_opname[(int) PLUS_EXPR] = get_identifier ("__pl");
508 ansi_assopname[(int) TRUNC_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR];
509 ansi_assopname[(int) CEIL_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR];
510 ansi_assopname[(int) FLOOR_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR];
511 ansi_assopname[(int) ROUND_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR];
512 IDENTIFIER_OPNAME_P (ansi_opname[(int) PLUS_EXPR]) = 1;
513 ansi_assopname[(int) PLUS_EXPR] = get_identifier ("__apl");
514 IDENTIFIER_OPNAME_P (ansi_assopname[(int) PLUS_EXPR]) = 1;
515 ansi_opname[(int) CONVERT_EXPR] = ansi_opname[(int) PLUS_EXPR];
516 ansi_assopname[(int) CONVERT_EXPR] = ansi_assopname[(int) PLUS_EXPR];
517 ansi_opname[(int) LSHIFT_EXPR] = get_identifier ("__ls");
518 IDENTIFIER_OPNAME_P (ansi_opname[(int) LSHIFT_EXPR]) = 1;
519 ansi_assopname[(int) LSHIFT_EXPR] = get_identifier ("__als");
520 IDENTIFIER_OPNAME_P (ansi_assopname[(int) LSHIFT_EXPR]) = 1;
521 ansi_opname[(int) EQ_EXPR] = get_identifier ("__eq");
522 IDENTIFIER_OPNAME_P (ansi_opname[(int) EQ_EXPR]) = 1;
523 ansi_opname[(int) LT_EXPR] = get_identifier ("__lt");
524 IDENTIFIER_OPNAME_P (ansi_opname[(int) LT_EXPR]) = 1;
525 ansi_opname[(int) LE_EXPR] = get_identifier ("__le");
526 IDENTIFIER_OPNAME_P (ansi_opname[(int) LE_EXPR]) = 1;
527 ansi_opname[(int) BIT_AND_EXPR] = get_identifier ("__ad");
528 IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_AND_EXPR]) = 1;
529 ansi_assopname[(int) BIT_AND_EXPR] = get_identifier ("__aad");
530 IDENTIFIER_OPNAME_P (ansi_assopname[(int) BIT_AND_EXPR]) = 1;
531 ansi_opname[(int) ADDR_EXPR] = ansi_opname[(int) BIT_AND_EXPR];
532 ansi_assopname[(int) ADDR_EXPR] = ansi_assopname[(int) BIT_AND_EXPR];
533 ansi_opname[(int) BIT_XOR_EXPR] = get_identifier ("__er");
534 IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_XOR_EXPR]) = 1;
535 ansi_assopname[(int) BIT_XOR_EXPR] = get_identifier ("__aer");
536 IDENTIFIER_OPNAME_P (ansi_assopname[(int) BIT_XOR_EXPR]) = 1;
537 ansi_opname[(int) TRUTH_ORIF_EXPR] = get_identifier ("__oo");
538 IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUTH_ORIF_EXPR]) = 1;
539 ansi_opname[(int) BIT_NOT_EXPR] = get_identifier ("__co");
540 IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_NOT_EXPR]) = 1;
541 ansi_opname[(int) PREDECREMENT_EXPR] = get_identifier ("__mm");
542 IDENTIFIER_OPNAME_P (ansi_opname[(int) PREDECREMENT_EXPR]) = 1;
543 ansi_opname[(int) POSTDECREMENT_EXPR] = ansi_opname[(int) PREDECREMENT_EXPR];
544 ansi_opname[(int) COMPONENT_REF] = get_identifier ("__rf");
545 IDENTIFIER_OPNAME_P (ansi_opname[(int) COMPONENT_REF]) = 1;
546 ansi_opname[(int) MEMBER_REF] = get_identifier ("__rm");
547 IDENTIFIER_OPNAME_P (ansi_opname[(int) MEMBER_REF]) = 1;
548 ansi_opname[(int) CALL_EXPR] = get_identifier ("__cl");
549 IDENTIFIER_OPNAME_P (ansi_opname[(int) CALL_EXPR]) = 1;
550 ansi_opname[(int) ARRAY_REF] = get_identifier ("__vc");
551 IDENTIFIER_OPNAME_P (ansi_opname[(int) ARRAY_REF]) = 1;
552 ansi_opname[(int) NEW_EXPR] = get_identifier ("__nw");
553 IDENTIFIER_OPNAME_P (ansi_opname[(int) NEW_EXPR]) = 1;
554 ansi_opname[(int) DELETE_EXPR] = get_identifier ("__dl");
555 IDENTIFIER_OPNAME_P (ansi_opname[(int) DELETE_EXPR]) = 1;
556 ansi_opname[(int) VEC_NEW_EXPR] = get_identifier ("__vn");
557 IDENTIFIER_OPNAME_P (ansi_opname[(int) VEC_NEW_EXPR]) = 1;
558 ansi_opname[(int) VEC_DELETE_EXPR] = get_identifier ("__vd");
559 IDENTIFIER_OPNAME_P (ansi_opname[(int) VEC_DELETE_EXPR]) = 1;
560 ansi_opname[(int) TYPE_EXPR] = get_identifier ("__op");
561 IDENTIFIER_OPNAME_P (ansi_opname[(int) TYPE_EXPR]) = 1;
563 /* This is not true: these operators are not defined in ANSI,
564 but we need them anyway. */
565 ansi_opname[(int) MIN_EXPR] = get_identifier ("__mn");
566 IDENTIFIER_OPNAME_P (ansi_opname[(int) MIN_EXPR]) = 1;
567 ansi_opname[(int) MAX_EXPR] = get_identifier ("__mx");
568 IDENTIFIER_OPNAME_P (ansi_opname[(int) MAX_EXPR]) = 1;
569 ansi_opname[(int) COND_EXPR] = get_identifier ("__cn");
570 IDENTIFIER_OPNAME_P (ansi_opname[(int) COND_EXPR]) = 1;
571 ansi_opname[(int) METHOD_CALL_EXPR] = get_identifier ("__wr");
572 IDENTIFIER_OPNAME_P (ansi_opname[(int) METHOD_CALL_EXPR]) = 1;
576 gcc_obstack_init (&inline_text_obstack);
577 inline_text_firstobj = (char *) obstack_alloc (&inline_text_obstack, 0);
578 gcc_obstack_init (&synth_obstack);
579 synth_firstobj = (char *) obstack_alloc (&synth_obstack, 0);
581 /* Start it at 0, because check_newline is called at the very beginning
582 and will increment it to 1. */
584 input_filename = "<internal>";
585 current_function_decl = NULL;
588 token_buffer = (char *) xmalloc (maxtoken + 2);
590 ridpointers[(int) RID_INT] = get_identifier ("int");
591 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_INT],
592 build_tree_list (NULL_TREE, ridpointers[(int) RID_INT]));
593 ridpointers[(int) RID_BOOL] = get_identifier ("bool");
594 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_BOOL],
595 build_tree_list (NULL_TREE, ridpointers[(int) RID_BOOL]));
596 ridpointers[(int) RID_CHAR] = get_identifier ("char");
597 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_CHAR],
598 build_tree_list (NULL_TREE, ridpointers[(int) RID_CHAR]));
599 ridpointers[(int) RID_VOID] = get_identifier ("void");
600 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_VOID],
601 build_tree_list (NULL_TREE, ridpointers[(int) RID_VOID]));
602 ridpointers[(int) RID_FLOAT] = get_identifier ("float");
603 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_FLOAT],
604 build_tree_list (NULL_TREE, ridpointers[(int) RID_FLOAT]));
605 ridpointers[(int) RID_DOUBLE] = get_identifier ("double");
606 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_DOUBLE],
607 build_tree_list (NULL_TREE, ridpointers[(int) RID_DOUBLE]));
608 ridpointers[(int) RID_SHORT] = get_identifier ("short");
609 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_SHORT],
610 build_tree_list (NULL_TREE, ridpointers[(int) RID_SHORT]));
611 ridpointers[(int) RID_LONG] = get_identifier ("long");
612 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_LONG],
613 build_tree_list (NULL_TREE, ridpointers[(int) RID_LONG]));
614 ridpointers[(int) RID_UNSIGNED] = get_identifier ("unsigned");
615 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_UNSIGNED],
616 build_tree_list (NULL_TREE, ridpointers[(int) RID_UNSIGNED]));
617 ridpointers[(int) RID_SIGNED] = get_identifier ("signed");
618 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_SIGNED],
619 build_tree_list (NULL_TREE, ridpointers[(int) RID_SIGNED]));
620 ridpointers[(int) RID_INLINE] = get_identifier ("inline");
621 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_INLINE],
622 build_tree_list (NULL_TREE, ridpointers[(int) RID_INLINE]));
623 ridpointers[(int) RID_CONST] = get_identifier ("const");
624 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_CONST],
625 build_tree_list (NULL_TREE, ridpointers[(int) RID_CONST]));
626 ridpointers[(int) RID_VOLATILE] = get_identifier ("volatile");
627 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_VOLATILE],
628 build_tree_list (NULL_TREE, ridpointers[(int) RID_VOLATILE]));
629 ridpointers[(int) RID_AUTO] = get_identifier ("auto");
630 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_AUTO],
631 build_tree_list (NULL_TREE, ridpointers[(int) RID_AUTO]));
632 ridpointers[(int) RID_STATIC] = get_identifier ("static");
633 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_STATIC],
634 build_tree_list (NULL_TREE, ridpointers[(int) RID_STATIC]));
635 ridpointers[(int) RID_EXTERN] = get_identifier ("extern");
636 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_EXTERN],
637 build_tree_list (NULL_TREE, ridpointers[(int) RID_EXTERN]));
638 ridpointers[(int) RID_TYPEDEF] = get_identifier ("typedef");
639 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_TYPEDEF],
640 build_tree_list (NULL_TREE, ridpointers[(int) RID_TYPEDEF]));
641 ridpointers[(int) RID_REGISTER] = get_identifier ("register");
642 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_REGISTER],
643 build_tree_list (NULL_TREE, ridpointers[(int) RID_REGISTER]));
645 /* C++ extensions. These are probably not correctly named. */
646 ridpointers[(int) RID_WCHAR] = get_identifier ("__wchar_t");
647 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_WCHAR],
648 build_tree_list (NULL_TREE, ridpointers[(int) RID_WCHAR]));
649 class_type_node = build_int_2 (class_type, 0);
650 TREE_TYPE (class_type_node) = class_type_node;
651 ridpointers[(int) RID_CLASS] = class_type_node;
653 record_type_node = build_int_2 (record_type, 0);
654 TREE_TYPE (record_type_node) = record_type_node;
655 ridpointers[(int) RID_RECORD] = record_type_node;
657 union_type_node = build_int_2 (union_type, 0);
658 TREE_TYPE (union_type_node) = union_type_node;
659 ridpointers[(int) RID_UNION] = union_type_node;
661 enum_type_node = build_int_2 (enum_type, 0);
662 TREE_TYPE (enum_type_node) = enum_type_node;
663 ridpointers[(int) RID_ENUM] = enum_type_node;
665 ridpointers[(int) RID_VIRTUAL] = get_identifier ("virtual");
666 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_VIRTUAL],
667 build_tree_list (NULL_TREE, ridpointers[(int) RID_VIRTUAL]));
668 ridpointers[(int) RID_EXPLICIT] = get_identifier ("explicit");
669 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_EXPLICIT],
670 build_tree_list (NULL_TREE, ridpointers[(int) RID_EXPLICIT]));
671 ridpointers[(int) RID_FRIEND] = get_identifier ("friend");
672 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_FRIEND],
673 build_tree_list (NULL_TREE, ridpointers[(int) RID_FRIEND]));
675 ridpointers[(int) RID_PUBLIC] = get_identifier ("public");
676 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_PUBLIC],
677 build_tree_list (NULL_TREE, ridpointers[(int) RID_PUBLIC]));
678 ridpointers[(int) RID_PRIVATE] = get_identifier ("private");
679 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_PRIVATE],
680 build_tree_list (NULL_TREE, ridpointers[(int) RID_PRIVATE]));
681 ridpointers[(int) RID_PROTECTED] = get_identifier ("protected");
682 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_PROTECTED],
683 build_tree_list (NULL_TREE, ridpointers[(int) RID_PROTECTED]));
684 ridpointers[(int) RID_TEMPLATE] = get_identifier ("template");
685 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_TEMPLATE],
686 build_tree_list (NULL_TREE, ridpointers[(int) RID_TEMPLATE]));
687 /* This is for ANSI C++. */
688 ridpointers[(int) RID_MUTABLE] = get_identifier ("mutable");
689 SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_MUTABLE],
690 build_tree_list (NULL_TREE, ridpointers[(int) RID_MUTABLE]));
692 /* Signature handling extensions. */
693 signature_type_node = build_int_2 (signature_type, 0);
694 TREE_TYPE (signature_type_node) = signature_type_node;
695 ridpointers[(int) RID_SIGNATURE] = signature_type_node;
697 opname_tab[(int) COMPONENT_REF] = "->";
698 opname_tab[(int) MEMBER_REF] = "->*";
699 opname_tab[(int) METHOD_CALL_EXPR] = "->()";
700 opname_tab[(int) INDIRECT_REF] = "(unary *)";
701 opname_tab[(int) ARRAY_REF] = "[]";
702 opname_tab[(int) MODIFY_EXPR] = "=";
703 opname_tab[(int) NEW_EXPR] = "new";
704 opname_tab[(int) DELETE_EXPR] = "delete";
705 opname_tab[(int) VEC_NEW_EXPR] = "new []";
706 opname_tab[(int) VEC_DELETE_EXPR] = "delete []";
707 opname_tab[(int) COND_EXPR] = "... ? ... : ...";
708 opname_tab[(int) CALL_EXPR] = "()";
709 opname_tab[(int) PLUS_EXPR] = "+";
710 opname_tab[(int) MINUS_EXPR] = "-";
711 opname_tab[(int) MULT_EXPR] = "*";
712 opname_tab[(int) TRUNC_DIV_EXPR] = "/";
713 opname_tab[(int) CEIL_DIV_EXPR] = "(ceiling /)";
714 opname_tab[(int) FLOOR_DIV_EXPR] = "(floor /)";
715 opname_tab[(int) ROUND_DIV_EXPR] = "(round /)";
716 opname_tab[(int) TRUNC_MOD_EXPR] = "%";
717 opname_tab[(int) CEIL_MOD_EXPR] = "(ceiling %)";
718 opname_tab[(int) FLOOR_MOD_EXPR] = "(floor %)";
719 opname_tab[(int) ROUND_MOD_EXPR] = "(round %)";
720 opname_tab[(int) NEGATE_EXPR] = "-";
721 opname_tab[(int) MIN_EXPR] = "<?";
722 opname_tab[(int) MAX_EXPR] = ">?";
723 opname_tab[(int) ABS_EXPR] = "abs";
724 opname_tab[(int) FFS_EXPR] = "ffs";
725 opname_tab[(int) LSHIFT_EXPR] = "<<";
726 opname_tab[(int) RSHIFT_EXPR] = ">>";
727 opname_tab[(int) BIT_IOR_EXPR] = "|";
728 opname_tab[(int) BIT_XOR_EXPR] = "^";
729 opname_tab[(int) BIT_AND_EXPR] = "&";
730 opname_tab[(int) BIT_ANDTC_EXPR] = "&~";
731 opname_tab[(int) BIT_NOT_EXPR] = "~";
732 opname_tab[(int) TRUTH_ANDIF_EXPR] = "&&";
733 opname_tab[(int) TRUTH_ORIF_EXPR] = "||";
734 opname_tab[(int) TRUTH_AND_EXPR] = "strict &&";
735 opname_tab[(int) TRUTH_OR_EXPR] = "strict ||";
736 opname_tab[(int) TRUTH_NOT_EXPR] = "!";
737 opname_tab[(int) LT_EXPR] = "<";
738 opname_tab[(int) LE_EXPR] = "<=";
739 opname_tab[(int) GT_EXPR] = ">";
740 opname_tab[(int) GE_EXPR] = ">=";
741 opname_tab[(int) EQ_EXPR] = "==";
742 opname_tab[(int) NE_EXPR] = "!=";
743 opname_tab[(int) IN_EXPR] = "in";
744 opname_tab[(int) RANGE_EXPR] = "..";
745 opname_tab[(int) CONVERT_EXPR] = "(unary +)";
746 opname_tab[(int) ADDR_EXPR] = "(unary &)";
747 opname_tab[(int) PREDECREMENT_EXPR] = "--";
748 opname_tab[(int) PREINCREMENT_EXPR] = "++";
749 opname_tab[(int) POSTDECREMENT_EXPR] = "--";
750 opname_tab[(int) POSTINCREMENT_EXPR] = "++";
751 opname_tab[(int) COMPOUND_EXPR] = ",";
753 assignop_tab[(int) NOP_EXPR] = "=";
754 assignop_tab[(int) PLUS_EXPR] = "+=";
755 assignop_tab[(int) CONVERT_EXPR] = "+=";
756 assignop_tab[(int) MINUS_EXPR] = "-=";
757 assignop_tab[(int) NEGATE_EXPR] = "-=";
758 assignop_tab[(int) MULT_EXPR] = "*=";
759 assignop_tab[(int) INDIRECT_REF] = "*=";
760 assignop_tab[(int) TRUNC_DIV_EXPR] = "/=";
761 assignop_tab[(int) EXACT_DIV_EXPR] = "(exact /=)";
762 assignop_tab[(int) CEIL_DIV_EXPR] = "(ceiling /=)";
763 assignop_tab[(int) FLOOR_DIV_EXPR] = "(floor /=)";
764 assignop_tab[(int) ROUND_DIV_EXPR] = "(round /=)";
765 assignop_tab[(int) TRUNC_MOD_EXPR] = "%=";
766 assignop_tab[(int) CEIL_MOD_EXPR] = "(ceiling %=)";
767 assignop_tab[(int) FLOOR_MOD_EXPR] = "(floor %=)";
768 assignop_tab[(int) ROUND_MOD_EXPR] = "(round %=)";
769 assignop_tab[(int) MIN_EXPR] = "<?=";
770 assignop_tab[(int) MAX_EXPR] = ">?=";
771 assignop_tab[(int) LSHIFT_EXPR] = "<<=";
772 assignop_tab[(int) RSHIFT_EXPR] = ">>=";
773 assignop_tab[(int) BIT_IOR_EXPR] = "|=";
774 assignop_tab[(int) BIT_XOR_EXPR] = "^=";
775 assignop_tab[(int) BIT_AND_EXPR] = "&=";
776 assignop_tab[(int) ADDR_EXPR] = "&=";
778 init_filename_times ();
780 /* Some options inhibit certain reserved words.
781 Clear those words out of the hash table so they won't be recognized. */
782 #define UNSET_RESERVED_WORD(STRING) \
783 do { struct resword *s = is_reserved_word (STRING, sizeof (STRING) - 1); \
784 if (s) s->name = ""; } while (0)
787 /* let's parse things, and if they use it, then give them an error. */
788 if (!flag_handle_exceptions)
790 UNSET_RESERVED_WORD ("throw");
791 UNSET_RESERVED_WORD ("try");
792 UNSET_RESERVED_WORD ("catch");
796 if (! (flag_gc || flag_rtti) || flag_no_gnu_keywords)
798 UNSET_RESERVED_WORD ("classof");
799 UNSET_RESERVED_WORD ("headof");
801 if (! flag_handle_signatures || flag_no_gnu_keywords)
803 /* Easiest way to not recognize signature
804 handling extensions... */
805 UNSET_RESERVED_WORD ("signature");
806 UNSET_RESERVED_WORD ("sigof");
808 if (flag_no_asm || flag_no_gnu_keywords)
809 UNSET_RESERVED_WORD ("typeof");
810 if (! flag_operator_names)
812 /* These are new ANSI keywords that may break code. */
813 UNSET_RESERVED_WORD ("and");
814 UNSET_RESERVED_WORD ("and_eq");
815 UNSET_RESERVED_WORD ("bitand");
816 UNSET_RESERVED_WORD ("bitor");
817 UNSET_RESERVED_WORD ("compl");
818 UNSET_RESERVED_WORD ("not");
819 UNSET_RESERVED_WORD ("not_eq");
820 UNSET_RESERVED_WORD ("or");
821 UNSET_RESERVED_WORD ("or_eq");
822 UNSET_RESERVED_WORD ("xor");
823 UNSET_RESERVED_WORD ("xor_eq");
825 if (! flag_traditional)
826 UNSET_RESERVED_WORD ("overload");
828 token_count = init_parse ();
829 interface_unknown = 1;
833 reinit_parse_for_function ()
835 current_base_init_list = NULL_TREE;
836 current_member_init_list = NULL_TREE;
843 yyprint (file, yychar, yylval)
855 case IDENTIFIER_DEFN:
858 case TYPENAME_ELLIPSIS:
860 case PRE_PARSED_CLASS_DECL:
862 my_friendly_assert (TREE_CODE (t) == IDENTIFIER_NODE, 224);
863 if (IDENTIFIER_POINTER (t))
864 fprintf (file, " `%s'", IDENTIFIER_POINTER (t));
867 if (yylval.ttype == class_type_node)
868 fprintf (file, " `class'");
869 else if (yylval.ttype == record_type_node)
870 fprintf (file, " `struct'");
871 else if (yylval.ttype == union_type_node)
872 fprintf (file, " `union'");
873 else if (yylval.ttype == enum_type_node)
874 fprintf (file, " `enum'");
875 else if (yylval.ttype == signature_type_node)
876 fprintf (file, " `signature'");
878 my_friendly_abort (80);
883 static int *reduce_count;
886 #define REDUCE_LENGTH (sizeof (yyr2) / sizeof (yyr2[0]))
887 #define TOKEN_LENGTH (256 + sizeof (yytname) / sizeof (yytname[0]))
892 #ifdef GATHER_STATISTICS
893 reduce_count = (int *)malloc (sizeof (int) * (REDUCE_LENGTH + 1));
894 bzero (reduce_count, sizeof (int) * (REDUCE_LENGTH + 1));
896 token_count = (int *)malloc (sizeof (int) * (TOKEN_LENGTH + 1));
897 bzero (token_count, sizeof (int) * (TOKEN_LENGTH + 1));
903 #ifdef GATHER_STATISTICS
908 reduce_count[yyn] += 1;
915 return reduce_count[*q] - reduce_count[*p];
922 return token_count[*q] - token_count[*p];
927 print_parse_statistics ()
929 #ifdef GATHER_STATISTICS
932 int maxlen = REDUCE_LENGTH;
935 if (reduce_count[-1] == 0)
938 if (TOKEN_LENGTH > REDUCE_LENGTH)
939 maxlen = TOKEN_LENGTH;
940 sorted = (unsigned *) alloca (sizeof (int) * maxlen);
942 for (i = 0; i < TOKEN_LENGTH; i++)
944 qsort (sorted, TOKEN_LENGTH, sizeof (int), token_cmp);
945 for (i = 0; i < TOKEN_LENGTH; i++)
947 int index = sorted[i];
948 if (token_count[index] == 0)
950 if (token_count[index] < token_count[-1])
952 fprintf (stderr, "token %d, `%s', count = %d\n",
953 index, yytname[YYTRANSLATE (index)], token_count[index]);
955 fprintf (stderr, "\n");
956 for (i = 0; i < REDUCE_LENGTH; i++)
958 qsort (sorted, REDUCE_LENGTH, sizeof (int), reduce_cmp);
959 for (i = 0; i < REDUCE_LENGTH; i++)
961 int index = sorted[i];
962 if (reduce_count[index] == 0)
964 if (reduce_count[index] < reduce_count[-1])
966 fprintf (stderr, "rule %d, line %d, count = %d\n",
967 index, yyrline[index], reduce_count[index]);
969 fprintf (stderr, "\n");
974 /* Sets the value of the 'yydebug' variable to VALUE.
975 This is a function so we don't have to have YYDEBUG defined
976 in order to build the compiler. */
985 warning ("YYDEBUG not defined.");
990 /* Functions and data structures for #pragma interface.
992 `#pragma implementation' means that the main file being compiled
993 is considered to implement (provide) the classes that appear in
994 its main body. I.e., if this is file "foo.cc", and class `bar'
995 is defined in "foo.cc", then we say that "foo.cc implements bar".
997 All main input files "implement" themselves automagically.
999 `#pragma interface' means that unless this file (of the form "foo.h"
1000 is not presently being included by file "foo.cc", the
1001 CLASSTYPE_INTERFACE_ONLY bit gets set. The effect is that none
1002 of the vtables nor any of the inline functions defined in foo.h
1003 will ever be output.
1005 There are cases when we want to link files such as "defs.h" and
1006 "main.cc". In this case, we give "defs.h" a `#pragma interface',
1007 and "main.cc" has `#pragma implementation "defs.h"'. */
1012 struct impl_files *next;
1015 static struct impl_files *impl_file_chain;
1017 /* Helper function to load global variables with interface
1020 extract_interface_info ()
1024 if (flag_alt_external_templates)
1026 struct tinst_level *til = tinst_for_decl ();
1029 fileinfo = get_time_identifier (til->file);
1032 fileinfo = get_time_identifier (input_filename);
1033 fileinfo = IDENTIFIER_CLASS_VALUE (fileinfo);
1034 interface_only = TREE_INT_CST_LOW (fileinfo);
1035 if (!processing_template_defn || flag_external_templates)
1036 interface_unknown = TREE_INT_CST_HIGH (fileinfo);
1039 /* Return nonzero if S is not considered part of an
1040 INTERFACE/IMPLEMENTATION pair. Otherwise, return 0. */
1042 interface_strcmp (s)
1045 /* Set the interface/implementation bits for this scope. */
1046 struct impl_files *ifiles;
1049 for (ifiles = impl_file_chain; ifiles; ifiles = ifiles->next)
1051 char *t1 = ifiles->filename;
1054 if (*s1 != *t1 || *s1 == 0)
1057 while (*s1 == *t1 && *s1 != 0)
1064 /* Don't get faked out by xxx.yyy.cc vs xxx.zzz.cc. */
1065 if (index (s1, '.') || index (t1, '.'))
1068 if (*s1 == '\0' || s1[-1] != '.' || t1[-1] != '.')
1080 set_typedecl_interface_info (prev, vars)
1083 tree id = get_time_identifier (DECL_SOURCE_FILE (vars));
1084 tree fileinfo = IDENTIFIER_CLASS_VALUE (id);
1085 tree type = TREE_TYPE (vars);
1087 CLASSTYPE_INTERFACE_ONLY (type) = TREE_INT_CST_LOW (fileinfo)
1088 = interface_strcmp (FILE_NAME_NONDIRECTORY (DECL_SOURCE_FILE (vars)));
1092 set_vardecl_interface_info (prev, vars)
1095 tree type = DECL_CONTEXT (vars);
1097 if (CLASSTYPE_INTERFACE_KNOWN (type))
1099 if (CLASSTYPE_INTERFACE_ONLY (type))
1100 set_typedecl_interface_info (prev, TYPE_NAME (type));
1102 CLASSTYPE_VTABLE_NEEDS_WRITING (type) = 1;
1103 DECL_EXTERNAL (vars) = CLASSTYPE_INTERFACE_ONLY (type);
1104 TREE_PUBLIC (vars) = 1;
1108 /* Called from the top level: if there are any pending inlines to
1109 do, set up to process them now. This function sets up the first function
1110 to be parsed; after it has been, the rule for fndef in parse.y will
1111 call process_next_inline to start working on the next one. */
1113 do_pending_inlines ()
1115 struct pending_inline *t;
1117 /* Oops, we're still dealing with the last batch. */
1118 if (yychar == PRE_PARSED_FUNCTION_DECL)
1121 /* Reverse the pending inline functions, since
1122 they were cons'd instead of appended. */
1124 struct pending_inline *prev = 0, *tail, *bottom = 0;
1125 t = pending_inlines;
1126 pending_inlines = 0;
1136 /* This kludge should go away when synthesized methods are handled
1137 properly, i.e. only when needed. */
1138 for (t = prev; t; t = t->next)
1143 DECL_PENDING_INLINE_INFO (f) = 0;
1144 interface_unknown = t->interface == 1;
1145 interface_only = t->interface == 0;
1146 synthesize_method (f);
1148 tail->next = t->next;
1159 obstack_free (&synth_obstack, bottom);
1160 extract_interface_info ();
1168 /* Now start processing the first inline function. */
1169 my_friendly_assert ((t->parm_vec == NULL_TREE) == (t->bindings == NULL_TREE),
1172 push_template_decls (t->parm_vec, t->bindings, 0);
1175 feed_input (t->buf, t->len, t->can_free ? &inline_text_obstack : 0);
1178 if (input_filename != t->filename)
1180 input_filename = t->filename;
1181 /* Get interface/implementation back in sync. */
1182 extract_interface_info ();
1185 input_filename = t->filename;
1186 interface_unknown = t->interface == 1;
1187 interface_only = t->interface == 0;
1189 yychar = PRE_PARSED_FUNCTION_DECL;
1191 /* Pass back a handle on the rest of the inline functions, so that they
1192 can be processed later. */
1193 yylval.ttype = build_tree_list ((tree) t, t->fndecl);
1195 if (flag_default_inline && t->fndecl
1196 /* If we're working from a template, don't change
1197 the `inline' state. */
1198 && t->parm_vec == NULL_TREE)
1199 DECL_INLINE (t->fndecl) = 1;
1201 DECL_PENDING_INLINE_INFO (t->fndecl) = 0;
1204 extern struct pending_input *to_be_restored;
1205 static int nextchar = -1;
1207 /* Called from the fndecl rule in the parser when the function just parsed
1208 was declared using a PRE_PARSED_FUNCTION_DECL (i.e. came from
1209 do_pending_inlines). */
1211 process_next_inline (t)
1214 struct pending_inline *i = (struct pending_inline *) TREE_PURPOSE (t);
1215 my_friendly_assert ((i->parm_vec == NULL_TREE) == (i->bindings == NULL_TREE),
1218 pop_template_decls (i->parm_vec, i->bindings, 0);
1220 if (yychar == YYEMPTY)
1222 if (yychar != END_OF_SAVED_INPUT)
1224 error ("parse error at end of saved function text");
1225 /* restore_pending_input will abort unless yychar is either
1226 * END_OF_SAVED_INPUT or YYEMPTY; since we already know we're
1227 * hosed, feed back YYEMPTY.
1228 * We also need to discard nextchar, since that may have gotten
1234 if (to_be_restored == 0)
1235 my_friendly_abort (123);
1236 restore_pending_input (to_be_restored);
1238 if (i && i->fndecl != NULL_TREE)
1240 my_friendly_assert ((i->parm_vec == NULL_TREE) == (i->bindings == NULL_TREE),
1243 push_template_decls (i->parm_vec, i->bindings, 0);
1244 feed_input (i->buf, i->len, i->can_free ? &inline_text_obstack : 0);
1246 input_filename = i->filename;
1247 yychar = PRE_PARSED_FUNCTION_DECL;
1248 yylval.ttype = build_tree_list ((tree) i, i->fndecl);
1250 if (flag_default_inline
1251 /* If we're working from a template, don't change
1252 the `inline' state. */
1253 && i->parm_vec == NULL_TREE)
1254 DECL_INLINE (i->fndecl) = 1;
1256 DECL_PENDING_INLINE_INFO (i->fndecl) = 0;
1260 interface_unknown = i->interface == 1;
1261 interface_only = i->interface == 0;
1264 extract_interface_info ();
1267 /* Since inline methods can refer to text which has not yet been seen,
1268 we store the text of the method in a structure which is placed in the
1269 DECL_PENDING_INLINE_INFO field of the FUNCTION_DECL.
1270 After parsing the body of the class definition, the FUNCTION_DECL's are
1271 scanned to see which ones have this field set. Those are then digested
1274 This function's FUNCTION_DECL will have a bit set in its common so
1275 that we know to watch out for it. */
1278 consume_string (this_obstack, matching_char)
1279 register struct obstack *this_obstack;
1283 int starting_lineno = lineno;
1289 int save_lineno = lineno;
1290 lineno = starting_lineno;
1291 if (matching_char == '"')
1292 error ("end of file encountered inside string constant");
1294 error ("end of file encountered inside character constant");
1295 lineno = save_lineno;
1300 obstack_1grow (this_obstack, c);
1302 obstack_1grow (this_obstack, c);
1304 /* Make sure we continue the loop */
1311 pedwarn ("ANSI C++ forbids newline in string constant");
1314 obstack_1grow (this_obstack, c);
1316 while (c != matching_char);
1319 static int nextyychar = YYEMPTY;
1320 static YYSTYPE nextyylval;
1322 struct pending_input {
1323 int nextchar, yychar, nextyychar, eof;
1324 YYSTYPE yylval, nextyylval;
1325 struct obstack token_obstack;
1329 struct pending_input *
1330 save_pending_input ()
1332 struct pending_input *p;
1333 p = (struct pending_input *) xmalloc (sizeof (struct pending_input));
1334 p->nextchar = nextchar;
1336 p->nextyychar = nextyychar;
1338 p->nextyylval = nextyylval;
1339 p->eof = end_of_file;
1340 yychar = nextyychar = YYEMPTY;
1342 p->first_token = first_token;
1343 p->token_obstack = token_obstack;
1346 gcc_obstack_init (&token_obstack);
1352 restore_pending_input (p)
1353 struct pending_input *p;
1355 my_friendly_assert (nextchar == -1, 229);
1356 nextchar = p->nextchar;
1357 my_friendly_assert (yychar == YYEMPTY || yychar == END_OF_SAVED_INPUT, 230);
1359 my_friendly_assert (nextyychar == YYEMPTY, 231);
1360 nextyychar = p->nextyychar;
1362 nextyylval = p->nextyylval;
1363 first_token = p->first_token;
1364 obstack_free (&token_obstack, (char *) 0);
1365 token_obstack = p->token_obstack;
1366 end_of_file = p->eof;
1370 /* Return next non-whitespace input character, which may come
1371 from `finput', or from `nextchar'. */
1383 return skip_white_space (c);
1386 /* Unget character CH from the input stream.
1387 If RESCAN is non-zero, then we want to `see' this
1388 character as the next input token. */
1390 yyungetc (ch, rescan)
1394 /* Unget a character from the input stream. */
1395 if (yychar == YYEMPTY || rescan == 0)
1398 put_back (nextchar);
1403 my_friendly_assert (nextyychar == YYEMPTY, 232);
1404 nextyychar = yychar;
1405 nextyylval = yylval;
1410 /* This function stores away the text for an inline function that should
1411 be processed later. It decides how much later, and may need to move
1412 the info between obstacks; therefore, the caller should not refer to
1413 the T parameter after calling this function.
1415 This function also stores the list of template-parameter bindings that
1416 will be needed for expanding the template, if any. */
1419 store_pending_inline (decl, t)
1421 struct pending_inline *t;
1423 extern int processing_template_defn;
1424 int delay_to_eof = 0;
1425 struct pending_inline **inlines;
1428 /* Default: compile right away, and no extra bindings are needed. */
1429 t->parm_vec = t->bindings = 0;
1430 if (processing_template_defn)
1432 tree type = current_class_type;
1433 /* Assumption: In this (possibly) nested class sequence, only
1434 one name will have template parms. */
1435 while (type && TREE_CODE_CLASS (TREE_CODE (type)) == 't')
1437 tree decl = TYPE_NAME (type);
1438 tree tmpl = IDENTIFIER_TEMPLATE (DECL_NAME (decl));
1441 t->parm_vec = DECL_TEMPLATE_INFO (TREE_PURPOSE (tmpl))->parm_vec;
1442 t->bindings = TREE_VALUE (tmpl);
1444 type = DECL_CONTEXT (decl);
1446 if (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE
1447 || TREE_CODE (TREE_TYPE (decl)) == FUNCTION_TYPE)
1449 if (TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE)
1450 my_friendly_assert (TYPE_MAX_VALUE (TREE_TYPE (decl)) == current_class_type,
1453 /* Inline functions can be compiled immediately. Other functions
1454 will be output separately, so if we're in interface-only mode,
1455 punt them now, or output them now if we're doing implementations
1456 and we know no overrides will exist. Otherwise, we delay until
1457 end-of-file, to see if the definition is really required. */
1458 if (DECL_THIS_INLINE (decl))
1459 /* delay_to_eof == 0 */;
1460 else if (current_class_type && !interface_unknown)
1465 print_node_brief (stderr, "\ndiscarding text for ", decl, 0);
1468 obstack_free (&inline_text_obstack, t->buf);
1469 DECL_PENDING_INLINE_INFO (decl) = 0;
1473 /* Don't delay the processing of virtual functions. */
1474 else if (DECL_VINDEX (decl) == NULL_TREE)
1478 my_friendly_abort (58);
1483 extern struct pending_inline *pending_template_expansions;
1487 char *free_to = t->buf;
1488 t->buf = (char *) obstack_copy (&permanent_obstack, t->buf,
1490 t = (struct pending_inline *) obstack_copy (&permanent_obstack,
1491 (char *)t, sizeof (*t));
1492 obstack_free (&inline_text_obstack, free_to);
1494 inlines = &pending_template_expansions;
1499 inlines = &pending_inlines;
1500 DECL_PENDING_INLINE_INFO (decl) = t;
1503 /* Because we use obstacks, we must process these in precise order. */
1508 void reinit_parse_for_block ();
1511 reinit_parse_for_method (yychar, decl)
1516 int starting_lineno = lineno;
1517 char *starting_filename = input_filename;
1519 reinit_parse_for_block (yychar, &inline_text_obstack, 0);
1521 len = obstack_object_size (&inline_text_obstack);
1522 current_base_init_list = NULL_TREE;
1523 current_member_init_list = NULL_TREE;
1524 if (decl == void_type_node
1525 || (current_class_type && TYPE_REDEFINED (current_class_type)))
1527 /* Happens when we get two declarations of the same
1528 function in the same scope. */
1529 char *buf = obstack_finish (&inline_text_obstack);
1530 obstack_free (&inline_text_obstack, buf);
1535 struct pending_inline *t;
1536 char *buf = obstack_finish (&inline_text_obstack);
1538 t = (struct pending_inline *) obstack_alloc (&inline_text_obstack,
1539 sizeof (struct pending_inline));
1540 t->lineno = starting_lineno;
1541 t->filename = starting_filename;
1548 if (interface_unknown && processing_template_defn && flag_external_templates && ! DECL_IN_SYSTEM_HEADER (decl))
1549 warn_if_unknown_interface (decl);
1550 t->interface = (interface_unknown ? 1 : (interface_only ? 0 : 2));
1551 store_pending_inline (decl, t);
1555 /* Consume a block -- actually, a method or template definition beginning
1556 with `:' or `{' -- and save it away on the specified obstack.
1558 Argument IS_TEMPLATE indicates which set of error messages should be
1559 output if something goes wrong. This should really be cleaned up somehow,
1560 without loss of clarity. */
1562 reinit_parse_for_block (yychar, obstackp, is_template)
1564 struct obstack *obstackp;
1569 int starting_lineno = lineno;
1570 char *starting_filename = input_filename;
1572 int look_for_semicolon = 0;
1573 int look_for_lbrac = 0;
1576 obstack_1grow (obstackp, '{');
1577 else if (yychar == '=')
1578 look_for_semicolon = 1;
1579 else if (yychar != ':' && (yychar != RETURN || is_template))
1581 yyerror (is_template
1582 ? "parse error in template specification"
1583 : "parse error in method specification");
1584 obstack_1grow (obstackp, '{');
1588 obstack_1grow (obstackp, yychar);
1593 if (nextchar != EOF)
1603 int this_lineno = lineno;
1605 c = skip_white_space (c);
1607 /* Don't lose our cool if there are lots of comments. */
1608 if (lineno == this_lineno + 1)
1609 obstack_1grow (obstackp, '\n');
1610 else if (lineno == this_lineno)
1612 else if (lineno - this_lineno < 10)
1615 for (i = lineno - this_lineno; i > 0; i--)
1616 obstack_1grow (obstackp, '\n');
1621 sprintf (buf, "\n# %d \"", lineno);
1623 obstack_grow (obstackp, buf, len);
1625 len = strlen (input_filename);
1626 obstack_grow (obstackp, input_filename, len);
1627 obstack_1grow (obstackp, '\"');
1628 obstack_1grow (obstackp, '\n');
1631 while (c > ' ') /* ASCII dependent... */
1633 obstack_1grow (obstackp, c);
1642 if (blev == 0 && !look_for_semicolon)
1647 /* Don't act on the next character...e.g, doing an escaped
1652 error_with_file_and_line (starting_filename,
1654 "end of file read inside definition");
1657 obstack_1grow (obstackp, c);
1660 consume_string (obstackp, c);
1662 consume_string (obstackp, c);
1668 ? "template body missing"
1669 : "function body for constructor missing");
1670 obstack_1grow (obstackp, '{');
1671 obstack_1grow (obstackp, '}');
1675 else if (look_for_semicolon && blev == 0)
1683 error_with_file_and_line (starting_filename,
1685 "end of file read inside definition");
1690 obstack_1grow (obstackp, c);
1695 obstack_1grow (obstackp, '\0');
1698 /* Build a default function named NAME for type TYPE.
1699 KIND says what to build.
1701 When KIND == 0, build default destructor.
1702 When KIND == 1, build virtual destructor.
1703 When KIND == 2, build default constructor.
1704 When KIND == 3, build default X(const X&) constructor.
1705 When KIND == 4, build default X(X&) constructor.
1706 When KIND == 5, build default operator = (const X&).
1707 When KIND == 6, build default operator = (X&). */
1710 cons_up_default_function (type, full_name, kind)
1711 tree type, full_name;
1714 extern tree void_list_node;
1715 char *func_buf = NULL;
1717 tree declspecs = NULL_TREE;
1722 tree name = constructor_name (full_name);
1728 declspecs = build_decl_list (NULL_TREE, ridpointers [(int) RID_VIRTUAL]);
1729 /* Fall through... */
1731 name = build_parse_node (BIT_NOT_EXPR, name);
1732 args = void_list_node;
1736 /* Default constructor. */
1737 args = void_list_node;
1738 complex = TYPE_NEEDS_CONSTRUCTING (type);
1742 type = build_type_variant (type, 1, 0);
1743 /* Fall through... */
1745 /* According to ARM $12.8, the default copy ctor will be declared, but
1746 not defined, unless it's needed. */
1747 argtype = build_reference_type (type);
1748 args = tree_cons (NULL_TREE,
1749 build_tree_list (hash_tree_chain (argtype, NULL_TREE),
1750 get_identifier ("_ctor_arg")),
1752 complex = TYPE_HAS_COMPLEX_INIT_REF (type);
1756 type = build_type_variant (type, 1, 0);
1757 /* Fall through... */
1760 declspecs = build_decl_list (NULL_TREE, full_name);
1762 name = ansi_opname [(int) MODIFY_EXPR];
1764 argtype = build_reference_type (type);
1765 args = tree_cons (NULL_TREE,
1766 build_tree_list (hash_tree_chain (argtype, NULL_TREE),
1767 get_identifier ("_ctor_arg")),
1769 complex = TYPE_HAS_COMPLEX_ASSIGN_REF (type);
1773 my_friendly_abort (59);
1776 declspecs = decl_tree_cons (NULL_TREE, ridpointers [(int) RID_INLINE],
1779 TREE_PARMLIST (args) = 1;
1782 tree declarator = build_parse_node (CALL_EXPR, name, args, NULL_TREE);
1784 declarator = build_parse_node (ADDR_EXPR, declarator);
1786 fn = grokfield (declarator, declspecs, NULL_TREE, NULL_TREE, NULL_TREE);
1789 if (fn == void_type_node)
1792 if (processing_template_defn)
1794 SET_DECL_IMPLICIT_INSTANTIATION (fn);
1795 repo_template_used (fn);
1798 if (CLASSTYPE_INTERFACE_KNOWN (type))
1800 DECL_INTERFACE_KNOWN (fn) = 1;
1801 DECL_NOT_REALLY_EXTERN (fn) = (!CLASSTYPE_INTERFACE_ONLY (type)
1802 && flag_implement_inlines);
1805 DECL_NOT_REALLY_EXTERN (fn) = 1;
1808 /* When on-the-fly synthesis works properly, remove the second and third
1810 if (flag_keep_inline_functions
1815 || ! DECL_EXTERNAL (fn))
1817 struct pending_inline *t;
1818 t = (struct pending_inline *)
1819 obstack_alloc (&synth_obstack, sizeof (struct pending_inline));
1822 t->interface = (interface_unknown ? 1 : (interface_only ? 0 : 2));
1823 store_pending_inline (fn, t);
1827 mark_inline_for_output (fn);
1829 #ifdef DEBUG_DEFAULT_FUNCTIONS
1830 { char *fn_type = NULL;
1834 case 0: fn_type = "default destructor"; break;
1835 case 1: fn_type = "virtual destructor"; break;
1836 case 2: fn_type = "default constructor"; break;
1837 case 3: fn_type = "default X(const X&)"; break;
1838 case 4: fn_type = "default X(X&)"; break;
1842 if (TREE_CODE (name) == BIT_NOT_EXPR)
1843 t = TREE_OPERAND (name, 0);
1844 fprintf (stderr, "[[[[ %s for %s:\n%s]]]]\n", fn_type,
1845 IDENTIFIER_POINTER (t), func_buf);
1848 #endif /* DEBUG_DEFAULT_FUNCTIONS */
1850 /* Show that this function was generated by the compiler. */
1851 SET_DECL_ARTIFICIAL (fn);
1856 /* Heuristic to tell whether the user is missing a semicolon
1857 after a struct or enum declaration. Emit an error message
1858 if we know the user has blown it. */
1860 check_for_missing_semicolon (type)
1868 && yychar != IDENTIFIER
1869 && yychar != TYPENAME)
1872 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (type)))
1873 error ("semicolon missing after %s declaration",
1874 TREE_CODE (type) == ENUMERAL_TYPE ? "enum" : "struct");
1876 cp_error ("semicolon missing after declaration of `%T'", type);
1877 shadow_tag (build_tree_list (0, type));
1879 /* Could probably also hack cases where class { ... } f (); appears. */
1884 note_got_semicolon (type)
1887 if (TREE_CODE_CLASS (TREE_CODE (type)) != 't')
1888 my_friendly_abort (60);
1889 if (IS_AGGR_TYPE (type))
1890 CLASSTYPE_GOT_SEMICOLON (type) = 1;
1894 note_list_got_semicolon (declspecs)
1899 for (link = declspecs; link; link = TREE_CHAIN (link))
1901 tree type = TREE_VALUE (link);
1902 if (TREE_CODE_CLASS (TREE_CODE (type)) == 't')
1903 note_got_semicolon (type);
1908 /* If C is not whitespace, return C.
1909 Otherwise skip whitespace and return first nonwhite char read. */
1912 skip_white_space (c)
1920 c = check_newline ();
1931 while (c == ' ' || c == '\t');
1939 error ("stray '\\' in program");
1951 /* Make the token buffer longer, preserving the data in it.
1952 P should point to just beyond the last valid character in the old buffer.
1953 The value we return is a pointer to the new buffer
1954 at a place corresponding to P. */
1957 extend_token_buffer (p)
1960 int offset = p - token_buffer;
1962 maxtoken = maxtoken * 2 + 10;
1963 token_buffer = (char *) xrealloc (token_buffer, maxtoken + 2);
1965 return token_buffer + offset;
1969 get_last_nonwhite_on_line ()
1973 /* Is this the last nonwhite stuff on the line? */
1975 c = nextchar, nextchar = -1;
1979 while (c == ' ' || c == '\t')
1984 /* At the beginning of a line, increment the line number
1985 and process any #-directive on this line.
1986 If the line is a #-directive, read the entire line and return a newline.
1987 Otherwise, return the line's first non-whitespace character. */
1997 /* Read first nonwhite char on the line. Do this before incrementing the
1998 line number, in case we're at the end of saved text. */
2002 while (c == ' ' || c == '\t');
2008 /* If not #, return it so caller will use it. */
2012 /* Don't read beyond this line. */
2015 /* Read first nonwhite char after the `#'. */
2019 while (c == ' ' || c == '\t');
2021 /* If a letter follows, then if the word here is `line', skip
2022 it and ignore it; otherwise, ignore the line, with an error
2023 if the word isn't `pragma'. */
2025 if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
2035 /* Read first nonwhite char after the `#pragma'. */
2039 while (c == ' ' || c == '\t');
2047 && ((c = getch ()) == ' ' || c == '\t'))
2049 extern tree pending_vtables;
2051 /* More follows: it must be a string constant (class name). */
2052 token = real_yylex ();
2053 if (token != STRING || TREE_CODE (yylval.ttype) != STRING_CST)
2055 error ("invalid #pragma vtable");
2058 if (write_virtuals != 2)
2060 warning ("use `+e2' option to enable #pragma vtable");
2063 pending_vtables = perm_tree_cons (NULL_TREE, get_identifier (TREE_STRING_POINTER (yylval.ttype)), pending_vtables);
2065 nextchar = getch ();
2068 warning ("trailing characters ignored");
2074 && ((c = getch ()) == ' ' || c == '\t'))
2076 /* More follows: it must be a string constant (unit name). */
2077 token = real_yylex ();
2078 if (token != STRING || TREE_CODE (yylval.ttype) != STRING_CST)
2080 error ("invalid #pragma unit");
2083 current_unit_name = get_identifier (TREE_STRING_POINTER (yylval.ttype));
2084 current_unit_language = current_lang_name;
2086 nextchar = getch ();
2089 warning ("trailing characters ignored");
2093 tree fileinfo = IDENTIFIER_CLASS_VALUE (get_time_identifier (input_filename));
2104 && ((c = getch ()) == ' ' || c == '\t' || c == EOF))
2106 int warned_already = 0;
2107 char *main_filename = input_filename;
2109 main_filename = FILE_NAME_NONDIRECTORY (main_filename);
2110 while (c == ' ' || c == '\t')
2115 token = real_yylex ();
2117 || TREE_CODE (yylval.ttype) != STRING_CST)
2119 error ("invalid `#pragma interface'");
2122 main_filename = TREE_STRING_POINTER (yylval.ttype);
2127 while (c == ' ' || c == '\t')
2132 if (!warned_already && extra_warnings
2133 && c != ' ' && c != '\t')
2135 warning ("garbage after `#pragma interface' ignored");
2143 if (impl_file_chain == 0)
2145 /* If this is zero at this point, then we are
2146 auto-implementing. */
2147 if (main_input_filename == 0)
2148 main_input_filename = input_filename;
2150 #ifdef AUTO_IMPLEMENT
2151 filename = FILE_NAME_NONDIRECTORY (main_input_filename);
2152 fi = get_time_identifier (filename);
2153 fi = IDENTIFIER_CLASS_VALUE (fi);
2154 TREE_INT_CST_LOW (fi) = 0;
2155 TREE_INT_CST_HIGH (fi) = 1;
2157 impl_file_chain = (struct impl_files *)permalloc (sizeof (struct impl_files));
2158 impl_file_chain->filename = filename;
2159 impl_file_chain->next = 0;
2163 interface_only = interface_strcmp (main_filename);
2164 interface_unknown = 0;
2165 TREE_INT_CST_LOW (fileinfo) = interface_only;
2166 TREE_INT_CST_HIGH (fileinfo) = interface_unknown;
2181 && ((c = getch ()) == ' ' || c == '\t' || c == EOF))
2183 int warned_already = 0;
2184 char *main_filename = main_input_filename ? main_input_filename : input_filename;
2186 main_filename = FILE_NAME_NONDIRECTORY (main_filename);
2187 while (c == ' ' || c == '\t')
2192 token = real_yylex ();
2194 || TREE_CODE (yylval.ttype) != STRING_CST)
2196 error ("invalid `#pragma implementation'");
2199 main_filename = TREE_STRING_POINTER (yylval.ttype);
2204 while (c == ' ' || c == '\t')
2209 if (!warned_already && extra_warnings
2210 && c != ' ' && c != '\t')
2212 warning ("garbage after `#pragma implementation' ignored");
2218 if (write_virtuals == 3)
2220 struct impl_files *ifiles = impl_file_chain;
2223 if (! strcmp (ifiles->filename, main_filename))
2225 ifiles = ifiles->next;
2229 ifiles = (struct impl_files*) permalloc (sizeof (struct impl_files));
2230 ifiles->filename = main_filename;
2231 ifiles->next = impl_file_chain;
2232 impl_file_chain = ifiles;
2235 else if ((main_input_filename != 0
2236 && ! strcmp (main_input_filename, input_filename))
2237 || ! strcmp (input_filename, main_filename))
2240 if (impl_file_chain == 0)
2242 impl_file_chain = (struct impl_files*) permalloc (sizeof (struct impl_files));
2243 impl_file_chain->filename = main_filename;
2244 impl_file_chain->next = 0;
2248 error ("`#pragma implementation' can only appear at top-level");
2251 /* We make this non-zero so that we infer decl linkage
2252 in the impl file only for variables first declared
2253 in the interface file. */
2254 interface_unknown = 1;
2256 /* We make this zero so that templates in the impl
2257 file will be emitted properly. */
2258 interface_unknown = 0;
2260 TREE_INT_CST_LOW (fileinfo) = interface_only;
2261 TREE_INT_CST_HIGH (fileinfo) = interface_unknown;
2264 #ifdef HANDLE_SYSV_PRAGMA
2268 handle_sysv_pragma ();
2271 #ifdef HANDLE_PRAGMA
2272 /* FIXME: This will break if we're doing any of the C++ input
2277 HANDLE_PRAGMA (finput);
2291 && ((c = getch ()) == ' ' || c == '\t'))
2293 #ifdef DWARF_DEBUGGING_INFO
2294 if ((debug_info_level == DINFO_LEVEL_VERBOSE)
2295 && (write_symbols == DWARF_DEBUG))
2296 dwarfout_define (lineno, get_directive_line (finput));
2297 #endif /* DWARF_DEBUGGING_INFO */
2307 && ((c = getch ()) == ' ' || c == '\t'))
2309 #ifdef DWARF_DEBUGGING_INFO
2310 if ((debug_info_level == DINFO_LEVEL_VERBOSE)
2311 && (write_symbols == DWARF_DEBUG))
2312 dwarfout_undef (lineno, get_directive_line (finput));
2313 #endif /* DWARF_DEBUGGING_INFO */
2322 && ((c = getch ()) == ' ' || c == '\t'))
2331 && ((c = getch ()) == ' ' || c == '\t'))
2333 #ifdef ASM_OUTPUT_IDENT
2334 extern FILE *asm_out_file;
2336 /* #ident. The pedantic warning is now in cccp.c. */
2338 /* Here we have just seen `#ident '.
2339 A string constant should follow. */
2341 while (c == ' ' || c == '\t')
2344 /* If no argument, ignore the line. */
2349 token = real_yylex ();
2351 || TREE_CODE (yylval.ttype) != STRING_CST)
2353 error ("invalid #ident");
2357 if (! flag_no_ident)
2359 #ifdef ASM_OUTPUT_IDENT
2360 ASM_OUTPUT_IDENT (asm_out_file,
2361 TREE_STRING_POINTER (yylval.ttype));
2365 /* Skip the rest of this line. */
2378 && ((c = getch ()) == ' ' || c == '\t'))
2380 /* Used to test incremental compilation. */
2381 sorry ("#pragma newworld");
2385 error ("undefined or invalid # directive");
2390 /* Here we have either `#line' or `# <nonletter>'.
2391 In either case, it should be a line number; a digit should follow. */
2393 while (c == ' ' || c == '\t')
2396 /* If the # is the only nonwhite char on the line,
2397 just ignore it. Check the new newline. */
2401 /* Something follows the #; read a token. */
2404 token = real_yylex ();
2406 if (token == CONSTANT
2407 && TREE_CODE (yylval.ttype) == INTEGER_CST)
2409 int old_lineno = lineno;
2410 enum { act_none, act_push, act_pop } action = act_none;
2411 int entering_system_header = 0;
2412 int entering_c_header = 0;
2414 /* subtract one, because it is the following line that
2415 gets the specified number */
2417 int l = TREE_INT_CST_LOW (yylval.ttype) - 1;
2418 c = get_last_nonwhite_on_line ();
2421 /* No more: store the line number and check following line. */
2427 /* More follows: it must be a string constant (filename). */
2429 /* Read the string constant, but don't treat \ as special. */
2430 ignore_escape_flag = 1;
2431 token = real_yylex ();
2432 ignore_escape_flag = 0;
2434 if (token != STRING || TREE_CODE (yylval.ttype) != STRING_CST)
2436 error ("invalid #line");
2440 /* Changing files again. This means currently collected time
2441 is charged against header time, and body time starts back
2443 if (flag_detailed_statistics)
2445 int this_time = my_get_run_time ();
2446 tree time_identifier = get_time_identifier (TREE_STRING_POINTER (yylval.ttype));
2447 header_time += this_time - body_time;
2448 TREE_INT_CST_LOW (IDENTIFIER_LOCAL_VALUE (this_filename_time))
2449 += this_time - body_time;
2450 this_filename_time = time_identifier;
2451 body_time = this_time;
2455 cadillac_note_source ();
2458 = (char *) permalloc (TREE_STRING_LENGTH (yylval.ttype) + 1);
2459 strcpy (input_filename, TREE_STRING_POINTER (yylval.ttype));
2461 GNU_xref_file (input_filename);
2463 if (main_input_filename == 0)
2465 struct impl_files *ifiles = impl_file_chain;
2469 while (ifiles->next)
2470 ifiles = ifiles->next;
2471 ifiles->filename = FILE_NAME_NONDIRECTORY (input_filename);
2474 main_input_filename = input_filename;
2475 if (write_virtuals == 3)
2476 walk_vtables (set_typedecl_interface_info, set_vardecl_interface_info);
2479 extract_interface_info ();
2481 c = get_last_nonwhite_on_line ();
2484 /* Update the name in the top element of input_file_stack. */
2485 if (input_file_stack)
2486 input_file_stack->name = input_filename;
2492 token = real_yylex ();
2494 /* `1' after file name means entering new file.
2495 `2' after file name means just left a file. */
2497 if (token == CONSTANT
2498 && TREE_CODE (yylval.ttype) == INTEGER_CST)
2500 if (TREE_INT_CST_LOW (yylval.ttype) == 1)
2502 else if (TREE_INT_CST_LOW (yylval.ttype) == 2)
2507 c = get_last_nonwhite_on_line ();
2511 token = real_yylex ();
2516 /* `3' after file name means this is a system header file. */
2518 if (token == CONSTANT
2519 && TREE_CODE (yylval.ttype) == INTEGER_CST
2520 && TREE_INT_CST_LOW (yylval.ttype) == 3)
2522 entering_system_header = 1;
2524 c = get_last_nonwhite_on_line ();
2528 token = real_yylex ();
2532 /* `4' after file name means this is a C header file. */
2534 if (token == CONSTANT
2535 && TREE_CODE (yylval.ttype) == INTEGER_CST
2536 && TREE_INT_CST_LOW (yylval.ttype) == 4)
2538 entering_c_header = 1;
2540 c = get_last_nonwhite_on_line ();
2544 token = real_yylex ();
2548 /* Do the actions implied by the preceding numbers. */
2550 if (action == act_push)
2552 /* Pushing to a new file. */
2553 struct file_stack *p;
2555 p = (struct file_stack *) xmalloc (sizeof (struct file_stack));
2556 input_file_stack->line = old_lineno;
2557 p->next = input_file_stack;
2558 p->name = input_filename;
2559 input_file_stack = p;
2560 input_file_stack_tick++;
2561 #ifdef DWARF_DEBUGGING_INFO
2562 if (debug_info_level == DINFO_LEVEL_VERBOSE
2563 && write_symbols == DWARF_DEBUG)
2564 dwarfout_start_new_source_file (input_filename);
2565 #endif /* DWARF_DEBUGGING_INFO */
2567 cadillac_push_source ();
2568 in_system_header = entering_system_header;
2571 else if (entering_c_header)
2574 ++pending_lang_change;
2577 else if (action == act_pop)
2579 /* Popping out of a file. */
2580 if (input_file_stack->next)
2582 struct file_stack *p;
2584 if (c_header_level && --c_header_level == 0)
2586 if (entering_c_header)
2587 warning ("badly nested C headers from preprocessor");
2588 --pending_lang_change;
2591 cadillac_pop_source ();
2592 in_system_header = entering_system_header;
2594 p = input_file_stack;
2595 input_file_stack = p->next;
2597 input_file_stack_tick++;
2598 #ifdef DWARF_DEBUGGING_INFO
2599 if (debug_info_level == DINFO_LEVEL_VERBOSE
2600 && write_symbols == DWARF_DEBUG)
2601 dwarfout_resume_previous_source_file (input_file_stack->line);
2602 #endif /* DWARF_DEBUGGING_INFO */
2605 error ("#-lines for entering and leaving files don't match");
2609 in_system_header = entering_system_header;
2611 cadillac_switch_source (-1);
2615 /* If NEXTCHAR is not end of line, we don't care what it is. */
2616 if (nextchar == EOF)
2620 error ("invalid #-line");
2622 /* skip the rest of this line. */
2626 while ((c = getch ()) != EOF && c != '\n');
2631 do_pending_lang_change ()
2633 for (; pending_lang_change > 0; --pending_lang_change)
2634 push_lang_context (lang_name_c);
2635 for (; pending_lang_change < 0; ++pending_lang_change)
2636 pop_lang_context ();
2640 #define isalnum(char) (char >= 'a' ? char <= 'z' : char >= '0' ? char <= '9' || (char >= 'A' && char <= 'Z') : 0)
2641 #define isdigit(char) (char >= '0' && char <= '9')
2646 #define ENDFILE -1 /* token that represents end-of-file */
2648 /* Read an escape sequence, returning its equivalent as a character,
2649 or store 1 in *ignore_ptr if it is backslash-newline. */
2652 readescape (ignore_ptr)
2655 register int c = getch ();
2657 register unsigned count;
2664 if (warn_traditional)
2665 warning ("the meaning of `\\x' varies with -traditional");
2667 if (flag_traditional)
2682 if (c >= 'a' && c <= 'f')
2683 code += c - 'a' + 10;
2684 if (c >= 'A' && c <= 'F')
2685 code += c - 'A' + 10;
2686 if (c >= '0' && c <= '9')
2688 if (code != 0 || count != 0)
2697 error ("\\x used with no following hex digits");
2698 else if (count == 0)
2699 /* Digits are all 0's. Ok. */
2701 else if ((count - 1) * 4 >= TYPE_PRECISION (integer_type_node)
2703 && ((1 << (TYPE_PRECISION (integer_type_node) - (count - 1) * 4))
2705 pedwarn ("hex escape out of range");
2708 case '0': case '1': case '2': case '3': case '4':
2709 case '5': case '6': case '7':
2712 while ((c <= '7') && (c >= '0') && (count++ < 3))
2714 code = (code * 8) + (c - '0');
2720 case '\\': case '\'': case '"':
2729 return TARGET_NEWLINE;
2744 if (warn_traditional)
2745 warning ("the meaning of `\\a' varies with -traditional");
2747 if (flag_traditional)
2757 pedwarn ("non-ANSI-standard escape sequence, `\\%c'", c);
2763 /* `\(', etc, are used at beginning of line to avoid confusing Emacs. */
2767 /* `\%' is used to prevent SCCS from getting confused. */
2770 pedwarn ("unknown escape sequence `\\%c'", c);
2773 if (c >= 040 && c < 0177)
2774 pedwarn ("unknown escape sequence `\\%c'", c);
2776 pedwarn ("unknown escape sequence: `\\' followed by char code 0x%x", c);
2780 /* Value is 1 (or 2) if we should try to make the next identifier look like
2781 a typename (when it may be a local variable or a class variable).
2782 Value is 0 if we treat this name in a default fashion. */
2783 int looking_for_typename = 0;
2786 /* NO LONGER USED: Value is -1 if we must not see a type name. */
2788 dont_see_typename ()
2790 looking_for_typename = -1;
2791 if (yychar == TYPENAME || yychar == PTYPENAME)
2793 yychar = IDENTIFIER;
2800 extern __inline int identifier_type ();
2804 identifier_type (decl)
2807 if (TREE_CODE (decl) == TEMPLATE_DECL
2808 && DECL_TEMPLATE_IS_CLASS (decl))
2810 if (TREE_CODE (decl) == NAMESPACE_DECL)
2812 if (TREE_CODE (decl) != TYPE_DECL)
2820 looking_for_typename = 0;
2821 if (yychar == IDENTIFIER)
2823 lastiddecl = lookup_name (yylval.ttype, -2);
2824 if (lastiddecl == 0)
2827 lastiddecl = IDENTIFIER_LABEL_VALUE (yylval.ttype);
2830 yychar = identifier_type (lastiddecl);
2835 do_identifier (token)
2836 register tree token;
2838 register tree id = lastiddecl;
2840 if (yychar == YYEMPTY)
2842 /* Scope class declarations before global
2844 if (id == IDENTIFIER_GLOBAL_VALUE (token)
2845 && current_class_type != 0
2846 && TYPE_SIZE (current_class_type) == 0
2847 && TREE_CODE (current_class_type) != UNINSTANTIATED_P_TYPE)
2849 /* Could be from one of the base classes. */
2850 tree field = lookup_field (current_class_type, token, 1, 0);
2853 else if (field == error_mark_node)
2854 /* We have already generated the error message.
2855 But we still want to return this value. */
2856 id = lookup_field (current_class_type, token, 0, 0);
2857 else if (TREE_CODE (field) == VAR_DECL
2858 || TREE_CODE (field) == CONST_DECL)
2860 else if (TREE_CODE (field) != FIELD_DECL)
2861 my_friendly_abort (61);
2864 cp_error ("invalid use of member `%D' from base class `%T'", field,
2865 DECL_FIELD_CONTEXT (field));
2866 id = error_mark_node;
2871 /* Remember that this name has been used in the class definition, as per
2873 if (id && current_class_type
2874 && TYPE_BEING_DEFINED (current_class_type)
2875 && ! IDENTIFIER_CLASS_VALUE (token))
2876 pushdecl_class_level (id);
2878 if (!id || id == error_mark_node)
2880 if (id == error_mark_node && current_class_type != NULL_TREE)
2882 id = lookup_nested_field (token, 1);
2883 /* In lookup_nested_field(), we marked this so we can gracefully
2884 leave this whole mess. */
2885 if (id && id != error_mark_node && TREE_TYPE (id) == error_mark_node)
2888 if (yychar == '(' || yychar == LEFT_RIGHT)
2890 id = implicitly_declare (token);
2892 else if (current_function_decl == 0)
2894 cp_error ("`%D' was not declared in this scope", token);
2895 id = error_mark_node;
2899 if (IDENTIFIER_GLOBAL_VALUE (token) != error_mark_node
2900 || IDENTIFIER_ERROR_LOCUS (token) != current_function_decl)
2902 static int undeclared_variable_notice;
2904 cp_error ("`%D' undeclared (first use this function)", token);
2906 if (! undeclared_variable_notice)
2908 error ("(Each undeclared identifier is reported only once");
2909 error ("for each function it appears in.)");
2910 undeclared_variable_notice = 1;
2913 id = error_mark_node;
2914 /* Prevent repeated error messages. */
2915 IDENTIFIER_GLOBAL_VALUE (token) = error_mark_node;
2916 SET_IDENTIFIER_ERROR_LOCUS (token, current_function_decl);
2919 /* TREE_USED is set in `hack_identifier'. */
2920 if (TREE_CODE (id) == CONST_DECL)
2922 if (IDENTIFIER_CLASS_VALUE (token) == id)
2925 enum access_type access
2926 = compute_access (TYPE_BINFO (current_class_type), id);
2927 if (access == access_private)
2928 cp_error ("enum `%D' is private", id);
2929 /* protected is OK, since it's an enum of `this'. */
2931 id = DECL_INITIAL (id);
2934 id = hack_identifier (id, token, yychar);
2939 identifier_typedecl_value (node)
2943 type = IDENTIFIER_TYPE_VALUE (node);
2944 if (type == NULL_TREE)
2949 if (t && TREE_CODE (t) == TYPE_DECL && TREE_TYPE (t) == type) \
2952 do (IDENTIFIER_LOCAL_VALUE (node));
2953 do (IDENTIFIER_CLASS_VALUE (node));
2954 do (IDENTIFIER_GLOBAL_VALUE (node));
2956 /* Will this one ever happen? */
2957 if (TYPE_NAME (type))
2958 return TYPE_NAME (type);
2960 /* We used to do an internal error of 62 here, but instead we will
2961 handle the return of a null appropriately in the callers. */
2970 char long_long_flag;
2973 struct try_type type_sequence[] =
2975 { &integer_type_node, 0, 0, 0},
2976 { &unsigned_type_node, 1, 0, 0},
2977 { &long_integer_type_node, 0, 1, 0},
2978 { &long_unsigned_type_node, 1, 1, 0},
2979 { &long_long_integer_type_node, 0, 1, 1},
2980 { &long_long_unsigned_type_node, 1, 1, 1}
2989 int dollar_seen = 0;
2993 c = nextchar, nextchar = -1;
2997 /* Effectively do c = skip_white_space (c)
2998 but do it faster in the usual cases. */
3011 /* Call skip_white_space so we can warn if appropriate. */
3016 c = skip_white_space (c);
3018 goto found_nonwhite;
3022 token_buffer[0] = c;
3023 token_buffer[1] = 0;
3025 /* yylloc.first_line = lineno; */
3030 token_buffer[0] = '\0';
3032 if (input_redirected ())
3033 value = END_OF_SAVED_INPUT;
3035 value = END_OF_LINE;
3036 else if (do_pending_expansions ())
3037 /* this will set yychar for us */
3044 if (dollars_in_ident)
3053 /* Capital L may start a wide-string or wide-character constant. */
3055 register int c = getch ();
3064 goto string_constant;
3069 case 'A': case 'B': case 'C': case 'D': case 'E':
3070 case 'F': case 'G': case 'H': case 'I': case 'J':
3071 case 'K': case 'M': case 'N': case 'O':
3072 case 'P': case 'Q': case 'R': case 'S': case 'T':
3073 case 'U': case 'V': case 'W': case 'X': case 'Y':
3075 case 'a': case 'b': case 'c': case 'd': case 'e':
3076 case 'f': case 'g': case 'h': case 'i': case 'j':
3077 case 'k': case 'l': case 'm': case 'n': case 'o':
3078 case 'p': case 'q': case 'r': case 's': case 't':
3079 case 'u': case 'v': case 'w': case 'x': case 'y':
3089 /* We know that `token_buffer' can hold at least on char,
3090 so we install C immediately.
3091 We may have to read the value in `putback_char', so call
3096 /* Make this run fast. We know that we are reading straight
3097 from FINPUT in this case (since identifiers cannot straddle
3099 while (isalnum (c) || (c == '_') || c == '$')
3101 if (c == '$' && ! dollars_in_ident)
3103 if (p >= token_buffer + maxtoken)
3104 p = extend_token_buffer (p);
3112 /* We know that `token_buffer' can hold at least on char,
3113 so we install C immediately. */
3117 while (isalnum (c) || (c == '_') || c == '$')
3119 if (c == '$' && ! dollars_in_ident)
3121 if (p >= token_buffer + maxtoken)
3122 p = extend_token_buffer (p);
3135 /* Try to recognize a keyword. Uses minimum-perfect hash function */
3138 register struct resword *ptr;
3140 if (ptr = is_reserved_word (token_buffer, p - token_buffer))
3144 tree old_ttype = ridpointers[(int) ptr->rid];
3146 /* If this provides a type for us, then revert lexical
3147 state to standard state. */
3148 if (TREE_CODE (old_ttype) == IDENTIFIER_NODE
3149 && IDENTIFIER_GLOBAL_VALUE (old_ttype) != 0
3150 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (old_ttype)) == TYPE_DECL)
3151 looking_for_typename = 0;
3152 else if (ptr->token == AGGR || ptr->token == ENUM)
3153 looking_for_typename = 1;
3155 /* Check if this is a language-type declaration.
3156 Just glimpse the next non-white character. */
3157 nextchar = skip_white_space (nextchar);
3158 if (nextchar == '"')
3160 /* We are looking at a string. Complain
3161 if the token before the string is no `extern'.
3163 Could cheat some memory by placing this string
3164 on the temporary_, instead of the saveable_
3167 if (ptr->rid != RID_EXTERN)
3168 error ("invalid modifier `%s' for language string",
3171 value = EXTERN_LANG_STRING;
3172 yylval.ttype = get_identifier (TREE_STRING_POINTER (yylval.ttype));
3175 if (ptr->token == VISSPEC)
3180 yylval.itype = access_public;
3183 yylval.itype = access_private;
3186 yylval.itype = access_protected;
3189 my_friendly_abort (63);
3193 yylval.ttype = old_ttype;
3195 else if (ptr->token == EQCOMPARE)
3197 yylval.code = NE_EXPR;
3198 token_buffer[0] = '!';
3199 token_buffer[1] = '=';
3200 token_buffer[2] = 0;
3202 else if (ptr->token == ASSIGN)
3204 if (strcmp ("and_eq", token_buffer) == 0)
3206 yylval.code = BIT_AND_EXPR;
3207 token_buffer[0] = '&';
3209 else if (strcmp ("or_eq", token_buffer) == 0)
3211 yylval.code = BIT_IOR_EXPR;
3212 token_buffer[0] = '|';
3214 else if (strcmp ("xor_eq", token_buffer) == 0)
3216 yylval.code = BIT_XOR_EXPR;
3217 token_buffer[0] = '^';
3219 token_buffer[1] = '=';
3220 token_buffer[2] = 0;
3222 else if (ptr->token == '&')
3224 yylval.code = BIT_AND_EXPR;
3225 token_buffer[0] = '&';
3226 token_buffer[1] = 0;
3228 else if (ptr->token == '|')
3230 yylval.code = BIT_IOR_EXPR;
3231 token_buffer[0] = '|';
3232 token_buffer[1] = 0;
3234 else if (ptr->token == '^')
3236 yylval.code = BIT_XOR_EXPR;
3237 token_buffer[0] = '^';
3238 token_buffer[1] = 0;
3241 value = (int) ptr->token;
3245 /* If we did not find a keyword, look for an identifier
3248 if (strcmp ("catch", token_buffer) == 0
3249 || strcmp ("throw", token_buffer) == 0
3250 || strcmp ("try", token_buffer) == 0)
3252 static int did_warn = 0;
3253 if (! did_warn && ! flag_handle_exceptions)
3255 pedwarn ("`catch', `throw', and `try' are all C++ reserved words");
3260 if (value == IDENTIFIER || value == TYPESPEC)
3261 GNU_xref_ref (current_function_decl, token_buffer);
3263 if (value == IDENTIFIER)
3265 register tree tmp = get_identifier (token_buffer);
3267 #if !defined(VMS) && defined(JOINER)
3268 /* Make sure that user does not collide with our internal
3272 && (THIS_NAME_P (tmp)
3273 || VPTR_NAME_P (tmp)
3274 || DESTRUCTOR_NAME_P (tmp)
3275 || VTABLE_NAME_P (tmp)
3276 || TEMP_NAME_P (tmp)
3277 || ANON_AGGRNAME_P (tmp)
3278 || ANON_PARMNAME_P (tmp)))
3279 warning ("identifier name `%s' conflicts with GNU C++ internal naming strategy",
3285 /* A user-invisible read-only initialized variable
3286 should be replaced by its value. We only handle strings
3287 since that's the only case used in C (and C++). */
3288 /* Note we go right after the local value for the identifier
3289 (e.g., __FUNCTION__ or __PRETTY_FUNCTION__). We used to
3290 call lookup_name, but that could result in an error about
3292 tmp = IDENTIFIER_LOCAL_VALUE (yylval.ttype);
3293 if (tmp != NULL_TREE
3294 && TREE_CODE (tmp) == VAR_DECL
3295 && DECL_IGNORED_P (tmp)
3296 && TREE_READONLY (tmp)
3297 && DECL_INITIAL (tmp) != NULL_TREE
3298 && TREE_CODE (DECL_INITIAL (tmp)) == STRING_CST)
3300 yylval.ttype = DECL_INITIAL (tmp);
3304 if (value == NEW && ! global_bindings_p ())
3314 register int c1 = getch ();
3315 token_buffer[0] = c;
3316 token_buffer[1] = c1;
3320 token_buffer[2] = 0;
3328 token_buffer[2] = c1;
3329 token_buffer[3] = 0;
3333 error ("parse error at `..'");
3338 goto resume_numerical_scan;
3342 token_buffer[1] = 0;
3346 /* Optimize for most frequent case. */
3348 register int c1 = getch ();
3349 if (! isalnum (c1) && c1 != '.')
3351 /* Terminate string. */
3352 token_buffer[0] = c;
3353 token_buffer[1] = 0;
3355 yylval.ttype = integer_zero_node;
3357 yylval.ttype = integer_one_node;
3364 /* fall through... */
3365 case '2': case '3': case '4':
3366 case '5': case '6': case '7': case '8': case '9':
3367 resume_numerical_scan:
3372 int largest_digit = 0;
3374 /* for multi-precision arithmetic,
3375 we actually store only HOST_BITS_PER_CHAR bits in each part.
3376 The number of parts is chosen so as to be sufficient to hold
3377 the enough bits to fit into the two HOST_WIDE_INTs that contain
3378 the integer value (this is always at least as many bits as are
3379 in a target `long long' value, but may be wider). */
3380 #define TOTAL_PARTS ((HOST_BITS_PER_WIDE_INT / HOST_BITS_PER_CHAR) * 2 + 2)
3381 int parts[TOTAL_PARTS];
3384 enum anon1 { NOT_FLOAT, AFTER_POINT, TOO_MANY_POINTS} floatflag
3390 for (count = 0; count < TOTAL_PARTS; count++)
3395 *p++ = (c = getch ());
3396 if ((c == 'x') || (c == 'X'))
3399 *p++ = (c = getch ());
3401 /* Leading 0 forces octal unless the 0 is the only digit. */
3402 else if (c >= '0' && c <= '9')
3411 /* Read all the digits-and-decimal-points. */
3414 || (isalnum (c) && (c != 'l') && (c != 'L')
3415 && (c != 'u') && (c != 'U')
3416 && (floatflag == NOT_FLOAT || ((c != 'f') && (c != 'F')))))
3421 error ("floating constant may not be in radix 16");
3422 if (floatflag == AFTER_POINT)
3424 error ("malformed floating constant");
3425 floatflag = TOO_MANY_POINTS;
3428 floatflag = AFTER_POINT;
3431 *p++ = c = getch ();
3432 /* Accept '.' as the start of a floating-point number
3433 only when it is followed by a digit.
3434 Otherwise, unread the following non-digit
3435 and use the '.' as a structural token. */
3436 if (p == token_buffer + 2 && !isdigit (c))
3448 error ("parse error at `..'");
3451 token_buffer[1] = '\0';
3458 /* It is not a decimal point.
3459 It should be a digit (perhaps a hex digit). */
3465 else if (base <= 10)
3467 if (c == 'e' || c == 'E')
3470 floatflag = AFTER_POINT;
3471 break; /* start of exponent */
3473 error ("nondigits in number and not hexadecimal");
3484 if (c >= largest_digit)
3488 for (count = 0; count < TOTAL_PARTS; count++)
3490 parts[count] *= base;
3494 += (parts[count-1] >> HOST_BITS_PER_CHAR);
3496 &= (1 << HOST_BITS_PER_CHAR) - 1;
3502 /* If the extra highest-order part ever gets anything in it,
3503 the number is certainly too big. */
3504 if (parts[TOTAL_PARTS - 1] != 0)
3507 if (p >= token_buffer + maxtoken - 3)
3508 p = extend_token_buffer (p);
3509 *p++ = (c = getch ());
3514 error ("numeric constant with no digits");
3516 if (largest_digit >= base)
3517 error ("numeric constant contains digits beyond the radix");
3519 /* Remove terminating char from the token buffer and delimit the string */
3522 if (floatflag != NOT_FLOAT)
3524 tree type = double_type_node;
3527 int garbage_chars = 0;
3528 REAL_VALUE_TYPE value;
3531 /* Read explicit exponent if any, and put it in tokenbuf. */
3533 if ((c == 'e') || (c == 'E'))
3535 if (p >= token_buffer + maxtoken - 3)
3536 p = extend_token_buffer (p);
3539 if ((c == '+') || (c == '-'))
3545 error ("floating constant exponent has no digits");
3548 if (p >= token_buffer + maxtoken - 3)
3549 p = extend_token_buffer (p);
3558 /* Convert string to a double, checking for overflow. */
3559 if (setjmp (handler))
3561 error ("floating constant out of range");
3566 set_float_handler (handler);
3567 /* The second argument, machine_mode, of REAL_VALUE_ATOF
3568 tells the desired precision of the binary result of
3569 decimal-to-binary conversion. */
3571 /* Read the suffixes to choose a data type. */
3575 type = float_type_node;
3576 value = REAL_VALUE_ATOF (token_buffer, TYPE_MODE (type));
3581 type = long_double_type_node;
3582 value = REAL_VALUE_ATOF (token_buffer, TYPE_MODE (type));
3587 value = REAL_VALUE_ATOF (token_buffer, TYPE_MODE (type));
3589 set_float_handler (NULL_PTR);
3592 && (REAL_VALUE_ISINF (value)
3594 || (TARGET_FLOAT_FORMAT != IEEE_FLOAT_FORMAT
3596 /* ERANGE is also reported for underflow, so test the
3597 value to distinguish overflow from that. */
3598 && (REAL_VALUES_LESS (dconst1, value)
3599 || REAL_VALUES_LESS (value, dconstm1)))
3603 pedwarn ("floating point number exceeds range of `%s'",
3604 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
3606 /* Note: garbage_chars is -1 if first char is *not* garbage. */
3609 if (c == 'f' || c == 'F')
3612 error ("two `f's in floating constant");
3615 if (c == 'l' || c == 'L')
3618 error ("two `l's in floating constant");
3621 if (p >= token_buffer + maxtoken - 3)
3622 p = extend_token_buffer (p);
3628 if (garbage_chars > 0)
3629 error ("garbage at end of number");
3631 /* Create a node with determined type and value. */
3632 yylval.ttype = build_real (type, value);
3640 HOST_WIDE_INT high, low;
3641 int spec_unsigned = 0;
3643 int spec_long_long = 0;
3648 if (c == 'u' || c == 'U')
3651 error ("two `u's in integer constant");
3654 else if (c == 'l' || c == 'L')
3659 error ("three `l's in integer constant");
3661 pedwarn ("ANSI C++ forbids long long integer constants");
3670 error ("garbage at end of number");
3673 if (p >= token_buffer + maxtoken - 3)
3674 p = extend_token_buffer (p);
3681 if (p >= token_buffer + maxtoken - 3)
3682 p = extend_token_buffer (p);
3689 /* If the constant is not long long and it won't fit in an
3690 unsigned long, or if the constant is long long and won't fit
3691 in an unsigned long long, then warn that the constant is out
3694 /* ??? This assumes that long long and long integer types are
3695 a multiple of 8 bits. This better than the original code
3696 though which assumed that long was exactly 32 bits and long
3697 long was exactly 64 bits. */
3700 bytes = TYPE_PRECISION (long_long_integer_type_node) / 8;
3702 bytes = TYPE_PRECISION (long_integer_type_node) / 8;
3705 for (i = bytes; i < TOTAL_PARTS; i++)
3709 pedwarn ("integer constant out of range");
3711 /* This is simplified by the fact that our constant
3712 is always positive. */
3715 for (i = 0; i < HOST_BITS_PER_WIDE_INT / HOST_BITS_PER_CHAR; i++)
3717 high |= ((HOST_WIDE_INT) parts[i + (HOST_BITS_PER_WIDE_INT
3718 / HOST_BITS_PER_CHAR)]
3719 << (i * HOST_BITS_PER_CHAR));
3720 low |= (HOST_WIDE_INT) parts[i] << (i * HOST_BITS_PER_CHAR);
3724 yylval.ttype = build_int_2 (low, high);
3725 TREE_TYPE (yylval.ttype) = long_long_unsigned_type_node;
3728 /* Find the first allowable type that the value fits in. */
3730 for (i = 0; i < sizeof (type_sequence) / sizeof (type_sequence[0]);
3732 if (!(spec_long && !type_sequence[i].long_flag)
3733 && !(spec_long_long && !type_sequence[i].long_long_flag)
3734 && !(spec_unsigned && !type_sequence[i].unsigned_flag)
3735 /* A hex or octal constant traditionally is unsigned. */
3736 && !(base != 10 && flag_traditional
3737 && !type_sequence[i].unsigned_flag)
3738 /* A decimal constant can't be unsigned int
3739 unless explicitly specified. */
3740 && !(base == 10 && !spec_unsigned
3741 && *type_sequence[i].node_var == unsigned_type_node))
3742 if (int_fits_type_p (yylval.ttype, *type_sequence[i].node_var))
3744 type = *type_sequence[i].node_var;
3747 if (flag_traditional && type == long_unsigned_type_node
3749 type = long_integer_type_node;
3753 type = long_long_integer_type_node;
3754 warning ("integer constant out of range");
3757 /* Warn about some cases where the type of a given constant
3758 changes from traditional C to ANSI C. */
3759 if (warn_traditional)
3761 tree other_type = 0;
3763 /* This computation is the same as the previous one
3764 except that flag_traditional is used backwards. */
3765 for (i = 0; i < sizeof (type_sequence) / sizeof (type_sequence[0]);
3767 if (!(spec_long && !type_sequence[i].long_flag)
3768 && !(spec_long_long && !type_sequence[i].long_long_flag)
3769 && !(spec_unsigned && !type_sequence[i].unsigned_flag)
3770 /* A hex or octal constant traditionally is unsigned. */
3771 && !(base != 10 && !flag_traditional
3772 && !type_sequence[i].unsigned_flag)
3773 /* A decimal constant can't be unsigned int
3774 unless explicitly specified. */
3775 && !(base == 10 && !spec_unsigned
3776 && *type_sequence[i].node_var == unsigned_type_node))
3777 if (int_fits_type_p (yylval.ttype, *type_sequence[i].node_var))
3779 other_type = *type_sequence[i].node_var;
3782 if (!flag_traditional && type == long_unsigned_type_node
3784 type = long_integer_type_node;
3786 if (other_type != 0 && other_type != type)
3788 if (flag_traditional)
3789 warning ("type of integer constant would be different without -traditional");
3791 warning ("type of integer constant would be different with -traditional");
3796 if (!spec_long && !spec_unsigned
3797 && !(flag_traditional && base != 10)
3798 && int_fits_type_p (yylval.ttype, integer_type_node))
3801 if (warn_traditional && base != 10)
3802 warning ("small nondecimal constant becomes signed in ANSI C++");
3804 type = integer_type_node;
3806 else if (!spec_long && (base != 10 || spec_unsigned)
3807 && int_fits_type_p (yylval.ttype, unsigned_type_node))
3809 /* Nondecimal constants try unsigned even in traditional C. */
3810 type = unsigned_type_node;
3813 else if (!spec_unsigned && !spec_long_long
3814 && int_fits_type_p (yylval.ttype, long_integer_type_node))
3815 type = long_integer_type_node;
3817 else if (! spec_long_long
3818 && int_fits_type_p (yylval.ttype,
3819 long_unsigned_type_node))
3822 if (warn_traditional && !spec_unsigned)
3823 warning ("large integer constant becomes unsigned in ANSI C++");
3825 if (flag_traditional && !spec_unsigned)
3826 type = long_integer_type_node;
3828 type = long_unsigned_type_node;
3831 else if (! spec_unsigned
3832 /* Verify value does not overflow into sign bit. */
3833 && TREE_INT_CST_HIGH (yylval.ttype) >= 0
3834 && int_fits_type_p (yylval.ttype,
3835 long_long_integer_type_node))
3836 type = long_long_integer_type_node;
3838 else if (int_fits_type_p (yylval.ttype,
3839 long_long_unsigned_type_node))
3842 if (warn_traditional && !spec_unsigned)
3843 warning ("large nondecimal constant is unsigned in ANSI C++");
3846 if (flag_traditional && !spec_unsigned)
3847 type = long_long_integer_type_node;
3849 type = long_long_unsigned_type_node;
3854 type = long_long_integer_type_node;
3855 warning ("integer constant out of range");
3857 if (base == 10 && ! spec_unsigned && TREE_UNSIGNED (type))
3858 warning ("decimal integer constant is so large that it is unsigned");
3862 TREE_TYPE (yylval.ttype) = type;
3866 value = CONSTANT; break;
3872 register int result = 0;
3873 register int num_chars = 0;
3874 unsigned width = TYPE_PRECISION (char_type_node);
3879 width = WCHAR_TYPE_SIZE;
3880 #ifdef MULTIBYTE_CHARS
3881 max_chars = MB_CUR_MAX;
3887 max_chars = TYPE_PRECISION (integer_type_node) / width;
3895 if (c == '\'' || c == EOF)
3901 c = readescape (&ignore);
3904 if (width < HOST_BITS_PER_INT
3905 && (unsigned) c >= (1 << width))
3906 warning ("escape sequence out of range for character");
3907 #ifdef MAP_CHARACTER
3909 c = MAP_CHARACTER (c);
3915 pedwarn ("ANSI C++ forbids newline in character constant");
3918 #ifdef MAP_CHARACTER
3920 c = MAP_CHARACTER (c);
3924 if (num_chars > maxtoken - 4)
3925 extend_token_buffer (token_buffer);
3927 token_buffer[num_chars] = c;
3929 /* Merge character into result; ignore excess chars. */
3930 if (num_chars < max_chars + 1)
3932 if (width < HOST_BITS_PER_INT)
3933 result = (result << width) | (c & ((1 << width) - 1));
3939 token_buffer[num_chars + 1] = '\'';
3940 token_buffer[num_chars + 2] = 0;
3943 error ("malformatted character constant");
3944 else if (num_chars == 0)
3945 error ("empty character constant");
3946 else if (num_chars > max_chars)
3948 num_chars = max_chars;
3949 error ("character constant too long");
3951 else if (num_chars != 1 && ! flag_traditional)
3952 warning ("multi-character character constant");
3954 /* If char type is signed, sign-extend the constant. */
3957 int num_bits = num_chars * width;
3959 /* We already got an error; avoid invalid shift. */
3960 yylval.ttype = build_int_2 (0, 0);
3961 else if (TREE_UNSIGNED (char_type_node)
3962 || ((result >> (num_bits - 1)) & 1) == 0)
3964 = build_int_2 (result & ((unsigned HOST_WIDE_INT) ~0
3965 >> (HOST_BITS_PER_WIDE_INT - num_bits)),
3969 = build_int_2 (result | ~((unsigned HOST_WIDE_INT) ~0
3970 >> (HOST_BITS_PER_WIDE_INT - num_bits)),
3973 TREE_TYPE (yylval.ttype) = char_type_node;
3975 TREE_TYPE (yylval.ttype) = integer_type_node;
3979 #ifdef MULTIBYTE_CHARS
3980 /* Set the initial shift state and convert the next sequence. */
3982 /* In all locales L'\0' is zero and mbtowc will return zero,
3985 || (num_chars == 1 && token_buffer[1] != '\0'))
3988 (void) mbtowc (NULL, NULL, 0);
3989 if (mbtowc (& wc, token_buffer + 1, num_chars) == num_chars)
3992 warning ("Ignoring invalid multibyte character");
3995 yylval.ttype = build_int_2 (result, 0);
3996 TREE_TYPE (yylval.ttype) = wchar_type_node;
4009 p = token_buffer + 1;
4011 while (c != '"' && c >= 0)
4013 /* ignore_escape_flag is set for reading the filename in #line. */
4014 if (!ignore_escape_flag && c == '\\')
4017 c = readescape (&ignore);
4021 && TYPE_PRECISION (char_type_node) < HOST_BITS_PER_INT
4022 && c >= ((unsigned) 1 << TYPE_PRECISION (char_type_node)))
4023 warning ("escape sequence out of range for character");
4028 pedwarn ("ANSI C++ forbids newline in string constant");
4032 if (p == token_buffer + maxtoken)
4033 p = extend_token_buffer (p);
4039 error("Unterminated string");
4045 /* We have read the entire constant.
4046 Construct a STRING_CST for the result. */
4050 /* If this is a L"..." wide-string, convert the multibyte string
4051 to a wide character string. */
4052 char *widep = (char *) alloca ((p - token_buffer) * WCHAR_BYTES);
4055 #ifdef MULTIBYTE_CHARS
4056 len = mbstowcs ((wchar_t *) widep, token_buffer + 1, p - token_buffer);
4057 if (len < 0 || len >= (p - token_buffer))
4059 warning ("Ignoring invalid multibyte string");
4062 bzero (widep + (len * WCHAR_BYTES), WCHAR_BYTES);
4065 union { long l; char c[sizeof (long)]; } u;
4069 /* Determine whether host is little or big endian. */
4071 big_endian = u.c[sizeof (long) - 1];
4072 wp = widep + (big_endian ? WCHAR_BYTES - 1 : 0);
4074 bzero (widep, (p - token_buffer) * WCHAR_BYTES);
4075 for (cp = token_buffer + 1; cp < p; cp++)
4076 *wp = *cp, wp += WCHAR_BYTES;
4077 len = p - token_buffer - 1;
4080 yylval.ttype = build_string ((len + 1) * WCHAR_BYTES, widep);
4081 TREE_TYPE (yylval.ttype) = wchar_array_type_node;
4085 yylval.ttype = build_string (p - token_buffer, token_buffer + 1);
4086 TREE_TYPE (yylval.ttype) = char_array_type_node;
4092 value = STRING; break;
4115 yylval.code = PLUS_EXPR; break;
4117 yylval.code = MINUS_EXPR; break;
4119 yylval.code = BIT_AND_EXPR; break;
4121 yylval.code = BIT_IOR_EXPR; break;
4123 yylval.code = MULT_EXPR; break;
4125 yylval.code = TRUNC_DIV_EXPR; break;
4127 yylval.code = TRUNC_MOD_EXPR; break;
4129 yylval.code = BIT_XOR_EXPR; break;
4131 yylval.code = LSHIFT_EXPR; break;
4133 yylval.code = RSHIFT_EXPR; break;
4135 yylval.code = LT_EXPR; break;
4137 yylval.code = GT_EXPR; break;
4140 token_buffer[1] = c1 = getch ();
4141 token_buffer[2] = 0;
4148 value = ARITHCOMPARE; yylval.code = LE_EXPR; goto done;
4150 value = ARITHCOMPARE; yylval.code = GE_EXPR; goto done;
4152 value = EQCOMPARE; yylval.code = NE_EXPR; goto done;
4154 value = EQCOMPARE; yylval.code = EQ_EXPR; goto done;
4156 value = ASSIGN; goto done;
4162 value = PLUSPLUS; goto done;
4164 value = MINUSMINUS; goto done;
4166 value = ANDAND; goto done;
4168 value = OROR; goto done;
4176 else if ((c == '-') && (c1 == '>'))
4178 nextchar = getch ();
4179 if (nextchar == '*')
4182 value = POINTSAT_STAR;
4188 else if (c1 == '?' && (c == '<' || c == '>'))
4190 token_buffer[3] = 0;
4193 yylval.code = (c == '<' ? MIN_EXPR : MAX_EXPR);
4196 /* <?= or >?= expression. */
4197 token_buffer[2] = c1;
4206 pedwarn ("use of `operator %s' is not standard C++",
4211 else if (c == '<' && c1 == '%')
4212 { value = '{'; goto done; }
4213 else if (c == '<' && c1 == ':')
4214 { value = '['; goto done; }
4215 else if (c == '%' && c1 == '>')
4216 { value = '}'; goto done; }
4217 else if (c == '%' && c1 == ':')
4218 { value = '#'; goto done; }
4221 token_buffer[1] = 0;
4231 token_buffer[1] = ':';
4232 token_buffer[2] = '\0';
4249 /* Don't make yyparse think this is eof. */
4254 /* try, weakly, to handle casts to pointers to functions. */
4255 nextchar = skip_white_space (getch ());
4256 if (nextchar == '*')
4258 int next_c = skip_white_space (getch ());
4262 yylval.ttype = build1 (INDIRECT_REF, 0, 0);
4263 value = PAREN_STAR_PAREN;
4271 else if (nextchar == ')')
4274 yylval.ttype = NULL_TREE;
4285 /* yylloc.last_line = lineno; */
4286 #ifdef GATHER_STATISTICS
4287 token_count[value] += 1;
4295 d_kind, t_kind, s_kind, r_kind, e_kind, c_kind,
4296 id_kind, op_id_kind, perm_list_kind, temp_list_kind,
4297 vec_kind, x_kind, lang_decl, lang_type, all_kinds
4299 extern int tree_node_counts[];
4300 extern int tree_node_sizes[];
4301 extern char *tree_node_kind_names[];
4303 /* Place to save freed lang_decls which were allocated on the
4304 permanent_obstack. @@ Not currently used. */
4305 tree free_lang_decl_chain;
4308 build_lang_decl (code, name, type)
4309 enum tree_code code;
4313 register tree t = build_decl (code, name, type);
4314 struct obstack *obstack = current_obstack;
4315 register int i = sizeof (struct lang_decl) / sizeof (int);
4318 if (! TREE_PERMANENT (t))
4319 obstack = saveable_obstack;
4321 /* Could be that saveable is permanent and current is not. */
4322 obstack = &permanent_obstack;
4324 if (free_lang_decl_chain && obstack == &permanent_obstack)
4326 pi = (int *)free_lang_decl_chain;
4327 free_lang_decl_chain = TREE_CHAIN (free_lang_decl_chain);
4330 pi = (int *) obstack_alloc (obstack, sizeof (struct lang_decl));
4335 DECL_LANG_SPECIFIC (t) = (struct lang_decl *) pi;
4336 LANG_DECL_PERMANENT ((struct lang_decl *) pi)
4337 = obstack == &permanent_obstack;
4338 my_friendly_assert (LANG_DECL_PERMANENT ((struct lang_decl *) pi)
4339 == TREE_PERMANENT (t), 234);
4340 DECL_MAIN_VARIANT (t) = t;
4341 if (current_lang_name == lang_name_cplusplus)
4343 DECL_LANGUAGE (t) = lang_cplusplus;
4345 #ifndef NO_AUTO_OVERLOAD
4346 if (code == FUNCTION_DECL && name != 0
4347 && ! (IDENTIFIER_LENGTH (name) == 4
4348 && IDENTIFIER_POINTER (name)[0] == 'm'
4349 && strcmp (IDENTIFIER_POINTER (name), "main") == 0)
4350 && ! (IDENTIFIER_LENGTH (name) > 10
4351 && IDENTIFIER_POINTER (name)[0] == '_'
4352 && IDENTIFIER_POINTER (name)[1] == '_'
4353 && strncmp (IDENTIFIER_POINTER (name)+2, "builtin_", 8) == 0))
4354 TREE_OVERLOADED (name) = 1;
4358 else if (current_lang_name == lang_name_c)
4359 DECL_LANGUAGE (t) = lang_c;
4360 else my_friendly_abort (64);
4362 #if 0 /* not yet, should get fixed properly later */
4363 if (code == TYPE_DECL)
4366 id = get_identifier (build_overload_name (type, 1, 1));
4367 DECL_ASSEMBLER_NAME (t) = id;
4371 #ifdef GATHER_STATISTICS
4372 tree_node_counts[(int)lang_decl] += 1;
4373 tree_node_sizes[(int)lang_decl] += sizeof(struct lang_decl);
4380 build_lang_field_decl (code, name, type)
4381 enum tree_code code;
4385 extern struct obstack *current_obstack, *saveable_obstack;
4386 register tree t = build_decl (code, name, type);
4387 struct obstack *obstack = current_obstack;
4388 register int i = sizeof (struct lang_decl_flags) / sizeof (int);
4390 #if 0 /* not yet, should get fixed properly later */
4392 if (code == TYPE_DECL)
4395 id = get_identifier (build_overload_name (type, 1, 1));
4396 DECL_ASSEMBLER_NAME (t) = id;
4400 if (! TREE_PERMANENT (t))
4401 obstack = saveable_obstack;
4403 my_friendly_assert (obstack == &permanent_obstack, 235);
4405 pi = (int *) obstack_alloc (obstack, sizeof (struct lang_decl_flags));
4409 DECL_LANG_SPECIFIC (t) = (struct lang_decl *) pi;
4414 copy_lang_decl (node)
4420 if (TREE_CODE (node) == FIELD_DECL)
4421 size = sizeof (struct lang_decl_flags);
4423 size = sizeof (struct lang_decl);
4424 pi = (int *)obstack_alloc (&permanent_obstack, size);
4425 bcopy ((char *)DECL_LANG_SPECIFIC (node), (char *)pi, size);
4426 DECL_LANG_SPECIFIC (node) = (struct lang_decl *)pi;
4430 make_lang_type (code)
4431 enum tree_code code;
4433 extern struct obstack *current_obstack, *saveable_obstack;
4434 register tree t = make_node (code);
4435 struct obstack *obstack = current_obstack;
4436 register int i = sizeof (struct lang_type) / sizeof (int);
4439 /* Set up some flags that give proper default behavior. */
4440 IS_AGGR_TYPE (t) = 1;
4442 if (! TREE_PERMANENT (t))
4443 obstack = saveable_obstack;
4445 my_friendly_assert (obstack == &permanent_obstack, 236);
4447 pi = (int *) obstack_alloc (obstack, sizeof (struct lang_type));
4451 TYPE_LANG_SPECIFIC (t) = (struct lang_type *) pi;
4452 CLASSTYPE_AS_LIST (t) = build_tree_list (NULL_TREE, t);
4453 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, interface_unknown);
4454 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
4455 CLASSTYPE_VBASE_SIZE (t) = integer_zero_node;
4456 TYPE_BINFO (t) = make_binfo (integer_zero_node, t, NULL_TREE, NULL_TREE,
4458 CLASSTYPE_BINFO_AS_LIST (t) = build_tree_list (NULL_TREE, TYPE_BINFO (t));
4460 /* Make sure this is laid out, for ease of use later.
4461 In the presence of parse errors, the normal was of assuring
4462 this might not ever get executed, so we lay it out *immediately*. */
4463 build_pointer_type (t);
4465 #ifdef GATHER_STATISTICS
4466 tree_node_counts[(int)lang_type] += 1;
4467 tree_node_sizes[(int)lang_type] += sizeof(struct lang_type);
4474 copy_decl_lang_specific (decl)
4477 extern struct obstack *current_obstack, *saveable_obstack;
4478 register int *old = (int *)DECL_LANG_SPECIFIC (decl);
4479 struct obstack *obstack = current_obstack;
4480 register int i = sizeof (struct lang_decl) / sizeof (int);
4483 if (! TREE_PERMANENT (decl))
4484 obstack = saveable_obstack;
4486 my_friendly_assert (obstack == &permanent_obstack, 237);
4488 pi = (int *) obstack_alloc (obstack, sizeof (struct lang_decl));
4492 DECL_LANG_SPECIFIC (decl) = (struct lang_decl *) pi;
4494 #ifdef GATHER_STATISTICS
4495 tree_node_counts[(int)lang_decl] += 1;
4496 tree_node_sizes[(int)lang_decl] += sizeof(struct lang_decl);
4501 dump_time_statistics ()
4503 register tree prev = 0, decl, next;
4504 int this_time = my_get_run_time ();
4505 TREE_INT_CST_LOW (IDENTIFIER_LOCAL_VALUE (this_filename_time))
4506 += this_time - body_time;
4508 fprintf (stderr, "\n******\n");
4509 print_time ("header files (total)", header_time);
4510 print_time ("main file (total)", this_time - body_time);
4511 fprintf (stderr, "ratio = %g : 1\n",
4512 (double)header_time / (double)(this_time - body_time));
4513 fprintf (stderr, "\n******\n");
4515 for (decl = filename_times; decl; decl = next)
4517 next = IDENTIFIER_GLOBAL_VALUE (decl);
4518 IDENTIFIER_GLOBAL_VALUE (decl) = prev;
4522 for (decl = prev; decl; decl = IDENTIFIER_GLOBAL_VALUE (decl))
4523 print_time (IDENTIFIER_POINTER (decl),
4524 TREE_INT_CST_LOW (IDENTIFIER_LOCAL_VALUE (decl)));
4528 compiler_error (s, v, v2)
4530 HOST_WIDE_INT v, v2; /* @@also used as pointer */
4533 sprintf (buf, s, v, v2);
4534 error_with_file_and_line (input_filename, lineno, "%s (compiler error)", buf);
4538 compiler_error_with_decl (decl, s)
4545 report_error_function (0);
4547 if (TREE_CODE (decl) == PARM_DECL)
4548 fprintf (stderr, "%s:%d: ",
4549 DECL_SOURCE_FILE (DECL_CONTEXT (decl)),
4550 DECL_SOURCE_LINE (DECL_CONTEXT (decl)));
4552 fprintf (stderr, "%s:%d: ",
4553 DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
4555 name = lang_printable_name (decl);
4557 fprintf (stderr, s, name);
4559 fprintf (stderr, s, "((anonymous))");
4560 fprintf (stderr, " (compiler error)\n");
4567 extern int end_of_file;
4570 strcpy (buf, string);
4572 /* We can't print string and character constants well
4573 because the token_buffer contains the result of processing escapes. */
4575 strcat (buf, input_redirected ()
4576 ? " at end of saved text"
4577 : " at end of input");
4578 else if (token_buffer[0] == 0)
4579 strcat (buf, " at null character");
4580 else if (token_buffer[0] == '"')
4581 strcat (buf, " before string constant");
4582 else if (token_buffer[0] == '\'')
4583 strcat (buf, " before character constant");
4584 else if (token_buffer[0] < 040 || (unsigned char) token_buffer[0] >= 0177)
4585 sprintf (buf + strlen (buf), " before character 0%o",
4586 (unsigned char) token_buffer[0]);
4588 strcat (buf, " before `%s'");
4590 error (buf, token_buffer);
4593 #ifdef HANDLE_SYSV_PRAGMA
4595 /* Handle a #pragma directive. INPUT is the current input stream,
4596 and C is a character to reread. Processes the entire input line
4597 and returns a character for the caller to reread: either \n or EOF. */
4599 /* This function has to be in this file, in order to get at
4602 handle_sysv_pragma ()
4612 handle_pragma_token ("ignored", yylval.ttype);
4615 handle_pragma_token ("(", NULL_TREE);
4618 handle_pragma_token (")", NULL_TREE);
4621 handle_pragma_token ("=", NULL_TREE);
4624 handle_pragma_token ("(", NULL_TREE);
4625 handle_pragma_token (")", NULL_TREE);
4628 handle_pragma_token (NULL_PTR, NULL_TREE);
4635 #endif /* HANDLE_SYSV_PRAGMA */