2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "coretypes.h"
27 #include "dyn-string.h"
35 #include "diagnostic.h"
45 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
46 and c-lex.c) and the C++ parser. */
48 /* A token's value and its associated deferred access checks and
51 struct tree_check GTY(())
53 /* The value associated with the token. */
55 /* The checks that have been associated with value. */
56 VEC (deferred_access_check, gc)* checks;
57 /* The token's qualifying scope (used when it is a
58 CPP_NESTED_NAME_SPECIFIER). */
59 tree qualifying_scope;
64 typedef struct cp_token GTY (())
66 /* The kind of token. */
67 ENUM_BITFIELD (cpp_ttype) type : 8;
68 /* If this token is a keyword, this value indicates which keyword.
69 Otherwise, this value is RID_MAX. */
70 ENUM_BITFIELD (rid) keyword : 8;
73 /* Identifier for the pragma. */
74 ENUM_BITFIELD (pragma_kind) pragma_kind : 6;
75 /* True if this token is from a system header. */
76 BOOL_BITFIELD in_system_header : 1;
77 /* True if this token is from a context where it is implicitly extern "C" */
78 BOOL_BITFIELD implicit_extern_c : 1;
79 /* True for a CPP_NAME token that is not a keyword (i.e., for which
80 KEYWORD is RID_MAX) iff this name was looked up and found to be
81 ambiguous. An error has already been reported. */
82 BOOL_BITFIELD ambiguous_p : 1;
83 /* The input file stack index at which this token was found. */
84 unsigned input_file_stack_index : INPUT_FILE_STACK_BITS;
85 /* The value associated with this token, if any. */
86 union cp_token_value {
87 /* Used for CPP_NESTED_NAME_SPECIFIER and CPP_TEMPLATE_ID. */
88 struct tree_check* GTY((tag ("1"))) tree_check_value;
89 /* Use for all other tokens. */
90 tree GTY((tag ("0"))) value;
91 } GTY((desc ("(%1.type == CPP_TEMPLATE_ID) || (%1.type == CPP_NESTED_NAME_SPECIFIER)"))) u;
92 /* The location at which this token was found. */
96 /* We use a stack of token pointer for saving token sets. */
97 typedef struct cp_token *cp_token_position;
98 DEF_VEC_P (cp_token_position);
99 DEF_VEC_ALLOC_P (cp_token_position,heap);
101 static const cp_token eof_token =
103 CPP_EOF, RID_MAX, 0, PRAGMA_NONE, 0, 0, false, 0, { NULL },
104 #if USE_MAPPED_LOCATION
111 /* The cp_lexer structure represents the C++ lexer. It is responsible
112 for managing the token stream from the preprocessor and supplying
113 it to the parser. Tokens are never added to the cp_lexer after
116 typedef struct cp_lexer GTY (())
118 /* The memory allocated for the buffer. NULL if this lexer does not
119 own the token buffer. */
120 cp_token * GTY ((length ("%h.buffer_length"))) buffer;
121 /* If the lexer owns the buffer, this is the number of tokens in the
123 size_t buffer_length;
125 /* A pointer just past the last available token. The tokens
126 in this lexer are [buffer, last_token). */
127 cp_token_position GTY ((skip)) last_token;
129 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
130 no more available tokens. */
131 cp_token_position GTY ((skip)) next_token;
133 /* A stack indicating positions at which cp_lexer_save_tokens was
134 called. The top entry is the most recent position at which we
135 began saving tokens. If the stack is non-empty, we are saving
137 VEC(cp_token_position,heap) *GTY ((skip)) saved_tokens;
139 /* The next lexer in a linked list of lexers. */
140 struct cp_lexer *next;
142 /* True if we should output debugging information. */
145 /* True if we're in the context of parsing a pragma, and should not
146 increment past the end-of-line marker. */
150 /* cp_token_cache is a range of tokens. There is no need to represent
151 allocate heap memory for it, since tokens are never removed from the
152 lexer's array. There is also no need for the GC to walk through
153 a cp_token_cache, since everything in here is referenced through
156 typedef struct cp_token_cache GTY(())
158 /* The beginning of the token range. */
159 cp_token * GTY((skip)) first;
161 /* Points immediately after the last token in the range. */
162 cp_token * GTY ((skip)) last;
167 static cp_lexer *cp_lexer_new_main
169 static cp_lexer *cp_lexer_new_from_tokens
170 (cp_token_cache *tokens);
171 static void cp_lexer_destroy
173 static int cp_lexer_saving_tokens
175 static cp_token_position cp_lexer_token_position
177 static cp_token *cp_lexer_token_at
178 (cp_lexer *, cp_token_position);
179 static void cp_lexer_get_preprocessor_token
180 (cp_lexer *, cp_token *);
181 static inline cp_token *cp_lexer_peek_token
183 static cp_token *cp_lexer_peek_nth_token
184 (cp_lexer *, size_t);
185 static inline bool cp_lexer_next_token_is
186 (cp_lexer *, enum cpp_ttype);
187 static bool cp_lexer_next_token_is_not
188 (cp_lexer *, enum cpp_ttype);
189 static bool cp_lexer_next_token_is_keyword
190 (cp_lexer *, enum rid);
191 static cp_token *cp_lexer_consume_token
193 static void cp_lexer_purge_token
195 static void cp_lexer_purge_tokens_after
196 (cp_lexer *, cp_token_position);
197 static void cp_lexer_save_tokens
199 static void cp_lexer_commit_tokens
201 static void cp_lexer_rollback_tokens
203 #ifdef ENABLE_CHECKING
204 static void cp_lexer_print_token
205 (FILE *, cp_token *);
206 static inline bool cp_lexer_debugging_p
208 static void cp_lexer_start_debugging
209 (cp_lexer *) ATTRIBUTE_UNUSED;
210 static void cp_lexer_stop_debugging
211 (cp_lexer *) ATTRIBUTE_UNUSED;
213 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
214 about passing NULL to functions that require non-NULL arguments
215 (fputs, fprintf). It will never be used, so all we need is a value
216 of the right type that's guaranteed not to be NULL. */
217 #define cp_lexer_debug_stream stdout
218 #define cp_lexer_print_token(str, tok) (void) 0
219 #define cp_lexer_debugging_p(lexer) 0
220 #endif /* ENABLE_CHECKING */
222 static cp_token_cache *cp_token_cache_new
223 (cp_token *, cp_token *);
225 static void cp_parser_initial_pragma
228 /* Manifest constants. */
229 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
230 #define CP_SAVED_TOKEN_STACK 5
232 /* A token type for keywords, as opposed to ordinary identifiers. */
233 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
235 /* A token type for template-ids. If a template-id is processed while
236 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
237 the value of the CPP_TEMPLATE_ID is whatever was returned by
238 cp_parser_template_id. */
239 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
241 /* A token type for nested-name-specifiers. If a
242 nested-name-specifier is processed while parsing tentatively, it is
243 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
244 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
245 cp_parser_nested_name_specifier_opt. */
246 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
248 /* A token type for tokens that are not tokens at all; these are used
249 to represent slots in the array where there used to be a token
250 that has now been deleted. */
251 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
253 /* The number of token types, including C++-specific ones. */
254 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
258 #ifdef ENABLE_CHECKING
259 /* The stream to which debugging output should be written. */
260 static FILE *cp_lexer_debug_stream;
261 #endif /* ENABLE_CHECKING */
263 /* Create a new main C++ lexer, the lexer that gets tokens from the
267 cp_lexer_new_main (void)
269 cp_token first_token;
276 /* It's possible that parsing the first pragma will load a PCH file,
277 which is a GC collection point. So we have to do that before
278 allocating any memory. */
279 cp_parser_initial_pragma (&first_token);
281 /* Tell c_lex_with_flags not to merge string constants. */
282 c_lex_return_raw_strings = true;
284 c_common_no_more_pch ();
286 /* Allocate the memory. */
287 lexer = GGC_CNEW (cp_lexer);
289 #ifdef ENABLE_CHECKING
290 /* Initially we are not debugging. */
291 lexer->debugging_p = false;
292 #endif /* ENABLE_CHECKING */
293 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
294 CP_SAVED_TOKEN_STACK);
296 /* Create the buffer. */
297 alloc = CP_LEXER_BUFFER_SIZE;
298 buffer = GGC_NEWVEC (cp_token, alloc);
300 /* Put the first token in the buffer. */
305 /* Get the remaining tokens from the preprocessor. */
306 while (pos->type != CPP_EOF)
313 buffer = GGC_RESIZEVEC (cp_token, buffer, alloc);
314 pos = buffer + space;
316 cp_lexer_get_preprocessor_token (lexer, pos);
318 lexer->buffer = buffer;
319 lexer->buffer_length = alloc - space;
320 lexer->last_token = pos;
321 lexer->next_token = lexer->buffer_length ? buffer : (cp_token *)&eof_token;
323 /* Subsequent preprocessor diagnostics should use compiler
324 diagnostic functions to get the compiler source location. */
325 cpp_get_options (parse_in)->client_diagnostic = true;
326 cpp_get_callbacks (parse_in)->error = cp_cpp_error;
328 gcc_assert (lexer->next_token->type != CPP_PURGED);
332 /* Create a new lexer whose token stream is primed with the tokens in
333 CACHE. When these tokens are exhausted, no new tokens will be read. */
336 cp_lexer_new_from_tokens (cp_token_cache *cache)
338 cp_token *first = cache->first;
339 cp_token *last = cache->last;
340 cp_lexer *lexer = GGC_CNEW (cp_lexer);
342 /* We do not own the buffer. */
343 lexer->buffer = NULL;
344 lexer->buffer_length = 0;
345 lexer->next_token = first == last ? (cp_token *)&eof_token : first;
346 lexer->last_token = last;
348 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
349 CP_SAVED_TOKEN_STACK);
351 #ifdef ENABLE_CHECKING
352 /* Initially we are not debugging. */
353 lexer->debugging_p = false;
356 gcc_assert (lexer->next_token->type != CPP_PURGED);
360 /* Frees all resources associated with LEXER. */
363 cp_lexer_destroy (cp_lexer *lexer)
366 ggc_free (lexer->buffer);
367 VEC_free (cp_token_position, heap, lexer->saved_tokens);
371 /* Returns nonzero if debugging information should be output. */
373 #ifdef ENABLE_CHECKING
376 cp_lexer_debugging_p (cp_lexer *lexer)
378 return lexer->debugging_p;
381 #endif /* ENABLE_CHECKING */
383 static inline cp_token_position
384 cp_lexer_token_position (cp_lexer *lexer, bool previous_p)
386 gcc_assert (!previous_p || lexer->next_token != &eof_token);
388 return lexer->next_token - previous_p;
391 static inline cp_token *
392 cp_lexer_token_at (cp_lexer *lexer ATTRIBUTE_UNUSED, cp_token_position pos)
397 /* nonzero if we are presently saving tokens. */
400 cp_lexer_saving_tokens (const cp_lexer* lexer)
402 return VEC_length (cp_token_position, lexer->saved_tokens) != 0;
405 /* Store the next token from the preprocessor in *TOKEN. Return true
409 cp_lexer_get_preprocessor_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
412 static int is_extern_c = 0;
414 /* Get a new token from the preprocessor. */
416 = c_lex_with_flags (&token->u.value, &token->location, &token->flags);
417 token->input_file_stack_index = input_file_stack_tick;
418 token->keyword = RID_MAX;
419 token->pragma_kind = PRAGMA_NONE;
420 token->in_system_header = in_system_header;
422 /* On some systems, some header files are surrounded by an
423 implicit extern "C" block. Set a flag in the token if it
424 comes from such a header. */
425 is_extern_c += pending_lang_change;
426 pending_lang_change = 0;
427 token->implicit_extern_c = is_extern_c > 0;
429 /* Check to see if this token is a keyword. */
430 if (token->type == CPP_NAME)
432 if (C_IS_RESERVED_WORD (token->u.value))
434 /* Mark this token as a keyword. */
435 token->type = CPP_KEYWORD;
436 /* Record which keyword. */
437 token->keyword = C_RID_CODE (token->u.value);
438 /* Update the value. Some keywords are mapped to particular
439 entities, rather than simply having the value of the
440 corresponding IDENTIFIER_NODE. For example, `__const' is
441 mapped to `const'. */
442 token->u.value = ridpointers[token->keyword];
446 token->ambiguous_p = false;
447 token->keyword = RID_MAX;
450 /* Handle Objective-C++ keywords. */
451 else if (token->type == CPP_AT_NAME)
453 token->type = CPP_KEYWORD;
454 switch (C_RID_CODE (token->u.value))
456 /* Map 'class' to '@class', 'private' to '@private', etc. */
457 case RID_CLASS: token->keyword = RID_AT_CLASS; break;
458 case RID_PRIVATE: token->keyword = RID_AT_PRIVATE; break;
459 case RID_PROTECTED: token->keyword = RID_AT_PROTECTED; break;
460 case RID_PUBLIC: token->keyword = RID_AT_PUBLIC; break;
461 case RID_THROW: token->keyword = RID_AT_THROW; break;
462 case RID_TRY: token->keyword = RID_AT_TRY; break;
463 case RID_CATCH: token->keyword = RID_AT_CATCH; break;
464 default: token->keyword = C_RID_CODE (token->u.value);
467 else if (token->type == CPP_PRAGMA)
469 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
470 token->pragma_kind = TREE_INT_CST_LOW (token->u.value);
471 token->u.value = NULL_TREE;
475 /* Update the globals input_location and in_system_header and the
476 input file stack from TOKEN. */
478 cp_lexer_set_source_position_from_token (cp_token *token)
480 if (token->type != CPP_EOF)
482 input_location = token->location;
483 in_system_header = token->in_system_header;
484 restore_input_file_stack (token->input_file_stack_index);
488 /* Return a pointer to the next token in the token stream, but do not
491 static inline cp_token *
492 cp_lexer_peek_token (cp_lexer *lexer)
494 if (cp_lexer_debugging_p (lexer))
496 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream);
497 cp_lexer_print_token (cp_lexer_debug_stream, lexer->next_token);
498 putc ('\n', cp_lexer_debug_stream);
500 return lexer->next_token;
503 /* Return true if the next token has the indicated TYPE. */
506 cp_lexer_next_token_is (cp_lexer* lexer, enum cpp_ttype type)
508 return cp_lexer_peek_token (lexer)->type == type;
511 /* Return true if the next token does not have the indicated TYPE. */
514 cp_lexer_next_token_is_not (cp_lexer* lexer, enum cpp_ttype type)
516 return !cp_lexer_next_token_is (lexer, type);
519 /* Return true if the next token is the indicated KEYWORD. */
522 cp_lexer_next_token_is_keyword (cp_lexer* lexer, enum rid keyword)
524 return cp_lexer_peek_token (lexer)->keyword == keyword;
527 /* Return true if the next token is a keyword for a decl-specifier. */
530 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer *lexer)
534 token = cp_lexer_peek_token (lexer);
535 switch (token->keyword)
537 /* Storage classes. */
544 /* Elaborated type specifiers. */
550 /* Simple type specifiers. */
562 /* GNU extensions. */
572 /* Return a pointer to the Nth token in the token stream. If N is 1,
573 then this is precisely equivalent to cp_lexer_peek_token (except
574 that it is not inline). One would like to disallow that case, but
575 there is one case (cp_parser_nth_token_starts_template_id) where
576 the caller passes a variable for N and it might be 1. */
579 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
583 /* N is 1-based, not zero-based. */
586 if (cp_lexer_debugging_p (lexer))
587 fprintf (cp_lexer_debug_stream,
588 "cp_lexer: peeking ahead %ld at token: ", (long)n);
591 token = lexer->next_token;
592 gcc_assert (!n || token != &eof_token);
596 if (token == lexer->last_token)
598 token = (cp_token *)&eof_token;
602 if (token->type != CPP_PURGED)
606 if (cp_lexer_debugging_p (lexer))
608 cp_lexer_print_token (cp_lexer_debug_stream, token);
609 putc ('\n', cp_lexer_debug_stream);
615 /* Return the next token, and advance the lexer's next_token pointer
616 to point to the next non-purged token. */
619 cp_lexer_consume_token (cp_lexer* lexer)
621 cp_token *token = lexer->next_token;
623 gcc_assert (token != &eof_token);
624 gcc_assert (!lexer->in_pragma || token->type != CPP_PRAGMA_EOL);
629 if (lexer->next_token == lexer->last_token)
631 lexer->next_token = (cp_token *)&eof_token;
636 while (lexer->next_token->type == CPP_PURGED);
638 cp_lexer_set_source_position_from_token (token);
640 /* Provide debugging output. */
641 if (cp_lexer_debugging_p (lexer))
643 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
644 cp_lexer_print_token (cp_lexer_debug_stream, token);
645 putc ('\n', cp_lexer_debug_stream);
651 /* Permanently remove the next token from the token stream, and
652 advance the next_token pointer to refer to the next non-purged
656 cp_lexer_purge_token (cp_lexer *lexer)
658 cp_token *tok = lexer->next_token;
660 gcc_assert (tok != &eof_token);
661 tok->type = CPP_PURGED;
662 tok->location = UNKNOWN_LOCATION;
663 tok->u.value = NULL_TREE;
664 tok->keyword = RID_MAX;
669 if (tok == lexer->last_token)
671 tok = (cp_token *)&eof_token;
675 while (tok->type == CPP_PURGED);
676 lexer->next_token = tok;
679 /* Permanently remove all tokens after TOK, up to, but not
680 including, the token that will be returned next by
681 cp_lexer_peek_token. */
684 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
686 cp_token *peek = lexer->next_token;
688 if (peek == &eof_token)
689 peek = lexer->last_token;
691 gcc_assert (tok < peek);
693 for ( tok += 1; tok != peek; tok += 1)
695 tok->type = CPP_PURGED;
696 tok->location = UNKNOWN_LOCATION;
697 tok->u.value = NULL_TREE;
698 tok->keyword = RID_MAX;
702 /* Begin saving tokens. All tokens consumed after this point will be
706 cp_lexer_save_tokens (cp_lexer* lexer)
708 /* Provide debugging output. */
709 if (cp_lexer_debugging_p (lexer))
710 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
712 VEC_safe_push (cp_token_position, heap,
713 lexer->saved_tokens, lexer->next_token);
716 /* Commit to the portion of the token stream most recently saved. */
719 cp_lexer_commit_tokens (cp_lexer* lexer)
721 /* Provide debugging output. */
722 if (cp_lexer_debugging_p (lexer))
723 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
725 VEC_pop (cp_token_position, lexer->saved_tokens);
728 /* Return all tokens saved since the last call to cp_lexer_save_tokens
729 to the token stream. Stop saving tokens. */
732 cp_lexer_rollback_tokens (cp_lexer* lexer)
734 /* Provide debugging output. */
735 if (cp_lexer_debugging_p (lexer))
736 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
738 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
741 /* Print a representation of the TOKEN on the STREAM. */
743 #ifdef ENABLE_CHECKING
746 cp_lexer_print_token (FILE * stream, cp_token *token)
748 /* We don't use cpp_type2name here because the parser defines
749 a few tokens of its own. */
750 static const char *const token_names[] = {
751 /* cpplib-defined token types */
757 /* C++ parser token types - see "Manifest constants", above. */
760 "NESTED_NAME_SPECIFIER",
764 /* If we have a name for the token, print it out. Otherwise, we
765 simply give the numeric code. */
766 gcc_assert (token->type < ARRAY_SIZE(token_names));
767 fputs (token_names[token->type], stream);
769 /* For some tokens, print the associated data. */
773 /* Some keywords have a value that is not an IDENTIFIER_NODE.
774 For example, `struct' is mapped to an INTEGER_CST. */
775 if (TREE_CODE (token->u.value) != IDENTIFIER_NODE)
777 /* else fall through */
779 fputs (IDENTIFIER_POINTER (token->u.value), stream);
784 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->u.value));
792 /* Start emitting debugging information. */
795 cp_lexer_start_debugging (cp_lexer* lexer)
797 lexer->debugging_p = true;
800 /* Stop emitting debugging information. */
803 cp_lexer_stop_debugging (cp_lexer* lexer)
805 lexer->debugging_p = false;
808 #endif /* ENABLE_CHECKING */
810 /* Create a new cp_token_cache, representing a range of tokens. */
812 static cp_token_cache *
813 cp_token_cache_new (cp_token *first, cp_token *last)
815 cp_token_cache *cache = GGC_NEW (cp_token_cache);
816 cache->first = first;
822 /* Decl-specifiers. */
824 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
827 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
829 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
834 /* Nothing other than the parser should be creating declarators;
835 declarators are a semi-syntactic representation of C++ entities.
836 Other parts of the front end that need to create entities (like
837 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
839 static cp_declarator *make_call_declarator
840 (cp_declarator *, cp_parameter_declarator *, cp_cv_quals, tree);
841 static cp_declarator *make_array_declarator
842 (cp_declarator *, tree);
843 static cp_declarator *make_pointer_declarator
844 (cp_cv_quals, cp_declarator *);
845 static cp_declarator *make_reference_declarator
846 (cp_cv_quals, cp_declarator *);
847 static cp_parameter_declarator *make_parameter_declarator
848 (cp_decl_specifier_seq *, cp_declarator *, tree);
849 static cp_declarator *make_ptrmem_declarator
850 (cp_cv_quals, tree, cp_declarator *);
852 /* An erroneous declarator. */
853 static cp_declarator *cp_error_declarator;
855 /* The obstack on which declarators and related data structures are
857 static struct obstack declarator_obstack;
859 /* Alloc BYTES from the declarator memory pool. */
862 alloc_declarator (size_t bytes)
864 return obstack_alloc (&declarator_obstack, bytes);
867 /* Allocate a declarator of the indicated KIND. Clear fields that are
868 common to all declarators. */
870 static cp_declarator *
871 make_declarator (cp_declarator_kind kind)
873 cp_declarator *declarator;
875 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
876 declarator->kind = kind;
877 declarator->attributes = NULL_TREE;
878 declarator->declarator = NULL;
883 /* Make a declarator for a generalized identifier. If
884 QUALIFYING_SCOPE is non-NULL, the identifier is
885 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
886 UNQUALIFIED_NAME. SFK indicates the kind of special function this
889 static cp_declarator *
890 make_id_declarator (tree qualifying_scope, tree unqualified_name,
891 special_function_kind sfk)
893 cp_declarator *declarator;
895 /* It is valid to write:
897 class C { void f(); };
901 The standard is not clear about whether `typedef const C D' is
902 legal; as of 2002-09-15 the committee is considering that
903 question. EDG 3.0 allows that syntax. Therefore, we do as
905 if (qualifying_scope && TYPE_P (qualifying_scope))
906 qualifying_scope = TYPE_MAIN_VARIANT (qualifying_scope);
908 gcc_assert (TREE_CODE (unqualified_name) == IDENTIFIER_NODE
909 || TREE_CODE (unqualified_name) == BIT_NOT_EXPR
910 || TREE_CODE (unqualified_name) == TEMPLATE_ID_EXPR);
912 declarator = make_declarator (cdk_id);
913 declarator->u.id.qualifying_scope = qualifying_scope;
914 declarator->u.id.unqualified_name = unqualified_name;
915 declarator->u.id.sfk = sfk;
920 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
921 of modifiers such as const or volatile to apply to the pointer
922 type, represented as identifiers. */
925 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
927 cp_declarator *declarator;
929 declarator = make_declarator (cdk_pointer);
930 declarator->declarator = target;
931 declarator->u.pointer.qualifiers = cv_qualifiers;
932 declarator->u.pointer.class_type = NULL_TREE;
937 /* Like make_pointer_declarator -- but for references. */
940 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
942 cp_declarator *declarator;
944 declarator = make_declarator (cdk_reference);
945 declarator->declarator = target;
946 declarator->u.pointer.qualifiers = cv_qualifiers;
947 declarator->u.pointer.class_type = NULL_TREE;
952 /* Like make_pointer_declarator -- but for a pointer to a non-static
953 member of CLASS_TYPE. */
956 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
957 cp_declarator *pointee)
959 cp_declarator *declarator;
961 declarator = make_declarator (cdk_ptrmem);
962 declarator->declarator = pointee;
963 declarator->u.pointer.qualifiers = cv_qualifiers;
964 declarator->u.pointer.class_type = class_type;
969 /* Make a declarator for the function given by TARGET, with the
970 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
971 "const"-qualified member function. The EXCEPTION_SPECIFICATION
972 indicates what exceptions can be thrown. */
975 make_call_declarator (cp_declarator *target,
976 cp_parameter_declarator *parms,
977 cp_cv_quals cv_qualifiers,
978 tree exception_specification)
980 cp_declarator *declarator;
982 declarator = make_declarator (cdk_function);
983 declarator->declarator = target;
984 declarator->u.function.parameters = parms;
985 declarator->u.function.qualifiers = cv_qualifiers;
986 declarator->u.function.exception_specification = exception_specification;
991 /* Make a declarator for an array of BOUNDS elements, each of which is
992 defined by ELEMENT. */
995 make_array_declarator (cp_declarator *element, tree bounds)
997 cp_declarator *declarator;
999 declarator = make_declarator (cdk_array);
1000 declarator->declarator = element;
1001 declarator->u.array.bounds = bounds;
1006 cp_parameter_declarator *no_parameters;
1008 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1009 DECLARATOR and DEFAULT_ARGUMENT. */
1011 cp_parameter_declarator *
1012 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
1013 cp_declarator *declarator,
1014 tree default_argument)
1016 cp_parameter_declarator *parameter;
1018 parameter = ((cp_parameter_declarator *)
1019 alloc_declarator (sizeof (cp_parameter_declarator)));
1020 parameter->next = NULL;
1021 if (decl_specifiers)
1022 parameter->decl_specifiers = *decl_specifiers;
1024 clear_decl_specs (¶meter->decl_specifiers);
1025 parameter->declarator = declarator;
1026 parameter->default_argument = default_argument;
1027 parameter->ellipsis_p = false;
1032 /* Returns true iff DECLARATOR is a declaration for a function. */
1035 function_declarator_p (const cp_declarator *declarator)
1039 if (declarator->kind == cdk_function
1040 && declarator->declarator->kind == cdk_id)
1042 if (declarator->kind == cdk_id
1043 || declarator->kind == cdk_error)
1045 declarator = declarator->declarator;
1055 A cp_parser parses the token stream as specified by the C++
1056 grammar. Its job is purely parsing, not semantic analysis. For
1057 example, the parser breaks the token stream into declarators,
1058 expressions, statements, and other similar syntactic constructs.
1059 It does not check that the types of the expressions on either side
1060 of an assignment-statement are compatible, or that a function is
1061 not declared with a parameter of type `void'.
1063 The parser invokes routines elsewhere in the compiler to perform
1064 semantic analysis and to build up the abstract syntax tree for the
1067 The parser (and the template instantiation code, which is, in a
1068 way, a close relative of parsing) are the only parts of the
1069 compiler that should be calling push_scope and pop_scope, or
1070 related functions. The parser (and template instantiation code)
1071 keeps track of what scope is presently active; everything else
1072 should simply honor that. (The code that generates static
1073 initializers may also need to set the scope, in order to check
1074 access control correctly when emitting the initializers.)
1079 The parser is of the standard recursive-descent variety. Upcoming
1080 tokens in the token stream are examined in order to determine which
1081 production to use when parsing a non-terminal. Some C++ constructs
1082 require arbitrary look ahead to disambiguate. For example, it is
1083 impossible, in the general case, to tell whether a statement is an
1084 expression or declaration without scanning the entire statement.
1085 Therefore, the parser is capable of "parsing tentatively." When the
1086 parser is not sure what construct comes next, it enters this mode.
1087 Then, while we attempt to parse the construct, the parser queues up
1088 error messages, rather than issuing them immediately, and saves the
1089 tokens it consumes. If the construct is parsed successfully, the
1090 parser "commits", i.e., it issues any queued error messages and
1091 the tokens that were being preserved are permanently discarded.
1092 If, however, the construct is not parsed successfully, the parser
1093 rolls back its state completely so that it can resume parsing using
1094 a different alternative.
1099 The performance of the parser could probably be improved substantially.
1100 We could often eliminate the need to parse tentatively by looking ahead
1101 a little bit. In some places, this approach might not entirely eliminate
1102 the need to parse tentatively, but it might still speed up the average
1105 /* Flags that are passed to some parsing functions. These values can
1106 be bitwise-ored together. */
1108 typedef enum cp_parser_flags
1111 CP_PARSER_FLAGS_NONE = 0x0,
1112 /* The construct is optional. If it is not present, then no error
1113 should be issued. */
1114 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1115 /* When parsing a type-specifier, do not allow user-defined types. */
1116 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
1119 /* The different kinds of declarators we want to parse. */
1121 typedef enum cp_parser_declarator_kind
1123 /* We want an abstract declarator. */
1124 CP_PARSER_DECLARATOR_ABSTRACT,
1125 /* We want a named declarator. */
1126 CP_PARSER_DECLARATOR_NAMED,
1127 /* We don't mind, but the name must be an unqualified-id. */
1128 CP_PARSER_DECLARATOR_EITHER
1129 } cp_parser_declarator_kind;
1131 /* The precedence values used to parse binary expressions. The minimum value
1132 of PREC must be 1, because zero is reserved to quickly discriminate
1133 binary operators from other tokens. */
1138 PREC_LOGICAL_OR_EXPRESSION,
1139 PREC_LOGICAL_AND_EXPRESSION,
1140 PREC_INCLUSIVE_OR_EXPRESSION,
1141 PREC_EXCLUSIVE_OR_EXPRESSION,
1142 PREC_AND_EXPRESSION,
1143 PREC_EQUALITY_EXPRESSION,
1144 PREC_RELATIONAL_EXPRESSION,
1145 PREC_SHIFT_EXPRESSION,
1146 PREC_ADDITIVE_EXPRESSION,
1147 PREC_MULTIPLICATIVE_EXPRESSION,
1149 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1152 /* A mapping from a token type to a corresponding tree node type, with a
1153 precedence value. */
1155 typedef struct cp_parser_binary_operations_map_node
1157 /* The token type. */
1158 enum cpp_ttype token_type;
1159 /* The corresponding tree code. */
1160 enum tree_code tree_type;
1161 /* The precedence of this operator. */
1162 enum cp_parser_prec prec;
1163 } cp_parser_binary_operations_map_node;
1165 /* The status of a tentative parse. */
1167 typedef enum cp_parser_status_kind
1169 /* No errors have occurred. */
1170 CP_PARSER_STATUS_KIND_NO_ERROR,
1171 /* An error has occurred. */
1172 CP_PARSER_STATUS_KIND_ERROR,
1173 /* We are committed to this tentative parse, whether or not an error
1175 CP_PARSER_STATUS_KIND_COMMITTED
1176 } cp_parser_status_kind;
1178 typedef struct cp_parser_expression_stack_entry
1180 /* Left hand side of the binary operation we are currently
1183 /* Original tree code for left hand side, if it was a binary
1184 expression itself (used for -Wparentheses). */
1185 enum tree_code lhs_type;
1186 /* Tree code for the binary operation we are parsing. */
1187 enum tree_code tree_type;
1188 /* Precedence of the binary operation we are parsing. */
1190 } cp_parser_expression_stack_entry;
1192 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1193 entries because precedence levels on the stack are monotonically
1195 typedef struct cp_parser_expression_stack_entry
1196 cp_parser_expression_stack[NUM_PREC_VALUES];
1198 /* Context that is saved and restored when parsing tentatively. */
1199 typedef struct cp_parser_context GTY (())
1201 /* If this is a tentative parsing context, the status of the
1203 enum cp_parser_status_kind status;
1204 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1205 that are looked up in this context must be looked up both in the
1206 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1207 the context of the containing expression. */
1210 /* The next parsing context in the stack. */
1211 struct cp_parser_context *next;
1212 } cp_parser_context;
1216 /* Constructors and destructors. */
1218 static cp_parser_context *cp_parser_context_new
1219 (cp_parser_context *);
1221 /* Class variables. */
1223 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1225 /* The operator-precedence table used by cp_parser_binary_expression.
1226 Transformed into an associative array (binops_by_token) by
1229 static const cp_parser_binary_operations_map_node binops[] = {
1230 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1231 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1233 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1234 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1235 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1237 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1238 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1240 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1241 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1243 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1244 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1245 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1246 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1248 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1249 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1251 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1253 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1255 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1257 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1259 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1262 /* The same as binops, but initialized by cp_parser_new so that
1263 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1265 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1267 /* Constructors and destructors. */
1269 /* Construct a new context. The context below this one on the stack
1270 is given by NEXT. */
1272 static cp_parser_context *
1273 cp_parser_context_new (cp_parser_context* next)
1275 cp_parser_context *context;
1277 /* Allocate the storage. */
1278 if (cp_parser_context_free_list != NULL)
1280 /* Pull the first entry from the free list. */
1281 context = cp_parser_context_free_list;
1282 cp_parser_context_free_list = context->next;
1283 memset (context, 0, sizeof (*context));
1286 context = GGC_CNEW (cp_parser_context);
1288 /* No errors have occurred yet in this context. */
1289 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1290 /* If this is not the bottomost context, copy information that we
1291 need from the previous context. */
1294 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1295 expression, then we are parsing one in this context, too. */
1296 context->object_type = next->object_type;
1297 /* Thread the stack. */
1298 context->next = next;
1304 /* The cp_parser structure represents the C++ parser. */
1306 typedef struct cp_parser GTY(())
1308 /* The lexer from which we are obtaining tokens. */
1311 /* The scope in which names should be looked up. If NULL_TREE, then
1312 we look up names in the scope that is currently open in the
1313 source program. If non-NULL, this is either a TYPE or
1314 NAMESPACE_DECL for the scope in which we should look. It can
1315 also be ERROR_MARK, when we've parsed a bogus scope.
1317 This value is not cleared automatically after a name is looked
1318 up, so we must be careful to clear it before starting a new look
1319 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1320 will look up `Z' in the scope of `X', rather than the current
1321 scope.) Unfortunately, it is difficult to tell when name lookup
1322 is complete, because we sometimes peek at a token, look it up,
1323 and then decide not to consume it. */
1326 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1327 last lookup took place. OBJECT_SCOPE is used if an expression
1328 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1329 respectively. QUALIFYING_SCOPE is used for an expression of the
1330 form "X::Y"; it refers to X. */
1332 tree qualifying_scope;
1334 /* A stack of parsing contexts. All but the bottom entry on the
1335 stack will be tentative contexts.
1337 We parse tentatively in order to determine which construct is in
1338 use in some situations. For example, in order to determine
1339 whether a statement is an expression-statement or a
1340 declaration-statement we parse it tentatively as a
1341 declaration-statement. If that fails, we then reparse the same
1342 token stream as an expression-statement. */
1343 cp_parser_context *context;
1345 /* True if we are parsing GNU C++. If this flag is not set, then
1346 GNU extensions are not recognized. */
1347 bool allow_gnu_extensions_p;
1349 /* TRUE if the `>' token should be interpreted as the greater-than
1350 operator. FALSE if it is the end of a template-id or
1351 template-parameter-list. */
1352 bool greater_than_is_operator_p;
1354 /* TRUE if default arguments are allowed within a parameter list
1355 that starts at this point. FALSE if only a gnu extension makes
1356 them permissible. */
1357 bool default_arg_ok_p;
1359 /* TRUE if we are parsing an integral constant-expression. See
1360 [expr.const] for a precise definition. */
1361 bool integral_constant_expression_p;
1363 /* TRUE if we are parsing an integral constant-expression -- but a
1364 non-constant expression should be permitted as well. This flag
1365 is used when parsing an array bound so that GNU variable-length
1366 arrays are tolerated. */
1367 bool allow_non_integral_constant_expression_p;
1369 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1370 been seen that makes the expression non-constant. */
1371 bool non_integral_constant_expression_p;
1373 /* TRUE if local variable names and `this' are forbidden in the
1375 bool local_variables_forbidden_p;
1377 /* TRUE if the declaration we are parsing is part of a
1378 linkage-specification of the form `extern string-literal
1380 bool in_unbraced_linkage_specification_p;
1382 /* TRUE if we are presently parsing a declarator, after the
1383 direct-declarator. */
1384 bool in_declarator_p;
1386 /* TRUE if we are presently parsing a template-argument-list. */
1387 bool in_template_argument_list_p;
1389 /* Set to IN_ITERATION_STMT if parsing an iteration-statement,
1390 to IN_OMP_BLOCK if parsing OpenMP structured block and
1391 IN_OMP_FOR if parsing OpenMP loop. If parsing a switch statement,
1392 this is bitwise ORed with IN_SWITCH_STMT, unless parsing an
1393 iteration-statement, OpenMP block or loop within that switch. */
1394 #define IN_SWITCH_STMT 1
1395 #define IN_ITERATION_STMT 2
1396 #define IN_OMP_BLOCK 4
1397 #define IN_OMP_FOR 8
1398 unsigned char in_statement;
1400 /* TRUE if we are presently parsing the body of a switch statement.
1401 Note that this doesn't quite overlap with in_statement above.
1402 The difference relates to giving the right sets of error messages:
1403 "case not in switch" vs "break statement used with OpenMP...". */
1404 bool in_switch_statement_p;
1406 /* TRUE if we are parsing a type-id in an expression context. In
1407 such a situation, both "type (expr)" and "type (type)" are valid
1409 bool in_type_id_in_expr_p;
1411 /* TRUE if we are currently in a header file where declarations are
1412 implicitly extern "C". */
1413 bool implicit_extern_c;
1415 /* TRUE if strings in expressions should be translated to the execution
1417 bool translate_strings_p;
1419 /* TRUE if we are presently parsing the body of a function, but not
1421 bool in_function_body;
1423 /* If non-NULL, then we are parsing a construct where new type
1424 definitions are not permitted. The string stored here will be
1425 issued as an error message if a type is defined. */
1426 const char *type_definition_forbidden_message;
1428 /* A list of lists. The outer list is a stack, used for member
1429 functions of local classes. At each level there are two sub-list,
1430 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1431 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1432 TREE_VALUE's. The functions are chained in reverse declaration
1435 The TREE_PURPOSE sublist contains those functions with default
1436 arguments that need post processing, and the TREE_VALUE sublist
1437 contains those functions with definitions that need post
1440 These lists can only be processed once the outermost class being
1441 defined is complete. */
1442 tree unparsed_functions_queues;
1444 /* The number of classes whose definitions are currently in
1446 unsigned num_classes_being_defined;
1448 /* The number of template parameter lists that apply directly to the
1449 current declaration. */
1450 unsigned num_template_parameter_lists;
1455 /* Constructors and destructors. */
1457 static cp_parser *cp_parser_new
1460 /* Routines to parse various constructs.
1462 Those that return `tree' will return the error_mark_node (rather
1463 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1464 Sometimes, they will return an ordinary node if error-recovery was
1465 attempted, even though a parse error occurred. So, to check
1466 whether or not a parse error occurred, you should always use
1467 cp_parser_error_occurred. If the construct is optional (indicated
1468 either by an `_opt' in the name of the function that does the
1469 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1470 the construct is not present. */
1472 /* Lexical conventions [gram.lex] */
1474 static tree cp_parser_identifier
1476 static tree cp_parser_string_literal
1477 (cp_parser *, bool, bool);
1479 /* Basic concepts [gram.basic] */
1481 static bool cp_parser_translation_unit
1484 /* Expressions [gram.expr] */
1486 static tree cp_parser_primary_expression
1487 (cp_parser *, bool, bool, bool, cp_id_kind *);
1488 static tree cp_parser_id_expression
1489 (cp_parser *, bool, bool, bool *, bool, bool);
1490 static tree cp_parser_unqualified_id
1491 (cp_parser *, bool, bool, bool, bool);
1492 static tree cp_parser_nested_name_specifier_opt
1493 (cp_parser *, bool, bool, bool, bool);
1494 static tree cp_parser_nested_name_specifier
1495 (cp_parser *, bool, bool, bool, bool);
1496 static tree cp_parser_class_or_namespace_name
1497 (cp_parser *, bool, bool, bool, bool, bool);
1498 static tree cp_parser_postfix_expression
1499 (cp_parser *, bool, bool);
1500 static tree cp_parser_postfix_open_square_expression
1501 (cp_parser *, tree, bool);
1502 static tree cp_parser_postfix_dot_deref_expression
1503 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *);
1504 static tree cp_parser_parenthesized_expression_list
1505 (cp_parser *, bool, bool, bool *);
1506 static void cp_parser_pseudo_destructor_name
1507 (cp_parser *, tree *, tree *);
1508 static tree cp_parser_unary_expression
1509 (cp_parser *, bool, bool);
1510 static enum tree_code cp_parser_unary_operator
1512 static tree cp_parser_new_expression
1514 static tree cp_parser_new_placement
1516 static tree cp_parser_new_type_id
1517 (cp_parser *, tree *);
1518 static cp_declarator *cp_parser_new_declarator_opt
1520 static cp_declarator *cp_parser_direct_new_declarator
1522 static tree cp_parser_new_initializer
1524 static tree cp_parser_delete_expression
1526 static tree cp_parser_cast_expression
1527 (cp_parser *, bool, bool);
1528 static tree cp_parser_binary_expression
1529 (cp_parser *, bool);
1530 static tree cp_parser_question_colon_clause
1531 (cp_parser *, tree);
1532 static tree cp_parser_assignment_expression
1533 (cp_parser *, bool);
1534 static enum tree_code cp_parser_assignment_operator_opt
1536 static tree cp_parser_expression
1537 (cp_parser *, bool);
1538 static tree cp_parser_constant_expression
1539 (cp_parser *, bool, bool *);
1540 static tree cp_parser_builtin_offsetof
1543 /* Statements [gram.stmt.stmt] */
1545 static void cp_parser_statement
1546 (cp_parser *, tree, bool, bool *);
1547 static void cp_parser_label_for_labeled_statement
1549 static tree cp_parser_expression_statement
1550 (cp_parser *, tree);
1551 static tree cp_parser_compound_statement
1552 (cp_parser *, tree, bool);
1553 static void cp_parser_statement_seq_opt
1554 (cp_parser *, tree);
1555 static tree cp_parser_selection_statement
1556 (cp_parser *, bool *);
1557 static tree cp_parser_condition
1559 static tree cp_parser_iteration_statement
1561 static void cp_parser_for_init_statement
1563 static tree cp_parser_jump_statement
1565 static void cp_parser_declaration_statement
1568 static tree cp_parser_implicitly_scoped_statement
1569 (cp_parser *, bool *);
1570 static void cp_parser_already_scoped_statement
1573 /* Declarations [gram.dcl.dcl] */
1575 static void cp_parser_declaration_seq_opt
1577 static void cp_parser_declaration
1579 static void cp_parser_block_declaration
1580 (cp_parser *, bool);
1581 static void cp_parser_simple_declaration
1582 (cp_parser *, bool);
1583 static void cp_parser_decl_specifier_seq
1584 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1585 static tree cp_parser_storage_class_specifier_opt
1587 static tree cp_parser_function_specifier_opt
1588 (cp_parser *, cp_decl_specifier_seq *);
1589 static tree cp_parser_type_specifier
1590 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1592 static tree cp_parser_simple_type_specifier
1593 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1594 static tree cp_parser_type_name
1596 static tree cp_parser_elaborated_type_specifier
1597 (cp_parser *, bool, bool);
1598 static tree cp_parser_enum_specifier
1600 static void cp_parser_enumerator_list
1601 (cp_parser *, tree);
1602 static void cp_parser_enumerator_definition
1603 (cp_parser *, tree);
1604 static tree cp_parser_namespace_name
1606 static void cp_parser_namespace_definition
1608 static void cp_parser_namespace_body
1610 static tree cp_parser_qualified_namespace_specifier
1612 static void cp_parser_namespace_alias_definition
1614 static bool cp_parser_using_declaration
1615 (cp_parser *, bool);
1616 static void cp_parser_using_directive
1618 static void cp_parser_asm_definition
1620 static void cp_parser_linkage_specification
1622 static void cp_parser_static_assert
1623 (cp_parser *, bool);
1625 /* Declarators [gram.dcl.decl] */
1627 static tree cp_parser_init_declarator
1628 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *);
1629 static cp_declarator *cp_parser_declarator
1630 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1631 static cp_declarator *cp_parser_direct_declarator
1632 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1633 static enum tree_code cp_parser_ptr_operator
1634 (cp_parser *, tree *, cp_cv_quals *);
1635 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1637 static tree cp_parser_declarator_id
1638 (cp_parser *, bool);
1639 static tree cp_parser_type_id
1641 static void cp_parser_type_specifier_seq
1642 (cp_parser *, bool, cp_decl_specifier_seq *);
1643 static cp_parameter_declarator *cp_parser_parameter_declaration_clause
1645 static cp_parameter_declarator *cp_parser_parameter_declaration_list
1646 (cp_parser *, bool *);
1647 static cp_parameter_declarator *cp_parser_parameter_declaration
1648 (cp_parser *, bool, bool *);
1649 static void cp_parser_function_body
1651 static tree cp_parser_initializer
1652 (cp_parser *, bool *, bool *);
1653 static tree cp_parser_initializer_clause
1654 (cp_parser *, bool *);
1655 static VEC(constructor_elt,gc) *cp_parser_initializer_list
1656 (cp_parser *, bool *);
1658 static bool cp_parser_ctor_initializer_opt_and_function_body
1661 /* Classes [gram.class] */
1663 static tree cp_parser_class_name
1664 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1665 static tree cp_parser_class_specifier
1667 static tree cp_parser_class_head
1668 (cp_parser *, bool *, tree *, tree *);
1669 static enum tag_types cp_parser_class_key
1671 static void cp_parser_member_specification_opt
1673 static void cp_parser_member_declaration
1675 static tree cp_parser_pure_specifier
1677 static tree cp_parser_constant_initializer
1680 /* Derived classes [gram.class.derived] */
1682 static tree cp_parser_base_clause
1684 static tree cp_parser_base_specifier
1687 /* Special member functions [gram.special] */
1689 static tree cp_parser_conversion_function_id
1691 static tree cp_parser_conversion_type_id
1693 static cp_declarator *cp_parser_conversion_declarator_opt
1695 static bool cp_parser_ctor_initializer_opt
1697 static void cp_parser_mem_initializer_list
1699 static tree cp_parser_mem_initializer
1701 static tree cp_parser_mem_initializer_id
1704 /* Overloading [gram.over] */
1706 static tree cp_parser_operator_function_id
1708 static tree cp_parser_operator
1711 /* Templates [gram.temp] */
1713 static void cp_parser_template_declaration
1714 (cp_parser *, bool);
1715 static tree cp_parser_template_parameter_list
1717 static tree cp_parser_template_parameter
1718 (cp_parser *, bool *);
1719 static tree cp_parser_type_parameter
1721 static tree cp_parser_template_id
1722 (cp_parser *, bool, bool, bool);
1723 static tree cp_parser_template_name
1724 (cp_parser *, bool, bool, bool, bool *);
1725 static tree cp_parser_template_argument_list
1727 static tree cp_parser_template_argument
1729 static void cp_parser_explicit_instantiation
1731 static void cp_parser_explicit_specialization
1734 /* Exception handling [gram.exception] */
1736 static tree cp_parser_try_block
1738 static bool cp_parser_function_try_block
1740 static void cp_parser_handler_seq
1742 static void cp_parser_handler
1744 static tree cp_parser_exception_declaration
1746 static tree cp_parser_throw_expression
1748 static tree cp_parser_exception_specification_opt
1750 static tree cp_parser_type_id_list
1753 /* GNU Extensions */
1755 static tree cp_parser_asm_specification_opt
1757 static tree cp_parser_asm_operand_list
1759 static tree cp_parser_asm_clobber_list
1761 static tree cp_parser_attributes_opt
1763 static tree cp_parser_attribute_list
1765 static bool cp_parser_extension_opt
1766 (cp_parser *, int *);
1767 static void cp_parser_label_declaration
1770 enum pragma_context { pragma_external, pragma_stmt, pragma_compound };
1771 static bool cp_parser_pragma
1772 (cp_parser *, enum pragma_context);
1774 /* Objective-C++ Productions */
1776 static tree cp_parser_objc_message_receiver
1778 static tree cp_parser_objc_message_args
1780 static tree cp_parser_objc_message_expression
1782 static tree cp_parser_objc_encode_expression
1784 static tree cp_parser_objc_defs_expression
1786 static tree cp_parser_objc_protocol_expression
1788 static tree cp_parser_objc_selector_expression
1790 static tree cp_parser_objc_expression
1792 static bool cp_parser_objc_selector_p
1794 static tree cp_parser_objc_selector
1796 static tree cp_parser_objc_protocol_refs_opt
1798 static void cp_parser_objc_declaration
1800 static tree cp_parser_objc_statement
1803 /* Utility Routines */
1805 static tree cp_parser_lookup_name
1806 (cp_parser *, tree, enum tag_types, bool, bool, bool, tree *);
1807 static tree cp_parser_lookup_name_simple
1808 (cp_parser *, tree);
1809 static tree cp_parser_maybe_treat_template_as_class
1811 static bool cp_parser_check_declarator_template_parameters
1812 (cp_parser *, cp_declarator *);
1813 static bool cp_parser_check_template_parameters
1814 (cp_parser *, unsigned);
1815 static tree cp_parser_simple_cast_expression
1817 static tree cp_parser_global_scope_opt
1818 (cp_parser *, bool);
1819 static bool cp_parser_constructor_declarator_p
1820 (cp_parser *, bool);
1821 static tree cp_parser_function_definition_from_specifiers_and_declarator
1822 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1823 static tree cp_parser_function_definition_after_declarator
1824 (cp_parser *, bool);
1825 static void cp_parser_template_declaration_after_export
1826 (cp_parser *, bool);
1827 static void cp_parser_perform_template_parameter_access_checks
1828 (VEC (deferred_access_check,gc)*);
1829 static tree cp_parser_single_declaration
1830 (cp_parser *, VEC (deferred_access_check,gc)*, bool, bool *);
1831 static tree cp_parser_functional_cast
1832 (cp_parser *, tree);
1833 static tree cp_parser_save_member_function_body
1834 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1835 static tree cp_parser_enclosed_template_argument_list
1837 static void cp_parser_save_default_args
1838 (cp_parser *, tree);
1839 static void cp_parser_late_parsing_for_member
1840 (cp_parser *, tree);
1841 static void cp_parser_late_parsing_default_args
1842 (cp_parser *, tree);
1843 static tree cp_parser_sizeof_operand
1844 (cp_parser *, enum rid);
1845 static bool cp_parser_declares_only_class_p
1847 static void cp_parser_set_storage_class
1848 (cp_parser *, cp_decl_specifier_seq *, enum rid);
1849 static void cp_parser_set_decl_spec_type
1850 (cp_decl_specifier_seq *, tree, bool);
1851 static bool cp_parser_friend_p
1852 (const cp_decl_specifier_seq *);
1853 static cp_token *cp_parser_require
1854 (cp_parser *, enum cpp_ttype, const char *);
1855 static cp_token *cp_parser_require_keyword
1856 (cp_parser *, enum rid, const char *);
1857 static bool cp_parser_token_starts_function_definition_p
1859 static bool cp_parser_next_token_starts_class_definition_p
1861 static bool cp_parser_next_token_ends_template_argument_p
1863 static bool cp_parser_nth_token_starts_template_argument_list_p
1864 (cp_parser *, size_t);
1865 static enum tag_types cp_parser_token_is_class_key
1867 static void cp_parser_check_class_key
1868 (enum tag_types, tree type);
1869 static void cp_parser_check_access_in_redeclaration
1871 static bool cp_parser_optional_template_keyword
1873 static void cp_parser_pre_parsed_nested_name_specifier
1875 static void cp_parser_cache_group
1876 (cp_parser *, enum cpp_ttype, unsigned);
1877 static void cp_parser_parse_tentatively
1879 static void cp_parser_commit_to_tentative_parse
1881 static void cp_parser_abort_tentative_parse
1883 static bool cp_parser_parse_definitely
1885 static inline bool cp_parser_parsing_tentatively
1887 static bool cp_parser_uncommitted_to_tentative_parse_p
1889 static void cp_parser_error
1890 (cp_parser *, const char *);
1891 static void cp_parser_name_lookup_error
1892 (cp_parser *, tree, tree, const char *);
1893 static bool cp_parser_simulate_error
1895 static bool cp_parser_check_type_definition
1897 static void cp_parser_check_for_definition_in_return_type
1898 (cp_declarator *, tree);
1899 static void cp_parser_check_for_invalid_template_id
1900 (cp_parser *, tree);
1901 static bool cp_parser_non_integral_constant_expression
1902 (cp_parser *, const char *);
1903 static void cp_parser_diagnose_invalid_type_name
1904 (cp_parser *, tree, tree);
1905 static bool cp_parser_parse_and_diagnose_invalid_type_name
1907 static int cp_parser_skip_to_closing_parenthesis
1908 (cp_parser *, bool, bool, bool);
1909 static void cp_parser_skip_to_end_of_statement
1911 static void cp_parser_consume_semicolon_at_end_of_statement
1913 static void cp_parser_skip_to_end_of_block_or_statement
1915 static void cp_parser_skip_to_closing_brace
1917 static void cp_parser_skip_to_end_of_template_parameter_list
1919 static void cp_parser_skip_to_pragma_eol
1920 (cp_parser*, cp_token *);
1921 static bool cp_parser_error_occurred
1923 static bool cp_parser_allow_gnu_extensions_p
1925 static bool cp_parser_is_string_literal
1927 static bool cp_parser_is_keyword
1928 (cp_token *, enum rid);
1929 static tree cp_parser_make_typename_type
1930 (cp_parser *, tree, tree);
1932 /* Returns nonzero if we are parsing tentatively. */
1935 cp_parser_parsing_tentatively (cp_parser* parser)
1937 return parser->context->next != NULL;
1940 /* Returns nonzero if TOKEN is a string literal. */
1943 cp_parser_is_string_literal (cp_token* token)
1945 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1948 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1951 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1953 return token->keyword == keyword;
1956 /* If not parsing tentatively, issue a diagnostic of the form
1957 FILE:LINE: MESSAGE before TOKEN
1958 where TOKEN is the next token in the input stream. MESSAGE
1959 (specified by the caller) is usually of the form "expected
1963 cp_parser_error (cp_parser* parser, const char* message)
1965 if (!cp_parser_simulate_error (parser))
1967 cp_token *token = cp_lexer_peek_token (parser->lexer);
1968 /* This diagnostic makes more sense if it is tagged to the line
1969 of the token we just peeked at. */
1970 cp_lexer_set_source_position_from_token (token);
1972 if (token->type == CPP_PRAGMA)
1974 error ("%<#pragma%> is not allowed here");
1975 cp_parser_skip_to_pragma_eol (parser, token);
1979 c_parse_error (message,
1980 /* Because c_parser_error does not understand
1981 CPP_KEYWORD, keywords are treated like
1983 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
1988 /* Issue an error about name-lookup failing. NAME is the
1989 IDENTIFIER_NODE DECL is the result of
1990 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1991 the thing that we hoped to find. */
1994 cp_parser_name_lookup_error (cp_parser* parser,
1997 const char* desired)
1999 /* If name lookup completely failed, tell the user that NAME was not
2001 if (decl == error_mark_node)
2003 if (parser->scope && parser->scope != global_namespace)
2004 error ("%<%D::%D%> has not been declared",
2005 parser->scope, name);
2006 else if (parser->scope == global_namespace)
2007 error ("%<::%D%> has not been declared", name);
2008 else if (parser->object_scope
2009 && !CLASS_TYPE_P (parser->object_scope))
2010 error ("request for member %qD in non-class type %qT",
2011 name, parser->object_scope);
2012 else if (parser->object_scope)
2013 error ("%<%T::%D%> has not been declared",
2014 parser->object_scope, name);
2016 error ("%qD has not been declared", name);
2018 else if (parser->scope && parser->scope != global_namespace)
2019 error ("%<%D::%D%> %s", parser->scope, name, desired);
2020 else if (parser->scope == global_namespace)
2021 error ("%<::%D%> %s", name, desired);
2023 error ("%qD %s", name, desired);
2026 /* If we are parsing tentatively, remember that an error has occurred
2027 during this tentative parse. Returns true if the error was
2028 simulated; false if a message should be issued by the caller. */
2031 cp_parser_simulate_error (cp_parser* parser)
2033 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2035 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2041 /* Check for repeated decl-specifiers. */
2044 cp_parser_check_decl_spec (cp_decl_specifier_seq *decl_specs)
2048 for (ds = ds_first; ds != ds_last; ++ds)
2050 unsigned count = decl_specs->specs[(int)ds];
2053 /* The "long" specifier is a special case because of "long long". */
2057 error ("%<long long long%> is too long for GCC");
2058 else if (pedantic && !in_system_header && warn_long_long)
2059 pedwarn ("ISO C++ does not support %<long long%>");
2063 static const char *const decl_spec_names[] = {
2079 error ("duplicate %qs", decl_spec_names[(int)ds]);
2084 /* This function is called when a type is defined. If type
2085 definitions are forbidden at this point, an error message is
2089 cp_parser_check_type_definition (cp_parser* parser)
2091 /* If types are forbidden here, issue a message. */
2092 if (parser->type_definition_forbidden_message)
2094 /* Use `%s' to print the string in case there are any escape
2095 characters in the message. */
2096 error ("%s", parser->type_definition_forbidden_message);
2102 /* This function is called when the DECLARATOR is processed. The TYPE
2103 was a type defined in the decl-specifiers. If it is invalid to
2104 define a type in the decl-specifiers for DECLARATOR, an error is
2108 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2111 /* [dcl.fct] forbids type definitions in return types.
2112 Unfortunately, it's not easy to know whether or not we are
2113 processing a return type until after the fact. */
2115 && (declarator->kind == cdk_pointer
2116 || declarator->kind == cdk_reference
2117 || declarator->kind == cdk_ptrmem))
2118 declarator = declarator->declarator;
2120 && declarator->kind == cdk_function)
2122 error ("new types may not be defined in a return type");
2123 inform ("(perhaps a semicolon is missing after the definition of %qT)",
2128 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2129 "<" in any valid C++ program. If the next token is indeed "<",
2130 issue a message warning the user about what appears to be an
2131 invalid attempt to form a template-id. */
2134 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2137 cp_token_position start = 0;
2139 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2142 error ("%qT is not a template", type);
2143 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2144 error ("%qE is not a template", type);
2146 error ("invalid template-id");
2147 /* Remember the location of the invalid "<". */
2148 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2149 start = cp_lexer_token_position (parser->lexer, true);
2150 /* Consume the "<". */
2151 cp_lexer_consume_token (parser->lexer);
2152 /* Parse the template arguments. */
2153 cp_parser_enclosed_template_argument_list (parser);
2154 /* Permanently remove the invalid template arguments so that
2155 this error message is not issued again. */
2157 cp_lexer_purge_tokens_after (parser->lexer, start);
2161 /* If parsing an integral constant-expression, issue an error message
2162 about the fact that THING appeared and return true. Otherwise,
2163 return false. In either case, set
2164 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2167 cp_parser_non_integral_constant_expression (cp_parser *parser,
2170 parser->non_integral_constant_expression_p = true;
2171 if (parser->integral_constant_expression_p)
2173 if (!parser->allow_non_integral_constant_expression_p)
2175 error ("%s cannot appear in a constant-expression", thing);
2182 /* Emit a diagnostic for an invalid type name. SCOPE is the
2183 qualifying scope (or NULL, if none) for ID. This function commits
2184 to the current active tentative parse, if any. (Otherwise, the
2185 problematic construct might be encountered again later, resulting
2186 in duplicate error messages.) */
2189 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
2191 tree decl, old_scope;
2192 /* Try to lookup the identifier. */
2193 old_scope = parser->scope;
2194 parser->scope = scope;
2195 decl = cp_parser_lookup_name_simple (parser, id);
2196 parser->scope = old_scope;
2197 /* If the lookup found a template-name, it means that the user forgot
2198 to specify an argument list. Emit a useful error message. */
2199 if (TREE_CODE (decl) == TEMPLATE_DECL)
2200 error ("invalid use of template-name %qE without an argument list", decl);
2201 else if (TREE_CODE (id) == BIT_NOT_EXPR)
2202 error ("invalid use of destructor %qD as a type", id);
2203 else if (TREE_CODE (decl) == TYPE_DECL)
2204 /* Something like 'unsigned A a;' */
2205 error ("invalid combination of multiple type-specifiers");
2206 else if (!parser->scope)
2208 /* Issue an error message. */
2209 error ("%qE does not name a type", id);
2210 /* If we're in a template class, it's possible that the user was
2211 referring to a type from a base class. For example:
2213 template <typename T> struct A { typedef T X; };
2214 template <typename T> struct B : public A<T> { X x; };
2216 The user should have said "typename A<T>::X". */
2217 if (processing_template_decl && current_class_type
2218 && TYPE_BINFO (current_class_type))
2222 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2226 tree base_type = BINFO_TYPE (b);
2227 if (CLASS_TYPE_P (base_type)
2228 && dependent_type_p (base_type))
2231 /* Go from a particular instantiation of the
2232 template (which will have an empty TYPE_FIELDs),
2233 to the main version. */
2234 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2235 for (field = TYPE_FIELDS (base_type);
2237 field = TREE_CHAIN (field))
2238 if (TREE_CODE (field) == TYPE_DECL
2239 && DECL_NAME (field) == id)
2241 inform ("(perhaps %<typename %T::%E%> was intended)",
2242 BINFO_TYPE (b), id);
2251 /* Here we diagnose qualified-ids where the scope is actually correct,
2252 but the identifier does not resolve to a valid type name. */
2253 else if (parser->scope != error_mark_node)
2255 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2256 error ("%qE in namespace %qE does not name a type",
2258 else if (TYPE_P (parser->scope))
2259 error ("%qE in class %qT does not name a type", id, parser->scope);
2263 cp_parser_commit_to_tentative_parse (parser);
2266 /* Check for a common situation where a type-name should be present,
2267 but is not, and issue a sensible error message. Returns true if an
2268 invalid type-name was detected.
2270 The situation handled by this function are variable declarations of the
2271 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2272 Usually, `ID' should name a type, but if we got here it means that it
2273 does not. We try to emit the best possible error message depending on
2274 how exactly the id-expression looks like. */
2277 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2281 cp_parser_parse_tentatively (parser);
2282 id = cp_parser_id_expression (parser,
2283 /*template_keyword_p=*/false,
2284 /*check_dependency_p=*/true,
2285 /*template_p=*/NULL,
2286 /*declarator_p=*/true,
2287 /*optional_p=*/false);
2288 /* After the id-expression, there should be a plain identifier,
2289 otherwise this is not a simple variable declaration. Also, if
2290 the scope is dependent, we cannot do much. */
2291 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2292 || (parser->scope && TYPE_P (parser->scope)
2293 && dependent_type_p (parser->scope)))
2295 cp_parser_abort_tentative_parse (parser);
2298 if (!cp_parser_parse_definitely (parser) || TREE_CODE (id) == TYPE_DECL)
2301 /* Emit a diagnostic for the invalid type. */
2302 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2303 /* Skip to the end of the declaration; there's no point in
2304 trying to process it. */
2305 cp_parser_skip_to_end_of_block_or_statement (parser);
2309 /* Consume tokens up to, and including, the next non-nested closing `)'.
2310 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2311 are doing error recovery. Returns -1 if OR_COMMA is true and we
2312 found an unnested comma. */
2315 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2320 unsigned paren_depth = 0;
2321 unsigned brace_depth = 0;
2323 if (recovering && !or_comma
2324 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2329 cp_token * token = cp_lexer_peek_token (parser->lexer);
2331 switch (token->type)
2334 case CPP_PRAGMA_EOL:
2335 /* If we've run out of tokens, then there is no closing `)'. */
2339 /* This matches the processing in skip_to_end_of_statement. */
2344 case CPP_OPEN_BRACE:
2347 case CPP_CLOSE_BRACE:
2353 if (recovering && or_comma && !brace_depth && !paren_depth)
2357 case CPP_OPEN_PAREN:
2362 case CPP_CLOSE_PAREN:
2363 if (!brace_depth && !paren_depth--)
2366 cp_lexer_consume_token (parser->lexer);
2375 /* Consume the token. */
2376 cp_lexer_consume_token (parser->lexer);
2380 /* Consume tokens until we reach the end of the current statement.
2381 Normally, that will be just before consuming a `;'. However, if a
2382 non-nested `}' comes first, then we stop before consuming that. */
2385 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2387 unsigned nesting_depth = 0;
2391 cp_token *token = cp_lexer_peek_token (parser->lexer);
2393 switch (token->type)
2396 case CPP_PRAGMA_EOL:
2397 /* If we've run out of tokens, stop. */
2401 /* If the next token is a `;', we have reached the end of the
2407 case CPP_CLOSE_BRACE:
2408 /* If this is a non-nested '}', stop before consuming it.
2409 That way, when confronted with something like:
2413 we stop before consuming the closing '}', even though we
2414 have not yet reached a `;'. */
2415 if (nesting_depth == 0)
2418 /* If it is the closing '}' for a block that we have
2419 scanned, stop -- but only after consuming the token.
2425 we will stop after the body of the erroneously declared
2426 function, but before consuming the following `typedef'
2428 if (--nesting_depth == 0)
2430 cp_lexer_consume_token (parser->lexer);
2434 case CPP_OPEN_BRACE:
2442 /* Consume the token. */
2443 cp_lexer_consume_token (parser->lexer);
2447 /* This function is called at the end of a statement or declaration.
2448 If the next token is a semicolon, it is consumed; otherwise, error
2449 recovery is attempted. */
2452 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2454 /* Look for the trailing `;'. */
2455 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2457 /* If there is additional (erroneous) input, skip to the end of
2459 cp_parser_skip_to_end_of_statement (parser);
2460 /* If the next token is now a `;', consume it. */
2461 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2462 cp_lexer_consume_token (parser->lexer);
2466 /* Skip tokens until we have consumed an entire block, or until we
2467 have consumed a non-nested `;'. */
2470 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2472 int nesting_depth = 0;
2474 while (nesting_depth >= 0)
2476 cp_token *token = cp_lexer_peek_token (parser->lexer);
2478 switch (token->type)
2481 case CPP_PRAGMA_EOL:
2482 /* If we've run out of tokens, stop. */
2486 /* Stop if this is an unnested ';'. */
2491 case CPP_CLOSE_BRACE:
2492 /* Stop if this is an unnested '}', or closes the outermost
2499 case CPP_OPEN_BRACE:
2508 /* Consume the token. */
2509 cp_lexer_consume_token (parser->lexer);
2513 /* Skip tokens until a non-nested closing curly brace is the next
2517 cp_parser_skip_to_closing_brace (cp_parser *parser)
2519 unsigned nesting_depth = 0;
2523 cp_token *token = cp_lexer_peek_token (parser->lexer);
2525 switch (token->type)
2528 case CPP_PRAGMA_EOL:
2529 /* If we've run out of tokens, stop. */
2532 case CPP_CLOSE_BRACE:
2533 /* If the next token is a non-nested `}', then we have reached
2534 the end of the current block. */
2535 if (nesting_depth-- == 0)
2539 case CPP_OPEN_BRACE:
2540 /* If it the next token is a `{', then we are entering a new
2541 block. Consume the entire block. */
2549 /* Consume the token. */
2550 cp_lexer_consume_token (parser->lexer);
2554 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
2555 parameter is the PRAGMA token, allowing us to purge the entire pragma
2559 cp_parser_skip_to_pragma_eol (cp_parser* parser, cp_token *pragma_tok)
2563 parser->lexer->in_pragma = false;
2566 token = cp_lexer_consume_token (parser->lexer);
2567 while (token->type != CPP_PRAGMA_EOL && token->type != CPP_EOF);
2569 /* Ensure that the pragma is not parsed again. */
2570 cp_lexer_purge_tokens_after (parser->lexer, pragma_tok);
2573 /* Require pragma end of line, resyncing with it as necessary. The
2574 arguments are as for cp_parser_skip_to_pragma_eol. */
2577 cp_parser_require_pragma_eol (cp_parser *parser, cp_token *pragma_tok)
2579 parser->lexer->in_pragma = false;
2580 if (!cp_parser_require (parser, CPP_PRAGMA_EOL, "end of line"))
2581 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
2584 /* This is a simple wrapper around make_typename_type. When the id is
2585 an unresolved identifier node, we can provide a superior diagnostic
2586 using cp_parser_diagnose_invalid_type_name. */
2589 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2592 if (TREE_CODE (id) == IDENTIFIER_NODE)
2594 result = make_typename_type (scope, id, typename_type,
2595 /*complain=*/tf_none);
2596 if (result == error_mark_node)
2597 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2600 return make_typename_type (scope, id, typename_type, tf_error);
2604 /* Create a new C++ parser. */
2607 cp_parser_new (void)
2613 /* cp_lexer_new_main is called before calling ggc_alloc because
2614 cp_lexer_new_main might load a PCH file. */
2615 lexer = cp_lexer_new_main ();
2617 /* Initialize the binops_by_token so that we can get the tree
2618 directly from the token. */
2619 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2620 binops_by_token[binops[i].token_type] = binops[i];
2622 parser = GGC_CNEW (cp_parser);
2623 parser->lexer = lexer;
2624 parser->context = cp_parser_context_new (NULL);
2626 /* For now, we always accept GNU extensions. */
2627 parser->allow_gnu_extensions_p = 1;
2629 /* The `>' token is a greater-than operator, not the end of a
2631 parser->greater_than_is_operator_p = true;
2633 parser->default_arg_ok_p = true;
2635 /* We are not parsing a constant-expression. */
2636 parser->integral_constant_expression_p = false;
2637 parser->allow_non_integral_constant_expression_p = false;
2638 parser->non_integral_constant_expression_p = false;
2640 /* Local variable names are not forbidden. */
2641 parser->local_variables_forbidden_p = false;
2643 /* We are not processing an `extern "C"' declaration. */
2644 parser->in_unbraced_linkage_specification_p = false;
2646 /* We are not processing a declarator. */
2647 parser->in_declarator_p = false;
2649 /* We are not processing a template-argument-list. */
2650 parser->in_template_argument_list_p = false;
2652 /* We are not in an iteration statement. */
2653 parser->in_statement = 0;
2655 /* We are not in a switch statement. */
2656 parser->in_switch_statement_p = false;
2658 /* We are not parsing a type-id inside an expression. */
2659 parser->in_type_id_in_expr_p = false;
2661 /* Declarations aren't implicitly extern "C". */
2662 parser->implicit_extern_c = false;
2664 /* String literals should be translated to the execution character set. */
2665 parser->translate_strings_p = true;
2667 /* We are not parsing a function body. */
2668 parser->in_function_body = false;
2670 /* The unparsed function queue is empty. */
2671 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2673 /* There are no classes being defined. */
2674 parser->num_classes_being_defined = 0;
2676 /* No template parameters apply. */
2677 parser->num_template_parameter_lists = 0;
2682 /* Create a cp_lexer structure which will emit the tokens in CACHE
2683 and push it onto the parser's lexer stack. This is used for delayed
2684 parsing of in-class method bodies and default arguments, and should
2685 not be confused with tentative parsing. */
2687 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
2689 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
2690 lexer->next = parser->lexer;
2691 parser->lexer = lexer;
2693 /* Move the current source position to that of the first token in the
2695 cp_lexer_set_source_position_from_token (lexer->next_token);
2698 /* Pop the top lexer off the parser stack. This is never used for the
2699 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2701 cp_parser_pop_lexer (cp_parser *parser)
2703 cp_lexer *lexer = parser->lexer;
2704 parser->lexer = lexer->next;
2705 cp_lexer_destroy (lexer);
2707 /* Put the current source position back where it was before this
2708 lexer was pushed. */
2709 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
2712 /* Lexical conventions [gram.lex] */
2714 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2718 cp_parser_identifier (cp_parser* parser)
2722 /* Look for the identifier. */
2723 token = cp_parser_require (parser, CPP_NAME, "identifier");
2724 /* Return the value. */
2725 return token ? token->u.value : error_mark_node;
2728 /* Parse a sequence of adjacent string constants. Returns a
2729 TREE_STRING representing the combined, nul-terminated string
2730 constant. If TRANSLATE is true, translate the string to the
2731 execution character set. If WIDE_OK is true, a wide string is
2734 C++98 [lex.string] says that if a narrow string literal token is
2735 adjacent to a wide string literal token, the behavior is undefined.
2736 However, C99 6.4.5p4 says that this results in a wide string literal.
2737 We follow C99 here, for consistency with the C front end.
2739 This code is largely lifted from lex_string() in c-lex.c.
2741 FUTURE: ObjC++ will need to handle @-strings here. */
2743 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
2748 struct obstack str_ob;
2749 cpp_string str, istr, *strs;
2752 tok = cp_lexer_peek_token (parser->lexer);
2753 if (!cp_parser_is_string_literal (tok))
2755 cp_parser_error (parser, "expected string-literal");
2756 return error_mark_node;
2759 /* Try to avoid the overhead of creating and destroying an obstack
2760 for the common case of just one string. */
2761 if (!cp_parser_is_string_literal
2762 (cp_lexer_peek_nth_token (parser->lexer, 2)))
2764 cp_lexer_consume_token (parser->lexer);
2766 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->u.value);
2767 str.len = TREE_STRING_LENGTH (tok->u.value);
2769 if (tok->type == CPP_WSTRING)
2776 gcc_obstack_init (&str_ob);
2781 cp_lexer_consume_token (parser->lexer);
2783 str.text = (unsigned char *)TREE_STRING_POINTER (tok->u.value);
2784 str.len = TREE_STRING_LENGTH (tok->u.value);
2785 if (tok->type == CPP_WSTRING)
2788 obstack_grow (&str_ob, &str, sizeof (cpp_string));
2790 tok = cp_lexer_peek_token (parser->lexer);
2792 while (cp_parser_is_string_literal (tok));
2794 strs = (cpp_string *) obstack_finish (&str_ob);
2797 if (wide && !wide_ok)
2799 cp_parser_error (parser, "a wide string is invalid in this context");
2803 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
2804 (parse_in, strs, count, &istr, wide))
2806 value = build_string (istr.len, (char *)istr.text);
2807 free ((void *)istr.text);
2809 TREE_TYPE (value) = wide ? wchar_array_type_node : char_array_type_node;
2810 value = fix_string_type (value);
2813 /* cpp_interpret_string has issued an error. */
2814 value = error_mark_node;
2817 obstack_free (&str_ob, 0);
2823 /* Basic concepts [gram.basic] */
2825 /* Parse a translation-unit.
2828 declaration-seq [opt]
2830 Returns TRUE if all went well. */
2833 cp_parser_translation_unit (cp_parser* parser)
2835 /* The address of the first non-permanent object on the declarator
2837 static void *declarator_obstack_base;
2841 /* Create the declarator obstack, if necessary. */
2842 if (!cp_error_declarator)
2844 gcc_obstack_init (&declarator_obstack);
2845 /* Create the error declarator. */
2846 cp_error_declarator = make_declarator (cdk_error);
2847 /* Create the empty parameter list. */
2848 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
2849 /* Remember where the base of the declarator obstack lies. */
2850 declarator_obstack_base = obstack_next_free (&declarator_obstack);
2853 cp_parser_declaration_seq_opt (parser);
2855 /* If there are no tokens left then all went well. */
2856 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2858 /* Get rid of the token array; we don't need it any more. */
2859 cp_lexer_destroy (parser->lexer);
2860 parser->lexer = NULL;
2862 /* This file might have been a context that's implicitly extern
2863 "C". If so, pop the lang context. (Only relevant for PCH.) */
2864 if (parser->implicit_extern_c)
2866 pop_lang_context ();
2867 parser->implicit_extern_c = false;
2871 finish_translation_unit ();
2877 cp_parser_error (parser, "expected declaration");
2881 /* Make sure the declarator obstack was fully cleaned up. */
2882 gcc_assert (obstack_next_free (&declarator_obstack)
2883 == declarator_obstack_base);
2885 /* All went well. */
2889 /* Expressions [gram.expr] */
2891 /* Parse a primary-expression.
2902 ( compound-statement )
2903 __builtin_va_arg ( assignment-expression , type-id )
2904 __builtin_offsetof ( type-id , offsetof-expression )
2906 Objective-C++ Extension:
2914 ADDRESS_P is true iff this expression was immediately preceded by
2915 "&" and therefore might denote a pointer-to-member. CAST_P is true
2916 iff this expression is the target of a cast. TEMPLATE_ARG_P is
2917 true iff this expression is a template argument.
2919 Returns a representation of the expression. Upon return, *IDK
2920 indicates what kind of id-expression (if any) was present. */
2923 cp_parser_primary_expression (cp_parser *parser,
2926 bool template_arg_p,
2931 /* Assume the primary expression is not an id-expression. */
2932 *idk = CP_ID_KIND_NONE;
2934 /* Peek at the next token. */
2935 token = cp_lexer_peek_token (parser->lexer);
2936 switch (token->type)
2947 token = cp_lexer_consume_token (parser->lexer);
2948 /* Floating-point literals are only allowed in an integral
2949 constant expression if they are cast to an integral or
2950 enumeration type. */
2951 if (TREE_CODE (token->u.value) == REAL_CST
2952 && parser->integral_constant_expression_p
2955 /* CAST_P will be set even in invalid code like "int(2.7 +
2956 ...)". Therefore, we have to check that the next token
2957 is sure to end the cast. */
2960 cp_token *next_token;
2962 next_token = cp_lexer_peek_token (parser->lexer);
2963 if (/* The comma at the end of an
2964 enumerator-definition. */
2965 next_token->type != CPP_COMMA
2966 /* The curly brace at the end of an enum-specifier. */
2967 && next_token->type != CPP_CLOSE_BRACE
2968 /* The end of a statement. */
2969 && next_token->type != CPP_SEMICOLON
2970 /* The end of the cast-expression. */
2971 && next_token->type != CPP_CLOSE_PAREN
2972 /* The end of an array bound. */
2973 && next_token->type != CPP_CLOSE_SQUARE
2974 /* The closing ">" in a template-argument-list. */
2975 && (next_token->type != CPP_GREATER
2976 || parser->greater_than_is_operator_p))
2980 /* If we are within a cast, then the constraint that the
2981 cast is to an integral or enumeration type will be
2982 checked at that point. If we are not within a cast, then
2983 this code is invalid. */
2985 cp_parser_non_integral_constant_expression
2986 (parser, "floating-point literal");
2988 return token->u.value;
2992 /* ??? Should wide strings be allowed when parser->translate_strings_p
2993 is false (i.e. in attributes)? If not, we can kill the third
2994 argument to cp_parser_string_literal. */
2995 return cp_parser_string_literal (parser,
2996 parser->translate_strings_p,
2999 case CPP_OPEN_PAREN:
3002 bool saved_greater_than_is_operator_p;
3004 /* Consume the `('. */
3005 cp_lexer_consume_token (parser->lexer);
3006 /* Within a parenthesized expression, a `>' token is always
3007 the greater-than operator. */
3008 saved_greater_than_is_operator_p
3009 = parser->greater_than_is_operator_p;
3010 parser->greater_than_is_operator_p = true;
3011 /* If we see `( { ' then we are looking at the beginning of
3012 a GNU statement-expression. */
3013 if (cp_parser_allow_gnu_extensions_p (parser)
3014 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
3016 /* Statement-expressions are not allowed by the standard. */
3018 pedwarn ("ISO C++ forbids braced-groups within expressions");
3020 /* And they're not allowed outside of a function-body; you
3021 cannot, for example, write:
3023 int i = ({ int j = 3; j + 1; });
3025 at class or namespace scope. */
3026 if (!parser->in_function_body)
3027 error ("statement-expressions are allowed only inside functions");
3028 /* Start the statement-expression. */
3029 expr = begin_stmt_expr ();
3030 /* Parse the compound-statement. */
3031 cp_parser_compound_statement (parser, expr, false);
3033 expr = finish_stmt_expr (expr, false);
3037 /* Parse the parenthesized expression. */
3038 expr = cp_parser_expression (parser, cast_p);
3039 /* Let the front end know that this expression was
3040 enclosed in parentheses. This matters in case, for
3041 example, the expression is of the form `A::B', since
3042 `&A::B' might be a pointer-to-member, but `&(A::B)' is
3044 finish_parenthesized_expr (expr);
3046 /* The `>' token might be the end of a template-id or
3047 template-parameter-list now. */
3048 parser->greater_than_is_operator_p
3049 = saved_greater_than_is_operator_p;
3050 /* Consume the `)'. */
3051 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
3052 cp_parser_skip_to_end_of_statement (parser);
3058 switch (token->keyword)
3060 /* These two are the boolean literals. */
3062 cp_lexer_consume_token (parser->lexer);
3063 return boolean_true_node;
3065 cp_lexer_consume_token (parser->lexer);
3066 return boolean_false_node;
3068 /* The `__null' literal. */
3070 cp_lexer_consume_token (parser->lexer);
3073 /* Recognize the `this' keyword. */
3075 cp_lexer_consume_token (parser->lexer);
3076 if (parser->local_variables_forbidden_p)
3078 error ("%<this%> may not be used in this context");
3079 return error_mark_node;
3081 /* Pointers cannot appear in constant-expressions. */
3082 if (cp_parser_non_integral_constant_expression (parser,
3084 return error_mark_node;
3085 return finish_this_expr ();
3087 /* The `operator' keyword can be the beginning of an
3092 case RID_FUNCTION_NAME:
3093 case RID_PRETTY_FUNCTION_NAME:
3094 case RID_C99_FUNCTION_NAME:
3095 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
3096 __func__ are the names of variables -- but they are
3097 treated specially. Therefore, they are handled here,
3098 rather than relying on the generic id-expression logic
3099 below. Grammatically, these names are id-expressions.
3101 Consume the token. */
3102 token = cp_lexer_consume_token (parser->lexer);
3103 /* Look up the name. */
3104 return finish_fname (token->u.value);
3111 /* The `__builtin_va_arg' construct is used to handle
3112 `va_arg'. Consume the `__builtin_va_arg' token. */
3113 cp_lexer_consume_token (parser->lexer);
3114 /* Look for the opening `('. */
3115 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3116 /* Now, parse the assignment-expression. */
3117 expression = cp_parser_assignment_expression (parser,
3119 /* Look for the `,'. */
3120 cp_parser_require (parser, CPP_COMMA, "`,'");
3121 /* Parse the type-id. */
3122 type = cp_parser_type_id (parser);
3123 /* Look for the closing `)'. */
3124 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3125 /* Using `va_arg' in a constant-expression is not
3127 if (cp_parser_non_integral_constant_expression (parser,
3129 return error_mark_node;
3130 return build_x_va_arg (expression, type);
3134 return cp_parser_builtin_offsetof (parser);
3136 /* Objective-C++ expressions. */
3138 case RID_AT_PROTOCOL:
3139 case RID_AT_SELECTOR:
3140 return cp_parser_objc_expression (parser);
3143 cp_parser_error (parser, "expected primary-expression");
3144 return error_mark_node;
3147 /* An id-expression can start with either an identifier, a
3148 `::' as the beginning of a qualified-id, or the "operator"
3152 case CPP_TEMPLATE_ID:
3153 case CPP_NESTED_NAME_SPECIFIER:
3157 const char *error_msg;
3162 /* Parse the id-expression. */
3164 = cp_parser_id_expression (parser,
3165 /*template_keyword_p=*/false,
3166 /*check_dependency_p=*/true,
3168 /*declarator_p=*/false,
3169 /*optional_p=*/false);
3170 if (id_expression == error_mark_node)
3171 return error_mark_node;
3172 token = cp_lexer_peek_token (parser->lexer);
3173 done = (token->type != CPP_OPEN_SQUARE
3174 && token->type != CPP_OPEN_PAREN
3175 && token->type != CPP_DOT
3176 && token->type != CPP_DEREF
3177 && token->type != CPP_PLUS_PLUS
3178 && token->type != CPP_MINUS_MINUS);
3179 /* If we have a template-id, then no further lookup is
3180 required. If the template-id was for a template-class, we
3181 will sometimes have a TYPE_DECL at this point. */
3182 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
3183 || TREE_CODE (id_expression) == TYPE_DECL)
3184 decl = id_expression;
3185 /* Look up the name. */
3188 tree ambiguous_decls;
3190 decl = cp_parser_lookup_name (parser, id_expression,
3193 /*is_namespace=*/false,
3194 /*check_dependency=*/true,
3196 /* If the lookup was ambiguous, an error will already have
3198 if (ambiguous_decls)
3199 return error_mark_node;
3201 /* In Objective-C++, an instance variable (ivar) may be preferred
3202 to whatever cp_parser_lookup_name() found. */
3203 decl = objc_lookup_ivar (decl, id_expression);
3205 /* If name lookup gives us a SCOPE_REF, then the
3206 qualifying scope was dependent. */
3207 if (TREE_CODE (decl) == SCOPE_REF)
3209 /* Check to see if DECL is a local variable in a context
3210 where that is forbidden. */
3211 if (parser->local_variables_forbidden_p
3212 && local_variable_p (decl))
3214 /* It might be that we only found DECL because we are
3215 trying to be generous with pre-ISO scoping rules.
3216 For example, consider:
3220 for (int i = 0; i < 10; ++i) {}
3221 extern void f(int j = i);
3224 Here, name look up will originally find the out
3225 of scope `i'. We need to issue a warning message,
3226 but then use the global `i'. */
3227 decl = check_for_out_of_scope_variable (decl);
3228 if (local_variable_p (decl))
3230 error ("local variable %qD may not appear in this context",
3232 return error_mark_node;
3237 decl = (finish_id_expression
3238 (id_expression, decl, parser->scope,
3240 parser->integral_constant_expression_p,
3241 parser->allow_non_integral_constant_expression_p,
3242 &parser->non_integral_constant_expression_p,
3243 template_p, done, address_p,
3247 cp_parser_error (parser, error_msg);
3251 /* Anything else is an error. */
3253 /* ...unless we have an Objective-C++ message or string literal, that is. */
3254 if (c_dialect_objc ()
3255 && (token->type == CPP_OPEN_SQUARE || token->type == CPP_OBJC_STRING))
3256 return cp_parser_objc_expression (parser);
3258 cp_parser_error (parser, "expected primary-expression");
3259 return error_mark_node;
3263 /* Parse an id-expression.
3270 :: [opt] nested-name-specifier template [opt] unqualified-id
3272 :: operator-function-id
3275 Return a representation of the unqualified portion of the
3276 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3277 a `::' or nested-name-specifier.
3279 Often, if the id-expression was a qualified-id, the caller will
3280 want to make a SCOPE_REF to represent the qualified-id. This
3281 function does not do this in order to avoid wastefully creating
3282 SCOPE_REFs when they are not required.
3284 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3287 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3288 uninstantiated templates.
3290 If *TEMPLATE_P is non-NULL, it is set to true iff the
3291 `template' keyword is used to explicitly indicate that the entity
3292 named is a template.
3294 If DECLARATOR_P is true, the id-expression is appearing as part of
3295 a declarator, rather than as part of an expression. */
3298 cp_parser_id_expression (cp_parser *parser,
3299 bool template_keyword_p,
3300 bool check_dependency_p,
3305 bool global_scope_p;
3306 bool nested_name_specifier_p;
3308 /* Assume the `template' keyword was not used. */
3310 *template_p = template_keyword_p;
3312 /* Look for the optional `::' operator. */
3314 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3316 /* Look for the optional nested-name-specifier. */
3317 nested_name_specifier_p
3318 = (cp_parser_nested_name_specifier_opt (parser,
3319 /*typename_keyword_p=*/false,
3324 /* If there is a nested-name-specifier, then we are looking at
3325 the first qualified-id production. */
3326 if (nested_name_specifier_p)
3329 tree saved_object_scope;
3330 tree saved_qualifying_scope;
3331 tree unqualified_id;
3334 /* See if the next token is the `template' keyword. */
3336 template_p = &is_template;
3337 *template_p = cp_parser_optional_template_keyword (parser);
3338 /* Name lookup we do during the processing of the
3339 unqualified-id might obliterate SCOPE. */
3340 saved_scope = parser->scope;
3341 saved_object_scope = parser->object_scope;
3342 saved_qualifying_scope = parser->qualifying_scope;
3343 /* Process the final unqualified-id. */
3344 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3347 /*optional_p=*/false);
3348 /* Restore the SAVED_SCOPE for our caller. */
3349 parser->scope = saved_scope;
3350 parser->object_scope = saved_object_scope;
3351 parser->qualifying_scope = saved_qualifying_scope;
3353 return unqualified_id;
3355 /* Otherwise, if we are in global scope, then we are looking at one
3356 of the other qualified-id productions. */
3357 else if (global_scope_p)
3362 /* Peek at the next token. */
3363 token = cp_lexer_peek_token (parser->lexer);
3365 /* If it's an identifier, and the next token is not a "<", then
3366 we can avoid the template-id case. This is an optimization
3367 for this common case. */
3368 if (token->type == CPP_NAME
3369 && !cp_parser_nth_token_starts_template_argument_list_p
3371 return cp_parser_identifier (parser);
3373 cp_parser_parse_tentatively (parser);
3374 /* Try a template-id. */
3375 id = cp_parser_template_id (parser,
3376 /*template_keyword_p=*/false,
3377 /*check_dependency_p=*/true,
3379 /* If that worked, we're done. */
3380 if (cp_parser_parse_definitely (parser))
3383 /* Peek at the next token. (Changes in the token buffer may
3384 have invalidated the pointer obtained above.) */
3385 token = cp_lexer_peek_token (parser->lexer);
3387 switch (token->type)
3390 return cp_parser_identifier (parser);
3393 if (token->keyword == RID_OPERATOR)
3394 return cp_parser_operator_function_id (parser);
3398 cp_parser_error (parser, "expected id-expression");
3399 return error_mark_node;
3403 return cp_parser_unqualified_id (parser, template_keyword_p,
3404 /*check_dependency_p=*/true,
3409 /* Parse an unqualified-id.
3413 operator-function-id
3414 conversion-function-id
3418 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3419 keyword, in a construct like `A::template ...'.
3421 Returns a representation of unqualified-id. For the `identifier'
3422 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3423 production a BIT_NOT_EXPR is returned; the operand of the
3424 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3425 other productions, see the documentation accompanying the
3426 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3427 names are looked up in uninstantiated templates. If DECLARATOR_P
3428 is true, the unqualified-id is appearing as part of a declarator,
3429 rather than as part of an expression. */
3432 cp_parser_unqualified_id (cp_parser* parser,
3433 bool template_keyword_p,
3434 bool check_dependency_p,
3440 /* Peek at the next token. */
3441 token = cp_lexer_peek_token (parser->lexer);
3443 switch (token->type)
3449 /* We don't know yet whether or not this will be a
3451 cp_parser_parse_tentatively (parser);
3452 /* Try a template-id. */
3453 id = cp_parser_template_id (parser, template_keyword_p,
3456 /* If it worked, we're done. */
3457 if (cp_parser_parse_definitely (parser))
3459 /* Otherwise, it's an ordinary identifier. */
3460 return cp_parser_identifier (parser);
3463 case CPP_TEMPLATE_ID:
3464 return cp_parser_template_id (parser, template_keyword_p,
3471 tree qualifying_scope;
3476 /* Consume the `~' token. */
3477 cp_lexer_consume_token (parser->lexer);
3478 /* Parse the class-name. The standard, as written, seems to
3481 template <typename T> struct S { ~S (); };
3482 template <typename T> S<T>::~S() {}
3484 is invalid, since `~' must be followed by a class-name, but
3485 `S<T>' is dependent, and so not known to be a class.
3486 That's not right; we need to look in uninstantiated
3487 templates. A further complication arises from:
3489 template <typename T> void f(T t) {
3493 Here, it is not possible to look up `T' in the scope of `T'
3494 itself. We must look in both the current scope, and the
3495 scope of the containing complete expression.
3497 Yet another issue is:
3506 The standard does not seem to say that the `S' in `~S'
3507 should refer to the type `S' and not the data member
3510 /* DR 244 says that we look up the name after the "~" in the
3511 same scope as we looked up the qualifying name. That idea
3512 isn't fully worked out; it's more complicated than that. */
3513 scope = parser->scope;
3514 object_scope = parser->object_scope;
3515 qualifying_scope = parser->qualifying_scope;
3517 /* Check for invalid scopes. */
3518 if (scope == error_mark_node)
3520 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
3521 cp_lexer_consume_token (parser->lexer);
3522 return error_mark_node;
3524 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
3526 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
3527 error ("scope %qT before %<~%> is not a class-name", scope);
3528 cp_parser_simulate_error (parser);
3529 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
3530 cp_lexer_consume_token (parser->lexer);
3531 return error_mark_node;
3533 gcc_assert (!scope || TYPE_P (scope));
3535 /* If the name is of the form "X::~X" it's OK. */
3536 token = cp_lexer_peek_token (parser->lexer);
3538 && token->type == CPP_NAME
3539 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3541 && constructor_name_p (token->u.value, scope))
3543 cp_lexer_consume_token (parser->lexer);
3544 return build_nt (BIT_NOT_EXPR, scope);
3547 /* If there was an explicit qualification (S::~T), first look
3548 in the scope given by the qualification (i.e., S). */
3550 type_decl = NULL_TREE;
3553 cp_parser_parse_tentatively (parser);
3554 type_decl = cp_parser_class_name (parser,
3555 /*typename_keyword_p=*/false,
3556 /*template_keyword_p=*/false,
3558 /*check_dependency=*/false,
3559 /*class_head_p=*/false,
3561 if (cp_parser_parse_definitely (parser))
3564 /* In "N::S::~S", look in "N" as well. */
3565 if (!done && scope && qualifying_scope)
3567 cp_parser_parse_tentatively (parser);
3568 parser->scope = qualifying_scope;
3569 parser->object_scope = NULL_TREE;
3570 parser->qualifying_scope = NULL_TREE;
3572 = cp_parser_class_name (parser,
3573 /*typename_keyword_p=*/false,
3574 /*template_keyword_p=*/false,
3576 /*check_dependency=*/false,
3577 /*class_head_p=*/false,
3579 if (cp_parser_parse_definitely (parser))
3582 /* In "p->S::~T", look in the scope given by "*p" as well. */
3583 else if (!done && object_scope)
3585 cp_parser_parse_tentatively (parser);
3586 parser->scope = object_scope;
3587 parser->object_scope = NULL_TREE;
3588 parser->qualifying_scope = NULL_TREE;
3590 = cp_parser_class_name (parser,
3591 /*typename_keyword_p=*/false,
3592 /*template_keyword_p=*/false,
3594 /*check_dependency=*/false,
3595 /*class_head_p=*/false,
3597 if (cp_parser_parse_definitely (parser))
3600 /* Look in the surrounding context. */
3603 parser->scope = NULL_TREE;
3604 parser->object_scope = NULL_TREE;
3605 parser->qualifying_scope = NULL_TREE;
3607 = cp_parser_class_name (parser,
3608 /*typename_keyword_p=*/false,
3609 /*template_keyword_p=*/false,
3611 /*check_dependency=*/false,
3612 /*class_head_p=*/false,
3615 /* If an error occurred, assume that the name of the
3616 destructor is the same as the name of the qualifying
3617 class. That allows us to keep parsing after running
3618 into ill-formed destructor names. */
3619 if (type_decl == error_mark_node && scope)
3620 return build_nt (BIT_NOT_EXPR, scope);
3621 else if (type_decl == error_mark_node)
3622 return error_mark_node;
3624 /* Check that destructor name and scope match. */
3625 if (declarator_p && scope && !check_dtor_name (scope, type_decl))
3627 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
3628 error ("declaration of %<~%T%> as member of %qT",
3630 cp_parser_simulate_error (parser);
3631 return error_mark_node;
3636 A typedef-name that names a class shall not be used as the
3637 identifier in the declarator for a destructor declaration. */
3639 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3640 && !DECL_SELF_REFERENCE_P (type_decl)
3641 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
3642 error ("typedef-name %qD used as destructor declarator",
3645 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3649 if (token->keyword == RID_OPERATOR)
3653 /* This could be a template-id, so we try that first. */
3654 cp_parser_parse_tentatively (parser);
3655 /* Try a template-id. */
3656 id = cp_parser_template_id (parser, template_keyword_p,
3657 /*check_dependency_p=*/true,
3659 /* If that worked, we're done. */
3660 if (cp_parser_parse_definitely (parser))
3662 /* We still don't know whether we're looking at an
3663 operator-function-id or a conversion-function-id. */
3664 cp_parser_parse_tentatively (parser);
3665 /* Try an operator-function-id. */
3666 id = cp_parser_operator_function_id (parser);
3667 /* If that didn't work, try a conversion-function-id. */
3668 if (!cp_parser_parse_definitely (parser))
3669 id = cp_parser_conversion_function_id (parser);
3678 cp_parser_error (parser, "expected unqualified-id");
3679 return error_mark_node;
3683 /* Parse an (optional) nested-name-specifier.
3685 nested-name-specifier:
3686 class-or-namespace-name :: nested-name-specifier [opt]
3687 class-or-namespace-name :: template nested-name-specifier [opt]
3689 PARSER->SCOPE should be set appropriately before this function is
3690 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3691 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3694 Sets PARSER->SCOPE to the class (TYPE) or namespace
3695 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3696 it unchanged if there is no nested-name-specifier. Returns the new
3697 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3699 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3700 part of a declaration and/or decl-specifier. */
3703 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3704 bool typename_keyword_p,
3705 bool check_dependency_p,
3707 bool is_declaration)
3709 bool success = false;
3710 cp_token_position start = 0;
3713 /* Remember where the nested-name-specifier starts. */
3714 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3716 start = cp_lexer_token_position (parser->lexer, false);
3717 push_deferring_access_checks (dk_deferred);
3724 tree saved_qualifying_scope;
3725 bool template_keyword_p;
3727 /* Spot cases that cannot be the beginning of a
3728 nested-name-specifier. */
3729 token = cp_lexer_peek_token (parser->lexer);
3731 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3732 the already parsed nested-name-specifier. */
3733 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3735 /* Grab the nested-name-specifier and continue the loop. */
3736 cp_parser_pre_parsed_nested_name_specifier (parser);
3737 /* If we originally encountered this nested-name-specifier
3738 with IS_DECLARATION set to false, we will not have
3739 resolved TYPENAME_TYPEs, so we must do so here. */
3741 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3743 new_scope = resolve_typename_type (parser->scope,
3744 /*only_current_p=*/false);
3745 if (new_scope != error_mark_node)
3746 parser->scope = new_scope;
3752 /* Spot cases that cannot be the beginning of a
3753 nested-name-specifier. On the second and subsequent times
3754 through the loop, we look for the `template' keyword. */
3755 if (success && token->keyword == RID_TEMPLATE)
3757 /* A template-id can start a nested-name-specifier. */
3758 else if (token->type == CPP_TEMPLATE_ID)
3762 /* If the next token is not an identifier, then it is
3763 definitely not a class-or-namespace-name. */
3764 if (token->type != CPP_NAME)
3766 /* If the following token is neither a `<' (to begin a
3767 template-id), nor a `::', then we are not looking at a
3768 nested-name-specifier. */
3769 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3770 if (token->type != CPP_SCOPE
3771 && !cp_parser_nth_token_starts_template_argument_list_p
3776 /* The nested-name-specifier is optional, so we parse
3778 cp_parser_parse_tentatively (parser);
3780 /* Look for the optional `template' keyword, if this isn't the
3781 first time through the loop. */
3783 template_keyword_p = cp_parser_optional_template_keyword (parser);
3785 template_keyword_p = false;
3787 /* Save the old scope since the name lookup we are about to do
3788 might destroy it. */
3789 old_scope = parser->scope;
3790 saved_qualifying_scope = parser->qualifying_scope;
3791 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
3792 look up names in "X<T>::I" in order to determine that "Y" is
3793 a template. So, if we have a typename at this point, we make
3794 an effort to look through it. */
3796 && !typename_keyword_p
3798 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3799 parser->scope = resolve_typename_type (parser->scope,
3800 /*only_current_p=*/false);
3801 /* Parse the qualifying entity. */
3803 = cp_parser_class_or_namespace_name (parser,
3809 /* Look for the `::' token. */
3810 cp_parser_require (parser, CPP_SCOPE, "`::'");
3812 /* If we found what we wanted, we keep going; otherwise, we're
3814 if (!cp_parser_parse_definitely (parser))
3816 bool error_p = false;
3818 /* Restore the OLD_SCOPE since it was valid before the
3819 failed attempt at finding the last
3820 class-or-namespace-name. */
3821 parser->scope = old_scope;
3822 parser->qualifying_scope = saved_qualifying_scope;
3823 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3825 /* If the next token is an identifier, and the one after
3826 that is a `::', then any valid interpretation would have
3827 found a class-or-namespace-name. */
3828 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3829 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3831 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3834 token = cp_lexer_consume_token (parser->lexer);
3837 if (!token->ambiguous_p)
3840 tree ambiguous_decls;
3842 decl = cp_parser_lookup_name (parser, token->u.value,
3844 /*is_template=*/false,
3845 /*is_namespace=*/false,
3846 /*check_dependency=*/true,
3848 if (TREE_CODE (decl) == TEMPLATE_DECL)
3849 error ("%qD used without template parameters", decl);
3850 else if (ambiguous_decls)
3852 error ("reference to %qD is ambiguous",
3854 print_candidates (ambiguous_decls);
3855 decl = error_mark_node;
3858 cp_parser_name_lookup_error
3859 (parser, token->u.value, decl,
3860 "is not a class or namespace");
3862 parser->scope = error_mark_node;
3864 /* Treat this as a successful nested-name-specifier
3869 If the name found is not a class-name (clause
3870 _class_) or namespace-name (_namespace.def_), the
3871 program is ill-formed. */
3874 cp_lexer_consume_token (parser->lexer);
3878 /* We've found one valid nested-name-specifier. */
3880 /* Name lookup always gives us a DECL. */
3881 if (TREE_CODE (new_scope) == TYPE_DECL)
3882 new_scope = TREE_TYPE (new_scope);
3883 /* Uses of "template" must be followed by actual templates. */
3884 if (template_keyword_p
3885 && !(CLASS_TYPE_P (new_scope)
3886 && ((CLASSTYPE_USE_TEMPLATE (new_scope)
3887 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope)))
3888 || CLASSTYPE_IS_TEMPLATE (new_scope)))
3889 && !(TREE_CODE (new_scope) == TYPENAME_TYPE
3890 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope))
3891 == TEMPLATE_ID_EXPR)))
3892 pedwarn (TYPE_P (new_scope)
3893 ? "%qT is not a template"
3894 : "%qD is not a template",
3896 /* If it is a class scope, try to complete it; we are about to
3897 be looking up names inside the class. */
3898 if (TYPE_P (new_scope)
3899 /* Since checking types for dependency can be expensive,
3900 avoid doing it if the type is already complete. */
3901 && !COMPLETE_TYPE_P (new_scope)
3902 /* Do not try to complete dependent types. */
3903 && !dependent_type_p (new_scope))
3904 new_scope = complete_type (new_scope);
3905 /* Make sure we look in the right scope the next time through
3907 parser->scope = new_scope;
3910 /* If parsing tentatively, replace the sequence of tokens that makes
3911 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3912 token. That way, should we re-parse the token stream, we will
3913 not have to repeat the effort required to do the parse, nor will
3914 we issue duplicate error messages. */
3915 if (success && start)
3919 token = cp_lexer_token_at (parser->lexer, start);
3920 /* Reset the contents of the START token. */
3921 token->type = CPP_NESTED_NAME_SPECIFIER;
3922 /* Retrieve any deferred checks. Do not pop this access checks yet
3923 so the memory will not be reclaimed during token replacing below. */
3924 token->u.tree_check_value = GGC_CNEW (struct tree_check);
3925 token->u.tree_check_value->value = parser->scope;
3926 token->u.tree_check_value->checks = get_deferred_access_checks ();
3927 token->u.tree_check_value->qualifying_scope =
3928 parser->qualifying_scope;
3929 token->keyword = RID_MAX;
3931 /* Purge all subsequent tokens. */
3932 cp_lexer_purge_tokens_after (parser->lexer, start);
3936 pop_to_parent_deferring_access_checks ();
3938 return success ? parser->scope : NULL_TREE;
3941 /* Parse a nested-name-specifier. See
3942 cp_parser_nested_name_specifier_opt for details. This function
3943 behaves identically, except that it will an issue an error if no
3944 nested-name-specifier is present. */
3947 cp_parser_nested_name_specifier (cp_parser *parser,
3948 bool typename_keyword_p,
3949 bool check_dependency_p,
3951 bool is_declaration)
3955 /* Look for the nested-name-specifier. */
3956 scope = cp_parser_nested_name_specifier_opt (parser,
3961 /* If it was not present, issue an error message. */
3964 cp_parser_error (parser, "expected nested-name-specifier");
3965 parser->scope = NULL_TREE;
3971 /* Parse a class-or-namespace-name.
3973 class-or-namespace-name:
3977 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3978 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3979 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3980 TYPE_P is TRUE iff the next name should be taken as a class-name,
3981 even the same name is declared to be another entity in the same
3984 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3985 specified by the class-or-namespace-name. If neither is found the
3986 ERROR_MARK_NODE is returned. */
3989 cp_parser_class_or_namespace_name (cp_parser *parser,
3990 bool typename_keyword_p,
3991 bool template_keyword_p,
3992 bool check_dependency_p,
3994 bool is_declaration)
3997 tree saved_qualifying_scope;
3998 tree saved_object_scope;
4002 /* Before we try to parse the class-name, we must save away the
4003 current PARSER->SCOPE since cp_parser_class_name will destroy
4005 saved_scope = parser->scope;
4006 saved_qualifying_scope = parser->qualifying_scope;
4007 saved_object_scope = parser->object_scope;
4008 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
4009 there is no need to look for a namespace-name. */
4010 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
4012 cp_parser_parse_tentatively (parser);
4013 scope = cp_parser_class_name (parser,
4016 type_p ? class_type : none_type,
4018 /*class_head_p=*/false,
4020 /* If that didn't work, try for a namespace-name. */
4021 if (!only_class_p && !cp_parser_parse_definitely (parser))
4023 /* Restore the saved scope. */
4024 parser->scope = saved_scope;
4025 parser->qualifying_scope = saved_qualifying_scope;
4026 parser->object_scope = saved_object_scope;
4027 /* If we are not looking at an identifier followed by the scope
4028 resolution operator, then this is not part of a
4029 nested-name-specifier. (Note that this function is only used
4030 to parse the components of a nested-name-specifier.) */
4031 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
4032 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
4033 return error_mark_node;
4034 scope = cp_parser_namespace_name (parser);
4040 /* Parse a postfix-expression.
4044 postfix-expression [ expression ]
4045 postfix-expression ( expression-list [opt] )
4046 simple-type-specifier ( expression-list [opt] )
4047 typename :: [opt] nested-name-specifier identifier
4048 ( expression-list [opt] )
4049 typename :: [opt] nested-name-specifier template [opt] template-id
4050 ( expression-list [opt] )
4051 postfix-expression . template [opt] id-expression
4052 postfix-expression -> template [opt] id-expression
4053 postfix-expression . pseudo-destructor-name
4054 postfix-expression -> pseudo-destructor-name
4055 postfix-expression ++
4056 postfix-expression --
4057 dynamic_cast < type-id > ( expression )
4058 static_cast < type-id > ( expression )
4059 reinterpret_cast < type-id > ( expression )
4060 const_cast < type-id > ( expression )
4061 typeid ( expression )
4067 ( type-id ) { initializer-list , [opt] }
4069 This extension is a GNU version of the C99 compound-literal
4070 construct. (The C99 grammar uses `type-name' instead of `type-id',
4071 but they are essentially the same concept.)
4073 If ADDRESS_P is true, the postfix expression is the operand of the
4074 `&' operator. CAST_P is true if this expression is the target of a
4077 Returns a representation of the expression. */
4080 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p)
4084 cp_id_kind idk = CP_ID_KIND_NONE;
4085 tree postfix_expression = NULL_TREE;
4087 /* Peek at the next token. */
4088 token = cp_lexer_peek_token (parser->lexer);
4089 /* Some of the productions are determined by keywords. */
4090 keyword = token->keyword;
4100 const char *saved_message;
4102 /* All of these can be handled in the same way from the point
4103 of view of parsing. Begin by consuming the token
4104 identifying the cast. */
4105 cp_lexer_consume_token (parser->lexer);
4107 /* New types cannot be defined in the cast. */
4108 saved_message = parser->type_definition_forbidden_message;
4109 parser->type_definition_forbidden_message
4110 = "types may not be defined in casts";
4112 /* Look for the opening `<'. */
4113 cp_parser_require (parser, CPP_LESS, "`<'");
4114 /* Parse the type to which we are casting. */
4115 type = cp_parser_type_id (parser);
4116 /* Look for the closing `>'. */
4117 cp_parser_require (parser, CPP_GREATER, "`>'");
4118 /* Restore the old message. */
4119 parser->type_definition_forbidden_message = saved_message;
4121 /* And the expression which is being cast. */
4122 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
4123 expression = cp_parser_expression (parser, /*cast_p=*/true);
4124 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4126 /* Only type conversions to integral or enumeration types
4127 can be used in constant-expressions. */
4128 if (!cast_valid_in_integral_constant_expression_p (type)
4129 && (cp_parser_non_integral_constant_expression
4131 "a cast to a type other than an integral or "
4132 "enumeration type")))
4133 return error_mark_node;
4139 = build_dynamic_cast (type, expression);
4143 = build_static_cast (type, expression);
4147 = build_reinterpret_cast (type, expression);
4151 = build_const_cast (type, expression);
4162 const char *saved_message;
4163 bool saved_in_type_id_in_expr_p;
4165 /* Consume the `typeid' token. */
4166 cp_lexer_consume_token (parser->lexer);
4167 /* Look for the `(' token. */
4168 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
4169 /* Types cannot be defined in a `typeid' expression. */
4170 saved_message = parser->type_definition_forbidden_message;
4171 parser->type_definition_forbidden_message
4172 = "types may not be defined in a `typeid\' expression";
4173 /* We can't be sure yet whether we're looking at a type-id or an
4175 cp_parser_parse_tentatively (parser);
4176 /* Try a type-id first. */
4177 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4178 parser->in_type_id_in_expr_p = true;
4179 type = cp_parser_type_id (parser);
4180 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4181 /* Look for the `)' token. Otherwise, we can't be sure that
4182 we're not looking at an expression: consider `typeid (int
4183 (3))', for example. */
4184 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4185 /* If all went well, simply lookup the type-id. */
4186 if (cp_parser_parse_definitely (parser))
4187 postfix_expression = get_typeid (type);
4188 /* Otherwise, fall back to the expression variant. */
4193 /* Look for an expression. */
4194 expression = cp_parser_expression (parser, /*cast_p=*/false);
4195 /* Compute its typeid. */
4196 postfix_expression = build_typeid (expression);
4197 /* Look for the `)' token. */
4198 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4200 /* Restore the saved message. */
4201 parser->type_definition_forbidden_message = saved_message;
4202 /* `typeid' may not appear in an integral constant expression. */
4203 if (cp_parser_non_integral_constant_expression(parser,
4204 "`typeid' operator"))
4205 return error_mark_node;
4212 /* The syntax permitted here is the same permitted for an
4213 elaborated-type-specifier. */
4214 type = cp_parser_elaborated_type_specifier (parser,
4215 /*is_friend=*/false,
4216 /*is_declaration=*/false);
4217 postfix_expression = cp_parser_functional_cast (parser, type);
4225 /* If the next thing is a simple-type-specifier, we may be
4226 looking at a functional cast. We could also be looking at
4227 an id-expression. So, we try the functional cast, and if
4228 that doesn't work we fall back to the primary-expression. */
4229 cp_parser_parse_tentatively (parser);
4230 /* Look for the simple-type-specifier. */
4231 type = cp_parser_simple_type_specifier (parser,
4232 /*decl_specs=*/NULL,
4233 CP_PARSER_FLAGS_NONE);
4234 /* Parse the cast itself. */
4235 if (!cp_parser_error_occurred (parser))
4237 = cp_parser_functional_cast (parser, type);
4238 /* If that worked, we're done. */
4239 if (cp_parser_parse_definitely (parser))
4242 /* If the functional-cast didn't work out, try a
4243 compound-literal. */
4244 if (cp_parser_allow_gnu_extensions_p (parser)
4245 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4247 VEC(constructor_elt,gc) *initializer_list = NULL;
4248 bool saved_in_type_id_in_expr_p;
4250 cp_parser_parse_tentatively (parser);
4251 /* Consume the `('. */
4252 cp_lexer_consume_token (parser->lexer);
4253 /* Parse the type. */
4254 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4255 parser->in_type_id_in_expr_p = true;
4256 type = cp_parser_type_id (parser);
4257 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4258 /* Look for the `)'. */
4259 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4260 /* Look for the `{'. */
4261 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
4262 /* If things aren't going well, there's no need to
4264 if (!cp_parser_error_occurred (parser))
4266 bool non_constant_p;
4267 /* Parse the initializer-list. */
4269 = cp_parser_initializer_list (parser, &non_constant_p);
4270 /* Allow a trailing `,'. */
4271 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
4272 cp_lexer_consume_token (parser->lexer);
4273 /* Look for the final `}'. */
4274 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
4276 /* If that worked, we're definitely looking at a
4277 compound-literal expression. */
4278 if (cp_parser_parse_definitely (parser))
4280 /* Warn the user that a compound literal is not
4281 allowed in standard C++. */
4283 pedwarn ("ISO C++ forbids compound-literals");
4284 /* Form the representation of the compound-literal. */
4286 = finish_compound_literal (type, initializer_list);
4291 /* It must be a primary-expression. */
4293 = cp_parser_primary_expression (parser, address_p, cast_p,
4294 /*template_arg_p=*/false,
4300 /* Keep looping until the postfix-expression is complete. */
4303 if (idk == CP_ID_KIND_UNQUALIFIED
4304 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
4305 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
4306 /* It is not a Koenig lookup function call. */
4308 = unqualified_name_lookup_error (postfix_expression);
4310 /* Peek at the next token. */
4311 token = cp_lexer_peek_token (parser->lexer);
4313 switch (token->type)
4315 case CPP_OPEN_SQUARE:
4317 = cp_parser_postfix_open_square_expression (parser,
4320 idk = CP_ID_KIND_NONE;
4323 case CPP_OPEN_PAREN:
4324 /* postfix-expression ( expression-list [opt] ) */
4327 bool is_builtin_constant_p;
4328 bool saved_integral_constant_expression_p = false;
4329 bool saved_non_integral_constant_expression_p = false;
4332 is_builtin_constant_p
4333 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
4334 if (is_builtin_constant_p)
4336 /* The whole point of __builtin_constant_p is to allow
4337 non-constant expressions to appear as arguments. */
4338 saved_integral_constant_expression_p
4339 = parser->integral_constant_expression_p;
4340 saved_non_integral_constant_expression_p
4341 = parser->non_integral_constant_expression_p;
4342 parser->integral_constant_expression_p = false;
4344 args = (cp_parser_parenthesized_expression_list
4345 (parser, /*is_attribute_list=*/false,
4347 /*non_constant_p=*/NULL));
4348 if (is_builtin_constant_p)
4350 parser->integral_constant_expression_p
4351 = saved_integral_constant_expression_p;
4352 parser->non_integral_constant_expression_p
4353 = saved_non_integral_constant_expression_p;
4356 if (args == error_mark_node)
4358 postfix_expression = error_mark_node;
4362 /* Function calls are not permitted in
4363 constant-expressions. */
4364 if (! builtin_valid_in_constant_expr_p (postfix_expression)
4365 && cp_parser_non_integral_constant_expression (parser,
4368 postfix_expression = error_mark_node;
4373 if (idk == CP_ID_KIND_UNQUALIFIED)
4375 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
4381 = perform_koenig_lookup (postfix_expression, args);
4385 = unqualified_fn_lookup_error (postfix_expression);
4387 /* We do not perform argument-dependent lookup if
4388 normal lookup finds a non-function, in accordance
4389 with the expected resolution of DR 218. */
4390 else if (args && is_overloaded_fn (postfix_expression))
4392 tree fn = get_first_fn (postfix_expression);
4394 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4395 fn = OVL_CURRENT (TREE_OPERAND (fn, 0));
4397 /* Only do argument dependent lookup if regular
4398 lookup does not find a set of member functions.
4399 [basic.lookup.koenig]/2a */
4400 if (!DECL_FUNCTION_MEMBER_P (fn))
4404 = perform_koenig_lookup (postfix_expression, args);
4409 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4411 tree instance = TREE_OPERAND (postfix_expression, 0);
4412 tree fn = TREE_OPERAND (postfix_expression, 1);
4414 if (processing_template_decl
4415 && (type_dependent_expression_p (instance)
4416 || (!BASELINK_P (fn)
4417 && TREE_CODE (fn) != FIELD_DECL)
4418 || type_dependent_expression_p (fn)
4419 || any_type_dependent_arguments_p (args)))
4422 = build_min_nt (CALL_EXPR, postfix_expression,
4427 if (BASELINK_P (fn))
4429 = (build_new_method_call
4430 (instance, fn, args, NULL_TREE,
4431 (idk == CP_ID_KIND_QUALIFIED
4432 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL),
4436 = finish_call_expr (postfix_expression, args,
4437 /*disallow_virtual=*/false,
4438 /*koenig_p=*/false);
4440 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4441 || TREE_CODE (postfix_expression) == MEMBER_REF
4442 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4443 postfix_expression = (build_offset_ref_call_from_tree
4444 (postfix_expression, args));
4445 else if (idk == CP_ID_KIND_QUALIFIED)
4446 /* A call to a static class member, or a namespace-scope
4449 = finish_call_expr (postfix_expression, args,
4450 /*disallow_virtual=*/true,
4453 /* All other function calls. */
4455 = finish_call_expr (postfix_expression, args,
4456 /*disallow_virtual=*/false,
4459 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4460 idk = CP_ID_KIND_NONE;
4466 /* postfix-expression . template [opt] id-expression
4467 postfix-expression . pseudo-destructor-name
4468 postfix-expression -> template [opt] id-expression
4469 postfix-expression -> pseudo-destructor-name */
4471 /* Consume the `.' or `->' operator. */
4472 cp_lexer_consume_token (parser->lexer);
4475 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4481 /* postfix-expression ++ */
4482 /* Consume the `++' token. */
4483 cp_lexer_consume_token (parser->lexer);
4484 /* Generate a representation for the complete expression. */
4486 = finish_increment_expr (postfix_expression,
4487 POSTINCREMENT_EXPR);
4488 /* Increments may not appear in constant-expressions. */
4489 if (cp_parser_non_integral_constant_expression (parser,
4491 postfix_expression = error_mark_node;
4492 idk = CP_ID_KIND_NONE;
4495 case CPP_MINUS_MINUS:
4496 /* postfix-expression -- */
4497 /* Consume the `--' token. */
4498 cp_lexer_consume_token (parser->lexer);
4499 /* Generate a representation for the complete expression. */
4501 = finish_increment_expr (postfix_expression,
4502 POSTDECREMENT_EXPR);
4503 /* Decrements may not appear in constant-expressions. */
4504 if (cp_parser_non_integral_constant_expression (parser,
4506 postfix_expression = error_mark_node;
4507 idk = CP_ID_KIND_NONE;
4511 return postfix_expression;
4515 /* We should never get here. */
4517 return error_mark_node;
4520 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4521 by cp_parser_builtin_offsetof. We're looking for
4523 postfix-expression [ expression ]
4525 FOR_OFFSETOF is set if we're being called in that context, which
4526 changes how we deal with integer constant expressions. */
4529 cp_parser_postfix_open_square_expression (cp_parser *parser,
4530 tree postfix_expression,
4535 /* Consume the `[' token. */
4536 cp_lexer_consume_token (parser->lexer);
4538 /* Parse the index expression. */
4539 /* ??? For offsetof, there is a question of what to allow here. If
4540 offsetof is not being used in an integral constant expression context,
4541 then we *could* get the right answer by computing the value at runtime.
4542 If we are in an integral constant expression context, then we might
4543 could accept any constant expression; hard to say without analysis.
4544 Rather than open the barn door too wide right away, allow only integer
4545 constant expressions here. */
4547 index = cp_parser_constant_expression (parser, false, NULL);
4549 index = cp_parser_expression (parser, /*cast_p=*/false);
4551 /* Look for the closing `]'. */
4552 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4554 /* Build the ARRAY_REF. */
4555 postfix_expression = grok_array_decl (postfix_expression, index);
4557 /* When not doing offsetof, array references are not permitted in
4558 constant-expressions. */
4560 && (cp_parser_non_integral_constant_expression
4561 (parser, "an array reference")))
4562 postfix_expression = error_mark_node;
4564 return postfix_expression;
4567 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4568 by cp_parser_builtin_offsetof. We're looking for
4570 postfix-expression . template [opt] id-expression
4571 postfix-expression . pseudo-destructor-name
4572 postfix-expression -> template [opt] id-expression
4573 postfix-expression -> pseudo-destructor-name
4575 FOR_OFFSETOF is set if we're being called in that context. That sorta
4576 limits what of the above we'll actually accept, but nevermind.
4577 TOKEN_TYPE is the "." or "->" token, which will already have been
4578 removed from the stream. */
4581 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4582 enum cpp_ttype token_type,
4583 tree postfix_expression,
4584 bool for_offsetof, cp_id_kind *idk)
4588 bool pseudo_destructor_p;
4589 tree scope = NULL_TREE;
4591 /* If this is a `->' operator, dereference the pointer. */
4592 if (token_type == CPP_DEREF)
4593 postfix_expression = build_x_arrow (postfix_expression);
4594 /* Check to see whether or not the expression is type-dependent. */
4595 dependent_p = type_dependent_expression_p (postfix_expression);
4596 /* The identifier following the `->' or `.' is not qualified. */
4597 parser->scope = NULL_TREE;
4598 parser->qualifying_scope = NULL_TREE;
4599 parser->object_scope = NULL_TREE;
4600 *idk = CP_ID_KIND_NONE;
4601 /* Enter the scope corresponding to the type of the object
4602 given by the POSTFIX_EXPRESSION. */
4603 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4605 scope = TREE_TYPE (postfix_expression);
4606 /* According to the standard, no expression should ever have
4607 reference type. Unfortunately, we do not currently match
4608 the standard in this respect in that our internal representation
4609 of an expression may have reference type even when the standard
4610 says it does not. Therefore, we have to manually obtain the
4611 underlying type here. */
4612 scope = non_reference (scope);
4613 /* The type of the POSTFIX_EXPRESSION must be complete. */
4614 if (scope == unknown_type_node)
4616 error ("%qE does not have class type", postfix_expression);
4620 scope = complete_type_or_else (scope, NULL_TREE);
4621 /* Let the name lookup machinery know that we are processing a
4622 class member access expression. */
4623 parser->context->object_type = scope;
4624 /* If something went wrong, we want to be able to discern that case,
4625 as opposed to the case where there was no SCOPE due to the type
4626 of expression being dependent. */
4628 scope = error_mark_node;
4629 /* If the SCOPE was erroneous, make the various semantic analysis
4630 functions exit quickly -- and without issuing additional error
4632 if (scope == error_mark_node)
4633 postfix_expression = error_mark_node;
4636 /* Assume this expression is not a pseudo-destructor access. */
4637 pseudo_destructor_p = false;
4639 /* If the SCOPE is a scalar type, then, if this is a valid program,
4640 we must be looking at a pseudo-destructor-name. */
4641 if (scope && SCALAR_TYPE_P (scope))
4646 cp_parser_parse_tentatively (parser);
4647 /* Parse the pseudo-destructor-name. */
4649 cp_parser_pseudo_destructor_name (parser, &s, &type);
4650 if (cp_parser_parse_definitely (parser))
4652 pseudo_destructor_p = true;
4654 = finish_pseudo_destructor_expr (postfix_expression,
4655 s, TREE_TYPE (type));
4659 if (!pseudo_destructor_p)
4661 /* If the SCOPE is not a scalar type, we are looking at an
4662 ordinary class member access expression, rather than a
4663 pseudo-destructor-name. */
4665 /* Parse the id-expression. */
4666 name = (cp_parser_id_expression
4668 cp_parser_optional_template_keyword (parser),
4669 /*check_dependency_p=*/true,
4671 /*declarator_p=*/false,
4672 /*optional_p=*/false));
4673 /* In general, build a SCOPE_REF if the member name is qualified.
4674 However, if the name was not dependent and has already been
4675 resolved; there is no need to build the SCOPE_REF. For example;
4677 struct X { void f(); };
4678 template <typename T> void f(T* t) { t->X::f(); }
4680 Even though "t" is dependent, "X::f" is not and has been resolved
4681 to a BASELINK; there is no need to include scope information. */
4683 /* But we do need to remember that there was an explicit scope for
4684 virtual function calls. */
4686 *idk = CP_ID_KIND_QUALIFIED;
4688 /* If the name is a template-id that names a type, we will get a
4689 TYPE_DECL here. That is invalid code. */
4690 if (TREE_CODE (name) == TYPE_DECL)
4692 error ("invalid use of %qD", name);
4693 postfix_expression = error_mark_node;
4697 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4699 name = build_qualified_name (/*type=*/NULL_TREE,
4703 parser->scope = NULL_TREE;
4704 parser->qualifying_scope = NULL_TREE;
4705 parser->object_scope = NULL_TREE;
4707 if (scope && name && BASELINK_P (name))
4708 adjust_result_of_qualified_name_lookup
4709 (name, BINFO_TYPE (BASELINK_ACCESS_BINFO (name)), scope);
4711 = finish_class_member_access_expr (postfix_expression, name,
4716 /* We no longer need to look up names in the scope of the object on
4717 the left-hand side of the `.' or `->' operator. */
4718 parser->context->object_type = NULL_TREE;
4720 /* Outside of offsetof, these operators may not appear in
4721 constant-expressions. */
4723 && (cp_parser_non_integral_constant_expression
4724 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4725 postfix_expression = error_mark_node;
4727 return postfix_expression;
4730 /* Parse a parenthesized expression-list.
4733 assignment-expression
4734 expression-list, assignment-expression
4739 identifier, expression-list
4741 CAST_P is true if this expression is the target of a cast.
4743 Returns a TREE_LIST. The TREE_VALUE of each node is a
4744 representation of an assignment-expression. Note that a TREE_LIST
4745 is returned even if there is only a single expression in the list.
4746 error_mark_node is returned if the ( and or ) are
4747 missing. NULL_TREE is returned on no expressions. The parentheses
4748 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4749 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4750 indicates whether or not all of the expressions in the list were
4754 cp_parser_parenthesized_expression_list (cp_parser* parser,
4755 bool is_attribute_list,
4757 bool *non_constant_p)
4759 tree expression_list = NULL_TREE;
4760 bool fold_expr_p = is_attribute_list;
4761 tree identifier = NULL_TREE;
4763 /* Assume all the expressions will be constant. */
4765 *non_constant_p = false;
4767 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4768 return error_mark_node;
4770 /* Consume expressions until there are no more. */
4771 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4776 /* At the beginning of attribute lists, check to see if the
4777 next token is an identifier. */
4778 if (is_attribute_list
4779 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4783 /* Consume the identifier. */
4784 token = cp_lexer_consume_token (parser->lexer);
4785 /* Save the identifier. */
4786 identifier = token->u.value;
4790 /* Parse the next assignment-expression. */
4793 bool expr_non_constant_p;
4794 expr = (cp_parser_constant_expression
4795 (parser, /*allow_non_constant_p=*/true,
4796 &expr_non_constant_p));
4797 if (expr_non_constant_p)
4798 *non_constant_p = true;
4801 expr = cp_parser_assignment_expression (parser, cast_p);
4804 expr = fold_non_dependent_expr (expr);
4806 /* Add it to the list. We add error_mark_node
4807 expressions to the list, so that we can still tell if
4808 the correct form for a parenthesized expression-list
4809 is found. That gives better errors. */
4810 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4812 if (expr == error_mark_node)
4816 /* After the first item, attribute lists look the same as
4817 expression lists. */
4818 is_attribute_list = false;
4821 /* If the next token isn't a `,', then we are done. */
4822 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4825 /* Otherwise, consume the `,' and keep going. */
4826 cp_lexer_consume_token (parser->lexer);
4829 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4834 /* We try and resync to an unnested comma, as that will give the
4835 user better diagnostics. */
4836 ending = cp_parser_skip_to_closing_parenthesis (parser,
4837 /*recovering=*/true,
4839 /*consume_paren=*/true);
4843 return error_mark_node;
4846 /* We built up the list in reverse order so we must reverse it now. */
4847 expression_list = nreverse (expression_list);
4849 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4851 return expression_list;
4854 /* Parse a pseudo-destructor-name.
4856 pseudo-destructor-name:
4857 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4858 :: [opt] nested-name-specifier template template-id :: ~ type-name
4859 :: [opt] nested-name-specifier [opt] ~ type-name
4861 If either of the first two productions is used, sets *SCOPE to the
4862 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4863 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4864 or ERROR_MARK_NODE if the parse fails. */
4867 cp_parser_pseudo_destructor_name (cp_parser* parser,
4871 bool nested_name_specifier_p;
4873 /* Assume that things will not work out. */
4874 *type = error_mark_node;
4876 /* Look for the optional `::' operator. */
4877 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4878 /* Look for the optional nested-name-specifier. */
4879 nested_name_specifier_p
4880 = (cp_parser_nested_name_specifier_opt (parser,
4881 /*typename_keyword_p=*/false,
4882 /*check_dependency_p=*/true,
4884 /*is_declaration=*/true)
4886 /* Now, if we saw a nested-name-specifier, we might be doing the
4887 second production. */
4888 if (nested_name_specifier_p
4889 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4891 /* Consume the `template' keyword. */
4892 cp_lexer_consume_token (parser->lexer);
4893 /* Parse the template-id. */
4894 cp_parser_template_id (parser,
4895 /*template_keyword_p=*/true,
4896 /*check_dependency_p=*/false,
4897 /*is_declaration=*/true);
4898 /* Look for the `::' token. */
4899 cp_parser_require (parser, CPP_SCOPE, "`::'");
4901 /* If the next token is not a `~', then there might be some
4902 additional qualification. */
4903 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4905 /* Look for the type-name. */
4906 *scope = TREE_TYPE (cp_parser_type_name (parser));
4908 if (*scope == error_mark_node)
4911 /* If we don't have ::~, then something has gone wrong. Since
4912 the only caller of this function is looking for something
4913 after `.' or `->' after a scalar type, most likely the
4914 program is trying to get a member of a non-aggregate
4916 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4917 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4919 cp_parser_error (parser, "request for member of non-aggregate type");
4923 /* Look for the `::' token. */
4924 cp_parser_require (parser, CPP_SCOPE, "`::'");
4929 /* Look for the `~'. */
4930 cp_parser_require (parser, CPP_COMPL, "`~'");
4931 /* Look for the type-name again. We are not responsible for
4932 checking that it matches the first type-name. */
4933 *type = cp_parser_type_name (parser);
4936 /* Parse a unary-expression.
4942 unary-operator cast-expression
4943 sizeof unary-expression
4951 __extension__ cast-expression
4952 __alignof__ unary-expression
4953 __alignof__ ( type-id )
4954 __real__ cast-expression
4955 __imag__ cast-expression
4958 ADDRESS_P is true iff the unary-expression is appearing as the
4959 operand of the `&' operator. CAST_P is true if this expression is
4960 the target of a cast.
4962 Returns a representation of the expression. */
4965 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p)
4968 enum tree_code unary_operator;
4970 /* Peek at the next token. */
4971 token = cp_lexer_peek_token (parser->lexer);
4972 /* Some keywords give away the kind of expression. */
4973 if (token->type == CPP_KEYWORD)
4975 enum rid keyword = token->keyword;
4985 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
4986 /* Consume the token. */
4987 cp_lexer_consume_token (parser->lexer);
4988 /* Parse the operand. */
4989 operand = cp_parser_sizeof_operand (parser, keyword);
4991 if (TYPE_P (operand))
4992 return cxx_sizeof_or_alignof_type (operand, op, true);
4994 return cxx_sizeof_or_alignof_expr (operand, op);
4998 return cp_parser_new_expression (parser);
5001 return cp_parser_delete_expression (parser);
5005 /* The saved value of the PEDANTIC flag. */
5009 /* Save away the PEDANTIC flag. */
5010 cp_parser_extension_opt (parser, &saved_pedantic);
5011 /* Parse the cast-expression. */
5012 expr = cp_parser_simple_cast_expression (parser);
5013 /* Restore the PEDANTIC flag. */
5014 pedantic = saved_pedantic;
5024 /* Consume the `__real__' or `__imag__' token. */
5025 cp_lexer_consume_token (parser->lexer);
5026 /* Parse the cast-expression. */
5027 expression = cp_parser_simple_cast_expression (parser);
5028 /* Create the complete representation. */
5029 return build_x_unary_op ((keyword == RID_REALPART
5030 ? REALPART_EXPR : IMAGPART_EXPR),
5040 /* Look for the `:: new' and `:: delete', which also signal the
5041 beginning of a new-expression, or delete-expression,
5042 respectively. If the next token is `::', then it might be one of
5044 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
5048 /* See if the token after the `::' is one of the keywords in
5049 which we're interested. */
5050 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
5051 /* If it's `new', we have a new-expression. */
5052 if (keyword == RID_NEW)
5053 return cp_parser_new_expression (parser);
5054 /* Similarly, for `delete'. */
5055 else if (keyword == RID_DELETE)
5056 return cp_parser_delete_expression (parser);
5059 /* Look for a unary operator. */
5060 unary_operator = cp_parser_unary_operator (token);
5061 /* The `++' and `--' operators can be handled similarly, even though
5062 they are not technically unary-operators in the grammar. */
5063 if (unary_operator == ERROR_MARK)
5065 if (token->type == CPP_PLUS_PLUS)
5066 unary_operator = PREINCREMENT_EXPR;
5067 else if (token->type == CPP_MINUS_MINUS)
5068 unary_operator = PREDECREMENT_EXPR;
5069 /* Handle the GNU address-of-label extension. */
5070 else if (cp_parser_allow_gnu_extensions_p (parser)
5071 && token->type == CPP_AND_AND)
5075 /* Consume the '&&' token. */
5076 cp_lexer_consume_token (parser->lexer);
5077 /* Look for the identifier. */
5078 identifier = cp_parser_identifier (parser);
5079 /* Create an expression representing the address. */
5080 return finish_label_address_expr (identifier);
5083 if (unary_operator != ERROR_MARK)
5085 tree cast_expression;
5086 tree expression = error_mark_node;
5087 const char *non_constant_p = NULL;
5089 /* Consume the operator token. */
5090 token = cp_lexer_consume_token (parser->lexer);
5091 /* Parse the cast-expression. */
5093 = cp_parser_cast_expression (parser,
5094 unary_operator == ADDR_EXPR,
5096 /* Now, build an appropriate representation. */
5097 switch (unary_operator)
5100 non_constant_p = "`*'";
5101 expression = build_x_indirect_ref (cast_expression, "unary *");
5105 non_constant_p = "`&'";
5108 expression = build_x_unary_op (unary_operator, cast_expression);
5111 case PREINCREMENT_EXPR:
5112 case PREDECREMENT_EXPR:
5113 non_constant_p = (unary_operator == PREINCREMENT_EXPR
5116 case UNARY_PLUS_EXPR:
5118 case TRUTH_NOT_EXPR:
5119 expression = finish_unary_op_expr (unary_operator, cast_expression);
5127 && cp_parser_non_integral_constant_expression (parser,
5129 expression = error_mark_node;
5134 return cp_parser_postfix_expression (parser, address_p, cast_p);
5137 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5138 unary-operator, the corresponding tree code is returned. */
5140 static enum tree_code
5141 cp_parser_unary_operator (cp_token* token)
5143 switch (token->type)
5146 return INDIRECT_REF;
5152 return UNARY_PLUS_EXPR;
5158 return TRUTH_NOT_EXPR;
5161 return BIT_NOT_EXPR;
5168 /* Parse a new-expression.
5171 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5172 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5174 Returns a representation of the expression. */
5177 cp_parser_new_expression (cp_parser* parser)
5179 bool global_scope_p;
5185 /* Look for the optional `::' operator. */
5187 = (cp_parser_global_scope_opt (parser,
5188 /*current_scope_valid_p=*/false)
5190 /* Look for the `new' operator. */
5191 cp_parser_require_keyword (parser, RID_NEW, "`new'");
5192 /* There's no easy way to tell a new-placement from the
5193 `( type-id )' construct. */
5194 cp_parser_parse_tentatively (parser);
5195 /* Look for a new-placement. */
5196 placement = cp_parser_new_placement (parser);
5197 /* If that didn't work out, there's no new-placement. */
5198 if (!cp_parser_parse_definitely (parser))
5199 placement = NULL_TREE;
5201 /* If the next token is a `(', then we have a parenthesized
5203 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5205 /* Consume the `('. */
5206 cp_lexer_consume_token (parser->lexer);
5207 /* Parse the type-id. */
5208 type = cp_parser_type_id (parser);
5209 /* Look for the closing `)'. */
5210 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5211 /* There should not be a direct-new-declarator in this production,
5212 but GCC used to allowed this, so we check and emit a sensible error
5213 message for this case. */
5214 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5216 error ("array bound forbidden after parenthesized type-id");
5217 inform ("try removing the parentheses around the type-id");
5218 cp_parser_direct_new_declarator (parser);
5222 /* Otherwise, there must be a new-type-id. */
5224 type = cp_parser_new_type_id (parser, &nelts);
5226 /* If the next token is a `(', then we have a new-initializer. */
5227 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5228 initializer = cp_parser_new_initializer (parser);
5230 initializer = NULL_TREE;
5232 /* A new-expression may not appear in an integral constant
5234 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
5235 return error_mark_node;
5237 /* Create a representation of the new-expression. */
5238 return build_new (placement, type, nelts, initializer, global_scope_p);
5241 /* Parse a new-placement.
5246 Returns the same representation as for an expression-list. */
5249 cp_parser_new_placement (cp_parser* parser)
5251 tree expression_list;
5253 /* Parse the expression-list. */
5254 expression_list = (cp_parser_parenthesized_expression_list
5255 (parser, false, /*cast_p=*/false,
5256 /*non_constant_p=*/NULL));
5258 return expression_list;
5261 /* Parse a new-type-id.
5264 type-specifier-seq new-declarator [opt]
5266 Returns the TYPE allocated. If the new-type-id indicates an array
5267 type, *NELTS is set to the number of elements in the last array
5268 bound; the TYPE will not include the last array bound. */
5271 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
5273 cp_decl_specifier_seq type_specifier_seq;
5274 cp_declarator *new_declarator;
5275 cp_declarator *declarator;
5276 cp_declarator *outer_declarator;
5277 const char *saved_message;
5280 /* The type-specifier sequence must not contain type definitions.
5281 (It cannot contain declarations of new types either, but if they
5282 are not definitions we will catch that because they are not
5284 saved_message = parser->type_definition_forbidden_message;
5285 parser->type_definition_forbidden_message
5286 = "types may not be defined in a new-type-id";
5287 /* Parse the type-specifier-seq. */
5288 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
5289 &type_specifier_seq);
5290 /* Restore the old message. */
5291 parser->type_definition_forbidden_message = saved_message;
5292 /* Parse the new-declarator. */
5293 new_declarator = cp_parser_new_declarator_opt (parser);
5295 /* Determine the number of elements in the last array dimension, if
5298 /* Skip down to the last array dimension. */
5299 declarator = new_declarator;
5300 outer_declarator = NULL;
5301 while (declarator && (declarator->kind == cdk_pointer
5302 || declarator->kind == cdk_ptrmem))
5304 outer_declarator = declarator;
5305 declarator = declarator->declarator;
5308 && declarator->kind == cdk_array
5309 && declarator->declarator
5310 && declarator->declarator->kind == cdk_array)
5312 outer_declarator = declarator;
5313 declarator = declarator->declarator;
5316 if (declarator && declarator->kind == cdk_array)
5318 *nelts = declarator->u.array.bounds;
5319 if (*nelts == error_mark_node)
5320 *nelts = integer_one_node;
5322 if (outer_declarator)
5323 outer_declarator->declarator = declarator->declarator;
5325 new_declarator = NULL;
5328 type = groktypename (&type_specifier_seq, new_declarator);
5329 if (TREE_CODE (type) == ARRAY_TYPE && *nelts == NULL_TREE)
5331 *nelts = array_type_nelts_top (type);
5332 type = TREE_TYPE (type);
5337 /* Parse an (optional) new-declarator.
5340 ptr-operator new-declarator [opt]
5341 direct-new-declarator
5343 Returns the declarator. */
5345 static cp_declarator *
5346 cp_parser_new_declarator_opt (cp_parser* parser)
5348 enum tree_code code;
5350 cp_cv_quals cv_quals;
5352 /* We don't know if there's a ptr-operator next, or not. */
5353 cp_parser_parse_tentatively (parser);
5354 /* Look for a ptr-operator. */
5355 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
5356 /* If that worked, look for more new-declarators. */
5357 if (cp_parser_parse_definitely (parser))
5359 cp_declarator *declarator;
5361 /* Parse another optional declarator. */
5362 declarator = cp_parser_new_declarator_opt (parser);
5364 /* Create the representation of the declarator. */
5366 declarator = make_ptrmem_declarator (cv_quals, type, declarator);
5367 else if (code == INDIRECT_REF)
5368 declarator = make_pointer_declarator (cv_quals, declarator);
5370 declarator = make_reference_declarator (cv_quals, declarator);
5375 /* If the next token is a `[', there is a direct-new-declarator. */
5376 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5377 return cp_parser_direct_new_declarator (parser);
5382 /* Parse a direct-new-declarator.
5384 direct-new-declarator:
5386 direct-new-declarator [constant-expression]
5390 static cp_declarator *
5391 cp_parser_direct_new_declarator (cp_parser* parser)
5393 cp_declarator *declarator = NULL;
5399 /* Look for the opening `['. */
5400 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
5401 /* The first expression is not required to be constant. */
5404 expression = cp_parser_expression (parser, /*cast_p=*/false);
5405 /* The standard requires that the expression have integral
5406 type. DR 74 adds enumeration types. We believe that the
5407 real intent is that these expressions be handled like the
5408 expression in a `switch' condition, which also allows
5409 classes with a single conversion to integral or
5410 enumeration type. */
5411 if (!processing_template_decl)
5414 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5419 error ("expression in new-declarator must have integral "
5420 "or enumeration type");
5421 expression = error_mark_node;
5425 /* But all the other expressions must be. */
5428 = cp_parser_constant_expression (parser,
5429 /*allow_non_constant=*/false,
5431 /* Look for the closing `]'. */
5432 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5434 /* Add this bound to the declarator. */
5435 declarator = make_array_declarator (declarator, expression);
5437 /* If the next token is not a `[', then there are no more
5439 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5446 /* Parse a new-initializer.
5449 ( expression-list [opt] )
5451 Returns a representation of the expression-list. If there is no
5452 expression-list, VOID_ZERO_NODE is returned. */
5455 cp_parser_new_initializer (cp_parser* parser)
5457 tree expression_list;
5459 expression_list = (cp_parser_parenthesized_expression_list
5460 (parser, false, /*cast_p=*/false,
5461 /*non_constant_p=*/NULL));
5462 if (!expression_list)
5463 expression_list = void_zero_node;
5465 return expression_list;
5468 /* Parse a delete-expression.
5471 :: [opt] delete cast-expression
5472 :: [opt] delete [ ] cast-expression
5474 Returns a representation of the expression. */
5477 cp_parser_delete_expression (cp_parser* parser)
5479 bool global_scope_p;
5483 /* Look for the optional `::' operator. */
5485 = (cp_parser_global_scope_opt (parser,
5486 /*current_scope_valid_p=*/false)
5488 /* Look for the `delete' keyword. */
5489 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
5490 /* See if the array syntax is in use. */
5491 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5493 /* Consume the `[' token. */
5494 cp_lexer_consume_token (parser->lexer);
5495 /* Look for the `]' token. */
5496 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5497 /* Remember that this is the `[]' construct. */
5503 /* Parse the cast-expression. */
5504 expression = cp_parser_simple_cast_expression (parser);
5506 /* A delete-expression may not appear in an integral constant
5508 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
5509 return error_mark_node;
5511 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5514 /* Parse a cast-expression.
5518 ( type-id ) cast-expression
5520 ADDRESS_P is true iff the unary-expression is appearing as the
5521 operand of the `&' operator. CAST_P is true if this expression is
5522 the target of a cast.
5524 Returns a representation of the expression. */
5527 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p)
5529 /* If it's a `(', then we might be looking at a cast. */
5530 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5532 tree type = NULL_TREE;
5533 tree expr = NULL_TREE;
5534 bool compound_literal_p;
5535 const char *saved_message;
5537 /* There's no way to know yet whether or not this is a cast.
5538 For example, `(int (3))' is a unary-expression, while `(int)
5539 3' is a cast. So, we resort to parsing tentatively. */
5540 cp_parser_parse_tentatively (parser);
5541 /* Types may not be defined in a cast. */
5542 saved_message = parser->type_definition_forbidden_message;
5543 parser->type_definition_forbidden_message
5544 = "types may not be defined in casts";
5545 /* Consume the `('. */
5546 cp_lexer_consume_token (parser->lexer);
5547 /* A very tricky bit is that `(struct S) { 3 }' is a
5548 compound-literal (which we permit in C++ as an extension).
5549 But, that construct is not a cast-expression -- it is a
5550 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5551 is legal; if the compound-literal were a cast-expression,
5552 you'd need an extra set of parentheses.) But, if we parse
5553 the type-id, and it happens to be a class-specifier, then we
5554 will commit to the parse at that point, because we cannot
5555 undo the action that is done when creating a new class. So,
5556 then we cannot back up and do a postfix-expression.
5558 Therefore, we scan ahead to the closing `)', and check to see
5559 if the token after the `)' is a `{'. If so, we are not
5560 looking at a cast-expression.
5562 Save tokens so that we can put them back. */
5563 cp_lexer_save_tokens (parser->lexer);
5564 /* Skip tokens until the next token is a closing parenthesis.
5565 If we find the closing `)', and the next token is a `{', then
5566 we are looking at a compound-literal. */
5568 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5569 /*consume_paren=*/true)
5570 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5571 /* Roll back the tokens we skipped. */
5572 cp_lexer_rollback_tokens (parser->lexer);
5573 /* If we were looking at a compound-literal, simulate an error
5574 so that the call to cp_parser_parse_definitely below will
5576 if (compound_literal_p)
5577 cp_parser_simulate_error (parser);
5580 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5581 parser->in_type_id_in_expr_p = true;
5582 /* Look for the type-id. */
5583 type = cp_parser_type_id (parser);
5584 /* Look for the closing `)'. */
5585 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5586 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5589 /* Restore the saved message. */
5590 parser->type_definition_forbidden_message = saved_message;
5592 /* If ok so far, parse the dependent expression. We cannot be
5593 sure it is a cast. Consider `(T ())'. It is a parenthesized
5594 ctor of T, but looks like a cast to function returning T
5595 without a dependent expression. */
5596 if (!cp_parser_error_occurred (parser))
5597 expr = cp_parser_cast_expression (parser,
5598 /*address_p=*/false,
5601 if (cp_parser_parse_definitely (parser))
5603 /* Warn about old-style casts, if so requested. */
5604 if (warn_old_style_cast
5605 && !in_system_header
5606 && !VOID_TYPE_P (type)
5607 && current_lang_name != lang_name_c)
5608 warning (OPT_Wold_style_cast, "use of old-style cast");
5610 /* Only type conversions to integral or enumeration types
5611 can be used in constant-expressions. */
5612 if (!cast_valid_in_integral_constant_expression_p (type)
5613 && (cp_parser_non_integral_constant_expression
5615 "a cast to a type other than an integral or "
5616 "enumeration type")))
5617 return error_mark_node;
5619 /* Perform the cast. */
5620 expr = build_c_cast (type, expr);
5625 /* If we get here, then it's not a cast, so it must be a
5626 unary-expression. */
5627 return cp_parser_unary_expression (parser, address_p, cast_p);
5630 /* Parse a binary expression of the general form:
5634 pm-expression .* cast-expression
5635 pm-expression ->* cast-expression
5637 multiplicative-expression:
5639 multiplicative-expression * pm-expression
5640 multiplicative-expression / pm-expression
5641 multiplicative-expression % pm-expression
5643 additive-expression:
5644 multiplicative-expression
5645 additive-expression + multiplicative-expression
5646 additive-expression - multiplicative-expression
5650 shift-expression << additive-expression
5651 shift-expression >> additive-expression
5653 relational-expression:
5655 relational-expression < shift-expression
5656 relational-expression > shift-expression
5657 relational-expression <= shift-expression
5658 relational-expression >= shift-expression
5662 relational-expression:
5663 relational-expression <? shift-expression
5664 relational-expression >? shift-expression
5666 equality-expression:
5667 relational-expression
5668 equality-expression == relational-expression
5669 equality-expression != relational-expression
5673 and-expression & equality-expression
5675 exclusive-or-expression:
5677 exclusive-or-expression ^ and-expression
5679 inclusive-or-expression:
5680 exclusive-or-expression
5681 inclusive-or-expression | exclusive-or-expression
5683 logical-and-expression:
5684 inclusive-or-expression
5685 logical-and-expression && inclusive-or-expression
5687 logical-or-expression:
5688 logical-and-expression
5689 logical-or-expression || logical-and-expression
5691 All these are implemented with a single function like:
5694 simple-cast-expression
5695 binary-expression <token> binary-expression
5697 CAST_P is true if this expression is the target of a cast.
5699 The binops_by_token map is used to get the tree codes for each <token> type.
5700 binary-expressions are associated according to a precedence table. */
5702 #define TOKEN_PRECEDENCE(token) \
5703 ((token->type == CPP_GREATER && !parser->greater_than_is_operator_p) \
5704 ? PREC_NOT_OPERATOR \
5705 : binops_by_token[token->type].prec)
5708 cp_parser_binary_expression (cp_parser* parser, bool cast_p)
5710 cp_parser_expression_stack stack;
5711 cp_parser_expression_stack_entry *sp = &stack[0];
5714 enum tree_code tree_type, lhs_type, rhs_type;
5715 enum cp_parser_prec prec = PREC_NOT_OPERATOR, new_prec, lookahead_prec;
5718 /* Parse the first expression. */
5719 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p);
5720 lhs_type = ERROR_MARK;
5724 /* Get an operator token. */
5725 token = cp_lexer_peek_token (parser->lexer);
5727 new_prec = TOKEN_PRECEDENCE (token);
5729 /* Popping an entry off the stack means we completed a subexpression:
5730 - either we found a token which is not an operator (`>' where it is not
5731 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
5732 will happen repeatedly;
5733 - or, we found an operator which has lower priority. This is the case
5734 where the recursive descent *ascends*, as in `3 * 4 + 5' after
5736 if (new_prec <= prec)
5745 tree_type = binops_by_token[token->type].tree_type;
5747 /* We used the operator token. */
5748 cp_lexer_consume_token (parser->lexer);
5750 /* Extract another operand. It may be the RHS of this expression
5751 or the LHS of a new, higher priority expression. */
5752 rhs = cp_parser_simple_cast_expression (parser);
5753 rhs_type = ERROR_MARK;
5755 /* Get another operator token. Look up its precedence to avoid
5756 building a useless (immediately popped) stack entry for common
5757 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
5758 token = cp_lexer_peek_token (parser->lexer);
5759 lookahead_prec = TOKEN_PRECEDENCE (token);
5760 if (lookahead_prec > new_prec)
5762 /* ... and prepare to parse the RHS of the new, higher priority
5763 expression. Since precedence levels on the stack are
5764 monotonically increasing, we do not have to care about
5767 sp->tree_type = tree_type;
5769 sp->lhs_type = lhs_type;
5772 lhs_type = rhs_type;
5774 new_prec = lookahead_prec;
5778 /* If the stack is not empty, we have parsed into LHS the right side
5779 (`4' in the example above) of an expression we had suspended.
5780 We can use the information on the stack to recover the LHS (`3')
5781 from the stack together with the tree code (`MULT_EXPR'), and
5782 the precedence of the higher level subexpression
5783 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
5784 which will be used to actually build the additive expression. */
5787 tree_type = sp->tree_type;
5789 rhs_type = lhs_type;
5791 lhs_type = sp->lhs_type;
5794 overloaded_p = false;
5795 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
5797 lhs_type = tree_type;
5799 /* If the binary operator required the use of an overloaded operator,
5800 then this expression cannot be an integral constant-expression.
5801 An overloaded operator can be used even if both operands are
5802 otherwise permissible in an integral constant-expression if at
5803 least one of the operands is of enumeration type. */
5806 && (cp_parser_non_integral_constant_expression
5807 (parser, "calls to overloaded operators")))
5808 return error_mark_node;
5815 /* Parse the `? expression : assignment-expression' part of a
5816 conditional-expression. The LOGICAL_OR_EXPR is the
5817 logical-or-expression that started the conditional-expression.
5818 Returns a representation of the entire conditional-expression.
5820 This routine is used by cp_parser_assignment_expression.
5822 ? expression : assignment-expression
5826 ? : assignment-expression */
5829 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5832 tree assignment_expr;
5834 /* Consume the `?' token. */
5835 cp_lexer_consume_token (parser->lexer);
5836 if (cp_parser_allow_gnu_extensions_p (parser)
5837 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5838 /* Implicit true clause. */
5841 /* Parse the expression. */
5842 expr = cp_parser_expression (parser, /*cast_p=*/false);
5844 /* The next token should be a `:'. */
5845 cp_parser_require (parser, CPP_COLON, "`:'");
5846 /* Parse the assignment-expression. */
5847 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false);
5849 /* Build the conditional-expression. */
5850 return build_x_conditional_expr (logical_or_expr,
5855 /* Parse an assignment-expression.
5857 assignment-expression:
5858 conditional-expression
5859 logical-or-expression assignment-operator assignment_expression
5862 CAST_P is true if this expression is the target of a cast.
5864 Returns a representation for the expression. */
5867 cp_parser_assignment_expression (cp_parser* parser, bool cast_p)
5871 /* If the next token is the `throw' keyword, then we're looking at
5872 a throw-expression. */
5873 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5874 expr = cp_parser_throw_expression (parser);
5875 /* Otherwise, it must be that we are looking at a
5876 logical-or-expression. */
5879 /* Parse the binary expressions (logical-or-expression). */
5880 expr = cp_parser_binary_expression (parser, cast_p);
5881 /* If the next token is a `?' then we're actually looking at a
5882 conditional-expression. */
5883 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5884 return cp_parser_question_colon_clause (parser, expr);
5887 enum tree_code assignment_operator;
5889 /* If it's an assignment-operator, we're using the second
5892 = cp_parser_assignment_operator_opt (parser);
5893 if (assignment_operator != ERROR_MARK)
5897 /* Parse the right-hand side of the assignment. */
5898 rhs = cp_parser_assignment_expression (parser, cast_p);
5899 /* An assignment may not appear in a
5900 constant-expression. */
5901 if (cp_parser_non_integral_constant_expression (parser,
5903 return error_mark_node;
5904 /* Build the assignment expression. */
5905 expr = build_x_modify_expr (expr,
5906 assignment_operator,
5915 /* Parse an (optional) assignment-operator.
5917 assignment-operator: one of
5918 = *= /= %= += -= >>= <<= &= ^= |=
5922 assignment-operator: one of
5925 If the next token is an assignment operator, the corresponding tree
5926 code is returned, and the token is consumed. For example, for
5927 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5928 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5929 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5930 operator, ERROR_MARK is returned. */
5932 static enum tree_code
5933 cp_parser_assignment_operator_opt (cp_parser* parser)
5938 /* Peek at the next toen. */
5939 token = cp_lexer_peek_token (parser->lexer);
5941 switch (token->type)
5952 op = TRUNC_DIV_EXPR;
5956 op = TRUNC_MOD_EXPR;
5988 /* Nothing else is an assignment operator. */
5992 /* If it was an assignment operator, consume it. */
5993 if (op != ERROR_MARK)
5994 cp_lexer_consume_token (parser->lexer);
5999 /* Parse an expression.
6002 assignment-expression
6003 expression , assignment-expression
6005 CAST_P is true if this expression is the target of a cast.
6007 Returns a representation of the expression. */
6010 cp_parser_expression (cp_parser* parser, bool cast_p)
6012 tree expression = NULL_TREE;
6016 tree assignment_expression;
6018 /* Parse the next assignment-expression. */
6019 assignment_expression
6020 = cp_parser_assignment_expression (parser, cast_p);
6021 /* If this is the first assignment-expression, we can just
6024 expression = assignment_expression;
6026 expression = build_x_compound_expr (expression,
6027 assignment_expression);
6028 /* If the next token is not a comma, then we are done with the
6030 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6032 /* Consume the `,'. */
6033 cp_lexer_consume_token (parser->lexer);
6034 /* A comma operator cannot appear in a constant-expression. */
6035 if (cp_parser_non_integral_constant_expression (parser,
6036 "a comma operator"))
6037 expression = error_mark_node;
6043 /* Parse a constant-expression.
6045 constant-expression:
6046 conditional-expression
6048 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
6049 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
6050 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
6051 is false, NON_CONSTANT_P should be NULL. */
6054 cp_parser_constant_expression (cp_parser* parser,
6055 bool allow_non_constant_p,
6056 bool *non_constant_p)
6058 bool saved_integral_constant_expression_p;
6059 bool saved_allow_non_integral_constant_expression_p;
6060 bool saved_non_integral_constant_expression_p;
6063 /* It might seem that we could simply parse the
6064 conditional-expression, and then check to see if it were
6065 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
6066 one that the compiler can figure out is constant, possibly after
6067 doing some simplifications or optimizations. The standard has a
6068 precise definition of constant-expression, and we must honor
6069 that, even though it is somewhat more restrictive.
6075 is not a legal declaration, because `(2, 3)' is not a
6076 constant-expression. The `,' operator is forbidden in a
6077 constant-expression. However, GCC's constant-folding machinery
6078 will fold this operation to an INTEGER_CST for `3'. */
6080 /* Save the old settings. */
6081 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
6082 saved_allow_non_integral_constant_expression_p
6083 = parser->allow_non_integral_constant_expression_p;
6084 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
6085 /* We are now parsing a constant-expression. */
6086 parser->integral_constant_expression_p = true;
6087 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
6088 parser->non_integral_constant_expression_p = false;
6089 /* Although the grammar says "conditional-expression", we parse an
6090 "assignment-expression", which also permits "throw-expression"
6091 and the use of assignment operators. In the case that
6092 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
6093 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
6094 actually essential that we look for an assignment-expression.
6095 For example, cp_parser_initializer_clauses uses this function to
6096 determine whether a particular assignment-expression is in fact
6098 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false);
6099 /* Restore the old settings. */
6100 parser->integral_constant_expression_p
6101 = saved_integral_constant_expression_p;
6102 parser->allow_non_integral_constant_expression_p
6103 = saved_allow_non_integral_constant_expression_p;
6104 if (allow_non_constant_p)
6105 *non_constant_p = parser->non_integral_constant_expression_p;
6106 else if (parser->non_integral_constant_expression_p)
6107 expression = error_mark_node;
6108 parser->non_integral_constant_expression_p
6109 = saved_non_integral_constant_expression_p;
6114 /* Parse __builtin_offsetof.
6116 offsetof-expression:
6117 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
6119 offsetof-member-designator:
6121 | offsetof-member-designator "." id-expression
6122 | offsetof-member-designator "[" expression "]" */
6125 cp_parser_builtin_offsetof (cp_parser *parser)
6127 int save_ice_p, save_non_ice_p;
6131 /* We're about to accept non-integral-constant things, but will
6132 definitely yield an integral constant expression. Save and
6133 restore these values around our local parsing. */
6134 save_ice_p = parser->integral_constant_expression_p;
6135 save_non_ice_p = parser->non_integral_constant_expression_p;
6137 /* Consume the "__builtin_offsetof" token. */
6138 cp_lexer_consume_token (parser->lexer);
6139 /* Consume the opening `('. */
6140 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6141 /* Parse the type-id. */
6142 type = cp_parser_type_id (parser);
6143 /* Look for the `,'. */
6144 cp_parser_require (parser, CPP_COMMA, "`,'");
6146 /* Build the (type *)null that begins the traditional offsetof macro. */
6147 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
6149 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
6150 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
6154 cp_token *token = cp_lexer_peek_token (parser->lexer);
6155 switch (token->type)
6157 case CPP_OPEN_SQUARE:
6158 /* offsetof-member-designator "[" expression "]" */
6159 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
6163 /* offsetof-member-designator "." identifier */
6164 cp_lexer_consume_token (parser->lexer);
6165 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
6169 case CPP_CLOSE_PAREN:
6170 /* Consume the ")" token. */
6171 cp_lexer_consume_token (parser->lexer);
6175 /* Error. We know the following require will fail, but
6176 that gives the proper error message. */
6177 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6178 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
6179 expr = error_mark_node;
6185 /* If we're processing a template, we can't finish the semantics yet.
6186 Otherwise we can fold the entire expression now. */
6187 if (processing_template_decl)
6188 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
6190 expr = finish_offsetof (expr);
6193 parser->integral_constant_expression_p = save_ice_p;
6194 parser->non_integral_constant_expression_p = save_non_ice_p;
6199 /* Statements [gram.stmt.stmt] */
6201 /* Parse a statement.
6205 expression-statement
6210 declaration-statement
6213 IN_COMPOUND is true when the statement is nested inside a
6214 cp_parser_compound_statement; this matters for certain pragmas.
6216 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6217 is a (possibly labeled) if statement which is not enclosed in braces
6218 and has an else clause. This is used to implement -Wparentheses. */
6221 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
6222 bool in_compound, bool *if_p)
6226 location_t statement_location;
6231 /* There is no statement yet. */
6232 statement = NULL_TREE;
6233 /* Peek at the next token. */
6234 token = cp_lexer_peek_token (parser->lexer);
6235 /* Remember the location of the first token in the statement. */
6236 statement_location = token->location;
6237 /* If this is a keyword, then that will often determine what kind of
6238 statement we have. */
6239 if (token->type == CPP_KEYWORD)
6241 enum rid keyword = token->keyword;
6247 /* Looks like a labeled-statement with a case label.
6248 Parse the label, and then use tail recursion to parse
6250 cp_parser_label_for_labeled_statement (parser);
6255 statement = cp_parser_selection_statement (parser, if_p);
6261 statement = cp_parser_iteration_statement (parser);
6268 statement = cp_parser_jump_statement (parser);
6271 /* Objective-C++ exception-handling constructs. */
6274 case RID_AT_FINALLY:
6275 case RID_AT_SYNCHRONIZED:
6277 statement = cp_parser_objc_statement (parser);
6281 statement = cp_parser_try_block (parser);
6285 /* It might be a keyword like `int' that can start a
6286 declaration-statement. */
6290 else if (token->type == CPP_NAME)
6292 /* If the next token is a `:', then we are looking at a
6293 labeled-statement. */
6294 token = cp_lexer_peek_nth_token (parser->lexer, 2);
6295 if (token->type == CPP_COLON)
6297 /* Looks like a labeled-statement with an ordinary label.
6298 Parse the label, and then use tail recursion to parse
6300 cp_parser_label_for_labeled_statement (parser);
6304 /* Anything that starts with a `{' must be a compound-statement. */
6305 else if (token->type == CPP_OPEN_BRACE)
6306 statement = cp_parser_compound_statement (parser, NULL, false);
6307 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6308 a statement all its own. */
6309 else if (token->type == CPP_PRAGMA)
6311 /* Only certain OpenMP pragmas are attached to statements, and thus
6312 are considered statements themselves. All others are not. In
6313 the context of a compound, accept the pragma as a "statement" and
6314 return so that we can check for a close brace. Otherwise we
6315 require a real statement and must go back and read one. */
6317 cp_parser_pragma (parser, pragma_compound);
6318 else if (!cp_parser_pragma (parser, pragma_stmt))
6322 else if (token->type == CPP_EOF)
6324 cp_parser_error (parser, "expected statement");
6328 /* Everything else must be a declaration-statement or an
6329 expression-statement. Try for the declaration-statement
6330 first, unless we are looking at a `;', in which case we know that
6331 we have an expression-statement. */
6334 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6336 cp_parser_parse_tentatively (parser);
6337 /* Try to parse the declaration-statement. */
6338 cp_parser_declaration_statement (parser);
6339 /* If that worked, we're done. */
6340 if (cp_parser_parse_definitely (parser))
6343 /* Look for an expression-statement instead. */
6344 statement = cp_parser_expression_statement (parser, in_statement_expr);
6347 /* Set the line number for the statement. */
6348 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
6349 SET_EXPR_LOCATION (statement, statement_location);
6352 /* Parse the label for a labeled-statement, i.e.
6355 case constant-expression :
6359 case constant-expression ... constant-expression : statement
6361 When a label is parsed without errors, the label is added to the
6362 parse tree by the finish_* functions, so this function doesn't
6363 have to return the label. */
6366 cp_parser_label_for_labeled_statement (cp_parser* parser)
6370 /* The next token should be an identifier. */
6371 token = cp_lexer_peek_token (parser->lexer);
6372 if (token->type != CPP_NAME
6373 && token->type != CPP_KEYWORD)
6375 cp_parser_error (parser, "expected labeled-statement");
6379 switch (token->keyword)
6386 /* Consume the `case' token. */
6387 cp_lexer_consume_token (parser->lexer);
6388 /* Parse the constant-expression. */
6389 expr = cp_parser_constant_expression (parser,
6390 /*allow_non_constant_p=*/false,
6393 ellipsis = cp_lexer_peek_token (parser->lexer);
6394 if (ellipsis->type == CPP_ELLIPSIS)
6396 /* Consume the `...' token. */
6397 cp_lexer_consume_token (parser->lexer);
6399 cp_parser_constant_expression (parser,
6400 /*allow_non_constant_p=*/false,
6402 /* We don't need to emit warnings here, as the common code
6403 will do this for us. */
6406 expr_hi = NULL_TREE;
6408 if (parser->in_switch_statement_p)
6409 finish_case_label (expr, expr_hi);
6411 error ("case label %qE not within a switch statement", expr);
6416 /* Consume the `default' token. */
6417 cp_lexer_consume_token (parser->lexer);
6419 if (parser->in_switch_statement_p)
6420 finish_case_label (NULL_TREE, NULL_TREE);
6422 error ("case label not within a switch statement");
6426 /* Anything else must be an ordinary label. */
6427 finish_label_stmt (cp_parser_identifier (parser));
6431 /* Require the `:' token. */
6432 cp_parser_require (parser, CPP_COLON, "`:'");
6435 /* Parse an expression-statement.
6437 expression-statement:
6440 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6441 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6442 indicates whether this expression-statement is part of an
6443 expression statement. */
6446 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6448 tree statement = NULL_TREE;
6450 /* If the next token is a ';', then there is no expression
6452 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6453 statement = cp_parser_expression (parser, /*cast_p=*/false);
6455 /* Consume the final `;'. */
6456 cp_parser_consume_semicolon_at_end_of_statement (parser);
6458 if (in_statement_expr
6459 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
6460 /* This is the final expression statement of a statement
6462 statement = finish_stmt_expr_expr (statement, in_statement_expr);
6464 statement = finish_expr_stmt (statement);
6471 /* Parse a compound-statement.
6474 { statement-seq [opt] }
6476 Returns a tree representing the statement. */
6479 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
6484 /* Consume the `{'. */
6485 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
6486 return error_mark_node;
6487 /* Begin the compound-statement. */
6488 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
6489 /* Parse an (optional) statement-seq. */
6490 cp_parser_statement_seq_opt (parser, in_statement_expr);
6491 /* Finish the compound-statement. */
6492 finish_compound_stmt (compound_stmt);
6493 /* Consume the `}'. */
6494 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6496 return compound_stmt;
6499 /* Parse an (optional) statement-seq.
6503 statement-seq [opt] statement */
6506 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
6508 /* Scan statements until there aren't any more. */
6511 cp_token *token = cp_lexer_peek_token (parser->lexer);
6513 /* If we're looking at a `}', then we've run out of statements. */
6514 if (token->type == CPP_CLOSE_BRACE
6515 || token->type == CPP_EOF
6516 || token->type == CPP_PRAGMA_EOL)
6519 /* Parse the statement. */
6520 cp_parser_statement (parser, in_statement_expr, true, NULL);
6524 /* Parse a selection-statement.
6526 selection-statement:
6527 if ( condition ) statement
6528 if ( condition ) statement else statement
6529 switch ( condition ) statement
6531 Returns the new IF_STMT or SWITCH_STMT.
6533 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6534 is a (possibly labeled) if statement which is not enclosed in
6535 braces and has an else clause. This is used to implement
6539 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
6547 /* Peek at the next token. */
6548 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
6550 /* See what kind of keyword it is. */
6551 keyword = token->keyword;
6560 /* Look for the `('. */
6561 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
6563 cp_parser_skip_to_end_of_statement (parser);
6564 return error_mark_node;
6567 /* Begin the selection-statement. */
6568 if (keyword == RID_IF)
6569 statement = begin_if_stmt ();
6571 statement = begin_switch_stmt ();
6573 /* Parse the condition. */
6574 condition = cp_parser_condition (parser);
6575 /* Look for the `)'. */
6576 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
6577 cp_parser_skip_to_closing_parenthesis (parser, true, false,
6578 /*consume_paren=*/true);
6580 if (keyword == RID_IF)
6584 /* Add the condition. */
6585 finish_if_stmt_cond (condition, statement);
6587 /* Parse the then-clause. */
6588 cp_parser_implicitly_scoped_statement (parser, &nested_if);
6589 finish_then_clause (statement);
6591 /* If the next token is `else', parse the else-clause. */
6592 if (cp_lexer_next_token_is_keyword (parser->lexer,
6595 /* Consume the `else' keyword. */
6596 cp_lexer_consume_token (parser->lexer);
6597 begin_else_clause (statement);
6598 /* Parse the else-clause. */
6599 cp_parser_implicitly_scoped_statement (parser, NULL);
6600 finish_else_clause (statement);
6602 /* If we are currently parsing a then-clause, then
6603 IF_P will not be NULL. We set it to true to
6604 indicate that this if statement has an else clause.
6605 This may trigger the Wparentheses warning below
6606 when we get back up to the parent if statement. */
6612 /* This if statement does not have an else clause. If
6613 NESTED_IF is true, then the then-clause is an if
6614 statement which does have an else clause. We warn
6615 about the potential ambiguity. */
6617 warning (OPT_Wparentheses,
6618 ("%Hsuggest explicit braces "
6619 "to avoid ambiguous %<else%>"),
6620 EXPR_LOCUS (statement));
6623 /* Now we're all done with the if-statement. */
6624 finish_if_stmt (statement);
6628 bool in_switch_statement_p;
6629 unsigned char in_statement;
6631 /* Add the condition. */
6632 finish_switch_cond (condition, statement);
6634 /* Parse the body of the switch-statement. */
6635 in_switch_statement_p = parser->in_switch_statement_p;
6636 in_statement = parser->in_statement;
6637 parser->in_switch_statement_p = true;
6638 parser->in_statement |= IN_SWITCH_STMT;
6639 cp_parser_implicitly_scoped_statement (parser, NULL);
6640 parser->in_switch_statement_p = in_switch_statement_p;
6641 parser->in_statement = in_statement;
6643 /* Now we're all done with the switch-statement. */
6644 finish_switch_stmt (statement);
6652 cp_parser_error (parser, "expected selection-statement");
6653 return error_mark_node;
6657 /* Parse a condition.
6661 type-specifier-seq declarator = assignment-expression
6666 type-specifier-seq declarator asm-specification [opt]
6667 attributes [opt] = assignment-expression
6669 Returns the expression that should be tested. */
6672 cp_parser_condition (cp_parser* parser)
6674 cp_decl_specifier_seq type_specifiers;
6675 const char *saved_message;
6677 /* Try the declaration first. */
6678 cp_parser_parse_tentatively (parser);
6679 /* New types are not allowed in the type-specifier-seq for a
6681 saved_message = parser->type_definition_forbidden_message;
6682 parser->type_definition_forbidden_message
6683 = "types may not be defined in conditions";
6684 /* Parse the type-specifier-seq. */
6685 cp_parser_type_specifier_seq (parser, /*is_condition==*/true,
6687 /* Restore the saved message. */
6688 parser->type_definition_forbidden_message = saved_message;
6689 /* If all is well, we might be looking at a declaration. */
6690 if (!cp_parser_error_occurred (parser))
6693 tree asm_specification;
6695 cp_declarator *declarator;
6696 tree initializer = NULL_TREE;
6698 /* Parse the declarator. */
6699 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6700 /*ctor_dtor_or_conv_p=*/NULL,
6701 /*parenthesized_p=*/NULL,
6702 /*member_p=*/false);
6703 /* Parse the attributes. */
6704 attributes = cp_parser_attributes_opt (parser);
6705 /* Parse the asm-specification. */
6706 asm_specification = cp_parser_asm_specification_opt (parser);
6707 /* If the next token is not an `=', then we might still be
6708 looking at an expression. For example:
6712 looks like a decl-specifier-seq and a declarator -- but then
6713 there is no `=', so this is an expression. */
6714 cp_parser_require (parser, CPP_EQ, "`='");
6715 /* If we did see an `=', then we are looking at a declaration
6717 if (cp_parser_parse_definitely (parser))
6720 bool non_constant_p;
6722 /* Create the declaration. */
6723 decl = start_decl (declarator, &type_specifiers,
6724 /*initialized_p=*/true,
6725 attributes, /*prefix_attributes=*/NULL_TREE,
6727 /* Parse the assignment-expression. */
6729 = cp_parser_constant_expression (parser,
6730 /*allow_non_constant_p=*/true,
6732 if (!non_constant_p)
6733 initializer = fold_non_dependent_expr (initializer);
6735 /* Process the initializer. */
6736 cp_finish_decl (decl,
6737 initializer, !non_constant_p,
6739 LOOKUP_ONLYCONVERTING);
6742 pop_scope (pushed_scope);
6744 return convert_from_reference (decl);
6747 /* If we didn't even get past the declarator successfully, we are
6748 definitely not looking at a declaration. */
6750 cp_parser_abort_tentative_parse (parser);
6752 /* Otherwise, we are looking at an expression. */
6753 return cp_parser_expression (parser, /*cast_p=*/false);
6756 /* Parse an iteration-statement.
6758 iteration-statement:
6759 while ( condition ) statement
6760 do statement while ( expression ) ;
6761 for ( for-init-statement condition [opt] ; expression [opt] )
6764 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6767 cp_parser_iteration_statement (cp_parser* parser)
6772 unsigned char in_statement;
6774 /* Peek at the next token. */
6775 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6777 return error_mark_node;
6779 /* Remember whether or not we are already within an iteration
6781 in_statement = parser->in_statement;
6783 /* See what kind of keyword it is. */
6784 keyword = token->keyword;
6791 /* Begin the while-statement. */
6792 statement = begin_while_stmt ();
6793 /* Look for the `('. */
6794 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6795 /* Parse the condition. */
6796 condition = cp_parser_condition (parser);
6797 finish_while_stmt_cond (condition, statement);
6798 /* Look for the `)'. */
6799 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6800 /* Parse the dependent statement. */
6801 parser->in_statement = IN_ITERATION_STMT;
6802 cp_parser_already_scoped_statement (parser);
6803 parser->in_statement = in_statement;
6804 /* We're done with the while-statement. */
6805 finish_while_stmt (statement);
6813 /* Begin the do-statement. */
6814 statement = begin_do_stmt ();
6815 /* Parse the body of the do-statement. */
6816 parser->in_statement = IN_ITERATION_STMT;
6817 cp_parser_implicitly_scoped_statement (parser, NULL);
6818 parser->in_statement = in_statement;
6819 finish_do_body (statement);
6820 /* Look for the `while' keyword. */
6821 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6822 /* Look for the `('. */
6823 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6824 /* Parse the expression. */
6825 expression = cp_parser_expression (parser, /*cast_p=*/false);
6826 /* We're done with the do-statement. */
6827 finish_do_stmt (expression, statement);
6828 /* Look for the `)'. */
6829 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6830 /* Look for the `;'. */
6831 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6837 tree condition = NULL_TREE;
6838 tree expression = NULL_TREE;
6840 /* Begin the for-statement. */
6841 statement = begin_for_stmt ();
6842 /* Look for the `('. */
6843 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6844 /* Parse the initialization. */
6845 cp_parser_for_init_statement (parser);
6846 finish_for_init_stmt (statement);
6848 /* If there's a condition, process it. */
6849 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6850 condition = cp_parser_condition (parser);
6851 finish_for_cond (condition, statement);
6852 /* Look for the `;'. */
6853 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6855 /* If there's an expression, process it. */
6856 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6857 expression = cp_parser_expression (parser, /*cast_p=*/false);
6858 finish_for_expr (expression, statement);
6859 /* Look for the `)'. */
6860 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6862 /* Parse the body of the for-statement. */
6863 parser->in_statement = IN_ITERATION_STMT;
6864 cp_parser_already_scoped_statement (parser);
6865 parser->in_statement = in_statement;
6867 /* We're done with the for-statement. */
6868 finish_for_stmt (statement);
6873 cp_parser_error (parser, "expected iteration-statement");
6874 statement = error_mark_node;
6881 /* Parse a for-init-statement.
6884 expression-statement
6885 simple-declaration */
6888 cp_parser_for_init_statement (cp_parser* parser)
6890 /* If the next token is a `;', then we have an empty
6891 expression-statement. Grammatically, this is also a
6892 simple-declaration, but an invalid one, because it does not
6893 declare anything. Therefore, if we did not handle this case
6894 specially, we would issue an error message about an invalid
6896 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6898 /* We're going to speculatively look for a declaration, falling back
6899 to an expression, if necessary. */
6900 cp_parser_parse_tentatively (parser);
6901 /* Parse the declaration. */
6902 cp_parser_simple_declaration (parser,
6903 /*function_definition_allowed_p=*/false);
6904 /* If the tentative parse failed, then we shall need to look for an
6905 expression-statement. */
6906 if (cp_parser_parse_definitely (parser))
6910 cp_parser_expression_statement (parser, false);
6913 /* Parse a jump-statement.
6918 return expression [opt] ;
6926 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6929 cp_parser_jump_statement (cp_parser* parser)
6931 tree statement = error_mark_node;
6935 /* Peek at the next token. */
6936 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6938 return error_mark_node;
6940 /* See what kind of keyword it is. */
6941 keyword = token->keyword;
6945 switch (parser->in_statement)
6948 error ("break statement not within loop or switch");
6951 gcc_assert ((parser->in_statement & IN_SWITCH_STMT)
6952 || parser->in_statement == IN_ITERATION_STMT);
6953 statement = finish_break_stmt ();
6956 error ("invalid exit from OpenMP structured block");
6959 error ("break statement used with OpenMP for loop");
6962 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6966 switch (parser->in_statement & ~IN_SWITCH_STMT)
6969 error ("continue statement not within a loop");
6971 case IN_ITERATION_STMT:
6973 statement = finish_continue_stmt ();
6976 error ("invalid exit from OpenMP structured block");
6981 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6988 /* If the next token is a `;', then there is no
6990 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6991 expr = cp_parser_expression (parser, /*cast_p=*/false);
6994 /* Build the return-statement. */
6995 statement = finish_return_stmt (expr);
6996 /* Look for the final `;'. */
6997 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7002 /* Create the goto-statement. */
7003 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
7005 /* Issue a warning about this use of a GNU extension. */
7007 pedwarn ("ISO C++ forbids computed gotos");
7008 /* Consume the '*' token. */
7009 cp_lexer_consume_token (parser->lexer);
7010 /* Parse the dependent expression. */
7011 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false));
7014 finish_goto_stmt (cp_parser_identifier (parser));
7015 /* Look for the final `;'. */
7016 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7020 cp_parser_error (parser, "expected jump-statement");
7027 /* Parse a declaration-statement.
7029 declaration-statement:
7030 block-declaration */
7033 cp_parser_declaration_statement (cp_parser* parser)
7037 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7038 p = obstack_alloc (&declarator_obstack, 0);
7040 /* Parse the block-declaration. */
7041 cp_parser_block_declaration (parser, /*statement_p=*/true);
7043 /* Free any declarators allocated. */
7044 obstack_free (&declarator_obstack, p);
7046 /* Finish off the statement. */
7050 /* Some dependent statements (like `if (cond) statement'), are
7051 implicitly in their own scope. In other words, if the statement is
7052 a single statement (as opposed to a compound-statement), it is
7053 none-the-less treated as if it were enclosed in braces. Any
7054 declarations appearing in the dependent statement are out of scope
7055 after control passes that point. This function parses a statement,
7056 but ensures that is in its own scope, even if it is not a
7059 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7060 is a (possibly labeled) if statement which is not enclosed in
7061 braces and has an else clause. This is used to implement
7064 Returns the new statement. */
7067 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
7074 /* Mark if () ; with a special NOP_EXPR. */
7075 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7077 cp_lexer_consume_token (parser->lexer);
7078 statement = add_stmt (build_empty_stmt ());
7080 /* if a compound is opened, we simply parse the statement directly. */
7081 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7082 statement = cp_parser_compound_statement (parser, NULL, false);
7083 /* If the token is not a `{', then we must take special action. */
7086 /* Create a compound-statement. */
7087 statement = begin_compound_stmt (0);
7088 /* Parse the dependent-statement. */
7089 cp_parser_statement (parser, NULL_TREE, false, if_p);
7090 /* Finish the dummy compound-statement. */
7091 finish_compound_stmt (statement);
7094 /* Return the statement. */
7098 /* For some dependent statements (like `while (cond) statement'), we
7099 have already created a scope. Therefore, even if the dependent
7100 statement is a compound-statement, we do not want to create another
7104 cp_parser_already_scoped_statement (cp_parser* parser)
7106 /* If the token is a `{', then we must take special action. */
7107 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
7108 cp_parser_statement (parser, NULL_TREE, false, NULL);
7111 /* Avoid calling cp_parser_compound_statement, so that we
7112 don't create a new scope. Do everything else by hand. */
7113 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
7114 cp_parser_statement_seq_opt (parser, NULL_TREE);
7115 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7119 /* Declarations [gram.dcl.dcl] */
7121 /* Parse an optional declaration-sequence.
7125 declaration-seq declaration */
7128 cp_parser_declaration_seq_opt (cp_parser* parser)
7134 token = cp_lexer_peek_token (parser->lexer);
7136 if (token->type == CPP_CLOSE_BRACE
7137 || token->type == CPP_EOF
7138 || token->type == CPP_PRAGMA_EOL)
7141 if (token->type == CPP_SEMICOLON)
7143 /* A declaration consisting of a single semicolon is
7144 invalid. Allow it unless we're being pedantic. */
7145 cp_lexer_consume_token (parser->lexer);
7146 if (pedantic && !in_system_header)
7147 pedwarn ("extra %<;%>");
7151 /* If we're entering or exiting a region that's implicitly
7152 extern "C", modify the lang context appropriately. */
7153 if (!parser->implicit_extern_c && token->implicit_extern_c)
7155 push_lang_context (lang_name_c);
7156 parser->implicit_extern_c = true;
7158 else if (parser->implicit_extern_c && !token->implicit_extern_c)
7160 pop_lang_context ();
7161 parser->implicit_extern_c = false;
7164 if (token->type == CPP_PRAGMA)
7166 /* A top-level declaration can consist solely of a #pragma.
7167 A nested declaration cannot, so this is done here and not
7168 in cp_parser_declaration. (A #pragma at block scope is
7169 handled in cp_parser_statement.) */
7170 cp_parser_pragma (parser, pragma_external);
7174 /* Parse the declaration itself. */
7175 cp_parser_declaration (parser);
7179 /* Parse a declaration.
7184 template-declaration
7185 explicit-instantiation
7186 explicit-specialization
7187 linkage-specification
7188 namespace-definition
7193 __extension__ declaration */
7196 cp_parser_declaration (cp_parser* parser)
7203 /* Check for the `__extension__' keyword. */
7204 if (cp_parser_extension_opt (parser, &saved_pedantic))
7206 /* Parse the qualified declaration. */
7207 cp_parser_declaration (parser);
7208 /* Restore the PEDANTIC flag. */
7209 pedantic = saved_pedantic;
7214 /* Try to figure out what kind of declaration is present. */
7215 token1 = *cp_lexer_peek_token (parser->lexer);
7217 if (token1.type != CPP_EOF)
7218 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
7221 token2.type = CPP_EOF;
7222 token2.keyword = RID_MAX;
7225 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7226 p = obstack_alloc (&declarator_obstack, 0);
7228 /* If the next token is `extern' and the following token is a string
7229 literal, then we have a linkage specification. */
7230 if (token1.keyword == RID_EXTERN
7231 && cp_parser_is_string_literal (&token2))
7232 cp_parser_linkage_specification (parser);
7233 /* If the next token is `template', then we have either a template
7234 declaration, an explicit instantiation, or an explicit
7236 else if (token1.keyword == RID_TEMPLATE)
7238 /* `template <>' indicates a template specialization. */
7239 if (token2.type == CPP_LESS
7240 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
7241 cp_parser_explicit_specialization (parser);
7242 /* `template <' indicates a template declaration. */
7243 else if (token2.type == CPP_LESS)
7244 cp_parser_template_declaration (parser, /*member_p=*/false);
7245 /* Anything else must be an explicit instantiation. */
7247 cp_parser_explicit_instantiation (parser);
7249 /* If the next token is `export', then we have a template
7251 else if (token1.keyword == RID_EXPORT)
7252 cp_parser_template_declaration (parser, /*member_p=*/false);
7253 /* If the next token is `extern', 'static' or 'inline' and the one
7254 after that is `template', we have a GNU extended explicit
7255 instantiation directive. */
7256 else if (cp_parser_allow_gnu_extensions_p (parser)
7257 && (token1.keyword == RID_EXTERN
7258 || token1.keyword == RID_STATIC
7259 || token1.keyword == RID_INLINE)
7260 && token2.keyword == RID_TEMPLATE)
7261 cp_parser_explicit_instantiation (parser);
7262 /* If the next token is `namespace', check for a named or unnamed
7263 namespace definition. */
7264 else if (token1.keyword == RID_NAMESPACE
7265 && (/* A named namespace definition. */
7266 (token2.type == CPP_NAME
7267 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
7269 /* An unnamed namespace definition. */
7270 || token2.type == CPP_OPEN_BRACE
7271 || token2.keyword == RID_ATTRIBUTE))
7272 cp_parser_namespace_definition (parser);
7273 /* Objective-C++ declaration/definition. */
7274 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
7275 cp_parser_objc_declaration (parser);
7276 /* We must have either a block declaration or a function
7279 /* Try to parse a block-declaration, or a function-definition. */
7280 cp_parser_block_declaration (parser, /*statement_p=*/false);
7282 /* Free any declarators allocated. */
7283 obstack_free (&declarator_obstack, p);
7286 /* Parse a block-declaration.
7291 namespace-alias-definition
7298 __extension__ block-declaration
7304 static_assert-declaration
7306 If STATEMENT_P is TRUE, then this block-declaration is occurring as
7307 part of a declaration-statement. */
7310 cp_parser_block_declaration (cp_parser *parser,
7316 /* Check for the `__extension__' keyword. */
7317 if (cp_parser_extension_opt (parser, &saved_pedantic))
7319 /* Parse the qualified declaration. */
7320 cp_parser_block_declaration (parser, statement_p);
7321 /* Restore the PEDANTIC flag. */
7322 pedantic = saved_pedantic;
7327 /* Peek at the next token to figure out which kind of declaration is
7329 token1 = cp_lexer_peek_token (parser->lexer);
7331 /* If the next keyword is `asm', we have an asm-definition. */
7332 if (token1->keyword == RID_ASM)
7335 cp_parser_commit_to_tentative_parse (parser);
7336 cp_parser_asm_definition (parser);
7338 /* If the next keyword is `namespace', we have a
7339 namespace-alias-definition. */
7340 else if (token1->keyword == RID_NAMESPACE)
7341 cp_parser_namespace_alias_definition (parser);
7342 /* If the next keyword is `using', we have either a
7343 using-declaration or a using-directive. */
7344 else if (token1->keyword == RID_USING)
7349 cp_parser_commit_to_tentative_parse (parser);
7350 /* If the token after `using' is `namespace', then we have a
7352 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
7353 if (token2->keyword == RID_NAMESPACE)
7354 cp_parser_using_directive (parser);
7355 /* Otherwise, it's a using-declaration. */
7357 cp_parser_using_declaration (parser,
7358 /*access_declaration_p=*/false);
7360 /* If the next keyword is `__label__' we have a label declaration. */
7361 else if (token1->keyword == RID_LABEL)
7364 cp_parser_commit_to_tentative_parse (parser);
7365 cp_parser_label_declaration (parser);
7367 /* If the next token is `static_assert' we have a static assertion. */
7368 else if (token1->keyword == RID_STATIC_ASSERT)
7369 cp_parser_static_assert (parser, /*member_p=*/false);
7370 /* Anything else must be a simple-declaration. */
7372 cp_parser_simple_declaration (parser, !statement_p);
7375 /* Parse a simple-declaration.
7378 decl-specifier-seq [opt] init-declarator-list [opt] ;
7380 init-declarator-list:
7382 init-declarator-list , init-declarator
7384 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
7385 function-definition as a simple-declaration. */
7388 cp_parser_simple_declaration (cp_parser* parser,
7389 bool function_definition_allowed_p)
7391 cp_decl_specifier_seq decl_specifiers;
7392 int declares_class_or_enum;
7393 bool saw_declarator;
7395 /* Defer access checks until we know what is being declared; the
7396 checks for names appearing in the decl-specifier-seq should be
7397 done as if we were in the scope of the thing being declared. */
7398 push_deferring_access_checks (dk_deferred);
7400 /* Parse the decl-specifier-seq. We have to keep track of whether
7401 or not the decl-specifier-seq declares a named class or
7402 enumeration type, since that is the only case in which the
7403 init-declarator-list is allowed to be empty.
7407 In a simple-declaration, the optional init-declarator-list can be
7408 omitted only when declaring a class or enumeration, that is when
7409 the decl-specifier-seq contains either a class-specifier, an
7410 elaborated-type-specifier, or an enum-specifier. */
7411 cp_parser_decl_specifier_seq (parser,
7412 CP_PARSER_FLAGS_OPTIONAL,
7414 &declares_class_or_enum);
7415 /* We no longer need to defer access checks. */
7416 stop_deferring_access_checks ();
7418 /* In a block scope, a valid declaration must always have a
7419 decl-specifier-seq. By not trying to parse declarators, we can
7420 resolve the declaration/expression ambiguity more quickly. */
7421 if (!function_definition_allowed_p
7422 && !decl_specifiers.any_specifiers_p)
7424 cp_parser_error (parser, "expected declaration");
7428 /* If the next two tokens are both identifiers, the code is
7429 erroneous. The usual cause of this situation is code like:
7433 where "T" should name a type -- but does not. */
7434 if (!decl_specifiers.type
7435 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
7437 /* If parsing tentatively, we should commit; we really are
7438 looking at a declaration. */
7439 cp_parser_commit_to_tentative_parse (parser);
7444 /* If we have seen at least one decl-specifier, and the next token
7445 is not a parenthesis, then we must be looking at a declaration.
7446 (After "int (" we might be looking at a functional cast.) */
7447 if (decl_specifiers.any_specifiers_p
7448 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
7449 cp_parser_commit_to_tentative_parse (parser);
7451 /* Keep going until we hit the `;' at the end of the simple
7453 saw_declarator = false;
7454 while (cp_lexer_next_token_is_not (parser->lexer,
7458 bool function_definition_p;
7463 /* If we are processing next declarator, coma is expected */
7464 token = cp_lexer_peek_token (parser->lexer);
7465 gcc_assert (token->type == CPP_COMMA);
7466 cp_lexer_consume_token (parser->lexer);
7469 saw_declarator = true;
7471 /* Parse the init-declarator. */
7472 decl = cp_parser_init_declarator (parser, &decl_specifiers,
7474 function_definition_allowed_p,
7476 declares_class_or_enum,
7477 &function_definition_p);
7478 /* If an error occurred while parsing tentatively, exit quickly.
7479 (That usually happens when in the body of a function; each
7480 statement is treated as a declaration-statement until proven
7482 if (cp_parser_error_occurred (parser))
7484 /* Handle function definitions specially. */
7485 if (function_definition_p)
7487 /* If the next token is a `,', then we are probably
7488 processing something like:
7492 which is erroneous. */
7493 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
7494 error ("mixing declarations and function-definitions is forbidden");
7495 /* Otherwise, we're done with the list of declarators. */
7498 pop_deferring_access_checks ();
7502 /* The next token should be either a `,' or a `;'. */
7503 token = cp_lexer_peek_token (parser->lexer);
7504 /* If it's a `,', there are more declarators to come. */
7505 if (token->type == CPP_COMMA)
7506 /* will be consumed next time around */;
7507 /* If it's a `;', we are done. */
7508 else if (token->type == CPP_SEMICOLON)
7510 /* Anything else is an error. */
7513 /* If we have already issued an error message we don't need
7514 to issue another one. */
7515 if (decl != error_mark_node
7516 || cp_parser_uncommitted_to_tentative_parse_p (parser))
7517 cp_parser_error (parser, "expected %<,%> or %<;%>");
7518 /* Skip tokens until we reach the end of the statement. */
7519 cp_parser_skip_to_end_of_statement (parser);
7520 /* If the next token is now a `;', consume it. */
7521 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7522 cp_lexer_consume_token (parser->lexer);
7525 /* After the first time around, a function-definition is not
7526 allowed -- even if it was OK at first. For example:
7531 function_definition_allowed_p = false;
7534 /* Issue an error message if no declarators are present, and the
7535 decl-specifier-seq does not itself declare a class or
7537 if (!saw_declarator)
7539 if (cp_parser_declares_only_class_p (parser))
7540 shadow_tag (&decl_specifiers);
7541 /* Perform any deferred access checks. */
7542 perform_deferred_access_checks ();
7545 /* Consume the `;'. */
7546 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
7549 pop_deferring_access_checks ();
7552 /* Parse a decl-specifier-seq.
7555 decl-specifier-seq [opt] decl-specifier
7558 storage-class-specifier
7569 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7571 The parser flags FLAGS is used to control type-specifier parsing.
7573 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7576 1: one of the decl-specifiers is an elaborated-type-specifier
7577 (i.e., a type declaration)
7578 2: one of the decl-specifiers is an enum-specifier or a
7579 class-specifier (i.e., a type definition)
7584 cp_parser_decl_specifier_seq (cp_parser* parser,
7585 cp_parser_flags flags,
7586 cp_decl_specifier_seq *decl_specs,
7587 int* declares_class_or_enum)
7589 bool constructor_possible_p = !parser->in_declarator_p;
7591 /* Clear DECL_SPECS. */
7592 clear_decl_specs (decl_specs);
7594 /* Assume no class or enumeration type is declared. */
7595 *declares_class_or_enum = 0;
7597 /* Keep reading specifiers until there are no more to read. */
7601 bool found_decl_spec;
7604 /* Peek at the next token. */
7605 token = cp_lexer_peek_token (parser->lexer);
7606 /* Handle attributes. */
7607 if (token->keyword == RID_ATTRIBUTE)
7609 /* Parse the attributes. */
7610 decl_specs->attributes
7611 = chainon (decl_specs->attributes,
7612 cp_parser_attributes_opt (parser));
7615 /* Assume we will find a decl-specifier keyword. */
7616 found_decl_spec = true;
7617 /* If the next token is an appropriate keyword, we can simply
7618 add it to the list. */
7619 switch (token->keyword)
7624 if (!at_class_scope_p ())
7626 error ("%<friend%> used outside of class");
7627 cp_lexer_purge_token (parser->lexer);
7631 ++decl_specs->specs[(int) ds_friend];
7632 /* Consume the token. */
7633 cp_lexer_consume_token (parser->lexer);
7637 /* function-specifier:
7644 cp_parser_function_specifier_opt (parser, decl_specs);
7650 ++decl_specs->specs[(int) ds_typedef];
7651 /* Consume the token. */
7652 cp_lexer_consume_token (parser->lexer);
7653 /* A constructor declarator cannot appear in a typedef. */
7654 constructor_possible_p = false;
7655 /* The "typedef" keyword can only occur in a declaration; we
7656 may as well commit at this point. */
7657 cp_parser_commit_to_tentative_parse (parser);
7659 if (decl_specs->storage_class != sc_none)
7660 decl_specs->conflicting_specifiers_p = true;
7663 /* storage-class-specifier:
7677 /* Consume the token. */
7678 cp_lexer_consume_token (parser->lexer);
7679 cp_parser_set_storage_class (parser, decl_specs, token->keyword);
7682 /* Consume the token. */
7683 cp_lexer_consume_token (parser->lexer);
7684 ++decl_specs->specs[(int) ds_thread];
7688 /* We did not yet find a decl-specifier yet. */
7689 found_decl_spec = false;
7693 /* Constructors are a special case. The `S' in `S()' is not a
7694 decl-specifier; it is the beginning of the declarator. */
7697 && constructor_possible_p
7698 && (cp_parser_constructor_declarator_p
7699 (parser, decl_specs->specs[(int) ds_friend] != 0)));
7701 /* If we don't have a DECL_SPEC yet, then we must be looking at
7702 a type-specifier. */
7703 if (!found_decl_spec && !constructor_p)
7705 int decl_spec_declares_class_or_enum;
7706 bool is_cv_qualifier;
7710 = cp_parser_type_specifier (parser, flags,
7712 /*is_declaration=*/true,
7713 &decl_spec_declares_class_or_enum,
7716 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
7718 /* If this type-specifier referenced a user-defined type
7719 (a typedef, class-name, etc.), then we can't allow any
7720 more such type-specifiers henceforth.
7724 The longest sequence of decl-specifiers that could
7725 possibly be a type name is taken as the
7726 decl-specifier-seq of a declaration. The sequence shall
7727 be self-consistent as described below.
7731 As a general rule, at most one type-specifier is allowed
7732 in the complete decl-specifier-seq of a declaration. The
7733 only exceptions are the following:
7735 -- const or volatile can be combined with any other
7738 -- signed or unsigned can be combined with char, long,
7746 void g (const int Pc);
7748 Here, Pc is *not* part of the decl-specifier seq; it's
7749 the declarator. Therefore, once we see a type-specifier
7750 (other than a cv-qualifier), we forbid any additional
7751 user-defined types. We *do* still allow things like `int
7752 int' to be considered a decl-specifier-seq, and issue the
7753 error message later. */
7754 if (type_spec && !is_cv_qualifier)
7755 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
7756 /* A constructor declarator cannot follow a type-specifier. */
7759 constructor_possible_p = false;
7760 found_decl_spec = true;
7764 /* If we still do not have a DECL_SPEC, then there are no more
7766 if (!found_decl_spec)
7769 decl_specs->any_specifiers_p = true;
7770 /* After we see one decl-specifier, further decl-specifiers are
7772 flags |= CP_PARSER_FLAGS_OPTIONAL;
7775 cp_parser_check_decl_spec (decl_specs);
7777 /* Don't allow a friend specifier with a class definition. */
7778 if (decl_specs->specs[(int) ds_friend] != 0
7779 && (*declares_class_or_enum & 2))
7780 error ("class definition may not be declared a friend");
7783 /* Parse an (optional) storage-class-specifier.
7785 storage-class-specifier:
7794 storage-class-specifier:
7797 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7800 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7802 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7810 /* Consume the token. */
7811 return cp_lexer_consume_token (parser->lexer)->u.value;
7818 /* Parse an (optional) function-specifier.
7825 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7826 Updates DECL_SPECS, if it is non-NULL. */
7829 cp_parser_function_specifier_opt (cp_parser* parser,
7830 cp_decl_specifier_seq *decl_specs)
7832 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7836 ++decl_specs->specs[(int) ds_inline];
7840 /* 14.5.2.3 [temp.mem]
7842 A member function template shall not be virtual. */
7843 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
7844 error ("templates may not be %<virtual%>");
7845 else if (decl_specs)
7846 ++decl_specs->specs[(int) ds_virtual];
7851 ++decl_specs->specs[(int) ds_explicit];
7858 /* Consume the token. */
7859 return cp_lexer_consume_token (parser->lexer)->u.value;
7862 /* Parse a linkage-specification.
7864 linkage-specification:
7865 extern string-literal { declaration-seq [opt] }
7866 extern string-literal declaration */
7869 cp_parser_linkage_specification (cp_parser* parser)
7873 /* Look for the `extern' keyword. */
7874 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7876 /* Look for the string-literal. */
7877 linkage = cp_parser_string_literal (parser, false, false);
7879 /* Transform the literal into an identifier. If the literal is a
7880 wide-character string, or contains embedded NULs, then we can't
7881 handle it as the user wants. */
7882 if (strlen (TREE_STRING_POINTER (linkage))
7883 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
7885 cp_parser_error (parser, "invalid linkage-specification");
7886 /* Assume C++ linkage. */
7887 linkage = lang_name_cplusplus;
7890 linkage = get_identifier (TREE_STRING_POINTER (linkage));
7892 /* We're now using the new linkage. */
7893 push_lang_context (linkage);
7895 /* If the next token is a `{', then we're using the first
7897 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7899 /* Consume the `{' token. */
7900 cp_lexer_consume_token (parser->lexer);
7901 /* Parse the declarations. */
7902 cp_parser_declaration_seq_opt (parser);
7903 /* Look for the closing `}'. */
7904 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7906 /* Otherwise, there's just one declaration. */
7909 bool saved_in_unbraced_linkage_specification_p;
7911 saved_in_unbraced_linkage_specification_p
7912 = parser->in_unbraced_linkage_specification_p;
7913 parser->in_unbraced_linkage_specification_p = true;
7914 cp_parser_declaration (parser);
7915 parser->in_unbraced_linkage_specification_p
7916 = saved_in_unbraced_linkage_specification_p;
7919 /* We're done with the linkage-specification. */
7920 pop_lang_context ();
7923 /* Parse a static_assert-declaration.
7925 static_assert-declaration:
7926 static_assert ( constant-expression , string-literal ) ;
7928 If MEMBER_P, this static_assert is a class member. */
7931 cp_parser_static_assert(cp_parser *parser, bool member_p)
7936 location_t saved_loc;
7938 /* Peek at the `static_assert' token so we can keep track of exactly
7939 where the static assertion started. */
7940 token = cp_lexer_peek_token (parser->lexer);
7941 saved_loc = token->location;
7943 /* Look for the `static_assert' keyword. */
7944 if (!cp_parser_require_keyword (parser, RID_STATIC_ASSERT,
7948 /* We know we are in a static assertion; commit to any tentative
7950 if (cp_parser_parsing_tentatively (parser))
7951 cp_parser_commit_to_tentative_parse (parser);
7953 /* Parse the `(' starting the static assertion condition. */
7954 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
7956 /* Parse the constant-expression. */
7958 cp_parser_constant_expression (parser,
7959 /*allow_non_constant_p=*/false,
7960 /*non_constant_p=*/NULL);
7962 /* Parse the separating `,'. */
7963 cp_parser_require (parser, CPP_COMMA, "`,'");
7965 /* Parse the string-literal message. */
7966 message = cp_parser_string_literal (parser,
7967 /*translate=*/false,
7970 /* A `)' completes the static assertion. */
7971 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
7972 cp_parser_skip_to_closing_parenthesis (parser,
7973 /*recovering=*/true,
7975 /*consume_paren=*/true);
7977 /* A semicolon terminates the declaration. */
7978 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
7980 /* Complete the static assertion, which may mean either processing
7981 the static assert now or saving it for template instantiation. */
7982 finish_static_assert (condition, message, saved_loc, member_p);
7985 /* Special member functions [gram.special] */
7987 /* Parse a conversion-function-id.
7989 conversion-function-id:
7990 operator conversion-type-id
7992 Returns an IDENTIFIER_NODE representing the operator. */
7995 cp_parser_conversion_function_id (cp_parser* parser)
7999 tree saved_qualifying_scope;
8000 tree saved_object_scope;
8001 tree pushed_scope = NULL_TREE;
8003 /* Look for the `operator' token. */
8004 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
8005 return error_mark_node;
8006 /* When we parse the conversion-type-id, the current scope will be
8007 reset. However, we need that information in able to look up the
8008 conversion function later, so we save it here. */
8009 saved_scope = parser->scope;
8010 saved_qualifying_scope = parser->qualifying_scope;
8011 saved_object_scope = parser->object_scope;
8012 /* We must enter the scope of the class so that the names of
8013 entities declared within the class are available in the
8014 conversion-type-id. For example, consider:
8021 S::operator I() { ... }
8023 In order to see that `I' is a type-name in the definition, we
8024 must be in the scope of `S'. */
8026 pushed_scope = push_scope (saved_scope);
8027 /* Parse the conversion-type-id. */
8028 type = cp_parser_conversion_type_id (parser);
8029 /* Leave the scope of the class, if any. */
8031 pop_scope (pushed_scope);
8032 /* Restore the saved scope. */
8033 parser->scope = saved_scope;
8034 parser->qualifying_scope = saved_qualifying_scope;
8035 parser->object_scope = saved_object_scope;
8036 /* If the TYPE is invalid, indicate failure. */
8037 if (type == error_mark_node)
8038 return error_mark_node;
8039 return mangle_conv_op_name_for_type (type);
8042 /* Parse a conversion-type-id:
8045 type-specifier-seq conversion-declarator [opt]
8047 Returns the TYPE specified. */
8050 cp_parser_conversion_type_id (cp_parser* parser)
8053 cp_decl_specifier_seq type_specifiers;
8054 cp_declarator *declarator;
8055 tree type_specified;
8057 /* Parse the attributes. */
8058 attributes = cp_parser_attributes_opt (parser);
8059 /* Parse the type-specifiers. */
8060 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
8062 /* If that didn't work, stop. */
8063 if (type_specifiers.type == error_mark_node)
8064 return error_mark_node;
8065 /* Parse the conversion-declarator. */
8066 declarator = cp_parser_conversion_declarator_opt (parser);
8068 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
8069 /*initialized=*/0, &attributes);
8071 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
8072 return type_specified;
8075 /* Parse an (optional) conversion-declarator.
8077 conversion-declarator:
8078 ptr-operator conversion-declarator [opt]
8082 static cp_declarator *
8083 cp_parser_conversion_declarator_opt (cp_parser* parser)
8085 enum tree_code code;
8087 cp_cv_quals cv_quals;
8089 /* We don't know if there's a ptr-operator next, or not. */
8090 cp_parser_parse_tentatively (parser);
8091 /* Try the ptr-operator. */
8092 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
8093 /* If it worked, look for more conversion-declarators. */
8094 if (cp_parser_parse_definitely (parser))
8096 cp_declarator *declarator;
8098 /* Parse another optional declarator. */
8099 declarator = cp_parser_conversion_declarator_opt (parser);
8101 /* Create the representation of the declarator. */
8103 declarator = make_ptrmem_declarator (cv_quals, class_type,
8105 else if (code == INDIRECT_REF)
8106 declarator = make_pointer_declarator (cv_quals, declarator);
8108 declarator = make_reference_declarator (cv_quals, declarator);
8116 /* Parse an (optional) ctor-initializer.
8119 : mem-initializer-list
8121 Returns TRUE iff the ctor-initializer was actually present. */
8124 cp_parser_ctor_initializer_opt (cp_parser* parser)
8126 /* If the next token is not a `:', then there is no
8127 ctor-initializer. */
8128 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
8130 /* Do default initialization of any bases and members. */
8131 if (DECL_CONSTRUCTOR_P (current_function_decl))
8132 finish_mem_initializers (NULL_TREE);
8137 /* Consume the `:' token. */
8138 cp_lexer_consume_token (parser->lexer);
8139 /* And the mem-initializer-list. */
8140 cp_parser_mem_initializer_list (parser);
8145 /* Parse a mem-initializer-list.
8147 mem-initializer-list:
8149 mem-initializer , mem-initializer-list */
8152 cp_parser_mem_initializer_list (cp_parser* parser)
8154 tree mem_initializer_list = NULL_TREE;
8156 /* Let the semantic analysis code know that we are starting the
8157 mem-initializer-list. */
8158 if (!DECL_CONSTRUCTOR_P (current_function_decl))
8159 error ("only constructors take base initializers");
8161 /* Loop through the list. */
8164 tree mem_initializer;
8166 /* Parse the mem-initializer. */
8167 mem_initializer = cp_parser_mem_initializer (parser);
8168 /* Add it to the list, unless it was erroneous. */
8169 if (mem_initializer != error_mark_node)
8171 TREE_CHAIN (mem_initializer) = mem_initializer_list;
8172 mem_initializer_list = mem_initializer;
8174 /* If the next token is not a `,', we're done. */
8175 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8177 /* Consume the `,' token. */
8178 cp_lexer_consume_token (parser->lexer);
8181 /* Perform semantic analysis. */
8182 if (DECL_CONSTRUCTOR_P (current_function_decl))
8183 finish_mem_initializers (mem_initializer_list);
8186 /* Parse a mem-initializer.
8189 mem-initializer-id ( expression-list [opt] )
8194 ( expression-list [opt] )
8196 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
8197 class) or FIELD_DECL (for a non-static data member) to initialize;
8198 the TREE_VALUE is the expression-list. An empty initialization
8199 list is represented by void_list_node. */
8202 cp_parser_mem_initializer (cp_parser* parser)
8204 tree mem_initializer_id;
8205 tree expression_list;
8208 /* Find out what is being initialized. */
8209 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
8211 pedwarn ("anachronistic old-style base class initializer");
8212 mem_initializer_id = NULL_TREE;
8215 mem_initializer_id = cp_parser_mem_initializer_id (parser);
8216 member = expand_member_init (mem_initializer_id);
8217 if (member && !DECL_P (member))
8218 in_base_initializer = 1;
8221 = cp_parser_parenthesized_expression_list (parser, false,
8223 /*non_constant_p=*/NULL);
8224 if (expression_list == error_mark_node)
8225 return error_mark_node;
8226 if (!expression_list)
8227 expression_list = void_type_node;
8229 in_base_initializer = 0;
8231 return member ? build_tree_list (member, expression_list) : error_mark_node;
8234 /* Parse a mem-initializer-id.
8237 :: [opt] nested-name-specifier [opt] class-name
8240 Returns a TYPE indicating the class to be initializer for the first
8241 production. Returns an IDENTIFIER_NODE indicating the data member
8242 to be initialized for the second production. */
8245 cp_parser_mem_initializer_id (cp_parser* parser)
8247 bool global_scope_p;
8248 bool nested_name_specifier_p;
8249 bool template_p = false;
8252 /* `typename' is not allowed in this context ([temp.res]). */
8253 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
8255 error ("keyword %<typename%> not allowed in this context (a qualified "
8256 "member initializer is implicitly a type)");
8257 cp_lexer_consume_token (parser->lexer);
8259 /* Look for the optional `::' operator. */
8261 = (cp_parser_global_scope_opt (parser,
8262 /*current_scope_valid_p=*/false)
8264 /* Look for the optional nested-name-specifier. The simplest way to
8269 The keyword `typename' is not permitted in a base-specifier or
8270 mem-initializer; in these contexts a qualified name that
8271 depends on a template-parameter is implicitly assumed to be a
8274 is to assume that we have seen the `typename' keyword at this
8276 nested_name_specifier_p
8277 = (cp_parser_nested_name_specifier_opt (parser,
8278 /*typename_keyword_p=*/true,
8279 /*check_dependency_p=*/true,
8281 /*is_declaration=*/true)
8283 if (nested_name_specifier_p)
8284 template_p = cp_parser_optional_template_keyword (parser);
8285 /* If there is a `::' operator or a nested-name-specifier, then we
8286 are definitely looking for a class-name. */
8287 if (global_scope_p || nested_name_specifier_p)
8288 return cp_parser_class_name (parser,
8289 /*typename_keyword_p=*/true,
8290 /*template_keyword_p=*/template_p,
8292 /*check_dependency_p=*/true,
8293 /*class_head_p=*/false,
8294 /*is_declaration=*/true);
8295 /* Otherwise, we could also be looking for an ordinary identifier. */
8296 cp_parser_parse_tentatively (parser);
8297 /* Try a class-name. */
8298 id = cp_parser_class_name (parser,
8299 /*typename_keyword_p=*/true,
8300 /*template_keyword_p=*/false,
8302 /*check_dependency_p=*/true,
8303 /*class_head_p=*/false,
8304 /*is_declaration=*/true);
8305 /* If we found one, we're done. */
8306 if (cp_parser_parse_definitely (parser))
8308 /* Otherwise, look for an ordinary identifier. */
8309 return cp_parser_identifier (parser);
8312 /* Overloading [gram.over] */
8314 /* Parse an operator-function-id.
8316 operator-function-id:
8319 Returns an IDENTIFIER_NODE for the operator which is a
8320 human-readable spelling of the identifier, e.g., `operator +'. */
8323 cp_parser_operator_function_id (cp_parser* parser)
8325 /* Look for the `operator' keyword. */
8326 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
8327 return error_mark_node;
8328 /* And then the name of the operator itself. */
8329 return cp_parser_operator (parser);
8332 /* Parse an operator.
8335 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
8336 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
8337 || ++ -- , ->* -> () []
8344 Returns an IDENTIFIER_NODE for the operator which is a
8345 human-readable spelling of the identifier, e.g., `operator +'. */
8348 cp_parser_operator (cp_parser* parser)
8350 tree id = NULL_TREE;
8353 /* Peek at the next token. */
8354 token = cp_lexer_peek_token (parser->lexer);
8355 /* Figure out which operator we have. */
8356 switch (token->type)
8362 /* The keyword should be either `new' or `delete'. */
8363 if (token->keyword == RID_NEW)
8365 else if (token->keyword == RID_DELETE)
8370 /* Consume the `new' or `delete' token. */
8371 cp_lexer_consume_token (parser->lexer);
8373 /* Peek at the next token. */
8374 token = cp_lexer_peek_token (parser->lexer);
8375 /* If it's a `[' token then this is the array variant of the
8377 if (token->type == CPP_OPEN_SQUARE)
8379 /* Consume the `[' token. */
8380 cp_lexer_consume_token (parser->lexer);
8381 /* Look for the `]' token. */
8382 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8383 id = ansi_opname (op == NEW_EXPR
8384 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
8386 /* Otherwise, we have the non-array variant. */
8388 id = ansi_opname (op);
8394 id = ansi_opname (PLUS_EXPR);
8398 id = ansi_opname (MINUS_EXPR);
8402 id = ansi_opname (MULT_EXPR);
8406 id = ansi_opname (TRUNC_DIV_EXPR);
8410 id = ansi_opname (TRUNC_MOD_EXPR);
8414 id = ansi_opname (BIT_XOR_EXPR);
8418 id = ansi_opname (BIT_AND_EXPR);
8422 id = ansi_opname (BIT_IOR_EXPR);
8426 id = ansi_opname (BIT_NOT_EXPR);
8430 id = ansi_opname (TRUTH_NOT_EXPR);
8434 id = ansi_assopname (NOP_EXPR);
8438 id = ansi_opname (LT_EXPR);
8442 id = ansi_opname (GT_EXPR);
8446 id = ansi_assopname (PLUS_EXPR);
8450 id = ansi_assopname (MINUS_EXPR);
8454 id = ansi_assopname (MULT_EXPR);
8458 id = ansi_assopname (TRUNC_DIV_EXPR);
8462 id = ansi_assopname (TRUNC_MOD_EXPR);
8466 id = ansi_assopname (BIT_XOR_EXPR);
8470 id = ansi_assopname (BIT_AND_EXPR);
8474 id = ansi_assopname (BIT_IOR_EXPR);
8478 id = ansi_opname (LSHIFT_EXPR);
8482 id = ansi_opname (RSHIFT_EXPR);
8486 id = ansi_assopname (LSHIFT_EXPR);
8490 id = ansi_assopname (RSHIFT_EXPR);
8494 id = ansi_opname (EQ_EXPR);
8498 id = ansi_opname (NE_EXPR);
8502 id = ansi_opname (LE_EXPR);
8505 case CPP_GREATER_EQ:
8506 id = ansi_opname (GE_EXPR);
8510 id = ansi_opname (TRUTH_ANDIF_EXPR);
8514 id = ansi_opname (TRUTH_ORIF_EXPR);
8518 id = ansi_opname (POSTINCREMENT_EXPR);
8521 case CPP_MINUS_MINUS:
8522 id = ansi_opname (PREDECREMENT_EXPR);
8526 id = ansi_opname (COMPOUND_EXPR);
8529 case CPP_DEREF_STAR:
8530 id = ansi_opname (MEMBER_REF);
8534 id = ansi_opname (COMPONENT_REF);
8537 case CPP_OPEN_PAREN:
8538 /* Consume the `('. */
8539 cp_lexer_consume_token (parser->lexer);
8540 /* Look for the matching `)'. */
8541 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
8542 return ansi_opname (CALL_EXPR);
8544 case CPP_OPEN_SQUARE:
8545 /* Consume the `['. */
8546 cp_lexer_consume_token (parser->lexer);
8547 /* Look for the matching `]'. */
8548 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8549 return ansi_opname (ARRAY_REF);
8552 /* Anything else is an error. */
8556 /* If we have selected an identifier, we need to consume the
8559 cp_lexer_consume_token (parser->lexer);
8560 /* Otherwise, no valid operator name was present. */
8563 cp_parser_error (parser, "expected operator");
8564 id = error_mark_node;
8570 /* Parse a template-declaration.
8572 template-declaration:
8573 export [opt] template < template-parameter-list > declaration
8575 If MEMBER_P is TRUE, this template-declaration occurs within a
8578 The grammar rule given by the standard isn't correct. What
8581 template-declaration:
8582 export [opt] template-parameter-list-seq
8583 decl-specifier-seq [opt] init-declarator [opt] ;
8584 export [opt] template-parameter-list-seq
8587 template-parameter-list-seq:
8588 template-parameter-list-seq [opt]
8589 template < template-parameter-list > */
8592 cp_parser_template_declaration (cp_parser* parser, bool member_p)
8594 /* Check for `export'. */
8595 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
8597 /* Consume the `export' token. */
8598 cp_lexer_consume_token (parser->lexer);
8599 /* Warn that we do not support `export'. */
8600 warning (0, "keyword %<export%> not implemented, and will be ignored");
8603 cp_parser_template_declaration_after_export (parser, member_p);
8606 /* Parse a template-parameter-list.
8608 template-parameter-list:
8610 template-parameter-list , template-parameter
8612 Returns a TREE_LIST. Each node represents a template parameter.
8613 The nodes are connected via their TREE_CHAINs. */
8616 cp_parser_template_parameter_list (cp_parser* parser)
8618 tree parameter_list = NULL_TREE;
8620 begin_template_parm_list ();
8627 /* Parse the template-parameter. */
8628 parameter = cp_parser_template_parameter (parser, &is_non_type);
8629 /* Add it to the list. */
8630 if (parameter != error_mark_node)
8631 parameter_list = process_template_parm (parameter_list,
8636 tree err_parm = build_tree_list (parameter, parameter);
8637 TREE_VALUE (err_parm) = error_mark_node;
8638 parameter_list = chainon (parameter_list, err_parm);
8641 /* Peek at the next token. */
8642 token = cp_lexer_peek_token (parser->lexer);
8643 /* If it's not a `,', we're done. */
8644 if (token->type != CPP_COMMA)
8646 /* Otherwise, consume the `,' token. */
8647 cp_lexer_consume_token (parser->lexer);
8650 return end_template_parm_list (parameter_list);
8653 /* Parse a template-parameter.
8657 parameter-declaration
8659 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
8660 the parameter. The TREE_PURPOSE is the default value, if any.
8661 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
8662 iff this parameter is a non-type parameter. */
8665 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type)
8668 cp_parameter_declarator *parameter_declarator;
8671 /* Assume it is a type parameter or a template parameter. */
8672 *is_non_type = false;
8673 /* Peek at the next token. */
8674 token = cp_lexer_peek_token (parser->lexer);
8675 /* If it is `class' or `template', we have a type-parameter. */
8676 if (token->keyword == RID_TEMPLATE)
8677 return cp_parser_type_parameter (parser);
8678 /* If it is `class' or `typename' we do not know yet whether it is a
8679 type parameter or a non-type parameter. Consider:
8681 template <typename T, typename T::X X> ...
8685 template <class C, class D*> ...
8687 Here, the first parameter is a type parameter, and the second is
8688 a non-type parameter. We can tell by looking at the token after
8689 the identifier -- if it is a `,', `=', or `>' then we have a type
8691 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
8693 /* Peek at the token after `class' or `typename'. */
8694 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8695 /* If it's an identifier, skip it. */
8696 if (token->type == CPP_NAME)
8697 token = cp_lexer_peek_nth_token (parser->lexer, 3);
8698 /* Now, see if the token looks like the end of a template
8700 if (token->type == CPP_COMMA
8701 || token->type == CPP_EQ
8702 || token->type == CPP_GREATER)
8703 return cp_parser_type_parameter (parser);
8706 /* Otherwise, it is a non-type parameter.
8710 When parsing a default template-argument for a non-type
8711 template-parameter, the first non-nested `>' is taken as the end
8712 of the template parameter-list rather than a greater-than
8714 *is_non_type = true;
8715 parameter_declarator
8716 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
8717 /*parenthesized_p=*/NULL);
8718 parm = grokdeclarator (parameter_declarator->declarator,
8719 ¶meter_declarator->decl_specifiers,
8720 PARM, /*initialized=*/0,
8722 if (parm == error_mark_node)
8723 return error_mark_node;
8724 return build_tree_list (parameter_declarator->default_argument, parm);
8727 /* Parse a type-parameter.
8730 class identifier [opt]
8731 class identifier [opt] = type-id
8732 typename identifier [opt]
8733 typename identifier [opt] = type-id
8734 template < template-parameter-list > class identifier [opt]
8735 template < template-parameter-list > class identifier [opt]
8738 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8739 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8740 the declaration of the parameter. */
8743 cp_parser_type_parameter (cp_parser* parser)
8748 /* Look for a keyword to tell us what kind of parameter this is. */
8749 token = cp_parser_require (parser, CPP_KEYWORD,
8750 "`class', `typename', or `template'");
8752 return error_mark_node;
8754 switch (token->keyword)
8760 tree default_argument;
8762 /* If the next token is an identifier, then it names the
8764 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8765 identifier = cp_parser_identifier (parser);
8767 identifier = NULL_TREE;
8769 /* Create the parameter. */
8770 parameter = finish_template_type_parm (class_type_node, identifier);
8772 /* If the next token is an `=', we have a default argument. */
8773 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8775 /* Consume the `=' token. */
8776 cp_lexer_consume_token (parser->lexer);
8777 /* Parse the default-argument. */
8778 push_deferring_access_checks (dk_no_deferred);
8779 default_argument = cp_parser_type_id (parser);
8780 pop_deferring_access_checks ();
8783 default_argument = NULL_TREE;
8785 /* Create the combined representation of the parameter and the
8786 default argument. */
8787 parameter = build_tree_list (default_argument, parameter);
8793 tree parameter_list;
8795 tree default_argument;
8797 /* Look for the `<'. */
8798 cp_parser_require (parser, CPP_LESS, "`<'");
8799 /* Parse the template-parameter-list. */
8800 parameter_list = cp_parser_template_parameter_list (parser);
8801 /* Look for the `>'. */
8802 cp_parser_require (parser, CPP_GREATER, "`>'");
8803 /* Look for the `class' keyword. */
8804 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
8805 /* If the next token is an `=', then there is a
8806 default-argument. If the next token is a `>', we are at
8807 the end of the parameter-list. If the next token is a `,',
8808 then we are at the end of this parameter. */
8809 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8810 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
8811 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8813 identifier = cp_parser_identifier (parser);
8814 /* Treat invalid names as if the parameter were nameless. */
8815 if (identifier == error_mark_node)
8816 identifier = NULL_TREE;
8819 identifier = NULL_TREE;
8821 /* Create the template parameter. */
8822 parameter = finish_template_template_parm (class_type_node,
8825 /* If the next token is an `=', then there is a
8826 default-argument. */
8827 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8831 /* Consume the `='. */
8832 cp_lexer_consume_token (parser->lexer);
8833 /* Parse the id-expression. */
8834 push_deferring_access_checks (dk_no_deferred);
8836 = cp_parser_id_expression (parser,
8837 /*template_keyword_p=*/false,
8838 /*check_dependency_p=*/true,
8839 /*template_p=*/&is_template,
8840 /*declarator_p=*/false,
8841 /*optional_p=*/false);
8842 if (TREE_CODE (default_argument) == TYPE_DECL)
8843 /* If the id-expression was a template-id that refers to
8844 a template-class, we already have the declaration here,
8845 so no further lookup is needed. */
8848 /* Look up the name. */
8850 = cp_parser_lookup_name (parser, default_argument,
8852 /*is_template=*/is_template,
8853 /*is_namespace=*/false,
8854 /*check_dependency=*/true,
8855 /*ambiguous_decls=*/NULL);
8856 /* See if the default argument is valid. */
8858 = check_template_template_default_arg (default_argument);
8859 pop_deferring_access_checks ();
8862 default_argument = NULL_TREE;
8864 /* Create the combined representation of the parameter and the
8865 default argument. */
8866 parameter = build_tree_list (default_argument, parameter);
8878 /* Parse a template-id.
8881 template-name < template-argument-list [opt] >
8883 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8884 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8885 returned. Otherwise, if the template-name names a function, or set
8886 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8887 names a class, returns a TYPE_DECL for the specialization.
8889 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8890 uninstantiated templates. */
8893 cp_parser_template_id (cp_parser *parser,
8894 bool template_keyword_p,
8895 bool check_dependency_p,
8896 bool is_declaration)
8902 cp_token_position start_of_id = 0;
8903 deferred_access_check *chk;
8904 VEC (deferred_access_check,gc) *access_check;
8905 cp_token *next_token, *next_token_2;
8908 /* If the next token corresponds to a template-id, there is no need
8910 next_token = cp_lexer_peek_token (parser->lexer);
8911 if (next_token->type == CPP_TEMPLATE_ID)
8913 struct tree_check *check_value;
8915 /* Get the stored value. */
8916 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
8917 /* Perform any access checks that were deferred. */
8918 access_check = check_value->checks;
8922 VEC_iterate (deferred_access_check, access_check, i, chk) ;
8925 perform_or_defer_access_check (chk->binfo,
8930 /* Return the stored value. */
8931 return check_value->value;
8934 /* Avoid performing name lookup if there is no possibility of
8935 finding a template-id. */
8936 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8937 || (next_token->type == CPP_NAME
8938 && !cp_parser_nth_token_starts_template_argument_list_p
8941 cp_parser_error (parser, "expected template-id");
8942 return error_mark_node;
8945 /* Remember where the template-id starts. */
8946 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
8947 start_of_id = cp_lexer_token_position (parser->lexer, false);
8949 push_deferring_access_checks (dk_deferred);
8951 /* Parse the template-name. */
8952 is_identifier = false;
8953 template = cp_parser_template_name (parser, template_keyword_p,
8957 if (template == error_mark_node || is_identifier)
8959 pop_deferring_access_checks ();
8963 /* If we find the sequence `[:' after a template-name, it's probably
8964 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8965 parse correctly the argument list. */
8966 next_token = cp_lexer_peek_token (parser->lexer);
8967 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8968 if (next_token->type == CPP_OPEN_SQUARE
8969 && next_token->flags & DIGRAPH
8970 && next_token_2->type == CPP_COLON
8971 && !(next_token_2->flags & PREV_WHITE))
8973 cp_parser_parse_tentatively (parser);
8974 /* Change `:' into `::'. */
8975 next_token_2->type = CPP_SCOPE;
8976 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8978 cp_lexer_consume_token (parser->lexer);
8979 /* Parse the arguments. */
8980 arguments = cp_parser_enclosed_template_argument_list (parser);
8981 if (!cp_parser_parse_definitely (parser))
8983 /* If we couldn't parse an argument list, then we revert our changes
8984 and return simply an error. Maybe this is not a template-id
8986 next_token_2->type = CPP_COLON;
8987 cp_parser_error (parser, "expected %<<%>");
8988 pop_deferring_access_checks ();
8989 return error_mark_node;
8991 /* Otherwise, emit an error about the invalid digraph, but continue
8992 parsing because we got our argument list. */
8993 pedwarn ("%<<::%> cannot begin a template-argument list");
8994 inform ("%<<:%> is an alternate spelling for %<[%>. Insert whitespace "
8995 "between %<<%> and %<::%>");
8996 if (!flag_permissive)
9001 inform ("(if you use -fpermissive G++ will accept your code)");
9008 /* Look for the `<' that starts the template-argument-list. */
9009 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
9011 pop_deferring_access_checks ();
9012 return error_mark_node;
9014 /* Parse the arguments. */
9015 arguments = cp_parser_enclosed_template_argument_list (parser);
9018 /* Build a representation of the specialization. */
9019 if (TREE_CODE (template) == IDENTIFIER_NODE)
9020 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
9021 else if (DECL_CLASS_TEMPLATE_P (template)
9022 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
9024 bool entering_scope;
9025 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
9026 template (rather than some instantiation thereof) only if
9027 is not nested within some other construct. For example, in
9028 "template <typename T> void f(T) { A<T>::", A<T> is just an
9029 instantiation of A. */
9030 entering_scope = (template_parm_scope_p ()
9031 && cp_lexer_next_token_is (parser->lexer,
9034 = finish_template_type (template, arguments, entering_scope);
9038 /* If it's not a class-template or a template-template, it should be
9039 a function-template. */
9040 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (template)
9041 || TREE_CODE (template) == OVERLOAD
9042 || BASELINK_P (template)));
9044 template_id = lookup_template_function (template, arguments);
9047 /* If parsing tentatively, replace the sequence of tokens that makes
9048 up the template-id with a CPP_TEMPLATE_ID token. That way,
9049 should we re-parse the token stream, we will not have to repeat
9050 the effort required to do the parse, nor will we issue duplicate
9051 error messages about problems during instantiation of the
9055 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
9057 /* Reset the contents of the START_OF_ID token. */
9058 token->type = CPP_TEMPLATE_ID;
9059 /* Retrieve any deferred checks. Do not pop this access checks yet
9060 so the memory will not be reclaimed during token replacing below. */
9061 token->u.tree_check_value = GGC_CNEW (struct tree_check);
9062 token->u.tree_check_value->value = template_id;
9063 token->u.tree_check_value->checks = get_deferred_access_checks ();
9064 token->keyword = RID_MAX;
9066 /* Purge all subsequent tokens. */
9067 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
9069 /* ??? Can we actually assume that, if template_id ==
9070 error_mark_node, we will have issued a diagnostic to the
9071 user, as opposed to simply marking the tentative parse as
9073 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
9074 error ("parse error in template argument list");
9077 pop_deferring_access_checks ();
9081 /* Parse a template-name.
9086 The standard should actually say:
9090 operator-function-id
9092 A defect report has been filed about this issue.
9094 A conversion-function-id cannot be a template name because they cannot
9095 be part of a template-id. In fact, looking at this code:
9099 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
9100 It is impossible to call a templated conversion-function-id with an
9101 explicit argument list, since the only allowed template parameter is
9102 the type to which it is converting.
9104 If TEMPLATE_KEYWORD_P is true, then we have just seen the
9105 `template' keyword, in a construction like:
9109 In that case `f' is taken to be a template-name, even though there
9110 is no way of knowing for sure.
9112 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
9113 name refers to a set of overloaded functions, at least one of which
9114 is a template, or an IDENTIFIER_NODE with the name of the template,
9115 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
9116 names are looked up inside uninstantiated templates. */
9119 cp_parser_template_name (cp_parser* parser,
9120 bool template_keyword_p,
9121 bool check_dependency_p,
9122 bool is_declaration,
9123 bool *is_identifier)
9129 /* If the next token is `operator', then we have either an
9130 operator-function-id or a conversion-function-id. */
9131 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
9133 /* We don't know whether we're looking at an
9134 operator-function-id or a conversion-function-id. */
9135 cp_parser_parse_tentatively (parser);
9136 /* Try an operator-function-id. */
9137 identifier = cp_parser_operator_function_id (parser);
9138 /* If that didn't work, try a conversion-function-id. */
9139 if (!cp_parser_parse_definitely (parser))
9141 cp_parser_error (parser, "expected template-name");
9142 return error_mark_node;
9145 /* Look for the identifier. */
9147 identifier = cp_parser_identifier (parser);
9149 /* If we didn't find an identifier, we don't have a template-id. */
9150 if (identifier == error_mark_node)
9151 return error_mark_node;
9153 /* If the name immediately followed the `template' keyword, then it
9154 is a template-name. However, if the next token is not `<', then
9155 we do not treat it as a template-name, since it is not being used
9156 as part of a template-id. This enables us to handle constructs
9159 template <typename T> struct S { S(); };
9160 template <typename T> S<T>::S();
9162 correctly. We would treat `S' as a template -- if it were `S<T>'
9163 -- but we do not if there is no `<'. */
9165 if (processing_template_decl
9166 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
9168 /* In a declaration, in a dependent context, we pretend that the
9169 "template" keyword was present in order to improve error
9170 recovery. For example, given:
9172 template <typename T> void f(T::X<int>);
9174 we want to treat "X<int>" as a template-id. */
9176 && !template_keyword_p
9177 && parser->scope && TYPE_P (parser->scope)
9178 && check_dependency_p
9179 && dependent_type_p (parser->scope)
9180 /* Do not do this for dtors (or ctors), since they never
9181 need the template keyword before their name. */
9182 && !constructor_name_p (identifier, parser->scope))
9184 cp_token_position start = 0;
9186 /* Explain what went wrong. */
9187 error ("non-template %qD used as template", identifier);
9188 inform ("use %<%T::template %D%> to indicate that it is a template",
9189 parser->scope, identifier);
9190 /* If parsing tentatively, find the location of the "<" token. */
9191 if (cp_parser_simulate_error (parser))
9192 start = cp_lexer_token_position (parser->lexer, true);
9193 /* Parse the template arguments so that we can issue error
9194 messages about them. */
9195 cp_lexer_consume_token (parser->lexer);
9196 cp_parser_enclosed_template_argument_list (parser);
9197 /* Skip tokens until we find a good place from which to
9198 continue parsing. */
9199 cp_parser_skip_to_closing_parenthesis (parser,
9200 /*recovering=*/true,
9202 /*consume_paren=*/false);
9203 /* If parsing tentatively, permanently remove the
9204 template argument list. That will prevent duplicate
9205 error messages from being issued about the missing
9206 "template" keyword. */
9208 cp_lexer_purge_tokens_after (parser->lexer, start);
9210 *is_identifier = true;
9214 /* If the "template" keyword is present, then there is generally
9215 no point in doing name-lookup, so we just return IDENTIFIER.
9216 But, if the qualifying scope is non-dependent then we can
9217 (and must) do name-lookup normally. */
9218 if (template_keyword_p
9220 || (TYPE_P (parser->scope)
9221 && dependent_type_p (parser->scope))))
9225 /* Look up the name. */
9226 decl = cp_parser_lookup_name (parser, identifier,
9228 /*is_template=*/false,
9229 /*is_namespace=*/false,
9231 /*ambiguous_decls=*/NULL);
9232 decl = maybe_get_template_decl_from_type_decl (decl);
9234 /* If DECL is a template, then the name was a template-name. */
9235 if (TREE_CODE (decl) == TEMPLATE_DECL)
9239 tree fn = NULL_TREE;
9241 /* The standard does not explicitly indicate whether a name that
9242 names a set of overloaded declarations, some of which are
9243 templates, is a template-name. However, such a name should
9244 be a template-name; otherwise, there is no way to form a
9245 template-id for the overloaded templates. */
9246 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
9247 if (TREE_CODE (fns) == OVERLOAD)
9248 for (fn = fns; fn; fn = OVL_NEXT (fn))
9249 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
9254 /* The name does not name a template. */
9255 cp_parser_error (parser, "expected template-name");
9256 return error_mark_node;
9260 /* If DECL is dependent, and refers to a function, then just return
9261 its name; we will look it up again during template instantiation. */
9262 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
9264 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
9265 if (TYPE_P (scope) && dependent_type_p (scope))
9272 /* Parse a template-argument-list.
9274 template-argument-list:
9276 template-argument-list , template-argument
9278 Returns a TREE_VEC containing the arguments. */
9281 cp_parser_template_argument_list (cp_parser* parser)
9283 tree fixed_args[10];
9284 unsigned n_args = 0;
9285 unsigned alloced = 10;
9286 tree *arg_ary = fixed_args;
9288 bool saved_in_template_argument_list_p;
9290 bool saved_non_ice_p;
9292 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
9293 parser->in_template_argument_list_p = true;
9294 /* Even if the template-id appears in an integral
9295 constant-expression, the contents of the argument list do
9297 saved_ice_p = parser->integral_constant_expression_p;
9298 parser->integral_constant_expression_p = false;
9299 saved_non_ice_p = parser->non_integral_constant_expression_p;
9300 parser->non_integral_constant_expression_p = false;
9301 /* Parse the arguments. */
9307 /* Consume the comma. */
9308 cp_lexer_consume_token (parser->lexer);
9310 /* Parse the template-argument. */
9311 argument = cp_parser_template_argument (parser);
9312 if (n_args == alloced)
9316 if (arg_ary == fixed_args)
9318 arg_ary = XNEWVEC (tree, alloced);
9319 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
9322 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
9324 arg_ary[n_args++] = argument;
9326 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
9328 vec = make_tree_vec (n_args);
9331 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
9333 if (arg_ary != fixed_args)
9335 parser->non_integral_constant_expression_p = saved_non_ice_p;
9336 parser->integral_constant_expression_p = saved_ice_p;
9337 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
9341 /* Parse a template-argument.
9344 assignment-expression
9348 The representation is that of an assignment-expression, type-id, or
9349 id-expression -- except that the qualified id-expression is
9350 evaluated, so that the value returned is either a DECL or an
9353 Although the standard says "assignment-expression", it forbids
9354 throw-expressions or assignments in the template argument.
9355 Therefore, we use "conditional-expression" instead. */
9358 cp_parser_template_argument (cp_parser* parser)
9363 bool maybe_type_id = false;
9367 /* There's really no way to know what we're looking at, so we just
9368 try each alternative in order.
9372 In a template-argument, an ambiguity between a type-id and an
9373 expression is resolved to a type-id, regardless of the form of
9374 the corresponding template-parameter.
9376 Therefore, we try a type-id first. */
9377 cp_parser_parse_tentatively (parser);
9378 argument = cp_parser_type_id (parser);
9379 /* If there was no error parsing the type-id but the next token is a '>>',
9380 we probably found a typo for '> >'. But there are type-id which are
9381 also valid expressions. For instance:
9383 struct X { int operator >> (int); };
9384 template <int V> struct Foo {};
9387 Here 'X()' is a valid type-id of a function type, but the user just
9388 wanted to write the expression "X() >> 5". Thus, we remember that we
9389 found a valid type-id, but we still try to parse the argument as an
9390 expression to see what happens. */
9391 if (!cp_parser_error_occurred (parser)
9392 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
9394 maybe_type_id = true;
9395 cp_parser_abort_tentative_parse (parser);
9399 /* If the next token isn't a `,' or a `>', then this argument wasn't
9400 really finished. This means that the argument is not a valid
9402 if (!cp_parser_next_token_ends_template_argument_p (parser))
9403 cp_parser_error (parser, "expected template-argument");
9404 /* If that worked, we're done. */
9405 if (cp_parser_parse_definitely (parser))
9408 /* We're still not sure what the argument will be. */
9409 cp_parser_parse_tentatively (parser);
9410 /* Try a template. */
9411 argument = cp_parser_id_expression (parser,
9412 /*template_keyword_p=*/false,
9413 /*check_dependency_p=*/true,
9415 /*declarator_p=*/false,
9416 /*optional_p=*/false);
9417 /* If the next token isn't a `,' or a `>', then this argument wasn't
9419 if (!cp_parser_next_token_ends_template_argument_p (parser))
9420 cp_parser_error (parser, "expected template-argument");
9421 if (!cp_parser_error_occurred (parser))
9423 /* Figure out what is being referred to. If the id-expression
9424 was for a class template specialization, then we will have a
9425 TYPE_DECL at this point. There is no need to do name lookup
9426 at this point in that case. */
9427 if (TREE_CODE (argument) != TYPE_DECL)
9428 argument = cp_parser_lookup_name (parser, argument,
9430 /*is_template=*/template_p,
9431 /*is_namespace=*/false,
9432 /*check_dependency=*/true,
9433 /*ambiguous_decls=*/NULL);
9434 if (TREE_CODE (argument) != TEMPLATE_DECL
9435 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
9436 cp_parser_error (parser, "expected template-name");
9438 if (cp_parser_parse_definitely (parser))
9440 /* It must be a non-type argument. There permitted cases are given
9441 in [temp.arg.nontype]:
9443 -- an integral constant-expression of integral or enumeration
9446 -- the name of a non-type template-parameter; or
9448 -- the name of an object or function with external linkage...
9450 -- the address of an object or function with external linkage...
9452 -- a pointer to member... */
9453 /* Look for a non-type template parameter. */
9454 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9456 cp_parser_parse_tentatively (parser);
9457 argument = cp_parser_primary_expression (parser,
9460 /*template_arg_p=*/true,
9462 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
9463 || !cp_parser_next_token_ends_template_argument_p (parser))
9464 cp_parser_simulate_error (parser);
9465 if (cp_parser_parse_definitely (parser))
9469 /* If the next token is "&", the argument must be the address of an
9470 object or function with external linkage. */
9471 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
9473 cp_lexer_consume_token (parser->lexer);
9474 /* See if we might have an id-expression. */
9475 token = cp_lexer_peek_token (parser->lexer);
9476 if (token->type == CPP_NAME
9477 || token->keyword == RID_OPERATOR
9478 || token->type == CPP_SCOPE
9479 || token->type == CPP_TEMPLATE_ID
9480 || token->type == CPP_NESTED_NAME_SPECIFIER)
9482 cp_parser_parse_tentatively (parser);
9483 argument = cp_parser_primary_expression (parser,
9486 /*template_arg_p=*/true,
9488 if (cp_parser_error_occurred (parser)
9489 || !cp_parser_next_token_ends_template_argument_p (parser))
9490 cp_parser_abort_tentative_parse (parser);
9493 if (TREE_CODE (argument) == INDIRECT_REF)
9495 gcc_assert (REFERENCE_REF_P (argument));
9496 argument = TREE_OPERAND (argument, 0);
9499 if (TREE_CODE (argument) == VAR_DECL)
9501 /* A variable without external linkage might still be a
9502 valid constant-expression, so no error is issued here
9503 if the external-linkage check fails. */
9504 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (argument))
9505 cp_parser_simulate_error (parser);
9507 else if (is_overloaded_fn (argument))
9508 /* All overloaded functions are allowed; if the external
9509 linkage test does not pass, an error will be issued
9513 && (TREE_CODE (argument) == OFFSET_REF
9514 || TREE_CODE (argument) == SCOPE_REF))
9515 /* A pointer-to-member. */
9517 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
9520 cp_parser_simulate_error (parser);
9522 if (cp_parser_parse_definitely (parser))
9525 argument = build_x_unary_op (ADDR_EXPR, argument);
9530 /* If the argument started with "&", there are no other valid
9531 alternatives at this point. */
9534 cp_parser_error (parser, "invalid non-type template argument");
9535 return error_mark_node;
9538 /* If the argument wasn't successfully parsed as a type-id followed
9539 by '>>', the argument can only be a constant expression now.
9540 Otherwise, we try parsing the constant-expression tentatively,
9541 because the argument could really be a type-id. */
9543 cp_parser_parse_tentatively (parser);
9544 argument = cp_parser_constant_expression (parser,
9545 /*allow_non_constant_p=*/false,
9546 /*non_constant_p=*/NULL);
9547 argument = fold_non_dependent_expr (argument);
9550 if (!cp_parser_next_token_ends_template_argument_p (parser))
9551 cp_parser_error (parser, "expected template-argument");
9552 if (cp_parser_parse_definitely (parser))
9554 /* We did our best to parse the argument as a non type-id, but that
9555 was the only alternative that matched (albeit with a '>' after
9556 it). We can assume it's just a typo from the user, and a
9557 diagnostic will then be issued. */
9558 return cp_parser_type_id (parser);
9561 /* Parse an explicit-instantiation.
9563 explicit-instantiation:
9564 template declaration
9566 Although the standard says `declaration', what it really means is:
9568 explicit-instantiation:
9569 template decl-specifier-seq [opt] declarator [opt] ;
9571 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9572 supposed to be allowed. A defect report has been filed about this
9577 explicit-instantiation:
9578 storage-class-specifier template
9579 decl-specifier-seq [opt] declarator [opt] ;
9580 function-specifier template
9581 decl-specifier-seq [opt] declarator [opt] ; */
9584 cp_parser_explicit_instantiation (cp_parser* parser)
9586 int declares_class_or_enum;
9587 cp_decl_specifier_seq decl_specifiers;
9588 tree extension_specifier = NULL_TREE;
9590 /* Look for an (optional) storage-class-specifier or
9591 function-specifier. */
9592 if (cp_parser_allow_gnu_extensions_p (parser))
9595 = cp_parser_storage_class_specifier_opt (parser);
9596 if (!extension_specifier)
9598 = cp_parser_function_specifier_opt (parser,
9599 /*decl_specs=*/NULL);
9602 /* Look for the `template' keyword. */
9603 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9604 /* Let the front end know that we are processing an explicit
9606 begin_explicit_instantiation ();
9607 /* [temp.explicit] says that we are supposed to ignore access
9608 control while processing explicit instantiation directives. */
9609 push_deferring_access_checks (dk_no_check);
9610 /* Parse a decl-specifier-seq. */
9611 cp_parser_decl_specifier_seq (parser,
9612 CP_PARSER_FLAGS_OPTIONAL,
9614 &declares_class_or_enum);
9615 /* If there was exactly one decl-specifier, and it declared a class,
9616 and there's no declarator, then we have an explicit type
9618 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
9622 type = check_tag_decl (&decl_specifiers);
9623 /* Turn access control back on for names used during
9624 template instantiation. */
9625 pop_deferring_access_checks ();
9627 do_type_instantiation (type, extension_specifier,
9628 /*complain=*/tf_error);
9632 cp_declarator *declarator;
9635 /* Parse the declarator. */
9637 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9638 /*ctor_dtor_or_conv_p=*/NULL,
9639 /*parenthesized_p=*/NULL,
9640 /*member_p=*/false);
9641 if (declares_class_or_enum & 2)
9642 cp_parser_check_for_definition_in_return_type (declarator,
9643 decl_specifiers.type);
9644 if (declarator != cp_error_declarator)
9646 decl = grokdeclarator (declarator, &decl_specifiers,
9647 NORMAL, 0, &decl_specifiers.attributes);
9648 /* Turn access control back on for names used during
9649 template instantiation. */
9650 pop_deferring_access_checks ();
9651 /* Do the explicit instantiation. */
9652 do_decl_instantiation (decl, extension_specifier);
9656 pop_deferring_access_checks ();
9657 /* Skip the body of the explicit instantiation. */
9658 cp_parser_skip_to_end_of_statement (parser);
9661 /* We're done with the instantiation. */
9662 end_explicit_instantiation ();
9664 cp_parser_consume_semicolon_at_end_of_statement (parser);
9667 /* Parse an explicit-specialization.
9669 explicit-specialization:
9670 template < > declaration
9672 Although the standard says `declaration', what it really means is:
9674 explicit-specialization:
9675 template <> decl-specifier [opt] init-declarator [opt] ;
9676 template <> function-definition
9677 template <> explicit-specialization
9678 template <> template-declaration */
9681 cp_parser_explicit_specialization (cp_parser* parser)
9684 /* Look for the `template' keyword. */
9685 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9686 /* Look for the `<'. */
9687 cp_parser_require (parser, CPP_LESS, "`<'");
9688 /* Look for the `>'. */
9689 cp_parser_require (parser, CPP_GREATER, "`>'");
9690 /* We have processed another parameter list. */
9691 ++parser->num_template_parameter_lists;
9694 A template ... explicit specialization ... shall not have C
9696 if (current_lang_name == lang_name_c)
9698 error ("template specialization with C linkage");
9699 /* Give it C++ linkage to avoid confusing other parts of the
9701 push_lang_context (lang_name_cplusplus);
9702 need_lang_pop = true;
9705 need_lang_pop = false;
9706 /* Let the front end know that we are beginning a specialization. */
9707 if (!begin_specialization ())
9709 end_specialization ();
9710 cp_parser_skip_to_end_of_block_or_statement (parser);
9714 /* If the next keyword is `template', we need to figure out whether
9715 or not we're looking a template-declaration. */
9716 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9718 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9719 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9720 cp_parser_template_declaration_after_export (parser,
9721 /*member_p=*/false);
9723 cp_parser_explicit_specialization (parser);
9726 /* Parse the dependent declaration. */
9727 cp_parser_single_declaration (parser,
9731 /* We're done with the specialization. */
9732 end_specialization ();
9733 /* For the erroneous case of a template with C linkage, we pushed an
9734 implicit C++ linkage scope; exit that scope now. */
9736 pop_lang_context ();
9737 /* We're done with this parameter list. */
9738 --parser->num_template_parameter_lists;
9741 /* Parse a type-specifier.
9744 simple-type-specifier
9747 elaborated-type-specifier
9755 Returns a representation of the type-specifier. For a
9756 class-specifier, enum-specifier, or elaborated-type-specifier, a
9757 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9759 The parser flags FLAGS is used to control type-specifier parsing.
9761 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9762 in a decl-specifier-seq.
9764 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9765 class-specifier, enum-specifier, or elaborated-type-specifier, then
9766 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9767 if a type is declared; 2 if it is defined. Otherwise, it is set to
9770 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9771 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9775 cp_parser_type_specifier (cp_parser* parser,
9776 cp_parser_flags flags,
9777 cp_decl_specifier_seq *decl_specs,
9778 bool is_declaration,
9779 int* declares_class_or_enum,
9780 bool* is_cv_qualifier)
9782 tree type_spec = NULL_TREE;
9785 cp_decl_spec ds = ds_last;
9787 /* Assume this type-specifier does not declare a new type. */
9788 if (declares_class_or_enum)
9789 *declares_class_or_enum = 0;
9790 /* And that it does not specify a cv-qualifier. */
9791 if (is_cv_qualifier)
9792 *is_cv_qualifier = false;
9793 /* Peek at the next token. */
9794 token = cp_lexer_peek_token (parser->lexer);
9796 /* If we're looking at a keyword, we can use that to guide the
9797 production we choose. */
9798 keyword = token->keyword;
9802 /* Look for the enum-specifier. */
9803 type_spec = cp_parser_enum_specifier (parser);
9804 /* If that worked, we're done. */
9807 if (declares_class_or_enum)
9808 *declares_class_or_enum = 2;
9810 cp_parser_set_decl_spec_type (decl_specs,
9812 /*user_defined_p=*/true);
9816 goto elaborated_type_specifier;
9818 /* Any of these indicate either a class-specifier, or an
9819 elaborated-type-specifier. */
9823 /* Parse tentatively so that we can back up if we don't find a
9825 cp_parser_parse_tentatively (parser);
9826 /* Look for the class-specifier. */
9827 type_spec = cp_parser_class_specifier (parser);
9828 /* If that worked, we're done. */
9829 if (cp_parser_parse_definitely (parser))
9831 if (declares_class_or_enum)
9832 *declares_class_or_enum = 2;
9834 cp_parser_set_decl_spec_type (decl_specs,
9836 /*user_defined_p=*/true);
9841 elaborated_type_specifier:
9842 /* We're declaring (not defining) a class or enum. */
9843 if (declares_class_or_enum)
9844 *declares_class_or_enum = 1;
9848 /* Look for an elaborated-type-specifier. */
9850 = (cp_parser_elaborated_type_specifier
9852 decl_specs && decl_specs->specs[(int) ds_friend],
9855 cp_parser_set_decl_spec_type (decl_specs,
9857 /*user_defined_p=*/true);
9862 if (is_cv_qualifier)
9863 *is_cv_qualifier = true;
9868 if (is_cv_qualifier)
9869 *is_cv_qualifier = true;
9874 if (is_cv_qualifier)
9875 *is_cv_qualifier = true;
9879 /* The `__complex__' keyword is a GNU extension. */
9887 /* Handle simple keywords. */
9892 ++decl_specs->specs[(int)ds];
9893 decl_specs->any_specifiers_p = true;
9895 return cp_lexer_consume_token (parser->lexer)->u.value;
9898 /* If we do not already have a type-specifier, assume we are looking
9899 at a simple-type-specifier. */
9900 type_spec = cp_parser_simple_type_specifier (parser,
9904 /* If we didn't find a type-specifier, and a type-specifier was not
9905 optional in this context, issue an error message. */
9906 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9908 cp_parser_error (parser, "expected type specifier");
9909 return error_mark_node;
9915 /* Parse a simple-type-specifier.
9917 simple-type-specifier:
9918 :: [opt] nested-name-specifier [opt] type-name
9919 :: [opt] nested-name-specifier template template-id
9934 simple-type-specifier:
9935 __typeof__ unary-expression
9936 __typeof__ ( type-id )
9938 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9939 appropriately updated. */
9942 cp_parser_simple_type_specifier (cp_parser* parser,
9943 cp_decl_specifier_seq *decl_specs,
9944 cp_parser_flags flags)
9946 tree type = NULL_TREE;
9949 /* Peek at the next token. */
9950 token = cp_lexer_peek_token (parser->lexer);
9952 /* If we're looking at a keyword, things are easy. */
9953 switch (token->keyword)
9957 decl_specs->explicit_char_p = true;
9958 type = char_type_node;
9961 type = wchar_type_node;
9964 type = boolean_type_node;
9968 ++decl_specs->specs[(int) ds_short];
9969 type = short_integer_type_node;
9973 decl_specs->explicit_int_p = true;
9974 type = integer_type_node;
9978 ++decl_specs->specs[(int) ds_long];
9979 type = long_integer_type_node;
9983 ++decl_specs->specs[(int) ds_signed];
9984 type = integer_type_node;
9988 ++decl_specs->specs[(int) ds_unsigned];
9989 type = unsigned_type_node;
9992 type = float_type_node;
9995 type = double_type_node;
9998 type = void_type_node;
10002 /* Consume the `typeof' token. */
10003 cp_lexer_consume_token (parser->lexer);
10004 /* Parse the operand to `typeof'. */
10005 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
10006 /* If it is not already a TYPE, take its type. */
10007 if (!TYPE_P (type))
10008 type = finish_typeof (type);
10011 cp_parser_set_decl_spec_type (decl_specs, type,
10012 /*user_defined_p=*/true);
10020 /* If the type-specifier was for a built-in type, we're done. */
10025 /* Record the type. */
10027 && (token->keyword != RID_SIGNED
10028 && token->keyword != RID_UNSIGNED
10029 && token->keyword != RID_SHORT
10030 && token->keyword != RID_LONG))
10031 cp_parser_set_decl_spec_type (decl_specs,
10033 /*user_defined=*/false);
10035 decl_specs->any_specifiers_p = true;
10037 /* Consume the token. */
10038 id = cp_lexer_consume_token (parser->lexer)->u.value;
10040 /* There is no valid C++ program where a non-template type is
10041 followed by a "<". That usually indicates that the user thought
10042 that the type was a template. */
10043 cp_parser_check_for_invalid_template_id (parser, type);
10045 return TYPE_NAME (type);
10048 /* The type-specifier must be a user-defined type. */
10049 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
10054 /* Don't gobble tokens or issue error messages if this is an
10055 optional type-specifier. */
10056 if (flags & CP_PARSER_FLAGS_OPTIONAL)
10057 cp_parser_parse_tentatively (parser);
10059 /* Look for the optional `::' operator. */
10061 = (cp_parser_global_scope_opt (parser,
10062 /*current_scope_valid_p=*/false)
10064 /* Look for the nested-name specifier. */
10066 = (cp_parser_nested_name_specifier_opt (parser,
10067 /*typename_keyword_p=*/false,
10068 /*check_dependency_p=*/true,
10070 /*is_declaration=*/false)
10072 /* If we have seen a nested-name-specifier, and the next token
10073 is `template', then we are using the template-id production. */
10075 && cp_parser_optional_template_keyword (parser))
10077 /* Look for the template-id. */
10078 type = cp_parser_template_id (parser,
10079 /*template_keyword_p=*/true,
10080 /*check_dependency_p=*/true,
10081 /*is_declaration=*/false);
10082 /* If the template-id did not name a type, we are out of
10084 if (TREE_CODE (type) != TYPE_DECL)
10086 cp_parser_error (parser, "expected template-id for type");
10090 /* Otherwise, look for a type-name. */
10092 type = cp_parser_type_name (parser);
10093 /* Keep track of all name-lookups performed in class scopes. */
10097 && TREE_CODE (type) == TYPE_DECL
10098 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
10099 maybe_note_name_used_in_class (DECL_NAME (type), type);
10100 /* If it didn't work out, we don't have a TYPE. */
10101 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
10102 && !cp_parser_parse_definitely (parser))
10104 if (type && decl_specs)
10105 cp_parser_set_decl_spec_type (decl_specs, type,
10106 /*user_defined=*/true);
10109 /* If we didn't get a type-name, issue an error message. */
10110 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
10112 cp_parser_error (parser, "expected type-name");
10113 return error_mark_node;
10116 /* There is no valid C++ program where a non-template type is
10117 followed by a "<". That usually indicates that the user thought
10118 that the type was a template. */
10119 if (type && type != error_mark_node)
10121 /* As a last-ditch effort, see if TYPE is an Objective-C type.
10122 If it is, then the '<'...'>' enclose protocol names rather than
10123 template arguments, and so everything is fine. */
10124 if (c_dialect_objc ()
10125 && (objc_is_id (type) || objc_is_class_name (type)))
10127 tree protos = cp_parser_objc_protocol_refs_opt (parser);
10128 tree qual_type = objc_get_protocol_qualified_type (type, protos);
10130 /* Clobber the "unqualified" type previously entered into
10131 DECL_SPECS with the new, improved protocol-qualified version. */
10133 decl_specs->type = qual_type;
10138 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
10144 /* Parse a type-name.
10157 Returns a TYPE_DECL for the type. */
10160 cp_parser_type_name (cp_parser* parser)
10165 /* We can't know yet whether it is a class-name or not. */
10166 cp_parser_parse_tentatively (parser);
10167 /* Try a class-name. */
10168 type_decl = cp_parser_class_name (parser,
10169 /*typename_keyword_p=*/false,
10170 /*template_keyword_p=*/false,
10172 /*check_dependency_p=*/true,
10173 /*class_head_p=*/false,
10174 /*is_declaration=*/false);
10175 /* If it's not a class-name, keep looking. */
10176 if (!cp_parser_parse_definitely (parser))
10178 /* It must be a typedef-name or an enum-name. */
10179 identifier = cp_parser_identifier (parser);
10180 if (identifier == error_mark_node)
10181 return error_mark_node;
10183 /* Look up the type-name. */
10184 type_decl = cp_parser_lookup_name_simple (parser, identifier);
10186 if (TREE_CODE (type_decl) != TYPE_DECL
10187 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
10189 /* See if this is an Objective-C type. */
10190 tree protos = cp_parser_objc_protocol_refs_opt (parser);
10191 tree type = objc_get_protocol_qualified_type (identifier, protos);
10193 type_decl = TYPE_NAME (type);
10196 /* Issue an error if we did not find a type-name. */
10197 if (TREE_CODE (type_decl) != TYPE_DECL)
10199 if (!cp_parser_simulate_error (parser))
10200 cp_parser_name_lookup_error (parser, identifier, type_decl,
10202 type_decl = error_mark_node;
10204 /* Remember that the name was used in the definition of the
10205 current class so that we can check later to see if the
10206 meaning would have been different after the class was
10207 entirely defined. */
10208 else if (type_decl != error_mark_node
10210 maybe_note_name_used_in_class (identifier, type_decl);
10217 /* Parse an elaborated-type-specifier. Note that the grammar given
10218 here incorporates the resolution to DR68.
10220 elaborated-type-specifier:
10221 class-key :: [opt] nested-name-specifier [opt] identifier
10222 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
10223 enum :: [opt] nested-name-specifier [opt] identifier
10224 typename :: [opt] nested-name-specifier identifier
10225 typename :: [opt] nested-name-specifier template [opt]
10230 elaborated-type-specifier:
10231 class-key attributes :: [opt] nested-name-specifier [opt] identifier
10232 class-key attributes :: [opt] nested-name-specifier [opt]
10233 template [opt] template-id
10234 enum attributes :: [opt] nested-name-specifier [opt] identifier
10236 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
10237 declared `friend'. If IS_DECLARATION is TRUE, then this
10238 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
10239 something is being declared.
10241 Returns the TYPE specified. */
10244 cp_parser_elaborated_type_specifier (cp_parser* parser,
10246 bool is_declaration)
10248 enum tag_types tag_type;
10250 tree type = NULL_TREE;
10251 tree attributes = NULL_TREE;
10253 /* See if we're looking at the `enum' keyword. */
10254 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
10256 /* Consume the `enum' token. */
10257 cp_lexer_consume_token (parser->lexer);
10258 /* Remember that it's an enumeration type. */
10259 tag_type = enum_type;
10260 /* Parse the attributes. */
10261 attributes = cp_parser_attributes_opt (parser);
10263 /* Or, it might be `typename'. */
10264 else if (cp_lexer_next_token_is_keyword (parser->lexer,
10267 /* Consume the `typename' token. */
10268 cp_lexer_consume_token (parser->lexer);
10269 /* Remember that it's a `typename' type. */
10270 tag_type = typename_type;
10271 /* The `typename' keyword is only allowed in templates. */
10272 if (!processing_template_decl)
10273 pedwarn ("using %<typename%> outside of template");
10275 /* Otherwise it must be a class-key. */
10278 tag_type = cp_parser_class_key (parser);
10279 if (tag_type == none_type)
10280 return error_mark_node;
10281 /* Parse the attributes. */
10282 attributes = cp_parser_attributes_opt (parser);
10285 /* Look for the `::' operator. */
10286 cp_parser_global_scope_opt (parser,
10287 /*current_scope_valid_p=*/false);
10288 /* Look for the nested-name-specifier. */
10289 if (tag_type == typename_type)
10291 if (!cp_parser_nested_name_specifier (parser,
10292 /*typename_keyword_p=*/true,
10293 /*check_dependency_p=*/true,
10296 return error_mark_node;
10299 /* Even though `typename' is not present, the proposed resolution
10300 to Core Issue 180 says that in `class A<T>::B', `B' should be
10301 considered a type-name, even if `A<T>' is dependent. */
10302 cp_parser_nested_name_specifier_opt (parser,
10303 /*typename_keyword_p=*/true,
10304 /*check_dependency_p=*/true,
10307 /* For everything but enumeration types, consider a template-id. */
10308 /* For an enumeration type, consider only a plain identifier. */
10309 if (tag_type != enum_type)
10311 bool template_p = false;
10314 /* Allow the `template' keyword. */
10315 template_p = cp_parser_optional_template_keyword (parser);
10316 /* If we didn't see `template', we don't know if there's a
10317 template-id or not. */
10319 cp_parser_parse_tentatively (parser);
10320 /* Parse the template-id. */
10321 decl = cp_parser_template_id (parser, template_p,
10322 /*check_dependency_p=*/true,
10324 /* If we didn't find a template-id, look for an ordinary
10326 if (!template_p && !cp_parser_parse_definitely (parser))
10328 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
10329 in effect, then we must assume that, upon instantiation, the
10330 template will correspond to a class. */
10331 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
10332 && tag_type == typename_type)
10333 type = make_typename_type (parser->scope, decl,
10335 /*complain=*/tf_error);
10337 type = TREE_TYPE (decl);
10342 identifier = cp_parser_identifier (parser);
10344 if (identifier == error_mark_node)
10346 parser->scope = NULL_TREE;
10347 return error_mark_node;
10350 /* For a `typename', we needn't call xref_tag. */
10351 if (tag_type == typename_type
10352 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
10353 return cp_parser_make_typename_type (parser, parser->scope,
10355 /* Look up a qualified name in the usual way. */
10360 decl = cp_parser_lookup_name (parser, identifier,
10362 /*is_template=*/false,
10363 /*is_namespace=*/false,
10364 /*check_dependency=*/true,
10365 /*ambiguous_decls=*/NULL);
10367 /* If we are parsing friend declaration, DECL may be a
10368 TEMPLATE_DECL tree node here. However, we need to check
10369 whether this TEMPLATE_DECL results in valid code. Consider
10370 the following example:
10373 template <class T> class C {};
10376 template <class T> friend class N::C; // #1, valid code
10378 template <class T> class Y {
10379 friend class N::C; // #2, invalid code
10382 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
10383 name lookup of `N::C'. We see that friend declaration must
10384 be template for the code to be valid. Note that
10385 processing_template_decl does not work here since it is
10386 always 1 for the above two cases. */
10388 decl = (cp_parser_maybe_treat_template_as_class
10389 (decl, /*tag_name_p=*/is_friend
10390 && parser->num_template_parameter_lists));
10392 if (TREE_CODE (decl) != TYPE_DECL)
10394 cp_parser_diagnose_invalid_type_name (parser,
10397 return error_mark_node;
10400 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
10402 bool allow_template = (parser->num_template_parameter_lists
10403 || DECL_SELF_REFERENCE_P (decl));
10404 type = check_elaborated_type_specifier (tag_type, decl,
10407 if (type == error_mark_node)
10408 return error_mark_node;
10411 type = TREE_TYPE (decl);
10415 /* An elaborated-type-specifier sometimes introduces a new type and
10416 sometimes names an existing type. Normally, the rule is that it
10417 introduces a new type only if there is not an existing type of
10418 the same name already in scope. For example, given:
10421 void f() { struct S s; }
10423 the `struct S' in the body of `f' is the same `struct S' as in
10424 the global scope; the existing definition is used. However, if
10425 there were no global declaration, this would introduce a new
10426 local class named `S'.
10428 An exception to this rule applies to the following code:
10430 namespace N { struct S; }
10432 Here, the elaborated-type-specifier names a new type
10433 unconditionally; even if there is already an `S' in the
10434 containing scope this declaration names a new type.
10435 This exception only applies if the elaborated-type-specifier
10436 forms the complete declaration:
10440 A declaration consisting solely of `class-key identifier ;' is
10441 either a redeclaration of the name in the current scope or a
10442 forward declaration of the identifier as a class name. It
10443 introduces the name into the current scope.
10445 We are in this situation precisely when the next token is a `;'.
10447 An exception to the exception is that a `friend' declaration does
10448 *not* name a new type; i.e., given:
10450 struct S { friend struct T; };
10452 `T' is not a new type in the scope of `S'.
10454 Also, `new struct S' or `sizeof (struct S)' never results in the
10455 definition of a new type; a new type can only be declared in a
10456 declaration context. */
10462 /* Friends have special name lookup rules. */
10463 ts = ts_within_enclosing_non_class;
10464 else if (is_declaration
10465 && cp_lexer_next_token_is (parser->lexer,
10467 /* This is a `class-key identifier ;' */
10473 (parser->num_template_parameter_lists
10474 && (cp_parser_next_token_starts_class_definition_p (parser)
10475 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
10476 /* An unqualified name was used to reference this type, so
10477 there were no qualifying templates. */
10478 if (!cp_parser_check_template_parameters (parser,
10479 /*num_templates=*/0))
10480 return error_mark_node;
10481 type = xref_tag (tag_type, identifier, ts, template_p);
10485 if (type == error_mark_node)
10486 return error_mark_node;
10488 /* Allow attributes on forward declarations of classes. */
10491 if (TREE_CODE (type) == TYPENAME_TYPE)
10492 warning (OPT_Wattributes,
10493 "attributes ignored on uninstantiated type");
10494 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
10495 && ! processing_explicit_instantiation)
10496 warning (OPT_Wattributes,
10497 "attributes ignored on template instantiation");
10498 else if (is_declaration && cp_parser_declares_only_class_p (parser))
10499 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
10501 warning (OPT_Wattributes,
10502 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
10505 if (tag_type != enum_type)
10506 cp_parser_check_class_key (tag_type, type);
10508 /* A "<" cannot follow an elaborated type specifier. If that
10509 happens, the user was probably trying to form a template-id. */
10510 cp_parser_check_for_invalid_template_id (parser, type);
10515 /* Parse an enum-specifier.
10518 enum identifier [opt] { enumerator-list [opt] }
10521 enum attributes[opt] identifier [opt] { enumerator-list [opt] }
10524 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
10525 if the token stream isn't an enum-specifier after all. */
10528 cp_parser_enum_specifier (cp_parser* parser)
10534 /* Parse tentatively so that we can back up if we don't find a
10536 cp_parser_parse_tentatively (parser);
10538 /* Caller guarantees that the current token is 'enum', an identifier
10539 possibly follows, and the token after that is an opening brace.
10540 If we don't have an identifier, fabricate an anonymous name for
10541 the enumeration being defined. */
10542 cp_lexer_consume_token (parser->lexer);
10544 attributes = cp_parser_attributes_opt (parser);
10546 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10547 identifier = cp_parser_identifier (parser);
10549 identifier = make_anon_name ();
10551 /* Look for the `{' but don't consume it yet. */
10552 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
10553 cp_parser_simulate_error (parser);
10555 if (!cp_parser_parse_definitely (parser))
10558 /* Issue an error message if type-definitions are forbidden here. */
10559 if (!cp_parser_check_type_definition (parser))
10560 type = error_mark_node;
10562 /* Create the new type. We do this before consuming the opening
10563 brace so the enum will be recorded as being on the line of its
10564 tag (or the 'enum' keyword, if there is no tag). */
10565 type = start_enum (identifier);
10567 /* Consume the opening brace. */
10568 cp_lexer_consume_token (parser->lexer);
10570 if (type == error_mark_node)
10572 cp_parser_skip_to_end_of_block_or_statement (parser);
10573 return error_mark_node;
10576 /* If the next token is not '}', then there are some enumerators. */
10577 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
10578 cp_parser_enumerator_list (parser, type);
10580 /* Consume the final '}'. */
10581 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10583 /* Look for trailing attributes to apply to this enumeration, and
10584 apply them if appropriate. */
10585 if (cp_parser_allow_gnu_extensions_p (parser))
10587 tree trailing_attr = cp_parser_attributes_opt (parser);
10588 cplus_decl_attributes (&type,
10590 (int) ATTR_FLAG_TYPE_IN_PLACE);
10593 /* Finish up the enumeration. */
10594 finish_enum (type);
10599 /* Parse an enumerator-list. The enumerators all have the indicated
10603 enumerator-definition
10604 enumerator-list , enumerator-definition */
10607 cp_parser_enumerator_list (cp_parser* parser, tree type)
10611 /* Parse an enumerator-definition. */
10612 cp_parser_enumerator_definition (parser, type);
10614 /* If the next token is not a ',', we've reached the end of
10616 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
10618 /* Otherwise, consume the `,' and keep going. */
10619 cp_lexer_consume_token (parser->lexer);
10620 /* If the next token is a `}', there is a trailing comma. */
10621 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
10623 if (pedantic && !in_system_header)
10624 pedwarn ("comma at end of enumerator list");
10630 /* Parse an enumerator-definition. The enumerator has the indicated
10633 enumerator-definition:
10635 enumerator = constant-expression
10641 cp_parser_enumerator_definition (cp_parser* parser, tree type)
10646 /* Look for the identifier. */
10647 identifier = cp_parser_identifier (parser);
10648 if (identifier == error_mark_node)
10651 /* If the next token is an '=', then there is an explicit value. */
10652 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
10654 /* Consume the `=' token. */
10655 cp_lexer_consume_token (parser->lexer);
10656 /* Parse the value. */
10657 value = cp_parser_constant_expression (parser,
10658 /*allow_non_constant_p=*/false,
10664 /* Create the enumerator. */
10665 build_enumerator (identifier, value, type);
10668 /* Parse a namespace-name.
10671 original-namespace-name
10674 Returns the NAMESPACE_DECL for the namespace. */
10677 cp_parser_namespace_name (cp_parser* parser)
10680 tree namespace_decl;
10682 /* Get the name of the namespace. */
10683 identifier = cp_parser_identifier (parser);
10684 if (identifier == error_mark_node)
10685 return error_mark_node;
10687 /* Look up the identifier in the currently active scope. Look only
10688 for namespaces, due to:
10690 [basic.lookup.udir]
10692 When looking up a namespace-name in a using-directive or alias
10693 definition, only namespace names are considered.
10697 [basic.lookup.qual]
10699 During the lookup of a name preceding the :: scope resolution
10700 operator, object, function, and enumerator names are ignored.
10702 (Note that cp_parser_class_or_namespace_name only calls this
10703 function if the token after the name is the scope resolution
10705 namespace_decl = cp_parser_lookup_name (parser, identifier,
10707 /*is_template=*/false,
10708 /*is_namespace=*/true,
10709 /*check_dependency=*/true,
10710 /*ambiguous_decls=*/NULL);
10711 /* If it's not a namespace, issue an error. */
10712 if (namespace_decl == error_mark_node
10713 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
10715 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
10716 error ("%qD is not a namespace-name", identifier);
10717 cp_parser_error (parser, "expected namespace-name");
10718 namespace_decl = error_mark_node;
10721 return namespace_decl;
10724 /* Parse a namespace-definition.
10726 namespace-definition:
10727 named-namespace-definition
10728 unnamed-namespace-definition
10730 named-namespace-definition:
10731 original-namespace-definition
10732 extension-namespace-definition
10734 original-namespace-definition:
10735 namespace identifier { namespace-body }
10737 extension-namespace-definition:
10738 namespace original-namespace-name { namespace-body }
10740 unnamed-namespace-definition:
10741 namespace { namespace-body } */
10744 cp_parser_namespace_definition (cp_parser* parser)
10746 tree identifier, attribs;
10748 /* Look for the `namespace' keyword. */
10749 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10751 /* Get the name of the namespace. We do not attempt to distinguish
10752 between an original-namespace-definition and an
10753 extension-namespace-definition at this point. The semantic
10754 analysis routines are responsible for that. */
10755 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10756 identifier = cp_parser_identifier (parser);
10758 identifier = NULL_TREE;
10760 /* Parse any specified attributes. */
10761 attribs = cp_parser_attributes_opt (parser);
10763 /* Look for the `{' to start the namespace. */
10764 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10765 /* Start the namespace. */
10766 push_namespace_with_attribs (identifier, attribs);
10767 /* Parse the body of the namespace. */
10768 cp_parser_namespace_body (parser);
10769 /* Finish the namespace. */
10771 /* Look for the final `}'. */
10772 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10775 /* Parse a namespace-body.
10778 declaration-seq [opt] */
10781 cp_parser_namespace_body (cp_parser* parser)
10783 cp_parser_declaration_seq_opt (parser);
10786 /* Parse a namespace-alias-definition.
10788 namespace-alias-definition:
10789 namespace identifier = qualified-namespace-specifier ; */
10792 cp_parser_namespace_alias_definition (cp_parser* parser)
10795 tree namespace_specifier;
10797 /* Look for the `namespace' keyword. */
10798 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10799 /* Look for the identifier. */
10800 identifier = cp_parser_identifier (parser);
10801 if (identifier == error_mark_node)
10803 /* Look for the `=' token. */
10804 cp_parser_require (parser, CPP_EQ, "`='");
10805 /* Look for the qualified-namespace-specifier. */
10806 namespace_specifier
10807 = cp_parser_qualified_namespace_specifier (parser);
10808 /* Look for the `;' token. */
10809 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10811 /* Register the alias in the symbol table. */
10812 do_namespace_alias (identifier, namespace_specifier);
10815 /* Parse a qualified-namespace-specifier.
10817 qualified-namespace-specifier:
10818 :: [opt] nested-name-specifier [opt] namespace-name
10820 Returns a NAMESPACE_DECL corresponding to the specified
10824 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10826 /* Look for the optional `::'. */
10827 cp_parser_global_scope_opt (parser,
10828 /*current_scope_valid_p=*/false);
10830 /* Look for the optional nested-name-specifier. */
10831 cp_parser_nested_name_specifier_opt (parser,
10832 /*typename_keyword_p=*/false,
10833 /*check_dependency_p=*/true,
10835 /*is_declaration=*/true);
10837 return cp_parser_namespace_name (parser);
10840 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
10841 access declaration.
10844 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10845 using :: unqualified-id ;
10847 access-declaration:
10853 cp_parser_using_declaration (cp_parser* parser,
10854 bool access_declaration_p)
10857 bool typename_p = false;
10858 bool global_scope_p;
10863 if (access_declaration_p)
10864 cp_parser_parse_tentatively (parser);
10867 /* Look for the `using' keyword. */
10868 cp_parser_require_keyword (parser, RID_USING, "`using'");
10870 /* Peek at the next token. */
10871 token = cp_lexer_peek_token (parser->lexer);
10872 /* See if it's `typename'. */
10873 if (token->keyword == RID_TYPENAME)
10875 /* Remember that we've seen it. */
10877 /* Consume the `typename' token. */
10878 cp_lexer_consume_token (parser->lexer);
10882 /* Look for the optional global scope qualification. */
10884 = (cp_parser_global_scope_opt (parser,
10885 /*current_scope_valid_p=*/false)
10888 /* If we saw `typename', or didn't see `::', then there must be a
10889 nested-name-specifier present. */
10890 if (typename_p || !global_scope_p)
10891 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10892 /*check_dependency_p=*/true,
10894 /*is_declaration=*/true);
10895 /* Otherwise, we could be in either of the two productions. In that
10896 case, treat the nested-name-specifier as optional. */
10898 qscope = cp_parser_nested_name_specifier_opt (parser,
10899 /*typename_keyword_p=*/false,
10900 /*check_dependency_p=*/true,
10902 /*is_declaration=*/true);
10904 qscope = global_namespace;
10906 if (access_declaration_p && cp_parser_error_occurred (parser))
10907 /* Something has already gone wrong; there's no need to parse
10908 further. Since an error has occurred, the return value of
10909 cp_parser_parse_definitely will be false, as required. */
10910 return cp_parser_parse_definitely (parser);
10912 /* Parse the unqualified-id. */
10913 identifier = cp_parser_unqualified_id (parser,
10914 /*template_keyword_p=*/false,
10915 /*check_dependency_p=*/true,
10916 /*declarator_p=*/true,
10917 /*optional_p=*/false);
10919 if (access_declaration_p)
10921 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
10922 cp_parser_simulate_error (parser);
10923 if (!cp_parser_parse_definitely (parser))
10927 /* The function we call to handle a using-declaration is different
10928 depending on what scope we are in. */
10929 if (qscope == error_mark_node || identifier == error_mark_node)
10931 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10932 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10933 /* [namespace.udecl]
10935 A using declaration shall not name a template-id. */
10936 error ("a template-id may not appear in a using-declaration");
10939 if (at_class_scope_p ())
10941 /* Create the USING_DECL. */
10942 decl = do_class_using_decl (parser->scope, identifier);
10943 /* Add it to the list of members in this class. */
10944 finish_member_declaration (decl);
10948 decl = cp_parser_lookup_name_simple (parser, identifier);
10949 if (decl == error_mark_node)
10950 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10951 else if (!at_namespace_scope_p ())
10952 do_local_using_decl (decl, qscope, identifier);
10954 do_toplevel_using_decl (decl, qscope, identifier);
10958 /* Look for the final `;'. */
10959 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10964 /* Parse a using-directive.
10967 using namespace :: [opt] nested-name-specifier [opt]
10968 namespace-name ; */
10971 cp_parser_using_directive (cp_parser* parser)
10973 tree namespace_decl;
10976 /* Look for the `using' keyword. */
10977 cp_parser_require_keyword (parser, RID_USING, "`using'");
10978 /* And the `namespace' keyword. */
10979 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10980 /* Look for the optional `::' operator. */
10981 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10982 /* And the optional nested-name-specifier. */
10983 cp_parser_nested_name_specifier_opt (parser,
10984 /*typename_keyword_p=*/false,
10985 /*check_dependency_p=*/true,
10987 /*is_declaration=*/true);
10988 /* Get the namespace being used. */
10989 namespace_decl = cp_parser_namespace_name (parser);
10990 /* And any specified attributes. */
10991 attribs = cp_parser_attributes_opt (parser);
10992 /* Update the symbol table. */
10993 parse_using_directive (namespace_decl, attribs);
10994 /* Look for the final `;'. */
10995 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10998 /* Parse an asm-definition.
11001 asm ( string-literal ) ;
11006 asm volatile [opt] ( string-literal ) ;
11007 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
11008 asm volatile [opt] ( string-literal : asm-operand-list [opt]
11009 : asm-operand-list [opt] ) ;
11010 asm volatile [opt] ( string-literal : asm-operand-list [opt]
11011 : asm-operand-list [opt]
11012 : asm-operand-list [opt] ) ; */
11015 cp_parser_asm_definition (cp_parser* parser)
11018 tree outputs = NULL_TREE;
11019 tree inputs = NULL_TREE;
11020 tree clobbers = NULL_TREE;
11022 bool volatile_p = false;
11023 bool extended_p = false;
11025 /* Look for the `asm' keyword. */
11026 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
11027 /* See if the next token is `volatile'. */
11028 if (cp_parser_allow_gnu_extensions_p (parser)
11029 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
11031 /* Remember that we saw the `volatile' keyword. */
11033 /* Consume the token. */
11034 cp_lexer_consume_token (parser->lexer);
11036 /* Look for the opening `('. */
11037 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
11039 /* Look for the string. */
11040 string = cp_parser_string_literal (parser, false, false);
11041 if (string == error_mark_node)
11043 cp_parser_skip_to_closing_parenthesis (parser, true, false,
11044 /*consume_paren=*/true);
11048 /* If we're allowing GNU extensions, check for the extended assembly
11049 syntax. Unfortunately, the `:' tokens need not be separated by
11050 a space in C, and so, for compatibility, we tolerate that here
11051 too. Doing that means that we have to treat the `::' operator as
11053 if (cp_parser_allow_gnu_extensions_p (parser)
11054 && parser->in_function_body
11055 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
11056 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
11058 bool inputs_p = false;
11059 bool clobbers_p = false;
11061 /* The extended syntax was used. */
11064 /* Look for outputs. */
11065 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11067 /* Consume the `:'. */
11068 cp_lexer_consume_token (parser->lexer);
11069 /* Parse the output-operands. */
11070 if (cp_lexer_next_token_is_not (parser->lexer,
11072 && cp_lexer_next_token_is_not (parser->lexer,
11074 && cp_lexer_next_token_is_not (parser->lexer,
11076 outputs = cp_parser_asm_operand_list (parser);
11078 /* If the next token is `::', there are no outputs, and the
11079 next token is the beginning of the inputs. */
11080 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
11081 /* The inputs are coming next. */
11084 /* Look for inputs. */
11086 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11088 /* Consume the `:' or `::'. */
11089 cp_lexer_consume_token (parser->lexer);
11090 /* Parse the output-operands. */
11091 if (cp_lexer_next_token_is_not (parser->lexer,
11093 && cp_lexer_next_token_is_not (parser->lexer,
11095 inputs = cp_parser_asm_operand_list (parser);
11097 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
11098 /* The clobbers are coming next. */
11101 /* Look for clobbers. */
11103 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11105 /* Consume the `:' or `::'. */
11106 cp_lexer_consume_token (parser->lexer);
11107 /* Parse the clobbers. */
11108 if (cp_lexer_next_token_is_not (parser->lexer,
11110 clobbers = cp_parser_asm_clobber_list (parser);
11113 /* Look for the closing `)'. */
11114 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11115 cp_parser_skip_to_closing_parenthesis (parser, true, false,
11116 /*consume_paren=*/true);
11117 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
11119 /* Create the ASM_EXPR. */
11120 if (parser->in_function_body)
11122 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
11124 /* If the extended syntax was not used, mark the ASM_EXPR. */
11127 tree temp = asm_stmt;
11128 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
11129 temp = TREE_OPERAND (temp, 0);
11131 ASM_INPUT_P (temp) = 1;
11135 cgraph_add_asm_node (string);
11138 /* Declarators [gram.dcl.decl] */
11140 /* Parse an init-declarator.
11143 declarator initializer [opt]
11148 declarator asm-specification [opt] attributes [opt] initializer [opt]
11150 function-definition:
11151 decl-specifier-seq [opt] declarator ctor-initializer [opt]
11153 decl-specifier-seq [opt] declarator function-try-block
11157 function-definition:
11158 __extension__ function-definition
11160 The DECL_SPECIFIERS apply to this declarator. Returns a
11161 representation of the entity declared. If MEMBER_P is TRUE, then
11162 this declarator appears in a class scope. The new DECL created by
11163 this declarator is returned.
11165 The CHECKS are access checks that should be performed once we know
11166 what entity is being declared (and, therefore, what classes have
11169 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
11170 for a function-definition here as well. If the declarator is a
11171 declarator for a function-definition, *FUNCTION_DEFINITION_P will
11172 be TRUE upon return. By that point, the function-definition will
11173 have been completely parsed.
11175 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
11179 cp_parser_init_declarator (cp_parser* parser,
11180 cp_decl_specifier_seq *decl_specifiers,
11181 VEC (deferred_access_check,gc)* checks,
11182 bool function_definition_allowed_p,
11184 int declares_class_or_enum,
11185 bool* function_definition_p)
11188 cp_declarator *declarator;
11189 tree prefix_attributes;
11191 tree asm_specification;
11193 tree decl = NULL_TREE;
11195 bool is_initialized;
11196 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
11197 initialized with "= ..", CPP_OPEN_PAREN if initialized with
11199 enum cpp_ttype initialization_kind;
11200 bool is_parenthesized_init = false;
11201 bool is_non_constant_init;
11202 int ctor_dtor_or_conv_p;
11204 tree pushed_scope = NULL;
11206 /* Gather the attributes that were provided with the
11207 decl-specifiers. */
11208 prefix_attributes = decl_specifiers->attributes;
11210 /* Assume that this is not the declarator for a function
11212 if (function_definition_p)
11213 *function_definition_p = false;
11215 /* Defer access checks while parsing the declarator; we cannot know
11216 what names are accessible until we know what is being
11218 resume_deferring_access_checks ();
11220 /* Parse the declarator. */
11222 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
11223 &ctor_dtor_or_conv_p,
11224 /*parenthesized_p=*/NULL,
11225 /*member_p=*/false);
11226 /* Gather up the deferred checks. */
11227 stop_deferring_access_checks ();
11229 /* If the DECLARATOR was erroneous, there's no need to go
11231 if (declarator == cp_error_declarator)
11232 return error_mark_node;
11234 /* Check that the number of template-parameter-lists is OK. */
11235 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
11236 return error_mark_node;
11238 if (declares_class_or_enum & 2)
11239 cp_parser_check_for_definition_in_return_type (declarator,
11240 decl_specifiers->type);
11242 /* Figure out what scope the entity declared by the DECLARATOR is
11243 located in. `grokdeclarator' sometimes changes the scope, so
11244 we compute it now. */
11245 scope = get_scope_of_declarator (declarator);
11247 /* If we're allowing GNU extensions, look for an asm-specification
11249 if (cp_parser_allow_gnu_extensions_p (parser))
11251 /* Look for an asm-specification. */
11252 asm_specification = cp_parser_asm_specification_opt (parser);
11253 /* And attributes. */
11254 attributes = cp_parser_attributes_opt (parser);
11258 asm_specification = NULL_TREE;
11259 attributes = NULL_TREE;
11262 /* Peek at the next token. */
11263 token = cp_lexer_peek_token (parser->lexer);
11264 /* Check to see if the token indicates the start of a
11265 function-definition. */
11266 if (cp_parser_token_starts_function_definition_p (token))
11268 if (!function_definition_allowed_p)
11270 /* If a function-definition should not appear here, issue an
11272 cp_parser_error (parser,
11273 "a function-definition is not allowed here");
11274 return error_mark_node;
11278 /* Neither attributes nor an asm-specification are allowed
11279 on a function-definition. */
11280 if (asm_specification)
11281 error ("an asm-specification is not allowed on a function-definition");
11283 error ("attributes are not allowed on a function-definition");
11284 /* This is a function-definition. */
11285 *function_definition_p = true;
11287 /* Parse the function definition. */
11289 decl = cp_parser_save_member_function_body (parser,
11292 prefix_attributes);
11295 = (cp_parser_function_definition_from_specifiers_and_declarator
11296 (parser, decl_specifiers, prefix_attributes, declarator));
11304 Only in function declarations for constructors, destructors, and
11305 type conversions can the decl-specifier-seq be omitted.
11307 We explicitly postpone this check past the point where we handle
11308 function-definitions because we tolerate function-definitions
11309 that are missing their return types in some modes. */
11310 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
11312 cp_parser_error (parser,
11313 "expected constructor, destructor, or type conversion");
11314 return error_mark_node;
11317 /* An `=' or an `(' indicates an initializer. */
11318 if (token->type == CPP_EQ
11319 || token->type == CPP_OPEN_PAREN)
11321 is_initialized = true;
11322 initialization_kind = token->type;
11326 /* If the init-declarator isn't initialized and isn't followed by a
11327 `,' or `;', it's not a valid init-declarator. */
11328 if (token->type != CPP_COMMA
11329 && token->type != CPP_SEMICOLON)
11331 cp_parser_error (parser, "expected initializer");
11332 return error_mark_node;
11334 is_initialized = false;
11335 initialization_kind = CPP_EOF;
11338 /* Because start_decl has side-effects, we should only call it if we
11339 know we're going ahead. By this point, we know that we cannot
11340 possibly be looking at any other construct. */
11341 cp_parser_commit_to_tentative_parse (parser);
11343 /* If the decl specifiers were bad, issue an error now that we're
11344 sure this was intended to be a declarator. Then continue
11345 declaring the variable(s), as int, to try to cut down on further
11347 if (decl_specifiers->any_specifiers_p
11348 && decl_specifiers->type == error_mark_node)
11350 cp_parser_error (parser, "invalid type in declaration");
11351 decl_specifiers->type = integer_type_node;
11354 /* Check to see whether or not this declaration is a friend. */
11355 friend_p = cp_parser_friend_p (decl_specifiers);
11357 /* Enter the newly declared entry in the symbol table. If we're
11358 processing a declaration in a class-specifier, we wait until
11359 after processing the initializer. */
11362 if (parser->in_unbraced_linkage_specification_p)
11363 decl_specifiers->storage_class = sc_extern;
11364 decl = start_decl (declarator, decl_specifiers,
11365 is_initialized, attributes, prefix_attributes,
11369 /* Enter the SCOPE. That way unqualified names appearing in the
11370 initializer will be looked up in SCOPE. */
11371 pushed_scope = push_scope (scope);
11373 /* Perform deferred access control checks, now that we know in which
11374 SCOPE the declared entity resides. */
11375 if (!member_p && decl)
11377 tree saved_current_function_decl = NULL_TREE;
11379 /* If the entity being declared is a function, pretend that we
11380 are in its scope. If it is a `friend', it may have access to
11381 things that would not otherwise be accessible. */
11382 if (TREE_CODE (decl) == FUNCTION_DECL)
11384 saved_current_function_decl = current_function_decl;
11385 current_function_decl = decl;
11388 /* Perform access checks for template parameters. */
11389 cp_parser_perform_template_parameter_access_checks (checks);
11391 /* Perform the access control checks for the declarator and the
11392 the decl-specifiers. */
11393 perform_deferred_access_checks ();
11395 /* Restore the saved value. */
11396 if (TREE_CODE (decl) == FUNCTION_DECL)
11397 current_function_decl = saved_current_function_decl;
11400 /* Parse the initializer. */
11401 initializer = NULL_TREE;
11402 is_parenthesized_init = false;
11403 is_non_constant_init = true;
11404 if (is_initialized)
11406 if (function_declarator_p (declarator))
11408 if (initialization_kind == CPP_EQ)
11409 initializer = cp_parser_pure_specifier (parser);
11412 /* If the declaration was erroneous, we don't really
11413 know what the user intended, so just silently
11414 consume the initializer. */
11415 if (decl != error_mark_node)
11416 error ("initializer provided for function");
11417 cp_parser_skip_to_closing_parenthesis (parser,
11418 /*recovering=*/true,
11419 /*or_comma=*/false,
11420 /*consume_paren=*/true);
11424 initializer = cp_parser_initializer (parser,
11425 &is_parenthesized_init,
11426 &is_non_constant_init);
11429 /* The old parser allows attributes to appear after a parenthesized
11430 initializer. Mark Mitchell proposed removing this functionality
11431 on the GCC mailing lists on 2002-08-13. This parser accepts the
11432 attributes -- but ignores them. */
11433 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
11434 if (cp_parser_attributes_opt (parser))
11435 warning (OPT_Wattributes,
11436 "attributes after parenthesized initializer ignored");
11438 /* For an in-class declaration, use `grokfield' to create the
11444 pop_scope (pushed_scope);
11445 pushed_scope = false;
11447 decl = grokfield (declarator, decl_specifiers,
11448 initializer, !is_non_constant_init,
11449 /*asmspec=*/NULL_TREE,
11450 prefix_attributes);
11451 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
11452 cp_parser_save_default_args (parser, decl);
11455 /* Finish processing the declaration. But, skip friend
11457 if (!friend_p && decl && decl != error_mark_node)
11459 cp_finish_decl (decl,
11460 initializer, !is_non_constant_init,
11462 /* If the initializer is in parentheses, then this is
11463 a direct-initialization, which means that an
11464 `explicit' constructor is OK. Otherwise, an
11465 `explicit' constructor cannot be used. */
11466 ((is_parenthesized_init || !is_initialized)
11467 ? 0 : LOOKUP_ONLYCONVERTING));
11469 if (!friend_p && pushed_scope)
11470 pop_scope (pushed_scope);
11475 /* Parse a declarator.
11479 ptr-operator declarator
11481 abstract-declarator:
11482 ptr-operator abstract-declarator [opt]
11483 direct-abstract-declarator
11488 attributes [opt] direct-declarator
11489 attributes [opt] ptr-operator declarator
11491 abstract-declarator:
11492 attributes [opt] ptr-operator abstract-declarator [opt]
11493 attributes [opt] direct-abstract-declarator
11495 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
11496 detect constructor, destructor or conversion operators. It is set
11497 to -1 if the declarator is a name, and +1 if it is a
11498 function. Otherwise it is set to zero. Usually you just want to
11499 test for >0, but internally the negative value is used.
11501 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
11502 a decl-specifier-seq unless it declares a constructor, destructor,
11503 or conversion. It might seem that we could check this condition in
11504 semantic analysis, rather than parsing, but that makes it difficult
11505 to handle something like `f()'. We want to notice that there are
11506 no decl-specifiers, and therefore realize that this is an
11507 expression, not a declaration.)
11509 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
11510 the declarator is a direct-declarator of the form "(...)".
11512 MEMBER_P is true iff this declarator is a member-declarator. */
11514 static cp_declarator *
11515 cp_parser_declarator (cp_parser* parser,
11516 cp_parser_declarator_kind dcl_kind,
11517 int* ctor_dtor_or_conv_p,
11518 bool* parenthesized_p,
11522 cp_declarator *declarator;
11523 enum tree_code code;
11524 cp_cv_quals cv_quals;
11526 tree attributes = NULL_TREE;
11528 /* Assume this is not a constructor, destructor, or type-conversion
11530 if (ctor_dtor_or_conv_p)
11531 *ctor_dtor_or_conv_p = 0;
11533 if (cp_parser_allow_gnu_extensions_p (parser))
11534 attributes = cp_parser_attributes_opt (parser);
11536 /* Peek at the next token. */
11537 token = cp_lexer_peek_token (parser->lexer);
11539 /* Check for the ptr-operator production. */
11540 cp_parser_parse_tentatively (parser);
11541 /* Parse the ptr-operator. */
11542 code = cp_parser_ptr_operator (parser,
11545 /* If that worked, then we have a ptr-operator. */
11546 if (cp_parser_parse_definitely (parser))
11548 /* If a ptr-operator was found, then this declarator was not
11550 if (parenthesized_p)
11551 *parenthesized_p = true;
11552 /* The dependent declarator is optional if we are parsing an
11553 abstract-declarator. */
11554 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11555 cp_parser_parse_tentatively (parser);
11557 /* Parse the dependent declarator. */
11558 declarator = cp_parser_declarator (parser, dcl_kind,
11559 /*ctor_dtor_or_conv_p=*/NULL,
11560 /*parenthesized_p=*/NULL,
11561 /*member_p=*/false);
11563 /* If we are parsing an abstract-declarator, we must handle the
11564 case where the dependent declarator is absent. */
11565 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
11566 && !cp_parser_parse_definitely (parser))
11569 /* Build the representation of the ptr-operator. */
11571 declarator = make_ptrmem_declarator (cv_quals,
11574 else if (code == INDIRECT_REF)
11575 declarator = make_pointer_declarator (cv_quals, declarator);
11577 declarator = make_reference_declarator (cv_quals, declarator);
11579 /* Everything else is a direct-declarator. */
11582 if (parenthesized_p)
11583 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
11585 declarator = cp_parser_direct_declarator (parser, dcl_kind,
11586 ctor_dtor_or_conv_p,
11590 if (attributes && declarator && declarator != cp_error_declarator)
11591 declarator->attributes = attributes;
11596 /* Parse a direct-declarator or direct-abstract-declarator.
11600 direct-declarator ( parameter-declaration-clause )
11601 cv-qualifier-seq [opt]
11602 exception-specification [opt]
11603 direct-declarator [ constant-expression [opt] ]
11606 direct-abstract-declarator:
11607 direct-abstract-declarator [opt]
11608 ( parameter-declaration-clause )
11609 cv-qualifier-seq [opt]
11610 exception-specification [opt]
11611 direct-abstract-declarator [opt] [ constant-expression [opt] ]
11612 ( abstract-declarator )
11614 Returns a representation of the declarator. DCL_KIND is
11615 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
11616 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
11617 we are parsing a direct-declarator. It is
11618 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
11619 of ambiguity we prefer an abstract declarator, as per
11620 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
11621 cp_parser_declarator. */
11623 static cp_declarator *
11624 cp_parser_direct_declarator (cp_parser* parser,
11625 cp_parser_declarator_kind dcl_kind,
11626 int* ctor_dtor_or_conv_p,
11630 cp_declarator *declarator = NULL;
11631 tree scope = NULL_TREE;
11632 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11633 bool saved_in_declarator_p = parser->in_declarator_p;
11635 tree pushed_scope = NULL_TREE;
11639 /* Peek at the next token. */
11640 token = cp_lexer_peek_token (parser->lexer);
11641 if (token->type == CPP_OPEN_PAREN)
11643 /* This is either a parameter-declaration-clause, or a
11644 parenthesized declarator. When we know we are parsing a
11645 named declarator, it must be a parenthesized declarator
11646 if FIRST is true. For instance, `(int)' is a
11647 parameter-declaration-clause, with an omitted
11648 direct-abstract-declarator. But `((*))', is a
11649 parenthesized abstract declarator. Finally, when T is a
11650 template parameter `(T)' is a
11651 parameter-declaration-clause, and not a parenthesized
11654 We first try and parse a parameter-declaration-clause,
11655 and then try a nested declarator (if FIRST is true).
11657 It is not an error for it not to be a
11658 parameter-declaration-clause, even when FIRST is
11664 The first is the declaration of a function while the
11665 second is a the definition of a variable, including its
11668 Having seen only the parenthesis, we cannot know which of
11669 these two alternatives should be selected. Even more
11670 complex are examples like:
11675 The former is a function-declaration; the latter is a
11676 variable initialization.
11678 Thus again, we try a parameter-declaration-clause, and if
11679 that fails, we back out and return. */
11681 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11683 cp_parameter_declarator *params;
11684 unsigned saved_num_template_parameter_lists;
11686 /* In a member-declarator, the only valid interpretation
11687 of a parenthesis is the start of a
11688 parameter-declaration-clause. (It is invalid to
11689 initialize a static data member with a parenthesized
11690 initializer; only the "=" form of initialization is
11693 cp_parser_parse_tentatively (parser);
11695 /* Consume the `('. */
11696 cp_lexer_consume_token (parser->lexer);
11699 /* If this is going to be an abstract declarator, we're
11700 in a declarator and we can't have default args. */
11701 parser->default_arg_ok_p = false;
11702 parser->in_declarator_p = true;
11705 /* Inside the function parameter list, surrounding
11706 template-parameter-lists do not apply. */
11707 saved_num_template_parameter_lists
11708 = parser->num_template_parameter_lists;
11709 parser->num_template_parameter_lists = 0;
11711 /* Parse the parameter-declaration-clause. */
11712 params = cp_parser_parameter_declaration_clause (parser);
11714 parser->num_template_parameter_lists
11715 = saved_num_template_parameter_lists;
11717 /* If all went well, parse the cv-qualifier-seq and the
11718 exception-specification. */
11719 if (member_p || cp_parser_parse_definitely (parser))
11721 cp_cv_quals cv_quals;
11722 tree exception_specification;
11724 if (ctor_dtor_or_conv_p)
11725 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
11727 /* Consume the `)'. */
11728 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
11730 /* Parse the cv-qualifier-seq. */
11731 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11732 /* And the exception-specification. */
11733 exception_specification
11734 = cp_parser_exception_specification_opt (parser);
11736 /* Create the function-declarator. */
11737 declarator = make_call_declarator (declarator,
11740 exception_specification);
11741 /* Any subsequent parameter lists are to do with
11742 return type, so are not those of the declared
11744 parser->default_arg_ok_p = false;
11746 /* Repeat the main loop. */
11751 /* If this is the first, we can try a parenthesized
11755 bool saved_in_type_id_in_expr_p;
11757 parser->default_arg_ok_p = saved_default_arg_ok_p;
11758 parser->in_declarator_p = saved_in_declarator_p;
11760 /* Consume the `('. */
11761 cp_lexer_consume_token (parser->lexer);
11762 /* Parse the nested declarator. */
11763 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
11764 parser->in_type_id_in_expr_p = true;
11766 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
11767 /*parenthesized_p=*/NULL,
11769 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
11771 /* Expect a `)'. */
11772 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11773 declarator = cp_error_declarator;
11774 if (declarator == cp_error_declarator)
11777 goto handle_declarator;
11779 /* Otherwise, we must be done. */
11783 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11784 && token->type == CPP_OPEN_SQUARE)
11786 /* Parse an array-declarator. */
11789 if (ctor_dtor_or_conv_p)
11790 *ctor_dtor_or_conv_p = 0;
11793 parser->default_arg_ok_p = false;
11794 parser->in_declarator_p = true;
11795 /* Consume the `['. */
11796 cp_lexer_consume_token (parser->lexer);
11797 /* Peek at the next token. */
11798 token = cp_lexer_peek_token (parser->lexer);
11799 /* If the next token is `]', then there is no
11800 constant-expression. */
11801 if (token->type != CPP_CLOSE_SQUARE)
11803 bool non_constant_p;
11806 = cp_parser_constant_expression (parser,
11807 /*allow_non_constant=*/true,
11809 if (!non_constant_p)
11810 bounds = fold_non_dependent_expr (bounds);
11811 /* Normally, the array bound must be an integral constant
11812 expression. However, as an extension, we allow VLAs
11813 in function scopes. */
11814 else if (!parser->in_function_body)
11816 error ("array bound is not an integer constant");
11817 bounds = error_mark_node;
11821 bounds = NULL_TREE;
11822 /* Look for the closing `]'. */
11823 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11825 declarator = cp_error_declarator;
11829 declarator = make_array_declarator (declarator, bounds);
11831 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11833 tree qualifying_scope;
11834 tree unqualified_name;
11835 special_function_kind sfk;
11838 /* Parse a declarator-id */
11839 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
11841 cp_parser_parse_tentatively (parser);
11843 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
11844 qualifying_scope = parser->scope;
11847 if (!cp_parser_parse_definitely (parser))
11848 unqualified_name = error_mark_node;
11849 else if (unqualified_name
11850 && (qualifying_scope
11851 || (TREE_CODE (unqualified_name)
11852 != IDENTIFIER_NODE)))
11854 cp_parser_error (parser, "expected unqualified-id");
11855 unqualified_name = error_mark_node;
11859 if (!unqualified_name)
11861 if (unqualified_name == error_mark_node)
11863 declarator = cp_error_declarator;
11867 if (qualifying_scope && at_namespace_scope_p ()
11868 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
11870 /* In the declaration of a member of a template class
11871 outside of the class itself, the SCOPE will sometimes
11872 be a TYPENAME_TYPE. For example, given:
11874 template <typename T>
11875 int S<T>::R::i = 3;
11877 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11878 this context, we must resolve S<T>::R to an ordinary
11879 type, rather than a typename type.
11881 The reason we normally avoid resolving TYPENAME_TYPEs
11882 is that a specialization of `S' might render
11883 `S<T>::R' not a type. However, if `S' is
11884 specialized, then this `i' will not be used, so there
11885 is no harm in resolving the types here. */
11888 /* Resolve the TYPENAME_TYPE. */
11889 type = resolve_typename_type (qualifying_scope,
11890 /*only_current_p=*/false);
11891 /* If that failed, the declarator is invalid. */
11892 if (type == error_mark_node)
11893 error ("%<%T::%D%> is not a type",
11894 TYPE_CONTEXT (qualifying_scope),
11895 TYPE_IDENTIFIER (qualifying_scope));
11896 qualifying_scope = type;
11900 if (unqualified_name)
11904 if (qualifying_scope
11905 && CLASS_TYPE_P (qualifying_scope))
11906 class_type = qualifying_scope;
11908 class_type = current_class_type;
11910 if (TREE_CODE (unqualified_name) == TYPE_DECL)
11912 tree name_type = TREE_TYPE (unqualified_name);
11913 if (class_type && same_type_p (name_type, class_type))
11915 if (qualifying_scope
11916 && CLASSTYPE_USE_TEMPLATE (name_type))
11918 error ("invalid use of constructor as a template");
11919 inform ("use %<%T::%D%> instead of %<%T::%D%> to "
11920 "name the constructor in a qualified name",
11922 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11923 class_type, name_type);
11924 declarator = cp_error_declarator;
11928 unqualified_name = constructor_name (class_type);
11932 /* We do not attempt to print the declarator
11933 here because we do not have enough
11934 information about its original syntactic
11936 cp_parser_error (parser, "invalid declarator");
11937 declarator = cp_error_declarator;
11944 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11945 sfk = sfk_destructor;
11946 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11947 sfk = sfk_conversion;
11948 else if (/* There's no way to declare a constructor
11949 for an anonymous type, even if the type
11950 got a name for linkage purposes. */
11951 !TYPE_WAS_ANONYMOUS (class_type)
11952 && constructor_name_p (unqualified_name,
11955 unqualified_name = constructor_name (class_type);
11956 sfk = sfk_constructor;
11959 if (ctor_dtor_or_conv_p && sfk != sfk_none)
11960 *ctor_dtor_or_conv_p = -1;
11963 declarator = make_id_declarator (qualifying_scope,
11966 declarator->id_loc = token->location;
11968 handle_declarator:;
11969 scope = get_scope_of_declarator (declarator);
11971 /* Any names that appear after the declarator-id for a
11972 member are looked up in the containing scope. */
11973 pushed_scope = push_scope (scope);
11974 parser->in_declarator_p = true;
11975 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11976 || (declarator && declarator->kind == cdk_id))
11977 /* Default args are only allowed on function
11979 parser->default_arg_ok_p = saved_default_arg_ok_p;
11981 parser->default_arg_ok_p = false;
11990 /* For an abstract declarator, we might wind up with nothing at this
11991 point. That's an error; the declarator is not optional. */
11993 cp_parser_error (parser, "expected declarator");
11995 /* If we entered a scope, we must exit it now. */
11997 pop_scope (pushed_scope);
11999 parser->default_arg_ok_p = saved_default_arg_ok_p;
12000 parser->in_declarator_p = saved_in_declarator_p;
12005 /* Parse a ptr-operator.
12008 * cv-qualifier-seq [opt]
12010 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
12015 & cv-qualifier-seq [opt]
12017 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
12018 Returns ADDR_EXPR if a reference was used. In the case of a
12019 pointer-to-member, *TYPE is filled in with the TYPE containing the
12020 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
12021 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
12022 ERROR_MARK if an error occurred. */
12024 static enum tree_code
12025 cp_parser_ptr_operator (cp_parser* parser,
12027 cp_cv_quals *cv_quals)
12029 enum tree_code code = ERROR_MARK;
12032 /* Assume that it's not a pointer-to-member. */
12034 /* And that there are no cv-qualifiers. */
12035 *cv_quals = TYPE_UNQUALIFIED;
12037 /* Peek at the next token. */
12038 token = cp_lexer_peek_token (parser->lexer);
12039 /* If it's a `*' or `&' we have a pointer or reference. */
12040 if (token->type == CPP_MULT || token->type == CPP_AND)
12042 /* Remember which ptr-operator we were processing. */
12043 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
12045 /* Consume the `*' or `&'. */
12046 cp_lexer_consume_token (parser->lexer);
12048 /* A `*' can be followed by a cv-qualifier-seq, and so can a
12049 `&', if we are allowing GNU extensions. (The only qualifier
12050 that can legally appear after `&' is `restrict', but that is
12051 enforced during semantic analysis. */
12052 if (code == INDIRECT_REF
12053 || cp_parser_allow_gnu_extensions_p (parser))
12054 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
12058 /* Try the pointer-to-member case. */
12059 cp_parser_parse_tentatively (parser);
12060 /* Look for the optional `::' operator. */
12061 cp_parser_global_scope_opt (parser,
12062 /*current_scope_valid_p=*/false);
12063 /* Look for the nested-name specifier. */
12064 cp_parser_nested_name_specifier (parser,
12065 /*typename_keyword_p=*/false,
12066 /*check_dependency_p=*/true,
12068 /*is_declaration=*/false);
12069 /* If we found it, and the next token is a `*', then we are
12070 indeed looking at a pointer-to-member operator. */
12071 if (!cp_parser_error_occurred (parser)
12072 && cp_parser_require (parser, CPP_MULT, "`*'"))
12074 /* Indicate that the `*' operator was used. */
12075 code = INDIRECT_REF;
12077 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
12078 error ("%qD is a namespace", parser->scope);
12081 /* The type of which the member is a member is given by the
12083 *type = parser->scope;
12084 /* The next name will not be qualified. */
12085 parser->scope = NULL_TREE;
12086 parser->qualifying_scope = NULL_TREE;
12087 parser->object_scope = NULL_TREE;
12088 /* Look for the optional cv-qualifier-seq. */
12089 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
12092 /* If that didn't work we don't have a ptr-operator. */
12093 if (!cp_parser_parse_definitely (parser))
12094 cp_parser_error (parser, "expected ptr-operator");
12100 /* Parse an (optional) cv-qualifier-seq.
12103 cv-qualifier cv-qualifier-seq [opt]
12114 Returns a bitmask representing the cv-qualifiers. */
12117 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
12119 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
12124 cp_cv_quals cv_qualifier;
12126 /* Peek at the next token. */
12127 token = cp_lexer_peek_token (parser->lexer);
12128 /* See if it's a cv-qualifier. */
12129 switch (token->keyword)
12132 cv_qualifier = TYPE_QUAL_CONST;
12136 cv_qualifier = TYPE_QUAL_VOLATILE;
12140 cv_qualifier = TYPE_QUAL_RESTRICT;
12144 cv_qualifier = TYPE_UNQUALIFIED;
12151 if (cv_quals & cv_qualifier)
12153 error ("duplicate cv-qualifier");
12154 cp_lexer_purge_token (parser->lexer);
12158 cp_lexer_consume_token (parser->lexer);
12159 cv_quals |= cv_qualifier;
12166 /* Parse a declarator-id.
12170 :: [opt] nested-name-specifier [opt] type-name
12172 In the `id-expression' case, the value returned is as for
12173 cp_parser_id_expression if the id-expression was an unqualified-id.
12174 If the id-expression was a qualified-id, then a SCOPE_REF is
12175 returned. The first operand is the scope (either a NAMESPACE_DECL
12176 or TREE_TYPE), but the second is still just a representation of an
12180 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
12183 /* The expression must be an id-expression. Assume that qualified
12184 names are the names of types so that:
12187 int S<T>::R::i = 3;
12189 will work; we must treat `S<T>::R' as the name of a type.
12190 Similarly, assume that qualified names are templates, where
12194 int S<T>::R<T>::i = 3;
12197 id = cp_parser_id_expression (parser,
12198 /*template_keyword_p=*/false,
12199 /*check_dependency_p=*/false,
12200 /*template_p=*/NULL,
12201 /*declarator_p=*/true,
12203 if (id && BASELINK_P (id))
12204 id = BASELINK_FUNCTIONS (id);
12208 /* Parse a type-id.
12211 type-specifier-seq abstract-declarator [opt]
12213 Returns the TYPE specified. */
12216 cp_parser_type_id (cp_parser* parser)
12218 cp_decl_specifier_seq type_specifier_seq;
12219 cp_declarator *abstract_declarator;
12221 /* Parse the type-specifier-seq. */
12222 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
12223 &type_specifier_seq);
12224 if (type_specifier_seq.type == error_mark_node)
12225 return error_mark_node;
12227 /* There might or might not be an abstract declarator. */
12228 cp_parser_parse_tentatively (parser);
12229 /* Look for the declarator. */
12230 abstract_declarator
12231 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
12232 /*parenthesized_p=*/NULL,
12233 /*member_p=*/false);
12234 /* Check to see if there really was a declarator. */
12235 if (!cp_parser_parse_definitely (parser))
12236 abstract_declarator = NULL;
12238 return groktypename (&type_specifier_seq, abstract_declarator);
12241 /* Parse a type-specifier-seq.
12243 type-specifier-seq:
12244 type-specifier type-specifier-seq [opt]
12248 type-specifier-seq:
12249 attributes type-specifier-seq [opt]
12251 If IS_CONDITION is true, we are at the start of a "condition",
12252 e.g., we've just seen "if (".
12254 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
12257 cp_parser_type_specifier_seq (cp_parser* parser,
12259 cp_decl_specifier_seq *type_specifier_seq)
12261 bool seen_type_specifier = false;
12262 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
12264 /* Clear the TYPE_SPECIFIER_SEQ. */
12265 clear_decl_specs (type_specifier_seq);
12267 /* Parse the type-specifiers and attributes. */
12270 tree type_specifier;
12271 bool is_cv_qualifier;
12273 /* Check for attributes first. */
12274 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
12276 type_specifier_seq->attributes =
12277 chainon (type_specifier_seq->attributes,
12278 cp_parser_attributes_opt (parser));
12282 /* Look for the type-specifier. */
12283 type_specifier = cp_parser_type_specifier (parser,
12285 type_specifier_seq,
12286 /*is_declaration=*/false,
12289 if (!type_specifier)
12291 /* If the first type-specifier could not be found, this is not a
12292 type-specifier-seq at all. */
12293 if (!seen_type_specifier)
12295 cp_parser_error (parser, "expected type-specifier");
12296 type_specifier_seq->type = error_mark_node;
12299 /* If subsequent type-specifiers could not be found, the
12300 type-specifier-seq is complete. */
12304 seen_type_specifier = true;
12305 /* The standard says that a condition can be:
12307 type-specifier-seq declarator = assignment-expression
12314 we should treat the "S" as a declarator, not as a
12315 type-specifier. The standard doesn't say that explicitly for
12316 type-specifier-seq, but it does say that for
12317 decl-specifier-seq in an ordinary declaration. Perhaps it
12318 would be clearer just to allow a decl-specifier-seq here, and
12319 then add a semantic restriction that if any decl-specifiers
12320 that are not type-specifiers appear, the program is invalid. */
12321 if (is_condition && !is_cv_qualifier)
12322 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
12325 cp_parser_check_decl_spec (type_specifier_seq);
12328 /* Parse a parameter-declaration-clause.
12330 parameter-declaration-clause:
12331 parameter-declaration-list [opt] ... [opt]
12332 parameter-declaration-list , ...
12334 Returns a representation for the parameter declarations. A return
12335 value of NULL indicates a parameter-declaration-clause consisting
12336 only of an ellipsis. */
12338 static cp_parameter_declarator *
12339 cp_parser_parameter_declaration_clause (cp_parser* parser)
12341 cp_parameter_declarator *parameters;
12346 /* Peek at the next token. */
12347 token = cp_lexer_peek_token (parser->lexer);
12348 /* Check for trivial parameter-declaration-clauses. */
12349 if (token->type == CPP_ELLIPSIS)
12351 /* Consume the `...' token. */
12352 cp_lexer_consume_token (parser->lexer);
12355 else if (token->type == CPP_CLOSE_PAREN)
12356 /* There are no parameters. */
12358 #ifndef NO_IMPLICIT_EXTERN_C
12359 if (in_system_header && current_class_type == NULL
12360 && current_lang_name == lang_name_c)
12364 return no_parameters;
12366 /* Check for `(void)', too, which is a special case. */
12367 else if (token->keyword == RID_VOID
12368 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
12369 == CPP_CLOSE_PAREN))
12371 /* Consume the `void' token. */
12372 cp_lexer_consume_token (parser->lexer);
12373 /* There are no parameters. */
12374 return no_parameters;
12377 /* Parse the parameter-declaration-list. */
12378 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
12379 /* If a parse error occurred while parsing the
12380 parameter-declaration-list, then the entire
12381 parameter-declaration-clause is erroneous. */
12385 /* Peek at the next token. */
12386 token = cp_lexer_peek_token (parser->lexer);
12387 /* If it's a `,', the clause should terminate with an ellipsis. */
12388 if (token->type == CPP_COMMA)
12390 /* Consume the `,'. */
12391 cp_lexer_consume_token (parser->lexer);
12392 /* Expect an ellipsis. */
12394 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
12396 /* It might also be `...' if the optional trailing `,' was
12398 else if (token->type == CPP_ELLIPSIS)
12400 /* Consume the `...' token. */
12401 cp_lexer_consume_token (parser->lexer);
12402 /* And remember that we saw it. */
12406 ellipsis_p = false;
12408 /* Finish the parameter list. */
12409 if (parameters && ellipsis_p)
12410 parameters->ellipsis_p = true;
12415 /* Parse a parameter-declaration-list.
12417 parameter-declaration-list:
12418 parameter-declaration
12419 parameter-declaration-list , parameter-declaration
12421 Returns a representation of the parameter-declaration-list, as for
12422 cp_parser_parameter_declaration_clause. However, the
12423 `void_list_node' is never appended to the list. Upon return,
12424 *IS_ERROR will be true iff an error occurred. */
12426 static cp_parameter_declarator *
12427 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
12429 cp_parameter_declarator *parameters = NULL;
12430 cp_parameter_declarator **tail = ¶meters;
12431 bool saved_in_unbraced_linkage_specification_p;
12433 /* Assume all will go well. */
12435 /* The special considerations that apply to a function within an
12436 unbraced linkage specifications do not apply to the parameters
12437 to the function. */
12438 saved_in_unbraced_linkage_specification_p
12439 = parser->in_unbraced_linkage_specification_p;
12440 parser->in_unbraced_linkage_specification_p = false;
12442 /* Look for more parameters. */
12445 cp_parameter_declarator *parameter;
12446 bool parenthesized_p;
12447 /* Parse the parameter. */
12449 = cp_parser_parameter_declaration (parser,
12450 /*template_parm_p=*/false,
12453 /* If a parse error occurred parsing the parameter declaration,
12454 then the entire parameter-declaration-list is erroneous. */
12461 /* Add the new parameter to the list. */
12463 tail = ¶meter->next;
12465 /* Peek at the next token. */
12466 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
12467 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
12468 /* These are for Objective-C++ */
12469 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
12470 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
12471 /* The parameter-declaration-list is complete. */
12473 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12477 /* Peek at the next token. */
12478 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12479 /* If it's an ellipsis, then the list is complete. */
12480 if (token->type == CPP_ELLIPSIS)
12482 /* Otherwise, there must be more parameters. Consume the
12484 cp_lexer_consume_token (parser->lexer);
12485 /* When parsing something like:
12487 int i(float f, double d)
12489 we can tell after seeing the declaration for "f" that we
12490 are not looking at an initialization of a variable "i",
12491 but rather at the declaration of a function "i".
12493 Due to the fact that the parsing of template arguments
12494 (as specified to a template-id) requires backtracking we
12495 cannot use this technique when inside a template argument
12497 if (!parser->in_template_argument_list_p
12498 && !parser->in_type_id_in_expr_p
12499 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12500 /* However, a parameter-declaration of the form
12501 "foat(f)" (which is a valid declaration of a
12502 parameter "f") can also be interpreted as an
12503 expression (the conversion of "f" to "float"). */
12504 && !parenthesized_p)
12505 cp_parser_commit_to_tentative_parse (parser);
12509 cp_parser_error (parser, "expected %<,%> or %<...%>");
12510 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
12511 cp_parser_skip_to_closing_parenthesis (parser,
12512 /*recovering=*/true,
12513 /*or_comma=*/false,
12514 /*consume_paren=*/false);
12519 parser->in_unbraced_linkage_specification_p
12520 = saved_in_unbraced_linkage_specification_p;
12525 /* Parse a parameter declaration.
12527 parameter-declaration:
12528 decl-specifier-seq declarator
12529 decl-specifier-seq declarator = assignment-expression
12530 decl-specifier-seq abstract-declarator [opt]
12531 decl-specifier-seq abstract-declarator [opt] = assignment-expression
12533 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
12534 declares a template parameter. (In that case, a non-nested `>'
12535 token encountered during the parsing of the assignment-expression
12536 is not interpreted as a greater-than operator.)
12538 Returns a representation of the parameter, or NULL if an error
12539 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
12540 true iff the declarator is of the form "(p)". */
12542 static cp_parameter_declarator *
12543 cp_parser_parameter_declaration (cp_parser *parser,
12544 bool template_parm_p,
12545 bool *parenthesized_p)
12547 int declares_class_or_enum;
12548 bool greater_than_is_operator_p;
12549 cp_decl_specifier_seq decl_specifiers;
12550 cp_declarator *declarator;
12551 tree default_argument;
12553 const char *saved_message;
12555 /* In a template parameter, `>' is not an operator.
12559 When parsing a default template-argument for a non-type
12560 template-parameter, the first non-nested `>' is taken as the end
12561 of the template parameter-list rather than a greater-than
12563 greater_than_is_operator_p = !template_parm_p;
12565 /* Type definitions may not appear in parameter types. */
12566 saved_message = parser->type_definition_forbidden_message;
12567 parser->type_definition_forbidden_message
12568 = "types may not be defined in parameter types";
12570 /* Parse the declaration-specifiers. */
12571 cp_parser_decl_specifier_seq (parser,
12572 CP_PARSER_FLAGS_NONE,
12574 &declares_class_or_enum);
12575 /* If an error occurred, there's no reason to attempt to parse the
12576 rest of the declaration. */
12577 if (cp_parser_error_occurred (parser))
12579 parser->type_definition_forbidden_message = saved_message;
12583 /* Peek at the next token. */
12584 token = cp_lexer_peek_token (parser->lexer);
12585 /* If the next token is a `)', `,', `=', `>', or `...', then there
12586 is no declarator. */
12587 if (token->type == CPP_CLOSE_PAREN
12588 || token->type == CPP_COMMA
12589 || token->type == CPP_EQ
12590 || token->type == CPP_ELLIPSIS
12591 || token->type == CPP_GREATER)
12594 if (parenthesized_p)
12595 *parenthesized_p = false;
12597 /* Otherwise, there should be a declarator. */
12600 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
12601 parser->default_arg_ok_p = false;
12603 /* After seeing a decl-specifier-seq, if the next token is not a
12604 "(", there is no possibility that the code is a valid
12605 expression. Therefore, if parsing tentatively, we commit at
12607 if (!parser->in_template_argument_list_p
12608 /* In an expression context, having seen:
12612 we cannot be sure whether we are looking at a
12613 function-type (taking a "char" as a parameter) or a cast
12614 of some object of type "char" to "int". */
12615 && !parser->in_type_id_in_expr_p
12616 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12617 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
12618 cp_parser_commit_to_tentative_parse (parser);
12619 /* Parse the declarator. */
12620 declarator = cp_parser_declarator (parser,
12621 CP_PARSER_DECLARATOR_EITHER,
12622 /*ctor_dtor_or_conv_p=*/NULL,
12624 /*member_p=*/false);
12625 parser->default_arg_ok_p = saved_default_arg_ok_p;
12626 /* After the declarator, allow more attributes. */
12627 decl_specifiers.attributes
12628 = chainon (decl_specifiers.attributes,
12629 cp_parser_attributes_opt (parser));
12632 /* The restriction on defining new types applies only to the type
12633 of the parameter, not to the default argument. */
12634 parser->type_definition_forbidden_message = saved_message;
12636 /* If the next token is `=', then process a default argument. */
12637 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12639 bool saved_greater_than_is_operator_p;
12640 /* Consume the `='. */
12641 cp_lexer_consume_token (parser->lexer);
12643 /* If we are defining a class, then the tokens that make up the
12644 default argument must be saved and processed later. */
12645 if (!template_parm_p && at_class_scope_p ()
12646 && TYPE_BEING_DEFINED (current_class_type))
12648 unsigned depth = 0;
12649 cp_token *first_token;
12652 /* Add tokens until we have processed the entire default
12653 argument. We add the range [first_token, token). */
12654 first_token = cp_lexer_peek_token (parser->lexer);
12659 /* Peek at the next token. */
12660 token = cp_lexer_peek_token (parser->lexer);
12661 /* What we do depends on what token we have. */
12662 switch (token->type)
12664 /* In valid code, a default argument must be
12665 immediately followed by a `,' `)', or `...'. */
12667 case CPP_CLOSE_PAREN:
12669 /* If we run into a non-nested `;', `}', or `]',
12670 then the code is invalid -- but the default
12671 argument is certainly over. */
12672 case CPP_SEMICOLON:
12673 case CPP_CLOSE_BRACE:
12674 case CPP_CLOSE_SQUARE:
12677 /* Update DEPTH, if necessary. */
12678 else if (token->type == CPP_CLOSE_PAREN
12679 || token->type == CPP_CLOSE_BRACE
12680 || token->type == CPP_CLOSE_SQUARE)
12684 case CPP_OPEN_PAREN:
12685 case CPP_OPEN_SQUARE:
12686 case CPP_OPEN_BRACE:
12691 /* If we see a non-nested `>', and `>' is not an
12692 operator, then it marks the end of the default
12694 if (!depth && !greater_than_is_operator_p)
12698 /* If we run out of tokens, issue an error message. */
12700 case CPP_PRAGMA_EOL:
12701 error ("file ends in default argument");
12707 /* In these cases, we should look for template-ids.
12708 For example, if the default argument is
12709 `X<int, double>()', we need to do name lookup to
12710 figure out whether or not `X' is a template; if
12711 so, the `,' does not end the default argument.
12713 That is not yet done. */
12720 /* If we've reached the end, stop. */
12724 /* Add the token to the token block. */
12725 token = cp_lexer_consume_token (parser->lexer);
12728 /* Create a DEFAULT_ARG to represented the unparsed default
12730 default_argument = make_node (DEFAULT_ARG);
12731 DEFARG_TOKENS (default_argument)
12732 = cp_token_cache_new (first_token, token);
12733 DEFARG_INSTANTIATIONS (default_argument) = NULL;
12735 /* Outside of a class definition, we can just parse the
12736 assignment-expression. */
12739 bool saved_local_variables_forbidden_p;
12741 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
12743 saved_greater_than_is_operator_p
12744 = parser->greater_than_is_operator_p;
12745 parser->greater_than_is_operator_p = greater_than_is_operator_p;
12746 /* Local variable names (and the `this' keyword) may not
12747 appear in a default argument. */
12748 saved_local_variables_forbidden_p
12749 = parser->local_variables_forbidden_p;
12750 parser->local_variables_forbidden_p = true;
12751 /* The default argument expression may cause implicitly
12752 defined member functions to be synthesized, which will
12753 result in garbage collection. We must treat this
12754 situation as if we were within the body of function so as
12755 to avoid collecting live data on the stack. */
12757 /* Parse the assignment-expression. */
12758 if (template_parm_p)
12759 push_deferring_access_checks (dk_no_deferred);
12761 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
12762 if (template_parm_p)
12763 pop_deferring_access_checks ();
12764 /* Restore saved state. */
12766 parser->greater_than_is_operator_p
12767 = saved_greater_than_is_operator_p;
12768 parser->local_variables_forbidden_p
12769 = saved_local_variables_forbidden_p;
12771 if (!parser->default_arg_ok_p)
12773 if (!flag_pedantic_errors)
12774 warning (0, "deprecated use of default argument for parameter of non-function");
12777 error ("default arguments are only permitted for function parameters");
12778 default_argument = NULL_TREE;
12783 default_argument = NULL_TREE;
12785 return make_parameter_declarator (&decl_specifiers,
12790 /* Parse a function-body.
12793 compound_statement */
12796 cp_parser_function_body (cp_parser *parser)
12798 cp_parser_compound_statement (parser, NULL, false);
12801 /* Parse a ctor-initializer-opt followed by a function-body. Return
12802 true if a ctor-initializer was present. */
12805 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
12808 bool ctor_initializer_p;
12810 /* Begin the function body. */
12811 body = begin_function_body ();
12812 /* Parse the optional ctor-initializer. */
12813 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
12814 /* Parse the function-body. */
12815 cp_parser_function_body (parser);
12816 /* Finish the function body. */
12817 finish_function_body (body);
12819 return ctor_initializer_p;
12822 /* Parse an initializer.
12825 = initializer-clause
12826 ( expression-list )
12828 Returns an expression representing the initializer. If no
12829 initializer is present, NULL_TREE is returned.
12831 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
12832 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
12833 set to FALSE if there is no initializer present. If there is an
12834 initializer, and it is not a constant-expression, *NON_CONSTANT_P
12835 is set to true; otherwise it is set to false. */
12838 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
12839 bool* non_constant_p)
12844 /* Peek at the next token. */
12845 token = cp_lexer_peek_token (parser->lexer);
12847 /* Let our caller know whether or not this initializer was
12849 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
12850 /* Assume that the initializer is constant. */
12851 *non_constant_p = false;
12853 if (token->type == CPP_EQ)
12855 /* Consume the `='. */
12856 cp_lexer_consume_token (parser->lexer);
12857 /* Parse the initializer-clause. */
12858 init = cp_parser_initializer_clause (parser, non_constant_p);
12860 else if (token->type == CPP_OPEN_PAREN)
12861 init = cp_parser_parenthesized_expression_list (parser, false,
12866 /* Anything else is an error. */
12867 cp_parser_error (parser, "expected initializer");
12868 init = error_mark_node;
12874 /* Parse an initializer-clause.
12876 initializer-clause:
12877 assignment-expression
12878 { initializer-list , [opt] }
12881 Returns an expression representing the initializer.
12883 If the `assignment-expression' production is used the value
12884 returned is simply a representation for the expression.
12886 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12887 the elements of the initializer-list (or NULL, if the last
12888 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12889 NULL_TREE. There is no way to detect whether or not the optional
12890 trailing `,' was provided. NON_CONSTANT_P is as for
12891 cp_parser_initializer. */
12894 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
12898 /* Assume the expression is constant. */
12899 *non_constant_p = false;
12901 /* If it is not a `{', then we are looking at an
12902 assignment-expression. */
12903 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12906 = cp_parser_constant_expression (parser,
12907 /*allow_non_constant_p=*/true,
12909 if (!*non_constant_p)
12910 initializer = fold_non_dependent_expr (initializer);
12914 /* Consume the `{' token. */
12915 cp_lexer_consume_token (parser->lexer);
12916 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12917 initializer = make_node (CONSTRUCTOR);
12918 /* If it's not a `}', then there is a non-trivial initializer. */
12919 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12921 /* Parse the initializer list. */
12922 CONSTRUCTOR_ELTS (initializer)
12923 = cp_parser_initializer_list (parser, non_constant_p);
12924 /* A trailing `,' token is allowed. */
12925 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12926 cp_lexer_consume_token (parser->lexer);
12928 /* Now, there should be a trailing `}'. */
12929 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12932 return initializer;
12935 /* Parse an initializer-list.
12939 initializer-list , initializer-clause
12944 identifier : initializer-clause
12945 initializer-list, identifier : initializer-clause
12947 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
12948 for the initializer. If the INDEX of the elt is non-NULL, it is the
12949 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12950 as for cp_parser_initializer. */
12952 static VEC(constructor_elt,gc) *
12953 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12955 VEC(constructor_elt,gc) *v = NULL;
12957 /* Assume all of the expressions are constant. */
12958 *non_constant_p = false;
12960 /* Parse the rest of the list. */
12966 bool clause_non_constant_p;
12968 /* If the next token is an identifier and the following one is a
12969 colon, we are looking at the GNU designated-initializer
12971 if (cp_parser_allow_gnu_extensions_p (parser)
12972 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12973 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12975 /* Warn the user that they are using an extension. */
12977 pedwarn ("ISO C++ does not allow designated initializers");
12978 /* Consume the identifier. */
12979 identifier = cp_lexer_consume_token (parser->lexer)->u.value;
12980 /* Consume the `:'. */
12981 cp_lexer_consume_token (parser->lexer);
12984 identifier = NULL_TREE;
12986 /* Parse the initializer. */
12987 initializer = cp_parser_initializer_clause (parser,
12988 &clause_non_constant_p);
12989 /* If any clause is non-constant, so is the entire initializer. */
12990 if (clause_non_constant_p)
12991 *non_constant_p = true;
12993 /* Add it to the vector. */
12994 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
12996 /* If the next token is not a comma, we have reached the end of
12998 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13001 /* Peek at the next token. */
13002 token = cp_lexer_peek_nth_token (parser->lexer, 2);
13003 /* If the next token is a `}', then we're still done. An
13004 initializer-clause can have a trailing `,' after the
13005 initializer-list and before the closing `}'. */
13006 if (token->type == CPP_CLOSE_BRACE)
13009 /* Consume the `,' token. */
13010 cp_lexer_consume_token (parser->lexer);
13016 /* Classes [gram.class] */
13018 /* Parse a class-name.
13024 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
13025 to indicate that names looked up in dependent types should be
13026 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
13027 keyword has been used to indicate that the name that appears next
13028 is a template. TAG_TYPE indicates the explicit tag given before
13029 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
13030 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
13031 is the class being defined in a class-head.
13033 Returns the TYPE_DECL representing the class. */
13036 cp_parser_class_name (cp_parser *parser,
13037 bool typename_keyword_p,
13038 bool template_keyword_p,
13039 enum tag_types tag_type,
13040 bool check_dependency_p,
13042 bool is_declaration)
13049 /* All class-names start with an identifier. */
13050 token = cp_lexer_peek_token (parser->lexer);
13051 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
13053 cp_parser_error (parser, "expected class-name");
13054 return error_mark_node;
13057 /* PARSER->SCOPE can be cleared when parsing the template-arguments
13058 to a template-id, so we save it here. */
13059 scope = parser->scope;
13060 if (scope == error_mark_node)
13061 return error_mark_node;
13063 /* Any name names a type if we're following the `typename' keyword
13064 in a qualified name where the enclosing scope is type-dependent. */
13065 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
13066 && dependent_type_p (scope));
13067 /* Handle the common case (an identifier, but not a template-id)
13069 if (token->type == CPP_NAME
13070 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
13072 cp_token *identifier_token;
13076 /* Look for the identifier. */
13077 identifier_token = cp_lexer_peek_token (parser->lexer);
13078 ambiguous_p = identifier_token->ambiguous_p;
13079 identifier = cp_parser_identifier (parser);
13080 /* If the next token isn't an identifier, we are certainly not
13081 looking at a class-name. */
13082 if (identifier == error_mark_node)
13083 decl = error_mark_node;
13084 /* If we know this is a type-name, there's no need to look it
13086 else if (typename_p)
13090 tree ambiguous_decls;
13091 /* If we already know that this lookup is ambiguous, then
13092 we've already issued an error message; there's no reason
13096 cp_parser_simulate_error (parser);
13097 return error_mark_node;
13099 /* If the next token is a `::', then the name must be a type
13102 [basic.lookup.qual]
13104 During the lookup for a name preceding the :: scope
13105 resolution operator, object, function, and enumerator
13106 names are ignored. */
13107 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
13108 tag_type = typename_type;
13109 /* Look up the name. */
13110 decl = cp_parser_lookup_name (parser, identifier,
13112 /*is_template=*/false,
13113 /*is_namespace=*/false,
13114 check_dependency_p,
13116 if (ambiguous_decls)
13118 error ("reference to %qD is ambiguous", identifier);
13119 print_candidates (ambiguous_decls);
13120 if (cp_parser_parsing_tentatively (parser))
13122 identifier_token->ambiguous_p = true;
13123 cp_parser_simulate_error (parser);
13125 return error_mark_node;
13131 /* Try a template-id. */
13132 decl = cp_parser_template_id (parser, template_keyword_p,
13133 check_dependency_p,
13135 if (decl == error_mark_node)
13136 return error_mark_node;
13139 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
13141 /* If this is a typename, create a TYPENAME_TYPE. */
13142 if (typename_p && decl != error_mark_node)
13144 decl = make_typename_type (scope, decl, typename_type,
13145 /*complain=*/tf_error);
13146 if (decl != error_mark_node)
13147 decl = TYPE_NAME (decl);
13150 /* Check to see that it is really the name of a class. */
13151 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
13152 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
13153 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
13154 /* Situations like this:
13156 template <typename T> struct A {
13157 typename T::template X<int>::I i;
13160 are problematic. Is `T::template X<int>' a class-name? The
13161 standard does not seem to be definitive, but there is no other
13162 valid interpretation of the following `::'. Therefore, those
13163 names are considered class-names. */
13165 decl = make_typename_type (scope, decl, tag_type, tf_error);
13166 if (decl != error_mark_node)
13167 decl = TYPE_NAME (decl);
13169 else if (TREE_CODE (decl) != TYPE_DECL
13170 || TREE_TYPE (decl) == error_mark_node
13171 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
13172 decl = error_mark_node;
13174 if (decl == error_mark_node)
13175 cp_parser_error (parser, "expected class-name");
13180 /* Parse a class-specifier.
13183 class-head { member-specification [opt] }
13185 Returns the TREE_TYPE representing the class. */
13188 cp_parser_class_specifier (cp_parser* parser)
13192 tree attributes = NULL_TREE;
13193 int has_trailing_semicolon;
13194 bool nested_name_specifier_p;
13195 unsigned saved_num_template_parameter_lists;
13196 bool saved_in_function_body;
13197 tree old_scope = NULL_TREE;
13198 tree scope = NULL_TREE;
13201 push_deferring_access_checks (dk_no_deferred);
13203 /* Parse the class-head. */
13204 type = cp_parser_class_head (parser,
13205 &nested_name_specifier_p,
13208 /* If the class-head was a semantic disaster, skip the entire body
13212 cp_parser_skip_to_end_of_block_or_statement (parser);
13213 pop_deferring_access_checks ();
13214 return error_mark_node;
13217 /* Look for the `{'. */
13218 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
13220 pop_deferring_access_checks ();
13221 return error_mark_node;
13224 /* Process the base classes. If they're invalid, skip the
13225 entire class body. */
13226 if (!xref_basetypes (type, bases))
13228 cp_parser_skip_to_closing_brace (parser);
13230 /* Consuming the closing brace yields better error messages
13232 cp_lexer_consume_token (parser->lexer);
13233 pop_deferring_access_checks ();
13234 return error_mark_node;
13237 /* Issue an error message if type-definitions are forbidden here. */
13238 cp_parser_check_type_definition (parser);
13239 /* Remember that we are defining one more class. */
13240 ++parser->num_classes_being_defined;
13241 /* Inside the class, surrounding template-parameter-lists do not
13243 saved_num_template_parameter_lists
13244 = parser->num_template_parameter_lists;
13245 parser->num_template_parameter_lists = 0;
13246 /* We are not in a function body. */
13247 saved_in_function_body = parser->in_function_body;
13248 parser->in_function_body = false;
13250 /* Start the class. */
13251 if (nested_name_specifier_p)
13253 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
13254 old_scope = push_inner_scope (scope);
13256 type = begin_class_definition (type, attributes);
13258 if (type == error_mark_node)
13259 /* If the type is erroneous, skip the entire body of the class. */
13260 cp_parser_skip_to_closing_brace (parser);
13262 /* Parse the member-specification. */
13263 cp_parser_member_specification_opt (parser);
13265 /* Look for the trailing `}'. */
13266 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13267 /* We get better error messages by noticing a common problem: a
13268 missing trailing `;'. */
13269 token = cp_lexer_peek_token (parser->lexer);
13270 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
13271 /* Look for trailing attributes to apply to this class. */
13272 if (cp_parser_allow_gnu_extensions_p (parser))
13273 attributes = cp_parser_attributes_opt (parser);
13274 if (type != error_mark_node)
13275 type = finish_struct (type, attributes);
13276 if (nested_name_specifier_p)
13277 pop_inner_scope (old_scope, scope);
13278 /* If this class is not itself within the scope of another class,
13279 then we need to parse the bodies of all of the queued function
13280 definitions. Note that the queued functions defined in a class
13281 are not always processed immediately following the
13282 class-specifier for that class. Consider:
13285 struct B { void f() { sizeof (A); } };
13288 If `f' were processed before the processing of `A' were
13289 completed, there would be no way to compute the size of `A'.
13290 Note that the nesting we are interested in here is lexical --
13291 not the semantic nesting given by TYPE_CONTEXT. In particular,
13294 struct A { struct B; };
13295 struct A::B { void f() { } };
13297 there is no need to delay the parsing of `A::B::f'. */
13298 if (--parser->num_classes_being_defined == 0)
13302 tree class_type = NULL_TREE;
13303 tree pushed_scope = NULL_TREE;
13305 /* In a first pass, parse default arguments to the functions.
13306 Then, in a second pass, parse the bodies of the functions.
13307 This two-phased approach handles cases like:
13315 for (TREE_PURPOSE (parser->unparsed_functions_queues)
13316 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
13317 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
13318 TREE_PURPOSE (parser->unparsed_functions_queues)
13319 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
13321 fn = TREE_VALUE (queue_entry);
13322 /* If there are default arguments that have not yet been processed,
13323 take care of them now. */
13324 if (class_type != TREE_PURPOSE (queue_entry))
13327 pop_scope (pushed_scope);
13328 class_type = TREE_PURPOSE (queue_entry);
13329 pushed_scope = push_scope (class_type);
13331 /* Make sure that any template parameters are in scope. */
13332 maybe_begin_member_template_processing (fn);
13333 /* Parse the default argument expressions. */
13334 cp_parser_late_parsing_default_args (parser, fn);
13335 /* Remove any template parameters from the symbol table. */
13336 maybe_end_member_template_processing ();
13339 pop_scope (pushed_scope);
13340 /* Now parse the body of the functions. */
13341 for (TREE_VALUE (parser->unparsed_functions_queues)
13342 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
13343 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
13344 TREE_VALUE (parser->unparsed_functions_queues)
13345 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
13347 /* Figure out which function we need to process. */
13348 fn = TREE_VALUE (queue_entry);
13349 /* Parse the function. */
13350 cp_parser_late_parsing_for_member (parser, fn);
13354 /* Put back any saved access checks. */
13355 pop_deferring_access_checks ();
13357 /* Restore saved state. */
13358 parser->in_function_body = saved_in_function_body;
13359 parser->num_template_parameter_lists
13360 = saved_num_template_parameter_lists;
13365 /* Parse a class-head.
13368 class-key identifier [opt] base-clause [opt]
13369 class-key nested-name-specifier identifier base-clause [opt]
13370 class-key nested-name-specifier [opt] template-id
13374 class-key attributes identifier [opt] base-clause [opt]
13375 class-key attributes nested-name-specifier identifier base-clause [opt]
13376 class-key attributes nested-name-specifier [opt] template-id
13379 Returns the TYPE of the indicated class. Sets
13380 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
13381 involving a nested-name-specifier was used, and FALSE otherwise.
13383 Returns error_mark_node if this is not a class-head.
13385 Returns NULL_TREE if the class-head is syntactically valid, but
13386 semantically invalid in a way that means we should skip the entire
13387 body of the class. */
13390 cp_parser_class_head (cp_parser* parser,
13391 bool* nested_name_specifier_p,
13392 tree *attributes_p,
13395 tree nested_name_specifier;
13396 enum tag_types class_key;
13397 tree id = NULL_TREE;
13398 tree type = NULL_TREE;
13400 bool template_id_p = false;
13401 bool qualified_p = false;
13402 bool invalid_nested_name_p = false;
13403 bool invalid_explicit_specialization_p = false;
13404 tree pushed_scope = NULL_TREE;
13405 unsigned num_templates;
13407 /* Assume no nested-name-specifier will be present. */
13408 *nested_name_specifier_p = false;
13409 /* Assume no template parameter lists will be used in defining the
13413 /* Look for the class-key. */
13414 class_key = cp_parser_class_key (parser);
13415 if (class_key == none_type)
13416 return error_mark_node;
13418 /* Parse the attributes. */
13419 attributes = cp_parser_attributes_opt (parser);
13421 /* If the next token is `::', that is invalid -- but sometimes
13422 people do try to write:
13426 Handle this gracefully by accepting the extra qualifier, and then
13427 issuing an error about it later if this really is a
13428 class-head. If it turns out just to be an elaborated type
13429 specifier, remain silent. */
13430 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
13431 qualified_p = true;
13433 push_deferring_access_checks (dk_no_check);
13435 /* Determine the name of the class. Begin by looking for an
13436 optional nested-name-specifier. */
13437 nested_name_specifier
13438 = cp_parser_nested_name_specifier_opt (parser,
13439 /*typename_keyword_p=*/false,
13440 /*check_dependency_p=*/false,
13442 /*is_declaration=*/false);
13443 /* If there was a nested-name-specifier, then there *must* be an
13445 if (nested_name_specifier)
13447 /* Although the grammar says `identifier', it really means
13448 `class-name' or `template-name'. You are only allowed to
13449 define a class that has already been declared with this
13452 The proposed resolution for Core Issue 180 says that wherever
13453 you see `class T::X' you should treat `X' as a type-name.
13455 It is OK to define an inaccessible class; for example:
13457 class A { class B; };
13460 We do not know if we will see a class-name, or a
13461 template-name. We look for a class-name first, in case the
13462 class-name is a template-id; if we looked for the
13463 template-name first we would stop after the template-name. */
13464 cp_parser_parse_tentatively (parser);
13465 type = cp_parser_class_name (parser,
13466 /*typename_keyword_p=*/false,
13467 /*template_keyword_p=*/false,
13469 /*check_dependency_p=*/false,
13470 /*class_head_p=*/true,
13471 /*is_declaration=*/false);
13472 /* If that didn't work, ignore the nested-name-specifier. */
13473 if (!cp_parser_parse_definitely (parser))
13475 invalid_nested_name_p = true;
13476 id = cp_parser_identifier (parser);
13477 if (id == error_mark_node)
13480 /* If we could not find a corresponding TYPE, treat this
13481 declaration like an unqualified declaration. */
13482 if (type == error_mark_node)
13483 nested_name_specifier = NULL_TREE;
13484 /* Otherwise, count the number of templates used in TYPE and its
13485 containing scopes. */
13490 for (scope = TREE_TYPE (type);
13491 scope && TREE_CODE (scope) != NAMESPACE_DECL;
13492 scope = (TYPE_P (scope)
13493 ? TYPE_CONTEXT (scope)
13494 : DECL_CONTEXT (scope)))
13496 && CLASS_TYPE_P (scope)
13497 && CLASSTYPE_TEMPLATE_INFO (scope)
13498 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
13499 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
13503 /* Otherwise, the identifier is optional. */
13506 /* We don't know whether what comes next is a template-id,
13507 an identifier, or nothing at all. */
13508 cp_parser_parse_tentatively (parser);
13509 /* Check for a template-id. */
13510 id = cp_parser_template_id (parser,
13511 /*template_keyword_p=*/false,
13512 /*check_dependency_p=*/true,
13513 /*is_declaration=*/true);
13514 /* If that didn't work, it could still be an identifier. */
13515 if (!cp_parser_parse_definitely (parser))
13517 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
13518 id = cp_parser_identifier (parser);
13524 template_id_p = true;
13529 pop_deferring_access_checks ();
13532 cp_parser_check_for_invalid_template_id (parser, id);
13534 /* If it's not a `:' or a `{' then we can't really be looking at a
13535 class-head, since a class-head only appears as part of a
13536 class-specifier. We have to detect this situation before calling
13537 xref_tag, since that has irreversible side-effects. */
13538 if (!cp_parser_next_token_starts_class_definition_p (parser))
13540 cp_parser_error (parser, "expected %<{%> or %<:%>");
13541 return error_mark_node;
13544 /* At this point, we're going ahead with the class-specifier, even
13545 if some other problem occurs. */
13546 cp_parser_commit_to_tentative_parse (parser);
13547 /* Issue the error about the overly-qualified name now. */
13549 cp_parser_error (parser,
13550 "global qualification of class name is invalid");
13551 else if (invalid_nested_name_p)
13552 cp_parser_error (parser,
13553 "qualified name does not name a class");
13554 else if (nested_name_specifier)
13558 /* Reject typedef-names in class heads. */
13559 if (!DECL_IMPLICIT_TYPEDEF_P (type))
13561 error ("invalid class name in declaration of %qD", type);
13566 /* Figure out in what scope the declaration is being placed. */
13567 scope = current_scope ();
13568 /* If that scope does not contain the scope in which the
13569 class was originally declared, the program is invalid. */
13570 if (scope && !is_ancestor (scope, nested_name_specifier))
13572 error ("declaration of %qD in %qD which does not enclose %qD",
13573 type, scope, nested_name_specifier);
13579 A declarator-id shall not be qualified exception of the
13580 definition of a ... nested class outside of its class
13581 ... [or] a the definition or explicit instantiation of a
13582 class member of a namespace outside of its namespace. */
13583 if (scope == nested_name_specifier)
13585 pedwarn ("extra qualification ignored");
13586 nested_name_specifier = NULL_TREE;
13590 /* An explicit-specialization must be preceded by "template <>". If
13591 it is not, try to recover gracefully. */
13592 if (at_namespace_scope_p ()
13593 && parser->num_template_parameter_lists == 0
13596 error ("an explicit specialization must be preceded by %<template <>%>");
13597 invalid_explicit_specialization_p = true;
13598 /* Take the same action that would have been taken by
13599 cp_parser_explicit_specialization. */
13600 ++parser->num_template_parameter_lists;
13601 begin_specialization ();
13603 /* There must be no "return" statements between this point and the
13604 end of this function; set "type "to the correct return value and
13605 use "goto done;" to return. */
13606 /* Make sure that the right number of template parameters were
13608 if (!cp_parser_check_template_parameters (parser, num_templates))
13610 /* If something went wrong, there is no point in even trying to
13611 process the class-definition. */
13616 /* Look up the type. */
13619 type = TREE_TYPE (id);
13620 type = maybe_process_partial_specialization (type);
13621 if (nested_name_specifier)
13622 pushed_scope = push_scope (nested_name_specifier);
13624 else if (nested_name_specifier)
13630 template <typename T> struct S { struct T };
13631 template <typename T> struct S<T>::T { };
13633 we will get a TYPENAME_TYPE when processing the definition of
13634 `S::T'. We need to resolve it to the actual type before we
13635 try to define it. */
13636 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
13638 class_type = resolve_typename_type (TREE_TYPE (type),
13639 /*only_current_p=*/false);
13640 if (class_type != error_mark_node)
13641 type = TYPE_NAME (class_type);
13644 cp_parser_error (parser, "could not resolve typename type");
13645 type = error_mark_node;
13649 maybe_process_partial_specialization (TREE_TYPE (type));
13650 class_type = current_class_type;
13651 /* Enter the scope indicated by the nested-name-specifier. */
13652 pushed_scope = push_scope (nested_name_specifier);
13653 /* Get the canonical version of this type. */
13654 type = TYPE_MAIN_DECL (TREE_TYPE (type));
13655 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
13656 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
13658 type = push_template_decl (type);
13659 if (type == error_mark_node)
13666 type = TREE_TYPE (type);
13667 *nested_name_specifier_p = true;
13669 else /* The name is not a nested name. */
13671 /* If the class was unnamed, create a dummy name. */
13673 id = make_anon_name ();
13674 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
13675 parser->num_template_parameter_lists);
13678 /* Indicate whether this class was declared as a `class' or as a
13680 if (TREE_CODE (type) == RECORD_TYPE)
13681 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
13682 cp_parser_check_class_key (class_key, type);
13684 /* If this type was already complete, and we see another definition,
13685 that's an error. */
13686 if (type != error_mark_node && COMPLETE_TYPE_P (type))
13688 error ("redefinition of %q#T", type);
13689 error ("previous definition of %q+#T", type);
13693 else if (type == error_mark_node)
13696 /* We will have entered the scope containing the class; the names of
13697 base classes should be looked up in that context. For example:
13699 struct A { struct B {}; struct C; };
13700 struct A::C : B {};
13703 *bases = NULL_TREE;
13705 /* Get the list of base-classes, if there is one. */
13706 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
13707 *bases = cp_parser_base_clause (parser);
13710 /* Leave the scope given by the nested-name-specifier. We will
13711 enter the class scope itself while processing the members. */
13713 pop_scope (pushed_scope);
13715 if (invalid_explicit_specialization_p)
13717 end_specialization ();
13718 --parser->num_template_parameter_lists;
13720 *attributes_p = attributes;
13724 /* Parse a class-key.
13731 Returns the kind of class-key specified, or none_type to indicate
13734 static enum tag_types
13735 cp_parser_class_key (cp_parser* parser)
13738 enum tag_types tag_type;
13740 /* Look for the class-key. */
13741 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
13745 /* Check to see if the TOKEN is a class-key. */
13746 tag_type = cp_parser_token_is_class_key (token);
13748 cp_parser_error (parser, "expected class-key");
13752 /* Parse an (optional) member-specification.
13754 member-specification:
13755 member-declaration member-specification [opt]
13756 access-specifier : member-specification [opt] */
13759 cp_parser_member_specification_opt (cp_parser* parser)
13766 /* Peek at the next token. */
13767 token = cp_lexer_peek_token (parser->lexer);
13768 /* If it's a `}', or EOF then we've seen all the members. */
13769 if (token->type == CPP_CLOSE_BRACE
13770 || token->type == CPP_EOF
13771 || token->type == CPP_PRAGMA_EOL)
13774 /* See if this token is a keyword. */
13775 keyword = token->keyword;
13779 case RID_PROTECTED:
13781 /* Consume the access-specifier. */
13782 cp_lexer_consume_token (parser->lexer);
13783 /* Remember which access-specifier is active. */
13784 current_access_specifier = token->u.value;
13785 /* Look for the `:'. */
13786 cp_parser_require (parser, CPP_COLON, "`:'");
13790 /* Accept #pragmas at class scope. */
13791 if (token->type == CPP_PRAGMA)
13793 cp_parser_pragma (parser, pragma_external);
13797 /* Otherwise, the next construction must be a
13798 member-declaration. */
13799 cp_parser_member_declaration (parser);
13804 /* Parse a member-declaration.
13806 member-declaration:
13807 decl-specifier-seq [opt] member-declarator-list [opt] ;
13808 function-definition ; [opt]
13809 :: [opt] nested-name-specifier template [opt] unqualified-id ;
13811 template-declaration
13813 member-declarator-list:
13815 member-declarator-list , member-declarator
13818 declarator pure-specifier [opt]
13819 declarator constant-initializer [opt]
13820 identifier [opt] : constant-expression
13824 member-declaration:
13825 __extension__ member-declaration
13828 declarator attributes [opt] pure-specifier [opt]
13829 declarator attributes [opt] constant-initializer [opt]
13830 identifier [opt] attributes [opt] : constant-expression
13834 member-declaration:
13835 static_assert-declaration */
13838 cp_parser_member_declaration (cp_parser* parser)
13840 cp_decl_specifier_seq decl_specifiers;
13841 tree prefix_attributes;
13843 int declares_class_or_enum;
13846 int saved_pedantic;
13848 /* Check for the `__extension__' keyword. */
13849 if (cp_parser_extension_opt (parser, &saved_pedantic))
13852 cp_parser_member_declaration (parser);
13853 /* Restore the old value of the PEDANTIC flag. */
13854 pedantic = saved_pedantic;
13859 /* Check for a template-declaration. */
13860 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13862 /* An explicit specialization here is an error condition, and we
13863 expect the specialization handler to detect and report this. */
13864 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
13865 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
13866 cp_parser_explicit_specialization (parser);
13868 cp_parser_template_declaration (parser, /*member_p=*/true);
13873 /* Check for a using-declaration. */
13874 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
13876 /* Parse the using-declaration. */
13877 cp_parser_using_declaration (parser,
13878 /*access_declaration_p=*/false);
13882 /* Check for @defs. */
13883 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
13886 tree ivar_chains = cp_parser_objc_defs_expression (parser);
13887 ivar = ivar_chains;
13891 ivar = TREE_CHAIN (member);
13892 TREE_CHAIN (member) = NULL_TREE;
13893 finish_member_declaration (member);
13898 /* If the next token is `static_assert' we have a static assertion. */
13899 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC_ASSERT))
13901 cp_parser_static_assert (parser, /*member_p=*/true);
13905 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
13908 /* Parse the decl-specifier-seq. */
13909 cp_parser_decl_specifier_seq (parser,
13910 CP_PARSER_FLAGS_OPTIONAL,
13912 &declares_class_or_enum);
13913 prefix_attributes = decl_specifiers.attributes;
13914 decl_specifiers.attributes = NULL_TREE;
13915 /* Check for an invalid type-name. */
13916 if (!decl_specifiers.type
13917 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
13919 /* If there is no declarator, then the decl-specifier-seq should
13921 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13923 /* If there was no decl-specifier-seq, and the next token is a
13924 `;', then we have something like:
13930 Each member-declaration shall declare at least one member
13931 name of the class. */
13932 if (!decl_specifiers.any_specifiers_p)
13934 cp_token *token = cp_lexer_peek_token (parser->lexer);
13935 if (pedantic && !token->in_system_header)
13936 pedwarn ("%Hextra %<;%>", &token->location);
13942 /* See if this declaration is a friend. */
13943 friend_p = cp_parser_friend_p (&decl_specifiers);
13944 /* If there were decl-specifiers, check to see if there was
13945 a class-declaration. */
13946 type = check_tag_decl (&decl_specifiers);
13947 /* Nested classes have already been added to the class, but
13948 a `friend' needs to be explicitly registered. */
13951 /* If the `friend' keyword was present, the friend must
13952 be introduced with a class-key. */
13953 if (!declares_class_or_enum)
13954 error ("a class-key must be used when declaring a friend");
13957 template <typename T> struct A {
13958 friend struct A<T>::B;
13961 A<T>::B will be represented by a TYPENAME_TYPE, and
13962 therefore not recognized by check_tag_decl. */
13964 && decl_specifiers.type
13965 && TYPE_P (decl_specifiers.type))
13966 type = decl_specifiers.type;
13967 if (!type || !TYPE_P (type))
13968 error ("friend declaration does not name a class or "
13971 make_friend_class (current_class_type, type,
13972 /*complain=*/true);
13974 /* If there is no TYPE, an error message will already have
13976 else if (!type || type == error_mark_node)
13978 /* An anonymous aggregate has to be handled specially; such
13979 a declaration really declares a data member (with a
13980 particular type), as opposed to a nested class. */
13981 else if (ANON_AGGR_TYPE_P (type))
13983 /* Remove constructors and such from TYPE, now that we
13984 know it is an anonymous aggregate. */
13985 fixup_anonymous_aggr (type);
13986 /* And make the corresponding data member. */
13987 decl = build_decl (FIELD_DECL, NULL_TREE, type);
13988 /* Add it to the class. */
13989 finish_member_declaration (decl);
13992 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
13997 /* See if these declarations will be friends. */
13998 friend_p = cp_parser_friend_p (&decl_specifiers);
14000 /* Keep going until we hit the `;' at the end of the
14002 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
14004 tree attributes = NULL_TREE;
14005 tree first_attribute;
14007 /* Peek at the next token. */
14008 token = cp_lexer_peek_token (parser->lexer);
14010 /* Check for a bitfield declaration. */
14011 if (token->type == CPP_COLON
14012 || (token->type == CPP_NAME
14013 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
14019 /* Get the name of the bitfield. Note that we cannot just
14020 check TOKEN here because it may have been invalidated by
14021 the call to cp_lexer_peek_nth_token above. */
14022 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
14023 identifier = cp_parser_identifier (parser);
14025 identifier = NULL_TREE;
14027 /* Consume the `:' token. */
14028 cp_lexer_consume_token (parser->lexer);
14029 /* Get the width of the bitfield. */
14031 = cp_parser_constant_expression (parser,
14032 /*allow_non_constant=*/false,
14035 /* Look for attributes that apply to the bitfield. */
14036 attributes = cp_parser_attributes_opt (parser);
14037 /* Remember which attributes are prefix attributes and
14039 first_attribute = attributes;
14040 /* Combine the attributes. */
14041 attributes = chainon (prefix_attributes, attributes);
14043 /* Create the bitfield declaration. */
14044 decl = grokbitfield (identifier
14045 ? make_id_declarator (NULL_TREE,
14051 /* Apply the attributes. */
14052 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
14056 cp_declarator *declarator;
14058 tree asm_specification;
14059 int ctor_dtor_or_conv_p;
14061 /* Parse the declarator. */
14063 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
14064 &ctor_dtor_or_conv_p,
14065 /*parenthesized_p=*/NULL,
14066 /*member_p=*/true);
14068 /* If something went wrong parsing the declarator, make sure
14069 that we at least consume some tokens. */
14070 if (declarator == cp_error_declarator)
14072 /* Skip to the end of the statement. */
14073 cp_parser_skip_to_end_of_statement (parser);
14074 /* If the next token is not a semicolon, that is
14075 probably because we just skipped over the body of
14076 a function. So, we consume a semicolon if
14077 present, but do not issue an error message if it
14079 if (cp_lexer_next_token_is (parser->lexer,
14081 cp_lexer_consume_token (parser->lexer);
14085 if (declares_class_or_enum & 2)
14086 cp_parser_check_for_definition_in_return_type
14087 (declarator, decl_specifiers.type);
14089 /* Look for an asm-specification. */
14090 asm_specification = cp_parser_asm_specification_opt (parser);
14091 /* Look for attributes that apply to the declaration. */
14092 attributes = cp_parser_attributes_opt (parser);
14093 /* Remember which attributes are prefix attributes and
14095 first_attribute = attributes;
14096 /* Combine the attributes. */
14097 attributes = chainon (prefix_attributes, attributes);
14099 /* If it's an `=', then we have a constant-initializer or a
14100 pure-specifier. It is not correct to parse the
14101 initializer before registering the member declaration
14102 since the member declaration should be in scope while
14103 its initializer is processed. However, the rest of the
14104 front end does not yet provide an interface that allows
14105 us to handle this correctly. */
14106 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
14110 A pure-specifier shall be used only in the declaration of
14111 a virtual function.
14113 A member-declarator can contain a constant-initializer
14114 only if it declares a static member of integral or
14117 Therefore, if the DECLARATOR is for a function, we look
14118 for a pure-specifier; otherwise, we look for a
14119 constant-initializer. When we call `grokfield', it will
14120 perform more stringent semantics checks. */
14121 if (function_declarator_p (declarator))
14122 initializer = cp_parser_pure_specifier (parser);
14124 /* Parse the initializer. */
14125 initializer = cp_parser_constant_initializer (parser);
14127 /* Otherwise, there is no initializer. */
14129 initializer = NULL_TREE;
14131 /* See if we are probably looking at a function
14132 definition. We are certainly not looking at a
14133 member-declarator. Calling `grokfield' has
14134 side-effects, so we must not do it unless we are sure
14135 that we are looking at a member-declarator. */
14136 if (cp_parser_token_starts_function_definition_p
14137 (cp_lexer_peek_token (parser->lexer)))
14139 /* The grammar does not allow a pure-specifier to be
14140 used when a member function is defined. (It is
14141 possible that this fact is an oversight in the
14142 standard, since a pure function may be defined
14143 outside of the class-specifier. */
14145 error ("pure-specifier on function-definition");
14146 decl = cp_parser_save_member_function_body (parser,
14150 /* If the member was not a friend, declare it here. */
14152 finish_member_declaration (decl);
14153 /* Peek at the next token. */
14154 token = cp_lexer_peek_token (parser->lexer);
14155 /* If the next token is a semicolon, consume it. */
14156 if (token->type == CPP_SEMICOLON)
14157 cp_lexer_consume_token (parser->lexer);
14161 /* Create the declaration. */
14162 decl = grokfield (declarator, &decl_specifiers,
14163 initializer, /*init_const_expr_p=*/true,
14168 /* Reset PREFIX_ATTRIBUTES. */
14169 while (attributes && TREE_CHAIN (attributes) != first_attribute)
14170 attributes = TREE_CHAIN (attributes);
14172 TREE_CHAIN (attributes) = NULL_TREE;
14174 /* If there is any qualification still in effect, clear it
14175 now; we will be starting fresh with the next declarator. */
14176 parser->scope = NULL_TREE;
14177 parser->qualifying_scope = NULL_TREE;
14178 parser->object_scope = NULL_TREE;
14179 /* If it's a `,', then there are more declarators. */
14180 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
14181 cp_lexer_consume_token (parser->lexer);
14182 /* If the next token isn't a `;', then we have a parse error. */
14183 else if (cp_lexer_next_token_is_not (parser->lexer,
14186 cp_parser_error (parser, "expected %<;%>");
14187 /* Skip tokens until we find a `;'. */
14188 cp_parser_skip_to_end_of_statement (parser);
14195 /* Add DECL to the list of members. */
14197 finish_member_declaration (decl);
14199 if (TREE_CODE (decl) == FUNCTION_DECL)
14200 cp_parser_save_default_args (parser, decl);
14205 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14208 /* Parse a pure-specifier.
14213 Returns INTEGER_ZERO_NODE if a pure specifier is found.
14214 Otherwise, ERROR_MARK_NODE is returned. */
14217 cp_parser_pure_specifier (cp_parser* parser)
14221 /* Look for the `=' token. */
14222 if (!cp_parser_require (parser, CPP_EQ, "`='"))
14223 return error_mark_node;
14224 /* Look for the `0' token. */
14225 token = cp_lexer_consume_token (parser->lexer);
14226 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
14227 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
14229 cp_parser_error (parser,
14230 "invalid pure specifier (only `= 0' is allowed)");
14231 cp_parser_skip_to_end_of_statement (parser);
14232 return error_mark_node;
14234 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
14236 error ("templates may not be %<virtual%>");
14237 return error_mark_node;
14240 return integer_zero_node;
14243 /* Parse a constant-initializer.
14245 constant-initializer:
14246 = constant-expression
14248 Returns a representation of the constant-expression. */
14251 cp_parser_constant_initializer (cp_parser* parser)
14253 /* Look for the `=' token. */
14254 if (!cp_parser_require (parser, CPP_EQ, "`='"))
14255 return error_mark_node;
14257 /* It is invalid to write:
14259 struct S { static const int i = { 7 }; };
14262 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14264 cp_parser_error (parser,
14265 "a brace-enclosed initializer is not allowed here");
14266 /* Consume the opening brace. */
14267 cp_lexer_consume_token (parser->lexer);
14268 /* Skip the initializer. */
14269 cp_parser_skip_to_closing_brace (parser);
14270 /* Look for the trailing `}'. */
14271 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
14273 return error_mark_node;
14276 return cp_parser_constant_expression (parser,
14277 /*allow_non_constant=*/false,
14281 /* Derived classes [gram.class.derived] */
14283 /* Parse a base-clause.
14286 : base-specifier-list
14288 base-specifier-list:
14290 base-specifier-list , base-specifier
14292 Returns a TREE_LIST representing the base-classes, in the order in
14293 which they were declared. The representation of each node is as
14294 described by cp_parser_base_specifier.
14296 In the case that no bases are specified, this function will return
14297 NULL_TREE, not ERROR_MARK_NODE. */
14300 cp_parser_base_clause (cp_parser* parser)
14302 tree bases = NULL_TREE;
14304 /* Look for the `:' that begins the list. */
14305 cp_parser_require (parser, CPP_COLON, "`:'");
14307 /* Scan the base-specifier-list. */
14313 /* Look for the base-specifier. */
14314 base = cp_parser_base_specifier (parser);
14315 /* Add BASE to the front of the list. */
14316 if (base != error_mark_node)
14318 TREE_CHAIN (base) = bases;
14321 /* Peek at the next token. */
14322 token = cp_lexer_peek_token (parser->lexer);
14323 /* If it's not a comma, then the list is complete. */
14324 if (token->type != CPP_COMMA)
14326 /* Consume the `,'. */
14327 cp_lexer_consume_token (parser->lexer);
14330 /* PARSER->SCOPE may still be non-NULL at this point, if the last
14331 base class had a qualified name. However, the next name that
14332 appears is certainly not qualified. */
14333 parser->scope = NULL_TREE;
14334 parser->qualifying_scope = NULL_TREE;
14335 parser->object_scope = NULL_TREE;
14337 return nreverse (bases);
14340 /* Parse a base-specifier.
14343 :: [opt] nested-name-specifier [opt] class-name
14344 virtual access-specifier [opt] :: [opt] nested-name-specifier
14346 access-specifier virtual [opt] :: [opt] nested-name-specifier
14349 Returns a TREE_LIST. The TREE_PURPOSE will be one of
14350 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
14351 indicate the specifiers provided. The TREE_VALUE will be a TYPE
14352 (or the ERROR_MARK_NODE) indicating the type that was specified. */
14355 cp_parser_base_specifier (cp_parser* parser)
14359 bool virtual_p = false;
14360 bool duplicate_virtual_error_issued_p = false;
14361 bool duplicate_access_error_issued_p = false;
14362 bool class_scope_p, template_p;
14363 tree access = access_default_node;
14366 /* Process the optional `virtual' and `access-specifier'. */
14369 /* Peek at the next token. */
14370 token = cp_lexer_peek_token (parser->lexer);
14371 /* Process `virtual'. */
14372 switch (token->keyword)
14375 /* If `virtual' appears more than once, issue an error. */
14376 if (virtual_p && !duplicate_virtual_error_issued_p)
14378 cp_parser_error (parser,
14379 "%<virtual%> specified more than once in base-specified");
14380 duplicate_virtual_error_issued_p = true;
14385 /* Consume the `virtual' token. */
14386 cp_lexer_consume_token (parser->lexer);
14391 case RID_PROTECTED:
14393 /* If more than one access specifier appears, issue an
14395 if (access != access_default_node
14396 && !duplicate_access_error_issued_p)
14398 cp_parser_error (parser,
14399 "more than one access specifier in base-specified");
14400 duplicate_access_error_issued_p = true;
14403 access = ridpointers[(int) token->keyword];
14405 /* Consume the access-specifier. */
14406 cp_lexer_consume_token (parser->lexer);
14415 /* It is not uncommon to see programs mechanically, erroneously, use
14416 the 'typename' keyword to denote (dependent) qualified types
14417 as base classes. */
14418 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
14420 if (!processing_template_decl)
14421 error ("keyword %<typename%> not allowed outside of templates");
14423 error ("keyword %<typename%> not allowed in this context "
14424 "(the base class is implicitly a type)");
14425 cp_lexer_consume_token (parser->lexer);
14428 /* Look for the optional `::' operator. */
14429 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
14430 /* Look for the nested-name-specifier. The simplest way to
14435 The keyword `typename' is not permitted in a base-specifier or
14436 mem-initializer; in these contexts a qualified name that
14437 depends on a template-parameter is implicitly assumed to be a
14440 is to pretend that we have seen the `typename' keyword at this
14442 cp_parser_nested_name_specifier_opt (parser,
14443 /*typename_keyword_p=*/true,
14444 /*check_dependency_p=*/true,
14446 /*is_declaration=*/true);
14447 /* If the base class is given by a qualified name, assume that names
14448 we see are type names or templates, as appropriate. */
14449 class_scope_p = (parser->scope && TYPE_P (parser->scope));
14450 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
14452 /* Finally, look for the class-name. */
14453 type = cp_parser_class_name (parser,
14457 /*check_dependency_p=*/true,
14458 /*class_head_p=*/false,
14459 /*is_declaration=*/true);
14461 if (type == error_mark_node)
14462 return error_mark_node;
14464 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
14467 /* Exception handling [gram.exception] */
14469 /* Parse an (optional) exception-specification.
14471 exception-specification:
14472 throw ( type-id-list [opt] )
14474 Returns a TREE_LIST representing the exception-specification. The
14475 TREE_VALUE of each node is a type. */
14478 cp_parser_exception_specification_opt (cp_parser* parser)
14483 /* Peek at the next token. */
14484 token = cp_lexer_peek_token (parser->lexer);
14485 /* If it's not `throw', then there's no exception-specification. */
14486 if (!cp_parser_is_keyword (token, RID_THROW))
14489 /* Consume the `throw'. */
14490 cp_lexer_consume_token (parser->lexer);
14492 /* Look for the `('. */
14493 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14495 /* Peek at the next token. */
14496 token = cp_lexer_peek_token (parser->lexer);
14497 /* If it's not a `)', then there is a type-id-list. */
14498 if (token->type != CPP_CLOSE_PAREN)
14500 const char *saved_message;
14502 /* Types may not be defined in an exception-specification. */
14503 saved_message = parser->type_definition_forbidden_message;
14504 parser->type_definition_forbidden_message
14505 = "types may not be defined in an exception-specification";
14506 /* Parse the type-id-list. */
14507 type_id_list = cp_parser_type_id_list (parser);
14508 /* Restore the saved message. */
14509 parser->type_definition_forbidden_message = saved_message;
14512 type_id_list = empty_except_spec;
14514 /* Look for the `)'. */
14515 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14517 return type_id_list;
14520 /* Parse an (optional) type-id-list.
14524 type-id-list , type-id
14526 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
14527 in the order that the types were presented. */
14530 cp_parser_type_id_list (cp_parser* parser)
14532 tree types = NULL_TREE;
14539 /* Get the next type-id. */
14540 type = cp_parser_type_id (parser);
14541 /* Add it to the list. */
14542 types = add_exception_specifier (types, type, /*complain=*/1);
14543 /* Peek at the next token. */
14544 token = cp_lexer_peek_token (parser->lexer);
14545 /* If it is not a `,', we are done. */
14546 if (token->type != CPP_COMMA)
14548 /* Consume the `,'. */
14549 cp_lexer_consume_token (parser->lexer);
14552 return nreverse (types);
14555 /* Parse a try-block.
14558 try compound-statement handler-seq */
14561 cp_parser_try_block (cp_parser* parser)
14565 cp_parser_require_keyword (parser, RID_TRY, "`try'");
14566 try_block = begin_try_block ();
14567 cp_parser_compound_statement (parser, NULL, true);
14568 finish_try_block (try_block);
14569 cp_parser_handler_seq (parser);
14570 finish_handler_sequence (try_block);
14575 /* Parse a function-try-block.
14577 function-try-block:
14578 try ctor-initializer [opt] function-body handler-seq */
14581 cp_parser_function_try_block (cp_parser* parser)
14583 tree compound_stmt;
14585 bool ctor_initializer_p;
14587 /* Look for the `try' keyword. */
14588 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
14590 /* Let the rest of the front-end know where we are. */
14591 try_block = begin_function_try_block (&compound_stmt);
14592 /* Parse the function-body. */
14594 = cp_parser_ctor_initializer_opt_and_function_body (parser);
14595 /* We're done with the `try' part. */
14596 finish_function_try_block (try_block);
14597 /* Parse the handlers. */
14598 cp_parser_handler_seq (parser);
14599 /* We're done with the handlers. */
14600 finish_function_handler_sequence (try_block, compound_stmt);
14602 return ctor_initializer_p;
14605 /* Parse a handler-seq.
14608 handler handler-seq [opt] */
14611 cp_parser_handler_seq (cp_parser* parser)
14617 /* Parse the handler. */
14618 cp_parser_handler (parser);
14619 /* Peek at the next token. */
14620 token = cp_lexer_peek_token (parser->lexer);
14621 /* If it's not `catch' then there are no more handlers. */
14622 if (!cp_parser_is_keyword (token, RID_CATCH))
14627 /* Parse a handler.
14630 catch ( exception-declaration ) compound-statement */
14633 cp_parser_handler (cp_parser* parser)
14638 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
14639 handler = begin_handler ();
14640 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14641 declaration = cp_parser_exception_declaration (parser);
14642 finish_handler_parms (declaration, handler);
14643 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14644 cp_parser_compound_statement (parser, NULL, false);
14645 finish_handler (handler);
14648 /* Parse an exception-declaration.
14650 exception-declaration:
14651 type-specifier-seq declarator
14652 type-specifier-seq abstract-declarator
14656 Returns a VAR_DECL for the declaration, or NULL_TREE if the
14657 ellipsis variant is used. */
14660 cp_parser_exception_declaration (cp_parser* parser)
14662 cp_decl_specifier_seq type_specifiers;
14663 cp_declarator *declarator;
14664 const char *saved_message;
14666 /* If it's an ellipsis, it's easy to handle. */
14667 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14669 /* Consume the `...' token. */
14670 cp_lexer_consume_token (parser->lexer);
14674 /* Types may not be defined in exception-declarations. */
14675 saved_message = parser->type_definition_forbidden_message;
14676 parser->type_definition_forbidden_message
14677 = "types may not be defined in exception-declarations";
14679 /* Parse the type-specifier-seq. */
14680 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
14682 /* If it's a `)', then there is no declarator. */
14683 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
14686 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
14687 /*ctor_dtor_or_conv_p=*/NULL,
14688 /*parenthesized_p=*/NULL,
14689 /*member_p=*/false);
14691 /* Restore the saved message. */
14692 parser->type_definition_forbidden_message = saved_message;
14694 if (!type_specifiers.any_specifiers_p)
14695 return error_mark_node;
14697 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
14700 /* Parse a throw-expression.
14703 throw assignment-expression [opt]
14705 Returns a THROW_EXPR representing the throw-expression. */
14708 cp_parser_throw_expression (cp_parser* parser)
14713 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
14714 token = cp_lexer_peek_token (parser->lexer);
14715 /* Figure out whether or not there is an assignment-expression
14716 following the "throw" keyword. */
14717 if (token->type == CPP_COMMA
14718 || token->type == CPP_SEMICOLON
14719 || token->type == CPP_CLOSE_PAREN
14720 || token->type == CPP_CLOSE_SQUARE
14721 || token->type == CPP_CLOSE_BRACE
14722 || token->type == CPP_COLON)
14723 expression = NULL_TREE;
14725 expression = cp_parser_assignment_expression (parser,
14728 return build_throw (expression);
14731 /* GNU Extensions */
14733 /* Parse an (optional) asm-specification.
14736 asm ( string-literal )
14738 If the asm-specification is present, returns a STRING_CST
14739 corresponding to the string-literal. Otherwise, returns
14743 cp_parser_asm_specification_opt (cp_parser* parser)
14746 tree asm_specification;
14748 /* Peek at the next token. */
14749 token = cp_lexer_peek_token (parser->lexer);
14750 /* If the next token isn't the `asm' keyword, then there's no
14751 asm-specification. */
14752 if (!cp_parser_is_keyword (token, RID_ASM))
14755 /* Consume the `asm' token. */
14756 cp_lexer_consume_token (parser->lexer);
14757 /* Look for the `('. */
14758 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14760 /* Look for the string-literal. */
14761 asm_specification = cp_parser_string_literal (parser, false, false);
14763 /* Look for the `)'. */
14764 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
14766 return asm_specification;
14769 /* Parse an asm-operand-list.
14773 asm-operand-list , asm-operand
14776 string-literal ( expression )
14777 [ string-literal ] string-literal ( expression )
14779 Returns a TREE_LIST representing the operands. The TREE_VALUE of
14780 each node is the expression. The TREE_PURPOSE is itself a
14781 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
14782 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
14783 is a STRING_CST for the string literal before the parenthesis. */
14786 cp_parser_asm_operand_list (cp_parser* parser)
14788 tree asm_operands = NULL_TREE;
14792 tree string_literal;
14796 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
14798 /* Consume the `[' token. */
14799 cp_lexer_consume_token (parser->lexer);
14800 /* Read the operand name. */
14801 name = cp_parser_identifier (parser);
14802 if (name != error_mark_node)
14803 name = build_string (IDENTIFIER_LENGTH (name),
14804 IDENTIFIER_POINTER (name));
14805 /* Look for the closing `]'. */
14806 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
14810 /* Look for the string-literal. */
14811 string_literal = cp_parser_string_literal (parser, false, false);
14813 /* Look for the `('. */
14814 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14815 /* Parse the expression. */
14816 expression = cp_parser_expression (parser, /*cast_p=*/false);
14817 /* Look for the `)'. */
14818 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14820 /* Add this operand to the list. */
14821 asm_operands = tree_cons (build_tree_list (name, string_literal),
14824 /* If the next token is not a `,', there are no more
14826 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14828 /* Consume the `,'. */
14829 cp_lexer_consume_token (parser->lexer);
14832 return nreverse (asm_operands);
14835 /* Parse an asm-clobber-list.
14839 asm-clobber-list , string-literal
14841 Returns a TREE_LIST, indicating the clobbers in the order that they
14842 appeared. The TREE_VALUE of each node is a STRING_CST. */
14845 cp_parser_asm_clobber_list (cp_parser* parser)
14847 tree clobbers = NULL_TREE;
14851 tree string_literal;
14853 /* Look for the string literal. */
14854 string_literal = cp_parser_string_literal (parser, false, false);
14855 /* Add it to the list. */
14856 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
14857 /* If the next token is not a `,', then the list is
14859 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14861 /* Consume the `,' token. */
14862 cp_lexer_consume_token (parser->lexer);
14868 /* Parse an (optional) series of attributes.
14871 attributes attribute
14874 __attribute__ (( attribute-list [opt] ))
14876 The return value is as for cp_parser_attribute_list. */
14879 cp_parser_attributes_opt (cp_parser* parser)
14881 tree attributes = NULL_TREE;
14886 tree attribute_list;
14888 /* Peek at the next token. */
14889 token = cp_lexer_peek_token (parser->lexer);
14890 /* If it's not `__attribute__', then we're done. */
14891 if (token->keyword != RID_ATTRIBUTE)
14894 /* Consume the `__attribute__' keyword. */
14895 cp_lexer_consume_token (parser->lexer);
14896 /* Look for the two `(' tokens. */
14897 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14898 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14900 /* Peek at the next token. */
14901 token = cp_lexer_peek_token (parser->lexer);
14902 if (token->type != CPP_CLOSE_PAREN)
14903 /* Parse the attribute-list. */
14904 attribute_list = cp_parser_attribute_list (parser);
14906 /* If the next token is a `)', then there is no attribute
14908 attribute_list = NULL;
14910 /* Look for the two `)' tokens. */
14911 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14912 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14914 /* Add these new attributes to the list. */
14915 attributes = chainon (attributes, attribute_list);
14921 /* Parse an attribute-list.
14925 attribute-list , attribute
14929 identifier ( identifier )
14930 identifier ( identifier , expression-list )
14931 identifier ( expression-list )
14933 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
14934 to an attribute. The TREE_PURPOSE of each node is the identifier
14935 indicating which attribute is in use. The TREE_VALUE represents
14936 the arguments, if any. */
14939 cp_parser_attribute_list (cp_parser* parser)
14941 tree attribute_list = NULL_TREE;
14942 bool save_translate_strings_p = parser->translate_strings_p;
14944 parser->translate_strings_p = false;
14951 /* Look for the identifier. We also allow keywords here; for
14952 example `__attribute__ ((const))' is legal. */
14953 token = cp_lexer_peek_token (parser->lexer);
14954 if (token->type == CPP_NAME
14955 || token->type == CPP_KEYWORD)
14957 tree arguments = NULL_TREE;
14959 /* Consume the token. */
14960 token = cp_lexer_consume_token (parser->lexer);
14962 /* Save away the identifier that indicates which attribute
14964 identifier = token->u.value;
14965 attribute = build_tree_list (identifier, NULL_TREE);
14967 /* Peek at the next token. */
14968 token = cp_lexer_peek_token (parser->lexer);
14969 /* If it's an `(', then parse the attribute arguments. */
14970 if (token->type == CPP_OPEN_PAREN)
14972 arguments = cp_parser_parenthesized_expression_list
14973 (parser, true, /*cast_p=*/false,
14974 /*non_constant_p=*/NULL);
14975 /* Save the arguments away. */
14976 TREE_VALUE (attribute) = arguments;
14979 if (arguments != error_mark_node)
14981 /* Add this attribute to the list. */
14982 TREE_CHAIN (attribute) = attribute_list;
14983 attribute_list = attribute;
14986 token = cp_lexer_peek_token (parser->lexer);
14988 /* Now, look for more attributes. If the next token isn't a
14989 `,', we're done. */
14990 if (token->type != CPP_COMMA)
14993 /* Consume the comma and keep going. */
14994 cp_lexer_consume_token (parser->lexer);
14996 parser->translate_strings_p = save_translate_strings_p;
14998 /* We built up the list in reverse order. */
14999 return nreverse (attribute_list);
15002 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
15003 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
15004 current value of the PEDANTIC flag, regardless of whether or not
15005 the `__extension__' keyword is present. The caller is responsible
15006 for restoring the value of the PEDANTIC flag. */
15009 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
15011 /* Save the old value of the PEDANTIC flag. */
15012 *saved_pedantic = pedantic;
15014 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
15016 /* Consume the `__extension__' token. */
15017 cp_lexer_consume_token (parser->lexer);
15018 /* We're not being pedantic while the `__extension__' keyword is
15028 /* Parse a label declaration.
15031 __label__ label-declarator-seq ;
15033 label-declarator-seq:
15034 identifier , label-declarator-seq
15038 cp_parser_label_declaration (cp_parser* parser)
15040 /* Look for the `__label__' keyword. */
15041 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
15047 /* Look for an identifier. */
15048 identifier = cp_parser_identifier (parser);
15049 /* If we failed, stop. */
15050 if (identifier == error_mark_node)
15052 /* Declare it as a label. */
15053 finish_label_decl (identifier);
15054 /* If the next token is a `;', stop. */
15055 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15057 /* Look for the `,' separating the label declarations. */
15058 cp_parser_require (parser, CPP_COMMA, "`,'");
15061 /* Look for the final `;'. */
15062 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
15065 /* Support Functions */
15067 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
15068 NAME should have one of the representations used for an
15069 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
15070 is returned. If PARSER->SCOPE is a dependent type, then a
15071 SCOPE_REF is returned.
15073 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
15074 returned; the name was already resolved when the TEMPLATE_ID_EXPR
15075 was formed. Abstractly, such entities should not be passed to this
15076 function, because they do not need to be looked up, but it is
15077 simpler to check for this special case here, rather than at the
15080 In cases not explicitly covered above, this function returns a
15081 DECL, OVERLOAD, or baselink representing the result of the lookup.
15082 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
15085 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
15086 (e.g., "struct") that was used. In that case bindings that do not
15087 refer to types are ignored.
15089 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
15092 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
15095 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
15098 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
15099 TREE_LIST of candidates if name-lookup results in an ambiguity, and
15100 NULL_TREE otherwise. */
15103 cp_parser_lookup_name (cp_parser *parser, tree name,
15104 enum tag_types tag_type,
15107 bool check_dependency,
15108 tree *ambiguous_decls)
15112 tree object_type = parser->context->object_type;
15114 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
15115 flags |= LOOKUP_COMPLAIN;
15117 /* Assume that the lookup will be unambiguous. */
15118 if (ambiguous_decls)
15119 *ambiguous_decls = NULL_TREE;
15121 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
15122 no longer valid. Note that if we are parsing tentatively, and
15123 the parse fails, OBJECT_TYPE will be automatically restored. */
15124 parser->context->object_type = NULL_TREE;
15126 if (name == error_mark_node)
15127 return error_mark_node;
15129 /* A template-id has already been resolved; there is no lookup to
15131 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
15133 if (BASELINK_P (name))
15135 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
15136 == TEMPLATE_ID_EXPR);
15140 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
15141 it should already have been checked to make sure that the name
15142 used matches the type being destroyed. */
15143 if (TREE_CODE (name) == BIT_NOT_EXPR)
15147 /* Figure out to which type this destructor applies. */
15149 type = parser->scope;
15150 else if (object_type)
15151 type = object_type;
15153 type = current_class_type;
15154 /* If that's not a class type, there is no destructor. */
15155 if (!type || !CLASS_TYPE_P (type))
15156 return error_mark_node;
15157 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
15158 lazily_declare_fn (sfk_destructor, type);
15159 if (!CLASSTYPE_DESTRUCTORS (type))
15160 return error_mark_node;
15161 /* If it was a class type, return the destructor. */
15162 return CLASSTYPE_DESTRUCTORS (type);
15165 /* By this point, the NAME should be an ordinary identifier. If
15166 the id-expression was a qualified name, the qualifying scope is
15167 stored in PARSER->SCOPE at this point. */
15168 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
15170 /* Perform the lookup. */
15175 if (parser->scope == error_mark_node)
15176 return error_mark_node;
15178 /* If the SCOPE is dependent, the lookup must be deferred until
15179 the template is instantiated -- unless we are explicitly
15180 looking up names in uninstantiated templates. Even then, we
15181 cannot look up the name if the scope is not a class type; it
15182 might, for example, be a template type parameter. */
15183 dependent_p = (TYPE_P (parser->scope)
15184 && !(parser->in_declarator_p
15185 && currently_open_class (parser->scope))
15186 && dependent_type_p (parser->scope));
15187 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
15194 /* The resolution to Core Issue 180 says that `struct
15195 A::B' should be considered a type-name, even if `A'
15197 type = make_typename_type (parser->scope, name, tag_type,
15198 /*complain=*/tf_error);
15199 decl = TYPE_NAME (type);
15201 else if (is_template
15202 && (cp_parser_next_token_ends_template_argument_p (parser)
15203 || cp_lexer_next_token_is (parser->lexer,
15205 decl = make_unbound_class_template (parser->scope,
15207 /*complain=*/tf_error);
15209 decl = build_qualified_name (/*type=*/NULL_TREE,
15210 parser->scope, name,
15215 tree pushed_scope = NULL_TREE;
15217 /* If PARSER->SCOPE is a dependent type, then it must be a
15218 class type, and we must not be checking dependencies;
15219 otherwise, we would have processed this lookup above. So
15220 that PARSER->SCOPE is not considered a dependent base by
15221 lookup_member, we must enter the scope here. */
15223 pushed_scope = push_scope (parser->scope);
15224 /* If the PARSER->SCOPE is a template specialization, it
15225 may be instantiated during name lookup. In that case,
15226 errors may be issued. Even if we rollback the current
15227 tentative parse, those errors are valid. */
15228 decl = lookup_qualified_name (parser->scope, name,
15229 tag_type != none_type,
15230 /*complain=*/true);
15232 pop_scope (pushed_scope);
15234 parser->qualifying_scope = parser->scope;
15235 parser->object_scope = NULL_TREE;
15237 else if (object_type)
15239 tree object_decl = NULL_TREE;
15240 /* Look up the name in the scope of the OBJECT_TYPE, unless the
15241 OBJECT_TYPE is not a class. */
15242 if (CLASS_TYPE_P (object_type))
15243 /* If the OBJECT_TYPE is a template specialization, it may
15244 be instantiated during name lookup. In that case, errors
15245 may be issued. Even if we rollback the current tentative
15246 parse, those errors are valid. */
15247 object_decl = lookup_member (object_type,
15250 tag_type != none_type);
15251 /* Look it up in the enclosing context, too. */
15252 decl = lookup_name_real (name, tag_type != none_type,
15254 /*block_p=*/true, is_namespace, flags);
15255 parser->object_scope = object_type;
15256 parser->qualifying_scope = NULL_TREE;
15258 decl = object_decl;
15262 decl = lookup_name_real (name, tag_type != none_type,
15264 /*block_p=*/true, is_namespace, flags);
15265 parser->qualifying_scope = NULL_TREE;
15266 parser->object_scope = NULL_TREE;
15269 /* If the lookup failed, let our caller know. */
15270 if (!decl || decl == error_mark_node)
15271 return error_mark_node;
15273 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
15274 if (TREE_CODE (decl) == TREE_LIST)
15276 if (ambiguous_decls)
15277 *ambiguous_decls = decl;
15278 /* The error message we have to print is too complicated for
15279 cp_parser_error, so we incorporate its actions directly. */
15280 if (!cp_parser_simulate_error (parser))
15282 error ("reference to %qD is ambiguous", name);
15283 print_candidates (decl);
15285 return error_mark_node;
15288 gcc_assert (DECL_P (decl)
15289 || TREE_CODE (decl) == OVERLOAD
15290 || TREE_CODE (decl) == SCOPE_REF
15291 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
15292 || BASELINK_P (decl));
15294 /* If we have resolved the name of a member declaration, check to
15295 see if the declaration is accessible. When the name resolves to
15296 set of overloaded functions, accessibility is checked when
15297 overload resolution is done.
15299 During an explicit instantiation, access is not checked at all,
15300 as per [temp.explicit]. */
15302 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
15307 /* Like cp_parser_lookup_name, but for use in the typical case where
15308 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
15309 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
15312 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
15314 return cp_parser_lookup_name (parser, name,
15316 /*is_template=*/false,
15317 /*is_namespace=*/false,
15318 /*check_dependency=*/true,
15319 /*ambiguous_decls=*/NULL);
15322 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
15323 the current context, return the TYPE_DECL. If TAG_NAME_P is
15324 true, the DECL indicates the class being defined in a class-head,
15325 or declared in an elaborated-type-specifier.
15327 Otherwise, return DECL. */
15330 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
15332 /* If the TEMPLATE_DECL is being declared as part of a class-head,
15333 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
15336 template <typename T> struct B;
15339 template <typename T> struct A::B {};
15341 Similarly, in an elaborated-type-specifier:
15343 namespace N { struct X{}; }
15346 template <typename T> friend struct N::X;
15349 However, if the DECL refers to a class type, and we are in
15350 the scope of the class, then the name lookup automatically
15351 finds the TYPE_DECL created by build_self_reference rather
15352 than a TEMPLATE_DECL. For example, in:
15354 template <class T> struct S {
15358 there is no need to handle such case. */
15360 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
15361 return DECL_TEMPLATE_RESULT (decl);
15366 /* If too many, or too few, template-parameter lists apply to the
15367 declarator, issue an error message. Returns TRUE if all went well,
15368 and FALSE otherwise. */
15371 cp_parser_check_declarator_template_parameters (cp_parser* parser,
15372 cp_declarator *declarator)
15374 unsigned num_templates;
15376 /* We haven't seen any classes that involve template parameters yet. */
15379 switch (declarator->kind)
15382 if (declarator->u.id.qualifying_scope)
15387 scope = declarator->u.id.qualifying_scope;
15388 member = declarator->u.id.unqualified_name;
15390 while (scope && CLASS_TYPE_P (scope))
15392 /* You're supposed to have one `template <...>'
15393 for every template class, but you don't need one
15394 for a full specialization. For example:
15396 template <class T> struct S{};
15397 template <> struct S<int> { void f(); };
15398 void S<int>::f () {}
15400 is correct; there shouldn't be a `template <>' for
15401 the definition of `S<int>::f'. */
15402 if (!CLASSTYPE_TEMPLATE_INFO (scope))
15403 /* If SCOPE does not have template information of any
15404 kind, then it is not a template, nor is it nested
15405 within a template. */
15407 if (explicit_class_specialization_p (scope))
15409 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
15412 scope = TYPE_CONTEXT (scope);
15415 else if (TREE_CODE (declarator->u.id.unqualified_name)
15416 == TEMPLATE_ID_EXPR)
15417 /* If the DECLARATOR has the form `X<y>' then it uses one
15418 additional level of template parameters. */
15421 return cp_parser_check_template_parameters (parser,
15427 case cdk_reference:
15429 return (cp_parser_check_declarator_template_parameters
15430 (parser, declarator->declarator));
15436 gcc_unreachable ();
15441 /* NUM_TEMPLATES were used in the current declaration. If that is
15442 invalid, return FALSE and issue an error messages. Otherwise,
15446 cp_parser_check_template_parameters (cp_parser* parser,
15447 unsigned num_templates)
15449 /* If there are more template classes than parameter lists, we have
15452 template <class T> void S<T>::R<T>::f (); */
15453 if (parser->num_template_parameter_lists < num_templates)
15455 error ("too few template-parameter-lists");
15458 /* If there are the same number of template classes and parameter
15459 lists, that's OK. */
15460 if (parser->num_template_parameter_lists == num_templates)
15462 /* If there are more, but only one more, then we are referring to a
15463 member template. That's OK too. */
15464 if (parser->num_template_parameter_lists == num_templates + 1)
15466 /* Otherwise, there are too many template parameter lists. We have
15469 template <class T> template <class U> void S::f(); */
15470 error ("too many template-parameter-lists");
15474 /* Parse an optional `::' token indicating that the following name is
15475 from the global namespace. If so, PARSER->SCOPE is set to the
15476 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
15477 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
15478 Returns the new value of PARSER->SCOPE, if the `::' token is
15479 present, and NULL_TREE otherwise. */
15482 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
15486 /* Peek at the next token. */
15487 token = cp_lexer_peek_token (parser->lexer);
15488 /* If we're looking at a `::' token then we're starting from the
15489 global namespace, not our current location. */
15490 if (token->type == CPP_SCOPE)
15492 /* Consume the `::' token. */
15493 cp_lexer_consume_token (parser->lexer);
15494 /* Set the SCOPE so that we know where to start the lookup. */
15495 parser->scope = global_namespace;
15496 parser->qualifying_scope = global_namespace;
15497 parser->object_scope = NULL_TREE;
15499 return parser->scope;
15501 else if (!current_scope_valid_p)
15503 parser->scope = NULL_TREE;
15504 parser->qualifying_scope = NULL_TREE;
15505 parser->object_scope = NULL_TREE;
15511 /* Returns TRUE if the upcoming token sequence is the start of a
15512 constructor declarator. If FRIEND_P is true, the declarator is
15513 preceded by the `friend' specifier. */
15516 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
15518 bool constructor_p;
15519 tree type_decl = NULL_TREE;
15520 bool nested_name_p;
15521 cp_token *next_token;
15523 /* The common case is that this is not a constructor declarator, so
15524 try to avoid doing lots of work if at all possible. It's not
15525 valid declare a constructor at function scope. */
15526 if (parser->in_function_body)
15528 /* And only certain tokens can begin a constructor declarator. */
15529 next_token = cp_lexer_peek_token (parser->lexer);
15530 if (next_token->type != CPP_NAME
15531 && next_token->type != CPP_SCOPE
15532 && next_token->type != CPP_NESTED_NAME_SPECIFIER
15533 && next_token->type != CPP_TEMPLATE_ID)
15536 /* Parse tentatively; we are going to roll back all of the tokens
15538 cp_parser_parse_tentatively (parser);
15539 /* Assume that we are looking at a constructor declarator. */
15540 constructor_p = true;
15542 /* Look for the optional `::' operator. */
15543 cp_parser_global_scope_opt (parser,
15544 /*current_scope_valid_p=*/false);
15545 /* Look for the nested-name-specifier. */
15547 = (cp_parser_nested_name_specifier_opt (parser,
15548 /*typename_keyword_p=*/false,
15549 /*check_dependency_p=*/false,
15551 /*is_declaration=*/false)
15553 /* Outside of a class-specifier, there must be a
15554 nested-name-specifier. */
15555 if (!nested_name_p &&
15556 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
15558 constructor_p = false;
15559 /* If we still think that this might be a constructor-declarator,
15560 look for a class-name. */
15565 template <typename T> struct S { S(); };
15566 template <typename T> S<T>::S ();
15568 we must recognize that the nested `S' names a class.
15571 template <typename T> S<T>::S<T> ();
15573 we must recognize that the nested `S' names a template. */
15574 type_decl = cp_parser_class_name (parser,
15575 /*typename_keyword_p=*/false,
15576 /*template_keyword_p=*/false,
15578 /*check_dependency_p=*/false,
15579 /*class_head_p=*/false,
15580 /*is_declaration=*/false);
15581 /* If there was no class-name, then this is not a constructor. */
15582 constructor_p = !cp_parser_error_occurred (parser);
15585 /* If we're still considering a constructor, we have to see a `(',
15586 to begin the parameter-declaration-clause, followed by either a
15587 `)', an `...', or a decl-specifier. We need to check for a
15588 type-specifier to avoid being fooled into thinking that:
15592 is a constructor. (It is actually a function named `f' that
15593 takes one parameter (of type `int') and returns a value of type
15596 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
15598 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
15599 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
15600 /* A parameter declaration begins with a decl-specifier,
15601 which is either the "attribute" keyword, a storage class
15602 specifier, or (usually) a type-specifier. */
15603 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
15606 tree pushed_scope = NULL_TREE;
15607 unsigned saved_num_template_parameter_lists;
15609 /* Names appearing in the type-specifier should be looked up
15610 in the scope of the class. */
15611 if (current_class_type)
15615 type = TREE_TYPE (type_decl);
15616 if (TREE_CODE (type) == TYPENAME_TYPE)
15618 type = resolve_typename_type (type,
15619 /*only_current_p=*/false);
15620 if (type == error_mark_node)
15622 cp_parser_abort_tentative_parse (parser);
15626 pushed_scope = push_scope (type);
15629 /* Inside the constructor parameter list, surrounding
15630 template-parameter-lists do not apply. */
15631 saved_num_template_parameter_lists
15632 = parser->num_template_parameter_lists;
15633 parser->num_template_parameter_lists = 0;
15635 /* Look for the type-specifier. */
15636 cp_parser_type_specifier (parser,
15637 CP_PARSER_FLAGS_NONE,
15638 /*decl_specs=*/NULL,
15639 /*is_declarator=*/true,
15640 /*declares_class_or_enum=*/NULL,
15641 /*is_cv_qualifier=*/NULL);
15643 parser->num_template_parameter_lists
15644 = saved_num_template_parameter_lists;
15646 /* Leave the scope of the class. */
15648 pop_scope (pushed_scope);
15650 constructor_p = !cp_parser_error_occurred (parser);
15654 constructor_p = false;
15655 /* We did not really want to consume any tokens. */
15656 cp_parser_abort_tentative_parse (parser);
15658 return constructor_p;
15661 /* Parse the definition of the function given by the DECL_SPECIFIERS,
15662 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
15663 they must be performed once we are in the scope of the function.
15665 Returns the function defined. */
15668 cp_parser_function_definition_from_specifiers_and_declarator
15669 (cp_parser* parser,
15670 cp_decl_specifier_seq *decl_specifiers,
15672 const cp_declarator *declarator)
15677 /* Begin the function-definition. */
15678 success_p = start_function (decl_specifiers, declarator, attributes);
15680 /* The things we're about to see are not directly qualified by any
15681 template headers we've seen thus far. */
15682 reset_specialization ();
15684 /* If there were names looked up in the decl-specifier-seq that we
15685 did not check, check them now. We must wait until we are in the
15686 scope of the function to perform the checks, since the function
15687 might be a friend. */
15688 perform_deferred_access_checks ();
15692 /* Skip the entire function. */
15693 cp_parser_skip_to_end_of_block_or_statement (parser);
15694 fn = error_mark_node;
15696 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
15698 /* Seen already, skip it. An error message has already been output. */
15699 cp_parser_skip_to_end_of_block_or_statement (parser);
15700 fn = current_function_decl;
15701 current_function_decl = NULL_TREE;
15702 /* If this is a function from a class, pop the nested class. */
15703 if (current_class_name)
15704 pop_nested_class ();
15707 fn = cp_parser_function_definition_after_declarator (parser,
15708 /*inline_p=*/false);
15713 /* Parse the part of a function-definition that follows the
15714 declarator. INLINE_P is TRUE iff this function is an inline
15715 function defined with a class-specifier.
15717 Returns the function defined. */
15720 cp_parser_function_definition_after_declarator (cp_parser* parser,
15724 bool ctor_initializer_p = false;
15725 bool saved_in_unbraced_linkage_specification_p;
15726 bool saved_in_function_body;
15727 unsigned saved_num_template_parameter_lists;
15729 saved_in_function_body = parser->in_function_body;
15730 parser->in_function_body = true;
15731 /* If the next token is `return', then the code may be trying to
15732 make use of the "named return value" extension that G++ used to
15734 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
15736 /* Consume the `return' keyword. */
15737 cp_lexer_consume_token (parser->lexer);
15738 /* Look for the identifier that indicates what value is to be
15740 cp_parser_identifier (parser);
15741 /* Issue an error message. */
15742 error ("named return values are no longer supported");
15743 /* Skip tokens until we reach the start of the function body. */
15746 cp_token *token = cp_lexer_peek_token (parser->lexer);
15747 if (token->type == CPP_OPEN_BRACE
15748 || token->type == CPP_EOF
15749 || token->type == CPP_PRAGMA_EOL)
15751 cp_lexer_consume_token (parser->lexer);
15754 /* The `extern' in `extern "C" void f () { ... }' does not apply to
15755 anything declared inside `f'. */
15756 saved_in_unbraced_linkage_specification_p
15757 = parser->in_unbraced_linkage_specification_p;
15758 parser->in_unbraced_linkage_specification_p = false;
15759 /* Inside the function, surrounding template-parameter-lists do not
15761 saved_num_template_parameter_lists
15762 = parser->num_template_parameter_lists;
15763 parser->num_template_parameter_lists = 0;
15764 /* If the next token is `try', then we are looking at a
15765 function-try-block. */
15766 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
15767 ctor_initializer_p = cp_parser_function_try_block (parser);
15768 /* A function-try-block includes the function-body, so we only do
15769 this next part if we're not processing a function-try-block. */
15772 = cp_parser_ctor_initializer_opt_and_function_body (parser);
15774 /* Finish the function. */
15775 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
15776 (inline_p ? 2 : 0));
15777 /* Generate code for it, if necessary. */
15778 expand_or_defer_fn (fn);
15779 /* Restore the saved values. */
15780 parser->in_unbraced_linkage_specification_p
15781 = saved_in_unbraced_linkage_specification_p;
15782 parser->num_template_parameter_lists
15783 = saved_num_template_parameter_lists;
15784 parser->in_function_body = saved_in_function_body;
15789 /* Parse a template-declaration, assuming that the `export' (and
15790 `extern') keywords, if present, has already been scanned. MEMBER_P
15791 is as for cp_parser_template_declaration. */
15794 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
15796 tree decl = NULL_TREE;
15797 VEC (deferred_access_check,gc) *checks;
15798 tree parameter_list;
15799 bool friend_p = false;
15800 bool need_lang_pop;
15802 /* Look for the `template' keyword. */
15803 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
15807 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
15809 if (at_class_scope_p () && current_function_decl)
15811 /* 14.5.2.2 [temp.mem]
15813 A local class shall not have member templates. */
15814 error ("invalid declaration of member template in local class");
15815 cp_parser_skip_to_end_of_block_or_statement (parser);
15820 A template ... shall not have C linkage. */
15821 if (current_lang_name == lang_name_c)
15823 error ("template with C linkage");
15824 /* Give it C++ linkage to avoid confusing other parts of the
15826 push_lang_context (lang_name_cplusplus);
15827 need_lang_pop = true;
15830 need_lang_pop = false;
15832 /* We cannot perform access checks on the template parameter
15833 declarations until we know what is being declared, just as we
15834 cannot check the decl-specifier list. */
15835 push_deferring_access_checks (dk_deferred);
15837 /* If the next token is `>', then we have an invalid
15838 specialization. Rather than complain about an invalid template
15839 parameter, issue an error message here. */
15840 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15842 cp_parser_error (parser, "invalid explicit specialization");
15843 begin_specialization ();
15844 parameter_list = NULL_TREE;
15847 /* Parse the template parameters. */
15848 parameter_list = cp_parser_template_parameter_list (parser);
15850 /* Get the deferred access checks from the parameter list. These
15851 will be checked once we know what is being declared, as for a
15852 member template the checks must be performed in the scope of the
15853 class containing the member. */
15854 checks = get_deferred_access_checks ();
15856 /* Look for the `>'. */
15857 cp_parser_skip_to_end_of_template_parameter_list (parser);
15858 /* We just processed one more parameter list. */
15859 ++parser->num_template_parameter_lists;
15860 /* If the next token is `template', there are more template
15862 if (cp_lexer_next_token_is_keyword (parser->lexer,
15864 cp_parser_template_declaration_after_export (parser, member_p);
15867 /* There are no access checks when parsing a template, as we do not
15868 know if a specialization will be a friend. */
15869 push_deferring_access_checks (dk_no_check);
15870 decl = cp_parser_single_declaration (parser,
15874 pop_deferring_access_checks ();
15876 /* If this is a member template declaration, let the front
15878 if (member_p && !friend_p && decl)
15880 if (TREE_CODE (decl) == TYPE_DECL)
15881 cp_parser_check_access_in_redeclaration (decl);
15883 decl = finish_member_template_decl (decl);
15885 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
15886 make_friend_class (current_class_type, TREE_TYPE (decl),
15887 /*complain=*/true);
15889 /* We are done with the current parameter list. */
15890 --parser->num_template_parameter_lists;
15892 pop_deferring_access_checks ();
15895 finish_template_decl (parameter_list);
15897 /* Register member declarations. */
15898 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
15899 finish_member_declaration (decl);
15900 /* For the erroneous case of a template with C linkage, we pushed an
15901 implicit C++ linkage scope; exit that scope now. */
15903 pop_lang_context ();
15904 /* If DECL is a function template, we must return to parse it later.
15905 (Even though there is no definition, there might be default
15906 arguments that need handling.) */
15907 if (member_p && decl
15908 && (TREE_CODE (decl) == FUNCTION_DECL
15909 || DECL_FUNCTION_TEMPLATE_P (decl)))
15910 TREE_VALUE (parser->unparsed_functions_queues)
15911 = tree_cons (NULL_TREE, decl,
15912 TREE_VALUE (parser->unparsed_functions_queues));
15915 /* Perform the deferred access checks from a template-parameter-list.
15916 CHECKS is a TREE_LIST of access checks, as returned by
15917 get_deferred_access_checks. */
15920 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
15922 ++processing_template_parmlist;
15923 perform_access_checks (checks);
15924 --processing_template_parmlist;
15927 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
15928 `function-definition' sequence. MEMBER_P is true, this declaration
15929 appears in a class scope.
15931 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
15932 *FRIEND_P is set to TRUE iff the declaration is a friend. */
15935 cp_parser_single_declaration (cp_parser* parser,
15936 VEC (deferred_access_check,gc)* checks,
15940 int declares_class_or_enum;
15941 tree decl = NULL_TREE;
15942 cp_decl_specifier_seq decl_specifiers;
15943 bool function_definition_p = false;
15945 /* This function is only used when processing a template
15947 gcc_assert (innermost_scope_kind () == sk_template_parms
15948 || innermost_scope_kind () == sk_template_spec);
15950 /* Defer access checks until we know what is being declared. */
15951 push_deferring_access_checks (dk_deferred);
15953 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
15955 cp_parser_decl_specifier_seq (parser,
15956 CP_PARSER_FLAGS_OPTIONAL,
15958 &declares_class_or_enum);
15960 *friend_p = cp_parser_friend_p (&decl_specifiers);
15962 /* There are no template typedefs. */
15963 if (decl_specifiers.specs[(int) ds_typedef])
15965 error ("template declaration of %qs", "typedef");
15966 decl = error_mark_node;
15969 /* Gather up the access checks that occurred the
15970 decl-specifier-seq. */
15971 stop_deferring_access_checks ();
15973 /* Check for the declaration of a template class. */
15974 if (declares_class_or_enum)
15976 if (cp_parser_declares_only_class_p (parser))
15978 decl = shadow_tag (&decl_specifiers);
15983 friend template <typename T> struct A<T>::B;
15986 A<T>::B will be represented by a TYPENAME_TYPE, and
15987 therefore not recognized by shadow_tag. */
15988 if (friend_p && *friend_p
15990 && decl_specifiers.type
15991 && TYPE_P (decl_specifiers.type))
15992 decl = decl_specifiers.type;
15994 if (decl && decl != error_mark_node)
15995 decl = TYPE_NAME (decl);
15997 decl = error_mark_node;
15999 /* Perform access checks for template parameters. */
16000 cp_parser_perform_template_parameter_access_checks (checks);
16003 /* If it's not a template class, try for a template function. If
16004 the next token is a `;', then this declaration does not declare
16005 anything. But, if there were errors in the decl-specifiers, then
16006 the error might well have come from an attempted class-specifier.
16007 In that case, there's no need to warn about a missing declarator. */
16009 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
16010 || decl_specifiers.type != error_mark_node))
16011 decl = cp_parser_init_declarator (parser,
16014 /*function_definition_allowed_p=*/true,
16016 declares_class_or_enum,
16017 &function_definition_p);
16019 pop_deferring_access_checks ();
16021 /* Clear any current qualification; whatever comes next is the start
16022 of something new. */
16023 parser->scope = NULL_TREE;
16024 parser->qualifying_scope = NULL_TREE;
16025 parser->object_scope = NULL_TREE;
16026 /* Look for a trailing `;' after the declaration. */
16027 if (!function_definition_p
16028 && (decl == error_mark_node
16029 || !cp_parser_require (parser, CPP_SEMICOLON, "`;'")))
16030 cp_parser_skip_to_end_of_block_or_statement (parser);
16035 /* Parse a cast-expression that is not the operand of a unary "&". */
16038 cp_parser_simple_cast_expression (cp_parser *parser)
16040 return cp_parser_cast_expression (parser, /*address_p=*/false,
16044 /* Parse a functional cast to TYPE. Returns an expression
16045 representing the cast. */
16048 cp_parser_functional_cast (cp_parser* parser, tree type)
16050 tree expression_list;
16054 = cp_parser_parenthesized_expression_list (parser, false,
16056 /*non_constant_p=*/NULL);
16058 cast = build_functional_cast (type, expression_list);
16059 /* [expr.const]/1: In an integral constant expression "only type
16060 conversions to integral or enumeration type can be used". */
16061 if (TREE_CODE (type) == TYPE_DECL)
16062 type = TREE_TYPE (type);
16063 if (cast != error_mark_node
16064 && !cast_valid_in_integral_constant_expression_p (type)
16065 && (cp_parser_non_integral_constant_expression
16066 (parser, "a call to a constructor")))
16067 return error_mark_node;
16071 /* Save the tokens that make up the body of a member function defined
16072 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
16073 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
16074 specifiers applied to the declaration. Returns the FUNCTION_DECL
16075 for the member function. */
16078 cp_parser_save_member_function_body (cp_parser* parser,
16079 cp_decl_specifier_seq *decl_specifiers,
16080 cp_declarator *declarator,
16087 /* Create the function-declaration. */
16088 fn = start_method (decl_specifiers, declarator, attributes);
16089 /* If something went badly wrong, bail out now. */
16090 if (fn == error_mark_node)
16092 /* If there's a function-body, skip it. */
16093 if (cp_parser_token_starts_function_definition_p
16094 (cp_lexer_peek_token (parser->lexer)))
16095 cp_parser_skip_to_end_of_block_or_statement (parser);
16096 return error_mark_node;
16099 /* Remember it, if there default args to post process. */
16100 cp_parser_save_default_args (parser, fn);
16102 /* Save away the tokens that make up the body of the
16104 first = parser->lexer->next_token;
16105 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
16106 /* Handle function try blocks. */
16107 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
16108 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
16109 last = parser->lexer->next_token;
16111 /* Save away the inline definition; we will process it when the
16112 class is complete. */
16113 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
16114 DECL_PENDING_INLINE_P (fn) = 1;
16116 /* We need to know that this was defined in the class, so that
16117 friend templates are handled correctly. */
16118 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
16120 /* We're done with the inline definition. */
16121 finish_method (fn);
16123 /* Add FN to the queue of functions to be parsed later. */
16124 TREE_VALUE (parser->unparsed_functions_queues)
16125 = tree_cons (NULL_TREE, fn,
16126 TREE_VALUE (parser->unparsed_functions_queues));
16131 /* Parse a template-argument-list, as well as the trailing ">" (but
16132 not the opening ">"). See cp_parser_template_argument_list for the
16136 cp_parser_enclosed_template_argument_list (cp_parser* parser)
16140 tree saved_qualifying_scope;
16141 tree saved_object_scope;
16142 bool saved_greater_than_is_operator_p;
16143 bool saved_skip_evaluation;
16147 When parsing a template-id, the first non-nested `>' is taken as
16148 the end of the template-argument-list rather than a greater-than
16150 saved_greater_than_is_operator_p
16151 = parser->greater_than_is_operator_p;
16152 parser->greater_than_is_operator_p = false;
16153 /* Parsing the argument list may modify SCOPE, so we save it
16155 saved_scope = parser->scope;
16156 saved_qualifying_scope = parser->qualifying_scope;
16157 saved_object_scope = parser->object_scope;
16158 /* We need to evaluate the template arguments, even though this
16159 template-id may be nested within a "sizeof". */
16160 saved_skip_evaluation = skip_evaluation;
16161 skip_evaluation = false;
16162 /* Parse the template-argument-list itself. */
16163 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
16164 arguments = NULL_TREE;
16166 arguments = cp_parser_template_argument_list (parser);
16167 /* Look for the `>' that ends the template-argument-list. If we find
16168 a '>>' instead, it's probably just a typo. */
16169 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
16171 if (!saved_greater_than_is_operator_p)
16173 /* If we're in a nested template argument list, the '>>' has
16174 to be a typo for '> >'. We emit the error message, but we
16175 continue parsing and we push a '>' as next token, so that
16176 the argument list will be parsed correctly. Note that the
16177 global source location is still on the token before the
16178 '>>', so we need to say explicitly where we want it. */
16179 cp_token *token = cp_lexer_peek_token (parser->lexer);
16180 error ("%H%<>>%> should be %<> >%> "
16181 "within a nested template argument list",
16184 /* ??? Proper recovery should terminate two levels of
16185 template argument list here. */
16186 token->type = CPP_GREATER;
16190 /* If this is not a nested template argument list, the '>>'
16191 is a typo for '>'. Emit an error message and continue.
16192 Same deal about the token location, but here we can get it
16193 right by consuming the '>>' before issuing the diagnostic. */
16194 cp_lexer_consume_token (parser->lexer);
16195 error ("spurious %<>>%>, use %<>%> to terminate "
16196 "a template argument list");
16200 cp_parser_skip_to_end_of_template_parameter_list (parser);
16201 /* The `>' token might be a greater-than operator again now. */
16202 parser->greater_than_is_operator_p
16203 = saved_greater_than_is_operator_p;
16204 /* Restore the SAVED_SCOPE. */
16205 parser->scope = saved_scope;
16206 parser->qualifying_scope = saved_qualifying_scope;
16207 parser->object_scope = saved_object_scope;
16208 skip_evaluation = saved_skip_evaluation;
16213 /* MEMBER_FUNCTION is a member function, or a friend. If default
16214 arguments, or the body of the function have not yet been parsed,
16218 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
16220 /* If this member is a template, get the underlying
16222 if (DECL_FUNCTION_TEMPLATE_P (member_function))
16223 member_function = DECL_TEMPLATE_RESULT (member_function);
16225 /* There should not be any class definitions in progress at this
16226 point; the bodies of members are only parsed outside of all class
16228 gcc_assert (parser->num_classes_being_defined == 0);
16229 /* While we're parsing the member functions we might encounter more
16230 classes. We want to handle them right away, but we don't want
16231 them getting mixed up with functions that are currently in the
16233 parser->unparsed_functions_queues
16234 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
16236 /* Make sure that any template parameters are in scope. */
16237 maybe_begin_member_template_processing (member_function);
16239 /* If the body of the function has not yet been parsed, parse it
16241 if (DECL_PENDING_INLINE_P (member_function))
16243 tree function_scope;
16244 cp_token_cache *tokens;
16246 /* The function is no longer pending; we are processing it. */
16247 tokens = DECL_PENDING_INLINE_INFO (member_function);
16248 DECL_PENDING_INLINE_INFO (member_function) = NULL;
16249 DECL_PENDING_INLINE_P (member_function) = 0;
16251 /* If this is a local class, enter the scope of the containing
16253 function_scope = current_function_decl;
16254 if (function_scope)
16255 push_function_context_to (function_scope);
16258 /* Push the body of the function onto the lexer stack. */
16259 cp_parser_push_lexer_for_tokens (parser, tokens);
16261 /* Let the front end know that we going to be defining this
16263 start_preparsed_function (member_function, NULL_TREE,
16264 SF_PRE_PARSED | SF_INCLASS_INLINE);
16266 /* Don't do access checking if it is a templated function. */
16267 if (processing_template_decl)
16268 push_deferring_access_checks (dk_no_check);
16270 /* Now, parse the body of the function. */
16271 cp_parser_function_definition_after_declarator (parser,
16272 /*inline_p=*/true);
16274 if (processing_template_decl)
16275 pop_deferring_access_checks ();
16277 /* Leave the scope of the containing function. */
16278 if (function_scope)
16279 pop_function_context_from (function_scope);
16280 cp_parser_pop_lexer (parser);
16283 /* Remove any template parameters from the symbol table. */
16284 maybe_end_member_template_processing ();
16286 /* Restore the queue. */
16287 parser->unparsed_functions_queues
16288 = TREE_CHAIN (parser->unparsed_functions_queues);
16291 /* If DECL contains any default args, remember it on the unparsed
16292 functions queue. */
16295 cp_parser_save_default_args (cp_parser* parser, tree decl)
16299 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
16301 probe = TREE_CHAIN (probe))
16302 if (TREE_PURPOSE (probe))
16304 TREE_PURPOSE (parser->unparsed_functions_queues)
16305 = tree_cons (current_class_type, decl,
16306 TREE_PURPOSE (parser->unparsed_functions_queues));
16311 /* FN is a FUNCTION_DECL which may contains a parameter with an
16312 unparsed DEFAULT_ARG. Parse the default args now. This function
16313 assumes that the current scope is the scope in which the default
16314 argument should be processed. */
16317 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
16319 bool saved_local_variables_forbidden_p;
16322 /* While we're parsing the default args, we might (due to the
16323 statement expression extension) encounter more classes. We want
16324 to handle them right away, but we don't want them getting mixed
16325 up with default args that are currently in the queue. */
16326 parser->unparsed_functions_queues
16327 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
16329 /* Local variable names (and the `this' keyword) may not appear
16330 in a default argument. */
16331 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
16332 parser->local_variables_forbidden_p = true;
16334 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
16336 parm = TREE_CHAIN (parm))
16338 cp_token_cache *tokens;
16339 tree default_arg = TREE_PURPOSE (parm);
16341 VEC(tree,gc) *insts;
16348 if (TREE_CODE (default_arg) != DEFAULT_ARG)
16349 /* This can happen for a friend declaration for a function
16350 already declared with default arguments. */
16353 /* Push the saved tokens for the default argument onto the parser's
16355 tokens = DEFARG_TOKENS (default_arg);
16356 cp_parser_push_lexer_for_tokens (parser, tokens);
16358 /* Parse the assignment-expression. */
16359 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false);
16361 if (!processing_template_decl)
16362 parsed_arg = check_default_argument (TREE_VALUE (parm), parsed_arg);
16364 TREE_PURPOSE (parm) = parsed_arg;
16366 /* Update any instantiations we've already created. */
16367 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
16368 VEC_iterate (tree, insts, ix, copy); ix++)
16369 TREE_PURPOSE (copy) = parsed_arg;
16371 /* If the token stream has not been completely used up, then
16372 there was extra junk after the end of the default
16374 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
16375 cp_parser_error (parser, "expected %<,%>");
16377 /* Revert to the main lexer. */
16378 cp_parser_pop_lexer (parser);
16381 /* Make sure no default arg is missing. */
16382 check_default_args (fn);
16384 /* Restore the state of local_variables_forbidden_p. */
16385 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
16387 /* Restore the queue. */
16388 parser->unparsed_functions_queues
16389 = TREE_CHAIN (parser->unparsed_functions_queues);
16392 /* Parse the operand of `sizeof' (or a similar operator). Returns
16393 either a TYPE or an expression, depending on the form of the
16394 input. The KEYWORD indicates which kind of expression we have
16398 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
16400 static const char *format;
16401 tree expr = NULL_TREE;
16402 const char *saved_message;
16403 bool saved_integral_constant_expression_p;
16404 bool saved_non_integral_constant_expression_p;
16406 /* Initialize FORMAT the first time we get here. */
16408 format = "types may not be defined in '%s' expressions";
16410 /* Types cannot be defined in a `sizeof' expression. Save away the
16412 saved_message = parser->type_definition_forbidden_message;
16413 /* And create the new one. */
16414 parser->type_definition_forbidden_message
16415 = XNEWVEC (const char, strlen (format)
16416 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
16418 sprintf ((char *) parser->type_definition_forbidden_message,
16419 format, IDENTIFIER_POINTER (ridpointers[keyword]));
16421 /* The restrictions on constant-expressions do not apply inside
16422 sizeof expressions. */
16423 saved_integral_constant_expression_p
16424 = parser->integral_constant_expression_p;
16425 saved_non_integral_constant_expression_p
16426 = parser->non_integral_constant_expression_p;
16427 parser->integral_constant_expression_p = false;
16429 /* Do not actually evaluate the expression. */
16431 /* If it's a `(', then we might be looking at the type-id
16433 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
16436 bool saved_in_type_id_in_expr_p;
16438 /* We can't be sure yet whether we're looking at a type-id or an
16440 cp_parser_parse_tentatively (parser);
16441 /* Consume the `('. */
16442 cp_lexer_consume_token (parser->lexer);
16443 /* Parse the type-id. */
16444 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
16445 parser->in_type_id_in_expr_p = true;
16446 type = cp_parser_type_id (parser);
16447 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
16448 /* Now, look for the trailing `)'. */
16449 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16450 /* If all went well, then we're done. */
16451 if (cp_parser_parse_definitely (parser))
16453 cp_decl_specifier_seq decl_specs;
16455 /* Build a trivial decl-specifier-seq. */
16456 clear_decl_specs (&decl_specs);
16457 decl_specs.type = type;
16459 /* Call grokdeclarator to figure out what type this is. */
16460 expr = grokdeclarator (NULL,
16464 /*attrlist=*/NULL);
16468 /* If the type-id production did not work out, then we must be
16469 looking at the unary-expression production. */
16471 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
16473 /* Go back to evaluating expressions. */
16476 /* Free the message we created. */
16477 free ((char *) parser->type_definition_forbidden_message);
16478 /* And restore the old one. */
16479 parser->type_definition_forbidden_message = saved_message;
16480 parser->integral_constant_expression_p
16481 = saved_integral_constant_expression_p;
16482 parser->non_integral_constant_expression_p
16483 = saved_non_integral_constant_expression_p;
16488 /* If the current declaration has no declarator, return true. */
16491 cp_parser_declares_only_class_p (cp_parser *parser)
16493 /* If the next token is a `;' or a `,' then there is no
16495 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
16496 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
16499 /* Update the DECL_SPECS to reflect the storage class indicated by
16503 cp_parser_set_storage_class (cp_parser *parser,
16504 cp_decl_specifier_seq *decl_specs,
16507 cp_storage_class storage_class;
16509 if (parser->in_unbraced_linkage_specification_p)
16511 error ("invalid use of %qD in linkage specification",
16512 ridpointers[keyword]);
16515 else if (decl_specs->storage_class != sc_none)
16517 decl_specs->conflicting_specifiers_p = true;
16521 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
16522 && decl_specs->specs[(int) ds_thread])
16524 error ("%<__thread%> before %qD", ridpointers[keyword]);
16525 decl_specs->specs[(int) ds_thread] = 0;
16531 storage_class = sc_auto;
16534 storage_class = sc_register;
16537 storage_class = sc_static;
16540 storage_class = sc_extern;
16543 storage_class = sc_mutable;
16546 gcc_unreachable ();
16548 decl_specs->storage_class = storage_class;
16550 /* A storage class specifier cannot be applied alongside a typedef
16551 specifier. If there is a typedef specifier present then set
16552 conflicting_specifiers_p which will trigger an error later
16553 on in grokdeclarator. */
16554 if (decl_specs->specs[(int)ds_typedef])
16555 decl_specs->conflicting_specifiers_p = true;
16558 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
16559 is true, the type is a user-defined type; otherwise it is a
16560 built-in type specified by a keyword. */
16563 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
16565 bool user_defined_p)
16567 decl_specs->any_specifiers_p = true;
16569 /* If the user tries to redeclare bool or wchar_t (with, for
16570 example, in "typedef int wchar_t;") we remember that this is what
16571 happened. In system headers, we ignore these declarations so
16572 that G++ can work with system headers that are not C++-safe. */
16573 if (decl_specs->specs[(int) ds_typedef]
16575 && (type_spec == boolean_type_node
16576 || type_spec == wchar_type_node)
16577 && (decl_specs->type
16578 || decl_specs->specs[(int) ds_long]
16579 || decl_specs->specs[(int) ds_short]
16580 || decl_specs->specs[(int) ds_unsigned]
16581 || decl_specs->specs[(int) ds_signed]))
16583 decl_specs->redefined_builtin_type = type_spec;
16584 if (!decl_specs->type)
16586 decl_specs->type = type_spec;
16587 decl_specs->user_defined_type_p = false;
16590 else if (decl_specs->type)
16591 decl_specs->multiple_types_p = true;
16594 decl_specs->type = type_spec;
16595 decl_specs->user_defined_type_p = user_defined_p;
16596 decl_specs->redefined_builtin_type = NULL_TREE;
16600 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
16601 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
16604 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
16606 return decl_specifiers->specs[(int) ds_friend] != 0;
16609 /* If the next token is of the indicated TYPE, consume it. Otherwise,
16610 issue an error message indicating that TOKEN_DESC was expected.
16612 Returns the token consumed, if the token had the appropriate type.
16613 Otherwise, returns NULL. */
16616 cp_parser_require (cp_parser* parser,
16617 enum cpp_ttype type,
16618 const char* token_desc)
16620 if (cp_lexer_next_token_is (parser->lexer, type))
16621 return cp_lexer_consume_token (parser->lexer);
16624 /* Output the MESSAGE -- unless we're parsing tentatively. */
16625 if (!cp_parser_simulate_error (parser))
16627 char *message = concat ("expected ", token_desc, NULL);
16628 cp_parser_error (parser, message);
16635 /* An error message is produced if the next token is not '>'.
16636 All further tokens are skipped until the desired token is
16637 found or '{', '}', ';' or an unbalanced ')' or ']'. */
16640 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
16642 /* Current level of '< ... >'. */
16643 unsigned level = 0;
16644 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
16645 unsigned nesting_depth = 0;
16647 /* Are we ready, yet? If not, issue error message. */
16648 if (cp_parser_require (parser, CPP_GREATER, "%<>%>"))
16651 /* Skip tokens until the desired token is found. */
16654 /* Peek at the next token. */
16655 switch (cp_lexer_peek_token (parser->lexer)->type)
16658 if (!nesting_depth)
16663 if (!nesting_depth && level-- == 0)
16665 /* We've reached the token we want, consume it and stop. */
16666 cp_lexer_consume_token (parser->lexer);
16671 case CPP_OPEN_PAREN:
16672 case CPP_OPEN_SQUARE:
16676 case CPP_CLOSE_PAREN:
16677 case CPP_CLOSE_SQUARE:
16678 if (nesting_depth-- == 0)
16683 case CPP_PRAGMA_EOL:
16684 case CPP_SEMICOLON:
16685 case CPP_OPEN_BRACE:
16686 case CPP_CLOSE_BRACE:
16687 /* The '>' was probably forgotten, don't look further. */
16694 /* Consume this token. */
16695 cp_lexer_consume_token (parser->lexer);
16699 /* If the next token is the indicated keyword, consume it. Otherwise,
16700 issue an error message indicating that TOKEN_DESC was expected.
16702 Returns the token consumed, if the token had the appropriate type.
16703 Otherwise, returns NULL. */
16706 cp_parser_require_keyword (cp_parser* parser,
16708 const char* token_desc)
16710 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
16712 if (token && token->keyword != keyword)
16714 dyn_string_t error_msg;
16716 /* Format the error message. */
16717 error_msg = dyn_string_new (0);
16718 dyn_string_append_cstr (error_msg, "expected ");
16719 dyn_string_append_cstr (error_msg, token_desc);
16720 cp_parser_error (parser, error_msg->s);
16721 dyn_string_delete (error_msg);
16728 /* Returns TRUE iff TOKEN is a token that can begin the body of a
16729 function-definition. */
16732 cp_parser_token_starts_function_definition_p (cp_token* token)
16734 return (/* An ordinary function-body begins with an `{'. */
16735 token->type == CPP_OPEN_BRACE
16736 /* A ctor-initializer begins with a `:'. */
16737 || token->type == CPP_COLON
16738 /* A function-try-block begins with `try'. */
16739 || token->keyword == RID_TRY
16740 /* The named return value extension begins with `return'. */
16741 || token->keyword == RID_RETURN);
16744 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
16748 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
16752 token = cp_lexer_peek_token (parser->lexer);
16753 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
16756 /* Returns TRUE iff the next token is the "," or ">" ending a
16757 template-argument. */
16760 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
16764 token = cp_lexer_peek_token (parser->lexer);
16765 return (token->type == CPP_COMMA || token->type == CPP_GREATER);
16768 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
16769 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
16772 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
16777 token = cp_lexer_peek_nth_token (parser->lexer, n);
16778 if (token->type == CPP_LESS)
16780 /* Check for the sequence `<::' in the original code. It would be lexed as
16781 `[:', where `[' is a digraph, and there is no whitespace before
16783 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
16786 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
16787 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
16793 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
16794 or none_type otherwise. */
16796 static enum tag_types
16797 cp_parser_token_is_class_key (cp_token* token)
16799 switch (token->keyword)
16804 return record_type;
16813 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
16816 cp_parser_check_class_key (enum tag_types class_key, tree type)
16818 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
16819 pedwarn ("%qs tag used in naming %q#T",
16820 class_key == union_type ? "union"
16821 : class_key == record_type ? "struct" : "class",
16825 /* Issue an error message if DECL is redeclared with different
16826 access than its original declaration [class.access.spec/3].
16827 This applies to nested classes and nested class templates.
16831 cp_parser_check_access_in_redeclaration (tree decl)
16833 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
16836 if ((TREE_PRIVATE (decl)
16837 != (current_access_specifier == access_private_node))
16838 || (TREE_PROTECTED (decl)
16839 != (current_access_specifier == access_protected_node)))
16840 error ("%qD redeclared with different access", decl);
16843 /* Look for the `template' keyword, as a syntactic disambiguator.
16844 Return TRUE iff it is present, in which case it will be
16848 cp_parser_optional_template_keyword (cp_parser *parser)
16850 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
16852 /* The `template' keyword can only be used within templates;
16853 outside templates the parser can always figure out what is a
16854 template and what is not. */
16855 if (!processing_template_decl)
16857 error ("%<template%> (as a disambiguator) is only allowed "
16858 "within templates");
16859 /* If this part of the token stream is rescanned, the same
16860 error message would be generated. So, we purge the token
16861 from the stream. */
16862 cp_lexer_purge_token (parser->lexer);
16867 /* Consume the `template' keyword. */
16868 cp_lexer_consume_token (parser->lexer);
16876 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
16877 set PARSER->SCOPE, and perform other related actions. */
16880 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
16883 struct tree_check *check_value;
16884 deferred_access_check *chk;
16885 VEC (deferred_access_check,gc) *checks;
16887 /* Get the stored value. */
16888 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
16889 /* Perform any access checks that were deferred. */
16890 checks = check_value->checks;
16894 VEC_iterate (deferred_access_check, checks, i, chk) ;
16897 perform_or_defer_access_check (chk->binfo,
16902 /* Set the scope from the stored value. */
16903 parser->scope = check_value->value;
16904 parser->qualifying_scope = check_value->qualifying_scope;
16905 parser->object_scope = NULL_TREE;
16908 /* Consume tokens up through a non-nested END token. */
16911 cp_parser_cache_group (cp_parser *parser,
16912 enum cpp_ttype end,
16919 /* Abort a parenthesized expression if we encounter a brace. */
16920 if ((end == CPP_CLOSE_PAREN || depth == 0)
16921 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16923 /* If we've reached the end of the file, stop. */
16924 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF)
16925 || (end != CPP_PRAGMA_EOL
16926 && cp_lexer_next_token_is (parser->lexer, CPP_PRAGMA_EOL)))
16928 /* Consume the next token. */
16929 token = cp_lexer_consume_token (parser->lexer);
16930 /* See if it starts a new group. */
16931 if (token->type == CPP_OPEN_BRACE)
16933 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
16937 else if (token->type == CPP_OPEN_PAREN)
16938 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
16939 else if (token->type == CPP_PRAGMA)
16940 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
16941 else if (token->type == end)
16946 /* Begin parsing tentatively. We always save tokens while parsing
16947 tentatively so that if the tentative parsing fails we can restore the
16951 cp_parser_parse_tentatively (cp_parser* parser)
16953 /* Enter a new parsing context. */
16954 parser->context = cp_parser_context_new (parser->context);
16955 /* Begin saving tokens. */
16956 cp_lexer_save_tokens (parser->lexer);
16957 /* In order to avoid repetitive access control error messages,
16958 access checks are queued up until we are no longer parsing
16960 push_deferring_access_checks (dk_deferred);
16963 /* Commit to the currently active tentative parse. */
16966 cp_parser_commit_to_tentative_parse (cp_parser* parser)
16968 cp_parser_context *context;
16971 /* Mark all of the levels as committed. */
16972 lexer = parser->lexer;
16973 for (context = parser->context; context->next; context = context->next)
16975 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
16977 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
16978 while (!cp_lexer_saving_tokens (lexer))
16979 lexer = lexer->next;
16980 cp_lexer_commit_tokens (lexer);
16984 /* Abort the currently active tentative parse. All consumed tokens
16985 will be rolled back, and no diagnostics will be issued. */
16988 cp_parser_abort_tentative_parse (cp_parser* parser)
16990 cp_parser_simulate_error (parser);
16991 /* Now, pretend that we want to see if the construct was
16992 successfully parsed. */
16993 cp_parser_parse_definitely (parser);
16996 /* Stop parsing tentatively. If a parse error has occurred, restore the
16997 token stream. Otherwise, commit to the tokens we have consumed.
16998 Returns true if no error occurred; false otherwise. */
17001 cp_parser_parse_definitely (cp_parser* parser)
17003 bool error_occurred;
17004 cp_parser_context *context;
17006 /* Remember whether or not an error occurred, since we are about to
17007 destroy that information. */
17008 error_occurred = cp_parser_error_occurred (parser);
17009 /* Remove the topmost context from the stack. */
17010 context = parser->context;
17011 parser->context = context->next;
17012 /* If no parse errors occurred, commit to the tentative parse. */
17013 if (!error_occurred)
17015 /* Commit to the tokens read tentatively, unless that was
17017 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
17018 cp_lexer_commit_tokens (parser->lexer);
17020 pop_to_parent_deferring_access_checks ();
17022 /* Otherwise, if errors occurred, roll back our state so that things
17023 are just as they were before we began the tentative parse. */
17026 cp_lexer_rollback_tokens (parser->lexer);
17027 pop_deferring_access_checks ();
17029 /* Add the context to the front of the free list. */
17030 context->next = cp_parser_context_free_list;
17031 cp_parser_context_free_list = context;
17033 return !error_occurred;
17036 /* Returns true if we are parsing tentatively and are not committed to
17037 this tentative parse. */
17040 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
17042 return (cp_parser_parsing_tentatively (parser)
17043 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
17046 /* Returns nonzero iff an error has occurred during the most recent
17047 tentative parse. */
17050 cp_parser_error_occurred (cp_parser* parser)
17052 return (cp_parser_parsing_tentatively (parser)
17053 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
17056 /* Returns nonzero if GNU extensions are allowed. */
17059 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
17061 return parser->allow_gnu_extensions_p;
17064 /* Objective-C++ Productions */
17067 /* Parse an Objective-C expression, which feeds into a primary-expression
17071 objc-message-expression
17072 objc-string-literal
17073 objc-encode-expression
17074 objc-protocol-expression
17075 objc-selector-expression
17077 Returns a tree representation of the expression. */
17080 cp_parser_objc_expression (cp_parser* parser)
17082 /* Try to figure out what kind of declaration is present. */
17083 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17087 case CPP_OPEN_SQUARE:
17088 return cp_parser_objc_message_expression (parser);
17090 case CPP_OBJC_STRING:
17091 kwd = cp_lexer_consume_token (parser->lexer);
17092 return objc_build_string_object (kwd->u.value);
17095 switch (kwd->keyword)
17097 case RID_AT_ENCODE:
17098 return cp_parser_objc_encode_expression (parser);
17100 case RID_AT_PROTOCOL:
17101 return cp_parser_objc_protocol_expression (parser);
17103 case RID_AT_SELECTOR:
17104 return cp_parser_objc_selector_expression (parser);
17110 error ("misplaced %<@%D%> Objective-C++ construct", kwd->u.value);
17111 cp_parser_skip_to_end_of_block_or_statement (parser);
17114 return error_mark_node;
17117 /* Parse an Objective-C message expression.
17119 objc-message-expression:
17120 [ objc-message-receiver objc-message-args ]
17122 Returns a representation of an Objective-C message. */
17125 cp_parser_objc_message_expression (cp_parser* parser)
17127 tree receiver, messageargs;
17129 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
17130 receiver = cp_parser_objc_message_receiver (parser);
17131 messageargs = cp_parser_objc_message_args (parser);
17132 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
17134 return objc_build_message_expr (build_tree_list (receiver, messageargs));
17137 /* Parse an objc-message-receiver.
17139 objc-message-receiver:
17141 simple-type-specifier
17143 Returns a representation of the type or expression. */
17146 cp_parser_objc_message_receiver (cp_parser* parser)
17150 /* An Objective-C message receiver may be either (1) a type
17151 or (2) an expression. */
17152 cp_parser_parse_tentatively (parser);
17153 rcv = cp_parser_expression (parser, false);
17155 if (cp_parser_parse_definitely (parser))
17158 rcv = cp_parser_simple_type_specifier (parser,
17159 /*decl_specs=*/NULL,
17160 CP_PARSER_FLAGS_NONE);
17162 return objc_get_class_reference (rcv);
17165 /* Parse the arguments and selectors comprising an Objective-C message.
17170 objc-selector-args , objc-comma-args
17172 objc-selector-args:
17173 objc-selector [opt] : assignment-expression
17174 objc-selector-args objc-selector [opt] : assignment-expression
17177 assignment-expression
17178 objc-comma-args , assignment-expression
17180 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
17181 selector arguments and TREE_VALUE containing a list of comma
17185 cp_parser_objc_message_args (cp_parser* parser)
17187 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
17188 bool maybe_unary_selector_p = true;
17189 cp_token *token = cp_lexer_peek_token (parser->lexer);
17191 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
17193 tree selector = NULL_TREE, arg;
17195 if (token->type != CPP_COLON)
17196 selector = cp_parser_objc_selector (parser);
17198 /* Detect if we have a unary selector. */
17199 if (maybe_unary_selector_p
17200 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
17201 return build_tree_list (selector, NULL_TREE);
17203 maybe_unary_selector_p = false;
17204 cp_parser_require (parser, CPP_COLON, "`:'");
17205 arg = cp_parser_assignment_expression (parser, false);
17208 = chainon (sel_args,
17209 build_tree_list (selector, arg));
17211 token = cp_lexer_peek_token (parser->lexer);
17214 /* Handle non-selector arguments, if any. */
17215 while (token->type == CPP_COMMA)
17219 cp_lexer_consume_token (parser->lexer);
17220 arg = cp_parser_assignment_expression (parser, false);
17223 = chainon (addl_args,
17224 build_tree_list (NULL_TREE, arg));
17226 token = cp_lexer_peek_token (parser->lexer);
17229 return build_tree_list (sel_args, addl_args);
17232 /* Parse an Objective-C encode expression.
17234 objc-encode-expression:
17235 @encode objc-typename
17237 Returns an encoded representation of the type argument. */
17240 cp_parser_objc_encode_expression (cp_parser* parser)
17244 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
17245 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17246 type = complete_type (cp_parser_type_id (parser));
17247 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17251 error ("%<@encode%> must specify a type as an argument");
17252 return error_mark_node;
17255 return objc_build_encode_expr (type);
17258 /* Parse an Objective-C @defs expression. */
17261 cp_parser_objc_defs_expression (cp_parser *parser)
17265 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
17266 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17267 name = cp_parser_identifier (parser);
17268 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17270 return objc_get_class_ivars (name);
17273 /* Parse an Objective-C protocol expression.
17275 objc-protocol-expression:
17276 @protocol ( identifier )
17278 Returns a representation of the protocol expression. */
17281 cp_parser_objc_protocol_expression (cp_parser* parser)
17285 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17286 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17287 proto = cp_parser_identifier (parser);
17288 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17290 return objc_build_protocol_expr (proto);
17293 /* Parse an Objective-C selector expression.
17295 objc-selector-expression:
17296 @selector ( objc-method-signature )
17298 objc-method-signature:
17304 objc-selector-seq objc-selector :
17306 Returns a representation of the method selector. */
17309 cp_parser_objc_selector_expression (cp_parser* parser)
17311 tree sel_seq = NULL_TREE;
17312 bool maybe_unary_selector_p = true;
17315 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
17316 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17317 token = cp_lexer_peek_token (parser->lexer);
17319 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
17320 || token->type == CPP_SCOPE)
17322 tree selector = NULL_TREE;
17324 if (token->type != CPP_COLON
17325 || token->type == CPP_SCOPE)
17326 selector = cp_parser_objc_selector (parser);
17328 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
17329 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
17331 /* Detect if we have a unary selector. */
17332 if (maybe_unary_selector_p)
17334 sel_seq = selector;
17335 goto finish_selector;
17339 cp_parser_error (parser, "expected %<:%>");
17342 maybe_unary_selector_p = false;
17343 token = cp_lexer_consume_token (parser->lexer);
17345 if (token->type == CPP_SCOPE)
17348 = chainon (sel_seq,
17349 build_tree_list (selector, NULL_TREE));
17351 = chainon (sel_seq,
17352 build_tree_list (NULL_TREE, NULL_TREE));
17356 = chainon (sel_seq,
17357 build_tree_list (selector, NULL_TREE));
17359 token = cp_lexer_peek_token (parser->lexer);
17363 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17365 return objc_build_selector_expr (sel_seq);
17368 /* Parse a list of identifiers.
17370 objc-identifier-list:
17372 objc-identifier-list , identifier
17374 Returns a TREE_LIST of identifier nodes. */
17377 cp_parser_objc_identifier_list (cp_parser* parser)
17379 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
17380 cp_token *sep = cp_lexer_peek_token (parser->lexer);
17382 while (sep->type == CPP_COMMA)
17384 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17385 list = chainon (list,
17386 build_tree_list (NULL_TREE,
17387 cp_parser_identifier (parser)));
17388 sep = cp_lexer_peek_token (parser->lexer);
17394 /* Parse an Objective-C alias declaration.
17396 objc-alias-declaration:
17397 @compatibility_alias identifier identifier ;
17399 This function registers the alias mapping with the Objective-C front-end.
17400 It returns nothing. */
17403 cp_parser_objc_alias_declaration (cp_parser* parser)
17407 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
17408 alias = cp_parser_identifier (parser);
17409 orig = cp_parser_identifier (parser);
17410 objc_declare_alias (alias, orig);
17411 cp_parser_consume_semicolon_at_end_of_statement (parser);
17414 /* Parse an Objective-C class forward-declaration.
17416 objc-class-declaration:
17417 @class objc-identifier-list ;
17419 The function registers the forward declarations with the Objective-C
17420 front-end. It returns nothing. */
17423 cp_parser_objc_class_declaration (cp_parser* parser)
17425 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
17426 objc_declare_class (cp_parser_objc_identifier_list (parser));
17427 cp_parser_consume_semicolon_at_end_of_statement (parser);
17430 /* Parse a list of Objective-C protocol references.
17432 objc-protocol-refs-opt:
17433 objc-protocol-refs [opt]
17435 objc-protocol-refs:
17436 < objc-identifier-list >
17438 Returns a TREE_LIST of identifiers, if any. */
17441 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
17443 tree protorefs = NULL_TREE;
17445 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
17447 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
17448 protorefs = cp_parser_objc_identifier_list (parser);
17449 cp_parser_require (parser, CPP_GREATER, "`>'");
17455 /* Parse a Objective-C visibility specification. */
17458 cp_parser_objc_visibility_spec (cp_parser* parser)
17460 cp_token *vis = cp_lexer_peek_token (parser->lexer);
17462 switch (vis->keyword)
17464 case RID_AT_PRIVATE:
17465 objc_set_visibility (2);
17467 case RID_AT_PROTECTED:
17468 objc_set_visibility (0);
17470 case RID_AT_PUBLIC:
17471 objc_set_visibility (1);
17477 /* Eat '@private'/'@protected'/'@public'. */
17478 cp_lexer_consume_token (parser->lexer);
17481 /* Parse an Objective-C method type. */
17484 cp_parser_objc_method_type (cp_parser* parser)
17486 objc_set_method_type
17487 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
17492 /* Parse an Objective-C protocol qualifier. */
17495 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
17497 tree quals = NULL_TREE, node;
17498 cp_token *token = cp_lexer_peek_token (parser->lexer);
17500 node = token->u.value;
17502 while (node && TREE_CODE (node) == IDENTIFIER_NODE
17503 && (node == ridpointers [(int) RID_IN]
17504 || node == ridpointers [(int) RID_OUT]
17505 || node == ridpointers [(int) RID_INOUT]
17506 || node == ridpointers [(int) RID_BYCOPY]
17507 || node == ridpointers [(int) RID_BYREF]
17508 || node == ridpointers [(int) RID_ONEWAY]))
17510 quals = tree_cons (NULL_TREE, node, quals);
17511 cp_lexer_consume_token (parser->lexer);
17512 token = cp_lexer_peek_token (parser->lexer);
17513 node = token->u.value;
17519 /* Parse an Objective-C typename. */
17522 cp_parser_objc_typename (cp_parser* parser)
17524 tree typename = NULL_TREE;
17526 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
17528 tree proto_quals, cp_type = NULL_TREE;
17530 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17531 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
17533 /* An ObjC type name may consist of just protocol qualifiers, in which
17534 case the type shall default to 'id'. */
17535 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
17536 cp_type = cp_parser_type_id (parser);
17538 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17539 typename = build_tree_list (proto_quals, cp_type);
17545 /* Check to see if TYPE refers to an Objective-C selector name. */
17548 cp_parser_objc_selector_p (enum cpp_ttype type)
17550 return (type == CPP_NAME || type == CPP_KEYWORD
17551 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
17552 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
17553 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
17554 || type == CPP_XOR || type == CPP_XOR_EQ);
17557 /* Parse an Objective-C selector. */
17560 cp_parser_objc_selector (cp_parser* parser)
17562 cp_token *token = cp_lexer_consume_token (parser->lexer);
17564 if (!cp_parser_objc_selector_p (token->type))
17566 error ("invalid Objective-C++ selector name");
17567 return error_mark_node;
17570 /* C++ operator names are allowed to appear in ObjC selectors. */
17571 switch (token->type)
17573 case CPP_AND_AND: return get_identifier ("and");
17574 case CPP_AND_EQ: return get_identifier ("and_eq");
17575 case CPP_AND: return get_identifier ("bitand");
17576 case CPP_OR: return get_identifier ("bitor");
17577 case CPP_COMPL: return get_identifier ("compl");
17578 case CPP_NOT: return get_identifier ("not");
17579 case CPP_NOT_EQ: return get_identifier ("not_eq");
17580 case CPP_OR_OR: return get_identifier ("or");
17581 case CPP_OR_EQ: return get_identifier ("or_eq");
17582 case CPP_XOR: return get_identifier ("xor");
17583 case CPP_XOR_EQ: return get_identifier ("xor_eq");
17584 default: return token->u.value;
17588 /* Parse an Objective-C params list. */
17591 cp_parser_objc_method_keyword_params (cp_parser* parser)
17593 tree params = NULL_TREE;
17594 bool maybe_unary_selector_p = true;
17595 cp_token *token = cp_lexer_peek_token (parser->lexer);
17597 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
17599 tree selector = NULL_TREE, typename, identifier;
17601 if (token->type != CPP_COLON)
17602 selector = cp_parser_objc_selector (parser);
17604 /* Detect if we have a unary selector. */
17605 if (maybe_unary_selector_p
17606 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
17609 maybe_unary_selector_p = false;
17610 cp_parser_require (parser, CPP_COLON, "`:'");
17611 typename = cp_parser_objc_typename (parser);
17612 identifier = cp_parser_identifier (parser);
17616 objc_build_keyword_decl (selector,
17620 token = cp_lexer_peek_token (parser->lexer);
17626 /* Parse the non-keyword Objective-C params. */
17629 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
17631 tree params = make_node (TREE_LIST);
17632 cp_token *token = cp_lexer_peek_token (parser->lexer);
17633 *ellipsisp = false; /* Initially, assume no ellipsis. */
17635 while (token->type == CPP_COMMA)
17637 cp_parameter_declarator *parmdecl;
17640 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17641 token = cp_lexer_peek_token (parser->lexer);
17643 if (token->type == CPP_ELLIPSIS)
17645 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
17650 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
17651 parm = grokdeclarator (parmdecl->declarator,
17652 &parmdecl->decl_specifiers,
17653 PARM, /*initialized=*/0,
17654 /*attrlist=*/NULL);
17656 chainon (params, build_tree_list (NULL_TREE, parm));
17657 token = cp_lexer_peek_token (parser->lexer);
17663 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
17666 cp_parser_objc_interstitial_code (cp_parser* parser)
17668 cp_token *token = cp_lexer_peek_token (parser->lexer);
17670 /* If the next token is `extern' and the following token is a string
17671 literal, then we have a linkage specification. */
17672 if (token->keyword == RID_EXTERN
17673 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
17674 cp_parser_linkage_specification (parser);
17675 /* Handle #pragma, if any. */
17676 else if (token->type == CPP_PRAGMA)
17677 cp_parser_pragma (parser, pragma_external);
17678 /* Allow stray semicolons. */
17679 else if (token->type == CPP_SEMICOLON)
17680 cp_lexer_consume_token (parser->lexer);
17681 /* Finally, try to parse a block-declaration, or a function-definition. */
17683 cp_parser_block_declaration (parser, /*statement_p=*/false);
17686 /* Parse a method signature. */
17689 cp_parser_objc_method_signature (cp_parser* parser)
17691 tree rettype, kwdparms, optparms;
17692 bool ellipsis = false;
17694 cp_parser_objc_method_type (parser);
17695 rettype = cp_parser_objc_typename (parser);
17696 kwdparms = cp_parser_objc_method_keyword_params (parser);
17697 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
17699 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
17702 /* Pars an Objective-C method prototype list. */
17705 cp_parser_objc_method_prototype_list (cp_parser* parser)
17707 cp_token *token = cp_lexer_peek_token (parser->lexer);
17709 while (token->keyword != RID_AT_END)
17711 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
17713 objc_add_method_declaration
17714 (cp_parser_objc_method_signature (parser));
17715 cp_parser_consume_semicolon_at_end_of_statement (parser);
17718 /* Allow for interspersed non-ObjC++ code. */
17719 cp_parser_objc_interstitial_code (parser);
17721 token = cp_lexer_peek_token (parser->lexer);
17724 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17725 objc_finish_interface ();
17728 /* Parse an Objective-C method definition list. */
17731 cp_parser_objc_method_definition_list (cp_parser* parser)
17733 cp_token *token = cp_lexer_peek_token (parser->lexer);
17735 while (token->keyword != RID_AT_END)
17739 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
17741 push_deferring_access_checks (dk_deferred);
17742 objc_start_method_definition
17743 (cp_parser_objc_method_signature (parser));
17745 /* For historical reasons, we accept an optional semicolon. */
17746 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17747 cp_lexer_consume_token (parser->lexer);
17749 perform_deferred_access_checks ();
17750 stop_deferring_access_checks ();
17751 meth = cp_parser_function_definition_after_declarator (parser,
17753 pop_deferring_access_checks ();
17754 objc_finish_method_definition (meth);
17757 /* Allow for interspersed non-ObjC++ code. */
17758 cp_parser_objc_interstitial_code (parser);
17760 token = cp_lexer_peek_token (parser->lexer);
17763 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17764 objc_finish_implementation ();
17767 /* Parse Objective-C ivars. */
17770 cp_parser_objc_class_ivars (cp_parser* parser)
17772 cp_token *token = cp_lexer_peek_token (parser->lexer);
17774 if (token->type != CPP_OPEN_BRACE)
17775 return; /* No ivars specified. */
17777 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
17778 token = cp_lexer_peek_token (parser->lexer);
17780 while (token->type != CPP_CLOSE_BRACE)
17782 cp_decl_specifier_seq declspecs;
17783 int decl_class_or_enum_p;
17784 tree prefix_attributes;
17786 cp_parser_objc_visibility_spec (parser);
17788 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
17791 cp_parser_decl_specifier_seq (parser,
17792 CP_PARSER_FLAGS_OPTIONAL,
17794 &decl_class_or_enum_p);
17795 prefix_attributes = declspecs.attributes;
17796 declspecs.attributes = NULL_TREE;
17798 /* Keep going until we hit the `;' at the end of the
17800 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
17802 tree width = NULL_TREE, attributes, first_attribute, decl;
17803 cp_declarator *declarator = NULL;
17804 int ctor_dtor_or_conv_p;
17806 /* Check for a (possibly unnamed) bitfield declaration. */
17807 token = cp_lexer_peek_token (parser->lexer);
17808 if (token->type == CPP_COLON)
17811 if (token->type == CPP_NAME
17812 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
17815 /* Get the name of the bitfield. */
17816 declarator = make_id_declarator (NULL_TREE,
17817 cp_parser_identifier (parser),
17821 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17822 /* Get the width of the bitfield. */
17824 = cp_parser_constant_expression (parser,
17825 /*allow_non_constant=*/false,
17830 /* Parse the declarator. */
17832 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
17833 &ctor_dtor_or_conv_p,
17834 /*parenthesized_p=*/NULL,
17835 /*member_p=*/false);
17838 /* Look for attributes that apply to the ivar. */
17839 attributes = cp_parser_attributes_opt (parser);
17840 /* Remember which attributes are prefix attributes and
17842 first_attribute = attributes;
17843 /* Combine the attributes. */
17844 attributes = chainon (prefix_attributes, attributes);
17848 /* Create the bitfield declaration. */
17849 decl = grokbitfield (declarator, &declspecs, width);
17850 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
17853 decl = grokfield (declarator, &declspecs,
17854 NULL_TREE, /*init_const_expr_p=*/false,
17855 NULL_TREE, attributes);
17857 /* Add the instance variable. */
17858 objc_add_instance_variable (decl);
17860 /* Reset PREFIX_ATTRIBUTES. */
17861 while (attributes && TREE_CHAIN (attributes) != first_attribute)
17862 attributes = TREE_CHAIN (attributes);
17864 TREE_CHAIN (attributes) = NULL_TREE;
17866 token = cp_lexer_peek_token (parser->lexer);
17868 if (token->type == CPP_COMMA)
17870 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17876 cp_parser_consume_semicolon_at_end_of_statement (parser);
17877 token = cp_lexer_peek_token (parser->lexer);
17880 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
17881 /* For historical reasons, we accept an optional semicolon. */
17882 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17883 cp_lexer_consume_token (parser->lexer);
17886 /* Parse an Objective-C protocol declaration. */
17889 cp_parser_objc_protocol_declaration (cp_parser* parser)
17891 tree proto, protorefs;
17894 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17895 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
17897 error ("identifier expected after %<@protocol%>");
17901 /* See if we have a forward declaration or a definition. */
17902 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
17904 /* Try a forward declaration first. */
17905 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
17907 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
17909 cp_parser_consume_semicolon_at_end_of_statement (parser);
17912 /* Ok, we got a full-fledged definition (or at least should). */
17915 proto = cp_parser_identifier (parser);
17916 protorefs = cp_parser_objc_protocol_refs_opt (parser);
17917 objc_start_protocol (proto, protorefs);
17918 cp_parser_objc_method_prototype_list (parser);
17922 /* Parse an Objective-C superclass or category. */
17925 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
17928 cp_token *next = cp_lexer_peek_token (parser->lexer);
17930 *super = *categ = NULL_TREE;
17931 if (next->type == CPP_COLON)
17933 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17934 *super = cp_parser_identifier (parser);
17936 else if (next->type == CPP_OPEN_PAREN)
17938 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17939 *categ = cp_parser_identifier (parser);
17940 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17944 /* Parse an Objective-C class interface. */
17947 cp_parser_objc_class_interface (cp_parser* parser)
17949 tree name, super, categ, protos;
17951 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
17952 name = cp_parser_identifier (parser);
17953 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17954 protos = cp_parser_objc_protocol_refs_opt (parser);
17956 /* We have either a class or a category on our hands. */
17958 objc_start_category_interface (name, categ, protos);
17961 objc_start_class_interface (name, super, protos);
17962 /* Handle instance variable declarations, if any. */
17963 cp_parser_objc_class_ivars (parser);
17964 objc_continue_interface ();
17967 cp_parser_objc_method_prototype_list (parser);
17970 /* Parse an Objective-C class implementation. */
17973 cp_parser_objc_class_implementation (cp_parser* parser)
17975 tree name, super, categ;
17977 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
17978 name = cp_parser_identifier (parser);
17979 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17981 /* We have either a class or a category on our hands. */
17983 objc_start_category_implementation (name, categ);
17986 objc_start_class_implementation (name, super);
17987 /* Handle instance variable declarations, if any. */
17988 cp_parser_objc_class_ivars (parser);
17989 objc_continue_implementation ();
17992 cp_parser_objc_method_definition_list (parser);
17995 /* Consume the @end token and finish off the implementation. */
17998 cp_parser_objc_end_implementation (cp_parser* parser)
18000 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
18001 objc_finish_implementation ();
18004 /* Parse an Objective-C declaration. */
18007 cp_parser_objc_declaration (cp_parser* parser)
18009 /* Try to figure out what kind of declaration is present. */
18010 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
18012 switch (kwd->keyword)
18015 cp_parser_objc_alias_declaration (parser);
18018 cp_parser_objc_class_declaration (parser);
18020 case RID_AT_PROTOCOL:
18021 cp_parser_objc_protocol_declaration (parser);
18023 case RID_AT_INTERFACE:
18024 cp_parser_objc_class_interface (parser);
18026 case RID_AT_IMPLEMENTATION:
18027 cp_parser_objc_class_implementation (parser);
18030 cp_parser_objc_end_implementation (parser);
18033 error ("misplaced %<@%D%> Objective-C++ construct", kwd->u.value);
18034 cp_parser_skip_to_end_of_block_or_statement (parser);
18038 /* Parse an Objective-C try-catch-finally statement.
18040 objc-try-catch-finally-stmt:
18041 @try compound-statement objc-catch-clause-seq [opt]
18042 objc-finally-clause [opt]
18044 objc-catch-clause-seq:
18045 objc-catch-clause objc-catch-clause-seq [opt]
18048 @catch ( exception-declaration ) compound-statement
18050 objc-finally-clause
18051 @finally compound-statement
18053 Returns NULL_TREE. */
18056 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
18057 location_t location;
18060 cp_parser_require_keyword (parser, RID_AT_TRY, "`@try'");
18061 location = cp_lexer_peek_token (parser->lexer)->location;
18062 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
18063 node, lest it get absorbed into the surrounding block. */
18064 stmt = push_stmt_list ();
18065 cp_parser_compound_statement (parser, NULL, false);
18066 objc_begin_try_stmt (location, pop_stmt_list (stmt));
18068 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
18070 cp_parameter_declarator *parmdecl;
18073 cp_lexer_consume_token (parser->lexer);
18074 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
18075 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
18076 parm = grokdeclarator (parmdecl->declarator,
18077 &parmdecl->decl_specifiers,
18078 PARM, /*initialized=*/0,
18079 /*attrlist=*/NULL);
18080 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
18081 objc_begin_catch_clause (parm);
18082 cp_parser_compound_statement (parser, NULL, false);
18083 objc_finish_catch_clause ();
18086 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
18088 cp_lexer_consume_token (parser->lexer);
18089 location = cp_lexer_peek_token (parser->lexer)->location;
18090 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
18091 node, lest it get absorbed into the surrounding block. */
18092 stmt = push_stmt_list ();
18093 cp_parser_compound_statement (parser, NULL, false);
18094 objc_build_finally_clause (location, pop_stmt_list (stmt));
18097 return objc_finish_try_stmt ();
18100 /* Parse an Objective-C synchronized statement.
18102 objc-synchronized-stmt:
18103 @synchronized ( expression ) compound-statement
18105 Returns NULL_TREE. */
18108 cp_parser_objc_synchronized_statement (cp_parser *parser) {
18109 location_t location;
18112 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "`@synchronized'");
18114 location = cp_lexer_peek_token (parser->lexer)->location;
18115 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
18116 lock = cp_parser_expression (parser, false);
18117 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
18119 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
18120 node, lest it get absorbed into the surrounding block. */
18121 stmt = push_stmt_list ();
18122 cp_parser_compound_statement (parser, NULL, false);
18124 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
18127 /* Parse an Objective-C throw statement.
18130 @throw assignment-expression [opt] ;
18132 Returns a constructed '@throw' statement. */
18135 cp_parser_objc_throw_statement (cp_parser *parser) {
18136 tree expr = NULL_TREE;
18138 cp_parser_require_keyword (parser, RID_AT_THROW, "`@throw'");
18140 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18141 expr = cp_parser_assignment_expression (parser, false);
18143 cp_parser_consume_semicolon_at_end_of_statement (parser);
18145 return objc_build_throw_stmt (expr);
18148 /* Parse an Objective-C statement. */
18151 cp_parser_objc_statement (cp_parser * parser) {
18152 /* Try to figure out what kind of declaration is present. */
18153 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
18155 switch (kwd->keyword)
18158 return cp_parser_objc_try_catch_finally_statement (parser);
18159 case RID_AT_SYNCHRONIZED:
18160 return cp_parser_objc_synchronized_statement (parser);
18162 return cp_parser_objc_throw_statement (parser);
18164 error ("misplaced %<@%D%> Objective-C++ construct", kwd->u.value);
18165 cp_parser_skip_to_end_of_block_or_statement (parser);
18168 return error_mark_node;
18171 /* OpenMP 2.5 parsing routines. */
18173 /* Returns name of the next clause.
18174 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
18175 the token is not consumed. Otherwise appropriate pragma_omp_clause is
18176 returned and the token is consumed. */
18178 static pragma_omp_clause
18179 cp_parser_omp_clause_name (cp_parser *parser)
18181 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
18183 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
18184 result = PRAGMA_OMP_CLAUSE_IF;
18185 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
18186 result = PRAGMA_OMP_CLAUSE_DEFAULT;
18187 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
18188 result = PRAGMA_OMP_CLAUSE_PRIVATE;
18189 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18191 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
18192 const char *p = IDENTIFIER_POINTER (id);
18197 if (!strcmp ("copyin", p))
18198 result = PRAGMA_OMP_CLAUSE_COPYIN;
18199 else if (!strcmp ("copyprivate", p))
18200 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
18203 if (!strcmp ("firstprivate", p))
18204 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
18207 if (!strcmp ("lastprivate", p))
18208 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
18211 if (!strcmp ("nowait", p))
18212 result = PRAGMA_OMP_CLAUSE_NOWAIT;
18213 else if (!strcmp ("num_threads", p))
18214 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
18217 if (!strcmp ("ordered", p))
18218 result = PRAGMA_OMP_CLAUSE_ORDERED;
18221 if (!strcmp ("reduction", p))
18222 result = PRAGMA_OMP_CLAUSE_REDUCTION;
18225 if (!strcmp ("schedule", p))
18226 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
18227 else if (!strcmp ("shared", p))
18228 result = PRAGMA_OMP_CLAUSE_SHARED;
18233 if (result != PRAGMA_OMP_CLAUSE_NONE)
18234 cp_lexer_consume_token (parser->lexer);
18239 /* Validate that a clause of the given type does not already exist. */
18242 check_no_duplicate_clause (tree clauses, enum tree_code code, const char *name)
18246 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
18247 if (OMP_CLAUSE_CODE (c) == code)
18249 error ("too many %qs clauses", name);
18257 variable-list , identifier
18259 In addition, we match a closing parenthesis. An opening parenthesis
18260 will have been consumed by the caller.
18262 If KIND is nonzero, create the appropriate node and install the decl
18263 in OMP_CLAUSE_DECL and add the node to the head of the list.
18265 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
18266 return the list created. */
18269 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
18276 name = cp_parser_id_expression (parser, /*template_p=*/false,
18277 /*check_dependency_p=*/true,
18278 /*template_p=*/NULL,
18279 /*declarator_p=*/false,
18280 /*optional_p=*/false);
18281 if (name == error_mark_node)
18284 decl = cp_parser_lookup_name_simple (parser, name);
18285 if (decl == error_mark_node)
18286 cp_parser_name_lookup_error (parser, name, decl, NULL);
18287 else if (kind != 0)
18289 tree u = build_omp_clause (kind);
18290 OMP_CLAUSE_DECL (u) = decl;
18291 OMP_CLAUSE_CHAIN (u) = list;
18295 list = tree_cons (decl, NULL_TREE, list);
18298 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
18300 cp_lexer_consume_token (parser->lexer);
18303 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18307 /* Try to resync to an unnested comma. Copied from
18308 cp_parser_parenthesized_expression_list. */
18310 ending = cp_parser_skip_to_closing_parenthesis (parser,
18311 /*recovering=*/true,
18313 /*consume_paren=*/true);
18321 /* Similarly, but expect leading and trailing parenthesis. This is a very
18322 common case for omp clauses. */
18325 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
18327 if (cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18328 return cp_parser_omp_var_list_no_open (parser, kind, list);
18333 default ( shared | none ) */
18336 cp_parser_omp_clause_default (cp_parser *parser, tree list)
18338 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
18341 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18343 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18345 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
18346 const char *p = IDENTIFIER_POINTER (id);
18351 if (strcmp ("none", p) != 0)
18353 kind = OMP_CLAUSE_DEFAULT_NONE;
18357 if (strcmp ("shared", p) != 0)
18359 kind = OMP_CLAUSE_DEFAULT_SHARED;
18366 cp_lexer_consume_token (parser->lexer);
18371 cp_parser_error (parser, "expected %<none%> or %<shared%>");
18374 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18375 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18376 /*or_comma=*/false,
18377 /*consume_paren=*/true);
18379 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
18382 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default");
18383 c = build_omp_clause (OMP_CLAUSE_DEFAULT);
18384 OMP_CLAUSE_CHAIN (c) = list;
18385 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
18391 if ( expression ) */
18394 cp_parser_omp_clause_if (cp_parser *parser, tree list)
18398 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18401 t = cp_parser_condition (parser);
18403 if (t == error_mark_node
18404 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18405 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18406 /*or_comma=*/false,
18407 /*consume_paren=*/true);
18409 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if");
18411 c = build_omp_clause (OMP_CLAUSE_IF);
18412 OMP_CLAUSE_IF_EXPR (c) = t;
18413 OMP_CLAUSE_CHAIN (c) = list;
18422 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED, tree list)
18426 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait");
18428 c = build_omp_clause (OMP_CLAUSE_NOWAIT);
18429 OMP_CLAUSE_CHAIN (c) = list;
18434 num_threads ( expression ) */
18437 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list)
18441 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18444 t = cp_parser_expression (parser, false);
18446 if (t == error_mark_node
18447 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18448 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18449 /*or_comma=*/false,
18450 /*consume_paren=*/true);
18452 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS, "num_threads");
18454 c = build_omp_clause (OMP_CLAUSE_NUM_THREADS);
18455 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
18456 OMP_CLAUSE_CHAIN (c) = list;
18465 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED, tree list)
18469 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED, "ordered");
18471 c = build_omp_clause (OMP_CLAUSE_ORDERED);
18472 OMP_CLAUSE_CHAIN (c) = list;
18477 reduction ( reduction-operator : variable-list )
18479 reduction-operator:
18480 One of: + * - & ^ | && || */
18483 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
18485 enum tree_code code;
18488 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18491 switch (cp_lexer_peek_token (parser->lexer)->type)
18503 code = BIT_AND_EXPR;
18506 code = BIT_XOR_EXPR;
18509 code = BIT_IOR_EXPR;
18512 code = TRUTH_ANDIF_EXPR;
18515 code = TRUTH_ORIF_EXPR;
18518 cp_parser_error (parser, "`+', `*', `-', `&', `^', `|', `&&', or `||'");
18520 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18521 /*or_comma=*/false,
18522 /*consume_paren=*/true);
18525 cp_lexer_consume_token (parser->lexer);
18527 if (!cp_parser_require (parser, CPP_COLON, "`:'"))
18530 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
18531 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
18532 OMP_CLAUSE_REDUCTION_CODE (c) = code;
18538 schedule ( schedule-kind )
18539 schedule ( schedule-kind , expression )
18542 static | dynamic | guided | runtime */
18545 cp_parser_omp_clause_schedule (cp_parser *parser, tree list)
18549 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "expected %<(%>"))
18552 c = build_omp_clause (OMP_CLAUSE_SCHEDULE);
18554 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18556 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
18557 const char *p = IDENTIFIER_POINTER (id);
18562 if (strcmp ("dynamic", p) != 0)
18564 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
18568 if (strcmp ("guided", p) != 0)
18570 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
18574 if (strcmp ("runtime", p) != 0)
18576 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
18583 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
18584 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
18587 cp_lexer_consume_token (parser->lexer);
18589 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
18591 cp_lexer_consume_token (parser->lexer);
18593 t = cp_parser_assignment_expression (parser, false);
18595 if (t == error_mark_node)
18597 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
18598 error ("schedule %<runtime%> does not take "
18599 "a %<chunk_size%> parameter");
18601 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
18603 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18606 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`,' or `)'"))
18609 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule");
18610 OMP_CLAUSE_CHAIN (c) = list;
18614 cp_parser_error (parser, "invalid schedule kind");
18616 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18617 /*or_comma=*/false,
18618 /*consume_paren=*/true);
18622 /* Parse all OpenMP clauses. The set clauses allowed by the directive
18623 is a bitmask in MASK. Return the list of clauses found; the result
18624 of clause default goes in *pdefault. */
18627 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
18628 const char *where, cp_token *pragma_tok)
18630 tree clauses = NULL;
18632 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
18634 pragma_omp_clause c_kind = cp_parser_omp_clause_name (parser);
18635 const char *c_name;
18636 tree prev = clauses;
18640 case PRAGMA_OMP_CLAUSE_COPYIN:
18641 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
18644 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
18645 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
18647 c_name = "copyprivate";
18649 case PRAGMA_OMP_CLAUSE_DEFAULT:
18650 clauses = cp_parser_omp_clause_default (parser, clauses);
18651 c_name = "default";
18653 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
18654 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
18656 c_name = "firstprivate";
18658 case PRAGMA_OMP_CLAUSE_IF:
18659 clauses = cp_parser_omp_clause_if (parser, clauses);
18662 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
18663 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
18665 c_name = "lastprivate";
18667 case PRAGMA_OMP_CLAUSE_NOWAIT:
18668 clauses = cp_parser_omp_clause_nowait (parser, clauses);
18671 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
18672 clauses = cp_parser_omp_clause_num_threads (parser, clauses);
18673 c_name = "num_threads";
18675 case PRAGMA_OMP_CLAUSE_ORDERED:
18676 clauses = cp_parser_omp_clause_ordered (parser, clauses);
18677 c_name = "ordered";
18679 case PRAGMA_OMP_CLAUSE_PRIVATE:
18680 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
18682 c_name = "private";
18684 case PRAGMA_OMP_CLAUSE_REDUCTION:
18685 clauses = cp_parser_omp_clause_reduction (parser, clauses);
18686 c_name = "reduction";
18688 case PRAGMA_OMP_CLAUSE_SCHEDULE:
18689 clauses = cp_parser_omp_clause_schedule (parser, clauses);
18690 c_name = "schedule";
18692 case PRAGMA_OMP_CLAUSE_SHARED:
18693 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
18698 cp_parser_error (parser, "expected %<#pragma omp%> clause");
18702 if (((mask >> c_kind) & 1) == 0)
18704 /* Remove the invalid clause(s) from the list to avoid
18705 confusing the rest of the compiler. */
18707 error ("%qs is not valid for %qs", c_name, where);
18711 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
18712 return finish_omp_clauses (clauses);
18719 In practice, we're also interested in adding the statement to an
18720 outer node. So it is convenient if we work around the fact that
18721 cp_parser_statement calls add_stmt. */
18724 cp_parser_begin_omp_structured_block (cp_parser *parser)
18726 unsigned save = parser->in_statement;
18728 /* Only move the values to IN_OMP_BLOCK if they weren't false.
18729 This preserves the "not within loop or switch" style error messages
18730 for nonsense cases like
18736 if (parser->in_statement)
18737 parser->in_statement = IN_OMP_BLOCK;
18743 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
18745 parser->in_statement = save;
18749 cp_parser_omp_structured_block (cp_parser *parser)
18751 tree stmt = begin_omp_structured_block ();
18752 unsigned int save = cp_parser_begin_omp_structured_block (parser);
18754 cp_parser_statement (parser, NULL_TREE, false, NULL);
18756 cp_parser_end_omp_structured_block (parser, save);
18757 return finish_omp_structured_block (stmt);
18761 # pragma omp atomic new-line
18765 x binop= expr | x++ | ++x | x-- | --x
18767 +, *, -, /, &, ^, |, <<, >>
18769 where x is an lvalue expression with scalar type. */
18772 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
18775 enum tree_code code;
18777 cp_parser_require_pragma_eol (parser, pragma_tok);
18779 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
18781 switch (TREE_CODE (lhs))
18786 case PREINCREMENT_EXPR:
18787 case POSTINCREMENT_EXPR:
18788 lhs = TREE_OPERAND (lhs, 0);
18790 rhs = integer_one_node;
18793 case PREDECREMENT_EXPR:
18794 case POSTDECREMENT_EXPR:
18795 lhs = TREE_OPERAND (lhs, 0);
18797 rhs = integer_one_node;
18801 switch (cp_lexer_peek_token (parser->lexer)->type)
18807 code = TRUNC_DIV_EXPR;
18815 case CPP_LSHIFT_EQ:
18816 code = LSHIFT_EXPR;
18818 case CPP_RSHIFT_EQ:
18819 code = RSHIFT_EXPR;
18822 code = BIT_AND_EXPR;
18825 code = BIT_IOR_EXPR;
18828 code = BIT_XOR_EXPR;
18831 cp_parser_error (parser,
18832 "invalid operator for %<#pragma omp atomic%>");
18835 cp_lexer_consume_token (parser->lexer);
18837 rhs = cp_parser_expression (parser, false);
18838 if (rhs == error_mark_node)
18842 finish_omp_atomic (code, lhs, rhs);
18843 cp_parser_consume_semicolon_at_end_of_statement (parser);
18847 cp_parser_skip_to_end_of_block_or_statement (parser);
18852 # pragma omp barrier new-line */
18855 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
18857 cp_parser_require_pragma_eol (parser, pragma_tok);
18858 finish_omp_barrier ();
18862 # pragma omp critical [(name)] new-line
18863 structured-block */
18866 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
18868 tree stmt, name = NULL;
18870 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
18872 cp_lexer_consume_token (parser->lexer);
18874 name = cp_parser_identifier (parser);
18876 if (name == error_mark_node
18877 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18878 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18879 /*or_comma=*/false,
18880 /*consume_paren=*/true);
18881 if (name == error_mark_node)
18884 cp_parser_require_pragma_eol (parser, pragma_tok);
18886 stmt = cp_parser_omp_structured_block (parser);
18887 return c_finish_omp_critical (stmt, name);
18891 # pragma omp flush flush-vars[opt] new-line
18894 ( variable-list ) */
18897 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
18899 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
18900 (void) cp_parser_omp_var_list (parser, 0, NULL);
18901 cp_parser_require_pragma_eol (parser, pragma_tok);
18903 finish_omp_flush ();
18906 /* Parse the restricted form of the for statment allowed by OpenMP. */
18909 cp_parser_omp_for_loop (cp_parser *parser)
18911 tree init, cond, incr, body, decl, pre_body;
18914 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
18916 cp_parser_error (parser, "for statement expected");
18919 loc = cp_lexer_consume_token (parser->lexer)->location;
18920 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18923 init = decl = NULL;
18924 pre_body = push_stmt_list ();
18925 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18927 cp_decl_specifier_seq type_specifiers;
18929 /* First, try to parse as an initialized declaration. See
18930 cp_parser_condition, from whence the bulk of this is copied. */
18932 cp_parser_parse_tentatively (parser);
18933 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
18935 if (!cp_parser_error_occurred (parser))
18937 tree asm_specification, attributes;
18938 cp_declarator *declarator;
18940 declarator = cp_parser_declarator (parser,
18941 CP_PARSER_DECLARATOR_NAMED,
18942 /*ctor_dtor_or_conv_p=*/NULL,
18943 /*parenthesized_p=*/NULL,
18944 /*member_p=*/false);
18945 attributes = cp_parser_attributes_opt (parser);
18946 asm_specification = cp_parser_asm_specification_opt (parser);
18948 cp_parser_require (parser, CPP_EQ, "`='");
18949 if (cp_parser_parse_definitely (parser))
18953 decl = start_decl (declarator, &type_specifiers,
18954 /*initialized_p=*/false, attributes,
18955 /*prefix_attributes=*/NULL_TREE,
18958 init = cp_parser_assignment_expression (parser, false);
18960 cp_finish_decl (decl, NULL_TREE, /*init_const_expr_p=*/false,
18961 asm_specification, LOOKUP_ONLYCONVERTING);
18964 pop_scope (pushed_scope);
18968 cp_parser_abort_tentative_parse (parser);
18970 /* If parsing as an initialized declaration failed, try again as
18971 a simple expression. */
18973 init = cp_parser_expression (parser, false);
18975 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
18976 pre_body = pop_stmt_list (pre_body);
18979 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18980 cond = cp_parser_condition (parser);
18981 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
18984 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
18985 incr = cp_parser_expression (parser, false);
18987 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18988 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18989 /*or_comma=*/false,
18990 /*consume_paren=*/true);
18992 /* Note that we saved the original contents of this flag when we entered
18993 the structured block, and so we don't need to re-save it here. */
18994 parser->in_statement = IN_OMP_FOR;
18996 /* Note that the grammar doesn't call for a structured block here,
18997 though the loop as a whole is a structured block. */
18998 body = push_stmt_list ();
18999 cp_parser_statement (parser, NULL_TREE, false, NULL);
19000 body = pop_stmt_list (body);
19002 return finish_omp_for (loc, decl, init, cond, incr, body, pre_body);
19006 #pragma omp for for-clause[optseq] new-line
19009 #define OMP_FOR_CLAUSE_MASK \
19010 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19011 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19012 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
19013 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
19014 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
19015 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
19016 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
19019 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
19021 tree clauses, sb, ret;
19024 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
19025 "#pragma omp for", pragma_tok);
19027 sb = begin_omp_structured_block ();
19028 save = cp_parser_begin_omp_structured_block (parser);
19030 ret = cp_parser_omp_for_loop (parser);
19032 OMP_FOR_CLAUSES (ret) = clauses;
19034 cp_parser_end_omp_structured_block (parser, save);
19035 add_stmt (finish_omp_structured_block (sb));
19041 # pragma omp master new-line
19042 structured-block */
19045 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
19047 cp_parser_require_pragma_eol (parser, pragma_tok);
19048 return c_finish_omp_master (cp_parser_omp_structured_block (parser));
19052 # pragma omp ordered new-line
19053 structured-block */
19056 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
19058 cp_parser_require_pragma_eol (parser, pragma_tok);
19059 return c_finish_omp_ordered (cp_parser_omp_structured_block (parser));
19065 { section-sequence }
19068 section-directive[opt] structured-block
19069 section-sequence section-directive structured-block */
19072 cp_parser_omp_sections_scope (cp_parser *parser)
19074 tree stmt, substmt;
19075 bool error_suppress = false;
19078 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
19081 stmt = push_stmt_list ();
19083 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
19087 substmt = begin_omp_structured_block ();
19088 save = cp_parser_begin_omp_structured_block (parser);
19092 cp_parser_statement (parser, NULL_TREE, false, NULL);
19094 tok = cp_lexer_peek_token (parser->lexer);
19095 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
19097 if (tok->type == CPP_CLOSE_BRACE)
19099 if (tok->type == CPP_EOF)
19103 cp_parser_end_omp_structured_block (parser, save);
19104 substmt = finish_omp_structured_block (substmt);
19105 substmt = build1 (OMP_SECTION, void_type_node, substmt);
19106 add_stmt (substmt);
19111 tok = cp_lexer_peek_token (parser->lexer);
19112 if (tok->type == CPP_CLOSE_BRACE)
19114 if (tok->type == CPP_EOF)
19117 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
19119 cp_lexer_consume_token (parser->lexer);
19120 cp_parser_require_pragma_eol (parser, tok);
19121 error_suppress = false;
19123 else if (!error_suppress)
19125 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
19126 error_suppress = true;
19129 substmt = cp_parser_omp_structured_block (parser);
19130 substmt = build1 (OMP_SECTION, void_type_node, substmt);
19131 add_stmt (substmt);
19133 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
19135 substmt = pop_stmt_list (stmt);
19137 stmt = make_node (OMP_SECTIONS);
19138 TREE_TYPE (stmt) = void_type_node;
19139 OMP_SECTIONS_BODY (stmt) = substmt;
19146 # pragma omp sections sections-clause[optseq] newline
19149 #define OMP_SECTIONS_CLAUSE_MASK \
19150 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19151 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19152 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
19153 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
19154 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
19157 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
19161 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
19162 "#pragma omp sections", pragma_tok);
19164 ret = cp_parser_omp_sections_scope (parser);
19166 OMP_SECTIONS_CLAUSES (ret) = clauses;
19172 # pragma parallel parallel-clause new-line
19173 # pragma parallel for parallel-for-clause new-line
19174 # pragma parallel sections parallel-sections-clause new-line */
19176 #define OMP_PARALLEL_CLAUSE_MASK \
19177 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
19178 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19179 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19180 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
19181 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
19182 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
19183 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
19184 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
19187 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
19189 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
19190 const char *p_name = "#pragma omp parallel";
19191 tree stmt, clauses, par_clause, ws_clause, block;
19192 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
19195 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
19197 cp_lexer_consume_token (parser->lexer);
19198 p_kind = PRAGMA_OMP_PARALLEL_FOR;
19199 p_name = "#pragma omp parallel for";
19200 mask |= OMP_FOR_CLAUSE_MASK;
19201 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
19203 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
19205 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
19206 const char *p = IDENTIFIER_POINTER (id);
19207 if (strcmp (p, "sections") == 0)
19209 cp_lexer_consume_token (parser->lexer);
19210 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
19211 p_name = "#pragma omp parallel sections";
19212 mask |= OMP_SECTIONS_CLAUSE_MASK;
19213 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
19217 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
19218 block = begin_omp_parallel ();
19219 save = cp_parser_begin_omp_structured_block (parser);
19223 case PRAGMA_OMP_PARALLEL:
19224 cp_parser_already_scoped_statement (parser);
19225 par_clause = clauses;
19228 case PRAGMA_OMP_PARALLEL_FOR:
19229 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
19230 stmt = cp_parser_omp_for_loop (parser);
19232 OMP_FOR_CLAUSES (stmt) = ws_clause;
19235 case PRAGMA_OMP_PARALLEL_SECTIONS:
19236 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
19237 stmt = cp_parser_omp_sections_scope (parser);
19239 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
19243 gcc_unreachable ();
19246 cp_parser_end_omp_structured_block (parser, save);
19247 stmt = finish_omp_parallel (par_clause, block);
19248 if (p_kind != PRAGMA_OMP_PARALLEL)
19249 OMP_PARALLEL_COMBINED (stmt) = 1;
19254 # pragma omp single single-clause[optseq] new-line
19255 structured-block */
19257 #define OMP_SINGLE_CLAUSE_MASK \
19258 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19259 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19260 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
19261 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
19264 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
19266 tree stmt = make_node (OMP_SINGLE);
19267 TREE_TYPE (stmt) = void_type_node;
19269 OMP_SINGLE_CLAUSES (stmt)
19270 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
19271 "#pragma omp single", pragma_tok);
19272 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
19274 return add_stmt (stmt);
19278 # pragma omp threadprivate (variable-list) */
19281 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
19285 vars = cp_parser_omp_var_list (parser, 0, NULL);
19286 cp_parser_require_pragma_eol (parser, pragma_tok);
19288 if (!targetm.have_tls)
19289 sorry ("threadprivate variables not supported in this target");
19291 finish_omp_threadprivate (vars);
19294 /* Main entry point to OpenMP statement pragmas. */
19297 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
19301 switch (pragma_tok->pragma_kind)
19303 case PRAGMA_OMP_ATOMIC:
19304 cp_parser_omp_atomic (parser, pragma_tok);
19306 case PRAGMA_OMP_CRITICAL:
19307 stmt = cp_parser_omp_critical (parser, pragma_tok);
19309 case PRAGMA_OMP_FOR:
19310 stmt = cp_parser_omp_for (parser, pragma_tok);
19312 case PRAGMA_OMP_MASTER:
19313 stmt = cp_parser_omp_master (parser, pragma_tok);
19315 case PRAGMA_OMP_ORDERED:
19316 stmt = cp_parser_omp_ordered (parser, pragma_tok);
19318 case PRAGMA_OMP_PARALLEL:
19319 stmt = cp_parser_omp_parallel (parser, pragma_tok);
19321 case PRAGMA_OMP_SECTIONS:
19322 stmt = cp_parser_omp_sections (parser, pragma_tok);
19324 case PRAGMA_OMP_SINGLE:
19325 stmt = cp_parser_omp_single (parser, pragma_tok);
19328 gcc_unreachable ();
19332 SET_EXPR_LOCATION (stmt, pragma_tok->location);
19337 static GTY (()) cp_parser *the_parser;
19340 /* Special handling for the first token or line in the file. The first
19341 thing in the file might be #pragma GCC pch_preprocess, which loads a
19342 PCH file, which is a GC collection point. So we need to handle this
19343 first pragma without benefit of an existing lexer structure.
19345 Always returns one token to the caller in *FIRST_TOKEN. This is
19346 either the true first token of the file, or the first token after
19347 the initial pragma. */
19350 cp_parser_initial_pragma (cp_token *first_token)
19354 cp_lexer_get_preprocessor_token (NULL, first_token);
19355 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
19358 cp_lexer_get_preprocessor_token (NULL, first_token);
19359 if (first_token->type == CPP_STRING)
19361 name = first_token->u.value;
19363 cp_lexer_get_preprocessor_token (NULL, first_token);
19364 if (first_token->type != CPP_PRAGMA_EOL)
19365 error ("junk at end of %<#pragma GCC pch_preprocess%>");
19368 error ("expected string literal");
19370 /* Skip to the end of the pragma. */
19371 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
19372 cp_lexer_get_preprocessor_token (NULL, first_token);
19374 /* Now actually load the PCH file. */
19376 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
19378 /* Read one more token to return to our caller. We have to do this
19379 after reading the PCH file in, since its pointers have to be
19381 cp_lexer_get_preprocessor_token (NULL, first_token);
19384 /* Normal parsing of a pragma token. Here we can (and must) use the
19388 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
19390 cp_token *pragma_tok;
19393 pragma_tok = cp_lexer_consume_token (parser->lexer);
19394 gcc_assert (pragma_tok->type == CPP_PRAGMA);
19395 parser->lexer->in_pragma = true;
19397 id = pragma_tok->pragma_kind;
19400 case PRAGMA_GCC_PCH_PREPROCESS:
19401 error ("%<#pragma GCC pch_preprocess%> must be first");
19404 case PRAGMA_OMP_BARRIER:
19407 case pragma_compound:
19408 cp_parser_omp_barrier (parser, pragma_tok);
19411 error ("%<#pragma omp barrier%> may only be "
19412 "used in compound statements");
19419 case PRAGMA_OMP_FLUSH:
19422 case pragma_compound:
19423 cp_parser_omp_flush (parser, pragma_tok);
19426 error ("%<#pragma omp flush%> may only be "
19427 "used in compound statements");
19434 case PRAGMA_OMP_THREADPRIVATE:
19435 cp_parser_omp_threadprivate (parser, pragma_tok);
19438 case PRAGMA_OMP_ATOMIC:
19439 case PRAGMA_OMP_CRITICAL:
19440 case PRAGMA_OMP_FOR:
19441 case PRAGMA_OMP_MASTER:
19442 case PRAGMA_OMP_ORDERED:
19443 case PRAGMA_OMP_PARALLEL:
19444 case PRAGMA_OMP_SECTIONS:
19445 case PRAGMA_OMP_SINGLE:
19446 if (context == pragma_external)
19448 cp_parser_omp_construct (parser, pragma_tok);
19451 case PRAGMA_OMP_SECTION:
19452 error ("%<#pragma omp section%> may only be used in "
19453 "%<#pragma omp sections%> construct");
19457 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
19458 c_invoke_pragma_handler (id);
19462 cp_parser_error (parser, "expected declaration specifiers");
19466 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
19470 /* The interface the pragma parsers have to the lexer. */
19473 pragma_lex (tree *value)
19476 enum cpp_ttype ret;
19478 tok = cp_lexer_peek_token (the_parser->lexer);
19481 *value = tok->u.value;
19483 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
19485 else if (ret == CPP_STRING)
19486 *value = cp_parser_string_literal (the_parser, false, false);
19489 cp_lexer_consume_token (the_parser->lexer);
19490 if (ret == CPP_KEYWORD)
19498 /* External interface. */
19500 /* Parse one entire translation unit. */
19503 c_parse_file (void)
19505 bool error_occurred;
19506 static bool already_called = false;
19508 if (already_called)
19510 sorry ("inter-module optimizations not implemented for C++");
19513 already_called = true;
19515 the_parser = cp_parser_new ();
19516 push_deferring_access_checks (flag_access_control
19517 ? dk_no_deferred : dk_no_check);
19518 error_occurred = cp_parser_translation_unit (the_parser);
19522 #include "gt-cp-parser.h"