2 Copyright (C) 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 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 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
26 #include "dyn-string.h"
34 #include "diagnostic.h"
42 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
43 and c-lex.c) and the C++ parser. */
47 typedef struct cp_token GTY (())
49 /* The kind of token. */
50 ENUM_BITFIELD (cpp_ttype) type : 8;
51 /* If this token is a keyword, this value indicates which keyword.
52 Otherwise, this value is RID_MAX. */
53 ENUM_BITFIELD (rid) keyword : 8;
56 /* True if this token is from a system header. */
57 BOOL_BITFIELD in_system_header : 1;
58 /* True if this token is from a context where it is implicitly extern "C" */
59 BOOL_BITFIELD implicit_extern_c : 1;
60 /* The value associated with this token, if any. */
62 /* The location at which this token was found. */
66 /* We use a stack of token pointer for saving token sets. */
67 typedef struct cp_token *cp_token_position;
68 DEF_VEC_MALLOC_P (cp_token_position);
70 static const cp_token eof_token =
72 CPP_EOF, RID_MAX, 0, 0, 0, NULL_TREE,
73 #if USE_MAPPED_LOCATION
80 /* The cp_lexer structure represents the C++ lexer. It is responsible
81 for managing the token stream from the preprocessor and supplying
82 it to the parser. Tokens are never added to the cp_lexer after
85 typedef struct cp_lexer GTY (())
87 /* The memory allocated for the buffer. NULL if this lexer does not
88 own the token buffer. */
89 cp_token * GTY ((length ("%h.buffer_length"))) buffer;
90 /* If the lexer owns the buffer, this is the number of tokens in the
94 /* A pointer just past the last available token. The tokens
95 in this lexer are [buffer, last_token). */
96 cp_token_position GTY ((skip)) last_token;
98 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
99 no more available tokens. */
100 cp_token_position GTY ((skip)) next_token;
102 /* A stack indicating positions at which cp_lexer_save_tokens was
103 called. The top entry is the most recent position at which we
104 began saving tokens. If the stack is non-empty, we are saving
106 VEC (cp_token_position) *GTY ((skip)) saved_tokens;
108 /* True if we should output debugging information. */
111 /* The next lexer in a linked list of lexers. */
112 struct cp_lexer *next;
115 /* cp_token_cache is a range of tokens. There is no need to represent
116 allocate heap memory for it, since tokens are never removed from the
117 lexer's array. There is also no need for the GC to walk through
118 a cp_token_cache, since everything in here is referenced through
121 typedef struct cp_token_cache GTY(())
123 /* The beginning of the token range. */
124 cp_token * GTY((skip)) first;
126 /* Points immediately after the last token in the range. */
127 cp_token * GTY ((skip)) last;
132 static cp_lexer *cp_lexer_new_main
134 static cp_lexer *cp_lexer_new_from_tokens
135 (cp_token_cache *tokens);
136 static void cp_lexer_destroy
138 static int cp_lexer_saving_tokens
140 static cp_token_position cp_lexer_token_position
142 static cp_token *cp_lexer_token_at
143 (cp_lexer *, cp_token_position);
144 static void cp_lexer_get_preprocessor_token
145 (cp_lexer *, cp_token *);
146 static inline cp_token *cp_lexer_peek_token
148 static cp_token *cp_lexer_peek_nth_token
149 (cp_lexer *, size_t);
150 static inline bool cp_lexer_next_token_is
151 (cp_lexer *, enum cpp_ttype);
152 static bool cp_lexer_next_token_is_not
153 (cp_lexer *, enum cpp_ttype);
154 static bool cp_lexer_next_token_is_keyword
155 (cp_lexer *, enum rid);
156 static cp_token *cp_lexer_consume_token
158 static void cp_lexer_purge_token
160 static void cp_lexer_purge_tokens_after
161 (cp_lexer *, cp_token_position);
162 static void cp_lexer_handle_pragma
164 static void cp_lexer_save_tokens
166 static void cp_lexer_commit_tokens
168 static void cp_lexer_rollback_tokens
170 #ifdef ENABLE_CHECKING
171 static void cp_lexer_print_token
172 (FILE *, cp_token *);
173 static inline bool cp_lexer_debugging_p
175 static void cp_lexer_start_debugging
176 (cp_lexer *) ATTRIBUTE_UNUSED;
177 static void cp_lexer_stop_debugging
178 (cp_lexer *) ATTRIBUTE_UNUSED;
180 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
181 about passing NULL to functions that require non-NULL arguments
182 (fputs, fprintf). It will never be used, so all we need is a value
183 of the right type that's guaranteed not to be NULL. */
184 #define cp_lexer_debug_stream stdout
185 #define cp_lexer_print_token(str, tok) (void) 0
186 #define cp_lexer_debugging_p(lexer) 0
187 #endif /* ENABLE_CHECKING */
189 static cp_token_cache *cp_token_cache_new
190 (cp_token *, cp_token *);
192 /* Manifest constants. */
193 #define CP_LEXER_BUFFER_SIZE 10000
194 #define CP_SAVED_TOKEN_STACK 5
196 /* A token type for keywords, as opposed to ordinary identifiers. */
197 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
199 /* A token type for template-ids. If a template-id is processed while
200 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
201 the value of the CPP_TEMPLATE_ID is whatever was returned by
202 cp_parser_template_id. */
203 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
205 /* A token type for nested-name-specifiers. If a
206 nested-name-specifier is processed while parsing tentatively, it is
207 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
208 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
209 cp_parser_nested_name_specifier_opt. */
210 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
212 /* A token type for tokens that are not tokens at all; these are used
213 to represent slots in the array where there used to be a token
214 that has now been deleted. */
215 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
217 /* The number of token types, including C++-specific ones. */
218 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
222 #ifdef ENABLE_CHECKING
223 /* The stream to which debugging output should be written. */
224 static FILE *cp_lexer_debug_stream;
225 #endif /* ENABLE_CHECKING */
227 /* Create a new main C++ lexer, the lexer that gets tokens from the
231 cp_lexer_new_main (void)
233 cp_token first_token;
240 /* Tell cpplib we want CPP_PRAGMA tokens. */
241 cpp_get_options (parse_in)->defer_pragmas = true;
243 /* Tell c_lex not to merge string constants. */
244 c_lex_return_raw_strings = true;
246 /* It's possible that lexing the first token will load a PCH file,
247 which is a GC collection point. So we have to grab the first
248 token before allocating any memory. */
249 cp_lexer_get_preprocessor_token (NULL, &first_token);
250 c_common_no_more_pch ();
252 /* Allocate the memory. */
253 lexer = GGC_CNEW (cp_lexer);
255 #ifdef ENABLE_CHECKING
256 /* Initially we are not debugging. */
257 lexer->debugging_p = false;
258 #endif /* ENABLE_CHECKING */
259 lexer->saved_tokens = VEC_alloc (cp_token_position, CP_SAVED_TOKEN_STACK);
261 /* Create the buffer. */
262 alloc = CP_LEXER_BUFFER_SIZE;
263 buffer = ggc_alloc (alloc * sizeof (cp_token));
265 /* Put the first token in the buffer. */
270 /* Get the remaining tokens from the preprocessor. */
271 while (pos->type != CPP_EOF)
278 buffer = ggc_realloc (buffer, alloc * sizeof (cp_token));
279 pos = buffer + space;
281 cp_lexer_get_preprocessor_token (lexer, pos);
283 lexer->buffer = buffer;
284 lexer->buffer_length = alloc - space;
285 lexer->last_token = pos;
286 lexer->next_token = lexer->buffer_length ? buffer : (cp_token *)&eof_token;
288 /* Pragma processing (via cpp_handle_deferred_pragma) may result in
289 direct calls to c_lex. Those callers all expect c_lex to do
290 string constant concatenation. */
291 c_lex_return_raw_strings = false;
293 gcc_assert (lexer->next_token->type != CPP_PURGED);
297 /* Create a new lexer whose token stream is primed with the tokens in
298 CACHE. When these tokens are exhausted, no new tokens will be read. */
301 cp_lexer_new_from_tokens (cp_token_cache *cache)
303 cp_token *first = cache->first;
304 cp_token *last = cache->last;
305 cp_lexer *lexer = GGC_CNEW (cp_lexer);
307 /* We do not own the buffer. */
308 lexer->buffer = NULL;
309 lexer->buffer_length = 0;
310 lexer->next_token = first == last ? (cp_token *)&eof_token : first;
311 lexer->last_token = last;
313 lexer->saved_tokens = VEC_alloc (cp_token_position, CP_SAVED_TOKEN_STACK);
315 #ifdef ENABLE_CHECKING
316 /* Initially we are not debugging. */
317 lexer->debugging_p = false;
320 gcc_assert (lexer->next_token->type != CPP_PURGED);
324 /* Frees all resources associated with LEXER. */
327 cp_lexer_destroy (cp_lexer *lexer)
330 ggc_free (lexer->buffer);
331 VEC_free (cp_token_position, lexer->saved_tokens);
335 /* Returns nonzero if debugging information should be output. */
337 #ifdef ENABLE_CHECKING
340 cp_lexer_debugging_p (cp_lexer *lexer)
342 return lexer->debugging_p;
345 #endif /* ENABLE_CHECKING */
347 static inline cp_token_position
348 cp_lexer_token_position (cp_lexer *lexer, bool previous_p)
350 gcc_assert (!previous_p || lexer->next_token != &eof_token);
352 return lexer->next_token - previous_p;
355 static inline cp_token *
356 cp_lexer_token_at (cp_lexer *lexer ATTRIBUTE_UNUSED, cp_token_position pos)
361 /* nonzero if we are presently saving tokens. */
364 cp_lexer_saving_tokens (const cp_lexer* lexer)
366 return VEC_length (cp_token_position, lexer->saved_tokens) != 0;
369 /* Store the next token from the preprocessor in *TOKEN. Return true
373 cp_lexer_get_preprocessor_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
376 static int is_extern_c = 0;
378 /* Get a new token from the preprocessor. */
379 token->type = c_lex_with_flags (&token->value, &token->flags);
380 token->location = input_location;
381 token->in_system_header = in_system_header;
383 /* On some systems, some header files are surrounded by an
384 implicit extern "C" block. Set a flag in the token if it
385 comes from such a header. */
386 is_extern_c += pending_lang_change;
387 pending_lang_change = 0;
388 token->implicit_extern_c = is_extern_c > 0;
390 /* Check to see if this token is a keyword. */
391 if (token->type == CPP_NAME
392 && C_IS_RESERVED_WORD (token->value))
394 /* Mark this token as a keyword. */
395 token->type = CPP_KEYWORD;
396 /* Record which keyword. */
397 token->keyword = C_RID_CODE (token->value);
398 /* Update the value. Some keywords are mapped to particular
399 entities, rather than simply having the value of the
400 corresponding IDENTIFIER_NODE. For example, `__const' is
401 mapped to `const'. */
402 token->value = ridpointers[token->keyword];
405 token->keyword = RID_MAX;
408 /* Update the globals input_location and in_system_header from TOKEN. */
410 cp_lexer_set_source_position_from_token (cp_token *token)
412 if (token->type != CPP_EOF)
414 input_location = token->location;
415 in_system_header = token->in_system_header;
419 /* Return a pointer to the next token in the token stream, but do not
422 static inline cp_token *
423 cp_lexer_peek_token (cp_lexer *lexer)
425 if (cp_lexer_debugging_p (lexer))
427 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream);
428 cp_lexer_print_token (cp_lexer_debug_stream, lexer->next_token);
429 putc ('\n', cp_lexer_debug_stream);
431 return lexer->next_token;
434 /* Return true if the next token has the indicated TYPE. */
437 cp_lexer_next_token_is (cp_lexer* lexer, enum cpp_ttype type)
439 return cp_lexer_peek_token (lexer)->type == type;
442 /* Return true if the next token does not have the indicated TYPE. */
445 cp_lexer_next_token_is_not (cp_lexer* lexer, enum cpp_ttype type)
447 return !cp_lexer_next_token_is (lexer, type);
450 /* Return true if the next token is the indicated KEYWORD. */
453 cp_lexer_next_token_is_keyword (cp_lexer* lexer, enum rid keyword)
457 /* Peek at the next token. */
458 token = cp_lexer_peek_token (lexer);
459 /* Check to see if it is the indicated keyword. */
460 return token->keyword == keyword;
463 /* Return a pointer to the Nth token in the token stream. If N is 1,
464 then this is precisely equivalent to cp_lexer_peek_token (except
465 that it is not inline). One would like to disallow that case, but
466 there is one case (cp_parser_nth_token_starts_template_id) where
467 the caller passes a variable for N and it might be 1. */
470 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
474 /* N is 1-based, not zero-based. */
475 gcc_assert (n > 0 && lexer->next_token != &eof_token);
477 if (cp_lexer_debugging_p (lexer))
478 fprintf (cp_lexer_debug_stream,
479 "cp_lexer: peeking ahead %ld at token: ", (long)n);
482 token = lexer->next_token;
486 if (token == lexer->last_token)
488 token = (cp_token *)&eof_token;
492 if (token->type != CPP_PURGED)
496 if (cp_lexer_debugging_p (lexer))
498 cp_lexer_print_token (cp_lexer_debug_stream, token);
499 putc ('\n', cp_lexer_debug_stream);
505 /* Return the next token, and advance the lexer's next_token pointer
506 to point to the next non-purged token. */
509 cp_lexer_consume_token (cp_lexer* lexer)
511 cp_token *token = lexer->next_token;
513 gcc_assert (token != &eof_token);
518 if (lexer->next_token == lexer->last_token)
520 lexer->next_token = (cp_token *)&eof_token;
525 while (lexer->next_token->type == CPP_PURGED);
527 cp_lexer_set_source_position_from_token (token);
529 /* Provide debugging output. */
530 if (cp_lexer_debugging_p (lexer))
532 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
533 cp_lexer_print_token (cp_lexer_debug_stream, token);
534 putc ('\n', cp_lexer_debug_stream);
540 /* Permanently remove the next token from the token stream, and
541 advance the next_token pointer to refer to the next non-purged
545 cp_lexer_purge_token (cp_lexer *lexer)
547 cp_token *tok = lexer->next_token;
549 gcc_assert (tok != &eof_token);
550 tok->type = CPP_PURGED;
551 tok->location = UNKNOWN_LOCATION;
552 tok->value = NULL_TREE;
553 tok->keyword = RID_MAX;
558 if (tok == lexer->last_token)
560 tok = (cp_token *)&eof_token;
564 while (tok->type == CPP_PURGED);
565 lexer->next_token = tok;
568 /* Permanently remove all tokens after TOK, up to, but not
569 including, the token that will be returned next by
570 cp_lexer_peek_token. */
573 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
575 cp_token *peek = lexer->next_token;
577 if (peek == &eof_token)
578 peek = lexer->last_token;
580 gcc_assert (tok < peek);
582 for ( tok += 1; tok != peek; tok += 1)
584 tok->type = CPP_PURGED;
585 tok->location = UNKNOWN_LOCATION;
586 tok->value = NULL_TREE;
587 tok->keyword = RID_MAX;
591 /* Consume and handle a pragma token. */
593 cp_lexer_handle_pragma (cp_lexer *lexer)
596 cp_token *token = cp_lexer_consume_token (lexer);
597 gcc_assert (token->type == CPP_PRAGMA);
598 gcc_assert (token->value);
600 s.len = TREE_STRING_LENGTH (token->value);
601 s.text = (const unsigned char *) TREE_STRING_POINTER (token->value);
603 cpp_handle_deferred_pragma (parse_in, &s);
605 /* Clearing token->value here means that we will get an ICE if we
606 try to process this #pragma again (which should be impossible). */
610 /* Begin saving tokens. All tokens consumed after this point will be
614 cp_lexer_save_tokens (cp_lexer* lexer)
616 /* Provide debugging output. */
617 if (cp_lexer_debugging_p (lexer))
618 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
620 VEC_safe_push (cp_token_position, lexer->saved_tokens, lexer->next_token);
623 /* Commit to the portion of the token stream most recently saved. */
626 cp_lexer_commit_tokens (cp_lexer* lexer)
628 /* Provide debugging output. */
629 if (cp_lexer_debugging_p (lexer))
630 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
632 VEC_pop (cp_token_position, lexer->saved_tokens);
635 /* Return all tokens saved since the last call to cp_lexer_save_tokens
636 to the token stream. Stop saving tokens. */
639 cp_lexer_rollback_tokens (cp_lexer* lexer)
641 /* Provide debugging output. */
642 if (cp_lexer_debugging_p (lexer))
643 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
645 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
648 /* Print a representation of the TOKEN on the STREAM. */
650 #ifdef ENABLE_CHECKING
653 cp_lexer_print_token (FILE * stream, cp_token *token)
655 /* We don't use cpp_type2name here because the parser defines
656 a few tokens of its own. */
657 static const char *const token_names[] = {
658 /* cpplib-defined token types */
664 /* C++ parser token types - see "Manifest constants", above. */
667 "NESTED_NAME_SPECIFIER",
671 /* If we have a name for the token, print it out. Otherwise, we
672 simply give the numeric code. */
673 gcc_assert (token->type < ARRAY_SIZE(token_names));
674 fputs (token_names[token->type], stream);
676 /* For some tokens, print the associated data. */
680 /* Some keywords have a value that is not an IDENTIFIER_NODE.
681 For example, `struct' is mapped to an INTEGER_CST. */
682 if (TREE_CODE (token->value) != IDENTIFIER_NODE)
684 /* else fall through */
686 fputs (IDENTIFIER_POINTER (token->value), stream);
692 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->value));
700 /* Start emitting debugging information. */
703 cp_lexer_start_debugging (cp_lexer* lexer)
705 ++lexer->debugging_p;
708 /* Stop emitting debugging information. */
711 cp_lexer_stop_debugging (cp_lexer* lexer)
713 --lexer->debugging_p;
716 #endif /* ENABLE_CHECKING */
718 /* Create a new cp_token_cache, representing a range of tokens. */
720 static cp_token_cache *
721 cp_token_cache_new (cp_token *first, cp_token *last)
723 cp_token_cache *cache = GGC_NEW (cp_token_cache);
724 cache->first = first;
730 /* Decl-specifiers. */
732 static void clear_decl_specs
733 (cp_decl_specifier_seq *);
735 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
738 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
740 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
745 /* Nothing other than the parser should be creating declarators;
746 declarators are a semi-syntactic representation of C++ entities.
747 Other parts of the front end that need to create entities (like
748 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
750 static cp_declarator *make_id_declarator
752 static cp_declarator *make_call_declarator
753 (cp_declarator *, cp_parameter_declarator *, cp_cv_quals, tree);
754 static cp_declarator *make_array_declarator
755 (cp_declarator *, tree);
756 static cp_declarator *make_pointer_declarator
757 (cp_cv_quals, cp_declarator *);
758 static cp_declarator *make_reference_declarator
759 (cp_cv_quals, cp_declarator *);
760 static cp_parameter_declarator *make_parameter_declarator
761 (cp_decl_specifier_seq *, cp_declarator *, tree);
762 static cp_declarator *make_ptrmem_declarator
763 (cp_cv_quals, tree, cp_declarator *);
765 cp_declarator *cp_error_declarator;
767 /* The obstack on which declarators and related data structures are
769 static struct obstack declarator_obstack;
771 /* Alloc BYTES from the declarator memory pool. */
774 alloc_declarator (size_t bytes)
776 return obstack_alloc (&declarator_obstack, bytes);
779 /* Allocate a declarator of the indicated KIND. Clear fields that are
780 common to all declarators. */
782 static cp_declarator *
783 make_declarator (cp_declarator_kind kind)
785 cp_declarator *declarator;
787 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
788 declarator->kind = kind;
789 declarator->attributes = NULL_TREE;
790 declarator->declarator = NULL;
795 /* Make a declarator for a generalized identifier. */
798 make_id_declarator (tree id)
800 cp_declarator *declarator;
802 declarator = make_declarator (cdk_id);
803 declarator->u.id.name = id;
804 declarator->u.id.sfk = sfk_none;
809 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
810 of modifiers such as const or volatile to apply to the pointer
811 type, represented as identifiers. */
814 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
816 cp_declarator *declarator;
818 declarator = make_declarator (cdk_pointer);
819 declarator->declarator = target;
820 declarator->u.pointer.qualifiers = cv_qualifiers;
821 declarator->u.pointer.class_type = NULL_TREE;
826 /* Like make_pointer_declarator -- but for references. */
829 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
831 cp_declarator *declarator;
833 declarator = make_declarator (cdk_reference);
834 declarator->declarator = target;
835 declarator->u.pointer.qualifiers = cv_qualifiers;
836 declarator->u.pointer.class_type = NULL_TREE;
841 /* Like make_pointer_declarator -- but for a pointer to a non-static
842 member of CLASS_TYPE. */
845 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
846 cp_declarator *pointee)
848 cp_declarator *declarator;
850 declarator = make_declarator (cdk_ptrmem);
851 declarator->declarator = pointee;
852 declarator->u.pointer.qualifiers = cv_qualifiers;
853 declarator->u.pointer.class_type = class_type;
858 /* Make a declarator for the function given by TARGET, with the
859 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
860 "const"-qualified member function. The EXCEPTION_SPECIFICATION
861 indicates what exceptions can be thrown. */
864 make_call_declarator (cp_declarator *target,
865 cp_parameter_declarator *parms,
866 cp_cv_quals cv_qualifiers,
867 tree exception_specification)
869 cp_declarator *declarator;
871 declarator = make_declarator (cdk_function);
872 declarator->declarator = target;
873 declarator->u.function.parameters = parms;
874 declarator->u.function.qualifiers = cv_qualifiers;
875 declarator->u.function.exception_specification = exception_specification;
880 /* Make a declarator for an array of BOUNDS elements, each of which is
881 defined by ELEMENT. */
884 make_array_declarator (cp_declarator *element, tree bounds)
886 cp_declarator *declarator;
888 declarator = make_declarator (cdk_array);
889 declarator->declarator = element;
890 declarator->u.array.bounds = bounds;
895 cp_parameter_declarator *no_parameters;
897 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
898 DECLARATOR and DEFAULT_ARGUMENT. */
900 cp_parameter_declarator *
901 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
902 cp_declarator *declarator,
903 tree default_argument)
905 cp_parameter_declarator *parameter;
907 parameter = ((cp_parameter_declarator *)
908 alloc_declarator (sizeof (cp_parameter_declarator)));
909 parameter->next = NULL;
911 parameter->decl_specifiers = *decl_specifiers;
913 clear_decl_specs (¶meter->decl_specifiers);
914 parameter->declarator = declarator;
915 parameter->default_argument = default_argument;
916 parameter->ellipsis_p = false;
926 A cp_parser parses the token stream as specified by the C++
927 grammar. Its job is purely parsing, not semantic analysis. For
928 example, the parser breaks the token stream into declarators,
929 expressions, statements, and other similar syntactic constructs.
930 It does not check that the types of the expressions on either side
931 of an assignment-statement are compatible, or that a function is
932 not declared with a parameter of type `void'.
934 The parser invokes routines elsewhere in the compiler to perform
935 semantic analysis and to build up the abstract syntax tree for the
938 The parser (and the template instantiation code, which is, in a
939 way, a close relative of parsing) are the only parts of the
940 compiler that should be calling push_scope and pop_scope, or
941 related functions. The parser (and template instantiation code)
942 keeps track of what scope is presently active; everything else
943 should simply honor that. (The code that generates static
944 initializers may also need to set the scope, in order to check
945 access control correctly when emitting the initializers.)
950 The parser is of the standard recursive-descent variety. Upcoming
951 tokens in the token stream are examined in order to determine which
952 production to use when parsing a non-terminal. Some C++ constructs
953 require arbitrary look ahead to disambiguate. For example, it is
954 impossible, in the general case, to tell whether a statement is an
955 expression or declaration without scanning the entire statement.
956 Therefore, the parser is capable of "parsing tentatively." When the
957 parser is not sure what construct comes next, it enters this mode.
958 Then, while we attempt to parse the construct, the parser queues up
959 error messages, rather than issuing them immediately, and saves the
960 tokens it consumes. If the construct is parsed successfully, the
961 parser "commits", i.e., it issues any queued error messages and
962 the tokens that were being preserved are permanently discarded.
963 If, however, the construct is not parsed successfully, the parser
964 rolls back its state completely so that it can resume parsing using
965 a different alternative.
970 The performance of the parser could probably be improved substantially.
971 We could often eliminate the need to parse tentatively by looking ahead
972 a little bit. In some places, this approach might not entirely eliminate
973 the need to parse tentatively, but it might still speed up the average
976 /* Flags that are passed to some parsing functions. These values can
977 be bitwise-ored together. */
979 typedef enum cp_parser_flags
982 CP_PARSER_FLAGS_NONE = 0x0,
983 /* The construct is optional. If it is not present, then no error
985 CP_PARSER_FLAGS_OPTIONAL = 0x1,
986 /* When parsing a type-specifier, do not allow user-defined types. */
987 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
990 /* The different kinds of declarators we want to parse. */
992 typedef enum cp_parser_declarator_kind
994 /* We want an abstract declarator. */
995 CP_PARSER_DECLARATOR_ABSTRACT,
996 /* We want a named declarator. */
997 CP_PARSER_DECLARATOR_NAMED,
998 /* We don't mind, but the name must be an unqualified-id. */
999 CP_PARSER_DECLARATOR_EITHER
1000 } cp_parser_declarator_kind;
1002 /* The precedence values used to parse binary expressions. The minimum value
1003 of PREC must be 1, because zero is reserved to quickly discriminate
1004 binary operators from other tokens. */
1009 PREC_LOGICAL_OR_EXPRESSION,
1010 PREC_LOGICAL_AND_EXPRESSION,
1011 PREC_INCLUSIVE_OR_EXPRESSION,
1012 PREC_EXCLUSIVE_OR_EXPRESSION,
1013 PREC_AND_EXPRESSION,
1014 PREC_EQUALITY_EXPRESSION,
1015 PREC_RELATIONAL_EXPRESSION,
1016 PREC_SHIFT_EXPRESSION,
1017 PREC_ADDITIVE_EXPRESSION,
1018 PREC_MULTIPLICATIVE_EXPRESSION,
1020 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1023 /* A mapping from a token type to a corresponding tree node type, with a
1024 precedence value. */
1026 typedef struct cp_parser_binary_operations_map_node
1028 /* The token type. */
1029 enum cpp_ttype token_type;
1030 /* The corresponding tree code. */
1031 enum tree_code tree_type;
1032 /* The precedence of this operator. */
1033 enum cp_parser_prec prec;
1034 } cp_parser_binary_operations_map_node;
1036 /* The status of a tentative parse. */
1038 typedef enum cp_parser_status_kind
1040 /* No errors have occurred. */
1041 CP_PARSER_STATUS_KIND_NO_ERROR,
1042 /* An error has occurred. */
1043 CP_PARSER_STATUS_KIND_ERROR,
1044 /* We are committed to this tentative parse, whether or not an error
1046 CP_PARSER_STATUS_KIND_COMMITTED
1047 } cp_parser_status_kind;
1049 typedef struct cp_parser_expression_stack_entry
1052 enum tree_code tree_type;
1054 } cp_parser_expression_stack_entry;
1056 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1057 entries because precedence levels on the stack are monotonically
1059 typedef struct cp_parser_expression_stack_entry
1060 cp_parser_expression_stack[NUM_PREC_VALUES];
1062 /* Context that is saved and restored when parsing tentatively. */
1063 typedef struct cp_parser_context GTY (())
1065 /* If this is a tentative parsing context, the status of the
1067 enum cp_parser_status_kind status;
1068 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1069 that are looked up in this context must be looked up both in the
1070 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1071 the context of the containing expression. */
1074 /* The next parsing context in the stack. */
1075 struct cp_parser_context *next;
1076 } cp_parser_context;
1080 /* Constructors and destructors. */
1082 static cp_parser_context *cp_parser_context_new
1083 (cp_parser_context *);
1085 /* Class variables. */
1087 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1089 /* The operator-precedence table used by cp_parser_binary_expression.
1090 Transformed into an associative array (binops_by_token) by
1093 static const cp_parser_binary_operations_map_node binops[] = {
1094 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1095 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1097 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1098 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1099 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1101 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1102 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1104 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1105 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1107 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1108 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1109 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1110 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1111 { CPP_MIN, MIN_EXPR, PREC_RELATIONAL_EXPRESSION },
1112 { CPP_MAX, MAX_EXPR, PREC_RELATIONAL_EXPRESSION },
1114 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1115 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1117 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1119 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1121 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1123 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1125 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1128 /* The same as binops, but initialized by cp_parser_new so that
1129 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1131 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1133 /* Constructors and destructors. */
1135 /* Construct a new context. The context below this one on the stack
1136 is given by NEXT. */
1138 static cp_parser_context *
1139 cp_parser_context_new (cp_parser_context* next)
1141 cp_parser_context *context;
1143 /* Allocate the storage. */
1144 if (cp_parser_context_free_list != NULL)
1146 /* Pull the first entry from the free list. */
1147 context = cp_parser_context_free_list;
1148 cp_parser_context_free_list = context->next;
1149 memset (context, 0, sizeof (*context));
1152 context = GGC_CNEW (cp_parser_context);
1154 /* No errors have occurred yet in this context. */
1155 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1156 /* If this is not the bottomost context, copy information that we
1157 need from the previous context. */
1160 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1161 expression, then we are parsing one in this context, too. */
1162 context->object_type = next->object_type;
1163 /* Thread the stack. */
1164 context->next = next;
1170 /* The cp_parser structure represents the C++ parser. */
1172 typedef struct cp_parser GTY(())
1174 /* The lexer from which we are obtaining tokens. */
1177 /* The scope in which names should be looked up. If NULL_TREE, then
1178 we look up names in the scope that is currently open in the
1179 source program. If non-NULL, this is either a TYPE or
1180 NAMESPACE_DECL for the scope in which we should look.
1182 This value is not cleared automatically after a name is looked
1183 up, so we must be careful to clear it before starting a new look
1184 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1185 will look up `Z' in the scope of `X', rather than the current
1186 scope.) Unfortunately, it is difficult to tell when name lookup
1187 is complete, because we sometimes peek at a token, look it up,
1188 and then decide not to consume it. */
1191 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1192 last lookup took place. OBJECT_SCOPE is used if an expression
1193 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1194 respectively. QUALIFYING_SCOPE is used for an expression of the
1195 form "X::Y"; it refers to X. */
1197 tree qualifying_scope;
1199 /* A stack of parsing contexts. All but the bottom entry on the
1200 stack will be tentative contexts.
1202 We parse tentatively in order to determine which construct is in
1203 use in some situations. For example, in order to determine
1204 whether a statement is an expression-statement or a
1205 declaration-statement we parse it tentatively as a
1206 declaration-statement. If that fails, we then reparse the same
1207 token stream as an expression-statement. */
1208 cp_parser_context *context;
1210 /* True if we are parsing GNU C++. If this flag is not set, then
1211 GNU extensions are not recognized. */
1212 bool allow_gnu_extensions_p;
1214 /* TRUE if the `>' token should be interpreted as the greater-than
1215 operator. FALSE if it is the end of a template-id or
1216 template-parameter-list. */
1217 bool greater_than_is_operator_p;
1219 /* TRUE if default arguments are allowed within a parameter list
1220 that starts at this point. FALSE if only a gnu extension makes
1221 them permissible. */
1222 bool default_arg_ok_p;
1224 /* TRUE if we are parsing an integral constant-expression. See
1225 [expr.const] for a precise definition. */
1226 bool integral_constant_expression_p;
1228 /* TRUE if we are parsing an integral constant-expression -- but a
1229 non-constant expression should be permitted as well. This flag
1230 is used when parsing an array bound so that GNU variable-length
1231 arrays are tolerated. */
1232 bool allow_non_integral_constant_expression_p;
1234 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1235 been seen that makes the expression non-constant. */
1236 bool non_integral_constant_expression_p;
1238 /* TRUE if local variable names and `this' are forbidden in the
1240 bool local_variables_forbidden_p;
1242 /* TRUE if the declaration we are parsing is part of a
1243 linkage-specification of the form `extern string-literal
1245 bool in_unbraced_linkage_specification_p;
1247 /* TRUE if we are presently parsing a declarator, after the
1248 direct-declarator. */
1249 bool in_declarator_p;
1251 /* TRUE if we are presently parsing a template-argument-list. */
1252 bool in_template_argument_list_p;
1254 /* TRUE if we are presently parsing the body of an
1255 iteration-statement. */
1256 bool in_iteration_statement_p;
1258 /* TRUE if we are presently parsing the body of a switch
1260 bool in_switch_statement_p;
1262 /* TRUE if we are parsing a type-id in an expression context. In
1263 such a situation, both "type (expr)" and "type (type)" are valid
1265 bool in_type_id_in_expr_p;
1267 /* TRUE if we are currently in a header file where declarations are
1268 implicitly extern "C". */
1269 bool implicit_extern_c;
1271 /* TRUE if strings in expressions should be translated to the execution
1273 bool translate_strings_p;
1275 /* If non-NULL, then we are parsing a construct where new type
1276 definitions are not permitted. The string stored here will be
1277 issued as an error message if a type is defined. */
1278 const char *type_definition_forbidden_message;
1280 /* A list of lists. The outer list is a stack, used for member
1281 functions of local classes. At each level there are two sub-list,
1282 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1283 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1284 TREE_VALUE's. The functions are chained in reverse declaration
1287 The TREE_PURPOSE sublist contains those functions with default
1288 arguments that need post processing, and the TREE_VALUE sublist
1289 contains those functions with definitions that need post
1292 These lists can only be processed once the outermost class being
1293 defined is complete. */
1294 tree unparsed_functions_queues;
1296 /* The number of classes whose definitions are currently in
1298 unsigned num_classes_being_defined;
1300 /* The number of template parameter lists that apply directly to the
1301 current declaration. */
1302 unsigned num_template_parameter_lists;
1305 /* The type of a function that parses some kind of expression. */
1306 typedef tree (*cp_parser_expression_fn) (cp_parser *);
1310 /* Constructors and destructors. */
1312 static cp_parser *cp_parser_new
1315 /* Routines to parse various constructs.
1317 Those that return `tree' will return the error_mark_node (rather
1318 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1319 Sometimes, they will return an ordinary node if error-recovery was
1320 attempted, even though a parse error occurred. So, to check
1321 whether or not a parse error occurred, you should always use
1322 cp_parser_error_occurred. If the construct is optional (indicated
1323 either by an `_opt' in the name of the function that does the
1324 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1325 the construct is not present. */
1327 /* Lexical conventions [gram.lex] */
1329 static tree cp_parser_identifier
1331 static tree cp_parser_string_literal
1332 (cp_parser *, bool, bool);
1334 /* Basic concepts [gram.basic] */
1336 static bool cp_parser_translation_unit
1339 /* Expressions [gram.expr] */
1341 static tree cp_parser_primary_expression
1342 (cp_parser *, cp_id_kind *, tree *);
1343 static tree cp_parser_id_expression
1344 (cp_parser *, bool, bool, bool *, bool);
1345 static tree cp_parser_unqualified_id
1346 (cp_parser *, bool, bool, bool);
1347 static tree cp_parser_nested_name_specifier_opt
1348 (cp_parser *, bool, bool, bool, bool);
1349 static tree cp_parser_nested_name_specifier
1350 (cp_parser *, bool, bool, bool, bool);
1351 static tree cp_parser_class_or_namespace_name
1352 (cp_parser *, bool, bool, bool, bool, bool);
1353 static tree cp_parser_postfix_expression
1354 (cp_parser *, bool);
1355 static tree cp_parser_postfix_open_square_expression
1356 (cp_parser *, tree, bool);
1357 static tree cp_parser_postfix_dot_deref_expression
1358 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *);
1359 static tree cp_parser_parenthesized_expression_list
1360 (cp_parser *, bool, bool *);
1361 static void cp_parser_pseudo_destructor_name
1362 (cp_parser *, tree *, tree *);
1363 static tree cp_parser_unary_expression
1364 (cp_parser *, bool);
1365 static enum tree_code cp_parser_unary_operator
1367 static tree cp_parser_new_expression
1369 static tree cp_parser_new_placement
1371 static tree cp_parser_new_type_id
1372 (cp_parser *, tree *);
1373 static cp_declarator *cp_parser_new_declarator_opt
1375 static cp_declarator *cp_parser_direct_new_declarator
1377 static tree cp_parser_new_initializer
1379 static tree cp_parser_delete_expression
1381 static tree cp_parser_cast_expression
1382 (cp_parser *, bool);
1383 static tree cp_parser_binary_expression
1385 static tree cp_parser_question_colon_clause
1386 (cp_parser *, tree);
1387 static tree cp_parser_assignment_expression
1389 static enum tree_code cp_parser_assignment_operator_opt
1391 static tree cp_parser_expression
1393 static tree cp_parser_constant_expression
1394 (cp_parser *, bool, bool *);
1395 static tree cp_parser_builtin_offsetof
1398 /* Statements [gram.stmt.stmt] */
1400 static void cp_parser_statement
1401 (cp_parser *, tree);
1402 static tree cp_parser_labeled_statement
1403 (cp_parser *, tree);
1404 static tree cp_parser_expression_statement
1405 (cp_parser *, tree);
1406 static tree cp_parser_compound_statement
1407 (cp_parser *, tree, bool);
1408 static void cp_parser_statement_seq_opt
1409 (cp_parser *, tree);
1410 static tree cp_parser_selection_statement
1412 static tree cp_parser_condition
1414 static tree cp_parser_iteration_statement
1416 static void cp_parser_for_init_statement
1418 static tree cp_parser_jump_statement
1420 static void cp_parser_declaration_statement
1423 static tree cp_parser_implicitly_scoped_statement
1425 static void cp_parser_already_scoped_statement
1428 /* Declarations [gram.dcl.dcl] */
1430 static void cp_parser_declaration_seq_opt
1432 static void cp_parser_declaration
1434 static void cp_parser_block_declaration
1435 (cp_parser *, bool);
1436 static void cp_parser_simple_declaration
1437 (cp_parser *, bool);
1438 static void cp_parser_decl_specifier_seq
1439 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1440 static tree cp_parser_storage_class_specifier_opt
1442 static tree cp_parser_function_specifier_opt
1443 (cp_parser *, cp_decl_specifier_seq *);
1444 static tree cp_parser_type_specifier
1445 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1447 static tree cp_parser_simple_type_specifier
1448 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1449 static tree cp_parser_type_name
1451 static tree cp_parser_elaborated_type_specifier
1452 (cp_parser *, bool, bool);
1453 static tree cp_parser_enum_specifier
1455 static void cp_parser_enumerator_list
1456 (cp_parser *, tree);
1457 static void cp_parser_enumerator_definition
1458 (cp_parser *, tree);
1459 static tree cp_parser_namespace_name
1461 static void cp_parser_namespace_definition
1463 static void cp_parser_namespace_body
1465 static tree cp_parser_qualified_namespace_specifier
1467 static void cp_parser_namespace_alias_definition
1469 static void cp_parser_using_declaration
1471 static void cp_parser_using_directive
1473 static void cp_parser_asm_definition
1475 static void cp_parser_linkage_specification
1478 /* Declarators [gram.dcl.decl] */
1480 static tree cp_parser_init_declarator
1481 (cp_parser *, cp_decl_specifier_seq *, bool, bool, int, bool *);
1482 static cp_declarator *cp_parser_declarator
1483 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1484 static cp_declarator *cp_parser_direct_declarator
1485 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1486 static enum tree_code cp_parser_ptr_operator
1487 (cp_parser *, tree *, cp_cv_quals *);
1488 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1490 static tree cp_parser_declarator_id
1492 static tree cp_parser_type_id
1494 static void cp_parser_type_specifier_seq
1495 (cp_parser *, cp_decl_specifier_seq *);
1496 static cp_parameter_declarator *cp_parser_parameter_declaration_clause
1498 static cp_parameter_declarator *cp_parser_parameter_declaration_list
1499 (cp_parser *, bool *);
1500 static cp_parameter_declarator *cp_parser_parameter_declaration
1501 (cp_parser *, bool, bool *);
1502 static void cp_parser_function_body
1504 static tree cp_parser_initializer
1505 (cp_parser *, bool *, bool *);
1506 static tree cp_parser_initializer_clause
1507 (cp_parser *, bool *);
1508 static tree cp_parser_initializer_list
1509 (cp_parser *, bool *);
1511 static bool cp_parser_ctor_initializer_opt_and_function_body
1514 /* Classes [gram.class] */
1516 static tree cp_parser_class_name
1517 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1518 static tree cp_parser_class_specifier
1520 static tree cp_parser_class_head
1521 (cp_parser *, bool *, tree *);
1522 static enum tag_types cp_parser_class_key
1524 static void cp_parser_member_specification_opt
1526 static void cp_parser_member_declaration
1528 static tree cp_parser_pure_specifier
1530 static tree cp_parser_constant_initializer
1533 /* Derived classes [gram.class.derived] */
1535 static tree cp_parser_base_clause
1537 static tree cp_parser_base_specifier
1540 /* Special member functions [gram.special] */
1542 static tree cp_parser_conversion_function_id
1544 static tree cp_parser_conversion_type_id
1546 static cp_declarator *cp_parser_conversion_declarator_opt
1548 static bool cp_parser_ctor_initializer_opt
1550 static void cp_parser_mem_initializer_list
1552 static tree cp_parser_mem_initializer
1554 static tree cp_parser_mem_initializer_id
1557 /* Overloading [gram.over] */
1559 static tree cp_parser_operator_function_id
1561 static tree cp_parser_operator
1564 /* Templates [gram.temp] */
1566 static void cp_parser_template_declaration
1567 (cp_parser *, bool);
1568 static tree cp_parser_template_parameter_list
1570 static tree cp_parser_template_parameter
1571 (cp_parser *, bool *);
1572 static tree cp_parser_type_parameter
1574 static tree cp_parser_template_id
1575 (cp_parser *, bool, bool, bool);
1576 static tree cp_parser_template_name
1577 (cp_parser *, bool, bool, bool, bool *);
1578 static tree cp_parser_template_argument_list
1580 static tree cp_parser_template_argument
1582 static void cp_parser_explicit_instantiation
1584 static void cp_parser_explicit_specialization
1587 /* Exception handling [gram.exception] */
1589 static tree cp_parser_try_block
1591 static bool cp_parser_function_try_block
1593 static void cp_parser_handler_seq
1595 static void cp_parser_handler
1597 static tree cp_parser_exception_declaration
1599 static tree cp_parser_throw_expression
1601 static tree cp_parser_exception_specification_opt
1603 static tree cp_parser_type_id_list
1606 /* GNU Extensions */
1608 static tree cp_parser_asm_specification_opt
1610 static tree cp_parser_asm_operand_list
1612 static tree cp_parser_asm_clobber_list
1614 static tree cp_parser_attributes_opt
1616 static tree cp_parser_attribute_list
1618 static bool cp_parser_extension_opt
1619 (cp_parser *, int *);
1620 static void cp_parser_label_declaration
1623 /* Utility Routines */
1625 static tree cp_parser_lookup_name
1626 (cp_parser *, tree, enum tag_types, bool, bool, bool, bool *);
1627 static tree cp_parser_lookup_name_simple
1628 (cp_parser *, tree);
1629 static tree cp_parser_maybe_treat_template_as_class
1631 static bool cp_parser_check_declarator_template_parameters
1632 (cp_parser *, cp_declarator *);
1633 static bool cp_parser_check_template_parameters
1634 (cp_parser *, unsigned);
1635 static tree cp_parser_simple_cast_expression
1637 static tree cp_parser_global_scope_opt
1638 (cp_parser *, bool);
1639 static bool cp_parser_constructor_declarator_p
1640 (cp_parser *, bool);
1641 static tree cp_parser_function_definition_from_specifiers_and_declarator
1642 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1643 static tree cp_parser_function_definition_after_declarator
1644 (cp_parser *, bool);
1645 static void cp_parser_template_declaration_after_export
1646 (cp_parser *, bool);
1647 static tree cp_parser_single_declaration
1648 (cp_parser *, bool, bool *);
1649 static tree cp_parser_functional_cast
1650 (cp_parser *, tree);
1651 static tree cp_parser_save_member_function_body
1652 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1653 static tree cp_parser_enclosed_template_argument_list
1655 static void cp_parser_save_default_args
1656 (cp_parser *, tree);
1657 static void cp_parser_late_parsing_for_member
1658 (cp_parser *, tree);
1659 static void cp_parser_late_parsing_default_args
1660 (cp_parser *, tree);
1661 static tree cp_parser_sizeof_operand
1662 (cp_parser *, enum rid);
1663 static bool cp_parser_declares_only_class_p
1665 static void cp_parser_set_storage_class
1666 (cp_decl_specifier_seq *, cp_storage_class);
1667 static void cp_parser_set_decl_spec_type
1668 (cp_decl_specifier_seq *, tree, bool);
1669 static bool cp_parser_friend_p
1670 (const cp_decl_specifier_seq *);
1671 static cp_token *cp_parser_require
1672 (cp_parser *, enum cpp_ttype, const char *);
1673 static cp_token *cp_parser_require_keyword
1674 (cp_parser *, enum rid, const char *);
1675 static bool cp_parser_token_starts_function_definition_p
1677 static bool cp_parser_next_token_starts_class_definition_p
1679 static bool cp_parser_next_token_ends_template_argument_p
1681 static bool cp_parser_nth_token_starts_template_argument_list_p
1682 (cp_parser *, size_t);
1683 static enum tag_types cp_parser_token_is_class_key
1685 static void cp_parser_check_class_key
1686 (enum tag_types, tree type);
1687 static void cp_parser_check_access_in_redeclaration
1689 static bool cp_parser_optional_template_keyword
1691 static void cp_parser_pre_parsed_nested_name_specifier
1693 static void cp_parser_cache_group
1694 (cp_parser *, enum cpp_ttype, unsigned);
1695 static void cp_parser_parse_tentatively
1697 static void cp_parser_commit_to_tentative_parse
1699 static void cp_parser_abort_tentative_parse
1701 static bool cp_parser_parse_definitely
1703 static inline bool cp_parser_parsing_tentatively
1705 static bool cp_parser_committed_to_tentative_parse
1707 static void cp_parser_error
1708 (cp_parser *, const char *);
1709 static void cp_parser_name_lookup_error
1710 (cp_parser *, tree, tree, const char *);
1711 static bool cp_parser_simulate_error
1713 static void cp_parser_check_type_definition
1715 static void cp_parser_check_for_definition_in_return_type
1716 (cp_declarator *, tree);
1717 static void cp_parser_check_for_invalid_template_id
1718 (cp_parser *, tree);
1719 static bool cp_parser_non_integral_constant_expression
1720 (cp_parser *, const char *);
1721 static void cp_parser_diagnose_invalid_type_name
1722 (cp_parser *, tree, tree);
1723 static bool cp_parser_parse_and_diagnose_invalid_type_name
1725 static int cp_parser_skip_to_closing_parenthesis
1726 (cp_parser *, bool, bool, bool);
1727 static void cp_parser_skip_to_end_of_statement
1729 static void cp_parser_consume_semicolon_at_end_of_statement
1731 static void cp_parser_skip_to_end_of_block_or_statement
1733 static void cp_parser_skip_to_closing_brace
1735 static void cp_parser_skip_until_found
1736 (cp_parser *, enum cpp_ttype, const char *);
1737 static bool cp_parser_error_occurred
1739 static bool cp_parser_allow_gnu_extensions_p
1741 static bool cp_parser_is_string_literal
1743 static bool cp_parser_is_keyword
1744 (cp_token *, enum rid);
1745 static tree cp_parser_make_typename_type
1746 (cp_parser *, tree, tree);
1748 /* Returns nonzero if we are parsing tentatively. */
1751 cp_parser_parsing_tentatively (cp_parser* parser)
1753 return parser->context->next != NULL;
1756 /* Returns nonzero if TOKEN is a string literal. */
1759 cp_parser_is_string_literal (cp_token* token)
1761 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1764 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1767 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1769 return token->keyword == keyword;
1772 /* If not parsing tentatively, issue a diagnostic of the form
1773 FILE:LINE: MESSAGE before TOKEN
1774 where TOKEN is the next token in the input stream. MESSAGE
1775 (specified by the caller) is usually of the form "expected
1779 cp_parser_error (cp_parser* parser, const char* message)
1781 if (!cp_parser_simulate_error (parser))
1783 cp_token *token = cp_lexer_peek_token (parser->lexer);
1784 /* This diagnostic makes more sense if it is tagged to the line
1785 of the token we just peeked at. */
1786 cp_lexer_set_source_position_from_token (token);
1787 c_parse_error (message,
1788 /* Because c_parser_error does not understand
1789 CPP_KEYWORD, keywords are treated like
1791 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
1796 /* Issue an error about name-lookup failing. NAME is the
1797 IDENTIFIER_NODE DECL is the result of
1798 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1799 the thing that we hoped to find. */
1802 cp_parser_name_lookup_error (cp_parser* parser,
1805 const char* desired)
1807 /* If name lookup completely failed, tell the user that NAME was not
1809 if (decl == error_mark_node)
1811 if (parser->scope && parser->scope != global_namespace)
1812 error ("%<%D::%D%> has not been declared",
1813 parser->scope, name);
1814 else if (parser->scope == global_namespace)
1815 error ("%<::%D%> has not been declared", name);
1816 else if (parser->object_scope
1817 && !CLASS_TYPE_P (parser->object_scope))
1818 error ("request for member %qD in non-class type %qT",
1819 name, parser->object_scope);
1820 else if (parser->object_scope)
1821 error ("%<%T::%D%> has not been declared",
1822 parser->object_scope, name);
1824 error ("%qD has not been declared", name);
1826 else if (parser->scope && parser->scope != global_namespace)
1827 error ("%<%D::%D%> %s", parser->scope, name, desired);
1828 else if (parser->scope == global_namespace)
1829 error ("%<::%D%> %s", name, desired);
1831 error ("%qD %s", name, desired);
1834 /* If we are parsing tentatively, remember that an error has occurred
1835 during this tentative parse. Returns true if the error was
1836 simulated; false if a message should be issued by the caller. */
1839 cp_parser_simulate_error (cp_parser* parser)
1841 if (cp_parser_parsing_tentatively (parser)
1842 && !cp_parser_committed_to_tentative_parse (parser))
1844 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
1850 /* This function is called when a type is defined. If type
1851 definitions are forbidden at this point, an error message is
1855 cp_parser_check_type_definition (cp_parser* parser)
1857 /* If types are forbidden here, issue a message. */
1858 if (parser->type_definition_forbidden_message)
1859 /* Use `%s' to print the string in case there are any escape
1860 characters in the message. */
1861 error ("%s", parser->type_definition_forbidden_message);
1864 /* This function is called when the DECLARATOR is processed. The TYPE
1865 was a type definied in the decl-specifiers. If it is invalid to
1866 define a type in the decl-specifiers for DECLARATOR, an error is
1870 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
1873 /* [dcl.fct] forbids type definitions in return types.
1874 Unfortunately, it's not easy to know whether or not we are
1875 processing a return type until after the fact. */
1877 && (declarator->kind == cdk_pointer
1878 || declarator->kind == cdk_reference
1879 || declarator->kind == cdk_ptrmem))
1880 declarator = declarator->declarator;
1882 && declarator->kind == cdk_function)
1884 error ("new types may not be defined in a return type");
1885 inform ("(perhaps a semicolon is missing after the definition of %qT)",
1890 /* A type-specifier (TYPE) has been parsed which cannot be followed by
1891 "<" in any valid C++ program. If the next token is indeed "<",
1892 issue a message warning the user about what appears to be an
1893 invalid attempt to form a template-id. */
1896 cp_parser_check_for_invalid_template_id (cp_parser* parser,
1899 cp_token_position start = 0;
1901 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
1904 error ("%qT is not a template", type);
1905 else if (TREE_CODE (type) == IDENTIFIER_NODE)
1906 error ("%qE is not a template", type);
1908 error ("invalid template-id");
1909 /* Remember the location of the invalid "<". */
1910 if (cp_parser_parsing_tentatively (parser)
1911 && !cp_parser_committed_to_tentative_parse (parser))
1912 start = cp_lexer_token_position (parser->lexer, true);
1913 /* Consume the "<". */
1914 cp_lexer_consume_token (parser->lexer);
1915 /* Parse the template arguments. */
1916 cp_parser_enclosed_template_argument_list (parser);
1917 /* Permanently remove the invalid template arguments so that
1918 this error message is not issued again. */
1920 cp_lexer_purge_tokens_after (parser->lexer, start);
1924 /* If parsing an integral constant-expression, issue an error message
1925 about the fact that THING appeared and return true. Otherwise,
1926 return false, marking the current expression as non-constant. */
1929 cp_parser_non_integral_constant_expression (cp_parser *parser,
1932 if (parser->integral_constant_expression_p)
1934 if (!parser->allow_non_integral_constant_expression_p)
1936 error ("%s cannot appear in a constant-expression", thing);
1939 parser->non_integral_constant_expression_p = true;
1944 /* Emit a diagnostic for an invalid type name. Consider also if it is
1945 qualified or not and the result of a lookup, to provide a better
1949 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
1951 tree decl, old_scope;
1952 /* Try to lookup the identifier. */
1953 old_scope = parser->scope;
1954 parser->scope = scope;
1955 decl = cp_parser_lookup_name_simple (parser, id);
1956 parser->scope = old_scope;
1957 /* If the lookup found a template-name, it means that the user forgot
1958 to specify an argument list. Emit an useful error message. */
1959 if (TREE_CODE (decl) == TEMPLATE_DECL)
1960 error ("invalid use of template-name %qE without an argument list",
1962 else if (!parser->scope)
1964 /* Issue an error message. */
1965 error ("%qE does not name a type", id);
1966 /* If we're in a template class, it's possible that the user was
1967 referring to a type from a base class. For example:
1969 template <typename T> struct A { typedef T X; };
1970 template <typename T> struct B : public A<T> { X x; };
1972 The user should have said "typename A<T>::X". */
1973 if (processing_template_decl && current_class_type)
1977 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
1981 tree base_type = BINFO_TYPE (b);
1982 if (CLASS_TYPE_P (base_type)
1983 && dependent_type_p (base_type))
1986 /* Go from a particular instantiation of the
1987 template (which will have an empty TYPE_FIELDs),
1988 to the main version. */
1989 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
1990 for (field = TYPE_FIELDS (base_type);
1992 field = TREE_CHAIN (field))
1993 if (TREE_CODE (field) == TYPE_DECL
1994 && DECL_NAME (field) == id)
1996 inform ("(perhaps %<typename %T::%E%> was intended)",
1997 BINFO_TYPE (b), id);
2006 /* Here we diagnose qualified-ids where the scope is actually correct,
2007 but the identifier does not resolve to a valid type name. */
2010 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2011 error ("%qE in namespace %qE does not name a type",
2013 else if (TYPE_P (parser->scope))
2014 error ("%qE in class %qT does not name a type", id, parser->scope);
2020 /* Check for a common situation where a type-name should be present,
2021 but is not, and issue a sensible error message. Returns true if an
2022 invalid type-name was detected.
2024 The situation handled by this function are variable declarations of the
2025 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2026 Usually, `ID' should name a type, but if we got here it means that it
2027 does not. We try to emit the best possible error message depending on
2028 how exactly the id-expression looks like.
2032 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2036 cp_parser_parse_tentatively (parser);
2037 id = cp_parser_id_expression (parser,
2038 /*template_keyword_p=*/false,
2039 /*check_dependency_p=*/true,
2040 /*template_p=*/NULL,
2041 /*declarator_p=*/true);
2042 /* After the id-expression, there should be a plain identifier,
2043 otherwise this is not a simple variable declaration. Also, if
2044 the scope is dependent, we cannot do much. */
2045 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2046 || (parser->scope && TYPE_P (parser->scope)
2047 && dependent_type_p (parser->scope)))
2049 cp_parser_abort_tentative_parse (parser);
2052 if (!cp_parser_parse_definitely (parser)
2053 || TREE_CODE (id) != IDENTIFIER_NODE)
2056 /* Emit a diagnostic for the invalid type. */
2057 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2058 /* Skip to the end of the declaration; there's no point in
2059 trying to process it. */
2060 cp_parser_skip_to_end_of_block_or_statement (parser);
2064 /* Consume tokens up to, and including, the next non-nested closing `)'.
2065 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2066 are doing error recovery. Returns -1 if OR_COMMA is true and we
2067 found an unnested comma. */
2070 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2075 unsigned paren_depth = 0;
2076 unsigned brace_depth = 0;
2079 if (recovering && !or_comma && cp_parser_parsing_tentatively (parser)
2080 && !cp_parser_committed_to_tentative_parse (parser))
2087 /* If we've run out of tokens, then there is no closing `)'. */
2088 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2094 token = cp_lexer_peek_token (parser->lexer);
2096 /* This matches the processing in skip_to_end_of_statement. */
2097 if (token->type == CPP_SEMICOLON && !brace_depth)
2102 if (token->type == CPP_OPEN_BRACE)
2104 if (token->type == CPP_CLOSE_BRACE)
2112 if (recovering && or_comma && token->type == CPP_COMMA
2113 && !brace_depth && !paren_depth)
2121 /* If it is an `(', we have entered another level of nesting. */
2122 if (token->type == CPP_OPEN_PAREN)
2124 /* If it is a `)', then we might be done. */
2125 else if (token->type == CPP_CLOSE_PAREN && !paren_depth--)
2128 cp_lexer_consume_token (parser->lexer);
2136 /* Consume the token. */
2137 cp_lexer_consume_token (parser->lexer);
2143 /* Consume tokens until we reach the end of the current statement.
2144 Normally, that will be just before consuming a `;'. However, if a
2145 non-nested `}' comes first, then we stop before consuming that. */
2148 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2150 unsigned nesting_depth = 0;
2156 /* Peek at the next token. */
2157 token = cp_lexer_peek_token (parser->lexer);
2158 /* If we've run out of tokens, stop. */
2159 if (token->type == CPP_EOF)
2161 /* If the next token is a `;', we have reached the end of the
2163 if (token->type == CPP_SEMICOLON && !nesting_depth)
2165 /* If the next token is a non-nested `}', then we have reached
2166 the end of the current block. */
2167 if (token->type == CPP_CLOSE_BRACE)
2169 /* If this is a non-nested `}', stop before consuming it.
2170 That way, when confronted with something like:
2174 we stop before consuming the closing `}', even though we
2175 have not yet reached a `;'. */
2176 if (nesting_depth == 0)
2178 /* If it is the closing `}' for a block that we have
2179 scanned, stop -- but only after consuming the token.
2185 we will stop after the body of the erroneously declared
2186 function, but before consuming the following `typedef'
2188 if (--nesting_depth == 0)
2190 cp_lexer_consume_token (parser->lexer);
2194 /* If it the next token is a `{', then we are entering a new
2195 block. Consume the entire block. */
2196 else if (token->type == CPP_OPEN_BRACE)
2198 /* Consume the token. */
2199 cp_lexer_consume_token (parser->lexer);
2203 /* This function is called at the end of a statement or declaration.
2204 If the next token is a semicolon, it is consumed; otherwise, error
2205 recovery is attempted. */
2208 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2210 /* Look for the trailing `;'. */
2211 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2213 /* If there is additional (erroneous) input, skip to the end of
2215 cp_parser_skip_to_end_of_statement (parser);
2216 /* If the next token is now a `;', consume it. */
2217 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2218 cp_lexer_consume_token (parser->lexer);
2222 /* Skip tokens until we have consumed an entire block, or until we
2223 have consumed a non-nested `;'. */
2226 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2228 unsigned nesting_depth = 0;
2234 /* Peek at the next token. */
2235 token = cp_lexer_peek_token (parser->lexer);
2236 /* If we've run out of tokens, stop. */
2237 if (token->type == CPP_EOF)
2239 /* If the next token is a `;', we have reached the end of the
2241 if (token->type == CPP_SEMICOLON && !nesting_depth)
2243 /* Consume the `;'. */
2244 cp_lexer_consume_token (parser->lexer);
2247 /* Consume the token. */
2248 token = cp_lexer_consume_token (parser->lexer);
2249 /* If the next token is a non-nested `}', then we have reached
2250 the end of the current block. */
2251 if (token->type == CPP_CLOSE_BRACE
2252 && (nesting_depth == 0 || --nesting_depth == 0))
2254 /* If it the next token is a `{', then we are entering a new
2255 block. Consume the entire block. */
2256 if (token->type == CPP_OPEN_BRACE)
2261 /* Skip tokens until a non-nested closing curly brace is the next
2265 cp_parser_skip_to_closing_brace (cp_parser *parser)
2267 unsigned nesting_depth = 0;
2273 /* Peek at the next token. */
2274 token = cp_lexer_peek_token (parser->lexer);
2275 /* If we've run out of tokens, stop. */
2276 if (token->type == CPP_EOF)
2278 /* If the next token is a non-nested `}', then we have reached
2279 the end of the current block. */
2280 if (token->type == CPP_CLOSE_BRACE && nesting_depth-- == 0)
2282 /* If it the next token is a `{', then we are entering a new
2283 block. Consume the entire block. */
2284 else if (token->type == CPP_OPEN_BRACE)
2286 /* Consume the token. */
2287 cp_lexer_consume_token (parser->lexer);
2291 /* This is a simple wrapper around make_typename_type. When the id is
2292 an unresolved identifier node, we can provide a superior diagnostic
2293 using cp_parser_diagnose_invalid_type_name. */
2296 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2299 if (TREE_CODE (id) == IDENTIFIER_NODE)
2301 result = make_typename_type (scope, id, typename_type,
2303 if (result == error_mark_node)
2304 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2307 return make_typename_type (scope, id, typename_type, tf_error);
2311 /* Create a new C++ parser. */
2314 cp_parser_new (void)
2320 /* cp_lexer_new_main is called before calling ggc_alloc because
2321 cp_lexer_new_main might load a PCH file. */
2322 lexer = cp_lexer_new_main ();
2324 /* Initialize the binops_by_token so that we can get the tree
2325 directly from the token. */
2326 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2327 binops_by_token[binops[i].token_type] = binops[i];
2329 parser = GGC_CNEW (cp_parser);
2330 parser->lexer = lexer;
2331 parser->context = cp_parser_context_new (NULL);
2333 /* For now, we always accept GNU extensions. */
2334 parser->allow_gnu_extensions_p = 1;
2336 /* The `>' token is a greater-than operator, not the end of a
2338 parser->greater_than_is_operator_p = true;
2340 parser->default_arg_ok_p = true;
2342 /* We are not parsing a constant-expression. */
2343 parser->integral_constant_expression_p = false;
2344 parser->allow_non_integral_constant_expression_p = false;
2345 parser->non_integral_constant_expression_p = false;
2347 /* Local variable names are not forbidden. */
2348 parser->local_variables_forbidden_p = false;
2350 /* We are not processing an `extern "C"' declaration. */
2351 parser->in_unbraced_linkage_specification_p = false;
2353 /* We are not processing a declarator. */
2354 parser->in_declarator_p = false;
2356 /* We are not processing a template-argument-list. */
2357 parser->in_template_argument_list_p = false;
2359 /* We are not in an iteration statement. */
2360 parser->in_iteration_statement_p = false;
2362 /* We are not in a switch statement. */
2363 parser->in_switch_statement_p = false;
2365 /* We are not parsing a type-id inside an expression. */
2366 parser->in_type_id_in_expr_p = false;
2368 /* Declarations aren't implicitly extern "C". */
2369 parser->implicit_extern_c = false;
2371 /* String literals should be translated to the execution character set. */
2372 parser->translate_strings_p = true;
2374 /* The unparsed function queue is empty. */
2375 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2377 /* There are no classes being defined. */
2378 parser->num_classes_being_defined = 0;
2380 /* No template parameters apply. */
2381 parser->num_template_parameter_lists = 0;
2386 /* Create a cp_lexer structure which will emit the tokens in CACHE
2387 and push it onto the parser's lexer stack. This is used for delayed
2388 parsing of in-class method bodies and default arguments, and should
2389 not be confused with tentative parsing. */
2391 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
2393 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
2394 lexer->next = parser->lexer;
2395 parser->lexer = lexer;
2397 /* Move the current source position to that of the first token in the
2399 cp_lexer_set_source_position_from_token (lexer->next_token);
2402 /* Pop the top lexer off the parser stack. This is never used for the
2403 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2405 cp_parser_pop_lexer (cp_parser *parser)
2407 cp_lexer *lexer = parser->lexer;
2408 parser->lexer = lexer->next;
2409 cp_lexer_destroy (lexer);
2411 /* Put the current source position back where it was before this
2412 lexer was pushed. */
2413 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
2416 /* Lexical conventions [gram.lex] */
2418 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2422 cp_parser_identifier (cp_parser* parser)
2426 /* Look for the identifier. */
2427 token = cp_parser_require (parser, CPP_NAME, "identifier");
2428 /* Return the value. */
2429 return token ? token->value : error_mark_node;
2432 /* Parse a sequence of adjacent string constants. Returns a
2433 TREE_STRING representing the combined, nul-terminated string
2434 constant. If TRANSLATE is true, translate the string to the
2435 execution character set. If WIDE_OK is true, a wide string is
2438 C++98 [lex.string] says that if a narrow string literal token is
2439 adjacent to a wide string literal token, the behavior is undefined.
2440 However, C99 6.4.5p4 says that this results in a wide string literal.
2441 We follow C99 here, for consistency with the C front end.
2443 This code is largely lifted from lex_string() in c-lex.c.
2445 FUTURE: ObjC++ will need to handle @-strings here. */
2447 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
2452 struct obstack str_ob;
2453 cpp_string str, istr, *strs;
2456 tok = cp_lexer_peek_token (parser->lexer);
2457 if (!cp_parser_is_string_literal (tok))
2459 cp_parser_error (parser, "expected string-literal");
2460 return error_mark_node;
2463 /* Try to avoid the overhead of creating and destroying an obstack
2464 for the common case of just one string. */
2465 if (!cp_parser_is_string_literal
2466 (cp_lexer_peek_nth_token (parser->lexer, 2)))
2468 cp_lexer_consume_token (parser->lexer);
2470 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->value);
2471 str.len = TREE_STRING_LENGTH (tok->value);
2473 if (tok->type == CPP_WSTRING)
2480 gcc_obstack_init (&str_ob);
2485 cp_lexer_consume_token (parser->lexer);
2487 str.text = (unsigned char *)TREE_STRING_POINTER (tok->value);
2488 str.len = TREE_STRING_LENGTH (tok->value);
2489 if (tok->type == CPP_WSTRING)
2492 obstack_grow (&str_ob, &str, sizeof (cpp_string));
2494 tok = cp_lexer_peek_token (parser->lexer);
2496 while (cp_parser_is_string_literal (tok));
2498 strs = (cpp_string *) obstack_finish (&str_ob);
2501 if (wide && !wide_ok)
2503 cp_parser_error (parser, "a wide string is invalid in this context");
2507 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
2508 (parse_in, strs, count, &istr, wide))
2510 value = build_string (istr.len, (char *)istr.text);
2511 free ((void *)istr.text);
2513 TREE_TYPE (value) = wide ? wchar_array_type_node : char_array_type_node;
2514 value = fix_string_type (value);
2517 /* cpp_interpret_string has issued an error. */
2518 value = error_mark_node;
2521 obstack_free (&str_ob, 0);
2527 /* Basic concepts [gram.basic] */
2529 /* Parse a translation-unit.
2532 declaration-seq [opt]
2534 Returns TRUE if all went well. */
2537 cp_parser_translation_unit (cp_parser* parser)
2539 /* The address of the first non-permanent object on the declarator
2541 static void *declarator_obstack_base;
2545 /* Create the declarator obstack, if necessary. */
2546 if (!cp_error_declarator)
2548 gcc_obstack_init (&declarator_obstack);
2549 /* Create the error declarator. */
2550 cp_error_declarator = make_declarator (cdk_error);
2551 /* Create the empty parameter list. */
2552 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
2553 /* Remember where the base of the declarator obstack lies. */
2554 declarator_obstack_base = obstack_next_free (&declarator_obstack);
2559 cp_parser_declaration_seq_opt (parser);
2561 /* If there are no tokens left then all went well. */
2562 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2564 /* Get rid of the token array; we don't need it any more. */
2565 cp_lexer_destroy (parser->lexer);
2566 parser->lexer = NULL;
2568 /* This file might have been a context that's implicitly extern
2569 "C". If so, pop the lang context. (Only relevant for PCH.) */
2570 if (parser->implicit_extern_c)
2572 pop_lang_context ();
2573 parser->implicit_extern_c = false;
2577 finish_translation_unit ();
2584 cp_parser_error (parser, "expected declaration");
2590 /* Make sure the declarator obstack was fully cleaned up. */
2591 gcc_assert (obstack_next_free (&declarator_obstack)
2592 == declarator_obstack_base);
2594 /* All went well. */
2598 /* Expressions [gram.expr] */
2600 /* Parse a primary-expression.
2611 ( compound-statement )
2612 __builtin_va_arg ( assignment-expression , type-id )
2617 Returns a representation of the expression.
2619 *IDK indicates what kind of id-expression (if any) was present.
2621 *QUALIFYING_CLASS is set to a non-NULL value if the id-expression can be
2622 used as the operand of a pointer-to-member. In that case,
2623 *QUALIFYING_CLASS gives the class that is used as the qualifying
2624 class in the pointer-to-member. */
2627 cp_parser_primary_expression (cp_parser *parser,
2629 tree *qualifying_class)
2633 /* Assume the primary expression is not an id-expression. */
2634 *idk = CP_ID_KIND_NONE;
2635 /* And that it cannot be used as pointer-to-member. */
2636 *qualifying_class = NULL_TREE;
2638 /* Peek at the next token. */
2639 token = cp_lexer_peek_token (parser->lexer);
2640 switch (token->type)
2651 token = cp_lexer_consume_token (parser->lexer);
2652 return token->value;
2656 /* ??? Should wide strings be allowed when parser->translate_strings_p
2657 is false (i.e. in attributes)? If not, we can kill the third
2658 argument to cp_parser_string_literal. */
2659 return cp_parser_string_literal (parser,
2660 parser->translate_strings_p,
2663 case CPP_OPEN_PAREN:
2666 bool saved_greater_than_is_operator_p;
2668 /* Consume the `('. */
2669 cp_lexer_consume_token (parser->lexer);
2670 /* Within a parenthesized expression, a `>' token is always
2671 the greater-than operator. */
2672 saved_greater_than_is_operator_p
2673 = parser->greater_than_is_operator_p;
2674 parser->greater_than_is_operator_p = true;
2675 /* If we see `( { ' then we are looking at the beginning of
2676 a GNU statement-expression. */
2677 if (cp_parser_allow_gnu_extensions_p (parser)
2678 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
2680 /* Statement-expressions are not allowed by the standard. */
2682 pedwarn ("ISO C++ forbids braced-groups within expressions");
2684 /* And they're not allowed outside of a function-body; you
2685 cannot, for example, write:
2687 int i = ({ int j = 3; j + 1; });
2689 at class or namespace scope. */
2690 if (!at_function_scope_p ())
2691 error ("statement-expressions are allowed only inside functions");
2692 /* Start the statement-expression. */
2693 expr = begin_stmt_expr ();
2694 /* Parse the compound-statement. */
2695 cp_parser_compound_statement (parser, expr, false);
2697 expr = finish_stmt_expr (expr, false);
2701 /* Parse the parenthesized expression. */
2702 expr = cp_parser_expression (parser);
2703 /* Let the front end know that this expression was
2704 enclosed in parentheses. This matters in case, for
2705 example, the expression is of the form `A::B', since
2706 `&A::B' might be a pointer-to-member, but `&(A::B)' is
2708 finish_parenthesized_expr (expr);
2710 /* The `>' token might be the end of a template-id or
2711 template-parameter-list now. */
2712 parser->greater_than_is_operator_p
2713 = saved_greater_than_is_operator_p;
2714 /* Consume the `)'. */
2715 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
2716 cp_parser_skip_to_end_of_statement (parser);
2722 switch (token->keyword)
2724 /* These two are the boolean literals. */
2726 cp_lexer_consume_token (parser->lexer);
2727 return boolean_true_node;
2729 cp_lexer_consume_token (parser->lexer);
2730 return boolean_false_node;
2732 /* The `__null' literal. */
2734 cp_lexer_consume_token (parser->lexer);
2737 /* Recognize the `this' keyword. */
2739 cp_lexer_consume_token (parser->lexer);
2740 if (parser->local_variables_forbidden_p)
2742 error ("%<this%> may not be used in this context");
2743 return error_mark_node;
2745 /* Pointers cannot appear in constant-expressions. */
2746 if (cp_parser_non_integral_constant_expression (parser,
2748 return error_mark_node;
2749 return finish_this_expr ();
2751 /* The `operator' keyword can be the beginning of an
2756 case RID_FUNCTION_NAME:
2757 case RID_PRETTY_FUNCTION_NAME:
2758 case RID_C99_FUNCTION_NAME:
2759 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
2760 __func__ are the names of variables -- but they are
2761 treated specially. Therefore, they are handled here,
2762 rather than relying on the generic id-expression logic
2763 below. Grammatically, these names are id-expressions.
2765 Consume the token. */
2766 token = cp_lexer_consume_token (parser->lexer);
2767 /* Look up the name. */
2768 return finish_fname (token->value);
2775 /* The `__builtin_va_arg' construct is used to handle
2776 `va_arg'. Consume the `__builtin_va_arg' token. */
2777 cp_lexer_consume_token (parser->lexer);
2778 /* Look for the opening `('. */
2779 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
2780 /* Now, parse the assignment-expression. */
2781 expression = cp_parser_assignment_expression (parser);
2782 /* Look for the `,'. */
2783 cp_parser_require (parser, CPP_COMMA, "`,'");
2784 /* Parse the type-id. */
2785 type = cp_parser_type_id (parser);
2786 /* Look for the closing `)'. */
2787 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
2788 /* Using `va_arg' in a constant-expression is not
2790 if (cp_parser_non_integral_constant_expression (parser,
2792 return error_mark_node;
2793 return build_x_va_arg (expression, type);
2797 return cp_parser_builtin_offsetof (parser);
2800 cp_parser_error (parser, "expected primary-expression");
2801 return error_mark_node;
2804 /* An id-expression can start with either an identifier, a
2805 `::' as the beginning of a qualified-id, or the "operator"
2809 case CPP_TEMPLATE_ID:
2810 case CPP_NESTED_NAME_SPECIFIER:
2814 const char *error_msg;
2817 /* Parse the id-expression. */
2819 = cp_parser_id_expression (parser,
2820 /*template_keyword_p=*/false,
2821 /*check_dependency_p=*/true,
2822 /*template_p=*/NULL,
2823 /*declarator_p=*/false);
2824 if (id_expression == error_mark_node)
2825 return error_mark_node;
2826 /* If we have a template-id, then no further lookup is
2827 required. If the template-id was for a template-class, we
2828 will sometimes have a TYPE_DECL at this point. */
2829 else if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
2830 || TREE_CODE (id_expression) == TYPE_DECL)
2831 decl = id_expression;
2832 /* Look up the name. */
2837 decl = cp_parser_lookup_name (parser, id_expression,
2839 /*is_template=*/false,
2840 /*is_namespace=*/false,
2841 /*check_dependency=*/true,
2843 /* If the lookup was ambiguous, an error will already have
2846 return error_mark_node;
2847 /* If name lookup gives us a SCOPE_REF, then the
2848 qualifying scope was dependent. Just propagate the
2850 if (TREE_CODE (decl) == SCOPE_REF)
2852 if (TYPE_P (TREE_OPERAND (decl, 0)))
2853 *qualifying_class = TREE_OPERAND (decl, 0);
2856 /* Check to see if DECL is a local variable in a context
2857 where that is forbidden. */
2858 if (parser->local_variables_forbidden_p
2859 && local_variable_p (decl))
2861 /* It might be that we only found DECL because we are
2862 trying to be generous with pre-ISO scoping rules.
2863 For example, consider:
2867 for (int i = 0; i < 10; ++i) {}
2868 extern void f(int j = i);
2871 Here, name look up will originally find the out
2872 of scope `i'. We need to issue a warning message,
2873 but then use the global `i'. */
2874 decl = check_for_out_of_scope_variable (decl);
2875 if (local_variable_p (decl))
2877 error ("local variable %qD may not appear in this context",
2879 return error_mark_node;
2884 decl = finish_id_expression (id_expression, decl, parser->scope,
2885 idk, qualifying_class,
2886 parser->integral_constant_expression_p,
2887 parser->allow_non_integral_constant_expression_p,
2888 &parser->non_integral_constant_expression_p,
2891 cp_parser_error (parser, error_msg);
2895 /* Anything else is an error. */
2897 cp_parser_error (parser, "expected primary-expression");
2898 return error_mark_node;
2902 /* Parse an id-expression.
2909 :: [opt] nested-name-specifier template [opt] unqualified-id
2911 :: operator-function-id
2914 Return a representation of the unqualified portion of the
2915 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
2916 a `::' or nested-name-specifier.
2918 Often, if the id-expression was a qualified-id, the caller will
2919 want to make a SCOPE_REF to represent the qualified-id. This
2920 function does not do this in order to avoid wastefully creating
2921 SCOPE_REFs when they are not required.
2923 If TEMPLATE_KEYWORD_P is true, then we have just seen the
2926 If CHECK_DEPENDENCY_P is false, then names are looked up inside
2927 uninstantiated templates.
2929 If *TEMPLATE_P is non-NULL, it is set to true iff the
2930 `template' keyword is used to explicitly indicate that the entity
2931 named is a template.
2933 If DECLARATOR_P is true, the id-expression is appearing as part of
2934 a declarator, rather than as part of an expression. */
2937 cp_parser_id_expression (cp_parser *parser,
2938 bool template_keyword_p,
2939 bool check_dependency_p,
2943 bool global_scope_p;
2944 bool nested_name_specifier_p;
2946 /* Assume the `template' keyword was not used. */
2948 *template_p = false;
2950 /* Look for the optional `::' operator. */
2952 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
2954 /* Look for the optional nested-name-specifier. */
2955 nested_name_specifier_p
2956 = (cp_parser_nested_name_specifier_opt (parser,
2957 /*typename_keyword_p=*/false,
2962 /* If there is a nested-name-specifier, then we are looking at
2963 the first qualified-id production. */
2964 if (nested_name_specifier_p)
2967 tree saved_object_scope;
2968 tree saved_qualifying_scope;
2969 tree unqualified_id;
2972 /* See if the next token is the `template' keyword. */
2974 template_p = &is_template;
2975 *template_p = cp_parser_optional_template_keyword (parser);
2976 /* Name lookup we do during the processing of the
2977 unqualified-id might obliterate SCOPE. */
2978 saved_scope = parser->scope;
2979 saved_object_scope = parser->object_scope;
2980 saved_qualifying_scope = parser->qualifying_scope;
2981 /* Process the final unqualified-id. */
2982 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
2985 /* Restore the SAVED_SCOPE for our caller. */
2986 parser->scope = saved_scope;
2987 parser->object_scope = saved_object_scope;
2988 parser->qualifying_scope = saved_qualifying_scope;
2990 return unqualified_id;
2992 /* Otherwise, if we are in global scope, then we are looking at one
2993 of the other qualified-id productions. */
2994 else if (global_scope_p)
2999 /* Peek at the next token. */
3000 token = cp_lexer_peek_token (parser->lexer);
3002 /* If it's an identifier, and the next token is not a "<", then
3003 we can avoid the template-id case. This is an optimization
3004 for this common case. */
3005 if (token->type == CPP_NAME
3006 && !cp_parser_nth_token_starts_template_argument_list_p
3008 return cp_parser_identifier (parser);
3010 cp_parser_parse_tentatively (parser);
3011 /* Try a template-id. */
3012 id = cp_parser_template_id (parser,
3013 /*template_keyword_p=*/false,
3014 /*check_dependency_p=*/true,
3016 /* If that worked, we're done. */
3017 if (cp_parser_parse_definitely (parser))
3020 /* Peek at the next token. (Changes in the token buffer may
3021 have invalidated the pointer obtained above.) */
3022 token = cp_lexer_peek_token (parser->lexer);
3024 switch (token->type)
3027 return cp_parser_identifier (parser);
3030 if (token->keyword == RID_OPERATOR)
3031 return cp_parser_operator_function_id (parser);
3035 cp_parser_error (parser, "expected id-expression");
3036 return error_mark_node;
3040 return cp_parser_unqualified_id (parser, template_keyword_p,
3041 /*check_dependency_p=*/true,
3045 /* Parse an unqualified-id.
3049 operator-function-id
3050 conversion-function-id
3054 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3055 keyword, in a construct like `A::template ...'.
3057 Returns a representation of unqualified-id. For the `identifier'
3058 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3059 production a BIT_NOT_EXPR is returned; the operand of the
3060 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3061 other productions, see the documentation accompanying the
3062 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3063 names are looked up in uninstantiated templates. If DECLARATOR_P
3064 is true, the unqualified-id is appearing as part of a declarator,
3065 rather than as part of an expression. */
3068 cp_parser_unqualified_id (cp_parser* parser,
3069 bool template_keyword_p,
3070 bool check_dependency_p,
3075 /* Peek at the next token. */
3076 token = cp_lexer_peek_token (parser->lexer);
3078 switch (token->type)
3084 /* We don't know yet whether or not this will be a
3086 cp_parser_parse_tentatively (parser);
3087 /* Try a template-id. */
3088 id = cp_parser_template_id (parser, template_keyword_p,
3091 /* If it worked, we're done. */
3092 if (cp_parser_parse_definitely (parser))
3094 /* Otherwise, it's an ordinary identifier. */
3095 return cp_parser_identifier (parser);
3098 case CPP_TEMPLATE_ID:
3099 return cp_parser_template_id (parser, template_keyword_p,
3106 tree qualifying_scope;
3110 /* Consume the `~' token. */
3111 cp_lexer_consume_token (parser->lexer);
3112 /* Parse the class-name. The standard, as written, seems to
3115 template <typename T> struct S { ~S (); };
3116 template <typename T> S<T>::~S() {}
3118 is invalid, since `~' must be followed by a class-name, but
3119 `S<T>' is dependent, and so not known to be a class.
3120 That's not right; we need to look in uninstantiated
3121 templates. A further complication arises from:
3123 template <typename T> void f(T t) {
3127 Here, it is not possible to look up `T' in the scope of `T'
3128 itself. We must look in both the current scope, and the
3129 scope of the containing complete expression.
3131 Yet another issue is:
3140 The standard does not seem to say that the `S' in `~S'
3141 should refer to the type `S' and not the data member
3144 /* DR 244 says that we look up the name after the "~" in the
3145 same scope as we looked up the qualifying name. That idea
3146 isn't fully worked out; it's more complicated than that. */
3147 scope = parser->scope;
3148 object_scope = parser->object_scope;
3149 qualifying_scope = parser->qualifying_scope;
3151 /* If the name is of the form "X::~X" it's OK. */
3152 if (scope && TYPE_P (scope)
3153 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3154 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3156 && (cp_lexer_peek_token (parser->lexer)->value
3157 == TYPE_IDENTIFIER (scope)))
3159 cp_lexer_consume_token (parser->lexer);
3160 return build_nt (BIT_NOT_EXPR, scope);
3163 /* If there was an explicit qualification (S::~T), first look
3164 in the scope given by the qualification (i.e., S). */
3167 cp_parser_parse_tentatively (parser);
3168 type_decl = cp_parser_class_name (parser,
3169 /*typename_keyword_p=*/false,
3170 /*template_keyword_p=*/false,
3172 /*check_dependency=*/false,
3173 /*class_head_p=*/false,
3175 if (cp_parser_parse_definitely (parser))
3176 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3178 /* In "N::S::~S", look in "N" as well. */
3179 if (scope && qualifying_scope)
3181 cp_parser_parse_tentatively (parser);
3182 parser->scope = qualifying_scope;
3183 parser->object_scope = NULL_TREE;
3184 parser->qualifying_scope = NULL_TREE;
3186 = cp_parser_class_name (parser,
3187 /*typename_keyword_p=*/false,
3188 /*template_keyword_p=*/false,
3190 /*check_dependency=*/false,
3191 /*class_head_p=*/false,
3193 if (cp_parser_parse_definitely (parser))
3194 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3196 /* In "p->S::~T", look in the scope given by "*p" as well. */
3197 else if (object_scope)
3199 cp_parser_parse_tentatively (parser);
3200 parser->scope = object_scope;
3201 parser->object_scope = NULL_TREE;
3202 parser->qualifying_scope = NULL_TREE;
3204 = cp_parser_class_name (parser,
3205 /*typename_keyword_p=*/false,
3206 /*template_keyword_p=*/false,
3208 /*check_dependency=*/false,
3209 /*class_head_p=*/false,
3211 if (cp_parser_parse_definitely (parser))
3212 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3214 /* Look in the surrounding context. */
3215 parser->scope = NULL_TREE;
3216 parser->object_scope = NULL_TREE;
3217 parser->qualifying_scope = NULL_TREE;
3219 = cp_parser_class_name (parser,
3220 /*typename_keyword_p=*/false,
3221 /*template_keyword_p=*/false,
3223 /*check_dependency=*/false,
3224 /*class_head_p=*/false,
3226 /* If an error occurred, assume that the name of the
3227 destructor is the same as the name of the qualifying
3228 class. That allows us to keep parsing after running
3229 into ill-formed destructor names. */
3230 if (type_decl == error_mark_node && scope && TYPE_P (scope))
3231 return build_nt (BIT_NOT_EXPR, scope);
3232 else if (type_decl == error_mark_node)
3233 return error_mark_node;
3237 A typedef-name that names a class shall not be used as the
3238 identifier in the declarator for a destructor declaration. */
3240 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3241 && !DECL_SELF_REFERENCE_P (type_decl))
3242 error ("typedef-name %qD used as destructor declarator",
3245 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3249 if (token->keyword == RID_OPERATOR)
3253 /* This could be a template-id, so we try that first. */
3254 cp_parser_parse_tentatively (parser);
3255 /* Try a template-id. */
3256 id = cp_parser_template_id (parser, template_keyword_p,
3257 /*check_dependency_p=*/true,
3259 /* If that worked, we're done. */
3260 if (cp_parser_parse_definitely (parser))
3262 /* We still don't know whether we're looking at an
3263 operator-function-id or a conversion-function-id. */
3264 cp_parser_parse_tentatively (parser);
3265 /* Try an operator-function-id. */
3266 id = cp_parser_operator_function_id (parser);
3267 /* If that didn't work, try a conversion-function-id. */
3268 if (!cp_parser_parse_definitely (parser))
3269 id = cp_parser_conversion_function_id (parser);
3276 cp_parser_error (parser, "expected unqualified-id");
3277 return error_mark_node;
3281 /* Parse an (optional) nested-name-specifier.
3283 nested-name-specifier:
3284 class-or-namespace-name :: nested-name-specifier [opt]
3285 class-or-namespace-name :: template nested-name-specifier [opt]
3287 PARSER->SCOPE should be set appropriately before this function is
3288 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3289 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3292 Sets PARSER->SCOPE to the class (TYPE) or namespace
3293 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3294 it unchanged if there is no nested-name-specifier. Returns the new
3295 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3297 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3298 part of a declaration and/or decl-specifier. */
3301 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3302 bool typename_keyword_p,
3303 bool check_dependency_p,
3305 bool is_declaration)
3307 bool success = false;
3308 tree access_check = NULL_TREE;
3309 cp_token_position start = 0;
3312 /* If the next token corresponds to a nested name specifier, there
3313 is no need to reparse it. However, if CHECK_DEPENDENCY_P is
3314 false, it may have been true before, in which case something
3315 like `A<X>::B<Y>::C' may have resulted in a nested-name-specifier
3316 of `A<X>::', where it should now be `A<X>::B<Y>::'. So, when
3317 CHECK_DEPENDENCY_P is false, we have to fall through into the
3319 if (check_dependency_p
3320 && cp_lexer_next_token_is (parser->lexer, CPP_NESTED_NAME_SPECIFIER))
3322 cp_parser_pre_parsed_nested_name_specifier (parser);
3323 return parser->scope;
3326 /* Remember where the nested-name-specifier starts. */
3327 if (cp_parser_parsing_tentatively (parser)
3328 && !cp_parser_committed_to_tentative_parse (parser))
3329 start = cp_lexer_token_position (parser->lexer, false);
3331 push_deferring_access_checks (dk_deferred);
3337 tree saved_qualifying_scope;
3338 bool template_keyword_p;
3340 /* Spot cases that cannot be the beginning of a
3341 nested-name-specifier. */
3342 token = cp_lexer_peek_token (parser->lexer);
3344 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3345 the already parsed nested-name-specifier. */
3346 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3348 /* Grab the nested-name-specifier and continue the loop. */
3349 cp_parser_pre_parsed_nested_name_specifier (parser);
3354 /* Spot cases that cannot be the beginning of a
3355 nested-name-specifier. On the second and subsequent times
3356 through the loop, we look for the `template' keyword. */
3357 if (success && token->keyword == RID_TEMPLATE)
3359 /* A template-id can start a nested-name-specifier. */
3360 else if (token->type == CPP_TEMPLATE_ID)
3364 /* If the next token is not an identifier, then it is
3365 definitely not a class-or-namespace-name. */
3366 if (token->type != CPP_NAME)
3368 /* If the following token is neither a `<' (to begin a
3369 template-id), nor a `::', then we are not looking at a
3370 nested-name-specifier. */
3371 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3372 if (token->type != CPP_SCOPE
3373 && !cp_parser_nth_token_starts_template_argument_list_p
3378 /* The nested-name-specifier is optional, so we parse
3380 cp_parser_parse_tentatively (parser);
3382 /* Look for the optional `template' keyword, if this isn't the
3383 first time through the loop. */
3385 template_keyword_p = cp_parser_optional_template_keyword (parser);
3387 template_keyword_p = false;
3389 /* Save the old scope since the name lookup we are about to do
3390 might destroy it. */
3391 old_scope = parser->scope;
3392 saved_qualifying_scope = parser->qualifying_scope;
3393 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
3394 look up names in "X<T>::I" in order to determine that "Y" is
3395 a template. So, if we have a typename at this point, we make
3396 an effort to look through it. */
3398 && !typename_keyword_p
3400 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3401 parser->scope = resolve_typename_type (parser->scope,
3402 /*only_current_p=*/false);
3403 /* Parse the qualifying entity. */
3405 = cp_parser_class_or_namespace_name (parser,
3411 /* Look for the `::' token. */
3412 cp_parser_require (parser, CPP_SCOPE, "`::'");
3414 /* If we found what we wanted, we keep going; otherwise, we're
3416 if (!cp_parser_parse_definitely (parser))
3418 bool error_p = false;
3420 /* Restore the OLD_SCOPE since it was valid before the
3421 failed attempt at finding the last
3422 class-or-namespace-name. */
3423 parser->scope = old_scope;
3424 parser->qualifying_scope = saved_qualifying_scope;
3425 /* If the next token is an identifier, and the one after
3426 that is a `::', then any valid interpretation would have
3427 found a class-or-namespace-name. */
3428 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3429 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3431 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3434 token = cp_lexer_consume_token (parser->lexer);
3439 decl = cp_parser_lookup_name_simple (parser, token->value);
3440 if (TREE_CODE (decl) == TEMPLATE_DECL)
3441 error ("%qD used without template parameters", decl);
3443 cp_parser_name_lookup_error
3444 (parser, token->value, decl,
3445 "is not a class or namespace");
3446 parser->scope = NULL_TREE;
3448 /* Treat this as a successful nested-name-specifier
3453 If the name found is not a class-name (clause
3454 _class_) or namespace-name (_namespace.def_), the
3455 program is ill-formed. */
3458 cp_lexer_consume_token (parser->lexer);
3463 /* We've found one valid nested-name-specifier. */
3465 /* Make sure we look in the right scope the next time through
3467 parser->scope = (TREE_CODE (new_scope) == TYPE_DECL
3468 ? TREE_TYPE (new_scope)
3470 /* If it is a class scope, try to complete it; we are about to
3471 be looking up names inside the class. */
3472 if (TYPE_P (parser->scope)
3473 /* Since checking types for dependency can be expensive,
3474 avoid doing it if the type is already complete. */
3475 && !COMPLETE_TYPE_P (parser->scope)
3476 /* Do not try to complete dependent types. */
3477 && !dependent_type_p (parser->scope))
3478 complete_type (parser->scope);
3481 /* Retrieve any deferred checks. Do not pop this access checks yet
3482 so the memory will not be reclaimed during token replacing below. */
3483 access_check = get_deferred_access_checks ();
3485 /* If parsing tentatively, replace the sequence of tokens that makes
3486 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3487 token. That way, should we re-parse the token stream, we will
3488 not have to repeat the effort required to do the parse, nor will
3489 we issue duplicate error messages. */
3490 if (success && start)
3492 cp_token *token = cp_lexer_token_at (parser->lexer, start);
3494 /* Reset the contents of the START token. */
3495 token->type = CPP_NESTED_NAME_SPECIFIER;
3496 token->value = build_tree_list (access_check, parser->scope);
3497 TREE_TYPE (token->value) = parser->qualifying_scope;
3498 token->keyword = RID_MAX;
3500 /* Purge all subsequent tokens. */
3501 cp_lexer_purge_tokens_after (parser->lexer, start);
3504 pop_deferring_access_checks ();
3505 return success ? parser->scope : NULL_TREE;
3508 /* Parse a nested-name-specifier. See
3509 cp_parser_nested_name_specifier_opt for details. This function
3510 behaves identically, except that it will an issue an error if no
3511 nested-name-specifier is present, and it will return
3512 ERROR_MARK_NODE, rather than NULL_TREE, if no nested-name-specifier
3516 cp_parser_nested_name_specifier (cp_parser *parser,
3517 bool typename_keyword_p,
3518 bool check_dependency_p,
3520 bool is_declaration)
3524 /* Look for the nested-name-specifier. */
3525 scope = cp_parser_nested_name_specifier_opt (parser,
3530 /* If it was not present, issue an error message. */
3533 cp_parser_error (parser, "expected nested-name-specifier");
3534 parser->scope = NULL_TREE;
3535 return error_mark_node;
3541 /* Parse a class-or-namespace-name.
3543 class-or-namespace-name:
3547 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3548 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3549 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3550 TYPE_P is TRUE iff the next name should be taken as a class-name,
3551 even the same name is declared to be another entity in the same
3554 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3555 specified by the class-or-namespace-name. If neither is found the
3556 ERROR_MARK_NODE is returned. */
3559 cp_parser_class_or_namespace_name (cp_parser *parser,
3560 bool typename_keyword_p,
3561 bool template_keyword_p,
3562 bool check_dependency_p,
3564 bool is_declaration)
3567 tree saved_qualifying_scope;
3568 tree saved_object_scope;
3572 /* Before we try to parse the class-name, we must save away the
3573 current PARSER->SCOPE since cp_parser_class_name will destroy
3575 saved_scope = parser->scope;
3576 saved_qualifying_scope = parser->qualifying_scope;
3577 saved_object_scope = parser->object_scope;
3578 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
3579 there is no need to look for a namespace-name. */
3580 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
3582 cp_parser_parse_tentatively (parser);
3583 scope = cp_parser_class_name (parser,
3586 type_p ? class_type : none_type,
3588 /*class_head_p=*/false,
3590 /* If that didn't work, try for a namespace-name. */
3591 if (!only_class_p && !cp_parser_parse_definitely (parser))
3593 /* Restore the saved scope. */
3594 parser->scope = saved_scope;
3595 parser->qualifying_scope = saved_qualifying_scope;
3596 parser->object_scope = saved_object_scope;
3597 /* If we are not looking at an identifier followed by the scope
3598 resolution operator, then this is not part of a
3599 nested-name-specifier. (Note that this function is only used
3600 to parse the components of a nested-name-specifier.) */
3601 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
3602 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
3603 return error_mark_node;
3604 scope = cp_parser_namespace_name (parser);
3610 /* Parse a postfix-expression.
3614 postfix-expression [ expression ]
3615 postfix-expression ( expression-list [opt] )
3616 simple-type-specifier ( expression-list [opt] )
3617 typename :: [opt] nested-name-specifier identifier
3618 ( expression-list [opt] )
3619 typename :: [opt] nested-name-specifier template [opt] template-id
3620 ( expression-list [opt] )
3621 postfix-expression . template [opt] id-expression
3622 postfix-expression -> template [opt] id-expression
3623 postfix-expression . pseudo-destructor-name
3624 postfix-expression -> pseudo-destructor-name
3625 postfix-expression ++
3626 postfix-expression --
3627 dynamic_cast < type-id > ( expression )
3628 static_cast < type-id > ( expression )
3629 reinterpret_cast < type-id > ( expression )
3630 const_cast < type-id > ( expression )
3631 typeid ( expression )
3637 ( type-id ) { initializer-list , [opt] }
3639 This extension is a GNU version of the C99 compound-literal
3640 construct. (The C99 grammar uses `type-name' instead of `type-id',
3641 but they are essentially the same concept.)
3643 If ADDRESS_P is true, the postfix expression is the operand of the
3646 Returns a representation of the expression. */
3649 cp_parser_postfix_expression (cp_parser *parser, bool address_p)
3653 cp_id_kind idk = CP_ID_KIND_NONE;
3654 tree postfix_expression = NULL_TREE;
3655 /* Non-NULL only if the current postfix-expression can be used to
3656 form a pointer-to-member. In that case, QUALIFYING_CLASS is the
3657 class used to qualify the member. */
3658 tree qualifying_class = NULL_TREE;
3660 /* Peek at the next token. */
3661 token = cp_lexer_peek_token (parser->lexer);
3662 /* Some of the productions are determined by keywords. */
3663 keyword = token->keyword;
3673 const char *saved_message;
3675 /* All of these can be handled in the same way from the point
3676 of view of parsing. Begin by consuming the token
3677 identifying the cast. */
3678 cp_lexer_consume_token (parser->lexer);
3680 /* New types cannot be defined in the cast. */
3681 saved_message = parser->type_definition_forbidden_message;
3682 parser->type_definition_forbidden_message
3683 = "types may not be defined in casts";
3685 /* Look for the opening `<'. */
3686 cp_parser_require (parser, CPP_LESS, "`<'");
3687 /* Parse the type to which we are casting. */
3688 type = cp_parser_type_id (parser);
3689 /* Look for the closing `>'. */
3690 cp_parser_require (parser, CPP_GREATER, "`>'");
3691 /* Restore the old message. */
3692 parser->type_definition_forbidden_message = saved_message;
3694 /* And the expression which is being cast. */
3695 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3696 expression = cp_parser_expression (parser);
3697 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3699 /* Only type conversions to integral or enumeration types
3700 can be used in constant-expressions. */
3701 if (parser->integral_constant_expression_p
3702 && !dependent_type_p (type)
3703 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3704 && (cp_parser_non_integral_constant_expression
3706 "a cast to a type other than an integral or "
3707 "enumeration type")))
3708 return error_mark_node;
3714 = build_dynamic_cast (type, expression);
3718 = build_static_cast (type, expression);
3722 = build_reinterpret_cast (type, expression);
3726 = build_const_cast (type, expression);
3737 const char *saved_message;
3738 bool saved_in_type_id_in_expr_p;
3740 /* Consume the `typeid' token. */
3741 cp_lexer_consume_token (parser->lexer);
3742 /* Look for the `(' token. */
3743 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3744 /* Types cannot be defined in a `typeid' expression. */
3745 saved_message = parser->type_definition_forbidden_message;
3746 parser->type_definition_forbidden_message
3747 = "types may not be defined in a `typeid\' expression";
3748 /* We can't be sure yet whether we're looking at a type-id or an
3750 cp_parser_parse_tentatively (parser);
3751 /* Try a type-id first. */
3752 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3753 parser->in_type_id_in_expr_p = true;
3754 type = cp_parser_type_id (parser);
3755 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3756 /* Look for the `)' token. Otherwise, we can't be sure that
3757 we're not looking at an expression: consider `typeid (int
3758 (3))', for example. */
3759 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3760 /* If all went well, simply lookup the type-id. */
3761 if (cp_parser_parse_definitely (parser))
3762 postfix_expression = get_typeid (type);
3763 /* Otherwise, fall back to the expression variant. */
3768 /* Look for an expression. */
3769 expression = cp_parser_expression (parser);
3770 /* Compute its typeid. */
3771 postfix_expression = build_typeid (expression);
3772 /* Look for the `)' token. */
3773 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3775 /* `typeid' may not appear in an integral constant expression. */
3776 if (cp_parser_non_integral_constant_expression(parser,
3777 "`typeid' operator"))
3778 return error_mark_node;
3779 /* Restore the saved message. */
3780 parser->type_definition_forbidden_message = saved_message;
3786 bool template_p = false;
3790 /* Consume the `typename' token. */
3791 cp_lexer_consume_token (parser->lexer);
3792 /* Look for the optional `::' operator. */
3793 cp_parser_global_scope_opt (parser,
3794 /*current_scope_valid_p=*/false);
3795 /* Look for the nested-name-specifier. */
3796 cp_parser_nested_name_specifier (parser,
3797 /*typename_keyword_p=*/true,
3798 /*check_dependency_p=*/true,
3800 /*is_declaration=*/true);
3801 /* Look for the optional `template' keyword. */
3802 template_p = cp_parser_optional_template_keyword (parser);
3803 /* We don't know whether we're looking at a template-id or an
3805 cp_parser_parse_tentatively (parser);
3806 /* Try a template-id. */
3807 id = cp_parser_template_id (parser, template_p,
3808 /*check_dependency_p=*/true,
3809 /*is_declaration=*/true);
3810 /* If that didn't work, try an identifier. */
3811 if (!cp_parser_parse_definitely (parser))
3812 id = cp_parser_identifier (parser);
3813 /* If we look up a template-id in a non-dependent qualifying
3814 scope, there's no need to create a dependent type. */
3815 if (TREE_CODE (id) == TYPE_DECL
3816 && !dependent_type_p (parser->scope))
3817 type = TREE_TYPE (id);
3818 /* Create a TYPENAME_TYPE to represent the type to which the
3819 functional cast is being performed. */
3821 type = make_typename_type (parser->scope, id,
3825 postfix_expression = cp_parser_functional_cast (parser, type);
3833 /* If the next thing is a simple-type-specifier, we may be
3834 looking at a functional cast. We could also be looking at
3835 an id-expression. So, we try the functional cast, and if
3836 that doesn't work we fall back to the primary-expression. */
3837 cp_parser_parse_tentatively (parser);
3838 /* Look for the simple-type-specifier. */
3839 type = cp_parser_simple_type_specifier (parser,
3840 /*decl_specs=*/NULL,
3841 CP_PARSER_FLAGS_NONE);
3842 /* Parse the cast itself. */
3843 if (!cp_parser_error_occurred (parser))
3845 = cp_parser_functional_cast (parser, type);
3846 /* If that worked, we're done. */
3847 if (cp_parser_parse_definitely (parser))
3850 /* If the functional-cast didn't work out, try a
3851 compound-literal. */
3852 if (cp_parser_allow_gnu_extensions_p (parser)
3853 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
3855 tree initializer_list = NULL_TREE;
3856 bool saved_in_type_id_in_expr_p;
3858 cp_parser_parse_tentatively (parser);
3859 /* Consume the `('. */
3860 cp_lexer_consume_token (parser->lexer);
3861 /* Parse the type. */
3862 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3863 parser->in_type_id_in_expr_p = true;
3864 type = cp_parser_type_id (parser);
3865 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3866 /* Look for the `)'. */
3867 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3868 /* Look for the `{'. */
3869 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
3870 /* If things aren't going well, there's no need to
3872 if (!cp_parser_error_occurred (parser))
3874 bool non_constant_p;
3875 /* Parse the initializer-list. */
3877 = cp_parser_initializer_list (parser, &non_constant_p);
3878 /* Allow a trailing `,'. */
3879 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
3880 cp_lexer_consume_token (parser->lexer);
3881 /* Look for the final `}'. */
3882 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
3884 /* If that worked, we're definitely looking at a
3885 compound-literal expression. */
3886 if (cp_parser_parse_definitely (parser))
3888 /* Warn the user that a compound literal is not
3889 allowed in standard C++. */
3891 pedwarn ("ISO C++ forbids compound-literals");
3892 /* Form the representation of the compound-literal. */
3894 = finish_compound_literal (type, initializer_list);
3899 /* It must be a primary-expression. */
3900 postfix_expression = cp_parser_primary_expression (parser,
3907 /* If we were avoiding committing to the processing of a
3908 qualified-id until we knew whether or not we had a
3909 pointer-to-member, we now know. */
3910 if (qualifying_class)
3914 /* Peek at the next token. */
3915 token = cp_lexer_peek_token (parser->lexer);
3916 done = (token->type != CPP_OPEN_SQUARE
3917 && token->type != CPP_OPEN_PAREN
3918 && token->type != CPP_DOT
3919 && token->type != CPP_DEREF
3920 && token->type != CPP_PLUS_PLUS
3921 && token->type != CPP_MINUS_MINUS);
3923 postfix_expression = finish_qualified_id_expr (qualifying_class,
3928 return postfix_expression;
3931 /* Keep looping until the postfix-expression is complete. */
3934 if (idk == CP_ID_KIND_UNQUALIFIED
3935 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
3936 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
3937 /* It is not a Koenig lookup function call. */
3939 = unqualified_name_lookup_error (postfix_expression);
3941 /* Peek at the next token. */
3942 token = cp_lexer_peek_token (parser->lexer);
3944 switch (token->type)
3946 case CPP_OPEN_SQUARE:
3948 = cp_parser_postfix_open_square_expression (parser,
3951 idk = CP_ID_KIND_NONE;
3954 case CPP_OPEN_PAREN:
3955 /* postfix-expression ( expression-list [opt] ) */
3958 tree args = (cp_parser_parenthesized_expression_list
3959 (parser, false, /*non_constant_p=*/NULL));
3961 if (args == error_mark_node)
3963 postfix_expression = error_mark_node;
3967 /* Function calls are not permitted in
3968 constant-expressions. */
3969 if (cp_parser_non_integral_constant_expression (parser,
3972 postfix_expression = error_mark_node;
3977 if (idk == CP_ID_KIND_UNQUALIFIED)
3979 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
3985 = perform_koenig_lookup (postfix_expression, args);
3989 = unqualified_fn_lookup_error (postfix_expression);
3991 /* We do not perform argument-dependent lookup if
3992 normal lookup finds a non-function, in accordance
3993 with the expected resolution of DR 218. */
3994 else if (args && is_overloaded_fn (postfix_expression))
3996 tree fn = get_first_fn (postfix_expression);
3998 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3999 fn = OVL_CURRENT (TREE_OPERAND (fn, 0));
4001 /* Only do argument dependent lookup if regular
4002 lookup does not find a set of member functions.
4003 [basic.lookup.koenig]/2a */
4004 if (!DECL_FUNCTION_MEMBER_P (fn))
4008 = perform_koenig_lookup (postfix_expression, args);
4013 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4015 tree instance = TREE_OPERAND (postfix_expression, 0);
4016 tree fn = TREE_OPERAND (postfix_expression, 1);
4018 if (processing_template_decl
4019 && (type_dependent_expression_p (instance)
4020 || (!BASELINK_P (fn)
4021 && TREE_CODE (fn) != FIELD_DECL)
4022 || type_dependent_expression_p (fn)
4023 || any_type_dependent_arguments_p (args)))
4026 = build_min_nt (CALL_EXPR, postfix_expression,
4031 if (BASELINK_P (fn))
4033 = (build_new_method_call
4034 (instance, fn, args, NULL_TREE,
4035 (idk == CP_ID_KIND_QUALIFIED
4036 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)));
4039 = finish_call_expr (postfix_expression, args,
4040 /*disallow_virtual=*/false,
4041 /*koenig_p=*/false);
4043 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4044 || TREE_CODE (postfix_expression) == MEMBER_REF
4045 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4046 postfix_expression = (build_offset_ref_call_from_tree
4047 (postfix_expression, args));
4048 else if (idk == CP_ID_KIND_QUALIFIED)
4049 /* A call to a static class member, or a namespace-scope
4052 = finish_call_expr (postfix_expression, args,
4053 /*disallow_virtual=*/true,
4056 /* All other function calls. */
4058 = finish_call_expr (postfix_expression, args,
4059 /*disallow_virtual=*/false,
4062 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4063 idk = CP_ID_KIND_NONE;
4069 /* postfix-expression . template [opt] id-expression
4070 postfix-expression . pseudo-destructor-name
4071 postfix-expression -> template [opt] id-expression
4072 postfix-expression -> pseudo-destructor-name */
4074 /* Consume the `.' or `->' operator. */
4075 cp_lexer_consume_token (parser->lexer);
4078 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4084 /* postfix-expression ++ */
4085 /* Consume the `++' token. */
4086 cp_lexer_consume_token (parser->lexer);
4087 /* Generate a representation for the complete expression. */
4089 = finish_increment_expr (postfix_expression,
4090 POSTINCREMENT_EXPR);
4091 /* Increments may not appear in constant-expressions. */
4092 if (cp_parser_non_integral_constant_expression (parser,
4094 postfix_expression = error_mark_node;
4095 idk = CP_ID_KIND_NONE;
4098 case CPP_MINUS_MINUS:
4099 /* postfix-expression -- */
4100 /* Consume the `--' token. */
4101 cp_lexer_consume_token (parser->lexer);
4102 /* Generate a representation for the complete expression. */
4104 = finish_increment_expr (postfix_expression,
4105 POSTDECREMENT_EXPR);
4106 /* Decrements may not appear in constant-expressions. */
4107 if (cp_parser_non_integral_constant_expression (parser,
4109 postfix_expression = error_mark_node;
4110 idk = CP_ID_KIND_NONE;
4114 return postfix_expression;
4118 /* We should never get here. */
4120 return error_mark_node;
4123 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4124 by cp_parser_builtin_offsetof. We're looking for
4126 postfix-expression [ expression ]
4128 FOR_OFFSETOF is set if we're being called in that context, which
4129 changes how we deal with integer constant expressions. */
4132 cp_parser_postfix_open_square_expression (cp_parser *parser,
4133 tree postfix_expression,
4138 /* Consume the `[' token. */
4139 cp_lexer_consume_token (parser->lexer);
4141 /* Parse the index expression. */
4142 /* ??? For offsetof, there is a question of what to allow here. If
4143 offsetof is not being used in an integral constant expression context,
4144 then we *could* get the right answer by computing the value at runtime.
4145 If we are in an integral constant expression context, then we might
4146 could accept any constant expression; hard to say without analysis.
4147 Rather than open the barn door too wide right away, allow only integer
4148 constant expressions here. */
4150 index = cp_parser_constant_expression (parser, false, NULL);
4152 index = cp_parser_expression (parser);
4154 /* Look for the closing `]'. */
4155 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4157 /* Build the ARRAY_REF. */
4158 postfix_expression = grok_array_decl (postfix_expression, index);
4160 /* When not doing offsetof, array references are not permitted in
4161 constant-expressions. */
4163 && (cp_parser_non_integral_constant_expression
4164 (parser, "an array reference")))
4165 postfix_expression = error_mark_node;
4167 return postfix_expression;
4170 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4171 by cp_parser_builtin_offsetof. We're looking for
4173 postfix-expression . template [opt] id-expression
4174 postfix-expression . pseudo-destructor-name
4175 postfix-expression -> template [opt] id-expression
4176 postfix-expression -> pseudo-destructor-name
4178 FOR_OFFSETOF is set if we're being called in that context. That sorta
4179 limits what of the above we'll actually accept, but nevermind.
4180 TOKEN_TYPE is the "." or "->" token, which will already have been
4181 removed from the stream. */
4184 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4185 enum cpp_ttype token_type,
4186 tree postfix_expression,
4187 bool for_offsetof, cp_id_kind *idk)
4192 bool pseudo_destructor_p;
4193 tree scope = NULL_TREE;
4195 /* If this is a `->' operator, dereference the pointer. */
4196 if (token_type == CPP_DEREF)
4197 postfix_expression = build_x_arrow (postfix_expression);
4198 /* Check to see whether or not the expression is type-dependent. */
4199 dependent_p = type_dependent_expression_p (postfix_expression);
4200 /* The identifier following the `->' or `.' is not qualified. */
4201 parser->scope = NULL_TREE;
4202 parser->qualifying_scope = NULL_TREE;
4203 parser->object_scope = NULL_TREE;
4204 *idk = CP_ID_KIND_NONE;
4205 /* Enter the scope corresponding to the type of the object
4206 given by the POSTFIX_EXPRESSION. */
4207 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4209 scope = TREE_TYPE (postfix_expression);
4210 /* According to the standard, no expression should ever have
4211 reference type. Unfortunately, we do not currently match
4212 the standard in this respect in that our internal representation
4213 of an expression may have reference type even when the standard
4214 says it does not. Therefore, we have to manually obtain the
4215 underlying type here. */
4216 scope = non_reference (scope);
4217 /* The type of the POSTFIX_EXPRESSION must be complete. */
4218 scope = complete_type_or_else (scope, NULL_TREE);
4219 /* Let the name lookup machinery know that we are processing a
4220 class member access expression. */
4221 parser->context->object_type = scope;
4222 /* If something went wrong, we want to be able to discern that case,
4223 as opposed to the case where there was no SCOPE due to the type
4224 of expression being dependent. */
4226 scope = error_mark_node;
4227 /* If the SCOPE was erroneous, make the various semantic analysis
4228 functions exit quickly -- and without issuing additional error
4230 if (scope == error_mark_node)
4231 postfix_expression = error_mark_node;
4234 /* Assume this expression is not a pseudo-destructor access. */
4235 pseudo_destructor_p = false;
4237 /* If the SCOPE is a scalar type, then, if this is a valid program,
4238 we must be looking at a pseudo-destructor-name. */
4239 if (scope && SCALAR_TYPE_P (scope))
4244 cp_parser_parse_tentatively (parser);
4245 /* Parse the pseudo-destructor-name. */
4247 cp_parser_pseudo_destructor_name (parser, &s, &type);
4248 if (cp_parser_parse_definitely (parser))
4250 pseudo_destructor_p = true;
4252 = finish_pseudo_destructor_expr (postfix_expression,
4253 s, TREE_TYPE (type));
4257 if (!pseudo_destructor_p)
4259 /* If the SCOPE is not a scalar type, we are looking at an
4260 ordinary class member access expression, rather than a
4261 pseudo-destructor-name. */
4262 template_p = cp_parser_optional_template_keyword (parser);
4263 /* Parse the id-expression. */
4264 name = cp_parser_id_expression (parser, template_p,
4265 /*check_dependency_p=*/true,
4266 /*template_p=*/NULL,
4267 /*declarator_p=*/false);
4268 /* In general, build a SCOPE_REF if the member name is qualified.
4269 However, if the name was not dependent and has already been
4270 resolved; there is no need to build the SCOPE_REF. For example;
4272 struct X { void f(); };
4273 template <typename T> void f(T* t) { t->X::f(); }
4275 Even though "t" is dependent, "X::f" is not and has been resolved
4276 to a BASELINK; there is no need to include scope information. */
4278 /* But we do need to remember that there was an explicit scope for
4279 virtual function calls. */
4281 *idk = CP_ID_KIND_QUALIFIED;
4283 /* If the name is a template-id that names a type, we will get a
4284 TYPE_DECL here. That is invalid code. */
4285 if (TREE_CODE (name) == TYPE_DECL)
4287 error ("invalid use of %qD", name);
4288 postfix_expression = error_mark_node;
4292 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4294 name = build_nt (SCOPE_REF, parser->scope, name);
4295 parser->scope = NULL_TREE;
4296 parser->qualifying_scope = NULL_TREE;
4297 parser->object_scope = NULL_TREE;
4299 if (scope && name && BASELINK_P (name))
4300 adjust_result_of_qualified_name_lookup
4301 (name, BINFO_TYPE (BASELINK_BINFO (name)), scope);
4303 = finish_class_member_access_expr (postfix_expression, name);
4307 /* We no longer need to look up names in the scope of the object on
4308 the left-hand side of the `.' or `->' operator. */
4309 parser->context->object_type = NULL_TREE;
4311 /* Outside of offsetof, these operators may not appear in
4312 constant-expressions. */
4314 && (cp_parser_non_integral_constant_expression
4315 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4316 postfix_expression = error_mark_node;
4318 return postfix_expression;
4321 /* Parse a parenthesized expression-list.
4324 assignment-expression
4325 expression-list, assignment-expression
4330 identifier, expression-list
4332 Returns a TREE_LIST. The TREE_VALUE of each node is a
4333 representation of an assignment-expression. Note that a TREE_LIST
4334 is returned even if there is only a single expression in the list.
4335 error_mark_node is returned if the ( and or ) are
4336 missing. NULL_TREE is returned on no expressions. The parentheses
4337 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4338 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4339 indicates whether or not all of the expressions in the list were
4343 cp_parser_parenthesized_expression_list (cp_parser* parser,
4344 bool is_attribute_list,
4345 bool *non_constant_p)
4347 tree expression_list = NULL_TREE;
4348 bool fold_expr_p = is_attribute_list;
4349 tree identifier = NULL_TREE;
4351 /* Assume all the expressions will be constant. */
4353 *non_constant_p = false;
4355 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4356 return error_mark_node;
4358 /* Consume expressions until there are no more. */
4359 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4364 /* At the beginning of attribute lists, check to see if the
4365 next token is an identifier. */
4366 if (is_attribute_list
4367 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4371 /* Consume the identifier. */
4372 token = cp_lexer_consume_token (parser->lexer);
4373 /* Save the identifier. */
4374 identifier = token->value;
4378 /* Parse the next assignment-expression. */
4381 bool expr_non_constant_p;
4382 expr = (cp_parser_constant_expression
4383 (parser, /*allow_non_constant_p=*/true,
4384 &expr_non_constant_p));
4385 if (expr_non_constant_p)
4386 *non_constant_p = true;
4389 expr = cp_parser_assignment_expression (parser);
4392 expr = fold_non_dependent_expr (expr);
4394 /* Add it to the list. We add error_mark_node
4395 expressions to the list, so that we can still tell if
4396 the correct form for a parenthesized expression-list
4397 is found. That gives better errors. */
4398 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4400 if (expr == error_mark_node)
4404 /* After the first item, attribute lists look the same as
4405 expression lists. */
4406 is_attribute_list = false;
4409 /* If the next token isn't a `,', then we are done. */
4410 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4413 /* Otherwise, consume the `,' and keep going. */
4414 cp_lexer_consume_token (parser->lexer);
4417 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4422 /* We try and resync to an unnested comma, as that will give the
4423 user better diagnostics. */
4424 ending = cp_parser_skip_to_closing_parenthesis (parser,
4425 /*recovering=*/true,
4427 /*consume_paren=*/true);
4431 return error_mark_node;
4434 /* We built up the list in reverse order so we must reverse it now. */
4435 expression_list = nreverse (expression_list);
4437 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4439 return expression_list;
4442 /* Parse a pseudo-destructor-name.
4444 pseudo-destructor-name:
4445 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4446 :: [opt] nested-name-specifier template template-id :: ~ type-name
4447 :: [opt] nested-name-specifier [opt] ~ type-name
4449 If either of the first two productions is used, sets *SCOPE to the
4450 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4451 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4452 or ERROR_MARK_NODE if the parse fails. */
4455 cp_parser_pseudo_destructor_name (cp_parser* parser,
4459 bool nested_name_specifier_p;
4461 /* Assume that things will not work out. */
4462 *type = error_mark_node;
4464 /* Look for the optional `::' operator. */
4465 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4466 /* Look for the optional nested-name-specifier. */
4467 nested_name_specifier_p
4468 = (cp_parser_nested_name_specifier_opt (parser,
4469 /*typename_keyword_p=*/false,
4470 /*check_dependency_p=*/true,
4472 /*is_declaration=*/true)
4474 /* Now, if we saw a nested-name-specifier, we might be doing the
4475 second production. */
4476 if (nested_name_specifier_p
4477 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4479 /* Consume the `template' keyword. */
4480 cp_lexer_consume_token (parser->lexer);
4481 /* Parse the template-id. */
4482 cp_parser_template_id (parser,
4483 /*template_keyword_p=*/true,
4484 /*check_dependency_p=*/false,
4485 /*is_declaration=*/true);
4486 /* Look for the `::' token. */
4487 cp_parser_require (parser, CPP_SCOPE, "`::'");
4489 /* If the next token is not a `~', then there might be some
4490 additional qualification. */
4491 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4493 /* Look for the type-name. */
4494 *scope = TREE_TYPE (cp_parser_type_name (parser));
4496 if (*scope == error_mark_node)
4499 /* If we don't have ::~, then something has gone wrong. Since
4500 the only caller of this function is looking for something
4501 after `.' or `->' after a scalar type, most likely the
4502 program is trying to get a member of a non-aggregate
4504 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4505 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4507 cp_parser_error (parser, "request for member of non-aggregate type");
4511 /* Look for the `::' token. */
4512 cp_parser_require (parser, CPP_SCOPE, "`::'");
4517 /* Look for the `~'. */
4518 cp_parser_require (parser, CPP_COMPL, "`~'");
4519 /* Look for the type-name again. We are not responsible for
4520 checking that it matches the first type-name. */
4521 *type = cp_parser_type_name (parser);
4524 /* Parse a unary-expression.
4530 unary-operator cast-expression
4531 sizeof unary-expression
4539 __extension__ cast-expression
4540 __alignof__ unary-expression
4541 __alignof__ ( type-id )
4542 __real__ cast-expression
4543 __imag__ cast-expression
4546 ADDRESS_P is true iff the unary-expression is appearing as the
4547 operand of the `&' operator.
4549 Returns a representation of the expression. */
4552 cp_parser_unary_expression (cp_parser *parser, bool address_p)
4555 enum tree_code unary_operator;
4557 /* Peek at the next token. */
4558 token = cp_lexer_peek_token (parser->lexer);
4559 /* Some keywords give away the kind of expression. */
4560 if (token->type == CPP_KEYWORD)
4562 enum rid keyword = token->keyword;
4572 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
4573 /* Consume the token. */
4574 cp_lexer_consume_token (parser->lexer);
4575 /* Parse the operand. */
4576 operand = cp_parser_sizeof_operand (parser, keyword);
4578 if (TYPE_P (operand))
4579 return cxx_sizeof_or_alignof_type (operand, op, true);
4581 return cxx_sizeof_or_alignof_expr (operand, op);
4585 return cp_parser_new_expression (parser);
4588 return cp_parser_delete_expression (parser);
4592 /* The saved value of the PEDANTIC flag. */
4596 /* Save away the PEDANTIC flag. */
4597 cp_parser_extension_opt (parser, &saved_pedantic);
4598 /* Parse the cast-expression. */
4599 expr = cp_parser_simple_cast_expression (parser);
4600 /* Restore the PEDANTIC flag. */
4601 pedantic = saved_pedantic;
4611 /* Consume the `__real__' or `__imag__' token. */
4612 cp_lexer_consume_token (parser->lexer);
4613 /* Parse the cast-expression. */
4614 expression = cp_parser_simple_cast_expression (parser);
4615 /* Create the complete representation. */
4616 return build_x_unary_op ((keyword == RID_REALPART
4617 ? REALPART_EXPR : IMAGPART_EXPR),
4627 /* Look for the `:: new' and `:: delete', which also signal the
4628 beginning of a new-expression, or delete-expression,
4629 respectively. If the next token is `::', then it might be one of
4631 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
4635 /* See if the token after the `::' is one of the keywords in
4636 which we're interested. */
4637 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
4638 /* If it's `new', we have a new-expression. */
4639 if (keyword == RID_NEW)
4640 return cp_parser_new_expression (parser);
4641 /* Similarly, for `delete'. */
4642 else if (keyword == RID_DELETE)
4643 return cp_parser_delete_expression (parser);
4646 /* Look for a unary operator. */
4647 unary_operator = cp_parser_unary_operator (token);
4648 /* The `++' and `--' operators can be handled similarly, even though
4649 they are not technically unary-operators in the grammar. */
4650 if (unary_operator == ERROR_MARK)
4652 if (token->type == CPP_PLUS_PLUS)
4653 unary_operator = PREINCREMENT_EXPR;
4654 else if (token->type == CPP_MINUS_MINUS)
4655 unary_operator = PREDECREMENT_EXPR;
4656 /* Handle the GNU address-of-label extension. */
4657 else if (cp_parser_allow_gnu_extensions_p (parser)
4658 && token->type == CPP_AND_AND)
4662 /* Consume the '&&' token. */
4663 cp_lexer_consume_token (parser->lexer);
4664 /* Look for the identifier. */
4665 identifier = cp_parser_identifier (parser);
4666 /* Create an expression representing the address. */
4667 return finish_label_address_expr (identifier);
4670 if (unary_operator != ERROR_MARK)
4672 tree cast_expression;
4673 tree expression = error_mark_node;
4674 const char *non_constant_p = NULL;
4676 /* Consume the operator token. */
4677 token = cp_lexer_consume_token (parser->lexer);
4678 /* Parse the cast-expression. */
4680 = cp_parser_cast_expression (parser, unary_operator == ADDR_EXPR);
4681 /* Now, build an appropriate representation. */
4682 switch (unary_operator)
4685 non_constant_p = "`*'";
4686 expression = build_x_indirect_ref (cast_expression, "unary *");
4690 non_constant_p = "`&'";
4693 expression = build_x_unary_op (unary_operator, cast_expression);
4696 case PREINCREMENT_EXPR:
4697 case PREDECREMENT_EXPR:
4698 non_constant_p = (unary_operator == PREINCREMENT_EXPR
4703 case TRUTH_NOT_EXPR:
4704 expression = finish_unary_op_expr (unary_operator, cast_expression);
4712 && cp_parser_non_integral_constant_expression (parser,
4714 expression = error_mark_node;
4719 return cp_parser_postfix_expression (parser, address_p);
4722 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
4723 unary-operator, the corresponding tree code is returned. */
4725 static enum tree_code
4726 cp_parser_unary_operator (cp_token* token)
4728 switch (token->type)
4731 return INDIRECT_REF;
4737 return CONVERT_EXPR;
4743 return TRUTH_NOT_EXPR;
4746 return BIT_NOT_EXPR;
4753 /* Parse a new-expression.
4756 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
4757 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
4759 Returns a representation of the expression. */
4762 cp_parser_new_expression (cp_parser* parser)
4764 bool global_scope_p;
4770 /* Look for the optional `::' operator. */
4772 = (cp_parser_global_scope_opt (parser,
4773 /*current_scope_valid_p=*/false)
4775 /* Look for the `new' operator. */
4776 cp_parser_require_keyword (parser, RID_NEW, "`new'");
4777 /* There's no easy way to tell a new-placement from the
4778 `( type-id )' construct. */
4779 cp_parser_parse_tentatively (parser);
4780 /* Look for a new-placement. */
4781 placement = cp_parser_new_placement (parser);
4782 /* If that didn't work out, there's no new-placement. */
4783 if (!cp_parser_parse_definitely (parser))
4784 placement = NULL_TREE;
4786 /* If the next token is a `(', then we have a parenthesized
4788 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4790 /* Consume the `('. */
4791 cp_lexer_consume_token (parser->lexer);
4792 /* Parse the type-id. */
4793 type = cp_parser_type_id (parser);
4794 /* Look for the closing `)'. */
4795 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4796 /* There should not be a direct-new-declarator in this production,
4797 but GCC used to allowed this, so we check and emit a sensible error
4798 message for this case. */
4799 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4801 error ("array bound forbidden after parenthesized type-id");
4802 inform ("try removing the parentheses around the type-id");
4803 cp_parser_direct_new_declarator (parser);
4807 /* Otherwise, there must be a new-type-id. */
4809 type = cp_parser_new_type_id (parser, &nelts);
4811 /* If the next token is a `(', then we have a new-initializer. */
4812 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4813 initializer = cp_parser_new_initializer (parser);
4815 initializer = NULL_TREE;
4817 /* A new-expression may not appear in an integral constant
4819 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
4820 return error_mark_node;
4822 /* Create a representation of the new-expression. */
4823 return build_new (placement, type, nelts, initializer, global_scope_p);
4826 /* Parse a new-placement.
4831 Returns the same representation as for an expression-list. */
4834 cp_parser_new_placement (cp_parser* parser)
4836 tree expression_list;
4838 /* Parse the expression-list. */
4839 expression_list = (cp_parser_parenthesized_expression_list
4840 (parser, false, /*non_constant_p=*/NULL));
4842 return expression_list;
4845 /* Parse a new-type-id.
4848 type-specifier-seq new-declarator [opt]
4850 Returns the TYPE allocated. If the new-type-id indicates an array
4851 type, *NELTS is set to the number of elements in the last array
4852 bound; the TYPE will not include the last array bound. */
4855 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
4857 cp_decl_specifier_seq type_specifier_seq;
4858 cp_declarator *new_declarator;
4859 cp_declarator *declarator;
4860 cp_declarator *outer_declarator;
4861 const char *saved_message;
4864 /* The type-specifier sequence must not contain type definitions.
4865 (It cannot contain declarations of new types either, but if they
4866 are not definitions we will catch that because they are not
4868 saved_message = parser->type_definition_forbidden_message;
4869 parser->type_definition_forbidden_message
4870 = "types may not be defined in a new-type-id";
4871 /* Parse the type-specifier-seq. */
4872 cp_parser_type_specifier_seq (parser, &type_specifier_seq);
4873 /* Restore the old message. */
4874 parser->type_definition_forbidden_message = saved_message;
4875 /* Parse the new-declarator. */
4876 new_declarator = cp_parser_new_declarator_opt (parser);
4878 /* Determine the number of elements in the last array dimension, if
4881 /* Skip down to the last array dimension. */
4882 declarator = new_declarator;
4883 outer_declarator = NULL;
4884 while (declarator && (declarator->kind == cdk_pointer
4885 || declarator->kind == cdk_ptrmem))
4887 outer_declarator = declarator;
4888 declarator = declarator->declarator;
4891 && declarator->kind == cdk_array
4892 && declarator->declarator
4893 && declarator->declarator->kind == cdk_array)
4895 outer_declarator = declarator;
4896 declarator = declarator->declarator;
4899 if (declarator && declarator->kind == cdk_array)
4901 *nelts = declarator->u.array.bounds;
4902 if (*nelts == error_mark_node)
4903 *nelts = integer_one_node;
4904 else if (!processing_template_decl)
4906 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, *nelts,
4908 pedwarn ("size in array new must have integral type");
4909 *nelts = save_expr (cp_convert (sizetype, *nelts));
4910 if (*nelts == integer_zero_node)
4911 warning ("zero size array reserves no space");
4913 if (outer_declarator)
4914 outer_declarator->declarator = declarator->declarator;
4916 new_declarator = NULL;
4919 type = groktypename (&type_specifier_seq, new_declarator);
4920 if (TREE_CODE (type) == ARRAY_TYPE && *nelts == NULL_TREE)
4922 *nelts = array_type_nelts_top (type);
4923 type = TREE_TYPE (type);
4928 /* Parse an (optional) new-declarator.
4931 ptr-operator new-declarator [opt]
4932 direct-new-declarator
4934 Returns the declarator. */
4936 static cp_declarator *
4937 cp_parser_new_declarator_opt (cp_parser* parser)
4939 enum tree_code code;
4941 cp_cv_quals cv_quals;
4943 /* We don't know if there's a ptr-operator next, or not. */
4944 cp_parser_parse_tentatively (parser);
4945 /* Look for a ptr-operator. */
4946 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
4947 /* If that worked, look for more new-declarators. */
4948 if (cp_parser_parse_definitely (parser))
4950 cp_declarator *declarator;
4952 /* Parse another optional declarator. */
4953 declarator = cp_parser_new_declarator_opt (parser);
4955 /* Create the representation of the declarator. */
4957 declarator = make_ptrmem_declarator (cv_quals, type, declarator);
4958 else if (code == INDIRECT_REF)
4959 declarator = make_pointer_declarator (cv_quals, declarator);
4961 declarator = make_reference_declarator (cv_quals, declarator);
4966 /* If the next token is a `[', there is a direct-new-declarator. */
4967 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4968 return cp_parser_direct_new_declarator (parser);
4973 /* Parse a direct-new-declarator.
4975 direct-new-declarator:
4977 direct-new-declarator [constant-expression]
4981 static cp_declarator *
4982 cp_parser_direct_new_declarator (cp_parser* parser)
4984 cp_declarator *declarator = NULL;
4990 /* Look for the opening `['. */
4991 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
4992 /* The first expression is not required to be constant. */
4995 expression = cp_parser_expression (parser);
4996 /* The standard requires that the expression have integral
4997 type. DR 74 adds enumeration types. We believe that the
4998 real intent is that these expressions be handled like the
4999 expression in a `switch' condition, which also allows
5000 classes with a single conversion to integral or
5001 enumeration type. */
5002 if (!processing_template_decl)
5005 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5010 error ("expression in new-declarator must have integral "
5011 "or enumeration type");
5012 expression = error_mark_node;
5016 /* But all the other expressions must be. */
5019 = cp_parser_constant_expression (parser,
5020 /*allow_non_constant=*/false,
5022 /* Look for the closing `]'. */
5023 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5025 /* Add this bound to the declarator. */
5026 declarator = make_array_declarator (declarator, expression);
5028 /* If the next token is not a `[', then there are no more
5030 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5037 /* Parse a new-initializer.
5040 ( expression-list [opt] )
5042 Returns a representation of the expression-list. If there is no
5043 expression-list, VOID_ZERO_NODE is returned. */
5046 cp_parser_new_initializer (cp_parser* parser)
5048 tree expression_list;
5050 expression_list = (cp_parser_parenthesized_expression_list
5051 (parser, false, /*non_constant_p=*/NULL));
5052 if (!expression_list)
5053 expression_list = void_zero_node;
5055 return expression_list;
5058 /* Parse a delete-expression.
5061 :: [opt] delete cast-expression
5062 :: [opt] delete [ ] cast-expression
5064 Returns a representation of the expression. */
5067 cp_parser_delete_expression (cp_parser* parser)
5069 bool global_scope_p;
5073 /* Look for the optional `::' operator. */
5075 = (cp_parser_global_scope_opt (parser,
5076 /*current_scope_valid_p=*/false)
5078 /* Look for the `delete' keyword. */
5079 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
5080 /* See if the array syntax is in use. */
5081 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5083 /* Consume the `[' token. */
5084 cp_lexer_consume_token (parser->lexer);
5085 /* Look for the `]' token. */
5086 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5087 /* Remember that this is the `[]' construct. */
5093 /* Parse the cast-expression. */
5094 expression = cp_parser_simple_cast_expression (parser);
5096 /* A delete-expression may not appear in an integral constant
5098 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
5099 return error_mark_node;
5101 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5104 /* Parse a cast-expression.
5108 ( type-id ) cast-expression
5110 Returns a representation of the expression. */
5113 cp_parser_cast_expression (cp_parser *parser, bool address_p)
5115 /* If it's a `(', then we might be looking at a cast. */
5116 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5118 tree type = NULL_TREE;
5119 tree expr = NULL_TREE;
5120 bool compound_literal_p;
5121 const char *saved_message;
5123 /* There's no way to know yet whether or not this is a cast.
5124 For example, `(int (3))' is a unary-expression, while `(int)
5125 3' is a cast. So, we resort to parsing tentatively. */
5126 cp_parser_parse_tentatively (parser);
5127 /* Types may not be defined in a cast. */
5128 saved_message = parser->type_definition_forbidden_message;
5129 parser->type_definition_forbidden_message
5130 = "types may not be defined in casts";
5131 /* Consume the `('. */
5132 cp_lexer_consume_token (parser->lexer);
5133 /* A very tricky bit is that `(struct S) { 3 }' is a
5134 compound-literal (which we permit in C++ as an extension).
5135 But, that construct is not a cast-expression -- it is a
5136 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5137 is legal; if the compound-literal were a cast-expression,
5138 you'd need an extra set of parentheses.) But, if we parse
5139 the type-id, and it happens to be a class-specifier, then we
5140 will commit to the parse at that point, because we cannot
5141 undo the action that is done when creating a new class. So,
5142 then we cannot back up and do a postfix-expression.
5144 Therefore, we scan ahead to the closing `)', and check to see
5145 if the token after the `)' is a `{'. If so, we are not
5146 looking at a cast-expression.
5148 Save tokens so that we can put them back. */
5149 cp_lexer_save_tokens (parser->lexer);
5150 /* Skip tokens until the next token is a closing parenthesis.
5151 If we find the closing `)', and the next token is a `{', then
5152 we are looking at a compound-literal. */
5154 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5155 /*consume_paren=*/true)
5156 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5157 /* Roll back the tokens we skipped. */
5158 cp_lexer_rollback_tokens (parser->lexer);
5159 /* If we were looking at a compound-literal, simulate an error
5160 so that the call to cp_parser_parse_definitely below will
5162 if (compound_literal_p)
5163 cp_parser_simulate_error (parser);
5166 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5167 parser->in_type_id_in_expr_p = true;
5168 /* Look for the type-id. */
5169 type = cp_parser_type_id (parser);
5170 /* Look for the closing `)'. */
5171 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5172 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5175 /* Restore the saved message. */
5176 parser->type_definition_forbidden_message = saved_message;
5178 /* If ok so far, parse the dependent expression. We cannot be
5179 sure it is a cast. Consider `(T ())'. It is a parenthesized
5180 ctor of T, but looks like a cast to function returning T
5181 without a dependent expression. */
5182 if (!cp_parser_error_occurred (parser))
5183 expr = cp_parser_simple_cast_expression (parser);
5185 if (cp_parser_parse_definitely (parser))
5187 /* Warn about old-style casts, if so requested. */
5188 if (warn_old_style_cast
5189 && !in_system_header
5190 && !VOID_TYPE_P (type)
5191 && current_lang_name != lang_name_c)
5192 warning ("use of old-style cast");
5194 /* Only type conversions to integral or enumeration types
5195 can be used in constant-expressions. */
5196 if (parser->integral_constant_expression_p
5197 && !dependent_type_p (type)
5198 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5199 && (cp_parser_non_integral_constant_expression
5201 "a cast to a type other than an integral or "
5202 "enumeration type")))
5203 return error_mark_node;
5205 /* Perform the cast. */
5206 expr = build_c_cast (type, expr);
5211 /* If we get here, then it's not a cast, so it must be a
5212 unary-expression. */
5213 return cp_parser_unary_expression (parser, address_p);
5216 /* Parse a binary expression of the general form:
5220 pm-expression .* cast-expression
5221 pm-expression ->* cast-expression
5223 multiplicative-expression:
5225 multiplicative-expression * pm-expression
5226 multiplicative-expression / pm-expression
5227 multiplicative-expression % pm-expression
5229 additive-expression:
5230 multiplicative-expression
5231 additive-expression + multiplicative-expression
5232 additive-expression - multiplicative-expression
5236 shift-expression << additive-expression
5237 shift-expression >> additive-expression
5239 relational-expression:
5241 relational-expression < shift-expression
5242 relational-expression > shift-expression
5243 relational-expression <= shift-expression
5244 relational-expression >= shift-expression
5248 relational-expression:
5249 relational-expression <? shift-expression
5250 relational-expression >? shift-expression
5252 equality-expression:
5253 relational-expression
5254 equality-expression == relational-expression
5255 equality-expression != relational-expression
5259 and-expression & equality-expression
5261 exclusive-or-expression:
5263 exclusive-or-expression ^ and-expression
5265 inclusive-or-expression:
5266 exclusive-or-expression
5267 inclusive-or-expression | exclusive-or-expression
5269 logical-and-expression:
5270 inclusive-or-expression
5271 logical-and-expression && inclusive-or-expression
5273 logical-or-expression:
5274 logical-and-expression
5275 logical-or-expression || logical-and-expression
5277 All these are implemented with a single function like:
5280 simple-cast-expression
5281 binary-expression <token> binary-expression
5283 The binops_by_token map is used to get the tree codes for each <token> type.
5284 binary-expressions are associated according to a precedence table. */
5286 #define TOKEN_PRECEDENCE(token) \
5287 ((token->type == CPP_GREATER && !parser->greater_than_is_operator_p) \
5288 ? PREC_NOT_OPERATOR \
5289 : binops_by_token[token->type].prec)
5292 cp_parser_binary_expression (cp_parser* parser)
5294 cp_parser_expression_stack stack;
5295 cp_parser_expression_stack_entry *sp = &stack[0];
5298 enum tree_code tree_type;
5299 enum cp_parser_prec prec = PREC_NOT_OPERATOR, new_prec, lookahead_prec;
5302 /* Parse the first expression. */
5303 lhs = cp_parser_simple_cast_expression (parser);
5307 /* Get an operator token. */
5308 token = cp_lexer_peek_token (parser->lexer);
5309 new_prec = TOKEN_PRECEDENCE (token);
5311 /* Popping an entry off the stack means we completed a subexpression:
5312 - either we found a token which is not an operator (`>' where it is not
5313 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
5314 will happen repeatedly;
5315 - or, we found an operator which has lower priority. This is the case
5316 where the recursive descent *ascends*, as in `3 * 4 + 5' after
5318 if (new_prec <= prec)
5327 tree_type = binops_by_token[token->type].tree_type;
5329 /* We used the operator token. */
5330 cp_lexer_consume_token (parser->lexer);
5332 /* Extract another operand. It may be the RHS of this expression
5333 or the LHS of a new, higher priority expression. */
5334 rhs = cp_parser_simple_cast_expression (parser);
5336 /* Get another operator token. Look up its precedence to avoid
5337 building a useless (immediately popped) stack entry for common
5338 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
5339 token = cp_lexer_peek_token (parser->lexer);
5340 lookahead_prec = TOKEN_PRECEDENCE (token);
5341 if (lookahead_prec > new_prec)
5343 /* ... and prepare to parse the RHS of the new, higher priority
5344 expression. Since precedence levels on the stack are
5345 monotonically increasing, we do not have to care about
5348 sp->tree_type = tree_type;
5353 new_prec = lookahead_prec;
5357 /* If the stack is not empty, we have parsed into LHS the right side
5358 (`4' in the example above) of an expression we had suspended.
5359 We can use the information on the stack to recover the LHS (`3')
5360 from the stack together with the tree code (`MULT_EXPR'), and
5361 the precedence of the higher level subexpression
5362 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
5363 which will be used to actually build the additive expression. */
5366 tree_type = sp->tree_type;
5371 overloaded_p = false;
5372 lhs = build_x_binary_op (tree_type, lhs, rhs, &overloaded_p);
5374 /* If the binary operator required the use of an overloaded operator,
5375 then this expression cannot be an integral constant-expression.
5376 An overloaded operator can be used even if both operands are
5377 otherwise permissible in an integral constant-expression if at
5378 least one of the operands is of enumeration type. */
5381 && (cp_parser_non_integral_constant_expression
5382 (parser, "calls to overloaded operators")))
5383 return error_mark_node;
5390 /* Parse the `? expression : assignment-expression' part of a
5391 conditional-expression. The LOGICAL_OR_EXPR is the
5392 logical-or-expression that started the conditional-expression.
5393 Returns a representation of the entire conditional-expression.
5395 This routine is used by cp_parser_assignment_expression.
5397 ? expression : assignment-expression
5401 ? : assignment-expression */
5404 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5407 tree assignment_expr;
5409 /* Consume the `?' token. */
5410 cp_lexer_consume_token (parser->lexer);
5411 if (cp_parser_allow_gnu_extensions_p (parser)
5412 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5413 /* Implicit true clause. */
5416 /* Parse the expression. */
5417 expr = cp_parser_expression (parser);
5419 /* The next token should be a `:'. */
5420 cp_parser_require (parser, CPP_COLON, "`:'");
5421 /* Parse the assignment-expression. */
5422 assignment_expr = cp_parser_assignment_expression (parser);
5424 /* Build the conditional-expression. */
5425 return build_x_conditional_expr (logical_or_expr,
5430 /* Parse an assignment-expression.
5432 assignment-expression:
5433 conditional-expression
5434 logical-or-expression assignment-operator assignment_expression
5437 Returns a representation for the expression. */
5440 cp_parser_assignment_expression (cp_parser* parser)
5444 /* If the next token is the `throw' keyword, then we're looking at
5445 a throw-expression. */
5446 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5447 expr = cp_parser_throw_expression (parser);
5448 /* Otherwise, it must be that we are looking at a
5449 logical-or-expression. */
5452 /* Parse the binary expressions (logical-or-expression). */
5453 expr = cp_parser_binary_expression (parser);
5454 /* If the next token is a `?' then we're actually looking at a
5455 conditional-expression. */
5456 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5457 return cp_parser_question_colon_clause (parser, expr);
5460 enum tree_code assignment_operator;
5462 /* If it's an assignment-operator, we're using the second
5465 = cp_parser_assignment_operator_opt (parser);
5466 if (assignment_operator != ERROR_MARK)
5470 /* Parse the right-hand side of the assignment. */
5471 rhs = cp_parser_assignment_expression (parser);
5472 /* An assignment may not appear in a
5473 constant-expression. */
5474 if (cp_parser_non_integral_constant_expression (parser,
5476 return error_mark_node;
5477 /* Build the assignment expression. */
5478 expr = build_x_modify_expr (expr,
5479 assignment_operator,
5488 /* Parse an (optional) assignment-operator.
5490 assignment-operator: one of
5491 = *= /= %= += -= >>= <<= &= ^= |=
5495 assignment-operator: one of
5498 If the next token is an assignment operator, the corresponding tree
5499 code is returned, and the token is consumed. For example, for
5500 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5501 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5502 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5503 operator, ERROR_MARK is returned. */
5505 static enum tree_code
5506 cp_parser_assignment_operator_opt (cp_parser* parser)
5511 /* Peek at the next toen. */
5512 token = cp_lexer_peek_token (parser->lexer);
5514 switch (token->type)
5525 op = TRUNC_DIV_EXPR;
5529 op = TRUNC_MOD_EXPR;
5569 /* Nothing else is an assignment operator. */
5573 /* If it was an assignment operator, consume it. */
5574 if (op != ERROR_MARK)
5575 cp_lexer_consume_token (parser->lexer);
5580 /* Parse an expression.
5583 assignment-expression
5584 expression , assignment-expression
5586 Returns a representation of the expression. */
5589 cp_parser_expression (cp_parser* parser)
5591 tree expression = NULL_TREE;
5595 tree assignment_expression;
5597 /* Parse the next assignment-expression. */
5598 assignment_expression
5599 = cp_parser_assignment_expression (parser);
5600 /* If this is the first assignment-expression, we can just
5603 expression = assignment_expression;
5605 expression = build_x_compound_expr (expression,
5606 assignment_expression);
5607 /* If the next token is not a comma, then we are done with the
5609 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5611 /* Consume the `,'. */
5612 cp_lexer_consume_token (parser->lexer);
5613 /* A comma operator cannot appear in a constant-expression. */
5614 if (cp_parser_non_integral_constant_expression (parser,
5615 "a comma operator"))
5616 expression = error_mark_node;
5622 /* Parse a constant-expression.
5624 constant-expression:
5625 conditional-expression
5627 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
5628 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
5629 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
5630 is false, NON_CONSTANT_P should be NULL. */
5633 cp_parser_constant_expression (cp_parser* parser,
5634 bool allow_non_constant_p,
5635 bool *non_constant_p)
5637 bool saved_integral_constant_expression_p;
5638 bool saved_allow_non_integral_constant_expression_p;
5639 bool saved_non_integral_constant_expression_p;
5642 /* It might seem that we could simply parse the
5643 conditional-expression, and then check to see if it were
5644 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
5645 one that the compiler can figure out is constant, possibly after
5646 doing some simplifications or optimizations. The standard has a
5647 precise definition of constant-expression, and we must honor
5648 that, even though it is somewhat more restrictive.
5654 is not a legal declaration, because `(2, 3)' is not a
5655 constant-expression. The `,' operator is forbidden in a
5656 constant-expression. However, GCC's constant-folding machinery
5657 will fold this operation to an INTEGER_CST for `3'. */
5659 /* Save the old settings. */
5660 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
5661 saved_allow_non_integral_constant_expression_p
5662 = parser->allow_non_integral_constant_expression_p;
5663 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
5664 /* We are now parsing a constant-expression. */
5665 parser->integral_constant_expression_p = true;
5666 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
5667 parser->non_integral_constant_expression_p = false;
5668 /* Although the grammar says "conditional-expression", we parse an
5669 "assignment-expression", which also permits "throw-expression"
5670 and the use of assignment operators. In the case that
5671 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
5672 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
5673 actually essential that we look for an assignment-expression.
5674 For example, cp_parser_initializer_clauses uses this function to
5675 determine whether a particular assignment-expression is in fact
5677 expression = cp_parser_assignment_expression (parser);
5678 /* Restore the old settings. */
5679 parser->integral_constant_expression_p = saved_integral_constant_expression_p;
5680 parser->allow_non_integral_constant_expression_p
5681 = saved_allow_non_integral_constant_expression_p;
5682 if (allow_non_constant_p)
5683 *non_constant_p = parser->non_integral_constant_expression_p;
5684 parser->non_integral_constant_expression_p = saved_non_integral_constant_expression_p;
5689 /* Parse __builtin_offsetof.
5691 offsetof-expression:
5692 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
5694 offsetof-member-designator:
5696 | offsetof-member-designator "." id-expression
5697 | offsetof-member-designator "[" expression "]"
5701 cp_parser_builtin_offsetof (cp_parser *parser)
5703 int save_ice_p, save_non_ice_p;
5707 /* We're about to accept non-integral-constant things, but will
5708 definitely yield an integral constant expression. Save and
5709 restore these values around our local parsing. */
5710 save_ice_p = parser->integral_constant_expression_p;
5711 save_non_ice_p = parser->non_integral_constant_expression_p;
5713 /* Consume the "__builtin_offsetof" token. */
5714 cp_lexer_consume_token (parser->lexer);
5715 /* Consume the opening `('. */
5716 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
5717 /* Parse the type-id. */
5718 type = cp_parser_type_id (parser);
5719 /* Look for the `,'. */
5720 cp_parser_require (parser, CPP_COMMA, "`,'");
5722 /* Build the (type *)null that begins the traditional offsetof macro. */
5723 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
5725 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
5726 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
5730 cp_token *token = cp_lexer_peek_token (parser->lexer);
5731 switch (token->type)
5733 case CPP_OPEN_SQUARE:
5734 /* offsetof-member-designator "[" expression "]" */
5735 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
5739 /* offsetof-member-designator "." identifier */
5740 cp_lexer_consume_token (parser->lexer);
5741 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
5745 case CPP_CLOSE_PAREN:
5746 /* Consume the ")" token. */
5747 cp_lexer_consume_token (parser->lexer);
5751 /* Error. We know the following require will fail, but
5752 that gives the proper error message. */
5753 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5754 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
5755 expr = error_mark_node;
5761 /* If we're processing a template, we can't finish the semantics yet.
5762 Otherwise we can fold the entire expression now. */
5763 if (processing_template_decl)
5764 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
5766 expr = fold_offsetof (expr);
5769 parser->integral_constant_expression_p = save_ice_p;
5770 parser->non_integral_constant_expression_p = save_non_ice_p;
5775 /* Statements [gram.stmt.stmt] */
5777 /* Parse a statement.
5781 expression-statement
5786 declaration-statement
5790 cp_parser_statement (cp_parser* parser, tree in_statement_expr)
5794 location_t statement_location;
5796 /* There is no statement yet. */
5797 statement = NULL_TREE;
5798 /* Peek at the next token. */
5799 token = cp_lexer_peek_token (parser->lexer);
5800 /* Remember the location of the first token in the statement. */
5801 statement_location = token->location;
5802 /* If this is a keyword, then that will often determine what kind of
5803 statement we have. */
5804 if (token->type == CPP_KEYWORD)
5806 enum rid keyword = token->keyword;
5812 statement = cp_parser_labeled_statement (parser,
5818 statement = cp_parser_selection_statement (parser);
5824 statement = cp_parser_iteration_statement (parser);
5831 statement = cp_parser_jump_statement (parser);
5835 statement = cp_parser_try_block (parser);
5839 /* It might be a keyword like `int' that can start a
5840 declaration-statement. */
5844 else if (token->type == CPP_NAME)
5846 /* If the next token is a `:', then we are looking at a
5847 labeled-statement. */
5848 token = cp_lexer_peek_nth_token (parser->lexer, 2);
5849 if (token->type == CPP_COLON)
5850 statement = cp_parser_labeled_statement (parser, in_statement_expr);
5852 /* Anything that starts with a `{' must be a compound-statement. */
5853 else if (token->type == CPP_OPEN_BRACE)
5854 statement = cp_parser_compound_statement (parser, NULL, false);
5855 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
5856 a statement all its own. */
5857 else if (token->type == CPP_PRAGMA)
5859 cp_lexer_handle_pragma (parser->lexer);
5863 /* Everything else must be a declaration-statement or an
5864 expression-statement. Try for the declaration-statement
5865 first, unless we are looking at a `;', in which case we know that
5866 we have an expression-statement. */
5869 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
5871 cp_parser_parse_tentatively (parser);
5872 /* Try to parse the declaration-statement. */
5873 cp_parser_declaration_statement (parser);
5874 /* If that worked, we're done. */
5875 if (cp_parser_parse_definitely (parser))
5878 /* Look for an expression-statement instead. */
5879 statement = cp_parser_expression_statement (parser, in_statement_expr);
5882 /* Set the line number for the statement. */
5883 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
5884 SET_EXPR_LOCATION (statement, statement_location);
5887 /* Parse a labeled-statement.
5890 identifier : statement
5891 case constant-expression : statement
5897 case constant-expression ... constant-expression : statement
5899 Returns the new CASE_LABEL_EXPR, for a `case' or `default' label.
5900 For an ordinary label, returns a LABEL_EXPR. */
5903 cp_parser_labeled_statement (cp_parser* parser, tree in_statement_expr)
5906 tree statement = error_mark_node;
5908 /* The next token should be an identifier. */
5909 token = cp_lexer_peek_token (parser->lexer);
5910 if (token->type != CPP_NAME
5911 && token->type != CPP_KEYWORD)
5913 cp_parser_error (parser, "expected labeled-statement");
5914 return error_mark_node;
5917 switch (token->keyword)
5924 /* Consume the `case' token. */
5925 cp_lexer_consume_token (parser->lexer);
5926 /* Parse the constant-expression. */
5927 expr = cp_parser_constant_expression (parser,
5928 /*allow_non_constant_p=*/false,
5931 ellipsis = cp_lexer_peek_token (parser->lexer);
5932 if (ellipsis->type == CPP_ELLIPSIS)
5934 /* Consume the `...' token. */
5935 cp_lexer_consume_token (parser->lexer);
5937 cp_parser_constant_expression (parser,
5938 /*allow_non_constant_p=*/false,
5940 /* We don't need to emit warnings here, as the common code
5941 will do this for us. */
5944 expr_hi = NULL_TREE;
5946 if (!parser->in_switch_statement_p)
5947 error ("case label %qE not within a switch statement", expr);
5949 statement = finish_case_label (expr, expr_hi);
5954 /* Consume the `default' token. */
5955 cp_lexer_consume_token (parser->lexer);
5956 if (!parser->in_switch_statement_p)
5957 error ("case label not within a switch statement");
5959 statement = finish_case_label (NULL_TREE, NULL_TREE);
5963 /* Anything else must be an ordinary label. */
5964 statement = finish_label_stmt (cp_parser_identifier (parser));
5968 /* Require the `:' token. */
5969 cp_parser_require (parser, CPP_COLON, "`:'");
5970 /* Parse the labeled statement. */
5971 cp_parser_statement (parser, in_statement_expr);
5973 /* Return the label, in the case of a `case' or `default' label. */
5977 /* Parse an expression-statement.
5979 expression-statement:
5982 Returns the new EXPR_STMT -- or NULL_TREE if the expression
5983 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
5984 indicates whether this expression-statement is part of an
5985 expression statement. */
5988 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
5990 tree statement = NULL_TREE;
5992 /* If the next token is a ';', then there is no expression
5994 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
5995 statement = cp_parser_expression (parser);
5997 /* Consume the final `;'. */
5998 cp_parser_consume_semicolon_at_end_of_statement (parser);
6000 if (in_statement_expr
6001 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
6003 /* This is the final expression statement of a statement
6005 statement = finish_stmt_expr_expr (statement, in_statement_expr);
6008 statement = finish_expr_stmt (statement);
6015 /* Parse a compound-statement.
6018 { statement-seq [opt] }
6020 Returns a tree representing the statement. */
6023 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
6028 /* Consume the `{'. */
6029 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
6030 return error_mark_node;
6031 /* Begin the compound-statement. */
6032 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
6033 /* Parse an (optional) statement-seq. */
6034 cp_parser_statement_seq_opt (parser, in_statement_expr);
6035 /* Finish the compound-statement. */
6036 finish_compound_stmt (compound_stmt);
6037 /* Consume the `}'. */
6038 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6040 return compound_stmt;
6043 /* Parse an (optional) statement-seq.
6047 statement-seq [opt] statement */
6050 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
6052 /* Scan statements until there aren't any more. */
6055 /* If we're looking at a `}', then we've run out of statements. */
6056 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE)
6057 || cp_lexer_next_token_is (parser->lexer, CPP_EOF))
6060 /* Parse the statement. */
6061 cp_parser_statement (parser, in_statement_expr);
6065 /* Parse a selection-statement.
6067 selection-statement:
6068 if ( condition ) statement
6069 if ( condition ) statement else statement
6070 switch ( condition ) statement
6072 Returns the new IF_STMT or SWITCH_STMT. */
6075 cp_parser_selection_statement (cp_parser* parser)
6080 /* Peek at the next token. */
6081 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
6083 /* See what kind of keyword it is. */
6084 keyword = token->keyword;
6093 /* Look for the `('. */
6094 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
6096 cp_parser_skip_to_end_of_statement (parser);
6097 return error_mark_node;
6100 /* Begin the selection-statement. */
6101 if (keyword == RID_IF)
6102 statement = begin_if_stmt ();
6104 statement = begin_switch_stmt ();
6106 /* Parse the condition. */
6107 condition = cp_parser_condition (parser);
6108 /* Look for the `)'. */
6109 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
6110 cp_parser_skip_to_closing_parenthesis (parser, true, false,
6111 /*consume_paren=*/true);
6113 if (keyword == RID_IF)
6115 /* Add the condition. */
6116 finish_if_stmt_cond (condition, statement);
6118 /* Parse the then-clause. */
6119 cp_parser_implicitly_scoped_statement (parser);
6120 finish_then_clause (statement);
6122 /* If the next token is `else', parse the else-clause. */
6123 if (cp_lexer_next_token_is_keyword (parser->lexer,
6126 /* Consume the `else' keyword. */
6127 cp_lexer_consume_token (parser->lexer);
6128 begin_else_clause (statement);
6129 /* Parse the else-clause. */
6130 cp_parser_implicitly_scoped_statement (parser);
6131 finish_else_clause (statement);
6134 /* Now we're all done with the if-statement. */
6135 finish_if_stmt (statement);
6139 bool in_switch_statement_p;
6141 /* Add the condition. */
6142 finish_switch_cond (condition, statement);
6144 /* Parse the body of the switch-statement. */
6145 in_switch_statement_p = parser->in_switch_statement_p;
6146 parser->in_switch_statement_p = true;
6147 cp_parser_implicitly_scoped_statement (parser);
6148 parser->in_switch_statement_p = in_switch_statement_p;
6150 /* Now we're all done with the switch-statement. */
6151 finish_switch_stmt (statement);
6159 cp_parser_error (parser, "expected selection-statement");
6160 return error_mark_node;
6164 /* Parse a condition.
6168 type-specifier-seq declarator = assignment-expression
6173 type-specifier-seq declarator asm-specification [opt]
6174 attributes [opt] = assignment-expression
6176 Returns the expression that should be tested. */
6179 cp_parser_condition (cp_parser* parser)
6181 cp_decl_specifier_seq type_specifiers;
6182 const char *saved_message;
6184 /* Try the declaration first. */
6185 cp_parser_parse_tentatively (parser);
6186 /* New types are not allowed in the type-specifier-seq for a
6188 saved_message = parser->type_definition_forbidden_message;
6189 parser->type_definition_forbidden_message
6190 = "types may not be defined in conditions";
6191 /* Parse the type-specifier-seq. */
6192 cp_parser_type_specifier_seq (parser, &type_specifiers);
6193 /* Restore the saved message. */
6194 parser->type_definition_forbidden_message = saved_message;
6195 /* If all is well, we might be looking at a declaration. */
6196 if (!cp_parser_error_occurred (parser))
6199 tree asm_specification;
6201 cp_declarator *declarator;
6202 tree initializer = NULL_TREE;
6204 /* Parse the declarator. */
6205 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6206 /*ctor_dtor_or_conv_p=*/NULL,
6207 /*parenthesized_p=*/NULL,
6208 /*member_p=*/false);
6209 /* Parse the attributes. */
6210 attributes = cp_parser_attributes_opt (parser);
6211 /* Parse the asm-specification. */
6212 asm_specification = cp_parser_asm_specification_opt (parser);
6213 /* If the next token is not an `=', then we might still be
6214 looking at an expression. For example:
6218 looks like a decl-specifier-seq and a declarator -- but then
6219 there is no `=', so this is an expression. */
6220 cp_parser_require (parser, CPP_EQ, "`='");
6221 /* If we did see an `=', then we are looking at a declaration
6223 if (cp_parser_parse_definitely (parser))
6227 /* Create the declaration. */
6228 decl = start_decl (declarator, &type_specifiers,
6229 /*initialized_p=*/true,
6230 attributes, /*prefix_attributes=*/NULL_TREE,
6232 /* Parse the assignment-expression. */
6233 initializer = cp_parser_assignment_expression (parser);
6235 /* Process the initializer. */
6236 cp_finish_decl (decl,
6239 LOOKUP_ONLYCONVERTING);
6242 pop_scope (DECL_CONTEXT (decl));
6244 return convert_from_reference (decl);
6247 /* If we didn't even get past the declarator successfully, we are
6248 definitely not looking at a declaration. */
6250 cp_parser_abort_tentative_parse (parser);
6252 /* Otherwise, we are looking at an expression. */
6253 return cp_parser_expression (parser);
6256 /* Parse an iteration-statement.
6258 iteration-statement:
6259 while ( condition ) statement
6260 do statement while ( expression ) ;
6261 for ( for-init-statement condition [opt] ; expression [opt] )
6264 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6267 cp_parser_iteration_statement (cp_parser* parser)
6272 bool in_iteration_statement_p;
6275 /* Peek at the next token. */
6276 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6278 return error_mark_node;
6280 /* Remember whether or not we are already within an iteration
6282 in_iteration_statement_p = parser->in_iteration_statement_p;
6284 /* See what kind of keyword it is. */
6285 keyword = token->keyword;
6292 /* Begin the while-statement. */
6293 statement = begin_while_stmt ();
6294 /* Look for the `('. */
6295 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6296 /* Parse the condition. */
6297 condition = cp_parser_condition (parser);
6298 finish_while_stmt_cond (condition, statement);
6299 /* Look for the `)'. */
6300 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6301 /* Parse the dependent statement. */
6302 parser->in_iteration_statement_p = true;
6303 cp_parser_already_scoped_statement (parser);
6304 parser->in_iteration_statement_p = in_iteration_statement_p;
6305 /* We're done with the while-statement. */
6306 finish_while_stmt (statement);
6314 /* Begin the do-statement. */
6315 statement = begin_do_stmt ();
6316 /* Parse the body of the do-statement. */
6317 parser->in_iteration_statement_p = true;
6318 cp_parser_implicitly_scoped_statement (parser);
6319 parser->in_iteration_statement_p = in_iteration_statement_p;
6320 finish_do_body (statement);
6321 /* Look for the `while' keyword. */
6322 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6323 /* Look for the `('. */
6324 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6325 /* Parse the expression. */
6326 expression = cp_parser_expression (parser);
6327 /* We're done with the do-statement. */
6328 finish_do_stmt (expression, statement);
6329 /* Look for the `)'. */
6330 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6331 /* Look for the `;'. */
6332 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6338 tree condition = NULL_TREE;
6339 tree expression = NULL_TREE;
6341 /* Begin the for-statement. */
6342 statement = begin_for_stmt ();
6343 /* Look for the `('. */
6344 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6345 /* Parse the initialization. */
6346 cp_parser_for_init_statement (parser);
6347 finish_for_init_stmt (statement);
6349 /* If there's a condition, process it. */
6350 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6351 condition = cp_parser_condition (parser);
6352 finish_for_cond (condition, statement);
6353 /* Look for the `;'. */
6354 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6356 /* If there's an expression, process it. */
6357 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6358 expression = cp_parser_expression (parser);
6359 finish_for_expr (expression, statement);
6360 /* Look for the `)'. */
6361 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6363 /* Parse the body of the for-statement. */
6364 parser->in_iteration_statement_p = true;
6365 cp_parser_already_scoped_statement (parser);
6366 parser->in_iteration_statement_p = in_iteration_statement_p;
6368 /* We're done with the for-statement. */
6369 finish_for_stmt (statement);
6374 cp_parser_error (parser, "expected iteration-statement");
6375 statement = error_mark_node;
6382 /* Parse a for-init-statement.
6385 expression-statement
6386 simple-declaration */
6389 cp_parser_for_init_statement (cp_parser* parser)
6391 /* If the next token is a `;', then we have an empty
6392 expression-statement. Grammatically, this is also a
6393 simple-declaration, but an invalid one, because it does not
6394 declare anything. Therefore, if we did not handle this case
6395 specially, we would issue an error message about an invalid
6397 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6399 /* We're going to speculatively look for a declaration, falling back
6400 to an expression, if necessary. */
6401 cp_parser_parse_tentatively (parser);
6402 /* Parse the declaration. */
6403 cp_parser_simple_declaration (parser,
6404 /*function_definition_allowed_p=*/false);
6405 /* If the tentative parse failed, then we shall need to look for an
6406 expression-statement. */
6407 if (cp_parser_parse_definitely (parser))
6411 cp_parser_expression_statement (parser, false);
6414 /* Parse a jump-statement.
6419 return expression [opt] ;
6427 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6430 cp_parser_jump_statement (cp_parser* parser)
6432 tree statement = error_mark_node;
6436 /* Peek at the next token. */
6437 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6439 return error_mark_node;
6441 /* See what kind of keyword it is. */
6442 keyword = token->keyword;
6446 if (!parser->in_switch_statement_p
6447 && !parser->in_iteration_statement_p)
6449 error ("break statement not within loop or switch");
6450 statement = error_mark_node;
6453 statement = finish_break_stmt ();
6454 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6458 if (!parser->in_iteration_statement_p)
6460 error ("continue statement not within a loop");
6461 statement = error_mark_node;
6464 statement = finish_continue_stmt ();
6465 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6472 /* If the next token is a `;', then there is no
6474 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6475 expr = cp_parser_expression (parser);
6478 /* Build the return-statement. */
6479 statement = finish_return_stmt (expr);
6480 /* Look for the final `;'. */
6481 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6486 /* Create the goto-statement. */
6487 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
6489 /* Issue a warning about this use of a GNU extension. */
6491 pedwarn ("ISO C++ forbids computed gotos");
6492 /* Consume the '*' token. */
6493 cp_lexer_consume_token (parser->lexer);
6494 /* Parse the dependent expression. */
6495 finish_goto_stmt (cp_parser_expression (parser));
6498 finish_goto_stmt (cp_parser_identifier (parser));
6499 /* Look for the final `;'. */
6500 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6504 cp_parser_error (parser, "expected jump-statement");
6511 /* Parse a declaration-statement.
6513 declaration-statement:
6514 block-declaration */
6517 cp_parser_declaration_statement (cp_parser* parser)
6521 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6522 p = obstack_alloc (&declarator_obstack, 0);
6524 /* Parse the block-declaration. */
6525 cp_parser_block_declaration (parser, /*statement_p=*/true);
6527 /* Free any declarators allocated. */
6528 obstack_free (&declarator_obstack, p);
6530 /* Finish off the statement. */
6534 /* Some dependent statements (like `if (cond) statement'), are
6535 implicitly in their own scope. In other words, if the statement is
6536 a single statement (as opposed to a compound-statement), it is
6537 none-the-less treated as if it were enclosed in braces. Any
6538 declarations appearing in the dependent statement are out of scope
6539 after control passes that point. This function parses a statement,
6540 but ensures that is in its own scope, even if it is not a
6543 Returns the new statement. */
6546 cp_parser_implicitly_scoped_statement (cp_parser* parser)
6550 /* If the token is not a `{', then we must take special action. */
6551 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6553 /* Create a compound-statement. */
6554 statement = begin_compound_stmt (0);
6555 /* Parse the dependent-statement. */
6556 cp_parser_statement (parser, false);
6557 /* Finish the dummy compound-statement. */
6558 finish_compound_stmt (statement);
6560 /* Otherwise, we simply parse the statement directly. */
6562 statement = cp_parser_compound_statement (parser, NULL, false);
6564 /* Return the statement. */
6568 /* For some dependent statements (like `while (cond) statement'), we
6569 have already created a scope. Therefore, even if the dependent
6570 statement is a compound-statement, we do not want to create another
6574 cp_parser_already_scoped_statement (cp_parser* parser)
6576 /* If the token is a `{', then we must take special action. */
6577 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6578 cp_parser_statement (parser, false);
6581 /* Avoid calling cp_parser_compound_statement, so that we
6582 don't create a new scope. Do everything else by hand. */
6583 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
6584 cp_parser_statement_seq_opt (parser, false);
6585 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6589 /* Declarations [gram.dcl.dcl] */
6591 /* Parse an optional declaration-sequence.
6595 declaration-seq declaration */
6598 cp_parser_declaration_seq_opt (cp_parser* parser)
6604 token = cp_lexer_peek_token (parser->lexer);
6606 if (token->type == CPP_CLOSE_BRACE
6607 || token->type == CPP_EOF)
6610 if (token->type == CPP_SEMICOLON)
6612 /* A declaration consisting of a single semicolon is
6613 invalid. Allow it unless we're being pedantic. */
6614 cp_lexer_consume_token (parser->lexer);
6615 if (pedantic && !in_system_header)
6616 pedwarn ("extra %<;%>");
6620 /* If we're entering or exiting a region that's implicitly
6621 extern "C", modify the lang context appropriately. */
6622 if (!parser->implicit_extern_c && token->implicit_extern_c)
6624 push_lang_context (lang_name_c);
6625 parser->implicit_extern_c = true;
6627 else if (parser->implicit_extern_c && !token->implicit_extern_c)
6629 pop_lang_context ();
6630 parser->implicit_extern_c = false;
6633 if (token->type == CPP_PRAGMA)
6635 /* A top-level declaration can consist solely of a #pragma.
6636 A nested declaration cannot, so this is done here and not
6637 in cp_parser_declaration. (A #pragma at block scope is
6638 handled in cp_parser_statement.) */
6639 cp_lexer_handle_pragma (parser->lexer);
6643 /* Parse the declaration itself. */
6644 cp_parser_declaration (parser);
6648 /* Parse a declaration.
6653 template-declaration
6654 explicit-instantiation
6655 explicit-specialization
6656 linkage-specification
6657 namespace-definition
6662 __extension__ declaration */
6665 cp_parser_declaration (cp_parser* parser)
6672 /* Check for the `__extension__' keyword. */
6673 if (cp_parser_extension_opt (parser, &saved_pedantic))
6675 /* Parse the qualified declaration. */
6676 cp_parser_declaration (parser);
6677 /* Restore the PEDANTIC flag. */
6678 pedantic = saved_pedantic;
6683 /* Try to figure out what kind of declaration is present. */
6684 token1 = *cp_lexer_peek_token (parser->lexer);
6686 if (token1.type != CPP_EOF)
6687 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
6689 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6690 p = obstack_alloc (&declarator_obstack, 0);
6692 /* If the next token is `extern' and the following token is a string
6693 literal, then we have a linkage specification. */
6694 if (token1.keyword == RID_EXTERN
6695 && cp_parser_is_string_literal (&token2))
6696 cp_parser_linkage_specification (parser);
6697 /* If the next token is `template', then we have either a template
6698 declaration, an explicit instantiation, or an explicit
6700 else if (token1.keyword == RID_TEMPLATE)
6702 /* `template <>' indicates a template specialization. */
6703 if (token2.type == CPP_LESS
6704 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
6705 cp_parser_explicit_specialization (parser);
6706 /* `template <' indicates a template declaration. */
6707 else if (token2.type == CPP_LESS)
6708 cp_parser_template_declaration (parser, /*member_p=*/false);
6709 /* Anything else must be an explicit instantiation. */
6711 cp_parser_explicit_instantiation (parser);
6713 /* If the next token is `export', then we have a template
6715 else if (token1.keyword == RID_EXPORT)
6716 cp_parser_template_declaration (parser, /*member_p=*/false);
6717 /* If the next token is `extern', 'static' or 'inline' and the one
6718 after that is `template', we have a GNU extended explicit
6719 instantiation directive. */
6720 else if (cp_parser_allow_gnu_extensions_p (parser)
6721 && (token1.keyword == RID_EXTERN
6722 || token1.keyword == RID_STATIC
6723 || token1.keyword == RID_INLINE)
6724 && token2.keyword == RID_TEMPLATE)
6725 cp_parser_explicit_instantiation (parser);
6726 /* If the next token is `namespace', check for a named or unnamed
6727 namespace definition. */
6728 else if (token1.keyword == RID_NAMESPACE
6729 && (/* A named namespace definition. */
6730 (token2.type == CPP_NAME
6731 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
6733 /* An unnamed namespace definition. */
6734 || token2.type == CPP_OPEN_BRACE))
6735 cp_parser_namespace_definition (parser);
6736 /* We must have either a block declaration or a function
6739 /* Try to parse a block-declaration, or a function-definition. */
6740 cp_parser_block_declaration (parser, /*statement_p=*/false);
6742 /* Free any declarators allocated. */
6743 obstack_free (&declarator_obstack, p);
6746 /* Parse a block-declaration.
6751 namespace-alias-definition
6758 __extension__ block-declaration
6761 If STATEMENT_P is TRUE, then this block-declaration is occurring as
6762 part of a declaration-statement. */
6765 cp_parser_block_declaration (cp_parser *parser,
6771 /* Check for the `__extension__' keyword. */
6772 if (cp_parser_extension_opt (parser, &saved_pedantic))
6774 /* Parse the qualified declaration. */
6775 cp_parser_block_declaration (parser, statement_p);
6776 /* Restore the PEDANTIC flag. */
6777 pedantic = saved_pedantic;
6782 /* Peek at the next token to figure out which kind of declaration is
6784 token1 = cp_lexer_peek_token (parser->lexer);
6786 /* If the next keyword is `asm', we have an asm-definition. */
6787 if (token1->keyword == RID_ASM)
6790 cp_parser_commit_to_tentative_parse (parser);
6791 cp_parser_asm_definition (parser);
6793 /* If the next keyword is `namespace', we have a
6794 namespace-alias-definition. */
6795 else if (token1->keyword == RID_NAMESPACE)
6796 cp_parser_namespace_alias_definition (parser);
6797 /* If the next keyword is `using', we have either a
6798 using-declaration or a using-directive. */
6799 else if (token1->keyword == RID_USING)
6804 cp_parser_commit_to_tentative_parse (parser);
6805 /* If the token after `using' is `namespace', then we have a
6807 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
6808 if (token2->keyword == RID_NAMESPACE)
6809 cp_parser_using_directive (parser);
6810 /* Otherwise, it's a using-declaration. */
6812 cp_parser_using_declaration (parser);
6814 /* If the next keyword is `__label__' we have a label declaration. */
6815 else if (token1->keyword == RID_LABEL)
6818 cp_parser_commit_to_tentative_parse (parser);
6819 cp_parser_label_declaration (parser);
6821 /* Anything else must be a simple-declaration. */
6823 cp_parser_simple_declaration (parser, !statement_p);
6826 /* Parse a simple-declaration.
6829 decl-specifier-seq [opt] init-declarator-list [opt] ;
6831 init-declarator-list:
6833 init-declarator-list , init-declarator
6835 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
6836 function-definition as a simple-declaration. */
6839 cp_parser_simple_declaration (cp_parser* parser,
6840 bool function_definition_allowed_p)
6842 cp_decl_specifier_seq decl_specifiers;
6843 int declares_class_or_enum;
6844 bool saw_declarator;
6846 /* Defer access checks until we know what is being declared; the
6847 checks for names appearing in the decl-specifier-seq should be
6848 done as if we were in the scope of the thing being declared. */
6849 push_deferring_access_checks (dk_deferred);
6851 /* Parse the decl-specifier-seq. We have to keep track of whether
6852 or not the decl-specifier-seq declares a named class or
6853 enumeration type, since that is the only case in which the
6854 init-declarator-list is allowed to be empty.
6858 In a simple-declaration, the optional init-declarator-list can be
6859 omitted only when declaring a class or enumeration, that is when
6860 the decl-specifier-seq contains either a class-specifier, an
6861 elaborated-type-specifier, or an enum-specifier. */
6862 cp_parser_decl_specifier_seq (parser,
6863 CP_PARSER_FLAGS_OPTIONAL,
6865 &declares_class_or_enum);
6866 /* We no longer need to defer access checks. */
6867 stop_deferring_access_checks ();
6869 /* In a block scope, a valid declaration must always have a
6870 decl-specifier-seq. By not trying to parse declarators, we can
6871 resolve the declaration/expression ambiguity more quickly. */
6872 if (!function_definition_allowed_p
6873 && !decl_specifiers.any_specifiers_p)
6875 cp_parser_error (parser, "expected declaration");
6879 /* If the next two tokens are both identifiers, the code is
6880 erroneous. The usual cause of this situation is code like:
6884 where "T" should name a type -- but does not. */
6885 if (!decl_specifiers.type
6886 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
6888 /* If parsing tentatively, we should commit; we really are
6889 looking at a declaration. */
6890 cp_parser_commit_to_tentative_parse (parser);
6895 /* If we have seen at least one decl-specifier, and the next token
6896 is not a parenthesis, then we must be looking at a declaration.
6897 (After "int (" we might be looking at a functional cast.) */
6898 if (decl_specifiers.any_specifiers_p
6899 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
6900 cp_parser_commit_to_tentative_parse (parser);
6902 /* Keep going until we hit the `;' at the end of the simple
6904 saw_declarator = false;
6905 while (cp_lexer_next_token_is_not (parser->lexer,
6909 bool function_definition_p;
6912 saw_declarator = true;
6913 /* Parse the init-declarator. */
6914 decl = cp_parser_init_declarator (parser, &decl_specifiers,
6915 function_definition_allowed_p,
6917 declares_class_or_enum,
6918 &function_definition_p);
6919 /* If an error occurred while parsing tentatively, exit quickly.
6920 (That usually happens when in the body of a function; each
6921 statement is treated as a declaration-statement until proven
6923 if (cp_parser_error_occurred (parser))
6925 /* Handle function definitions specially. */
6926 if (function_definition_p)
6928 /* If the next token is a `,', then we are probably
6929 processing something like:
6933 which is erroneous. */
6934 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
6935 error ("mixing declarations and function-definitions is forbidden");
6936 /* Otherwise, we're done with the list of declarators. */
6939 pop_deferring_access_checks ();
6943 /* The next token should be either a `,' or a `;'. */
6944 token = cp_lexer_peek_token (parser->lexer);
6945 /* If it's a `,', there are more declarators to come. */
6946 if (token->type == CPP_COMMA)
6947 cp_lexer_consume_token (parser->lexer);
6948 /* If it's a `;', we are done. */
6949 else if (token->type == CPP_SEMICOLON)
6951 /* Anything else is an error. */
6954 /* If we have already issued an error message we don't need
6955 to issue another one. */
6956 if (decl != error_mark_node
6957 || (cp_parser_parsing_tentatively (parser)
6958 && !cp_parser_committed_to_tentative_parse (parser)))
6959 cp_parser_error (parser, "expected %<,%> or %<;%>");
6960 /* Skip tokens until we reach the end of the statement. */
6961 cp_parser_skip_to_end_of_statement (parser);
6962 /* If the next token is now a `;', consume it. */
6963 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
6964 cp_lexer_consume_token (parser->lexer);
6967 /* After the first time around, a function-definition is not
6968 allowed -- even if it was OK at first. For example:
6973 function_definition_allowed_p = false;
6976 /* Issue an error message if no declarators are present, and the
6977 decl-specifier-seq does not itself declare a class or
6979 if (!saw_declarator)
6981 if (cp_parser_declares_only_class_p (parser))
6982 shadow_tag (&decl_specifiers);
6983 /* Perform any deferred access checks. */
6984 perform_deferred_access_checks ();
6987 /* Consume the `;'. */
6988 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6991 pop_deferring_access_checks ();
6994 /* Parse a decl-specifier-seq.
6997 decl-specifier-seq [opt] decl-specifier
7000 storage-class-specifier
7011 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7013 The parser flags FLAGS is used to control type-specifier parsing.
7015 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7018 1: one of the decl-specifiers is an elaborated-type-specifier
7019 (i.e., a type declaration)
7020 2: one of the decl-specifiers is an enum-specifier or a
7021 class-specifier (i.e., a type definition)
7026 cp_parser_decl_specifier_seq (cp_parser* parser,
7027 cp_parser_flags flags,
7028 cp_decl_specifier_seq *decl_specs,
7029 int* declares_class_or_enum)
7031 bool constructor_possible_p = !parser->in_declarator_p;
7033 /* Clear DECL_SPECS. */
7034 clear_decl_specs (decl_specs);
7036 /* Assume no class or enumeration type is declared. */
7037 *declares_class_or_enum = 0;
7039 /* Keep reading specifiers until there are no more to read. */
7043 bool found_decl_spec;
7046 /* Peek at the next token. */
7047 token = cp_lexer_peek_token (parser->lexer);
7048 /* Handle attributes. */
7049 if (token->keyword == RID_ATTRIBUTE)
7051 /* Parse the attributes. */
7052 decl_specs->attributes
7053 = chainon (decl_specs->attributes,
7054 cp_parser_attributes_opt (parser));
7057 /* Assume we will find a decl-specifier keyword. */
7058 found_decl_spec = true;
7059 /* If the next token is an appropriate keyword, we can simply
7060 add it to the list. */
7061 switch (token->keyword)
7066 if (decl_specs->specs[(int) ds_friend]++)
7067 error ("duplicate %<friend%>");
7068 /* Consume the token. */
7069 cp_lexer_consume_token (parser->lexer);
7072 /* function-specifier:
7079 cp_parser_function_specifier_opt (parser, decl_specs);
7085 ++decl_specs->specs[(int) ds_typedef];
7086 /* Consume the token. */
7087 cp_lexer_consume_token (parser->lexer);
7088 /* A constructor declarator cannot appear in a typedef. */
7089 constructor_possible_p = false;
7090 /* The "typedef" keyword can only occur in a declaration; we
7091 may as well commit at this point. */
7092 cp_parser_commit_to_tentative_parse (parser);
7095 /* storage-class-specifier:
7105 /* Consume the token. */
7106 cp_lexer_consume_token (parser->lexer);
7107 cp_parser_set_storage_class (decl_specs, sc_auto);
7110 /* Consume the token. */
7111 cp_lexer_consume_token (parser->lexer);
7112 cp_parser_set_storage_class (decl_specs, sc_register);
7115 /* Consume the token. */
7116 cp_lexer_consume_token (parser->lexer);
7117 if (decl_specs->specs[(int) ds_thread])
7119 error ("%<__thread%> before %<static%>");
7120 decl_specs->specs[(int) ds_thread] = 0;
7122 cp_parser_set_storage_class (decl_specs, sc_static);
7125 /* Consume the token. */
7126 cp_lexer_consume_token (parser->lexer);
7127 if (decl_specs->specs[(int) ds_thread])
7129 error ("%<__thread%> before %<extern%>");
7130 decl_specs->specs[(int) ds_thread] = 0;
7132 cp_parser_set_storage_class (decl_specs, sc_extern);
7135 /* Consume the token. */
7136 cp_lexer_consume_token (parser->lexer);
7137 cp_parser_set_storage_class (decl_specs, sc_mutable);
7140 /* Consume the token. */
7141 cp_lexer_consume_token (parser->lexer);
7142 ++decl_specs->specs[(int) ds_thread];
7146 /* We did not yet find a decl-specifier yet. */
7147 found_decl_spec = false;
7151 /* Constructors are a special case. The `S' in `S()' is not a
7152 decl-specifier; it is the beginning of the declarator. */
7155 && constructor_possible_p
7156 && (cp_parser_constructor_declarator_p
7157 (parser, decl_specs->specs[(int) ds_friend] != 0)));
7159 /* If we don't have a DECL_SPEC yet, then we must be looking at
7160 a type-specifier. */
7161 if (!found_decl_spec && !constructor_p)
7163 int decl_spec_declares_class_or_enum;
7164 bool is_cv_qualifier;
7168 = cp_parser_type_specifier (parser, flags,
7170 /*is_declaration=*/true,
7171 &decl_spec_declares_class_or_enum,
7174 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
7176 /* If this type-specifier referenced a user-defined type
7177 (a typedef, class-name, etc.), then we can't allow any
7178 more such type-specifiers henceforth.
7182 The longest sequence of decl-specifiers that could
7183 possibly be a type name is taken as the
7184 decl-specifier-seq of a declaration. The sequence shall
7185 be self-consistent as described below.
7189 As a general rule, at most one type-specifier is allowed
7190 in the complete decl-specifier-seq of a declaration. The
7191 only exceptions are the following:
7193 -- const or volatile can be combined with any other
7196 -- signed or unsigned can be combined with char, long,
7204 void g (const int Pc);
7206 Here, Pc is *not* part of the decl-specifier seq; it's
7207 the declarator. Therefore, once we see a type-specifier
7208 (other than a cv-qualifier), we forbid any additional
7209 user-defined types. We *do* still allow things like `int
7210 int' to be considered a decl-specifier-seq, and issue the
7211 error message later. */
7212 if (type_spec && !is_cv_qualifier)
7213 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
7214 /* A constructor declarator cannot follow a type-specifier. */
7217 constructor_possible_p = false;
7218 found_decl_spec = true;
7222 /* If we still do not have a DECL_SPEC, then there are no more
7224 if (!found_decl_spec)
7227 decl_specs->any_specifiers_p = true;
7228 /* After we see one decl-specifier, further decl-specifiers are
7230 flags |= CP_PARSER_FLAGS_OPTIONAL;
7233 /* Don't allow a friend specifier with a class definition. */
7234 if (decl_specs->specs[(int) ds_friend] != 0
7235 && (*declares_class_or_enum & 2))
7236 error ("class definition may not be declared a friend");
7239 /* Parse an (optional) storage-class-specifier.
7241 storage-class-specifier:
7250 storage-class-specifier:
7253 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7256 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7258 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7266 /* Consume the token. */
7267 return cp_lexer_consume_token (parser->lexer)->value;
7274 /* Parse an (optional) function-specifier.
7281 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7282 Updates DECL_SPECS, if it is non-NULL. */
7285 cp_parser_function_specifier_opt (cp_parser* parser,
7286 cp_decl_specifier_seq *decl_specs)
7288 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7292 ++decl_specs->specs[(int) ds_inline];
7297 ++decl_specs->specs[(int) ds_virtual];
7302 ++decl_specs->specs[(int) ds_explicit];
7309 /* Consume the token. */
7310 return cp_lexer_consume_token (parser->lexer)->value;
7313 /* Parse a linkage-specification.
7315 linkage-specification:
7316 extern string-literal { declaration-seq [opt] }
7317 extern string-literal declaration */
7320 cp_parser_linkage_specification (cp_parser* parser)
7324 /* Look for the `extern' keyword. */
7325 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7327 /* Look for the string-literal. */
7328 linkage = cp_parser_string_literal (parser, false, false);
7330 /* Transform the literal into an identifier. If the literal is a
7331 wide-character string, or contains embedded NULs, then we can't
7332 handle it as the user wants. */
7333 if (strlen (TREE_STRING_POINTER (linkage))
7334 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
7336 cp_parser_error (parser, "invalid linkage-specification");
7337 /* Assume C++ linkage. */
7338 linkage = lang_name_cplusplus;
7341 linkage = get_identifier (TREE_STRING_POINTER (linkage));
7343 /* We're now using the new linkage. */
7344 push_lang_context (linkage);
7346 /* If the next token is a `{', then we're using the first
7348 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7350 /* Consume the `{' token. */
7351 cp_lexer_consume_token (parser->lexer);
7352 /* Parse the declarations. */
7353 cp_parser_declaration_seq_opt (parser);
7354 /* Look for the closing `}'. */
7355 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7357 /* Otherwise, there's just one declaration. */
7360 bool saved_in_unbraced_linkage_specification_p;
7362 saved_in_unbraced_linkage_specification_p
7363 = parser->in_unbraced_linkage_specification_p;
7364 parser->in_unbraced_linkage_specification_p = true;
7365 have_extern_spec = true;
7366 cp_parser_declaration (parser);
7367 have_extern_spec = false;
7368 parser->in_unbraced_linkage_specification_p
7369 = saved_in_unbraced_linkage_specification_p;
7372 /* We're done with the linkage-specification. */
7373 pop_lang_context ();
7376 /* Special member functions [gram.special] */
7378 /* Parse a conversion-function-id.
7380 conversion-function-id:
7381 operator conversion-type-id
7383 Returns an IDENTIFIER_NODE representing the operator. */
7386 cp_parser_conversion_function_id (cp_parser* parser)
7390 tree saved_qualifying_scope;
7391 tree saved_object_scope;
7394 /* Look for the `operator' token. */
7395 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7396 return error_mark_node;
7397 /* When we parse the conversion-type-id, the current scope will be
7398 reset. However, we need that information in able to look up the
7399 conversion function later, so we save it here. */
7400 saved_scope = parser->scope;
7401 saved_qualifying_scope = parser->qualifying_scope;
7402 saved_object_scope = parser->object_scope;
7403 /* We must enter the scope of the class so that the names of
7404 entities declared within the class are available in the
7405 conversion-type-id. For example, consider:
7412 S::operator I() { ... }
7414 In order to see that `I' is a type-name in the definition, we
7415 must be in the scope of `S'. */
7417 pop_p = push_scope (saved_scope);
7418 /* Parse the conversion-type-id. */
7419 type = cp_parser_conversion_type_id (parser);
7420 /* Leave the scope of the class, if any. */
7422 pop_scope (saved_scope);
7423 /* Restore the saved scope. */
7424 parser->scope = saved_scope;
7425 parser->qualifying_scope = saved_qualifying_scope;
7426 parser->object_scope = saved_object_scope;
7427 /* If the TYPE is invalid, indicate failure. */
7428 if (type == error_mark_node)
7429 return error_mark_node;
7430 return mangle_conv_op_name_for_type (type);
7433 /* Parse a conversion-type-id:
7436 type-specifier-seq conversion-declarator [opt]
7438 Returns the TYPE specified. */
7441 cp_parser_conversion_type_id (cp_parser* parser)
7444 cp_decl_specifier_seq type_specifiers;
7445 cp_declarator *declarator;
7446 tree type_specified;
7448 /* Parse the attributes. */
7449 attributes = cp_parser_attributes_opt (parser);
7450 /* Parse the type-specifiers. */
7451 cp_parser_type_specifier_seq (parser, &type_specifiers);
7452 /* If that didn't work, stop. */
7453 if (type_specifiers.type == error_mark_node)
7454 return error_mark_node;
7455 /* Parse the conversion-declarator. */
7456 declarator = cp_parser_conversion_declarator_opt (parser);
7458 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
7459 /*initialized=*/0, &attributes);
7461 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
7462 return type_specified;
7465 /* Parse an (optional) conversion-declarator.
7467 conversion-declarator:
7468 ptr-operator conversion-declarator [opt]
7472 static cp_declarator *
7473 cp_parser_conversion_declarator_opt (cp_parser* parser)
7475 enum tree_code code;
7477 cp_cv_quals cv_quals;
7479 /* We don't know if there's a ptr-operator next, or not. */
7480 cp_parser_parse_tentatively (parser);
7481 /* Try the ptr-operator. */
7482 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
7483 /* If it worked, look for more conversion-declarators. */
7484 if (cp_parser_parse_definitely (parser))
7486 cp_declarator *declarator;
7488 /* Parse another optional declarator. */
7489 declarator = cp_parser_conversion_declarator_opt (parser);
7491 /* Create the representation of the declarator. */
7493 declarator = make_ptrmem_declarator (cv_quals, class_type,
7495 else if (code == INDIRECT_REF)
7496 declarator = make_pointer_declarator (cv_quals, declarator);
7498 declarator = make_reference_declarator (cv_quals, declarator);
7506 /* Parse an (optional) ctor-initializer.
7509 : mem-initializer-list
7511 Returns TRUE iff the ctor-initializer was actually present. */
7514 cp_parser_ctor_initializer_opt (cp_parser* parser)
7516 /* If the next token is not a `:', then there is no
7517 ctor-initializer. */
7518 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
7520 /* Do default initialization of any bases and members. */
7521 if (DECL_CONSTRUCTOR_P (current_function_decl))
7522 finish_mem_initializers (NULL_TREE);
7527 /* Consume the `:' token. */
7528 cp_lexer_consume_token (parser->lexer);
7529 /* And the mem-initializer-list. */
7530 cp_parser_mem_initializer_list (parser);
7535 /* Parse a mem-initializer-list.
7537 mem-initializer-list:
7539 mem-initializer , mem-initializer-list */
7542 cp_parser_mem_initializer_list (cp_parser* parser)
7544 tree mem_initializer_list = NULL_TREE;
7546 /* Let the semantic analysis code know that we are starting the
7547 mem-initializer-list. */
7548 if (!DECL_CONSTRUCTOR_P (current_function_decl))
7549 error ("only constructors take base initializers");
7551 /* Loop through the list. */
7554 tree mem_initializer;
7556 /* Parse the mem-initializer. */
7557 mem_initializer = cp_parser_mem_initializer (parser);
7558 /* Add it to the list, unless it was erroneous. */
7559 if (mem_initializer)
7561 TREE_CHAIN (mem_initializer) = mem_initializer_list;
7562 mem_initializer_list = mem_initializer;
7564 /* If the next token is not a `,', we're done. */
7565 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7567 /* Consume the `,' token. */
7568 cp_lexer_consume_token (parser->lexer);
7571 /* Perform semantic analysis. */
7572 if (DECL_CONSTRUCTOR_P (current_function_decl))
7573 finish_mem_initializers (mem_initializer_list);
7576 /* Parse a mem-initializer.
7579 mem-initializer-id ( expression-list [opt] )
7584 ( expression-list [opt] )
7586 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
7587 class) or FIELD_DECL (for a non-static data member) to initialize;
7588 the TREE_VALUE is the expression-list. */
7591 cp_parser_mem_initializer (cp_parser* parser)
7593 tree mem_initializer_id;
7594 tree expression_list;
7597 /* Find out what is being initialized. */
7598 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7600 pedwarn ("anachronistic old-style base class initializer");
7601 mem_initializer_id = NULL_TREE;
7604 mem_initializer_id = cp_parser_mem_initializer_id (parser);
7605 member = expand_member_init (mem_initializer_id);
7606 if (member && !DECL_P (member))
7607 in_base_initializer = 1;
7610 = cp_parser_parenthesized_expression_list (parser, false,
7611 /*non_constant_p=*/NULL);
7612 if (!expression_list)
7613 expression_list = void_type_node;
7615 in_base_initializer = 0;
7617 return member ? build_tree_list (member, expression_list) : NULL_TREE;
7620 /* Parse a mem-initializer-id.
7623 :: [opt] nested-name-specifier [opt] class-name
7626 Returns a TYPE indicating the class to be initializer for the first
7627 production. Returns an IDENTIFIER_NODE indicating the data member
7628 to be initialized for the second production. */
7631 cp_parser_mem_initializer_id (cp_parser* parser)
7633 bool global_scope_p;
7634 bool nested_name_specifier_p;
7635 bool template_p = false;
7638 /* `typename' is not allowed in this context ([temp.res]). */
7639 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
7641 error ("keyword %<typename%> not allowed in this context (a qualified "
7642 "member initializer is implicitly a type)");
7643 cp_lexer_consume_token (parser->lexer);
7645 /* Look for the optional `::' operator. */
7647 = (cp_parser_global_scope_opt (parser,
7648 /*current_scope_valid_p=*/false)
7650 /* Look for the optional nested-name-specifier. The simplest way to
7655 The keyword `typename' is not permitted in a base-specifier or
7656 mem-initializer; in these contexts a qualified name that
7657 depends on a template-parameter is implicitly assumed to be a
7660 is to assume that we have seen the `typename' keyword at this
7662 nested_name_specifier_p
7663 = (cp_parser_nested_name_specifier_opt (parser,
7664 /*typename_keyword_p=*/true,
7665 /*check_dependency_p=*/true,
7667 /*is_declaration=*/true)
7669 if (nested_name_specifier_p)
7670 template_p = cp_parser_optional_template_keyword (parser);
7671 /* If there is a `::' operator or a nested-name-specifier, then we
7672 are definitely looking for a class-name. */
7673 if (global_scope_p || nested_name_specifier_p)
7674 return cp_parser_class_name (parser,
7675 /*typename_keyword_p=*/true,
7676 /*template_keyword_p=*/template_p,
7678 /*check_dependency_p=*/true,
7679 /*class_head_p=*/false,
7680 /*is_declaration=*/true);
7681 /* Otherwise, we could also be looking for an ordinary identifier. */
7682 cp_parser_parse_tentatively (parser);
7683 /* Try a class-name. */
7684 id = cp_parser_class_name (parser,
7685 /*typename_keyword_p=*/true,
7686 /*template_keyword_p=*/false,
7688 /*check_dependency_p=*/true,
7689 /*class_head_p=*/false,
7690 /*is_declaration=*/true);
7691 /* If we found one, we're done. */
7692 if (cp_parser_parse_definitely (parser))
7694 /* Otherwise, look for an ordinary identifier. */
7695 return cp_parser_identifier (parser);
7698 /* Overloading [gram.over] */
7700 /* Parse an operator-function-id.
7702 operator-function-id:
7705 Returns an IDENTIFIER_NODE for the operator which is a
7706 human-readable spelling of the identifier, e.g., `operator +'. */
7709 cp_parser_operator_function_id (cp_parser* parser)
7711 /* Look for the `operator' keyword. */
7712 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7713 return error_mark_node;
7714 /* And then the name of the operator itself. */
7715 return cp_parser_operator (parser);
7718 /* Parse an operator.
7721 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
7722 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
7723 || ++ -- , ->* -> () []
7730 Returns an IDENTIFIER_NODE for the operator which is a
7731 human-readable spelling of the identifier, e.g., `operator +'. */
7734 cp_parser_operator (cp_parser* parser)
7736 tree id = NULL_TREE;
7739 /* Peek at the next token. */
7740 token = cp_lexer_peek_token (parser->lexer);
7741 /* Figure out which operator we have. */
7742 switch (token->type)
7748 /* The keyword should be either `new' or `delete'. */
7749 if (token->keyword == RID_NEW)
7751 else if (token->keyword == RID_DELETE)
7756 /* Consume the `new' or `delete' token. */
7757 cp_lexer_consume_token (parser->lexer);
7759 /* Peek at the next token. */
7760 token = cp_lexer_peek_token (parser->lexer);
7761 /* If it's a `[' token then this is the array variant of the
7763 if (token->type == CPP_OPEN_SQUARE)
7765 /* Consume the `[' token. */
7766 cp_lexer_consume_token (parser->lexer);
7767 /* Look for the `]' token. */
7768 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
7769 id = ansi_opname (op == NEW_EXPR
7770 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
7772 /* Otherwise, we have the non-array variant. */
7774 id = ansi_opname (op);
7780 id = ansi_opname (PLUS_EXPR);
7784 id = ansi_opname (MINUS_EXPR);
7788 id = ansi_opname (MULT_EXPR);
7792 id = ansi_opname (TRUNC_DIV_EXPR);
7796 id = ansi_opname (TRUNC_MOD_EXPR);
7800 id = ansi_opname (BIT_XOR_EXPR);
7804 id = ansi_opname (BIT_AND_EXPR);
7808 id = ansi_opname (BIT_IOR_EXPR);
7812 id = ansi_opname (BIT_NOT_EXPR);
7816 id = ansi_opname (TRUTH_NOT_EXPR);
7820 id = ansi_assopname (NOP_EXPR);
7824 id = ansi_opname (LT_EXPR);
7828 id = ansi_opname (GT_EXPR);
7832 id = ansi_assopname (PLUS_EXPR);
7836 id = ansi_assopname (MINUS_EXPR);
7840 id = ansi_assopname (MULT_EXPR);
7844 id = ansi_assopname (TRUNC_DIV_EXPR);
7848 id = ansi_assopname (TRUNC_MOD_EXPR);
7852 id = ansi_assopname (BIT_XOR_EXPR);
7856 id = ansi_assopname (BIT_AND_EXPR);
7860 id = ansi_assopname (BIT_IOR_EXPR);
7864 id = ansi_opname (LSHIFT_EXPR);
7868 id = ansi_opname (RSHIFT_EXPR);
7872 id = ansi_assopname (LSHIFT_EXPR);
7876 id = ansi_assopname (RSHIFT_EXPR);
7880 id = ansi_opname (EQ_EXPR);
7884 id = ansi_opname (NE_EXPR);
7888 id = ansi_opname (LE_EXPR);
7891 case CPP_GREATER_EQ:
7892 id = ansi_opname (GE_EXPR);
7896 id = ansi_opname (TRUTH_ANDIF_EXPR);
7900 id = ansi_opname (TRUTH_ORIF_EXPR);
7904 id = ansi_opname (POSTINCREMENT_EXPR);
7907 case CPP_MINUS_MINUS:
7908 id = ansi_opname (PREDECREMENT_EXPR);
7912 id = ansi_opname (COMPOUND_EXPR);
7915 case CPP_DEREF_STAR:
7916 id = ansi_opname (MEMBER_REF);
7920 id = ansi_opname (COMPONENT_REF);
7923 case CPP_OPEN_PAREN:
7924 /* Consume the `('. */
7925 cp_lexer_consume_token (parser->lexer);
7926 /* Look for the matching `)'. */
7927 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
7928 return ansi_opname (CALL_EXPR);
7930 case CPP_OPEN_SQUARE:
7931 /* Consume the `['. */
7932 cp_lexer_consume_token (parser->lexer);
7933 /* Look for the matching `]'. */
7934 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
7935 return ansi_opname (ARRAY_REF);
7939 id = ansi_opname (MIN_EXPR);
7943 id = ansi_opname (MAX_EXPR);
7947 id = ansi_assopname (MIN_EXPR);
7951 id = ansi_assopname (MAX_EXPR);
7955 /* Anything else is an error. */
7959 /* If we have selected an identifier, we need to consume the
7962 cp_lexer_consume_token (parser->lexer);
7963 /* Otherwise, no valid operator name was present. */
7966 cp_parser_error (parser, "expected operator");
7967 id = error_mark_node;
7973 /* Parse a template-declaration.
7975 template-declaration:
7976 export [opt] template < template-parameter-list > declaration
7978 If MEMBER_P is TRUE, this template-declaration occurs within a
7981 The grammar rule given by the standard isn't correct. What
7984 template-declaration:
7985 export [opt] template-parameter-list-seq
7986 decl-specifier-seq [opt] init-declarator [opt] ;
7987 export [opt] template-parameter-list-seq
7990 template-parameter-list-seq:
7991 template-parameter-list-seq [opt]
7992 template < template-parameter-list > */
7995 cp_parser_template_declaration (cp_parser* parser, bool member_p)
7997 /* Check for `export'. */
7998 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
8000 /* Consume the `export' token. */
8001 cp_lexer_consume_token (parser->lexer);
8002 /* Warn that we do not support `export'. */
8003 warning ("keyword %<export%> not implemented, and will be ignored");
8006 cp_parser_template_declaration_after_export (parser, member_p);
8009 /* Parse a template-parameter-list.
8011 template-parameter-list:
8013 template-parameter-list , template-parameter
8015 Returns a TREE_LIST. Each node represents a template parameter.
8016 The nodes are connected via their TREE_CHAINs. */
8019 cp_parser_template_parameter_list (cp_parser* parser)
8021 tree parameter_list = NULL_TREE;
8029 /* Parse the template-parameter. */
8030 parameter = cp_parser_template_parameter (parser, &is_non_type);
8031 /* Add it to the list. */
8032 parameter_list = process_template_parm (parameter_list,
8035 /* Peek at the next token. */
8036 token = cp_lexer_peek_token (parser->lexer);
8037 /* If it's not a `,', we're done. */
8038 if (token->type != CPP_COMMA)
8040 /* Otherwise, consume the `,' token. */
8041 cp_lexer_consume_token (parser->lexer);
8044 return parameter_list;
8047 /* Parse a template-parameter.
8051 parameter-declaration
8053 Returns a TREE_LIST. The TREE_VALUE represents the parameter. The
8054 TREE_PURPOSE is the default value, if any. *IS_NON_TYPE is set to
8055 true iff this parameter is a non-type parameter. */
8058 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type)
8061 cp_parameter_declarator *parameter_declarator;
8063 /* Assume it is a type parameter or a template parameter. */
8064 *is_non_type = false;
8065 /* Peek at the next token. */
8066 token = cp_lexer_peek_token (parser->lexer);
8067 /* If it is `class' or `template', we have a type-parameter. */
8068 if (token->keyword == RID_TEMPLATE)
8069 return cp_parser_type_parameter (parser);
8070 /* If it is `class' or `typename' we do not know yet whether it is a
8071 type parameter or a non-type parameter. Consider:
8073 template <typename T, typename T::X X> ...
8077 template <class C, class D*> ...
8079 Here, the first parameter is a type parameter, and the second is
8080 a non-type parameter. We can tell by looking at the token after
8081 the identifier -- if it is a `,', `=', or `>' then we have a type
8083 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
8085 /* Peek at the token after `class' or `typename'. */
8086 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8087 /* If it's an identifier, skip it. */
8088 if (token->type == CPP_NAME)
8089 token = cp_lexer_peek_nth_token (parser->lexer, 3);
8090 /* Now, see if the token looks like the end of a template
8092 if (token->type == CPP_COMMA
8093 || token->type == CPP_EQ
8094 || token->type == CPP_GREATER)
8095 return cp_parser_type_parameter (parser);
8098 /* Otherwise, it is a non-type parameter.
8102 When parsing a default template-argument for a non-type
8103 template-parameter, the first non-nested `>' is taken as the end
8104 of the template parameter-list rather than a greater-than
8106 *is_non_type = true;
8107 parameter_declarator
8108 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
8109 /*parenthesized_p=*/NULL);
8110 return (build_tree_list
8111 (parameter_declarator->default_argument,
8112 grokdeclarator (parameter_declarator->declarator,
8113 ¶meter_declarator->decl_specifiers,
8114 PARM, /*initialized=*/0,
8115 /*attrlist=*/NULL)));
8118 /* Parse a type-parameter.
8121 class identifier [opt]
8122 class identifier [opt] = type-id
8123 typename identifier [opt]
8124 typename identifier [opt] = type-id
8125 template < template-parameter-list > class identifier [opt]
8126 template < template-parameter-list > class identifier [opt]
8129 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8130 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8131 the declaration of the parameter. */
8134 cp_parser_type_parameter (cp_parser* parser)
8139 /* Look for a keyword to tell us what kind of parameter this is. */
8140 token = cp_parser_require (parser, CPP_KEYWORD,
8141 "`class', `typename', or `template'");
8143 return error_mark_node;
8145 switch (token->keyword)
8151 tree default_argument;
8153 /* If the next token is an identifier, then it names the
8155 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8156 identifier = cp_parser_identifier (parser);
8158 identifier = NULL_TREE;
8160 /* Create the parameter. */
8161 parameter = finish_template_type_parm (class_type_node, identifier);
8163 /* If the next token is an `=', we have a default argument. */
8164 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8166 /* Consume the `=' token. */
8167 cp_lexer_consume_token (parser->lexer);
8168 /* Parse the default-argument. */
8169 default_argument = cp_parser_type_id (parser);
8172 default_argument = NULL_TREE;
8174 /* Create the combined representation of the parameter and the
8175 default argument. */
8176 parameter = build_tree_list (default_argument, parameter);
8182 tree parameter_list;
8184 tree default_argument;
8186 /* Look for the `<'. */
8187 cp_parser_require (parser, CPP_LESS, "`<'");
8188 /* Parse the template-parameter-list. */
8189 begin_template_parm_list ();
8191 = cp_parser_template_parameter_list (parser);
8192 parameter_list = end_template_parm_list (parameter_list);
8193 /* Look for the `>'. */
8194 cp_parser_require (parser, CPP_GREATER, "`>'");
8195 /* Look for the `class' keyword. */
8196 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
8197 /* If the next token is an `=', then there is a
8198 default-argument. If the next token is a `>', we are at
8199 the end of the parameter-list. If the next token is a `,',
8200 then we are at the end of this parameter. */
8201 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8202 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
8203 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8205 identifier = cp_parser_identifier (parser);
8206 /* Treat invalid names as if the parameter were nameless. */
8207 if (identifier == error_mark_node)
8208 identifier = NULL_TREE;
8211 identifier = NULL_TREE;
8213 /* Create the template parameter. */
8214 parameter = finish_template_template_parm (class_type_node,
8217 /* If the next token is an `=', then there is a
8218 default-argument. */
8219 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8223 /* Consume the `='. */
8224 cp_lexer_consume_token (parser->lexer);
8225 /* Parse the id-expression. */
8227 = cp_parser_id_expression (parser,
8228 /*template_keyword_p=*/false,
8229 /*check_dependency_p=*/true,
8230 /*template_p=*/&is_template,
8231 /*declarator_p=*/false);
8232 if (TREE_CODE (default_argument) == TYPE_DECL)
8233 /* If the id-expression was a template-id that refers to
8234 a template-class, we already have the declaration here,
8235 so no further lookup is needed. */
8238 /* Look up the name. */
8240 = cp_parser_lookup_name (parser, default_argument,
8242 /*is_template=*/is_template,
8243 /*is_namespace=*/false,
8244 /*check_dependency=*/true,
8245 /*ambiguous_p=*/NULL);
8246 /* See if the default argument is valid. */
8248 = check_template_template_default_arg (default_argument);
8251 default_argument = NULL_TREE;
8253 /* Create the combined representation of the parameter and the
8254 default argument. */
8255 parameter = build_tree_list (default_argument, parameter);
8267 /* Parse a template-id.
8270 template-name < template-argument-list [opt] >
8272 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8273 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8274 returned. Otherwise, if the template-name names a function, or set
8275 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8276 names a class, returns a TYPE_DECL for the specialization.
8278 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8279 uninstantiated templates. */
8282 cp_parser_template_id (cp_parser *parser,
8283 bool template_keyword_p,
8284 bool check_dependency_p,
8285 bool is_declaration)
8290 cp_token_position start_of_id = 0;
8291 tree access_check = NULL_TREE;
8292 cp_token *next_token, *next_token_2;
8295 /* If the next token corresponds to a template-id, there is no need
8297 next_token = cp_lexer_peek_token (parser->lexer);
8298 if (next_token->type == CPP_TEMPLATE_ID)
8303 /* Get the stored value. */
8304 value = cp_lexer_consume_token (parser->lexer)->value;
8305 /* Perform any access checks that were deferred. */
8306 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
8307 perform_or_defer_access_check (TREE_PURPOSE (check),
8308 TREE_VALUE (check));
8309 /* Return the stored value. */
8310 return TREE_VALUE (value);
8313 /* Avoid performing name lookup if there is no possibility of
8314 finding a template-id. */
8315 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8316 || (next_token->type == CPP_NAME
8317 && !cp_parser_nth_token_starts_template_argument_list_p
8320 cp_parser_error (parser, "expected template-id");
8321 return error_mark_node;
8324 /* Remember where the template-id starts. */
8325 if (cp_parser_parsing_tentatively (parser)
8326 && !cp_parser_committed_to_tentative_parse (parser))
8327 start_of_id = cp_lexer_token_position (parser->lexer, false);
8329 push_deferring_access_checks (dk_deferred);
8331 /* Parse the template-name. */
8332 is_identifier = false;
8333 template = cp_parser_template_name (parser, template_keyword_p,
8337 if (template == error_mark_node || is_identifier)
8339 pop_deferring_access_checks ();
8343 /* If we find the sequence `[:' after a template-name, it's probably
8344 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8345 parse correctly the argument list. */
8346 next_token = cp_lexer_peek_token (parser->lexer);
8347 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8348 if (next_token->type == CPP_OPEN_SQUARE
8349 && next_token->flags & DIGRAPH
8350 && next_token_2->type == CPP_COLON
8351 && !(next_token_2->flags & PREV_WHITE))
8353 cp_parser_parse_tentatively (parser);
8354 /* Change `:' into `::'. */
8355 next_token_2->type = CPP_SCOPE;
8356 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8358 cp_lexer_consume_token (parser->lexer);
8359 /* Parse the arguments. */
8360 arguments = cp_parser_enclosed_template_argument_list (parser);
8361 if (!cp_parser_parse_definitely (parser))
8363 /* If we couldn't parse an argument list, then we revert our changes
8364 and return simply an error. Maybe this is not a template-id
8366 next_token_2->type = CPP_COLON;
8367 cp_parser_error (parser, "expected %<<%>");
8368 pop_deferring_access_checks ();
8369 return error_mark_node;
8371 /* Otherwise, emit an error about the invalid digraph, but continue
8372 parsing because we got our argument list. */
8373 pedwarn ("%<<::%> cannot begin a template-argument list");
8374 inform ("%<<:%> is an alternate spelling for %<[%>. Insert whitespace "
8375 "between %<<%> and %<::%>");
8376 if (!flag_permissive)
8381 inform ("(if you use -fpermissive G++ will accept your code)");
8388 /* Look for the `<' that starts the template-argument-list. */
8389 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
8391 pop_deferring_access_checks ();
8392 return error_mark_node;
8394 /* Parse the arguments. */
8395 arguments = cp_parser_enclosed_template_argument_list (parser);
8398 /* Build a representation of the specialization. */
8399 if (TREE_CODE (template) == IDENTIFIER_NODE)
8400 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
8401 else if (DECL_CLASS_TEMPLATE_P (template)
8402 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
8404 = finish_template_type (template, arguments,
8405 cp_lexer_next_token_is (parser->lexer,
8409 /* If it's not a class-template or a template-template, it should be
8410 a function-template. */
8411 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (template)
8412 || TREE_CODE (template) == OVERLOAD
8413 || BASELINK_P (template)));
8415 template_id = lookup_template_function (template, arguments);
8418 /* Retrieve any deferred checks. Do not pop this access checks yet
8419 so the memory will not be reclaimed during token replacing below. */
8420 access_check = get_deferred_access_checks ();
8422 /* If parsing tentatively, replace the sequence of tokens that makes
8423 up the template-id with a CPP_TEMPLATE_ID token. That way,
8424 should we re-parse the token stream, we will not have to repeat
8425 the effort required to do the parse, nor will we issue duplicate
8426 error messages about problems during instantiation of the
8430 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
8432 /* Reset the contents of the START_OF_ID token. */
8433 token->type = CPP_TEMPLATE_ID;
8434 token->value = build_tree_list (access_check, template_id);
8435 token->keyword = RID_MAX;
8437 /* Purge all subsequent tokens. */
8438 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
8441 pop_deferring_access_checks ();
8445 /* Parse a template-name.
8450 The standard should actually say:
8454 operator-function-id
8456 A defect report has been filed about this issue.
8458 A conversion-function-id cannot be a template name because they cannot
8459 be part of a template-id. In fact, looking at this code:
8463 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
8464 It is impossible to call a templated conversion-function-id with an
8465 explicit argument list, since the only allowed template parameter is
8466 the type to which it is converting.
8468 If TEMPLATE_KEYWORD_P is true, then we have just seen the
8469 `template' keyword, in a construction like:
8473 In that case `f' is taken to be a template-name, even though there
8474 is no way of knowing for sure.
8476 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
8477 name refers to a set of overloaded functions, at least one of which
8478 is a template, or an IDENTIFIER_NODE with the name of the template,
8479 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
8480 names are looked up inside uninstantiated templates. */
8483 cp_parser_template_name (cp_parser* parser,
8484 bool template_keyword_p,
8485 bool check_dependency_p,
8486 bool is_declaration,
8487 bool *is_identifier)
8493 /* If the next token is `operator', then we have either an
8494 operator-function-id or a conversion-function-id. */
8495 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
8497 /* We don't know whether we're looking at an
8498 operator-function-id or a conversion-function-id. */
8499 cp_parser_parse_tentatively (parser);
8500 /* Try an operator-function-id. */
8501 identifier = cp_parser_operator_function_id (parser);
8502 /* If that didn't work, try a conversion-function-id. */
8503 if (!cp_parser_parse_definitely (parser))
8505 cp_parser_error (parser, "expected template-name");
8506 return error_mark_node;
8509 /* Look for the identifier. */
8511 identifier = cp_parser_identifier (parser);
8513 /* If we didn't find an identifier, we don't have a template-id. */
8514 if (identifier == error_mark_node)
8515 return error_mark_node;
8517 /* If the name immediately followed the `template' keyword, then it
8518 is a template-name. However, if the next token is not `<', then
8519 we do not treat it as a template-name, since it is not being used
8520 as part of a template-id. This enables us to handle constructs
8523 template <typename T> struct S { S(); };
8524 template <typename T> S<T>::S();
8526 correctly. We would treat `S' as a template -- if it were `S<T>'
8527 -- but we do not if there is no `<'. */
8529 if (processing_template_decl
8530 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
8532 /* In a declaration, in a dependent context, we pretend that the
8533 "template" keyword was present in order to improve error
8534 recovery. For example, given:
8536 template <typename T> void f(T::X<int>);
8538 we want to treat "X<int>" as a template-id. */
8540 && !template_keyword_p
8541 && parser->scope && TYPE_P (parser->scope)
8542 && check_dependency_p
8543 && dependent_type_p (parser->scope)
8544 /* Do not do this for dtors (or ctors), since they never
8545 need the template keyword before their name. */
8546 && !constructor_name_p (identifier, parser->scope))
8548 cp_token_position start = 0;
8550 /* Explain what went wrong. */
8551 error ("non-template %qD used as template", identifier);
8552 inform ("use %<%T::template %D%> to indicate that it is a template",
8553 parser->scope, identifier);
8554 /* If parsing tentatively, find the location of the "<"
8556 if (cp_parser_parsing_tentatively (parser)
8557 && !cp_parser_committed_to_tentative_parse (parser))
8559 cp_parser_simulate_error (parser);
8560 start = cp_lexer_token_position (parser->lexer, true);
8562 /* Parse the template arguments so that we can issue error
8563 messages about them. */
8564 cp_lexer_consume_token (parser->lexer);
8565 cp_parser_enclosed_template_argument_list (parser);
8566 /* Skip tokens until we find a good place from which to
8567 continue parsing. */
8568 cp_parser_skip_to_closing_parenthesis (parser,
8569 /*recovering=*/true,
8571 /*consume_paren=*/false);
8572 /* If parsing tentatively, permanently remove the
8573 template argument list. That will prevent duplicate
8574 error messages from being issued about the missing
8575 "template" keyword. */
8577 cp_lexer_purge_tokens_after (parser->lexer, start);
8579 *is_identifier = true;
8583 /* If the "template" keyword is present, then there is generally
8584 no point in doing name-lookup, so we just return IDENTIFIER.
8585 But, if the qualifying scope is non-dependent then we can
8586 (and must) do name-lookup normally. */
8587 if (template_keyword_p
8589 || (TYPE_P (parser->scope)
8590 && dependent_type_p (parser->scope))))
8594 /* Look up the name. */
8595 decl = cp_parser_lookup_name (parser, identifier,
8597 /*is_template=*/false,
8598 /*is_namespace=*/false,
8600 /*ambiguous_p=*/NULL);
8601 decl = maybe_get_template_decl_from_type_decl (decl);
8603 /* If DECL is a template, then the name was a template-name. */
8604 if (TREE_CODE (decl) == TEMPLATE_DECL)
8608 /* The standard does not explicitly indicate whether a name that
8609 names a set of overloaded declarations, some of which are
8610 templates, is a template-name. However, such a name should
8611 be a template-name; otherwise, there is no way to form a
8612 template-id for the overloaded templates. */
8613 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
8614 if (TREE_CODE (fns) == OVERLOAD)
8618 for (fn = fns; fn; fn = OVL_NEXT (fn))
8619 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
8624 /* Otherwise, the name does not name a template. */
8625 cp_parser_error (parser, "expected template-name");
8626 return error_mark_node;
8630 /* If DECL is dependent, and refers to a function, then just return
8631 its name; we will look it up again during template instantiation. */
8632 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
8634 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
8635 if (TYPE_P (scope) && dependent_type_p (scope))
8642 /* Parse a template-argument-list.
8644 template-argument-list:
8646 template-argument-list , template-argument
8648 Returns a TREE_VEC containing the arguments. */
8651 cp_parser_template_argument_list (cp_parser* parser)
8653 tree fixed_args[10];
8654 unsigned n_args = 0;
8655 unsigned alloced = 10;
8656 tree *arg_ary = fixed_args;
8658 bool saved_in_template_argument_list_p;
8660 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
8661 parser->in_template_argument_list_p = true;
8667 /* Consume the comma. */
8668 cp_lexer_consume_token (parser->lexer);
8670 /* Parse the template-argument. */
8671 argument = cp_parser_template_argument (parser);
8672 if (n_args == alloced)
8676 if (arg_ary == fixed_args)
8678 arg_ary = xmalloc (sizeof (tree) * alloced);
8679 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
8682 arg_ary = xrealloc (arg_ary, sizeof (tree) * alloced);
8684 arg_ary[n_args++] = argument;
8686 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
8688 vec = make_tree_vec (n_args);
8691 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
8693 if (arg_ary != fixed_args)
8695 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
8699 /* Parse a template-argument.
8702 assignment-expression
8706 The representation is that of an assignment-expression, type-id, or
8707 id-expression -- except that the qualified id-expression is
8708 evaluated, so that the value returned is either a DECL or an
8711 Although the standard says "assignment-expression", it forbids
8712 throw-expressions or assignments in the template argument.
8713 Therefore, we use "conditional-expression" instead. */
8716 cp_parser_template_argument (cp_parser* parser)
8721 bool maybe_type_id = false;
8724 tree qualifying_class;
8726 /* There's really no way to know what we're looking at, so we just
8727 try each alternative in order.
8731 In a template-argument, an ambiguity between a type-id and an
8732 expression is resolved to a type-id, regardless of the form of
8733 the corresponding template-parameter.
8735 Therefore, we try a type-id first. */
8736 cp_parser_parse_tentatively (parser);
8737 argument = cp_parser_type_id (parser);
8738 /* If there was no error parsing the type-id but the next token is a '>>',
8739 we probably found a typo for '> >'. But there are type-id which are
8740 also valid expressions. For instance:
8742 struct X { int operator >> (int); };
8743 template <int V> struct Foo {};
8746 Here 'X()' is a valid type-id of a function type, but the user just
8747 wanted to write the expression "X() >> 5". Thus, we remember that we
8748 found a valid type-id, but we still try to parse the argument as an
8749 expression to see what happens. */
8750 if (!cp_parser_error_occurred (parser)
8751 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
8753 maybe_type_id = true;
8754 cp_parser_abort_tentative_parse (parser);
8758 /* If the next token isn't a `,' or a `>', then this argument wasn't
8759 really finished. This means that the argument is not a valid
8761 if (!cp_parser_next_token_ends_template_argument_p (parser))
8762 cp_parser_error (parser, "expected template-argument");
8763 /* If that worked, we're done. */
8764 if (cp_parser_parse_definitely (parser))
8767 /* We're still not sure what the argument will be. */
8768 cp_parser_parse_tentatively (parser);
8769 /* Try a template. */
8770 argument = cp_parser_id_expression (parser,
8771 /*template_keyword_p=*/false,
8772 /*check_dependency_p=*/true,
8774 /*declarator_p=*/false);
8775 /* If the next token isn't a `,' or a `>', then this argument wasn't
8777 if (!cp_parser_next_token_ends_template_argument_p (parser))
8778 cp_parser_error (parser, "expected template-argument");
8779 if (!cp_parser_error_occurred (parser))
8781 /* Figure out what is being referred to. If the id-expression
8782 was for a class template specialization, then we will have a
8783 TYPE_DECL at this point. There is no need to do name lookup
8784 at this point in that case. */
8785 if (TREE_CODE (argument) != TYPE_DECL)
8786 argument = cp_parser_lookup_name (parser, argument,
8788 /*is_template=*/template_p,
8789 /*is_namespace=*/false,
8790 /*check_dependency=*/true,
8791 /*ambiguous_p=*/NULL);
8792 if (TREE_CODE (argument) != TEMPLATE_DECL
8793 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
8794 cp_parser_error (parser, "expected template-name");
8796 if (cp_parser_parse_definitely (parser))
8798 /* It must be a non-type argument. There permitted cases are given
8799 in [temp.arg.nontype]:
8801 -- an integral constant-expression of integral or enumeration
8804 -- the name of a non-type template-parameter; or
8806 -- the name of an object or function with external linkage...
8808 -- the address of an object or function with external linkage...
8810 -- a pointer to member... */
8811 /* Look for a non-type template parameter. */
8812 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8814 cp_parser_parse_tentatively (parser);
8815 argument = cp_parser_primary_expression (parser,
8818 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
8819 || !cp_parser_next_token_ends_template_argument_p (parser))
8820 cp_parser_simulate_error (parser);
8821 if (cp_parser_parse_definitely (parser))
8824 /* If the next token is "&", the argument must be the address of an
8825 object or function with external linkage. */
8826 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
8828 cp_lexer_consume_token (parser->lexer);
8829 /* See if we might have an id-expression. */
8830 token = cp_lexer_peek_token (parser->lexer);
8831 if (token->type == CPP_NAME
8832 || token->keyword == RID_OPERATOR
8833 || token->type == CPP_SCOPE
8834 || token->type == CPP_TEMPLATE_ID
8835 || token->type == CPP_NESTED_NAME_SPECIFIER)
8837 cp_parser_parse_tentatively (parser);
8838 argument = cp_parser_primary_expression (parser,
8841 if (cp_parser_error_occurred (parser)
8842 || !cp_parser_next_token_ends_template_argument_p (parser))
8843 cp_parser_abort_tentative_parse (parser);
8846 if (qualifying_class)
8847 argument = finish_qualified_id_expr (qualifying_class,
8851 if (TREE_CODE (argument) == VAR_DECL)
8853 /* A variable without external linkage might still be a
8854 valid constant-expression, so no error is issued here
8855 if the external-linkage check fails. */
8856 if (!DECL_EXTERNAL_LINKAGE_P (argument))
8857 cp_parser_simulate_error (parser);
8859 else if (is_overloaded_fn (argument))
8860 /* All overloaded functions are allowed; if the external
8861 linkage test does not pass, an error will be issued
8865 && (TREE_CODE (argument) == OFFSET_REF
8866 || TREE_CODE (argument) == SCOPE_REF))
8867 /* A pointer-to-member. */
8870 cp_parser_simulate_error (parser);
8872 if (cp_parser_parse_definitely (parser))
8875 argument = build_x_unary_op (ADDR_EXPR, argument);
8880 /* If the argument started with "&", there are no other valid
8881 alternatives at this point. */
8884 cp_parser_error (parser, "invalid non-type template argument");
8885 return error_mark_node;
8887 /* If the argument wasn't successfully parsed as a type-id followed
8888 by '>>', the argument can only be a constant expression now.
8889 Otherwise, we try parsing the constant-expression tentatively,
8890 because the argument could really be a type-id. */
8892 cp_parser_parse_tentatively (parser);
8893 argument = cp_parser_constant_expression (parser,
8894 /*allow_non_constant_p=*/false,
8895 /*non_constant_p=*/NULL);
8896 argument = fold_non_dependent_expr (argument);
8899 if (!cp_parser_next_token_ends_template_argument_p (parser))
8900 cp_parser_error (parser, "expected template-argument");
8901 if (cp_parser_parse_definitely (parser))
8903 /* We did our best to parse the argument as a non type-id, but that
8904 was the only alternative that matched (albeit with a '>' after
8905 it). We can assume it's just a typo from the user, and a
8906 diagnostic will then be issued. */
8907 return cp_parser_type_id (parser);
8910 /* Parse an explicit-instantiation.
8912 explicit-instantiation:
8913 template declaration
8915 Although the standard says `declaration', what it really means is:
8917 explicit-instantiation:
8918 template decl-specifier-seq [opt] declarator [opt] ;
8920 Things like `template int S<int>::i = 5, int S<double>::j;' are not
8921 supposed to be allowed. A defect report has been filed about this
8926 explicit-instantiation:
8927 storage-class-specifier template
8928 decl-specifier-seq [opt] declarator [opt] ;
8929 function-specifier template
8930 decl-specifier-seq [opt] declarator [opt] ; */
8933 cp_parser_explicit_instantiation (cp_parser* parser)
8935 int declares_class_or_enum;
8936 cp_decl_specifier_seq decl_specifiers;
8937 tree extension_specifier = NULL_TREE;
8939 /* Look for an (optional) storage-class-specifier or
8940 function-specifier. */
8941 if (cp_parser_allow_gnu_extensions_p (parser))
8944 = cp_parser_storage_class_specifier_opt (parser);
8945 if (!extension_specifier)
8947 = cp_parser_function_specifier_opt (parser,
8948 /*decl_specs=*/NULL);
8951 /* Look for the `template' keyword. */
8952 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
8953 /* Let the front end know that we are processing an explicit
8955 begin_explicit_instantiation ();
8956 /* [temp.explicit] says that we are supposed to ignore access
8957 control while processing explicit instantiation directives. */
8958 push_deferring_access_checks (dk_no_check);
8959 /* Parse a decl-specifier-seq. */
8960 cp_parser_decl_specifier_seq (parser,
8961 CP_PARSER_FLAGS_OPTIONAL,
8963 &declares_class_or_enum);
8964 /* If there was exactly one decl-specifier, and it declared a class,
8965 and there's no declarator, then we have an explicit type
8967 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
8971 type = check_tag_decl (&decl_specifiers);
8972 /* Turn access control back on for names used during
8973 template instantiation. */
8974 pop_deferring_access_checks ();
8976 do_type_instantiation (type, extension_specifier, /*complain=*/1);
8980 cp_declarator *declarator;
8983 /* Parse the declarator. */
8985 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
8986 /*ctor_dtor_or_conv_p=*/NULL,
8987 /*parenthesized_p=*/NULL,
8988 /*member_p=*/false);
8989 if (declares_class_or_enum & 2)
8990 cp_parser_check_for_definition_in_return_type (declarator,
8991 decl_specifiers.type);
8992 if (declarator != cp_error_declarator)
8994 decl = grokdeclarator (declarator, &decl_specifiers,
8996 /* Turn access control back on for names used during
8997 template instantiation. */
8998 pop_deferring_access_checks ();
8999 /* Do the explicit instantiation. */
9000 do_decl_instantiation (decl, extension_specifier);
9004 pop_deferring_access_checks ();
9005 /* Skip the body of the explicit instantiation. */
9006 cp_parser_skip_to_end_of_statement (parser);
9009 /* We're done with the instantiation. */
9010 end_explicit_instantiation ();
9012 cp_parser_consume_semicolon_at_end_of_statement (parser);
9015 /* Parse an explicit-specialization.
9017 explicit-specialization:
9018 template < > declaration
9020 Although the standard says `declaration', what it really means is:
9022 explicit-specialization:
9023 template <> decl-specifier [opt] init-declarator [opt] ;
9024 template <> function-definition
9025 template <> explicit-specialization
9026 template <> template-declaration */
9029 cp_parser_explicit_specialization (cp_parser* parser)
9031 /* Look for the `template' keyword. */
9032 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9033 /* Look for the `<'. */
9034 cp_parser_require (parser, CPP_LESS, "`<'");
9035 /* Look for the `>'. */
9036 cp_parser_require (parser, CPP_GREATER, "`>'");
9037 /* We have processed another parameter list. */
9038 ++parser->num_template_parameter_lists;
9039 /* Let the front end know that we are beginning a specialization. */
9040 begin_specialization ();
9042 /* If the next keyword is `template', we need to figure out whether
9043 or not we're looking a template-declaration. */
9044 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9046 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9047 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9048 cp_parser_template_declaration_after_export (parser,
9049 /*member_p=*/false);
9051 cp_parser_explicit_specialization (parser);
9054 /* Parse the dependent declaration. */
9055 cp_parser_single_declaration (parser,
9059 /* We're done with the specialization. */
9060 end_specialization ();
9061 /* We're done with this parameter list. */
9062 --parser->num_template_parameter_lists;
9065 /* Parse a type-specifier.
9068 simple-type-specifier
9071 elaborated-type-specifier
9079 Returns a representation of the type-specifier. For a
9080 class-specifier, enum-specifier, or elaborated-type-specifier, a
9081 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9083 The parser flags FLAGS is used to control type-specifier parsing.
9085 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9086 in a decl-specifier-seq.
9088 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9089 class-specifier, enum-specifier, or elaborated-type-specifier, then
9090 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9091 if a type is declared; 2 if it is defined. Otherwise, it is set to
9094 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9095 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9099 cp_parser_type_specifier (cp_parser* parser,
9100 cp_parser_flags flags,
9101 cp_decl_specifier_seq *decl_specs,
9102 bool is_declaration,
9103 int* declares_class_or_enum,
9104 bool* is_cv_qualifier)
9106 tree type_spec = NULL_TREE;
9109 cp_decl_spec ds = ds_last;
9111 /* Assume this type-specifier does not declare a new type. */
9112 if (declares_class_or_enum)
9113 *declares_class_or_enum = 0;
9114 /* And that it does not specify a cv-qualifier. */
9115 if (is_cv_qualifier)
9116 *is_cv_qualifier = false;
9117 /* Peek at the next token. */
9118 token = cp_lexer_peek_token (parser->lexer);
9120 /* If we're looking at a keyword, we can use that to guide the
9121 production we choose. */
9122 keyword = token->keyword;
9126 /* 'enum' [identifier] '{' introduces an enum-specifier;
9127 'enum' <anything else> introduces an elaborated-type-specifier. */
9128 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_OPEN_BRACE
9129 || (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_NAME
9130 && cp_lexer_peek_nth_token (parser->lexer, 3)->type
9133 type_spec = cp_parser_enum_specifier (parser);
9134 if (declares_class_or_enum)
9135 *declares_class_or_enum = 2;
9137 cp_parser_set_decl_spec_type (decl_specs,
9139 /*user_defined_p=*/true);
9143 goto elaborated_type_specifier;
9145 /* Any of these indicate either a class-specifier, or an
9146 elaborated-type-specifier. */
9150 /* Parse tentatively so that we can back up if we don't find a
9152 cp_parser_parse_tentatively (parser);
9153 /* Look for the class-specifier. */
9154 type_spec = cp_parser_class_specifier (parser);
9155 /* If that worked, we're done. */
9156 if (cp_parser_parse_definitely (parser))
9158 if (declares_class_or_enum)
9159 *declares_class_or_enum = 2;
9161 cp_parser_set_decl_spec_type (decl_specs,
9163 /*user_defined_p=*/true);
9168 elaborated_type_specifier:
9169 /* We're declaring (not defining) a class or enum. */
9170 if (declares_class_or_enum)
9171 *declares_class_or_enum = 1;
9175 /* Look for an elaborated-type-specifier. */
9177 = (cp_parser_elaborated_type_specifier
9179 decl_specs && decl_specs->specs[(int) ds_friend],
9182 cp_parser_set_decl_spec_type (decl_specs,
9184 /*user_defined_p=*/true);
9189 if (is_cv_qualifier)
9190 *is_cv_qualifier = true;
9195 if (is_cv_qualifier)
9196 *is_cv_qualifier = true;
9201 if (is_cv_qualifier)
9202 *is_cv_qualifier = true;
9206 /* The `__complex__' keyword is a GNU extension. */
9214 /* Handle simple keywords. */
9219 ++decl_specs->specs[(int)ds];
9220 decl_specs->any_specifiers_p = true;
9222 return cp_lexer_consume_token (parser->lexer)->value;
9225 /* If we do not already have a type-specifier, assume we are looking
9226 at a simple-type-specifier. */
9227 type_spec = cp_parser_simple_type_specifier (parser,
9231 /* If we didn't find a type-specifier, and a type-specifier was not
9232 optional in this context, issue an error message. */
9233 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9235 cp_parser_error (parser, "expected type specifier");
9236 return error_mark_node;
9242 /* Parse a simple-type-specifier.
9244 simple-type-specifier:
9245 :: [opt] nested-name-specifier [opt] type-name
9246 :: [opt] nested-name-specifier template template-id
9261 simple-type-specifier:
9262 __typeof__ unary-expression
9263 __typeof__ ( type-id )
9265 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9266 appropriately updated. */
9269 cp_parser_simple_type_specifier (cp_parser* parser,
9270 cp_decl_specifier_seq *decl_specs,
9271 cp_parser_flags flags)
9273 tree type = NULL_TREE;
9276 /* Peek at the next token. */
9277 token = cp_lexer_peek_token (parser->lexer);
9279 /* If we're looking at a keyword, things are easy. */
9280 switch (token->keyword)
9284 decl_specs->explicit_char_p = true;
9285 type = char_type_node;
9288 type = wchar_type_node;
9291 type = boolean_type_node;
9295 ++decl_specs->specs[(int) ds_short];
9296 type = short_integer_type_node;
9300 decl_specs->explicit_int_p = true;
9301 type = integer_type_node;
9305 ++decl_specs->specs[(int) ds_long];
9306 type = long_integer_type_node;
9310 ++decl_specs->specs[(int) ds_signed];
9311 type = integer_type_node;
9315 ++decl_specs->specs[(int) ds_unsigned];
9316 type = unsigned_type_node;
9319 type = float_type_node;
9322 type = double_type_node;
9325 type = void_type_node;
9329 /* Consume the `typeof' token. */
9330 cp_lexer_consume_token (parser->lexer);
9331 /* Parse the operand to `typeof'. */
9332 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9333 /* If it is not already a TYPE, take its type. */
9335 type = finish_typeof (type);
9338 cp_parser_set_decl_spec_type (decl_specs, type,
9339 /*user_defined_p=*/true);
9347 /* If the type-specifier was for a built-in type, we're done. */
9352 /* Record the type. */
9354 && (token->keyword != RID_SIGNED
9355 && token->keyword != RID_UNSIGNED
9356 && token->keyword != RID_SHORT
9357 && token->keyword != RID_LONG))
9358 cp_parser_set_decl_spec_type (decl_specs,
9360 /*user_defined=*/false);
9362 decl_specs->any_specifiers_p = true;
9364 /* Consume the token. */
9365 id = cp_lexer_consume_token (parser->lexer)->value;
9367 /* There is no valid C++ program where a non-template type is
9368 followed by a "<". That usually indicates that the user thought
9369 that the type was a template. */
9370 cp_parser_check_for_invalid_template_id (parser, type);
9372 return TYPE_NAME (type);
9375 /* The type-specifier must be a user-defined type. */
9376 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
9381 /* Don't gobble tokens or issue error messages if this is an
9382 optional type-specifier. */
9383 if (flags & CP_PARSER_FLAGS_OPTIONAL)
9384 cp_parser_parse_tentatively (parser);
9386 /* Look for the optional `::' operator. */
9388 = (cp_parser_global_scope_opt (parser,
9389 /*current_scope_valid_p=*/false)
9391 /* Look for the nested-name specifier. */
9393 = (cp_parser_nested_name_specifier_opt (parser,
9394 /*typename_keyword_p=*/false,
9395 /*check_dependency_p=*/true,
9397 /*is_declaration=*/false)
9399 /* If we have seen a nested-name-specifier, and the next token
9400 is `template', then we are using the template-id production. */
9402 && cp_parser_optional_template_keyword (parser))
9404 /* Look for the template-id. */
9405 type = cp_parser_template_id (parser,
9406 /*template_keyword_p=*/true,
9407 /*check_dependency_p=*/true,
9408 /*is_declaration=*/false);
9409 /* If the template-id did not name a type, we are out of
9411 if (TREE_CODE (type) != TYPE_DECL)
9413 cp_parser_error (parser, "expected template-id for type");
9417 /* Otherwise, look for a type-name. */
9419 type = cp_parser_type_name (parser);
9420 /* Keep track of all name-lookups performed in class scopes. */
9424 && TREE_CODE (type) == TYPE_DECL
9425 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
9426 maybe_note_name_used_in_class (DECL_NAME (type), type);
9427 /* If it didn't work out, we don't have a TYPE. */
9428 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
9429 && !cp_parser_parse_definitely (parser))
9431 if (type && decl_specs)
9432 cp_parser_set_decl_spec_type (decl_specs, type,
9433 /*user_defined=*/true);
9436 /* If we didn't get a type-name, issue an error message. */
9437 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9439 cp_parser_error (parser, "expected type-name");
9440 return error_mark_node;
9443 /* There is no valid C++ program where a non-template type is
9444 followed by a "<". That usually indicates that the user thought
9445 that the type was a template. */
9446 if (type && type != error_mark_node)
9447 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
9452 /* Parse a type-name.
9465 Returns a TYPE_DECL for the the type. */
9468 cp_parser_type_name (cp_parser* parser)
9473 /* We can't know yet whether it is a class-name or not. */
9474 cp_parser_parse_tentatively (parser);
9475 /* Try a class-name. */
9476 type_decl = cp_parser_class_name (parser,
9477 /*typename_keyword_p=*/false,
9478 /*template_keyword_p=*/false,
9480 /*check_dependency_p=*/true,
9481 /*class_head_p=*/false,
9482 /*is_declaration=*/false);
9483 /* If it's not a class-name, keep looking. */
9484 if (!cp_parser_parse_definitely (parser))
9486 /* It must be a typedef-name or an enum-name. */
9487 identifier = cp_parser_identifier (parser);
9488 if (identifier == error_mark_node)
9489 return error_mark_node;
9491 /* Look up the type-name. */
9492 type_decl = cp_parser_lookup_name_simple (parser, identifier);
9493 /* Issue an error if we did not find a type-name. */
9494 if (TREE_CODE (type_decl) != TYPE_DECL)
9496 if (!cp_parser_simulate_error (parser))
9497 cp_parser_name_lookup_error (parser, identifier, type_decl,
9499 type_decl = error_mark_node;
9501 /* Remember that the name was used in the definition of the
9502 current class so that we can check later to see if the
9503 meaning would have been different after the class was
9504 entirely defined. */
9505 else if (type_decl != error_mark_node
9507 maybe_note_name_used_in_class (identifier, type_decl);
9514 /* Parse an elaborated-type-specifier. Note that the grammar given
9515 here incorporates the resolution to DR68.
9517 elaborated-type-specifier:
9518 class-key :: [opt] nested-name-specifier [opt] identifier
9519 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9520 enum :: [opt] nested-name-specifier [opt] identifier
9521 typename :: [opt] nested-name-specifier identifier
9522 typename :: [opt] nested-name-specifier template [opt]
9527 elaborated-type-specifier:
9528 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9529 class-key attributes :: [opt] nested-name-specifier [opt]
9530 template [opt] template-id
9531 enum attributes :: [opt] nested-name-specifier [opt] identifier
9533 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
9534 declared `friend'. If IS_DECLARATION is TRUE, then this
9535 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
9536 something is being declared.
9538 Returns the TYPE specified. */
9541 cp_parser_elaborated_type_specifier (cp_parser* parser,
9543 bool is_declaration)
9545 enum tag_types tag_type;
9547 tree type = NULL_TREE;
9548 tree attributes = NULL_TREE;
9550 /* See if we're looking at the `enum' keyword. */
9551 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
9553 /* Consume the `enum' token. */
9554 cp_lexer_consume_token (parser->lexer);
9555 /* Remember that it's an enumeration type. */
9556 tag_type = enum_type;
9557 /* Parse the attributes. */
9558 attributes = cp_parser_attributes_opt (parser);
9560 /* Or, it might be `typename'. */
9561 else if (cp_lexer_next_token_is_keyword (parser->lexer,
9564 /* Consume the `typename' token. */
9565 cp_lexer_consume_token (parser->lexer);
9566 /* Remember that it's a `typename' type. */
9567 tag_type = typename_type;
9568 /* The `typename' keyword is only allowed in templates. */
9569 if (!processing_template_decl)
9570 pedwarn ("using %<typename%> outside of template");
9572 /* Otherwise it must be a class-key. */
9575 tag_type = cp_parser_class_key (parser);
9576 if (tag_type == none_type)
9577 return error_mark_node;
9578 /* Parse the attributes. */
9579 attributes = cp_parser_attributes_opt (parser);
9582 /* Look for the `::' operator. */
9583 cp_parser_global_scope_opt (parser,
9584 /*current_scope_valid_p=*/false);
9585 /* Look for the nested-name-specifier. */
9586 if (tag_type == typename_type)
9588 if (cp_parser_nested_name_specifier (parser,
9589 /*typename_keyword_p=*/true,
9590 /*check_dependency_p=*/true,
9594 return error_mark_node;
9597 /* Even though `typename' is not present, the proposed resolution
9598 to Core Issue 180 says that in `class A<T>::B', `B' should be
9599 considered a type-name, even if `A<T>' is dependent. */
9600 cp_parser_nested_name_specifier_opt (parser,
9601 /*typename_keyword_p=*/true,
9602 /*check_dependency_p=*/true,
9605 /* For everything but enumeration types, consider a template-id. */
9606 if (tag_type != enum_type)
9608 bool template_p = false;
9611 /* Allow the `template' keyword. */
9612 template_p = cp_parser_optional_template_keyword (parser);
9613 /* If we didn't see `template', we don't know if there's a
9614 template-id or not. */
9616 cp_parser_parse_tentatively (parser);
9617 /* Parse the template-id. */
9618 decl = cp_parser_template_id (parser, template_p,
9619 /*check_dependency_p=*/true,
9621 /* If we didn't find a template-id, look for an ordinary
9623 if (!template_p && !cp_parser_parse_definitely (parser))
9625 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
9626 in effect, then we must assume that, upon instantiation, the
9627 template will correspond to a class. */
9628 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
9629 && tag_type == typename_type)
9630 type = make_typename_type (parser->scope, decl,
9634 type = TREE_TYPE (decl);
9637 /* For an enumeration type, consider only a plain identifier. */
9640 identifier = cp_parser_identifier (parser);
9642 if (identifier == error_mark_node)
9644 parser->scope = NULL_TREE;
9645 return error_mark_node;
9648 /* For a `typename', we needn't call xref_tag. */
9649 if (tag_type == typename_type)
9650 return cp_parser_make_typename_type (parser, parser->scope,
9652 /* Look up a qualified name in the usual way. */
9657 /* In an elaborated-type-specifier, names are assumed to name
9658 types, so we set IS_TYPE to TRUE when calling
9659 cp_parser_lookup_name. */
9660 decl = cp_parser_lookup_name (parser, identifier,
9662 /*is_template=*/false,
9663 /*is_namespace=*/false,
9664 /*check_dependency=*/true,
9665 /*ambiguous_p=*/NULL);
9667 /* If we are parsing friend declaration, DECL may be a
9668 TEMPLATE_DECL tree node here. However, we need to check
9669 whether this TEMPLATE_DECL results in valid code. Consider
9670 the following example:
9673 template <class T> class C {};
9676 template <class T> friend class N::C; // #1, valid code
9678 template <class T> class Y {
9679 friend class N::C; // #2, invalid code
9682 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
9683 name lookup of `N::C'. We see that friend declaration must
9684 be template for the code to be valid. Note that
9685 processing_template_decl does not work here since it is
9686 always 1 for the above two cases. */
9688 decl = (cp_parser_maybe_treat_template_as_class
9689 (decl, /*tag_name_p=*/is_friend
9690 && parser->num_template_parameter_lists));
9692 if (TREE_CODE (decl) != TYPE_DECL)
9694 error ("expected type-name");
9695 return error_mark_node;
9698 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
9699 check_elaborated_type_specifier
9701 (parser->num_template_parameter_lists
9702 || DECL_SELF_REFERENCE_P (decl)));
9704 type = TREE_TYPE (decl);
9708 /* An elaborated-type-specifier sometimes introduces a new type and
9709 sometimes names an existing type. Normally, the rule is that it
9710 introduces a new type only if there is not an existing type of
9711 the same name already in scope. For example, given:
9714 void f() { struct S s; }
9716 the `struct S' in the body of `f' is the same `struct S' as in
9717 the global scope; the existing definition is used. However, if
9718 there were no global declaration, this would introduce a new
9719 local class named `S'.
9721 An exception to this rule applies to the following code:
9723 namespace N { struct S; }
9725 Here, the elaborated-type-specifier names a new type
9726 unconditionally; even if there is already an `S' in the
9727 containing scope this declaration names a new type.
9728 This exception only applies if the elaborated-type-specifier
9729 forms the complete declaration:
9733 A declaration consisting solely of `class-key identifier ;' is
9734 either a redeclaration of the name in the current scope or a
9735 forward declaration of the identifier as a class name. It
9736 introduces the name into the current scope.
9738 We are in this situation precisely when the next token is a `;'.
9740 An exception to the exception is that a `friend' declaration does
9741 *not* name a new type; i.e., given:
9743 struct S { friend struct T; };
9745 `T' is not a new type in the scope of `S'.
9747 Also, `new struct S' or `sizeof (struct S)' never results in the
9748 definition of a new type; a new type can only be declared in a
9749 declaration context. */
9753 /* Friends have special name lookup rules. */
9754 ts = ts_within_enclosing_non_class;
9755 else if (is_declaration
9756 && cp_lexer_next_token_is (parser->lexer,
9758 /* This is a `class-key identifier ;' */
9763 /* Warn about attributes. They are ignored. */
9765 warning ("type attributes are honored only at type definition");
9767 type = xref_tag (tag_type, identifier, ts,
9768 parser->num_template_parameter_lists);
9771 if (tag_type != enum_type)
9772 cp_parser_check_class_key (tag_type, type);
9774 /* A "<" cannot follow an elaborated type specifier. If that
9775 happens, the user was probably trying to form a template-id. */
9776 cp_parser_check_for_invalid_template_id (parser, type);
9781 /* Parse an enum-specifier.
9784 enum identifier [opt] { enumerator-list [opt] }
9787 enum identifier [opt] { enumerator-list [opt] } attributes
9789 Returns an ENUM_TYPE representing the enumeration. */
9792 cp_parser_enum_specifier (cp_parser* parser)
9797 /* Caller guarantees that the current token is 'enum', an identifier
9798 possibly follows, and the token after that is an opening brace.
9799 If we don't have an identifier, fabricate an anonymous name for
9800 the enumeration being defined. */
9801 cp_lexer_consume_token (parser->lexer);
9803 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9804 identifier = cp_parser_identifier (parser);
9806 identifier = make_anon_name ();
9808 /* Issue an error message if type-definitions are forbidden here. */
9809 cp_parser_check_type_definition (parser);
9811 /* Create the new type. We do this before consuming the opening brace
9812 so the enum will be recorded as being on the line of its tag (or the
9813 'enum' keyword, if there is no tag). */
9814 type = start_enum (identifier);
9816 /* Consume the opening brace. */
9817 cp_lexer_consume_token (parser->lexer);
9819 /* If the next token is not '}', then there are some enumerators. */
9820 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
9821 cp_parser_enumerator_list (parser, type);
9823 /* Consume the final '}'. */
9824 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
9826 /* Look for trailing attributes to apply to this enumeration, and
9827 apply them if appropriate. */
9828 if (cp_parser_allow_gnu_extensions_p (parser))
9830 tree trailing_attr = cp_parser_attributes_opt (parser);
9831 cplus_decl_attributes (&type,
9833 (int) ATTR_FLAG_TYPE_IN_PLACE);
9836 /* Finish up the enumeration. */
9842 /* Parse an enumerator-list. The enumerators all have the indicated
9846 enumerator-definition
9847 enumerator-list , enumerator-definition */
9850 cp_parser_enumerator_list (cp_parser* parser, tree type)
9854 /* Parse an enumerator-definition. */
9855 cp_parser_enumerator_definition (parser, type);
9857 /* If the next token is not a ',', we've reached the end of
9859 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9861 /* Otherwise, consume the `,' and keep going. */
9862 cp_lexer_consume_token (parser->lexer);
9863 /* If the next token is a `}', there is a trailing comma. */
9864 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
9866 if (pedantic && !in_system_header)
9867 pedwarn ("comma at end of enumerator list");
9873 /* Parse an enumerator-definition. The enumerator has the indicated
9876 enumerator-definition:
9878 enumerator = constant-expression
9884 cp_parser_enumerator_definition (cp_parser* parser, tree type)
9889 /* Look for the identifier. */
9890 identifier = cp_parser_identifier (parser);
9891 if (identifier == error_mark_node)
9894 /* If the next token is an '=', then there is an explicit value. */
9895 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9897 /* Consume the `=' token. */
9898 cp_lexer_consume_token (parser->lexer);
9899 /* Parse the value. */
9900 value = cp_parser_constant_expression (parser,
9901 /*allow_non_constant_p=*/false,
9907 /* Create the enumerator. */
9908 build_enumerator (identifier, value, type);
9911 /* Parse a namespace-name.
9914 original-namespace-name
9917 Returns the NAMESPACE_DECL for the namespace. */
9920 cp_parser_namespace_name (cp_parser* parser)
9923 tree namespace_decl;
9925 /* Get the name of the namespace. */
9926 identifier = cp_parser_identifier (parser);
9927 if (identifier == error_mark_node)
9928 return error_mark_node;
9930 /* Look up the identifier in the currently active scope. Look only
9931 for namespaces, due to:
9935 When looking up a namespace-name in a using-directive or alias
9936 definition, only namespace names are considered.
9942 During the lookup of a name preceding the :: scope resolution
9943 operator, object, function, and enumerator names are ignored.
9945 (Note that cp_parser_class_or_namespace_name only calls this
9946 function if the token after the name is the scope resolution
9948 namespace_decl = cp_parser_lookup_name (parser, identifier,
9950 /*is_template=*/false,
9951 /*is_namespace=*/true,
9952 /*check_dependency=*/true,
9953 /*ambiguous_p=*/NULL);
9954 /* If it's not a namespace, issue an error. */
9955 if (namespace_decl == error_mark_node
9956 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
9958 cp_parser_error (parser, "expected namespace-name");
9959 namespace_decl = error_mark_node;
9962 return namespace_decl;
9965 /* Parse a namespace-definition.
9967 namespace-definition:
9968 named-namespace-definition
9969 unnamed-namespace-definition
9971 named-namespace-definition:
9972 original-namespace-definition
9973 extension-namespace-definition
9975 original-namespace-definition:
9976 namespace identifier { namespace-body }
9978 extension-namespace-definition:
9979 namespace original-namespace-name { namespace-body }
9981 unnamed-namespace-definition:
9982 namespace { namespace-body } */
9985 cp_parser_namespace_definition (cp_parser* parser)
9989 /* Look for the `namespace' keyword. */
9990 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
9992 /* Get the name of the namespace. We do not attempt to distinguish
9993 between an original-namespace-definition and an
9994 extension-namespace-definition at this point. The semantic
9995 analysis routines are responsible for that. */
9996 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9997 identifier = cp_parser_identifier (parser);
9999 identifier = NULL_TREE;
10001 /* Look for the `{' to start the namespace. */
10002 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10003 /* Start the namespace. */
10004 push_namespace (identifier);
10005 /* Parse the body of the namespace. */
10006 cp_parser_namespace_body (parser);
10007 /* Finish the namespace. */
10009 /* Look for the final `}'. */
10010 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10013 /* Parse a namespace-body.
10016 declaration-seq [opt] */
10019 cp_parser_namespace_body (cp_parser* parser)
10021 cp_parser_declaration_seq_opt (parser);
10024 /* Parse a namespace-alias-definition.
10026 namespace-alias-definition:
10027 namespace identifier = qualified-namespace-specifier ; */
10030 cp_parser_namespace_alias_definition (cp_parser* parser)
10033 tree namespace_specifier;
10035 /* Look for the `namespace' keyword. */
10036 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10037 /* Look for the identifier. */
10038 identifier = cp_parser_identifier (parser);
10039 if (identifier == error_mark_node)
10041 /* Look for the `=' token. */
10042 cp_parser_require (parser, CPP_EQ, "`='");
10043 /* Look for the qualified-namespace-specifier. */
10044 namespace_specifier
10045 = cp_parser_qualified_namespace_specifier (parser);
10046 /* Look for the `;' token. */
10047 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10049 /* Register the alias in the symbol table. */
10050 do_namespace_alias (identifier, namespace_specifier);
10053 /* Parse a qualified-namespace-specifier.
10055 qualified-namespace-specifier:
10056 :: [opt] nested-name-specifier [opt] namespace-name
10058 Returns a NAMESPACE_DECL corresponding to the specified
10062 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10064 /* Look for the optional `::'. */
10065 cp_parser_global_scope_opt (parser,
10066 /*current_scope_valid_p=*/false);
10068 /* Look for the optional nested-name-specifier. */
10069 cp_parser_nested_name_specifier_opt (parser,
10070 /*typename_keyword_p=*/false,
10071 /*check_dependency_p=*/true,
10073 /*is_declaration=*/true);
10075 return cp_parser_namespace_name (parser);
10078 /* Parse a using-declaration.
10081 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10082 using :: unqualified-id ; */
10085 cp_parser_using_declaration (cp_parser* parser)
10088 bool typename_p = false;
10089 bool global_scope_p;
10094 /* Look for the `using' keyword. */
10095 cp_parser_require_keyword (parser, RID_USING, "`using'");
10097 /* Peek at the next token. */
10098 token = cp_lexer_peek_token (parser->lexer);
10099 /* See if it's `typename'. */
10100 if (token->keyword == RID_TYPENAME)
10102 /* Remember that we've seen it. */
10104 /* Consume the `typename' token. */
10105 cp_lexer_consume_token (parser->lexer);
10108 /* Look for the optional global scope qualification. */
10110 = (cp_parser_global_scope_opt (parser,
10111 /*current_scope_valid_p=*/false)
10114 /* If we saw `typename', or didn't see `::', then there must be a
10115 nested-name-specifier present. */
10116 if (typename_p || !global_scope_p)
10117 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10118 /*check_dependency_p=*/true,
10120 /*is_declaration=*/true);
10121 /* Otherwise, we could be in either of the two productions. In that
10122 case, treat the nested-name-specifier as optional. */
10124 qscope = cp_parser_nested_name_specifier_opt (parser,
10125 /*typename_keyword_p=*/false,
10126 /*check_dependency_p=*/true,
10128 /*is_declaration=*/true);
10130 qscope = global_namespace;
10132 /* Parse the unqualified-id. */
10133 identifier = cp_parser_unqualified_id (parser,
10134 /*template_keyword_p=*/false,
10135 /*check_dependency_p=*/true,
10136 /*declarator_p=*/true);
10138 /* The function we call to handle a using-declaration is different
10139 depending on what scope we are in. */
10140 if (identifier == error_mark_node)
10142 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10143 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10144 /* [namespace.udecl]
10146 A using declaration shall not name a template-id. */
10147 error ("a template-id may not appear in a using-declaration");
10150 if (at_class_scope_p ())
10152 /* Create the USING_DECL. */
10153 decl = do_class_using_decl (build_nt (SCOPE_REF,
10156 /* Add it to the list of members in this class. */
10157 finish_member_declaration (decl);
10161 decl = cp_parser_lookup_name_simple (parser, identifier);
10162 if (decl == error_mark_node)
10163 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10164 else if (!at_namespace_scope_p ())
10165 do_local_using_decl (decl, qscope, identifier);
10167 do_toplevel_using_decl (decl, qscope, identifier);
10171 /* Look for the final `;'. */
10172 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10175 /* Parse a using-directive.
10178 using namespace :: [opt] nested-name-specifier [opt]
10179 namespace-name ; */
10182 cp_parser_using_directive (cp_parser* parser)
10184 tree namespace_decl;
10187 /* Look for the `using' keyword. */
10188 cp_parser_require_keyword (parser, RID_USING, "`using'");
10189 /* And the `namespace' keyword. */
10190 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10191 /* Look for the optional `::' operator. */
10192 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10193 /* And the optional nested-name-specifier. */
10194 cp_parser_nested_name_specifier_opt (parser,
10195 /*typename_keyword_p=*/false,
10196 /*check_dependency_p=*/true,
10198 /*is_declaration=*/true);
10199 /* Get the namespace being used. */
10200 namespace_decl = cp_parser_namespace_name (parser);
10201 /* And any specified attributes. */
10202 attribs = cp_parser_attributes_opt (parser);
10203 /* Update the symbol table. */
10204 parse_using_directive (namespace_decl, attribs);
10205 /* Look for the final `;'. */
10206 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10209 /* Parse an asm-definition.
10212 asm ( string-literal ) ;
10217 asm volatile [opt] ( string-literal ) ;
10218 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10219 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10220 : asm-operand-list [opt] ) ;
10221 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10222 : asm-operand-list [opt]
10223 : asm-operand-list [opt] ) ; */
10226 cp_parser_asm_definition (cp_parser* parser)
10229 tree outputs = NULL_TREE;
10230 tree inputs = NULL_TREE;
10231 tree clobbers = NULL_TREE;
10233 bool volatile_p = false;
10234 bool extended_p = false;
10236 /* Look for the `asm' keyword. */
10237 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
10238 /* See if the next token is `volatile'. */
10239 if (cp_parser_allow_gnu_extensions_p (parser)
10240 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
10242 /* Remember that we saw the `volatile' keyword. */
10244 /* Consume the token. */
10245 cp_lexer_consume_token (parser->lexer);
10247 /* Look for the opening `('. */
10248 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
10250 /* Look for the string. */
10251 string = cp_parser_string_literal (parser, false, false);
10252 if (string == error_mark_node)
10254 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10255 /*consume_paren=*/true);
10259 /* If we're allowing GNU extensions, check for the extended assembly
10260 syntax. Unfortunately, the `:' tokens need not be separated by
10261 a space in C, and so, for compatibility, we tolerate that here
10262 too. Doing that means that we have to treat the `::' operator as
10264 if (cp_parser_allow_gnu_extensions_p (parser)
10265 && at_function_scope_p ()
10266 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
10267 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
10269 bool inputs_p = false;
10270 bool clobbers_p = false;
10272 /* The extended syntax was used. */
10275 /* Look for outputs. */
10276 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10278 /* Consume the `:'. */
10279 cp_lexer_consume_token (parser->lexer);
10280 /* Parse the output-operands. */
10281 if (cp_lexer_next_token_is_not (parser->lexer,
10283 && cp_lexer_next_token_is_not (parser->lexer,
10285 && cp_lexer_next_token_is_not (parser->lexer,
10287 outputs = cp_parser_asm_operand_list (parser);
10289 /* If the next token is `::', there are no outputs, and the
10290 next token is the beginning of the inputs. */
10291 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10292 /* The inputs are coming next. */
10295 /* Look for inputs. */
10297 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10299 /* Consume the `:' or `::'. */
10300 cp_lexer_consume_token (parser->lexer);
10301 /* Parse the output-operands. */
10302 if (cp_lexer_next_token_is_not (parser->lexer,
10304 && cp_lexer_next_token_is_not (parser->lexer,
10306 inputs = cp_parser_asm_operand_list (parser);
10308 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10309 /* The clobbers are coming next. */
10312 /* Look for clobbers. */
10314 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10316 /* Consume the `:' or `::'. */
10317 cp_lexer_consume_token (parser->lexer);
10318 /* Parse the clobbers. */
10319 if (cp_lexer_next_token_is_not (parser->lexer,
10321 clobbers = cp_parser_asm_clobber_list (parser);
10324 /* Look for the closing `)'. */
10325 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10326 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10327 /*consume_paren=*/true);
10328 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10330 /* Create the ASM_EXPR. */
10331 if (at_function_scope_p ())
10333 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
10335 /* If the extended syntax was not used, mark the ASM_EXPR. */
10338 tree temp = asm_stmt;
10339 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
10340 temp = TREE_OPERAND (temp, 0);
10342 ASM_INPUT_P (temp) = 1;
10346 assemble_asm (string);
10349 /* Declarators [gram.dcl.decl] */
10351 /* Parse an init-declarator.
10354 declarator initializer [opt]
10359 declarator asm-specification [opt] attributes [opt] initializer [opt]
10361 function-definition:
10362 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10364 decl-specifier-seq [opt] declarator function-try-block
10368 function-definition:
10369 __extension__ function-definition
10371 The DECL_SPECIFIERS and PREFIX_ATTRIBUTES apply to this declarator.
10372 Returns a representation of the entity declared. If MEMBER_P is TRUE,
10373 then this declarator appears in a class scope. The new DECL created
10374 by this declarator is returned.
10376 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10377 for a function-definition here as well. If the declarator is a
10378 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10379 be TRUE upon return. By that point, the function-definition will
10380 have been completely parsed.
10382 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10386 cp_parser_init_declarator (cp_parser* parser,
10387 cp_decl_specifier_seq *decl_specifiers,
10388 bool function_definition_allowed_p,
10390 int declares_class_or_enum,
10391 bool* function_definition_p)
10394 cp_declarator *declarator;
10395 tree prefix_attributes;
10397 tree asm_specification;
10399 tree decl = NULL_TREE;
10401 bool is_initialized;
10402 bool is_parenthesized_init;
10403 bool is_non_constant_init;
10404 int ctor_dtor_or_conv_p;
10406 bool pop_p = false;
10408 /* Gather the attributes that were provided with the
10409 decl-specifiers. */
10410 prefix_attributes = decl_specifiers->attributes;
10412 /* Assume that this is not the declarator for a function
10414 if (function_definition_p)
10415 *function_definition_p = false;
10417 /* Defer access checks while parsing the declarator; we cannot know
10418 what names are accessible until we know what is being
10420 resume_deferring_access_checks ();
10422 /* Parse the declarator. */
10424 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10425 &ctor_dtor_or_conv_p,
10426 /*parenthesized_p=*/NULL,
10427 /*member_p=*/false);
10428 /* Gather up the deferred checks. */
10429 stop_deferring_access_checks ();
10431 /* If the DECLARATOR was erroneous, there's no need to go
10433 if (declarator == cp_error_declarator)
10434 return error_mark_node;
10436 if (declares_class_or_enum & 2)
10437 cp_parser_check_for_definition_in_return_type (declarator,
10438 decl_specifiers->type);
10440 /* Figure out what scope the entity declared by the DECLARATOR is
10441 located in. `grokdeclarator' sometimes changes the scope, so
10442 we compute it now. */
10443 scope = get_scope_of_declarator (declarator);
10445 /* If we're allowing GNU extensions, look for an asm-specification
10447 if (cp_parser_allow_gnu_extensions_p (parser))
10449 /* Look for an asm-specification. */
10450 asm_specification = cp_parser_asm_specification_opt (parser);
10451 /* And attributes. */
10452 attributes = cp_parser_attributes_opt (parser);
10456 asm_specification = NULL_TREE;
10457 attributes = NULL_TREE;
10460 /* Peek at the next token. */
10461 token = cp_lexer_peek_token (parser->lexer);
10462 /* Check to see if the token indicates the start of a
10463 function-definition. */
10464 if (cp_parser_token_starts_function_definition_p (token))
10466 if (!function_definition_allowed_p)
10468 /* If a function-definition should not appear here, issue an
10470 cp_parser_error (parser,
10471 "a function-definition is not allowed here");
10472 return error_mark_node;
10476 /* Neither attributes nor an asm-specification are allowed
10477 on a function-definition. */
10478 if (asm_specification)
10479 error ("an asm-specification is not allowed on a function-definition");
10481 error ("attributes are not allowed on a function-definition");
10482 /* This is a function-definition. */
10483 *function_definition_p = true;
10485 /* Parse the function definition. */
10487 decl = cp_parser_save_member_function_body (parser,
10490 prefix_attributes);
10493 = (cp_parser_function_definition_from_specifiers_and_declarator
10494 (parser, decl_specifiers, prefix_attributes, declarator));
10502 Only in function declarations for constructors, destructors, and
10503 type conversions can the decl-specifier-seq be omitted.
10505 We explicitly postpone this check past the point where we handle
10506 function-definitions because we tolerate function-definitions
10507 that are missing their return types in some modes. */
10508 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
10510 cp_parser_error (parser,
10511 "expected constructor, destructor, or type conversion");
10512 return error_mark_node;
10515 /* An `=' or an `(' indicates an initializer. */
10516 is_initialized = (token->type == CPP_EQ
10517 || token->type == CPP_OPEN_PAREN);
10518 /* If the init-declarator isn't initialized and isn't followed by a
10519 `,' or `;', it's not a valid init-declarator. */
10520 if (!is_initialized
10521 && token->type != CPP_COMMA
10522 && token->type != CPP_SEMICOLON)
10524 cp_parser_error (parser, "expected initializer");
10525 return error_mark_node;
10528 /* Because start_decl has side-effects, we should only call it if we
10529 know we're going ahead. By this point, we know that we cannot
10530 possibly be looking at any other construct. */
10531 cp_parser_commit_to_tentative_parse (parser);
10533 /* If the decl specifiers were bad, issue an error now that we're
10534 sure this was intended to be a declarator. Then continue
10535 declaring the variable(s), as int, to try to cut down on further
10537 if (decl_specifiers->any_specifiers_p
10538 && decl_specifiers->type == error_mark_node)
10540 cp_parser_error (parser, "invalid type in declaration");
10541 decl_specifiers->type = integer_type_node;
10544 /* Check to see whether or not this declaration is a friend. */
10545 friend_p = cp_parser_friend_p (decl_specifiers);
10547 /* Check that the number of template-parameter-lists is OK. */
10548 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
10549 return error_mark_node;
10551 /* Enter the newly declared entry in the symbol table. If we're
10552 processing a declaration in a class-specifier, we wait until
10553 after processing the initializer. */
10556 if (parser->in_unbraced_linkage_specification_p)
10558 decl_specifiers->storage_class = sc_extern;
10559 have_extern_spec = false;
10561 decl = start_decl (declarator, decl_specifiers,
10562 is_initialized, attributes, prefix_attributes,
10566 /* Enter the SCOPE. That way unqualified names appearing in the
10567 initializer will be looked up in SCOPE. */
10568 pop_p = push_scope (scope);
10570 /* Perform deferred access control checks, now that we know in which
10571 SCOPE the declared entity resides. */
10572 if (!member_p && decl)
10574 tree saved_current_function_decl = NULL_TREE;
10576 /* If the entity being declared is a function, pretend that we
10577 are in its scope. If it is a `friend', it may have access to
10578 things that would not otherwise be accessible. */
10579 if (TREE_CODE (decl) == FUNCTION_DECL)
10581 saved_current_function_decl = current_function_decl;
10582 current_function_decl = decl;
10585 /* Perform the access control checks for the declarator and the
10586 the decl-specifiers. */
10587 perform_deferred_access_checks ();
10589 /* Restore the saved value. */
10590 if (TREE_CODE (decl) == FUNCTION_DECL)
10591 current_function_decl = saved_current_function_decl;
10594 /* Parse the initializer. */
10595 if (is_initialized)
10596 initializer = cp_parser_initializer (parser,
10597 &is_parenthesized_init,
10598 &is_non_constant_init);
10601 initializer = NULL_TREE;
10602 is_parenthesized_init = false;
10603 is_non_constant_init = true;
10606 /* The old parser allows attributes to appear after a parenthesized
10607 initializer. Mark Mitchell proposed removing this functionality
10608 on the GCC mailing lists on 2002-08-13. This parser accepts the
10609 attributes -- but ignores them. */
10610 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
10611 if (cp_parser_attributes_opt (parser))
10612 warning ("attributes after parenthesized initializer ignored");
10614 /* For an in-class declaration, use `grokfield' to create the
10623 decl = grokfield (declarator, decl_specifiers,
10624 initializer, /*asmspec=*/NULL_TREE,
10625 /*attributes=*/NULL_TREE);
10626 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
10627 cp_parser_save_default_args (parser, decl);
10630 /* Finish processing the declaration. But, skip friend
10632 if (!friend_p && decl && decl != error_mark_node)
10634 cp_finish_decl (decl,
10637 /* If the initializer is in parentheses, then this is
10638 a direct-initialization, which means that an
10639 `explicit' constructor is OK. Otherwise, an
10640 `explicit' constructor cannot be used. */
10641 ((is_parenthesized_init || !is_initialized)
10642 ? 0 : LOOKUP_ONLYCONVERTING));
10644 pop_scope (DECL_CONTEXT (decl));
10647 /* Remember whether or not variables were initialized by
10648 constant-expressions. */
10649 if (decl && TREE_CODE (decl) == VAR_DECL
10650 && is_initialized && !is_non_constant_init)
10651 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10656 /* Parse a declarator.
10660 ptr-operator declarator
10662 abstract-declarator:
10663 ptr-operator abstract-declarator [opt]
10664 direct-abstract-declarator
10669 attributes [opt] direct-declarator
10670 attributes [opt] ptr-operator declarator
10672 abstract-declarator:
10673 attributes [opt] ptr-operator abstract-declarator [opt]
10674 attributes [opt] direct-abstract-declarator
10676 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
10677 detect constructor, destructor or conversion operators. It is set
10678 to -1 if the declarator is a name, and +1 if it is a
10679 function. Otherwise it is set to zero. Usually you just want to
10680 test for >0, but internally the negative value is used.
10682 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
10683 a decl-specifier-seq unless it declares a constructor, destructor,
10684 or conversion. It might seem that we could check this condition in
10685 semantic analysis, rather than parsing, but that makes it difficult
10686 to handle something like `f()'. We want to notice that there are
10687 no decl-specifiers, and therefore realize that this is an
10688 expression, not a declaration.)
10690 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
10691 the declarator is a direct-declarator of the form "(...)".
10693 MEMBER_P is true iff this declarator is a member-declarator. */
10695 static cp_declarator *
10696 cp_parser_declarator (cp_parser* parser,
10697 cp_parser_declarator_kind dcl_kind,
10698 int* ctor_dtor_or_conv_p,
10699 bool* parenthesized_p,
10703 cp_declarator *declarator;
10704 enum tree_code code;
10705 cp_cv_quals cv_quals;
10707 tree attributes = NULL_TREE;
10709 /* Assume this is not a constructor, destructor, or type-conversion
10711 if (ctor_dtor_or_conv_p)
10712 *ctor_dtor_or_conv_p = 0;
10714 if (cp_parser_allow_gnu_extensions_p (parser))
10715 attributes = cp_parser_attributes_opt (parser);
10717 /* Peek at the next token. */
10718 token = cp_lexer_peek_token (parser->lexer);
10720 /* Check for the ptr-operator production. */
10721 cp_parser_parse_tentatively (parser);
10722 /* Parse the ptr-operator. */
10723 code = cp_parser_ptr_operator (parser,
10726 /* If that worked, then we have a ptr-operator. */
10727 if (cp_parser_parse_definitely (parser))
10729 /* If a ptr-operator was found, then this declarator was not
10731 if (parenthesized_p)
10732 *parenthesized_p = true;
10733 /* The dependent declarator is optional if we are parsing an
10734 abstract-declarator. */
10735 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10736 cp_parser_parse_tentatively (parser);
10738 /* Parse the dependent declarator. */
10739 declarator = cp_parser_declarator (parser, dcl_kind,
10740 /*ctor_dtor_or_conv_p=*/NULL,
10741 /*parenthesized_p=*/NULL,
10742 /*member_p=*/false);
10744 /* If we are parsing an abstract-declarator, we must handle the
10745 case where the dependent declarator is absent. */
10746 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
10747 && !cp_parser_parse_definitely (parser))
10750 /* Build the representation of the ptr-operator. */
10752 declarator = make_ptrmem_declarator (cv_quals,
10755 else if (code == INDIRECT_REF)
10756 declarator = make_pointer_declarator (cv_quals, declarator);
10758 declarator = make_reference_declarator (cv_quals, declarator);
10760 /* Everything else is a direct-declarator. */
10763 if (parenthesized_p)
10764 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
10766 declarator = cp_parser_direct_declarator (parser, dcl_kind,
10767 ctor_dtor_or_conv_p,
10771 if (attributes && declarator != cp_error_declarator)
10772 declarator->attributes = attributes;
10777 /* Parse a direct-declarator or direct-abstract-declarator.
10781 direct-declarator ( parameter-declaration-clause )
10782 cv-qualifier-seq [opt]
10783 exception-specification [opt]
10784 direct-declarator [ constant-expression [opt] ]
10787 direct-abstract-declarator:
10788 direct-abstract-declarator [opt]
10789 ( parameter-declaration-clause )
10790 cv-qualifier-seq [opt]
10791 exception-specification [opt]
10792 direct-abstract-declarator [opt] [ constant-expression [opt] ]
10793 ( abstract-declarator )
10795 Returns a representation of the declarator. DCL_KIND is
10796 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
10797 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
10798 we are parsing a direct-declarator. It is
10799 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
10800 of ambiguity we prefer an abstract declarator, as per
10801 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
10802 cp_parser_declarator. */
10804 static cp_declarator *
10805 cp_parser_direct_declarator (cp_parser* parser,
10806 cp_parser_declarator_kind dcl_kind,
10807 int* ctor_dtor_or_conv_p,
10811 cp_declarator *declarator = NULL;
10812 tree scope = NULL_TREE;
10813 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
10814 bool saved_in_declarator_p = parser->in_declarator_p;
10816 bool pop_p = false;
10820 /* Peek at the next token. */
10821 token = cp_lexer_peek_token (parser->lexer);
10822 if (token->type == CPP_OPEN_PAREN)
10824 /* This is either a parameter-declaration-clause, or a
10825 parenthesized declarator. When we know we are parsing a
10826 named declarator, it must be a parenthesized declarator
10827 if FIRST is true. For instance, `(int)' is a
10828 parameter-declaration-clause, with an omitted
10829 direct-abstract-declarator. But `((*))', is a
10830 parenthesized abstract declarator. Finally, when T is a
10831 template parameter `(T)' is a
10832 parameter-declaration-clause, and not a parenthesized
10835 We first try and parse a parameter-declaration-clause,
10836 and then try a nested declarator (if FIRST is true).
10838 It is not an error for it not to be a
10839 parameter-declaration-clause, even when FIRST is
10845 The first is the declaration of a function while the
10846 second is a the definition of a variable, including its
10849 Having seen only the parenthesis, we cannot know which of
10850 these two alternatives should be selected. Even more
10851 complex are examples like:
10856 The former is a function-declaration; the latter is a
10857 variable initialization.
10859 Thus again, we try a parameter-declaration-clause, and if
10860 that fails, we back out and return. */
10862 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10864 cp_parameter_declarator *params;
10865 unsigned saved_num_template_parameter_lists;
10867 /* In a member-declarator, the only valid interpretation
10868 of a parenthesis is the start of a
10869 parameter-declaration-clause. (It is invalid to
10870 initialize a static data member with a parenthesized
10871 initializer; only the "=" form of initialization is
10874 cp_parser_parse_tentatively (parser);
10876 /* Consume the `('. */
10877 cp_lexer_consume_token (parser->lexer);
10880 /* If this is going to be an abstract declarator, we're
10881 in a declarator and we can't have default args. */
10882 parser->default_arg_ok_p = false;
10883 parser->in_declarator_p = true;
10886 /* Inside the function parameter list, surrounding
10887 template-parameter-lists do not apply. */
10888 saved_num_template_parameter_lists
10889 = parser->num_template_parameter_lists;
10890 parser->num_template_parameter_lists = 0;
10892 /* Parse the parameter-declaration-clause. */
10893 params = cp_parser_parameter_declaration_clause (parser);
10895 parser->num_template_parameter_lists
10896 = saved_num_template_parameter_lists;
10898 /* If all went well, parse the cv-qualifier-seq and the
10899 exception-specification. */
10900 if (member_p || cp_parser_parse_definitely (parser))
10902 cp_cv_quals cv_quals;
10903 tree exception_specification;
10905 if (ctor_dtor_or_conv_p)
10906 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
10908 /* Consume the `)'. */
10909 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
10911 /* Parse the cv-qualifier-seq. */
10912 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
10913 /* And the exception-specification. */
10914 exception_specification
10915 = cp_parser_exception_specification_opt (parser);
10917 /* Create the function-declarator. */
10918 declarator = make_call_declarator (declarator,
10921 exception_specification);
10922 /* Any subsequent parameter lists are to do with
10923 return type, so are not those of the declared
10925 parser->default_arg_ok_p = false;
10927 /* Repeat the main loop. */
10932 /* If this is the first, we can try a parenthesized
10936 bool saved_in_type_id_in_expr_p;
10938 parser->default_arg_ok_p = saved_default_arg_ok_p;
10939 parser->in_declarator_p = saved_in_declarator_p;
10941 /* Consume the `('. */
10942 cp_lexer_consume_token (parser->lexer);
10943 /* Parse the nested declarator. */
10944 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
10945 parser->in_type_id_in_expr_p = true;
10947 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
10948 /*parenthesized_p=*/NULL,
10950 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
10952 /* Expect a `)'. */
10953 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10954 declarator = cp_error_declarator;
10955 if (declarator == cp_error_declarator)
10958 goto handle_declarator;
10960 /* Otherwise, we must be done. */
10964 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10965 && token->type == CPP_OPEN_SQUARE)
10967 /* Parse an array-declarator. */
10970 if (ctor_dtor_or_conv_p)
10971 *ctor_dtor_or_conv_p = 0;
10974 parser->default_arg_ok_p = false;
10975 parser->in_declarator_p = true;
10976 /* Consume the `['. */
10977 cp_lexer_consume_token (parser->lexer);
10978 /* Peek at the next token. */
10979 token = cp_lexer_peek_token (parser->lexer);
10980 /* If the next token is `]', then there is no
10981 constant-expression. */
10982 if (token->type != CPP_CLOSE_SQUARE)
10984 bool non_constant_p;
10987 = cp_parser_constant_expression (parser,
10988 /*allow_non_constant=*/true,
10990 if (!non_constant_p)
10991 bounds = fold_non_dependent_expr (bounds);
10992 else if (!at_function_scope_p ())
10994 error ("array bound is not an integer constant");
10995 bounds = error_mark_node;
10999 bounds = NULL_TREE;
11000 /* Look for the closing `]'. */
11001 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11003 declarator = cp_error_declarator;
11007 declarator = make_array_declarator (declarator, bounds);
11009 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11013 /* Parse a declarator-id */
11014 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11015 cp_parser_parse_tentatively (parser);
11016 id = cp_parser_declarator_id (parser);
11017 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11019 if (!cp_parser_parse_definitely (parser))
11020 id = error_mark_node;
11021 else if (TREE_CODE (id) != IDENTIFIER_NODE)
11023 cp_parser_error (parser, "expected unqualified-id");
11024 id = error_mark_node;
11028 if (id == error_mark_node)
11030 declarator = cp_error_declarator;
11034 if (TREE_CODE (id) == SCOPE_REF && at_namespace_scope_p ())
11036 tree scope = TREE_OPERAND (id, 0);
11038 /* In the declaration of a member of a template class
11039 outside of the class itself, the SCOPE will sometimes
11040 be a TYPENAME_TYPE. For example, given:
11042 template <typename T>
11043 int S<T>::R::i = 3;
11045 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11046 this context, we must resolve S<T>::R to an ordinary
11047 type, rather than a typename type.
11049 The reason we normally avoid resolving TYPENAME_TYPEs
11050 is that a specialization of `S' might render
11051 `S<T>::R' not a type. However, if `S' is
11052 specialized, then this `i' will not be used, so there
11053 is no harm in resolving the types here. */
11054 if (TREE_CODE (scope) == TYPENAME_TYPE)
11058 /* Resolve the TYPENAME_TYPE. */
11059 type = resolve_typename_type (scope,
11060 /*only_current_p=*/false);
11061 /* If that failed, the declarator is invalid. */
11062 if (type == error_mark_node)
11063 error ("%<%T::%D%> is not a type",
11064 TYPE_CONTEXT (scope),
11065 TYPE_IDENTIFIER (scope));
11066 /* Build a new DECLARATOR. */
11067 id = build_nt (SCOPE_REF, type, TREE_OPERAND (id, 1));
11071 declarator = make_id_declarator (id);
11075 tree unqualified_name;
11077 if (TREE_CODE (id) == SCOPE_REF
11078 && CLASS_TYPE_P (TREE_OPERAND (id, 0)))
11080 class_type = TREE_OPERAND (id, 0);
11081 unqualified_name = TREE_OPERAND (id, 1);
11085 class_type = current_class_type;
11086 unqualified_name = id;
11091 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11092 declarator->u.id.sfk = sfk_destructor;
11093 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11094 declarator->u.id.sfk = sfk_conversion;
11095 else if (constructor_name_p (unqualified_name,
11097 || (TREE_CODE (unqualified_name) == TYPE_DECL
11098 && same_type_p (TREE_TYPE (unqualified_name),
11100 declarator->u.id.sfk = sfk_constructor;
11102 if (ctor_dtor_or_conv_p && declarator->u.id.sfk != sfk_none)
11103 *ctor_dtor_or_conv_p = -1;
11104 if (TREE_CODE (id) == SCOPE_REF
11105 && TREE_CODE (unqualified_name) == TYPE_DECL
11106 && CLASSTYPE_USE_TEMPLATE (TREE_TYPE (unqualified_name)))
11108 error ("invalid use of constructor as a template");
11109 inform ("use %<%T::%D%> instead of %<%T::%T%> to name "
11110 "the constructor in a qualified name",
11112 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11113 class_type, class_type);
11118 handle_declarator:;
11119 scope = get_scope_of_declarator (declarator);
11121 /* Any names that appear after the declarator-id for a
11122 member are looked up in the containing scope. */
11123 pop_p = push_scope (scope);
11124 parser->in_declarator_p = true;
11125 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11126 || (declarator && declarator->kind == cdk_id))
11127 /* Default args are only allowed on function
11129 parser->default_arg_ok_p = saved_default_arg_ok_p;
11131 parser->default_arg_ok_p = false;
11140 /* For an abstract declarator, we might wind up with nothing at this
11141 point. That's an error; the declarator is not optional. */
11143 cp_parser_error (parser, "expected declarator");
11145 /* If we entered a scope, we must exit it now. */
11149 parser->default_arg_ok_p = saved_default_arg_ok_p;
11150 parser->in_declarator_p = saved_in_declarator_p;
11155 /* Parse a ptr-operator.
11158 * cv-qualifier-seq [opt]
11160 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
11165 & cv-qualifier-seq [opt]
11167 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
11168 Returns ADDR_EXPR if a reference was used. In the case of a
11169 pointer-to-member, *TYPE is filled in with the TYPE containing the
11170 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
11171 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
11172 ERROR_MARK if an error occurred. */
11174 static enum tree_code
11175 cp_parser_ptr_operator (cp_parser* parser,
11177 cp_cv_quals *cv_quals)
11179 enum tree_code code = ERROR_MARK;
11182 /* Assume that it's not a pointer-to-member. */
11184 /* And that there are no cv-qualifiers. */
11185 *cv_quals = TYPE_UNQUALIFIED;
11187 /* Peek at the next token. */
11188 token = cp_lexer_peek_token (parser->lexer);
11189 /* If it's a `*' or `&' we have a pointer or reference. */
11190 if (token->type == CPP_MULT || token->type == CPP_AND)
11192 /* Remember which ptr-operator we were processing. */
11193 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
11195 /* Consume the `*' or `&'. */
11196 cp_lexer_consume_token (parser->lexer);
11198 /* A `*' can be followed by a cv-qualifier-seq, and so can a
11199 `&', if we are allowing GNU extensions. (The only qualifier
11200 that can legally appear after `&' is `restrict', but that is
11201 enforced during semantic analysis. */
11202 if (code == INDIRECT_REF
11203 || cp_parser_allow_gnu_extensions_p (parser))
11204 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11208 /* Try the pointer-to-member case. */
11209 cp_parser_parse_tentatively (parser);
11210 /* Look for the optional `::' operator. */
11211 cp_parser_global_scope_opt (parser,
11212 /*current_scope_valid_p=*/false);
11213 /* Look for the nested-name specifier. */
11214 cp_parser_nested_name_specifier (parser,
11215 /*typename_keyword_p=*/false,
11216 /*check_dependency_p=*/true,
11218 /*is_declaration=*/false);
11219 /* If we found it, and the next token is a `*', then we are
11220 indeed looking at a pointer-to-member operator. */
11221 if (!cp_parser_error_occurred (parser)
11222 && cp_parser_require (parser, CPP_MULT, "`*'"))
11224 /* The type of which the member is a member is given by the
11226 *type = parser->scope;
11227 /* The next name will not be qualified. */
11228 parser->scope = NULL_TREE;
11229 parser->qualifying_scope = NULL_TREE;
11230 parser->object_scope = NULL_TREE;
11231 /* Indicate that the `*' operator was used. */
11232 code = INDIRECT_REF;
11233 /* Look for the optional cv-qualifier-seq. */
11234 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11236 /* If that didn't work we don't have a ptr-operator. */
11237 if (!cp_parser_parse_definitely (parser))
11238 cp_parser_error (parser, "expected ptr-operator");
11244 /* Parse an (optional) cv-qualifier-seq.
11247 cv-qualifier cv-qualifier-seq [opt]
11258 Returns a bitmask representing the cv-qualifiers. */
11261 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
11263 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
11268 cp_cv_quals cv_qualifier;
11270 /* Peek at the next token. */
11271 token = cp_lexer_peek_token (parser->lexer);
11272 /* See if it's a cv-qualifier. */
11273 switch (token->keyword)
11276 cv_qualifier = TYPE_QUAL_CONST;
11280 cv_qualifier = TYPE_QUAL_VOLATILE;
11284 cv_qualifier = TYPE_QUAL_RESTRICT;
11288 cv_qualifier = TYPE_UNQUALIFIED;
11295 if (cv_quals & cv_qualifier)
11297 error ("duplicate cv-qualifier");
11298 cp_lexer_purge_token (parser->lexer);
11302 cp_lexer_consume_token (parser->lexer);
11303 cv_quals |= cv_qualifier;
11310 /* Parse a declarator-id.
11314 :: [opt] nested-name-specifier [opt] type-name
11316 In the `id-expression' case, the value returned is as for
11317 cp_parser_id_expression if the id-expression was an unqualified-id.
11318 If the id-expression was a qualified-id, then a SCOPE_REF is
11319 returned. The first operand is the scope (either a NAMESPACE_DECL
11320 or TREE_TYPE), but the second is still just a representation of an
11324 cp_parser_declarator_id (cp_parser* parser)
11326 tree id_expression;
11328 /* The expression must be an id-expression. Assume that qualified
11329 names are the names of types so that:
11332 int S<T>::R::i = 3;
11334 will work; we must treat `S<T>::R' as the name of a type.
11335 Similarly, assume that qualified names are templates, where
11339 int S<T>::R<T>::i = 3;
11342 id_expression = cp_parser_id_expression (parser,
11343 /*template_keyword_p=*/false,
11344 /*check_dependency_p=*/false,
11345 /*template_p=*/NULL,
11346 /*declarator_p=*/true);
11347 /* If the name was qualified, create a SCOPE_REF to represent
11351 id_expression = build_nt (SCOPE_REF, parser->scope, id_expression);
11352 parser->scope = NULL_TREE;
11355 return id_expression;
11358 /* Parse a type-id.
11361 type-specifier-seq abstract-declarator [opt]
11363 Returns the TYPE specified. */
11366 cp_parser_type_id (cp_parser* parser)
11368 cp_decl_specifier_seq type_specifier_seq;
11369 cp_declarator *abstract_declarator;
11371 /* Parse the type-specifier-seq. */
11372 cp_parser_type_specifier_seq (parser, &type_specifier_seq);
11373 if (type_specifier_seq.type == error_mark_node)
11374 return error_mark_node;
11376 /* There might or might not be an abstract declarator. */
11377 cp_parser_parse_tentatively (parser);
11378 /* Look for the declarator. */
11379 abstract_declarator
11380 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
11381 /*parenthesized_p=*/NULL,
11382 /*member_p=*/false);
11383 /* Check to see if there really was a declarator. */
11384 if (!cp_parser_parse_definitely (parser))
11385 abstract_declarator = NULL;
11387 return groktypename (&type_specifier_seq, abstract_declarator);
11390 /* Parse a type-specifier-seq.
11392 type-specifier-seq:
11393 type-specifier type-specifier-seq [opt]
11397 type-specifier-seq:
11398 attributes type-specifier-seq [opt]
11400 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
11403 cp_parser_type_specifier_seq (cp_parser* parser,
11404 cp_decl_specifier_seq *type_specifier_seq)
11406 bool seen_type_specifier = false;
11408 /* Clear the TYPE_SPECIFIER_SEQ. */
11409 clear_decl_specs (type_specifier_seq);
11411 /* Parse the type-specifiers and attributes. */
11414 tree type_specifier;
11416 /* Check for attributes first. */
11417 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
11419 type_specifier_seq->attributes =
11420 chainon (type_specifier_seq->attributes,
11421 cp_parser_attributes_opt (parser));
11425 /* Look for the type-specifier. */
11426 type_specifier = cp_parser_type_specifier (parser,
11427 CP_PARSER_FLAGS_OPTIONAL,
11428 type_specifier_seq,
11429 /*is_declaration=*/false,
11432 /* If the first type-specifier could not be found, this is not a
11433 type-specifier-seq at all. */
11434 if (!seen_type_specifier && !type_specifier)
11436 cp_parser_error (parser, "expected type-specifier");
11437 type_specifier_seq->type = error_mark_node;
11440 /* If subsequent type-specifiers could not be found, the
11441 type-specifier-seq is complete. */
11442 else if (seen_type_specifier && !type_specifier)
11445 seen_type_specifier = true;
11451 /* Parse a parameter-declaration-clause.
11453 parameter-declaration-clause:
11454 parameter-declaration-list [opt] ... [opt]
11455 parameter-declaration-list , ...
11457 Returns a representation for the parameter declarations. A return
11458 value of NULL indicates a parameter-declaration-clause consisting
11459 only of an ellipsis. */
11461 static cp_parameter_declarator *
11462 cp_parser_parameter_declaration_clause (cp_parser* parser)
11464 cp_parameter_declarator *parameters;
11469 /* Peek at the next token. */
11470 token = cp_lexer_peek_token (parser->lexer);
11471 /* Check for trivial parameter-declaration-clauses. */
11472 if (token->type == CPP_ELLIPSIS)
11474 /* Consume the `...' token. */
11475 cp_lexer_consume_token (parser->lexer);
11478 else if (token->type == CPP_CLOSE_PAREN)
11479 /* There are no parameters. */
11481 #ifndef NO_IMPLICIT_EXTERN_C
11482 if (in_system_header && current_class_type == NULL
11483 && current_lang_name == lang_name_c)
11487 return no_parameters;
11489 /* Check for `(void)', too, which is a special case. */
11490 else if (token->keyword == RID_VOID
11491 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
11492 == CPP_CLOSE_PAREN))
11494 /* Consume the `void' token. */
11495 cp_lexer_consume_token (parser->lexer);
11496 /* There are no parameters. */
11497 return no_parameters;
11500 /* Parse the parameter-declaration-list. */
11501 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
11502 /* If a parse error occurred while parsing the
11503 parameter-declaration-list, then the entire
11504 parameter-declaration-clause is erroneous. */
11508 /* Peek at the next token. */
11509 token = cp_lexer_peek_token (parser->lexer);
11510 /* If it's a `,', the clause should terminate with an ellipsis. */
11511 if (token->type == CPP_COMMA)
11513 /* Consume the `,'. */
11514 cp_lexer_consume_token (parser->lexer);
11515 /* Expect an ellipsis. */
11517 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
11519 /* It might also be `...' if the optional trailing `,' was
11521 else if (token->type == CPP_ELLIPSIS)
11523 /* Consume the `...' token. */
11524 cp_lexer_consume_token (parser->lexer);
11525 /* And remember that we saw it. */
11529 ellipsis_p = false;
11531 /* Finish the parameter list. */
11532 if (parameters && ellipsis_p)
11533 parameters->ellipsis_p = true;
11538 /* Parse a parameter-declaration-list.
11540 parameter-declaration-list:
11541 parameter-declaration
11542 parameter-declaration-list , parameter-declaration
11544 Returns a representation of the parameter-declaration-list, as for
11545 cp_parser_parameter_declaration_clause. However, the
11546 `void_list_node' is never appended to the list. Upon return,
11547 *IS_ERROR will be true iff an error occurred. */
11549 static cp_parameter_declarator *
11550 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
11552 cp_parameter_declarator *parameters = NULL;
11553 cp_parameter_declarator **tail = ¶meters;
11555 /* Assume all will go well. */
11558 /* Look for more parameters. */
11561 cp_parameter_declarator *parameter;
11562 bool parenthesized_p;
11563 /* Parse the parameter. */
11565 = cp_parser_parameter_declaration (parser,
11566 /*template_parm_p=*/false,
11569 /* If a parse error occurred parsing the parameter declaration,
11570 then the entire parameter-declaration-list is erroneous. */
11577 /* Add the new parameter to the list. */
11579 tail = ¶meter->next;
11581 /* Peek at the next token. */
11582 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
11583 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11584 /* The parameter-declaration-list is complete. */
11586 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11590 /* Peek at the next token. */
11591 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11592 /* If it's an ellipsis, then the list is complete. */
11593 if (token->type == CPP_ELLIPSIS)
11595 /* Otherwise, there must be more parameters. Consume the
11597 cp_lexer_consume_token (parser->lexer);
11598 /* When parsing something like:
11600 int i(float f, double d)
11602 we can tell after seeing the declaration for "f" that we
11603 are not looking at an initialization of a variable "i",
11604 but rather at the declaration of a function "i".
11606 Due to the fact that the parsing of template arguments
11607 (as specified to a template-id) requires backtracking we
11608 cannot use this technique when inside a template argument
11610 if (!parser->in_template_argument_list_p
11611 && !parser->in_type_id_in_expr_p
11612 && cp_parser_parsing_tentatively (parser)
11613 && !cp_parser_committed_to_tentative_parse (parser)
11614 /* However, a parameter-declaration of the form
11615 "foat(f)" (which is a valid declaration of a
11616 parameter "f") can also be interpreted as an
11617 expression (the conversion of "f" to "float"). */
11618 && !parenthesized_p)
11619 cp_parser_commit_to_tentative_parse (parser);
11623 cp_parser_error (parser, "expected %<,%> or %<...%>");
11624 if (!cp_parser_parsing_tentatively (parser)
11625 || cp_parser_committed_to_tentative_parse (parser))
11626 cp_parser_skip_to_closing_parenthesis (parser,
11627 /*recovering=*/true,
11628 /*or_comma=*/false,
11629 /*consume_paren=*/false);
11637 /* Parse a parameter declaration.
11639 parameter-declaration:
11640 decl-specifier-seq declarator
11641 decl-specifier-seq declarator = assignment-expression
11642 decl-specifier-seq abstract-declarator [opt]
11643 decl-specifier-seq abstract-declarator [opt] = assignment-expression
11645 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
11646 declares a template parameter. (In that case, a non-nested `>'
11647 token encountered during the parsing of the assignment-expression
11648 is not interpreted as a greater-than operator.)
11650 Returns a representation of the parameter, or NULL if an error
11651 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
11652 true iff the declarator is of the form "(p)". */
11654 static cp_parameter_declarator *
11655 cp_parser_parameter_declaration (cp_parser *parser,
11656 bool template_parm_p,
11657 bool *parenthesized_p)
11659 int declares_class_or_enum;
11660 bool greater_than_is_operator_p;
11661 cp_decl_specifier_seq decl_specifiers;
11662 cp_declarator *declarator;
11663 tree default_argument;
11665 const char *saved_message;
11667 /* In a template parameter, `>' is not an operator.
11671 When parsing a default template-argument for a non-type
11672 template-parameter, the first non-nested `>' is taken as the end
11673 of the template parameter-list rather than a greater-than
11675 greater_than_is_operator_p = !template_parm_p;
11677 /* Type definitions may not appear in parameter types. */
11678 saved_message = parser->type_definition_forbidden_message;
11679 parser->type_definition_forbidden_message
11680 = "types may not be defined in parameter types";
11682 /* Parse the declaration-specifiers. */
11683 cp_parser_decl_specifier_seq (parser,
11684 CP_PARSER_FLAGS_NONE,
11686 &declares_class_or_enum);
11687 /* If an error occurred, there's no reason to attempt to parse the
11688 rest of the declaration. */
11689 if (cp_parser_error_occurred (parser))
11691 parser->type_definition_forbidden_message = saved_message;
11695 /* Peek at the next token. */
11696 token = cp_lexer_peek_token (parser->lexer);
11697 /* If the next token is a `)', `,', `=', `>', or `...', then there
11698 is no declarator. */
11699 if (token->type == CPP_CLOSE_PAREN
11700 || token->type == CPP_COMMA
11701 || token->type == CPP_EQ
11702 || token->type == CPP_ELLIPSIS
11703 || token->type == CPP_GREATER)
11706 if (parenthesized_p)
11707 *parenthesized_p = false;
11709 /* Otherwise, there should be a declarator. */
11712 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11713 parser->default_arg_ok_p = false;
11715 /* After seeing a decl-specifier-seq, if the next token is not a
11716 "(", there is no possibility that the code is a valid
11717 expression. Therefore, if parsing tentatively, we commit at
11719 if (!parser->in_template_argument_list_p
11720 /* In an expression context, having seen:
11724 we cannot be sure whether we are looking at a
11725 function-type (taking a "char" as a parameter) or a cast
11726 of some object of type "char" to "int". */
11727 && !parser->in_type_id_in_expr_p
11728 && cp_parser_parsing_tentatively (parser)
11729 && !cp_parser_committed_to_tentative_parse (parser)
11730 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
11731 cp_parser_commit_to_tentative_parse (parser);
11732 /* Parse the declarator. */
11733 declarator = cp_parser_declarator (parser,
11734 CP_PARSER_DECLARATOR_EITHER,
11735 /*ctor_dtor_or_conv_p=*/NULL,
11737 /*member_p=*/false);
11738 parser->default_arg_ok_p = saved_default_arg_ok_p;
11739 /* After the declarator, allow more attributes. */
11740 decl_specifiers.attributes
11741 = chainon (decl_specifiers.attributes,
11742 cp_parser_attributes_opt (parser));
11745 /* The restriction on defining new types applies only to the type
11746 of the parameter, not to the default argument. */
11747 parser->type_definition_forbidden_message = saved_message;
11749 /* If the next token is `=', then process a default argument. */
11750 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11752 bool saved_greater_than_is_operator_p;
11753 /* Consume the `='. */
11754 cp_lexer_consume_token (parser->lexer);
11756 /* If we are defining a class, then the tokens that make up the
11757 default argument must be saved and processed later. */
11758 if (!template_parm_p && at_class_scope_p ()
11759 && TYPE_BEING_DEFINED (current_class_type))
11761 unsigned depth = 0;
11762 cp_token *first_token;
11765 /* Add tokens until we have processed the entire default
11766 argument. We add the range [first_token, token). */
11767 first_token = cp_lexer_peek_token (parser->lexer);
11772 /* Peek at the next token. */
11773 token = cp_lexer_peek_token (parser->lexer);
11774 /* What we do depends on what token we have. */
11775 switch (token->type)
11777 /* In valid code, a default argument must be
11778 immediately followed by a `,' `)', or `...'. */
11780 case CPP_CLOSE_PAREN:
11782 /* If we run into a non-nested `;', `}', or `]',
11783 then the code is invalid -- but the default
11784 argument is certainly over. */
11785 case CPP_SEMICOLON:
11786 case CPP_CLOSE_BRACE:
11787 case CPP_CLOSE_SQUARE:
11790 /* Update DEPTH, if necessary. */
11791 else if (token->type == CPP_CLOSE_PAREN
11792 || token->type == CPP_CLOSE_BRACE
11793 || token->type == CPP_CLOSE_SQUARE)
11797 case CPP_OPEN_PAREN:
11798 case CPP_OPEN_SQUARE:
11799 case CPP_OPEN_BRACE:
11804 /* If we see a non-nested `>', and `>' is not an
11805 operator, then it marks the end of the default
11807 if (!depth && !greater_than_is_operator_p)
11811 /* If we run out of tokens, issue an error message. */
11813 error ("file ends in default argument");
11819 /* In these cases, we should look for template-ids.
11820 For example, if the default argument is
11821 `X<int, double>()', we need to do name lookup to
11822 figure out whether or not `X' is a template; if
11823 so, the `,' does not end the default argument.
11825 That is not yet done. */
11832 /* If we've reached the end, stop. */
11836 /* Add the token to the token block. */
11837 token = cp_lexer_consume_token (parser->lexer);
11840 /* Create a DEFAULT_ARG to represented the unparsed default
11842 default_argument = make_node (DEFAULT_ARG);
11843 DEFARG_TOKENS (default_argument)
11844 = cp_token_cache_new (first_token, token);
11846 /* Outside of a class definition, we can just parse the
11847 assignment-expression. */
11850 bool saved_local_variables_forbidden_p;
11852 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
11854 saved_greater_than_is_operator_p
11855 = parser->greater_than_is_operator_p;
11856 parser->greater_than_is_operator_p = greater_than_is_operator_p;
11857 /* Local variable names (and the `this' keyword) may not
11858 appear in a default argument. */
11859 saved_local_variables_forbidden_p
11860 = parser->local_variables_forbidden_p;
11861 parser->local_variables_forbidden_p = true;
11862 /* Parse the assignment-expression. */
11863 default_argument = cp_parser_assignment_expression (parser);
11864 /* Restore saved state. */
11865 parser->greater_than_is_operator_p
11866 = saved_greater_than_is_operator_p;
11867 parser->local_variables_forbidden_p
11868 = saved_local_variables_forbidden_p;
11870 if (!parser->default_arg_ok_p)
11872 if (!flag_pedantic_errors)
11873 warning ("deprecated use of default argument for parameter of non-function");
11876 error ("default arguments are only permitted for function parameters");
11877 default_argument = NULL_TREE;
11882 default_argument = NULL_TREE;
11884 return make_parameter_declarator (&decl_specifiers,
11889 /* Parse a function-body.
11892 compound_statement */
11895 cp_parser_function_body (cp_parser *parser)
11897 cp_parser_compound_statement (parser, NULL, false);
11900 /* Parse a ctor-initializer-opt followed by a function-body. Return
11901 true if a ctor-initializer was present. */
11904 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
11907 bool ctor_initializer_p;
11909 /* Begin the function body. */
11910 body = begin_function_body ();
11911 /* Parse the optional ctor-initializer. */
11912 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
11913 /* Parse the function-body. */
11914 cp_parser_function_body (parser);
11915 /* Finish the function body. */
11916 finish_function_body (body);
11918 return ctor_initializer_p;
11921 /* Parse an initializer.
11924 = initializer-clause
11925 ( expression-list )
11927 Returns a expression representing the initializer. If no
11928 initializer is present, NULL_TREE is returned.
11930 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
11931 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
11932 set to FALSE if there is no initializer present. If there is an
11933 initializer, and it is not a constant-expression, *NON_CONSTANT_P
11934 is set to true; otherwise it is set to false. */
11937 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
11938 bool* non_constant_p)
11943 /* Peek at the next token. */
11944 token = cp_lexer_peek_token (parser->lexer);
11946 /* Let our caller know whether or not this initializer was
11948 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
11949 /* Assume that the initializer is constant. */
11950 *non_constant_p = false;
11952 if (token->type == CPP_EQ)
11954 /* Consume the `='. */
11955 cp_lexer_consume_token (parser->lexer);
11956 /* Parse the initializer-clause. */
11957 init = cp_parser_initializer_clause (parser, non_constant_p);
11959 else if (token->type == CPP_OPEN_PAREN)
11960 init = cp_parser_parenthesized_expression_list (parser, false,
11964 /* Anything else is an error. */
11965 cp_parser_error (parser, "expected initializer");
11966 init = error_mark_node;
11972 /* Parse an initializer-clause.
11974 initializer-clause:
11975 assignment-expression
11976 { initializer-list , [opt] }
11979 Returns an expression representing the initializer.
11981 If the `assignment-expression' production is used the value
11982 returned is simply a representation for the expression.
11984 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
11985 the elements of the initializer-list (or NULL_TREE, if the last
11986 production is used). The TREE_TYPE for the CONSTRUCTOR will be
11987 NULL_TREE. There is no way to detect whether or not the optional
11988 trailing `,' was provided. NON_CONSTANT_P is as for
11989 cp_parser_initializer. */
11992 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
11996 /* If it is not a `{', then we are looking at an
11997 assignment-expression. */
11998 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12001 = cp_parser_constant_expression (parser,
12002 /*allow_non_constant_p=*/true,
12004 if (!*non_constant_p)
12005 initializer = fold_non_dependent_expr (initializer);
12009 /* Consume the `{' token. */
12010 cp_lexer_consume_token (parser->lexer);
12011 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12012 initializer = make_node (CONSTRUCTOR);
12013 /* If it's not a `}', then there is a non-trivial initializer. */
12014 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12016 /* Parse the initializer list. */
12017 CONSTRUCTOR_ELTS (initializer)
12018 = cp_parser_initializer_list (parser, non_constant_p);
12019 /* A trailing `,' token is allowed. */
12020 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12021 cp_lexer_consume_token (parser->lexer);
12023 /* Now, there should be a trailing `}'. */
12024 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12027 return initializer;
12030 /* Parse an initializer-list.
12034 initializer-list , initializer-clause
12039 identifier : initializer-clause
12040 initializer-list, identifier : initializer-clause
12042 Returns a TREE_LIST. The TREE_VALUE of each node is an expression
12043 for the initializer. If the TREE_PURPOSE is non-NULL, it is the
12044 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12045 as for cp_parser_initializer. */
12048 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12050 tree initializers = NULL_TREE;
12052 /* Assume all of the expressions are constant. */
12053 *non_constant_p = false;
12055 /* Parse the rest of the list. */
12061 bool clause_non_constant_p;
12063 /* If the next token is an identifier and the following one is a
12064 colon, we are looking at the GNU designated-initializer
12066 if (cp_parser_allow_gnu_extensions_p (parser)
12067 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12068 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12070 /* Consume the identifier. */
12071 identifier = cp_lexer_consume_token (parser->lexer)->value;
12072 /* Consume the `:'. */
12073 cp_lexer_consume_token (parser->lexer);
12076 identifier = NULL_TREE;
12078 /* Parse the initializer. */
12079 initializer = cp_parser_initializer_clause (parser,
12080 &clause_non_constant_p);
12081 /* If any clause is non-constant, so is the entire initializer. */
12082 if (clause_non_constant_p)
12083 *non_constant_p = true;
12084 /* Add it to the list. */
12085 initializers = tree_cons (identifier, initializer, initializers);
12087 /* If the next token is not a comma, we have reached the end of
12089 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12092 /* Peek at the next token. */
12093 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12094 /* If the next token is a `}', then we're still done. An
12095 initializer-clause can have a trailing `,' after the
12096 initializer-list and before the closing `}'. */
12097 if (token->type == CPP_CLOSE_BRACE)
12100 /* Consume the `,' token. */
12101 cp_lexer_consume_token (parser->lexer);
12104 /* The initializers were built up in reverse order, so we need to
12105 reverse them now. */
12106 return nreverse (initializers);
12109 /* Classes [gram.class] */
12111 /* Parse a class-name.
12117 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
12118 to indicate that names looked up in dependent types should be
12119 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
12120 keyword has been used to indicate that the name that appears next
12121 is a template. TAG_TYPE indicates the explicit tag given before
12122 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
12123 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
12124 is the class being defined in a class-head.
12126 Returns the TYPE_DECL representing the class. */
12129 cp_parser_class_name (cp_parser *parser,
12130 bool typename_keyword_p,
12131 bool template_keyword_p,
12132 enum tag_types tag_type,
12133 bool check_dependency_p,
12135 bool is_declaration)
12142 /* All class-names start with an identifier. */
12143 token = cp_lexer_peek_token (parser->lexer);
12144 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
12146 cp_parser_error (parser, "expected class-name");
12147 return error_mark_node;
12150 /* PARSER->SCOPE can be cleared when parsing the template-arguments
12151 to a template-id, so we save it here. */
12152 scope = parser->scope;
12153 if (scope == error_mark_node)
12154 return error_mark_node;
12156 /* Any name names a type if we're following the `typename' keyword
12157 in a qualified name where the enclosing scope is type-dependent. */
12158 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
12159 && dependent_type_p (scope));
12160 /* Handle the common case (an identifier, but not a template-id)
12162 if (token->type == CPP_NAME
12163 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
12167 /* Look for the identifier. */
12168 identifier = cp_parser_identifier (parser);
12169 /* If the next token isn't an identifier, we are certainly not
12170 looking at a class-name. */
12171 if (identifier == error_mark_node)
12172 decl = error_mark_node;
12173 /* If we know this is a type-name, there's no need to look it
12175 else if (typename_p)
12179 /* If the next token is a `::', then the name must be a type
12182 [basic.lookup.qual]
12184 During the lookup for a name preceding the :: scope
12185 resolution operator, object, function, and enumerator
12186 names are ignored. */
12187 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12188 tag_type = typename_type;
12189 /* Look up the name. */
12190 decl = cp_parser_lookup_name (parser, identifier,
12192 /*is_template=*/false,
12193 /*is_namespace=*/false,
12194 check_dependency_p,
12195 /*ambiguous_p=*/NULL);
12200 /* Try a template-id. */
12201 decl = cp_parser_template_id (parser, template_keyword_p,
12202 check_dependency_p,
12204 if (decl == error_mark_node)
12205 return error_mark_node;
12208 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
12210 /* If this is a typename, create a TYPENAME_TYPE. */
12211 if (typename_p && decl != error_mark_node)
12213 decl = make_typename_type (scope, decl, typename_type, /*complain=*/1);
12214 if (decl != error_mark_node)
12215 decl = TYPE_NAME (decl);
12218 /* Check to see that it is really the name of a class. */
12219 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
12220 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
12221 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12222 /* Situations like this:
12224 template <typename T> struct A {
12225 typename T::template X<int>::I i;
12228 are problematic. Is `T::template X<int>' a class-name? The
12229 standard does not seem to be definitive, but there is no other
12230 valid interpretation of the following `::'. Therefore, those
12231 names are considered class-names. */
12232 decl = TYPE_NAME (make_typename_type (scope, decl, tag_type, tf_error));
12233 else if (decl == error_mark_node
12234 || TREE_CODE (decl) != TYPE_DECL
12235 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
12237 cp_parser_error (parser, "expected class-name");
12238 return error_mark_node;
12244 /* Parse a class-specifier.
12247 class-head { member-specification [opt] }
12249 Returns the TREE_TYPE representing the class. */
12252 cp_parser_class_specifier (cp_parser* parser)
12256 tree attributes = NULL_TREE;
12257 int has_trailing_semicolon;
12258 bool nested_name_specifier_p;
12259 unsigned saved_num_template_parameter_lists;
12260 tree old_scope = NULL_TREE;
12261 tree scope = NULL_TREE;
12263 push_deferring_access_checks (dk_no_deferred);
12265 /* Parse the class-head. */
12266 type = cp_parser_class_head (parser,
12267 &nested_name_specifier_p,
12269 /* If the class-head was a semantic disaster, skip the entire body
12273 cp_parser_skip_to_end_of_block_or_statement (parser);
12274 pop_deferring_access_checks ();
12275 return error_mark_node;
12278 /* Look for the `{'. */
12279 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
12281 pop_deferring_access_checks ();
12282 return error_mark_node;
12285 /* Issue an error message if type-definitions are forbidden here. */
12286 cp_parser_check_type_definition (parser);
12287 /* Remember that we are defining one more class. */
12288 ++parser->num_classes_being_defined;
12289 /* Inside the class, surrounding template-parameter-lists do not
12291 saved_num_template_parameter_lists
12292 = parser->num_template_parameter_lists;
12293 parser->num_template_parameter_lists = 0;
12295 /* Start the class. */
12296 if (nested_name_specifier_p)
12298 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
12299 old_scope = push_inner_scope (scope);
12301 type = begin_class_definition (type);
12303 if (type == error_mark_node)
12304 /* If the type is erroneous, skip the entire body of the class. */
12305 cp_parser_skip_to_closing_brace (parser);
12307 /* Parse the member-specification. */
12308 cp_parser_member_specification_opt (parser);
12310 /* Look for the trailing `}'. */
12311 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12312 /* We get better error messages by noticing a common problem: a
12313 missing trailing `;'. */
12314 token = cp_lexer_peek_token (parser->lexer);
12315 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
12316 /* Look for trailing attributes to apply to this class. */
12317 if (cp_parser_allow_gnu_extensions_p (parser))
12319 tree sub_attr = cp_parser_attributes_opt (parser);
12320 attributes = chainon (attributes, sub_attr);
12322 if (type != error_mark_node)
12323 type = finish_struct (type, attributes);
12324 if (nested_name_specifier_p)
12325 pop_inner_scope (old_scope, scope);
12326 /* If this class is not itself within the scope of another class,
12327 then we need to parse the bodies of all of the queued function
12328 definitions. Note that the queued functions defined in a class
12329 are not always processed immediately following the
12330 class-specifier for that class. Consider:
12333 struct B { void f() { sizeof (A); } };
12336 If `f' were processed before the processing of `A' were
12337 completed, there would be no way to compute the size of `A'.
12338 Note that the nesting we are interested in here is lexical --
12339 not the semantic nesting given by TYPE_CONTEXT. In particular,
12342 struct A { struct B; };
12343 struct A::B { void f() { } };
12345 there is no need to delay the parsing of `A::B::f'. */
12346 if (--parser->num_classes_being_defined == 0)
12353 /* In a first pass, parse default arguments to the functions.
12354 Then, in a second pass, parse the bodies of the functions.
12355 This two-phased approach handles cases like:
12363 class_type = NULL_TREE;
12365 for (TREE_PURPOSE (parser->unparsed_functions_queues)
12366 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
12367 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
12368 TREE_PURPOSE (parser->unparsed_functions_queues)
12369 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
12371 fn = TREE_VALUE (queue_entry);
12372 /* If there are default arguments that have not yet been processed,
12373 take care of them now. */
12374 if (class_type != TREE_PURPOSE (queue_entry))
12377 pop_scope (class_type);
12378 class_type = TREE_PURPOSE (queue_entry);
12379 pop_p = push_scope (class_type);
12381 /* Make sure that any template parameters are in scope. */
12382 maybe_begin_member_template_processing (fn);
12383 /* Parse the default argument expressions. */
12384 cp_parser_late_parsing_default_args (parser, fn);
12385 /* Remove any template parameters from the symbol table. */
12386 maybe_end_member_template_processing ();
12389 pop_scope (class_type);
12390 /* Now parse the body of the functions. */
12391 for (TREE_VALUE (parser->unparsed_functions_queues)
12392 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
12393 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
12394 TREE_VALUE (parser->unparsed_functions_queues)
12395 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
12397 /* Figure out which function we need to process. */
12398 fn = TREE_VALUE (queue_entry);
12400 /* A hack to prevent garbage collection. */
12403 /* Parse the function. */
12404 cp_parser_late_parsing_for_member (parser, fn);
12409 /* Put back any saved access checks. */
12410 pop_deferring_access_checks ();
12412 /* Restore the count of active template-parameter-lists. */
12413 parser->num_template_parameter_lists
12414 = saved_num_template_parameter_lists;
12419 /* Parse a class-head.
12422 class-key identifier [opt] base-clause [opt]
12423 class-key nested-name-specifier identifier base-clause [opt]
12424 class-key nested-name-specifier [opt] template-id
12428 class-key attributes identifier [opt] base-clause [opt]
12429 class-key attributes nested-name-specifier identifier base-clause [opt]
12430 class-key attributes nested-name-specifier [opt] template-id
12433 Returns the TYPE of the indicated class. Sets
12434 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
12435 involving a nested-name-specifier was used, and FALSE otherwise.
12437 Returns NULL_TREE if the class-head is syntactically valid, but
12438 semantically invalid in a way that means we should skip the entire
12439 body of the class. */
12442 cp_parser_class_head (cp_parser* parser,
12443 bool* nested_name_specifier_p,
12444 tree *attributes_p)
12446 tree nested_name_specifier;
12447 enum tag_types class_key;
12448 tree id = NULL_TREE;
12449 tree type = NULL_TREE;
12451 bool template_id_p = false;
12452 bool qualified_p = false;
12453 bool invalid_nested_name_p = false;
12454 bool invalid_explicit_specialization_p = false;
12455 bool pop_p = false;
12456 unsigned num_templates;
12459 /* Assume no nested-name-specifier will be present. */
12460 *nested_name_specifier_p = false;
12461 /* Assume no template parameter lists will be used in defining the
12465 /* Look for the class-key. */
12466 class_key = cp_parser_class_key (parser);
12467 if (class_key == none_type)
12468 return error_mark_node;
12470 /* Parse the attributes. */
12471 attributes = cp_parser_attributes_opt (parser);
12473 /* If the next token is `::', that is invalid -- but sometimes
12474 people do try to write:
12478 Handle this gracefully by accepting the extra qualifier, and then
12479 issuing an error about it later if this really is a
12480 class-head. If it turns out just to be an elaborated type
12481 specifier, remain silent. */
12482 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
12483 qualified_p = true;
12485 push_deferring_access_checks (dk_no_check);
12487 /* Determine the name of the class. Begin by looking for an
12488 optional nested-name-specifier. */
12489 nested_name_specifier
12490 = cp_parser_nested_name_specifier_opt (parser,
12491 /*typename_keyword_p=*/false,
12492 /*check_dependency_p=*/false,
12494 /*is_declaration=*/false);
12495 /* If there was a nested-name-specifier, then there *must* be an
12497 if (nested_name_specifier)
12499 /* Although the grammar says `identifier', it really means
12500 `class-name' or `template-name'. You are only allowed to
12501 define a class that has already been declared with this
12504 The proposed resolution for Core Issue 180 says that whever
12505 you see `class T::X' you should treat `X' as a type-name.
12507 It is OK to define an inaccessible class; for example:
12509 class A { class B; };
12512 We do not know if we will see a class-name, or a
12513 template-name. We look for a class-name first, in case the
12514 class-name is a template-id; if we looked for the
12515 template-name first we would stop after the template-name. */
12516 cp_parser_parse_tentatively (parser);
12517 type = cp_parser_class_name (parser,
12518 /*typename_keyword_p=*/false,
12519 /*template_keyword_p=*/false,
12521 /*check_dependency_p=*/false,
12522 /*class_head_p=*/true,
12523 /*is_declaration=*/false);
12524 /* If that didn't work, ignore the nested-name-specifier. */
12525 if (!cp_parser_parse_definitely (parser))
12527 invalid_nested_name_p = true;
12528 id = cp_parser_identifier (parser);
12529 if (id == error_mark_node)
12532 /* If we could not find a corresponding TYPE, treat this
12533 declaration like an unqualified declaration. */
12534 if (type == error_mark_node)
12535 nested_name_specifier = NULL_TREE;
12536 /* Otherwise, count the number of templates used in TYPE and its
12537 containing scopes. */
12542 for (scope = TREE_TYPE (type);
12543 scope && TREE_CODE (scope) != NAMESPACE_DECL;
12544 scope = (TYPE_P (scope)
12545 ? TYPE_CONTEXT (scope)
12546 : DECL_CONTEXT (scope)))
12548 && CLASS_TYPE_P (scope)
12549 && CLASSTYPE_TEMPLATE_INFO (scope)
12550 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
12551 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
12555 /* Otherwise, the identifier is optional. */
12558 /* We don't know whether what comes next is a template-id,
12559 an identifier, or nothing at all. */
12560 cp_parser_parse_tentatively (parser);
12561 /* Check for a template-id. */
12562 id = cp_parser_template_id (parser,
12563 /*template_keyword_p=*/false,
12564 /*check_dependency_p=*/true,
12565 /*is_declaration=*/true);
12566 /* If that didn't work, it could still be an identifier. */
12567 if (!cp_parser_parse_definitely (parser))
12569 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12570 id = cp_parser_identifier (parser);
12576 template_id_p = true;
12581 pop_deferring_access_checks ();
12584 cp_parser_check_for_invalid_template_id (parser, id);
12586 /* If it's not a `:' or a `{' then we can't really be looking at a
12587 class-head, since a class-head only appears as part of a
12588 class-specifier. We have to detect this situation before calling
12589 xref_tag, since that has irreversible side-effects. */
12590 if (!cp_parser_next_token_starts_class_definition_p (parser))
12592 cp_parser_error (parser, "expected %<{%> or %<:%>");
12593 return error_mark_node;
12596 /* At this point, we're going ahead with the class-specifier, even
12597 if some other problem occurs. */
12598 cp_parser_commit_to_tentative_parse (parser);
12599 /* Issue the error about the overly-qualified name now. */
12601 cp_parser_error (parser,
12602 "global qualification of class name is invalid");
12603 else if (invalid_nested_name_p)
12604 cp_parser_error (parser,
12605 "qualified name does not name a class");
12606 else if (nested_name_specifier)
12609 /* Figure out in what scope the declaration is being placed. */
12610 scope = current_scope ();
12611 /* If that scope does not contain the scope in which the
12612 class was originally declared, the program is invalid. */
12613 if (scope && !is_ancestor (scope, nested_name_specifier))
12615 error ("declaration of %qD in %qD which does not enclose %qD",
12616 type, scope, nested_name_specifier);
12622 A declarator-id shall not be qualified exception of the
12623 definition of a ... nested class outside of its class
12624 ... [or] a the definition or explicit instantiation of a
12625 class member of a namespace outside of its namespace. */
12626 if (scope == nested_name_specifier)
12628 pedwarn ("extra qualification ignored");
12629 nested_name_specifier = NULL_TREE;
12633 /* An explicit-specialization must be preceded by "template <>". If
12634 it is not, try to recover gracefully. */
12635 if (at_namespace_scope_p ()
12636 && parser->num_template_parameter_lists == 0
12639 error ("an explicit specialization must be preceded by %<template <>%>");
12640 invalid_explicit_specialization_p = true;
12641 /* Take the same action that would have been taken by
12642 cp_parser_explicit_specialization. */
12643 ++parser->num_template_parameter_lists;
12644 begin_specialization ();
12646 /* There must be no "return" statements between this point and the
12647 end of this function; set "type "to the correct return value and
12648 use "goto done;" to return. */
12649 /* Make sure that the right number of template parameters were
12651 if (!cp_parser_check_template_parameters (parser, num_templates))
12653 /* If something went wrong, there is no point in even trying to
12654 process the class-definition. */
12659 /* Look up the type. */
12662 type = TREE_TYPE (id);
12663 maybe_process_partial_specialization (type);
12665 else if (!nested_name_specifier)
12667 /* If the class was unnamed, create a dummy name. */
12669 id = make_anon_name ();
12670 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
12671 parser->num_template_parameter_lists);
12676 bool pop_p = false;
12680 template <typename T> struct S { struct T };
12681 template <typename T> struct S<T>::T { };
12683 we will get a TYPENAME_TYPE when processing the definition of
12684 `S::T'. We need to resolve it to the actual type before we
12685 try to define it. */
12686 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
12688 class_type = resolve_typename_type (TREE_TYPE (type),
12689 /*only_current_p=*/false);
12690 if (class_type != error_mark_node)
12691 type = TYPE_NAME (class_type);
12694 cp_parser_error (parser, "could not resolve typename type");
12695 type = error_mark_node;
12699 maybe_process_partial_specialization (TREE_TYPE (type));
12700 class_type = current_class_type;
12701 /* Enter the scope indicated by the nested-name-specifier. */
12702 if (nested_name_specifier)
12703 pop_p = push_scope (nested_name_specifier);
12704 /* Get the canonical version of this type. */
12705 type = TYPE_MAIN_DECL (TREE_TYPE (type));
12706 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
12707 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
12708 type = push_template_decl (type);
12709 type = TREE_TYPE (type);
12710 if (nested_name_specifier)
12712 *nested_name_specifier_p = true;
12714 pop_scope (nested_name_specifier);
12717 /* Indicate whether this class was declared as a `class' or as a
12719 if (TREE_CODE (type) == RECORD_TYPE)
12720 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
12721 cp_parser_check_class_key (class_key, type);
12723 /* Enter the scope containing the class; the names of base classes
12724 should be looked up in that context. For example, given:
12726 struct A { struct B {}; struct C; };
12727 struct A::C : B {};
12730 if (nested_name_specifier)
12731 pop_p = push_scope (nested_name_specifier);
12735 /* Get the list of base-classes, if there is one. */
12736 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12737 bases = cp_parser_base_clause (parser);
12739 /* Process the base classes. */
12740 xref_basetypes (type, bases);
12742 /* Leave the scope given by the nested-name-specifier. We will
12743 enter the class scope itself while processing the members. */
12745 pop_scope (nested_name_specifier);
12748 if (invalid_explicit_specialization_p)
12750 end_specialization ();
12751 --parser->num_template_parameter_lists;
12753 *attributes_p = attributes;
12757 /* Parse a class-key.
12764 Returns the kind of class-key specified, or none_type to indicate
12767 static enum tag_types
12768 cp_parser_class_key (cp_parser* parser)
12771 enum tag_types tag_type;
12773 /* Look for the class-key. */
12774 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
12778 /* Check to see if the TOKEN is a class-key. */
12779 tag_type = cp_parser_token_is_class_key (token);
12781 cp_parser_error (parser, "expected class-key");
12785 /* Parse an (optional) member-specification.
12787 member-specification:
12788 member-declaration member-specification [opt]
12789 access-specifier : member-specification [opt] */
12792 cp_parser_member_specification_opt (cp_parser* parser)
12799 /* Peek at the next token. */
12800 token = cp_lexer_peek_token (parser->lexer);
12801 /* If it's a `}', or EOF then we've seen all the members. */
12802 if (token->type == CPP_CLOSE_BRACE || token->type == CPP_EOF)
12805 /* See if this token is a keyword. */
12806 keyword = token->keyword;
12810 case RID_PROTECTED:
12812 /* Consume the access-specifier. */
12813 cp_lexer_consume_token (parser->lexer);
12814 /* Remember which access-specifier is active. */
12815 current_access_specifier = token->value;
12816 /* Look for the `:'. */
12817 cp_parser_require (parser, CPP_COLON, "`:'");
12821 /* Accept #pragmas at class scope. */
12822 if (token->type == CPP_PRAGMA)
12824 cp_lexer_handle_pragma (parser->lexer);
12828 /* Otherwise, the next construction must be a
12829 member-declaration. */
12830 cp_parser_member_declaration (parser);
12835 /* Parse a member-declaration.
12837 member-declaration:
12838 decl-specifier-seq [opt] member-declarator-list [opt] ;
12839 function-definition ; [opt]
12840 :: [opt] nested-name-specifier template [opt] unqualified-id ;
12842 template-declaration
12844 member-declarator-list:
12846 member-declarator-list , member-declarator
12849 declarator pure-specifier [opt]
12850 declarator constant-initializer [opt]
12851 identifier [opt] : constant-expression
12855 member-declaration:
12856 __extension__ member-declaration
12859 declarator attributes [opt] pure-specifier [opt]
12860 declarator attributes [opt] constant-initializer [opt]
12861 identifier [opt] attributes [opt] : constant-expression */
12864 cp_parser_member_declaration (cp_parser* parser)
12866 cp_decl_specifier_seq decl_specifiers;
12867 tree prefix_attributes;
12869 int declares_class_or_enum;
12872 int saved_pedantic;
12874 /* Check for the `__extension__' keyword. */
12875 if (cp_parser_extension_opt (parser, &saved_pedantic))
12878 cp_parser_member_declaration (parser);
12879 /* Restore the old value of the PEDANTIC flag. */
12880 pedantic = saved_pedantic;
12885 /* Check for a template-declaration. */
12886 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
12888 /* Parse the template-declaration. */
12889 cp_parser_template_declaration (parser, /*member_p=*/true);
12894 /* Check for a using-declaration. */
12895 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
12897 /* Parse the using-declaration. */
12898 cp_parser_using_declaration (parser);
12903 /* Parse the decl-specifier-seq. */
12904 cp_parser_decl_specifier_seq (parser,
12905 CP_PARSER_FLAGS_OPTIONAL,
12907 &declares_class_or_enum);
12908 prefix_attributes = decl_specifiers.attributes;
12909 decl_specifiers.attributes = NULL_TREE;
12910 /* Check for an invalid type-name. */
12911 if (!decl_specifiers.type
12912 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
12914 /* If there is no declarator, then the decl-specifier-seq should
12916 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
12918 /* If there was no decl-specifier-seq, and the next token is a
12919 `;', then we have something like:
12925 Each member-declaration shall declare at least one member
12926 name of the class. */
12927 if (!decl_specifiers.any_specifiers_p)
12929 cp_token *token = cp_lexer_peek_token (parser->lexer);
12930 if (pedantic && !token->in_system_header)
12931 pedwarn ("%Hextra %<;%>", &token->location);
12937 /* See if this declaration is a friend. */
12938 friend_p = cp_parser_friend_p (&decl_specifiers);
12939 /* If there were decl-specifiers, check to see if there was
12940 a class-declaration. */
12941 type = check_tag_decl (&decl_specifiers);
12942 /* Nested classes have already been added to the class, but
12943 a `friend' needs to be explicitly registered. */
12946 /* If the `friend' keyword was present, the friend must
12947 be introduced with a class-key. */
12948 if (!declares_class_or_enum)
12949 error ("a class-key must be used when declaring a friend");
12952 template <typename T> struct A {
12953 friend struct A<T>::B;
12956 A<T>::B will be represented by a TYPENAME_TYPE, and
12957 therefore not recognized by check_tag_decl. */
12959 && decl_specifiers.type
12960 && TYPE_P (decl_specifiers.type))
12961 type = decl_specifiers.type;
12962 if (!type || !TYPE_P (type))
12963 error ("friend declaration does not name a class or "
12966 make_friend_class (current_class_type, type,
12967 /*complain=*/true);
12969 /* If there is no TYPE, an error message will already have
12971 else if (!type || type == error_mark_node)
12973 /* An anonymous aggregate has to be handled specially; such
12974 a declaration really declares a data member (with a
12975 particular type), as opposed to a nested class. */
12976 else if (ANON_AGGR_TYPE_P (type))
12978 /* Remove constructors and such from TYPE, now that we
12979 know it is an anonymous aggregate. */
12980 fixup_anonymous_aggr (type);
12981 /* And make the corresponding data member. */
12982 decl = build_decl (FIELD_DECL, NULL_TREE, type);
12983 /* Add it to the class. */
12984 finish_member_declaration (decl);
12987 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
12992 /* See if these declarations will be friends. */
12993 friend_p = cp_parser_friend_p (&decl_specifiers);
12995 /* Keep going until we hit the `;' at the end of the
12997 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
12999 tree attributes = NULL_TREE;
13000 tree first_attribute;
13002 /* Peek at the next token. */
13003 token = cp_lexer_peek_token (parser->lexer);
13005 /* Check for a bitfield declaration. */
13006 if (token->type == CPP_COLON
13007 || (token->type == CPP_NAME
13008 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
13014 /* Get the name of the bitfield. Note that we cannot just
13015 check TOKEN here because it may have been invalidated by
13016 the call to cp_lexer_peek_nth_token above. */
13017 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
13018 identifier = cp_parser_identifier (parser);
13020 identifier = NULL_TREE;
13022 /* Consume the `:' token. */
13023 cp_lexer_consume_token (parser->lexer);
13024 /* Get the width of the bitfield. */
13026 = cp_parser_constant_expression (parser,
13027 /*allow_non_constant=*/false,
13030 /* Look for attributes that apply to the bitfield. */
13031 attributes = cp_parser_attributes_opt (parser);
13032 /* Remember which attributes are prefix attributes and
13034 first_attribute = attributes;
13035 /* Combine the attributes. */
13036 attributes = chainon (prefix_attributes, attributes);
13038 /* Create the bitfield declaration. */
13039 decl = grokbitfield (identifier
13040 ? make_id_declarator (identifier)
13044 /* Apply the attributes. */
13045 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
13049 cp_declarator *declarator;
13051 tree asm_specification;
13052 int ctor_dtor_or_conv_p;
13054 /* Parse the declarator. */
13056 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13057 &ctor_dtor_or_conv_p,
13058 /*parenthesized_p=*/NULL,
13059 /*member_p=*/true);
13061 /* If something went wrong parsing the declarator, make sure
13062 that we at least consume some tokens. */
13063 if (declarator == cp_error_declarator)
13065 /* Skip to the end of the statement. */
13066 cp_parser_skip_to_end_of_statement (parser);
13067 /* If the next token is not a semicolon, that is
13068 probably because we just skipped over the body of
13069 a function. So, we consume a semicolon if
13070 present, but do not issue an error message if it
13072 if (cp_lexer_next_token_is (parser->lexer,
13074 cp_lexer_consume_token (parser->lexer);
13078 if (declares_class_or_enum & 2)
13079 cp_parser_check_for_definition_in_return_type
13080 (declarator, decl_specifiers.type);
13082 /* Look for an asm-specification. */
13083 asm_specification = cp_parser_asm_specification_opt (parser);
13084 /* Look for attributes that apply to the declaration. */
13085 attributes = cp_parser_attributes_opt (parser);
13086 /* Remember which attributes are prefix attributes and
13088 first_attribute = attributes;
13089 /* Combine the attributes. */
13090 attributes = chainon (prefix_attributes, attributes);
13092 /* If it's an `=', then we have a constant-initializer or a
13093 pure-specifier. It is not correct to parse the
13094 initializer before registering the member declaration
13095 since the member declaration should be in scope while
13096 its initializer is processed. However, the rest of the
13097 front end does not yet provide an interface that allows
13098 us to handle this correctly. */
13099 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
13103 A pure-specifier shall be used only in the declaration of
13104 a virtual function.
13106 A member-declarator can contain a constant-initializer
13107 only if it declares a static member of integral or
13110 Therefore, if the DECLARATOR is for a function, we look
13111 for a pure-specifier; otherwise, we look for a
13112 constant-initializer. When we call `grokfield', it will
13113 perform more stringent semantics checks. */
13114 if (declarator->kind == cdk_function)
13115 initializer = cp_parser_pure_specifier (parser);
13117 /* Parse the initializer. */
13118 initializer = cp_parser_constant_initializer (parser);
13120 /* Otherwise, there is no initializer. */
13122 initializer = NULL_TREE;
13124 /* See if we are probably looking at a function
13125 definition. We are certainly not looking at at a
13126 member-declarator. Calling `grokfield' has
13127 side-effects, so we must not do it unless we are sure
13128 that we are looking at a member-declarator. */
13129 if (cp_parser_token_starts_function_definition_p
13130 (cp_lexer_peek_token (parser->lexer)))
13132 /* The grammar does not allow a pure-specifier to be
13133 used when a member function is defined. (It is
13134 possible that this fact is an oversight in the
13135 standard, since a pure function may be defined
13136 outside of the class-specifier. */
13138 error ("pure-specifier on function-definition");
13139 decl = cp_parser_save_member_function_body (parser,
13143 /* If the member was not a friend, declare it here. */
13145 finish_member_declaration (decl);
13146 /* Peek at the next token. */
13147 token = cp_lexer_peek_token (parser->lexer);
13148 /* If the next token is a semicolon, consume it. */
13149 if (token->type == CPP_SEMICOLON)
13150 cp_lexer_consume_token (parser->lexer);
13155 /* Create the declaration. */
13156 decl = grokfield (declarator, &decl_specifiers,
13157 initializer, asm_specification,
13159 /* Any initialization must have been from a
13160 constant-expression. */
13161 if (decl && TREE_CODE (decl) == VAR_DECL && initializer)
13162 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1;
13166 /* Reset PREFIX_ATTRIBUTES. */
13167 while (attributes && TREE_CHAIN (attributes) != first_attribute)
13168 attributes = TREE_CHAIN (attributes);
13170 TREE_CHAIN (attributes) = NULL_TREE;
13172 /* If there is any qualification still in effect, clear it
13173 now; we will be starting fresh with the next declarator. */
13174 parser->scope = NULL_TREE;
13175 parser->qualifying_scope = NULL_TREE;
13176 parser->object_scope = NULL_TREE;
13177 /* If it's a `,', then there are more declarators. */
13178 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13179 cp_lexer_consume_token (parser->lexer);
13180 /* If the next token isn't a `;', then we have a parse error. */
13181 else if (cp_lexer_next_token_is_not (parser->lexer,
13184 cp_parser_error (parser, "expected %<;%>");
13185 /* Skip tokens until we find a `;'. */
13186 cp_parser_skip_to_end_of_statement (parser);
13193 /* Add DECL to the list of members. */
13195 finish_member_declaration (decl);
13197 if (TREE_CODE (decl) == FUNCTION_DECL)
13198 cp_parser_save_default_args (parser, decl);
13203 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
13206 /* Parse a pure-specifier.
13211 Returns INTEGER_ZERO_NODE if a pure specifier is found.
13212 Otherwise, ERROR_MARK_NODE is returned. */
13215 cp_parser_pure_specifier (cp_parser* parser)
13219 /* Look for the `=' token. */
13220 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13221 return error_mark_node;
13222 /* Look for the `0' token. */
13223 token = cp_parser_require (parser, CPP_NUMBER, "`0'");
13224 /* Unfortunately, this will accept `0L' and `0x00' as well. We need
13225 to get information from the lexer about how the number was
13226 spelled in order to fix this problem. */
13227 if (!token || !integer_zerop (token->value))
13228 return error_mark_node;
13230 return integer_zero_node;
13233 /* Parse a constant-initializer.
13235 constant-initializer:
13236 = constant-expression
13238 Returns a representation of the constant-expression. */
13241 cp_parser_constant_initializer (cp_parser* parser)
13243 /* Look for the `=' token. */
13244 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13245 return error_mark_node;
13247 /* It is invalid to write:
13249 struct S { static const int i = { 7 }; };
13252 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13254 cp_parser_error (parser,
13255 "a brace-enclosed initializer is not allowed here");
13256 /* Consume the opening brace. */
13257 cp_lexer_consume_token (parser->lexer);
13258 /* Skip the initializer. */
13259 cp_parser_skip_to_closing_brace (parser);
13260 /* Look for the trailing `}'. */
13261 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13263 return error_mark_node;
13266 return cp_parser_constant_expression (parser,
13267 /*allow_non_constant=*/false,
13271 /* Derived classes [gram.class.derived] */
13273 /* Parse a base-clause.
13276 : base-specifier-list
13278 base-specifier-list:
13280 base-specifier-list , base-specifier
13282 Returns a TREE_LIST representing the base-classes, in the order in
13283 which they were declared. The representation of each node is as
13284 described by cp_parser_base_specifier.
13286 In the case that no bases are specified, this function will return
13287 NULL_TREE, not ERROR_MARK_NODE. */
13290 cp_parser_base_clause (cp_parser* parser)
13292 tree bases = NULL_TREE;
13294 /* Look for the `:' that begins the list. */
13295 cp_parser_require (parser, CPP_COLON, "`:'");
13297 /* Scan the base-specifier-list. */
13303 /* Look for the base-specifier. */
13304 base = cp_parser_base_specifier (parser);
13305 /* Add BASE to the front of the list. */
13306 if (base != error_mark_node)
13308 TREE_CHAIN (base) = bases;
13311 /* Peek at the next token. */
13312 token = cp_lexer_peek_token (parser->lexer);
13313 /* If it's not a comma, then the list is complete. */
13314 if (token->type != CPP_COMMA)
13316 /* Consume the `,'. */
13317 cp_lexer_consume_token (parser->lexer);
13320 /* PARSER->SCOPE may still be non-NULL at this point, if the last
13321 base class had a qualified name. However, the next name that
13322 appears is certainly not qualified. */
13323 parser->scope = NULL_TREE;
13324 parser->qualifying_scope = NULL_TREE;
13325 parser->object_scope = NULL_TREE;
13327 return nreverse (bases);
13330 /* Parse a base-specifier.
13333 :: [opt] nested-name-specifier [opt] class-name
13334 virtual access-specifier [opt] :: [opt] nested-name-specifier
13336 access-specifier virtual [opt] :: [opt] nested-name-specifier
13339 Returns a TREE_LIST. The TREE_PURPOSE will be one of
13340 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
13341 indicate the specifiers provided. The TREE_VALUE will be a TYPE
13342 (or the ERROR_MARK_NODE) indicating the type that was specified. */
13345 cp_parser_base_specifier (cp_parser* parser)
13349 bool virtual_p = false;
13350 bool duplicate_virtual_error_issued_p = false;
13351 bool duplicate_access_error_issued_p = false;
13352 bool class_scope_p, template_p;
13353 tree access = access_default_node;
13356 /* Process the optional `virtual' and `access-specifier'. */
13359 /* Peek at the next token. */
13360 token = cp_lexer_peek_token (parser->lexer);
13361 /* Process `virtual'. */
13362 switch (token->keyword)
13365 /* If `virtual' appears more than once, issue an error. */
13366 if (virtual_p && !duplicate_virtual_error_issued_p)
13368 cp_parser_error (parser,
13369 "%<virtual%> specified more than once in base-specified");
13370 duplicate_virtual_error_issued_p = true;
13375 /* Consume the `virtual' token. */
13376 cp_lexer_consume_token (parser->lexer);
13381 case RID_PROTECTED:
13383 /* If more than one access specifier appears, issue an
13385 if (access != access_default_node
13386 && !duplicate_access_error_issued_p)
13388 cp_parser_error (parser,
13389 "more than one access specifier in base-specified");
13390 duplicate_access_error_issued_p = true;
13393 access = ridpointers[(int) token->keyword];
13395 /* Consume the access-specifier. */
13396 cp_lexer_consume_token (parser->lexer);
13405 /* It is not uncommon to see programs mechanically, erroneously, use
13406 the 'typename' keyword to denote (dependent) qualified types
13407 as base classes. */
13408 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
13410 if (!processing_template_decl)
13411 error ("keyword %<typename%> not allowed outside of templates");
13413 error ("keyword %<typename%> not allowed in this context "
13414 "(the base class is implicitly a type)");
13415 cp_lexer_consume_token (parser->lexer);
13418 /* Look for the optional `::' operator. */
13419 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
13420 /* Look for the nested-name-specifier. The simplest way to
13425 The keyword `typename' is not permitted in a base-specifier or
13426 mem-initializer; in these contexts a qualified name that
13427 depends on a template-parameter is implicitly assumed to be a
13430 is to pretend that we have seen the `typename' keyword at this
13432 cp_parser_nested_name_specifier_opt (parser,
13433 /*typename_keyword_p=*/true,
13434 /*check_dependency_p=*/true,
13436 /*is_declaration=*/true);
13437 /* If the base class is given by a qualified name, assume that names
13438 we see are type names or templates, as appropriate. */
13439 class_scope_p = (parser->scope && TYPE_P (parser->scope));
13440 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
13442 /* Finally, look for the class-name. */
13443 type = cp_parser_class_name (parser,
13447 /*check_dependency_p=*/true,
13448 /*class_head_p=*/false,
13449 /*is_declaration=*/true);
13451 if (type == error_mark_node)
13452 return error_mark_node;
13454 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
13457 /* Exception handling [gram.exception] */
13459 /* Parse an (optional) exception-specification.
13461 exception-specification:
13462 throw ( type-id-list [opt] )
13464 Returns a TREE_LIST representing the exception-specification. The
13465 TREE_VALUE of each node is a type. */
13468 cp_parser_exception_specification_opt (cp_parser* parser)
13473 /* Peek at the next token. */
13474 token = cp_lexer_peek_token (parser->lexer);
13475 /* If it's not `throw', then there's no exception-specification. */
13476 if (!cp_parser_is_keyword (token, RID_THROW))
13479 /* Consume the `throw'. */
13480 cp_lexer_consume_token (parser->lexer);
13482 /* Look for the `('. */
13483 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13485 /* Peek at the next token. */
13486 token = cp_lexer_peek_token (parser->lexer);
13487 /* If it's not a `)', then there is a type-id-list. */
13488 if (token->type != CPP_CLOSE_PAREN)
13490 const char *saved_message;
13492 /* Types may not be defined in an exception-specification. */
13493 saved_message = parser->type_definition_forbidden_message;
13494 parser->type_definition_forbidden_message
13495 = "types may not be defined in an exception-specification";
13496 /* Parse the type-id-list. */
13497 type_id_list = cp_parser_type_id_list (parser);
13498 /* Restore the saved message. */
13499 parser->type_definition_forbidden_message = saved_message;
13502 type_id_list = empty_except_spec;
13504 /* Look for the `)'. */
13505 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13507 return type_id_list;
13510 /* Parse an (optional) type-id-list.
13514 type-id-list , type-id
13516 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
13517 in the order that the types were presented. */
13520 cp_parser_type_id_list (cp_parser* parser)
13522 tree types = NULL_TREE;
13529 /* Get the next type-id. */
13530 type = cp_parser_type_id (parser);
13531 /* Add it to the list. */
13532 types = add_exception_specifier (types, type, /*complain=*/1);
13533 /* Peek at the next token. */
13534 token = cp_lexer_peek_token (parser->lexer);
13535 /* If it is not a `,', we are done. */
13536 if (token->type != CPP_COMMA)
13538 /* Consume the `,'. */
13539 cp_lexer_consume_token (parser->lexer);
13542 return nreverse (types);
13545 /* Parse a try-block.
13548 try compound-statement handler-seq */
13551 cp_parser_try_block (cp_parser* parser)
13555 cp_parser_require_keyword (parser, RID_TRY, "`try'");
13556 try_block = begin_try_block ();
13557 cp_parser_compound_statement (parser, NULL, true);
13558 finish_try_block (try_block);
13559 cp_parser_handler_seq (parser);
13560 finish_handler_sequence (try_block);
13565 /* Parse a function-try-block.
13567 function-try-block:
13568 try ctor-initializer [opt] function-body handler-seq */
13571 cp_parser_function_try_block (cp_parser* parser)
13574 bool ctor_initializer_p;
13576 /* Look for the `try' keyword. */
13577 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
13579 /* Let the rest of the front-end know where we are. */
13580 try_block = begin_function_try_block ();
13581 /* Parse the function-body. */
13583 = cp_parser_ctor_initializer_opt_and_function_body (parser);
13584 /* We're done with the `try' part. */
13585 finish_function_try_block (try_block);
13586 /* Parse the handlers. */
13587 cp_parser_handler_seq (parser);
13588 /* We're done with the handlers. */
13589 finish_function_handler_sequence (try_block);
13591 return ctor_initializer_p;
13594 /* Parse a handler-seq.
13597 handler handler-seq [opt] */
13600 cp_parser_handler_seq (cp_parser* parser)
13606 /* Parse the handler. */
13607 cp_parser_handler (parser);
13608 /* Peek at the next token. */
13609 token = cp_lexer_peek_token (parser->lexer);
13610 /* If it's not `catch' then there are no more handlers. */
13611 if (!cp_parser_is_keyword (token, RID_CATCH))
13616 /* Parse a handler.
13619 catch ( exception-declaration ) compound-statement */
13622 cp_parser_handler (cp_parser* parser)
13627 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
13628 handler = begin_handler ();
13629 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13630 declaration = cp_parser_exception_declaration (parser);
13631 finish_handler_parms (declaration, handler);
13632 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13633 cp_parser_compound_statement (parser, NULL, false);
13634 finish_handler (handler);
13637 /* Parse an exception-declaration.
13639 exception-declaration:
13640 type-specifier-seq declarator
13641 type-specifier-seq abstract-declarator
13645 Returns a VAR_DECL for the declaration, or NULL_TREE if the
13646 ellipsis variant is used. */
13649 cp_parser_exception_declaration (cp_parser* parser)
13652 cp_decl_specifier_seq type_specifiers;
13653 cp_declarator *declarator;
13654 const char *saved_message;
13656 /* If it's an ellipsis, it's easy to handle. */
13657 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
13659 /* Consume the `...' token. */
13660 cp_lexer_consume_token (parser->lexer);
13664 /* Types may not be defined in exception-declarations. */
13665 saved_message = parser->type_definition_forbidden_message;
13666 parser->type_definition_forbidden_message
13667 = "types may not be defined in exception-declarations";
13669 /* Parse the type-specifier-seq. */
13670 cp_parser_type_specifier_seq (parser, &type_specifiers);
13671 /* If it's a `)', then there is no declarator. */
13672 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
13675 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
13676 /*ctor_dtor_or_conv_p=*/NULL,
13677 /*parenthesized_p=*/NULL,
13678 /*member_p=*/false);
13680 /* Restore the saved message. */
13681 parser->type_definition_forbidden_message = saved_message;
13683 if (type_specifiers.any_specifiers_p)
13685 decl = grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
13686 if (decl == NULL_TREE)
13687 error ("invalid catch parameter");
13695 /* Parse a throw-expression.
13698 throw assignment-expression [opt]
13700 Returns a THROW_EXPR representing the throw-expression. */
13703 cp_parser_throw_expression (cp_parser* parser)
13708 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
13709 token = cp_lexer_peek_token (parser->lexer);
13710 /* Figure out whether or not there is an assignment-expression
13711 following the "throw" keyword. */
13712 if (token->type == CPP_COMMA
13713 || token->type == CPP_SEMICOLON
13714 || token->type == CPP_CLOSE_PAREN
13715 || token->type == CPP_CLOSE_SQUARE
13716 || token->type == CPP_CLOSE_BRACE
13717 || token->type == CPP_COLON)
13718 expression = NULL_TREE;
13720 expression = cp_parser_assignment_expression (parser);
13722 return build_throw (expression);
13725 /* GNU Extensions */
13727 /* Parse an (optional) asm-specification.
13730 asm ( string-literal )
13732 If the asm-specification is present, returns a STRING_CST
13733 corresponding to the string-literal. Otherwise, returns
13737 cp_parser_asm_specification_opt (cp_parser* parser)
13740 tree asm_specification;
13742 /* Peek at the next token. */
13743 token = cp_lexer_peek_token (parser->lexer);
13744 /* If the next token isn't the `asm' keyword, then there's no
13745 asm-specification. */
13746 if (!cp_parser_is_keyword (token, RID_ASM))
13749 /* Consume the `asm' token. */
13750 cp_lexer_consume_token (parser->lexer);
13751 /* Look for the `('. */
13752 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13754 /* Look for the string-literal. */
13755 asm_specification = cp_parser_string_literal (parser, false, false);
13757 /* Look for the `)'. */
13758 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
13760 return asm_specification;
13763 /* Parse an asm-operand-list.
13767 asm-operand-list , asm-operand
13770 string-literal ( expression )
13771 [ string-literal ] string-literal ( expression )
13773 Returns a TREE_LIST representing the operands. The TREE_VALUE of
13774 each node is the expression. The TREE_PURPOSE is itself a
13775 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
13776 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
13777 is a STRING_CST for the string literal before the parenthesis. */
13780 cp_parser_asm_operand_list (cp_parser* parser)
13782 tree asm_operands = NULL_TREE;
13786 tree string_literal;
13790 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
13792 /* Consume the `[' token. */
13793 cp_lexer_consume_token (parser->lexer);
13794 /* Read the operand name. */
13795 name = cp_parser_identifier (parser);
13796 if (name != error_mark_node)
13797 name = build_string (IDENTIFIER_LENGTH (name),
13798 IDENTIFIER_POINTER (name));
13799 /* Look for the closing `]'. */
13800 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
13804 /* Look for the string-literal. */
13805 string_literal = cp_parser_string_literal (parser, false, false);
13807 /* Look for the `('. */
13808 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13809 /* Parse the expression. */
13810 expression = cp_parser_expression (parser);
13811 /* Look for the `)'. */
13812 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13814 /* Add this operand to the list. */
13815 asm_operands = tree_cons (build_tree_list (name, string_literal),
13818 /* If the next token is not a `,', there are no more
13820 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13822 /* Consume the `,'. */
13823 cp_lexer_consume_token (parser->lexer);
13826 return nreverse (asm_operands);
13829 /* Parse an asm-clobber-list.
13833 asm-clobber-list , string-literal
13835 Returns a TREE_LIST, indicating the clobbers in the order that they
13836 appeared. The TREE_VALUE of each node is a STRING_CST. */
13839 cp_parser_asm_clobber_list (cp_parser* parser)
13841 tree clobbers = NULL_TREE;
13845 tree string_literal;
13847 /* Look for the string literal. */
13848 string_literal = cp_parser_string_literal (parser, false, false);
13849 /* Add it to the list. */
13850 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
13851 /* If the next token is not a `,', then the list is
13853 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13855 /* Consume the `,' token. */
13856 cp_lexer_consume_token (parser->lexer);
13862 /* Parse an (optional) series of attributes.
13865 attributes attribute
13868 __attribute__ (( attribute-list [opt] ))
13870 The return value is as for cp_parser_attribute_list. */
13873 cp_parser_attributes_opt (cp_parser* parser)
13875 tree attributes = NULL_TREE;
13880 tree attribute_list;
13882 /* Peek at the next token. */
13883 token = cp_lexer_peek_token (parser->lexer);
13884 /* If it's not `__attribute__', then we're done. */
13885 if (token->keyword != RID_ATTRIBUTE)
13888 /* Consume the `__attribute__' keyword. */
13889 cp_lexer_consume_token (parser->lexer);
13890 /* Look for the two `(' tokens. */
13891 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13892 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13894 /* Peek at the next token. */
13895 token = cp_lexer_peek_token (parser->lexer);
13896 if (token->type != CPP_CLOSE_PAREN)
13897 /* Parse the attribute-list. */
13898 attribute_list = cp_parser_attribute_list (parser);
13900 /* If the next token is a `)', then there is no attribute
13902 attribute_list = NULL;
13904 /* Look for the two `)' tokens. */
13905 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13906 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13908 /* Add these new attributes to the list. */
13909 attributes = chainon (attributes, attribute_list);
13915 /* Parse an attribute-list.
13919 attribute-list , attribute
13923 identifier ( identifier )
13924 identifier ( identifier , expression-list )
13925 identifier ( expression-list )
13927 Returns a TREE_LIST. Each node corresponds to an attribute. THe
13928 TREE_PURPOSE of each node is the identifier indicating which
13929 attribute is in use. The TREE_VALUE represents the arguments, if
13933 cp_parser_attribute_list (cp_parser* parser)
13935 tree attribute_list = NULL_TREE;
13936 bool save_translate_strings_p = parser->translate_strings_p;
13938 parser->translate_strings_p = false;
13945 /* Look for the identifier. We also allow keywords here; for
13946 example `__attribute__ ((const))' is legal. */
13947 token = cp_lexer_peek_token (parser->lexer);
13948 if (token->type != CPP_NAME
13949 && token->type != CPP_KEYWORD)
13950 return error_mark_node;
13951 /* Consume the token. */
13952 token = cp_lexer_consume_token (parser->lexer);
13954 /* Save away the identifier that indicates which attribute this is. */
13955 identifier = token->value;
13956 attribute = build_tree_list (identifier, NULL_TREE);
13958 /* Peek at the next token. */
13959 token = cp_lexer_peek_token (parser->lexer);
13960 /* If it's an `(', then parse the attribute arguments. */
13961 if (token->type == CPP_OPEN_PAREN)
13965 arguments = (cp_parser_parenthesized_expression_list
13966 (parser, true, /*non_constant_p=*/NULL));
13967 /* Save the identifier and arguments away. */
13968 TREE_VALUE (attribute) = arguments;
13971 /* Add this attribute to the list. */
13972 TREE_CHAIN (attribute) = attribute_list;
13973 attribute_list = attribute;
13975 /* Now, look for more attributes. */
13976 token = cp_lexer_peek_token (parser->lexer);
13977 /* If the next token isn't a `,', we're done. */
13978 if (token->type != CPP_COMMA)
13981 /* Consume the comma and keep going. */
13982 cp_lexer_consume_token (parser->lexer);
13984 parser->translate_strings_p = save_translate_strings_p;
13986 /* We built up the list in reverse order. */
13987 return nreverse (attribute_list);
13990 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
13991 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
13992 current value of the PEDANTIC flag, regardless of whether or not
13993 the `__extension__' keyword is present. The caller is responsible
13994 for restoring the value of the PEDANTIC flag. */
13997 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
13999 /* Save the old value of the PEDANTIC flag. */
14000 *saved_pedantic = pedantic;
14002 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
14004 /* Consume the `__extension__' token. */
14005 cp_lexer_consume_token (parser->lexer);
14006 /* We're not being pedantic while the `__extension__' keyword is
14016 /* Parse a label declaration.
14019 __label__ label-declarator-seq ;
14021 label-declarator-seq:
14022 identifier , label-declarator-seq
14026 cp_parser_label_declaration (cp_parser* parser)
14028 /* Look for the `__label__' keyword. */
14029 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
14035 /* Look for an identifier. */
14036 identifier = cp_parser_identifier (parser);
14037 /* Declare it as a lobel. */
14038 finish_label_decl (identifier);
14039 /* If the next token is a `;', stop. */
14040 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14042 /* Look for the `,' separating the label declarations. */
14043 cp_parser_require (parser, CPP_COMMA, "`,'");
14046 /* Look for the final `;'. */
14047 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14050 /* Support Functions */
14052 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
14053 NAME should have one of the representations used for an
14054 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
14055 is returned. If PARSER->SCOPE is a dependent type, then a
14056 SCOPE_REF is returned.
14058 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
14059 returned; the name was already resolved when the TEMPLATE_ID_EXPR
14060 was formed. Abstractly, such entities should not be passed to this
14061 function, because they do not need to be looked up, but it is
14062 simpler to check for this special case here, rather than at the
14065 In cases not explicitly covered above, this function returns a
14066 DECL, OVERLOAD, or baselink representing the result of the lookup.
14067 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
14070 If TAG_TYPE is not NONE_TYPE, it inidcates an explicit type keyword
14071 (e.g., "struct") that was used. In that case bindings that do not
14072 refer to types are ignored.
14074 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
14077 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
14080 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
14083 If AMBIGUOUS_P is non-NULL, it is set to true if name-lookup
14084 results in an ambiguity, and false otherwise. */
14087 cp_parser_lookup_name (cp_parser *parser, tree name,
14088 enum tag_types tag_type,
14089 bool is_template, bool is_namespace,
14090 bool check_dependency,
14094 tree object_type = parser->context->object_type;
14096 /* Assume that the lookup will be unambiguous. */
14098 *ambiguous_p = false;
14100 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
14101 no longer valid. Note that if we are parsing tentatively, and
14102 the parse fails, OBJECT_TYPE will be automatically restored. */
14103 parser->context->object_type = NULL_TREE;
14105 if (name == error_mark_node)
14106 return error_mark_node;
14108 /* A template-id has already been resolved; there is no lookup to
14110 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
14112 if (BASELINK_P (name))
14114 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
14115 == TEMPLATE_ID_EXPR);
14119 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
14120 it should already have been checked to make sure that the name
14121 used matches the type being destroyed. */
14122 if (TREE_CODE (name) == BIT_NOT_EXPR)
14126 /* Figure out to which type this destructor applies. */
14128 type = parser->scope;
14129 else if (object_type)
14130 type = object_type;
14132 type = current_class_type;
14133 /* If that's not a class type, there is no destructor. */
14134 if (!type || !CLASS_TYPE_P (type))
14135 return error_mark_node;
14136 if (!CLASSTYPE_DESTRUCTORS (type))
14137 return error_mark_node;
14138 /* If it was a class type, return the destructor. */
14139 return CLASSTYPE_DESTRUCTORS (type);
14142 /* By this point, the NAME should be an ordinary identifier. If
14143 the id-expression was a qualified name, the qualifying scope is
14144 stored in PARSER->SCOPE at this point. */
14145 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
14147 /* Perform the lookup. */
14152 if (parser->scope == error_mark_node)
14153 return error_mark_node;
14155 /* If the SCOPE is dependent, the lookup must be deferred until
14156 the template is instantiated -- unless we are explicitly
14157 looking up names in uninstantiated templates. Even then, we
14158 cannot look up the name if the scope is not a class type; it
14159 might, for example, be a template type parameter. */
14160 dependent_p = (TYPE_P (parser->scope)
14161 && !(parser->in_declarator_p
14162 && currently_open_class (parser->scope))
14163 && dependent_type_p (parser->scope));
14164 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
14171 /* The resolution to Core Issue 180 says that `struct
14172 A::B' should be considered a type-name, even if `A'
14174 type = make_typename_type (parser->scope, name, tag_type,
14176 if (tag_type == enum_type)
14177 TYPENAME_IS_ENUM_P (type) = 1;
14178 else if (tag_type != typename_type)
14179 TYPENAME_IS_CLASS_P (type) = 1;
14180 decl = TYPE_NAME (type);
14182 else if (is_template)
14183 decl = make_unbound_class_template (parser->scope,
14187 decl = build_nt (SCOPE_REF, parser->scope, name);
14191 bool pop_p = false;
14193 /* If PARSER->SCOPE is a dependent type, then it must be a
14194 class type, and we must not be checking dependencies;
14195 otherwise, we would have processed this lookup above. So
14196 that PARSER->SCOPE is not considered a dependent base by
14197 lookup_member, we must enter the scope here. */
14199 pop_p = push_scope (parser->scope);
14200 /* If the PARSER->SCOPE is a a template specialization, it
14201 may be instantiated during name lookup. In that case,
14202 errors may be issued. Even if we rollback the current
14203 tentative parse, those errors are valid. */
14204 decl = lookup_qualified_name (parser->scope, name,
14205 tag_type != none_type,
14206 /*complain=*/true);
14208 pop_scope (parser->scope);
14210 parser->qualifying_scope = parser->scope;
14211 parser->object_scope = NULL_TREE;
14213 else if (object_type)
14215 tree object_decl = NULL_TREE;
14216 /* Look up the name in the scope of the OBJECT_TYPE, unless the
14217 OBJECT_TYPE is not a class. */
14218 if (CLASS_TYPE_P (object_type))
14219 /* If the OBJECT_TYPE is a template specialization, it may
14220 be instantiated during name lookup. In that case, errors
14221 may be issued. Even if we rollback the current tentative
14222 parse, those errors are valid. */
14223 object_decl = lookup_member (object_type,
14226 tag_type != none_type);
14227 /* Look it up in the enclosing context, too. */
14228 decl = lookup_name_real (name, tag_type != none_type,
14230 /*block_p=*/true, is_namespace,
14232 parser->object_scope = object_type;
14233 parser->qualifying_scope = NULL_TREE;
14235 decl = object_decl;
14239 decl = lookup_name_real (name, tag_type != none_type,
14241 /*block_p=*/true, is_namespace,
14243 parser->qualifying_scope = NULL_TREE;
14244 parser->object_scope = NULL_TREE;
14247 /* If the lookup failed, let our caller know. */
14249 || decl == error_mark_node
14250 || (TREE_CODE (decl) == FUNCTION_DECL
14251 && DECL_ANTICIPATED (decl)))
14252 return error_mark_node;
14254 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
14255 if (TREE_CODE (decl) == TREE_LIST)
14258 *ambiguous_p = true;
14259 /* The error message we have to print is too complicated for
14260 cp_parser_error, so we incorporate its actions directly. */
14261 if (!cp_parser_simulate_error (parser))
14263 error ("reference to %qD is ambiguous", name);
14264 print_candidates (decl);
14266 return error_mark_node;
14269 gcc_assert (DECL_P (decl)
14270 || TREE_CODE (decl) == OVERLOAD
14271 || TREE_CODE (decl) == SCOPE_REF
14272 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
14273 || BASELINK_P (decl));
14275 /* If we have resolved the name of a member declaration, check to
14276 see if the declaration is accessible. When the name resolves to
14277 set of overloaded functions, accessibility is checked when
14278 overload resolution is done.
14280 During an explicit instantiation, access is not checked at all,
14281 as per [temp.explicit]. */
14283 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
14288 /* Like cp_parser_lookup_name, but for use in the typical case where
14289 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
14290 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
14293 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
14295 return cp_parser_lookup_name (parser, name,
14297 /*is_template=*/false,
14298 /*is_namespace=*/false,
14299 /*check_dependency=*/true,
14300 /*ambiguous_p=*/NULL);
14303 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
14304 the current context, return the TYPE_DECL. If TAG_NAME_P is
14305 true, the DECL indicates the class being defined in a class-head,
14306 or declared in an elaborated-type-specifier.
14308 Otherwise, return DECL. */
14311 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
14313 /* If the TEMPLATE_DECL is being declared as part of a class-head,
14314 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
14317 template <typename T> struct B;
14320 template <typename T> struct A::B {};
14322 Similarly, in a elaborated-type-specifier:
14324 namespace N { struct X{}; }
14327 template <typename T> friend struct N::X;
14330 However, if the DECL refers to a class type, and we are in
14331 the scope of the class, then the name lookup automatically
14332 finds the TYPE_DECL created by build_self_reference rather
14333 than a TEMPLATE_DECL. For example, in:
14335 template <class T> struct S {
14339 there is no need to handle such case. */
14341 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
14342 return DECL_TEMPLATE_RESULT (decl);
14347 /* If too many, or too few, template-parameter lists apply to the
14348 declarator, issue an error message. Returns TRUE if all went well,
14349 and FALSE otherwise. */
14352 cp_parser_check_declarator_template_parameters (cp_parser* parser,
14353 cp_declarator *declarator)
14355 unsigned num_templates;
14357 /* We haven't seen any classes that involve template parameters yet. */
14360 switch (declarator->kind)
14363 if (TREE_CODE (declarator->u.id.name) == SCOPE_REF)
14368 scope = TREE_OPERAND (declarator->u.id.name, 0);
14369 member = TREE_OPERAND (declarator->u.id.name, 1);
14371 while (scope && CLASS_TYPE_P (scope))
14373 /* You're supposed to have one `template <...>'
14374 for every template class, but you don't need one
14375 for a full specialization. For example:
14377 template <class T> struct S{};
14378 template <> struct S<int> { void f(); };
14379 void S<int>::f () {}
14381 is correct; there shouldn't be a `template <>' for
14382 the definition of `S<int>::f'. */
14383 if (CLASSTYPE_TEMPLATE_INFO (scope)
14384 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope)
14385 || uses_template_parms (CLASSTYPE_TI_ARGS (scope)))
14386 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
14389 scope = TYPE_CONTEXT (scope);
14393 /* If the DECLARATOR has the form `X<y>' then it uses one
14394 additional level of template parameters. */
14395 if (TREE_CODE (declarator->u.id.name) == TEMPLATE_ID_EXPR)
14398 return cp_parser_check_template_parameters (parser,
14404 case cdk_reference:
14406 return (cp_parser_check_declarator_template_parameters
14407 (parser, declarator->declarator));
14413 gcc_unreachable ();
14418 /* NUM_TEMPLATES were used in the current declaration. If that is
14419 invalid, return FALSE and issue an error messages. Otherwise,
14423 cp_parser_check_template_parameters (cp_parser* parser,
14424 unsigned num_templates)
14426 /* If there are more template classes than parameter lists, we have
14429 template <class T> void S<T>::R<T>::f (); */
14430 if (parser->num_template_parameter_lists < num_templates)
14432 error ("too few template-parameter-lists");
14435 /* If there are the same number of template classes and parameter
14436 lists, that's OK. */
14437 if (parser->num_template_parameter_lists == num_templates)
14439 /* If there are more, but only one more, then we are referring to a
14440 member template. That's OK too. */
14441 if (parser->num_template_parameter_lists == num_templates + 1)
14443 /* Otherwise, there are too many template parameter lists. We have
14446 template <class T> template <class U> void S::f(); */
14447 error ("too many template-parameter-lists");
14451 /* Parse an optional `::' token indicating that the following name is
14452 from the global namespace. If so, PARSER->SCOPE is set to the
14453 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
14454 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
14455 Returns the new value of PARSER->SCOPE, if the `::' token is
14456 present, and NULL_TREE otherwise. */
14459 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
14463 /* Peek at the next token. */
14464 token = cp_lexer_peek_token (parser->lexer);
14465 /* If we're looking at a `::' token then we're starting from the
14466 global namespace, not our current location. */
14467 if (token->type == CPP_SCOPE)
14469 /* Consume the `::' token. */
14470 cp_lexer_consume_token (parser->lexer);
14471 /* Set the SCOPE so that we know where to start the lookup. */
14472 parser->scope = global_namespace;
14473 parser->qualifying_scope = global_namespace;
14474 parser->object_scope = NULL_TREE;
14476 return parser->scope;
14478 else if (!current_scope_valid_p)
14480 parser->scope = NULL_TREE;
14481 parser->qualifying_scope = NULL_TREE;
14482 parser->object_scope = NULL_TREE;
14488 /* Returns TRUE if the upcoming token sequence is the start of a
14489 constructor declarator. If FRIEND_P is true, the declarator is
14490 preceded by the `friend' specifier. */
14493 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
14495 bool constructor_p;
14496 tree type_decl = NULL_TREE;
14497 bool nested_name_p;
14498 cp_token *next_token;
14500 /* The common case is that this is not a constructor declarator, so
14501 try to avoid doing lots of work if at all possible. It's not
14502 valid declare a constructor at function scope. */
14503 if (at_function_scope_p ())
14505 /* And only certain tokens can begin a constructor declarator. */
14506 next_token = cp_lexer_peek_token (parser->lexer);
14507 if (next_token->type != CPP_NAME
14508 && next_token->type != CPP_SCOPE
14509 && next_token->type != CPP_NESTED_NAME_SPECIFIER
14510 && next_token->type != CPP_TEMPLATE_ID)
14513 /* Parse tentatively; we are going to roll back all of the tokens
14515 cp_parser_parse_tentatively (parser);
14516 /* Assume that we are looking at a constructor declarator. */
14517 constructor_p = true;
14519 /* Look for the optional `::' operator. */
14520 cp_parser_global_scope_opt (parser,
14521 /*current_scope_valid_p=*/false);
14522 /* Look for the nested-name-specifier. */
14524 = (cp_parser_nested_name_specifier_opt (parser,
14525 /*typename_keyword_p=*/false,
14526 /*check_dependency_p=*/false,
14528 /*is_declaration=*/false)
14530 /* Outside of a class-specifier, there must be a
14531 nested-name-specifier. */
14532 if (!nested_name_p &&
14533 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
14535 constructor_p = false;
14536 /* If we still think that this might be a constructor-declarator,
14537 look for a class-name. */
14542 template <typename T> struct S { S(); };
14543 template <typename T> S<T>::S ();
14545 we must recognize that the nested `S' names a class.
14548 template <typename T> S<T>::S<T> ();
14550 we must recognize that the nested `S' names a template. */
14551 type_decl = cp_parser_class_name (parser,
14552 /*typename_keyword_p=*/false,
14553 /*template_keyword_p=*/false,
14555 /*check_dependency_p=*/false,
14556 /*class_head_p=*/false,
14557 /*is_declaration=*/false);
14558 /* If there was no class-name, then this is not a constructor. */
14559 constructor_p = !cp_parser_error_occurred (parser);
14562 /* If we're still considering a constructor, we have to see a `(',
14563 to begin the parameter-declaration-clause, followed by either a
14564 `)', an `...', or a decl-specifier. We need to check for a
14565 type-specifier to avoid being fooled into thinking that:
14569 is a constructor. (It is actually a function named `f' that
14570 takes one parameter (of type `int') and returns a value of type
14573 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
14575 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
14576 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
14577 /* A parameter declaration begins with a decl-specifier,
14578 which is either the "attribute" keyword, a storage class
14579 specifier, or (usually) a type-specifier. */
14580 && !cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE)
14581 && !cp_parser_storage_class_specifier_opt (parser))
14584 bool pop_p = false;
14585 unsigned saved_num_template_parameter_lists;
14587 /* Names appearing in the type-specifier should be looked up
14588 in the scope of the class. */
14589 if (current_class_type)
14593 type = TREE_TYPE (type_decl);
14594 if (TREE_CODE (type) == TYPENAME_TYPE)
14596 type = resolve_typename_type (type,
14597 /*only_current_p=*/false);
14598 if (type == error_mark_node)
14600 cp_parser_abort_tentative_parse (parser);
14604 pop_p = push_scope (type);
14607 /* Inside the constructor parameter list, surrounding
14608 template-parameter-lists do not apply. */
14609 saved_num_template_parameter_lists
14610 = parser->num_template_parameter_lists;
14611 parser->num_template_parameter_lists = 0;
14613 /* Look for the type-specifier. */
14614 cp_parser_type_specifier (parser,
14615 CP_PARSER_FLAGS_NONE,
14616 /*decl_specs=*/NULL,
14617 /*is_declarator=*/true,
14618 /*declares_class_or_enum=*/NULL,
14619 /*is_cv_qualifier=*/NULL);
14621 parser->num_template_parameter_lists
14622 = saved_num_template_parameter_lists;
14624 /* Leave the scope of the class. */
14628 constructor_p = !cp_parser_error_occurred (parser);
14632 constructor_p = false;
14633 /* We did not really want to consume any tokens. */
14634 cp_parser_abort_tentative_parse (parser);
14636 return constructor_p;
14639 /* Parse the definition of the function given by the DECL_SPECIFIERS,
14640 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
14641 they must be performed once we are in the scope of the function.
14643 Returns the function defined. */
14646 cp_parser_function_definition_from_specifiers_and_declarator
14647 (cp_parser* parser,
14648 cp_decl_specifier_seq *decl_specifiers,
14650 const cp_declarator *declarator)
14655 /* Begin the function-definition. */
14656 success_p = start_function (decl_specifiers, declarator, attributes);
14658 /* The things we're about to see are not directly qualified by any
14659 template headers we've seen thus far. */
14660 reset_specialization ();
14662 /* If there were names looked up in the decl-specifier-seq that we
14663 did not check, check them now. We must wait until we are in the
14664 scope of the function to perform the checks, since the function
14665 might be a friend. */
14666 perform_deferred_access_checks ();
14670 /* Skip the entire function. */
14671 error ("invalid function declaration");
14672 cp_parser_skip_to_end_of_block_or_statement (parser);
14673 fn = error_mark_node;
14676 fn = cp_parser_function_definition_after_declarator (parser,
14677 /*inline_p=*/false);
14682 /* Parse the part of a function-definition that follows the
14683 declarator. INLINE_P is TRUE iff this function is an inline
14684 function defined with a class-specifier.
14686 Returns the function defined. */
14689 cp_parser_function_definition_after_declarator (cp_parser* parser,
14693 bool ctor_initializer_p = false;
14694 bool saved_in_unbraced_linkage_specification_p;
14695 unsigned saved_num_template_parameter_lists;
14697 /* If the next token is `return', then the code may be trying to
14698 make use of the "named return value" extension that G++ used to
14700 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
14702 /* Consume the `return' keyword. */
14703 cp_lexer_consume_token (parser->lexer);
14704 /* Look for the identifier that indicates what value is to be
14706 cp_parser_identifier (parser);
14707 /* Issue an error message. */
14708 error ("named return values are no longer supported");
14709 /* Skip tokens until we reach the start of the function body. */
14710 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
14711 && cp_lexer_next_token_is_not (parser->lexer, CPP_EOF))
14712 cp_lexer_consume_token (parser->lexer);
14714 /* The `extern' in `extern "C" void f () { ... }' does not apply to
14715 anything declared inside `f'. */
14716 saved_in_unbraced_linkage_specification_p
14717 = parser->in_unbraced_linkage_specification_p;
14718 parser->in_unbraced_linkage_specification_p = false;
14719 /* Inside the function, surrounding template-parameter-lists do not
14721 saved_num_template_parameter_lists
14722 = parser->num_template_parameter_lists;
14723 parser->num_template_parameter_lists = 0;
14724 /* If the next token is `try', then we are looking at a
14725 function-try-block. */
14726 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
14727 ctor_initializer_p = cp_parser_function_try_block (parser);
14728 /* A function-try-block includes the function-body, so we only do
14729 this next part if we're not processing a function-try-block. */
14732 = cp_parser_ctor_initializer_opt_and_function_body (parser);
14734 /* Finish the function. */
14735 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
14736 (inline_p ? 2 : 0));
14737 /* Generate code for it, if necessary. */
14738 expand_or_defer_fn (fn);
14739 /* Restore the saved values. */
14740 parser->in_unbraced_linkage_specification_p
14741 = saved_in_unbraced_linkage_specification_p;
14742 parser->num_template_parameter_lists
14743 = saved_num_template_parameter_lists;
14748 /* Parse a template-declaration, assuming that the `export' (and
14749 `extern') keywords, if present, has already been scanned. MEMBER_P
14750 is as for cp_parser_template_declaration. */
14753 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
14755 tree decl = NULL_TREE;
14756 tree parameter_list;
14757 bool friend_p = false;
14759 /* Look for the `template' keyword. */
14760 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
14764 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
14767 /* If the next token is `>', then we have an invalid
14768 specialization. Rather than complain about an invalid template
14769 parameter, issue an error message here. */
14770 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
14772 cp_parser_error (parser, "invalid explicit specialization");
14773 begin_specialization ();
14774 parameter_list = NULL_TREE;
14778 /* Parse the template parameters. */
14779 begin_template_parm_list ();
14780 parameter_list = cp_parser_template_parameter_list (parser);
14781 parameter_list = end_template_parm_list (parameter_list);
14784 /* Look for the `>'. */
14785 cp_parser_skip_until_found (parser, CPP_GREATER, "`>'");
14786 /* We just processed one more parameter list. */
14787 ++parser->num_template_parameter_lists;
14788 /* If the next token is `template', there are more template
14790 if (cp_lexer_next_token_is_keyword (parser->lexer,
14792 cp_parser_template_declaration_after_export (parser, member_p);
14795 /* There are no access checks when parsing a template, as we do not
14796 know if a specialization will be a friend. */
14797 push_deferring_access_checks (dk_no_check);
14799 decl = cp_parser_single_declaration (parser,
14803 pop_deferring_access_checks ();
14805 /* If this is a member template declaration, let the front
14807 if (member_p && !friend_p && decl)
14809 if (TREE_CODE (decl) == TYPE_DECL)
14810 cp_parser_check_access_in_redeclaration (decl);
14812 decl = finish_member_template_decl (decl);
14814 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
14815 make_friend_class (current_class_type, TREE_TYPE (decl),
14816 /*complain=*/true);
14818 /* We are done with the current parameter list. */
14819 --parser->num_template_parameter_lists;
14822 finish_template_decl (parameter_list);
14824 /* Register member declarations. */
14825 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
14826 finish_member_declaration (decl);
14828 /* If DECL is a function template, we must return to parse it later.
14829 (Even though there is no definition, there might be default
14830 arguments that need handling.) */
14831 if (member_p && decl
14832 && (TREE_CODE (decl) == FUNCTION_DECL
14833 || DECL_FUNCTION_TEMPLATE_P (decl)))
14834 TREE_VALUE (parser->unparsed_functions_queues)
14835 = tree_cons (NULL_TREE, decl,
14836 TREE_VALUE (parser->unparsed_functions_queues));
14839 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
14840 `function-definition' sequence. MEMBER_P is true, this declaration
14841 appears in a class scope.
14843 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
14844 *FRIEND_P is set to TRUE iff the declaration is a friend. */
14847 cp_parser_single_declaration (cp_parser* parser,
14851 int declares_class_or_enum;
14852 tree decl = NULL_TREE;
14853 cp_decl_specifier_seq decl_specifiers;
14854 bool function_definition_p = false;
14856 /* This function is only used when processing a template
14858 gcc_assert (innermost_scope_kind () == sk_template_parms
14859 || innermost_scope_kind () == sk_template_spec);
14861 /* Defer access checks until we know what is being declared. */
14862 push_deferring_access_checks (dk_deferred);
14864 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
14866 cp_parser_decl_specifier_seq (parser,
14867 CP_PARSER_FLAGS_OPTIONAL,
14869 &declares_class_or_enum);
14871 *friend_p = cp_parser_friend_p (&decl_specifiers);
14873 /* There are no template typedefs. */
14874 if (decl_specifiers.specs[(int) ds_typedef])
14876 error ("template declaration of %qs", "typedef");
14877 decl = error_mark_node;
14880 /* Gather up the access checks that occurred the
14881 decl-specifier-seq. */
14882 stop_deferring_access_checks ();
14884 /* Check for the declaration of a template class. */
14885 if (declares_class_or_enum)
14887 if (cp_parser_declares_only_class_p (parser))
14889 decl = shadow_tag (&decl_specifiers);
14894 friend template <typename T> struct A<T>::B;
14897 A<T>::B will be represented by a TYPENAME_TYPE, and
14898 therefore not recognized by shadow_tag. */
14899 if (friend_p && *friend_p
14901 && decl_specifiers.type
14902 && TYPE_P (decl_specifiers.type))
14903 decl = decl_specifiers.type;
14905 if (decl && decl != error_mark_node)
14906 decl = TYPE_NAME (decl);
14908 decl = error_mark_node;
14911 /* If it's not a template class, try for a template function. If
14912 the next token is a `;', then this declaration does not declare
14913 anything. But, if there were errors in the decl-specifiers, then
14914 the error might well have come from an attempted class-specifier.
14915 In that case, there's no need to warn about a missing declarator. */
14917 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
14918 || decl_specifiers.type != error_mark_node))
14919 decl = cp_parser_init_declarator (parser,
14921 /*function_definition_allowed_p=*/true,
14923 declares_class_or_enum,
14924 &function_definition_p);
14926 pop_deferring_access_checks ();
14928 /* Clear any current qualification; whatever comes next is the start
14929 of something new. */
14930 parser->scope = NULL_TREE;
14931 parser->qualifying_scope = NULL_TREE;
14932 parser->object_scope = NULL_TREE;
14933 /* Look for a trailing `;' after the declaration. */
14934 if (!function_definition_p
14935 && (decl == error_mark_node
14936 || !cp_parser_require (parser, CPP_SEMICOLON, "`;'")))
14937 cp_parser_skip_to_end_of_block_or_statement (parser);
14942 /* Parse a cast-expression that is not the operand of a unary "&". */
14945 cp_parser_simple_cast_expression (cp_parser *parser)
14947 return cp_parser_cast_expression (parser, /*address_p=*/false);
14950 /* Parse a functional cast to TYPE. Returns an expression
14951 representing the cast. */
14954 cp_parser_functional_cast (cp_parser* parser, tree type)
14956 tree expression_list;
14960 = cp_parser_parenthesized_expression_list (parser, false,
14961 /*non_constant_p=*/NULL);
14963 cast = build_functional_cast (type, expression_list);
14964 /* [expr.const]/1: In an integral constant expression "only type
14965 conversions to integral or enumeration type can be used". */
14966 if (cast != error_mark_node && !type_dependent_expression_p (type)
14967 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (type)))
14969 if (cp_parser_non_integral_constant_expression
14970 (parser, "a call to a constructor"))
14971 return error_mark_node;
14976 /* Save the tokens that make up the body of a member function defined
14977 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
14978 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
14979 specifiers applied to the declaration. Returns the FUNCTION_DECL
14980 for the member function. */
14983 cp_parser_save_member_function_body (cp_parser* parser,
14984 cp_decl_specifier_seq *decl_specifiers,
14985 cp_declarator *declarator,
14992 /* Create the function-declaration. */
14993 fn = start_method (decl_specifiers, declarator, attributes);
14994 /* If something went badly wrong, bail out now. */
14995 if (fn == error_mark_node)
14997 /* If there's a function-body, skip it. */
14998 if (cp_parser_token_starts_function_definition_p
14999 (cp_lexer_peek_token (parser->lexer)))
15000 cp_parser_skip_to_end_of_block_or_statement (parser);
15001 return error_mark_node;
15004 /* Remember it, if there default args to post process. */
15005 cp_parser_save_default_args (parser, fn);
15007 /* Save away the tokens that make up the body of the
15009 first = parser->lexer->next_token;
15010 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15011 /* Handle function try blocks. */
15012 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
15013 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15014 last = parser->lexer->next_token;
15016 /* Save away the inline definition; we will process it when the
15017 class is complete. */
15018 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
15019 DECL_PENDING_INLINE_P (fn) = 1;
15021 /* We need to know that this was defined in the class, so that
15022 friend templates are handled correctly. */
15023 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
15025 /* We're done with the inline definition. */
15026 finish_method (fn);
15028 /* Add FN to the queue of functions to be parsed later. */
15029 TREE_VALUE (parser->unparsed_functions_queues)
15030 = tree_cons (NULL_TREE, fn,
15031 TREE_VALUE (parser->unparsed_functions_queues));
15036 /* Parse a template-argument-list, as well as the trailing ">" (but
15037 not the opening ">"). See cp_parser_template_argument_list for the
15041 cp_parser_enclosed_template_argument_list (cp_parser* parser)
15045 tree saved_qualifying_scope;
15046 tree saved_object_scope;
15047 bool saved_greater_than_is_operator_p;
15051 When parsing a template-id, the first non-nested `>' is taken as
15052 the end of the template-argument-list rather than a greater-than
15054 saved_greater_than_is_operator_p
15055 = parser->greater_than_is_operator_p;
15056 parser->greater_than_is_operator_p = false;
15057 /* Parsing the argument list may modify SCOPE, so we save it
15059 saved_scope = parser->scope;
15060 saved_qualifying_scope = parser->qualifying_scope;
15061 saved_object_scope = parser->object_scope;
15062 /* Parse the template-argument-list itself. */
15063 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15064 arguments = NULL_TREE;
15066 arguments = cp_parser_template_argument_list (parser);
15067 /* Look for the `>' that ends the template-argument-list. If we find
15068 a '>>' instead, it's probably just a typo. */
15069 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
15071 if (!saved_greater_than_is_operator_p)
15073 /* If we're in a nested template argument list, the '>>' has
15074 to be a typo for '> >'. We emit the error message, but we
15075 continue parsing and we push a '>' as next token, so that
15076 the argument list will be parsed correctly. Note that the
15077 global source location is still on the token before the
15078 '>>', so we need to say explicitly where we want it. */
15079 cp_token *token = cp_lexer_peek_token (parser->lexer);
15080 error ("%H%<>>%> should be %<> >%> "
15081 "within a nested template argument list",
15084 /* ??? Proper recovery should terminate two levels of
15085 template argument list here. */
15086 token->type = CPP_GREATER;
15090 /* If this is not a nested template argument list, the '>>'
15091 is a typo for '>'. Emit an error message and continue.
15092 Same deal about the token location, but here we can get it
15093 right by consuming the '>>' before issuing the diagnostic. */
15094 cp_lexer_consume_token (parser->lexer);
15095 error ("spurious %<>>%>, use %<>%> to terminate "
15096 "a template argument list");
15099 else if (!cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15100 error ("missing %<>%> to terminate the template argument list");
15102 /* It's what we want, a '>'; consume it. */
15103 cp_lexer_consume_token (parser->lexer);
15104 /* The `>' token might be a greater-than operator again now. */
15105 parser->greater_than_is_operator_p
15106 = saved_greater_than_is_operator_p;
15107 /* Restore the SAVED_SCOPE. */
15108 parser->scope = saved_scope;
15109 parser->qualifying_scope = saved_qualifying_scope;
15110 parser->object_scope = saved_object_scope;
15115 /* MEMBER_FUNCTION is a member function, or a friend. If default
15116 arguments, or the body of the function have not yet been parsed,
15120 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
15122 /* If this member is a template, get the underlying
15124 if (DECL_FUNCTION_TEMPLATE_P (member_function))
15125 member_function = DECL_TEMPLATE_RESULT (member_function);
15127 /* There should not be any class definitions in progress at this
15128 point; the bodies of members are only parsed outside of all class
15130 gcc_assert (parser->num_classes_being_defined == 0);
15131 /* While we're parsing the member functions we might encounter more
15132 classes. We want to handle them right away, but we don't want
15133 them getting mixed up with functions that are currently in the
15135 parser->unparsed_functions_queues
15136 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15138 /* Make sure that any template parameters are in scope. */
15139 maybe_begin_member_template_processing (member_function);
15141 /* If the body of the function has not yet been parsed, parse it
15143 if (DECL_PENDING_INLINE_P (member_function))
15145 tree function_scope;
15146 cp_token_cache *tokens;
15148 /* The function is no longer pending; we are processing it. */
15149 tokens = DECL_PENDING_INLINE_INFO (member_function);
15150 DECL_PENDING_INLINE_INFO (member_function) = NULL;
15151 DECL_PENDING_INLINE_P (member_function) = 0;
15152 /* If this was an inline function in a local class, enter the scope
15153 of the containing function. */
15154 function_scope = decl_function_context (member_function);
15155 if (function_scope)
15156 push_function_context_to (function_scope);
15158 /* Push the body of the function onto the lexer stack. */
15159 cp_parser_push_lexer_for_tokens (parser, tokens);
15161 /* Let the front end know that we going to be defining this
15163 start_preparsed_function (member_function, NULL_TREE,
15164 SF_PRE_PARSED | SF_INCLASS_INLINE);
15166 /* Now, parse the body of the function. */
15167 cp_parser_function_definition_after_declarator (parser,
15168 /*inline_p=*/true);
15170 /* Leave the scope of the containing function. */
15171 if (function_scope)
15172 pop_function_context_from (function_scope);
15173 cp_parser_pop_lexer (parser);
15176 /* Remove any template parameters from the symbol table. */
15177 maybe_end_member_template_processing ();
15179 /* Restore the queue. */
15180 parser->unparsed_functions_queues
15181 = TREE_CHAIN (parser->unparsed_functions_queues);
15184 /* If DECL contains any default args, remember it on the unparsed
15185 functions queue. */
15188 cp_parser_save_default_args (cp_parser* parser, tree decl)
15192 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
15194 probe = TREE_CHAIN (probe))
15195 if (TREE_PURPOSE (probe))
15197 TREE_PURPOSE (parser->unparsed_functions_queues)
15198 = tree_cons (current_class_type, decl,
15199 TREE_PURPOSE (parser->unparsed_functions_queues));
15205 /* FN is a FUNCTION_DECL which may contains a parameter with an
15206 unparsed DEFAULT_ARG. Parse the default args now. This function
15207 assumes that the current scope is the scope in which the default
15208 argument should be processed. */
15211 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
15213 bool saved_local_variables_forbidden_p;
15216 /* While we're parsing the default args, we might (due to the
15217 statement expression extension) encounter more classes. We want
15218 to handle them right away, but we don't want them getting mixed
15219 up with default args that are currently in the queue. */
15220 parser->unparsed_functions_queues
15221 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15223 /* Local variable names (and the `this' keyword) may not appear
15224 in a default argument. */
15225 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
15226 parser->local_variables_forbidden_p = true;
15228 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
15230 parm = TREE_CHAIN (parm))
15232 cp_token_cache *tokens;
15234 if (!TREE_PURPOSE (parm)
15235 || TREE_CODE (TREE_PURPOSE (parm)) != DEFAULT_ARG)
15238 /* Push the saved tokens for the default argument onto the parser's
15240 tokens = DEFARG_TOKENS (TREE_PURPOSE (parm));
15241 cp_parser_push_lexer_for_tokens (parser, tokens);
15243 /* Parse the assignment-expression. */
15244 TREE_PURPOSE (parm) = cp_parser_assignment_expression (parser);
15246 /* If the token stream has not been completely used up, then
15247 there was extra junk after the end of the default
15249 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15250 cp_parser_error (parser, "expected %<,%>");
15252 /* Revert to the main lexer. */
15253 cp_parser_pop_lexer (parser);
15256 /* Restore the state of local_variables_forbidden_p. */
15257 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
15259 /* Restore the queue. */
15260 parser->unparsed_functions_queues
15261 = TREE_CHAIN (parser->unparsed_functions_queues);
15264 /* Parse the operand of `sizeof' (or a similar operator). Returns
15265 either a TYPE or an expression, depending on the form of the
15266 input. The KEYWORD indicates which kind of expression we have
15270 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
15272 static const char *format;
15273 tree expr = NULL_TREE;
15274 const char *saved_message;
15275 bool saved_integral_constant_expression_p;
15277 /* Initialize FORMAT the first time we get here. */
15279 format = "types may not be defined in '%s' expressions";
15281 /* Types cannot be defined in a `sizeof' expression. Save away the
15283 saved_message = parser->type_definition_forbidden_message;
15284 /* And create the new one. */
15285 parser->type_definition_forbidden_message
15286 = xmalloc (strlen (format)
15287 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
15289 sprintf ((char *) parser->type_definition_forbidden_message,
15290 format, IDENTIFIER_POINTER (ridpointers[keyword]));
15292 /* The restrictions on constant-expressions do not apply inside
15293 sizeof expressions. */
15294 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
15295 parser->integral_constant_expression_p = false;
15297 /* Do not actually evaluate the expression. */
15299 /* If it's a `(', then we might be looking at the type-id
15301 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
15304 bool saved_in_type_id_in_expr_p;
15306 /* We can't be sure yet whether we're looking at a type-id or an
15308 cp_parser_parse_tentatively (parser);
15309 /* Consume the `('. */
15310 cp_lexer_consume_token (parser->lexer);
15311 /* Parse the type-id. */
15312 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15313 parser->in_type_id_in_expr_p = true;
15314 type = cp_parser_type_id (parser);
15315 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15316 /* Now, look for the trailing `)'. */
15317 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
15318 /* If all went well, then we're done. */
15319 if (cp_parser_parse_definitely (parser))
15321 cp_decl_specifier_seq decl_specs;
15323 /* Build a trivial decl-specifier-seq. */
15324 clear_decl_specs (&decl_specs);
15325 decl_specs.type = type;
15327 /* Call grokdeclarator to figure out what type this is. */
15328 expr = grokdeclarator (NULL,
15332 /*attrlist=*/NULL);
15336 /* If the type-id production did not work out, then we must be
15337 looking at the unary-expression production. */
15339 expr = cp_parser_unary_expression (parser, /*address_p=*/false);
15340 /* Go back to evaluating expressions. */
15343 /* Free the message we created. */
15344 free ((char *) parser->type_definition_forbidden_message);
15345 /* And restore the old one. */
15346 parser->type_definition_forbidden_message = saved_message;
15347 parser->integral_constant_expression_p = saved_integral_constant_expression_p;
15352 /* If the current declaration has no declarator, return true. */
15355 cp_parser_declares_only_class_p (cp_parser *parser)
15357 /* If the next token is a `;' or a `,' then there is no
15359 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15360 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
15363 /* Update the DECL_SPECS to reflect the STORAGE_CLASS. */
15366 cp_parser_set_storage_class (cp_decl_specifier_seq *decl_specs,
15367 cp_storage_class storage_class)
15369 if (decl_specs->storage_class != sc_none)
15370 decl_specs->multiple_storage_classes_p = true;
15372 decl_specs->storage_class = storage_class;
15375 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
15376 is true, the type is a user-defined type; otherwise it is a
15377 built-in type specified by a keyword. */
15380 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
15382 bool user_defined_p)
15384 decl_specs->any_specifiers_p = true;
15386 /* If the user tries to redeclare bool or wchar_t (with, for
15387 example, in "typedef int wchar_t;") we remember that this is what
15388 happened. In system headers, we ignore these declarations so
15389 that G++ can work with system headers that are not C++-safe. */
15390 if (decl_specs->specs[(int) ds_typedef]
15392 && (type_spec == boolean_type_node
15393 || type_spec == wchar_type_node)
15394 && (decl_specs->type
15395 || decl_specs->specs[(int) ds_long]
15396 || decl_specs->specs[(int) ds_short]
15397 || decl_specs->specs[(int) ds_unsigned]
15398 || decl_specs->specs[(int) ds_signed]))
15400 decl_specs->redefined_builtin_type = type_spec;
15401 if (!decl_specs->type)
15403 decl_specs->type = type_spec;
15404 decl_specs->user_defined_type_p = false;
15407 else if (decl_specs->type)
15408 decl_specs->multiple_types_p = true;
15411 decl_specs->type = type_spec;
15412 decl_specs->user_defined_type_p = user_defined_p;
15413 decl_specs->redefined_builtin_type = NULL_TREE;
15417 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
15418 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
15421 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
15423 return decl_specifiers->specs[(int) ds_friend] != 0;
15426 /* If the next token is of the indicated TYPE, consume it. Otherwise,
15427 issue an error message indicating that TOKEN_DESC was expected.
15429 Returns the token consumed, if the token had the appropriate type.
15430 Otherwise, returns NULL. */
15433 cp_parser_require (cp_parser* parser,
15434 enum cpp_ttype type,
15435 const char* token_desc)
15437 if (cp_lexer_next_token_is (parser->lexer, type))
15438 return cp_lexer_consume_token (parser->lexer);
15441 /* Output the MESSAGE -- unless we're parsing tentatively. */
15442 if (!cp_parser_simulate_error (parser))
15444 char *message = concat ("expected ", token_desc, NULL);
15445 cp_parser_error (parser, message);
15452 /* Like cp_parser_require, except that tokens will be skipped until
15453 the desired token is found. An error message is still produced if
15454 the next token is not as expected. */
15457 cp_parser_skip_until_found (cp_parser* parser,
15458 enum cpp_ttype type,
15459 const char* token_desc)
15462 unsigned nesting_depth = 0;
15464 if (cp_parser_require (parser, type, token_desc))
15467 /* Skip tokens until the desired token is found. */
15470 /* Peek at the next token. */
15471 token = cp_lexer_peek_token (parser->lexer);
15472 /* If we've reached the token we want, consume it and
15474 if (token->type == type && !nesting_depth)
15476 cp_lexer_consume_token (parser->lexer);
15479 /* If we've run out of tokens, stop. */
15480 if (token->type == CPP_EOF)
15482 if (token->type == CPP_OPEN_BRACE
15483 || token->type == CPP_OPEN_PAREN
15484 || token->type == CPP_OPEN_SQUARE)
15486 else if (token->type == CPP_CLOSE_BRACE
15487 || token->type == CPP_CLOSE_PAREN
15488 || token->type == CPP_CLOSE_SQUARE)
15490 if (nesting_depth-- == 0)
15493 /* Consume this token. */
15494 cp_lexer_consume_token (parser->lexer);
15498 /* If the next token is the indicated keyword, consume it. Otherwise,
15499 issue an error message indicating that TOKEN_DESC was expected.
15501 Returns the token consumed, if the token had the appropriate type.
15502 Otherwise, returns NULL. */
15505 cp_parser_require_keyword (cp_parser* parser,
15507 const char* token_desc)
15509 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
15511 if (token && token->keyword != keyword)
15513 dyn_string_t error_msg;
15515 /* Format the error message. */
15516 error_msg = dyn_string_new (0);
15517 dyn_string_append_cstr (error_msg, "expected ");
15518 dyn_string_append_cstr (error_msg, token_desc);
15519 cp_parser_error (parser, error_msg->s);
15520 dyn_string_delete (error_msg);
15527 /* Returns TRUE iff TOKEN is a token that can begin the body of a
15528 function-definition. */
15531 cp_parser_token_starts_function_definition_p (cp_token* token)
15533 return (/* An ordinary function-body begins with an `{'. */
15534 token->type == CPP_OPEN_BRACE
15535 /* A ctor-initializer begins with a `:'. */
15536 || token->type == CPP_COLON
15537 /* A function-try-block begins with `try'. */
15538 || token->keyword == RID_TRY
15539 /* The named return value extension begins with `return'. */
15540 || token->keyword == RID_RETURN);
15543 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
15547 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
15551 token = cp_lexer_peek_token (parser->lexer);
15552 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
15555 /* Returns TRUE iff the next token is the "," or ">" ending a
15556 template-argument. */
15559 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
15563 token = cp_lexer_peek_token (parser->lexer);
15564 return (token->type == CPP_COMMA || token->type == CPP_GREATER);
15567 /* Returns TRUE iff the n-th token is a ">", or the n-th is a "[" and the
15568 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
15571 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
15576 token = cp_lexer_peek_nth_token (parser->lexer, n);
15577 if (token->type == CPP_LESS)
15579 /* Check for the sequence `<::' in the original code. It would be lexed as
15580 `[:', where `[' is a digraph, and there is no whitespace before
15582 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
15585 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
15586 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
15592 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
15593 or none_type otherwise. */
15595 static enum tag_types
15596 cp_parser_token_is_class_key (cp_token* token)
15598 switch (token->keyword)
15603 return record_type;
15612 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
15615 cp_parser_check_class_key (enum tag_types class_key, tree type)
15617 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
15618 pedwarn ("%qs tag used in naming %q#T",
15619 class_key == union_type ? "union"
15620 : class_key == record_type ? "struct" : "class",
15624 /* Issue an error message if DECL is redeclared with different
15625 access than its original declaration [class.access.spec/3].
15626 This applies to nested classes and nested class templates.
15630 cp_parser_check_access_in_redeclaration (tree decl)
15632 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
15635 if ((TREE_PRIVATE (decl)
15636 != (current_access_specifier == access_private_node))
15637 || (TREE_PROTECTED (decl)
15638 != (current_access_specifier == access_protected_node)))
15639 error ("%qD redeclared with different access", decl);
15642 /* Look for the `template' keyword, as a syntactic disambiguator.
15643 Return TRUE iff it is present, in which case it will be
15647 cp_parser_optional_template_keyword (cp_parser *parser)
15649 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
15651 /* The `template' keyword can only be used within templates;
15652 outside templates the parser can always figure out what is a
15653 template and what is not. */
15654 if (!processing_template_decl)
15656 error ("%<template%> (as a disambiguator) is only allowed "
15657 "within templates");
15658 /* If this part of the token stream is rescanned, the same
15659 error message would be generated. So, we purge the token
15660 from the stream. */
15661 cp_lexer_purge_token (parser->lexer);
15666 /* Consume the `template' keyword. */
15667 cp_lexer_consume_token (parser->lexer);
15675 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
15676 set PARSER->SCOPE, and perform other related actions. */
15679 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
15684 /* Get the stored value. */
15685 value = cp_lexer_consume_token (parser->lexer)->value;
15686 /* Perform any access checks that were deferred. */
15687 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
15688 perform_or_defer_access_check (TREE_PURPOSE (check), TREE_VALUE (check));
15689 /* Set the scope from the stored value. */
15690 parser->scope = TREE_VALUE (value);
15691 parser->qualifying_scope = TREE_TYPE (value);
15692 parser->object_scope = NULL_TREE;
15695 /* Consume tokens up through a non-nested END token. */
15698 cp_parser_cache_group (cp_parser *parser,
15699 enum cpp_ttype end,
15706 /* Abort a parenthesized expression if we encounter a brace. */
15707 if ((end == CPP_CLOSE_PAREN || depth == 0)
15708 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15710 /* If we've reached the end of the file, stop. */
15711 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15713 /* Consume the next token. */
15714 token = cp_lexer_consume_token (parser->lexer);
15715 /* See if it starts a new group. */
15716 if (token->type == CPP_OPEN_BRACE)
15718 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
15722 else if (token->type == CPP_OPEN_PAREN)
15723 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
15724 else if (token->type == end)
15729 /* Begin parsing tentatively. We always save tokens while parsing
15730 tentatively so that if the tentative parsing fails we can restore the
15734 cp_parser_parse_tentatively (cp_parser* parser)
15736 /* Enter a new parsing context. */
15737 parser->context = cp_parser_context_new (parser->context);
15738 /* Begin saving tokens. */
15739 cp_lexer_save_tokens (parser->lexer);
15740 /* In order to avoid repetitive access control error messages,
15741 access checks are queued up until we are no longer parsing
15743 push_deferring_access_checks (dk_deferred);
15746 /* Commit to the currently active tentative parse. */
15749 cp_parser_commit_to_tentative_parse (cp_parser* parser)
15751 cp_parser_context *context;
15754 /* Mark all of the levels as committed. */
15755 lexer = parser->lexer;
15756 for (context = parser->context; context->next; context = context->next)
15758 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
15760 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
15761 while (!cp_lexer_saving_tokens (lexer))
15762 lexer = lexer->next;
15763 cp_lexer_commit_tokens (lexer);
15767 /* Abort the currently active tentative parse. All consumed tokens
15768 will be rolled back, and no diagnostics will be issued. */
15771 cp_parser_abort_tentative_parse (cp_parser* parser)
15773 cp_parser_simulate_error (parser);
15774 /* Now, pretend that we want to see if the construct was
15775 successfully parsed. */
15776 cp_parser_parse_definitely (parser);
15779 /* Stop parsing tentatively. If a parse error has occurred, restore the
15780 token stream. Otherwise, commit to the tokens we have consumed.
15781 Returns true if no error occurred; false otherwise. */
15784 cp_parser_parse_definitely (cp_parser* parser)
15786 bool error_occurred;
15787 cp_parser_context *context;
15789 /* Remember whether or not an error occurred, since we are about to
15790 destroy that information. */
15791 error_occurred = cp_parser_error_occurred (parser);
15792 /* Remove the topmost context from the stack. */
15793 context = parser->context;
15794 parser->context = context->next;
15795 /* If no parse errors occurred, commit to the tentative parse. */
15796 if (!error_occurred)
15798 /* Commit to the tokens read tentatively, unless that was
15800 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
15801 cp_lexer_commit_tokens (parser->lexer);
15803 pop_to_parent_deferring_access_checks ();
15805 /* Otherwise, if errors occurred, roll back our state so that things
15806 are just as they were before we began the tentative parse. */
15809 cp_lexer_rollback_tokens (parser->lexer);
15810 pop_deferring_access_checks ();
15812 /* Add the context to the front of the free list. */
15813 context->next = cp_parser_context_free_list;
15814 cp_parser_context_free_list = context;
15816 return !error_occurred;
15819 /* Returns true if we are parsing tentatively -- but have decided that
15820 we will stick with this tentative parse, even if errors occur. */
15823 cp_parser_committed_to_tentative_parse (cp_parser* parser)
15825 return (cp_parser_parsing_tentatively (parser)
15826 && parser->context->status == CP_PARSER_STATUS_KIND_COMMITTED);
15829 /* Returns nonzero iff an error has occurred during the most recent
15830 tentative parse. */
15833 cp_parser_error_occurred (cp_parser* parser)
15835 return (cp_parser_parsing_tentatively (parser)
15836 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
15839 /* Returns nonzero if GNU extensions are allowed. */
15842 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
15844 return parser->allow_gnu_extensions_p;
15850 static GTY (()) cp_parser *the_parser;
15852 /* External interface. */
15854 /* Parse one entire translation unit. */
15857 c_parse_file (void)
15859 bool error_occurred;
15860 static bool already_called = false;
15862 if (already_called)
15864 sorry ("inter-module optimizations not implemented for C++");
15867 already_called = true;
15869 the_parser = cp_parser_new ();
15870 push_deferring_access_checks (flag_access_control
15871 ? dk_no_deferred : dk_no_check);
15872 error_occurred = cp_parser_translation_unit (the_parser);
15876 /* This variable must be provided by every front end. */
15880 #include "gt-cp-parser.h"