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 *, cp_parameter_declarator *, 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,
1016 cp_parameter_declarator *parms,
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 cp_parameter_declarator *cp_parser_parameter_declaration_clause
1741 static cp_parameter_declarator *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)
5461 /* Consume the '&&' token. */
5462 cp_lexer_consume_token (parser->lexer);
5463 /* Look for the identifier. */
5464 identifier = cp_parser_identifier (parser);
5465 /* Create an expression representing the address. */
5466 expression = finish_label_address_expr (identifier);
5467 if (cp_parser_non_integral_constant_expression (parser,
5468 "the address of a label"))
5469 expression = error_mark_node;
5473 if (unary_operator != ERROR_MARK)
5475 tree cast_expression;
5476 tree expression = error_mark_node;
5477 const char *non_constant_p = NULL;
5479 /* Consume the operator token. */
5480 token = cp_lexer_consume_token (parser->lexer);
5481 /* Parse the cast-expression. */
5483 = cp_parser_cast_expression (parser,
5484 unary_operator == ADDR_EXPR,
5486 /* Now, build an appropriate representation. */
5487 switch (unary_operator)
5490 non_constant_p = "%<*%>";
5491 expression = build_x_indirect_ref (cast_expression, "unary *",
5492 tf_warning_or_error);
5496 non_constant_p = "%<&%>";
5499 expression = build_x_unary_op (unary_operator, cast_expression,
5500 tf_warning_or_error);
5503 case PREINCREMENT_EXPR:
5504 case PREDECREMENT_EXPR:
5505 non_constant_p = (unary_operator == PREINCREMENT_EXPR
5506 ? "%<++%>" : "%<--%>");
5508 case UNARY_PLUS_EXPR:
5510 case TRUTH_NOT_EXPR:
5511 expression = finish_unary_op_expr (unary_operator, cast_expression);
5519 && cp_parser_non_integral_constant_expression (parser,
5521 expression = error_mark_node;
5526 return cp_parser_postfix_expression (parser, address_p, cast_p,
5527 /*member_access_only_p=*/false);
5530 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5531 unary-operator, the corresponding tree code is returned. */
5533 static enum tree_code
5534 cp_parser_unary_operator (cp_token* token)
5536 switch (token->type)
5539 return INDIRECT_REF;
5545 return UNARY_PLUS_EXPR;
5551 return TRUTH_NOT_EXPR;
5554 return BIT_NOT_EXPR;
5561 /* Parse a new-expression.
5564 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5565 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5567 Returns a representation of the expression. */
5570 cp_parser_new_expression (cp_parser* parser)
5572 bool global_scope_p;
5578 /* Look for the optional `::' operator. */
5580 = (cp_parser_global_scope_opt (parser,
5581 /*current_scope_valid_p=*/false)
5583 /* Look for the `new' operator. */
5584 cp_parser_require_keyword (parser, RID_NEW, "%<new%>");
5585 /* There's no easy way to tell a new-placement from the
5586 `( type-id )' construct. */
5587 cp_parser_parse_tentatively (parser);
5588 /* Look for a new-placement. */
5589 placement = cp_parser_new_placement (parser);
5590 /* If that didn't work out, there's no new-placement. */
5591 if (!cp_parser_parse_definitely (parser))
5592 placement = NULL_TREE;
5594 /* If the next token is a `(', then we have a parenthesized
5596 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5599 /* Consume the `('. */
5600 cp_lexer_consume_token (parser->lexer);
5601 /* Parse the type-id. */
5602 type = cp_parser_type_id (parser);
5603 /* Look for the closing `)'. */
5604 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
5605 token = cp_lexer_peek_token (parser->lexer);
5606 /* There should not be a direct-new-declarator in this production,
5607 but GCC used to allowed this, so we check and emit a sensible error
5608 message for this case. */
5609 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5611 error ("%Harray bound forbidden after parenthesized type-id",
5613 inform (token->location,
5614 "try removing the parentheses around the type-id");
5615 cp_parser_direct_new_declarator (parser);
5619 /* Otherwise, there must be a new-type-id. */
5621 type = cp_parser_new_type_id (parser, &nelts);
5623 /* If the next token is a `(' or '{', then we have a new-initializer. */
5624 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
5625 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5626 initializer = cp_parser_new_initializer (parser);
5628 initializer = NULL_TREE;
5630 /* A new-expression may not appear in an integral constant
5632 if (cp_parser_non_integral_constant_expression (parser, "%<new%>"))
5633 return error_mark_node;
5635 /* Create a representation of the new-expression. */
5636 return build_new (placement, type, nelts, initializer, global_scope_p,
5637 tf_warning_or_error);
5640 /* Parse a new-placement.
5645 Returns the same representation as for an expression-list. */
5648 cp_parser_new_placement (cp_parser* parser)
5650 tree expression_list;
5652 /* Parse the expression-list. */
5653 expression_list = (cp_parser_parenthesized_expression_list
5654 (parser, false, /*cast_p=*/false, /*allow_expansion_p=*/true,
5655 /*non_constant_p=*/NULL));
5657 return expression_list;
5660 /* Parse a new-type-id.
5663 type-specifier-seq new-declarator [opt]
5665 Returns the TYPE allocated. If the new-type-id indicates an array
5666 type, *NELTS is set to the number of elements in the last array
5667 bound; the TYPE will not include the last array bound. */
5670 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
5672 cp_decl_specifier_seq type_specifier_seq;
5673 cp_declarator *new_declarator;
5674 cp_declarator *declarator;
5675 cp_declarator *outer_declarator;
5676 const char *saved_message;
5679 /* The type-specifier sequence must not contain type definitions.
5680 (It cannot contain declarations of new types either, but if they
5681 are not definitions we will catch that because they are not
5683 saved_message = parser->type_definition_forbidden_message;
5684 parser->type_definition_forbidden_message
5685 = "types may not be defined in a new-type-id";
5686 /* Parse the type-specifier-seq. */
5687 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
5688 &type_specifier_seq);
5689 /* Restore the old message. */
5690 parser->type_definition_forbidden_message = saved_message;
5691 /* Parse the new-declarator. */
5692 new_declarator = cp_parser_new_declarator_opt (parser);
5694 /* Determine the number of elements in the last array dimension, if
5697 /* Skip down to the last array dimension. */
5698 declarator = new_declarator;
5699 outer_declarator = NULL;
5700 while (declarator && (declarator->kind == cdk_pointer
5701 || declarator->kind == cdk_ptrmem))
5703 outer_declarator = declarator;
5704 declarator = declarator->declarator;
5707 && declarator->kind == cdk_array
5708 && declarator->declarator
5709 && declarator->declarator->kind == cdk_array)
5711 outer_declarator = declarator;
5712 declarator = declarator->declarator;
5715 if (declarator && declarator->kind == cdk_array)
5717 *nelts = declarator->u.array.bounds;
5718 if (*nelts == error_mark_node)
5719 *nelts = integer_one_node;
5721 if (outer_declarator)
5722 outer_declarator->declarator = declarator->declarator;
5724 new_declarator = NULL;
5727 type = groktypename (&type_specifier_seq, new_declarator);
5731 /* Parse an (optional) new-declarator.
5734 ptr-operator new-declarator [opt]
5735 direct-new-declarator
5737 Returns the declarator. */
5739 static cp_declarator *
5740 cp_parser_new_declarator_opt (cp_parser* parser)
5742 enum tree_code code;
5744 cp_cv_quals cv_quals;
5746 /* We don't know if there's a ptr-operator next, or not. */
5747 cp_parser_parse_tentatively (parser);
5748 /* Look for a ptr-operator. */
5749 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
5750 /* If that worked, look for more new-declarators. */
5751 if (cp_parser_parse_definitely (parser))
5753 cp_declarator *declarator;
5755 /* Parse another optional declarator. */
5756 declarator = cp_parser_new_declarator_opt (parser);
5758 return cp_parser_make_indirect_declarator
5759 (code, type, cv_quals, declarator);
5762 /* If the next token is a `[', there is a direct-new-declarator. */
5763 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5764 return cp_parser_direct_new_declarator (parser);
5769 /* Parse a direct-new-declarator.
5771 direct-new-declarator:
5773 direct-new-declarator [constant-expression]
5777 static cp_declarator *
5778 cp_parser_direct_new_declarator (cp_parser* parser)
5780 cp_declarator *declarator = NULL;
5786 /* Look for the opening `['. */
5787 cp_parser_require (parser, CPP_OPEN_SQUARE, "%<[%>");
5788 /* The first expression is not required to be constant. */
5791 cp_token *token = cp_lexer_peek_token (parser->lexer);
5792 expression = cp_parser_expression (parser, /*cast_p=*/false);
5793 /* The standard requires that the expression have integral
5794 type. DR 74 adds enumeration types. We believe that the
5795 real intent is that these expressions be handled like the
5796 expression in a `switch' condition, which also allows
5797 classes with a single conversion to integral or
5798 enumeration type. */
5799 if (!processing_template_decl)
5802 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5807 error ("%Hexpression in new-declarator must have integral "
5808 "or enumeration type", &token->location);
5809 expression = error_mark_node;
5813 /* But all the other expressions must be. */
5816 = cp_parser_constant_expression (parser,
5817 /*allow_non_constant=*/false,
5819 /* Look for the closing `]'. */
5820 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
5822 /* Add this bound to the declarator. */
5823 declarator = make_array_declarator (declarator, expression);
5825 /* If the next token is not a `[', then there are no more
5827 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5834 /* Parse a new-initializer.
5837 ( expression-list [opt] )
5840 Returns a representation of the expression-list. If there is no
5841 expression-list, VOID_ZERO_NODE is returned. */
5844 cp_parser_new_initializer (cp_parser* parser)
5846 tree expression_list;
5848 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5850 bool expr_non_constant_p;
5851 maybe_warn_cpp0x ("extended initializer lists");
5852 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
5853 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
5854 expression_list = build_tree_list (NULL_TREE, expression_list);
5857 expression_list = (cp_parser_parenthesized_expression_list
5858 (parser, false, /*cast_p=*/false, /*allow_expansion_p=*/true,
5859 /*non_constant_p=*/NULL));
5860 if (!expression_list)
5861 expression_list = void_zero_node;
5863 return expression_list;
5866 /* Parse a delete-expression.
5869 :: [opt] delete cast-expression
5870 :: [opt] delete [ ] cast-expression
5872 Returns a representation of the expression. */
5875 cp_parser_delete_expression (cp_parser* parser)
5877 bool global_scope_p;
5881 /* Look for the optional `::' operator. */
5883 = (cp_parser_global_scope_opt (parser,
5884 /*current_scope_valid_p=*/false)
5886 /* Look for the `delete' keyword. */
5887 cp_parser_require_keyword (parser, RID_DELETE, "%<delete%>");
5888 /* See if the array syntax is in use. */
5889 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5891 /* Consume the `[' token. */
5892 cp_lexer_consume_token (parser->lexer);
5893 /* Look for the `]' token. */
5894 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
5895 /* Remember that this is the `[]' construct. */
5901 /* Parse the cast-expression. */
5902 expression = cp_parser_simple_cast_expression (parser);
5904 /* A delete-expression may not appear in an integral constant
5906 if (cp_parser_non_integral_constant_expression (parser, "%<delete%>"))
5907 return error_mark_node;
5909 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5912 /* Parse a cast-expression.
5916 ( type-id ) cast-expression
5918 ADDRESS_P is true iff the unary-expression is appearing as the
5919 operand of the `&' operator. CAST_P is true if this expression is
5920 the target of a cast.
5922 Returns a representation of the expression. */
5925 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p)
5927 /* If it's a `(', then we might be looking at a cast. */
5928 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5930 tree type = NULL_TREE;
5931 tree expr = NULL_TREE;
5932 bool compound_literal_p;
5933 const char *saved_message;
5935 /* There's no way to know yet whether or not this is a cast.
5936 For example, `(int (3))' is a unary-expression, while `(int)
5937 3' is a cast. So, we resort to parsing tentatively. */
5938 cp_parser_parse_tentatively (parser);
5939 /* Types may not be defined in a cast. */
5940 saved_message = parser->type_definition_forbidden_message;
5941 parser->type_definition_forbidden_message
5942 = "types may not be defined in casts";
5943 /* Consume the `('. */
5944 cp_lexer_consume_token (parser->lexer);
5945 /* A very tricky bit is that `(struct S) { 3 }' is a
5946 compound-literal (which we permit in C++ as an extension).
5947 But, that construct is not a cast-expression -- it is a
5948 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5949 is legal; if the compound-literal were a cast-expression,
5950 you'd need an extra set of parentheses.) But, if we parse
5951 the type-id, and it happens to be a class-specifier, then we
5952 will commit to the parse at that point, because we cannot
5953 undo the action that is done when creating a new class. So,
5954 then we cannot back up and do a postfix-expression.
5956 Therefore, we scan ahead to the closing `)', and check to see
5957 if the token after the `)' is a `{'. If so, we are not
5958 looking at a cast-expression.
5960 Save tokens so that we can put them back. */
5961 cp_lexer_save_tokens (parser->lexer);
5962 /* Skip tokens until the next token is a closing parenthesis.
5963 If we find the closing `)', and the next token is a `{', then
5964 we are looking at a compound-literal. */
5966 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5967 /*consume_paren=*/true)
5968 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5969 /* Roll back the tokens we skipped. */
5970 cp_lexer_rollback_tokens (parser->lexer);
5971 /* If we were looking at a compound-literal, simulate an error
5972 so that the call to cp_parser_parse_definitely below will
5974 if (compound_literal_p)
5975 cp_parser_simulate_error (parser);
5978 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5979 parser->in_type_id_in_expr_p = true;
5980 /* Look for the type-id. */
5981 type = cp_parser_type_id (parser);
5982 /* Look for the closing `)'. */
5983 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
5984 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5987 /* Restore the saved message. */
5988 parser->type_definition_forbidden_message = saved_message;
5990 /* If ok so far, parse the dependent expression. We cannot be
5991 sure it is a cast. Consider `(T ())'. It is a parenthesized
5992 ctor of T, but looks like a cast to function returning T
5993 without a dependent expression. */
5994 if (!cp_parser_error_occurred (parser))
5995 expr = cp_parser_cast_expression (parser,
5996 /*address_p=*/false,
5999 if (cp_parser_parse_definitely (parser))
6001 /* Warn about old-style casts, if so requested. */
6002 if (warn_old_style_cast
6003 && !in_system_header
6004 && !VOID_TYPE_P (type)
6005 && current_lang_name != lang_name_c)
6006 warning (OPT_Wold_style_cast, "use of old-style cast");
6008 /* Only type conversions to integral or enumeration types
6009 can be used in constant-expressions. */
6010 if (!cast_valid_in_integral_constant_expression_p (type)
6011 && (cp_parser_non_integral_constant_expression
6013 "a cast to a type other than an integral or "
6014 "enumeration type")))
6015 return error_mark_node;
6017 /* Perform the cast. */
6018 expr = build_c_cast (type, expr);
6023 /* If we get here, then it's not a cast, so it must be a
6024 unary-expression. */
6025 return cp_parser_unary_expression (parser, address_p, cast_p);
6028 /* Parse a binary expression of the general form:
6032 pm-expression .* cast-expression
6033 pm-expression ->* cast-expression
6035 multiplicative-expression:
6037 multiplicative-expression * pm-expression
6038 multiplicative-expression / pm-expression
6039 multiplicative-expression % pm-expression
6041 additive-expression:
6042 multiplicative-expression
6043 additive-expression + multiplicative-expression
6044 additive-expression - multiplicative-expression
6048 shift-expression << additive-expression
6049 shift-expression >> additive-expression
6051 relational-expression:
6053 relational-expression < shift-expression
6054 relational-expression > shift-expression
6055 relational-expression <= shift-expression
6056 relational-expression >= shift-expression
6060 relational-expression:
6061 relational-expression <? shift-expression
6062 relational-expression >? shift-expression
6064 equality-expression:
6065 relational-expression
6066 equality-expression == relational-expression
6067 equality-expression != relational-expression
6071 and-expression & equality-expression
6073 exclusive-or-expression:
6075 exclusive-or-expression ^ and-expression
6077 inclusive-or-expression:
6078 exclusive-or-expression
6079 inclusive-or-expression | exclusive-or-expression
6081 logical-and-expression:
6082 inclusive-or-expression
6083 logical-and-expression && inclusive-or-expression
6085 logical-or-expression:
6086 logical-and-expression
6087 logical-or-expression || logical-and-expression
6089 All these are implemented with a single function like:
6092 simple-cast-expression
6093 binary-expression <token> binary-expression
6095 CAST_P is true if this expression is the target of a cast.
6097 The binops_by_token map is used to get the tree codes for each <token> type.
6098 binary-expressions are associated according to a precedence table. */
6100 #define TOKEN_PRECEDENCE(token) \
6101 (((token->type == CPP_GREATER \
6102 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
6103 && !parser->greater_than_is_operator_p) \
6104 ? PREC_NOT_OPERATOR \
6105 : binops_by_token[token->type].prec)
6108 cp_parser_binary_expression (cp_parser* parser, bool cast_p,
6109 enum cp_parser_prec prec)
6111 cp_parser_expression_stack stack;
6112 cp_parser_expression_stack_entry *sp = &stack[0];
6115 enum tree_code tree_type, lhs_type, rhs_type;
6116 enum cp_parser_prec new_prec, lookahead_prec;
6119 /* Parse the first expression. */
6120 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p);
6121 lhs_type = ERROR_MARK;
6125 /* Get an operator token. */
6126 token = cp_lexer_peek_token (parser->lexer);
6128 if (warn_cxx0x_compat
6129 && token->type == CPP_RSHIFT
6130 && !parser->greater_than_is_operator_p)
6132 warning (OPT_Wc__0x_compat,
6133 "%H%<>>%> operator will be treated as two right angle brackets in C++0x",
6135 warning (OPT_Wc__0x_compat,
6136 "suggest parentheses around %<>>%> expression");
6139 new_prec = TOKEN_PRECEDENCE (token);
6141 /* Popping an entry off the stack means we completed a subexpression:
6142 - either we found a token which is not an operator (`>' where it is not
6143 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
6144 will happen repeatedly;
6145 - or, we found an operator which has lower priority. This is the case
6146 where the recursive descent *ascends*, as in `3 * 4 + 5' after
6148 if (new_prec <= prec)
6157 tree_type = binops_by_token[token->type].tree_type;
6159 /* We used the operator token. */
6160 cp_lexer_consume_token (parser->lexer);
6162 /* Extract another operand. It may be the RHS of this expression
6163 or the LHS of a new, higher priority expression. */
6164 rhs = cp_parser_simple_cast_expression (parser);
6165 rhs_type = ERROR_MARK;
6167 /* Get another operator token. Look up its precedence to avoid
6168 building a useless (immediately popped) stack entry for common
6169 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
6170 token = cp_lexer_peek_token (parser->lexer);
6171 lookahead_prec = TOKEN_PRECEDENCE (token);
6172 if (lookahead_prec > new_prec)
6174 /* ... and prepare to parse the RHS of the new, higher priority
6175 expression. Since precedence levels on the stack are
6176 monotonically increasing, we do not have to care about
6179 sp->tree_type = tree_type;
6181 sp->lhs_type = lhs_type;
6184 lhs_type = rhs_type;
6186 new_prec = lookahead_prec;
6190 /* If the stack is not empty, we have parsed into LHS the right side
6191 (`4' in the example above) of an expression we had suspended.
6192 We can use the information on the stack to recover the LHS (`3')
6193 from the stack together with the tree code (`MULT_EXPR'), and
6194 the precedence of the higher level subexpression
6195 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
6196 which will be used to actually build the additive expression. */
6199 tree_type = sp->tree_type;
6201 rhs_type = lhs_type;
6203 lhs_type = sp->lhs_type;
6206 overloaded_p = false;
6207 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
6208 &overloaded_p, tf_warning_or_error);
6209 lhs_type = tree_type;
6211 /* If the binary operator required the use of an overloaded operator,
6212 then this expression cannot be an integral constant-expression.
6213 An overloaded operator can be used even if both operands are
6214 otherwise permissible in an integral constant-expression if at
6215 least one of the operands is of enumeration type. */
6218 && (cp_parser_non_integral_constant_expression
6219 (parser, "calls to overloaded operators")))
6220 return error_mark_node;
6227 /* Parse the `? expression : assignment-expression' part of a
6228 conditional-expression. The LOGICAL_OR_EXPR is the
6229 logical-or-expression that started the conditional-expression.
6230 Returns a representation of the entire conditional-expression.
6232 This routine is used by cp_parser_assignment_expression.
6234 ? expression : assignment-expression
6238 ? : assignment-expression */
6241 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
6244 tree assignment_expr;
6246 /* Consume the `?' token. */
6247 cp_lexer_consume_token (parser->lexer);
6248 if (cp_parser_allow_gnu_extensions_p (parser)
6249 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
6250 /* Implicit true clause. */
6253 /* Parse the expression. */
6254 expr = cp_parser_expression (parser, /*cast_p=*/false);
6256 /* The next token should be a `:'. */
6257 cp_parser_require (parser, CPP_COLON, "%<:%>");
6258 /* Parse the assignment-expression. */
6259 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false);
6261 /* Build the conditional-expression. */
6262 return build_x_conditional_expr (logical_or_expr,
6265 tf_warning_or_error);
6268 /* Parse an assignment-expression.
6270 assignment-expression:
6271 conditional-expression
6272 logical-or-expression assignment-operator assignment_expression
6275 CAST_P is true if this expression is the target of a cast.
6277 Returns a representation for the expression. */
6280 cp_parser_assignment_expression (cp_parser* parser, bool cast_p)
6284 /* If the next token is the `throw' keyword, then we're looking at
6285 a throw-expression. */
6286 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
6287 expr = cp_parser_throw_expression (parser);
6288 /* Otherwise, it must be that we are looking at a
6289 logical-or-expression. */
6292 /* Parse the binary expressions (logical-or-expression). */
6293 expr = cp_parser_binary_expression (parser, cast_p, PREC_NOT_OPERATOR);
6294 /* If the next token is a `?' then we're actually looking at a
6295 conditional-expression. */
6296 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
6297 return cp_parser_question_colon_clause (parser, expr);
6300 enum tree_code assignment_operator;
6302 /* If it's an assignment-operator, we're using the second
6305 = cp_parser_assignment_operator_opt (parser);
6306 if (assignment_operator != ERROR_MARK)
6308 bool non_constant_p;
6310 /* Parse the right-hand side of the assignment. */
6311 tree rhs = cp_parser_initializer_clause (parser, &non_constant_p);
6313 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6314 maybe_warn_cpp0x ("extended initializer lists");
6316 /* An assignment may not appear in a
6317 constant-expression. */
6318 if (cp_parser_non_integral_constant_expression (parser,
6320 return error_mark_node;
6321 /* Build the assignment expression. */
6322 expr = build_x_modify_expr (expr,
6323 assignment_operator,
6325 tf_warning_or_error);
6333 /* Parse an (optional) assignment-operator.
6335 assignment-operator: one of
6336 = *= /= %= += -= >>= <<= &= ^= |=
6340 assignment-operator: one of
6343 If the next token is an assignment operator, the corresponding tree
6344 code is returned, and the token is consumed. For example, for
6345 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
6346 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
6347 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
6348 operator, ERROR_MARK is returned. */
6350 static enum tree_code
6351 cp_parser_assignment_operator_opt (cp_parser* parser)
6356 /* Peek at the next token. */
6357 token = cp_lexer_peek_token (parser->lexer);
6359 switch (token->type)
6370 op = TRUNC_DIV_EXPR;
6374 op = TRUNC_MOD_EXPR;
6406 /* Nothing else is an assignment operator. */
6410 /* If it was an assignment operator, consume it. */
6411 if (op != ERROR_MARK)
6412 cp_lexer_consume_token (parser->lexer);
6417 /* Parse an expression.
6420 assignment-expression
6421 expression , assignment-expression
6423 CAST_P is true if this expression is the target of a cast.
6425 Returns a representation of the expression. */
6428 cp_parser_expression (cp_parser* parser, bool cast_p)
6430 tree expression = NULL_TREE;
6434 tree assignment_expression;
6436 /* Parse the next assignment-expression. */
6437 assignment_expression
6438 = cp_parser_assignment_expression (parser, cast_p);
6439 /* If this is the first assignment-expression, we can just
6442 expression = assignment_expression;
6444 expression = build_x_compound_expr (expression,
6445 assignment_expression,
6446 tf_warning_or_error);
6447 /* If the next token is not a comma, then we are done with the
6449 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6451 /* Consume the `,'. */
6452 cp_lexer_consume_token (parser->lexer);
6453 /* A comma operator cannot appear in a constant-expression. */
6454 if (cp_parser_non_integral_constant_expression (parser,
6455 "a comma operator"))
6456 expression = error_mark_node;
6462 /* Parse a constant-expression.
6464 constant-expression:
6465 conditional-expression
6467 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
6468 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
6469 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
6470 is false, NON_CONSTANT_P should be NULL. */
6473 cp_parser_constant_expression (cp_parser* parser,
6474 bool allow_non_constant_p,
6475 bool *non_constant_p)
6477 bool saved_integral_constant_expression_p;
6478 bool saved_allow_non_integral_constant_expression_p;
6479 bool saved_non_integral_constant_expression_p;
6482 /* It might seem that we could simply parse the
6483 conditional-expression, and then check to see if it were
6484 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
6485 one that the compiler can figure out is constant, possibly after
6486 doing some simplifications or optimizations. The standard has a
6487 precise definition of constant-expression, and we must honor
6488 that, even though it is somewhat more restrictive.
6494 is not a legal declaration, because `(2, 3)' is not a
6495 constant-expression. The `,' operator is forbidden in a
6496 constant-expression. However, GCC's constant-folding machinery
6497 will fold this operation to an INTEGER_CST for `3'. */
6499 /* Save the old settings. */
6500 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
6501 saved_allow_non_integral_constant_expression_p
6502 = parser->allow_non_integral_constant_expression_p;
6503 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
6504 /* We are now parsing a constant-expression. */
6505 parser->integral_constant_expression_p = true;
6506 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
6507 parser->non_integral_constant_expression_p = false;
6508 /* Although the grammar says "conditional-expression", we parse an
6509 "assignment-expression", which also permits "throw-expression"
6510 and the use of assignment operators. In the case that
6511 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
6512 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
6513 actually essential that we look for an assignment-expression.
6514 For example, cp_parser_initializer_clauses uses this function to
6515 determine whether a particular assignment-expression is in fact
6517 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false);
6518 /* Restore the old settings. */
6519 parser->integral_constant_expression_p
6520 = saved_integral_constant_expression_p;
6521 parser->allow_non_integral_constant_expression_p
6522 = saved_allow_non_integral_constant_expression_p;
6523 if (allow_non_constant_p)
6524 *non_constant_p = parser->non_integral_constant_expression_p;
6525 else if (parser->non_integral_constant_expression_p)
6526 expression = error_mark_node;
6527 parser->non_integral_constant_expression_p
6528 = saved_non_integral_constant_expression_p;
6533 /* Parse __builtin_offsetof.
6535 offsetof-expression:
6536 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
6538 offsetof-member-designator:
6540 | offsetof-member-designator "." id-expression
6541 | offsetof-member-designator "[" expression "]" */
6544 cp_parser_builtin_offsetof (cp_parser *parser)
6546 int save_ice_p, save_non_ice_p;
6551 /* We're about to accept non-integral-constant things, but will
6552 definitely yield an integral constant expression. Save and
6553 restore these values around our local parsing. */
6554 save_ice_p = parser->integral_constant_expression_p;
6555 save_non_ice_p = parser->non_integral_constant_expression_p;
6557 /* Consume the "__builtin_offsetof" token. */
6558 cp_lexer_consume_token (parser->lexer);
6559 /* Consume the opening `('. */
6560 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
6561 /* Parse the type-id. */
6562 type = cp_parser_type_id (parser);
6563 /* Look for the `,'. */
6564 cp_parser_require (parser, CPP_COMMA, "%<,%>");
6565 token = cp_lexer_peek_token (parser->lexer);
6567 /* Build the (type *)null that begins the traditional offsetof macro. */
6568 expr = build_static_cast (build_pointer_type (type), null_pointer_node,
6569 tf_warning_or_error);
6571 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
6572 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
6573 true, &dummy, token->location);
6576 token = cp_lexer_peek_token (parser->lexer);
6577 switch (token->type)
6579 case CPP_OPEN_SQUARE:
6580 /* offsetof-member-designator "[" expression "]" */
6581 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
6585 /* offsetof-member-designator "." identifier */
6586 cp_lexer_consume_token (parser->lexer);
6587 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
6592 case CPP_CLOSE_PAREN:
6593 /* Consume the ")" token. */
6594 cp_lexer_consume_token (parser->lexer);
6598 /* Error. We know the following require will fail, but
6599 that gives the proper error message. */
6600 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
6601 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
6602 expr = error_mark_node;
6608 /* If we're processing a template, we can't finish the semantics yet.
6609 Otherwise we can fold the entire expression now. */
6610 if (processing_template_decl)
6611 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
6613 expr = finish_offsetof (expr);
6616 parser->integral_constant_expression_p = save_ice_p;
6617 parser->non_integral_constant_expression_p = save_non_ice_p;
6622 /* Parse a trait expression. */
6625 cp_parser_trait_expr (cp_parser* parser, enum rid keyword)
6628 tree type1, type2 = NULL_TREE;
6629 bool binary = false;
6630 cp_decl_specifier_seq decl_specs;
6634 case RID_HAS_NOTHROW_ASSIGN:
6635 kind = CPTK_HAS_NOTHROW_ASSIGN;
6637 case RID_HAS_NOTHROW_CONSTRUCTOR:
6638 kind = CPTK_HAS_NOTHROW_CONSTRUCTOR;
6640 case RID_HAS_NOTHROW_COPY:
6641 kind = CPTK_HAS_NOTHROW_COPY;
6643 case RID_HAS_TRIVIAL_ASSIGN:
6644 kind = CPTK_HAS_TRIVIAL_ASSIGN;
6646 case RID_HAS_TRIVIAL_CONSTRUCTOR:
6647 kind = CPTK_HAS_TRIVIAL_CONSTRUCTOR;
6649 case RID_HAS_TRIVIAL_COPY:
6650 kind = CPTK_HAS_TRIVIAL_COPY;
6652 case RID_HAS_TRIVIAL_DESTRUCTOR:
6653 kind = CPTK_HAS_TRIVIAL_DESTRUCTOR;
6655 case RID_HAS_VIRTUAL_DESTRUCTOR:
6656 kind = CPTK_HAS_VIRTUAL_DESTRUCTOR;
6658 case RID_IS_ABSTRACT:
6659 kind = CPTK_IS_ABSTRACT;
6661 case RID_IS_BASE_OF:
6662 kind = CPTK_IS_BASE_OF;
6666 kind = CPTK_IS_CLASS;
6668 case RID_IS_CONVERTIBLE_TO:
6669 kind = CPTK_IS_CONVERTIBLE_TO;
6673 kind = CPTK_IS_EMPTY;
6676 kind = CPTK_IS_ENUM;
6681 case RID_IS_POLYMORPHIC:
6682 kind = CPTK_IS_POLYMORPHIC;
6685 kind = CPTK_IS_UNION;
6691 /* Consume the token. */
6692 cp_lexer_consume_token (parser->lexer);
6694 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
6696 type1 = cp_parser_type_id (parser);
6698 if (type1 == error_mark_node)
6699 return error_mark_node;
6701 /* Build a trivial decl-specifier-seq. */
6702 clear_decl_specs (&decl_specs);
6703 decl_specs.type = type1;
6705 /* Call grokdeclarator to figure out what type this is. */
6706 type1 = grokdeclarator (NULL, &decl_specs, TYPENAME,
6707 /*initialized=*/0, /*attrlist=*/NULL);
6711 cp_parser_require (parser, CPP_COMMA, "%<,%>");
6713 type2 = cp_parser_type_id (parser);
6715 if (type2 == error_mark_node)
6716 return error_mark_node;
6718 /* Build a trivial decl-specifier-seq. */
6719 clear_decl_specs (&decl_specs);
6720 decl_specs.type = type2;
6722 /* Call grokdeclarator to figure out what type this is. */
6723 type2 = grokdeclarator (NULL, &decl_specs, TYPENAME,
6724 /*initialized=*/0, /*attrlist=*/NULL);
6727 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
6729 /* Complete the trait expression, which may mean either processing
6730 the trait expr now or saving it for template instantiation. */
6731 return finish_trait_expr (kind, type1, type2);
6734 /* Statements [gram.stmt.stmt] */
6736 /* Parse a statement.
6740 expression-statement
6745 declaration-statement
6748 IN_COMPOUND is true when the statement is nested inside a
6749 cp_parser_compound_statement; this matters for certain pragmas.
6751 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6752 is a (possibly labeled) if statement which is not enclosed in braces
6753 and has an else clause. This is used to implement -Wparentheses. */
6756 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
6757 bool in_compound, bool *if_p)
6761 location_t statement_location;
6766 /* There is no statement yet. */
6767 statement = NULL_TREE;
6768 /* Peek at the next token. */
6769 token = cp_lexer_peek_token (parser->lexer);
6770 /* Remember the location of the first token in the statement. */
6771 statement_location = token->location;
6772 /* If this is a keyword, then that will often determine what kind of
6773 statement we have. */
6774 if (token->type == CPP_KEYWORD)
6776 enum rid keyword = token->keyword;
6782 /* Looks like a labeled-statement with a case label.
6783 Parse the label, and then use tail recursion to parse
6785 cp_parser_label_for_labeled_statement (parser);
6790 statement = cp_parser_selection_statement (parser, if_p);
6796 statement = cp_parser_iteration_statement (parser);
6803 statement = cp_parser_jump_statement (parser);
6806 /* Objective-C++ exception-handling constructs. */
6809 case RID_AT_FINALLY:
6810 case RID_AT_SYNCHRONIZED:
6812 statement = cp_parser_objc_statement (parser);
6816 statement = cp_parser_try_block (parser);
6820 /* This must be a namespace alias definition. */
6821 cp_parser_declaration_statement (parser);
6825 /* It might be a keyword like `int' that can start a
6826 declaration-statement. */
6830 else if (token->type == CPP_NAME)
6832 /* If the next token is a `:', then we are looking at a
6833 labeled-statement. */
6834 token = cp_lexer_peek_nth_token (parser->lexer, 2);
6835 if (token->type == CPP_COLON)
6837 /* Looks like a labeled-statement with an ordinary label.
6838 Parse the label, and then use tail recursion to parse
6840 cp_parser_label_for_labeled_statement (parser);
6844 /* Anything that starts with a `{' must be a compound-statement. */
6845 else if (token->type == CPP_OPEN_BRACE)
6846 statement = cp_parser_compound_statement (parser, NULL, false);
6847 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6848 a statement all its own. */
6849 else if (token->type == CPP_PRAGMA)
6851 /* Only certain OpenMP pragmas are attached to statements, and thus
6852 are considered statements themselves. All others are not. In
6853 the context of a compound, accept the pragma as a "statement" and
6854 return so that we can check for a close brace. Otherwise we
6855 require a real statement and must go back and read one. */
6857 cp_parser_pragma (parser, pragma_compound);
6858 else if (!cp_parser_pragma (parser, pragma_stmt))
6862 else if (token->type == CPP_EOF)
6864 cp_parser_error (parser, "expected statement");
6868 /* Everything else must be a declaration-statement or an
6869 expression-statement. Try for the declaration-statement
6870 first, unless we are looking at a `;', in which case we know that
6871 we have an expression-statement. */
6874 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6876 cp_parser_parse_tentatively (parser);
6877 /* Try to parse the declaration-statement. */
6878 cp_parser_declaration_statement (parser);
6879 /* If that worked, we're done. */
6880 if (cp_parser_parse_definitely (parser))
6883 /* Look for an expression-statement instead. */
6884 statement = cp_parser_expression_statement (parser, in_statement_expr);
6887 /* Set the line number for the statement. */
6888 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
6889 SET_EXPR_LOCATION (statement, statement_location);
6892 /* Parse the label for a labeled-statement, i.e.
6895 case constant-expression :
6899 case constant-expression ... constant-expression : statement
6901 When a label is parsed without errors, the label is added to the
6902 parse tree by the finish_* functions, so this function doesn't
6903 have to return the label. */
6906 cp_parser_label_for_labeled_statement (cp_parser* parser)
6910 /* The next token should be an identifier. */
6911 token = cp_lexer_peek_token (parser->lexer);
6912 if (token->type != CPP_NAME
6913 && token->type != CPP_KEYWORD)
6915 cp_parser_error (parser, "expected labeled-statement");
6919 switch (token->keyword)
6926 /* Consume the `case' token. */
6927 cp_lexer_consume_token (parser->lexer);
6928 /* Parse the constant-expression. */
6929 expr = cp_parser_constant_expression (parser,
6930 /*allow_non_constant_p=*/false,
6933 ellipsis = cp_lexer_peek_token (parser->lexer);
6934 if (ellipsis->type == CPP_ELLIPSIS)
6936 /* Consume the `...' token. */
6937 cp_lexer_consume_token (parser->lexer);
6939 cp_parser_constant_expression (parser,
6940 /*allow_non_constant_p=*/false,
6942 /* We don't need to emit warnings here, as the common code
6943 will do this for us. */
6946 expr_hi = NULL_TREE;
6948 if (parser->in_switch_statement_p)
6949 finish_case_label (expr, expr_hi);
6951 error ("%Hcase label %qE not within a switch statement",
6952 &token->location, expr);
6957 /* Consume the `default' token. */
6958 cp_lexer_consume_token (parser->lexer);
6960 if (parser->in_switch_statement_p)
6961 finish_case_label (NULL_TREE, NULL_TREE);
6963 error ("%Hcase label not within a switch statement", &token->location);
6967 /* Anything else must be an ordinary label. */
6968 finish_label_stmt (cp_parser_identifier (parser));
6972 /* Require the `:' token. */
6973 cp_parser_require (parser, CPP_COLON, "%<:%>");
6976 /* Parse an expression-statement.
6978 expression-statement:
6981 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6982 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6983 indicates whether this expression-statement is part of an
6984 expression statement. */
6987 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6989 tree statement = NULL_TREE;
6991 /* If the next token is a ';', then there is no expression
6993 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6994 statement = cp_parser_expression (parser, /*cast_p=*/false);
6996 /* Consume the final `;'. */
6997 cp_parser_consume_semicolon_at_end_of_statement (parser);
6999 if (in_statement_expr
7000 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
7001 /* This is the final expression statement of a statement
7003 statement = finish_stmt_expr_expr (statement, in_statement_expr);
7005 statement = finish_expr_stmt (statement);
7012 /* Parse a compound-statement.
7015 { statement-seq [opt] }
7020 { label-declaration-seq [opt] statement-seq [opt] }
7022 label-declaration-seq:
7024 label-declaration-seq label-declaration
7026 Returns a tree representing the statement. */
7029 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
7034 /* Consume the `{'. */
7035 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>"))
7036 return error_mark_node;
7037 /* Begin the compound-statement. */
7038 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
7039 /* If the next keyword is `__label__' we have a label declaration. */
7040 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
7041 cp_parser_label_declaration (parser);
7042 /* Parse an (optional) statement-seq. */
7043 cp_parser_statement_seq_opt (parser, in_statement_expr);
7044 /* Finish the compound-statement. */
7045 finish_compound_stmt (compound_stmt);
7046 /* Consume the `}'. */
7047 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
7049 return compound_stmt;
7052 /* Parse an (optional) statement-seq.
7056 statement-seq [opt] statement */
7059 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
7061 /* Scan statements until there aren't any more. */
7064 cp_token *token = cp_lexer_peek_token (parser->lexer);
7066 /* If we're looking at a `}', then we've run out of statements. */
7067 if (token->type == CPP_CLOSE_BRACE
7068 || token->type == CPP_EOF
7069 || token->type == CPP_PRAGMA_EOL)
7072 /* If we are in a compound statement and find 'else' then
7073 something went wrong. */
7074 else if (token->type == CPP_KEYWORD && token->keyword == RID_ELSE)
7076 if (parser->in_statement & IN_IF_STMT)
7080 token = cp_lexer_consume_token (parser->lexer);
7081 error ("%H%<else%> without a previous %<if%>", &token->location);
7085 /* Parse the statement. */
7086 cp_parser_statement (parser, in_statement_expr, true, NULL);
7090 /* Parse a selection-statement.
7092 selection-statement:
7093 if ( condition ) statement
7094 if ( condition ) statement else statement
7095 switch ( condition ) statement
7097 Returns the new IF_STMT or SWITCH_STMT.
7099 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7100 is a (possibly labeled) if statement which is not enclosed in
7101 braces and has an else clause. This is used to implement
7105 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
7113 /* Peek at the next token. */
7114 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
7116 /* See what kind of keyword it is. */
7117 keyword = token->keyword;
7126 /* Look for the `('. */
7127 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
7129 cp_parser_skip_to_end_of_statement (parser);
7130 return error_mark_node;
7133 /* Begin the selection-statement. */
7134 if (keyword == RID_IF)
7135 statement = begin_if_stmt ();
7137 statement = begin_switch_stmt ();
7139 /* Parse the condition. */
7140 condition = cp_parser_condition (parser);
7141 /* Look for the `)'. */
7142 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
7143 cp_parser_skip_to_closing_parenthesis (parser, true, false,
7144 /*consume_paren=*/true);
7146 if (keyword == RID_IF)
7149 unsigned char in_statement;
7151 /* Add the condition. */
7152 finish_if_stmt_cond (condition, statement);
7154 /* Parse the then-clause. */
7155 in_statement = parser->in_statement;
7156 parser->in_statement |= IN_IF_STMT;
7157 cp_parser_implicitly_scoped_statement (parser, &nested_if);
7158 parser->in_statement = in_statement;
7160 finish_then_clause (statement);
7162 /* If the next token is `else', parse the else-clause. */
7163 if (cp_lexer_next_token_is_keyword (parser->lexer,
7166 /* Consume the `else' keyword. */
7167 cp_lexer_consume_token (parser->lexer);
7168 begin_else_clause (statement);
7169 /* Parse the else-clause. */
7170 cp_parser_implicitly_scoped_statement (parser, NULL);
7171 finish_else_clause (statement);
7173 /* If we are currently parsing a then-clause, then
7174 IF_P will not be NULL. We set it to true to
7175 indicate that this if statement has an else clause.
7176 This may trigger the Wparentheses warning below
7177 when we get back up to the parent if statement. */
7183 /* This if statement does not have an else clause. If
7184 NESTED_IF is true, then the then-clause is an if
7185 statement which does have an else clause. We warn
7186 about the potential ambiguity. */
7188 warning (OPT_Wparentheses,
7189 ("%Hsuggest explicit braces "
7190 "to avoid ambiguous %<else%>"),
7191 EXPR_LOCUS (statement));
7194 /* Now we're all done with the if-statement. */
7195 finish_if_stmt (statement);
7199 bool in_switch_statement_p;
7200 unsigned char in_statement;
7202 /* Add the condition. */
7203 finish_switch_cond (condition, statement);
7205 /* Parse the body of the switch-statement. */
7206 in_switch_statement_p = parser->in_switch_statement_p;
7207 in_statement = parser->in_statement;
7208 parser->in_switch_statement_p = true;
7209 parser->in_statement |= IN_SWITCH_STMT;
7210 cp_parser_implicitly_scoped_statement (parser, NULL);
7211 parser->in_switch_statement_p = in_switch_statement_p;
7212 parser->in_statement = in_statement;
7214 /* Now we're all done with the switch-statement. */
7215 finish_switch_stmt (statement);
7223 cp_parser_error (parser, "expected selection-statement");
7224 return error_mark_node;
7228 /* Parse a condition.
7232 type-specifier-seq declarator = initializer-clause
7233 type-specifier-seq declarator braced-init-list
7238 type-specifier-seq declarator asm-specification [opt]
7239 attributes [opt] = assignment-expression
7241 Returns the expression that should be tested. */
7244 cp_parser_condition (cp_parser* parser)
7246 cp_decl_specifier_seq type_specifiers;
7247 const char *saved_message;
7249 /* Try the declaration first. */
7250 cp_parser_parse_tentatively (parser);
7251 /* New types are not allowed in the type-specifier-seq for a
7253 saved_message = parser->type_definition_forbidden_message;
7254 parser->type_definition_forbidden_message
7255 = "types may not be defined in conditions";
7256 /* Parse the type-specifier-seq. */
7257 cp_parser_type_specifier_seq (parser, /*is_condition==*/true,
7259 /* Restore the saved message. */
7260 parser->type_definition_forbidden_message = saved_message;
7261 /* If all is well, we might be looking at a declaration. */
7262 if (!cp_parser_error_occurred (parser))
7265 tree asm_specification;
7267 cp_declarator *declarator;
7268 tree initializer = NULL_TREE;
7270 /* Parse the declarator. */
7271 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
7272 /*ctor_dtor_or_conv_p=*/NULL,
7273 /*parenthesized_p=*/NULL,
7274 /*member_p=*/false);
7275 /* Parse the attributes. */
7276 attributes = cp_parser_attributes_opt (parser);
7277 /* Parse the asm-specification. */
7278 asm_specification = cp_parser_asm_specification_opt (parser);
7279 /* If the next token is not an `=' or '{', then we might still be
7280 looking at an expression. For example:
7284 looks like a decl-specifier-seq and a declarator -- but then
7285 there is no `=', so this is an expression. */
7286 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
7287 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
7288 cp_parser_simulate_error (parser);
7290 /* If we did see an `=' or '{', then we are looking at a declaration
7292 if (cp_parser_parse_definitely (parser))
7295 bool non_constant_p;
7296 bool flags = LOOKUP_ONLYCONVERTING;
7298 /* Create the declaration. */
7299 decl = start_decl (declarator, &type_specifiers,
7300 /*initialized_p=*/true,
7301 attributes, /*prefix_attributes=*/NULL_TREE,
7304 /* Parse the initializer. */
7305 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7307 initializer = cp_parser_braced_list (parser, &non_constant_p);
7308 CONSTRUCTOR_IS_DIRECT_INIT (initializer) = 1;
7313 /* Consume the `='. */
7314 cp_lexer_consume_token (parser->lexer);
7315 initializer = cp_parser_initializer_clause (parser, &non_constant_p);
7317 if (BRACE_ENCLOSED_INITIALIZER_P (initializer))
7318 maybe_warn_cpp0x ("extended initializer lists");
7320 if (!non_constant_p)
7321 initializer = fold_non_dependent_expr (initializer);
7323 /* Process the initializer. */
7324 cp_finish_decl (decl,
7325 initializer, !non_constant_p,
7330 pop_scope (pushed_scope);
7332 return convert_from_reference (decl);
7335 /* If we didn't even get past the declarator successfully, we are
7336 definitely not looking at a declaration. */
7338 cp_parser_abort_tentative_parse (parser);
7340 /* Otherwise, we are looking at an expression. */
7341 return cp_parser_expression (parser, /*cast_p=*/false);
7344 /* We check for a ) immediately followed by ; with no whitespacing
7345 between. This is used to issue a warning for:
7353 as the semicolon is probably extraneous.
7355 On parse errors, the next token might not be a ), so do nothing in
7359 check_empty_body (cp_parser* parser, const char* type)
7362 cp_token *close_paren;
7363 expanded_location close_loc;
7364 expanded_location semi_loc;
7366 close_paren = cp_lexer_peek_token (parser->lexer);
7367 if (close_paren->type != CPP_CLOSE_PAREN)
7370 close_loc = expand_location (close_paren->location);
7371 token = cp_lexer_peek_nth_token (parser->lexer, 2);
7373 if (token->type != CPP_SEMICOLON
7374 || (token->flags & PREV_WHITE))
7377 semi_loc = expand_location (token->location);
7378 if (close_loc.line == semi_loc.line
7379 && close_loc.column+1 == semi_loc.column)
7380 warning (OPT_Wempty_body,
7381 "suggest a space before %<;%> or explicit braces around empty "
7382 "body in %<%s%> statement",
7386 /* Parse an iteration-statement.
7388 iteration-statement:
7389 while ( condition ) statement
7390 do statement while ( expression ) ;
7391 for ( for-init-statement condition [opt] ; expression [opt] )
7394 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
7397 cp_parser_iteration_statement (cp_parser* parser)
7402 unsigned char in_statement;
7404 /* Peek at the next token. */
7405 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
7407 return error_mark_node;
7409 /* Remember whether or not we are already within an iteration
7411 in_statement = parser->in_statement;
7413 /* See what kind of keyword it is. */
7414 keyword = token->keyword;
7421 /* Begin the while-statement. */
7422 statement = begin_while_stmt ();
7423 /* Look for the `('. */
7424 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
7425 /* Parse the condition. */
7426 condition = cp_parser_condition (parser);
7427 finish_while_stmt_cond (condition, statement);
7428 check_empty_body (parser, "while");
7429 /* Look for the `)'. */
7430 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
7431 /* Parse the dependent statement. */
7432 parser->in_statement = IN_ITERATION_STMT;
7433 cp_parser_already_scoped_statement (parser);
7434 parser->in_statement = in_statement;
7435 /* We're done with the while-statement. */
7436 finish_while_stmt (statement);
7444 /* Begin the do-statement. */
7445 statement = begin_do_stmt ();
7446 /* Parse the body of the do-statement. */
7447 parser->in_statement = IN_ITERATION_STMT;
7448 cp_parser_implicitly_scoped_statement (parser, NULL);
7449 parser->in_statement = in_statement;
7450 finish_do_body (statement);
7451 /* Look for the `while' keyword. */
7452 cp_parser_require_keyword (parser, RID_WHILE, "%<while%>");
7453 /* Look for the `('. */
7454 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
7455 /* Parse the expression. */
7456 expression = cp_parser_expression (parser, /*cast_p=*/false);
7457 /* We're done with the do-statement. */
7458 finish_do_stmt (expression, statement);
7459 /* Look for the `)'. */
7460 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
7461 /* Look for the `;'. */
7462 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7468 tree condition = NULL_TREE;
7469 tree expression = NULL_TREE;
7471 /* Begin the for-statement. */
7472 statement = begin_for_stmt ();
7473 /* Look for the `('. */
7474 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
7475 /* Parse the initialization. */
7476 cp_parser_for_init_statement (parser);
7477 finish_for_init_stmt (statement);
7479 /* If there's a condition, process it. */
7480 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7481 condition = cp_parser_condition (parser);
7482 finish_for_cond (condition, statement);
7483 /* Look for the `;'. */
7484 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7486 /* If there's an expression, process it. */
7487 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
7488 expression = cp_parser_expression (parser, /*cast_p=*/false);
7489 finish_for_expr (expression, statement);
7490 check_empty_body (parser, "for");
7491 /* Look for the `)'. */
7492 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
7494 /* Parse the body of the for-statement. */
7495 parser->in_statement = IN_ITERATION_STMT;
7496 cp_parser_already_scoped_statement (parser);
7497 parser->in_statement = in_statement;
7499 /* We're done with the for-statement. */
7500 finish_for_stmt (statement);
7505 cp_parser_error (parser, "expected iteration-statement");
7506 statement = error_mark_node;
7513 /* Parse a for-init-statement.
7516 expression-statement
7517 simple-declaration */
7520 cp_parser_for_init_statement (cp_parser* parser)
7522 /* If the next token is a `;', then we have an empty
7523 expression-statement. Grammatically, this is also a
7524 simple-declaration, but an invalid one, because it does not
7525 declare anything. Therefore, if we did not handle this case
7526 specially, we would issue an error message about an invalid
7528 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7530 /* We're going to speculatively look for a declaration, falling back
7531 to an expression, if necessary. */
7532 cp_parser_parse_tentatively (parser);
7533 /* Parse the declaration. */
7534 cp_parser_simple_declaration (parser,
7535 /*function_definition_allowed_p=*/false);
7536 /* If the tentative parse failed, then we shall need to look for an
7537 expression-statement. */
7538 if (cp_parser_parse_definitely (parser))
7542 cp_parser_expression_statement (parser, false);
7545 /* Parse a jump-statement.
7550 return expression [opt] ;
7551 return braced-init-list ;
7559 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
7562 cp_parser_jump_statement (cp_parser* parser)
7564 tree statement = error_mark_node;
7567 unsigned char in_statement;
7569 /* Peek at the next token. */
7570 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
7572 return error_mark_node;
7574 /* See what kind of keyword it is. */
7575 keyword = token->keyword;
7579 in_statement = parser->in_statement & ~IN_IF_STMT;
7580 switch (in_statement)
7583 error ("%Hbreak statement not within loop or switch", &token->location);
7586 gcc_assert ((in_statement & IN_SWITCH_STMT)
7587 || in_statement == IN_ITERATION_STMT);
7588 statement = finish_break_stmt ();
7591 error ("%Hinvalid exit from OpenMP structured block", &token->location);
7594 error ("%Hbreak statement used with OpenMP for loop", &token->location);
7597 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7601 switch (parser->in_statement & ~(IN_SWITCH_STMT | IN_IF_STMT))
7604 error ("%Hcontinue statement not within a loop", &token->location);
7606 case IN_ITERATION_STMT:
7608 statement = finish_continue_stmt ();
7611 error ("%Hinvalid exit from OpenMP structured block", &token->location);
7616 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7622 bool expr_non_constant_p;
7624 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7626 maybe_warn_cpp0x ("extended initializer lists");
7627 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
7629 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7630 expr = cp_parser_expression (parser, /*cast_p=*/false);
7632 /* If the next token is a `;', then there is no
7635 /* Build the return-statement. */
7636 statement = finish_return_stmt (expr);
7637 /* Look for the final `;'. */
7638 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7643 /* Create the goto-statement. */
7644 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
7646 /* Issue a warning about this use of a GNU extension. */
7647 pedwarn (token->location, OPT_pedantic, "ISO C++ forbids computed gotos");
7648 /* Consume the '*' token. */
7649 cp_lexer_consume_token (parser->lexer);
7650 /* Parse the dependent expression. */
7651 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false));
7654 finish_goto_stmt (cp_parser_identifier (parser));
7655 /* Look for the final `;'. */
7656 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
7660 cp_parser_error (parser, "expected jump-statement");
7667 /* Parse a declaration-statement.
7669 declaration-statement:
7670 block-declaration */
7673 cp_parser_declaration_statement (cp_parser* parser)
7677 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7678 p = obstack_alloc (&declarator_obstack, 0);
7680 /* Parse the block-declaration. */
7681 cp_parser_block_declaration (parser, /*statement_p=*/true);
7683 /* Free any declarators allocated. */
7684 obstack_free (&declarator_obstack, p);
7686 /* Finish off the statement. */
7690 /* Some dependent statements (like `if (cond) statement'), are
7691 implicitly in their own scope. In other words, if the statement is
7692 a single statement (as opposed to a compound-statement), it is
7693 none-the-less treated as if it were enclosed in braces. Any
7694 declarations appearing in the dependent statement are out of scope
7695 after control passes that point. This function parses a statement,
7696 but ensures that is in its own scope, even if it is not a
7699 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7700 is a (possibly labeled) if statement which is not enclosed in
7701 braces and has an else clause. This is used to implement
7704 Returns the new statement. */
7707 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
7714 /* Mark if () ; with a special NOP_EXPR. */
7715 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7717 cp_lexer_consume_token (parser->lexer);
7718 statement = add_stmt (build_empty_stmt ());
7720 /* if a compound is opened, we simply parse the statement directly. */
7721 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7722 statement = cp_parser_compound_statement (parser, NULL, false);
7723 /* If the token is not a `{', then we must take special action. */
7726 /* Create a compound-statement. */
7727 statement = begin_compound_stmt (0);
7728 /* Parse the dependent-statement. */
7729 cp_parser_statement (parser, NULL_TREE, false, if_p);
7730 /* Finish the dummy compound-statement. */
7731 finish_compound_stmt (statement);
7734 /* Return the statement. */
7738 /* For some dependent statements (like `while (cond) statement'), we
7739 have already created a scope. Therefore, even if the dependent
7740 statement is a compound-statement, we do not want to create another
7744 cp_parser_already_scoped_statement (cp_parser* parser)
7746 /* If the token is a `{', then we must take special action. */
7747 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
7748 cp_parser_statement (parser, NULL_TREE, false, NULL);
7751 /* Avoid calling cp_parser_compound_statement, so that we
7752 don't create a new scope. Do everything else by hand. */
7753 cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>");
7754 cp_parser_statement_seq_opt (parser, NULL_TREE);
7755 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
7759 /* Declarations [gram.dcl.dcl] */
7761 /* Parse an optional declaration-sequence.
7765 declaration-seq declaration */
7768 cp_parser_declaration_seq_opt (cp_parser* parser)
7774 token = cp_lexer_peek_token (parser->lexer);
7776 if (token->type == CPP_CLOSE_BRACE
7777 || token->type == CPP_EOF
7778 || token->type == CPP_PRAGMA_EOL)
7781 if (token->type == CPP_SEMICOLON)
7783 /* A declaration consisting of a single semicolon is
7784 invalid. Allow it unless we're being pedantic. */
7785 cp_lexer_consume_token (parser->lexer);
7786 if (!in_system_header)
7787 pedwarn (input_location, OPT_pedantic, "extra %<;%>");
7791 /* If we're entering or exiting a region that's implicitly
7792 extern "C", modify the lang context appropriately. */
7793 if (!parser->implicit_extern_c && token->implicit_extern_c)
7795 push_lang_context (lang_name_c);
7796 parser->implicit_extern_c = true;
7798 else if (parser->implicit_extern_c && !token->implicit_extern_c)
7800 pop_lang_context ();
7801 parser->implicit_extern_c = false;
7804 if (token->type == CPP_PRAGMA)
7806 /* A top-level declaration can consist solely of a #pragma.
7807 A nested declaration cannot, so this is done here and not
7808 in cp_parser_declaration. (A #pragma at block scope is
7809 handled in cp_parser_statement.) */
7810 cp_parser_pragma (parser, pragma_external);
7814 /* Parse the declaration itself. */
7815 cp_parser_declaration (parser);
7819 /* Parse a declaration.
7824 template-declaration
7825 explicit-instantiation
7826 explicit-specialization
7827 linkage-specification
7828 namespace-definition
7833 __extension__ declaration */
7836 cp_parser_declaration (cp_parser* parser)
7843 /* Check for the `__extension__' keyword. */
7844 if (cp_parser_extension_opt (parser, &saved_pedantic))
7846 /* Parse the qualified declaration. */
7847 cp_parser_declaration (parser);
7848 /* Restore the PEDANTIC flag. */
7849 pedantic = saved_pedantic;
7854 /* Try to figure out what kind of declaration is present. */
7855 token1 = *cp_lexer_peek_token (parser->lexer);
7857 if (token1.type != CPP_EOF)
7858 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
7861 token2.type = CPP_EOF;
7862 token2.keyword = RID_MAX;
7865 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7866 p = obstack_alloc (&declarator_obstack, 0);
7868 /* If the next token is `extern' and the following token is a string
7869 literal, then we have a linkage specification. */
7870 if (token1.keyword == RID_EXTERN
7871 && cp_parser_is_string_literal (&token2))
7872 cp_parser_linkage_specification (parser);
7873 /* If the next token is `template', then we have either a template
7874 declaration, an explicit instantiation, or an explicit
7876 else if (token1.keyword == RID_TEMPLATE)
7878 /* `template <>' indicates a template specialization. */
7879 if (token2.type == CPP_LESS
7880 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
7881 cp_parser_explicit_specialization (parser);
7882 /* `template <' indicates a template declaration. */
7883 else if (token2.type == CPP_LESS)
7884 cp_parser_template_declaration (parser, /*member_p=*/false);
7885 /* Anything else must be an explicit instantiation. */
7887 cp_parser_explicit_instantiation (parser);
7889 /* If the next token is `export', then we have a template
7891 else if (token1.keyword == RID_EXPORT)
7892 cp_parser_template_declaration (parser, /*member_p=*/false);
7893 /* If the next token is `extern', 'static' or 'inline' and the one
7894 after that is `template', we have a GNU extended explicit
7895 instantiation directive. */
7896 else if (cp_parser_allow_gnu_extensions_p (parser)
7897 && (token1.keyword == RID_EXTERN
7898 || token1.keyword == RID_STATIC
7899 || token1.keyword == RID_INLINE)
7900 && token2.keyword == RID_TEMPLATE)
7901 cp_parser_explicit_instantiation (parser);
7902 /* If the next token is `namespace', check for a named or unnamed
7903 namespace definition. */
7904 else if (token1.keyword == RID_NAMESPACE
7905 && (/* A named namespace definition. */
7906 (token2.type == CPP_NAME
7907 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
7909 /* An unnamed namespace definition. */
7910 || token2.type == CPP_OPEN_BRACE
7911 || token2.keyword == RID_ATTRIBUTE))
7912 cp_parser_namespace_definition (parser);
7913 /* An inline (associated) namespace definition. */
7914 else if (token1.keyword == RID_INLINE
7915 && token2.keyword == RID_NAMESPACE)
7916 cp_parser_namespace_definition (parser);
7917 /* Objective-C++ declaration/definition. */
7918 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
7919 cp_parser_objc_declaration (parser);
7920 /* We must have either a block declaration or a function
7923 /* Try to parse a block-declaration, or a function-definition. */
7924 cp_parser_block_declaration (parser, /*statement_p=*/false);
7926 /* Free any declarators allocated. */
7927 obstack_free (&declarator_obstack, p);
7930 /* Parse a block-declaration.
7935 namespace-alias-definition
7942 __extension__ block-declaration
7947 static_assert-declaration
7949 If STATEMENT_P is TRUE, then this block-declaration is occurring as
7950 part of a declaration-statement. */
7953 cp_parser_block_declaration (cp_parser *parser,
7959 /* Check for the `__extension__' keyword. */
7960 if (cp_parser_extension_opt (parser, &saved_pedantic))
7962 /* Parse the qualified declaration. */
7963 cp_parser_block_declaration (parser, statement_p);
7964 /* Restore the PEDANTIC flag. */
7965 pedantic = saved_pedantic;
7970 /* Peek at the next token to figure out which kind of declaration is
7972 token1 = cp_lexer_peek_token (parser->lexer);
7974 /* If the next keyword is `asm', we have an asm-definition. */
7975 if (token1->keyword == RID_ASM)
7978 cp_parser_commit_to_tentative_parse (parser);
7979 cp_parser_asm_definition (parser);
7981 /* If the next keyword is `namespace', we have a
7982 namespace-alias-definition. */
7983 else if (token1->keyword == RID_NAMESPACE)
7984 cp_parser_namespace_alias_definition (parser);
7985 /* If the next keyword is `using', we have either a
7986 using-declaration or a using-directive. */
7987 else if (token1->keyword == RID_USING)
7992 cp_parser_commit_to_tentative_parse (parser);
7993 /* If the token after `using' is `namespace', then we have a
7995 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
7996 if (token2->keyword == RID_NAMESPACE)
7997 cp_parser_using_directive (parser);
7998 /* Otherwise, it's a using-declaration. */
8000 cp_parser_using_declaration (parser,
8001 /*access_declaration_p=*/false);
8003 /* If the next keyword is `__label__' we have a misplaced label
8005 else if (token1->keyword == RID_LABEL)
8007 cp_lexer_consume_token (parser->lexer);
8008 error ("%H%<__label__%> not at the beginning of a block", &token1->location);
8009 cp_parser_skip_to_end_of_statement (parser);
8010 /* If the next token is now a `;', consume it. */
8011 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
8012 cp_lexer_consume_token (parser->lexer);
8014 /* If the next token is `static_assert' we have a static assertion. */
8015 else if (token1->keyword == RID_STATIC_ASSERT)
8016 cp_parser_static_assert (parser, /*member_p=*/false);
8017 /* Anything else must be a simple-declaration. */
8019 cp_parser_simple_declaration (parser, !statement_p);
8022 /* Parse a simple-declaration.
8025 decl-specifier-seq [opt] init-declarator-list [opt] ;
8027 init-declarator-list:
8029 init-declarator-list , init-declarator
8031 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
8032 function-definition as a simple-declaration. */
8035 cp_parser_simple_declaration (cp_parser* parser,
8036 bool function_definition_allowed_p)
8038 cp_decl_specifier_seq decl_specifiers;
8039 int declares_class_or_enum;
8040 bool saw_declarator;
8042 /* Defer access checks until we know what is being declared; the
8043 checks for names appearing in the decl-specifier-seq should be
8044 done as if we were in the scope of the thing being declared. */
8045 push_deferring_access_checks (dk_deferred);
8047 /* Parse the decl-specifier-seq. We have to keep track of whether
8048 or not the decl-specifier-seq declares a named class or
8049 enumeration type, since that is the only case in which the
8050 init-declarator-list is allowed to be empty.
8054 In a simple-declaration, the optional init-declarator-list can be
8055 omitted only when declaring a class or enumeration, that is when
8056 the decl-specifier-seq contains either a class-specifier, an
8057 elaborated-type-specifier, or an enum-specifier. */
8058 cp_parser_decl_specifier_seq (parser,
8059 CP_PARSER_FLAGS_OPTIONAL,
8061 &declares_class_or_enum);
8062 /* We no longer need to defer access checks. */
8063 stop_deferring_access_checks ();
8065 /* In a block scope, a valid declaration must always have a
8066 decl-specifier-seq. By not trying to parse declarators, we can
8067 resolve the declaration/expression ambiguity more quickly. */
8068 if (!function_definition_allowed_p
8069 && !decl_specifiers.any_specifiers_p)
8071 cp_parser_error (parser, "expected declaration");
8075 /* If the next two tokens are both identifiers, the code is
8076 erroneous. The usual cause of this situation is code like:
8080 where "T" should name a type -- but does not. */
8081 if (!decl_specifiers.type
8082 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
8084 /* If parsing tentatively, we should commit; we really are
8085 looking at a declaration. */
8086 cp_parser_commit_to_tentative_parse (parser);
8091 /* If we have seen at least one decl-specifier, and the next token
8092 is not a parenthesis, then we must be looking at a declaration.
8093 (After "int (" we might be looking at a functional cast.) */
8094 if (decl_specifiers.any_specifiers_p
8095 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN)
8096 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
8097 cp_parser_commit_to_tentative_parse (parser);
8099 /* Keep going until we hit the `;' at the end of the simple
8101 saw_declarator = false;
8102 while (cp_lexer_next_token_is_not (parser->lexer,
8106 bool function_definition_p;
8111 /* If we are processing next declarator, coma is expected */
8112 token = cp_lexer_peek_token (parser->lexer);
8113 gcc_assert (token->type == CPP_COMMA);
8114 cp_lexer_consume_token (parser->lexer);
8117 saw_declarator = true;
8119 /* Parse the init-declarator. */
8120 decl = cp_parser_init_declarator (parser, &decl_specifiers,
8122 function_definition_allowed_p,
8124 declares_class_or_enum,
8125 &function_definition_p);
8126 /* If an error occurred while parsing tentatively, exit quickly.
8127 (That usually happens when in the body of a function; each
8128 statement is treated as a declaration-statement until proven
8130 if (cp_parser_error_occurred (parser))
8132 /* Handle function definitions specially. */
8133 if (function_definition_p)
8135 /* If the next token is a `,', then we are probably
8136 processing something like:
8140 which is erroneous. */
8141 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
8143 cp_token *token = cp_lexer_peek_token (parser->lexer);
8144 error ("%Hmixing declarations and function-definitions is forbidden",
8147 /* Otherwise, we're done with the list of declarators. */
8150 pop_deferring_access_checks ();
8154 /* The next token should be either a `,' or a `;'. */
8155 token = cp_lexer_peek_token (parser->lexer);
8156 /* If it's a `,', there are more declarators to come. */
8157 if (token->type == CPP_COMMA)
8158 /* will be consumed next time around */;
8159 /* If it's a `;', we are done. */
8160 else if (token->type == CPP_SEMICOLON)
8162 /* Anything else is an error. */
8165 /* If we have already issued an error message we don't need
8166 to issue another one. */
8167 if (decl != error_mark_node
8168 || cp_parser_uncommitted_to_tentative_parse_p (parser))
8169 cp_parser_error (parser, "expected %<,%> or %<;%>");
8170 /* Skip tokens until we reach the end of the statement. */
8171 cp_parser_skip_to_end_of_statement (parser);
8172 /* If the next token is now a `;', consume it. */
8173 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
8174 cp_lexer_consume_token (parser->lexer);
8177 /* After the first time around, a function-definition is not
8178 allowed -- even if it was OK at first. For example:
8183 function_definition_allowed_p = false;
8186 /* Issue an error message if no declarators are present, and the
8187 decl-specifier-seq does not itself declare a class or
8189 if (!saw_declarator)
8191 if (cp_parser_declares_only_class_p (parser))
8192 shadow_tag (&decl_specifiers);
8193 /* Perform any deferred access checks. */
8194 perform_deferred_access_checks ();
8197 /* Consume the `;'. */
8198 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
8201 pop_deferring_access_checks ();
8204 /* Parse a decl-specifier-seq.
8207 decl-specifier-seq [opt] decl-specifier
8210 storage-class-specifier
8221 Set *DECL_SPECS to a representation of the decl-specifier-seq.
8223 The parser flags FLAGS is used to control type-specifier parsing.
8225 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
8228 1: one of the decl-specifiers is an elaborated-type-specifier
8229 (i.e., a type declaration)
8230 2: one of the decl-specifiers is an enum-specifier or a
8231 class-specifier (i.e., a type definition)
8236 cp_parser_decl_specifier_seq (cp_parser* parser,
8237 cp_parser_flags flags,
8238 cp_decl_specifier_seq *decl_specs,
8239 int* declares_class_or_enum)
8241 bool constructor_possible_p = !parser->in_declarator_p;
8242 cp_token *start_token = NULL;
8244 /* Clear DECL_SPECS. */
8245 clear_decl_specs (decl_specs);
8247 /* Assume no class or enumeration type is declared. */
8248 *declares_class_or_enum = 0;
8250 /* Keep reading specifiers until there are no more to read. */
8254 bool found_decl_spec;
8257 /* Peek at the next token. */
8258 token = cp_lexer_peek_token (parser->lexer);
8260 /* Save the first token of the decl spec list for error
8263 start_token = token;
8264 /* Handle attributes. */
8265 if (token->keyword == RID_ATTRIBUTE)
8267 /* Parse the attributes. */
8268 decl_specs->attributes
8269 = chainon (decl_specs->attributes,
8270 cp_parser_attributes_opt (parser));
8273 /* Assume we will find a decl-specifier keyword. */
8274 found_decl_spec = true;
8275 /* If the next token is an appropriate keyword, we can simply
8276 add it to the list. */
8277 switch (token->keyword)
8282 if (!at_class_scope_p ())
8284 error ("%H%<friend%> used outside of class", &token->location);
8285 cp_lexer_purge_token (parser->lexer);
8289 ++decl_specs->specs[(int) ds_friend];
8290 /* Consume the token. */
8291 cp_lexer_consume_token (parser->lexer);
8295 /* function-specifier:
8302 cp_parser_function_specifier_opt (parser, decl_specs);
8308 ++decl_specs->specs[(int) ds_typedef];
8309 /* Consume the token. */
8310 cp_lexer_consume_token (parser->lexer);
8311 /* A constructor declarator cannot appear in a typedef. */
8312 constructor_possible_p = false;
8313 /* The "typedef" keyword can only occur in a declaration; we
8314 may as well commit at this point. */
8315 cp_parser_commit_to_tentative_parse (parser);
8317 if (decl_specs->storage_class != sc_none)
8318 decl_specs->conflicting_specifiers_p = true;
8321 /* storage-class-specifier:
8331 if (cxx_dialect == cxx98)
8333 /* Consume the token. */
8334 cp_lexer_consume_token (parser->lexer);
8336 /* Complain about `auto' as a storage specifier, if
8337 we're complaining about C++0x compatibility. */
8340 "%H%<auto%> will change meaning in C++0x; please remove it",
8343 /* Set the storage class anyway. */
8344 cp_parser_set_storage_class (parser, decl_specs, RID_AUTO,
8348 /* C++0x auto type-specifier. */
8349 found_decl_spec = false;
8356 /* Consume the token. */
8357 cp_lexer_consume_token (parser->lexer);
8358 cp_parser_set_storage_class (parser, decl_specs, token->keyword,
8362 /* Consume the token. */
8363 cp_lexer_consume_token (parser->lexer);
8364 ++decl_specs->specs[(int) ds_thread];
8368 /* We did not yet find a decl-specifier yet. */
8369 found_decl_spec = false;
8373 /* Constructors are a special case. The `S' in `S()' is not a
8374 decl-specifier; it is the beginning of the declarator. */
8377 && constructor_possible_p
8378 && (cp_parser_constructor_declarator_p
8379 (parser, decl_specs->specs[(int) ds_friend] != 0)));
8381 /* If we don't have a DECL_SPEC yet, then we must be looking at
8382 a type-specifier. */
8383 if (!found_decl_spec && !constructor_p)
8385 int decl_spec_declares_class_or_enum;
8386 bool is_cv_qualifier;
8390 = cp_parser_type_specifier (parser, flags,
8392 /*is_declaration=*/true,
8393 &decl_spec_declares_class_or_enum,
8395 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
8397 /* If this type-specifier referenced a user-defined type
8398 (a typedef, class-name, etc.), then we can't allow any
8399 more such type-specifiers henceforth.
8403 The longest sequence of decl-specifiers that could
8404 possibly be a type name is taken as the
8405 decl-specifier-seq of a declaration. The sequence shall
8406 be self-consistent as described below.
8410 As a general rule, at most one type-specifier is allowed
8411 in the complete decl-specifier-seq of a declaration. The
8412 only exceptions are the following:
8414 -- const or volatile can be combined with any other
8417 -- signed or unsigned can be combined with char, long,
8425 void g (const int Pc);
8427 Here, Pc is *not* part of the decl-specifier seq; it's
8428 the declarator. Therefore, once we see a type-specifier
8429 (other than a cv-qualifier), we forbid any additional
8430 user-defined types. We *do* still allow things like `int
8431 int' to be considered a decl-specifier-seq, and issue the
8432 error message later. */
8433 if (type_spec && !is_cv_qualifier)
8434 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
8435 /* A constructor declarator cannot follow a type-specifier. */
8438 constructor_possible_p = false;
8439 found_decl_spec = true;
8443 /* If we still do not have a DECL_SPEC, then there are no more
8445 if (!found_decl_spec)
8448 decl_specs->any_specifiers_p = true;
8449 /* After we see one decl-specifier, further decl-specifiers are
8451 flags |= CP_PARSER_FLAGS_OPTIONAL;
8454 cp_parser_check_decl_spec (decl_specs, start_token->location);
8456 /* Don't allow a friend specifier with a class definition. */
8457 if (decl_specs->specs[(int) ds_friend] != 0
8458 && (*declares_class_or_enum & 2))
8459 error ("%Hclass definition may not be declared a friend",
8460 &start_token->location);
8463 /* Parse an (optional) storage-class-specifier.
8465 storage-class-specifier:
8474 storage-class-specifier:
8477 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
8480 cp_parser_storage_class_specifier_opt (cp_parser* parser)
8482 switch (cp_lexer_peek_token (parser->lexer)->keyword)
8485 if (cxx_dialect != cxx98)
8487 /* Fall through for C++98. */
8494 /* Consume the token. */
8495 return cp_lexer_consume_token (parser->lexer)->u.value;
8502 /* Parse an (optional) function-specifier.
8509 Returns an IDENTIFIER_NODE corresponding to the keyword used.
8510 Updates DECL_SPECS, if it is non-NULL. */
8513 cp_parser_function_specifier_opt (cp_parser* parser,
8514 cp_decl_specifier_seq *decl_specs)
8516 cp_token *token = cp_lexer_peek_token (parser->lexer);
8517 switch (token->keyword)
8521 ++decl_specs->specs[(int) ds_inline];
8525 /* 14.5.2.3 [temp.mem]
8527 A member function template shall not be virtual. */
8528 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8529 error ("%Htemplates may not be %<virtual%>", &token->location);
8530 else if (decl_specs)
8531 ++decl_specs->specs[(int) ds_virtual];
8536 ++decl_specs->specs[(int) ds_explicit];
8543 /* Consume the token. */
8544 return cp_lexer_consume_token (parser->lexer)->u.value;
8547 /* Parse a linkage-specification.
8549 linkage-specification:
8550 extern string-literal { declaration-seq [opt] }
8551 extern string-literal declaration */
8554 cp_parser_linkage_specification (cp_parser* parser)
8558 /* Look for the `extern' keyword. */
8559 cp_parser_require_keyword (parser, RID_EXTERN, "%<extern%>");
8561 /* Look for the string-literal. */
8562 linkage = cp_parser_string_literal (parser, false, false);
8564 /* Transform the literal into an identifier. If the literal is a
8565 wide-character string, or contains embedded NULs, then we can't
8566 handle it as the user wants. */
8567 if (strlen (TREE_STRING_POINTER (linkage))
8568 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
8570 cp_parser_error (parser, "invalid linkage-specification");
8571 /* Assume C++ linkage. */
8572 linkage = lang_name_cplusplus;
8575 linkage = get_identifier (TREE_STRING_POINTER (linkage));
8577 /* We're now using the new linkage. */
8578 push_lang_context (linkage);
8580 /* If the next token is a `{', then we're using the first
8582 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
8584 /* Consume the `{' token. */
8585 cp_lexer_consume_token (parser->lexer);
8586 /* Parse the declarations. */
8587 cp_parser_declaration_seq_opt (parser);
8588 /* Look for the closing `}'. */
8589 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
8591 /* Otherwise, there's just one declaration. */
8594 bool saved_in_unbraced_linkage_specification_p;
8596 saved_in_unbraced_linkage_specification_p
8597 = parser->in_unbraced_linkage_specification_p;
8598 parser->in_unbraced_linkage_specification_p = true;
8599 cp_parser_declaration (parser);
8600 parser->in_unbraced_linkage_specification_p
8601 = saved_in_unbraced_linkage_specification_p;
8604 /* We're done with the linkage-specification. */
8605 pop_lang_context ();
8608 /* Parse a static_assert-declaration.
8610 static_assert-declaration:
8611 static_assert ( constant-expression , string-literal ) ;
8613 If MEMBER_P, this static_assert is a class member. */
8616 cp_parser_static_assert(cp_parser *parser, bool member_p)
8621 location_t saved_loc;
8623 /* Peek at the `static_assert' token so we can keep track of exactly
8624 where the static assertion started. */
8625 token = cp_lexer_peek_token (parser->lexer);
8626 saved_loc = token->location;
8628 /* Look for the `static_assert' keyword. */
8629 if (!cp_parser_require_keyword (parser, RID_STATIC_ASSERT,
8630 "%<static_assert%>"))
8633 /* We know we are in a static assertion; commit to any tentative
8635 if (cp_parser_parsing_tentatively (parser))
8636 cp_parser_commit_to_tentative_parse (parser);
8638 /* Parse the `(' starting the static assertion condition. */
8639 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
8641 /* Parse the constant-expression. */
8643 cp_parser_constant_expression (parser,
8644 /*allow_non_constant_p=*/false,
8645 /*non_constant_p=*/NULL);
8647 /* Parse the separating `,'. */
8648 cp_parser_require (parser, CPP_COMMA, "%<,%>");
8650 /* Parse the string-literal message. */
8651 message = cp_parser_string_literal (parser,
8652 /*translate=*/false,
8655 /* A `)' completes the static assertion. */
8656 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
8657 cp_parser_skip_to_closing_parenthesis (parser,
8658 /*recovering=*/true,
8660 /*consume_paren=*/true);
8662 /* A semicolon terminates the declaration. */
8663 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
8665 /* Complete the static assertion, which may mean either processing
8666 the static assert now or saving it for template instantiation. */
8667 finish_static_assert (condition, message, saved_loc, member_p);
8670 /* Parse a `decltype' type. Returns the type.
8672 simple-type-specifier:
8673 decltype ( expression ) */
8676 cp_parser_decltype (cp_parser *parser)
8679 bool id_expression_or_member_access_p = false;
8680 const char *saved_message;
8681 bool saved_integral_constant_expression_p;
8682 bool saved_non_integral_constant_expression_p;
8683 cp_token *id_expr_start_token;
8685 /* Look for the `decltype' token. */
8686 if (!cp_parser_require_keyword (parser, RID_DECLTYPE, "%<decltype%>"))
8687 return error_mark_node;
8689 /* Types cannot be defined in a `decltype' expression. Save away the
8691 saved_message = parser->type_definition_forbidden_message;
8693 /* And create the new one. */
8694 parser->type_definition_forbidden_message
8695 = "types may not be defined in %<decltype%> expressions";
8697 /* The restrictions on constant-expressions do not apply inside
8698 decltype expressions. */
8699 saved_integral_constant_expression_p
8700 = parser->integral_constant_expression_p;
8701 saved_non_integral_constant_expression_p
8702 = parser->non_integral_constant_expression_p;
8703 parser->integral_constant_expression_p = false;
8705 /* Do not actually evaluate the expression. */
8708 /* Parse the opening `('. */
8709 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
8710 return error_mark_node;
8712 /* First, try parsing an id-expression. */
8713 id_expr_start_token = cp_lexer_peek_token (parser->lexer);
8714 cp_parser_parse_tentatively (parser);
8715 expr = cp_parser_id_expression (parser,
8716 /*template_keyword_p=*/false,
8717 /*check_dependency_p=*/true,
8718 /*template_p=*/NULL,
8719 /*declarator_p=*/false,
8720 /*optional_p=*/false);
8722 if (!cp_parser_error_occurred (parser) && expr != error_mark_node)
8724 bool non_integral_constant_expression_p = false;
8725 tree id_expression = expr;
8727 const char *error_msg;
8729 if (TREE_CODE (expr) == IDENTIFIER_NODE)
8730 /* Lookup the name we got back from the id-expression. */
8731 expr = cp_parser_lookup_name (parser, expr,
8733 /*is_template=*/false,
8734 /*is_namespace=*/false,
8735 /*check_dependency=*/true,
8736 /*ambiguous_decls=*/NULL,
8737 id_expr_start_token->location);
8740 && expr != error_mark_node
8741 && TREE_CODE (expr) != TEMPLATE_ID_EXPR
8742 && TREE_CODE (expr) != TYPE_DECL
8743 && (TREE_CODE (expr) != BIT_NOT_EXPR
8744 || !TYPE_P (TREE_OPERAND (expr, 0)))
8745 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
8747 /* Complete lookup of the id-expression. */
8748 expr = (finish_id_expression
8749 (id_expression, expr, parser->scope, &idk,
8750 /*integral_constant_expression_p=*/false,
8751 /*allow_non_integral_constant_expression_p=*/true,
8752 &non_integral_constant_expression_p,
8753 /*template_p=*/false,
8755 /*address_p=*/false,
8756 /*template_arg_p=*/false,
8758 id_expr_start_token->location));
8760 if (expr == error_mark_node)
8761 /* We found an id-expression, but it was something that we
8762 should not have found. This is an error, not something
8763 we can recover from, so note that we found an
8764 id-expression and we'll recover as gracefully as
8766 id_expression_or_member_access_p = true;
8770 && expr != error_mark_node
8771 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
8772 /* We have an id-expression. */
8773 id_expression_or_member_access_p = true;
8776 if (!id_expression_or_member_access_p)
8778 /* Abort the id-expression parse. */
8779 cp_parser_abort_tentative_parse (parser);
8781 /* Parsing tentatively, again. */
8782 cp_parser_parse_tentatively (parser);
8784 /* Parse a class member access. */
8785 expr = cp_parser_postfix_expression (parser, /*address_p=*/false,
8787 /*member_access_only_p=*/true);
8790 && expr != error_mark_node
8791 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
8792 /* We have an id-expression. */
8793 id_expression_or_member_access_p = true;
8796 if (id_expression_or_member_access_p)
8797 /* We have parsed the complete id-expression or member access. */
8798 cp_parser_parse_definitely (parser);
8801 /* Abort our attempt to parse an id-expression or member access
8803 cp_parser_abort_tentative_parse (parser);
8805 /* Parse a full expression. */
8806 expr = cp_parser_expression (parser, /*cast_p=*/false);
8809 /* Go back to evaluating expressions. */
8812 /* Restore the old message and the integral constant expression
8814 parser->type_definition_forbidden_message = saved_message;
8815 parser->integral_constant_expression_p
8816 = saved_integral_constant_expression_p;
8817 parser->non_integral_constant_expression_p
8818 = saved_non_integral_constant_expression_p;
8820 if (expr == error_mark_node)
8822 /* Skip everything up to the closing `)'. */
8823 cp_parser_skip_to_closing_parenthesis (parser, true, false,
8824 /*consume_paren=*/true);
8825 return error_mark_node;
8828 /* Parse to the closing `)'. */
8829 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
8831 cp_parser_skip_to_closing_parenthesis (parser, true, false,
8832 /*consume_paren=*/true);
8833 return error_mark_node;
8836 return finish_decltype_type (expr, id_expression_or_member_access_p);
8839 /* Special member functions [gram.special] */
8841 /* Parse a conversion-function-id.
8843 conversion-function-id:
8844 operator conversion-type-id
8846 Returns an IDENTIFIER_NODE representing the operator. */
8849 cp_parser_conversion_function_id (cp_parser* parser)
8853 tree saved_qualifying_scope;
8854 tree saved_object_scope;
8855 tree pushed_scope = NULL_TREE;
8857 /* Look for the `operator' token. */
8858 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "%<operator%>"))
8859 return error_mark_node;
8860 /* When we parse the conversion-type-id, the current scope will be
8861 reset. However, we need that information in able to look up the
8862 conversion function later, so we save it here. */
8863 saved_scope = parser->scope;
8864 saved_qualifying_scope = parser->qualifying_scope;
8865 saved_object_scope = parser->object_scope;
8866 /* We must enter the scope of the class so that the names of
8867 entities declared within the class are available in the
8868 conversion-type-id. For example, consider:
8875 S::operator I() { ... }
8877 In order to see that `I' is a type-name in the definition, we
8878 must be in the scope of `S'. */
8880 pushed_scope = push_scope (saved_scope);
8881 /* Parse the conversion-type-id. */
8882 type = cp_parser_conversion_type_id (parser);
8883 /* Leave the scope of the class, if any. */
8885 pop_scope (pushed_scope);
8886 /* Restore the saved scope. */
8887 parser->scope = saved_scope;
8888 parser->qualifying_scope = saved_qualifying_scope;
8889 parser->object_scope = saved_object_scope;
8890 /* If the TYPE is invalid, indicate failure. */
8891 if (type == error_mark_node)
8892 return error_mark_node;
8893 return mangle_conv_op_name_for_type (type);
8896 /* Parse a conversion-type-id:
8899 type-specifier-seq conversion-declarator [opt]
8901 Returns the TYPE specified. */
8904 cp_parser_conversion_type_id (cp_parser* parser)
8907 cp_decl_specifier_seq type_specifiers;
8908 cp_declarator *declarator;
8909 tree type_specified;
8911 /* Parse the attributes. */
8912 attributes = cp_parser_attributes_opt (parser);
8913 /* Parse the type-specifiers. */
8914 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
8916 /* If that didn't work, stop. */
8917 if (type_specifiers.type == error_mark_node)
8918 return error_mark_node;
8919 /* Parse the conversion-declarator. */
8920 declarator = cp_parser_conversion_declarator_opt (parser);
8922 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
8923 /*initialized=*/0, &attributes);
8925 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
8926 return type_specified;
8929 /* Parse an (optional) conversion-declarator.
8931 conversion-declarator:
8932 ptr-operator conversion-declarator [opt]
8936 static cp_declarator *
8937 cp_parser_conversion_declarator_opt (cp_parser* parser)
8939 enum tree_code code;
8941 cp_cv_quals cv_quals;
8943 /* We don't know if there's a ptr-operator next, or not. */
8944 cp_parser_parse_tentatively (parser);
8945 /* Try the ptr-operator. */
8946 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
8947 /* If it worked, look for more conversion-declarators. */
8948 if (cp_parser_parse_definitely (parser))
8950 cp_declarator *declarator;
8952 /* Parse another optional declarator. */
8953 declarator = cp_parser_conversion_declarator_opt (parser);
8955 return cp_parser_make_indirect_declarator
8956 (code, class_type, cv_quals, declarator);
8962 /* Parse an (optional) ctor-initializer.
8965 : mem-initializer-list
8967 Returns TRUE iff the ctor-initializer was actually present. */
8970 cp_parser_ctor_initializer_opt (cp_parser* parser)
8972 /* If the next token is not a `:', then there is no
8973 ctor-initializer. */
8974 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
8976 /* Do default initialization of any bases and members. */
8977 if (DECL_CONSTRUCTOR_P (current_function_decl))
8978 finish_mem_initializers (NULL_TREE);
8983 /* Consume the `:' token. */
8984 cp_lexer_consume_token (parser->lexer);
8985 /* And the mem-initializer-list. */
8986 cp_parser_mem_initializer_list (parser);
8991 /* Parse a mem-initializer-list.
8993 mem-initializer-list:
8994 mem-initializer ... [opt]
8995 mem-initializer ... [opt] , mem-initializer-list */
8998 cp_parser_mem_initializer_list (cp_parser* parser)
9000 tree mem_initializer_list = NULL_TREE;
9001 cp_token *token = cp_lexer_peek_token (parser->lexer);
9003 /* Let the semantic analysis code know that we are starting the
9004 mem-initializer-list. */
9005 if (!DECL_CONSTRUCTOR_P (current_function_decl))
9006 error ("%Honly constructors take base initializers",
9009 /* Loop through the list. */
9012 tree mem_initializer;
9014 token = cp_lexer_peek_token (parser->lexer);
9015 /* Parse the mem-initializer. */
9016 mem_initializer = cp_parser_mem_initializer (parser);
9017 /* If the next token is a `...', we're expanding member initializers. */
9018 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
9020 /* Consume the `...'. */
9021 cp_lexer_consume_token (parser->lexer);
9023 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
9024 can be expanded but members cannot. */
9025 if (mem_initializer != error_mark_node
9026 && !TYPE_P (TREE_PURPOSE (mem_initializer)))
9028 error ("%Hcannot expand initializer for member %<%D%>",
9029 &token->location, TREE_PURPOSE (mem_initializer));
9030 mem_initializer = error_mark_node;
9033 /* Construct the pack expansion type. */
9034 if (mem_initializer != error_mark_node)
9035 mem_initializer = make_pack_expansion (mem_initializer);
9037 /* Add it to the list, unless it was erroneous. */
9038 if (mem_initializer != error_mark_node)
9040 TREE_CHAIN (mem_initializer) = mem_initializer_list;
9041 mem_initializer_list = mem_initializer;
9043 /* If the next token is not a `,', we're done. */
9044 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9046 /* Consume the `,' token. */
9047 cp_lexer_consume_token (parser->lexer);
9050 /* Perform semantic analysis. */
9051 if (DECL_CONSTRUCTOR_P (current_function_decl))
9052 finish_mem_initializers (mem_initializer_list);
9055 /* Parse a mem-initializer.
9058 mem-initializer-id ( expression-list [opt] )
9059 mem-initializer-id braced-init-list
9064 ( expression-list [opt] )
9066 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
9067 class) or FIELD_DECL (for a non-static data member) to initialize;
9068 the TREE_VALUE is the expression-list. An empty initialization
9069 list is represented by void_list_node. */
9072 cp_parser_mem_initializer (cp_parser* parser)
9074 tree mem_initializer_id;
9075 tree expression_list;
9077 cp_token *token = cp_lexer_peek_token (parser->lexer);
9079 /* Find out what is being initialized. */
9080 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
9082 permerror (token->location,
9083 "anachronistic old-style base class initializer");
9084 mem_initializer_id = NULL_TREE;
9087 mem_initializer_id = cp_parser_mem_initializer_id (parser);
9088 member = expand_member_init (mem_initializer_id);
9089 if (member && !DECL_P (member))
9090 in_base_initializer = 1;
9092 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9094 bool expr_non_constant_p;
9095 maybe_warn_cpp0x ("extended initializer lists");
9096 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
9097 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
9098 expression_list = build_tree_list (NULL_TREE, expression_list);
9102 = cp_parser_parenthesized_expression_list (parser, false,
9104 /*allow_expansion_p=*/true,
9105 /*non_constant_p=*/NULL);
9106 if (expression_list == error_mark_node)
9107 return error_mark_node;
9108 if (!expression_list)
9109 expression_list = void_type_node;
9111 in_base_initializer = 0;
9113 return member ? build_tree_list (member, expression_list) : error_mark_node;
9116 /* Parse a mem-initializer-id.
9119 :: [opt] nested-name-specifier [opt] class-name
9122 Returns a TYPE indicating the class to be initializer for the first
9123 production. Returns an IDENTIFIER_NODE indicating the data member
9124 to be initialized for the second production. */
9127 cp_parser_mem_initializer_id (cp_parser* parser)
9129 bool global_scope_p;
9130 bool nested_name_specifier_p;
9131 bool template_p = false;
9134 cp_token *token = cp_lexer_peek_token (parser->lexer);
9136 /* `typename' is not allowed in this context ([temp.res]). */
9137 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
9139 error ("%Hkeyword %<typename%> not allowed in this context (a qualified "
9140 "member initializer is implicitly a type)",
9142 cp_lexer_consume_token (parser->lexer);
9144 /* Look for the optional `::' operator. */
9146 = (cp_parser_global_scope_opt (parser,
9147 /*current_scope_valid_p=*/false)
9149 /* Look for the optional nested-name-specifier. The simplest way to
9154 The keyword `typename' is not permitted in a base-specifier or
9155 mem-initializer; in these contexts a qualified name that
9156 depends on a template-parameter is implicitly assumed to be a
9159 is to assume that we have seen the `typename' keyword at this
9161 nested_name_specifier_p
9162 = (cp_parser_nested_name_specifier_opt (parser,
9163 /*typename_keyword_p=*/true,
9164 /*check_dependency_p=*/true,
9166 /*is_declaration=*/true)
9168 if (nested_name_specifier_p)
9169 template_p = cp_parser_optional_template_keyword (parser);
9170 /* If there is a `::' operator or a nested-name-specifier, then we
9171 are definitely looking for a class-name. */
9172 if (global_scope_p || nested_name_specifier_p)
9173 return cp_parser_class_name (parser,
9174 /*typename_keyword_p=*/true,
9175 /*template_keyword_p=*/template_p,
9177 /*check_dependency_p=*/true,
9178 /*class_head_p=*/false,
9179 /*is_declaration=*/true);
9180 /* Otherwise, we could also be looking for an ordinary identifier. */
9181 cp_parser_parse_tentatively (parser);
9182 /* Try a class-name. */
9183 id = cp_parser_class_name (parser,
9184 /*typename_keyword_p=*/true,
9185 /*template_keyword_p=*/false,
9187 /*check_dependency_p=*/true,
9188 /*class_head_p=*/false,
9189 /*is_declaration=*/true);
9190 /* If we found one, we're done. */
9191 if (cp_parser_parse_definitely (parser))
9193 /* Otherwise, look for an ordinary identifier. */
9194 return cp_parser_identifier (parser);
9197 /* Overloading [gram.over] */
9199 /* Parse an operator-function-id.
9201 operator-function-id:
9204 Returns an IDENTIFIER_NODE for the operator which is a
9205 human-readable spelling of the identifier, e.g., `operator +'. */
9208 cp_parser_operator_function_id (cp_parser* parser)
9210 /* Look for the `operator' keyword. */
9211 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "%<operator%>"))
9212 return error_mark_node;
9213 /* And then the name of the operator itself. */
9214 return cp_parser_operator (parser);
9217 /* Parse an operator.
9220 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
9221 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
9222 || ++ -- , ->* -> () []
9229 Returns an IDENTIFIER_NODE for the operator which is a
9230 human-readable spelling of the identifier, e.g., `operator +'. */
9233 cp_parser_operator (cp_parser* parser)
9235 tree id = NULL_TREE;
9238 /* Peek at the next token. */
9239 token = cp_lexer_peek_token (parser->lexer);
9240 /* Figure out which operator we have. */
9241 switch (token->type)
9247 /* The keyword should be either `new' or `delete'. */
9248 if (token->keyword == RID_NEW)
9250 else if (token->keyword == RID_DELETE)
9255 /* Consume the `new' or `delete' token. */
9256 cp_lexer_consume_token (parser->lexer);
9258 /* Peek at the next token. */
9259 token = cp_lexer_peek_token (parser->lexer);
9260 /* If it's a `[' token then this is the array variant of the
9262 if (token->type == CPP_OPEN_SQUARE)
9264 /* Consume the `[' token. */
9265 cp_lexer_consume_token (parser->lexer);
9266 /* Look for the `]' token. */
9267 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
9268 id = ansi_opname (op == NEW_EXPR
9269 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
9271 /* Otherwise, we have the non-array variant. */
9273 id = ansi_opname (op);
9279 id = ansi_opname (PLUS_EXPR);
9283 id = ansi_opname (MINUS_EXPR);
9287 id = ansi_opname (MULT_EXPR);
9291 id = ansi_opname (TRUNC_DIV_EXPR);
9295 id = ansi_opname (TRUNC_MOD_EXPR);
9299 id = ansi_opname (BIT_XOR_EXPR);
9303 id = ansi_opname (BIT_AND_EXPR);
9307 id = ansi_opname (BIT_IOR_EXPR);
9311 id = ansi_opname (BIT_NOT_EXPR);
9315 id = ansi_opname (TRUTH_NOT_EXPR);
9319 id = ansi_assopname (NOP_EXPR);
9323 id = ansi_opname (LT_EXPR);
9327 id = ansi_opname (GT_EXPR);
9331 id = ansi_assopname (PLUS_EXPR);
9335 id = ansi_assopname (MINUS_EXPR);
9339 id = ansi_assopname (MULT_EXPR);
9343 id = ansi_assopname (TRUNC_DIV_EXPR);
9347 id = ansi_assopname (TRUNC_MOD_EXPR);
9351 id = ansi_assopname (BIT_XOR_EXPR);
9355 id = ansi_assopname (BIT_AND_EXPR);
9359 id = ansi_assopname (BIT_IOR_EXPR);
9363 id = ansi_opname (LSHIFT_EXPR);
9367 id = ansi_opname (RSHIFT_EXPR);
9371 id = ansi_assopname (LSHIFT_EXPR);
9375 id = ansi_assopname (RSHIFT_EXPR);
9379 id = ansi_opname (EQ_EXPR);
9383 id = ansi_opname (NE_EXPR);
9387 id = ansi_opname (LE_EXPR);
9390 case CPP_GREATER_EQ:
9391 id = ansi_opname (GE_EXPR);
9395 id = ansi_opname (TRUTH_ANDIF_EXPR);
9399 id = ansi_opname (TRUTH_ORIF_EXPR);
9403 id = ansi_opname (POSTINCREMENT_EXPR);
9406 case CPP_MINUS_MINUS:
9407 id = ansi_opname (PREDECREMENT_EXPR);
9411 id = ansi_opname (COMPOUND_EXPR);
9414 case CPP_DEREF_STAR:
9415 id = ansi_opname (MEMBER_REF);
9419 id = ansi_opname (COMPONENT_REF);
9422 case CPP_OPEN_PAREN:
9423 /* Consume the `('. */
9424 cp_lexer_consume_token (parser->lexer);
9425 /* Look for the matching `)'. */
9426 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
9427 return ansi_opname (CALL_EXPR);
9429 case CPP_OPEN_SQUARE:
9430 /* Consume the `['. */
9431 cp_lexer_consume_token (parser->lexer);
9432 /* Look for the matching `]'. */
9433 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
9434 return ansi_opname (ARRAY_REF);
9437 /* Anything else is an error. */
9441 /* If we have selected an identifier, we need to consume the
9444 cp_lexer_consume_token (parser->lexer);
9445 /* Otherwise, no valid operator name was present. */
9448 cp_parser_error (parser, "expected operator");
9449 id = error_mark_node;
9455 /* Parse a template-declaration.
9457 template-declaration:
9458 export [opt] template < template-parameter-list > declaration
9460 If MEMBER_P is TRUE, this template-declaration occurs within a
9463 The grammar rule given by the standard isn't correct. What
9466 template-declaration:
9467 export [opt] template-parameter-list-seq
9468 decl-specifier-seq [opt] init-declarator [opt] ;
9469 export [opt] template-parameter-list-seq
9472 template-parameter-list-seq:
9473 template-parameter-list-seq [opt]
9474 template < template-parameter-list > */
9477 cp_parser_template_declaration (cp_parser* parser, bool member_p)
9479 /* Check for `export'. */
9480 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
9482 /* Consume the `export' token. */
9483 cp_lexer_consume_token (parser->lexer);
9484 /* Warn that we do not support `export'. */
9485 warning (0, "keyword %<export%> not implemented, and will be ignored");
9488 cp_parser_template_declaration_after_export (parser, member_p);
9491 /* Parse a template-parameter-list.
9493 template-parameter-list:
9495 template-parameter-list , template-parameter
9497 Returns a TREE_LIST. Each node represents a template parameter.
9498 The nodes are connected via their TREE_CHAINs. */
9501 cp_parser_template_parameter_list (cp_parser* parser)
9503 tree parameter_list = NULL_TREE;
9505 begin_template_parm_list ();
9510 bool is_parameter_pack;
9512 /* Parse the template-parameter. */
9513 parameter = cp_parser_template_parameter (parser,
9515 &is_parameter_pack);
9516 /* Add it to the list. */
9517 if (parameter != error_mark_node)
9518 parameter_list = process_template_parm (parameter_list,
9524 tree err_parm = build_tree_list (parameter, parameter);
9525 TREE_VALUE (err_parm) = error_mark_node;
9526 parameter_list = chainon (parameter_list, err_parm);
9529 /* If the next token is not a `,', we're done. */
9530 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9532 /* Otherwise, consume the `,' token. */
9533 cp_lexer_consume_token (parser->lexer);
9536 return end_template_parm_list (parameter_list);
9539 /* Parse a template-parameter.
9543 parameter-declaration
9545 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
9546 the parameter. The TREE_PURPOSE is the default value, if any.
9547 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
9548 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
9549 set to true iff this parameter is a parameter pack. */
9552 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type,
9553 bool *is_parameter_pack)
9556 cp_parameter_declarator *parameter_declarator;
9557 cp_declarator *id_declarator;
9560 /* Assume it is a type parameter or a template parameter. */
9561 *is_non_type = false;
9562 /* Assume it not a parameter pack. */
9563 *is_parameter_pack = false;
9564 /* Peek at the next token. */
9565 token = cp_lexer_peek_token (parser->lexer);
9566 /* If it is `class' or `template', we have a type-parameter. */
9567 if (token->keyword == RID_TEMPLATE)
9568 return cp_parser_type_parameter (parser, is_parameter_pack);
9569 /* If it is `class' or `typename' we do not know yet whether it is a
9570 type parameter or a non-type parameter. Consider:
9572 template <typename T, typename T::X X> ...
9576 template <class C, class D*> ...
9578 Here, the first parameter is a type parameter, and the second is
9579 a non-type parameter. We can tell by looking at the token after
9580 the identifier -- if it is a `,', `=', or `>' then we have a type
9582 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
9584 /* Peek at the token after `class' or `typename'. */
9585 token = cp_lexer_peek_nth_token (parser->lexer, 2);
9586 /* If it's an ellipsis, we have a template type parameter
9588 if (token->type == CPP_ELLIPSIS)
9589 return cp_parser_type_parameter (parser, is_parameter_pack);
9590 /* If it's an identifier, skip it. */
9591 if (token->type == CPP_NAME)
9592 token = cp_lexer_peek_nth_token (parser->lexer, 3);
9593 /* Now, see if the token looks like the end of a template
9595 if (token->type == CPP_COMMA
9596 || token->type == CPP_EQ
9597 || token->type == CPP_GREATER)
9598 return cp_parser_type_parameter (parser, is_parameter_pack);
9601 /* Otherwise, it is a non-type parameter.
9605 When parsing a default template-argument for a non-type
9606 template-parameter, the first non-nested `>' is taken as the end
9607 of the template parameter-list rather than a greater-than
9609 *is_non_type = true;
9610 parameter_declarator
9611 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
9612 /*parenthesized_p=*/NULL);
9614 /* If the parameter declaration is marked as a parameter pack, set
9615 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
9616 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
9618 if (parameter_declarator
9619 && parameter_declarator->declarator
9620 && parameter_declarator->declarator->parameter_pack_p)
9622 *is_parameter_pack = true;
9623 parameter_declarator->declarator->parameter_pack_p = false;
9626 /* If the next token is an ellipsis, and we don't already have it
9627 marked as a parameter pack, then we have a parameter pack (that
9628 has no declarator). */
9629 if (!*is_parameter_pack
9630 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
9631 && declarator_can_be_parameter_pack (parameter_declarator->declarator))
9633 /* Consume the `...'. */
9634 cp_lexer_consume_token (parser->lexer);
9635 maybe_warn_variadic_templates ();
9637 *is_parameter_pack = true;
9639 /* We might end up with a pack expansion as the type of the non-type
9640 template parameter, in which case this is a non-type template
9642 else if (parameter_declarator
9643 && parameter_declarator->decl_specifiers.type
9644 && PACK_EXPANSION_P (parameter_declarator->decl_specifiers.type))
9646 *is_parameter_pack = true;
9647 parameter_declarator->decl_specifiers.type =
9648 PACK_EXPANSION_PATTERN (parameter_declarator->decl_specifiers.type);
9651 if (*is_parameter_pack && cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9653 /* Parameter packs cannot have default arguments. However, a
9654 user may try to do so, so we'll parse them and give an
9655 appropriate diagnostic here. */
9657 /* Consume the `='. */
9658 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
9659 cp_lexer_consume_token (parser->lexer);
9661 /* Find the name of the parameter pack. */
9662 id_declarator = parameter_declarator->declarator;
9663 while (id_declarator && id_declarator->kind != cdk_id)
9664 id_declarator = id_declarator->declarator;
9666 if (id_declarator && id_declarator->kind == cdk_id)
9667 error ("%Htemplate parameter pack %qD cannot have a default argument",
9668 &start_token->location, id_declarator->u.id.unqualified_name);
9670 error ("%Htemplate parameter pack cannot have a default argument",
9671 &start_token->location);
9673 /* Parse the default argument, but throw away the result. */
9674 cp_parser_default_argument (parser, /*template_parm_p=*/true);
9677 parm = grokdeclarator (parameter_declarator->declarator,
9678 ¶meter_declarator->decl_specifiers,
9679 PARM, /*initialized=*/0,
9681 if (parm == error_mark_node)
9682 return error_mark_node;
9684 return build_tree_list (parameter_declarator->default_argument, parm);
9687 /* Parse a type-parameter.
9690 class identifier [opt]
9691 class identifier [opt] = type-id
9692 typename identifier [opt]
9693 typename identifier [opt] = type-id
9694 template < template-parameter-list > class identifier [opt]
9695 template < template-parameter-list > class identifier [opt]
9698 GNU Extension (variadic templates):
9701 class ... identifier [opt]
9702 typename ... identifier [opt]
9704 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
9705 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
9706 the declaration of the parameter.
9708 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
9711 cp_parser_type_parameter (cp_parser* parser, bool *is_parameter_pack)
9716 /* Look for a keyword to tell us what kind of parameter this is. */
9717 token = cp_parser_require (parser, CPP_KEYWORD,
9718 "%<class%>, %<typename%>, or %<template%>");
9720 return error_mark_node;
9722 switch (token->keyword)
9728 tree default_argument;
9730 /* If the next token is an ellipsis, we have a template
9732 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
9734 /* Consume the `...' token. */
9735 cp_lexer_consume_token (parser->lexer);
9736 maybe_warn_variadic_templates ();
9738 *is_parameter_pack = true;
9741 /* If the next token is an identifier, then it names the
9743 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9744 identifier = cp_parser_identifier (parser);
9746 identifier = NULL_TREE;
9748 /* Create the parameter. */
9749 parameter = finish_template_type_parm (class_type_node, identifier);
9751 /* If the next token is an `=', we have a default argument. */
9752 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9754 /* Consume the `=' token. */
9755 cp_lexer_consume_token (parser->lexer);
9756 /* Parse the default-argument. */
9757 push_deferring_access_checks (dk_no_deferred);
9758 default_argument = cp_parser_type_id (parser);
9760 /* Template parameter packs cannot have default
9762 if (*is_parameter_pack)
9765 error ("%Htemplate parameter pack %qD cannot have a "
9766 "default argument", &token->location, identifier);
9768 error ("%Htemplate parameter packs cannot have "
9769 "default arguments", &token->location);
9770 default_argument = NULL_TREE;
9772 pop_deferring_access_checks ();
9775 default_argument = NULL_TREE;
9777 /* Create the combined representation of the parameter and the
9778 default argument. */
9779 parameter = build_tree_list (default_argument, parameter);
9785 tree parameter_list;
9787 tree default_argument;
9789 /* Look for the `<'. */
9790 cp_parser_require (parser, CPP_LESS, "%<<%>");
9791 /* Parse the template-parameter-list. */
9792 parameter_list = cp_parser_template_parameter_list (parser);
9793 /* Look for the `>'. */
9794 cp_parser_require (parser, CPP_GREATER, "%<>%>");
9795 /* Look for the `class' keyword. */
9796 cp_parser_require_keyword (parser, RID_CLASS, "%<class%>");
9797 /* If the next token is an ellipsis, we have a template
9799 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
9801 /* Consume the `...' token. */
9802 cp_lexer_consume_token (parser->lexer);
9803 maybe_warn_variadic_templates ();
9805 *is_parameter_pack = true;
9807 /* If the next token is an `=', then there is a
9808 default-argument. If the next token is a `>', we are at
9809 the end of the parameter-list. If the next token is a `,',
9810 then we are at the end of this parameter. */
9811 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
9812 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
9813 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
9815 identifier = cp_parser_identifier (parser);
9816 /* Treat invalid names as if the parameter were nameless. */
9817 if (identifier == error_mark_node)
9818 identifier = NULL_TREE;
9821 identifier = NULL_TREE;
9823 /* Create the template parameter. */
9824 parameter = finish_template_template_parm (class_type_node,
9827 /* If the next token is an `=', then there is a
9828 default-argument. */
9829 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
9833 /* Consume the `='. */
9834 cp_lexer_consume_token (parser->lexer);
9835 /* Parse the id-expression. */
9836 push_deferring_access_checks (dk_no_deferred);
9837 /* save token before parsing the id-expression, for error
9839 token = cp_lexer_peek_token (parser->lexer);
9841 = cp_parser_id_expression (parser,
9842 /*template_keyword_p=*/false,
9843 /*check_dependency_p=*/true,
9844 /*template_p=*/&is_template,
9845 /*declarator_p=*/false,
9846 /*optional_p=*/false);
9847 if (TREE_CODE (default_argument) == TYPE_DECL)
9848 /* If the id-expression was a template-id that refers to
9849 a template-class, we already have the declaration here,
9850 so no further lookup is needed. */
9853 /* Look up the name. */
9855 = cp_parser_lookup_name (parser, default_argument,
9857 /*is_template=*/is_template,
9858 /*is_namespace=*/false,
9859 /*check_dependency=*/true,
9860 /*ambiguous_decls=*/NULL,
9862 /* See if the default argument is valid. */
9864 = check_template_template_default_arg (default_argument);
9866 /* Template parameter packs cannot have default
9868 if (*is_parameter_pack)
9871 error ("%Htemplate parameter pack %qD cannot "
9872 "have a default argument",
9873 &token->location, identifier);
9875 error ("%Htemplate parameter packs cannot "
9876 "have default arguments",
9878 default_argument = NULL_TREE;
9880 pop_deferring_access_checks ();
9883 default_argument = NULL_TREE;
9885 /* Create the combined representation of the parameter and the
9886 default argument. */
9887 parameter = build_tree_list (default_argument, parameter);
9899 /* Parse a template-id.
9902 template-name < template-argument-list [opt] >
9904 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
9905 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
9906 returned. Otherwise, if the template-name names a function, or set
9907 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
9908 names a class, returns a TYPE_DECL for the specialization.
9910 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
9911 uninstantiated templates. */
9914 cp_parser_template_id (cp_parser *parser,
9915 bool template_keyword_p,
9916 bool check_dependency_p,
9917 bool is_declaration)
9923 cp_token_position start_of_id = 0;
9924 deferred_access_check *chk;
9925 VEC (deferred_access_check,gc) *access_check;
9926 cp_token *next_token = NULL, *next_token_2 = NULL, *token = NULL;
9929 /* If the next token corresponds to a template-id, there is no need
9931 next_token = cp_lexer_peek_token (parser->lexer);
9932 if (next_token->type == CPP_TEMPLATE_ID)
9934 struct tree_check *check_value;
9936 /* Get the stored value. */
9937 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
9938 /* Perform any access checks that were deferred. */
9939 access_check = check_value->checks;
9943 VEC_iterate (deferred_access_check, access_check, i, chk) ;
9946 perform_or_defer_access_check (chk->binfo,
9951 /* Return the stored value. */
9952 return check_value->value;
9955 /* Avoid performing name lookup if there is no possibility of
9956 finding a template-id. */
9957 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
9958 || (next_token->type == CPP_NAME
9959 && !cp_parser_nth_token_starts_template_argument_list_p
9962 cp_parser_error (parser, "expected template-id");
9963 return error_mark_node;
9966 /* Remember where the template-id starts. */
9967 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
9968 start_of_id = cp_lexer_token_position (parser->lexer, false);
9970 push_deferring_access_checks (dk_deferred);
9972 /* Parse the template-name. */
9973 is_identifier = false;
9974 token = cp_lexer_peek_token (parser->lexer);
9975 templ = cp_parser_template_name (parser, template_keyword_p,
9979 if (templ == error_mark_node || is_identifier)
9981 pop_deferring_access_checks ();
9985 /* If we find the sequence `[:' after a template-name, it's probably
9986 a digraph-typo for `< ::'. Substitute the tokens and check if we can
9987 parse correctly the argument list. */
9988 next_token = cp_lexer_peek_token (parser->lexer);
9989 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
9990 if (next_token->type == CPP_OPEN_SQUARE
9991 && next_token->flags & DIGRAPH
9992 && next_token_2->type == CPP_COLON
9993 && !(next_token_2->flags & PREV_WHITE))
9995 cp_parser_parse_tentatively (parser);
9996 /* Change `:' into `::'. */
9997 next_token_2->type = CPP_SCOPE;
9998 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
10000 cp_lexer_consume_token (parser->lexer);
10002 /* Parse the arguments. */
10003 arguments = cp_parser_enclosed_template_argument_list (parser);
10004 if (!cp_parser_parse_definitely (parser))
10006 /* If we couldn't parse an argument list, then we revert our changes
10007 and return simply an error. Maybe this is not a template-id
10009 next_token_2->type = CPP_COLON;
10010 cp_parser_error (parser, "expected %<<%>");
10011 pop_deferring_access_checks ();
10012 return error_mark_node;
10014 /* Otherwise, emit an error about the invalid digraph, but continue
10015 parsing because we got our argument list. */
10016 if (permerror (next_token->location,
10017 "%<<::%> cannot begin a template-argument list"))
10019 static bool hint = false;
10020 inform (next_token->location,
10021 "%<<:%> is an alternate spelling for %<[%>."
10022 " Insert whitespace between %<<%> and %<::%>");
10023 if (!hint && !flag_permissive)
10025 inform (next_token->location, "(if you use %<-fpermissive%>"
10026 " G++ will accept your code)");
10033 /* Look for the `<' that starts the template-argument-list. */
10034 if (!cp_parser_require (parser, CPP_LESS, "%<<%>"))
10036 pop_deferring_access_checks ();
10037 return error_mark_node;
10039 /* Parse the arguments. */
10040 arguments = cp_parser_enclosed_template_argument_list (parser);
10043 /* Build a representation of the specialization. */
10044 if (TREE_CODE (templ) == IDENTIFIER_NODE)
10045 template_id = build_min_nt (TEMPLATE_ID_EXPR, templ, arguments);
10046 else if (DECL_CLASS_TEMPLATE_P (templ)
10047 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ))
10049 bool entering_scope;
10050 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
10051 template (rather than some instantiation thereof) only if
10052 is not nested within some other construct. For example, in
10053 "template <typename T> void f(T) { A<T>::", A<T> is just an
10054 instantiation of A. */
10055 entering_scope = (template_parm_scope_p ()
10056 && cp_lexer_next_token_is (parser->lexer,
10059 = finish_template_type (templ, arguments, entering_scope);
10063 /* If it's not a class-template or a template-template, it should be
10064 a function-template. */
10065 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ)
10066 || TREE_CODE (templ) == OVERLOAD
10067 || BASELINK_P (templ)));
10069 template_id = lookup_template_function (templ, arguments);
10072 /* If parsing tentatively, replace the sequence of tokens that makes
10073 up the template-id with a CPP_TEMPLATE_ID token. That way,
10074 should we re-parse the token stream, we will not have to repeat
10075 the effort required to do the parse, nor will we issue duplicate
10076 error messages about problems during instantiation of the
10080 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
10082 /* Reset the contents of the START_OF_ID token. */
10083 token->type = CPP_TEMPLATE_ID;
10084 /* Retrieve any deferred checks. Do not pop this access checks yet
10085 so the memory will not be reclaimed during token replacing below. */
10086 token->u.tree_check_value = GGC_CNEW (struct tree_check);
10087 token->u.tree_check_value->value = template_id;
10088 token->u.tree_check_value->checks = get_deferred_access_checks ();
10089 token->keyword = RID_MAX;
10091 /* Purge all subsequent tokens. */
10092 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
10094 /* ??? Can we actually assume that, if template_id ==
10095 error_mark_node, we will have issued a diagnostic to the
10096 user, as opposed to simply marking the tentative parse as
10098 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
10099 error ("%Hparse error in template argument list",
10103 pop_deferring_access_checks ();
10104 return template_id;
10107 /* Parse a template-name.
10112 The standard should actually say:
10116 operator-function-id
10118 A defect report has been filed about this issue.
10120 A conversion-function-id cannot be a template name because they cannot
10121 be part of a template-id. In fact, looking at this code:
10123 a.operator K<int>()
10125 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
10126 It is impossible to call a templated conversion-function-id with an
10127 explicit argument list, since the only allowed template parameter is
10128 the type to which it is converting.
10130 If TEMPLATE_KEYWORD_P is true, then we have just seen the
10131 `template' keyword, in a construction like:
10135 In that case `f' is taken to be a template-name, even though there
10136 is no way of knowing for sure.
10138 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
10139 name refers to a set of overloaded functions, at least one of which
10140 is a template, or an IDENTIFIER_NODE with the name of the template,
10141 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
10142 names are looked up inside uninstantiated templates. */
10145 cp_parser_template_name (cp_parser* parser,
10146 bool template_keyword_p,
10147 bool check_dependency_p,
10148 bool is_declaration,
10149 bool *is_identifier)
10154 cp_token *token = cp_lexer_peek_token (parser->lexer);
10156 /* If the next token is `operator', then we have either an
10157 operator-function-id or a conversion-function-id. */
10158 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
10160 /* We don't know whether we're looking at an
10161 operator-function-id or a conversion-function-id. */
10162 cp_parser_parse_tentatively (parser);
10163 /* Try an operator-function-id. */
10164 identifier = cp_parser_operator_function_id (parser);
10165 /* If that didn't work, try a conversion-function-id. */
10166 if (!cp_parser_parse_definitely (parser))
10168 cp_parser_error (parser, "expected template-name");
10169 return error_mark_node;
10172 /* Look for the identifier. */
10174 identifier = cp_parser_identifier (parser);
10176 /* If we didn't find an identifier, we don't have a template-id. */
10177 if (identifier == error_mark_node)
10178 return error_mark_node;
10180 /* If the name immediately followed the `template' keyword, then it
10181 is a template-name. However, if the next token is not `<', then
10182 we do not treat it as a template-name, since it is not being used
10183 as part of a template-id. This enables us to handle constructs
10186 template <typename T> struct S { S(); };
10187 template <typename T> S<T>::S();
10189 correctly. We would treat `S' as a template -- if it were `S<T>'
10190 -- but we do not if there is no `<'. */
10192 if (processing_template_decl
10193 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
10195 /* In a declaration, in a dependent context, we pretend that the
10196 "template" keyword was present in order to improve error
10197 recovery. For example, given:
10199 template <typename T> void f(T::X<int>);
10201 we want to treat "X<int>" as a template-id. */
10203 && !template_keyword_p
10204 && parser->scope && TYPE_P (parser->scope)
10205 && check_dependency_p
10206 && dependent_type_p (parser->scope)
10207 /* Do not do this for dtors (or ctors), since they never
10208 need the template keyword before their name. */
10209 && !constructor_name_p (identifier, parser->scope))
10211 cp_token_position start = 0;
10213 /* Explain what went wrong. */
10214 error ("%Hnon-template %qD used as template",
10215 &token->location, identifier);
10216 inform (input_location, "use %<%T::template %D%> to indicate that it is a template",
10217 parser->scope, identifier);
10218 /* If parsing tentatively, find the location of the "<" token. */
10219 if (cp_parser_simulate_error (parser))
10220 start = cp_lexer_token_position (parser->lexer, true);
10221 /* Parse the template arguments so that we can issue error
10222 messages about them. */
10223 cp_lexer_consume_token (parser->lexer);
10224 cp_parser_enclosed_template_argument_list (parser);
10225 /* Skip tokens until we find a good place from which to
10226 continue parsing. */
10227 cp_parser_skip_to_closing_parenthesis (parser,
10228 /*recovering=*/true,
10230 /*consume_paren=*/false);
10231 /* If parsing tentatively, permanently remove the
10232 template argument list. That will prevent duplicate
10233 error messages from being issued about the missing
10234 "template" keyword. */
10236 cp_lexer_purge_tokens_after (parser->lexer, start);
10238 *is_identifier = true;
10242 /* If the "template" keyword is present, then there is generally
10243 no point in doing name-lookup, so we just return IDENTIFIER.
10244 But, if the qualifying scope is non-dependent then we can
10245 (and must) do name-lookup normally. */
10246 if (template_keyword_p
10248 || (TYPE_P (parser->scope)
10249 && dependent_type_p (parser->scope))))
10253 /* Look up the name. */
10254 decl = cp_parser_lookup_name (parser, identifier,
10256 /*is_template=*/false,
10257 /*is_namespace=*/false,
10258 check_dependency_p,
10259 /*ambiguous_decls=*/NULL,
10261 decl = maybe_get_template_decl_from_type_decl (decl);
10263 /* If DECL is a template, then the name was a template-name. */
10264 if (TREE_CODE (decl) == TEMPLATE_DECL)
10268 tree fn = NULL_TREE;
10270 /* The standard does not explicitly indicate whether a name that
10271 names a set of overloaded declarations, some of which are
10272 templates, is a template-name. However, such a name should
10273 be a template-name; otherwise, there is no way to form a
10274 template-id for the overloaded templates. */
10275 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
10276 if (TREE_CODE (fns) == OVERLOAD)
10277 for (fn = fns; fn; fn = OVL_NEXT (fn))
10278 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
10283 /* The name does not name a template. */
10284 cp_parser_error (parser, "expected template-name");
10285 return error_mark_node;
10289 /* If DECL is dependent, and refers to a function, then just return
10290 its name; we will look it up again during template instantiation. */
10291 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
10293 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
10294 if (TYPE_P (scope) && dependent_type_p (scope))
10301 /* Parse a template-argument-list.
10303 template-argument-list:
10304 template-argument ... [opt]
10305 template-argument-list , template-argument ... [opt]
10307 Returns a TREE_VEC containing the arguments. */
10310 cp_parser_template_argument_list (cp_parser* parser)
10312 tree fixed_args[10];
10313 unsigned n_args = 0;
10314 unsigned alloced = 10;
10315 tree *arg_ary = fixed_args;
10317 bool saved_in_template_argument_list_p;
10319 bool saved_non_ice_p;
10321 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
10322 parser->in_template_argument_list_p = true;
10323 /* Even if the template-id appears in an integral
10324 constant-expression, the contents of the argument list do
10326 saved_ice_p = parser->integral_constant_expression_p;
10327 parser->integral_constant_expression_p = false;
10328 saved_non_ice_p = parser->non_integral_constant_expression_p;
10329 parser->non_integral_constant_expression_p = false;
10330 /* Parse the arguments. */
10336 /* Consume the comma. */
10337 cp_lexer_consume_token (parser->lexer);
10339 /* Parse the template-argument. */
10340 argument = cp_parser_template_argument (parser);
10342 /* If the next token is an ellipsis, we're expanding a template
10344 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
10346 /* Consume the `...' token. */
10347 cp_lexer_consume_token (parser->lexer);
10349 /* Make the argument into a TYPE_PACK_EXPANSION or
10350 EXPR_PACK_EXPANSION. */
10351 argument = make_pack_expansion (argument);
10354 if (n_args == alloced)
10358 if (arg_ary == fixed_args)
10360 arg_ary = XNEWVEC (tree, alloced);
10361 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
10364 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
10366 arg_ary[n_args++] = argument;
10368 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
10370 vec = make_tree_vec (n_args);
10373 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
10375 if (arg_ary != fixed_args)
10377 parser->non_integral_constant_expression_p = saved_non_ice_p;
10378 parser->integral_constant_expression_p = saved_ice_p;
10379 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
10383 /* Parse a template-argument.
10386 assignment-expression
10390 The representation is that of an assignment-expression, type-id, or
10391 id-expression -- except that the qualified id-expression is
10392 evaluated, so that the value returned is either a DECL or an
10395 Although the standard says "assignment-expression", it forbids
10396 throw-expressions or assignments in the template argument.
10397 Therefore, we use "conditional-expression" instead. */
10400 cp_parser_template_argument (cp_parser* parser)
10405 bool maybe_type_id = false;
10406 cp_token *token = NULL, *argument_start_token = NULL;
10409 /* There's really no way to know what we're looking at, so we just
10410 try each alternative in order.
10414 In a template-argument, an ambiguity between a type-id and an
10415 expression is resolved to a type-id, regardless of the form of
10416 the corresponding template-parameter.
10418 Therefore, we try a type-id first. */
10419 cp_parser_parse_tentatively (parser);
10420 argument = cp_parser_type_id (parser);
10421 /* If there was no error parsing the type-id but the next token is a
10422 '>>', our behavior depends on which dialect of C++ we're
10423 parsing. In C++98, we probably found a typo for '> >'. But there
10424 are type-id which are also valid expressions. For instance:
10426 struct X { int operator >> (int); };
10427 template <int V> struct Foo {};
10430 Here 'X()' is a valid type-id of a function type, but the user just
10431 wanted to write the expression "X() >> 5". Thus, we remember that we
10432 found a valid type-id, but we still try to parse the argument as an
10433 expression to see what happens.
10435 In C++0x, the '>>' will be considered two separate '>'
10437 if (!cp_parser_error_occurred (parser)
10438 && cxx_dialect == cxx98
10439 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
10441 maybe_type_id = true;
10442 cp_parser_abort_tentative_parse (parser);
10446 /* If the next token isn't a `,' or a `>', then this argument wasn't
10447 really finished. This means that the argument is not a valid
10449 if (!cp_parser_next_token_ends_template_argument_p (parser))
10450 cp_parser_error (parser, "expected template-argument");
10451 /* If that worked, we're done. */
10452 if (cp_parser_parse_definitely (parser))
10455 /* We're still not sure what the argument will be. */
10456 cp_parser_parse_tentatively (parser);
10457 /* Try a template. */
10458 argument_start_token = cp_lexer_peek_token (parser->lexer);
10459 argument = cp_parser_id_expression (parser,
10460 /*template_keyword_p=*/false,
10461 /*check_dependency_p=*/true,
10463 /*declarator_p=*/false,
10464 /*optional_p=*/false);
10465 /* If the next token isn't a `,' or a `>', then this argument wasn't
10466 really finished. */
10467 if (!cp_parser_next_token_ends_template_argument_p (parser))
10468 cp_parser_error (parser, "expected template-argument");
10469 if (!cp_parser_error_occurred (parser))
10471 /* Figure out what is being referred to. If the id-expression
10472 was for a class template specialization, then we will have a
10473 TYPE_DECL at this point. There is no need to do name lookup
10474 at this point in that case. */
10475 if (TREE_CODE (argument) != TYPE_DECL)
10476 argument = cp_parser_lookup_name (parser, argument,
10478 /*is_template=*/template_p,
10479 /*is_namespace=*/false,
10480 /*check_dependency=*/true,
10481 /*ambiguous_decls=*/NULL,
10482 argument_start_token->location);
10483 if (TREE_CODE (argument) != TEMPLATE_DECL
10484 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
10485 cp_parser_error (parser, "expected template-name");
10487 if (cp_parser_parse_definitely (parser))
10489 /* It must be a non-type argument. There permitted cases are given
10490 in [temp.arg.nontype]:
10492 -- an integral constant-expression of integral or enumeration
10495 -- the name of a non-type template-parameter; or
10497 -- the name of an object or function with external linkage...
10499 -- the address of an object or function with external linkage...
10501 -- a pointer to member... */
10502 /* Look for a non-type template parameter. */
10503 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10505 cp_parser_parse_tentatively (parser);
10506 argument = cp_parser_primary_expression (parser,
10507 /*address_p=*/false,
10509 /*template_arg_p=*/true,
10511 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
10512 || !cp_parser_next_token_ends_template_argument_p (parser))
10513 cp_parser_simulate_error (parser);
10514 if (cp_parser_parse_definitely (parser))
10518 /* If the next token is "&", the argument must be the address of an
10519 object or function with external linkage. */
10520 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
10522 cp_lexer_consume_token (parser->lexer);
10523 /* See if we might have an id-expression. */
10524 token = cp_lexer_peek_token (parser->lexer);
10525 if (token->type == CPP_NAME
10526 || token->keyword == RID_OPERATOR
10527 || token->type == CPP_SCOPE
10528 || token->type == CPP_TEMPLATE_ID
10529 || token->type == CPP_NESTED_NAME_SPECIFIER)
10531 cp_parser_parse_tentatively (parser);
10532 argument = cp_parser_primary_expression (parser,
10535 /*template_arg_p=*/true,
10537 if (cp_parser_error_occurred (parser)
10538 || !cp_parser_next_token_ends_template_argument_p (parser))
10539 cp_parser_abort_tentative_parse (parser);
10542 if (TREE_CODE (argument) == INDIRECT_REF)
10544 gcc_assert (REFERENCE_REF_P (argument));
10545 argument = TREE_OPERAND (argument, 0);
10548 if (TREE_CODE (argument) == VAR_DECL)
10550 /* A variable without external linkage might still be a
10551 valid constant-expression, so no error is issued here
10552 if the external-linkage check fails. */
10553 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (argument))
10554 cp_parser_simulate_error (parser);
10556 else if (is_overloaded_fn (argument))
10557 /* All overloaded functions are allowed; if the external
10558 linkage test does not pass, an error will be issued
10562 && (TREE_CODE (argument) == OFFSET_REF
10563 || TREE_CODE (argument) == SCOPE_REF))
10564 /* A pointer-to-member. */
10566 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
10569 cp_parser_simulate_error (parser);
10571 if (cp_parser_parse_definitely (parser))
10574 argument = build_x_unary_op (ADDR_EXPR, argument,
10575 tf_warning_or_error);
10580 /* If the argument started with "&", there are no other valid
10581 alternatives at this point. */
10584 cp_parser_error (parser, "invalid non-type template argument");
10585 return error_mark_node;
10588 /* If the argument wasn't successfully parsed as a type-id followed
10589 by '>>', the argument can only be a constant expression now.
10590 Otherwise, we try parsing the constant-expression tentatively,
10591 because the argument could really be a type-id. */
10593 cp_parser_parse_tentatively (parser);
10594 argument = cp_parser_constant_expression (parser,
10595 /*allow_non_constant_p=*/false,
10596 /*non_constant_p=*/NULL);
10597 argument = fold_non_dependent_expr (argument);
10598 if (!maybe_type_id)
10600 if (!cp_parser_next_token_ends_template_argument_p (parser))
10601 cp_parser_error (parser, "expected template-argument");
10602 if (cp_parser_parse_definitely (parser))
10604 /* We did our best to parse the argument as a non type-id, but that
10605 was the only alternative that matched (albeit with a '>' after
10606 it). We can assume it's just a typo from the user, and a
10607 diagnostic will then be issued. */
10608 return cp_parser_type_id (parser);
10611 /* Parse an explicit-instantiation.
10613 explicit-instantiation:
10614 template declaration
10616 Although the standard says `declaration', what it really means is:
10618 explicit-instantiation:
10619 template decl-specifier-seq [opt] declarator [opt] ;
10621 Things like `template int S<int>::i = 5, int S<double>::j;' are not
10622 supposed to be allowed. A defect report has been filed about this
10627 explicit-instantiation:
10628 storage-class-specifier template
10629 decl-specifier-seq [opt] declarator [opt] ;
10630 function-specifier template
10631 decl-specifier-seq [opt] declarator [opt] ; */
10634 cp_parser_explicit_instantiation (cp_parser* parser)
10636 int declares_class_or_enum;
10637 cp_decl_specifier_seq decl_specifiers;
10638 tree extension_specifier = NULL_TREE;
10641 /* Look for an (optional) storage-class-specifier or
10642 function-specifier. */
10643 if (cp_parser_allow_gnu_extensions_p (parser))
10645 extension_specifier
10646 = cp_parser_storage_class_specifier_opt (parser);
10647 if (!extension_specifier)
10648 extension_specifier
10649 = cp_parser_function_specifier_opt (parser,
10650 /*decl_specs=*/NULL);
10653 /* Look for the `template' keyword. */
10654 cp_parser_require_keyword (parser, RID_TEMPLATE, "%<template%>");
10655 /* Let the front end know that we are processing an explicit
10657 begin_explicit_instantiation ();
10658 /* [temp.explicit] says that we are supposed to ignore access
10659 control while processing explicit instantiation directives. */
10660 push_deferring_access_checks (dk_no_check);
10661 /* Parse a decl-specifier-seq. */
10662 token = cp_lexer_peek_token (parser->lexer);
10663 cp_parser_decl_specifier_seq (parser,
10664 CP_PARSER_FLAGS_OPTIONAL,
10666 &declares_class_or_enum);
10667 /* If there was exactly one decl-specifier, and it declared a class,
10668 and there's no declarator, then we have an explicit type
10670 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
10674 type = check_tag_decl (&decl_specifiers);
10675 /* Turn access control back on for names used during
10676 template instantiation. */
10677 pop_deferring_access_checks ();
10679 do_type_instantiation (type, extension_specifier,
10680 /*complain=*/tf_error);
10684 cp_declarator *declarator;
10687 /* Parse the declarator. */
10689 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10690 /*ctor_dtor_or_conv_p=*/NULL,
10691 /*parenthesized_p=*/NULL,
10692 /*member_p=*/false);
10693 if (declares_class_or_enum & 2)
10694 cp_parser_check_for_definition_in_return_type (declarator,
10695 decl_specifiers.type,
10696 decl_specifiers.type_location);
10697 if (declarator != cp_error_declarator)
10699 decl = grokdeclarator (declarator, &decl_specifiers,
10700 NORMAL, 0, &decl_specifiers.attributes);
10701 /* Turn access control back on for names used during
10702 template instantiation. */
10703 pop_deferring_access_checks ();
10704 /* Do the explicit instantiation. */
10705 do_decl_instantiation (decl, extension_specifier);
10709 pop_deferring_access_checks ();
10710 /* Skip the body of the explicit instantiation. */
10711 cp_parser_skip_to_end_of_statement (parser);
10714 /* We're done with the instantiation. */
10715 end_explicit_instantiation ();
10717 cp_parser_consume_semicolon_at_end_of_statement (parser);
10720 /* Parse an explicit-specialization.
10722 explicit-specialization:
10723 template < > declaration
10725 Although the standard says `declaration', what it really means is:
10727 explicit-specialization:
10728 template <> decl-specifier [opt] init-declarator [opt] ;
10729 template <> function-definition
10730 template <> explicit-specialization
10731 template <> template-declaration */
10734 cp_parser_explicit_specialization (cp_parser* parser)
10736 bool need_lang_pop;
10737 cp_token *token = cp_lexer_peek_token (parser->lexer);
10739 /* Look for the `template' keyword. */
10740 cp_parser_require_keyword (parser, RID_TEMPLATE, "%<template%>");
10741 /* Look for the `<'. */
10742 cp_parser_require (parser, CPP_LESS, "%<<%>");
10743 /* Look for the `>'. */
10744 cp_parser_require (parser, CPP_GREATER, "%<>%>");
10745 /* We have processed another parameter list. */
10746 ++parser->num_template_parameter_lists;
10749 A template ... explicit specialization ... shall not have C
10751 if (current_lang_name == lang_name_c)
10753 error ("%Htemplate specialization with C linkage", &token->location);
10754 /* Give it C++ linkage to avoid confusing other parts of the
10756 push_lang_context (lang_name_cplusplus);
10757 need_lang_pop = true;
10760 need_lang_pop = false;
10761 /* Let the front end know that we are beginning a specialization. */
10762 if (!begin_specialization ())
10764 end_specialization ();
10765 cp_parser_skip_to_end_of_block_or_statement (parser);
10769 /* If the next keyword is `template', we need to figure out whether
10770 or not we're looking a template-declaration. */
10771 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
10773 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
10774 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
10775 cp_parser_template_declaration_after_export (parser,
10776 /*member_p=*/false);
10778 cp_parser_explicit_specialization (parser);
10781 /* Parse the dependent declaration. */
10782 cp_parser_single_declaration (parser,
10784 /*member_p=*/false,
10785 /*explicit_specialization_p=*/true,
10786 /*friend_p=*/NULL);
10787 /* We're done with the specialization. */
10788 end_specialization ();
10789 /* For the erroneous case of a template with C linkage, we pushed an
10790 implicit C++ linkage scope; exit that scope now. */
10792 pop_lang_context ();
10793 /* We're done with this parameter list. */
10794 --parser->num_template_parameter_lists;
10797 /* Parse a type-specifier.
10800 simple-type-specifier
10803 elaborated-type-specifier
10811 Returns a representation of the type-specifier. For a
10812 class-specifier, enum-specifier, or elaborated-type-specifier, a
10813 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
10815 The parser flags FLAGS is used to control type-specifier parsing.
10817 If IS_DECLARATION is TRUE, then this type-specifier is appearing
10818 in a decl-specifier-seq.
10820 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
10821 class-specifier, enum-specifier, or elaborated-type-specifier, then
10822 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
10823 if a type is declared; 2 if it is defined. Otherwise, it is set to
10826 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
10827 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
10828 is set to FALSE. */
10831 cp_parser_type_specifier (cp_parser* parser,
10832 cp_parser_flags flags,
10833 cp_decl_specifier_seq *decl_specs,
10834 bool is_declaration,
10835 int* declares_class_or_enum,
10836 bool* is_cv_qualifier)
10838 tree type_spec = NULL_TREE;
10841 cp_decl_spec ds = ds_last;
10843 /* Assume this type-specifier does not declare a new type. */
10844 if (declares_class_or_enum)
10845 *declares_class_or_enum = 0;
10846 /* And that it does not specify a cv-qualifier. */
10847 if (is_cv_qualifier)
10848 *is_cv_qualifier = false;
10849 /* Peek at the next token. */
10850 token = cp_lexer_peek_token (parser->lexer);
10852 /* If we're looking at a keyword, we can use that to guide the
10853 production we choose. */
10854 keyword = token->keyword;
10858 /* Look for the enum-specifier. */
10859 type_spec = cp_parser_enum_specifier (parser);
10860 /* If that worked, we're done. */
10863 if (declares_class_or_enum)
10864 *declares_class_or_enum = 2;
10866 cp_parser_set_decl_spec_type (decl_specs,
10869 /*user_defined_p=*/true);
10873 goto elaborated_type_specifier;
10875 /* Any of these indicate either a class-specifier, or an
10876 elaborated-type-specifier. */
10880 /* Parse tentatively so that we can back up if we don't find a
10881 class-specifier. */
10882 cp_parser_parse_tentatively (parser);
10883 /* Look for the class-specifier. */
10884 type_spec = cp_parser_class_specifier (parser);
10885 /* If that worked, we're done. */
10886 if (cp_parser_parse_definitely (parser))
10888 if (declares_class_or_enum)
10889 *declares_class_or_enum = 2;
10891 cp_parser_set_decl_spec_type (decl_specs,
10894 /*user_defined_p=*/true);
10898 /* Fall through. */
10899 elaborated_type_specifier:
10900 /* We're declaring (not defining) a class or enum. */
10901 if (declares_class_or_enum)
10902 *declares_class_or_enum = 1;
10904 /* Fall through. */
10906 /* Look for an elaborated-type-specifier. */
10908 = (cp_parser_elaborated_type_specifier
10910 decl_specs && decl_specs->specs[(int) ds_friend],
10913 cp_parser_set_decl_spec_type (decl_specs,
10916 /*user_defined_p=*/true);
10921 if (is_cv_qualifier)
10922 *is_cv_qualifier = true;
10927 if (is_cv_qualifier)
10928 *is_cv_qualifier = true;
10933 if (is_cv_qualifier)
10934 *is_cv_qualifier = true;
10938 /* The `__complex__' keyword is a GNU extension. */
10946 /* Handle simple keywords. */
10951 ++decl_specs->specs[(int)ds];
10952 decl_specs->any_specifiers_p = true;
10954 return cp_lexer_consume_token (parser->lexer)->u.value;
10957 /* If we do not already have a type-specifier, assume we are looking
10958 at a simple-type-specifier. */
10959 type_spec = cp_parser_simple_type_specifier (parser,
10963 /* If we didn't find a type-specifier, and a type-specifier was not
10964 optional in this context, issue an error message. */
10965 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
10967 cp_parser_error (parser, "expected type specifier");
10968 return error_mark_node;
10974 /* Parse a simple-type-specifier.
10976 simple-type-specifier:
10977 :: [opt] nested-name-specifier [opt] type-name
10978 :: [opt] nested-name-specifier template template-id
10993 simple-type-specifier:
10995 decltype ( expression )
11001 simple-type-specifier:
11002 __typeof__ unary-expression
11003 __typeof__ ( type-id )
11005 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
11006 appropriately updated. */
11009 cp_parser_simple_type_specifier (cp_parser* parser,
11010 cp_decl_specifier_seq *decl_specs,
11011 cp_parser_flags flags)
11013 tree type = NULL_TREE;
11016 /* Peek at the next token. */
11017 token = cp_lexer_peek_token (parser->lexer);
11019 /* If we're looking at a keyword, things are easy. */
11020 switch (token->keyword)
11024 decl_specs->explicit_char_p = true;
11025 type = char_type_node;
11028 type = char16_type_node;
11031 type = char32_type_node;
11034 type = wchar_type_node;
11037 type = boolean_type_node;
11041 ++decl_specs->specs[(int) ds_short];
11042 type = short_integer_type_node;
11046 decl_specs->explicit_int_p = true;
11047 type = integer_type_node;
11051 ++decl_specs->specs[(int) ds_long];
11052 type = long_integer_type_node;
11056 ++decl_specs->specs[(int) ds_signed];
11057 type = integer_type_node;
11061 ++decl_specs->specs[(int) ds_unsigned];
11062 type = unsigned_type_node;
11065 type = float_type_node;
11068 type = double_type_node;
11071 type = void_type_node;
11075 maybe_warn_cpp0x ("C++0x auto");
11076 type = make_auto ();
11080 /* Parse the `decltype' type. */
11081 type = cp_parser_decltype (parser);
11084 cp_parser_set_decl_spec_type (decl_specs, type,
11086 /*user_defined_p=*/true);
11091 /* Consume the `typeof' token. */
11092 cp_lexer_consume_token (parser->lexer);
11093 /* Parse the operand to `typeof'. */
11094 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
11095 /* If it is not already a TYPE, take its type. */
11096 if (!TYPE_P (type))
11097 type = finish_typeof (type);
11100 cp_parser_set_decl_spec_type (decl_specs, type,
11102 /*user_defined_p=*/true);
11110 /* If the type-specifier was for a built-in type, we're done. */
11115 /* Record the type. */
11117 && (token->keyword != RID_SIGNED
11118 && token->keyword != RID_UNSIGNED
11119 && token->keyword != RID_SHORT
11120 && token->keyword != RID_LONG))
11121 cp_parser_set_decl_spec_type (decl_specs,
11124 /*user_defined=*/false);
11126 decl_specs->any_specifiers_p = true;
11128 /* Consume the token. */
11129 id = cp_lexer_consume_token (parser->lexer)->u.value;
11131 /* There is no valid C++ program where a non-template type is
11132 followed by a "<". That usually indicates that the user thought
11133 that the type was a template. */
11134 cp_parser_check_for_invalid_template_id (parser, type, token->location);
11136 return TYPE_NAME (type);
11139 /* The type-specifier must be a user-defined type. */
11140 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
11145 /* Don't gobble tokens or issue error messages if this is an
11146 optional type-specifier. */
11147 if (flags & CP_PARSER_FLAGS_OPTIONAL)
11148 cp_parser_parse_tentatively (parser);
11150 /* Look for the optional `::' operator. */
11152 = (cp_parser_global_scope_opt (parser,
11153 /*current_scope_valid_p=*/false)
11155 /* Look for the nested-name specifier. */
11157 = (cp_parser_nested_name_specifier_opt (parser,
11158 /*typename_keyword_p=*/false,
11159 /*check_dependency_p=*/true,
11161 /*is_declaration=*/false)
11163 token = cp_lexer_peek_token (parser->lexer);
11164 /* If we have seen a nested-name-specifier, and the next token
11165 is `template', then we are using the template-id production. */
11167 && cp_parser_optional_template_keyword (parser))
11169 /* Look for the template-id. */
11170 type = cp_parser_template_id (parser,
11171 /*template_keyword_p=*/true,
11172 /*check_dependency_p=*/true,
11173 /*is_declaration=*/false);
11174 /* If the template-id did not name a type, we are out of
11176 if (TREE_CODE (type) != TYPE_DECL)
11178 cp_parser_error (parser, "expected template-id for type");
11182 /* Otherwise, look for a type-name. */
11184 type = cp_parser_type_name (parser);
11185 /* Keep track of all name-lookups performed in class scopes. */
11189 && TREE_CODE (type) == TYPE_DECL
11190 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
11191 maybe_note_name_used_in_class (DECL_NAME (type), type);
11192 /* If it didn't work out, we don't have a TYPE. */
11193 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
11194 && !cp_parser_parse_definitely (parser))
11196 if (type && decl_specs)
11197 cp_parser_set_decl_spec_type (decl_specs, type,
11199 /*user_defined=*/true);
11202 /* If we didn't get a type-name, issue an error message. */
11203 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
11205 cp_parser_error (parser, "expected type-name");
11206 return error_mark_node;
11209 /* There is no valid C++ program where a non-template type is
11210 followed by a "<". That usually indicates that the user thought
11211 that the type was a template. */
11212 if (type && type != error_mark_node)
11214 /* As a last-ditch effort, see if TYPE is an Objective-C type.
11215 If it is, then the '<'...'>' enclose protocol names rather than
11216 template arguments, and so everything is fine. */
11217 if (c_dialect_objc ()
11218 && (objc_is_id (type) || objc_is_class_name (type)))
11220 tree protos = cp_parser_objc_protocol_refs_opt (parser);
11221 tree qual_type = objc_get_protocol_qualified_type (type, protos);
11223 /* Clobber the "unqualified" type previously entered into
11224 DECL_SPECS with the new, improved protocol-qualified version. */
11226 decl_specs->type = qual_type;
11231 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type),
11238 /* Parse a type-name.
11251 Returns a TYPE_DECL for the type. */
11254 cp_parser_type_name (cp_parser* parser)
11258 /* We can't know yet whether it is a class-name or not. */
11259 cp_parser_parse_tentatively (parser);
11260 /* Try a class-name. */
11261 type_decl = cp_parser_class_name (parser,
11262 /*typename_keyword_p=*/false,
11263 /*template_keyword_p=*/false,
11265 /*check_dependency_p=*/true,
11266 /*class_head_p=*/false,
11267 /*is_declaration=*/false);
11268 /* If it's not a class-name, keep looking. */
11269 if (!cp_parser_parse_definitely (parser))
11271 /* It must be a typedef-name or an enum-name. */
11272 return cp_parser_nonclass_name (parser);
11278 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
11286 Returns a TYPE_DECL for the type. */
11289 cp_parser_nonclass_name (cp_parser* parser)
11294 cp_token *token = cp_lexer_peek_token (parser->lexer);
11295 identifier = cp_parser_identifier (parser);
11296 if (identifier == error_mark_node)
11297 return error_mark_node;
11299 /* Look up the type-name. */
11300 type_decl = cp_parser_lookup_name_simple (parser, identifier, token->location);
11302 if (TREE_CODE (type_decl) != TYPE_DECL
11303 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
11305 /* See if this is an Objective-C type. */
11306 tree protos = cp_parser_objc_protocol_refs_opt (parser);
11307 tree type = objc_get_protocol_qualified_type (identifier, protos);
11309 type_decl = TYPE_NAME (type);
11312 /* Issue an error if we did not find a type-name. */
11313 if (TREE_CODE (type_decl) != TYPE_DECL)
11315 if (!cp_parser_simulate_error (parser))
11316 cp_parser_name_lookup_error (parser, identifier, type_decl,
11317 "is not a type", token->location);
11318 return error_mark_node;
11320 /* Remember that the name was used in the definition of the
11321 current class so that we can check later to see if the
11322 meaning would have been different after the class was
11323 entirely defined. */
11324 else if (type_decl != error_mark_node
11326 maybe_note_name_used_in_class (identifier, type_decl);
11331 /* Parse an elaborated-type-specifier. Note that the grammar given
11332 here incorporates the resolution to DR68.
11334 elaborated-type-specifier:
11335 class-key :: [opt] nested-name-specifier [opt] identifier
11336 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
11337 enum-key :: [opt] nested-name-specifier [opt] identifier
11338 typename :: [opt] nested-name-specifier identifier
11339 typename :: [opt] nested-name-specifier template [opt]
11344 elaborated-type-specifier:
11345 class-key attributes :: [opt] nested-name-specifier [opt] identifier
11346 class-key attributes :: [opt] nested-name-specifier [opt]
11347 template [opt] template-id
11348 enum attributes :: [opt] nested-name-specifier [opt] identifier
11350 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
11351 declared `friend'. If IS_DECLARATION is TRUE, then this
11352 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
11353 something is being declared.
11355 Returns the TYPE specified. */
11358 cp_parser_elaborated_type_specifier (cp_parser* parser,
11360 bool is_declaration)
11362 enum tag_types tag_type;
11364 tree type = NULL_TREE;
11365 tree attributes = NULL_TREE;
11366 cp_token *token = NULL;
11368 /* See if we're looking at the `enum' keyword. */
11369 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
11371 /* Consume the `enum' token. */
11372 cp_lexer_consume_token (parser->lexer);
11373 /* Remember that it's an enumeration type. */
11374 tag_type = enum_type;
11375 /* Parse the optional `struct' or `class' key (for C++0x scoped
11377 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
11378 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
11380 if (cxx_dialect == cxx98)
11381 maybe_warn_cpp0x ("scoped enums");
11383 /* Consume the `struct' or `class'. */
11384 cp_lexer_consume_token (parser->lexer);
11386 /* Parse the attributes. */
11387 attributes = cp_parser_attributes_opt (parser);
11389 /* Or, it might be `typename'. */
11390 else if (cp_lexer_next_token_is_keyword (parser->lexer,
11393 /* Consume the `typename' token. */
11394 cp_lexer_consume_token (parser->lexer);
11395 /* Remember that it's a `typename' type. */
11396 tag_type = typename_type;
11397 /* The `typename' keyword is only allowed in templates. */
11398 if (!processing_template_decl)
11399 permerror (input_location, "using %<typename%> outside of template");
11401 /* Otherwise it must be a class-key. */
11404 tag_type = cp_parser_class_key (parser);
11405 if (tag_type == none_type)
11406 return error_mark_node;
11407 /* Parse the attributes. */
11408 attributes = cp_parser_attributes_opt (parser);
11411 /* Look for the `::' operator. */
11412 cp_parser_global_scope_opt (parser,
11413 /*current_scope_valid_p=*/false);
11414 /* Look for the nested-name-specifier. */
11415 if (tag_type == typename_type)
11417 if (!cp_parser_nested_name_specifier (parser,
11418 /*typename_keyword_p=*/true,
11419 /*check_dependency_p=*/true,
11422 return error_mark_node;
11425 /* Even though `typename' is not present, the proposed resolution
11426 to Core Issue 180 says that in `class A<T>::B', `B' should be
11427 considered a type-name, even if `A<T>' is dependent. */
11428 cp_parser_nested_name_specifier_opt (parser,
11429 /*typename_keyword_p=*/true,
11430 /*check_dependency_p=*/true,
11433 /* For everything but enumeration types, consider a template-id.
11434 For an enumeration type, consider only a plain identifier. */
11435 if (tag_type != enum_type)
11437 bool template_p = false;
11440 /* Allow the `template' keyword. */
11441 template_p = cp_parser_optional_template_keyword (parser);
11442 /* If we didn't see `template', we don't know if there's a
11443 template-id or not. */
11445 cp_parser_parse_tentatively (parser);
11446 /* Parse the template-id. */
11447 token = cp_lexer_peek_token (parser->lexer);
11448 decl = cp_parser_template_id (parser, template_p,
11449 /*check_dependency_p=*/true,
11451 /* If we didn't find a template-id, look for an ordinary
11453 if (!template_p && !cp_parser_parse_definitely (parser))
11455 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
11456 in effect, then we must assume that, upon instantiation, the
11457 template will correspond to a class. */
11458 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
11459 && tag_type == typename_type)
11460 type = make_typename_type (parser->scope, decl,
11462 /*complain=*/tf_error);
11464 type = TREE_TYPE (decl);
11469 token = cp_lexer_peek_token (parser->lexer);
11470 identifier = cp_parser_identifier (parser);
11472 if (identifier == error_mark_node)
11474 parser->scope = NULL_TREE;
11475 return error_mark_node;
11478 /* For a `typename', we needn't call xref_tag. */
11479 if (tag_type == typename_type
11480 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
11481 return cp_parser_make_typename_type (parser, parser->scope,
11484 /* Look up a qualified name in the usual way. */
11488 tree ambiguous_decls;
11490 decl = cp_parser_lookup_name (parser, identifier,
11492 /*is_template=*/false,
11493 /*is_namespace=*/false,
11494 /*check_dependency=*/true,
11498 /* If the lookup was ambiguous, an error will already have been
11500 if (ambiguous_decls)
11501 return error_mark_node;
11503 /* If we are parsing friend declaration, DECL may be a
11504 TEMPLATE_DECL tree node here. However, we need to check
11505 whether this TEMPLATE_DECL results in valid code. Consider
11506 the following example:
11509 template <class T> class C {};
11512 template <class T> friend class N::C; // #1, valid code
11514 template <class T> class Y {
11515 friend class N::C; // #2, invalid code
11518 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
11519 name lookup of `N::C'. We see that friend declaration must
11520 be template for the code to be valid. Note that
11521 processing_template_decl does not work here since it is
11522 always 1 for the above two cases. */
11524 decl = (cp_parser_maybe_treat_template_as_class
11525 (decl, /*tag_name_p=*/is_friend
11526 && parser->num_template_parameter_lists));
11528 if (TREE_CODE (decl) != TYPE_DECL)
11530 cp_parser_diagnose_invalid_type_name (parser,
11534 return error_mark_node;
11537 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
11539 bool allow_template = (parser->num_template_parameter_lists
11540 || DECL_SELF_REFERENCE_P (decl));
11541 type = check_elaborated_type_specifier (tag_type, decl,
11544 if (type == error_mark_node)
11545 return error_mark_node;
11548 /* Forward declarations of nested types, such as
11553 are invalid unless all components preceding the final '::'
11554 are complete. If all enclosing types are complete, these
11555 declarations become merely pointless.
11557 Invalid forward declarations of nested types are errors
11558 caught elsewhere in parsing. Those that are pointless arrive
11561 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
11562 && !is_friend && !processing_explicit_instantiation)
11563 warning (0, "declaration %qD does not declare anything", decl);
11565 type = TREE_TYPE (decl);
11569 /* An elaborated-type-specifier sometimes introduces a new type and
11570 sometimes names an existing type. Normally, the rule is that it
11571 introduces a new type only if there is not an existing type of
11572 the same name already in scope. For example, given:
11575 void f() { struct S s; }
11577 the `struct S' in the body of `f' is the same `struct S' as in
11578 the global scope; the existing definition is used. However, if
11579 there were no global declaration, this would introduce a new
11580 local class named `S'.
11582 An exception to this rule applies to the following code:
11584 namespace N { struct S; }
11586 Here, the elaborated-type-specifier names a new type
11587 unconditionally; even if there is already an `S' in the
11588 containing scope this declaration names a new type.
11589 This exception only applies if the elaborated-type-specifier
11590 forms the complete declaration:
11594 A declaration consisting solely of `class-key identifier ;' is
11595 either a redeclaration of the name in the current scope or a
11596 forward declaration of the identifier as a class name. It
11597 introduces the name into the current scope.
11599 We are in this situation precisely when the next token is a `;'.
11601 An exception to the exception is that a `friend' declaration does
11602 *not* name a new type; i.e., given:
11604 struct S { friend struct T; };
11606 `T' is not a new type in the scope of `S'.
11608 Also, `new struct S' or `sizeof (struct S)' never results in the
11609 definition of a new type; a new type can only be declared in a
11610 declaration context. */
11616 /* Friends have special name lookup rules. */
11617 ts = ts_within_enclosing_non_class;
11618 else if (is_declaration
11619 && cp_lexer_next_token_is (parser->lexer,
11621 /* This is a `class-key identifier ;' */
11627 (parser->num_template_parameter_lists
11628 && (cp_parser_next_token_starts_class_definition_p (parser)
11629 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
11630 /* An unqualified name was used to reference this type, so
11631 there were no qualifying templates. */
11632 if (!cp_parser_check_template_parameters (parser,
11633 /*num_templates=*/0,
11635 return error_mark_node;
11636 type = xref_tag (tag_type, identifier, ts, template_p);
11640 if (type == error_mark_node)
11641 return error_mark_node;
11643 /* Allow attributes on forward declarations of classes. */
11646 if (TREE_CODE (type) == TYPENAME_TYPE)
11647 warning (OPT_Wattributes,
11648 "attributes ignored on uninstantiated type");
11649 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
11650 && ! processing_explicit_instantiation)
11651 warning (OPT_Wattributes,
11652 "attributes ignored on template instantiation");
11653 else if (is_declaration && cp_parser_declares_only_class_p (parser))
11654 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
11656 warning (OPT_Wattributes,
11657 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
11660 if (tag_type != enum_type)
11661 cp_parser_check_class_key (tag_type, type);
11663 /* A "<" cannot follow an elaborated type specifier. If that
11664 happens, the user was probably trying to form a template-id. */
11665 cp_parser_check_for_invalid_template_id (parser, type, token->location);
11670 /* Parse an enum-specifier.
11673 enum-key identifier [opt] enum-base [opt] { enumerator-list [opt] }
11678 enum struct [C++0x]
11681 : type-specifier-seq
11684 enum-key attributes[opt] identifier [opt] enum-base [opt]
11685 { enumerator-list [opt] }attributes[opt]
11687 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
11688 if the token stream isn't an enum-specifier after all. */
11691 cp_parser_enum_specifier (cp_parser* parser)
11696 bool scoped_enum_p = false;
11697 tree underlying_type = NULL_TREE;
11699 /* Parse tentatively so that we can back up if we don't find a
11701 cp_parser_parse_tentatively (parser);
11703 /* Caller guarantees that the current token is 'enum', an identifier
11704 possibly follows, and the token after that is an opening brace.
11705 If we don't have an identifier, fabricate an anonymous name for
11706 the enumeration being defined. */
11707 cp_lexer_consume_token (parser->lexer);
11709 /* Parse the "class" or "struct", which indicates a scoped
11710 enumeration type in C++0x. */
11711 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
11712 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
11714 if (cxx_dialect == cxx98)
11715 maybe_warn_cpp0x ("scoped enums");
11717 /* Consume the `struct' or `class' token. */
11718 cp_lexer_consume_token (parser->lexer);
11720 scoped_enum_p = true;
11723 attributes = cp_parser_attributes_opt (parser);
11725 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
11726 identifier = cp_parser_identifier (parser);
11728 identifier = make_anon_name ();
11730 /* Check for the `:' that denotes a specified underlying type in C++0x. */
11731 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
11733 cp_decl_specifier_seq type_specifiers;
11735 if (cxx_dialect == cxx98)
11736 maybe_warn_cpp0x ("scoped enums");
11738 /* Consume the `:'. */
11739 cp_lexer_consume_token (parser->lexer);
11741 /* Parse the type-specifier-seq. */
11742 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
11744 if (type_specifiers.type == error_mark_node)
11745 return error_mark_node;
11747 /* If that didn't work, stop. */
11748 if (type_specifiers.type != error_mark_node)
11750 underlying_type = grokdeclarator (NULL, &type_specifiers, TYPENAME,
11751 /*initialized=*/0, NULL);
11752 if (underlying_type == error_mark_node)
11753 underlying_type = NULL_TREE;
11756 cp_parser_error (parser, "expected underlying type of enumeration");
11759 /* Look for the `{' but don't consume it yet. */
11760 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11761 cp_parser_simulate_error (parser);
11763 if (!cp_parser_parse_definitely (parser))
11766 /* Issue an error message if type-definitions are forbidden here. */
11767 if (!cp_parser_check_type_definition (parser))
11768 type = error_mark_node;
11770 /* Create the new type. We do this before consuming the opening
11771 brace so the enum will be recorded as being on the line of its
11772 tag (or the 'enum' keyword, if there is no tag). */
11773 type = start_enum (identifier, underlying_type, scoped_enum_p);
11775 /* Consume the opening brace. */
11776 cp_lexer_consume_token (parser->lexer);
11778 if (type == error_mark_node)
11780 cp_parser_skip_to_end_of_block_or_statement (parser);
11781 return error_mark_node;
11784 /* If the next token is not '}', then there are some enumerators. */
11785 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
11786 cp_parser_enumerator_list (parser, type);
11788 /* Consume the final '}'. */
11789 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
11791 /* Look for trailing attributes to apply to this enumeration, and
11792 apply them if appropriate. */
11793 if (cp_parser_allow_gnu_extensions_p (parser))
11795 tree trailing_attr = cp_parser_attributes_opt (parser);
11796 cplus_decl_attributes (&type,
11798 (int) ATTR_FLAG_TYPE_IN_PLACE);
11801 /* Finish up the enumeration. */
11802 finish_enum (type);
11807 /* Parse an enumerator-list. The enumerators all have the indicated
11811 enumerator-definition
11812 enumerator-list , enumerator-definition */
11815 cp_parser_enumerator_list (cp_parser* parser, tree type)
11819 /* Parse an enumerator-definition. */
11820 cp_parser_enumerator_definition (parser, type);
11822 /* If the next token is not a ',', we've reached the end of
11824 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11826 /* Otherwise, consume the `,' and keep going. */
11827 cp_lexer_consume_token (parser->lexer);
11828 /* If the next token is a `}', there is a trailing comma. */
11829 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
11831 if (!in_system_header)
11832 pedwarn (input_location, OPT_pedantic, "comma at end of enumerator list");
11838 /* Parse an enumerator-definition. The enumerator has the indicated
11841 enumerator-definition:
11843 enumerator = constant-expression
11849 cp_parser_enumerator_definition (cp_parser* parser, tree type)
11854 /* Look for the identifier. */
11855 identifier = cp_parser_identifier (parser);
11856 if (identifier == error_mark_node)
11859 /* If the next token is an '=', then there is an explicit value. */
11860 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11862 /* Consume the `=' token. */
11863 cp_lexer_consume_token (parser->lexer);
11864 /* Parse the value. */
11865 value = cp_parser_constant_expression (parser,
11866 /*allow_non_constant_p=*/false,
11872 /* Create the enumerator. */
11873 build_enumerator (identifier, value, type);
11876 /* Parse a namespace-name.
11879 original-namespace-name
11882 Returns the NAMESPACE_DECL for the namespace. */
11885 cp_parser_namespace_name (cp_parser* parser)
11888 tree namespace_decl;
11890 cp_token *token = cp_lexer_peek_token (parser->lexer);
11892 /* Get the name of the namespace. */
11893 identifier = cp_parser_identifier (parser);
11894 if (identifier == error_mark_node)
11895 return error_mark_node;
11897 /* Look up the identifier in the currently active scope. Look only
11898 for namespaces, due to:
11900 [basic.lookup.udir]
11902 When looking up a namespace-name in a using-directive or alias
11903 definition, only namespace names are considered.
11907 [basic.lookup.qual]
11909 During the lookup of a name preceding the :: scope resolution
11910 operator, object, function, and enumerator names are ignored.
11912 (Note that cp_parser_qualifying_entity only calls this
11913 function if the token after the name is the scope resolution
11915 namespace_decl = cp_parser_lookup_name (parser, identifier,
11917 /*is_template=*/false,
11918 /*is_namespace=*/true,
11919 /*check_dependency=*/true,
11920 /*ambiguous_decls=*/NULL,
11922 /* If it's not a namespace, issue an error. */
11923 if (namespace_decl == error_mark_node
11924 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
11926 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
11927 error ("%H%qD is not a namespace-name", &token->location, identifier);
11928 cp_parser_error (parser, "expected namespace-name");
11929 namespace_decl = error_mark_node;
11932 return namespace_decl;
11935 /* Parse a namespace-definition.
11937 namespace-definition:
11938 named-namespace-definition
11939 unnamed-namespace-definition
11941 named-namespace-definition:
11942 original-namespace-definition
11943 extension-namespace-definition
11945 original-namespace-definition:
11946 namespace identifier { namespace-body }
11948 extension-namespace-definition:
11949 namespace original-namespace-name { namespace-body }
11951 unnamed-namespace-definition:
11952 namespace { namespace-body } */
11955 cp_parser_namespace_definition (cp_parser* parser)
11957 tree identifier, attribs;
11958 bool has_visibility;
11961 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_INLINE))
11964 cp_lexer_consume_token (parser->lexer);
11969 /* Look for the `namespace' keyword. */
11970 cp_parser_require_keyword (parser, RID_NAMESPACE, "%<namespace%>");
11972 /* Get the name of the namespace. We do not attempt to distinguish
11973 between an original-namespace-definition and an
11974 extension-namespace-definition at this point. The semantic
11975 analysis routines are responsible for that. */
11976 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
11977 identifier = cp_parser_identifier (parser);
11979 identifier = NULL_TREE;
11981 /* Parse any specified attributes. */
11982 attribs = cp_parser_attributes_opt (parser);
11984 /* Look for the `{' to start the namespace. */
11985 cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>");
11986 /* Start the namespace. */
11987 push_namespace (identifier);
11989 /* "inline namespace" is equivalent to a stub namespace definition
11990 followed by a strong using directive. */
11993 tree name_space = current_namespace;
11994 /* Set up namespace association. */
11995 DECL_NAMESPACE_ASSOCIATIONS (name_space)
11996 = tree_cons (CP_DECL_CONTEXT (name_space), NULL_TREE,
11997 DECL_NAMESPACE_ASSOCIATIONS (name_space));
11998 /* Import the contents of the inline namespace. */
12000 do_using_directive (name_space);
12001 push_namespace (identifier);
12004 has_visibility = handle_namespace_attrs (current_namespace, attribs);
12006 /* Parse the body of the namespace. */
12007 cp_parser_namespace_body (parser);
12009 #ifdef HANDLE_PRAGMA_VISIBILITY
12010 if (has_visibility)
12014 /* Finish the namespace. */
12016 /* Look for the final `}'. */
12017 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
12020 /* Parse a namespace-body.
12023 declaration-seq [opt] */
12026 cp_parser_namespace_body (cp_parser* parser)
12028 cp_parser_declaration_seq_opt (parser);
12031 /* Parse a namespace-alias-definition.
12033 namespace-alias-definition:
12034 namespace identifier = qualified-namespace-specifier ; */
12037 cp_parser_namespace_alias_definition (cp_parser* parser)
12040 tree namespace_specifier;
12042 cp_token *token = cp_lexer_peek_token (parser->lexer);
12044 /* Look for the `namespace' keyword. */
12045 cp_parser_require_keyword (parser, RID_NAMESPACE, "%<namespace%>");
12046 /* Look for the identifier. */
12047 identifier = cp_parser_identifier (parser);
12048 if (identifier == error_mark_node)
12050 /* Look for the `=' token. */
12051 if (!cp_parser_uncommitted_to_tentative_parse_p (parser)
12052 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
12054 error ("%H%<namespace%> definition is not allowed here", &token->location);
12055 /* Skip the definition. */
12056 cp_lexer_consume_token (parser->lexer);
12057 if (cp_parser_skip_to_closing_brace (parser))
12058 cp_lexer_consume_token (parser->lexer);
12061 cp_parser_require (parser, CPP_EQ, "%<=%>");
12062 /* Look for the qualified-namespace-specifier. */
12063 namespace_specifier
12064 = cp_parser_qualified_namespace_specifier (parser);
12065 /* Look for the `;' token. */
12066 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12068 /* Register the alias in the symbol table. */
12069 do_namespace_alias (identifier, namespace_specifier);
12072 /* Parse a qualified-namespace-specifier.
12074 qualified-namespace-specifier:
12075 :: [opt] nested-name-specifier [opt] namespace-name
12077 Returns a NAMESPACE_DECL corresponding to the specified
12081 cp_parser_qualified_namespace_specifier (cp_parser* parser)
12083 /* Look for the optional `::'. */
12084 cp_parser_global_scope_opt (parser,
12085 /*current_scope_valid_p=*/false);
12087 /* Look for the optional nested-name-specifier. */
12088 cp_parser_nested_name_specifier_opt (parser,
12089 /*typename_keyword_p=*/false,
12090 /*check_dependency_p=*/true,
12092 /*is_declaration=*/true);
12094 return cp_parser_namespace_name (parser);
12097 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
12098 access declaration.
12101 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
12102 using :: unqualified-id ;
12104 access-declaration:
12110 cp_parser_using_declaration (cp_parser* parser,
12111 bool access_declaration_p)
12114 bool typename_p = false;
12115 bool global_scope_p;
12120 if (access_declaration_p)
12121 cp_parser_parse_tentatively (parser);
12124 /* Look for the `using' keyword. */
12125 cp_parser_require_keyword (parser, RID_USING, "%<using%>");
12127 /* Peek at the next token. */
12128 token = cp_lexer_peek_token (parser->lexer);
12129 /* See if it's `typename'. */
12130 if (token->keyword == RID_TYPENAME)
12132 /* Remember that we've seen it. */
12134 /* Consume the `typename' token. */
12135 cp_lexer_consume_token (parser->lexer);
12139 /* Look for the optional global scope qualification. */
12141 = (cp_parser_global_scope_opt (parser,
12142 /*current_scope_valid_p=*/false)
12145 /* If we saw `typename', or didn't see `::', then there must be a
12146 nested-name-specifier present. */
12147 if (typename_p || !global_scope_p)
12148 qscope = cp_parser_nested_name_specifier (parser, typename_p,
12149 /*check_dependency_p=*/true,
12151 /*is_declaration=*/true);
12152 /* Otherwise, we could be in either of the two productions. In that
12153 case, treat the nested-name-specifier as optional. */
12155 qscope = cp_parser_nested_name_specifier_opt (parser,
12156 /*typename_keyword_p=*/false,
12157 /*check_dependency_p=*/true,
12159 /*is_declaration=*/true);
12161 qscope = global_namespace;
12163 if (access_declaration_p && cp_parser_error_occurred (parser))
12164 /* Something has already gone wrong; there's no need to parse
12165 further. Since an error has occurred, the return value of
12166 cp_parser_parse_definitely will be false, as required. */
12167 return cp_parser_parse_definitely (parser);
12169 token = cp_lexer_peek_token (parser->lexer);
12170 /* Parse the unqualified-id. */
12171 identifier = cp_parser_unqualified_id (parser,
12172 /*template_keyword_p=*/false,
12173 /*check_dependency_p=*/true,
12174 /*declarator_p=*/true,
12175 /*optional_p=*/false);
12177 if (access_declaration_p)
12179 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
12180 cp_parser_simulate_error (parser);
12181 if (!cp_parser_parse_definitely (parser))
12185 /* The function we call to handle a using-declaration is different
12186 depending on what scope we are in. */
12187 if (qscope == error_mark_node || identifier == error_mark_node)
12189 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
12190 && TREE_CODE (identifier) != BIT_NOT_EXPR)
12191 /* [namespace.udecl]
12193 A using declaration shall not name a template-id. */
12194 error ("%Ha template-id may not appear in a using-declaration",
12198 if (at_class_scope_p ())
12200 /* Create the USING_DECL. */
12201 decl = do_class_using_decl (parser->scope, identifier);
12203 if (check_for_bare_parameter_packs (decl))
12206 /* Add it to the list of members in this class. */
12207 finish_member_declaration (decl);
12211 decl = cp_parser_lookup_name_simple (parser,
12214 if (decl == error_mark_node)
12215 cp_parser_name_lookup_error (parser, identifier,
12218 else if (check_for_bare_parameter_packs (decl))
12220 else if (!at_namespace_scope_p ())
12221 do_local_using_decl (decl, qscope, identifier);
12223 do_toplevel_using_decl (decl, qscope, identifier);
12227 /* Look for the final `;'. */
12228 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12233 /* Parse a using-directive.
12236 using namespace :: [opt] nested-name-specifier [opt]
12237 namespace-name ; */
12240 cp_parser_using_directive (cp_parser* parser)
12242 tree namespace_decl;
12245 /* Look for the `using' keyword. */
12246 cp_parser_require_keyword (parser, RID_USING, "%<using%>");
12247 /* And the `namespace' keyword. */
12248 cp_parser_require_keyword (parser, RID_NAMESPACE, "%<namespace%>");
12249 /* Look for the optional `::' operator. */
12250 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
12251 /* And the optional nested-name-specifier. */
12252 cp_parser_nested_name_specifier_opt (parser,
12253 /*typename_keyword_p=*/false,
12254 /*check_dependency_p=*/true,
12256 /*is_declaration=*/true);
12257 /* Get the namespace being used. */
12258 namespace_decl = cp_parser_namespace_name (parser);
12259 /* And any specified attributes. */
12260 attribs = cp_parser_attributes_opt (parser);
12261 /* Update the symbol table. */
12262 parse_using_directive (namespace_decl, attribs);
12263 /* Look for the final `;'. */
12264 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12267 /* Parse an asm-definition.
12270 asm ( string-literal ) ;
12275 asm volatile [opt] ( string-literal ) ;
12276 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
12277 asm volatile [opt] ( string-literal : asm-operand-list [opt]
12278 : asm-operand-list [opt] ) ;
12279 asm volatile [opt] ( string-literal : asm-operand-list [opt]
12280 : asm-operand-list [opt]
12281 : asm-operand-list [opt] ) ; */
12284 cp_parser_asm_definition (cp_parser* parser)
12287 tree outputs = NULL_TREE;
12288 tree inputs = NULL_TREE;
12289 tree clobbers = NULL_TREE;
12291 bool volatile_p = false;
12292 bool extended_p = false;
12293 bool invalid_inputs_p = false;
12294 bool invalid_outputs_p = false;
12296 /* Look for the `asm' keyword. */
12297 cp_parser_require_keyword (parser, RID_ASM, "%<asm%>");
12298 /* See if the next token is `volatile'. */
12299 if (cp_parser_allow_gnu_extensions_p (parser)
12300 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
12302 /* Remember that we saw the `volatile' keyword. */
12304 /* Consume the token. */
12305 cp_lexer_consume_token (parser->lexer);
12307 /* Look for the opening `('. */
12308 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
12310 /* Look for the string. */
12311 string = cp_parser_string_literal (parser, false, false);
12312 if (string == error_mark_node)
12314 cp_parser_skip_to_closing_parenthesis (parser, true, false,
12315 /*consume_paren=*/true);
12319 /* If we're allowing GNU extensions, check for the extended assembly
12320 syntax. Unfortunately, the `:' tokens need not be separated by
12321 a space in C, and so, for compatibility, we tolerate that here
12322 too. Doing that means that we have to treat the `::' operator as
12324 if (cp_parser_allow_gnu_extensions_p (parser)
12325 && parser->in_function_body
12326 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
12327 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
12329 bool inputs_p = false;
12330 bool clobbers_p = false;
12332 /* The extended syntax was used. */
12335 /* Look for outputs. */
12336 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12338 /* Consume the `:'. */
12339 cp_lexer_consume_token (parser->lexer);
12340 /* Parse the output-operands. */
12341 if (cp_lexer_next_token_is_not (parser->lexer,
12343 && cp_lexer_next_token_is_not (parser->lexer,
12345 && cp_lexer_next_token_is_not (parser->lexer,
12347 outputs = cp_parser_asm_operand_list (parser);
12349 if (outputs == error_mark_node)
12350 invalid_outputs_p = true;
12352 /* If the next token is `::', there are no outputs, and the
12353 next token is the beginning of the inputs. */
12354 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12355 /* The inputs are coming next. */
12358 /* Look for inputs. */
12360 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12362 /* Consume the `:' or `::'. */
12363 cp_lexer_consume_token (parser->lexer);
12364 /* Parse the output-operands. */
12365 if (cp_lexer_next_token_is_not (parser->lexer,
12367 && cp_lexer_next_token_is_not (parser->lexer,
12369 inputs = cp_parser_asm_operand_list (parser);
12371 if (inputs == error_mark_node)
12372 invalid_inputs_p = true;
12374 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12375 /* The clobbers are coming next. */
12378 /* Look for clobbers. */
12380 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12382 /* Consume the `:' or `::'. */
12383 cp_lexer_consume_token (parser->lexer);
12384 /* Parse the clobbers. */
12385 if (cp_lexer_next_token_is_not (parser->lexer,
12387 clobbers = cp_parser_asm_clobber_list (parser);
12390 /* Look for the closing `)'. */
12391 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
12392 cp_parser_skip_to_closing_parenthesis (parser, true, false,
12393 /*consume_paren=*/true);
12394 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
12396 if (!invalid_inputs_p && !invalid_outputs_p)
12398 /* Create the ASM_EXPR. */
12399 if (parser->in_function_body)
12401 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
12403 /* If the extended syntax was not used, mark the ASM_EXPR. */
12406 tree temp = asm_stmt;
12407 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
12408 temp = TREE_OPERAND (temp, 0);
12410 ASM_INPUT_P (temp) = 1;
12414 cgraph_add_asm_node (string);
12418 /* Declarators [gram.dcl.decl] */
12420 /* Parse an init-declarator.
12423 declarator initializer [opt]
12428 declarator asm-specification [opt] attributes [opt] initializer [opt]
12430 function-definition:
12431 decl-specifier-seq [opt] declarator ctor-initializer [opt]
12433 decl-specifier-seq [opt] declarator function-try-block
12437 function-definition:
12438 __extension__ function-definition
12440 The DECL_SPECIFIERS apply to this declarator. Returns a
12441 representation of the entity declared. If MEMBER_P is TRUE, then
12442 this declarator appears in a class scope. The new DECL created by
12443 this declarator is returned.
12445 The CHECKS are access checks that should be performed once we know
12446 what entity is being declared (and, therefore, what classes have
12449 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
12450 for a function-definition here as well. If the declarator is a
12451 declarator for a function-definition, *FUNCTION_DEFINITION_P will
12452 be TRUE upon return. By that point, the function-definition will
12453 have been completely parsed.
12455 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
12459 cp_parser_init_declarator (cp_parser* parser,
12460 cp_decl_specifier_seq *decl_specifiers,
12461 VEC (deferred_access_check,gc)* checks,
12462 bool function_definition_allowed_p,
12464 int declares_class_or_enum,
12465 bool* function_definition_p)
12467 cp_token *token = NULL, *asm_spec_start_token = NULL,
12468 *attributes_start_token = NULL;
12469 cp_declarator *declarator;
12470 tree prefix_attributes;
12472 tree asm_specification;
12474 tree decl = NULL_TREE;
12476 int is_initialized;
12477 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
12478 initialized with "= ..", CPP_OPEN_PAREN if initialized with
12480 enum cpp_ttype initialization_kind;
12481 bool is_direct_init = false;
12482 bool is_non_constant_init;
12483 int ctor_dtor_or_conv_p;
12485 tree pushed_scope = NULL;
12487 /* Gather the attributes that were provided with the
12488 decl-specifiers. */
12489 prefix_attributes = decl_specifiers->attributes;
12491 /* Assume that this is not the declarator for a function
12493 if (function_definition_p)
12494 *function_definition_p = false;
12496 /* Defer access checks while parsing the declarator; we cannot know
12497 what names are accessible until we know what is being
12499 resume_deferring_access_checks ();
12501 /* Parse the declarator. */
12502 token = cp_lexer_peek_token (parser->lexer);
12504 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
12505 &ctor_dtor_or_conv_p,
12506 /*parenthesized_p=*/NULL,
12507 /*member_p=*/false);
12508 /* Gather up the deferred checks. */
12509 stop_deferring_access_checks ();
12511 /* If the DECLARATOR was erroneous, there's no need to go
12513 if (declarator == cp_error_declarator)
12514 return error_mark_node;
12516 /* Check that the number of template-parameter-lists is OK. */
12517 if (!cp_parser_check_declarator_template_parameters (parser, declarator,
12519 return error_mark_node;
12521 if (declares_class_or_enum & 2)
12522 cp_parser_check_for_definition_in_return_type (declarator,
12523 decl_specifiers->type,
12524 decl_specifiers->type_location);
12526 /* Figure out what scope the entity declared by the DECLARATOR is
12527 located in. `grokdeclarator' sometimes changes the scope, so
12528 we compute it now. */
12529 scope = get_scope_of_declarator (declarator);
12531 /* If we're allowing GNU extensions, look for an asm-specification
12533 if (cp_parser_allow_gnu_extensions_p (parser))
12535 /* Look for an asm-specification. */
12536 asm_spec_start_token = cp_lexer_peek_token (parser->lexer);
12537 asm_specification = cp_parser_asm_specification_opt (parser);
12538 /* And attributes. */
12539 attributes_start_token = cp_lexer_peek_token (parser->lexer);
12540 attributes = cp_parser_attributes_opt (parser);
12544 asm_specification = NULL_TREE;
12545 attributes = NULL_TREE;
12548 /* Peek at the next token. */
12549 token = cp_lexer_peek_token (parser->lexer);
12550 /* Check to see if the token indicates the start of a
12551 function-definition. */
12552 if (function_declarator_p (declarator)
12553 && cp_parser_token_starts_function_definition_p (token))
12555 if (!function_definition_allowed_p)
12557 /* If a function-definition should not appear here, issue an
12559 cp_parser_error (parser,
12560 "a function-definition is not allowed here");
12561 return error_mark_node;
12565 /* Neither attributes nor an asm-specification are allowed
12566 on a function-definition. */
12567 if (asm_specification)
12568 error ("%Han asm-specification is not allowed "
12569 "on a function-definition",
12570 &asm_spec_start_token->location);
12572 error ("%Hattributes are not allowed on a function-definition",
12573 &attributes_start_token->location);
12574 /* This is a function-definition. */
12575 *function_definition_p = true;
12577 /* Parse the function definition. */
12579 decl = cp_parser_save_member_function_body (parser,
12582 prefix_attributes);
12585 = (cp_parser_function_definition_from_specifiers_and_declarator
12586 (parser, decl_specifiers, prefix_attributes, declarator));
12594 Only in function declarations for constructors, destructors, and
12595 type conversions can the decl-specifier-seq be omitted.
12597 We explicitly postpone this check past the point where we handle
12598 function-definitions because we tolerate function-definitions
12599 that are missing their return types in some modes. */
12600 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
12602 cp_parser_error (parser,
12603 "expected constructor, destructor, or type conversion");
12604 return error_mark_node;
12607 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
12608 if (token->type == CPP_EQ
12609 || token->type == CPP_OPEN_PAREN
12610 || token->type == CPP_OPEN_BRACE)
12612 is_initialized = 1;
12613 initialization_kind = token->type;
12615 if (token->type == CPP_EQ
12616 && function_declarator_p (declarator))
12618 cp_token *t2 = cp_lexer_peek_nth_token (parser->lexer, 2);
12619 if (t2->keyword == RID_DEFAULT)
12620 is_initialized = 2;
12621 else if (t2->keyword == RID_DELETE)
12622 is_initialized = 3;
12627 /* If the init-declarator isn't initialized and isn't followed by a
12628 `,' or `;', it's not a valid init-declarator. */
12629 if (token->type != CPP_COMMA
12630 && token->type != CPP_SEMICOLON)
12632 cp_parser_error (parser, "expected initializer");
12633 return error_mark_node;
12635 is_initialized = 0;
12636 initialization_kind = CPP_EOF;
12639 /* Because start_decl has side-effects, we should only call it if we
12640 know we're going ahead. By this point, we know that we cannot
12641 possibly be looking at any other construct. */
12642 cp_parser_commit_to_tentative_parse (parser);
12644 /* If the decl specifiers were bad, issue an error now that we're
12645 sure this was intended to be a declarator. Then continue
12646 declaring the variable(s), as int, to try to cut down on further
12648 if (decl_specifiers->any_specifiers_p
12649 && decl_specifiers->type == error_mark_node)
12651 cp_parser_error (parser, "invalid type in declaration");
12652 decl_specifiers->type = integer_type_node;
12655 /* Check to see whether or not this declaration is a friend. */
12656 friend_p = cp_parser_friend_p (decl_specifiers);
12658 /* Enter the newly declared entry in the symbol table. If we're
12659 processing a declaration in a class-specifier, we wait until
12660 after processing the initializer. */
12663 if (parser->in_unbraced_linkage_specification_p)
12664 decl_specifiers->storage_class = sc_extern;
12665 decl = start_decl (declarator, decl_specifiers,
12666 is_initialized, attributes, prefix_attributes,
12670 /* Enter the SCOPE. That way unqualified names appearing in the
12671 initializer will be looked up in SCOPE. */
12672 pushed_scope = push_scope (scope);
12674 /* Perform deferred access control checks, now that we know in which
12675 SCOPE the declared entity resides. */
12676 if (!member_p && decl)
12678 tree saved_current_function_decl = NULL_TREE;
12680 /* If the entity being declared is a function, pretend that we
12681 are in its scope. If it is a `friend', it may have access to
12682 things that would not otherwise be accessible. */
12683 if (TREE_CODE (decl) == FUNCTION_DECL)
12685 saved_current_function_decl = current_function_decl;
12686 current_function_decl = decl;
12689 /* Perform access checks for template parameters. */
12690 cp_parser_perform_template_parameter_access_checks (checks);
12692 /* Perform the access control checks for the declarator and the
12693 decl-specifiers. */
12694 perform_deferred_access_checks ();
12696 /* Restore the saved value. */
12697 if (TREE_CODE (decl) == FUNCTION_DECL)
12698 current_function_decl = saved_current_function_decl;
12701 /* Parse the initializer. */
12702 initializer = NULL_TREE;
12703 is_direct_init = false;
12704 is_non_constant_init = true;
12705 if (is_initialized)
12707 if (function_declarator_p (declarator))
12709 cp_token *initializer_start_token = cp_lexer_peek_token (parser->lexer);
12710 if (initialization_kind == CPP_EQ)
12711 initializer = cp_parser_pure_specifier (parser);
12714 /* If the declaration was erroneous, we don't really
12715 know what the user intended, so just silently
12716 consume the initializer. */
12717 if (decl != error_mark_node)
12718 error ("%Hinitializer provided for function",
12719 &initializer_start_token->location);
12720 cp_parser_skip_to_closing_parenthesis (parser,
12721 /*recovering=*/true,
12722 /*or_comma=*/false,
12723 /*consume_paren=*/true);
12727 initializer = cp_parser_initializer (parser,
12729 &is_non_constant_init);
12732 /* The old parser allows attributes to appear after a parenthesized
12733 initializer. Mark Mitchell proposed removing this functionality
12734 on the GCC mailing lists on 2002-08-13. This parser accepts the
12735 attributes -- but ignores them. */
12736 if (cp_parser_allow_gnu_extensions_p (parser)
12737 && initialization_kind == CPP_OPEN_PAREN)
12738 if (cp_parser_attributes_opt (parser))
12739 warning (OPT_Wattributes,
12740 "attributes after parenthesized initializer ignored");
12742 /* For an in-class declaration, use `grokfield' to create the
12748 pop_scope (pushed_scope);
12749 pushed_scope = false;
12751 decl = grokfield (declarator, decl_specifiers,
12752 initializer, !is_non_constant_init,
12753 /*asmspec=*/NULL_TREE,
12754 prefix_attributes);
12755 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
12756 cp_parser_save_default_args (parser, decl);
12759 /* Finish processing the declaration. But, skip friend
12761 if (!friend_p && decl && decl != error_mark_node)
12763 cp_finish_decl (decl,
12764 initializer, !is_non_constant_init,
12766 /* If the initializer is in parentheses, then this is
12767 a direct-initialization, which means that an
12768 `explicit' constructor is OK. Otherwise, an
12769 `explicit' constructor cannot be used. */
12770 ((is_direct_init || !is_initialized)
12771 ? 0 : LOOKUP_ONLYCONVERTING));
12773 else if ((cxx_dialect != cxx98) && friend_p
12774 && decl && TREE_CODE (decl) == FUNCTION_DECL)
12775 /* Core issue #226 (C++0x only): A default template-argument
12776 shall not be specified in a friend class template
12778 check_default_tmpl_args (decl, current_template_parms, /*is_primary=*/1,
12779 /*is_partial=*/0, /*is_friend_decl=*/1);
12781 if (!friend_p && pushed_scope)
12782 pop_scope (pushed_scope);
12787 /* Parse a declarator.
12791 ptr-operator declarator
12793 abstract-declarator:
12794 ptr-operator abstract-declarator [opt]
12795 direct-abstract-declarator
12800 attributes [opt] direct-declarator
12801 attributes [opt] ptr-operator declarator
12803 abstract-declarator:
12804 attributes [opt] ptr-operator abstract-declarator [opt]
12805 attributes [opt] direct-abstract-declarator
12807 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
12808 detect constructor, destructor or conversion operators. It is set
12809 to -1 if the declarator is a name, and +1 if it is a
12810 function. Otherwise it is set to zero. Usually you just want to
12811 test for >0, but internally the negative value is used.
12813 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
12814 a decl-specifier-seq unless it declares a constructor, destructor,
12815 or conversion. It might seem that we could check this condition in
12816 semantic analysis, rather than parsing, but that makes it difficult
12817 to handle something like `f()'. We want to notice that there are
12818 no decl-specifiers, and therefore realize that this is an
12819 expression, not a declaration.)
12821 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
12822 the declarator is a direct-declarator of the form "(...)".
12824 MEMBER_P is true iff this declarator is a member-declarator. */
12826 static cp_declarator *
12827 cp_parser_declarator (cp_parser* parser,
12828 cp_parser_declarator_kind dcl_kind,
12829 int* ctor_dtor_or_conv_p,
12830 bool* parenthesized_p,
12834 cp_declarator *declarator;
12835 enum tree_code code;
12836 cp_cv_quals cv_quals;
12838 tree attributes = NULL_TREE;
12840 /* Assume this is not a constructor, destructor, or type-conversion
12842 if (ctor_dtor_or_conv_p)
12843 *ctor_dtor_or_conv_p = 0;
12845 if (cp_parser_allow_gnu_extensions_p (parser))
12846 attributes = cp_parser_attributes_opt (parser);
12848 /* Peek at the next token. */
12849 token = cp_lexer_peek_token (parser->lexer);
12851 /* Check for the ptr-operator production. */
12852 cp_parser_parse_tentatively (parser);
12853 /* Parse the ptr-operator. */
12854 code = cp_parser_ptr_operator (parser,
12857 /* If that worked, then we have a ptr-operator. */
12858 if (cp_parser_parse_definitely (parser))
12860 /* If a ptr-operator was found, then this declarator was not
12862 if (parenthesized_p)
12863 *parenthesized_p = true;
12864 /* The dependent declarator is optional if we are parsing an
12865 abstract-declarator. */
12866 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
12867 cp_parser_parse_tentatively (parser);
12869 /* Parse the dependent declarator. */
12870 declarator = cp_parser_declarator (parser, dcl_kind,
12871 /*ctor_dtor_or_conv_p=*/NULL,
12872 /*parenthesized_p=*/NULL,
12873 /*member_p=*/false);
12875 /* If we are parsing an abstract-declarator, we must handle the
12876 case where the dependent declarator is absent. */
12877 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
12878 && !cp_parser_parse_definitely (parser))
12881 declarator = cp_parser_make_indirect_declarator
12882 (code, class_type, cv_quals, declarator);
12884 /* Everything else is a direct-declarator. */
12887 if (parenthesized_p)
12888 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
12890 declarator = cp_parser_direct_declarator (parser, dcl_kind,
12891 ctor_dtor_or_conv_p,
12895 if (attributes && declarator && declarator != cp_error_declarator)
12896 declarator->attributes = attributes;
12901 /* Parse a direct-declarator or direct-abstract-declarator.
12905 direct-declarator ( parameter-declaration-clause )
12906 cv-qualifier-seq [opt]
12907 exception-specification [opt]
12908 direct-declarator [ constant-expression [opt] ]
12911 direct-abstract-declarator:
12912 direct-abstract-declarator [opt]
12913 ( parameter-declaration-clause )
12914 cv-qualifier-seq [opt]
12915 exception-specification [opt]
12916 direct-abstract-declarator [opt] [ constant-expression [opt] ]
12917 ( abstract-declarator )
12919 Returns a representation of the declarator. DCL_KIND is
12920 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
12921 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
12922 we are parsing a direct-declarator. It is
12923 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
12924 of ambiguity we prefer an abstract declarator, as per
12925 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
12926 cp_parser_declarator. */
12928 static cp_declarator *
12929 cp_parser_direct_declarator (cp_parser* parser,
12930 cp_parser_declarator_kind dcl_kind,
12931 int* ctor_dtor_or_conv_p,
12935 cp_declarator *declarator = NULL;
12936 tree scope = NULL_TREE;
12937 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
12938 bool saved_in_declarator_p = parser->in_declarator_p;
12940 tree pushed_scope = NULL_TREE;
12944 /* Peek at the next token. */
12945 token = cp_lexer_peek_token (parser->lexer);
12946 if (token->type == CPP_OPEN_PAREN)
12948 /* This is either a parameter-declaration-clause, or a
12949 parenthesized declarator. When we know we are parsing a
12950 named declarator, it must be a parenthesized declarator
12951 if FIRST is true. For instance, `(int)' is a
12952 parameter-declaration-clause, with an omitted
12953 direct-abstract-declarator. But `((*))', is a
12954 parenthesized abstract declarator. Finally, when T is a
12955 template parameter `(T)' is a
12956 parameter-declaration-clause, and not a parenthesized
12959 We first try and parse a parameter-declaration-clause,
12960 and then try a nested declarator (if FIRST is true).
12962 It is not an error for it not to be a
12963 parameter-declaration-clause, even when FIRST is
12969 The first is the declaration of a function while the
12970 second is the definition of a variable, including its
12973 Having seen only the parenthesis, we cannot know which of
12974 these two alternatives should be selected. Even more
12975 complex are examples like:
12980 The former is a function-declaration; the latter is a
12981 variable initialization.
12983 Thus again, we try a parameter-declaration-clause, and if
12984 that fails, we back out and return. */
12986 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
12988 cp_parameter_declarator *params;
12989 unsigned saved_num_template_parameter_lists;
12991 /* In a member-declarator, the only valid interpretation
12992 of a parenthesis is the start of a
12993 parameter-declaration-clause. (It is invalid to
12994 initialize a static data member with a parenthesized
12995 initializer; only the "=" form of initialization is
12998 cp_parser_parse_tentatively (parser);
13000 /* Consume the `('. */
13001 cp_lexer_consume_token (parser->lexer);
13004 /* If this is going to be an abstract declarator, we're
13005 in a declarator and we can't have default args. */
13006 parser->default_arg_ok_p = false;
13007 parser->in_declarator_p = true;
13010 /* Inside the function parameter list, surrounding
13011 template-parameter-lists do not apply. */
13012 saved_num_template_parameter_lists
13013 = parser->num_template_parameter_lists;
13014 parser->num_template_parameter_lists = 0;
13016 /* Parse the parameter-declaration-clause. */
13017 params = cp_parser_parameter_declaration_clause (parser);
13019 parser->num_template_parameter_lists
13020 = saved_num_template_parameter_lists;
13022 /* If all went well, parse the cv-qualifier-seq and the
13023 exception-specification. */
13024 if (member_p || cp_parser_parse_definitely (parser))
13026 cp_cv_quals cv_quals;
13027 tree exception_specification;
13030 if (ctor_dtor_or_conv_p)
13031 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
13033 /* Consume the `)'. */
13034 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
13036 /* Parse the cv-qualifier-seq. */
13037 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
13038 /* And the exception-specification. */
13039 exception_specification
13040 = cp_parser_exception_specification_opt (parser);
13043 = cp_parser_late_return_type_opt (parser);
13045 /* Create the function-declarator. */
13046 declarator = make_call_declarator (declarator,
13049 exception_specification,
13051 /* Any subsequent parameter lists are to do with
13052 return type, so are not those of the declared
13054 parser->default_arg_ok_p = false;
13056 /* Repeat the main loop. */
13061 /* If this is the first, we can try a parenthesized
13065 bool saved_in_type_id_in_expr_p;
13067 parser->default_arg_ok_p = saved_default_arg_ok_p;
13068 parser->in_declarator_p = saved_in_declarator_p;
13070 /* Consume the `('. */
13071 cp_lexer_consume_token (parser->lexer);
13072 /* Parse the nested declarator. */
13073 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
13074 parser->in_type_id_in_expr_p = true;
13076 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
13077 /*parenthesized_p=*/NULL,
13079 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
13081 /* Expect a `)'. */
13082 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
13083 declarator = cp_error_declarator;
13084 if (declarator == cp_error_declarator)
13087 goto handle_declarator;
13089 /* Otherwise, we must be done. */
13093 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
13094 && token->type == CPP_OPEN_SQUARE)
13096 /* Parse an array-declarator. */
13099 if (ctor_dtor_or_conv_p)
13100 *ctor_dtor_or_conv_p = 0;
13103 parser->default_arg_ok_p = false;
13104 parser->in_declarator_p = true;
13105 /* Consume the `['. */
13106 cp_lexer_consume_token (parser->lexer);
13107 /* Peek at the next token. */
13108 token = cp_lexer_peek_token (parser->lexer);
13109 /* If the next token is `]', then there is no
13110 constant-expression. */
13111 if (token->type != CPP_CLOSE_SQUARE)
13113 bool non_constant_p;
13116 = cp_parser_constant_expression (parser,
13117 /*allow_non_constant=*/true,
13119 if (!non_constant_p)
13120 bounds = fold_non_dependent_expr (bounds);
13121 /* Normally, the array bound must be an integral constant
13122 expression. However, as an extension, we allow VLAs
13123 in function scopes. */
13124 else if (!parser->in_function_body)
13126 error ("%Harray bound is not an integer constant",
13128 bounds = error_mark_node;
13132 bounds = NULL_TREE;
13133 /* Look for the closing `]'. */
13134 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>"))
13136 declarator = cp_error_declarator;
13140 declarator = make_array_declarator (declarator, bounds);
13142 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
13144 tree qualifying_scope;
13145 tree unqualified_name;
13146 special_function_kind sfk;
13148 bool pack_expansion_p = false;
13149 cp_token *declarator_id_start_token;
13151 /* Parse a declarator-id */
13152 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
13155 cp_parser_parse_tentatively (parser);
13157 /* If we see an ellipsis, we should be looking at a
13159 if (token->type == CPP_ELLIPSIS)
13161 /* Consume the `...' */
13162 cp_lexer_consume_token (parser->lexer);
13164 pack_expansion_p = true;
13168 declarator_id_start_token = cp_lexer_peek_token (parser->lexer);
13170 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
13171 qualifying_scope = parser->scope;
13176 if (!unqualified_name && pack_expansion_p)
13178 /* Check whether an error occurred. */
13179 okay = !cp_parser_error_occurred (parser);
13181 /* We already consumed the ellipsis to mark a
13182 parameter pack, but we have no way to report it,
13183 so abort the tentative parse. We will be exiting
13184 immediately anyway. */
13185 cp_parser_abort_tentative_parse (parser);
13188 okay = cp_parser_parse_definitely (parser);
13191 unqualified_name = error_mark_node;
13192 else if (unqualified_name
13193 && (qualifying_scope
13194 || (TREE_CODE (unqualified_name)
13195 != IDENTIFIER_NODE)))
13197 cp_parser_error (parser, "expected unqualified-id");
13198 unqualified_name = error_mark_node;
13202 if (!unqualified_name)
13204 if (unqualified_name == error_mark_node)
13206 declarator = cp_error_declarator;
13207 pack_expansion_p = false;
13208 declarator->parameter_pack_p = false;
13212 if (qualifying_scope && at_namespace_scope_p ()
13213 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
13215 /* In the declaration of a member of a template class
13216 outside of the class itself, the SCOPE will sometimes
13217 be a TYPENAME_TYPE. For example, given:
13219 template <typename T>
13220 int S<T>::R::i = 3;
13222 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
13223 this context, we must resolve S<T>::R to an ordinary
13224 type, rather than a typename type.
13226 The reason we normally avoid resolving TYPENAME_TYPEs
13227 is that a specialization of `S' might render
13228 `S<T>::R' not a type. However, if `S' is
13229 specialized, then this `i' will not be used, so there
13230 is no harm in resolving the types here. */
13233 /* Resolve the TYPENAME_TYPE. */
13234 type = resolve_typename_type (qualifying_scope,
13235 /*only_current_p=*/false);
13236 /* If that failed, the declarator is invalid. */
13237 if (TREE_CODE (type) == TYPENAME_TYPE)
13238 error ("%H%<%T::%E%> is not a type",
13239 &declarator_id_start_token->location,
13240 TYPE_CONTEXT (qualifying_scope),
13241 TYPE_IDENTIFIER (qualifying_scope));
13242 qualifying_scope = type;
13247 if (unqualified_name)
13251 if (qualifying_scope
13252 && CLASS_TYPE_P (qualifying_scope))
13253 class_type = qualifying_scope;
13255 class_type = current_class_type;
13257 if (TREE_CODE (unqualified_name) == TYPE_DECL)
13259 tree name_type = TREE_TYPE (unqualified_name);
13260 if (class_type && same_type_p (name_type, class_type))
13262 if (qualifying_scope
13263 && CLASSTYPE_USE_TEMPLATE (name_type))
13265 error ("%Hinvalid use of constructor as a template",
13266 &declarator_id_start_token->location);
13267 inform (input_location, "use %<%T::%D%> instead of %<%T::%D%> to "
13268 "name the constructor in a qualified name",
13270 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
13271 class_type, name_type);
13272 declarator = cp_error_declarator;
13276 unqualified_name = constructor_name (class_type);
13280 /* We do not attempt to print the declarator
13281 here because we do not have enough
13282 information about its original syntactic
13284 cp_parser_error (parser, "invalid declarator");
13285 declarator = cp_error_declarator;
13292 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
13293 sfk = sfk_destructor;
13294 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
13295 sfk = sfk_conversion;
13296 else if (/* There's no way to declare a constructor
13297 for an anonymous type, even if the type
13298 got a name for linkage purposes. */
13299 !TYPE_WAS_ANONYMOUS (class_type)
13300 && constructor_name_p (unqualified_name,
13303 unqualified_name = constructor_name (class_type);
13304 sfk = sfk_constructor;
13307 if (ctor_dtor_or_conv_p && sfk != sfk_none)
13308 *ctor_dtor_or_conv_p = -1;
13311 declarator = make_id_declarator (qualifying_scope,
13314 declarator->id_loc = token->location;
13315 declarator->parameter_pack_p = pack_expansion_p;
13317 if (pack_expansion_p)
13318 maybe_warn_variadic_templates ();
13320 handle_declarator:;
13321 scope = get_scope_of_declarator (declarator);
13323 /* Any names that appear after the declarator-id for a
13324 member are looked up in the containing scope. */
13325 pushed_scope = push_scope (scope);
13326 parser->in_declarator_p = true;
13327 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
13328 || (declarator && declarator->kind == cdk_id))
13329 /* Default args are only allowed on function
13331 parser->default_arg_ok_p = saved_default_arg_ok_p;
13333 parser->default_arg_ok_p = false;
13342 /* For an abstract declarator, we might wind up with nothing at this
13343 point. That's an error; the declarator is not optional. */
13345 cp_parser_error (parser, "expected declarator");
13347 /* If we entered a scope, we must exit it now. */
13349 pop_scope (pushed_scope);
13351 parser->default_arg_ok_p = saved_default_arg_ok_p;
13352 parser->in_declarator_p = saved_in_declarator_p;
13357 /* Parse a ptr-operator.
13360 * cv-qualifier-seq [opt]
13362 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
13367 & cv-qualifier-seq [opt]
13369 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
13370 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
13371 an rvalue reference. In the case of a pointer-to-member, *TYPE is
13372 filled in with the TYPE containing the member. *CV_QUALS is
13373 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
13374 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
13375 Note that the tree codes returned by this function have nothing
13376 to do with the types of trees that will be eventually be created
13377 to represent the pointer or reference type being parsed. They are
13378 just constants with suggestive names. */
13379 static enum tree_code
13380 cp_parser_ptr_operator (cp_parser* parser,
13382 cp_cv_quals *cv_quals)
13384 enum tree_code code = ERROR_MARK;
13387 /* Assume that it's not a pointer-to-member. */
13389 /* And that there are no cv-qualifiers. */
13390 *cv_quals = TYPE_UNQUALIFIED;
13392 /* Peek at the next token. */
13393 token = cp_lexer_peek_token (parser->lexer);
13395 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
13396 if (token->type == CPP_MULT)
13397 code = INDIRECT_REF;
13398 else if (token->type == CPP_AND)
13400 else if ((cxx_dialect != cxx98) &&
13401 token->type == CPP_AND_AND) /* C++0x only */
13402 code = NON_LVALUE_EXPR;
13404 if (code != ERROR_MARK)
13406 /* Consume the `*', `&' or `&&'. */
13407 cp_lexer_consume_token (parser->lexer);
13409 /* A `*' can be followed by a cv-qualifier-seq, and so can a
13410 `&', if we are allowing GNU extensions. (The only qualifier
13411 that can legally appear after `&' is `restrict', but that is
13412 enforced during semantic analysis. */
13413 if (code == INDIRECT_REF
13414 || cp_parser_allow_gnu_extensions_p (parser))
13415 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
13419 /* Try the pointer-to-member case. */
13420 cp_parser_parse_tentatively (parser);
13421 /* Look for the optional `::' operator. */
13422 cp_parser_global_scope_opt (parser,
13423 /*current_scope_valid_p=*/false);
13424 /* Look for the nested-name specifier. */
13425 token = cp_lexer_peek_token (parser->lexer);
13426 cp_parser_nested_name_specifier (parser,
13427 /*typename_keyword_p=*/false,
13428 /*check_dependency_p=*/true,
13430 /*is_declaration=*/false);
13431 /* If we found it, and the next token is a `*', then we are
13432 indeed looking at a pointer-to-member operator. */
13433 if (!cp_parser_error_occurred (parser)
13434 && cp_parser_require (parser, CPP_MULT, "%<*%>"))
13436 /* Indicate that the `*' operator was used. */
13437 code = INDIRECT_REF;
13439 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
13440 error ("%H%qD is a namespace", &token->location, parser->scope);
13443 /* The type of which the member is a member is given by the
13445 *type = parser->scope;
13446 /* The next name will not be qualified. */
13447 parser->scope = NULL_TREE;
13448 parser->qualifying_scope = NULL_TREE;
13449 parser->object_scope = NULL_TREE;
13450 /* Look for the optional cv-qualifier-seq. */
13451 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
13454 /* If that didn't work we don't have a ptr-operator. */
13455 if (!cp_parser_parse_definitely (parser))
13456 cp_parser_error (parser, "expected ptr-operator");
13462 /* Parse an (optional) cv-qualifier-seq.
13465 cv-qualifier cv-qualifier-seq [opt]
13476 Returns a bitmask representing the cv-qualifiers. */
13479 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
13481 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
13486 cp_cv_quals cv_qualifier;
13488 /* Peek at the next token. */
13489 token = cp_lexer_peek_token (parser->lexer);
13490 /* See if it's a cv-qualifier. */
13491 switch (token->keyword)
13494 cv_qualifier = TYPE_QUAL_CONST;
13498 cv_qualifier = TYPE_QUAL_VOLATILE;
13502 cv_qualifier = TYPE_QUAL_RESTRICT;
13506 cv_qualifier = TYPE_UNQUALIFIED;
13513 if (cv_quals & cv_qualifier)
13515 error ("%Hduplicate cv-qualifier", &token->location);
13516 cp_lexer_purge_token (parser->lexer);
13520 cp_lexer_consume_token (parser->lexer);
13521 cv_quals |= cv_qualifier;
13528 /* Parse a late-specified return type, if any. This is not a separate
13529 non-terminal, but part of a function declarator, which looks like
13533 Returns the type indicated by the type-id. */
13536 cp_parser_late_return_type_opt (cp_parser* parser)
13540 /* Peek at the next token. */
13541 token = cp_lexer_peek_token (parser->lexer);
13542 /* A late-specified return type is indicated by an initial '->'. */
13543 if (token->type != CPP_DEREF)
13546 /* Consume the ->. */
13547 cp_lexer_consume_token (parser->lexer);
13549 return cp_parser_type_id (parser);
13552 /* Parse a declarator-id.
13556 :: [opt] nested-name-specifier [opt] type-name
13558 In the `id-expression' case, the value returned is as for
13559 cp_parser_id_expression if the id-expression was an unqualified-id.
13560 If the id-expression was a qualified-id, then a SCOPE_REF is
13561 returned. The first operand is the scope (either a NAMESPACE_DECL
13562 or TREE_TYPE), but the second is still just a representation of an
13566 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
13569 /* The expression must be an id-expression. Assume that qualified
13570 names are the names of types so that:
13573 int S<T>::R::i = 3;
13575 will work; we must treat `S<T>::R' as the name of a type.
13576 Similarly, assume that qualified names are templates, where
13580 int S<T>::R<T>::i = 3;
13583 id = cp_parser_id_expression (parser,
13584 /*template_keyword_p=*/false,
13585 /*check_dependency_p=*/false,
13586 /*template_p=*/NULL,
13587 /*declarator_p=*/true,
13589 if (id && BASELINK_P (id))
13590 id = BASELINK_FUNCTIONS (id);
13594 /* Parse a type-id.
13597 type-specifier-seq abstract-declarator [opt]
13599 Returns the TYPE specified. */
13602 cp_parser_type_id (cp_parser* parser)
13604 cp_decl_specifier_seq type_specifier_seq;
13605 cp_declarator *abstract_declarator;
13607 /* Parse the type-specifier-seq. */
13608 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
13609 &type_specifier_seq);
13610 if (type_specifier_seq.type == error_mark_node)
13611 return error_mark_node;
13613 /* There might or might not be an abstract declarator. */
13614 cp_parser_parse_tentatively (parser);
13615 /* Look for the declarator. */
13616 abstract_declarator
13617 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
13618 /*parenthesized_p=*/NULL,
13619 /*member_p=*/false);
13620 /* Check to see if there really was a declarator. */
13621 if (!cp_parser_parse_definitely (parser))
13622 abstract_declarator = NULL;
13624 return groktypename (&type_specifier_seq, abstract_declarator);
13627 /* Parse a type-specifier-seq.
13629 type-specifier-seq:
13630 type-specifier type-specifier-seq [opt]
13634 type-specifier-seq:
13635 attributes type-specifier-seq [opt]
13637 If IS_CONDITION is true, we are at the start of a "condition",
13638 e.g., we've just seen "if (".
13640 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
13643 cp_parser_type_specifier_seq (cp_parser* parser,
13645 cp_decl_specifier_seq *type_specifier_seq)
13647 bool seen_type_specifier = false;
13648 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
13649 cp_token *start_token = NULL;
13651 /* Clear the TYPE_SPECIFIER_SEQ. */
13652 clear_decl_specs (type_specifier_seq);
13654 /* Parse the type-specifiers and attributes. */
13657 tree type_specifier;
13658 bool is_cv_qualifier;
13660 /* Check for attributes first. */
13661 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
13663 type_specifier_seq->attributes =
13664 chainon (type_specifier_seq->attributes,
13665 cp_parser_attributes_opt (parser));
13669 /* record the token of the beginning of the type specifier seq,
13670 for error reporting purposes*/
13672 start_token = cp_lexer_peek_token (parser->lexer);
13674 /* Look for the type-specifier. */
13675 type_specifier = cp_parser_type_specifier (parser,
13677 type_specifier_seq,
13678 /*is_declaration=*/false,
13681 if (!type_specifier)
13683 /* If the first type-specifier could not be found, this is not a
13684 type-specifier-seq at all. */
13685 if (!seen_type_specifier)
13687 cp_parser_error (parser, "expected type-specifier");
13688 type_specifier_seq->type = error_mark_node;
13691 /* If subsequent type-specifiers could not be found, the
13692 type-specifier-seq is complete. */
13696 seen_type_specifier = true;
13697 /* The standard says that a condition can be:
13699 type-specifier-seq declarator = assignment-expression
13706 we should treat the "S" as a declarator, not as a
13707 type-specifier. The standard doesn't say that explicitly for
13708 type-specifier-seq, but it does say that for
13709 decl-specifier-seq in an ordinary declaration. Perhaps it
13710 would be clearer just to allow a decl-specifier-seq here, and
13711 then add a semantic restriction that if any decl-specifiers
13712 that are not type-specifiers appear, the program is invalid. */
13713 if (is_condition && !is_cv_qualifier)
13714 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
13717 cp_parser_check_decl_spec (type_specifier_seq, start_token->location);
13720 /* Parse a parameter-declaration-clause.
13722 parameter-declaration-clause:
13723 parameter-declaration-list [opt] ... [opt]
13724 parameter-declaration-list , ...
13726 Returns a representation for the parameter declarations. A return
13727 value of NULL indicates a parameter-declaration-clause consisting
13728 only of an ellipsis. */
13730 static cp_parameter_declarator *
13731 cp_parser_parameter_declaration_clause (cp_parser* parser)
13733 cp_parameter_declarator *parameters;
13738 /* Peek at the next token. */
13739 token = cp_lexer_peek_token (parser->lexer);
13740 /* Check for trivial parameter-declaration-clauses. */
13741 if (token->type == CPP_ELLIPSIS)
13743 /* Consume the `...' token. */
13744 cp_lexer_consume_token (parser->lexer);
13747 else if (token->type == CPP_CLOSE_PAREN)
13748 /* There are no parameters. */
13750 #ifndef NO_IMPLICIT_EXTERN_C
13751 if (in_system_header && current_class_type == NULL
13752 && current_lang_name == lang_name_c)
13756 return no_parameters;
13758 /* Check for `(void)', too, which is a special case. */
13759 else if (token->keyword == RID_VOID
13760 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
13761 == CPP_CLOSE_PAREN))
13763 /* Consume the `void' token. */
13764 cp_lexer_consume_token (parser->lexer);
13765 /* There are no parameters. */
13766 return no_parameters;
13769 /* Parse the parameter-declaration-list. */
13770 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
13771 /* If a parse error occurred while parsing the
13772 parameter-declaration-list, then the entire
13773 parameter-declaration-clause is erroneous. */
13777 /* Peek at the next token. */
13778 token = cp_lexer_peek_token (parser->lexer);
13779 /* If it's a `,', the clause should terminate with an ellipsis. */
13780 if (token->type == CPP_COMMA)
13782 /* Consume the `,'. */
13783 cp_lexer_consume_token (parser->lexer);
13784 /* Expect an ellipsis. */
13786 = (cp_parser_require (parser, CPP_ELLIPSIS, "%<...%>") != NULL);
13788 /* It might also be `...' if the optional trailing `,' was
13790 else if (token->type == CPP_ELLIPSIS)
13792 /* Consume the `...' token. */
13793 cp_lexer_consume_token (parser->lexer);
13794 /* And remember that we saw it. */
13798 ellipsis_p = false;
13800 /* Finish the parameter list. */
13801 if (parameters && ellipsis_p)
13802 parameters->ellipsis_p = true;
13807 /* Parse a parameter-declaration-list.
13809 parameter-declaration-list:
13810 parameter-declaration
13811 parameter-declaration-list , parameter-declaration
13813 Returns a representation of the parameter-declaration-list, as for
13814 cp_parser_parameter_declaration_clause. However, the
13815 `void_list_node' is never appended to the list. Upon return,
13816 *IS_ERROR will be true iff an error occurred. */
13818 static cp_parameter_declarator *
13819 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
13821 cp_parameter_declarator *parameters = NULL;
13822 cp_parameter_declarator **tail = ¶meters;
13823 bool saved_in_unbraced_linkage_specification_p;
13825 /* Assume all will go well. */
13827 /* The special considerations that apply to a function within an
13828 unbraced linkage specifications do not apply to the parameters
13829 to the function. */
13830 saved_in_unbraced_linkage_specification_p
13831 = parser->in_unbraced_linkage_specification_p;
13832 parser->in_unbraced_linkage_specification_p = false;
13834 /* Look for more parameters. */
13837 cp_parameter_declarator *parameter;
13838 bool parenthesized_p;
13839 /* Parse the parameter. */
13841 = cp_parser_parameter_declaration (parser,
13842 /*template_parm_p=*/false,
13845 /* If a parse error occurred parsing the parameter declaration,
13846 then the entire parameter-declaration-list is erroneous. */
13853 /* Add the new parameter to the list. */
13855 tail = ¶meter->next;
13857 /* Peek at the next token. */
13858 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
13859 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
13860 /* These are for Objective-C++ */
13861 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
13862 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13863 /* The parameter-declaration-list is complete. */
13865 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13869 /* Peek at the next token. */
13870 token = cp_lexer_peek_nth_token (parser->lexer, 2);
13871 /* If it's an ellipsis, then the list is complete. */
13872 if (token->type == CPP_ELLIPSIS)
13874 /* Otherwise, there must be more parameters. Consume the
13876 cp_lexer_consume_token (parser->lexer);
13877 /* When parsing something like:
13879 int i(float f, double d)
13881 we can tell after seeing the declaration for "f" that we
13882 are not looking at an initialization of a variable "i",
13883 but rather at the declaration of a function "i".
13885 Due to the fact that the parsing of template arguments
13886 (as specified to a template-id) requires backtracking we
13887 cannot use this technique when inside a template argument
13889 if (!parser->in_template_argument_list_p
13890 && !parser->in_type_id_in_expr_p
13891 && cp_parser_uncommitted_to_tentative_parse_p (parser)
13892 /* However, a parameter-declaration of the form
13893 "foat(f)" (which is a valid declaration of a
13894 parameter "f") can also be interpreted as an
13895 expression (the conversion of "f" to "float"). */
13896 && !parenthesized_p)
13897 cp_parser_commit_to_tentative_parse (parser);
13901 cp_parser_error (parser, "expected %<,%> or %<...%>");
13902 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
13903 cp_parser_skip_to_closing_parenthesis (parser,
13904 /*recovering=*/true,
13905 /*or_comma=*/false,
13906 /*consume_paren=*/false);
13911 parser->in_unbraced_linkage_specification_p
13912 = saved_in_unbraced_linkage_specification_p;
13917 /* Parse a parameter declaration.
13919 parameter-declaration:
13920 decl-specifier-seq ... [opt] declarator
13921 decl-specifier-seq declarator = assignment-expression
13922 decl-specifier-seq ... [opt] abstract-declarator [opt]
13923 decl-specifier-seq abstract-declarator [opt] = assignment-expression
13925 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
13926 declares a template parameter. (In that case, a non-nested `>'
13927 token encountered during the parsing of the assignment-expression
13928 is not interpreted as a greater-than operator.)
13930 Returns a representation of the parameter, or NULL if an error
13931 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
13932 true iff the declarator is of the form "(p)". */
13934 static cp_parameter_declarator *
13935 cp_parser_parameter_declaration (cp_parser *parser,
13936 bool template_parm_p,
13937 bool *parenthesized_p)
13939 int declares_class_or_enum;
13940 bool greater_than_is_operator_p;
13941 cp_decl_specifier_seq decl_specifiers;
13942 cp_declarator *declarator;
13943 tree default_argument;
13944 cp_token *token = NULL, *declarator_token_start = NULL;
13945 const char *saved_message;
13947 /* In a template parameter, `>' is not an operator.
13951 When parsing a default template-argument for a non-type
13952 template-parameter, the first non-nested `>' is taken as the end
13953 of the template parameter-list rather than a greater-than
13955 greater_than_is_operator_p = !template_parm_p;
13957 /* Type definitions may not appear in parameter types. */
13958 saved_message = parser->type_definition_forbidden_message;
13959 parser->type_definition_forbidden_message
13960 = "types may not be defined in parameter types";
13962 /* Parse the declaration-specifiers. */
13963 cp_parser_decl_specifier_seq (parser,
13964 CP_PARSER_FLAGS_NONE,
13966 &declares_class_or_enum);
13967 /* If an error occurred, there's no reason to attempt to parse the
13968 rest of the declaration. */
13969 if (cp_parser_error_occurred (parser))
13971 parser->type_definition_forbidden_message = saved_message;
13975 /* Peek at the next token. */
13976 token = cp_lexer_peek_token (parser->lexer);
13978 /* If the next token is a `)', `,', `=', `>', or `...', then there
13979 is no declarator. However, when variadic templates are enabled,
13980 there may be a declarator following `...'. */
13981 if (token->type == CPP_CLOSE_PAREN
13982 || token->type == CPP_COMMA
13983 || token->type == CPP_EQ
13984 || token->type == CPP_GREATER)
13987 if (parenthesized_p)
13988 *parenthesized_p = false;
13990 /* Otherwise, there should be a declarator. */
13993 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
13994 parser->default_arg_ok_p = false;
13996 /* After seeing a decl-specifier-seq, if the next token is not a
13997 "(", there is no possibility that the code is a valid
13998 expression. Therefore, if parsing tentatively, we commit at
14000 if (!parser->in_template_argument_list_p
14001 /* In an expression context, having seen:
14005 we cannot be sure whether we are looking at a
14006 function-type (taking a "char" as a parameter) or a cast
14007 of some object of type "char" to "int". */
14008 && !parser->in_type_id_in_expr_p
14009 && cp_parser_uncommitted_to_tentative_parse_p (parser)
14010 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
14011 cp_parser_commit_to_tentative_parse (parser);
14012 /* Parse the declarator. */
14013 declarator_token_start = token;
14014 declarator = cp_parser_declarator (parser,
14015 CP_PARSER_DECLARATOR_EITHER,
14016 /*ctor_dtor_or_conv_p=*/NULL,
14018 /*member_p=*/false);
14019 parser->default_arg_ok_p = saved_default_arg_ok_p;
14020 /* After the declarator, allow more attributes. */
14021 decl_specifiers.attributes
14022 = chainon (decl_specifiers.attributes,
14023 cp_parser_attributes_opt (parser));
14026 /* If the next token is an ellipsis, and we have not seen a
14027 declarator name, and the type of the declarator contains parameter
14028 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
14029 a parameter pack expansion expression. Otherwise, leave the
14030 ellipsis for a C-style variadic function. */
14031 token = cp_lexer_peek_token (parser->lexer);
14032 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14034 tree type = decl_specifiers.type;
14036 if (type && DECL_P (type))
14037 type = TREE_TYPE (type);
14040 && TREE_CODE (type) != TYPE_PACK_EXPANSION
14041 && declarator_can_be_parameter_pack (declarator)
14042 && (!declarator || !declarator->parameter_pack_p)
14043 && uses_parameter_packs (type))
14045 /* Consume the `...'. */
14046 cp_lexer_consume_token (parser->lexer);
14047 maybe_warn_variadic_templates ();
14049 /* Build a pack expansion type */
14051 declarator->parameter_pack_p = true;
14053 decl_specifiers.type = make_pack_expansion (type);
14057 /* The restriction on defining new types applies only to the type
14058 of the parameter, not to the default argument. */
14059 parser->type_definition_forbidden_message = saved_message;
14061 /* If the next token is `=', then process a default argument. */
14062 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
14064 /* Consume the `='. */
14065 cp_lexer_consume_token (parser->lexer);
14067 /* If we are defining a class, then the tokens that make up the
14068 default argument must be saved and processed later. */
14069 if (!template_parm_p && at_class_scope_p ()
14070 && TYPE_BEING_DEFINED (current_class_type))
14072 unsigned depth = 0;
14073 int maybe_template_id = 0;
14074 cp_token *first_token;
14077 /* Add tokens until we have processed the entire default
14078 argument. We add the range [first_token, token). */
14079 first_token = cp_lexer_peek_token (parser->lexer);
14084 /* Peek at the next token. */
14085 token = cp_lexer_peek_token (parser->lexer);
14086 /* What we do depends on what token we have. */
14087 switch (token->type)
14089 /* In valid code, a default argument must be
14090 immediately followed by a `,' `)', or `...'. */
14092 if (depth == 0 && maybe_template_id)
14094 /* If we've seen a '<', we might be in a
14095 template-argument-list. Until Core issue 325 is
14096 resolved, we don't know how this situation ought
14097 to be handled, so try to DTRT. We check whether
14098 what comes after the comma is a valid parameter
14099 declaration list. If it is, then the comma ends
14100 the default argument; otherwise the default
14101 argument continues. */
14102 bool error = false;
14104 /* Set ITALP so cp_parser_parameter_declaration_list
14105 doesn't decide to commit to this parse. */
14106 bool saved_italp = parser->in_template_argument_list_p;
14107 parser->in_template_argument_list_p = true;
14109 cp_parser_parse_tentatively (parser);
14110 cp_lexer_consume_token (parser->lexer);
14111 cp_parser_parameter_declaration_list (parser, &error);
14112 if (!cp_parser_error_occurred (parser) && !error)
14114 cp_parser_abort_tentative_parse (parser);
14116 parser->in_template_argument_list_p = saved_italp;
14119 case CPP_CLOSE_PAREN:
14121 /* If we run into a non-nested `;', `}', or `]',
14122 then the code is invalid -- but the default
14123 argument is certainly over. */
14124 case CPP_SEMICOLON:
14125 case CPP_CLOSE_BRACE:
14126 case CPP_CLOSE_SQUARE:
14129 /* Update DEPTH, if necessary. */
14130 else if (token->type == CPP_CLOSE_PAREN
14131 || token->type == CPP_CLOSE_BRACE
14132 || token->type == CPP_CLOSE_SQUARE)
14136 case CPP_OPEN_PAREN:
14137 case CPP_OPEN_SQUARE:
14138 case CPP_OPEN_BRACE:
14144 /* This might be the comparison operator, or it might
14145 start a template argument list. */
14146 ++maybe_template_id;
14150 if (cxx_dialect == cxx98)
14152 /* Fall through for C++0x, which treats the `>>'
14153 operator like two `>' tokens in certain
14159 /* This might be an operator, or it might close a
14160 template argument list. But if a previous '<'
14161 started a template argument list, this will have
14162 closed it, so we can't be in one anymore. */
14163 maybe_template_id -= 1 + (token->type == CPP_RSHIFT);
14164 if (maybe_template_id < 0)
14165 maybe_template_id = 0;
14169 /* If we run out of tokens, issue an error message. */
14171 case CPP_PRAGMA_EOL:
14172 error ("%Hfile ends in default argument", &token->location);
14178 /* In these cases, we should look for template-ids.
14179 For example, if the default argument is
14180 `X<int, double>()', we need to do name lookup to
14181 figure out whether or not `X' is a template; if
14182 so, the `,' does not end the default argument.
14184 That is not yet done. */
14191 /* If we've reached the end, stop. */
14195 /* Add the token to the token block. */
14196 token = cp_lexer_consume_token (parser->lexer);
14199 /* Create a DEFAULT_ARG to represent the unparsed default
14201 default_argument = make_node (DEFAULT_ARG);
14202 DEFARG_TOKENS (default_argument)
14203 = cp_token_cache_new (first_token, token);
14204 DEFARG_INSTANTIATIONS (default_argument) = NULL;
14206 /* Outside of a class definition, we can just parse the
14207 assignment-expression. */
14210 token = cp_lexer_peek_token (parser->lexer);
14212 = cp_parser_default_argument (parser, template_parm_p);
14215 if (!parser->default_arg_ok_p)
14217 if (flag_permissive)
14218 warning (0, "deprecated use of default argument for parameter of non-function");
14221 error ("%Hdefault arguments are only "
14222 "permitted for function parameters",
14224 default_argument = NULL_TREE;
14227 else if ((declarator && declarator->parameter_pack_p)
14228 || (decl_specifiers.type
14229 && PACK_EXPANSION_P (decl_specifiers.type)))
14231 const char* kind = template_parm_p? "template " : "";
14233 /* Find the name of the parameter pack. */
14234 cp_declarator *id_declarator = declarator;
14235 while (id_declarator && id_declarator->kind != cdk_id)
14236 id_declarator = id_declarator->declarator;
14238 if (id_declarator && id_declarator->kind == cdk_id)
14239 error ("%H%sparameter pack %qD cannot have a default argument",
14240 &declarator_token_start->location,
14241 kind, id_declarator->u.id.unqualified_name);
14243 error ("%H%sparameter pack cannot have a default argument",
14244 &declarator_token_start->location, kind);
14246 default_argument = NULL_TREE;
14250 default_argument = NULL_TREE;
14252 return make_parameter_declarator (&decl_specifiers,
14257 /* Parse a default argument and return it.
14259 TEMPLATE_PARM_P is true if this is a default argument for a
14260 non-type template parameter. */
14262 cp_parser_default_argument (cp_parser *parser, bool template_parm_p)
14264 tree default_argument = NULL_TREE;
14265 bool saved_greater_than_is_operator_p;
14266 bool saved_local_variables_forbidden_p;
14268 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
14270 saved_greater_than_is_operator_p = parser->greater_than_is_operator_p;
14271 parser->greater_than_is_operator_p = !template_parm_p;
14272 /* Local variable names (and the `this' keyword) may not
14273 appear in a default argument. */
14274 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
14275 parser->local_variables_forbidden_p = true;
14276 /* The default argument expression may cause implicitly
14277 defined member functions to be synthesized, which will
14278 result in garbage collection. We must treat this
14279 situation as if we were within the body of function so as
14280 to avoid collecting live data on the stack. */
14282 /* Parse the assignment-expression. */
14283 if (template_parm_p)
14284 push_deferring_access_checks (dk_no_deferred);
14286 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
14287 if (template_parm_p)
14288 pop_deferring_access_checks ();
14289 /* Restore saved state. */
14291 parser->greater_than_is_operator_p = saved_greater_than_is_operator_p;
14292 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
14294 return default_argument;
14297 /* Parse a function-body.
14300 compound_statement */
14303 cp_parser_function_body (cp_parser *parser)
14305 cp_parser_compound_statement (parser, NULL, false);
14308 /* Parse a ctor-initializer-opt followed by a function-body. Return
14309 true if a ctor-initializer was present. */
14312 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
14315 bool ctor_initializer_p;
14317 /* Begin the function body. */
14318 body = begin_function_body ();
14319 /* Parse the optional ctor-initializer. */
14320 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
14321 /* Parse the function-body. */
14322 cp_parser_function_body (parser);
14323 /* Finish the function body. */
14324 finish_function_body (body);
14326 return ctor_initializer_p;
14329 /* Parse an initializer.
14332 = initializer-clause
14333 ( expression-list )
14335 Returns an expression representing the initializer. If no
14336 initializer is present, NULL_TREE is returned.
14338 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
14339 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
14340 set to TRUE if there is no initializer present. If there is an
14341 initializer, and it is not a constant-expression, *NON_CONSTANT_P
14342 is set to true; otherwise it is set to false. */
14345 cp_parser_initializer (cp_parser* parser, bool* is_direct_init,
14346 bool* non_constant_p)
14351 /* Peek at the next token. */
14352 token = cp_lexer_peek_token (parser->lexer);
14354 /* Let our caller know whether or not this initializer was
14356 *is_direct_init = (token->type != CPP_EQ);
14357 /* Assume that the initializer is constant. */
14358 *non_constant_p = false;
14360 if (token->type == CPP_EQ)
14362 /* Consume the `='. */
14363 cp_lexer_consume_token (parser->lexer);
14364 /* Parse the initializer-clause. */
14365 init = cp_parser_initializer_clause (parser, non_constant_p);
14367 else if (token->type == CPP_OPEN_PAREN)
14368 init = cp_parser_parenthesized_expression_list (parser, false,
14370 /*allow_expansion_p=*/true,
14372 else if (token->type == CPP_OPEN_BRACE)
14374 maybe_warn_cpp0x ("extended initializer lists");
14375 init = cp_parser_braced_list (parser, non_constant_p);
14376 CONSTRUCTOR_IS_DIRECT_INIT (init) = 1;
14380 /* Anything else is an error. */
14381 cp_parser_error (parser, "expected initializer");
14382 init = error_mark_node;
14388 /* Parse an initializer-clause.
14390 initializer-clause:
14391 assignment-expression
14394 Returns an expression representing the initializer.
14396 If the `assignment-expression' production is used the value
14397 returned is simply a representation for the expression.
14399 Otherwise, calls cp_parser_braced_list. */
14402 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
14406 /* Assume the expression is constant. */
14407 *non_constant_p = false;
14409 /* If it is not a `{', then we are looking at an
14410 assignment-expression. */
14411 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
14414 = cp_parser_constant_expression (parser,
14415 /*allow_non_constant_p=*/true,
14417 if (!*non_constant_p)
14418 initializer = fold_non_dependent_expr (initializer);
14421 initializer = cp_parser_braced_list (parser, non_constant_p);
14423 return initializer;
14426 /* Parse a brace-enclosed initializer list.
14429 { initializer-list , [opt] }
14432 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
14433 the elements of the initializer-list (or NULL, if the last
14434 production is used). The TREE_TYPE for the CONSTRUCTOR will be
14435 NULL_TREE. There is no way to detect whether or not the optional
14436 trailing `,' was provided. NON_CONSTANT_P is as for
14437 cp_parser_initializer. */
14440 cp_parser_braced_list (cp_parser* parser, bool* non_constant_p)
14444 /* Consume the `{' token. */
14445 cp_lexer_consume_token (parser->lexer);
14446 /* Create a CONSTRUCTOR to represent the braced-initializer. */
14447 initializer = make_node (CONSTRUCTOR);
14448 /* If it's not a `}', then there is a non-trivial initializer. */
14449 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
14451 /* Parse the initializer list. */
14452 CONSTRUCTOR_ELTS (initializer)
14453 = cp_parser_initializer_list (parser, non_constant_p);
14454 /* A trailing `,' token is allowed. */
14455 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
14456 cp_lexer_consume_token (parser->lexer);
14458 /* Now, there should be a trailing `}'. */
14459 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
14460 TREE_TYPE (initializer) = init_list_type_node;
14461 return initializer;
14464 /* Parse an initializer-list.
14467 initializer-clause ... [opt]
14468 initializer-list , initializer-clause ... [opt]
14473 identifier : initializer-clause
14474 initializer-list, identifier : initializer-clause
14476 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
14477 for the initializer. If the INDEX of the elt is non-NULL, it is the
14478 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
14479 as for cp_parser_initializer. */
14481 static VEC(constructor_elt,gc) *
14482 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
14484 VEC(constructor_elt,gc) *v = NULL;
14486 /* Assume all of the expressions are constant. */
14487 *non_constant_p = false;
14489 /* Parse the rest of the list. */
14495 bool clause_non_constant_p;
14497 /* If the next token is an identifier and the following one is a
14498 colon, we are looking at the GNU designated-initializer
14500 if (cp_parser_allow_gnu_extensions_p (parser)
14501 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
14502 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
14504 /* Warn the user that they are using an extension. */
14505 pedwarn (input_location, OPT_pedantic,
14506 "ISO C++ does not allow designated initializers");
14507 /* Consume the identifier. */
14508 identifier = cp_lexer_consume_token (parser->lexer)->u.value;
14509 /* Consume the `:'. */
14510 cp_lexer_consume_token (parser->lexer);
14513 identifier = NULL_TREE;
14515 /* Parse the initializer. */
14516 initializer = cp_parser_initializer_clause (parser,
14517 &clause_non_constant_p);
14518 /* If any clause is non-constant, so is the entire initializer. */
14519 if (clause_non_constant_p)
14520 *non_constant_p = true;
14522 /* If we have an ellipsis, this is an initializer pack
14524 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14526 /* Consume the `...'. */
14527 cp_lexer_consume_token (parser->lexer);
14529 /* Turn the initializer into an initializer expansion. */
14530 initializer = make_pack_expansion (initializer);
14533 /* Add it to the vector. */
14534 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
14536 /* If the next token is not a comma, we have reached the end of
14538 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14541 /* Peek at the next token. */
14542 token = cp_lexer_peek_nth_token (parser->lexer, 2);
14543 /* If the next token is a `}', then we're still done. An
14544 initializer-clause can have a trailing `,' after the
14545 initializer-list and before the closing `}'. */
14546 if (token->type == CPP_CLOSE_BRACE)
14549 /* Consume the `,' token. */
14550 cp_lexer_consume_token (parser->lexer);
14556 /* Classes [gram.class] */
14558 /* Parse a class-name.
14564 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
14565 to indicate that names looked up in dependent types should be
14566 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
14567 keyword has been used to indicate that the name that appears next
14568 is a template. TAG_TYPE indicates the explicit tag given before
14569 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
14570 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
14571 is the class being defined in a class-head.
14573 Returns the TYPE_DECL representing the class. */
14576 cp_parser_class_name (cp_parser *parser,
14577 bool typename_keyword_p,
14578 bool template_keyword_p,
14579 enum tag_types tag_type,
14580 bool check_dependency_p,
14582 bool is_declaration)
14589 /* All class-names start with an identifier. */
14590 token = cp_lexer_peek_token (parser->lexer);
14591 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
14593 cp_parser_error (parser, "expected class-name");
14594 return error_mark_node;
14597 /* PARSER->SCOPE can be cleared when parsing the template-arguments
14598 to a template-id, so we save it here. */
14599 scope = parser->scope;
14600 if (scope == error_mark_node)
14601 return error_mark_node;
14603 /* Any name names a type if we're following the `typename' keyword
14604 in a qualified name where the enclosing scope is type-dependent. */
14605 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
14606 && dependent_type_p (scope));
14607 /* Handle the common case (an identifier, but not a template-id)
14609 if (token->type == CPP_NAME
14610 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
14612 cp_token *identifier_token;
14616 /* Look for the identifier. */
14617 identifier_token = cp_lexer_peek_token (parser->lexer);
14618 ambiguous_p = identifier_token->ambiguous_p;
14619 identifier = cp_parser_identifier (parser);
14620 /* If the next token isn't an identifier, we are certainly not
14621 looking at a class-name. */
14622 if (identifier == error_mark_node)
14623 decl = error_mark_node;
14624 /* If we know this is a type-name, there's no need to look it
14626 else if (typename_p)
14630 tree ambiguous_decls;
14631 /* If we already know that this lookup is ambiguous, then
14632 we've already issued an error message; there's no reason
14636 cp_parser_simulate_error (parser);
14637 return error_mark_node;
14639 /* If the next token is a `::', then the name must be a type
14642 [basic.lookup.qual]
14644 During the lookup for a name preceding the :: scope
14645 resolution operator, object, function, and enumerator
14646 names are ignored. */
14647 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14648 tag_type = typename_type;
14649 /* Look up the name. */
14650 decl = cp_parser_lookup_name (parser, identifier,
14652 /*is_template=*/false,
14653 /*is_namespace=*/false,
14654 check_dependency_p,
14656 identifier_token->location);
14657 if (ambiguous_decls)
14659 error ("%Hreference to %qD is ambiguous",
14660 &identifier_token->location, identifier);
14661 print_candidates (ambiguous_decls);
14662 if (cp_parser_parsing_tentatively (parser))
14664 identifier_token->ambiguous_p = true;
14665 cp_parser_simulate_error (parser);
14667 return error_mark_node;
14673 /* Try a template-id. */
14674 decl = cp_parser_template_id (parser, template_keyword_p,
14675 check_dependency_p,
14677 if (decl == error_mark_node)
14678 return error_mark_node;
14681 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
14683 /* If this is a typename, create a TYPENAME_TYPE. */
14684 if (typename_p && decl != error_mark_node)
14686 decl = make_typename_type (scope, decl, typename_type,
14687 /*complain=*/tf_error);
14688 if (decl != error_mark_node)
14689 decl = TYPE_NAME (decl);
14692 /* Check to see that it is really the name of a class. */
14693 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
14694 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
14695 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14696 /* Situations like this:
14698 template <typename T> struct A {
14699 typename T::template X<int>::I i;
14702 are problematic. Is `T::template X<int>' a class-name? The
14703 standard does not seem to be definitive, but there is no other
14704 valid interpretation of the following `::'. Therefore, those
14705 names are considered class-names. */
14707 decl = make_typename_type (scope, decl, tag_type, tf_error);
14708 if (decl != error_mark_node)
14709 decl = TYPE_NAME (decl);
14711 else if (TREE_CODE (decl) != TYPE_DECL
14712 || TREE_TYPE (decl) == error_mark_node
14713 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl)))
14714 decl = error_mark_node;
14716 if (decl == error_mark_node)
14717 cp_parser_error (parser, "expected class-name");
14722 /* Parse a class-specifier.
14725 class-head { member-specification [opt] }
14727 Returns the TREE_TYPE representing the class. */
14730 cp_parser_class_specifier (cp_parser* parser)
14734 tree attributes = NULL_TREE;
14735 int has_trailing_semicolon;
14736 bool nested_name_specifier_p;
14737 unsigned saved_num_template_parameter_lists;
14738 bool saved_in_function_body;
14739 tree old_scope = NULL_TREE;
14740 tree scope = NULL_TREE;
14743 push_deferring_access_checks (dk_no_deferred);
14745 /* Parse the class-head. */
14746 type = cp_parser_class_head (parser,
14747 &nested_name_specifier_p,
14750 /* If the class-head was a semantic disaster, skip the entire body
14754 cp_parser_skip_to_end_of_block_or_statement (parser);
14755 pop_deferring_access_checks ();
14756 return error_mark_node;
14759 /* Look for the `{'. */
14760 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>"))
14762 pop_deferring_access_checks ();
14763 return error_mark_node;
14766 /* Process the base classes. If they're invalid, skip the
14767 entire class body. */
14768 if (!xref_basetypes (type, bases))
14770 /* Consuming the closing brace yields better error messages
14772 if (cp_parser_skip_to_closing_brace (parser))
14773 cp_lexer_consume_token (parser->lexer);
14774 pop_deferring_access_checks ();
14775 return error_mark_node;
14778 /* Issue an error message if type-definitions are forbidden here. */
14779 cp_parser_check_type_definition (parser);
14780 /* Remember that we are defining one more class. */
14781 ++parser->num_classes_being_defined;
14782 /* Inside the class, surrounding template-parameter-lists do not
14784 saved_num_template_parameter_lists
14785 = parser->num_template_parameter_lists;
14786 parser->num_template_parameter_lists = 0;
14787 /* We are not in a function body. */
14788 saved_in_function_body = parser->in_function_body;
14789 parser->in_function_body = false;
14791 /* Start the class. */
14792 if (nested_name_specifier_p)
14794 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
14795 old_scope = push_inner_scope (scope);
14797 type = begin_class_definition (type, attributes);
14799 if (type == error_mark_node)
14800 /* If the type is erroneous, skip the entire body of the class. */
14801 cp_parser_skip_to_closing_brace (parser);
14803 /* Parse the member-specification. */
14804 cp_parser_member_specification_opt (parser);
14806 /* Look for the trailing `}'. */
14807 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
14808 /* We get better error messages by noticing a common problem: a
14809 missing trailing `;'. */
14810 token = cp_lexer_peek_token (parser->lexer);
14811 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
14812 /* Look for trailing attributes to apply to this class. */
14813 if (cp_parser_allow_gnu_extensions_p (parser))
14814 attributes = cp_parser_attributes_opt (parser);
14815 if (type != error_mark_node)
14816 type = finish_struct (type, attributes);
14817 if (nested_name_specifier_p)
14818 pop_inner_scope (old_scope, scope);
14819 /* If this class is not itself within the scope of another class,
14820 then we need to parse the bodies of all of the queued function
14821 definitions. Note that the queued functions defined in a class
14822 are not always processed immediately following the
14823 class-specifier for that class. Consider:
14826 struct B { void f() { sizeof (A); } };
14829 If `f' were processed before the processing of `A' were
14830 completed, there would be no way to compute the size of `A'.
14831 Note that the nesting we are interested in here is lexical --
14832 not the semantic nesting given by TYPE_CONTEXT. In particular,
14835 struct A { struct B; };
14836 struct A::B { void f() { } };
14838 there is no need to delay the parsing of `A::B::f'. */
14839 if (--parser->num_classes_being_defined == 0)
14843 tree class_type = NULL_TREE;
14844 tree pushed_scope = NULL_TREE;
14846 /* In a first pass, parse default arguments to the functions.
14847 Then, in a second pass, parse the bodies of the functions.
14848 This two-phased approach handles cases like:
14856 for (TREE_PURPOSE (parser->unparsed_functions_queues)
14857 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
14858 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
14859 TREE_PURPOSE (parser->unparsed_functions_queues)
14860 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
14862 fn = TREE_VALUE (queue_entry);
14863 /* If there are default arguments that have not yet been processed,
14864 take care of them now. */
14865 if (class_type != TREE_PURPOSE (queue_entry))
14868 pop_scope (pushed_scope);
14869 class_type = TREE_PURPOSE (queue_entry);
14870 pushed_scope = push_scope (class_type);
14872 /* Make sure that any template parameters are in scope. */
14873 maybe_begin_member_template_processing (fn);
14874 /* Parse the default argument expressions. */
14875 cp_parser_late_parsing_default_args (parser, fn);
14876 /* Remove any template parameters from the symbol table. */
14877 maybe_end_member_template_processing ();
14880 pop_scope (pushed_scope);
14881 /* Now parse the body of the functions. */
14882 for (TREE_VALUE (parser->unparsed_functions_queues)
14883 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
14884 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
14885 TREE_VALUE (parser->unparsed_functions_queues)
14886 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
14888 /* Figure out which function we need to process. */
14889 fn = TREE_VALUE (queue_entry);
14890 /* Parse the function. */
14891 cp_parser_late_parsing_for_member (parser, fn);
14895 /* Put back any saved access checks. */
14896 pop_deferring_access_checks ();
14898 /* Restore saved state. */
14899 parser->in_function_body = saved_in_function_body;
14900 parser->num_template_parameter_lists
14901 = saved_num_template_parameter_lists;
14906 /* Parse a class-head.
14909 class-key identifier [opt] base-clause [opt]
14910 class-key nested-name-specifier identifier base-clause [opt]
14911 class-key nested-name-specifier [opt] template-id
14915 class-key attributes identifier [opt] base-clause [opt]
14916 class-key attributes nested-name-specifier identifier base-clause [opt]
14917 class-key attributes nested-name-specifier [opt] template-id
14920 Upon return BASES is initialized to the list of base classes (or
14921 NULL, if there are none) in the same form returned by
14922 cp_parser_base_clause.
14924 Returns the TYPE of the indicated class. Sets
14925 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
14926 involving a nested-name-specifier was used, and FALSE otherwise.
14928 Returns error_mark_node if this is not a class-head.
14930 Returns NULL_TREE if the class-head is syntactically valid, but
14931 semantically invalid in a way that means we should skip the entire
14932 body of the class. */
14935 cp_parser_class_head (cp_parser* parser,
14936 bool* nested_name_specifier_p,
14937 tree *attributes_p,
14940 tree nested_name_specifier;
14941 enum tag_types class_key;
14942 tree id = NULL_TREE;
14943 tree type = NULL_TREE;
14945 bool template_id_p = false;
14946 bool qualified_p = false;
14947 bool invalid_nested_name_p = false;
14948 bool invalid_explicit_specialization_p = false;
14949 tree pushed_scope = NULL_TREE;
14950 unsigned num_templates;
14951 cp_token *type_start_token = NULL, *nested_name_specifier_token_start = NULL;
14952 /* Assume no nested-name-specifier will be present. */
14953 *nested_name_specifier_p = false;
14954 /* Assume no template parameter lists will be used in defining the
14958 *bases = NULL_TREE;
14960 /* Look for the class-key. */
14961 class_key = cp_parser_class_key (parser);
14962 if (class_key == none_type)
14963 return error_mark_node;
14965 /* Parse the attributes. */
14966 attributes = cp_parser_attributes_opt (parser);
14968 /* If the next token is `::', that is invalid -- but sometimes
14969 people do try to write:
14973 Handle this gracefully by accepting the extra qualifier, and then
14974 issuing an error about it later if this really is a
14975 class-head. If it turns out just to be an elaborated type
14976 specifier, remain silent. */
14977 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
14978 qualified_p = true;
14980 push_deferring_access_checks (dk_no_check);
14982 /* Determine the name of the class. Begin by looking for an
14983 optional nested-name-specifier. */
14984 nested_name_specifier_token_start = cp_lexer_peek_token (parser->lexer);
14985 nested_name_specifier
14986 = cp_parser_nested_name_specifier_opt (parser,
14987 /*typename_keyword_p=*/false,
14988 /*check_dependency_p=*/false,
14990 /*is_declaration=*/false);
14991 /* If there was a nested-name-specifier, then there *must* be an
14993 if (nested_name_specifier)
14995 type_start_token = cp_lexer_peek_token (parser->lexer);
14996 /* Although the grammar says `identifier', it really means
14997 `class-name' or `template-name'. You are only allowed to
14998 define a class that has already been declared with this
15001 The proposed resolution for Core Issue 180 says that wherever
15002 you see `class T::X' you should treat `X' as a type-name.
15004 It is OK to define an inaccessible class; for example:
15006 class A { class B; };
15009 We do not know if we will see a class-name, or a
15010 template-name. We look for a class-name first, in case the
15011 class-name is a template-id; if we looked for the
15012 template-name first we would stop after the template-name. */
15013 cp_parser_parse_tentatively (parser);
15014 type = cp_parser_class_name (parser,
15015 /*typename_keyword_p=*/false,
15016 /*template_keyword_p=*/false,
15018 /*check_dependency_p=*/false,
15019 /*class_head_p=*/true,
15020 /*is_declaration=*/false);
15021 /* If that didn't work, ignore the nested-name-specifier. */
15022 if (!cp_parser_parse_definitely (parser))
15024 invalid_nested_name_p = true;
15025 type_start_token = cp_lexer_peek_token (parser->lexer);
15026 id = cp_parser_identifier (parser);
15027 if (id == error_mark_node)
15030 /* If we could not find a corresponding TYPE, treat this
15031 declaration like an unqualified declaration. */
15032 if (type == error_mark_node)
15033 nested_name_specifier = NULL_TREE;
15034 /* Otherwise, count the number of templates used in TYPE and its
15035 containing scopes. */
15040 for (scope = TREE_TYPE (type);
15041 scope && TREE_CODE (scope) != NAMESPACE_DECL;
15042 scope = (TYPE_P (scope)
15043 ? TYPE_CONTEXT (scope)
15044 : DECL_CONTEXT (scope)))
15046 && CLASS_TYPE_P (scope)
15047 && CLASSTYPE_TEMPLATE_INFO (scope)
15048 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
15049 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
15053 /* Otherwise, the identifier is optional. */
15056 /* We don't know whether what comes next is a template-id,
15057 an identifier, or nothing at all. */
15058 cp_parser_parse_tentatively (parser);
15059 /* Check for a template-id. */
15060 type_start_token = cp_lexer_peek_token (parser->lexer);
15061 id = cp_parser_template_id (parser,
15062 /*template_keyword_p=*/false,
15063 /*check_dependency_p=*/true,
15064 /*is_declaration=*/true);
15065 /* If that didn't work, it could still be an identifier. */
15066 if (!cp_parser_parse_definitely (parser))
15068 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
15070 type_start_token = cp_lexer_peek_token (parser->lexer);
15071 id = cp_parser_identifier (parser);
15078 template_id_p = true;
15083 pop_deferring_access_checks ();
15086 cp_parser_check_for_invalid_template_id (parser, id,
15087 type_start_token->location);
15089 /* If it's not a `:' or a `{' then we can't really be looking at a
15090 class-head, since a class-head only appears as part of a
15091 class-specifier. We have to detect this situation before calling
15092 xref_tag, since that has irreversible side-effects. */
15093 if (!cp_parser_next_token_starts_class_definition_p (parser))
15095 cp_parser_error (parser, "expected %<{%> or %<:%>");
15096 return error_mark_node;
15099 /* At this point, we're going ahead with the class-specifier, even
15100 if some other problem occurs. */
15101 cp_parser_commit_to_tentative_parse (parser);
15102 /* Issue the error about the overly-qualified name now. */
15105 cp_parser_error (parser,
15106 "global qualification of class name is invalid");
15107 return error_mark_node;
15109 else if (invalid_nested_name_p)
15111 cp_parser_error (parser,
15112 "qualified name does not name a class");
15113 return error_mark_node;
15115 else if (nested_name_specifier)
15119 /* Reject typedef-names in class heads. */
15120 if (!DECL_IMPLICIT_TYPEDEF_P (type))
15122 error ("%Hinvalid class name in declaration of %qD",
15123 &type_start_token->location, type);
15128 /* Figure out in what scope the declaration is being placed. */
15129 scope = current_scope ();
15130 /* If that scope does not contain the scope in which the
15131 class was originally declared, the program is invalid. */
15132 if (scope && !is_ancestor (scope, nested_name_specifier))
15134 if (at_namespace_scope_p ())
15135 error ("%Hdeclaration of %qD in namespace %qD which does not "
15137 &type_start_token->location,
15138 type, scope, nested_name_specifier);
15140 error ("%Hdeclaration of %qD in %qD which does not enclose %qD",
15141 &type_start_token->location,
15142 type, scope, nested_name_specifier);
15148 A declarator-id shall not be qualified except for the
15149 definition of a ... nested class outside of its class
15150 ... [or] the definition or explicit instantiation of a
15151 class member of a namespace outside of its namespace. */
15152 if (scope == nested_name_specifier)
15154 permerror (input_location, "%Hextra qualification not allowed",
15155 &nested_name_specifier_token_start->location);
15156 nested_name_specifier = NULL_TREE;
15160 /* An explicit-specialization must be preceded by "template <>". If
15161 it is not, try to recover gracefully. */
15162 if (at_namespace_scope_p ()
15163 && parser->num_template_parameter_lists == 0
15166 error ("%Han explicit specialization must be preceded by %<template <>%>",
15167 &type_start_token->location);
15168 invalid_explicit_specialization_p = true;
15169 /* Take the same action that would have been taken by
15170 cp_parser_explicit_specialization. */
15171 ++parser->num_template_parameter_lists;
15172 begin_specialization ();
15174 /* There must be no "return" statements between this point and the
15175 end of this function; set "type "to the correct return value and
15176 use "goto done;" to return. */
15177 /* Make sure that the right number of template parameters were
15179 if (!cp_parser_check_template_parameters (parser, num_templates,
15180 type_start_token->location))
15182 /* If something went wrong, there is no point in even trying to
15183 process the class-definition. */
15188 /* Look up the type. */
15191 if (TREE_CODE (id) == TEMPLATE_ID_EXPR
15192 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id, 0))
15193 || TREE_CODE (TREE_OPERAND (id, 0)) == OVERLOAD))
15195 error ("%Hfunction template %qD redeclared as a class template",
15196 &type_start_token->location, id);
15197 type = error_mark_node;
15201 type = TREE_TYPE (id);
15202 type = maybe_process_partial_specialization (type);
15204 if (nested_name_specifier)
15205 pushed_scope = push_scope (nested_name_specifier);
15207 else if (nested_name_specifier)
15213 template <typename T> struct S { struct T };
15214 template <typename T> struct S<T>::T { };
15216 we will get a TYPENAME_TYPE when processing the definition of
15217 `S::T'. We need to resolve it to the actual type before we
15218 try to define it. */
15219 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
15221 class_type = resolve_typename_type (TREE_TYPE (type),
15222 /*only_current_p=*/false);
15223 if (TREE_CODE (class_type) != TYPENAME_TYPE)
15224 type = TYPE_NAME (class_type);
15227 cp_parser_error (parser, "could not resolve typename type");
15228 type = error_mark_node;
15232 if (maybe_process_partial_specialization (TREE_TYPE (type))
15233 == error_mark_node)
15239 class_type = current_class_type;
15240 /* Enter the scope indicated by the nested-name-specifier. */
15241 pushed_scope = push_scope (nested_name_specifier);
15242 /* Get the canonical version of this type. */
15243 type = TYPE_MAIN_DECL (TREE_TYPE (type));
15244 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
15245 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
15247 type = push_template_decl (type);
15248 if (type == error_mark_node)
15255 type = TREE_TYPE (type);
15256 *nested_name_specifier_p = true;
15258 else /* The name is not a nested name. */
15260 /* If the class was unnamed, create a dummy name. */
15262 id = make_anon_name ();
15263 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
15264 parser->num_template_parameter_lists);
15267 /* Indicate whether this class was declared as a `class' or as a
15269 if (TREE_CODE (type) == RECORD_TYPE)
15270 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
15271 cp_parser_check_class_key (class_key, type);
15273 /* If this type was already complete, and we see another definition,
15274 that's an error. */
15275 if (type != error_mark_node && COMPLETE_TYPE_P (type))
15277 error ("%Hredefinition of %q#T",
15278 &type_start_token->location, type);
15279 error ("%Hprevious definition of %q+#T",
15280 &type_start_token->location, type);
15284 else if (type == error_mark_node)
15287 /* We will have entered the scope containing the class; the names of
15288 base classes should be looked up in that context. For example:
15290 struct A { struct B {}; struct C; };
15291 struct A::C : B {};
15295 /* Get the list of base-classes, if there is one. */
15296 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15297 *bases = cp_parser_base_clause (parser);
15300 /* Leave the scope given by the nested-name-specifier. We will
15301 enter the class scope itself while processing the members. */
15303 pop_scope (pushed_scope);
15305 if (invalid_explicit_specialization_p)
15307 end_specialization ();
15308 --parser->num_template_parameter_lists;
15310 *attributes_p = attributes;
15314 /* Parse a class-key.
15321 Returns the kind of class-key specified, or none_type to indicate
15324 static enum tag_types
15325 cp_parser_class_key (cp_parser* parser)
15328 enum tag_types tag_type;
15330 /* Look for the class-key. */
15331 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
15335 /* Check to see if the TOKEN is a class-key. */
15336 tag_type = cp_parser_token_is_class_key (token);
15338 cp_parser_error (parser, "expected class-key");
15342 /* Parse an (optional) member-specification.
15344 member-specification:
15345 member-declaration member-specification [opt]
15346 access-specifier : member-specification [opt] */
15349 cp_parser_member_specification_opt (cp_parser* parser)
15356 /* Peek at the next token. */
15357 token = cp_lexer_peek_token (parser->lexer);
15358 /* If it's a `}', or EOF then we've seen all the members. */
15359 if (token->type == CPP_CLOSE_BRACE
15360 || token->type == CPP_EOF
15361 || token->type == CPP_PRAGMA_EOL)
15364 /* See if this token is a keyword. */
15365 keyword = token->keyword;
15369 case RID_PROTECTED:
15371 /* Consume the access-specifier. */
15372 cp_lexer_consume_token (parser->lexer);
15373 /* Remember which access-specifier is active. */
15374 current_access_specifier = token->u.value;
15375 /* Look for the `:'. */
15376 cp_parser_require (parser, CPP_COLON, "%<:%>");
15380 /* Accept #pragmas at class scope. */
15381 if (token->type == CPP_PRAGMA)
15383 cp_parser_pragma (parser, pragma_external);
15387 /* Otherwise, the next construction must be a
15388 member-declaration. */
15389 cp_parser_member_declaration (parser);
15394 /* Parse a member-declaration.
15396 member-declaration:
15397 decl-specifier-seq [opt] member-declarator-list [opt] ;
15398 function-definition ; [opt]
15399 :: [opt] nested-name-specifier template [opt] unqualified-id ;
15401 template-declaration
15403 member-declarator-list:
15405 member-declarator-list , member-declarator
15408 declarator pure-specifier [opt]
15409 declarator constant-initializer [opt]
15410 identifier [opt] : constant-expression
15414 member-declaration:
15415 __extension__ member-declaration
15418 declarator attributes [opt] pure-specifier [opt]
15419 declarator attributes [opt] constant-initializer [opt]
15420 identifier [opt] attributes [opt] : constant-expression
15424 member-declaration:
15425 static_assert-declaration */
15428 cp_parser_member_declaration (cp_parser* parser)
15430 cp_decl_specifier_seq decl_specifiers;
15431 tree prefix_attributes;
15433 int declares_class_or_enum;
15435 cp_token *token = NULL;
15436 cp_token *decl_spec_token_start = NULL;
15437 cp_token *initializer_token_start = NULL;
15438 int saved_pedantic;
15440 /* Check for the `__extension__' keyword. */
15441 if (cp_parser_extension_opt (parser, &saved_pedantic))
15444 cp_parser_member_declaration (parser);
15445 /* Restore the old value of the PEDANTIC flag. */
15446 pedantic = saved_pedantic;
15451 /* Check for a template-declaration. */
15452 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
15454 /* An explicit specialization here is an error condition, and we
15455 expect the specialization handler to detect and report this. */
15456 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
15457 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
15458 cp_parser_explicit_specialization (parser);
15460 cp_parser_template_declaration (parser, /*member_p=*/true);
15465 /* Check for a using-declaration. */
15466 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
15468 /* Parse the using-declaration. */
15469 cp_parser_using_declaration (parser,
15470 /*access_declaration_p=*/false);
15474 /* Check for @defs. */
15475 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
15478 tree ivar_chains = cp_parser_objc_defs_expression (parser);
15479 ivar = ivar_chains;
15483 ivar = TREE_CHAIN (member);
15484 TREE_CHAIN (member) = NULL_TREE;
15485 finish_member_declaration (member);
15490 /* If the next token is `static_assert' we have a static assertion. */
15491 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC_ASSERT))
15493 cp_parser_static_assert (parser, /*member_p=*/true);
15497 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
15500 /* Parse the decl-specifier-seq. */
15501 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
15502 cp_parser_decl_specifier_seq (parser,
15503 CP_PARSER_FLAGS_OPTIONAL,
15505 &declares_class_or_enum);
15506 prefix_attributes = decl_specifiers.attributes;
15507 decl_specifiers.attributes = NULL_TREE;
15508 /* Check for an invalid type-name. */
15509 if (!decl_specifiers.type
15510 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
15512 /* If there is no declarator, then the decl-specifier-seq should
15514 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15516 /* If there was no decl-specifier-seq, and the next token is a
15517 `;', then we have something like:
15523 Each member-declaration shall declare at least one member
15524 name of the class. */
15525 if (!decl_specifiers.any_specifiers_p)
15527 cp_token *token = cp_lexer_peek_token (parser->lexer);
15528 if (!in_system_header_at (token->location))
15529 pedwarn (token->location, OPT_pedantic, "extra %<;%>");
15535 /* See if this declaration is a friend. */
15536 friend_p = cp_parser_friend_p (&decl_specifiers);
15537 /* If there were decl-specifiers, check to see if there was
15538 a class-declaration. */
15539 type = check_tag_decl (&decl_specifiers);
15540 /* Nested classes have already been added to the class, but
15541 a `friend' needs to be explicitly registered. */
15544 /* If the `friend' keyword was present, the friend must
15545 be introduced with a class-key. */
15546 if (!declares_class_or_enum)
15547 error ("%Ha class-key must be used when declaring a friend",
15548 &decl_spec_token_start->location);
15551 template <typename T> struct A {
15552 friend struct A<T>::B;
15555 A<T>::B will be represented by a TYPENAME_TYPE, and
15556 therefore not recognized by check_tag_decl. */
15558 && decl_specifiers.type
15559 && TYPE_P (decl_specifiers.type))
15560 type = decl_specifiers.type;
15561 if (!type || !TYPE_P (type))
15562 error ("%Hfriend declaration does not name a class or "
15563 "function", &decl_spec_token_start->location);
15565 make_friend_class (current_class_type, type,
15566 /*complain=*/true);
15568 /* If there is no TYPE, an error message will already have
15570 else if (!type || type == error_mark_node)
15572 /* An anonymous aggregate has to be handled specially; such
15573 a declaration really declares a data member (with a
15574 particular type), as opposed to a nested class. */
15575 else if (ANON_AGGR_TYPE_P (type))
15577 /* Remove constructors and such from TYPE, now that we
15578 know it is an anonymous aggregate. */
15579 fixup_anonymous_aggr (type);
15580 /* And make the corresponding data member. */
15581 decl = build_decl (FIELD_DECL, NULL_TREE, type);
15582 /* Add it to the class. */
15583 finish_member_declaration (decl);
15586 cp_parser_check_access_in_redeclaration
15588 decl_spec_token_start->location);
15593 /* See if these declarations will be friends. */
15594 friend_p = cp_parser_friend_p (&decl_specifiers);
15596 /* Keep going until we hit the `;' at the end of the
15598 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
15600 tree attributes = NULL_TREE;
15601 tree first_attribute;
15603 /* Peek at the next token. */
15604 token = cp_lexer_peek_token (parser->lexer);
15606 /* Check for a bitfield declaration. */
15607 if (token->type == CPP_COLON
15608 || (token->type == CPP_NAME
15609 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
15615 /* Get the name of the bitfield. Note that we cannot just
15616 check TOKEN here because it may have been invalidated by
15617 the call to cp_lexer_peek_nth_token above. */
15618 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
15619 identifier = cp_parser_identifier (parser);
15621 identifier = NULL_TREE;
15623 /* Consume the `:' token. */
15624 cp_lexer_consume_token (parser->lexer);
15625 /* Get the width of the bitfield. */
15627 = cp_parser_constant_expression (parser,
15628 /*allow_non_constant=*/false,
15631 /* Look for attributes that apply to the bitfield. */
15632 attributes = cp_parser_attributes_opt (parser);
15633 /* Remember which attributes are prefix attributes and
15635 first_attribute = attributes;
15636 /* Combine the attributes. */
15637 attributes = chainon (prefix_attributes, attributes);
15639 /* Create the bitfield declaration. */
15640 decl = grokbitfield (identifier
15641 ? make_id_declarator (NULL_TREE,
15651 cp_declarator *declarator;
15653 tree asm_specification;
15654 int ctor_dtor_or_conv_p;
15656 /* Parse the declarator. */
15658 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
15659 &ctor_dtor_or_conv_p,
15660 /*parenthesized_p=*/NULL,
15661 /*member_p=*/true);
15663 /* If something went wrong parsing the declarator, make sure
15664 that we at least consume some tokens. */
15665 if (declarator == cp_error_declarator)
15667 /* Skip to the end of the statement. */
15668 cp_parser_skip_to_end_of_statement (parser);
15669 /* If the next token is not a semicolon, that is
15670 probably because we just skipped over the body of
15671 a function. So, we consume a semicolon if
15672 present, but do not issue an error message if it
15674 if (cp_lexer_next_token_is (parser->lexer,
15676 cp_lexer_consume_token (parser->lexer);
15680 if (declares_class_or_enum & 2)
15681 cp_parser_check_for_definition_in_return_type
15682 (declarator, decl_specifiers.type,
15683 decl_specifiers.type_location);
15685 /* Look for an asm-specification. */
15686 asm_specification = cp_parser_asm_specification_opt (parser);
15687 /* Look for attributes that apply to the declaration. */
15688 attributes = cp_parser_attributes_opt (parser);
15689 /* Remember which attributes are prefix attributes and
15691 first_attribute = attributes;
15692 /* Combine the attributes. */
15693 attributes = chainon (prefix_attributes, attributes);
15695 /* If it's an `=', then we have a constant-initializer or a
15696 pure-specifier. It is not correct to parse the
15697 initializer before registering the member declaration
15698 since the member declaration should be in scope while
15699 its initializer is processed. However, the rest of the
15700 front end does not yet provide an interface that allows
15701 us to handle this correctly. */
15702 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
15706 A pure-specifier shall be used only in the declaration of
15707 a virtual function.
15709 A member-declarator can contain a constant-initializer
15710 only if it declares a static member of integral or
15713 Therefore, if the DECLARATOR is for a function, we look
15714 for a pure-specifier; otherwise, we look for a
15715 constant-initializer. When we call `grokfield', it will
15716 perform more stringent semantics checks. */
15717 initializer_token_start = cp_lexer_peek_token (parser->lexer);
15718 if (function_declarator_p (declarator))
15719 initializer = cp_parser_pure_specifier (parser);
15721 /* Parse the initializer. */
15722 initializer = cp_parser_constant_initializer (parser);
15724 /* Otherwise, there is no initializer. */
15726 initializer = NULL_TREE;
15728 /* See if we are probably looking at a function
15729 definition. We are certainly not looking at a
15730 member-declarator. Calling `grokfield' has
15731 side-effects, so we must not do it unless we are sure
15732 that we are looking at a member-declarator. */
15733 if (cp_parser_token_starts_function_definition_p
15734 (cp_lexer_peek_token (parser->lexer)))
15736 /* The grammar does not allow a pure-specifier to be
15737 used when a member function is defined. (It is
15738 possible that this fact is an oversight in the
15739 standard, since a pure function may be defined
15740 outside of the class-specifier. */
15742 error ("%Hpure-specifier on function-definition",
15743 &initializer_token_start->location);
15744 decl = cp_parser_save_member_function_body (parser,
15748 /* If the member was not a friend, declare it here. */
15750 finish_member_declaration (decl);
15751 /* Peek at the next token. */
15752 token = cp_lexer_peek_token (parser->lexer);
15753 /* If the next token is a semicolon, consume it. */
15754 if (token->type == CPP_SEMICOLON)
15755 cp_lexer_consume_token (parser->lexer);
15759 /* Create the declaration. */
15760 decl = grokfield (declarator, &decl_specifiers,
15761 initializer, /*init_const_expr_p=*/true,
15766 /* Reset PREFIX_ATTRIBUTES. */
15767 while (attributes && TREE_CHAIN (attributes) != first_attribute)
15768 attributes = TREE_CHAIN (attributes);
15770 TREE_CHAIN (attributes) = NULL_TREE;
15772 /* If there is any qualification still in effect, clear it
15773 now; we will be starting fresh with the next declarator. */
15774 parser->scope = NULL_TREE;
15775 parser->qualifying_scope = NULL_TREE;
15776 parser->object_scope = NULL_TREE;
15777 /* If it's a `,', then there are more declarators. */
15778 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
15779 cp_lexer_consume_token (parser->lexer);
15780 /* If the next token isn't a `;', then we have a parse error. */
15781 else if (cp_lexer_next_token_is_not (parser->lexer,
15784 cp_parser_error (parser, "expected %<;%>");
15785 /* Skip tokens until we find a `;'. */
15786 cp_parser_skip_to_end_of_statement (parser);
15793 /* Add DECL to the list of members. */
15795 finish_member_declaration (decl);
15797 if (TREE_CODE (decl) == FUNCTION_DECL)
15798 cp_parser_save_default_args (parser, decl);
15803 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
15806 /* Parse a pure-specifier.
15811 Returns INTEGER_ZERO_NODE if a pure specifier is found.
15812 Otherwise, ERROR_MARK_NODE is returned. */
15815 cp_parser_pure_specifier (cp_parser* parser)
15819 /* Look for the `=' token. */
15820 if (!cp_parser_require (parser, CPP_EQ, "%<=%>"))
15821 return error_mark_node;
15822 /* Look for the `0' token. */
15823 token = cp_lexer_consume_token (parser->lexer);
15825 /* Accept = default or = delete in c++0x mode. */
15826 if (token->keyword == RID_DEFAULT
15827 || token->keyword == RID_DELETE)
15829 maybe_warn_cpp0x ("defaulted and deleted functions");
15830 return token->u.value;
15833 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
15834 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
15836 cp_parser_error (parser,
15837 "invalid pure specifier (only %<= 0%> is allowed)");
15838 cp_parser_skip_to_end_of_statement (parser);
15839 return error_mark_node;
15841 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
15843 error ("%Htemplates may not be %<virtual%>", &token->location);
15844 return error_mark_node;
15847 return integer_zero_node;
15850 /* Parse a constant-initializer.
15852 constant-initializer:
15853 = constant-expression
15855 Returns a representation of the constant-expression. */
15858 cp_parser_constant_initializer (cp_parser* parser)
15860 /* Look for the `=' token. */
15861 if (!cp_parser_require (parser, CPP_EQ, "%<=%>"))
15862 return error_mark_node;
15864 /* It is invalid to write:
15866 struct S { static const int i = { 7 }; };
15869 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
15871 cp_parser_error (parser,
15872 "a brace-enclosed initializer is not allowed here");
15873 /* Consume the opening brace. */
15874 cp_lexer_consume_token (parser->lexer);
15875 /* Skip the initializer. */
15876 cp_parser_skip_to_closing_brace (parser);
15877 /* Look for the trailing `}'. */
15878 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
15880 return error_mark_node;
15883 return cp_parser_constant_expression (parser,
15884 /*allow_non_constant=*/false,
15888 /* Derived classes [gram.class.derived] */
15890 /* Parse a base-clause.
15893 : base-specifier-list
15895 base-specifier-list:
15896 base-specifier ... [opt]
15897 base-specifier-list , base-specifier ... [opt]
15899 Returns a TREE_LIST representing the base-classes, in the order in
15900 which they were declared. The representation of each node is as
15901 described by cp_parser_base_specifier.
15903 In the case that no bases are specified, this function will return
15904 NULL_TREE, not ERROR_MARK_NODE. */
15907 cp_parser_base_clause (cp_parser* parser)
15909 tree bases = NULL_TREE;
15911 /* Look for the `:' that begins the list. */
15912 cp_parser_require (parser, CPP_COLON, "%<:%>");
15914 /* Scan the base-specifier-list. */
15919 bool pack_expansion_p = false;
15921 /* Look for the base-specifier. */
15922 base = cp_parser_base_specifier (parser);
15923 /* Look for the (optional) ellipsis. */
15924 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
15926 /* Consume the `...'. */
15927 cp_lexer_consume_token (parser->lexer);
15929 pack_expansion_p = true;
15932 /* Add BASE to the front of the list. */
15933 if (base != error_mark_node)
15935 if (pack_expansion_p)
15936 /* Make this a pack expansion type. */
15937 TREE_VALUE (base) = make_pack_expansion (TREE_VALUE (base));
15940 if (!check_for_bare_parameter_packs (TREE_VALUE (base)))
15942 TREE_CHAIN (base) = bases;
15946 /* Peek at the next token. */
15947 token = cp_lexer_peek_token (parser->lexer);
15948 /* If it's not a comma, then the list is complete. */
15949 if (token->type != CPP_COMMA)
15951 /* Consume the `,'. */
15952 cp_lexer_consume_token (parser->lexer);
15955 /* PARSER->SCOPE may still be non-NULL at this point, if the last
15956 base class had a qualified name. However, the next name that
15957 appears is certainly not qualified. */
15958 parser->scope = NULL_TREE;
15959 parser->qualifying_scope = NULL_TREE;
15960 parser->object_scope = NULL_TREE;
15962 return nreverse (bases);
15965 /* Parse a base-specifier.
15968 :: [opt] nested-name-specifier [opt] class-name
15969 virtual access-specifier [opt] :: [opt] nested-name-specifier
15971 access-specifier virtual [opt] :: [opt] nested-name-specifier
15974 Returns a TREE_LIST. The TREE_PURPOSE will be one of
15975 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
15976 indicate the specifiers provided. The TREE_VALUE will be a TYPE
15977 (or the ERROR_MARK_NODE) indicating the type that was specified. */
15980 cp_parser_base_specifier (cp_parser* parser)
15984 bool virtual_p = false;
15985 bool duplicate_virtual_error_issued_p = false;
15986 bool duplicate_access_error_issued_p = false;
15987 bool class_scope_p, template_p;
15988 tree access = access_default_node;
15991 /* Process the optional `virtual' and `access-specifier'. */
15994 /* Peek at the next token. */
15995 token = cp_lexer_peek_token (parser->lexer);
15996 /* Process `virtual'. */
15997 switch (token->keyword)
16000 /* If `virtual' appears more than once, issue an error. */
16001 if (virtual_p && !duplicate_virtual_error_issued_p)
16003 cp_parser_error (parser,
16004 "%<virtual%> specified more than once in base-specified");
16005 duplicate_virtual_error_issued_p = true;
16010 /* Consume the `virtual' token. */
16011 cp_lexer_consume_token (parser->lexer);
16016 case RID_PROTECTED:
16018 /* If more than one access specifier appears, issue an
16020 if (access != access_default_node
16021 && !duplicate_access_error_issued_p)
16023 cp_parser_error (parser,
16024 "more than one access specifier in base-specified");
16025 duplicate_access_error_issued_p = true;
16028 access = ridpointers[(int) token->keyword];
16030 /* Consume the access-specifier. */
16031 cp_lexer_consume_token (parser->lexer);
16040 /* It is not uncommon to see programs mechanically, erroneously, use
16041 the 'typename' keyword to denote (dependent) qualified types
16042 as base classes. */
16043 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
16045 token = cp_lexer_peek_token (parser->lexer);
16046 if (!processing_template_decl)
16047 error ("%Hkeyword %<typename%> not allowed outside of templates",
16050 error ("%Hkeyword %<typename%> not allowed in this context "
16051 "(the base class is implicitly a type)",
16053 cp_lexer_consume_token (parser->lexer);
16056 /* Look for the optional `::' operator. */
16057 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
16058 /* Look for the nested-name-specifier. The simplest way to
16063 The keyword `typename' is not permitted in a base-specifier or
16064 mem-initializer; in these contexts a qualified name that
16065 depends on a template-parameter is implicitly assumed to be a
16068 is to pretend that we have seen the `typename' keyword at this
16070 cp_parser_nested_name_specifier_opt (parser,
16071 /*typename_keyword_p=*/true,
16072 /*check_dependency_p=*/true,
16074 /*is_declaration=*/true);
16075 /* If the base class is given by a qualified name, assume that names
16076 we see are type names or templates, as appropriate. */
16077 class_scope_p = (parser->scope && TYPE_P (parser->scope));
16078 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
16080 /* Finally, look for the class-name. */
16081 type = cp_parser_class_name (parser,
16085 /*check_dependency_p=*/true,
16086 /*class_head_p=*/false,
16087 /*is_declaration=*/true);
16089 if (type == error_mark_node)
16090 return error_mark_node;
16092 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
16095 /* Exception handling [gram.exception] */
16097 /* Parse an (optional) exception-specification.
16099 exception-specification:
16100 throw ( type-id-list [opt] )
16102 Returns a TREE_LIST representing the exception-specification. The
16103 TREE_VALUE of each node is a type. */
16106 cp_parser_exception_specification_opt (cp_parser* parser)
16111 /* Peek at the next token. */
16112 token = cp_lexer_peek_token (parser->lexer);
16113 /* If it's not `throw', then there's no exception-specification. */
16114 if (!cp_parser_is_keyword (token, RID_THROW))
16117 /* Consume the `throw'. */
16118 cp_lexer_consume_token (parser->lexer);
16120 /* Look for the `('. */
16121 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16123 /* Peek at the next token. */
16124 token = cp_lexer_peek_token (parser->lexer);
16125 /* If it's not a `)', then there is a type-id-list. */
16126 if (token->type != CPP_CLOSE_PAREN)
16128 const char *saved_message;
16130 /* Types may not be defined in an exception-specification. */
16131 saved_message = parser->type_definition_forbidden_message;
16132 parser->type_definition_forbidden_message
16133 = "types may not be defined in an exception-specification";
16134 /* Parse the type-id-list. */
16135 type_id_list = cp_parser_type_id_list (parser);
16136 /* Restore the saved message. */
16137 parser->type_definition_forbidden_message = saved_message;
16140 type_id_list = empty_except_spec;
16142 /* Look for the `)'. */
16143 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16145 return type_id_list;
16148 /* Parse an (optional) type-id-list.
16152 type-id-list , type-id ... [opt]
16154 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
16155 in the order that the types were presented. */
16158 cp_parser_type_id_list (cp_parser* parser)
16160 tree types = NULL_TREE;
16167 /* Get the next type-id. */
16168 type = cp_parser_type_id (parser);
16169 /* Parse the optional ellipsis. */
16170 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
16172 /* Consume the `...'. */
16173 cp_lexer_consume_token (parser->lexer);
16175 /* Turn the type into a pack expansion expression. */
16176 type = make_pack_expansion (type);
16178 /* Add it to the list. */
16179 types = add_exception_specifier (types, type, /*complain=*/1);
16180 /* Peek at the next token. */
16181 token = cp_lexer_peek_token (parser->lexer);
16182 /* If it is not a `,', we are done. */
16183 if (token->type != CPP_COMMA)
16185 /* Consume the `,'. */
16186 cp_lexer_consume_token (parser->lexer);
16189 return nreverse (types);
16192 /* Parse a try-block.
16195 try compound-statement handler-seq */
16198 cp_parser_try_block (cp_parser* parser)
16202 cp_parser_require_keyword (parser, RID_TRY, "%<try%>");
16203 try_block = begin_try_block ();
16204 cp_parser_compound_statement (parser, NULL, true);
16205 finish_try_block (try_block);
16206 cp_parser_handler_seq (parser);
16207 finish_handler_sequence (try_block);
16212 /* Parse a function-try-block.
16214 function-try-block:
16215 try ctor-initializer [opt] function-body handler-seq */
16218 cp_parser_function_try_block (cp_parser* parser)
16220 tree compound_stmt;
16222 bool ctor_initializer_p;
16224 /* Look for the `try' keyword. */
16225 if (!cp_parser_require_keyword (parser, RID_TRY, "%<try%>"))
16227 /* Let the rest of the front end know where we are. */
16228 try_block = begin_function_try_block (&compound_stmt);
16229 /* Parse the function-body. */
16231 = cp_parser_ctor_initializer_opt_and_function_body (parser);
16232 /* We're done with the `try' part. */
16233 finish_function_try_block (try_block);
16234 /* Parse the handlers. */
16235 cp_parser_handler_seq (parser);
16236 /* We're done with the handlers. */
16237 finish_function_handler_sequence (try_block, compound_stmt);
16239 return ctor_initializer_p;
16242 /* Parse a handler-seq.
16245 handler handler-seq [opt] */
16248 cp_parser_handler_seq (cp_parser* parser)
16254 /* Parse the handler. */
16255 cp_parser_handler (parser);
16256 /* Peek at the next token. */
16257 token = cp_lexer_peek_token (parser->lexer);
16258 /* If it's not `catch' then there are no more handlers. */
16259 if (!cp_parser_is_keyword (token, RID_CATCH))
16264 /* Parse a handler.
16267 catch ( exception-declaration ) compound-statement */
16270 cp_parser_handler (cp_parser* parser)
16275 cp_parser_require_keyword (parser, RID_CATCH, "%<catch%>");
16276 handler = begin_handler ();
16277 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16278 declaration = cp_parser_exception_declaration (parser);
16279 finish_handler_parms (declaration, handler);
16280 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16281 cp_parser_compound_statement (parser, NULL, false);
16282 finish_handler (handler);
16285 /* Parse an exception-declaration.
16287 exception-declaration:
16288 type-specifier-seq declarator
16289 type-specifier-seq abstract-declarator
16293 Returns a VAR_DECL for the declaration, or NULL_TREE if the
16294 ellipsis variant is used. */
16297 cp_parser_exception_declaration (cp_parser* parser)
16299 cp_decl_specifier_seq type_specifiers;
16300 cp_declarator *declarator;
16301 const char *saved_message;
16303 /* If it's an ellipsis, it's easy to handle. */
16304 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
16306 /* Consume the `...' token. */
16307 cp_lexer_consume_token (parser->lexer);
16311 /* Types may not be defined in exception-declarations. */
16312 saved_message = parser->type_definition_forbidden_message;
16313 parser->type_definition_forbidden_message
16314 = "types may not be defined in exception-declarations";
16316 /* Parse the type-specifier-seq. */
16317 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
16319 /* If it's a `)', then there is no declarator. */
16320 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
16323 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
16324 /*ctor_dtor_or_conv_p=*/NULL,
16325 /*parenthesized_p=*/NULL,
16326 /*member_p=*/false);
16328 /* Restore the saved message. */
16329 parser->type_definition_forbidden_message = saved_message;
16331 if (!type_specifiers.any_specifiers_p)
16332 return error_mark_node;
16334 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
16337 /* Parse a throw-expression.
16340 throw assignment-expression [opt]
16342 Returns a THROW_EXPR representing the throw-expression. */
16345 cp_parser_throw_expression (cp_parser* parser)
16350 cp_parser_require_keyword (parser, RID_THROW, "%<throw%>");
16351 token = cp_lexer_peek_token (parser->lexer);
16352 /* Figure out whether or not there is an assignment-expression
16353 following the "throw" keyword. */
16354 if (token->type == CPP_COMMA
16355 || token->type == CPP_SEMICOLON
16356 || token->type == CPP_CLOSE_PAREN
16357 || token->type == CPP_CLOSE_SQUARE
16358 || token->type == CPP_CLOSE_BRACE
16359 || token->type == CPP_COLON)
16360 expression = NULL_TREE;
16362 expression = cp_parser_assignment_expression (parser,
16365 return build_throw (expression);
16368 /* GNU Extensions */
16370 /* Parse an (optional) asm-specification.
16373 asm ( string-literal )
16375 If the asm-specification is present, returns a STRING_CST
16376 corresponding to the string-literal. Otherwise, returns
16380 cp_parser_asm_specification_opt (cp_parser* parser)
16383 tree asm_specification;
16385 /* Peek at the next token. */
16386 token = cp_lexer_peek_token (parser->lexer);
16387 /* If the next token isn't the `asm' keyword, then there's no
16388 asm-specification. */
16389 if (!cp_parser_is_keyword (token, RID_ASM))
16392 /* Consume the `asm' token. */
16393 cp_lexer_consume_token (parser->lexer);
16394 /* Look for the `('. */
16395 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16397 /* Look for the string-literal. */
16398 asm_specification = cp_parser_string_literal (parser, false, false);
16400 /* Look for the `)'. */
16401 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16403 return asm_specification;
16406 /* Parse an asm-operand-list.
16410 asm-operand-list , asm-operand
16413 string-literal ( expression )
16414 [ string-literal ] string-literal ( expression )
16416 Returns a TREE_LIST representing the operands. The TREE_VALUE of
16417 each node is the expression. The TREE_PURPOSE is itself a
16418 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
16419 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
16420 is a STRING_CST for the string literal before the parenthesis. Returns
16421 ERROR_MARK_NODE if any of the operands are invalid. */
16424 cp_parser_asm_operand_list (cp_parser* parser)
16426 tree asm_operands = NULL_TREE;
16427 bool invalid_operands = false;
16431 tree string_literal;
16435 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
16437 /* Consume the `[' token. */
16438 cp_lexer_consume_token (parser->lexer);
16439 /* Read the operand name. */
16440 name = cp_parser_identifier (parser);
16441 if (name != error_mark_node)
16442 name = build_string (IDENTIFIER_LENGTH (name),
16443 IDENTIFIER_POINTER (name));
16444 /* Look for the closing `]'. */
16445 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
16449 /* Look for the string-literal. */
16450 string_literal = cp_parser_string_literal (parser, false, false);
16452 /* Look for the `('. */
16453 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16454 /* Parse the expression. */
16455 expression = cp_parser_expression (parser, /*cast_p=*/false);
16456 /* Look for the `)'. */
16457 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16459 if (name == error_mark_node
16460 || string_literal == error_mark_node
16461 || expression == error_mark_node)
16462 invalid_operands = true;
16464 /* Add this operand to the list. */
16465 asm_operands = tree_cons (build_tree_list (name, string_literal),
16468 /* If the next token is not a `,', there are no more
16470 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
16472 /* Consume the `,'. */
16473 cp_lexer_consume_token (parser->lexer);
16476 return invalid_operands ? error_mark_node : nreverse (asm_operands);
16479 /* Parse an asm-clobber-list.
16483 asm-clobber-list , string-literal
16485 Returns a TREE_LIST, indicating the clobbers in the order that they
16486 appeared. The TREE_VALUE of each node is a STRING_CST. */
16489 cp_parser_asm_clobber_list (cp_parser* parser)
16491 tree clobbers = NULL_TREE;
16495 tree string_literal;
16497 /* Look for the string literal. */
16498 string_literal = cp_parser_string_literal (parser, false, false);
16499 /* Add it to the list. */
16500 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
16501 /* If the next token is not a `,', then the list is
16503 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
16505 /* Consume the `,' token. */
16506 cp_lexer_consume_token (parser->lexer);
16512 /* Parse an (optional) series of attributes.
16515 attributes attribute
16518 __attribute__ (( attribute-list [opt] ))
16520 The return value is as for cp_parser_attribute_list. */
16523 cp_parser_attributes_opt (cp_parser* parser)
16525 tree attributes = NULL_TREE;
16530 tree attribute_list;
16532 /* Peek at the next token. */
16533 token = cp_lexer_peek_token (parser->lexer);
16534 /* If it's not `__attribute__', then we're done. */
16535 if (token->keyword != RID_ATTRIBUTE)
16538 /* Consume the `__attribute__' keyword. */
16539 cp_lexer_consume_token (parser->lexer);
16540 /* Look for the two `(' tokens. */
16541 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16542 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
16544 /* Peek at the next token. */
16545 token = cp_lexer_peek_token (parser->lexer);
16546 if (token->type != CPP_CLOSE_PAREN)
16547 /* Parse the attribute-list. */
16548 attribute_list = cp_parser_attribute_list (parser);
16550 /* If the next token is a `)', then there is no attribute
16552 attribute_list = NULL;
16554 /* Look for the two `)' tokens. */
16555 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16556 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
16558 /* Add these new attributes to the list. */
16559 attributes = chainon (attributes, attribute_list);
16565 /* Parse an attribute-list.
16569 attribute-list , attribute
16573 identifier ( identifier )
16574 identifier ( identifier , expression-list )
16575 identifier ( expression-list )
16577 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
16578 to an attribute. The TREE_PURPOSE of each node is the identifier
16579 indicating which attribute is in use. The TREE_VALUE represents
16580 the arguments, if any. */
16583 cp_parser_attribute_list (cp_parser* parser)
16585 tree attribute_list = NULL_TREE;
16586 bool save_translate_strings_p = parser->translate_strings_p;
16588 parser->translate_strings_p = false;
16595 /* Look for the identifier. We also allow keywords here; for
16596 example `__attribute__ ((const))' is legal. */
16597 token = cp_lexer_peek_token (parser->lexer);
16598 if (token->type == CPP_NAME
16599 || token->type == CPP_KEYWORD)
16601 tree arguments = NULL_TREE;
16603 /* Consume the token. */
16604 token = cp_lexer_consume_token (parser->lexer);
16606 /* Save away the identifier that indicates which attribute
16608 identifier = token->u.value;
16609 attribute = build_tree_list (identifier, NULL_TREE);
16611 /* Peek at the next token. */
16612 token = cp_lexer_peek_token (parser->lexer);
16613 /* If it's an `(', then parse the attribute arguments. */
16614 if (token->type == CPP_OPEN_PAREN)
16616 arguments = cp_parser_parenthesized_expression_list
16617 (parser, true, /*cast_p=*/false,
16618 /*allow_expansion_p=*/false,
16619 /*non_constant_p=*/NULL);
16620 /* Save the arguments away. */
16621 TREE_VALUE (attribute) = arguments;
16624 if (arguments != error_mark_node)
16626 /* Add this attribute to the list. */
16627 TREE_CHAIN (attribute) = attribute_list;
16628 attribute_list = attribute;
16631 token = cp_lexer_peek_token (parser->lexer);
16633 /* Now, look for more attributes. If the next token isn't a
16634 `,', we're done. */
16635 if (token->type != CPP_COMMA)
16638 /* Consume the comma and keep going. */
16639 cp_lexer_consume_token (parser->lexer);
16641 parser->translate_strings_p = save_translate_strings_p;
16643 /* We built up the list in reverse order. */
16644 return nreverse (attribute_list);
16647 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
16648 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
16649 current value of the PEDANTIC flag, regardless of whether or not
16650 the `__extension__' keyword is present. The caller is responsible
16651 for restoring the value of the PEDANTIC flag. */
16654 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
16656 /* Save the old value of the PEDANTIC flag. */
16657 *saved_pedantic = pedantic;
16659 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
16661 /* Consume the `__extension__' token. */
16662 cp_lexer_consume_token (parser->lexer);
16663 /* We're not being pedantic while the `__extension__' keyword is
16673 /* Parse a label declaration.
16676 __label__ label-declarator-seq ;
16678 label-declarator-seq:
16679 identifier , label-declarator-seq
16683 cp_parser_label_declaration (cp_parser* parser)
16685 /* Look for the `__label__' keyword. */
16686 cp_parser_require_keyword (parser, RID_LABEL, "%<__label__%>");
16692 /* Look for an identifier. */
16693 identifier = cp_parser_identifier (parser);
16694 /* If we failed, stop. */
16695 if (identifier == error_mark_node)
16697 /* Declare it as a label. */
16698 finish_label_decl (identifier);
16699 /* If the next token is a `;', stop. */
16700 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16702 /* Look for the `,' separating the label declarations. */
16703 cp_parser_require (parser, CPP_COMMA, "%<,%>");
16706 /* Look for the final `;'. */
16707 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
16710 /* Support Functions */
16712 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
16713 NAME should have one of the representations used for an
16714 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
16715 is returned. If PARSER->SCOPE is a dependent type, then a
16716 SCOPE_REF is returned.
16718 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
16719 returned; the name was already resolved when the TEMPLATE_ID_EXPR
16720 was formed. Abstractly, such entities should not be passed to this
16721 function, because they do not need to be looked up, but it is
16722 simpler to check for this special case here, rather than at the
16725 In cases not explicitly covered above, this function returns a
16726 DECL, OVERLOAD, or baselink representing the result of the lookup.
16727 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
16730 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
16731 (e.g., "struct") that was used. In that case bindings that do not
16732 refer to types are ignored.
16734 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
16737 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
16740 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
16743 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
16744 TREE_LIST of candidates if name-lookup results in an ambiguity, and
16745 NULL_TREE otherwise. */
16748 cp_parser_lookup_name (cp_parser *parser, tree name,
16749 enum tag_types tag_type,
16752 bool check_dependency,
16753 tree *ambiguous_decls,
16754 location_t name_location)
16758 tree object_type = parser->context->object_type;
16760 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
16761 flags |= LOOKUP_COMPLAIN;
16763 /* Assume that the lookup will be unambiguous. */
16764 if (ambiguous_decls)
16765 *ambiguous_decls = NULL_TREE;
16767 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
16768 no longer valid. Note that if we are parsing tentatively, and
16769 the parse fails, OBJECT_TYPE will be automatically restored. */
16770 parser->context->object_type = NULL_TREE;
16772 if (name == error_mark_node)
16773 return error_mark_node;
16775 /* A template-id has already been resolved; there is no lookup to
16777 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
16779 if (BASELINK_P (name))
16781 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
16782 == TEMPLATE_ID_EXPR);
16786 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
16787 it should already have been checked to make sure that the name
16788 used matches the type being destroyed. */
16789 if (TREE_CODE (name) == BIT_NOT_EXPR)
16793 /* Figure out to which type this destructor applies. */
16795 type = parser->scope;
16796 else if (object_type)
16797 type = object_type;
16799 type = current_class_type;
16800 /* If that's not a class type, there is no destructor. */
16801 if (!type || !CLASS_TYPE_P (type))
16802 return error_mark_node;
16803 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
16804 lazily_declare_fn (sfk_destructor, type);
16805 if (!CLASSTYPE_DESTRUCTORS (type))
16806 return error_mark_node;
16807 /* If it was a class type, return the destructor. */
16808 return CLASSTYPE_DESTRUCTORS (type);
16811 /* By this point, the NAME should be an ordinary identifier. If
16812 the id-expression was a qualified name, the qualifying scope is
16813 stored in PARSER->SCOPE at this point. */
16814 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
16816 /* Perform the lookup. */
16821 if (parser->scope == error_mark_node)
16822 return error_mark_node;
16824 /* If the SCOPE is dependent, the lookup must be deferred until
16825 the template is instantiated -- unless we are explicitly
16826 looking up names in uninstantiated templates. Even then, we
16827 cannot look up the name if the scope is not a class type; it
16828 might, for example, be a template type parameter. */
16829 dependent_p = (TYPE_P (parser->scope)
16830 && !(parser->in_declarator_p
16831 && currently_open_class (parser->scope))
16832 && dependent_type_p (parser->scope));
16833 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
16840 /* The resolution to Core Issue 180 says that `struct
16841 A::B' should be considered a type-name, even if `A'
16843 type = make_typename_type (parser->scope, name, tag_type,
16844 /*complain=*/tf_error);
16845 decl = TYPE_NAME (type);
16847 else if (is_template
16848 && (cp_parser_next_token_ends_template_argument_p (parser)
16849 || cp_lexer_next_token_is (parser->lexer,
16851 decl = make_unbound_class_template (parser->scope,
16853 /*complain=*/tf_error);
16855 decl = build_qualified_name (/*type=*/NULL_TREE,
16856 parser->scope, name,
16861 tree pushed_scope = NULL_TREE;
16863 /* If PARSER->SCOPE is a dependent type, then it must be a
16864 class type, and we must not be checking dependencies;
16865 otherwise, we would have processed this lookup above. So
16866 that PARSER->SCOPE is not considered a dependent base by
16867 lookup_member, we must enter the scope here. */
16869 pushed_scope = push_scope (parser->scope);
16870 /* If the PARSER->SCOPE is a template specialization, it
16871 may be instantiated during name lookup. In that case,
16872 errors may be issued. Even if we rollback the current
16873 tentative parse, those errors are valid. */
16874 decl = lookup_qualified_name (parser->scope, name,
16875 tag_type != none_type,
16876 /*complain=*/true);
16878 /* If we have a single function from a using decl, pull it out. */
16880 && TREE_CODE (decl) == OVERLOAD
16881 && !really_overloaded_fn (decl))
16882 decl = OVL_FUNCTION (decl);
16885 pop_scope (pushed_scope);
16887 parser->qualifying_scope = parser->scope;
16888 parser->object_scope = NULL_TREE;
16890 else if (object_type)
16892 tree object_decl = NULL_TREE;
16893 /* Look up the name in the scope of the OBJECT_TYPE, unless the
16894 OBJECT_TYPE is not a class. */
16895 if (CLASS_TYPE_P (object_type))
16896 /* If the OBJECT_TYPE is a template specialization, it may
16897 be instantiated during name lookup. In that case, errors
16898 may be issued. Even if we rollback the current tentative
16899 parse, those errors are valid. */
16900 object_decl = lookup_member (object_type,
16903 tag_type != none_type);
16904 /* Look it up in the enclosing context, too. */
16905 decl = lookup_name_real (name, tag_type != none_type,
16907 /*block_p=*/true, is_namespace, flags);
16908 parser->object_scope = object_type;
16909 parser->qualifying_scope = NULL_TREE;
16911 decl = object_decl;
16915 decl = lookup_name_real (name, tag_type != none_type,
16917 /*block_p=*/true, is_namespace, flags);
16918 parser->qualifying_scope = NULL_TREE;
16919 parser->object_scope = NULL_TREE;
16922 /* If the lookup failed, let our caller know. */
16923 if (!decl || decl == error_mark_node)
16924 return error_mark_node;
16926 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
16927 if (TREE_CODE (decl) == TREE_LIST)
16929 if (ambiguous_decls)
16930 *ambiguous_decls = decl;
16931 /* The error message we have to print is too complicated for
16932 cp_parser_error, so we incorporate its actions directly. */
16933 if (!cp_parser_simulate_error (parser))
16935 error ("%Hreference to %qD is ambiguous",
16936 &name_location, name);
16937 print_candidates (decl);
16939 return error_mark_node;
16942 gcc_assert (DECL_P (decl)
16943 || TREE_CODE (decl) == OVERLOAD
16944 || TREE_CODE (decl) == SCOPE_REF
16945 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
16946 || BASELINK_P (decl));
16948 /* If we have resolved the name of a member declaration, check to
16949 see if the declaration is accessible. When the name resolves to
16950 set of overloaded functions, accessibility is checked when
16951 overload resolution is done.
16953 During an explicit instantiation, access is not checked at all,
16954 as per [temp.explicit]. */
16956 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
16961 /* Like cp_parser_lookup_name, but for use in the typical case where
16962 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
16963 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
16966 cp_parser_lookup_name_simple (cp_parser* parser, tree name, location_t location)
16968 return cp_parser_lookup_name (parser, name,
16970 /*is_template=*/false,
16971 /*is_namespace=*/false,
16972 /*check_dependency=*/true,
16973 /*ambiguous_decls=*/NULL,
16977 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
16978 the current context, return the TYPE_DECL. If TAG_NAME_P is
16979 true, the DECL indicates the class being defined in a class-head,
16980 or declared in an elaborated-type-specifier.
16982 Otherwise, return DECL. */
16985 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
16987 /* If the TEMPLATE_DECL is being declared as part of a class-head,
16988 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
16991 template <typename T> struct B;
16994 template <typename T> struct A::B {};
16996 Similarly, in an elaborated-type-specifier:
16998 namespace N { struct X{}; }
17001 template <typename T> friend struct N::X;
17004 However, if the DECL refers to a class type, and we are in
17005 the scope of the class, then the name lookup automatically
17006 finds the TYPE_DECL created by build_self_reference rather
17007 than a TEMPLATE_DECL. For example, in:
17009 template <class T> struct S {
17013 there is no need to handle such case. */
17015 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
17016 return DECL_TEMPLATE_RESULT (decl);
17021 /* If too many, or too few, template-parameter lists apply to the
17022 declarator, issue an error message. Returns TRUE if all went well,
17023 and FALSE otherwise. */
17026 cp_parser_check_declarator_template_parameters (cp_parser* parser,
17027 cp_declarator *declarator,
17028 location_t declarator_location)
17030 unsigned num_templates;
17032 /* We haven't seen any classes that involve template parameters yet. */
17035 switch (declarator->kind)
17038 if (declarator->u.id.qualifying_scope)
17043 scope = declarator->u.id.qualifying_scope;
17044 member = declarator->u.id.unqualified_name;
17046 while (scope && CLASS_TYPE_P (scope))
17048 /* You're supposed to have one `template <...>'
17049 for every template class, but you don't need one
17050 for a full specialization. For example:
17052 template <class T> struct S{};
17053 template <> struct S<int> { void f(); };
17054 void S<int>::f () {}
17056 is correct; there shouldn't be a `template <>' for
17057 the definition of `S<int>::f'. */
17058 if (!CLASSTYPE_TEMPLATE_INFO (scope))
17059 /* If SCOPE does not have template information of any
17060 kind, then it is not a template, nor is it nested
17061 within a template. */
17063 if (explicit_class_specialization_p (scope))
17065 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
17068 scope = TYPE_CONTEXT (scope);
17071 else if (TREE_CODE (declarator->u.id.unqualified_name)
17072 == TEMPLATE_ID_EXPR)
17073 /* If the DECLARATOR has the form `X<y>' then it uses one
17074 additional level of template parameters. */
17077 return cp_parser_check_template_parameters (parser,
17079 declarator_location);
17084 case cdk_reference:
17086 return (cp_parser_check_declarator_template_parameters
17087 (parser, declarator->declarator, declarator_location));
17093 gcc_unreachable ();
17098 /* NUM_TEMPLATES were used in the current declaration. If that is
17099 invalid, return FALSE and issue an error messages. Otherwise,
17103 cp_parser_check_template_parameters (cp_parser* parser,
17104 unsigned num_templates,
17105 location_t location)
17107 /* If there are more template classes than parameter lists, we have
17110 template <class T> void S<T>::R<T>::f (); */
17111 if (parser->num_template_parameter_lists < num_templates)
17113 error ("%Htoo few template-parameter-lists", &location);
17116 /* If there are the same number of template classes and parameter
17117 lists, that's OK. */
17118 if (parser->num_template_parameter_lists == num_templates)
17120 /* If there are more, but only one more, then we are referring to a
17121 member template. That's OK too. */
17122 if (parser->num_template_parameter_lists == num_templates + 1)
17124 /* Otherwise, there are too many template parameter lists. We have
17127 template <class T> template <class U> void S::f(); */
17128 error ("%Htoo many template-parameter-lists", &location);
17132 /* Parse an optional `::' token indicating that the following name is
17133 from the global namespace. If so, PARSER->SCOPE is set to the
17134 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
17135 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
17136 Returns the new value of PARSER->SCOPE, if the `::' token is
17137 present, and NULL_TREE otherwise. */
17140 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
17144 /* Peek at the next token. */
17145 token = cp_lexer_peek_token (parser->lexer);
17146 /* If we're looking at a `::' token then we're starting from the
17147 global namespace, not our current location. */
17148 if (token->type == CPP_SCOPE)
17150 /* Consume the `::' token. */
17151 cp_lexer_consume_token (parser->lexer);
17152 /* Set the SCOPE so that we know where to start the lookup. */
17153 parser->scope = global_namespace;
17154 parser->qualifying_scope = global_namespace;
17155 parser->object_scope = NULL_TREE;
17157 return parser->scope;
17159 else if (!current_scope_valid_p)
17161 parser->scope = NULL_TREE;
17162 parser->qualifying_scope = NULL_TREE;
17163 parser->object_scope = NULL_TREE;
17169 /* Returns TRUE if the upcoming token sequence is the start of a
17170 constructor declarator. If FRIEND_P is true, the declarator is
17171 preceded by the `friend' specifier. */
17174 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
17176 bool constructor_p;
17177 tree type_decl = NULL_TREE;
17178 bool nested_name_p;
17179 cp_token *next_token;
17181 /* The common case is that this is not a constructor declarator, so
17182 try to avoid doing lots of work if at all possible. It's not
17183 valid declare a constructor at function scope. */
17184 if (parser->in_function_body)
17186 /* And only certain tokens can begin a constructor declarator. */
17187 next_token = cp_lexer_peek_token (parser->lexer);
17188 if (next_token->type != CPP_NAME
17189 && next_token->type != CPP_SCOPE
17190 && next_token->type != CPP_NESTED_NAME_SPECIFIER
17191 && next_token->type != CPP_TEMPLATE_ID)
17194 /* Parse tentatively; we are going to roll back all of the tokens
17196 cp_parser_parse_tentatively (parser);
17197 /* Assume that we are looking at a constructor declarator. */
17198 constructor_p = true;
17200 /* Look for the optional `::' operator. */
17201 cp_parser_global_scope_opt (parser,
17202 /*current_scope_valid_p=*/false);
17203 /* Look for the nested-name-specifier. */
17205 = (cp_parser_nested_name_specifier_opt (parser,
17206 /*typename_keyword_p=*/false,
17207 /*check_dependency_p=*/false,
17209 /*is_declaration=*/false)
17211 /* Outside of a class-specifier, there must be a
17212 nested-name-specifier. */
17213 if (!nested_name_p &&
17214 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
17216 constructor_p = false;
17217 /* If we still think that this might be a constructor-declarator,
17218 look for a class-name. */
17223 template <typename T> struct S { S(); };
17224 template <typename T> S<T>::S ();
17226 we must recognize that the nested `S' names a class.
17229 template <typename T> S<T>::S<T> ();
17231 we must recognize that the nested `S' names a template. */
17232 type_decl = cp_parser_class_name (parser,
17233 /*typename_keyword_p=*/false,
17234 /*template_keyword_p=*/false,
17236 /*check_dependency_p=*/false,
17237 /*class_head_p=*/false,
17238 /*is_declaration=*/false);
17239 /* If there was no class-name, then this is not a constructor. */
17240 constructor_p = !cp_parser_error_occurred (parser);
17243 /* If we're still considering a constructor, we have to see a `(',
17244 to begin the parameter-declaration-clause, followed by either a
17245 `)', an `...', or a decl-specifier. We need to check for a
17246 type-specifier to avoid being fooled into thinking that:
17250 is a constructor. (It is actually a function named `f' that
17251 takes one parameter (of type `int') and returns a value of type
17254 && cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
17256 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
17257 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
17258 /* A parameter declaration begins with a decl-specifier,
17259 which is either the "attribute" keyword, a storage class
17260 specifier, or (usually) a type-specifier. */
17261 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
17264 tree pushed_scope = NULL_TREE;
17265 unsigned saved_num_template_parameter_lists;
17267 /* Names appearing in the type-specifier should be looked up
17268 in the scope of the class. */
17269 if (current_class_type)
17273 type = TREE_TYPE (type_decl);
17274 if (TREE_CODE (type) == TYPENAME_TYPE)
17276 type = resolve_typename_type (type,
17277 /*only_current_p=*/false);
17278 if (TREE_CODE (type) == TYPENAME_TYPE)
17280 cp_parser_abort_tentative_parse (parser);
17284 pushed_scope = push_scope (type);
17287 /* Inside the constructor parameter list, surrounding
17288 template-parameter-lists do not apply. */
17289 saved_num_template_parameter_lists
17290 = parser->num_template_parameter_lists;
17291 parser->num_template_parameter_lists = 0;
17293 /* Look for the type-specifier. */
17294 cp_parser_type_specifier (parser,
17295 CP_PARSER_FLAGS_NONE,
17296 /*decl_specs=*/NULL,
17297 /*is_declarator=*/true,
17298 /*declares_class_or_enum=*/NULL,
17299 /*is_cv_qualifier=*/NULL);
17301 parser->num_template_parameter_lists
17302 = saved_num_template_parameter_lists;
17304 /* Leave the scope of the class. */
17306 pop_scope (pushed_scope);
17308 constructor_p = !cp_parser_error_occurred (parser);
17312 constructor_p = false;
17313 /* We did not really want to consume any tokens. */
17314 cp_parser_abort_tentative_parse (parser);
17316 return constructor_p;
17319 /* Parse the definition of the function given by the DECL_SPECIFIERS,
17320 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
17321 they must be performed once we are in the scope of the function.
17323 Returns the function defined. */
17326 cp_parser_function_definition_from_specifiers_and_declarator
17327 (cp_parser* parser,
17328 cp_decl_specifier_seq *decl_specifiers,
17330 const cp_declarator *declarator)
17335 /* Begin the function-definition. */
17336 success_p = start_function (decl_specifiers, declarator, attributes);
17338 /* The things we're about to see are not directly qualified by any
17339 template headers we've seen thus far. */
17340 reset_specialization ();
17342 /* If there were names looked up in the decl-specifier-seq that we
17343 did not check, check them now. We must wait until we are in the
17344 scope of the function to perform the checks, since the function
17345 might be a friend. */
17346 perform_deferred_access_checks ();
17350 /* Skip the entire function. */
17351 cp_parser_skip_to_end_of_block_or_statement (parser);
17352 fn = error_mark_node;
17354 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
17356 /* Seen already, skip it. An error message has already been output. */
17357 cp_parser_skip_to_end_of_block_or_statement (parser);
17358 fn = current_function_decl;
17359 current_function_decl = NULL_TREE;
17360 /* If this is a function from a class, pop the nested class. */
17361 if (current_class_name)
17362 pop_nested_class ();
17365 fn = cp_parser_function_definition_after_declarator (parser,
17366 /*inline_p=*/false);
17371 /* Parse the part of a function-definition that follows the
17372 declarator. INLINE_P is TRUE iff this function is an inline
17373 function defined with a class-specifier.
17375 Returns the function defined. */
17378 cp_parser_function_definition_after_declarator (cp_parser* parser,
17382 bool ctor_initializer_p = false;
17383 bool saved_in_unbraced_linkage_specification_p;
17384 bool saved_in_function_body;
17385 unsigned saved_num_template_parameter_lists;
17388 saved_in_function_body = parser->in_function_body;
17389 parser->in_function_body = true;
17390 /* If the next token is `return', then the code may be trying to
17391 make use of the "named return value" extension that G++ used to
17393 token = cp_lexer_peek_token (parser->lexer);
17394 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
17396 /* Consume the `return' keyword. */
17397 cp_lexer_consume_token (parser->lexer);
17398 /* Look for the identifier that indicates what value is to be
17400 cp_parser_identifier (parser);
17401 /* Issue an error message. */
17402 error ("%Hnamed return values are no longer supported",
17404 /* Skip tokens until we reach the start of the function body. */
17407 cp_token *token = cp_lexer_peek_token (parser->lexer);
17408 if (token->type == CPP_OPEN_BRACE
17409 || token->type == CPP_EOF
17410 || token->type == CPP_PRAGMA_EOL)
17412 cp_lexer_consume_token (parser->lexer);
17415 /* The `extern' in `extern "C" void f () { ... }' does not apply to
17416 anything declared inside `f'. */
17417 saved_in_unbraced_linkage_specification_p
17418 = parser->in_unbraced_linkage_specification_p;
17419 parser->in_unbraced_linkage_specification_p = false;
17420 /* Inside the function, surrounding template-parameter-lists do not
17422 saved_num_template_parameter_lists
17423 = parser->num_template_parameter_lists;
17424 parser->num_template_parameter_lists = 0;
17425 /* If the next token is `try', then we are looking at a
17426 function-try-block. */
17427 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
17428 ctor_initializer_p = cp_parser_function_try_block (parser);
17429 /* A function-try-block includes the function-body, so we only do
17430 this next part if we're not processing a function-try-block. */
17433 = cp_parser_ctor_initializer_opt_and_function_body (parser);
17435 /* Finish the function. */
17436 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
17437 (inline_p ? 2 : 0));
17438 /* Generate code for it, if necessary. */
17439 expand_or_defer_fn (fn);
17440 /* Restore the saved values. */
17441 parser->in_unbraced_linkage_specification_p
17442 = saved_in_unbraced_linkage_specification_p;
17443 parser->num_template_parameter_lists
17444 = saved_num_template_parameter_lists;
17445 parser->in_function_body = saved_in_function_body;
17450 /* Parse a template-declaration, assuming that the `export' (and
17451 `extern') keywords, if present, has already been scanned. MEMBER_P
17452 is as for cp_parser_template_declaration. */
17455 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
17457 tree decl = NULL_TREE;
17458 VEC (deferred_access_check,gc) *checks;
17459 tree parameter_list;
17460 bool friend_p = false;
17461 bool need_lang_pop;
17464 /* Look for the `template' keyword. */
17465 token = cp_lexer_peek_token (parser->lexer);
17466 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "%<template%>"))
17470 if (!cp_parser_require (parser, CPP_LESS, "%<<%>"))
17472 if (at_class_scope_p () && current_function_decl)
17474 /* 14.5.2.2 [temp.mem]
17476 A local class shall not have member templates. */
17477 error ("%Hinvalid declaration of member template in local class",
17479 cp_parser_skip_to_end_of_block_or_statement (parser);
17484 A template ... shall not have C linkage. */
17485 if (current_lang_name == lang_name_c)
17487 error ("%Htemplate with C linkage", &token->location);
17488 /* Give it C++ linkage to avoid confusing other parts of the
17490 push_lang_context (lang_name_cplusplus);
17491 need_lang_pop = true;
17494 need_lang_pop = false;
17496 /* We cannot perform access checks on the template parameter
17497 declarations until we know what is being declared, just as we
17498 cannot check the decl-specifier list. */
17499 push_deferring_access_checks (dk_deferred);
17501 /* If the next token is `>', then we have an invalid
17502 specialization. Rather than complain about an invalid template
17503 parameter, issue an error message here. */
17504 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
17506 cp_parser_error (parser, "invalid explicit specialization");
17507 begin_specialization ();
17508 parameter_list = NULL_TREE;
17511 /* Parse the template parameters. */
17512 parameter_list = cp_parser_template_parameter_list (parser);
17514 /* Get the deferred access checks from the parameter list. These
17515 will be checked once we know what is being declared, as for a
17516 member template the checks must be performed in the scope of the
17517 class containing the member. */
17518 checks = get_deferred_access_checks ();
17520 /* Look for the `>'. */
17521 cp_parser_skip_to_end_of_template_parameter_list (parser);
17522 /* We just processed one more parameter list. */
17523 ++parser->num_template_parameter_lists;
17524 /* If the next token is `template', there are more template
17526 if (cp_lexer_next_token_is_keyword (parser->lexer,
17528 cp_parser_template_declaration_after_export (parser, member_p);
17531 /* There are no access checks when parsing a template, as we do not
17532 know if a specialization will be a friend. */
17533 push_deferring_access_checks (dk_no_check);
17534 token = cp_lexer_peek_token (parser->lexer);
17535 decl = cp_parser_single_declaration (parser,
17538 /*explicit_specialization_p=*/false,
17540 pop_deferring_access_checks ();
17542 /* If this is a member template declaration, let the front
17544 if (member_p && !friend_p && decl)
17546 if (TREE_CODE (decl) == TYPE_DECL)
17547 cp_parser_check_access_in_redeclaration (decl, token->location);
17549 decl = finish_member_template_decl (decl);
17551 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
17552 make_friend_class (current_class_type, TREE_TYPE (decl),
17553 /*complain=*/true);
17555 /* We are done with the current parameter list. */
17556 --parser->num_template_parameter_lists;
17558 pop_deferring_access_checks ();
17561 finish_template_decl (parameter_list);
17563 /* Register member declarations. */
17564 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
17565 finish_member_declaration (decl);
17566 /* For the erroneous case of a template with C linkage, we pushed an
17567 implicit C++ linkage scope; exit that scope now. */
17569 pop_lang_context ();
17570 /* If DECL is a function template, we must return to parse it later.
17571 (Even though there is no definition, there might be default
17572 arguments that need handling.) */
17573 if (member_p && decl
17574 && (TREE_CODE (decl) == FUNCTION_DECL
17575 || DECL_FUNCTION_TEMPLATE_P (decl)))
17576 TREE_VALUE (parser->unparsed_functions_queues)
17577 = tree_cons (NULL_TREE, decl,
17578 TREE_VALUE (parser->unparsed_functions_queues));
17581 /* Perform the deferred access checks from a template-parameter-list.
17582 CHECKS is a TREE_LIST of access checks, as returned by
17583 get_deferred_access_checks. */
17586 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
17588 ++processing_template_parmlist;
17589 perform_access_checks (checks);
17590 --processing_template_parmlist;
17593 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
17594 `function-definition' sequence. MEMBER_P is true, this declaration
17595 appears in a class scope.
17597 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
17598 *FRIEND_P is set to TRUE iff the declaration is a friend. */
17601 cp_parser_single_declaration (cp_parser* parser,
17602 VEC (deferred_access_check,gc)* checks,
17604 bool explicit_specialization_p,
17607 int declares_class_or_enum;
17608 tree decl = NULL_TREE;
17609 cp_decl_specifier_seq decl_specifiers;
17610 bool function_definition_p = false;
17611 cp_token *decl_spec_token_start;
17613 /* This function is only used when processing a template
17615 gcc_assert (innermost_scope_kind () == sk_template_parms
17616 || innermost_scope_kind () == sk_template_spec);
17618 /* Defer access checks until we know what is being declared. */
17619 push_deferring_access_checks (dk_deferred);
17621 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
17623 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
17624 cp_parser_decl_specifier_seq (parser,
17625 CP_PARSER_FLAGS_OPTIONAL,
17627 &declares_class_or_enum);
17629 *friend_p = cp_parser_friend_p (&decl_specifiers);
17631 /* There are no template typedefs. */
17632 if (decl_specifiers.specs[(int) ds_typedef])
17634 error ("%Htemplate declaration of %qs",
17635 &decl_spec_token_start->location, "typedef");
17636 decl = error_mark_node;
17639 /* Gather up the access checks that occurred the
17640 decl-specifier-seq. */
17641 stop_deferring_access_checks ();
17643 /* Check for the declaration of a template class. */
17644 if (declares_class_or_enum)
17646 if (cp_parser_declares_only_class_p (parser))
17648 decl = shadow_tag (&decl_specifiers);
17653 friend template <typename T> struct A<T>::B;
17656 A<T>::B will be represented by a TYPENAME_TYPE, and
17657 therefore not recognized by shadow_tag. */
17658 if (friend_p && *friend_p
17660 && decl_specifiers.type
17661 && TYPE_P (decl_specifiers.type))
17662 decl = decl_specifiers.type;
17664 if (decl && decl != error_mark_node)
17665 decl = TYPE_NAME (decl);
17667 decl = error_mark_node;
17669 /* Perform access checks for template parameters. */
17670 cp_parser_perform_template_parameter_access_checks (checks);
17673 /* If it's not a template class, try for a template function. If
17674 the next token is a `;', then this declaration does not declare
17675 anything. But, if there were errors in the decl-specifiers, then
17676 the error might well have come from an attempted class-specifier.
17677 In that case, there's no need to warn about a missing declarator. */
17679 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
17680 || decl_specifiers.type != error_mark_node))
17682 decl = cp_parser_init_declarator (parser,
17685 /*function_definition_allowed_p=*/true,
17687 declares_class_or_enum,
17688 &function_definition_p);
17690 /* 7.1.1-1 [dcl.stc]
17692 A storage-class-specifier shall not be specified in an explicit
17693 specialization... */
17695 && explicit_specialization_p
17696 && decl_specifiers.storage_class != sc_none)
17698 error ("%Hexplicit template specialization cannot have a storage class",
17699 &decl_spec_token_start->location);
17700 decl = error_mark_node;
17704 pop_deferring_access_checks ();
17706 /* Clear any current qualification; whatever comes next is the start
17707 of something new. */
17708 parser->scope = NULL_TREE;
17709 parser->qualifying_scope = NULL_TREE;
17710 parser->object_scope = NULL_TREE;
17711 /* Look for a trailing `;' after the declaration. */
17712 if (!function_definition_p
17713 && (decl == error_mark_node
17714 || !cp_parser_require (parser, CPP_SEMICOLON, "%<;%>")))
17715 cp_parser_skip_to_end_of_block_or_statement (parser);
17720 /* Parse a cast-expression that is not the operand of a unary "&". */
17723 cp_parser_simple_cast_expression (cp_parser *parser)
17725 return cp_parser_cast_expression (parser, /*address_p=*/false,
17729 /* Parse a functional cast to TYPE. Returns an expression
17730 representing the cast. */
17733 cp_parser_functional_cast (cp_parser* parser, tree type)
17735 tree expression_list;
17739 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
17741 maybe_warn_cpp0x ("extended initializer lists");
17742 expression_list = cp_parser_braced_list (parser, &nonconst_p);
17743 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
17744 if (TREE_CODE (type) == TYPE_DECL)
17745 type = TREE_TYPE (type);
17746 return finish_compound_literal (type, expression_list);
17750 = cp_parser_parenthesized_expression_list (parser, false,
17752 /*allow_expansion_p=*/true,
17753 /*non_constant_p=*/NULL);
17755 cast = build_functional_cast (type, expression_list,
17756 tf_warning_or_error);
17757 /* [expr.const]/1: In an integral constant expression "only type
17758 conversions to integral or enumeration type can be used". */
17759 if (TREE_CODE (type) == TYPE_DECL)
17760 type = TREE_TYPE (type);
17761 if (cast != error_mark_node
17762 && !cast_valid_in_integral_constant_expression_p (type)
17763 && (cp_parser_non_integral_constant_expression
17764 (parser, "a call to a constructor")))
17765 return error_mark_node;
17769 /* Save the tokens that make up the body of a member function defined
17770 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
17771 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
17772 specifiers applied to the declaration. Returns the FUNCTION_DECL
17773 for the member function. */
17776 cp_parser_save_member_function_body (cp_parser* parser,
17777 cp_decl_specifier_seq *decl_specifiers,
17778 cp_declarator *declarator,
17785 /* Create the function-declaration. */
17786 fn = start_method (decl_specifiers, declarator, attributes);
17787 /* If something went badly wrong, bail out now. */
17788 if (fn == error_mark_node)
17790 /* If there's a function-body, skip it. */
17791 if (cp_parser_token_starts_function_definition_p
17792 (cp_lexer_peek_token (parser->lexer)))
17793 cp_parser_skip_to_end_of_block_or_statement (parser);
17794 return error_mark_node;
17797 /* Remember it, if there default args to post process. */
17798 cp_parser_save_default_args (parser, fn);
17800 /* Save away the tokens that make up the body of the
17802 first = parser->lexer->next_token;
17803 /* We can have braced-init-list mem-initializers before the fn body. */
17804 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
17806 cp_lexer_consume_token (parser->lexer);
17807 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
17808 && cp_lexer_next_token_is_not_keyword (parser->lexer, RID_TRY))
17810 /* cache_group will stop after an un-nested { } pair, too. */
17811 if (cp_parser_cache_group (parser, CPP_CLOSE_PAREN, /*depth=*/0))
17814 /* variadic mem-inits have ... after the ')'. */
17815 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
17816 cp_lexer_consume_token (parser->lexer);
17819 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
17820 /* Handle function try blocks. */
17821 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
17822 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
17823 last = parser->lexer->next_token;
17825 /* Save away the inline definition; we will process it when the
17826 class is complete. */
17827 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
17828 DECL_PENDING_INLINE_P (fn) = 1;
17830 /* We need to know that this was defined in the class, so that
17831 friend templates are handled correctly. */
17832 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
17834 /* We're done with the inline definition. */
17835 finish_method (fn);
17837 /* Add FN to the queue of functions to be parsed later. */
17838 TREE_VALUE (parser->unparsed_functions_queues)
17839 = tree_cons (NULL_TREE, fn,
17840 TREE_VALUE (parser->unparsed_functions_queues));
17845 /* Parse a template-argument-list, as well as the trailing ">" (but
17846 not the opening ">"). See cp_parser_template_argument_list for the
17850 cp_parser_enclosed_template_argument_list (cp_parser* parser)
17854 tree saved_qualifying_scope;
17855 tree saved_object_scope;
17856 bool saved_greater_than_is_operator_p;
17857 bool saved_skip_evaluation;
17861 When parsing a template-id, the first non-nested `>' is taken as
17862 the end of the template-argument-list rather than a greater-than
17864 saved_greater_than_is_operator_p
17865 = parser->greater_than_is_operator_p;
17866 parser->greater_than_is_operator_p = false;
17867 /* Parsing the argument list may modify SCOPE, so we save it
17869 saved_scope = parser->scope;
17870 saved_qualifying_scope = parser->qualifying_scope;
17871 saved_object_scope = parser->object_scope;
17872 /* We need to evaluate the template arguments, even though this
17873 template-id may be nested within a "sizeof". */
17874 saved_skip_evaluation = skip_evaluation;
17875 skip_evaluation = false;
17876 /* Parse the template-argument-list itself. */
17877 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER)
17878 || cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
17879 arguments = NULL_TREE;
17881 arguments = cp_parser_template_argument_list (parser);
17882 /* Look for the `>' that ends the template-argument-list. If we find
17883 a '>>' instead, it's probably just a typo. */
17884 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
17886 if (cxx_dialect != cxx98)
17888 /* In C++0x, a `>>' in a template argument list or cast
17889 expression is considered to be two separate `>'
17890 tokens. So, change the current token to a `>', but don't
17891 consume it: it will be consumed later when the outer
17892 template argument list (or cast expression) is parsed.
17893 Note that this replacement of `>' for `>>' is necessary
17894 even if we are parsing tentatively: in the tentative
17895 case, after calling
17896 cp_parser_enclosed_template_argument_list we will always
17897 throw away all of the template arguments and the first
17898 closing `>', either because the template argument list
17899 was erroneous or because we are replacing those tokens
17900 with a CPP_TEMPLATE_ID token. The second `>' (which will
17901 not have been thrown away) is needed either to close an
17902 outer template argument list or to complete a new-style
17904 cp_token *token = cp_lexer_peek_token (parser->lexer);
17905 token->type = CPP_GREATER;
17907 else if (!saved_greater_than_is_operator_p)
17909 /* If we're in a nested template argument list, the '>>' has
17910 to be a typo for '> >'. We emit the error message, but we
17911 continue parsing and we push a '>' as next token, so that
17912 the argument list will be parsed correctly. Note that the
17913 global source location is still on the token before the
17914 '>>', so we need to say explicitly where we want it. */
17915 cp_token *token = cp_lexer_peek_token (parser->lexer);
17916 error ("%H%<>>%> should be %<> >%> "
17917 "within a nested template argument list",
17920 token->type = CPP_GREATER;
17924 /* If this is not a nested template argument list, the '>>'
17925 is a typo for '>'. Emit an error message and continue.
17926 Same deal about the token location, but here we can get it
17927 right by consuming the '>>' before issuing the diagnostic. */
17928 cp_token *token = cp_lexer_consume_token (parser->lexer);
17929 error ("%Hspurious %<>>%>, use %<>%> to terminate "
17930 "a template argument list", &token->location);
17934 cp_parser_skip_to_end_of_template_parameter_list (parser);
17935 /* The `>' token might be a greater-than operator again now. */
17936 parser->greater_than_is_operator_p
17937 = saved_greater_than_is_operator_p;
17938 /* Restore the SAVED_SCOPE. */
17939 parser->scope = saved_scope;
17940 parser->qualifying_scope = saved_qualifying_scope;
17941 parser->object_scope = saved_object_scope;
17942 skip_evaluation = saved_skip_evaluation;
17947 /* MEMBER_FUNCTION is a member function, or a friend. If default
17948 arguments, or the body of the function have not yet been parsed,
17952 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
17954 /* If this member is a template, get the underlying
17956 if (DECL_FUNCTION_TEMPLATE_P (member_function))
17957 member_function = DECL_TEMPLATE_RESULT (member_function);
17959 /* There should not be any class definitions in progress at this
17960 point; the bodies of members are only parsed outside of all class
17962 gcc_assert (parser->num_classes_being_defined == 0);
17963 /* While we're parsing the member functions we might encounter more
17964 classes. We want to handle them right away, but we don't want
17965 them getting mixed up with functions that are currently in the
17967 parser->unparsed_functions_queues
17968 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
17970 /* Make sure that any template parameters are in scope. */
17971 maybe_begin_member_template_processing (member_function);
17973 /* If the body of the function has not yet been parsed, parse it
17975 if (DECL_PENDING_INLINE_P (member_function))
17977 tree function_scope;
17978 cp_token_cache *tokens;
17980 /* The function is no longer pending; we are processing it. */
17981 tokens = DECL_PENDING_INLINE_INFO (member_function);
17982 DECL_PENDING_INLINE_INFO (member_function) = NULL;
17983 DECL_PENDING_INLINE_P (member_function) = 0;
17985 /* If this is a local class, enter the scope of the containing
17987 function_scope = current_function_decl;
17988 if (function_scope)
17989 push_function_context ();
17991 /* Push the body of the function onto the lexer stack. */
17992 cp_parser_push_lexer_for_tokens (parser, tokens);
17994 /* Let the front end know that we going to be defining this
17996 start_preparsed_function (member_function, NULL_TREE,
17997 SF_PRE_PARSED | SF_INCLASS_INLINE);
17999 /* Don't do access checking if it is a templated function. */
18000 if (processing_template_decl)
18001 push_deferring_access_checks (dk_no_check);
18003 /* Now, parse the body of the function. */
18004 cp_parser_function_definition_after_declarator (parser,
18005 /*inline_p=*/true);
18007 if (processing_template_decl)
18008 pop_deferring_access_checks ();
18010 /* Leave the scope of the containing function. */
18011 if (function_scope)
18012 pop_function_context ();
18013 cp_parser_pop_lexer (parser);
18016 /* Remove any template parameters from the symbol table. */
18017 maybe_end_member_template_processing ();
18019 /* Restore the queue. */
18020 parser->unparsed_functions_queues
18021 = TREE_CHAIN (parser->unparsed_functions_queues);
18024 /* If DECL contains any default args, remember it on the unparsed
18025 functions queue. */
18028 cp_parser_save_default_args (cp_parser* parser, tree decl)
18032 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
18034 probe = TREE_CHAIN (probe))
18035 if (TREE_PURPOSE (probe))
18037 TREE_PURPOSE (parser->unparsed_functions_queues)
18038 = tree_cons (current_class_type, decl,
18039 TREE_PURPOSE (parser->unparsed_functions_queues));
18044 /* FN is a FUNCTION_DECL which may contains a parameter with an
18045 unparsed DEFAULT_ARG. Parse the default args now. This function
18046 assumes that the current scope is the scope in which the default
18047 argument should be processed. */
18050 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
18052 bool saved_local_variables_forbidden_p;
18055 /* While we're parsing the default args, we might (due to the
18056 statement expression extension) encounter more classes. We want
18057 to handle them right away, but we don't want them getting mixed
18058 up with default args that are currently in the queue. */
18059 parser->unparsed_functions_queues
18060 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
18062 /* Local variable names (and the `this' keyword) may not appear
18063 in a default argument. */
18064 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
18065 parser->local_variables_forbidden_p = true;
18067 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
18069 parm = TREE_CHAIN (parm))
18071 cp_token_cache *tokens;
18072 tree default_arg = TREE_PURPOSE (parm);
18074 VEC(tree,gc) *insts;
18081 if (TREE_CODE (default_arg) != DEFAULT_ARG)
18082 /* This can happen for a friend declaration for a function
18083 already declared with default arguments. */
18086 /* Push the saved tokens for the default argument onto the parser's
18088 tokens = DEFARG_TOKENS (default_arg);
18089 cp_parser_push_lexer_for_tokens (parser, tokens);
18091 /* Parse the assignment-expression. */
18092 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false);
18094 if (!processing_template_decl)
18095 parsed_arg = check_default_argument (TREE_VALUE (parm), parsed_arg);
18097 TREE_PURPOSE (parm) = parsed_arg;
18099 /* Update any instantiations we've already created. */
18100 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
18101 VEC_iterate (tree, insts, ix, copy); ix++)
18102 TREE_PURPOSE (copy) = parsed_arg;
18104 /* If the token stream has not been completely used up, then
18105 there was extra junk after the end of the default
18107 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
18108 cp_parser_error (parser, "expected %<,%>");
18110 /* Revert to the main lexer. */
18111 cp_parser_pop_lexer (parser);
18114 /* Make sure no default arg is missing. */
18115 check_default_args (fn);
18117 /* Restore the state of local_variables_forbidden_p. */
18118 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
18120 /* Restore the queue. */
18121 parser->unparsed_functions_queues
18122 = TREE_CHAIN (parser->unparsed_functions_queues);
18125 /* Parse the operand of `sizeof' (or a similar operator). Returns
18126 either a TYPE or an expression, depending on the form of the
18127 input. The KEYWORD indicates which kind of expression we have
18131 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
18133 tree expr = NULL_TREE;
18134 const char *saved_message;
18136 bool saved_integral_constant_expression_p;
18137 bool saved_non_integral_constant_expression_p;
18138 bool pack_expansion_p = false;
18140 /* Types cannot be defined in a `sizeof' expression. Save away the
18142 saved_message = parser->type_definition_forbidden_message;
18143 /* And create the new one. */
18144 tmp = concat ("types may not be defined in %<",
18145 IDENTIFIER_POINTER (ridpointers[keyword]),
18146 "%> expressions", NULL);
18147 parser->type_definition_forbidden_message = tmp;
18149 /* The restrictions on constant-expressions do not apply inside
18150 sizeof expressions. */
18151 saved_integral_constant_expression_p
18152 = parser->integral_constant_expression_p;
18153 saved_non_integral_constant_expression_p
18154 = parser->non_integral_constant_expression_p;
18155 parser->integral_constant_expression_p = false;
18157 /* If it's a `...', then we are computing the length of a parameter
18159 if (keyword == RID_SIZEOF
18160 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
18162 /* Consume the `...'. */
18163 cp_lexer_consume_token (parser->lexer);
18164 maybe_warn_variadic_templates ();
18166 /* Note that this is an expansion. */
18167 pack_expansion_p = true;
18170 /* Do not actually evaluate the expression. */
18172 /* If it's a `(', then we might be looking at the type-id
18174 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
18177 bool saved_in_type_id_in_expr_p;
18179 /* We can't be sure yet whether we're looking at a type-id or an
18181 cp_parser_parse_tentatively (parser);
18182 /* Consume the `('. */
18183 cp_lexer_consume_token (parser->lexer);
18184 /* Parse the type-id. */
18185 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
18186 parser->in_type_id_in_expr_p = true;
18187 type = cp_parser_type_id (parser);
18188 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
18189 /* Now, look for the trailing `)'. */
18190 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
18191 /* If all went well, then we're done. */
18192 if (cp_parser_parse_definitely (parser))
18194 cp_decl_specifier_seq decl_specs;
18196 /* Build a trivial decl-specifier-seq. */
18197 clear_decl_specs (&decl_specs);
18198 decl_specs.type = type;
18200 /* Call grokdeclarator to figure out what type this is. */
18201 expr = grokdeclarator (NULL,
18205 /*attrlist=*/NULL);
18209 /* If the type-id production did not work out, then we must be
18210 looking at the unary-expression production. */
18212 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
18215 if (pack_expansion_p)
18216 /* Build a pack expansion. */
18217 expr = make_pack_expansion (expr);
18219 /* Go back to evaluating expressions. */
18222 /* Free the message we created. */
18224 /* And restore the old one. */
18225 parser->type_definition_forbidden_message = saved_message;
18226 parser->integral_constant_expression_p
18227 = saved_integral_constant_expression_p;
18228 parser->non_integral_constant_expression_p
18229 = saved_non_integral_constant_expression_p;
18234 /* If the current declaration has no declarator, return true. */
18237 cp_parser_declares_only_class_p (cp_parser *parser)
18239 /* If the next token is a `;' or a `,' then there is no
18241 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
18242 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
18245 /* Update the DECL_SPECS to reflect the storage class indicated by
18249 cp_parser_set_storage_class (cp_parser *parser,
18250 cp_decl_specifier_seq *decl_specs,
18252 location_t location)
18254 cp_storage_class storage_class;
18256 if (parser->in_unbraced_linkage_specification_p)
18258 error ("%Hinvalid use of %qD in linkage specification",
18259 &location, ridpointers[keyword]);
18262 else if (decl_specs->storage_class != sc_none)
18264 decl_specs->conflicting_specifiers_p = true;
18268 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
18269 && decl_specs->specs[(int) ds_thread])
18271 error ("%H%<__thread%> before %qD", &location, ridpointers[keyword]);
18272 decl_specs->specs[(int) ds_thread] = 0;
18278 storage_class = sc_auto;
18281 storage_class = sc_register;
18284 storage_class = sc_static;
18287 storage_class = sc_extern;
18290 storage_class = sc_mutable;
18293 gcc_unreachable ();
18295 decl_specs->storage_class = storage_class;
18297 /* A storage class specifier cannot be applied alongside a typedef
18298 specifier. If there is a typedef specifier present then set
18299 conflicting_specifiers_p which will trigger an error later
18300 on in grokdeclarator. */
18301 if (decl_specs->specs[(int)ds_typedef])
18302 decl_specs->conflicting_specifiers_p = true;
18305 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
18306 is true, the type is a user-defined type; otherwise it is a
18307 built-in type specified by a keyword. */
18310 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
18312 location_t location,
18313 bool user_defined_p)
18315 decl_specs->any_specifiers_p = true;
18317 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
18318 (with, for example, in "typedef int wchar_t;") we remember that
18319 this is what happened. In system headers, we ignore these
18320 declarations so that G++ can work with system headers that are not
18322 if (decl_specs->specs[(int) ds_typedef]
18324 && (type_spec == boolean_type_node
18325 || type_spec == char16_type_node
18326 || type_spec == char32_type_node
18327 || type_spec == wchar_type_node)
18328 && (decl_specs->type
18329 || decl_specs->specs[(int) ds_long]
18330 || decl_specs->specs[(int) ds_short]
18331 || decl_specs->specs[(int) ds_unsigned]
18332 || decl_specs->specs[(int) ds_signed]))
18334 decl_specs->redefined_builtin_type = type_spec;
18335 if (!decl_specs->type)
18337 decl_specs->type = type_spec;
18338 decl_specs->user_defined_type_p = false;
18339 decl_specs->type_location = location;
18342 else if (decl_specs->type)
18343 decl_specs->multiple_types_p = true;
18346 decl_specs->type = type_spec;
18347 decl_specs->user_defined_type_p = user_defined_p;
18348 decl_specs->redefined_builtin_type = NULL_TREE;
18349 decl_specs->type_location = location;
18353 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
18354 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
18357 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
18359 return decl_specifiers->specs[(int) ds_friend] != 0;
18362 /* If the next token is of the indicated TYPE, consume it. Otherwise,
18363 issue an error message indicating that TOKEN_DESC was expected.
18365 Returns the token consumed, if the token had the appropriate type.
18366 Otherwise, returns NULL. */
18369 cp_parser_require (cp_parser* parser,
18370 enum cpp_ttype type,
18371 const char* token_desc)
18373 if (cp_lexer_next_token_is (parser->lexer, type))
18374 return cp_lexer_consume_token (parser->lexer);
18377 /* Output the MESSAGE -- unless we're parsing tentatively. */
18378 if (!cp_parser_simulate_error (parser))
18380 char *message = concat ("expected ", token_desc, NULL);
18381 cp_parser_error (parser, message);
18388 /* An error message is produced if the next token is not '>'.
18389 All further tokens are skipped until the desired token is
18390 found or '{', '}', ';' or an unbalanced ')' or ']'. */
18393 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
18395 /* Current level of '< ... >'. */
18396 unsigned level = 0;
18397 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
18398 unsigned nesting_depth = 0;
18400 /* Are we ready, yet? If not, issue error message. */
18401 if (cp_parser_require (parser, CPP_GREATER, "%<>%>"))
18404 /* Skip tokens until the desired token is found. */
18407 /* Peek at the next token. */
18408 switch (cp_lexer_peek_token (parser->lexer)->type)
18411 if (!nesting_depth)
18416 if (cxx_dialect == cxx98)
18417 /* C++0x views the `>>' operator as two `>' tokens, but
18420 else if (!nesting_depth && level-- == 0)
18422 /* We've hit a `>>' where the first `>' closes the
18423 template argument list, and the second `>' is
18424 spurious. Just consume the `>>' and stop; we've
18425 already produced at least one error. */
18426 cp_lexer_consume_token (parser->lexer);
18429 /* Fall through for C++0x, so we handle the second `>' in
18433 if (!nesting_depth && level-- == 0)
18435 /* We've reached the token we want, consume it and stop. */
18436 cp_lexer_consume_token (parser->lexer);
18441 case CPP_OPEN_PAREN:
18442 case CPP_OPEN_SQUARE:
18446 case CPP_CLOSE_PAREN:
18447 case CPP_CLOSE_SQUARE:
18448 if (nesting_depth-- == 0)
18453 case CPP_PRAGMA_EOL:
18454 case CPP_SEMICOLON:
18455 case CPP_OPEN_BRACE:
18456 case CPP_CLOSE_BRACE:
18457 /* The '>' was probably forgotten, don't look further. */
18464 /* Consume this token. */
18465 cp_lexer_consume_token (parser->lexer);
18469 /* If the next token is the indicated keyword, consume it. Otherwise,
18470 issue an error message indicating that TOKEN_DESC was expected.
18472 Returns the token consumed, if the token had the appropriate type.
18473 Otherwise, returns NULL. */
18476 cp_parser_require_keyword (cp_parser* parser,
18478 const char* token_desc)
18480 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
18482 if (token && token->keyword != keyword)
18484 dyn_string_t error_msg;
18486 /* Format the error message. */
18487 error_msg = dyn_string_new (0);
18488 dyn_string_append_cstr (error_msg, "expected ");
18489 dyn_string_append_cstr (error_msg, token_desc);
18490 cp_parser_error (parser, error_msg->s);
18491 dyn_string_delete (error_msg);
18498 /* Returns TRUE iff TOKEN is a token that can begin the body of a
18499 function-definition. */
18502 cp_parser_token_starts_function_definition_p (cp_token* token)
18504 return (/* An ordinary function-body begins with an `{'. */
18505 token->type == CPP_OPEN_BRACE
18506 /* A ctor-initializer begins with a `:'. */
18507 || token->type == CPP_COLON
18508 /* A function-try-block begins with `try'. */
18509 || token->keyword == RID_TRY
18510 /* The named return value extension begins with `return'. */
18511 || token->keyword == RID_RETURN);
18514 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
18518 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
18522 token = cp_lexer_peek_token (parser->lexer);
18523 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
18526 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
18527 C++0x) ending a template-argument. */
18530 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
18534 token = cp_lexer_peek_token (parser->lexer);
18535 return (token->type == CPP_COMMA
18536 || token->type == CPP_GREATER
18537 || token->type == CPP_ELLIPSIS
18538 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT));
18541 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
18542 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
18545 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
18550 token = cp_lexer_peek_nth_token (parser->lexer, n);
18551 if (token->type == CPP_LESS)
18553 /* Check for the sequence `<::' in the original code. It would be lexed as
18554 `[:', where `[' is a digraph, and there is no whitespace before
18556 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
18559 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
18560 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
18566 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
18567 or none_type otherwise. */
18569 static enum tag_types
18570 cp_parser_token_is_class_key (cp_token* token)
18572 switch (token->keyword)
18577 return record_type;
18586 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
18589 cp_parser_check_class_key (enum tag_types class_key, tree type)
18591 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
18592 permerror (input_location, "%qs tag used in naming %q#T",
18593 class_key == union_type ? "union"
18594 : class_key == record_type ? "struct" : "class",
18598 /* Issue an error message if DECL is redeclared with different
18599 access than its original declaration [class.access.spec/3].
18600 This applies to nested classes and nested class templates.
18604 cp_parser_check_access_in_redeclaration (tree decl, location_t location)
18606 if (!decl || !CLASS_TYPE_P (TREE_TYPE (decl)))
18609 if ((TREE_PRIVATE (decl)
18610 != (current_access_specifier == access_private_node))
18611 || (TREE_PROTECTED (decl)
18612 != (current_access_specifier == access_protected_node)))
18613 error ("%H%qD redeclared with different access", &location, decl);
18616 /* Look for the `template' keyword, as a syntactic disambiguator.
18617 Return TRUE iff it is present, in which case it will be
18621 cp_parser_optional_template_keyword (cp_parser *parser)
18623 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
18625 /* The `template' keyword can only be used within templates;
18626 outside templates the parser can always figure out what is a
18627 template and what is not. */
18628 if (!processing_template_decl)
18630 cp_token *token = cp_lexer_peek_token (parser->lexer);
18631 error ("%H%<template%> (as a disambiguator) is only allowed "
18632 "within templates", &token->location);
18633 /* If this part of the token stream is rescanned, the same
18634 error message would be generated. So, we purge the token
18635 from the stream. */
18636 cp_lexer_purge_token (parser->lexer);
18641 /* Consume the `template' keyword. */
18642 cp_lexer_consume_token (parser->lexer);
18650 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
18651 set PARSER->SCOPE, and perform other related actions. */
18654 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
18657 struct tree_check *check_value;
18658 deferred_access_check *chk;
18659 VEC (deferred_access_check,gc) *checks;
18661 /* Get the stored value. */
18662 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
18663 /* Perform any access checks that were deferred. */
18664 checks = check_value->checks;
18668 VEC_iterate (deferred_access_check, checks, i, chk) ;
18671 perform_or_defer_access_check (chk->binfo,
18676 /* Set the scope from the stored value. */
18677 parser->scope = check_value->value;
18678 parser->qualifying_scope = check_value->qualifying_scope;
18679 parser->object_scope = NULL_TREE;
18682 /* Consume tokens up through a non-nested END token. Returns TRUE if we
18683 encounter the end of a block before what we were looking for. */
18686 cp_parser_cache_group (cp_parser *parser,
18687 enum cpp_ttype end,
18692 cp_token *token = cp_lexer_peek_token (parser->lexer);
18694 /* Abort a parenthesized expression if we encounter a semicolon. */
18695 if ((end == CPP_CLOSE_PAREN || depth == 0)
18696 && token->type == CPP_SEMICOLON)
18698 /* If we've reached the end of the file, stop. */
18699 if (token->type == CPP_EOF
18700 || (end != CPP_PRAGMA_EOL
18701 && token->type == CPP_PRAGMA_EOL))
18703 if (token->type == CPP_CLOSE_BRACE && depth == 0)
18704 /* We've hit the end of an enclosing block, so there's been some
18705 kind of syntax error. */
18708 /* Consume the token. */
18709 cp_lexer_consume_token (parser->lexer);
18710 /* See if it starts a new group. */
18711 if (token->type == CPP_OPEN_BRACE)
18713 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
18714 /* In theory this should probably check end == '}', but
18715 cp_parser_save_member_function_body needs it to exit
18716 after either '}' or ')' when called with ')'. */
18720 else if (token->type == CPP_OPEN_PAREN)
18722 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
18723 if (depth == 0 && end == CPP_CLOSE_PAREN)
18726 else if (token->type == CPP_PRAGMA)
18727 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
18728 else if (token->type == end)
18733 /* Begin parsing tentatively. We always save tokens while parsing
18734 tentatively so that if the tentative parsing fails we can restore the
18738 cp_parser_parse_tentatively (cp_parser* parser)
18740 /* Enter a new parsing context. */
18741 parser->context = cp_parser_context_new (parser->context);
18742 /* Begin saving tokens. */
18743 cp_lexer_save_tokens (parser->lexer);
18744 /* In order to avoid repetitive access control error messages,
18745 access checks are queued up until we are no longer parsing
18747 push_deferring_access_checks (dk_deferred);
18750 /* Commit to the currently active tentative parse. */
18753 cp_parser_commit_to_tentative_parse (cp_parser* parser)
18755 cp_parser_context *context;
18758 /* Mark all of the levels as committed. */
18759 lexer = parser->lexer;
18760 for (context = parser->context; context->next; context = context->next)
18762 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
18764 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
18765 while (!cp_lexer_saving_tokens (lexer))
18766 lexer = lexer->next;
18767 cp_lexer_commit_tokens (lexer);
18771 /* Abort the currently active tentative parse. All consumed tokens
18772 will be rolled back, and no diagnostics will be issued. */
18775 cp_parser_abort_tentative_parse (cp_parser* parser)
18777 cp_parser_simulate_error (parser);
18778 /* Now, pretend that we want to see if the construct was
18779 successfully parsed. */
18780 cp_parser_parse_definitely (parser);
18783 /* Stop parsing tentatively. If a parse error has occurred, restore the
18784 token stream. Otherwise, commit to the tokens we have consumed.
18785 Returns true if no error occurred; false otherwise. */
18788 cp_parser_parse_definitely (cp_parser* parser)
18790 bool error_occurred;
18791 cp_parser_context *context;
18793 /* Remember whether or not an error occurred, since we are about to
18794 destroy that information. */
18795 error_occurred = cp_parser_error_occurred (parser);
18796 /* Remove the topmost context from the stack. */
18797 context = parser->context;
18798 parser->context = context->next;
18799 /* If no parse errors occurred, commit to the tentative parse. */
18800 if (!error_occurred)
18802 /* Commit to the tokens read tentatively, unless that was
18804 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
18805 cp_lexer_commit_tokens (parser->lexer);
18807 pop_to_parent_deferring_access_checks ();
18809 /* Otherwise, if errors occurred, roll back our state so that things
18810 are just as they were before we began the tentative parse. */
18813 cp_lexer_rollback_tokens (parser->lexer);
18814 pop_deferring_access_checks ();
18816 /* Add the context to the front of the free list. */
18817 context->next = cp_parser_context_free_list;
18818 cp_parser_context_free_list = context;
18820 return !error_occurred;
18823 /* Returns true if we are parsing tentatively and are not committed to
18824 this tentative parse. */
18827 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
18829 return (cp_parser_parsing_tentatively (parser)
18830 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
18833 /* Returns nonzero iff an error has occurred during the most recent
18834 tentative parse. */
18837 cp_parser_error_occurred (cp_parser* parser)
18839 return (cp_parser_parsing_tentatively (parser)
18840 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
18843 /* Returns nonzero if GNU extensions are allowed. */
18846 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
18848 return parser->allow_gnu_extensions_p;
18851 /* Objective-C++ Productions */
18854 /* Parse an Objective-C expression, which feeds into a primary-expression
18858 objc-message-expression
18859 objc-string-literal
18860 objc-encode-expression
18861 objc-protocol-expression
18862 objc-selector-expression
18864 Returns a tree representation of the expression. */
18867 cp_parser_objc_expression (cp_parser* parser)
18869 /* Try to figure out what kind of declaration is present. */
18870 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
18874 case CPP_OPEN_SQUARE:
18875 return cp_parser_objc_message_expression (parser);
18877 case CPP_OBJC_STRING:
18878 kwd = cp_lexer_consume_token (parser->lexer);
18879 return objc_build_string_object (kwd->u.value);
18882 switch (kwd->keyword)
18884 case RID_AT_ENCODE:
18885 return cp_parser_objc_encode_expression (parser);
18887 case RID_AT_PROTOCOL:
18888 return cp_parser_objc_protocol_expression (parser);
18890 case RID_AT_SELECTOR:
18891 return cp_parser_objc_selector_expression (parser);
18897 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
18898 &kwd->location, kwd->u.value);
18899 cp_parser_skip_to_end_of_block_or_statement (parser);
18902 return error_mark_node;
18905 /* Parse an Objective-C message expression.
18907 objc-message-expression:
18908 [ objc-message-receiver objc-message-args ]
18910 Returns a representation of an Objective-C message. */
18913 cp_parser_objc_message_expression (cp_parser* parser)
18915 tree receiver, messageargs;
18917 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
18918 receiver = cp_parser_objc_message_receiver (parser);
18919 messageargs = cp_parser_objc_message_args (parser);
18920 cp_parser_require (parser, CPP_CLOSE_SQUARE, "%<]%>");
18922 return objc_build_message_expr (build_tree_list (receiver, messageargs));
18925 /* Parse an objc-message-receiver.
18927 objc-message-receiver:
18929 simple-type-specifier
18931 Returns a representation of the type or expression. */
18934 cp_parser_objc_message_receiver (cp_parser* parser)
18938 /* An Objective-C message receiver may be either (1) a type
18939 or (2) an expression. */
18940 cp_parser_parse_tentatively (parser);
18941 rcv = cp_parser_expression (parser, false);
18943 if (cp_parser_parse_definitely (parser))
18946 rcv = cp_parser_simple_type_specifier (parser,
18947 /*decl_specs=*/NULL,
18948 CP_PARSER_FLAGS_NONE);
18950 return objc_get_class_reference (rcv);
18953 /* Parse the arguments and selectors comprising an Objective-C message.
18958 objc-selector-args , objc-comma-args
18960 objc-selector-args:
18961 objc-selector [opt] : assignment-expression
18962 objc-selector-args objc-selector [opt] : assignment-expression
18965 assignment-expression
18966 objc-comma-args , assignment-expression
18968 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
18969 selector arguments and TREE_VALUE containing a list of comma
18973 cp_parser_objc_message_args (cp_parser* parser)
18975 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
18976 bool maybe_unary_selector_p = true;
18977 cp_token *token = cp_lexer_peek_token (parser->lexer);
18979 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
18981 tree selector = NULL_TREE, arg;
18983 if (token->type != CPP_COLON)
18984 selector = cp_parser_objc_selector (parser);
18986 /* Detect if we have a unary selector. */
18987 if (maybe_unary_selector_p
18988 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
18989 return build_tree_list (selector, NULL_TREE);
18991 maybe_unary_selector_p = false;
18992 cp_parser_require (parser, CPP_COLON, "%<:%>");
18993 arg = cp_parser_assignment_expression (parser, false);
18996 = chainon (sel_args,
18997 build_tree_list (selector, arg));
18999 token = cp_lexer_peek_token (parser->lexer);
19002 /* Handle non-selector arguments, if any. */
19003 while (token->type == CPP_COMMA)
19007 cp_lexer_consume_token (parser->lexer);
19008 arg = cp_parser_assignment_expression (parser, false);
19011 = chainon (addl_args,
19012 build_tree_list (NULL_TREE, arg));
19014 token = cp_lexer_peek_token (parser->lexer);
19017 return build_tree_list (sel_args, addl_args);
19020 /* Parse an Objective-C encode expression.
19022 objc-encode-expression:
19023 @encode objc-typename
19025 Returns an encoded representation of the type argument. */
19028 cp_parser_objc_encode_expression (cp_parser* parser)
19033 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
19034 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19035 token = cp_lexer_peek_token (parser->lexer);
19036 type = complete_type (cp_parser_type_id (parser));
19037 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19041 error ("%H%<@encode%> must specify a type as an argument",
19043 return error_mark_node;
19046 return objc_build_encode_expr (type);
19049 /* Parse an Objective-C @defs expression. */
19052 cp_parser_objc_defs_expression (cp_parser *parser)
19056 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
19057 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19058 name = cp_parser_identifier (parser);
19059 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19061 return objc_get_class_ivars (name);
19064 /* Parse an Objective-C protocol expression.
19066 objc-protocol-expression:
19067 @protocol ( identifier )
19069 Returns a representation of the protocol expression. */
19072 cp_parser_objc_protocol_expression (cp_parser* parser)
19076 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
19077 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19078 proto = cp_parser_identifier (parser);
19079 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19081 return objc_build_protocol_expr (proto);
19084 /* Parse an Objective-C selector expression.
19086 objc-selector-expression:
19087 @selector ( objc-method-signature )
19089 objc-method-signature:
19095 objc-selector-seq objc-selector :
19097 Returns a representation of the method selector. */
19100 cp_parser_objc_selector_expression (cp_parser* parser)
19102 tree sel_seq = NULL_TREE;
19103 bool maybe_unary_selector_p = true;
19106 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
19107 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19108 token = cp_lexer_peek_token (parser->lexer);
19110 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
19111 || token->type == CPP_SCOPE)
19113 tree selector = NULL_TREE;
19115 if (token->type != CPP_COLON
19116 || token->type == CPP_SCOPE)
19117 selector = cp_parser_objc_selector (parser);
19119 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
19120 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
19122 /* Detect if we have a unary selector. */
19123 if (maybe_unary_selector_p)
19125 sel_seq = selector;
19126 goto finish_selector;
19130 cp_parser_error (parser, "expected %<:%>");
19133 maybe_unary_selector_p = false;
19134 token = cp_lexer_consume_token (parser->lexer);
19136 if (token->type == CPP_SCOPE)
19139 = chainon (sel_seq,
19140 build_tree_list (selector, NULL_TREE));
19142 = chainon (sel_seq,
19143 build_tree_list (NULL_TREE, NULL_TREE));
19147 = chainon (sel_seq,
19148 build_tree_list (selector, NULL_TREE));
19150 token = cp_lexer_peek_token (parser->lexer);
19154 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19156 return objc_build_selector_expr (sel_seq);
19159 /* Parse a list of identifiers.
19161 objc-identifier-list:
19163 objc-identifier-list , identifier
19165 Returns a TREE_LIST of identifier nodes. */
19168 cp_parser_objc_identifier_list (cp_parser* parser)
19170 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
19171 cp_token *sep = cp_lexer_peek_token (parser->lexer);
19173 while (sep->type == CPP_COMMA)
19175 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
19176 list = chainon (list,
19177 build_tree_list (NULL_TREE,
19178 cp_parser_identifier (parser)));
19179 sep = cp_lexer_peek_token (parser->lexer);
19185 /* Parse an Objective-C alias declaration.
19187 objc-alias-declaration:
19188 @compatibility_alias identifier identifier ;
19190 This function registers the alias mapping with the Objective-C front end.
19191 It returns nothing. */
19194 cp_parser_objc_alias_declaration (cp_parser* parser)
19198 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
19199 alias = cp_parser_identifier (parser);
19200 orig = cp_parser_identifier (parser);
19201 objc_declare_alias (alias, orig);
19202 cp_parser_consume_semicolon_at_end_of_statement (parser);
19205 /* Parse an Objective-C class forward-declaration.
19207 objc-class-declaration:
19208 @class objc-identifier-list ;
19210 The function registers the forward declarations with the Objective-C
19211 front end. It returns nothing. */
19214 cp_parser_objc_class_declaration (cp_parser* parser)
19216 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
19217 objc_declare_class (cp_parser_objc_identifier_list (parser));
19218 cp_parser_consume_semicolon_at_end_of_statement (parser);
19221 /* Parse a list of Objective-C protocol references.
19223 objc-protocol-refs-opt:
19224 objc-protocol-refs [opt]
19226 objc-protocol-refs:
19227 < objc-identifier-list >
19229 Returns a TREE_LIST of identifiers, if any. */
19232 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
19234 tree protorefs = NULL_TREE;
19236 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
19238 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
19239 protorefs = cp_parser_objc_identifier_list (parser);
19240 cp_parser_require (parser, CPP_GREATER, "%<>%>");
19246 /* Parse a Objective-C visibility specification. */
19249 cp_parser_objc_visibility_spec (cp_parser* parser)
19251 cp_token *vis = cp_lexer_peek_token (parser->lexer);
19253 switch (vis->keyword)
19255 case RID_AT_PRIVATE:
19256 objc_set_visibility (2);
19258 case RID_AT_PROTECTED:
19259 objc_set_visibility (0);
19261 case RID_AT_PUBLIC:
19262 objc_set_visibility (1);
19268 /* Eat '@private'/'@protected'/'@public'. */
19269 cp_lexer_consume_token (parser->lexer);
19272 /* Parse an Objective-C method type. */
19275 cp_parser_objc_method_type (cp_parser* parser)
19277 objc_set_method_type
19278 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
19283 /* Parse an Objective-C protocol qualifier. */
19286 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
19288 tree quals = NULL_TREE, node;
19289 cp_token *token = cp_lexer_peek_token (parser->lexer);
19291 node = token->u.value;
19293 while (node && TREE_CODE (node) == IDENTIFIER_NODE
19294 && (node == ridpointers [(int) RID_IN]
19295 || node == ridpointers [(int) RID_OUT]
19296 || node == ridpointers [(int) RID_INOUT]
19297 || node == ridpointers [(int) RID_BYCOPY]
19298 || node == ridpointers [(int) RID_BYREF]
19299 || node == ridpointers [(int) RID_ONEWAY]))
19301 quals = tree_cons (NULL_TREE, node, quals);
19302 cp_lexer_consume_token (parser->lexer);
19303 token = cp_lexer_peek_token (parser->lexer);
19304 node = token->u.value;
19310 /* Parse an Objective-C typename. */
19313 cp_parser_objc_typename (cp_parser* parser)
19315 tree type_name = NULL_TREE;
19317 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
19319 tree proto_quals, cp_type = NULL_TREE;
19321 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
19322 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
19324 /* An ObjC type name may consist of just protocol qualifiers, in which
19325 case the type shall default to 'id'. */
19326 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
19327 cp_type = cp_parser_type_id (parser);
19329 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19330 type_name = build_tree_list (proto_quals, cp_type);
19336 /* Check to see if TYPE refers to an Objective-C selector name. */
19339 cp_parser_objc_selector_p (enum cpp_ttype type)
19341 return (type == CPP_NAME || type == CPP_KEYWORD
19342 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
19343 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
19344 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
19345 || type == CPP_XOR || type == CPP_XOR_EQ);
19348 /* Parse an Objective-C selector. */
19351 cp_parser_objc_selector (cp_parser* parser)
19353 cp_token *token = cp_lexer_consume_token (parser->lexer);
19355 if (!cp_parser_objc_selector_p (token->type))
19357 error ("%Hinvalid Objective-C++ selector name", &token->location);
19358 return error_mark_node;
19361 /* C++ operator names are allowed to appear in ObjC selectors. */
19362 switch (token->type)
19364 case CPP_AND_AND: return get_identifier ("and");
19365 case CPP_AND_EQ: return get_identifier ("and_eq");
19366 case CPP_AND: return get_identifier ("bitand");
19367 case CPP_OR: return get_identifier ("bitor");
19368 case CPP_COMPL: return get_identifier ("compl");
19369 case CPP_NOT: return get_identifier ("not");
19370 case CPP_NOT_EQ: return get_identifier ("not_eq");
19371 case CPP_OR_OR: return get_identifier ("or");
19372 case CPP_OR_EQ: return get_identifier ("or_eq");
19373 case CPP_XOR: return get_identifier ("xor");
19374 case CPP_XOR_EQ: return get_identifier ("xor_eq");
19375 default: return token->u.value;
19379 /* Parse an Objective-C params list. */
19382 cp_parser_objc_method_keyword_params (cp_parser* parser)
19384 tree params = NULL_TREE;
19385 bool maybe_unary_selector_p = true;
19386 cp_token *token = cp_lexer_peek_token (parser->lexer);
19388 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
19390 tree selector = NULL_TREE, type_name, identifier;
19392 if (token->type != CPP_COLON)
19393 selector = cp_parser_objc_selector (parser);
19395 /* Detect if we have a unary selector. */
19396 if (maybe_unary_selector_p
19397 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
19400 maybe_unary_selector_p = false;
19401 cp_parser_require (parser, CPP_COLON, "%<:%>");
19402 type_name = cp_parser_objc_typename (parser);
19403 identifier = cp_parser_identifier (parser);
19407 objc_build_keyword_decl (selector,
19411 token = cp_lexer_peek_token (parser->lexer);
19417 /* Parse the non-keyword Objective-C params. */
19420 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
19422 tree params = make_node (TREE_LIST);
19423 cp_token *token = cp_lexer_peek_token (parser->lexer);
19424 *ellipsisp = false; /* Initially, assume no ellipsis. */
19426 while (token->type == CPP_COMMA)
19428 cp_parameter_declarator *parmdecl;
19431 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
19432 token = cp_lexer_peek_token (parser->lexer);
19434 if (token->type == CPP_ELLIPSIS)
19436 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
19441 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
19442 parm = grokdeclarator (parmdecl->declarator,
19443 &parmdecl->decl_specifiers,
19444 PARM, /*initialized=*/0,
19445 /*attrlist=*/NULL);
19447 chainon (params, build_tree_list (NULL_TREE, parm));
19448 token = cp_lexer_peek_token (parser->lexer);
19454 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
19457 cp_parser_objc_interstitial_code (cp_parser* parser)
19459 cp_token *token = cp_lexer_peek_token (parser->lexer);
19461 /* If the next token is `extern' and the following token is a string
19462 literal, then we have a linkage specification. */
19463 if (token->keyword == RID_EXTERN
19464 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
19465 cp_parser_linkage_specification (parser);
19466 /* Handle #pragma, if any. */
19467 else if (token->type == CPP_PRAGMA)
19468 cp_parser_pragma (parser, pragma_external);
19469 /* Allow stray semicolons. */
19470 else if (token->type == CPP_SEMICOLON)
19471 cp_lexer_consume_token (parser->lexer);
19472 /* Finally, try to parse a block-declaration, or a function-definition. */
19474 cp_parser_block_declaration (parser, /*statement_p=*/false);
19477 /* Parse a method signature. */
19480 cp_parser_objc_method_signature (cp_parser* parser)
19482 tree rettype, kwdparms, optparms;
19483 bool ellipsis = false;
19485 cp_parser_objc_method_type (parser);
19486 rettype = cp_parser_objc_typename (parser);
19487 kwdparms = cp_parser_objc_method_keyword_params (parser);
19488 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
19490 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
19493 /* Pars an Objective-C method prototype list. */
19496 cp_parser_objc_method_prototype_list (cp_parser* parser)
19498 cp_token *token = cp_lexer_peek_token (parser->lexer);
19500 while (token->keyword != RID_AT_END)
19502 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
19504 objc_add_method_declaration
19505 (cp_parser_objc_method_signature (parser));
19506 cp_parser_consume_semicolon_at_end_of_statement (parser);
19509 /* Allow for interspersed non-ObjC++ code. */
19510 cp_parser_objc_interstitial_code (parser);
19512 token = cp_lexer_peek_token (parser->lexer);
19515 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
19516 objc_finish_interface ();
19519 /* Parse an Objective-C method definition list. */
19522 cp_parser_objc_method_definition_list (cp_parser* parser)
19524 cp_token *token = cp_lexer_peek_token (parser->lexer);
19526 while (token->keyword != RID_AT_END)
19530 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
19532 push_deferring_access_checks (dk_deferred);
19533 objc_start_method_definition
19534 (cp_parser_objc_method_signature (parser));
19536 /* For historical reasons, we accept an optional semicolon. */
19537 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
19538 cp_lexer_consume_token (parser->lexer);
19540 perform_deferred_access_checks ();
19541 stop_deferring_access_checks ();
19542 meth = cp_parser_function_definition_after_declarator (parser,
19544 pop_deferring_access_checks ();
19545 objc_finish_method_definition (meth);
19548 /* Allow for interspersed non-ObjC++ code. */
19549 cp_parser_objc_interstitial_code (parser);
19551 token = cp_lexer_peek_token (parser->lexer);
19554 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
19555 objc_finish_implementation ();
19558 /* Parse Objective-C ivars. */
19561 cp_parser_objc_class_ivars (cp_parser* parser)
19563 cp_token *token = cp_lexer_peek_token (parser->lexer);
19565 if (token->type != CPP_OPEN_BRACE)
19566 return; /* No ivars specified. */
19568 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
19569 token = cp_lexer_peek_token (parser->lexer);
19571 while (token->type != CPP_CLOSE_BRACE)
19573 cp_decl_specifier_seq declspecs;
19574 int decl_class_or_enum_p;
19575 tree prefix_attributes;
19577 cp_parser_objc_visibility_spec (parser);
19579 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
19582 cp_parser_decl_specifier_seq (parser,
19583 CP_PARSER_FLAGS_OPTIONAL,
19585 &decl_class_or_enum_p);
19586 prefix_attributes = declspecs.attributes;
19587 declspecs.attributes = NULL_TREE;
19589 /* Keep going until we hit the `;' at the end of the
19591 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
19593 tree width = NULL_TREE, attributes, first_attribute, decl;
19594 cp_declarator *declarator = NULL;
19595 int ctor_dtor_or_conv_p;
19597 /* Check for a (possibly unnamed) bitfield declaration. */
19598 token = cp_lexer_peek_token (parser->lexer);
19599 if (token->type == CPP_COLON)
19602 if (token->type == CPP_NAME
19603 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
19606 /* Get the name of the bitfield. */
19607 declarator = make_id_declarator (NULL_TREE,
19608 cp_parser_identifier (parser),
19612 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
19613 /* Get the width of the bitfield. */
19615 = cp_parser_constant_expression (parser,
19616 /*allow_non_constant=*/false,
19621 /* Parse the declarator. */
19623 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
19624 &ctor_dtor_or_conv_p,
19625 /*parenthesized_p=*/NULL,
19626 /*member_p=*/false);
19629 /* Look for attributes that apply to the ivar. */
19630 attributes = cp_parser_attributes_opt (parser);
19631 /* Remember which attributes are prefix attributes and
19633 first_attribute = attributes;
19634 /* Combine the attributes. */
19635 attributes = chainon (prefix_attributes, attributes);
19638 /* Create the bitfield declaration. */
19639 decl = grokbitfield (declarator, &declspecs,
19643 decl = grokfield (declarator, &declspecs,
19644 NULL_TREE, /*init_const_expr_p=*/false,
19645 NULL_TREE, attributes);
19647 /* Add the instance variable. */
19648 objc_add_instance_variable (decl);
19650 /* Reset PREFIX_ATTRIBUTES. */
19651 while (attributes && TREE_CHAIN (attributes) != first_attribute)
19652 attributes = TREE_CHAIN (attributes);
19654 TREE_CHAIN (attributes) = NULL_TREE;
19656 token = cp_lexer_peek_token (parser->lexer);
19658 if (token->type == CPP_COMMA)
19660 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
19666 cp_parser_consume_semicolon_at_end_of_statement (parser);
19667 token = cp_lexer_peek_token (parser->lexer);
19670 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
19671 /* For historical reasons, we accept an optional semicolon. */
19672 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
19673 cp_lexer_consume_token (parser->lexer);
19676 /* Parse an Objective-C protocol declaration. */
19679 cp_parser_objc_protocol_declaration (cp_parser* parser)
19681 tree proto, protorefs;
19684 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
19685 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
19687 tok = cp_lexer_peek_token (parser->lexer);
19688 error ("%Hidentifier expected after %<@protocol%>", &tok->location);
19692 /* See if we have a forward declaration or a definition. */
19693 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
19695 /* Try a forward declaration first. */
19696 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
19698 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
19700 cp_parser_consume_semicolon_at_end_of_statement (parser);
19703 /* Ok, we got a full-fledged definition (or at least should). */
19706 proto = cp_parser_identifier (parser);
19707 protorefs = cp_parser_objc_protocol_refs_opt (parser);
19708 objc_start_protocol (proto, protorefs);
19709 cp_parser_objc_method_prototype_list (parser);
19713 /* Parse an Objective-C superclass or category. */
19716 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
19719 cp_token *next = cp_lexer_peek_token (parser->lexer);
19721 *super = *categ = NULL_TREE;
19722 if (next->type == CPP_COLON)
19724 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
19725 *super = cp_parser_identifier (parser);
19727 else if (next->type == CPP_OPEN_PAREN)
19729 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
19730 *categ = cp_parser_identifier (parser);
19731 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19735 /* Parse an Objective-C class interface. */
19738 cp_parser_objc_class_interface (cp_parser* parser)
19740 tree name, super, categ, protos;
19742 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
19743 name = cp_parser_identifier (parser);
19744 cp_parser_objc_superclass_or_category (parser, &super, &categ);
19745 protos = cp_parser_objc_protocol_refs_opt (parser);
19747 /* We have either a class or a category on our hands. */
19749 objc_start_category_interface (name, categ, protos);
19752 objc_start_class_interface (name, super, protos);
19753 /* Handle instance variable declarations, if any. */
19754 cp_parser_objc_class_ivars (parser);
19755 objc_continue_interface ();
19758 cp_parser_objc_method_prototype_list (parser);
19761 /* Parse an Objective-C class implementation. */
19764 cp_parser_objc_class_implementation (cp_parser* parser)
19766 tree name, super, categ;
19768 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
19769 name = cp_parser_identifier (parser);
19770 cp_parser_objc_superclass_or_category (parser, &super, &categ);
19772 /* We have either a class or a category on our hands. */
19774 objc_start_category_implementation (name, categ);
19777 objc_start_class_implementation (name, super);
19778 /* Handle instance variable declarations, if any. */
19779 cp_parser_objc_class_ivars (parser);
19780 objc_continue_implementation ();
19783 cp_parser_objc_method_definition_list (parser);
19786 /* Consume the @end token and finish off the implementation. */
19789 cp_parser_objc_end_implementation (cp_parser* parser)
19791 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
19792 objc_finish_implementation ();
19795 /* Parse an Objective-C declaration. */
19798 cp_parser_objc_declaration (cp_parser* parser)
19800 /* Try to figure out what kind of declaration is present. */
19801 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
19803 switch (kwd->keyword)
19806 cp_parser_objc_alias_declaration (parser);
19809 cp_parser_objc_class_declaration (parser);
19811 case RID_AT_PROTOCOL:
19812 cp_parser_objc_protocol_declaration (parser);
19814 case RID_AT_INTERFACE:
19815 cp_parser_objc_class_interface (parser);
19817 case RID_AT_IMPLEMENTATION:
19818 cp_parser_objc_class_implementation (parser);
19821 cp_parser_objc_end_implementation (parser);
19824 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
19825 &kwd->location, kwd->u.value);
19826 cp_parser_skip_to_end_of_block_or_statement (parser);
19830 /* Parse an Objective-C try-catch-finally statement.
19832 objc-try-catch-finally-stmt:
19833 @try compound-statement objc-catch-clause-seq [opt]
19834 objc-finally-clause [opt]
19836 objc-catch-clause-seq:
19837 objc-catch-clause objc-catch-clause-seq [opt]
19840 @catch ( exception-declaration ) compound-statement
19842 objc-finally-clause
19843 @finally compound-statement
19845 Returns NULL_TREE. */
19848 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
19849 location_t location;
19852 cp_parser_require_keyword (parser, RID_AT_TRY, "%<@try%>");
19853 location = cp_lexer_peek_token (parser->lexer)->location;
19854 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
19855 node, lest it get absorbed into the surrounding block. */
19856 stmt = push_stmt_list ();
19857 cp_parser_compound_statement (parser, NULL, false);
19858 objc_begin_try_stmt (location, pop_stmt_list (stmt));
19860 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
19862 cp_parameter_declarator *parmdecl;
19865 cp_lexer_consume_token (parser->lexer);
19866 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19867 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
19868 parm = grokdeclarator (parmdecl->declarator,
19869 &parmdecl->decl_specifiers,
19870 PARM, /*initialized=*/0,
19871 /*attrlist=*/NULL);
19872 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19873 objc_begin_catch_clause (parm);
19874 cp_parser_compound_statement (parser, NULL, false);
19875 objc_finish_catch_clause ();
19878 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
19880 cp_lexer_consume_token (parser->lexer);
19881 location = cp_lexer_peek_token (parser->lexer)->location;
19882 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
19883 node, lest it get absorbed into the surrounding block. */
19884 stmt = push_stmt_list ();
19885 cp_parser_compound_statement (parser, NULL, false);
19886 objc_build_finally_clause (location, pop_stmt_list (stmt));
19889 return objc_finish_try_stmt ();
19892 /* Parse an Objective-C synchronized statement.
19894 objc-synchronized-stmt:
19895 @synchronized ( expression ) compound-statement
19897 Returns NULL_TREE. */
19900 cp_parser_objc_synchronized_statement (cp_parser *parser) {
19901 location_t location;
19904 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "%<@synchronized%>");
19906 location = cp_lexer_peek_token (parser->lexer)->location;
19907 cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>");
19908 lock = cp_parser_expression (parser, false);
19909 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
19911 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
19912 node, lest it get absorbed into the surrounding block. */
19913 stmt = push_stmt_list ();
19914 cp_parser_compound_statement (parser, NULL, false);
19916 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
19919 /* Parse an Objective-C throw statement.
19922 @throw assignment-expression [opt] ;
19924 Returns a constructed '@throw' statement. */
19927 cp_parser_objc_throw_statement (cp_parser *parser) {
19928 tree expr = NULL_TREE;
19930 cp_parser_require_keyword (parser, RID_AT_THROW, "%<@throw%>");
19932 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
19933 expr = cp_parser_assignment_expression (parser, false);
19935 cp_parser_consume_semicolon_at_end_of_statement (parser);
19937 return objc_build_throw_stmt (expr);
19940 /* Parse an Objective-C statement. */
19943 cp_parser_objc_statement (cp_parser * parser) {
19944 /* Try to figure out what kind of declaration is present. */
19945 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
19947 switch (kwd->keyword)
19950 return cp_parser_objc_try_catch_finally_statement (parser);
19951 case RID_AT_SYNCHRONIZED:
19952 return cp_parser_objc_synchronized_statement (parser);
19954 return cp_parser_objc_throw_statement (parser);
19956 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
19957 &kwd->location, kwd->u.value);
19958 cp_parser_skip_to_end_of_block_or_statement (parser);
19961 return error_mark_node;
19964 /* OpenMP 2.5 parsing routines. */
19966 /* Returns name of the next clause.
19967 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
19968 the token is not consumed. Otherwise appropriate pragma_omp_clause is
19969 returned and the token is consumed. */
19971 static pragma_omp_clause
19972 cp_parser_omp_clause_name (cp_parser *parser)
19974 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
19976 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
19977 result = PRAGMA_OMP_CLAUSE_IF;
19978 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
19979 result = PRAGMA_OMP_CLAUSE_DEFAULT;
19980 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
19981 result = PRAGMA_OMP_CLAUSE_PRIVATE;
19982 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
19984 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
19985 const char *p = IDENTIFIER_POINTER (id);
19990 if (!strcmp ("collapse", p))
19991 result = PRAGMA_OMP_CLAUSE_COLLAPSE;
19992 else if (!strcmp ("copyin", p))
19993 result = PRAGMA_OMP_CLAUSE_COPYIN;
19994 else if (!strcmp ("copyprivate", p))
19995 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
19998 if (!strcmp ("firstprivate", p))
19999 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
20002 if (!strcmp ("lastprivate", p))
20003 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
20006 if (!strcmp ("nowait", p))
20007 result = PRAGMA_OMP_CLAUSE_NOWAIT;
20008 else if (!strcmp ("num_threads", p))
20009 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
20012 if (!strcmp ("ordered", p))
20013 result = PRAGMA_OMP_CLAUSE_ORDERED;
20016 if (!strcmp ("reduction", p))
20017 result = PRAGMA_OMP_CLAUSE_REDUCTION;
20020 if (!strcmp ("schedule", p))
20021 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
20022 else if (!strcmp ("shared", p))
20023 result = PRAGMA_OMP_CLAUSE_SHARED;
20026 if (!strcmp ("untied", p))
20027 result = PRAGMA_OMP_CLAUSE_UNTIED;
20032 if (result != PRAGMA_OMP_CLAUSE_NONE)
20033 cp_lexer_consume_token (parser->lexer);
20038 /* Validate that a clause of the given type does not already exist. */
20041 check_no_duplicate_clause (tree clauses, enum tree_code code,
20042 const char *name, location_t location)
20046 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
20047 if (OMP_CLAUSE_CODE (c) == code)
20049 error ("%Htoo many %qs clauses", &location, name);
20057 variable-list , identifier
20059 In addition, we match a closing parenthesis. An opening parenthesis
20060 will have been consumed by the caller.
20062 If KIND is nonzero, create the appropriate node and install the decl
20063 in OMP_CLAUSE_DECL and add the node to the head of the list.
20065 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
20066 return the list created. */
20069 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
20077 token = cp_lexer_peek_token (parser->lexer);
20078 name = cp_parser_id_expression (parser, /*template_p=*/false,
20079 /*check_dependency_p=*/true,
20080 /*template_p=*/NULL,
20081 /*declarator_p=*/false,
20082 /*optional_p=*/false);
20083 if (name == error_mark_node)
20086 decl = cp_parser_lookup_name_simple (parser, name, token->location);
20087 if (decl == error_mark_node)
20088 cp_parser_name_lookup_error (parser, name, decl, NULL, token->location);
20089 else if (kind != 0)
20091 tree u = build_omp_clause (kind);
20092 OMP_CLAUSE_DECL (u) = decl;
20093 OMP_CLAUSE_CHAIN (u) = list;
20097 list = tree_cons (decl, NULL_TREE, list);
20100 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
20102 cp_lexer_consume_token (parser->lexer);
20105 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20109 /* Try to resync to an unnested comma. Copied from
20110 cp_parser_parenthesized_expression_list. */
20112 ending = cp_parser_skip_to_closing_parenthesis (parser,
20113 /*recovering=*/true,
20115 /*consume_paren=*/true);
20123 /* Similarly, but expect leading and trailing parenthesis. This is a very
20124 common case for omp clauses. */
20127 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
20129 if (cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20130 return cp_parser_omp_var_list_no_open (parser, kind, list);
20135 collapse ( constant-expression ) */
20138 cp_parser_omp_clause_collapse (cp_parser *parser, tree list, location_t location)
20144 loc = cp_lexer_peek_token (parser->lexer)->location;
20145 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20148 num = cp_parser_constant_expression (parser, false, NULL);
20150 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20151 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20152 /*or_comma=*/false,
20153 /*consume_paren=*/true);
20155 if (num == error_mark_node)
20157 num = fold_non_dependent_expr (num);
20158 if (!INTEGRAL_TYPE_P (TREE_TYPE (num))
20159 || !host_integerp (num, 0)
20160 || (n = tree_low_cst (num, 0)) <= 0
20163 error ("%Hcollapse argument needs positive constant integer expression",
20168 check_no_duplicate_clause (list, OMP_CLAUSE_COLLAPSE, "collapse", location);
20169 c = build_omp_clause (OMP_CLAUSE_COLLAPSE);
20170 OMP_CLAUSE_CHAIN (c) = list;
20171 OMP_CLAUSE_COLLAPSE_EXPR (c) = num;
20177 default ( shared | none ) */
20180 cp_parser_omp_clause_default (cp_parser *parser, tree list, location_t location)
20182 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
20185 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20187 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
20189 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
20190 const char *p = IDENTIFIER_POINTER (id);
20195 if (strcmp ("none", p) != 0)
20197 kind = OMP_CLAUSE_DEFAULT_NONE;
20201 if (strcmp ("shared", p) != 0)
20203 kind = OMP_CLAUSE_DEFAULT_SHARED;
20210 cp_lexer_consume_token (parser->lexer);
20215 cp_parser_error (parser, "expected %<none%> or %<shared%>");
20218 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20219 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20220 /*or_comma=*/false,
20221 /*consume_paren=*/true);
20223 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
20226 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default", location);
20227 c = build_omp_clause (OMP_CLAUSE_DEFAULT);
20228 OMP_CLAUSE_CHAIN (c) = list;
20229 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
20235 if ( expression ) */
20238 cp_parser_omp_clause_if (cp_parser *parser, tree list, location_t location)
20242 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20245 t = cp_parser_condition (parser);
20247 if (t == error_mark_node
20248 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20249 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20250 /*or_comma=*/false,
20251 /*consume_paren=*/true);
20253 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if", location);
20255 c = build_omp_clause (OMP_CLAUSE_IF);
20256 OMP_CLAUSE_IF_EXPR (c) = t;
20257 OMP_CLAUSE_CHAIN (c) = list;
20266 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED,
20267 tree list, location_t location)
20271 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait", location);
20273 c = build_omp_clause (OMP_CLAUSE_NOWAIT);
20274 OMP_CLAUSE_CHAIN (c) = list;
20279 num_threads ( expression ) */
20282 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list,
20283 location_t location)
20287 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20290 t = cp_parser_expression (parser, false);
20292 if (t == error_mark_node
20293 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20294 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20295 /*or_comma=*/false,
20296 /*consume_paren=*/true);
20298 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS,
20299 "num_threads", location);
20301 c = build_omp_clause (OMP_CLAUSE_NUM_THREADS);
20302 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
20303 OMP_CLAUSE_CHAIN (c) = list;
20312 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED,
20313 tree list, location_t location)
20317 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED,
20318 "ordered", location);
20320 c = build_omp_clause (OMP_CLAUSE_ORDERED);
20321 OMP_CLAUSE_CHAIN (c) = list;
20326 reduction ( reduction-operator : variable-list )
20328 reduction-operator:
20329 One of: + * - & ^ | && || */
20332 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
20334 enum tree_code code;
20337 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20340 switch (cp_lexer_peek_token (parser->lexer)->type)
20352 code = BIT_AND_EXPR;
20355 code = BIT_XOR_EXPR;
20358 code = BIT_IOR_EXPR;
20361 code = TRUTH_ANDIF_EXPR;
20364 code = TRUTH_ORIF_EXPR;
20367 cp_parser_error (parser, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
20368 "%<|%>, %<&&%>, or %<||%>");
20370 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20371 /*or_comma=*/false,
20372 /*consume_paren=*/true);
20375 cp_lexer_consume_token (parser->lexer);
20377 if (!cp_parser_require (parser, CPP_COLON, "%<:%>"))
20380 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
20381 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
20382 OMP_CLAUSE_REDUCTION_CODE (c) = code;
20388 schedule ( schedule-kind )
20389 schedule ( schedule-kind , expression )
20392 static | dynamic | guided | runtime | auto */
20395 cp_parser_omp_clause_schedule (cp_parser *parser, tree list, location_t location)
20399 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20402 c = build_omp_clause (OMP_CLAUSE_SCHEDULE);
20404 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
20406 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
20407 const char *p = IDENTIFIER_POINTER (id);
20412 if (strcmp ("dynamic", p) != 0)
20414 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
20418 if (strcmp ("guided", p) != 0)
20420 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
20424 if (strcmp ("runtime", p) != 0)
20426 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
20433 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
20434 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
20435 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AUTO))
20436 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_AUTO;
20439 cp_lexer_consume_token (parser->lexer);
20441 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
20444 cp_lexer_consume_token (parser->lexer);
20446 token = cp_lexer_peek_token (parser->lexer);
20447 t = cp_parser_assignment_expression (parser, false);
20449 if (t == error_mark_node)
20451 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
20452 error ("%Hschedule %<runtime%> does not take "
20453 "a %<chunk_size%> parameter", &token->location);
20454 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_AUTO)
20455 error ("%Hschedule %<auto%> does not take "
20456 "a %<chunk_size%> parameter", &token->location);
20458 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
20460 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20463 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<,%> or %<)%>"))
20466 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule", location);
20467 OMP_CLAUSE_CHAIN (c) = list;
20471 cp_parser_error (parser, "invalid schedule kind");
20473 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20474 /*or_comma=*/false,
20475 /*consume_paren=*/true);
20483 cp_parser_omp_clause_untied (cp_parser *parser ATTRIBUTE_UNUSED,
20484 tree list, location_t location)
20488 check_no_duplicate_clause (list, OMP_CLAUSE_UNTIED, "untied", location);
20490 c = build_omp_clause (OMP_CLAUSE_UNTIED);
20491 OMP_CLAUSE_CHAIN (c) = list;
20495 /* Parse all OpenMP clauses. The set clauses allowed by the directive
20496 is a bitmask in MASK. Return the list of clauses found; the result
20497 of clause default goes in *pdefault. */
20500 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
20501 const char *where, cp_token *pragma_tok)
20503 tree clauses = NULL;
20505 cp_token *token = NULL;
20507 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
20509 pragma_omp_clause c_kind;
20510 const char *c_name;
20511 tree prev = clauses;
20513 if (!first && cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
20514 cp_lexer_consume_token (parser->lexer);
20516 token = cp_lexer_peek_token (parser->lexer);
20517 c_kind = cp_parser_omp_clause_name (parser);
20522 case PRAGMA_OMP_CLAUSE_COLLAPSE:
20523 clauses = cp_parser_omp_clause_collapse (parser, clauses,
20525 c_name = "collapse";
20527 case PRAGMA_OMP_CLAUSE_COPYIN:
20528 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
20531 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
20532 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
20534 c_name = "copyprivate";
20536 case PRAGMA_OMP_CLAUSE_DEFAULT:
20537 clauses = cp_parser_omp_clause_default (parser, clauses,
20539 c_name = "default";
20541 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
20542 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
20544 c_name = "firstprivate";
20546 case PRAGMA_OMP_CLAUSE_IF:
20547 clauses = cp_parser_omp_clause_if (parser, clauses, token->location);
20550 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
20551 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
20553 c_name = "lastprivate";
20555 case PRAGMA_OMP_CLAUSE_NOWAIT:
20556 clauses = cp_parser_omp_clause_nowait (parser, clauses, token->location);
20559 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
20560 clauses = cp_parser_omp_clause_num_threads (parser, clauses,
20562 c_name = "num_threads";
20564 case PRAGMA_OMP_CLAUSE_ORDERED:
20565 clauses = cp_parser_omp_clause_ordered (parser, clauses,
20567 c_name = "ordered";
20569 case PRAGMA_OMP_CLAUSE_PRIVATE:
20570 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
20572 c_name = "private";
20574 case PRAGMA_OMP_CLAUSE_REDUCTION:
20575 clauses = cp_parser_omp_clause_reduction (parser, clauses);
20576 c_name = "reduction";
20578 case PRAGMA_OMP_CLAUSE_SCHEDULE:
20579 clauses = cp_parser_omp_clause_schedule (parser, clauses,
20581 c_name = "schedule";
20583 case PRAGMA_OMP_CLAUSE_SHARED:
20584 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
20588 case PRAGMA_OMP_CLAUSE_UNTIED:
20589 clauses = cp_parser_omp_clause_untied (parser, clauses,
20594 cp_parser_error (parser, "expected %<#pragma omp%> clause");
20598 if (((mask >> c_kind) & 1) == 0)
20600 /* Remove the invalid clause(s) from the list to avoid
20601 confusing the rest of the compiler. */
20603 error ("%H%qs is not valid for %qs", &token->location, c_name, where);
20607 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
20608 return finish_omp_clauses (clauses);
20615 In practice, we're also interested in adding the statement to an
20616 outer node. So it is convenient if we work around the fact that
20617 cp_parser_statement calls add_stmt. */
20620 cp_parser_begin_omp_structured_block (cp_parser *parser)
20622 unsigned save = parser->in_statement;
20624 /* Only move the values to IN_OMP_BLOCK if they weren't false.
20625 This preserves the "not within loop or switch" style error messages
20626 for nonsense cases like
20632 if (parser->in_statement)
20633 parser->in_statement = IN_OMP_BLOCK;
20639 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
20641 parser->in_statement = save;
20645 cp_parser_omp_structured_block (cp_parser *parser)
20647 tree stmt = begin_omp_structured_block ();
20648 unsigned int save = cp_parser_begin_omp_structured_block (parser);
20650 cp_parser_statement (parser, NULL_TREE, false, NULL);
20652 cp_parser_end_omp_structured_block (parser, save);
20653 return finish_omp_structured_block (stmt);
20657 # pragma omp atomic new-line
20661 x binop= expr | x++ | ++x | x-- | --x
20663 +, *, -, /, &, ^, |, <<, >>
20665 where x is an lvalue expression with scalar type. */
20668 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
20671 enum tree_code code;
20673 cp_parser_require_pragma_eol (parser, pragma_tok);
20675 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
20677 switch (TREE_CODE (lhs))
20682 case PREINCREMENT_EXPR:
20683 case POSTINCREMENT_EXPR:
20684 lhs = TREE_OPERAND (lhs, 0);
20686 rhs = integer_one_node;
20689 case PREDECREMENT_EXPR:
20690 case POSTDECREMENT_EXPR:
20691 lhs = TREE_OPERAND (lhs, 0);
20693 rhs = integer_one_node;
20697 switch (cp_lexer_peek_token (parser->lexer)->type)
20703 code = TRUNC_DIV_EXPR;
20711 case CPP_LSHIFT_EQ:
20712 code = LSHIFT_EXPR;
20714 case CPP_RSHIFT_EQ:
20715 code = RSHIFT_EXPR;
20718 code = BIT_AND_EXPR;
20721 code = BIT_IOR_EXPR;
20724 code = BIT_XOR_EXPR;
20727 cp_parser_error (parser,
20728 "invalid operator for %<#pragma omp atomic%>");
20731 cp_lexer_consume_token (parser->lexer);
20733 rhs = cp_parser_expression (parser, false);
20734 if (rhs == error_mark_node)
20738 finish_omp_atomic (code, lhs, rhs);
20739 cp_parser_consume_semicolon_at_end_of_statement (parser);
20743 cp_parser_skip_to_end_of_block_or_statement (parser);
20748 # pragma omp barrier new-line */
20751 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
20753 cp_parser_require_pragma_eol (parser, pragma_tok);
20754 finish_omp_barrier ();
20758 # pragma omp critical [(name)] new-line
20759 structured-block */
20762 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
20764 tree stmt, name = NULL;
20766 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
20768 cp_lexer_consume_token (parser->lexer);
20770 name = cp_parser_identifier (parser);
20772 if (name == error_mark_node
20773 || !cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
20774 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
20775 /*or_comma=*/false,
20776 /*consume_paren=*/true);
20777 if (name == error_mark_node)
20780 cp_parser_require_pragma_eol (parser, pragma_tok);
20782 stmt = cp_parser_omp_structured_block (parser);
20783 return c_finish_omp_critical (stmt, name);
20787 # pragma omp flush flush-vars[opt] new-line
20790 ( variable-list ) */
20793 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
20795 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
20796 (void) cp_parser_omp_var_list (parser, 0, NULL);
20797 cp_parser_require_pragma_eol (parser, pragma_tok);
20799 finish_omp_flush ();
20802 /* Helper function, to parse omp for increment expression. */
20805 cp_parser_omp_for_cond (cp_parser *parser, tree decl)
20807 tree lhs = cp_parser_cast_expression (parser, false, false), rhs;
20813 cp_parser_skip_to_end_of_statement (parser);
20814 return error_mark_node;
20817 token = cp_lexer_peek_token (parser->lexer);
20818 op = binops_by_token [token->type].tree_type;
20827 cp_parser_skip_to_end_of_statement (parser);
20828 return error_mark_node;
20831 cp_lexer_consume_token (parser->lexer);
20832 rhs = cp_parser_binary_expression (parser, false,
20833 PREC_RELATIONAL_EXPRESSION);
20834 if (rhs == error_mark_node
20835 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
20837 cp_parser_skip_to_end_of_statement (parser);
20838 return error_mark_node;
20841 return build2 (op, boolean_type_node, lhs, rhs);
20844 /* Helper function, to parse omp for increment expression. */
20847 cp_parser_omp_for_incr (cp_parser *parser, tree decl)
20849 cp_token *token = cp_lexer_peek_token (parser->lexer);
20855 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
20857 op = (token->type == CPP_PLUS_PLUS
20858 ? PREINCREMENT_EXPR : PREDECREMENT_EXPR);
20859 cp_lexer_consume_token (parser->lexer);
20860 lhs = cp_parser_cast_expression (parser, false, false);
20862 return error_mark_node;
20863 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
20866 lhs = cp_parser_primary_expression (parser, false, false, false, &idk);
20868 return error_mark_node;
20870 token = cp_lexer_peek_token (parser->lexer);
20871 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
20873 op = (token->type == CPP_PLUS_PLUS
20874 ? POSTINCREMENT_EXPR : POSTDECREMENT_EXPR);
20875 cp_lexer_consume_token (parser->lexer);
20876 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
20879 op = cp_parser_assignment_operator_opt (parser);
20880 if (op == ERROR_MARK)
20881 return error_mark_node;
20883 if (op != NOP_EXPR)
20885 rhs = cp_parser_assignment_expression (parser, false);
20886 rhs = build2 (op, TREE_TYPE (decl), decl, rhs);
20887 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
20890 lhs = cp_parser_binary_expression (parser, false,
20891 PREC_ADDITIVE_EXPRESSION);
20892 token = cp_lexer_peek_token (parser->lexer);
20893 decl_first = lhs == decl;
20896 if (token->type != CPP_PLUS
20897 && token->type != CPP_MINUS)
20898 return error_mark_node;
20902 op = token->type == CPP_PLUS ? PLUS_EXPR : MINUS_EXPR;
20903 cp_lexer_consume_token (parser->lexer);
20904 rhs = cp_parser_binary_expression (parser, false,
20905 PREC_ADDITIVE_EXPRESSION);
20906 token = cp_lexer_peek_token (parser->lexer);
20907 if (token->type == CPP_PLUS || token->type == CPP_MINUS || decl_first)
20909 if (lhs == NULL_TREE)
20911 if (op == PLUS_EXPR)
20914 lhs = build_x_unary_op (NEGATE_EXPR, rhs, tf_warning_or_error);
20917 lhs = build_x_binary_op (op, lhs, ERROR_MARK, rhs, ERROR_MARK,
20918 NULL, tf_warning_or_error);
20921 while (token->type == CPP_PLUS || token->type == CPP_MINUS);
20925 if (rhs != decl || op == MINUS_EXPR)
20926 return error_mark_node;
20927 rhs = build2 (op, TREE_TYPE (decl), lhs, decl);
20930 rhs = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, lhs);
20932 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
20935 /* Parse the restricted form of the for statement allowed by OpenMP. */
20938 cp_parser_omp_for_loop (cp_parser *parser, tree clauses, tree *par_clauses)
20940 tree init, cond, incr, body, decl, pre_body = NULL_TREE, ret;
20941 tree for_block = NULL_TREE, real_decl, initv, condv, incrv, declv;
20942 tree this_pre_body, cl;
20943 location_t loc_first;
20944 bool collapse_err = false;
20945 int i, collapse = 1, nbraces = 0;
20947 for (cl = clauses; cl; cl = OMP_CLAUSE_CHAIN (cl))
20948 if (OMP_CLAUSE_CODE (cl) == OMP_CLAUSE_COLLAPSE)
20949 collapse = tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl), 0);
20951 gcc_assert (collapse >= 1);
20953 declv = make_tree_vec (collapse);
20954 initv = make_tree_vec (collapse);
20955 condv = make_tree_vec (collapse);
20956 incrv = make_tree_vec (collapse);
20958 loc_first = cp_lexer_peek_token (parser->lexer)->location;
20960 for (i = 0; i < collapse; i++)
20962 int bracecount = 0;
20963 bool add_private_clause = false;
20966 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
20968 cp_parser_error (parser, "for statement expected");
20971 loc = cp_lexer_consume_token (parser->lexer)->location;
20973 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "%<(%>"))
20976 init = decl = real_decl = NULL;
20977 this_pre_body = push_stmt_list ();
20978 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
20980 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
20984 integer-type var = lb
20985 random-access-iterator-type var = lb
20986 pointer-type var = lb
20988 cp_decl_specifier_seq type_specifiers;
20990 /* First, try to parse as an initialized declaration. See
20991 cp_parser_condition, from whence the bulk of this is copied. */
20993 cp_parser_parse_tentatively (parser);
20994 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
20996 if (cp_parser_parse_definitely (parser))
20998 /* If parsing a type specifier seq succeeded, then this
20999 MUST be a initialized declaration. */
21000 tree asm_specification, attributes;
21001 cp_declarator *declarator;
21003 declarator = cp_parser_declarator (parser,
21004 CP_PARSER_DECLARATOR_NAMED,
21005 /*ctor_dtor_or_conv_p=*/NULL,
21006 /*parenthesized_p=*/NULL,
21007 /*member_p=*/false);
21008 attributes = cp_parser_attributes_opt (parser);
21009 asm_specification = cp_parser_asm_specification_opt (parser);
21011 if (declarator == cp_error_declarator)
21012 cp_parser_skip_to_end_of_statement (parser);
21018 decl = start_decl (declarator, &type_specifiers,
21019 /*initialized_p=*/false, attributes,
21020 /*prefix_attributes=*/NULL_TREE,
21023 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
21025 if (cp_lexer_next_token_is (parser->lexer,
21027 error ("parenthesized initialization is not allowed in "
21028 "OpenMP %<for%> loop");
21030 /* Trigger an error. */
21031 cp_parser_require (parser, CPP_EQ, "%<=%>");
21033 init = error_mark_node;
21034 cp_parser_skip_to_end_of_statement (parser);
21036 else if (CLASS_TYPE_P (TREE_TYPE (decl))
21037 || type_dependent_expression_p (decl))
21039 bool is_direct_init, is_non_constant_init;
21041 init = cp_parser_initializer (parser,
21043 &is_non_constant_init);
21045 cp_finish_decl (decl, init, !is_non_constant_init,
21047 LOOKUP_ONLYCONVERTING);
21048 if (CLASS_TYPE_P (TREE_TYPE (decl)))
21051 = tree_cons (NULL, this_pre_body, for_block);
21055 init = pop_stmt_list (this_pre_body);
21056 this_pre_body = NULL_TREE;
21061 cp_lexer_consume_token (parser->lexer);
21062 init = cp_parser_assignment_expression (parser, false);
21064 if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
21065 init = error_mark_node;
21067 cp_finish_decl (decl, NULL_TREE,
21068 /*init_const_expr_p=*/false,
21070 LOOKUP_ONLYCONVERTING);
21074 pop_scope (pushed_scope);
21080 /* If parsing a type specifier sequence failed, then
21081 this MUST be a simple expression. */
21082 cp_parser_parse_tentatively (parser);
21083 decl = cp_parser_primary_expression (parser, false, false,
21085 if (!cp_parser_error_occurred (parser)
21088 && CLASS_TYPE_P (TREE_TYPE (decl)))
21092 cp_parser_parse_definitely (parser);
21093 cp_parser_require (parser, CPP_EQ, "%<=%>");
21094 rhs = cp_parser_assignment_expression (parser, false);
21095 finish_expr_stmt (build_x_modify_expr (decl, NOP_EXPR,
21097 tf_warning_or_error));
21098 add_private_clause = true;
21103 cp_parser_abort_tentative_parse (parser);
21104 init = cp_parser_expression (parser, false);
21107 if (TREE_CODE (init) == MODIFY_EXPR
21108 || TREE_CODE (init) == MODOP_EXPR)
21109 real_decl = TREE_OPERAND (init, 0);
21114 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
21117 this_pre_body = pop_stmt_list (this_pre_body);
21121 pre_body = push_stmt_list ();
21123 add_stmt (this_pre_body);
21124 pre_body = pop_stmt_list (pre_body);
21127 pre_body = this_pre_body;
21132 if (par_clauses != NULL && real_decl != NULL_TREE)
21135 for (c = par_clauses; *c ; )
21136 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_FIRSTPRIVATE
21137 && OMP_CLAUSE_DECL (*c) == real_decl)
21139 error ("%Hiteration variable %qD should not be firstprivate",
21141 *c = OMP_CLAUSE_CHAIN (*c);
21143 else if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_LASTPRIVATE
21144 && OMP_CLAUSE_DECL (*c) == real_decl)
21146 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
21147 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
21148 tree l = build_omp_clause (OMP_CLAUSE_LASTPRIVATE);
21149 OMP_CLAUSE_DECL (l) = real_decl;
21150 OMP_CLAUSE_CHAIN (l) = clauses;
21151 CP_OMP_CLAUSE_INFO (l) = CP_OMP_CLAUSE_INFO (*c);
21153 OMP_CLAUSE_SET_CODE (*c, OMP_CLAUSE_SHARED);
21154 CP_OMP_CLAUSE_INFO (*c) = NULL;
21155 add_private_clause = false;
21159 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_PRIVATE
21160 && OMP_CLAUSE_DECL (*c) == real_decl)
21161 add_private_clause = false;
21162 c = &OMP_CLAUSE_CHAIN (*c);
21166 if (add_private_clause)
21169 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
21171 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE
21172 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE)
21173 && OMP_CLAUSE_DECL (c) == decl)
21175 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
21176 && OMP_CLAUSE_DECL (c) == decl)
21177 error ("%Hiteration variable %qD should not be firstprivate",
21179 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
21180 && OMP_CLAUSE_DECL (c) == decl)
21181 error ("%Hiteration variable %qD should not be reduction",
21186 c = build_omp_clause (OMP_CLAUSE_PRIVATE);
21187 OMP_CLAUSE_DECL (c) = decl;
21188 c = finish_omp_clauses (c);
21191 OMP_CLAUSE_CHAIN (c) = clauses;
21198 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
21200 /* If decl is an iterator, preserve LHS and RHS of the relational
21201 expr until finish_omp_for. */
21203 && (type_dependent_expression_p (decl)
21204 || CLASS_TYPE_P (TREE_TYPE (decl))))
21205 cond = cp_parser_omp_for_cond (parser, decl);
21207 cond = cp_parser_condition (parser);
21209 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
21212 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
21214 /* If decl is an iterator, preserve the operator on decl
21215 until finish_omp_for. */
21217 && (type_dependent_expression_p (decl)
21218 || CLASS_TYPE_P (TREE_TYPE (decl))))
21219 incr = cp_parser_omp_for_incr (parser, decl);
21221 incr = cp_parser_expression (parser, false);
21224 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>"))
21225 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
21226 /*or_comma=*/false,
21227 /*consume_paren=*/true);
21229 TREE_VEC_ELT (declv, i) = decl;
21230 TREE_VEC_ELT (initv, i) = init;
21231 TREE_VEC_ELT (condv, i) = cond;
21232 TREE_VEC_ELT (incrv, i) = incr;
21234 if (i == collapse - 1)
21237 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
21238 in between the collapsed for loops to be still considered perfectly
21239 nested. Hopefully the final version clarifies this.
21240 For now handle (multiple) {'s and empty statements. */
21241 cp_parser_parse_tentatively (parser);
21244 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
21246 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
21248 cp_lexer_consume_token (parser->lexer);
21251 else if (bracecount
21252 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
21253 cp_lexer_consume_token (parser->lexer);
21256 loc = cp_lexer_peek_token (parser->lexer)->location;
21257 error ("%Hnot enough collapsed for loops", &loc);
21258 collapse_err = true;
21259 cp_parser_abort_tentative_parse (parser);
21268 cp_parser_parse_definitely (parser);
21269 nbraces += bracecount;
21273 /* Note that we saved the original contents of this flag when we entered
21274 the structured block, and so we don't need to re-save it here. */
21275 parser->in_statement = IN_OMP_FOR;
21277 /* Note that the grammar doesn't call for a structured block here,
21278 though the loop as a whole is a structured block. */
21279 body = push_stmt_list ();
21280 cp_parser_statement (parser, NULL_TREE, false, NULL);
21281 body = pop_stmt_list (body);
21283 if (declv == NULL_TREE)
21286 ret = finish_omp_for (loc_first, declv, initv, condv, incrv, body,
21287 pre_body, clauses);
21291 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
21293 cp_lexer_consume_token (parser->lexer);
21296 else if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
21297 cp_lexer_consume_token (parser->lexer);
21302 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
21303 error ("%Hcollapsed loops not perfectly nested", &loc);
21305 collapse_err = true;
21306 cp_parser_statement_seq_opt (parser, NULL);
21307 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
21313 add_stmt (pop_stmt_list (TREE_VALUE (for_block)));
21314 for_block = TREE_CHAIN (for_block);
21321 #pragma omp for for-clause[optseq] new-line
21324 #define OMP_FOR_CLAUSE_MASK \
21325 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21326 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21327 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
21328 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21329 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
21330 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
21331 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
21332 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
21335 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
21337 tree clauses, sb, ret;
21340 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
21341 "#pragma omp for", pragma_tok);
21343 sb = begin_omp_structured_block ();
21344 save = cp_parser_begin_omp_structured_block (parser);
21346 ret = cp_parser_omp_for_loop (parser, clauses, NULL);
21348 cp_parser_end_omp_structured_block (parser, save);
21349 add_stmt (finish_omp_structured_block (sb));
21355 # pragma omp master new-line
21356 structured-block */
21359 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
21361 cp_parser_require_pragma_eol (parser, pragma_tok);
21362 return c_finish_omp_master (cp_parser_omp_structured_block (parser));
21366 # pragma omp ordered new-line
21367 structured-block */
21370 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
21372 cp_parser_require_pragma_eol (parser, pragma_tok);
21373 return c_finish_omp_ordered (cp_parser_omp_structured_block (parser));
21379 { section-sequence }
21382 section-directive[opt] structured-block
21383 section-sequence section-directive structured-block */
21386 cp_parser_omp_sections_scope (cp_parser *parser)
21388 tree stmt, substmt;
21389 bool error_suppress = false;
21392 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "%<{%>"))
21395 stmt = push_stmt_list ();
21397 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
21401 substmt = begin_omp_structured_block ();
21402 save = cp_parser_begin_omp_structured_block (parser);
21406 cp_parser_statement (parser, NULL_TREE, false, NULL);
21408 tok = cp_lexer_peek_token (parser->lexer);
21409 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
21411 if (tok->type == CPP_CLOSE_BRACE)
21413 if (tok->type == CPP_EOF)
21417 cp_parser_end_omp_structured_block (parser, save);
21418 substmt = finish_omp_structured_block (substmt);
21419 substmt = build1 (OMP_SECTION, void_type_node, substmt);
21420 add_stmt (substmt);
21425 tok = cp_lexer_peek_token (parser->lexer);
21426 if (tok->type == CPP_CLOSE_BRACE)
21428 if (tok->type == CPP_EOF)
21431 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
21433 cp_lexer_consume_token (parser->lexer);
21434 cp_parser_require_pragma_eol (parser, tok);
21435 error_suppress = false;
21437 else if (!error_suppress)
21439 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
21440 error_suppress = true;
21443 substmt = cp_parser_omp_structured_block (parser);
21444 substmt = build1 (OMP_SECTION, void_type_node, substmt);
21445 add_stmt (substmt);
21447 cp_parser_require (parser, CPP_CLOSE_BRACE, "%<}%>");
21449 substmt = pop_stmt_list (stmt);
21451 stmt = make_node (OMP_SECTIONS);
21452 TREE_TYPE (stmt) = void_type_node;
21453 OMP_SECTIONS_BODY (stmt) = substmt;
21460 # pragma omp sections sections-clause[optseq] newline
21463 #define OMP_SECTIONS_CLAUSE_MASK \
21464 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21465 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21466 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
21467 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21468 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
21471 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
21475 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
21476 "#pragma omp sections", pragma_tok);
21478 ret = cp_parser_omp_sections_scope (parser);
21480 OMP_SECTIONS_CLAUSES (ret) = clauses;
21486 # pragma parallel parallel-clause new-line
21487 # pragma parallel for parallel-for-clause new-line
21488 # pragma parallel sections parallel-sections-clause new-line */
21490 #define OMP_PARALLEL_CLAUSE_MASK \
21491 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
21492 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21493 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21494 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
21495 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
21496 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
21497 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21498 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
21501 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
21503 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
21504 const char *p_name = "#pragma omp parallel";
21505 tree stmt, clauses, par_clause, ws_clause, block;
21506 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
21509 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
21511 cp_lexer_consume_token (parser->lexer);
21512 p_kind = PRAGMA_OMP_PARALLEL_FOR;
21513 p_name = "#pragma omp parallel for";
21514 mask |= OMP_FOR_CLAUSE_MASK;
21515 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
21517 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
21519 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
21520 const char *p = IDENTIFIER_POINTER (id);
21521 if (strcmp (p, "sections") == 0)
21523 cp_lexer_consume_token (parser->lexer);
21524 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
21525 p_name = "#pragma omp parallel sections";
21526 mask |= OMP_SECTIONS_CLAUSE_MASK;
21527 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
21531 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
21532 block = begin_omp_parallel ();
21533 save = cp_parser_begin_omp_structured_block (parser);
21537 case PRAGMA_OMP_PARALLEL:
21538 cp_parser_statement (parser, NULL_TREE, false, NULL);
21539 par_clause = clauses;
21542 case PRAGMA_OMP_PARALLEL_FOR:
21543 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
21544 cp_parser_omp_for_loop (parser, ws_clause, &par_clause);
21547 case PRAGMA_OMP_PARALLEL_SECTIONS:
21548 c_split_parallel_clauses (clauses, &par_clause, &ws_clause);
21549 stmt = cp_parser_omp_sections_scope (parser);
21551 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
21555 gcc_unreachable ();
21558 cp_parser_end_omp_structured_block (parser, save);
21559 stmt = finish_omp_parallel (par_clause, block);
21560 if (p_kind != PRAGMA_OMP_PARALLEL)
21561 OMP_PARALLEL_COMBINED (stmt) = 1;
21566 # pragma omp single single-clause[optseq] new-line
21567 structured-block */
21569 #define OMP_SINGLE_CLAUSE_MASK \
21570 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21571 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21572 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
21573 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
21576 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
21578 tree stmt = make_node (OMP_SINGLE);
21579 TREE_TYPE (stmt) = void_type_node;
21581 OMP_SINGLE_CLAUSES (stmt)
21582 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
21583 "#pragma omp single", pragma_tok);
21584 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
21586 return add_stmt (stmt);
21590 # pragma omp task task-clause[optseq] new-line
21591 structured-block */
21593 #define OMP_TASK_CLAUSE_MASK \
21594 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
21595 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
21596 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
21597 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21598 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21599 | (1u << PRAGMA_OMP_CLAUSE_SHARED))
21602 cp_parser_omp_task (cp_parser *parser, cp_token *pragma_tok)
21604 tree clauses, block;
21607 clauses = cp_parser_omp_all_clauses (parser, OMP_TASK_CLAUSE_MASK,
21608 "#pragma omp task", pragma_tok);
21609 block = begin_omp_task ();
21610 save = cp_parser_begin_omp_structured_block (parser);
21611 cp_parser_statement (parser, NULL_TREE, false, NULL);
21612 cp_parser_end_omp_structured_block (parser, save);
21613 return finish_omp_task (clauses, block);
21617 # pragma omp taskwait new-line */
21620 cp_parser_omp_taskwait (cp_parser *parser, cp_token *pragma_tok)
21622 cp_parser_require_pragma_eol (parser, pragma_tok);
21623 finish_omp_taskwait ();
21627 # pragma omp threadprivate (variable-list) */
21630 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
21634 vars = cp_parser_omp_var_list (parser, 0, NULL);
21635 cp_parser_require_pragma_eol (parser, pragma_tok);
21637 finish_omp_threadprivate (vars);
21640 /* Main entry point to OpenMP statement pragmas. */
21643 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
21647 switch (pragma_tok->pragma_kind)
21649 case PRAGMA_OMP_ATOMIC:
21650 cp_parser_omp_atomic (parser, pragma_tok);
21652 case PRAGMA_OMP_CRITICAL:
21653 stmt = cp_parser_omp_critical (parser, pragma_tok);
21655 case PRAGMA_OMP_FOR:
21656 stmt = cp_parser_omp_for (parser, pragma_tok);
21658 case PRAGMA_OMP_MASTER:
21659 stmt = cp_parser_omp_master (parser, pragma_tok);
21661 case PRAGMA_OMP_ORDERED:
21662 stmt = cp_parser_omp_ordered (parser, pragma_tok);
21664 case PRAGMA_OMP_PARALLEL:
21665 stmt = cp_parser_omp_parallel (parser, pragma_tok);
21667 case PRAGMA_OMP_SECTIONS:
21668 stmt = cp_parser_omp_sections (parser, pragma_tok);
21670 case PRAGMA_OMP_SINGLE:
21671 stmt = cp_parser_omp_single (parser, pragma_tok);
21673 case PRAGMA_OMP_TASK:
21674 stmt = cp_parser_omp_task (parser, pragma_tok);
21677 gcc_unreachable ();
21681 SET_EXPR_LOCATION (stmt, pragma_tok->location);
21686 static GTY (()) cp_parser *the_parser;
21689 /* Special handling for the first token or line in the file. The first
21690 thing in the file might be #pragma GCC pch_preprocess, which loads a
21691 PCH file, which is a GC collection point. So we need to handle this
21692 first pragma without benefit of an existing lexer structure.
21694 Always returns one token to the caller in *FIRST_TOKEN. This is
21695 either the true first token of the file, or the first token after
21696 the initial pragma. */
21699 cp_parser_initial_pragma (cp_token *first_token)
21703 cp_lexer_get_preprocessor_token (NULL, first_token);
21704 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
21707 cp_lexer_get_preprocessor_token (NULL, first_token);
21708 if (first_token->type == CPP_STRING)
21710 name = first_token->u.value;
21712 cp_lexer_get_preprocessor_token (NULL, first_token);
21713 if (first_token->type != CPP_PRAGMA_EOL)
21714 error ("%Hjunk at end of %<#pragma GCC pch_preprocess%>",
21715 &first_token->location);
21718 error ("%Hexpected string literal", &first_token->location);
21720 /* Skip to the end of the pragma. */
21721 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
21722 cp_lexer_get_preprocessor_token (NULL, first_token);
21724 /* Now actually load the PCH file. */
21726 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
21728 /* Read one more token to return to our caller. We have to do this
21729 after reading the PCH file in, since its pointers have to be
21731 cp_lexer_get_preprocessor_token (NULL, first_token);
21734 /* Normal parsing of a pragma token. Here we can (and must) use the
21738 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
21740 cp_token *pragma_tok;
21743 pragma_tok = cp_lexer_consume_token (parser->lexer);
21744 gcc_assert (pragma_tok->type == CPP_PRAGMA);
21745 parser->lexer->in_pragma = true;
21747 id = pragma_tok->pragma_kind;
21750 case PRAGMA_GCC_PCH_PREPROCESS:
21751 error ("%H%<#pragma GCC pch_preprocess%> must be first",
21752 &pragma_tok->location);
21755 case PRAGMA_OMP_BARRIER:
21758 case pragma_compound:
21759 cp_parser_omp_barrier (parser, pragma_tok);
21762 error ("%H%<#pragma omp barrier%> may only be "
21763 "used in compound statements", &pragma_tok->location);
21770 case PRAGMA_OMP_FLUSH:
21773 case pragma_compound:
21774 cp_parser_omp_flush (parser, pragma_tok);
21777 error ("%H%<#pragma omp flush%> may only be "
21778 "used in compound statements", &pragma_tok->location);
21785 case PRAGMA_OMP_TASKWAIT:
21788 case pragma_compound:
21789 cp_parser_omp_taskwait (parser, pragma_tok);
21792 error ("%H%<#pragma omp taskwait%> may only be "
21793 "used in compound statements",
21794 &pragma_tok->location);
21801 case PRAGMA_OMP_THREADPRIVATE:
21802 cp_parser_omp_threadprivate (parser, pragma_tok);
21805 case PRAGMA_OMP_ATOMIC:
21806 case PRAGMA_OMP_CRITICAL:
21807 case PRAGMA_OMP_FOR:
21808 case PRAGMA_OMP_MASTER:
21809 case PRAGMA_OMP_ORDERED:
21810 case PRAGMA_OMP_PARALLEL:
21811 case PRAGMA_OMP_SECTIONS:
21812 case PRAGMA_OMP_SINGLE:
21813 case PRAGMA_OMP_TASK:
21814 if (context == pragma_external)
21816 cp_parser_omp_construct (parser, pragma_tok);
21819 case PRAGMA_OMP_SECTION:
21820 error ("%H%<#pragma omp section%> may only be used in "
21821 "%<#pragma omp sections%> construct", &pragma_tok->location);
21825 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
21826 c_invoke_pragma_handler (id);
21830 cp_parser_error (parser, "expected declaration specifiers");
21834 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
21838 /* The interface the pragma parsers have to the lexer. */
21841 pragma_lex (tree *value)
21844 enum cpp_ttype ret;
21846 tok = cp_lexer_peek_token (the_parser->lexer);
21849 *value = tok->u.value;
21851 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
21853 else if (ret == CPP_STRING)
21854 *value = cp_parser_string_literal (the_parser, false, false);
21857 cp_lexer_consume_token (the_parser->lexer);
21858 if (ret == CPP_KEYWORD)
21866 /* External interface. */
21868 /* Parse one entire translation unit. */
21871 c_parse_file (void)
21873 bool error_occurred;
21874 static bool already_called = false;
21876 if (already_called)
21878 sorry ("inter-module optimizations not implemented for C++");
21881 already_called = true;
21883 the_parser = cp_parser_new ();
21884 push_deferring_access_checks (flag_access_control
21885 ? dk_no_deferred : dk_no_check);
21886 error_occurred = cp_parser_translation_unit (the_parser);
21890 #include "gt-cp-parser.h"