2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008 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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
26 #include "dyn-string.h"
34 #include "diagnostic.h"
44 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
45 and c-lex.c) and the C++ parser. */
47 /* A token's value and its associated deferred access checks and
50 struct tree_check GTY(())
52 /* The value associated with the token. */
54 /* The checks that have been associated with value. */
55 VEC (deferred_access_check, gc)* checks;
56 /* The token's qualifying scope (used when it is a
57 CPP_NESTED_NAME_SPECIFIER). */
58 tree qualifying_scope;
63 typedef struct cp_token GTY (())
65 /* The kind of token. */
66 ENUM_BITFIELD (cpp_ttype) type : 8;
67 /* If this token is a keyword, this value indicates which keyword.
68 Otherwise, this value is RID_MAX. */
69 ENUM_BITFIELD (rid) keyword : 8;
72 /* Identifier for the pragma. */
73 ENUM_BITFIELD (pragma_kind) pragma_kind : 6;
74 /* True if this token is from a context where it is implicitly extern "C" */
75 BOOL_BITFIELD implicit_extern_c : 1;
76 /* True for a CPP_NAME token that is not a keyword (i.e., for which
77 KEYWORD is RID_MAX) iff this name was looked up and found to be
78 ambiguous. An error has already been reported. */
79 BOOL_BITFIELD ambiguous_p : 1;
80 /* The value associated with this token, if any. */
81 union cp_token_value {
82 /* Used for CPP_NESTED_NAME_SPECIFIER and CPP_TEMPLATE_ID. */
83 struct tree_check* GTY((tag ("1"))) tree_check_value;
84 /* Use for all other tokens. */
85 tree GTY((tag ("0"))) value;
86 } GTY((desc ("(%1.type == CPP_TEMPLATE_ID) || (%1.type == CPP_NESTED_NAME_SPECIFIER)"))) u;
87 /* The location at which this token was found. */
91 /* We use a stack of token pointer for saving token sets. */
92 typedef struct cp_token *cp_token_position;
93 DEF_VEC_P (cp_token_position);
94 DEF_VEC_ALLOC_P (cp_token_position,heap);
96 static cp_token eof_token =
98 CPP_EOF, RID_MAX, 0, PRAGMA_NONE, false, 0, { NULL },
102 /* The cp_lexer structure represents the C++ lexer. It is responsible
103 for managing the token stream from the preprocessor and supplying
104 it to the parser. Tokens are never added to the cp_lexer after
107 typedef struct cp_lexer GTY (())
109 /* The memory allocated for the buffer. NULL if this lexer does not
110 own the token buffer. */
111 cp_token * GTY ((length ("%h.buffer_length"))) buffer;
112 /* If the lexer owns the buffer, this is the number of tokens in the
114 size_t buffer_length;
116 /* A pointer just past the last available token. The tokens
117 in this lexer are [buffer, last_token). */
118 cp_token_position GTY ((skip)) last_token;
120 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
121 no more available tokens. */
122 cp_token_position GTY ((skip)) next_token;
124 /* A stack indicating positions at which cp_lexer_save_tokens was
125 called. The top entry is the most recent position at which we
126 began saving tokens. If the stack is non-empty, we are saving
128 VEC(cp_token_position,heap) *GTY ((skip)) saved_tokens;
130 /* The next lexer in a linked list of lexers. */
131 struct cp_lexer *next;
133 /* True if we should output debugging information. */
136 /* True if we're in the context of parsing a pragma, and should not
137 increment past the end-of-line marker. */
141 /* cp_token_cache is a range of tokens. There is no need to represent
142 allocate heap memory for it, since tokens are never removed from the
143 lexer's array. There is also no need for the GC to walk through
144 a cp_token_cache, since everything in here is referenced through
147 typedef struct cp_token_cache GTY(())
149 /* The beginning of the token range. */
150 cp_token * GTY((skip)) first;
152 /* Points immediately after the last token in the range. */
153 cp_token * GTY ((skip)) last;
158 static cp_lexer *cp_lexer_new_main
160 static cp_lexer *cp_lexer_new_from_tokens
161 (cp_token_cache *tokens);
162 static void cp_lexer_destroy
164 static int cp_lexer_saving_tokens
166 static cp_token_position cp_lexer_token_position
168 static cp_token *cp_lexer_token_at
169 (cp_lexer *, cp_token_position);
170 static void cp_lexer_get_preprocessor_token
171 (cp_lexer *, cp_token *);
172 static inline cp_token *cp_lexer_peek_token
174 static cp_token *cp_lexer_peek_nth_token
175 (cp_lexer *, size_t);
176 static inline bool cp_lexer_next_token_is
177 (cp_lexer *, enum cpp_ttype);
178 static bool cp_lexer_next_token_is_not
179 (cp_lexer *, enum cpp_ttype);
180 static bool cp_lexer_next_token_is_keyword
181 (cp_lexer *, enum rid);
182 static cp_token *cp_lexer_consume_token
184 static void cp_lexer_purge_token
186 static void cp_lexer_purge_tokens_after
187 (cp_lexer *, cp_token_position);
188 static void cp_lexer_save_tokens
190 static void cp_lexer_commit_tokens
192 static void cp_lexer_rollback_tokens
194 #ifdef ENABLE_CHECKING
195 static void cp_lexer_print_token
196 (FILE *, cp_token *);
197 static inline bool cp_lexer_debugging_p
199 static void cp_lexer_start_debugging
200 (cp_lexer *) ATTRIBUTE_UNUSED;
201 static void cp_lexer_stop_debugging
202 (cp_lexer *) ATTRIBUTE_UNUSED;
204 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
205 about passing NULL to functions that require non-NULL arguments
206 (fputs, fprintf). It will never be used, so all we need is a value
207 of the right type that's guaranteed not to be NULL. */
208 #define cp_lexer_debug_stream stdout
209 #define cp_lexer_print_token(str, tok) (void) 0
210 #define cp_lexer_debugging_p(lexer) 0
211 #endif /* ENABLE_CHECKING */
213 static cp_token_cache *cp_token_cache_new
214 (cp_token *, cp_token *);
216 static void cp_parser_initial_pragma
219 /* Manifest constants. */
220 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
221 #define CP_SAVED_TOKEN_STACK 5
223 /* A token type for keywords, as opposed to ordinary identifiers. */
224 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
226 /* A token type for template-ids. If a template-id is processed while
227 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
228 the value of the CPP_TEMPLATE_ID is whatever was returned by
229 cp_parser_template_id. */
230 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
232 /* A token type for nested-name-specifiers. If a
233 nested-name-specifier is processed while parsing tentatively, it is
234 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
235 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
236 cp_parser_nested_name_specifier_opt. */
237 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
239 /* A token type for tokens that are not tokens at all; these are used
240 to represent slots in the array where there used to be a token
241 that has now been deleted. */
242 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
244 /* The number of token types, including C++-specific ones. */
245 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
249 #ifdef ENABLE_CHECKING
250 /* The stream to which debugging output should be written. */
251 static FILE *cp_lexer_debug_stream;
252 #endif /* ENABLE_CHECKING */
254 /* Create a new main C++ lexer, the lexer that gets tokens from the
258 cp_lexer_new_main (void)
260 cp_token first_token;
267 /* It's possible that parsing the first pragma will load a PCH file,
268 which is a GC collection point. So we have to do that before
269 allocating any memory. */
270 cp_parser_initial_pragma (&first_token);
272 c_common_no_more_pch ();
274 /* Allocate the memory. */
275 lexer = GGC_CNEW (cp_lexer);
277 #ifdef ENABLE_CHECKING
278 /* Initially we are not debugging. */
279 lexer->debugging_p = false;
280 #endif /* ENABLE_CHECKING */
281 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
282 CP_SAVED_TOKEN_STACK);
284 /* Create the buffer. */
285 alloc = CP_LEXER_BUFFER_SIZE;
286 buffer = GGC_NEWVEC (cp_token, alloc);
288 /* Put the first token in the buffer. */
293 /* Get the remaining tokens from the preprocessor. */
294 while (pos->type != CPP_EOF)
301 buffer = GGC_RESIZEVEC (cp_token, buffer, alloc);
302 pos = buffer + space;
304 cp_lexer_get_preprocessor_token (lexer, pos);
306 lexer->buffer = buffer;
307 lexer->buffer_length = alloc - space;
308 lexer->last_token = pos;
309 lexer->next_token = lexer->buffer_length ? buffer : &eof_token;
311 /* Subsequent preprocessor diagnostics should use compiler
312 diagnostic functions to get the compiler source location. */
313 cpp_get_options (parse_in)->client_diagnostic = true;
314 cpp_get_callbacks (parse_in)->error = cp_cpp_error;
316 gcc_assert (lexer->next_token->type != CPP_PURGED);
320 /* Create a new lexer whose token stream is primed with the tokens in
321 CACHE. When these tokens are exhausted, no new tokens will be read. */
324 cp_lexer_new_from_tokens (cp_token_cache *cache)
326 cp_token *first = cache->first;
327 cp_token *last = cache->last;
328 cp_lexer *lexer = GGC_CNEW (cp_lexer);
330 /* We do not own the buffer. */
331 lexer->buffer = NULL;
332 lexer->buffer_length = 0;
333 lexer->next_token = first == last ? &eof_token : first;
334 lexer->last_token = last;
336 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
337 CP_SAVED_TOKEN_STACK);
339 #ifdef ENABLE_CHECKING
340 /* Initially we are not debugging. */
341 lexer->debugging_p = false;
344 gcc_assert (lexer->next_token->type != CPP_PURGED);
348 /* Frees all resources associated with LEXER. */
351 cp_lexer_destroy (cp_lexer *lexer)
354 ggc_free (lexer->buffer);
355 VEC_free (cp_token_position, heap, lexer->saved_tokens);
359 /* Returns nonzero if debugging information should be output. */
361 #ifdef ENABLE_CHECKING
364 cp_lexer_debugging_p (cp_lexer *lexer)
366 return lexer->debugging_p;
369 #endif /* ENABLE_CHECKING */
371 static inline cp_token_position
372 cp_lexer_token_position (cp_lexer *lexer, bool previous_p)
374 gcc_assert (!previous_p || lexer->next_token != &eof_token);
376 return lexer->next_token - previous_p;
379 static inline cp_token *
380 cp_lexer_token_at (cp_lexer *lexer ATTRIBUTE_UNUSED, cp_token_position pos)
385 /* nonzero if we are presently saving tokens. */
388 cp_lexer_saving_tokens (const cp_lexer* lexer)
390 return VEC_length (cp_token_position, lexer->saved_tokens) != 0;
393 /* Store the next token from the preprocessor in *TOKEN. Return true
394 if we reach EOF. If LEXER is NULL, assume we are handling an
395 initial #pragma pch_preprocess, and thus want the lexer to return
396 processed strings. */
399 cp_lexer_get_preprocessor_token (cp_lexer *lexer, cp_token *token)
401 static int is_extern_c = 0;
403 /* Get a new token from the preprocessor. */
405 = c_lex_with_flags (&token->u.value, &token->location, &token->flags,
406 lexer == NULL ? 0 : C_LEX_RAW_STRINGS);
407 token->keyword = RID_MAX;
408 token->pragma_kind = PRAGMA_NONE;
410 /* On some systems, some header files are surrounded by an
411 implicit extern "C" block. Set a flag in the token if it
412 comes from such a header. */
413 is_extern_c += pending_lang_change;
414 pending_lang_change = 0;
415 token->implicit_extern_c = is_extern_c > 0;
417 /* Check to see if this token is a keyword. */
418 if (token->type == CPP_NAME)
420 if (C_IS_RESERVED_WORD (token->u.value))
422 /* Mark this token as a keyword. */
423 token->type = CPP_KEYWORD;
424 /* Record which keyword. */
425 token->keyword = C_RID_CODE (token->u.value);
426 /* Update the value. Some keywords are mapped to particular
427 entities, rather than simply having the value of the
428 corresponding IDENTIFIER_NODE. For example, `__const' is
429 mapped to `const'. */
430 token->u.value = ridpointers[token->keyword];
434 if (warn_cxx0x_compat
435 && C_RID_CODE (token->u.value) >= RID_FIRST_CXX0X
436 && C_RID_CODE (token->u.value) <= RID_LAST_CXX0X)
438 /* Warn about the C++0x keyword (but still treat it as
440 warning (OPT_Wc__0x_compat,
441 "identifier %<%s%> will become a keyword in C++0x",
442 IDENTIFIER_POINTER (token->u.value));
444 /* Clear out the C_RID_CODE so we don't warn about this
445 particular identifier-turned-keyword again. */
446 C_SET_RID_CODE (token->u.value, RID_MAX);
449 token->ambiguous_p = false;
450 token->keyword = RID_MAX;
453 /* Handle Objective-C++ keywords. */
454 else if (token->type == CPP_AT_NAME)
456 token->type = CPP_KEYWORD;
457 switch (C_RID_CODE (token->u.value))
459 /* Map 'class' to '@class', 'private' to '@private', etc. */
460 case RID_CLASS: token->keyword = RID_AT_CLASS; break;
461 case RID_PRIVATE: token->keyword = RID_AT_PRIVATE; break;
462 case RID_PROTECTED: token->keyword = RID_AT_PROTECTED; break;
463 case RID_PUBLIC: token->keyword = RID_AT_PUBLIC; break;
464 case RID_THROW: token->keyword = RID_AT_THROW; break;
465 case RID_TRY: token->keyword = RID_AT_TRY; break;
466 case RID_CATCH: token->keyword = RID_AT_CATCH; break;
467 default: token->keyword = C_RID_CODE (token->u.value);
470 else if (token->type == CPP_PRAGMA)
472 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
473 token->pragma_kind = TREE_INT_CST_LOW (token->u.value);
474 token->u.value = NULL_TREE;
478 /* Update the globals input_location and the input file stack from TOKEN. */
480 cp_lexer_set_source_position_from_token (cp_token *token)
482 if (token->type != CPP_EOF)
484 input_location = token->location;
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 not the indicated KEYWORD. */
530 cp_lexer_next_token_is_not_keyword (cp_lexer* lexer, enum rid keyword)
532 return cp_lexer_peek_token (lexer)->keyword != keyword;
535 /* Return true if the next token is a keyword for a decl-specifier. */
538 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer *lexer)
542 token = cp_lexer_peek_token (lexer);
543 switch (token->keyword)
545 /* auto specifier: storage-class-specifier in C++,
546 simple-type-specifier in C++0x. */
548 /* Storage classes. */
554 /* Elaborated type specifiers. */
560 /* Simple type specifiers. */
574 /* GNU extensions. */
577 /* C++0x extensions. */
586 /* Return a pointer to the Nth token in the token stream. If N is 1,
587 then this is precisely equivalent to cp_lexer_peek_token (except
588 that it is not inline). One would like to disallow that case, but
589 there is one case (cp_parser_nth_token_starts_template_id) where
590 the caller passes a variable for N and it might be 1. */
593 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
597 /* N is 1-based, not zero-based. */
600 if (cp_lexer_debugging_p (lexer))
601 fprintf (cp_lexer_debug_stream,
602 "cp_lexer: peeking ahead %ld at token: ", (long)n);
605 token = lexer->next_token;
606 gcc_assert (!n || token != &eof_token);
610 if (token == lexer->last_token)
616 if (token->type != CPP_PURGED)
620 if (cp_lexer_debugging_p (lexer))
622 cp_lexer_print_token (cp_lexer_debug_stream, token);
623 putc ('\n', cp_lexer_debug_stream);
629 /* Return the next token, and advance the lexer's next_token pointer
630 to point to the next non-purged token. */
633 cp_lexer_consume_token (cp_lexer* lexer)
635 cp_token *token = lexer->next_token;
637 gcc_assert (token != &eof_token);
638 gcc_assert (!lexer->in_pragma || token->type != CPP_PRAGMA_EOL);
643 if (lexer->next_token == lexer->last_token)
645 lexer->next_token = &eof_token;
650 while (lexer->next_token->type == CPP_PURGED);
652 cp_lexer_set_source_position_from_token (token);
654 /* Provide debugging output. */
655 if (cp_lexer_debugging_p (lexer))
657 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
658 cp_lexer_print_token (cp_lexer_debug_stream, token);
659 putc ('\n', cp_lexer_debug_stream);
665 /* Permanently remove the next token from the token stream, and
666 advance the next_token pointer to refer to the next non-purged
670 cp_lexer_purge_token (cp_lexer *lexer)
672 cp_token *tok = lexer->next_token;
674 gcc_assert (tok != &eof_token);
675 tok->type = CPP_PURGED;
676 tok->location = UNKNOWN_LOCATION;
677 tok->u.value = NULL_TREE;
678 tok->keyword = RID_MAX;
683 if (tok == lexer->last_token)
689 while (tok->type == CPP_PURGED);
690 lexer->next_token = tok;
693 /* Permanently remove all tokens after TOK, up to, but not
694 including, the token that will be returned next by
695 cp_lexer_peek_token. */
698 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
700 cp_token *peek = lexer->next_token;
702 if (peek == &eof_token)
703 peek = lexer->last_token;
705 gcc_assert (tok < peek);
707 for ( tok += 1; tok != peek; tok += 1)
709 tok->type = CPP_PURGED;
710 tok->location = UNKNOWN_LOCATION;
711 tok->u.value = NULL_TREE;
712 tok->keyword = RID_MAX;
716 /* Begin saving tokens. All tokens consumed after this point will be
720 cp_lexer_save_tokens (cp_lexer* lexer)
722 /* Provide debugging output. */
723 if (cp_lexer_debugging_p (lexer))
724 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
726 VEC_safe_push (cp_token_position, heap,
727 lexer->saved_tokens, lexer->next_token);
730 /* Commit to the portion of the token stream most recently saved. */
733 cp_lexer_commit_tokens (cp_lexer* lexer)
735 /* Provide debugging output. */
736 if (cp_lexer_debugging_p (lexer))
737 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
739 VEC_pop (cp_token_position, lexer->saved_tokens);
742 /* Return all tokens saved since the last call to cp_lexer_save_tokens
743 to the token stream. Stop saving tokens. */
746 cp_lexer_rollback_tokens (cp_lexer* lexer)
748 /* Provide debugging output. */
749 if (cp_lexer_debugging_p (lexer))
750 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
752 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
755 /* Print a representation of the TOKEN on the STREAM. */
757 #ifdef ENABLE_CHECKING
760 cp_lexer_print_token (FILE * stream, cp_token *token)
762 /* We don't use cpp_type2name here because the parser defines
763 a few tokens of its own. */
764 static const char *const token_names[] = {
765 /* cpplib-defined token types */
771 /* C++ parser token types - see "Manifest constants", above. */
774 "NESTED_NAME_SPECIFIER",
778 /* If we have a name for the token, print it out. Otherwise, we
779 simply give the numeric code. */
780 gcc_assert (token->type < ARRAY_SIZE(token_names));
781 fputs (token_names[token->type], stream);
783 /* For some tokens, print the associated data. */
787 /* Some keywords have a value that is not an IDENTIFIER_NODE.
788 For example, `struct' is mapped to an INTEGER_CST. */
789 if (TREE_CODE (token->u.value) != IDENTIFIER_NODE)
791 /* else fall through */
793 fputs (IDENTIFIER_POINTER (token->u.value), stream);
800 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->u.value));
808 /* Start emitting debugging information. */
811 cp_lexer_start_debugging (cp_lexer* lexer)
813 lexer->debugging_p = true;
816 /* Stop emitting debugging information. */
819 cp_lexer_stop_debugging (cp_lexer* lexer)
821 lexer->debugging_p = false;
824 #endif /* ENABLE_CHECKING */
826 /* Create a new cp_token_cache, representing a range of tokens. */
828 static cp_token_cache *
829 cp_token_cache_new (cp_token *first, cp_token *last)
831 cp_token_cache *cache = GGC_NEW (cp_token_cache);
832 cache->first = first;
838 /* Decl-specifiers. */
840 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
843 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
845 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
850 /* Nothing other than the parser should be creating declarators;
851 declarators are a semi-syntactic representation of C++ entities.
852 Other parts of the front end that need to create entities (like
853 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
855 static cp_declarator *make_call_declarator
856 (cp_declarator *, tree, cp_cv_quals, tree, tree);
857 static cp_declarator *make_array_declarator
858 (cp_declarator *, tree);
859 static cp_declarator *make_pointer_declarator
860 (cp_cv_quals, cp_declarator *);
861 static cp_declarator *make_reference_declarator
862 (cp_cv_quals, cp_declarator *, bool);
863 static cp_parameter_declarator *make_parameter_declarator
864 (cp_decl_specifier_seq *, cp_declarator *, tree);
865 static cp_declarator *make_ptrmem_declarator
866 (cp_cv_quals, tree, cp_declarator *);
868 /* An erroneous declarator. */
869 static cp_declarator *cp_error_declarator;
871 /* The obstack on which declarators and related data structures are
873 static struct obstack declarator_obstack;
875 /* Alloc BYTES from the declarator memory pool. */
878 alloc_declarator (size_t bytes)
880 return obstack_alloc (&declarator_obstack, bytes);
883 /* Allocate a declarator of the indicated KIND. Clear fields that are
884 common to all declarators. */
886 static cp_declarator *
887 make_declarator (cp_declarator_kind kind)
889 cp_declarator *declarator;
891 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
892 declarator->kind = kind;
893 declarator->attributes = NULL_TREE;
894 declarator->declarator = NULL;
895 declarator->parameter_pack_p = false;
900 /* Make a declarator for a generalized identifier. If
901 QUALIFYING_SCOPE is non-NULL, the identifier is
902 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
903 UNQUALIFIED_NAME. SFK indicates the kind of special function this
906 static cp_declarator *
907 make_id_declarator (tree qualifying_scope, tree unqualified_name,
908 special_function_kind sfk)
910 cp_declarator *declarator;
912 /* It is valid to write:
914 class C { void f(); };
918 The standard is not clear about whether `typedef const C D' is
919 legal; as of 2002-09-15 the committee is considering that
920 question. EDG 3.0 allows that syntax. Therefore, we do as
922 if (qualifying_scope && TYPE_P (qualifying_scope))
923 qualifying_scope = TYPE_MAIN_VARIANT (qualifying_scope);
925 gcc_assert (TREE_CODE (unqualified_name) == IDENTIFIER_NODE
926 || TREE_CODE (unqualified_name) == BIT_NOT_EXPR
927 || TREE_CODE (unqualified_name) == TEMPLATE_ID_EXPR);
929 declarator = make_declarator (cdk_id);
930 declarator->u.id.qualifying_scope = qualifying_scope;
931 declarator->u.id.unqualified_name = unqualified_name;
932 declarator->u.id.sfk = sfk;
937 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
938 of modifiers such as const or volatile to apply to the pointer
939 type, represented as identifiers. */
942 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
944 cp_declarator *declarator;
946 declarator = make_declarator (cdk_pointer);
947 declarator->declarator = target;
948 declarator->u.pointer.qualifiers = cv_qualifiers;
949 declarator->u.pointer.class_type = NULL_TREE;
952 declarator->parameter_pack_p = target->parameter_pack_p;
953 target->parameter_pack_p = false;
956 declarator->parameter_pack_p = false;
961 /* Like make_pointer_declarator -- but for references. */
964 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target,
967 cp_declarator *declarator;
969 declarator = make_declarator (cdk_reference);
970 declarator->declarator = target;
971 declarator->u.reference.qualifiers = cv_qualifiers;
972 declarator->u.reference.rvalue_ref = rvalue_ref;
975 declarator->parameter_pack_p = target->parameter_pack_p;
976 target->parameter_pack_p = false;
979 declarator->parameter_pack_p = false;
984 /* Like make_pointer_declarator -- but for a pointer to a non-static
985 member of CLASS_TYPE. */
988 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
989 cp_declarator *pointee)
991 cp_declarator *declarator;
993 declarator = make_declarator (cdk_ptrmem);
994 declarator->declarator = pointee;
995 declarator->u.pointer.qualifiers = cv_qualifiers;
996 declarator->u.pointer.class_type = class_type;
1000 declarator->parameter_pack_p = pointee->parameter_pack_p;
1001 pointee->parameter_pack_p = false;
1004 declarator->parameter_pack_p = false;
1009 /* Make a declarator for the function given by TARGET, with the
1010 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1011 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1012 indicates what exceptions can be thrown. */
1015 make_call_declarator (cp_declarator *target,
1017 cp_cv_quals cv_qualifiers,
1018 tree exception_specification,
1019 tree late_return_type)
1021 cp_declarator *declarator;
1023 declarator = make_declarator (cdk_function);
1024 declarator->declarator = target;
1025 declarator->u.function.parameters = parms;
1026 declarator->u.function.qualifiers = cv_qualifiers;
1027 declarator->u.function.exception_specification = exception_specification;
1028 declarator->u.function.late_return_type = late_return_type;
1031 declarator->parameter_pack_p = target->parameter_pack_p;
1032 target->parameter_pack_p = false;
1035 declarator->parameter_pack_p = false;
1040 /* Make a declarator for an array of BOUNDS elements, each of which is
1041 defined by ELEMENT. */
1044 make_array_declarator (cp_declarator *element, tree bounds)
1046 cp_declarator *declarator;
1048 declarator = make_declarator (cdk_array);
1049 declarator->declarator = element;
1050 declarator->u.array.bounds = bounds;
1053 declarator->parameter_pack_p = element->parameter_pack_p;
1054 element->parameter_pack_p = false;
1057 declarator->parameter_pack_p = false;
1062 /* Determine whether the declarator we've seen so far can be a
1063 parameter pack, when followed by an ellipsis. */
1065 declarator_can_be_parameter_pack (cp_declarator *declarator)
1067 /* Search for a declarator name, or any other declarator that goes
1068 after the point where the ellipsis could appear in a parameter
1069 pack. If we find any of these, then this declarator can not be
1070 made into a parameter pack. */
1072 while (declarator && !found)
1074 switch ((int)declarator->kind)
1085 declarator = declarator->declarator;
1093 cp_parameter_declarator *no_parameters;
1095 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1096 DECLARATOR and DEFAULT_ARGUMENT. */
1098 cp_parameter_declarator *
1099 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
1100 cp_declarator *declarator,
1101 tree default_argument)
1103 cp_parameter_declarator *parameter;
1105 parameter = ((cp_parameter_declarator *)
1106 alloc_declarator (sizeof (cp_parameter_declarator)));
1107 parameter->next = NULL;
1108 if (decl_specifiers)
1109 parameter->decl_specifiers = *decl_specifiers;
1111 clear_decl_specs (¶meter->decl_specifiers);
1112 parameter->declarator = declarator;
1113 parameter->default_argument = default_argument;
1114 parameter->ellipsis_p = false;
1119 /* Returns true iff DECLARATOR is a declaration for a function. */
1122 function_declarator_p (const cp_declarator *declarator)
1126 if (declarator->kind == cdk_function
1127 && declarator->declarator->kind == cdk_id)
1129 if (declarator->kind == cdk_id
1130 || declarator->kind == cdk_error)
1132 declarator = declarator->declarator;
1142 A cp_parser parses the token stream as specified by the C++
1143 grammar. Its job is purely parsing, not semantic analysis. For
1144 example, the parser breaks the token stream into declarators,
1145 expressions, statements, and other similar syntactic constructs.
1146 It does not check that the types of the expressions on either side
1147 of an assignment-statement are compatible, or that a function is
1148 not declared with a parameter of type `void'.
1150 The parser invokes routines elsewhere in the compiler to perform
1151 semantic analysis and to build up the abstract syntax tree for the
1154 The parser (and the template instantiation code, which is, in a
1155 way, a close relative of parsing) are the only parts of the
1156 compiler that should be calling push_scope and pop_scope, or
1157 related functions. The parser (and template instantiation code)
1158 keeps track of what scope is presently active; everything else
1159 should simply honor that. (The code that generates static
1160 initializers may also need to set the scope, in order to check
1161 access control correctly when emitting the initializers.)
1166 The parser is of the standard recursive-descent variety. Upcoming
1167 tokens in the token stream are examined in order to determine which
1168 production to use when parsing a non-terminal. Some C++ constructs
1169 require arbitrary look ahead to disambiguate. For example, it is
1170 impossible, in the general case, to tell whether a statement is an
1171 expression or declaration without scanning the entire statement.
1172 Therefore, the parser is capable of "parsing tentatively." When the
1173 parser is not sure what construct comes next, it enters this mode.
1174 Then, while we attempt to parse the construct, the parser queues up
1175 error messages, rather than issuing them immediately, and saves the
1176 tokens it consumes. If the construct is parsed successfully, the
1177 parser "commits", i.e., it issues any queued error messages and
1178 the tokens that were being preserved are permanently discarded.
1179 If, however, the construct is not parsed successfully, the parser
1180 rolls back its state completely so that it can resume parsing using
1181 a different alternative.
1186 The performance of the parser could probably be improved substantially.
1187 We could often eliminate the need to parse tentatively by looking ahead
1188 a little bit. In some places, this approach might not entirely eliminate
1189 the need to parse tentatively, but it might still speed up the average
1192 /* Flags that are passed to some parsing functions. These values can
1193 be bitwise-ored together. */
1195 typedef enum cp_parser_flags
1198 CP_PARSER_FLAGS_NONE = 0x0,
1199 /* The construct is optional. If it is not present, then no error
1200 should be issued. */
1201 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1202 /* When parsing a type-specifier, do not allow user-defined types. */
1203 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
1206 /* The different kinds of declarators we want to parse. */
1208 typedef enum cp_parser_declarator_kind
1210 /* We want an abstract declarator. */
1211 CP_PARSER_DECLARATOR_ABSTRACT,
1212 /* We want a named declarator. */
1213 CP_PARSER_DECLARATOR_NAMED,
1214 /* We don't mind, but the name must be an unqualified-id. */
1215 CP_PARSER_DECLARATOR_EITHER
1216 } cp_parser_declarator_kind;
1218 /* The precedence values used to parse binary expressions. The minimum value
1219 of PREC must be 1, because zero is reserved to quickly discriminate
1220 binary operators from other tokens. */
1225 PREC_LOGICAL_OR_EXPRESSION,
1226 PREC_LOGICAL_AND_EXPRESSION,
1227 PREC_INCLUSIVE_OR_EXPRESSION,
1228 PREC_EXCLUSIVE_OR_EXPRESSION,
1229 PREC_AND_EXPRESSION,
1230 PREC_EQUALITY_EXPRESSION,
1231 PREC_RELATIONAL_EXPRESSION,
1232 PREC_SHIFT_EXPRESSION,
1233 PREC_ADDITIVE_EXPRESSION,
1234 PREC_MULTIPLICATIVE_EXPRESSION,
1236 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1239 /* A mapping from a token type to a corresponding tree node type, with a
1240 precedence value. */
1242 typedef struct cp_parser_binary_operations_map_node
1244 /* The token type. */
1245 enum cpp_ttype token_type;
1246 /* The corresponding tree code. */
1247 enum tree_code tree_type;
1248 /* The precedence of this operator. */
1249 enum cp_parser_prec prec;
1250 } cp_parser_binary_operations_map_node;
1252 /* The status of a tentative parse. */
1254 typedef enum cp_parser_status_kind
1256 /* No errors have occurred. */
1257 CP_PARSER_STATUS_KIND_NO_ERROR,
1258 /* An error has occurred. */
1259 CP_PARSER_STATUS_KIND_ERROR,
1260 /* We are committed to this tentative parse, whether or not an error
1262 CP_PARSER_STATUS_KIND_COMMITTED
1263 } cp_parser_status_kind;
1265 typedef struct cp_parser_expression_stack_entry
1267 /* Left hand side of the binary operation we are currently
1270 /* Original tree code for left hand side, if it was a binary
1271 expression itself (used for -Wparentheses). */
1272 enum tree_code lhs_type;
1273 /* Tree code for the binary operation we are parsing. */
1274 enum tree_code tree_type;
1275 /* Precedence of the binary operation we are parsing. */
1277 } cp_parser_expression_stack_entry;
1279 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1280 entries because precedence levels on the stack are monotonically
1282 typedef struct cp_parser_expression_stack_entry
1283 cp_parser_expression_stack[NUM_PREC_VALUES];
1285 /* Context that is saved and restored when parsing tentatively. */
1286 typedef struct cp_parser_context GTY (())
1288 /* If this is a tentative parsing context, the status of the
1290 enum cp_parser_status_kind status;
1291 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1292 that are looked up in this context must be looked up both in the
1293 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1294 the context of the containing expression. */
1297 /* The next parsing context in the stack. */
1298 struct cp_parser_context *next;
1299 } cp_parser_context;
1303 /* Constructors and destructors. */
1305 static cp_parser_context *cp_parser_context_new
1306 (cp_parser_context *);
1308 /* Class variables. */
1310 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1312 /* The operator-precedence table used by cp_parser_binary_expression.
1313 Transformed into an associative array (binops_by_token) by
1316 static const cp_parser_binary_operations_map_node binops[] = {
1317 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1318 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1320 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1321 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1322 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1324 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1325 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1327 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1328 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1330 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1331 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1332 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1333 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1335 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1336 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1338 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1340 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1342 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1344 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1346 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1349 /* The same as binops, but initialized by cp_parser_new so that
1350 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1352 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1354 /* Constructors and destructors. */
1356 /* Construct a new context. The context below this one on the stack
1357 is given by NEXT. */
1359 static cp_parser_context *
1360 cp_parser_context_new (cp_parser_context* next)
1362 cp_parser_context *context;
1364 /* Allocate the storage. */
1365 if (cp_parser_context_free_list != NULL)
1367 /* Pull the first entry from the free list. */
1368 context = cp_parser_context_free_list;
1369 cp_parser_context_free_list = context->next;
1370 memset (context, 0, sizeof (*context));
1373 context = GGC_CNEW (cp_parser_context);
1375 /* No errors have occurred yet in this context. */
1376 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1377 /* If this is not the bottommost context, copy information that we
1378 need from the previous context. */
1381 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1382 expression, then we are parsing one in this context, too. */
1383 context->object_type = next->object_type;
1384 /* Thread the stack. */
1385 context->next = next;
1391 /* The cp_parser structure represents the C++ parser. */
1393 typedef struct cp_parser GTY(())
1395 /* The lexer from which we are obtaining tokens. */
1398 /* The scope in which names should be looked up. If NULL_TREE, then
1399 we look up names in the scope that is currently open in the
1400 source program. If non-NULL, this is either a TYPE or
1401 NAMESPACE_DECL for the scope in which we should look. It can
1402 also be ERROR_MARK, when we've parsed a bogus scope.
1404 This value is not cleared automatically after a name is looked
1405 up, so we must be careful to clear it before starting a new look
1406 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1407 will look up `Z' in the scope of `X', rather than the current
1408 scope.) Unfortunately, it is difficult to tell when name lookup
1409 is complete, because we sometimes peek at a token, look it up,
1410 and then decide not to consume it. */
1413 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1414 last lookup took place. OBJECT_SCOPE is used if an expression
1415 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1416 respectively. QUALIFYING_SCOPE is used for an expression of the
1417 form "X::Y"; it refers to X. */
1419 tree qualifying_scope;
1421 /* A stack of parsing contexts. All but the bottom entry on the
1422 stack will be tentative contexts.
1424 We parse tentatively in order to determine which construct is in
1425 use in some situations. For example, in order to determine
1426 whether a statement is an expression-statement or a
1427 declaration-statement we parse it tentatively as a
1428 declaration-statement. If that fails, we then reparse the same
1429 token stream as an expression-statement. */
1430 cp_parser_context *context;
1432 /* True if we are parsing GNU C++. If this flag is not set, then
1433 GNU extensions are not recognized. */
1434 bool allow_gnu_extensions_p;
1436 /* TRUE if the `>' token should be interpreted as the greater-than
1437 operator. FALSE if it is the end of a template-id or
1438 template-parameter-list. In C++0x mode, this flag also applies to
1439 `>>' tokens, which are viewed as two consecutive `>' tokens when
1440 this flag is FALSE. */
1441 bool greater_than_is_operator_p;
1443 /* TRUE if default arguments are allowed within a parameter list
1444 that starts at this point. FALSE if only a gnu extension makes
1445 them permissible. */
1446 bool default_arg_ok_p;
1448 /* TRUE if we are parsing an integral constant-expression. See
1449 [expr.const] for a precise definition. */
1450 bool integral_constant_expression_p;
1452 /* TRUE if we are parsing an integral constant-expression -- but a
1453 non-constant expression should be permitted as well. This flag
1454 is used when parsing an array bound so that GNU variable-length
1455 arrays are tolerated. */
1456 bool allow_non_integral_constant_expression_p;
1458 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1459 been seen that makes the expression non-constant. */
1460 bool non_integral_constant_expression_p;
1462 /* TRUE if local variable names and `this' are forbidden in the
1464 bool local_variables_forbidden_p;
1466 /* TRUE if the declaration we are parsing is part of a
1467 linkage-specification of the form `extern string-literal
1469 bool in_unbraced_linkage_specification_p;
1471 /* TRUE if we are presently parsing a declarator, after the
1472 direct-declarator. */
1473 bool in_declarator_p;
1475 /* TRUE if we are presently parsing a template-argument-list. */
1476 bool in_template_argument_list_p;
1478 /* Set to IN_ITERATION_STMT if parsing an iteration-statement,
1479 to IN_OMP_BLOCK if parsing OpenMP structured block and
1480 IN_OMP_FOR if parsing OpenMP loop. If parsing a switch statement,
1481 this is bitwise ORed with IN_SWITCH_STMT, unless parsing an
1482 iteration-statement, OpenMP block or loop within that switch. */
1483 #define IN_SWITCH_STMT 1
1484 #define IN_ITERATION_STMT 2
1485 #define IN_OMP_BLOCK 4
1486 #define IN_OMP_FOR 8
1487 #define IN_IF_STMT 16
1488 unsigned char in_statement;
1490 /* TRUE if we are presently parsing the body of a switch statement.
1491 Note that this doesn't quite overlap with in_statement above.
1492 The difference relates to giving the right sets of error messages:
1493 "case not in switch" vs "break statement used with OpenMP...". */
1494 bool in_switch_statement_p;
1496 /* TRUE if we are parsing a type-id in an expression context. In
1497 such a situation, both "type (expr)" and "type (type)" are valid
1499 bool in_type_id_in_expr_p;
1501 /* TRUE if we are currently in a header file where declarations are
1502 implicitly extern "C". */
1503 bool implicit_extern_c;
1505 /* TRUE if strings in expressions should be translated to the execution
1507 bool translate_strings_p;
1509 /* TRUE if we are presently parsing the body of a function, but not
1511 bool in_function_body;
1513 /* If non-NULL, then we are parsing a construct where new type
1514 definitions are not permitted. The string stored here will be
1515 issued as an error message if a type is defined. */
1516 const char *type_definition_forbidden_message;
1518 /* A list of lists. The outer list is a stack, used for member
1519 functions of local classes. At each level there are two sub-list,
1520 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1521 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1522 TREE_VALUE's. The functions are chained in reverse declaration
1525 The TREE_PURPOSE sublist contains those functions with default
1526 arguments that need post processing, and the TREE_VALUE sublist
1527 contains those functions with definitions that need post
1530 These lists can only be processed once the outermost class being
1531 defined is complete. */
1532 tree unparsed_functions_queues;
1534 /* The number of classes whose definitions are currently in
1536 unsigned num_classes_being_defined;
1538 /* The number of template parameter lists that apply directly to the
1539 current declaration. */
1540 unsigned num_template_parameter_lists;
1545 /* Constructors and destructors. */
1547 static cp_parser *cp_parser_new
1550 /* Routines to parse various constructs.
1552 Those that return `tree' will return the error_mark_node (rather
1553 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1554 Sometimes, they will return an ordinary node if error-recovery was
1555 attempted, even though a parse error occurred. So, to check
1556 whether or not a parse error occurred, you should always use
1557 cp_parser_error_occurred. If the construct is optional (indicated
1558 either by an `_opt' in the name of the function that does the
1559 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1560 the construct is not present. */
1562 /* Lexical conventions [gram.lex] */
1564 static tree cp_parser_identifier
1566 static tree cp_parser_string_literal
1567 (cp_parser *, bool, bool);
1569 /* Basic concepts [gram.basic] */
1571 static bool cp_parser_translation_unit
1574 /* Expressions [gram.expr] */
1576 static tree cp_parser_primary_expression
1577 (cp_parser *, bool, bool, bool, cp_id_kind *);
1578 static tree cp_parser_id_expression
1579 (cp_parser *, bool, bool, bool *, bool, bool);
1580 static tree cp_parser_unqualified_id
1581 (cp_parser *, bool, bool, bool, bool);
1582 static tree cp_parser_nested_name_specifier_opt
1583 (cp_parser *, bool, bool, bool, bool);
1584 static tree cp_parser_nested_name_specifier
1585 (cp_parser *, bool, bool, bool, bool);
1586 static tree cp_parser_qualifying_entity
1587 (cp_parser *, bool, bool, bool, bool, bool);
1588 static tree cp_parser_postfix_expression
1589 (cp_parser *, bool, bool, bool);
1590 static tree cp_parser_postfix_open_square_expression
1591 (cp_parser *, tree, bool);
1592 static tree cp_parser_postfix_dot_deref_expression
1593 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *, location_t);
1594 static tree cp_parser_parenthesized_expression_list
1595 (cp_parser *, bool, bool, bool, bool *);
1596 static void cp_parser_pseudo_destructor_name
1597 (cp_parser *, tree *, tree *);
1598 static tree cp_parser_unary_expression
1599 (cp_parser *, bool, bool);
1600 static enum tree_code cp_parser_unary_operator
1602 static tree cp_parser_new_expression
1604 static tree cp_parser_new_placement
1606 static tree cp_parser_new_type_id
1607 (cp_parser *, tree *);
1608 static cp_declarator *cp_parser_new_declarator_opt
1610 static cp_declarator *cp_parser_direct_new_declarator
1612 static tree cp_parser_new_initializer
1614 static tree cp_parser_delete_expression
1616 static tree cp_parser_cast_expression
1617 (cp_parser *, bool, bool);
1618 static tree cp_parser_binary_expression
1619 (cp_parser *, bool, enum cp_parser_prec);
1620 static tree cp_parser_question_colon_clause
1621 (cp_parser *, tree);
1622 static tree cp_parser_assignment_expression
1623 (cp_parser *, bool);
1624 static enum tree_code cp_parser_assignment_operator_opt
1626 static tree cp_parser_expression
1627 (cp_parser *, bool);
1628 static tree cp_parser_constant_expression
1629 (cp_parser *, bool, bool *);
1630 static tree cp_parser_builtin_offsetof
1633 /* Statements [gram.stmt.stmt] */
1635 static void cp_parser_statement
1636 (cp_parser *, tree, bool, bool *);
1637 static void cp_parser_label_for_labeled_statement
1639 static tree cp_parser_expression_statement
1640 (cp_parser *, tree);
1641 static tree cp_parser_compound_statement
1642 (cp_parser *, tree, bool);
1643 static void cp_parser_statement_seq_opt
1644 (cp_parser *, tree);
1645 static tree cp_parser_selection_statement
1646 (cp_parser *, bool *);
1647 static tree cp_parser_condition
1649 static tree cp_parser_iteration_statement
1651 static void cp_parser_for_init_statement
1653 static tree cp_parser_jump_statement
1655 static void cp_parser_declaration_statement
1658 static tree cp_parser_implicitly_scoped_statement
1659 (cp_parser *, bool *);
1660 static void cp_parser_already_scoped_statement
1663 /* Declarations [gram.dcl.dcl] */
1665 static void cp_parser_declaration_seq_opt
1667 static void cp_parser_declaration
1669 static void cp_parser_block_declaration
1670 (cp_parser *, bool);
1671 static void cp_parser_simple_declaration
1672 (cp_parser *, bool);
1673 static void cp_parser_decl_specifier_seq
1674 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1675 static tree cp_parser_storage_class_specifier_opt
1677 static tree cp_parser_function_specifier_opt
1678 (cp_parser *, cp_decl_specifier_seq *);
1679 static tree cp_parser_type_specifier
1680 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1682 static tree cp_parser_simple_type_specifier
1683 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1684 static tree cp_parser_type_name
1686 static tree cp_parser_nonclass_name
1687 (cp_parser* parser);
1688 static tree cp_parser_elaborated_type_specifier
1689 (cp_parser *, bool, bool);
1690 static tree cp_parser_enum_specifier
1692 static void cp_parser_enumerator_list
1693 (cp_parser *, tree);
1694 static void cp_parser_enumerator_definition
1695 (cp_parser *, tree);
1696 static tree cp_parser_namespace_name
1698 static void cp_parser_namespace_definition
1700 static void cp_parser_namespace_body
1702 static tree cp_parser_qualified_namespace_specifier
1704 static void cp_parser_namespace_alias_definition
1706 static bool cp_parser_using_declaration
1707 (cp_parser *, bool);
1708 static void cp_parser_using_directive
1710 static void cp_parser_asm_definition
1712 static void cp_parser_linkage_specification
1714 static void cp_parser_static_assert
1715 (cp_parser *, bool);
1716 static tree cp_parser_decltype
1719 /* Declarators [gram.dcl.decl] */
1721 static tree cp_parser_init_declarator
1722 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *);
1723 static cp_declarator *cp_parser_declarator
1724 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1725 static cp_declarator *cp_parser_direct_declarator
1726 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1727 static enum tree_code cp_parser_ptr_operator
1728 (cp_parser *, tree *, cp_cv_quals *);
1729 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1731 static tree cp_parser_late_return_type_opt
1733 static tree cp_parser_declarator_id
1734 (cp_parser *, bool);
1735 static tree cp_parser_type_id
1737 static void cp_parser_type_specifier_seq
1738 (cp_parser *, bool, cp_decl_specifier_seq *);
1739 static tree cp_parser_parameter_declaration_clause
1741 static tree cp_parser_parameter_declaration_list
1742 (cp_parser *, bool *);
1743 static cp_parameter_declarator *cp_parser_parameter_declaration
1744 (cp_parser *, bool, bool *);
1745 static tree cp_parser_default_argument
1746 (cp_parser *, bool);
1747 static void cp_parser_function_body
1749 static tree cp_parser_initializer
1750 (cp_parser *, bool *, bool *);
1751 static tree cp_parser_initializer_clause
1752 (cp_parser *, bool *);
1753 static tree cp_parser_braced_list
1754 (cp_parser*, bool*);
1755 static VEC(constructor_elt,gc) *cp_parser_initializer_list
1756 (cp_parser *, bool *);
1758 static bool cp_parser_ctor_initializer_opt_and_function_body
1761 /* Classes [gram.class] */
1763 static tree cp_parser_class_name
1764 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1765 static tree cp_parser_class_specifier
1767 static tree cp_parser_class_head
1768 (cp_parser *, bool *, tree *, tree *);
1769 static enum tag_types cp_parser_class_key
1771 static void cp_parser_member_specification_opt
1773 static void cp_parser_member_declaration
1775 static tree cp_parser_pure_specifier
1777 static tree cp_parser_constant_initializer
1780 /* Derived classes [gram.class.derived] */
1782 static tree cp_parser_base_clause
1784 static tree cp_parser_base_specifier
1787 /* Special member functions [gram.special] */
1789 static tree cp_parser_conversion_function_id
1791 static tree cp_parser_conversion_type_id
1793 static cp_declarator *cp_parser_conversion_declarator_opt
1795 static bool cp_parser_ctor_initializer_opt
1797 static void cp_parser_mem_initializer_list
1799 static tree cp_parser_mem_initializer
1801 static tree cp_parser_mem_initializer_id
1804 /* Overloading [gram.over] */
1806 static tree cp_parser_operator_function_id
1808 static tree cp_parser_operator
1811 /* Templates [gram.temp] */
1813 static void cp_parser_template_declaration
1814 (cp_parser *, bool);
1815 static tree cp_parser_template_parameter_list
1817 static tree cp_parser_template_parameter
1818 (cp_parser *, bool *, bool *);
1819 static tree cp_parser_type_parameter
1820 (cp_parser *, bool *);
1821 static tree cp_parser_template_id
1822 (cp_parser *, bool, bool, bool);
1823 static tree cp_parser_template_name
1824 (cp_parser *, bool, bool, bool, bool *);
1825 static tree cp_parser_template_argument_list
1827 static tree cp_parser_template_argument
1829 static void cp_parser_explicit_instantiation
1831 static void cp_parser_explicit_specialization
1834 /* Exception handling [gram.exception] */
1836 static tree cp_parser_try_block
1838 static bool cp_parser_function_try_block
1840 static void cp_parser_handler_seq
1842 static void cp_parser_handler
1844 static tree cp_parser_exception_declaration
1846 static tree cp_parser_throw_expression
1848 static tree cp_parser_exception_specification_opt
1850 static tree cp_parser_type_id_list
1853 /* GNU Extensions */
1855 static tree cp_parser_asm_specification_opt
1857 static tree cp_parser_asm_operand_list
1859 static tree cp_parser_asm_clobber_list
1861 static tree cp_parser_attributes_opt
1863 static tree cp_parser_attribute_list
1865 static bool cp_parser_extension_opt
1866 (cp_parser *, int *);
1867 static void cp_parser_label_declaration
1870 enum pragma_context { pragma_external, pragma_stmt, pragma_compound };
1871 static bool cp_parser_pragma
1872 (cp_parser *, enum pragma_context);
1874 /* Objective-C++ Productions */
1876 static tree cp_parser_objc_message_receiver
1878 static tree cp_parser_objc_message_args
1880 static tree cp_parser_objc_message_expression
1882 static tree cp_parser_objc_encode_expression
1884 static tree cp_parser_objc_defs_expression
1886 static tree cp_parser_objc_protocol_expression
1888 static tree cp_parser_objc_selector_expression
1890 static tree cp_parser_objc_expression
1892 static bool cp_parser_objc_selector_p
1894 static tree cp_parser_objc_selector
1896 static tree cp_parser_objc_protocol_refs_opt
1898 static void cp_parser_objc_declaration
1900 static tree cp_parser_objc_statement
1903 /* Utility Routines */
1905 static tree cp_parser_lookup_name
1906 (cp_parser *, tree, enum tag_types, bool, bool, bool, tree *, location_t);
1907 static tree cp_parser_lookup_name_simple
1908 (cp_parser *, tree, location_t);
1909 static tree cp_parser_maybe_treat_template_as_class
1911 static bool cp_parser_check_declarator_template_parameters
1912 (cp_parser *, cp_declarator *, location_t);
1913 static bool cp_parser_check_template_parameters
1914 (cp_parser *, unsigned, location_t);
1915 static tree cp_parser_simple_cast_expression
1917 static tree cp_parser_global_scope_opt
1918 (cp_parser *, bool);
1919 static bool cp_parser_constructor_declarator_p
1920 (cp_parser *, bool);
1921 static tree cp_parser_function_definition_from_specifiers_and_declarator
1922 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1923 static tree cp_parser_function_definition_after_declarator
1924 (cp_parser *, bool);
1925 static void cp_parser_template_declaration_after_export
1926 (cp_parser *, bool);
1927 static void cp_parser_perform_template_parameter_access_checks
1928 (VEC (deferred_access_check,gc)*);
1929 static tree cp_parser_single_declaration
1930 (cp_parser *, VEC (deferred_access_check,gc)*, bool, bool, bool *);
1931 static tree cp_parser_functional_cast
1932 (cp_parser *, tree);
1933 static tree cp_parser_save_member_function_body
1934 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1935 static tree cp_parser_enclosed_template_argument_list
1937 static void cp_parser_save_default_args
1938 (cp_parser *, tree);
1939 static void cp_parser_late_parsing_for_member
1940 (cp_parser *, tree);
1941 static void cp_parser_late_parsing_default_args
1942 (cp_parser *, tree);
1943 static tree cp_parser_sizeof_operand
1944 (cp_parser *, enum rid);
1945 static tree cp_parser_trait_expr
1946 (cp_parser *, enum rid);
1947 static bool cp_parser_declares_only_class_p
1949 static void cp_parser_set_storage_class
1950 (cp_parser *, cp_decl_specifier_seq *, enum rid, location_t);
1951 static void cp_parser_set_decl_spec_type
1952 (cp_decl_specifier_seq *, tree, location_t, bool);
1953 static bool cp_parser_friend_p
1954 (const cp_decl_specifier_seq *);
1955 static cp_token *cp_parser_require
1956 (cp_parser *, enum cpp_ttype, const char *);
1957 static cp_token *cp_parser_require_keyword
1958 (cp_parser *, enum rid, const char *);
1959 static bool cp_parser_token_starts_function_definition_p
1961 static bool cp_parser_next_token_starts_class_definition_p
1963 static bool cp_parser_next_token_ends_template_argument_p
1965 static bool cp_parser_nth_token_starts_template_argument_list_p
1966 (cp_parser *, size_t);
1967 static enum tag_types cp_parser_token_is_class_key
1969 static void cp_parser_check_class_key
1970 (enum tag_types, tree type);
1971 static void cp_parser_check_access_in_redeclaration
1972 (tree type, location_t location);
1973 static bool cp_parser_optional_template_keyword
1975 static void cp_parser_pre_parsed_nested_name_specifier
1977 static bool cp_parser_cache_group
1978 (cp_parser *, enum cpp_ttype, unsigned);
1979 static void cp_parser_parse_tentatively
1981 static void cp_parser_commit_to_tentative_parse
1983 static void cp_parser_abort_tentative_parse
1985 static bool cp_parser_parse_definitely
1987 static inline bool cp_parser_parsing_tentatively
1989 static bool cp_parser_uncommitted_to_tentative_parse_p
1991 static void cp_parser_error
1992 (cp_parser *, const char *);
1993 static void cp_parser_name_lookup_error
1994 (cp_parser *, tree, tree, const char *, location_t);
1995 static bool cp_parser_simulate_error
1997 static bool cp_parser_check_type_definition
1999 static void cp_parser_check_for_definition_in_return_type
2000 (cp_declarator *, tree, location_t type_location);
2001 static void cp_parser_check_for_invalid_template_id
2002 (cp_parser *, tree, location_t location);
2003 static bool cp_parser_non_integral_constant_expression
2004 (cp_parser *, const char *);
2005 static void cp_parser_diagnose_invalid_type_name
2006 (cp_parser *, tree, tree, location_t);
2007 static bool cp_parser_parse_and_diagnose_invalid_type_name
2009 static int cp_parser_skip_to_closing_parenthesis
2010 (cp_parser *, bool, bool, bool);
2011 static void cp_parser_skip_to_end_of_statement
2013 static void cp_parser_consume_semicolon_at_end_of_statement
2015 static void cp_parser_skip_to_end_of_block_or_statement
2017 static bool cp_parser_skip_to_closing_brace
2019 static void cp_parser_skip_to_end_of_template_parameter_list
2021 static void cp_parser_skip_to_pragma_eol
2022 (cp_parser*, cp_token *);
2023 static bool cp_parser_error_occurred
2025 static bool cp_parser_allow_gnu_extensions_p
2027 static bool cp_parser_is_string_literal
2029 static bool cp_parser_is_keyword
2030 (cp_token *, enum rid);
2031 static tree cp_parser_make_typename_type
2032 (cp_parser *, tree, tree, location_t location);
2033 static cp_declarator * cp_parser_make_indirect_declarator
2034 (enum tree_code, tree, cp_cv_quals, cp_declarator *);
2036 /* Returns nonzero if we are parsing tentatively. */
2039 cp_parser_parsing_tentatively (cp_parser* parser)
2041 return parser->context->next != NULL;
2044 /* Returns nonzero if TOKEN is a string literal. */
2047 cp_parser_is_string_literal (cp_token* token)
2049 return (token->type == CPP_STRING ||
2050 token->type == CPP_STRING16 ||
2051 token->type == CPP_STRING32 ||
2052 token->type == CPP_WSTRING);
2055 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2058 cp_parser_is_keyword (cp_token* token, enum rid keyword)
2060 return token->keyword == keyword;
2063 /* If not parsing tentatively, issue a diagnostic of the form
2064 FILE:LINE: MESSAGE before TOKEN
2065 where TOKEN is the next token in the input stream. MESSAGE
2066 (specified by the caller) is usually of the form "expected
2070 cp_parser_error (cp_parser* parser, const char* message)
2072 if (!cp_parser_simulate_error (parser))
2074 cp_token *token = cp_lexer_peek_token (parser->lexer);
2075 /* This diagnostic makes more sense if it is tagged to the line
2076 of the token we just peeked at. */
2077 cp_lexer_set_source_position_from_token (token);
2079 if (token->type == CPP_PRAGMA)
2081 error ("%H%<#pragma%> is not allowed here", &token->location);
2082 cp_parser_skip_to_pragma_eol (parser, token);
2086 c_parse_error (message,
2087 /* Because c_parser_error does not understand
2088 CPP_KEYWORD, keywords are treated like
2090 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
2095 /* Issue an error about name-lookup failing. NAME is the
2096 IDENTIFIER_NODE DECL is the result of
2097 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2098 the thing that we hoped to find. */
2101 cp_parser_name_lookup_error (cp_parser* parser,
2104 const char* desired,
2105 location_t location)
2107 /* If name lookup completely failed, tell the user that NAME was not
2109 if (decl == error_mark_node)
2111 if (parser->scope && parser->scope != global_namespace)
2112 error ("%H%<%E::%E%> has not been declared",
2113 &location, parser->scope, name);
2114 else if (parser->scope == global_namespace)
2115 error ("%H%<::%E%> has not been declared", &location, name);
2116 else if (parser->object_scope
2117 && !CLASS_TYPE_P (parser->object_scope))
2118 error ("%Hrequest for member %qE in non-class type %qT",
2119 &location, name, parser->object_scope);
2120 else if (parser->object_scope)
2121 error ("%H%<%T::%E%> has not been declared",
2122 &location, parser->object_scope, name);
2124 error ("%H%qE has not been declared", &location, name);
2126 else if (parser->scope && parser->scope != global_namespace)
2127 error ("%H%<%E::%E%> %s", &location, parser->scope, name, desired);
2128 else if (parser->scope == global_namespace)
2129 error ("%H%<::%E%> %s", &location, name, desired);
2131 error ("%H%qE %s", &location, name, desired);
2134 /* If we are parsing tentatively, remember that an error has occurred
2135 during this tentative parse. Returns true if the error was
2136 simulated; false if a message should be issued by the caller. */
2139 cp_parser_simulate_error (cp_parser* parser)
2141 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2143 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2149 /* Check for repeated decl-specifiers. */
2152 cp_parser_check_decl_spec (cp_decl_specifier_seq *decl_specs,
2153 location_t location)
2157 for (ds = ds_first; ds != ds_last; ++ds)
2159 unsigned count = decl_specs->specs[(int)ds];
2162 /* The "long" specifier is a special case because of "long long". */
2166 error ("%H%<long long long%> is too long for GCC", &location);
2167 else if (pedantic && !in_system_header && warn_long_long
2168 && cxx_dialect == cxx98)
2169 pedwarn (location, OPT_Wlong_long,
2170 "ISO C++ 1998 does not support %<long long%>");
2174 static const char *const decl_spec_names[] = {
2190 error ("%Hduplicate %qs", &location, decl_spec_names[(int)ds]);
2195 /* This function is called when a type is defined. If type
2196 definitions are forbidden at this point, an error message is
2200 cp_parser_check_type_definition (cp_parser* parser)
2202 /* If types are forbidden here, issue a message. */
2203 if (parser->type_definition_forbidden_message)
2205 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2206 in the message need to be interpreted. */
2207 error (parser->type_definition_forbidden_message);
2213 /* This function is called when the DECLARATOR is processed. The TYPE
2214 was a type defined in the decl-specifiers. If it is invalid to
2215 define a type in the decl-specifiers for DECLARATOR, an error is
2216 issued. TYPE_LOCATION is the location of TYPE and is used
2217 for error reporting. */
2220 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2221 tree type, location_t type_location)
2223 /* [dcl.fct] forbids type definitions in return types.
2224 Unfortunately, it's not easy to know whether or not we are
2225 processing a return type until after the fact. */
2227 && (declarator->kind == cdk_pointer
2228 || declarator->kind == cdk_reference
2229 || declarator->kind == cdk_ptrmem))
2230 declarator = declarator->declarator;
2232 && declarator->kind == cdk_function)
2234 error ("%Hnew types may not be defined in a return type", &type_location);
2235 inform (type_location,
2236 "(perhaps a semicolon is missing after the definition of %qT)",
2241 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2242 "<" in any valid C++ program. If the next token is indeed "<",
2243 issue a message warning the user about what appears to be an
2244 invalid attempt to form a template-id. LOCATION is the location
2245 of the type-specifier (TYPE) */
2248 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2249 tree type, location_t location)
2251 cp_token_position start = 0;
2253 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2256 error ("%H%qT is not a template", &location, type);
2257 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2258 error ("%H%qE is not a template", &location, type);
2260 error ("%Hinvalid template-id", &location);
2261 /* Remember the location of the invalid "<". */
2262 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2263 start = cp_lexer_token_position (parser->lexer, true);
2264 /* Consume the "<". */
2265 cp_lexer_consume_token (parser->lexer);
2266 /* Parse the template arguments. */
2267 cp_parser_enclosed_template_argument_list (parser);
2268 /* Permanently remove the invalid template arguments so that
2269 this error message is not issued again. */
2271 cp_lexer_purge_tokens_after (parser->lexer, start);
2275 /* If parsing an integral constant-expression, issue an error message
2276 about the fact that THING appeared and return true. Otherwise,
2277 return false. In either case, set
2278 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2281 cp_parser_non_integral_constant_expression (cp_parser *parser,
2284 parser->non_integral_constant_expression_p = true;
2285 if (parser->integral_constant_expression_p)
2287 if (!parser->allow_non_integral_constant_expression_p)
2289 /* Don't use `%s' to print THING, because quotations (`%<', `%>')
2290 in the message need to be interpreted. */
2291 char *message = concat (thing,
2292 " cannot appear in a constant-expression",
2302 /* Emit a diagnostic for an invalid type name. SCOPE is the
2303 qualifying scope (or NULL, if none) for ID. This function commits
2304 to the current active tentative parse, if any. (Otherwise, the
2305 problematic construct might be encountered again later, resulting
2306 in duplicate error messages.) LOCATION is the location of ID. */
2309 cp_parser_diagnose_invalid_type_name (cp_parser *parser,
2310 tree scope, tree id,
2311 location_t location)
2313 tree decl, old_scope;
2314 /* Try to lookup the identifier. */
2315 old_scope = parser->scope;
2316 parser->scope = scope;
2317 decl = cp_parser_lookup_name_simple (parser, id, location);
2318 parser->scope = old_scope;
2319 /* If the lookup found a template-name, it means that the user forgot
2320 to specify an argument list. Emit a useful error message. */
2321 if (TREE_CODE (decl) == TEMPLATE_DECL)
2322 error ("%Hinvalid use of template-name %qE without an argument list",
2324 else if (TREE_CODE (id) == BIT_NOT_EXPR)
2325 error ("%Hinvalid use of destructor %qD as a type", &location, id);
2326 else if (TREE_CODE (decl) == TYPE_DECL)
2327 /* Something like 'unsigned A a;' */
2328 error ("%Hinvalid combination of multiple type-specifiers",
2330 else if (!parser->scope)
2332 /* Issue an error message. */
2333 error ("%H%qE does not name a type", &location, id);
2334 /* If we're in a template class, it's possible that the user was
2335 referring to a type from a base class. For example:
2337 template <typename T> struct A { typedef T X; };
2338 template <typename T> struct B : public A<T> { X x; };
2340 The user should have said "typename A<T>::X". */
2341 if (processing_template_decl && current_class_type
2342 && TYPE_BINFO (current_class_type))
2346 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2350 tree base_type = BINFO_TYPE (b);
2351 if (CLASS_TYPE_P (base_type)
2352 && dependent_type_p (base_type))
2355 /* Go from a particular instantiation of the
2356 template (which will have an empty TYPE_FIELDs),
2357 to the main version. */
2358 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2359 for (field = TYPE_FIELDS (base_type);
2361 field = TREE_CHAIN (field))
2362 if (TREE_CODE (field) == TYPE_DECL
2363 && DECL_NAME (field) == id)
2366 "(perhaps %<typename %T::%E%> was intended)",
2367 BINFO_TYPE (b), id);
2376 /* Here we diagnose qualified-ids where the scope is actually correct,
2377 but the identifier does not resolve to a valid type name. */
2378 else if (parser->scope != error_mark_node)
2380 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2381 error ("%H%qE in namespace %qE does not name a type",
2382 &location, id, parser->scope);
2383 else if (TYPE_P (parser->scope))
2384 error ("%H%qE in class %qT does not name a type",
2385 &location, id, parser->scope);
2389 cp_parser_commit_to_tentative_parse (parser);
2392 /* Check for a common situation where a type-name should be present,
2393 but is not, and issue a sensible error message. Returns true if an
2394 invalid type-name was detected.
2396 The situation handled by this function are variable declarations of the
2397 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2398 Usually, `ID' should name a type, but if we got here it means that it
2399 does not. We try to emit the best possible error message depending on
2400 how exactly the id-expression looks like. */
2403 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2406 cp_token *token = cp_lexer_peek_token (parser->lexer);
2408 cp_parser_parse_tentatively (parser);
2409 id = cp_parser_id_expression (parser,
2410 /*template_keyword_p=*/false,
2411 /*check_dependency_p=*/true,
2412 /*template_p=*/NULL,
2413 /*declarator_p=*/true,
2414 /*optional_p=*/false);
2415 /* After the id-expression, there should be a plain identifier,
2416 otherwise this is not a simple variable declaration. Also, if
2417 the scope is dependent, we cannot do much. */
2418 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2419 || (parser->scope && TYPE_P (parser->scope)
2420 && dependent_type_p (parser->scope))
2421 || TREE_CODE (id) == TYPE_DECL)
2423 cp_parser_abort_tentative_parse (parser);
2426 if (!cp_parser_parse_definitely (parser))
2429 /* Emit a diagnostic for the invalid type. */
2430 cp_parser_diagnose_invalid_type_name (parser, parser->scope,
2431 id, token->location);
2432 /* Skip to the end of the declaration; there's no point in
2433 trying to process it. */
2434 cp_parser_skip_to_end_of_block_or_statement (parser);
2438 /* Consume tokens up to, and including, the next non-nested closing `)'.
2439 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2440 are doing error recovery. Returns -1 if OR_COMMA is true and we
2441 found an unnested comma. */
2444 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2449 unsigned paren_depth = 0;
2450 unsigned brace_depth = 0;
2452 if (recovering && !or_comma
2453 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2458 cp_token * token = cp_lexer_peek_token (parser->lexer);
2460 switch (token->type)
2463 case CPP_PRAGMA_EOL:
2464 /* If we've run out of tokens, then there is no closing `)'. */
2468 /* This matches the processing in skip_to_end_of_statement. */
2473 case CPP_OPEN_BRACE:
2476 case CPP_CLOSE_BRACE:
2482 if (recovering && or_comma && !brace_depth && !paren_depth)
2486 case CPP_OPEN_PAREN:
2491 case CPP_CLOSE_PAREN:
2492 if (!brace_depth && !paren_depth--)
2495 cp_lexer_consume_token (parser->lexer);
2504 /* Consume the token. */
2505 cp_lexer_consume_token (parser->lexer);
2509 /* Consume tokens until we reach the end of the current statement.
2510 Normally, that will be just before consuming a `;'. However, if a
2511 non-nested `}' comes first, then we stop before consuming that. */
2514 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2516 unsigned nesting_depth = 0;
2520 cp_token *token = cp_lexer_peek_token (parser->lexer);
2522 switch (token->type)
2525 case CPP_PRAGMA_EOL:
2526 /* If we've run out of tokens, stop. */
2530 /* If the next token is a `;', we have reached the end of the
2536 case CPP_CLOSE_BRACE:
2537 /* If this is a non-nested '}', stop before consuming it.
2538 That way, when confronted with something like:
2542 we stop before consuming the closing '}', even though we
2543 have not yet reached a `;'. */
2544 if (nesting_depth == 0)
2547 /* If it is the closing '}' for a block that we have
2548 scanned, stop -- but only after consuming the token.
2554 we will stop after the body of the erroneously declared
2555 function, but before consuming the following `typedef'
2557 if (--nesting_depth == 0)
2559 cp_lexer_consume_token (parser->lexer);
2563 case CPP_OPEN_BRACE:
2571 /* Consume the token. */
2572 cp_lexer_consume_token (parser->lexer);
2576 /* This function is called at the end of a statement or declaration.
2577 If the next token is a semicolon, it is consumed; otherwise, error
2578 recovery is attempted. */
2581 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2583 /* Look for the trailing `;'. */
2584 if (!cp_parser_require (parser, CPP_SEMICOLON, "%<;%>"))
2586 /* If there is additional (erroneous) input, skip to the end of
2588 cp_parser_skip_to_end_of_statement (parser);
2589 /* If the next token is now a `;', consume it. */
2590 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2591 cp_lexer_consume_token (parser->lexer);
2595 /* Skip tokens until we have consumed an entire block, or until we
2596 have consumed a non-nested `;'. */
2599 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2601 int nesting_depth = 0;
2603 while (nesting_depth >= 0)
2605 cp_token *token = cp_lexer_peek_token (parser->lexer);
2607 switch (token->type)
2610 case CPP_PRAGMA_EOL:
2611 /* If we've run out of tokens, stop. */
2615 /* Stop if this is an unnested ';'. */
2620 case CPP_CLOSE_BRACE:
2621 /* Stop if this is an unnested '}', or closes the outermost
2628 case CPP_OPEN_BRACE:
2637 /* Consume the token. */
2638 cp_lexer_consume_token (parser->lexer);
2642 /* Skip tokens until a non-nested closing curly brace is the next
2643 token, or there are no more tokens. Return true in the first case,
2647 cp_parser_skip_to_closing_brace (cp_parser *parser)
2649 unsigned nesting_depth = 0;
2653 cp_token *token = cp_lexer_peek_token (parser->lexer);
2655 switch (token->type)
2658 case CPP_PRAGMA_EOL:
2659 /* If we've run out of tokens, stop. */
2662 case CPP_CLOSE_BRACE:
2663 /* If the next token is a non-nested `}', then we have reached
2664 the end of the current block. */
2665 if (nesting_depth-- == 0)
2669 case CPP_OPEN_BRACE:
2670 /* If it the next token is a `{', then we are entering a new
2671 block. Consume the entire block. */
2679 /* Consume the token. */
2680 cp_lexer_consume_token (parser->lexer);
2684 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
2685 parameter is the PRAGMA token, allowing us to purge the entire pragma
2689 cp_parser_skip_to_pragma_eol (cp_parser* parser, cp_token *pragma_tok)
2693 parser->lexer->in_pragma = false;
2696 token = cp_lexer_consume_token (parser->lexer);
2697 while (token->type != CPP_PRAGMA_EOL && token->type != CPP_EOF);
2699 /* Ensure that the pragma is not parsed again. */
2700 cp_lexer_purge_tokens_after (parser->lexer, pragma_tok);
2703 /* Require pragma end of line, resyncing with it as necessary. The
2704 arguments are as for cp_parser_skip_to_pragma_eol. */
2707 cp_parser_require_pragma_eol (cp_parser *parser, cp_token *pragma_tok)
2709 parser->lexer->in_pragma = false;
2710 if (!cp_parser_require (parser, CPP_PRAGMA_EOL, "end of line"))
2711 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
2714 /* This is a simple wrapper around make_typename_type. When the id is
2715 an unresolved identifier node, we can provide a superior diagnostic
2716 using cp_parser_diagnose_invalid_type_name. */
2719 cp_parser_make_typename_type (cp_parser *parser, tree scope,
2720 tree id, location_t id_location)
2723 if (TREE_CODE (id) == IDENTIFIER_NODE)
2725 result = make_typename_type (scope, id, typename_type,
2726 /*complain=*/tf_none);
2727 if (result == error_mark_node)
2728 cp_parser_diagnose_invalid_type_name (parser, scope, id, id_location);
2731 return make_typename_type (scope, id, typename_type, tf_error);
2734 /* This is a wrapper around the
2735 make_{pointer,ptrmem,reference}_declarator functions that decides
2736 which one to call based on the CODE and CLASS_TYPE arguments. The
2737 CODE argument should be one of the values returned by
2738 cp_parser_ptr_operator. */
2739 static cp_declarator *
2740 cp_parser_make_indirect_declarator (enum tree_code code, tree class_type,
2741 cp_cv_quals cv_qualifiers,
2742 cp_declarator *target)
2744 if (code == ERROR_MARK)
2745 return cp_error_declarator;
2747 if (code == INDIRECT_REF)
2748 if (class_type == NULL_TREE)
2749 return make_pointer_declarator (cv_qualifiers, target);
2751 return make_ptrmem_declarator (cv_qualifiers, class_type, target);
2752 else if (code == ADDR_EXPR && class_type == NULL_TREE)
2753 return make_reference_declarator (cv_qualifiers, target, false);
2754 else if (code == NON_LVALUE_EXPR && class_type == NULL_TREE)
2755 return make_reference_declarator (cv_qualifiers, target, true);
2759 /* Create a new C++ parser. */
2762 cp_parser_new (void)
2768 /* cp_lexer_new_main is called before calling ggc_alloc because
2769 cp_lexer_new_main might load a PCH file. */
2770 lexer = cp_lexer_new_main ();
2772 /* Initialize the binops_by_token so that we can get the tree
2773 directly from the token. */
2774 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2775 binops_by_token[binops[i].token_type] = binops[i];
2777 parser = GGC_CNEW (cp_parser);
2778 parser->lexer = lexer;
2779 parser->context = cp_parser_context_new (NULL);
2781 /* For now, we always accept GNU extensions. */
2782 parser->allow_gnu_extensions_p = 1;
2784 /* The `>' token is a greater-than operator, not the end of a
2786 parser->greater_than_is_operator_p = true;
2788 parser->default_arg_ok_p = true;
2790 /* We are not parsing a constant-expression. */
2791 parser->integral_constant_expression_p = false;
2792 parser->allow_non_integral_constant_expression_p = false;
2793 parser->non_integral_constant_expression_p = false;
2795 /* Local variable names are not forbidden. */
2796 parser->local_variables_forbidden_p = false;
2798 /* We are not processing an `extern "C"' declaration. */
2799 parser->in_unbraced_linkage_specification_p = false;
2801 /* We are not processing a declarator. */
2802 parser->in_declarator_p = false;
2804 /* We are not processing a template-argument-list. */
2805 parser->in_template_argument_list_p = false;
2807 /* We are not in an iteration statement. */
2808 parser->in_statement = 0;
2810 /* We are not in a switch statement. */
2811 parser->in_switch_statement_p = false;
2813 /* We are not parsing a type-id inside an expression. */
2814 parser->in_type_id_in_expr_p = false;
2816 /* Declarations aren't implicitly extern "C". */
2817 parser->implicit_extern_c = false;
2819 /* String literals should be translated to the execution character set. */
2820 parser->translate_strings_p = true;
2822 /* We are not parsing a function body. */
2823 parser->in_function_body = false;
2825 /* The unparsed function queue is empty. */
2826 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2828 /* There are no classes being defined. */
2829 parser->num_classes_being_defined = 0;
2831 /* No template parameters apply. */
2832 parser->num_template_parameter_lists = 0;
2837 /* Create a cp_lexer structure which will emit the tokens in CACHE
2838 and push it onto the parser's lexer stack. This is used for delayed
2839 parsing of in-class method bodies and default arguments, and should
2840 not be confused with tentative parsing. */
2842 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
2844 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
2845 lexer->next = parser->lexer;
2846 parser->lexer = lexer;
2848 /* Move the current source position to that of the first token in the
2850 cp_lexer_set_source_position_from_token (lexer->next_token);
2853 /* Pop the top lexer off the parser stack. This is never used for the
2854 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2856 cp_parser_pop_lexer (cp_parser *parser)
2858 cp_lexer *lexer = parser->lexer;
2859 parser->lexer = lexer->next;
2860 cp_lexer_destroy (lexer);
2862 /* Put the current source position back where it was before this
2863 lexer was pushed. */
2864 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
2867 /* Lexical conventions [gram.lex] */
2869 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2873 cp_parser_identifier (cp_parser* parser)
2877 /* Look for the identifier. */
2878 token = cp_parser_require (parser, CPP_NAME, "identifier");
2879 /* Return the value. */
2880 return token ? token->u.value : error_mark_node;
2883 /* Parse a sequence of adjacent string constants. Returns a
2884 TREE_STRING representing the combined, nul-terminated string
2885 constant. If TRANSLATE is true, translate the string to the
2886 execution character set. If WIDE_OK is true, a wide string is
2889 C++98 [lex.string] says that if a narrow string literal token is
2890 adjacent to a wide string literal token, the behavior is undefined.
2891 However, C99 6.4.5p4 says that this results in a wide string literal.
2892 We follow C99 here, for consistency with the C front end.
2894 This code is largely lifted from lex_string() in c-lex.c.
2896 FUTURE: ObjC++ will need to handle @-strings here. */
2898 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
2902 struct obstack str_ob;
2903 cpp_string str, istr, *strs;
2905 enum cpp_ttype type;
2907 tok = cp_lexer_peek_token (parser->lexer);
2908 if (!cp_parser_is_string_literal (tok))
2910 cp_parser_error (parser, "expected string-literal");
2911 return error_mark_node;
2916 /* Try to avoid the overhead of creating and destroying an obstack
2917 for the common case of just one string. */
2918 if (!cp_parser_is_string_literal
2919 (cp_lexer_peek_nth_token (parser->lexer, 2)))
2921 cp_lexer_consume_token (parser->lexer);
2923 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->u.value);
2924 str.len = TREE_STRING_LENGTH (tok->u.value);
2931 gcc_obstack_init (&str_ob);
2936 cp_lexer_consume_token (parser->lexer);
2938 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->u.value);
2939 str.len = TREE_STRING_LENGTH (tok->u.value);
2941 if (type != tok->type)
2943 if (type == CPP_STRING)
2945 else if (tok->type != CPP_STRING)
2946 error ("%Hunsupported non-standard concatenation "
2947 "of string literals", &tok->location);
2950 obstack_grow (&str_ob, &str, sizeof (cpp_string));
2952 tok = cp_lexer_peek_token (parser->lexer);
2954 while (cp_parser_is_string_literal (tok));
2956 strs = (cpp_string *) obstack_finish (&str_ob);
2959 if (type != CPP_STRING && !wide_ok)
2961 cp_parser_error (parser, "a wide string is invalid in this context");
2965 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
2966 (parse_in, strs, count, &istr, type))
2968 value = build_string (istr.len, (const char *)istr.text);
2969 free (CONST_CAST (unsigned char *, istr.text));
2975 TREE_TYPE (value) = char_array_type_node;
2978 TREE_TYPE (value) = char16_array_type_node;
2981 TREE_TYPE (value) = char32_array_type_node;
2984 TREE_TYPE (value) = wchar_array_type_node;
2988 value = fix_string_type (value);
2991 /* cpp_interpret_string has issued an error. */
2992 value = error_mark_node;
2995 obstack_free (&str_ob, 0);
3001 /* Basic concepts [gram.basic] */
3003 /* Parse a translation-unit.
3006 declaration-seq [opt]
3008 Returns TRUE if all went well. */
3011 cp_parser_translation_unit (cp_parser* parser)
3013 /* The address of the first non-permanent object on the declarator
3015 static void *declarator_obstack_base;
3019 /* Create the declarator obstack, if necessary. */
3020 if (!cp_error_declarator)
3022 gcc_obstack_init (&declarator_obstack);
3023 /* Create the error declarator. */
3024 cp_error_declarator = make_declarator (cdk_error);
3025 /* Create the empty parameter list. */
3026 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
3027 /* Remember where the base of the declarator obstack lies. */
3028 declarator_obstack_base = obstack_next_free (&declarator_obstack);
3031 cp_parser_declaration_seq_opt (parser);
3033 /* If there are no tokens left then all went well. */
3034 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
3036 /* Get rid of the token array; we don't need it any more. */
3037 cp_lexer_destroy (parser->lexer);
3038 parser->lexer = NULL;
3040 /* This file might have been a context that's implicitly extern
3041 "C". If so, pop the lang context. (Only relevant for PCH.) */
3042 if (parser->implicit_extern_c)
3044 pop_lang_context ();
3045 parser->implicit_extern_c = false;
3049 finish_translation_unit ();
3055 cp_parser_error (parser, "expected declaration");
3059 /* Make sure the declarator obstack was fully cleaned up. */
3060 gcc_assert (obstack_next_free (&declarator_obstack)
3061 == declarator_obstack_base);
3063 /* All went well. */
3067 /* Expressions [gram.expr] */
3069 /* Parse a primary-expression.
3080 ( compound-statement )
3081 __builtin_va_arg ( assignment-expression , type-id )
3082 __builtin_offsetof ( type-id , offsetof-expression )
3085 __has_nothrow_assign ( type-id )
3086 __has_nothrow_constructor ( type-id )
3087 __has_nothrow_copy ( type-id )
3088 __has_trivial_assign ( type-id )
3089 __has_trivial_constructor ( type-id )
3090 __has_trivial_copy ( type-id )
3091 __has_trivial_destructor ( type-id )
3092 __has_virtual_destructor ( type-id )
3093 __is_abstract ( type-id )
3094 __is_base_of ( type-id , type-id )
3095 __is_class ( type-id )
3096 __is_convertible_to ( type-id , type-id )
3097 __is_empty ( type-id )
3098 __is_enum ( type-id )
3099 __is_pod ( type-id )
3100 __is_polymorphic ( type-id )
3101 __is_union ( type-id )
3103 Objective-C++ Extension:
3111 ADDRESS_P is true iff this expression was immediately preceded by
3112 "&" and therefore might denote a pointer-to-member. CAST_P is true
3113 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3114 true iff this expression is a template argument.
3116 Returns a representation of the expression. Upon return, *IDK
3117 indicates what kind of id-expression (if any) was present. */
3120 cp_parser_primary_expression (cp_parser *parser,
3123 bool template_arg_p,
3126 cp_token *token = NULL;
3128 /* Assume the primary expression is not an id-expression. */
3129 *idk = CP_ID_KIND_NONE;
3131 /* Peek at the next token. */
3132 token = cp_lexer_peek_token (parser->lexer);
3133 switch (token->type)
3146 token = cp_lexer_consume_token (parser->lexer);
3147 /* Floating-point literals are only allowed in an integral
3148 constant expression if they are cast to an integral or
3149 enumeration type. */
3150 if (TREE_CODE (token->u.value) == REAL_CST
3151 && parser->integral_constant_expression_p
3154 /* CAST_P will be set even in invalid code like "int(2.7 +
3155 ...)". Therefore, we have to check that the next token
3156 is sure to end the cast. */
3159 cp_token *next_token;
3161 next_token = cp_lexer_peek_token (parser->lexer);
3162 if (/* The comma at the end of an
3163 enumerator-definition. */
3164 next_token->type != CPP_COMMA
3165 /* The curly brace at the end of an enum-specifier. */
3166 && next_token->type != CPP_CLOSE_BRACE
3167 /* The end of a statement. */
3168 && next_token->type != CPP_SEMICOLON
3169 /* The end of the cast-expression. */
3170 && next_token->type != CPP_CLOSE_PAREN
3171 /* The end of an array bound. */
3172 && next_token->type != CPP_CLOSE_SQUARE
3173 /* The closing ">" in a template-argument-list. */
3174 && (next_token->type != CPP_GREATER
3175 || parser->greater_than_is_operator_p)
3176 /* C++0x only: A ">>" treated like two ">" tokens,
3177 in a template-argument-list. */
3178 && (next_token->type != CPP_RSHIFT
3179 || (cxx_dialect == cxx98)
3180 || parser->greater_than_is_operator_p))
3184 /* If we are within a cast, then the constraint that the
3185 cast is to an integral or enumeration type will be
3186 checked at that point. If we are not within a cast, then
3187 this code is invalid. */
3189 cp_parser_non_integral_constant_expression
3190 (parser, "floating-point literal");
3192 return token->u.value;
3198 /* ??? Should wide strings be allowed when parser->translate_strings_p
3199 is false (i.e. in attributes)? If not, we can kill the third
3200 argument to cp_parser_string_literal. */
3201 return cp_parser_string_literal (parser,
3202 parser->translate_strings_p,
3205 case CPP_OPEN_PAREN:
3208 bool saved_greater_than_is_operator_p;
3210 /* Consume the `('. */
3211 cp_lexer_consume_token (parser->lexer);
3212 /* Within a parenthesized expression, a `>' token is always
3213 the greater-than operator. */
3214 saved_greater_than_is_operator_p
3215 = parser->greater_than_is_operator_p;
3216 parser->greater_than_is_operator_p = true;
3217 /* If we see `( { ' then we are looking at the beginning of
3218 a GNU statement-expression. */
3219 if (cp_parser_allow_gnu_extensions_p (parser)
3220 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
3222 /* Statement-expressions are not allowed by the standard. */
3223 pedwarn (token->location, OPT_pedantic,
3224 "ISO C++ forbids braced-groups within expressions");
3226 /* And they're not allowed outside of a function-body; you
3227 cannot, for example, write:
3229 int i = ({ int j = 3; j + 1; });
3231 at class or namespace scope. */
3232 if (!parser->in_function_body
3233 || parser->in_template_argument_list_p)
3235 error ("%Hstatement-expressions are not allowed outside "
3236 "functions nor in template-argument lists",
3238 cp_parser_skip_to_end_of_block_or_statement (parser);
3239 expr = error_mark_node;
3243 /* Start the statement-expression. */
3244 expr = begin_stmt_expr ();
3245 /* Parse the compound-statement. */
3246 cp_parser_compound_statement (parser, expr, false);
3248 expr = finish_stmt_expr (expr, false);
3253 /* Parse the parenthesized expression. */
3254 expr = cp_parser_expression (parser, cast_p);
3255 /* Let the front end know that this expression was
3256 enclosed in parentheses. This matters in case, for
3257 example, the expression is of the form `A::B', since
3258 `&A::B' might be a pointer-to-member, but `&(A::B)' is
3260 finish_parenthesized_expr (expr);
3262 /* The `>' token might be the end of a template-id or
3263 template-parameter-list now. */
3264 parser->greater_than_is_operator_p
3265 = saved_greater_than_is_operator_p;
3266 /* Consume the `)'. */
3267 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
3268 cp_parser_skip_to_end_of_statement (parser);
3274 switch (token->keyword)
3276 /* These two are the boolean literals. */
3278 cp_lexer_consume_token (parser->lexer);
3279 return boolean_true_node;
3281 cp_lexer_consume_token (parser->lexer);
3282 return boolean_false_node;
3284 /* The `__null' literal. */
3286 cp_lexer_consume_token (parser->lexer);
3289 /* Recognize the `this' keyword. */
3291 cp_lexer_consume_token (parser->lexer);
3292 if (parser->local_variables_forbidden_p)
3294 error ("%H%<this%> may not be used in this context",
3296 return error_mark_node;
3298 /* Pointers cannot appear in constant-expressions. */
3299 if (cp_parser_non_integral_constant_expression (parser, "%<this%>"))
3300 return error_mark_node;
3301 return finish_this_expr ();
3303 /* The `operator' keyword can be the beginning of an
3308 case RID_FUNCTION_NAME:
3309 case RID_PRETTY_FUNCTION_NAME:
3310 case RID_C99_FUNCTION_NAME:
3311 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
3312 __func__ are the names of variables -- but they are
3313 treated specially. Therefore, they are handled here,
3314 rather than relying on the generic id-expression logic
3315 below. Grammatically, these names are id-expressions.
3317 Consume the token. */
3318 token = cp_lexer_consume_token (parser->lexer);
3319 /* Look up the name. */
3320 return finish_fname (token->u.value);
3327 /* The `__builtin_va_arg' construct is used to handle
3328 `va_arg'. Consume the `__builtin_va_arg' token. */
3329 cp_lexer_consume_token (parser->lexer);
3330 /* Look for the opening `('. */
3331 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
3332 /* Now, parse the assignment-expression. */
3333 expression = cp_parser_assignment_expression (parser,
3335 /* Look for the `,'. */
3336 cp_parser_require (parser, CPP_COMMA, "%<,%>");
3337 /* Parse the type-id. */
3338 type = cp_parser_type_id (parser);
3339 /* Look for the closing `)'. */
3340 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
3341 /* Using `va_arg' in a constant-expression is not
3343 if (cp_parser_non_integral_constant_expression (parser,
3345 return error_mark_node;
3346 return build_x_va_arg (expression, type);
3350 return cp_parser_builtin_offsetof (parser);
3352 case RID_HAS_NOTHROW_ASSIGN:
3353 case RID_HAS_NOTHROW_CONSTRUCTOR:
3354 case RID_HAS_NOTHROW_COPY:
3355 case RID_HAS_TRIVIAL_ASSIGN:
3356 case RID_HAS_TRIVIAL_CONSTRUCTOR:
3357 case RID_HAS_TRIVIAL_COPY:
3358 case RID_HAS_TRIVIAL_DESTRUCTOR:
3359 case RID_HAS_VIRTUAL_DESTRUCTOR:
3360 case RID_IS_ABSTRACT:
3361 case RID_IS_BASE_OF:
3363 case RID_IS_CONVERTIBLE_TO:
3367 case RID_IS_POLYMORPHIC:
3369 return cp_parser_trait_expr (parser, token->keyword);
3371 /* Objective-C++ expressions. */
3373 case RID_AT_PROTOCOL:
3374 case RID_AT_SELECTOR:
3375 return cp_parser_objc_expression (parser);
3378 cp_parser_error (parser, "expected primary-expression");
3379 return error_mark_node;
3382 /* An id-expression can start with either an identifier, a
3383 `::' as the beginning of a qualified-id, or the "operator"
3387 case CPP_TEMPLATE_ID:
3388 case CPP_NESTED_NAME_SPECIFIER:
3392 const char *error_msg;
3395 cp_token *id_expr_token;
3398 /* Parse the id-expression. */
3400 = cp_parser_id_expression (parser,
3401 /*template_keyword_p=*/false,
3402 /*check_dependency_p=*/true,
3404 /*declarator_p=*/false,
3405 /*optional_p=*/false);
3406 if (id_expression == error_mark_node)
3407 return error_mark_node;
3408 id_expr_token = token;
3409 token = cp_lexer_peek_token (parser->lexer);
3410 done = (token->type != CPP_OPEN_SQUARE
3411 && token->type != CPP_OPEN_PAREN
3412 && token->type != CPP_DOT
3413 && token->type != CPP_DEREF
3414 && token->type != CPP_PLUS_PLUS
3415 && token->type != CPP_MINUS_MINUS);
3416 /* If we have a template-id, then no further lookup is
3417 required. If the template-id was for a template-class, we
3418 will sometimes have a TYPE_DECL at this point. */
3419 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
3420 || TREE_CODE (id_expression) == TYPE_DECL)
3421 decl = id_expression;
3422 /* Look up the name. */
3425 tree ambiguous_decls;
3427 decl = cp_parser_lookup_name (parser, id_expression,
3430 /*is_namespace=*/false,
3431 /*check_dependency=*/true,
3433 id_expr_token->location);
3434 /* If the lookup was ambiguous, an error will already have
3436 if (ambiguous_decls)
3437 return error_mark_node;
3439 /* In Objective-C++, an instance variable (ivar) may be preferred
3440 to whatever cp_parser_lookup_name() found. */
3441 decl = objc_lookup_ivar (decl, id_expression);
3443 /* If name lookup gives us a SCOPE_REF, then the
3444 qualifying scope was dependent. */
3445 if (TREE_CODE (decl) == SCOPE_REF)
3447 /* At this point, we do not know if DECL is a valid
3448 integral constant expression. We assume that it is
3449 in fact such an expression, so that code like:
3451 template <int N> struct A {
3455 is accepted. At template-instantiation time, we
3456 will check that B<N>::i is actually a constant. */
3459 /* Check to see if DECL is a local variable in a context
3460 where that is forbidden. */
3461 if (parser->local_variables_forbidden_p
3462 && local_variable_p (decl))
3464 /* It might be that we only found DECL because we are
3465 trying to be generous with pre-ISO scoping rules.
3466 For example, consider:
3470 for (int i = 0; i < 10; ++i) {}
3471 extern void f(int j = i);
3474 Here, name look up will originally find the out
3475 of scope `i'. We need to issue a warning message,
3476 but then use the global `i'. */
3477 decl = check_for_out_of_scope_variable (decl);
3478 if (local_variable_p (decl))
3480 error ("%Hlocal variable %qD may not appear in this context",
3481 &id_expr_token->location, decl);
3482 return error_mark_node;
3487 decl = (finish_id_expression
3488 (id_expression, decl, parser->scope,
3490 parser->integral_constant_expression_p,
3491 parser->allow_non_integral_constant_expression_p,
3492 &parser->non_integral_constant_expression_p,
3493 template_p, done, address_p,
3496 id_expr_token->location));
3498 cp_parser_error (parser, error_msg);
3502 /* Anything else is an error. */
3504 /* ...unless we have an Objective-C++ message or string literal,
3506 if (c_dialect_objc ()
3507 && (token->type == CPP_OPEN_SQUARE
3508 || token->type == CPP_OBJC_STRING))
3509 return cp_parser_objc_expression (parser);
3511 cp_parser_error (parser, "expected primary-expression");
3512 return error_mark_node;
3516 /* Parse an id-expression.
3523 :: [opt] nested-name-specifier template [opt] unqualified-id
3525 :: operator-function-id
3528 Return a representation of the unqualified portion of the
3529 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3530 a `::' or nested-name-specifier.
3532 Often, if the id-expression was a qualified-id, the caller will
3533 want to make a SCOPE_REF to represent the qualified-id. This
3534 function does not do this in order to avoid wastefully creating
3535 SCOPE_REFs when they are not required.
3537 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3540 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3541 uninstantiated templates.
3543 If *TEMPLATE_P is non-NULL, it is set to true iff the
3544 `template' keyword is used to explicitly indicate that the entity
3545 named is a template.
3547 If DECLARATOR_P is true, the id-expression is appearing as part of
3548 a declarator, rather than as part of an expression. */
3551 cp_parser_id_expression (cp_parser *parser,
3552 bool template_keyword_p,
3553 bool check_dependency_p,
3558 bool global_scope_p;
3559 bool nested_name_specifier_p;
3561 /* Assume the `template' keyword was not used. */
3563 *template_p = template_keyword_p;
3565 /* Look for the optional `::' operator. */
3567 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3569 /* Look for the optional nested-name-specifier. */
3570 nested_name_specifier_p
3571 = (cp_parser_nested_name_specifier_opt (parser,
3572 /*typename_keyword_p=*/false,
3577 /* If there is a nested-name-specifier, then we are looking at
3578 the first qualified-id production. */
3579 if (nested_name_specifier_p)
3582 tree saved_object_scope;
3583 tree saved_qualifying_scope;
3584 tree unqualified_id;
3587 /* See if the next token is the `template' keyword. */
3589 template_p = &is_template;
3590 *template_p = cp_parser_optional_template_keyword (parser);
3591 /* Name lookup we do during the processing of the
3592 unqualified-id might obliterate SCOPE. */
3593 saved_scope = parser->scope;
3594 saved_object_scope = parser->object_scope;
3595 saved_qualifying_scope = parser->qualifying_scope;
3596 /* Process the final unqualified-id. */
3597 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3600 /*optional_p=*/false);
3601 /* Restore the SAVED_SCOPE for our caller. */
3602 parser->scope = saved_scope;
3603 parser->object_scope = saved_object_scope;
3604 parser->qualifying_scope = saved_qualifying_scope;
3606 return unqualified_id;
3608 /* Otherwise, if we are in global scope, then we are looking at one
3609 of the other qualified-id productions. */
3610 else if (global_scope_p)
3615 /* Peek at the next token. */
3616 token = cp_lexer_peek_token (parser->lexer);
3618 /* If it's an identifier, and the next token is not a "<", then
3619 we can avoid the template-id case. This is an optimization
3620 for this common case. */
3621 if (token->type == CPP_NAME
3622 && !cp_parser_nth_token_starts_template_argument_list_p
3624 return cp_parser_identifier (parser);
3626 cp_parser_parse_tentatively (parser);
3627 /* Try a template-id. */
3628 id = cp_parser_template_id (parser,
3629 /*template_keyword_p=*/false,
3630 /*check_dependency_p=*/true,
3632 /* If that worked, we're done. */
3633 if (cp_parser_parse_definitely (parser))
3636 /* Peek at the next token. (Changes in the token buffer may
3637 have invalidated the pointer obtained above.) */
3638 token = cp_lexer_peek_token (parser->lexer);
3640 switch (token->type)
3643 return cp_parser_identifier (parser);
3646 if (token->keyword == RID_OPERATOR)
3647 return cp_parser_operator_function_id (parser);
3651 cp_parser_error (parser, "expected id-expression");
3652 return error_mark_node;
3656 return cp_parser_unqualified_id (parser, template_keyword_p,
3657 /*check_dependency_p=*/true,
3662 /* Parse an unqualified-id.
3666 operator-function-id
3667 conversion-function-id
3671 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3672 keyword, in a construct like `A::template ...'.
3674 Returns a representation of unqualified-id. For the `identifier'
3675 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3676 production a BIT_NOT_EXPR is returned; the operand of the
3677 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3678 other productions, see the documentation accompanying the
3679 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3680 names are looked up in uninstantiated templates. If DECLARATOR_P
3681 is true, the unqualified-id is appearing as part of a declarator,
3682 rather than as part of an expression. */
3685 cp_parser_unqualified_id (cp_parser* parser,
3686 bool template_keyword_p,
3687 bool check_dependency_p,
3693 /* Peek at the next token. */
3694 token = cp_lexer_peek_token (parser->lexer);
3696 switch (token->type)
3702 /* We don't know yet whether or not this will be a
3704 cp_parser_parse_tentatively (parser);
3705 /* Try a template-id. */
3706 id = cp_parser_template_id (parser, template_keyword_p,
3709 /* If it worked, we're done. */
3710 if (cp_parser_parse_definitely (parser))
3712 /* Otherwise, it's an ordinary identifier. */
3713 return cp_parser_identifier (parser);
3716 case CPP_TEMPLATE_ID:
3717 return cp_parser_template_id (parser, template_keyword_p,
3724 tree qualifying_scope;
3729 /* Consume the `~' token. */
3730 cp_lexer_consume_token (parser->lexer);
3731 /* Parse the class-name. The standard, as written, seems to
3734 template <typename T> struct S { ~S (); };
3735 template <typename T> S<T>::~S() {}
3737 is invalid, since `~' must be followed by a class-name, but
3738 `S<T>' is dependent, and so not known to be a class.
3739 That's not right; we need to look in uninstantiated
3740 templates. A further complication arises from:
3742 template <typename T> void f(T t) {
3746 Here, it is not possible to look up `T' in the scope of `T'
3747 itself. We must look in both the current scope, and the
3748 scope of the containing complete expression.
3750 Yet another issue is:
3759 The standard does not seem to say that the `S' in `~S'
3760 should refer to the type `S' and not the data member
3763 /* DR 244 says that we look up the name after the "~" in the
3764 same scope as we looked up the qualifying name. That idea
3765 isn't fully worked out; it's more complicated than that. */
3766 scope = parser->scope;
3767 object_scope = parser->object_scope;
3768 qualifying_scope = parser->qualifying_scope;
3770 /* Check for invalid scopes. */
3771 if (scope == error_mark_node)
3773 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
3774 cp_lexer_consume_token (parser->lexer);
3775 return error_mark_node;
3777 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
3779 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
3780 error ("%Hscope %qT before %<~%> is not a class-name",
3781 &token->location, scope);
3782 cp_parser_simulate_error (parser);
3783 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
3784 cp_lexer_consume_token (parser->lexer);
3785 return error_mark_node;
3787 gcc_assert (!scope || TYPE_P (scope));
3789 /* If the name is of the form "X::~X" it's OK. */
3790 token = cp_lexer_peek_token (parser->lexer);
3792 && token->type == CPP_NAME
3793 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3795 && constructor_name_p (token->u.value, scope))
3797 cp_lexer_consume_token (parser->lexer);
3798 return build_nt (BIT_NOT_EXPR, scope);
3801 /* If there was an explicit qualification (S::~T), first look
3802 in the scope given by the qualification (i.e., S). */
3804 type_decl = NULL_TREE;
3807 cp_parser_parse_tentatively (parser);
3808 type_decl = cp_parser_class_name (parser,
3809 /*typename_keyword_p=*/false,
3810 /*template_keyword_p=*/false,
3812 /*check_dependency=*/false,
3813 /*class_head_p=*/false,
3815 if (cp_parser_parse_definitely (parser))
3818 /* In "N::S::~S", look in "N" as well. */
3819 if (!done && scope && qualifying_scope)
3821 cp_parser_parse_tentatively (parser);
3822 parser->scope = qualifying_scope;
3823 parser->object_scope = NULL_TREE;
3824 parser->qualifying_scope = NULL_TREE;
3826 = cp_parser_class_name (parser,
3827 /*typename_keyword_p=*/false,
3828 /*template_keyword_p=*/false,
3830 /*check_dependency=*/false,
3831 /*class_head_p=*/false,
3833 if (cp_parser_parse_definitely (parser))
3836 /* In "p->S::~T", look in the scope given by "*p" as well. */
3837 else if (!done && object_scope)
3839 cp_parser_parse_tentatively (parser);
3840 parser->scope = object_scope;
3841 parser->object_scope = NULL_TREE;
3842 parser->qualifying_scope = NULL_TREE;
3844 = cp_parser_class_name (parser,
3845 /*typename_keyword_p=*/false,
3846 /*template_keyword_p=*/false,
3848 /*check_dependency=*/false,
3849 /*class_head_p=*/false,
3851 if (cp_parser_parse_definitely (parser))
3854 /* Look in the surrounding context. */
3857 parser->scope = NULL_TREE;
3858 parser->object_scope = NULL_TREE;
3859 parser->qualifying_scope = NULL_TREE;
3861 = cp_parser_class_name (parser,
3862 /*typename_keyword_p=*/false,
3863 /*template_keyword_p=*/false,
3865 /*check_dependency=*/false,
3866 /*class_head_p=*/false,
3869 /* If an error occurred, assume that the name of the
3870 destructor is the same as the name of the qualifying
3871 class. That allows us to keep parsing after running
3872 into ill-formed destructor names. */
3873 if (type_decl == error_mark_node && scope)
3874 return build_nt (BIT_NOT_EXPR, scope);
3875 else if (type_decl == error_mark_node)
3876 return error_mark_node;
3878 /* Check that destructor name and scope match. */
3879 if (declarator_p && scope && !check_dtor_name (scope, type_decl))
3881 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
3882 error ("%Hdeclaration of %<~%T%> as member of %qT",
3883 &token->location, type_decl, scope);
3884 cp_parser_simulate_error (parser);
3885 return error_mark_node;
3890 A typedef-name that names a class shall not be used as the
3891 identifier in the declarator for a destructor declaration. */
3893 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3894 && !DECL_SELF_REFERENCE_P (type_decl)
3895 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
3896 error ("%Htypedef-name %qD used as destructor declarator",
3897 &token->location, type_decl);
3899 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3903 if (token->keyword == RID_OPERATOR)
3907 /* This could be a template-id, so we try that first. */
3908 cp_parser_parse_tentatively (parser);
3909 /* Try a template-id. */
3910 id = cp_parser_template_id (parser, template_keyword_p,
3911 /*check_dependency_p=*/true,
3913 /* If that worked, we're done. */
3914 if (cp_parser_parse_definitely (parser))
3916 /* We still don't know whether we're looking at an
3917 operator-function-id or a conversion-function-id. */
3918 cp_parser_parse_tentatively (parser);
3919 /* Try an operator-function-id. */
3920 id = cp_parser_operator_function_id (parser);
3921 /* If that didn't work, try a conversion-function-id. */
3922 if (!cp_parser_parse_definitely (parser))
3923 id = cp_parser_conversion_function_id (parser);
3932 cp_parser_error (parser, "expected unqualified-id");
3933 return error_mark_node;
3937 /* Parse an (optional) nested-name-specifier.
3939 nested-name-specifier: [C++98]
3940 class-or-namespace-name :: nested-name-specifier [opt]
3941 class-or-namespace-name :: template nested-name-specifier [opt]
3943 nested-name-specifier: [C++0x]
3946 nested-name-specifier identifier ::
3947 nested-name-specifier template [opt] simple-template-id ::
3949 PARSER->SCOPE should be set appropriately before this function is
3950 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3951 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3954 Sets PARSER->SCOPE to the class (TYPE) or namespace
3955 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3956 it unchanged if there is no nested-name-specifier. Returns the new
3957 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3959 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3960 part of a declaration and/or decl-specifier. */
3963 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3964 bool typename_keyword_p,
3965 bool check_dependency_p,
3967 bool is_declaration)
3969 bool success = false;
3970 cp_token_position start = 0;
3973 /* Remember where the nested-name-specifier starts. */
3974 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3976 start = cp_lexer_token_position (parser->lexer, false);
3977 push_deferring_access_checks (dk_deferred);
3984 tree saved_qualifying_scope;
3985 bool template_keyword_p;
3987 /* Spot cases that cannot be the beginning of a
3988 nested-name-specifier. */
3989 token = cp_lexer_peek_token (parser->lexer);
3991 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3992 the already parsed nested-name-specifier. */
3993 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3995 /* Grab the nested-name-specifier and continue the loop. */
3996 cp_parser_pre_parsed_nested_name_specifier (parser);
3997 /* If we originally encountered this nested-name-specifier
3998 with IS_DECLARATION set to false, we will not have
3999 resolved TYPENAME_TYPEs, so we must do so here. */
4001 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4003 new_scope = resolve_typename_type (parser->scope,
4004 /*only_current_p=*/false);
4005 if (TREE_CODE (new_scope) != TYPENAME_TYPE)
4006 parser->scope = new_scope;
4012 /* Spot cases that cannot be the beginning of a
4013 nested-name-specifier. On the second and subsequent times
4014 through the loop, we look for the `template' keyword. */
4015 if (success && token->keyword == RID_TEMPLATE)
4017 /* A template-id can start a nested-name-specifier. */
4018 else if (token->type == CPP_TEMPLATE_ID)
4022 /* If the next token is not an identifier, then it is
4023 definitely not a type-name or namespace-name. */
4024 if (token->type != CPP_NAME)
4026 /* If the following token is neither a `<' (to begin a
4027 template-id), nor a `::', then we are not looking at a
4028 nested-name-specifier. */
4029 token = cp_lexer_peek_nth_token (parser->lexer, 2);
4030 if (token->type != CPP_SCOPE
4031 && !cp_parser_nth_token_starts_template_argument_list_p
4036 /* The nested-name-specifier is optional, so we parse
4038 cp_parser_parse_tentatively (parser);
4040 /* Look for the optional `template' keyword, if this isn't the
4041 first time through the loop. */
4043 template_keyword_p = cp_parser_optional_template_keyword (parser);
4045 template_keyword_p = false;
4047 /* Save the old scope since the name lookup we are about to do
4048 might destroy it. */
4049 old_scope = parser->scope;
4050 saved_qualifying_scope = parser->qualifying_scope;
4051 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4052 look up names in "X<T>::I" in order to determine that "Y" is
4053 a template. So, if we have a typename at this point, we make
4054 an effort to look through it. */
4056 && !typename_keyword_p
4058 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4059 parser->scope = resolve_typename_type (parser->scope,
4060 /*only_current_p=*/false);
4061 /* Parse the qualifying entity. */
4063 = cp_parser_qualifying_entity (parser,
4069 /* Look for the `::' token. */
4070 cp_parser_require (parser, CPP_SCOPE, "%<::%>");
4072 /* If we found what we wanted, we keep going; otherwise, we're
4074 if (!cp_parser_parse_definitely (parser))
4076 bool error_p = false;
4078 /* Restore the OLD_SCOPE since it was valid before the
4079 failed attempt at finding the last
4080 class-or-namespace-name. */
4081 parser->scope = old_scope;
4082 parser->qualifying_scope = saved_qualifying_scope;
4083 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
4085 /* If the next token is an identifier, and the one after
4086 that is a `::', then any valid interpretation would have
4087 found a class-or-namespace-name. */
4088 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
4089 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4091 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
4094 token = cp_lexer_consume_token (parser->lexer);
4097 if (!token->ambiguous_p)
4100 tree ambiguous_decls;
4102 decl = cp_parser_lookup_name (parser, token->u.value,
4104 /*is_template=*/false,
4105 /*is_namespace=*/false,
4106 /*check_dependency=*/true,
4109 if (TREE_CODE (decl) == TEMPLATE_DECL)
4110 error ("%H%qD used without template parameters",
4111 &token->location, decl);
4112 else if (ambiguous_decls)
4114 error ("%Hreference to %qD is ambiguous",
4115 &token->location, token->u.value);
4116 print_candidates (ambiguous_decls);
4117 decl = error_mark_node;
4121 const char* msg = "is not a class or namespace";
4122 if (cxx_dialect != cxx98)
4123 msg = "is not a class, namespace, or enumeration";
4124 cp_parser_name_lookup_error
4125 (parser, token->u.value, decl, msg,
4129 parser->scope = error_mark_node;
4131 /* Treat this as a successful nested-name-specifier
4136 If the name found is not a class-name (clause
4137 _class_) or namespace-name (_namespace.def_), the
4138 program is ill-formed. */
4141 cp_lexer_consume_token (parser->lexer);
4145 /* We've found one valid nested-name-specifier. */
4147 /* Name lookup always gives us a DECL. */
4148 if (TREE_CODE (new_scope) == TYPE_DECL)
4149 new_scope = TREE_TYPE (new_scope);
4150 /* Uses of "template" must be followed by actual templates. */
4151 if (template_keyword_p
4152 && !(CLASS_TYPE_P (new_scope)
4153 && ((CLASSTYPE_USE_TEMPLATE (new_scope)
4154 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope)))
4155 || CLASSTYPE_IS_TEMPLATE (new_scope)))
4156 && !(TREE_CODE (new_scope) == TYPENAME_TYPE
4157 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope))
4158 == TEMPLATE_ID_EXPR)))
4159 permerror (input_location, TYPE_P (new_scope)
4160 ? "%qT is not a template"
4161 : "%qD is not a template",
4163 /* If it is a class scope, try to complete it; we are about to
4164 be looking up names inside the class. */
4165 if (TYPE_P (new_scope)
4166 /* Since checking types for dependency can be expensive,
4167 avoid doing it if the type is already complete. */
4168 && !COMPLETE_TYPE_P (new_scope)
4169 /* Do not try to complete dependent types. */
4170 && !dependent_type_p (new_scope))
4172 new_scope = complete_type (new_scope);
4173 /* If it is a typedef to current class, use the current
4174 class instead, as the typedef won't have any names inside
4176 if (!COMPLETE_TYPE_P (new_scope)
4177 && currently_open_class (new_scope))
4178 new_scope = TYPE_MAIN_VARIANT (new_scope);
4180 /* Make sure we look in the right scope the next time through
4182 parser->scope = new_scope;
4185 /* If parsing tentatively, replace the sequence of tokens that makes
4186 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
4187 token. That way, should we re-parse the token stream, we will
4188 not have to repeat the effort required to do the parse, nor will
4189 we issue duplicate error messages. */
4190 if (success && start)
4194 token = cp_lexer_token_at (parser->lexer, start);
4195 /* Reset the contents of the START token. */
4196 token->type = CPP_NESTED_NAME_SPECIFIER;
4197 /* Retrieve any deferred checks. Do not pop this access checks yet
4198 so the memory will not be reclaimed during token replacing below. */
4199 token->u.tree_check_value = GGC_CNEW (struct tree_check);
4200 token->u.tree_check_value->value = parser->scope;
4201 token->u.tree_check_value->checks = get_deferred_access_checks ();
4202 token->u.tree_check_value->qualifying_scope =
4203 parser->qualifying_scope;
4204 token->keyword = RID_MAX;
4206 /* Purge all subsequent tokens. */
4207 cp_lexer_purge_tokens_after (parser->lexer, start);
4211 pop_to_parent_deferring_access_checks ();
4213 return success ? parser->scope : NULL_TREE;
4216 /* Parse a nested-name-specifier. See
4217 cp_parser_nested_name_specifier_opt for details. This function
4218 behaves identically, except that it will an issue an error if no
4219 nested-name-specifier is present. */
4222 cp_parser_nested_name_specifier (cp_parser *parser,
4223 bool typename_keyword_p,
4224 bool check_dependency_p,
4226 bool is_declaration)
4230 /* Look for the nested-name-specifier. */
4231 scope = cp_parser_nested_name_specifier_opt (parser,
4236 /* If it was not present, issue an error message. */
4239 cp_parser_error (parser, "expected nested-name-specifier");
4240 parser->scope = NULL_TREE;
4246 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
4247 this is either a class-name or a namespace-name (which corresponds
4248 to the class-or-namespace-name production in the grammar). For
4249 C++0x, it can also be a type-name that refers to an enumeration
4252 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
4253 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
4254 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
4255 TYPE_P is TRUE iff the next name should be taken as a class-name,
4256 even the same name is declared to be another entity in the same
4259 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
4260 specified by the class-or-namespace-name. If neither is found the
4261 ERROR_MARK_NODE is returned. */
4264 cp_parser_qualifying_entity (cp_parser *parser,
4265 bool typename_keyword_p,
4266 bool template_keyword_p,
4267 bool check_dependency_p,
4269 bool is_declaration)
4272 tree saved_qualifying_scope;
4273 tree saved_object_scope;
4276 bool successful_parse_p;
4278 /* Before we try to parse the class-name, we must save away the
4279 current PARSER->SCOPE since cp_parser_class_name will destroy
4281 saved_scope = parser->scope;
4282 saved_qualifying_scope = parser->qualifying_scope;
4283 saved_object_scope = parser->object_scope;
4284 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
4285 there is no need to look for a namespace-name. */
4286 only_class_p = template_keyword_p
4287 || (saved_scope && TYPE_P (saved_scope) && cxx_dialect == cxx98);
4289 cp_parser_parse_tentatively (parser);
4290 scope = cp_parser_class_name (parser,
4293 type_p ? class_type : none_type,
4295 /*class_head_p=*/false,
4297 successful_parse_p = only_class_p || cp_parser_parse_definitely (parser);
4298 /* If that didn't work and we're in C++0x mode, try for a type-name. */
4300 && cxx_dialect != cxx98
4301 && !successful_parse_p)
4303 /* Restore the saved scope. */
4304 parser->scope = saved_scope;
4305 parser->qualifying_scope = saved_qualifying_scope;
4306 parser->object_scope = saved_object_scope;
4308 /* Parse tentatively. */
4309 cp_parser_parse_tentatively (parser);
4311 /* Parse a typedef-name or enum-name. */
4312 scope = cp_parser_nonclass_name (parser);
4313 successful_parse_p = cp_parser_parse_definitely (parser);
4315 /* If that didn't work, try for a namespace-name. */
4316 if (!only_class_p && !successful_parse_p)
4318 /* Restore the saved scope. */
4319 parser->scope = saved_scope;
4320 parser->qualifying_scope = saved_qualifying_scope;
4321 parser->object_scope = saved_object_scope;
4322 /* If we are not looking at an identifier followed by the scope
4323 resolution operator, then this is not part of a
4324 nested-name-specifier. (Note that this function is only used
4325 to parse the components of a nested-name-specifier.) */
4326 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
4327 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
4328 return error_mark_node;
4329 scope = cp_parser_namespace_name (parser);
4335 /* Parse a postfix-expression.
4339 postfix-expression [ expression ]
4340 postfix-expression ( expression-list [opt] )
4341 simple-type-specifier ( expression-list [opt] )
4342 typename :: [opt] nested-name-specifier identifier
4343 ( expression-list [opt] )
4344 typename :: [opt] nested-name-specifier template [opt] template-id
4345 ( expression-list [opt] )
4346 postfix-expression . template [opt] id-expression
4347 postfix-expression -> template [opt] id-expression
4348 postfix-expression . pseudo-destructor-name
4349 postfix-expression -> pseudo-destructor-name
4350 postfix-expression ++
4351 postfix-expression --
4352 dynamic_cast < type-id > ( expression )
4353 static_cast < type-id > ( expression )
4354 reinterpret_cast < type-id > ( expression )
4355 const_cast < type-id > ( expression )
4356 typeid ( expression )
4362 ( type-id ) { initializer-list , [opt] }
4364 This extension is a GNU version of the C99 compound-literal
4365 construct. (The C99 grammar uses `type-name' instead of `type-id',
4366 but they are essentially the same concept.)
4368 If ADDRESS_P is true, the postfix expression is the operand of the
4369 `&' operator. CAST_P is true if this expression is the target of a
4372 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
4373 class member access expressions [expr.ref].
4375 Returns a representation of the expression. */
4378 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p,
4379 bool member_access_only_p)
4383 cp_id_kind idk = CP_ID_KIND_NONE;
4384 tree postfix_expression = NULL_TREE;
4385 bool is_member_access = false;
4387 /* Peek at the next token. */
4388 token = cp_lexer_peek_token (parser->lexer);
4389 /* Some of the productions are determined by keywords. */
4390 keyword = token->keyword;
4400 const char *saved_message;
4402 /* All of these can be handled in the same way from the point
4403 of view of parsing. Begin by consuming the token
4404 identifying the cast. */
4405 cp_lexer_consume_token (parser->lexer);
4407 /* New types cannot be defined in the cast. */
4408 saved_message = parser->type_definition_forbidden_message;
4409 parser->type_definition_forbidden_message
4410 = "types may not be defined in casts";
4412 /* Look for the opening `<'. */
4413 cp_parser_require (parser, CPP_LESS, "%<<%>");
4414 /* Parse the type to which we are casting. */
4415 type = cp_parser_type_id (parser);
4416 /* Look for the closing `>'. */
4417 cp_parser_require (parser, CPP_GREATER, "%<>%>");
4418 /* Restore the old message. */
4419 parser->type_definition_forbidden_message = saved_message;
4421 /* And the expression which is being cast. */
4422 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
4423 expression = cp_parser_expression (parser, /*cast_p=*/true);
4424 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
4426 /* Only type conversions to integral or enumeration types
4427 can be used in constant-expressions. */
4428 if (!cast_valid_in_integral_constant_expression_p (type)
4429 && (cp_parser_non_integral_constant_expression
4431 "a cast to a type other than an integral or "
4432 "enumeration type")))
4433 return error_mark_node;
4439 = build_dynamic_cast (type, expression, tf_warning_or_error);
4443 = build_static_cast (type, expression, tf_warning_or_error);
4447 = build_reinterpret_cast (type, expression,
4448 tf_warning_or_error);
4452 = build_const_cast (type, expression, tf_warning_or_error);
4463 const char *saved_message;
4464 bool saved_in_type_id_in_expr_p;
4466 /* Consume the `typeid' token. */
4467 cp_lexer_consume_token (parser->lexer);
4468 /* Look for the `(' token. */
4469 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
4470 /* Types cannot be defined in a `typeid' expression. */
4471 saved_message = parser->type_definition_forbidden_message;
4472 parser->type_definition_forbidden_message
4473 = "types may not be defined in a %<typeid%> expression";
4474 /* We can't be sure yet whether we're looking at a type-id or an
4476 cp_parser_parse_tentatively (parser);
4477 /* Try a type-id first. */
4478 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4479 parser->in_type_id_in_expr_p = true;
4480 type = cp_parser_type_id (parser);
4481 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4482 /* Look for the `)' token. Otherwise, we can't be sure that
4483 we're not looking at an expression: consider `typeid (int
4484 (3))', for example. */
4485 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
4486 /* If all went well, simply lookup the type-id. */
4487 if (cp_parser_parse_definitely (parser))
4488 postfix_expression = get_typeid (type);
4489 /* Otherwise, fall back to the expression variant. */
4494 /* Look for an expression. */
4495 expression = cp_parser_expression (parser, /*cast_p=*/false);
4496 /* Compute its typeid. */
4497 postfix_expression = build_typeid (expression);
4498 /* Look for the `)' token. */
4499 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
4501 /* Restore the saved message. */
4502 parser->type_definition_forbidden_message = saved_message;
4503 /* `typeid' may not appear in an integral constant expression. */
4504 if (cp_parser_non_integral_constant_expression(parser,
4505 "%<typeid%> operator"))
4506 return error_mark_node;
4513 /* The syntax permitted here is the same permitted for an
4514 elaborated-type-specifier. */
4515 type = cp_parser_elaborated_type_specifier (parser,
4516 /*is_friend=*/false,
4517 /*is_declaration=*/false);
4518 postfix_expression = cp_parser_functional_cast (parser, type);
4526 /* If the next thing is a simple-type-specifier, we may be
4527 looking at a functional cast. We could also be looking at
4528 an id-expression. So, we try the functional cast, and if
4529 that doesn't work we fall back to the primary-expression. */
4530 cp_parser_parse_tentatively (parser);
4531 /* Look for the simple-type-specifier. */
4532 type = cp_parser_simple_type_specifier (parser,
4533 /*decl_specs=*/NULL,
4534 CP_PARSER_FLAGS_NONE);
4535 /* Parse the cast itself. */
4536 if (!cp_parser_error_occurred (parser))
4538 = cp_parser_functional_cast (parser, type);
4539 /* If that worked, we're done. */
4540 if (cp_parser_parse_definitely (parser))
4543 /* If the functional-cast didn't work out, try a
4544 compound-literal. */
4545 if (cp_parser_allow_gnu_extensions_p (parser)
4546 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4548 VEC(constructor_elt,gc) *initializer_list = NULL;
4549 bool saved_in_type_id_in_expr_p;
4551 cp_parser_parse_tentatively (parser);
4552 /* Consume the `('. */
4553 cp_lexer_consume_token (parser->lexer);
4554 /* Parse the type. */
4555 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4556 parser->in_type_id_in_expr_p = true;
4557 type = cp_parser_type_id (parser);
4558 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4559 /* Look for the `)'. */
4560 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
4561 /* Look for the `{'. */
4562 cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>");
4563 /* If things aren't going well, there's no need to
4565 if (!cp_parser_error_occurred (parser))
4567 bool non_constant_p;
4568 /* Parse the initializer-list. */
4570 = cp_parser_initializer_list (parser, &non_constant_p);
4571 /* Allow a trailing `,'. */
4572 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
4573 cp_lexer_consume_token (parser->lexer);
4574 /* Look for the final `}'. */
4575 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
4577 /* If that worked, we're definitely looking at a
4578 compound-literal expression. */
4579 if (cp_parser_parse_definitely (parser))
4581 /* Warn the user that a compound literal is not
4582 allowed in standard C++. */
4583 pedwarn (input_location, OPT_pedantic, "ISO C++ forbids compound-literals");
4584 /* For simplicity, we disallow compound literals in
4585 constant-expressions. We could
4586 allow compound literals of integer type, whose
4587 initializer was a constant, in constant
4588 expressions. Permitting that usage, as a further
4589 extension, would not change the meaning of any
4590 currently accepted programs. (Of course, as
4591 compound literals are not part of ISO C++, the
4592 standard has nothing to say.) */
4593 if (cp_parser_non_integral_constant_expression
4594 (parser, "non-constant compound literals"))
4596 postfix_expression = error_mark_node;
4599 /* Form the representation of the compound-literal. */
4601 = (finish_compound_literal
4602 (type, build_constructor (init_list_type_node,
4603 initializer_list)));
4608 /* It must be a primary-expression. */
4610 = cp_parser_primary_expression (parser, address_p, cast_p,
4611 /*template_arg_p=*/false,
4617 /* Keep looping until the postfix-expression is complete. */
4620 if (idk == CP_ID_KIND_UNQUALIFIED
4621 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
4622 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
4623 /* It is not a Koenig lookup function call. */
4625 = unqualified_name_lookup_error (postfix_expression);
4627 /* Peek at the next token. */
4628 token = cp_lexer_peek_token (parser->lexer);
4630 switch (token->type)
4632 case CPP_OPEN_SQUARE:
4634 = cp_parser_postfix_open_square_expression (parser,
4637 idk = CP_ID_KIND_NONE;
4638 is_member_access = false;
4641 case CPP_OPEN_PAREN:
4642 /* postfix-expression ( expression-list [opt] ) */
4645 bool is_builtin_constant_p;
4646 bool saved_integral_constant_expression_p = false;
4647 bool saved_non_integral_constant_expression_p = false;
4650 is_member_access = false;
4652 is_builtin_constant_p
4653 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
4654 if (is_builtin_constant_p)
4656 /* The whole point of __builtin_constant_p is to allow
4657 non-constant expressions to appear as arguments. */
4658 saved_integral_constant_expression_p
4659 = parser->integral_constant_expression_p;
4660 saved_non_integral_constant_expression_p
4661 = parser->non_integral_constant_expression_p;
4662 parser->integral_constant_expression_p = false;
4664 args = (cp_parser_parenthesized_expression_list
4665 (parser, /*is_attribute_list=*/false,
4666 /*cast_p=*/false, /*allow_expansion_p=*/true,
4667 /*non_constant_p=*/NULL));
4668 if (is_builtin_constant_p)
4670 parser->integral_constant_expression_p
4671 = saved_integral_constant_expression_p;
4672 parser->non_integral_constant_expression_p
4673 = saved_non_integral_constant_expression_p;
4676 if (args == error_mark_node)
4678 postfix_expression = error_mark_node;
4682 /* Function calls are not permitted in
4683 constant-expressions. */
4684 if (! builtin_valid_in_constant_expr_p (postfix_expression)
4685 && cp_parser_non_integral_constant_expression (parser,
4688 postfix_expression = error_mark_node;
4693 if (idk == CP_ID_KIND_UNQUALIFIED)
4695 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
4701 = perform_koenig_lookup (postfix_expression, args);
4705 = unqualified_fn_lookup_error (postfix_expression);
4707 /* We do not perform argument-dependent lookup if
4708 normal lookup finds a non-function, in accordance
4709 with the expected resolution of DR 218. */
4710 else if (args && is_overloaded_fn (postfix_expression))
4712 tree fn = get_first_fn (postfix_expression);
4714 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4715 fn = OVL_CURRENT (TREE_OPERAND (fn, 0));
4717 /* Only do argument dependent lookup if regular
4718 lookup does not find a set of member functions.
4719 [basic.lookup.koenig]/2a */
4720 if (!DECL_FUNCTION_MEMBER_P (fn))
4724 = perform_koenig_lookup (postfix_expression, args);
4729 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4731 tree instance = TREE_OPERAND (postfix_expression, 0);
4732 tree fn = TREE_OPERAND (postfix_expression, 1);
4734 if (processing_template_decl
4735 && (type_dependent_expression_p (instance)
4736 || (!BASELINK_P (fn)
4737 && TREE_CODE (fn) != FIELD_DECL)
4738 || type_dependent_expression_p (fn)
4739 || any_type_dependent_arguments_p (args)))
4742 = build_nt_call_list (postfix_expression, args);
4746 if (BASELINK_P (fn))
4748 = (build_new_method_call
4749 (instance, fn, args, NULL_TREE,
4750 (idk == CP_ID_KIND_QUALIFIED
4751 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL),
4753 tf_warning_or_error));
4756 = finish_call_expr (postfix_expression, args,
4757 /*disallow_virtual=*/false,
4759 tf_warning_or_error);
4761 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4762 || TREE_CODE (postfix_expression) == MEMBER_REF
4763 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4764 postfix_expression = (build_offset_ref_call_from_tree
4765 (postfix_expression, args));
4766 else if (idk == CP_ID_KIND_QUALIFIED)
4767 /* A call to a static class member, or a namespace-scope
4770 = finish_call_expr (postfix_expression, args,
4771 /*disallow_virtual=*/true,
4773 tf_warning_or_error);
4775 /* All other function calls. */
4777 = finish_call_expr (postfix_expression, args,
4778 /*disallow_virtual=*/false,
4780 tf_warning_or_error);
4782 if (warn_disallowed_functions)
4783 warn_if_disallowed_function_p (postfix_expression);
4785 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4786 idk = CP_ID_KIND_NONE;
4792 /* postfix-expression . template [opt] id-expression
4793 postfix-expression . pseudo-destructor-name
4794 postfix-expression -> template [opt] id-expression
4795 postfix-expression -> pseudo-destructor-name */
4797 /* Consume the `.' or `->' operator. */
4798 cp_lexer_consume_token (parser->lexer);
4801 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4806 is_member_access = true;
4810 /* postfix-expression ++ */
4811 /* Consume the `++' token. */
4812 cp_lexer_consume_token (parser->lexer);
4813 /* Generate a representation for the complete expression. */
4815 = finish_increment_expr (postfix_expression,
4816 POSTINCREMENT_EXPR);
4817 /* Increments may not appear in constant-expressions. */
4818 if (cp_parser_non_integral_constant_expression (parser,
4820 postfix_expression = error_mark_node;
4821 idk = CP_ID_KIND_NONE;
4822 is_member_access = false;
4825 case CPP_MINUS_MINUS:
4826 /* postfix-expression -- */
4827 /* Consume the `--' token. */
4828 cp_lexer_consume_token (parser->lexer);
4829 /* Generate a representation for the complete expression. */
4831 = finish_increment_expr (postfix_expression,
4832 POSTDECREMENT_EXPR);
4833 /* Decrements may not appear in constant-expressions. */
4834 if (cp_parser_non_integral_constant_expression (parser,
4836 postfix_expression = error_mark_node;
4837 idk = CP_ID_KIND_NONE;
4838 is_member_access = false;
4842 if (member_access_only_p)
4843 return is_member_access? postfix_expression : error_mark_node;
4845 return postfix_expression;
4849 /* We should never get here. */
4851 return error_mark_node;
4854 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4855 by cp_parser_builtin_offsetof. We're looking for
4857 postfix-expression [ expression ]
4859 FOR_OFFSETOF is set if we're being called in that context, which
4860 changes how we deal with integer constant expressions. */
4863 cp_parser_postfix_open_square_expression (cp_parser *parser,
4864 tree postfix_expression,
4869 /* Consume the `[' token. */
4870 cp_lexer_consume_token (parser->lexer);
4872 /* Parse the index expression. */
4873 /* ??? For offsetof, there is a question of what to allow here. If
4874 offsetof is not being used in an integral constant expression context,
4875 then we *could* get the right answer by computing the value at runtime.
4876 If we are in an integral constant expression context, then we might
4877 could accept any constant expression; hard to say without analysis.
4878 Rather than open the barn door too wide right away, allow only integer
4879 constant expressions here. */
4881 index = cp_parser_constant_expression (parser, false, NULL);
4883 index = cp_parser_expression (parser, /*cast_p=*/false);
4885 /* Look for the closing `]'. */
4886 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
4888 /* Build the ARRAY_REF. */
4889 postfix_expression = grok_array_decl (postfix_expression, index);
4891 /* When not doing offsetof, array references are not permitted in
4892 constant-expressions. */
4894 && (cp_parser_non_integral_constant_expression
4895 (parser, "an array reference")))
4896 postfix_expression = error_mark_node;
4898 return postfix_expression;
4901 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4902 by cp_parser_builtin_offsetof. We're looking for
4904 postfix-expression . template [opt] id-expression
4905 postfix-expression . pseudo-destructor-name
4906 postfix-expression -> template [opt] id-expression
4907 postfix-expression -> pseudo-destructor-name
4909 FOR_OFFSETOF is set if we're being called in that context. That sorta
4910 limits what of the above we'll actually accept, but nevermind.
4911 TOKEN_TYPE is the "." or "->" token, which will already have been
4912 removed from the stream. */
4915 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4916 enum cpp_ttype token_type,
4917 tree postfix_expression,
4918 bool for_offsetof, cp_id_kind *idk,
4919 location_t location)
4923 bool pseudo_destructor_p;
4924 tree scope = NULL_TREE;
4926 /* If this is a `->' operator, dereference the pointer. */
4927 if (token_type == CPP_DEREF)
4928 postfix_expression = build_x_arrow (postfix_expression);
4929 /* Check to see whether or not the expression is type-dependent. */
4930 dependent_p = type_dependent_expression_p (postfix_expression);
4931 /* The identifier following the `->' or `.' is not qualified. */
4932 parser->scope = NULL_TREE;
4933 parser->qualifying_scope = NULL_TREE;
4934 parser->object_scope = NULL_TREE;
4935 *idk = CP_ID_KIND_NONE;
4936 /* Enter the scope corresponding to the type of the object
4937 given by the POSTFIX_EXPRESSION. */
4938 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4940 scope = TREE_TYPE (postfix_expression);
4941 /* According to the standard, no expression should ever have
4942 reference type. Unfortunately, we do not currently match
4943 the standard in this respect in that our internal representation
4944 of an expression may have reference type even when the standard
4945 says it does not. Therefore, we have to manually obtain the
4946 underlying type here. */
4947 scope = non_reference (scope);
4948 /* The type of the POSTFIX_EXPRESSION must be complete. */
4949 if (scope == unknown_type_node)
4951 error ("%H%qE does not have class type", &location, postfix_expression);
4955 scope = complete_type_or_else (scope, NULL_TREE);
4956 /* Let the name lookup machinery know that we are processing a
4957 class member access expression. */
4958 parser->context->object_type = scope;
4959 /* If something went wrong, we want to be able to discern that case,
4960 as opposed to the case where there was no SCOPE due to the type
4961 of expression being dependent. */
4963 scope = error_mark_node;
4964 /* If the SCOPE was erroneous, make the various semantic analysis
4965 functions exit quickly -- and without issuing additional error
4967 if (scope == error_mark_node)
4968 postfix_expression = error_mark_node;
4971 /* Assume this expression is not a pseudo-destructor access. */
4972 pseudo_destructor_p = false;
4974 /* If the SCOPE is a scalar type, then, if this is a valid program,
4975 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
4976 is type dependent, it can be pseudo-destructor-name or something else.
4977 Try to parse it as pseudo-destructor-name first. */
4978 if ((scope && SCALAR_TYPE_P (scope)) || dependent_p)
4983 cp_parser_parse_tentatively (parser);
4984 /* Parse the pseudo-destructor-name. */
4986 cp_parser_pseudo_destructor_name (parser, &s, &type);
4988 && (cp_parser_error_occurred (parser)
4989 || TREE_CODE (type) != TYPE_DECL
4990 || !SCALAR_TYPE_P (TREE_TYPE (type))))
4991 cp_parser_abort_tentative_parse (parser);
4992 else if (cp_parser_parse_definitely (parser))
4994 pseudo_destructor_p = true;
4996 = finish_pseudo_destructor_expr (postfix_expression,
4997 s, TREE_TYPE (type));
5001 if (!pseudo_destructor_p)
5003 /* If the SCOPE is not a scalar type, we are looking at an
5004 ordinary class member access expression, rather than a
5005 pseudo-destructor-name. */
5007 cp_token *token = cp_lexer_peek_token (parser->lexer);
5008 /* Parse the id-expression. */
5009 name = (cp_parser_id_expression
5011 cp_parser_optional_template_keyword (parser),
5012 /*check_dependency_p=*/true,
5014 /*declarator_p=*/false,
5015 /*optional_p=*/false));
5016 /* In general, build a SCOPE_REF if the member name is qualified.
5017 However, if the name was not dependent and has already been
5018 resolved; there is no need to build the SCOPE_REF. For example;
5020 struct X { void f(); };
5021 template <typename T> void f(T* t) { t->X::f(); }
5023 Even though "t" is dependent, "X::f" is not and has been resolved
5024 to a BASELINK; there is no need to include scope information. */
5026 /* But we do need to remember that there was an explicit scope for
5027 virtual function calls. */
5029 *idk = CP_ID_KIND_QUALIFIED;
5031 /* If the name is a template-id that names a type, we will get a
5032 TYPE_DECL here. That is invalid code. */
5033 if (TREE_CODE (name) == TYPE_DECL)
5035 error ("%Hinvalid use of %qD", &token->location, name);
5036 postfix_expression = error_mark_node;
5040 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
5042 name = build_qualified_name (/*type=*/NULL_TREE,
5046 parser->scope = NULL_TREE;
5047 parser->qualifying_scope = NULL_TREE;
5048 parser->object_scope = NULL_TREE;
5050 if (scope && name && BASELINK_P (name))
5051 adjust_result_of_qualified_name_lookup
5052 (name, BINFO_TYPE (BASELINK_ACCESS_BINFO (name)), scope);
5054 = finish_class_member_access_expr (postfix_expression, name,
5056 tf_warning_or_error);
5060 /* We no longer need to look up names in the scope of the object on
5061 the left-hand side of the `.' or `->' operator. */
5062 parser->context->object_type = NULL_TREE;
5064 /* Outside of offsetof, these operators may not appear in
5065 constant-expressions. */
5067 && (cp_parser_non_integral_constant_expression
5068 (parser, token_type == CPP_DEREF ? "%<->%>" : "%<.%>")))
5069 postfix_expression = error_mark_node;
5071 return postfix_expression;
5074 /* Parse a parenthesized expression-list.
5077 assignment-expression
5078 expression-list, assignment-expression
5083 identifier, expression-list
5085 CAST_P is true if this expression is the target of a cast.
5087 ALLOW_EXPANSION_P is true if this expression allows expansion of an
5090 Returns a TREE_LIST. The TREE_VALUE of each node is a
5091 representation of an assignment-expression. Note that a TREE_LIST
5092 is returned even if there is only a single expression in the list.
5093 error_mark_node is returned if the ( and or ) are
5094 missing. NULL_TREE is returned on no expressions. The parentheses
5095 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
5096 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
5097 indicates whether or not all of the expressions in the list were
5101 cp_parser_parenthesized_expression_list (cp_parser* parser,
5102 bool is_attribute_list,
5104 bool allow_expansion_p,
5105 bool *non_constant_p)
5107 tree expression_list = NULL_TREE;
5108 bool fold_expr_p = is_attribute_list;
5109 tree identifier = NULL_TREE;
5110 bool saved_greater_than_is_operator_p;
5112 /* Assume all the expressions will be constant. */
5114 *non_constant_p = false;
5116 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
5117 return error_mark_node;
5119 /* Within a parenthesized expression, a `>' token is always
5120 the greater-than operator. */
5121 saved_greater_than_is_operator_p
5122 = parser->greater_than_is_operator_p;
5123 parser->greater_than_is_operator_p = true;
5125 /* Consume expressions until there are no more. */
5126 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
5131 /* At the beginning of attribute lists, check to see if the
5132 next token is an identifier. */
5133 if (is_attribute_list
5134 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
5138 /* Consume the identifier. */
5139 token = cp_lexer_consume_token (parser->lexer);
5140 /* Save the identifier. */
5141 identifier = token->u.value;
5145 bool expr_non_constant_p;
5147 /* Parse the next assignment-expression. */
5148 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5150 /* A braced-init-list. */
5151 maybe_warn_cpp0x ("extended initializer lists");
5152 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
5153 if (non_constant_p && expr_non_constant_p)
5154 *non_constant_p = true;
5156 else if (non_constant_p)
5158 expr = (cp_parser_constant_expression
5159 (parser, /*allow_non_constant_p=*/true,
5160 &expr_non_constant_p));
5161 if (expr_non_constant_p)
5162 *non_constant_p = true;
5165 expr = cp_parser_assignment_expression (parser, cast_p);
5168 expr = fold_non_dependent_expr (expr);
5170 /* If we have an ellipsis, then this is an expression
5172 if (allow_expansion_p
5173 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
5175 /* Consume the `...'. */
5176 cp_lexer_consume_token (parser->lexer);
5178 /* Build the argument pack. */
5179 expr = make_pack_expansion (expr);
5182 /* Add it to the list. We add error_mark_node
5183 expressions to the list, so that we can still tell if
5184 the correct form for a parenthesized expression-list
5185 is found. That gives better errors. */
5186 expression_list = tree_cons (NULL_TREE, expr, expression_list);
5188 if (expr == error_mark_node)
5192 /* After the first item, attribute lists look the same as
5193 expression lists. */
5194 is_attribute_list = false;
5197 /* If the next token isn't a `,', then we are done. */
5198 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5201 /* Otherwise, consume the `,' and keep going. */
5202 cp_lexer_consume_token (parser->lexer);
5205 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
5210 /* We try and resync to an unnested comma, as that will give the
5211 user better diagnostics. */
5212 ending = cp_parser_skip_to_closing_parenthesis (parser,
5213 /*recovering=*/true,
5215 /*consume_paren=*/true);
5220 parser->greater_than_is_operator_p
5221 = saved_greater_than_is_operator_p;
5222 return error_mark_node;
5226 parser->greater_than_is_operator_p
5227 = saved_greater_than_is_operator_p;
5229 /* We built up the list in reverse order so we must reverse it now. */
5230 expression_list = nreverse (expression_list);
5232 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
5234 return expression_list;
5237 /* Parse a pseudo-destructor-name.
5239 pseudo-destructor-name:
5240 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
5241 :: [opt] nested-name-specifier template template-id :: ~ type-name
5242 :: [opt] nested-name-specifier [opt] ~ type-name
5244 If either of the first two productions is used, sets *SCOPE to the
5245 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
5246 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
5247 or ERROR_MARK_NODE if the parse fails. */
5250 cp_parser_pseudo_destructor_name (cp_parser* parser,
5254 bool nested_name_specifier_p;
5256 /* Assume that things will not work out. */
5257 *type = error_mark_node;
5259 /* Look for the optional `::' operator. */
5260 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
5261 /* Look for the optional nested-name-specifier. */
5262 nested_name_specifier_p
5263 = (cp_parser_nested_name_specifier_opt (parser,
5264 /*typename_keyword_p=*/false,
5265 /*check_dependency_p=*/true,
5267 /*is_declaration=*/true)
5269 /* Now, if we saw a nested-name-specifier, we might be doing the
5270 second production. */
5271 if (nested_name_specifier_p
5272 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
5274 /* Consume the `template' keyword. */
5275 cp_lexer_consume_token (parser->lexer);
5276 /* Parse the template-id. */
5277 cp_parser_template_id (parser,
5278 /*template_keyword_p=*/true,
5279 /*check_dependency_p=*/false,
5280 /*is_declaration=*/true);
5281 /* Look for the `::' token. */
5282 cp_parser_require (parser, CPP_SCOPE, "%<::%>");
5284 /* If the next token is not a `~', then there might be some
5285 additional qualification. */
5286 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
5288 /* At this point, we're looking for "type-name :: ~". The type-name
5289 must not be a class-name, since this is a pseudo-destructor. So,
5290 it must be either an enum-name, or a typedef-name -- both of which
5291 are just identifiers. So, we peek ahead to check that the "::"
5292 and "~" tokens are present; if they are not, then we can avoid
5293 calling type_name. */
5294 if (cp_lexer_peek_token (parser->lexer)->type != CPP_NAME
5295 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE
5296 || cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_COMPL)
5298 cp_parser_error (parser, "non-scalar type");
5302 /* Look for the type-name. */
5303 *scope = TREE_TYPE (cp_parser_nonclass_name (parser));
5304 if (*scope == error_mark_node)
5307 /* Look for the `::' token. */
5308 cp_parser_require (parser, CPP_SCOPE, "%<::%>");
5313 /* Look for the `~'. */
5314 cp_parser_require (parser, CPP_COMPL, "%<~%>");
5315 /* Look for the type-name again. We are not responsible for
5316 checking that it matches the first type-name. */
5317 *type = cp_parser_nonclass_name (parser);
5320 /* Parse a unary-expression.
5326 unary-operator cast-expression
5327 sizeof unary-expression
5335 __extension__ cast-expression
5336 __alignof__ unary-expression
5337 __alignof__ ( type-id )
5338 __real__ cast-expression
5339 __imag__ cast-expression
5342 ADDRESS_P is true iff the unary-expression is appearing as the
5343 operand of the `&' operator. CAST_P is true if this expression is
5344 the target of a cast.
5346 Returns a representation of the expression. */
5349 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p)
5352 enum tree_code unary_operator;
5354 /* Peek at the next token. */
5355 token = cp_lexer_peek_token (parser->lexer);
5356 /* Some keywords give away the kind of expression. */
5357 if (token->type == CPP_KEYWORD)
5359 enum rid keyword = token->keyword;
5369 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
5370 /* Consume the token. */
5371 cp_lexer_consume_token (parser->lexer);
5372 /* Parse the operand. */
5373 operand = cp_parser_sizeof_operand (parser, keyword);
5375 if (TYPE_P (operand))
5376 return cxx_sizeof_or_alignof_type (operand, op, true);
5378 return cxx_sizeof_or_alignof_expr (operand, op, true);
5382 return cp_parser_new_expression (parser);
5385 return cp_parser_delete_expression (parser);
5389 /* The saved value of the PEDANTIC flag. */
5393 /* Save away the PEDANTIC flag. */
5394 cp_parser_extension_opt (parser, &saved_pedantic);
5395 /* Parse the cast-expression. */
5396 expr = cp_parser_simple_cast_expression (parser);
5397 /* Restore the PEDANTIC flag. */
5398 pedantic = saved_pedantic;
5408 /* Consume the `__real__' or `__imag__' token. */
5409 cp_lexer_consume_token (parser->lexer);
5410 /* Parse the cast-expression. */
5411 expression = cp_parser_simple_cast_expression (parser);
5412 /* Create the complete representation. */
5413 return build_x_unary_op ((keyword == RID_REALPART
5414 ? REALPART_EXPR : IMAGPART_EXPR),
5416 tf_warning_or_error);
5425 /* Look for the `:: new' and `:: delete', which also signal the
5426 beginning of a new-expression, or delete-expression,
5427 respectively. If the next token is `::', then it might be one of
5429 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
5433 /* See if the token after the `::' is one of the keywords in
5434 which we're interested. */
5435 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
5436 /* If it's `new', we have a new-expression. */
5437 if (keyword == RID_NEW)
5438 return cp_parser_new_expression (parser);
5439 /* Similarly, for `delete'. */
5440 else if (keyword == RID_DELETE)
5441 return cp_parser_delete_expression (parser);
5444 /* Look for a unary operator. */
5445 unary_operator = cp_parser_unary_operator (token);
5446 /* The `++' and `--' operators can be handled similarly, even though
5447 they are not technically unary-operators in the grammar. */
5448 if (unary_operator == ERROR_MARK)
5450 if (token->type == CPP_PLUS_PLUS)
5451 unary_operator = PREINCREMENT_EXPR;
5452 else if (token->type == CPP_MINUS_MINUS)
5453 unary_operator = PREDECREMENT_EXPR;
5454 /* Handle the GNU address-of-label extension. */
5455 else if (cp_parser_allow_gnu_extensions_p (parser)
5456 && token->type == CPP_AND_AND)
5460 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
5462 /* Consume the '&&' token. */
5463 cp_lexer_consume_token (parser->lexer);
5464 /* Look for the identifier. */
5465 identifier = cp_parser_identifier (parser);
5466 /* Create an expression representing the address. */
5467 expression = finish_label_address_expr (identifier, loc);
5468 if (cp_parser_non_integral_constant_expression (parser,
5469 "the address of a label"))
5470 expression = error_mark_node;
5474 if (unary_operator != ERROR_MARK)
5476 tree cast_expression;
5477 tree expression = error_mark_node;
5478 const char *non_constant_p = NULL;
5480 /* Consume the operator token. */
5481 token = cp_lexer_consume_token (parser->lexer);
5482 /* Parse the cast-expression. */
5484 = cp_parser_cast_expression (parser,
5485 unary_operator == ADDR_EXPR,
5487 /* Now, build an appropriate representation. */
5488 switch (unary_operator)
5491 non_constant_p = "%<*%>";
5492 expression = build_x_indirect_ref (cast_expression, "unary *",
5493 tf_warning_or_error);
5497 non_constant_p = "%<&%>";
5500 expression = build_x_unary_op (unary_operator, cast_expression,
5501 tf_warning_or_error);
5504 case PREINCREMENT_EXPR:
5505 case PREDECREMENT_EXPR:
5506 non_constant_p = (unary_operator == PREINCREMENT_EXPR
5507 ? "%<++%>" : "%<--%>");
5509 case UNARY_PLUS_EXPR:
5511 case TRUTH_NOT_EXPR:
5512 expression = finish_unary_op_expr (unary_operator, cast_expression);
5520 && cp_parser_non_integral_constant_expression (parser,
5522 expression = error_mark_node;
5527 return cp_parser_postfix_expression (parser, address_p, cast_p,
5528 /*member_access_only_p=*/false);
5531 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5532 unary-operator, the corresponding tree code is returned. */
5534 static enum tree_code
5535 cp_parser_unary_operator (cp_token* token)
5537 switch (token->type)
5540 return INDIRECT_REF;
5546 return UNARY_PLUS_EXPR;
5552 return TRUTH_NOT_EXPR;
5555 return BIT_NOT_EXPR;
5562 /* Parse a new-expression.
5565 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5566 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5568 Returns a representation of the expression. */
5571 cp_parser_new_expression (cp_parser* parser)
5573 bool global_scope_p;
5579 /* Look for the optional `::' operator. */
5581 = (cp_parser_global_scope_opt (parser,
5582 /*current_scope_valid_p=*/false)
5584 /* Look for the `new' operator. */
5585 cp_parser_require_keyword (parser, RID_NEW, "%<new%>");
5586 /* There's no easy way to tell a new-placement from the
5587 `( type-id )' construct. */
5588 cp_parser_parse_tentatively (parser);
5589 /* Look for a new-placement. */
5590 placement = cp_parser_new_placement (parser);
5591 /* If that didn't work out, there's no new-placement. */
5592 if (!cp_parser_parse_definitely (parser))
5593 placement = NULL_TREE;
5595 /* If the next token is a `(', then we have a parenthesized
5597 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5600 /* Consume the `('. */
5601 cp_lexer_consume_token (parser->lexer);
5602 /* Parse the type-id. */
5603 type = cp_parser_type_id (parser);
5604 /* Look for the closing `)'. */
5605 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
5606 token = cp_lexer_peek_token (parser->lexer);
5607 /* There should not be a direct-new-declarator in this production,
5608 but GCC used to allowed this, so we check and emit a sensible error
5609 message for this case. */
5610 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5612 error ("%Harray bound forbidden after parenthesized type-id",
5614 inform (token->location,
5615 "try removing the parentheses around the type-id");
5616 cp_parser_direct_new_declarator (parser);
5620 /* Otherwise, there must be a new-type-id. */
5622 type = cp_parser_new_type_id (parser, &nelts);
5624 /* If the next token is a `(' or '{', then we have a new-initializer. */
5625 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
5626 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5627 initializer = cp_parser_new_initializer (parser);
5629 initializer = NULL_TREE;
5631 /* A new-expression may not appear in an integral constant
5633 if (cp_parser_non_integral_constant_expression (parser, "%<new%>"))
5634 return error_mark_node;
5636 /* Create a representation of the new-expression. */
5637 return build_new (placement, type, nelts, initializer, global_scope_p,
5638 tf_warning_or_error);
5641 /* Parse a new-placement.
5646 Returns the same representation as for an expression-list. */
5649 cp_parser_new_placement (cp_parser* parser)
5651 tree expression_list;
5653 /* Parse the expression-list. */
5654 expression_list = (cp_parser_parenthesized_expression_list
5655 (parser, false, /*cast_p=*/false, /*allow_expansion_p=*/true,
5656 /*non_constant_p=*/NULL));
5658 return expression_list;
5661 /* Parse a new-type-id.
5664 type-specifier-seq new-declarator [opt]
5666 Returns the TYPE allocated. If the new-type-id indicates an array
5667 type, *NELTS is set to the number of elements in the last array
5668 bound; the TYPE will not include the last array bound. */
5671 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
5673 cp_decl_specifier_seq type_specifier_seq;
5674 cp_declarator *new_declarator;
5675 cp_declarator *declarator;
5676 cp_declarator *outer_declarator;
5677 const char *saved_message;
5680 /* The type-specifier sequence must not contain type definitions.
5681 (It cannot contain declarations of new types either, but if they
5682 are not definitions we will catch that because they are not
5684 saved_message = parser->type_definition_forbidden_message;
5685 parser->type_definition_forbidden_message
5686 = "types may not be defined in a new-type-id";
5687 /* Parse the type-specifier-seq. */
5688 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
5689 &type_specifier_seq);
5690 /* Restore the old message. */
5691 parser->type_definition_forbidden_message = saved_message;
5692 /* Parse the new-declarator. */
5693 new_declarator = cp_parser_new_declarator_opt (parser);
5695 /* Determine the number of elements in the last array dimension, if
5698 /* Skip down to the last array dimension. */
5699 declarator = new_declarator;
5700 outer_declarator = NULL;
5701 while (declarator && (declarator->kind == cdk_pointer
5702 || declarator->kind == cdk_ptrmem))
5704 outer_declarator = declarator;
5705 declarator = declarator->declarator;
5708 && declarator->kind == cdk_array
5709 && declarator->declarator
5710 && declarator->declarator->kind == cdk_array)
5712 outer_declarator = declarator;
5713 declarator = declarator->declarator;
5716 if (declarator && declarator->kind == cdk_array)
5718 *nelts = declarator->u.array.bounds;
5719 if (*nelts == error_mark_node)
5720 *nelts = integer_one_node;
5722 if (outer_declarator)
5723 outer_declarator->declarator = declarator->declarator;
5725 new_declarator = NULL;
5728 type = groktypename (&type_specifier_seq, new_declarator);
5732 /* Parse an (optional) new-declarator.
5735 ptr-operator new-declarator [opt]
5736 direct-new-declarator
5738 Returns the declarator. */
5740 static cp_declarator *
5741 cp_parser_new_declarator_opt (cp_parser* parser)
5743 enum tree_code code;
5745 cp_cv_quals cv_quals;
5747 /* We don't know if there's a ptr-operator next, or not. */
5748 cp_parser_parse_tentatively (parser);
5749 /* Look for a ptr-operator. */
5750 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
5751 /* If that worked, look for more new-declarators. */
5752 if (cp_parser_parse_definitely (parser))
5754 cp_declarator *declarator;
5756 /* Parse another optional declarator. */
5757 declarator = cp_parser_new_declarator_opt (parser);
5759 return cp_parser_make_indirect_declarator
5760 (code, type, cv_quals, declarator);
5763 /* If the next token is a `[', there is a direct-new-declarator. */
5764 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5765 return cp_parser_direct_new_declarator (parser);
5770 /* Parse a direct-new-declarator.
5772 direct-new-declarator:
5774 direct-new-declarator [constant-expression]
5778 static cp_declarator *
5779 cp_parser_direct_new_declarator (cp_parser* parser)
5781 cp_declarator *declarator = NULL;
5787 /* Look for the opening `['. */
5788 cp_parser_require (parser, CPP_OPEN_SQUARE, "%<[%>");
5789 /* The first expression is not required to be constant. */
5792 cp_token *token = cp_lexer_peek_token (parser->lexer);
5793 expression = cp_parser_expression (parser, /*cast_p=*/false);
5794 /* The standard requires that the expression have integral
5795 type. DR 74 adds enumeration types. We believe that the
5796 real intent is that these expressions be handled like the
5797 expression in a `switch' condition, which also allows
5798 classes with a single conversion to integral or
5799 enumeration type. */
5800 if (!processing_template_decl)
5803 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5808 error ("%Hexpression in new-declarator must have integral "
5809 "or enumeration type", &token->location);
5810 expression = error_mark_node;
5814 /* But all the other expressions must be. */
5817 = cp_parser_constant_expression (parser,
5818 /*allow_non_constant=*/false,
5820 /* Look for the closing `]'. */
5821 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
5823 /* Add this bound to the declarator. */
5824 declarator = make_array_declarator (declarator, expression);
5826 /* If the next token is not a `[', then there are no more
5828 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5835 /* Parse a new-initializer.
5838 ( expression-list [opt] )
5841 Returns a representation of the expression-list. If there is no
5842 expression-list, VOID_ZERO_NODE is returned. */
5845 cp_parser_new_initializer (cp_parser* parser)
5847 tree expression_list;
5849 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5851 bool expr_non_constant_p;
5852 maybe_warn_cpp0x ("extended initializer lists");
5853 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
5854 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
5855 expression_list = build_tree_list (NULL_TREE, expression_list);
5858 expression_list = (cp_parser_parenthesized_expression_list
5859 (parser, false, /*cast_p=*/false, /*allow_expansion_p=*/true,
5860 /*non_constant_p=*/NULL));
5861 if (!expression_list)
5862 expression_list = void_zero_node;
5864 return expression_list;
5867 /* Parse a delete-expression.
5870 :: [opt] delete cast-expression
5871 :: [opt] delete [ ] cast-expression
5873 Returns a representation of the expression. */
5876 cp_parser_delete_expression (cp_parser* parser)
5878 bool global_scope_p;
5882 /* Look for the optional `::' operator. */
5884 = (cp_parser_global_scope_opt (parser,
5885 /*current_scope_valid_p=*/false)
5887 /* Look for the `delete' keyword. */
5888 cp_parser_require_keyword (parser, RID_DELETE, "%<delete%>");
5889 /* See if the array syntax is in use. */
5890 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5892 /* Consume the `[' token. */
5893 cp_lexer_consume_token (parser->lexer);
5894 /* Look for the `]' token. */
5895 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
5896 /* Remember that this is the `[]' construct. */
5902 /* Parse the cast-expression. */
5903 expression = cp_parser_simple_cast_expression (parser);
5905 /* A delete-expression may not appear in an integral constant
5907 if (cp_parser_non_integral_constant_expression (parser, "%<delete%>"))
5908 return error_mark_node;
5910 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5913 /* Parse a cast-expression.
5917 ( type-id ) cast-expression
5919 ADDRESS_P is true iff the unary-expression is appearing as the
5920 operand of the `&' operator. CAST_P is true if this expression is
5921 the target of a cast.
5923 Returns a representation of the expression. */
5926 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p)
5928 /* If it's a `(', then we might be looking at a cast. */
5929 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5931 tree type = NULL_TREE;
5932 tree expr = NULL_TREE;
5933 bool compound_literal_p;
5934 const char *saved_message;
5936 /* There's no way to know yet whether or not this is a cast.
5937 For example, `(int (3))' is a unary-expression, while `(int)
5938 3' is a cast. So, we resort to parsing tentatively. */
5939 cp_parser_parse_tentatively (parser);
5940 /* Types may not be defined in a cast. */
5941 saved_message = parser->type_definition_forbidden_message;
5942 parser->type_definition_forbidden_message
5943 = "types may not be defined in casts";
5944 /* Consume the `('. */
5945 cp_lexer_consume_token (parser->lexer);
5946 /* A very tricky bit is that `(struct S) { 3 }' is a
5947 compound-literal (which we permit in C++ as an extension).
5948 But, that construct is not a cast-expression -- it is a
5949 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5950 is legal; if the compound-literal were a cast-expression,
5951 you'd need an extra set of parentheses.) But, if we parse
5952 the type-id, and it happens to be a class-specifier, then we
5953 will commit to the parse at that point, because we cannot
5954 undo the action that is done when creating a new class. So,
5955 then we cannot back up and do a postfix-expression.
5957 Therefore, we scan ahead to the closing `)', and check to see
5958 if the token after the `)' is a `{'. If so, we are not
5959 looking at a cast-expression.
5961 Save tokens so that we can put them back. */
5962 cp_lexer_save_tokens (parser->lexer);
5963 /* Skip tokens until the next token is a closing parenthesis.
5964 If we find the closing `)', and the next token is a `{', then
5965 we are looking at a compound-literal. */
5967 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5968 /*consume_paren=*/true)
5969 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5970 /* Roll back the tokens we skipped. */
5971 cp_lexer_rollback_tokens (parser->lexer);
5972 /* If we were looking at a compound-literal, simulate an error
5973 so that the call to cp_parser_parse_definitely below will
5975 if (compound_literal_p)
5976 cp_parser_simulate_error (parser);
5979 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5980 parser->in_type_id_in_expr_p = true;
5981 /* Look for the type-id. */
5982 type = cp_parser_type_id (parser);
5983 /* Look for the closing `)'. */
5984 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
5985 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5988 /* Restore the saved message. */
5989 parser->type_definition_forbidden_message = saved_message;
5991 /* If ok so far, parse the dependent expression. We cannot be
5992 sure it is a cast. Consider `(T ())'. It is a parenthesized
5993 ctor of T, but looks like a cast to function returning T
5994 without a dependent expression. */
5995 if (!cp_parser_error_occurred (parser))
5996 expr = cp_parser_cast_expression (parser,
5997 /*address_p=*/false,
6000 if (cp_parser_parse_definitely (parser))
6002 /* Warn about old-style casts, if so requested. */
6003 if (warn_old_style_cast
6004 && !in_system_header
6005 && !VOID_TYPE_P (type)
6006 && current_lang_name != lang_name_c)
6007 warning (OPT_Wold_style_cast, "use of old-style cast");
6009 /* Only type conversions to integral or enumeration types
6010 can be used in constant-expressions. */
6011 if (!cast_valid_in_integral_constant_expression_p (type)
6012 && (cp_parser_non_integral_constant_expression
6014 "a cast to a type other than an integral or "
6015 "enumeration type")))
6016 return error_mark_node;
6018 /* Perform the cast. */
6019 expr = build_c_cast (type, expr);
6024 /* If we get here, then it's not a cast, so it must be a
6025 unary-expression. */
6026 return cp_parser_unary_expression (parser, address_p, cast_p);
6029 /* Parse a binary expression of the general form:
6033 pm-expression .* cast-expression
6034 pm-expression ->* cast-expression
6036 multiplicative-expression:
6038 multiplicative-expression * pm-expression
6039 multiplicative-expression / pm-expression
6040 multiplicative-expression % pm-expression
6042 additive-expression:
6043 multiplicative-expression
6044 additive-expression + multiplicative-expression
6045 additive-expression - multiplicative-expression
6049 shift-expression << additive-expression
6050 shift-expression >> additive-expression
6052 relational-expression:
6054 relational-expression < shift-expression
6055 relational-expression > shift-expression
6056 relational-expression <= shift-expression
6057 relational-expression >= shift-expression
6061 relational-expression:
6062 relational-expression <? shift-expression
6063 relational-expression >? shift-expression
6065 equality-expression:
6066 relational-expression
6067 equality-expression == relational-expression
6068 equality-expression != relational-expression
6072 and-expression & equality-expression
6074 exclusive-or-expression:
6076 exclusive-or-expression ^ and-expression
6078 inclusive-or-expression:
6079 exclusive-or-expression
6080 inclusive-or-expression | exclusive-or-expression
6082 logical-and-expression:
6083 inclusive-or-expression
6084 logical-and-expression && inclusive-or-expression
6086 logical-or-expression:
6087 logical-and-expression
6088 logical-or-expression || logical-and-expression
6090 All these are implemented with a single function like:
6093 simple-cast-expression
6094 binary-expression <token> binary-expression
6096 CAST_P is true if this expression is the target of a cast.
6098 The binops_by_token map is used to get the tree codes for each <token> type.
6099 binary-expressions are associated according to a precedence table. */
6101 #define TOKEN_PRECEDENCE(token) \
6102 (((token->type == CPP_GREATER \
6103 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
6104 && !parser->greater_than_is_operator_p) \
6105 ? PREC_NOT_OPERATOR \
6106 : binops_by_token[token->type].prec)
6109 cp_parser_binary_expression (cp_parser* parser, bool cast_p,
6110 enum cp_parser_prec prec)
6112 cp_parser_expression_stack stack;
6113 cp_parser_expression_stack_entry *sp = &stack[0];
6116 enum tree_code tree_type, lhs_type, rhs_type;
6117 enum cp_parser_prec new_prec, lookahead_prec;
6120 /* Parse the first expression. */
6121 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p);
6122 lhs_type = ERROR_MARK;
6126 /* Get an operator token. */
6127 token = cp_lexer_peek_token (parser->lexer);
6129 if (warn_cxx0x_compat
6130 && token->type == CPP_RSHIFT
6131 && !parser->greater_than_is_operator_p)
6133 warning (OPT_Wc__0x_compat,
6134 "%H%<>>%> operator will be treated as two right angle brackets in C++0x",
6136 warning (OPT_Wc__0x_compat,
6137 "suggest parentheses around %<>>%> expression");
6140 new_prec = TOKEN_PRECEDENCE (token);
6142 /* Popping an entry off the stack means we completed a subexpression:
6143 - either we found a token which is not an operator (`>' where it is not
6144 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
6145 will happen repeatedly;
6146 - or, we found an operator which has lower priority. This is the case
6147 where the recursive descent *ascends*, as in `3 * 4 + 5' after
6149 if (new_prec <= prec)
6158 tree_type = binops_by_token[token->type].tree_type;
6160 /* We used the operator token. */
6161 cp_lexer_consume_token (parser->lexer);
6163 /* Extract another operand. It may be the RHS of this expression
6164 or the LHS of a new, higher priority expression. */
6165 rhs = cp_parser_simple_cast_expression (parser);
6166 rhs_type = ERROR_MARK;
6168 /* Get another operator token. Look up its precedence to avoid
6169 building a useless (immediately popped) stack entry for common
6170 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
6171 token = cp_lexer_peek_token (parser->lexer);
6172 lookahead_prec = TOKEN_PRECEDENCE (token);
6173 if (lookahead_prec > new_prec)
6175 /* ... and prepare to parse the RHS of the new, higher priority
6176 expression. Since precedence levels on the stack are
6177 monotonically increasing, we do not have to care about
6180 sp->tree_type = tree_type;
6182 sp->lhs_type = lhs_type;
6185 lhs_type = rhs_type;
6187 new_prec = lookahead_prec;
6191 /* If the stack is not empty, we have parsed into LHS the right side
6192 (`4' in the example above) of an expression we had suspended.
6193 We can use the information on the stack to recover the LHS (`3')
6194 from the stack together with the tree code (`MULT_EXPR'), and
6195 the precedence of the higher level subexpression
6196 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
6197 which will be used to actually build the additive expression. */
6200 tree_type = sp->tree_type;
6202 rhs_type = lhs_type;
6204 lhs_type = sp->lhs_type;
6207 overloaded_p = false;
6208 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
6209 &overloaded_p, tf_warning_or_error);
6210 lhs_type = tree_type;
6212 /* If the binary operator required the use of an overloaded operator,
6213 then this expression cannot be an integral constant-expression.
6214 An overloaded operator can be used even if both operands are
6215 otherwise permissible in an integral constant-expression if at
6216 least one of the operands is of enumeration type. */
6219 && (cp_parser_non_integral_constant_expression
6220 (parser, "calls to overloaded operators")))
6221 return error_mark_node;
6228 /* Parse the `? expression : assignment-expression' part of a
6229 conditional-expression. The LOGICAL_OR_EXPR is the
6230 logical-or-expression that started the conditional-expression.
6231 Returns a representation of the entire conditional-expression.
6233 This routine is used by cp_parser_assignment_expression.
6235 ? expression : assignment-expression
6239 ? : assignment-expression */
6242 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
6245 tree assignment_expr;
6247 /* Consume the `?' token. */
6248 cp_lexer_consume_token (parser->lexer);
6249 if (cp_parser_allow_gnu_extensions_p (parser)
6250 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
6251 /* Implicit true clause. */
6254 /* Parse the expression. */
6255 expr = cp_parser_expression (parser, /*cast_p=*/false);
6257 /* The next token should be a `:'. */
6258 cp_parser_require (parser, CPP_COLON, "%<:%>");
6259 /* Parse the assignment-expression. */
6260 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false);
6262 /* Build the conditional-expression. */
6263 return build_x_conditional_expr (logical_or_expr,
6266 tf_warning_or_error);
6269 /* Parse an assignment-expression.
6271 assignment-expression:
6272 conditional-expression
6273 logical-or-expression assignment-operator assignment_expression
6276 CAST_P is true if this expression is the target of a cast.
6278 Returns a representation for the expression. */
6281 cp_parser_assignment_expression (cp_parser* parser, bool cast_p)
6285 /* If the next token is the `throw' keyword, then we're looking at
6286 a throw-expression. */
6287 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
6288 expr = cp_parser_throw_expression (parser);
6289 /* Otherwise, it must be that we are looking at a
6290 logical-or-expression. */
6293 /* Parse the binary expressions (logical-or-expression). */
6294 expr = cp_parser_binary_expression (parser, cast_p, PREC_NOT_OPERATOR);
6295 /* If the next token is a `?' then we're actually looking at a
6296 conditional-expression. */
6297 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
6298 return cp_parser_question_colon_clause (parser, expr);
6301 enum tree_code assignment_operator;
6303 /* If it's an assignment-operator, we're using the second
6306 = cp_parser_assignment_operator_opt (parser);
6307 if (assignment_operator != ERROR_MARK)
6309 bool non_constant_p;
6311 /* Parse the right-hand side of the assignment. */
6312 tree rhs = cp_parser_initializer_clause (parser, &non_constant_p);
6314 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6315 maybe_warn_cpp0x ("extended initializer lists");
6317 /* An assignment may not appear in a
6318 constant-expression. */
6319 if (cp_parser_non_integral_constant_expression (parser,
6321 return error_mark_node;
6322 /* Build the assignment expression. */
6323 expr = build_x_modify_expr (expr,
6324 assignment_operator,
6326 tf_warning_or_error);
6334 /* Parse an (optional) assignment-operator.
6336 assignment-operator: one of
6337 = *= /= %= += -= >>= <<= &= ^= |=
6341 assignment-operator: one of
6344 If the next token is an assignment operator, the corresponding tree
6345 code is returned, and the token is consumed. For example, for
6346 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
6347 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
6348 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
6349 operator, ERROR_MARK is returned. */
6351 static enum tree_code
6352 cp_parser_assignment_operator_opt (cp_parser* parser)
6357 /* Peek at the next token. */
6358 token = cp_lexer_peek_token (parser->lexer);
6360 switch (token->type)
6371 op = TRUNC_DIV_EXPR;
6375 op = TRUNC_MOD_EXPR;
6407 /* Nothing else is an assignment operator. */
6411 /* If it was an assignment operator, consume it. */
6412 if (op != ERROR_MARK)
6413 cp_lexer_consume_token (parser->lexer);
6418 /* Parse an expression.
6421 assignment-expression
6422 expression , assignment-expression
6424 CAST_P is true if this expression is the target of a cast.
6426 Returns a representation of the expression. */
6429 cp_parser_expression (cp_parser* parser, bool cast_p)
6431 tree expression = NULL_TREE;
6435 tree assignment_expression;
6437 /* Parse the next assignment-expression. */
6438 assignment_expression
6439 = cp_parser_assignment_expression (parser, cast_p);
6440 /* If this is the first assignment-expression, we can just
6443 expression = assignment_expression;
6445 expression = build_x_compound_expr (expression,
6446 assignment_expression,
6447 tf_warning_or_error);
6448 /* If the next token is not a comma, then we are done with the
6450 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6452 /* Consume the `,'. */
6453 cp_lexer_consume_token (parser->lexer);
6454 /* A comma operator cannot appear in a constant-expression. */
6455 if (cp_parser_non_integral_constant_expression (parser,
6456 "a comma operator"))
6457 expression = error_mark_node;
6463 /* Parse a constant-expression.
6465 constant-expression:
6466 conditional-expression
6468 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
6469 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
6470 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
6471 is false, NON_CONSTANT_P should be NULL. */
6474 cp_parser_constant_expression (cp_parser* parser,
6475 bool allow_non_constant_p,
6476 bool *non_constant_p)
6478 bool saved_integral_constant_expression_p;
6479 bool saved_allow_non_integral_constant_expression_p;
6480 bool saved_non_integral_constant_expression_p;
6483 /* It might seem that we could simply parse the
6484 conditional-expression, and then check to see if it were
6485 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
6486 one that the compiler can figure out is constant, possibly after
6487 doing some simplifications or optimizations. The standard has a
6488 precise definition of constant-expression, and we must honor
6489 that, even though it is somewhat more restrictive.
6495 is not a legal declaration, because `(2, 3)' is not a
6496 constant-expression. The `,' operator is forbidden in a
6497 constant-expression. However, GCC's constant-folding machinery
6498 will fold this operation to an INTEGER_CST for `3'. */
6500 /* Save the old settings. */
6501 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
6502 saved_allow_non_integral_constant_expression_p
6503 = parser->allow_non_integral_constant_expression_p;
6504 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
6505 /* We are now parsing a constant-expression. */
6506 parser->integral_constant_expression_p = true;
6507 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
6508 parser->non_integral_constant_expression_p = false;
6509 /* Although the grammar says "conditional-expression", we parse an
6510 "assignment-expression", which also permits "throw-expression"
6511 and the use of assignment operators. In the case that
6512 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
6513 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
6514 actually essential that we look for an assignment-expression.
6515 For example, cp_parser_initializer_clauses uses this function to
6516 determine whether a particular assignment-expression is in fact
6518 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false);
6519 /* Restore the old settings. */
6520 parser->integral_constant_expression_p
6521 = saved_integral_constant_expression_p;
6522 parser->allow_non_integral_constant_expression_p
6523 = saved_allow_non_integral_constant_expression_p;
6524 if (allow_non_constant_p)
6525 *non_constant_p = parser->non_integral_constant_expression_p;
6526 else if (parser->non_integral_constant_expression_p)
6527 expression = error_mark_node;
6528 parser->non_integral_constant_expression_p
6529 = saved_non_integral_constant_expression_p;
6534 /* Parse __builtin_offsetof.
6536 offsetof-expression:
6537 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
6539 offsetof-member-designator:
6541 | offsetof-member-designator "." id-expression
6542 | offsetof-member-designator "[" expression "]" */
6545 cp_parser_builtin_offsetof (cp_parser *parser)
6547 int save_ice_p, save_non_ice_p;
6552 /* We're about to accept non-integral-constant things, but will
6553 definitely yield an integral constant expression. Save and
6554 restore these values around our local parsing. */
6555 save_ice_p = parser->integral_constant_expression_p;
6556 save_non_ice_p = parser->non_integral_constant_expression_p;
6558 /* Consume the "__builtin_offsetof" token. */
6559 cp_lexer_consume_token (parser->lexer);
6560 /* Consume the opening `('. */
6561 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
6562 /* Parse the type-id. */
6563 type = cp_parser_type_id (parser);
6564 /* Look for the `,'. */
6565 cp_parser_require (parser, CPP_COMMA, "%<,%>");
6566 token = cp_lexer_peek_token (parser->lexer);
6568 /* Build the (type *)null that begins the traditional offsetof macro. */
6569 expr = build_static_cast (build_pointer_type (type), null_pointer_node,
6570 tf_warning_or_error);
6572 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
6573 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
6574 true, &dummy, token->location);
6577 token = cp_lexer_peek_token (parser->lexer);
6578 switch (token->type)
6580 case CPP_OPEN_SQUARE:
6581 /* offsetof-member-designator "[" expression "]" */
6582 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
6586 /* offsetof-member-designator "." identifier */
6587 cp_lexer_consume_token (parser->lexer);
6588 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
6593 case CPP_CLOSE_PAREN:
6594 /* Consume the ")" token. */
6595 cp_lexer_consume_token (parser->lexer);
6599 /* Error. We know the following require will fail, but
6600 that gives the proper error message. */
6601 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
6602 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
6603 expr = error_mark_node;
6609 /* If we're processing a template, we can't finish the semantics yet.
6610 Otherwise we can fold the entire expression now. */
6611 if (processing_template_decl)
6612 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
6614 expr = finish_offsetof (expr);
6617 parser->integral_constant_expression_p = save_ice_p;
6618 parser->non_integral_constant_expression_p = save_non_ice_p;
6623 /* Parse a trait expression. */
6626 cp_parser_trait_expr (cp_parser* parser, enum rid keyword)
6629 tree type1, type2 = NULL_TREE;
6630 bool binary = false;
6631 cp_decl_specifier_seq decl_specs;
6635 case RID_HAS_NOTHROW_ASSIGN:
6636 kind = CPTK_HAS_NOTHROW_ASSIGN;
6638 case RID_HAS_NOTHROW_CONSTRUCTOR:
6639 kind = CPTK_HAS_NOTHROW_CONSTRUCTOR;
6641 case RID_HAS_NOTHROW_COPY:
6642 kind = CPTK_HAS_NOTHROW_COPY;
6644 case RID_HAS_TRIVIAL_ASSIGN:
6645 kind = CPTK_HAS_TRIVIAL_ASSIGN;
6647 case RID_HAS_TRIVIAL_CONSTRUCTOR:
6648 kind = CPTK_HAS_TRIVIAL_CONSTRUCTOR;
6650 case RID_HAS_TRIVIAL_COPY:
6651 kind = CPTK_HAS_TRIVIAL_COPY;
6653 case RID_HAS_TRIVIAL_DESTRUCTOR:
6654 kind = CPTK_HAS_TRIVIAL_DESTRUCTOR;
6656 case RID_HAS_VIRTUAL_DESTRUCTOR:
6657 kind = CPTK_HAS_VIRTUAL_DESTRUCTOR;
6659 case RID_IS_ABSTRACT:
6660 kind = CPTK_IS_ABSTRACT;
6662 case RID_IS_BASE_OF:
6663 kind = CPTK_IS_BASE_OF;
6667 kind = CPTK_IS_CLASS;
6669 case RID_IS_CONVERTIBLE_TO:
6670 kind = CPTK_IS_CONVERTIBLE_TO;
6674 kind = CPTK_IS_EMPTY;
6677 kind = CPTK_IS_ENUM;
6682 case RID_IS_POLYMORPHIC:
6683 kind = CPTK_IS_POLYMORPHIC;
6686 kind = CPTK_IS_UNION;
6692 /* Consume the token. */
6693 cp_lexer_consume_token (parser->lexer);
6695 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
6697 type1 = cp_parser_type_id (parser);
6699 if (type1 == error_mark_node)
6700 return error_mark_node;
6702 /* Build a trivial decl-specifier-seq. */
6703 clear_decl_specs (&decl_specs);
6704 decl_specs.type = type1;
6706 /* Call grokdeclarator to figure out what type this is. */
6707 type1 = grokdeclarator (NULL, &decl_specs, TYPENAME,
6708 /*initialized=*/0, /*attrlist=*/NULL);
6712 cp_parser_require (parser, CPP_COMMA, "%<,%>");
6714 type2 = cp_parser_type_id (parser);
6716 if (type2 == error_mark_node)
6717 return error_mark_node;
6719 /* Build a trivial decl-specifier-seq. */
6720 clear_decl_specs (&decl_specs);
6721 decl_specs.type = type2;
6723 /* Call grokdeclarator to figure out what type this is. */
6724 type2 = grokdeclarator (NULL, &decl_specs, TYPENAME,
6725 /*initialized=*/0, /*attrlist=*/NULL);
6728 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
6730 /* Complete the trait expression, which may mean either processing
6731 the trait expr now or saving it for template instantiation. */
6732 return finish_trait_expr (kind, type1, type2);
6735 /* Statements [gram.stmt.stmt] */
6737 /* Parse a statement.
6741 expression-statement
6746 declaration-statement
6749 IN_COMPOUND is true when the statement is nested inside a
6750 cp_parser_compound_statement; this matters for certain pragmas.
6752 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6753 is a (possibly labeled) if statement which is not enclosed in braces
6754 and has an else clause. This is used to implement -Wparentheses. */
6757 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
6758 bool in_compound, bool *if_p)
6762 location_t statement_location;
6767 /* There is no statement yet. */
6768 statement = NULL_TREE;
6769 /* Peek at the next token. */
6770 token = cp_lexer_peek_token (parser->lexer);
6771 /* Remember the location of the first token in the statement. */
6772 statement_location = token->location;
6773 /* If this is a keyword, then that will often determine what kind of
6774 statement we have. */
6775 if (token->type == CPP_KEYWORD)
6777 enum rid keyword = token->keyword;
6783 /* Looks like a labeled-statement with a case label.
6784 Parse the label, and then use tail recursion to parse
6786 cp_parser_label_for_labeled_statement (parser);
6791 statement = cp_parser_selection_statement (parser, if_p);
6797 statement = cp_parser_iteration_statement (parser);
6804 statement = cp_parser_jump_statement (parser);
6807 /* Objective-C++ exception-handling constructs. */
6810 case RID_AT_FINALLY:
6811 case RID_AT_SYNCHRONIZED:
6813 statement = cp_parser_objc_statement (parser);
6817 statement = cp_parser_try_block (parser);
6821 /* This must be a namespace alias definition. */
6822 cp_parser_declaration_statement (parser);
6826 /* It might be a keyword like `int' that can start a
6827 declaration-statement. */
6831 else if (token->type == CPP_NAME)
6833 /* If the next token is a `:', then we are looking at a
6834 labeled-statement. */
6835 token = cp_lexer_peek_nth_token (parser->lexer, 2);
6836 if (token->type == CPP_COLON)
6838 /* Looks like a labeled-statement with an ordinary label.
6839 Parse the label, and then use tail recursion to parse
6841 cp_parser_label_for_labeled_statement (parser);
6845 /* Anything that starts with a `{' must be a compound-statement. */
6846 else if (token->type == CPP_OPEN_BRACE)
6847 statement = cp_parser_compound_statement (parser, NULL, false);
6848 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6849 a statement all its own. */
6850 else if (token->type == CPP_PRAGMA)
6852 /* Only certain OpenMP pragmas are attached to statements, and thus
6853 are considered statements themselves. All others are not. In
6854 the context of a compound, accept the pragma as a "statement" and
6855 return so that we can check for a close brace. Otherwise we
6856 require a real statement and must go back and read one. */
6858 cp_parser_pragma (parser, pragma_compound);
6859 else if (!cp_parser_pragma (parser, pragma_stmt))
6863 else if (token->type == CPP_EOF)
6865 cp_parser_error (parser, "expected statement");
6869 /* Everything else must be a declaration-statement or an
6870 expression-statement. Try for the declaration-statement
6871 first, unless we are looking at a `;', in which case we know that
6872 we have an expression-statement. */
6875 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6877 cp_parser_parse_tentatively (parser);
6878 /* Try to parse the declaration-statement. */
6879 cp_parser_declaration_statement (parser);
6880 /* If that worked, we're done. */
6881 if (cp_parser_parse_definitely (parser))
6884 /* Look for an expression-statement instead. */
6885 statement = cp_parser_expression_statement (parser, in_statement_expr);
6888 /* Set the line number for the statement. */
6889 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
6890 SET_EXPR_LOCATION (statement, statement_location);
6893 /* Parse the label for a labeled-statement, i.e.
6896 case constant-expression :
6900 case constant-expression ... constant-expression : statement
6902 When a label is parsed without errors, the label is added to the
6903 parse tree by the finish_* functions, so this function doesn't
6904 have to return the label. */
6907 cp_parser_label_for_labeled_statement (cp_parser* parser)
6911 /* The next token should be an identifier. */
6912 token = cp_lexer_peek_token (parser->lexer);
6913 if (token->type != CPP_NAME
6914 && token->type != CPP_KEYWORD)
6916 cp_parser_error (parser, "expected labeled-statement");
6920 switch (token->keyword)
6927 /* Consume the `case' token. */
6928 cp_lexer_consume_token (parser->lexer);
6929 /* Parse the constant-expression. */
6930 expr = cp_parser_constant_expression (parser,
6931 /*allow_non_constant_p=*/false,
6934 ellipsis = cp_lexer_peek_token (parser->lexer);
6935 if (ellipsis->type == CPP_ELLIPSIS)
6937 /* Consume the `...' token. */
6938 cp_lexer_consume_token (parser->lexer);
6940 cp_parser_constant_expression (parser,
6941 /*allow_non_constant_p=*/false,
6943 /* We don't need to emit warnings here, as the common code
6944 will do this for us. */
6947 expr_hi = NULL_TREE;
6949 if (parser->in_switch_statement_p)
6950 finish_case_label (expr, expr_hi);
6952 error ("%Hcase label %qE not within a switch statement",
6953 &token->location, expr);
6958 /* Consume the `default' token. */
6959 cp_lexer_consume_token (parser->lexer);
6961 if (parser->in_switch_statement_p)
6962 finish_case_label (NULL_TREE, NULL_TREE);
6964 error ("%Hcase label not within a switch statement", &token->location);
6968 /* Anything else must be an ordinary label. */
6969 finish_label_stmt (cp_parser_identifier (parser));
6973 /* Require the `:' token. */
6974 cp_parser_require (parser, CPP_COLON, "%<:%>");
6977 /* Parse an expression-statement.
6979 expression-statement:
6982 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6983 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6984 indicates whether this expression-statement is part of an
6985 expression statement. */
6988 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6990 tree statement = NULL_TREE;
6992 /* If the next token is a ';', then there is no expression
6994 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6995 statement = cp_parser_expression (parser, /*cast_p=*/false);
6997 /* Consume the final `;'. */
6998 cp_parser_consume_semicolon_at_end_of_statement (parser);
7000 if (in_statement_expr
7001 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
7002 /* This is the final expression statement of a statement
7004 statement = finish_stmt_expr_expr (statement, in_statement_expr);
7006 statement = finish_expr_stmt (statement);
7013 /* Parse a compound-statement.
7016 { statement-seq [opt] }
7021 { label-declaration-seq [opt] statement-seq [opt] }
7023 label-declaration-seq:
7025 label-declaration-seq label-declaration
7027 Returns a tree representing the statement. */
7030 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
7035 /* Consume the `{'. */
7036 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>"))
7037 return error_mark_node;
7038 /* Begin the compound-statement. */
7039 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
7040 /* If the next keyword is `__label__' we have a label declaration. */
7041 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
7042 cp_parser_label_declaration (parser);
7043 /* Parse an (optional) statement-seq. */
7044 cp_parser_statement_seq_opt (parser, in_statement_expr);
7045 /* Finish the compound-statement. */
7046 finish_compound_stmt (compound_stmt);
7047 /* Consume the `}'. */
7048 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
7050 return compound_stmt;
7053 /* Parse an (optional) statement-seq.
7057 statement-seq [opt] statement */
7060 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
7062 /* Scan statements until there aren't any more. */
7065 cp_token *token = cp_lexer_peek_token (parser->lexer);
7067 /* If we're looking at a `}', then we've run out of statements. */
7068 if (token->type == CPP_CLOSE_BRACE
7069 || token->type == CPP_EOF
7070 || token->type == CPP_PRAGMA_EOL)
7073 /* If we are in a compound statement and find 'else' then
7074 something went wrong. */
7075 else if (token->type == CPP_KEYWORD && token->keyword == RID_ELSE)
7077 if (parser->in_statement & IN_IF_STMT)
7081 token = cp_lexer_consume_token (parser->lexer);
7082 error ("%H%<else%> without a previous %<if%>", &token->location);
7086 /* Parse the statement. */
7087 cp_parser_statement (parser, in_statement_expr, true, NULL);
7091 /* Parse a selection-statement.
7093 selection-statement:
7094 if ( condition ) statement
7095 if ( condition ) statement else statement
7096 switch ( condition ) statement
7098 Returns the new IF_STMT or SWITCH_STMT.
7100 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7101 is a (possibly labeled) if statement which is not enclosed in
7102 braces and has an else clause. This is used to implement
7106 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
7114 /* Peek at the next token. */
7115 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
7117 /* See what kind of keyword it is. */
7118 keyword = token->keyword;
7127 /* Look for the `('. */
7128 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
7130 cp_parser_skip_to_end_of_statement (parser);
7131 return error_mark_node;
7134 /* Begin the selection-statement. */
7135 if (keyword == RID_IF)
7136 statement = begin_if_stmt ();
7138 statement = begin_switch_stmt ();
7140 /* Parse the condition. */
7141 condition = cp_parser_condition (parser);
7142 /* Look for the `)'. */
7143 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
7144 cp_parser_skip_to_closing_parenthesis (parser, true, false,
7145 /*consume_paren=*/true);
7147 if (keyword == RID_IF)
7150 unsigned char in_statement;
7152 /* Add the condition. */
7153 finish_if_stmt_cond (condition, statement);
7155 /* Parse the then-clause. */
7156 in_statement = parser->in_statement;
7157 parser->in_statement |= IN_IF_STMT;
7158 cp_parser_implicitly_scoped_statement (parser, &nested_if);
7159 parser->in_statement = in_statement;
7161 finish_then_clause (statement);
7163 /* If the next token is `else', parse the else-clause. */
7164 if (cp_lexer_next_token_is_keyword (parser->lexer,
7167 /* Consume the `else' keyword. */
7168 cp_lexer_consume_token (parser->lexer);
7169 begin_else_clause (statement);
7170 /* Parse the else-clause. */
7171 cp_parser_implicitly_scoped_statement (parser, NULL);
7172 finish_else_clause (statement);
7174 /* If we are currently parsing a then-clause, then
7175 IF_P will not be NULL. We set it to true to
7176 indicate that this if statement has an else clause.
7177 This may trigger the Wparentheses warning below
7178 when we get back up to the parent if statement. */
7184 /* This if statement does not have an else clause. If
7185 NESTED_IF is true, then the then-clause is an if
7186 statement which does have an else clause. We warn
7187 about the potential ambiguity. */
7189 warning (OPT_Wparentheses,
7190 ("%Hsuggest explicit braces "
7191 "to avoid ambiguous %<else%>"),
7192 EXPR_LOCUS (statement));
7195 /* Now we're all done with the if-statement. */
7196 finish_if_stmt (statement);
7200 bool in_switch_statement_p;
7201 unsigned char in_statement;
7203 /* Add the condition. */
7204 finish_switch_cond (condition, statement);
7206 /* Parse the body of the switch-statement. */
7207 in_switch_statement_p = parser->in_switch_statement_p;
7208 in_statement = parser->in_statement;
7209 parser->in_switch_statement_p = true;
7210 parser->in_statement |= IN_SWITCH_STMT;
7211 cp_parser_implicitly_scoped_statement (parser, NULL);
7212 parser->in_switch_statement_p = in_switch_statement_p;
7213 parser->in_statement = in_statement;
7215 /* Now we're all done with the switch-statement. */
7216 finish_switch_stmt (statement);
7224 cp_parser_error (parser, "expected selection-statement");
7225 return error_mark_node;
7229 /* Parse a condition.
7233 type-specifier-seq declarator = initializer-clause
7234 type-specifier-seq declarator braced-init-list
7239 type-specifier-seq declarator asm-specification [opt]
7240 attributes [opt] = assignment-expression
7242 Returns the expression that should be tested. */
7245 cp_parser_condition (cp_parser* parser)
7247 cp_decl_specifier_seq type_specifiers;
7248 const char *saved_message;
7250 /* Try the declaration first. */
7251 cp_parser_parse_tentatively (parser);
7252 /* New types are not allowed in the type-specifier-seq for a
7254 saved_message = parser->type_definition_forbidden_message;
7255 parser->type_definition_forbidden_message
7256 = "types may not be defined in conditions";
7257 /* Parse the type-specifier-seq. */
7258 cp_parser_type_specifier_seq (parser, /*is_condition==*/true,
7260 /* Restore the saved message. */
7261 parser->type_definition_forbidden_message = saved_message;
7262 /* If all is well, we might be looking at a declaration. */
7263 if (!cp_parser_error_occurred (parser))
7266 tree asm_specification;
7268 cp_declarator *declarator;
7269 tree initializer = NULL_TREE;
7271 /* Parse the declarator. */
7272 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
7273 /*ctor_dtor_or_conv_p=*/NULL,
7274 /*parenthesized_p=*/NULL,
7275 /*member_p=*/false);
7276 /* Parse the attributes. */
7277 attributes = cp_parser_attributes_opt (parser);
7278 /* Parse the asm-specification. */
7279 asm_specification = cp_parser_asm_specification_opt (parser);
7280 /* If the next token is not an `=' or '{', then we might still be
7281 looking at an expression. For example:
7285 looks like a decl-specifier-seq and a declarator -- but then
7286 there is no `=', so this is an expression. */
7287 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
7288 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
7289 cp_parser_simulate_error (parser);
7291 /* If we did see an `=' or '{', then we are looking at a declaration
7293 if (cp_parser_parse_definitely (parser))
7296 bool non_constant_p;
7297 bool flags = LOOKUP_ONLYCONVERTING;
7299 /* Create the declaration. */
7300 decl = start_decl (declarator, &type_specifiers,
7301 /*initialized_p=*/true,
7302 attributes, /*prefix_attributes=*/NULL_TREE,
7305 /* Parse the initializer. */
7306 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7308 initializer = cp_parser_braced_list (parser, &non_constant_p);
7309 CONSTRUCTOR_IS_DIRECT_INIT (initializer) = 1;
7314 /* Consume the `='. */
7315 cp_lexer_consume_token (parser->lexer);
7316 initializer = cp_parser_initializer_clause (parser, &non_constant_p);
7318 if (BRACE_ENCLOSED_INITIALIZER_P (initializer))
7319 maybe_warn_cpp0x ("extended initializer lists");
7321 if (!non_constant_p)
7322 initializer = fold_non_dependent_expr (initializer);
7324 /* Process the initializer. */
7325 cp_finish_decl (decl,
7326 initializer, !non_constant_p,
7331 pop_scope (pushed_scope);
7333 return convert_from_reference (decl);
7336 /* If we didn't even get past the declarator successfully, we are
7337 definitely not looking at a declaration. */
7339 cp_parser_abort_tentative_parse (parser);
7341 /* Otherwise, we are looking at an expression. */
7342 return cp_parser_expression (parser, /*cast_p=*/false);
7345 /* We check for a ) immediately followed by ; with no whitespacing
7346 between. This is used to issue a warning for:
7354 as the semicolon is probably extraneous.
7356 On parse errors, the next token might not be a ), so do nothing in
7360 check_empty_body (cp_parser* parser, const char* type)
7363 cp_token *close_paren;
7364 expanded_location close_loc;
7365 expanded_location semi_loc;
7367 close_paren = cp_lexer_peek_token (parser->lexer);
7368 if (close_paren->type != CPP_CLOSE_PAREN)
7371 close_loc = expand_location (close_paren->location);
7372 token = cp_lexer_peek_nth_token (parser->lexer, 2);
7374 if (token->type != CPP_SEMICOLON
7375 || (token->flags & PREV_WHITE))
7378 semi_loc = expand_location (token->location);
7379 if (close_loc.line == semi_loc.line
7380 && close_loc.column+1 == semi_loc.column)
7381 warning (OPT_Wempty_body,
7382 "suggest a space before %<;%> or explicit braces around empty "
7383 "body in %<%s%> statement",
7387 /* Parse an iteration-statement.
7389 iteration-statement:
7390 while ( condition ) statement
7391 do statement while ( expression ) ;
7392 for ( for-init-statement condition [opt] ; expression [opt] )
7395 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
7398 cp_parser_iteration_statement (cp_parser* parser)
7403 unsigned char in_statement;
7405 /* Peek at the next token. */
7406 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
7408 return error_mark_node;
7410 /* Remember whether or not we are already within an iteration
7412 in_statement = parser->in_statement;
7414 /* See what kind of keyword it is. */
7415 keyword = token->keyword;
7422 /* Begin the while-statement. */
7423 statement = begin_while_stmt ();
7424 /* Look for the `('. */
7425 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
7426 /* Parse the condition. */
7427 condition = cp_parser_condition (parser);
7428 finish_while_stmt_cond (condition, statement);
7429 check_empty_body (parser, "while");
7430 /* Look for the `)'. */
7431 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
7432 /* Parse the dependent statement. */
7433 parser->in_statement = IN_ITERATION_STMT;
7434 cp_parser_already_scoped_statement (parser);
7435 parser->in_statement = in_statement;
7436 /* We're done with the while-statement. */
7437 finish_while_stmt (statement);
7445 /* Begin the do-statement. */
7446 statement = begin_do_stmt ();
7447 /* Parse the body of the do-statement. */
7448 parser->in_statement = IN_ITERATION_STMT;
7449 cp_parser_implicitly_scoped_statement (parser, NULL);
7450 parser->in_statement = in_statement;
7451 finish_do_body (statement);
7452 /* Look for the `while' keyword. */
7453 cp_parser_require_keyword (parser, RID_WHILE, "%<while%>");
7454 /* Look for the `('. */
7455 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
7456 /* Parse the expression. */
7457 expression = cp_parser_expression (parser, /*cast_p=*/false);
7458 /* We're done with the do-statement. */
7459 finish_do_stmt (expression, statement);
7460 /* Look for the `)'. */
7461 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
7462 /* Look for the `;'. */
7463 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7469 tree condition = NULL_TREE;
7470 tree expression = NULL_TREE;
7472 /* Begin the for-statement. */
7473 statement = begin_for_stmt ();
7474 /* Look for the `('. */
7475 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
7476 /* Parse the initialization. */
7477 cp_parser_for_init_statement (parser);
7478 finish_for_init_stmt (statement);
7480 /* If there's a condition, process it. */
7481 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7482 condition = cp_parser_condition (parser);
7483 finish_for_cond (condition, statement);
7484 /* Look for the `;'. */
7485 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7487 /* If there's an expression, process it. */
7488 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
7489 expression = cp_parser_expression (parser, /*cast_p=*/false);
7490 finish_for_expr (expression, statement);
7491 check_empty_body (parser, "for");
7492 /* Look for the `)'. */
7493 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
7495 /* Parse the body of the for-statement. */
7496 parser->in_statement = IN_ITERATION_STMT;
7497 cp_parser_already_scoped_statement (parser);
7498 parser->in_statement = in_statement;
7500 /* We're done with the for-statement. */
7501 finish_for_stmt (statement);
7506 cp_parser_error (parser, "expected iteration-statement");
7507 statement = error_mark_node;
7514 /* Parse a for-init-statement.
7517 expression-statement
7518 simple-declaration */
7521 cp_parser_for_init_statement (cp_parser* parser)
7523 /* If the next token is a `;', then we have an empty
7524 expression-statement. Grammatically, this is also a
7525 simple-declaration, but an invalid one, because it does not
7526 declare anything. Therefore, if we did not handle this case
7527 specially, we would issue an error message about an invalid
7529 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7531 /* We're going to speculatively look for a declaration, falling back
7532 to an expression, if necessary. */
7533 cp_parser_parse_tentatively (parser);
7534 /* Parse the declaration. */
7535 cp_parser_simple_declaration (parser,
7536 /*function_definition_allowed_p=*/false);
7537 /* If the tentative parse failed, then we shall need to look for an
7538 expression-statement. */
7539 if (cp_parser_parse_definitely (parser))
7543 cp_parser_expression_statement (parser, false);
7546 /* Parse a jump-statement.
7551 return expression [opt] ;
7552 return braced-init-list ;
7560 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
7563 cp_parser_jump_statement (cp_parser* parser)
7565 tree statement = error_mark_node;
7568 unsigned char in_statement;
7570 /* Peek at the next token. */
7571 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
7573 return error_mark_node;
7575 /* See what kind of keyword it is. */
7576 keyword = token->keyword;
7580 in_statement = parser->in_statement & ~IN_IF_STMT;
7581 switch (in_statement)
7584 error ("%Hbreak statement not within loop or switch", &token->location);
7587 gcc_assert ((in_statement & IN_SWITCH_STMT)
7588 || in_statement == IN_ITERATION_STMT);
7589 statement = finish_break_stmt ();
7592 error ("%Hinvalid exit from OpenMP structured block", &token->location);
7595 error ("%Hbreak statement used with OpenMP for loop", &token->location);
7598 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7602 switch (parser->in_statement & ~(IN_SWITCH_STMT | IN_IF_STMT))
7605 error ("%Hcontinue statement not within a loop", &token->location);
7607 case IN_ITERATION_STMT:
7609 statement = finish_continue_stmt ();
7612 error ("%Hinvalid exit from OpenMP structured block", &token->location);
7617 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7623 bool expr_non_constant_p;
7625 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7627 maybe_warn_cpp0x ("extended initializer lists");
7628 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
7630 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7631 expr = cp_parser_expression (parser, /*cast_p=*/false);
7633 /* If the next token is a `;', then there is no
7636 /* Build the return-statement. */
7637 statement = finish_return_stmt (expr);
7638 /* Look for the final `;'. */
7639 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7644 /* Create the goto-statement. */
7645 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
7647 /* Issue a warning about this use of a GNU extension. */
7648 pedwarn (token->location, OPT_pedantic, "ISO C++ forbids computed gotos");
7649 /* Consume the '*' token. */
7650 cp_lexer_consume_token (parser->lexer);
7651 /* Parse the dependent expression. */
7652 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false));
7655 finish_goto_stmt (cp_parser_identifier (parser));
7656 /* Look for the final `;'. */
7657 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7661 cp_parser_error (parser, "expected jump-statement");
7668 /* Parse a declaration-statement.
7670 declaration-statement:
7671 block-declaration */
7674 cp_parser_declaration_statement (cp_parser* parser)
7678 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7679 p = obstack_alloc (&declarator_obstack, 0);
7681 /* Parse the block-declaration. */
7682 cp_parser_block_declaration (parser, /*statement_p=*/true);
7684 /* Free any declarators allocated. */
7685 obstack_free (&declarator_obstack, p);
7687 /* Finish off the statement. */
7691 /* Some dependent statements (like `if (cond) statement'), are
7692 implicitly in their own scope. In other words, if the statement is
7693 a single statement (as opposed to a compound-statement), it is
7694 none-the-less treated as if it were enclosed in braces. Any
7695 declarations appearing in the dependent statement are out of scope
7696 after control passes that point. This function parses a statement,
7697 but ensures that is in its own scope, even if it is not a
7700 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7701 is a (possibly labeled) if statement which is not enclosed in
7702 braces and has an else clause. This is used to implement
7705 Returns the new statement. */
7708 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
7715 /* Mark if () ; with a special NOP_EXPR. */
7716 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7718 cp_lexer_consume_token (parser->lexer);
7719 statement = add_stmt (build_empty_stmt ());
7721 /* if a compound is opened, we simply parse the statement directly. */
7722 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7723 statement = cp_parser_compound_statement (parser, NULL, false);
7724 /* If the token is not a `{', then we must take special action. */
7727 /* Create a compound-statement. */
7728 statement = begin_compound_stmt (0);
7729 /* Parse the dependent-statement. */
7730 cp_parser_statement (parser, NULL_TREE, false, if_p);
7731 /* Finish the dummy compound-statement. */
7732 finish_compound_stmt (statement);
7735 /* Return the statement. */
7739 /* For some dependent statements (like `while (cond) statement'), we
7740 have already created a scope. Therefore, even if the dependent
7741 statement is a compound-statement, we do not want to create another
7745 cp_parser_already_scoped_statement (cp_parser* parser)
7747 /* If the token is a `{', then we must take special action. */
7748 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
7749 cp_parser_statement (parser, NULL_TREE, false, NULL);
7752 /* Avoid calling cp_parser_compound_statement, so that we
7753 don't create a new scope. Do everything else by hand. */
7754 cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>");
7755 cp_parser_statement_seq_opt (parser, NULL_TREE);
7756 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
7760 /* Declarations [gram.dcl.dcl] */
7762 /* Parse an optional declaration-sequence.
7766 declaration-seq declaration */
7769 cp_parser_declaration_seq_opt (cp_parser* parser)
7775 token = cp_lexer_peek_token (parser->lexer);
7777 if (token->type == CPP_CLOSE_BRACE
7778 || token->type == CPP_EOF
7779 || token->type == CPP_PRAGMA_EOL)
7782 if (token->type == CPP_SEMICOLON)
7784 /* A declaration consisting of a single semicolon is
7785 invalid. Allow it unless we're being pedantic. */
7786 cp_lexer_consume_token (parser->lexer);
7787 if (!in_system_header)
7788 pedwarn (input_location, OPT_pedantic, "extra %<;%>");
7792 /* If we're entering or exiting a region that's implicitly
7793 extern "C", modify the lang context appropriately. */
7794 if (!parser->implicit_extern_c && token->implicit_extern_c)
7796 push_lang_context (lang_name_c);
7797 parser->implicit_extern_c = true;
7799 else if (parser->implicit_extern_c && !token->implicit_extern_c)
7801 pop_lang_context ();
7802 parser->implicit_extern_c = false;
7805 if (token->type == CPP_PRAGMA)
7807 /* A top-level declaration can consist solely of a #pragma.
7808 A nested declaration cannot, so this is done here and not
7809 in cp_parser_declaration. (A #pragma at block scope is
7810 handled in cp_parser_statement.) */
7811 cp_parser_pragma (parser, pragma_external);
7815 /* Parse the declaration itself. */
7816 cp_parser_declaration (parser);
7820 /* Parse a declaration.
7825 template-declaration
7826 explicit-instantiation
7827 explicit-specialization
7828 linkage-specification
7829 namespace-definition
7834 __extension__ declaration */
7837 cp_parser_declaration (cp_parser* parser)
7844 /* Check for the `__extension__' keyword. */
7845 if (cp_parser_extension_opt (parser, &saved_pedantic))
7847 /* Parse the qualified declaration. */
7848 cp_parser_declaration (parser);
7849 /* Restore the PEDANTIC flag. */
7850 pedantic = saved_pedantic;
7855 /* Try to figure out what kind of declaration is present. */
7856 token1 = *cp_lexer_peek_token (parser->lexer);
7858 if (token1.type != CPP_EOF)
7859 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
7862 token2.type = CPP_EOF;
7863 token2.keyword = RID_MAX;
7866 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7867 p = obstack_alloc (&declarator_obstack, 0);
7869 /* If the next token is `extern' and the following token is a string
7870 literal, then we have a linkage specification. */
7871 if (token1.keyword == RID_EXTERN
7872 && cp_parser_is_string_literal (&token2))
7873 cp_parser_linkage_specification (parser);
7874 /* If the next token is `template', then we have either a template
7875 declaration, an explicit instantiation, or an explicit
7877 else if (token1.keyword == RID_TEMPLATE)
7879 /* `template <>' indicates a template specialization. */
7880 if (token2.type == CPP_LESS
7881 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
7882 cp_parser_explicit_specialization (parser);
7883 /* `template <' indicates a template declaration. */
7884 else if (token2.type == CPP_LESS)
7885 cp_parser_template_declaration (parser, /*member_p=*/false);
7886 /* Anything else must be an explicit instantiation. */
7888 cp_parser_explicit_instantiation (parser);
7890 /* If the next token is `export', then we have a template
7892 else if (token1.keyword == RID_EXPORT)
7893 cp_parser_template_declaration (parser, /*member_p=*/false);
7894 /* If the next token is `extern', 'static' or 'inline' and the one
7895 after that is `template', we have a GNU extended explicit
7896 instantiation directive. */
7897 else if (cp_parser_allow_gnu_extensions_p (parser)
7898 && (token1.keyword == RID_EXTERN
7899 || token1.keyword == RID_STATIC
7900 || token1.keyword == RID_INLINE)
7901 && token2.keyword == RID_TEMPLATE)
7902 cp_parser_explicit_instantiation (parser);
7903 /* If the next token is `namespace', check for a named or unnamed
7904 namespace definition. */
7905 else if (token1.keyword == RID_NAMESPACE
7906 && (/* A named namespace definition. */
7907 (token2.type == CPP_NAME
7908 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
7910 /* An unnamed namespace definition. */
7911 || token2.type == CPP_OPEN_BRACE
7912 || token2.keyword == RID_ATTRIBUTE))
7913 cp_parser_namespace_definition (parser);
7914 /* An inline (associated) namespace definition. */
7915 else if (token1.keyword == RID_INLINE
7916 && token2.keyword == RID_NAMESPACE)
7917 cp_parser_namespace_definition (parser);
7918 /* Objective-C++ declaration/definition. */
7919 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
7920 cp_parser_objc_declaration (parser);
7921 /* We must have either a block declaration or a function
7924 /* Try to parse a block-declaration, or a function-definition. */
7925 cp_parser_block_declaration (parser, /*statement_p=*/false);
7927 /* Free any declarators allocated. */
7928 obstack_free (&declarator_obstack, p);
7931 /* Parse a block-declaration.
7936 namespace-alias-definition
7943 __extension__ block-declaration
7948 static_assert-declaration
7950 If STATEMENT_P is TRUE, then this block-declaration is occurring as
7951 part of a declaration-statement. */
7954 cp_parser_block_declaration (cp_parser *parser,
7960 /* Check for the `__extension__' keyword. */
7961 if (cp_parser_extension_opt (parser, &saved_pedantic))
7963 /* Parse the qualified declaration. */
7964 cp_parser_block_declaration (parser, statement_p);
7965 /* Restore the PEDANTIC flag. */
7966 pedantic = saved_pedantic;
7971 /* Peek at the next token to figure out which kind of declaration is
7973 token1 = cp_lexer_peek_token (parser->lexer);
7975 /* If the next keyword is `asm', we have an asm-definition. */
7976 if (token1->keyword == RID_ASM)
7979 cp_parser_commit_to_tentative_parse (parser);
7980 cp_parser_asm_definition (parser);
7982 /* If the next keyword is `namespace', we have a
7983 namespace-alias-definition. */
7984 else if (token1->keyword == RID_NAMESPACE)
7985 cp_parser_namespace_alias_definition (parser);
7986 /* If the next keyword is `using', we have either a
7987 using-declaration or a using-directive. */
7988 else if (token1->keyword == RID_USING)
7993 cp_parser_commit_to_tentative_parse (parser);
7994 /* If the token after `using' is `namespace', then we have a
7996 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
7997 if (token2->keyword == RID_NAMESPACE)
7998 cp_parser_using_directive (parser);
7999 /* Otherwise, it's a using-declaration. */
8001 cp_parser_using_declaration (parser,
8002 /*access_declaration_p=*/false);
8004 /* If the next keyword is `__label__' we have a misplaced label
8006 else if (token1->keyword == RID_LABEL)
8008 cp_lexer_consume_token (parser->lexer);
8009 error ("%H%<__label__%> not at the beginning of a block", &token1->location);
8010 cp_parser_skip_to_end_of_statement (parser);
8011 /* If the next token is now a `;', consume it. */
8012 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
8013 cp_lexer_consume_token (parser->lexer);
8015 /* If the next token is `static_assert' we have a static assertion. */
8016 else if (token1->keyword == RID_STATIC_ASSERT)
8017 cp_parser_static_assert (parser, /*member_p=*/false);
8018 /* Anything else must be a simple-declaration. */
8020 cp_parser_simple_declaration (parser, !statement_p);
8023 /* Parse a simple-declaration.
8026 decl-specifier-seq [opt] init-declarator-list [opt] ;
8028 init-declarator-list:
8030 init-declarator-list , init-declarator
8032 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
8033 function-definition as a simple-declaration. */
8036 cp_parser_simple_declaration (cp_parser* parser,
8037 bool function_definition_allowed_p)
8039 cp_decl_specifier_seq decl_specifiers;
8040 int declares_class_or_enum;
8041 bool saw_declarator;
8043 /* Defer access checks until we know what is being declared; the
8044 checks for names appearing in the decl-specifier-seq should be
8045 done as if we were in the scope of the thing being declared. */
8046 push_deferring_access_checks (dk_deferred);
8048 /* Parse the decl-specifier-seq. We have to keep track of whether
8049 or not the decl-specifier-seq declares a named class or
8050 enumeration type, since that is the only case in which the
8051 init-declarator-list is allowed to be empty.
8055 In a simple-declaration, the optional init-declarator-list can be
8056 omitted only when declaring a class or enumeration, that is when
8057 the decl-specifier-seq contains either a class-specifier, an
8058 elaborated-type-specifier, or an enum-specifier. */
8059 cp_parser_decl_specifier_seq (parser,
8060 CP_PARSER_FLAGS_OPTIONAL,
8062 &declares_class_or_enum);
8063 /* We no longer need to defer access checks. */
8064 stop_deferring_access_checks ();
8066 /* In a block scope, a valid declaration must always have a
8067 decl-specifier-seq. By not trying to parse declarators, we can
8068 resolve the declaration/expression ambiguity more quickly. */
8069 if (!function_definition_allowed_p
8070 && !decl_specifiers.any_specifiers_p)
8072 cp_parser_error (parser, "expected declaration");
8076 /* If the next two tokens are both identifiers, the code is
8077 erroneous. The usual cause of this situation is code like:
8081 where "T" should name a type -- but does not. */
8082 if (!decl_specifiers.type
8083 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
8085 /* If parsing tentatively, we should commit; we really are
8086 looking at a declaration. */
8087 cp_parser_commit_to_tentative_parse (parser);
8092 /* If we have seen at least one decl-specifier, and the next token
8093 is not a parenthesis, then we must be looking at a declaration.
8094 (After "int (" we might be looking at a functional cast.) */
8095 if (decl_specifiers.any_specifiers_p
8096 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN)
8097 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
8098 cp_parser_commit_to_tentative_parse (parser);
8100 /* Keep going until we hit the `;' at the end of the simple
8102 saw_declarator = false;
8103 while (cp_lexer_next_token_is_not (parser->lexer,
8107 bool function_definition_p;
8112 /* If we are processing next declarator, coma is expected */
8113 token = cp_lexer_peek_token (parser->lexer);
8114 gcc_assert (token->type == CPP_COMMA);
8115 cp_lexer_consume_token (parser->lexer);
8118 saw_declarator = true;
8120 /* Parse the init-declarator. */
8121 decl = cp_parser_init_declarator (parser, &decl_specifiers,
8123 function_definition_allowed_p,
8125 declares_class_or_enum,
8126 &function_definition_p);
8127 /* If an error occurred while parsing tentatively, exit quickly.
8128 (That usually happens when in the body of a function; each
8129 statement is treated as a declaration-statement until proven
8131 if (cp_parser_error_occurred (parser))
8133 /* Handle function definitions specially. */
8134 if (function_definition_p)
8136 /* If the next token is a `,', then we are probably
8137 processing something like:
8141 which is erroneous. */
8142 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
8144 cp_token *token = cp_lexer_peek_token (parser->lexer);
8145 error ("%Hmixing declarations and function-definitions is forbidden",
8148 /* Otherwise, we're done with the list of declarators. */
8151 pop_deferring_access_checks ();
8155 /* The next token should be either a `,' or a `;'. */
8156 token = cp_lexer_peek_token (parser->lexer);
8157 /* If it's a `,', there are more declarators to come. */
8158 if (token->type == CPP_COMMA)
8159 /* will be consumed next time around */;
8160 /* If it's a `;', we are done. */
8161 else if (token->type == CPP_SEMICOLON)
8163 /* Anything else is an error. */
8166 /* If we have already issued an error message we don't need
8167 to issue another one. */
8168 if (decl != error_mark_node
8169 || cp_parser_uncommitted_to_tentative_parse_p (parser))
8170 cp_parser_error (parser, "expected %<,%> or %<;%>");
8171 /* Skip tokens until we reach the end of the statement. */
8172 cp_parser_skip_to_end_of_statement (parser);
8173 /* If the next token is now a `;', consume it. */
8174 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
8175 cp_lexer_consume_token (parser->lexer);
8178 /* After the first time around, a function-definition is not
8179 allowed -- even if it was OK at first. For example:
8184 function_definition_allowed_p = false;
8187 /* Issue an error message if no declarators are present, and the
8188 decl-specifier-seq does not itself declare a class or
8190 if (!saw_declarator)
8192 if (cp_parser_declares_only_class_p (parser))
8193 shadow_tag (&decl_specifiers);
8194 /* Perform any deferred access checks. */
8195 perform_deferred_access_checks ();
8198 /* Consume the `;'. */
8199 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
8202 pop_deferring_access_checks ();
8205 /* Parse a decl-specifier-seq.
8208 decl-specifier-seq [opt] decl-specifier
8211 storage-class-specifier
8222 Set *DECL_SPECS to a representation of the decl-specifier-seq.
8224 The parser flags FLAGS is used to control type-specifier parsing.
8226 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
8229 1: one of the decl-specifiers is an elaborated-type-specifier
8230 (i.e., a type declaration)
8231 2: one of the decl-specifiers is an enum-specifier or a
8232 class-specifier (i.e., a type definition)
8237 cp_parser_decl_specifier_seq (cp_parser* parser,
8238 cp_parser_flags flags,
8239 cp_decl_specifier_seq *decl_specs,
8240 int* declares_class_or_enum)
8242 bool constructor_possible_p = !parser->in_declarator_p;
8243 cp_token *start_token = NULL;
8245 /* Clear DECL_SPECS. */
8246 clear_decl_specs (decl_specs);
8248 /* Assume no class or enumeration type is declared. */
8249 *declares_class_or_enum = 0;
8251 /* Keep reading specifiers until there are no more to read. */
8255 bool found_decl_spec;
8258 /* Peek at the next token. */
8259 token = cp_lexer_peek_token (parser->lexer);
8261 /* Save the first token of the decl spec list for error
8264 start_token = token;
8265 /* Handle attributes. */
8266 if (token->keyword == RID_ATTRIBUTE)
8268 /* Parse the attributes. */
8269 decl_specs->attributes
8270 = chainon (decl_specs->attributes,
8271 cp_parser_attributes_opt (parser));
8274 /* Assume we will find a decl-specifier keyword. */
8275 found_decl_spec = true;
8276 /* If the next token is an appropriate keyword, we can simply
8277 add it to the list. */
8278 switch (token->keyword)
8283 if (!at_class_scope_p ())
8285 error ("%H%<friend%> used outside of class", &token->location);
8286 cp_lexer_purge_token (parser->lexer);
8290 ++decl_specs->specs[(int) ds_friend];
8291 /* Consume the token. */
8292 cp_lexer_consume_token (parser->lexer);
8296 /* function-specifier:
8303 cp_parser_function_specifier_opt (parser, decl_specs);
8309 ++decl_specs->specs[(int) ds_typedef];
8310 /* Consume the token. */
8311 cp_lexer_consume_token (parser->lexer);
8312 /* A constructor declarator cannot appear in a typedef. */
8313 constructor_possible_p = false;
8314 /* The "typedef" keyword can only occur in a declaration; we
8315 may as well commit at this point. */
8316 cp_parser_commit_to_tentative_parse (parser);
8318 if (decl_specs->storage_class != sc_none)
8319 decl_specs->conflicting_specifiers_p = true;
8322 /* storage-class-specifier:
8332 if (cxx_dialect == cxx98)
8334 /* Consume the token. */
8335 cp_lexer_consume_token (parser->lexer);
8337 /* Complain about `auto' as a storage specifier, if
8338 we're complaining about C++0x compatibility. */
8341 "%H%<auto%> will change meaning in C++0x; please remove it",
8344 /* Set the storage class anyway. */
8345 cp_parser_set_storage_class (parser, decl_specs, RID_AUTO,
8349 /* C++0x auto type-specifier. */
8350 found_decl_spec = false;
8357 /* Consume the token. */
8358 cp_lexer_consume_token (parser->lexer);
8359 cp_parser_set_storage_class (parser, decl_specs, token->keyword,
8363 /* Consume the token. */
8364 cp_lexer_consume_token (parser->lexer);
8365 ++decl_specs->specs[(int) ds_thread];
8369 /* We did not yet find a decl-specifier yet. */
8370 found_decl_spec = false;
8374 /* Constructors are a special case. The `S' in `S()' is not a
8375 decl-specifier; it is the beginning of the declarator. */
8378 && constructor_possible_p
8379 && (cp_parser_constructor_declarator_p
8380 (parser, decl_specs->specs[(int) ds_friend] != 0)));
8382 /* If we don't have a DECL_SPEC yet, then we must be looking at
8383 a type-specifier. */
8384 if (!found_decl_spec && !constructor_p)
8386 int decl_spec_declares_class_or_enum;
8387 bool is_cv_qualifier;
8391 = cp_parser_type_specifier (parser, flags,
8393 /*is_declaration=*/true,
8394 &decl_spec_declares_class_or_enum,
8396 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
8398 /* If this type-specifier referenced a user-defined type
8399 (a typedef, class-name, etc.), then we can't allow any
8400 more such type-specifiers henceforth.
8404 The longest sequence of decl-specifiers that could
8405 possibly be a type name is taken as the
8406 decl-specifier-seq of a declaration. The sequence shall
8407 be self-consistent as described below.
8411 As a general rule, at most one type-specifier is allowed
8412 in the complete decl-specifier-seq of a declaration. The
8413 only exceptions are the following:
8415 -- const or volatile can be combined with any other
8418 -- signed or unsigned can be combined with char, long,
8426 void g (const int Pc);
8428 Here, Pc is *not* part of the decl-specifier seq; it's
8429 the declarator. Therefore, once we see a type-specifier
8430 (other than a cv-qualifier), we forbid any additional
8431 user-defined types. We *do* still allow things like `int
8432 int' to be considered a decl-specifier-seq, and issue the
8433 error message later. */
8434 if (type_spec && !is_cv_qualifier)
8435 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
8436 /* A constructor declarator cannot follow a type-specifier. */
8439 constructor_possible_p = false;
8440 found_decl_spec = true;
8444 /* If we still do not have a DECL_SPEC, then there are no more
8446 if (!found_decl_spec)
8449 decl_specs->any_specifiers_p = true;
8450 /* After we see one decl-specifier, further decl-specifiers are
8452 flags |= CP_PARSER_FLAGS_OPTIONAL;
8455 cp_parser_check_decl_spec (decl_specs, start_token->location);
8457 /* Don't allow a friend specifier with a class definition. */
8458 if (decl_specs->specs[(int) ds_friend] != 0
8459 && (*declares_class_or_enum & 2))
8460 error ("%Hclass definition may not be declared a friend",
8461 &start_token->location);
8464 /* Parse an (optional) storage-class-specifier.
8466 storage-class-specifier:
8475 storage-class-specifier:
8478 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
8481 cp_parser_storage_class_specifier_opt (cp_parser* parser)
8483 switch (cp_lexer_peek_token (parser->lexer)->keyword)
8486 if (cxx_dialect != cxx98)
8488 /* Fall through for C++98. */
8495 /* Consume the token. */
8496 return cp_lexer_consume_token (parser->lexer)->u.value;
8503 /* Parse an (optional) function-specifier.
8510 Returns an IDENTIFIER_NODE corresponding to the keyword used.
8511 Updates DECL_SPECS, if it is non-NULL. */
8514 cp_parser_function_specifier_opt (cp_parser* parser,
8515 cp_decl_specifier_seq *decl_specs)
8517 cp_token *token = cp_lexer_peek_token (parser->lexer);
8518 switch (token->keyword)
8522 ++decl_specs->specs[(int) ds_inline];
8526 /* 14.5.2.3 [temp.mem]
8528 A member function template shall not be virtual. */
8529 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8530 error ("%Htemplates may not be %<virtual%>", &token->location);
8531 else if (decl_specs)
8532 ++decl_specs->specs[(int) ds_virtual];
8537 ++decl_specs->specs[(int) ds_explicit];
8544 /* Consume the token. */
8545 return cp_lexer_consume_token (parser->lexer)->u.value;
8548 /* Parse a linkage-specification.
8550 linkage-specification:
8551 extern string-literal { declaration-seq [opt] }
8552 extern string-literal declaration */
8555 cp_parser_linkage_specification (cp_parser* parser)
8559 /* Look for the `extern' keyword. */
8560 cp_parser_require_keyword (parser, RID_EXTERN, "%<extern%>");
8562 /* Look for the string-literal. */
8563 linkage = cp_parser_string_literal (parser, false, false);
8565 /* Transform the literal into an identifier. If the literal is a
8566 wide-character string, or contains embedded NULs, then we can't
8567 handle it as the user wants. */
8568 if (strlen (TREE_STRING_POINTER (linkage))
8569 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
8571 cp_parser_error (parser, "invalid linkage-specification");
8572 /* Assume C++ linkage. */
8573 linkage = lang_name_cplusplus;
8576 linkage = get_identifier (TREE_STRING_POINTER (linkage));
8578 /* We're now using the new linkage. */
8579 push_lang_context (linkage);
8581 /* If the next token is a `{', then we're using the first
8583 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
8585 /* Consume the `{' token. */
8586 cp_lexer_consume_token (parser->lexer);
8587 /* Parse the declarations. */
8588 cp_parser_declaration_seq_opt (parser);
8589 /* Look for the closing `}'. */
8590 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
8592 /* Otherwise, there's just one declaration. */
8595 bool saved_in_unbraced_linkage_specification_p;
8597 saved_in_unbraced_linkage_specification_p
8598 = parser->in_unbraced_linkage_specification_p;
8599 parser->in_unbraced_linkage_specification_p = true;
8600 cp_parser_declaration (parser);
8601 parser->in_unbraced_linkage_specification_p
8602 = saved_in_unbraced_linkage_specification_p;
8605 /* We're done with the linkage-specification. */
8606 pop_lang_context ();
8609 /* Parse a static_assert-declaration.
8611 static_assert-declaration:
8612 static_assert ( constant-expression , string-literal ) ;
8614 If MEMBER_P, this static_assert is a class member. */
8617 cp_parser_static_assert(cp_parser *parser, bool member_p)
8622 location_t saved_loc;
8624 /* Peek at the `static_assert' token so we can keep track of exactly
8625 where the static assertion started. */
8626 token = cp_lexer_peek_token (parser->lexer);
8627 saved_loc = token->location;
8629 /* Look for the `static_assert' keyword. */
8630 if (!cp_parser_require_keyword (parser, RID_STATIC_ASSERT,
8631 "%<static_assert%>"))
8634 /* We know we are in a static assertion; commit to any tentative
8636 if (cp_parser_parsing_tentatively (parser))
8637 cp_parser_commit_to_tentative_parse (parser);
8639 /* Parse the `(' starting the static assertion condition. */
8640 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
8642 /* Parse the constant-expression. */
8644 cp_parser_constant_expression (parser,
8645 /*allow_non_constant_p=*/false,
8646 /*non_constant_p=*/NULL);
8648 /* Parse the separating `,'. */
8649 cp_parser_require (parser, CPP_COMMA, "%<,%>");
8651 /* Parse the string-literal message. */
8652 message = cp_parser_string_literal (parser,
8653 /*translate=*/false,
8656 /* A `)' completes the static assertion. */
8657 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
8658 cp_parser_skip_to_closing_parenthesis (parser,
8659 /*recovering=*/true,
8661 /*consume_paren=*/true);
8663 /* A semicolon terminates the declaration. */
8664 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
8666 /* Complete the static assertion, which may mean either processing
8667 the static assert now or saving it for template instantiation. */
8668 finish_static_assert (condition, message, saved_loc, member_p);
8671 /* Parse a `decltype' type. Returns the type.
8673 simple-type-specifier:
8674 decltype ( expression ) */
8677 cp_parser_decltype (cp_parser *parser)
8680 bool id_expression_or_member_access_p = false;
8681 const char *saved_message;
8682 bool saved_integral_constant_expression_p;
8683 bool saved_non_integral_constant_expression_p;
8684 cp_token *id_expr_start_token;
8686 /* Look for the `decltype' token. */
8687 if (!cp_parser_require_keyword (parser, RID_DECLTYPE, "%<decltype%>"))
8688 return error_mark_node;
8690 /* Types cannot be defined in a `decltype' expression. Save away the
8692 saved_message = parser->type_definition_forbidden_message;
8694 /* And create the new one. */
8695 parser->type_definition_forbidden_message
8696 = "types may not be defined in %<decltype%> expressions";
8698 /* The restrictions on constant-expressions do not apply inside
8699 decltype expressions. */
8700 saved_integral_constant_expression_p
8701 = parser->integral_constant_expression_p;
8702 saved_non_integral_constant_expression_p
8703 = parser->non_integral_constant_expression_p;
8704 parser->integral_constant_expression_p = false;
8706 /* Do not actually evaluate the expression. */
8709 /* Parse the opening `('. */
8710 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
8711 return error_mark_node;
8713 /* First, try parsing an id-expression. */
8714 id_expr_start_token = cp_lexer_peek_token (parser->lexer);
8715 cp_parser_parse_tentatively (parser);
8716 expr = cp_parser_id_expression (parser,
8717 /*template_keyword_p=*/false,
8718 /*check_dependency_p=*/true,
8719 /*template_p=*/NULL,
8720 /*declarator_p=*/false,
8721 /*optional_p=*/false);
8723 if (!cp_parser_error_occurred (parser) && expr != error_mark_node)
8725 bool non_integral_constant_expression_p = false;
8726 tree id_expression = expr;
8728 const char *error_msg;
8730 if (TREE_CODE (expr) == IDENTIFIER_NODE)
8731 /* Lookup the name we got back from the id-expression. */
8732 expr = cp_parser_lookup_name (parser, expr,
8734 /*is_template=*/false,
8735 /*is_namespace=*/false,
8736 /*check_dependency=*/true,
8737 /*ambiguous_decls=*/NULL,
8738 id_expr_start_token->location);
8741 && expr != error_mark_node
8742 && TREE_CODE (expr) != TEMPLATE_ID_EXPR
8743 && TREE_CODE (expr) != TYPE_DECL
8744 && (TREE_CODE (expr) != BIT_NOT_EXPR
8745 || !TYPE_P (TREE_OPERAND (expr, 0)))
8746 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
8748 /* Complete lookup of the id-expression. */
8749 expr = (finish_id_expression
8750 (id_expression, expr, parser->scope, &idk,
8751 /*integral_constant_expression_p=*/false,
8752 /*allow_non_integral_constant_expression_p=*/true,
8753 &non_integral_constant_expression_p,
8754 /*template_p=*/false,
8756 /*address_p=*/false,
8757 /*template_arg_p=*/false,
8759 id_expr_start_token->location));
8761 if (expr == error_mark_node)
8762 /* We found an id-expression, but it was something that we
8763 should not have found. This is an error, not something
8764 we can recover from, so note that we found an
8765 id-expression and we'll recover as gracefully as
8767 id_expression_or_member_access_p = true;
8771 && expr != error_mark_node
8772 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
8773 /* We have an id-expression. */
8774 id_expression_or_member_access_p = true;
8777 if (!id_expression_or_member_access_p)
8779 /* Abort the id-expression parse. */
8780 cp_parser_abort_tentative_parse (parser);
8782 /* Parsing tentatively, again. */
8783 cp_parser_parse_tentatively (parser);
8785 /* Parse a class member access. */
8786 expr = cp_parser_postfix_expression (parser, /*address_p=*/false,
8788 /*member_access_only_p=*/true);
8791 && expr != error_mark_node
8792 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
8793 /* We have an id-expression. */
8794 id_expression_or_member_access_p = true;
8797 if (id_expression_or_member_access_p)
8798 /* We have parsed the complete id-expression or member access. */
8799 cp_parser_parse_definitely (parser);
8802 /* Abort our attempt to parse an id-expression or member access
8804 cp_parser_abort_tentative_parse (parser);
8806 /* Parse a full expression. */
8807 expr = cp_parser_expression (parser, /*cast_p=*/false);
8810 /* Go back to evaluating expressions. */
8813 /* Restore the old message and the integral constant expression
8815 parser->type_definition_forbidden_message = saved_message;
8816 parser->integral_constant_expression_p
8817 = saved_integral_constant_expression_p;
8818 parser->non_integral_constant_expression_p
8819 = saved_non_integral_constant_expression_p;
8821 if (expr == error_mark_node)
8823 /* Skip everything up to the closing `)'. */
8824 cp_parser_skip_to_closing_parenthesis (parser, true, false,
8825 /*consume_paren=*/true);
8826 return error_mark_node;
8829 /* Parse to the closing `)'. */
8830 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
8832 cp_parser_skip_to_closing_parenthesis (parser, true, false,
8833 /*consume_paren=*/true);
8834 return error_mark_node;
8837 return finish_decltype_type (expr, id_expression_or_member_access_p);
8840 /* Special member functions [gram.special] */
8842 /* Parse a conversion-function-id.
8844 conversion-function-id:
8845 operator conversion-type-id
8847 Returns an IDENTIFIER_NODE representing the operator. */
8850 cp_parser_conversion_function_id (cp_parser* parser)
8854 tree saved_qualifying_scope;
8855 tree saved_object_scope;
8856 tree pushed_scope = NULL_TREE;
8858 /* Look for the `operator' token. */
8859 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "%<operator%>"))
8860 return error_mark_node;
8861 /* When we parse the conversion-type-id, the current scope will be
8862 reset. However, we need that information in able to look up the
8863 conversion function later, so we save it here. */
8864 saved_scope = parser->scope;
8865 saved_qualifying_scope = parser->qualifying_scope;
8866 saved_object_scope = parser->object_scope;
8867 /* We must enter the scope of the class so that the names of
8868 entities declared within the class are available in the
8869 conversion-type-id. For example, consider:
8876 S::operator I() { ... }
8878 In order to see that `I' is a type-name in the definition, we
8879 must be in the scope of `S'. */
8881 pushed_scope = push_scope (saved_scope);
8882 /* Parse the conversion-type-id. */
8883 type = cp_parser_conversion_type_id (parser);
8884 /* Leave the scope of the class, if any. */
8886 pop_scope (pushed_scope);
8887 /* Restore the saved scope. */
8888 parser->scope = saved_scope;
8889 parser->qualifying_scope = saved_qualifying_scope;
8890 parser->object_scope = saved_object_scope;
8891 /* If the TYPE is invalid, indicate failure. */
8892 if (type == error_mark_node)
8893 return error_mark_node;
8894 return mangle_conv_op_name_for_type (type);
8897 /* Parse a conversion-type-id:
8900 type-specifier-seq conversion-declarator [opt]
8902 Returns the TYPE specified. */
8905 cp_parser_conversion_type_id (cp_parser* parser)
8908 cp_decl_specifier_seq type_specifiers;
8909 cp_declarator *declarator;
8910 tree type_specified;
8912 /* Parse the attributes. */
8913 attributes = cp_parser_attributes_opt (parser);
8914 /* Parse the type-specifiers. */
8915 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
8917 /* If that didn't work, stop. */
8918 if (type_specifiers.type == error_mark_node)
8919 return error_mark_node;
8920 /* Parse the conversion-declarator. */
8921 declarator = cp_parser_conversion_declarator_opt (parser);
8923 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
8924 /*initialized=*/0, &attributes);
8926 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
8927 return type_specified;
8930 /* Parse an (optional) conversion-declarator.
8932 conversion-declarator:
8933 ptr-operator conversion-declarator [opt]
8937 static cp_declarator *
8938 cp_parser_conversion_declarator_opt (cp_parser* parser)
8940 enum tree_code code;
8942 cp_cv_quals cv_quals;
8944 /* We don't know if there's a ptr-operator next, or not. */
8945 cp_parser_parse_tentatively (parser);
8946 /* Try the ptr-operator. */
8947 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
8948 /* If it worked, look for more conversion-declarators. */
8949 if (cp_parser_parse_definitely (parser))
8951 cp_declarator *declarator;
8953 /* Parse another optional declarator. */
8954 declarator = cp_parser_conversion_declarator_opt (parser);
8956 return cp_parser_make_indirect_declarator
8957 (code, class_type, cv_quals, declarator);
8963 /* Parse an (optional) ctor-initializer.
8966 : mem-initializer-list
8968 Returns TRUE iff the ctor-initializer was actually present. */
8971 cp_parser_ctor_initializer_opt (cp_parser* parser)
8973 /* If the next token is not a `:', then there is no
8974 ctor-initializer. */
8975 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
8977 /* Do default initialization of any bases and members. */
8978 if (DECL_CONSTRUCTOR_P (current_function_decl))
8979 finish_mem_initializers (NULL_TREE);
8984 /* Consume the `:' token. */
8985 cp_lexer_consume_token (parser->lexer);
8986 /* And the mem-initializer-list. */
8987 cp_parser_mem_initializer_list (parser);
8992 /* Parse a mem-initializer-list.
8994 mem-initializer-list:
8995 mem-initializer ... [opt]
8996 mem-initializer ... [opt] , mem-initializer-list */
8999 cp_parser_mem_initializer_list (cp_parser* parser)
9001 tree mem_initializer_list = NULL_TREE;
9002 cp_token *token = cp_lexer_peek_token (parser->lexer);
9004 /* Let the semantic analysis code know that we are starting the
9005 mem-initializer-list. */
9006 if (!DECL_CONSTRUCTOR_P (current_function_decl))
9007 error ("%Honly constructors take base initializers",
9010 /* Loop through the list. */
9013 tree mem_initializer;
9015 token = cp_lexer_peek_token (parser->lexer);
9016 /* Parse the mem-initializer. */
9017 mem_initializer = cp_parser_mem_initializer (parser);
9018 /* If the next token is a `...', we're expanding member initializers. */
9019 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
9021 /* Consume the `...'. */
9022 cp_lexer_consume_token (parser->lexer);
9024 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
9025 can be expanded but members cannot. */
9026 if (mem_initializer != error_mark_node
9027 && !TYPE_P (TREE_PURPOSE (mem_initializer)))
9029 error ("%Hcannot expand initializer for member %<%D%>",
9030 &token->location, TREE_PURPOSE (mem_initializer));
9031 mem_initializer = error_mark_node;
9034 /* Construct the pack expansion type. */
9035 if (mem_initializer != error_mark_node)
9036 mem_initializer = make_pack_expansion (mem_initializer);
9038 /* Add it to the list, unless it was erroneous. */
9039 if (mem_initializer != error_mark_node)
9041 TREE_CHAIN (mem_initializer) = mem_initializer_list;
9042 mem_initializer_list = mem_initializer;
9044 /* If the next token is not a `,', we're done. */
9045 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9047 /* Consume the `,' token. */
9048 cp_lexer_consume_token (parser->lexer);
9051 /* Perform semantic analysis. */
9052 if (DECL_CONSTRUCTOR_P (current_function_decl))
9053 finish_mem_initializers (mem_initializer_list);
9056 /* Parse a mem-initializer.
9059 mem-initializer-id ( expression-list [opt] )
9060 mem-initializer-id braced-init-list
9065 ( expression-list [opt] )
9067 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
9068 class) or FIELD_DECL (for a non-static data member) to initialize;
9069 the TREE_VALUE is the expression-list. An empty initialization
9070 list is represented by void_list_node. */
9073 cp_parser_mem_initializer (cp_parser* parser)
9075 tree mem_initializer_id;
9076 tree expression_list;
9078 cp_token *token = cp_lexer_peek_token (parser->lexer);
9080 /* Find out what is being initialized. */
9081 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
9083 permerror (token->location,
9084 "anachronistic old-style base class initializer");
9085 mem_initializer_id = NULL_TREE;
9088 mem_initializer_id = cp_parser_mem_initializer_id (parser);
9089 member = expand_member_init (mem_initializer_id);
9090 if (member && !DECL_P (member))
9091 in_base_initializer = 1;
9093 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9095 bool expr_non_constant_p;
9096 maybe_warn_cpp0x ("extended initializer lists");
9097 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
9098 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
9099 expression_list = build_tree_list (NULL_TREE, expression_list);
9103 = cp_parser_parenthesized_expression_list (parser, false,
9105 /*allow_expansion_p=*/true,
9106 /*non_constant_p=*/NULL);
9107 if (expression_list == error_mark_node)
9108 return error_mark_node;
9109 if (!expression_list)
9110 expression_list = void_type_node;
9112 in_base_initializer = 0;
9114 return member ? build_tree_list (member, expression_list) : error_mark_node;
9117 /* Parse a mem-initializer-id.
9120 :: [opt] nested-name-specifier [opt] class-name
9123 Returns a TYPE indicating the class to be initializer for the first
9124 production. Returns an IDENTIFIER_NODE indicating the data member
9125 to be initialized for the second production. */
9128 cp_parser_mem_initializer_id (cp_parser* parser)
9130 bool global_scope_p;
9131 bool nested_name_specifier_p;
9132 bool template_p = false;
9135 cp_token *token = cp_lexer_peek_token (parser->lexer);
9137 /* `typename' is not allowed in this context ([temp.res]). */
9138 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
9140 error ("%Hkeyword %<typename%> not allowed in this context (a qualified "
9141 "member initializer is implicitly a type)",
9143 cp_lexer_consume_token (parser->lexer);
9145 /* Look for the optional `::' operator. */
9147 = (cp_parser_global_scope_opt (parser,
9148 /*current_scope_valid_p=*/false)
9150 /* Look for the optional nested-name-specifier. The simplest way to
9155 The keyword `typename' is not permitted in a base-specifier or
9156 mem-initializer; in these contexts a qualified name that
9157 depends on a template-parameter is implicitly assumed to be a
9160 is to assume that we have seen the `typename' keyword at this
9162 nested_name_specifier_p
9163 = (cp_parser_nested_name_specifier_opt (parser,
9164 /*typename_keyword_p=*/true,
9165 /*check_dependency_p=*/true,
9167 /*is_declaration=*/true)
9169 if (nested_name_specifier_p)
9170 template_p = cp_parser_optional_template_keyword (parser);
9171 /* If there is a `::' operator or a nested-name-specifier, then we
9172 are definitely looking for a class-name. */
9173 if (global_scope_p || nested_name_specifier_p)
9174 return cp_parser_class_name (parser,
9175 /*typename_keyword_p=*/true,
9176 /*template_keyword_p=*/template_p,
9178 /*check_dependency_p=*/true,
9179 /*class_head_p=*/false,
9180 /*is_declaration=*/true);
9181 /* Otherwise, we could also be looking for an ordinary identifier. */
9182 cp_parser_parse_tentatively (parser);
9183 /* Try a class-name. */
9184 id = cp_parser_class_name (parser,
9185 /*typename_keyword_p=*/true,
9186 /*template_keyword_p=*/false,
9188 /*check_dependency_p=*/true,
9189 /*class_head_p=*/false,
9190 /*is_declaration=*/true);
9191 /* If we found one, we're done. */
9192 if (cp_parser_parse_definitely (parser))
9194 /* Otherwise, look for an ordinary identifier. */
9195 return cp_parser_identifier (parser);
9198 /* Overloading [gram.over] */
9200 /* Parse an operator-function-id.
9202 operator-function-id:
9205 Returns an IDENTIFIER_NODE for the operator which is a
9206 human-readable spelling of the identifier, e.g., `operator +'. */
9209 cp_parser_operator_function_id (cp_parser* parser)
9211 /* Look for the `operator' keyword. */
9212 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "%<operator%>"))
9213 return error_mark_node;
9214 /* And then the name of the operator itself. */
9215 return cp_parser_operator (parser);
9218 /* Parse an operator.
9221 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
9222 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
9223 || ++ -- , ->* -> () []
9230 Returns an IDENTIFIER_NODE for the operator which is a
9231 human-readable spelling of the identifier, e.g., `operator +'. */
9234 cp_parser_operator (cp_parser* parser)
9236 tree id = NULL_TREE;
9239 /* Peek at the next token. */
9240 token = cp_lexer_peek_token (parser->lexer);
9241 /* Figure out which operator we have. */
9242 switch (token->type)
9248 /* The keyword should be either `new' or `delete'. */
9249 if (token->keyword == RID_NEW)
9251 else if (token->keyword == RID_DELETE)
9256 /* Consume the `new' or `delete' token. */
9257 cp_lexer_consume_token (parser->lexer);
9259 /* Peek at the next token. */
9260 token = cp_lexer_peek_token (parser->lexer);
9261 /* If it's a `[' token then this is the array variant of the
9263 if (token->type == CPP_OPEN_SQUARE)
9265 /* Consume the `[' token. */
9266 cp_lexer_consume_token (parser->lexer);
9267 /* Look for the `]' token. */
9268 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
9269 id = ansi_opname (op == NEW_EXPR
9270 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
9272 /* Otherwise, we have the non-array variant. */
9274 id = ansi_opname (op);
9280 id = ansi_opname (PLUS_EXPR);
9284 id = ansi_opname (MINUS_EXPR);
9288 id = ansi_opname (MULT_EXPR);
9292 id = ansi_opname (TRUNC_DIV_EXPR);
9296 id = ansi_opname (TRUNC_MOD_EXPR);
9300 id = ansi_opname (BIT_XOR_EXPR);
9304 id = ansi_opname (BIT_AND_EXPR);
9308 id = ansi_opname (BIT_IOR_EXPR);
9312 id = ansi_opname (BIT_NOT_EXPR);
9316 id = ansi_opname (TRUTH_NOT_EXPR);
9320 id = ansi_assopname (NOP_EXPR);
9324 id = ansi_opname (LT_EXPR);
9328 id = ansi_opname (GT_EXPR);
9332 id = ansi_assopname (PLUS_EXPR);
9336 id = ansi_assopname (MINUS_EXPR);
9340 id = ansi_assopname (MULT_EXPR);
9344 id = ansi_assopname (TRUNC_DIV_EXPR);
9348 id = ansi_assopname (TRUNC_MOD_EXPR);
9352 id = ansi_assopname (BIT_XOR_EXPR);
9356 id = ansi_assopname (BIT_AND_EXPR);
9360 id = ansi_assopname (BIT_IOR_EXPR);
9364 id = ansi_opname (LSHIFT_EXPR);
9368 id = ansi_opname (RSHIFT_EXPR);
9372 id = ansi_assopname (LSHIFT_EXPR);
9376 id = ansi_assopname (RSHIFT_EXPR);
9380 id = ansi_opname (EQ_EXPR);
9384 id = ansi_opname (NE_EXPR);
9388 id = ansi_opname (LE_EXPR);
9391 case CPP_GREATER_EQ:
9392 id = ansi_opname (GE_EXPR);
9396 id = ansi_opname (TRUTH_ANDIF_EXPR);
9400 id = ansi_opname (TRUTH_ORIF_EXPR);
9404 id = ansi_opname (POSTINCREMENT_EXPR);
9407 case CPP_MINUS_MINUS:
9408 id = ansi_opname (PREDECREMENT_EXPR);
9412 id = ansi_opname (COMPOUND_EXPR);
9415 case CPP_DEREF_STAR:
9416 id = ansi_opname (MEMBER_REF);
9420 id = ansi_opname (COMPONENT_REF);
9423 case CPP_OPEN_PAREN:
9424 /* Consume the `('. */
9425 cp_lexer_consume_token (parser->lexer);
9426 /* Look for the matching `)'. */
9427 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
9428 return ansi_opname (CALL_EXPR);
9430 case CPP_OPEN_SQUARE:
9431 /* Consume the `['. */
9432 cp_lexer_consume_token (parser->lexer);
9433 /* Look for the matching `]'. */
9434 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
9435 return ansi_opname (ARRAY_REF);
9438 /* Anything else is an error. */
9442 /* If we have selected an identifier, we need to consume the
9445 cp_lexer_consume_token (parser->lexer);
9446 /* Otherwise, no valid operator name was present. */
9449 cp_parser_error (parser, "expected operator");
9450 id = error_mark_node;
9456 /* Parse a template-declaration.
9458 template-declaration:
9459 export [opt] template < template-parameter-list > declaration
9461 If MEMBER_P is TRUE, this template-declaration occurs within a
9464 The grammar rule given by the standard isn't correct. What
9467 template-declaration:
9468 export [opt] template-parameter-list-seq
9469 decl-specifier-seq [opt] init-declarator [opt] ;
9470 export [opt] template-parameter-list-seq
9473 template-parameter-list-seq:
9474 template-parameter-list-seq [opt]
9475 template < template-parameter-list > */
9478 cp_parser_template_declaration (cp_parser* parser, bool member_p)
9480 /* Check for `export'. */
9481 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
9483 /* Consume the `export' token. */
9484 cp_lexer_consume_token (parser->lexer);
9485 /* Warn that we do not support `export'. */
9486 warning (0, "keyword %<export%> not implemented, and will be ignored");
9489 cp_parser_template_declaration_after_export (parser, member_p);
9492 /* Parse a template-parameter-list.
9494 template-parameter-list:
9496 template-parameter-list , template-parameter
9498 Returns a TREE_LIST. Each node represents a template parameter.
9499 The nodes are connected via their TREE_CHAINs. */
9502 cp_parser_template_parameter_list (cp_parser* parser)
9504 tree parameter_list = NULL_TREE;
9506 begin_template_parm_list ();
9511 bool is_parameter_pack;
9513 /* Parse the template-parameter. */
9514 parameter = cp_parser_template_parameter (parser,
9516 &is_parameter_pack);
9517 /* Add it to the list. */
9518 if (parameter != error_mark_node)
9519 parameter_list = process_template_parm (parameter_list,
9525 tree err_parm = build_tree_list (parameter, parameter);
9526 TREE_VALUE (err_parm) = error_mark_node;
9527 parameter_list = chainon (parameter_list, err_parm);
9530 /* If the next token is not a `,', we're done. */
9531 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9533 /* Otherwise, consume the `,' token. */
9534 cp_lexer_consume_token (parser->lexer);
9537 return end_template_parm_list (parameter_list);
9540 /* Parse a template-parameter.
9544 parameter-declaration
9546 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
9547 the parameter. The TREE_PURPOSE is the default value, if any.
9548 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
9549 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
9550 set to true iff this parameter is a parameter pack. */
9553 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type,
9554 bool *is_parameter_pack)
9557 cp_parameter_declarator *parameter_declarator;
9558 cp_declarator *id_declarator;
9561 /* Assume it is a type parameter or a template parameter. */
9562 *is_non_type = false;
9563 /* Assume it not a parameter pack. */
9564 *is_parameter_pack = false;
9565 /* Peek at the next token. */
9566 token = cp_lexer_peek_token (parser->lexer);
9567 /* If it is `class' or `template', we have a type-parameter. */
9568 if (token->keyword == RID_TEMPLATE)
9569 return cp_parser_type_parameter (parser, is_parameter_pack);
9570 /* If it is `class' or `typename' we do not know yet whether it is a
9571 type parameter or a non-type parameter. Consider:
9573 template <typename T, typename T::X X> ...
9577 template <class C, class D*> ...
9579 Here, the first parameter is a type parameter, and the second is
9580 a non-type parameter. We can tell by looking at the token after
9581 the identifier -- if it is a `,', `=', or `>' then we have a type
9583 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
9585 /* Peek at the token after `class' or `typename'. */
9586 token = cp_lexer_peek_nth_token (parser->lexer, 2);
9587 /* If it's an ellipsis, we have a template type parameter
9589 if (token->type == CPP_ELLIPSIS)
9590 return cp_parser_type_parameter (parser, is_parameter_pack);
9591 /* If it's an identifier, skip it. */
9592 if (token->type == CPP_NAME)
9593 token = cp_lexer_peek_nth_token (parser->lexer, 3);
9594 /* Now, see if the token looks like the end of a template
9596 if (token->type == CPP_COMMA
9597 || token->type == CPP_EQ
9598 || token->type == CPP_GREATER)
9599 return cp_parser_type_parameter (parser, is_parameter_pack);
9602 /* Otherwise, it is a non-type parameter.
9606 When parsing a default template-argument for a non-type
9607 template-parameter, the first non-nested `>' is taken as the end
9608 of the template parameter-list rather than a greater-than
9610 *is_non_type = true;
9611 parameter_declarator
9612 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
9613 /*parenthesized_p=*/NULL);
9615 /* If the parameter declaration is marked as a parameter pack, set
9616 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
9617 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
9619 if (parameter_declarator
9620 && parameter_declarator->declarator
9621 && parameter_declarator->declarator->parameter_pack_p)
9623 *is_parameter_pack = true;
9624 parameter_declarator->declarator->parameter_pack_p = false;
9627 /* If the next token is an ellipsis, and we don't already have it
9628 marked as a parameter pack, then we have a parameter pack (that
9629 has no declarator). */
9630 if (!*is_parameter_pack
9631 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
9632 && declarator_can_be_parameter_pack (parameter_declarator->declarator))
9634 /* Consume the `...'. */
9635 cp_lexer_consume_token (parser->lexer);
9636 maybe_warn_variadic_templates ();
9638 *is_parameter_pack = true;
9640 /* We might end up with a pack expansion as the type of the non-type
9641 template parameter, in which case this is a non-type template
9643 else if (parameter_declarator
9644 && parameter_declarator->decl_specifiers.type
9645 && PACK_EXPANSION_P (parameter_declarator->decl_specifiers.type))
9647 *is_parameter_pack = true;
9648 parameter_declarator->decl_specifiers.type =
9649 PACK_EXPANSION_PATTERN (parameter_declarator->decl_specifiers.type);
9652 if (*is_parameter_pack && cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9654 /* Parameter packs cannot have default arguments. However, a
9655 user may try to do so, so we'll parse them and give an
9656 appropriate diagnostic here. */
9658 /* Consume the `='. */
9659 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
9660 cp_lexer_consume_token (parser->lexer);
9662 /* Find the name of the parameter pack. */
9663 id_declarator = parameter_declarator->declarator;
9664 while (id_declarator && id_declarator->kind != cdk_id)
9665 id_declarator = id_declarator->declarator;
9667 if (id_declarator && id_declarator->kind == cdk_id)
9668 error ("%Htemplate parameter pack %qD cannot have a default argument",
9669 &start_token->location, id_declarator->u.id.unqualified_name);
9671 error ("%Htemplate parameter pack cannot have a default argument",
9672 &start_token->location);
9674 /* Parse the default argument, but throw away the result. */
9675 cp_parser_default_argument (parser, /*template_parm_p=*/true);
9678 parm = grokdeclarator (parameter_declarator->declarator,
9679 ¶meter_declarator->decl_specifiers,
9680 PARM, /*initialized=*/0,
9682 if (parm == error_mark_node)
9683 return error_mark_node;
9685 return build_tree_list (parameter_declarator->default_argument, parm);
9688 /* Parse a type-parameter.
9691 class identifier [opt]
9692 class identifier [opt] = type-id
9693 typename identifier [opt]
9694 typename identifier [opt] = type-id
9695 template < template-parameter-list > class identifier [opt]
9696 template < template-parameter-list > class identifier [opt]
9699 GNU Extension (variadic templates):
9702 class ... identifier [opt]
9703 typename ... identifier [opt]
9705 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
9706 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
9707 the declaration of the parameter.
9709 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
9712 cp_parser_type_parameter (cp_parser* parser, bool *is_parameter_pack)
9717 /* Look for a keyword to tell us what kind of parameter this is. */
9718 token = cp_parser_require (parser, CPP_KEYWORD,
9719 "%<class%>, %<typename%>, or %<template%>");
9721 return error_mark_node;
9723 switch (token->keyword)
9729 tree default_argument;
9731 /* If the next token is an ellipsis, we have a template
9733 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
9735 /* Consume the `...' token. */
9736 cp_lexer_consume_token (parser->lexer);
9737 maybe_warn_variadic_templates ();
9739 *is_parameter_pack = true;
9742 /* If the next token is an identifier, then it names the
9744 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9745 identifier = cp_parser_identifier (parser);
9747 identifier = NULL_TREE;
9749 /* Create the parameter. */
9750 parameter = finish_template_type_parm (class_type_node, identifier);
9752 /* If the next token is an `=', we have a default argument. */
9753 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9755 /* Consume the `=' token. */
9756 cp_lexer_consume_token (parser->lexer);
9757 /* Parse the default-argument. */
9758 push_deferring_access_checks (dk_no_deferred);
9759 default_argument = cp_parser_type_id (parser);
9761 /* Template parameter packs cannot have default
9763 if (*is_parameter_pack)
9766 error ("%Htemplate parameter pack %qD cannot have a "
9767 "default argument", &token->location, identifier);
9769 error ("%Htemplate parameter packs cannot have "
9770 "default arguments", &token->location);
9771 default_argument = NULL_TREE;
9773 pop_deferring_access_checks ();
9776 default_argument = NULL_TREE;
9778 /* Create the combined representation of the parameter and the
9779 default argument. */
9780 parameter = build_tree_list (default_argument, parameter);
9786 tree parameter_list;
9788 tree default_argument;
9790 /* Look for the `<'. */
9791 cp_parser_require (parser, CPP_LESS, "%<<%>");
9792 /* Parse the template-parameter-list. */
9793 parameter_list = cp_parser_template_parameter_list (parser);
9794 /* Look for the `>'. */
9795 cp_parser_require (parser, CPP_GREATER, "%<>%>");
9796 /* Look for the `class' keyword. */
9797 cp_parser_require_keyword (parser, RID_CLASS, "%<class%>");
9798 /* If the next token is an ellipsis, we have a template
9800 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
9802 /* Consume the `...' token. */
9803 cp_lexer_consume_token (parser->lexer);
9804 maybe_warn_variadic_templates ();
9806 *is_parameter_pack = true;
9808 /* If the next token is an `=', then there is a
9809 default-argument. If the next token is a `>', we are at
9810 the end of the parameter-list. If the next token is a `,',
9811 then we are at the end of this parameter. */
9812 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
9813 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
9814 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9816 identifier = cp_parser_identifier (parser);
9817 /* Treat invalid names as if the parameter were nameless. */
9818 if (identifier == error_mark_node)
9819 identifier = NULL_TREE;
9822 identifier = NULL_TREE;
9824 /* Create the template parameter. */
9825 parameter = finish_template_template_parm (class_type_node,
9828 /* If the next token is an `=', then there is a
9829 default-argument. */
9830 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9834 /* Consume the `='. */
9835 cp_lexer_consume_token (parser->lexer);
9836 /* Parse the id-expression. */
9837 push_deferring_access_checks (dk_no_deferred);
9838 /* save token before parsing the id-expression, for error
9840 token = cp_lexer_peek_token (parser->lexer);
9842 = cp_parser_id_expression (parser,
9843 /*template_keyword_p=*/false,
9844 /*check_dependency_p=*/true,
9845 /*template_p=*/&is_template,
9846 /*declarator_p=*/false,
9847 /*optional_p=*/false);
9848 if (TREE_CODE (default_argument) == TYPE_DECL)
9849 /* If the id-expression was a template-id that refers to
9850 a template-class, we already have the declaration here,
9851 so no further lookup is needed. */
9854 /* Look up the name. */
9856 = cp_parser_lookup_name (parser, default_argument,
9858 /*is_template=*/is_template,
9859 /*is_namespace=*/false,
9860 /*check_dependency=*/true,
9861 /*ambiguous_decls=*/NULL,
9863 /* See if the default argument is valid. */
9865 = check_template_template_default_arg (default_argument);
9867 /* Template parameter packs cannot have default
9869 if (*is_parameter_pack)
9872 error ("%Htemplate parameter pack %qD cannot "
9873 "have a default argument",
9874 &token->location, identifier);
9876 error ("%Htemplate parameter packs cannot "
9877 "have default arguments",
9879 default_argument = NULL_TREE;
9881 pop_deferring_access_checks ();
9884 default_argument = NULL_TREE;
9886 /* Create the combined representation of the parameter and the
9887 default argument. */
9888 parameter = build_tree_list (default_argument, parameter);
9900 /* Parse a template-id.
9903 template-name < template-argument-list [opt] >
9905 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
9906 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
9907 returned. Otherwise, if the template-name names a function, or set
9908 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
9909 names a class, returns a TYPE_DECL for the specialization.
9911 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
9912 uninstantiated templates. */
9915 cp_parser_template_id (cp_parser *parser,
9916 bool template_keyword_p,
9917 bool check_dependency_p,
9918 bool is_declaration)
9924 cp_token_position start_of_id = 0;
9925 deferred_access_check *chk;
9926 VEC (deferred_access_check,gc) *access_check;
9927 cp_token *next_token = NULL, *next_token_2 = NULL, *token = NULL;
9930 /* If the next token corresponds to a template-id, there is no need
9932 next_token = cp_lexer_peek_token (parser->lexer);
9933 if (next_token->type == CPP_TEMPLATE_ID)
9935 struct tree_check *check_value;
9937 /* Get the stored value. */
9938 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
9939 /* Perform any access checks that were deferred. */
9940 access_check = check_value->checks;
9944 VEC_iterate (deferred_access_check, access_check, i, chk) ;
9947 perform_or_defer_access_check (chk->binfo,
9952 /* Return the stored value. */
9953 return check_value->value;
9956 /* Avoid performing name lookup if there is no possibility of
9957 finding a template-id. */
9958 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
9959 || (next_token->type == CPP_NAME
9960 && !cp_parser_nth_token_starts_template_argument_list_p
9963 cp_parser_error (parser, "expected template-id");
9964 return error_mark_node;
9967 /* Remember where the template-id starts. */
9968 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
9969 start_of_id = cp_lexer_token_position (parser->lexer, false);
9971 push_deferring_access_checks (dk_deferred);
9973 /* Parse the template-name. */
9974 is_identifier = false;
9975 token = cp_lexer_peek_token (parser->lexer);
9976 templ = cp_parser_template_name (parser, template_keyword_p,
9980 if (templ == error_mark_node || is_identifier)
9982 pop_deferring_access_checks ();
9986 /* If we find the sequence `[:' after a template-name, it's probably
9987 a digraph-typo for `< ::'. Substitute the tokens and check if we can
9988 parse correctly the argument list. */
9989 next_token = cp_lexer_peek_token (parser->lexer);
9990 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
9991 if (next_token->type == CPP_OPEN_SQUARE
9992 && next_token->flags & DIGRAPH
9993 && next_token_2->type == CPP_COLON
9994 && !(next_token_2->flags & PREV_WHITE))
9996 cp_parser_parse_tentatively (parser);
9997 /* Change `:' into `::'. */
9998 next_token_2->type = CPP_SCOPE;
9999 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
10001 cp_lexer_consume_token (parser->lexer);
10003 /* Parse the arguments. */
10004 arguments = cp_parser_enclosed_template_argument_list (parser);
10005 if (!cp_parser_parse_definitely (parser))
10007 /* If we couldn't parse an argument list, then we revert our changes
10008 and return simply an error. Maybe this is not a template-id
10010 next_token_2->type = CPP_COLON;
10011 cp_parser_error (parser, "expected %<<%>");
10012 pop_deferring_access_checks ();
10013 return error_mark_node;
10015 /* Otherwise, emit an error about the invalid digraph, but continue
10016 parsing because we got our argument list. */
10017 if (permerror (next_token->location,
10018 "%<<::%> cannot begin a template-argument list"))
10020 static bool hint = false;
10021 inform (next_token->location,
10022 "%<<:%> is an alternate spelling for %<[%>."
10023 " Insert whitespace between %<<%> and %<::%>");
10024 if (!hint && !flag_permissive)
10026 inform (next_token->location, "(if you use %<-fpermissive%>"
10027 " G++ will accept your code)");
10034 /* Look for the `<' that starts the template-argument-list. */
10035 if (!cp_parser_require (parser, CPP_LESS, "%<<%>"))
10037 pop_deferring_access_checks ();
10038 return error_mark_node;
10040 /* Parse the arguments. */
10041 arguments = cp_parser_enclosed_template_argument_list (parser);
10044 /* Build a representation of the specialization. */
10045 if (TREE_CODE (templ) == IDENTIFIER_NODE)
10046 template_id = build_min_nt (TEMPLATE_ID_EXPR, templ, arguments);
10047 else if (DECL_CLASS_TEMPLATE_P (templ)
10048 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ))
10050 bool entering_scope;
10051 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
10052 template (rather than some instantiation thereof) only if
10053 is not nested within some other construct. For example, in
10054 "template <typename T> void f(T) { A<T>::", A<T> is just an
10055 instantiation of A. */
10056 entering_scope = (template_parm_scope_p ()
10057 && cp_lexer_next_token_is (parser->lexer,
10060 = finish_template_type (templ, arguments, entering_scope);
10064 /* If it's not a class-template or a template-template, it should be
10065 a function-template. */
10066 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ)
10067 || TREE_CODE (templ) == OVERLOAD
10068 || BASELINK_P (templ)));
10070 template_id = lookup_template_function (templ, arguments);
10073 /* If parsing tentatively, replace the sequence of tokens that makes
10074 up the template-id with a CPP_TEMPLATE_ID token. That way,
10075 should we re-parse the token stream, we will not have to repeat
10076 the effort required to do the parse, nor will we issue duplicate
10077 error messages about problems during instantiation of the
10081 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
10083 /* Reset the contents of the START_OF_ID token. */
10084 token->type = CPP_TEMPLATE_ID;
10085 /* Retrieve any deferred checks. Do not pop this access checks yet
10086 so the memory will not be reclaimed during token replacing below. */
10087 token->u.tree_check_value = GGC_CNEW (struct tree_check);
10088 token->u.tree_check_value->value = template_id;
10089 token->u.tree_check_value->checks = get_deferred_access_checks ();
10090 token->keyword = RID_MAX;
10092 /* Purge all subsequent tokens. */
10093 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
10095 /* ??? Can we actually assume that, if template_id ==
10096 error_mark_node, we will have issued a diagnostic to the
10097 user, as opposed to simply marking the tentative parse as
10099 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
10100 error ("%Hparse error in template argument list",
10104 pop_deferring_access_checks ();
10105 return template_id;
10108 /* Parse a template-name.
10113 The standard should actually say:
10117 operator-function-id
10119 A defect report has been filed about this issue.
10121 A conversion-function-id cannot be a template name because they cannot
10122 be part of a template-id. In fact, looking at this code:
10124 a.operator K<int>()
10126 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
10127 It is impossible to call a templated conversion-function-id with an
10128 explicit argument list, since the only allowed template parameter is
10129 the type to which it is converting.
10131 If TEMPLATE_KEYWORD_P is true, then we have just seen the
10132 `template' keyword, in a construction like:
10136 In that case `f' is taken to be a template-name, even though there
10137 is no way of knowing for sure.
10139 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
10140 name refers to a set of overloaded functions, at least one of which
10141 is a template, or an IDENTIFIER_NODE with the name of the template,
10142 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
10143 names are looked up inside uninstantiated templates. */
10146 cp_parser_template_name (cp_parser* parser,
10147 bool template_keyword_p,
10148 bool check_dependency_p,
10149 bool is_declaration,
10150 bool *is_identifier)
10155 cp_token *token = cp_lexer_peek_token (parser->lexer);
10157 /* If the next token is `operator', then we have either an
10158 operator-function-id or a conversion-function-id. */
10159 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
10161 /* We don't know whether we're looking at an
10162 operator-function-id or a conversion-function-id. */
10163 cp_parser_parse_tentatively (parser);
10164 /* Try an operator-function-id. */
10165 identifier = cp_parser_operator_function_id (parser);
10166 /* If that didn't work, try a conversion-function-id. */
10167 if (!cp_parser_parse_definitely (parser))
10169 cp_parser_error (parser, "expected template-name");
10170 return error_mark_node;
10173 /* Look for the identifier. */
10175 identifier = cp_parser_identifier (parser);
10177 /* If we didn't find an identifier, we don't have a template-id. */
10178 if (identifier == error_mark_node)
10179 return error_mark_node;
10181 /* If the name immediately followed the `template' keyword, then it
10182 is a template-name. However, if the next token is not `<', then
10183 we do not treat it as a template-name, since it is not being used
10184 as part of a template-id. This enables us to handle constructs
10187 template <typename T> struct S { S(); };
10188 template <typename T> S<T>::S();
10190 correctly. We would treat `S' as a template -- if it were `S<T>'
10191 -- but we do not if there is no `<'. */
10193 if (processing_template_decl
10194 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
10196 /* In a declaration, in a dependent context, we pretend that the
10197 "template" keyword was present in order to improve error
10198 recovery. For example, given:
10200 template <typename T> void f(T::X<int>);
10202 we want to treat "X<int>" as a template-id. */
10204 && !template_keyword_p
10205 && parser->scope && TYPE_P (parser->scope)
10206 && check_dependency_p
10207 && dependent_type_p (parser->scope)
10208 /* Do not do this for dtors (or ctors), since they never
10209 need the template keyword before their name. */
10210 && !constructor_name_p (identifier, parser->scope))
10212 cp_token_position start = 0;
10214 /* Explain what went wrong. */
10215 error ("%Hnon-template %qD used as template",
10216 &token->location, identifier);
10217 inform (input_location, "use %<%T::template %D%> to indicate that it is a template",
10218 parser->scope, identifier);
10219 /* If parsing tentatively, find the location of the "<" token. */
10220 if (cp_parser_simulate_error (parser))
10221 start = cp_lexer_token_position (parser->lexer, true);
10222 /* Parse the template arguments so that we can issue error
10223 messages about them. */
10224 cp_lexer_consume_token (parser->lexer);
10225 cp_parser_enclosed_template_argument_list (parser);
10226 /* Skip tokens until we find a good place from which to
10227 continue parsing. */
10228 cp_parser_skip_to_closing_parenthesis (parser,
10229 /*recovering=*/true,
10231 /*consume_paren=*/false);
10232 /* If parsing tentatively, permanently remove the
10233 template argument list. That will prevent duplicate
10234 error messages from being issued about the missing
10235 "template" keyword. */
10237 cp_lexer_purge_tokens_after (parser->lexer, start);
10239 *is_identifier = true;
10243 /* If the "template" keyword is present, then there is generally
10244 no point in doing name-lookup, so we just return IDENTIFIER.
10245 But, if the qualifying scope is non-dependent then we can
10246 (and must) do name-lookup normally. */
10247 if (template_keyword_p
10249 || (TYPE_P (parser->scope)
10250 && dependent_type_p (parser->scope))))
10254 /* Look up the name. */
10255 decl = cp_parser_lookup_name (parser, identifier,
10257 /*is_template=*/false,
10258 /*is_namespace=*/false,
10259 check_dependency_p,
10260 /*ambiguous_decls=*/NULL,
10262 decl = maybe_get_template_decl_from_type_decl (decl);
10264 /* If DECL is a template, then the name was a template-name. */
10265 if (TREE_CODE (decl) == TEMPLATE_DECL)
10269 tree fn = NULL_TREE;
10271 /* The standard does not explicitly indicate whether a name that
10272 names a set of overloaded declarations, some of which are
10273 templates, is a template-name. However, such a name should
10274 be a template-name; otherwise, there is no way to form a
10275 template-id for the overloaded templates. */
10276 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
10277 if (TREE_CODE (fns) == OVERLOAD)
10278 for (fn = fns; fn; fn = OVL_NEXT (fn))
10279 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
10284 /* The name does not name a template. */
10285 cp_parser_error (parser, "expected template-name");
10286 return error_mark_node;
10290 /* If DECL is dependent, and refers to a function, then just return
10291 its name; we will look it up again during template instantiation. */
10292 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
10294 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
10295 if (TYPE_P (scope) && dependent_type_p (scope))
10302 /* Parse a template-argument-list.
10304 template-argument-list:
10305 template-argument ... [opt]
10306 template-argument-list , template-argument ... [opt]
10308 Returns a TREE_VEC containing the arguments. */
10311 cp_parser_template_argument_list (cp_parser* parser)
10313 tree fixed_args[10];
10314 unsigned n_args = 0;
10315 unsigned alloced = 10;
10316 tree *arg_ary = fixed_args;
10318 bool saved_in_template_argument_list_p;
10320 bool saved_non_ice_p;
10322 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
10323 parser->in_template_argument_list_p = true;
10324 /* Even if the template-id appears in an integral
10325 constant-expression, the contents of the argument list do
10327 saved_ice_p = parser->integral_constant_expression_p;
10328 parser->integral_constant_expression_p = false;
10329 saved_non_ice_p = parser->non_integral_constant_expression_p;
10330 parser->non_integral_constant_expression_p = false;
10331 /* Parse the arguments. */
10337 /* Consume the comma. */
10338 cp_lexer_consume_token (parser->lexer);
10340 /* Parse the template-argument. */
10341 argument = cp_parser_template_argument (parser);
10343 /* If the next token is an ellipsis, we're expanding a template
10345 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
10347 /* Consume the `...' token. */
10348 cp_lexer_consume_token (parser->lexer);
10350 /* Make the argument into a TYPE_PACK_EXPANSION or
10351 EXPR_PACK_EXPANSION. */
10352 argument = make_pack_expansion (argument);
10355 if (n_args == alloced)
10359 if (arg_ary == fixed_args)
10361 arg_ary = XNEWVEC (tree, alloced);
10362 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
10365 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
10367 arg_ary[n_args++] = argument;
10369 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
10371 vec = make_tree_vec (n_args);
10374 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
10376 if (arg_ary != fixed_args)
10378 parser->non_integral_constant_expression_p = saved_non_ice_p;
10379 parser->integral_constant_expression_p = saved_ice_p;
10380 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
10384 /* Parse a template-argument.
10387 assignment-expression
10391 The representation is that of an assignment-expression, type-id, or
10392 id-expression -- except that the qualified id-expression is
10393 evaluated, so that the value returned is either a DECL or an
10396 Although the standard says "assignment-expression", it forbids
10397 throw-expressions or assignments in the template argument.
10398 Therefore, we use "conditional-expression" instead. */
10401 cp_parser_template_argument (cp_parser* parser)
10406 bool maybe_type_id = false;
10407 cp_token *token = NULL, *argument_start_token = NULL;
10410 /* There's really no way to know what we're looking at, so we just
10411 try each alternative in order.
10415 In a template-argument, an ambiguity between a type-id and an
10416 expression is resolved to a type-id, regardless of the form of
10417 the corresponding template-parameter.
10419 Therefore, we try a type-id first. */
10420 cp_parser_parse_tentatively (parser);
10421 argument = cp_parser_type_id (parser);
10422 /* If there was no error parsing the type-id but the next token is a
10423 '>>', our behavior depends on which dialect of C++ we're
10424 parsing. In C++98, we probably found a typo for '> >'. But there
10425 are type-id which are also valid expressions. For instance:
10427 struct X { int operator >> (int); };
10428 template <int V> struct Foo {};
10431 Here 'X()' is a valid type-id of a function type, but the user just
10432 wanted to write the expression "X() >> 5". Thus, we remember that we
10433 found a valid type-id, but we still try to parse the argument as an
10434 expression to see what happens.
10436 In C++0x, the '>>' will be considered two separate '>'
10438 if (!cp_parser_error_occurred (parser)
10439 && cxx_dialect == cxx98
10440 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
10442 maybe_type_id = true;
10443 cp_parser_abort_tentative_parse (parser);
10447 /* If the next token isn't a `,' or a `>', then this argument wasn't
10448 really finished. This means that the argument is not a valid
10450 if (!cp_parser_next_token_ends_template_argument_p (parser))
10451 cp_parser_error (parser, "expected template-argument");
10452 /* If that worked, we're done. */
10453 if (cp_parser_parse_definitely (parser))
10456 /* We're still not sure what the argument will be. */
10457 cp_parser_parse_tentatively (parser);
10458 /* Try a template. */
10459 argument_start_token = cp_lexer_peek_token (parser->lexer);
10460 argument = cp_parser_id_expression (parser,
10461 /*template_keyword_p=*/false,
10462 /*check_dependency_p=*/true,
10464 /*declarator_p=*/false,
10465 /*optional_p=*/false);
10466 /* If the next token isn't a `,' or a `>', then this argument wasn't
10467 really finished. */
10468 if (!cp_parser_next_token_ends_template_argument_p (parser))
10469 cp_parser_error (parser, "expected template-argument");
10470 if (!cp_parser_error_occurred (parser))
10472 /* Figure out what is being referred to. If the id-expression
10473 was for a class template specialization, then we will have a
10474 TYPE_DECL at this point. There is no need to do name lookup
10475 at this point in that case. */
10476 if (TREE_CODE (argument) != TYPE_DECL)
10477 argument = cp_parser_lookup_name (parser, argument,
10479 /*is_template=*/template_p,
10480 /*is_namespace=*/false,
10481 /*check_dependency=*/true,
10482 /*ambiguous_decls=*/NULL,
10483 argument_start_token->location);
10484 if (TREE_CODE (argument) != TEMPLATE_DECL
10485 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
10486 cp_parser_error (parser, "expected template-name");
10488 if (cp_parser_parse_definitely (parser))
10490 /* It must be a non-type argument. There permitted cases are given
10491 in [temp.arg.nontype]:
10493 -- an integral constant-expression of integral or enumeration
10496 -- the name of a non-type template-parameter; or
10498 -- the name of an object or function with external linkage...
10500 -- the address of an object or function with external linkage...
10502 -- a pointer to member... */
10503 /* Look for a non-type template parameter. */
10504 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10506 cp_parser_parse_tentatively (parser);
10507 argument = cp_parser_primary_expression (parser,
10508 /*address_p=*/false,
10510 /*template_arg_p=*/true,
10512 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
10513 || !cp_parser_next_token_ends_template_argument_p (parser))
10514 cp_parser_simulate_error (parser);
10515 if (cp_parser_parse_definitely (parser))
10519 /* If the next token is "&", the argument must be the address of an
10520 object or function with external linkage. */
10521 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
10523 cp_lexer_consume_token (parser->lexer);
10524 /* See if we might have an id-expression. */
10525 token = cp_lexer_peek_token (parser->lexer);
10526 if (token->type == CPP_NAME
10527 || token->keyword == RID_OPERATOR
10528 || token->type == CPP_SCOPE
10529 || token->type == CPP_TEMPLATE_ID
10530 || token->type == CPP_NESTED_NAME_SPECIFIER)
10532 cp_parser_parse_tentatively (parser);
10533 argument = cp_parser_primary_expression (parser,
10536 /*template_arg_p=*/true,
10538 if (cp_parser_error_occurred (parser)
10539 || !cp_parser_next_token_ends_template_argument_p (parser))
10540 cp_parser_abort_tentative_parse (parser);
10543 if (TREE_CODE (argument) == INDIRECT_REF)
10545 gcc_assert (REFERENCE_REF_P (argument));
10546 argument = TREE_OPERAND (argument, 0);
10549 if (TREE_CODE (argument) == VAR_DECL)
10551 /* A variable without external linkage might still be a
10552 valid constant-expression, so no error is issued here
10553 if the external-linkage check fails. */
10554 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (argument))
10555 cp_parser_simulate_error (parser);
10557 else if (is_overloaded_fn (argument))
10558 /* All overloaded functions are allowed; if the external
10559 linkage test does not pass, an error will be issued
10563 && (TREE_CODE (argument) == OFFSET_REF
10564 || TREE_CODE (argument) == SCOPE_REF))
10565 /* A pointer-to-member. */
10567 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
10570 cp_parser_simulate_error (parser);
10572 if (cp_parser_parse_definitely (parser))
10575 argument = build_x_unary_op (ADDR_EXPR, argument,
10576 tf_warning_or_error);
10581 /* If the argument started with "&", there are no other valid
10582 alternatives at this point. */
10585 cp_parser_error (parser, "invalid non-type template argument");
10586 return error_mark_node;
10589 /* If the argument wasn't successfully parsed as a type-id followed
10590 by '>>', the argument can only be a constant expression now.
10591 Otherwise, we try parsing the constant-expression tentatively,
10592 because the argument could really be a type-id. */
10594 cp_parser_parse_tentatively (parser);
10595 argument = cp_parser_constant_expression (parser,
10596 /*allow_non_constant_p=*/false,
10597 /*non_constant_p=*/NULL);
10598 argument = fold_non_dependent_expr (argument);
10599 if (!maybe_type_id)
10601 if (!cp_parser_next_token_ends_template_argument_p (parser))
10602 cp_parser_error (parser, "expected template-argument");
10603 if (cp_parser_parse_definitely (parser))
10605 /* We did our best to parse the argument as a non type-id, but that
10606 was the only alternative that matched (albeit with a '>' after
10607 it). We can assume it's just a typo from the user, and a
10608 diagnostic will then be issued. */
10609 return cp_parser_type_id (parser);
10612 /* Parse an explicit-instantiation.
10614 explicit-instantiation:
10615 template declaration
10617 Although the standard says `declaration', what it really means is:
10619 explicit-instantiation:
10620 template decl-specifier-seq [opt] declarator [opt] ;
10622 Things like `template int S<int>::i = 5, int S<double>::j;' are not
10623 supposed to be allowed. A defect report has been filed about this
10628 explicit-instantiation:
10629 storage-class-specifier template
10630 decl-specifier-seq [opt] declarator [opt] ;
10631 function-specifier template
10632 decl-specifier-seq [opt] declarator [opt] ; */
10635 cp_parser_explicit_instantiation (cp_parser* parser)
10637 int declares_class_or_enum;
10638 cp_decl_specifier_seq decl_specifiers;
10639 tree extension_specifier = NULL_TREE;
10642 /* Look for an (optional) storage-class-specifier or
10643 function-specifier. */
10644 if (cp_parser_allow_gnu_extensions_p (parser))
10646 extension_specifier
10647 = cp_parser_storage_class_specifier_opt (parser);
10648 if (!extension_specifier)
10649 extension_specifier
10650 = cp_parser_function_specifier_opt (parser,
10651 /*decl_specs=*/NULL);
10654 /* Look for the `template' keyword. */
10655 cp_parser_require_keyword (parser, RID_TEMPLATE, "%<template%>");
10656 /* Let the front end know that we are processing an explicit
10658 begin_explicit_instantiation ();
10659 /* [temp.explicit] says that we are supposed to ignore access
10660 control while processing explicit instantiation directives. */
10661 push_deferring_access_checks (dk_no_check);
10662 /* Parse a decl-specifier-seq. */
10663 token = cp_lexer_peek_token (parser->lexer);
10664 cp_parser_decl_specifier_seq (parser,
10665 CP_PARSER_FLAGS_OPTIONAL,
10667 &declares_class_or_enum);
10668 /* If there was exactly one decl-specifier, and it declared a class,
10669 and there's no declarator, then we have an explicit type
10671 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
10675 type = check_tag_decl (&decl_specifiers);
10676 /* Turn access control back on for names used during
10677 template instantiation. */
10678 pop_deferring_access_checks ();
10680 do_type_instantiation (type, extension_specifier,
10681 /*complain=*/tf_error);
10685 cp_declarator *declarator;
10688 /* Parse the declarator. */
10690 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10691 /*ctor_dtor_or_conv_p=*/NULL,
10692 /*parenthesized_p=*/NULL,
10693 /*member_p=*/false);
10694 if (declares_class_or_enum & 2)
10695 cp_parser_check_for_definition_in_return_type (declarator,
10696 decl_specifiers.type,
10697 decl_specifiers.type_location);
10698 if (declarator != cp_error_declarator)
10700 decl = grokdeclarator (declarator, &decl_specifiers,
10701 NORMAL, 0, &decl_specifiers.attributes);
10702 /* Turn access control back on for names used during
10703 template instantiation. */
10704 pop_deferring_access_checks ();
10705 /* Do the explicit instantiation. */
10706 do_decl_instantiation (decl, extension_specifier);
10710 pop_deferring_access_checks ();
10711 /* Skip the body of the explicit instantiation. */
10712 cp_parser_skip_to_end_of_statement (parser);
10715 /* We're done with the instantiation. */
10716 end_explicit_instantiation ();
10718 cp_parser_consume_semicolon_at_end_of_statement (parser);
10721 /* Parse an explicit-specialization.
10723 explicit-specialization:
10724 template < > declaration
10726 Although the standard says `declaration', what it really means is:
10728 explicit-specialization:
10729 template <> decl-specifier [opt] init-declarator [opt] ;
10730 template <> function-definition
10731 template <> explicit-specialization
10732 template <> template-declaration */
10735 cp_parser_explicit_specialization (cp_parser* parser)
10737 bool need_lang_pop;
10738 cp_token *token = cp_lexer_peek_token (parser->lexer);
10740 /* Look for the `template' keyword. */
10741 cp_parser_require_keyword (parser, RID_TEMPLATE, "%<template%>");
10742 /* Look for the `<'. */
10743 cp_parser_require (parser, CPP_LESS, "%<<%>");
10744 /* Look for the `>'. */
10745 cp_parser_require (parser, CPP_GREATER, "%<>%>");
10746 /* We have processed another parameter list. */
10747 ++parser->num_template_parameter_lists;
10750 A template ... explicit specialization ... shall not have C
10752 if (current_lang_name == lang_name_c)
10754 error ("%Htemplate specialization with C linkage", &token->location);
10755 /* Give it C++ linkage to avoid confusing other parts of the
10757 push_lang_context (lang_name_cplusplus);
10758 need_lang_pop = true;
10761 need_lang_pop = false;
10762 /* Let the front end know that we are beginning a specialization. */
10763 if (!begin_specialization ())
10765 end_specialization ();
10766 cp_parser_skip_to_end_of_block_or_statement (parser);
10770 /* If the next keyword is `template', we need to figure out whether
10771 or not we're looking a template-declaration. */
10772 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
10774 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
10775 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
10776 cp_parser_template_declaration_after_export (parser,
10777 /*member_p=*/false);
10779 cp_parser_explicit_specialization (parser);
10782 /* Parse the dependent declaration. */
10783 cp_parser_single_declaration (parser,
10785 /*member_p=*/false,
10786 /*explicit_specialization_p=*/true,
10787 /*friend_p=*/NULL);
10788 /* We're done with the specialization. */
10789 end_specialization ();
10790 /* For the erroneous case of a template with C linkage, we pushed an
10791 implicit C++ linkage scope; exit that scope now. */
10793 pop_lang_context ();
10794 /* We're done with this parameter list. */
10795 --parser->num_template_parameter_lists;
10798 /* Parse a type-specifier.
10801 simple-type-specifier
10804 elaborated-type-specifier
10812 Returns a representation of the type-specifier. For a
10813 class-specifier, enum-specifier, or elaborated-type-specifier, a
10814 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
10816 The parser flags FLAGS is used to control type-specifier parsing.
10818 If IS_DECLARATION is TRUE, then this type-specifier is appearing
10819 in a decl-specifier-seq.
10821 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
10822 class-specifier, enum-specifier, or elaborated-type-specifier, then
10823 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
10824 if a type is declared; 2 if it is defined. Otherwise, it is set to
10827 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
10828 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
10829 is set to FALSE. */
10832 cp_parser_type_specifier (cp_parser* parser,
10833 cp_parser_flags flags,
10834 cp_decl_specifier_seq *decl_specs,
10835 bool is_declaration,
10836 int* declares_class_or_enum,
10837 bool* is_cv_qualifier)
10839 tree type_spec = NULL_TREE;
10842 cp_decl_spec ds = ds_last;
10844 /* Assume this type-specifier does not declare a new type. */
10845 if (declares_class_or_enum)
10846 *declares_class_or_enum = 0;
10847 /* And that it does not specify a cv-qualifier. */
10848 if (is_cv_qualifier)
10849 *is_cv_qualifier = false;
10850 /* Peek at the next token. */
10851 token = cp_lexer_peek_token (parser->lexer);
10853 /* If we're looking at a keyword, we can use that to guide the
10854 production we choose. */
10855 keyword = token->keyword;
10859 /* Look for the enum-specifier. */
10860 type_spec = cp_parser_enum_specifier (parser);
10861 /* If that worked, we're done. */
10864 if (declares_class_or_enum)
10865 *declares_class_or_enum = 2;
10867 cp_parser_set_decl_spec_type (decl_specs,
10870 /*user_defined_p=*/true);
10874 goto elaborated_type_specifier;
10876 /* Any of these indicate either a class-specifier, or an
10877 elaborated-type-specifier. */
10881 /* Parse tentatively so that we can back up if we don't find a
10882 class-specifier. */
10883 cp_parser_parse_tentatively (parser);
10884 /* Look for the class-specifier. */
10885 type_spec = cp_parser_class_specifier (parser);
10886 /* If that worked, we're done. */
10887 if (cp_parser_parse_definitely (parser))
10889 if (declares_class_or_enum)
10890 *declares_class_or_enum = 2;
10892 cp_parser_set_decl_spec_type (decl_specs,
10895 /*user_defined_p=*/true);
10899 /* Fall through. */
10900 elaborated_type_specifier:
10901 /* We're declaring (not defining) a class or enum. */
10902 if (declares_class_or_enum)
10903 *declares_class_or_enum = 1;
10905 /* Fall through. */
10907 /* Look for an elaborated-type-specifier. */
10909 = (cp_parser_elaborated_type_specifier
10911 decl_specs && decl_specs->specs[(int) ds_friend],
10914 cp_parser_set_decl_spec_type (decl_specs,
10917 /*user_defined_p=*/true);
10922 if (is_cv_qualifier)
10923 *is_cv_qualifier = true;
10928 if (is_cv_qualifier)
10929 *is_cv_qualifier = true;
10934 if (is_cv_qualifier)
10935 *is_cv_qualifier = true;
10939 /* The `__complex__' keyword is a GNU extension. */
10947 /* Handle simple keywords. */
10952 ++decl_specs->specs[(int)ds];
10953 decl_specs->any_specifiers_p = true;
10955 return cp_lexer_consume_token (parser->lexer)->u.value;
10958 /* If we do not already have a type-specifier, assume we are looking
10959 at a simple-type-specifier. */
10960 type_spec = cp_parser_simple_type_specifier (parser,
10964 /* If we didn't find a type-specifier, and a type-specifier was not
10965 optional in this context, issue an error message. */
10966 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
10968 cp_parser_error (parser, "expected type specifier");
10969 return error_mark_node;
10975 /* Parse a simple-type-specifier.
10977 simple-type-specifier:
10978 :: [opt] nested-name-specifier [opt] type-name
10979 :: [opt] nested-name-specifier template template-id
10994 simple-type-specifier:
10996 decltype ( expression )
11002 simple-type-specifier:
11003 __typeof__ unary-expression
11004 __typeof__ ( type-id )
11006 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
11007 appropriately updated. */
11010 cp_parser_simple_type_specifier (cp_parser* parser,
11011 cp_decl_specifier_seq *decl_specs,
11012 cp_parser_flags flags)
11014 tree type = NULL_TREE;
11017 /* Peek at the next token. */
11018 token = cp_lexer_peek_token (parser->lexer);
11020 /* If we're looking at a keyword, things are easy. */
11021 switch (token->keyword)
11025 decl_specs->explicit_char_p = true;
11026 type = char_type_node;
11029 type = char16_type_node;
11032 type = char32_type_node;
11035 type = wchar_type_node;
11038 type = boolean_type_node;
11042 ++decl_specs->specs[(int) ds_short];
11043 type = short_integer_type_node;
11047 decl_specs->explicit_int_p = true;
11048 type = integer_type_node;
11052 ++decl_specs->specs[(int) ds_long];
11053 type = long_integer_type_node;
11057 ++decl_specs->specs[(int) ds_signed];
11058 type = integer_type_node;
11062 ++decl_specs->specs[(int) ds_unsigned];
11063 type = unsigned_type_node;
11066 type = float_type_node;
11069 type = double_type_node;
11072 type = void_type_node;
11076 maybe_warn_cpp0x ("C++0x auto");
11077 type = make_auto ();
11081 /* Parse the `decltype' type. */
11082 type = cp_parser_decltype (parser);
11085 cp_parser_set_decl_spec_type (decl_specs, type,
11087 /*user_defined_p=*/true);
11092 /* Consume the `typeof' token. */
11093 cp_lexer_consume_token (parser->lexer);
11094 /* Parse the operand to `typeof'. */
11095 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
11096 /* If it is not already a TYPE, take its type. */
11097 if (!TYPE_P (type))
11098 type = finish_typeof (type);
11101 cp_parser_set_decl_spec_type (decl_specs, type,
11103 /*user_defined_p=*/true);
11111 /* If the type-specifier was for a built-in type, we're done. */
11116 /* Record the type. */
11118 && (token->keyword != RID_SIGNED
11119 && token->keyword != RID_UNSIGNED
11120 && token->keyword != RID_SHORT
11121 && token->keyword != RID_LONG))
11122 cp_parser_set_decl_spec_type (decl_specs,
11125 /*user_defined=*/false);
11127 decl_specs->any_specifiers_p = true;
11129 /* Consume the token. */
11130 id = cp_lexer_consume_token (parser->lexer)->u.value;
11132 /* There is no valid C++ program where a non-template type is
11133 followed by a "<". That usually indicates that the user thought
11134 that the type was a template. */
11135 cp_parser_check_for_invalid_template_id (parser, type, token->location);
11137 return TYPE_NAME (type);
11140 /* The type-specifier must be a user-defined type. */
11141 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
11146 /* Don't gobble tokens or issue error messages if this is an
11147 optional type-specifier. */
11148 if (flags & CP_PARSER_FLAGS_OPTIONAL)
11149 cp_parser_parse_tentatively (parser);
11151 /* Look for the optional `::' operator. */
11153 = (cp_parser_global_scope_opt (parser,
11154 /*current_scope_valid_p=*/false)
11156 /* Look for the nested-name specifier. */
11158 = (cp_parser_nested_name_specifier_opt (parser,
11159 /*typename_keyword_p=*/false,
11160 /*check_dependency_p=*/true,
11162 /*is_declaration=*/false)
11164 token = cp_lexer_peek_token (parser->lexer);
11165 /* If we have seen a nested-name-specifier, and the next token
11166 is `template', then we are using the template-id production. */
11168 && cp_parser_optional_template_keyword (parser))
11170 /* Look for the template-id. */
11171 type = cp_parser_template_id (parser,
11172 /*template_keyword_p=*/true,
11173 /*check_dependency_p=*/true,
11174 /*is_declaration=*/false);
11175 /* If the template-id did not name a type, we are out of
11177 if (TREE_CODE (type) != TYPE_DECL)
11179 cp_parser_error (parser, "expected template-id for type");
11183 /* Otherwise, look for a type-name. */
11185 type = cp_parser_type_name (parser);
11186 /* Keep track of all name-lookups performed in class scopes. */
11190 && TREE_CODE (type) == TYPE_DECL
11191 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
11192 maybe_note_name_used_in_class (DECL_NAME (type), type);
11193 /* If it didn't work out, we don't have a TYPE. */
11194 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
11195 && !cp_parser_parse_definitely (parser))
11197 if (type && decl_specs)
11198 cp_parser_set_decl_spec_type (decl_specs, type,
11200 /*user_defined=*/true);
11203 /* If we didn't get a type-name, issue an error message. */
11204 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
11206 cp_parser_error (parser, "expected type-name");
11207 return error_mark_node;
11210 /* There is no valid C++ program where a non-template type is
11211 followed by a "<". That usually indicates that the user thought
11212 that the type was a template. */
11213 if (type && type != error_mark_node)
11215 /* As a last-ditch effort, see if TYPE is an Objective-C type.
11216 If it is, then the '<'...'>' enclose protocol names rather than
11217 template arguments, and so everything is fine. */
11218 if (c_dialect_objc ()
11219 && (objc_is_id (type) || objc_is_class_name (type)))
11221 tree protos = cp_parser_objc_protocol_refs_opt (parser);
11222 tree qual_type = objc_get_protocol_qualified_type (type, protos);
11224 /* Clobber the "unqualified" type previously entered into
11225 DECL_SPECS with the new, improved protocol-qualified version. */
11227 decl_specs->type = qual_type;
11232 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type),
11239 /* Parse a type-name.
11252 Returns a TYPE_DECL for the type. */
11255 cp_parser_type_name (cp_parser* parser)
11259 /* We can't know yet whether it is a class-name or not. */
11260 cp_parser_parse_tentatively (parser);
11261 /* Try a class-name. */
11262 type_decl = cp_parser_class_name (parser,
11263 /*typename_keyword_p=*/false,
11264 /*template_keyword_p=*/false,
11266 /*check_dependency_p=*/true,
11267 /*class_head_p=*/false,
11268 /*is_declaration=*/false);
11269 /* If it's not a class-name, keep looking. */
11270 if (!cp_parser_parse_definitely (parser))
11272 /* It must be a typedef-name or an enum-name. */
11273 return cp_parser_nonclass_name (parser);
11279 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
11287 Returns a TYPE_DECL for the type. */
11290 cp_parser_nonclass_name (cp_parser* parser)
11295 cp_token *token = cp_lexer_peek_token (parser->lexer);
11296 identifier = cp_parser_identifier (parser);
11297 if (identifier == error_mark_node)
11298 return error_mark_node;
11300 /* Look up the type-name. */
11301 type_decl = cp_parser_lookup_name_simple (parser, identifier, token->location);
11303 if (TREE_CODE (type_decl) != TYPE_DECL
11304 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
11306 /* See if this is an Objective-C type. */
11307 tree protos = cp_parser_objc_protocol_refs_opt (parser);
11308 tree type = objc_get_protocol_qualified_type (identifier, protos);
11310 type_decl = TYPE_NAME (type);
11313 /* Issue an error if we did not find a type-name. */
11314 if (TREE_CODE (type_decl) != TYPE_DECL)
11316 if (!cp_parser_simulate_error (parser))
11317 cp_parser_name_lookup_error (parser, identifier, type_decl,
11318 "is not a type", token->location);
11319 return error_mark_node;
11321 /* Remember that the name was used in the definition of the
11322 current class so that we can check later to see if the
11323 meaning would have been different after the class was
11324 entirely defined. */
11325 else if (type_decl != error_mark_node
11327 maybe_note_name_used_in_class (identifier, type_decl);
11332 /* Parse an elaborated-type-specifier. Note that the grammar given
11333 here incorporates the resolution to DR68.
11335 elaborated-type-specifier:
11336 class-key :: [opt] nested-name-specifier [opt] identifier
11337 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
11338 enum-key :: [opt] nested-name-specifier [opt] identifier
11339 typename :: [opt] nested-name-specifier identifier
11340 typename :: [opt] nested-name-specifier template [opt]
11345 elaborated-type-specifier:
11346 class-key attributes :: [opt] nested-name-specifier [opt] identifier
11347 class-key attributes :: [opt] nested-name-specifier [opt]
11348 template [opt] template-id
11349 enum attributes :: [opt] nested-name-specifier [opt] identifier
11351 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
11352 declared `friend'. If IS_DECLARATION is TRUE, then this
11353 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
11354 something is being declared.
11356 Returns the TYPE specified. */
11359 cp_parser_elaborated_type_specifier (cp_parser* parser,
11361 bool is_declaration)
11363 enum tag_types tag_type;
11365 tree type = NULL_TREE;
11366 tree attributes = NULL_TREE;
11367 cp_token *token = NULL;
11369 /* See if we're looking at the `enum' keyword. */
11370 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
11372 /* Consume the `enum' token. */
11373 cp_lexer_consume_token (parser->lexer);
11374 /* Remember that it's an enumeration type. */
11375 tag_type = enum_type;
11376 /* Parse the optional `struct' or `class' key (for C++0x scoped
11378 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
11379 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
11381 if (cxx_dialect == cxx98)
11382 maybe_warn_cpp0x ("scoped enums");
11384 /* Consume the `struct' or `class'. */
11385 cp_lexer_consume_token (parser->lexer);
11387 /* Parse the attributes. */
11388 attributes = cp_parser_attributes_opt (parser);
11390 /* Or, it might be `typename'. */
11391 else if (cp_lexer_next_token_is_keyword (parser->lexer,
11394 /* Consume the `typename' token. */
11395 cp_lexer_consume_token (parser->lexer);
11396 /* Remember that it's a `typename' type. */
11397 tag_type = typename_type;
11398 /* The `typename' keyword is only allowed in templates. */
11399 if (!processing_template_decl)
11400 permerror (input_location, "using %<typename%> outside of template");
11402 /* Otherwise it must be a class-key. */
11405 tag_type = cp_parser_class_key (parser);
11406 if (tag_type == none_type)
11407 return error_mark_node;
11408 /* Parse the attributes. */
11409 attributes = cp_parser_attributes_opt (parser);
11412 /* Look for the `::' operator. */
11413 cp_parser_global_scope_opt (parser,
11414 /*current_scope_valid_p=*/false);
11415 /* Look for the nested-name-specifier. */
11416 if (tag_type == typename_type)
11418 if (!cp_parser_nested_name_specifier (parser,
11419 /*typename_keyword_p=*/true,
11420 /*check_dependency_p=*/true,
11423 return error_mark_node;
11426 /* Even though `typename' is not present, the proposed resolution
11427 to Core Issue 180 says that in `class A<T>::B', `B' should be
11428 considered a type-name, even if `A<T>' is dependent. */
11429 cp_parser_nested_name_specifier_opt (parser,
11430 /*typename_keyword_p=*/true,
11431 /*check_dependency_p=*/true,
11434 /* For everything but enumeration types, consider a template-id.
11435 For an enumeration type, consider only a plain identifier. */
11436 if (tag_type != enum_type)
11438 bool template_p = false;
11441 /* Allow the `template' keyword. */
11442 template_p = cp_parser_optional_template_keyword (parser);
11443 /* If we didn't see `template', we don't know if there's a
11444 template-id or not. */
11446 cp_parser_parse_tentatively (parser);
11447 /* Parse the template-id. */
11448 token = cp_lexer_peek_token (parser->lexer);
11449 decl = cp_parser_template_id (parser, template_p,
11450 /*check_dependency_p=*/true,
11452 /* If we didn't find a template-id, look for an ordinary
11454 if (!template_p && !cp_parser_parse_definitely (parser))
11456 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
11457 in effect, then we must assume that, upon instantiation, the
11458 template will correspond to a class. */
11459 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
11460 && tag_type == typename_type)
11461 type = make_typename_type (parser->scope, decl,
11463 /*complain=*/tf_error);
11465 type = TREE_TYPE (decl);
11470 token = cp_lexer_peek_token (parser->lexer);
11471 identifier = cp_parser_identifier (parser);
11473 if (identifier == error_mark_node)
11475 parser->scope = NULL_TREE;
11476 return error_mark_node;
11479 /* For a `typename', we needn't call xref_tag. */
11480 if (tag_type == typename_type
11481 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
11482 return cp_parser_make_typename_type (parser, parser->scope,
11485 /* Look up a qualified name in the usual way. */
11489 tree ambiguous_decls;
11491 decl = cp_parser_lookup_name (parser, identifier,
11493 /*is_template=*/false,
11494 /*is_namespace=*/false,
11495 /*check_dependency=*/true,
11499 /* If the lookup was ambiguous, an error will already have been
11501 if (ambiguous_decls)
11502 return error_mark_node;
11504 /* If we are parsing friend declaration, DECL may be a
11505 TEMPLATE_DECL tree node here. However, we need to check
11506 whether this TEMPLATE_DECL results in valid code. Consider
11507 the following example:
11510 template <class T> class C {};
11513 template <class T> friend class N::C; // #1, valid code
11515 template <class T> class Y {
11516 friend class N::C; // #2, invalid code
11519 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
11520 name lookup of `N::C'. We see that friend declaration must
11521 be template for the code to be valid. Note that
11522 processing_template_decl does not work here since it is
11523 always 1 for the above two cases. */
11525 decl = (cp_parser_maybe_treat_template_as_class
11526 (decl, /*tag_name_p=*/is_friend
11527 && parser->num_template_parameter_lists));
11529 if (TREE_CODE (decl) != TYPE_DECL)
11531 cp_parser_diagnose_invalid_type_name (parser,
11535 return error_mark_node;
11538 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
11540 bool allow_template = (parser->num_template_parameter_lists
11541 || DECL_SELF_REFERENCE_P (decl));
11542 type = check_elaborated_type_specifier (tag_type, decl,
11545 if (type == error_mark_node)
11546 return error_mark_node;
11549 /* Forward declarations of nested types, such as
11554 are invalid unless all components preceding the final '::'
11555 are complete. If all enclosing types are complete, these
11556 declarations become merely pointless.
11558 Invalid forward declarations of nested types are errors
11559 caught elsewhere in parsing. Those that are pointless arrive
11562 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
11563 && !is_friend && !processing_explicit_instantiation)
11564 warning (0, "declaration %qD does not declare anything", decl);
11566 type = TREE_TYPE (decl);
11570 /* An elaborated-type-specifier sometimes introduces a new type and
11571 sometimes names an existing type. Normally, the rule is that it
11572 introduces a new type only if there is not an existing type of
11573 the same name already in scope. For example, given:
11576 void f() { struct S s; }
11578 the `struct S' in the body of `f' is the same `struct S' as in
11579 the global scope; the existing definition is used. However, if
11580 there were no global declaration, this would introduce a new
11581 local class named `S'.
11583 An exception to this rule applies to the following code:
11585 namespace N { struct S; }
11587 Here, the elaborated-type-specifier names a new type
11588 unconditionally; even if there is already an `S' in the
11589 containing scope this declaration names a new type.
11590 This exception only applies if the elaborated-type-specifier
11591 forms the complete declaration:
11595 A declaration consisting solely of `class-key identifier ;' is
11596 either a redeclaration of the name in the current scope or a
11597 forward declaration of the identifier as a class name. It
11598 introduces the name into the current scope.
11600 We are in this situation precisely when the next token is a `;'.
11602 An exception to the exception is that a `friend' declaration does
11603 *not* name a new type; i.e., given:
11605 struct S { friend struct T; };
11607 `T' is not a new type in the scope of `S'.
11609 Also, `new struct S' or `sizeof (struct S)' never results in the
11610 definition of a new type; a new type can only be declared in a
11611 declaration context. */
11617 /* Friends have special name lookup rules. */
11618 ts = ts_within_enclosing_non_class;
11619 else if (is_declaration
11620 && cp_lexer_next_token_is (parser->lexer,
11622 /* This is a `class-key identifier ;' */
11628 (parser->num_template_parameter_lists
11629 && (cp_parser_next_token_starts_class_definition_p (parser)
11630 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
11631 /* An unqualified name was used to reference this type, so
11632 there were no qualifying templates. */
11633 if (!cp_parser_check_template_parameters (parser,
11634 /*num_templates=*/0,
11636 return error_mark_node;
11637 type = xref_tag (tag_type, identifier, ts, template_p);
11641 if (type == error_mark_node)
11642 return error_mark_node;
11644 /* Allow attributes on forward declarations of classes. */
11647 if (TREE_CODE (type) == TYPENAME_TYPE)
11648 warning (OPT_Wattributes,
11649 "attributes ignored on uninstantiated type");
11650 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
11651 && ! processing_explicit_instantiation)
11652 warning (OPT_Wattributes,
11653 "attributes ignored on template instantiation");
11654 else if (is_declaration && cp_parser_declares_only_class_p (parser))
11655 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
11657 warning (OPT_Wattributes,
11658 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
11661 if (tag_type != enum_type)
11662 cp_parser_check_class_key (tag_type, type);
11664 /* A "<" cannot follow an elaborated type specifier. If that
11665 happens, the user was probably trying to form a template-id. */
11666 cp_parser_check_for_invalid_template_id (parser, type, token->location);
11671 /* Parse an enum-specifier.
11674 enum-key identifier [opt] enum-base [opt] { enumerator-list [opt] }
11679 enum struct [C++0x]
11682 : type-specifier-seq
11685 enum-key attributes[opt] identifier [opt] enum-base [opt]
11686 { enumerator-list [opt] }attributes[opt]
11688 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
11689 if the token stream isn't an enum-specifier after all. */
11692 cp_parser_enum_specifier (cp_parser* parser)
11697 bool scoped_enum_p = false;
11698 tree underlying_type = NULL_TREE;
11700 /* Parse tentatively so that we can back up if we don't find a
11702 cp_parser_parse_tentatively (parser);
11704 /* Caller guarantees that the current token is 'enum', an identifier
11705 possibly follows, and the token after that is an opening brace.
11706 If we don't have an identifier, fabricate an anonymous name for
11707 the enumeration being defined. */
11708 cp_lexer_consume_token (parser->lexer);
11710 /* Parse the "class" or "struct", which indicates a scoped
11711 enumeration type in C++0x. */
11712 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
11713 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
11715 if (cxx_dialect == cxx98)
11716 maybe_warn_cpp0x ("scoped enums");
11718 /* Consume the `struct' or `class' token. */
11719 cp_lexer_consume_token (parser->lexer);
11721 scoped_enum_p = true;
11724 attributes = cp_parser_attributes_opt (parser);
11726 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
11727 identifier = cp_parser_identifier (parser);
11729 identifier = make_anon_name ();
11731 /* Check for the `:' that denotes a specified underlying type in C++0x. */
11732 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11734 cp_decl_specifier_seq type_specifiers;
11736 if (cxx_dialect == cxx98)
11737 maybe_warn_cpp0x ("scoped enums");
11739 /* Consume the `:'. */
11740 cp_lexer_consume_token (parser->lexer);
11742 /* Parse the type-specifier-seq. */
11743 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
11745 if (type_specifiers.type == error_mark_node)
11746 return error_mark_node;
11748 /* If that didn't work, stop. */
11749 if (type_specifiers.type != error_mark_node)
11751 underlying_type = grokdeclarator (NULL, &type_specifiers, TYPENAME,
11752 /*initialized=*/0, NULL);
11753 if (underlying_type == error_mark_node)
11754 underlying_type = NULL_TREE;
11757 cp_parser_error (parser, "expected underlying type of enumeration");
11760 /* Look for the `{' but don't consume it yet. */
11761 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11762 cp_parser_simulate_error (parser);
11764 if (!cp_parser_parse_definitely (parser))
11767 /* Issue an error message if type-definitions are forbidden here. */
11768 if (!cp_parser_check_type_definition (parser))
11769 type = error_mark_node;
11771 /* Create the new type. We do this before consuming the opening
11772 brace so the enum will be recorded as being on the line of its
11773 tag (or the 'enum' keyword, if there is no tag). */
11774 type = start_enum (identifier, underlying_type, scoped_enum_p);
11776 /* Consume the opening brace. */
11777 cp_lexer_consume_token (parser->lexer);
11779 if (type == error_mark_node)
11781 cp_parser_skip_to_end_of_block_or_statement (parser);
11782 return error_mark_node;
11785 /* If the next token is not '}', then there are some enumerators. */
11786 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
11787 cp_parser_enumerator_list (parser, type);
11789 /* Consume the final '}'. */
11790 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
11792 /* Look for trailing attributes to apply to this enumeration, and
11793 apply them if appropriate. */
11794 if (cp_parser_allow_gnu_extensions_p (parser))
11796 tree trailing_attr = cp_parser_attributes_opt (parser);
11797 cplus_decl_attributes (&type,
11799 (int) ATTR_FLAG_TYPE_IN_PLACE);
11802 /* Finish up the enumeration. */
11803 finish_enum (type);
11808 /* Parse an enumerator-list. The enumerators all have the indicated
11812 enumerator-definition
11813 enumerator-list , enumerator-definition */
11816 cp_parser_enumerator_list (cp_parser* parser, tree type)
11820 /* Parse an enumerator-definition. */
11821 cp_parser_enumerator_definition (parser, type);
11823 /* If the next token is not a ',', we've reached the end of
11825 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11827 /* Otherwise, consume the `,' and keep going. */
11828 cp_lexer_consume_token (parser->lexer);
11829 /* If the next token is a `}', there is a trailing comma. */
11830 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
11832 if (!in_system_header)
11833 pedwarn (input_location, OPT_pedantic, "comma at end of enumerator list");
11839 /* Parse an enumerator-definition. The enumerator has the indicated
11842 enumerator-definition:
11844 enumerator = constant-expression
11850 cp_parser_enumerator_definition (cp_parser* parser, tree type)
11855 /* Look for the identifier. */
11856 identifier = cp_parser_identifier (parser);
11857 if (identifier == error_mark_node)
11860 /* If the next token is an '=', then there is an explicit value. */
11861 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11863 /* Consume the `=' token. */
11864 cp_lexer_consume_token (parser->lexer);
11865 /* Parse the value. */
11866 value = cp_parser_constant_expression (parser,
11867 /*allow_non_constant_p=*/false,
11873 /* Create the enumerator. */
11874 build_enumerator (identifier, value, type);
11877 /* Parse a namespace-name.
11880 original-namespace-name
11883 Returns the NAMESPACE_DECL for the namespace. */
11886 cp_parser_namespace_name (cp_parser* parser)
11889 tree namespace_decl;
11891 cp_token *token = cp_lexer_peek_token (parser->lexer);
11893 /* Get the name of the namespace. */
11894 identifier = cp_parser_identifier (parser);
11895 if (identifier == error_mark_node)
11896 return error_mark_node;
11898 /* Look up the identifier in the currently active scope. Look only
11899 for namespaces, due to:
11901 [basic.lookup.udir]
11903 When looking up a namespace-name in a using-directive or alias
11904 definition, only namespace names are considered.
11908 [basic.lookup.qual]
11910 During the lookup of a name preceding the :: scope resolution
11911 operator, object, function, and enumerator names are ignored.
11913 (Note that cp_parser_qualifying_entity only calls this
11914 function if the token after the name is the scope resolution
11916 namespace_decl = cp_parser_lookup_name (parser, identifier,
11918 /*is_template=*/false,
11919 /*is_namespace=*/true,
11920 /*check_dependency=*/true,
11921 /*ambiguous_decls=*/NULL,
11923 /* If it's not a namespace, issue an error. */
11924 if (namespace_decl == error_mark_node
11925 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
11927 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
11928 error ("%H%qD is not a namespace-name", &token->location, identifier);
11929 cp_parser_error (parser, "expected namespace-name");
11930 namespace_decl = error_mark_node;
11933 return namespace_decl;
11936 /* Parse a namespace-definition.
11938 namespace-definition:
11939 named-namespace-definition
11940 unnamed-namespace-definition
11942 named-namespace-definition:
11943 original-namespace-definition
11944 extension-namespace-definition
11946 original-namespace-definition:
11947 namespace identifier { namespace-body }
11949 extension-namespace-definition:
11950 namespace original-namespace-name { namespace-body }
11952 unnamed-namespace-definition:
11953 namespace { namespace-body } */
11956 cp_parser_namespace_definition (cp_parser* parser)
11958 tree identifier, attribs;
11959 bool has_visibility;
11962 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_INLINE))
11965 cp_lexer_consume_token (parser->lexer);
11970 /* Look for the `namespace' keyword. */
11971 cp_parser_require_keyword (parser, RID_NAMESPACE, "%<namespace%>");
11973 /* Get the name of the namespace. We do not attempt to distinguish
11974 between an original-namespace-definition and an
11975 extension-namespace-definition at this point. The semantic
11976 analysis routines are responsible for that. */
11977 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
11978 identifier = cp_parser_identifier (parser);
11980 identifier = NULL_TREE;
11982 /* Parse any specified attributes. */
11983 attribs = cp_parser_attributes_opt (parser);
11985 /* Look for the `{' to start the namespace. */
11986 cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>");
11987 /* Start the namespace. */
11988 push_namespace (identifier);
11990 /* "inline namespace" is equivalent to a stub namespace definition
11991 followed by a strong using directive. */
11994 tree name_space = current_namespace;
11995 /* Set up namespace association. */
11996 DECL_NAMESPACE_ASSOCIATIONS (name_space)
11997 = tree_cons (CP_DECL_CONTEXT (name_space), NULL_TREE,
11998 DECL_NAMESPACE_ASSOCIATIONS (name_space));
11999 /* Import the contents of the inline namespace. */
12001 do_using_directive (name_space);
12002 push_namespace (identifier);
12005 has_visibility = handle_namespace_attrs (current_namespace, attribs);
12007 /* Parse the body of the namespace. */
12008 cp_parser_namespace_body (parser);
12010 #ifdef HANDLE_PRAGMA_VISIBILITY
12011 if (has_visibility)
12015 /* Finish the namespace. */
12017 /* Look for the final `}'. */
12018 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
12021 /* Parse a namespace-body.
12024 declaration-seq [opt] */
12027 cp_parser_namespace_body (cp_parser* parser)
12029 cp_parser_declaration_seq_opt (parser);
12032 /* Parse a namespace-alias-definition.
12034 namespace-alias-definition:
12035 namespace identifier = qualified-namespace-specifier ; */
12038 cp_parser_namespace_alias_definition (cp_parser* parser)
12041 tree namespace_specifier;
12043 cp_token *token = cp_lexer_peek_token (parser->lexer);
12045 /* Look for the `namespace' keyword. */
12046 cp_parser_require_keyword (parser, RID_NAMESPACE, "%<namespace%>");
12047 /* Look for the identifier. */
12048 identifier = cp_parser_identifier (parser);
12049 if (identifier == error_mark_node)
12051 /* Look for the `=' token. */
12052 if (!cp_parser_uncommitted_to_tentative_parse_p (parser)
12053 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
12055 error ("%H%<namespace%> definition is not allowed here", &token->location);
12056 /* Skip the definition. */
12057 cp_lexer_consume_token (parser->lexer);
12058 if (cp_parser_skip_to_closing_brace (parser))
12059 cp_lexer_consume_token (parser->lexer);
12062 cp_parser_require (parser, CPP_EQ, "%<=%>");
12063 /* Look for the qualified-namespace-specifier. */
12064 namespace_specifier
12065 = cp_parser_qualified_namespace_specifier (parser);
12066 /* Look for the `;' token. */
12067 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12069 /* Register the alias in the symbol table. */
12070 do_namespace_alias (identifier, namespace_specifier);
12073 /* Parse a qualified-namespace-specifier.
12075 qualified-namespace-specifier:
12076 :: [opt] nested-name-specifier [opt] namespace-name
12078 Returns a NAMESPACE_DECL corresponding to the specified
12082 cp_parser_qualified_namespace_specifier (cp_parser* parser)
12084 /* Look for the optional `::'. */
12085 cp_parser_global_scope_opt (parser,
12086 /*current_scope_valid_p=*/false);
12088 /* Look for the optional nested-name-specifier. */
12089 cp_parser_nested_name_specifier_opt (parser,
12090 /*typename_keyword_p=*/false,
12091 /*check_dependency_p=*/true,
12093 /*is_declaration=*/true);
12095 return cp_parser_namespace_name (parser);
12098 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
12099 access declaration.
12102 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
12103 using :: unqualified-id ;
12105 access-declaration:
12111 cp_parser_using_declaration (cp_parser* parser,
12112 bool access_declaration_p)
12115 bool typename_p = false;
12116 bool global_scope_p;
12121 if (access_declaration_p)
12122 cp_parser_parse_tentatively (parser);
12125 /* Look for the `using' keyword. */
12126 cp_parser_require_keyword (parser, RID_USING, "%<using%>");
12128 /* Peek at the next token. */
12129 token = cp_lexer_peek_token (parser->lexer);
12130 /* See if it's `typename'. */
12131 if (token->keyword == RID_TYPENAME)
12133 /* Remember that we've seen it. */
12135 /* Consume the `typename' token. */
12136 cp_lexer_consume_token (parser->lexer);
12140 /* Look for the optional global scope qualification. */
12142 = (cp_parser_global_scope_opt (parser,
12143 /*current_scope_valid_p=*/false)
12146 /* If we saw `typename', or didn't see `::', then there must be a
12147 nested-name-specifier present. */
12148 if (typename_p || !global_scope_p)
12149 qscope = cp_parser_nested_name_specifier (parser, typename_p,
12150 /*check_dependency_p=*/true,
12152 /*is_declaration=*/true);
12153 /* Otherwise, we could be in either of the two productions. In that
12154 case, treat the nested-name-specifier as optional. */
12156 qscope = cp_parser_nested_name_specifier_opt (parser,
12157 /*typename_keyword_p=*/false,
12158 /*check_dependency_p=*/true,
12160 /*is_declaration=*/true);
12162 qscope = global_namespace;
12164 if (access_declaration_p && cp_parser_error_occurred (parser))
12165 /* Something has already gone wrong; there's no need to parse
12166 further. Since an error has occurred, the return value of
12167 cp_parser_parse_definitely will be false, as required. */
12168 return cp_parser_parse_definitely (parser);
12170 token = cp_lexer_peek_token (parser->lexer);
12171 /* Parse the unqualified-id. */
12172 identifier = cp_parser_unqualified_id (parser,
12173 /*template_keyword_p=*/false,
12174 /*check_dependency_p=*/true,
12175 /*declarator_p=*/true,
12176 /*optional_p=*/false);
12178 if (access_declaration_p)
12180 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
12181 cp_parser_simulate_error (parser);
12182 if (!cp_parser_parse_definitely (parser))
12186 /* The function we call to handle a using-declaration is different
12187 depending on what scope we are in. */
12188 if (qscope == error_mark_node || identifier == error_mark_node)
12190 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
12191 && TREE_CODE (identifier) != BIT_NOT_EXPR)
12192 /* [namespace.udecl]
12194 A using declaration shall not name a template-id. */
12195 error ("%Ha template-id may not appear in a using-declaration",
12199 if (at_class_scope_p ())
12201 /* Create the USING_DECL. */
12202 decl = do_class_using_decl (parser->scope, identifier);
12204 if (check_for_bare_parameter_packs (decl))
12207 /* Add it to the list of members in this class. */
12208 finish_member_declaration (decl);
12212 decl = cp_parser_lookup_name_simple (parser,
12215 if (decl == error_mark_node)
12216 cp_parser_name_lookup_error (parser, identifier,
12219 else if (check_for_bare_parameter_packs (decl))
12221 else if (!at_namespace_scope_p ())
12222 do_local_using_decl (decl, qscope, identifier);
12224 do_toplevel_using_decl (decl, qscope, identifier);
12228 /* Look for the final `;'. */
12229 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12234 /* Parse a using-directive.
12237 using namespace :: [opt] nested-name-specifier [opt]
12238 namespace-name ; */
12241 cp_parser_using_directive (cp_parser* parser)
12243 tree namespace_decl;
12246 /* Look for the `using' keyword. */
12247 cp_parser_require_keyword (parser, RID_USING, "%<using%>");
12248 /* And the `namespace' keyword. */
12249 cp_parser_require_keyword (parser, RID_NAMESPACE, "%<namespace%>");
12250 /* Look for the optional `::' operator. */
12251 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
12252 /* And the optional nested-name-specifier. */
12253 cp_parser_nested_name_specifier_opt (parser,
12254 /*typename_keyword_p=*/false,
12255 /*check_dependency_p=*/true,
12257 /*is_declaration=*/true);
12258 /* Get the namespace being used. */
12259 namespace_decl = cp_parser_namespace_name (parser);
12260 /* And any specified attributes. */
12261 attribs = cp_parser_attributes_opt (parser);
12262 /* Update the symbol table. */
12263 parse_using_directive (namespace_decl, attribs);
12264 /* Look for the final `;'. */
12265 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12268 /* Parse an asm-definition.
12271 asm ( string-literal ) ;
12276 asm volatile [opt] ( string-literal ) ;
12277 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
12278 asm volatile [opt] ( string-literal : asm-operand-list [opt]
12279 : asm-operand-list [opt] ) ;
12280 asm volatile [opt] ( string-literal : asm-operand-list [opt]
12281 : asm-operand-list [opt]
12282 : asm-operand-list [opt] ) ; */
12285 cp_parser_asm_definition (cp_parser* parser)
12288 tree outputs = NULL_TREE;
12289 tree inputs = NULL_TREE;
12290 tree clobbers = NULL_TREE;
12292 bool volatile_p = false;
12293 bool extended_p = false;
12294 bool invalid_inputs_p = false;
12295 bool invalid_outputs_p = false;
12297 /* Look for the `asm' keyword. */
12298 cp_parser_require_keyword (parser, RID_ASM, "%<asm%>");
12299 /* See if the next token is `volatile'. */
12300 if (cp_parser_allow_gnu_extensions_p (parser)
12301 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
12303 /* Remember that we saw the `volatile' keyword. */
12305 /* Consume the token. */
12306 cp_lexer_consume_token (parser->lexer);
12308 /* Look for the opening `('. */
12309 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
12311 /* Look for the string. */
12312 string = cp_parser_string_literal (parser, false, false);
12313 if (string == error_mark_node)
12315 cp_parser_skip_to_closing_parenthesis (parser, true, false,
12316 /*consume_paren=*/true);
12320 /* If we're allowing GNU extensions, check for the extended assembly
12321 syntax. Unfortunately, the `:' tokens need not be separated by
12322 a space in C, and so, for compatibility, we tolerate that here
12323 too. Doing that means that we have to treat the `::' operator as
12325 if (cp_parser_allow_gnu_extensions_p (parser)
12326 && parser->in_function_body
12327 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
12328 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
12330 bool inputs_p = false;
12331 bool clobbers_p = false;
12333 /* The extended syntax was used. */
12336 /* Look for outputs. */
12337 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12339 /* Consume the `:'. */
12340 cp_lexer_consume_token (parser->lexer);
12341 /* Parse the output-operands. */
12342 if (cp_lexer_next_token_is_not (parser->lexer,
12344 && cp_lexer_next_token_is_not (parser->lexer,
12346 && cp_lexer_next_token_is_not (parser->lexer,
12348 outputs = cp_parser_asm_operand_list (parser);
12350 if (outputs == error_mark_node)
12351 invalid_outputs_p = true;
12353 /* If the next token is `::', there are no outputs, and the
12354 next token is the beginning of the inputs. */
12355 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12356 /* The inputs are coming next. */
12359 /* Look for inputs. */
12361 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12363 /* Consume the `:' or `::'. */
12364 cp_lexer_consume_token (parser->lexer);
12365 /* Parse the output-operands. */
12366 if (cp_lexer_next_token_is_not (parser->lexer,
12368 && cp_lexer_next_token_is_not (parser->lexer,
12370 inputs = cp_parser_asm_operand_list (parser);
12372 if (inputs == error_mark_node)
12373 invalid_inputs_p = true;
12375 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12376 /* The clobbers are coming next. */
12379 /* Look for clobbers. */
12381 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12383 /* Consume the `:' or `::'. */
12384 cp_lexer_consume_token (parser->lexer);
12385 /* Parse the clobbers. */
12386 if (cp_lexer_next_token_is_not (parser->lexer,
12388 clobbers = cp_parser_asm_clobber_list (parser);
12391 /* Look for the closing `)'. */
12392 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
12393 cp_parser_skip_to_closing_parenthesis (parser, true, false,
12394 /*consume_paren=*/true);
12395 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12397 if (!invalid_inputs_p && !invalid_outputs_p)
12399 /* Create the ASM_EXPR. */
12400 if (parser->in_function_body)
12402 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
12404 /* If the extended syntax was not used, mark the ASM_EXPR. */
12407 tree temp = asm_stmt;
12408 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
12409 temp = TREE_OPERAND (temp, 0);
12411 ASM_INPUT_P (temp) = 1;
12415 cgraph_add_asm_node (string);
12419 /* Declarators [gram.dcl.decl] */
12421 /* Parse an init-declarator.
12424 declarator initializer [opt]
12429 declarator asm-specification [opt] attributes [opt] initializer [opt]
12431 function-definition:
12432 decl-specifier-seq [opt] declarator ctor-initializer [opt]
12434 decl-specifier-seq [opt] declarator function-try-block
12438 function-definition:
12439 __extension__ function-definition
12441 The DECL_SPECIFIERS apply to this declarator. Returns a
12442 representation of the entity declared. If MEMBER_P is TRUE, then
12443 this declarator appears in a class scope. The new DECL created by
12444 this declarator is returned.
12446 The CHECKS are access checks that should be performed once we know
12447 what entity is being declared (and, therefore, what classes have
12450 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
12451 for a function-definition here as well. If the declarator is a
12452 declarator for a function-definition, *FUNCTION_DEFINITION_P will
12453 be TRUE upon return. By that point, the function-definition will
12454 have been completely parsed.
12456 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
12460 cp_parser_init_declarator (cp_parser* parser,
12461 cp_decl_specifier_seq *decl_specifiers,
12462 VEC (deferred_access_check,gc)* checks,
12463 bool function_definition_allowed_p,
12465 int declares_class_or_enum,
12466 bool* function_definition_p)
12468 cp_token *token = NULL, *asm_spec_start_token = NULL,
12469 *attributes_start_token = NULL;
12470 cp_declarator *declarator;
12471 tree prefix_attributes;
12473 tree asm_specification;
12475 tree decl = NULL_TREE;
12477 int is_initialized;
12478 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
12479 initialized with "= ..", CPP_OPEN_PAREN if initialized with
12481 enum cpp_ttype initialization_kind;
12482 bool is_direct_init = false;
12483 bool is_non_constant_init;
12484 int ctor_dtor_or_conv_p;
12486 tree pushed_scope = NULL;
12488 /* Gather the attributes that were provided with the
12489 decl-specifiers. */
12490 prefix_attributes = decl_specifiers->attributes;
12492 /* Assume that this is not the declarator for a function
12494 if (function_definition_p)
12495 *function_definition_p = false;
12497 /* Defer access checks while parsing the declarator; we cannot know
12498 what names are accessible until we know what is being
12500 resume_deferring_access_checks ();
12502 /* Parse the declarator. */
12503 token = cp_lexer_peek_token (parser->lexer);
12505 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
12506 &ctor_dtor_or_conv_p,
12507 /*parenthesized_p=*/NULL,
12508 /*member_p=*/false);
12509 /* Gather up the deferred checks. */
12510 stop_deferring_access_checks ();
12512 /* If the DECLARATOR was erroneous, there's no need to go
12514 if (declarator == cp_error_declarator)
12515 return error_mark_node;
12517 /* Check that the number of template-parameter-lists is OK. */
12518 if (!cp_parser_check_declarator_template_parameters (parser, declarator,
12520 return error_mark_node;
12522 if (declares_class_or_enum & 2)
12523 cp_parser_check_for_definition_in_return_type (declarator,
12524 decl_specifiers->type,
12525 decl_specifiers->type_location);
12527 /* Figure out what scope the entity declared by the DECLARATOR is
12528 located in. `grokdeclarator' sometimes changes the scope, so
12529 we compute it now. */
12530 scope = get_scope_of_declarator (declarator);
12532 /* If we're allowing GNU extensions, look for an asm-specification
12534 if (cp_parser_allow_gnu_extensions_p (parser))
12536 /* Look for an asm-specification. */
12537 asm_spec_start_token = cp_lexer_peek_token (parser->lexer);
12538 asm_specification = cp_parser_asm_specification_opt (parser);
12539 /* And attributes. */
12540 attributes_start_token = cp_lexer_peek_token (parser->lexer);
12541 attributes = cp_parser_attributes_opt (parser);
12545 asm_specification = NULL_TREE;
12546 attributes = NULL_TREE;
12549 /* Peek at the next token. */
12550 token = cp_lexer_peek_token (parser->lexer);
12551 /* Check to see if the token indicates the start of a
12552 function-definition. */
12553 if (function_declarator_p (declarator)
12554 && cp_parser_token_starts_function_definition_p (token))
12556 if (!function_definition_allowed_p)
12558 /* If a function-definition should not appear here, issue an
12560 cp_parser_error (parser,
12561 "a function-definition is not allowed here");
12562 return error_mark_node;
12566 location_t func_brace_location
12567 = cp_lexer_peek_token (parser->lexer)->location;
12569 /* Neither attributes nor an asm-specification are allowed
12570 on a function-definition. */
12571 if (asm_specification)
12572 error ("%Han asm-specification is not allowed "
12573 "on a function-definition",
12574 &asm_spec_start_token->location);
12576 error ("%Hattributes are not allowed on a function-definition",
12577 &attributes_start_token->location);
12578 /* This is a function-definition. */
12579 *function_definition_p = true;
12581 /* Parse the function definition. */
12583 decl = cp_parser_save_member_function_body (parser,
12586 prefix_attributes);
12589 = (cp_parser_function_definition_from_specifiers_and_declarator
12590 (parser, decl_specifiers, prefix_attributes, declarator));
12592 if (decl != error_mark_node && DECL_STRUCT_FUNCTION (decl))
12594 /* This is where the prologue starts... */
12595 DECL_STRUCT_FUNCTION (decl)->function_start_locus
12596 = func_brace_location;
12605 Only in function declarations for constructors, destructors, and
12606 type conversions can the decl-specifier-seq be omitted.
12608 We explicitly postpone this check past the point where we handle
12609 function-definitions because we tolerate function-definitions
12610 that are missing their return types in some modes. */
12611 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
12613 cp_parser_error (parser,
12614 "expected constructor, destructor, or type conversion");
12615 return error_mark_node;
12618 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
12619 if (token->type == CPP_EQ
12620 || token->type == CPP_OPEN_PAREN
12621 || token->type == CPP_OPEN_BRACE)
12623 is_initialized = SD_INITIALIZED;
12624 initialization_kind = token->type;
12626 if (token->type == CPP_EQ
12627 && function_declarator_p (declarator))
12629 cp_token *t2 = cp_lexer_peek_nth_token (parser->lexer, 2);
12630 if (t2->keyword == RID_DEFAULT)
12631 is_initialized = SD_DEFAULTED;
12632 else if (t2->keyword == RID_DELETE)
12633 is_initialized = SD_DELETED;
12638 /* If the init-declarator isn't initialized and isn't followed by a
12639 `,' or `;', it's not a valid init-declarator. */
12640 if (token->type != CPP_COMMA
12641 && token->type != CPP_SEMICOLON)
12643 cp_parser_error (parser, "expected initializer");
12644 return error_mark_node;
12646 is_initialized = SD_UNINITIALIZED;
12647 initialization_kind = CPP_EOF;
12650 /* Because start_decl has side-effects, we should only call it if we
12651 know we're going ahead. By this point, we know that we cannot
12652 possibly be looking at any other construct. */
12653 cp_parser_commit_to_tentative_parse (parser);
12655 /* If the decl specifiers were bad, issue an error now that we're
12656 sure this was intended to be a declarator. Then continue
12657 declaring the variable(s), as int, to try to cut down on further
12659 if (decl_specifiers->any_specifiers_p
12660 && decl_specifiers->type == error_mark_node)
12662 cp_parser_error (parser, "invalid type in declaration");
12663 decl_specifiers->type = integer_type_node;
12666 /* Check to see whether or not this declaration is a friend. */
12667 friend_p = cp_parser_friend_p (decl_specifiers);
12669 /* Enter the newly declared entry in the symbol table. If we're
12670 processing a declaration in a class-specifier, we wait until
12671 after processing the initializer. */
12674 if (parser->in_unbraced_linkage_specification_p)
12675 decl_specifiers->storage_class = sc_extern;
12676 decl = start_decl (declarator, decl_specifiers,
12677 is_initialized, attributes, prefix_attributes,
12681 /* Enter the SCOPE. That way unqualified names appearing in the
12682 initializer will be looked up in SCOPE. */
12683 pushed_scope = push_scope (scope);
12685 /* Perform deferred access control checks, now that we know in which
12686 SCOPE the declared entity resides. */
12687 if (!member_p && decl)
12689 tree saved_current_function_decl = NULL_TREE;
12691 /* If the entity being declared is a function, pretend that we
12692 are in its scope. If it is a `friend', it may have access to
12693 things that would not otherwise be accessible. */
12694 if (TREE_CODE (decl) == FUNCTION_DECL)
12696 saved_current_function_decl = current_function_decl;
12697 current_function_decl = decl;
12700 /* Perform access checks for template parameters. */
12701 cp_parser_perform_template_parameter_access_checks (checks);
12703 /* Perform the access control checks for the declarator and the
12704 decl-specifiers. */
12705 perform_deferred_access_checks ();
12707 /* Restore the saved value. */
12708 if (TREE_CODE (decl) == FUNCTION_DECL)
12709 current_function_decl = saved_current_function_decl;
12712 /* Parse the initializer. */
12713 initializer = NULL_TREE;
12714 is_direct_init = false;
12715 is_non_constant_init = true;
12716 if (is_initialized)
12718 if (function_declarator_p (declarator))
12720 cp_token *initializer_start_token = cp_lexer_peek_token (parser->lexer);
12721 if (initialization_kind == CPP_EQ)
12722 initializer = cp_parser_pure_specifier (parser);
12725 /* If the declaration was erroneous, we don't really
12726 know what the user intended, so just silently
12727 consume the initializer. */
12728 if (decl != error_mark_node)
12729 error ("%Hinitializer provided for function",
12730 &initializer_start_token->location);
12731 cp_parser_skip_to_closing_parenthesis (parser,
12732 /*recovering=*/true,
12733 /*or_comma=*/false,
12734 /*consume_paren=*/true);
12738 initializer = cp_parser_initializer (parser,
12740 &is_non_constant_init);
12743 /* The old parser allows attributes to appear after a parenthesized
12744 initializer. Mark Mitchell proposed removing this functionality
12745 on the GCC mailing lists on 2002-08-13. This parser accepts the
12746 attributes -- but ignores them. */
12747 if (cp_parser_allow_gnu_extensions_p (parser)
12748 && initialization_kind == CPP_OPEN_PAREN)
12749 if (cp_parser_attributes_opt (parser))
12750 warning (OPT_Wattributes,
12751 "attributes after parenthesized initializer ignored");
12753 /* For an in-class declaration, use `grokfield' to create the
12759 pop_scope (pushed_scope);
12760 pushed_scope = false;
12762 decl = grokfield (declarator, decl_specifiers,
12763 initializer, !is_non_constant_init,
12764 /*asmspec=*/NULL_TREE,
12765 prefix_attributes);
12766 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
12767 cp_parser_save_default_args (parser, decl);
12770 /* Finish processing the declaration. But, skip friend
12772 if (!friend_p && decl && decl != error_mark_node)
12774 cp_finish_decl (decl,
12775 initializer, !is_non_constant_init,
12777 /* If the initializer is in parentheses, then this is
12778 a direct-initialization, which means that an
12779 `explicit' constructor is OK. Otherwise, an
12780 `explicit' constructor cannot be used. */
12781 ((is_direct_init || !is_initialized)
12782 ? 0 : LOOKUP_ONLYCONVERTING));
12784 else if ((cxx_dialect != cxx98) && friend_p
12785 && decl && TREE_CODE (decl) == FUNCTION_DECL)
12786 /* Core issue #226 (C++0x only): A default template-argument
12787 shall not be specified in a friend class template
12789 check_default_tmpl_args (decl, current_template_parms, /*is_primary=*/1,
12790 /*is_partial=*/0, /*is_friend_decl=*/1);
12792 if (!friend_p && pushed_scope)
12793 pop_scope (pushed_scope);
12798 /* Parse a declarator.
12802 ptr-operator declarator
12804 abstract-declarator:
12805 ptr-operator abstract-declarator [opt]
12806 direct-abstract-declarator
12811 attributes [opt] direct-declarator
12812 attributes [opt] ptr-operator declarator
12814 abstract-declarator:
12815 attributes [opt] ptr-operator abstract-declarator [opt]
12816 attributes [opt] direct-abstract-declarator
12818 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
12819 detect constructor, destructor or conversion operators. It is set
12820 to -1 if the declarator is a name, and +1 if it is a
12821 function. Otherwise it is set to zero. Usually you just want to
12822 test for >0, but internally the negative value is used.
12824 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
12825 a decl-specifier-seq unless it declares a constructor, destructor,
12826 or conversion. It might seem that we could check this condition in
12827 semantic analysis, rather than parsing, but that makes it difficult
12828 to handle something like `f()'. We want to notice that there are
12829 no decl-specifiers, and therefore realize that this is an
12830 expression, not a declaration.)
12832 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
12833 the declarator is a direct-declarator of the form "(...)".
12835 MEMBER_P is true iff this declarator is a member-declarator. */
12837 static cp_declarator *
12838 cp_parser_declarator (cp_parser* parser,
12839 cp_parser_declarator_kind dcl_kind,
12840 int* ctor_dtor_or_conv_p,
12841 bool* parenthesized_p,
12845 cp_declarator *declarator;
12846 enum tree_code code;
12847 cp_cv_quals cv_quals;
12849 tree attributes = NULL_TREE;
12851 /* Assume this is not a constructor, destructor, or type-conversion
12853 if (ctor_dtor_or_conv_p)
12854 *ctor_dtor_or_conv_p = 0;
12856 if (cp_parser_allow_gnu_extensions_p (parser))
12857 attributes = cp_parser_attributes_opt (parser);
12859 /* Peek at the next token. */
12860 token = cp_lexer_peek_token (parser->lexer);
12862 /* Check for the ptr-operator production. */
12863 cp_parser_parse_tentatively (parser);
12864 /* Parse the ptr-operator. */
12865 code = cp_parser_ptr_operator (parser,
12868 /* If that worked, then we have a ptr-operator. */
12869 if (cp_parser_parse_definitely (parser))
12871 /* If a ptr-operator was found, then this declarator was not
12873 if (parenthesized_p)
12874 *parenthesized_p = true;
12875 /* The dependent declarator is optional if we are parsing an
12876 abstract-declarator. */
12877 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
12878 cp_parser_parse_tentatively (parser);
12880 /* Parse the dependent declarator. */
12881 declarator = cp_parser_declarator (parser, dcl_kind,
12882 /*ctor_dtor_or_conv_p=*/NULL,
12883 /*parenthesized_p=*/NULL,
12884 /*member_p=*/false);
12886 /* If we are parsing an abstract-declarator, we must handle the
12887 case where the dependent declarator is absent. */
12888 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
12889 && !cp_parser_parse_definitely (parser))
12892 declarator = cp_parser_make_indirect_declarator
12893 (code, class_type, cv_quals, declarator);
12895 /* Everything else is a direct-declarator. */
12898 if (parenthesized_p)
12899 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
12901 declarator = cp_parser_direct_declarator (parser, dcl_kind,
12902 ctor_dtor_or_conv_p,
12906 if (attributes && declarator && declarator != cp_error_declarator)
12907 declarator->attributes = attributes;
12912 /* Parse a direct-declarator or direct-abstract-declarator.
12916 direct-declarator ( parameter-declaration-clause )
12917 cv-qualifier-seq [opt]
12918 exception-specification [opt]
12919 direct-declarator [ constant-expression [opt] ]
12922 direct-abstract-declarator:
12923 direct-abstract-declarator [opt]
12924 ( parameter-declaration-clause )
12925 cv-qualifier-seq [opt]
12926 exception-specification [opt]
12927 direct-abstract-declarator [opt] [ constant-expression [opt] ]
12928 ( abstract-declarator )
12930 Returns a representation of the declarator. DCL_KIND is
12931 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
12932 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
12933 we are parsing a direct-declarator. It is
12934 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
12935 of ambiguity we prefer an abstract declarator, as per
12936 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
12937 cp_parser_declarator. */
12939 static cp_declarator *
12940 cp_parser_direct_declarator (cp_parser* parser,
12941 cp_parser_declarator_kind dcl_kind,
12942 int* ctor_dtor_or_conv_p,
12946 cp_declarator *declarator = NULL;
12947 tree scope = NULL_TREE;
12948 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
12949 bool saved_in_declarator_p = parser->in_declarator_p;
12951 tree pushed_scope = NULL_TREE;
12955 /* Peek at the next token. */
12956 token = cp_lexer_peek_token (parser->lexer);
12957 if (token->type == CPP_OPEN_PAREN)
12959 /* This is either a parameter-declaration-clause, or a
12960 parenthesized declarator. When we know we are parsing a
12961 named declarator, it must be a parenthesized declarator
12962 if FIRST is true. For instance, `(int)' is a
12963 parameter-declaration-clause, with an omitted
12964 direct-abstract-declarator. But `((*))', is a
12965 parenthesized abstract declarator. Finally, when T is a
12966 template parameter `(T)' is a
12967 parameter-declaration-clause, and not a parenthesized
12970 We first try and parse a parameter-declaration-clause,
12971 and then try a nested declarator (if FIRST is true).
12973 It is not an error for it not to be a
12974 parameter-declaration-clause, even when FIRST is
12980 The first is the declaration of a function while the
12981 second is the definition of a variable, including its
12984 Having seen only the parenthesis, we cannot know which of
12985 these two alternatives should be selected. Even more
12986 complex are examples like:
12991 The former is a function-declaration; the latter is a
12992 variable initialization.
12994 Thus again, we try a parameter-declaration-clause, and if
12995 that fails, we back out and return. */
12997 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
13000 unsigned saved_num_template_parameter_lists;
13001 bool is_declarator = false;
13004 /* In a member-declarator, the only valid interpretation
13005 of a parenthesis is the start of a
13006 parameter-declaration-clause. (It is invalid to
13007 initialize a static data member with a parenthesized
13008 initializer; only the "=" form of initialization is
13011 cp_parser_parse_tentatively (parser);
13013 /* Consume the `('. */
13014 cp_lexer_consume_token (parser->lexer);
13017 /* If this is going to be an abstract declarator, we're
13018 in a declarator and we can't have default args. */
13019 parser->default_arg_ok_p = false;
13020 parser->in_declarator_p = true;
13023 /* Inside the function parameter list, surrounding
13024 template-parameter-lists do not apply. */
13025 saved_num_template_parameter_lists
13026 = parser->num_template_parameter_lists;
13027 parser->num_template_parameter_lists = 0;
13029 begin_scope (sk_function_parms, NULL_TREE);
13031 /* Parse the parameter-declaration-clause. */
13032 params = cp_parser_parameter_declaration_clause (parser);
13034 parser->num_template_parameter_lists
13035 = saved_num_template_parameter_lists;
13037 /* If all went well, parse the cv-qualifier-seq and the
13038 exception-specification. */
13039 if (member_p || cp_parser_parse_definitely (parser))
13041 cp_cv_quals cv_quals;
13042 tree exception_specification;
13045 is_declarator = true;
13047 if (ctor_dtor_or_conv_p)
13048 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
13050 /* Consume the `)'. */
13051 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
13053 /* Parse the cv-qualifier-seq. */
13054 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
13055 /* And the exception-specification. */
13056 exception_specification
13057 = cp_parser_exception_specification_opt (parser);
13060 = cp_parser_late_return_type_opt (parser);
13062 /* Create the function-declarator. */
13063 declarator = make_call_declarator (declarator,
13066 exception_specification,
13068 /* Any subsequent parameter lists are to do with
13069 return type, so are not those of the declared
13071 parser->default_arg_ok_p = false;
13074 /* Remove the function parms from scope. */
13075 for (t = current_binding_level->names; t; t = TREE_CHAIN (t))
13076 pop_binding (DECL_NAME (t), t);
13080 /* Repeat the main loop. */
13084 /* If this is the first, we can try a parenthesized
13088 bool saved_in_type_id_in_expr_p;
13090 parser->default_arg_ok_p = saved_default_arg_ok_p;
13091 parser->in_declarator_p = saved_in_declarator_p;
13093 /* Consume the `('. */
13094 cp_lexer_consume_token (parser->lexer);
13095 /* Parse the nested declarator. */
13096 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
13097 parser->in_type_id_in_expr_p = true;
13099 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
13100 /*parenthesized_p=*/NULL,
13102 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
13104 /* Expect a `)'. */
13105 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
13106 declarator = cp_error_declarator;
13107 if (declarator == cp_error_declarator)
13110 goto handle_declarator;
13112 /* Otherwise, we must be done. */
13116 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
13117 && token->type == CPP_OPEN_SQUARE)
13119 /* Parse an array-declarator. */
13122 if (ctor_dtor_or_conv_p)
13123 *ctor_dtor_or_conv_p = 0;
13126 parser->default_arg_ok_p = false;
13127 parser->in_declarator_p = true;
13128 /* Consume the `['. */
13129 cp_lexer_consume_token (parser->lexer);
13130 /* Peek at the next token. */
13131 token = cp_lexer_peek_token (parser->lexer);
13132 /* If the next token is `]', then there is no
13133 constant-expression. */
13134 if (token->type != CPP_CLOSE_SQUARE)
13136 bool non_constant_p;
13139 = cp_parser_constant_expression (parser,
13140 /*allow_non_constant=*/true,
13142 if (!non_constant_p)
13143 bounds = fold_non_dependent_expr (bounds);
13144 /* Normally, the array bound must be an integral constant
13145 expression. However, as an extension, we allow VLAs
13146 in function scopes. */
13147 else if (!parser->in_function_body)
13149 error ("%Harray bound is not an integer constant",
13151 bounds = error_mark_node;
13155 bounds = NULL_TREE;
13156 /* Look for the closing `]'. */
13157 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>"))
13159 declarator = cp_error_declarator;
13163 declarator = make_array_declarator (declarator, bounds);
13165 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
13167 tree qualifying_scope;
13168 tree unqualified_name;
13169 special_function_kind sfk;
13171 bool pack_expansion_p = false;
13172 cp_token *declarator_id_start_token;
13174 /* Parse a declarator-id */
13175 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
13178 cp_parser_parse_tentatively (parser);
13180 /* If we see an ellipsis, we should be looking at a
13182 if (token->type == CPP_ELLIPSIS)
13184 /* Consume the `...' */
13185 cp_lexer_consume_token (parser->lexer);
13187 pack_expansion_p = true;
13191 declarator_id_start_token = cp_lexer_peek_token (parser->lexer);
13193 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
13194 qualifying_scope = parser->scope;
13199 if (!unqualified_name && pack_expansion_p)
13201 /* Check whether an error occurred. */
13202 okay = !cp_parser_error_occurred (parser);
13204 /* We already consumed the ellipsis to mark a
13205 parameter pack, but we have no way to report it,
13206 so abort the tentative parse. We will be exiting
13207 immediately anyway. */
13208 cp_parser_abort_tentative_parse (parser);
13211 okay = cp_parser_parse_definitely (parser);
13214 unqualified_name = error_mark_node;
13215 else if (unqualified_name
13216 && (qualifying_scope
13217 || (TREE_CODE (unqualified_name)
13218 != IDENTIFIER_NODE)))
13220 cp_parser_error (parser, "expected unqualified-id");
13221 unqualified_name = error_mark_node;
13225 if (!unqualified_name)
13227 if (unqualified_name == error_mark_node)
13229 declarator = cp_error_declarator;
13230 pack_expansion_p = false;
13231 declarator->parameter_pack_p = false;
13235 if (qualifying_scope && at_namespace_scope_p ()
13236 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
13238 /* In the declaration of a member of a template class
13239 outside of the class itself, the SCOPE will sometimes
13240 be a TYPENAME_TYPE. For example, given:
13242 template <typename T>
13243 int S<T>::R::i = 3;
13245 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
13246 this context, we must resolve S<T>::R to an ordinary
13247 type, rather than a typename type.
13249 The reason we normally avoid resolving TYPENAME_TYPEs
13250 is that a specialization of `S' might render
13251 `S<T>::R' not a type. However, if `S' is
13252 specialized, then this `i' will not be used, so there
13253 is no harm in resolving the types here. */
13256 /* Resolve the TYPENAME_TYPE. */
13257 type = resolve_typename_type (qualifying_scope,
13258 /*only_current_p=*/false);
13259 /* If that failed, the declarator is invalid. */
13260 if (TREE_CODE (type) == TYPENAME_TYPE)
13261 error ("%H%<%T::%E%> is not a type",
13262 &declarator_id_start_token->location,
13263 TYPE_CONTEXT (qualifying_scope),
13264 TYPE_IDENTIFIER (qualifying_scope));
13265 qualifying_scope = type;
13270 if (unqualified_name)
13274 if (qualifying_scope
13275 && CLASS_TYPE_P (qualifying_scope))
13276 class_type = qualifying_scope;
13278 class_type = current_class_type;
13280 if (TREE_CODE (unqualified_name) == TYPE_DECL)
13282 tree name_type = TREE_TYPE (unqualified_name);
13283 if (class_type && same_type_p (name_type, class_type))
13285 if (qualifying_scope
13286 && CLASSTYPE_USE_TEMPLATE (name_type))
13288 error ("%Hinvalid use of constructor as a template",
13289 &declarator_id_start_token->location);
13290 inform (input_location, "use %<%T::%D%> instead of %<%T::%D%> to "
13291 "name the constructor in a qualified name",
13293 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
13294 class_type, name_type);
13295 declarator = cp_error_declarator;
13299 unqualified_name = constructor_name (class_type);
13303 /* We do not attempt to print the declarator
13304 here because we do not have enough
13305 information about its original syntactic
13307 cp_parser_error (parser, "invalid declarator");
13308 declarator = cp_error_declarator;
13315 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
13316 sfk = sfk_destructor;
13317 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
13318 sfk = sfk_conversion;
13319 else if (/* There's no way to declare a constructor
13320 for an anonymous type, even if the type
13321 got a name for linkage purposes. */
13322 !TYPE_WAS_ANONYMOUS (class_type)
13323 && constructor_name_p (unqualified_name,
13326 unqualified_name = constructor_name (class_type);
13327 sfk = sfk_constructor;
13330 if (ctor_dtor_or_conv_p && sfk != sfk_none)
13331 *ctor_dtor_or_conv_p = -1;
13334 declarator = make_id_declarator (qualifying_scope,
13337 declarator->id_loc = token->location;
13338 declarator->parameter_pack_p = pack_expansion_p;
13340 if (pack_expansion_p)
13341 maybe_warn_variadic_templates ();
13343 handle_declarator:;
13344 scope = get_scope_of_declarator (declarator);
13346 /* Any names that appear after the declarator-id for a
13347 member are looked up in the containing scope. */
13348 pushed_scope = push_scope (scope);
13349 parser->in_declarator_p = true;
13350 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
13351 || (declarator && declarator->kind == cdk_id))
13352 /* Default args are only allowed on function
13354 parser->default_arg_ok_p = saved_default_arg_ok_p;
13356 parser->default_arg_ok_p = false;
13365 /* For an abstract declarator, we might wind up with nothing at this
13366 point. That's an error; the declarator is not optional. */
13368 cp_parser_error (parser, "expected declarator");
13370 /* If we entered a scope, we must exit it now. */
13372 pop_scope (pushed_scope);
13374 parser->default_arg_ok_p = saved_default_arg_ok_p;
13375 parser->in_declarator_p = saved_in_declarator_p;
13380 /* Parse a ptr-operator.
13383 * cv-qualifier-seq [opt]
13385 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
13390 & cv-qualifier-seq [opt]
13392 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
13393 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
13394 an rvalue reference. In the case of a pointer-to-member, *TYPE is
13395 filled in with the TYPE containing the member. *CV_QUALS is
13396 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
13397 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
13398 Note that the tree codes returned by this function have nothing
13399 to do with the types of trees that will be eventually be created
13400 to represent the pointer or reference type being parsed. They are
13401 just constants with suggestive names. */
13402 static enum tree_code
13403 cp_parser_ptr_operator (cp_parser* parser,
13405 cp_cv_quals *cv_quals)
13407 enum tree_code code = ERROR_MARK;
13410 /* Assume that it's not a pointer-to-member. */
13412 /* And that there are no cv-qualifiers. */
13413 *cv_quals = TYPE_UNQUALIFIED;
13415 /* Peek at the next token. */
13416 token = cp_lexer_peek_token (parser->lexer);
13418 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
13419 if (token->type == CPP_MULT)
13420 code = INDIRECT_REF;
13421 else if (token->type == CPP_AND)
13423 else if ((cxx_dialect != cxx98) &&
13424 token->type == CPP_AND_AND) /* C++0x only */
13425 code = NON_LVALUE_EXPR;
13427 if (code != ERROR_MARK)
13429 /* Consume the `*', `&' or `&&'. */
13430 cp_lexer_consume_token (parser->lexer);
13432 /* A `*' can be followed by a cv-qualifier-seq, and so can a
13433 `&', if we are allowing GNU extensions. (The only qualifier
13434 that can legally appear after `&' is `restrict', but that is
13435 enforced during semantic analysis. */
13436 if (code == INDIRECT_REF
13437 || cp_parser_allow_gnu_extensions_p (parser))
13438 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
13442 /* Try the pointer-to-member case. */
13443 cp_parser_parse_tentatively (parser);
13444 /* Look for the optional `::' operator. */
13445 cp_parser_global_scope_opt (parser,
13446 /*current_scope_valid_p=*/false);
13447 /* Look for the nested-name specifier. */
13448 token = cp_lexer_peek_token (parser->lexer);
13449 cp_parser_nested_name_specifier (parser,
13450 /*typename_keyword_p=*/false,
13451 /*check_dependency_p=*/true,
13453 /*is_declaration=*/false);
13454 /* If we found it, and the next token is a `*', then we are
13455 indeed looking at a pointer-to-member operator. */
13456 if (!cp_parser_error_occurred (parser)
13457 && cp_parser_require (parser, CPP_MULT, "%<*%>"))
13459 /* Indicate that the `*' operator was used. */
13460 code = INDIRECT_REF;
13462 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
13463 error ("%H%qD is a namespace", &token->location, parser->scope);
13466 /* The type of which the member is a member is given by the
13468 *type = parser->scope;
13469 /* The next name will not be qualified. */
13470 parser->scope = NULL_TREE;
13471 parser->qualifying_scope = NULL_TREE;
13472 parser->object_scope = NULL_TREE;
13473 /* Look for the optional cv-qualifier-seq. */
13474 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
13477 /* If that didn't work we don't have a ptr-operator. */
13478 if (!cp_parser_parse_definitely (parser))
13479 cp_parser_error (parser, "expected ptr-operator");
13485 /* Parse an (optional) cv-qualifier-seq.
13488 cv-qualifier cv-qualifier-seq [opt]
13499 Returns a bitmask representing the cv-qualifiers. */
13502 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
13504 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
13509 cp_cv_quals cv_qualifier;
13511 /* Peek at the next token. */
13512 token = cp_lexer_peek_token (parser->lexer);
13513 /* See if it's a cv-qualifier. */
13514 switch (token->keyword)
13517 cv_qualifier = TYPE_QUAL_CONST;
13521 cv_qualifier = TYPE_QUAL_VOLATILE;
13525 cv_qualifier = TYPE_QUAL_RESTRICT;
13529 cv_qualifier = TYPE_UNQUALIFIED;
13536 if (cv_quals & cv_qualifier)
13538 error ("%Hduplicate cv-qualifier", &token->location);
13539 cp_lexer_purge_token (parser->lexer);
13543 cp_lexer_consume_token (parser->lexer);
13544 cv_quals |= cv_qualifier;
13551 /* Parse a late-specified return type, if any. This is not a separate
13552 non-terminal, but part of a function declarator, which looks like
13556 Returns the type indicated by the type-id. */
13559 cp_parser_late_return_type_opt (cp_parser* parser)
13563 /* Peek at the next token. */
13564 token = cp_lexer_peek_token (parser->lexer);
13565 /* A late-specified return type is indicated by an initial '->'. */
13566 if (token->type != CPP_DEREF)
13569 /* Consume the ->. */
13570 cp_lexer_consume_token (parser->lexer);
13572 return cp_parser_type_id (parser);
13575 /* Parse a declarator-id.
13579 :: [opt] nested-name-specifier [opt] type-name
13581 In the `id-expression' case, the value returned is as for
13582 cp_parser_id_expression if the id-expression was an unqualified-id.
13583 If the id-expression was a qualified-id, then a SCOPE_REF is
13584 returned. The first operand is the scope (either a NAMESPACE_DECL
13585 or TREE_TYPE), but the second is still just a representation of an
13589 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
13592 /* The expression must be an id-expression. Assume that qualified
13593 names are the names of types so that:
13596 int S<T>::R::i = 3;
13598 will work; we must treat `S<T>::R' as the name of a type.
13599 Similarly, assume that qualified names are templates, where
13603 int S<T>::R<T>::i = 3;
13606 id = cp_parser_id_expression (parser,
13607 /*template_keyword_p=*/false,
13608 /*check_dependency_p=*/false,
13609 /*template_p=*/NULL,
13610 /*declarator_p=*/true,
13612 if (id && BASELINK_P (id))
13613 id = BASELINK_FUNCTIONS (id);
13617 /* Parse a type-id.
13620 type-specifier-seq abstract-declarator [opt]
13622 Returns the TYPE specified. */
13625 cp_parser_type_id (cp_parser* parser)
13627 cp_decl_specifier_seq type_specifier_seq;
13628 cp_declarator *abstract_declarator;
13630 /* Parse the type-specifier-seq. */
13631 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
13632 &type_specifier_seq);
13633 if (type_specifier_seq.type == error_mark_node)
13634 return error_mark_node;
13636 /* There might or might not be an abstract declarator. */
13637 cp_parser_parse_tentatively (parser);
13638 /* Look for the declarator. */
13639 abstract_declarator
13640 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
13641 /*parenthesized_p=*/NULL,
13642 /*member_p=*/false);
13643 /* Check to see if there really was a declarator. */
13644 if (!cp_parser_parse_definitely (parser))
13645 abstract_declarator = NULL;
13647 return groktypename (&type_specifier_seq, abstract_declarator);
13650 /* Parse a type-specifier-seq.
13652 type-specifier-seq:
13653 type-specifier type-specifier-seq [opt]
13657 type-specifier-seq:
13658 attributes type-specifier-seq [opt]
13660 If IS_CONDITION is true, we are at the start of a "condition",
13661 e.g., we've just seen "if (".
13663 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
13666 cp_parser_type_specifier_seq (cp_parser* parser,
13668 cp_decl_specifier_seq *type_specifier_seq)
13670 bool seen_type_specifier = false;
13671 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
13672 cp_token *start_token = NULL;
13674 /* Clear the TYPE_SPECIFIER_SEQ. */
13675 clear_decl_specs (type_specifier_seq);
13677 /* Parse the type-specifiers and attributes. */
13680 tree type_specifier;
13681 bool is_cv_qualifier;
13683 /* Check for attributes first. */
13684 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
13686 type_specifier_seq->attributes =
13687 chainon (type_specifier_seq->attributes,
13688 cp_parser_attributes_opt (parser));
13692 /* record the token of the beginning of the type specifier seq,
13693 for error reporting purposes*/
13695 start_token = cp_lexer_peek_token (parser->lexer);
13697 /* Look for the type-specifier. */
13698 type_specifier = cp_parser_type_specifier (parser,
13700 type_specifier_seq,
13701 /*is_declaration=*/false,
13704 if (!type_specifier)
13706 /* If the first type-specifier could not be found, this is not a
13707 type-specifier-seq at all. */
13708 if (!seen_type_specifier)
13710 cp_parser_error (parser, "expected type-specifier");
13711 type_specifier_seq->type = error_mark_node;
13714 /* If subsequent type-specifiers could not be found, the
13715 type-specifier-seq is complete. */
13719 seen_type_specifier = true;
13720 /* The standard says that a condition can be:
13722 type-specifier-seq declarator = assignment-expression
13729 we should treat the "S" as a declarator, not as a
13730 type-specifier. The standard doesn't say that explicitly for
13731 type-specifier-seq, but it does say that for
13732 decl-specifier-seq in an ordinary declaration. Perhaps it
13733 would be clearer just to allow a decl-specifier-seq here, and
13734 then add a semantic restriction that if any decl-specifiers
13735 that are not type-specifiers appear, the program is invalid. */
13736 if (is_condition && !is_cv_qualifier)
13737 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
13740 cp_parser_check_decl_spec (type_specifier_seq, start_token->location);
13743 /* Parse a parameter-declaration-clause.
13745 parameter-declaration-clause:
13746 parameter-declaration-list [opt] ... [opt]
13747 parameter-declaration-list , ...
13749 Returns a representation for the parameter declarations. A return
13750 value of NULL indicates a parameter-declaration-clause consisting
13751 only of an ellipsis. */
13754 cp_parser_parameter_declaration_clause (cp_parser* parser)
13761 /* Peek at the next token. */
13762 token = cp_lexer_peek_token (parser->lexer);
13763 /* Check for trivial parameter-declaration-clauses. */
13764 if (token->type == CPP_ELLIPSIS)
13766 /* Consume the `...' token. */
13767 cp_lexer_consume_token (parser->lexer);
13770 else if (token->type == CPP_CLOSE_PAREN)
13771 /* There are no parameters. */
13773 #ifndef NO_IMPLICIT_EXTERN_C
13774 if (in_system_header && current_class_type == NULL
13775 && current_lang_name == lang_name_c)
13779 return void_list_node;
13781 /* Check for `(void)', too, which is a special case. */
13782 else if (token->keyword == RID_VOID
13783 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
13784 == CPP_CLOSE_PAREN))
13786 /* Consume the `void' token. */
13787 cp_lexer_consume_token (parser->lexer);
13788 /* There are no parameters. */
13789 return void_list_node;
13792 /* Parse the parameter-declaration-list. */
13793 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
13794 /* If a parse error occurred while parsing the
13795 parameter-declaration-list, then the entire
13796 parameter-declaration-clause is erroneous. */
13800 /* Peek at the next token. */
13801 token = cp_lexer_peek_token (parser->lexer);
13802 /* If it's a `,', the clause should terminate with an ellipsis. */
13803 if (token->type == CPP_COMMA)
13805 /* Consume the `,'. */
13806 cp_lexer_consume_token (parser->lexer);
13807 /* Expect an ellipsis. */
13809 = (cp_parser_require (parser, CPP_ELLIPSIS, "%<...%>") != NULL);
13811 /* It might also be `...' if the optional trailing `,' was
13813 else if (token->type == CPP_ELLIPSIS)
13815 /* Consume the `...' token. */
13816 cp_lexer_consume_token (parser->lexer);
13817 /* And remember that we saw it. */
13821 ellipsis_p = false;
13823 /* Finish the parameter list. */
13825 parameters = chainon (parameters, void_list_node);
13830 /* Parse a parameter-declaration-list.
13832 parameter-declaration-list:
13833 parameter-declaration
13834 parameter-declaration-list , parameter-declaration
13836 Returns a representation of the parameter-declaration-list, as for
13837 cp_parser_parameter_declaration_clause. However, the
13838 `void_list_node' is never appended to the list. Upon return,
13839 *IS_ERROR will be true iff an error occurred. */
13842 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
13844 tree parameters = NULL_TREE;
13845 tree *tail = ¶meters;
13846 bool saved_in_unbraced_linkage_specification_p;
13848 /* Assume all will go well. */
13850 /* The special considerations that apply to a function within an
13851 unbraced linkage specifications do not apply to the parameters
13852 to the function. */
13853 saved_in_unbraced_linkage_specification_p
13854 = parser->in_unbraced_linkage_specification_p;
13855 parser->in_unbraced_linkage_specification_p = false;
13857 /* Look for more parameters. */
13860 cp_parameter_declarator *parameter;
13861 tree decl = error_mark_node;
13862 bool parenthesized_p;
13863 /* Parse the parameter. */
13865 = cp_parser_parameter_declaration (parser,
13866 /*template_parm_p=*/false,
13869 /* We don't know yet if the enclosing context is deprecated, so wait
13870 and warn in grokparms if appropriate. */
13871 deprecated_state = DEPRECATED_SUPPRESS;
13874 decl = grokdeclarator (parameter->declarator,
13875 ¶meter->decl_specifiers,
13877 parameter->default_argument != NULL_TREE,
13878 ¶meter->decl_specifiers.attributes);
13880 deprecated_state = DEPRECATED_NORMAL;
13882 /* If a parse error occurred parsing the parameter declaration,
13883 then the entire parameter-declaration-list is erroneous. */
13884 if (decl == error_mark_node)
13887 parameters = error_mark_node;
13891 if (parameter->decl_specifiers.attributes)
13892 cplus_decl_attributes (&decl,
13893 parameter->decl_specifiers.attributes,
13895 if (DECL_NAME (decl))
13896 decl = pushdecl (decl);
13898 /* Add the new parameter to the list. */
13899 *tail = build_tree_list (parameter->default_argument, decl);
13900 tail = &TREE_CHAIN (*tail);
13902 /* Peek at the next token. */
13903 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
13904 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
13905 /* These are for Objective-C++ */
13906 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
13907 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13908 /* The parameter-declaration-list is complete. */
13910 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13914 /* Peek at the next token. */
13915 token = cp_lexer_peek_nth_token (parser->lexer, 2);
13916 /* If it's an ellipsis, then the list is complete. */
13917 if (token->type == CPP_ELLIPSIS)
13919 /* Otherwise, there must be more parameters. Consume the
13921 cp_lexer_consume_token (parser->lexer);
13922 /* When parsing something like:
13924 int i(float f, double d)
13926 we can tell after seeing the declaration for "f" that we
13927 are not looking at an initialization of a variable "i",
13928 but rather at the declaration of a function "i".
13930 Due to the fact that the parsing of template arguments
13931 (as specified to a template-id) requires backtracking we
13932 cannot use this technique when inside a template argument
13934 if (!parser->in_template_argument_list_p
13935 && !parser->in_type_id_in_expr_p
13936 && cp_parser_uncommitted_to_tentative_parse_p (parser)
13937 /* However, a parameter-declaration of the form
13938 "foat(f)" (which is a valid declaration of a
13939 parameter "f") can also be interpreted as an
13940 expression (the conversion of "f" to "float"). */
13941 && !parenthesized_p)
13942 cp_parser_commit_to_tentative_parse (parser);
13946 cp_parser_error (parser, "expected %<,%> or %<...%>");
13947 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
13948 cp_parser_skip_to_closing_parenthesis (parser,
13949 /*recovering=*/true,
13950 /*or_comma=*/false,
13951 /*consume_paren=*/false);
13956 parser->in_unbraced_linkage_specification_p
13957 = saved_in_unbraced_linkage_specification_p;
13962 /* Parse a parameter declaration.
13964 parameter-declaration:
13965 decl-specifier-seq ... [opt] declarator
13966 decl-specifier-seq declarator = assignment-expression
13967 decl-specifier-seq ... [opt] abstract-declarator [opt]
13968 decl-specifier-seq abstract-declarator [opt] = assignment-expression
13970 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
13971 declares a template parameter. (In that case, a non-nested `>'
13972 token encountered during the parsing of the assignment-expression
13973 is not interpreted as a greater-than operator.)
13975 Returns a representation of the parameter, or NULL if an error
13976 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
13977 true iff the declarator is of the form "(p)". */
13979 static cp_parameter_declarator *
13980 cp_parser_parameter_declaration (cp_parser *parser,
13981 bool template_parm_p,
13982 bool *parenthesized_p)
13984 int declares_class_or_enum;
13985 bool greater_than_is_operator_p;
13986 cp_decl_specifier_seq decl_specifiers;
13987 cp_declarator *declarator;
13988 tree default_argument;
13989 cp_token *token = NULL, *declarator_token_start = NULL;
13990 const char *saved_message;
13992 /* In a template parameter, `>' is not an operator.
13996 When parsing a default template-argument for a non-type
13997 template-parameter, the first non-nested `>' is taken as the end
13998 of the template parameter-list rather than a greater-than
14000 greater_than_is_operator_p = !template_parm_p;
14002 /* Type definitions may not appear in parameter types. */
14003 saved_message = parser->type_definition_forbidden_message;
14004 parser->type_definition_forbidden_message
14005 = "types may not be defined in parameter types";
14007 /* Parse the declaration-specifiers. */
14008 cp_parser_decl_specifier_seq (parser,
14009 CP_PARSER_FLAGS_NONE,
14011 &declares_class_or_enum);
14012 /* If an error occurred, there's no reason to attempt to parse the
14013 rest of the declaration. */
14014 if (cp_parser_error_occurred (parser))
14016 parser->type_definition_forbidden_message = saved_message;
14020 /* Peek at the next token. */
14021 token = cp_lexer_peek_token (parser->lexer);
14023 /* If the next token is a `)', `,', `=', `>', or `...', then there
14024 is no declarator. However, when variadic templates are enabled,
14025 there may be a declarator following `...'. */
14026 if (token->type == CPP_CLOSE_PAREN
14027 || token->type == CPP_COMMA
14028 || token->type == CPP_EQ
14029 || token->type == CPP_GREATER)
14032 if (parenthesized_p)
14033 *parenthesized_p = false;
14035 /* Otherwise, there should be a declarator. */
14038 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
14039 parser->default_arg_ok_p = false;
14041 /* After seeing a decl-specifier-seq, if the next token is not a
14042 "(", there is no possibility that the code is a valid
14043 expression. Therefore, if parsing tentatively, we commit at
14045 if (!parser->in_template_argument_list_p
14046 /* In an expression context, having seen:
14050 we cannot be sure whether we are looking at a
14051 function-type (taking a "char" as a parameter) or a cast
14052 of some object of type "char" to "int". */
14053 && !parser->in_type_id_in_expr_p
14054 && cp_parser_uncommitted_to_tentative_parse_p (parser)
14055 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
14056 cp_parser_commit_to_tentative_parse (parser);
14057 /* Parse the declarator. */
14058 declarator_token_start = token;
14059 declarator = cp_parser_declarator (parser,
14060 CP_PARSER_DECLARATOR_EITHER,
14061 /*ctor_dtor_or_conv_p=*/NULL,
14063 /*member_p=*/false);
14064 parser->default_arg_ok_p = saved_default_arg_ok_p;
14065 /* After the declarator, allow more attributes. */
14066 decl_specifiers.attributes
14067 = chainon (decl_specifiers.attributes,
14068 cp_parser_attributes_opt (parser));
14071 /* If the next token is an ellipsis, and we have not seen a
14072 declarator name, and the type of the declarator contains parameter
14073 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
14074 a parameter pack expansion expression. Otherwise, leave the
14075 ellipsis for a C-style variadic function. */
14076 token = cp_lexer_peek_token (parser->lexer);
14077 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14079 tree type = decl_specifiers.type;
14081 if (type && DECL_P (type))
14082 type = TREE_TYPE (type);
14085 && TREE_CODE (type) != TYPE_PACK_EXPANSION
14086 && declarator_can_be_parameter_pack (declarator)
14087 && (!declarator || !declarator->parameter_pack_p)
14088 && uses_parameter_packs (type))
14090 /* Consume the `...'. */
14091 cp_lexer_consume_token (parser->lexer);
14092 maybe_warn_variadic_templates ();
14094 /* Build a pack expansion type */
14096 declarator->parameter_pack_p = true;
14098 decl_specifiers.type = make_pack_expansion (type);
14102 /* The restriction on defining new types applies only to the type
14103 of the parameter, not to the default argument. */
14104 parser->type_definition_forbidden_message = saved_message;
14106 /* If the next token is `=', then process a default argument. */
14107 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
14109 /* Consume the `='. */
14110 cp_lexer_consume_token (parser->lexer);
14112 /* If we are defining a class, then the tokens that make up the
14113 default argument must be saved and processed later. */
14114 if (!template_parm_p && at_class_scope_p ()
14115 && TYPE_BEING_DEFINED (current_class_type))
14117 unsigned depth = 0;
14118 int maybe_template_id = 0;
14119 cp_token *first_token;
14122 /* Add tokens until we have processed the entire default
14123 argument. We add the range [first_token, token). */
14124 first_token = cp_lexer_peek_token (parser->lexer);
14129 /* Peek at the next token. */
14130 token = cp_lexer_peek_token (parser->lexer);
14131 /* What we do depends on what token we have. */
14132 switch (token->type)
14134 /* In valid code, a default argument must be
14135 immediately followed by a `,' `)', or `...'. */
14137 if (depth == 0 && maybe_template_id)
14139 /* If we've seen a '<', we might be in a
14140 template-argument-list. Until Core issue 325 is
14141 resolved, we don't know how this situation ought
14142 to be handled, so try to DTRT. We check whether
14143 what comes after the comma is a valid parameter
14144 declaration list. If it is, then the comma ends
14145 the default argument; otherwise the default
14146 argument continues. */
14147 bool error = false;
14149 /* Set ITALP so cp_parser_parameter_declaration_list
14150 doesn't decide to commit to this parse. */
14151 bool saved_italp = parser->in_template_argument_list_p;
14152 parser->in_template_argument_list_p = true;
14154 cp_parser_parse_tentatively (parser);
14155 cp_lexer_consume_token (parser->lexer);
14156 cp_parser_parameter_declaration_list (parser, &error);
14157 if (!cp_parser_error_occurred (parser) && !error)
14159 cp_parser_abort_tentative_parse (parser);
14161 parser->in_template_argument_list_p = saved_italp;
14164 case CPP_CLOSE_PAREN:
14166 /* If we run into a non-nested `;', `}', or `]',
14167 then the code is invalid -- but the default
14168 argument is certainly over. */
14169 case CPP_SEMICOLON:
14170 case CPP_CLOSE_BRACE:
14171 case CPP_CLOSE_SQUARE:
14174 /* Update DEPTH, if necessary. */
14175 else if (token->type == CPP_CLOSE_PAREN
14176 || token->type == CPP_CLOSE_BRACE
14177 || token->type == CPP_CLOSE_SQUARE)
14181 case CPP_OPEN_PAREN:
14182 case CPP_OPEN_SQUARE:
14183 case CPP_OPEN_BRACE:
14189 /* This might be the comparison operator, or it might
14190 start a template argument list. */
14191 ++maybe_template_id;
14195 if (cxx_dialect == cxx98)
14197 /* Fall through for C++0x, which treats the `>>'
14198 operator like two `>' tokens in certain
14204 /* This might be an operator, or it might close a
14205 template argument list. But if a previous '<'
14206 started a template argument list, this will have
14207 closed it, so we can't be in one anymore. */
14208 maybe_template_id -= 1 + (token->type == CPP_RSHIFT);
14209 if (maybe_template_id < 0)
14210 maybe_template_id = 0;
14214 /* If we run out of tokens, issue an error message. */
14216 case CPP_PRAGMA_EOL:
14217 error ("%Hfile ends in default argument", &token->location);
14223 /* In these cases, we should look for template-ids.
14224 For example, if the default argument is
14225 `X<int, double>()', we need to do name lookup to
14226 figure out whether or not `X' is a template; if
14227 so, the `,' does not end the default argument.
14229 That is not yet done. */
14236 /* If we've reached the end, stop. */
14240 /* Add the token to the token block. */
14241 token = cp_lexer_consume_token (parser->lexer);
14244 /* Create a DEFAULT_ARG to represent the unparsed default
14246 default_argument = make_node (DEFAULT_ARG);
14247 DEFARG_TOKENS (default_argument)
14248 = cp_token_cache_new (first_token, token);
14249 DEFARG_INSTANTIATIONS (default_argument) = NULL;
14251 /* Outside of a class definition, we can just parse the
14252 assignment-expression. */
14255 token = cp_lexer_peek_token (parser->lexer);
14257 = cp_parser_default_argument (parser, template_parm_p);
14260 if (!parser->default_arg_ok_p)
14262 if (flag_permissive)
14263 warning (0, "deprecated use of default argument for parameter of non-function");
14266 error ("%Hdefault arguments are only "
14267 "permitted for function parameters",
14269 default_argument = NULL_TREE;
14272 else if ((declarator && declarator->parameter_pack_p)
14273 || (decl_specifiers.type
14274 && PACK_EXPANSION_P (decl_specifiers.type)))
14276 const char* kind = template_parm_p? "template " : "";
14278 /* Find the name of the parameter pack. */
14279 cp_declarator *id_declarator = declarator;
14280 while (id_declarator && id_declarator->kind != cdk_id)
14281 id_declarator = id_declarator->declarator;
14283 if (id_declarator && id_declarator->kind == cdk_id)
14284 error ("%H%sparameter pack %qD cannot have a default argument",
14285 &declarator_token_start->location,
14286 kind, id_declarator->u.id.unqualified_name);
14288 error ("%H%sparameter pack cannot have a default argument",
14289 &declarator_token_start->location, kind);
14291 default_argument = NULL_TREE;
14295 default_argument = NULL_TREE;
14297 return make_parameter_declarator (&decl_specifiers,
14302 /* Parse a default argument and return it.
14304 TEMPLATE_PARM_P is true if this is a default argument for a
14305 non-type template parameter. */
14307 cp_parser_default_argument (cp_parser *parser, bool template_parm_p)
14309 tree default_argument = NULL_TREE;
14310 bool saved_greater_than_is_operator_p;
14311 bool saved_local_variables_forbidden_p;
14313 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
14315 saved_greater_than_is_operator_p = parser->greater_than_is_operator_p;
14316 parser->greater_than_is_operator_p = !template_parm_p;
14317 /* Local variable names (and the `this' keyword) may not
14318 appear in a default argument. */
14319 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
14320 parser->local_variables_forbidden_p = true;
14321 /* The default argument expression may cause implicitly
14322 defined member functions to be synthesized, which will
14323 result in garbage collection. We must treat this
14324 situation as if we were within the body of function so as
14325 to avoid collecting live data on the stack. */
14327 /* Parse the assignment-expression. */
14328 if (template_parm_p)
14329 push_deferring_access_checks (dk_no_deferred);
14331 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
14332 if (template_parm_p)
14333 pop_deferring_access_checks ();
14334 /* Restore saved state. */
14336 parser->greater_than_is_operator_p = saved_greater_than_is_operator_p;
14337 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
14339 return default_argument;
14342 /* Parse a function-body.
14345 compound_statement */
14348 cp_parser_function_body (cp_parser *parser)
14350 cp_parser_compound_statement (parser, NULL, false);
14353 /* Parse a ctor-initializer-opt followed by a function-body. Return
14354 true if a ctor-initializer was present. */
14357 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
14360 bool ctor_initializer_p;
14362 /* Begin the function body. */
14363 body = begin_function_body ();
14364 /* Parse the optional ctor-initializer. */
14365 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
14366 /* Parse the function-body. */
14367 cp_parser_function_body (parser);
14368 /* Finish the function body. */
14369 finish_function_body (body);
14371 return ctor_initializer_p;
14374 /* Parse an initializer.
14377 = initializer-clause
14378 ( expression-list )
14380 Returns an expression representing the initializer. If no
14381 initializer is present, NULL_TREE is returned.
14383 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
14384 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
14385 set to TRUE if there is no initializer present. If there is an
14386 initializer, and it is not a constant-expression, *NON_CONSTANT_P
14387 is set to true; otherwise it is set to false. */
14390 cp_parser_initializer (cp_parser* parser, bool* is_direct_init,
14391 bool* non_constant_p)
14396 /* Peek at the next token. */
14397 token = cp_lexer_peek_token (parser->lexer);
14399 /* Let our caller know whether or not this initializer was
14401 *is_direct_init = (token->type != CPP_EQ);
14402 /* Assume that the initializer is constant. */
14403 *non_constant_p = false;
14405 if (token->type == CPP_EQ)
14407 /* Consume the `='. */
14408 cp_lexer_consume_token (parser->lexer);
14409 /* Parse the initializer-clause. */
14410 init = cp_parser_initializer_clause (parser, non_constant_p);
14412 else if (token->type == CPP_OPEN_PAREN)
14413 init = cp_parser_parenthesized_expression_list (parser, false,
14415 /*allow_expansion_p=*/true,
14417 else if (token->type == CPP_OPEN_BRACE)
14419 maybe_warn_cpp0x ("extended initializer lists");
14420 init = cp_parser_braced_list (parser, non_constant_p);
14421 CONSTRUCTOR_IS_DIRECT_INIT (init) = 1;
14425 /* Anything else is an error. */
14426 cp_parser_error (parser, "expected initializer");
14427 init = error_mark_node;
14433 /* Parse an initializer-clause.
14435 initializer-clause:
14436 assignment-expression
14439 Returns an expression representing the initializer.
14441 If the `assignment-expression' production is used the value
14442 returned is simply a representation for the expression.
14444 Otherwise, calls cp_parser_braced_list. */
14447 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
14451 /* Assume the expression is constant. */
14452 *non_constant_p = false;
14454 /* If it is not a `{', then we are looking at an
14455 assignment-expression. */
14456 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
14459 = cp_parser_constant_expression (parser,
14460 /*allow_non_constant_p=*/true,
14462 if (!*non_constant_p)
14463 initializer = fold_non_dependent_expr (initializer);
14466 initializer = cp_parser_braced_list (parser, non_constant_p);
14468 return initializer;
14471 /* Parse a brace-enclosed initializer list.
14474 { initializer-list , [opt] }
14477 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
14478 the elements of the initializer-list (or NULL, if the last
14479 production is used). The TREE_TYPE for the CONSTRUCTOR will be
14480 NULL_TREE. There is no way to detect whether or not the optional
14481 trailing `,' was provided. NON_CONSTANT_P is as for
14482 cp_parser_initializer. */
14485 cp_parser_braced_list (cp_parser* parser, bool* non_constant_p)
14489 /* Consume the `{' token. */
14490 cp_lexer_consume_token (parser->lexer);
14491 /* Create a CONSTRUCTOR to represent the braced-initializer. */
14492 initializer = make_node (CONSTRUCTOR);
14493 /* If it's not a `}', then there is a non-trivial initializer. */
14494 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
14496 /* Parse the initializer list. */
14497 CONSTRUCTOR_ELTS (initializer)
14498 = cp_parser_initializer_list (parser, non_constant_p);
14499 /* A trailing `,' token is allowed. */
14500 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
14501 cp_lexer_consume_token (parser->lexer);
14503 /* Now, there should be a trailing `}'. */
14504 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
14505 TREE_TYPE (initializer) = init_list_type_node;
14506 return initializer;
14509 /* Parse an initializer-list.
14512 initializer-clause ... [opt]
14513 initializer-list , initializer-clause ... [opt]
14518 identifier : initializer-clause
14519 initializer-list, identifier : initializer-clause
14521 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
14522 for the initializer. If the INDEX of the elt is non-NULL, it is the
14523 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
14524 as for cp_parser_initializer. */
14526 static VEC(constructor_elt,gc) *
14527 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
14529 VEC(constructor_elt,gc) *v = NULL;
14531 /* Assume all of the expressions are constant. */
14532 *non_constant_p = false;
14534 /* Parse the rest of the list. */
14540 bool clause_non_constant_p;
14542 /* If the next token is an identifier and the following one is a
14543 colon, we are looking at the GNU designated-initializer
14545 if (cp_parser_allow_gnu_extensions_p (parser)
14546 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
14547 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
14549 /* Warn the user that they are using an extension. */
14550 pedwarn (input_location, OPT_pedantic,
14551 "ISO C++ does not allow designated initializers");
14552 /* Consume the identifier. */
14553 identifier = cp_lexer_consume_token (parser->lexer)->u.value;
14554 /* Consume the `:'. */
14555 cp_lexer_consume_token (parser->lexer);
14558 identifier = NULL_TREE;
14560 /* Parse the initializer. */
14561 initializer = cp_parser_initializer_clause (parser,
14562 &clause_non_constant_p);
14563 /* If any clause is non-constant, so is the entire initializer. */
14564 if (clause_non_constant_p)
14565 *non_constant_p = true;
14567 /* If we have an ellipsis, this is an initializer pack
14569 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14571 /* Consume the `...'. */
14572 cp_lexer_consume_token (parser->lexer);
14574 /* Turn the initializer into an initializer expansion. */
14575 initializer = make_pack_expansion (initializer);
14578 /* Add it to the vector. */
14579 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
14581 /* If the next token is not a comma, we have reached the end of
14583 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14586 /* Peek at the next token. */
14587 token = cp_lexer_peek_nth_token (parser->lexer, 2);
14588 /* If the next token is a `}', then we're still done. An
14589 initializer-clause can have a trailing `,' after the
14590 initializer-list and before the closing `}'. */
14591 if (token->type == CPP_CLOSE_BRACE)
14594 /* Consume the `,' token. */
14595 cp_lexer_consume_token (parser->lexer);
14601 /* Classes [gram.class] */
14603 /* Parse a class-name.
14609 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
14610 to indicate that names looked up in dependent types should be
14611 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
14612 keyword has been used to indicate that the name that appears next
14613 is a template. TAG_TYPE indicates the explicit tag given before
14614 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
14615 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
14616 is the class being defined in a class-head.
14618 Returns the TYPE_DECL representing the class. */
14621 cp_parser_class_name (cp_parser *parser,
14622 bool typename_keyword_p,
14623 bool template_keyword_p,
14624 enum tag_types tag_type,
14625 bool check_dependency_p,
14627 bool is_declaration)
14634 /* All class-names start with an identifier. */
14635 token = cp_lexer_peek_token (parser->lexer);
14636 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
14638 cp_parser_error (parser, "expected class-name");
14639 return error_mark_node;
14642 /* PARSER->SCOPE can be cleared when parsing the template-arguments
14643 to a template-id, so we save it here. */
14644 scope = parser->scope;
14645 if (scope == error_mark_node)
14646 return error_mark_node;
14648 /* Any name names a type if we're following the `typename' keyword
14649 in a qualified name where the enclosing scope is type-dependent. */
14650 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
14651 && dependent_type_p (scope));
14652 /* Handle the common case (an identifier, but not a template-id)
14654 if (token->type == CPP_NAME
14655 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
14657 cp_token *identifier_token;
14661 /* Look for the identifier. */
14662 identifier_token = cp_lexer_peek_token (parser->lexer);
14663 ambiguous_p = identifier_token->ambiguous_p;
14664 identifier = cp_parser_identifier (parser);
14665 /* If the next token isn't an identifier, we are certainly not
14666 looking at a class-name. */
14667 if (identifier == error_mark_node)
14668 decl = error_mark_node;
14669 /* If we know this is a type-name, there's no need to look it
14671 else if (typename_p)
14675 tree ambiguous_decls;
14676 /* If we already know that this lookup is ambiguous, then
14677 we've already issued an error message; there's no reason
14681 cp_parser_simulate_error (parser);
14682 return error_mark_node;
14684 /* If the next token is a `::', then the name must be a type
14687 [basic.lookup.qual]
14689 During the lookup for a name preceding the :: scope
14690 resolution operator, object, function, and enumerator
14691 names are ignored. */
14692 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14693 tag_type = typename_type;
14694 /* Look up the name. */
14695 decl = cp_parser_lookup_name (parser, identifier,
14697 /*is_template=*/false,
14698 /*is_namespace=*/false,
14699 check_dependency_p,
14701 identifier_token->location);
14702 if (ambiguous_decls)
14704 error ("%Hreference to %qD is ambiguous",
14705 &identifier_token->location, identifier);
14706 print_candidates (ambiguous_decls);
14707 if (cp_parser_parsing_tentatively (parser))
14709 identifier_token->ambiguous_p = true;
14710 cp_parser_simulate_error (parser);
14712 return error_mark_node;
14718 /* Try a template-id. */
14719 decl = cp_parser_template_id (parser, template_keyword_p,
14720 check_dependency_p,
14722 if (decl == error_mark_node)
14723 return error_mark_node;
14726 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
14728 /* If this is a typename, create a TYPENAME_TYPE. */
14729 if (typename_p && decl != error_mark_node)
14731 decl = make_typename_type (scope, decl, typename_type,
14732 /*complain=*/tf_error);
14733 if (decl != error_mark_node)
14734 decl = TYPE_NAME (decl);
14737 /* Check to see that it is really the name of a class. */
14738 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
14739 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
14740 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14741 /* Situations like this:
14743 template <typename T> struct A {
14744 typename T::template X<int>::I i;
14747 are problematic. Is `T::template X<int>' a class-name? The
14748 standard does not seem to be definitive, but there is no other
14749 valid interpretation of the following `::'. Therefore, those
14750 names are considered class-names. */
14752 decl = make_typename_type (scope, decl, tag_type, tf_error);
14753 if (decl != error_mark_node)
14754 decl = TYPE_NAME (decl);
14756 else if (TREE_CODE (decl) != TYPE_DECL
14757 || TREE_TYPE (decl) == error_mark_node
14758 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl)))
14759 decl = error_mark_node;
14761 if (decl == error_mark_node)
14762 cp_parser_error (parser, "expected class-name");
14767 /* Parse a class-specifier.
14770 class-head { member-specification [opt] }
14772 Returns the TREE_TYPE representing the class. */
14775 cp_parser_class_specifier (cp_parser* parser)
14779 tree attributes = NULL_TREE;
14780 int has_trailing_semicolon;
14781 bool nested_name_specifier_p;
14782 unsigned saved_num_template_parameter_lists;
14783 bool saved_in_function_body;
14784 tree old_scope = NULL_TREE;
14785 tree scope = NULL_TREE;
14788 push_deferring_access_checks (dk_no_deferred);
14790 /* Parse the class-head. */
14791 type = cp_parser_class_head (parser,
14792 &nested_name_specifier_p,
14795 /* If the class-head was a semantic disaster, skip the entire body
14799 cp_parser_skip_to_end_of_block_or_statement (parser);
14800 pop_deferring_access_checks ();
14801 return error_mark_node;
14804 /* Look for the `{'. */
14805 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>"))
14807 pop_deferring_access_checks ();
14808 return error_mark_node;
14811 /* Process the base classes. If they're invalid, skip the
14812 entire class body. */
14813 if (!xref_basetypes (type, bases))
14815 /* Consuming the closing brace yields better error messages
14817 if (cp_parser_skip_to_closing_brace (parser))
14818 cp_lexer_consume_token (parser->lexer);
14819 pop_deferring_access_checks ();
14820 return error_mark_node;
14823 /* Issue an error message if type-definitions are forbidden here. */
14824 cp_parser_check_type_definition (parser);
14825 /* Remember that we are defining one more class. */
14826 ++parser->num_classes_being_defined;
14827 /* Inside the class, surrounding template-parameter-lists do not
14829 saved_num_template_parameter_lists
14830 = parser->num_template_parameter_lists;
14831 parser->num_template_parameter_lists = 0;
14832 /* We are not in a function body. */
14833 saved_in_function_body = parser->in_function_body;
14834 parser->in_function_body = false;
14836 /* Start the class. */
14837 if (nested_name_specifier_p)
14839 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
14840 old_scope = push_inner_scope (scope);
14842 type = begin_class_definition (type, attributes);
14844 if (type == error_mark_node)
14845 /* If the type is erroneous, skip the entire body of the class. */
14846 cp_parser_skip_to_closing_brace (parser);
14848 /* Parse the member-specification. */
14849 cp_parser_member_specification_opt (parser);
14851 /* Look for the trailing `}'. */
14852 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
14853 /* We get better error messages by noticing a common problem: a
14854 missing trailing `;'. */
14855 token = cp_lexer_peek_token (parser->lexer);
14856 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
14857 /* Look for trailing attributes to apply to this class. */
14858 if (cp_parser_allow_gnu_extensions_p (parser))
14859 attributes = cp_parser_attributes_opt (parser);
14860 if (type != error_mark_node)
14861 type = finish_struct (type, attributes);
14862 if (nested_name_specifier_p)
14863 pop_inner_scope (old_scope, scope);
14864 /* If this class is not itself within the scope of another class,
14865 then we need to parse the bodies of all of the queued function
14866 definitions. Note that the queued functions defined in a class
14867 are not always processed immediately following the
14868 class-specifier for that class. Consider:
14871 struct B { void f() { sizeof (A); } };
14874 If `f' were processed before the processing of `A' were
14875 completed, there would be no way to compute the size of `A'.
14876 Note that the nesting we are interested in here is lexical --
14877 not the semantic nesting given by TYPE_CONTEXT. In particular,
14880 struct A { struct B; };
14881 struct A::B { void f() { } };
14883 there is no need to delay the parsing of `A::B::f'. */
14884 if (--parser->num_classes_being_defined == 0)
14888 tree class_type = NULL_TREE;
14889 tree pushed_scope = NULL_TREE;
14891 /* In a first pass, parse default arguments to the functions.
14892 Then, in a second pass, parse the bodies of the functions.
14893 This two-phased approach handles cases like:
14901 for (TREE_PURPOSE (parser->unparsed_functions_queues)
14902 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
14903 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
14904 TREE_PURPOSE (parser->unparsed_functions_queues)
14905 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
14907 fn = TREE_VALUE (queue_entry);
14908 /* If there are default arguments that have not yet been processed,
14909 take care of them now. */
14910 if (class_type != TREE_PURPOSE (queue_entry))
14913 pop_scope (pushed_scope);
14914 class_type = TREE_PURPOSE (queue_entry);
14915 pushed_scope = push_scope (class_type);
14917 /* Make sure that any template parameters are in scope. */
14918 maybe_begin_member_template_processing (fn);
14919 /* Parse the default argument expressions. */
14920 cp_parser_late_parsing_default_args (parser, fn);
14921 /* Remove any template parameters from the symbol table. */
14922 maybe_end_member_template_processing ();
14925 pop_scope (pushed_scope);
14926 /* Now parse the body of the functions. */
14927 for (TREE_VALUE (parser->unparsed_functions_queues)
14928 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
14929 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
14930 TREE_VALUE (parser->unparsed_functions_queues)
14931 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
14933 /* Figure out which function we need to process. */
14934 fn = TREE_VALUE (queue_entry);
14935 /* Parse the function. */
14936 cp_parser_late_parsing_for_member (parser, fn);
14940 /* Put back any saved access checks. */
14941 pop_deferring_access_checks ();
14943 /* Restore saved state. */
14944 parser->in_function_body = saved_in_function_body;
14945 parser->num_template_parameter_lists
14946 = saved_num_template_parameter_lists;
14951 /* Parse a class-head.
14954 class-key identifier [opt] base-clause [opt]
14955 class-key nested-name-specifier identifier base-clause [opt]
14956 class-key nested-name-specifier [opt] template-id
14960 class-key attributes identifier [opt] base-clause [opt]
14961 class-key attributes nested-name-specifier identifier base-clause [opt]
14962 class-key attributes nested-name-specifier [opt] template-id
14965 Upon return BASES is initialized to the list of base classes (or
14966 NULL, if there are none) in the same form returned by
14967 cp_parser_base_clause.
14969 Returns the TYPE of the indicated class. Sets
14970 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
14971 involving a nested-name-specifier was used, and FALSE otherwise.
14973 Returns error_mark_node if this is not a class-head.
14975 Returns NULL_TREE if the class-head is syntactically valid, but
14976 semantically invalid in a way that means we should skip the entire
14977 body of the class. */
14980 cp_parser_class_head (cp_parser* parser,
14981 bool* nested_name_specifier_p,
14982 tree *attributes_p,
14985 tree nested_name_specifier;
14986 enum tag_types class_key;
14987 tree id = NULL_TREE;
14988 tree type = NULL_TREE;
14990 bool template_id_p = false;
14991 bool qualified_p = false;
14992 bool invalid_nested_name_p = false;
14993 bool invalid_explicit_specialization_p = false;
14994 tree pushed_scope = NULL_TREE;
14995 unsigned num_templates;
14996 cp_token *type_start_token = NULL, *nested_name_specifier_token_start = NULL;
14997 /* Assume no nested-name-specifier will be present. */
14998 *nested_name_specifier_p = false;
14999 /* Assume no template parameter lists will be used in defining the
15003 *bases = NULL_TREE;
15005 /* Look for the class-key. */
15006 class_key = cp_parser_class_key (parser);
15007 if (class_key == none_type)
15008 return error_mark_node;
15010 /* Parse the attributes. */
15011 attributes = cp_parser_attributes_opt (parser);
15013 /* If the next token is `::', that is invalid -- but sometimes
15014 people do try to write:
15018 Handle this gracefully by accepting the extra qualifier, and then
15019 issuing an error about it later if this really is a
15020 class-head. If it turns out just to be an elaborated type
15021 specifier, remain silent. */
15022 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
15023 qualified_p = true;
15025 push_deferring_access_checks (dk_no_check);
15027 /* Determine the name of the class. Begin by looking for an
15028 optional nested-name-specifier. */
15029 nested_name_specifier_token_start = cp_lexer_peek_token (parser->lexer);
15030 nested_name_specifier
15031 = cp_parser_nested_name_specifier_opt (parser,
15032 /*typename_keyword_p=*/false,
15033 /*check_dependency_p=*/false,
15035 /*is_declaration=*/false);
15036 /* If there was a nested-name-specifier, then there *must* be an
15038 if (nested_name_specifier)
15040 type_start_token = cp_lexer_peek_token (parser->lexer);
15041 /* Although the grammar says `identifier', it really means
15042 `class-name' or `template-name'. You are only allowed to
15043 define a class that has already been declared with this
15046 The proposed resolution for Core Issue 180 says that wherever
15047 you see `class T::X' you should treat `X' as a type-name.
15049 It is OK to define an inaccessible class; for example:
15051 class A { class B; };
15054 We do not know if we will see a class-name, or a
15055 template-name. We look for a class-name first, in case the
15056 class-name is a template-id; if we looked for the
15057 template-name first we would stop after the template-name. */
15058 cp_parser_parse_tentatively (parser);
15059 type = cp_parser_class_name (parser,
15060 /*typename_keyword_p=*/false,
15061 /*template_keyword_p=*/false,
15063 /*check_dependency_p=*/false,
15064 /*class_head_p=*/true,
15065 /*is_declaration=*/false);
15066 /* If that didn't work, ignore the nested-name-specifier. */
15067 if (!cp_parser_parse_definitely (parser))
15069 invalid_nested_name_p = true;
15070 type_start_token = cp_lexer_peek_token (parser->lexer);
15071 id = cp_parser_identifier (parser);
15072 if (id == error_mark_node)
15075 /* If we could not find a corresponding TYPE, treat this
15076 declaration like an unqualified declaration. */
15077 if (type == error_mark_node)
15078 nested_name_specifier = NULL_TREE;
15079 /* Otherwise, count the number of templates used in TYPE and its
15080 containing scopes. */
15085 for (scope = TREE_TYPE (type);
15086 scope && TREE_CODE (scope) != NAMESPACE_DECL;
15087 scope = (TYPE_P (scope)
15088 ? TYPE_CONTEXT (scope)
15089 : DECL_CONTEXT (scope)))
15091 && CLASS_TYPE_P (scope)
15092 && CLASSTYPE_TEMPLATE_INFO (scope)
15093 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
15094 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
15098 /* Otherwise, the identifier is optional. */
15101 /* We don't know whether what comes next is a template-id,
15102 an identifier, or nothing at all. */
15103 cp_parser_parse_tentatively (parser);
15104 /* Check for a template-id. */
15105 type_start_token = cp_lexer_peek_token (parser->lexer);
15106 id = cp_parser_template_id (parser,
15107 /*template_keyword_p=*/false,
15108 /*check_dependency_p=*/true,
15109 /*is_declaration=*/true);
15110 /* If that didn't work, it could still be an identifier. */
15111 if (!cp_parser_parse_definitely (parser))
15113 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
15115 type_start_token = cp_lexer_peek_token (parser->lexer);
15116 id = cp_parser_identifier (parser);
15123 template_id_p = true;
15128 pop_deferring_access_checks ();
15131 cp_parser_check_for_invalid_template_id (parser, id,
15132 type_start_token->location);
15134 /* If it's not a `:' or a `{' then we can't really be looking at a
15135 class-head, since a class-head only appears as part of a
15136 class-specifier. We have to detect this situation before calling
15137 xref_tag, since that has irreversible side-effects. */
15138 if (!cp_parser_next_token_starts_class_definition_p (parser))
15140 cp_parser_error (parser, "expected %<{%> or %<:%>");
15141 return error_mark_node;
15144 /* At this point, we're going ahead with the class-specifier, even
15145 if some other problem occurs. */
15146 cp_parser_commit_to_tentative_parse (parser);
15147 /* Issue the error about the overly-qualified name now. */
15150 cp_parser_error (parser,
15151 "global qualification of class name is invalid");
15152 return error_mark_node;
15154 else if (invalid_nested_name_p)
15156 cp_parser_error (parser,
15157 "qualified name does not name a class");
15158 return error_mark_node;
15160 else if (nested_name_specifier)
15164 /* Reject typedef-names in class heads. */
15165 if (!DECL_IMPLICIT_TYPEDEF_P (type))
15167 error ("%Hinvalid class name in declaration of %qD",
15168 &type_start_token->location, type);
15173 /* Figure out in what scope the declaration is being placed. */
15174 scope = current_scope ();
15175 /* If that scope does not contain the scope in which the
15176 class was originally declared, the program is invalid. */
15177 if (scope && !is_ancestor (scope, nested_name_specifier))
15179 if (at_namespace_scope_p ())
15180 error ("%Hdeclaration of %qD in namespace %qD which does not "
15182 &type_start_token->location,
15183 type, scope, nested_name_specifier);
15185 error ("%Hdeclaration of %qD in %qD which does not enclose %qD",
15186 &type_start_token->location,
15187 type, scope, nested_name_specifier);
15193 A declarator-id shall not be qualified except for the
15194 definition of a ... nested class outside of its class
15195 ... [or] the definition or explicit instantiation of a
15196 class member of a namespace outside of its namespace. */
15197 if (scope == nested_name_specifier)
15199 permerror (input_location, "%Hextra qualification not allowed",
15200 &nested_name_specifier_token_start->location);
15201 nested_name_specifier = NULL_TREE;
15205 /* An explicit-specialization must be preceded by "template <>". If
15206 it is not, try to recover gracefully. */
15207 if (at_namespace_scope_p ()
15208 && parser->num_template_parameter_lists == 0
15211 error ("%Han explicit specialization must be preceded by %<template <>%>",
15212 &type_start_token->location);
15213 invalid_explicit_specialization_p = true;
15214 /* Take the same action that would have been taken by
15215 cp_parser_explicit_specialization. */
15216 ++parser->num_template_parameter_lists;
15217 begin_specialization ();
15219 /* There must be no "return" statements between this point and the
15220 end of this function; set "type "to the correct return value and
15221 use "goto done;" to return. */
15222 /* Make sure that the right number of template parameters were
15224 if (!cp_parser_check_template_parameters (parser, num_templates,
15225 type_start_token->location))
15227 /* If something went wrong, there is no point in even trying to
15228 process the class-definition. */
15233 /* Look up the type. */
15236 if (TREE_CODE (id) == TEMPLATE_ID_EXPR
15237 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id, 0))
15238 || TREE_CODE (TREE_OPERAND (id, 0)) == OVERLOAD))
15240 error ("%Hfunction template %qD redeclared as a class template",
15241 &type_start_token->location, id);
15242 type = error_mark_node;
15246 type = TREE_TYPE (id);
15247 type = maybe_process_partial_specialization (type);
15249 if (nested_name_specifier)
15250 pushed_scope = push_scope (nested_name_specifier);
15252 else if (nested_name_specifier)
15258 template <typename T> struct S { struct T };
15259 template <typename T> struct S<T>::T { };
15261 we will get a TYPENAME_TYPE when processing the definition of
15262 `S::T'. We need to resolve it to the actual type before we
15263 try to define it. */
15264 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
15266 class_type = resolve_typename_type (TREE_TYPE (type),
15267 /*only_current_p=*/false);
15268 if (TREE_CODE (class_type) != TYPENAME_TYPE)
15269 type = TYPE_NAME (class_type);
15272 cp_parser_error (parser, "could not resolve typename type");
15273 type = error_mark_node;
15277 if (maybe_process_partial_specialization (TREE_TYPE (type))
15278 == error_mark_node)
15284 class_type = current_class_type;
15285 /* Enter the scope indicated by the nested-name-specifier. */
15286 pushed_scope = push_scope (nested_name_specifier);
15287 /* Get the canonical version of this type. */
15288 type = TYPE_MAIN_DECL (TREE_TYPE (type));
15289 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
15290 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
15292 type = push_template_decl (type);
15293 if (type == error_mark_node)
15300 type = TREE_TYPE (type);
15301 *nested_name_specifier_p = true;
15303 else /* The name is not a nested name. */
15305 /* If the class was unnamed, create a dummy name. */
15307 id = make_anon_name ();
15308 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
15309 parser->num_template_parameter_lists);
15312 /* Indicate whether this class was declared as a `class' or as a
15314 if (TREE_CODE (type) == RECORD_TYPE)
15315 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
15316 cp_parser_check_class_key (class_key, type);
15318 /* If this type was already complete, and we see another definition,
15319 that's an error. */
15320 if (type != error_mark_node && COMPLETE_TYPE_P (type))
15322 error ("%Hredefinition of %q#T",
15323 &type_start_token->location, type);
15324 error ("%Hprevious definition of %q+#T",
15325 &type_start_token->location, type);
15329 else if (type == error_mark_node)
15332 /* We will have entered the scope containing the class; the names of
15333 base classes should be looked up in that context. For example:
15335 struct A { struct B {}; struct C; };
15336 struct A::C : B {};
15340 /* Get the list of base-classes, if there is one. */
15341 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15342 *bases = cp_parser_base_clause (parser);
15345 /* Leave the scope given by the nested-name-specifier. We will
15346 enter the class scope itself while processing the members. */
15348 pop_scope (pushed_scope);
15350 if (invalid_explicit_specialization_p)
15352 end_specialization ();
15353 --parser->num_template_parameter_lists;
15355 *attributes_p = attributes;
15359 /* Parse a class-key.
15366 Returns the kind of class-key specified, or none_type to indicate
15369 static enum tag_types
15370 cp_parser_class_key (cp_parser* parser)
15373 enum tag_types tag_type;
15375 /* Look for the class-key. */
15376 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
15380 /* Check to see if the TOKEN is a class-key. */
15381 tag_type = cp_parser_token_is_class_key (token);
15383 cp_parser_error (parser, "expected class-key");
15387 /* Parse an (optional) member-specification.
15389 member-specification:
15390 member-declaration member-specification [opt]
15391 access-specifier : member-specification [opt] */
15394 cp_parser_member_specification_opt (cp_parser* parser)
15401 /* Peek at the next token. */
15402 token = cp_lexer_peek_token (parser->lexer);
15403 /* If it's a `}', or EOF then we've seen all the members. */
15404 if (token->type == CPP_CLOSE_BRACE
15405 || token->type == CPP_EOF
15406 || token->type == CPP_PRAGMA_EOL)
15409 /* See if this token is a keyword. */
15410 keyword = token->keyword;
15414 case RID_PROTECTED:
15416 /* Consume the access-specifier. */
15417 cp_lexer_consume_token (parser->lexer);
15418 /* Remember which access-specifier is active. */
15419 current_access_specifier = token->u.value;
15420 /* Look for the `:'. */
15421 cp_parser_require (parser, CPP_COLON, "%<:%>");
15425 /* Accept #pragmas at class scope. */
15426 if (token->type == CPP_PRAGMA)
15428 cp_parser_pragma (parser, pragma_external);
15432 /* Otherwise, the next construction must be a
15433 member-declaration. */
15434 cp_parser_member_declaration (parser);
15439 /* Parse a member-declaration.
15441 member-declaration:
15442 decl-specifier-seq [opt] member-declarator-list [opt] ;
15443 function-definition ; [opt]
15444 :: [opt] nested-name-specifier template [opt] unqualified-id ;
15446 template-declaration
15448 member-declarator-list:
15450 member-declarator-list , member-declarator
15453 declarator pure-specifier [opt]
15454 declarator constant-initializer [opt]
15455 identifier [opt] : constant-expression
15459 member-declaration:
15460 __extension__ member-declaration
15463 declarator attributes [opt] pure-specifier [opt]
15464 declarator attributes [opt] constant-initializer [opt]
15465 identifier [opt] attributes [opt] : constant-expression
15469 member-declaration:
15470 static_assert-declaration */
15473 cp_parser_member_declaration (cp_parser* parser)
15475 cp_decl_specifier_seq decl_specifiers;
15476 tree prefix_attributes;
15478 int declares_class_or_enum;
15480 cp_token *token = NULL;
15481 cp_token *decl_spec_token_start = NULL;
15482 cp_token *initializer_token_start = NULL;
15483 int saved_pedantic;
15485 /* Check for the `__extension__' keyword. */
15486 if (cp_parser_extension_opt (parser, &saved_pedantic))
15489 cp_parser_member_declaration (parser);
15490 /* Restore the old value of the PEDANTIC flag. */
15491 pedantic = saved_pedantic;
15496 /* Check for a template-declaration. */
15497 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
15499 /* An explicit specialization here is an error condition, and we
15500 expect the specialization handler to detect and report this. */
15501 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
15502 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
15503 cp_parser_explicit_specialization (parser);
15505 cp_parser_template_declaration (parser, /*member_p=*/true);
15510 /* Check for a using-declaration. */
15511 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
15513 /* Parse the using-declaration. */
15514 cp_parser_using_declaration (parser,
15515 /*access_declaration_p=*/false);
15519 /* Check for @defs. */
15520 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
15523 tree ivar_chains = cp_parser_objc_defs_expression (parser);
15524 ivar = ivar_chains;
15528 ivar = TREE_CHAIN (member);
15529 TREE_CHAIN (member) = NULL_TREE;
15530 finish_member_declaration (member);
15535 /* If the next token is `static_assert' we have a static assertion. */
15536 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC_ASSERT))
15538 cp_parser_static_assert (parser, /*member_p=*/true);
15542 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
15545 /* Parse the decl-specifier-seq. */
15546 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
15547 cp_parser_decl_specifier_seq (parser,
15548 CP_PARSER_FLAGS_OPTIONAL,
15550 &declares_class_or_enum);
15551 prefix_attributes = decl_specifiers.attributes;
15552 decl_specifiers.attributes = NULL_TREE;
15553 /* Check for an invalid type-name. */
15554 if (!decl_specifiers.type
15555 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
15557 /* If there is no declarator, then the decl-specifier-seq should
15559 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15561 /* If there was no decl-specifier-seq, and the next token is a
15562 `;', then we have something like:
15568 Each member-declaration shall declare at least one member
15569 name of the class. */
15570 if (!decl_specifiers.any_specifiers_p)
15572 cp_token *token = cp_lexer_peek_token (parser->lexer);
15573 if (!in_system_header_at (token->location))
15574 pedwarn (token->location, OPT_pedantic, "extra %<;%>");
15580 /* See if this declaration is a friend. */
15581 friend_p = cp_parser_friend_p (&decl_specifiers);
15582 /* If there were decl-specifiers, check to see if there was
15583 a class-declaration. */
15584 type = check_tag_decl (&decl_specifiers);
15585 /* Nested classes have already been added to the class, but
15586 a `friend' needs to be explicitly registered. */
15589 /* If the `friend' keyword was present, the friend must
15590 be introduced with a class-key. */
15591 if (!declares_class_or_enum)
15592 error ("%Ha class-key must be used when declaring a friend",
15593 &decl_spec_token_start->location);
15596 template <typename T> struct A {
15597 friend struct A<T>::B;
15600 A<T>::B will be represented by a TYPENAME_TYPE, and
15601 therefore not recognized by check_tag_decl. */
15603 && decl_specifiers.type
15604 && TYPE_P (decl_specifiers.type))
15605 type = decl_specifiers.type;
15606 if (!type || !TYPE_P (type))
15607 error ("%Hfriend declaration does not name a class or "
15608 "function", &decl_spec_token_start->location);
15610 make_friend_class (current_class_type, type,
15611 /*complain=*/true);
15613 /* If there is no TYPE, an error message will already have
15615 else if (!type || type == error_mark_node)
15617 /* An anonymous aggregate has to be handled specially; such
15618 a declaration really declares a data member (with a
15619 particular type), as opposed to a nested class. */
15620 else if (ANON_AGGR_TYPE_P (type))
15622 /* Remove constructors and such from TYPE, now that we
15623 know it is an anonymous aggregate. */
15624 fixup_anonymous_aggr (type);
15625 /* And make the corresponding data member. */
15626 decl = build_decl (FIELD_DECL, NULL_TREE, type);
15627 /* Add it to the class. */
15628 finish_member_declaration (decl);
15631 cp_parser_check_access_in_redeclaration
15633 decl_spec_token_start->location);
15638 /* See if these declarations will be friends. */
15639 friend_p = cp_parser_friend_p (&decl_specifiers);
15641 /* Keep going until we hit the `;' at the end of the
15643 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
15645 tree attributes = NULL_TREE;
15646 tree first_attribute;
15648 /* Peek at the next token. */
15649 token = cp_lexer_peek_token (parser->lexer);
15651 /* Check for a bitfield declaration. */
15652 if (token->type == CPP_COLON
15653 || (token->type == CPP_NAME
15654 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
15660 /* Get the name of the bitfield. Note that we cannot just
15661 check TOKEN here because it may have been invalidated by
15662 the call to cp_lexer_peek_nth_token above. */
15663 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
15664 identifier = cp_parser_identifier (parser);
15666 identifier = NULL_TREE;
15668 /* Consume the `:' token. */
15669 cp_lexer_consume_token (parser->lexer);
15670 /* Get the width of the bitfield. */
15672 = cp_parser_constant_expression (parser,
15673 /*allow_non_constant=*/false,
15676 /* Look for attributes that apply to the bitfield. */
15677 attributes = cp_parser_attributes_opt (parser);
15678 /* Remember which attributes are prefix attributes and
15680 first_attribute = attributes;
15681 /* Combine the attributes. */
15682 attributes = chainon (prefix_attributes, attributes);
15684 /* Create the bitfield declaration. */
15685 decl = grokbitfield (identifier
15686 ? make_id_declarator (NULL_TREE,
15696 cp_declarator *declarator;
15698 tree asm_specification;
15699 int ctor_dtor_or_conv_p;
15701 /* Parse the declarator. */
15703 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
15704 &ctor_dtor_or_conv_p,
15705 /*parenthesized_p=*/NULL,
15706 /*member_p=*/true);
15708 /* If something went wrong parsing the declarator, make sure
15709 that we at least consume some tokens. */
15710 if (declarator == cp_error_declarator)
15712 /* Skip to the end of the statement. */
15713 cp_parser_skip_to_end_of_statement (parser);
15714 /* If the next token is not a semicolon, that is
15715 probably because we just skipped over the body of
15716 a function. So, we consume a semicolon if
15717 present, but do not issue an error message if it
15719 if (cp_lexer_next_token_is (parser->lexer,
15721 cp_lexer_consume_token (parser->lexer);
15725 if (declares_class_or_enum & 2)
15726 cp_parser_check_for_definition_in_return_type
15727 (declarator, decl_specifiers.type,
15728 decl_specifiers.type_location);
15730 /* Look for an asm-specification. */
15731 asm_specification = cp_parser_asm_specification_opt (parser);
15732 /* Look for attributes that apply to the declaration. */
15733 attributes = cp_parser_attributes_opt (parser);
15734 /* Remember which attributes are prefix attributes and
15736 first_attribute = attributes;
15737 /* Combine the attributes. */
15738 attributes = chainon (prefix_attributes, attributes);
15740 /* If it's an `=', then we have a constant-initializer or a
15741 pure-specifier. It is not correct to parse the
15742 initializer before registering the member declaration
15743 since the member declaration should be in scope while
15744 its initializer is processed. However, the rest of the
15745 front end does not yet provide an interface that allows
15746 us to handle this correctly. */
15747 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
15751 A pure-specifier shall be used only in the declaration of
15752 a virtual function.
15754 A member-declarator can contain a constant-initializer
15755 only if it declares a static member of integral or
15758 Therefore, if the DECLARATOR is for a function, we look
15759 for a pure-specifier; otherwise, we look for a
15760 constant-initializer. When we call `grokfield', it will
15761 perform more stringent semantics checks. */
15762 initializer_token_start = cp_lexer_peek_token (parser->lexer);
15763 if (function_declarator_p (declarator))
15764 initializer = cp_parser_pure_specifier (parser);
15766 /* Parse the initializer. */
15767 initializer = cp_parser_constant_initializer (parser);
15769 /* Otherwise, there is no initializer. */
15771 initializer = NULL_TREE;
15773 /* See if we are probably looking at a function
15774 definition. We are certainly not looking at a
15775 member-declarator. Calling `grokfield' has
15776 side-effects, so we must not do it unless we are sure
15777 that we are looking at a member-declarator. */
15778 if (cp_parser_token_starts_function_definition_p
15779 (cp_lexer_peek_token (parser->lexer)))
15781 /* The grammar does not allow a pure-specifier to be
15782 used when a member function is defined. (It is
15783 possible that this fact is an oversight in the
15784 standard, since a pure function may be defined
15785 outside of the class-specifier. */
15787 error ("%Hpure-specifier on function-definition",
15788 &initializer_token_start->location);
15789 decl = cp_parser_save_member_function_body (parser,
15793 /* If the member was not a friend, declare it here. */
15795 finish_member_declaration (decl);
15796 /* Peek at the next token. */
15797 token = cp_lexer_peek_token (parser->lexer);
15798 /* If the next token is a semicolon, consume it. */
15799 if (token->type == CPP_SEMICOLON)
15800 cp_lexer_consume_token (parser->lexer);
15804 if (declarator->kind == cdk_function)
15805 declarator->id_loc = token->location;
15806 /* Create the declaration. */
15807 decl = grokfield (declarator, &decl_specifiers,
15808 initializer, /*init_const_expr_p=*/true,
15813 /* Reset PREFIX_ATTRIBUTES. */
15814 while (attributes && TREE_CHAIN (attributes) != first_attribute)
15815 attributes = TREE_CHAIN (attributes);
15817 TREE_CHAIN (attributes) = NULL_TREE;
15819 /* If there is any qualification still in effect, clear it
15820 now; we will be starting fresh with the next declarator. */
15821 parser->scope = NULL_TREE;
15822 parser->qualifying_scope = NULL_TREE;
15823 parser->object_scope = NULL_TREE;
15824 /* If it's a `,', then there are more declarators. */
15825 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
15826 cp_lexer_consume_token (parser->lexer);
15827 /* If the next token isn't a `;', then we have a parse error. */
15828 else if (cp_lexer_next_token_is_not (parser->lexer,
15831 cp_parser_error (parser, "expected %<;%>");
15832 /* Skip tokens until we find a `;'. */
15833 cp_parser_skip_to_end_of_statement (parser);
15840 /* Add DECL to the list of members. */
15842 finish_member_declaration (decl);
15844 if (TREE_CODE (decl) == FUNCTION_DECL)
15845 cp_parser_save_default_args (parser, decl);
15850 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
15853 /* Parse a pure-specifier.
15858 Returns INTEGER_ZERO_NODE if a pure specifier is found.
15859 Otherwise, ERROR_MARK_NODE is returned. */
15862 cp_parser_pure_specifier (cp_parser* parser)
15866 /* Look for the `=' token. */
15867 if (!cp_parser_require (parser, CPP_EQ, "%<=%>"))
15868 return error_mark_node;
15869 /* Look for the `0' token. */
15870 token = cp_lexer_consume_token (parser->lexer);
15872 /* Accept = default or = delete in c++0x mode. */
15873 if (token->keyword == RID_DEFAULT
15874 || token->keyword == RID_DELETE)
15876 maybe_warn_cpp0x ("defaulted and deleted functions");
15877 return token->u.value;
15880 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
15881 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
15883 cp_parser_error (parser,
15884 "invalid pure specifier (only %<= 0%> is allowed)");
15885 cp_parser_skip_to_end_of_statement (parser);
15886 return error_mark_node;
15888 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
15890 error ("%Htemplates may not be %<virtual%>", &token->location);
15891 return error_mark_node;
15894 return integer_zero_node;
15897 /* Parse a constant-initializer.
15899 constant-initializer:
15900 = constant-expression
15902 Returns a representation of the constant-expression. */
15905 cp_parser_constant_initializer (cp_parser* parser)
15907 /* Look for the `=' token. */
15908 if (!cp_parser_require (parser, CPP_EQ, "%<=%>"))
15909 return error_mark_node;
15911 /* It is invalid to write:
15913 struct S { static const int i = { 7 }; };
15916 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
15918 cp_parser_error (parser,
15919 "a brace-enclosed initializer is not allowed here");
15920 /* Consume the opening brace. */
15921 cp_lexer_consume_token (parser->lexer);
15922 /* Skip the initializer. */
15923 cp_parser_skip_to_closing_brace (parser);
15924 /* Look for the trailing `}'. */
15925 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
15927 return error_mark_node;
15930 return cp_parser_constant_expression (parser,
15931 /*allow_non_constant=*/false,
15935 /* Derived classes [gram.class.derived] */
15937 /* Parse a base-clause.
15940 : base-specifier-list
15942 base-specifier-list:
15943 base-specifier ... [opt]
15944 base-specifier-list , base-specifier ... [opt]
15946 Returns a TREE_LIST representing the base-classes, in the order in
15947 which they were declared. The representation of each node is as
15948 described by cp_parser_base_specifier.
15950 In the case that no bases are specified, this function will return
15951 NULL_TREE, not ERROR_MARK_NODE. */
15954 cp_parser_base_clause (cp_parser* parser)
15956 tree bases = NULL_TREE;
15958 /* Look for the `:' that begins the list. */
15959 cp_parser_require (parser, CPP_COLON, "%<:%>");
15961 /* Scan the base-specifier-list. */
15966 bool pack_expansion_p = false;
15968 /* Look for the base-specifier. */
15969 base = cp_parser_base_specifier (parser);
15970 /* Look for the (optional) ellipsis. */
15971 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
15973 /* Consume the `...'. */
15974 cp_lexer_consume_token (parser->lexer);
15976 pack_expansion_p = true;
15979 /* Add BASE to the front of the list. */
15980 if (base != error_mark_node)
15982 if (pack_expansion_p)
15983 /* Make this a pack expansion type. */
15984 TREE_VALUE (base) = make_pack_expansion (TREE_VALUE (base));
15987 if (!check_for_bare_parameter_packs (TREE_VALUE (base)))
15989 TREE_CHAIN (base) = bases;
15993 /* Peek at the next token. */
15994 token = cp_lexer_peek_token (parser->lexer);
15995 /* If it's not a comma, then the list is complete. */
15996 if (token->type != CPP_COMMA)
15998 /* Consume the `,'. */
15999 cp_lexer_consume_token (parser->lexer);
16002 /* PARSER->SCOPE may still be non-NULL at this point, if the last
16003 base class had a qualified name. However, the next name that
16004 appears is certainly not qualified. */
16005 parser->scope = NULL_TREE;
16006 parser->qualifying_scope = NULL_TREE;
16007 parser->object_scope = NULL_TREE;
16009 return nreverse (bases);
16012 /* Parse a base-specifier.
16015 :: [opt] nested-name-specifier [opt] class-name
16016 virtual access-specifier [opt] :: [opt] nested-name-specifier
16018 access-specifier virtual [opt] :: [opt] nested-name-specifier
16021 Returns a TREE_LIST. The TREE_PURPOSE will be one of
16022 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
16023 indicate the specifiers provided. The TREE_VALUE will be a TYPE
16024 (or the ERROR_MARK_NODE) indicating the type that was specified. */
16027 cp_parser_base_specifier (cp_parser* parser)
16031 bool virtual_p = false;
16032 bool duplicate_virtual_error_issued_p = false;
16033 bool duplicate_access_error_issued_p = false;
16034 bool class_scope_p, template_p;
16035 tree access = access_default_node;
16038 /* Process the optional `virtual' and `access-specifier'. */
16041 /* Peek at the next token. */
16042 token = cp_lexer_peek_token (parser->lexer);
16043 /* Process `virtual'. */
16044 switch (token->keyword)
16047 /* If `virtual' appears more than once, issue an error. */
16048 if (virtual_p && !duplicate_virtual_error_issued_p)
16050 cp_parser_error (parser,
16051 "%<virtual%> specified more than once in base-specified");
16052 duplicate_virtual_error_issued_p = true;
16057 /* Consume the `virtual' token. */
16058 cp_lexer_consume_token (parser->lexer);
16063 case RID_PROTECTED:
16065 /* If more than one access specifier appears, issue an
16067 if (access != access_default_node
16068 && !duplicate_access_error_issued_p)
16070 cp_parser_error (parser,
16071 "more than one access specifier in base-specified");
16072 duplicate_access_error_issued_p = true;
16075 access = ridpointers[(int) token->keyword];
16077 /* Consume the access-specifier. */
16078 cp_lexer_consume_token (parser->lexer);
16087 /* It is not uncommon to see programs mechanically, erroneously, use
16088 the 'typename' keyword to denote (dependent) qualified types
16089 as base classes. */
16090 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
16092 token = cp_lexer_peek_token (parser->lexer);
16093 if (!processing_template_decl)
16094 error ("%Hkeyword %<typename%> not allowed outside of templates",
16097 error ("%Hkeyword %<typename%> not allowed in this context "
16098 "(the base class is implicitly a type)",
16100 cp_lexer_consume_token (parser->lexer);
16103 /* Look for the optional `::' operator. */
16104 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
16105 /* Look for the nested-name-specifier. The simplest way to
16110 The keyword `typename' is not permitted in a base-specifier or
16111 mem-initializer; in these contexts a qualified name that
16112 depends on a template-parameter is implicitly assumed to be a
16115 is to pretend that we have seen the `typename' keyword at this
16117 cp_parser_nested_name_specifier_opt (parser,
16118 /*typename_keyword_p=*/true,
16119 /*check_dependency_p=*/true,
16121 /*is_declaration=*/true);
16122 /* If the base class is given by a qualified name, assume that names
16123 we see are type names or templates, as appropriate. */
16124 class_scope_p = (parser->scope && TYPE_P (parser->scope));
16125 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
16127 /* Finally, look for the class-name. */
16128 type = cp_parser_class_name (parser,
16132 /*check_dependency_p=*/true,
16133 /*class_head_p=*/false,
16134 /*is_declaration=*/true);
16136 if (type == error_mark_node)
16137 return error_mark_node;
16139 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
16142 /* Exception handling [gram.exception] */
16144 /* Parse an (optional) exception-specification.
16146 exception-specification:
16147 throw ( type-id-list [opt] )
16149 Returns a TREE_LIST representing the exception-specification. The
16150 TREE_VALUE of each node is a type. */
16153 cp_parser_exception_specification_opt (cp_parser* parser)
16158 /* Peek at the next token. */
16159 token = cp_lexer_peek_token (parser->lexer);
16160 /* If it's not `throw', then there's no exception-specification. */
16161 if (!cp_parser_is_keyword (token, RID_THROW))
16164 /* Consume the `throw'. */
16165 cp_lexer_consume_token (parser->lexer);
16167 /* Look for the `('. */
16168 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16170 /* Peek at the next token. */
16171 token = cp_lexer_peek_token (parser->lexer);
16172 /* If it's not a `)', then there is a type-id-list. */
16173 if (token->type != CPP_CLOSE_PAREN)
16175 const char *saved_message;
16177 /* Types may not be defined in an exception-specification. */
16178 saved_message = parser->type_definition_forbidden_message;
16179 parser->type_definition_forbidden_message
16180 = "types may not be defined in an exception-specification";
16181 /* Parse the type-id-list. */
16182 type_id_list = cp_parser_type_id_list (parser);
16183 /* Restore the saved message. */
16184 parser->type_definition_forbidden_message = saved_message;
16187 type_id_list = empty_except_spec;
16189 /* Look for the `)'. */
16190 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16192 return type_id_list;
16195 /* Parse an (optional) type-id-list.
16199 type-id-list , type-id ... [opt]
16201 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
16202 in the order that the types were presented. */
16205 cp_parser_type_id_list (cp_parser* parser)
16207 tree types = NULL_TREE;
16214 /* Get the next type-id. */
16215 type = cp_parser_type_id (parser);
16216 /* Parse the optional ellipsis. */
16217 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
16219 /* Consume the `...'. */
16220 cp_lexer_consume_token (parser->lexer);
16222 /* Turn the type into a pack expansion expression. */
16223 type = make_pack_expansion (type);
16225 /* Add it to the list. */
16226 types = add_exception_specifier (types, type, /*complain=*/1);
16227 /* Peek at the next token. */
16228 token = cp_lexer_peek_token (parser->lexer);
16229 /* If it is not a `,', we are done. */
16230 if (token->type != CPP_COMMA)
16232 /* Consume the `,'. */
16233 cp_lexer_consume_token (parser->lexer);
16236 return nreverse (types);
16239 /* Parse a try-block.
16242 try compound-statement handler-seq */
16245 cp_parser_try_block (cp_parser* parser)
16249 cp_parser_require_keyword (parser, RID_TRY, "%<try%>");
16250 try_block = begin_try_block ();
16251 cp_parser_compound_statement (parser, NULL, true);
16252 finish_try_block (try_block);
16253 cp_parser_handler_seq (parser);
16254 finish_handler_sequence (try_block);
16259 /* Parse a function-try-block.
16261 function-try-block:
16262 try ctor-initializer [opt] function-body handler-seq */
16265 cp_parser_function_try_block (cp_parser* parser)
16267 tree compound_stmt;
16269 bool ctor_initializer_p;
16271 /* Look for the `try' keyword. */
16272 if (!cp_parser_require_keyword (parser, RID_TRY, "%<try%>"))
16274 /* Let the rest of the front end know where we are. */
16275 try_block = begin_function_try_block (&compound_stmt);
16276 /* Parse the function-body. */
16278 = cp_parser_ctor_initializer_opt_and_function_body (parser);
16279 /* We're done with the `try' part. */
16280 finish_function_try_block (try_block);
16281 /* Parse the handlers. */
16282 cp_parser_handler_seq (parser);
16283 /* We're done with the handlers. */
16284 finish_function_handler_sequence (try_block, compound_stmt);
16286 return ctor_initializer_p;
16289 /* Parse a handler-seq.
16292 handler handler-seq [opt] */
16295 cp_parser_handler_seq (cp_parser* parser)
16301 /* Parse the handler. */
16302 cp_parser_handler (parser);
16303 /* Peek at the next token. */
16304 token = cp_lexer_peek_token (parser->lexer);
16305 /* If it's not `catch' then there are no more handlers. */
16306 if (!cp_parser_is_keyword (token, RID_CATCH))
16311 /* Parse a handler.
16314 catch ( exception-declaration ) compound-statement */
16317 cp_parser_handler (cp_parser* parser)
16322 cp_parser_require_keyword (parser, RID_CATCH, "%<catch%>");
16323 handler = begin_handler ();
16324 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16325 declaration = cp_parser_exception_declaration (parser);
16326 finish_handler_parms (declaration, handler);
16327 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16328 cp_parser_compound_statement (parser, NULL, false);
16329 finish_handler (handler);
16332 /* Parse an exception-declaration.
16334 exception-declaration:
16335 type-specifier-seq declarator
16336 type-specifier-seq abstract-declarator
16340 Returns a VAR_DECL for the declaration, or NULL_TREE if the
16341 ellipsis variant is used. */
16344 cp_parser_exception_declaration (cp_parser* parser)
16346 cp_decl_specifier_seq type_specifiers;
16347 cp_declarator *declarator;
16348 const char *saved_message;
16350 /* If it's an ellipsis, it's easy to handle. */
16351 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
16353 /* Consume the `...' token. */
16354 cp_lexer_consume_token (parser->lexer);
16358 /* Types may not be defined in exception-declarations. */
16359 saved_message = parser->type_definition_forbidden_message;
16360 parser->type_definition_forbidden_message
16361 = "types may not be defined in exception-declarations";
16363 /* Parse the type-specifier-seq. */
16364 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
16366 /* If it's a `)', then there is no declarator. */
16367 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
16370 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
16371 /*ctor_dtor_or_conv_p=*/NULL,
16372 /*parenthesized_p=*/NULL,
16373 /*member_p=*/false);
16375 /* Restore the saved message. */
16376 parser->type_definition_forbidden_message = saved_message;
16378 if (!type_specifiers.any_specifiers_p)
16379 return error_mark_node;
16381 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
16384 /* Parse a throw-expression.
16387 throw assignment-expression [opt]
16389 Returns a THROW_EXPR representing the throw-expression. */
16392 cp_parser_throw_expression (cp_parser* parser)
16397 cp_parser_require_keyword (parser, RID_THROW, "%<throw%>");
16398 token = cp_lexer_peek_token (parser->lexer);
16399 /* Figure out whether or not there is an assignment-expression
16400 following the "throw" keyword. */
16401 if (token->type == CPP_COMMA
16402 || token->type == CPP_SEMICOLON
16403 || token->type == CPP_CLOSE_PAREN
16404 || token->type == CPP_CLOSE_SQUARE
16405 || token->type == CPP_CLOSE_BRACE
16406 || token->type == CPP_COLON)
16407 expression = NULL_TREE;
16409 expression = cp_parser_assignment_expression (parser,
16412 return build_throw (expression);
16415 /* GNU Extensions */
16417 /* Parse an (optional) asm-specification.
16420 asm ( string-literal )
16422 If the asm-specification is present, returns a STRING_CST
16423 corresponding to the string-literal. Otherwise, returns
16427 cp_parser_asm_specification_opt (cp_parser* parser)
16430 tree asm_specification;
16432 /* Peek at the next token. */
16433 token = cp_lexer_peek_token (parser->lexer);
16434 /* If the next token isn't the `asm' keyword, then there's no
16435 asm-specification. */
16436 if (!cp_parser_is_keyword (token, RID_ASM))
16439 /* Consume the `asm' token. */
16440 cp_lexer_consume_token (parser->lexer);
16441 /* Look for the `('. */
16442 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16444 /* Look for the string-literal. */
16445 asm_specification = cp_parser_string_literal (parser, false, false);
16447 /* Look for the `)'. */
16448 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16450 return asm_specification;
16453 /* Parse an asm-operand-list.
16457 asm-operand-list , asm-operand
16460 string-literal ( expression )
16461 [ string-literal ] string-literal ( expression )
16463 Returns a TREE_LIST representing the operands. The TREE_VALUE of
16464 each node is the expression. The TREE_PURPOSE is itself a
16465 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
16466 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
16467 is a STRING_CST for the string literal before the parenthesis. Returns
16468 ERROR_MARK_NODE if any of the operands are invalid. */
16471 cp_parser_asm_operand_list (cp_parser* parser)
16473 tree asm_operands = NULL_TREE;
16474 bool invalid_operands = false;
16478 tree string_literal;
16482 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
16484 /* Consume the `[' token. */
16485 cp_lexer_consume_token (parser->lexer);
16486 /* Read the operand name. */
16487 name = cp_parser_identifier (parser);
16488 if (name != error_mark_node)
16489 name = build_string (IDENTIFIER_LENGTH (name),
16490 IDENTIFIER_POINTER (name));
16491 /* Look for the closing `]'. */
16492 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
16496 /* Look for the string-literal. */
16497 string_literal = cp_parser_string_literal (parser, false, false);
16499 /* Look for the `('. */
16500 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16501 /* Parse the expression. */
16502 expression = cp_parser_expression (parser, /*cast_p=*/false);
16503 /* Look for the `)'. */
16504 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16506 if (name == error_mark_node
16507 || string_literal == error_mark_node
16508 || expression == error_mark_node)
16509 invalid_operands = true;
16511 /* Add this operand to the list. */
16512 asm_operands = tree_cons (build_tree_list (name, string_literal),
16515 /* If the next token is not a `,', there are no more
16517 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
16519 /* Consume the `,'. */
16520 cp_lexer_consume_token (parser->lexer);
16523 return invalid_operands ? error_mark_node : nreverse (asm_operands);
16526 /* Parse an asm-clobber-list.
16530 asm-clobber-list , string-literal
16532 Returns a TREE_LIST, indicating the clobbers in the order that they
16533 appeared. The TREE_VALUE of each node is a STRING_CST. */
16536 cp_parser_asm_clobber_list (cp_parser* parser)
16538 tree clobbers = NULL_TREE;
16542 tree string_literal;
16544 /* Look for the string literal. */
16545 string_literal = cp_parser_string_literal (parser, false, false);
16546 /* Add it to the list. */
16547 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
16548 /* If the next token is not a `,', then the list is
16550 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
16552 /* Consume the `,' token. */
16553 cp_lexer_consume_token (parser->lexer);
16559 /* Parse an (optional) series of attributes.
16562 attributes attribute
16565 __attribute__ (( attribute-list [opt] ))
16567 The return value is as for cp_parser_attribute_list. */
16570 cp_parser_attributes_opt (cp_parser* parser)
16572 tree attributes = NULL_TREE;
16577 tree attribute_list;
16579 /* Peek at the next token. */
16580 token = cp_lexer_peek_token (parser->lexer);
16581 /* If it's not `__attribute__', then we're done. */
16582 if (token->keyword != RID_ATTRIBUTE)
16585 /* Consume the `__attribute__' keyword. */
16586 cp_lexer_consume_token (parser->lexer);
16587 /* Look for the two `(' tokens. */
16588 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16589 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16591 /* Peek at the next token. */
16592 token = cp_lexer_peek_token (parser->lexer);
16593 if (token->type != CPP_CLOSE_PAREN)
16594 /* Parse the attribute-list. */
16595 attribute_list = cp_parser_attribute_list (parser);
16597 /* If the next token is a `)', then there is no attribute
16599 attribute_list = NULL;
16601 /* Look for the two `)' tokens. */
16602 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16603 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16605 /* Add these new attributes to the list. */
16606 attributes = chainon (attributes, attribute_list);
16612 /* Parse an attribute-list.
16616 attribute-list , attribute
16620 identifier ( identifier )
16621 identifier ( identifier , expression-list )
16622 identifier ( expression-list )
16624 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
16625 to an attribute. The TREE_PURPOSE of each node is the identifier
16626 indicating which attribute is in use. The TREE_VALUE represents
16627 the arguments, if any. */
16630 cp_parser_attribute_list (cp_parser* parser)
16632 tree attribute_list = NULL_TREE;
16633 bool save_translate_strings_p = parser->translate_strings_p;
16635 parser->translate_strings_p = false;
16642 /* Look for the identifier. We also allow keywords here; for
16643 example `__attribute__ ((const))' is legal. */
16644 token = cp_lexer_peek_token (parser->lexer);
16645 if (token->type == CPP_NAME
16646 || token->type == CPP_KEYWORD)
16648 tree arguments = NULL_TREE;
16650 /* Consume the token. */
16651 token = cp_lexer_consume_token (parser->lexer);
16653 /* Save away the identifier that indicates which attribute
16655 identifier = token->u.value;
16656 attribute = build_tree_list (identifier, NULL_TREE);
16658 /* Peek at the next token. */
16659 token = cp_lexer_peek_token (parser->lexer);
16660 /* If it's an `(', then parse the attribute arguments. */
16661 if (token->type == CPP_OPEN_PAREN)
16663 arguments = cp_parser_parenthesized_expression_list
16664 (parser, true, /*cast_p=*/false,
16665 /*allow_expansion_p=*/false,
16666 /*non_constant_p=*/NULL);
16667 /* Save the arguments away. */
16668 TREE_VALUE (attribute) = arguments;
16671 if (arguments != error_mark_node)
16673 /* Add this attribute to the list. */
16674 TREE_CHAIN (attribute) = attribute_list;
16675 attribute_list = attribute;
16678 token = cp_lexer_peek_token (parser->lexer);
16680 /* Now, look for more attributes. If the next token isn't a
16681 `,', we're done. */
16682 if (token->type != CPP_COMMA)
16685 /* Consume the comma and keep going. */
16686 cp_lexer_consume_token (parser->lexer);
16688 parser->translate_strings_p = save_translate_strings_p;
16690 /* We built up the list in reverse order. */
16691 return nreverse (attribute_list);
16694 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
16695 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
16696 current value of the PEDANTIC flag, regardless of whether or not
16697 the `__extension__' keyword is present. The caller is responsible
16698 for restoring the value of the PEDANTIC flag. */
16701 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
16703 /* Save the old value of the PEDANTIC flag. */
16704 *saved_pedantic = pedantic;
16706 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
16708 /* Consume the `__extension__' token. */
16709 cp_lexer_consume_token (parser->lexer);
16710 /* We're not being pedantic while the `__extension__' keyword is
16720 /* Parse a label declaration.
16723 __label__ label-declarator-seq ;
16725 label-declarator-seq:
16726 identifier , label-declarator-seq
16730 cp_parser_label_declaration (cp_parser* parser)
16732 /* Look for the `__label__' keyword. */
16733 cp_parser_require_keyword (parser, RID_LABEL, "%<__label__%>");
16739 /* Look for an identifier. */
16740 identifier = cp_parser_identifier (parser);
16741 /* If we failed, stop. */
16742 if (identifier == error_mark_node)
16744 /* Declare it as a label. */
16745 finish_label_decl (identifier);
16746 /* If the next token is a `;', stop. */
16747 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16749 /* Look for the `,' separating the label declarations. */
16750 cp_parser_require (parser, CPP_COMMA, "%<,%>");
16753 /* Look for the final `;'. */
16754 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
16757 /* Support Functions */
16759 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
16760 NAME should have one of the representations used for an
16761 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
16762 is returned. If PARSER->SCOPE is a dependent type, then a
16763 SCOPE_REF is returned.
16765 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
16766 returned; the name was already resolved when the TEMPLATE_ID_EXPR
16767 was formed. Abstractly, such entities should not be passed to this
16768 function, because they do not need to be looked up, but it is
16769 simpler to check for this special case here, rather than at the
16772 In cases not explicitly covered above, this function returns a
16773 DECL, OVERLOAD, or baselink representing the result of the lookup.
16774 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
16777 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
16778 (e.g., "struct") that was used. In that case bindings that do not
16779 refer to types are ignored.
16781 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
16784 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
16787 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
16790 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
16791 TREE_LIST of candidates if name-lookup results in an ambiguity, and
16792 NULL_TREE otherwise. */
16795 cp_parser_lookup_name (cp_parser *parser, tree name,
16796 enum tag_types tag_type,
16799 bool check_dependency,
16800 tree *ambiguous_decls,
16801 location_t name_location)
16805 tree object_type = parser->context->object_type;
16807 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
16808 flags |= LOOKUP_COMPLAIN;
16810 /* Assume that the lookup will be unambiguous. */
16811 if (ambiguous_decls)
16812 *ambiguous_decls = NULL_TREE;
16814 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
16815 no longer valid. Note that if we are parsing tentatively, and
16816 the parse fails, OBJECT_TYPE will be automatically restored. */
16817 parser->context->object_type = NULL_TREE;
16819 if (name == error_mark_node)
16820 return error_mark_node;
16822 /* A template-id has already been resolved; there is no lookup to
16824 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
16826 if (BASELINK_P (name))
16828 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
16829 == TEMPLATE_ID_EXPR);
16833 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
16834 it should already have been checked to make sure that the name
16835 used matches the type being destroyed. */
16836 if (TREE_CODE (name) == BIT_NOT_EXPR)
16840 /* Figure out to which type this destructor applies. */
16842 type = parser->scope;
16843 else if (object_type)
16844 type = object_type;
16846 type = current_class_type;
16847 /* If that's not a class type, there is no destructor. */
16848 if (!type || !CLASS_TYPE_P (type))
16849 return error_mark_node;
16850 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
16851 lazily_declare_fn (sfk_destructor, type);
16852 if (!CLASSTYPE_DESTRUCTORS (type))
16853 return error_mark_node;
16854 /* If it was a class type, return the destructor. */
16855 return CLASSTYPE_DESTRUCTORS (type);
16858 /* By this point, the NAME should be an ordinary identifier. If
16859 the id-expression was a qualified name, the qualifying scope is
16860 stored in PARSER->SCOPE at this point. */
16861 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
16863 /* Perform the lookup. */
16868 if (parser->scope == error_mark_node)
16869 return error_mark_node;
16871 /* If the SCOPE is dependent, the lookup must be deferred until
16872 the template is instantiated -- unless we are explicitly
16873 looking up names in uninstantiated templates. Even then, we
16874 cannot look up the name if the scope is not a class type; it
16875 might, for example, be a template type parameter. */
16876 dependent_p = (TYPE_P (parser->scope)
16877 && !(parser->in_declarator_p
16878 && currently_open_class (parser->scope))
16879 && dependent_type_p (parser->scope));
16880 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
16887 /* The resolution to Core Issue 180 says that `struct
16888 A::B' should be considered a type-name, even if `A'
16890 type = make_typename_type (parser->scope, name, tag_type,
16891 /*complain=*/tf_error);
16892 decl = TYPE_NAME (type);
16894 else if (is_template
16895 && (cp_parser_next_token_ends_template_argument_p (parser)
16896 || cp_lexer_next_token_is (parser->lexer,
16898 decl = make_unbound_class_template (parser->scope,
16900 /*complain=*/tf_error);
16902 decl = build_qualified_name (/*type=*/NULL_TREE,
16903 parser->scope, name,
16908 tree pushed_scope = NULL_TREE;
16910 /* If PARSER->SCOPE is a dependent type, then it must be a
16911 class type, and we must not be checking dependencies;
16912 otherwise, we would have processed this lookup above. So
16913 that PARSER->SCOPE is not considered a dependent base by
16914 lookup_member, we must enter the scope here. */
16916 pushed_scope = push_scope (parser->scope);
16917 /* If the PARSER->SCOPE is a template specialization, it
16918 may be instantiated during name lookup. In that case,
16919 errors may be issued. Even if we rollback the current
16920 tentative parse, those errors are valid. */
16921 decl = lookup_qualified_name (parser->scope, name,
16922 tag_type != none_type,
16923 /*complain=*/true);
16925 /* If we have a single function from a using decl, pull it out. */
16927 && TREE_CODE (decl) == OVERLOAD
16928 && !really_overloaded_fn (decl))
16929 decl = OVL_FUNCTION (decl);
16932 pop_scope (pushed_scope);
16934 parser->qualifying_scope = parser->scope;
16935 parser->object_scope = NULL_TREE;
16937 else if (object_type)
16939 tree object_decl = NULL_TREE;
16940 /* Look up the name in the scope of the OBJECT_TYPE, unless the
16941 OBJECT_TYPE is not a class. */
16942 if (CLASS_TYPE_P (object_type))
16943 /* If the OBJECT_TYPE is a template specialization, it may
16944 be instantiated during name lookup. In that case, errors
16945 may be issued. Even if we rollback the current tentative
16946 parse, those errors are valid. */
16947 object_decl = lookup_member (object_type,
16950 tag_type != none_type);
16951 /* Look it up in the enclosing context, too. */
16952 decl = lookup_name_real (name, tag_type != none_type,
16954 /*block_p=*/true, is_namespace, flags);
16955 parser->object_scope = object_type;
16956 parser->qualifying_scope = NULL_TREE;
16958 decl = object_decl;
16962 decl = lookup_name_real (name, tag_type != none_type,
16964 /*block_p=*/true, is_namespace, flags);
16965 parser->qualifying_scope = NULL_TREE;
16966 parser->object_scope = NULL_TREE;
16969 /* If the lookup failed, let our caller know. */
16970 if (!decl || decl == error_mark_node)
16971 return error_mark_node;
16973 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
16974 if (TREE_CODE (decl) == TREE_LIST)
16976 if (ambiguous_decls)
16977 *ambiguous_decls = decl;
16978 /* The error message we have to print is too complicated for
16979 cp_parser_error, so we incorporate its actions directly. */
16980 if (!cp_parser_simulate_error (parser))
16982 error ("%Hreference to %qD is ambiguous",
16983 &name_location, name);
16984 print_candidates (decl);
16986 return error_mark_node;
16989 gcc_assert (DECL_P (decl)
16990 || TREE_CODE (decl) == OVERLOAD
16991 || TREE_CODE (decl) == SCOPE_REF
16992 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
16993 || BASELINK_P (decl));
16995 /* If we have resolved the name of a member declaration, check to
16996 see if the declaration is accessible. When the name resolves to
16997 set of overloaded functions, accessibility is checked when
16998 overload resolution is done.
17000 During an explicit instantiation, access is not checked at all,
17001 as per [temp.explicit]. */
17003 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
17008 /* Like cp_parser_lookup_name, but for use in the typical case where
17009 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
17010 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
17013 cp_parser_lookup_name_simple (cp_parser* parser, tree name, location_t location)
17015 return cp_parser_lookup_name (parser, name,
17017 /*is_template=*/false,
17018 /*is_namespace=*/false,
17019 /*check_dependency=*/true,
17020 /*ambiguous_decls=*/NULL,
17024 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
17025 the current context, return the TYPE_DECL. If TAG_NAME_P is
17026 true, the DECL indicates the class being defined in a class-head,
17027 or declared in an elaborated-type-specifier.
17029 Otherwise, return DECL. */
17032 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
17034 /* If the TEMPLATE_DECL is being declared as part of a class-head,
17035 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
17038 template <typename T> struct B;
17041 template <typename T> struct A::B {};
17043 Similarly, in an elaborated-type-specifier:
17045 namespace N { struct X{}; }
17048 template <typename T> friend struct N::X;
17051 However, if the DECL refers to a class type, and we are in
17052 the scope of the class, then the name lookup automatically
17053 finds the TYPE_DECL created by build_self_reference rather
17054 than a TEMPLATE_DECL. For example, in:
17056 template <class T> struct S {
17060 there is no need to handle such case. */
17062 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
17063 return DECL_TEMPLATE_RESULT (decl);
17068 /* If too many, or too few, template-parameter lists apply to the
17069 declarator, issue an error message. Returns TRUE if all went well,
17070 and FALSE otherwise. */
17073 cp_parser_check_declarator_template_parameters (cp_parser* parser,
17074 cp_declarator *declarator,
17075 location_t declarator_location)
17077 unsigned num_templates;
17079 /* We haven't seen any classes that involve template parameters yet. */
17082 switch (declarator->kind)
17085 if (declarator->u.id.qualifying_scope)
17090 scope = declarator->u.id.qualifying_scope;
17091 member = declarator->u.id.unqualified_name;
17093 while (scope && CLASS_TYPE_P (scope))
17095 /* You're supposed to have one `template <...>'
17096 for every template class, but you don't need one
17097 for a full specialization. For example:
17099 template <class T> struct S{};
17100 template <> struct S<int> { void f(); };
17101 void S<int>::f () {}
17103 is correct; there shouldn't be a `template <>' for
17104 the definition of `S<int>::f'. */
17105 if (!CLASSTYPE_TEMPLATE_INFO (scope))
17106 /* If SCOPE does not have template information of any
17107 kind, then it is not a template, nor is it nested
17108 within a template. */
17110 if (explicit_class_specialization_p (scope))
17112 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
17115 scope = TYPE_CONTEXT (scope);
17118 else if (TREE_CODE (declarator->u.id.unqualified_name)
17119 == TEMPLATE_ID_EXPR)
17120 /* If the DECLARATOR has the form `X<y>' then it uses one
17121 additional level of template parameters. */
17124 return cp_parser_check_template_parameters (parser,
17126 declarator_location);
17131 case cdk_reference:
17133 return (cp_parser_check_declarator_template_parameters
17134 (parser, declarator->declarator, declarator_location));
17140 gcc_unreachable ();
17145 /* NUM_TEMPLATES were used in the current declaration. If that is
17146 invalid, return FALSE and issue an error messages. Otherwise,
17150 cp_parser_check_template_parameters (cp_parser* parser,
17151 unsigned num_templates,
17152 location_t location)
17154 /* If there are more template classes than parameter lists, we have
17157 template <class T> void S<T>::R<T>::f (); */
17158 if (parser->num_template_parameter_lists < num_templates)
17160 error ("%Htoo few template-parameter-lists", &location);
17163 /* If there are the same number of template classes and parameter
17164 lists, that's OK. */
17165 if (parser->num_template_parameter_lists == num_templates)
17167 /* If there are more, but only one more, then we are referring to a
17168 member template. That's OK too. */
17169 if (parser->num_template_parameter_lists == num_templates + 1)
17171 /* Otherwise, there are too many template parameter lists. We have
17174 template <class T> template <class U> void S::f(); */
17175 error ("%Htoo many template-parameter-lists", &location);
17179 /* Parse an optional `::' token indicating that the following name is
17180 from the global namespace. If so, PARSER->SCOPE is set to the
17181 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
17182 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
17183 Returns the new value of PARSER->SCOPE, if the `::' token is
17184 present, and NULL_TREE otherwise. */
17187 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
17191 /* Peek at the next token. */
17192 token = cp_lexer_peek_token (parser->lexer);
17193 /* If we're looking at a `::' token then we're starting from the
17194 global namespace, not our current location. */
17195 if (token->type == CPP_SCOPE)
17197 /* Consume the `::' token. */
17198 cp_lexer_consume_token (parser->lexer);
17199 /* Set the SCOPE so that we know where to start the lookup. */
17200 parser->scope = global_namespace;
17201 parser->qualifying_scope = global_namespace;
17202 parser->object_scope = NULL_TREE;
17204 return parser->scope;
17206 else if (!current_scope_valid_p)
17208 parser->scope = NULL_TREE;
17209 parser->qualifying_scope = NULL_TREE;
17210 parser->object_scope = NULL_TREE;
17216 /* Returns TRUE if the upcoming token sequence is the start of a
17217 constructor declarator. If FRIEND_P is true, the declarator is
17218 preceded by the `friend' specifier. */
17221 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
17223 bool constructor_p;
17224 tree type_decl = NULL_TREE;
17225 bool nested_name_p;
17226 cp_token *next_token;
17228 /* The common case is that this is not a constructor declarator, so
17229 try to avoid doing lots of work if at all possible. It's not
17230 valid declare a constructor at function scope. */
17231 if (parser->in_function_body)
17233 /* And only certain tokens can begin a constructor declarator. */
17234 next_token = cp_lexer_peek_token (parser->lexer);
17235 if (next_token->type != CPP_NAME
17236 && next_token->type != CPP_SCOPE
17237 && next_token->type != CPP_NESTED_NAME_SPECIFIER
17238 && next_token->type != CPP_TEMPLATE_ID)
17241 /* Parse tentatively; we are going to roll back all of the tokens
17243 cp_parser_parse_tentatively (parser);
17244 /* Assume that we are looking at a constructor declarator. */
17245 constructor_p = true;
17247 /* Look for the optional `::' operator. */
17248 cp_parser_global_scope_opt (parser,
17249 /*current_scope_valid_p=*/false);
17250 /* Look for the nested-name-specifier. */
17252 = (cp_parser_nested_name_specifier_opt (parser,
17253 /*typename_keyword_p=*/false,
17254 /*check_dependency_p=*/false,
17256 /*is_declaration=*/false)
17258 /* Outside of a class-specifier, there must be a
17259 nested-name-specifier. */
17260 if (!nested_name_p &&
17261 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
17263 constructor_p = false;
17264 /* If we still think that this might be a constructor-declarator,
17265 look for a class-name. */
17270 template <typename T> struct S { S(); };
17271 template <typename T> S<T>::S ();
17273 we must recognize that the nested `S' names a class.
17276 template <typename T> S<T>::S<T> ();
17278 we must recognize that the nested `S' names a template. */
17279 type_decl = cp_parser_class_name (parser,
17280 /*typename_keyword_p=*/false,
17281 /*template_keyword_p=*/false,
17283 /*check_dependency_p=*/false,
17284 /*class_head_p=*/false,
17285 /*is_declaration=*/false);
17286 /* If there was no class-name, then this is not a constructor. */
17287 constructor_p = !cp_parser_error_occurred (parser);
17290 /* If we're still considering a constructor, we have to see a `(',
17291 to begin the parameter-declaration-clause, followed by either a
17292 `)', an `...', or a decl-specifier. We need to check for a
17293 type-specifier to avoid being fooled into thinking that:
17297 is a constructor. (It is actually a function named `f' that
17298 takes one parameter (of type `int') and returns a value of type
17301 && cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
17303 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
17304 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
17305 /* A parameter declaration begins with a decl-specifier,
17306 which is either the "attribute" keyword, a storage class
17307 specifier, or (usually) a type-specifier. */
17308 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
17311 tree pushed_scope = NULL_TREE;
17312 unsigned saved_num_template_parameter_lists;
17314 /* Names appearing in the type-specifier should be looked up
17315 in the scope of the class. */
17316 if (current_class_type)
17320 type = TREE_TYPE (type_decl);
17321 if (TREE_CODE (type) == TYPENAME_TYPE)
17323 type = resolve_typename_type (type,
17324 /*only_current_p=*/false);
17325 if (TREE_CODE (type) == TYPENAME_TYPE)
17327 cp_parser_abort_tentative_parse (parser);
17331 pushed_scope = push_scope (type);
17334 /* Inside the constructor parameter list, surrounding
17335 template-parameter-lists do not apply. */
17336 saved_num_template_parameter_lists
17337 = parser->num_template_parameter_lists;
17338 parser->num_template_parameter_lists = 0;
17340 /* Look for the type-specifier. */
17341 cp_parser_type_specifier (parser,
17342 CP_PARSER_FLAGS_NONE,
17343 /*decl_specs=*/NULL,
17344 /*is_declarator=*/true,
17345 /*declares_class_or_enum=*/NULL,
17346 /*is_cv_qualifier=*/NULL);
17348 parser->num_template_parameter_lists
17349 = saved_num_template_parameter_lists;
17351 /* Leave the scope of the class. */
17353 pop_scope (pushed_scope);
17355 constructor_p = !cp_parser_error_occurred (parser);
17359 constructor_p = false;
17360 /* We did not really want to consume any tokens. */
17361 cp_parser_abort_tentative_parse (parser);
17363 return constructor_p;
17366 /* Parse the definition of the function given by the DECL_SPECIFIERS,
17367 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
17368 they must be performed once we are in the scope of the function.
17370 Returns the function defined. */
17373 cp_parser_function_definition_from_specifiers_and_declarator
17374 (cp_parser* parser,
17375 cp_decl_specifier_seq *decl_specifiers,
17377 const cp_declarator *declarator)
17382 /* Begin the function-definition. */
17383 success_p = start_function (decl_specifiers, declarator, attributes);
17385 /* The things we're about to see are not directly qualified by any
17386 template headers we've seen thus far. */
17387 reset_specialization ();
17389 /* If there were names looked up in the decl-specifier-seq that we
17390 did not check, check them now. We must wait until we are in the
17391 scope of the function to perform the checks, since the function
17392 might be a friend. */
17393 perform_deferred_access_checks ();
17397 /* Skip the entire function. */
17398 cp_parser_skip_to_end_of_block_or_statement (parser);
17399 fn = error_mark_node;
17401 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
17403 /* Seen already, skip it. An error message has already been output. */
17404 cp_parser_skip_to_end_of_block_or_statement (parser);
17405 fn = current_function_decl;
17406 current_function_decl = NULL_TREE;
17407 /* If this is a function from a class, pop the nested class. */
17408 if (current_class_name)
17409 pop_nested_class ();
17412 fn = cp_parser_function_definition_after_declarator (parser,
17413 /*inline_p=*/false);
17418 /* Parse the part of a function-definition that follows the
17419 declarator. INLINE_P is TRUE iff this function is an inline
17420 function defined with a class-specifier.
17422 Returns the function defined. */
17425 cp_parser_function_definition_after_declarator (cp_parser* parser,
17429 bool ctor_initializer_p = false;
17430 bool saved_in_unbraced_linkage_specification_p;
17431 bool saved_in_function_body;
17432 unsigned saved_num_template_parameter_lists;
17435 saved_in_function_body = parser->in_function_body;
17436 parser->in_function_body = true;
17437 /* If the next token is `return', then the code may be trying to
17438 make use of the "named return value" extension that G++ used to
17440 token = cp_lexer_peek_token (parser->lexer);
17441 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
17443 /* Consume the `return' keyword. */
17444 cp_lexer_consume_token (parser->lexer);
17445 /* Look for the identifier that indicates what value is to be
17447 cp_parser_identifier (parser);
17448 /* Issue an error message. */
17449 error ("%Hnamed return values are no longer supported",
17451 /* Skip tokens until we reach the start of the function body. */
17454 cp_token *token = cp_lexer_peek_token (parser->lexer);
17455 if (token->type == CPP_OPEN_BRACE
17456 || token->type == CPP_EOF
17457 || token->type == CPP_PRAGMA_EOL)
17459 cp_lexer_consume_token (parser->lexer);
17462 /* The `extern' in `extern "C" void f () { ... }' does not apply to
17463 anything declared inside `f'. */
17464 saved_in_unbraced_linkage_specification_p
17465 = parser->in_unbraced_linkage_specification_p;
17466 parser->in_unbraced_linkage_specification_p = false;
17467 /* Inside the function, surrounding template-parameter-lists do not
17469 saved_num_template_parameter_lists
17470 = parser->num_template_parameter_lists;
17471 parser->num_template_parameter_lists = 0;
17472 /* If the next token is `try', then we are looking at a
17473 function-try-block. */
17474 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
17475 ctor_initializer_p = cp_parser_function_try_block (parser);
17476 /* A function-try-block includes the function-body, so we only do
17477 this next part if we're not processing a function-try-block. */
17480 = cp_parser_ctor_initializer_opt_and_function_body (parser);
17482 /* Finish the function. */
17483 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
17484 (inline_p ? 2 : 0));
17485 /* Generate code for it, if necessary. */
17486 expand_or_defer_fn (fn);
17487 /* Restore the saved values. */
17488 parser->in_unbraced_linkage_specification_p
17489 = saved_in_unbraced_linkage_specification_p;
17490 parser->num_template_parameter_lists
17491 = saved_num_template_parameter_lists;
17492 parser->in_function_body = saved_in_function_body;
17497 /* Parse a template-declaration, assuming that the `export' (and
17498 `extern') keywords, if present, has already been scanned. MEMBER_P
17499 is as for cp_parser_template_declaration. */
17502 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
17504 tree decl = NULL_TREE;
17505 VEC (deferred_access_check,gc) *checks;
17506 tree parameter_list;
17507 bool friend_p = false;
17508 bool need_lang_pop;
17511 /* Look for the `template' keyword. */
17512 token = cp_lexer_peek_token (parser->lexer);
17513 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "%<template%>"))
17517 if (!cp_parser_require (parser, CPP_LESS, "%<<%>"))
17519 if (at_class_scope_p () && current_function_decl)
17521 /* 14.5.2.2 [temp.mem]
17523 A local class shall not have member templates. */
17524 error ("%Hinvalid declaration of member template in local class",
17526 cp_parser_skip_to_end_of_block_or_statement (parser);
17531 A template ... shall not have C linkage. */
17532 if (current_lang_name == lang_name_c)
17534 error ("%Htemplate with C linkage", &token->location);
17535 /* Give it C++ linkage to avoid confusing other parts of the
17537 push_lang_context (lang_name_cplusplus);
17538 need_lang_pop = true;
17541 need_lang_pop = false;
17543 /* We cannot perform access checks on the template parameter
17544 declarations until we know what is being declared, just as we
17545 cannot check the decl-specifier list. */
17546 push_deferring_access_checks (dk_deferred);
17548 /* If the next token is `>', then we have an invalid
17549 specialization. Rather than complain about an invalid template
17550 parameter, issue an error message here. */
17551 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
17553 cp_parser_error (parser, "invalid explicit specialization");
17554 begin_specialization ();
17555 parameter_list = NULL_TREE;
17558 /* Parse the template parameters. */
17559 parameter_list = cp_parser_template_parameter_list (parser);
17561 /* Get the deferred access checks from the parameter list. These
17562 will be checked once we know what is being declared, as for a
17563 member template the checks must be performed in the scope of the
17564 class containing the member. */
17565 checks = get_deferred_access_checks ();
17567 /* Look for the `>'. */
17568 cp_parser_skip_to_end_of_template_parameter_list (parser);
17569 /* We just processed one more parameter list. */
17570 ++parser->num_template_parameter_lists;
17571 /* If the next token is `template', there are more template
17573 if (cp_lexer_next_token_is_keyword (parser->lexer,
17575 cp_parser_template_declaration_after_export (parser, member_p);
17578 /* There are no access checks when parsing a template, as we do not
17579 know if a specialization will be a friend. */
17580 push_deferring_access_checks (dk_no_check);
17581 token = cp_lexer_peek_token (parser->lexer);
17582 decl = cp_parser_single_declaration (parser,
17585 /*explicit_specialization_p=*/false,
17587 pop_deferring_access_checks ();
17589 /* If this is a member template declaration, let the front
17591 if (member_p && !friend_p && decl)
17593 if (TREE_CODE (decl) == TYPE_DECL)
17594 cp_parser_check_access_in_redeclaration (decl, token->location);
17596 decl = finish_member_template_decl (decl);
17598 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
17599 make_friend_class (current_class_type, TREE_TYPE (decl),
17600 /*complain=*/true);
17602 /* We are done with the current parameter list. */
17603 --parser->num_template_parameter_lists;
17605 pop_deferring_access_checks ();
17608 finish_template_decl (parameter_list);
17610 /* Register member declarations. */
17611 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
17612 finish_member_declaration (decl);
17613 /* For the erroneous case of a template with C linkage, we pushed an
17614 implicit C++ linkage scope; exit that scope now. */
17616 pop_lang_context ();
17617 /* If DECL is a function template, we must return to parse it later.
17618 (Even though there is no definition, there might be default
17619 arguments that need handling.) */
17620 if (member_p && decl
17621 && (TREE_CODE (decl) == FUNCTION_DECL
17622 || DECL_FUNCTION_TEMPLATE_P (decl)))
17623 TREE_VALUE (parser->unparsed_functions_queues)
17624 = tree_cons (NULL_TREE, decl,
17625 TREE_VALUE (parser->unparsed_functions_queues));
17628 /* Perform the deferred access checks from a template-parameter-list.
17629 CHECKS is a TREE_LIST of access checks, as returned by
17630 get_deferred_access_checks. */
17633 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
17635 ++processing_template_parmlist;
17636 perform_access_checks (checks);
17637 --processing_template_parmlist;
17640 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
17641 `function-definition' sequence. MEMBER_P is true, this declaration
17642 appears in a class scope.
17644 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
17645 *FRIEND_P is set to TRUE iff the declaration is a friend. */
17648 cp_parser_single_declaration (cp_parser* parser,
17649 VEC (deferred_access_check,gc)* checks,
17651 bool explicit_specialization_p,
17654 int declares_class_or_enum;
17655 tree decl = NULL_TREE;
17656 cp_decl_specifier_seq decl_specifiers;
17657 bool function_definition_p = false;
17658 cp_token *decl_spec_token_start;
17660 /* This function is only used when processing a template
17662 gcc_assert (innermost_scope_kind () == sk_template_parms
17663 || innermost_scope_kind () == sk_template_spec);
17665 /* Defer access checks until we know what is being declared. */
17666 push_deferring_access_checks (dk_deferred);
17668 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
17670 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
17671 cp_parser_decl_specifier_seq (parser,
17672 CP_PARSER_FLAGS_OPTIONAL,
17674 &declares_class_or_enum);
17676 *friend_p = cp_parser_friend_p (&decl_specifiers);
17678 /* There are no template typedefs. */
17679 if (decl_specifiers.specs[(int) ds_typedef])
17681 error ("%Htemplate declaration of %qs",
17682 &decl_spec_token_start->location, "typedef");
17683 decl = error_mark_node;
17686 /* Gather up the access checks that occurred the
17687 decl-specifier-seq. */
17688 stop_deferring_access_checks ();
17690 /* Check for the declaration of a template class. */
17691 if (declares_class_or_enum)
17693 if (cp_parser_declares_only_class_p (parser))
17695 decl = shadow_tag (&decl_specifiers);
17700 friend template <typename T> struct A<T>::B;
17703 A<T>::B will be represented by a TYPENAME_TYPE, and
17704 therefore not recognized by shadow_tag. */
17705 if (friend_p && *friend_p
17707 && decl_specifiers.type
17708 && TYPE_P (decl_specifiers.type))
17709 decl = decl_specifiers.type;
17711 if (decl && decl != error_mark_node)
17712 decl = TYPE_NAME (decl);
17714 decl = error_mark_node;
17716 /* Perform access checks for template parameters. */
17717 cp_parser_perform_template_parameter_access_checks (checks);
17720 /* If it's not a template class, try for a template function. If
17721 the next token is a `;', then this declaration does not declare
17722 anything. But, if there were errors in the decl-specifiers, then
17723 the error might well have come from an attempted class-specifier.
17724 In that case, there's no need to warn about a missing declarator. */
17726 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
17727 || decl_specifiers.type != error_mark_node))
17729 decl = cp_parser_init_declarator (parser,
17732 /*function_definition_allowed_p=*/true,
17734 declares_class_or_enum,
17735 &function_definition_p);
17737 /* 7.1.1-1 [dcl.stc]
17739 A storage-class-specifier shall not be specified in an explicit
17740 specialization... */
17742 && explicit_specialization_p
17743 && decl_specifiers.storage_class != sc_none)
17745 error ("%Hexplicit template specialization cannot have a storage class",
17746 &decl_spec_token_start->location);
17747 decl = error_mark_node;
17751 pop_deferring_access_checks ();
17753 /* Clear any current qualification; whatever comes next is the start
17754 of something new. */
17755 parser->scope = NULL_TREE;
17756 parser->qualifying_scope = NULL_TREE;
17757 parser->object_scope = NULL_TREE;
17758 /* Look for a trailing `;' after the declaration. */
17759 if (!function_definition_p
17760 && (decl == error_mark_node
17761 || !cp_parser_require (parser, CPP_SEMICOLON, "%<;%>")))
17762 cp_parser_skip_to_end_of_block_or_statement (parser);
17767 /* Parse a cast-expression that is not the operand of a unary "&". */
17770 cp_parser_simple_cast_expression (cp_parser *parser)
17772 return cp_parser_cast_expression (parser, /*address_p=*/false,
17776 /* Parse a functional cast to TYPE. Returns an expression
17777 representing the cast. */
17780 cp_parser_functional_cast (cp_parser* parser, tree type)
17782 tree expression_list;
17786 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
17788 maybe_warn_cpp0x ("extended initializer lists");
17789 expression_list = cp_parser_braced_list (parser, &nonconst_p);
17790 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
17791 if (TREE_CODE (type) == TYPE_DECL)
17792 type = TREE_TYPE (type);
17793 return finish_compound_literal (type, expression_list);
17797 = cp_parser_parenthesized_expression_list (parser, false,
17799 /*allow_expansion_p=*/true,
17800 /*non_constant_p=*/NULL);
17802 cast = build_functional_cast (type, expression_list,
17803 tf_warning_or_error);
17804 /* [expr.const]/1: In an integral constant expression "only type
17805 conversions to integral or enumeration type can be used". */
17806 if (TREE_CODE (type) == TYPE_DECL)
17807 type = TREE_TYPE (type);
17808 if (cast != error_mark_node
17809 && !cast_valid_in_integral_constant_expression_p (type)
17810 && (cp_parser_non_integral_constant_expression
17811 (parser, "a call to a constructor")))
17812 return error_mark_node;
17816 /* Save the tokens that make up the body of a member function defined
17817 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
17818 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
17819 specifiers applied to the declaration. Returns the FUNCTION_DECL
17820 for the member function. */
17823 cp_parser_save_member_function_body (cp_parser* parser,
17824 cp_decl_specifier_seq *decl_specifiers,
17825 cp_declarator *declarator,
17832 /* Create the function-declaration. */
17833 fn = start_method (decl_specifiers, declarator, attributes);
17834 /* If something went badly wrong, bail out now. */
17835 if (fn == error_mark_node)
17837 /* If there's a function-body, skip it. */
17838 if (cp_parser_token_starts_function_definition_p
17839 (cp_lexer_peek_token (parser->lexer)))
17840 cp_parser_skip_to_end_of_block_or_statement (parser);
17841 return error_mark_node;
17844 /* Remember it, if there default args to post process. */
17845 cp_parser_save_default_args (parser, fn);
17847 /* Save away the tokens that make up the body of the
17849 first = parser->lexer->next_token;
17850 /* We can have braced-init-list mem-initializers before the fn body. */
17851 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
17853 cp_lexer_consume_token (parser->lexer);
17854 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
17855 && cp_lexer_next_token_is_not_keyword (parser->lexer, RID_TRY))
17857 /* cache_group will stop after an un-nested { } pair, too. */
17858 if (cp_parser_cache_group (parser, CPP_CLOSE_PAREN, /*depth=*/0))
17861 /* variadic mem-inits have ... after the ')'. */
17862 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
17863 cp_lexer_consume_token (parser->lexer);
17866 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
17867 /* Handle function try blocks. */
17868 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
17869 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
17870 last = parser->lexer->next_token;
17872 /* Save away the inline definition; we will process it when the
17873 class is complete. */
17874 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
17875 DECL_PENDING_INLINE_P (fn) = 1;
17877 /* We need to know that this was defined in the class, so that
17878 friend templates are handled correctly. */
17879 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
17881 /* We're done with the inline definition. */
17882 finish_method (fn);
17884 /* Add FN to the queue of functions to be parsed later. */
17885 TREE_VALUE (parser->unparsed_functions_queues)
17886 = tree_cons (NULL_TREE, fn,
17887 TREE_VALUE (parser->unparsed_functions_queues));
17892 /* Parse a template-argument-list, as well as the trailing ">" (but
17893 not the opening ">"). See cp_parser_template_argument_list for the
17897 cp_parser_enclosed_template_argument_list (cp_parser* parser)
17901 tree saved_qualifying_scope;
17902 tree saved_object_scope;
17903 bool saved_greater_than_is_operator_p;
17904 bool saved_skip_evaluation;
17908 When parsing a template-id, the first non-nested `>' is taken as
17909 the end of the template-argument-list rather than a greater-than
17911 saved_greater_than_is_operator_p
17912 = parser->greater_than_is_operator_p;
17913 parser->greater_than_is_operator_p = false;
17914 /* Parsing the argument list may modify SCOPE, so we save it
17916 saved_scope = parser->scope;
17917 saved_qualifying_scope = parser->qualifying_scope;
17918 saved_object_scope = parser->object_scope;
17919 /* We need to evaluate the template arguments, even though this
17920 template-id may be nested within a "sizeof". */
17921 saved_skip_evaluation = skip_evaluation;
17922 skip_evaluation = false;
17923 /* Parse the template-argument-list itself. */
17924 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER)
17925 || cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
17926 arguments = NULL_TREE;
17928 arguments = cp_parser_template_argument_list (parser);
17929 /* Look for the `>' that ends the template-argument-list. If we find
17930 a '>>' instead, it's probably just a typo. */
17931 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
17933 if (cxx_dialect != cxx98)
17935 /* In C++0x, a `>>' in a template argument list or cast
17936 expression is considered to be two separate `>'
17937 tokens. So, change the current token to a `>', but don't
17938 consume it: it will be consumed later when the outer
17939 template argument list (or cast expression) is parsed.
17940 Note that this replacement of `>' for `>>' is necessary
17941 even if we are parsing tentatively: in the tentative
17942 case, after calling
17943 cp_parser_enclosed_template_argument_list we will always
17944 throw away all of the template arguments and the first
17945 closing `>', either because the template argument list
17946 was erroneous or because we are replacing those tokens
17947 with a CPP_TEMPLATE_ID token. The second `>' (which will
17948 not have been thrown away) is needed either to close an
17949 outer template argument list or to complete a new-style
17951 cp_token *token = cp_lexer_peek_token (parser->lexer);
17952 token->type = CPP_GREATER;
17954 else if (!saved_greater_than_is_operator_p)
17956 /* If we're in a nested template argument list, the '>>' has
17957 to be a typo for '> >'. We emit the error message, but we
17958 continue parsing and we push a '>' as next token, so that
17959 the argument list will be parsed correctly. Note that the
17960 global source location is still on the token before the
17961 '>>', so we need to say explicitly where we want it. */
17962 cp_token *token = cp_lexer_peek_token (parser->lexer);
17963 error ("%H%<>>%> should be %<> >%> "
17964 "within a nested template argument list",
17967 token->type = CPP_GREATER;
17971 /* If this is not a nested template argument list, the '>>'
17972 is a typo for '>'. Emit an error message and continue.
17973 Same deal about the token location, but here we can get it
17974 right by consuming the '>>' before issuing the diagnostic. */
17975 cp_token *token = cp_lexer_consume_token (parser->lexer);
17976 error ("%Hspurious %<>>%>, use %<>%> to terminate "
17977 "a template argument list", &token->location);
17981 cp_parser_skip_to_end_of_template_parameter_list (parser);
17982 /* The `>' token might be a greater-than operator again now. */
17983 parser->greater_than_is_operator_p
17984 = saved_greater_than_is_operator_p;
17985 /* Restore the SAVED_SCOPE. */
17986 parser->scope = saved_scope;
17987 parser->qualifying_scope = saved_qualifying_scope;
17988 parser->object_scope = saved_object_scope;
17989 skip_evaluation = saved_skip_evaluation;
17994 /* MEMBER_FUNCTION is a member function, or a friend. If default
17995 arguments, or the body of the function have not yet been parsed,
17999 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
18001 /* If this member is a template, get the underlying
18003 if (DECL_FUNCTION_TEMPLATE_P (member_function))
18004 member_function = DECL_TEMPLATE_RESULT (member_function);
18006 /* There should not be any class definitions in progress at this
18007 point; the bodies of members are only parsed outside of all class
18009 gcc_assert (parser->num_classes_being_defined == 0);
18010 /* While we're parsing the member functions we might encounter more
18011 classes. We want to handle them right away, but we don't want
18012 them getting mixed up with functions that are currently in the
18014 parser->unparsed_functions_queues
18015 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
18017 /* Make sure that any template parameters are in scope. */
18018 maybe_begin_member_template_processing (member_function);
18020 /* If the body of the function has not yet been parsed, parse it
18022 if (DECL_PENDING_INLINE_P (member_function))
18024 tree function_scope;
18025 cp_token_cache *tokens;
18027 /* The function is no longer pending; we are processing it. */
18028 tokens = DECL_PENDING_INLINE_INFO (member_function);
18029 DECL_PENDING_INLINE_INFO (member_function) = NULL;
18030 DECL_PENDING_INLINE_P (member_function) = 0;
18032 /* If this is a local class, enter the scope of the containing
18034 function_scope = current_function_decl;
18035 if (function_scope)
18036 push_function_context ();
18038 /* Push the body of the function onto the lexer stack. */
18039 cp_parser_push_lexer_for_tokens (parser, tokens);
18041 /* Let the front end know that we going to be defining this
18043 start_preparsed_function (member_function, NULL_TREE,
18044 SF_PRE_PARSED | SF_INCLASS_INLINE);
18046 /* Don't do access checking if it is a templated function. */
18047 if (processing_template_decl)
18048 push_deferring_access_checks (dk_no_check);
18050 /* Now, parse the body of the function. */
18051 cp_parser_function_definition_after_declarator (parser,
18052 /*inline_p=*/true);
18054 if (processing_template_decl)
18055 pop_deferring_access_checks ();
18057 /* Leave the scope of the containing function. */
18058 if (function_scope)
18059 pop_function_context ();
18060 cp_parser_pop_lexer (parser);
18063 /* Remove any template parameters from the symbol table. */
18064 maybe_end_member_template_processing ();
18066 /* Restore the queue. */
18067 parser->unparsed_functions_queues
18068 = TREE_CHAIN (parser->unparsed_functions_queues);
18071 /* If DECL contains any default args, remember it on the unparsed
18072 functions queue. */
18075 cp_parser_save_default_args (cp_parser* parser, tree decl)
18079 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
18081 probe = TREE_CHAIN (probe))
18082 if (TREE_PURPOSE (probe))
18084 TREE_PURPOSE (parser->unparsed_functions_queues)
18085 = tree_cons (current_class_type, decl,
18086 TREE_PURPOSE (parser->unparsed_functions_queues));
18091 /* FN is a FUNCTION_DECL which may contains a parameter with an
18092 unparsed DEFAULT_ARG. Parse the default args now. This function
18093 assumes that the current scope is the scope in which the default
18094 argument should be processed. */
18097 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
18099 bool saved_local_variables_forbidden_p;
18102 /* While we're parsing the default args, we might (due to the
18103 statement expression extension) encounter more classes. We want
18104 to handle them right away, but we don't want them getting mixed
18105 up with default args that are currently in the queue. */
18106 parser->unparsed_functions_queues
18107 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
18109 /* Local variable names (and the `this' keyword) may not appear
18110 in a default argument. */
18111 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
18112 parser->local_variables_forbidden_p = true;
18114 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
18116 parm = TREE_CHAIN (parm))
18118 cp_token_cache *tokens;
18119 tree default_arg = TREE_PURPOSE (parm);
18121 VEC(tree,gc) *insts;
18128 if (TREE_CODE (default_arg) != DEFAULT_ARG)
18129 /* This can happen for a friend declaration for a function
18130 already declared with default arguments. */
18133 /* Push the saved tokens for the default argument onto the parser's
18135 tokens = DEFARG_TOKENS (default_arg);
18136 cp_parser_push_lexer_for_tokens (parser, tokens);
18138 /* Parse the assignment-expression. */
18139 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false);
18141 if (!processing_template_decl)
18142 parsed_arg = check_default_argument (TREE_VALUE (parm), parsed_arg);
18144 TREE_PURPOSE (parm) = parsed_arg;
18146 /* Update any instantiations we've already created. */
18147 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
18148 VEC_iterate (tree, insts, ix, copy); ix++)
18149 TREE_PURPOSE (copy) = parsed_arg;
18151 /* If the token stream has not been completely used up, then
18152 there was extra junk after the end of the default
18154 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
18155 cp_parser_error (parser, "expected %<,%>");
18157 /* Revert to the main lexer. */
18158 cp_parser_pop_lexer (parser);
18161 /* Make sure no default arg is missing. */
18162 check_default_args (fn);
18164 /* Restore the state of local_variables_forbidden_p. */
18165 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
18167 /* Restore the queue. */
18168 parser->unparsed_functions_queues
18169 = TREE_CHAIN (parser->unparsed_functions_queues);
18172 /* Parse the operand of `sizeof' (or a similar operator). Returns
18173 either a TYPE or an expression, depending on the form of the
18174 input. The KEYWORD indicates which kind of expression we have
18178 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
18180 tree expr = NULL_TREE;
18181 const char *saved_message;
18183 bool saved_integral_constant_expression_p;
18184 bool saved_non_integral_constant_expression_p;
18185 bool pack_expansion_p = false;
18187 /* Types cannot be defined in a `sizeof' expression. Save away the
18189 saved_message = parser->type_definition_forbidden_message;
18190 /* And create the new one. */
18191 tmp = concat ("types may not be defined in %<",
18192 IDENTIFIER_POINTER (ridpointers[keyword]),
18193 "%> expressions", NULL);
18194 parser->type_definition_forbidden_message = tmp;
18196 /* The restrictions on constant-expressions do not apply inside
18197 sizeof expressions. */
18198 saved_integral_constant_expression_p
18199 = parser->integral_constant_expression_p;
18200 saved_non_integral_constant_expression_p
18201 = parser->non_integral_constant_expression_p;
18202 parser->integral_constant_expression_p = false;
18204 /* If it's a `...', then we are computing the length of a parameter
18206 if (keyword == RID_SIZEOF
18207 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
18209 /* Consume the `...'. */
18210 cp_lexer_consume_token (parser->lexer);
18211 maybe_warn_variadic_templates ();
18213 /* Note that this is an expansion. */
18214 pack_expansion_p = true;
18217 /* Do not actually evaluate the expression. */
18219 /* If it's a `(', then we might be looking at the type-id
18221 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
18224 bool saved_in_type_id_in_expr_p;
18226 /* We can't be sure yet whether we're looking at a type-id or an
18228 cp_parser_parse_tentatively (parser);
18229 /* Consume the `('. */
18230 cp_lexer_consume_token (parser->lexer);
18231 /* Parse the type-id. */
18232 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
18233 parser->in_type_id_in_expr_p = true;
18234 type = cp_parser_type_id (parser);
18235 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
18236 /* Now, look for the trailing `)'. */
18237 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
18238 /* If all went well, then we're done. */
18239 if (cp_parser_parse_definitely (parser))
18241 cp_decl_specifier_seq decl_specs;
18243 /* Build a trivial decl-specifier-seq. */
18244 clear_decl_specs (&decl_specs);
18245 decl_specs.type = type;
18247 /* Call grokdeclarator to figure out what type this is. */
18248 expr = grokdeclarator (NULL,
18252 /*attrlist=*/NULL);
18256 /* If the type-id production did not work out, then we must be
18257 looking at the unary-expression production. */
18259 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
18262 if (pack_expansion_p)
18263 /* Build a pack expansion. */
18264 expr = make_pack_expansion (expr);
18266 /* Go back to evaluating expressions. */
18269 /* Free the message we created. */
18271 /* And restore the old one. */
18272 parser->type_definition_forbidden_message = saved_message;
18273 parser->integral_constant_expression_p
18274 = saved_integral_constant_expression_p;
18275 parser->non_integral_constant_expression_p
18276 = saved_non_integral_constant_expression_p;
18281 /* If the current declaration has no declarator, return true. */
18284 cp_parser_declares_only_class_p (cp_parser *parser)
18286 /* If the next token is a `;' or a `,' then there is no
18288 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
18289 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
18292 /* Update the DECL_SPECS to reflect the storage class indicated by
18296 cp_parser_set_storage_class (cp_parser *parser,
18297 cp_decl_specifier_seq *decl_specs,
18299 location_t location)
18301 cp_storage_class storage_class;
18303 if (parser->in_unbraced_linkage_specification_p)
18305 error ("%Hinvalid use of %qD in linkage specification",
18306 &location, ridpointers[keyword]);
18309 else if (decl_specs->storage_class != sc_none)
18311 decl_specs->conflicting_specifiers_p = true;
18315 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
18316 && decl_specs->specs[(int) ds_thread])
18318 error ("%H%<__thread%> before %qD", &location, ridpointers[keyword]);
18319 decl_specs->specs[(int) ds_thread] = 0;
18325 storage_class = sc_auto;
18328 storage_class = sc_register;
18331 storage_class = sc_static;
18334 storage_class = sc_extern;
18337 storage_class = sc_mutable;
18340 gcc_unreachable ();
18342 decl_specs->storage_class = storage_class;
18344 /* A storage class specifier cannot be applied alongside a typedef
18345 specifier. If there is a typedef specifier present then set
18346 conflicting_specifiers_p which will trigger an error later
18347 on in grokdeclarator. */
18348 if (decl_specs->specs[(int)ds_typedef])
18349 decl_specs->conflicting_specifiers_p = true;
18352 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
18353 is true, the type is a user-defined type; otherwise it is a
18354 built-in type specified by a keyword. */
18357 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
18359 location_t location,
18360 bool user_defined_p)
18362 decl_specs->any_specifiers_p = true;
18364 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
18365 (with, for example, in "typedef int wchar_t;") we remember that
18366 this is what happened. In system headers, we ignore these
18367 declarations so that G++ can work with system headers that are not
18369 if (decl_specs->specs[(int) ds_typedef]
18371 && (type_spec == boolean_type_node
18372 || type_spec == char16_type_node
18373 || type_spec == char32_type_node
18374 || type_spec == wchar_type_node)
18375 && (decl_specs->type
18376 || decl_specs->specs[(int) ds_long]
18377 || decl_specs->specs[(int) ds_short]
18378 || decl_specs->specs[(int) ds_unsigned]
18379 || decl_specs->specs[(int) ds_signed]))
18381 decl_specs->redefined_builtin_type = type_spec;
18382 if (!decl_specs->type)
18384 decl_specs->type = type_spec;
18385 decl_specs->user_defined_type_p = false;
18386 decl_specs->type_location = location;
18389 else if (decl_specs->type)
18390 decl_specs->multiple_types_p = true;
18393 decl_specs->type = type_spec;
18394 decl_specs->user_defined_type_p = user_defined_p;
18395 decl_specs->redefined_builtin_type = NULL_TREE;
18396 decl_specs->type_location = location;
18400 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
18401 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
18404 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
18406 return decl_specifiers->specs[(int) ds_friend] != 0;
18409 /* If the next token is of the indicated TYPE, consume it. Otherwise,
18410 issue an error message indicating that TOKEN_DESC was expected.
18412 Returns the token consumed, if the token had the appropriate type.
18413 Otherwise, returns NULL. */
18416 cp_parser_require (cp_parser* parser,
18417 enum cpp_ttype type,
18418 const char* token_desc)
18420 if (cp_lexer_next_token_is (parser->lexer, type))
18421 return cp_lexer_consume_token (parser->lexer);
18424 /* Output the MESSAGE -- unless we're parsing tentatively. */
18425 if (!cp_parser_simulate_error (parser))
18427 char *message = concat ("expected ", token_desc, NULL);
18428 cp_parser_error (parser, message);
18435 /* An error message is produced if the next token is not '>'.
18436 All further tokens are skipped until the desired token is
18437 found or '{', '}', ';' or an unbalanced ')' or ']'. */
18440 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
18442 /* Current level of '< ... >'. */
18443 unsigned level = 0;
18444 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
18445 unsigned nesting_depth = 0;
18447 /* Are we ready, yet? If not, issue error message. */
18448 if (cp_parser_require (parser, CPP_GREATER, "%<>%>"))
18451 /* Skip tokens until the desired token is found. */
18454 /* Peek at the next token. */
18455 switch (cp_lexer_peek_token (parser->lexer)->type)
18458 if (!nesting_depth)
18463 if (cxx_dialect == cxx98)
18464 /* C++0x views the `>>' operator as two `>' tokens, but
18467 else if (!nesting_depth && level-- == 0)
18469 /* We've hit a `>>' where the first `>' closes the
18470 template argument list, and the second `>' is
18471 spurious. Just consume the `>>' and stop; we've
18472 already produced at least one error. */
18473 cp_lexer_consume_token (parser->lexer);
18476 /* Fall through for C++0x, so we handle the second `>' in
18480 if (!nesting_depth && level-- == 0)
18482 /* We've reached the token we want, consume it and stop. */
18483 cp_lexer_consume_token (parser->lexer);
18488 case CPP_OPEN_PAREN:
18489 case CPP_OPEN_SQUARE:
18493 case CPP_CLOSE_PAREN:
18494 case CPP_CLOSE_SQUARE:
18495 if (nesting_depth-- == 0)
18500 case CPP_PRAGMA_EOL:
18501 case CPP_SEMICOLON:
18502 case CPP_OPEN_BRACE:
18503 case CPP_CLOSE_BRACE:
18504 /* The '>' was probably forgotten, don't look further. */
18511 /* Consume this token. */
18512 cp_lexer_consume_token (parser->lexer);
18516 /* If the next token is the indicated keyword, consume it. Otherwise,
18517 issue an error message indicating that TOKEN_DESC was expected.
18519 Returns the token consumed, if the token had the appropriate type.
18520 Otherwise, returns NULL. */
18523 cp_parser_require_keyword (cp_parser* parser,
18525 const char* token_desc)
18527 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
18529 if (token && token->keyword != keyword)
18531 dyn_string_t error_msg;
18533 /* Format the error message. */
18534 error_msg = dyn_string_new (0);
18535 dyn_string_append_cstr (error_msg, "expected ");
18536 dyn_string_append_cstr (error_msg, token_desc);
18537 cp_parser_error (parser, error_msg->s);
18538 dyn_string_delete (error_msg);
18545 /* Returns TRUE iff TOKEN is a token that can begin the body of a
18546 function-definition. */
18549 cp_parser_token_starts_function_definition_p (cp_token* token)
18551 return (/* An ordinary function-body begins with an `{'. */
18552 token->type == CPP_OPEN_BRACE
18553 /* A ctor-initializer begins with a `:'. */
18554 || token->type == CPP_COLON
18555 /* A function-try-block begins with `try'. */
18556 || token->keyword == RID_TRY
18557 /* The named return value extension begins with `return'. */
18558 || token->keyword == RID_RETURN);
18561 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
18565 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
18569 token = cp_lexer_peek_token (parser->lexer);
18570 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
18573 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
18574 C++0x) ending a template-argument. */
18577 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
18581 token = cp_lexer_peek_token (parser->lexer);
18582 return (token->type == CPP_COMMA
18583 || token->type == CPP_GREATER
18584 || token->type == CPP_ELLIPSIS
18585 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT));
18588 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
18589 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
18592 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
18597 token = cp_lexer_peek_nth_token (parser->lexer, n);
18598 if (token->type == CPP_LESS)
18600 /* Check for the sequence `<::' in the original code. It would be lexed as
18601 `[:', where `[' is a digraph, and there is no whitespace before
18603 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
18606 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
18607 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
18613 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
18614 or none_type otherwise. */
18616 static enum tag_types
18617 cp_parser_token_is_class_key (cp_token* token)
18619 switch (token->keyword)
18624 return record_type;
18633 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
18636 cp_parser_check_class_key (enum tag_types class_key, tree type)
18638 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
18639 permerror (input_location, "%qs tag used in naming %q#T",
18640 class_key == union_type ? "union"
18641 : class_key == record_type ? "struct" : "class",
18645 /* Issue an error message if DECL is redeclared with different
18646 access than its original declaration [class.access.spec/3].
18647 This applies to nested classes and nested class templates.
18651 cp_parser_check_access_in_redeclaration (tree decl, location_t location)
18653 if (!decl || !CLASS_TYPE_P (TREE_TYPE (decl)))
18656 if ((TREE_PRIVATE (decl)
18657 != (current_access_specifier == access_private_node))
18658 || (TREE_PROTECTED (decl)
18659 != (current_access_specifier == access_protected_node)))
18660 error ("%H%qD redeclared with different access", &location, decl);
18663 /* Look for the `template' keyword, as a syntactic disambiguator.
18664 Return TRUE iff it is present, in which case it will be
18668 cp_parser_optional_template_keyword (cp_parser *parser)
18670 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
18672 /* The `template' keyword can only be used within templates;
18673 outside templates the parser can always figure out what is a
18674 template and what is not. */
18675 if (!processing_template_decl)
18677 cp_token *token = cp_lexer_peek_token (parser->lexer);
18678 error ("%H%<template%> (as a disambiguator) is only allowed "
18679 "within templates", &token->location);
18680 /* If this part of the token stream is rescanned, the same
18681 error message would be generated. So, we purge the token
18682 from the stream. */
18683 cp_lexer_purge_token (parser->lexer);
18688 /* Consume the `template' keyword. */
18689 cp_lexer_consume_token (parser->lexer);
18697 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
18698 set PARSER->SCOPE, and perform other related actions. */
18701 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
18704 struct tree_check *check_value;
18705 deferred_access_check *chk;
18706 VEC (deferred_access_check,gc) *checks;
18708 /* Get the stored value. */
18709 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
18710 /* Perform any access checks that were deferred. */
18711 checks = check_value->checks;
18715 VEC_iterate (deferred_access_check, checks, i, chk) ;
18718 perform_or_defer_access_check (chk->binfo,
18723 /* Set the scope from the stored value. */
18724 parser->scope = check_value->value;
18725 parser->qualifying_scope = check_value->qualifying_scope;
18726 parser->object_scope = NULL_TREE;
18729 /* Consume tokens up through a non-nested END token. Returns TRUE if we
18730 encounter the end of a block before what we were looking for. */
18733 cp_parser_cache_group (cp_parser *parser,
18734 enum cpp_ttype end,
18739 cp_token *token = cp_lexer_peek_token (parser->lexer);
18741 /* Abort a parenthesized expression if we encounter a semicolon. */
18742 if ((end == CPP_CLOSE_PAREN || depth == 0)
18743 && token->type == CPP_SEMICOLON)
18745 /* If we've reached the end of the file, stop. */
18746 if (token->type == CPP_EOF
18747 || (end != CPP_PRAGMA_EOL
18748 && token->type == CPP_PRAGMA_EOL))
18750 if (token->type == CPP_CLOSE_BRACE && depth == 0)
18751 /* We've hit the end of an enclosing block, so there's been some
18752 kind of syntax error. */
18755 /* Consume the token. */
18756 cp_lexer_consume_token (parser->lexer);
18757 /* See if it starts a new group. */
18758 if (token->type == CPP_OPEN_BRACE)
18760 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
18761 /* In theory this should probably check end == '}', but
18762 cp_parser_save_member_function_body needs it to exit
18763 after either '}' or ')' when called with ')'. */
18767 else if (token->type == CPP_OPEN_PAREN)
18769 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
18770 if (depth == 0 && end == CPP_CLOSE_PAREN)
18773 else if (token->type == CPP_PRAGMA)
18774 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
18775 else if (token->type == end)
18780 /* Begin parsing tentatively. We always save tokens while parsing
18781 tentatively so that if the tentative parsing fails we can restore the
18785 cp_parser_parse_tentatively (cp_parser* parser)
18787 /* Enter a new parsing context. */
18788 parser->context = cp_parser_context_new (parser->context);
18789 /* Begin saving tokens. */
18790 cp_lexer_save_tokens (parser->lexer);
18791 /* In order to avoid repetitive access control error messages,
18792 access checks are queued up until we are no longer parsing
18794 push_deferring_access_checks (dk_deferred);
18797 /* Commit to the currently active tentative parse. */
18800 cp_parser_commit_to_tentative_parse (cp_parser* parser)
18802 cp_parser_context *context;
18805 /* Mark all of the levels as committed. */
18806 lexer = parser->lexer;
18807 for (context = parser->context; context->next; context = context->next)
18809 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
18811 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
18812 while (!cp_lexer_saving_tokens (lexer))
18813 lexer = lexer->next;
18814 cp_lexer_commit_tokens (lexer);
18818 /* Abort the currently active tentative parse. All consumed tokens
18819 will be rolled back, and no diagnostics will be issued. */
18822 cp_parser_abort_tentative_parse (cp_parser* parser)
18824 cp_parser_simulate_error (parser);
18825 /* Now, pretend that we want to see if the construct was
18826 successfully parsed. */
18827 cp_parser_parse_definitely (parser);
18830 /* Stop parsing tentatively. If a parse error has occurred, restore the
18831 token stream. Otherwise, commit to the tokens we have consumed.
18832 Returns true if no error occurred; false otherwise. */
18835 cp_parser_parse_definitely (cp_parser* parser)
18837 bool error_occurred;
18838 cp_parser_context *context;
18840 /* Remember whether or not an error occurred, since we are about to
18841 destroy that information. */
18842 error_occurred = cp_parser_error_occurred (parser);
18843 /* Remove the topmost context from the stack. */
18844 context = parser->context;
18845 parser->context = context->next;
18846 /* If no parse errors occurred, commit to the tentative parse. */
18847 if (!error_occurred)
18849 /* Commit to the tokens read tentatively, unless that was
18851 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
18852 cp_lexer_commit_tokens (parser->lexer);
18854 pop_to_parent_deferring_access_checks ();
18856 /* Otherwise, if errors occurred, roll back our state so that things
18857 are just as they were before we began the tentative parse. */
18860 cp_lexer_rollback_tokens (parser->lexer);
18861 pop_deferring_access_checks ();
18863 /* Add the context to the front of the free list. */
18864 context->next = cp_parser_context_free_list;
18865 cp_parser_context_free_list = context;
18867 return !error_occurred;
18870 /* Returns true if we are parsing tentatively and are not committed to
18871 this tentative parse. */
18874 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
18876 return (cp_parser_parsing_tentatively (parser)
18877 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
18880 /* Returns nonzero iff an error has occurred during the most recent
18881 tentative parse. */
18884 cp_parser_error_occurred (cp_parser* parser)
18886 return (cp_parser_parsing_tentatively (parser)
18887 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
18890 /* Returns nonzero if GNU extensions are allowed. */
18893 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
18895 return parser->allow_gnu_extensions_p;
18898 /* Objective-C++ Productions */
18901 /* Parse an Objective-C expression, which feeds into a primary-expression
18905 objc-message-expression
18906 objc-string-literal
18907 objc-encode-expression
18908 objc-protocol-expression
18909 objc-selector-expression
18911 Returns a tree representation of the expression. */
18914 cp_parser_objc_expression (cp_parser* parser)
18916 /* Try to figure out what kind of declaration is present. */
18917 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
18921 case CPP_OPEN_SQUARE:
18922 return cp_parser_objc_message_expression (parser);
18924 case CPP_OBJC_STRING:
18925 kwd = cp_lexer_consume_token (parser->lexer);
18926 return objc_build_string_object (kwd->u.value);
18929 switch (kwd->keyword)
18931 case RID_AT_ENCODE:
18932 return cp_parser_objc_encode_expression (parser);
18934 case RID_AT_PROTOCOL:
18935 return cp_parser_objc_protocol_expression (parser);
18937 case RID_AT_SELECTOR:
18938 return cp_parser_objc_selector_expression (parser);
18944 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
18945 &kwd->location, kwd->u.value);
18946 cp_parser_skip_to_end_of_block_or_statement (parser);
18949 return error_mark_node;
18952 /* Parse an Objective-C message expression.
18954 objc-message-expression:
18955 [ objc-message-receiver objc-message-args ]
18957 Returns a representation of an Objective-C message. */
18960 cp_parser_objc_message_expression (cp_parser* parser)
18962 tree receiver, messageargs;
18964 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
18965 receiver = cp_parser_objc_message_receiver (parser);
18966 messageargs = cp_parser_objc_message_args (parser);
18967 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
18969 return objc_build_message_expr (build_tree_list (receiver, messageargs));
18972 /* Parse an objc-message-receiver.
18974 objc-message-receiver:
18976 simple-type-specifier
18978 Returns a representation of the type or expression. */
18981 cp_parser_objc_message_receiver (cp_parser* parser)
18985 /* An Objective-C message receiver may be either (1) a type
18986 or (2) an expression. */
18987 cp_parser_parse_tentatively (parser);
18988 rcv = cp_parser_expression (parser, false);
18990 if (cp_parser_parse_definitely (parser))
18993 rcv = cp_parser_simple_type_specifier (parser,
18994 /*decl_specs=*/NULL,
18995 CP_PARSER_FLAGS_NONE);
18997 return objc_get_class_reference (rcv);
19000 /* Parse the arguments and selectors comprising an Objective-C message.
19005 objc-selector-args , objc-comma-args
19007 objc-selector-args:
19008 objc-selector [opt] : assignment-expression
19009 objc-selector-args objc-selector [opt] : assignment-expression
19012 assignment-expression
19013 objc-comma-args , assignment-expression
19015 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
19016 selector arguments and TREE_VALUE containing a list of comma
19020 cp_parser_objc_message_args (cp_parser* parser)
19022 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
19023 bool maybe_unary_selector_p = true;
19024 cp_token *token = cp_lexer_peek_token (parser->lexer);
19026 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
19028 tree selector = NULL_TREE, arg;
19030 if (token->type != CPP_COLON)
19031 selector = cp_parser_objc_selector (parser);
19033 /* Detect if we have a unary selector. */
19034 if (maybe_unary_selector_p
19035 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
19036 return build_tree_list (selector, NULL_TREE);
19038 maybe_unary_selector_p = false;
19039 cp_parser_require (parser, CPP_COLON, "%<:%>");
19040 arg = cp_parser_assignment_expression (parser, false);
19043 = chainon (sel_args,
19044 build_tree_list (selector, arg));
19046 token = cp_lexer_peek_token (parser->lexer);
19049 /* Handle non-selector arguments, if any. */
19050 while (token->type == CPP_COMMA)
19054 cp_lexer_consume_token (parser->lexer);
19055 arg = cp_parser_assignment_expression (parser, false);
19058 = chainon (addl_args,
19059 build_tree_list (NULL_TREE, arg));
19061 token = cp_lexer_peek_token (parser->lexer);
19064 return build_tree_list (sel_args, addl_args);
19067 /* Parse an Objective-C encode expression.
19069 objc-encode-expression:
19070 @encode objc-typename
19072 Returns an encoded representation of the type argument. */
19075 cp_parser_objc_encode_expression (cp_parser* parser)
19080 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
19081 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19082 token = cp_lexer_peek_token (parser->lexer);
19083 type = complete_type (cp_parser_type_id (parser));
19084 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19088 error ("%H%<@encode%> must specify a type as an argument",
19090 return error_mark_node;
19093 return objc_build_encode_expr (type);
19096 /* Parse an Objective-C @defs expression. */
19099 cp_parser_objc_defs_expression (cp_parser *parser)
19103 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
19104 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19105 name = cp_parser_identifier (parser);
19106 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19108 return objc_get_class_ivars (name);
19111 /* Parse an Objective-C protocol expression.
19113 objc-protocol-expression:
19114 @protocol ( identifier )
19116 Returns a representation of the protocol expression. */
19119 cp_parser_objc_protocol_expression (cp_parser* parser)
19123 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
19124 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19125 proto = cp_parser_identifier (parser);
19126 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19128 return objc_build_protocol_expr (proto);
19131 /* Parse an Objective-C selector expression.
19133 objc-selector-expression:
19134 @selector ( objc-method-signature )
19136 objc-method-signature:
19142 objc-selector-seq objc-selector :
19144 Returns a representation of the method selector. */
19147 cp_parser_objc_selector_expression (cp_parser* parser)
19149 tree sel_seq = NULL_TREE;
19150 bool maybe_unary_selector_p = true;
19153 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
19154 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19155 token = cp_lexer_peek_token (parser->lexer);
19157 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
19158 || token->type == CPP_SCOPE)
19160 tree selector = NULL_TREE;
19162 if (token->type != CPP_COLON
19163 || token->type == CPP_SCOPE)
19164 selector = cp_parser_objc_selector (parser);
19166 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
19167 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
19169 /* Detect if we have a unary selector. */
19170 if (maybe_unary_selector_p)
19172 sel_seq = selector;
19173 goto finish_selector;
19177 cp_parser_error (parser, "expected %<:%>");
19180 maybe_unary_selector_p = false;
19181 token = cp_lexer_consume_token (parser->lexer);
19183 if (token->type == CPP_SCOPE)
19186 = chainon (sel_seq,
19187 build_tree_list (selector, NULL_TREE));
19189 = chainon (sel_seq,
19190 build_tree_list (NULL_TREE, NULL_TREE));
19194 = chainon (sel_seq,
19195 build_tree_list (selector, NULL_TREE));
19197 token = cp_lexer_peek_token (parser->lexer);
19201 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19203 return objc_build_selector_expr (sel_seq);
19206 /* Parse a list of identifiers.
19208 objc-identifier-list:
19210 objc-identifier-list , identifier
19212 Returns a TREE_LIST of identifier nodes. */
19215 cp_parser_objc_identifier_list (cp_parser* parser)
19217 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
19218 cp_token *sep = cp_lexer_peek_token (parser->lexer);
19220 while (sep->type == CPP_COMMA)
19222 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
19223 list = chainon (list,
19224 build_tree_list (NULL_TREE,
19225 cp_parser_identifier (parser)));
19226 sep = cp_lexer_peek_token (parser->lexer);
19232 /* Parse an Objective-C alias declaration.
19234 objc-alias-declaration:
19235 @compatibility_alias identifier identifier ;
19237 This function registers the alias mapping with the Objective-C front end.
19238 It returns nothing. */
19241 cp_parser_objc_alias_declaration (cp_parser* parser)
19245 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
19246 alias = cp_parser_identifier (parser);
19247 orig = cp_parser_identifier (parser);
19248 objc_declare_alias (alias, orig);
19249 cp_parser_consume_semicolon_at_end_of_statement (parser);
19252 /* Parse an Objective-C class forward-declaration.
19254 objc-class-declaration:
19255 @class objc-identifier-list ;
19257 The function registers the forward declarations with the Objective-C
19258 front end. It returns nothing. */
19261 cp_parser_objc_class_declaration (cp_parser* parser)
19263 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
19264 objc_declare_class (cp_parser_objc_identifier_list (parser));
19265 cp_parser_consume_semicolon_at_end_of_statement (parser);
19268 /* Parse a list of Objective-C protocol references.
19270 objc-protocol-refs-opt:
19271 objc-protocol-refs [opt]
19273 objc-protocol-refs:
19274 < objc-identifier-list >
19276 Returns a TREE_LIST of identifiers, if any. */
19279 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
19281 tree protorefs = NULL_TREE;
19283 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
19285 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
19286 protorefs = cp_parser_objc_identifier_list (parser);
19287 cp_parser_require (parser, CPP_GREATER, "%<>%>");
19293 /* Parse a Objective-C visibility specification. */
19296 cp_parser_objc_visibility_spec (cp_parser* parser)
19298 cp_token *vis = cp_lexer_peek_token (parser->lexer);
19300 switch (vis->keyword)
19302 case RID_AT_PRIVATE:
19303 objc_set_visibility (2);
19305 case RID_AT_PROTECTED:
19306 objc_set_visibility (0);
19308 case RID_AT_PUBLIC:
19309 objc_set_visibility (1);
19315 /* Eat '@private'/'@protected'/'@public'. */
19316 cp_lexer_consume_token (parser->lexer);
19319 /* Parse an Objective-C method type. */
19322 cp_parser_objc_method_type (cp_parser* parser)
19324 objc_set_method_type
19325 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
19330 /* Parse an Objective-C protocol qualifier. */
19333 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
19335 tree quals = NULL_TREE, node;
19336 cp_token *token = cp_lexer_peek_token (parser->lexer);
19338 node = token->u.value;
19340 while (node && TREE_CODE (node) == IDENTIFIER_NODE
19341 && (node == ridpointers [(int) RID_IN]
19342 || node == ridpointers [(int) RID_OUT]
19343 || node == ridpointers [(int) RID_INOUT]
19344 || node == ridpointers [(int) RID_BYCOPY]
19345 || node == ridpointers [(int) RID_BYREF]
19346 || node == ridpointers [(int) RID_ONEWAY]))
19348 quals = tree_cons (NULL_TREE, node, quals);
19349 cp_lexer_consume_token (parser->lexer);
19350 token = cp_lexer_peek_token (parser->lexer);
19351 node = token->u.value;
19357 /* Parse an Objective-C typename. */
19360 cp_parser_objc_typename (cp_parser* parser)
19362 tree type_name = NULL_TREE;
19364 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
19366 tree proto_quals, cp_type = NULL_TREE;
19368 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
19369 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
19371 /* An ObjC type name may consist of just protocol qualifiers, in which
19372 case the type shall default to 'id'. */
19373 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
19374 cp_type = cp_parser_type_id (parser);
19376 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19377 type_name = build_tree_list (proto_quals, cp_type);
19383 /* Check to see if TYPE refers to an Objective-C selector name. */
19386 cp_parser_objc_selector_p (enum cpp_ttype type)
19388 return (type == CPP_NAME || type == CPP_KEYWORD
19389 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
19390 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
19391 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
19392 || type == CPP_XOR || type == CPP_XOR_EQ);
19395 /* Parse an Objective-C selector. */
19398 cp_parser_objc_selector (cp_parser* parser)
19400 cp_token *token = cp_lexer_consume_token (parser->lexer);
19402 if (!cp_parser_objc_selector_p (token->type))
19404 error ("%Hinvalid Objective-C++ selector name", &token->location);
19405 return error_mark_node;
19408 /* C++ operator names are allowed to appear in ObjC selectors. */
19409 switch (token->type)
19411 case CPP_AND_AND: return get_identifier ("and");
19412 case CPP_AND_EQ: return get_identifier ("and_eq");
19413 case CPP_AND: return get_identifier ("bitand");
19414 case CPP_OR: return get_identifier ("bitor");
19415 case CPP_COMPL: return get_identifier ("compl");
19416 case CPP_NOT: return get_identifier ("not");
19417 case CPP_NOT_EQ: return get_identifier ("not_eq");
19418 case CPP_OR_OR: return get_identifier ("or");
19419 case CPP_OR_EQ: return get_identifier ("or_eq");
19420 case CPP_XOR: return get_identifier ("xor");
19421 case CPP_XOR_EQ: return get_identifier ("xor_eq");
19422 default: return token->u.value;
19426 /* Parse an Objective-C params list. */
19429 cp_parser_objc_method_keyword_params (cp_parser* parser)
19431 tree params = NULL_TREE;
19432 bool maybe_unary_selector_p = true;
19433 cp_token *token = cp_lexer_peek_token (parser->lexer);
19435 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
19437 tree selector = NULL_TREE, type_name, identifier;
19439 if (token->type != CPP_COLON)
19440 selector = cp_parser_objc_selector (parser);
19442 /* Detect if we have a unary selector. */
19443 if (maybe_unary_selector_p
19444 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
19447 maybe_unary_selector_p = false;
19448 cp_parser_require (parser, CPP_COLON, "%<:%>");
19449 type_name = cp_parser_objc_typename (parser);
19450 identifier = cp_parser_identifier (parser);
19454 objc_build_keyword_decl (selector,
19458 token = cp_lexer_peek_token (parser->lexer);
19464 /* Parse the non-keyword Objective-C params. */
19467 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
19469 tree params = make_node (TREE_LIST);
19470 cp_token *token = cp_lexer_peek_token (parser->lexer);
19471 *ellipsisp = false; /* Initially, assume no ellipsis. */
19473 while (token->type == CPP_COMMA)
19475 cp_parameter_declarator *parmdecl;
19478 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
19479 token = cp_lexer_peek_token (parser->lexer);
19481 if (token->type == CPP_ELLIPSIS)
19483 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
19488 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
19489 parm = grokdeclarator (parmdecl->declarator,
19490 &parmdecl->decl_specifiers,
19491 PARM, /*initialized=*/0,
19492 /*attrlist=*/NULL);
19494 chainon (params, build_tree_list (NULL_TREE, parm));
19495 token = cp_lexer_peek_token (parser->lexer);
19501 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
19504 cp_parser_objc_interstitial_code (cp_parser* parser)
19506 cp_token *token = cp_lexer_peek_token (parser->lexer);
19508 /* If the next token is `extern' and the following token is a string
19509 literal, then we have a linkage specification. */
19510 if (token->keyword == RID_EXTERN
19511 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
19512 cp_parser_linkage_specification (parser);
19513 /* Handle #pragma, if any. */
19514 else if (token->type == CPP_PRAGMA)
19515 cp_parser_pragma (parser, pragma_external);
19516 /* Allow stray semicolons. */
19517 else if (token->type == CPP_SEMICOLON)
19518 cp_lexer_consume_token (parser->lexer);
19519 /* Finally, try to parse a block-declaration, or a function-definition. */
19521 cp_parser_block_declaration (parser, /*statement_p=*/false);
19524 /* Parse a method signature. */
19527 cp_parser_objc_method_signature (cp_parser* parser)
19529 tree rettype, kwdparms, optparms;
19530 bool ellipsis = false;
19532 cp_parser_objc_method_type (parser);
19533 rettype = cp_parser_objc_typename (parser);
19534 kwdparms = cp_parser_objc_method_keyword_params (parser);
19535 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
19537 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
19540 /* Pars an Objective-C method prototype list. */
19543 cp_parser_objc_method_prototype_list (cp_parser* parser)
19545 cp_token *token = cp_lexer_peek_token (parser->lexer);
19547 while (token->keyword != RID_AT_END)
19549 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
19551 objc_add_method_declaration
19552 (cp_parser_objc_method_signature (parser));
19553 cp_parser_consume_semicolon_at_end_of_statement (parser);
19556 /* Allow for interspersed non-ObjC++ code. */
19557 cp_parser_objc_interstitial_code (parser);
19559 token = cp_lexer_peek_token (parser->lexer);
19562 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
19563 objc_finish_interface ();
19566 /* Parse an Objective-C method definition list. */
19569 cp_parser_objc_method_definition_list (cp_parser* parser)
19571 cp_token *token = cp_lexer_peek_token (parser->lexer);
19573 while (token->keyword != RID_AT_END)
19577 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
19579 push_deferring_access_checks (dk_deferred);
19580 objc_start_method_definition
19581 (cp_parser_objc_method_signature (parser));
19583 /* For historical reasons, we accept an optional semicolon. */
19584 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
19585 cp_lexer_consume_token (parser->lexer);
19587 perform_deferred_access_checks ();
19588 stop_deferring_access_checks ();
19589 meth = cp_parser_function_definition_after_declarator (parser,
19591 pop_deferring_access_checks ();
19592 objc_finish_method_definition (meth);
19595 /* Allow for interspersed non-ObjC++ code. */
19596 cp_parser_objc_interstitial_code (parser);
19598 token = cp_lexer_peek_token (parser->lexer);
19601 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
19602 objc_finish_implementation ();
19605 /* Parse Objective-C ivars. */
19608 cp_parser_objc_class_ivars (cp_parser* parser)
19610 cp_token *token = cp_lexer_peek_token (parser->lexer);
19612 if (token->type != CPP_OPEN_BRACE)
19613 return; /* No ivars specified. */
19615 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
19616 token = cp_lexer_peek_token (parser->lexer);
19618 while (token->type != CPP_CLOSE_BRACE)
19620 cp_decl_specifier_seq declspecs;
19621 int decl_class_or_enum_p;
19622 tree prefix_attributes;
19624 cp_parser_objc_visibility_spec (parser);
19626 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
19629 cp_parser_decl_specifier_seq (parser,
19630 CP_PARSER_FLAGS_OPTIONAL,
19632 &decl_class_or_enum_p);
19633 prefix_attributes = declspecs.attributes;
19634 declspecs.attributes = NULL_TREE;
19636 /* Keep going until we hit the `;' at the end of the
19638 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
19640 tree width = NULL_TREE, attributes, first_attribute, decl;
19641 cp_declarator *declarator = NULL;
19642 int ctor_dtor_or_conv_p;
19644 /* Check for a (possibly unnamed) bitfield declaration. */
19645 token = cp_lexer_peek_token (parser->lexer);
19646 if (token->type == CPP_COLON)
19649 if (token->type == CPP_NAME
19650 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
19653 /* Get the name of the bitfield. */
19654 declarator = make_id_declarator (NULL_TREE,
19655 cp_parser_identifier (parser),
19659 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
19660 /* Get the width of the bitfield. */
19662 = cp_parser_constant_expression (parser,
19663 /*allow_non_constant=*/false,
19668 /* Parse the declarator. */
19670 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
19671 &ctor_dtor_or_conv_p,
19672 /*parenthesized_p=*/NULL,
19673 /*member_p=*/false);
19676 /* Look for attributes that apply to the ivar. */
19677 attributes = cp_parser_attributes_opt (parser);
19678 /* Remember which attributes are prefix attributes and
19680 first_attribute = attributes;
19681 /* Combine the attributes. */
19682 attributes = chainon (prefix_attributes, attributes);
19685 /* Create the bitfield declaration. */
19686 decl = grokbitfield (declarator, &declspecs,
19690 decl = grokfield (declarator, &declspecs,
19691 NULL_TREE, /*init_const_expr_p=*/false,
19692 NULL_TREE, attributes);
19694 /* Add the instance variable. */
19695 objc_add_instance_variable (decl);
19697 /* Reset PREFIX_ATTRIBUTES. */
19698 while (attributes && TREE_CHAIN (attributes) != first_attribute)
19699 attributes = TREE_CHAIN (attributes);
19701 TREE_CHAIN (attributes) = NULL_TREE;
19703 token = cp_lexer_peek_token (parser->lexer);
19705 if (token->type == CPP_COMMA)
19707 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
19713 cp_parser_consume_semicolon_at_end_of_statement (parser);
19714 token = cp_lexer_peek_token (parser->lexer);
19717 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
19718 /* For historical reasons, we accept an optional semicolon. */
19719 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
19720 cp_lexer_consume_token (parser->lexer);
19723 /* Parse an Objective-C protocol declaration. */
19726 cp_parser_objc_protocol_declaration (cp_parser* parser)
19728 tree proto, protorefs;
19731 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
19732 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
19734 tok = cp_lexer_peek_token (parser->lexer);
19735 error ("%Hidentifier expected after %<@protocol%>", &tok->location);
19739 /* See if we have a forward declaration or a definition. */
19740 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
19742 /* Try a forward declaration first. */
19743 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
19745 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
19747 cp_parser_consume_semicolon_at_end_of_statement (parser);
19750 /* Ok, we got a full-fledged definition (or at least should). */
19753 proto = cp_parser_identifier (parser);
19754 protorefs = cp_parser_objc_protocol_refs_opt (parser);
19755 objc_start_protocol (proto, protorefs);
19756 cp_parser_objc_method_prototype_list (parser);
19760 /* Parse an Objective-C superclass or category. */
19763 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
19766 cp_token *next = cp_lexer_peek_token (parser->lexer);
19768 *super = *categ = NULL_TREE;
19769 if (next->type == CPP_COLON)
19771 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
19772 *super = cp_parser_identifier (parser);
19774 else if (next->type == CPP_OPEN_PAREN)
19776 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
19777 *categ = cp_parser_identifier (parser);
19778 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19782 /* Parse an Objective-C class interface. */
19785 cp_parser_objc_class_interface (cp_parser* parser)
19787 tree name, super, categ, protos;
19789 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
19790 name = cp_parser_identifier (parser);
19791 cp_parser_objc_superclass_or_category (parser, &super, &categ);
19792 protos = cp_parser_objc_protocol_refs_opt (parser);
19794 /* We have either a class or a category on our hands. */
19796 objc_start_category_interface (name, categ, protos);
19799 objc_start_class_interface (name, super, protos);
19800 /* Handle instance variable declarations, if any. */
19801 cp_parser_objc_class_ivars (parser);
19802 objc_continue_interface ();
19805 cp_parser_objc_method_prototype_list (parser);
19808 /* Parse an Objective-C class implementation. */
19811 cp_parser_objc_class_implementation (cp_parser* parser)
19813 tree name, super, categ;
19815 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
19816 name = cp_parser_identifier (parser);
19817 cp_parser_objc_superclass_or_category (parser, &super, &categ);
19819 /* We have either a class or a category on our hands. */
19821 objc_start_category_implementation (name, categ);
19824 objc_start_class_implementation (name, super);
19825 /* Handle instance variable declarations, if any. */
19826 cp_parser_objc_class_ivars (parser);
19827 objc_continue_implementation ();
19830 cp_parser_objc_method_definition_list (parser);
19833 /* Consume the @end token and finish off the implementation. */
19836 cp_parser_objc_end_implementation (cp_parser* parser)
19838 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
19839 objc_finish_implementation ();
19842 /* Parse an Objective-C declaration. */
19845 cp_parser_objc_declaration (cp_parser* parser)
19847 /* Try to figure out what kind of declaration is present. */
19848 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
19850 switch (kwd->keyword)
19853 cp_parser_objc_alias_declaration (parser);
19856 cp_parser_objc_class_declaration (parser);
19858 case RID_AT_PROTOCOL:
19859 cp_parser_objc_protocol_declaration (parser);
19861 case RID_AT_INTERFACE:
19862 cp_parser_objc_class_interface (parser);
19864 case RID_AT_IMPLEMENTATION:
19865 cp_parser_objc_class_implementation (parser);
19868 cp_parser_objc_end_implementation (parser);
19871 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
19872 &kwd->location, kwd->u.value);
19873 cp_parser_skip_to_end_of_block_or_statement (parser);
19877 /* Parse an Objective-C try-catch-finally statement.
19879 objc-try-catch-finally-stmt:
19880 @try compound-statement objc-catch-clause-seq [opt]
19881 objc-finally-clause [opt]
19883 objc-catch-clause-seq:
19884 objc-catch-clause objc-catch-clause-seq [opt]
19887 @catch ( exception-declaration ) compound-statement
19889 objc-finally-clause
19890 @finally compound-statement
19892 Returns NULL_TREE. */
19895 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
19896 location_t location;
19899 cp_parser_require_keyword (parser, RID_AT_TRY, "%<@try%>");
19900 location = cp_lexer_peek_token (parser->lexer)->location;
19901 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
19902 node, lest it get absorbed into the surrounding block. */
19903 stmt = push_stmt_list ();
19904 cp_parser_compound_statement (parser, NULL, false);
19905 objc_begin_try_stmt (location, pop_stmt_list (stmt));
19907 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
19909 cp_parameter_declarator *parmdecl;
19912 cp_lexer_consume_token (parser->lexer);
19913 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19914 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
19915 parm = grokdeclarator (parmdecl->declarator,
19916 &parmdecl->decl_specifiers,
19917 PARM, /*initialized=*/0,
19918 /*attrlist=*/NULL);
19919 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19920 objc_begin_catch_clause (parm);
19921 cp_parser_compound_statement (parser, NULL, false);
19922 objc_finish_catch_clause ();
19925 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
19927 cp_lexer_consume_token (parser->lexer);
19928 location = cp_lexer_peek_token (parser->lexer)->location;
19929 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
19930 node, lest it get absorbed into the surrounding block. */
19931 stmt = push_stmt_list ();
19932 cp_parser_compound_statement (parser, NULL, false);
19933 objc_build_finally_clause (location, pop_stmt_list (stmt));
19936 return objc_finish_try_stmt ();
19939 /* Parse an Objective-C synchronized statement.
19941 objc-synchronized-stmt:
19942 @synchronized ( expression ) compound-statement
19944 Returns NULL_TREE. */
19947 cp_parser_objc_synchronized_statement (cp_parser *parser) {
19948 location_t location;
19951 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "%<@synchronized%>");
19953 location = cp_lexer_peek_token (parser->lexer)->location;
19954 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19955 lock = cp_parser_expression (parser, false);
19956 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19958 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
19959 node, lest it get absorbed into the surrounding block. */
19960 stmt = push_stmt_list ();
19961 cp_parser_compound_statement (parser, NULL, false);
19963 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
19966 /* Parse an Objective-C throw statement.
19969 @throw assignment-expression [opt] ;
19971 Returns a constructed '@throw' statement. */
19974 cp_parser_objc_throw_statement (cp_parser *parser) {
19975 tree expr = NULL_TREE;
19977 cp_parser_require_keyword (parser, RID_AT_THROW, "%<@throw%>");
19979 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
19980 expr = cp_parser_assignment_expression (parser, false);
19982 cp_parser_consume_semicolon_at_end_of_statement (parser);
19984 return objc_build_throw_stmt (expr);
19987 /* Parse an Objective-C statement. */
19990 cp_parser_objc_statement (cp_parser * parser) {
19991 /* Try to figure out what kind of declaration is present. */
19992 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
19994 switch (kwd->keyword)
19997 return cp_parser_objc_try_catch_finally_statement (parser);
19998 case RID_AT_SYNCHRONIZED:
19999 return cp_parser_objc_synchronized_statement (parser);
20001 return cp_parser_objc_throw_statement (parser);
20003 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
20004 &kwd->location, kwd->u.value);
20005 cp_parser_skip_to_end_of_block_or_statement (parser);
20008 return error_mark_node;
20011 /* OpenMP 2.5 parsing routines. */
20013 /* Returns name of the next clause.
20014 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
20015 the token is not consumed. Otherwise appropriate pragma_omp_clause is
20016 returned and the token is consumed. */
20018 static pragma_omp_clause
20019 cp_parser_omp_clause_name (cp_parser *parser)
20021 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
20023 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
20024 result = PRAGMA_OMP_CLAUSE_IF;
20025 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
20026 result = PRAGMA_OMP_CLAUSE_DEFAULT;
20027 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
20028 result = PRAGMA_OMP_CLAUSE_PRIVATE;
20029 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
20031 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
20032 const char *p = IDENTIFIER_POINTER (id);
20037 if (!strcmp ("collapse", p))
20038 result = PRAGMA_OMP_CLAUSE_COLLAPSE;
20039 else if (!strcmp ("copyin", p))
20040 result = PRAGMA_OMP_CLAUSE_COPYIN;
20041 else if (!strcmp ("copyprivate", p))
20042 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
20045 if (!strcmp ("firstprivate", p))
20046 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
20049 if (!strcmp ("lastprivate", p))
20050 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
20053 if (!strcmp ("nowait", p))
20054 result = PRAGMA_OMP_CLAUSE_NOWAIT;
20055 else if (!strcmp ("num_threads", p))
20056 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
20059 if (!strcmp ("ordered", p))
20060 result = PRAGMA_OMP_CLAUSE_ORDERED;
20063 if (!strcmp ("reduction", p))
20064 result = PRAGMA_OMP_CLAUSE_REDUCTION;
20067 if (!strcmp ("schedule", p))
20068 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
20069 else if (!strcmp ("shared", p))
20070 result = PRAGMA_OMP_CLAUSE_SHARED;
20073 if (!strcmp ("untied", p))
20074 result = PRAGMA_OMP_CLAUSE_UNTIED;
20079 if (result != PRAGMA_OMP_CLAUSE_NONE)
20080 cp_lexer_consume_token (parser->lexer);
20085 /* Validate that a clause of the given type does not already exist. */
20088 check_no_duplicate_clause (tree clauses, enum omp_clause_code code,
20089 const char *name, location_t location)
20093 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
20094 if (OMP_CLAUSE_CODE (c) == code)
20096 error ("%Htoo many %qs clauses", &location, name);
20104 variable-list , identifier
20106 In addition, we match a closing parenthesis. An opening parenthesis
20107 will have been consumed by the caller.
20109 If KIND is nonzero, create the appropriate node and install the decl
20110 in OMP_CLAUSE_DECL and add the node to the head of the list.
20112 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
20113 return the list created. */
20116 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
20124 token = cp_lexer_peek_token (parser->lexer);
20125 name = cp_parser_id_expression (parser, /*template_p=*/false,
20126 /*check_dependency_p=*/true,
20127 /*template_p=*/NULL,
20128 /*declarator_p=*/false,
20129 /*optional_p=*/false);
20130 if (name == error_mark_node)
20133 decl = cp_parser_lookup_name_simple (parser, name, token->location);
20134 if (decl == error_mark_node)
20135 cp_parser_name_lookup_error (parser, name, decl, NULL, token->location);
20136 else if (kind != 0)
20138 tree u = build_omp_clause (kind);
20139 OMP_CLAUSE_DECL (u) = decl;
20140 OMP_CLAUSE_CHAIN (u) = list;
20144 list = tree_cons (decl, NULL_TREE, list);
20147 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
20149 cp_lexer_consume_token (parser->lexer);
20152 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20156 /* Try to resync to an unnested comma. Copied from
20157 cp_parser_parenthesized_expression_list. */
20159 ending = cp_parser_skip_to_closing_parenthesis (parser,
20160 /*recovering=*/true,
20162 /*consume_paren=*/true);
20170 /* Similarly, but expect leading and trailing parenthesis. This is a very
20171 common case for omp clauses. */
20174 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
20176 if (cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20177 return cp_parser_omp_var_list_no_open (parser, kind, list);
20182 collapse ( constant-expression ) */
20185 cp_parser_omp_clause_collapse (cp_parser *parser, tree list, location_t location)
20191 loc = cp_lexer_peek_token (parser->lexer)->location;
20192 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20195 num = cp_parser_constant_expression (parser, false, NULL);
20197 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20198 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20199 /*or_comma=*/false,
20200 /*consume_paren=*/true);
20202 if (num == error_mark_node)
20204 num = fold_non_dependent_expr (num);
20205 if (!INTEGRAL_TYPE_P (TREE_TYPE (num))
20206 || !host_integerp (num, 0)
20207 || (n = tree_low_cst (num, 0)) <= 0
20210 error ("%Hcollapse argument needs positive constant integer expression",
20215 check_no_duplicate_clause (list, OMP_CLAUSE_COLLAPSE, "collapse", location);
20216 c = build_omp_clause (OMP_CLAUSE_COLLAPSE);
20217 OMP_CLAUSE_CHAIN (c) = list;
20218 OMP_CLAUSE_COLLAPSE_EXPR (c) = num;
20224 default ( shared | none ) */
20227 cp_parser_omp_clause_default (cp_parser *parser, tree list, location_t location)
20229 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
20232 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20234 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
20236 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
20237 const char *p = IDENTIFIER_POINTER (id);
20242 if (strcmp ("none", p) != 0)
20244 kind = OMP_CLAUSE_DEFAULT_NONE;
20248 if (strcmp ("shared", p) != 0)
20250 kind = OMP_CLAUSE_DEFAULT_SHARED;
20257 cp_lexer_consume_token (parser->lexer);
20262 cp_parser_error (parser, "expected %<none%> or %<shared%>");
20265 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20266 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20267 /*or_comma=*/false,
20268 /*consume_paren=*/true);
20270 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
20273 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default", location);
20274 c = build_omp_clause (OMP_CLAUSE_DEFAULT);
20275 OMP_CLAUSE_CHAIN (c) = list;
20276 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
20282 if ( expression ) */
20285 cp_parser_omp_clause_if (cp_parser *parser, tree list, location_t location)
20289 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20292 t = cp_parser_condition (parser);
20294 if (t == error_mark_node
20295 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20296 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20297 /*or_comma=*/false,
20298 /*consume_paren=*/true);
20300 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if", location);
20302 c = build_omp_clause (OMP_CLAUSE_IF);
20303 OMP_CLAUSE_IF_EXPR (c) = t;
20304 OMP_CLAUSE_CHAIN (c) = list;
20313 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED,
20314 tree list, location_t location)
20318 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait", location);
20320 c = build_omp_clause (OMP_CLAUSE_NOWAIT);
20321 OMP_CLAUSE_CHAIN (c) = list;
20326 num_threads ( expression ) */
20329 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list,
20330 location_t location)
20334 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20337 t = cp_parser_expression (parser, false);
20339 if (t == error_mark_node
20340 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20341 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20342 /*or_comma=*/false,
20343 /*consume_paren=*/true);
20345 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS,
20346 "num_threads", location);
20348 c = build_omp_clause (OMP_CLAUSE_NUM_THREADS);
20349 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
20350 OMP_CLAUSE_CHAIN (c) = list;
20359 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED,
20360 tree list, location_t location)
20364 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED,
20365 "ordered", location);
20367 c = build_omp_clause (OMP_CLAUSE_ORDERED);
20368 OMP_CLAUSE_CHAIN (c) = list;
20373 reduction ( reduction-operator : variable-list )
20375 reduction-operator:
20376 One of: + * - & ^ | && || */
20379 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
20381 enum tree_code code;
20384 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20387 switch (cp_lexer_peek_token (parser->lexer)->type)
20399 code = BIT_AND_EXPR;
20402 code = BIT_XOR_EXPR;
20405 code = BIT_IOR_EXPR;
20408 code = TRUTH_ANDIF_EXPR;
20411 code = TRUTH_ORIF_EXPR;
20414 cp_parser_error (parser, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
20415 "%<|%>, %<&&%>, or %<||%>");
20417 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20418 /*or_comma=*/false,
20419 /*consume_paren=*/true);
20422 cp_lexer_consume_token (parser->lexer);
20424 if (!cp_parser_require (parser, CPP_COLON, "%<:%>"))
20427 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
20428 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
20429 OMP_CLAUSE_REDUCTION_CODE (c) = code;
20435 schedule ( schedule-kind )
20436 schedule ( schedule-kind , expression )
20439 static | dynamic | guided | runtime | auto */
20442 cp_parser_omp_clause_schedule (cp_parser *parser, tree list, location_t location)
20446 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20449 c = build_omp_clause (OMP_CLAUSE_SCHEDULE);
20451 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
20453 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
20454 const char *p = IDENTIFIER_POINTER (id);
20459 if (strcmp ("dynamic", p) != 0)
20461 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
20465 if (strcmp ("guided", p) != 0)
20467 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
20471 if (strcmp ("runtime", p) != 0)
20473 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
20480 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
20481 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
20482 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AUTO))
20483 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_AUTO;
20486 cp_lexer_consume_token (parser->lexer);
20488 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
20491 cp_lexer_consume_token (parser->lexer);
20493 token = cp_lexer_peek_token (parser->lexer);
20494 t = cp_parser_assignment_expression (parser, false);
20496 if (t == error_mark_node)
20498 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
20499 error ("%Hschedule %<runtime%> does not take "
20500 "a %<chunk_size%> parameter", &token->location);
20501 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_AUTO)
20502 error ("%Hschedule %<auto%> does not take "
20503 "a %<chunk_size%> parameter", &token->location);
20505 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
20507 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20510 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<,%> or %<)%>"))
20513 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule", location);
20514 OMP_CLAUSE_CHAIN (c) = list;
20518 cp_parser_error (parser, "invalid schedule kind");
20520 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20521 /*or_comma=*/false,
20522 /*consume_paren=*/true);
20530 cp_parser_omp_clause_untied (cp_parser *parser ATTRIBUTE_UNUSED,
20531 tree list, location_t location)
20535 check_no_duplicate_clause (list, OMP_CLAUSE_UNTIED, "untied", location);
20537 c = build_omp_clause (OMP_CLAUSE_UNTIED);
20538 OMP_CLAUSE_CHAIN (c) = list;
20542 /* Parse all OpenMP clauses. The set clauses allowed by the directive
20543 is a bitmask in MASK. Return the list of clauses found; the result
20544 of clause default goes in *pdefault. */
20547 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
20548 const char *where, cp_token *pragma_tok)
20550 tree clauses = NULL;
20552 cp_token *token = NULL;
20554 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
20556 pragma_omp_clause c_kind;
20557 const char *c_name;
20558 tree prev = clauses;
20560 if (!first && cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
20561 cp_lexer_consume_token (parser->lexer);
20563 token = cp_lexer_peek_token (parser->lexer);
20564 c_kind = cp_parser_omp_clause_name (parser);
20569 case PRAGMA_OMP_CLAUSE_COLLAPSE:
20570 clauses = cp_parser_omp_clause_collapse (parser, clauses,
20572 c_name = "collapse";
20574 case PRAGMA_OMP_CLAUSE_COPYIN:
20575 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
20578 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
20579 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
20581 c_name = "copyprivate";
20583 case PRAGMA_OMP_CLAUSE_DEFAULT:
20584 clauses = cp_parser_omp_clause_default (parser, clauses,
20586 c_name = "default";
20588 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
20589 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
20591 c_name = "firstprivate";
20593 case PRAGMA_OMP_CLAUSE_IF:
20594 clauses = cp_parser_omp_clause_if (parser, clauses, token->location);
20597 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
20598 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
20600 c_name = "lastprivate";
20602 case PRAGMA_OMP_CLAUSE_NOWAIT:
20603 clauses = cp_parser_omp_clause_nowait (parser, clauses, token->location);
20606 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
20607 clauses = cp_parser_omp_clause_num_threads (parser, clauses,
20609 c_name = "num_threads";
20611 case PRAGMA_OMP_CLAUSE_ORDERED:
20612 clauses = cp_parser_omp_clause_ordered (parser, clauses,
20614 c_name = "ordered";
20616 case PRAGMA_OMP_CLAUSE_PRIVATE:
20617 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
20619 c_name = "private";
20621 case PRAGMA_OMP_CLAUSE_REDUCTION:
20622 clauses = cp_parser_omp_clause_reduction (parser, clauses);
20623 c_name = "reduction";
20625 case PRAGMA_OMP_CLAUSE_SCHEDULE:
20626 clauses = cp_parser_omp_clause_schedule (parser, clauses,
20628 c_name = "schedule";
20630 case PRAGMA_OMP_CLAUSE_SHARED:
20631 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
20635 case PRAGMA_OMP_CLAUSE_UNTIED:
20636 clauses = cp_parser_omp_clause_untied (parser, clauses,
20641 cp_parser_error (parser, "expected %<#pragma omp%> clause");
20645 if (((mask >> c_kind) & 1) == 0)
20647 /* Remove the invalid clause(s) from the list to avoid
20648 confusing the rest of the compiler. */
20650 error ("%H%qs is not valid for %qs", &token->location, c_name, where);
20654 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
20655 return finish_omp_clauses (clauses);
20662 In practice, we're also interested in adding the statement to an
20663 outer node. So it is convenient if we work around the fact that
20664 cp_parser_statement calls add_stmt. */
20667 cp_parser_begin_omp_structured_block (cp_parser *parser)
20669 unsigned save = parser->in_statement;
20671 /* Only move the values to IN_OMP_BLOCK if they weren't false.
20672 This preserves the "not within loop or switch" style error messages
20673 for nonsense cases like
20679 if (parser->in_statement)
20680 parser->in_statement = IN_OMP_BLOCK;
20686 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
20688 parser->in_statement = save;
20692 cp_parser_omp_structured_block (cp_parser *parser)
20694 tree stmt = begin_omp_structured_block ();
20695 unsigned int save = cp_parser_begin_omp_structured_block (parser);
20697 cp_parser_statement (parser, NULL_TREE, false, NULL);
20699 cp_parser_end_omp_structured_block (parser, save);
20700 return finish_omp_structured_block (stmt);
20704 # pragma omp atomic new-line
20708 x binop= expr | x++ | ++x | x-- | --x
20710 +, *, -, /, &, ^, |, <<, >>
20712 where x is an lvalue expression with scalar type. */
20715 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
20718 enum tree_code code;
20720 cp_parser_require_pragma_eol (parser, pragma_tok);
20722 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
20724 switch (TREE_CODE (lhs))
20729 case PREINCREMENT_EXPR:
20730 case POSTINCREMENT_EXPR:
20731 lhs = TREE_OPERAND (lhs, 0);
20733 rhs = integer_one_node;
20736 case PREDECREMENT_EXPR:
20737 case POSTDECREMENT_EXPR:
20738 lhs = TREE_OPERAND (lhs, 0);
20740 rhs = integer_one_node;
20744 switch (cp_lexer_peek_token (parser->lexer)->type)
20750 code = TRUNC_DIV_EXPR;
20758 case CPP_LSHIFT_EQ:
20759 code = LSHIFT_EXPR;
20761 case CPP_RSHIFT_EQ:
20762 code = RSHIFT_EXPR;
20765 code = BIT_AND_EXPR;
20768 code = BIT_IOR_EXPR;
20771 code = BIT_XOR_EXPR;
20774 cp_parser_error (parser,
20775 "invalid operator for %<#pragma omp atomic%>");
20778 cp_lexer_consume_token (parser->lexer);
20780 rhs = cp_parser_expression (parser, false);
20781 if (rhs == error_mark_node)
20785 finish_omp_atomic (code, lhs, rhs);
20786 cp_parser_consume_semicolon_at_end_of_statement (parser);
20790 cp_parser_skip_to_end_of_block_or_statement (parser);
20795 # pragma omp barrier new-line */
20798 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
20800 cp_parser_require_pragma_eol (parser, pragma_tok);
20801 finish_omp_barrier ();
20805 # pragma omp critical [(name)] new-line
20806 structured-block */
20809 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
20811 tree stmt, name = NULL;
20813 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
20815 cp_lexer_consume_token (parser->lexer);
20817 name = cp_parser_identifier (parser);
20819 if (name == error_mark_node
20820 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20821 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20822 /*or_comma=*/false,
20823 /*consume_paren=*/true);
20824 if (name == error_mark_node)
20827 cp_parser_require_pragma_eol (parser, pragma_tok);
20829 stmt = cp_parser_omp_structured_block (parser);
20830 return c_finish_omp_critical (stmt, name);
20834 # pragma omp flush flush-vars[opt] new-line
20837 ( variable-list ) */
20840 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
20842 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
20843 (void) cp_parser_omp_var_list (parser, 0, NULL);
20844 cp_parser_require_pragma_eol (parser, pragma_tok);
20846 finish_omp_flush ();
20849 /* Helper function, to parse omp for increment expression. */
20852 cp_parser_omp_for_cond (cp_parser *parser, tree decl)
20854 tree lhs = cp_parser_cast_expression (parser, false, false), rhs;
20860 cp_parser_skip_to_end_of_statement (parser);
20861 return error_mark_node;
20864 token = cp_lexer_peek_token (parser->lexer);
20865 op = binops_by_token [token->type].tree_type;
20874 cp_parser_skip_to_end_of_statement (parser);
20875 return error_mark_node;
20878 cp_lexer_consume_token (parser->lexer);
20879 rhs = cp_parser_binary_expression (parser, false,
20880 PREC_RELATIONAL_EXPRESSION);
20881 if (rhs == error_mark_node
20882 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
20884 cp_parser_skip_to_end_of_statement (parser);
20885 return error_mark_node;
20888 return build2 (op, boolean_type_node, lhs, rhs);
20891 /* Helper function, to parse omp for increment expression. */
20894 cp_parser_omp_for_incr (cp_parser *parser, tree decl)
20896 cp_token *token = cp_lexer_peek_token (parser->lexer);
20902 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
20904 op = (token->type == CPP_PLUS_PLUS
20905 ? PREINCREMENT_EXPR : PREDECREMENT_EXPR);
20906 cp_lexer_consume_token (parser->lexer);
20907 lhs = cp_parser_cast_expression (parser, false, false);
20909 return error_mark_node;
20910 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
20913 lhs = cp_parser_primary_expression (parser, false, false, false, &idk);
20915 return error_mark_node;
20917 token = cp_lexer_peek_token (parser->lexer);
20918 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
20920 op = (token->type == CPP_PLUS_PLUS
20921 ? POSTINCREMENT_EXPR : POSTDECREMENT_EXPR);
20922 cp_lexer_consume_token (parser->lexer);
20923 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
20926 op = cp_parser_assignment_operator_opt (parser);
20927 if (op == ERROR_MARK)
20928 return error_mark_node;
20930 if (op != NOP_EXPR)
20932 rhs = cp_parser_assignment_expression (parser, false);
20933 rhs = build2 (op, TREE_TYPE (decl), decl, rhs);
20934 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
20937 lhs = cp_parser_binary_expression (parser, false,
20938 PREC_ADDITIVE_EXPRESSION);
20939 token = cp_lexer_peek_token (parser->lexer);
20940 decl_first = lhs == decl;
20943 if (token->type != CPP_PLUS
20944 && token->type != CPP_MINUS)
20945 return error_mark_node;
20949 op = token->type == CPP_PLUS ? PLUS_EXPR : MINUS_EXPR;
20950 cp_lexer_consume_token (parser->lexer);
20951 rhs = cp_parser_binary_expression (parser, false,
20952 PREC_ADDITIVE_EXPRESSION);
20953 token = cp_lexer_peek_token (parser->lexer);
20954 if (token->type == CPP_PLUS || token->type == CPP_MINUS || decl_first)
20956 if (lhs == NULL_TREE)
20958 if (op == PLUS_EXPR)
20961 lhs = build_x_unary_op (NEGATE_EXPR, rhs, tf_warning_or_error);
20964 lhs = build_x_binary_op (op, lhs, ERROR_MARK, rhs, ERROR_MARK,
20965 NULL, tf_warning_or_error);
20968 while (token->type == CPP_PLUS || token->type == CPP_MINUS);
20972 if (rhs != decl || op == MINUS_EXPR)
20973 return error_mark_node;
20974 rhs = build2 (op, TREE_TYPE (decl), lhs, decl);
20977 rhs = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, lhs);
20979 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
20982 /* Parse the restricted form of the for statement allowed by OpenMP. */
20985 cp_parser_omp_for_loop (cp_parser *parser, tree clauses, tree *par_clauses)
20987 tree init, cond, incr, body, decl, pre_body = NULL_TREE, ret;
20988 tree for_block = NULL_TREE, real_decl, initv, condv, incrv, declv;
20989 tree this_pre_body, cl;
20990 location_t loc_first;
20991 bool collapse_err = false;
20992 int i, collapse = 1, nbraces = 0;
20994 for (cl = clauses; cl; cl = OMP_CLAUSE_CHAIN (cl))
20995 if (OMP_CLAUSE_CODE (cl) == OMP_CLAUSE_COLLAPSE)
20996 collapse = tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl), 0);
20998 gcc_assert (collapse >= 1);
21000 declv = make_tree_vec (collapse);
21001 initv = make_tree_vec (collapse);
21002 condv = make_tree_vec (collapse);
21003 incrv = make_tree_vec (collapse);
21005 loc_first = cp_lexer_peek_token (parser->lexer)->location;
21007 for (i = 0; i < collapse; i++)
21009 int bracecount = 0;
21010 bool add_private_clause = false;
21013 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
21015 cp_parser_error (parser, "for statement expected");
21018 loc = cp_lexer_consume_token (parser->lexer)->location;
21020 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
21023 init = decl = real_decl = NULL;
21024 this_pre_body = push_stmt_list ();
21025 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
21027 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
21031 integer-type var = lb
21032 random-access-iterator-type var = lb
21033 pointer-type var = lb
21035 cp_decl_specifier_seq type_specifiers;
21037 /* First, try to parse as an initialized declaration. See
21038 cp_parser_condition, from whence the bulk of this is copied. */
21040 cp_parser_parse_tentatively (parser);
21041 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
21043 if (cp_parser_parse_definitely (parser))
21045 /* If parsing a type specifier seq succeeded, then this
21046 MUST be a initialized declaration. */
21047 tree asm_specification, attributes;
21048 cp_declarator *declarator;
21050 declarator = cp_parser_declarator (parser,
21051 CP_PARSER_DECLARATOR_NAMED,
21052 /*ctor_dtor_or_conv_p=*/NULL,
21053 /*parenthesized_p=*/NULL,
21054 /*member_p=*/false);
21055 attributes = cp_parser_attributes_opt (parser);
21056 asm_specification = cp_parser_asm_specification_opt (parser);
21058 if (declarator == cp_error_declarator)
21059 cp_parser_skip_to_end_of_statement (parser);
21065 decl = start_decl (declarator, &type_specifiers,
21066 /*initialized_p=*/false, attributes,
21067 /*prefix_attributes=*/NULL_TREE,
21070 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
21072 if (cp_lexer_next_token_is (parser->lexer,
21074 error ("parenthesized initialization is not allowed in "
21075 "OpenMP %<for%> loop");
21077 /* Trigger an error. */
21078 cp_parser_require (parser, CPP_EQ, "%<=%>");
21080 init = error_mark_node;
21081 cp_parser_skip_to_end_of_statement (parser);
21083 else if (CLASS_TYPE_P (TREE_TYPE (decl))
21084 || type_dependent_expression_p (decl))
21086 bool is_direct_init, is_non_constant_init;
21088 init = cp_parser_initializer (parser,
21090 &is_non_constant_init);
21092 cp_finish_decl (decl, init, !is_non_constant_init,
21094 LOOKUP_ONLYCONVERTING);
21095 if (CLASS_TYPE_P (TREE_TYPE (decl)))
21098 = tree_cons (NULL, this_pre_body, for_block);
21102 init = pop_stmt_list (this_pre_body);
21103 this_pre_body = NULL_TREE;
21108 cp_lexer_consume_token (parser->lexer);
21109 init = cp_parser_assignment_expression (parser, false);
21111 if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
21112 init = error_mark_node;
21114 cp_finish_decl (decl, NULL_TREE,
21115 /*init_const_expr_p=*/false,
21117 LOOKUP_ONLYCONVERTING);
21121 pop_scope (pushed_scope);
21127 /* If parsing a type specifier sequence failed, then
21128 this MUST be a simple expression. */
21129 cp_parser_parse_tentatively (parser);
21130 decl = cp_parser_primary_expression (parser, false, false,
21132 if (!cp_parser_error_occurred (parser)
21135 && CLASS_TYPE_P (TREE_TYPE (decl)))
21139 cp_parser_parse_definitely (parser);
21140 cp_parser_require (parser, CPP_EQ, "%<=%>");
21141 rhs = cp_parser_assignment_expression (parser, false);
21142 finish_expr_stmt (build_x_modify_expr (decl, NOP_EXPR,
21144 tf_warning_or_error));
21145 add_private_clause = true;
21150 cp_parser_abort_tentative_parse (parser);
21151 init = cp_parser_expression (parser, false);
21154 if (TREE_CODE (init) == MODIFY_EXPR
21155 || TREE_CODE (init) == MODOP_EXPR)
21156 real_decl = TREE_OPERAND (init, 0);
21161 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
21164 this_pre_body = pop_stmt_list (this_pre_body);
21168 pre_body = push_stmt_list ();
21170 add_stmt (this_pre_body);
21171 pre_body = pop_stmt_list (pre_body);
21174 pre_body = this_pre_body;
21179 if (par_clauses != NULL && real_decl != NULL_TREE)
21182 for (c = par_clauses; *c ; )
21183 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_FIRSTPRIVATE
21184 && OMP_CLAUSE_DECL (*c) == real_decl)
21186 error ("%Hiteration variable %qD should not be firstprivate",
21188 *c = OMP_CLAUSE_CHAIN (*c);
21190 else if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_LASTPRIVATE
21191 && OMP_CLAUSE_DECL (*c) == real_decl)
21193 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
21194 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
21195 tree l = build_omp_clause (OMP_CLAUSE_LASTPRIVATE);
21196 OMP_CLAUSE_DECL (l) = real_decl;
21197 OMP_CLAUSE_CHAIN (l) = clauses;
21198 CP_OMP_CLAUSE_INFO (l) = CP_OMP_CLAUSE_INFO (*c);
21200 OMP_CLAUSE_SET_CODE (*c, OMP_CLAUSE_SHARED);
21201 CP_OMP_CLAUSE_INFO (*c) = NULL;
21202 add_private_clause = false;
21206 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_PRIVATE
21207 && OMP_CLAUSE_DECL (*c) == real_decl)
21208 add_private_clause = false;
21209 c = &OMP_CLAUSE_CHAIN (*c);
21213 if (add_private_clause)
21216 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
21218 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE
21219 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE)
21220 && OMP_CLAUSE_DECL (c) == decl)
21222 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
21223 && OMP_CLAUSE_DECL (c) == decl)
21224 error ("%Hiteration variable %qD should not be firstprivate",
21226 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
21227 && OMP_CLAUSE_DECL (c) == decl)
21228 error ("%Hiteration variable %qD should not be reduction",
21233 c = build_omp_clause (OMP_CLAUSE_PRIVATE);
21234 OMP_CLAUSE_DECL (c) = decl;
21235 c = finish_omp_clauses (c);
21238 OMP_CLAUSE_CHAIN (c) = clauses;
21245 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
21247 /* If decl is an iterator, preserve LHS and RHS of the relational
21248 expr until finish_omp_for. */
21250 && (type_dependent_expression_p (decl)
21251 || CLASS_TYPE_P (TREE_TYPE (decl))))
21252 cond = cp_parser_omp_for_cond (parser, decl);
21254 cond = cp_parser_condition (parser);
21256 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
21259 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
21261 /* If decl is an iterator, preserve the operator on decl
21262 until finish_omp_for. */
21264 && (type_dependent_expression_p (decl)
21265 || CLASS_TYPE_P (TREE_TYPE (decl))))
21266 incr = cp_parser_omp_for_incr (parser, decl);
21268 incr = cp_parser_expression (parser, false);
21271 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
21272 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
21273 /*or_comma=*/false,
21274 /*consume_paren=*/true);
21276 TREE_VEC_ELT (declv, i) = decl;
21277 TREE_VEC_ELT (initv, i) = init;
21278 TREE_VEC_ELT (condv, i) = cond;
21279 TREE_VEC_ELT (incrv, i) = incr;
21281 if (i == collapse - 1)
21284 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
21285 in between the collapsed for loops to be still considered perfectly
21286 nested. Hopefully the final version clarifies this.
21287 For now handle (multiple) {'s and empty statements. */
21288 cp_parser_parse_tentatively (parser);
21291 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
21293 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
21295 cp_lexer_consume_token (parser->lexer);
21298 else if (bracecount
21299 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
21300 cp_lexer_consume_token (parser->lexer);
21303 loc = cp_lexer_peek_token (parser->lexer)->location;
21304 error ("%Hnot enough collapsed for loops", &loc);
21305 collapse_err = true;
21306 cp_parser_abort_tentative_parse (parser);
21315 cp_parser_parse_definitely (parser);
21316 nbraces += bracecount;
21320 /* Note that we saved the original contents of this flag when we entered
21321 the structured block, and so we don't need to re-save it here. */
21322 parser->in_statement = IN_OMP_FOR;
21324 /* Note that the grammar doesn't call for a structured block here,
21325 though the loop as a whole is a structured block. */
21326 body = push_stmt_list ();
21327 cp_parser_statement (parser, NULL_TREE, false, NULL);
21328 body = pop_stmt_list (body);
21330 if (declv == NULL_TREE)
21333 ret = finish_omp_for (loc_first, declv, initv, condv, incrv, body,
21334 pre_body, clauses);
21338 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
21340 cp_lexer_consume_token (parser->lexer);
21343 else if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
21344 cp_lexer_consume_token (parser->lexer);
21349 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
21350 error ("%Hcollapsed loops not perfectly nested", &loc);
21352 collapse_err = true;
21353 cp_parser_statement_seq_opt (parser, NULL);
21354 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
21360 add_stmt (pop_stmt_list (TREE_VALUE (for_block)));
21361 for_block = TREE_CHAIN (for_block);
21368 #pragma omp for for-clause[optseq] new-line
21371 #define OMP_FOR_CLAUSE_MASK \
21372 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21373 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21374 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
21375 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21376 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
21377 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
21378 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
21379 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
21382 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
21384 tree clauses, sb, ret;
21387 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
21388 "#pragma omp for", pragma_tok);
21390 sb = begin_omp_structured_block ();
21391 save = cp_parser_begin_omp_structured_block (parser);
21393 ret = cp_parser_omp_for_loop (parser, clauses, NULL);
21395 cp_parser_end_omp_structured_block (parser, save);
21396 add_stmt (finish_omp_structured_block (sb));
21402 # pragma omp master new-line
21403 structured-block */
21406 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
21408 cp_parser_require_pragma_eol (parser, pragma_tok);
21409 return c_finish_omp_master (cp_parser_omp_structured_block (parser));
21413 # pragma omp ordered new-line
21414 structured-block */
21417 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
21419 cp_parser_require_pragma_eol (parser, pragma_tok);
21420 return c_finish_omp_ordered (cp_parser_omp_structured_block (parser));
21426 { section-sequence }
21429 section-directive[opt] structured-block
21430 section-sequence section-directive structured-block */
21433 cp_parser_omp_sections_scope (cp_parser *parser)
21435 tree stmt, substmt;
21436 bool error_suppress = false;
21439 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>"))
21442 stmt = push_stmt_list ();
21444 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
21448 substmt = begin_omp_structured_block ();
21449 save = cp_parser_begin_omp_structured_block (parser);
21453 cp_parser_statement (parser, NULL_TREE, false, NULL);
21455 tok = cp_lexer_peek_token (parser->lexer);
21456 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
21458 if (tok->type == CPP_CLOSE_BRACE)
21460 if (tok->type == CPP_EOF)
21464 cp_parser_end_omp_structured_block (parser, save);
21465 substmt = finish_omp_structured_block (substmt);
21466 substmt = build1 (OMP_SECTION, void_type_node, substmt);
21467 add_stmt (substmt);
21472 tok = cp_lexer_peek_token (parser->lexer);
21473 if (tok->type == CPP_CLOSE_BRACE)
21475 if (tok->type == CPP_EOF)
21478 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
21480 cp_lexer_consume_token (parser->lexer);
21481 cp_parser_require_pragma_eol (parser, tok);
21482 error_suppress = false;
21484 else if (!error_suppress)
21486 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
21487 error_suppress = true;
21490 substmt = cp_parser_omp_structured_block (parser);
21491 substmt = build1 (OMP_SECTION, void_type_node, substmt);
21492 add_stmt (substmt);
21494 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
21496 substmt = pop_stmt_list (stmt);
21498 stmt = make_node (OMP_SECTIONS);
21499 TREE_TYPE (stmt) = void_type_node;
21500 OMP_SECTIONS_BODY (stmt) = substmt;
21507 # pragma omp sections sections-clause[optseq] newline
21510 #define OMP_SECTIONS_CLAUSE_MASK \
21511 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21512 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21513 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
21514 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21515 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
21518 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
21522 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
21523 "#pragma omp sections", pragma_tok);
21525 ret = cp_parser_omp_sections_scope (parser);
21527 OMP_SECTIONS_CLAUSES (ret) = clauses;
21533 # pragma parallel parallel-clause new-line
21534 # pragma parallel for parallel-for-clause new-line
21535 # pragma parallel sections parallel-sections-clause new-line */
21537 #define OMP_PARALLEL_CLAUSE_MASK \
21538 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
21539 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21540 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21541 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
21542 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
21543 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
21544 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21545 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
21548 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
21550 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
21551 const char *p_name = "#pragma omp parallel";
21552 tree stmt, clauses, par_clause, ws_clause, block;
21553 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
21556 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
21558 cp_lexer_consume_token (parser->lexer);
21559 p_kind = PRAGMA_OMP_PARALLEL_FOR;
21560 p_name = "#pragma omp parallel for";
21561 mask |= OMP_FOR_CLAUSE_MASK;
21562 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
21564 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
21566 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
21567 const char *p = IDENTIFIER_POINTER (id);
21568 if (strcmp (p, "sections") == 0)
21570 cp_lexer_consume_token (parser->lexer);
21571 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
21572 p_name = "#pragma omp parallel sections";
21573 mask |= OMP_SECTIONS_CLAUSE_MASK;
21574 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
21578 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
21579 block = begin_omp_parallel ();
21580 save = cp_parser_begin_omp_structured_block (parser);
21584 case PRAGMA_OMP_PARALLEL:
21585 cp_parser_statement (parser, NULL_TREE, false, NULL);
21586 par_clause = clauses;
21589 case PRAGMA_OMP_PARALLEL_FOR:
21590 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
21591 cp_parser_omp_for_loop (parser, ws_clause, &par_clause);
21594 case PRAGMA_OMP_PARALLEL_SECTIONS:
21595 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
21596 stmt = cp_parser_omp_sections_scope (parser);
21598 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
21602 gcc_unreachable ();
21605 cp_parser_end_omp_structured_block (parser, save);
21606 stmt = finish_omp_parallel (par_clause, block);
21607 if (p_kind != PRAGMA_OMP_PARALLEL)
21608 OMP_PARALLEL_COMBINED (stmt) = 1;
21613 # pragma omp single single-clause[optseq] new-line
21614 structured-block */
21616 #define OMP_SINGLE_CLAUSE_MASK \
21617 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21618 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21619 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
21620 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
21623 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
21625 tree stmt = make_node (OMP_SINGLE);
21626 TREE_TYPE (stmt) = void_type_node;
21628 OMP_SINGLE_CLAUSES (stmt)
21629 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
21630 "#pragma omp single", pragma_tok);
21631 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
21633 return add_stmt (stmt);
21637 # pragma omp task task-clause[optseq] new-line
21638 structured-block */
21640 #define OMP_TASK_CLAUSE_MASK \
21641 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
21642 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
21643 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
21644 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21645 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21646 | (1u << PRAGMA_OMP_CLAUSE_SHARED))
21649 cp_parser_omp_task (cp_parser *parser, cp_token *pragma_tok)
21651 tree clauses, block;
21654 clauses = cp_parser_omp_all_clauses (parser, OMP_TASK_CLAUSE_MASK,
21655 "#pragma omp task", pragma_tok);
21656 block = begin_omp_task ();
21657 save = cp_parser_begin_omp_structured_block (parser);
21658 cp_parser_statement (parser, NULL_TREE, false, NULL);
21659 cp_parser_end_omp_structured_block (parser, save);
21660 return finish_omp_task (clauses, block);
21664 # pragma omp taskwait new-line */
21667 cp_parser_omp_taskwait (cp_parser *parser, cp_token *pragma_tok)
21669 cp_parser_require_pragma_eol (parser, pragma_tok);
21670 finish_omp_taskwait ();
21674 # pragma omp threadprivate (variable-list) */
21677 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
21681 vars = cp_parser_omp_var_list (parser, 0, NULL);
21682 cp_parser_require_pragma_eol (parser, pragma_tok);
21684 finish_omp_threadprivate (vars);
21687 /* Main entry point to OpenMP statement pragmas. */
21690 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
21694 switch (pragma_tok->pragma_kind)
21696 case PRAGMA_OMP_ATOMIC:
21697 cp_parser_omp_atomic (parser, pragma_tok);
21699 case PRAGMA_OMP_CRITICAL:
21700 stmt = cp_parser_omp_critical (parser, pragma_tok);
21702 case PRAGMA_OMP_FOR:
21703 stmt = cp_parser_omp_for (parser, pragma_tok);
21705 case PRAGMA_OMP_MASTER:
21706 stmt = cp_parser_omp_master (parser, pragma_tok);
21708 case PRAGMA_OMP_ORDERED:
21709 stmt = cp_parser_omp_ordered (parser, pragma_tok);
21711 case PRAGMA_OMP_PARALLEL:
21712 stmt = cp_parser_omp_parallel (parser, pragma_tok);
21714 case PRAGMA_OMP_SECTIONS:
21715 stmt = cp_parser_omp_sections (parser, pragma_tok);
21717 case PRAGMA_OMP_SINGLE:
21718 stmt = cp_parser_omp_single (parser, pragma_tok);
21720 case PRAGMA_OMP_TASK:
21721 stmt = cp_parser_omp_task (parser, pragma_tok);
21724 gcc_unreachable ();
21728 SET_EXPR_LOCATION (stmt, pragma_tok->location);
21733 static GTY (()) cp_parser *the_parser;
21736 /* Special handling for the first token or line in the file. The first
21737 thing in the file might be #pragma GCC pch_preprocess, which loads a
21738 PCH file, which is a GC collection point. So we need to handle this
21739 first pragma without benefit of an existing lexer structure.
21741 Always returns one token to the caller in *FIRST_TOKEN. This is
21742 either the true first token of the file, or the first token after
21743 the initial pragma. */
21746 cp_parser_initial_pragma (cp_token *first_token)
21750 cp_lexer_get_preprocessor_token (NULL, first_token);
21751 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
21754 cp_lexer_get_preprocessor_token (NULL, first_token);
21755 if (first_token->type == CPP_STRING)
21757 name = first_token->u.value;
21759 cp_lexer_get_preprocessor_token (NULL, first_token);
21760 if (first_token->type != CPP_PRAGMA_EOL)
21761 error ("%Hjunk at end of %<#pragma GCC pch_preprocess%>",
21762 &first_token->location);
21765 error ("%Hexpected string literal", &first_token->location);
21767 /* Skip to the end of the pragma. */
21768 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
21769 cp_lexer_get_preprocessor_token (NULL, first_token);
21771 /* Now actually load the PCH file. */
21773 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
21775 /* Read one more token to return to our caller. We have to do this
21776 after reading the PCH file in, since its pointers have to be
21778 cp_lexer_get_preprocessor_token (NULL, first_token);
21781 /* Normal parsing of a pragma token. Here we can (and must) use the
21785 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
21787 cp_token *pragma_tok;
21790 pragma_tok = cp_lexer_consume_token (parser->lexer);
21791 gcc_assert (pragma_tok->type == CPP_PRAGMA);
21792 parser->lexer->in_pragma = true;
21794 id = pragma_tok->pragma_kind;
21797 case PRAGMA_GCC_PCH_PREPROCESS:
21798 error ("%H%<#pragma GCC pch_preprocess%> must be first",
21799 &pragma_tok->location);
21802 case PRAGMA_OMP_BARRIER:
21805 case pragma_compound:
21806 cp_parser_omp_barrier (parser, pragma_tok);
21809 error ("%H%<#pragma omp barrier%> may only be "
21810 "used in compound statements", &pragma_tok->location);
21817 case PRAGMA_OMP_FLUSH:
21820 case pragma_compound:
21821 cp_parser_omp_flush (parser, pragma_tok);
21824 error ("%H%<#pragma omp flush%> may only be "
21825 "used in compound statements", &pragma_tok->location);
21832 case PRAGMA_OMP_TASKWAIT:
21835 case pragma_compound:
21836 cp_parser_omp_taskwait (parser, pragma_tok);
21839 error ("%H%<#pragma omp taskwait%> may only be "
21840 "used in compound statements",
21841 &pragma_tok->location);
21848 case PRAGMA_OMP_THREADPRIVATE:
21849 cp_parser_omp_threadprivate (parser, pragma_tok);
21852 case PRAGMA_OMP_ATOMIC:
21853 case PRAGMA_OMP_CRITICAL:
21854 case PRAGMA_OMP_FOR:
21855 case PRAGMA_OMP_MASTER:
21856 case PRAGMA_OMP_ORDERED:
21857 case PRAGMA_OMP_PARALLEL:
21858 case PRAGMA_OMP_SECTIONS:
21859 case PRAGMA_OMP_SINGLE:
21860 case PRAGMA_OMP_TASK:
21861 if (context == pragma_external)
21863 cp_parser_omp_construct (parser, pragma_tok);
21866 case PRAGMA_OMP_SECTION:
21867 error ("%H%<#pragma omp section%> may only be used in "
21868 "%<#pragma omp sections%> construct", &pragma_tok->location);
21872 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
21873 c_invoke_pragma_handler (id);
21877 cp_parser_error (parser, "expected declaration specifiers");
21881 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
21885 /* The interface the pragma parsers have to the lexer. */
21888 pragma_lex (tree *value)
21891 enum cpp_ttype ret;
21893 tok = cp_lexer_peek_token (the_parser->lexer);
21896 *value = tok->u.value;
21898 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
21900 else if (ret == CPP_STRING)
21901 *value = cp_parser_string_literal (the_parser, false, false);
21904 cp_lexer_consume_token (the_parser->lexer);
21905 if (ret == CPP_KEYWORD)
21913 /* External interface. */
21915 /* Parse one entire translation unit. */
21918 c_parse_file (void)
21920 bool error_occurred;
21921 static bool already_called = false;
21923 if (already_called)
21925 sorry ("inter-module optimizations not implemented for C++");
21928 already_called = true;
21930 the_parser = cp_parser_new ();
21931 push_deferring_access_checks (flag_access_control
21932 ? dk_no_deferred : dk_no_check);
21933 error_occurred = cp_parser_translation_unit (the_parser);
21937 #include "gt-cp-parser.h"