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
1623 /* Declarators [gram.dcl.decl] */
1625 static tree cp_parser_init_declarator
1626 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *);
1627 static cp_declarator *cp_parser_declarator
1628 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1629 static cp_declarator *cp_parser_direct_declarator
1630 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1631 static enum tree_code cp_parser_ptr_operator
1632 (cp_parser *, tree *, cp_cv_quals *);
1633 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1635 static tree cp_parser_declarator_id
1636 (cp_parser *, bool);
1637 static tree cp_parser_type_id
1639 static void cp_parser_type_specifier_seq
1640 (cp_parser *, bool, cp_decl_specifier_seq *);
1641 static cp_parameter_declarator *cp_parser_parameter_declaration_clause
1643 static cp_parameter_declarator *cp_parser_parameter_declaration_list
1644 (cp_parser *, bool *);
1645 static cp_parameter_declarator *cp_parser_parameter_declaration
1646 (cp_parser *, bool, bool *);
1647 static void cp_parser_function_body
1649 static tree cp_parser_initializer
1650 (cp_parser *, bool *, bool *);
1651 static tree cp_parser_initializer_clause
1652 (cp_parser *, bool *);
1653 static VEC(constructor_elt,gc) *cp_parser_initializer_list
1654 (cp_parser *, bool *);
1656 static bool cp_parser_ctor_initializer_opt_and_function_body
1659 /* Classes [gram.class] */
1661 static tree cp_parser_class_name
1662 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1663 static tree cp_parser_class_specifier
1665 static tree cp_parser_class_head
1666 (cp_parser *, bool *, tree *, tree *);
1667 static enum tag_types cp_parser_class_key
1669 static void cp_parser_member_specification_opt
1671 static void cp_parser_member_declaration
1673 static tree cp_parser_pure_specifier
1675 static tree cp_parser_constant_initializer
1678 /* Derived classes [gram.class.derived] */
1680 static tree cp_parser_base_clause
1682 static tree cp_parser_base_specifier
1685 /* Special member functions [gram.special] */
1687 static tree cp_parser_conversion_function_id
1689 static tree cp_parser_conversion_type_id
1691 static cp_declarator *cp_parser_conversion_declarator_opt
1693 static bool cp_parser_ctor_initializer_opt
1695 static void cp_parser_mem_initializer_list
1697 static tree cp_parser_mem_initializer
1699 static tree cp_parser_mem_initializer_id
1702 /* Overloading [gram.over] */
1704 static tree cp_parser_operator_function_id
1706 static tree cp_parser_operator
1709 /* Templates [gram.temp] */
1711 static void cp_parser_template_declaration
1712 (cp_parser *, bool);
1713 static tree cp_parser_template_parameter_list
1715 static tree cp_parser_template_parameter
1716 (cp_parser *, bool *);
1717 static tree cp_parser_type_parameter
1719 static tree cp_parser_template_id
1720 (cp_parser *, bool, bool, bool);
1721 static tree cp_parser_template_name
1722 (cp_parser *, bool, bool, bool, bool *);
1723 static tree cp_parser_template_argument_list
1725 static tree cp_parser_template_argument
1727 static void cp_parser_explicit_instantiation
1729 static void cp_parser_explicit_specialization
1732 /* Exception handling [gram.exception] */
1734 static tree cp_parser_try_block
1736 static bool cp_parser_function_try_block
1738 static void cp_parser_handler_seq
1740 static void cp_parser_handler
1742 static tree cp_parser_exception_declaration
1744 static tree cp_parser_throw_expression
1746 static tree cp_parser_exception_specification_opt
1748 static tree cp_parser_type_id_list
1751 /* GNU Extensions */
1753 static tree cp_parser_asm_specification_opt
1755 static tree cp_parser_asm_operand_list
1757 static tree cp_parser_asm_clobber_list
1759 static tree cp_parser_attributes_opt
1761 static tree cp_parser_attribute_list
1763 static bool cp_parser_extension_opt
1764 (cp_parser *, int *);
1765 static void cp_parser_label_declaration
1768 enum pragma_context { pragma_external, pragma_stmt, pragma_compound };
1769 static bool cp_parser_pragma
1770 (cp_parser *, enum pragma_context);
1772 /* Objective-C++ Productions */
1774 static tree cp_parser_objc_message_receiver
1776 static tree cp_parser_objc_message_args
1778 static tree cp_parser_objc_message_expression
1780 static tree cp_parser_objc_encode_expression
1782 static tree cp_parser_objc_defs_expression
1784 static tree cp_parser_objc_protocol_expression
1786 static tree cp_parser_objc_selector_expression
1788 static tree cp_parser_objc_expression
1790 static bool cp_parser_objc_selector_p
1792 static tree cp_parser_objc_selector
1794 static tree cp_parser_objc_protocol_refs_opt
1796 static void cp_parser_objc_declaration
1798 static tree cp_parser_objc_statement
1801 /* Utility Routines */
1803 static tree cp_parser_lookup_name
1804 (cp_parser *, tree, enum tag_types, bool, bool, bool, tree *);
1805 static tree cp_parser_lookup_name_simple
1806 (cp_parser *, tree);
1807 static tree cp_parser_maybe_treat_template_as_class
1809 static bool cp_parser_check_declarator_template_parameters
1810 (cp_parser *, cp_declarator *);
1811 static bool cp_parser_check_template_parameters
1812 (cp_parser *, unsigned);
1813 static tree cp_parser_simple_cast_expression
1815 static tree cp_parser_global_scope_opt
1816 (cp_parser *, bool);
1817 static bool cp_parser_constructor_declarator_p
1818 (cp_parser *, bool);
1819 static tree cp_parser_function_definition_from_specifiers_and_declarator
1820 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1821 static tree cp_parser_function_definition_after_declarator
1822 (cp_parser *, bool);
1823 static void cp_parser_template_declaration_after_export
1824 (cp_parser *, bool);
1825 static void cp_parser_perform_template_parameter_access_checks
1826 (VEC (deferred_access_check,gc)*);
1827 static tree cp_parser_single_declaration
1828 (cp_parser *, VEC (deferred_access_check,gc)*, bool, bool *);
1829 static tree cp_parser_functional_cast
1830 (cp_parser *, tree);
1831 static tree cp_parser_save_member_function_body
1832 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1833 static tree cp_parser_enclosed_template_argument_list
1835 static void cp_parser_save_default_args
1836 (cp_parser *, tree);
1837 static void cp_parser_late_parsing_for_member
1838 (cp_parser *, tree);
1839 static void cp_parser_late_parsing_default_args
1840 (cp_parser *, tree);
1841 static tree cp_parser_sizeof_operand
1842 (cp_parser *, enum rid);
1843 static bool cp_parser_declares_only_class_p
1845 static void cp_parser_set_storage_class
1846 (cp_parser *, cp_decl_specifier_seq *, enum rid);
1847 static void cp_parser_set_decl_spec_type
1848 (cp_decl_specifier_seq *, tree, bool);
1849 static bool cp_parser_friend_p
1850 (const cp_decl_specifier_seq *);
1851 static cp_token *cp_parser_require
1852 (cp_parser *, enum cpp_ttype, const char *);
1853 static cp_token *cp_parser_require_keyword
1854 (cp_parser *, enum rid, const char *);
1855 static bool cp_parser_token_starts_function_definition_p
1857 static bool cp_parser_next_token_starts_class_definition_p
1859 static bool cp_parser_next_token_ends_template_argument_p
1861 static bool cp_parser_nth_token_starts_template_argument_list_p
1862 (cp_parser *, size_t);
1863 static enum tag_types cp_parser_token_is_class_key
1865 static void cp_parser_check_class_key
1866 (enum tag_types, tree type);
1867 static void cp_parser_check_access_in_redeclaration
1869 static bool cp_parser_optional_template_keyword
1871 static void cp_parser_pre_parsed_nested_name_specifier
1873 static void cp_parser_cache_group
1874 (cp_parser *, enum cpp_ttype, unsigned);
1875 static void cp_parser_parse_tentatively
1877 static void cp_parser_commit_to_tentative_parse
1879 static void cp_parser_abort_tentative_parse
1881 static bool cp_parser_parse_definitely
1883 static inline bool cp_parser_parsing_tentatively
1885 static bool cp_parser_uncommitted_to_tentative_parse_p
1887 static void cp_parser_error
1888 (cp_parser *, const char *);
1889 static void cp_parser_name_lookup_error
1890 (cp_parser *, tree, tree, const char *);
1891 static bool cp_parser_simulate_error
1893 static bool cp_parser_check_type_definition
1895 static void cp_parser_check_for_definition_in_return_type
1896 (cp_declarator *, tree);
1897 static void cp_parser_check_for_invalid_template_id
1898 (cp_parser *, tree);
1899 static bool cp_parser_non_integral_constant_expression
1900 (cp_parser *, const char *);
1901 static void cp_parser_diagnose_invalid_type_name
1902 (cp_parser *, tree, tree);
1903 static bool cp_parser_parse_and_diagnose_invalid_type_name
1905 static int cp_parser_skip_to_closing_parenthesis
1906 (cp_parser *, bool, bool, bool);
1907 static void cp_parser_skip_to_end_of_statement
1909 static void cp_parser_consume_semicolon_at_end_of_statement
1911 static void cp_parser_skip_to_end_of_block_or_statement
1913 static void cp_parser_skip_to_closing_brace
1915 static void cp_parser_skip_to_end_of_template_parameter_list
1917 static void cp_parser_skip_to_pragma_eol
1918 (cp_parser*, cp_token *);
1919 static bool cp_parser_error_occurred
1921 static bool cp_parser_allow_gnu_extensions_p
1923 static bool cp_parser_is_string_literal
1925 static bool cp_parser_is_keyword
1926 (cp_token *, enum rid);
1927 static tree cp_parser_make_typename_type
1928 (cp_parser *, tree, tree);
1930 /* Returns nonzero if we are parsing tentatively. */
1933 cp_parser_parsing_tentatively (cp_parser* parser)
1935 return parser->context->next != NULL;
1938 /* Returns nonzero if TOKEN is a string literal. */
1941 cp_parser_is_string_literal (cp_token* token)
1943 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1946 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1949 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1951 return token->keyword == keyword;
1954 /* If not parsing tentatively, issue a diagnostic of the form
1955 FILE:LINE: MESSAGE before TOKEN
1956 where TOKEN is the next token in the input stream. MESSAGE
1957 (specified by the caller) is usually of the form "expected
1961 cp_parser_error (cp_parser* parser, const char* message)
1963 if (!cp_parser_simulate_error (parser))
1965 cp_token *token = cp_lexer_peek_token (parser->lexer);
1966 /* This diagnostic makes more sense if it is tagged to the line
1967 of the token we just peeked at. */
1968 cp_lexer_set_source_position_from_token (token);
1970 if (token->type == CPP_PRAGMA)
1972 error ("%<#pragma%> is not allowed here");
1973 cp_parser_skip_to_pragma_eol (parser, token);
1977 c_parse_error (message,
1978 /* Because c_parser_error does not understand
1979 CPP_KEYWORD, keywords are treated like
1981 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
1986 /* Issue an error about name-lookup failing. NAME is the
1987 IDENTIFIER_NODE DECL is the result of
1988 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1989 the thing that we hoped to find. */
1992 cp_parser_name_lookup_error (cp_parser* parser,
1995 const char* desired)
1997 /* If name lookup completely failed, tell the user that NAME was not
1999 if (decl == error_mark_node)
2001 if (parser->scope && parser->scope != global_namespace)
2002 error ("%<%D::%D%> has not been declared",
2003 parser->scope, name);
2004 else if (parser->scope == global_namespace)
2005 error ("%<::%D%> has not been declared", name);
2006 else if (parser->object_scope
2007 && !CLASS_TYPE_P (parser->object_scope))
2008 error ("request for member %qD in non-class type %qT",
2009 name, parser->object_scope);
2010 else if (parser->object_scope)
2011 error ("%<%T::%D%> has not been declared",
2012 parser->object_scope, name);
2014 error ("%qD has not been declared", name);
2016 else if (parser->scope && parser->scope != global_namespace)
2017 error ("%<%D::%D%> %s", parser->scope, name, desired);
2018 else if (parser->scope == global_namespace)
2019 error ("%<::%D%> %s", name, desired);
2021 error ("%qD %s", name, desired);
2024 /* If we are parsing tentatively, remember that an error has occurred
2025 during this tentative parse. Returns true if the error was
2026 simulated; false if a message should be issued by the caller. */
2029 cp_parser_simulate_error (cp_parser* parser)
2031 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2033 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2039 /* Check for repeated decl-specifiers. */
2042 cp_parser_check_decl_spec (cp_decl_specifier_seq *decl_specs)
2046 for (ds = ds_first; ds != ds_last; ++ds)
2048 unsigned count = decl_specs->specs[(int)ds];
2051 /* The "long" specifier is a special case because of "long long". */
2055 error ("%<long long long%> is too long for GCC");
2056 else if (pedantic && !in_system_header && warn_long_long)
2057 pedwarn ("ISO C++ does not support %<long long%>");
2061 static const char *const decl_spec_names[] = {
2077 error ("duplicate %qs", decl_spec_names[(int)ds]);
2082 /* This function is called when a type is defined. If type
2083 definitions are forbidden at this point, an error message is
2087 cp_parser_check_type_definition (cp_parser* parser)
2089 /* If types are forbidden here, issue a message. */
2090 if (parser->type_definition_forbidden_message)
2092 /* Use `%s' to print the string in case there are any escape
2093 characters in the message. */
2094 error ("%s", parser->type_definition_forbidden_message);
2100 /* This function is called when the DECLARATOR is processed. The TYPE
2101 was a type defined in the decl-specifiers. If it is invalid to
2102 define a type in the decl-specifiers for DECLARATOR, an error is
2106 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2109 /* [dcl.fct] forbids type definitions in return types.
2110 Unfortunately, it's not easy to know whether or not we are
2111 processing a return type until after the fact. */
2113 && (declarator->kind == cdk_pointer
2114 || declarator->kind == cdk_reference
2115 || declarator->kind == cdk_ptrmem))
2116 declarator = declarator->declarator;
2118 && declarator->kind == cdk_function)
2120 error ("new types may not be defined in a return type");
2121 inform ("(perhaps a semicolon is missing after the definition of %qT)",
2126 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2127 "<" in any valid C++ program. If the next token is indeed "<",
2128 issue a message warning the user about what appears to be an
2129 invalid attempt to form a template-id. */
2132 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2135 cp_token_position start = 0;
2137 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2140 error ("%qT is not a template", type);
2141 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2142 error ("%qE is not a template", type);
2144 error ("invalid template-id");
2145 /* Remember the location of the invalid "<". */
2146 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2147 start = cp_lexer_token_position (parser->lexer, true);
2148 /* Consume the "<". */
2149 cp_lexer_consume_token (parser->lexer);
2150 /* Parse the template arguments. */
2151 cp_parser_enclosed_template_argument_list (parser);
2152 /* Permanently remove the invalid template arguments so that
2153 this error message is not issued again. */
2155 cp_lexer_purge_tokens_after (parser->lexer, start);
2159 /* If parsing an integral constant-expression, issue an error message
2160 about the fact that THING appeared and return true. Otherwise,
2161 return false. In either case, set
2162 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2165 cp_parser_non_integral_constant_expression (cp_parser *parser,
2168 parser->non_integral_constant_expression_p = true;
2169 if (parser->integral_constant_expression_p)
2171 if (!parser->allow_non_integral_constant_expression_p)
2173 error ("%s cannot appear in a constant-expression", thing);
2180 /* Emit a diagnostic for an invalid type name. SCOPE is the
2181 qualifying scope (or NULL, if none) for ID. This function commits
2182 to the current active tentative parse, if any. (Otherwise, the
2183 problematic construct might be encountered again later, resulting
2184 in duplicate error messages.) */
2187 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
2189 tree decl, old_scope;
2190 /* Try to lookup the identifier. */
2191 old_scope = parser->scope;
2192 parser->scope = scope;
2193 decl = cp_parser_lookup_name_simple (parser, id);
2194 parser->scope = old_scope;
2195 /* If the lookup found a template-name, it means that the user forgot
2196 to specify an argument list. Emit a useful error message. */
2197 if (TREE_CODE (decl) == TEMPLATE_DECL)
2198 error ("invalid use of template-name %qE without an argument list", decl);
2199 else if (TREE_CODE (id) == BIT_NOT_EXPR)
2200 error ("invalid use of destructor %qD as a type", id);
2201 else if (TREE_CODE (decl) == TYPE_DECL)
2202 /* Something like 'unsigned A a;' */
2203 error ("invalid combination of multiple type-specifiers");
2204 else if (!parser->scope)
2206 /* Issue an error message. */
2207 error ("%qE does not name a type", id);
2208 /* If we're in a template class, it's possible that the user was
2209 referring to a type from a base class. For example:
2211 template <typename T> struct A { typedef T X; };
2212 template <typename T> struct B : public A<T> { X x; };
2214 The user should have said "typename A<T>::X". */
2215 if (processing_template_decl && current_class_type
2216 && TYPE_BINFO (current_class_type))
2220 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2224 tree base_type = BINFO_TYPE (b);
2225 if (CLASS_TYPE_P (base_type)
2226 && dependent_type_p (base_type))
2229 /* Go from a particular instantiation of the
2230 template (which will have an empty TYPE_FIELDs),
2231 to the main version. */
2232 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2233 for (field = TYPE_FIELDS (base_type);
2235 field = TREE_CHAIN (field))
2236 if (TREE_CODE (field) == TYPE_DECL
2237 && DECL_NAME (field) == id)
2239 inform ("(perhaps %<typename %T::%E%> was intended)",
2240 BINFO_TYPE (b), id);
2249 /* Here we diagnose qualified-ids where the scope is actually correct,
2250 but the identifier does not resolve to a valid type name. */
2251 else if (parser->scope != error_mark_node)
2253 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2254 error ("%qE in namespace %qE does not name a type",
2256 else if (TYPE_P (parser->scope))
2257 error ("%qE in class %qT does not name a type", id, parser->scope);
2261 cp_parser_commit_to_tentative_parse (parser);
2264 /* Check for a common situation where a type-name should be present,
2265 but is not, and issue a sensible error message. Returns true if an
2266 invalid type-name was detected.
2268 The situation handled by this function are variable declarations of the
2269 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2270 Usually, `ID' should name a type, but if we got here it means that it
2271 does not. We try to emit the best possible error message depending on
2272 how exactly the id-expression looks like. */
2275 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2279 cp_parser_parse_tentatively (parser);
2280 id = cp_parser_id_expression (parser,
2281 /*template_keyword_p=*/false,
2282 /*check_dependency_p=*/true,
2283 /*template_p=*/NULL,
2284 /*declarator_p=*/true,
2285 /*optional_p=*/false);
2286 /* After the id-expression, there should be a plain identifier,
2287 otherwise this is not a simple variable declaration. Also, if
2288 the scope is dependent, we cannot do much. */
2289 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2290 || (parser->scope && TYPE_P (parser->scope)
2291 && dependent_type_p (parser->scope))
2292 || TREE_CODE (id) == TYPE_DECL)
2294 cp_parser_abort_tentative_parse (parser);
2297 if (!cp_parser_parse_definitely (parser))
2300 /* Emit a diagnostic for the invalid type. */
2301 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2302 /* Skip to the end of the declaration; there's no point in
2303 trying to process it. */
2304 cp_parser_skip_to_end_of_block_or_statement (parser);
2308 /* Consume tokens up to, and including, the next non-nested closing `)'.
2309 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2310 are doing error recovery. Returns -1 if OR_COMMA is true and we
2311 found an unnested comma. */
2314 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2319 unsigned paren_depth = 0;
2320 unsigned brace_depth = 0;
2322 if (recovering && !or_comma
2323 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2328 cp_token * token = cp_lexer_peek_token (parser->lexer);
2330 switch (token->type)
2333 case CPP_PRAGMA_EOL:
2334 /* If we've run out of tokens, then there is no closing `)'. */
2338 /* This matches the processing in skip_to_end_of_statement. */
2343 case CPP_OPEN_BRACE:
2346 case CPP_CLOSE_BRACE:
2352 if (recovering && or_comma && !brace_depth && !paren_depth)
2356 case CPP_OPEN_PAREN:
2361 case CPP_CLOSE_PAREN:
2362 if (!brace_depth && !paren_depth--)
2365 cp_lexer_consume_token (parser->lexer);
2374 /* Consume the token. */
2375 cp_lexer_consume_token (parser->lexer);
2379 /* Consume tokens until we reach the end of the current statement.
2380 Normally, that will be just before consuming a `;'. However, if a
2381 non-nested `}' comes first, then we stop before consuming that. */
2384 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2386 unsigned nesting_depth = 0;
2390 cp_token *token = cp_lexer_peek_token (parser->lexer);
2392 switch (token->type)
2395 case CPP_PRAGMA_EOL:
2396 /* If we've run out of tokens, stop. */
2400 /* If the next token is a `;', we have reached the end of the
2406 case CPP_CLOSE_BRACE:
2407 /* If this is a non-nested '}', stop before consuming it.
2408 That way, when confronted with something like:
2412 we stop before consuming the closing '}', even though we
2413 have not yet reached a `;'. */
2414 if (nesting_depth == 0)
2417 /* If it is the closing '}' for a block that we have
2418 scanned, stop -- but only after consuming the token.
2424 we will stop after the body of the erroneously declared
2425 function, but before consuming the following `typedef'
2427 if (--nesting_depth == 0)
2429 cp_lexer_consume_token (parser->lexer);
2433 case CPP_OPEN_BRACE:
2441 /* Consume the token. */
2442 cp_lexer_consume_token (parser->lexer);
2446 /* This function is called at the end of a statement or declaration.
2447 If the next token is a semicolon, it is consumed; otherwise, error
2448 recovery is attempted. */
2451 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2453 /* Look for the trailing `;'. */
2454 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2456 /* If there is additional (erroneous) input, skip to the end of
2458 cp_parser_skip_to_end_of_statement (parser);
2459 /* If the next token is now a `;', consume it. */
2460 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2461 cp_lexer_consume_token (parser->lexer);
2465 /* Skip tokens until we have consumed an entire block, or until we
2466 have consumed a non-nested `;'. */
2469 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2471 int nesting_depth = 0;
2473 while (nesting_depth >= 0)
2475 cp_token *token = cp_lexer_peek_token (parser->lexer);
2477 switch (token->type)
2480 case CPP_PRAGMA_EOL:
2481 /* If we've run out of tokens, stop. */
2485 /* Stop if this is an unnested ';'. */
2490 case CPP_CLOSE_BRACE:
2491 /* Stop if this is an unnested '}', or closes the outermost
2498 case CPP_OPEN_BRACE:
2507 /* Consume the token. */
2508 cp_lexer_consume_token (parser->lexer);
2512 /* Skip tokens until a non-nested closing curly brace is the next
2516 cp_parser_skip_to_closing_brace (cp_parser *parser)
2518 unsigned nesting_depth = 0;
2522 cp_token *token = cp_lexer_peek_token (parser->lexer);
2524 switch (token->type)
2527 case CPP_PRAGMA_EOL:
2528 /* If we've run out of tokens, stop. */
2531 case CPP_CLOSE_BRACE:
2532 /* If the next token is a non-nested `}', then we have reached
2533 the end of the current block. */
2534 if (nesting_depth-- == 0)
2538 case CPP_OPEN_BRACE:
2539 /* If it the next token is a `{', then we are entering a new
2540 block. Consume the entire block. */
2548 /* Consume the token. */
2549 cp_lexer_consume_token (parser->lexer);
2553 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
2554 parameter is the PRAGMA token, allowing us to purge the entire pragma
2558 cp_parser_skip_to_pragma_eol (cp_parser* parser, cp_token *pragma_tok)
2562 parser->lexer->in_pragma = false;
2565 token = cp_lexer_consume_token (parser->lexer);
2566 while (token->type != CPP_PRAGMA_EOL && token->type != CPP_EOF);
2568 /* Ensure that the pragma is not parsed again. */
2569 cp_lexer_purge_tokens_after (parser->lexer, pragma_tok);
2572 /* Require pragma end of line, resyncing with it as necessary. The
2573 arguments are as for cp_parser_skip_to_pragma_eol. */
2576 cp_parser_require_pragma_eol (cp_parser *parser, cp_token *pragma_tok)
2578 parser->lexer->in_pragma = false;
2579 if (!cp_parser_require (parser, CPP_PRAGMA_EOL, "end of line"))
2580 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
2583 /* This is a simple wrapper around make_typename_type. When the id is
2584 an unresolved identifier node, we can provide a superior diagnostic
2585 using cp_parser_diagnose_invalid_type_name. */
2588 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2591 if (TREE_CODE (id) == IDENTIFIER_NODE)
2593 result = make_typename_type (scope, id, typename_type,
2594 /*complain=*/tf_none);
2595 if (result == error_mark_node)
2596 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2599 return make_typename_type (scope, id, typename_type, tf_error);
2603 /* Create a new C++ parser. */
2606 cp_parser_new (void)
2612 /* cp_lexer_new_main is called before calling ggc_alloc because
2613 cp_lexer_new_main might load a PCH file. */
2614 lexer = cp_lexer_new_main ();
2616 /* Initialize the binops_by_token so that we can get the tree
2617 directly from the token. */
2618 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2619 binops_by_token[binops[i].token_type] = binops[i];
2621 parser = GGC_CNEW (cp_parser);
2622 parser->lexer = lexer;
2623 parser->context = cp_parser_context_new (NULL);
2625 /* For now, we always accept GNU extensions. */
2626 parser->allow_gnu_extensions_p = 1;
2628 /* The `>' token is a greater-than operator, not the end of a
2630 parser->greater_than_is_operator_p = true;
2632 parser->default_arg_ok_p = true;
2634 /* We are not parsing a constant-expression. */
2635 parser->integral_constant_expression_p = false;
2636 parser->allow_non_integral_constant_expression_p = false;
2637 parser->non_integral_constant_expression_p = false;
2639 /* Local variable names are not forbidden. */
2640 parser->local_variables_forbidden_p = false;
2642 /* We are not processing an `extern "C"' declaration. */
2643 parser->in_unbraced_linkage_specification_p = false;
2645 /* We are not processing a declarator. */
2646 parser->in_declarator_p = false;
2648 /* We are not processing a template-argument-list. */
2649 parser->in_template_argument_list_p = false;
2651 /* We are not in an iteration statement. */
2652 parser->in_statement = 0;
2654 /* We are not in a switch statement. */
2655 parser->in_switch_statement_p = false;
2657 /* We are not parsing a type-id inside an expression. */
2658 parser->in_type_id_in_expr_p = false;
2660 /* Declarations aren't implicitly extern "C". */
2661 parser->implicit_extern_c = false;
2663 /* String literals should be translated to the execution character set. */
2664 parser->translate_strings_p = true;
2666 /* We are not parsing a function body. */
2667 parser->in_function_body = false;
2669 /* The unparsed function queue is empty. */
2670 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2672 /* There are no classes being defined. */
2673 parser->num_classes_being_defined = 0;
2675 /* No template parameters apply. */
2676 parser->num_template_parameter_lists = 0;
2681 /* Create a cp_lexer structure which will emit the tokens in CACHE
2682 and push it onto the parser's lexer stack. This is used for delayed
2683 parsing of in-class method bodies and default arguments, and should
2684 not be confused with tentative parsing. */
2686 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
2688 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
2689 lexer->next = parser->lexer;
2690 parser->lexer = lexer;
2692 /* Move the current source position to that of the first token in the
2694 cp_lexer_set_source_position_from_token (lexer->next_token);
2697 /* Pop the top lexer off the parser stack. This is never used for the
2698 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2700 cp_parser_pop_lexer (cp_parser *parser)
2702 cp_lexer *lexer = parser->lexer;
2703 parser->lexer = lexer->next;
2704 cp_lexer_destroy (lexer);
2706 /* Put the current source position back where it was before this
2707 lexer was pushed. */
2708 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
2711 /* Lexical conventions [gram.lex] */
2713 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2717 cp_parser_identifier (cp_parser* parser)
2721 /* Look for the identifier. */
2722 token = cp_parser_require (parser, CPP_NAME, "identifier");
2723 /* Return the value. */
2724 return token ? token->u.value : error_mark_node;
2727 /* Parse a sequence of adjacent string constants. Returns a
2728 TREE_STRING representing the combined, nul-terminated string
2729 constant. If TRANSLATE is true, translate the string to the
2730 execution character set. If WIDE_OK is true, a wide string is
2733 C++98 [lex.string] says that if a narrow string literal token is
2734 adjacent to a wide string literal token, the behavior is undefined.
2735 However, C99 6.4.5p4 says that this results in a wide string literal.
2736 We follow C99 here, for consistency with the C front end.
2738 This code is largely lifted from lex_string() in c-lex.c.
2740 FUTURE: ObjC++ will need to handle @-strings here. */
2742 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
2747 struct obstack str_ob;
2748 cpp_string str, istr, *strs;
2751 tok = cp_lexer_peek_token (parser->lexer);
2752 if (!cp_parser_is_string_literal (tok))
2754 cp_parser_error (parser, "expected string-literal");
2755 return error_mark_node;
2758 /* Try to avoid the overhead of creating and destroying an obstack
2759 for the common case of just one string. */
2760 if (!cp_parser_is_string_literal
2761 (cp_lexer_peek_nth_token (parser->lexer, 2)))
2763 cp_lexer_consume_token (parser->lexer);
2765 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->u.value);
2766 str.len = TREE_STRING_LENGTH (tok->u.value);
2768 if (tok->type == CPP_WSTRING)
2775 gcc_obstack_init (&str_ob);
2780 cp_lexer_consume_token (parser->lexer);
2782 str.text = (unsigned char *)TREE_STRING_POINTER (tok->u.value);
2783 str.len = TREE_STRING_LENGTH (tok->u.value);
2784 if (tok->type == CPP_WSTRING)
2787 obstack_grow (&str_ob, &str, sizeof (cpp_string));
2789 tok = cp_lexer_peek_token (parser->lexer);
2791 while (cp_parser_is_string_literal (tok));
2793 strs = (cpp_string *) obstack_finish (&str_ob);
2796 if (wide && !wide_ok)
2798 cp_parser_error (parser, "a wide string is invalid in this context");
2802 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
2803 (parse_in, strs, count, &istr, wide))
2805 value = build_string (istr.len, (char *)istr.text);
2806 free ((void *)istr.text);
2808 TREE_TYPE (value) = wide ? wchar_array_type_node : char_array_type_node;
2809 value = fix_string_type (value);
2812 /* cpp_interpret_string has issued an error. */
2813 value = error_mark_node;
2816 obstack_free (&str_ob, 0);
2822 /* Basic concepts [gram.basic] */
2824 /* Parse a translation-unit.
2827 declaration-seq [opt]
2829 Returns TRUE if all went well. */
2832 cp_parser_translation_unit (cp_parser* parser)
2834 /* The address of the first non-permanent object on the declarator
2836 static void *declarator_obstack_base;
2840 /* Create the declarator obstack, if necessary. */
2841 if (!cp_error_declarator)
2843 gcc_obstack_init (&declarator_obstack);
2844 /* Create the error declarator. */
2845 cp_error_declarator = make_declarator (cdk_error);
2846 /* Create the empty parameter list. */
2847 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
2848 /* Remember where the base of the declarator obstack lies. */
2849 declarator_obstack_base = obstack_next_free (&declarator_obstack);
2852 cp_parser_declaration_seq_opt (parser);
2854 /* If there are no tokens left then all went well. */
2855 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2857 /* Get rid of the token array; we don't need it any more. */
2858 cp_lexer_destroy (parser->lexer);
2859 parser->lexer = NULL;
2861 /* This file might have been a context that's implicitly extern
2862 "C". If so, pop the lang context. (Only relevant for PCH.) */
2863 if (parser->implicit_extern_c)
2865 pop_lang_context ();
2866 parser->implicit_extern_c = false;
2870 finish_translation_unit ();
2876 cp_parser_error (parser, "expected declaration");
2880 /* Make sure the declarator obstack was fully cleaned up. */
2881 gcc_assert (obstack_next_free (&declarator_obstack)
2882 == declarator_obstack_base);
2884 /* All went well. */
2888 /* Expressions [gram.expr] */
2890 /* Parse a primary-expression.
2901 ( compound-statement )
2902 __builtin_va_arg ( assignment-expression , type-id )
2903 __builtin_offsetof ( type-id , offsetof-expression )
2905 Objective-C++ Extension:
2913 ADDRESS_P is true iff this expression was immediately preceded by
2914 "&" and therefore might denote a pointer-to-member. CAST_P is true
2915 iff this expression is the target of a cast. TEMPLATE_ARG_P is
2916 true iff this expression is a template argument.
2918 Returns a representation of the expression. Upon return, *IDK
2919 indicates what kind of id-expression (if any) was present. */
2922 cp_parser_primary_expression (cp_parser *parser,
2925 bool template_arg_p,
2930 /* Assume the primary expression is not an id-expression. */
2931 *idk = CP_ID_KIND_NONE;
2933 /* Peek at the next token. */
2934 token = cp_lexer_peek_token (parser->lexer);
2935 switch (token->type)
2946 token = cp_lexer_consume_token (parser->lexer);
2947 /* Floating-point literals are only allowed in an integral
2948 constant expression if they are cast to an integral or
2949 enumeration type. */
2950 if (TREE_CODE (token->u.value) == REAL_CST
2951 && parser->integral_constant_expression_p
2954 /* CAST_P will be set even in invalid code like "int(2.7 +
2955 ...)". Therefore, we have to check that the next token
2956 is sure to end the cast. */
2959 cp_token *next_token;
2961 next_token = cp_lexer_peek_token (parser->lexer);
2962 if (/* The comma at the end of an
2963 enumerator-definition. */
2964 next_token->type != CPP_COMMA
2965 /* The curly brace at the end of an enum-specifier. */
2966 && next_token->type != CPP_CLOSE_BRACE
2967 /* The end of a statement. */
2968 && next_token->type != CPP_SEMICOLON
2969 /* The end of the cast-expression. */
2970 && next_token->type != CPP_CLOSE_PAREN
2971 /* The end of an array bound. */
2972 && next_token->type != CPP_CLOSE_SQUARE
2973 /* The closing ">" in a template-argument-list. */
2974 && (next_token->type != CPP_GREATER
2975 || parser->greater_than_is_operator_p))
2979 /* If we are within a cast, then the constraint that the
2980 cast is to an integral or enumeration type will be
2981 checked at that point. If we are not within a cast, then
2982 this code is invalid. */
2984 cp_parser_non_integral_constant_expression
2985 (parser, "floating-point literal");
2987 return token->u.value;
2991 /* ??? Should wide strings be allowed when parser->translate_strings_p
2992 is false (i.e. in attributes)? If not, we can kill the third
2993 argument to cp_parser_string_literal. */
2994 return cp_parser_string_literal (parser,
2995 parser->translate_strings_p,
2998 case CPP_OPEN_PAREN:
3001 bool saved_greater_than_is_operator_p;
3003 /* Consume the `('. */
3004 cp_lexer_consume_token (parser->lexer);
3005 /* Within a parenthesized expression, a `>' token is always
3006 the greater-than operator. */
3007 saved_greater_than_is_operator_p
3008 = parser->greater_than_is_operator_p;
3009 parser->greater_than_is_operator_p = true;
3010 /* If we see `( { ' then we are looking at the beginning of
3011 a GNU statement-expression. */
3012 if (cp_parser_allow_gnu_extensions_p (parser)
3013 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
3015 /* Statement-expressions are not allowed by the standard. */
3017 pedwarn ("ISO C++ forbids braced-groups within expressions");
3019 /* And they're not allowed outside of a function-body; you
3020 cannot, for example, write:
3022 int i = ({ int j = 3; j + 1; });
3024 at class or namespace scope. */
3025 if (!parser->in_function_body)
3026 error ("statement-expressions are allowed only inside functions");
3027 /* Start the statement-expression. */
3028 expr = begin_stmt_expr ();
3029 /* Parse the compound-statement. */
3030 cp_parser_compound_statement (parser, expr, false);
3032 expr = finish_stmt_expr (expr, false);
3036 /* Parse the parenthesized expression. */
3037 expr = cp_parser_expression (parser, cast_p);
3038 /* Let the front end know that this expression was
3039 enclosed in parentheses. This matters in case, for
3040 example, the expression is of the form `A::B', since
3041 `&A::B' might be a pointer-to-member, but `&(A::B)' is
3043 finish_parenthesized_expr (expr);
3045 /* The `>' token might be the end of a template-id or
3046 template-parameter-list now. */
3047 parser->greater_than_is_operator_p
3048 = saved_greater_than_is_operator_p;
3049 /* Consume the `)'. */
3050 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
3051 cp_parser_skip_to_end_of_statement (parser);
3057 switch (token->keyword)
3059 /* These two are the boolean literals. */
3061 cp_lexer_consume_token (parser->lexer);
3062 return boolean_true_node;
3064 cp_lexer_consume_token (parser->lexer);
3065 return boolean_false_node;
3067 /* The `__null' literal. */
3069 cp_lexer_consume_token (parser->lexer);
3072 /* Recognize the `this' keyword. */
3074 cp_lexer_consume_token (parser->lexer);
3075 if (parser->local_variables_forbidden_p)
3077 error ("%<this%> may not be used in this context");
3078 return error_mark_node;
3080 /* Pointers cannot appear in constant-expressions. */
3081 if (cp_parser_non_integral_constant_expression (parser,
3083 return error_mark_node;
3084 return finish_this_expr ();
3086 /* The `operator' keyword can be the beginning of an
3091 case RID_FUNCTION_NAME:
3092 case RID_PRETTY_FUNCTION_NAME:
3093 case RID_C99_FUNCTION_NAME:
3094 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
3095 __func__ are the names of variables -- but they are
3096 treated specially. Therefore, they are handled here,
3097 rather than relying on the generic id-expression logic
3098 below. Grammatically, these names are id-expressions.
3100 Consume the token. */
3101 token = cp_lexer_consume_token (parser->lexer);
3102 /* Look up the name. */
3103 return finish_fname (token->u.value);
3110 /* The `__builtin_va_arg' construct is used to handle
3111 `va_arg'. Consume the `__builtin_va_arg' token. */
3112 cp_lexer_consume_token (parser->lexer);
3113 /* Look for the opening `('. */
3114 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3115 /* Now, parse the assignment-expression. */
3116 expression = cp_parser_assignment_expression (parser,
3118 /* Look for the `,'. */
3119 cp_parser_require (parser, CPP_COMMA, "`,'");
3120 /* Parse the type-id. */
3121 type = cp_parser_type_id (parser);
3122 /* Look for the closing `)'. */
3123 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3124 /* Using `va_arg' in a constant-expression is not
3126 if (cp_parser_non_integral_constant_expression (parser,
3128 return error_mark_node;
3129 return build_x_va_arg (expression, type);
3133 return cp_parser_builtin_offsetof (parser);
3135 /* Objective-C++ expressions. */
3137 case RID_AT_PROTOCOL:
3138 case RID_AT_SELECTOR:
3139 return cp_parser_objc_expression (parser);
3142 cp_parser_error (parser, "expected primary-expression");
3143 return error_mark_node;
3146 /* An id-expression can start with either an identifier, a
3147 `::' as the beginning of a qualified-id, or the "operator"
3151 case CPP_TEMPLATE_ID:
3152 case CPP_NESTED_NAME_SPECIFIER:
3156 const char *error_msg;
3161 /* Parse the id-expression. */
3163 = cp_parser_id_expression (parser,
3164 /*template_keyword_p=*/false,
3165 /*check_dependency_p=*/true,
3167 /*declarator_p=*/false,
3168 /*optional_p=*/false);
3169 if (id_expression == error_mark_node)
3170 return error_mark_node;
3171 token = cp_lexer_peek_token (parser->lexer);
3172 done = (token->type != CPP_OPEN_SQUARE
3173 && token->type != CPP_OPEN_PAREN
3174 && token->type != CPP_DOT
3175 && token->type != CPP_DEREF
3176 && token->type != CPP_PLUS_PLUS
3177 && token->type != CPP_MINUS_MINUS);
3178 /* If we have a template-id, then no further lookup is
3179 required. If the template-id was for a template-class, we
3180 will sometimes have a TYPE_DECL at this point. */
3181 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
3182 || TREE_CODE (id_expression) == TYPE_DECL)
3183 decl = id_expression;
3184 /* Look up the name. */
3187 tree ambiguous_decls;
3189 decl = cp_parser_lookup_name (parser, id_expression,
3192 /*is_namespace=*/false,
3193 /*check_dependency=*/true,
3195 /* If the lookup was ambiguous, an error will already have
3197 if (ambiguous_decls)
3198 return error_mark_node;
3200 /* In Objective-C++, an instance variable (ivar) may be preferred
3201 to whatever cp_parser_lookup_name() found. */
3202 decl = objc_lookup_ivar (decl, id_expression);
3204 /* If name lookup gives us a SCOPE_REF, then the
3205 qualifying scope was dependent. */
3206 if (TREE_CODE (decl) == SCOPE_REF)
3208 /* At this point, we do not know if DECL is a valid
3209 integral constant expression. We assume that it is
3210 in fact such an expression, so that code like:
3212 template <int N> struct A {
3216 is accepted. At template-instantiation time, we
3217 will check that B<N>::i is actually a constant. */
3220 /* Check to see if DECL is a local variable in a context
3221 where that is forbidden. */
3222 if (parser->local_variables_forbidden_p
3223 && local_variable_p (decl))
3225 /* It might be that we only found DECL because we are
3226 trying to be generous with pre-ISO scoping rules.
3227 For example, consider:
3231 for (int i = 0; i < 10; ++i) {}
3232 extern void f(int j = i);
3235 Here, name look up will originally find the out
3236 of scope `i'. We need to issue a warning message,
3237 but then use the global `i'. */
3238 decl = check_for_out_of_scope_variable (decl);
3239 if (local_variable_p (decl))
3241 error ("local variable %qD may not appear in this context",
3243 return error_mark_node;
3248 decl = (finish_id_expression
3249 (id_expression, decl, parser->scope,
3251 parser->integral_constant_expression_p,
3252 parser->allow_non_integral_constant_expression_p,
3253 &parser->non_integral_constant_expression_p,
3254 template_p, done, address_p,
3258 cp_parser_error (parser, error_msg);
3262 /* Anything else is an error. */
3264 /* ...unless we have an Objective-C++ message or string literal, that is. */
3265 if (c_dialect_objc ()
3266 && (token->type == CPP_OPEN_SQUARE || token->type == CPP_OBJC_STRING))
3267 return cp_parser_objc_expression (parser);
3269 cp_parser_error (parser, "expected primary-expression");
3270 return error_mark_node;
3274 /* Parse an id-expression.
3281 :: [opt] nested-name-specifier template [opt] unqualified-id
3283 :: operator-function-id
3286 Return a representation of the unqualified portion of the
3287 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3288 a `::' or nested-name-specifier.
3290 Often, if the id-expression was a qualified-id, the caller will
3291 want to make a SCOPE_REF to represent the qualified-id. This
3292 function does not do this in order to avoid wastefully creating
3293 SCOPE_REFs when they are not required.
3295 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3298 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3299 uninstantiated templates.
3301 If *TEMPLATE_P is non-NULL, it is set to true iff the
3302 `template' keyword is used to explicitly indicate that the entity
3303 named is a template.
3305 If DECLARATOR_P is true, the id-expression is appearing as part of
3306 a declarator, rather than as part of an expression. */
3309 cp_parser_id_expression (cp_parser *parser,
3310 bool template_keyword_p,
3311 bool check_dependency_p,
3316 bool global_scope_p;
3317 bool nested_name_specifier_p;
3319 /* Assume the `template' keyword was not used. */
3321 *template_p = template_keyword_p;
3323 /* Look for the optional `::' operator. */
3325 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3327 /* Look for the optional nested-name-specifier. */
3328 nested_name_specifier_p
3329 = (cp_parser_nested_name_specifier_opt (parser,
3330 /*typename_keyword_p=*/false,
3335 /* If there is a nested-name-specifier, then we are looking at
3336 the first qualified-id production. */
3337 if (nested_name_specifier_p)
3340 tree saved_object_scope;
3341 tree saved_qualifying_scope;
3342 tree unqualified_id;
3345 /* See if the next token is the `template' keyword. */
3347 template_p = &is_template;
3348 *template_p = cp_parser_optional_template_keyword (parser);
3349 /* Name lookup we do during the processing of the
3350 unqualified-id might obliterate SCOPE. */
3351 saved_scope = parser->scope;
3352 saved_object_scope = parser->object_scope;
3353 saved_qualifying_scope = parser->qualifying_scope;
3354 /* Process the final unqualified-id. */
3355 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3358 /*optional_p=*/false);
3359 /* Restore the SAVED_SCOPE for our caller. */
3360 parser->scope = saved_scope;
3361 parser->object_scope = saved_object_scope;
3362 parser->qualifying_scope = saved_qualifying_scope;
3364 return unqualified_id;
3366 /* Otherwise, if we are in global scope, then we are looking at one
3367 of the other qualified-id productions. */
3368 else if (global_scope_p)
3373 /* Peek at the next token. */
3374 token = cp_lexer_peek_token (parser->lexer);
3376 /* If it's an identifier, and the next token is not a "<", then
3377 we can avoid the template-id case. This is an optimization
3378 for this common case. */
3379 if (token->type == CPP_NAME
3380 && !cp_parser_nth_token_starts_template_argument_list_p
3382 return cp_parser_identifier (parser);
3384 cp_parser_parse_tentatively (parser);
3385 /* Try a template-id. */
3386 id = cp_parser_template_id (parser,
3387 /*template_keyword_p=*/false,
3388 /*check_dependency_p=*/true,
3390 /* If that worked, we're done. */
3391 if (cp_parser_parse_definitely (parser))
3394 /* Peek at the next token. (Changes in the token buffer may
3395 have invalidated the pointer obtained above.) */
3396 token = cp_lexer_peek_token (parser->lexer);
3398 switch (token->type)
3401 return cp_parser_identifier (parser);
3404 if (token->keyword == RID_OPERATOR)
3405 return cp_parser_operator_function_id (parser);
3409 cp_parser_error (parser, "expected id-expression");
3410 return error_mark_node;
3414 return cp_parser_unqualified_id (parser, template_keyword_p,
3415 /*check_dependency_p=*/true,
3420 /* Parse an unqualified-id.
3424 operator-function-id
3425 conversion-function-id
3429 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3430 keyword, in a construct like `A::template ...'.
3432 Returns a representation of unqualified-id. For the `identifier'
3433 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3434 production a BIT_NOT_EXPR is returned; the operand of the
3435 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3436 other productions, see the documentation accompanying the
3437 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3438 names are looked up in uninstantiated templates. If DECLARATOR_P
3439 is true, the unqualified-id is appearing as part of a declarator,
3440 rather than as part of an expression. */
3443 cp_parser_unqualified_id (cp_parser* parser,
3444 bool template_keyword_p,
3445 bool check_dependency_p,
3451 /* Peek at the next token. */
3452 token = cp_lexer_peek_token (parser->lexer);
3454 switch (token->type)
3460 /* We don't know yet whether or not this will be a
3462 cp_parser_parse_tentatively (parser);
3463 /* Try a template-id. */
3464 id = cp_parser_template_id (parser, template_keyword_p,
3467 /* If it worked, we're done. */
3468 if (cp_parser_parse_definitely (parser))
3470 /* Otherwise, it's an ordinary identifier. */
3471 return cp_parser_identifier (parser);
3474 case CPP_TEMPLATE_ID:
3475 return cp_parser_template_id (parser, template_keyword_p,
3482 tree qualifying_scope;
3487 /* Consume the `~' token. */
3488 cp_lexer_consume_token (parser->lexer);
3489 /* Parse the class-name. The standard, as written, seems to
3492 template <typename T> struct S { ~S (); };
3493 template <typename T> S<T>::~S() {}
3495 is invalid, since `~' must be followed by a class-name, but
3496 `S<T>' is dependent, and so not known to be a class.
3497 That's not right; we need to look in uninstantiated
3498 templates. A further complication arises from:
3500 template <typename T> void f(T t) {
3504 Here, it is not possible to look up `T' in the scope of `T'
3505 itself. We must look in both the current scope, and the
3506 scope of the containing complete expression.
3508 Yet another issue is:
3517 The standard does not seem to say that the `S' in `~S'
3518 should refer to the type `S' and not the data member
3521 /* DR 244 says that we look up the name after the "~" in the
3522 same scope as we looked up the qualifying name. That idea
3523 isn't fully worked out; it's more complicated than that. */
3524 scope = parser->scope;
3525 object_scope = parser->object_scope;
3526 qualifying_scope = parser->qualifying_scope;
3528 /* Check for invalid scopes. */
3529 if (scope == error_mark_node)
3531 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
3532 cp_lexer_consume_token (parser->lexer);
3533 return error_mark_node;
3535 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
3537 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
3538 error ("scope %qT before %<~%> is not a class-name", scope);
3539 cp_parser_simulate_error (parser);
3540 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
3541 cp_lexer_consume_token (parser->lexer);
3542 return error_mark_node;
3544 gcc_assert (!scope || TYPE_P (scope));
3546 /* If the name is of the form "X::~X" it's OK. */
3547 token = cp_lexer_peek_token (parser->lexer);
3549 && token->type == CPP_NAME
3550 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3552 && constructor_name_p (token->u.value, scope))
3554 cp_lexer_consume_token (parser->lexer);
3555 return build_nt (BIT_NOT_EXPR, scope);
3558 /* If there was an explicit qualification (S::~T), first look
3559 in the scope given by the qualification (i.e., S). */
3561 type_decl = NULL_TREE;
3564 cp_parser_parse_tentatively (parser);
3565 type_decl = cp_parser_class_name (parser,
3566 /*typename_keyword_p=*/false,
3567 /*template_keyword_p=*/false,
3569 /*check_dependency=*/false,
3570 /*class_head_p=*/false,
3572 if (cp_parser_parse_definitely (parser))
3575 /* In "N::S::~S", look in "N" as well. */
3576 if (!done && scope && qualifying_scope)
3578 cp_parser_parse_tentatively (parser);
3579 parser->scope = qualifying_scope;
3580 parser->object_scope = NULL_TREE;
3581 parser->qualifying_scope = NULL_TREE;
3583 = cp_parser_class_name (parser,
3584 /*typename_keyword_p=*/false,
3585 /*template_keyword_p=*/false,
3587 /*check_dependency=*/false,
3588 /*class_head_p=*/false,
3590 if (cp_parser_parse_definitely (parser))
3593 /* In "p->S::~T", look in the scope given by "*p" as well. */
3594 else if (!done && object_scope)
3596 cp_parser_parse_tentatively (parser);
3597 parser->scope = object_scope;
3598 parser->object_scope = NULL_TREE;
3599 parser->qualifying_scope = NULL_TREE;
3601 = cp_parser_class_name (parser,
3602 /*typename_keyword_p=*/false,
3603 /*template_keyword_p=*/false,
3605 /*check_dependency=*/false,
3606 /*class_head_p=*/false,
3608 if (cp_parser_parse_definitely (parser))
3611 /* Look in the surrounding context. */
3614 parser->scope = NULL_TREE;
3615 parser->object_scope = NULL_TREE;
3616 parser->qualifying_scope = NULL_TREE;
3618 = cp_parser_class_name (parser,
3619 /*typename_keyword_p=*/false,
3620 /*template_keyword_p=*/false,
3622 /*check_dependency=*/false,
3623 /*class_head_p=*/false,
3626 /* If an error occurred, assume that the name of the
3627 destructor is the same as the name of the qualifying
3628 class. That allows us to keep parsing after running
3629 into ill-formed destructor names. */
3630 if (type_decl == error_mark_node && scope)
3631 return build_nt (BIT_NOT_EXPR, scope);
3632 else if (type_decl == error_mark_node)
3633 return error_mark_node;
3635 /* Check that destructor name and scope match. */
3636 if (declarator_p && scope && !check_dtor_name (scope, type_decl))
3638 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
3639 error ("declaration of %<~%T%> as member of %qT",
3641 cp_parser_simulate_error (parser);
3642 return error_mark_node;
3647 A typedef-name that names a class shall not be used as the
3648 identifier in the declarator for a destructor declaration. */
3650 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3651 && !DECL_SELF_REFERENCE_P (type_decl)
3652 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
3653 error ("typedef-name %qD used as destructor declarator",
3656 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3660 if (token->keyword == RID_OPERATOR)
3664 /* This could be a template-id, so we try that first. */
3665 cp_parser_parse_tentatively (parser);
3666 /* Try a template-id. */
3667 id = cp_parser_template_id (parser, template_keyword_p,
3668 /*check_dependency_p=*/true,
3670 /* If that worked, we're done. */
3671 if (cp_parser_parse_definitely (parser))
3673 /* We still don't know whether we're looking at an
3674 operator-function-id or a conversion-function-id. */
3675 cp_parser_parse_tentatively (parser);
3676 /* Try an operator-function-id. */
3677 id = cp_parser_operator_function_id (parser);
3678 /* If that didn't work, try a conversion-function-id. */
3679 if (!cp_parser_parse_definitely (parser))
3680 id = cp_parser_conversion_function_id (parser);
3689 cp_parser_error (parser, "expected unqualified-id");
3690 return error_mark_node;
3694 /* Parse an (optional) nested-name-specifier.
3696 nested-name-specifier:
3697 class-or-namespace-name :: nested-name-specifier [opt]
3698 class-or-namespace-name :: template nested-name-specifier [opt]
3700 PARSER->SCOPE should be set appropriately before this function is
3701 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3702 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3705 Sets PARSER->SCOPE to the class (TYPE) or namespace
3706 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3707 it unchanged if there is no nested-name-specifier. Returns the new
3708 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3710 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3711 part of a declaration and/or decl-specifier. */
3714 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3715 bool typename_keyword_p,
3716 bool check_dependency_p,
3718 bool is_declaration)
3720 bool success = false;
3721 cp_token_position start = 0;
3724 /* Remember where the nested-name-specifier starts. */
3725 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3727 start = cp_lexer_token_position (parser->lexer, false);
3728 push_deferring_access_checks (dk_deferred);
3735 tree saved_qualifying_scope;
3736 bool template_keyword_p;
3738 /* Spot cases that cannot be the beginning of a
3739 nested-name-specifier. */
3740 token = cp_lexer_peek_token (parser->lexer);
3742 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3743 the already parsed nested-name-specifier. */
3744 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3746 /* Grab the nested-name-specifier and continue the loop. */
3747 cp_parser_pre_parsed_nested_name_specifier (parser);
3748 /* If we originally encountered this nested-name-specifier
3749 with IS_DECLARATION set to false, we will not have
3750 resolved TYPENAME_TYPEs, so we must do so here. */
3752 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3754 new_scope = resolve_typename_type (parser->scope,
3755 /*only_current_p=*/false);
3756 if (new_scope != error_mark_node)
3757 parser->scope = new_scope;
3763 /* Spot cases that cannot be the beginning of a
3764 nested-name-specifier. On the second and subsequent times
3765 through the loop, we look for the `template' keyword. */
3766 if (success && token->keyword == RID_TEMPLATE)
3768 /* A template-id can start a nested-name-specifier. */
3769 else if (token->type == CPP_TEMPLATE_ID)
3773 /* If the next token is not an identifier, then it is
3774 definitely not a class-or-namespace-name. */
3775 if (token->type != CPP_NAME)
3777 /* If the following token is neither a `<' (to begin a
3778 template-id), nor a `::', then we are not looking at a
3779 nested-name-specifier. */
3780 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3781 if (token->type != CPP_SCOPE
3782 && !cp_parser_nth_token_starts_template_argument_list_p
3787 /* The nested-name-specifier is optional, so we parse
3789 cp_parser_parse_tentatively (parser);
3791 /* Look for the optional `template' keyword, if this isn't the
3792 first time through the loop. */
3794 template_keyword_p = cp_parser_optional_template_keyword (parser);
3796 template_keyword_p = false;
3798 /* Save the old scope since the name lookup we are about to do
3799 might destroy it. */
3800 old_scope = parser->scope;
3801 saved_qualifying_scope = parser->qualifying_scope;
3802 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
3803 look up names in "X<T>::I" in order to determine that "Y" is
3804 a template. So, if we have a typename at this point, we make
3805 an effort to look through it. */
3807 && !typename_keyword_p
3809 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3810 parser->scope = resolve_typename_type (parser->scope,
3811 /*only_current_p=*/false);
3812 /* Parse the qualifying entity. */
3814 = cp_parser_class_or_namespace_name (parser,
3820 /* Look for the `::' token. */
3821 cp_parser_require (parser, CPP_SCOPE, "`::'");
3823 /* If we found what we wanted, we keep going; otherwise, we're
3825 if (!cp_parser_parse_definitely (parser))
3827 bool error_p = false;
3829 /* Restore the OLD_SCOPE since it was valid before the
3830 failed attempt at finding the last
3831 class-or-namespace-name. */
3832 parser->scope = old_scope;
3833 parser->qualifying_scope = saved_qualifying_scope;
3834 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3836 /* If the next token is an identifier, and the one after
3837 that is a `::', then any valid interpretation would have
3838 found a class-or-namespace-name. */
3839 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3840 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3842 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3845 token = cp_lexer_consume_token (parser->lexer);
3848 if (!token->ambiguous_p)
3851 tree ambiguous_decls;
3853 decl = cp_parser_lookup_name (parser, token->u.value,
3855 /*is_template=*/false,
3856 /*is_namespace=*/false,
3857 /*check_dependency=*/true,
3859 if (TREE_CODE (decl) == TEMPLATE_DECL)
3860 error ("%qD used without template parameters", decl);
3861 else if (ambiguous_decls)
3863 error ("reference to %qD is ambiguous",
3865 print_candidates (ambiguous_decls);
3866 decl = error_mark_node;
3869 cp_parser_name_lookup_error
3870 (parser, token->u.value, decl,
3871 "is not a class or namespace");
3873 parser->scope = error_mark_node;
3875 /* Treat this as a successful nested-name-specifier
3880 If the name found is not a class-name (clause
3881 _class_) or namespace-name (_namespace.def_), the
3882 program is ill-formed. */
3885 cp_lexer_consume_token (parser->lexer);
3889 /* We've found one valid nested-name-specifier. */
3891 /* Name lookup always gives us a DECL. */
3892 if (TREE_CODE (new_scope) == TYPE_DECL)
3893 new_scope = TREE_TYPE (new_scope);
3894 /* Uses of "template" must be followed by actual templates. */
3895 if (template_keyword_p
3896 && !(CLASS_TYPE_P (new_scope)
3897 && ((CLASSTYPE_USE_TEMPLATE (new_scope)
3898 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope)))
3899 || CLASSTYPE_IS_TEMPLATE (new_scope)))
3900 && !(TREE_CODE (new_scope) == TYPENAME_TYPE
3901 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope))
3902 == TEMPLATE_ID_EXPR)))
3903 pedwarn (TYPE_P (new_scope)
3904 ? "%qT is not a template"
3905 : "%qD is not a template",
3907 /* If it is a class scope, try to complete it; we are about to
3908 be looking up names inside the class. */
3909 if (TYPE_P (new_scope)
3910 /* Since checking types for dependency can be expensive,
3911 avoid doing it if the type is already complete. */
3912 && !COMPLETE_TYPE_P (new_scope)
3913 /* Do not try to complete dependent types. */
3914 && !dependent_type_p (new_scope))
3915 new_scope = complete_type (new_scope);
3916 /* Make sure we look in the right scope the next time through
3918 parser->scope = new_scope;
3921 /* If parsing tentatively, replace the sequence of tokens that makes
3922 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3923 token. That way, should we re-parse the token stream, we will
3924 not have to repeat the effort required to do the parse, nor will
3925 we issue duplicate error messages. */
3926 if (success && start)
3930 token = cp_lexer_token_at (parser->lexer, start);
3931 /* Reset the contents of the START token. */
3932 token->type = CPP_NESTED_NAME_SPECIFIER;
3933 /* Retrieve any deferred checks. Do not pop this access checks yet
3934 so the memory will not be reclaimed during token replacing below. */
3935 token->u.tree_check_value = GGC_CNEW (struct tree_check);
3936 token->u.tree_check_value->value = parser->scope;
3937 token->u.tree_check_value->checks = get_deferred_access_checks ();
3938 token->u.tree_check_value->qualifying_scope =
3939 parser->qualifying_scope;
3940 token->keyword = RID_MAX;
3942 /* Purge all subsequent tokens. */
3943 cp_lexer_purge_tokens_after (parser->lexer, start);
3947 pop_to_parent_deferring_access_checks ();
3949 return success ? parser->scope : NULL_TREE;
3952 /* Parse a nested-name-specifier. See
3953 cp_parser_nested_name_specifier_opt for details. This function
3954 behaves identically, except that it will an issue an error if no
3955 nested-name-specifier is present. */
3958 cp_parser_nested_name_specifier (cp_parser *parser,
3959 bool typename_keyword_p,
3960 bool check_dependency_p,
3962 bool is_declaration)
3966 /* Look for the nested-name-specifier. */
3967 scope = cp_parser_nested_name_specifier_opt (parser,
3972 /* If it was not present, issue an error message. */
3975 cp_parser_error (parser, "expected nested-name-specifier");
3976 parser->scope = NULL_TREE;
3982 /* Parse a class-or-namespace-name.
3984 class-or-namespace-name:
3988 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3989 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3990 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3991 TYPE_P is TRUE iff the next name should be taken as a class-name,
3992 even the same name is declared to be another entity in the same
3995 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3996 specified by the class-or-namespace-name. If neither is found the
3997 ERROR_MARK_NODE is returned. */
4000 cp_parser_class_or_namespace_name (cp_parser *parser,
4001 bool typename_keyword_p,
4002 bool template_keyword_p,
4003 bool check_dependency_p,
4005 bool is_declaration)
4008 tree saved_qualifying_scope;
4009 tree saved_object_scope;
4013 /* Before we try to parse the class-name, we must save away the
4014 current PARSER->SCOPE since cp_parser_class_name will destroy
4016 saved_scope = parser->scope;
4017 saved_qualifying_scope = parser->qualifying_scope;
4018 saved_object_scope = parser->object_scope;
4019 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
4020 there is no need to look for a namespace-name. */
4021 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
4023 cp_parser_parse_tentatively (parser);
4024 scope = cp_parser_class_name (parser,
4027 type_p ? class_type : none_type,
4029 /*class_head_p=*/false,
4031 /* If that didn't work, try for a namespace-name. */
4032 if (!only_class_p && !cp_parser_parse_definitely (parser))
4034 /* Restore the saved scope. */
4035 parser->scope = saved_scope;
4036 parser->qualifying_scope = saved_qualifying_scope;
4037 parser->object_scope = saved_object_scope;
4038 /* If we are not looking at an identifier followed by the scope
4039 resolution operator, then this is not part of a
4040 nested-name-specifier. (Note that this function is only used
4041 to parse the components of a nested-name-specifier.) */
4042 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
4043 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
4044 return error_mark_node;
4045 scope = cp_parser_namespace_name (parser);
4051 /* Parse a postfix-expression.
4055 postfix-expression [ expression ]
4056 postfix-expression ( expression-list [opt] )
4057 simple-type-specifier ( expression-list [opt] )
4058 typename :: [opt] nested-name-specifier identifier
4059 ( expression-list [opt] )
4060 typename :: [opt] nested-name-specifier template [opt] template-id
4061 ( expression-list [opt] )
4062 postfix-expression . template [opt] id-expression
4063 postfix-expression -> template [opt] id-expression
4064 postfix-expression . pseudo-destructor-name
4065 postfix-expression -> pseudo-destructor-name
4066 postfix-expression ++
4067 postfix-expression --
4068 dynamic_cast < type-id > ( expression )
4069 static_cast < type-id > ( expression )
4070 reinterpret_cast < type-id > ( expression )
4071 const_cast < type-id > ( expression )
4072 typeid ( expression )
4078 ( type-id ) { initializer-list , [opt] }
4080 This extension is a GNU version of the C99 compound-literal
4081 construct. (The C99 grammar uses `type-name' instead of `type-id',
4082 but they are essentially the same concept.)
4084 If ADDRESS_P is true, the postfix expression is the operand of the
4085 `&' operator. CAST_P is true if this expression is the target of a
4088 Returns a representation of the expression. */
4091 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p)
4095 cp_id_kind idk = CP_ID_KIND_NONE;
4096 tree postfix_expression = NULL_TREE;
4098 /* Peek at the next token. */
4099 token = cp_lexer_peek_token (parser->lexer);
4100 /* Some of the productions are determined by keywords. */
4101 keyword = token->keyword;
4111 const char *saved_message;
4113 /* All of these can be handled in the same way from the point
4114 of view of parsing. Begin by consuming the token
4115 identifying the cast. */
4116 cp_lexer_consume_token (parser->lexer);
4118 /* New types cannot be defined in the cast. */
4119 saved_message = parser->type_definition_forbidden_message;
4120 parser->type_definition_forbidden_message
4121 = "types may not be defined in casts";
4123 /* Look for the opening `<'. */
4124 cp_parser_require (parser, CPP_LESS, "`<'");
4125 /* Parse the type to which we are casting. */
4126 type = cp_parser_type_id (parser);
4127 /* Look for the closing `>'. */
4128 cp_parser_require (parser, CPP_GREATER, "`>'");
4129 /* Restore the old message. */
4130 parser->type_definition_forbidden_message = saved_message;
4132 /* And the expression which is being cast. */
4133 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
4134 expression = cp_parser_expression (parser, /*cast_p=*/true);
4135 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4137 /* Only type conversions to integral or enumeration types
4138 can be used in constant-expressions. */
4139 if (!cast_valid_in_integral_constant_expression_p (type)
4140 && (cp_parser_non_integral_constant_expression
4142 "a cast to a type other than an integral or "
4143 "enumeration type")))
4144 return error_mark_node;
4150 = build_dynamic_cast (type, expression);
4154 = build_static_cast (type, expression);
4158 = build_reinterpret_cast (type, expression);
4162 = build_const_cast (type, expression);
4173 const char *saved_message;
4174 bool saved_in_type_id_in_expr_p;
4176 /* Consume the `typeid' token. */
4177 cp_lexer_consume_token (parser->lexer);
4178 /* Look for the `(' token. */
4179 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
4180 /* Types cannot be defined in a `typeid' expression. */
4181 saved_message = parser->type_definition_forbidden_message;
4182 parser->type_definition_forbidden_message
4183 = "types may not be defined in a `typeid\' expression";
4184 /* We can't be sure yet whether we're looking at a type-id or an
4186 cp_parser_parse_tentatively (parser);
4187 /* Try a type-id first. */
4188 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4189 parser->in_type_id_in_expr_p = true;
4190 type = cp_parser_type_id (parser);
4191 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4192 /* Look for the `)' token. Otherwise, we can't be sure that
4193 we're not looking at an expression: consider `typeid (int
4194 (3))', for example. */
4195 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4196 /* If all went well, simply lookup the type-id. */
4197 if (cp_parser_parse_definitely (parser))
4198 postfix_expression = get_typeid (type);
4199 /* Otherwise, fall back to the expression variant. */
4204 /* Look for an expression. */
4205 expression = cp_parser_expression (parser, /*cast_p=*/false);
4206 /* Compute its typeid. */
4207 postfix_expression = build_typeid (expression);
4208 /* Look for the `)' token. */
4209 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4211 /* Restore the saved message. */
4212 parser->type_definition_forbidden_message = saved_message;
4213 /* `typeid' may not appear in an integral constant expression. */
4214 if (cp_parser_non_integral_constant_expression(parser,
4215 "`typeid' operator"))
4216 return error_mark_node;
4223 /* The syntax permitted here is the same permitted for an
4224 elaborated-type-specifier. */
4225 type = cp_parser_elaborated_type_specifier (parser,
4226 /*is_friend=*/false,
4227 /*is_declaration=*/false);
4228 postfix_expression = cp_parser_functional_cast (parser, type);
4236 /* If the next thing is a simple-type-specifier, we may be
4237 looking at a functional cast. We could also be looking at
4238 an id-expression. So, we try the functional cast, and if
4239 that doesn't work we fall back to the primary-expression. */
4240 cp_parser_parse_tentatively (parser);
4241 /* Look for the simple-type-specifier. */
4242 type = cp_parser_simple_type_specifier (parser,
4243 /*decl_specs=*/NULL,
4244 CP_PARSER_FLAGS_NONE);
4245 /* Parse the cast itself. */
4246 if (!cp_parser_error_occurred (parser))
4248 = cp_parser_functional_cast (parser, type);
4249 /* If that worked, we're done. */
4250 if (cp_parser_parse_definitely (parser))
4253 /* If the functional-cast didn't work out, try a
4254 compound-literal. */
4255 if (cp_parser_allow_gnu_extensions_p (parser)
4256 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4258 VEC(constructor_elt,gc) *initializer_list = NULL;
4259 bool saved_in_type_id_in_expr_p;
4261 cp_parser_parse_tentatively (parser);
4262 /* Consume the `('. */
4263 cp_lexer_consume_token (parser->lexer);
4264 /* Parse the type. */
4265 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4266 parser->in_type_id_in_expr_p = true;
4267 type = cp_parser_type_id (parser);
4268 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4269 /* Look for the `)'. */
4270 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4271 /* Look for the `{'. */
4272 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
4273 /* If things aren't going well, there's no need to
4275 if (!cp_parser_error_occurred (parser))
4277 bool non_constant_p;
4278 /* Parse the initializer-list. */
4280 = cp_parser_initializer_list (parser, &non_constant_p);
4281 /* Allow a trailing `,'. */
4282 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
4283 cp_lexer_consume_token (parser->lexer);
4284 /* Look for the final `}'. */
4285 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
4287 /* If that worked, we're definitely looking at a
4288 compound-literal expression. */
4289 if (cp_parser_parse_definitely (parser))
4291 /* Warn the user that a compound literal is not
4292 allowed in standard C++. */
4294 pedwarn ("ISO C++ forbids compound-literals");
4295 /* For simplicitly, we disallow compound literals in
4296 constant-expressions for simpliicitly. We could
4297 allow compound literals of integer type, whose
4298 initializer was a constant, in constant
4299 expressions. Permitting that usage, as a further
4300 extension, would not change the meaning of any
4301 currently accepted programs. (Of course, as
4302 compound literals are not part of ISO C++, the
4303 standard has nothing to say.) */
4304 if (cp_parser_non_integral_constant_expression
4305 (parser, "non-constant compound literals"))
4307 postfix_expression = error_mark_node;
4310 /* Form the representation of the compound-literal. */
4312 = finish_compound_literal (type, initializer_list);
4317 /* It must be a primary-expression. */
4319 = cp_parser_primary_expression (parser, address_p, cast_p,
4320 /*template_arg_p=*/false,
4326 /* Keep looping until the postfix-expression is complete. */
4329 if (idk == CP_ID_KIND_UNQUALIFIED
4330 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
4331 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
4332 /* It is not a Koenig lookup function call. */
4334 = unqualified_name_lookup_error (postfix_expression);
4336 /* Peek at the next token. */
4337 token = cp_lexer_peek_token (parser->lexer);
4339 switch (token->type)
4341 case CPP_OPEN_SQUARE:
4343 = cp_parser_postfix_open_square_expression (parser,
4346 idk = CP_ID_KIND_NONE;
4349 case CPP_OPEN_PAREN:
4350 /* postfix-expression ( expression-list [opt] ) */
4353 bool is_builtin_constant_p;
4354 bool saved_integral_constant_expression_p = false;
4355 bool saved_non_integral_constant_expression_p = false;
4358 is_builtin_constant_p
4359 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
4360 if (is_builtin_constant_p)
4362 /* The whole point of __builtin_constant_p is to allow
4363 non-constant expressions to appear as arguments. */
4364 saved_integral_constant_expression_p
4365 = parser->integral_constant_expression_p;
4366 saved_non_integral_constant_expression_p
4367 = parser->non_integral_constant_expression_p;
4368 parser->integral_constant_expression_p = false;
4370 args = (cp_parser_parenthesized_expression_list
4371 (parser, /*is_attribute_list=*/false,
4373 /*non_constant_p=*/NULL));
4374 if (is_builtin_constant_p)
4376 parser->integral_constant_expression_p
4377 = saved_integral_constant_expression_p;
4378 parser->non_integral_constant_expression_p
4379 = saved_non_integral_constant_expression_p;
4382 if (args == error_mark_node)
4384 postfix_expression = error_mark_node;
4388 /* Function calls are not permitted in
4389 constant-expressions. */
4390 if (! builtin_valid_in_constant_expr_p (postfix_expression)
4391 && cp_parser_non_integral_constant_expression (parser,
4394 postfix_expression = error_mark_node;
4399 if (idk == CP_ID_KIND_UNQUALIFIED)
4401 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
4407 = perform_koenig_lookup (postfix_expression, args);
4411 = unqualified_fn_lookup_error (postfix_expression);
4413 /* We do not perform argument-dependent lookup if
4414 normal lookup finds a non-function, in accordance
4415 with the expected resolution of DR 218. */
4416 else if (args && is_overloaded_fn (postfix_expression))
4418 tree fn = get_first_fn (postfix_expression);
4420 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4421 fn = OVL_CURRENT (TREE_OPERAND (fn, 0));
4423 /* Only do argument dependent lookup if regular
4424 lookup does not find a set of member functions.
4425 [basic.lookup.koenig]/2a */
4426 if (!DECL_FUNCTION_MEMBER_P (fn))
4430 = perform_koenig_lookup (postfix_expression, args);
4435 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4437 tree instance = TREE_OPERAND (postfix_expression, 0);
4438 tree fn = TREE_OPERAND (postfix_expression, 1);
4440 if (processing_template_decl
4441 && (type_dependent_expression_p (instance)
4442 || (!BASELINK_P (fn)
4443 && TREE_CODE (fn) != FIELD_DECL)
4444 || type_dependent_expression_p (fn)
4445 || any_type_dependent_arguments_p (args)))
4448 = build_min_nt (CALL_EXPR, postfix_expression,
4453 if (BASELINK_P (fn))
4455 = (build_new_method_call
4456 (instance, fn, args, NULL_TREE,
4457 (idk == CP_ID_KIND_QUALIFIED
4458 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL),
4462 = finish_call_expr (postfix_expression, args,
4463 /*disallow_virtual=*/false,
4464 /*koenig_p=*/false);
4466 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4467 || TREE_CODE (postfix_expression) == MEMBER_REF
4468 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4469 postfix_expression = (build_offset_ref_call_from_tree
4470 (postfix_expression, args));
4471 else if (idk == CP_ID_KIND_QUALIFIED)
4472 /* A call to a static class member, or a namespace-scope
4475 = finish_call_expr (postfix_expression, args,
4476 /*disallow_virtual=*/true,
4479 /* All other function calls. */
4481 = finish_call_expr (postfix_expression, args,
4482 /*disallow_virtual=*/false,
4485 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4486 idk = CP_ID_KIND_NONE;
4492 /* postfix-expression . template [opt] id-expression
4493 postfix-expression . pseudo-destructor-name
4494 postfix-expression -> template [opt] id-expression
4495 postfix-expression -> pseudo-destructor-name */
4497 /* Consume the `.' or `->' operator. */
4498 cp_lexer_consume_token (parser->lexer);
4501 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4507 /* postfix-expression ++ */
4508 /* Consume the `++' token. */
4509 cp_lexer_consume_token (parser->lexer);
4510 /* Generate a representation for the complete expression. */
4512 = finish_increment_expr (postfix_expression,
4513 POSTINCREMENT_EXPR);
4514 /* Increments may not appear in constant-expressions. */
4515 if (cp_parser_non_integral_constant_expression (parser,
4517 postfix_expression = error_mark_node;
4518 idk = CP_ID_KIND_NONE;
4521 case CPP_MINUS_MINUS:
4522 /* postfix-expression -- */
4523 /* Consume the `--' token. */
4524 cp_lexer_consume_token (parser->lexer);
4525 /* Generate a representation for the complete expression. */
4527 = finish_increment_expr (postfix_expression,
4528 POSTDECREMENT_EXPR);
4529 /* Decrements may not appear in constant-expressions. */
4530 if (cp_parser_non_integral_constant_expression (parser,
4532 postfix_expression = error_mark_node;
4533 idk = CP_ID_KIND_NONE;
4537 return postfix_expression;
4541 /* We should never get here. */
4543 return error_mark_node;
4546 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4547 by cp_parser_builtin_offsetof. We're looking for
4549 postfix-expression [ expression ]
4551 FOR_OFFSETOF is set if we're being called in that context, which
4552 changes how we deal with integer constant expressions. */
4555 cp_parser_postfix_open_square_expression (cp_parser *parser,
4556 tree postfix_expression,
4561 /* Consume the `[' token. */
4562 cp_lexer_consume_token (parser->lexer);
4564 /* Parse the index expression. */
4565 /* ??? For offsetof, there is a question of what to allow here. If
4566 offsetof is not being used in an integral constant expression context,
4567 then we *could* get the right answer by computing the value at runtime.
4568 If we are in an integral constant expression context, then we might
4569 could accept any constant expression; hard to say without analysis.
4570 Rather than open the barn door too wide right away, allow only integer
4571 constant expressions here. */
4573 index = cp_parser_constant_expression (parser, false, NULL);
4575 index = cp_parser_expression (parser, /*cast_p=*/false);
4577 /* Look for the closing `]'. */
4578 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4580 /* Build the ARRAY_REF. */
4581 postfix_expression = grok_array_decl (postfix_expression, index);
4583 /* When not doing offsetof, array references are not permitted in
4584 constant-expressions. */
4586 && (cp_parser_non_integral_constant_expression
4587 (parser, "an array reference")))
4588 postfix_expression = error_mark_node;
4590 return postfix_expression;
4593 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4594 by cp_parser_builtin_offsetof. We're looking for
4596 postfix-expression . template [opt] id-expression
4597 postfix-expression . pseudo-destructor-name
4598 postfix-expression -> template [opt] id-expression
4599 postfix-expression -> pseudo-destructor-name
4601 FOR_OFFSETOF is set if we're being called in that context. That sorta
4602 limits what of the above we'll actually accept, but nevermind.
4603 TOKEN_TYPE is the "." or "->" token, which will already have been
4604 removed from the stream. */
4607 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4608 enum cpp_ttype token_type,
4609 tree postfix_expression,
4610 bool for_offsetof, cp_id_kind *idk)
4614 bool pseudo_destructor_p;
4615 tree scope = NULL_TREE;
4617 /* If this is a `->' operator, dereference the pointer. */
4618 if (token_type == CPP_DEREF)
4619 postfix_expression = build_x_arrow (postfix_expression);
4620 /* Check to see whether or not the expression is type-dependent. */
4621 dependent_p = type_dependent_expression_p (postfix_expression);
4622 /* The identifier following the `->' or `.' is not qualified. */
4623 parser->scope = NULL_TREE;
4624 parser->qualifying_scope = NULL_TREE;
4625 parser->object_scope = NULL_TREE;
4626 *idk = CP_ID_KIND_NONE;
4627 /* Enter the scope corresponding to the type of the object
4628 given by the POSTFIX_EXPRESSION. */
4629 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4631 scope = TREE_TYPE (postfix_expression);
4632 /* According to the standard, no expression should ever have
4633 reference type. Unfortunately, we do not currently match
4634 the standard in this respect in that our internal representation
4635 of an expression may have reference type even when the standard
4636 says it does not. Therefore, we have to manually obtain the
4637 underlying type here. */
4638 scope = non_reference (scope);
4639 /* The type of the POSTFIX_EXPRESSION must be complete. */
4640 if (scope == unknown_type_node)
4642 error ("%qE does not have class type", postfix_expression);
4646 scope = complete_type_or_else (scope, NULL_TREE);
4647 /* Let the name lookup machinery know that we are processing a
4648 class member access expression. */
4649 parser->context->object_type = scope;
4650 /* If something went wrong, we want to be able to discern that case,
4651 as opposed to the case where there was no SCOPE due to the type
4652 of expression being dependent. */
4654 scope = error_mark_node;
4655 /* If the SCOPE was erroneous, make the various semantic analysis
4656 functions exit quickly -- and without issuing additional error
4658 if (scope == error_mark_node)
4659 postfix_expression = error_mark_node;
4662 /* Assume this expression is not a pseudo-destructor access. */
4663 pseudo_destructor_p = false;
4665 /* If the SCOPE is a scalar type, then, if this is a valid program,
4666 we must be looking at a pseudo-destructor-name. */
4667 if (scope && SCALAR_TYPE_P (scope))
4672 cp_parser_parse_tentatively (parser);
4673 /* Parse the pseudo-destructor-name. */
4675 cp_parser_pseudo_destructor_name (parser, &s, &type);
4676 if (cp_parser_parse_definitely (parser))
4678 pseudo_destructor_p = true;
4680 = finish_pseudo_destructor_expr (postfix_expression,
4681 s, TREE_TYPE (type));
4685 if (!pseudo_destructor_p)
4687 /* If the SCOPE is not a scalar type, we are looking at an
4688 ordinary class member access expression, rather than a
4689 pseudo-destructor-name. */
4691 /* Parse the id-expression. */
4692 name = (cp_parser_id_expression
4694 cp_parser_optional_template_keyword (parser),
4695 /*check_dependency_p=*/true,
4697 /*declarator_p=*/false,
4698 /*optional_p=*/false));
4699 /* In general, build a SCOPE_REF if the member name is qualified.
4700 However, if the name was not dependent and has already been
4701 resolved; there is no need to build the SCOPE_REF. For example;
4703 struct X { void f(); };
4704 template <typename T> void f(T* t) { t->X::f(); }
4706 Even though "t" is dependent, "X::f" is not and has been resolved
4707 to a BASELINK; there is no need to include scope information. */
4709 /* But we do need to remember that there was an explicit scope for
4710 virtual function calls. */
4712 *idk = CP_ID_KIND_QUALIFIED;
4714 /* If the name is a template-id that names a type, we will get a
4715 TYPE_DECL here. That is invalid code. */
4716 if (TREE_CODE (name) == TYPE_DECL)
4718 error ("invalid use of %qD", name);
4719 postfix_expression = error_mark_node;
4723 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4725 name = build_qualified_name (/*type=*/NULL_TREE,
4729 parser->scope = NULL_TREE;
4730 parser->qualifying_scope = NULL_TREE;
4731 parser->object_scope = NULL_TREE;
4733 if (scope && name && BASELINK_P (name))
4734 adjust_result_of_qualified_name_lookup
4735 (name, BINFO_TYPE (BASELINK_ACCESS_BINFO (name)), scope);
4737 = finish_class_member_access_expr (postfix_expression, name,
4742 /* We no longer need to look up names in the scope of the object on
4743 the left-hand side of the `.' or `->' operator. */
4744 parser->context->object_type = NULL_TREE;
4746 /* Outside of offsetof, these operators may not appear in
4747 constant-expressions. */
4749 && (cp_parser_non_integral_constant_expression
4750 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4751 postfix_expression = error_mark_node;
4753 return postfix_expression;
4756 /* Parse a parenthesized expression-list.
4759 assignment-expression
4760 expression-list, assignment-expression
4765 identifier, expression-list
4767 CAST_P is true if this expression is the target of a cast.
4769 Returns a TREE_LIST. The TREE_VALUE of each node is a
4770 representation of an assignment-expression. Note that a TREE_LIST
4771 is returned even if there is only a single expression in the list.
4772 error_mark_node is returned if the ( and or ) are
4773 missing. NULL_TREE is returned on no expressions. The parentheses
4774 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4775 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4776 indicates whether or not all of the expressions in the list were
4780 cp_parser_parenthesized_expression_list (cp_parser* parser,
4781 bool is_attribute_list,
4783 bool *non_constant_p)
4785 tree expression_list = NULL_TREE;
4786 bool fold_expr_p = is_attribute_list;
4787 tree identifier = NULL_TREE;
4789 /* Assume all the expressions will be constant. */
4791 *non_constant_p = false;
4793 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4794 return error_mark_node;
4796 /* Consume expressions until there are no more. */
4797 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4802 /* At the beginning of attribute lists, check to see if the
4803 next token is an identifier. */
4804 if (is_attribute_list
4805 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4809 /* Consume the identifier. */
4810 token = cp_lexer_consume_token (parser->lexer);
4811 /* Save the identifier. */
4812 identifier = token->u.value;
4816 /* Parse the next assignment-expression. */
4819 bool expr_non_constant_p;
4820 expr = (cp_parser_constant_expression
4821 (parser, /*allow_non_constant_p=*/true,
4822 &expr_non_constant_p));
4823 if (expr_non_constant_p)
4824 *non_constant_p = true;
4827 expr = cp_parser_assignment_expression (parser, cast_p);
4830 expr = fold_non_dependent_expr (expr);
4832 /* Add it to the list. We add error_mark_node
4833 expressions to the list, so that we can still tell if
4834 the correct form for a parenthesized expression-list
4835 is found. That gives better errors. */
4836 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4838 if (expr == error_mark_node)
4842 /* After the first item, attribute lists look the same as
4843 expression lists. */
4844 is_attribute_list = false;
4847 /* If the next token isn't a `,', then we are done. */
4848 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4851 /* Otherwise, consume the `,' and keep going. */
4852 cp_lexer_consume_token (parser->lexer);
4855 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4860 /* We try and resync to an unnested comma, as that will give the
4861 user better diagnostics. */
4862 ending = cp_parser_skip_to_closing_parenthesis (parser,
4863 /*recovering=*/true,
4865 /*consume_paren=*/true);
4869 return error_mark_node;
4872 /* We built up the list in reverse order so we must reverse it now. */
4873 expression_list = nreverse (expression_list);
4875 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4877 return expression_list;
4880 /* Parse a pseudo-destructor-name.
4882 pseudo-destructor-name:
4883 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4884 :: [opt] nested-name-specifier template template-id :: ~ type-name
4885 :: [opt] nested-name-specifier [opt] ~ type-name
4887 If either of the first two productions is used, sets *SCOPE to the
4888 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4889 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4890 or ERROR_MARK_NODE if the parse fails. */
4893 cp_parser_pseudo_destructor_name (cp_parser* parser,
4897 bool nested_name_specifier_p;
4899 /* Assume that things will not work out. */
4900 *type = error_mark_node;
4902 /* Look for the optional `::' operator. */
4903 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4904 /* Look for the optional nested-name-specifier. */
4905 nested_name_specifier_p
4906 = (cp_parser_nested_name_specifier_opt (parser,
4907 /*typename_keyword_p=*/false,
4908 /*check_dependency_p=*/true,
4910 /*is_declaration=*/true)
4912 /* Now, if we saw a nested-name-specifier, we might be doing the
4913 second production. */
4914 if (nested_name_specifier_p
4915 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4917 /* Consume the `template' keyword. */
4918 cp_lexer_consume_token (parser->lexer);
4919 /* Parse the template-id. */
4920 cp_parser_template_id (parser,
4921 /*template_keyword_p=*/true,
4922 /*check_dependency_p=*/false,
4923 /*is_declaration=*/true);
4924 /* Look for the `::' token. */
4925 cp_parser_require (parser, CPP_SCOPE, "`::'");
4927 /* If the next token is not a `~', then there might be some
4928 additional qualification. */
4929 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4931 /* Look for the type-name. */
4932 *scope = TREE_TYPE (cp_parser_type_name (parser));
4934 if (*scope == error_mark_node)
4937 /* If we don't have ::~, then something has gone wrong. Since
4938 the only caller of this function is looking for something
4939 after `.' or `->' after a scalar type, most likely the
4940 program is trying to get a member of a non-aggregate
4942 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4943 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4945 cp_parser_error (parser, "request for member of non-aggregate type");
4949 /* Look for the `::' token. */
4950 cp_parser_require (parser, CPP_SCOPE, "`::'");
4955 /* Look for the `~'. */
4956 cp_parser_require (parser, CPP_COMPL, "`~'");
4957 /* Look for the type-name again. We are not responsible for
4958 checking that it matches the first type-name. */
4959 *type = cp_parser_type_name (parser);
4962 /* Parse a unary-expression.
4968 unary-operator cast-expression
4969 sizeof unary-expression
4977 __extension__ cast-expression
4978 __alignof__ unary-expression
4979 __alignof__ ( type-id )
4980 __real__ cast-expression
4981 __imag__ cast-expression
4984 ADDRESS_P is true iff the unary-expression is appearing as the
4985 operand of the `&' operator. CAST_P is true if this expression is
4986 the target of a cast.
4988 Returns a representation of the expression. */
4991 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p)
4994 enum tree_code unary_operator;
4996 /* Peek at the next token. */
4997 token = cp_lexer_peek_token (parser->lexer);
4998 /* Some keywords give away the kind of expression. */
4999 if (token->type == CPP_KEYWORD)
5001 enum rid keyword = token->keyword;
5011 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
5012 /* Consume the token. */
5013 cp_lexer_consume_token (parser->lexer);
5014 /* Parse the operand. */
5015 operand = cp_parser_sizeof_operand (parser, keyword);
5017 if (TYPE_P (operand))
5018 return cxx_sizeof_or_alignof_type (operand, op, true);
5020 return cxx_sizeof_or_alignof_expr (operand, op);
5024 return cp_parser_new_expression (parser);
5027 return cp_parser_delete_expression (parser);
5031 /* The saved value of the PEDANTIC flag. */
5035 /* Save away the PEDANTIC flag. */
5036 cp_parser_extension_opt (parser, &saved_pedantic);
5037 /* Parse the cast-expression. */
5038 expr = cp_parser_simple_cast_expression (parser);
5039 /* Restore the PEDANTIC flag. */
5040 pedantic = saved_pedantic;
5050 /* Consume the `__real__' or `__imag__' token. */
5051 cp_lexer_consume_token (parser->lexer);
5052 /* Parse the cast-expression. */
5053 expression = cp_parser_simple_cast_expression (parser);
5054 /* Create the complete representation. */
5055 return build_x_unary_op ((keyword == RID_REALPART
5056 ? REALPART_EXPR : IMAGPART_EXPR),
5066 /* Look for the `:: new' and `:: delete', which also signal the
5067 beginning of a new-expression, or delete-expression,
5068 respectively. If the next token is `::', then it might be one of
5070 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
5074 /* See if the token after the `::' is one of the keywords in
5075 which we're interested. */
5076 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
5077 /* If it's `new', we have a new-expression. */
5078 if (keyword == RID_NEW)
5079 return cp_parser_new_expression (parser);
5080 /* Similarly, for `delete'. */
5081 else if (keyword == RID_DELETE)
5082 return cp_parser_delete_expression (parser);
5085 /* Look for a unary operator. */
5086 unary_operator = cp_parser_unary_operator (token);
5087 /* The `++' and `--' operators can be handled similarly, even though
5088 they are not technically unary-operators in the grammar. */
5089 if (unary_operator == ERROR_MARK)
5091 if (token->type == CPP_PLUS_PLUS)
5092 unary_operator = PREINCREMENT_EXPR;
5093 else if (token->type == CPP_MINUS_MINUS)
5094 unary_operator = PREDECREMENT_EXPR;
5095 /* Handle the GNU address-of-label extension. */
5096 else if (cp_parser_allow_gnu_extensions_p (parser)
5097 && token->type == CPP_AND_AND)
5101 /* Consume the '&&' token. */
5102 cp_lexer_consume_token (parser->lexer);
5103 /* Look for the identifier. */
5104 identifier = cp_parser_identifier (parser);
5105 /* Create an expression representing the address. */
5106 return finish_label_address_expr (identifier);
5109 if (unary_operator != ERROR_MARK)
5111 tree cast_expression;
5112 tree expression = error_mark_node;
5113 const char *non_constant_p = NULL;
5115 /* Consume the operator token. */
5116 token = cp_lexer_consume_token (parser->lexer);
5117 /* Parse the cast-expression. */
5119 = cp_parser_cast_expression (parser,
5120 unary_operator == ADDR_EXPR,
5122 /* Now, build an appropriate representation. */
5123 switch (unary_operator)
5126 non_constant_p = "`*'";
5127 expression = build_x_indirect_ref (cast_expression, "unary *");
5131 non_constant_p = "`&'";
5134 expression = build_x_unary_op (unary_operator, cast_expression);
5137 case PREINCREMENT_EXPR:
5138 case PREDECREMENT_EXPR:
5139 non_constant_p = (unary_operator == PREINCREMENT_EXPR
5142 case UNARY_PLUS_EXPR:
5144 case TRUTH_NOT_EXPR:
5145 expression = finish_unary_op_expr (unary_operator, cast_expression);
5153 && cp_parser_non_integral_constant_expression (parser,
5155 expression = error_mark_node;
5160 return cp_parser_postfix_expression (parser, address_p, cast_p);
5163 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5164 unary-operator, the corresponding tree code is returned. */
5166 static enum tree_code
5167 cp_parser_unary_operator (cp_token* token)
5169 switch (token->type)
5172 return INDIRECT_REF;
5178 return UNARY_PLUS_EXPR;
5184 return TRUTH_NOT_EXPR;
5187 return BIT_NOT_EXPR;
5194 /* Parse a new-expression.
5197 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5198 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5200 Returns a representation of the expression. */
5203 cp_parser_new_expression (cp_parser* parser)
5205 bool global_scope_p;
5211 /* Look for the optional `::' operator. */
5213 = (cp_parser_global_scope_opt (parser,
5214 /*current_scope_valid_p=*/false)
5216 /* Look for the `new' operator. */
5217 cp_parser_require_keyword (parser, RID_NEW, "`new'");
5218 /* There's no easy way to tell a new-placement from the
5219 `( type-id )' construct. */
5220 cp_parser_parse_tentatively (parser);
5221 /* Look for a new-placement. */
5222 placement = cp_parser_new_placement (parser);
5223 /* If that didn't work out, there's no new-placement. */
5224 if (!cp_parser_parse_definitely (parser))
5225 placement = NULL_TREE;
5227 /* If the next token is a `(', then we have a parenthesized
5229 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5231 /* Consume the `('. */
5232 cp_lexer_consume_token (parser->lexer);
5233 /* Parse the type-id. */
5234 type = cp_parser_type_id (parser);
5235 /* Look for the closing `)'. */
5236 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5237 /* There should not be a direct-new-declarator in this production,
5238 but GCC used to allowed this, so we check and emit a sensible error
5239 message for this case. */
5240 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5242 error ("array bound forbidden after parenthesized type-id");
5243 inform ("try removing the parentheses around the type-id");
5244 cp_parser_direct_new_declarator (parser);
5248 /* Otherwise, there must be a new-type-id. */
5250 type = cp_parser_new_type_id (parser, &nelts);
5252 /* If the next token is a `(', then we have a new-initializer. */
5253 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5254 initializer = cp_parser_new_initializer (parser);
5256 initializer = NULL_TREE;
5258 /* A new-expression may not appear in an integral constant
5260 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
5261 return error_mark_node;
5263 /* Create a representation of the new-expression. */
5264 return build_new (placement, type, nelts, initializer, global_scope_p);
5267 /* Parse a new-placement.
5272 Returns the same representation as for an expression-list. */
5275 cp_parser_new_placement (cp_parser* parser)
5277 tree expression_list;
5279 /* Parse the expression-list. */
5280 expression_list = (cp_parser_parenthesized_expression_list
5281 (parser, false, /*cast_p=*/false,
5282 /*non_constant_p=*/NULL));
5284 return expression_list;
5287 /* Parse a new-type-id.
5290 type-specifier-seq new-declarator [opt]
5292 Returns the TYPE allocated. If the new-type-id indicates an array
5293 type, *NELTS is set to the number of elements in the last array
5294 bound; the TYPE will not include the last array bound. */
5297 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
5299 cp_decl_specifier_seq type_specifier_seq;
5300 cp_declarator *new_declarator;
5301 cp_declarator *declarator;
5302 cp_declarator *outer_declarator;
5303 const char *saved_message;
5306 /* The type-specifier sequence must not contain type definitions.
5307 (It cannot contain declarations of new types either, but if they
5308 are not definitions we will catch that because they are not
5310 saved_message = parser->type_definition_forbidden_message;
5311 parser->type_definition_forbidden_message
5312 = "types may not be defined in a new-type-id";
5313 /* Parse the type-specifier-seq. */
5314 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
5315 &type_specifier_seq);
5316 /* Restore the old message. */
5317 parser->type_definition_forbidden_message = saved_message;
5318 /* Parse the new-declarator. */
5319 new_declarator = cp_parser_new_declarator_opt (parser);
5321 /* Determine the number of elements in the last array dimension, if
5324 /* Skip down to the last array dimension. */
5325 declarator = new_declarator;
5326 outer_declarator = NULL;
5327 while (declarator && (declarator->kind == cdk_pointer
5328 || declarator->kind == cdk_ptrmem))
5330 outer_declarator = declarator;
5331 declarator = declarator->declarator;
5334 && declarator->kind == cdk_array
5335 && declarator->declarator
5336 && declarator->declarator->kind == cdk_array)
5338 outer_declarator = declarator;
5339 declarator = declarator->declarator;
5342 if (declarator && declarator->kind == cdk_array)
5344 *nelts = declarator->u.array.bounds;
5345 if (*nelts == error_mark_node)
5346 *nelts = integer_one_node;
5348 if (outer_declarator)
5349 outer_declarator->declarator = declarator->declarator;
5351 new_declarator = NULL;
5354 type = groktypename (&type_specifier_seq, new_declarator);
5355 if (TREE_CODE (type) == ARRAY_TYPE && *nelts == NULL_TREE)
5357 *nelts = array_type_nelts_top (type);
5358 type = TREE_TYPE (type);
5363 /* Parse an (optional) new-declarator.
5366 ptr-operator new-declarator [opt]
5367 direct-new-declarator
5369 Returns the declarator. */
5371 static cp_declarator *
5372 cp_parser_new_declarator_opt (cp_parser* parser)
5374 enum tree_code code;
5376 cp_cv_quals cv_quals;
5378 /* We don't know if there's a ptr-operator next, or not. */
5379 cp_parser_parse_tentatively (parser);
5380 /* Look for a ptr-operator. */
5381 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
5382 /* If that worked, look for more new-declarators. */
5383 if (cp_parser_parse_definitely (parser))
5385 cp_declarator *declarator;
5387 /* Parse another optional declarator. */
5388 declarator = cp_parser_new_declarator_opt (parser);
5390 /* Create the representation of the declarator. */
5392 declarator = make_ptrmem_declarator (cv_quals, type, declarator);
5393 else if (code == INDIRECT_REF)
5394 declarator = make_pointer_declarator (cv_quals, declarator);
5396 declarator = make_reference_declarator (cv_quals, declarator);
5401 /* If the next token is a `[', there is a direct-new-declarator. */
5402 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5403 return cp_parser_direct_new_declarator (parser);
5408 /* Parse a direct-new-declarator.
5410 direct-new-declarator:
5412 direct-new-declarator [constant-expression]
5416 static cp_declarator *
5417 cp_parser_direct_new_declarator (cp_parser* parser)
5419 cp_declarator *declarator = NULL;
5425 /* Look for the opening `['. */
5426 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
5427 /* The first expression is not required to be constant. */
5430 expression = cp_parser_expression (parser, /*cast_p=*/false);
5431 /* The standard requires that the expression have integral
5432 type. DR 74 adds enumeration types. We believe that the
5433 real intent is that these expressions be handled like the
5434 expression in a `switch' condition, which also allows
5435 classes with a single conversion to integral or
5436 enumeration type. */
5437 if (!processing_template_decl)
5440 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5445 error ("expression in new-declarator must have integral "
5446 "or enumeration type");
5447 expression = error_mark_node;
5451 /* But all the other expressions must be. */
5454 = cp_parser_constant_expression (parser,
5455 /*allow_non_constant=*/false,
5457 /* Look for the closing `]'. */
5458 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5460 /* Add this bound to the declarator. */
5461 declarator = make_array_declarator (declarator, expression);
5463 /* If the next token is not a `[', then there are no more
5465 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5472 /* Parse a new-initializer.
5475 ( expression-list [opt] )
5477 Returns a representation of the expression-list. If there is no
5478 expression-list, VOID_ZERO_NODE is returned. */
5481 cp_parser_new_initializer (cp_parser* parser)
5483 tree expression_list;
5485 expression_list = (cp_parser_parenthesized_expression_list
5486 (parser, false, /*cast_p=*/false,
5487 /*non_constant_p=*/NULL));
5488 if (!expression_list)
5489 expression_list = void_zero_node;
5491 return expression_list;
5494 /* Parse a delete-expression.
5497 :: [opt] delete cast-expression
5498 :: [opt] delete [ ] cast-expression
5500 Returns a representation of the expression. */
5503 cp_parser_delete_expression (cp_parser* parser)
5505 bool global_scope_p;
5509 /* Look for the optional `::' operator. */
5511 = (cp_parser_global_scope_opt (parser,
5512 /*current_scope_valid_p=*/false)
5514 /* Look for the `delete' keyword. */
5515 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
5516 /* See if the array syntax is in use. */
5517 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5519 /* Consume the `[' token. */
5520 cp_lexer_consume_token (parser->lexer);
5521 /* Look for the `]' token. */
5522 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5523 /* Remember that this is the `[]' construct. */
5529 /* Parse the cast-expression. */
5530 expression = cp_parser_simple_cast_expression (parser);
5532 /* A delete-expression may not appear in an integral constant
5534 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
5535 return error_mark_node;
5537 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5540 /* Parse a cast-expression.
5544 ( type-id ) cast-expression
5546 ADDRESS_P is true iff the unary-expression is appearing as the
5547 operand of the `&' operator. CAST_P is true if this expression is
5548 the target of a cast.
5550 Returns a representation of the expression. */
5553 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p)
5555 /* If it's a `(', then we might be looking at a cast. */
5556 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5558 tree type = NULL_TREE;
5559 tree expr = NULL_TREE;
5560 bool compound_literal_p;
5561 const char *saved_message;
5563 /* There's no way to know yet whether or not this is a cast.
5564 For example, `(int (3))' is a unary-expression, while `(int)
5565 3' is a cast. So, we resort to parsing tentatively. */
5566 cp_parser_parse_tentatively (parser);
5567 /* Types may not be defined in a cast. */
5568 saved_message = parser->type_definition_forbidden_message;
5569 parser->type_definition_forbidden_message
5570 = "types may not be defined in casts";
5571 /* Consume the `('. */
5572 cp_lexer_consume_token (parser->lexer);
5573 /* A very tricky bit is that `(struct S) { 3 }' is a
5574 compound-literal (which we permit in C++ as an extension).
5575 But, that construct is not a cast-expression -- it is a
5576 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5577 is legal; if the compound-literal were a cast-expression,
5578 you'd need an extra set of parentheses.) But, if we parse
5579 the type-id, and it happens to be a class-specifier, then we
5580 will commit to the parse at that point, because we cannot
5581 undo the action that is done when creating a new class. So,
5582 then we cannot back up and do a postfix-expression.
5584 Therefore, we scan ahead to the closing `)', and check to see
5585 if the token after the `)' is a `{'. If so, we are not
5586 looking at a cast-expression.
5588 Save tokens so that we can put them back. */
5589 cp_lexer_save_tokens (parser->lexer);
5590 /* Skip tokens until the next token is a closing parenthesis.
5591 If we find the closing `)', and the next token is a `{', then
5592 we are looking at a compound-literal. */
5594 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5595 /*consume_paren=*/true)
5596 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5597 /* Roll back the tokens we skipped. */
5598 cp_lexer_rollback_tokens (parser->lexer);
5599 /* If we were looking at a compound-literal, simulate an error
5600 so that the call to cp_parser_parse_definitely below will
5602 if (compound_literal_p)
5603 cp_parser_simulate_error (parser);
5606 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5607 parser->in_type_id_in_expr_p = true;
5608 /* Look for the type-id. */
5609 type = cp_parser_type_id (parser);
5610 /* Look for the closing `)'. */
5611 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5612 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5615 /* Restore the saved message. */
5616 parser->type_definition_forbidden_message = saved_message;
5618 /* If ok so far, parse the dependent expression. We cannot be
5619 sure it is a cast. Consider `(T ())'. It is a parenthesized
5620 ctor of T, but looks like a cast to function returning T
5621 without a dependent expression. */
5622 if (!cp_parser_error_occurred (parser))
5623 expr = cp_parser_cast_expression (parser,
5624 /*address_p=*/false,
5627 if (cp_parser_parse_definitely (parser))
5629 /* Warn about old-style casts, if so requested. */
5630 if (warn_old_style_cast
5631 && !in_system_header
5632 && !VOID_TYPE_P (type)
5633 && current_lang_name != lang_name_c)
5634 warning (OPT_Wold_style_cast, "use of old-style cast");
5636 /* Only type conversions to integral or enumeration types
5637 can be used in constant-expressions. */
5638 if (!cast_valid_in_integral_constant_expression_p (type)
5639 && (cp_parser_non_integral_constant_expression
5641 "a cast to a type other than an integral or "
5642 "enumeration type")))
5643 return error_mark_node;
5645 /* Perform the cast. */
5646 expr = build_c_cast (type, expr);
5651 /* If we get here, then it's not a cast, so it must be a
5652 unary-expression. */
5653 return cp_parser_unary_expression (parser, address_p, cast_p);
5656 /* Parse a binary expression of the general form:
5660 pm-expression .* cast-expression
5661 pm-expression ->* cast-expression
5663 multiplicative-expression:
5665 multiplicative-expression * pm-expression
5666 multiplicative-expression / pm-expression
5667 multiplicative-expression % pm-expression
5669 additive-expression:
5670 multiplicative-expression
5671 additive-expression + multiplicative-expression
5672 additive-expression - multiplicative-expression
5676 shift-expression << additive-expression
5677 shift-expression >> additive-expression
5679 relational-expression:
5681 relational-expression < shift-expression
5682 relational-expression > shift-expression
5683 relational-expression <= shift-expression
5684 relational-expression >= shift-expression
5688 relational-expression:
5689 relational-expression <? shift-expression
5690 relational-expression >? shift-expression
5692 equality-expression:
5693 relational-expression
5694 equality-expression == relational-expression
5695 equality-expression != relational-expression
5699 and-expression & equality-expression
5701 exclusive-or-expression:
5703 exclusive-or-expression ^ and-expression
5705 inclusive-or-expression:
5706 exclusive-or-expression
5707 inclusive-or-expression | exclusive-or-expression
5709 logical-and-expression:
5710 inclusive-or-expression
5711 logical-and-expression && inclusive-or-expression
5713 logical-or-expression:
5714 logical-and-expression
5715 logical-or-expression || logical-and-expression
5717 All these are implemented with a single function like:
5720 simple-cast-expression
5721 binary-expression <token> binary-expression
5723 CAST_P is true if this expression is the target of a cast.
5725 The binops_by_token map is used to get the tree codes for each <token> type.
5726 binary-expressions are associated according to a precedence table. */
5728 #define TOKEN_PRECEDENCE(token) \
5729 ((token->type == CPP_GREATER && !parser->greater_than_is_operator_p) \
5730 ? PREC_NOT_OPERATOR \
5731 : binops_by_token[token->type].prec)
5734 cp_parser_binary_expression (cp_parser* parser, bool cast_p)
5736 cp_parser_expression_stack stack;
5737 cp_parser_expression_stack_entry *sp = &stack[0];
5740 enum tree_code tree_type, lhs_type, rhs_type;
5741 enum cp_parser_prec prec = PREC_NOT_OPERATOR, new_prec, lookahead_prec;
5744 /* Parse the first expression. */
5745 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p);
5746 lhs_type = ERROR_MARK;
5750 /* Get an operator token. */
5751 token = cp_lexer_peek_token (parser->lexer);
5753 new_prec = TOKEN_PRECEDENCE (token);
5755 /* Popping an entry off the stack means we completed a subexpression:
5756 - either we found a token which is not an operator (`>' where it is not
5757 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
5758 will happen repeatedly;
5759 - or, we found an operator which has lower priority. This is the case
5760 where the recursive descent *ascends*, as in `3 * 4 + 5' after
5762 if (new_prec <= prec)
5771 tree_type = binops_by_token[token->type].tree_type;
5773 /* We used the operator token. */
5774 cp_lexer_consume_token (parser->lexer);
5776 /* Extract another operand. It may be the RHS of this expression
5777 or the LHS of a new, higher priority expression. */
5778 rhs = cp_parser_simple_cast_expression (parser);
5779 rhs_type = ERROR_MARK;
5781 /* Get another operator token. Look up its precedence to avoid
5782 building a useless (immediately popped) stack entry for common
5783 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
5784 token = cp_lexer_peek_token (parser->lexer);
5785 lookahead_prec = TOKEN_PRECEDENCE (token);
5786 if (lookahead_prec > new_prec)
5788 /* ... and prepare to parse the RHS of the new, higher priority
5789 expression. Since precedence levels on the stack are
5790 monotonically increasing, we do not have to care about
5793 sp->tree_type = tree_type;
5795 sp->lhs_type = lhs_type;
5798 lhs_type = rhs_type;
5800 new_prec = lookahead_prec;
5804 /* If the stack is not empty, we have parsed into LHS the right side
5805 (`4' in the example above) of an expression we had suspended.
5806 We can use the information on the stack to recover the LHS (`3')
5807 from the stack together with the tree code (`MULT_EXPR'), and
5808 the precedence of the higher level subexpression
5809 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
5810 which will be used to actually build the additive expression. */
5813 tree_type = sp->tree_type;
5815 rhs_type = lhs_type;
5817 lhs_type = sp->lhs_type;
5820 overloaded_p = false;
5821 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
5823 lhs_type = tree_type;
5825 /* If the binary operator required the use of an overloaded operator,
5826 then this expression cannot be an integral constant-expression.
5827 An overloaded operator can be used even if both operands are
5828 otherwise permissible in an integral constant-expression if at
5829 least one of the operands is of enumeration type. */
5832 && (cp_parser_non_integral_constant_expression
5833 (parser, "calls to overloaded operators")))
5834 return error_mark_node;
5841 /* Parse the `? expression : assignment-expression' part of a
5842 conditional-expression. The LOGICAL_OR_EXPR is the
5843 logical-or-expression that started the conditional-expression.
5844 Returns a representation of the entire conditional-expression.
5846 This routine is used by cp_parser_assignment_expression.
5848 ? expression : assignment-expression
5852 ? : assignment-expression */
5855 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5858 tree assignment_expr;
5860 /* Consume the `?' token. */
5861 cp_lexer_consume_token (parser->lexer);
5862 if (cp_parser_allow_gnu_extensions_p (parser)
5863 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5864 /* Implicit true clause. */
5867 /* Parse the expression. */
5868 expr = cp_parser_expression (parser, /*cast_p=*/false);
5870 /* The next token should be a `:'. */
5871 cp_parser_require (parser, CPP_COLON, "`:'");
5872 /* Parse the assignment-expression. */
5873 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false);
5875 /* Build the conditional-expression. */
5876 return build_x_conditional_expr (logical_or_expr,
5881 /* Parse an assignment-expression.
5883 assignment-expression:
5884 conditional-expression
5885 logical-or-expression assignment-operator assignment_expression
5888 CAST_P is true if this expression is the target of a cast.
5890 Returns a representation for the expression. */
5893 cp_parser_assignment_expression (cp_parser* parser, bool cast_p)
5897 /* If the next token is the `throw' keyword, then we're looking at
5898 a throw-expression. */
5899 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5900 expr = cp_parser_throw_expression (parser);
5901 /* Otherwise, it must be that we are looking at a
5902 logical-or-expression. */
5905 /* Parse the binary expressions (logical-or-expression). */
5906 expr = cp_parser_binary_expression (parser, cast_p);
5907 /* If the next token is a `?' then we're actually looking at a
5908 conditional-expression. */
5909 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5910 return cp_parser_question_colon_clause (parser, expr);
5913 enum tree_code assignment_operator;
5915 /* If it's an assignment-operator, we're using the second
5918 = cp_parser_assignment_operator_opt (parser);
5919 if (assignment_operator != ERROR_MARK)
5923 /* Parse the right-hand side of the assignment. */
5924 rhs = cp_parser_assignment_expression (parser, cast_p);
5925 /* An assignment may not appear in a
5926 constant-expression. */
5927 if (cp_parser_non_integral_constant_expression (parser,
5929 return error_mark_node;
5930 /* Build the assignment expression. */
5931 expr = build_x_modify_expr (expr,
5932 assignment_operator,
5941 /* Parse an (optional) assignment-operator.
5943 assignment-operator: one of
5944 = *= /= %= += -= >>= <<= &= ^= |=
5948 assignment-operator: one of
5951 If the next token is an assignment operator, the corresponding tree
5952 code is returned, and the token is consumed. For example, for
5953 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5954 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5955 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5956 operator, ERROR_MARK is returned. */
5958 static enum tree_code
5959 cp_parser_assignment_operator_opt (cp_parser* parser)
5964 /* Peek at the next toen. */
5965 token = cp_lexer_peek_token (parser->lexer);
5967 switch (token->type)
5978 op = TRUNC_DIV_EXPR;
5982 op = TRUNC_MOD_EXPR;
6014 /* Nothing else is an assignment operator. */
6018 /* If it was an assignment operator, consume it. */
6019 if (op != ERROR_MARK)
6020 cp_lexer_consume_token (parser->lexer);
6025 /* Parse an expression.
6028 assignment-expression
6029 expression , assignment-expression
6031 CAST_P is true if this expression is the target of a cast.
6033 Returns a representation of the expression. */
6036 cp_parser_expression (cp_parser* parser, bool cast_p)
6038 tree expression = NULL_TREE;
6042 tree assignment_expression;
6044 /* Parse the next assignment-expression. */
6045 assignment_expression
6046 = cp_parser_assignment_expression (parser, cast_p);
6047 /* If this is the first assignment-expression, we can just
6050 expression = assignment_expression;
6052 expression = build_x_compound_expr (expression,
6053 assignment_expression);
6054 /* If the next token is not a comma, then we are done with the
6056 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6058 /* Consume the `,'. */
6059 cp_lexer_consume_token (parser->lexer);
6060 /* A comma operator cannot appear in a constant-expression. */
6061 if (cp_parser_non_integral_constant_expression (parser,
6062 "a comma operator"))
6063 expression = error_mark_node;
6069 /* Parse a constant-expression.
6071 constant-expression:
6072 conditional-expression
6074 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
6075 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
6076 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
6077 is false, NON_CONSTANT_P should be NULL. */
6080 cp_parser_constant_expression (cp_parser* parser,
6081 bool allow_non_constant_p,
6082 bool *non_constant_p)
6084 bool saved_integral_constant_expression_p;
6085 bool saved_allow_non_integral_constant_expression_p;
6086 bool saved_non_integral_constant_expression_p;
6089 /* It might seem that we could simply parse the
6090 conditional-expression, and then check to see if it were
6091 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
6092 one that the compiler can figure out is constant, possibly after
6093 doing some simplifications or optimizations. The standard has a
6094 precise definition of constant-expression, and we must honor
6095 that, even though it is somewhat more restrictive.
6101 is not a legal declaration, because `(2, 3)' is not a
6102 constant-expression. The `,' operator is forbidden in a
6103 constant-expression. However, GCC's constant-folding machinery
6104 will fold this operation to an INTEGER_CST for `3'. */
6106 /* Save the old settings. */
6107 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
6108 saved_allow_non_integral_constant_expression_p
6109 = parser->allow_non_integral_constant_expression_p;
6110 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
6111 /* We are now parsing a constant-expression. */
6112 parser->integral_constant_expression_p = true;
6113 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
6114 parser->non_integral_constant_expression_p = false;
6115 /* Although the grammar says "conditional-expression", we parse an
6116 "assignment-expression", which also permits "throw-expression"
6117 and the use of assignment operators. In the case that
6118 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
6119 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
6120 actually essential that we look for an assignment-expression.
6121 For example, cp_parser_initializer_clauses uses this function to
6122 determine whether a particular assignment-expression is in fact
6124 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false);
6125 /* Restore the old settings. */
6126 parser->integral_constant_expression_p
6127 = saved_integral_constant_expression_p;
6128 parser->allow_non_integral_constant_expression_p
6129 = saved_allow_non_integral_constant_expression_p;
6130 if (allow_non_constant_p)
6131 *non_constant_p = parser->non_integral_constant_expression_p;
6132 else if (parser->non_integral_constant_expression_p)
6133 expression = error_mark_node;
6134 parser->non_integral_constant_expression_p
6135 = saved_non_integral_constant_expression_p;
6140 /* Parse __builtin_offsetof.
6142 offsetof-expression:
6143 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
6145 offsetof-member-designator:
6147 | offsetof-member-designator "." id-expression
6148 | offsetof-member-designator "[" expression "]" */
6151 cp_parser_builtin_offsetof (cp_parser *parser)
6153 int save_ice_p, save_non_ice_p;
6157 /* We're about to accept non-integral-constant things, but will
6158 definitely yield an integral constant expression. Save and
6159 restore these values around our local parsing. */
6160 save_ice_p = parser->integral_constant_expression_p;
6161 save_non_ice_p = parser->non_integral_constant_expression_p;
6163 /* Consume the "__builtin_offsetof" token. */
6164 cp_lexer_consume_token (parser->lexer);
6165 /* Consume the opening `('. */
6166 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6167 /* Parse the type-id. */
6168 type = cp_parser_type_id (parser);
6169 /* Look for the `,'. */
6170 cp_parser_require (parser, CPP_COMMA, "`,'");
6172 /* Build the (type *)null that begins the traditional offsetof macro. */
6173 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
6175 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
6176 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
6180 cp_token *token = cp_lexer_peek_token (parser->lexer);
6181 switch (token->type)
6183 case CPP_OPEN_SQUARE:
6184 /* offsetof-member-designator "[" expression "]" */
6185 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
6189 /* offsetof-member-designator "." identifier */
6190 cp_lexer_consume_token (parser->lexer);
6191 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
6195 case CPP_CLOSE_PAREN:
6196 /* Consume the ")" token. */
6197 cp_lexer_consume_token (parser->lexer);
6201 /* Error. We know the following require will fail, but
6202 that gives the proper error message. */
6203 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6204 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
6205 expr = error_mark_node;
6211 /* If we're processing a template, we can't finish the semantics yet.
6212 Otherwise we can fold the entire expression now. */
6213 if (processing_template_decl)
6214 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
6216 expr = finish_offsetof (expr);
6219 parser->integral_constant_expression_p = save_ice_p;
6220 parser->non_integral_constant_expression_p = save_non_ice_p;
6225 /* Statements [gram.stmt.stmt] */
6227 /* Parse a statement.
6231 expression-statement
6236 declaration-statement
6239 IN_COMPOUND is true when the statement is nested inside a
6240 cp_parser_compound_statement; this matters for certain pragmas.
6242 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6243 is a (possibly labeled) if statement which is not enclosed in braces
6244 and has an else clause. This is used to implement -Wparentheses. */
6247 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
6248 bool in_compound, bool *if_p)
6252 location_t statement_location;
6257 /* There is no statement yet. */
6258 statement = NULL_TREE;
6259 /* Peek at the next token. */
6260 token = cp_lexer_peek_token (parser->lexer);
6261 /* Remember the location of the first token in the statement. */
6262 statement_location = token->location;
6263 /* If this is a keyword, then that will often determine what kind of
6264 statement we have. */
6265 if (token->type == CPP_KEYWORD)
6267 enum rid keyword = token->keyword;
6273 /* Looks like a labeled-statement with a case label.
6274 Parse the label, and then use tail recursion to parse
6276 cp_parser_label_for_labeled_statement (parser);
6281 statement = cp_parser_selection_statement (parser, if_p);
6287 statement = cp_parser_iteration_statement (parser);
6294 statement = cp_parser_jump_statement (parser);
6297 /* Objective-C++ exception-handling constructs. */
6300 case RID_AT_FINALLY:
6301 case RID_AT_SYNCHRONIZED:
6303 statement = cp_parser_objc_statement (parser);
6307 statement = cp_parser_try_block (parser);
6311 /* It might be a keyword like `int' that can start a
6312 declaration-statement. */
6316 else if (token->type == CPP_NAME)
6318 /* If the next token is a `:', then we are looking at a
6319 labeled-statement. */
6320 token = cp_lexer_peek_nth_token (parser->lexer, 2);
6321 if (token->type == CPP_COLON)
6323 /* Looks like a labeled-statement with an ordinary label.
6324 Parse the label, and then use tail recursion to parse
6326 cp_parser_label_for_labeled_statement (parser);
6330 /* Anything that starts with a `{' must be a compound-statement. */
6331 else if (token->type == CPP_OPEN_BRACE)
6332 statement = cp_parser_compound_statement (parser, NULL, false);
6333 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6334 a statement all its own. */
6335 else if (token->type == CPP_PRAGMA)
6337 /* Only certain OpenMP pragmas are attached to statements, and thus
6338 are considered statements themselves. All others are not. In
6339 the context of a compound, accept the pragma as a "statement" and
6340 return so that we can check for a close brace. Otherwise we
6341 require a real statement and must go back and read one. */
6343 cp_parser_pragma (parser, pragma_compound);
6344 else if (!cp_parser_pragma (parser, pragma_stmt))
6348 else if (token->type == CPP_EOF)
6350 cp_parser_error (parser, "expected statement");
6354 /* Everything else must be a declaration-statement or an
6355 expression-statement. Try for the declaration-statement
6356 first, unless we are looking at a `;', in which case we know that
6357 we have an expression-statement. */
6360 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6362 cp_parser_parse_tentatively (parser);
6363 /* Try to parse the declaration-statement. */
6364 cp_parser_declaration_statement (parser);
6365 /* If that worked, we're done. */
6366 if (cp_parser_parse_definitely (parser))
6369 /* Look for an expression-statement instead. */
6370 statement = cp_parser_expression_statement (parser, in_statement_expr);
6373 /* Set the line number for the statement. */
6374 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
6375 SET_EXPR_LOCATION (statement, statement_location);
6378 /* Parse the label for a labeled-statement, i.e.
6381 case constant-expression :
6385 case constant-expression ... constant-expression : statement
6387 When a label is parsed without errors, the label is added to the
6388 parse tree by the finish_* functions, so this function doesn't
6389 have to return the label. */
6392 cp_parser_label_for_labeled_statement (cp_parser* parser)
6396 /* The next token should be an identifier. */
6397 token = cp_lexer_peek_token (parser->lexer);
6398 if (token->type != CPP_NAME
6399 && token->type != CPP_KEYWORD)
6401 cp_parser_error (parser, "expected labeled-statement");
6405 switch (token->keyword)
6412 /* Consume the `case' token. */
6413 cp_lexer_consume_token (parser->lexer);
6414 /* Parse the constant-expression. */
6415 expr = cp_parser_constant_expression (parser,
6416 /*allow_non_constant_p=*/false,
6419 ellipsis = cp_lexer_peek_token (parser->lexer);
6420 if (ellipsis->type == CPP_ELLIPSIS)
6422 /* Consume the `...' token. */
6423 cp_lexer_consume_token (parser->lexer);
6425 cp_parser_constant_expression (parser,
6426 /*allow_non_constant_p=*/false,
6428 /* We don't need to emit warnings here, as the common code
6429 will do this for us. */
6432 expr_hi = NULL_TREE;
6434 if (parser->in_switch_statement_p)
6435 finish_case_label (expr, expr_hi);
6437 error ("case label %qE not within a switch statement", expr);
6442 /* Consume the `default' token. */
6443 cp_lexer_consume_token (parser->lexer);
6445 if (parser->in_switch_statement_p)
6446 finish_case_label (NULL_TREE, NULL_TREE);
6448 error ("case label not within a switch statement");
6452 /* Anything else must be an ordinary label. */
6453 finish_label_stmt (cp_parser_identifier (parser));
6457 /* Require the `:' token. */
6458 cp_parser_require (parser, CPP_COLON, "`:'");
6461 /* Parse an expression-statement.
6463 expression-statement:
6466 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6467 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6468 indicates whether this expression-statement is part of an
6469 expression statement. */
6472 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6474 tree statement = NULL_TREE;
6476 /* If the next token is a ';', then there is no expression
6478 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6479 statement = cp_parser_expression (parser, /*cast_p=*/false);
6481 /* Consume the final `;'. */
6482 cp_parser_consume_semicolon_at_end_of_statement (parser);
6484 if (in_statement_expr
6485 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
6486 /* This is the final expression statement of a statement
6488 statement = finish_stmt_expr_expr (statement, in_statement_expr);
6490 statement = finish_expr_stmt (statement);
6497 /* Parse a compound-statement.
6500 { statement-seq [opt] }
6502 Returns a tree representing the statement. */
6505 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
6510 /* Consume the `{'. */
6511 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
6512 return error_mark_node;
6513 /* Begin the compound-statement. */
6514 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
6515 /* Parse an (optional) statement-seq. */
6516 cp_parser_statement_seq_opt (parser, in_statement_expr);
6517 /* Finish the compound-statement. */
6518 finish_compound_stmt (compound_stmt);
6519 /* Consume the `}'. */
6520 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6522 return compound_stmt;
6525 /* Parse an (optional) statement-seq.
6529 statement-seq [opt] statement */
6532 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
6534 /* Scan statements until there aren't any more. */
6537 cp_token *token = cp_lexer_peek_token (parser->lexer);
6539 /* If we're looking at a `}', then we've run out of statements. */
6540 if (token->type == CPP_CLOSE_BRACE
6541 || token->type == CPP_EOF
6542 || token->type == CPP_PRAGMA_EOL)
6545 /* Parse the statement. */
6546 cp_parser_statement (parser, in_statement_expr, true, NULL);
6550 /* Parse a selection-statement.
6552 selection-statement:
6553 if ( condition ) statement
6554 if ( condition ) statement else statement
6555 switch ( condition ) statement
6557 Returns the new IF_STMT or SWITCH_STMT.
6559 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6560 is a (possibly labeled) if statement which is not enclosed in
6561 braces and has an else clause. This is used to implement
6565 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
6573 /* Peek at the next token. */
6574 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
6576 /* See what kind of keyword it is. */
6577 keyword = token->keyword;
6586 /* Look for the `('. */
6587 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
6589 cp_parser_skip_to_end_of_statement (parser);
6590 return error_mark_node;
6593 /* Begin the selection-statement. */
6594 if (keyword == RID_IF)
6595 statement = begin_if_stmt ();
6597 statement = begin_switch_stmt ();
6599 /* Parse the condition. */
6600 condition = cp_parser_condition (parser);
6601 /* Look for the `)'. */
6602 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
6603 cp_parser_skip_to_closing_parenthesis (parser, true, false,
6604 /*consume_paren=*/true);
6606 if (keyword == RID_IF)
6610 /* Add the condition. */
6611 finish_if_stmt_cond (condition, statement);
6613 /* Parse the then-clause. */
6614 cp_parser_implicitly_scoped_statement (parser, &nested_if);
6615 finish_then_clause (statement);
6617 /* If the next token is `else', parse the else-clause. */
6618 if (cp_lexer_next_token_is_keyword (parser->lexer,
6621 /* Consume the `else' keyword. */
6622 cp_lexer_consume_token (parser->lexer);
6623 begin_else_clause (statement);
6624 /* Parse the else-clause. */
6625 cp_parser_implicitly_scoped_statement (parser, NULL);
6626 finish_else_clause (statement);
6628 /* If we are currently parsing a then-clause, then
6629 IF_P will not be NULL. We set it to true to
6630 indicate that this if statement has an else clause.
6631 This may trigger the Wparentheses warning below
6632 when we get back up to the parent if statement. */
6638 /* This if statement does not have an else clause. If
6639 NESTED_IF is true, then the then-clause is an if
6640 statement which does have an else clause. We warn
6641 about the potential ambiguity. */
6643 warning (OPT_Wparentheses,
6644 ("%Hsuggest explicit braces "
6645 "to avoid ambiguous %<else%>"),
6646 EXPR_LOCUS (statement));
6649 /* Now we're all done with the if-statement. */
6650 finish_if_stmt (statement);
6654 bool in_switch_statement_p;
6655 unsigned char in_statement;
6657 /* Add the condition. */
6658 finish_switch_cond (condition, statement);
6660 /* Parse the body of the switch-statement. */
6661 in_switch_statement_p = parser->in_switch_statement_p;
6662 in_statement = parser->in_statement;
6663 parser->in_switch_statement_p = true;
6664 parser->in_statement |= IN_SWITCH_STMT;
6665 cp_parser_implicitly_scoped_statement (parser, NULL);
6666 parser->in_switch_statement_p = in_switch_statement_p;
6667 parser->in_statement = in_statement;
6669 /* Now we're all done with the switch-statement. */
6670 finish_switch_stmt (statement);
6678 cp_parser_error (parser, "expected selection-statement");
6679 return error_mark_node;
6683 /* Parse a condition.
6687 type-specifier-seq declarator = assignment-expression
6692 type-specifier-seq declarator asm-specification [opt]
6693 attributes [opt] = assignment-expression
6695 Returns the expression that should be tested. */
6698 cp_parser_condition (cp_parser* parser)
6700 cp_decl_specifier_seq type_specifiers;
6701 const char *saved_message;
6703 /* Try the declaration first. */
6704 cp_parser_parse_tentatively (parser);
6705 /* New types are not allowed in the type-specifier-seq for a
6707 saved_message = parser->type_definition_forbidden_message;
6708 parser->type_definition_forbidden_message
6709 = "types may not be defined in conditions";
6710 /* Parse the type-specifier-seq. */
6711 cp_parser_type_specifier_seq (parser, /*is_condition==*/true,
6713 /* Restore the saved message. */
6714 parser->type_definition_forbidden_message = saved_message;
6715 /* If all is well, we might be looking at a declaration. */
6716 if (!cp_parser_error_occurred (parser))
6719 tree asm_specification;
6721 cp_declarator *declarator;
6722 tree initializer = NULL_TREE;
6724 /* Parse the declarator. */
6725 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6726 /*ctor_dtor_or_conv_p=*/NULL,
6727 /*parenthesized_p=*/NULL,
6728 /*member_p=*/false);
6729 /* Parse the attributes. */
6730 attributes = cp_parser_attributes_opt (parser);
6731 /* Parse the asm-specification. */
6732 asm_specification = cp_parser_asm_specification_opt (parser);
6733 /* If the next token is not an `=', then we might still be
6734 looking at an expression. For example:
6738 looks like a decl-specifier-seq and a declarator -- but then
6739 there is no `=', so this is an expression. */
6740 cp_parser_require (parser, CPP_EQ, "`='");
6741 /* If we did see an `=', then we are looking at a declaration
6743 if (cp_parser_parse_definitely (parser))
6746 bool non_constant_p;
6748 /* Create the declaration. */
6749 decl = start_decl (declarator, &type_specifiers,
6750 /*initialized_p=*/true,
6751 attributes, /*prefix_attributes=*/NULL_TREE,
6753 /* Parse the assignment-expression. */
6755 = cp_parser_constant_expression (parser,
6756 /*allow_non_constant_p=*/true,
6758 if (!non_constant_p)
6759 initializer = fold_non_dependent_expr (initializer);
6761 /* Process the initializer. */
6762 cp_finish_decl (decl,
6763 initializer, !non_constant_p,
6765 LOOKUP_ONLYCONVERTING);
6768 pop_scope (pushed_scope);
6770 return convert_from_reference (decl);
6773 /* If we didn't even get past the declarator successfully, we are
6774 definitely not looking at a declaration. */
6776 cp_parser_abort_tentative_parse (parser);
6778 /* Otherwise, we are looking at an expression. */
6779 return cp_parser_expression (parser, /*cast_p=*/false);
6782 /* Parse an iteration-statement.
6784 iteration-statement:
6785 while ( condition ) statement
6786 do statement while ( expression ) ;
6787 for ( for-init-statement condition [opt] ; expression [opt] )
6790 APPLE LOCAL begin for-fsf-4_4 3274130 5295549
6793 while attributes [opt] ( condition ) statement
6794 do attributes [opt] statement while ( expression ) ;
6795 for attributes [opt]
6796 ( for-init-statement condition [opt] ; expression [opt] )
6799 APPLE LOCAL end for-fsf-4_4 3274130 5295549
6800 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6803 cp_parser_iteration_statement (cp_parser* parser)
6807 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
6808 tree statement, attributes;
6809 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
6810 unsigned char in_statement;
6812 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
6813 /* Get the keyword at the start of the loop. */
6814 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
6815 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6817 return error_mark_node;
6819 /* Remember whether or not we are already within an iteration
6821 in_statement = parser->in_statement;
6823 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
6824 /* Parse the attributes, if any. */
6825 attributes = cp_parser_attributes_opt (parser);
6827 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
6828 /* See what kind of keyword it is. */
6829 keyword = token->keyword;
6836 /* Begin the while-statement. */
6837 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
6838 statement = begin_while_stmt (attributes);
6839 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
6840 /* Look for the `('. */
6841 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6842 /* Parse the condition. */
6843 condition = cp_parser_condition (parser);
6844 finish_while_stmt_cond (condition, statement);
6845 /* Look for the `)'. */
6846 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6847 /* Parse the dependent statement. */
6848 parser->in_statement = IN_ITERATION_STMT;
6849 cp_parser_already_scoped_statement (parser);
6850 parser->in_statement = in_statement;
6851 /* We're done with the while-statement. */
6852 finish_while_stmt (statement);
6860 /* Begin the do-statement. */
6861 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
6862 statement = begin_do_stmt (attributes);
6863 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
6864 /* Parse the body of the do-statement. */
6865 parser->in_statement = IN_ITERATION_STMT;
6866 cp_parser_implicitly_scoped_statement (parser, NULL);
6867 parser->in_statement = in_statement;
6868 finish_do_body (statement);
6869 /* Look for the `while' keyword. */
6870 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6871 /* Look for the `('. */
6872 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6873 /* Parse the expression. */
6874 expression = cp_parser_expression (parser, /*cast_p=*/false);
6875 /* We're done with the do-statement. */
6876 finish_do_stmt (expression, statement);
6877 /* Look for the `)'. */
6878 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6879 /* Look for the `;'. */
6880 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6886 tree condition = NULL_TREE;
6887 tree expression = NULL_TREE;
6889 /* Begin the for-statement. */
6890 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
6891 statement = begin_for_stmt (attributes);
6892 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
6893 /* Look for the `('. */
6894 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6895 /* Parse the initialization. */
6896 cp_parser_for_init_statement (parser);
6897 finish_for_init_stmt (statement);
6899 /* If there's a condition, process it. */
6900 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6901 condition = cp_parser_condition (parser);
6902 finish_for_cond (condition, statement);
6903 /* Look for the `;'. */
6904 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6906 /* If there's an expression, process it. */
6907 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6908 expression = cp_parser_expression (parser, /*cast_p=*/false);
6909 finish_for_expr (expression, statement);
6910 /* Look for the `)'. */
6911 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6913 /* Parse the body of the for-statement. */
6914 parser->in_statement = IN_ITERATION_STMT;
6915 cp_parser_already_scoped_statement (parser);
6916 parser->in_statement = in_statement;
6918 /* We're done with the for-statement. */
6919 finish_for_stmt (statement);
6924 cp_parser_error (parser, "expected iteration-statement");
6925 statement = error_mark_node;
6932 /* Parse a for-init-statement.
6935 expression-statement
6936 simple-declaration */
6939 cp_parser_for_init_statement (cp_parser* parser)
6941 /* If the next token is a `;', then we have an empty
6942 expression-statement. Grammatically, this is also a
6943 simple-declaration, but an invalid one, because it does not
6944 declare anything. Therefore, if we did not handle this case
6945 specially, we would issue an error message about an invalid
6947 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6949 /* We're going to speculatively look for a declaration, falling back
6950 to an expression, if necessary. */
6951 cp_parser_parse_tentatively (parser);
6952 /* Parse the declaration. */
6953 cp_parser_simple_declaration (parser,
6954 /*function_definition_allowed_p=*/false);
6955 /* If the tentative parse failed, then we shall need to look for an
6956 expression-statement. */
6957 if (cp_parser_parse_definitely (parser))
6961 cp_parser_expression_statement (parser, false);
6964 /* Parse a jump-statement.
6969 return expression [opt] ;
6977 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6980 cp_parser_jump_statement (cp_parser* parser)
6982 tree statement = error_mark_node;
6986 /* Peek at the next token. */
6987 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6989 return error_mark_node;
6991 /* See what kind of keyword it is. */
6992 keyword = token->keyword;
6996 switch (parser->in_statement)
6999 error ("break statement not within loop or switch");
7002 gcc_assert ((parser->in_statement & IN_SWITCH_STMT)
7003 || parser->in_statement == IN_ITERATION_STMT);
7004 statement = finish_break_stmt ();
7007 error ("invalid exit from OpenMP structured block");
7010 error ("break statement used with OpenMP for loop");
7013 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7017 switch (parser->in_statement & ~IN_SWITCH_STMT)
7020 error ("continue statement not within a loop");
7022 case IN_ITERATION_STMT:
7024 statement = finish_continue_stmt ();
7027 error ("invalid exit from OpenMP structured block");
7032 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7039 /* If the next token is a `;', then there is no
7041 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7042 expr = cp_parser_expression (parser, /*cast_p=*/false);
7045 /* Build the return-statement. */
7046 statement = finish_return_stmt (expr);
7047 /* Look for the final `;'. */
7048 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7053 /* Create the goto-statement. */
7054 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
7056 /* Issue a warning about this use of a GNU extension. */
7058 pedwarn ("ISO C++ forbids computed gotos");
7059 /* Consume the '*' token. */
7060 cp_lexer_consume_token (parser->lexer);
7061 /* Parse the dependent expression. */
7062 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false));
7065 finish_goto_stmt (cp_parser_identifier (parser));
7066 /* Look for the final `;'. */
7067 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7071 cp_parser_error (parser, "expected jump-statement");
7078 /* Parse a declaration-statement.
7080 declaration-statement:
7081 block-declaration */
7084 cp_parser_declaration_statement (cp_parser* parser)
7088 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7089 p = obstack_alloc (&declarator_obstack, 0);
7091 /* Parse the block-declaration. */
7092 cp_parser_block_declaration (parser, /*statement_p=*/true);
7094 /* Free any declarators allocated. */
7095 obstack_free (&declarator_obstack, p);
7097 /* Finish off the statement. */
7101 /* Some dependent statements (like `if (cond) statement'), are
7102 implicitly in their own scope. In other words, if the statement is
7103 a single statement (as opposed to a compound-statement), it is
7104 none-the-less treated as if it were enclosed in braces. Any
7105 declarations appearing in the dependent statement are out of scope
7106 after control passes that point. This function parses a statement,
7107 but ensures that is in its own scope, even if it is not a
7110 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7111 is a (possibly labeled) if statement which is not enclosed in
7112 braces and has an else clause. This is used to implement
7115 Returns the new statement. */
7118 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
7125 /* Mark if () ; with a special NOP_EXPR. */
7126 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7128 cp_lexer_consume_token (parser->lexer);
7129 statement = add_stmt (build_empty_stmt ());
7131 /* if a compound is opened, we simply parse the statement directly. */
7132 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7133 statement = cp_parser_compound_statement (parser, NULL, false);
7134 /* If the token is not a `{', then we must take special action. */
7137 /* Create a compound-statement. */
7138 statement = begin_compound_stmt (0);
7139 /* Parse the dependent-statement. */
7140 cp_parser_statement (parser, NULL_TREE, false, if_p);
7141 /* Finish the dummy compound-statement. */
7142 finish_compound_stmt (statement);
7145 /* Return the statement. */
7149 /* For some dependent statements (like `while (cond) statement'), we
7150 have already created a scope. Therefore, even if the dependent
7151 statement is a compound-statement, we do not want to create another
7155 cp_parser_already_scoped_statement (cp_parser* parser)
7157 /* If the token is a `{', then we must take special action. */
7158 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
7159 cp_parser_statement (parser, NULL_TREE, false, NULL);
7162 /* Avoid calling cp_parser_compound_statement, so that we
7163 don't create a new scope. Do everything else by hand. */
7164 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
7165 cp_parser_statement_seq_opt (parser, NULL_TREE);
7166 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7170 /* Declarations [gram.dcl.dcl] */
7172 /* Parse an optional declaration-sequence.
7176 declaration-seq declaration */
7179 cp_parser_declaration_seq_opt (cp_parser* parser)
7185 token = cp_lexer_peek_token (parser->lexer);
7187 if (token->type == CPP_CLOSE_BRACE
7188 || token->type == CPP_EOF
7189 || token->type == CPP_PRAGMA_EOL)
7192 if (token->type == CPP_SEMICOLON)
7194 /* A declaration consisting of a single semicolon is
7195 invalid. Allow it unless we're being pedantic. */
7196 cp_lexer_consume_token (parser->lexer);
7197 if (pedantic && !in_system_header)
7198 pedwarn ("extra %<;%>");
7202 /* If we're entering or exiting a region that's implicitly
7203 extern "C", modify the lang context appropriately. */
7204 if (!parser->implicit_extern_c && token->implicit_extern_c)
7206 push_lang_context (lang_name_c);
7207 parser->implicit_extern_c = true;
7209 else if (parser->implicit_extern_c && !token->implicit_extern_c)
7211 pop_lang_context ();
7212 parser->implicit_extern_c = false;
7215 if (token->type == CPP_PRAGMA)
7217 /* A top-level declaration can consist solely of a #pragma.
7218 A nested declaration cannot, so this is done here and not
7219 in cp_parser_declaration. (A #pragma at block scope is
7220 handled in cp_parser_statement.) */
7221 cp_parser_pragma (parser, pragma_external);
7225 /* Parse the declaration itself. */
7226 cp_parser_declaration (parser);
7230 /* Parse a declaration.
7235 template-declaration
7236 explicit-instantiation
7237 explicit-specialization
7238 linkage-specification
7239 namespace-definition
7244 __extension__ declaration */
7247 cp_parser_declaration (cp_parser* parser)
7254 /* Check for the `__extension__' keyword. */
7255 if (cp_parser_extension_opt (parser, &saved_pedantic))
7257 /* Parse the qualified declaration. */
7258 cp_parser_declaration (parser);
7259 /* Restore the PEDANTIC flag. */
7260 pedantic = saved_pedantic;
7265 /* Try to figure out what kind of declaration is present. */
7266 token1 = *cp_lexer_peek_token (parser->lexer);
7268 if (token1.type != CPP_EOF)
7269 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
7272 token2.type = CPP_EOF;
7273 token2.keyword = RID_MAX;
7276 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7277 p = obstack_alloc (&declarator_obstack, 0);
7279 /* If the next token is `extern' and the following token is a string
7280 literal, then we have a linkage specification. */
7281 if (token1.keyword == RID_EXTERN
7282 && cp_parser_is_string_literal (&token2))
7283 cp_parser_linkage_specification (parser);
7284 /* If the next token is `template', then we have either a template
7285 declaration, an explicit instantiation, or an explicit
7287 else if (token1.keyword == RID_TEMPLATE)
7289 /* `template <>' indicates a template specialization. */
7290 if (token2.type == CPP_LESS
7291 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
7292 cp_parser_explicit_specialization (parser);
7293 /* `template <' indicates a template declaration. */
7294 else if (token2.type == CPP_LESS)
7295 cp_parser_template_declaration (parser, /*member_p=*/false);
7296 /* Anything else must be an explicit instantiation. */
7298 cp_parser_explicit_instantiation (parser);
7300 /* If the next token is `export', then we have a template
7302 else if (token1.keyword == RID_EXPORT)
7303 cp_parser_template_declaration (parser, /*member_p=*/false);
7304 /* If the next token is `extern', 'static' or 'inline' and the one
7305 after that is `template', we have a GNU extended explicit
7306 instantiation directive. */
7307 else if (cp_parser_allow_gnu_extensions_p (parser)
7308 && (token1.keyword == RID_EXTERN
7309 || token1.keyword == RID_STATIC
7310 || token1.keyword == RID_INLINE)
7311 && token2.keyword == RID_TEMPLATE)
7312 cp_parser_explicit_instantiation (parser);
7313 /* If the next token is `namespace', check for a named or unnamed
7314 namespace definition. */
7315 else if (token1.keyword == RID_NAMESPACE
7316 && (/* A named namespace definition. */
7317 (token2.type == CPP_NAME
7318 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
7320 /* An unnamed namespace definition. */
7321 || token2.type == CPP_OPEN_BRACE
7322 || token2.keyword == RID_ATTRIBUTE))
7323 cp_parser_namespace_definition (parser);
7324 /* Objective-C++ declaration/definition. */
7325 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
7326 cp_parser_objc_declaration (parser);
7327 /* We must have either a block declaration or a function
7330 /* Try to parse a block-declaration, or a function-definition. */
7331 cp_parser_block_declaration (parser, /*statement_p=*/false);
7333 /* Free any declarators allocated. */
7334 obstack_free (&declarator_obstack, p);
7337 /* Parse a block-declaration.
7342 namespace-alias-definition
7349 __extension__ block-declaration
7352 If STATEMENT_P is TRUE, then this block-declaration is occurring as
7353 part of a declaration-statement. */
7356 cp_parser_block_declaration (cp_parser *parser,
7362 /* Check for the `__extension__' keyword. */
7363 if (cp_parser_extension_opt (parser, &saved_pedantic))
7365 /* Parse the qualified declaration. */
7366 cp_parser_block_declaration (parser, statement_p);
7367 /* Restore the PEDANTIC flag. */
7368 pedantic = saved_pedantic;
7373 /* Peek at the next token to figure out which kind of declaration is
7375 token1 = cp_lexer_peek_token (parser->lexer);
7377 /* If the next keyword is `asm', we have an asm-definition. */
7378 if (token1->keyword == RID_ASM)
7381 cp_parser_commit_to_tentative_parse (parser);
7382 cp_parser_asm_definition (parser);
7384 /* If the next keyword is `namespace', we have a
7385 namespace-alias-definition. */
7386 else if (token1->keyword == RID_NAMESPACE)
7387 cp_parser_namespace_alias_definition (parser);
7388 /* If the next keyword is `using', we have either a
7389 using-declaration or a using-directive. */
7390 else if (token1->keyword == RID_USING)
7395 cp_parser_commit_to_tentative_parse (parser);
7396 /* If the token after `using' is `namespace', then we have a
7398 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
7399 if (token2->keyword == RID_NAMESPACE)
7400 cp_parser_using_directive (parser);
7401 /* Otherwise, it's a using-declaration. */
7403 cp_parser_using_declaration (parser,
7404 /*access_declaration_p=*/false);
7406 /* If the next keyword is `__label__' we have a label declaration. */
7407 else if (token1->keyword == RID_LABEL)
7410 cp_parser_commit_to_tentative_parse (parser);
7411 cp_parser_label_declaration (parser);
7413 /* Anything else must be a simple-declaration. */
7415 cp_parser_simple_declaration (parser, !statement_p);
7418 /* Parse a simple-declaration.
7421 decl-specifier-seq [opt] init-declarator-list [opt] ;
7423 init-declarator-list:
7425 init-declarator-list , init-declarator
7427 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
7428 function-definition as a simple-declaration. */
7431 cp_parser_simple_declaration (cp_parser* parser,
7432 bool function_definition_allowed_p)
7434 cp_decl_specifier_seq decl_specifiers;
7435 int declares_class_or_enum;
7436 bool saw_declarator;
7438 /* Defer access checks until we know what is being declared; the
7439 checks for names appearing in the decl-specifier-seq should be
7440 done as if we were in the scope of the thing being declared. */
7441 push_deferring_access_checks (dk_deferred);
7443 /* Parse the decl-specifier-seq. We have to keep track of whether
7444 or not the decl-specifier-seq declares a named class or
7445 enumeration type, since that is the only case in which the
7446 init-declarator-list is allowed to be empty.
7450 In a simple-declaration, the optional init-declarator-list can be
7451 omitted only when declaring a class or enumeration, that is when
7452 the decl-specifier-seq contains either a class-specifier, an
7453 elaborated-type-specifier, or an enum-specifier. */
7454 cp_parser_decl_specifier_seq (parser,
7455 CP_PARSER_FLAGS_OPTIONAL,
7457 &declares_class_or_enum);
7458 /* We no longer need to defer access checks. */
7459 stop_deferring_access_checks ();
7461 /* In a block scope, a valid declaration must always have a
7462 decl-specifier-seq. By not trying to parse declarators, we can
7463 resolve the declaration/expression ambiguity more quickly. */
7464 if (!function_definition_allowed_p
7465 && !decl_specifiers.any_specifiers_p)
7467 cp_parser_error (parser, "expected declaration");
7471 /* If the next two tokens are both identifiers, the code is
7472 erroneous. The usual cause of this situation is code like:
7476 where "T" should name a type -- but does not. */
7477 if (!decl_specifiers.type
7478 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
7480 /* If parsing tentatively, we should commit; we really are
7481 looking at a declaration. */
7482 cp_parser_commit_to_tentative_parse (parser);
7487 /* If we have seen at least one decl-specifier, and the next token
7488 is not a parenthesis, then we must be looking at a declaration.
7489 (After "int (" we might be looking at a functional cast.) */
7490 if (decl_specifiers.any_specifiers_p
7491 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
7492 cp_parser_commit_to_tentative_parse (parser);
7494 /* Keep going until we hit the `;' at the end of the simple
7496 saw_declarator = false;
7497 while (cp_lexer_next_token_is_not (parser->lexer,
7501 bool function_definition_p;
7506 /* If we are processing next declarator, coma is expected */
7507 token = cp_lexer_peek_token (parser->lexer);
7508 gcc_assert (token->type == CPP_COMMA);
7509 cp_lexer_consume_token (parser->lexer);
7512 saw_declarator = true;
7514 /* Parse the init-declarator. */
7515 decl = cp_parser_init_declarator (parser, &decl_specifiers,
7517 function_definition_allowed_p,
7519 declares_class_or_enum,
7520 &function_definition_p);
7521 /* If an error occurred while parsing tentatively, exit quickly.
7522 (That usually happens when in the body of a function; each
7523 statement is treated as a declaration-statement until proven
7525 if (cp_parser_error_occurred (parser))
7527 /* Handle function definitions specially. */
7528 if (function_definition_p)
7530 /* If the next token is a `,', then we are probably
7531 processing something like:
7535 which is erroneous. */
7536 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
7537 error ("mixing declarations and function-definitions is forbidden");
7538 /* Otherwise, we're done with the list of declarators. */
7541 pop_deferring_access_checks ();
7545 /* The next token should be either a `,' or a `;'. */
7546 token = cp_lexer_peek_token (parser->lexer);
7547 /* If it's a `,', there are more declarators to come. */
7548 if (token->type == CPP_COMMA)
7549 /* will be consumed next time around */;
7550 /* If it's a `;', we are done. */
7551 else if (token->type == CPP_SEMICOLON)
7553 /* Anything else is an error. */
7556 /* If we have already issued an error message we don't need
7557 to issue another one. */
7558 if (decl != error_mark_node
7559 || cp_parser_uncommitted_to_tentative_parse_p (parser))
7560 cp_parser_error (parser, "expected %<,%> or %<;%>");
7561 /* Skip tokens until we reach the end of the statement. */
7562 cp_parser_skip_to_end_of_statement (parser);
7563 /* If the next token is now a `;', consume it. */
7564 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7565 cp_lexer_consume_token (parser->lexer);
7568 /* After the first time around, a function-definition is not
7569 allowed -- even if it was OK at first. For example:
7574 function_definition_allowed_p = false;
7577 /* Issue an error message if no declarators are present, and the
7578 decl-specifier-seq does not itself declare a class or
7580 if (!saw_declarator)
7582 if (cp_parser_declares_only_class_p (parser))
7583 shadow_tag (&decl_specifiers);
7584 /* Perform any deferred access checks. */
7585 perform_deferred_access_checks ();
7588 /* Consume the `;'. */
7589 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
7592 pop_deferring_access_checks ();
7595 /* Parse a decl-specifier-seq.
7598 decl-specifier-seq [opt] decl-specifier
7601 storage-class-specifier
7612 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7614 The parser flags FLAGS is used to control type-specifier parsing.
7616 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7619 1: one of the decl-specifiers is an elaborated-type-specifier
7620 (i.e., a type declaration)
7621 2: one of the decl-specifiers is an enum-specifier or a
7622 class-specifier (i.e., a type definition)
7627 cp_parser_decl_specifier_seq (cp_parser* parser,
7628 cp_parser_flags flags,
7629 cp_decl_specifier_seq *decl_specs,
7630 int* declares_class_or_enum)
7632 bool constructor_possible_p = !parser->in_declarator_p;
7634 /* Clear DECL_SPECS. */
7635 clear_decl_specs (decl_specs);
7637 /* Assume no class or enumeration type is declared. */
7638 *declares_class_or_enum = 0;
7640 /* Keep reading specifiers until there are no more to read. */
7644 bool found_decl_spec;
7647 /* Peek at the next token. */
7648 token = cp_lexer_peek_token (parser->lexer);
7649 /* Handle attributes. */
7650 if (token->keyword == RID_ATTRIBUTE)
7652 /* Parse the attributes. */
7653 decl_specs->attributes
7654 = chainon (decl_specs->attributes,
7655 cp_parser_attributes_opt (parser));
7658 /* Assume we will find a decl-specifier keyword. */
7659 found_decl_spec = true;
7660 /* If the next token is an appropriate keyword, we can simply
7661 add it to the list. */
7662 switch (token->keyword)
7667 if (!at_class_scope_p ())
7669 error ("%<friend%> used outside of class");
7670 cp_lexer_purge_token (parser->lexer);
7674 ++decl_specs->specs[(int) ds_friend];
7675 /* Consume the token. */
7676 cp_lexer_consume_token (parser->lexer);
7680 /* function-specifier:
7687 cp_parser_function_specifier_opt (parser, decl_specs);
7693 ++decl_specs->specs[(int) ds_typedef];
7694 /* Consume the token. */
7695 cp_lexer_consume_token (parser->lexer);
7696 /* A constructor declarator cannot appear in a typedef. */
7697 constructor_possible_p = false;
7698 /* The "typedef" keyword can only occur in a declaration; we
7699 may as well commit at this point. */
7700 cp_parser_commit_to_tentative_parse (parser);
7702 if (decl_specs->storage_class != sc_none)
7703 decl_specs->conflicting_specifiers_p = true;
7706 /* storage-class-specifier:
7720 /* Consume the token. */
7721 cp_lexer_consume_token (parser->lexer);
7722 cp_parser_set_storage_class (parser, decl_specs, token->keyword);
7725 /* Consume the token. */
7726 cp_lexer_consume_token (parser->lexer);
7727 ++decl_specs->specs[(int) ds_thread];
7731 /* We did not yet find a decl-specifier yet. */
7732 found_decl_spec = false;
7736 /* Constructors are a special case. The `S' in `S()' is not a
7737 decl-specifier; it is the beginning of the declarator. */
7740 && constructor_possible_p
7741 && (cp_parser_constructor_declarator_p
7742 (parser, decl_specs->specs[(int) ds_friend] != 0)));
7744 /* If we don't have a DECL_SPEC yet, then we must be looking at
7745 a type-specifier. */
7746 if (!found_decl_spec && !constructor_p)
7748 int decl_spec_declares_class_or_enum;
7749 bool is_cv_qualifier;
7753 = cp_parser_type_specifier (parser, flags,
7755 /*is_declaration=*/true,
7756 &decl_spec_declares_class_or_enum,
7759 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
7761 /* If this type-specifier referenced a user-defined type
7762 (a typedef, class-name, etc.), then we can't allow any
7763 more such type-specifiers henceforth.
7767 The longest sequence of decl-specifiers that could
7768 possibly be a type name is taken as the
7769 decl-specifier-seq of a declaration. The sequence shall
7770 be self-consistent as described below.
7774 As a general rule, at most one type-specifier is allowed
7775 in the complete decl-specifier-seq of a declaration. The
7776 only exceptions are the following:
7778 -- const or volatile can be combined with any other
7781 -- signed or unsigned can be combined with char, long,
7789 void g (const int Pc);
7791 Here, Pc is *not* part of the decl-specifier seq; it's
7792 the declarator. Therefore, once we see a type-specifier
7793 (other than a cv-qualifier), we forbid any additional
7794 user-defined types. We *do* still allow things like `int
7795 int' to be considered a decl-specifier-seq, and issue the
7796 error message later. */
7797 if (type_spec && !is_cv_qualifier)
7798 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
7799 /* A constructor declarator cannot follow a type-specifier. */
7802 constructor_possible_p = false;
7803 found_decl_spec = true;
7807 /* If we still do not have a DECL_SPEC, then there are no more
7809 if (!found_decl_spec)
7812 decl_specs->any_specifiers_p = true;
7813 /* After we see one decl-specifier, further decl-specifiers are
7815 flags |= CP_PARSER_FLAGS_OPTIONAL;
7818 cp_parser_check_decl_spec (decl_specs);
7820 /* Don't allow a friend specifier with a class definition. */
7821 if (decl_specs->specs[(int) ds_friend] != 0
7822 && (*declares_class_or_enum & 2))
7823 error ("class definition may not be declared a friend");
7826 /* Parse an (optional) storage-class-specifier.
7828 storage-class-specifier:
7837 storage-class-specifier:
7840 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7843 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7845 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7853 /* Consume the token. */
7854 return cp_lexer_consume_token (parser->lexer)->u.value;
7861 /* Parse an (optional) function-specifier.
7868 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7869 Updates DECL_SPECS, if it is non-NULL. */
7872 cp_parser_function_specifier_opt (cp_parser* parser,
7873 cp_decl_specifier_seq *decl_specs)
7875 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7879 ++decl_specs->specs[(int) ds_inline];
7883 /* 14.5.2.3 [temp.mem]
7885 A member function template shall not be virtual. */
7886 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
7887 error ("templates may not be %<virtual%>");
7888 else if (decl_specs)
7889 ++decl_specs->specs[(int) ds_virtual];
7894 ++decl_specs->specs[(int) ds_explicit];
7901 /* Consume the token. */
7902 return cp_lexer_consume_token (parser->lexer)->u.value;
7905 /* Parse a linkage-specification.
7907 linkage-specification:
7908 extern string-literal { declaration-seq [opt] }
7909 extern string-literal declaration */
7912 cp_parser_linkage_specification (cp_parser* parser)
7916 /* Look for the `extern' keyword. */
7917 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7919 /* Look for the string-literal. */
7920 linkage = cp_parser_string_literal (parser, false, false);
7922 /* Transform the literal into an identifier. If the literal is a
7923 wide-character string, or contains embedded NULs, then we can't
7924 handle it as the user wants. */
7925 if (strlen (TREE_STRING_POINTER (linkage))
7926 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
7928 cp_parser_error (parser, "invalid linkage-specification");
7929 /* Assume C++ linkage. */
7930 linkage = lang_name_cplusplus;
7933 linkage = get_identifier (TREE_STRING_POINTER (linkage));
7935 /* We're now using the new linkage. */
7936 push_lang_context (linkage);
7938 /* If the next token is a `{', then we're using the first
7940 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7942 /* Consume the `{' token. */
7943 cp_lexer_consume_token (parser->lexer);
7944 /* Parse the declarations. */
7945 cp_parser_declaration_seq_opt (parser);
7946 /* Look for the closing `}'. */
7947 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7949 /* Otherwise, there's just one declaration. */
7952 bool saved_in_unbraced_linkage_specification_p;
7954 saved_in_unbraced_linkage_specification_p
7955 = parser->in_unbraced_linkage_specification_p;
7956 parser->in_unbraced_linkage_specification_p = true;
7957 cp_parser_declaration (parser);
7958 parser->in_unbraced_linkage_specification_p
7959 = saved_in_unbraced_linkage_specification_p;
7962 /* We're done with the linkage-specification. */
7963 pop_lang_context ();
7966 /* Special member functions [gram.special] */
7968 /* Parse a conversion-function-id.
7970 conversion-function-id:
7971 operator conversion-type-id
7973 Returns an IDENTIFIER_NODE representing the operator. */
7976 cp_parser_conversion_function_id (cp_parser* parser)
7980 tree saved_qualifying_scope;
7981 tree saved_object_scope;
7982 tree pushed_scope = NULL_TREE;
7984 /* Look for the `operator' token. */
7985 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7986 return error_mark_node;
7987 /* When we parse the conversion-type-id, the current scope will be
7988 reset. However, we need that information in able to look up the
7989 conversion function later, so we save it here. */
7990 saved_scope = parser->scope;
7991 saved_qualifying_scope = parser->qualifying_scope;
7992 saved_object_scope = parser->object_scope;
7993 /* We must enter the scope of the class so that the names of
7994 entities declared within the class are available in the
7995 conversion-type-id. For example, consider:
8002 S::operator I() { ... }
8004 In order to see that `I' is a type-name in the definition, we
8005 must be in the scope of `S'. */
8007 pushed_scope = push_scope (saved_scope);
8008 /* Parse the conversion-type-id. */
8009 type = cp_parser_conversion_type_id (parser);
8010 /* Leave the scope of the class, if any. */
8012 pop_scope (pushed_scope);
8013 /* Restore the saved scope. */
8014 parser->scope = saved_scope;
8015 parser->qualifying_scope = saved_qualifying_scope;
8016 parser->object_scope = saved_object_scope;
8017 /* If the TYPE is invalid, indicate failure. */
8018 if (type == error_mark_node)
8019 return error_mark_node;
8020 return mangle_conv_op_name_for_type (type);
8023 /* Parse a conversion-type-id:
8026 type-specifier-seq conversion-declarator [opt]
8028 Returns the TYPE specified. */
8031 cp_parser_conversion_type_id (cp_parser* parser)
8034 cp_decl_specifier_seq type_specifiers;
8035 cp_declarator *declarator;
8036 tree type_specified;
8038 /* Parse the attributes. */
8039 attributes = cp_parser_attributes_opt (parser);
8040 /* Parse the type-specifiers. */
8041 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
8043 /* If that didn't work, stop. */
8044 if (type_specifiers.type == error_mark_node)
8045 return error_mark_node;
8046 /* Parse the conversion-declarator. */
8047 declarator = cp_parser_conversion_declarator_opt (parser);
8049 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
8050 /*initialized=*/0, &attributes);
8052 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
8053 return type_specified;
8056 /* Parse an (optional) conversion-declarator.
8058 conversion-declarator:
8059 ptr-operator conversion-declarator [opt]
8063 static cp_declarator *
8064 cp_parser_conversion_declarator_opt (cp_parser* parser)
8066 enum tree_code code;
8068 cp_cv_quals cv_quals;
8070 /* We don't know if there's a ptr-operator next, or not. */
8071 cp_parser_parse_tentatively (parser);
8072 /* Try the ptr-operator. */
8073 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
8074 /* If it worked, look for more conversion-declarators. */
8075 if (cp_parser_parse_definitely (parser))
8077 cp_declarator *declarator;
8079 /* Parse another optional declarator. */
8080 declarator = cp_parser_conversion_declarator_opt (parser);
8082 /* Create the representation of the declarator. */
8084 declarator = make_ptrmem_declarator (cv_quals, class_type,
8086 else if (code == INDIRECT_REF)
8087 declarator = make_pointer_declarator (cv_quals, declarator);
8089 declarator = make_reference_declarator (cv_quals, declarator);
8097 /* Parse an (optional) ctor-initializer.
8100 : mem-initializer-list
8102 Returns TRUE iff the ctor-initializer was actually present. */
8105 cp_parser_ctor_initializer_opt (cp_parser* parser)
8107 /* If the next token is not a `:', then there is no
8108 ctor-initializer. */
8109 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
8111 /* Do default initialization of any bases and members. */
8112 if (DECL_CONSTRUCTOR_P (current_function_decl))
8113 finish_mem_initializers (NULL_TREE);
8118 /* Consume the `:' token. */
8119 cp_lexer_consume_token (parser->lexer);
8120 /* And the mem-initializer-list. */
8121 cp_parser_mem_initializer_list (parser);
8126 /* Parse a mem-initializer-list.
8128 mem-initializer-list:
8130 mem-initializer , mem-initializer-list */
8133 cp_parser_mem_initializer_list (cp_parser* parser)
8135 tree mem_initializer_list = NULL_TREE;
8137 /* Let the semantic analysis code know that we are starting the
8138 mem-initializer-list. */
8139 if (!DECL_CONSTRUCTOR_P (current_function_decl))
8140 error ("only constructors take base initializers");
8142 /* Loop through the list. */
8145 tree mem_initializer;
8147 /* Parse the mem-initializer. */
8148 mem_initializer = cp_parser_mem_initializer (parser);
8149 /* Add it to the list, unless it was erroneous. */
8150 if (mem_initializer != error_mark_node)
8152 TREE_CHAIN (mem_initializer) = mem_initializer_list;
8153 mem_initializer_list = mem_initializer;
8155 /* If the next token is not a `,', we're done. */
8156 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8158 /* Consume the `,' token. */
8159 cp_lexer_consume_token (parser->lexer);
8162 /* Perform semantic analysis. */
8163 if (DECL_CONSTRUCTOR_P (current_function_decl))
8164 finish_mem_initializers (mem_initializer_list);
8167 /* Parse a mem-initializer.
8170 mem-initializer-id ( expression-list [opt] )
8175 ( expression-list [opt] )
8177 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
8178 class) or FIELD_DECL (for a non-static data member) to initialize;
8179 the TREE_VALUE is the expression-list. An empty initialization
8180 list is represented by void_list_node. */
8183 cp_parser_mem_initializer (cp_parser* parser)
8185 tree mem_initializer_id;
8186 tree expression_list;
8189 /* Find out what is being initialized. */
8190 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
8192 pedwarn ("anachronistic old-style base class initializer");
8193 mem_initializer_id = NULL_TREE;
8196 mem_initializer_id = cp_parser_mem_initializer_id (parser);
8197 member = expand_member_init (mem_initializer_id);
8198 if (member && !DECL_P (member))
8199 in_base_initializer = 1;
8202 = cp_parser_parenthesized_expression_list (parser, false,
8204 /*non_constant_p=*/NULL);
8205 if (expression_list == error_mark_node)
8206 return error_mark_node;
8207 if (!expression_list)
8208 expression_list = void_type_node;
8210 in_base_initializer = 0;
8212 return member ? build_tree_list (member, expression_list) : error_mark_node;
8215 /* Parse a mem-initializer-id.
8218 :: [opt] nested-name-specifier [opt] class-name
8221 Returns a TYPE indicating the class to be initializer for the first
8222 production. Returns an IDENTIFIER_NODE indicating the data member
8223 to be initialized for the second production. */
8226 cp_parser_mem_initializer_id (cp_parser* parser)
8228 bool global_scope_p;
8229 bool nested_name_specifier_p;
8230 bool template_p = false;
8233 /* `typename' is not allowed in this context ([temp.res]). */
8234 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
8236 error ("keyword %<typename%> not allowed in this context (a qualified "
8237 "member initializer is implicitly a type)");
8238 cp_lexer_consume_token (parser->lexer);
8240 /* Look for the optional `::' operator. */
8242 = (cp_parser_global_scope_opt (parser,
8243 /*current_scope_valid_p=*/false)
8245 /* Look for the optional nested-name-specifier. The simplest way to
8250 The keyword `typename' is not permitted in a base-specifier or
8251 mem-initializer; in these contexts a qualified name that
8252 depends on a template-parameter is implicitly assumed to be a
8255 is to assume that we have seen the `typename' keyword at this
8257 nested_name_specifier_p
8258 = (cp_parser_nested_name_specifier_opt (parser,
8259 /*typename_keyword_p=*/true,
8260 /*check_dependency_p=*/true,
8262 /*is_declaration=*/true)
8264 if (nested_name_specifier_p)
8265 template_p = cp_parser_optional_template_keyword (parser);
8266 /* If there is a `::' operator or a nested-name-specifier, then we
8267 are definitely looking for a class-name. */
8268 if (global_scope_p || nested_name_specifier_p)
8269 return cp_parser_class_name (parser,
8270 /*typename_keyword_p=*/true,
8271 /*template_keyword_p=*/template_p,
8273 /*check_dependency_p=*/true,
8274 /*class_head_p=*/false,
8275 /*is_declaration=*/true);
8276 /* Otherwise, we could also be looking for an ordinary identifier. */
8277 cp_parser_parse_tentatively (parser);
8278 /* Try a class-name. */
8279 id = cp_parser_class_name (parser,
8280 /*typename_keyword_p=*/true,
8281 /*template_keyword_p=*/false,
8283 /*check_dependency_p=*/true,
8284 /*class_head_p=*/false,
8285 /*is_declaration=*/true);
8286 /* If we found one, we're done. */
8287 if (cp_parser_parse_definitely (parser))
8289 /* Otherwise, look for an ordinary identifier. */
8290 return cp_parser_identifier (parser);
8293 /* Overloading [gram.over] */
8295 /* Parse an operator-function-id.
8297 operator-function-id:
8300 Returns an IDENTIFIER_NODE for the operator which is a
8301 human-readable spelling of the identifier, e.g., `operator +'. */
8304 cp_parser_operator_function_id (cp_parser* parser)
8306 /* Look for the `operator' keyword. */
8307 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
8308 return error_mark_node;
8309 /* And then the name of the operator itself. */
8310 return cp_parser_operator (parser);
8313 /* Parse an operator.
8316 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
8317 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
8318 || ++ -- , ->* -> () []
8325 Returns an IDENTIFIER_NODE for the operator which is a
8326 human-readable spelling of the identifier, e.g., `operator +'. */
8329 cp_parser_operator (cp_parser* parser)
8331 tree id = NULL_TREE;
8334 /* Peek at the next token. */
8335 token = cp_lexer_peek_token (parser->lexer);
8336 /* Figure out which operator we have. */
8337 switch (token->type)
8343 /* The keyword should be either `new' or `delete'. */
8344 if (token->keyword == RID_NEW)
8346 else if (token->keyword == RID_DELETE)
8351 /* Consume the `new' or `delete' token. */
8352 cp_lexer_consume_token (parser->lexer);
8354 /* Peek at the next token. */
8355 token = cp_lexer_peek_token (parser->lexer);
8356 /* If it's a `[' token then this is the array variant of the
8358 if (token->type == CPP_OPEN_SQUARE)
8360 /* Consume the `[' token. */
8361 cp_lexer_consume_token (parser->lexer);
8362 /* Look for the `]' token. */
8363 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8364 id = ansi_opname (op == NEW_EXPR
8365 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
8367 /* Otherwise, we have the non-array variant. */
8369 id = ansi_opname (op);
8375 id = ansi_opname (PLUS_EXPR);
8379 id = ansi_opname (MINUS_EXPR);
8383 id = ansi_opname (MULT_EXPR);
8387 id = ansi_opname (TRUNC_DIV_EXPR);
8391 id = ansi_opname (TRUNC_MOD_EXPR);
8395 id = ansi_opname (BIT_XOR_EXPR);
8399 id = ansi_opname (BIT_AND_EXPR);
8403 id = ansi_opname (BIT_IOR_EXPR);
8407 id = ansi_opname (BIT_NOT_EXPR);
8411 id = ansi_opname (TRUTH_NOT_EXPR);
8415 id = ansi_assopname (NOP_EXPR);
8419 id = ansi_opname (LT_EXPR);
8423 id = ansi_opname (GT_EXPR);
8427 id = ansi_assopname (PLUS_EXPR);
8431 id = ansi_assopname (MINUS_EXPR);
8435 id = ansi_assopname (MULT_EXPR);
8439 id = ansi_assopname (TRUNC_DIV_EXPR);
8443 id = ansi_assopname (TRUNC_MOD_EXPR);
8447 id = ansi_assopname (BIT_XOR_EXPR);
8451 id = ansi_assopname (BIT_AND_EXPR);
8455 id = ansi_assopname (BIT_IOR_EXPR);
8459 id = ansi_opname (LSHIFT_EXPR);
8463 id = ansi_opname (RSHIFT_EXPR);
8467 id = ansi_assopname (LSHIFT_EXPR);
8471 id = ansi_assopname (RSHIFT_EXPR);
8475 id = ansi_opname (EQ_EXPR);
8479 id = ansi_opname (NE_EXPR);
8483 id = ansi_opname (LE_EXPR);
8486 case CPP_GREATER_EQ:
8487 id = ansi_opname (GE_EXPR);
8491 id = ansi_opname (TRUTH_ANDIF_EXPR);
8495 id = ansi_opname (TRUTH_ORIF_EXPR);
8499 id = ansi_opname (POSTINCREMENT_EXPR);
8502 case CPP_MINUS_MINUS:
8503 id = ansi_opname (PREDECREMENT_EXPR);
8507 id = ansi_opname (COMPOUND_EXPR);
8510 case CPP_DEREF_STAR:
8511 id = ansi_opname (MEMBER_REF);
8515 id = ansi_opname (COMPONENT_REF);
8518 case CPP_OPEN_PAREN:
8519 /* Consume the `('. */
8520 cp_lexer_consume_token (parser->lexer);
8521 /* Look for the matching `)'. */
8522 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
8523 return ansi_opname (CALL_EXPR);
8525 case CPP_OPEN_SQUARE:
8526 /* Consume the `['. */
8527 cp_lexer_consume_token (parser->lexer);
8528 /* Look for the matching `]'. */
8529 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8530 return ansi_opname (ARRAY_REF);
8533 /* Anything else is an error. */
8537 /* If we have selected an identifier, we need to consume the
8540 cp_lexer_consume_token (parser->lexer);
8541 /* Otherwise, no valid operator name was present. */
8544 cp_parser_error (parser, "expected operator");
8545 id = error_mark_node;
8551 /* Parse a template-declaration.
8553 template-declaration:
8554 export [opt] template < template-parameter-list > declaration
8556 If MEMBER_P is TRUE, this template-declaration occurs within a
8559 The grammar rule given by the standard isn't correct. What
8562 template-declaration:
8563 export [opt] template-parameter-list-seq
8564 decl-specifier-seq [opt] init-declarator [opt] ;
8565 export [opt] template-parameter-list-seq
8568 template-parameter-list-seq:
8569 template-parameter-list-seq [opt]
8570 template < template-parameter-list > */
8573 cp_parser_template_declaration (cp_parser* parser, bool member_p)
8575 /* Check for `export'. */
8576 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
8578 /* Consume the `export' token. */
8579 cp_lexer_consume_token (parser->lexer);
8580 /* Warn that we do not support `export'. */
8581 warning (0, "keyword %<export%> not implemented, and will be ignored");
8584 cp_parser_template_declaration_after_export (parser, member_p);
8587 /* Parse a template-parameter-list.
8589 template-parameter-list:
8591 template-parameter-list , template-parameter
8593 Returns a TREE_LIST. Each node represents a template parameter.
8594 The nodes are connected via their TREE_CHAINs. */
8597 cp_parser_template_parameter_list (cp_parser* parser)
8599 tree parameter_list = NULL_TREE;
8601 begin_template_parm_list ();
8608 /* Parse the template-parameter. */
8609 parameter = cp_parser_template_parameter (parser, &is_non_type);
8610 /* Add it to the list. */
8611 if (parameter != error_mark_node)
8612 parameter_list = process_template_parm (parameter_list,
8617 tree err_parm = build_tree_list (parameter, parameter);
8618 TREE_VALUE (err_parm) = error_mark_node;
8619 parameter_list = chainon (parameter_list, err_parm);
8622 /* Peek at the next token. */
8623 token = cp_lexer_peek_token (parser->lexer);
8624 /* If it's not a `,', we're done. */
8625 if (token->type != CPP_COMMA)
8627 /* Otherwise, consume the `,' token. */
8628 cp_lexer_consume_token (parser->lexer);
8631 return end_template_parm_list (parameter_list);
8634 /* Parse a template-parameter.
8638 parameter-declaration
8640 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
8641 the parameter. The TREE_PURPOSE is the default value, if any.
8642 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
8643 iff this parameter is a non-type parameter. */
8646 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type)
8649 cp_parameter_declarator *parameter_declarator;
8652 /* Assume it is a type parameter or a template parameter. */
8653 *is_non_type = false;
8654 /* Peek at the next token. */
8655 token = cp_lexer_peek_token (parser->lexer);
8656 /* If it is `class' or `template', we have a type-parameter. */
8657 if (token->keyword == RID_TEMPLATE)
8658 return cp_parser_type_parameter (parser);
8659 /* If it is `class' or `typename' we do not know yet whether it is a
8660 type parameter or a non-type parameter. Consider:
8662 template <typename T, typename T::X X> ...
8666 template <class C, class D*> ...
8668 Here, the first parameter is a type parameter, and the second is
8669 a non-type parameter. We can tell by looking at the token after
8670 the identifier -- if it is a `,', `=', or `>' then we have a type
8672 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
8674 /* Peek at the token after `class' or `typename'. */
8675 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8676 /* If it's an identifier, skip it. */
8677 if (token->type == CPP_NAME)
8678 token = cp_lexer_peek_nth_token (parser->lexer, 3);
8679 /* Now, see if the token looks like the end of a template
8681 if (token->type == CPP_COMMA
8682 || token->type == CPP_EQ
8683 || token->type == CPP_GREATER)
8684 return cp_parser_type_parameter (parser);
8687 /* Otherwise, it is a non-type parameter.
8691 When parsing a default template-argument for a non-type
8692 template-parameter, the first non-nested `>' is taken as the end
8693 of the template parameter-list rather than a greater-than
8695 *is_non_type = true;
8696 parameter_declarator
8697 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
8698 /*parenthesized_p=*/NULL);
8699 parm = grokdeclarator (parameter_declarator->declarator,
8700 ¶meter_declarator->decl_specifiers,
8701 PARM, /*initialized=*/0,
8703 if (parm == error_mark_node)
8704 return error_mark_node;
8705 return build_tree_list (parameter_declarator->default_argument, parm);
8708 /* Parse a type-parameter.
8711 class identifier [opt]
8712 class identifier [opt] = type-id
8713 typename identifier [opt]
8714 typename identifier [opt] = type-id
8715 template < template-parameter-list > class identifier [opt]
8716 template < template-parameter-list > class identifier [opt]
8719 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8720 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8721 the declaration of the parameter. */
8724 cp_parser_type_parameter (cp_parser* parser)
8729 /* Look for a keyword to tell us what kind of parameter this is. */
8730 token = cp_parser_require (parser, CPP_KEYWORD,
8731 "`class', `typename', or `template'");
8733 return error_mark_node;
8735 switch (token->keyword)
8741 tree default_argument;
8743 /* If the next token is an identifier, then it names the
8745 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8746 identifier = cp_parser_identifier (parser);
8748 identifier = NULL_TREE;
8750 /* Create the parameter. */
8751 parameter = finish_template_type_parm (class_type_node, identifier);
8753 /* If the next token is an `=', we have a default argument. */
8754 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8756 /* Consume the `=' token. */
8757 cp_lexer_consume_token (parser->lexer);
8758 /* Parse the default-argument. */
8759 push_deferring_access_checks (dk_no_deferred);
8760 default_argument = cp_parser_type_id (parser);
8761 pop_deferring_access_checks ();
8764 default_argument = NULL_TREE;
8766 /* Create the combined representation of the parameter and the
8767 default argument. */
8768 parameter = build_tree_list (default_argument, parameter);
8774 tree parameter_list;
8776 tree default_argument;
8778 /* Look for the `<'. */
8779 cp_parser_require (parser, CPP_LESS, "`<'");
8780 /* Parse the template-parameter-list. */
8781 parameter_list = cp_parser_template_parameter_list (parser);
8782 /* Look for the `>'. */
8783 cp_parser_require (parser, CPP_GREATER, "`>'");
8784 /* Look for the `class' keyword. */
8785 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
8786 /* If the next token is an `=', then there is a
8787 default-argument. If the next token is a `>', we are at
8788 the end of the parameter-list. If the next token is a `,',
8789 then we are at the end of this parameter. */
8790 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8791 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
8792 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8794 identifier = cp_parser_identifier (parser);
8795 /* Treat invalid names as if the parameter were nameless. */
8796 if (identifier == error_mark_node)
8797 identifier = NULL_TREE;
8800 identifier = NULL_TREE;
8802 /* Create the template parameter. */
8803 parameter = finish_template_template_parm (class_type_node,
8806 /* If the next token is an `=', then there is a
8807 default-argument. */
8808 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8812 /* Consume the `='. */
8813 cp_lexer_consume_token (parser->lexer);
8814 /* Parse the id-expression. */
8815 push_deferring_access_checks (dk_no_deferred);
8817 = cp_parser_id_expression (parser,
8818 /*template_keyword_p=*/false,
8819 /*check_dependency_p=*/true,
8820 /*template_p=*/&is_template,
8821 /*declarator_p=*/false,
8822 /*optional_p=*/false);
8823 if (TREE_CODE (default_argument) == TYPE_DECL)
8824 /* If the id-expression was a template-id that refers to
8825 a template-class, we already have the declaration here,
8826 so no further lookup is needed. */
8829 /* Look up the name. */
8831 = cp_parser_lookup_name (parser, default_argument,
8833 /*is_template=*/is_template,
8834 /*is_namespace=*/false,
8835 /*check_dependency=*/true,
8836 /*ambiguous_decls=*/NULL);
8837 /* See if the default argument is valid. */
8839 = check_template_template_default_arg (default_argument);
8840 pop_deferring_access_checks ();
8843 default_argument = NULL_TREE;
8845 /* Create the combined representation of the parameter and the
8846 default argument. */
8847 parameter = build_tree_list (default_argument, parameter);
8859 /* Parse a template-id.
8862 template-name < template-argument-list [opt] >
8864 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8865 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8866 returned. Otherwise, if the template-name names a function, or set
8867 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8868 names a class, returns a TYPE_DECL for the specialization.
8870 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8871 uninstantiated templates. */
8874 cp_parser_template_id (cp_parser *parser,
8875 bool template_keyword_p,
8876 bool check_dependency_p,
8877 bool is_declaration)
8883 cp_token_position start_of_id = 0;
8884 deferred_access_check *chk;
8885 VEC (deferred_access_check,gc) *access_check;
8886 cp_token *next_token, *next_token_2;
8889 /* If the next token corresponds to a template-id, there is no need
8891 next_token = cp_lexer_peek_token (parser->lexer);
8892 if (next_token->type == CPP_TEMPLATE_ID)
8894 struct tree_check *check_value;
8896 /* Get the stored value. */
8897 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
8898 /* Perform any access checks that were deferred. */
8899 access_check = check_value->checks;
8903 VEC_iterate (deferred_access_check, access_check, i, chk) ;
8906 perform_or_defer_access_check (chk->binfo,
8911 /* Return the stored value. */
8912 return check_value->value;
8915 /* Avoid performing name lookup if there is no possibility of
8916 finding a template-id. */
8917 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8918 || (next_token->type == CPP_NAME
8919 && !cp_parser_nth_token_starts_template_argument_list_p
8922 cp_parser_error (parser, "expected template-id");
8923 return error_mark_node;
8926 /* Remember where the template-id starts. */
8927 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
8928 start_of_id = cp_lexer_token_position (parser->lexer, false);
8930 push_deferring_access_checks (dk_deferred);
8932 /* Parse the template-name. */
8933 is_identifier = false;
8934 template = cp_parser_template_name (parser, template_keyword_p,
8938 if (template == error_mark_node || is_identifier)
8940 pop_deferring_access_checks ();
8944 /* If we find the sequence `[:' after a template-name, it's probably
8945 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8946 parse correctly the argument list. */
8947 next_token = cp_lexer_peek_token (parser->lexer);
8948 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8949 if (next_token->type == CPP_OPEN_SQUARE
8950 && next_token->flags & DIGRAPH
8951 && next_token_2->type == CPP_COLON
8952 && !(next_token_2->flags & PREV_WHITE))
8954 cp_parser_parse_tentatively (parser);
8955 /* Change `:' into `::'. */
8956 next_token_2->type = CPP_SCOPE;
8957 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8959 cp_lexer_consume_token (parser->lexer);
8960 /* Parse the arguments. */
8961 arguments = cp_parser_enclosed_template_argument_list (parser);
8962 if (!cp_parser_parse_definitely (parser))
8964 /* If we couldn't parse an argument list, then we revert our changes
8965 and return simply an error. Maybe this is not a template-id
8967 next_token_2->type = CPP_COLON;
8968 cp_parser_error (parser, "expected %<<%>");
8969 pop_deferring_access_checks ();
8970 return error_mark_node;
8972 /* Otherwise, emit an error about the invalid digraph, but continue
8973 parsing because we got our argument list. */
8974 pedwarn ("%<<::%> cannot begin a template-argument list");
8975 inform ("%<<:%> is an alternate spelling for %<[%>. Insert whitespace "
8976 "between %<<%> and %<::%>");
8977 if (!flag_permissive)
8982 inform ("(if you use -fpermissive G++ will accept your code)");
8989 /* Look for the `<' that starts the template-argument-list. */
8990 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
8992 pop_deferring_access_checks ();
8993 return error_mark_node;
8995 /* Parse the arguments. */
8996 arguments = cp_parser_enclosed_template_argument_list (parser);
8999 /* Build a representation of the specialization. */
9000 if (TREE_CODE (template) == IDENTIFIER_NODE)
9001 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
9002 else if (DECL_CLASS_TEMPLATE_P (template)
9003 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
9005 bool entering_scope;
9006 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
9007 template (rather than some instantiation thereof) only if
9008 is not nested within some other construct. For example, in
9009 "template <typename T> void f(T) { A<T>::", A<T> is just an
9010 instantiation of A. */
9011 entering_scope = (template_parm_scope_p ()
9012 && cp_lexer_next_token_is (parser->lexer,
9015 = finish_template_type (template, arguments, entering_scope);
9019 /* If it's not a class-template or a template-template, it should be
9020 a function-template. */
9021 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (template)
9022 || TREE_CODE (template) == OVERLOAD
9023 || BASELINK_P (template)));
9025 template_id = lookup_template_function (template, arguments);
9028 /* If parsing tentatively, replace the sequence of tokens that makes
9029 up the template-id with a CPP_TEMPLATE_ID token. That way,
9030 should we re-parse the token stream, we will not have to repeat
9031 the effort required to do the parse, nor will we issue duplicate
9032 error messages about problems during instantiation of the
9036 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
9038 /* Reset the contents of the START_OF_ID token. */
9039 token->type = CPP_TEMPLATE_ID;
9040 /* Retrieve any deferred checks. Do not pop this access checks yet
9041 so the memory will not be reclaimed during token replacing below. */
9042 token->u.tree_check_value = GGC_CNEW (struct tree_check);
9043 token->u.tree_check_value->value = template_id;
9044 token->u.tree_check_value->checks = get_deferred_access_checks ();
9045 token->keyword = RID_MAX;
9047 /* Purge all subsequent tokens. */
9048 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
9050 /* ??? Can we actually assume that, if template_id ==
9051 error_mark_node, we will have issued a diagnostic to the
9052 user, as opposed to simply marking the tentative parse as
9054 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
9055 error ("parse error in template argument list");
9058 pop_deferring_access_checks ();
9062 /* Parse a template-name.
9067 The standard should actually say:
9071 operator-function-id
9073 A defect report has been filed about this issue.
9075 A conversion-function-id cannot be a template name because they cannot
9076 be part of a template-id. In fact, looking at this code:
9080 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
9081 It is impossible to call a templated conversion-function-id with an
9082 explicit argument list, since the only allowed template parameter is
9083 the type to which it is converting.
9085 If TEMPLATE_KEYWORD_P is true, then we have just seen the
9086 `template' keyword, in a construction like:
9090 In that case `f' is taken to be a template-name, even though there
9091 is no way of knowing for sure.
9093 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
9094 name refers to a set of overloaded functions, at least one of which
9095 is a template, or an IDENTIFIER_NODE with the name of the template,
9096 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
9097 names are looked up inside uninstantiated templates. */
9100 cp_parser_template_name (cp_parser* parser,
9101 bool template_keyword_p,
9102 bool check_dependency_p,
9103 bool is_declaration,
9104 bool *is_identifier)
9110 /* If the next token is `operator', then we have either an
9111 operator-function-id or a conversion-function-id. */
9112 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
9114 /* We don't know whether we're looking at an
9115 operator-function-id or a conversion-function-id. */
9116 cp_parser_parse_tentatively (parser);
9117 /* Try an operator-function-id. */
9118 identifier = cp_parser_operator_function_id (parser);
9119 /* If that didn't work, try a conversion-function-id. */
9120 if (!cp_parser_parse_definitely (parser))
9122 cp_parser_error (parser, "expected template-name");
9123 return error_mark_node;
9126 /* Look for the identifier. */
9128 identifier = cp_parser_identifier (parser);
9130 /* If we didn't find an identifier, we don't have a template-id. */
9131 if (identifier == error_mark_node)
9132 return error_mark_node;
9134 /* If the name immediately followed the `template' keyword, then it
9135 is a template-name. However, if the next token is not `<', then
9136 we do not treat it as a template-name, since it is not being used
9137 as part of a template-id. This enables us to handle constructs
9140 template <typename T> struct S { S(); };
9141 template <typename T> S<T>::S();
9143 correctly. We would treat `S' as a template -- if it were `S<T>'
9144 -- but we do not if there is no `<'. */
9146 if (processing_template_decl
9147 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
9149 /* In a declaration, in a dependent context, we pretend that the
9150 "template" keyword was present in order to improve error
9151 recovery. For example, given:
9153 template <typename T> void f(T::X<int>);
9155 we want to treat "X<int>" as a template-id. */
9157 && !template_keyword_p
9158 && parser->scope && TYPE_P (parser->scope)
9159 && check_dependency_p
9160 && dependent_type_p (parser->scope)
9161 /* Do not do this for dtors (or ctors), since they never
9162 need the template keyword before their name. */
9163 && !constructor_name_p (identifier, parser->scope))
9165 cp_token_position start = 0;
9167 /* Explain what went wrong. */
9168 error ("non-template %qD used as template", identifier);
9169 inform ("use %<%T::template %D%> to indicate that it is a template",
9170 parser->scope, identifier);
9171 /* If parsing tentatively, find the location of the "<" token. */
9172 if (cp_parser_simulate_error (parser))
9173 start = cp_lexer_token_position (parser->lexer, true);
9174 /* Parse the template arguments so that we can issue error
9175 messages about them. */
9176 cp_lexer_consume_token (parser->lexer);
9177 cp_parser_enclosed_template_argument_list (parser);
9178 /* Skip tokens until we find a good place from which to
9179 continue parsing. */
9180 cp_parser_skip_to_closing_parenthesis (parser,
9181 /*recovering=*/true,
9183 /*consume_paren=*/false);
9184 /* If parsing tentatively, permanently remove the
9185 template argument list. That will prevent duplicate
9186 error messages from being issued about the missing
9187 "template" keyword. */
9189 cp_lexer_purge_tokens_after (parser->lexer, start);
9191 *is_identifier = true;
9195 /* If the "template" keyword is present, then there is generally
9196 no point in doing name-lookup, so we just return IDENTIFIER.
9197 But, if the qualifying scope is non-dependent then we can
9198 (and must) do name-lookup normally. */
9199 if (template_keyword_p
9201 || (TYPE_P (parser->scope)
9202 && dependent_type_p (parser->scope))))
9206 /* Look up the name. */
9207 decl = cp_parser_lookup_name (parser, identifier,
9209 /*is_template=*/false,
9210 /*is_namespace=*/false,
9212 /*ambiguous_decls=*/NULL);
9213 decl = maybe_get_template_decl_from_type_decl (decl);
9215 /* If DECL is a template, then the name was a template-name. */
9216 if (TREE_CODE (decl) == TEMPLATE_DECL)
9220 tree fn = NULL_TREE;
9222 /* The standard does not explicitly indicate whether a name that
9223 names a set of overloaded declarations, some of which are
9224 templates, is a template-name. However, such a name should
9225 be a template-name; otherwise, there is no way to form a
9226 template-id for the overloaded templates. */
9227 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
9228 if (TREE_CODE (fns) == OVERLOAD)
9229 for (fn = fns; fn; fn = OVL_NEXT (fn))
9230 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
9235 /* The name does not name a template. */
9236 cp_parser_error (parser, "expected template-name");
9237 return error_mark_node;
9241 /* If DECL is dependent, and refers to a function, then just return
9242 its name; we will look it up again during template instantiation. */
9243 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
9245 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
9246 if (TYPE_P (scope) && dependent_type_p (scope))
9253 /* Parse a template-argument-list.
9255 template-argument-list:
9257 template-argument-list , template-argument
9259 Returns a TREE_VEC containing the arguments. */
9262 cp_parser_template_argument_list (cp_parser* parser)
9264 tree fixed_args[10];
9265 unsigned n_args = 0;
9266 unsigned alloced = 10;
9267 tree *arg_ary = fixed_args;
9269 bool saved_in_template_argument_list_p;
9271 bool saved_non_ice_p;
9273 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
9274 parser->in_template_argument_list_p = true;
9275 /* Even if the template-id appears in an integral
9276 constant-expression, the contents of the argument list do
9278 saved_ice_p = parser->integral_constant_expression_p;
9279 parser->integral_constant_expression_p = false;
9280 saved_non_ice_p = parser->non_integral_constant_expression_p;
9281 parser->non_integral_constant_expression_p = false;
9282 /* Parse the arguments. */
9288 /* Consume the comma. */
9289 cp_lexer_consume_token (parser->lexer);
9291 /* Parse the template-argument. */
9292 argument = cp_parser_template_argument (parser);
9293 if (n_args == alloced)
9297 if (arg_ary == fixed_args)
9299 arg_ary = XNEWVEC (tree, alloced);
9300 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
9303 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
9305 arg_ary[n_args++] = argument;
9307 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
9309 vec = make_tree_vec (n_args);
9312 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
9314 if (arg_ary != fixed_args)
9316 parser->non_integral_constant_expression_p = saved_non_ice_p;
9317 parser->integral_constant_expression_p = saved_ice_p;
9318 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
9322 /* Parse a template-argument.
9325 assignment-expression
9329 The representation is that of an assignment-expression, type-id, or
9330 id-expression -- except that the qualified id-expression is
9331 evaluated, so that the value returned is either a DECL or an
9334 Although the standard says "assignment-expression", it forbids
9335 throw-expressions or assignments in the template argument.
9336 Therefore, we use "conditional-expression" instead. */
9339 cp_parser_template_argument (cp_parser* parser)
9344 bool maybe_type_id = false;
9348 /* There's really no way to know what we're looking at, so we just
9349 try each alternative in order.
9353 In a template-argument, an ambiguity between a type-id and an
9354 expression is resolved to a type-id, regardless of the form of
9355 the corresponding template-parameter.
9357 Therefore, we try a type-id first. */
9358 cp_parser_parse_tentatively (parser);
9359 argument = cp_parser_type_id (parser);
9360 /* If there was no error parsing the type-id but the next token is a '>>',
9361 we probably found a typo for '> >'. But there are type-id which are
9362 also valid expressions. For instance:
9364 struct X { int operator >> (int); };
9365 template <int V> struct Foo {};
9368 Here 'X()' is a valid type-id of a function type, but the user just
9369 wanted to write the expression "X() >> 5". Thus, we remember that we
9370 found a valid type-id, but we still try to parse the argument as an
9371 expression to see what happens. */
9372 if (!cp_parser_error_occurred (parser)
9373 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
9375 maybe_type_id = true;
9376 cp_parser_abort_tentative_parse (parser);
9380 /* If the next token isn't a `,' or a `>', then this argument wasn't
9381 really finished. This means that the argument is not a valid
9383 if (!cp_parser_next_token_ends_template_argument_p (parser))
9384 cp_parser_error (parser, "expected template-argument");
9385 /* If that worked, we're done. */
9386 if (cp_parser_parse_definitely (parser))
9389 /* We're still not sure what the argument will be. */
9390 cp_parser_parse_tentatively (parser);
9391 /* Try a template. */
9392 argument = cp_parser_id_expression (parser,
9393 /*template_keyword_p=*/false,
9394 /*check_dependency_p=*/true,
9396 /*declarator_p=*/false,
9397 /*optional_p=*/false);
9398 /* If the next token isn't a `,' or a `>', then this argument wasn't
9400 if (!cp_parser_next_token_ends_template_argument_p (parser))
9401 cp_parser_error (parser, "expected template-argument");
9402 if (!cp_parser_error_occurred (parser))
9404 /* Figure out what is being referred to. If the id-expression
9405 was for a class template specialization, then we will have a
9406 TYPE_DECL at this point. There is no need to do name lookup
9407 at this point in that case. */
9408 if (TREE_CODE (argument) != TYPE_DECL)
9409 argument = cp_parser_lookup_name (parser, argument,
9411 /*is_template=*/template_p,
9412 /*is_namespace=*/false,
9413 /*check_dependency=*/true,
9414 /*ambiguous_decls=*/NULL);
9415 if (TREE_CODE (argument) != TEMPLATE_DECL
9416 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
9417 cp_parser_error (parser, "expected template-name");
9419 if (cp_parser_parse_definitely (parser))
9421 /* It must be a non-type argument. There permitted cases are given
9422 in [temp.arg.nontype]:
9424 -- an integral constant-expression of integral or enumeration
9427 -- the name of a non-type template-parameter; or
9429 -- the name of an object or function with external linkage...
9431 -- the address of an object or function with external linkage...
9433 -- a pointer to member... */
9434 /* Look for a non-type template parameter. */
9435 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9437 cp_parser_parse_tentatively (parser);
9438 argument = cp_parser_primary_expression (parser,
9441 /*template_arg_p=*/true,
9443 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
9444 || !cp_parser_next_token_ends_template_argument_p (parser))
9445 cp_parser_simulate_error (parser);
9446 if (cp_parser_parse_definitely (parser))
9450 /* If the next token is "&", the argument must be the address of an
9451 object or function with external linkage. */
9452 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
9454 cp_lexer_consume_token (parser->lexer);
9455 /* See if we might have an id-expression. */
9456 token = cp_lexer_peek_token (parser->lexer);
9457 if (token->type == CPP_NAME
9458 || token->keyword == RID_OPERATOR
9459 || token->type == CPP_SCOPE
9460 || token->type == CPP_TEMPLATE_ID
9461 || token->type == CPP_NESTED_NAME_SPECIFIER)
9463 cp_parser_parse_tentatively (parser);
9464 argument = cp_parser_primary_expression (parser,
9467 /*template_arg_p=*/true,
9469 if (cp_parser_error_occurred (parser)
9470 || !cp_parser_next_token_ends_template_argument_p (parser))
9471 cp_parser_abort_tentative_parse (parser);
9474 if (TREE_CODE (argument) == INDIRECT_REF)
9476 gcc_assert (REFERENCE_REF_P (argument));
9477 argument = TREE_OPERAND (argument, 0);
9480 if (TREE_CODE (argument) == VAR_DECL)
9482 /* A variable without external linkage might still be a
9483 valid constant-expression, so no error is issued here
9484 if the external-linkage check fails. */
9485 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (argument))
9486 cp_parser_simulate_error (parser);
9488 else if (is_overloaded_fn (argument))
9489 /* All overloaded functions are allowed; if the external
9490 linkage test does not pass, an error will be issued
9494 && (TREE_CODE (argument) == OFFSET_REF
9495 || TREE_CODE (argument) == SCOPE_REF))
9496 /* A pointer-to-member. */
9498 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
9501 cp_parser_simulate_error (parser);
9503 if (cp_parser_parse_definitely (parser))
9506 argument = build_x_unary_op (ADDR_EXPR, argument);
9511 /* If the argument started with "&", there are no other valid
9512 alternatives at this point. */
9515 cp_parser_error (parser, "invalid non-type template argument");
9516 return error_mark_node;
9519 /* If the argument wasn't successfully parsed as a type-id followed
9520 by '>>', the argument can only be a constant expression now.
9521 Otherwise, we try parsing the constant-expression tentatively,
9522 because the argument could really be a type-id. */
9524 cp_parser_parse_tentatively (parser);
9525 argument = cp_parser_constant_expression (parser,
9526 /*allow_non_constant_p=*/false,
9527 /*non_constant_p=*/NULL);
9528 argument = fold_non_dependent_expr (argument);
9531 if (!cp_parser_next_token_ends_template_argument_p (parser))
9532 cp_parser_error (parser, "expected template-argument");
9533 if (cp_parser_parse_definitely (parser))
9535 /* We did our best to parse the argument as a non type-id, but that
9536 was the only alternative that matched (albeit with a '>' after
9537 it). We can assume it's just a typo from the user, and a
9538 diagnostic will then be issued. */
9539 return cp_parser_type_id (parser);
9542 /* Parse an explicit-instantiation.
9544 explicit-instantiation:
9545 template declaration
9547 Although the standard says `declaration', what it really means is:
9549 explicit-instantiation:
9550 template decl-specifier-seq [opt] declarator [opt] ;
9552 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9553 supposed to be allowed. A defect report has been filed about this
9558 explicit-instantiation:
9559 storage-class-specifier template
9560 decl-specifier-seq [opt] declarator [opt] ;
9561 function-specifier template
9562 decl-specifier-seq [opt] declarator [opt] ; */
9565 cp_parser_explicit_instantiation (cp_parser* parser)
9567 int declares_class_or_enum;
9568 cp_decl_specifier_seq decl_specifiers;
9569 tree extension_specifier = NULL_TREE;
9571 /* Look for an (optional) storage-class-specifier or
9572 function-specifier. */
9573 if (cp_parser_allow_gnu_extensions_p (parser))
9576 = cp_parser_storage_class_specifier_opt (parser);
9577 if (!extension_specifier)
9579 = cp_parser_function_specifier_opt (parser,
9580 /*decl_specs=*/NULL);
9583 /* Look for the `template' keyword. */
9584 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9585 /* Let the front end know that we are processing an explicit
9587 begin_explicit_instantiation ();
9588 /* [temp.explicit] says that we are supposed to ignore access
9589 control while processing explicit instantiation directives. */
9590 push_deferring_access_checks (dk_no_check);
9591 /* Parse a decl-specifier-seq. */
9592 cp_parser_decl_specifier_seq (parser,
9593 CP_PARSER_FLAGS_OPTIONAL,
9595 &declares_class_or_enum);
9596 /* If there was exactly one decl-specifier, and it declared a class,
9597 and there's no declarator, then we have an explicit type
9599 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
9603 type = check_tag_decl (&decl_specifiers);
9604 /* Turn access control back on for names used during
9605 template instantiation. */
9606 pop_deferring_access_checks ();
9608 do_type_instantiation (type, extension_specifier,
9609 /*complain=*/tf_error);
9613 cp_declarator *declarator;
9616 /* Parse the declarator. */
9618 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9619 /*ctor_dtor_or_conv_p=*/NULL,
9620 /*parenthesized_p=*/NULL,
9621 /*member_p=*/false);
9622 if (declares_class_or_enum & 2)
9623 cp_parser_check_for_definition_in_return_type (declarator,
9624 decl_specifiers.type);
9625 if (declarator != cp_error_declarator)
9627 decl = grokdeclarator (declarator, &decl_specifiers,
9628 NORMAL, 0, &decl_specifiers.attributes);
9629 /* Turn access control back on for names used during
9630 template instantiation. */
9631 pop_deferring_access_checks ();
9632 /* Do the explicit instantiation. */
9633 do_decl_instantiation (decl, extension_specifier);
9637 pop_deferring_access_checks ();
9638 /* Skip the body of the explicit instantiation. */
9639 cp_parser_skip_to_end_of_statement (parser);
9642 /* We're done with the instantiation. */
9643 end_explicit_instantiation ();
9645 cp_parser_consume_semicolon_at_end_of_statement (parser);
9648 /* Parse an explicit-specialization.
9650 explicit-specialization:
9651 template < > declaration
9653 Although the standard says `declaration', what it really means is:
9655 explicit-specialization:
9656 template <> decl-specifier [opt] init-declarator [opt] ;
9657 template <> function-definition
9658 template <> explicit-specialization
9659 template <> template-declaration */
9662 cp_parser_explicit_specialization (cp_parser* parser)
9665 /* Look for the `template' keyword. */
9666 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9667 /* Look for the `<'. */
9668 cp_parser_require (parser, CPP_LESS, "`<'");
9669 /* Look for the `>'. */
9670 cp_parser_require (parser, CPP_GREATER, "`>'");
9671 /* We have processed another parameter list. */
9672 ++parser->num_template_parameter_lists;
9675 A template ... explicit specialization ... shall not have C
9677 if (current_lang_name == lang_name_c)
9679 error ("template specialization with C linkage");
9680 /* Give it C++ linkage to avoid confusing other parts of the
9682 push_lang_context (lang_name_cplusplus);
9683 need_lang_pop = true;
9686 need_lang_pop = false;
9687 /* Let the front end know that we are beginning a specialization. */
9688 if (!begin_specialization ())
9690 end_specialization ();
9691 cp_parser_skip_to_end_of_block_or_statement (parser);
9695 /* If the next keyword is `template', we need to figure out whether
9696 or not we're looking a template-declaration. */
9697 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9699 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9700 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9701 cp_parser_template_declaration_after_export (parser,
9702 /*member_p=*/false);
9704 cp_parser_explicit_specialization (parser);
9707 /* Parse the dependent declaration. */
9708 cp_parser_single_declaration (parser,
9712 /* We're done with the specialization. */
9713 end_specialization ();
9714 /* For the erroneous case of a template with C linkage, we pushed an
9715 implicit C++ linkage scope; exit that scope now. */
9717 pop_lang_context ();
9718 /* We're done with this parameter list. */
9719 --parser->num_template_parameter_lists;
9722 /* Parse a type-specifier.
9725 simple-type-specifier
9728 elaborated-type-specifier
9736 Returns a representation of the type-specifier. For a
9737 class-specifier, enum-specifier, or elaborated-type-specifier, a
9738 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9740 The parser flags FLAGS is used to control type-specifier parsing.
9742 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9743 in a decl-specifier-seq.
9745 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9746 class-specifier, enum-specifier, or elaborated-type-specifier, then
9747 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9748 if a type is declared; 2 if it is defined. Otherwise, it is set to
9751 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9752 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9756 cp_parser_type_specifier (cp_parser* parser,
9757 cp_parser_flags flags,
9758 cp_decl_specifier_seq *decl_specs,
9759 bool is_declaration,
9760 int* declares_class_or_enum,
9761 bool* is_cv_qualifier)
9763 tree type_spec = NULL_TREE;
9766 cp_decl_spec ds = ds_last;
9768 /* Assume this type-specifier does not declare a new type. */
9769 if (declares_class_or_enum)
9770 *declares_class_or_enum = 0;
9771 /* And that it does not specify a cv-qualifier. */
9772 if (is_cv_qualifier)
9773 *is_cv_qualifier = false;
9774 /* Peek at the next token. */
9775 token = cp_lexer_peek_token (parser->lexer);
9777 /* If we're looking at a keyword, we can use that to guide the
9778 production we choose. */
9779 keyword = token->keyword;
9783 /* Look for the enum-specifier. */
9784 type_spec = cp_parser_enum_specifier (parser);
9785 /* If that worked, we're done. */
9788 if (declares_class_or_enum)
9789 *declares_class_or_enum = 2;
9791 cp_parser_set_decl_spec_type (decl_specs,
9793 /*user_defined_p=*/true);
9797 goto elaborated_type_specifier;
9799 /* Any of these indicate either a class-specifier, or an
9800 elaborated-type-specifier. */
9804 /* Parse tentatively so that we can back up if we don't find a
9806 cp_parser_parse_tentatively (parser);
9807 /* Look for the class-specifier. */
9808 type_spec = cp_parser_class_specifier (parser);
9809 /* If that worked, we're done. */
9810 if (cp_parser_parse_definitely (parser))
9812 if (declares_class_or_enum)
9813 *declares_class_or_enum = 2;
9815 cp_parser_set_decl_spec_type (decl_specs,
9817 /*user_defined_p=*/true);
9822 elaborated_type_specifier:
9823 /* We're declaring (not defining) a class or enum. */
9824 if (declares_class_or_enum)
9825 *declares_class_or_enum = 1;
9829 /* Look for an elaborated-type-specifier. */
9831 = (cp_parser_elaborated_type_specifier
9833 decl_specs && decl_specs->specs[(int) ds_friend],
9836 cp_parser_set_decl_spec_type (decl_specs,
9838 /*user_defined_p=*/true);
9843 if (is_cv_qualifier)
9844 *is_cv_qualifier = true;
9849 if (is_cv_qualifier)
9850 *is_cv_qualifier = true;
9855 if (is_cv_qualifier)
9856 *is_cv_qualifier = true;
9860 /* The `__complex__' keyword is a GNU extension. */
9868 /* Handle simple keywords. */
9873 ++decl_specs->specs[(int)ds];
9874 decl_specs->any_specifiers_p = true;
9876 return cp_lexer_consume_token (parser->lexer)->u.value;
9879 /* If we do not already have a type-specifier, assume we are looking
9880 at a simple-type-specifier. */
9881 type_spec = cp_parser_simple_type_specifier (parser,
9885 /* If we didn't find a type-specifier, and a type-specifier was not
9886 optional in this context, issue an error message. */
9887 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9889 cp_parser_error (parser, "expected type specifier");
9890 return error_mark_node;
9896 /* Parse a simple-type-specifier.
9898 simple-type-specifier:
9899 :: [opt] nested-name-specifier [opt] type-name
9900 :: [opt] nested-name-specifier template template-id
9915 simple-type-specifier:
9916 __typeof__ unary-expression
9917 __typeof__ ( type-id )
9919 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9920 appropriately updated. */
9923 cp_parser_simple_type_specifier (cp_parser* parser,
9924 cp_decl_specifier_seq *decl_specs,
9925 cp_parser_flags flags)
9927 tree type = NULL_TREE;
9930 /* Peek at the next token. */
9931 token = cp_lexer_peek_token (parser->lexer);
9933 /* If we're looking at a keyword, things are easy. */
9934 switch (token->keyword)
9938 decl_specs->explicit_char_p = true;
9939 type = char_type_node;
9942 type = wchar_type_node;
9945 type = boolean_type_node;
9949 ++decl_specs->specs[(int) ds_short];
9950 type = short_integer_type_node;
9954 decl_specs->explicit_int_p = true;
9955 type = integer_type_node;
9959 ++decl_specs->specs[(int) ds_long];
9960 type = long_integer_type_node;
9964 ++decl_specs->specs[(int) ds_signed];
9965 type = integer_type_node;
9969 ++decl_specs->specs[(int) ds_unsigned];
9970 type = unsigned_type_node;
9973 type = float_type_node;
9976 type = double_type_node;
9979 type = void_type_node;
9983 /* Consume the `typeof' token. */
9984 cp_lexer_consume_token (parser->lexer);
9985 /* Parse the operand to `typeof'. */
9986 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9987 /* If it is not already a TYPE, take its type. */
9989 type = finish_typeof (type);
9992 cp_parser_set_decl_spec_type (decl_specs, type,
9993 /*user_defined_p=*/true);
10001 /* If the type-specifier was for a built-in type, we're done. */
10006 /* Record the type. */
10008 && (token->keyword != RID_SIGNED
10009 && token->keyword != RID_UNSIGNED
10010 && token->keyword != RID_SHORT
10011 && token->keyword != RID_LONG))
10012 cp_parser_set_decl_spec_type (decl_specs,
10014 /*user_defined=*/false);
10016 decl_specs->any_specifiers_p = true;
10018 /* Consume the token. */
10019 id = cp_lexer_consume_token (parser->lexer)->u.value;
10021 /* There is no valid C++ program where a non-template type is
10022 followed by a "<". That usually indicates that the user thought
10023 that the type was a template. */
10024 cp_parser_check_for_invalid_template_id (parser, type);
10026 return TYPE_NAME (type);
10029 /* The type-specifier must be a user-defined type. */
10030 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
10035 /* Don't gobble tokens or issue error messages if this is an
10036 optional type-specifier. */
10037 if (flags & CP_PARSER_FLAGS_OPTIONAL)
10038 cp_parser_parse_tentatively (parser);
10040 /* Look for the optional `::' operator. */
10042 = (cp_parser_global_scope_opt (parser,
10043 /*current_scope_valid_p=*/false)
10045 /* Look for the nested-name specifier. */
10047 = (cp_parser_nested_name_specifier_opt (parser,
10048 /*typename_keyword_p=*/false,
10049 /*check_dependency_p=*/true,
10051 /*is_declaration=*/false)
10053 /* If we have seen a nested-name-specifier, and the next token
10054 is `template', then we are using the template-id production. */
10056 && cp_parser_optional_template_keyword (parser))
10058 /* Look for the template-id. */
10059 type = cp_parser_template_id (parser,
10060 /*template_keyword_p=*/true,
10061 /*check_dependency_p=*/true,
10062 /*is_declaration=*/false);
10063 /* If the template-id did not name a type, we are out of
10065 if (TREE_CODE (type) != TYPE_DECL)
10067 cp_parser_error (parser, "expected template-id for type");
10071 /* Otherwise, look for a type-name. */
10073 type = cp_parser_type_name (parser);
10074 /* Keep track of all name-lookups performed in class scopes. */
10078 && TREE_CODE (type) == TYPE_DECL
10079 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
10080 maybe_note_name_used_in_class (DECL_NAME (type), type);
10081 /* If it didn't work out, we don't have a TYPE. */
10082 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
10083 && !cp_parser_parse_definitely (parser))
10085 if (type && decl_specs)
10086 cp_parser_set_decl_spec_type (decl_specs, type,
10087 /*user_defined=*/true);
10090 /* If we didn't get a type-name, issue an error message. */
10091 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
10093 cp_parser_error (parser, "expected type-name");
10094 return error_mark_node;
10097 /* There is no valid C++ program where a non-template type is
10098 followed by a "<". That usually indicates that the user thought
10099 that the type was a template. */
10100 if (type && type != error_mark_node)
10102 /* As a last-ditch effort, see if TYPE is an Objective-C type.
10103 If it is, then the '<'...'>' enclose protocol names rather than
10104 template arguments, and so everything is fine. */
10105 if (c_dialect_objc ()
10106 && (objc_is_id (type) || objc_is_class_name (type)))
10108 tree protos = cp_parser_objc_protocol_refs_opt (parser);
10109 tree qual_type = objc_get_protocol_qualified_type (type, protos);
10111 /* Clobber the "unqualified" type previously entered into
10112 DECL_SPECS with the new, improved protocol-qualified version. */
10114 decl_specs->type = qual_type;
10119 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
10125 /* Parse a type-name.
10138 Returns a TYPE_DECL for the type. */
10141 cp_parser_type_name (cp_parser* parser)
10146 /* We can't know yet whether it is a class-name or not. */
10147 cp_parser_parse_tentatively (parser);
10148 /* Try a class-name. */
10149 type_decl = cp_parser_class_name (parser,
10150 /*typename_keyword_p=*/false,
10151 /*template_keyword_p=*/false,
10153 /*check_dependency_p=*/true,
10154 /*class_head_p=*/false,
10155 /*is_declaration=*/false);
10156 /* If it's not a class-name, keep looking. */
10157 if (!cp_parser_parse_definitely (parser))
10159 /* It must be a typedef-name or an enum-name. */
10160 identifier = cp_parser_identifier (parser);
10161 if (identifier == error_mark_node)
10162 return error_mark_node;
10164 /* Look up the type-name. */
10165 type_decl = cp_parser_lookup_name_simple (parser, identifier);
10167 if (TREE_CODE (type_decl) != TYPE_DECL
10168 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
10170 /* See if this is an Objective-C type. */
10171 tree protos = cp_parser_objc_protocol_refs_opt (parser);
10172 tree type = objc_get_protocol_qualified_type (identifier, protos);
10174 type_decl = TYPE_NAME (type);
10177 /* Issue an error if we did not find a type-name. */
10178 if (TREE_CODE (type_decl) != TYPE_DECL)
10180 if (!cp_parser_simulate_error (parser))
10181 cp_parser_name_lookup_error (parser, identifier, type_decl,
10183 type_decl = error_mark_node;
10185 /* Remember that the name was used in the definition of the
10186 current class so that we can check later to see if the
10187 meaning would have been different after the class was
10188 entirely defined. */
10189 else if (type_decl != error_mark_node
10191 maybe_note_name_used_in_class (identifier, type_decl);
10198 /* Parse an elaborated-type-specifier. Note that the grammar given
10199 here incorporates the resolution to DR68.
10201 elaborated-type-specifier:
10202 class-key :: [opt] nested-name-specifier [opt] identifier
10203 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
10204 enum :: [opt] nested-name-specifier [opt] identifier
10205 typename :: [opt] nested-name-specifier identifier
10206 typename :: [opt] nested-name-specifier template [opt]
10211 elaborated-type-specifier:
10212 class-key attributes :: [opt] nested-name-specifier [opt] identifier
10213 class-key attributes :: [opt] nested-name-specifier [opt]
10214 template [opt] template-id
10215 enum attributes :: [opt] nested-name-specifier [opt] identifier
10217 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
10218 declared `friend'. If IS_DECLARATION is TRUE, then this
10219 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
10220 something is being declared.
10222 Returns the TYPE specified. */
10225 cp_parser_elaborated_type_specifier (cp_parser* parser,
10227 bool is_declaration)
10229 enum tag_types tag_type;
10231 tree type = NULL_TREE;
10232 tree attributes = NULL_TREE;
10234 /* See if we're looking at the `enum' keyword. */
10235 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
10237 /* Consume the `enum' token. */
10238 cp_lexer_consume_token (parser->lexer);
10239 /* Remember that it's an enumeration type. */
10240 tag_type = enum_type;
10241 /* Parse the attributes. */
10242 attributes = cp_parser_attributes_opt (parser);
10244 /* Or, it might be `typename'. */
10245 else if (cp_lexer_next_token_is_keyword (parser->lexer,
10248 /* Consume the `typename' token. */
10249 cp_lexer_consume_token (parser->lexer);
10250 /* Remember that it's a `typename' type. */
10251 tag_type = typename_type;
10252 /* The `typename' keyword is only allowed in templates. */
10253 if (!processing_template_decl)
10254 pedwarn ("using %<typename%> outside of template");
10256 /* Otherwise it must be a class-key. */
10259 tag_type = cp_parser_class_key (parser);
10260 if (tag_type == none_type)
10261 return error_mark_node;
10262 /* Parse the attributes. */
10263 attributes = cp_parser_attributes_opt (parser);
10266 /* Look for the `::' operator. */
10267 cp_parser_global_scope_opt (parser,
10268 /*current_scope_valid_p=*/false);
10269 /* Look for the nested-name-specifier. */
10270 if (tag_type == typename_type)
10272 if (!cp_parser_nested_name_specifier (parser,
10273 /*typename_keyword_p=*/true,
10274 /*check_dependency_p=*/true,
10277 return error_mark_node;
10280 /* Even though `typename' is not present, the proposed resolution
10281 to Core Issue 180 says that in `class A<T>::B', `B' should be
10282 considered a type-name, even if `A<T>' is dependent. */
10283 cp_parser_nested_name_specifier_opt (parser,
10284 /*typename_keyword_p=*/true,
10285 /*check_dependency_p=*/true,
10288 /* For everything but enumeration types, consider a template-id.
10289 For an enumeration type, consider only a plain identifier. */
10290 if (tag_type != enum_type)
10292 bool template_p = false;
10295 /* Allow the `template' keyword. */
10296 template_p = cp_parser_optional_template_keyword (parser);
10297 /* If we didn't see `template', we don't know if there's a
10298 template-id or not. */
10300 cp_parser_parse_tentatively (parser);
10301 /* Parse the template-id. */
10302 decl = cp_parser_template_id (parser, template_p,
10303 /*check_dependency_p=*/true,
10305 /* If we didn't find a template-id, look for an ordinary
10307 if (!template_p && !cp_parser_parse_definitely (parser))
10309 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
10310 in effect, then we must assume that, upon instantiation, the
10311 template will correspond to a class. */
10312 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
10313 && tag_type == typename_type)
10314 type = make_typename_type (parser->scope, decl,
10316 /*complain=*/tf_error);
10318 type = TREE_TYPE (decl);
10323 identifier = cp_parser_identifier (parser);
10325 if (identifier == error_mark_node)
10327 parser->scope = NULL_TREE;
10328 return error_mark_node;
10331 /* For a `typename', we needn't call xref_tag. */
10332 if (tag_type == typename_type
10333 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
10334 return cp_parser_make_typename_type (parser, parser->scope,
10336 /* Look up a qualified name in the usual way. */
10340 tree ambiguous_decls;
10342 decl = cp_parser_lookup_name (parser, identifier,
10344 /*is_template=*/false,
10345 /*is_namespace=*/false,
10346 /*check_dependency=*/true,
10349 /* If the lookup was ambiguous, an error will already have been
10351 if (ambiguous_decls)
10352 return error_mark_node;
10354 /* If we are parsing friend declaration, DECL may be a
10355 TEMPLATE_DECL tree node here. However, we need to check
10356 whether this TEMPLATE_DECL results in valid code. Consider
10357 the following example:
10360 template <class T> class C {};
10363 template <class T> friend class N::C; // #1, valid code
10365 template <class T> class Y {
10366 friend class N::C; // #2, invalid code
10369 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
10370 name lookup of `N::C'. We see that friend declaration must
10371 be template for the code to be valid. Note that
10372 processing_template_decl does not work here since it is
10373 always 1 for the above two cases. */
10375 decl = (cp_parser_maybe_treat_template_as_class
10376 (decl, /*tag_name_p=*/is_friend
10377 && parser->num_template_parameter_lists));
10379 if (TREE_CODE (decl) != TYPE_DECL)
10381 cp_parser_diagnose_invalid_type_name (parser,
10384 return error_mark_node;
10387 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
10389 bool allow_template = (parser->num_template_parameter_lists
10390 || DECL_SELF_REFERENCE_P (decl));
10391 type = check_elaborated_type_specifier (tag_type, decl,
10394 if (type == error_mark_node)
10395 return error_mark_node;
10398 type = TREE_TYPE (decl);
10402 /* An elaborated-type-specifier sometimes introduces a new type and
10403 sometimes names an existing type. Normally, the rule is that it
10404 introduces a new type only if there is not an existing type of
10405 the same name already in scope. For example, given:
10408 void f() { struct S s; }
10410 the `struct S' in the body of `f' is the same `struct S' as in
10411 the global scope; the existing definition is used. However, if
10412 there were no global declaration, this would introduce a new
10413 local class named `S'.
10415 An exception to this rule applies to the following code:
10417 namespace N { struct S; }
10419 Here, the elaborated-type-specifier names a new type
10420 unconditionally; even if there is already an `S' in the
10421 containing scope this declaration names a new type.
10422 This exception only applies if the elaborated-type-specifier
10423 forms the complete declaration:
10427 A declaration consisting solely of `class-key identifier ;' is
10428 either a redeclaration of the name in the current scope or a
10429 forward declaration of the identifier as a class name. It
10430 introduces the name into the current scope.
10432 We are in this situation precisely when the next token is a `;'.
10434 An exception to the exception is that a `friend' declaration does
10435 *not* name a new type; i.e., given:
10437 struct S { friend struct T; };
10439 `T' is not a new type in the scope of `S'.
10441 Also, `new struct S' or `sizeof (struct S)' never results in the
10442 definition of a new type; a new type can only be declared in a
10443 declaration context. */
10449 /* Friends have special name lookup rules. */
10450 ts = ts_within_enclosing_non_class;
10451 else if (is_declaration
10452 && cp_lexer_next_token_is (parser->lexer,
10454 /* This is a `class-key identifier ;' */
10460 (parser->num_template_parameter_lists
10461 && (cp_parser_next_token_starts_class_definition_p (parser)
10462 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
10463 /* An unqualified name was used to reference this type, so
10464 there were no qualifying templates. */
10465 if (!cp_parser_check_template_parameters (parser,
10466 /*num_templates=*/0))
10467 return error_mark_node;
10468 type = xref_tag (tag_type, identifier, ts, template_p);
10472 if (type == error_mark_node)
10473 return error_mark_node;
10475 /* Allow attributes on forward declarations of classes. */
10478 if (TREE_CODE (type) == TYPENAME_TYPE)
10479 warning (OPT_Wattributes,
10480 "attributes ignored on uninstantiated type");
10481 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
10482 && ! processing_explicit_instantiation)
10483 warning (OPT_Wattributes,
10484 "attributes ignored on template instantiation");
10485 else if (is_declaration && cp_parser_declares_only_class_p (parser))
10486 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
10488 warning (OPT_Wattributes,
10489 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
10492 if (tag_type != enum_type)
10493 cp_parser_check_class_key (tag_type, type);
10495 /* A "<" cannot follow an elaborated type specifier. If that
10496 happens, the user was probably trying to form a template-id. */
10497 cp_parser_check_for_invalid_template_id (parser, type);
10502 /* Parse an enum-specifier.
10505 enum identifier [opt] { enumerator-list [opt] }
10508 enum attributes[opt] identifier [opt] { enumerator-list [opt] }
10511 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
10512 if the token stream isn't an enum-specifier after all. */
10515 cp_parser_enum_specifier (cp_parser* parser)
10521 /* Parse tentatively so that we can back up if we don't find a
10523 cp_parser_parse_tentatively (parser);
10525 /* Caller guarantees that the current token is 'enum', an identifier
10526 possibly follows, and the token after that is an opening brace.
10527 If we don't have an identifier, fabricate an anonymous name for
10528 the enumeration being defined. */
10529 cp_lexer_consume_token (parser->lexer);
10531 attributes = cp_parser_attributes_opt (parser);
10533 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10534 identifier = cp_parser_identifier (parser);
10536 identifier = make_anon_name ();
10538 /* Look for the `{' but don't consume it yet. */
10539 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
10540 cp_parser_simulate_error (parser);
10542 if (!cp_parser_parse_definitely (parser))
10545 /* Issue an error message if type-definitions are forbidden here. */
10546 if (!cp_parser_check_type_definition (parser))
10547 type = error_mark_node;
10549 /* Create the new type. We do this before consuming the opening
10550 brace so the enum will be recorded as being on the line of its
10551 tag (or the 'enum' keyword, if there is no tag). */
10552 type = start_enum (identifier);
10554 /* Consume the opening brace. */
10555 cp_lexer_consume_token (parser->lexer);
10557 if (type == error_mark_node)
10559 cp_parser_skip_to_end_of_block_or_statement (parser);
10560 return error_mark_node;
10563 /* If the next token is not '}', then there are some enumerators. */
10564 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
10565 cp_parser_enumerator_list (parser, type);
10567 /* Consume the final '}'. */
10568 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10570 /* Look for trailing attributes to apply to this enumeration, and
10571 apply them if appropriate. */
10572 if (cp_parser_allow_gnu_extensions_p (parser))
10574 tree trailing_attr = cp_parser_attributes_opt (parser);
10575 cplus_decl_attributes (&type,
10577 (int) ATTR_FLAG_TYPE_IN_PLACE);
10580 /* Finish up the enumeration. */
10581 finish_enum (type);
10586 /* Parse an enumerator-list. The enumerators all have the indicated
10590 enumerator-definition
10591 enumerator-list , enumerator-definition */
10594 cp_parser_enumerator_list (cp_parser* parser, tree type)
10598 /* Parse an enumerator-definition. */
10599 cp_parser_enumerator_definition (parser, type);
10601 /* If the next token is not a ',', we've reached the end of
10603 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
10605 /* Otherwise, consume the `,' and keep going. */
10606 cp_lexer_consume_token (parser->lexer);
10607 /* If the next token is a `}', there is a trailing comma. */
10608 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
10610 if (pedantic && !in_system_header)
10611 pedwarn ("comma at end of enumerator list");
10617 /* Parse an enumerator-definition. The enumerator has the indicated
10620 enumerator-definition:
10622 enumerator = constant-expression
10628 cp_parser_enumerator_definition (cp_parser* parser, tree type)
10633 /* Look for the identifier. */
10634 identifier = cp_parser_identifier (parser);
10635 if (identifier == error_mark_node)
10638 /* If the next token is an '=', then there is an explicit value. */
10639 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
10641 /* Consume the `=' token. */
10642 cp_lexer_consume_token (parser->lexer);
10643 /* Parse the value. */
10644 value = cp_parser_constant_expression (parser,
10645 /*allow_non_constant_p=*/false,
10651 /* Create the enumerator. */
10652 build_enumerator (identifier, value, type);
10655 /* Parse a namespace-name.
10658 original-namespace-name
10661 Returns the NAMESPACE_DECL for the namespace. */
10664 cp_parser_namespace_name (cp_parser* parser)
10667 tree namespace_decl;
10669 /* Get the name of the namespace. */
10670 identifier = cp_parser_identifier (parser);
10671 if (identifier == error_mark_node)
10672 return error_mark_node;
10674 /* Look up the identifier in the currently active scope. Look only
10675 for namespaces, due to:
10677 [basic.lookup.udir]
10679 When looking up a namespace-name in a using-directive or alias
10680 definition, only namespace names are considered.
10684 [basic.lookup.qual]
10686 During the lookup of a name preceding the :: scope resolution
10687 operator, object, function, and enumerator names are ignored.
10689 (Note that cp_parser_class_or_namespace_name only calls this
10690 function if the token after the name is the scope resolution
10692 namespace_decl = cp_parser_lookup_name (parser, identifier,
10694 /*is_template=*/false,
10695 /*is_namespace=*/true,
10696 /*check_dependency=*/true,
10697 /*ambiguous_decls=*/NULL);
10698 /* If it's not a namespace, issue an error. */
10699 if (namespace_decl == error_mark_node
10700 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
10702 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
10703 error ("%qD is not a namespace-name", identifier);
10704 cp_parser_error (parser, "expected namespace-name");
10705 namespace_decl = error_mark_node;
10708 return namespace_decl;
10711 /* Parse a namespace-definition.
10713 namespace-definition:
10714 named-namespace-definition
10715 unnamed-namespace-definition
10717 named-namespace-definition:
10718 original-namespace-definition
10719 extension-namespace-definition
10721 original-namespace-definition:
10722 namespace identifier { namespace-body }
10724 extension-namespace-definition:
10725 namespace original-namespace-name { namespace-body }
10727 unnamed-namespace-definition:
10728 namespace { namespace-body } */
10731 cp_parser_namespace_definition (cp_parser* parser)
10733 tree identifier, attribs;
10735 /* Look for the `namespace' keyword. */
10736 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10738 /* Get the name of the namespace. We do not attempt to distinguish
10739 between an original-namespace-definition and an
10740 extension-namespace-definition at this point. The semantic
10741 analysis routines are responsible for that. */
10742 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10743 identifier = cp_parser_identifier (parser);
10745 identifier = NULL_TREE;
10747 /* Parse any specified attributes. */
10748 attribs = cp_parser_attributes_opt (parser);
10750 /* Look for the `{' to start the namespace. */
10751 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10752 /* Start the namespace. */
10753 push_namespace_with_attribs (identifier, attribs);
10754 /* Parse the body of the namespace. */
10755 cp_parser_namespace_body (parser);
10756 /* Finish the namespace. */
10758 /* Look for the final `}'. */
10759 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10762 /* Parse a namespace-body.
10765 declaration-seq [opt] */
10768 cp_parser_namespace_body (cp_parser* parser)
10770 cp_parser_declaration_seq_opt (parser);
10773 /* Parse a namespace-alias-definition.
10775 namespace-alias-definition:
10776 namespace identifier = qualified-namespace-specifier ; */
10779 cp_parser_namespace_alias_definition (cp_parser* parser)
10782 tree namespace_specifier;
10784 /* Look for the `namespace' keyword. */
10785 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10786 /* Look for the identifier. */
10787 identifier = cp_parser_identifier (parser);
10788 if (identifier == error_mark_node)
10790 /* Look for the `=' token. */
10791 cp_parser_require (parser, CPP_EQ, "`='");
10792 /* Look for the qualified-namespace-specifier. */
10793 namespace_specifier
10794 = cp_parser_qualified_namespace_specifier (parser);
10795 /* Look for the `;' token. */
10796 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10798 /* Register the alias in the symbol table. */
10799 do_namespace_alias (identifier, namespace_specifier);
10802 /* Parse a qualified-namespace-specifier.
10804 qualified-namespace-specifier:
10805 :: [opt] nested-name-specifier [opt] namespace-name
10807 Returns a NAMESPACE_DECL corresponding to the specified
10811 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10813 /* Look for the optional `::'. */
10814 cp_parser_global_scope_opt (parser,
10815 /*current_scope_valid_p=*/false);
10817 /* Look for the optional nested-name-specifier. */
10818 cp_parser_nested_name_specifier_opt (parser,
10819 /*typename_keyword_p=*/false,
10820 /*check_dependency_p=*/true,
10822 /*is_declaration=*/true);
10824 return cp_parser_namespace_name (parser);
10827 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
10828 access declaration.
10831 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10832 using :: unqualified-id ;
10834 access-declaration:
10840 cp_parser_using_declaration (cp_parser* parser,
10841 bool access_declaration_p)
10844 bool typename_p = false;
10845 bool global_scope_p;
10850 if (access_declaration_p)
10851 cp_parser_parse_tentatively (parser);
10854 /* Look for the `using' keyword. */
10855 cp_parser_require_keyword (parser, RID_USING, "`using'");
10857 /* Peek at the next token. */
10858 token = cp_lexer_peek_token (parser->lexer);
10859 /* See if it's `typename'. */
10860 if (token->keyword == RID_TYPENAME)
10862 /* Remember that we've seen it. */
10864 /* Consume the `typename' token. */
10865 cp_lexer_consume_token (parser->lexer);
10869 /* Look for the optional global scope qualification. */
10871 = (cp_parser_global_scope_opt (parser,
10872 /*current_scope_valid_p=*/false)
10875 /* If we saw `typename', or didn't see `::', then there must be a
10876 nested-name-specifier present. */
10877 if (typename_p || !global_scope_p)
10878 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10879 /*check_dependency_p=*/true,
10881 /*is_declaration=*/true);
10882 /* Otherwise, we could be in either of the two productions. In that
10883 case, treat the nested-name-specifier as optional. */
10885 qscope = cp_parser_nested_name_specifier_opt (parser,
10886 /*typename_keyword_p=*/false,
10887 /*check_dependency_p=*/true,
10889 /*is_declaration=*/true);
10891 qscope = global_namespace;
10893 if (access_declaration_p && cp_parser_error_occurred (parser))
10894 /* Something has already gone wrong; there's no need to parse
10895 further. Since an error has occurred, the return value of
10896 cp_parser_parse_definitely will be false, as required. */
10897 return cp_parser_parse_definitely (parser);
10899 /* Parse the unqualified-id. */
10900 identifier = cp_parser_unqualified_id (parser,
10901 /*template_keyword_p=*/false,
10902 /*check_dependency_p=*/true,
10903 /*declarator_p=*/true,
10904 /*optional_p=*/false);
10906 if (access_declaration_p)
10908 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
10909 cp_parser_simulate_error (parser);
10910 if (!cp_parser_parse_definitely (parser))
10914 /* The function we call to handle a using-declaration is different
10915 depending on what scope we are in. */
10916 if (qscope == error_mark_node || identifier == error_mark_node)
10918 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10919 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10920 /* [namespace.udecl]
10922 A using declaration shall not name a template-id. */
10923 error ("a template-id may not appear in a using-declaration");
10926 if (at_class_scope_p ())
10928 /* Create the USING_DECL. */
10929 decl = do_class_using_decl (parser->scope, identifier);
10930 /* Add it to the list of members in this class. */
10931 finish_member_declaration (decl);
10935 decl = cp_parser_lookup_name_simple (parser, identifier);
10936 if (decl == error_mark_node)
10937 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10938 else if (!at_namespace_scope_p ())
10939 do_local_using_decl (decl, qscope, identifier);
10941 do_toplevel_using_decl (decl, qscope, identifier);
10945 /* Look for the final `;'. */
10946 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10951 /* Parse a using-directive.
10954 using namespace :: [opt] nested-name-specifier [opt]
10955 namespace-name ; */
10958 cp_parser_using_directive (cp_parser* parser)
10960 tree namespace_decl;
10963 /* Look for the `using' keyword. */
10964 cp_parser_require_keyword (parser, RID_USING, "`using'");
10965 /* And the `namespace' keyword. */
10966 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10967 /* Look for the optional `::' operator. */
10968 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10969 /* And the optional nested-name-specifier. */
10970 cp_parser_nested_name_specifier_opt (parser,
10971 /*typename_keyword_p=*/false,
10972 /*check_dependency_p=*/true,
10974 /*is_declaration=*/true);
10975 /* Get the namespace being used. */
10976 namespace_decl = cp_parser_namespace_name (parser);
10977 /* And any specified attributes. */
10978 attribs = cp_parser_attributes_opt (parser);
10979 /* Update the symbol table. */
10980 parse_using_directive (namespace_decl, attribs);
10981 /* Look for the final `;'. */
10982 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10985 /* Parse an asm-definition.
10988 asm ( string-literal ) ;
10993 asm volatile [opt] ( string-literal ) ;
10994 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10995 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10996 : asm-operand-list [opt] ) ;
10997 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10998 : asm-operand-list [opt]
10999 : asm-operand-list [opt] ) ; */
11002 cp_parser_asm_definition (cp_parser* parser)
11005 tree outputs = NULL_TREE;
11006 tree inputs = NULL_TREE;
11007 tree clobbers = NULL_TREE;
11009 bool volatile_p = false;
11010 bool extended_p = false;
11012 /* Look for the `asm' keyword. */
11013 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
11014 /* See if the next token is `volatile'. */
11015 if (cp_parser_allow_gnu_extensions_p (parser)
11016 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
11018 /* Remember that we saw the `volatile' keyword. */
11020 /* Consume the token. */
11021 cp_lexer_consume_token (parser->lexer);
11023 /* Look for the opening `('. */
11024 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
11026 /* Look for the string. */
11027 string = cp_parser_string_literal (parser, false, false);
11028 if (string == error_mark_node)
11030 cp_parser_skip_to_closing_parenthesis (parser, true, false,
11031 /*consume_paren=*/true);
11035 /* If we're allowing GNU extensions, check for the extended assembly
11036 syntax. Unfortunately, the `:' tokens need not be separated by
11037 a space in C, and so, for compatibility, we tolerate that here
11038 too. Doing that means that we have to treat the `::' operator as
11040 if (cp_parser_allow_gnu_extensions_p (parser)
11041 && parser->in_function_body
11042 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
11043 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
11045 bool inputs_p = false;
11046 bool clobbers_p = false;
11048 /* The extended syntax was used. */
11051 /* Look for outputs. */
11052 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11054 /* Consume the `:'. */
11055 cp_lexer_consume_token (parser->lexer);
11056 /* Parse the output-operands. */
11057 if (cp_lexer_next_token_is_not (parser->lexer,
11059 && cp_lexer_next_token_is_not (parser->lexer,
11061 && cp_lexer_next_token_is_not (parser->lexer,
11063 outputs = cp_parser_asm_operand_list (parser);
11065 /* If the next token is `::', there are no outputs, and the
11066 next token is the beginning of the inputs. */
11067 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
11068 /* The inputs are coming next. */
11071 /* Look for inputs. */
11073 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11075 /* Consume the `:' or `::'. */
11076 cp_lexer_consume_token (parser->lexer);
11077 /* Parse the output-operands. */
11078 if (cp_lexer_next_token_is_not (parser->lexer,
11080 && cp_lexer_next_token_is_not (parser->lexer,
11082 inputs = cp_parser_asm_operand_list (parser);
11084 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
11085 /* The clobbers are coming next. */
11088 /* Look for clobbers. */
11090 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11092 /* Consume the `:' or `::'. */
11093 cp_lexer_consume_token (parser->lexer);
11094 /* Parse the clobbers. */
11095 if (cp_lexer_next_token_is_not (parser->lexer,
11097 clobbers = cp_parser_asm_clobber_list (parser);
11100 /* Look for the closing `)'. */
11101 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11102 cp_parser_skip_to_closing_parenthesis (parser, true, false,
11103 /*consume_paren=*/true);
11104 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
11106 /* Create the ASM_EXPR. */
11107 if (parser->in_function_body)
11109 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
11111 /* If the extended syntax was not used, mark the ASM_EXPR. */
11114 tree temp = asm_stmt;
11115 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
11116 temp = TREE_OPERAND (temp, 0);
11118 ASM_INPUT_P (temp) = 1;
11122 cgraph_add_asm_node (string);
11125 /* Declarators [gram.dcl.decl] */
11127 /* Parse an init-declarator.
11130 declarator initializer [opt]
11135 declarator asm-specification [opt] attributes [opt] initializer [opt]
11137 function-definition:
11138 decl-specifier-seq [opt] declarator ctor-initializer [opt]
11140 decl-specifier-seq [opt] declarator function-try-block
11144 function-definition:
11145 __extension__ function-definition
11147 The DECL_SPECIFIERS apply to this declarator. Returns a
11148 representation of the entity declared. If MEMBER_P is TRUE, then
11149 this declarator appears in a class scope. The new DECL created by
11150 this declarator is returned.
11152 The CHECKS are access checks that should be performed once we know
11153 what entity is being declared (and, therefore, what classes have
11156 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
11157 for a function-definition here as well. If the declarator is a
11158 declarator for a function-definition, *FUNCTION_DEFINITION_P will
11159 be TRUE upon return. By that point, the function-definition will
11160 have been completely parsed.
11162 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
11166 cp_parser_init_declarator (cp_parser* parser,
11167 cp_decl_specifier_seq *decl_specifiers,
11168 VEC (deferred_access_check,gc)* checks,
11169 bool function_definition_allowed_p,
11171 int declares_class_or_enum,
11172 bool* function_definition_p)
11175 cp_declarator *declarator;
11176 tree prefix_attributes;
11178 tree asm_specification;
11180 tree decl = NULL_TREE;
11182 bool is_initialized;
11183 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
11184 initialized with "= ..", CPP_OPEN_PAREN if initialized with
11186 enum cpp_ttype initialization_kind;
11187 bool is_parenthesized_init = false;
11188 bool is_non_constant_init;
11189 int ctor_dtor_or_conv_p;
11191 tree pushed_scope = NULL;
11193 /* Gather the attributes that were provided with the
11194 decl-specifiers. */
11195 prefix_attributes = decl_specifiers->attributes;
11197 /* Assume that this is not the declarator for a function
11199 if (function_definition_p)
11200 *function_definition_p = false;
11202 /* Defer access checks while parsing the declarator; we cannot know
11203 what names are accessible until we know what is being
11205 resume_deferring_access_checks ();
11207 /* Parse the declarator. */
11209 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
11210 &ctor_dtor_or_conv_p,
11211 /*parenthesized_p=*/NULL,
11212 /*member_p=*/false);
11213 /* Gather up the deferred checks. */
11214 stop_deferring_access_checks ();
11216 /* If the DECLARATOR was erroneous, there's no need to go
11218 if (declarator == cp_error_declarator)
11219 return error_mark_node;
11221 /* Check that the number of template-parameter-lists is OK. */
11222 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
11223 return error_mark_node;
11225 if (declares_class_or_enum & 2)
11226 cp_parser_check_for_definition_in_return_type (declarator,
11227 decl_specifiers->type);
11229 /* Figure out what scope the entity declared by the DECLARATOR is
11230 located in. `grokdeclarator' sometimes changes the scope, so
11231 we compute it now. */
11232 scope = get_scope_of_declarator (declarator);
11234 /* If we're allowing GNU extensions, look for an asm-specification
11236 if (cp_parser_allow_gnu_extensions_p (parser))
11238 /* Look for an asm-specification. */
11239 asm_specification = cp_parser_asm_specification_opt (parser);
11240 /* And attributes. */
11241 attributes = cp_parser_attributes_opt (parser);
11245 asm_specification = NULL_TREE;
11246 attributes = NULL_TREE;
11249 /* Peek at the next token. */
11250 token = cp_lexer_peek_token (parser->lexer);
11251 /* Check to see if the token indicates the start of a
11252 function-definition. */
11253 if (cp_parser_token_starts_function_definition_p (token))
11255 if (!function_definition_allowed_p)
11257 /* If a function-definition should not appear here, issue an
11259 cp_parser_error (parser,
11260 "a function-definition is not allowed here");
11261 return error_mark_node;
11265 /* Neither attributes nor an asm-specification are allowed
11266 on a function-definition. */
11267 if (asm_specification)
11268 error ("an asm-specification is not allowed on a function-definition");
11270 error ("attributes are not allowed on a function-definition");
11271 /* This is a function-definition. */
11272 *function_definition_p = true;
11274 /* Parse the function definition. */
11276 decl = cp_parser_save_member_function_body (parser,
11279 prefix_attributes);
11282 = (cp_parser_function_definition_from_specifiers_and_declarator
11283 (parser, decl_specifiers, prefix_attributes, declarator));
11291 Only in function declarations for constructors, destructors, and
11292 type conversions can the decl-specifier-seq be omitted.
11294 We explicitly postpone this check past the point where we handle
11295 function-definitions because we tolerate function-definitions
11296 that are missing their return types in some modes. */
11297 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
11299 cp_parser_error (parser,
11300 "expected constructor, destructor, or type conversion");
11301 return error_mark_node;
11304 /* An `=' or an `(' indicates an initializer. */
11305 if (token->type == CPP_EQ
11306 || token->type == CPP_OPEN_PAREN)
11308 is_initialized = true;
11309 initialization_kind = token->type;
11313 /* If the init-declarator isn't initialized and isn't followed by a
11314 `,' or `;', it's not a valid init-declarator. */
11315 if (token->type != CPP_COMMA
11316 && token->type != CPP_SEMICOLON)
11318 cp_parser_error (parser, "expected initializer");
11319 return error_mark_node;
11321 is_initialized = false;
11322 initialization_kind = CPP_EOF;
11325 /* Because start_decl has side-effects, we should only call it if we
11326 know we're going ahead. By this point, we know that we cannot
11327 possibly be looking at any other construct. */
11328 cp_parser_commit_to_tentative_parse (parser);
11330 /* If the decl specifiers were bad, issue an error now that we're
11331 sure this was intended to be a declarator. Then continue
11332 declaring the variable(s), as int, to try to cut down on further
11334 if (decl_specifiers->any_specifiers_p
11335 && decl_specifiers->type == error_mark_node)
11337 cp_parser_error (parser, "invalid type in declaration");
11338 decl_specifiers->type = integer_type_node;
11341 /* Check to see whether or not this declaration is a friend. */
11342 friend_p = cp_parser_friend_p (decl_specifiers);
11344 /* Enter the newly declared entry in the symbol table. If we're
11345 processing a declaration in a class-specifier, we wait until
11346 after processing the initializer. */
11349 if (parser->in_unbraced_linkage_specification_p)
11350 decl_specifiers->storage_class = sc_extern;
11351 decl = start_decl (declarator, decl_specifiers,
11352 is_initialized, attributes, prefix_attributes,
11356 /* Enter the SCOPE. That way unqualified names appearing in the
11357 initializer will be looked up in SCOPE. */
11358 pushed_scope = push_scope (scope);
11360 /* Perform deferred access control checks, now that we know in which
11361 SCOPE the declared entity resides. */
11362 if (!member_p && decl)
11364 tree saved_current_function_decl = NULL_TREE;
11366 /* If the entity being declared is a function, pretend that we
11367 are in its scope. If it is a `friend', it may have access to
11368 things that would not otherwise be accessible. */
11369 if (TREE_CODE (decl) == FUNCTION_DECL)
11371 saved_current_function_decl = current_function_decl;
11372 current_function_decl = decl;
11375 /* Perform access checks for template parameters. */
11376 cp_parser_perform_template_parameter_access_checks (checks);
11378 /* Perform the access control checks for the declarator and the
11379 the decl-specifiers. */
11380 perform_deferred_access_checks ();
11382 /* Restore the saved value. */
11383 if (TREE_CODE (decl) == FUNCTION_DECL)
11384 current_function_decl = saved_current_function_decl;
11387 /* Parse the initializer. */
11388 initializer = NULL_TREE;
11389 is_parenthesized_init = false;
11390 is_non_constant_init = true;
11391 if (is_initialized)
11393 if (function_declarator_p (declarator))
11395 if (initialization_kind == CPP_EQ)
11396 initializer = cp_parser_pure_specifier (parser);
11399 /* If the declaration was erroneous, we don't really
11400 know what the user intended, so just silently
11401 consume the initializer. */
11402 if (decl != error_mark_node)
11403 error ("initializer provided for function");
11404 cp_parser_skip_to_closing_parenthesis (parser,
11405 /*recovering=*/true,
11406 /*or_comma=*/false,
11407 /*consume_paren=*/true);
11411 initializer = cp_parser_initializer (parser,
11412 &is_parenthesized_init,
11413 &is_non_constant_init);
11416 /* The old parser allows attributes to appear after a parenthesized
11417 initializer. Mark Mitchell proposed removing this functionality
11418 on the GCC mailing lists on 2002-08-13. This parser accepts the
11419 attributes -- but ignores them. */
11420 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
11421 if (cp_parser_attributes_opt (parser))
11422 warning (OPT_Wattributes,
11423 "attributes after parenthesized initializer ignored");
11425 /* For an in-class declaration, use `grokfield' to create the
11431 pop_scope (pushed_scope);
11432 pushed_scope = false;
11434 decl = grokfield (declarator, decl_specifiers,
11435 initializer, !is_non_constant_init,
11436 /*asmspec=*/NULL_TREE,
11437 prefix_attributes);
11438 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
11439 cp_parser_save_default_args (parser, decl);
11442 /* Finish processing the declaration. But, skip friend
11444 if (!friend_p && decl && decl != error_mark_node)
11446 cp_finish_decl (decl,
11447 initializer, !is_non_constant_init,
11449 /* If the initializer is in parentheses, then this is
11450 a direct-initialization, which means that an
11451 `explicit' constructor is OK. Otherwise, an
11452 `explicit' constructor cannot be used. */
11453 ((is_parenthesized_init || !is_initialized)
11454 ? 0 : LOOKUP_ONLYCONVERTING));
11456 if (!friend_p && pushed_scope)
11457 pop_scope (pushed_scope);
11462 /* Parse a declarator.
11466 ptr-operator declarator
11468 abstract-declarator:
11469 ptr-operator abstract-declarator [opt]
11470 direct-abstract-declarator
11475 attributes [opt] direct-declarator
11476 attributes [opt] ptr-operator declarator
11478 abstract-declarator:
11479 attributes [opt] ptr-operator abstract-declarator [opt]
11480 attributes [opt] direct-abstract-declarator
11482 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
11483 detect constructor, destructor or conversion operators. It is set
11484 to -1 if the declarator is a name, and +1 if it is a
11485 function. Otherwise it is set to zero. Usually you just want to
11486 test for >0, but internally the negative value is used.
11488 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
11489 a decl-specifier-seq unless it declares a constructor, destructor,
11490 or conversion. It might seem that we could check this condition in
11491 semantic analysis, rather than parsing, but that makes it difficult
11492 to handle something like `f()'. We want to notice that there are
11493 no decl-specifiers, and therefore realize that this is an
11494 expression, not a declaration.)
11496 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
11497 the declarator is a direct-declarator of the form "(...)".
11499 MEMBER_P is true iff this declarator is a member-declarator. */
11501 static cp_declarator *
11502 cp_parser_declarator (cp_parser* parser,
11503 cp_parser_declarator_kind dcl_kind,
11504 int* ctor_dtor_or_conv_p,
11505 bool* parenthesized_p,
11509 cp_declarator *declarator;
11510 enum tree_code code;
11511 cp_cv_quals cv_quals;
11513 tree attributes = NULL_TREE;
11515 /* Assume this is not a constructor, destructor, or type-conversion
11517 if (ctor_dtor_or_conv_p)
11518 *ctor_dtor_or_conv_p = 0;
11520 if (cp_parser_allow_gnu_extensions_p (parser))
11521 attributes = cp_parser_attributes_opt (parser);
11523 /* Peek at the next token. */
11524 token = cp_lexer_peek_token (parser->lexer);
11526 /* Check for the ptr-operator production. */
11527 cp_parser_parse_tentatively (parser);
11528 /* Parse the ptr-operator. */
11529 code = cp_parser_ptr_operator (parser,
11532 /* If that worked, then we have a ptr-operator. */
11533 if (cp_parser_parse_definitely (parser))
11535 /* If a ptr-operator was found, then this declarator was not
11537 if (parenthesized_p)
11538 *parenthesized_p = true;
11539 /* The dependent declarator is optional if we are parsing an
11540 abstract-declarator. */
11541 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11542 cp_parser_parse_tentatively (parser);
11544 /* Parse the dependent declarator. */
11545 declarator = cp_parser_declarator (parser, dcl_kind,
11546 /*ctor_dtor_or_conv_p=*/NULL,
11547 /*parenthesized_p=*/NULL,
11548 /*member_p=*/false);
11550 /* If we are parsing an abstract-declarator, we must handle the
11551 case where the dependent declarator is absent. */
11552 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
11553 && !cp_parser_parse_definitely (parser))
11556 /* Build the representation of the ptr-operator. */
11558 declarator = make_ptrmem_declarator (cv_quals,
11561 else if (code == INDIRECT_REF)
11562 declarator = make_pointer_declarator (cv_quals, declarator);
11564 declarator = make_reference_declarator (cv_quals, declarator);
11566 /* Everything else is a direct-declarator. */
11569 if (parenthesized_p)
11570 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
11572 declarator = cp_parser_direct_declarator (parser, dcl_kind,
11573 ctor_dtor_or_conv_p,
11577 if (attributes && declarator && declarator != cp_error_declarator)
11578 declarator->attributes = attributes;
11583 /* Parse a direct-declarator or direct-abstract-declarator.
11587 direct-declarator ( parameter-declaration-clause )
11588 cv-qualifier-seq [opt]
11589 exception-specification [opt]
11590 direct-declarator [ constant-expression [opt] ]
11593 direct-abstract-declarator:
11594 direct-abstract-declarator [opt]
11595 ( parameter-declaration-clause )
11596 cv-qualifier-seq [opt]
11597 exception-specification [opt]
11598 direct-abstract-declarator [opt] [ constant-expression [opt] ]
11599 ( abstract-declarator )
11601 Returns a representation of the declarator. DCL_KIND is
11602 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
11603 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
11604 we are parsing a direct-declarator. It is
11605 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
11606 of ambiguity we prefer an abstract declarator, as per
11607 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
11608 cp_parser_declarator. */
11610 static cp_declarator *
11611 cp_parser_direct_declarator (cp_parser* parser,
11612 cp_parser_declarator_kind dcl_kind,
11613 int* ctor_dtor_or_conv_p,
11617 cp_declarator *declarator = NULL;
11618 tree scope = NULL_TREE;
11619 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11620 bool saved_in_declarator_p = parser->in_declarator_p;
11622 tree pushed_scope = NULL_TREE;
11626 /* Peek at the next token. */
11627 token = cp_lexer_peek_token (parser->lexer);
11628 if (token->type == CPP_OPEN_PAREN)
11630 /* This is either a parameter-declaration-clause, or a
11631 parenthesized declarator. When we know we are parsing a
11632 named declarator, it must be a parenthesized declarator
11633 if FIRST is true. For instance, `(int)' is a
11634 parameter-declaration-clause, with an omitted
11635 direct-abstract-declarator. But `((*))', is a
11636 parenthesized abstract declarator. Finally, when T is a
11637 template parameter `(T)' is a
11638 parameter-declaration-clause, and not a parenthesized
11641 We first try and parse a parameter-declaration-clause,
11642 and then try a nested declarator (if FIRST is true).
11644 It is not an error for it not to be a
11645 parameter-declaration-clause, even when FIRST is
11651 The first is the declaration of a function while the
11652 second is a the definition of a variable, including its
11655 Having seen only the parenthesis, we cannot know which of
11656 these two alternatives should be selected. Even more
11657 complex are examples like:
11662 The former is a function-declaration; the latter is a
11663 variable initialization.
11665 Thus again, we try a parameter-declaration-clause, and if
11666 that fails, we back out and return. */
11668 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11670 cp_parameter_declarator *params;
11671 unsigned saved_num_template_parameter_lists;
11673 /* In a member-declarator, the only valid interpretation
11674 of a parenthesis is the start of a
11675 parameter-declaration-clause. (It is invalid to
11676 initialize a static data member with a parenthesized
11677 initializer; only the "=" form of initialization is
11680 cp_parser_parse_tentatively (parser);
11682 /* Consume the `('. */
11683 cp_lexer_consume_token (parser->lexer);
11686 /* If this is going to be an abstract declarator, we're
11687 in a declarator and we can't have default args. */
11688 parser->default_arg_ok_p = false;
11689 parser->in_declarator_p = true;
11692 /* Inside the function parameter list, surrounding
11693 template-parameter-lists do not apply. */
11694 saved_num_template_parameter_lists
11695 = parser->num_template_parameter_lists;
11696 parser->num_template_parameter_lists = 0;
11698 /* Parse the parameter-declaration-clause. */
11699 params = cp_parser_parameter_declaration_clause (parser);
11701 parser->num_template_parameter_lists
11702 = saved_num_template_parameter_lists;
11704 /* If all went well, parse the cv-qualifier-seq and the
11705 exception-specification. */
11706 if (member_p || cp_parser_parse_definitely (parser))
11708 cp_cv_quals cv_quals;
11709 tree exception_specification;
11711 if (ctor_dtor_or_conv_p)
11712 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
11714 /* Consume the `)'. */
11715 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
11717 /* Parse the cv-qualifier-seq. */
11718 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11719 /* And the exception-specification. */
11720 exception_specification
11721 = cp_parser_exception_specification_opt (parser);
11723 /* Create the function-declarator. */
11724 declarator = make_call_declarator (declarator,
11727 exception_specification);
11728 /* Any subsequent parameter lists are to do with
11729 return type, so are not those of the declared
11731 parser->default_arg_ok_p = false;
11733 /* Repeat the main loop. */
11738 /* If this is the first, we can try a parenthesized
11742 bool saved_in_type_id_in_expr_p;
11744 parser->default_arg_ok_p = saved_default_arg_ok_p;
11745 parser->in_declarator_p = saved_in_declarator_p;
11747 /* Consume the `('. */
11748 cp_lexer_consume_token (parser->lexer);
11749 /* Parse the nested declarator. */
11750 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
11751 parser->in_type_id_in_expr_p = true;
11753 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
11754 /*parenthesized_p=*/NULL,
11756 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
11758 /* Expect a `)'. */
11759 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11760 declarator = cp_error_declarator;
11761 if (declarator == cp_error_declarator)
11764 goto handle_declarator;
11766 /* Otherwise, we must be done. */
11770 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11771 && token->type == CPP_OPEN_SQUARE)
11773 /* Parse an array-declarator. */
11776 if (ctor_dtor_or_conv_p)
11777 *ctor_dtor_or_conv_p = 0;
11780 parser->default_arg_ok_p = false;
11781 parser->in_declarator_p = true;
11782 /* Consume the `['. */
11783 cp_lexer_consume_token (parser->lexer);
11784 /* Peek at the next token. */
11785 token = cp_lexer_peek_token (parser->lexer);
11786 /* If the next token is `]', then there is no
11787 constant-expression. */
11788 if (token->type != CPP_CLOSE_SQUARE)
11790 bool non_constant_p;
11793 = cp_parser_constant_expression (parser,
11794 /*allow_non_constant=*/true,
11796 if (!non_constant_p)
11797 bounds = fold_non_dependent_expr (bounds);
11798 /* Normally, the array bound must be an integral constant
11799 expression. However, as an extension, we allow VLAs
11800 in function scopes. */
11801 else if (!parser->in_function_body)
11803 error ("array bound is not an integer constant");
11804 bounds = error_mark_node;
11808 bounds = NULL_TREE;
11809 /* Look for the closing `]'. */
11810 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11812 declarator = cp_error_declarator;
11816 declarator = make_array_declarator (declarator, bounds);
11818 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11820 tree qualifying_scope;
11821 tree unqualified_name;
11822 special_function_kind sfk;
11825 /* Parse a declarator-id */
11826 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
11828 cp_parser_parse_tentatively (parser);
11830 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
11831 qualifying_scope = parser->scope;
11834 if (!cp_parser_parse_definitely (parser))
11835 unqualified_name = error_mark_node;
11836 else if (unqualified_name
11837 && (qualifying_scope
11838 || (TREE_CODE (unqualified_name)
11839 != IDENTIFIER_NODE)))
11841 cp_parser_error (parser, "expected unqualified-id");
11842 unqualified_name = error_mark_node;
11846 if (!unqualified_name)
11848 if (unqualified_name == error_mark_node)
11850 declarator = cp_error_declarator;
11854 if (qualifying_scope && at_namespace_scope_p ()
11855 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
11857 /* In the declaration of a member of a template class
11858 outside of the class itself, the SCOPE will sometimes
11859 be a TYPENAME_TYPE. For example, given:
11861 template <typename T>
11862 int S<T>::R::i = 3;
11864 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11865 this context, we must resolve S<T>::R to an ordinary
11866 type, rather than a typename type.
11868 The reason we normally avoid resolving TYPENAME_TYPEs
11869 is that a specialization of `S' might render
11870 `S<T>::R' not a type. However, if `S' is
11871 specialized, then this `i' will not be used, so there
11872 is no harm in resolving the types here. */
11875 /* Resolve the TYPENAME_TYPE. */
11876 type = resolve_typename_type (qualifying_scope,
11877 /*only_current_p=*/false);
11878 /* If that failed, the declarator is invalid. */
11879 if (type == error_mark_node)
11880 error ("%<%T::%D%> is not a type",
11881 TYPE_CONTEXT (qualifying_scope),
11882 TYPE_IDENTIFIER (qualifying_scope));
11883 qualifying_scope = type;
11887 if (unqualified_name)
11891 if (qualifying_scope
11892 && CLASS_TYPE_P (qualifying_scope))
11893 class_type = qualifying_scope;
11895 class_type = current_class_type;
11897 if (TREE_CODE (unqualified_name) == TYPE_DECL)
11899 tree name_type = TREE_TYPE (unqualified_name);
11900 if (class_type && same_type_p (name_type, class_type))
11902 if (qualifying_scope
11903 && CLASSTYPE_USE_TEMPLATE (name_type))
11905 error ("invalid use of constructor as a template");
11906 inform ("use %<%T::%D%> instead of %<%T::%D%> to "
11907 "name the constructor in a qualified name",
11909 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11910 class_type, name_type);
11911 declarator = cp_error_declarator;
11915 unqualified_name = constructor_name (class_type);
11919 /* We do not attempt to print the declarator
11920 here because we do not have enough
11921 information about its original syntactic
11923 cp_parser_error (parser, "invalid declarator");
11924 declarator = cp_error_declarator;
11931 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11932 sfk = sfk_destructor;
11933 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11934 sfk = sfk_conversion;
11935 else if (/* There's no way to declare a constructor
11936 for an anonymous type, even if the type
11937 got a name for linkage purposes. */
11938 !TYPE_WAS_ANONYMOUS (class_type)
11939 && constructor_name_p (unqualified_name,
11942 unqualified_name = constructor_name (class_type);
11943 sfk = sfk_constructor;
11946 if (ctor_dtor_or_conv_p && sfk != sfk_none)
11947 *ctor_dtor_or_conv_p = -1;
11950 declarator = make_id_declarator (qualifying_scope,
11953 declarator->id_loc = token->location;
11955 handle_declarator:;
11956 scope = get_scope_of_declarator (declarator);
11958 /* Any names that appear after the declarator-id for a
11959 member are looked up in the containing scope. */
11960 pushed_scope = push_scope (scope);
11961 parser->in_declarator_p = true;
11962 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11963 || (declarator && declarator->kind == cdk_id))
11964 /* Default args are only allowed on function
11966 parser->default_arg_ok_p = saved_default_arg_ok_p;
11968 parser->default_arg_ok_p = false;
11977 /* For an abstract declarator, we might wind up with nothing at this
11978 point. That's an error; the declarator is not optional. */
11980 cp_parser_error (parser, "expected declarator");
11982 /* If we entered a scope, we must exit it now. */
11984 pop_scope (pushed_scope);
11986 parser->default_arg_ok_p = saved_default_arg_ok_p;
11987 parser->in_declarator_p = saved_in_declarator_p;
11992 /* Parse a ptr-operator.
11995 * cv-qualifier-seq [opt]
11997 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
12002 & cv-qualifier-seq [opt]
12004 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
12005 Returns ADDR_EXPR if a reference was used. In the case of a
12006 pointer-to-member, *TYPE is filled in with the TYPE containing the
12007 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
12008 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
12009 ERROR_MARK if an error occurred. */
12011 static enum tree_code
12012 cp_parser_ptr_operator (cp_parser* parser,
12014 cp_cv_quals *cv_quals)
12016 enum tree_code code = ERROR_MARK;
12019 /* Assume that it's not a pointer-to-member. */
12021 /* And that there are no cv-qualifiers. */
12022 *cv_quals = TYPE_UNQUALIFIED;
12024 /* Peek at the next token. */
12025 token = cp_lexer_peek_token (parser->lexer);
12026 /* If it's a `*' or `&' we have a pointer or reference. */
12027 if (token->type == CPP_MULT || token->type == CPP_AND)
12029 /* Remember which ptr-operator we were processing. */
12030 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
12032 /* Consume the `*' or `&'. */
12033 cp_lexer_consume_token (parser->lexer);
12035 /* A `*' can be followed by a cv-qualifier-seq, and so can a
12036 `&', if we are allowing GNU extensions. (The only qualifier
12037 that can legally appear after `&' is `restrict', but that is
12038 enforced during semantic analysis. */
12039 if (code == INDIRECT_REF
12040 || cp_parser_allow_gnu_extensions_p (parser))
12041 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
12045 /* Try the pointer-to-member case. */
12046 cp_parser_parse_tentatively (parser);
12047 /* Look for the optional `::' operator. */
12048 cp_parser_global_scope_opt (parser,
12049 /*current_scope_valid_p=*/false);
12050 /* Look for the nested-name specifier. */
12051 cp_parser_nested_name_specifier (parser,
12052 /*typename_keyword_p=*/false,
12053 /*check_dependency_p=*/true,
12055 /*is_declaration=*/false);
12056 /* If we found it, and the next token is a `*', then we are
12057 indeed looking at a pointer-to-member operator. */
12058 if (!cp_parser_error_occurred (parser)
12059 && cp_parser_require (parser, CPP_MULT, "`*'"))
12061 /* Indicate that the `*' operator was used. */
12062 code = INDIRECT_REF;
12064 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
12065 error ("%qD is a namespace", parser->scope);
12068 /* The type of which the member is a member is given by the
12070 *type = parser->scope;
12071 /* The next name will not be qualified. */
12072 parser->scope = NULL_TREE;
12073 parser->qualifying_scope = NULL_TREE;
12074 parser->object_scope = NULL_TREE;
12075 /* Look for the optional cv-qualifier-seq. */
12076 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
12079 /* If that didn't work we don't have a ptr-operator. */
12080 if (!cp_parser_parse_definitely (parser))
12081 cp_parser_error (parser, "expected ptr-operator");
12087 /* Parse an (optional) cv-qualifier-seq.
12090 cv-qualifier cv-qualifier-seq [opt]
12101 Returns a bitmask representing the cv-qualifiers. */
12104 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
12106 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
12111 cp_cv_quals cv_qualifier;
12113 /* Peek at the next token. */
12114 token = cp_lexer_peek_token (parser->lexer);
12115 /* See if it's a cv-qualifier. */
12116 switch (token->keyword)
12119 cv_qualifier = TYPE_QUAL_CONST;
12123 cv_qualifier = TYPE_QUAL_VOLATILE;
12127 cv_qualifier = TYPE_QUAL_RESTRICT;
12131 cv_qualifier = TYPE_UNQUALIFIED;
12138 if (cv_quals & cv_qualifier)
12140 error ("duplicate cv-qualifier");
12141 cp_lexer_purge_token (parser->lexer);
12145 cp_lexer_consume_token (parser->lexer);
12146 cv_quals |= cv_qualifier;
12153 /* Parse a declarator-id.
12157 :: [opt] nested-name-specifier [opt] type-name
12159 In the `id-expression' case, the value returned is as for
12160 cp_parser_id_expression if the id-expression was an unqualified-id.
12161 If the id-expression was a qualified-id, then a SCOPE_REF is
12162 returned. The first operand is the scope (either a NAMESPACE_DECL
12163 or TREE_TYPE), but the second is still just a representation of an
12167 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
12170 /* The expression must be an id-expression. Assume that qualified
12171 names are the names of types so that:
12174 int S<T>::R::i = 3;
12176 will work; we must treat `S<T>::R' as the name of a type.
12177 Similarly, assume that qualified names are templates, where
12181 int S<T>::R<T>::i = 3;
12184 id = cp_parser_id_expression (parser,
12185 /*template_keyword_p=*/false,
12186 /*check_dependency_p=*/false,
12187 /*template_p=*/NULL,
12188 /*declarator_p=*/true,
12190 if (id && BASELINK_P (id))
12191 id = BASELINK_FUNCTIONS (id);
12195 /* Parse a type-id.
12198 type-specifier-seq abstract-declarator [opt]
12200 Returns the TYPE specified. */
12203 cp_parser_type_id (cp_parser* parser)
12205 cp_decl_specifier_seq type_specifier_seq;
12206 cp_declarator *abstract_declarator;
12208 /* Parse the type-specifier-seq. */
12209 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
12210 &type_specifier_seq);
12211 if (type_specifier_seq.type == error_mark_node)
12212 return error_mark_node;
12214 /* There might or might not be an abstract declarator. */
12215 cp_parser_parse_tentatively (parser);
12216 /* Look for the declarator. */
12217 abstract_declarator
12218 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
12219 /*parenthesized_p=*/NULL,
12220 /*member_p=*/false);
12221 /* Check to see if there really was a declarator. */
12222 if (!cp_parser_parse_definitely (parser))
12223 abstract_declarator = NULL;
12225 return groktypename (&type_specifier_seq, abstract_declarator);
12228 /* Parse a type-specifier-seq.
12230 type-specifier-seq:
12231 type-specifier type-specifier-seq [opt]
12235 type-specifier-seq:
12236 attributes type-specifier-seq [opt]
12238 If IS_CONDITION is true, we are at the start of a "condition",
12239 e.g., we've just seen "if (".
12241 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
12244 cp_parser_type_specifier_seq (cp_parser* parser,
12246 cp_decl_specifier_seq *type_specifier_seq)
12248 bool seen_type_specifier = false;
12249 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
12251 /* Clear the TYPE_SPECIFIER_SEQ. */
12252 clear_decl_specs (type_specifier_seq);
12254 /* Parse the type-specifiers and attributes. */
12257 tree type_specifier;
12258 bool is_cv_qualifier;
12260 /* Check for attributes first. */
12261 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
12263 type_specifier_seq->attributes =
12264 chainon (type_specifier_seq->attributes,
12265 cp_parser_attributes_opt (parser));
12269 /* Look for the type-specifier. */
12270 type_specifier = cp_parser_type_specifier (parser,
12272 type_specifier_seq,
12273 /*is_declaration=*/false,
12276 if (!type_specifier)
12278 /* If the first type-specifier could not be found, this is not a
12279 type-specifier-seq at all. */
12280 if (!seen_type_specifier)
12282 cp_parser_error (parser, "expected type-specifier");
12283 type_specifier_seq->type = error_mark_node;
12286 /* If subsequent type-specifiers could not be found, the
12287 type-specifier-seq is complete. */
12291 seen_type_specifier = true;
12292 /* The standard says that a condition can be:
12294 type-specifier-seq declarator = assignment-expression
12301 we should treat the "S" as a declarator, not as a
12302 type-specifier. The standard doesn't say that explicitly for
12303 type-specifier-seq, but it does say that for
12304 decl-specifier-seq in an ordinary declaration. Perhaps it
12305 would be clearer just to allow a decl-specifier-seq here, and
12306 then add a semantic restriction that if any decl-specifiers
12307 that are not type-specifiers appear, the program is invalid. */
12308 if (is_condition && !is_cv_qualifier)
12309 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
12312 cp_parser_check_decl_spec (type_specifier_seq);
12315 /* Parse a parameter-declaration-clause.
12317 parameter-declaration-clause:
12318 parameter-declaration-list [opt] ... [opt]
12319 parameter-declaration-list , ...
12321 Returns a representation for the parameter declarations. A return
12322 value of NULL indicates a parameter-declaration-clause consisting
12323 only of an ellipsis. */
12325 static cp_parameter_declarator *
12326 cp_parser_parameter_declaration_clause (cp_parser* parser)
12328 cp_parameter_declarator *parameters;
12333 /* Peek at the next token. */
12334 token = cp_lexer_peek_token (parser->lexer);
12335 /* Check for trivial parameter-declaration-clauses. */
12336 if (token->type == CPP_ELLIPSIS)
12338 /* Consume the `...' token. */
12339 cp_lexer_consume_token (parser->lexer);
12342 else if (token->type == CPP_CLOSE_PAREN)
12343 /* There are no parameters. */
12345 #ifndef NO_IMPLICIT_EXTERN_C
12346 if (in_system_header && current_class_type == NULL
12347 && current_lang_name == lang_name_c)
12351 return no_parameters;
12353 /* Check for `(void)', too, which is a special case. */
12354 else if (token->keyword == RID_VOID
12355 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
12356 == CPP_CLOSE_PAREN))
12358 /* Consume the `void' token. */
12359 cp_lexer_consume_token (parser->lexer);
12360 /* There are no parameters. */
12361 return no_parameters;
12364 /* Parse the parameter-declaration-list. */
12365 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
12366 /* If a parse error occurred while parsing the
12367 parameter-declaration-list, then the entire
12368 parameter-declaration-clause is erroneous. */
12372 /* Peek at the next token. */
12373 token = cp_lexer_peek_token (parser->lexer);
12374 /* If it's a `,', the clause should terminate with an ellipsis. */
12375 if (token->type == CPP_COMMA)
12377 /* Consume the `,'. */
12378 cp_lexer_consume_token (parser->lexer);
12379 /* Expect an ellipsis. */
12381 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
12383 /* It might also be `...' if the optional trailing `,' was
12385 else if (token->type == CPP_ELLIPSIS)
12387 /* Consume the `...' token. */
12388 cp_lexer_consume_token (parser->lexer);
12389 /* And remember that we saw it. */
12393 ellipsis_p = false;
12395 /* Finish the parameter list. */
12396 if (parameters && ellipsis_p)
12397 parameters->ellipsis_p = true;
12402 /* Parse a parameter-declaration-list.
12404 parameter-declaration-list:
12405 parameter-declaration
12406 parameter-declaration-list , parameter-declaration
12408 Returns a representation of the parameter-declaration-list, as for
12409 cp_parser_parameter_declaration_clause. However, the
12410 `void_list_node' is never appended to the list. Upon return,
12411 *IS_ERROR will be true iff an error occurred. */
12413 static cp_parameter_declarator *
12414 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
12416 cp_parameter_declarator *parameters = NULL;
12417 cp_parameter_declarator **tail = ¶meters;
12418 bool saved_in_unbraced_linkage_specification_p;
12420 /* Assume all will go well. */
12422 /* The special considerations that apply to a function within an
12423 unbraced linkage specifications do not apply to the parameters
12424 to the function. */
12425 saved_in_unbraced_linkage_specification_p
12426 = parser->in_unbraced_linkage_specification_p;
12427 parser->in_unbraced_linkage_specification_p = false;
12429 /* Look for more parameters. */
12432 cp_parameter_declarator *parameter;
12433 bool parenthesized_p;
12434 /* Parse the parameter. */
12436 = cp_parser_parameter_declaration (parser,
12437 /*template_parm_p=*/false,
12440 /* If a parse error occurred parsing the parameter declaration,
12441 then the entire parameter-declaration-list is erroneous. */
12448 /* Add the new parameter to the list. */
12450 tail = ¶meter->next;
12452 /* Peek at the next token. */
12453 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
12454 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
12455 /* These are for Objective-C++ */
12456 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
12457 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
12458 /* The parameter-declaration-list is complete. */
12460 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12464 /* Peek at the next token. */
12465 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12466 /* If it's an ellipsis, then the list is complete. */
12467 if (token->type == CPP_ELLIPSIS)
12469 /* Otherwise, there must be more parameters. Consume the
12471 cp_lexer_consume_token (parser->lexer);
12472 /* When parsing something like:
12474 int i(float f, double d)
12476 we can tell after seeing the declaration for "f" that we
12477 are not looking at an initialization of a variable "i",
12478 but rather at the declaration of a function "i".
12480 Due to the fact that the parsing of template arguments
12481 (as specified to a template-id) requires backtracking we
12482 cannot use this technique when inside a template argument
12484 if (!parser->in_template_argument_list_p
12485 && !parser->in_type_id_in_expr_p
12486 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12487 /* However, a parameter-declaration of the form
12488 "foat(f)" (which is a valid declaration of a
12489 parameter "f") can also be interpreted as an
12490 expression (the conversion of "f" to "float"). */
12491 && !parenthesized_p)
12492 cp_parser_commit_to_tentative_parse (parser);
12496 cp_parser_error (parser, "expected %<,%> or %<...%>");
12497 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
12498 cp_parser_skip_to_closing_parenthesis (parser,
12499 /*recovering=*/true,
12500 /*or_comma=*/false,
12501 /*consume_paren=*/false);
12506 parser->in_unbraced_linkage_specification_p
12507 = saved_in_unbraced_linkage_specification_p;
12512 /* Parse a parameter declaration.
12514 parameter-declaration:
12515 decl-specifier-seq declarator
12516 decl-specifier-seq declarator = assignment-expression
12517 decl-specifier-seq abstract-declarator [opt]
12518 decl-specifier-seq abstract-declarator [opt] = assignment-expression
12520 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
12521 declares a template parameter. (In that case, a non-nested `>'
12522 token encountered during the parsing of the assignment-expression
12523 is not interpreted as a greater-than operator.)
12525 Returns a representation of the parameter, or NULL if an error
12526 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
12527 true iff the declarator is of the form "(p)". */
12529 static cp_parameter_declarator *
12530 cp_parser_parameter_declaration (cp_parser *parser,
12531 bool template_parm_p,
12532 bool *parenthesized_p)
12534 int declares_class_or_enum;
12535 bool greater_than_is_operator_p;
12536 cp_decl_specifier_seq decl_specifiers;
12537 cp_declarator *declarator;
12538 tree default_argument;
12540 const char *saved_message;
12542 /* In a template parameter, `>' is not an operator.
12546 When parsing a default template-argument for a non-type
12547 template-parameter, the first non-nested `>' is taken as the end
12548 of the template parameter-list rather than a greater-than
12550 greater_than_is_operator_p = !template_parm_p;
12552 /* Type definitions may not appear in parameter types. */
12553 saved_message = parser->type_definition_forbidden_message;
12554 parser->type_definition_forbidden_message
12555 = "types may not be defined in parameter types";
12557 /* Parse the declaration-specifiers. */
12558 cp_parser_decl_specifier_seq (parser,
12559 CP_PARSER_FLAGS_NONE,
12561 &declares_class_or_enum);
12562 /* If an error occurred, there's no reason to attempt to parse the
12563 rest of the declaration. */
12564 if (cp_parser_error_occurred (parser))
12566 parser->type_definition_forbidden_message = saved_message;
12570 /* Peek at the next token. */
12571 token = cp_lexer_peek_token (parser->lexer);
12572 /* If the next token is a `)', `,', `=', `>', or `...', then there
12573 is no declarator. */
12574 if (token->type == CPP_CLOSE_PAREN
12575 || token->type == CPP_COMMA
12576 || token->type == CPP_EQ
12577 || token->type == CPP_ELLIPSIS
12578 || token->type == CPP_GREATER)
12581 if (parenthesized_p)
12582 *parenthesized_p = false;
12584 /* Otherwise, there should be a declarator. */
12587 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
12588 parser->default_arg_ok_p = false;
12590 /* After seeing a decl-specifier-seq, if the next token is not a
12591 "(", there is no possibility that the code is a valid
12592 expression. Therefore, if parsing tentatively, we commit at
12594 if (!parser->in_template_argument_list_p
12595 /* In an expression context, having seen:
12599 we cannot be sure whether we are looking at a
12600 function-type (taking a "char" as a parameter) or a cast
12601 of some object of type "char" to "int". */
12602 && !parser->in_type_id_in_expr_p
12603 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12604 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
12605 cp_parser_commit_to_tentative_parse (parser);
12606 /* Parse the declarator. */
12607 declarator = cp_parser_declarator (parser,
12608 CP_PARSER_DECLARATOR_EITHER,
12609 /*ctor_dtor_or_conv_p=*/NULL,
12611 /*member_p=*/false);
12612 parser->default_arg_ok_p = saved_default_arg_ok_p;
12613 /* After the declarator, allow more attributes. */
12614 decl_specifiers.attributes
12615 = chainon (decl_specifiers.attributes,
12616 cp_parser_attributes_opt (parser));
12619 /* The restriction on defining new types applies only to the type
12620 of the parameter, not to the default argument. */
12621 parser->type_definition_forbidden_message = saved_message;
12623 /* If the next token is `=', then process a default argument. */
12624 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12626 bool saved_greater_than_is_operator_p;
12627 /* Consume the `='. */
12628 cp_lexer_consume_token (parser->lexer);
12630 /* If we are defining a class, then the tokens that make up the
12631 default argument must be saved and processed later. */
12632 if (!template_parm_p && at_class_scope_p ()
12633 && TYPE_BEING_DEFINED (current_class_type))
12635 unsigned depth = 0;
12636 cp_token *first_token;
12639 /* Add tokens until we have processed the entire default
12640 argument. We add the range [first_token, token). */
12641 first_token = cp_lexer_peek_token (parser->lexer);
12646 /* Peek at the next token. */
12647 token = cp_lexer_peek_token (parser->lexer);
12648 /* What we do depends on what token we have. */
12649 switch (token->type)
12651 /* In valid code, a default argument must be
12652 immediately followed by a `,' `)', or `...'. */
12654 case CPP_CLOSE_PAREN:
12656 /* If we run into a non-nested `;', `}', or `]',
12657 then the code is invalid -- but the default
12658 argument is certainly over. */
12659 case CPP_SEMICOLON:
12660 case CPP_CLOSE_BRACE:
12661 case CPP_CLOSE_SQUARE:
12664 /* Update DEPTH, if necessary. */
12665 else if (token->type == CPP_CLOSE_PAREN
12666 || token->type == CPP_CLOSE_BRACE
12667 || token->type == CPP_CLOSE_SQUARE)
12671 case CPP_OPEN_PAREN:
12672 case CPP_OPEN_SQUARE:
12673 case CPP_OPEN_BRACE:
12678 /* If we see a non-nested `>', and `>' is not an
12679 operator, then it marks the end of the default
12681 if (!depth && !greater_than_is_operator_p)
12685 /* If we run out of tokens, issue an error message. */
12687 case CPP_PRAGMA_EOL:
12688 error ("file ends in default argument");
12694 /* In these cases, we should look for template-ids.
12695 For example, if the default argument is
12696 `X<int, double>()', we need to do name lookup to
12697 figure out whether or not `X' is a template; if
12698 so, the `,' does not end the default argument.
12700 That is not yet done. */
12707 /* If we've reached the end, stop. */
12711 /* Add the token to the token block. */
12712 token = cp_lexer_consume_token (parser->lexer);
12715 /* Create a DEFAULT_ARG to represented the unparsed default
12717 default_argument = make_node (DEFAULT_ARG);
12718 DEFARG_TOKENS (default_argument)
12719 = cp_token_cache_new (first_token, token);
12720 DEFARG_INSTANTIATIONS (default_argument) = NULL;
12722 /* Outside of a class definition, we can just parse the
12723 assignment-expression. */
12726 bool saved_local_variables_forbidden_p;
12728 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
12730 saved_greater_than_is_operator_p
12731 = parser->greater_than_is_operator_p;
12732 parser->greater_than_is_operator_p = greater_than_is_operator_p;
12733 /* Local variable names (and the `this' keyword) may not
12734 appear in a default argument. */
12735 saved_local_variables_forbidden_p
12736 = parser->local_variables_forbidden_p;
12737 parser->local_variables_forbidden_p = true;
12738 /* The default argument expression may cause implicitly
12739 defined member functions to be synthesized, which will
12740 result in garbage collection. We must treat this
12741 situation as if we were within the body of function so as
12742 to avoid collecting live data on the stack. */
12744 /* Parse the assignment-expression. */
12745 if (template_parm_p)
12746 push_deferring_access_checks (dk_no_deferred);
12748 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
12749 if (template_parm_p)
12750 pop_deferring_access_checks ();
12751 /* Restore saved state. */
12753 parser->greater_than_is_operator_p
12754 = saved_greater_than_is_operator_p;
12755 parser->local_variables_forbidden_p
12756 = saved_local_variables_forbidden_p;
12758 if (!parser->default_arg_ok_p)
12760 if (!flag_pedantic_errors)
12761 warning (0, "deprecated use of default argument for parameter of non-function");
12764 error ("default arguments are only permitted for function parameters");
12765 default_argument = NULL_TREE;
12770 default_argument = NULL_TREE;
12772 return make_parameter_declarator (&decl_specifiers,
12777 /* Parse a function-body.
12780 compound_statement */
12783 cp_parser_function_body (cp_parser *parser)
12785 cp_parser_compound_statement (parser, NULL, false);
12788 /* Parse a ctor-initializer-opt followed by a function-body. Return
12789 true if a ctor-initializer was present. */
12792 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
12795 bool ctor_initializer_p;
12797 /* Begin the function body. */
12798 body = begin_function_body ();
12799 /* Parse the optional ctor-initializer. */
12800 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
12801 /* Parse the function-body. */
12802 cp_parser_function_body (parser);
12803 /* Finish the function body. */
12804 finish_function_body (body);
12806 return ctor_initializer_p;
12809 /* Parse an initializer.
12812 = initializer-clause
12813 ( expression-list )
12815 Returns an expression representing the initializer. If no
12816 initializer is present, NULL_TREE is returned.
12818 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
12819 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
12820 set to FALSE if there is no initializer present. If there is an
12821 initializer, and it is not a constant-expression, *NON_CONSTANT_P
12822 is set to true; otherwise it is set to false. */
12825 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
12826 bool* non_constant_p)
12831 /* Peek at the next token. */
12832 token = cp_lexer_peek_token (parser->lexer);
12834 /* Let our caller know whether or not this initializer was
12836 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
12837 /* Assume that the initializer is constant. */
12838 *non_constant_p = false;
12840 if (token->type == CPP_EQ)
12842 /* Consume the `='. */
12843 cp_lexer_consume_token (parser->lexer);
12844 /* Parse the initializer-clause. */
12845 init = cp_parser_initializer_clause (parser, non_constant_p);
12847 else if (token->type == CPP_OPEN_PAREN)
12848 init = cp_parser_parenthesized_expression_list (parser, false,
12853 /* Anything else is an error. */
12854 cp_parser_error (parser, "expected initializer");
12855 init = error_mark_node;
12861 /* Parse an initializer-clause.
12863 initializer-clause:
12864 assignment-expression
12865 { initializer-list , [opt] }
12868 Returns an expression representing the initializer.
12870 If the `assignment-expression' production is used the value
12871 returned is simply a representation for the expression.
12873 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12874 the elements of the initializer-list (or NULL, if the last
12875 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12876 NULL_TREE. There is no way to detect whether or not the optional
12877 trailing `,' was provided. NON_CONSTANT_P is as for
12878 cp_parser_initializer. */
12881 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
12885 /* Assume the expression is constant. */
12886 *non_constant_p = false;
12888 /* If it is not a `{', then we are looking at an
12889 assignment-expression. */
12890 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12893 = cp_parser_constant_expression (parser,
12894 /*allow_non_constant_p=*/true,
12896 if (!*non_constant_p)
12897 initializer = fold_non_dependent_expr (initializer);
12901 /* Consume the `{' token. */
12902 cp_lexer_consume_token (parser->lexer);
12903 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12904 initializer = make_node (CONSTRUCTOR);
12905 /* If it's not a `}', then there is a non-trivial initializer. */
12906 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12908 /* Parse the initializer list. */
12909 CONSTRUCTOR_ELTS (initializer)
12910 = cp_parser_initializer_list (parser, non_constant_p);
12911 /* A trailing `,' token is allowed. */
12912 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12913 cp_lexer_consume_token (parser->lexer);
12915 /* Now, there should be a trailing `}'. */
12916 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12919 return initializer;
12922 /* Parse an initializer-list.
12926 initializer-list , initializer-clause
12931 identifier : initializer-clause
12932 initializer-list, identifier : initializer-clause
12934 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
12935 for the initializer. If the INDEX of the elt is non-NULL, it is the
12936 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12937 as for cp_parser_initializer. */
12939 static VEC(constructor_elt,gc) *
12940 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12942 VEC(constructor_elt,gc) *v = NULL;
12944 /* Assume all of the expressions are constant. */
12945 *non_constant_p = false;
12947 /* Parse the rest of the list. */
12953 bool clause_non_constant_p;
12955 /* If the next token is an identifier and the following one is a
12956 colon, we are looking at the GNU designated-initializer
12958 if (cp_parser_allow_gnu_extensions_p (parser)
12959 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12960 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12962 /* Warn the user that they are using an extension. */
12964 pedwarn ("ISO C++ does not allow designated initializers");
12965 /* Consume the identifier. */
12966 identifier = cp_lexer_consume_token (parser->lexer)->u.value;
12967 /* Consume the `:'. */
12968 cp_lexer_consume_token (parser->lexer);
12971 identifier = NULL_TREE;
12973 /* Parse the initializer. */
12974 initializer = cp_parser_initializer_clause (parser,
12975 &clause_non_constant_p);
12976 /* If any clause is non-constant, so is the entire initializer. */
12977 if (clause_non_constant_p)
12978 *non_constant_p = true;
12980 /* Add it to the vector. */
12981 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
12983 /* If the next token is not a comma, we have reached the end of
12985 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12988 /* Peek at the next token. */
12989 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12990 /* If the next token is a `}', then we're still done. An
12991 initializer-clause can have a trailing `,' after the
12992 initializer-list and before the closing `}'. */
12993 if (token->type == CPP_CLOSE_BRACE)
12996 /* Consume the `,' token. */
12997 cp_lexer_consume_token (parser->lexer);
13003 /* Classes [gram.class] */
13005 /* Parse a class-name.
13011 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
13012 to indicate that names looked up in dependent types should be
13013 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
13014 keyword has been used to indicate that the name that appears next
13015 is a template. TAG_TYPE indicates the explicit tag given before
13016 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
13017 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
13018 is the class being defined in a class-head.
13020 Returns the TYPE_DECL representing the class. */
13023 cp_parser_class_name (cp_parser *parser,
13024 bool typename_keyword_p,
13025 bool template_keyword_p,
13026 enum tag_types tag_type,
13027 bool check_dependency_p,
13029 bool is_declaration)
13036 /* All class-names start with an identifier. */
13037 token = cp_lexer_peek_token (parser->lexer);
13038 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
13040 cp_parser_error (parser, "expected class-name");
13041 return error_mark_node;
13044 /* PARSER->SCOPE can be cleared when parsing the template-arguments
13045 to a template-id, so we save it here. */
13046 scope = parser->scope;
13047 if (scope == error_mark_node)
13048 return error_mark_node;
13050 /* Any name names a type if we're following the `typename' keyword
13051 in a qualified name where the enclosing scope is type-dependent. */
13052 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
13053 && dependent_type_p (scope));
13054 /* Handle the common case (an identifier, but not a template-id)
13056 if (token->type == CPP_NAME
13057 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
13059 cp_token *identifier_token;
13063 /* Look for the identifier. */
13064 identifier_token = cp_lexer_peek_token (parser->lexer);
13065 ambiguous_p = identifier_token->ambiguous_p;
13066 identifier = cp_parser_identifier (parser);
13067 /* If the next token isn't an identifier, we are certainly not
13068 looking at a class-name. */
13069 if (identifier == error_mark_node)
13070 decl = error_mark_node;
13071 /* If we know this is a type-name, there's no need to look it
13073 else if (typename_p)
13077 tree ambiguous_decls;
13078 /* If we already know that this lookup is ambiguous, then
13079 we've already issued an error message; there's no reason
13083 cp_parser_simulate_error (parser);
13084 return error_mark_node;
13086 /* If the next token is a `::', then the name must be a type
13089 [basic.lookup.qual]
13091 During the lookup for a name preceding the :: scope
13092 resolution operator, object, function, and enumerator
13093 names are ignored. */
13094 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
13095 tag_type = typename_type;
13096 /* Look up the name. */
13097 decl = cp_parser_lookup_name (parser, identifier,
13099 /*is_template=*/false,
13100 /*is_namespace=*/false,
13101 check_dependency_p,
13103 if (ambiguous_decls)
13105 error ("reference to %qD is ambiguous", identifier);
13106 print_candidates (ambiguous_decls);
13107 if (cp_parser_parsing_tentatively (parser))
13109 identifier_token->ambiguous_p = true;
13110 cp_parser_simulate_error (parser);
13112 return error_mark_node;
13118 /* Try a template-id. */
13119 decl = cp_parser_template_id (parser, template_keyword_p,
13120 check_dependency_p,
13122 if (decl == error_mark_node)
13123 return error_mark_node;
13126 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
13128 /* If this is a typename, create a TYPENAME_TYPE. */
13129 if (typename_p && decl != error_mark_node)
13131 decl = make_typename_type (scope, decl, typename_type,
13132 /*complain=*/tf_error);
13133 if (decl != error_mark_node)
13134 decl = TYPE_NAME (decl);
13137 /* Check to see that it is really the name of a class. */
13138 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
13139 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
13140 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
13141 /* Situations like this:
13143 template <typename T> struct A {
13144 typename T::template X<int>::I i;
13147 are problematic. Is `T::template X<int>' a class-name? The
13148 standard does not seem to be definitive, but there is no other
13149 valid interpretation of the following `::'. Therefore, those
13150 names are considered class-names. */
13152 decl = make_typename_type (scope, decl, tag_type, tf_error);
13153 if (decl != error_mark_node)
13154 decl = TYPE_NAME (decl);
13156 else if (TREE_CODE (decl) != TYPE_DECL
13157 || TREE_TYPE (decl) == error_mark_node
13158 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
13159 decl = error_mark_node;
13161 if (decl == error_mark_node)
13162 cp_parser_error (parser, "expected class-name");
13167 /* Parse a class-specifier.
13170 class-head { member-specification [opt] }
13172 Returns the TREE_TYPE representing the class. */
13175 cp_parser_class_specifier (cp_parser* parser)
13179 tree attributes = NULL_TREE;
13180 int has_trailing_semicolon;
13181 bool nested_name_specifier_p;
13182 unsigned saved_num_template_parameter_lists;
13183 bool saved_in_function_body;
13184 tree old_scope = NULL_TREE;
13185 tree scope = NULL_TREE;
13188 push_deferring_access_checks (dk_no_deferred);
13190 /* Parse the class-head. */
13191 type = cp_parser_class_head (parser,
13192 &nested_name_specifier_p,
13195 /* If the class-head was a semantic disaster, skip the entire body
13199 cp_parser_skip_to_end_of_block_or_statement (parser);
13200 pop_deferring_access_checks ();
13201 return error_mark_node;
13204 /* Look for the `{'. */
13205 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
13207 pop_deferring_access_checks ();
13208 return error_mark_node;
13211 /* Process the base classes. If they're invalid, skip the
13212 entire class body. */
13213 if (!xref_basetypes (type, bases))
13215 cp_parser_skip_to_closing_brace (parser);
13217 /* Consuming the closing brace yields better error messages
13219 cp_lexer_consume_token (parser->lexer);
13220 pop_deferring_access_checks ();
13221 return error_mark_node;
13224 /* Issue an error message if type-definitions are forbidden here. */
13225 cp_parser_check_type_definition (parser);
13226 /* Remember that we are defining one more class. */
13227 ++parser->num_classes_being_defined;
13228 /* Inside the class, surrounding template-parameter-lists do not
13230 saved_num_template_parameter_lists
13231 = parser->num_template_parameter_lists;
13232 parser->num_template_parameter_lists = 0;
13233 /* We are not in a function body. */
13234 saved_in_function_body = parser->in_function_body;
13235 parser->in_function_body = false;
13237 /* Start the class. */
13238 if (nested_name_specifier_p)
13240 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
13241 old_scope = push_inner_scope (scope);
13243 type = begin_class_definition (type, attributes);
13245 if (type == error_mark_node)
13246 /* If the type is erroneous, skip the entire body of the class. */
13247 cp_parser_skip_to_closing_brace (parser);
13249 /* Parse the member-specification. */
13250 cp_parser_member_specification_opt (parser);
13252 /* Look for the trailing `}'. */
13253 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13254 /* We get better error messages by noticing a common problem: a
13255 missing trailing `;'. */
13256 token = cp_lexer_peek_token (parser->lexer);
13257 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
13258 /* Look for trailing attributes to apply to this class. */
13259 if (cp_parser_allow_gnu_extensions_p (parser))
13260 attributes = cp_parser_attributes_opt (parser);
13261 if (type != error_mark_node)
13262 type = finish_struct (type, attributes);
13263 if (nested_name_specifier_p)
13264 pop_inner_scope (old_scope, scope);
13265 /* If this class is not itself within the scope of another class,
13266 then we need to parse the bodies of all of the queued function
13267 definitions. Note that the queued functions defined in a class
13268 are not always processed immediately following the
13269 class-specifier for that class. Consider:
13272 struct B { void f() { sizeof (A); } };
13275 If `f' were processed before the processing of `A' were
13276 completed, there would be no way to compute the size of `A'.
13277 Note that the nesting we are interested in here is lexical --
13278 not the semantic nesting given by TYPE_CONTEXT. In particular,
13281 struct A { struct B; };
13282 struct A::B { void f() { } };
13284 there is no need to delay the parsing of `A::B::f'. */
13285 if (--parser->num_classes_being_defined == 0)
13289 tree class_type = NULL_TREE;
13290 tree pushed_scope = NULL_TREE;
13292 /* In a first pass, parse default arguments to the functions.
13293 Then, in a second pass, parse the bodies of the functions.
13294 This two-phased approach handles cases like:
13302 for (TREE_PURPOSE (parser->unparsed_functions_queues)
13303 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
13304 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
13305 TREE_PURPOSE (parser->unparsed_functions_queues)
13306 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
13308 fn = TREE_VALUE (queue_entry);
13309 /* If there are default arguments that have not yet been processed,
13310 take care of them now. */
13311 if (class_type != TREE_PURPOSE (queue_entry))
13314 pop_scope (pushed_scope);
13315 class_type = TREE_PURPOSE (queue_entry);
13316 pushed_scope = push_scope (class_type);
13318 /* Make sure that any template parameters are in scope. */
13319 maybe_begin_member_template_processing (fn);
13320 /* Parse the default argument expressions. */
13321 cp_parser_late_parsing_default_args (parser, fn);
13322 /* Remove any template parameters from the symbol table. */
13323 maybe_end_member_template_processing ();
13326 pop_scope (pushed_scope);
13327 /* Now parse the body of the functions. */
13328 for (TREE_VALUE (parser->unparsed_functions_queues)
13329 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
13330 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
13331 TREE_VALUE (parser->unparsed_functions_queues)
13332 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
13334 /* Figure out which function we need to process. */
13335 fn = TREE_VALUE (queue_entry);
13336 /* Parse the function. */
13337 cp_parser_late_parsing_for_member (parser, fn);
13341 /* Put back any saved access checks. */
13342 pop_deferring_access_checks ();
13344 /* Restore saved state. */
13345 parser->in_function_body = saved_in_function_body;
13346 parser->num_template_parameter_lists
13347 = saved_num_template_parameter_lists;
13352 /* Parse a class-head.
13355 class-key identifier [opt] base-clause [opt]
13356 class-key nested-name-specifier identifier base-clause [opt]
13357 class-key nested-name-specifier [opt] template-id
13361 class-key attributes identifier [opt] base-clause [opt]
13362 class-key attributes nested-name-specifier identifier base-clause [opt]
13363 class-key attributes nested-name-specifier [opt] template-id
13366 Returns the TYPE of the indicated class. Sets
13367 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
13368 involving a nested-name-specifier was used, and FALSE otherwise.
13370 Returns error_mark_node if this is not a class-head.
13372 Returns NULL_TREE if the class-head is syntactically valid, but
13373 semantically invalid in a way that means we should skip the entire
13374 body of the class. */
13377 cp_parser_class_head (cp_parser* parser,
13378 bool* nested_name_specifier_p,
13379 tree *attributes_p,
13382 tree nested_name_specifier;
13383 enum tag_types class_key;
13384 tree id = NULL_TREE;
13385 tree type = NULL_TREE;
13387 bool template_id_p = false;
13388 bool qualified_p = false;
13389 bool invalid_nested_name_p = false;
13390 bool invalid_explicit_specialization_p = false;
13391 tree pushed_scope = NULL_TREE;
13392 unsigned num_templates;
13394 /* Assume no nested-name-specifier will be present. */
13395 *nested_name_specifier_p = false;
13396 /* Assume no template parameter lists will be used in defining the
13400 /* Look for the class-key. */
13401 class_key = cp_parser_class_key (parser);
13402 if (class_key == none_type)
13403 return error_mark_node;
13405 /* Parse the attributes. */
13406 attributes = cp_parser_attributes_opt (parser);
13408 /* If the next token is `::', that is invalid -- but sometimes
13409 people do try to write:
13413 Handle this gracefully by accepting the extra qualifier, and then
13414 issuing an error about it later if this really is a
13415 class-head. If it turns out just to be an elaborated type
13416 specifier, remain silent. */
13417 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
13418 qualified_p = true;
13420 push_deferring_access_checks (dk_no_check);
13422 /* Determine the name of the class. Begin by looking for an
13423 optional nested-name-specifier. */
13424 nested_name_specifier
13425 = cp_parser_nested_name_specifier_opt (parser,
13426 /*typename_keyword_p=*/false,
13427 /*check_dependency_p=*/false,
13429 /*is_declaration=*/false);
13430 /* If there was a nested-name-specifier, then there *must* be an
13432 if (nested_name_specifier)
13434 /* Although the grammar says `identifier', it really means
13435 `class-name' or `template-name'. You are only allowed to
13436 define a class that has already been declared with this
13439 The proposed resolution for Core Issue 180 says that wherever
13440 you see `class T::X' you should treat `X' as a type-name.
13442 It is OK to define an inaccessible class; for example:
13444 class A { class B; };
13447 We do not know if we will see a class-name, or a
13448 template-name. We look for a class-name first, in case the
13449 class-name is a template-id; if we looked for the
13450 template-name first we would stop after the template-name. */
13451 cp_parser_parse_tentatively (parser);
13452 type = cp_parser_class_name (parser,
13453 /*typename_keyword_p=*/false,
13454 /*template_keyword_p=*/false,
13456 /*check_dependency_p=*/false,
13457 /*class_head_p=*/true,
13458 /*is_declaration=*/false);
13459 /* If that didn't work, ignore the nested-name-specifier. */
13460 if (!cp_parser_parse_definitely (parser))
13462 invalid_nested_name_p = true;
13463 id = cp_parser_identifier (parser);
13464 if (id == error_mark_node)
13467 /* If we could not find a corresponding TYPE, treat this
13468 declaration like an unqualified declaration. */
13469 if (type == error_mark_node)
13470 nested_name_specifier = NULL_TREE;
13471 /* Otherwise, count the number of templates used in TYPE and its
13472 containing scopes. */
13477 for (scope = TREE_TYPE (type);
13478 scope && TREE_CODE (scope) != NAMESPACE_DECL;
13479 scope = (TYPE_P (scope)
13480 ? TYPE_CONTEXT (scope)
13481 : DECL_CONTEXT (scope)))
13483 && CLASS_TYPE_P (scope)
13484 && CLASSTYPE_TEMPLATE_INFO (scope)
13485 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
13486 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
13490 /* Otherwise, the identifier is optional. */
13493 /* We don't know whether what comes next is a template-id,
13494 an identifier, or nothing at all. */
13495 cp_parser_parse_tentatively (parser);
13496 /* Check for a template-id. */
13497 id = cp_parser_template_id (parser,
13498 /*template_keyword_p=*/false,
13499 /*check_dependency_p=*/true,
13500 /*is_declaration=*/true);
13501 /* If that didn't work, it could still be an identifier. */
13502 if (!cp_parser_parse_definitely (parser))
13504 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
13505 id = cp_parser_identifier (parser);
13511 template_id_p = true;
13516 pop_deferring_access_checks ();
13519 cp_parser_check_for_invalid_template_id (parser, id);
13521 /* If it's not a `:' or a `{' then we can't really be looking at a
13522 class-head, since a class-head only appears as part of a
13523 class-specifier. We have to detect this situation before calling
13524 xref_tag, since that has irreversible side-effects. */
13525 if (!cp_parser_next_token_starts_class_definition_p (parser))
13527 cp_parser_error (parser, "expected %<{%> or %<:%>");
13528 return error_mark_node;
13531 /* At this point, we're going ahead with the class-specifier, even
13532 if some other problem occurs. */
13533 cp_parser_commit_to_tentative_parse (parser);
13534 /* Issue the error about the overly-qualified name now. */
13536 cp_parser_error (parser,
13537 "global qualification of class name is invalid");
13538 else if (invalid_nested_name_p)
13539 cp_parser_error (parser,
13540 "qualified name does not name a class");
13541 else if (nested_name_specifier)
13545 /* Reject typedef-names in class heads. */
13546 if (!DECL_IMPLICIT_TYPEDEF_P (type))
13548 error ("invalid class name in declaration of %qD", type);
13553 /* Figure out in what scope the declaration is being placed. */
13554 scope = current_scope ();
13555 /* If that scope does not contain the scope in which the
13556 class was originally declared, the program is invalid. */
13557 if (scope && !is_ancestor (scope, nested_name_specifier))
13559 error ("declaration of %qD in %qD which does not enclose %qD",
13560 type, scope, nested_name_specifier);
13566 A declarator-id shall not be qualified exception of the
13567 definition of a ... nested class outside of its class
13568 ... [or] a the definition or explicit instantiation of a
13569 class member of a namespace outside of its namespace. */
13570 if (scope == nested_name_specifier)
13572 pedwarn ("extra qualification ignored");
13573 nested_name_specifier = NULL_TREE;
13577 /* An explicit-specialization must be preceded by "template <>". If
13578 it is not, try to recover gracefully. */
13579 if (at_namespace_scope_p ()
13580 && parser->num_template_parameter_lists == 0
13583 error ("an explicit specialization must be preceded by %<template <>%>");
13584 invalid_explicit_specialization_p = true;
13585 /* Take the same action that would have been taken by
13586 cp_parser_explicit_specialization. */
13587 ++parser->num_template_parameter_lists;
13588 begin_specialization ();
13590 /* There must be no "return" statements between this point and the
13591 end of this function; set "type "to the correct return value and
13592 use "goto done;" to return. */
13593 /* Make sure that the right number of template parameters were
13595 if (!cp_parser_check_template_parameters (parser, num_templates))
13597 /* If something went wrong, there is no point in even trying to
13598 process the class-definition. */
13603 /* Look up the type. */
13606 type = TREE_TYPE (id);
13607 type = maybe_process_partial_specialization (type);
13608 if (nested_name_specifier)
13609 pushed_scope = push_scope (nested_name_specifier);
13611 else if (nested_name_specifier)
13617 template <typename T> struct S { struct T };
13618 template <typename T> struct S<T>::T { };
13620 we will get a TYPENAME_TYPE when processing the definition of
13621 `S::T'. We need to resolve it to the actual type before we
13622 try to define it. */
13623 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
13625 class_type = resolve_typename_type (TREE_TYPE (type),
13626 /*only_current_p=*/false);
13627 if (class_type != error_mark_node)
13628 type = TYPE_NAME (class_type);
13631 cp_parser_error (parser, "could not resolve typename type");
13632 type = error_mark_node;
13636 maybe_process_partial_specialization (TREE_TYPE (type));
13637 class_type = current_class_type;
13638 /* Enter the scope indicated by the nested-name-specifier. */
13639 pushed_scope = push_scope (nested_name_specifier);
13640 /* Get the canonical version of this type. */
13641 type = TYPE_MAIN_DECL (TREE_TYPE (type));
13642 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
13643 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
13645 type = push_template_decl (type);
13646 if (type == error_mark_node)
13653 type = TREE_TYPE (type);
13654 *nested_name_specifier_p = true;
13656 else /* The name is not a nested name. */
13658 /* If the class was unnamed, create a dummy name. */
13660 id = make_anon_name ();
13661 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
13662 parser->num_template_parameter_lists);
13665 /* Indicate whether this class was declared as a `class' or as a
13667 if (TREE_CODE (type) == RECORD_TYPE)
13668 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
13669 cp_parser_check_class_key (class_key, type);
13671 /* If this type was already complete, and we see another definition,
13672 that's an error. */
13673 if (type != error_mark_node && COMPLETE_TYPE_P (type))
13675 error ("redefinition of %q#T", type);
13676 error ("previous definition of %q+#T", type);
13680 else if (type == error_mark_node)
13683 /* We will have entered the scope containing the class; the names of
13684 base classes should be looked up in that context. For example:
13686 struct A { struct B {}; struct C; };
13687 struct A::C : B {};
13690 *bases = NULL_TREE;
13692 /* Get the list of base-classes, if there is one. */
13693 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
13694 *bases = cp_parser_base_clause (parser);
13697 /* Leave the scope given by the nested-name-specifier. We will
13698 enter the class scope itself while processing the members. */
13700 pop_scope (pushed_scope);
13702 if (invalid_explicit_specialization_p)
13704 end_specialization ();
13705 --parser->num_template_parameter_lists;
13707 *attributes_p = attributes;
13711 /* Parse a class-key.
13718 Returns the kind of class-key specified, or none_type to indicate
13721 static enum tag_types
13722 cp_parser_class_key (cp_parser* parser)
13725 enum tag_types tag_type;
13727 /* Look for the class-key. */
13728 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
13732 /* Check to see if the TOKEN is a class-key. */
13733 tag_type = cp_parser_token_is_class_key (token);
13735 cp_parser_error (parser, "expected class-key");
13739 /* Parse an (optional) member-specification.
13741 member-specification:
13742 member-declaration member-specification [opt]
13743 access-specifier : member-specification [opt] */
13746 cp_parser_member_specification_opt (cp_parser* parser)
13753 /* Peek at the next token. */
13754 token = cp_lexer_peek_token (parser->lexer);
13755 /* If it's a `}', or EOF then we've seen all the members. */
13756 if (token->type == CPP_CLOSE_BRACE
13757 || token->type == CPP_EOF
13758 || token->type == CPP_PRAGMA_EOL)
13761 /* See if this token is a keyword. */
13762 keyword = token->keyword;
13766 case RID_PROTECTED:
13768 /* Consume the access-specifier. */
13769 cp_lexer_consume_token (parser->lexer);
13770 /* Remember which access-specifier is active. */
13771 current_access_specifier = token->u.value;
13772 /* Look for the `:'. */
13773 cp_parser_require (parser, CPP_COLON, "`:'");
13777 /* Accept #pragmas at class scope. */
13778 if (token->type == CPP_PRAGMA)
13780 cp_parser_pragma (parser, pragma_external);
13784 /* Otherwise, the next construction must be a
13785 member-declaration. */
13786 cp_parser_member_declaration (parser);
13791 /* Parse a member-declaration.
13793 member-declaration:
13794 decl-specifier-seq [opt] member-declarator-list [opt] ;
13795 function-definition ; [opt]
13796 :: [opt] nested-name-specifier template [opt] unqualified-id ;
13798 template-declaration
13800 member-declarator-list:
13802 member-declarator-list , member-declarator
13805 declarator pure-specifier [opt]
13806 declarator constant-initializer [opt]
13807 identifier [opt] : constant-expression
13811 member-declaration:
13812 __extension__ member-declaration
13815 declarator attributes [opt] pure-specifier [opt]
13816 declarator attributes [opt] constant-initializer [opt]
13817 identifier [opt] attributes [opt] : constant-expression */
13820 cp_parser_member_declaration (cp_parser* parser)
13822 cp_decl_specifier_seq decl_specifiers;
13823 tree prefix_attributes;
13825 int declares_class_or_enum;
13828 int saved_pedantic;
13830 /* Check for the `__extension__' keyword. */
13831 if (cp_parser_extension_opt (parser, &saved_pedantic))
13834 cp_parser_member_declaration (parser);
13835 /* Restore the old value of the PEDANTIC flag. */
13836 pedantic = saved_pedantic;
13841 /* Check for a template-declaration. */
13842 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13844 /* An explicit specialization here is an error condition, and we
13845 expect the specialization handler to detect and report this. */
13846 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
13847 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
13848 cp_parser_explicit_specialization (parser);
13850 cp_parser_template_declaration (parser, /*member_p=*/true);
13855 /* Check for a using-declaration. */
13856 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
13858 /* Parse the using-declaration. */
13859 cp_parser_using_declaration (parser,
13860 /*access_declaration_p=*/false);
13864 /* Check for @defs. */
13865 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
13868 tree ivar_chains = cp_parser_objc_defs_expression (parser);
13869 ivar = ivar_chains;
13873 ivar = TREE_CHAIN (member);
13874 TREE_CHAIN (member) = NULL_TREE;
13875 finish_member_declaration (member);
13880 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
13883 /* Parse the decl-specifier-seq. */
13884 cp_parser_decl_specifier_seq (parser,
13885 CP_PARSER_FLAGS_OPTIONAL,
13887 &declares_class_or_enum);
13888 prefix_attributes = decl_specifiers.attributes;
13889 decl_specifiers.attributes = NULL_TREE;
13890 /* Check for an invalid type-name. */
13891 if (!decl_specifiers.type
13892 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
13894 /* If there is no declarator, then the decl-specifier-seq should
13896 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13898 /* If there was no decl-specifier-seq, and the next token is a
13899 `;', then we have something like:
13905 Each member-declaration shall declare at least one member
13906 name of the class. */
13907 if (!decl_specifiers.any_specifiers_p)
13909 cp_token *token = cp_lexer_peek_token (parser->lexer);
13910 if (pedantic && !token->in_system_header)
13911 pedwarn ("%Hextra %<;%>", &token->location);
13917 /* See if this declaration is a friend. */
13918 friend_p = cp_parser_friend_p (&decl_specifiers);
13919 /* If there were decl-specifiers, check to see if there was
13920 a class-declaration. */
13921 type = check_tag_decl (&decl_specifiers);
13922 /* Nested classes have already been added to the class, but
13923 a `friend' needs to be explicitly registered. */
13926 /* If the `friend' keyword was present, the friend must
13927 be introduced with a class-key. */
13928 if (!declares_class_or_enum)
13929 error ("a class-key must be used when declaring a friend");
13932 template <typename T> struct A {
13933 friend struct A<T>::B;
13936 A<T>::B will be represented by a TYPENAME_TYPE, and
13937 therefore not recognized by check_tag_decl. */
13939 && decl_specifiers.type
13940 && TYPE_P (decl_specifiers.type))
13941 type = decl_specifiers.type;
13942 if (!type || !TYPE_P (type))
13943 error ("friend declaration does not name a class or "
13946 make_friend_class (current_class_type, type,
13947 /*complain=*/true);
13949 /* If there is no TYPE, an error message will already have
13951 else if (!type || type == error_mark_node)
13953 /* An anonymous aggregate has to be handled specially; such
13954 a declaration really declares a data member (with a
13955 particular type), as opposed to a nested class. */
13956 else if (ANON_AGGR_TYPE_P (type))
13958 /* Remove constructors and such from TYPE, now that we
13959 know it is an anonymous aggregate. */
13960 fixup_anonymous_aggr (type);
13961 /* And make the corresponding data member. */
13962 decl = build_decl (FIELD_DECL, NULL_TREE, type);
13963 /* Add it to the class. */
13964 finish_member_declaration (decl);
13967 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
13972 /* See if these declarations will be friends. */
13973 friend_p = cp_parser_friend_p (&decl_specifiers);
13975 /* Keep going until we hit the `;' at the end of the
13977 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
13979 tree attributes = NULL_TREE;
13980 tree first_attribute;
13982 /* Peek at the next token. */
13983 token = cp_lexer_peek_token (parser->lexer);
13985 /* Check for a bitfield declaration. */
13986 if (token->type == CPP_COLON
13987 || (token->type == CPP_NAME
13988 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
13994 /* Get the name of the bitfield. Note that we cannot just
13995 check TOKEN here because it may have been invalidated by
13996 the call to cp_lexer_peek_nth_token above. */
13997 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
13998 identifier = cp_parser_identifier (parser);
14000 identifier = NULL_TREE;
14002 /* Consume the `:' token. */
14003 cp_lexer_consume_token (parser->lexer);
14004 /* Get the width of the bitfield. */
14006 = cp_parser_constant_expression (parser,
14007 /*allow_non_constant=*/false,
14010 /* Look for attributes that apply to the bitfield. */
14011 attributes = cp_parser_attributes_opt (parser);
14012 /* Remember which attributes are prefix attributes and
14014 first_attribute = attributes;
14015 /* Combine the attributes. */
14016 attributes = chainon (prefix_attributes, attributes);
14018 /* Create the bitfield declaration. */
14019 decl = grokbitfield (identifier
14020 ? make_id_declarator (NULL_TREE,
14026 /* Apply the attributes. */
14027 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
14031 cp_declarator *declarator;
14033 tree asm_specification;
14034 int ctor_dtor_or_conv_p;
14036 /* Parse the declarator. */
14038 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
14039 &ctor_dtor_or_conv_p,
14040 /*parenthesized_p=*/NULL,
14041 /*member_p=*/true);
14043 /* If something went wrong parsing the declarator, make sure
14044 that we at least consume some tokens. */
14045 if (declarator == cp_error_declarator)
14047 /* Skip to the end of the statement. */
14048 cp_parser_skip_to_end_of_statement (parser);
14049 /* If the next token is not a semicolon, that is
14050 probably because we just skipped over the body of
14051 a function. So, we consume a semicolon if
14052 present, but do not issue an error message if it
14054 if (cp_lexer_next_token_is (parser->lexer,
14056 cp_lexer_consume_token (parser->lexer);
14060 if (declares_class_or_enum & 2)
14061 cp_parser_check_for_definition_in_return_type
14062 (declarator, decl_specifiers.type);
14064 /* Look for an asm-specification. */
14065 asm_specification = cp_parser_asm_specification_opt (parser);
14066 /* Look for attributes that apply to the declaration. */
14067 attributes = cp_parser_attributes_opt (parser);
14068 /* Remember which attributes are prefix attributes and
14070 first_attribute = attributes;
14071 /* Combine the attributes. */
14072 attributes = chainon (prefix_attributes, attributes);
14074 /* If it's an `=', then we have a constant-initializer or a
14075 pure-specifier. It is not correct to parse the
14076 initializer before registering the member declaration
14077 since the member declaration should be in scope while
14078 its initializer is processed. However, the rest of the
14079 front end does not yet provide an interface that allows
14080 us to handle this correctly. */
14081 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
14085 A pure-specifier shall be used only in the declaration of
14086 a virtual function.
14088 A member-declarator can contain a constant-initializer
14089 only if it declares a static member of integral or
14092 Therefore, if the DECLARATOR is for a function, we look
14093 for a pure-specifier; otherwise, we look for a
14094 constant-initializer. When we call `grokfield', it will
14095 perform more stringent semantics checks. */
14096 if (function_declarator_p (declarator))
14097 initializer = cp_parser_pure_specifier (parser);
14099 /* Parse the initializer. */
14100 initializer = cp_parser_constant_initializer (parser);
14102 /* Otherwise, there is no initializer. */
14104 initializer = NULL_TREE;
14106 /* See if we are probably looking at a function
14107 definition. We are certainly not looking at a
14108 member-declarator. Calling `grokfield' has
14109 side-effects, so we must not do it unless we are sure
14110 that we are looking at a member-declarator. */
14111 if (cp_parser_token_starts_function_definition_p
14112 (cp_lexer_peek_token (parser->lexer)))
14114 /* The grammar does not allow a pure-specifier to be
14115 used when a member function is defined. (It is
14116 possible that this fact is an oversight in the
14117 standard, since a pure function may be defined
14118 outside of the class-specifier. */
14120 error ("pure-specifier on function-definition");
14121 decl = cp_parser_save_member_function_body (parser,
14125 /* If the member was not a friend, declare it here. */
14127 finish_member_declaration (decl);
14128 /* Peek at the next token. */
14129 token = cp_lexer_peek_token (parser->lexer);
14130 /* If the next token is a semicolon, consume it. */
14131 if (token->type == CPP_SEMICOLON)
14132 cp_lexer_consume_token (parser->lexer);
14136 /* Create the declaration. */
14137 decl = grokfield (declarator, &decl_specifiers,
14138 initializer, /*init_const_expr_p=*/true,
14143 /* Reset PREFIX_ATTRIBUTES. */
14144 while (attributes && TREE_CHAIN (attributes) != first_attribute)
14145 attributes = TREE_CHAIN (attributes);
14147 TREE_CHAIN (attributes) = NULL_TREE;
14149 /* If there is any qualification still in effect, clear it
14150 now; we will be starting fresh with the next declarator. */
14151 parser->scope = NULL_TREE;
14152 parser->qualifying_scope = NULL_TREE;
14153 parser->object_scope = NULL_TREE;
14154 /* If it's a `,', then there are more declarators. */
14155 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
14156 cp_lexer_consume_token (parser->lexer);
14157 /* If the next token isn't a `;', then we have a parse error. */
14158 else if (cp_lexer_next_token_is_not (parser->lexer,
14161 cp_parser_error (parser, "expected %<;%>");
14162 /* Skip tokens until we find a `;'. */
14163 cp_parser_skip_to_end_of_statement (parser);
14170 /* Add DECL to the list of members. */
14172 finish_member_declaration (decl);
14174 if (TREE_CODE (decl) == FUNCTION_DECL)
14175 cp_parser_save_default_args (parser, decl);
14180 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14183 /* Parse a pure-specifier.
14188 Returns INTEGER_ZERO_NODE if a pure specifier is found.
14189 Otherwise, ERROR_MARK_NODE is returned. */
14192 cp_parser_pure_specifier (cp_parser* parser)
14196 /* Look for the `=' token. */
14197 if (!cp_parser_require (parser, CPP_EQ, "`='"))
14198 return error_mark_node;
14199 /* Look for the `0' token. */
14200 token = cp_lexer_consume_token (parser->lexer);
14201 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
14202 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
14204 cp_parser_error (parser,
14205 "invalid pure specifier (only `= 0' is allowed)");
14206 cp_parser_skip_to_end_of_statement (parser);
14207 return error_mark_node;
14209 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
14211 error ("templates may not be %<virtual%>");
14212 return error_mark_node;
14215 return integer_zero_node;
14218 /* Parse a constant-initializer.
14220 constant-initializer:
14221 = constant-expression
14223 Returns a representation of the constant-expression. */
14226 cp_parser_constant_initializer (cp_parser* parser)
14228 /* Look for the `=' token. */
14229 if (!cp_parser_require (parser, CPP_EQ, "`='"))
14230 return error_mark_node;
14232 /* It is invalid to write:
14234 struct S { static const int i = { 7 }; };
14237 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14239 cp_parser_error (parser,
14240 "a brace-enclosed initializer is not allowed here");
14241 /* Consume the opening brace. */
14242 cp_lexer_consume_token (parser->lexer);
14243 /* Skip the initializer. */
14244 cp_parser_skip_to_closing_brace (parser);
14245 /* Look for the trailing `}'. */
14246 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
14248 return error_mark_node;
14251 return cp_parser_constant_expression (parser,
14252 /*allow_non_constant=*/false,
14256 /* Derived classes [gram.class.derived] */
14258 /* Parse a base-clause.
14261 : base-specifier-list
14263 base-specifier-list:
14265 base-specifier-list , base-specifier
14267 Returns a TREE_LIST representing the base-classes, in the order in
14268 which they were declared. The representation of each node is as
14269 described by cp_parser_base_specifier.
14271 In the case that no bases are specified, this function will return
14272 NULL_TREE, not ERROR_MARK_NODE. */
14275 cp_parser_base_clause (cp_parser* parser)
14277 tree bases = NULL_TREE;
14279 /* Look for the `:' that begins the list. */
14280 cp_parser_require (parser, CPP_COLON, "`:'");
14282 /* Scan the base-specifier-list. */
14288 /* Look for the base-specifier. */
14289 base = cp_parser_base_specifier (parser);
14290 /* Add BASE to the front of the list. */
14291 if (base != error_mark_node)
14293 TREE_CHAIN (base) = bases;
14296 /* Peek at the next token. */
14297 token = cp_lexer_peek_token (parser->lexer);
14298 /* If it's not a comma, then the list is complete. */
14299 if (token->type != CPP_COMMA)
14301 /* Consume the `,'. */
14302 cp_lexer_consume_token (parser->lexer);
14305 /* PARSER->SCOPE may still be non-NULL at this point, if the last
14306 base class had a qualified name. However, the next name that
14307 appears is certainly not qualified. */
14308 parser->scope = NULL_TREE;
14309 parser->qualifying_scope = NULL_TREE;
14310 parser->object_scope = NULL_TREE;
14312 return nreverse (bases);
14315 /* Parse a base-specifier.
14318 :: [opt] nested-name-specifier [opt] class-name
14319 virtual access-specifier [opt] :: [opt] nested-name-specifier
14321 access-specifier virtual [opt] :: [opt] nested-name-specifier
14324 Returns a TREE_LIST. The TREE_PURPOSE will be one of
14325 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
14326 indicate the specifiers provided. The TREE_VALUE will be a TYPE
14327 (or the ERROR_MARK_NODE) indicating the type that was specified. */
14330 cp_parser_base_specifier (cp_parser* parser)
14334 bool virtual_p = false;
14335 bool duplicate_virtual_error_issued_p = false;
14336 bool duplicate_access_error_issued_p = false;
14337 bool class_scope_p, template_p;
14338 tree access = access_default_node;
14341 /* Process the optional `virtual' and `access-specifier'. */
14344 /* Peek at the next token. */
14345 token = cp_lexer_peek_token (parser->lexer);
14346 /* Process `virtual'. */
14347 switch (token->keyword)
14350 /* If `virtual' appears more than once, issue an error. */
14351 if (virtual_p && !duplicate_virtual_error_issued_p)
14353 cp_parser_error (parser,
14354 "%<virtual%> specified more than once in base-specified");
14355 duplicate_virtual_error_issued_p = true;
14360 /* Consume the `virtual' token. */
14361 cp_lexer_consume_token (parser->lexer);
14366 case RID_PROTECTED:
14368 /* If more than one access specifier appears, issue an
14370 if (access != access_default_node
14371 && !duplicate_access_error_issued_p)
14373 cp_parser_error (parser,
14374 "more than one access specifier in base-specified");
14375 duplicate_access_error_issued_p = true;
14378 access = ridpointers[(int) token->keyword];
14380 /* Consume the access-specifier. */
14381 cp_lexer_consume_token (parser->lexer);
14390 /* It is not uncommon to see programs mechanically, erroneously, use
14391 the 'typename' keyword to denote (dependent) qualified types
14392 as base classes. */
14393 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
14395 if (!processing_template_decl)
14396 error ("keyword %<typename%> not allowed outside of templates");
14398 error ("keyword %<typename%> not allowed in this context "
14399 "(the base class is implicitly a type)");
14400 cp_lexer_consume_token (parser->lexer);
14403 /* Look for the optional `::' operator. */
14404 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
14405 /* Look for the nested-name-specifier. The simplest way to
14410 The keyword `typename' is not permitted in a base-specifier or
14411 mem-initializer; in these contexts a qualified name that
14412 depends on a template-parameter is implicitly assumed to be a
14415 is to pretend that we have seen the `typename' keyword at this
14417 cp_parser_nested_name_specifier_opt (parser,
14418 /*typename_keyword_p=*/true,
14419 /*check_dependency_p=*/true,
14421 /*is_declaration=*/true);
14422 /* If the base class is given by a qualified name, assume that names
14423 we see are type names or templates, as appropriate. */
14424 class_scope_p = (parser->scope && TYPE_P (parser->scope));
14425 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
14427 /* Finally, look for the class-name. */
14428 type = cp_parser_class_name (parser,
14432 /*check_dependency_p=*/true,
14433 /*class_head_p=*/false,
14434 /*is_declaration=*/true);
14436 if (type == error_mark_node)
14437 return error_mark_node;
14439 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
14442 /* Exception handling [gram.exception] */
14444 /* Parse an (optional) exception-specification.
14446 exception-specification:
14447 throw ( type-id-list [opt] )
14449 Returns a TREE_LIST representing the exception-specification. The
14450 TREE_VALUE of each node is a type. */
14453 cp_parser_exception_specification_opt (cp_parser* parser)
14458 /* Peek at the next token. */
14459 token = cp_lexer_peek_token (parser->lexer);
14460 /* If it's not `throw', then there's no exception-specification. */
14461 if (!cp_parser_is_keyword (token, RID_THROW))
14464 /* Consume the `throw'. */
14465 cp_lexer_consume_token (parser->lexer);
14467 /* Look for the `('. */
14468 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14470 /* Peek at the next token. */
14471 token = cp_lexer_peek_token (parser->lexer);
14472 /* If it's not a `)', then there is a type-id-list. */
14473 if (token->type != CPP_CLOSE_PAREN)
14475 const char *saved_message;
14477 /* Types may not be defined in an exception-specification. */
14478 saved_message = parser->type_definition_forbidden_message;
14479 parser->type_definition_forbidden_message
14480 = "types may not be defined in an exception-specification";
14481 /* Parse the type-id-list. */
14482 type_id_list = cp_parser_type_id_list (parser);
14483 /* Restore the saved message. */
14484 parser->type_definition_forbidden_message = saved_message;
14487 type_id_list = empty_except_spec;
14489 /* Look for the `)'. */
14490 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14492 return type_id_list;
14495 /* Parse an (optional) type-id-list.
14499 type-id-list , type-id
14501 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
14502 in the order that the types were presented. */
14505 cp_parser_type_id_list (cp_parser* parser)
14507 tree types = NULL_TREE;
14514 /* Get the next type-id. */
14515 type = cp_parser_type_id (parser);
14516 /* Add it to the list. */
14517 types = add_exception_specifier (types, type, /*complain=*/1);
14518 /* Peek at the next token. */
14519 token = cp_lexer_peek_token (parser->lexer);
14520 /* If it is not a `,', we are done. */
14521 if (token->type != CPP_COMMA)
14523 /* Consume the `,'. */
14524 cp_lexer_consume_token (parser->lexer);
14527 return nreverse (types);
14530 /* Parse a try-block.
14533 try compound-statement handler-seq */
14536 cp_parser_try_block (cp_parser* parser)
14540 cp_parser_require_keyword (parser, RID_TRY, "`try'");
14541 try_block = begin_try_block ();
14542 cp_parser_compound_statement (parser, NULL, true);
14543 finish_try_block (try_block);
14544 cp_parser_handler_seq (parser);
14545 finish_handler_sequence (try_block);
14550 /* Parse a function-try-block.
14552 function-try-block:
14553 try ctor-initializer [opt] function-body handler-seq */
14556 cp_parser_function_try_block (cp_parser* parser)
14558 tree compound_stmt;
14560 bool ctor_initializer_p;
14562 /* Look for the `try' keyword. */
14563 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
14565 /* Let the rest of the front-end know where we are. */
14566 try_block = begin_function_try_block (&compound_stmt);
14567 /* Parse the function-body. */
14569 = cp_parser_ctor_initializer_opt_and_function_body (parser);
14570 /* We're done with the `try' part. */
14571 finish_function_try_block (try_block);
14572 /* Parse the handlers. */
14573 cp_parser_handler_seq (parser);
14574 /* We're done with the handlers. */
14575 finish_function_handler_sequence (try_block, compound_stmt);
14577 return ctor_initializer_p;
14580 /* Parse a handler-seq.
14583 handler handler-seq [opt] */
14586 cp_parser_handler_seq (cp_parser* parser)
14592 /* Parse the handler. */
14593 cp_parser_handler (parser);
14594 /* Peek at the next token. */
14595 token = cp_lexer_peek_token (parser->lexer);
14596 /* If it's not `catch' then there are no more handlers. */
14597 if (!cp_parser_is_keyword (token, RID_CATCH))
14602 /* Parse a handler.
14605 catch ( exception-declaration ) compound-statement */
14608 cp_parser_handler (cp_parser* parser)
14613 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
14614 handler = begin_handler ();
14615 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14616 declaration = cp_parser_exception_declaration (parser);
14617 finish_handler_parms (declaration, handler);
14618 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14619 cp_parser_compound_statement (parser, NULL, false);
14620 finish_handler (handler);
14623 /* Parse an exception-declaration.
14625 exception-declaration:
14626 type-specifier-seq declarator
14627 type-specifier-seq abstract-declarator
14631 Returns a VAR_DECL for the declaration, or NULL_TREE if the
14632 ellipsis variant is used. */
14635 cp_parser_exception_declaration (cp_parser* parser)
14637 cp_decl_specifier_seq type_specifiers;
14638 cp_declarator *declarator;
14639 const char *saved_message;
14641 /* If it's an ellipsis, it's easy to handle. */
14642 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14644 /* Consume the `...' token. */
14645 cp_lexer_consume_token (parser->lexer);
14649 /* Types may not be defined in exception-declarations. */
14650 saved_message = parser->type_definition_forbidden_message;
14651 parser->type_definition_forbidden_message
14652 = "types may not be defined in exception-declarations";
14654 /* Parse the type-specifier-seq. */
14655 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
14657 /* If it's a `)', then there is no declarator. */
14658 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
14661 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
14662 /*ctor_dtor_or_conv_p=*/NULL,
14663 /*parenthesized_p=*/NULL,
14664 /*member_p=*/false);
14666 /* Restore the saved message. */
14667 parser->type_definition_forbidden_message = saved_message;
14669 if (!type_specifiers.any_specifiers_p)
14670 return error_mark_node;
14672 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
14675 /* Parse a throw-expression.
14678 throw assignment-expression [opt]
14680 Returns a THROW_EXPR representing the throw-expression. */
14683 cp_parser_throw_expression (cp_parser* parser)
14688 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
14689 token = cp_lexer_peek_token (parser->lexer);
14690 /* Figure out whether or not there is an assignment-expression
14691 following the "throw" keyword. */
14692 if (token->type == CPP_COMMA
14693 || token->type == CPP_SEMICOLON
14694 || token->type == CPP_CLOSE_PAREN
14695 || token->type == CPP_CLOSE_SQUARE
14696 || token->type == CPP_CLOSE_BRACE
14697 || token->type == CPP_COLON)
14698 expression = NULL_TREE;
14700 expression = cp_parser_assignment_expression (parser,
14703 return build_throw (expression);
14706 /* GNU Extensions */
14708 /* Parse an (optional) asm-specification.
14711 asm ( string-literal )
14713 If the asm-specification is present, returns a STRING_CST
14714 corresponding to the string-literal. Otherwise, returns
14718 cp_parser_asm_specification_opt (cp_parser* parser)
14721 tree asm_specification;
14723 /* Peek at the next token. */
14724 token = cp_lexer_peek_token (parser->lexer);
14725 /* If the next token isn't the `asm' keyword, then there's no
14726 asm-specification. */
14727 if (!cp_parser_is_keyword (token, RID_ASM))
14730 /* Consume the `asm' token. */
14731 cp_lexer_consume_token (parser->lexer);
14732 /* Look for the `('. */
14733 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14735 /* Look for the string-literal. */
14736 asm_specification = cp_parser_string_literal (parser, false, false);
14738 /* Look for the `)'. */
14739 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
14741 return asm_specification;
14744 /* Parse an asm-operand-list.
14748 asm-operand-list , asm-operand
14751 string-literal ( expression )
14752 [ string-literal ] string-literal ( expression )
14754 Returns a TREE_LIST representing the operands. The TREE_VALUE of
14755 each node is the expression. The TREE_PURPOSE is itself a
14756 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
14757 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
14758 is a STRING_CST for the string literal before the parenthesis. */
14761 cp_parser_asm_operand_list (cp_parser* parser)
14763 tree asm_operands = NULL_TREE;
14767 tree string_literal;
14771 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
14773 /* Consume the `[' token. */
14774 cp_lexer_consume_token (parser->lexer);
14775 /* Read the operand name. */
14776 name = cp_parser_identifier (parser);
14777 if (name != error_mark_node)
14778 name = build_string (IDENTIFIER_LENGTH (name),
14779 IDENTIFIER_POINTER (name));
14780 /* Look for the closing `]'. */
14781 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
14785 /* Look for the string-literal. */
14786 string_literal = cp_parser_string_literal (parser, false, false);
14788 /* Look for the `('. */
14789 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14790 /* Parse the expression. */
14791 expression = cp_parser_expression (parser, /*cast_p=*/false);
14792 /* Look for the `)'. */
14793 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14795 /* Add this operand to the list. */
14796 asm_operands = tree_cons (build_tree_list (name, string_literal),
14799 /* If the next token is not a `,', there are no more
14801 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14803 /* Consume the `,'. */
14804 cp_lexer_consume_token (parser->lexer);
14807 return nreverse (asm_operands);
14810 /* Parse an asm-clobber-list.
14814 asm-clobber-list , string-literal
14816 Returns a TREE_LIST, indicating the clobbers in the order that they
14817 appeared. The TREE_VALUE of each node is a STRING_CST. */
14820 cp_parser_asm_clobber_list (cp_parser* parser)
14822 tree clobbers = NULL_TREE;
14826 tree string_literal;
14828 /* Look for the string literal. */
14829 string_literal = cp_parser_string_literal (parser, false, false);
14830 /* Add it to the list. */
14831 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
14832 /* If the next token is not a `,', then the list is
14834 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14836 /* Consume the `,' token. */
14837 cp_lexer_consume_token (parser->lexer);
14843 /* Parse an (optional) series of attributes.
14846 attributes attribute
14849 __attribute__ (( attribute-list [opt] ))
14851 The return value is as for cp_parser_attribute_list. */
14854 cp_parser_attributes_opt (cp_parser* parser)
14856 tree attributes = NULL_TREE;
14861 tree attribute_list;
14863 /* Peek at the next token. */
14864 token = cp_lexer_peek_token (parser->lexer);
14865 /* If it's not `__attribute__', then we're done. */
14866 if (token->keyword != RID_ATTRIBUTE)
14869 /* Consume the `__attribute__' keyword. */
14870 cp_lexer_consume_token (parser->lexer);
14871 /* Look for the two `(' tokens. */
14872 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14873 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14875 /* Peek at the next token. */
14876 token = cp_lexer_peek_token (parser->lexer);
14877 if (token->type != CPP_CLOSE_PAREN)
14878 /* Parse the attribute-list. */
14879 attribute_list = cp_parser_attribute_list (parser);
14881 /* If the next token is a `)', then there is no attribute
14883 attribute_list = NULL;
14885 /* Look for the two `)' tokens. */
14886 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14887 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14889 /* Add these new attributes to the list. */
14890 attributes = chainon (attributes, attribute_list);
14896 /* Parse an attribute-list.
14900 attribute-list , attribute
14904 identifier ( identifier )
14905 identifier ( identifier , expression-list )
14906 identifier ( expression-list )
14908 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
14909 to an attribute. The TREE_PURPOSE of each node is the identifier
14910 indicating which attribute is in use. The TREE_VALUE represents
14911 the arguments, if any. */
14914 cp_parser_attribute_list (cp_parser* parser)
14916 tree attribute_list = NULL_TREE;
14917 bool save_translate_strings_p = parser->translate_strings_p;
14919 parser->translate_strings_p = false;
14926 /* Look for the identifier. We also allow keywords here; for
14927 example `__attribute__ ((const))' is legal. */
14928 token = cp_lexer_peek_token (parser->lexer);
14929 if (token->type == CPP_NAME
14930 || token->type == CPP_KEYWORD)
14932 tree arguments = NULL_TREE;
14934 /* Consume the token. */
14935 token = cp_lexer_consume_token (parser->lexer);
14937 /* Save away the identifier that indicates which attribute
14939 identifier = token->u.value;
14940 attribute = build_tree_list (identifier, NULL_TREE);
14942 /* Peek at the next token. */
14943 token = cp_lexer_peek_token (parser->lexer);
14944 /* If it's an `(', then parse the attribute arguments. */
14945 if (token->type == CPP_OPEN_PAREN)
14947 arguments = cp_parser_parenthesized_expression_list
14948 (parser, true, /*cast_p=*/false,
14949 /*non_constant_p=*/NULL);
14950 /* Save the arguments away. */
14951 TREE_VALUE (attribute) = arguments;
14954 if (arguments != error_mark_node)
14956 /* Add this attribute to the list. */
14957 TREE_CHAIN (attribute) = attribute_list;
14958 attribute_list = attribute;
14961 token = cp_lexer_peek_token (parser->lexer);
14963 /* Now, look for more attributes. If the next token isn't a
14964 `,', we're done. */
14965 if (token->type != CPP_COMMA)
14968 /* Consume the comma and keep going. */
14969 cp_lexer_consume_token (parser->lexer);
14971 parser->translate_strings_p = save_translate_strings_p;
14973 /* We built up the list in reverse order. */
14974 return nreverse (attribute_list);
14977 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
14978 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
14979 current value of the PEDANTIC flag, regardless of whether or not
14980 the `__extension__' keyword is present. The caller is responsible
14981 for restoring the value of the PEDANTIC flag. */
14984 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
14986 /* Save the old value of the PEDANTIC flag. */
14987 *saved_pedantic = pedantic;
14989 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
14991 /* Consume the `__extension__' token. */
14992 cp_lexer_consume_token (parser->lexer);
14993 /* We're not being pedantic while the `__extension__' keyword is
15003 /* Parse a label declaration.
15006 __label__ label-declarator-seq ;
15008 label-declarator-seq:
15009 identifier , label-declarator-seq
15013 cp_parser_label_declaration (cp_parser* parser)
15015 /* Look for the `__label__' keyword. */
15016 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
15022 /* Look for an identifier. */
15023 identifier = cp_parser_identifier (parser);
15024 /* If we failed, stop. */
15025 if (identifier == error_mark_node)
15027 /* Declare it as a label. */
15028 finish_label_decl (identifier);
15029 /* If the next token is a `;', stop. */
15030 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15032 /* Look for the `,' separating the label declarations. */
15033 cp_parser_require (parser, CPP_COMMA, "`,'");
15036 /* Look for the final `;'. */
15037 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
15040 /* Support Functions */
15042 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
15043 NAME should have one of the representations used for an
15044 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
15045 is returned. If PARSER->SCOPE is a dependent type, then a
15046 SCOPE_REF is returned.
15048 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
15049 returned; the name was already resolved when the TEMPLATE_ID_EXPR
15050 was formed. Abstractly, such entities should not be passed to this
15051 function, because they do not need to be looked up, but it is
15052 simpler to check for this special case here, rather than at the
15055 In cases not explicitly covered above, this function returns a
15056 DECL, OVERLOAD, or baselink representing the result of the lookup.
15057 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
15060 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
15061 (e.g., "struct") that was used. In that case bindings that do not
15062 refer to types are ignored.
15064 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
15067 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
15070 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
15073 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
15074 TREE_LIST of candidates if name-lookup results in an ambiguity, and
15075 NULL_TREE otherwise. */
15078 cp_parser_lookup_name (cp_parser *parser, tree name,
15079 enum tag_types tag_type,
15082 bool check_dependency,
15083 tree *ambiguous_decls)
15087 tree object_type = parser->context->object_type;
15089 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
15090 flags |= LOOKUP_COMPLAIN;
15092 /* Assume that the lookup will be unambiguous. */
15093 if (ambiguous_decls)
15094 *ambiguous_decls = NULL_TREE;
15096 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
15097 no longer valid. Note that if we are parsing tentatively, and
15098 the parse fails, OBJECT_TYPE will be automatically restored. */
15099 parser->context->object_type = NULL_TREE;
15101 if (name == error_mark_node)
15102 return error_mark_node;
15104 /* A template-id has already been resolved; there is no lookup to
15106 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
15108 if (BASELINK_P (name))
15110 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
15111 == TEMPLATE_ID_EXPR);
15115 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
15116 it should already have been checked to make sure that the name
15117 used matches the type being destroyed. */
15118 if (TREE_CODE (name) == BIT_NOT_EXPR)
15122 /* Figure out to which type this destructor applies. */
15124 type = parser->scope;
15125 else if (object_type)
15126 type = object_type;
15128 type = current_class_type;
15129 /* If that's not a class type, there is no destructor. */
15130 if (!type || !CLASS_TYPE_P (type))
15131 return error_mark_node;
15132 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
15133 lazily_declare_fn (sfk_destructor, type);
15134 if (!CLASSTYPE_DESTRUCTORS (type))
15135 return error_mark_node;
15136 /* If it was a class type, return the destructor. */
15137 return CLASSTYPE_DESTRUCTORS (type);
15140 /* By this point, the NAME should be an ordinary identifier. If
15141 the id-expression was a qualified name, the qualifying scope is
15142 stored in PARSER->SCOPE at this point. */
15143 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
15145 /* Perform the lookup. */
15150 if (parser->scope == error_mark_node)
15151 return error_mark_node;
15153 /* If the SCOPE is dependent, the lookup must be deferred until
15154 the template is instantiated -- unless we are explicitly
15155 looking up names in uninstantiated templates. Even then, we
15156 cannot look up the name if the scope is not a class type; it
15157 might, for example, be a template type parameter. */
15158 dependent_p = (TYPE_P (parser->scope)
15159 && !(parser->in_declarator_p
15160 && currently_open_class (parser->scope))
15161 && dependent_type_p (parser->scope));
15162 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
15169 /* The resolution to Core Issue 180 says that `struct
15170 A::B' should be considered a type-name, even if `A'
15172 type = make_typename_type (parser->scope, name, tag_type,
15173 /*complain=*/tf_error);
15174 decl = TYPE_NAME (type);
15176 else if (is_template
15177 && (cp_parser_next_token_ends_template_argument_p (parser)
15178 || cp_lexer_next_token_is (parser->lexer,
15180 decl = make_unbound_class_template (parser->scope,
15182 /*complain=*/tf_error);
15184 decl = build_qualified_name (/*type=*/NULL_TREE,
15185 parser->scope, name,
15190 tree pushed_scope = NULL_TREE;
15192 /* If PARSER->SCOPE is a dependent type, then it must be a
15193 class type, and we must not be checking dependencies;
15194 otherwise, we would have processed this lookup above. So
15195 that PARSER->SCOPE is not considered a dependent base by
15196 lookup_member, we must enter the scope here. */
15198 pushed_scope = push_scope (parser->scope);
15199 /* If the PARSER->SCOPE is a template specialization, it
15200 may be instantiated during name lookup. In that case,
15201 errors may be issued. Even if we rollback the current
15202 tentative parse, those errors are valid. */
15203 decl = lookup_qualified_name (parser->scope, name,
15204 tag_type != none_type,
15205 /*complain=*/true);
15207 pop_scope (pushed_scope);
15209 parser->qualifying_scope = parser->scope;
15210 parser->object_scope = NULL_TREE;
15212 else if (object_type)
15214 tree object_decl = NULL_TREE;
15215 /* Look up the name in the scope of the OBJECT_TYPE, unless the
15216 OBJECT_TYPE is not a class. */
15217 if (CLASS_TYPE_P (object_type))
15218 /* If the OBJECT_TYPE is a template specialization, it may
15219 be instantiated during name lookup. In that case, errors
15220 may be issued. Even if we rollback the current tentative
15221 parse, those errors are valid. */
15222 object_decl = lookup_member (object_type,
15225 tag_type != none_type);
15226 /* Look it up in the enclosing context, too. */
15227 decl = lookup_name_real (name, tag_type != none_type,
15229 /*block_p=*/true, is_namespace, flags);
15230 parser->object_scope = object_type;
15231 parser->qualifying_scope = NULL_TREE;
15233 decl = object_decl;
15237 decl = lookup_name_real (name, tag_type != none_type,
15239 /*block_p=*/true, is_namespace, flags);
15240 parser->qualifying_scope = NULL_TREE;
15241 parser->object_scope = NULL_TREE;
15244 /* If the lookup failed, let our caller know. */
15245 if (!decl || decl == error_mark_node)
15246 return error_mark_node;
15248 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
15249 if (TREE_CODE (decl) == TREE_LIST)
15251 if (ambiguous_decls)
15252 *ambiguous_decls = decl;
15253 /* The error message we have to print is too complicated for
15254 cp_parser_error, so we incorporate its actions directly. */
15255 if (!cp_parser_simulate_error (parser))
15257 error ("reference to %qD is ambiguous", name);
15258 print_candidates (decl);
15260 return error_mark_node;
15263 gcc_assert (DECL_P (decl)
15264 || TREE_CODE (decl) == OVERLOAD
15265 || TREE_CODE (decl) == SCOPE_REF
15266 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
15267 || BASELINK_P (decl));
15269 /* If we have resolved the name of a member declaration, check to
15270 see if the declaration is accessible. When the name resolves to
15271 set of overloaded functions, accessibility is checked when
15272 overload resolution is done.
15274 During an explicit instantiation, access is not checked at all,
15275 as per [temp.explicit]. */
15277 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
15282 /* Like cp_parser_lookup_name, but for use in the typical case where
15283 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
15284 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
15287 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
15289 return cp_parser_lookup_name (parser, name,
15291 /*is_template=*/false,
15292 /*is_namespace=*/false,
15293 /*check_dependency=*/true,
15294 /*ambiguous_decls=*/NULL);
15297 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
15298 the current context, return the TYPE_DECL. If TAG_NAME_P is
15299 true, the DECL indicates the class being defined in a class-head,
15300 or declared in an elaborated-type-specifier.
15302 Otherwise, return DECL. */
15305 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
15307 /* If the TEMPLATE_DECL is being declared as part of a class-head,
15308 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
15311 template <typename T> struct B;
15314 template <typename T> struct A::B {};
15316 Similarly, in an elaborated-type-specifier:
15318 namespace N { struct X{}; }
15321 template <typename T> friend struct N::X;
15324 However, if the DECL refers to a class type, and we are in
15325 the scope of the class, then the name lookup automatically
15326 finds the TYPE_DECL created by build_self_reference rather
15327 than a TEMPLATE_DECL. For example, in:
15329 template <class T> struct S {
15333 there is no need to handle such case. */
15335 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
15336 return DECL_TEMPLATE_RESULT (decl);
15341 /* If too many, or too few, template-parameter lists apply to the
15342 declarator, issue an error message. Returns TRUE if all went well,
15343 and FALSE otherwise. */
15346 cp_parser_check_declarator_template_parameters (cp_parser* parser,
15347 cp_declarator *declarator)
15349 unsigned num_templates;
15351 /* We haven't seen any classes that involve template parameters yet. */
15354 switch (declarator->kind)
15357 if (declarator->u.id.qualifying_scope)
15362 scope = declarator->u.id.qualifying_scope;
15363 member = declarator->u.id.unqualified_name;
15365 while (scope && CLASS_TYPE_P (scope))
15367 /* You're supposed to have one `template <...>'
15368 for every template class, but you don't need one
15369 for a full specialization. For example:
15371 template <class T> struct S{};
15372 template <> struct S<int> { void f(); };
15373 void S<int>::f () {}
15375 is correct; there shouldn't be a `template <>' for
15376 the definition of `S<int>::f'. */
15377 if (!CLASSTYPE_TEMPLATE_INFO (scope))
15378 /* If SCOPE does not have template information of any
15379 kind, then it is not a template, nor is it nested
15380 within a template. */
15382 if (explicit_class_specialization_p (scope))
15384 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
15387 scope = TYPE_CONTEXT (scope);
15390 else if (TREE_CODE (declarator->u.id.unqualified_name)
15391 == TEMPLATE_ID_EXPR)
15392 /* If the DECLARATOR has the form `X<y>' then it uses one
15393 additional level of template parameters. */
15396 return cp_parser_check_template_parameters (parser,
15402 case cdk_reference:
15404 return (cp_parser_check_declarator_template_parameters
15405 (parser, declarator->declarator));
15411 gcc_unreachable ();
15416 /* NUM_TEMPLATES were used in the current declaration. If that is
15417 invalid, return FALSE and issue an error messages. Otherwise,
15421 cp_parser_check_template_parameters (cp_parser* parser,
15422 unsigned num_templates)
15424 /* If there are more template classes than parameter lists, we have
15427 template <class T> void S<T>::R<T>::f (); */
15428 if (parser->num_template_parameter_lists < num_templates)
15430 error ("too few template-parameter-lists");
15433 /* If there are the same number of template classes and parameter
15434 lists, that's OK. */
15435 if (parser->num_template_parameter_lists == num_templates)
15437 /* If there are more, but only one more, then we are referring to a
15438 member template. That's OK too. */
15439 if (parser->num_template_parameter_lists == num_templates + 1)
15441 /* Otherwise, there are too many template parameter lists. We have
15444 template <class T> template <class U> void S::f(); */
15445 error ("too many template-parameter-lists");
15449 /* Parse an optional `::' token indicating that the following name is
15450 from the global namespace. If so, PARSER->SCOPE is set to the
15451 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
15452 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
15453 Returns the new value of PARSER->SCOPE, if the `::' token is
15454 present, and NULL_TREE otherwise. */
15457 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
15461 /* Peek at the next token. */
15462 token = cp_lexer_peek_token (parser->lexer);
15463 /* If we're looking at a `::' token then we're starting from the
15464 global namespace, not our current location. */
15465 if (token->type == CPP_SCOPE)
15467 /* Consume the `::' token. */
15468 cp_lexer_consume_token (parser->lexer);
15469 /* Set the SCOPE so that we know where to start the lookup. */
15470 parser->scope = global_namespace;
15471 parser->qualifying_scope = global_namespace;
15472 parser->object_scope = NULL_TREE;
15474 return parser->scope;
15476 else if (!current_scope_valid_p)
15478 parser->scope = NULL_TREE;
15479 parser->qualifying_scope = NULL_TREE;
15480 parser->object_scope = NULL_TREE;
15486 /* Returns TRUE if the upcoming token sequence is the start of a
15487 constructor declarator. If FRIEND_P is true, the declarator is
15488 preceded by the `friend' specifier. */
15491 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
15493 bool constructor_p;
15494 tree type_decl = NULL_TREE;
15495 bool nested_name_p;
15496 cp_token *next_token;
15498 /* The common case is that this is not a constructor declarator, so
15499 try to avoid doing lots of work if at all possible. It's not
15500 valid declare a constructor at function scope. */
15501 if (parser->in_function_body)
15503 /* And only certain tokens can begin a constructor declarator. */
15504 next_token = cp_lexer_peek_token (parser->lexer);
15505 if (next_token->type != CPP_NAME
15506 && next_token->type != CPP_SCOPE
15507 && next_token->type != CPP_NESTED_NAME_SPECIFIER
15508 && next_token->type != CPP_TEMPLATE_ID)
15511 /* Parse tentatively; we are going to roll back all of the tokens
15513 cp_parser_parse_tentatively (parser);
15514 /* Assume that we are looking at a constructor declarator. */
15515 constructor_p = true;
15517 /* Look for the optional `::' operator. */
15518 cp_parser_global_scope_opt (parser,
15519 /*current_scope_valid_p=*/false);
15520 /* Look for the nested-name-specifier. */
15522 = (cp_parser_nested_name_specifier_opt (parser,
15523 /*typename_keyword_p=*/false,
15524 /*check_dependency_p=*/false,
15526 /*is_declaration=*/false)
15528 /* Outside of a class-specifier, there must be a
15529 nested-name-specifier. */
15530 if (!nested_name_p &&
15531 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
15533 constructor_p = false;
15534 /* If we still think that this might be a constructor-declarator,
15535 look for a class-name. */
15540 template <typename T> struct S { S(); };
15541 template <typename T> S<T>::S ();
15543 we must recognize that the nested `S' names a class.
15546 template <typename T> S<T>::S<T> ();
15548 we must recognize that the nested `S' names a template. */
15549 type_decl = cp_parser_class_name (parser,
15550 /*typename_keyword_p=*/false,
15551 /*template_keyword_p=*/false,
15553 /*check_dependency_p=*/false,
15554 /*class_head_p=*/false,
15555 /*is_declaration=*/false);
15556 /* If there was no class-name, then this is not a constructor. */
15557 constructor_p = !cp_parser_error_occurred (parser);
15560 /* If we're still considering a constructor, we have to see a `(',
15561 to begin the parameter-declaration-clause, followed by either a
15562 `)', an `...', or a decl-specifier. We need to check for a
15563 type-specifier to avoid being fooled into thinking that:
15567 is a constructor. (It is actually a function named `f' that
15568 takes one parameter (of type `int') and returns a value of type
15571 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
15573 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
15574 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
15575 /* A parameter declaration begins with a decl-specifier,
15576 which is either the "attribute" keyword, a storage class
15577 specifier, or (usually) a type-specifier. */
15578 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
15581 tree pushed_scope = NULL_TREE;
15582 unsigned saved_num_template_parameter_lists;
15584 /* Names appearing in the type-specifier should be looked up
15585 in the scope of the class. */
15586 if (current_class_type)
15590 type = TREE_TYPE (type_decl);
15591 if (TREE_CODE (type) == TYPENAME_TYPE)
15593 type = resolve_typename_type (type,
15594 /*only_current_p=*/false);
15595 if (type == error_mark_node)
15597 cp_parser_abort_tentative_parse (parser);
15601 pushed_scope = push_scope (type);
15604 /* Inside the constructor parameter list, surrounding
15605 template-parameter-lists do not apply. */
15606 saved_num_template_parameter_lists
15607 = parser->num_template_parameter_lists;
15608 parser->num_template_parameter_lists = 0;
15610 /* Look for the type-specifier. */
15611 cp_parser_type_specifier (parser,
15612 CP_PARSER_FLAGS_NONE,
15613 /*decl_specs=*/NULL,
15614 /*is_declarator=*/true,
15615 /*declares_class_or_enum=*/NULL,
15616 /*is_cv_qualifier=*/NULL);
15618 parser->num_template_parameter_lists
15619 = saved_num_template_parameter_lists;
15621 /* Leave the scope of the class. */
15623 pop_scope (pushed_scope);
15625 constructor_p = !cp_parser_error_occurred (parser);
15629 constructor_p = false;
15630 /* We did not really want to consume any tokens. */
15631 cp_parser_abort_tentative_parse (parser);
15633 return constructor_p;
15636 /* Parse the definition of the function given by the DECL_SPECIFIERS,
15637 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
15638 they must be performed once we are in the scope of the function.
15640 Returns the function defined. */
15643 cp_parser_function_definition_from_specifiers_and_declarator
15644 (cp_parser* parser,
15645 cp_decl_specifier_seq *decl_specifiers,
15647 const cp_declarator *declarator)
15652 /* Begin the function-definition. */
15653 success_p = start_function (decl_specifiers, declarator, attributes);
15655 /* The things we're about to see are not directly qualified by any
15656 template headers we've seen thus far. */
15657 reset_specialization ();
15659 /* If there were names looked up in the decl-specifier-seq that we
15660 did not check, check them now. We must wait until we are in the
15661 scope of the function to perform the checks, since the function
15662 might be a friend. */
15663 perform_deferred_access_checks ();
15667 /* Skip the entire function. */
15668 cp_parser_skip_to_end_of_block_or_statement (parser);
15669 fn = error_mark_node;
15671 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
15673 /* Seen already, skip it. An error message has already been output. */
15674 cp_parser_skip_to_end_of_block_or_statement (parser);
15675 fn = current_function_decl;
15676 current_function_decl = NULL_TREE;
15677 /* If this is a function from a class, pop the nested class. */
15678 if (current_class_name)
15679 pop_nested_class ();
15682 fn = cp_parser_function_definition_after_declarator (parser,
15683 /*inline_p=*/false);
15688 /* Parse the part of a function-definition that follows the
15689 declarator. INLINE_P is TRUE iff this function is an inline
15690 function defined with a class-specifier.
15692 Returns the function defined. */
15695 cp_parser_function_definition_after_declarator (cp_parser* parser,
15699 bool ctor_initializer_p = false;
15700 bool saved_in_unbraced_linkage_specification_p;
15701 bool saved_in_function_body;
15702 unsigned saved_num_template_parameter_lists;
15704 saved_in_function_body = parser->in_function_body;
15705 parser->in_function_body = true;
15706 /* If the next token is `return', then the code may be trying to
15707 make use of the "named return value" extension that G++ used to
15709 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
15711 /* Consume the `return' keyword. */
15712 cp_lexer_consume_token (parser->lexer);
15713 /* Look for the identifier that indicates what value is to be
15715 cp_parser_identifier (parser);
15716 /* Issue an error message. */
15717 error ("named return values are no longer supported");
15718 /* Skip tokens until we reach the start of the function body. */
15721 cp_token *token = cp_lexer_peek_token (parser->lexer);
15722 if (token->type == CPP_OPEN_BRACE
15723 || token->type == CPP_EOF
15724 || token->type == CPP_PRAGMA_EOL)
15726 cp_lexer_consume_token (parser->lexer);
15729 /* The `extern' in `extern "C" void f () { ... }' does not apply to
15730 anything declared inside `f'. */
15731 saved_in_unbraced_linkage_specification_p
15732 = parser->in_unbraced_linkage_specification_p;
15733 parser->in_unbraced_linkage_specification_p = false;
15734 /* Inside the function, surrounding template-parameter-lists do not
15736 saved_num_template_parameter_lists
15737 = parser->num_template_parameter_lists;
15738 parser->num_template_parameter_lists = 0;
15739 /* If the next token is `try', then we are looking at a
15740 function-try-block. */
15741 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
15742 ctor_initializer_p = cp_parser_function_try_block (parser);
15743 /* A function-try-block includes the function-body, so we only do
15744 this next part if we're not processing a function-try-block. */
15747 = cp_parser_ctor_initializer_opt_and_function_body (parser);
15749 /* Finish the function. */
15750 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
15751 (inline_p ? 2 : 0));
15752 /* Generate code for it, if necessary. */
15753 expand_or_defer_fn (fn);
15754 /* Restore the saved values. */
15755 parser->in_unbraced_linkage_specification_p
15756 = saved_in_unbraced_linkage_specification_p;
15757 parser->num_template_parameter_lists
15758 = saved_num_template_parameter_lists;
15759 parser->in_function_body = saved_in_function_body;
15764 /* Parse a template-declaration, assuming that the `export' (and
15765 `extern') keywords, if present, has already been scanned. MEMBER_P
15766 is as for cp_parser_template_declaration. */
15769 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
15771 tree decl = NULL_TREE;
15772 VEC (deferred_access_check,gc) *checks;
15773 tree parameter_list;
15774 bool friend_p = false;
15775 bool need_lang_pop;
15777 /* Look for the `template' keyword. */
15778 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
15782 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
15784 if (at_class_scope_p () && current_function_decl)
15786 /* 14.5.2.2 [temp.mem]
15788 A local class shall not have member templates. */
15789 error ("invalid declaration of member template in local class");
15790 cp_parser_skip_to_end_of_block_or_statement (parser);
15795 A template ... shall not have C linkage. */
15796 if (current_lang_name == lang_name_c)
15798 error ("template with C linkage");
15799 /* Give it C++ linkage to avoid confusing other parts of the
15801 push_lang_context (lang_name_cplusplus);
15802 need_lang_pop = true;
15805 need_lang_pop = false;
15807 /* We cannot perform access checks on the template parameter
15808 declarations until we know what is being declared, just as we
15809 cannot check the decl-specifier list. */
15810 push_deferring_access_checks (dk_deferred);
15812 /* If the next token is `>', then we have an invalid
15813 specialization. Rather than complain about an invalid template
15814 parameter, issue an error message here. */
15815 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15817 cp_parser_error (parser, "invalid explicit specialization");
15818 begin_specialization ();
15819 parameter_list = NULL_TREE;
15822 /* Parse the template parameters. */
15823 parameter_list = cp_parser_template_parameter_list (parser);
15825 /* Get the deferred access checks from the parameter list. These
15826 will be checked once we know what is being declared, as for a
15827 member template the checks must be performed in the scope of the
15828 class containing the member. */
15829 checks = get_deferred_access_checks ();
15831 /* Look for the `>'. */
15832 cp_parser_skip_to_end_of_template_parameter_list (parser);
15833 /* We just processed one more parameter list. */
15834 ++parser->num_template_parameter_lists;
15835 /* If the next token is `template', there are more template
15837 if (cp_lexer_next_token_is_keyword (parser->lexer,
15839 cp_parser_template_declaration_after_export (parser, member_p);
15842 /* There are no access checks when parsing a template, as we do not
15843 know if a specialization will be a friend. */
15844 push_deferring_access_checks (dk_no_check);
15845 decl = cp_parser_single_declaration (parser,
15849 pop_deferring_access_checks ();
15851 /* If this is a member template declaration, let the front
15853 if (member_p && !friend_p && decl)
15855 if (TREE_CODE (decl) == TYPE_DECL)
15856 cp_parser_check_access_in_redeclaration (decl);
15858 decl = finish_member_template_decl (decl);
15860 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
15861 make_friend_class (current_class_type, TREE_TYPE (decl),
15862 /*complain=*/true);
15864 /* We are done with the current parameter list. */
15865 --parser->num_template_parameter_lists;
15867 pop_deferring_access_checks ();
15870 finish_template_decl (parameter_list);
15872 /* Register member declarations. */
15873 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
15874 finish_member_declaration (decl);
15875 /* For the erroneous case of a template with C linkage, we pushed an
15876 implicit C++ linkage scope; exit that scope now. */
15878 pop_lang_context ();
15879 /* If DECL is a function template, we must return to parse it later.
15880 (Even though there is no definition, there might be default
15881 arguments that need handling.) */
15882 if (member_p && decl
15883 && (TREE_CODE (decl) == FUNCTION_DECL
15884 || DECL_FUNCTION_TEMPLATE_P (decl)))
15885 TREE_VALUE (parser->unparsed_functions_queues)
15886 = tree_cons (NULL_TREE, decl,
15887 TREE_VALUE (parser->unparsed_functions_queues));
15890 /* Perform the deferred access checks from a template-parameter-list.
15891 CHECKS is a TREE_LIST of access checks, as returned by
15892 get_deferred_access_checks. */
15895 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
15897 ++processing_template_parmlist;
15898 perform_access_checks (checks);
15899 --processing_template_parmlist;
15902 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
15903 `function-definition' sequence. MEMBER_P is true, this declaration
15904 appears in a class scope.
15906 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
15907 *FRIEND_P is set to TRUE iff the declaration is a friend. */
15910 cp_parser_single_declaration (cp_parser* parser,
15911 VEC (deferred_access_check,gc)* checks,
15915 int declares_class_or_enum;
15916 tree decl = NULL_TREE;
15917 cp_decl_specifier_seq decl_specifiers;
15918 bool function_definition_p = false;
15920 /* This function is only used when processing a template
15922 gcc_assert (innermost_scope_kind () == sk_template_parms
15923 || innermost_scope_kind () == sk_template_spec);
15925 /* Defer access checks until we know what is being declared. */
15926 push_deferring_access_checks (dk_deferred);
15928 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
15930 cp_parser_decl_specifier_seq (parser,
15931 CP_PARSER_FLAGS_OPTIONAL,
15933 &declares_class_or_enum);
15935 *friend_p = cp_parser_friend_p (&decl_specifiers);
15937 /* There are no template typedefs. */
15938 if (decl_specifiers.specs[(int) ds_typedef])
15940 error ("template declaration of %qs", "typedef");
15941 decl = error_mark_node;
15944 /* Gather up the access checks that occurred the
15945 decl-specifier-seq. */
15946 stop_deferring_access_checks ();
15948 /* Check for the declaration of a template class. */
15949 if (declares_class_or_enum)
15951 if (cp_parser_declares_only_class_p (parser))
15953 decl = shadow_tag (&decl_specifiers);
15958 friend template <typename T> struct A<T>::B;
15961 A<T>::B will be represented by a TYPENAME_TYPE, and
15962 therefore not recognized by shadow_tag. */
15963 if (friend_p && *friend_p
15965 && decl_specifiers.type
15966 && TYPE_P (decl_specifiers.type))
15967 decl = decl_specifiers.type;
15969 if (decl && decl != error_mark_node)
15970 decl = TYPE_NAME (decl);
15972 decl = error_mark_node;
15974 /* Perform access checks for template parameters. */
15975 cp_parser_perform_template_parameter_access_checks (checks);
15978 /* If it's not a template class, try for a template function. If
15979 the next token is a `;', then this declaration does not declare
15980 anything. But, if there were errors in the decl-specifiers, then
15981 the error might well have come from an attempted class-specifier.
15982 In that case, there's no need to warn about a missing declarator. */
15984 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
15985 || decl_specifiers.type != error_mark_node))
15986 decl = cp_parser_init_declarator (parser,
15989 /*function_definition_allowed_p=*/true,
15991 declares_class_or_enum,
15992 &function_definition_p);
15994 pop_deferring_access_checks ();
15996 /* Clear any current qualification; whatever comes next is the start
15997 of something new. */
15998 parser->scope = NULL_TREE;
15999 parser->qualifying_scope = NULL_TREE;
16000 parser->object_scope = NULL_TREE;
16001 /* Look for a trailing `;' after the declaration. */
16002 if (!function_definition_p
16003 && (decl == error_mark_node
16004 || !cp_parser_require (parser, CPP_SEMICOLON, "`;'")))
16005 cp_parser_skip_to_end_of_block_or_statement (parser);
16010 /* Parse a cast-expression that is not the operand of a unary "&". */
16013 cp_parser_simple_cast_expression (cp_parser *parser)
16015 return cp_parser_cast_expression (parser, /*address_p=*/false,
16019 /* Parse a functional cast to TYPE. Returns an expression
16020 representing the cast. */
16023 cp_parser_functional_cast (cp_parser* parser, tree type)
16025 tree expression_list;
16029 = cp_parser_parenthesized_expression_list (parser, false,
16031 /*non_constant_p=*/NULL);
16033 cast = build_functional_cast (type, expression_list);
16034 /* [expr.const]/1: In an integral constant expression "only type
16035 conversions to integral or enumeration type can be used". */
16036 if (TREE_CODE (type) == TYPE_DECL)
16037 type = TREE_TYPE (type);
16038 if (cast != error_mark_node
16039 && !cast_valid_in_integral_constant_expression_p (type)
16040 && (cp_parser_non_integral_constant_expression
16041 (parser, "a call to a constructor")))
16042 return error_mark_node;
16046 /* Save the tokens that make up the body of a member function defined
16047 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
16048 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
16049 specifiers applied to the declaration. Returns the FUNCTION_DECL
16050 for the member function. */
16053 cp_parser_save_member_function_body (cp_parser* parser,
16054 cp_decl_specifier_seq *decl_specifiers,
16055 cp_declarator *declarator,
16062 /* Create the function-declaration. */
16063 fn = start_method (decl_specifiers, declarator, attributes);
16064 /* If something went badly wrong, bail out now. */
16065 if (fn == error_mark_node)
16067 /* If there's a function-body, skip it. */
16068 if (cp_parser_token_starts_function_definition_p
16069 (cp_lexer_peek_token (parser->lexer)))
16070 cp_parser_skip_to_end_of_block_or_statement (parser);
16071 return error_mark_node;
16074 /* Remember it, if there default args to post process. */
16075 cp_parser_save_default_args (parser, fn);
16077 /* Save away the tokens that make up the body of the
16079 first = parser->lexer->next_token;
16080 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
16081 /* Handle function try blocks. */
16082 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
16083 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
16084 last = parser->lexer->next_token;
16086 /* Save away the inline definition; we will process it when the
16087 class is complete. */
16088 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
16089 DECL_PENDING_INLINE_P (fn) = 1;
16091 /* We need to know that this was defined in the class, so that
16092 friend templates are handled correctly. */
16093 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
16095 /* We're done with the inline definition. */
16096 finish_method (fn);
16098 /* Add FN to the queue of functions to be parsed later. */
16099 TREE_VALUE (parser->unparsed_functions_queues)
16100 = tree_cons (NULL_TREE, fn,
16101 TREE_VALUE (parser->unparsed_functions_queues));
16106 /* Parse a template-argument-list, as well as the trailing ">" (but
16107 not the opening ">"). See cp_parser_template_argument_list for the
16111 cp_parser_enclosed_template_argument_list (cp_parser* parser)
16115 tree saved_qualifying_scope;
16116 tree saved_object_scope;
16117 bool saved_greater_than_is_operator_p;
16118 bool saved_skip_evaluation;
16122 When parsing a template-id, the first non-nested `>' is taken as
16123 the end of the template-argument-list rather than a greater-than
16125 saved_greater_than_is_operator_p
16126 = parser->greater_than_is_operator_p;
16127 parser->greater_than_is_operator_p = false;
16128 /* Parsing the argument list may modify SCOPE, so we save it
16130 saved_scope = parser->scope;
16131 saved_qualifying_scope = parser->qualifying_scope;
16132 saved_object_scope = parser->object_scope;
16133 /* We need to evaluate the template arguments, even though this
16134 template-id may be nested within a "sizeof". */
16135 saved_skip_evaluation = skip_evaluation;
16136 skip_evaluation = false;
16137 /* Parse the template-argument-list itself. */
16138 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
16139 arguments = NULL_TREE;
16141 arguments = cp_parser_template_argument_list (parser);
16142 /* Look for the `>' that ends the template-argument-list. If we find
16143 a '>>' instead, it's probably just a typo. */
16144 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
16146 if (!saved_greater_than_is_operator_p)
16148 /* If we're in a nested template argument list, the '>>' has
16149 to be a typo for '> >'. We emit the error message, but we
16150 continue parsing and we push a '>' as next token, so that
16151 the argument list will be parsed correctly. Note that the
16152 global source location is still on the token before the
16153 '>>', so we need to say explicitly where we want it. */
16154 cp_token *token = cp_lexer_peek_token (parser->lexer);
16155 error ("%H%<>>%> should be %<> >%> "
16156 "within a nested template argument list",
16159 /* ??? Proper recovery should terminate two levels of
16160 template argument list here. */
16161 token->type = CPP_GREATER;
16165 /* If this is not a nested template argument list, the '>>'
16166 is a typo for '>'. Emit an error message and continue.
16167 Same deal about the token location, but here we can get it
16168 right by consuming the '>>' before issuing the diagnostic. */
16169 cp_lexer_consume_token (parser->lexer);
16170 error ("spurious %<>>%>, use %<>%> to terminate "
16171 "a template argument list");
16175 cp_parser_skip_to_end_of_template_parameter_list (parser);
16176 /* The `>' token might be a greater-than operator again now. */
16177 parser->greater_than_is_operator_p
16178 = saved_greater_than_is_operator_p;
16179 /* Restore the SAVED_SCOPE. */
16180 parser->scope = saved_scope;
16181 parser->qualifying_scope = saved_qualifying_scope;
16182 parser->object_scope = saved_object_scope;
16183 skip_evaluation = saved_skip_evaluation;
16188 /* MEMBER_FUNCTION is a member function, or a friend. If default
16189 arguments, or the body of the function have not yet been parsed,
16193 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
16195 /* If this member is a template, get the underlying
16197 if (DECL_FUNCTION_TEMPLATE_P (member_function))
16198 member_function = DECL_TEMPLATE_RESULT (member_function);
16200 /* There should not be any class definitions in progress at this
16201 point; the bodies of members are only parsed outside of all class
16203 gcc_assert (parser->num_classes_being_defined == 0);
16204 /* While we're parsing the member functions we might encounter more
16205 classes. We want to handle them right away, but we don't want
16206 them getting mixed up with functions that are currently in the
16208 parser->unparsed_functions_queues
16209 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
16211 /* Make sure that any template parameters are in scope. */
16212 maybe_begin_member_template_processing (member_function);
16214 /* If the body of the function has not yet been parsed, parse it
16216 if (DECL_PENDING_INLINE_P (member_function))
16218 tree function_scope;
16219 cp_token_cache *tokens;
16221 /* The function is no longer pending; we are processing it. */
16222 tokens = DECL_PENDING_INLINE_INFO (member_function);
16223 DECL_PENDING_INLINE_INFO (member_function) = NULL;
16224 DECL_PENDING_INLINE_P (member_function) = 0;
16226 /* If this is a local class, enter the scope of the containing
16228 function_scope = current_function_decl;
16229 if (function_scope)
16230 push_function_context_to (function_scope);
16233 /* Push the body of the function onto the lexer stack. */
16234 cp_parser_push_lexer_for_tokens (parser, tokens);
16236 /* Let the front end know that we going to be defining this
16238 start_preparsed_function (member_function, NULL_TREE,
16239 SF_PRE_PARSED | SF_INCLASS_INLINE);
16241 /* Don't do access checking if it is a templated function. */
16242 if (processing_template_decl)
16243 push_deferring_access_checks (dk_no_check);
16245 /* Now, parse the body of the function. */
16246 cp_parser_function_definition_after_declarator (parser,
16247 /*inline_p=*/true);
16249 if (processing_template_decl)
16250 pop_deferring_access_checks ();
16252 /* Leave the scope of the containing function. */
16253 if (function_scope)
16254 pop_function_context_from (function_scope);
16255 cp_parser_pop_lexer (parser);
16258 /* Remove any template parameters from the symbol table. */
16259 maybe_end_member_template_processing ();
16261 /* Restore the queue. */
16262 parser->unparsed_functions_queues
16263 = TREE_CHAIN (parser->unparsed_functions_queues);
16266 /* If DECL contains any default args, remember it on the unparsed
16267 functions queue. */
16270 cp_parser_save_default_args (cp_parser* parser, tree decl)
16274 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
16276 probe = TREE_CHAIN (probe))
16277 if (TREE_PURPOSE (probe))
16279 TREE_PURPOSE (parser->unparsed_functions_queues)
16280 = tree_cons (current_class_type, decl,
16281 TREE_PURPOSE (parser->unparsed_functions_queues));
16286 /* FN is a FUNCTION_DECL which may contains a parameter with an
16287 unparsed DEFAULT_ARG. Parse the default args now. This function
16288 assumes that the current scope is the scope in which the default
16289 argument should be processed. */
16292 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
16294 bool saved_local_variables_forbidden_p;
16297 /* While we're parsing the default args, we might (due to the
16298 statement expression extension) encounter more classes. We want
16299 to handle them right away, but we don't want them getting mixed
16300 up with default args that are currently in the queue. */
16301 parser->unparsed_functions_queues
16302 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
16304 /* Local variable names (and the `this' keyword) may not appear
16305 in a default argument. */
16306 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
16307 parser->local_variables_forbidden_p = true;
16309 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
16311 parm = TREE_CHAIN (parm))
16313 cp_token_cache *tokens;
16314 tree default_arg = TREE_PURPOSE (parm);
16316 VEC(tree,gc) *insts;
16323 if (TREE_CODE (default_arg) != DEFAULT_ARG)
16324 /* This can happen for a friend declaration for a function
16325 already declared with default arguments. */
16328 /* Push the saved tokens for the default argument onto the parser's
16330 tokens = DEFARG_TOKENS (default_arg);
16331 cp_parser_push_lexer_for_tokens (parser, tokens);
16333 /* Parse the assignment-expression. */
16334 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false);
16336 if (!processing_template_decl)
16337 parsed_arg = check_default_argument (TREE_VALUE (parm), parsed_arg);
16339 TREE_PURPOSE (parm) = parsed_arg;
16341 /* Update any instantiations we've already created. */
16342 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
16343 VEC_iterate (tree, insts, ix, copy); ix++)
16344 TREE_PURPOSE (copy) = parsed_arg;
16346 /* If the token stream has not been completely used up, then
16347 there was extra junk after the end of the default
16349 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
16350 cp_parser_error (parser, "expected %<,%>");
16352 /* Revert to the main lexer. */
16353 cp_parser_pop_lexer (parser);
16356 /* Make sure no default arg is missing. */
16357 check_default_args (fn);
16359 /* Restore the state of local_variables_forbidden_p. */
16360 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
16362 /* Restore the queue. */
16363 parser->unparsed_functions_queues
16364 = TREE_CHAIN (parser->unparsed_functions_queues);
16367 /* Parse the operand of `sizeof' (or a similar operator). Returns
16368 either a TYPE or an expression, depending on the form of the
16369 input. The KEYWORD indicates which kind of expression we have
16373 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
16375 static const char *format;
16376 tree expr = NULL_TREE;
16377 const char *saved_message;
16378 bool saved_integral_constant_expression_p;
16379 bool saved_non_integral_constant_expression_p;
16381 /* Initialize FORMAT the first time we get here. */
16383 format = "types may not be defined in '%s' expressions";
16385 /* Types cannot be defined in a `sizeof' expression. Save away the
16387 saved_message = parser->type_definition_forbidden_message;
16388 /* And create the new one. */
16389 parser->type_definition_forbidden_message
16390 = XNEWVEC (const char, strlen (format)
16391 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
16393 sprintf ((char *) parser->type_definition_forbidden_message,
16394 format, IDENTIFIER_POINTER (ridpointers[keyword]));
16396 /* The restrictions on constant-expressions do not apply inside
16397 sizeof expressions. */
16398 saved_integral_constant_expression_p
16399 = parser->integral_constant_expression_p;
16400 saved_non_integral_constant_expression_p
16401 = parser->non_integral_constant_expression_p;
16402 parser->integral_constant_expression_p = false;
16404 /* Do not actually evaluate the expression. */
16406 /* If it's a `(', then we might be looking at the type-id
16408 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
16411 bool saved_in_type_id_in_expr_p;
16413 /* We can't be sure yet whether we're looking at a type-id or an
16415 cp_parser_parse_tentatively (parser);
16416 /* Consume the `('. */
16417 cp_lexer_consume_token (parser->lexer);
16418 /* Parse the type-id. */
16419 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
16420 parser->in_type_id_in_expr_p = true;
16421 type = cp_parser_type_id (parser);
16422 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
16423 /* Now, look for the trailing `)'. */
16424 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16425 /* If all went well, then we're done. */
16426 if (cp_parser_parse_definitely (parser))
16428 cp_decl_specifier_seq decl_specs;
16430 /* Build a trivial decl-specifier-seq. */
16431 clear_decl_specs (&decl_specs);
16432 decl_specs.type = type;
16434 /* Call grokdeclarator to figure out what type this is. */
16435 expr = grokdeclarator (NULL,
16439 /*attrlist=*/NULL);
16443 /* If the type-id production did not work out, then we must be
16444 looking at the unary-expression production. */
16446 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
16448 /* Go back to evaluating expressions. */
16451 /* Free the message we created. */
16452 free ((char *) parser->type_definition_forbidden_message);
16453 /* And restore the old one. */
16454 parser->type_definition_forbidden_message = saved_message;
16455 parser->integral_constant_expression_p
16456 = saved_integral_constant_expression_p;
16457 parser->non_integral_constant_expression_p
16458 = saved_non_integral_constant_expression_p;
16463 /* If the current declaration has no declarator, return true. */
16466 cp_parser_declares_only_class_p (cp_parser *parser)
16468 /* If the next token is a `;' or a `,' then there is no
16470 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
16471 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
16474 /* Update the DECL_SPECS to reflect the storage class indicated by
16478 cp_parser_set_storage_class (cp_parser *parser,
16479 cp_decl_specifier_seq *decl_specs,
16482 cp_storage_class storage_class;
16484 if (parser->in_unbraced_linkage_specification_p)
16486 error ("invalid use of %qD in linkage specification",
16487 ridpointers[keyword]);
16490 else if (decl_specs->storage_class != sc_none)
16492 decl_specs->conflicting_specifiers_p = true;
16496 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
16497 && decl_specs->specs[(int) ds_thread])
16499 error ("%<__thread%> before %qD", ridpointers[keyword]);
16500 decl_specs->specs[(int) ds_thread] = 0;
16506 storage_class = sc_auto;
16509 storage_class = sc_register;
16512 storage_class = sc_static;
16515 storage_class = sc_extern;
16518 storage_class = sc_mutable;
16521 gcc_unreachable ();
16523 decl_specs->storage_class = storage_class;
16525 /* A storage class specifier cannot be applied alongside a typedef
16526 specifier. If there is a typedef specifier present then set
16527 conflicting_specifiers_p which will trigger an error later
16528 on in grokdeclarator. */
16529 if (decl_specs->specs[(int)ds_typedef])
16530 decl_specs->conflicting_specifiers_p = true;
16533 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
16534 is true, the type is a user-defined type; otherwise it is a
16535 built-in type specified by a keyword. */
16538 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
16540 bool user_defined_p)
16542 decl_specs->any_specifiers_p = true;
16544 /* If the user tries to redeclare bool or wchar_t (with, for
16545 example, in "typedef int wchar_t;") we remember that this is what
16546 happened. In system headers, we ignore these declarations so
16547 that G++ can work with system headers that are not C++-safe. */
16548 if (decl_specs->specs[(int) ds_typedef]
16550 && (type_spec == boolean_type_node
16551 || type_spec == wchar_type_node)
16552 && (decl_specs->type
16553 || decl_specs->specs[(int) ds_long]
16554 || decl_specs->specs[(int) ds_short]
16555 || decl_specs->specs[(int) ds_unsigned]
16556 || decl_specs->specs[(int) ds_signed]))
16558 decl_specs->redefined_builtin_type = type_spec;
16559 if (!decl_specs->type)
16561 decl_specs->type = type_spec;
16562 decl_specs->user_defined_type_p = false;
16565 else if (decl_specs->type)
16566 decl_specs->multiple_types_p = true;
16569 decl_specs->type = type_spec;
16570 decl_specs->user_defined_type_p = user_defined_p;
16571 decl_specs->redefined_builtin_type = NULL_TREE;
16575 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
16576 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
16579 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
16581 return decl_specifiers->specs[(int) ds_friend] != 0;
16584 /* If the next token is of the indicated TYPE, consume it. Otherwise,
16585 issue an error message indicating that TOKEN_DESC was expected.
16587 Returns the token consumed, if the token had the appropriate type.
16588 Otherwise, returns NULL. */
16591 cp_parser_require (cp_parser* parser,
16592 enum cpp_ttype type,
16593 const char* token_desc)
16595 if (cp_lexer_next_token_is (parser->lexer, type))
16596 return cp_lexer_consume_token (parser->lexer);
16599 /* Output the MESSAGE -- unless we're parsing tentatively. */
16600 if (!cp_parser_simulate_error (parser))
16602 char *message = concat ("expected ", token_desc, NULL);
16603 cp_parser_error (parser, message);
16610 /* An error message is produced if the next token is not '>'.
16611 All further tokens are skipped until the desired token is
16612 found or '{', '}', ';' or an unbalanced ')' or ']'. */
16615 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
16617 /* Current level of '< ... >'. */
16618 unsigned level = 0;
16619 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
16620 unsigned nesting_depth = 0;
16622 /* Are we ready, yet? If not, issue error message. */
16623 if (cp_parser_require (parser, CPP_GREATER, "%<>%>"))
16626 /* Skip tokens until the desired token is found. */
16629 /* Peek at the next token. */
16630 switch (cp_lexer_peek_token (parser->lexer)->type)
16633 if (!nesting_depth)
16638 if (!nesting_depth && level-- == 0)
16640 /* We've reached the token we want, consume it and stop. */
16641 cp_lexer_consume_token (parser->lexer);
16646 case CPP_OPEN_PAREN:
16647 case CPP_OPEN_SQUARE:
16651 case CPP_CLOSE_PAREN:
16652 case CPP_CLOSE_SQUARE:
16653 if (nesting_depth-- == 0)
16658 case CPP_PRAGMA_EOL:
16659 case CPP_SEMICOLON:
16660 case CPP_OPEN_BRACE:
16661 case CPP_CLOSE_BRACE:
16662 /* The '>' was probably forgotten, don't look further. */
16669 /* Consume this token. */
16670 cp_lexer_consume_token (parser->lexer);
16674 /* If the next token is the indicated keyword, consume it. Otherwise,
16675 issue an error message indicating that TOKEN_DESC was expected.
16677 Returns the token consumed, if the token had the appropriate type.
16678 Otherwise, returns NULL. */
16681 cp_parser_require_keyword (cp_parser* parser,
16683 const char* token_desc)
16685 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
16687 if (token && token->keyword != keyword)
16689 dyn_string_t error_msg;
16691 /* Format the error message. */
16692 error_msg = dyn_string_new (0);
16693 dyn_string_append_cstr (error_msg, "expected ");
16694 dyn_string_append_cstr (error_msg, token_desc);
16695 cp_parser_error (parser, error_msg->s);
16696 dyn_string_delete (error_msg);
16703 /* Returns TRUE iff TOKEN is a token that can begin the body of a
16704 function-definition. */
16707 cp_parser_token_starts_function_definition_p (cp_token* token)
16709 return (/* An ordinary function-body begins with an `{'. */
16710 token->type == CPP_OPEN_BRACE
16711 /* A ctor-initializer begins with a `:'. */
16712 || token->type == CPP_COLON
16713 /* A function-try-block begins with `try'. */
16714 || token->keyword == RID_TRY
16715 /* The named return value extension begins with `return'. */
16716 || token->keyword == RID_RETURN);
16719 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
16723 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
16727 token = cp_lexer_peek_token (parser->lexer);
16728 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
16731 /* Returns TRUE iff the next token is the "," or ">" ending a
16732 template-argument. */
16735 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
16739 token = cp_lexer_peek_token (parser->lexer);
16740 return (token->type == CPP_COMMA || token->type == CPP_GREATER);
16743 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
16744 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
16747 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
16752 token = cp_lexer_peek_nth_token (parser->lexer, n);
16753 if (token->type == CPP_LESS)
16755 /* Check for the sequence `<::' in the original code. It would be lexed as
16756 `[:', where `[' is a digraph, and there is no whitespace before
16758 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
16761 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
16762 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
16768 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
16769 or none_type otherwise. */
16771 static enum tag_types
16772 cp_parser_token_is_class_key (cp_token* token)
16774 switch (token->keyword)
16779 return record_type;
16788 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
16791 cp_parser_check_class_key (enum tag_types class_key, tree type)
16793 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
16794 pedwarn ("%qs tag used in naming %q#T",
16795 class_key == union_type ? "union"
16796 : class_key == record_type ? "struct" : "class",
16800 /* Issue an error message if DECL is redeclared with different
16801 access than its original declaration [class.access.spec/3].
16802 This applies to nested classes and nested class templates.
16806 cp_parser_check_access_in_redeclaration (tree decl)
16808 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
16811 if ((TREE_PRIVATE (decl)
16812 != (current_access_specifier == access_private_node))
16813 || (TREE_PROTECTED (decl)
16814 != (current_access_specifier == access_protected_node)))
16815 error ("%qD redeclared with different access", decl);
16818 /* Look for the `template' keyword, as a syntactic disambiguator.
16819 Return TRUE iff it is present, in which case it will be
16823 cp_parser_optional_template_keyword (cp_parser *parser)
16825 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
16827 /* The `template' keyword can only be used within templates;
16828 outside templates the parser can always figure out what is a
16829 template and what is not. */
16830 if (!processing_template_decl)
16832 error ("%<template%> (as a disambiguator) is only allowed "
16833 "within templates");
16834 /* If this part of the token stream is rescanned, the same
16835 error message would be generated. So, we purge the token
16836 from the stream. */
16837 cp_lexer_purge_token (parser->lexer);
16842 /* Consume the `template' keyword. */
16843 cp_lexer_consume_token (parser->lexer);
16851 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
16852 set PARSER->SCOPE, and perform other related actions. */
16855 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
16858 struct tree_check *check_value;
16859 deferred_access_check *chk;
16860 VEC (deferred_access_check,gc) *checks;
16862 /* Get the stored value. */
16863 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
16864 /* Perform any access checks that were deferred. */
16865 checks = check_value->checks;
16869 VEC_iterate (deferred_access_check, checks, i, chk) ;
16872 perform_or_defer_access_check (chk->binfo,
16877 /* Set the scope from the stored value. */
16878 parser->scope = check_value->value;
16879 parser->qualifying_scope = check_value->qualifying_scope;
16880 parser->object_scope = NULL_TREE;
16883 /* Consume tokens up through a non-nested END token. */
16886 cp_parser_cache_group (cp_parser *parser,
16887 enum cpp_ttype end,
16894 /* Abort a parenthesized expression if we encounter a brace. */
16895 if ((end == CPP_CLOSE_PAREN || depth == 0)
16896 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16898 /* If we've reached the end of the file, stop. */
16899 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF)
16900 || (end != CPP_PRAGMA_EOL
16901 && cp_lexer_next_token_is (parser->lexer, CPP_PRAGMA_EOL)))
16903 /* Consume the next token. */
16904 token = cp_lexer_consume_token (parser->lexer);
16905 /* See if it starts a new group. */
16906 if (token->type == CPP_OPEN_BRACE)
16908 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
16912 else if (token->type == CPP_OPEN_PAREN)
16913 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
16914 else if (token->type == CPP_PRAGMA)
16915 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
16916 else if (token->type == end)
16921 /* Begin parsing tentatively. We always save tokens while parsing
16922 tentatively so that if the tentative parsing fails we can restore the
16926 cp_parser_parse_tentatively (cp_parser* parser)
16928 /* Enter a new parsing context. */
16929 parser->context = cp_parser_context_new (parser->context);
16930 /* Begin saving tokens. */
16931 cp_lexer_save_tokens (parser->lexer);
16932 /* In order to avoid repetitive access control error messages,
16933 access checks are queued up until we are no longer parsing
16935 push_deferring_access_checks (dk_deferred);
16938 /* Commit to the currently active tentative parse. */
16941 cp_parser_commit_to_tentative_parse (cp_parser* parser)
16943 cp_parser_context *context;
16946 /* Mark all of the levels as committed. */
16947 lexer = parser->lexer;
16948 for (context = parser->context; context->next; context = context->next)
16950 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
16952 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
16953 while (!cp_lexer_saving_tokens (lexer))
16954 lexer = lexer->next;
16955 cp_lexer_commit_tokens (lexer);
16959 /* Abort the currently active tentative parse. All consumed tokens
16960 will be rolled back, and no diagnostics will be issued. */
16963 cp_parser_abort_tentative_parse (cp_parser* parser)
16965 cp_parser_simulate_error (parser);
16966 /* Now, pretend that we want to see if the construct was
16967 successfully parsed. */
16968 cp_parser_parse_definitely (parser);
16971 /* Stop parsing tentatively. If a parse error has occurred, restore the
16972 token stream. Otherwise, commit to the tokens we have consumed.
16973 Returns true if no error occurred; false otherwise. */
16976 cp_parser_parse_definitely (cp_parser* parser)
16978 bool error_occurred;
16979 cp_parser_context *context;
16981 /* Remember whether or not an error occurred, since we are about to
16982 destroy that information. */
16983 error_occurred = cp_parser_error_occurred (parser);
16984 /* Remove the topmost context from the stack. */
16985 context = parser->context;
16986 parser->context = context->next;
16987 /* If no parse errors occurred, commit to the tentative parse. */
16988 if (!error_occurred)
16990 /* Commit to the tokens read tentatively, unless that was
16992 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
16993 cp_lexer_commit_tokens (parser->lexer);
16995 pop_to_parent_deferring_access_checks ();
16997 /* Otherwise, if errors occurred, roll back our state so that things
16998 are just as they were before we began the tentative parse. */
17001 cp_lexer_rollback_tokens (parser->lexer);
17002 pop_deferring_access_checks ();
17004 /* Add the context to the front of the free list. */
17005 context->next = cp_parser_context_free_list;
17006 cp_parser_context_free_list = context;
17008 return !error_occurred;
17011 /* Returns true if we are parsing tentatively and are not committed to
17012 this tentative parse. */
17015 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
17017 return (cp_parser_parsing_tentatively (parser)
17018 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
17021 /* Returns nonzero iff an error has occurred during the most recent
17022 tentative parse. */
17025 cp_parser_error_occurred (cp_parser* parser)
17027 return (cp_parser_parsing_tentatively (parser)
17028 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
17031 /* Returns nonzero if GNU extensions are allowed. */
17034 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
17036 return parser->allow_gnu_extensions_p;
17039 /* Objective-C++ Productions */
17042 /* Parse an Objective-C expression, which feeds into a primary-expression
17046 objc-message-expression
17047 objc-string-literal
17048 objc-encode-expression
17049 objc-protocol-expression
17050 objc-selector-expression
17052 Returns a tree representation of the expression. */
17055 cp_parser_objc_expression (cp_parser* parser)
17057 /* Try to figure out what kind of declaration is present. */
17058 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17062 case CPP_OPEN_SQUARE:
17063 return cp_parser_objc_message_expression (parser);
17065 case CPP_OBJC_STRING:
17066 kwd = cp_lexer_consume_token (parser->lexer);
17067 return objc_build_string_object (kwd->u.value);
17070 switch (kwd->keyword)
17072 case RID_AT_ENCODE:
17073 return cp_parser_objc_encode_expression (parser);
17075 case RID_AT_PROTOCOL:
17076 return cp_parser_objc_protocol_expression (parser);
17078 case RID_AT_SELECTOR:
17079 return cp_parser_objc_selector_expression (parser);
17085 error ("misplaced %<@%D%> Objective-C++ construct", kwd->u.value);
17086 cp_parser_skip_to_end_of_block_or_statement (parser);
17089 return error_mark_node;
17092 /* Parse an Objective-C message expression.
17094 objc-message-expression:
17095 [ objc-message-receiver objc-message-args ]
17097 Returns a representation of an Objective-C message. */
17100 cp_parser_objc_message_expression (cp_parser* parser)
17102 tree receiver, messageargs;
17104 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
17105 receiver = cp_parser_objc_message_receiver (parser);
17106 messageargs = cp_parser_objc_message_args (parser);
17107 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
17109 return objc_build_message_expr (build_tree_list (receiver, messageargs));
17112 /* Parse an objc-message-receiver.
17114 objc-message-receiver:
17116 simple-type-specifier
17118 Returns a representation of the type or expression. */
17121 cp_parser_objc_message_receiver (cp_parser* parser)
17125 /* An Objective-C message receiver may be either (1) a type
17126 or (2) an expression. */
17127 cp_parser_parse_tentatively (parser);
17128 rcv = cp_parser_expression (parser, false);
17130 if (cp_parser_parse_definitely (parser))
17133 rcv = cp_parser_simple_type_specifier (parser,
17134 /*decl_specs=*/NULL,
17135 CP_PARSER_FLAGS_NONE);
17137 return objc_get_class_reference (rcv);
17140 /* Parse the arguments and selectors comprising an Objective-C message.
17145 objc-selector-args , objc-comma-args
17147 objc-selector-args:
17148 objc-selector [opt] : assignment-expression
17149 objc-selector-args objc-selector [opt] : assignment-expression
17152 assignment-expression
17153 objc-comma-args , assignment-expression
17155 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
17156 selector arguments and TREE_VALUE containing a list of comma
17160 cp_parser_objc_message_args (cp_parser* parser)
17162 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
17163 bool maybe_unary_selector_p = true;
17164 cp_token *token = cp_lexer_peek_token (parser->lexer);
17166 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
17168 tree selector = NULL_TREE, arg;
17170 if (token->type != CPP_COLON)
17171 selector = cp_parser_objc_selector (parser);
17173 /* Detect if we have a unary selector. */
17174 if (maybe_unary_selector_p
17175 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
17176 return build_tree_list (selector, NULL_TREE);
17178 maybe_unary_selector_p = false;
17179 cp_parser_require (parser, CPP_COLON, "`:'");
17180 arg = cp_parser_assignment_expression (parser, false);
17183 = chainon (sel_args,
17184 build_tree_list (selector, arg));
17186 token = cp_lexer_peek_token (parser->lexer);
17189 /* Handle non-selector arguments, if any. */
17190 while (token->type == CPP_COMMA)
17194 cp_lexer_consume_token (parser->lexer);
17195 arg = cp_parser_assignment_expression (parser, false);
17198 = chainon (addl_args,
17199 build_tree_list (NULL_TREE, arg));
17201 token = cp_lexer_peek_token (parser->lexer);
17204 return build_tree_list (sel_args, addl_args);
17207 /* Parse an Objective-C encode expression.
17209 objc-encode-expression:
17210 @encode objc-typename
17212 Returns an encoded representation of the type argument. */
17215 cp_parser_objc_encode_expression (cp_parser* parser)
17219 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
17220 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17221 type = complete_type (cp_parser_type_id (parser));
17222 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17226 error ("%<@encode%> must specify a type as an argument");
17227 return error_mark_node;
17230 return objc_build_encode_expr (type);
17233 /* Parse an Objective-C @defs expression. */
17236 cp_parser_objc_defs_expression (cp_parser *parser)
17240 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
17241 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17242 name = cp_parser_identifier (parser);
17243 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17245 return objc_get_class_ivars (name);
17248 /* Parse an Objective-C protocol expression.
17250 objc-protocol-expression:
17251 @protocol ( identifier )
17253 Returns a representation of the protocol expression. */
17256 cp_parser_objc_protocol_expression (cp_parser* parser)
17260 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17261 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17262 proto = cp_parser_identifier (parser);
17263 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17265 return objc_build_protocol_expr (proto);
17268 /* Parse an Objective-C selector expression.
17270 objc-selector-expression:
17271 @selector ( objc-method-signature )
17273 objc-method-signature:
17279 objc-selector-seq objc-selector :
17281 Returns a representation of the method selector. */
17284 cp_parser_objc_selector_expression (cp_parser* parser)
17286 tree sel_seq = NULL_TREE;
17287 bool maybe_unary_selector_p = true;
17290 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
17291 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17292 token = cp_lexer_peek_token (parser->lexer);
17294 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
17295 || token->type == CPP_SCOPE)
17297 tree selector = NULL_TREE;
17299 if (token->type != CPP_COLON
17300 || token->type == CPP_SCOPE)
17301 selector = cp_parser_objc_selector (parser);
17303 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
17304 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
17306 /* Detect if we have a unary selector. */
17307 if (maybe_unary_selector_p)
17309 sel_seq = selector;
17310 goto finish_selector;
17314 cp_parser_error (parser, "expected %<:%>");
17317 maybe_unary_selector_p = false;
17318 token = cp_lexer_consume_token (parser->lexer);
17320 if (token->type == CPP_SCOPE)
17323 = chainon (sel_seq,
17324 build_tree_list (selector, NULL_TREE));
17326 = chainon (sel_seq,
17327 build_tree_list (NULL_TREE, NULL_TREE));
17331 = chainon (sel_seq,
17332 build_tree_list (selector, NULL_TREE));
17334 token = cp_lexer_peek_token (parser->lexer);
17338 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17340 return objc_build_selector_expr (sel_seq);
17343 /* Parse a list of identifiers.
17345 objc-identifier-list:
17347 objc-identifier-list , identifier
17349 Returns a TREE_LIST of identifier nodes. */
17352 cp_parser_objc_identifier_list (cp_parser* parser)
17354 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
17355 cp_token *sep = cp_lexer_peek_token (parser->lexer);
17357 while (sep->type == CPP_COMMA)
17359 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17360 list = chainon (list,
17361 build_tree_list (NULL_TREE,
17362 cp_parser_identifier (parser)));
17363 sep = cp_lexer_peek_token (parser->lexer);
17369 /* Parse an Objective-C alias declaration.
17371 objc-alias-declaration:
17372 @compatibility_alias identifier identifier ;
17374 This function registers the alias mapping with the Objective-C front-end.
17375 It returns nothing. */
17378 cp_parser_objc_alias_declaration (cp_parser* parser)
17382 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
17383 alias = cp_parser_identifier (parser);
17384 orig = cp_parser_identifier (parser);
17385 objc_declare_alias (alias, orig);
17386 cp_parser_consume_semicolon_at_end_of_statement (parser);
17389 /* Parse an Objective-C class forward-declaration.
17391 objc-class-declaration:
17392 @class objc-identifier-list ;
17394 The function registers the forward declarations with the Objective-C
17395 front-end. It returns nothing. */
17398 cp_parser_objc_class_declaration (cp_parser* parser)
17400 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
17401 objc_declare_class (cp_parser_objc_identifier_list (parser));
17402 cp_parser_consume_semicolon_at_end_of_statement (parser);
17405 /* Parse a list of Objective-C protocol references.
17407 objc-protocol-refs-opt:
17408 objc-protocol-refs [opt]
17410 objc-protocol-refs:
17411 < objc-identifier-list >
17413 Returns a TREE_LIST of identifiers, if any. */
17416 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
17418 tree protorefs = NULL_TREE;
17420 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
17422 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
17423 protorefs = cp_parser_objc_identifier_list (parser);
17424 cp_parser_require (parser, CPP_GREATER, "`>'");
17430 /* Parse a Objective-C visibility specification. */
17433 cp_parser_objc_visibility_spec (cp_parser* parser)
17435 cp_token *vis = cp_lexer_peek_token (parser->lexer);
17437 switch (vis->keyword)
17439 case RID_AT_PRIVATE:
17440 objc_set_visibility (2);
17442 case RID_AT_PROTECTED:
17443 objc_set_visibility (0);
17445 case RID_AT_PUBLIC:
17446 objc_set_visibility (1);
17452 /* Eat '@private'/'@protected'/'@public'. */
17453 cp_lexer_consume_token (parser->lexer);
17456 /* Parse an Objective-C method type. */
17459 cp_parser_objc_method_type (cp_parser* parser)
17461 objc_set_method_type
17462 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
17467 /* Parse an Objective-C protocol qualifier. */
17470 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
17472 tree quals = NULL_TREE, node;
17473 cp_token *token = cp_lexer_peek_token (parser->lexer);
17475 node = token->u.value;
17477 while (node && TREE_CODE (node) == IDENTIFIER_NODE
17478 && (node == ridpointers [(int) RID_IN]
17479 || node == ridpointers [(int) RID_OUT]
17480 || node == ridpointers [(int) RID_INOUT]
17481 || node == ridpointers [(int) RID_BYCOPY]
17482 || node == ridpointers [(int) RID_BYREF]
17483 || node == ridpointers [(int) RID_ONEWAY]))
17485 quals = tree_cons (NULL_TREE, node, quals);
17486 cp_lexer_consume_token (parser->lexer);
17487 token = cp_lexer_peek_token (parser->lexer);
17488 node = token->u.value;
17494 /* Parse an Objective-C typename. */
17497 cp_parser_objc_typename (cp_parser* parser)
17499 tree typename = NULL_TREE;
17501 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
17503 tree proto_quals, cp_type = NULL_TREE;
17505 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17506 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
17508 /* An ObjC type name may consist of just protocol qualifiers, in which
17509 case the type shall default to 'id'. */
17510 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
17511 cp_type = cp_parser_type_id (parser);
17513 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17514 typename = build_tree_list (proto_quals, cp_type);
17520 /* Check to see if TYPE refers to an Objective-C selector name. */
17523 cp_parser_objc_selector_p (enum cpp_ttype type)
17525 return (type == CPP_NAME || type == CPP_KEYWORD
17526 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
17527 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
17528 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
17529 || type == CPP_XOR || type == CPP_XOR_EQ);
17532 /* Parse an Objective-C selector. */
17535 cp_parser_objc_selector (cp_parser* parser)
17537 cp_token *token = cp_lexer_consume_token (parser->lexer);
17539 if (!cp_parser_objc_selector_p (token->type))
17541 error ("invalid Objective-C++ selector name");
17542 return error_mark_node;
17545 /* C++ operator names are allowed to appear in ObjC selectors. */
17546 switch (token->type)
17548 case CPP_AND_AND: return get_identifier ("and");
17549 case CPP_AND_EQ: return get_identifier ("and_eq");
17550 case CPP_AND: return get_identifier ("bitand");
17551 case CPP_OR: return get_identifier ("bitor");
17552 case CPP_COMPL: return get_identifier ("compl");
17553 case CPP_NOT: return get_identifier ("not");
17554 case CPP_NOT_EQ: return get_identifier ("not_eq");
17555 case CPP_OR_OR: return get_identifier ("or");
17556 case CPP_OR_EQ: return get_identifier ("or_eq");
17557 case CPP_XOR: return get_identifier ("xor");
17558 case CPP_XOR_EQ: return get_identifier ("xor_eq");
17559 default: return token->u.value;
17563 /* Parse an Objective-C params list. */
17566 cp_parser_objc_method_keyword_params (cp_parser* parser)
17568 tree params = NULL_TREE;
17569 bool maybe_unary_selector_p = true;
17570 cp_token *token = cp_lexer_peek_token (parser->lexer);
17572 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
17574 tree selector = NULL_TREE, typename, identifier;
17576 if (token->type != CPP_COLON)
17577 selector = cp_parser_objc_selector (parser);
17579 /* Detect if we have a unary selector. */
17580 if (maybe_unary_selector_p
17581 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
17584 maybe_unary_selector_p = false;
17585 cp_parser_require (parser, CPP_COLON, "`:'");
17586 typename = cp_parser_objc_typename (parser);
17587 identifier = cp_parser_identifier (parser);
17591 objc_build_keyword_decl (selector,
17595 token = cp_lexer_peek_token (parser->lexer);
17601 /* Parse the non-keyword Objective-C params. */
17604 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
17606 tree params = make_node (TREE_LIST);
17607 cp_token *token = cp_lexer_peek_token (parser->lexer);
17608 *ellipsisp = false; /* Initially, assume no ellipsis. */
17610 while (token->type == CPP_COMMA)
17612 cp_parameter_declarator *parmdecl;
17615 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17616 token = cp_lexer_peek_token (parser->lexer);
17618 if (token->type == CPP_ELLIPSIS)
17620 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
17625 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
17626 parm = grokdeclarator (parmdecl->declarator,
17627 &parmdecl->decl_specifiers,
17628 PARM, /*initialized=*/0,
17629 /*attrlist=*/NULL);
17631 chainon (params, build_tree_list (NULL_TREE, parm));
17632 token = cp_lexer_peek_token (parser->lexer);
17638 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
17641 cp_parser_objc_interstitial_code (cp_parser* parser)
17643 cp_token *token = cp_lexer_peek_token (parser->lexer);
17645 /* If the next token is `extern' and the following token is a string
17646 literal, then we have a linkage specification. */
17647 if (token->keyword == RID_EXTERN
17648 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
17649 cp_parser_linkage_specification (parser);
17650 /* Handle #pragma, if any. */
17651 else if (token->type == CPP_PRAGMA)
17652 cp_parser_pragma (parser, pragma_external);
17653 /* Allow stray semicolons. */
17654 else if (token->type == CPP_SEMICOLON)
17655 cp_lexer_consume_token (parser->lexer);
17656 /* Finally, try to parse a block-declaration, or a function-definition. */
17658 cp_parser_block_declaration (parser, /*statement_p=*/false);
17661 /* Parse a method signature. */
17664 cp_parser_objc_method_signature (cp_parser* parser)
17666 tree rettype, kwdparms, optparms;
17667 bool ellipsis = false;
17669 cp_parser_objc_method_type (parser);
17670 rettype = cp_parser_objc_typename (parser);
17671 kwdparms = cp_parser_objc_method_keyword_params (parser);
17672 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
17674 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
17677 /* Pars an Objective-C method prototype list. */
17680 cp_parser_objc_method_prototype_list (cp_parser* parser)
17682 cp_token *token = cp_lexer_peek_token (parser->lexer);
17684 while (token->keyword != RID_AT_END)
17686 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
17688 objc_add_method_declaration
17689 (cp_parser_objc_method_signature (parser));
17690 cp_parser_consume_semicolon_at_end_of_statement (parser);
17693 /* Allow for interspersed non-ObjC++ code. */
17694 cp_parser_objc_interstitial_code (parser);
17696 token = cp_lexer_peek_token (parser->lexer);
17699 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17700 objc_finish_interface ();
17703 /* Parse an Objective-C method definition list. */
17706 cp_parser_objc_method_definition_list (cp_parser* parser)
17708 cp_token *token = cp_lexer_peek_token (parser->lexer);
17710 while (token->keyword != RID_AT_END)
17714 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
17716 push_deferring_access_checks (dk_deferred);
17717 objc_start_method_definition
17718 (cp_parser_objc_method_signature (parser));
17720 /* For historical reasons, we accept an optional semicolon. */
17721 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17722 cp_lexer_consume_token (parser->lexer);
17724 perform_deferred_access_checks ();
17725 stop_deferring_access_checks ();
17726 meth = cp_parser_function_definition_after_declarator (parser,
17728 pop_deferring_access_checks ();
17729 objc_finish_method_definition (meth);
17732 /* Allow for interspersed non-ObjC++ code. */
17733 cp_parser_objc_interstitial_code (parser);
17735 token = cp_lexer_peek_token (parser->lexer);
17738 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17739 objc_finish_implementation ();
17742 /* Parse Objective-C ivars. */
17745 cp_parser_objc_class_ivars (cp_parser* parser)
17747 cp_token *token = cp_lexer_peek_token (parser->lexer);
17749 if (token->type != CPP_OPEN_BRACE)
17750 return; /* No ivars specified. */
17752 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
17753 token = cp_lexer_peek_token (parser->lexer);
17755 while (token->type != CPP_CLOSE_BRACE)
17757 cp_decl_specifier_seq declspecs;
17758 int decl_class_or_enum_p;
17759 tree prefix_attributes;
17761 cp_parser_objc_visibility_spec (parser);
17763 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
17766 cp_parser_decl_specifier_seq (parser,
17767 CP_PARSER_FLAGS_OPTIONAL,
17769 &decl_class_or_enum_p);
17770 prefix_attributes = declspecs.attributes;
17771 declspecs.attributes = NULL_TREE;
17773 /* Keep going until we hit the `;' at the end of the
17775 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
17777 tree width = NULL_TREE, attributes, first_attribute, decl;
17778 cp_declarator *declarator = NULL;
17779 int ctor_dtor_or_conv_p;
17781 /* Check for a (possibly unnamed) bitfield declaration. */
17782 token = cp_lexer_peek_token (parser->lexer);
17783 if (token->type == CPP_COLON)
17786 if (token->type == CPP_NAME
17787 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
17790 /* Get the name of the bitfield. */
17791 declarator = make_id_declarator (NULL_TREE,
17792 cp_parser_identifier (parser),
17796 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17797 /* Get the width of the bitfield. */
17799 = cp_parser_constant_expression (parser,
17800 /*allow_non_constant=*/false,
17805 /* Parse the declarator. */
17807 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
17808 &ctor_dtor_or_conv_p,
17809 /*parenthesized_p=*/NULL,
17810 /*member_p=*/false);
17813 /* Look for attributes that apply to the ivar. */
17814 attributes = cp_parser_attributes_opt (parser);
17815 /* Remember which attributes are prefix attributes and
17817 first_attribute = attributes;
17818 /* Combine the attributes. */
17819 attributes = chainon (prefix_attributes, attributes);
17823 /* Create the bitfield declaration. */
17824 decl = grokbitfield (declarator, &declspecs, width);
17825 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
17828 decl = grokfield (declarator, &declspecs,
17829 NULL_TREE, /*init_const_expr_p=*/false,
17830 NULL_TREE, attributes);
17832 /* Add the instance variable. */
17833 objc_add_instance_variable (decl);
17835 /* Reset PREFIX_ATTRIBUTES. */
17836 while (attributes && TREE_CHAIN (attributes) != first_attribute)
17837 attributes = TREE_CHAIN (attributes);
17839 TREE_CHAIN (attributes) = NULL_TREE;
17841 token = cp_lexer_peek_token (parser->lexer);
17843 if (token->type == CPP_COMMA)
17845 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17851 cp_parser_consume_semicolon_at_end_of_statement (parser);
17852 token = cp_lexer_peek_token (parser->lexer);
17855 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
17856 /* For historical reasons, we accept an optional semicolon. */
17857 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17858 cp_lexer_consume_token (parser->lexer);
17861 /* Parse an Objective-C protocol declaration. */
17864 cp_parser_objc_protocol_declaration (cp_parser* parser)
17866 tree proto, protorefs;
17869 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17870 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
17872 error ("identifier expected after %<@protocol%>");
17876 /* See if we have a forward declaration or a definition. */
17877 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
17879 /* Try a forward declaration first. */
17880 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
17882 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
17884 cp_parser_consume_semicolon_at_end_of_statement (parser);
17887 /* Ok, we got a full-fledged definition (or at least should). */
17890 proto = cp_parser_identifier (parser);
17891 protorefs = cp_parser_objc_protocol_refs_opt (parser);
17892 objc_start_protocol (proto, protorefs);
17893 cp_parser_objc_method_prototype_list (parser);
17897 /* Parse an Objective-C superclass or category. */
17900 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
17903 cp_token *next = cp_lexer_peek_token (parser->lexer);
17905 *super = *categ = NULL_TREE;
17906 if (next->type == CPP_COLON)
17908 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17909 *super = cp_parser_identifier (parser);
17911 else if (next->type == CPP_OPEN_PAREN)
17913 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17914 *categ = cp_parser_identifier (parser);
17915 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17919 /* Parse an Objective-C class interface. */
17922 cp_parser_objc_class_interface (cp_parser* parser)
17924 tree name, super, categ, protos;
17926 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
17927 name = cp_parser_identifier (parser);
17928 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17929 protos = cp_parser_objc_protocol_refs_opt (parser);
17931 /* We have either a class or a category on our hands. */
17933 objc_start_category_interface (name, categ, protos);
17936 objc_start_class_interface (name, super, protos);
17937 /* Handle instance variable declarations, if any. */
17938 cp_parser_objc_class_ivars (parser);
17939 objc_continue_interface ();
17942 cp_parser_objc_method_prototype_list (parser);
17945 /* Parse an Objective-C class implementation. */
17948 cp_parser_objc_class_implementation (cp_parser* parser)
17950 tree name, super, categ;
17952 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
17953 name = cp_parser_identifier (parser);
17954 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17956 /* We have either a class or a category on our hands. */
17958 objc_start_category_implementation (name, categ);
17961 objc_start_class_implementation (name, super);
17962 /* Handle instance variable declarations, if any. */
17963 cp_parser_objc_class_ivars (parser);
17964 objc_continue_implementation ();
17967 cp_parser_objc_method_definition_list (parser);
17970 /* Consume the @end token and finish off the implementation. */
17973 cp_parser_objc_end_implementation (cp_parser* parser)
17975 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17976 objc_finish_implementation ();
17979 /* Parse an Objective-C declaration. */
17982 cp_parser_objc_declaration (cp_parser* parser)
17984 /* Try to figure out what kind of declaration is present. */
17985 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17987 switch (kwd->keyword)
17990 cp_parser_objc_alias_declaration (parser);
17993 cp_parser_objc_class_declaration (parser);
17995 case RID_AT_PROTOCOL:
17996 cp_parser_objc_protocol_declaration (parser);
17998 case RID_AT_INTERFACE:
17999 cp_parser_objc_class_interface (parser);
18001 case RID_AT_IMPLEMENTATION:
18002 cp_parser_objc_class_implementation (parser);
18005 cp_parser_objc_end_implementation (parser);
18008 error ("misplaced %<@%D%> Objective-C++ construct", kwd->u.value);
18009 cp_parser_skip_to_end_of_block_or_statement (parser);
18013 /* Parse an Objective-C try-catch-finally statement.
18015 objc-try-catch-finally-stmt:
18016 @try compound-statement objc-catch-clause-seq [opt]
18017 objc-finally-clause [opt]
18019 objc-catch-clause-seq:
18020 objc-catch-clause objc-catch-clause-seq [opt]
18023 @catch ( exception-declaration ) compound-statement
18025 objc-finally-clause
18026 @finally compound-statement
18028 Returns NULL_TREE. */
18031 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
18032 location_t location;
18035 cp_parser_require_keyword (parser, RID_AT_TRY, "`@try'");
18036 location = cp_lexer_peek_token (parser->lexer)->location;
18037 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
18038 node, lest it get absorbed into the surrounding block. */
18039 stmt = push_stmt_list ();
18040 cp_parser_compound_statement (parser, NULL, false);
18041 objc_begin_try_stmt (location, pop_stmt_list (stmt));
18043 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
18045 cp_parameter_declarator *parmdecl;
18048 cp_lexer_consume_token (parser->lexer);
18049 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
18050 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
18051 parm = grokdeclarator (parmdecl->declarator,
18052 &parmdecl->decl_specifiers,
18053 PARM, /*initialized=*/0,
18054 /*attrlist=*/NULL);
18055 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
18056 objc_begin_catch_clause (parm);
18057 cp_parser_compound_statement (parser, NULL, false);
18058 objc_finish_catch_clause ();
18061 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
18063 cp_lexer_consume_token (parser->lexer);
18064 location = cp_lexer_peek_token (parser->lexer)->location;
18065 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
18066 node, lest it get absorbed into the surrounding block. */
18067 stmt = push_stmt_list ();
18068 cp_parser_compound_statement (parser, NULL, false);
18069 objc_build_finally_clause (location, pop_stmt_list (stmt));
18072 return objc_finish_try_stmt ();
18075 /* Parse an Objective-C synchronized statement.
18077 objc-synchronized-stmt:
18078 @synchronized ( expression ) compound-statement
18080 Returns NULL_TREE. */
18083 cp_parser_objc_synchronized_statement (cp_parser *parser) {
18084 location_t location;
18087 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "`@synchronized'");
18089 location = cp_lexer_peek_token (parser->lexer)->location;
18090 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
18091 lock = cp_parser_expression (parser, false);
18092 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
18094 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
18095 node, lest it get absorbed into the surrounding block. */
18096 stmt = push_stmt_list ();
18097 cp_parser_compound_statement (parser, NULL, false);
18099 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
18102 /* Parse an Objective-C throw statement.
18105 @throw assignment-expression [opt] ;
18107 Returns a constructed '@throw' statement. */
18110 cp_parser_objc_throw_statement (cp_parser *parser) {
18111 tree expr = NULL_TREE;
18113 cp_parser_require_keyword (parser, RID_AT_THROW, "`@throw'");
18115 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18116 expr = cp_parser_assignment_expression (parser, false);
18118 cp_parser_consume_semicolon_at_end_of_statement (parser);
18120 return objc_build_throw_stmt (expr);
18123 /* Parse an Objective-C statement. */
18126 cp_parser_objc_statement (cp_parser * parser) {
18127 /* Try to figure out what kind of declaration is present. */
18128 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
18130 switch (kwd->keyword)
18133 return cp_parser_objc_try_catch_finally_statement (parser);
18134 case RID_AT_SYNCHRONIZED:
18135 return cp_parser_objc_synchronized_statement (parser);
18137 return cp_parser_objc_throw_statement (parser);
18139 error ("misplaced %<@%D%> Objective-C++ construct", kwd->u.value);
18140 cp_parser_skip_to_end_of_block_or_statement (parser);
18143 return error_mark_node;
18146 /* OpenMP 2.5 parsing routines. */
18148 /* All OpenMP clauses. OpenMP 2.5. */
18149 typedef enum pragma_omp_clause {
18150 PRAGMA_OMP_CLAUSE_NONE = 0,
18152 PRAGMA_OMP_CLAUSE_COPYIN,
18153 PRAGMA_OMP_CLAUSE_COPYPRIVATE,
18154 PRAGMA_OMP_CLAUSE_DEFAULT,
18155 PRAGMA_OMP_CLAUSE_FIRSTPRIVATE,
18156 PRAGMA_OMP_CLAUSE_IF,
18157 PRAGMA_OMP_CLAUSE_LASTPRIVATE,
18158 PRAGMA_OMP_CLAUSE_NOWAIT,
18159 PRAGMA_OMP_CLAUSE_NUM_THREADS,
18160 PRAGMA_OMP_CLAUSE_ORDERED,
18161 PRAGMA_OMP_CLAUSE_PRIVATE,
18162 PRAGMA_OMP_CLAUSE_REDUCTION,
18163 PRAGMA_OMP_CLAUSE_SCHEDULE,
18164 PRAGMA_OMP_CLAUSE_SHARED
18165 } pragma_omp_clause;
18167 /* Returns name of the next clause.
18168 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
18169 the token is not consumed. Otherwise appropriate pragma_omp_clause is
18170 returned and the token is consumed. */
18172 static pragma_omp_clause
18173 cp_parser_omp_clause_name (cp_parser *parser)
18175 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
18177 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
18178 result = PRAGMA_OMP_CLAUSE_IF;
18179 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
18180 result = PRAGMA_OMP_CLAUSE_DEFAULT;
18181 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
18182 result = PRAGMA_OMP_CLAUSE_PRIVATE;
18183 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18185 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
18186 const char *p = IDENTIFIER_POINTER (id);
18191 if (!strcmp ("copyin", p))
18192 result = PRAGMA_OMP_CLAUSE_COPYIN;
18193 else if (!strcmp ("copyprivate", p))
18194 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
18197 if (!strcmp ("firstprivate", p))
18198 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
18201 if (!strcmp ("lastprivate", p))
18202 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
18205 if (!strcmp ("nowait", p))
18206 result = PRAGMA_OMP_CLAUSE_NOWAIT;
18207 else if (!strcmp ("num_threads", p))
18208 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
18211 if (!strcmp ("ordered", p))
18212 result = PRAGMA_OMP_CLAUSE_ORDERED;
18215 if (!strcmp ("reduction", p))
18216 result = PRAGMA_OMP_CLAUSE_REDUCTION;
18219 if (!strcmp ("schedule", p))
18220 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
18221 else if (!strcmp ("shared", p))
18222 result = PRAGMA_OMP_CLAUSE_SHARED;
18227 if (result != PRAGMA_OMP_CLAUSE_NONE)
18228 cp_lexer_consume_token (parser->lexer);
18233 /* Validate that a clause of the given type does not already exist. */
18236 check_no_duplicate_clause (tree clauses, enum tree_code code, const char *name)
18240 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
18241 if (OMP_CLAUSE_CODE (c) == code)
18243 error ("too many %qs clauses", name);
18251 variable-list , identifier
18253 In addition, we match a closing parenthesis. An opening parenthesis
18254 will have been consumed by the caller.
18256 If KIND is nonzero, create the appropriate node and install the decl
18257 in OMP_CLAUSE_DECL and add the node to the head of the list.
18259 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
18260 return the list created. */
18263 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
18270 name = cp_parser_id_expression (parser, /*template_p=*/false,
18271 /*check_dependency_p=*/true,
18272 /*template_p=*/NULL,
18273 /*declarator_p=*/false,
18274 /*optional_p=*/false);
18275 if (name == error_mark_node)
18278 decl = cp_parser_lookup_name_simple (parser, name);
18279 if (decl == error_mark_node)
18280 cp_parser_name_lookup_error (parser, name, decl, NULL);
18281 else if (kind != 0)
18283 tree u = build_omp_clause (kind);
18284 OMP_CLAUSE_DECL (u) = decl;
18285 OMP_CLAUSE_CHAIN (u) = list;
18289 list = tree_cons (decl, NULL_TREE, list);
18292 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
18294 cp_lexer_consume_token (parser->lexer);
18297 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18301 /* Try to resync to an unnested comma. Copied from
18302 cp_parser_parenthesized_expression_list. */
18304 ending = cp_parser_skip_to_closing_parenthesis (parser,
18305 /*recovering=*/true,
18307 /*consume_paren=*/true);
18315 /* Similarly, but expect leading and trailing parenthesis. This is a very
18316 common case for omp clauses. */
18319 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
18321 if (cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18322 return cp_parser_omp_var_list_no_open (parser, kind, list);
18327 default ( shared | none ) */
18330 cp_parser_omp_clause_default (cp_parser *parser, tree list)
18332 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
18335 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18337 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18339 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
18340 const char *p = IDENTIFIER_POINTER (id);
18345 if (strcmp ("none", p) != 0)
18347 kind = OMP_CLAUSE_DEFAULT_NONE;
18351 if (strcmp ("shared", p) != 0)
18353 kind = OMP_CLAUSE_DEFAULT_SHARED;
18360 cp_lexer_consume_token (parser->lexer);
18365 cp_parser_error (parser, "expected %<none%> or %<shared%>");
18368 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18369 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18370 /*or_comma=*/false,
18371 /*consume_paren=*/true);
18373 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
18376 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default");
18377 c = build_omp_clause (OMP_CLAUSE_DEFAULT);
18378 OMP_CLAUSE_CHAIN (c) = list;
18379 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
18385 if ( expression ) */
18388 cp_parser_omp_clause_if (cp_parser *parser, tree list)
18392 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18395 t = cp_parser_condition (parser);
18397 if (t == error_mark_node
18398 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18399 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18400 /*or_comma=*/false,
18401 /*consume_paren=*/true);
18403 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if");
18405 c = build_omp_clause (OMP_CLAUSE_IF);
18406 OMP_CLAUSE_IF_EXPR (c) = t;
18407 OMP_CLAUSE_CHAIN (c) = list;
18416 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED, tree list)
18420 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait");
18422 c = build_omp_clause (OMP_CLAUSE_NOWAIT);
18423 OMP_CLAUSE_CHAIN (c) = list;
18428 num_threads ( expression ) */
18431 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list)
18435 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18438 t = cp_parser_expression (parser, false);
18440 if (t == error_mark_node
18441 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18442 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18443 /*or_comma=*/false,
18444 /*consume_paren=*/true);
18446 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS, "num_threads");
18448 c = build_omp_clause (OMP_CLAUSE_NUM_THREADS);
18449 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
18450 OMP_CLAUSE_CHAIN (c) = list;
18459 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED, tree list)
18463 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED, "ordered");
18465 c = build_omp_clause (OMP_CLAUSE_ORDERED);
18466 OMP_CLAUSE_CHAIN (c) = list;
18471 reduction ( reduction-operator : variable-list )
18473 reduction-operator:
18474 One of: + * - & ^ | && || */
18477 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
18479 enum tree_code code;
18482 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18485 switch (cp_lexer_peek_token (parser->lexer)->type)
18497 code = BIT_AND_EXPR;
18500 code = BIT_XOR_EXPR;
18503 code = BIT_IOR_EXPR;
18506 code = TRUTH_ANDIF_EXPR;
18509 code = TRUTH_ORIF_EXPR;
18512 cp_parser_error (parser, "`+', `*', `-', `&', `^', `|', `&&', or `||'");
18514 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18515 /*or_comma=*/false,
18516 /*consume_paren=*/true);
18519 cp_lexer_consume_token (parser->lexer);
18521 if (!cp_parser_require (parser, CPP_COLON, "`:'"))
18524 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
18525 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
18526 OMP_CLAUSE_REDUCTION_CODE (c) = code;
18532 schedule ( schedule-kind )
18533 schedule ( schedule-kind , expression )
18536 static | dynamic | guided | runtime */
18539 cp_parser_omp_clause_schedule (cp_parser *parser, tree list)
18543 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "expected %<(%>"))
18546 c = build_omp_clause (OMP_CLAUSE_SCHEDULE);
18548 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18550 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
18551 const char *p = IDENTIFIER_POINTER (id);
18556 if (strcmp ("dynamic", p) != 0)
18558 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
18562 if (strcmp ("guided", p) != 0)
18564 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
18568 if (strcmp ("runtime", p) != 0)
18570 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
18577 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
18578 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
18581 cp_lexer_consume_token (parser->lexer);
18583 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
18585 cp_lexer_consume_token (parser->lexer);
18587 t = cp_parser_assignment_expression (parser, false);
18589 if (t == error_mark_node)
18591 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
18592 error ("schedule %<runtime%> does not take "
18593 "a %<chunk_size%> parameter");
18595 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
18597 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18600 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`,' or `)'"))
18603 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule");
18604 OMP_CLAUSE_CHAIN (c) = list;
18608 cp_parser_error (parser, "invalid schedule kind");
18610 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18611 /*or_comma=*/false,
18612 /*consume_paren=*/true);
18616 /* Parse all OpenMP clauses. The set clauses allowed by the directive
18617 is a bitmask in MASK. Return the list of clauses found; the result
18618 of clause default goes in *pdefault. */
18621 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
18622 const char *where, cp_token *pragma_tok)
18624 tree clauses = NULL;
18626 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
18628 pragma_omp_clause c_kind = cp_parser_omp_clause_name (parser);
18629 const char *c_name;
18630 tree prev = clauses;
18634 case PRAGMA_OMP_CLAUSE_COPYIN:
18635 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
18638 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
18639 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
18641 c_name = "copyprivate";
18643 case PRAGMA_OMP_CLAUSE_DEFAULT:
18644 clauses = cp_parser_omp_clause_default (parser, clauses);
18645 c_name = "default";
18647 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
18648 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
18650 c_name = "firstprivate";
18652 case PRAGMA_OMP_CLAUSE_IF:
18653 clauses = cp_parser_omp_clause_if (parser, clauses);
18656 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
18657 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
18659 c_name = "lastprivate";
18661 case PRAGMA_OMP_CLAUSE_NOWAIT:
18662 clauses = cp_parser_omp_clause_nowait (parser, clauses);
18665 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
18666 clauses = cp_parser_omp_clause_num_threads (parser, clauses);
18667 c_name = "num_threads";
18669 case PRAGMA_OMP_CLAUSE_ORDERED:
18670 clauses = cp_parser_omp_clause_ordered (parser, clauses);
18671 c_name = "ordered";
18673 case PRAGMA_OMP_CLAUSE_PRIVATE:
18674 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
18676 c_name = "private";
18678 case PRAGMA_OMP_CLAUSE_REDUCTION:
18679 clauses = cp_parser_omp_clause_reduction (parser, clauses);
18680 c_name = "reduction";
18682 case PRAGMA_OMP_CLAUSE_SCHEDULE:
18683 clauses = cp_parser_omp_clause_schedule (parser, clauses);
18684 c_name = "schedule";
18686 case PRAGMA_OMP_CLAUSE_SHARED:
18687 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
18692 cp_parser_error (parser, "expected %<#pragma omp%> clause");
18696 if (((mask >> c_kind) & 1) == 0)
18698 /* Remove the invalid clause(s) from the list to avoid
18699 confusing the rest of the compiler. */
18701 error ("%qs is not valid for %qs", c_name, where);
18705 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
18706 return finish_omp_clauses (clauses);
18713 In practice, we're also interested in adding the statement to an
18714 outer node. So it is convenient if we work around the fact that
18715 cp_parser_statement calls add_stmt. */
18718 cp_parser_begin_omp_structured_block (cp_parser *parser)
18720 unsigned save = parser->in_statement;
18722 /* Only move the values to IN_OMP_BLOCK if they weren't false.
18723 This preserves the "not within loop or switch" style error messages
18724 for nonsense cases like
18730 if (parser->in_statement)
18731 parser->in_statement = IN_OMP_BLOCK;
18737 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
18739 parser->in_statement = save;
18743 cp_parser_omp_structured_block (cp_parser *parser)
18745 tree stmt = begin_omp_structured_block ();
18746 unsigned int save = cp_parser_begin_omp_structured_block (parser);
18748 cp_parser_statement (parser, NULL_TREE, false, NULL);
18750 cp_parser_end_omp_structured_block (parser, save);
18751 return finish_omp_structured_block (stmt);
18755 # pragma omp atomic new-line
18759 x binop= expr | x++ | ++x | x-- | --x
18761 +, *, -, /, &, ^, |, <<, >>
18763 where x is an lvalue expression with scalar type. */
18766 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
18769 enum tree_code code;
18771 cp_parser_require_pragma_eol (parser, pragma_tok);
18773 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
18775 switch (TREE_CODE (lhs))
18780 case PREINCREMENT_EXPR:
18781 case POSTINCREMENT_EXPR:
18782 lhs = TREE_OPERAND (lhs, 0);
18784 rhs = integer_one_node;
18787 case PREDECREMENT_EXPR:
18788 case POSTDECREMENT_EXPR:
18789 lhs = TREE_OPERAND (lhs, 0);
18791 rhs = integer_one_node;
18795 switch (cp_lexer_peek_token (parser->lexer)->type)
18801 code = TRUNC_DIV_EXPR;
18809 case CPP_LSHIFT_EQ:
18810 code = LSHIFT_EXPR;
18812 case CPP_RSHIFT_EQ:
18813 code = RSHIFT_EXPR;
18816 code = BIT_AND_EXPR;
18819 code = BIT_IOR_EXPR;
18822 code = BIT_XOR_EXPR;
18825 cp_parser_error (parser,
18826 "invalid operator for %<#pragma omp atomic%>");
18829 cp_lexer_consume_token (parser->lexer);
18831 rhs = cp_parser_expression (parser, false);
18832 if (rhs == error_mark_node)
18836 finish_omp_atomic (code, lhs, rhs);
18837 cp_parser_consume_semicolon_at_end_of_statement (parser);
18841 cp_parser_skip_to_end_of_block_or_statement (parser);
18846 # pragma omp barrier new-line */
18849 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
18851 cp_parser_require_pragma_eol (parser, pragma_tok);
18852 finish_omp_barrier ();
18856 # pragma omp critical [(name)] new-line
18857 structured-block */
18860 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
18862 tree stmt, name = NULL;
18864 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
18866 cp_lexer_consume_token (parser->lexer);
18868 name = cp_parser_identifier (parser);
18870 if (name == error_mark_node
18871 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18872 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18873 /*or_comma=*/false,
18874 /*consume_paren=*/true);
18875 if (name == error_mark_node)
18878 cp_parser_require_pragma_eol (parser, pragma_tok);
18880 stmt = cp_parser_omp_structured_block (parser);
18881 return c_finish_omp_critical (stmt, name);
18885 # pragma omp flush flush-vars[opt] new-line
18888 ( variable-list ) */
18891 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
18893 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
18894 (void) cp_parser_omp_var_list (parser, 0, NULL);
18895 cp_parser_require_pragma_eol (parser, pragma_tok);
18897 finish_omp_flush ();
18900 /* Parse the restricted form of the for statment allowed by OpenMP. */
18903 cp_parser_omp_for_loop (cp_parser *parser)
18905 tree init, cond, incr, body, decl, pre_body;
18908 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
18910 cp_parser_error (parser, "for statement expected");
18913 loc = cp_lexer_consume_token (parser->lexer)->location;
18914 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
18917 init = decl = NULL;
18918 pre_body = push_stmt_list ();
18919 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18921 cp_decl_specifier_seq type_specifiers;
18923 /* First, try to parse as an initialized declaration. See
18924 cp_parser_condition, from whence the bulk of this is copied. */
18926 cp_parser_parse_tentatively (parser);
18927 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
18929 if (!cp_parser_error_occurred (parser))
18931 tree asm_specification, attributes;
18932 cp_declarator *declarator;
18934 declarator = cp_parser_declarator (parser,
18935 CP_PARSER_DECLARATOR_NAMED,
18936 /*ctor_dtor_or_conv_p=*/NULL,
18937 /*parenthesized_p=*/NULL,
18938 /*member_p=*/false);
18939 attributes = cp_parser_attributes_opt (parser);
18940 asm_specification = cp_parser_asm_specification_opt (parser);
18942 cp_parser_require (parser, CPP_EQ, "`='");
18943 if (cp_parser_parse_definitely (parser))
18947 decl = start_decl (declarator, &type_specifiers,
18948 /*initialized_p=*/false, attributes,
18949 /*prefix_attributes=*/NULL_TREE,
18952 init = cp_parser_assignment_expression (parser, false);
18954 cp_finish_decl (decl, NULL_TREE, /*init_const_expr_p=*/false,
18955 asm_specification, LOOKUP_ONLYCONVERTING);
18958 pop_scope (pushed_scope);
18962 cp_parser_abort_tentative_parse (parser);
18964 /* If parsing as an initialized declaration failed, try again as
18965 a simple expression. */
18967 init = cp_parser_expression (parser, false);
18969 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
18970 pre_body = pop_stmt_list (pre_body);
18973 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18974 cond = cp_parser_condition (parser);
18975 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
18978 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
18979 incr = cp_parser_expression (parser, false);
18981 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
18982 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
18983 /*or_comma=*/false,
18984 /*consume_paren=*/true);
18986 /* Note that we saved the original contents of this flag when we entered
18987 the structured block, and so we don't need to re-save it here. */
18988 parser->in_statement = IN_OMP_FOR;
18990 /* Note that the grammar doesn't call for a structured block here,
18991 though the loop as a whole is a structured block. */
18992 body = push_stmt_list ();
18993 cp_parser_statement (parser, NULL_TREE, false, NULL);
18994 body = pop_stmt_list (body);
18996 return finish_omp_for (loc, decl, init, cond, incr, body, pre_body);
19000 #pragma omp for for-clause[optseq] new-line
19003 #define OMP_FOR_CLAUSE_MASK \
19004 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19005 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19006 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
19007 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
19008 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
19009 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
19010 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
19013 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
19015 tree clauses, sb, ret;
19018 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
19019 "#pragma omp for", pragma_tok);
19021 sb = begin_omp_structured_block ();
19022 save = cp_parser_begin_omp_structured_block (parser);
19024 ret = cp_parser_omp_for_loop (parser);
19026 OMP_FOR_CLAUSES (ret) = clauses;
19028 cp_parser_end_omp_structured_block (parser, save);
19029 add_stmt (finish_omp_structured_block (sb));
19035 # pragma omp master new-line
19036 structured-block */
19039 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
19041 cp_parser_require_pragma_eol (parser, pragma_tok);
19042 return c_finish_omp_master (cp_parser_omp_structured_block (parser));
19046 # pragma omp ordered new-line
19047 structured-block */
19050 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
19052 cp_parser_require_pragma_eol (parser, pragma_tok);
19053 return c_finish_omp_ordered (cp_parser_omp_structured_block (parser));
19059 { section-sequence }
19062 section-directive[opt] structured-block
19063 section-sequence section-directive structured-block */
19066 cp_parser_omp_sections_scope (cp_parser *parser)
19068 tree stmt, substmt;
19069 bool error_suppress = false;
19072 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
19075 stmt = push_stmt_list ();
19077 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
19081 substmt = begin_omp_structured_block ();
19082 save = cp_parser_begin_omp_structured_block (parser);
19086 cp_parser_statement (parser, NULL_TREE, false, NULL);
19088 tok = cp_lexer_peek_token (parser->lexer);
19089 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
19091 if (tok->type == CPP_CLOSE_BRACE)
19093 if (tok->type == CPP_EOF)
19097 cp_parser_end_omp_structured_block (parser, save);
19098 substmt = finish_omp_structured_block (substmt);
19099 substmt = build1 (OMP_SECTION, void_type_node, substmt);
19100 add_stmt (substmt);
19105 tok = cp_lexer_peek_token (parser->lexer);
19106 if (tok->type == CPP_CLOSE_BRACE)
19108 if (tok->type == CPP_EOF)
19111 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
19113 cp_lexer_consume_token (parser->lexer);
19114 cp_parser_require_pragma_eol (parser, tok);
19115 error_suppress = false;
19117 else if (!error_suppress)
19119 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
19120 error_suppress = true;
19123 substmt = cp_parser_omp_structured_block (parser);
19124 substmt = build1 (OMP_SECTION, void_type_node, substmt);
19125 add_stmt (substmt);
19127 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
19129 substmt = pop_stmt_list (stmt);
19131 stmt = make_node (OMP_SECTIONS);
19132 TREE_TYPE (stmt) = void_type_node;
19133 OMP_SECTIONS_BODY (stmt) = substmt;
19140 # pragma omp sections sections-clause[optseq] newline
19143 #define OMP_SECTIONS_CLAUSE_MASK \
19144 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19145 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19146 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
19147 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
19148 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
19151 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
19155 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
19156 "#pragma omp sections", pragma_tok);
19158 ret = cp_parser_omp_sections_scope (parser);
19160 OMP_SECTIONS_CLAUSES (ret) = clauses;
19166 # pragma parallel parallel-clause new-line
19167 # pragma parallel for parallel-for-clause new-line
19168 # pragma parallel sections parallel-sections-clause new-line */
19170 #define OMP_PARALLEL_CLAUSE_MASK \
19171 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
19172 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19173 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19174 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
19175 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
19176 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
19177 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
19178 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
19181 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
19183 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
19184 const char *p_name = "#pragma omp parallel";
19185 tree stmt, clauses, par_clause, ws_clause, block;
19186 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
19189 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
19191 cp_lexer_consume_token (parser->lexer);
19192 p_kind = PRAGMA_OMP_PARALLEL_FOR;
19193 p_name = "#pragma omp parallel for";
19194 mask |= OMP_FOR_CLAUSE_MASK;
19195 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
19197 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
19199 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
19200 const char *p = IDENTIFIER_POINTER (id);
19201 if (strcmp (p, "sections") == 0)
19203 cp_lexer_consume_token (parser->lexer);
19204 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
19205 p_name = "#pragma omp parallel sections";
19206 mask |= OMP_SECTIONS_CLAUSE_MASK;
19207 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
19211 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
19212 block = begin_omp_parallel ();
19213 save = cp_parser_begin_omp_structured_block (parser);
19217 case PRAGMA_OMP_PARALLEL:
19218 cp_parser_already_scoped_statement (parser);
19219 par_clause = clauses;
19222 case PRAGMA_OMP_PARALLEL_FOR:
19223 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
19224 stmt = cp_parser_omp_for_loop (parser);
19226 OMP_FOR_CLAUSES (stmt) = ws_clause;
19229 case PRAGMA_OMP_PARALLEL_SECTIONS:
19230 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
19231 stmt = cp_parser_omp_sections_scope (parser);
19233 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
19237 gcc_unreachable ();
19240 cp_parser_end_omp_structured_block (parser, save);
19241 stmt = finish_omp_parallel (par_clause, block);
19242 if (p_kind != PRAGMA_OMP_PARALLEL)
19243 OMP_PARALLEL_COMBINED (stmt) = 1;
19248 # pragma omp single single-clause[optseq] new-line
19249 structured-block */
19251 #define OMP_SINGLE_CLAUSE_MASK \
19252 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
19253 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
19254 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
19255 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
19258 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
19260 tree stmt = make_node (OMP_SINGLE);
19261 TREE_TYPE (stmt) = void_type_node;
19263 OMP_SINGLE_CLAUSES (stmt)
19264 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
19265 "#pragma omp single", pragma_tok);
19266 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
19268 return add_stmt (stmt);
19272 # pragma omp threadprivate (variable-list) */
19275 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
19279 vars = cp_parser_omp_var_list (parser, 0, NULL);
19280 cp_parser_require_pragma_eol (parser, pragma_tok);
19282 if (!targetm.have_tls)
19283 sorry ("threadprivate variables not supported in this target");
19285 finish_omp_threadprivate (vars);
19288 /* Main entry point to OpenMP statement pragmas. */
19291 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
19295 switch (pragma_tok->pragma_kind)
19297 case PRAGMA_OMP_ATOMIC:
19298 cp_parser_omp_atomic (parser, pragma_tok);
19300 case PRAGMA_OMP_CRITICAL:
19301 stmt = cp_parser_omp_critical (parser, pragma_tok);
19303 case PRAGMA_OMP_FOR:
19304 stmt = cp_parser_omp_for (parser, pragma_tok);
19306 case PRAGMA_OMP_MASTER:
19307 stmt = cp_parser_omp_master (parser, pragma_tok);
19309 case PRAGMA_OMP_ORDERED:
19310 stmt = cp_parser_omp_ordered (parser, pragma_tok);
19312 case PRAGMA_OMP_PARALLEL:
19313 stmt = cp_parser_omp_parallel (parser, pragma_tok);
19315 case PRAGMA_OMP_SECTIONS:
19316 stmt = cp_parser_omp_sections (parser, pragma_tok);
19318 case PRAGMA_OMP_SINGLE:
19319 stmt = cp_parser_omp_single (parser, pragma_tok);
19322 gcc_unreachable ();
19326 SET_EXPR_LOCATION (stmt, pragma_tok->location);
19331 static GTY (()) cp_parser *the_parser;
19334 /* Special handling for the first token or line in the file. The first
19335 thing in the file might be #pragma GCC pch_preprocess, which loads a
19336 PCH file, which is a GC collection point. So we need to handle this
19337 first pragma without benefit of an existing lexer structure.
19339 Always returns one token to the caller in *FIRST_TOKEN. This is
19340 either the true first token of the file, or the first token after
19341 the initial pragma. */
19344 cp_parser_initial_pragma (cp_token *first_token)
19348 cp_lexer_get_preprocessor_token (NULL, first_token);
19349 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
19352 cp_lexer_get_preprocessor_token (NULL, first_token);
19353 if (first_token->type == CPP_STRING)
19355 name = first_token->u.value;
19357 cp_lexer_get_preprocessor_token (NULL, first_token);
19358 if (first_token->type != CPP_PRAGMA_EOL)
19359 error ("junk at end of %<#pragma GCC pch_preprocess%>");
19362 error ("expected string literal");
19364 /* Skip to the end of the pragma. */
19365 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
19366 cp_lexer_get_preprocessor_token (NULL, first_token);
19368 /* Now actually load the PCH file. */
19370 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
19372 /* Read one more token to return to our caller. We have to do this
19373 after reading the PCH file in, since its pointers have to be
19375 cp_lexer_get_preprocessor_token (NULL, first_token);
19378 /* Normal parsing of a pragma token. Here we can (and must) use the
19382 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
19384 cp_token *pragma_tok;
19387 pragma_tok = cp_lexer_consume_token (parser->lexer);
19388 gcc_assert (pragma_tok->type == CPP_PRAGMA);
19389 parser->lexer->in_pragma = true;
19391 id = pragma_tok->pragma_kind;
19394 case PRAGMA_GCC_PCH_PREPROCESS:
19395 error ("%<#pragma GCC pch_preprocess%> must be first");
19398 case PRAGMA_OMP_BARRIER:
19401 case pragma_compound:
19402 cp_parser_omp_barrier (parser, pragma_tok);
19405 error ("%<#pragma omp barrier%> may only be "
19406 "used in compound statements");
19413 case PRAGMA_OMP_FLUSH:
19416 case pragma_compound:
19417 cp_parser_omp_flush (parser, pragma_tok);
19420 error ("%<#pragma omp flush%> may only be "
19421 "used in compound statements");
19428 case PRAGMA_OMP_THREADPRIVATE:
19429 cp_parser_omp_threadprivate (parser, pragma_tok);
19432 case PRAGMA_OMP_ATOMIC:
19433 case PRAGMA_OMP_CRITICAL:
19434 case PRAGMA_OMP_FOR:
19435 case PRAGMA_OMP_MASTER:
19436 case PRAGMA_OMP_ORDERED:
19437 case PRAGMA_OMP_PARALLEL:
19438 case PRAGMA_OMP_SECTIONS:
19439 case PRAGMA_OMP_SINGLE:
19440 if (context == pragma_external)
19442 cp_parser_omp_construct (parser, pragma_tok);
19445 case PRAGMA_OMP_SECTION:
19446 error ("%<#pragma omp section%> may only be used in "
19447 "%<#pragma omp sections%> construct");
19451 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
19452 c_invoke_pragma_handler (id);
19456 cp_parser_error (parser, "expected declaration specifiers");
19460 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
19464 /* The interface the pragma parsers have to the lexer. */
19467 pragma_lex (tree *value)
19470 enum cpp_ttype ret;
19472 tok = cp_lexer_peek_token (the_parser->lexer);
19475 *value = tok->u.value;
19477 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
19479 else if (ret == CPP_STRING)
19480 *value = cp_parser_string_literal (the_parser, false, false);
19483 cp_lexer_consume_token (the_parser->lexer);
19484 if (ret == CPP_KEYWORD)
19492 /* External interface. */
19494 /* Parse one entire translation unit. */
19497 c_parse_file (void)
19499 bool error_occurred;
19500 static bool already_called = false;
19502 if (already_called)
19504 sorry ("inter-module optimizations not implemented for C++");
19507 already_called = true;
19509 the_parser = cp_parser_new ();
19510 push_deferring_access_checks (flag_access_control
19511 ? dk_no_deferred : dk_no_check);
19512 error_occurred = cp_parser_translation_unit (the_parser);
19516 /* This variable must be provided by every front end. */
19520 #include "gt-cp-parser.h"