| /* Separate lexical analyzer for GNU C++. |
| Copyright (C) 1987, 89, 92, 93, 94, 95, 1996 Free Software Foundation, Inc. |
| Hacked by Michael Tiemann (tiemann@cygnus.com) |
| |
| This file is part of GNU CC. |
| |
| GNU CC is free software; you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation; either version 2, or (at your option) |
| any later version. |
| |
| GNU CC is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with GNU CC; see the file COPYING. If not, write to |
| the Free Software Foundation, 59 Temple Place - Suite 330, |
| Boston, MA 02111-1307, USA. */ |
| |
| |
| /* This file is the lexical analyzer for GNU C++. */ |
| |
| /* Cause the `yydebug' variable to be defined. */ |
| #define YYDEBUG 1 |
| |
| #include <sys/types.h> |
| #include <stdio.h> |
| #include <errno.h> |
| #include <setjmp.h> |
| #include "config.h" |
| #include "input.h" |
| #include "tree.h" |
| #include "lex.h" |
| #include "cp-tree.h" |
| #include "parse.h" |
| #include "flags.h" |
| #include "obstack.h" |
| #include "c-pragma.h" |
| |
| #ifdef MULTIBYTE_CHARS |
| #include <stdlib.h> |
| #include <locale.h> |
| #endif |
| |
| #ifndef errno |
| extern int errno; /* needed for VAX. */ |
| #endif |
| |
| #define obstack_chunk_alloc xmalloc |
| #define obstack_chunk_free free |
| |
| extern struct obstack permanent_obstack; |
| extern struct obstack *current_obstack, *saveable_obstack; |
| |
| extern double atof (); |
| |
| extern char *get_directive_line (); /* In c-common.c */ |
| |
| /* Given a file name X, return the nondirectory portion. |
| Keep in mind that X can be computed more than once. */ |
| #ifndef FILE_NAME_NONDIRECTORY |
| #define FILE_NAME_NONDIRECTORY(X) \ |
| (rindex (X, '/') != 0 ? rindex (X, '/') + 1 : X) |
| #endif |
| |
| extern char *index (); |
| extern char *rindex (); |
| void yyerror (); |
| |
| /* This obstack is needed to hold text. It is not safe to use |
| TOKEN_BUFFER because `check_newline' calls `yylex'. */ |
| struct obstack inline_text_obstack; |
| char *inline_text_firstobj; |
| |
| int end_of_file; |
| |
| /* Pending language change. |
| Positive is push count, negative is pop count. */ |
| int pending_lang_change = 0; |
| |
| /* Wrap the current header file in extern "C". */ |
| static int c_header_level = 0; |
| |
| extern int first_token; |
| extern struct obstack token_obstack; |
| |
| /* ??? Don't really know where this goes yet. */ |
| #if 1 |
| #include "input.c" |
| #else |
| extern void put_back (/* int */); |
| extern int input_redirected (); |
| extern void feed_input (/* char *, int */); |
| #endif |
| |
| /* Holds translations from TREE_CODEs to operator name strings, |
| i.e., opname_tab[PLUS_EXPR] == "+". */ |
| char **opname_tab; |
| char **assignop_tab; |
| |
| extern int yychar; /* the lookahead symbol */ |
| extern YYSTYPE yylval; /* the semantic value of the */ |
| /* lookahead symbol */ |
| |
| #if 0 |
| YYLTYPE yylloc; /* location data for the lookahead */ |
| /* symbol */ |
| #endif |
| |
| |
| /* the declaration found for the last IDENTIFIER token read in. |
| yylex must look this up to detect typedefs, which get token type TYPENAME, |
| so it is left around in case the identifier is not a typedef but is |
| used in a context which makes it a reference to a variable. */ |
| tree lastiddecl; |
| |
| /* The elements of `ridpointers' are identifier nodes |
| for the reserved type names and storage classes. |
| It is indexed by a RID_... value. */ |
| tree ridpointers[(int) RID_MAX]; |
| |
| /* We may keep statistics about how long which files took to compile. */ |
| static int header_time, body_time; |
| static tree get_time_identifier (); |
| static tree filename_times; |
| static tree this_filename_time; |
| |
| /* Array for holding counts of the numbers of tokens seen. */ |
| extern int *token_count; |
| |
| /* Return something to represent absolute declarators containing a *. |
| TARGET is the absolute declarator that the * contains. |
| CV_QUALIFIERS is a list of modifiers such as const or volatile |
| to apply to the pointer type, represented as identifiers. |
| |
| We return an INDIRECT_REF whose "contents" are TARGET |
| and whose type is the modifier list. */ |
| |
| tree |
| make_pointer_declarator (cv_qualifiers, target) |
| tree cv_qualifiers, target; |
| { |
| if (target && TREE_CODE (target) == IDENTIFIER_NODE |
| && ANON_AGGRNAME_P (target)) |
| error ("type name expected before `*'"); |
| target = build_parse_node (INDIRECT_REF, target); |
| TREE_TYPE (target) = cv_qualifiers; |
| return target; |
| } |
| |
| /* Return something to represent absolute declarators containing a &. |
| TARGET is the absolute declarator that the & contains. |
| CV_QUALIFIERS is a list of modifiers such as const or volatile |
| to apply to the reference type, represented as identifiers. |
| |
| We return an ADDR_EXPR whose "contents" are TARGET |
| and whose type is the modifier list. */ |
| |
| tree |
| make_reference_declarator (cv_qualifiers, target) |
| tree cv_qualifiers, target; |
| { |
| if (target) |
| { |
| if (TREE_CODE (target) == ADDR_EXPR) |
| { |
| error ("cannot declare references to references"); |
| return target; |
| } |
| if (TREE_CODE (target) == INDIRECT_REF) |
| { |
| error ("cannot declare pointers to references"); |
| return target; |
| } |
| if (TREE_CODE (target) == IDENTIFIER_NODE && ANON_AGGRNAME_P (target)) |
| error ("type name expected before `&'"); |
| } |
| target = build_parse_node (ADDR_EXPR, target); |
| TREE_TYPE (target) = cv_qualifiers; |
| return target; |
| } |
| |
| tree |
| make_call_declarator (target, parms, cv_qualifiers, exception_specification) |
| tree target, parms, cv_qualifiers, exception_specification; |
| { |
| target = build_parse_node (CALL_EXPR, target, parms, cv_qualifiers); |
| TREE_TYPE (target) = exception_specification; |
| return target; |
| } |
| |
| void |
| set_quals_and_spec (call_declarator, cv_qualifiers, exception_specification) |
| tree call_declarator, cv_qualifiers, exception_specification; |
| { |
| TREE_OPERAND (call_declarator, 2) = cv_qualifiers; |
| TREE_TYPE (call_declarator) = exception_specification; |
| } |
| |
| /* Build names and nodes for overloaded operators. */ |
| |
| tree ansi_opname[LAST_CPLUS_TREE_CODE]; |
| tree ansi_assopname[LAST_CPLUS_TREE_CODE]; |
| |
| char * |
| operator_name_string (name) |
| tree name; |
| { |
| char *opname = IDENTIFIER_POINTER (name) + 2; |
| tree *opname_table; |
| int i, assign; |
| |
| /* Works for builtin and user defined types. */ |
| if (IDENTIFIER_GLOBAL_VALUE (name) |
| && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (name)) == TYPE_DECL) |
| return IDENTIFIER_POINTER (name); |
| |
| if (opname[0] == 'a' && opname[2] != '\0' && opname[2] != '_') |
| { |
| opname += 1; |
| assign = 1; |
| opname_table = ansi_assopname; |
| } |
| else |
| { |
| assign = 0; |
| opname_table = ansi_opname; |
| } |
| |
| for (i = 0; i < (int) LAST_CPLUS_TREE_CODE; i++) |
| { |
| if (opname[0] == IDENTIFIER_POINTER (opname_table[i])[2+assign] |
| && opname[1] == IDENTIFIER_POINTER (opname_table[i])[3+assign]) |
| break; |
| } |
| |
| if (i == LAST_CPLUS_TREE_CODE) |
| return "<invalid operator>"; |
| |
| if (assign) |
| return assignop_tab[i]; |
| else |
| return opname_tab[i]; |
| } |
| |
| int interface_only; /* whether or not current file is only for |
| interface definitions. */ |
| int interface_unknown; /* whether or not we know this class |
| to behave according to #pragma interface. */ |
| |
| /* lexical analyzer */ |
| |
| /* File used for outputting assembler code. */ |
| extern FILE *asm_out_file; |
| |
| #ifndef WCHAR_TYPE_SIZE |
| #ifdef INT_TYPE_SIZE |
| #define WCHAR_TYPE_SIZE INT_TYPE_SIZE |
| #else |
| #define WCHAR_TYPE_SIZE BITS_PER_WORD |
| #endif |
| #endif |
| |
| /* Number of bytes in a wide character. */ |
| #define WCHAR_BYTES (WCHAR_TYPE_SIZE / BITS_PER_UNIT) |
| |
| static int maxtoken; /* Current nominal length of token buffer. */ |
| char *token_buffer; /* Pointer to token buffer. |
| Actual allocated length is maxtoken + 2. */ |
| |
| #include "hash.h" |
| |
| static int check_newline (); |
| |
| /* Nonzero tells yylex to ignore \ in string constants. */ |
| static int ignore_escape_flag = 0; |
| |
| static int skip_white_space (); |
| |
| static tree |
| get_time_identifier (name) |
| char *name; |
| { |
| tree time_identifier; |
| int len = strlen (name); |
| char *buf = (char *) alloca (len + 6); |
| strcpy (buf, "file "); |
| bcopy (name, buf+5, len); |
| buf[len+5] = '\0'; |
| time_identifier = get_identifier (buf); |
| if (IDENTIFIER_LOCAL_VALUE (time_identifier) == NULL_TREE) |
| { |
| push_obstacks_nochange (); |
| end_temporary_allocation (); |
| IDENTIFIER_LOCAL_VALUE (time_identifier) = build_int_2 (0, 0); |
| IDENTIFIER_CLASS_VALUE (time_identifier) = build_int_2 (0, 1); |
| IDENTIFIER_GLOBAL_VALUE (time_identifier) = filename_times; |
| filename_times = time_identifier; |
| pop_obstacks (); |
| } |
| return time_identifier; |
| } |
| |
| #ifdef __GNUC__ |
| __inline |
| #endif |
| static int |
| my_get_run_time () |
| { |
| int old_quiet_flag = quiet_flag; |
| int this_time; |
| quiet_flag = 0; |
| this_time = get_run_time (); |
| quiet_flag = old_quiet_flag; |
| return this_time; |
| } |
| |
| /* Table indexed by tree code giving a string containing a character |
| classifying the tree code. Possibilities are |
| t, d, s, c, r, <, 1 and 2. See cp/cp-tree.def for details. */ |
| |
| #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE, |
| |
| char *cplus_tree_code_type[] = { |
| "x", |
| #include "cp-tree.def" |
| }; |
| #undef DEFTREECODE |
| |
| /* Table indexed by tree code giving number of expression |
| operands beyond the fixed part of the node structure. |
| Not used for types or decls. */ |
| |
| #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH, |
| |
| int cplus_tree_code_length[] = { |
| 0, |
| #include "cp-tree.def" |
| }; |
| #undef DEFTREECODE |
| |
| /* Names of tree components. |
| Used for printing out the tree and error messages. */ |
| #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME, |
| |
| char *cplus_tree_code_name[] = { |
| "@@dummy", |
| #include "cp-tree.def" |
| }; |
| #undef DEFTREECODE |
| |
| /* toplev.c needs to call these. */ |
| |
| void |
| lang_init () |
| { |
| /* the beginning of the file is a new line; check for # */ |
| /* With luck, we discover the real source file's name from that |
| and put it in input_filename. */ |
| put_back (check_newline ()); |
| if (flag_gnu_xref) GNU_xref_begin (input_filename); |
| init_repo (input_filename); |
| } |
| |
| void |
| lang_finish () |
| { |
| extern int errorcount, sorrycount; |
| if (flag_gnu_xref) GNU_xref_end (errorcount+sorrycount); |
| } |
| |
| char * |
| lang_identify () |
| { |
| return "cplusplus"; |
| } |
| |
| void |
| init_filename_times () |
| { |
| this_filename_time = get_time_identifier ("<top level>"); |
| if (flag_detailed_statistics) |
| { |
| header_time = 0; |
| body_time = my_get_run_time (); |
| TREE_INT_CST_LOW (IDENTIFIER_LOCAL_VALUE (this_filename_time)) = body_time; |
| } |
| } |
| |
| /* Change by Bryan Boreham, Kewill, Thu Jul 27 09:46:05 1989. |
| Stuck this hack in to get the files open correctly; this is called |
| in place of init_lex if we are an unexec'd binary. */ |
| |
| #if 0 |
| void |
| reinit_lang_specific () |
| { |
| init_filename_times (); |
| reinit_search_statistics (); |
| } |
| #endif |
| |
| int *init_parse (); |
| |
| void |
| init_lex () |
| { |
| extern char *(*decl_printable_name) (); |
| extern int flag_no_gnu_keywords; |
| extern int flag_operator_names; |
| |
| int i; |
| |
| /* Initialize the lookahead machinery. */ |
| init_spew (); |
| |
| /* Make identifier nodes long enough for the language-specific slots. */ |
| set_identifier_size (sizeof (struct lang_identifier)); |
| decl_printable_name = lang_printable_name; |
| |
| init_cplus_expand (); |
| |
| tree_code_type |
| = (char **) realloc (tree_code_type, |
| sizeof (char *) * LAST_CPLUS_TREE_CODE); |
| tree_code_length |
| = (int *) realloc (tree_code_length, |
| sizeof (int) * LAST_CPLUS_TREE_CODE); |
| tree_code_name |
| = (char **) realloc (tree_code_name, |
| sizeof (char *) * LAST_CPLUS_TREE_CODE); |
| bcopy ((char *)cplus_tree_code_type, |
| (char *)(tree_code_type + (int) LAST_AND_UNUSED_TREE_CODE), |
| (LAST_CPLUS_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (char *)); |
| bcopy ((char *)cplus_tree_code_length, |
| (char *)(tree_code_length + (int) LAST_AND_UNUSED_TREE_CODE), |
| (LAST_CPLUS_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (int)); |
| bcopy ((char *)cplus_tree_code_name, |
| (char *)(tree_code_name + (int) LAST_AND_UNUSED_TREE_CODE), |
| (LAST_CPLUS_TREE_CODE - (int)LAST_AND_UNUSED_TREE_CODE) * sizeof (char *)); |
| |
| opname_tab = (char **)oballoc ((int)LAST_CPLUS_TREE_CODE * sizeof (char *)); |
| bzero ((char *)opname_tab, (int)LAST_CPLUS_TREE_CODE * sizeof (char *)); |
| assignop_tab = (char **)oballoc ((int)LAST_CPLUS_TREE_CODE * sizeof (char *)); |
| bzero ((char *)assignop_tab, (int)LAST_CPLUS_TREE_CODE * sizeof (char *)); |
| |
| ansi_opname[0] = get_identifier ("<invalid operator>"); |
| for (i = 0; i < (int) LAST_CPLUS_TREE_CODE; i++) |
| { |
| ansi_opname[i] = ansi_opname[0]; |
| ansi_assopname[i] = ansi_opname[0]; |
| } |
| |
| ansi_opname[(int) MULT_EXPR] = get_identifier ("__ml"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) MULT_EXPR]) = 1; |
| ansi_opname[(int) INDIRECT_REF] = ansi_opname[(int) MULT_EXPR]; |
| ansi_assopname[(int) MULT_EXPR] = get_identifier ("__aml"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) MULT_EXPR]) = 1; |
| ansi_assopname[(int) INDIRECT_REF] = ansi_assopname[(int) MULT_EXPR]; |
| ansi_opname[(int) TRUNC_MOD_EXPR] = get_identifier ("__md"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUNC_MOD_EXPR]) = 1; |
| ansi_assopname[(int) TRUNC_MOD_EXPR] = get_identifier ("__amd"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) TRUNC_MOD_EXPR]) = 1; |
| ansi_opname[(int) CEIL_MOD_EXPR] = ansi_opname[(int) TRUNC_MOD_EXPR]; |
| ansi_opname[(int) FLOOR_MOD_EXPR] = ansi_opname[(int) TRUNC_MOD_EXPR]; |
| ansi_opname[(int) ROUND_MOD_EXPR] = ansi_opname[(int) TRUNC_MOD_EXPR]; |
| ansi_opname[(int) MINUS_EXPR] = get_identifier ("__mi"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) MINUS_EXPR]) = 1; |
| ansi_opname[(int) NEGATE_EXPR] = ansi_opname[(int) MINUS_EXPR]; |
| ansi_assopname[(int) MINUS_EXPR] = get_identifier ("__ami"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) MINUS_EXPR]) = 1; |
| ansi_assopname[(int) NEGATE_EXPR] = ansi_assopname[(int) MINUS_EXPR]; |
| ansi_opname[(int) RSHIFT_EXPR] = get_identifier ("__rs"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) RSHIFT_EXPR]) = 1; |
| ansi_assopname[(int) RSHIFT_EXPR] = get_identifier ("__ars"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) RSHIFT_EXPR]) = 1; |
| ansi_opname[(int) NE_EXPR] = get_identifier ("__ne"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) NE_EXPR]) = 1; |
| ansi_opname[(int) GT_EXPR] = get_identifier ("__gt"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) GT_EXPR]) = 1; |
| ansi_opname[(int) GE_EXPR] = get_identifier ("__ge"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) GE_EXPR]) = 1; |
| ansi_opname[(int) BIT_IOR_EXPR] = get_identifier ("__or"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_IOR_EXPR]) = 1; |
| ansi_assopname[(int) BIT_IOR_EXPR] = get_identifier ("__aor"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) BIT_IOR_EXPR]) = 1; |
| ansi_opname[(int) TRUTH_ANDIF_EXPR] = get_identifier ("__aa"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUTH_ANDIF_EXPR]) = 1; |
| ansi_opname[(int) TRUTH_NOT_EXPR] = get_identifier ("__nt"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUTH_NOT_EXPR]) = 1; |
| ansi_opname[(int) PREINCREMENT_EXPR] = get_identifier ("__pp"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) PREINCREMENT_EXPR]) = 1; |
| ansi_opname[(int) POSTINCREMENT_EXPR] = ansi_opname[(int) PREINCREMENT_EXPR]; |
| ansi_opname[(int) MODIFY_EXPR] = get_identifier ("__as"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) MODIFY_EXPR]) = 1; |
| ansi_assopname[(int) NOP_EXPR] = ansi_opname[(int) MODIFY_EXPR]; |
| ansi_opname[(int) COMPOUND_EXPR] = get_identifier ("__cm"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) COMPOUND_EXPR]) = 1; |
| ansi_opname[(int) EXACT_DIV_EXPR] = get_identifier ("__dv"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) EXACT_DIV_EXPR]) = 1; |
| ansi_assopname[(int) EXACT_DIV_EXPR] = get_identifier ("__adv"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) EXACT_DIV_EXPR]) = 1; |
| ansi_opname[(int) TRUNC_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR]; |
| ansi_opname[(int) CEIL_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR]; |
| ansi_opname[(int) FLOOR_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR]; |
| ansi_opname[(int) ROUND_DIV_EXPR] = ansi_opname[(int) EXACT_DIV_EXPR]; |
| ansi_opname[(int) PLUS_EXPR] = get_identifier ("__pl"); |
| ansi_assopname[(int) TRUNC_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR]; |
| ansi_assopname[(int) CEIL_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR]; |
| ansi_assopname[(int) FLOOR_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR]; |
| ansi_assopname[(int) ROUND_DIV_EXPR] = ansi_assopname[(int) EXACT_DIV_EXPR]; |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) PLUS_EXPR]) = 1; |
| ansi_assopname[(int) PLUS_EXPR] = get_identifier ("__apl"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) PLUS_EXPR]) = 1; |
| ansi_opname[(int) CONVERT_EXPR] = ansi_opname[(int) PLUS_EXPR]; |
| ansi_assopname[(int) CONVERT_EXPR] = ansi_assopname[(int) PLUS_EXPR]; |
| ansi_opname[(int) LSHIFT_EXPR] = get_identifier ("__ls"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) LSHIFT_EXPR]) = 1; |
| ansi_assopname[(int) LSHIFT_EXPR] = get_identifier ("__als"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) LSHIFT_EXPR]) = 1; |
| ansi_opname[(int) EQ_EXPR] = get_identifier ("__eq"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) EQ_EXPR]) = 1; |
| ansi_opname[(int) LT_EXPR] = get_identifier ("__lt"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) LT_EXPR]) = 1; |
| ansi_opname[(int) LE_EXPR] = get_identifier ("__le"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) LE_EXPR]) = 1; |
| ansi_opname[(int) BIT_AND_EXPR] = get_identifier ("__ad"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_AND_EXPR]) = 1; |
| ansi_assopname[(int) BIT_AND_EXPR] = get_identifier ("__aad"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) BIT_AND_EXPR]) = 1; |
| ansi_opname[(int) ADDR_EXPR] = ansi_opname[(int) BIT_AND_EXPR]; |
| ansi_assopname[(int) ADDR_EXPR] = ansi_assopname[(int) BIT_AND_EXPR]; |
| ansi_opname[(int) BIT_XOR_EXPR] = get_identifier ("__er"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_XOR_EXPR]) = 1; |
| ansi_assopname[(int) BIT_XOR_EXPR] = get_identifier ("__aer"); |
| IDENTIFIER_OPNAME_P (ansi_assopname[(int) BIT_XOR_EXPR]) = 1; |
| ansi_opname[(int) TRUTH_ORIF_EXPR] = get_identifier ("__oo"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) TRUTH_ORIF_EXPR]) = 1; |
| ansi_opname[(int) BIT_NOT_EXPR] = get_identifier ("__co"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) BIT_NOT_EXPR]) = 1; |
| ansi_opname[(int) PREDECREMENT_EXPR] = get_identifier ("__mm"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) PREDECREMENT_EXPR]) = 1; |
| ansi_opname[(int) POSTDECREMENT_EXPR] = ansi_opname[(int) PREDECREMENT_EXPR]; |
| ansi_opname[(int) COMPONENT_REF] = get_identifier ("__rf"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) COMPONENT_REF]) = 1; |
| ansi_opname[(int) MEMBER_REF] = get_identifier ("__rm"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) MEMBER_REF]) = 1; |
| ansi_opname[(int) CALL_EXPR] = get_identifier ("__cl"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) CALL_EXPR]) = 1; |
| ansi_opname[(int) ARRAY_REF] = get_identifier ("__vc"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) ARRAY_REF]) = 1; |
| ansi_opname[(int) NEW_EXPR] = get_identifier ("__nw"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) NEW_EXPR]) = 1; |
| ansi_opname[(int) DELETE_EXPR] = get_identifier ("__dl"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) DELETE_EXPR]) = 1; |
| ansi_opname[(int) VEC_NEW_EXPR] = get_identifier ("__vn"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) VEC_NEW_EXPR]) = 1; |
| ansi_opname[(int) VEC_DELETE_EXPR] = get_identifier ("__vd"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) VEC_DELETE_EXPR]) = 1; |
| ansi_opname[(int) TYPE_EXPR] = get_identifier ("__op"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) TYPE_EXPR]) = 1; |
| |
| /* This is not true: these operators are not defined in ANSI, |
| but we need them anyway. */ |
| ansi_opname[(int) MIN_EXPR] = get_identifier ("__mn"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) MIN_EXPR]) = 1; |
| ansi_opname[(int) MAX_EXPR] = get_identifier ("__mx"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) MAX_EXPR]) = 1; |
| ansi_opname[(int) COND_EXPR] = get_identifier ("__cn"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) COND_EXPR]) = 1; |
| ansi_opname[(int) METHOD_CALL_EXPR] = get_identifier ("__wr"); |
| IDENTIFIER_OPNAME_P (ansi_opname[(int) METHOD_CALL_EXPR]) = 1; |
| |
| init_method (); |
| init_error (); |
| gcc_obstack_init (&inline_text_obstack); |
| inline_text_firstobj = (char *) obstack_alloc (&inline_text_obstack, 0); |
| |
| /* Start it at 0, because check_newline is called at the very beginning |
| and will increment it to 1. */ |
| lineno = 0; |
| input_filename = "<internal>"; |
| current_function_decl = NULL; |
| |
| maxtoken = 40; |
| token_buffer = (char *) xmalloc (maxtoken + 2); |
| |
| ridpointers[(int) RID_INT] = get_identifier ("int"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_INT], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_INT])); |
| ridpointers[(int) RID_BOOL] = get_identifier ("bool"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_BOOL], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_BOOL])); |
| ridpointers[(int) RID_CHAR] = get_identifier ("char"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_CHAR], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_CHAR])); |
| ridpointers[(int) RID_VOID] = get_identifier ("void"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_VOID], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_VOID])); |
| ridpointers[(int) RID_FLOAT] = get_identifier ("float"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_FLOAT], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_FLOAT])); |
| ridpointers[(int) RID_DOUBLE] = get_identifier ("double"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_DOUBLE], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_DOUBLE])); |
| ridpointers[(int) RID_SHORT] = get_identifier ("short"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_SHORT], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_SHORT])); |
| ridpointers[(int) RID_LONG] = get_identifier ("long"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_LONG], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_LONG])); |
| ridpointers[(int) RID_UNSIGNED] = get_identifier ("unsigned"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_UNSIGNED], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_UNSIGNED])); |
| ridpointers[(int) RID_SIGNED] = get_identifier ("signed"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_SIGNED], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_SIGNED])); |
| ridpointers[(int) RID_INLINE] = get_identifier ("inline"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_INLINE], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_INLINE])); |
| ridpointers[(int) RID_CONST] = get_identifier ("const"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_CONST], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_CONST])); |
| ridpointers[(int) RID_VOLATILE] = get_identifier ("volatile"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_VOLATILE], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_VOLATILE])); |
| ridpointers[(int) RID_AUTO] = get_identifier ("auto"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_AUTO], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_AUTO])); |
| ridpointers[(int) RID_STATIC] = get_identifier ("static"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_STATIC], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_STATIC])); |
| ridpointers[(int) RID_EXTERN] = get_identifier ("extern"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_EXTERN], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_EXTERN])); |
| ridpointers[(int) RID_TYPEDEF] = get_identifier ("typedef"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_TYPEDEF], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_TYPEDEF])); |
| ridpointers[(int) RID_REGISTER] = get_identifier ("register"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_REGISTER], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_REGISTER])); |
| ridpointers[(int) RID_COMPLEX] = get_identifier ("complex"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_COMPLEX], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_COMPLEX])); |
| |
| /* C++ extensions. These are probably not correctly named. */ |
| ridpointers[(int) RID_WCHAR] = get_identifier ("__wchar_t"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_WCHAR], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_WCHAR])); |
| class_type_node = build_int_2 (class_type, 0); |
| TREE_TYPE (class_type_node) = class_type_node; |
| ridpointers[(int) RID_CLASS] = class_type_node; |
| |
| record_type_node = build_int_2 (record_type, 0); |
| TREE_TYPE (record_type_node) = record_type_node; |
| ridpointers[(int) RID_RECORD] = record_type_node; |
| |
| union_type_node = build_int_2 (union_type, 0); |
| TREE_TYPE (union_type_node) = union_type_node; |
| ridpointers[(int) RID_UNION] = union_type_node; |
| |
| enum_type_node = build_int_2 (enum_type, 0); |
| TREE_TYPE (enum_type_node) = enum_type_node; |
| ridpointers[(int) RID_ENUM] = enum_type_node; |
| |
| ridpointers[(int) RID_VIRTUAL] = get_identifier ("virtual"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_VIRTUAL], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_VIRTUAL])); |
| ridpointers[(int) RID_EXPLICIT] = get_identifier ("explicit"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_EXPLICIT], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_EXPLICIT])); |
| ridpointers[(int) RID_FRIEND] = get_identifier ("friend"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_FRIEND], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_FRIEND])); |
| |
| ridpointers[(int) RID_PUBLIC] = get_identifier ("public"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_PUBLIC], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_PUBLIC])); |
| ridpointers[(int) RID_PRIVATE] = get_identifier ("private"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_PRIVATE], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_PRIVATE])); |
| ridpointers[(int) RID_PROTECTED] = get_identifier ("protected"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_PROTECTED], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_PROTECTED])); |
| ridpointers[(int) RID_TEMPLATE] = get_identifier ("template"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_TEMPLATE], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_TEMPLATE])); |
| /* This is for ANSI C++. */ |
| ridpointers[(int) RID_MUTABLE] = get_identifier ("mutable"); |
| SET_IDENTIFIER_AS_LIST (ridpointers[(int) RID_MUTABLE], |
| build_tree_list (NULL_TREE, ridpointers[(int) RID_MUTABLE])); |
| |
| /* Signature handling extensions. */ |
| signature_type_node = build_int_2 (signature_type, 0); |
| TREE_TYPE (signature_type_node) = signature_type_node; |
| ridpointers[(int) RID_SIGNATURE] = signature_type_node; |
| |
| null_node = build_int_2 (0, 0); |
| ridpointers[RID_NULL] = null_node; |
| |
| opname_tab[(int) COMPONENT_REF] = "->"; |
| opname_tab[(int) MEMBER_REF] = "->*"; |
| opname_tab[(int) METHOD_CALL_EXPR] = "->()"; |
| opname_tab[(int) INDIRECT_REF] = "*"; |
| opname_tab[(int) ARRAY_REF] = "[]"; |
| opname_tab[(int) MODIFY_EXPR] = "="; |
| opname_tab[(int) NEW_EXPR] = "new"; |
| opname_tab[(int) DELETE_EXPR] = "delete"; |
| opname_tab[(int) VEC_NEW_EXPR] = "new []"; |
| opname_tab[(int) VEC_DELETE_EXPR] = "delete []"; |
| opname_tab[(int) COND_EXPR] = "?:"; |
| opname_tab[(int) CALL_EXPR] = "()"; |
| opname_tab[(int) PLUS_EXPR] = "+"; |
| opname_tab[(int) MINUS_EXPR] = "-"; |
| opname_tab[(int) MULT_EXPR] = "*"; |
| opname_tab[(int) TRUNC_DIV_EXPR] = "/"; |
| opname_tab[(int) CEIL_DIV_EXPR] = "(ceiling /)"; |
| opname_tab[(int) FLOOR_DIV_EXPR] = "(floor /)"; |
| opname_tab[(int) ROUND_DIV_EXPR] = "(round /)"; |
| opname_tab[(int) TRUNC_MOD_EXPR] = "%"; |
| opname_tab[(int) CEIL_MOD_EXPR] = "(ceiling %)"; |
| opname_tab[(int) FLOOR_MOD_EXPR] = "(floor %)"; |
| opname_tab[(int) ROUND_MOD_EXPR] = "(round %)"; |
| opname_tab[(int) NEGATE_EXPR] = "-"; |
| opname_tab[(int) MIN_EXPR] = "<?"; |
| opname_tab[(int) MAX_EXPR] = ">?"; |
| opname_tab[(int) ABS_EXPR] = "abs"; |
| opname_tab[(int) FFS_EXPR] = "ffs"; |
| opname_tab[(int) LSHIFT_EXPR] = "<<"; |
| opname_tab[(int) RSHIFT_EXPR] = ">>"; |
| opname_tab[(int) BIT_IOR_EXPR] = "|"; |
| opname_tab[(int) BIT_XOR_EXPR] = "^"; |
| opname_tab[(int) BIT_AND_EXPR] = "&"; |
| opname_tab[(int) BIT_ANDTC_EXPR] = "&~"; |
| opname_tab[(int) BIT_NOT_EXPR] = "~"; |
| opname_tab[(int) TRUTH_ANDIF_EXPR] = "&&"; |
| opname_tab[(int) TRUTH_ORIF_EXPR] = "||"; |
| opname_tab[(int) TRUTH_AND_EXPR] = "strict &&"; |
| opname_tab[(int) TRUTH_OR_EXPR] = "strict ||"; |
| opname_tab[(int) TRUTH_NOT_EXPR] = "!"; |
| opname_tab[(int) LT_EXPR] = "<"; |
| opname_tab[(int) LE_EXPR] = "<="; |
| opname_tab[(int) GT_EXPR] = ">"; |
| opname_tab[(int) GE_EXPR] = ">="; |
| opname_tab[(int) EQ_EXPR] = "=="; |
| opname_tab[(int) NE_EXPR] = "!="; |
| opname_tab[(int) IN_EXPR] = "in"; |
| opname_tab[(int) RANGE_EXPR] = "..."; |
| opname_tab[(int) CONVERT_EXPR] = "+"; |
| opname_tab[(int) ADDR_EXPR] = "&"; |
| opname_tab[(int) PREDECREMENT_EXPR] = "--"; |
| opname_tab[(int) PREINCREMENT_EXPR] = "++"; |
| opname_tab[(int) POSTDECREMENT_EXPR] = "--"; |
| opname_tab[(int) POSTINCREMENT_EXPR] = "++"; |
| opname_tab[(int) COMPOUND_EXPR] = ","; |
| |
| assignop_tab[(int) NOP_EXPR] = "="; |
| assignop_tab[(int) PLUS_EXPR] = "+="; |
| assignop_tab[(int) CONVERT_EXPR] = "+="; |
| assignop_tab[(int) MINUS_EXPR] = "-="; |
| assignop_tab[(int) NEGATE_EXPR] = "-="; |
| assignop_tab[(int) MULT_EXPR] = "*="; |
| assignop_tab[(int) INDIRECT_REF] = "*="; |
| assignop_tab[(int) TRUNC_DIV_EXPR] = "/="; |
| assignop_tab[(int) EXACT_DIV_EXPR] = "(exact /=)"; |
| assignop_tab[(int) CEIL_DIV_EXPR] = "(ceiling /=)"; |
| assignop_tab[(int) FLOOR_DIV_EXPR] = "(floor /=)"; |
| assignop_tab[(int) ROUND_DIV_EXPR] = "(round /=)"; |
| assignop_tab[(int) TRUNC_MOD_EXPR] = "%="; |
| assignop_tab[(int) CEIL_MOD_EXPR] = "(ceiling %=)"; |
| assignop_tab[(int) FLOOR_MOD_EXPR] = "(floor %=)"; |
| assignop_tab[(int) ROUND_MOD_EXPR] = "(round %=)"; |
| assignop_tab[(int) MIN_EXPR] = "<?="; |
| assignop_tab[(int) MAX_EXPR] = ">?="; |
| assignop_tab[(int) LSHIFT_EXPR] = "<<="; |
| assignop_tab[(int) RSHIFT_EXPR] = ">>="; |
| assignop_tab[(int) BIT_IOR_EXPR] = "|="; |
| assignop_tab[(int) BIT_XOR_EXPR] = "^="; |
| assignop_tab[(int) BIT_AND_EXPR] = "&="; |
| assignop_tab[(int) ADDR_EXPR] = "&="; |
| |
| init_filename_times (); |
| |
| /* Some options inhibit certain reserved words. |
| Clear those words out of the hash table so they won't be recognized. */ |
| #define UNSET_RESERVED_WORD(STRING) \ |
| do { struct resword *s = is_reserved_word (STRING, sizeof (STRING) - 1); \ |
| if (s) s->name = ""; } while (0) |
| |
| #if 0 |
| /* let's parse things, and if they use it, then give them an error. */ |
| if (!flag_exceptions) |
| { |
| UNSET_RESERVED_WORD ("throw"); |
| UNSET_RESERVED_WORD ("try"); |
| UNSET_RESERVED_WORD ("catch"); |
| } |
| #endif |
| |
| if (!flag_rtti || flag_no_gnu_keywords) |
| { |
| UNSET_RESERVED_WORD ("classof"); |
| UNSET_RESERVED_WORD ("headof"); |
| } |
| if (! flag_handle_signatures || flag_no_gnu_keywords) |
| { |
| /* Easiest way to not recognize signature |
| handling extensions... */ |
| UNSET_RESERVED_WORD ("signature"); |
| UNSET_RESERVED_WORD ("sigof"); |
| } |
| if (flag_no_gnu_keywords) |
| UNSET_RESERVED_WORD ("complex"); |
| if (flag_no_asm || flag_no_gnu_keywords) |
| UNSET_RESERVED_WORD ("typeof"); |
| if (! flag_operator_names) |
| { |
| /* These are new ANSI keywords that may break code. */ |
| UNSET_RESERVED_WORD ("and"); |
| UNSET_RESERVED_WORD ("and_eq"); |
| UNSET_RESERVED_WORD ("bitand"); |
| UNSET_RESERVED_WORD ("bitor"); |
| UNSET_RESERVED_WORD ("compl"); |
| UNSET_RESERVED_WORD ("not"); |
| UNSET_RESERVED_WORD ("not_eq"); |
| UNSET_RESERVED_WORD ("or"); |
| UNSET_RESERVED_WORD ("or_eq"); |
| UNSET_RESERVED_WORD ("xor"); |
| UNSET_RESERVED_WORD ("xor_eq"); |
| } |
| |
| token_count = init_parse (); |
| interface_unknown = 1; |
| } |
| |
| void |
| reinit_parse_for_function () |
| { |
| current_base_init_list = NULL_TREE; |
| current_member_init_list = NULL_TREE; |
| } |
| |
| #ifdef __GNUC__ |
| __inline |
| #endif |
| void |
| yyprint (file, yychar, yylval) |
| FILE *file; |
| int yychar; |
| YYSTYPE yylval; |
| { |
| tree t; |
| switch (yychar) |
| { |
| case IDENTIFIER: |
| case TYPENAME: |
| case TYPESPEC: |
| case PTYPENAME: |
| case IDENTIFIER_DEFN: |
| case TYPENAME_DEFN: |
| case PTYPENAME_DEFN: |
| case TYPENAME_ELLIPSIS: |
| case SCSPEC: |
| case PRE_PARSED_CLASS_DECL: |
| t = yylval.ttype; |
| if (TREE_CODE (t) == TYPE_DECL) |
| { |
| fprintf (file, " `%s'", DECL_NAME (t)); |
| break; |
| } |
| my_friendly_assert (TREE_CODE (t) == IDENTIFIER_NODE, 224); |
| if (IDENTIFIER_POINTER (t)) |
| fprintf (file, " `%s'", IDENTIFIER_POINTER (t)); |
| break; |
| case AGGR: |
| if (yylval.ttype == class_type_node) |
| fprintf (file, " `class'"); |
| else if (yylval.ttype == record_type_node) |
| fprintf (file, " `struct'"); |
| else if (yylval.ttype == union_type_node) |
| fprintf (file, " `union'"); |
| else if (yylval.ttype == enum_type_node) |
| fprintf (file, " `enum'"); |
| else if (yylval.ttype == signature_type_node) |
| fprintf (file, " `signature'"); |
| else |
| my_friendly_abort (80); |
| break; |
| } |
| } |
| |
| #if defined(GATHER_STATISTICS) && defined(REDUCE_LENGTH) |
| static int *reduce_count; |
| #endif |
| |
| int *token_count; |
| |
| #if 0 |
| #define REDUCE_LENGTH (sizeof (yyr2) / sizeof (yyr2[0])) |
| #define TOKEN_LENGTH (256 + sizeof (yytname) / sizeof (yytname[0])) |
| #endif |
| |
| int * |
| init_parse () |
| { |
| #ifdef GATHER_STATISTICS |
| #ifdef REDUCE_LENGTH |
| reduce_count = (int *)malloc (sizeof (int) * (REDUCE_LENGTH + 1)); |
| bzero (reduce_count, sizeof (int) * (REDUCE_LENGTH + 1)); |
| reduce_count += 1; |
| token_count = (int *)malloc (sizeof (int) * (TOKEN_LENGTH + 1)); |
| bzero (token_count, sizeof (int) * (TOKEN_LENGTH + 1)); |
| token_count += 1; |
| #endif |
| #endif |
| return token_count; |
| } |
| |
| #ifdef GATHER_STATISTICS |
| #ifdef REDUCE_LENGTH |
| void |
| yyhook (yyn) |
| int yyn; |
| { |
| reduce_count[yyn] += 1; |
| } |
| |
| static int |
| reduce_cmp (p, q) |
| int *p, *q; |
| { |
| return reduce_count[*q] - reduce_count[*p]; |
| } |
| |
| static int |
| token_cmp (p, q) |
| int *p, *q; |
| { |
| return token_count[*q] - token_count[*p]; |
| } |
| #endif |
| #endif |
| |
| void |
| print_parse_statistics () |
| { |
| #ifdef GATHER_STATISTICS |
| #ifdef REDUCE_LENGTH |
| #if YYDEBUG != 0 |
| int i; |
| int maxlen = REDUCE_LENGTH; |
| unsigned *sorted; |
| |
| if (reduce_count[-1] == 0) |
| return; |
| |
| if (TOKEN_LENGTH > REDUCE_LENGTH) |
| maxlen = TOKEN_LENGTH; |
| sorted = (unsigned *) alloca (sizeof (int) * maxlen); |
| |
| for (i = 0; i < TOKEN_LENGTH; i++) |
| sorted[i] = i; |
| qsort (sorted, TOKEN_LENGTH, sizeof (int), token_cmp); |
| for (i = 0; i < TOKEN_LENGTH; i++) |
| { |
| int idx = sorted[i]; |
| if (token_count[idx] == 0) |
| break; |
| if (token_count[idx] < token_count[-1]) |
| break; |
| fprintf (stderr, "token %d, `%s', count = %d\n", |
| idx, yytname[YYTRANSLATE (idx)], token_count[idx]); |
| } |
| fprintf (stderr, "\n"); |
| for (i = 0; i < REDUCE_LENGTH; i++) |
| sorted[i] = i; |
| qsort (sorted, REDUCE_LENGTH, sizeof (int), reduce_cmp); |
| for (i = 0; i < REDUCE_LENGTH; i++) |
| { |
| int idx = sorted[i]; |
| if (reduce_count[idx] == 0) |
| break; |
| if (reduce_count[idx] < reduce_count[-1]) |
| break; |
| fprintf (stderr, "rule %d, line %d, count = %d\n", |
| idx, yyrline[idx], reduce_count[idx]); |
| } |
| fprintf (stderr, "\n"); |
| #endif |
| #endif |
| #endif |
| } |
| |
| /* Sets the value of the 'yydebug' variable to VALUE. |
| This is a function so we don't have to have YYDEBUG defined |
| in order to build the compiler. */ |
| |
| void |
| set_yydebug (value) |
| int value; |
| { |
| #if YYDEBUG != 0 |
| extern int yydebug; |
| yydebug = value; |
| #else |
| warning ("YYDEBUG not defined."); |
| #endif |
| } |
| |
| |
| /* Functions and data structures for #pragma interface. |
| |
| `#pragma implementation' means that the main file being compiled |
| is considered to implement (provide) the classes that appear in |
| its main body. I.e., if this is file "foo.cc", and class `bar' |
| is defined in "foo.cc", then we say that "foo.cc implements bar". |
| |
| All main input files "implement" themselves automagically. |
| |
| `#pragma interface' means that unless this file (of the form "foo.h" |
| is not presently being included by file "foo.cc", the |
| CLASSTYPE_INTERFACE_ONLY bit gets set. The effect is that none |
| of the vtables nor any of the inline functions defined in foo.h |
| will ever be output. |
| |
| There are cases when we want to link files such as "defs.h" and |
| "main.cc". In this case, we give "defs.h" a `#pragma interface', |
| and "main.cc" has `#pragma implementation "defs.h"'. */ |
| |
| struct impl_files |
| { |
| char *filename; |
| struct impl_files *next; |
| }; |
| |
| static struct impl_files *impl_file_chain; |
| |
| /* Helper function to load global variables with interface |
| information. */ |
| |
| void |
| extract_interface_info () |
| { |
| tree fileinfo = 0; |
| |
| if (flag_alt_external_templates) |
| { |
| struct tinst_level *til = tinst_for_decl (); |
| |
| if (til) |
| fileinfo = get_time_identifier (til->file); |
| } |
| if (!fileinfo) |
| fileinfo = get_time_identifier (input_filename); |
| fileinfo = IDENTIFIER_CLASS_VALUE (fileinfo); |
| interface_only = TREE_INT_CST_LOW (fileinfo); |
| interface_unknown = TREE_INT_CST_HIGH (fileinfo); |
| } |
| |
| /* Return nonzero if S is not considered part of an |
| INTERFACE/IMPLEMENTATION pair. Otherwise, return 0. */ |
| |
| static int |
| interface_strcmp (s) |
| char *s; |
| { |
| /* Set the interface/implementation bits for this scope. */ |
| struct impl_files *ifiles; |
| char *s1; |
| |
| for (ifiles = impl_file_chain; ifiles; ifiles = ifiles->next) |
| { |
| char *t1 = ifiles->filename; |
| s1 = s; |
| |
| if (*s1 != *t1 || *s1 == 0) |
| continue; |
| |
| while (*s1 == *t1 && *s1 != 0) |
| s1++, t1++; |
| |
| /* A match. */ |
| if (*s1 == *t1) |
| return 0; |
| |
| /* Don't get faked out by xxx.yyy.cc vs xxx.zzz.cc. */ |
| if (index (s1, '.') || index (t1, '.')) |
| continue; |
| |
| if (*s1 == '\0' || s1[-1] != '.' || t1[-1] != '.') |
| continue; |
| |
| /* A match. */ |
| return 0; |
| } |
| |
| /* No matches. */ |
| return 1; |
| } |
| |
| static void |
| set_typedecl_interface_info (prev, vars) |
| tree prev, vars; |
| { |
| tree id = get_time_identifier (DECL_SOURCE_FILE (vars)); |
| tree fileinfo = IDENTIFIER_CLASS_VALUE (id); |
| tree type = TREE_TYPE (vars); |
| |
| CLASSTYPE_INTERFACE_ONLY (type) = TREE_INT_CST_LOW (fileinfo) |
| = interface_strcmp (FILE_NAME_NONDIRECTORY (DECL_SOURCE_FILE (vars))); |
| } |
| |
| static int |
| set_vardecl_interface_info (prev, vars) |
| tree prev, vars; |
| { |
| tree type = DECL_CONTEXT (vars); |
| |
| if (CLASSTYPE_INTERFACE_KNOWN (type)) |
| { |
| if (CLASSTYPE_INTERFACE_ONLY (type)) |
| set_typedecl_interface_info (prev, TYPE_MAIN_DECL (type)); |
| else |
| CLASSTYPE_VTABLE_NEEDS_WRITING (type) = 1; |
| DECL_EXTERNAL (vars) = CLASSTYPE_INTERFACE_ONLY (type); |
| TREE_PUBLIC (vars) = 1; |
| return 1; |
| } |
| return 0; |
| } |
| |
| /* Called from the top level: if there are any pending inlines to |
| do, set up to process them now. This function sets up the first function |
| to be parsed; after it has been, the rule for fndef in parse.y will |
| call process_next_inline to start working on the next one. */ |
| |
| void |
| do_pending_inlines () |
| { |
| struct pending_inline *t; |
| tree context; |
| |
| /* Oops, we're still dealing with the last batch. */ |
| if (yychar == PRE_PARSED_FUNCTION_DECL) |
| return; |
| |
| /* Reverse the pending inline functions, since |
| they were cons'd instead of appended. */ |
| { |
| struct pending_inline *prev = 0, *tail; |
| t = pending_inlines; |
| pending_inlines = 0; |
| |
| for (; t; t = tail) |
| { |
| tail = t->next; |
| t->next = prev; |
| t->deja_vu = 1; |
| prev = t; |
| } |
| t = prev; |
| } |
| |
| if (t == 0) |
| return; |
| |
| /* Now start processing the first inline function. */ |
| context = hack_decl_function_context (t->fndecl); |
| if (context) |
| push_cp_function_context (context); |
| if (t->len > 0) |
| { |
| feed_input (t->buf, t->len); |
| lineno = t->lineno; |
| #if 0 |
| if (input_filename != t->filename) |
| { |
| input_filename = t->filename; |
| /* Get interface/implementation back in sync. */ |
| extract_interface_info (); |
| } |
| #else |
| input_filename = t->filename; |
| interface_unknown = t->interface == 1; |
| interface_only = t->interface == 0; |
| #endif |
| yychar = PRE_PARSED_FUNCTION_DECL; |
| } |
| /* Pass back a handle on the rest of the inline functions, so that they |
| can be processed later. */ |
| yylval.ttype = build_tree_list ((tree) t, t->fndecl); |
| DECL_PENDING_INLINE_INFO (t->fndecl) = 0; |
| } |
| |
| static int nextchar = -1; |
| |
| /* Called from the fndecl rule in the parser when the function just parsed |
| was declared using a PRE_PARSED_FUNCTION_DECL (i.e. came from |
| do_pending_inlines). */ |
| |
| void |
| process_next_inline (t) |
| tree t; |
| { |
| tree context; |
| struct pending_inline *i = (struct pending_inline *) TREE_PURPOSE (t); |
| context = hack_decl_function_context (i->fndecl); |
| if (context) |
| pop_cp_function_context (context); |
| i = i->next; |
| if (yychar == YYEMPTY) |
| yychar = yylex (); |
| if (yychar != END_OF_SAVED_INPUT) |
| { |
| error ("parse error at end of saved function text"); |
| |
| /* restore_pending_input will abort unless yychar is either |
| END_OF_SAVED_INPUT or YYEMPTY; since we already know we're |
| hosed, feed back YYEMPTY. We also need to discard nextchar, |
| since that may have gotten set as well. */ |
| nextchar = -1; |
| } |
| yychar = YYEMPTY; |
| end_input (); |
| if (i && i->fndecl != NULL_TREE) |
| { |
| context = hack_decl_function_context (i->fndecl); |
| if (context) |
| push_cp_function_context (context); |
| feed_input (i->buf, i->len); |
| lineno = i->lineno; |
| input_filename = i->filename; |
| yychar = PRE_PARSED_FUNCTION_DECL; |
| yylval.ttype = build_tree_list ((tree) i, i->fndecl); |
| DECL_PENDING_INLINE_INFO (i->fndecl) = 0; |
| } |
| if (i) |
| { |
| interface_unknown = i->interface == 1; |
| interface_only = i->interface == 0; |
| } |
| else |
| extract_interface_info (); |
| } |
| |
| /* Since inline methods can refer to text which has not yet been seen, |
| we store the text of the method in a structure which is placed in the |
| DECL_PENDING_INLINE_INFO field of the FUNCTION_DECL. |
| After parsing the body of the class definition, the FUNCTION_DECL's are |
| scanned to see which ones have this field set. Those are then digested |
| one at a time. |
| |
| This function's FUNCTION_DECL will have a bit set in its common so |
| that we know to watch out for it. */ |
| |
| static void |
| consume_string (this_obstack, matching_char) |
| register struct obstack *this_obstack; |
| int matching_char; |
| { |
| register int c; |
| int starting_lineno = lineno; |
| do |
| { |
| c = getch (); |
| if (c == EOF) |
| { |
| int save_lineno = lineno; |
| lineno = starting_lineno; |
| if (matching_char == '"') |
| error ("end of file encountered inside string constant"); |
| else |
| error ("end of file encountered inside character constant"); |
| lineno = save_lineno; |
| return; |
| } |
| if (c == '\\') |
| { |
| obstack_1grow (this_obstack, c); |
| c = getch (); |
| obstack_1grow (this_obstack, c); |
| |
| /* Make sure we continue the loop */ |
| c = 0; |
| continue; |
| } |
| if (c == '\n') |
| { |
| if (pedantic) |
| pedwarn ("ANSI C++ forbids newline in string constant"); |
| lineno++; |
| } |
| obstack_1grow (this_obstack, c); |
| } |
| while (c != matching_char); |
| } |
| |
| static int nextyychar = YYEMPTY; |
| static YYSTYPE nextyylval; |
| |
| struct pending_input { |
| int nextchar, yychar, nextyychar, eof; |
| YYSTYPE yylval, nextyylval; |
| struct obstack token_obstack; |
| int first_token; |
| }; |
| |
| struct pending_input * |
| save_pending_input () |
| { |
| struct pending_input *p; |
| p = (struct pending_input *) xmalloc (sizeof (struct pending_input)); |
| p->nextchar = nextchar; |
| p->yychar = yychar; |
| p->nextyychar = nextyychar; |
| p->yylval = yylval; |
| p->nextyylval = nextyylval; |
| p->eof = end_of_file; |
| yychar = nextyychar = YYEMPTY; |
| nextchar = -1; |
| p->first_token = first_token; |
| p->token_obstack = token_obstack; |
| |
| first_token = 0; |
| gcc_obstack_init (&token_obstack); |
| end_of_file = 0; |
| return p; |
| } |
| |
| void |
| restore_pending_input (p) |
| struct pending_input *p; |
| { |
| my_friendly_assert (nextchar == -1, 229); |
| nextchar = p->nextchar; |
| my_friendly_assert (yychar == YYEMPTY || yychar == END_OF_SAVED_INPUT, 230); |
| yychar = p->yychar; |
| my_friendly_assert (nextyychar == YYEMPTY, 231); |
| nextyychar = p->nextyychar; |
| yylval = p->yylval; |
| nextyylval = p->nextyylval; |
| first_token = p->first_token; |
| obstack_free (&token_obstack, (char *) 0); |
| token_obstack = p->token_obstack; |
| end_of_file = p->eof; |
| free (p); |
| } |
| |
| /* Return next non-whitespace input character, which may come |
| from `finput', or from `nextchar'. */ |
| |
| static int |
| yynextch () |
| { |
| int c; |
| |
| if (nextchar >= 0) |
| { |
| c = nextchar; |
| nextchar = -1; |
| } |
| else c = getch (); |
| return skip_white_space (c); |
| } |
| |
| /* Unget character CH from the input stream. |
| If RESCAN is non-zero, then we want to `see' this |
| character as the next input token. */ |
| |
| void |
| yyungetc (ch, rescan) |
| int ch; |
| int rescan; |
| { |
| /* Unget a character from the input stream. */ |
| if (yychar == YYEMPTY || rescan == 0) |
| { |
| if (nextchar >= 0) |
| put_back (nextchar); |
| nextchar = ch; |
| } |
| else |
| { |
| my_friendly_assert (nextyychar == YYEMPTY, 232); |
| nextyychar = yychar; |
| nextyylval = yylval; |
| yychar = ch; |
| } |
| } |
| |
| void |
| clear_inline_text_obstack () |
| { |
| obstack_free (&inline_text_obstack, inline_text_firstobj); |
| } |
| |
| /* This function stores away the text for an inline function that should |
| be processed later. It decides how much later, and may need to move |
| the info between obstacks; therefore, the caller should not refer to |
| the T parameter after calling this function. */ |
| |
| static void |
| store_pending_inline (decl, t) |
| tree decl; |
| struct pending_inline *t; |
| { |
| t->fndecl = decl; |
| DECL_PENDING_INLINE_INFO (decl) = t; |
| |
| /* Because we use obstacks, we must process these in precise order. */ |
| t->next = pending_inlines; |
| pending_inlines = t; |
| } |
| |
| static void reinit_parse_for_block PROTO((int, struct obstack *)); |
| |
| void |
| reinit_parse_for_method (yychar, decl) |
| int yychar; |
| tree decl; |
| { |
| int len; |
| int starting_lineno = lineno; |
| char *starting_filename = input_filename; |
| |
| reinit_parse_for_block (yychar, &inline_text_obstack); |
| |
| len = obstack_object_size (&inline_text_obstack); |
| current_base_init_list = NULL_TREE; |
| current_member_init_list = NULL_TREE; |
| if (decl == void_type_node |
| || (current_class_type && TYPE_REDEFINED (current_class_type))) |
| { |
| /* Happens when we get two declarations of the same |
| function in the same scope. */ |
| char *buf = obstack_finish (&inline_text_obstack); |
| obstack_free (&inline_text_obstack, buf); |
| return; |
| } |
| else |
| { |
| struct pending_inline *t; |
| char *buf = obstack_finish (&inline_text_obstack); |
| |
| t = (struct pending_inline *) obstack_alloc (&inline_text_obstack, |
| sizeof (struct pending_inline)); |
| t->lineno = starting_lineno; |
| t->filename = starting_filename; |
| t->token = YYEMPTY; |
| t->token_value = 0; |
| t->buf = buf; |
| t->len = len; |
| t->deja_vu = 0; |
| #if 0 |
| if (interface_unknown && processing_template_defn && flag_external_templates && ! DECL_IN_SYSTEM_HEADER (decl)) |
| warn_if_unknown_interface (decl); |
| #endif |
| t->interface = (interface_unknown ? 1 : (interface_only ? 0 : 2)); |
| store_pending_inline (decl, t); |
| } |
| } |
| |
| /* Consume a block -- actually, a method beginning |
| with `:' or `{' -- and save it away on the specified obstack. */ |
| |
| static void |
| reinit_parse_for_block (pyychar, obstackp) |
| int pyychar; |
| struct obstack *obstackp; |
| { |
| register int c = 0; |
| int blev = 1; |
| int starting_lineno = lineno; |
| char *starting_filename = input_filename; |
| int len; |
| int look_for_semicolon = 0; |
| int look_for_lbrac = 0; |
| |
| if (pyychar == '{') |
| obstack_1grow (obstackp, '{'); |
| else if (pyychar == '=') |
| look_for_semicolon = 1; |
| else if (pyychar == ':') |
| { |
| obstack_1grow (obstackp, pyychar); |
| look_for_lbrac = 1; |
| blev = 0; |
| } |
| else if (pyychar == RETURN) |
| { |
| obstack_grow (obstackp, "return", 6); |
| look_for_lbrac = 1; |
| blev = 0; |
| } |
| else if (pyychar == TRY) |
| { |
| obstack_grow (obstackp, "try", 3); |
| look_for_lbrac = 1; |
| blev = 0; |
| } |
| else |
| { |
| yyerror ("parse error in method specification"); |
| obstack_1grow (obstackp, '{'); |
| } |
| |
| if (nextchar != EOF) |
| { |
| c = nextchar; |
| nextchar = EOF; |
| } |
| else |
| c = getch (); |
| |
| while (c != EOF) |
| { |
| int this_lineno = lineno; |
| |
| c = skip_white_space (c); |
| |
| /* Don't lose our cool if there are lots of comments. */ |
| if (lineno == this_lineno + 1) |
| obstack_1grow (obstackp, '\n'); |
| else if (lineno == this_lineno) |
| ; |
| else if (lineno - this_lineno < 10) |
| { |
| int i; |
| for (i = lineno - this_lineno; i > 0; i--) |
| obstack_1grow (obstackp, '\n'); |
| } |
| else |
| { |
| char buf[16]; |
| sprintf (buf, "\n# %d \"", lineno); |
| len = strlen (buf); |
| obstack_grow (obstackp, buf, len); |
| |
| len = strlen (input_filename); |
| obstack_grow (obstackp, input_filename, len); |
| obstack_1grow (obstackp, '\"'); |
| obstack_1grow (obstackp, '\n'); |
| } |
| |
| while (c > ' ') /* ASCII dependent... */ |
| { |
| obstack_1grow (obstackp, c); |
| if (c == '{') |
| { |
| look_for_lbrac = 0; |
| blev++; |
| } |
| else if (c == '}') |
| { |
| blev--; |
| if (blev == 0 && !look_for_semicolon) |
| { |
| if (pyychar == TRY) |
| { |
| if (peekyylex () == CATCH) |
| { |
| yylex (); |
| obstack_grow (obstackp, " catch ", 7); |
| look_for_lbrac = 1; |
| } |
| else |
| { |
| yychar = '{'; |
| goto done; |
| } |
| } |
| else |
| { |
| goto done; |
| } |
| } |
| } |
| else if (c == '\\') |
| { |
| /* Don't act on the next character...e.g, doing an escaped |
| double-quote. */ |
| c = getch (); |
| if (c == EOF) |
| { |
| error_with_file_and_line (starting_filename, |
| starting_lineno, |
| "end of file read inside definition"); |
| goto done; |
| } |
| obstack_1grow (obstackp, c); |
| } |
| else if (c == '\"') |
| consume_string (obstackp, c); |
| else if (c == '\'') |
| consume_string (obstackp, c); |
| else if (c == ';') |
| { |
| if (look_for_lbrac) |
| { |
| error ("function body for constructor missing"); |
| obstack_1grow (obstackp, '{'); |
| obstack_1grow (obstackp, '}'); |
| len += 2; |
| goto done; |
| } |
| else if (look_for_semicolon && blev == 0) |
| goto done; |
| } |
| c = getch (); |
| } |
| |
| if (c == EOF) |
| { |
| error_with_file_and_line (starting_filename, |
| starting_lineno, |
| "end of file read inside definition"); |
| goto done; |
| } |
| else if (c != '\n') |
| { |
| obstack_1grow (obstackp, c); |
| c = getch (); |
| } |
| } |
| done: |
| obstack_1grow (obstackp, '\0'); |
| } |
| |
| /* Consume a no-commas expression -- actually, a default argument -- and |
| save it away on the specified obstack. */ |
| |
| static void |
| reinit_parse_for_expr (obstackp) |
| struct obstack *obstackp; |
| { |
| register int c = 0; |
| int starting_lineno = lineno; |
| char *starting_filename = input_filename; |
| int len; |
| int look_for_semicolon = 0; |
| int look_for_lbrac = 0; |
| int plev = 0; |
| |
| if (nextchar != EOF) |
| { |
| c = nextchar; |
| nextchar = EOF; |
| } |
| else |
| c = getch (); |
| |
| while (c != EOF) |
| { |
| int this_lineno = lineno; |
| |
| c = skip_white_space (c); |
| |
| /* Don't lose our cool if there are lots of comments. */ |
| if (lineno == this_lineno + 1) |
| obstack_1grow (obstackp, '\n'); |
| else if (lineno == this_lineno) |
| ; |
| else if (lineno - this_lineno < 10) |
| { |
| int i; |
| for (i = lineno - this_lineno; i > 0; --i) |
| obstack_1grow (obstackp, '\n'); |
| } |
| else |
| { |
| char buf[16]; |
| sprintf (buf, "\n# %d \"", lineno); |
| len = strlen (buf); |
| obstack_grow (obstackp, buf, len); |
| |
| len = strlen (input_filename); |
| obstack_grow (obstackp, input_filename, len); |
| obstack_1grow (obstackp, '\"'); |
| obstack_1grow (obstackp, '\n'); |
| } |
| |
| while (c > ' ') /* ASCII dependent... */ |
| { |
| if (plev <= 0 && (c == ')' || c == ',')) |
| { |
| put_back (c); |
| goto done; |
| } |
| obstack_1grow (obstackp, c); |
| if (c == '(' || c == '[') |
| ++plev; |
| else if (c == ']' || c == ')') |
| --plev; |
| else if (c == '\\') |
| { |
| /* Don't act on the next character...e.g, doing an escaped |
| double-quote. */ |
| c = getch (); |
| if (c == EOF) |
| { |
| error_with_file_and_line (starting_filename, |
| starting_lineno, |
| "end of file read inside definition"); |
| goto done; |
| } |
| obstack_1grow (obstackp, c); |
| } |
| else if (c == '\"') |
| consume_string (obstackp, c); |
| else if (c == '\'') |
| consume_string (obstackp, c); |
| c = getch (); |
| } |
| |
| if (c == EOF) |
| { |
| error_with_file_and_line (starting_filename, |
| starting_lineno, |
| "end of file read inside definition"); |
| goto done; |
| } |
| else if (c != '\n') |
| { |
| obstack_1grow (obstackp, c); |
| c = getch (); |
| } |
| } |
| done: |
| obstack_1grow (obstackp, '\0'); |
| } |
| |
| int do_snarf_defarg; |
| |
| /* Decide whether the default argument we are about to see should be |
| gobbled up as text for later parsing. */ |
| |
| void |
| maybe_snarf_defarg () |
| { |
| if (current_class_type && TYPE_BEING_DEFINED (current_class_type)) |
| do_snarf_defarg = 1; |
| } |
| |
| /* When we see a default argument in a method declaration, we snarf it as |
| text using snarf_defarg. When we get up to namespace scope, we then go |
| through and parse all of them using do_pending_defargs. Since yacc |
| parsers are not reentrant, we retain defargs state in these two |
| variables so that subsequent calls to do_pending_defargs can resume |
| where the previous call left off. */ |
| |
| tree defarg_fns; |
| tree defarg_parm; |
| |
| tree |
| snarf_defarg () |
| { |
| int len; |
| char *buf; |
| tree arg; |
| struct pending_inline *t; |
| |
| reinit_parse_for_expr (&inline_text_obstack); |
| len = obstack_object_size (&inline_text_obstack); |
| buf = obstack_finish (&inline_text_obstack); |
| |
| push_obstacks (&inline_text_obstack, &inline_text_obstack); |
| arg = make_node (DEFAULT_ARG); |
| DEFARG_LENGTH (arg) = len - 1; |
| DEFARG_POINTER (arg) = buf; |
| pop_obstacks (); |
| |
| return arg; |
| } |
| |
| /* Called from grokfndecl to note a function decl with unparsed default |
| arguments for later processing. Also called from grokdeclarator |
| for function types with unparsed defargs; the call from grokfndecl |
| will always come second, so we can overwrite the entry from the type. */ |
| |
| void |
| add_defarg_fn (decl) |
| tree decl; |
| { |
| if (TREE_CODE (decl) == FUNCTION_DECL) |
| TREE_VALUE (defarg_fns) = decl; |
| else |
| { |
| push_obstacks (&inline_text_obstack, &inline_text_obstack); |
| defarg_fns = tree_cons (current_class_type, decl, defarg_fns); |
| pop_obstacks (); |
| } |
| } |
| |
| /* Helper for do_pending_defargs. Starts the parsing of a default arg. */ |
| |
| static void |
| feed_defarg (f, p) |
| tree f, p; |
| { |
| tree d = TREE_PURPOSE (p); |
| feed_input (DEFARG_POINTER (d), DEFARG_LENGTH (d)); |
| if (TREE_CODE (f) == FUNCTION_DECL) |
| { |
| lineno = DECL_SOURCE_LINE (f); |
| input_filename = DECL_SOURCE_FILE (f); |
| } |
| yychar = DEFARG_MARKER; |
| yylval.ttype = p; |
| } |
| |
| /* Helper for do_pending_defargs. Ends the parsing of a default arg. */ |
| |
| static void |
| finish_defarg () |
| { |
| if (yychar == YYEMPTY) |
| yychar = yylex (); |
| if (yychar != END_OF_SAVED_INPUT) |
| { |
| error ("parse error at end of saved function text"); |
| |
| /* restore_pending_input will abort unless yychar is either |
| END_OF_SAVED_INPUT or YYEMPTY; since we already know we're |
| hosed, feed back YYEMPTY. We also need to discard nextchar, |
| since that may have gotten set as well. */ |
| nextchar = -1; |
| } |
| yychar = YYEMPTY; |
| end_input (); |
| } |
| |
| /* Main function for deferred parsing of default arguments. Called from |
| the parser. */ |
| |
| void |
| do_pending_defargs () |
| { |
| if (defarg_parm) |
| finish_defarg (); |
| |
| for (; defarg_fns; defarg_fns = TREE_CHAIN (defarg_fns)) |
| { |
| tree defarg_fn = TREE_VALUE (defarg_fns); |
| if (defarg_parm == NULL_TREE) |
| { |
| tree p; |
| |
| push_nested_class (TREE_PURPOSE (defarg_fns), 1); |
| pushlevel (0); |
| |
| if (TREE_CODE (defarg_fn) == FUNCTION_DECL) |
| { |
| #if 0 |
| for (p = DECL_ARGUMENTS (defarg_fn); p; p = TREE_CHAIN (p)) |
| pushdecl (copy_node (p)); |
| #endif |
| defarg_parm = TYPE_ARG_TYPES (TREE_TYPE (defarg_fn)); |
| } |
| else |
| defarg_parm = TYPE_ARG_TYPES (defarg_fn); |
| } |
| else |
| defarg_parm = TREE_CHAIN (defarg_parm); |
| |
| for (; defarg_parm; defarg_parm = TREE_CHAIN (defarg_parm)) |
| if (TREE_PURPOSE (defarg_parm)) |
| { |
| my_friendly_assert (TREE_CODE (TREE_PURPOSE (defarg_parm)) |
| == DEFAULT_ARG, 2349); |
| feed_defarg (defarg_fn, defarg_parm); |
| |
| /* Return to the parser, which will process this defarg |
| and call us again. */ |
| return; |
| } |
| |
| poplevel (0, 0, 0); |
| pop_nested_class (1); |
| } |
| } |
| |
| /* Build a default function named NAME for type TYPE. |
| KIND says what to build. |
| |
| When KIND == 0, build default destructor. |
| When KIND == 1, build virtual destructor. |
| When KIND == 2, build default constructor. |
| When KIND == 3, build default X(const X&) constructor. |
| When KIND == 4, build default X(X&) constructor. |
| When KIND == 5, build default operator = (const X&). |
| When KIND == 6, build default operator = (X&). */ |
| |
| tree |
| cons_up_default_function (type, full_name, kind) |
| tree type, full_name; |
| int kind; |
| { |
| extern tree void_list_node; |
| tree declspecs = NULL_TREE; |
| tree fn, args; |
| tree argtype; |
| int retref = 0; |
| tree name = constructor_name (full_name); |
| |
| switch (kind) |
| { |
| /* Destructors. */ |
| case 1: |
| declspecs = build_decl_list (NULL_TREE, ridpointers [(int) RID_VIRTUAL]); |
| /* Fall through... */ |
| case 0: |
| name = build_parse_node (BIT_NOT_EXPR, name); |
| args = void_list_node; |
| break; |
| |
| case 2: |
| /* Default constructor. */ |
| args = void_list_node; |
| break; |
| |
| case 3: |
| type = build_type_variant (type, 1, 0); |
| /* Fall through... */ |
| case 4: |
| /* According to ARM $12.8, the default copy ctor will be declared, but |
| not defined, unless it's needed. */ |
| argtype = build_reference_type (type); |
| args = tree_cons (NULL_TREE, |
| build_tree_list (hash_tree_chain (argtype, NULL_TREE), |
| get_identifier ("_ctor_arg")), |
| void_list_node); |
| break; |
| |
| case 5: |
| case 6: |
| retref = 1; |
| declspecs = build_decl_list (NULL_TREE, type); |
| |
| if (kind == 5) |
| type = build_type_variant (type, 1, 0); |
| |
| name = ansi_opname [(int) MODIFY_EXPR]; |
| |
| argtype = build_reference_type (type); |
| args = tree_cons (NULL_TREE, |
| build_tree_list (hash_tree_chain (argtype, NULL_TREE), |
| get_identifier ("_ctor_arg")), |
| void_list_node); |
| break; |
| |
| default: |
| my_friendly_abort (59); |
| } |
| |
| declspecs = decl_tree_cons (NULL_TREE, ridpointers [(int) RID_INLINE], |
| declspecs); |
| |
| TREE_PARMLIST (args) = 1; |
| |
| { |
| tree declarator = make_call_declarator (name, args, NULL_TREE, NULL_TREE); |
| if (retref) |
| declarator = build_parse_node (ADDR_EXPR, declarator); |
| |
| fn = grokfield (declarator, declspecs, NULL_TREE, NULL_TREE, NULL_TREE); |
| } |
| |
| if (fn == void_type_node) |
| return fn; |
| |
| if (kind > 2) |
| SET_DECL_ARTIFICIAL (TREE_CHAIN (DECL_ARGUMENTS (fn))); |
| |
| #if 0 |
| if (processing_template_defn) |
| { |
| SET_DECL_IMPLICIT_INSTANTIATION (fn); |
| repo_template_used (fn); |
| } |
| #endif |
| |
| #if 0 |
| if (CLASSTYPE_INTERFACE_KNOWN (type)) |
| { |
| DECL_INTERFACE_KNOWN (fn) = 1; |
| DECL_NOT_REALLY_EXTERN (fn) = (!CLASSTYPE_INTERFACE_ONLY (type) |
| && flag_implement_inlines); |
| } |
| else |
| #endif |
| DECL_NOT_REALLY_EXTERN (fn) = 1; |
| |
| mark_inline_for_output (fn); |
| |
| #ifdef DEBUG_DEFAULT_FUNCTIONS |
| { char *fn_type = NULL; |
| tree t = name; |
| switch (kind) |
| { |
| case 0: fn_type = "default destructor"; break; |
| case 1: fn_type = "virtual destructor"; break; |
| case 2: fn_type = "default constructor"; break; |
| case 3: fn_type = "default X(const X&)"; break; |
| case 4: fn_type = "default X(X&)"; break; |
| } |
| if (fn_type) |
| { |
| if (TREE_CODE (name) == BIT_NOT_EXPR) |
| t = TREE_OPERAND (name, 0); |
| fprintf (stderr, "[[[[ %s for %s:\n%s]]]]\n", fn_type, |
| IDENTIFIER_POINTER (t), func_buf); |
| } |
| } |
| #endif /* DEBUG_DEFAULT_FUNCTIONS */ |
| |
| /* Show that this function was generated by the compiler. */ |
| SET_DECL_ARTIFICIAL (fn); |
| |
| return fn; |
| } |
| |
| /* Heuristic to tell whether the user is missing a semicolon |
| after a struct or enum declaration. Emit an error message |
| if we know the user has blown it. */ |
| |
| void |
| check_for_missing_semicolon (type) |
| tree type; |
| { |
| if (yychar < 0) |
| yychar = yylex (); |
| |
| if ((yychar > 255 |
| && yychar != SCSPEC |
| && yychar != IDENTIFIER |
| && yychar != TYPENAME |
| && yychar != CV_QUALIFIER |
| && yychar != SELFNAME) |
| || end_of_file) |
| { |
| if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (type))) |
| error ("semicolon missing after %s declaration", |
| TREE_CODE (type) == ENUMERAL_TYPE ? "enum" : "struct"); |
| else |
| cp_error ("semicolon missing after declaration of `%T'", type); |
| shadow_tag (build_tree_list (0, type)); |
| } |
| /* Could probably also hack cases where class { ... } f (); appears. */ |
| clear_anon_tags (); |
| } |
| |
| void |
| note_got_semicolon (type) |
| tree type; |
| { |
| if (TREE_CODE_CLASS (TREE_CODE (type)) != 't') |
| my_friendly_abort (60); |
| if (IS_AGGR_TYPE (type)) |
| CLASSTYPE_GOT_SEMICOLON (type) = 1; |
| } |
| |
| void |
| note_list_got_semicolon (declspecs) |
| tree declspecs; |
| { |
| tree link; |
| |
| for (link = declspecs; link; link = TREE_CHAIN (link)) |
| { |
| tree type = TREE_VALUE (link); |
| if (TREE_CODE_CLASS (TREE_CODE (type)) == 't') |
| note_got_semicolon (type); |
| } |
| clear_anon_tags (); |
| } |
| |
| /* If C is not whitespace, return C. |
| Otherwise skip whitespace and return first nonwhite char read. */ |
| |
| static int |
| skip_white_space (c) |
| register int c; |
| { |
| for (;;) |
| { |
| switch (c) |
| { |
| case '\n': |
| c = check_newline (); |
| break; |
| |
| case ' ': |
| case '\t': |
| case '\f': |
| case '\r': |
| case '\v': |
| case '\b': |
| do |
| c = getch (); |
| while (c == ' ' || c == '\t'); |
| break; |
| |
| case '\\': |
| c = getch (); |
| if (c == '\n') |
| lineno++; |
| else |
| error ("stray '\\' in program"); |
| c = getch (); |
| break; |
| |
| default: |
| return (c); |
| } |
| } |
| } |
| |
| |
| |
| /* Make the token buffer longer, preserving the data in it. |
| P should point to just beyond the last valid character in the old buffer. |
| The value we return is a pointer to the new buffer |
| at a place corresponding to P. */ |
| |
| static char * |
| extend_token_buffer (p) |
| char *p; |
| { |
| int offset = p - token_buffer; |
| |
| maxtoken = maxtoken * 2 + 10; |
| token_buffer = (char *) xrealloc (token_buffer, maxtoken + 2); |
| |
| return token_buffer + offset; |
| } |
| |
| static int |
| get_last_nonwhite_on_line () |
| { |
| register int c; |
| |
| /* Is this the last nonwhite stuff on the line? */ |
| if (nextchar >= 0) |
| c = nextchar, nextchar = -1; |
| else |
| c = getch (); |
| |
| while (c == ' ' || c == '\t') |
| c = getch (); |
| return c; |
| } |
| |
| /* At the beginning of a line, increment the line number |
| and process any #-directive on this line. |
| If the line is a #-directive, read the entire line and return a newline. |
| Otherwise, return the line's first non-whitespace character. */ |
| |
| int linemode; |
| |
| #ifdef HANDLE_SYSV_PRAGMA |
| static int handle_sysv_pragma (); |
| #endif |
| static int handle_cp_pragma (); |
| |
| static int |
| check_newline () |
| { |
| register int c; |
| register int token; |
| |
| /* Read first nonwhite char on the line. Do this before incrementing the |
| line number, in case we're at the end of saved text. */ |
| |
| do |
| c = getch (); |
| while (c == ' ' || c == '\t'); |
| |
| lineno++; |
| |
| if (c != '#') |
| { |
| /* If not #, return it so caller will use it. */ |
| return c; |
| } |
| |
| /* Don't read beyond this line. */ |
| linemode = 1; |
| |
| /* Read first nonwhite char after the `#'. */ |
| |
| do |
| c = getch (); |
| while (c == ' ' || c == '\t'); |
| |
| /* If a letter follows, then if the word here is `line', skip |
| it and ignore it; otherwise, ignore the line, with an error |
| if the word isn't `pragma'. */ |
| |
| if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) |
| { |
| if (c == 'p') |
| { |
| if (getch () == 'r' |
| && getch () == 'a' |
| && getch () == 'g' |
| && getch () == 'm' |
| && getch () == 'a') |
| { |
| token = real_yylex (); |
| if (token == IDENTIFIER |
| && TREE_CODE (yylval.ttype) == IDENTIFIER_NODE) |
| { |
| /* If this is 1, we handled it; if it's -1, it was one we |
| wanted but had something wrong with it. Only if it's |
| 0 was it not handled. */ |
| if (handle_cp_pragma (IDENTIFIER_POINTER (yylval.ttype))) |
| goto skipline; |
| } |
| else if (token == END_OF_LINE) |
| goto skipline; |
| |
| #ifdef HANDLE_SYSV_PRAGMA |
| if (handle_sysv_pragma (finput, token)) |
| goto skipline; |
| #else |
| #ifdef HANDLE_PRAGMA |
| if (HANDLE_PRAGMA (finput, yylval.ttype)) |
| goto skipline; |
| #endif |
| #endif |
| } |
| goto skipline; |
| } |
| else if (c == 'd') |
| { |
| if (getch () == 'e' |
| && getch () == 'f' |
| && getch () == 'i' |
| && getch () == 'n' |
| && getch () == 'e' |
| && ((c = getch ()) == ' ' || c == '\t')) |
| { |
| debug_define (lineno, get_directive_line (finput)); |
| goto skipline; |
| } |
| } |
| else if (c == 'u') |
| { |
| if (getch () == 'n' |
| && getch () == 'd' |
| && getch () == 'e' |
| && getch () == 'f' |
| && ((c = getch ()) == ' ' || c == '\t')) |
| { |
| debug_undef (lineno, get_directive_line (finput)); |
| goto skipline; |
| } |
| } |
| else if (c == 'l') |
| { |
| if (getch () == 'i' |
| && getch () == 'n' |
| && getch () == 'e' |
| && ((c = getch ()) == ' ' || c == '\t')) |
| goto linenum; |
| } |
| else if (c == 'i') |
| { |
| if (getch () == 'd' |
| && getch () == 'e' |
| && getch () == 'n' |
| && getch () == 't' |
| && ((c = getch ()) == ' ' || c == '\t')) |
| { |
| #ifdef ASM_OUTPUT_IDENT |
| extern FILE *asm_out_file; |
| #endif |
| /* #ident. The pedantic warning is now in cccp.c. */ |
| |
| /* Here we have just seen `#ident '. |
| A string constant should follow. */ |
| |
| token = real_yylex (); |
| if (token == END_OF_LINE) |
| goto skipline; |
| if (token != STRING |
| || TREE_CODE (yylval.ttype) != STRING_CST) |
| { |
| error ("invalid #ident"); |
| goto skipline; |
| } |
| |
| if (! flag_no_ident) |
| { |
| #ifdef ASM_OUTPUT_IDENT |
| ASM_OUTPUT_IDENT (asm_out_file, |
| TREE_STRING_POINTER (yylval.ttype)); |
| #endif |
| } |
| |
| /* Skip the rest of this line. */ |
| goto skipline; |
| } |
| } |
| else if (c == 'n') |
| { |
| if (getch () == 'e' |
| && getch () == 'w' |
| && getch () == 'w' |
| && getch () == 'o' |
| && getch () == 'r' |
| && getch () == 'l' |
| && getch () == 'd' |
| && ((c = getch ()) == ' ' || c == '\t')) |
| { |
| /* Used to test incremental compilation. */ |
| sorry ("#pragma newworld"); |
| goto skipline; |
| } |
| } |
| error ("undefined or invalid # directive"); |
| goto skipline; |
| } |
| |
| linenum: |
| /* Here we have either `#line' or `# <nonletter>'. |
| In either case, it should be a line number; a digit should follow. */ |
| |
| while (c == ' ' || c == '\t') |
| c = getch (); |
| |
| /* If the # is the only nonwhite char on the line, |
| just ignore it. Check the new newline. */ |
| if (c == EOF) |
| goto skipline; |
| |
| /* Something follows the #; read a token. */ |
| |
| put_back (c); |
| token = real_yylex (); |
| |
| if (token == CONSTANT |
| && TREE_CODE (yylval.ttype) == INTEGER_CST) |
| { |
| int old_lineno = lineno; |
| enum { act_none, act_push, act_pop } action = act_none; |
| int entering_system_header = 0; |
| int entering_c_header = 0; |
| |
| /* subtract one, because it is the following line that |
| gets the specified number */ |
| |
| int l = TREE_INT_CST_LOW (yylval.ttype) - 1; |
| c = get_last_nonwhite_on_line (); |
| if (c == EOF) |
| { |
| /* No more: store the line number and check following line. */ |
| lineno = l; |
| goto skipline; |
| } |
| put_back (c); |
| |
| /* More follows: it must be a string constant (filename). */ |
| |
| /* Read the string constant, but don't treat \ as special. */ |
| ignore_escape_flag = 1; |
| token = real_yylex (); |
| ignore_escape_flag = 0; |
| |
| if (token != STRING || TREE_CODE (yylval.ttype) != STRING_CST) |
| { |
| error ("invalid #line"); |
| goto skipline; |
| } |
| |
| /* Changing files again. This means currently collected time |
| is charged against header time, and body time starts back |
| at 0. */ |
| if (flag_detailed_statistics) |
| { |
| int this_time = my_get_run_time (); |
| tree time_identifier = get_time_identifier (TREE_STRING_POINTER (yylval.ttype)); |
| header_time += this_time - body_time; |
| TREE_INT_CST_LOW (IDENTIFIER_LOCAL_VALUE (this_filename_time)) |
| += this_time - body_time; |
| this_filename_time = time_identifier; |
| body_time = this_time; |
| } |
| |
| input_filename |
| = (char *) permalloc (TREE_STRING_LENGTH (yylval.ttype) + 1); |
| strcpy (input_filename, TREE_STRING_POINTER (yylval.ttype)); |
| lineno = l; |
| GNU_xref_file (input_filename); |
| |
| if (main_input_filename == 0) |
| { |
| struct impl_files *ifiles = impl_file_chain; |
| |
| if (ifiles) |
| { |
| while (ifiles->next) |
| ifiles = ifiles->next; |
| ifiles->filename = FILE_NAME_NONDIRECTORY (input_filename); |
| } |
| |
| main_input_filename = input_filename; |
| if (write_virtuals == 3) |
| walk_vtables (set_typedecl_interface_info, set_vardecl_interface_info); |
| } |
| |
| extract_interface_info (); |
| |
| c = get_last_nonwhite_on_line (); |
| if (c == EOF) |
| { |
| /* Update the name in the top element of input_file_stack. */ |
| if (input_file_stack) |
| input_file_stack->name = input_filename; |
| } |
| else |
| { |
| put_back (c); |
| |
| token = real_yylex (); |
| |
| /* `1' after file name means entering new file. |
| `2' after file name means just left a file. */ |
| |
| if (token == CONSTANT |
| && TREE_CODE (yylval.ttype) == INTEGER_CST) |
| { |
| if (TREE_INT_CST_LOW (yylval.ttype) == 1) |
| action = act_push; |
| else if (TREE_INT_CST_LOW (yylval.ttype) == 2) |
| action = act_pop; |
| |
| if (action) |
| { |
| c = get_last_nonwhite_on_line (); |
| if (c != EOF) |
| { |
| put_back (c); |
| token = real_yylex (); |
| } |
| } |
| } |
| |
| /* `3' after file name means this is a system header file. */ |
| |
| if (token == CONSTANT |
| && TREE_CODE (yylval.ttype) == INTEGER_CST |
| && TREE_INT_CST_LOW (yylval.ttype) == 3) |
| { |
| entering_system_header = 1; |
| |
| c = get_last_nonwhite_on_line (); |
| if (c != EOF) |
| { |
| put_back (c); |
| token = real_yylex (); |
| } |
| } |
| |
| /* `4' after file name means this is a C header file. */ |
| |
| if (token == CONSTANT |
| && TREE_CODE (yylval.ttype) == INTEGER_CST |
| && TREE_INT_CST_LOW (yylval.ttype) == 4) |
| { |
| entering_c_header = 1; |
| |
| c = get_last_nonwhite_on_line (); |
| if (c != EOF) |
| { |
| put_back (c); |
| token = real_yylex (); |
| } |
| } |
| |
| /* Do the actions implied by the preceding numbers. */ |
| |
| if (action == act_push) |
| { |
| /* Pushing to a new file. */ |
| struct file_stack *p; |
| |
| p = (struct file_stack *) xmalloc (sizeof (struct file_stack)); |
| input_file_stack->line = old_lineno; |
| p->next = input_file_stack; |
| p->name = input_filename; |
| input_file_stack = p; |
| input_file_stack_tick++; |
| debug_start_source_file (input_filename); |
| in_system_header = entering_system_header; |
| if (c_header_level) |
| ++c_header_level; |
| else if (entering_c_header) |
| { |
| c_header_level = 1; |
| ++pending_lang_change; |
| } |
| } |
| else if (action == act_pop) |
| { |
| /* Popping out of a file. */ |
| if (input_file_stack->next) |
| { |
| struct file_stack *p; |
| |
| if (c_header_level && --c_header_level == 0) |
| { |
| if (entering_c_header) |
| warning ("badly nested C headers from preprocessor"); |
| --pending_lang_change; |
| } |
| in_system_header = entering_system_header; |
| |
| p = input_file_stack; |
| input_file_stack = p->next; |
| free (p); |
| input_file_stack_tick++; |
| debug_end_source_file (input_file_stack->line); |
| } |
| else |
| error ("#-lines for entering and leaving files don't match"); |
| } |
| else |
| in_system_header = entering_system_header; |
| } |
| |
| /* If NEXTCHAR is not end of line, we don't care what it is. */ |
| if (nextchar == EOF) |
| c = EOF; |
| } |
| else |
| error ("invalid #-line"); |
| |
| /* skip the rest of this line. */ |
| skipline: |
| linemode = 0; |
| end_of_file = 0; |
| nextchar = -1; |
| while ((c = getch ()) != EOF && c != '\n'); |
| return c; |
| } |
| |
| void |
| do_pending_lang_change () |
| { |
| for (; pending_lang_change > 0; --pending_lang_change) |
| push_lang_context (lang_name_c); |
| for (; pending_lang_change < 0; ++pending_lang_change) |
| pop_lang_context (); |
| } |
| |
| #if 0 |
| #define isalnum(char) (char >= 'a' ? char <= 'z' : char >= '0' ? char <= '9' || (char >= 'A' && char <= 'Z') : 0) |
| #define isdigit(char) (char >= '0' && char <= '9') |
| #else |
| #include <ctype.h> |
| #endif |
| |
| #define ENDFILE -1 /* token that represents end-of-file */ |
| |
| /* Read an escape sequence, returning its equivalent as a character, |
| or store 1 in *ignore_ptr if it is backslash-newline. */ |
| |
| static int |
| readescape (ignore_ptr) |
| int *ignore_ptr; |
| { |
| register int c = getch (); |
| register int code; |
| register unsigned count; |
| unsigned firstdig; |
| int nonnull; |
| |
| switch (c) |
| { |
| case 'x': |
| code = 0; |
| count = 0; |
| nonnull = 0; |
| while (1) |
| { |
| c = getch (); |
| if (! isxdigit (c)) |
| { |
| put_back (c); |
| break; |
| } |
| code *= 16; |
| if (c >= 'a' && c <= 'f') |
| code += c - 'a' + 10; |
| if (c >= 'A' && c <= 'F') |
| code += c - 'A' + 10; |
| if (c >= '0' && c <= '9') |
| code += c - '0'; |
| if (code != 0 || count != 0) |
| { |
| if (count == 0) |
| firstdig = code; |
| count++; |
| } |
| nonnull = 1; |
| } |
| if (! nonnull) |
| error ("\\x used with no following hex digits"); |
| else if (count == 0) |
| /* Digits are all 0's. Ok. */ |
| ; |
| else if ((count - 1) * 4 >= TYPE_PRECISION (integer_type_node) |
| || (count > 1 |
| && ((1 << (TYPE_PRECISION (integer_type_node) - (count - 1) * 4)) |
| <= firstdig))) |
| pedwarn ("hex escape out of range"); |
| return code; |
| |
| case '0': case '1': case '2': case '3': case '4': |
| case '5': case '6': case '7': |
| code = 0; |
| count = 0; |
| while ((c <= '7') && (c >= '0') && (count++ < 3)) |
| { |
| code = (code * 8) + (c - '0'); |
| c = getch (); |
| } |
| put_back (c); |
| return code; |
| |
| case '\\': case '\'': case '"': |
| return c; |
| |
| case '\n': |
| lineno++; |
| *ignore_ptr = 1; |
| return 0; |
| |
| case 'n': |
| return TARGET_NEWLINE; |
| |
| case 't': |
| return TARGET_TAB; |
| |
| case 'r': |
| return TARGET_CR; |
| |
| case 'f': |
| return TARGET_FF; |
| |
| case 'b': |
| return TARGET_BS; |
| |
| case 'a': |
| return TARGET_BELL; |
| |
| case 'v': |
| return TARGET_VT; |
| |
| case 'e': |
| case 'E': |
| if (pedantic) |
| pedwarn ("non-ANSI-standard escape sequence, `\\%c'", c); |
| return 033; |
| |
| case '?': |
| return c; |
| |
| /* `\(', etc, are used at beginning of line to avoid confusing Emacs. */ |
| case '(': |
| case '{': |
| case '[': |
| /* `\%' is used to prevent SCCS from getting confused. */ |
| case '%': |
| if (pedantic) |
| pedwarn ("unknown escape sequence `\\%c'", c); |
| return c; |
| } |
| if (c >= 040 && c < 0177) |
| pedwarn ("unknown escape sequence `\\%c'", c); |
| else |
| pedwarn ("unknown escape sequence: `\\' followed by char code 0x%x", c); |
| return c; |
| } |
| |
| /* Value is 1 (or 2) if we should try to make the next identifier look like |
| a typename (when it may be a local variable or a class variable). |
| Value is 0 if we treat this name in a default fashion. */ |
| int looking_for_typename = 0; |
| |
| #ifdef __GNUC__ |
| extern __inline int identifier_type (); |
| __inline |
| #endif |
| int |
| identifier_type (decl) |
| tree decl; |
| { |
| if (TREE_CODE (decl) == TEMPLATE_DECL) |
| { |
| if (TREE_CODE (DECL_RESULT (decl)) == TYPE_DECL) |
| return PTYPENAME; |
| } |
| if (TREE_CODE (decl) == NAMESPACE_DECL) |
| return NSNAME; |
| if (TREE_CODE (decl) != TYPE_DECL) |
| return IDENTIFIER; |
| if (((got_scope && TREE_TYPE (decl) == got_scope) |
| || TREE_TYPE (decl) == current_class_type) |
| && DECL_ARTIFICIAL (decl)) |
| return SELFNAME; |
| return TYPENAME; |
| } |
| |
| void |
| see_typename () |
| { |
| looking_for_typename = 1; |
| if (yychar < 0) |
| if ((yychar = yylex ()) < 0) yychar = 0; |
| looking_for_typename = 0; |
| if (yychar == IDENTIFIER) |
| { |
| lastiddecl = lookup_name (yylval.ttype, -2); |
| if (lastiddecl == 0) |
| { |
| if (flag_labels_ok) |
| lastiddecl = IDENTIFIER_LABEL_VALUE (yylval.ttype); |
| } |
| else |
| yychar = identifier_type (lastiddecl); |
| } |
| } |
| |
| tree |
| do_identifier (token, parsing) |
| register tree token; |
| int parsing; |
| { |
| register tree id; |
| |
| if (! parsing || IDENTIFIER_OPNAME_P (token)) |
| id = lookup_name (token, 0); |
| else |
| id = lastiddecl; |
| |
| if (parsing && yychar == YYEMPTY) |
| yychar = yylex (); |
| /* Scope class declarations before global |
| declarations. */ |
| if (id == IDENTIFIER_GLOBAL_VALUE (token) |
| && current_class_type != 0 |
| && TYPE_SIZE (current_class_type) == 0) |
| { |
| /* Could be from one of the base classes. */ |
| tree field = lookup_field (current_class_type, token, 1, 0); |
| if (field == 0) |
| ; |
| else if (field == error_mark_node) |
| /* We have already generated the error message. |
| But we still want to return this value. */ |
| id = lookup_field (current_class_type, token, 0, 0); |
| else if (TREE_CODE (field) == VAR_DECL |
| || TREE_CODE (field) == CONST_DECL) |
| id = field; |
| else if (TREE_CODE (field) != FIELD_DECL) |
| my_friendly_abort (61); |
| else |
| { |
| cp_error ("invalid use of member `%D' from base class `%T'", field, |
| DECL_FIELD_CONTEXT (field)); |
| id = error_mark_node; |
| return id; |
| } |
| } |
| |
| /* Remember that this name has been used in the class definition, as per |
| [class.scope0] */ |
| if (id && current_class_type && parsing |
| && TYPE_BEING_DEFINED (current_class_type) |
| && ! IDENTIFIER_CLASS_VALUE (token) |
| /* Avoid breaking if we get called for a default argument that |
| refers to an overloaded method. Eventually this will not be |
| necessary, since default arguments shouldn't be parsed until |
| after the class is complete. (jason 3/12/97) */ |
| && TREE_CODE (id) != TREE_LIST) |
| pushdecl_class_level (id); |
| |
| if (!id || id == error_mark_node) |
| { |
| if (id == error_mark_node && current_class_type != NULL_TREE) |
| { |
| id = lookup_nested_field (token, 1); |
| /* In lookup_nested_field(), we marked this so we can gracefully |
| leave this whole mess. */ |
| if (id && id != error_mark_node && TREE_TYPE (id) == error_mark_node) |
| return id; |
| } |
| |
| if (current_template_parms) |
| return build_min_nt (LOOKUP_EXPR, token, NULL_TREE); |
| else if (IDENTIFIER_OPNAME_P (token)) |
| { |
| if (token != ansi_opname[ERROR_MARK]) |
| cp_error ("`%D' not defined", token); |
| id = error_mark_node; |
| } |
| else if (parsing && (yychar == '(' || yychar == LEFT_RIGHT)) |
| { |
| id = implicitly_declare (token); |
| } |
| else if (current_function_decl == 0) |
| { |
| cp_error ("`%D' was not declared in this scope", token); |
| id = error_mark_node; |
| } |
| else |
| { |
| if (IDENTIFIER_GLOBAL_VALUE (token) != error_mark_node |
| || IDENTIFIER_ERROR_LOCUS (token) != current_function_decl) |
| { |
| static int undeclared_variable_notice; |
| |
| cp_error ("`%D' undeclared (first use this function)", token); |
| |
| if (! undeclared_variable_notice) |
| { |
| error ("(Each undeclared identifier is reported only once"); |
| error ("for each function it appears in.)"); |
| undeclared_variable_notice = 1; |
| } |
| } |
| id = error_mark_node; |
| /* Prevent repeated error messages. */ |
| IDENTIFIER_GLOBAL_VALUE (token) = error_mark_node; |
| SET_IDENTIFIER_ERROR_LOCUS (token, current_function_decl); |
| } |
| } |
| |
| if (TREE_CODE (id) == VAR_DECL && DECL_DEAD_FOR_LOCAL (id)) |
| { |
| tree shadowed = DECL_SHADOWED_FOR_VAR (id); |
| while (shadowed != NULL_TREE && TREE_CODE (shadowed) == VAR_DECL |
| && DECL_DEAD_FOR_LOCAL (shadowed)) |
| shadowed = DECL_SHADOWED_FOR_VAR (shadowed); |
| if (!shadowed) |
| shadowed = IDENTIFIER_GLOBAL_VALUE (DECL_NAME (id)); |
| if (shadowed) |
| { |
| if (!DECL_ERROR_REPORTED (id)) |
| { |
| warning ("name lookup of `%s' changed", |
| IDENTIFIER_POINTER (token)); |
| cp_warning_at (" matches this `%D' under current ANSI rules", |
| shadowed); |
| cp_warning_at (" matches this `%D' under old rules", id); |
| DECL_ERROR_REPORTED (id) = 1; |
| } |
| id = shadowed; |
| } |
| else if (!DECL_ERROR_REPORTED (id)) |
| { |
| static char msg[] |
| = "name lookup of `%s' changed for new ANSI `for' scoping"; |
| DECL_ERROR_REPORTED (id) = 1; |
| if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (id))) |
| { |
| error (msg, IDENTIFIER_POINTER (token)); |
| cp_error_at (" cannot use obsolete binding at `%D' because it has a destructor", id); |
| id = error_mark_node; |
| } |
| else |
| { |
| pedwarn (msg, IDENTIFIER_POINTER (token)); |
| cp_pedwarn_at (" using obsolete binding at `%D'", id); |
| } |
| } |
| } |
| /* TREE_USED is set in `hack_identifier'. */ |
| if (TREE_CODE (id) == CONST_DECL) |
| { |
| if (IDENTIFIER_CLASS_VALUE (token) == id) |
| { |
| /* Check access. */ |
| tree access = compute_access (TYPE_BINFO (current_class_type), id); |
| if (access == access_private_node) |
| cp_error ("enum `%D' is private", id); |
| /* protected is OK, since it's an enum of `this'. */ |
| } |
| if (! processing_template_decl |
| || (DECL_INITIAL (id) |
| && TREE_CODE (DECL_INITIAL (id)) == TEMPLATE_CONST_PARM)) |
| id = DECL_INITIAL (id); |
| } |
| else |
| id = hack_identifier (id, token); |
| |
| if (current_template_parms) |
| { |
| if (is_overloaded_fn (id)) |
| { |
| tree t = build_min (LOOKUP_EXPR, unknown_type_node, |
| token, get_first_fn (id)); |
| if (id != IDENTIFIER_GLOBAL_VALUE (token)) |
| TREE_OPERAND (t, 1) = error_mark_node; |
| id = t; |
| } |
| else if (! TREE_PERMANENT (id) || TREE_CODE (id) == PARM_DECL |
| || TREE_CODE (id) == USING_DECL) |
| id = build_min (LOOKUP_EXPR, TREE_TYPE (id), token, error_mark_node); |
| /* else just use the decl */ |
| } |
| |
| return id; |
| } |
| |
| tree |
| do_scoped_id (token, parsing) |
| tree token; |
| int parsing; |
| { |
| tree id = IDENTIFIER_GLOBAL_VALUE (token); |
| if (parsing && yychar == YYEMPTY) |
| yychar = yylex (); |
| if (! id) |
| { |
| if (processing_template_decl) |
| { |
| id = build_min_nt (LOOKUP_EXPR, token, NULL_TREE); |
| LOOKUP_EXPR_GLOBAL (id) = 1; |
| return id; |
| } |
| if (parsing && yychar == '(' || yychar == LEFT_RIGHT) |
| id = implicitly_declare (token); |
| else |
| { |
| if (IDENTIFIER_GLOBAL_VALUE (token) != error_mark_node) |
| error ("undeclared variable `%s' (first use here)", |
| IDENTIFIER_POINTER (token)); |
| id = error_mark_node; |
| /* Prevent repeated error messages. */ |
| IDENTIFIER_GLOBAL_VALUE (token) = error_mark_node; |
| } |
| } |
| else |
| { |
| if (TREE_CODE (id) == ADDR_EXPR) |
| mark_used (TREE_OPERAND (id, 0)); |
| else if (TREE_CODE (id) != TREE_LIST) |
| mark_used (id); |
| } |
| if (TREE_CODE (id) == CONST_DECL && ! processing_template_decl) |
| { |
| /* XXX CHS - should we set TREE_USED of the constant? */ |
| id = DECL_INITIAL (id); |
| /* This is to prevent an enum whose value is 0 |
| from being considered a null pointer constant. */ |
| id = build1 (NOP_EXPR, TREE_TYPE (id), id); |
| TREE_CONSTANT (id) = 1; |
| } |
| |
| if (processing_template_decl) |
| { |
| if (is_overloaded_fn (id)) |
| { |
| id = build_min (LOOKUP_EXPR, unknown_type_node, |
| token, get_first_fn (id)); |
| LOOKUP_EXPR_GLOBAL (id) = 1; |
| } |
| /* else just use the decl */ |
| } |
| return convert_from_reference (id); |
| } |
| |
| tree |
| identifier_typedecl_value (node) |
| tree node; |
| { |
| tree t, type; |
| type = IDENTIFIER_TYPE_VALUE (node); |
| if (type == NULL_TREE) |
| return NULL_TREE; |
| #define do(X) \ |
| { \ |
| t = (X); \ |
| if (t && TREE_CODE (t) == TYPE_DECL && TREE_TYPE (t) == type) \ |
| return t; \ |
| } |
| do (IDENTIFIER_LOCAL_VALUE (node)); |
| do (IDENTIFIER_CLASS_VALUE (node)); |
| do (IDENTIFIER_GLOBAL_VALUE (node)); |
| #undef do |
| /* Will this one ever happen? */ |
| if (TYPE_MAIN_DECL (type)) |
| return TYPE_MAIN_DECL (type); |
| |
| /* We used to do an internal error of 62 here, but instead we will |
| handle the return of a null appropriately in the callers. */ |
| return NULL_TREE; |
| } |
| |
| int |
| real_yylex () |
| { |
| register int c; |
| register int value; |
| int wide_flag = 0; |
| int dollar_seen = 0; |
| int i; |
| |
| if (nextchar >= 0) |
| c = nextchar, nextchar = -1; |
| else |
| c = getch (); |
| |
| /* Effectively do c = skip_white_space (c) |
| but do it faster in the usual cases. */ |
| while (1) |
| switch (c) |
| { |
| case ' ': |
| case '\t': |
| case '\f': |
| case '\v': |
| case '\b': |
| c = getch (); |
| break; |
| |
| case '\r': |
| /* Call skip_white_space so we can warn if appropriate. */ |
| |
| case '\n': |
| case '/': |
| case '\\': |
| c = skip_white_space (c); |
| default: |
| goto found_nonwhite; |
| } |
| found_nonwhite: |
| |
| token_buffer[0] = c; |
| token_buffer[1] = 0; |
| |
| /* yylloc.first_line = lineno; */ |
| |
| switch (c) |
| { |
| case EOF: |
| token_buffer[0] = '\0'; |
| end_of_file = 1; |
| if (input_redirected ()) |
| value = END_OF_SAVED_INPUT; |
| else if (linemode) |
| value = END_OF_LINE; |
| else |
| value = ENDFILE; |
| break; |
| |
| case '$': |
| if (dollars_in_ident) |
| { |
| dollar_seen = 1; |
| goto letter; |
| } |
| value = '$'; |
| goto done; |
| |
| case 'L': |
| /* Capital L may start a wide-string or wide-character constant. */ |
| { |
| register int c = getch (); |
|