2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011 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"
31 #include "c-family/c-pragma.h"
34 #include "diagnostic-core.h"
38 #include "c-family/c-common.h"
39 #include "c-family/c-objc.h"
41 #include "tree-pretty-print.h"
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
50 static cp_token eof_token =
52 CPP_EOF, RID_MAX, 0, PRAGMA_NONE, false, false, false, 0, { NULL }
55 /* The various kinds of non integral constant we encounter. */
56 typedef enum non_integral_constant {
58 /* floating-point literal */
62 /* %<__FUNCTION__%> */
64 /* %<__PRETTY_FUNCTION__%> */
72 /* %<typeid%> operator */
74 /* non-constant compound literals */
82 /* an array reference */
88 /* the address of a label */
102 /* calls to overloaded operators */
106 /* a comma operator */
108 /* a call to a constructor */
110 } non_integral_constant;
112 /* The various kinds of errors about name-lookup failing. */
113 typedef enum name_lookup_error {
118 /* is not a class or namespace */
120 /* is not a class, namespace, or enumeration */
124 /* The various kinds of required token */
125 typedef enum required_token {
127 RT_SEMICOLON, /* ';' */
128 RT_OPEN_PAREN, /* '(' */
129 RT_CLOSE_BRACE, /* '}' */
130 RT_OPEN_BRACE, /* '{' */
131 RT_CLOSE_SQUARE, /* ']' */
132 RT_OPEN_SQUARE, /* '[' */
136 RT_GREATER, /* '>' */
138 RT_ELLIPSIS, /* '...' */
142 RT_COLON_SCOPE, /* ':' or '::' */
143 RT_CLOSE_PAREN, /* ')' */
144 RT_COMMA_CLOSE_PAREN, /* ',' or ')' */
145 RT_PRAGMA_EOL, /* end of line */
146 RT_NAME, /* identifier */
148 /* The type is CPP_KEYWORD */
150 RT_DELETE, /* delete */
151 RT_RETURN, /* return */
152 RT_WHILE, /* while */
153 RT_EXTERN, /* extern */
154 RT_STATIC_ASSERT, /* static_assert */
155 RT_DECLTYPE, /* decltype */
156 RT_OPERATOR, /* operator */
157 RT_CLASS, /* class */
158 RT_TEMPLATE, /* template */
159 RT_NAMESPACE, /* namespace */
160 RT_USING, /* using */
163 RT_CATCH, /* catch */
164 RT_THROW, /* throw */
165 RT_LABEL, /* __label__ */
166 RT_AT_TRY, /* @try */
167 RT_AT_SYNCHRONIZED, /* @synchronized */
168 RT_AT_THROW, /* @throw */
170 RT_SELECT, /* selection-statement */
171 RT_INTERATION, /* iteration-statement */
172 RT_JUMP, /* jump-statement */
173 RT_CLASS_KEY, /* class-key */
174 RT_CLASS_TYPENAME_TEMPLATE /* class, typename, or template */
179 static cp_lexer *cp_lexer_new_main
181 static cp_lexer *cp_lexer_new_from_tokens
182 (cp_token_cache *tokens);
183 static void cp_lexer_destroy
185 static int cp_lexer_saving_tokens
187 static cp_token *cp_lexer_token_at
188 (cp_lexer *, cp_token_position);
189 static void cp_lexer_get_preprocessor_token
190 (cp_lexer *, cp_token *);
191 static inline cp_token *cp_lexer_peek_token
193 static cp_token *cp_lexer_peek_nth_token
194 (cp_lexer *, size_t);
195 static inline bool cp_lexer_next_token_is
196 (cp_lexer *, enum cpp_ttype);
197 static bool cp_lexer_next_token_is_not
198 (cp_lexer *, enum cpp_ttype);
199 static bool cp_lexer_next_token_is_keyword
200 (cp_lexer *, enum rid);
201 static cp_token *cp_lexer_consume_token
203 static void cp_lexer_purge_token
205 static void cp_lexer_purge_tokens_after
206 (cp_lexer *, cp_token_position);
207 static void cp_lexer_save_tokens
209 static void cp_lexer_commit_tokens
211 static void cp_lexer_rollback_tokens
213 #ifdef ENABLE_CHECKING
214 static void cp_lexer_print_token
215 (FILE *, cp_token *);
216 static inline bool cp_lexer_debugging_p
218 static void cp_lexer_start_debugging
219 (cp_lexer *) ATTRIBUTE_UNUSED;
220 static void cp_lexer_stop_debugging
221 (cp_lexer *) ATTRIBUTE_UNUSED;
223 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
224 about passing NULL to functions that require non-NULL arguments
225 (fputs, fprintf). It will never be used, so all we need is a value
226 of the right type that's guaranteed not to be NULL. */
227 #define cp_lexer_debug_stream stdout
228 #define cp_lexer_print_token(str, tok) (void) 0
229 #define cp_lexer_debugging_p(lexer) 0
230 #endif /* ENABLE_CHECKING */
232 static cp_token_cache *cp_token_cache_new
233 (cp_token *, cp_token *);
235 static void cp_parser_initial_pragma
238 /* Manifest constants. */
239 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
240 #define CP_SAVED_TOKEN_STACK 5
244 #ifdef ENABLE_CHECKING
245 /* The stream to which debugging output should be written. */
246 static FILE *cp_lexer_debug_stream;
247 #endif /* ENABLE_CHECKING */
249 /* Nonzero if we are parsing an unevaluated operand: an operand to
250 sizeof, typeof, or alignof. */
251 int cp_unevaluated_operand;
253 #ifdef ENABLE_CHECKING
254 /* Dump up to NUM tokens in BUFFER to FILE. If NUM is 0, dump all the
258 cp_lexer_dump_tokens (FILE *file, VEC(cp_token,gc) *buffer, unsigned num)
263 fprintf (file, "%u tokens\n", VEC_length (cp_token, buffer));
266 num = VEC_length (cp_token, buffer);
268 for (i = 0; VEC_iterate (cp_token, buffer, i, token) && i < num; i++)
270 cp_lexer_print_token (file, token);
275 case CPP_CLOSE_BRACE:
285 if (i == num && i < VEC_length (cp_token, buffer))
287 fprintf (file, " ... ");
288 cp_lexer_print_token (file, VEC_index (cp_token, buffer,
289 VEC_length (cp_token, buffer) - 1));
292 fprintf (file, "\n");
296 /* Dump all tokens in BUFFER to stderr. */
299 cp_lexer_debug_tokens (VEC(cp_token,gc) *buffer)
301 cp_lexer_dump_tokens (stderr, buffer, 0);
306 /* Allocate memory for a new lexer object and return it. */
309 cp_lexer_alloc (void)
313 c_common_no_more_pch ();
315 /* Allocate the memory. */
316 lexer = ggc_alloc_cleared_cp_lexer ();
318 #ifdef ENABLE_CHECKING
319 /* Initially we are not debugging. */
320 lexer->debugging_p = false;
321 #endif /* ENABLE_CHECKING */
322 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
323 CP_SAVED_TOKEN_STACK);
325 /* Create the buffer. */
326 lexer->buffer = VEC_alloc (cp_token, gc, CP_LEXER_BUFFER_SIZE);
332 /* Create a new main C++ lexer, the lexer that gets tokens from the
336 cp_lexer_new_main (void)
341 /* It's possible that parsing the first pragma will load a PCH file,
342 which is a GC collection point. So we have to do that before
343 allocating any memory. */
344 cp_parser_initial_pragma (&token);
346 lexer = cp_lexer_alloc ();
348 /* Put the first token in the buffer. */
349 VEC_quick_push (cp_token, lexer->buffer, &token);
351 /* Get the remaining tokens from the preprocessor. */
352 while (token.type != CPP_EOF)
354 cp_lexer_get_preprocessor_token (lexer, &token);
355 VEC_safe_push (cp_token, gc, lexer->buffer, &token);
358 lexer->last_token = VEC_address (cp_token, lexer->buffer)
359 + VEC_length (cp_token, lexer->buffer)
361 lexer->next_token = VEC_length (cp_token, lexer->buffer)
362 ? VEC_address (cp_token, lexer->buffer)
365 /* Subsequent preprocessor diagnostics should use compiler
366 diagnostic functions to get the compiler source location. */
369 gcc_assert (!lexer->next_token->purged_p);
373 /* Create a new lexer whose token stream is primed with the tokens in
374 CACHE. When these tokens are exhausted, no new tokens will be read. */
377 cp_lexer_new_from_tokens (cp_token_cache *cache)
379 cp_token *first = cache->first;
380 cp_token *last = cache->last;
381 cp_lexer *lexer = ggc_alloc_cleared_cp_lexer ();
383 /* We do not own the buffer. */
384 lexer->buffer = NULL;
385 lexer->next_token = first == last ? &eof_token : first;
386 lexer->last_token = last;
388 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
389 CP_SAVED_TOKEN_STACK);
391 #ifdef ENABLE_CHECKING
392 /* Initially we are not debugging. */
393 lexer->debugging_p = false;
396 gcc_assert (!lexer->next_token->purged_p);
400 /* Frees all resources associated with LEXER. */
403 cp_lexer_destroy (cp_lexer *lexer)
405 VEC_free (cp_token, gc, lexer->buffer);
406 VEC_free (cp_token_position, heap, lexer->saved_tokens);
410 /* Returns nonzero if debugging information should be output. */
412 #ifdef ENABLE_CHECKING
415 cp_lexer_debugging_p (cp_lexer *lexer)
417 return lexer->debugging_p;
420 #endif /* ENABLE_CHECKING */
422 static inline cp_token_position
423 cp_lexer_token_position (cp_lexer *lexer, bool previous_p)
425 gcc_assert (!previous_p || lexer->next_token != &eof_token);
427 return lexer->next_token - previous_p;
430 static inline cp_token *
431 cp_lexer_token_at (cp_lexer *lexer ATTRIBUTE_UNUSED, cp_token_position pos)
437 cp_lexer_set_token_position (cp_lexer *lexer, cp_token_position pos)
439 lexer->next_token = cp_lexer_token_at (lexer, pos);
442 static inline cp_token_position
443 cp_lexer_previous_token_position (cp_lexer *lexer)
445 if (lexer->next_token == &eof_token)
446 return lexer->last_token - 1;
448 return cp_lexer_token_position (lexer, true);
451 static inline cp_token *
452 cp_lexer_previous_token (cp_lexer *lexer)
454 cp_token_position tp = cp_lexer_previous_token_position (lexer);
456 return cp_lexer_token_at (lexer, tp);
459 /* nonzero if we are presently saving tokens. */
462 cp_lexer_saving_tokens (const cp_lexer* lexer)
464 return VEC_length (cp_token_position, lexer->saved_tokens) != 0;
467 /* Store the next token from the preprocessor in *TOKEN. Return true
468 if we reach EOF. If LEXER is NULL, assume we are handling an
469 initial #pragma pch_preprocess, and thus want the lexer to return
470 processed strings. */
473 cp_lexer_get_preprocessor_token (cp_lexer *lexer, cp_token *token)
475 static int is_extern_c = 0;
477 /* Get a new token from the preprocessor. */
479 = c_lex_with_flags (&token->u.value, &token->location, &token->flags,
480 lexer == NULL ? 0 : C_LEX_STRING_NO_JOIN);
481 token->keyword = RID_MAX;
482 token->pragma_kind = PRAGMA_NONE;
483 token->purged_p = false;
485 /* On some systems, some header files are surrounded by an
486 implicit extern "C" block. Set a flag in the token if it
487 comes from such a header. */
488 is_extern_c += pending_lang_change;
489 pending_lang_change = 0;
490 token->implicit_extern_c = is_extern_c > 0;
492 /* Check to see if this token is a keyword. */
493 if (token->type == CPP_NAME)
495 if (C_IS_RESERVED_WORD (token->u.value))
497 /* Mark this token as a keyword. */
498 token->type = CPP_KEYWORD;
499 /* Record which keyword. */
500 token->keyword = C_RID_CODE (token->u.value);
504 if (warn_cxx0x_compat
505 && C_RID_CODE (token->u.value) >= RID_FIRST_CXX0X
506 && C_RID_CODE (token->u.value) <= RID_LAST_CXX0X)
508 /* Warn about the C++0x keyword (but still treat it as
510 warning (OPT_Wc__0x_compat,
511 "identifier %qE will become a keyword in C++0x",
514 /* Clear out the C_RID_CODE so we don't warn about this
515 particular identifier-turned-keyword again. */
516 C_SET_RID_CODE (token->u.value, RID_MAX);
519 token->ambiguous_p = false;
520 token->keyword = RID_MAX;
523 else if (token->type == CPP_AT_NAME)
525 /* This only happens in Objective-C++; it must be a keyword. */
526 token->type = CPP_KEYWORD;
527 switch (C_RID_CODE (token->u.value))
529 /* Replace 'class' with '@class', 'private' with '@private',
530 etc. This prevents confusion with the C++ keyword
531 'class', and makes the tokens consistent with other
532 Objective-C 'AT' keywords. For example '@class' is
533 reported as RID_AT_CLASS which is consistent with
534 '@synchronized', which is reported as
537 case RID_CLASS: token->keyword = RID_AT_CLASS; break;
538 case RID_PRIVATE: token->keyword = RID_AT_PRIVATE; break;
539 case RID_PROTECTED: token->keyword = RID_AT_PROTECTED; break;
540 case RID_PUBLIC: token->keyword = RID_AT_PUBLIC; break;
541 case RID_THROW: token->keyword = RID_AT_THROW; break;
542 case RID_TRY: token->keyword = RID_AT_TRY; break;
543 case RID_CATCH: token->keyword = RID_AT_CATCH; break;
544 default: token->keyword = C_RID_CODE (token->u.value);
547 else if (token->type == CPP_PRAGMA)
549 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
550 token->pragma_kind = ((enum pragma_kind)
551 TREE_INT_CST_LOW (token->u.value));
552 token->u.value = NULL_TREE;
556 /* Update the globals input_location and the input file stack from TOKEN. */
558 cp_lexer_set_source_position_from_token (cp_token *token)
560 if (token->type != CPP_EOF)
562 input_location = token->location;
566 /* Return a pointer to the next token in the token stream, but do not
569 static inline cp_token *
570 cp_lexer_peek_token (cp_lexer *lexer)
572 if (cp_lexer_debugging_p (lexer))
574 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream);
575 cp_lexer_print_token (cp_lexer_debug_stream, lexer->next_token);
576 putc ('\n', cp_lexer_debug_stream);
578 return lexer->next_token;
581 /* Return true if the next token has the indicated TYPE. */
584 cp_lexer_next_token_is (cp_lexer* lexer, enum cpp_ttype type)
586 return cp_lexer_peek_token (lexer)->type == type;
589 /* Return true if the next token does not have the indicated TYPE. */
592 cp_lexer_next_token_is_not (cp_lexer* lexer, enum cpp_ttype type)
594 return !cp_lexer_next_token_is (lexer, type);
597 /* Return true if the next token is the indicated KEYWORD. */
600 cp_lexer_next_token_is_keyword (cp_lexer* lexer, enum rid keyword)
602 return cp_lexer_peek_token (lexer)->keyword == keyword;
605 /* Return true if the next token is not the indicated KEYWORD. */
608 cp_lexer_next_token_is_not_keyword (cp_lexer* lexer, enum rid keyword)
610 return cp_lexer_peek_token (lexer)->keyword != keyword;
613 /* Return true if the next token is a keyword for a decl-specifier. */
616 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer *lexer)
620 token = cp_lexer_peek_token (lexer);
621 switch (token->keyword)
623 /* auto specifier: storage-class-specifier in C++,
624 simple-type-specifier in C++0x. */
626 /* Storage classes. */
632 /* Elaborated type specifiers. */
638 /* Simple type specifiers. */
653 /* GNU extensions. */
656 /* C++0x extensions. */
658 case RID_UNDERLYING_TYPE:
666 /* Return a pointer to the Nth token in the token stream. If N is 1,
667 then this is precisely equivalent to cp_lexer_peek_token (except
668 that it is not inline). One would like to disallow that case, but
669 there is one case (cp_parser_nth_token_starts_template_id) where
670 the caller passes a variable for N and it might be 1. */
673 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
677 /* N is 1-based, not zero-based. */
680 if (cp_lexer_debugging_p (lexer))
681 fprintf (cp_lexer_debug_stream,
682 "cp_lexer: peeking ahead %ld at token: ", (long)n);
685 token = lexer->next_token;
686 gcc_assert (!n || token != &eof_token);
690 if (token == lexer->last_token)
696 if (!token->purged_p)
700 if (cp_lexer_debugging_p (lexer))
702 cp_lexer_print_token (cp_lexer_debug_stream, token);
703 putc ('\n', cp_lexer_debug_stream);
709 /* Return the next token, and advance the lexer's next_token pointer
710 to point to the next non-purged token. */
713 cp_lexer_consume_token (cp_lexer* lexer)
715 cp_token *token = lexer->next_token;
717 gcc_assert (token != &eof_token);
718 gcc_assert (!lexer->in_pragma || token->type != CPP_PRAGMA_EOL);
723 if (lexer->next_token == lexer->last_token)
725 lexer->next_token = &eof_token;
730 while (lexer->next_token->purged_p);
732 cp_lexer_set_source_position_from_token (token);
734 /* Provide debugging output. */
735 if (cp_lexer_debugging_p (lexer))
737 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
738 cp_lexer_print_token (cp_lexer_debug_stream, token);
739 putc ('\n', cp_lexer_debug_stream);
745 /* Permanently remove the next token from the token stream, and
746 advance the next_token pointer to refer to the next non-purged
750 cp_lexer_purge_token (cp_lexer *lexer)
752 cp_token *tok = lexer->next_token;
754 gcc_assert (tok != &eof_token);
755 tok->purged_p = true;
756 tok->location = UNKNOWN_LOCATION;
757 tok->u.value = NULL_TREE;
758 tok->keyword = RID_MAX;
763 if (tok == lexer->last_token)
769 while (tok->purged_p);
770 lexer->next_token = tok;
773 /* Permanently remove all tokens after TOK, up to, but not
774 including, the token that will be returned next by
775 cp_lexer_peek_token. */
778 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
780 cp_token *peek = lexer->next_token;
782 if (peek == &eof_token)
783 peek = lexer->last_token;
785 gcc_assert (tok < peek);
787 for ( tok += 1; tok != peek; tok += 1)
789 tok->purged_p = true;
790 tok->location = UNKNOWN_LOCATION;
791 tok->u.value = NULL_TREE;
792 tok->keyword = RID_MAX;
796 /* Begin saving tokens. All tokens consumed after this point will be
800 cp_lexer_save_tokens (cp_lexer* lexer)
802 /* Provide debugging output. */
803 if (cp_lexer_debugging_p (lexer))
804 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
806 VEC_safe_push (cp_token_position, heap,
807 lexer->saved_tokens, lexer->next_token);
810 /* Commit to the portion of the token stream most recently saved. */
813 cp_lexer_commit_tokens (cp_lexer* lexer)
815 /* Provide debugging output. */
816 if (cp_lexer_debugging_p (lexer))
817 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
819 VEC_pop (cp_token_position, lexer->saved_tokens);
822 /* Return all tokens saved since the last call to cp_lexer_save_tokens
823 to the token stream. Stop saving tokens. */
826 cp_lexer_rollback_tokens (cp_lexer* lexer)
828 /* Provide debugging output. */
829 if (cp_lexer_debugging_p (lexer))
830 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
832 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
835 /* Print a representation of the TOKEN on the STREAM. */
837 #ifdef ENABLE_CHECKING
840 cp_lexer_print_token (FILE * stream, cp_token *token)
842 /* We don't use cpp_type2name here because the parser defines
843 a few tokens of its own. */
844 static const char *const token_names[] = {
845 /* cpplib-defined token types */
851 /* C++ parser token types - see "Manifest constants", above. */
854 "NESTED_NAME_SPECIFIER",
857 /* For some tokens, print the associated data. */
861 /* Some keywords have a value that is not an IDENTIFIER_NODE.
862 For example, `struct' is mapped to an INTEGER_CST. */
863 if (TREE_CODE (token->u.value) != IDENTIFIER_NODE)
865 /* else fall through */
867 fputs (IDENTIFIER_POINTER (token->u.value), stream);
875 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->u.value));
879 print_generic_expr (stream, token->u.value, 0);
883 /* If we have a name for the token, print it out. Otherwise, we
884 simply give the numeric code. */
885 if (token->type < ARRAY_SIZE(token_names))
886 fputs (token_names[token->type], stream);
888 fprintf (stream, "[%d]", token->type);
893 /* Start emitting debugging information. */
896 cp_lexer_start_debugging (cp_lexer* lexer)
898 lexer->debugging_p = true;
901 /* Stop emitting debugging information. */
904 cp_lexer_stop_debugging (cp_lexer* lexer)
906 lexer->debugging_p = false;
909 #endif /* ENABLE_CHECKING */
911 /* Create a new cp_token_cache, representing a range of tokens. */
913 static cp_token_cache *
914 cp_token_cache_new (cp_token *first, cp_token *last)
916 cp_token_cache *cache = ggc_alloc_cp_token_cache ();
917 cache->first = first;
923 /* Decl-specifiers. */
925 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
928 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
930 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
935 /* Nothing other than the parser should be creating declarators;
936 declarators are a semi-syntactic representation of C++ entities.
937 Other parts of the front end that need to create entities (like
938 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
940 static cp_declarator *make_call_declarator
941 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, tree, tree);
942 static cp_declarator *make_array_declarator
943 (cp_declarator *, tree);
944 static cp_declarator *make_pointer_declarator
945 (cp_cv_quals, cp_declarator *);
946 static cp_declarator *make_reference_declarator
947 (cp_cv_quals, cp_declarator *, bool);
948 static cp_parameter_declarator *make_parameter_declarator
949 (cp_decl_specifier_seq *, cp_declarator *, tree);
950 static cp_declarator *make_ptrmem_declarator
951 (cp_cv_quals, tree, cp_declarator *);
953 /* An erroneous declarator. */
954 static cp_declarator *cp_error_declarator;
956 /* The obstack on which declarators and related data structures are
958 static struct obstack declarator_obstack;
960 /* Alloc BYTES from the declarator memory pool. */
963 alloc_declarator (size_t bytes)
965 return obstack_alloc (&declarator_obstack, bytes);
968 /* Allocate a declarator of the indicated KIND. Clear fields that are
969 common to all declarators. */
971 static cp_declarator *
972 make_declarator (cp_declarator_kind kind)
974 cp_declarator *declarator;
976 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
977 declarator->kind = kind;
978 declarator->attributes = NULL_TREE;
979 declarator->declarator = NULL;
980 declarator->parameter_pack_p = false;
981 declarator->id_loc = UNKNOWN_LOCATION;
986 /* Make a declarator for a generalized identifier. If
987 QUALIFYING_SCOPE is non-NULL, the identifier is
988 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
989 UNQUALIFIED_NAME. SFK indicates the kind of special function this
992 static cp_declarator *
993 make_id_declarator (tree qualifying_scope, tree unqualified_name,
994 special_function_kind sfk)
996 cp_declarator *declarator;
998 /* It is valid to write:
1000 class C { void f(); };
1004 The standard is not clear about whether `typedef const C D' is
1005 legal; as of 2002-09-15 the committee is considering that
1006 question. EDG 3.0 allows that syntax. Therefore, we do as
1008 if (qualifying_scope && TYPE_P (qualifying_scope))
1009 qualifying_scope = TYPE_MAIN_VARIANT (qualifying_scope);
1011 gcc_assert (TREE_CODE (unqualified_name) == IDENTIFIER_NODE
1012 || TREE_CODE (unqualified_name) == BIT_NOT_EXPR
1013 || TREE_CODE (unqualified_name) == TEMPLATE_ID_EXPR);
1015 declarator = make_declarator (cdk_id);
1016 declarator->u.id.qualifying_scope = qualifying_scope;
1017 declarator->u.id.unqualified_name = unqualified_name;
1018 declarator->u.id.sfk = sfk;
1023 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1024 of modifiers such as const or volatile to apply to the pointer
1025 type, represented as identifiers. */
1028 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
1030 cp_declarator *declarator;
1032 declarator = make_declarator (cdk_pointer);
1033 declarator->declarator = target;
1034 declarator->u.pointer.qualifiers = cv_qualifiers;
1035 declarator->u.pointer.class_type = NULL_TREE;
1038 declarator->id_loc = target->id_loc;
1039 declarator->parameter_pack_p = target->parameter_pack_p;
1040 target->parameter_pack_p = false;
1043 declarator->parameter_pack_p = false;
1048 /* Like make_pointer_declarator -- but for references. */
1051 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target,
1054 cp_declarator *declarator;
1056 declarator = make_declarator (cdk_reference);
1057 declarator->declarator = target;
1058 declarator->u.reference.qualifiers = cv_qualifiers;
1059 declarator->u.reference.rvalue_ref = rvalue_ref;
1062 declarator->id_loc = target->id_loc;
1063 declarator->parameter_pack_p = target->parameter_pack_p;
1064 target->parameter_pack_p = false;
1067 declarator->parameter_pack_p = false;
1072 /* Like make_pointer_declarator -- but for a pointer to a non-static
1073 member of CLASS_TYPE. */
1076 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
1077 cp_declarator *pointee)
1079 cp_declarator *declarator;
1081 declarator = make_declarator (cdk_ptrmem);
1082 declarator->declarator = pointee;
1083 declarator->u.pointer.qualifiers = cv_qualifiers;
1084 declarator->u.pointer.class_type = class_type;
1088 declarator->parameter_pack_p = pointee->parameter_pack_p;
1089 pointee->parameter_pack_p = false;
1092 declarator->parameter_pack_p = false;
1097 /* Make a declarator for the function given by TARGET, with the
1098 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1099 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1100 indicates what exceptions can be thrown. */
1103 make_call_declarator (cp_declarator *target,
1105 cp_cv_quals cv_qualifiers,
1106 cp_virt_specifiers virt_specifiers,
1107 tree exception_specification,
1108 tree late_return_type)
1110 cp_declarator *declarator;
1112 declarator = make_declarator (cdk_function);
1113 declarator->declarator = target;
1114 declarator->u.function.parameters = parms;
1115 declarator->u.function.qualifiers = cv_qualifiers;
1116 declarator->u.function.virt_specifiers = virt_specifiers;
1117 declarator->u.function.exception_specification = exception_specification;
1118 declarator->u.function.late_return_type = late_return_type;
1121 declarator->id_loc = target->id_loc;
1122 declarator->parameter_pack_p = target->parameter_pack_p;
1123 target->parameter_pack_p = false;
1126 declarator->parameter_pack_p = false;
1131 /* Make a declarator for an array of BOUNDS elements, each of which is
1132 defined by ELEMENT. */
1135 make_array_declarator (cp_declarator *element, tree bounds)
1137 cp_declarator *declarator;
1139 declarator = make_declarator (cdk_array);
1140 declarator->declarator = element;
1141 declarator->u.array.bounds = bounds;
1144 declarator->id_loc = element->id_loc;
1145 declarator->parameter_pack_p = element->parameter_pack_p;
1146 element->parameter_pack_p = false;
1149 declarator->parameter_pack_p = false;
1154 /* Determine whether the declarator we've seen so far can be a
1155 parameter pack, when followed by an ellipsis. */
1157 declarator_can_be_parameter_pack (cp_declarator *declarator)
1159 /* Search for a declarator name, or any other declarator that goes
1160 after the point where the ellipsis could appear in a parameter
1161 pack. If we find any of these, then this declarator can not be
1162 made into a parameter pack. */
1164 while (declarator && !found)
1166 switch ((int)declarator->kind)
1177 declarator = declarator->declarator;
1185 cp_parameter_declarator *no_parameters;
1187 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1188 DECLARATOR and DEFAULT_ARGUMENT. */
1190 cp_parameter_declarator *
1191 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
1192 cp_declarator *declarator,
1193 tree default_argument)
1195 cp_parameter_declarator *parameter;
1197 parameter = ((cp_parameter_declarator *)
1198 alloc_declarator (sizeof (cp_parameter_declarator)));
1199 parameter->next = NULL;
1200 if (decl_specifiers)
1201 parameter->decl_specifiers = *decl_specifiers;
1203 clear_decl_specs (¶meter->decl_specifiers);
1204 parameter->declarator = declarator;
1205 parameter->default_argument = default_argument;
1206 parameter->ellipsis_p = false;
1211 /* Returns true iff DECLARATOR is a declaration for a function. */
1214 function_declarator_p (const cp_declarator *declarator)
1218 if (declarator->kind == cdk_function
1219 && declarator->declarator->kind == cdk_id)
1221 if (declarator->kind == cdk_id
1222 || declarator->kind == cdk_error)
1224 declarator = declarator->declarator;
1234 A cp_parser parses the token stream as specified by the C++
1235 grammar. Its job is purely parsing, not semantic analysis. For
1236 example, the parser breaks the token stream into declarators,
1237 expressions, statements, and other similar syntactic constructs.
1238 It does not check that the types of the expressions on either side
1239 of an assignment-statement are compatible, or that a function is
1240 not declared with a parameter of type `void'.
1242 The parser invokes routines elsewhere in the compiler to perform
1243 semantic analysis and to build up the abstract syntax tree for the
1246 The parser (and the template instantiation code, which is, in a
1247 way, a close relative of parsing) are the only parts of the
1248 compiler that should be calling push_scope and pop_scope, or
1249 related functions. The parser (and template instantiation code)
1250 keeps track of what scope is presently active; everything else
1251 should simply honor that. (The code that generates static
1252 initializers may also need to set the scope, in order to check
1253 access control correctly when emitting the initializers.)
1258 The parser is of the standard recursive-descent variety. Upcoming
1259 tokens in the token stream are examined in order to determine which
1260 production to use when parsing a non-terminal. Some C++ constructs
1261 require arbitrary look ahead to disambiguate. For example, it is
1262 impossible, in the general case, to tell whether a statement is an
1263 expression or declaration without scanning the entire statement.
1264 Therefore, the parser is capable of "parsing tentatively." When the
1265 parser is not sure what construct comes next, it enters this mode.
1266 Then, while we attempt to parse the construct, the parser queues up
1267 error messages, rather than issuing them immediately, and saves the
1268 tokens it consumes. If the construct is parsed successfully, the
1269 parser "commits", i.e., it issues any queued error messages and
1270 the tokens that were being preserved are permanently discarded.
1271 If, however, the construct is not parsed successfully, the parser
1272 rolls back its state completely so that it can resume parsing using
1273 a different alternative.
1278 The performance of the parser could probably be improved substantially.
1279 We could often eliminate the need to parse tentatively by looking ahead
1280 a little bit. In some places, this approach might not entirely eliminate
1281 the need to parse tentatively, but it might still speed up the average
1284 /* Flags that are passed to some parsing functions. These values can
1285 be bitwise-ored together. */
1290 CP_PARSER_FLAGS_NONE = 0x0,
1291 /* The construct is optional. If it is not present, then no error
1292 should be issued. */
1293 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1294 /* When parsing a type-specifier, treat user-defined type-names
1295 as non-type identifiers. */
1296 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2,
1297 /* When parsing a type-specifier, do not try to parse a class-specifier
1298 or enum-specifier. */
1299 CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS = 0x4,
1300 /* When parsing a decl-specifier-seq, only allow type-specifier or
1302 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR = 0x8
1305 /* This type is used for parameters and variables which hold
1306 combinations of the above flags. */
1307 typedef int cp_parser_flags;
1309 /* The different kinds of declarators we want to parse. */
1311 typedef enum cp_parser_declarator_kind
1313 /* We want an abstract declarator. */
1314 CP_PARSER_DECLARATOR_ABSTRACT,
1315 /* We want a named declarator. */
1316 CP_PARSER_DECLARATOR_NAMED,
1317 /* We don't mind, but the name must be an unqualified-id. */
1318 CP_PARSER_DECLARATOR_EITHER
1319 } cp_parser_declarator_kind;
1321 /* The precedence values used to parse binary expressions. The minimum value
1322 of PREC must be 1, because zero is reserved to quickly discriminate
1323 binary operators from other tokens. */
1328 PREC_LOGICAL_OR_EXPRESSION,
1329 PREC_LOGICAL_AND_EXPRESSION,
1330 PREC_INCLUSIVE_OR_EXPRESSION,
1331 PREC_EXCLUSIVE_OR_EXPRESSION,
1332 PREC_AND_EXPRESSION,
1333 PREC_EQUALITY_EXPRESSION,
1334 PREC_RELATIONAL_EXPRESSION,
1335 PREC_SHIFT_EXPRESSION,
1336 PREC_ADDITIVE_EXPRESSION,
1337 PREC_MULTIPLICATIVE_EXPRESSION,
1339 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1342 /* A mapping from a token type to a corresponding tree node type, with a
1343 precedence value. */
1345 typedef struct cp_parser_binary_operations_map_node
1347 /* The token type. */
1348 enum cpp_ttype token_type;
1349 /* The corresponding tree code. */
1350 enum tree_code tree_type;
1351 /* The precedence of this operator. */
1352 enum cp_parser_prec prec;
1353 } cp_parser_binary_operations_map_node;
1355 typedef struct cp_parser_expression_stack_entry
1357 /* Left hand side of the binary operation we are currently
1360 /* Original tree code for left hand side, if it was a binary
1361 expression itself (used for -Wparentheses). */
1362 enum tree_code lhs_type;
1363 /* Tree code for the binary operation we are parsing. */
1364 enum tree_code tree_type;
1365 /* Precedence of the binary operation we are parsing. */
1366 enum cp_parser_prec prec;
1367 } cp_parser_expression_stack_entry;
1369 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1370 entries because precedence levels on the stack are monotonically
1372 typedef struct cp_parser_expression_stack_entry
1373 cp_parser_expression_stack[NUM_PREC_VALUES];
1377 /* Constructors and destructors. */
1379 static cp_parser_context *cp_parser_context_new
1380 (cp_parser_context *);
1382 /* Class variables. */
1384 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1386 /* The operator-precedence table used by cp_parser_binary_expression.
1387 Transformed into an associative array (binops_by_token) by
1390 static const cp_parser_binary_operations_map_node binops[] = {
1391 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1392 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1394 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1395 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1396 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1398 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1399 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1401 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1402 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1404 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1405 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1406 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1407 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1409 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1410 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1412 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1414 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1416 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1418 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1420 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1423 /* The same as binops, but initialized by cp_parser_new so that
1424 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1426 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1428 /* Constructors and destructors. */
1430 /* Construct a new context. The context below this one on the stack
1431 is given by NEXT. */
1433 static cp_parser_context *
1434 cp_parser_context_new (cp_parser_context* next)
1436 cp_parser_context *context;
1438 /* Allocate the storage. */
1439 if (cp_parser_context_free_list != NULL)
1441 /* Pull the first entry from the free list. */
1442 context = cp_parser_context_free_list;
1443 cp_parser_context_free_list = context->next;
1444 memset (context, 0, sizeof (*context));
1447 context = ggc_alloc_cleared_cp_parser_context ();
1449 /* No errors have occurred yet in this context. */
1450 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1451 /* If this is not the bottommost context, copy information that we
1452 need from the previous context. */
1455 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1456 expression, then we are parsing one in this context, too. */
1457 context->object_type = next->object_type;
1458 /* Thread the stack. */
1459 context->next = next;
1465 /* Managing the unparsed function queues. */
1467 #define unparsed_funs_with_default_args \
1468 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_default_args
1469 #define unparsed_funs_with_definitions \
1470 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_definitions
1473 push_unparsed_function_queues (cp_parser *parser)
1475 VEC_safe_push (cp_unparsed_functions_entry, gc,
1476 parser->unparsed_queues, NULL);
1477 unparsed_funs_with_default_args = NULL;
1478 unparsed_funs_with_definitions = make_tree_vector ();
1482 pop_unparsed_function_queues (cp_parser *parser)
1484 release_tree_vector (unparsed_funs_with_definitions);
1485 VEC_pop (cp_unparsed_functions_entry, parser->unparsed_queues);
1490 /* Constructors and destructors. */
1492 static cp_parser *cp_parser_new
1495 /* Routines to parse various constructs.
1497 Those that return `tree' will return the error_mark_node (rather
1498 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1499 Sometimes, they will return an ordinary node if error-recovery was
1500 attempted, even though a parse error occurred. So, to check
1501 whether or not a parse error occurred, you should always use
1502 cp_parser_error_occurred. If the construct is optional (indicated
1503 either by an `_opt' in the name of the function that does the
1504 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1505 the construct is not present. */
1507 /* Lexical conventions [gram.lex] */
1509 static tree cp_parser_identifier
1511 static tree cp_parser_string_literal
1512 (cp_parser *, bool, bool);
1514 /* Basic concepts [gram.basic] */
1516 static bool cp_parser_translation_unit
1519 /* Expressions [gram.expr] */
1521 static tree cp_parser_primary_expression
1522 (cp_parser *, bool, bool, bool, cp_id_kind *);
1523 static tree cp_parser_id_expression
1524 (cp_parser *, bool, bool, bool *, bool, bool);
1525 static tree cp_parser_unqualified_id
1526 (cp_parser *, bool, bool, bool, bool);
1527 static tree cp_parser_nested_name_specifier_opt
1528 (cp_parser *, bool, bool, bool, bool);
1529 static tree cp_parser_nested_name_specifier
1530 (cp_parser *, bool, bool, bool, bool);
1531 static tree cp_parser_qualifying_entity
1532 (cp_parser *, bool, bool, bool, bool, bool);
1533 static tree cp_parser_postfix_expression
1534 (cp_parser *, bool, bool, bool, cp_id_kind *);
1535 static tree cp_parser_postfix_open_square_expression
1536 (cp_parser *, tree, bool);
1537 static tree cp_parser_postfix_dot_deref_expression
1538 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *, location_t);
1539 static VEC(tree,gc) *cp_parser_parenthesized_expression_list
1540 (cp_parser *, int, bool, bool, bool *);
1541 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1542 enum { non_attr = 0, normal_attr = 1, id_attr = 2 };
1543 static void cp_parser_pseudo_destructor_name
1544 (cp_parser *, tree *, tree *);
1545 static tree cp_parser_unary_expression
1546 (cp_parser *, bool, bool, cp_id_kind *);
1547 static enum tree_code cp_parser_unary_operator
1549 static tree cp_parser_new_expression
1551 static VEC(tree,gc) *cp_parser_new_placement
1553 static tree cp_parser_new_type_id
1554 (cp_parser *, tree *);
1555 static cp_declarator *cp_parser_new_declarator_opt
1557 static cp_declarator *cp_parser_direct_new_declarator
1559 static VEC(tree,gc) *cp_parser_new_initializer
1561 static tree cp_parser_delete_expression
1563 static tree cp_parser_cast_expression
1564 (cp_parser *, bool, bool, cp_id_kind *);
1565 static tree cp_parser_binary_expression
1566 (cp_parser *, bool, bool, enum cp_parser_prec, cp_id_kind *);
1567 static tree cp_parser_question_colon_clause
1568 (cp_parser *, tree);
1569 static tree cp_parser_assignment_expression
1570 (cp_parser *, bool, cp_id_kind *);
1571 static enum tree_code cp_parser_assignment_operator_opt
1573 static tree cp_parser_expression
1574 (cp_parser *, bool, cp_id_kind *);
1575 static tree cp_parser_constant_expression
1576 (cp_parser *, bool, bool *);
1577 static tree cp_parser_builtin_offsetof
1579 static tree cp_parser_lambda_expression
1581 static void cp_parser_lambda_introducer
1582 (cp_parser *, tree);
1583 static bool cp_parser_lambda_declarator_opt
1584 (cp_parser *, tree);
1585 static void cp_parser_lambda_body
1586 (cp_parser *, tree);
1588 /* Statements [gram.stmt.stmt] */
1590 static void cp_parser_statement
1591 (cp_parser *, tree, bool, bool *);
1592 static void cp_parser_label_for_labeled_statement
1594 static tree cp_parser_expression_statement
1595 (cp_parser *, tree);
1596 static tree cp_parser_compound_statement
1597 (cp_parser *, tree, bool, bool);
1598 static void cp_parser_statement_seq_opt
1599 (cp_parser *, tree);
1600 static tree cp_parser_selection_statement
1601 (cp_parser *, bool *);
1602 static tree cp_parser_condition
1604 static tree cp_parser_iteration_statement
1606 static bool cp_parser_for_init_statement
1607 (cp_parser *, tree *decl);
1608 static tree cp_parser_for
1610 static tree cp_parser_c_for
1611 (cp_parser *, tree, tree);
1612 static tree cp_parser_range_for
1613 (cp_parser *, tree, tree, tree);
1614 static tree cp_parser_perform_range_for_lookup
1615 (tree, tree *, tree *);
1616 static tree cp_parser_range_for_member_function
1618 static tree cp_parser_jump_statement
1620 static void cp_parser_declaration_statement
1623 static tree cp_parser_implicitly_scoped_statement
1624 (cp_parser *, bool *);
1625 static void cp_parser_already_scoped_statement
1628 /* Declarations [gram.dcl.dcl] */
1630 static void cp_parser_declaration_seq_opt
1632 static void cp_parser_declaration
1634 static void cp_parser_block_declaration
1635 (cp_parser *, bool);
1636 static void cp_parser_simple_declaration
1637 (cp_parser *, bool, tree *);
1638 static void cp_parser_decl_specifier_seq
1639 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1640 static tree cp_parser_storage_class_specifier_opt
1642 static tree cp_parser_function_specifier_opt
1643 (cp_parser *, cp_decl_specifier_seq *);
1644 static tree cp_parser_type_specifier
1645 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1647 static tree cp_parser_simple_type_specifier
1648 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1649 static tree cp_parser_type_name
1651 static tree cp_parser_nonclass_name
1652 (cp_parser* parser);
1653 static tree cp_parser_elaborated_type_specifier
1654 (cp_parser *, bool, bool);
1655 static tree cp_parser_enum_specifier
1657 static void cp_parser_enumerator_list
1658 (cp_parser *, tree);
1659 static void cp_parser_enumerator_definition
1660 (cp_parser *, tree);
1661 static tree cp_parser_namespace_name
1663 static void cp_parser_namespace_definition
1665 static void cp_parser_namespace_body
1667 static tree cp_parser_qualified_namespace_specifier
1669 static void cp_parser_namespace_alias_definition
1671 static bool cp_parser_using_declaration
1672 (cp_parser *, bool);
1673 static void cp_parser_using_directive
1675 static void cp_parser_asm_definition
1677 static void cp_parser_linkage_specification
1679 static void cp_parser_static_assert
1680 (cp_parser *, bool);
1681 static tree cp_parser_decltype
1684 /* Declarators [gram.dcl.decl] */
1686 static tree cp_parser_init_declarator
1687 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *, tree *);
1688 static cp_declarator *cp_parser_declarator
1689 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1690 static cp_declarator *cp_parser_direct_declarator
1691 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1692 static enum tree_code cp_parser_ptr_operator
1693 (cp_parser *, tree *, cp_cv_quals *);
1694 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1696 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1698 static tree cp_parser_late_return_type_opt
1700 static tree cp_parser_declarator_id
1701 (cp_parser *, bool);
1702 static tree cp_parser_type_id
1704 static tree cp_parser_template_type_arg
1706 static tree cp_parser_trailing_type_id (cp_parser *);
1707 static tree cp_parser_type_id_1
1708 (cp_parser *, bool, bool);
1709 static void cp_parser_type_specifier_seq
1710 (cp_parser *, bool, bool, cp_decl_specifier_seq *);
1711 static tree cp_parser_parameter_declaration_clause
1713 static tree cp_parser_parameter_declaration_list
1714 (cp_parser *, bool *);
1715 static cp_parameter_declarator *cp_parser_parameter_declaration
1716 (cp_parser *, bool, bool *);
1717 static tree cp_parser_default_argument
1718 (cp_parser *, bool);
1719 static void cp_parser_function_body
1721 static tree cp_parser_initializer
1722 (cp_parser *, bool *, bool *);
1723 static tree cp_parser_initializer_clause
1724 (cp_parser *, bool *);
1725 static tree cp_parser_braced_list
1726 (cp_parser*, bool*);
1727 static VEC(constructor_elt,gc) *cp_parser_initializer_list
1728 (cp_parser *, bool *);
1730 static bool cp_parser_ctor_initializer_opt_and_function_body
1733 /* Classes [gram.class] */
1735 static tree cp_parser_class_name
1736 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1737 static tree cp_parser_class_specifier
1739 static tree cp_parser_class_head
1740 (cp_parser *, bool *, tree *, tree *);
1741 static enum tag_types cp_parser_class_key
1743 static void cp_parser_member_specification_opt
1745 static void cp_parser_member_declaration
1747 static tree cp_parser_pure_specifier
1749 static tree cp_parser_constant_initializer
1752 /* Derived classes [gram.class.derived] */
1754 static tree cp_parser_base_clause
1756 static tree cp_parser_base_specifier
1759 /* Special member functions [gram.special] */
1761 static tree cp_parser_conversion_function_id
1763 static tree cp_parser_conversion_type_id
1765 static cp_declarator *cp_parser_conversion_declarator_opt
1767 static bool cp_parser_ctor_initializer_opt
1769 static void cp_parser_mem_initializer_list
1771 static tree cp_parser_mem_initializer
1773 static tree cp_parser_mem_initializer_id
1776 /* Overloading [gram.over] */
1778 static tree cp_parser_operator_function_id
1780 static tree cp_parser_operator
1783 /* Templates [gram.temp] */
1785 static void cp_parser_template_declaration
1786 (cp_parser *, bool);
1787 static tree cp_parser_template_parameter_list
1789 static tree cp_parser_template_parameter
1790 (cp_parser *, bool *, bool *);
1791 static tree cp_parser_type_parameter
1792 (cp_parser *, bool *);
1793 static tree cp_parser_template_id
1794 (cp_parser *, bool, bool, bool);
1795 static tree cp_parser_template_name
1796 (cp_parser *, bool, bool, bool, bool *);
1797 static tree cp_parser_template_argument_list
1799 static tree cp_parser_template_argument
1801 static void cp_parser_explicit_instantiation
1803 static void cp_parser_explicit_specialization
1806 /* Exception handling [gram.exception] */
1808 static tree cp_parser_try_block
1810 static bool cp_parser_function_try_block
1812 static void cp_parser_handler_seq
1814 static void cp_parser_handler
1816 static tree cp_parser_exception_declaration
1818 static tree cp_parser_throw_expression
1820 static tree cp_parser_exception_specification_opt
1822 static tree cp_parser_type_id_list
1825 /* GNU Extensions */
1827 static tree cp_parser_asm_specification_opt
1829 static tree cp_parser_asm_operand_list
1831 static tree cp_parser_asm_clobber_list
1833 static tree cp_parser_asm_label_list
1835 static tree cp_parser_attributes_opt
1837 static tree cp_parser_attribute_list
1839 static bool cp_parser_extension_opt
1840 (cp_parser *, int *);
1841 static void cp_parser_label_declaration
1844 enum pragma_context { pragma_external, pragma_stmt, pragma_compound };
1845 static bool cp_parser_pragma
1846 (cp_parser *, enum pragma_context);
1848 /* Objective-C++ Productions */
1850 static tree cp_parser_objc_message_receiver
1852 static tree cp_parser_objc_message_args
1854 static tree cp_parser_objc_message_expression
1856 static tree cp_parser_objc_encode_expression
1858 static tree cp_parser_objc_defs_expression
1860 static tree cp_parser_objc_protocol_expression
1862 static tree cp_parser_objc_selector_expression
1864 static tree cp_parser_objc_expression
1866 static bool cp_parser_objc_selector_p
1868 static tree cp_parser_objc_selector
1870 static tree cp_parser_objc_protocol_refs_opt
1872 static void cp_parser_objc_declaration
1873 (cp_parser *, tree);
1874 static tree cp_parser_objc_statement
1876 static bool cp_parser_objc_valid_prefix_attributes
1877 (cp_parser *, tree *);
1878 static void cp_parser_objc_at_property_declaration
1880 static void cp_parser_objc_at_synthesize_declaration
1882 static void cp_parser_objc_at_dynamic_declaration
1884 static tree cp_parser_objc_struct_declaration
1887 /* Utility Routines */
1889 static tree cp_parser_lookup_name
1890 (cp_parser *, tree, enum tag_types, bool, bool, bool, tree *, location_t);
1891 static tree cp_parser_lookup_name_simple
1892 (cp_parser *, tree, location_t);
1893 static tree cp_parser_maybe_treat_template_as_class
1895 static bool cp_parser_check_declarator_template_parameters
1896 (cp_parser *, cp_declarator *, location_t);
1897 static bool cp_parser_check_template_parameters
1898 (cp_parser *, unsigned, location_t, cp_declarator *);
1899 static tree cp_parser_simple_cast_expression
1901 static tree cp_parser_global_scope_opt
1902 (cp_parser *, bool);
1903 static bool cp_parser_constructor_declarator_p
1904 (cp_parser *, bool);
1905 static tree cp_parser_function_definition_from_specifiers_and_declarator
1906 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1907 static tree cp_parser_function_definition_after_declarator
1908 (cp_parser *, bool);
1909 static void cp_parser_template_declaration_after_export
1910 (cp_parser *, bool);
1911 static void cp_parser_perform_template_parameter_access_checks
1912 (VEC (deferred_access_check,gc)*);
1913 static tree cp_parser_single_declaration
1914 (cp_parser *, VEC (deferred_access_check,gc)*, bool, bool, bool *);
1915 static tree cp_parser_functional_cast
1916 (cp_parser *, tree);
1917 static tree cp_parser_save_member_function_body
1918 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1919 static tree cp_parser_enclosed_template_argument_list
1921 static void cp_parser_save_default_args
1922 (cp_parser *, tree);
1923 static void cp_parser_late_parsing_for_member
1924 (cp_parser *, tree);
1925 static void cp_parser_late_parsing_default_args
1926 (cp_parser *, tree);
1927 static tree cp_parser_sizeof_operand
1928 (cp_parser *, enum rid);
1929 static tree cp_parser_trait_expr
1930 (cp_parser *, enum rid);
1931 static bool cp_parser_declares_only_class_p
1933 static void cp_parser_set_storage_class
1934 (cp_parser *, cp_decl_specifier_seq *, enum rid, location_t);
1935 static void cp_parser_set_decl_spec_type
1936 (cp_decl_specifier_seq *, tree, location_t, bool);
1937 static bool cp_parser_friend_p
1938 (const cp_decl_specifier_seq *);
1939 static void cp_parser_required_error
1940 (cp_parser *, required_token, bool);
1941 static cp_token *cp_parser_require
1942 (cp_parser *, enum cpp_ttype, required_token);
1943 static cp_token *cp_parser_require_keyword
1944 (cp_parser *, enum rid, required_token);
1945 static bool cp_parser_token_starts_function_definition_p
1947 static bool cp_parser_next_token_starts_class_definition_p
1949 static bool cp_parser_next_token_ends_template_argument_p
1951 static bool cp_parser_nth_token_starts_template_argument_list_p
1952 (cp_parser *, size_t);
1953 static enum tag_types cp_parser_token_is_class_key
1955 static void cp_parser_check_class_key
1956 (enum tag_types, tree type);
1957 static void cp_parser_check_access_in_redeclaration
1958 (tree type, location_t location);
1959 static bool cp_parser_optional_template_keyword
1961 static void cp_parser_pre_parsed_nested_name_specifier
1963 static bool cp_parser_cache_group
1964 (cp_parser *, enum cpp_ttype, unsigned);
1965 static void cp_parser_parse_tentatively
1967 static void cp_parser_commit_to_tentative_parse
1969 static void cp_parser_abort_tentative_parse
1971 static bool cp_parser_parse_definitely
1973 static inline bool cp_parser_parsing_tentatively
1975 static bool cp_parser_uncommitted_to_tentative_parse_p
1977 static void cp_parser_error
1978 (cp_parser *, const char *);
1979 static void cp_parser_name_lookup_error
1980 (cp_parser *, tree, tree, name_lookup_error, location_t);
1981 static bool cp_parser_simulate_error
1983 static bool cp_parser_check_type_definition
1985 static void cp_parser_check_for_definition_in_return_type
1986 (cp_declarator *, tree, location_t type_location);
1987 static void cp_parser_check_for_invalid_template_id
1988 (cp_parser *, tree, location_t location);
1989 static bool cp_parser_non_integral_constant_expression
1990 (cp_parser *, non_integral_constant);
1991 static void cp_parser_diagnose_invalid_type_name
1992 (cp_parser *, tree, tree, location_t);
1993 static bool cp_parser_parse_and_diagnose_invalid_type_name
1995 static int cp_parser_skip_to_closing_parenthesis
1996 (cp_parser *, bool, bool, bool);
1997 static void cp_parser_skip_to_end_of_statement
1999 static void cp_parser_consume_semicolon_at_end_of_statement
2001 static void cp_parser_skip_to_end_of_block_or_statement
2003 static bool cp_parser_skip_to_closing_brace
2005 static void cp_parser_skip_to_end_of_template_parameter_list
2007 static void cp_parser_skip_to_pragma_eol
2008 (cp_parser*, cp_token *);
2009 static bool cp_parser_error_occurred
2011 static bool cp_parser_allow_gnu_extensions_p
2013 static bool cp_parser_is_string_literal
2015 static bool cp_parser_is_keyword
2016 (cp_token *, enum rid);
2017 static tree cp_parser_make_typename_type
2018 (cp_parser *, tree, tree, location_t location);
2019 static cp_declarator * cp_parser_make_indirect_declarator
2020 (enum tree_code, tree, cp_cv_quals, cp_declarator *);
2022 /* Returns nonzero if we are parsing tentatively. */
2025 cp_parser_parsing_tentatively (cp_parser* parser)
2027 return parser->context->next != NULL;
2030 /* Returns nonzero if TOKEN is a string literal. */
2033 cp_parser_is_string_literal (cp_token* token)
2035 return (token->type == CPP_STRING ||
2036 token->type == CPP_STRING16 ||
2037 token->type == CPP_STRING32 ||
2038 token->type == CPP_WSTRING ||
2039 token->type == CPP_UTF8STRING);
2042 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2045 cp_parser_is_keyword (cp_token* token, enum rid keyword)
2047 return token->keyword == keyword;
2050 /* If not parsing tentatively, issue a diagnostic of the form
2051 FILE:LINE: MESSAGE before TOKEN
2052 where TOKEN is the next token in the input stream. MESSAGE
2053 (specified by the caller) is usually of the form "expected
2057 cp_parser_error (cp_parser* parser, const char* gmsgid)
2059 if (!cp_parser_simulate_error (parser))
2061 cp_token *token = cp_lexer_peek_token (parser->lexer);
2062 /* This diagnostic makes more sense if it is tagged to the line
2063 of the token we just peeked at. */
2064 cp_lexer_set_source_position_from_token (token);
2066 if (token->type == CPP_PRAGMA)
2068 error_at (token->location,
2069 "%<#pragma%> is not allowed here");
2070 cp_parser_skip_to_pragma_eol (parser, token);
2074 c_parse_error (gmsgid,
2075 /* Because c_parser_error does not understand
2076 CPP_KEYWORD, keywords are treated like
2078 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
2079 token->u.value, token->flags);
2083 /* Issue an error about name-lookup failing. NAME is the
2084 IDENTIFIER_NODE DECL is the result of
2085 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2086 the thing that we hoped to find. */
2089 cp_parser_name_lookup_error (cp_parser* parser,
2092 name_lookup_error desired,
2093 location_t location)
2095 /* If name lookup completely failed, tell the user that NAME was not
2097 if (decl == error_mark_node)
2099 if (parser->scope && parser->scope != global_namespace)
2100 error_at (location, "%<%E::%E%> has not been declared",
2101 parser->scope, name);
2102 else if (parser->scope == global_namespace)
2103 error_at (location, "%<::%E%> has not been declared", name);
2104 else if (parser->object_scope
2105 && !CLASS_TYPE_P (parser->object_scope))
2106 error_at (location, "request for member %qE in non-class type %qT",
2107 name, parser->object_scope);
2108 else if (parser->object_scope)
2109 error_at (location, "%<%T::%E%> has not been declared",
2110 parser->object_scope, name);
2112 error_at (location, "%qE has not been declared", name);
2114 else if (parser->scope && parser->scope != global_namespace)
2119 error_at (location, "%<%E::%E%> is not a type",
2120 parser->scope, name);
2123 error_at (location, "%<%E::%E%> is not a class or namespace",
2124 parser->scope, name);
2128 "%<%E::%E%> is not a class, namespace, or enumeration",
2129 parser->scope, name);
2136 else if (parser->scope == global_namespace)
2141 error_at (location, "%<::%E%> is not a type", name);
2144 error_at (location, "%<::%E%> is not a class or namespace", name);
2148 "%<::%E%> is not a class, namespace, or enumeration",
2160 error_at (location, "%qE is not a type", name);
2163 error_at (location, "%qE is not a class or namespace", name);
2167 "%qE is not a class, namespace, or enumeration", name);
2175 /* If we are parsing tentatively, remember that an error has occurred
2176 during this tentative parse. Returns true if the error was
2177 simulated; false if a message should be issued by the caller. */
2180 cp_parser_simulate_error (cp_parser* parser)
2182 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2184 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2190 /* Check for repeated decl-specifiers. */
2193 cp_parser_check_decl_spec (cp_decl_specifier_seq *decl_specs,
2194 location_t location)
2198 for (ds = ds_first; ds != ds_last; ++ds)
2200 unsigned count = decl_specs->specs[ds];
2203 /* The "long" specifier is a special case because of "long long". */
2207 error_at (location, "%<long long long%> is too long for GCC");
2209 pedwarn_cxx98 (location, OPT_Wlong_long,
2210 "ISO C++ 1998 does not support %<long long%>");
2214 static const char *const decl_spec_names[] = {
2231 error_at (location, "duplicate %qs", decl_spec_names[ds]);
2236 /* This function is called when a type is defined. If type
2237 definitions are forbidden at this point, an error message is
2241 cp_parser_check_type_definition (cp_parser* parser)
2243 /* If types are forbidden here, issue a message. */
2244 if (parser->type_definition_forbidden_message)
2246 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2247 in the message need to be interpreted. */
2248 error (parser->type_definition_forbidden_message);
2254 /* This function is called when the DECLARATOR is processed. The TYPE
2255 was a type defined in the decl-specifiers. If it is invalid to
2256 define a type in the decl-specifiers for DECLARATOR, an error is
2257 issued. TYPE_LOCATION is the location of TYPE and is used
2258 for error reporting. */
2261 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2262 tree type, location_t type_location)
2264 /* [dcl.fct] forbids type definitions in return types.
2265 Unfortunately, it's not easy to know whether or not we are
2266 processing a return type until after the fact. */
2268 && (declarator->kind == cdk_pointer
2269 || declarator->kind == cdk_reference
2270 || declarator->kind == cdk_ptrmem))
2271 declarator = declarator->declarator;
2273 && declarator->kind == cdk_function)
2275 error_at (type_location,
2276 "new types may not be defined in a return type");
2277 inform (type_location,
2278 "(perhaps a semicolon is missing after the definition of %qT)",
2283 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2284 "<" in any valid C++ program. If the next token is indeed "<",
2285 issue a message warning the user about what appears to be an
2286 invalid attempt to form a template-id. LOCATION is the location
2287 of the type-specifier (TYPE) */
2290 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2291 tree type, location_t location)
2293 cp_token_position start = 0;
2295 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2298 error_at (location, "%qT is not a template", type);
2299 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2300 error_at (location, "%qE is not a template", type);
2302 error_at (location, "invalid template-id");
2303 /* Remember the location of the invalid "<". */
2304 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2305 start = cp_lexer_token_position (parser->lexer, true);
2306 /* Consume the "<". */
2307 cp_lexer_consume_token (parser->lexer);
2308 /* Parse the template arguments. */
2309 cp_parser_enclosed_template_argument_list (parser);
2310 /* Permanently remove the invalid template arguments so that
2311 this error message is not issued again. */
2313 cp_lexer_purge_tokens_after (parser->lexer, start);
2317 /* If parsing an integral constant-expression, issue an error message
2318 about the fact that THING appeared and return true. Otherwise,
2319 return false. In either case, set
2320 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2323 cp_parser_non_integral_constant_expression (cp_parser *parser,
2324 non_integral_constant thing)
2326 parser->non_integral_constant_expression_p = true;
2327 if (parser->integral_constant_expression_p)
2329 if (!parser->allow_non_integral_constant_expression_p)
2331 const char *msg = NULL;
2335 error ("floating-point literal "
2336 "cannot appear in a constant-expression");
2339 error ("a cast to a type other than an integral or "
2340 "enumeration type cannot appear in a "
2341 "constant-expression");
2344 error ("%<typeid%> operator "
2345 "cannot appear in a constant-expression");
2348 error ("non-constant compound literals "
2349 "cannot appear in a constant-expression");
2352 error ("a function call "
2353 "cannot appear in a constant-expression");
2356 error ("an increment "
2357 "cannot appear in a constant-expression");
2360 error ("an decrement "
2361 "cannot appear in a constant-expression");
2364 error ("an array reference "
2365 "cannot appear in a constant-expression");
2367 case NIC_ADDR_LABEL:
2368 error ("the address of a label "
2369 "cannot appear in a constant-expression");
2371 case NIC_OVERLOADED:
2372 error ("calls to overloaded operators "
2373 "cannot appear in a constant-expression");
2375 case NIC_ASSIGNMENT:
2376 error ("an assignment cannot appear in a constant-expression");
2379 error ("a comma operator "
2380 "cannot appear in a constant-expression");
2382 case NIC_CONSTRUCTOR:
2383 error ("a call to a constructor "
2384 "cannot appear in a constant-expression");
2390 msg = "__FUNCTION__";
2392 case NIC_PRETTY_FUNC:
2393 msg = "__PRETTY_FUNCTION__";
2413 case NIC_PREINCREMENT:
2416 case NIC_PREDECREMENT:
2429 error ("%qs cannot appear in a constant-expression", msg);
2436 /* Emit a diagnostic for an invalid type name. SCOPE is the
2437 qualifying scope (or NULL, if none) for ID. This function commits
2438 to the current active tentative parse, if any. (Otherwise, the
2439 problematic construct might be encountered again later, resulting
2440 in duplicate error messages.) LOCATION is the location of ID. */
2443 cp_parser_diagnose_invalid_type_name (cp_parser *parser,
2444 tree scope, tree id,
2445 location_t location)
2447 tree decl, old_scope;
2448 cp_parser_commit_to_tentative_parse (parser);
2449 /* Try to lookup the identifier. */
2450 old_scope = parser->scope;
2451 parser->scope = scope;
2452 decl = cp_parser_lookup_name_simple (parser, id, location);
2453 parser->scope = old_scope;
2454 /* If the lookup found a template-name, it means that the user forgot
2455 to specify an argument list. Emit a useful error message. */
2456 if (TREE_CODE (decl) == TEMPLATE_DECL)
2458 "invalid use of template-name %qE without an argument list",
2460 else if (TREE_CODE (id) == BIT_NOT_EXPR)
2461 error_at (location, "invalid use of destructor %qD as a type", id);
2462 else if (TREE_CODE (decl) == TYPE_DECL)
2463 /* Something like 'unsigned A a;' */
2464 error_at (location, "invalid combination of multiple type-specifiers");
2465 else if (!parser->scope)
2467 /* Issue an error message. */
2468 error_at (location, "%qE does not name a type", id);
2469 /* If we're in a template class, it's possible that the user was
2470 referring to a type from a base class. For example:
2472 template <typename T> struct A { typedef T X; };
2473 template <typename T> struct B : public A<T> { X x; };
2475 The user should have said "typename A<T>::X". */
2476 if (cxx_dialect < cxx0x && id == ridpointers[(int)RID_CONSTEXPR])
2477 inform (location, "C++0x %<constexpr%> only available with "
2478 "-std=c++0x or -std=gnu++0x");
2479 else if (processing_template_decl && current_class_type
2480 && TYPE_BINFO (current_class_type))
2484 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2488 tree base_type = BINFO_TYPE (b);
2489 if (CLASS_TYPE_P (base_type)
2490 && dependent_type_p (base_type))
2493 /* Go from a particular instantiation of the
2494 template (which will have an empty TYPE_FIELDs),
2495 to the main version. */
2496 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2497 for (field = TYPE_FIELDS (base_type);
2499 field = DECL_CHAIN (field))
2500 if (TREE_CODE (field) == TYPE_DECL
2501 && DECL_NAME (field) == id)
2504 "(perhaps %<typename %T::%E%> was intended)",
2505 BINFO_TYPE (b), id);
2514 /* Here we diagnose qualified-ids where the scope is actually correct,
2515 but the identifier does not resolve to a valid type name. */
2516 else if (parser->scope != error_mark_node)
2518 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2519 error_at (location, "%qE in namespace %qE does not name a type",
2521 else if (CLASS_TYPE_P (parser->scope)
2522 && constructor_name_p (id, parser->scope))
2525 error_at (location, "%<%T::%E%> names the constructor, not"
2526 " the type", parser->scope, id);
2527 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2528 error_at (location, "and %qT has no template constructors",
2531 else if (TYPE_P (parser->scope)
2532 && dependent_scope_p (parser->scope))
2533 error_at (location, "need %<typename%> before %<%T::%E%> because "
2534 "%qT is a dependent scope",
2535 parser->scope, id, parser->scope);
2536 else if (TYPE_P (parser->scope))
2537 error_at (location, "%qE in %q#T does not name a type",
2544 /* Check for a common situation where a type-name should be present,
2545 but is not, and issue a sensible error message. Returns true if an
2546 invalid type-name was detected.
2548 The situation handled by this function are variable declarations of the
2549 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2550 Usually, `ID' should name a type, but if we got here it means that it
2551 does not. We try to emit the best possible error message depending on
2552 how exactly the id-expression looks like. */
2555 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2558 cp_token *token = cp_lexer_peek_token (parser->lexer);
2560 /* Avoid duplicate error about ambiguous lookup. */
2561 if (token->type == CPP_NESTED_NAME_SPECIFIER)
2563 cp_token *next = cp_lexer_peek_nth_token (parser->lexer, 2);
2564 if (next->type == CPP_NAME && next->ambiguous_p)
2568 cp_parser_parse_tentatively (parser);
2569 id = cp_parser_id_expression (parser,
2570 /*template_keyword_p=*/false,
2571 /*check_dependency_p=*/true,
2572 /*template_p=*/NULL,
2573 /*declarator_p=*/true,
2574 /*optional_p=*/false);
2575 /* If the next token is a (, this is a function with no explicit return
2576 type, i.e. constructor, destructor or conversion op. */
2577 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
2578 || TREE_CODE (id) == TYPE_DECL)
2580 cp_parser_abort_tentative_parse (parser);
2583 if (!cp_parser_parse_definitely (parser))
2586 /* Emit a diagnostic for the invalid type. */
2587 cp_parser_diagnose_invalid_type_name (parser, parser->scope,
2588 id, token->location);
2590 /* If we aren't in the middle of a declarator (i.e. in a
2591 parameter-declaration-clause), skip to the end of the declaration;
2592 there's no point in trying to process it. */
2593 if (!parser->in_declarator_p)
2594 cp_parser_skip_to_end_of_block_or_statement (parser);
2598 /* Consume tokens up to, and including, the next non-nested closing `)'.
2599 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2600 are doing error recovery. Returns -1 if OR_COMMA is true and we
2601 found an unnested comma. */
2604 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2609 unsigned paren_depth = 0;
2610 unsigned brace_depth = 0;
2611 unsigned square_depth = 0;
2613 if (recovering && !or_comma
2614 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2619 cp_token * token = cp_lexer_peek_token (parser->lexer);
2621 switch (token->type)
2624 case CPP_PRAGMA_EOL:
2625 /* If we've run out of tokens, then there is no closing `)'. */
2628 /* This is good for lambda expression capture-lists. */
2629 case CPP_OPEN_SQUARE:
2632 case CPP_CLOSE_SQUARE:
2633 if (!square_depth--)
2638 /* This matches the processing in skip_to_end_of_statement. */
2643 case CPP_OPEN_BRACE:
2646 case CPP_CLOSE_BRACE:
2652 if (recovering && or_comma && !brace_depth && !paren_depth
2657 case CPP_OPEN_PAREN:
2662 case CPP_CLOSE_PAREN:
2663 if (!brace_depth && !paren_depth--)
2666 cp_lexer_consume_token (parser->lexer);
2675 /* Consume the token. */
2676 cp_lexer_consume_token (parser->lexer);
2680 /* Consume tokens until we reach the end of the current statement.
2681 Normally, that will be just before consuming a `;'. However, if a
2682 non-nested `}' comes first, then we stop before consuming that. */
2685 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2687 unsigned nesting_depth = 0;
2691 cp_token *token = cp_lexer_peek_token (parser->lexer);
2693 switch (token->type)
2696 case CPP_PRAGMA_EOL:
2697 /* If we've run out of tokens, stop. */
2701 /* If the next token is a `;', we have reached the end of the
2707 case CPP_CLOSE_BRACE:
2708 /* If this is a non-nested '}', stop before consuming it.
2709 That way, when confronted with something like:
2713 we stop before consuming the closing '}', even though we
2714 have not yet reached a `;'. */
2715 if (nesting_depth == 0)
2718 /* If it is the closing '}' for a block that we have
2719 scanned, stop -- but only after consuming the token.
2725 we will stop after the body of the erroneously declared
2726 function, but before consuming the following `typedef'
2728 if (--nesting_depth == 0)
2730 cp_lexer_consume_token (parser->lexer);
2734 case CPP_OPEN_BRACE:
2742 /* Consume the token. */
2743 cp_lexer_consume_token (parser->lexer);
2747 /* This function is called at the end of a statement or declaration.
2748 If the next token is a semicolon, it is consumed; otherwise, error
2749 recovery is attempted. */
2752 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2754 /* Look for the trailing `;'. */
2755 if (!cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON))
2757 /* If there is additional (erroneous) input, skip to the end of
2759 cp_parser_skip_to_end_of_statement (parser);
2760 /* If the next token is now a `;', consume it. */
2761 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2762 cp_lexer_consume_token (parser->lexer);
2766 /* Skip tokens until we have consumed an entire block, or until we
2767 have consumed a non-nested `;'. */
2770 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2772 int nesting_depth = 0;
2774 while (nesting_depth >= 0)
2776 cp_token *token = cp_lexer_peek_token (parser->lexer);
2778 switch (token->type)
2781 case CPP_PRAGMA_EOL:
2782 /* If we've run out of tokens, stop. */
2786 /* Stop if this is an unnested ';'. */
2791 case CPP_CLOSE_BRACE:
2792 /* Stop if this is an unnested '}', or closes the outermost
2795 if (nesting_depth < 0)
2801 case CPP_OPEN_BRACE:
2810 /* Consume the token. */
2811 cp_lexer_consume_token (parser->lexer);
2815 /* Skip tokens until a non-nested closing curly brace is the next
2816 token, or there are no more tokens. Return true in the first case,
2820 cp_parser_skip_to_closing_brace (cp_parser *parser)
2822 unsigned nesting_depth = 0;
2826 cp_token *token = cp_lexer_peek_token (parser->lexer);
2828 switch (token->type)
2831 case CPP_PRAGMA_EOL:
2832 /* If we've run out of tokens, stop. */
2835 case CPP_CLOSE_BRACE:
2836 /* If the next token is a non-nested `}', then we have reached
2837 the end of the current block. */
2838 if (nesting_depth-- == 0)
2842 case CPP_OPEN_BRACE:
2843 /* If it the next token is a `{', then we are entering a new
2844 block. Consume the entire block. */
2852 /* Consume the token. */
2853 cp_lexer_consume_token (parser->lexer);
2857 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
2858 parameter is the PRAGMA token, allowing us to purge the entire pragma
2862 cp_parser_skip_to_pragma_eol (cp_parser* parser, cp_token *pragma_tok)
2866 parser->lexer->in_pragma = false;
2869 token = cp_lexer_consume_token (parser->lexer);
2870 while (token->type != CPP_PRAGMA_EOL && token->type != CPP_EOF);
2872 /* Ensure that the pragma is not parsed again. */
2873 cp_lexer_purge_tokens_after (parser->lexer, pragma_tok);
2876 /* Require pragma end of line, resyncing with it as necessary. The
2877 arguments are as for cp_parser_skip_to_pragma_eol. */
2880 cp_parser_require_pragma_eol (cp_parser *parser, cp_token *pragma_tok)
2882 parser->lexer->in_pragma = false;
2883 if (!cp_parser_require (parser, CPP_PRAGMA_EOL, RT_PRAGMA_EOL))
2884 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
2887 /* This is a simple wrapper around make_typename_type. When the id is
2888 an unresolved identifier node, we can provide a superior diagnostic
2889 using cp_parser_diagnose_invalid_type_name. */
2892 cp_parser_make_typename_type (cp_parser *parser, tree scope,
2893 tree id, location_t id_location)
2896 if (TREE_CODE (id) == IDENTIFIER_NODE)
2898 result = make_typename_type (scope, id, typename_type,
2899 /*complain=*/tf_none);
2900 if (result == error_mark_node)
2901 cp_parser_diagnose_invalid_type_name (parser, scope, id, id_location);
2904 return make_typename_type (scope, id, typename_type, tf_error);
2907 /* This is a wrapper around the
2908 make_{pointer,ptrmem,reference}_declarator functions that decides
2909 which one to call based on the CODE and CLASS_TYPE arguments. The
2910 CODE argument should be one of the values returned by
2911 cp_parser_ptr_operator. */
2912 static cp_declarator *
2913 cp_parser_make_indirect_declarator (enum tree_code code, tree class_type,
2914 cp_cv_quals cv_qualifiers,
2915 cp_declarator *target)
2917 if (code == ERROR_MARK)
2918 return cp_error_declarator;
2920 if (code == INDIRECT_REF)
2921 if (class_type == NULL_TREE)
2922 return make_pointer_declarator (cv_qualifiers, target);
2924 return make_ptrmem_declarator (cv_qualifiers, class_type, target);
2925 else if (code == ADDR_EXPR && class_type == NULL_TREE)
2926 return make_reference_declarator (cv_qualifiers, target, false);
2927 else if (code == NON_LVALUE_EXPR && class_type == NULL_TREE)
2928 return make_reference_declarator (cv_qualifiers, target, true);
2932 /* Create a new C++ parser. */
2935 cp_parser_new (void)
2941 /* cp_lexer_new_main is called before doing GC allocation because
2942 cp_lexer_new_main might load a PCH file. */
2943 lexer = cp_lexer_new_main ();
2945 /* Initialize the binops_by_token so that we can get the tree
2946 directly from the token. */
2947 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2948 binops_by_token[binops[i].token_type] = binops[i];
2950 parser = ggc_alloc_cleared_cp_parser ();
2951 parser->lexer = lexer;
2952 parser->context = cp_parser_context_new (NULL);
2954 /* For now, we always accept GNU extensions. */
2955 parser->allow_gnu_extensions_p = 1;
2957 /* The `>' token is a greater-than operator, not the end of a
2959 parser->greater_than_is_operator_p = true;
2961 parser->default_arg_ok_p = true;
2963 /* We are not parsing a constant-expression. */
2964 parser->integral_constant_expression_p = false;
2965 parser->allow_non_integral_constant_expression_p = false;
2966 parser->non_integral_constant_expression_p = false;
2968 /* Local variable names are not forbidden. */
2969 parser->local_variables_forbidden_p = false;
2971 /* We are not processing an `extern "C"' declaration. */
2972 parser->in_unbraced_linkage_specification_p = false;
2974 /* We are not processing a declarator. */
2975 parser->in_declarator_p = false;
2977 /* We are not processing a template-argument-list. */
2978 parser->in_template_argument_list_p = false;
2980 /* We are not in an iteration statement. */
2981 parser->in_statement = 0;
2983 /* We are not in a switch statement. */
2984 parser->in_switch_statement_p = false;
2986 /* We are not parsing a type-id inside an expression. */
2987 parser->in_type_id_in_expr_p = false;
2989 /* Declarations aren't implicitly extern "C". */
2990 parser->implicit_extern_c = false;
2992 /* String literals should be translated to the execution character set. */
2993 parser->translate_strings_p = true;
2995 /* We are not parsing a function body. */
2996 parser->in_function_body = false;
2998 /* We can correct until told otherwise. */
2999 parser->colon_corrects_to_scope_p = true;
3001 /* The unparsed function queue is empty. */
3002 push_unparsed_function_queues (parser);
3004 /* There are no classes being defined. */
3005 parser->num_classes_being_defined = 0;
3007 /* No template parameters apply. */
3008 parser->num_template_parameter_lists = 0;
3013 /* Create a cp_lexer structure which will emit the tokens in CACHE
3014 and push it onto the parser's lexer stack. This is used for delayed
3015 parsing of in-class method bodies and default arguments, and should
3016 not be confused with tentative parsing. */
3018 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
3020 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
3021 lexer->next = parser->lexer;
3022 parser->lexer = lexer;
3024 /* Move the current source position to that of the first token in the
3026 cp_lexer_set_source_position_from_token (lexer->next_token);
3029 /* Pop the top lexer off the parser stack. This is never used for the
3030 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3032 cp_parser_pop_lexer (cp_parser *parser)
3034 cp_lexer *lexer = parser->lexer;
3035 parser->lexer = lexer->next;
3036 cp_lexer_destroy (lexer);
3038 /* Put the current source position back where it was before this
3039 lexer was pushed. */
3040 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
3043 /* Lexical conventions [gram.lex] */
3045 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3049 cp_parser_identifier (cp_parser* parser)
3053 /* Look for the identifier. */
3054 token = cp_parser_require (parser, CPP_NAME, RT_NAME);
3055 /* Return the value. */
3056 return token ? token->u.value : error_mark_node;
3059 /* Parse a sequence of adjacent string constants. Returns a
3060 TREE_STRING representing the combined, nul-terminated string
3061 constant. If TRANSLATE is true, translate the string to the
3062 execution character set. If WIDE_OK is true, a wide string is
3065 C++98 [lex.string] says that if a narrow string literal token is
3066 adjacent to a wide string literal token, the behavior is undefined.
3067 However, C99 6.4.5p4 says that this results in a wide string literal.
3068 We follow C99 here, for consistency with the C front end.
3070 This code is largely lifted from lex_string() in c-lex.c.
3072 FUTURE: ObjC++ will need to handle @-strings here. */
3074 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
3078 struct obstack str_ob;
3079 cpp_string str, istr, *strs;
3081 enum cpp_ttype type;
3083 tok = cp_lexer_peek_token (parser->lexer);
3084 if (!cp_parser_is_string_literal (tok))
3086 cp_parser_error (parser, "expected string-literal");
3087 return error_mark_node;
3092 /* Try to avoid the overhead of creating and destroying an obstack
3093 for the common case of just one string. */
3094 if (!cp_parser_is_string_literal
3095 (cp_lexer_peek_nth_token (parser->lexer, 2)))
3097 cp_lexer_consume_token (parser->lexer);
3099 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->u.value);
3100 str.len = TREE_STRING_LENGTH (tok->u.value);
3107 gcc_obstack_init (&str_ob);
3112 cp_lexer_consume_token (parser->lexer);
3114 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->u.value);
3115 str.len = TREE_STRING_LENGTH (tok->u.value);
3117 if (type != tok->type)
3119 if (type == CPP_STRING)
3121 else if (tok->type != CPP_STRING)
3122 error_at (tok->location,
3123 "unsupported non-standard concatenation "
3124 "of string literals");
3127 obstack_grow (&str_ob, &str, sizeof (cpp_string));
3129 tok = cp_lexer_peek_token (parser->lexer);
3131 while (cp_parser_is_string_literal (tok));
3133 strs = (cpp_string *) obstack_finish (&str_ob);
3136 if (type != CPP_STRING && !wide_ok)
3138 cp_parser_error (parser, "a wide string is invalid in this context");
3142 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
3143 (parse_in, strs, count, &istr, type))
3145 value = build_string (istr.len, (const char *)istr.text);
3146 free (CONST_CAST (unsigned char *, istr.text));
3152 case CPP_UTF8STRING:
3153 TREE_TYPE (value) = char_array_type_node;
3156 TREE_TYPE (value) = char16_array_type_node;
3159 TREE_TYPE (value) = char32_array_type_node;
3162 TREE_TYPE (value) = wchar_array_type_node;
3166 value = fix_string_type (value);
3169 /* cpp_interpret_string has issued an error. */
3170 value = error_mark_node;
3173 obstack_free (&str_ob, 0);
3179 /* Basic concepts [gram.basic] */
3181 /* Parse a translation-unit.
3184 declaration-seq [opt]
3186 Returns TRUE if all went well. */
3189 cp_parser_translation_unit (cp_parser* parser)
3191 /* The address of the first non-permanent object on the declarator
3193 static void *declarator_obstack_base;
3197 /* Create the declarator obstack, if necessary. */
3198 if (!cp_error_declarator)
3200 gcc_obstack_init (&declarator_obstack);
3201 /* Create the error declarator. */
3202 cp_error_declarator = make_declarator (cdk_error);
3203 /* Create the empty parameter list. */
3204 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
3205 /* Remember where the base of the declarator obstack lies. */
3206 declarator_obstack_base = obstack_next_free (&declarator_obstack);
3209 cp_parser_declaration_seq_opt (parser);
3211 /* If there are no tokens left then all went well. */
3212 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
3214 /* Get rid of the token array; we don't need it any more. */
3215 cp_lexer_destroy (parser->lexer);
3216 parser->lexer = NULL;
3218 /* This file might have been a context that's implicitly extern
3219 "C". If so, pop the lang context. (Only relevant for PCH.) */
3220 if (parser->implicit_extern_c)
3222 pop_lang_context ();
3223 parser->implicit_extern_c = false;
3227 finish_translation_unit ();
3233 cp_parser_error (parser, "expected declaration");
3237 /* Make sure the declarator obstack was fully cleaned up. */
3238 gcc_assert (obstack_next_free (&declarator_obstack)
3239 == declarator_obstack_base);
3241 /* All went well. */
3245 /* Expressions [gram.expr] */
3247 /* Parse a primary-expression.
3258 ( compound-statement )
3259 __builtin_va_arg ( assignment-expression , type-id )
3260 __builtin_offsetof ( type-id , offsetof-expression )
3263 __has_nothrow_assign ( type-id )
3264 __has_nothrow_constructor ( type-id )
3265 __has_nothrow_copy ( type-id )
3266 __has_trivial_assign ( type-id )
3267 __has_trivial_constructor ( type-id )
3268 __has_trivial_copy ( type-id )
3269 __has_trivial_destructor ( type-id )
3270 __has_virtual_destructor ( type-id )
3271 __is_abstract ( type-id )
3272 __is_base_of ( type-id , type-id )
3273 __is_class ( type-id )
3274 __is_convertible_to ( type-id , type-id )
3275 __is_empty ( type-id )
3276 __is_enum ( type-id )
3277 __is_literal_type ( type-id )
3278 __is_pod ( type-id )
3279 __is_polymorphic ( type-id )
3280 __is_std_layout ( type-id )
3281 __is_trivial ( type-id )
3282 __is_union ( type-id )
3284 Objective-C++ Extension:
3292 ADDRESS_P is true iff this expression was immediately preceded by
3293 "&" and therefore might denote a pointer-to-member. CAST_P is true
3294 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3295 true iff this expression is a template argument.
3297 Returns a representation of the expression. Upon return, *IDK
3298 indicates what kind of id-expression (if any) was present. */
3301 cp_parser_primary_expression (cp_parser *parser,
3304 bool template_arg_p,
3307 cp_token *token = NULL;
3309 /* Assume the primary expression is not an id-expression. */
3310 *idk = CP_ID_KIND_NONE;
3312 /* Peek at the next token. */
3313 token = cp_lexer_peek_token (parser->lexer);
3314 switch (token->type)
3327 token = cp_lexer_consume_token (parser->lexer);
3328 if (TREE_CODE (token->u.value) == FIXED_CST)
3330 error_at (token->location,
3331 "fixed-point types not supported in C++");
3332 return error_mark_node;
3334 /* Floating-point literals are only allowed in an integral
3335 constant expression if they are cast to an integral or
3336 enumeration type. */
3337 if (TREE_CODE (token->u.value) == REAL_CST
3338 && parser->integral_constant_expression_p
3341 /* CAST_P will be set even in invalid code like "int(2.7 +
3342 ...)". Therefore, we have to check that the next token
3343 is sure to end the cast. */
3346 cp_token *next_token;
3348 next_token = cp_lexer_peek_token (parser->lexer);
3349 if (/* The comma at the end of an
3350 enumerator-definition. */
3351 next_token->type != CPP_COMMA
3352 /* The curly brace at the end of an enum-specifier. */
3353 && next_token->type != CPP_CLOSE_BRACE
3354 /* The end of a statement. */
3355 && next_token->type != CPP_SEMICOLON
3356 /* The end of the cast-expression. */
3357 && next_token->type != CPP_CLOSE_PAREN
3358 /* The end of an array bound. */
3359 && next_token->type != CPP_CLOSE_SQUARE
3360 /* The closing ">" in a template-argument-list. */
3361 && (next_token->type != CPP_GREATER
3362 || parser->greater_than_is_operator_p)
3363 /* C++0x only: A ">>" treated like two ">" tokens,
3364 in a template-argument-list. */
3365 && (next_token->type != CPP_RSHIFT
3366 || (cxx_dialect == cxx98)
3367 || parser->greater_than_is_operator_p))
3371 /* If we are within a cast, then the constraint that the
3372 cast is to an integral or enumeration type will be
3373 checked at that point. If we are not within a cast, then
3374 this code is invalid. */
3376 cp_parser_non_integral_constant_expression (parser, NIC_FLOAT);
3378 return token->u.value;
3384 case CPP_UTF8STRING:
3385 /* ??? Should wide strings be allowed when parser->translate_strings_p
3386 is false (i.e. in attributes)? If not, we can kill the third
3387 argument to cp_parser_string_literal. */
3388 return cp_parser_string_literal (parser,
3389 parser->translate_strings_p,
3392 case CPP_OPEN_PAREN:
3395 bool saved_greater_than_is_operator_p;
3397 /* Consume the `('. */
3398 cp_lexer_consume_token (parser->lexer);
3399 /* Within a parenthesized expression, a `>' token is always
3400 the greater-than operator. */
3401 saved_greater_than_is_operator_p
3402 = parser->greater_than_is_operator_p;
3403 parser->greater_than_is_operator_p = true;
3404 /* If we see `( { ' then we are looking at the beginning of
3405 a GNU statement-expression. */
3406 if (cp_parser_allow_gnu_extensions_p (parser)
3407 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
3409 /* Statement-expressions are not allowed by the standard. */
3410 pedwarn (token->location, OPT_pedantic,
3411 "ISO C++ forbids braced-groups within expressions");
3413 /* And they're not allowed outside of a function-body; you
3414 cannot, for example, write:
3416 int i = ({ int j = 3; j + 1; });
3418 at class or namespace scope. */
3419 if (!parser->in_function_body
3420 || parser->in_template_argument_list_p)
3422 error_at (token->location,
3423 "statement-expressions are not allowed outside "
3424 "functions nor in template-argument lists");
3425 cp_parser_skip_to_end_of_block_or_statement (parser);
3426 expr = error_mark_node;
3430 /* Start the statement-expression. */
3431 expr = begin_stmt_expr ();
3432 /* Parse the compound-statement. */
3433 cp_parser_compound_statement (parser, expr, false, false);
3435 expr = finish_stmt_expr (expr, false);
3440 /* Parse the parenthesized expression. */
3441 expr = cp_parser_expression (parser, cast_p, idk);
3442 /* Let the front end know that this expression was
3443 enclosed in parentheses. This matters in case, for
3444 example, the expression is of the form `A::B', since
3445 `&A::B' might be a pointer-to-member, but `&(A::B)' is
3447 finish_parenthesized_expr (expr);
3448 /* DR 705: Wrapping an unqualified name in parentheses
3449 suppresses arg-dependent lookup. We want to pass back
3450 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
3451 (c++/37862), but none of the others. */
3452 if (*idk != CP_ID_KIND_QUALIFIED)
3453 *idk = CP_ID_KIND_NONE;
3455 /* The `>' token might be the end of a template-id or
3456 template-parameter-list now. */
3457 parser->greater_than_is_operator_p
3458 = saved_greater_than_is_operator_p;
3459 /* Consume the `)'. */
3460 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
3461 cp_parser_skip_to_end_of_statement (parser);
3466 case CPP_OPEN_SQUARE:
3467 if (c_dialect_objc ())
3468 /* We have an Objective-C++ message. */
3469 return cp_parser_objc_expression (parser);
3471 tree lam = cp_parser_lambda_expression (parser);
3472 /* Don't warn about a failed tentative parse. */
3473 if (cp_parser_error_occurred (parser))
3474 return error_mark_node;
3475 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR);
3479 case CPP_OBJC_STRING:
3480 if (c_dialect_objc ())
3481 /* We have an Objective-C++ string literal. */
3482 return cp_parser_objc_expression (parser);
3483 cp_parser_error (parser, "expected primary-expression");
3484 return error_mark_node;
3487 switch (token->keyword)
3489 /* These two are the boolean literals. */
3491 cp_lexer_consume_token (parser->lexer);
3492 return boolean_true_node;
3494 cp_lexer_consume_token (parser->lexer);
3495 return boolean_false_node;
3497 /* The `__null' literal. */
3499 cp_lexer_consume_token (parser->lexer);
3502 /* The `nullptr' literal. */
3504 cp_lexer_consume_token (parser->lexer);
3505 return nullptr_node;
3507 /* Recognize the `this' keyword. */
3509 cp_lexer_consume_token (parser->lexer);
3510 if (parser->local_variables_forbidden_p)
3512 error_at (token->location,
3513 "%<this%> may not be used in this context");
3514 return error_mark_node;
3516 /* Pointers cannot appear in constant-expressions. */
3517 if (cp_parser_non_integral_constant_expression (parser, NIC_THIS))
3518 return error_mark_node;
3519 return finish_this_expr ();
3521 /* The `operator' keyword can be the beginning of an
3526 case RID_FUNCTION_NAME:
3527 case RID_PRETTY_FUNCTION_NAME:
3528 case RID_C99_FUNCTION_NAME:
3530 non_integral_constant name;
3532 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
3533 __func__ are the names of variables -- but they are
3534 treated specially. Therefore, they are handled here,
3535 rather than relying on the generic id-expression logic
3536 below. Grammatically, these names are id-expressions.
3538 Consume the token. */
3539 token = cp_lexer_consume_token (parser->lexer);
3541 switch (token->keyword)
3543 case RID_FUNCTION_NAME:
3544 name = NIC_FUNC_NAME;
3546 case RID_PRETTY_FUNCTION_NAME:
3547 name = NIC_PRETTY_FUNC;
3549 case RID_C99_FUNCTION_NAME:
3550 name = NIC_C99_FUNC;
3556 if (cp_parser_non_integral_constant_expression (parser, name))
3557 return error_mark_node;
3559 /* Look up the name. */
3560 return finish_fname (token->u.value);
3568 /* The `__builtin_va_arg' construct is used to handle
3569 `va_arg'. Consume the `__builtin_va_arg' token. */
3570 cp_lexer_consume_token (parser->lexer);
3571 /* Look for the opening `('. */
3572 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
3573 /* Now, parse the assignment-expression. */
3574 expression = cp_parser_assignment_expression (parser,
3575 /*cast_p=*/false, NULL);
3576 /* Look for the `,'. */
3577 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
3578 /* Parse the type-id. */
3579 type = cp_parser_type_id (parser);
3580 /* Look for the closing `)'. */
3581 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
3582 /* Using `va_arg' in a constant-expression is not
3584 if (cp_parser_non_integral_constant_expression (parser,
3586 return error_mark_node;
3587 return build_x_va_arg (expression, type);
3591 return cp_parser_builtin_offsetof (parser);
3593 case RID_HAS_NOTHROW_ASSIGN:
3594 case RID_HAS_NOTHROW_CONSTRUCTOR:
3595 case RID_HAS_NOTHROW_COPY:
3596 case RID_HAS_TRIVIAL_ASSIGN:
3597 case RID_HAS_TRIVIAL_CONSTRUCTOR:
3598 case RID_HAS_TRIVIAL_COPY:
3599 case RID_HAS_TRIVIAL_DESTRUCTOR:
3600 case RID_HAS_VIRTUAL_DESTRUCTOR:
3601 case RID_IS_ABSTRACT:
3602 case RID_IS_BASE_OF:
3604 case RID_IS_CONVERTIBLE_TO:
3607 case RID_IS_LITERAL_TYPE:
3609 case RID_IS_POLYMORPHIC:
3610 case RID_IS_STD_LAYOUT:
3611 case RID_IS_TRIVIAL:
3613 return cp_parser_trait_expr (parser, token->keyword);
3615 /* Objective-C++ expressions. */
3617 case RID_AT_PROTOCOL:
3618 case RID_AT_SELECTOR:
3619 return cp_parser_objc_expression (parser);
3622 if (parser->in_function_body
3623 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3626 error_at (token->location,
3627 "a template declaration cannot appear at block scope");
3628 cp_parser_skip_to_end_of_block_or_statement (parser);
3629 return error_mark_node;
3632 cp_parser_error (parser, "expected primary-expression");
3633 return error_mark_node;
3636 /* An id-expression can start with either an identifier, a
3637 `::' as the beginning of a qualified-id, or the "operator"
3641 case CPP_TEMPLATE_ID:
3642 case CPP_NESTED_NAME_SPECIFIER:
3646 const char *error_msg;
3649 cp_token *id_expr_token;
3652 /* Parse the id-expression. */
3654 = cp_parser_id_expression (parser,
3655 /*template_keyword_p=*/false,
3656 /*check_dependency_p=*/true,
3658 /*declarator_p=*/false,
3659 /*optional_p=*/false);
3660 if (id_expression == error_mark_node)
3661 return error_mark_node;
3662 id_expr_token = token;
3663 token = cp_lexer_peek_token (parser->lexer);
3664 done = (token->type != CPP_OPEN_SQUARE
3665 && token->type != CPP_OPEN_PAREN
3666 && token->type != CPP_DOT
3667 && token->type != CPP_DEREF
3668 && token->type != CPP_PLUS_PLUS
3669 && token->type != CPP_MINUS_MINUS);
3670 /* If we have a template-id, then no further lookup is
3671 required. If the template-id was for a template-class, we
3672 will sometimes have a TYPE_DECL at this point. */
3673 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
3674 || TREE_CODE (id_expression) == TYPE_DECL)
3675 decl = id_expression;
3676 /* Look up the name. */
3679 tree ambiguous_decls;
3681 /* If we already know that this lookup is ambiguous, then
3682 we've already issued an error message; there's no reason
3684 if (id_expr_token->type == CPP_NAME
3685 && id_expr_token->ambiguous_p)
3687 cp_parser_simulate_error (parser);
3688 return error_mark_node;
3691 decl = cp_parser_lookup_name (parser, id_expression,
3694 /*is_namespace=*/false,
3695 /*check_dependency=*/true,
3697 id_expr_token->location);
3698 /* If the lookup was ambiguous, an error will already have
3700 if (ambiguous_decls)
3701 return error_mark_node;
3703 /* In Objective-C++, we may have an Objective-C 2.0
3704 dot-syntax for classes here. */
3705 if (c_dialect_objc ()
3706 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT
3707 && TREE_CODE (decl) == TYPE_DECL
3708 && objc_is_class_name (decl))
3711 cp_lexer_consume_token (parser->lexer);
3712 component = cp_parser_identifier (parser);
3713 if (component == error_mark_node)
3714 return error_mark_node;
3716 return objc_build_class_component_ref (id_expression, component);
3719 /* In Objective-C++, an instance variable (ivar) may be preferred
3720 to whatever cp_parser_lookup_name() found. */
3721 decl = objc_lookup_ivar (decl, id_expression);
3723 /* If name lookup gives us a SCOPE_REF, then the
3724 qualifying scope was dependent. */
3725 if (TREE_CODE (decl) == SCOPE_REF)
3727 /* At this point, we do not know if DECL is a valid
3728 integral constant expression. We assume that it is
3729 in fact such an expression, so that code like:
3731 template <int N> struct A {
3735 is accepted. At template-instantiation time, we
3736 will check that B<N>::i is actually a constant. */
3739 /* Check to see if DECL is a local variable in a context
3740 where that is forbidden. */
3741 if (parser->local_variables_forbidden_p
3742 && local_variable_p (decl))
3744 /* It might be that we only found DECL because we are
3745 trying to be generous with pre-ISO scoping rules.
3746 For example, consider:
3750 for (int i = 0; i < 10; ++i) {}
3751 extern void f(int j = i);
3754 Here, name look up will originally find the out
3755 of scope `i'. We need to issue a warning message,
3756 but then use the global `i'. */
3757 decl = check_for_out_of_scope_variable (decl);
3758 if (local_variable_p (decl))
3760 error_at (id_expr_token->location,
3761 "local variable %qD may not appear in this context",
3763 return error_mark_node;
3768 decl = (finish_id_expression
3769 (id_expression, decl, parser->scope,
3771 parser->integral_constant_expression_p,
3772 parser->allow_non_integral_constant_expression_p,
3773 &parser->non_integral_constant_expression_p,
3774 template_p, done, address_p,
3777 id_expr_token->location));
3779 cp_parser_error (parser, error_msg);
3783 /* Anything else is an error. */
3785 cp_parser_error (parser, "expected primary-expression");
3786 return error_mark_node;
3790 /* Parse an id-expression.
3797 :: [opt] nested-name-specifier template [opt] unqualified-id
3799 :: operator-function-id
3802 Return a representation of the unqualified portion of the
3803 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3804 a `::' or nested-name-specifier.
3806 Often, if the id-expression was a qualified-id, the caller will
3807 want to make a SCOPE_REF to represent the qualified-id. This
3808 function does not do this in order to avoid wastefully creating
3809 SCOPE_REFs when they are not required.
3811 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3814 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3815 uninstantiated templates.
3817 If *TEMPLATE_P is non-NULL, it is set to true iff the
3818 `template' keyword is used to explicitly indicate that the entity
3819 named is a template.
3821 If DECLARATOR_P is true, the id-expression is appearing as part of
3822 a declarator, rather than as part of an expression. */
3825 cp_parser_id_expression (cp_parser *parser,
3826 bool template_keyword_p,
3827 bool check_dependency_p,
3832 bool global_scope_p;
3833 bool nested_name_specifier_p;
3835 /* Assume the `template' keyword was not used. */
3837 *template_p = template_keyword_p;
3839 /* Look for the optional `::' operator. */
3841 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3843 /* Look for the optional nested-name-specifier. */
3844 nested_name_specifier_p
3845 = (cp_parser_nested_name_specifier_opt (parser,
3846 /*typename_keyword_p=*/false,
3851 /* If there is a nested-name-specifier, then we are looking at
3852 the first qualified-id production. */
3853 if (nested_name_specifier_p)
3856 tree saved_object_scope;
3857 tree saved_qualifying_scope;
3858 tree unqualified_id;
3861 /* See if the next token is the `template' keyword. */
3863 template_p = &is_template;
3864 *template_p = cp_parser_optional_template_keyword (parser);
3865 /* Name lookup we do during the processing of the
3866 unqualified-id might obliterate SCOPE. */
3867 saved_scope = parser->scope;
3868 saved_object_scope = parser->object_scope;
3869 saved_qualifying_scope = parser->qualifying_scope;
3870 /* Process the final unqualified-id. */
3871 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3874 /*optional_p=*/false);
3875 /* Restore the SAVED_SCOPE for our caller. */
3876 parser->scope = saved_scope;
3877 parser->object_scope = saved_object_scope;
3878 parser->qualifying_scope = saved_qualifying_scope;
3880 return unqualified_id;
3882 /* Otherwise, if we are in global scope, then we are looking at one
3883 of the other qualified-id productions. */
3884 else if (global_scope_p)
3889 /* Peek at the next token. */
3890 token = cp_lexer_peek_token (parser->lexer);
3892 /* If it's an identifier, and the next token is not a "<", then
3893 we can avoid the template-id case. This is an optimization
3894 for this common case. */
3895 if (token->type == CPP_NAME
3896 && !cp_parser_nth_token_starts_template_argument_list_p
3898 return cp_parser_identifier (parser);
3900 cp_parser_parse_tentatively (parser);
3901 /* Try a template-id. */
3902 id = cp_parser_template_id (parser,
3903 /*template_keyword_p=*/false,
3904 /*check_dependency_p=*/true,
3906 /* If that worked, we're done. */
3907 if (cp_parser_parse_definitely (parser))
3910 /* Peek at the next token. (Changes in the token buffer may
3911 have invalidated the pointer obtained above.) */
3912 token = cp_lexer_peek_token (parser->lexer);
3914 switch (token->type)
3917 return cp_parser_identifier (parser);
3920 if (token->keyword == RID_OPERATOR)
3921 return cp_parser_operator_function_id (parser);
3925 cp_parser_error (parser, "expected id-expression");
3926 return error_mark_node;
3930 return cp_parser_unqualified_id (parser, template_keyword_p,
3931 /*check_dependency_p=*/true,
3936 /* Parse an unqualified-id.
3940 operator-function-id
3941 conversion-function-id
3945 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3946 keyword, in a construct like `A::template ...'.
3948 Returns a representation of unqualified-id. For the `identifier'
3949 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3950 production a BIT_NOT_EXPR is returned; the operand of the
3951 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3952 other productions, see the documentation accompanying the
3953 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3954 names are looked up in uninstantiated templates. If DECLARATOR_P
3955 is true, the unqualified-id is appearing as part of a declarator,
3956 rather than as part of an expression. */
3959 cp_parser_unqualified_id (cp_parser* parser,
3960 bool template_keyword_p,
3961 bool check_dependency_p,
3967 /* Peek at the next token. */
3968 token = cp_lexer_peek_token (parser->lexer);
3970 switch (token->type)
3976 /* We don't know yet whether or not this will be a
3978 cp_parser_parse_tentatively (parser);
3979 /* Try a template-id. */
3980 id = cp_parser_template_id (parser, template_keyword_p,
3983 /* If it worked, we're done. */
3984 if (cp_parser_parse_definitely (parser))
3986 /* Otherwise, it's an ordinary identifier. */
3987 return cp_parser_identifier (parser);
3990 case CPP_TEMPLATE_ID:
3991 return cp_parser_template_id (parser, template_keyword_p,
3998 tree qualifying_scope;
4003 /* Consume the `~' token. */
4004 cp_lexer_consume_token (parser->lexer);
4005 /* Parse the class-name. The standard, as written, seems to
4008 template <typename T> struct S { ~S (); };
4009 template <typename T> S<T>::~S() {}
4011 is invalid, since `~' must be followed by a class-name, but
4012 `S<T>' is dependent, and so not known to be a class.
4013 That's not right; we need to look in uninstantiated
4014 templates. A further complication arises from:
4016 template <typename T> void f(T t) {
4020 Here, it is not possible to look up `T' in the scope of `T'
4021 itself. We must look in both the current scope, and the
4022 scope of the containing complete expression.
4024 Yet another issue is:
4033 The standard does not seem to say that the `S' in `~S'
4034 should refer to the type `S' and not the data member
4037 /* DR 244 says that we look up the name after the "~" in the
4038 same scope as we looked up the qualifying name. That idea
4039 isn't fully worked out; it's more complicated than that. */
4040 scope = parser->scope;
4041 object_scope = parser->object_scope;
4042 qualifying_scope = parser->qualifying_scope;
4044 /* Check for invalid scopes. */
4045 if (scope == error_mark_node)
4047 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
4048 cp_lexer_consume_token (parser->lexer);
4049 return error_mark_node;
4051 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
4053 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
4054 error_at (token->location,
4055 "scope %qT before %<~%> is not a class-name",
4057 cp_parser_simulate_error (parser);
4058 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
4059 cp_lexer_consume_token (parser->lexer);
4060 return error_mark_node;
4062 gcc_assert (!scope || TYPE_P (scope));
4064 /* If the name is of the form "X::~X" it's OK even if X is a
4066 token = cp_lexer_peek_token (parser->lexer);
4068 && token->type == CPP_NAME
4069 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4071 && (token->u.value == TYPE_IDENTIFIER (scope)
4072 || (CLASS_TYPE_P (scope)
4073 && constructor_name_p (token->u.value, scope))))
4075 cp_lexer_consume_token (parser->lexer);
4076 return build_nt (BIT_NOT_EXPR, scope);
4079 /* If there was an explicit qualification (S::~T), first look
4080 in the scope given by the qualification (i.e., S).
4082 Note: in the calls to cp_parser_class_name below we pass
4083 typename_type so that lookup finds the injected-class-name
4084 rather than the constructor. */
4086 type_decl = NULL_TREE;
4089 cp_parser_parse_tentatively (parser);
4090 type_decl = cp_parser_class_name (parser,
4091 /*typename_keyword_p=*/false,
4092 /*template_keyword_p=*/false,
4094 /*check_dependency=*/false,
4095 /*class_head_p=*/false,
4097 if (cp_parser_parse_definitely (parser))
4100 /* In "N::S::~S", look in "N" as well. */
4101 if (!done && scope && qualifying_scope)
4103 cp_parser_parse_tentatively (parser);
4104 parser->scope = qualifying_scope;
4105 parser->object_scope = NULL_TREE;
4106 parser->qualifying_scope = NULL_TREE;
4108 = cp_parser_class_name (parser,
4109 /*typename_keyword_p=*/false,
4110 /*template_keyword_p=*/false,
4112 /*check_dependency=*/false,
4113 /*class_head_p=*/false,
4115 if (cp_parser_parse_definitely (parser))
4118 /* In "p->S::~T", look in the scope given by "*p" as well. */
4119 else if (!done && object_scope)
4121 cp_parser_parse_tentatively (parser);
4122 parser->scope = object_scope;
4123 parser->object_scope = NULL_TREE;
4124 parser->qualifying_scope = NULL_TREE;
4126 = cp_parser_class_name (parser,
4127 /*typename_keyword_p=*/false,
4128 /*template_keyword_p=*/false,
4130 /*check_dependency=*/false,
4131 /*class_head_p=*/false,
4133 if (cp_parser_parse_definitely (parser))
4136 /* Look in the surrounding context. */
4139 parser->scope = NULL_TREE;
4140 parser->object_scope = NULL_TREE;
4141 parser->qualifying_scope = NULL_TREE;
4142 if (processing_template_decl)
4143 cp_parser_parse_tentatively (parser);
4145 = cp_parser_class_name (parser,
4146 /*typename_keyword_p=*/false,
4147 /*template_keyword_p=*/false,
4149 /*check_dependency=*/false,
4150 /*class_head_p=*/false,
4152 if (processing_template_decl
4153 && ! cp_parser_parse_definitely (parser))
4155 /* We couldn't find a type with this name, so just accept
4156 it and check for a match at instantiation time. */
4157 type_decl = cp_parser_identifier (parser);
4158 if (type_decl != error_mark_node)
4159 type_decl = build_nt (BIT_NOT_EXPR, type_decl);
4163 /* If an error occurred, assume that the name of the
4164 destructor is the same as the name of the qualifying
4165 class. That allows us to keep parsing after running
4166 into ill-formed destructor names. */
4167 if (type_decl == error_mark_node && scope)
4168 return build_nt (BIT_NOT_EXPR, scope);
4169 else if (type_decl == error_mark_node)
4170 return error_mark_node;
4172 /* Check that destructor name and scope match. */
4173 if (declarator_p && scope && !check_dtor_name (scope, type_decl))
4175 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
4176 error_at (token->location,
4177 "declaration of %<~%T%> as member of %qT",
4179 cp_parser_simulate_error (parser);
4180 return error_mark_node;
4185 A typedef-name that names a class shall not be used as the
4186 identifier in the declarator for a destructor declaration. */
4188 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
4189 && !DECL_SELF_REFERENCE_P (type_decl)
4190 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
4191 error_at (token->location,
4192 "typedef-name %qD used as destructor declarator",
4195 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
4199 if (token->keyword == RID_OPERATOR)
4203 /* This could be a template-id, so we try that first. */
4204 cp_parser_parse_tentatively (parser);
4205 /* Try a template-id. */
4206 id = cp_parser_template_id (parser, template_keyword_p,
4207 /*check_dependency_p=*/true,
4209 /* If that worked, we're done. */
4210 if (cp_parser_parse_definitely (parser))
4212 /* We still don't know whether we're looking at an
4213 operator-function-id or a conversion-function-id. */
4214 cp_parser_parse_tentatively (parser);
4215 /* Try an operator-function-id. */
4216 id = cp_parser_operator_function_id (parser);
4217 /* If that didn't work, try a conversion-function-id. */
4218 if (!cp_parser_parse_definitely (parser))
4219 id = cp_parser_conversion_function_id (parser);
4228 cp_parser_error (parser, "expected unqualified-id");
4229 return error_mark_node;
4233 /* Parse an (optional) nested-name-specifier.
4235 nested-name-specifier: [C++98]
4236 class-or-namespace-name :: nested-name-specifier [opt]
4237 class-or-namespace-name :: template nested-name-specifier [opt]
4239 nested-name-specifier: [C++0x]
4242 nested-name-specifier identifier ::
4243 nested-name-specifier template [opt] simple-template-id ::
4245 PARSER->SCOPE should be set appropriately before this function is
4246 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4247 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4250 Sets PARSER->SCOPE to the class (TYPE) or namespace
4251 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4252 it unchanged if there is no nested-name-specifier. Returns the new
4253 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4255 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4256 part of a declaration and/or decl-specifier. */
4259 cp_parser_nested_name_specifier_opt (cp_parser *parser,
4260 bool typename_keyword_p,
4261 bool check_dependency_p,
4263 bool is_declaration)
4265 bool success = false;
4266 cp_token_position start = 0;
4269 /* Remember where the nested-name-specifier starts. */
4270 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
4272 start = cp_lexer_token_position (parser->lexer, false);
4273 push_deferring_access_checks (dk_deferred);
4280 tree saved_qualifying_scope;
4281 bool template_keyword_p;
4283 /* Spot cases that cannot be the beginning of a
4284 nested-name-specifier. */
4285 token = cp_lexer_peek_token (parser->lexer);
4287 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4288 the already parsed nested-name-specifier. */
4289 if (token->type == CPP_NESTED_NAME_SPECIFIER)
4291 /* Grab the nested-name-specifier and continue the loop. */
4292 cp_parser_pre_parsed_nested_name_specifier (parser);
4293 /* If we originally encountered this nested-name-specifier
4294 with IS_DECLARATION set to false, we will not have
4295 resolved TYPENAME_TYPEs, so we must do so here. */
4297 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4299 new_scope = resolve_typename_type (parser->scope,
4300 /*only_current_p=*/false);
4301 if (TREE_CODE (new_scope) != TYPENAME_TYPE)
4302 parser->scope = new_scope;
4308 /* Spot cases that cannot be the beginning of a
4309 nested-name-specifier. On the second and subsequent times
4310 through the loop, we look for the `template' keyword. */
4311 if (success && token->keyword == RID_TEMPLATE)
4313 /* A template-id can start a nested-name-specifier. */
4314 else if (token->type == CPP_TEMPLATE_ID)
4318 /* If the next token is not an identifier, then it is
4319 definitely not a type-name or namespace-name. */
4320 if (token->type != CPP_NAME)
4322 /* If the following token is neither a `<' (to begin a
4323 template-id), nor a `::', then we are not looking at a
4324 nested-name-specifier. */
4325 token = cp_lexer_peek_nth_token (parser->lexer, 2);
4327 if (token->type == CPP_COLON
4328 && parser->colon_corrects_to_scope_p
4329 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_NAME)
4331 error_at (token->location,
4332 "found %<:%> in nested-name-specifier, expected %<::%>");
4333 token->type = CPP_SCOPE;
4336 if (token->type != CPP_SCOPE
4337 && !cp_parser_nth_token_starts_template_argument_list_p
4342 /* The nested-name-specifier is optional, so we parse
4344 cp_parser_parse_tentatively (parser);
4346 /* Look for the optional `template' keyword, if this isn't the
4347 first time through the loop. */
4349 template_keyword_p = cp_parser_optional_template_keyword (parser);
4351 template_keyword_p = false;
4353 /* Save the old scope since the name lookup we are about to do
4354 might destroy it. */
4355 old_scope = parser->scope;
4356 saved_qualifying_scope = parser->qualifying_scope;
4357 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4358 look up names in "X<T>::I" in order to determine that "Y" is
4359 a template. So, if we have a typename at this point, we make
4360 an effort to look through it. */
4362 && !typename_keyword_p
4364 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4365 parser->scope = resolve_typename_type (parser->scope,
4366 /*only_current_p=*/false);
4367 /* Parse the qualifying entity. */
4369 = cp_parser_qualifying_entity (parser,
4375 /* Look for the `::' token. */
4376 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
4378 /* If we found what we wanted, we keep going; otherwise, we're
4380 if (!cp_parser_parse_definitely (parser))
4382 bool error_p = false;
4384 /* Restore the OLD_SCOPE since it was valid before the
4385 failed attempt at finding the last
4386 class-or-namespace-name. */
4387 parser->scope = old_scope;
4388 parser->qualifying_scope = saved_qualifying_scope;
4389 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
4391 /* If the next token is an identifier, and the one after
4392 that is a `::', then any valid interpretation would have
4393 found a class-or-namespace-name. */
4394 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
4395 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4397 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
4400 token = cp_lexer_consume_token (parser->lexer);
4403 if (!token->ambiguous_p)
4406 tree ambiguous_decls;
4408 decl = cp_parser_lookup_name (parser, token->u.value,
4410 /*is_template=*/false,
4411 /*is_namespace=*/false,
4412 /*check_dependency=*/true,
4415 if (TREE_CODE (decl) == TEMPLATE_DECL)
4416 error_at (token->location,
4417 "%qD used without template parameters",
4419 else if (ambiguous_decls)
4421 error_at (token->location,
4422 "reference to %qD is ambiguous",
4424 print_candidates (ambiguous_decls);
4425 decl = error_mark_node;
4429 if (cxx_dialect != cxx98)
4430 cp_parser_name_lookup_error
4431 (parser, token->u.value, decl, NLE_NOT_CXX98,
4434 cp_parser_name_lookup_error
4435 (parser, token->u.value, decl, NLE_CXX98,
4439 parser->scope = error_mark_node;
4441 /* Treat this as a successful nested-name-specifier
4446 If the name found is not a class-name (clause
4447 _class_) or namespace-name (_namespace.def_), the
4448 program is ill-formed. */
4451 cp_lexer_consume_token (parser->lexer);
4455 /* We've found one valid nested-name-specifier. */
4457 /* Name lookup always gives us a DECL. */
4458 if (TREE_CODE (new_scope) == TYPE_DECL)
4459 new_scope = TREE_TYPE (new_scope);
4460 /* Uses of "template" must be followed by actual templates. */
4461 if (template_keyword_p
4462 && !(CLASS_TYPE_P (new_scope)
4463 && ((CLASSTYPE_USE_TEMPLATE (new_scope)
4464 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope)))
4465 || CLASSTYPE_IS_TEMPLATE (new_scope)))
4466 && !(TREE_CODE (new_scope) == TYPENAME_TYPE
4467 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope))
4468 == TEMPLATE_ID_EXPR)))
4469 permerror (input_location, TYPE_P (new_scope)
4470 ? "%qT is not a template"
4471 : "%qD is not a template",
4473 /* If it is a class scope, try to complete it; we are about to
4474 be looking up names inside the class. */
4475 if (TYPE_P (new_scope)
4476 /* Since checking types for dependency can be expensive,
4477 avoid doing it if the type is already complete. */
4478 && !COMPLETE_TYPE_P (new_scope)
4479 /* Do not try to complete dependent types. */
4480 && !dependent_type_p (new_scope))
4482 new_scope = complete_type (new_scope);
4483 /* If it is a typedef to current class, use the current
4484 class instead, as the typedef won't have any names inside
4486 if (!COMPLETE_TYPE_P (new_scope)
4487 && currently_open_class (new_scope))
4488 new_scope = TYPE_MAIN_VARIANT (new_scope);
4490 /* Make sure we look in the right scope the next time through
4492 parser->scope = new_scope;
4495 /* If parsing tentatively, replace the sequence of tokens that makes
4496 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
4497 token. That way, should we re-parse the token stream, we will
4498 not have to repeat the effort required to do the parse, nor will
4499 we issue duplicate error messages. */
4500 if (success && start)
4504 token = cp_lexer_token_at (parser->lexer, start);
4505 /* Reset the contents of the START token. */
4506 token->type = CPP_NESTED_NAME_SPECIFIER;
4507 /* Retrieve any deferred checks. Do not pop this access checks yet
4508 so the memory will not be reclaimed during token replacing below. */
4509 token->u.tree_check_value = ggc_alloc_cleared_tree_check ();
4510 token->u.tree_check_value->value = parser->scope;
4511 token->u.tree_check_value->checks = get_deferred_access_checks ();
4512 token->u.tree_check_value->qualifying_scope =
4513 parser->qualifying_scope;
4514 token->keyword = RID_MAX;
4516 /* Purge all subsequent tokens. */
4517 cp_lexer_purge_tokens_after (parser->lexer, start);
4521 pop_to_parent_deferring_access_checks ();
4523 return success ? parser->scope : NULL_TREE;
4526 /* Parse a nested-name-specifier. See
4527 cp_parser_nested_name_specifier_opt for details. This function
4528 behaves identically, except that it will an issue an error if no
4529 nested-name-specifier is present. */
4532 cp_parser_nested_name_specifier (cp_parser *parser,
4533 bool typename_keyword_p,
4534 bool check_dependency_p,
4536 bool is_declaration)
4540 /* Look for the nested-name-specifier. */
4541 scope = cp_parser_nested_name_specifier_opt (parser,
4546 /* If it was not present, issue an error message. */
4549 cp_parser_error (parser, "expected nested-name-specifier");
4550 parser->scope = NULL_TREE;
4556 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
4557 this is either a class-name or a namespace-name (which corresponds
4558 to the class-or-namespace-name production in the grammar). For
4559 C++0x, it can also be a type-name that refers to an enumeration
4562 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
4563 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
4564 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
4565 TYPE_P is TRUE iff the next name should be taken as a class-name,
4566 even the same name is declared to be another entity in the same
4569 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
4570 specified by the class-or-namespace-name. If neither is found the
4571 ERROR_MARK_NODE is returned. */
4574 cp_parser_qualifying_entity (cp_parser *parser,
4575 bool typename_keyword_p,
4576 bool template_keyword_p,
4577 bool check_dependency_p,
4579 bool is_declaration)
4582 tree saved_qualifying_scope;
4583 tree saved_object_scope;
4586 bool successful_parse_p;
4588 /* Before we try to parse the class-name, we must save away the
4589 current PARSER->SCOPE since cp_parser_class_name will destroy
4591 saved_scope = parser->scope;
4592 saved_qualifying_scope = parser->qualifying_scope;
4593 saved_object_scope = parser->object_scope;
4594 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
4595 there is no need to look for a namespace-name. */
4596 only_class_p = template_keyword_p
4597 || (saved_scope && TYPE_P (saved_scope) && cxx_dialect == cxx98);
4599 cp_parser_parse_tentatively (parser);
4600 scope = cp_parser_class_name (parser,
4603 type_p ? class_type : none_type,
4605 /*class_head_p=*/false,
4607 successful_parse_p = only_class_p || cp_parser_parse_definitely (parser);
4608 /* If that didn't work and we're in C++0x mode, try for a type-name. */
4610 && cxx_dialect != cxx98
4611 && !successful_parse_p)
4613 /* Restore the saved scope. */
4614 parser->scope = saved_scope;
4615 parser->qualifying_scope = saved_qualifying_scope;
4616 parser->object_scope = saved_object_scope;
4618 /* Parse tentatively. */
4619 cp_parser_parse_tentatively (parser);
4621 /* Parse a typedef-name or enum-name. */
4622 scope = cp_parser_nonclass_name (parser);
4624 /* "If the name found does not designate a namespace or a class,
4625 enumeration, or dependent type, the program is ill-formed."
4627 We cover classes and dependent types above and namespaces below,
4628 so this code is only looking for enums. */
4629 if (!scope || TREE_CODE (scope) != TYPE_DECL
4630 || TREE_CODE (TREE_TYPE (scope)) != ENUMERAL_TYPE)
4631 cp_parser_simulate_error (parser);
4633 successful_parse_p = cp_parser_parse_definitely (parser);
4635 /* If that didn't work, try for a namespace-name. */
4636 if (!only_class_p && !successful_parse_p)
4638 /* Restore the saved scope. */
4639 parser->scope = saved_scope;
4640 parser->qualifying_scope = saved_qualifying_scope;
4641 parser->object_scope = saved_object_scope;
4642 /* If we are not looking at an identifier followed by the scope
4643 resolution operator, then this is not part of a
4644 nested-name-specifier. (Note that this function is only used
4645 to parse the components of a nested-name-specifier.) */
4646 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
4647 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
4648 return error_mark_node;
4649 scope = cp_parser_namespace_name (parser);
4655 /* Parse a postfix-expression.
4659 postfix-expression [ expression ]
4660 postfix-expression ( expression-list [opt] )
4661 simple-type-specifier ( expression-list [opt] )
4662 typename :: [opt] nested-name-specifier identifier
4663 ( expression-list [opt] )
4664 typename :: [opt] nested-name-specifier template [opt] template-id
4665 ( expression-list [opt] )
4666 postfix-expression . template [opt] id-expression
4667 postfix-expression -> template [opt] id-expression
4668 postfix-expression . pseudo-destructor-name
4669 postfix-expression -> pseudo-destructor-name
4670 postfix-expression ++
4671 postfix-expression --
4672 dynamic_cast < type-id > ( expression )
4673 static_cast < type-id > ( expression )
4674 reinterpret_cast < type-id > ( expression )
4675 const_cast < type-id > ( expression )
4676 typeid ( expression )
4682 ( type-id ) { initializer-list , [opt] }
4684 This extension is a GNU version of the C99 compound-literal
4685 construct. (The C99 grammar uses `type-name' instead of `type-id',
4686 but they are essentially the same concept.)
4688 If ADDRESS_P is true, the postfix expression is the operand of the
4689 `&' operator. CAST_P is true if this expression is the target of a
4692 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
4693 class member access expressions [expr.ref].
4695 Returns a representation of the expression. */
4698 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p,
4699 bool member_access_only_p,
4700 cp_id_kind * pidk_return)
4704 cp_id_kind idk = CP_ID_KIND_NONE;
4705 tree postfix_expression = NULL_TREE;
4706 bool is_member_access = false;
4708 /* Peek at the next token. */
4709 token = cp_lexer_peek_token (parser->lexer);
4710 /* Some of the productions are determined by keywords. */
4711 keyword = token->keyword;
4721 const char *saved_message;
4723 /* All of these can be handled in the same way from the point
4724 of view of parsing. Begin by consuming the token
4725 identifying the cast. */
4726 cp_lexer_consume_token (parser->lexer);
4728 /* New types cannot be defined in the cast. */
4729 saved_message = parser->type_definition_forbidden_message;
4730 parser->type_definition_forbidden_message
4731 = G_("types may not be defined in casts");
4733 /* Look for the opening `<'. */
4734 cp_parser_require (parser, CPP_LESS, RT_LESS);
4735 /* Parse the type to which we are casting. */
4736 type = cp_parser_type_id (parser);
4737 /* Look for the closing `>'. */
4738 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
4739 /* Restore the old message. */
4740 parser->type_definition_forbidden_message = saved_message;
4742 /* And the expression which is being cast. */
4743 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
4744 expression = cp_parser_expression (parser, /*cast_p=*/true, & idk);
4745 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
4747 /* Only type conversions to integral or enumeration types
4748 can be used in constant-expressions. */
4749 if (!cast_valid_in_integral_constant_expression_p (type)
4750 && cp_parser_non_integral_constant_expression (parser, NIC_CAST))
4751 return error_mark_node;
4757 = build_dynamic_cast (type, expression, tf_warning_or_error);
4761 = build_static_cast (type, expression, tf_warning_or_error);
4765 = build_reinterpret_cast (type, expression,
4766 tf_warning_or_error);
4770 = build_const_cast (type, expression, tf_warning_or_error);
4781 const char *saved_message;
4782 bool saved_in_type_id_in_expr_p;
4784 /* Consume the `typeid' token. */
4785 cp_lexer_consume_token (parser->lexer);
4786 /* Look for the `(' token. */
4787 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
4788 /* Types cannot be defined in a `typeid' expression. */
4789 saved_message = parser->type_definition_forbidden_message;
4790 parser->type_definition_forbidden_message
4791 = G_("types may not be defined in a %<typeid%> expression");
4792 /* We can't be sure yet whether we're looking at a type-id or an
4794 cp_parser_parse_tentatively (parser);
4795 /* Try a type-id first. */
4796 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4797 parser->in_type_id_in_expr_p = true;
4798 type = cp_parser_type_id (parser);
4799 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4800 /* Look for the `)' token. Otherwise, we can't be sure that
4801 we're not looking at an expression: consider `typeid (int
4802 (3))', for example. */
4803 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
4804 /* If all went well, simply lookup the type-id. */
4805 if (cp_parser_parse_definitely (parser))
4806 postfix_expression = get_typeid (type);
4807 /* Otherwise, fall back to the expression variant. */
4812 /* Look for an expression. */
4813 expression = cp_parser_expression (parser, /*cast_p=*/false, & idk);
4814 /* Compute its typeid. */
4815 postfix_expression = build_typeid (expression);
4816 /* Look for the `)' token. */
4817 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
4819 /* Restore the saved message. */
4820 parser->type_definition_forbidden_message = saved_message;
4821 /* `typeid' may not appear in an integral constant expression. */
4822 if (cp_parser_non_integral_constant_expression(parser, NIC_TYPEID))
4823 return error_mark_node;
4830 /* The syntax permitted here is the same permitted for an
4831 elaborated-type-specifier. */
4832 type = cp_parser_elaborated_type_specifier (parser,
4833 /*is_friend=*/false,
4834 /*is_declaration=*/false);
4835 postfix_expression = cp_parser_functional_cast (parser, type);
4843 /* If the next thing is a simple-type-specifier, we may be
4844 looking at a functional cast. We could also be looking at
4845 an id-expression. So, we try the functional cast, and if
4846 that doesn't work we fall back to the primary-expression. */
4847 cp_parser_parse_tentatively (parser);
4848 /* Look for the simple-type-specifier. */
4849 type = cp_parser_simple_type_specifier (parser,
4850 /*decl_specs=*/NULL,
4851 CP_PARSER_FLAGS_NONE);
4852 /* Parse the cast itself. */
4853 if (!cp_parser_error_occurred (parser))
4855 = cp_parser_functional_cast (parser, type);
4856 /* If that worked, we're done. */
4857 if (cp_parser_parse_definitely (parser))
4860 /* If the functional-cast didn't work out, try a
4861 compound-literal. */
4862 if (cp_parser_allow_gnu_extensions_p (parser)
4863 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4865 VEC(constructor_elt,gc) *initializer_list = NULL;
4866 bool saved_in_type_id_in_expr_p;
4868 cp_parser_parse_tentatively (parser);
4869 /* Consume the `('. */
4870 cp_lexer_consume_token (parser->lexer);
4871 /* Parse the type. */
4872 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4873 parser->in_type_id_in_expr_p = true;
4874 type = cp_parser_type_id (parser);
4875 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4876 /* Look for the `)'. */
4877 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
4878 /* Look for the `{'. */
4879 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
4880 /* If things aren't going well, there's no need to
4882 if (!cp_parser_error_occurred (parser))
4884 bool non_constant_p;
4885 /* Parse the initializer-list. */
4887 = cp_parser_initializer_list (parser, &non_constant_p);
4888 /* Allow a trailing `,'. */
4889 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
4890 cp_lexer_consume_token (parser->lexer);
4891 /* Look for the final `}'. */
4892 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
4894 /* If that worked, we're definitely looking at a
4895 compound-literal expression. */
4896 if (cp_parser_parse_definitely (parser))
4898 /* Warn the user that a compound literal is not
4899 allowed in standard C++. */
4900 pedwarn (input_location, OPT_pedantic, "ISO C++ forbids compound-literals");
4901 /* For simplicity, we disallow compound literals in
4902 constant-expressions. We could
4903 allow compound literals of integer type, whose
4904 initializer was a constant, in constant
4905 expressions. Permitting that usage, as a further
4906 extension, would not change the meaning of any
4907 currently accepted programs. (Of course, as
4908 compound literals are not part of ISO C++, the
4909 standard has nothing to say.) */
4910 if (cp_parser_non_integral_constant_expression (parser,
4913 postfix_expression = error_mark_node;
4916 /* Form the representation of the compound-literal. */
4918 = (finish_compound_literal
4919 (type, build_constructor (init_list_type_node,
4921 tf_warning_or_error));
4926 /* It must be a primary-expression. */
4928 = cp_parser_primary_expression (parser, address_p, cast_p,
4929 /*template_arg_p=*/false,
4935 /* Keep looping until the postfix-expression is complete. */
4938 if (idk == CP_ID_KIND_UNQUALIFIED
4939 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
4940 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
4941 /* It is not a Koenig lookup function call. */
4943 = unqualified_name_lookup_error (postfix_expression);
4945 /* Peek at the next token. */
4946 token = cp_lexer_peek_token (parser->lexer);
4948 switch (token->type)
4950 case CPP_OPEN_SQUARE:
4952 = cp_parser_postfix_open_square_expression (parser,
4955 idk = CP_ID_KIND_NONE;
4956 is_member_access = false;
4959 case CPP_OPEN_PAREN:
4960 /* postfix-expression ( expression-list [opt] ) */
4963 bool is_builtin_constant_p;
4964 bool saved_integral_constant_expression_p = false;
4965 bool saved_non_integral_constant_expression_p = false;
4968 is_member_access = false;
4970 is_builtin_constant_p
4971 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
4972 if (is_builtin_constant_p)
4974 /* The whole point of __builtin_constant_p is to allow
4975 non-constant expressions to appear as arguments. */
4976 saved_integral_constant_expression_p
4977 = parser->integral_constant_expression_p;
4978 saved_non_integral_constant_expression_p
4979 = parser->non_integral_constant_expression_p;
4980 parser->integral_constant_expression_p = false;
4982 args = (cp_parser_parenthesized_expression_list
4984 /*cast_p=*/false, /*allow_expansion_p=*/true,
4985 /*non_constant_p=*/NULL));
4986 if (is_builtin_constant_p)
4988 parser->integral_constant_expression_p
4989 = saved_integral_constant_expression_p;
4990 parser->non_integral_constant_expression_p
4991 = saved_non_integral_constant_expression_p;
4996 postfix_expression = error_mark_node;
5000 /* Function calls are not permitted in
5001 constant-expressions. */
5002 if (! builtin_valid_in_constant_expr_p (postfix_expression)
5003 && cp_parser_non_integral_constant_expression (parser,
5006 postfix_expression = error_mark_node;
5007 release_tree_vector (args);
5012 if (idk == CP_ID_KIND_UNQUALIFIED
5013 || idk == CP_ID_KIND_TEMPLATE_ID)
5015 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
5017 if (!VEC_empty (tree, args))
5020 if (!any_type_dependent_arguments_p (args))
5022 = perform_koenig_lookup (postfix_expression, args,
5023 /*include_std=*/false,
5024 tf_warning_or_error);
5028 = unqualified_fn_lookup_error (postfix_expression);
5030 /* We do not perform argument-dependent lookup if
5031 normal lookup finds a non-function, in accordance
5032 with the expected resolution of DR 218. */
5033 else if (!VEC_empty (tree, args)
5034 && is_overloaded_fn (postfix_expression))
5036 tree fn = get_first_fn (postfix_expression);
5037 fn = STRIP_TEMPLATE (fn);
5039 /* Do not do argument dependent lookup if regular
5040 lookup finds a member function or a block-scope
5041 function declaration. [basic.lookup.argdep]/3 */
5042 if (!DECL_FUNCTION_MEMBER_P (fn)
5043 && !DECL_LOCAL_FUNCTION_P (fn))
5046 if (!any_type_dependent_arguments_p (args))
5048 = perform_koenig_lookup (postfix_expression, args,
5049 /*include_std=*/false,
5050 tf_warning_or_error);
5055 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
5057 tree instance = TREE_OPERAND (postfix_expression, 0);
5058 tree fn = TREE_OPERAND (postfix_expression, 1);
5060 if (processing_template_decl
5061 && (type_dependent_expression_p (instance)
5062 || (!BASELINK_P (fn)
5063 && TREE_CODE (fn) != FIELD_DECL)
5064 || type_dependent_expression_p (fn)
5065 || any_type_dependent_arguments_p (args)))
5068 = build_nt_call_vec (postfix_expression, args);
5069 release_tree_vector (args);
5073 if (BASELINK_P (fn))
5076 = (build_new_method_call
5077 (instance, fn, &args, NULL_TREE,
5078 (idk == CP_ID_KIND_QUALIFIED
5079 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
5082 tf_warning_or_error));
5086 = finish_call_expr (postfix_expression, &args,
5087 /*disallow_virtual=*/false,
5089 tf_warning_or_error);
5091 else if (TREE_CODE (postfix_expression) == OFFSET_REF
5092 || TREE_CODE (postfix_expression) == MEMBER_REF
5093 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
5094 postfix_expression = (build_offset_ref_call_from_tree
5095 (postfix_expression, &args));
5096 else if (idk == CP_ID_KIND_QUALIFIED)
5097 /* A call to a static class member, or a namespace-scope
5100 = finish_call_expr (postfix_expression, &args,
5101 /*disallow_virtual=*/true,
5103 tf_warning_or_error);
5105 /* All other function calls. */
5107 = finish_call_expr (postfix_expression, &args,
5108 /*disallow_virtual=*/false,
5110 tf_warning_or_error);
5112 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5113 idk = CP_ID_KIND_NONE;
5115 release_tree_vector (args);
5121 /* postfix-expression . template [opt] id-expression
5122 postfix-expression . pseudo-destructor-name
5123 postfix-expression -> template [opt] id-expression
5124 postfix-expression -> pseudo-destructor-name */
5126 /* Consume the `.' or `->' operator. */
5127 cp_lexer_consume_token (parser->lexer);
5130 = cp_parser_postfix_dot_deref_expression (parser, token->type,
5135 is_member_access = true;
5139 /* postfix-expression ++ */
5140 /* Consume the `++' token. */
5141 cp_lexer_consume_token (parser->lexer);
5142 /* Generate a representation for the complete expression. */
5144 = finish_increment_expr (postfix_expression,
5145 POSTINCREMENT_EXPR);
5146 /* Increments may not appear in constant-expressions. */
5147 if (cp_parser_non_integral_constant_expression (parser, NIC_INC))
5148 postfix_expression = error_mark_node;
5149 idk = CP_ID_KIND_NONE;
5150 is_member_access = false;
5153 case CPP_MINUS_MINUS:
5154 /* postfix-expression -- */
5155 /* Consume the `--' token. */
5156 cp_lexer_consume_token (parser->lexer);
5157 /* Generate a representation for the complete expression. */
5159 = finish_increment_expr (postfix_expression,
5160 POSTDECREMENT_EXPR);
5161 /* Decrements may not appear in constant-expressions. */
5162 if (cp_parser_non_integral_constant_expression (parser, NIC_DEC))
5163 postfix_expression = error_mark_node;
5164 idk = CP_ID_KIND_NONE;
5165 is_member_access = false;
5169 if (pidk_return != NULL)
5170 * pidk_return = idk;
5171 if (member_access_only_p)
5172 return is_member_access? postfix_expression : error_mark_node;
5174 return postfix_expression;
5178 /* We should never get here. */
5180 return error_mark_node;
5183 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5184 by cp_parser_builtin_offsetof. We're looking for
5186 postfix-expression [ expression ]
5188 FOR_OFFSETOF is set if we're being called in that context, which
5189 changes how we deal with integer constant expressions. */
5192 cp_parser_postfix_open_square_expression (cp_parser *parser,
5193 tree postfix_expression,
5198 /* Consume the `[' token. */
5199 cp_lexer_consume_token (parser->lexer);
5201 /* Parse the index expression. */
5202 /* ??? For offsetof, there is a question of what to allow here. If
5203 offsetof is not being used in an integral constant expression context,
5204 then we *could* get the right answer by computing the value at runtime.
5205 If we are in an integral constant expression context, then we might
5206 could accept any constant expression; hard to say without analysis.
5207 Rather than open the barn door too wide right away, allow only integer
5208 constant expressions here. */
5210 index = cp_parser_constant_expression (parser, false, NULL);
5212 index = cp_parser_expression (parser, /*cast_p=*/false, NULL);
5214 /* Look for the closing `]'. */
5215 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
5217 /* Build the ARRAY_REF. */
5218 postfix_expression = grok_array_decl (postfix_expression, index);
5220 /* When not doing offsetof, array references are not permitted in
5221 constant-expressions. */
5223 && (cp_parser_non_integral_constant_expression (parser, NIC_ARRAY_REF)))
5224 postfix_expression = error_mark_node;
5226 return postfix_expression;
5229 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5230 by cp_parser_builtin_offsetof. We're looking for
5232 postfix-expression . template [opt] id-expression
5233 postfix-expression . pseudo-destructor-name
5234 postfix-expression -> template [opt] id-expression
5235 postfix-expression -> pseudo-destructor-name
5237 FOR_OFFSETOF is set if we're being called in that context. That sorta
5238 limits what of the above we'll actually accept, but nevermind.
5239 TOKEN_TYPE is the "." or "->" token, which will already have been
5240 removed from the stream. */
5243 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
5244 enum cpp_ttype token_type,
5245 tree postfix_expression,
5246 bool for_offsetof, cp_id_kind *idk,
5247 location_t location)
5251 bool pseudo_destructor_p;
5252 tree scope = NULL_TREE;
5254 /* If this is a `->' operator, dereference the pointer. */
5255 if (token_type == CPP_DEREF)
5256 postfix_expression = build_x_arrow (postfix_expression);
5257 /* Check to see whether or not the expression is type-dependent. */
5258 dependent_p = type_dependent_expression_p (postfix_expression);
5259 /* The identifier following the `->' or `.' is not qualified. */
5260 parser->scope = NULL_TREE;
5261 parser->qualifying_scope = NULL_TREE;
5262 parser->object_scope = NULL_TREE;
5263 *idk = CP_ID_KIND_NONE;
5265 /* Enter the scope corresponding to the type of the object
5266 given by the POSTFIX_EXPRESSION. */
5267 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
5269 scope = TREE_TYPE (postfix_expression);
5270 /* According to the standard, no expression should ever have
5271 reference type. Unfortunately, we do not currently match
5272 the standard in this respect in that our internal representation
5273 of an expression may have reference type even when the standard
5274 says it does not. Therefore, we have to manually obtain the
5275 underlying type here. */
5276 scope = non_reference (scope);
5277 /* The type of the POSTFIX_EXPRESSION must be complete. */
5278 if (scope == unknown_type_node)
5280 error_at (location, "%qE does not have class type",
5281 postfix_expression);
5285 scope = complete_type_or_else (scope, NULL_TREE);
5286 /* Let the name lookup machinery know that we are processing a
5287 class member access expression. */
5288 parser->context->object_type = scope;
5289 /* If something went wrong, we want to be able to discern that case,
5290 as opposed to the case where there was no SCOPE due to the type
5291 of expression being dependent. */
5293 scope = error_mark_node;
5294 /* If the SCOPE was erroneous, make the various semantic analysis
5295 functions exit quickly -- and without issuing additional error
5297 if (scope == error_mark_node)
5298 postfix_expression = error_mark_node;
5301 /* Assume this expression is not a pseudo-destructor access. */
5302 pseudo_destructor_p = false;
5304 /* If the SCOPE is a scalar type, then, if this is a valid program,
5305 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5306 is type dependent, it can be pseudo-destructor-name or something else.
5307 Try to parse it as pseudo-destructor-name first. */
5308 if ((scope && SCALAR_TYPE_P (scope)) || dependent_p)
5313 cp_parser_parse_tentatively (parser);
5314 /* Parse the pseudo-destructor-name. */
5316 cp_parser_pseudo_destructor_name (parser, &s, &type);
5318 && (cp_parser_error_occurred (parser)
5319 || TREE_CODE (type) != TYPE_DECL
5320 || !SCALAR_TYPE_P (TREE_TYPE (type))))
5321 cp_parser_abort_tentative_parse (parser);
5322 else if (cp_parser_parse_definitely (parser))
5324 pseudo_destructor_p = true;
5326 = finish_pseudo_destructor_expr (postfix_expression,
5327 s, TREE_TYPE (type));
5331 if (!pseudo_destructor_p)
5333 /* If the SCOPE is not a scalar type, we are looking at an
5334 ordinary class member access expression, rather than a
5335 pseudo-destructor-name. */
5337 cp_token *token = cp_lexer_peek_token (parser->lexer);
5338 /* Parse the id-expression. */
5339 name = (cp_parser_id_expression
5341 cp_parser_optional_template_keyword (parser),
5342 /*check_dependency_p=*/true,
5344 /*declarator_p=*/false,
5345 /*optional_p=*/false));
5346 /* In general, build a SCOPE_REF if the member name is qualified.
5347 However, if the name was not dependent and has already been
5348 resolved; there is no need to build the SCOPE_REF. For example;
5350 struct X { void f(); };
5351 template <typename T> void f(T* t) { t->X::f(); }
5353 Even though "t" is dependent, "X::f" is not and has been resolved
5354 to a BASELINK; there is no need to include scope information. */
5356 /* But we do need to remember that there was an explicit scope for
5357 virtual function calls. */
5359 *idk = CP_ID_KIND_QUALIFIED;
5361 /* If the name is a template-id that names a type, we will get a
5362 TYPE_DECL here. That is invalid code. */
5363 if (TREE_CODE (name) == TYPE_DECL)
5365 error_at (token->location, "invalid use of %qD", name);
5366 postfix_expression = error_mark_node;
5370 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
5372 name = build_qualified_name (/*type=*/NULL_TREE,
5376 parser->scope = NULL_TREE;
5377 parser->qualifying_scope = NULL_TREE;
5378 parser->object_scope = NULL_TREE;
5380 if (scope && name && BASELINK_P (name))
5381 adjust_result_of_qualified_name_lookup
5382 (name, BINFO_TYPE (BASELINK_ACCESS_BINFO (name)), scope);
5384 = finish_class_member_access_expr (postfix_expression, name,
5386 tf_warning_or_error);
5390 /* We no longer need to look up names in the scope of the object on
5391 the left-hand side of the `.' or `->' operator. */
5392 parser->context->object_type = NULL_TREE;
5394 /* Outside of offsetof, these operators may not appear in
5395 constant-expressions. */
5397 && (cp_parser_non_integral_constant_expression
5398 (parser, token_type == CPP_DEREF ? NIC_ARROW : NIC_POINT)))
5399 postfix_expression = error_mark_node;
5401 return postfix_expression;
5404 /* Parse a parenthesized expression-list.
5407 assignment-expression
5408 expression-list, assignment-expression
5413 identifier, expression-list
5415 CAST_P is true if this expression is the target of a cast.
5417 ALLOW_EXPANSION_P is true if this expression allows expansion of an
5420 Returns a vector of trees. Each element is a representation of an
5421 assignment-expression. NULL is returned if the ( and or ) are
5422 missing. An empty, but allocated, vector is returned on no
5423 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
5424 if we are parsing an attribute list for an attribute that wants a
5425 plain identifier argument, normal_attr for an attribute that wants
5426 an expression, or non_attr if we aren't parsing an attribute list. If
5427 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
5428 not all of the expressions in the list were constant. */
5430 static VEC(tree,gc) *
5431 cp_parser_parenthesized_expression_list (cp_parser* parser,
5432 int is_attribute_list,
5434 bool allow_expansion_p,
5435 bool *non_constant_p)
5437 VEC(tree,gc) *expression_list;
5438 bool fold_expr_p = is_attribute_list != non_attr;
5439 tree identifier = NULL_TREE;
5440 bool saved_greater_than_is_operator_p;
5442 /* Assume all the expressions will be constant. */
5444 *non_constant_p = false;
5446 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
5449 expression_list = make_tree_vector ();
5451 /* Within a parenthesized expression, a `>' token is always
5452 the greater-than operator. */
5453 saved_greater_than_is_operator_p
5454 = parser->greater_than_is_operator_p;
5455 parser->greater_than_is_operator_p = true;
5457 /* Consume expressions until there are no more. */
5458 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
5463 /* At the beginning of attribute lists, check to see if the
5464 next token is an identifier. */
5465 if (is_attribute_list == id_attr
5466 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
5470 /* Consume the identifier. */
5471 token = cp_lexer_consume_token (parser->lexer);
5472 /* Save the identifier. */
5473 identifier = token->u.value;
5477 bool expr_non_constant_p;
5479 /* Parse the next assignment-expression. */
5480 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5482 /* A braced-init-list. */
5483 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
5484 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
5485 if (non_constant_p && expr_non_constant_p)
5486 *non_constant_p = true;
5488 else if (non_constant_p)
5490 expr = (cp_parser_constant_expression
5491 (parser, /*allow_non_constant_p=*/true,
5492 &expr_non_constant_p));
5493 if (expr_non_constant_p)
5494 *non_constant_p = true;
5497 expr = cp_parser_assignment_expression (parser, cast_p, NULL);
5500 expr = fold_non_dependent_expr (expr);
5502 /* If we have an ellipsis, then this is an expression
5504 if (allow_expansion_p
5505 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
5507 /* Consume the `...'. */
5508 cp_lexer_consume_token (parser->lexer);
5510 /* Build the argument pack. */
5511 expr = make_pack_expansion (expr);
5514 /* Add it to the list. We add error_mark_node
5515 expressions to the list, so that we can still tell if
5516 the correct form for a parenthesized expression-list
5517 is found. That gives better errors. */
5518 VEC_safe_push (tree, gc, expression_list, expr);
5520 if (expr == error_mark_node)
5524 /* After the first item, attribute lists look the same as
5525 expression lists. */
5526 is_attribute_list = non_attr;
5529 /* If the next token isn't a `,', then we are done. */
5530 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5533 /* Otherwise, consume the `,' and keep going. */
5534 cp_lexer_consume_token (parser->lexer);
5537 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
5542 /* We try and resync to an unnested comma, as that will give the
5543 user better diagnostics. */
5544 ending = cp_parser_skip_to_closing_parenthesis (parser,
5545 /*recovering=*/true,
5547 /*consume_paren=*/true);
5552 parser->greater_than_is_operator_p
5553 = saved_greater_than_is_operator_p;
5558 parser->greater_than_is_operator_p
5559 = saved_greater_than_is_operator_p;
5562 VEC_safe_insert (tree, gc, expression_list, 0, identifier);
5564 return expression_list;
5567 /* Parse a pseudo-destructor-name.
5569 pseudo-destructor-name:
5570 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
5571 :: [opt] nested-name-specifier template template-id :: ~ type-name
5572 :: [opt] nested-name-specifier [opt] ~ type-name
5574 If either of the first two productions is used, sets *SCOPE to the
5575 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
5576 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
5577 or ERROR_MARK_NODE if the parse fails. */
5580 cp_parser_pseudo_destructor_name (cp_parser* parser,
5584 bool nested_name_specifier_p;
5586 /* Assume that things will not work out. */
5587 *type = error_mark_node;
5589 /* Look for the optional `::' operator. */
5590 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
5591 /* Look for the optional nested-name-specifier. */
5592 nested_name_specifier_p
5593 = (cp_parser_nested_name_specifier_opt (parser,
5594 /*typename_keyword_p=*/false,
5595 /*check_dependency_p=*/true,
5597 /*is_declaration=*/false)
5599 /* Now, if we saw a nested-name-specifier, we might be doing the
5600 second production. */
5601 if (nested_name_specifier_p
5602 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
5604 /* Consume the `template' keyword. */
5605 cp_lexer_consume_token (parser->lexer);
5606 /* Parse the template-id. */
5607 cp_parser_template_id (parser,
5608 /*template_keyword_p=*/true,
5609 /*check_dependency_p=*/false,
5610 /*is_declaration=*/true);
5611 /* Look for the `::' token. */
5612 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
5614 /* If the next token is not a `~', then there might be some
5615 additional qualification. */
5616 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
5618 /* At this point, we're looking for "type-name :: ~". The type-name
5619 must not be a class-name, since this is a pseudo-destructor. So,
5620 it must be either an enum-name, or a typedef-name -- both of which
5621 are just identifiers. So, we peek ahead to check that the "::"
5622 and "~" tokens are present; if they are not, then we can avoid
5623 calling type_name. */
5624 if (cp_lexer_peek_token (parser->lexer)->type != CPP_NAME
5625 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE
5626 || cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_COMPL)
5628 cp_parser_error (parser, "non-scalar type");
5632 /* Look for the type-name. */
5633 *scope = TREE_TYPE (cp_parser_nonclass_name (parser));
5634 if (*scope == error_mark_node)
5637 /* Look for the `::' token. */
5638 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
5643 /* Look for the `~'. */
5644 cp_parser_require (parser, CPP_COMPL, RT_COMPL);
5646 /* Once we see the ~, this has to be a pseudo-destructor. */
5647 if (!processing_template_decl && !cp_parser_error_occurred (parser))
5648 cp_parser_commit_to_tentative_parse (parser);
5650 /* Look for the type-name again. We are not responsible for
5651 checking that it matches the first type-name. */
5652 *type = cp_parser_nonclass_name (parser);
5655 /* Parse a unary-expression.
5661 unary-operator cast-expression
5662 sizeof unary-expression
5664 alignof ( type-id ) [C++0x]
5671 __extension__ cast-expression
5672 __alignof__ unary-expression
5673 __alignof__ ( type-id )
5674 alignof unary-expression [C++0x]
5675 __real__ cast-expression
5676 __imag__ cast-expression
5679 ADDRESS_P is true iff the unary-expression is appearing as the
5680 operand of the `&' operator. CAST_P is true if this expression is
5681 the target of a cast.
5683 Returns a representation of the expression. */
5686 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p,
5690 enum tree_code unary_operator;
5692 /* Peek at the next token. */
5693 token = cp_lexer_peek_token (parser->lexer);
5694 /* Some keywords give away the kind of expression. */
5695 if (token->type == CPP_KEYWORD)
5697 enum rid keyword = token->keyword;
5707 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
5708 /* Consume the token. */
5709 cp_lexer_consume_token (parser->lexer);
5710 /* Parse the operand. */
5711 operand = cp_parser_sizeof_operand (parser, keyword);
5713 if (TYPE_P (operand))
5714 return cxx_sizeof_or_alignof_type (operand, op, true);
5717 /* ISO C++ defines alignof only with types, not with
5718 expressions. So pedwarn if alignof is used with a non-
5719 type expression. However, __alignof__ is ok. */
5720 if (!strcmp (IDENTIFIER_POINTER (token->u.value), "alignof"))
5721 pedwarn (token->location, OPT_pedantic,
5722 "ISO C++ does not allow %<alignof%> "
5725 return cxx_sizeof_or_alignof_expr (operand, op, true);
5730 return cp_parser_new_expression (parser);
5733 return cp_parser_delete_expression (parser);
5737 /* The saved value of the PEDANTIC flag. */
5741 /* Save away the PEDANTIC flag. */
5742 cp_parser_extension_opt (parser, &saved_pedantic);
5743 /* Parse the cast-expression. */
5744 expr = cp_parser_simple_cast_expression (parser);
5745 /* Restore the PEDANTIC flag. */
5746 pedantic = saved_pedantic;
5756 /* Consume the `__real__' or `__imag__' token. */
5757 cp_lexer_consume_token (parser->lexer);
5758 /* Parse the cast-expression. */
5759 expression = cp_parser_simple_cast_expression (parser);
5760 /* Create the complete representation. */
5761 return build_x_unary_op ((keyword == RID_REALPART
5762 ? REALPART_EXPR : IMAGPART_EXPR),
5764 tf_warning_or_error);
5771 const char *saved_message;
5772 bool saved_integral_constant_expression_p;
5773 bool saved_non_integral_constant_expression_p;
5774 bool saved_greater_than_is_operator_p;
5776 cp_lexer_consume_token (parser->lexer);
5777 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
5779 saved_message = parser->type_definition_forbidden_message;
5780 parser->type_definition_forbidden_message
5781 = G_("types may not be defined in %<noexcept%> expressions");
5783 saved_integral_constant_expression_p
5784 = parser->integral_constant_expression_p;
5785 saved_non_integral_constant_expression_p
5786 = parser->non_integral_constant_expression_p;
5787 parser->integral_constant_expression_p = false;
5789 saved_greater_than_is_operator_p
5790 = parser->greater_than_is_operator_p;
5791 parser->greater_than_is_operator_p = true;
5793 ++cp_unevaluated_operand;
5794 ++c_inhibit_evaluation_warnings;
5795 expr = cp_parser_expression (parser, false, NULL);
5796 --c_inhibit_evaluation_warnings;
5797 --cp_unevaluated_operand;
5799 parser->greater_than_is_operator_p
5800 = saved_greater_than_is_operator_p;
5802 parser->integral_constant_expression_p
5803 = saved_integral_constant_expression_p;
5804 parser->non_integral_constant_expression_p
5805 = saved_non_integral_constant_expression_p;
5807 parser->type_definition_forbidden_message = saved_message;
5809 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5810 return finish_noexcept_expr (expr, tf_warning_or_error);
5818 /* Look for the `:: new' and `:: delete', which also signal the
5819 beginning of a new-expression, or delete-expression,
5820 respectively. If the next token is `::', then it might be one of
5822 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
5826 /* See if the token after the `::' is one of the keywords in
5827 which we're interested. */
5828 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
5829 /* If it's `new', we have a new-expression. */
5830 if (keyword == RID_NEW)
5831 return cp_parser_new_expression (parser);
5832 /* Similarly, for `delete'. */
5833 else if (keyword == RID_DELETE)
5834 return cp_parser_delete_expression (parser);
5837 /* Look for a unary operator. */
5838 unary_operator = cp_parser_unary_operator (token);
5839 /* The `++' and `--' operators can be handled similarly, even though
5840 they are not technically unary-operators in the grammar. */
5841 if (unary_operator == ERROR_MARK)
5843 if (token->type == CPP_PLUS_PLUS)
5844 unary_operator = PREINCREMENT_EXPR;
5845 else if (token->type == CPP_MINUS_MINUS)
5846 unary_operator = PREDECREMENT_EXPR;
5847 /* Handle the GNU address-of-label extension. */
5848 else if (cp_parser_allow_gnu_extensions_p (parser)
5849 && token->type == CPP_AND_AND)
5853 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
5855 /* Consume the '&&' token. */
5856 cp_lexer_consume_token (parser->lexer);
5857 /* Look for the identifier. */
5858 identifier = cp_parser_identifier (parser);
5859 /* Create an expression representing the address. */
5860 expression = finish_label_address_expr (identifier, loc);
5861 if (cp_parser_non_integral_constant_expression (parser,
5863 expression = error_mark_node;
5867 if (unary_operator != ERROR_MARK)
5869 tree cast_expression;
5870 tree expression = error_mark_node;
5871 non_integral_constant non_constant_p = NIC_NONE;
5873 /* Consume the operator token. */
5874 token = cp_lexer_consume_token (parser->lexer);
5875 /* Parse the cast-expression. */
5877 = cp_parser_cast_expression (parser,
5878 unary_operator == ADDR_EXPR,
5879 /*cast_p=*/false, pidk);
5880 /* Now, build an appropriate representation. */
5881 switch (unary_operator)
5884 non_constant_p = NIC_STAR;
5885 expression = build_x_indirect_ref (cast_expression, RO_UNARY_STAR,
5886 tf_warning_or_error);
5890 non_constant_p = NIC_ADDR;
5893 expression = build_x_unary_op (unary_operator, cast_expression,
5894 tf_warning_or_error);
5897 case PREINCREMENT_EXPR:
5898 case PREDECREMENT_EXPR:
5899 non_constant_p = unary_operator == PREINCREMENT_EXPR
5900 ? NIC_PREINCREMENT : NIC_PREDECREMENT;
5902 case UNARY_PLUS_EXPR:
5904 case TRUTH_NOT_EXPR:
5905 expression = finish_unary_op_expr (unary_operator, cast_expression);
5912 if (non_constant_p != NIC_NONE
5913 && cp_parser_non_integral_constant_expression (parser,
5915 expression = error_mark_node;
5920 return cp_parser_postfix_expression (parser, address_p, cast_p,
5921 /*member_access_only_p=*/false,
5925 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5926 unary-operator, the corresponding tree code is returned. */
5928 static enum tree_code
5929 cp_parser_unary_operator (cp_token* token)
5931 switch (token->type)
5934 return INDIRECT_REF;
5940 return UNARY_PLUS_EXPR;
5946 return TRUTH_NOT_EXPR;
5949 return BIT_NOT_EXPR;
5956 /* Parse a new-expression.
5959 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5960 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5962 Returns a representation of the expression. */
5965 cp_parser_new_expression (cp_parser* parser)
5967 bool global_scope_p;
5968 VEC(tree,gc) *placement;
5970 VEC(tree,gc) *initializer;
5974 /* Look for the optional `::' operator. */
5976 = (cp_parser_global_scope_opt (parser,
5977 /*current_scope_valid_p=*/false)
5979 /* Look for the `new' operator. */
5980 cp_parser_require_keyword (parser, RID_NEW, RT_NEW);
5981 /* There's no easy way to tell a new-placement from the
5982 `( type-id )' construct. */
5983 cp_parser_parse_tentatively (parser);
5984 /* Look for a new-placement. */
5985 placement = cp_parser_new_placement (parser);
5986 /* If that didn't work out, there's no new-placement. */
5987 if (!cp_parser_parse_definitely (parser))
5989 if (placement != NULL)
5990 release_tree_vector (placement);
5994 /* If the next token is a `(', then we have a parenthesized
5996 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5999 /* Consume the `('. */
6000 cp_lexer_consume_token (parser->lexer);
6001 /* Parse the type-id. */
6002 type = cp_parser_type_id (parser);
6003 /* Look for the closing `)'. */
6004 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
6005 token = cp_lexer_peek_token (parser->lexer);
6006 /* There should not be a direct-new-declarator in this production,
6007 but GCC used to allowed this, so we check and emit a sensible error
6008 message for this case. */
6009 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6011 error_at (token->location,
6012 "array bound forbidden after parenthesized type-id");
6013 inform (token->location,
6014 "try removing the parentheses around the type-id");
6015 cp_parser_direct_new_declarator (parser);
6019 /* Otherwise, there must be a new-type-id. */
6021 type = cp_parser_new_type_id (parser, &nelts);
6023 /* If the next token is a `(' or '{', then we have a new-initializer. */
6024 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
6025 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6026 initializer = cp_parser_new_initializer (parser);
6030 /* A new-expression may not appear in an integral constant
6032 if (cp_parser_non_integral_constant_expression (parser, NIC_NEW))
6033 ret = error_mark_node;
6036 /* Create a representation of the new-expression. */
6037 ret = build_new (&placement, type, nelts, &initializer, global_scope_p,
6038 tf_warning_or_error);
6041 if (placement != NULL)
6042 release_tree_vector (placement);
6043 if (initializer != NULL)
6044 release_tree_vector (initializer);
6049 /* Parse a new-placement.
6054 Returns the same representation as for an expression-list. */
6056 static VEC(tree,gc) *
6057 cp_parser_new_placement (cp_parser* parser)
6059 VEC(tree,gc) *expression_list;
6061 /* Parse the expression-list. */
6062 expression_list = (cp_parser_parenthesized_expression_list
6063 (parser, non_attr, /*cast_p=*/false,
6064 /*allow_expansion_p=*/true,
6065 /*non_constant_p=*/NULL));
6067 return expression_list;
6070 /* Parse a new-type-id.
6073 type-specifier-seq new-declarator [opt]
6075 Returns the TYPE allocated. If the new-type-id indicates an array
6076 type, *NELTS is set to the number of elements in the last array
6077 bound; the TYPE will not include the last array bound. */
6080 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
6082 cp_decl_specifier_seq type_specifier_seq;
6083 cp_declarator *new_declarator;
6084 cp_declarator *declarator;
6085 cp_declarator *outer_declarator;
6086 const char *saved_message;
6089 /* The type-specifier sequence must not contain type definitions.
6090 (It cannot contain declarations of new types either, but if they
6091 are not definitions we will catch that because they are not
6093 saved_message = parser->type_definition_forbidden_message;
6094 parser->type_definition_forbidden_message
6095 = G_("types may not be defined in a new-type-id");
6096 /* Parse the type-specifier-seq. */
6097 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
6098 /*is_trailing_return=*/false,
6099 &type_specifier_seq);
6100 /* Restore the old message. */
6101 parser->type_definition_forbidden_message = saved_message;
6102 /* Parse the new-declarator. */
6103 new_declarator = cp_parser_new_declarator_opt (parser);
6105 /* Determine the number of elements in the last array dimension, if
6108 /* Skip down to the last array dimension. */
6109 declarator = new_declarator;
6110 outer_declarator = NULL;
6111 while (declarator && (declarator->kind == cdk_pointer
6112 || declarator->kind == cdk_ptrmem))
6114 outer_declarator = declarator;
6115 declarator = declarator->declarator;
6118 && declarator->kind == cdk_array
6119 && declarator->declarator
6120 && declarator->declarator->kind == cdk_array)
6122 outer_declarator = declarator;
6123 declarator = declarator->declarator;
6126 if (declarator && declarator->kind == cdk_array)
6128 *nelts = declarator->u.array.bounds;
6129 if (*nelts == error_mark_node)
6130 *nelts = integer_one_node;
6132 if (outer_declarator)
6133 outer_declarator->declarator = declarator->declarator;
6135 new_declarator = NULL;
6138 type = groktypename (&type_specifier_seq, new_declarator, false);
6142 /* Parse an (optional) new-declarator.
6145 ptr-operator new-declarator [opt]
6146 direct-new-declarator
6148 Returns the declarator. */
6150 static cp_declarator *
6151 cp_parser_new_declarator_opt (cp_parser* parser)
6153 enum tree_code code;
6155 cp_cv_quals cv_quals;
6157 /* We don't know if there's a ptr-operator next, or not. */
6158 cp_parser_parse_tentatively (parser);
6159 /* Look for a ptr-operator. */
6160 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
6161 /* If that worked, look for more new-declarators. */
6162 if (cp_parser_parse_definitely (parser))
6164 cp_declarator *declarator;
6166 /* Parse another optional declarator. */
6167 declarator = cp_parser_new_declarator_opt (parser);
6169 return cp_parser_make_indirect_declarator
6170 (code, type, cv_quals, declarator);
6173 /* If the next token is a `[', there is a direct-new-declarator. */
6174 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6175 return cp_parser_direct_new_declarator (parser);
6180 /* Parse a direct-new-declarator.
6182 direct-new-declarator:
6184 direct-new-declarator [constant-expression]
6188 static cp_declarator *
6189 cp_parser_direct_new_declarator (cp_parser* parser)
6191 cp_declarator *declarator = NULL;
6197 /* Look for the opening `['. */
6198 cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE);
6199 /* The first expression is not required to be constant. */
6202 cp_token *token = cp_lexer_peek_token (parser->lexer);
6203 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
6204 /* The standard requires that the expression have integral
6205 type. DR 74 adds enumeration types. We believe that the
6206 real intent is that these expressions be handled like the
6207 expression in a `switch' condition, which also allows
6208 classes with a single conversion to integral or
6209 enumeration type. */
6210 if (!processing_template_decl)
6213 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
6218 error_at (token->location,
6219 "expression in new-declarator must have integral "
6220 "or enumeration type");
6221 expression = error_mark_node;
6225 /* But all the other expressions must be. */
6228 = cp_parser_constant_expression (parser,
6229 /*allow_non_constant=*/false,
6231 /* Look for the closing `]'. */
6232 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
6234 /* Add this bound to the declarator. */
6235 declarator = make_array_declarator (declarator, expression);
6237 /* If the next token is not a `[', then there are no more
6239 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
6246 /* Parse a new-initializer.
6249 ( expression-list [opt] )
6252 Returns a representation of the expression-list. */
6254 static VEC(tree,gc) *
6255 cp_parser_new_initializer (cp_parser* parser)
6257 VEC(tree,gc) *expression_list;
6259 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6262 bool expr_non_constant_p;
6263 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
6264 t = cp_parser_braced_list (parser, &expr_non_constant_p);
6265 CONSTRUCTOR_IS_DIRECT_INIT (t) = 1;
6266 expression_list = make_tree_vector_single (t);
6269 expression_list = (cp_parser_parenthesized_expression_list
6270 (parser, non_attr, /*cast_p=*/false,
6271 /*allow_expansion_p=*/true,
6272 /*non_constant_p=*/NULL));
6274 return expression_list;
6277 /* Parse a delete-expression.
6280 :: [opt] delete cast-expression
6281 :: [opt] delete [ ] cast-expression
6283 Returns a representation of the expression. */
6286 cp_parser_delete_expression (cp_parser* parser)
6288 bool global_scope_p;
6292 /* Look for the optional `::' operator. */
6294 = (cp_parser_global_scope_opt (parser,
6295 /*current_scope_valid_p=*/false)
6297 /* Look for the `delete' keyword. */
6298 cp_parser_require_keyword (parser, RID_DELETE, RT_DELETE);
6299 /* See if the array syntax is in use. */
6300 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6302 /* Consume the `[' token. */
6303 cp_lexer_consume_token (parser->lexer);
6304 /* Look for the `]' token. */
6305 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
6306 /* Remember that this is the `[]' construct. */
6312 /* Parse the cast-expression. */
6313 expression = cp_parser_simple_cast_expression (parser);
6315 /* A delete-expression may not appear in an integral constant
6317 if (cp_parser_non_integral_constant_expression (parser, NIC_DEL))
6318 return error_mark_node;
6320 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p,
6321 tf_warning_or_error);
6324 /* Returns true if TOKEN may start a cast-expression and false
6328 cp_parser_token_starts_cast_expression (cp_token *token)
6330 switch (token->type)
6336 case CPP_CLOSE_SQUARE:
6337 case CPP_CLOSE_PAREN:
6338 case CPP_CLOSE_BRACE:
6342 case CPP_DEREF_STAR:
6350 case CPP_GREATER_EQ:
6370 /* '[' may start a primary-expression in obj-c++. */
6371 case CPP_OPEN_SQUARE:
6372 return c_dialect_objc ();
6379 /* Parse a cast-expression.
6383 ( type-id ) cast-expression
6385 ADDRESS_P is true iff the unary-expression is appearing as the
6386 operand of the `&' operator. CAST_P is true if this expression is
6387 the target of a cast.
6389 Returns a representation of the expression. */
6392 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p,
6395 /* If it's a `(', then we might be looking at a cast. */
6396 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
6398 tree type = NULL_TREE;
6399 tree expr = NULL_TREE;
6400 bool compound_literal_p;
6401 const char *saved_message;
6403 /* There's no way to know yet whether or not this is a cast.
6404 For example, `(int (3))' is a unary-expression, while `(int)
6405 3' is a cast. So, we resort to parsing tentatively. */
6406 cp_parser_parse_tentatively (parser);
6407 /* Types may not be defined in a cast. */
6408 saved_message = parser->type_definition_forbidden_message;
6409 parser->type_definition_forbidden_message
6410 = G_("types may not be defined in casts");
6411 /* Consume the `('. */
6412 cp_lexer_consume_token (parser->lexer);
6413 /* A very tricky bit is that `(struct S) { 3 }' is a
6414 compound-literal (which we permit in C++ as an extension).
6415 But, that construct is not a cast-expression -- it is a
6416 postfix-expression. (The reason is that `(struct S) { 3 }.i'
6417 is legal; if the compound-literal were a cast-expression,
6418 you'd need an extra set of parentheses.) But, if we parse
6419 the type-id, and it happens to be a class-specifier, then we
6420 will commit to the parse at that point, because we cannot
6421 undo the action that is done when creating a new class. So,
6422 then we cannot back up and do a postfix-expression.
6424 Therefore, we scan ahead to the closing `)', and check to see
6425 if the token after the `)' is a `{'. If so, we are not
6426 looking at a cast-expression.
6428 Save tokens so that we can put them back. */
6429 cp_lexer_save_tokens (parser->lexer);
6430 /* Skip tokens until the next token is a closing parenthesis.
6431 If we find the closing `)', and the next token is a `{', then
6432 we are looking at a compound-literal. */
6434 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
6435 /*consume_paren=*/true)
6436 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
6437 /* Roll back the tokens we skipped. */
6438 cp_lexer_rollback_tokens (parser->lexer);
6439 /* If we were looking at a compound-literal, simulate an error
6440 so that the call to cp_parser_parse_definitely below will
6442 if (compound_literal_p)
6443 cp_parser_simulate_error (parser);
6446 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
6447 parser->in_type_id_in_expr_p = true;
6448 /* Look for the type-id. */
6449 type = cp_parser_type_id (parser);
6450 /* Look for the closing `)'. */
6451 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
6452 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
6455 /* Restore the saved message. */
6456 parser->type_definition_forbidden_message = saved_message;
6458 /* At this point this can only be either a cast or a
6459 parenthesized ctor such as `(T ())' that looks like a cast to
6460 function returning T. */
6461 if (!cp_parser_error_occurred (parser)
6462 && cp_parser_token_starts_cast_expression (cp_lexer_peek_token
6465 cp_parser_parse_definitely (parser);
6466 expr = cp_parser_cast_expression (parser,
6467 /*address_p=*/false,
6468 /*cast_p=*/true, pidk);
6470 /* Warn about old-style casts, if so requested. */
6471 if (warn_old_style_cast
6472 && !in_system_header
6473 && !VOID_TYPE_P (type)
6474 && current_lang_name != lang_name_c)
6475 warning (OPT_Wold_style_cast, "use of old-style cast");
6477 /* Only type conversions to integral or enumeration types
6478 can be used in constant-expressions. */
6479 if (!cast_valid_in_integral_constant_expression_p (type)
6480 && cp_parser_non_integral_constant_expression (parser,
6482 return error_mark_node;
6484 /* Perform the cast. */
6485 expr = build_c_cast (input_location, type, expr);
6489 cp_parser_abort_tentative_parse (parser);
6492 /* If we get here, then it's not a cast, so it must be a
6493 unary-expression. */
6494 return cp_parser_unary_expression (parser, address_p, cast_p, pidk);
6497 /* Parse a binary expression of the general form:
6501 pm-expression .* cast-expression
6502 pm-expression ->* cast-expression
6504 multiplicative-expression:
6506 multiplicative-expression * pm-expression
6507 multiplicative-expression / pm-expression
6508 multiplicative-expression % pm-expression
6510 additive-expression:
6511 multiplicative-expression
6512 additive-expression + multiplicative-expression
6513 additive-expression - multiplicative-expression
6517 shift-expression << additive-expression
6518 shift-expression >> additive-expression
6520 relational-expression:
6522 relational-expression < shift-expression
6523 relational-expression > shift-expression
6524 relational-expression <= shift-expression
6525 relational-expression >= shift-expression
6529 relational-expression:
6530 relational-expression <? shift-expression
6531 relational-expression >? shift-expression
6533 equality-expression:
6534 relational-expression
6535 equality-expression == relational-expression
6536 equality-expression != relational-expression
6540 and-expression & equality-expression
6542 exclusive-or-expression:
6544 exclusive-or-expression ^ and-expression
6546 inclusive-or-expression:
6547 exclusive-or-expression
6548 inclusive-or-expression | exclusive-or-expression
6550 logical-and-expression:
6551 inclusive-or-expression
6552 logical-and-expression && inclusive-or-expression
6554 logical-or-expression:
6555 logical-and-expression
6556 logical-or-expression || logical-and-expression
6558 All these are implemented with a single function like:
6561 simple-cast-expression
6562 binary-expression <token> binary-expression
6564 CAST_P is true if this expression is the target of a cast.
6566 The binops_by_token map is used to get the tree codes for each <token> type.
6567 binary-expressions are associated according to a precedence table. */
6569 #define TOKEN_PRECEDENCE(token) \
6570 (((token->type == CPP_GREATER \
6571 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
6572 && !parser->greater_than_is_operator_p) \
6573 ? PREC_NOT_OPERATOR \
6574 : binops_by_token[token->type].prec)
6577 cp_parser_binary_expression (cp_parser* parser, bool cast_p,
6578 bool no_toplevel_fold_p,
6579 enum cp_parser_prec prec,
6582 cp_parser_expression_stack stack;
6583 cp_parser_expression_stack_entry *sp = &stack[0];
6586 enum tree_code tree_type, lhs_type, rhs_type;
6587 enum cp_parser_prec new_prec, lookahead_prec;
6590 /* Parse the first expression. */
6591 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p, pidk);
6592 lhs_type = ERROR_MARK;
6596 /* Get an operator token. */
6597 token = cp_lexer_peek_token (parser->lexer);
6599 if (warn_cxx0x_compat
6600 && token->type == CPP_RSHIFT
6601 && !parser->greater_than_is_operator_p)
6603 if (warning_at (token->location, OPT_Wc__0x_compat,
6604 "%<>>%> operator will be treated as"
6605 " two right angle brackets in C++0x"))
6606 inform (token->location,
6607 "suggest parentheses around %<>>%> expression");
6610 new_prec = TOKEN_PRECEDENCE (token);
6612 /* Popping an entry off the stack means we completed a subexpression:
6613 - either we found a token which is not an operator (`>' where it is not
6614 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
6615 will happen repeatedly;
6616 - or, we found an operator which has lower priority. This is the case
6617 where the recursive descent *ascends*, as in `3 * 4 + 5' after
6619 if (new_prec <= prec)
6628 tree_type = binops_by_token[token->type].tree_type;
6630 /* We used the operator token. */
6631 cp_lexer_consume_token (parser->lexer);
6633 /* For "false && x" or "true || x", x will never be executed;
6634 disable warnings while evaluating it. */
6635 if (tree_type == TRUTH_ANDIF_EXPR)
6636 c_inhibit_evaluation_warnings += lhs == truthvalue_false_node;
6637 else if (tree_type == TRUTH_ORIF_EXPR)
6638 c_inhibit_evaluation_warnings += lhs == truthvalue_true_node;
6640 /* Extract another operand. It may be the RHS of this expression
6641 or the LHS of a new, higher priority expression. */
6642 rhs = cp_parser_simple_cast_expression (parser);
6643 rhs_type = ERROR_MARK;
6645 /* Get another operator token. Look up its precedence to avoid
6646 building a useless (immediately popped) stack entry for common
6647 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
6648 token = cp_lexer_peek_token (parser->lexer);
6649 lookahead_prec = TOKEN_PRECEDENCE (token);
6650 if (lookahead_prec > new_prec)
6652 /* ... and prepare to parse the RHS of the new, higher priority
6653 expression. Since precedence levels on the stack are
6654 monotonically increasing, we do not have to care about
6657 sp->tree_type = tree_type;
6659 sp->lhs_type = lhs_type;
6662 lhs_type = rhs_type;
6664 new_prec = lookahead_prec;
6668 lookahead_prec = new_prec;
6669 /* If the stack is not empty, we have parsed into LHS the right side
6670 (`4' in the example above) of an expression we had suspended.
6671 We can use the information on the stack to recover the LHS (`3')
6672 from the stack together with the tree code (`MULT_EXPR'), and
6673 the precedence of the higher level subexpression
6674 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
6675 which will be used to actually build the additive expression. */
6678 tree_type = sp->tree_type;
6680 rhs_type = lhs_type;
6682 lhs_type = sp->lhs_type;
6685 /* Undo the disabling of warnings done above. */
6686 if (tree_type == TRUTH_ANDIF_EXPR)
6687 c_inhibit_evaluation_warnings -= lhs == truthvalue_false_node;
6688 else if (tree_type == TRUTH_ORIF_EXPR)
6689 c_inhibit_evaluation_warnings -= lhs == truthvalue_true_node;
6692 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
6693 ERROR_MARK for everything that is not a binary expression.
6694 This makes warn_about_parentheses miss some warnings that
6695 involve unary operators. For unary expressions we should
6696 pass the correct tree_code unless the unary expression was
6697 surrounded by parentheses.
6699 if (no_toplevel_fold_p
6700 && lookahead_prec <= prec
6702 && TREE_CODE_CLASS (tree_type) == tcc_comparison)
6703 lhs = build2 (tree_type, boolean_type_node, lhs, rhs);
6705 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
6706 &overload, tf_warning_or_error);
6707 lhs_type = tree_type;
6709 /* If the binary operator required the use of an overloaded operator,
6710 then this expression cannot be an integral constant-expression.
6711 An overloaded operator can be used even if both operands are
6712 otherwise permissible in an integral constant-expression if at
6713 least one of the operands is of enumeration type. */
6716 && cp_parser_non_integral_constant_expression (parser,
6718 return error_mark_node;
6725 /* Parse the `? expression : assignment-expression' part of a
6726 conditional-expression. The LOGICAL_OR_EXPR is the
6727 logical-or-expression that started the conditional-expression.
6728 Returns a representation of the entire conditional-expression.
6730 This routine is used by cp_parser_assignment_expression.
6732 ? expression : assignment-expression
6736 ? : assignment-expression */
6739 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
6742 tree assignment_expr;
6743 struct cp_token *token;
6745 /* Consume the `?' token. */
6746 cp_lexer_consume_token (parser->lexer);
6747 token = cp_lexer_peek_token (parser->lexer);
6748 if (cp_parser_allow_gnu_extensions_p (parser)
6749 && token->type == CPP_COLON)
6751 pedwarn (token->location, OPT_pedantic,
6752 "ISO C++ does not allow ?: with omitted middle operand");
6753 /* Implicit true clause. */
6755 c_inhibit_evaluation_warnings += logical_or_expr == truthvalue_true_node;
6756 warn_for_omitted_condop (token->location, logical_or_expr);
6760 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
6761 parser->colon_corrects_to_scope_p = false;
6762 /* Parse the expression. */
6763 c_inhibit_evaluation_warnings += logical_or_expr == truthvalue_false_node;
6764 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
6765 c_inhibit_evaluation_warnings +=
6766 ((logical_or_expr == truthvalue_true_node)
6767 - (logical_or_expr == truthvalue_false_node));
6768 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
6771 /* The next token should be a `:'. */
6772 cp_parser_require (parser, CPP_COLON, RT_COLON);
6773 /* Parse the assignment-expression. */
6774 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
6775 c_inhibit_evaluation_warnings -= logical_or_expr == truthvalue_true_node;
6777 /* Build the conditional-expression. */
6778 return build_x_conditional_expr (logical_or_expr,
6781 tf_warning_or_error);
6784 /* Parse an assignment-expression.
6786 assignment-expression:
6787 conditional-expression
6788 logical-or-expression assignment-operator assignment_expression
6791 CAST_P is true if this expression is the target of a cast.
6793 Returns a representation for the expression. */
6796 cp_parser_assignment_expression (cp_parser* parser, bool cast_p,
6801 /* If the next token is the `throw' keyword, then we're looking at
6802 a throw-expression. */
6803 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
6804 expr = cp_parser_throw_expression (parser);
6805 /* Otherwise, it must be that we are looking at a
6806 logical-or-expression. */
6809 /* Parse the binary expressions (logical-or-expression). */
6810 expr = cp_parser_binary_expression (parser, cast_p, false,
6811 PREC_NOT_OPERATOR, pidk);
6812 /* If the next token is a `?' then we're actually looking at a
6813 conditional-expression. */
6814 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
6815 return cp_parser_question_colon_clause (parser, expr);
6818 enum tree_code assignment_operator;
6820 /* If it's an assignment-operator, we're using the second
6823 = cp_parser_assignment_operator_opt (parser);
6824 if (assignment_operator != ERROR_MARK)
6826 bool non_constant_p;
6828 /* Parse the right-hand side of the assignment. */
6829 tree rhs = cp_parser_initializer_clause (parser, &non_constant_p);
6831 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6832 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
6834 /* An assignment may not appear in a
6835 constant-expression. */
6836 if (cp_parser_non_integral_constant_expression (parser,
6838 return error_mark_node;
6839 /* Build the assignment expression. */
6840 expr = build_x_modify_expr (expr,
6841 assignment_operator,
6843 tf_warning_or_error);
6851 /* Parse an (optional) assignment-operator.
6853 assignment-operator: one of
6854 = *= /= %= += -= >>= <<= &= ^= |=
6858 assignment-operator: one of
6861 If the next token is an assignment operator, the corresponding tree
6862 code is returned, and the token is consumed. For example, for
6863 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
6864 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
6865 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
6866 operator, ERROR_MARK is returned. */
6868 static enum tree_code
6869 cp_parser_assignment_operator_opt (cp_parser* parser)
6874 /* Peek at the next token. */
6875 token = cp_lexer_peek_token (parser->lexer);
6877 switch (token->type)
6888 op = TRUNC_DIV_EXPR;
6892 op = TRUNC_MOD_EXPR;
6924 /* Nothing else is an assignment operator. */
6928 /* If it was an assignment operator, consume it. */
6929 if (op != ERROR_MARK)
6930 cp_lexer_consume_token (parser->lexer);
6935 /* Parse an expression.
6938 assignment-expression
6939 expression , assignment-expression
6941 CAST_P is true if this expression is the target of a cast.
6943 Returns a representation of the expression. */
6946 cp_parser_expression (cp_parser* parser, bool cast_p, cp_id_kind * pidk)
6948 tree expression = NULL_TREE;
6952 tree assignment_expression;
6954 /* Parse the next assignment-expression. */
6955 assignment_expression
6956 = cp_parser_assignment_expression (parser, cast_p, pidk);
6957 /* If this is the first assignment-expression, we can just
6960 expression = assignment_expression;
6962 expression = build_x_compound_expr (expression,
6963 assignment_expression,
6964 tf_warning_or_error);
6965 /* If the next token is not a comma, then we are done with the
6967 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6969 /* Consume the `,'. */
6970 cp_lexer_consume_token (parser->lexer);
6971 /* A comma operator cannot appear in a constant-expression. */
6972 if (cp_parser_non_integral_constant_expression (parser, NIC_COMMA))
6973 expression = error_mark_node;
6979 /* Parse a constant-expression.
6981 constant-expression:
6982 conditional-expression
6984 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
6985 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
6986 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
6987 is false, NON_CONSTANT_P should be NULL. */
6990 cp_parser_constant_expression (cp_parser* parser,
6991 bool allow_non_constant_p,
6992 bool *non_constant_p)
6994 bool saved_integral_constant_expression_p;
6995 bool saved_allow_non_integral_constant_expression_p;
6996 bool saved_non_integral_constant_expression_p;
6999 /* It might seem that we could simply parse the
7000 conditional-expression, and then check to see if it were
7001 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7002 one that the compiler can figure out is constant, possibly after
7003 doing some simplifications or optimizations. The standard has a
7004 precise definition of constant-expression, and we must honor
7005 that, even though it is somewhat more restrictive.
7011 is not a legal declaration, because `(2, 3)' is not a
7012 constant-expression. The `,' operator is forbidden in a
7013 constant-expression. However, GCC's constant-folding machinery
7014 will fold this operation to an INTEGER_CST for `3'. */
7016 /* Save the old settings. */
7017 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
7018 saved_allow_non_integral_constant_expression_p
7019 = parser->allow_non_integral_constant_expression_p;
7020 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
7021 /* We are now parsing a constant-expression. */
7022 parser->integral_constant_expression_p = true;
7023 parser->allow_non_integral_constant_expression_p
7024 = (allow_non_constant_p || cxx_dialect >= cxx0x);
7025 parser->non_integral_constant_expression_p = false;
7026 /* Although the grammar says "conditional-expression", we parse an
7027 "assignment-expression", which also permits "throw-expression"
7028 and the use of assignment operators. In the case that
7029 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7030 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7031 actually essential that we look for an assignment-expression.
7032 For example, cp_parser_initializer_clauses uses this function to
7033 determine whether a particular assignment-expression is in fact
7035 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
7036 /* Restore the old settings. */
7037 parser->integral_constant_expression_p
7038 = saved_integral_constant_expression_p;
7039 parser->allow_non_integral_constant_expression_p
7040 = saved_allow_non_integral_constant_expression_p;
7041 if (cxx_dialect >= cxx0x)
7043 /* Require an rvalue constant expression here; that's what our
7044 callers expect. Reference constant expressions are handled
7045 separately in e.g. cp_parser_template_argument. */
7046 bool is_const = potential_rvalue_constant_expression (expression);
7047 parser->non_integral_constant_expression_p = !is_const;
7048 if (!is_const && !allow_non_constant_p)
7049 require_potential_rvalue_constant_expression (expression);
7051 if (allow_non_constant_p)
7052 *non_constant_p = parser->non_integral_constant_expression_p;
7053 parser->non_integral_constant_expression_p
7054 = saved_non_integral_constant_expression_p;
7059 /* Parse __builtin_offsetof.
7061 offsetof-expression:
7062 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7064 offsetof-member-designator:
7066 | offsetof-member-designator "." id-expression
7067 | offsetof-member-designator "[" expression "]"
7068 | offsetof-member-designator "->" id-expression */
7071 cp_parser_builtin_offsetof (cp_parser *parser)
7073 int save_ice_p, save_non_ice_p;
7078 /* We're about to accept non-integral-constant things, but will
7079 definitely yield an integral constant expression. Save and
7080 restore these values around our local parsing. */
7081 save_ice_p = parser->integral_constant_expression_p;
7082 save_non_ice_p = parser->non_integral_constant_expression_p;
7084 /* Consume the "__builtin_offsetof" token. */
7085 cp_lexer_consume_token (parser->lexer);
7086 /* Consume the opening `('. */
7087 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
7088 /* Parse the type-id. */
7089 type = cp_parser_type_id (parser);
7090 /* Look for the `,'. */
7091 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7092 token = cp_lexer_peek_token (parser->lexer);
7094 /* Build the (type *)null that begins the traditional offsetof macro. */
7095 expr = build_static_cast (build_pointer_type (type), null_pointer_node,
7096 tf_warning_or_error);
7098 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7099 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
7100 true, &dummy, token->location);
7103 token = cp_lexer_peek_token (parser->lexer);
7104 switch (token->type)
7106 case CPP_OPEN_SQUARE:
7107 /* offsetof-member-designator "[" expression "]" */
7108 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
7112 /* offsetof-member-designator "->" identifier */
7113 expr = grok_array_decl (expr, integer_zero_node);
7117 /* offsetof-member-designator "." identifier */
7118 cp_lexer_consume_token (parser->lexer);
7119 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT,
7124 case CPP_CLOSE_PAREN:
7125 /* Consume the ")" token. */
7126 cp_lexer_consume_token (parser->lexer);
7130 /* Error. We know the following require will fail, but
7131 that gives the proper error message. */
7132 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7133 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
7134 expr = error_mark_node;
7140 /* If we're processing a template, we can't finish the semantics yet.
7141 Otherwise we can fold the entire expression now. */
7142 if (processing_template_decl)
7143 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
7145 expr = finish_offsetof (expr);
7148 parser->integral_constant_expression_p = save_ice_p;
7149 parser->non_integral_constant_expression_p = save_non_ice_p;
7154 /* Parse a trait expression.
7156 Returns a representation of the expression, the underlying type
7157 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7160 cp_parser_trait_expr (cp_parser* parser, enum rid keyword)
7163 tree type1, type2 = NULL_TREE;
7164 bool binary = false;
7165 cp_decl_specifier_seq decl_specs;
7169 case RID_HAS_NOTHROW_ASSIGN:
7170 kind = CPTK_HAS_NOTHROW_ASSIGN;
7172 case RID_HAS_NOTHROW_CONSTRUCTOR:
7173 kind = CPTK_HAS_NOTHROW_CONSTRUCTOR;
7175 case RID_HAS_NOTHROW_COPY:
7176 kind = CPTK_HAS_NOTHROW_COPY;
7178 case RID_HAS_TRIVIAL_ASSIGN:
7179 kind = CPTK_HAS_TRIVIAL_ASSIGN;
7181 case RID_HAS_TRIVIAL_CONSTRUCTOR:
7182 kind = CPTK_HAS_TRIVIAL_CONSTRUCTOR;
7184 case RID_HAS_TRIVIAL_COPY:
7185 kind = CPTK_HAS_TRIVIAL_COPY;
7187 case RID_HAS_TRIVIAL_DESTRUCTOR:
7188 kind = CPTK_HAS_TRIVIAL_DESTRUCTOR;
7190 case RID_HAS_VIRTUAL_DESTRUCTOR:
7191 kind = CPTK_HAS_VIRTUAL_DESTRUCTOR;
7193 case RID_IS_ABSTRACT:
7194 kind = CPTK_IS_ABSTRACT;
7196 case RID_IS_BASE_OF:
7197 kind = CPTK_IS_BASE_OF;
7201 kind = CPTK_IS_CLASS;
7203 case RID_IS_CONVERTIBLE_TO:
7204 kind = CPTK_IS_CONVERTIBLE_TO;
7208 kind = CPTK_IS_EMPTY;
7211 kind = CPTK_IS_ENUM;
7213 case RID_IS_LITERAL_TYPE:
7214 kind = CPTK_IS_LITERAL_TYPE;
7219 case RID_IS_POLYMORPHIC:
7220 kind = CPTK_IS_POLYMORPHIC;
7222 case RID_IS_STD_LAYOUT:
7223 kind = CPTK_IS_STD_LAYOUT;
7225 case RID_IS_TRIVIAL:
7226 kind = CPTK_IS_TRIVIAL;
7229 kind = CPTK_IS_UNION;
7231 case RID_UNDERLYING_TYPE:
7232 kind = CPTK_UNDERLYING_TYPE;
7238 /* Consume the token. */
7239 cp_lexer_consume_token (parser->lexer);
7241 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
7243 type1 = cp_parser_type_id (parser);
7245 if (type1 == error_mark_node)
7246 return error_mark_node;
7248 /* Build a trivial decl-specifier-seq. */
7249 clear_decl_specs (&decl_specs);
7250 decl_specs.type = type1;
7252 /* Call grokdeclarator to figure out what type this is. */
7253 type1 = grokdeclarator (NULL, &decl_specs, TYPENAME,
7254 /*initialized=*/0, /*attrlist=*/NULL);
7258 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7260 type2 = cp_parser_type_id (parser);
7262 if (type2 == error_mark_node)
7263 return error_mark_node;
7265 /* Build a trivial decl-specifier-seq. */
7266 clear_decl_specs (&decl_specs);
7267 decl_specs.type = type2;
7269 /* Call grokdeclarator to figure out what type this is. */
7270 type2 = grokdeclarator (NULL, &decl_specs, TYPENAME,
7271 /*initialized=*/0, /*attrlist=*/NULL);
7274 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7276 /* Complete the trait expression, which may mean either processing
7277 the trait expr now or saving it for template instantiation. */
7278 return kind != CPTK_UNDERLYING_TYPE
7279 ? finish_trait_expr (kind, type1, type2)
7280 : finish_underlying_type (type1);
7283 /* Lambdas that appear in variable initializer or default argument scope
7284 get that in their mangling, so we need to record it. We might as well
7285 use the count for function and namespace scopes as well. */
7286 static GTY(()) tree lambda_scope;
7287 static GTY(()) int lambda_count;
7288 typedef struct GTY(()) tree_int
7293 DEF_VEC_O(tree_int);
7294 DEF_VEC_ALLOC_O(tree_int,gc);
7295 static GTY(()) VEC(tree_int,gc) *lambda_scope_stack;
7298 start_lambda_scope (tree decl)
7302 /* Once we're inside a function, we ignore other scopes and just push
7303 the function again so that popping works properly. */
7304 if (current_function_decl && TREE_CODE (decl) != FUNCTION_DECL)
7305 decl = current_function_decl;
7306 ti.t = lambda_scope;
7307 ti.i = lambda_count;
7308 VEC_safe_push (tree_int, gc, lambda_scope_stack, &ti);
7309 if (lambda_scope != decl)
7311 /* Don't reset the count if we're still in the same function. */
7312 lambda_scope = decl;
7318 record_lambda_scope (tree lambda)
7320 LAMBDA_EXPR_EXTRA_SCOPE (lambda) = lambda_scope;
7321 LAMBDA_EXPR_DISCRIMINATOR (lambda) = lambda_count++;
7325 finish_lambda_scope (void)
7327 tree_int *p = VEC_last (tree_int, lambda_scope_stack);
7328 if (lambda_scope != p->t)
7330 lambda_scope = p->t;
7331 lambda_count = p->i;
7333 VEC_pop (tree_int, lambda_scope_stack);
7336 /* Parse a lambda expression.
7339 lambda-introducer lambda-declarator [opt] compound-statement
7341 Returns a representation of the expression. */
7344 cp_parser_lambda_expression (cp_parser* parser)
7346 tree lambda_expr = build_lambda_expr ();
7350 LAMBDA_EXPR_LOCATION (lambda_expr)
7351 = cp_lexer_peek_token (parser->lexer)->location;
7353 if (cp_unevaluated_operand)
7354 error_at (LAMBDA_EXPR_LOCATION (lambda_expr),
7355 "lambda-expression in unevaluated context");
7357 /* We may be in the middle of deferred access check. Disable
7359 push_deferring_access_checks (dk_no_deferred);
7361 cp_parser_lambda_introducer (parser, lambda_expr);
7363 type = begin_lambda_type (lambda_expr);
7365 record_lambda_scope (lambda_expr);
7367 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
7368 determine_visibility (TYPE_NAME (type));
7370 /* Now that we've started the type, add the capture fields for any
7371 explicit captures. */
7372 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr));
7375 /* Inside the class, surrounding template-parameter-lists do not apply. */
7376 unsigned int saved_num_template_parameter_lists
7377 = parser->num_template_parameter_lists;
7379 parser->num_template_parameter_lists = 0;
7381 /* By virtue of defining a local class, a lambda expression has access to
7382 the private variables of enclosing classes. */
7384 ok = cp_parser_lambda_declarator_opt (parser, lambda_expr);
7387 cp_parser_lambda_body (parser, lambda_expr);
7388 else if (cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
7389 cp_parser_skip_to_end_of_block_or_statement (parser);
7391 /* The capture list was built up in reverse order; fix that now. */
7393 tree newlist = NULL_TREE;
7396 for (elt = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
7399 next = TREE_CHAIN (elt);
7400 TREE_CHAIN (elt) = newlist;
7403 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr) = newlist;
7407 maybe_add_lambda_conv_op (type);
7409 type = finish_struct (type, /*attributes=*/NULL_TREE);
7411 parser->num_template_parameter_lists = saved_num_template_parameter_lists;
7414 pop_deferring_access_checks ();
7416 /* This field is only used during parsing of the lambda. */
7417 LAMBDA_EXPR_THIS_CAPTURE (lambda_expr) = NULL_TREE;
7419 /* This lambda shouldn't have any proxies left at this point. */
7420 gcc_assert (LAMBDA_EXPR_PENDING_PROXIES (lambda_expr) == NULL);
7421 /* And now that we're done, push proxies for an enclosing lambda. */
7422 insert_pending_capture_proxies ();
7425 return build_lambda_object (lambda_expr);
7427 return error_mark_node;
7430 /* Parse the beginning of a lambda expression.
7433 [ lambda-capture [opt] ]
7435 LAMBDA_EXPR is the current representation of the lambda expression. */
7438 cp_parser_lambda_introducer (cp_parser* parser, tree lambda_expr)
7440 /* Need commas after the first capture. */
7443 /* Eat the leading `['. */
7444 cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE);
7446 /* Record default capture mode. "[&" "[=" "[&," "[=," */
7447 if (cp_lexer_next_token_is (parser->lexer, CPP_AND)
7448 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_NAME)
7449 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) = CPLD_REFERENCE;
7450 else if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
7451 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) = CPLD_COPY;
7453 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) != CPLD_NONE)
7455 cp_lexer_consume_token (parser->lexer);
7459 while (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_SQUARE))
7461 cp_token* capture_token;
7463 tree capture_init_expr;
7464 cp_id_kind idk = CP_ID_KIND_NONE;
7465 bool explicit_init_p = false;
7467 enum capture_kind_type
7472 enum capture_kind_type capture_kind = BY_COPY;
7474 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
7476 error ("expected end of capture-list");
7483 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7485 /* Possibly capture `this'. */
7486 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THIS))
7488 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
7489 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_COPY)
7490 pedwarn (loc, 0, "explicit by-copy capture of %<this%> redundant "
7491 "with by-copy capture default");
7492 cp_lexer_consume_token (parser->lexer);
7493 add_capture (lambda_expr,
7494 /*id=*/this_identifier,
7495 /*initializer=*/finish_this_expr(),
7496 /*by_reference_p=*/false,
7501 /* Remember whether we want to capture as a reference or not. */
7502 if (cp_lexer_next_token_is (parser->lexer, CPP_AND))
7504 capture_kind = BY_REFERENCE;
7505 cp_lexer_consume_token (parser->lexer);
7508 /* Get the identifier. */
7509 capture_token = cp_lexer_peek_token (parser->lexer);
7510 capture_id = cp_parser_identifier (parser);
7512 if (capture_id == error_mark_node)
7513 /* Would be nice to have a cp_parser_skip_to_closing_x for general
7514 delimiters, but I modified this to stop on unnested ']' as well. It
7515 was already changed to stop on unnested '}', so the
7516 "closing_parenthesis" name is no more misleading with my change. */
7518 cp_parser_skip_to_closing_parenthesis (parser,
7519 /*recovering=*/true,
7521 /*consume_paren=*/true);
7525 /* Find the initializer for this capture. */
7526 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
7528 /* An explicit expression exists. */
7529 cp_lexer_consume_token (parser->lexer);
7530 pedwarn (input_location, OPT_pedantic,
7531 "ISO C++ does not allow initializers "
7532 "in lambda expression capture lists");
7533 capture_init_expr = cp_parser_assignment_expression (parser,
7536 explicit_init_p = true;
7540 const char* error_msg;
7542 /* Turn the identifier into an id-expression. */
7544 = cp_parser_lookup_name
7548 /*is_template=*/false,
7549 /*is_namespace=*/false,
7550 /*check_dependency=*/true,
7551 /*ambiguous_decls=*/NULL,
7552 capture_token->location);
7555 = finish_id_expression
7560 /*integral_constant_expression_p=*/false,
7561 /*allow_non_integral_constant_expression_p=*/false,
7562 /*non_integral_constant_expression_p=*/NULL,
7563 /*template_p=*/false,
7565 /*address_p=*/false,
7566 /*template_arg_p=*/false,
7568 capture_token->location);
7571 if (TREE_CODE (capture_init_expr) == IDENTIFIER_NODE)
7573 = unqualified_name_lookup_error (capture_init_expr);
7575 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) != CPLD_NONE
7576 && !explicit_init_p)
7578 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_COPY
7579 && capture_kind == BY_COPY)
7580 pedwarn (capture_token->location, 0, "explicit by-copy capture "
7581 "of %qD redundant with by-copy capture default",
7583 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_REFERENCE
7584 && capture_kind == BY_REFERENCE)
7585 pedwarn (capture_token->location, 0, "explicit by-reference "
7586 "capture of %qD redundant with by-reference capture "
7587 "default", capture_id);
7590 add_capture (lambda_expr,
7593 /*by_reference_p=*/capture_kind == BY_REFERENCE,
7597 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
7600 /* Parse the (optional) middle of a lambda expression.
7603 ( parameter-declaration-clause [opt] )
7604 attribute-specifier [opt]
7606 exception-specification [opt]
7607 lambda-return-type-clause [opt]
7609 LAMBDA_EXPR is the current representation of the lambda expression. */
7612 cp_parser_lambda_declarator_opt (cp_parser* parser, tree lambda_expr)
7614 /* 5.1.1.4 of the standard says:
7615 If a lambda-expression does not include a lambda-declarator, it is as if
7616 the lambda-declarator were ().
7617 This means an empty parameter list, no attributes, and no exception
7619 tree param_list = void_list_node;
7620 tree attributes = NULL_TREE;
7621 tree exception_spec = NULL_TREE;
7624 /* The lambda-declarator is optional, but must begin with an opening
7625 parenthesis if present. */
7626 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7628 cp_lexer_consume_token (parser->lexer);
7630 begin_scope (sk_function_parms, /*entity=*/NULL_TREE);
7632 /* Parse parameters. */
7633 param_list = cp_parser_parameter_declaration_clause (parser);
7635 /* Default arguments shall not be specified in the
7636 parameter-declaration-clause of a lambda-declarator. */
7637 for (t = param_list; t; t = TREE_CHAIN (t))
7638 if (TREE_PURPOSE (t))
7639 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t)), OPT_pedantic,
7640 "default argument specified for lambda parameter");
7642 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7644 attributes = cp_parser_attributes_opt (parser);
7646 /* Parse optional `mutable' keyword. */
7647 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_MUTABLE))
7649 cp_lexer_consume_token (parser->lexer);
7650 LAMBDA_EXPR_MUTABLE_P (lambda_expr) = 1;
7653 /* Parse optional exception specification. */
7654 exception_spec = cp_parser_exception_specification_opt (parser);
7656 /* Parse optional trailing return type. */
7657 if (cp_lexer_next_token_is (parser->lexer, CPP_DEREF))
7659 cp_lexer_consume_token (parser->lexer);
7660 LAMBDA_EXPR_RETURN_TYPE (lambda_expr) = cp_parser_type_id (parser);
7663 /* The function parameters must be in scope all the way until after the
7664 trailing-return-type in case of decltype. */
7665 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
7666 pop_binding (DECL_NAME (t), t);
7671 /* Create the function call operator.
7673 Messing with declarators like this is no uglier than building up the
7674 FUNCTION_DECL by hand, and this is less likely to get out of sync with
7677 cp_decl_specifier_seq return_type_specs;
7678 cp_declarator* declarator;
7683 clear_decl_specs (&return_type_specs);
7684 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr))
7685 return_type_specs.type = LAMBDA_EXPR_RETURN_TYPE (lambda_expr);
7687 /* Maybe we will deduce the return type later, but we can use void
7688 as a placeholder return type anyways. */
7689 return_type_specs.type = void_type_node;
7691 p = obstack_alloc (&declarator_obstack, 0);
7693 declarator = make_id_declarator (NULL_TREE, ansi_opname (CALL_EXPR),
7696 quals = (LAMBDA_EXPR_MUTABLE_P (lambda_expr)
7697 ? TYPE_UNQUALIFIED : TYPE_QUAL_CONST);
7698 declarator = make_call_declarator (declarator, param_list, quals,
7699 VIRT_SPEC_UNSPECIFIED,
7701 /*late_return_type=*/NULL_TREE);
7702 declarator->id_loc = LAMBDA_EXPR_LOCATION (lambda_expr);
7704 fco = grokmethod (&return_type_specs,
7707 if (fco != error_mark_node)
7709 DECL_INITIALIZED_IN_CLASS_P (fco) = 1;
7710 DECL_ARTIFICIAL (fco) = 1;
7711 /* Give the object parameter a different name. */
7712 DECL_NAME (DECL_ARGUMENTS (fco)) = get_identifier ("__closure");
7715 finish_member_declaration (fco);
7717 obstack_free (&declarator_obstack, p);
7719 return (fco != error_mark_node);
7723 /* Parse the body of a lambda expression, which is simply
7727 but which requires special handling.
7728 LAMBDA_EXPR is the current representation of the lambda expression. */
7731 cp_parser_lambda_body (cp_parser* parser, tree lambda_expr)
7733 bool nested = (current_function_decl != NULL_TREE);
7735 push_function_context ();
7737 /* Finish the function call operator
7739 + late_parsing_for_member
7740 + function_definition_after_declarator
7741 + ctor_initializer_opt_and_function_body */
7743 tree fco = lambda_function (lambda_expr);
7749 /* Let the front end know that we are going to be defining this
7751 start_preparsed_function (fco,
7753 SF_PRE_PARSED | SF_INCLASS_INLINE);
7755 start_lambda_scope (fco);
7756 body = begin_function_body ();
7758 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
7761 /* Push the proxies for any explicit captures. */
7762 for (cap = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr); cap;
7763 cap = TREE_CHAIN (cap))
7764 build_capture_proxy (TREE_PURPOSE (cap));
7766 compound_stmt = begin_compound_stmt (0);
7768 /* 5.1.1.4 of the standard says:
7769 If a lambda-expression does not include a trailing-return-type, it
7770 is as if the trailing-return-type denotes the following type:
7771 * if the compound-statement is of the form
7772 { return attribute-specifier [opt] expression ; }
7773 the type of the returned expression after lvalue-to-rvalue
7774 conversion (_conv.lval_ 4.1), array-to-pointer conversion
7775 (_conv.array_ 4.2), and function-to-pointer conversion
7777 * otherwise, void. */
7779 /* In a lambda that has neither a lambda-return-type-clause
7780 nor a deducible form, errors should be reported for return statements
7781 in the body. Since we used void as the placeholder return type, parsing
7782 the body as usual will give such desired behavior. */
7783 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr)
7784 && cp_lexer_peek_nth_token (parser->lexer, 1)->keyword == RID_RETURN
7785 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SEMICOLON)
7787 tree expr = NULL_TREE;
7788 cp_id_kind idk = CP_ID_KIND_NONE;
7790 /* Parse tentatively in case there's more after the initial return
7792 cp_parser_parse_tentatively (parser);
7794 cp_parser_require_keyword (parser, RID_RETURN, RT_RETURN);
7796 expr = cp_parser_expression (parser, /*cast_p=*/false, &idk);
7798 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
7799 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
7801 if (cp_parser_parse_definitely (parser))
7803 apply_lambda_return_type (lambda_expr, lambda_return_type (expr));
7805 /* Will get error here if type not deduced yet. */
7806 finish_return_stmt (expr);
7814 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr))
7815 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr) = true;
7816 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
7817 cp_parser_label_declaration (parser);
7818 cp_parser_statement_seq_opt (parser, NULL_TREE);
7819 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
7820 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr) = false;
7823 finish_compound_stmt (compound_stmt);
7826 finish_function_body (body);
7827 finish_lambda_scope ();
7829 /* Finish the function and generate code for it if necessary. */
7830 expand_or_defer_fn (finish_function (/*inline*/2));
7834 pop_function_context();
7837 /* Statements [gram.stmt.stmt] */
7839 /* Parse a statement.
7843 expression-statement
7848 declaration-statement
7851 IN_COMPOUND is true when the statement is nested inside a
7852 cp_parser_compound_statement; this matters for certain pragmas.
7854 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7855 is a (possibly labeled) if statement which is not enclosed in braces
7856 and has an else clause. This is used to implement -Wparentheses. */
7859 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
7860 bool in_compound, bool *if_p)
7864 location_t statement_location;
7869 /* There is no statement yet. */
7870 statement = NULL_TREE;
7871 /* Peek at the next token. */
7872 token = cp_lexer_peek_token (parser->lexer);
7873 /* Remember the location of the first token in the statement. */
7874 statement_location = token->location;
7875 /* If this is a keyword, then that will often determine what kind of
7876 statement we have. */
7877 if (token->type == CPP_KEYWORD)
7879 enum rid keyword = token->keyword;
7885 /* Looks like a labeled-statement with a case label.
7886 Parse the label, and then use tail recursion to parse
7888 cp_parser_label_for_labeled_statement (parser);
7893 statement = cp_parser_selection_statement (parser, if_p);
7899 statement = cp_parser_iteration_statement (parser);
7906 statement = cp_parser_jump_statement (parser);
7909 /* Objective-C++ exception-handling constructs. */
7912 case RID_AT_FINALLY:
7913 case RID_AT_SYNCHRONIZED:
7915 statement = cp_parser_objc_statement (parser);
7919 statement = cp_parser_try_block (parser);
7923 /* This must be a namespace alias definition. */
7924 cp_parser_declaration_statement (parser);
7928 /* It might be a keyword like `int' that can start a
7929 declaration-statement. */
7933 else if (token->type == CPP_NAME)
7935 /* If the next token is a `:', then we are looking at a
7936 labeled-statement. */
7937 token = cp_lexer_peek_nth_token (parser->lexer, 2);
7938 if (token->type == CPP_COLON)
7940 /* Looks like a labeled-statement with an ordinary label.
7941 Parse the label, and then use tail recursion to parse
7943 cp_parser_label_for_labeled_statement (parser);
7947 /* Anything that starts with a `{' must be a compound-statement. */
7948 else if (token->type == CPP_OPEN_BRACE)
7949 statement = cp_parser_compound_statement (parser, NULL, false, false);
7950 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
7951 a statement all its own. */
7952 else if (token->type == CPP_PRAGMA)
7954 /* Only certain OpenMP pragmas are attached to statements, and thus
7955 are considered statements themselves. All others are not. In
7956 the context of a compound, accept the pragma as a "statement" and
7957 return so that we can check for a close brace. Otherwise we
7958 require a real statement and must go back and read one. */
7960 cp_parser_pragma (parser, pragma_compound);
7961 else if (!cp_parser_pragma (parser, pragma_stmt))
7965 else if (token->type == CPP_EOF)
7967 cp_parser_error (parser, "expected statement");
7971 /* Everything else must be a declaration-statement or an
7972 expression-statement. Try for the declaration-statement
7973 first, unless we are looking at a `;', in which case we know that
7974 we have an expression-statement. */
7977 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
7979 cp_parser_parse_tentatively (parser);
7980 /* Try to parse the declaration-statement. */
7981 cp_parser_declaration_statement (parser);
7982 /* If that worked, we're done. */
7983 if (cp_parser_parse_definitely (parser))
7986 /* Look for an expression-statement instead. */
7987 statement = cp_parser_expression_statement (parser, in_statement_expr);
7990 /* Set the line number for the statement. */
7991 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
7992 SET_EXPR_LOCATION (statement, statement_location);
7995 /* Parse the label for a labeled-statement, i.e.
7998 case constant-expression :
8002 case constant-expression ... constant-expression : statement
8004 When a label is parsed without errors, the label is added to the
8005 parse tree by the finish_* functions, so this function doesn't
8006 have to return the label. */
8009 cp_parser_label_for_labeled_statement (cp_parser* parser)
8012 tree label = NULL_TREE;
8013 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
8015 /* The next token should be an identifier. */
8016 token = cp_lexer_peek_token (parser->lexer);
8017 if (token->type != CPP_NAME
8018 && token->type != CPP_KEYWORD)
8020 cp_parser_error (parser, "expected labeled-statement");
8024 parser->colon_corrects_to_scope_p = false;
8025 switch (token->keyword)
8032 /* Consume the `case' token. */
8033 cp_lexer_consume_token (parser->lexer);
8034 /* Parse the constant-expression. */
8035 expr = cp_parser_constant_expression (parser,
8036 /*allow_non_constant_p=*/false,
8039 ellipsis = cp_lexer_peek_token (parser->lexer);
8040 if (ellipsis->type == CPP_ELLIPSIS)
8042 /* Consume the `...' token. */
8043 cp_lexer_consume_token (parser->lexer);
8045 cp_parser_constant_expression (parser,
8046 /*allow_non_constant_p=*/false,
8048 /* We don't need to emit warnings here, as the common code
8049 will do this for us. */
8052 expr_hi = NULL_TREE;
8054 if (parser->in_switch_statement_p)
8055 finish_case_label (token->location, expr, expr_hi);
8057 error_at (token->location,
8058 "case label %qE not within a switch statement",
8064 /* Consume the `default' token. */
8065 cp_lexer_consume_token (parser->lexer);
8067 if (parser->in_switch_statement_p)
8068 finish_case_label (token->location, NULL_TREE, NULL_TREE);
8070 error_at (token->location, "case label not within a switch statement");
8074 /* Anything else must be an ordinary label. */
8075 label = finish_label_stmt (cp_parser_identifier (parser));
8079 /* Require the `:' token. */
8080 cp_parser_require (parser, CPP_COLON, RT_COLON);
8082 /* An ordinary label may optionally be followed by attributes.
8083 However, this is only permitted if the attributes are then
8084 followed by a semicolon. This is because, for backward
8085 compatibility, when parsing
8086 lab: __attribute__ ((unused)) int i;
8087 we want the attribute to attach to "i", not "lab". */
8088 if (label != NULL_TREE
8089 && cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
8093 cp_parser_parse_tentatively (parser);
8094 attrs = cp_parser_attributes_opt (parser);
8095 if (attrs == NULL_TREE
8096 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8097 cp_parser_abort_tentative_parse (parser);
8098 else if (!cp_parser_parse_definitely (parser))
8101 cplus_decl_attributes (&label, attrs, 0);
8104 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
8107 /* Parse an expression-statement.
8109 expression-statement:
8112 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8113 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8114 indicates whether this expression-statement is part of an
8115 expression statement. */
8118 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
8120 tree statement = NULL_TREE;
8121 cp_token *token = cp_lexer_peek_token (parser->lexer);
8123 /* If the next token is a ';', then there is no expression
8125 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8126 statement = cp_parser_expression (parser, /*cast_p=*/false, NULL);
8128 /* Give a helpful message for "A<T>::type t;" and the like. */
8129 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
8130 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
8132 if (TREE_CODE (statement) == SCOPE_REF)
8133 error_at (token->location, "need %<typename%> before %qE because "
8134 "%qT is a dependent scope",
8135 statement, TREE_OPERAND (statement, 0));
8136 else if (is_overloaded_fn (statement)
8137 && DECL_CONSTRUCTOR_P (get_first_fn (statement)))
8140 tree fn = get_first_fn (statement);
8141 error_at (token->location,
8142 "%<%T::%D%> names the constructor, not the type",
8143 DECL_CONTEXT (fn), DECL_NAME (fn));
8147 /* Consume the final `;'. */
8148 cp_parser_consume_semicolon_at_end_of_statement (parser);
8150 if (in_statement_expr
8151 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
8152 /* This is the final expression statement of a statement
8154 statement = finish_stmt_expr_expr (statement, in_statement_expr);
8156 statement = finish_expr_stmt (statement);
8163 /* Parse a compound-statement.
8166 { statement-seq [opt] }
8171 { label-declaration-seq [opt] statement-seq [opt] }
8173 label-declaration-seq:
8175 label-declaration-seq label-declaration
8177 Returns a tree representing the statement. */
8180 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
8181 bool in_try, bool function_body)
8185 /* Consume the `{'. */
8186 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8187 return error_mark_node;
8188 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
8190 pedwarn (input_location, OPT_pedantic,
8191 "compound-statement in constexpr function");
8192 /* Begin the compound-statement. */
8193 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
8194 /* If the next keyword is `__label__' we have a label declaration. */
8195 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
8196 cp_parser_label_declaration (parser);
8197 /* Parse an (optional) statement-seq. */
8198 cp_parser_statement_seq_opt (parser, in_statement_expr);
8199 /* Finish the compound-statement. */
8200 finish_compound_stmt (compound_stmt);
8201 /* Consume the `}'. */
8202 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8204 return compound_stmt;
8207 /* Parse an (optional) statement-seq.
8211 statement-seq [opt] statement */
8214 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
8216 /* Scan statements until there aren't any more. */
8219 cp_token *token = cp_lexer_peek_token (parser->lexer);
8221 /* If we are looking at a `}', then we have run out of
8222 statements; the same is true if we have reached the end
8223 of file, or have stumbled upon a stray '@end'. */
8224 if (token->type == CPP_CLOSE_BRACE
8225 || token->type == CPP_EOF
8226 || token->type == CPP_PRAGMA_EOL
8227 || (token->type == CPP_KEYWORD && token->keyword == RID_AT_END))
8230 /* If we are in a compound statement and find 'else' then
8231 something went wrong. */
8232 else if (token->type == CPP_KEYWORD && token->keyword == RID_ELSE)
8234 if (parser->in_statement & IN_IF_STMT)
8238 token = cp_lexer_consume_token (parser->lexer);
8239 error_at (token->location, "%<else%> without a previous %<if%>");
8243 /* Parse the statement. */
8244 cp_parser_statement (parser, in_statement_expr, true, NULL);
8248 /* Parse a selection-statement.
8250 selection-statement:
8251 if ( condition ) statement
8252 if ( condition ) statement else statement
8253 switch ( condition ) statement
8255 Returns the new IF_STMT or SWITCH_STMT.
8257 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8258 is a (possibly labeled) if statement which is not enclosed in
8259 braces and has an else clause. This is used to implement
8263 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
8271 /* Peek at the next token. */
8272 token = cp_parser_require (parser, CPP_KEYWORD, RT_SELECT);
8274 /* See what kind of keyword it is. */
8275 keyword = token->keyword;
8284 /* Look for the `('. */
8285 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
8287 cp_parser_skip_to_end_of_statement (parser);
8288 return error_mark_node;
8291 /* Begin the selection-statement. */
8292 if (keyword == RID_IF)
8293 statement = begin_if_stmt ();
8295 statement = begin_switch_stmt ();
8297 /* Parse the condition. */
8298 condition = cp_parser_condition (parser);
8299 /* Look for the `)'. */
8300 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
8301 cp_parser_skip_to_closing_parenthesis (parser, true, false,
8302 /*consume_paren=*/true);
8304 if (keyword == RID_IF)
8307 unsigned char in_statement;
8309 /* Add the condition. */
8310 finish_if_stmt_cond (condition, statement);
8312 /* Parse the then-clause. */
8313 in_statement = parser->in_statement;
8314 parser->in_statement |= IN_IF_STMT;
8315 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
8317 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
8318 add_stmt (build_empty_stmt (loc));
8319 cp_lexer_consume_token (parser->lexer);
8320 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_ELSE))
8321 warning_at (loc, OPT_Wempty_body, "suggest braces around "
8322 "empty body in an %<if%> statement");
8326 cp_parser_implicitly_scoped_statement (parser, &nested_if);
8327 parser->in_statement = in_statement;
8329 finish_then_clause (statement);
8331 /* If the next token is `else', parse the else-clause. */
8332 if (cp_lexer_next_token_is_keyword (parser->lexer,
8335 /* Consume the `else' keyword. */
8336 cp_lexer_consume_token (parser->lexer);
8337 begin_else_clause (statement);
8338 /* Parse the else-clause. */
8339 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
8342 loc = cp_lexer_peek_token (parser->lexer)->location;
8344 OPT_Wempty_body, "suggest braces around "
8345 "empty body in an %<else%> statement");
8346 add_stmt (build_empty_stmt (loc));
8347 cp_lexer_consume_token (parser->lexer);
8350 cp_parser_implicitly_scoped_statement (parser, NULL);
8352 finish_else_clause (statement);
8354 /* If we are currently parsing a then-clause, then
8355 IF_P will not be NULL. We set it to true to
8356 indicate that this if statement has an else clause.
8357 This may trigger the Wparentheses warning below
8358 when we get back up to the parent if statement. */
8364 /* This if statement does not have an else clause. If
8365 NESTED_IF is true, then the then-clause is an if
8366 statement which does have an else clause. We warn
8367 about the potential ambiguity. */
8369 warning_at (EXPR_LOCATION (statement), OPT_Wparentheses,
8370 "suggest explicit braces to avoid ambiguous"
8374 /* Now we're all done with the if-statement. */
8375 finish_if_stmt (statement);
8379 bool in_switch_statement_p;
8380 unsigned char in_statement;
8382 /* Add the condition. */
8383 finish_switch_cond (condition, statement);
8385 /* Parse the body of the switch-statement. */
8386 in_switch_statement_p = parser->in_switch_statement_p;
8387 in_statement = parser->in_statement;
8388 parser->in_switch_statement_p = true;
8389 parser->in_statement |= IN_SWITCH_STMT;
8390 cp_parser_implicitly_scoped_statement (parser, NULL);
8391 parser->in_switch_statement_p = in_switch_statement_p;
8392 parser->in_statement = in_statement;
8394 /* Now we're all done with the switch-statement. */
8395 finish_switch_stmt (statement);
8403 cp_parser_error (parser, "expected selection-statement");
8404 return error_mark_node;
8408 /* Parse a condition.
8412 type-specifier-seq declarator = initializer-clause
8413 type-specifier-seq declarator braced-init-list
8418 type-specifier-seq declarator asm-specification [opt]
8419 attributes [opt] = assignment-expression
8421 Returns the expression that should be tested. */
8424 cp_parser_condition (cp_parser* parser)
8426 cp_decl_specifier_seq type_specifiers;
8427 const char *saved_message;
8428 int declares_class_or_enum;
8430 /* Try the declaration first. */
8431 cp_parser_parse_tentatively (parser);
8432 /* New types are not allowed in the type-specifier-seq for a
8434 saved_message = parser->type_definition_forbidden_message;
8435 parser->type_definition_forbidden_message
8436 = G_("types may not be defined in conditions");
8437 /* Parse the type-specifier-seq. */
8438 cp_parser_decl_specifier_seq (parser,
8439 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
8441 &declares_class_or_enum);
8442 /* Restore the saved message. */
8443 parser->type_definition_forbidden_message = saved_message;
8444 /* If all is well, we might be looking at a declaration. */
8445 if (!cp_parser_error_occurred (parser))
8448 tree asm_specification;
8450 cp_declarator *declarator;
8451 tree initializer = NULL_TREE;
8453 /* Parse the declarator. */
8454 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
8455 /*ctor_dtor_or_conv_p=*/NULL,
8456 /*parenthesized_p=*/NULL,
8457 /*member_p=*/false);
8458 /* Parse the attributes. */
8459 attributes = cp_parser_attributes_opt (parser);
8460 /* Parse the asm-specification. */
8461 asm_specification = cp_parser_asm_specification_opt (parser);
8462 /* If the next token is not an `=' or '{', then we might still be
8463 looking at an expression. For example:
8467 looks like a decl-specifier-seq and a declarator -- but then
8468 there is no `=', so this is an expression. */
8469 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8470 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
8471 cp_parser_simulate_error (parser);
8473 /* If we did see an `=' or '{', then we are looking at a declaration
8475 if (cp_parser_parse_definitely (parser))
8478 bool non_constant_p;
8479 bool flags = LOOKUP_ONLYCONVERTING;
8481 /* Create the declaration. */
8482 decl = start_decl (declarator, &type_specifiers,
8483 /*initialized_p=*/true,
8484 attributes, /*prefix_attributes=*/NULL_TREE,
8487 /* Parse the initializer. */
8488 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
8490 initializer = cp_parser_braced_list (parser, &non_constant_p);
8491 CONSTRUCTOR_IS_DIRECT_INIT (initializer) = 1;
8496 /* Consume the `='. */
8497 cp_parser_require (parser, CPP_EQ, RT_EQ);
8498 initializer = cp_parser_initializer_clause (parser, &non_constant_p);
8500 if (BRACE_ENCLOSED_INITIALIZER_P (initializer))
8501 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
8503 /* Process the initializer. */
8504 cp_finish_decl (decl,
8505 initializer, !non_constant_p,
8510 pop_scope (pushed_scope);
8512 return convert_from_reference (decl);
8515 /* If we didn't even get past the declarator successfully, we are
8516 definitely not looking at a declaration. */
8518 cp_parser_abort_tentative_parse (parser);
8520 /* Otherwise, we are looking at an expression. */
8521 return cp_parser_expression (parser, /*cast_p=*/false, NULL);
8524 /* Parses a for-statement or range-for-statement until the closing ')',
8528 cp_parser_for (cp_parser *parser)
8530 tree init, scope, decl;
8533 /* Begin the for-statement. */
8534 scope = begin_for_scope (&init);
8536 /* Parse the initialization. */
8537 is_range_for = cp_parser_for_init_statement (parser, &decl);
8540 return cp_parser_range_for (parser, scope, init, decl);
8542 return cp_parser_c_for (parser, scope, init);
8546 cp_parser_c_for (cp_parser *parser, tree scope, tree init)
8548 /* Normal for loop */
8549 tree condition = NULL_TREE;
8550 tree expression = NULL_TREE;
8553 stmt = begin_for_stmt (scope, init);
8554 /* The for-init-statement has already been parsed in
8555 cp_parser_for_init_statement, so no work is needed here. */
8556 finish_for_init_stmt (stmt);
8558 /* If there's a condition, process it. */
8559 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8560 condition = cp_parser_condition (parser);
8561 finish_for_cond (condition, stmt);
8562 /* Look for the `;'. */
8563 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
8565 /* If there's an expression, process it. */
8566 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
8567 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
8568 finish_for_expr (expression, stmt);
8573 /* Tries to parse a range-based for-statement:
8576 decl-specifier-seq declarator : expression
8578 The decl-specifier-seq declarator and the `:' are already parsed by
8579 cp_parser_for_init_statement. If processing_template_decl it returns a
8580 newly created RANGE_FOR_STMT; if not, it is converted to a
8581 regular FOR_STMT. */
8584 cp_parser_range_for (cp_parser *parser, tree scope, tree init, tree range_decl)
8586 tree stmt, range_expr;
8588 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
8590 bool expr_non_constant_p;
8591 range_expr = cp_parser_braced_list (parser, &expr_non_constant_p);
8594 range_expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
8596 /* If in template, STMT is converted to a normal for-statement
8597 at instantiation. If not, it is done just ahead. */
8598 if (processing_template_decl)
8600 stmt = begin_range_for_stmt (scope, init);
8601 finish_range_for_decl (stmt, range_decl, range_expr);
8605 stmt = begin_for_stmt (scope, init);
8606 stmt = cp_convert_range_for (stmt, range_decl, range_expr);
8611 /* Converts a range-based for-statement into a normal
8612 for-statement, as per the definition.
8614 for (RANGE_DECL : RANGE_EXPR)
8617 should be equivalent to:
8620 auto &&__range = RANGE_EXPR;
8621 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
8625 RANGE_DECL = *__begin;
8630 If RANGE_EXPR is an array:
8631 BEGIN_EXPR = __range
8632 END_EXPR = __range + ARRAY_SIZE(__range)
8633 Else if RANGE_EXPR has a member 'begin' or 'end':
8634 BEGIN_EXPR = __range.begin()
8635 END_EXPR = __range.end()
8637 BEGIN_EXPR = begin(__range)
8638 END_EXPR = end(__range);
8640 If __range has a member 'begin' but not 'end', or vice versa, we must
8641 still use the second alternative (it will surely fail, however).
8642 When calling begin()/end() in the third alternative we must use
8643 argument dependent lookup, but always considering 'std' as an associated
8647 cp_convert_range_for (tree statement, tree range_decl, tree range_expr)
8649 tree range_type, range_temp;
8651 tree iter_type, begin_expr, end_expr;
8652 tree condition, expression;
8654 if (range_decl == error_mark_node || range_expr == error_mark_node)
8655 /* If an error happened previously do nothing or else a lot of
8656 unhelpful errors would be issued. */
8657 begin_expr = end_expr = iter_type = error_mark_node;
8660 /* Find out the type deduced by the declaration
8661 `auto &&__range = range_expr'. */
8662 range_type = cp_build_reference_type (make_auto (), true);
8663 range_type = do_auto_deduction (range_type, range_expr,
8664 type_uses_auto (range_type));
8666 /* Create the __range variable. */
8667 range_temp = build_decl (input_location, VAR_DECL,
8668 get_identifier ("__for_range"), range_type);
8669 TREE_USED (range_temp) = 1;
8670 DECL_ARTIFICIAL (range_temp) = 1;
8671 pushdecl (range_temp);
8672 cp_finish_decl (range_temp, range_expr,
8673 /*is_constant_init*/false, NULL_TREE,
8674 LOOKUP_ONLYCONVERTING);
8676 range_temp = convert_from_reference (range_temp);
8677 iter_type = cp_parser_perform_range_for_lookup (range_temp,
8678 &begin_expr, &end_expr);
8681 /* The new for initialization statement. */
8682 begin = build_decl (input_location, VAR_DECL,
8683 get_identifier ("__for_begin"), iter_type);
8684 TREE_USED (begin) = 1;
8685 DECL_ARTIFICIAL (begin) = 1;
8687 cp_finish_decl (begin, begin_expr,
8688 /*is_constant_init*/false, NULL_TREE,
8689 LOOKUP_ONLYCONVERTING);
8691 end = build_decl (input_location, VAR_DECL,
8692 get_identifier ("__for_end"), iter_type);
8693 TREE_USED (end) = 1;
8694 DECL_ARTIFICIAL (end) = 1;
8696 cp_finish_decl (end, end_expr,
8697 /*is_constant_init*/false, NULL_TREE,
8698 LOOKUP_ONLYCONVERTING);
8700 finish_for_init_stmt (statement);
8702 /* The new for condition. */
8703 condition = build_x_binary_op (NE_EXPR,
8706 NULL, tf_warning_or_error);
8707 finish_for_cond (condition, statement);
8709 /* The new increment expression. */
8710 expression = finish_unary_op_expr (PREINCREMENT_EXPR, begin);
8711 finish_for_expr (expression, statement);
8713 /* The declaration is initialized with *__begin inside the loop body. */
8714 cp_finish_decl (range_decl,
8715 build_x_indirect_ref (begin, RO_NULL, tf_warning_or_error),
8716 /*is_constant_init*/false, NULL_TREE,
8717 LOOKUP_ONLYCONVERTING);
8722 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
8723 We need to solve both at the same time because the method used
8724 depends on the existence of members begin or end.
8725 Returns the type deduced for the iterator expression. */
8728 cp_parser_perform_range_for_lookup (tree range, tree *begin, tree *end)
8730 if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (range))))
8732 error ("range-based %<for%> expression of type %qT "
8733 "has incomplete type", TREE_TYPE (range));
8734 *begin = *end = error_mark_node;
8735 return error_mark_node;
8737 if (TREE_CODE (TREE_TYPE (range)) == ARRAY_TYPE)
8739 /* If RANGE is an array, we will use pointer arithmetic. */
8741 *end = build_binary_op (input_location, PLUS_EXPR,
8743 array_type_nelts_top (TREE_TYPE (range)),
8745 return build_pointer_type (TREE_TYPE (TREE_TYPE (range)));
8749 /* If it is not an array, we must do a bit of magic. */
8750 tree id_begin, id_end;
8751 tree member_begin, member_end;
8753 *begin = *end = error_mark_node;
8755 id_begin = get_identifier ("begin");
8756 id_end = get_identifier ("end");
8757 member_begin = lookup_member (TREE_TYPE (range), id_begin,
8758 /*protect=*/2, /*want_type=*/false);
8759 member_end = lookup_member (TREE_TYPE (range), id_end,
8760 /*protect=*/2, /*want_type=*/false);
8762 if (member_begin != NULL_TREE || member_end != NULL_TREE)
8764 /* Use the member functions. */
8765 if (member_begin != NULL_TREE)
8766 *begin = cp_parser_range_for_member_function (range, id_begin);
8768 error ("range-based %<for%> expression of type %qT has an "
8769 "%<end%> member but not a %<begin%>", TREE_TYPE (range));
8771 if (member_end != NULL_TREE)
8772 *end = cp_parser_range_for_member_function (range, id_end);
8774 error ("range-based %<for%> expression of type %qT has a "
8775 "%<begin%> member but not an %<end%>", TREE_TYPE (range));
8779 /* Use global functions with ADL. */
8781 vec = make_tree_vector ();
8783 VEC_safe_push (tree, gc, vec, range);
8785 member_begin = perform_koenig_lookup (id_begin, vec,
8786 /*include_std=*/true,
8787 tf_warning_or_error);
8788 *begin = finish_call_expr (member_begin, &vec, false, true,
8789 tf_warning_or_error);
8790 member_end = perform_koenig_lookup (id_end, vec,
8791 /*include_std=*/true,
8792 tf_warning_or_error);
8793 *end = finish_call_expr (member_end, &vec, false, true,
8794 tf_warning_or_error);
8796 release_tree_vector (vec);
8799 /* Last common checks. */
8800 if (*begin == error_mark_node || *end == error_mark_node)
8802 /* If one of the expressions is an error do no more checks. */
8803 *begin = *end = error_mark_node;
8804 return error_mark_node;
8808 tree iter_type = cv_unqualified (TREE_TYPE (*begin));
8809 /* The unqualified type of the __begin and __end temporaries should
8810 be the same, as required by the multiple auto declaration. */
8811 if (!same_type_p (iter_type, cv_unqualified (TREE_TYPE (*end))))
8812 error ("inconsistent begin/end types in range-based %<for%> "
8813 "statement: %qT and %qT",
8814 TREE_TYPE (*begin), TREE_TYPE (*end));
8820 /* Helper function for cp_parser_perform_range_for_lookup.
8821 Builds a tree for RANGE.IDENTIFIER(). */
8824 cp_parser_range_for_member_function (tree range, tree identifier)
8829 member = finish_class_member_access_expr (range, identifier,
8830 false, tf_warning_or_error);
8831 if (member == error_mark_node)
8832 return error_mark_node;
8834 vec = make_tree_vector ();
8835 res = finish_call_expr (member, &vec,
8836 /*disallow_virtual=*/false,
8838 tf_warning_or_error);
8839 release_tree_vector (vec);
8843 /* Parse an iteration-statement.
8845 iteration-statement:
8846 while ( condition ) statement
8847 do statement while ( expression ) ;
8848 for ( for-init-statement condition [opt] ; expression [opt] )
8851 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
8854 cp_parser_iteration_statement (cp_parser* parser)
8859 unsigned char in_statement;
8861 /* Peek at the next token. */
8862 token = cp_parser_require (parser, CPP_KEYWORD, RT_INTERATION);
8864 return error_mark_node;
8866 /* Remember whether or not we are already within an iteration
8868 in_statement = parser->in_statement;
8870 /* See what kind of keyword it is. */
8871 keyword = token->keyword;
8878 /* Begin the while-statement. */
8879 statement = begin_while_stmt ();
8880 /* Look for the `('. */
8881 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
8882 /* Parse the condition. */
8883 condition = cp_parser_condition (parser);
8884 finish_while_stmt_cond (condition, statement);
8885 /* Look for the `)'. */
8886 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
8887 /* Parse the dependent statement. */
8888 parser->in_statement = IN_ITERATION_STMT;
8889 cp_parser_already_scoped_statement (parser);
8890 parser->in_statement = in_statement;
8891 /* We're done with the while-statement. */
8892 finish_while_stmt (statement);
8900 /* Begin the do-statement. */
8901 statement = begin_do_stmt ();
8902 /* Parse the body of the do-statement. */
8903 parser->in_statement = IN_ITERATION_STMT;
8904 cp_parser_implicitly_scoped_statement (parser, NULL);
8905 parser->in_statement = in_statement;
8906 finish_do_body (statement);
8907 /* Look for the `while' keyword. */
8908 cp_parser_require_keyword (parser, RID_WHILE, RT_WHILE);
8909 /* Look for the `('. */
8910 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
8911 /* Parse the expression. */
8912 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
8913 /* We're done with the do-statement. */
8914 finish_do_stmt (expression, statement);
8915 /* Look for the `)'. */
8916 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
8917 /* Look for the `;'. */
8918 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
8924 /* Look for the `('. */
8925 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
8927 statement = cp_parser_for (parser);
8929 /* Look for the `)'. */
8930 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
8932 /* Parse the body of the for-statement. */
8933 parser->in_statement = IN_ITERATION_STMT;
8934 cp_parser_already_scoped_statement (parser);
8935 parser->in_statement = in_statement;
8937 /* We're done with the for-statement. */
8938 finish_for_stmt (statement);
8943 cp_parser_error (parser, "expected iteration-statement");
8944 statement = error_mark_node;
8951 /* Parse a for-init-statement or the declarator of a range-based-for.
8952 Returns true if a range-based-for declaration is seen.
8955 expression-statement
8956 simple-declaration */
8959 cp_parser_for_init_statement (cp_parser* parser, tree *decl)
8961 /* If the next token is a `;', then we have an empty
8962 expression-statement. Grammatically, this is also a
8963 simple-declaration, but an invalid one, because it does not
8964 declare anything. Therefore, if we did not handle this case
8965 specially, we would issue an error message about an invalid
8967 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8969 bool is_range_for = false;
8970 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
8972 parser->colon_corrects_to_scope_p = false;
8974 /* We're going to speculatively look for a declaration, falling back
8975 to an expression, if necessary. */
8976 cp_parser_parse_tentatively (parser);
8977 /* Parse the declaration. */
8978 cp_parser_simple_declaration (parser,
8979 /*function_definition_allowed_p=*/false,
8981 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
8982 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
8984 /* It is a range-for, consume the ':' */
8985 cp_lexer_consume_token (parser->lexer);
8986 is_range_for = true;
8987 if (cxx_dialect < cxx0x)
8989 error_at (cp_lexer_peek_token (parser->lexer)->location,
8990 "range-based %<for%> loops are not allowed "
8992 *decl = error_mark_node;
8996 /* The ';' is not consumed yet because we told
8997 cp_parser_simple_declaration not to. */
8998 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9000 if (cp_parser_parse_definitely (parser))
9001 return is_range_for;
9002 /* If the tentative parse failed, then we shall need to look for an
9003 expression-statement. */
9005 /* If we are here, it is an expression-statement. */
9006 cp_parser_expression_statement (parser, NULL_TREE);
9010 /* Parse a jump-statement.
9015 return expression [opt] ;
9016 return braced-init-list ;
9024 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9027 cp_parser_jump_statement (cp_parser* parser)
9029 tree statement = error_mark_node;
9032 unsigned char in_statement;
9034 /* Peek at the next token. */
9035 token = cp_parser_require (parser, CPP_KEYWORD, RT_JUMP);
9037 return error_mark_node;
9039 /* See what kind of keyword it is. */
9040 keyword = token->keyword;
9044 in_statement = parser->in_statement & ~IN_IF_STMT;
9045 switch (in_statement)
9048 error_at (token->location, "break statement not within loop or switch");
9051 gcc_assert ((in_statement & IN_SWITCH_STMT)
9052 || in_statement == IN_ITERATION_STMT);
9053 statement = finish_break_stmt ();
9056 error_at (token->location, "invalid exit from OpenMP structured block");
9059 error_at (token->location, "break statement used with OpenMP for loop");
9062 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9066 switch (parser->in_statement & ~(IN_SWITCH_STMT | IN_IF_STMT))
9069 error_at (token->location, "continue statement not within a loop");
9071 case IN_ITERATION_STMT:
9073 statement = finish_continue_stmt ();
9076 error_at (token->location, "invalid exit from OpenMP structured block");
9081 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9087 bool expr_non_constant_p;
9089 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9091 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
9092 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
9094 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9095 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9097 /* If the next token is a `;', then there is no
9100 /* Build the return-statement. */
9101 statement = finish_return_stmt (expr);
9102 /* Look for the final `;'. */
9103 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9108 /* Create the goto-statement. */
9109 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
9111 /* Issue a warning about this use of a GNU extension. */
9112 pedwarn (token->location, OPT_pedantic, "ISO C++ forbids computed gotos");
9113 /* Consume the '*' token. */
9114 cp_lexer_consume_token (parser->lexer);
9115 /* Parse the dependent expression. */
9116 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false, NULL));
9119 finish_goto_stmt (cp_parser_identifier (parser));
9120 /* Look for the final `;'. */
9121 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9125 cp_parser_error (parser, "expected jump-statement");
9132 /* Parse a declaration-statement.
9134 declaration-statement:
9135 block-declaration */
9138 cp_parser_declaration_statement (cp_parser* parser)
9142 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9143 p = obstack_alloc (&declarator_obstack, 0);
9145 /* Parse the block-declaration. */
9146 cp_parser_block_declaration (parser, /*statement_p=*/true);
9148 /* Free any declarators allocated. */
9149 obstack_free (&declarator_obstack, p);
9151 /* Finish off the statement. */
9155 /* Some dependent statements (like `if (cond) statement'), are
9156 implicitly in their own scope. In other words, if the statement is
9157 a single statement (as opposed to a compound-statement), it is
9158 none-the-less treated as if it were enclosed in braces. Any
9159 declarations appearing in the dependent statement are out of scope
9160 after control passes that point. This function parses a statement,
9161 but ensures that is in its own scope, even if it is not a
9164 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9165 is a (possibly labeled) if statement which is not enclosed in
9166 braces and has an else clause. This is used to implement
9169 Returns the new statement. */
9172 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
9179 /* Mark if () ; with a special NOP_EXPR. */
9180 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9182 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
9183 cp_lexer_consume_token (parser->lexer);
9184 statement = add_stmt (build_empty_stmt (loc));
9186 /* if a compound is opened, we simply parse the statement directly. */
9187 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9188 statement = cp_parser_compound_statement (parser, NULL, false, false);
9189 /* If the token is not a `{', then we must take special action. */
9192 /* Create a compound-statement. */
9193 statement = begin_compound_stmt (0);
9194 /* Parse the dependent-statement. */
9195 cp_parser_statement (parser, NULL_TREE, false, if_p);
9196 /* Finish the dummy compound-statement. */
9197 finish_compound_stmt (statement);
9200 /* Return the statement. */
9204 /* For some dependent statements (like `while (cond) statement'), we
9205 have already created a scope. Therefore, even if the dependent
9206 statement is a compound-statement, we do not want to create another
9210 cp_parser_already_scoped_statement (cp_parser* parser)
9212 /* If the token is a `{', then we must take special action. */
9213 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
9214 cp_parser_statement (parser, NULL_TREE, false, NULL);
9217 /* Avoid calling cp_parser_compound_statement, so that we
9218 don't create a new scope. Do everything else by hand. */
9219 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
9220 /* If the next keyword is `__label__' we have a label declaration. */
9221 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
9222 cp_parser_label_declaration (parser);
9223 /* Parse an (optional) statement-seq. */
9224 cp_parser_statement_seq_opt (parser, NULL_TREE);
9225 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
9229 /* Declarations [gram.dcl.dcl] */
9231 /* Parse an optional declaration-sequence.
9235 declaration-seq declaration */
9238 cp_parser_declaration_seq_opt (cp_parser* parser)
9244 token = cp_lexer_peek_token (parser->lexer);
9246 if (token->type == CPP_CLOSE_BRACE
9247 || token->type == CPP_EOF
9248 || token->type == CPP_PRAGMA_EOL)
9251 if (token->type == CPP_SEMICOLON)
9253 /* A declaration consisting of a single semicolon is
9254 invalid. Allow it unless we're being pedantic. */
9255 cp_lexer_consume_token (parser->lexer);
9256 if (!in_system_header)
9257 pedwarn (input_location, OPT_pedantic, "extra %<;%>");
9261 /* If we're entering or exiting a region that's implicitly
9262 extern "C", modify the lang context appropriately. */
9263 if (!parser->implicit_extern_c && token->implicit_extern_c)
9265 push_lang_context (lang_name_c);
9266 parser->implicit_extern_c = true;
9268 else if (parser->implicit_extern_c && !token->implicit_extern_c)
9270 pop_lang_context ();
9271 parser->implicit_extern_c = false;
9274 if (token->type == CPP_PRAGMA)
9276 /* A top-level declaration can consist solely of a #pragma.
9277 A nested declaration cannot, so this is done here and not
9278 in cp_parser_declaration. (A #pragma at block scope is
9279 handled in cp_parser_statement.) */
9280 cp_parser_pragma (parser, pragma_external);
9284 /* Parse the declaration itself. */
9285 cp_parser_declaration (parser);
9289 /* Parse a declaration.
9294 template-declaration
9295 explicit-instantiation
9296 explicit-specialization
9297 linkage-specification
9298 namespace-definition
9303 __extension__ declaration */
9306 cp_parser_declaration (cp_parser* parser)
9312 tree attributes = NULL_TREE;
9314 /* Check for the `__extension__' keyword. */
9315 if (cp_parser_extension_opt (parser, &saved_pedantic))
9317 /* Parse the qualified declaration. */
9318 cp_parser_declaration (parser);
9319 /* Restore the PEDANTIC flag. */
9320 pedantic = saved_pedantic;
9325 /* Try to figure out what kind of declaration is present. */
9326 token1 = *cp_lexer_peek_token (parser->lexer);
9328 if (token1.type != CPP_EOF)
9329 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
9332 token2.type = CPP_EOF;
9333 token2.keyword = RID_MAX;
9336 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9337 p = obstack_alloc (&declarator_obstack, 0);
9339 /* If the next token is `extern' and the following token is a string
9340 literal, then we have a linkage specification. */
9341 if (token1.keyword == RID_EXTERN
9342 && cp_parser_is_string_literal (&token2))
9343 cp_parser_linkage_specification (parser);
9344 /* If the next token is `template', then we have either a template
9345 declaration, an explicit instantiation, or an explicit
9347 else if (token1.keyword == RID_TEMPLATE)
9349 /* `template <>' indicates a template specialization. */
9350 if (token2.type == CPP_LESS
9351 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
9352 cp_parser_explicit_specialization (parser);
9353 /* `template <' indicates a template declaration. */
9354 else if (token2.type == CPP_LESS)
9355 cp_parser_template_declaration (parser, /*member_p=*/false);
9356 /* Anything else must be an explicit instantiation. */
9358 cp_parser_explicit_instantiation (parser);
9360 /* If the next token is `export', then we have a template
9362 else if (token1.keyword == RID_EXPORT)
9363 cp_parser_template_declaration (parser, /*member_p=*/false);
9364 /* If the next token is `extern', 'static' or 'inline' and the one
9365 after that is `template', we have a GNU extended explicit
9366 instantiation directive. */
9367 else if (cp_parser_allow_gnu_extensions_p (parser)
9368 && (token1.keyword == RID_EXTERN
9369 || token1.keyword == RID_STATIC
9370 || token1.keyword == RID_INLINE)
9371 && token2.keyword == RID_TEMPLATE)
9372 cp_parser_explicit_instantiation (parser);
9373 /* If the next token is `namespace', check for a named or unnamed
9374 namespace definition. */
9375 else if (token1.keyword == RID_NAMESPACE
9376 && (/* A named namespace definition. */
9377 (token2.type == CPP_NAME
9378 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
9380 /* An unnamed namespace definition. */
9381 || token2.type == CPP_OPEN_BRACE
9382 || token2.keyword == RID_ATTRIBUTE))
9383 cp_parser_namespace_definition (parser);
9384 /* An inline (associated) namespace definition. */
9385 else if (token1.keyword == RID_INLINE
9386 && token2.keyword == RID_NAMESPACE)
9387 cp_parser_namespace_definition (parser);
9388 /* Objective-C++ declaration/definition. */
9389 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
9390 cp_parser_objc_declaration (parser, NULL_TREE);
9391 else if (c_dialect_objc ()
9392 && token1.keyword == RID_ATTRIBUTE
9393 && cp_parser_objc_valid_prefix_attributes (parser, &attributes))
9394 cp_parser_objc_declaration (parser, attributes);
9395 /* We must have either a block declaration or a function
9398 /* Try to parse a block-declaration, or a function-definition. */
9399 cp_parser_block_declaration (parser, /*statement_p=*/false);
9401 /* Free any declarators allocated. */
9402 obstack_free (&declarator_obstack, p);
9405 /* Parse a block-declaration.
9410 namespace-alias-definition
9417 __extension__ block-declaration
9422 static_assert-declaration
9424 If STATEMENT_P is TRUE, then this block-declaration is occurring as
9425 part of a declaration-statement. */
9428 cp_parser_block_declaration (cp_parser *parser,
9434 /* Check for the `__extension__' keyword. */
9435 if (cp_parser_extension_opt (parser, &saved_pedantic))
9437 /* Parse the qualified declaration. */
9438 cp_parser_block_declaration (parser, statement_p);
9439 /* Restore the PEDANTIC flag. */
9440 pedantic = saved_pedantic;
9445 /* Peek at the next token to figure out which kind of declaration is
9447 token1 = cp_lexer_peek_token (parser->lexer);
9449 /* If the next keyword is `asm', we have an asm-definition. */
9450 if (token1->keyword == RID_ASM)
9453 cp_parser_commit_to_tentative_parse (parser);
9454 cp_parser_asm_definition (parser);
9456 /* If the next keyword is `namespace', we have a
9457 namespace-alias-definition. */
9458 else if (token1->keyword == RID_NAMESPACE)
9459 cp_parser_namespace_alias_definition (parser);
9460 /* If the next keyword is `using', we have either a
9461 using-declaration or a using-directive. */
9462 else if (token1->keyword == RID_USING)
9467 cp_parser_commit_to_tentative_parse (parser);
9468 /* If the token after `using' is `namespace', then we have a
9470 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
9471 if (token2->keyword == RID_NAMESPACE)
9472 cp_parser_using_directive (parser);
9473 /* Otherwise, it's a using-declaration. */
9475 cp_parser_using_declaration (parser,
9476 /*access_declaration_p=*/false);
9478 /* If the next keyword is `__label__' we have a misplaced label
9480 else if (token1->keyword == RID_LABEL)
9482 cp_lexer_consume_token (parser->lexer);
9483 error_at (token1->location, "%<__label__%> not at the beginning of a block");
9484 cp_parser_skip_to_end_of_statement (parser);
9485 /* If the next token is now a `;', consume it. */
9486 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9487 cp_lexer_consume_token (parser->lexer);
9489 /* If the next token is `static_assert' we have a static assertion. */
9490 else if (token1->keyword == RID_STATIC_ASSERT)
9491 cp_parser_static_assert (parser, /*member_p=*/false);
9492 /* Anything else must be a simple-declaration. */
9494 cp_parser_simple_declaration (parser, !statement_p,
9495 /*maybe_range_for_decl*/NULL);
9498 /* Parse a simple-declaration.
9501 decl-specifier-seq [opt] init-declarator-list [opt] ;
9503 init-declarator-list:
9505 init-declarator-list , init-declarator
9507 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
9508 function-definition as a simple-declaration.
9510 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
9511 parsed declaration if it is an uninitialized single declarator not followed
9512 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
9513 if present, will not be consumed. */
9516 cp_parser_simple_declaration (cp_parser* parser,
9517 bool function_definition_allowed_p,
9518 tree *maybe_range_for_decl)
9520 cp_decl_specifier_seq decl_specifiers;
9521 int declares_class_or_enum;
9522 bool saw_declarator;
9524 if (maybe_range_for_decl)
9525 *maybe_range_for_decl = NULL_TREE;
9527 /* Defer access checks until we know what is being declared; the
9528 checks for names appearing in the decl-specifier-seq should be
9529 done as if we were in the scope of the thing being declared. */
9530 push_deferring_access_checks (dk_deferred);
9532 /* Parse the decl-specifier-seq. We have to keep track of whether
9533 or not the decl-specifier-seq declares a named class or
9534 enumeration type, since that is the only case in which the
9535 init-declarator-list is allowed to be empty.
9539 In a simple-declaration, the optional init-declarator-list can be
9540 omitted only when declaring a class or enumeration, that is when
9541 the decl-specifier-seq contains either a class-specifier, an
9542 elaborated-type-specifier, or an enum-specifier. */
9543 cp_parser_decl_specifier_seq (parser,
9544 CP_PARSER_FLAGS_OPTIONAL,
9546 &declares_class_or_enum);
9547 /* We no longer need to defer access checks. */
9548 stop_deferring_access_checks ();
9550 /* In a block scope, a valid declaration must always have a
9551 decl-specifier-seq. By not trying to parse declarators, we can
9552 resolve the declaration/expression ambiguity more quickly. */
9553 if (!function_definition_allowed_p
9554 && !decl_specifiers.any_specifiers_p)
9556 cp_parser_error (parser, "expected declaration");
9560 /* If the next two tokens are both identifiers, the code is
9561 erroneous. The usual cause of this situation is code like:
9565 where "T" should name a type -- but does not. */
9566 if (!decl_specifiers.any_type_specifiers_p
9567 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
9569 /* If parsing tentatively, we should commit; we really are
9570 looking at a declaration. */
9571 cp_parser_commit_to_tentative_parse (parser);
9576 /* If we have seen at least one decl-specifier, and the next token
9577 is not a parenthesis, then we must be looking at a declaration.
9578 (After "int (" we might be looking at a functional cast.) */
9579 if (decl_specifiers.any_specifiers_p
9580 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN)
9581 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
9582 && !cp_parser_error_occurred (parser))
9583 cp_parser_commit_to_tentative_parse (parser);
9585 /* Keep going until we hit the `;' at the end of the simple
9587 saw_declarator = false;
9588 while (cp_lexer_next_token_is_not (parser->lexer,
9592 bool function_definition_p;
9597 /* If we are processing next declarator, coma is expected */
9598 token = cp_lexer_peek_token (parser->lexer);
9599 gcc_assert (token->type == CPP_COMMA);
9600 cp_lexer_consume_token (parser->lexer);
9601 if (maybe_range_for_decl)
9602 *maybe_range_for_decl = error_mark_node;
9605 saw_declarator = true;
9607 /* Parse the init-declarator. */
9608 decl = cp_parser_init_declarator (parser, &decl_specifiers,
9610 function_definition_allowed_p,
9612 declares_class_or_enum,
9613 &function_definition_p,
9614 maybe_range_for_decl);
9615 /* If an error occurred while parsing tentatively, exit quickly.
9616 (That usually happens when in the body of a function; each
9617 statement is treated as a declaration-statement until proven
9619 if (cp_parser_error_occurred (parser))
9621 /* Handle function definitions specially. */
9622 if (function_definition_p)
9624 /* If the next token is a `,', then we are probably
9625 processing something like:
9629 which is erroneous. */
9630 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
9632 cp_token *token = cp_lexer_peek_token (parser->lexer);
9633 error_at (token->location,
9635 " declarations and function-definitions is forbidden");
9637 /* Otherwise, we're done with the list of declarators. */
9640 pop_deferring_access_checks ();
9644 if (maybe_range_for_decl && *maybe_range_for_decl == NULL_TREE)
9645 *maybe_range_for_decl = decl;
9646 /* The next token should be either a `,' or a `;'. */
9647 token = cp_lexer_peek_token (parser->lexer);
9648 /* If it's a `,', there are more declarators to come. */
9649 if (token->type == CPP_COMMA)
9650 /* will be consumed next time around */;
9651 /* If it's a `;', we are done. */
9652 else if (token->type == CPP_SEMICOLON || maybe_range_for_decl)
9654 /* Anything else is an error. */
9657 /* If we have already issued an error message we don't need
9658 to issue another one. */
9659 if (decl != error_mark_node
9660 || cp_parser_uncommitted_to_tentative_parse_p (parser))
9661 cp_parser_error (parser, "expected %<,%> or %<;%>");
9662 /* Skip tokens until we reach the end of the statement. */
9663 cp_parser_skip_to_end_of_statement (parser);
9664 /* If the next token is now a `;', consume it. */
9665 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9666 cp_lexer_consume_token (parser->lexer);
9669 /* After the first time around, a function-definition is not
9670 allowed -- even if it was OK at first. For example:
9675 function_definition_allowed_p = false;
9678 /* Issue an error message if no declarators are present, and the
9679 decl-specifier-seq does not itself declare a class or
9681 if (!saw_declarator)
9683 if (cp_parser_declares_only_class_p (parser))
9684 shadow_tag (&decl_specifiers);
9685 /* Perform any deferred access checks. */
9686 perform_deferred_access_checks ();
9689 /* Consume the `;'. */
9690 if (!maybe_range_for_decl)
9691 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9694 pop_deferring_access_checks ();
9697 /* Parse a decl-specifier-seq.
9700 decl-specifier-seq [opt] decl-specifier
9703 storage-class-specifier
9714 Set *DECL_SPECS to a representation of the decl-specifier-seq.
9716 The parser flags FLAGS is used to control type-specifier parsing.
9718 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
9721 1: one of the decl-specifiers is an elaborated-type-specifier
9722 (i.e., a type declaration)
9723 2: one of the decl-specifiers is an enum-specifier or a
9724 class-specifier (i.e., a type definition)
9729 cp_parser_decl_specifier_seq (cp_parser* parser,
9730 cp_parser_flags flags,
9731 cp_decl_specifier_seq *decl_specs,
9732 int* declares_class_or_enum)
9734 bool constructor_possible_p = !parser->in_declarator_p;
9735 cp_token *start_token = NULL;
9737 /* Clear DECL_SPECS. */
9738 clear_decl_specs (decl_specs);
9740 /* Assume no class or enumeration type is declared. */
9741 *declares_class_or_enum = 0;
9743 /* Keep reading specifiers until there are no more to read. */
9747 bool found_decl_spec;
9750 /* Peek at the next token. */
9751 token = cp_lexer_peek_token (parser->lexer);
9753 /* Save the first token of the decl spec list for error
9756 start_token = token;
9757 /* Handle attributes. */
9758 if (token->keyword == RID_ATTRIBUTE)
9760 /* Parse the attributes. */
9761 decl_specs->attributes
9762 = chainon (decl_specs->attributes,
9763 cp_parser_attributes_opt (parser));
9766 /* Assume we will find a decl-specifier keyword. */
9767 found_decl_spec = true;
9768 /* If the next token is an appropriate keyword, we can simply
9769 add it to the list. */
9770 switch (token->keyword)
9776 if (!at_class_scope_p ())
9778 error_at (token->location, "%<friend%> used outside of class");
9779 cp_lexer_purge_token (parser->lexer);
9783 ++decl_specs->specs[(int) ds_friend];
9784 /* Consume the token. */
9785 cp_lexer_consume_token (parser->lexer);
9790 ++decl_specs->specs[(int) ds_constexpr];
9791 cp_lexer_consume_token (parser->lexer);
9794 /* function-specifier:
9801 cp_parser_function_specifier_opt (parser, decl_specs);
9807 ++decl_specs->specs[(int) ds_typedef];
9808 /* Consume the token. */
9809 cp_lexer_consume_token (parser->lexer);
9810 /* A constructor declarator cannot appear in a typedef. */
9811 constructor_possible_p = false;
9812 /* The "typedef" keyword can only occur in a declaration; we
9813 may as well commit at this point. */
9814 cp_parser_commit_to_tentative_parse (parser);
9816 if (decl_specs->storage_class != sc_none)
9817 decl_specs->conflicting_specifiers_p = true;
9820 /* storage-class-specifier:
9830 if (cxx_dialect == cxx98)
9832 /* Consume the token. */
9833 cp_lexer_consume_token (parser->lexer);
9835 /* Complain about `auto' as a storage specifier, if
9836 we're complaining about C++0x compatibility. */
9837 warning_at (token->location, OPT_Wc__0x_compat, "%<auto%>"
9838 " will change meaning in C++0x; please remove it");
9840 /* Set the storage class anyway. */
9841 cp_parser_set_storage_class (parser, decl_specs, RID_AUTO,
9845 /* C++0x auto type-specifier. */
9846 found_decl_spec = false;
9853 /* Consume the token. */
9854 cp_lexer_consume_token (parser->lexer);
9855 cp_parser_set_storage_class (parser, decl_specs, token->keyword,
9859 /* Consume the token. */
9860 cp_lexer_consume_token (parser->lexer);
9861 ++decl_specs->specs[(int) ds_thread];
9865 /* We did not yet find a decl-specifier yet. */
9866 found_decl_spec = false;
9871 && (flags & CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR)
9872 && token->keyword != RID_CONSTEXPR)
9873 error ("decl-specifier invalid in condition");
9875 /* Constructors are a special case. The `S' in `S()' is not a
9876 decl-specifier; it is the beginning of the declarator. */
9879 && constructor_possible_p
9880 && (cp_parser_constructor_declarator_p
9881 (parser, decl_specs->specs[(int) ds_friend] != 0)));
9883 /* If we don't have a DECL_SPEC yet, then we must be looking at
9884 a type-specifier. */
9885 if (!found_decl_spec && !constructor_p)
9887 int decl_spec_declares_class_or_enum;
9888 bool is_cv_qualifier;
9892 = cp_parser_type_specifier (parser, flags,
9894 /*is_declaration=*/true,
9895 &decl_spec_declares_class_or_enum,
9897 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
9899 /* If this type-specifier referenced a user-defined type
9900 (a typedef, class-name, etc.), then we can't allow any
9901 more such type-specifiers henceforth.
9905 The longest sequence of decl-specifiers that could
9906 possibly be a type name is taken as the
9907 decl-specifier-seq of a declaration. The sequence shall
9908 be self-consistent as described below.
9912 As a general rule, at most one type-specifier is allowed
9913 in the complete decl-specifier-seq of a declaration. The
9914 only exceptions are the following:
9916 -- const or volatile can be combined with any other
9919 -- signed or unsigned can be combined with char, long,
9927 void g (const int Pc);
9929 Here, Pc is *not* part of the decl-specifier seq; it's
9930 the declarator. Therefore, once we see a type-specifier
9931 (other than a cv-qualifier), we forbid any additional
9932 user-defined types. We *do* still allow things like `int
9933 int' to be considered a decl-specifier-seq, and issue the
9934 error message later. */
9935 if (type_spec && !is_cv_qualifier)
9936 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
9937 /* A constructor declarator cannot follow a type-specifier. */
9940 constructor_possible_p = false;
9941 found_decl_spec = true;
9942 if (!is_cv_qualifier)
9943 decl_specs->any_type_specifiers_p = true;
9947 /* If we still do not have a DECL_SPEC, then there are no more
9949 if (!found_decl_spec)
9952 decl_specs->any_specifiers_p = true;
9953 /* After we see one decl-specifier, further decl-specifiers are
9955 flags |= CP_PARSER_FLAGS_OPTIONAL;
9958 cp_parser_check_decl_spec (decl_specs, start_token->location);
9960 /* Don't allow a friend specifier with a class definition. */
9961 if (decl_specs->specs[(int) ds_friend] != 0
9962 && (*declares_class_or_enum & 2))
9963 error_at (start_token->location,
9964 "class definition may not be declared a friend");
9967 /* Parse an (optional) storage-class-specifier.
9969 storage-class-specifier:
9978 storage-class-specifier:
9981 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
9984 cp_parser_storage_class_specifier_opt (cp_parser* parser)
9986 switch (cp_lexer_peek_token (parser->lexer)->keyword)
9989 if (cxx_dialect != cxx98)
9991 /* Fall through for C++98. */
9998 /* Consume the token. */
9999 return cp_lexer_consume_token (parser->lexer)->u.value;
10006 /* Parse an (optional) function-specifier.
10008 function-specifier:
10013 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10014 Updates DECL_SPECS, if it is non-NULL. */
10017 cp_parser_function_specifier_opt (cp_parser* parser,
10018 cp_decl_specifier_seq *decl_specs)
10020 cp_token *token = cp_lexer_peek_token (parser->lexer);
10021 switch (token->keyword)
10025 ++decl_specs->specs[(int) ds_inline];
10029 /* 14.5.2.3 [temp.mem]
10031 A member function template shall not be virtual. */
10032 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
10033 error_at (token->location, "templates may not be %<virtual%>");
10034 else if (decl_specs)
10035 ++decl_specs->specs[(int) ds_virtual];
10040 ++decl_specs->specs[(int) ds_explicit];
10047 /* Consume the token. */
10048 return cp_lexer_consume_token (parser->lexer)->u.value;
10051 /* Parse a linkage-specification.
10053 linkage-specification:
10054 extern string-literal { declaration-seq [opt] }
10055 extern string-literal declaration */
10058 cp_parser_linkage_specification (cp_parser* parser)
10062 /* Look for the `extern' keyword. */
10063 cp_parser_require_keyword (parser, RID_EXTERN, RT_EXTERN);
10065 /* Look for the string-literal. */
10066 linkage = cp_parser_string_literal (parser, false, false);
10068 /* Transform the literal into an identifier. If the literal is a
10069 wide-character string, or contains embedded NULs, then we can't
10070 handle it as the user wants. */
10071 if (strlen (TREE_STRING_POINTER (linkage))
10072 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
10074 cp_parser_error (parser, "invalid linkage-specification");
10075 /* Assume C++ linkage. */
10076 linkage = lang_name_cplusplus;
10079 linkage = get_identifier (TREE_STRING_POINTER (linkage));
10081 /* We're now using the new linkage. */
10082 push_lang_context (linkage);
10084 /* If the next token is a `{', then we're using the first
10086 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
10088 /* Consume the `{' token. */
10089 cp_lexer_consume_token (parser->lexer);
10090 /* Parse the declarations. */
10091 cp_parser_declaration_seq_opt (parser);
10092 /* Look for the closing `}'. */
10093 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
10095 /* Otherwise, there's just one declaration. */
10098 bool saved_in_unbraced_linkage_specification_p;
10100 saved_in_unbraced_linkage_specification_p
10101 = parser->in_unbraced_linkage_specification_p;
10102 parser->in_unbraced_linkage_specification_p = true;
10103 cp_parser_declaration (parser);
10104 parser->in_unbraced_linkage_specification_p
10105 = saved_in_unbraced_linkage_specification_p;
10108 /* We're done with the linkage-specification. */
10109 pop_lang_context ();
10112 /* Parse a static_assert-declaration.
10114 static_assert-declaration:
10115 static_assert ( constant-expression , string-literal ) ;
10117 If MEMBER_P, this static_assert is a class member. */
10120 cp_parser_static_assert(cp_parser *parser, bool member_p)
10125 location_t saved_loc;
10128 /* Peek at the `static_assert' token so we can keep track of exactly
10129 where the static assertion started. */
10130 token = cp_lexer_peek_token (parser->lexer);
10131 saved_loc = token->location;
10133 /* Look for the `static_assert' keyword. */
10134 if (!cp_parser_require_keyword (parser, RID_STATIC_ASSERT,
10138 /* We know we are in a static assertion; commit to any tentative
10140 if (cp_parser_parsing_tentatively (parser))
10141 cp_parser_commit_to_tentative_parse (parser);
10143 /* Parse the `(' starting the static assertion condition. */
10144 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
10146 /* Parse the constant-expression. Allow a non-constant expression
10147 here in order to give better diagnostics in finish_static_assert. */
10149 cp_parser_constant_expression (parser,
10150 /*allow_non_constant_p=*/true,
10151 /*non_constant_p=*/&dummy);
10153 /* Parse the separating `,'. */
10154 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
10156 /* Parse the string-literal message. */
10157 message = cp_parser_string_literal (parser,
10158 /*translate=*/false,
10161 /* A `)' completes the static assertion. */
10162 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
10163 cp_parser_skip_to_closing_parenthesis (parser,
10164 /*recovering=*/true,
10165 /*or_comma=*/false,
10166 /*consume_paren=*/true);
10168 /* A semicolon terminates the declaration. */
10169 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
10171 /* Complete the static assertion, which may mean either processing
10172 the static assert now or saving it for template instantiation. */
10173 finish_static_assert (condition, message, saved_loc, member_p);
10176 /* Parse a `decltype' type. Returns the type.
10178 simple-type-specifier:
10179 decltype ( expression ) */
10182 cp_parser_decltype (cp_parser *parser)
10185 bool id_expression_or_member_access_p = false;
10186 const char *saved_message;
10187 bool saved_integral_constant_expression_p;
10188 bool saved_non_integral_constant_expression_p;
10189 cp_token *id_expr_start_token;
10191 /* Look for the `decltype' token. */
10192 if (!cp_parser_require_keyword (parser, RID_DECLTYPE, RT_DECLTYPE))
10193 return error_mark_node;
10195 /* Types cannot be defined in a `decltype' expression. Save away the
10197 saved_message = parser->type_definition_forbidden_message;
10199 /* And create the new one. */
10200 parser->type_definition_forbidden_message
10201 = G_("types may not be defined in %<decltype%> expressions");
10203 /* The restrictions on constant-expressions do not apply inside
10204 decltype expressions. */
10205 saved_integral_constant_expression_p
10206 = parser->integral_constant_expression_p;
10207 saved_non_integral_constant_expression_p
10208 = parser->non_integral_constant_expression_p;
10209 parser->integral_constant_expression_p = false;
10211 /* Do not actually evaluate the expression. */
10212 ++cp_unevaluated_operand;
10214 /* Do not warn about problems with the expression. */
10215 ++c_inhibit_evaluation_warnings;
10217 /* Parse the opening `('. */
10218 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
10219 return error_mark_node;
10221 /* First, try parsing an id-expression. */
10222 id_expr_start_token = cp_lexer_peek_token (parser->lexer);
10223 cp_parser_parse_tentatively (parser);
10224 expr = cp_parser_id_expression (parser,
10225 /*template_keyword_p=*/false,
10226 /*check_dependency_p=*/true,
10227 /*template_p=*/NULL,
10228 /*declarator_p=*/false,
10229 /*optional_p=*/false);
10231 if (!cp_parser_error_occurred (parser) && expr != error_mark_node)
10233 bool non_integral_constant_expression_p = false;
10234 tree id_expression = expr;
10236 const char *error_msg;
10238 if (TREE_CODE (expr) == IDENTIFIER_NODE)
10239 /* Lookup the name we got back from the id-expression. */
10240 expr = cp_parser_lookup_name (parser, expr,
10242 /*is_template=*/false,
10243 /*is_namespace=*/false,
10244 /*check_dependency=*/true,
10245 /*ambiguous_decls=*/NULL,
10246 id_expr_start_token->location);
10249 && expr != error_mark_node
10250 && TREE_CODE (expr) != TEMPLATE_ID_EXPR
10251 && TREE_CODE (expr) != TYPE_DECL
10252 && (TREE_CODE (expr) != BIT_NOT_EXPR
10253 || !TYPE_P (TREE_OPERAND (expr, 0)))
10254 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
10256 /* Complete lookup of the id-expression. */
10257 expr = (finish_id_expression
10258 (id_expression, expr, parser->scope, &idk,
10259 /*integral_constant_expression_p=*/false,
10260 /*allow_non_integral_constant_expression_p=*/true,
10261 &non_integral_constant_expression_p,
10262 /*template_p=*/false,
10264 /*address_p=*/false,
10265 /*template_arg_p=*/false,
10267 id_expr_start_token->location));
10269 if (expr == error_mark_node)
10270 /* We found an id-expression, but it was something that we
10271 should not have found. This is an error, not something
10272 we can recover from, so note that we found an
10273 id-expression and we'll recover as gracefully as
10275 id_expression_or_member_access_p = true;
10279 && expr != error_mark_node
10280 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
10281 /* We have an id-expression. */
10282 id_expression_or_member_access_p = true;
10285 if (!id_expression_or_member_access_p)
10287 /* Abort the id-expression parse. */
10288 cp_parser_abort_tentative_parse (parser);
10290 /* Parsing tentatively, again. */
10291 cp_parser_parse_tentatively (parser);
10293 /* Parse a class member access. */
10294 expr = cp_parser_postfix_expression (parser, /*address_p=*/false,
10296 /*member_access_only_p=*/true, NULL);
10299 && expr != error_mark_node
10300 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
10301 /* We have an id-expression. */
10302 id_expression_or_member_access_p = true;
10305 if (id_expression_or_member_access_p)
10306 /* We have parsed the complete id-expression or member access. */
10307 cp_parser_parse_definitely (parser);
10310 bool saved_greater_than_is_operator_p;
10312 /* Abort our attempt to parse an id-expression or member access
10314 cp_parser_abort_tentative_parse (parser);
10316 /* Within a parenthesized expression, a `>' token is always
10317 the greater-than operator. */
10318 saved_greater_than_is_operator_p
10319 = parser->greater_than_is_operator_p;
10320 parser->greater_than_is_operator_p = true;
10322 /* Parse a full expression. */
10323 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
10325 /* The `>' token might be the end of a template-id or
10326 template-parameter-list now. */
10327 parser->greater_than_is_operator_p
10328 = saved_greater_than_is_operator_p;
10331 /* Go back to evaluating expressions. */
10332 --cp_unevaluated_operand;
10333 --c_inhibit_evaluation_warnings;
10335 /* Restore the old message and the integral constant expression
10337 parser->type_definition_forbidden_message = saved_message;
10338 parser->integral_constant_expression_p
10339 = saved_integral_constant_expression_p;
10340 parser->non_integral_constant_expression_p
10341 = saved_non_integral_constant_expression_p;
10343 if (expr == error_mark_node)
10345 /* Skip everything up to the closing `)'. */
10346 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10347 /*consume_paren=*/true);
10348 return error_mark_node;
10351 /* Parse to the closing `)'. */
10352 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
10354 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10355 /*consume_paren=*/true);
10356 return error_mark_node;
10359 return finish_decltype_type (expr, id_expression_or_member_access_p,
10360 tf_warning_or_error);
10363 /* Special member functions [gram.special] */
10365 /* Parse a conversion-function-id.
10367 conversion-function-id:
10368 operator conversion-type-id
10370 Returns an IDENTIFIER_NODE representing the operator. */
10373 cp_parser_conversion_function_id (cp_parser* parser)
10377 tree saved_qualifying_scope;
10378 tree saved_object_scope;
10379 tree pushed_scope = NULL_TREE;
10381 /* Look for the `operator' token. */
10382 if (!cp_parser_require_keyword (parser, RID_OPERATOR, RT_OPERATOR))
10383 return error_mark_node;
10384 /* When we parse the conversion-type-id, the current scope will be
10385 reset. However, we need that information in able to look up the
10386 conversion function later, so we save it here. */
10387 saved_scope = parser->scope;
10388 saved_qualifying_scope = parser->qualifying_scope;
10389 saved_object_scope = parser->object_scope;
10390 /* We must enter the scope of the class so that the names of
10391 entities declared within the class are available in the
10392 conversion-type-id. For example, consider:
10399 S::operator I() { ... }
10401 In order to see that `I' is a type-name in the definition, we
10402 must be in the scope of `S'. */
10404 pushed_scope = push_scope (saved_scope);
10405 /* Parse the conversion-type-id. */
10406 type = cp_parser_conversion_type_id (parser);
10407 /* Leave the scope of the class, if any. */
10409 pop_scope (pushed_scope);
10410 /* Restore the saved scope. */
10411 parser->scope = saved_scope;
10412 parser->qualifying_scope = saved_qualifying_scope;
10413 parser->object_scope = saved_object_scope;
10414 /* If the TYPE is invalid, indicate failure. */
10415 if (type == error_mark_node)
10416 return error_mark_node;
10417 return mangle_conv_op_name_for_type (type);
10420 /* Parse a conversion-type-id:
10422 conversion-type-id:
10423 type-specifier-seq conversion-declarator [opt]
10425 Returns the TYPE specified. */
10428 cp_parser_conversion_type_id (cp_parser* parser)
10431 cp_decl_specifier_seq type_specifiers;
10432 cp_declarator *declarator;
10433 tree type_specified;
10435 /* Parse the attributes. */
10436 attributes = cp_parser_attributes_opt (parser);
10437 /* Parse the type-specifiers. */
10438 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
10439 /*is_trailing_return=*/false,
10441 /* If that didn't work, stop. */
10442 if (type_specifiers.type == error_mark_node)
10443 return error_mark_node;
10444 /* Parse the conversion-declarator. */
10445 declarator = cp_parser_conversion_declarator_opt (parser);
10447 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
10448 /*initialized=*/0, &attributes);
10450 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
10452 /* Don't give this error when parsing tentatively. This happens to
10453 work because we always parse this definitively once. */
10454 if (! cp_parser_uncommitted_to_tentative_parse_p (parser)
10455 && type_uses_auto (type_specified))
10457 error ("invalid use of %<auto%> in conversion operator");
10458 return error_mark_node;
10461 return type_specified;
10464 /* Parse an (optional) conversion-declarator.
10466 conversion-declarator:
10467 ptr-operator conversion-declarator [opt]
10471 static cp_declarator *
10472 cp_parser_conversion_declarator_opt (cp_parser* parser)
10474 enum tree_code code;
10476 cp_cv_quals cv_quals;
10478 /* We don't know if there's a ptr-operator next, or not. */
10479 cp_parser_parse_tentatively (parser);
10480 /* Try the ptr-operator. */
10481 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
10482 /* If it worked, look for more conversion-declarators. */
10483 if (cp_parser_parse_definitely (parser))
10485 cp_declarator *declarator;
10487 /* Parse another optional declarator. */
10488 declarator = cp_parser_conversion_declarator_opt (parser);
10490 return cp_parser_make_indirect_declarator
10491 (code, class_type, cv_quals, declarator);
10497 /* Parse an (optional) ctor-initializer.
10500 : mem-initializer-list
10502 Returns TRUE iff the ctor-initializer was actually present. */
10505 cp_parser_ctor_initializer_opt (cp_parser* parser)
10507 /* If the next token is not a `:', then there is no
10508 ctor-initializer. */
10509 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
10511 /* Do default initialization of any bases and members. */
10512 if (DECL_CONSTRUCTOR_P (current_function_decl))
10513 finish_mem_initializers (NULL_TREE);
10518 /* Consume the `:' token. */
10519 cp_lexer_consume_token (parser->lexer);
10520 /* And the mem-initializer-list. */
10521 cp_parser_mem_initializer_list (parser);
10526 /* Parse a mem-initializer-list.
10528 mem-initializer-list:
10529 mem-initializer ... [opt]
10530 mem-initializer ... [opt] , mem-initializer-list */
10533 cp_parser_mem_initializer_list (cp_parser* parser)
10535 tree mem_initializer_list = NULL_TREE;
10536 cp_token *token = cp_lexer_peek_token (parser->lexer);
10538 /* Let the semantic analysis code know that we are starting the
10539 mem-initializer-list. */
10540 if (!DECL_CONSTRUCTOR_P (current_function_decl))
10541 error_at (token->location,
10542 "only constructors take member initializers");
10544 /* Loop through the list. */
10547 tree mem_initializer;
10549 token = cp_lexer_peek_token (parser->lexer);
10550 /* Parse the mem-initializer. */
10551 mem_initializer = cp_parser_mem_initializer (parser);
10552 /* If the next token is a `...', we're expanding member initializers. */
10553 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
10555 /* Consume the `...'. */
10556 cp_lexer_consume_token (parser->lexer);
10558 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
10559 can be expanded but members cannot. */
10560 if (mem_initializer != error_mark_node
10561 && !TYPE_P (TREE_PURPOSE (mem_initializer)))
10563 error_at (token->location,
10564 "cannot expand initializer for member %<%D%>",
10565 TREE_PURPOSE (mem_initializer));
10566 mem_initializer = error_mark_node;
10569 /* Construct the pack expansion type. */
10570 if (mem_initializer != error_mark_node)
10571 mem_initializer = make_pack_expansion (mem_initializer);
10573 /* Add it to the list, unless it was erroneous. */
10574 if (mem_initializer != error_mark_node)
10576 TREE_CHAIN (mem_initializer) = mem_initializer_list;
10577 mem_initializer_list = mem_initializer;
10579 /* If the next token is not a `,', we're done. */
10580 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
10582 /* Consume the `,' token. */
10583 cp_lexer_consume_token (parser->lexer);
10586 /* Perform semantic analysis. */
10587 if (DECL_CONSTRUCTOR_P (current_function_decl))
10588 finish_mem_initializers (mem_initializer_list);
10591 /* Parse a mem-initializer.
10594 mem-initializer-id ( expression-list [opt] )
10595 mem-initializer-id braced-init-list
10600 ( expression-list [opt] )
10602 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
10603 class) or FIELD_DECL (for a non-static data member) to initialize;
10604 the TREE_VALUE is the expression-list. An empty initialization
10605 list is represented by void_list_node. */
10608 cp_parser_mem_initializer (cp_parser* parser)
10610 tree mem_initializer_id;
10611 tree expression_list;
10613 cp_token *token = cp_lexer_peek_token (parser->lexer);
10615 /* Find out what is being initialized. */
10616 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
10618 permerror (token->location,
10619 "anachronistic old-style base class initializer");
10620 mem_initializer_id = NULL_TREE;
10624 mem_initializer_id = cp_parser_mem_initializer_id (parser);
10625 if (mem_initializer_id == error_mark_node)
10626 return mem_initializer_id;
10628 member = expand_member_init (mem_initializer_id);
10629 if (member && !DECL_P (member))
10630 in_base_initializer = 1;
10632 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
10634 bool expr_non_constant_p;
10635 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
10636 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
10637 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
10638 expression_list = build_tree_list (NULL_TREE, expression_list);
10643 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
10645 /*allow_expansion_p=*/true,
10646 /*non_constant_p=*/NULL);
10648 return error_mark_node;
10649 expression_list = build_tree_list_vec (vec);
10650 release_tree_vector (vec);
10653 if (expression_list == error_mark_node)
10654 return error_mark_node;
10655 if (!expression_list)
10656 expression_list = void_type_node;
10658 in_base_initializer = 0;
10660 return member ? build_tree_list (member, expression_list) : error_mark_node;
10663 /* Parse a mem-initializer-id.
10665 mem-initializer-id:
10666 :: [opt] nested-name-specifier [opt] class-name
10669 Returns a TYPE indicating the class to be initializer for the first
10670 production. Returns an IDENTIFIER_NODE indicating the data member
10671 to be initialized for the second production. */
10674 cp_parser_mem_initializer_id (cp_parser* parser)
10676 bool global_scope_p;
10677 bool nested_name_specifier_p;
10678 bool template_p = false;
10681 cp_token *token = cp_lexer_peek_token (parser->lexer);
10683 /* `typename' is not allowed in this context ([temp.res]). */
10684 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
10686 error_at (token->location,
10687 "keyword %<typename%> not allowed in this context (a qualified "
10688 "member initializer is implicitly a type)");
10689 cp_lexer_consume_token (parser->lexer);
10691 /* Look for the optional `::' operator. */
10693 = (cp_parser_global_scope_opt (parser,
10694 /*current_scope_valid_p=*/false)
10696 /* Look for the optional nested-name-specifier. The simplest way to
10701 The keyword `typename' is not permitted in a base-specifier or
10702 mem-initializer; in these contexts a qualified name that
10703 depends on a template-parameter is implicitly assumed to be a
10706 is to assume that we have seen the `typename' keyword at this
10708 nested_name_specifier_p
10709 = (cp_parser_nested_name_specifier_opt (parser,
10710 /*typename_keyword_p=*/true,
10711 /*check_dependency_p=*/true,
10713 /*is_declaration=*/true)
10715 if (nested_name_specifier_p)
10716 template_p = cp_parser_optional_template_keyword (parser);
10717 /* If there is a `::' operator or a nested-name-specifier, then we
10718 are definitely looking for a class-name. */
10719 if (global_scope_p || nested_name_specifier_p)
10720 return cp_parser_class_name (parser,
10721 /*typename_keyword_p=*/true,
10722 /*template_keyword_p=*/template_p,
10724 /*check_dependency_p=*/true,
10725 /*class_head_p=*/false,
10726 /*is_declaration=*/true);
10727 /* Otherwise, we could also be looking for an ordinary identifier. */
10728 cp_parser_parse_tentatively (parser);
10729 /* Try a class-name. */
10730 id = cp_parser_class_name (parser,
10731 /*typename_keyword_p=*/true,
10732 /*template_keyword_p=*/false,
10734 /*check_dependency_p=*/true,
10735 /*class_head_p=*/false,
10736 /*is_declaration=*/true);
10737 /* If we found one, we're done. */
10738 if (cp_parser_parse_definitely (parser))
10740 /* Otherwise, look for an ordinary identifier. */
10741 return cp_parser_identifier (parser);
10744 /* Overloading [gram.over] */
10746 /* Parse an operator-function-id.
10748 operator-function-id:
10751 Returns an IDENTIFIER_NODE for the operator which is a
10752 human-readable spelling of the identifier, e.g., `operator +'. */
10755 cp_parser_operator_function_id (cp_parser* parser)
10757 /* Look for the `operator' keyword. */
10758 if (!cp_parser_require_keyword (parser, RID_OPERATOR, RT_OPERATOR))
10759 return error_mark_node;
10760 /* And then the name of the operator itself. */
10761 return cp_parser_operator (parser);
10764 /* Parse an operator.
10767 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
10768 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
10769 || ++ -- , ->* -> () []
10776 Returns an IDENTIFIER_NODE for the operator which is a
10777 human-readable spelling of the identifier, e.g., `operator +'. */
10780 cp_parser_operator (cp_parser* parser)
10782 tree id = NULL_TREE;
10785 /* Peek at the next token. */
10786 token = cp_lexer_peek_token (parser->lexer);
10787 /* Figure out which operator we have. */
10788 switch (token->type)
10794 /* The keyword should be either `new' or `delete'. */
10795 if (token->keyword == RID_NEW)
10797 else if (token->keyword == RID_DELETE)
10802 /* Consume the `new' or `delete' token. */
10803 cp_lexer_consume_token (parser->lexer);
10805 /* Peek at the next token. */
10806 token = cp_lexer_peek_token (parser->lexer);
10807 /* If it's a `[' token then this is the array variant of the
10809 if (token->type == CPP_OPEN_SQUARE)
10811 /* Consume the `[' token. */
10812 cp_lexer_consume_token (parser->lexer);
10813 /* Look for the `]' token. */
10814 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
10815 id = ansi_opname (op == NEW_EXPR
10816 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
10818 /* Otherwise, we have the non-array variant. */
10820 id = ansi_opname (op);
10826 id = ansi_opname (PLUS_EXPR);
10830 id = ansi_opname (MINUS_EXPR);
10834 id = ansi_opname (MULT_EXPR);
10838 id = ansi_opname (TRUNC_DIV_EXPR);
10842 id = ansi_opname (TRUNC_MOD_EXPR);
10846 id = ansi_opname (BIT_XOR_EXPR);
10850 id = ansi_opname (BIT_AND_EXPR);
10854 id = ansi_opname (BIT_IOR_EXPR);
10858 id = ansi_opname (BIT_NOT_EXPR);
10862 id = ansi_opname (TRUTH_NOT_EXPR);
10866 id = ansi_assopname (NOP_EXPR);
10870 id = ansi_opname (LT_EXPR);
10874 id = ansi_opname (GT_EXPR);
10878 id = ansi_assopname (PLUS_EXPR);
10882 id = ansi_assopname (MINUS_EXPR);
10886 id = ansi_assopname (MULT_EXPR);
10890 id = ansi_assopname (TRUNC_DIV_EXPR);
10894 id = ansi_assopname (TRUNC_MOD_EXPR);
10898 id = ansi_assopname (BIT_XOR_EXPR);
10902 id = ansi_assopname (BIT_AND_EXPR);
10906 id = ansi_assopname (BIT_IOR_EXPR);
10910 id = ansi_opname (LSHIFT_EXPR);
10914 id = ansi_opname (RSHIFT_EXPR);
10917 case CPP_LSHIFT_EQ:
10918 id = ansi_assopname (LSHIFT_EXPR);
10921 case CPP_RSHIFT_EQ:
10922 id = ansi_assopname (RSHIFT_EXPR);
10926 id = ansi_opname (EQ_EXPR);
10930 id = ansi_opname (NE_EXPR);
10934 id = ansi_opname (LE_EXPR);
10937 case CPP_GREATER_EQ:
10938 id = ansi_opname (GE_EXPR);
10942 id = ansi_opname (TRUTH_ANDIF_EXPR);
10946 id = ansi_opname (TRUTH_ORIF_EXPR);
10949 case CPP_PLUS_PLUS:
10950 id = ansi_opname (POSTINCREMENT_EXPR);
10953 case CPP_MINUS_MINUS:
10954 id = ansi_opname (PREDECREMENT_EXPR);
10958 id = ansi_opname (COMPOUND_EXPR);
10961 case CPP_DEREF_STAR:
10962 id = ansi_opname (MEMBER_REF);
10966 id = ansi_opname (COMPONENT_REF);
10969 case CPP_OPEN_PAREN:
10970 /* Consume the `('. */
10971 cp_lexer_consume_token (parser->lexer);
10972 /* Look for the matching `)'. */
10973 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
10974 return ansi_opname (CALL_EXPR);
10976 case CPP_OPEN_SQUARE:
10977 /* Consume the `['. */
10978 cp_lexer_consume_token (parser->lexer);
10979 /* Look for the matching `]'. */
10980 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
10981 return ansi_opname (ARRAY_REF);
10984 /* Anything else is an error. */
10988 /* If we have selected an identifier, we need to consume the
10991 cp_lexer_consume_token (parser->lexer);
10992 /* Otherwise, no valid operator name was present. */
10995 cp_parser_error (parser, "expected operator");
10996 id = error_mark_node;
11002 /* Parse a template-declaration.
11004 template-declaration:
11005 export [opt] template < template-parameter-list > declaration
11007 If MEMBER_P is TRUE, this template-declaration occurs within a
11010 The grammar rule given by the standard isn't correct. What
11011 is really meant is:
11013 template-declaration:
11014 export [opt] template-parameter-list-seq
11015 decl-specifier-seq [opt] init-declarator [opt] ;
11016 export [opt] template-parameter-list-seq
11017 function-definition
11019 template-parameter-list-seq:
11020 template-parameter-list-seq [opt]
11021 template < template-parameter-list > */
11024 cp_parser_template_declaration (cp_parser* parser, bool member_p)
11026 /* Check for `export'. */
11027 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
11029 /* Consume the `export' token. */
11030 cp_lexer_consume_token (parser->lexer);
11031 /* Warn that we do not support `export'. */
11032 warning (0, "keyword %<export%> not implemented, and will be ignored");
11035 cp_parser_template_declaration_after_export (parser, member_p);
11038 /* Parse a template-parameter-list.
11040 template-parameter-list:
11042 template-parameter-list , template-parameter
11044 Returns a TREE_LIST. Each node represents a template parameter.
11045 The nodes are connected via their TREE_CHAINs. */
11048 cp_parser_template_parameter_list (cp_parser* parser)
11050 tree parameter_list = NULL_TREE;
11052 begin_template_parm_list ();
11054 /* The loop below parses the template parms. We first need to know
11055 the total number of template parms to be able to compute proper
11056 canonical types of each dependent type. So after the loop, when
11057 we know the total number of template parms,
11058 end_template_parm_list computes the proper canonical types and
11059 fixes up the dependent types accordingly. */
11064 bool is_parameter_pack;
11065 location_t parm_loc;
11067 /* Parse the template-parameter. */
11068 parm_loc = cp_lexer_peek_token (parser->lexer)->location;
11069 parameter = cp_parser_template_parameter (parser,
11071 &is_parameter_pack);
11072 /* Add it to the list. */
11073 if (parameter != error_mark_node)
11074 parameter_list = process_template_parm (parameter_list,
11082 tree err_parm = build_tree_list (parameter, parameter);
11083 parameter_list = chainon (parameter_list, err_parm);
11086 /* If the next token is not a `,', we're done. */
11087 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11089 /* Otherwise, consume the `,' token. */
11090 cp_lexer_consume_token (parser->lexer);
11093 return end_template_parm_list (parameter_list);
11096 /* Parse a template-parameter.
11098 template-parameter:
11100 parameter-declaration
11102 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11103 the parameter. The TREE_PURPOSE is the default value, if any.
11104 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
11105 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
11106 set to true iff this parameter is a parameter pack. */
11109 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type,
11110 bool *is_parameter_pack)
11113 cp_parameter_declarator *parameter_declarator;
11114 cp_declarator *id_declarator;
11117 /* Assume it is a type parameter or a template parameter. */
11118 *is_non_type = false;
11119 /* Assume it not a parameter pack. */
11120 *is_parameter_pack = false;
11121 /* Peek at the next token. */
11122 token = cp_lexer_peek_token (parser->lexer);
11123 /* If it is `class' or `template', we have a type-parameter. */
11124 if (token->keyword == RID_TEMPLATE)
11125 return cp_parser_type_parameter (parser, is_parameter_pack);
11126 /* If it is `class' or `typename' we do not know yet whether it is a
11127 type parameter or a non-type parameter. Consider:
11129 template <typename T, typename T::X X> ...
11133 template <class C, class D*> ...
11135 Here, the first parameter is a type parameter, and the second is
11136 a non-type parameter. We can tell by looking at the token after
11137 the identifier -- if it is a `,', `=', or `>' then we have a type
11139 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
11141 /* Peek at the token after `class' or `typename'. */
11142 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11143 /* If it's an ellipsis, we have a template type parameter
11145 if (token->type == CPP_ELLIPSIS)
11146 return cp_parser_type_parameter (parser, is_parameter_pack);
11147 /* If it's an identifier, skip it. */
11148 if (token->type == CPP_NAME)
11149 token = cp_lexer_peek_nth_token (parser->lexer, 3);
11150 /* Now, see if the token looks like the end of a template
11152 if (token->type == CPP_COMMA
11153 || token->type == CPP_EQ
11154 || token->type == CPP_GREATER)
11155 return cp_parser_type_parameter (parser, is_parameter_pack);
11158 /* Otherwise, it is a non-type parameter.
11162 When parsing a default template-argument for a non-type
11163 template-parameter, the first non-nested `>' is taken as the end
11164 of the template parameter-list rather than a greater-than
11166 *is_non_type = true;
11167 parameter_declarator
11168 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
11169 /*parenthesized_p=*/NULL);
11171 /* If the parameter declaration is marked as a parameter pack, set
11172 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
11173 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
11175 if (parameter_declarator
11176 && parameter_declarator->declarator
11177 && parameter_declarator->declarator->parameter_pack_p)
11179 *is_parameter_pack = true;
11180 parameter_declarator->declarator->parameter_pack_p = false;
11183 /* If the next token is an ellipsis, and we don't already have it
11184 marked as a parameter pack, then we have a parameter pack (that
11185 has no declarator). */
11186 if (!*is_parameter_pack
11187 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
11188 && declarator_can_be_parameter_pack (parameter_declarator->declarator))
11190 /* Consume the `...'. */
11191 cp_lexer_consume_token (parser->lexer);
11192 maybe_warn_variadic_templates ();
11194 *is_parameter_pack = true;
11196 /* We might end up with a pack expansion as the type of the non-type
11197 template parameter, in which case this is a non-type template
11199 else if (parameter_declarator
11200 && parameter_declarator->decl_specifiers.type
11201 && PACK_EXPANSION_P (parameter_declarator->decl_specifiers.type))
11203 *is_parameter_pack = true;
11204 parameter_declarator->decl_specifiers.type =
11205 PACK_EXPANSION_PATTERN (parameter_declarator->decl_specifiers.type);
11208 if (*is_parameter_pack && cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11210 /* Parameter packs cannot have default arguments. However, a
11211 user may try to do so, so we'll parse them and give an
11212 appropriate diagnostic here. */
11214 /* Consume the `='. */
11215 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
11216 cp_lexer_consume_token (parser->lexer);
11218 /* Find the name of the parameter pack. */
11219 id_declarator = parameter_declarator->declarator;
11220 while (id_declarator && id_declarator->kind != cdk_id)
11221 id_declarator = id_declarator->declarator;
11223 if (id_declarator && id_declarator->kind == cdk_id)
11224 error_at (start_token->location,
11225 "template parameter pack %qD cannot have a default argument",
11226 id_declarator->u.id.unqualified_name);
11228 error_at (start_token->location,
11229 "template parameter pack cannot have a default argument");
11231 /* Parse the default argument, but throw away the result. */
11232 cp_parser_default_argument (parser, /*template_parm_p=*/true);
11235 parm = grokdeclarator (parameter_declarator->declarator,
11236 ¶meter_declarator->decl_specifiers,
11237 TPARM, /*initialized=*/0,
11238 /*attrlist=*/NULL);
11239 if (parm == error_mark_node)
11240 return error_mark_node;
11242 return build_tree_list (parameter_declarator->default_argument, parm);
11245 /* Parse a type-parameter.
11248 class identifier [opt]
11249 class identifier [opt] = type-id
11250 typename identifier [opt]
11251 typename identifier [opt] = type-id
11252 template < template-parameter-list > class identifier [opt]
11253 template < template-parameter-list > class identifier [opt]
11256 GNU Extension (variadic templates):
11259 class ... identifier [opt]
11260 typename ... identifier [opt]
11262 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
11263 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
11264 the declaration of the parameter.
11266 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
11269 cp_parser_type_parameter (cp_parser* parser, bool *is_parameter_pack)
11274 /* Look for a keyword to tell us what kind of parameter this is. */
11275 token = cp_parser_require (parser, CPP_KEYWORD, RT_CLASS_TYPENAME_TEMPLATE);
11277 return error_mark_node;
11279 switch (token->keyword)
11285 tree default_argument;
11287 /* If the next token is an ellipsis, we have a template
11289 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11291 /* Consume the `...' token. */
11292 cp_lexer_consume_token (parser->lexer);
11293 maybe_warn_variadic_templates ();
11295 *is_parameter_pack = true;
11298 /* If the next token is an identifier, then it names the
11300 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
11301 identifier = cp_parser_identifier (parser);
11303 identifier = NULL_TREE;
11305 /* Create the parameter. */
11306 parameter = finish_template_type_parm (class_type_node, identifier);
11308 /* If the next token is an `=', we have a default argument. */
11309 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11311 /* Consume the `=' token. */
11312 cp_lexer_consume_token (parser->lexer);
11313 /* Parse the default-argument. */
11314 push_deferring_access_checks (dk_no_deferred);
11315 default_argument = cp_parser_type_id (parser);
11317 /* Template parameter packs cannot have default
11319 if (*is_parameter_pack)
11322 error_at (token->location,
11323 "template parameter pack %qD cannot have a "
11324 "default argument", identifier);
11326 error_at (token->location,
11327 "template parameter packs cannot have "
11328 "default arguments");
11329 default_argument = NULL_TREE;
11331 pop_deferring_access_checks ();
11334 default_argument = NULL_TREE;
11336 /* Create the combined representation of the parameter and the
11337 default argument. */
11338 parameter = build_tree_list (default_argument, parameter);
11345 tree default_argument;
11347 /* Look for the `<'. */
11348 cp_parser_require (parser, CPP_LESS, RT_LESS);
11349 /* Parse the template-parameter-list. */
11350 cp_parser_template_parameter_list (parser);
11351 /* Look for the `>'. */
11352 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
11353 /* Look for the `class' keyword. */
11354 cp_parser_require_keyword (parser, RID_CLASS, RT_CLASS);
11355 /* If the next token is an ellipsis, we have a template
11357 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11359 /* Consume the `...' token. */
11360 cp_lexer_consume_token (parser->lexer);
11361 maybe_warn_variadic_templates ();
11363 *is_parameter_pack = true;
11365 /* If the next token is an `=', then there is a
11366 default-argument. If the next token is a `>', we are at
11367 the end of the parameter-list. If the next token is a `,',
11368 then we are at the end of this parameter. */
11369 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
11370 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
11371 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11373 identifier = cp_parser_identifier (parser);
11374 /* Treat invalid names as if the parameter were nameless. */
11375 if (identifier == error_mark_node)
11376 identifier = NULL_TREE;
11379 identifier = NULL_TREE;
11381 /* Create the template parameter. */
11382 parameter = finish_template_template_parm (class_type_node,
11385 /* If the next token is an `=', then there is a
11386 default-argument. */
11387 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11391 /* Consume the `='. */
11392 cp_lexer_consume_token (parser->lexer);
11393 /* Parse the id-expression. */
11394 push_deferring_access_checks (dk_no_deferred);
11395 /* save token before parsing the id-expression, for error
11397 token = cp_lexer_peek_token (parser->lexer);
11399 = cp_parser_id_expression (parser,
11400 /*template_keyword_p=*/false,
11401 /*check_dependency_p=*/true,
11402 /*template_p=*/&is_template,
11403 /*declarator_p=*/false,
11404 /*optional_p=*/false);
11405 if (TREE_CODE (default_argument) == TYPE_DECL)
11406 /* If the id-expression was a template-id that refers to
11407 a template-class, we already have the declaration here,
11408 so no further lookup is needed. */
11411 /* Look up the name. */
11413 = cp_parser_lookup_name (parser, default_argument,
11415 /*is_template=*/is_template,
11416 /*is_namespace=*/false,
11417 /*check_dependency=*/true,
11418 /*ambiguous_decls=*/NULL,
11420 /* See if the default argument is valid. */
11422 = check_template_template_default_arg (default_argument);
11424 /* Template parameter packs cannot have default
11426 if (*is_parameter_pack)
11429 error_at (token->location,
11430 "template parameter pack %qD cannot "
11431 "have a default argument",
11434 error_at (token->location, "template parameter packs cannot "
11435 "have default arguments");
11436 default_argument = NULL_TREE;
11438 pop_deferring_access_checks ();
11441 default_argument = NULL_TREE;
11443 /* Create the combined representation of the parameter and the
11444 default argument. */
11445 parameter = build_tree_list (default_argument, parameter);
11450 gcc_unreachable ();
11457 /* Parse a template-id.
11460 template-name < template-argument-list [opt] >
11462 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
11463 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
11464 returned. Otherwise, if the template-name names a function, or set
11465 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
11466 names a class, returns a TYPE_DECL for the specialization.
11468 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
11469 uninstantiated templates. */
11472 cp_parser_template_id (cp_parser *parser,
11473 bool template_keyword_p,
11474 bool check_dependency_p,
11475 bool is_declaration)
11481 cp_token_position start_of_id = 0;
11482 deferred_access_check *chk;
11483 VEC (deferred_access_check,gc) *access_check;
11484 cp_token *next_token = NULL, *next_token_2 = NULL;
11485 bool is_identifier;
11487 /* If the next token corresponds to a template-id, there is no need
11489 next_token = cp_lexer_peek_token (parser->lexer);
11490 if (next_token->type == CPP_TEMPLATE_ID)
11492 struct tree_check *check_value;
11494 /* Get the stored value. */
11495 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
11496 /* Perform any access checks that were deferred. */
11497 access_check = check_value->checks;
11500 FOR_EACH_VEC_ELT (deferred_access_check, access_check, i, chk)
11501 perform_or_defer_access_check (chk->binfo,
11505 /* Return the stored value. */
11506 return check_value->value;
11509 /* Avoid performing name lookup if there is no possibility of
11510 finding a template-id. */
11511 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
11512 || (next_token->type == CPP_NAME
11513 && !cp_parser_nth_token_starts_template_argument_list_p
11516 cp_parser_error (parser, "expected template-id");
11517 return error_mark_node;
11520 /* Remember where the template-id starts. */
11521 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
11522 start_of_id = cp_lexer_token_position (parser->lexer, false);
11524 push_deferring_access_checks (dk_deferred);
11526 /* Parse the template-name. */
11527 is_identifier = false;
11528 templ = cp_parser_template_name (parser, template_keyword_p,
11529 check_dependency_p,
11532 if (templ == error_mark_node || is_identifier)
11534 pop_deferring_access_checks ();
11538 /* If we find the sequence `[:' after a template-name, it's probably
11539 a digraph-typo for `< ::'. Substitute the tokens and check if we can
11540 parse correctly the argument list. */
11541 next_token = cp_lexer_peek_token (parser->lexer);
11542 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
11543 if (next_token->type == CPP_OPEN_SQUARE
11544 && next_token->flags & DIGRAPH
11545 && next_token_2->type == CPP_COLON
11546 && !(next_token_2->flags & PREV_WHITE))
11548 cp_parser_parse_tentatively (parser);
11549 /* Change `:' into `::'. */
11550 next_token_2->type = CPP_SCOPE;
11551 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
11553 cp_lexer_consume_token (parser->lexer);
11555 /* Parse the arguments. */
11556 arguments = cp_parser_enclosed_template_argument_list (parser);
11557 if (!cp_parser_parse_definitely (parser))
11559 /* If we couldn't parse an argument list, then we revert our changes
11560 and return simply an error. Maybe this is not a template-id
11562 next_token_2->type = CPP_COLON;
11563 cp_parser_error (parser, "expected %<<%>");
11564 pop_deferring_access_checks ();
11565 return error_mark_node;
11567 /* Otherwise, emit an error about the invalid digraph, but continue
11568 parsing because we got our argument list. */
11569 if (permerror (next_token->location,
11570 "%<<::%> cannot begin a template-argument list"))
11572 static bool hint = false;
11573 inform (next_token->location,
11574 "%<<:%> is an alternate spelling for %<[%>."
11575 " Insert whitespace between %<<%> and %<::%>");
11576 if (!hint && !flag_permissive)
11578 inform (next_token->location, "(if you use %<-fpermissive%>"
11579 " G++ will accept your code)");
11586 /* Look for the `<' that starts the template-argument-list. */
11587 if (!cp_parser_require (parser, CPP_LESS, RT_LESS))
11589 pop_deferring_access_checks ();
11590 return error_mark_node;
11592 /* Parse the arguments. */
11593 arguments = cp_parser_enclosed_template_argument_list (parser);
11596 /* Build a representation of the specialization. */
11597 if (TREE_CODE (templ) == IDENTIFIER_NODE)
11598 template_id = build_min_nt (TEMPLATE_ID_EXPR, templ, arguments);
11599 else if (DECL_CLASS_TEMPLATE_P (templ)
11600 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ))
11602 bool entering_scope;
11603 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
11604 template (rather than some instantiation thereof) only if
11605 is not nested within some other construct. For example, in
11606 "template <typename T> void f(T) { A<T>::", A<T> is just an
11607 instantiation of A. */
11608 entering_scope = (template_parm_scope_p ()
11609 && cp_lexer_next_token_is (parser->lexer,
11612 = finish_template_type (templ, arguments, entering_scope);
11616 /* If it's not a class-template or a template-template, it should be
11617 a function-template. */
11618 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ)
11619 || TREE_CODE (templ) == OVERLOAD
11620 || BASELINK_P (templ)));
11622 template_id = lookup_template_function (templ, arguments);
11625 /* If parsing tentatively, replace the sequence of tokens that makes
11626 up the template-id with a CPP_TEMPLATE_ID token. That way,
11627 should we re-parse the token stream, we will not have to repeat
11628 the effort required to do the parse, nor will we issue duplicate
11629 error messages about problems during instantiation of the
11633 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
11635 /* Reset the contents of the START_OF_ID token. */
11636 token->type = CPP_TEMPLATE_ID;
11637 /* Retrieve any deferred checks. Do not pop this access checks yet
11638 so the memory will not be reclaimed during token replacing below. */
11639 token->u.tree_check_value = ggc_alloc_cleared_tree_check ();
11640 token->u.tree_check_value->value = template_id;
11641 token->u.tree_check_value->checks = get_deferred_access_checks ();
11642 token->keyword = RID_MAX;
11644 /* Purge all subsequent tokens. */
11645 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
11647 /* ??? Can we actually assume that, if template_id ==
11648 error_mark_node, we will have issued a diagnostic to the
11649 user, as opposed to simply marking the tentative parse as
11651 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
11652 error_at (token->location, "parse error in template argument list");
11655 pop_deferring_access_checks ();
11656 return template_id;
11659 /* Parse a template-name.
11664 The standard should actually say:
11668 operator-function-id
11670 A defect report has been filed about this issue.
11672 A conversion-function-id cannot be a template name because they cannot
11673 be part of a template-id. In fact, looking at this code:
11675 a.operator K<int>()
11677 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
11678 It is impossible to call a templated conversion-function-id with an
11679 explicit argument list, since the only allowed template parameter is
11680 the type to which it is converting.
11682 If TEMPLATE_KEYWORD_P is true, then we have just seen the
11683 `template' keyword, in a construction like:
11687 In that case `f' is taken to be a template-name, even though there
11688 is no way of knowing for sure.
11690 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
11691 name refers to a set of overloaded functions, at least one of which
11692 is a template, or an IDENTIFIER_NODE with the name of the template,
11693 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
11694 names are looked up inside uninstantiated templates. */
11697 cp_parser_template_name (cp_parser* parser,
11698 bool template_keyword_p,
11699 bool check_dependency_p,
11700 bool is_declaration,
11701 bool *is_identifier)
11706 cp_token *token = cp_lexer_peek_token (parser->lexer);
11708 /* If the next token is `operator', then we have either an
11709 operator-function-id or a conversion-function-id. */
11710 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
11712 /* We don't know whether we're looking at an
11713 operator-function-id or a conversion-function-id. */
11714 cp_parser_parse_tentatively (parser);
11715 /* Try an operator-function-id. */
11716 identifier = cp_parser_operator_function_id (parser);
11717 /* If that didn't work, try a conversion-function-id. */
11718 if (!cp_parser_parse_definitely (parser))
11720 cp_parser_error (parser, "expected template-name");
11721 return error_mark_node;
11724 /* Look for the identifier. */
11726 identifier = cp_parser_identifier (parser);
11728 /* If we didn't find an identifier, we don't have a template-id. */
11729 if (identifier == error_mark_node)
11730 return error_mark_node;
11732 /* If the name immediately followed the `template' keyword, then it
11733 is a template-name. However, if the next token is not `<', then
11734 we do not treat it as a template-name, since it is not being used
11735 as part of a template-id. This enables us to handle constructs
11738 template <typename T> struct S { S(); };
11739 template <typename T> S<T>::S();
11741 correctly. We would treat `S' as a template -- if it were `S<T>'
11742 -- but we do not if there is no `<'. */
11744 if (processing_template_decl
11745 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
11747 /* In a declaration, in a dependent context, we pretend that the
11748 "template" keyword was present in order to improve error
11749 recovery. For example, given:
11751 template <typename T> void f(T::X<int>);
11753 we want to treat "X<int>" as a template-id. */
11755 && !template_keyword_p
11756 && parser->scope && TYPE_P (parser->scope)
11757 && check_dependency_p
11758 && dependent_scope_p (parser->scope)
11759 /* Do not do this for dtors (or ctors), since they never
11760 need the template keyword before their name. */
11761 && !constructor_name_p (identifier, parser->scope))
11763 cp_token_position start = 0;
11765 /* Explain what went wrong. */
11766 error_at (token->location, "non-template %qD used as template",
11768 inform (token->location, "use %<%T::template %D%> to indicate that it is a template",
11769 parser->scope, identifier);
11770 /* If parsing tentatively, find the location of the "<" token. */
11771 if (cp_parser_simulate_error (parser))
11772 start = cp_lexer_token_position (parser->lexer, true);
11773 /* Parse the template arguments so that we can issue error
11774 messages about them. */
11775 cp_lexer_consume_token (parser->lexer);
11776 cp_parser_enclosed_template_argument_list (parser);
11777 /* Skip tokens until we find a good place from which to
11778 continue parsing. */
11779 cp_parser_skip_to_closing_parenthesis (parser,
11780 /*recovering=*/true,
11782 /*consume_paren=*/false);
11783 /* If parsing tentatively, permanently remove the
11784 template argument list. That will prevent duplicate
11785 error messages from being issued about the missing
11786 "template" keyword. */
11788 cp_lexer_purge_tokens_after (parser->lexer, start);
11790 *is_identifier = true;
11794 /* If the "template" keyword is present, then there is generally
11795 no point in doing name-lookup, so we just return IDENTIFIER.
11796 But, if the qualifying scope is non-dependent then we can
11797 (and must) do name-lookup normally. */
11798 if (template_keyword_p
11800 || (TYPE_P (parser->scope)
11801 && dependent_type_p (parser->scope))))
11805 /* Look up the name. */
11806 decl = cp_parser_lookup_name (parser, identifier,
11808 /*is_template=*/true,
11809 /*is_namespace=*/false,
11810 check_dependency_p,
11811 /*ambiguous_decls=*/NULL,
11814 /* If DECL is a template, then the name was a template-name. */
11815 if (TREE_CODE (decl) == TEMPLATE_DECL)
11819 tree fn = NULL_TREE;
11821 /* The standard does not explicitly indicate whether a name that
11822 names a set of overloaded declarations, some of which are
11823 templates, is a template-name. However, such a name should
11824 be a template-name; otherwise, there is no way to form a
11825 template-id for the overloaded templates. */
11826 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
11827 if (TREE_CODE (fns) == OVERLOAD)
11828 for (fn = fns; fn; fn = OVL_NEXT (fn))
11829 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
11834 /* The name does not name a template. */
11835 cp_parser_error (parser, "expected template-name");
11836 return error_mark_node;
11840 /* If DECL is dependent, and refers to a function, then just return
11841 its name; we will look it up again during template instantiation. */
11842 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
11844 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
11845 if (TYPE_P (scope) && dependent_type_p (scope))
11852 /* Parse a template-argument-list.
11854 template-argument-list:
11855 template-argument ... [opt]
11856 template-argument-list , template-argument ... [opt]
11858 Returns a TREE_VEC containing the arguments. */
11861 cp_parser_template_argument_list (cp_parser* parser)
11863 tree fixed_args[10];
11864 unsigned n_args = 0;
11865 unsigned alloced = 10;
11866 tree *arg_ary = fixed_args;
11868 bool saved_in_template_argument_list_p;
11870 bool saved_non_ice_p;
11872 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
11873 parser->in_template_argument_list_p = true;
11874 /* Even if the template-id appears in an integral
11875 constant-expression, the contents of the argument list do
11877 saved_ice_p = parser->integral_constant_expression_p;
11878 parser->integral_constant_expression_p = false;
11879 saved_non_ice_p = parser->non_integral_constant_expression_p;
11880 parser->non_integral_constant_expression_p = false;
11881 /* Parse the arguments. */
11887 /* Consume the comma. */
11888 cp_lexer_consume_token (parser->lexer);
11890 /* Parse the template-argument. */
11891 argument = cp_parser_template_argument (parser);
11893 /* If the next token is an ellipsis, we're expanding a template
11895 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11897 if (argument == error_mark_node)
11899 cp_token *token = cp_lexer_peek_token (parser->lexer);
11900 error_at (token->location,
11901 "expected parameter pack before %<...%>");
11903 /* Consume the `...' token. */
11904 cp_lexer_consume_token (parser->lexer);
11906 /* Make the argument into a TYPE_PACK_EXPANSION or
11907 EXPR_PACK_EXPANSION. */
11908 argument = make_pack_expansion (argument);
11911 if (n_args == alloced)
11915 if (arg_ary == fixed_args)
11917 arg_ary = XNEWVEC (tree, alloced);
11918 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
11921 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
11923 arg_ary[n_args++] = argument;
11925 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
11927 vec = make_tree_vec (n_args);
11930 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
11932 if (arg_ary != fixed_args)
11934 parser->non_integral_constant_expression_p = saved_non_ice_p;
11935 parser->integral_constant_expression_p = saved_ice_p;
11936 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
11937 #ifdef ENABLE_CHECKING
11938 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec, TREE_VEC_LENGTH (vec));
11943 /* Parse a template-argument.
11946 assignment-expression
11950 The representation is that of an assignment-expression, type-id, or
11951 id-expression -- except that the qualified id-expression is
11952 evaluated, so that the value returned is either a DECL or an
11955 Although the standard says "assignment-expression", it forbids
11956 throw-expressions or assignments in the template argument.
11957 Therefore, we use "conditional-expression" instead. */
11960 cp_parser_template_argument (cp_parser* parser)
11965 bool maybe_type_id = false;
11966 cp_token *token = NULL, *argument_start_token = NULL;
11969 /* There's really no way to know what we're looking at, so we just
11970 try each alternative in order.
11974 In a template-argument, an ambiguity between a type-id and an
11975 expression is resolved to a type-id, regardless of the form of
11976 the corresponding template-parameter.
11978 Therefore, we try a type-id first. */
11979 cp_parser_parse_tentatively (parser);
11980 argument = cp_parser_template_type_arg (parser);
11981 /* If there was no error parsing the type-id but the next token is a
11982 '>>', our behavior depends on which dialect of C++ we're
11983 parsing. In C++98, we probably found a typo for '> >'. But there
11984 are type-id which are also valid expressions. For instance:
11986 struct X { int operator >> (int); };
11987 template <int V> struct Foo {};
11990 Here 'X()' is a valid type-id of a function type, but the user just
11991 wanted to write the expression "X() >> 5". Thus, we remember that we
11992 found a valid type-id, but we still try to parse the argument as an
11993 expression to see what happens.
11995 In C++0x, the '>>' will be considered two separate '>'
11997 if (!cp_parser_error_occurred (parser)
11998 && cxx_dialect == cxx98
11999 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
12001 maybe_type_id = true;
12002 cp_parser_abort_tentative_parse (parser);
12006 /* If the next token isn't a `,' or a `>', then this argument wasn't
12007 really finished. This means that the argument is not a valid
12009 if (!cp_parser_next_token_ends_template_argument_p (parser))
12010 cp_parser_error (parser, "expected template-argument");
12011 /* If that worked, we're done. */
12012 if (cp_parser_parse_definitely (parser))
12015 /* We're still not sure what the argument will be. */
12016 cp_parser_parse_tentatively (parser);
12017 /* Try a template. */
12018 argument_start_token = cp_lexer_peek_token (parser->lexer);
12019 argument = cp_parser_id_expression (parser,
12020 /*template_keyword_p=*/false,
12021 /*check_dependency_p=*/true,
12023 /*declarator_p=*/false,
12024 /*optional_p=*/false);
12025 /* If the next token isn't a `,' or a `>', then this argument wasn't
12026 really finished. */
12027 if (!cp_parser_next_token_ends_template_argument_p (parser))
12028 cp_parser_error (parser, "expected template-argument");
12029 if (!cp_parser_error_occurred (parser))
12031 /* Figure out what is being referred to. If the id-expression
12032 was for a class template specialization, then we will have a
12033 TYPE_DECL at this point. There is no need to do name lookup
12034 at this point in that case. */
12035 if (TREE_CODE (argument) != TYPE_DECL)
12036 argument = cp_parser_lookup_name (parser, argument,
12038 /*is_template=*/template_p,
12039 /*is_namespace=*/false,
12040 /*check_dependency=*/true,
12041 /*ambiguous_decls=*/NULL,
12042 argument_start_token->location);
12043 if (TREE_CODE (argument) != TEMPLATE_DECL
12044 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
12045 cp_parser_error (parser, "expected template-name");
12047 if (cp_parser_parse_definitely (parser))
12049 /* It must be a non-type argument. There permitted cases are given
12050 in [temp.arg.nontype]:
12052 -- an integral constant-expression of integral or enumeration
12055 -- the name of a non-type template-parameter; or
12057 -- the name of an object or function with external linkage...
12059 -- the address of an object or function with external linkage...
12061 -- a pointer to member... */
12062 /* Look for a non-type template parameter. */
12063 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12065 cp_parser_parse_tentatively (parser);
12066 argument = cp_parser_primary_expression (parser,
12067 /*address_p=*/false,
12069 /*template_arg_p=*/true,
12071 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
12072 || !cp_parser_next_token_ends_template_argument_p (parser))
12073 cp_parser_simulate_error (parser);
12074 if (cp_parser_parse_definitely (parser))
12078 /* If the next token is "&", the argument must be the address of an
12079 object or function with external linkage. */
12080 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
12082 cp_lexer_consume_token (parser->lexer);
12083 /* See if we might have an id-expression. */
12084 token = cp_lexer_peek_token (parser->lexer);
12085 if (token->type == CPP_NAME
12086 || token->keyword == RID_OPERATOR
12087 || token->type == CPP_SCOPE
12088 || token->type == CPP_TEMPLATE_ID
12089 || token->type == CPP_NESTED_NAME_SPECIFIER)
12091 cp_parser_parse_tentatively (parser);
12092 argument = cp_parser_primary_expression (parser,
12095 /*template_arg_p=*/true,
12097 if (cp_parser_error_occurred (parser)
12098 || !cp_parser_next_token_ends_template_argument_p (parser))
12099 cp_parser_abort_tentative_parse (parser);
12104 if (TREE_CODE (argument) == INDIRECT_REF)
12106 gcc_assert (REFERENCE_REF_P (argument));
12107 argument = TREE_OPERAND (argument, 0);
12110 /* If we're in a template, we represent a qualified-id referring
12111 to a static data member as a SCOPE_REF even if the scope isn't
12112 dependent so that we can check access control later. */
12114 if (TREE_CODE (probe) == SCOPE_REF)
12115 probe = TREE_OPERAND (probe, 1);
12116 if (TREE_CODE (probe) == VAR_DECL)
12118 /* A variable without external linkage might still be a
12119 valid constant-expression, so no error is issued here
12120 if the external-linkage check fails. */
12121 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (probe))
12122 cp_parser_simulate_error (parser);
12124 else if (is_overloaded_fn (argument))
12125 /* All overloaded functions are allowed; if the external
12126 linkage test does not pass, an error will be issued
12130 && (TREE_CODE (argument) == OFFSET_REF
12131 || TREE_CODE (argument) == SCOPE_REF))
12132 /* A pointer-to-member. */
12134 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
12137 cp_parser_simulate_error (parser);
12139 if (cp_parser_parse_definitely (parser))
12142 argument = build_x_unary_op (ADDR_EXPR, argument,
12143 tf_warning_or_error);
12148 /* If the argument started with "&", there are no other valid
12149 alternatives at this point. */
12152 cp_parser_error (parser, "invalid non-type template argument");
12153 return error_mark_node;
12156 /* If the argument wasn't successfully parsed as a type-id followed
12157 by '>>', the argument can only be a constant expression now.
12158 Otherwise, we try parsing the constant-expression tentatively,
12159 because the argument could really be a type-id. */
12161 cp_parser_parse_tentatively (parser);
12162 argument = cp_parser_constant_expression (parser,
12163 /*allow_non_constant_p=*/false,
12164 /*non_constant_p=*/NULL);
12165 argument = fold_non_dependent_expr (argument);
12166 if (!maybe_type_id)
12168 if (!cp_parser_next_token_ends_template_argument_p (parser))
12169 cp_parser_error (parser, "expected template-argument");
12170 if (cp_parser_parse_definitely (parser))
12172 /* We did our best to parse the argument as a non type-id, but that
12173 was the only alternative that matched (albeit with a '>' after
12174 it). We can assume it's just a typo from the user, and a
12175 diagnostic will then be issued. */
12176 return cp_parser_template_type_arg (parser);
12179 /* Parse an explicit-instantiation.
12181 explicit-instantiation:
12182 template declaration
12184 Although the standard says `declaration', what it really means is:
12186 explicit-instantiation:
12187 template decl-specifier-seq [opt] declarator [opt] ;
12189 Things like `template int S<int>::i = 5, int S<double>::j;' are not
12190 supposed to be allowed. A defect report has been filed about this
12195 explicit-instantiation:
12196 storage-class-specifier template
12197 decl-specifier-seq [opt] declarator [opt] ;
12198 function-specifier template
12199 decl-specifier-seq [opt] declarator [opt] ; */
12202 cp_parser_explicit_instantiation (cp_parser* parser)
12204 int declares_class_or_enum;
12205 cp_decl_specifier_seq decl_specifiers;
12206 tree extension_specifier = NULL_TREE;
12208 timevar_push (TV_TEMPLATE_INST);
12210 /* Look for an (optional) storage-class-specifier or
12211 function-specifier. */
12212 if (cp_parser_allow_gnu_extensions_p (parser))
12214 extension_specifier
12215 = cp_parser_storage_class_specifier_opt (parser);
12216 if (!extension_specifier)
12217 extension_specifier
12218 = cp_parser_function_specifier_opt (parser,
12219 /*decl_specs=*/NULL);
12222 /* Look for the `template' keyword. */
12223 cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE);
12224 /* Let the front end know that we are processing an explicit
12226 begin_explicit_instantiation ();
12227 /* [temp.explicit] says that we are supposed to ignore access
12228 control while processing explicit instantiation directives. */
12229 push_deferring_access_checks (dk_no_check);
12230 /* Parse a decl-specifier-seq. */
12231 cp_parser_decl_specifier_seq (parser,
12232 CP_PARSER_FLAGS_OPTIONAL,
12234 &declares_class_or_enum);
12235 /* If there was exactly one decl-specifier, and it declared a class,
12236 and there's no declarator, then we have an explicit type
12238 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
12242 type = check_tag_decl (&decl_specifiers);
12243 /* Turn access control back on for names used during
12244 template instantiation. */
12245 pop_deferring_access_checks ();
12247 do_type_instantiation (type, extension_specifier,
12248 /*complain=*/tf_error);
12252 cp_declarator *declarator;
12255 /* Parse the declarator. */
12257 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
12258 /*ctor_dtor_or_conv_p=*/NULL,
12259 /*parenthesized_p=*/NULL,
12260 /*member_p=*/false);
12261 if (declares_class_or_enum & 2)
12262 cp_parser_check_for_definition_in_return_type (declarator,
12263 decl_specifiers.type,
12264 decl_specifiers.type_location);
12265 if (declarator != cp_error_declarator)
12267 if (decl_specifiers.specs[(int)ds_inline])
12268 permerror (input_location, "explicit instantiation shall not use"
12269 " %<inline%> specifier");
12270 if (decl_specifiers.specs[(int)ds_constexpr])
12271 permerror (input_location, "explicit instantiation shall not use"
12272 " %<constexpr%> specifier");
12274 decl = grokdeclarator (declarator, &decl_specifiers,
12275 NORMAL, 0, &decl_specifiers.attributes);
12276 /* Turn access control back on for names used during
12277 template instantiation. */
12278 pop_deferring_access_checks ();
12279 /* Do the explicit instantiation. */
12280 do_decl_instantiation (decl, extension_specifier);
12284 pop_deferring_access_checks ();
12285 /* Skip the body of the explicit instantiation. */
12286 cp_parser_skip_to_end_of_statement (parser);
12289 /* We're done with the instantiation. */
12290 end_explicit_instantiation ();
12292 cp_parser_consume_semicolon_at_end_of_statement (parser);
12294 timevar_pop (TV_TEMPLATE_INST);
12297 /* Parse an explicit-specialization.
12299 explicit-specialization:
12300 template < > declaration
12302 Although the standard says `declaration', what it really means is:
12304 explicit-specialization:
12305 template <> decl-specifier [opt] init-declarator [opt] ;
12306 template <> function-definition
12307 template <> explicit-specialization
12308 template <> template-declaration */
12311 cp_parser_explicit_specialization (cp_parser* parser)
12313 bool need_lang_pop;
12314 cp_token *token = cp_lexer_peek_token (parser->lexer);
12316 /* Look for the `template' keyword. */
12317 cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE);
12318 /* Look for the `<'. */
12319 cp_parser_require (parser, CPP_LESS, RT_LESS);
12320 /* Look for the `>'. */
12321 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
12322 /* We have processed another parameter list. */
12323 ++parser->num_template_parameter_lists;
12326 A template ... explicit specialization ... shall not have C
12328 if (current_lang_name == lang_name_c)
12330 error_at (token->location, "template specialization with C linkage");
12331 /* Give it C++ linkage to avoid confusing other parts of the
12333 push_lang_context (lang_name_cplusplus);
12334 need_lang_pop = true;
12337 need_lang_pop = false;
12338 /* Let the front end know that we are beginning a specialization. */
12339 if (!begin_specialization ())
12341 end_specialization ();
12345 /* If the next keyword is `template', we need to figure out whether
12346 or not we're looking a template-declaration. */
12347 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
12349 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
12350 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
12351 cp_parser_template_declaration_after_export (parser,
12352 /*member_p=*/false);
12354 cp_parser_explicit_specialization (parser);
12357 /* Parse the dependent declaration. */
12358 cp_parser_single_declaration (parser,
12360 /*member_p=*/false,
12361 /*explicit_specialization_p=*/true,
12362 /*friend_p=*/NULL);
12363 /* We're done with the specialization. */
12364 end_specialization ();
12365 /* For the erroneous case of a template with C linkage, we pushed an
12366 implicit C++ linkage scope; exit that scope now. */
12368 pop_lang_context ();
12369 /* We're done with this parameter list. */
12370 --parser->num_template_parameter_lists;
12373 /* Parse a type-specifier.
12376 simple-type-specifier
12379 elaborated-type-specifier
12387 Returns a representation of the type-specifier. For a
12388 class-specifier, enum-specifier, or elaborated-type-specifier, a
12389 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
12391 The parser flags FLAGS is used to control type-specifier parsing.
12393 If IS_DECLARATION is TRUE, then this type-specifier is appearing
12394 in a decl-specifier-seq.
12396 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
12397 class-specifier, enum-specifier, or elaborated-type-specifier, then
12398 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
12399 if a type is declared; 2 if it is defined. Otherwise, it is set to
12402 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
12403 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
12404 is set to FALSE. */
12407 cp_parser_type_specifier (cp_parser* parser,
12408 cp_parser_flags flags,
12409 cp_decl_specifier_seq *decl_specs,
12410 bool is_declaration,
12411 int* declares_class_or_enum,
12412 bool* is_cv_qualifier)
12414 tree type_spec = NULL_TREE;
12417 cp_decl_spec ds = ds_last;
12419 /* Assume this type-specifier does not declare a new type. */
12420 if (declares_class_or_enum)
12421 *declares_class_or_enum = 0;
12422 /* And that it does not specify a cv-qualifier. */
12423 if (is_cv_qualifier)
12424 *is_cv_qualifier = false;
12425 /* Peek at the next token. */
12426 token = cp_lexer_peek_token (parser->lexer);
12428 /* If we're looking at a keyword, we can use that to guide the
12429 production we choose. */
12430 keyword = token->keyword;
12434 if ((flags & CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS))
12435 goto elaborated_type_specifier;
12437 /* Look for the enum-specifier. */
12438 type_spec = cp_parser_enum_specifier (parser);
12439 /* If that worked, we're done. */
12442 if (declares_class_or_enum)
12443 *declares_class_or_enum = 2;
12445 cp_parser_set_decl_spec_type (decl_specs,
12448 /*user_defined_p=*/true);
12452 goto elaborated_type_specifier;
12454 /* Any of these indicate either a class-specifier, or an
12455 elaborated-type-specifier. */
12459 if ((flags & CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS))
12460 goto elaborated_type_specifier;
12462 /* Parse tentatively so that we can back up if we don't find a
12463 class-specifier. */
12464 cp_parser_parse_tentatively (parser);
12465 /* Look for the class-specifier. */
12466 type_spec = cp_parser_class_specifier (parser);
12467 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE, type_spec);
12468 /* If that worked, we're done. */
12469 if (cp_parser_parse_definitely (parser))
12471 if (declares_class_or_enum)
12472 *declares_class_or_enum = 2;
12474 cp_parser_set_decl_spec_type (decl_specs,
12477 /*user_defined_p=*/true);
12481 /* Fall through. */
12482 elaborated_type_specifier:
12483 /* We're declaring (not defining) a class or enum. */
12484 if (declares_class_or_enum)
12485 *declares_class_or_enum = 1;
12487 /* Fall through. */
12489 /* Look for an elaborated-type-specifier. */
12491 = (cp_parser_elaborated_type_specifier
12493 decl_specs && decl_specs->specs[(int) ds_friend],
12496 cp_parser_set_decl_spec_type (decl_specs,
12499 /*user_defined_p=*/true);
12504 if (is_cv_qualifier)
12505 *is_cv_qualifier = true;
12510 if (is_cv_qualifier)
12511 *is_cv_qualifier = true;
12516 if (is_cv_qualifier)
12517 *is_cv_qualifier = true;
12521 /* The `__complex__' keyword is a GNU extension. */
12529 /* Handle simple keywords. */
12534 ++decl_specs->specs[(int)ds];
12535 decl_specs->any_specifiers_p = true;
12537 return cp_lexer_consume_token (parser->lexer)->u.value;
12540 /* If we do not already have a type-specifier, assume we are looking
12541 at a simple-type-specifier. */
12542 type_spec = cp_parser_simple_type_specifier (parser,
12546 /* If we didn't find a type-specifier, and a type-specifier was not
12547 optional in this context, issue an error message. */
12548 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
12550 cp_parser_error (parser, "expected type specifier");
12551 return error_mark_node;
12557 /* Parse a simple-type-specifier.
12559 simple-type-specifier:
12560 :: [opt] nested-name-specifier [opt] type-name
12561 :: [opt] nested-name-specifier template template-id
12576 simple-type-specifier:
12578 decltype ( expression )
12581 __underlying_type ( type-id )
12585 simple-type-specifier:
12587 __typeof__ unary-expression
12588 __typeof__ ( type-id )
12590 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
12591 appropriately updated. */
12594 cp_parser_simple_type_specifier (cp_parser* parser,
12595 cp_decl_specifier_seq *decl_specs,
12596 cp_parser_flags flags)
12598 tree type = NULL_TREE;
12601 /* Peek at the next token. */
12602 token = cp_lexer_peek_token (parser->lexer);
12604 /* If we're looking at a keyword, things are easy. */
12605 switch (token->keyword)
12609 decl_specs->explicit_char_p = true;
12610 type = char_type_node;
12613 type = char16_type_node;
12616 type = char32_type_node;
12619 type = wchar_type_node;
12622 type = boolean_type_node;
12626 ++decl_specs->specs[(int) ds_short];
12627 type = short_integer_type_node;
12631 decl_specs->explicit_int_p = true;
12632 type = integer_type_node;
12635 if (!int128_integer_type_node)
12638 decl_specs->explicit_int128_p = true;
12639 type = int128_integer_type_node;
12643 ++decl_specs->specs[(int) ds_long];
12644 type = long_integer_type_node;
12648 ++decl_specs->specs[(int) ds_signed];
12649 type = integer_type_node;
12653 ++decl_specs->specs[(int) ds_unsigned];
12654 type = unsigned_type_node;
12657 type = float_type_node;
12660 type = double_type_node;
12663 type = void_type_node;
12667 maybe_warn_cpp0x (CPP0X_AUTO);
12668 type = make_auto ();
12672 /* Parse the `decltype' type. */
12673 type = cp_parser_decltype (parser);
12676 cp_parser_set_decl_spec_type (decl_specs, type,
12678 /*user_defined_p=*/true);
12683 /* Consume the `typeof' token. */
12684 cp_lexer_consume_token (parser->lexer);
12685 /* Parse the operand to `typeof'. */
12686 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
12687 /* If it is not already a TYPE, take its type. */
12688 if (!TYPE_P (type))
12689 type = finish_typeof (type);
12692 cp_parser_set_decl_spec_type (decl_specs, type,
12694 /*user_defined_p=*/true);
12698 case RID_UNDERLYING_TYPE:
12699 type = cp_parser_trait_expr (parser, RID_UNDERLYING_TYPE);
12702 cp_parser_set_decl_spec_type (decl_specs, type,
12704 /*user_defined_p=*/true);
12712 /* If the type-specifier was for a built-in type, we're done. */
12715 /* Record the type. */
12717 && (token->keyword != RID_SIGNED
12718 && token->keyword != RID_UNSIGNED
12719 && token->keyword != RID_SHORT
12720 && token->keyword != RID_LONG))
12721 cp_parser_set_decl_spec_type (decl_specs,
12724 /*user_defined=*/false);
12726 decl_specs->any_specifiers_p = true;
12728 /* Consume the token. */
12729 cp_lexer_consume_token (parser->lexer);
12731 /* There is no valid C++ program where a non-template type is
12732 followed by a "<". That usually indicates that the user thought
12733 that the type was a template. */
12734 cp_parser_check_for_invalid_template_id (parser, type, token->location);
12736 return TYPE_NAME (type);
12739 /* The type-specifier must be a user-defined type. */
12740 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
12745 /* Don't gobble tokens or issue error messages if this is an
12746 optional type-specifier. */
12747 if (flags & CP_PARSER_FLAGS_OPTIONAL)
12748 cp_parser_parse_tentatively (parser);
12750 /* Look for the optional `::' operator. */
12752 = (cp_parser_global_scope_opt (parser,
12753 /*current_scope_valid_p=*/false)
12755 /* Look for the nested-name specifier. */
12757 = (cp_parser_nested_name_specifier_opt (parser,
12758 /*typename_keyword_p=*/false,
12759 /*check_dependency_p=*/true,
12761 /*is_declaration=*/false)
12763 token = cp_lexer_peek_token (parser->lexer);
12764 /* If we have seen a nested-name-specifier, and the next token
12765 is `template', then we are using the template-id production. */
12767 && cp_parser_optional_template_keyword (parser))
12769 /* Look for the template-id. */
12770 type = cp_parser_template_id (parser,
12771 /*template_keyword_p=*/true,
12772 /*check_dependency_p=*/true,
12773 /*is_declaration=*/false);
12774 /* If the template-id did not name a type, we are out of
12776 if (TREE_CODE (type) != TYPE_DECL)
12778 cp_parser_error (parser, "expected template-id for type");
12782 /* Otherwise, look for a type-name. */
12784 type = cp_parser_type_name (parser);
12785 /* Keep track of all name-lookups performed in class scopes. */
12789 && TREE_CODE (type) == TYPE_DECL
12790 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
12791 maybe_note_name_used_in_class (DECL_NAME (type), type);
12792 /* If it didn't work out, we don't have a TYPE. */
12793 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
12794 && !cp_parser_parse_definitely (parser))
12796 if (type && decl_specs)
12797 cp_parser_set_decl_spec_type (decl_specs, type,
12799 /*user_defined=*/true);
12802 /* If we didn't get a type-name, issue an error message. */
12803 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
12805 cp_parser_error (parser, "expected type-name");
12806 return error_mark_node;
12809 if (type && type != error_mark_node)
12811 /* See if TYPE is an Objective-C type, and if so, parse and
12812 accept any protocol references following it. Do this before
12813 the cp_parser_check_for_invalid_template_id() call, because
12814 Objective-C types can be followed by '<...>' which would
12815 enclose protocol names rather than template arguments, and so
12816 everything is fine. */
12817 if (c_dialect_objc () && !parser->scope
12818 && (objc_is_id (type) || objc_is_class_name (type)))
12820 tree protos = cp_parser_objc_protocol_refs_opt (parser);
12821 tree qual_type = objc_get_protocol_qualified_type (type, protos);
12823 /* Clobber the "unqualified" type previously entered into
12824 DECL_SPECS with the new, improved protocol-qualified version. */
12826 decl_specs->type = qual_type;
12831 /* There is no valid C++ program where a non-template type is
12832 followed by a "<". That usually indicates that the user
12833 thought that the type was a template. */
12834 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type),
12841 /* Parse a type-name.
12854 Returns a TYPE_DECL for the type. */
12857 cp_parser_type_name (cp_parser* parser)
12861 /* We can't know yet whether it is a class-name or not. */
12862 cp_parser_parse_tentatively (parser);
12863 /* Try a class-name. */
12864 type_decl = cp_parser_class_name (parser,
12865 /*typename_keyword_p=*/false,
12866 /*template_keyword_p=*/false,
12868 /*check_dependency_p=*/true,
12869 /*class_head_p=*/false,
12870 /*is_declaration=*/false);
12871 /* If it's not a class-name, keep looking. */
12872 if (!cp_parser_parse_definitely (parser))
12874 /* It must be a typedef-name or an enum-name. */
12875 return cp_parser_nonclass_name (parser);
12881 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
12889 Returns a TYPE_DECL for the type. */
12892 cp_parser_nonclass_name (cp_parser* parser)
12897 cp_token *token = cp_lexer_peek_token (parser->lexer);
12898 identifier = cp_parser_identifier (parser);
12899 if (identifier == error_mark_node)
12900 return error_mark_node;
12902 /* Look up the type-name. */
12903 type_decl = cp_parser_lookup_name_simple (parser, identifier, token->location);
12905 if (TREE_CODE (type_decl) != TYPE_DECL
12906 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
12908 /* See if this is an Objective-C type. */
12909 tree protos = cp_parser_objc_protocol_refs_opt (parser);
12910 tree type = objc_get_protocol_qualified_type (identifier, protos);
12912 type_decl = TYPE_NAME (type);
12915 /* Issue an error if we did not find a type-name. */
12916 if (TREE_CODE (type_decl) != TYPE_DECL
12917 /* In Objective-C, we have the complication that class names are
12918 normally type names and start declarations (eg, the
12919 "NSObject" in "NSObject *object;"), but can be used in an
12920 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
12921 is an expression. So, a classname followed by a dot is not a
12922 valid type-name. */
12923 || (objc_is_class_name (TREE_TYPE (type_decl))
12924 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT))
12926 if (!cp_parser_simulate_error (parser))
12927 cp_parser_name_lookup_error (parser, identifier, type_decl,
12928 NLE_TYPE, token->location);
12929 return error_mark_node;
12931 /* Remember that the name was used in the definition of the
12932 current class so that we can check later to see if the
12933 meaning would have been different after the class was
12934 entirely defined. */
12935 else if (type_decl != error_mark_node
12937 maybe_note_name_used_in_class (identifier, type_decl);
12942 /* Parse an elaborated-type-specifier. Note that the grammar given
12943 here incorporates the resolution to DR68.
12945 elaborated-type-specifier:
12946 class-key :: [opt] nested-name-specifier [opt] identifier
12947 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
12948 enum-key :: [opt] nested-name-specifier [opt] identifier
12949 typename :: [opt] nested-name-specifier identifier
12950 typename :: [opt] nested-name-specifier template [opt]
12955 elaborated-type-specifier:
12956 class-key attributes :: [opt] nested-name-specifier [opt] identifier
12957 class-key attributes :: [opt] nested-name-specifier [opt]
12958 template [opt] template-id
12959 enum attributes :: [opt] nested-name-specifier [opt] identifier
12961 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
12962 declared `friend'. If IS_DECLARATION is TRUE, then this
12963 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
12964 something is being declared.
12966 Returns the TYPE specified. */
12969 cp_parser_elaborated_type_specifier (cp_parser* parser,
12971 bool is_declaration)
12973 enum tag_types tag_type;
12975 tree type = NULL_TREE;
12976 tree attributes = NULL_TREE;
12978 cp_token *token = NULL;
12980 /* See if we're looking at the `enum' keyword. */
12981 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
12983 /* Consume the `enum' token. */
12984 cp_lexer_consume_token (parser->lexer);
12985 /* Remember that it's an enumeration type. */
12986 tag_type = enum_type;
12987 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
12988 enums) is used here. */
12989 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
12990 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
12992 pedwarn (input_location, 0, "elaborated-type-specifier "
12993 "for a scoped enum must not use the %<%D%> keyword",
12994 cp_lexer_peek_token (parser->lexer)->u.value);
12995 /* Consume the `struct' or `class' and parse it anyway. */
12996 cp_lexer_consume_token (parser->lexer);
12998 /* Parse the attributes. */
12999 attributes = cp_parser_attributes_opt (parser);
13001 /* Or, it might be `typename'. */
13002 else if (cp_lexer_next_token_is_keyword (parser->lexer,
13005 /* Consume the `typename' token. */
13006 cp_lexer_consume_token (parser->lexer);
13007 /* Remember that it's a `typename' type. */
13008 tag_type = typename_type;
13010 /* Otherwise it must be a class-key. */
13013 tag_type = cp_parser_class_key (parser);
13014 if (tag_type == none_type)
13015 return error_mark_node;
13016 /* Parse the attributes. */
13017 attributes = cp_parser_attributes_opt (parser);
13020 /* Look for the `::' operator. */
13021 globalscope = cp_parser_global_scope_opt (parser,
13022 /*current_scope_valid_p=*/false);
13023 /* Look for the nested-name-specifier. */
13024 if (tag_type == typename_type && !globalscope)
13026 if (!cp_parser_nested_name_specifier (parser,
13027 /*typename_keyword_p=*/true,
13028 /*check_dependency_p=*/true,
13031 return error_mark_node;
13034 /* Even though `typename' is not present, the proposed resolution
13035 to Core Issue 180 says that in `class A<T>::B', `B' should be
13036 considered a type-name, even if `A<T>' is dependent. */
13037 cp_parser_nested_name_specifier_opt (parser,
13038 /*typename_keyword_p=*/true,
13039 /*check_dependency_p=*/true,
13042 /* For everything but enumeration types, consider a template-id.
13043 For an enumeration type, consider only a plain identifier. */
13044 if (tag_type != enum_type)
13046 bool template_p = false;
13049 /* Allow the `template' keyword. */
13050 template_p = cp_parser_optional_template_keyword (parser);
13051 /* If we didn't see `template', we don't know if there's a
13052 template-id or not. */
13054 cp_parser_parse_tentatively (parser);
13055 /* Parse the template-id. */
13056 token = cp_lexer_peek_token (parser->lexer);
13057 decl = cp_parser_template_id (parser, template_p,
13058 /*check_dependency_p=*/true,
13060 /* If we didn't find a template-id, look for an ordinary
13062 if (!template_p && !cp_parser_parse_definitely (parser))
13064 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
13065 in effect, then we must assume that, upon instantiation, the
13066 template will correspond to a class. */
13067 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
13068 && tag_type == typename_type)
13069 type = make_typename_type (parser->scope, decl,
13071 /*complain=*/tf_error);
13072 /* If the `typename' keyword is in effect and DECL is not a type
13073 decl. Then type is non existant. */
13074 else if (tag_type == typename_type && TREE_CODE (decl) != TYPE_DECL)
13077 type = TREE_TYPE (decl);
13082 token = cp_lexer_peek_token (parser->lexer);
13083 identifier = cp_parser_identifier (parser);
13085 if (identifier == error_mark_node)
13087 parser->scope = NULL_TREE;
13088 return error_mark_node;
13091 /* For a `typename', we needn't call xref_tag. */
13092 if (tag_type == typename_type
13093 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
13094 return cp_parser_make_typename_type (parser, parser->scope,
13097 /* Look up a qualified name in the usual way. */
13101 tree ambiguous_decls;
13103 decl = cp_parser_lookup_name (parser, identifier,
13105 /*is_template=*/false,
13106 /*is_namespace=*/false,
13107 /*check_dependency=*/true,
13111 /* If the lookup was ambiguous, an error will already have been
13113 if (ambiguous_decls)
13114 return error_mark_node;
13116 /* If we are parsing friend declaration, DECL may be a
13117 TEMPLATE_DECL tree node here. However, we need to check
13118 whether this TEMPLATE_DECL results in valid code. Consider
13119 the following example:
13122 template <class T> class C {};
13125 template <class T> friend class N::C; // #1, valid code
13127 template <class T> class Y {
13128 friend class N::C; // #2, invalid code
13131 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
13132 name lookup of `N::C'. We see that friend declaration must
13133 be template for the code to be valid. Note that
13134 processing_template_decl does not work here since it is
13135 always 1 for the above two cases. */
13137 decl = (cp_parser_maybe_treat_template_as_class
13138 (decl, /*tag_name_p=*/is_friend
13139 && parser->num_template_parameter_lists));
13141 if (TREE_CODE (decl) != TYPE_DECL)
13143 cp_parser_diagnose_invalid_type_name (parser,
13147 return error_mark_node;
13150 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
13152 bool allow_template = (parser->num_template_parameter_lists
13153 || DECL_SELF_REFERENCE_P (decl));
13154 type = check_elaborated_type_specifier (tag_type, decl,
13157 if (type == error_mark_node)
13158 return error_mark_node;
13161 /* Forward declarations of nested types, such as
13166 are invalid unless all components preceding the final '::'
13167 are complete. If all enclosing types are complete, these
13168 declarations become merely pointless.
13170 Invalid forward declarations of nested types are errors
13171 caught elsewhere in parsing. Those that are pointless arrive
13174 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
13175 && !is_friend && !processing_explicit_instantiation)
13176 warning (0, "declaration %qD does not declare anything", decl);
13178 type = TREE_TYPE (decl);
13182 /* An elaborated-type-specifier sometimes introduces a new type and
13183 sometimes names an existing type. Normally, the rule is that it
13184 introduces a new type only if there is not an existing type of
13185 the same name already in scope. For example, given:
13188 void f() { struct S s; }
13190 the `struct S' in the body of `f' is the same `struct S' as in
13191 the global scope; the existing definition is used. However, if
13192 there were no global declaration, this would introduce a new
13193 local class named `S'.
13195 An exception to this rule applies to the following code:
13197 namespace N { struct S; }
13199 Here, the elaborated-type-specifier names a new type
13200 unconditionally; even if there is already an `S' in the
13201 containing scope this declaration names a new type.
13202 This exception only applies if the elaborated-type-specifier
13203 forms the complete declaration:
13207 A declaration consisting solely of `class-key identifier ;' is
13208 either a redeclaration of the name in the current scope or a
13209 forward declaration of the identifier as a class name. It
13210 introduces the name into the current scope.
13212 We are in this situation precisely when the next token is a `;'.
13214 An exception to the exception is that a `friend' declaration does
13215 *not* name a new type; i.e., given:
13217 struct S { friend struct T; };
13219 `T' is not a new type in the scope of `S'.
13221 Also, `new struct S' or `sizeof (struct S)' never results in the
13222 definition of a new type; a new type can only be declared in a
13223 declaration context. */
13229 /* Friends have special name lookup rules. */
13230 ts = ts_within_enclosing_non_class;
13231 else if (is_declaration
13232 && cp_lexer_next_token_is (parser->lexer,
13234 /* This is a `class-key identifier ;' */
13240 (parser->num_template_parameter_lists
13241 && (cp_parser_next_token_starts_class_definition_p (parser)
13242 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
13243 /* An unqualified name was used to reference this type, so
13244 there were no qualifying templates. */
13245 if (!cp_parser_check_template_parameters (parser,
13246 /*num_templates=*/0,
13248 /*declarator=*/NULL))
13249 return error_mark_node;
13250 type = xref_tag (tag_type, identifier, ts, template_p);
13254 if (type == error_mark_node)
13255 return error_mark_node;
13257 /* Allow attributes on forward declarations of classes. */
13260 if (TREE_CODE (type) == TYPENAME_TYPE)
13261 warning (OPT_Wattributes,
13262 "attributes ignored on uninstantiated type");
13263 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
13264 && ! processing_explicit_instantiation)
13265 warning (OPT_Wattributes,
13266 "attributes ignored on template instantiation");
13267 else if (is_declaration && cp_parser_declares_only_class_p (parser))
13268 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
13270 warning (OPT_Wattributes,
13271 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
13274 if (tag_type != enum_type)
13275 cp_parser_check_class_key (tag_type, type);
13277 /* A "<" cannot follow an elaborated type specifier. If that
13278 happens, the user was probably trying to form a template-id. */
13279 cp_parser_check_for_invalid_template_id (parser, type, token->location);
13284 /* Parse an enum-specifier.
13287 enum-head { enumerator-list [opt] }
13290 enum-key identifier [opt] enum-base [opt]
13291 enum-key nested-name-specifier identifier enum-base [opt]
13296 enum struct [C++0x]
13299 : type-specifier-seq
13301 opaque-enum-specifier:
13302 enum-key identifier enum-base [opt] ;
13305 enum-key attributes[opt] identifier [opt] enum-base [opt]
13306 { enumerator-list [opt] }attributes[opt]
13308 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
13309 if the token stream isn't an enum-specifier after all. */
13312 cp_parser_enum_specifier (cp_parser* parser)
13315 tree type = NULL_TREE;
13317 tree nested_name_specifier = NULL_TREE;
13319 bool scoped_enum_p = false;
13320 bool has_underlying_type = false;
13321 bool nested_being_defined = false;
13322 bool new_value_list = false;
13323 bool is_new_type = false;
13324 bool is_anonymous = false;
13325 tree underlying_type = NULL_TREE;
13326 cp_token *type_start_token = NULL;
13327 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
13329 parser->colon_corrects_to_scope_p = false;
13331 /* Parse tentatively so that we can back up if we don't find a
13333 cp_parser_parse_tentatively (parser);
13335 /* Caller guarantees that the current token is 'enum', an identifier
13336 possibly follows, and the token after that is an opening brace.
13337 If we don't have an identifier, fabricate an anonymous name for
13338 the enumeration being defined. */
13339 cp_lexer_consume_token (parser->lexer);
13341 /* Parse the "class" or "struct", which indicates a scoped
13342 enumeration type in C++0x. */
13343 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
13344 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
13346 if (cxx_dialect < cxx0x)
13347 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS);
13349 /* Consume the `struct' or `class' token. */
13350 cp_lexer_consume_token (parser->lexer);
13352 scoped_enum_p = true;
13355 attributes = cp_parser_attributes_opt (parser);
13357 /* Clear the qualification. */
13358 parser->scope = NULL_TREE;
13359 parser->qualifying_scope = NULL_TREE;
13360 parser->object_scope = NULL_TREE;
13362 /* Figure out in what scope the declaration is being placed. */
13363 prev_scope = current_scope ();
13365 type_start_token = cp_lexer_peek_token (parser->lexer);
13367 push_deferring_access_checks (dk_no_check);
13368 nested_name_specifier
13369 = cp_parser_nested_name_specifier_opt (parser,
13370 /*typename_keyword_p=*/true,
13371 /*check_dependency_p=*/false,
13373 /*is_declaration=*/false);
13375 if (nested_name_specifier)
13379 identifier = cp_parser_identifier (parser);
13380 name = cp_parser_lookup_name (parser, identifier,
13382 /*is_template=*/false,
13383 /*is_namespace=*/false,
13384 /*check_dependency=*/true,
13385 /*ambiguous_decls=*/NULL,
13389 type = TREE_TYPE (name);
13390 if (TREE_CODE (type) == TYPENAME_TYPE)
13392 /* Are template enums allowed in ISO? */
13393 if (template_parm_scope_p ())
13394 pedwarn (type_start_token->location, OPT_pedantic,
13395 "%qD is an enumeration template", name);
13396 /* ignore a typename reference, for it will be solved by name
13402 error_at (type_start_token->location,
13403 "%qD is not an enumerator-name", identifier);
13407 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
13408 identifier = cp_parser_identifier (parser);
13411 identifier = make_anon_name ();
13412 is_anonymous = true;
13415 pop_deferring_access_checks ();
13417 /* Check for the `:' that denotes a specified underlying type in C++0x.
13418 Note that a ':' could also indicate a bitfield width, however. */
13419 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
13421 cp_decl_specifier_seq type_specifiers;
13423 /* Consume the `:'. */
13424 cp_lexer_consume_token (parser->lexer);
13426 /* Parse the type-specifier-seq. */
13427 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
13428 /*is_trailing_return=*/false,
13431 /* At this point this is surely not elaborated type specifier. */
13432 if (!cp_parser_parse_definitely (parser))
13435 if (cxx_dialect < cxx0x)
13436 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS);
13438 has_underlying_type = true;
13440 /* If that didn't work, stop. */
13441 if (type_specifiers.type != error_mark_node)
13443 underlying_type = grokdeclarator (NULL, &type_specifiers, TYPENAME,
13444 /*initialized=*/0, NULL);
13445 if (underlying_type == error_mark_node)
13446 underlying_type = NULL_TREE;
13450 /* Look for the `{' but don't consume it yet. */
13451 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13453 if (cxx_dialect < cxx0x || (!scoped_enum_p && !underlying_type))
13455 cp_parser_error (parser, "expected %<{%>");
13456 if (has_underlying_type)
13462 /* An opaque-enum-specifier must have a ';' here. */
13463 if ((scoped_enum_p || underlying_type)
13464 && cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
13466 cp_parser_error (parser, "expected %<;%> or %<{%>");
13467 if (has_underlying_type)
13475 if (!has_underlying_type && !cp_parser_parse_definitely (parser))
13478 if (nested_name_specifier)
13480 if (CLASS_TYPE_P (nested_name_specifier))
13482 nested_being_defined = TYPE_BEING_DEFINED (nested_name_specifier);
13483 TYPE_BEING_DEFINED (nested_name_specifier) = 1;
13484 push_scope (nested_name_specifier);
13486 else if (TREE_CODE (nested_name_specifier) == NAMESPACE_DECL)
13488 push_nested_namespace (nested_name_specifier);
13492 /* Issue an error message if type-definitions are forbidden here. */
13493 if (!cp_parser_check_type_definition (parser))
13494 type = error_mark_node;
13496 /* Create the new type. We do this before consuming the opening
13497 brace so the enum will be recorded as being on the line of its
13498 tag (or the 'enum' keyword, if there is no tag). */
13499 type = start_enum (identifier, type, underlying_type,
13500 scoped_enum_p, &is_new_type);
13502 /* If the next token is not '{' it is an opaque-enum-specifier or an
13503 elaborated-type-specifier. */
13504 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13506 timevar_push (TV_PARSE_ENUM);
13507 if (nested_name_specifier)
13509 /* The following catches invalid code such as:
13510 enum class S<int>::E { A, B, C }; */
13511 if (!processing_specialization
13512 && CLASS_TYPE_P (nested_name_specifier)
13513 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier))
13514 error_at (type_start_token->location, "cannot add an enumerator "
13515 "list to a template instantiation");
13517 /* If that scope does not contain the scope in which the
13518 class was originally declared, the program is invalid. */
13519 if (prev_scope && !is_ancestor (prev_scope, nested_name_specifier))
13521 if (at_namespace_scope_p ())
13522 error_at (type_start_token->location,
13523 "declaration of %qD in namespace %qD which does not "
13525 type, prev_scope, nested_name_specifier);
13527 error_at (type_start_token->location,
13528 "declaration of %qD in %qD which does not enclose %qD",
13529 type, prev_scope, nested_name_specifier);
13530 type = error_mark_node;
13535 begin_scope (sk_scoped_enum, type);
13537 /* Consume the opening brace. */
13538 cp_lexer_consume_token (parser->lexer);
13540 if (type == error_mark_node)
13541 ; /* Nothing to add */
13542 else if (OPAQUE_ENUM_P (type)
13543 || (cxx_dialect > cxx98 && processing_specialization))
13545 new_value_list = true;
13546 SET_OPAQUE_ENUM_P (type, false);
13547 DECL_SOURCE_LOCATION (TYPE_NAME (type)) = type_start_token->location;
13551 error_at (type_start_token->location, "multiple definition of %q#T", type);
13552 error_at (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type)),
13553 "previous definition here");
13554 type = error_mark_node;
13557 if (type == error_mark_node)
13558 cp_parser_skip_to_end_of_block_or_statement (parser);
13559 /* If the next token is not '}', then there are some enumerators. */
13560 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
13561 cp_parser_enumerator_list (parser, type);
13563 /* Consume the final '}'. */
13564 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
13568 timevar_pop (TV_PARSE_ENUM);
13572 /* If a ';' follows, then it is an opaque-enum-specifier
13573 and additional restrictions apply. */
13574 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13577 error_at (type_start_token->location,
13578 "opaque-enum-specifier without name");
13579 else if (nested_name_specifier)
13580 error_at (type_start_token->location,
13581 "opaque-enum-specifier must use a simple identifier");
13585 /* Look for trailing attributes to apply to this enumeration, and
13586 apply them if appropriate. */
13587 if (cp_parser_allow_gnu_extensions_p (parser))
13589 tree trailing_attr = cp_parser_attributes_opt (parser);
13590 trailing_attr = chainon (trailing_attr, attributes);
13591 cplus_decl_attributes (&type,
13593 (int) ATTR_FLAG_TYPE_IN_PLACE);
13596 /* Finish up the enumeration. */
13597 if (type != error_mark_node)
13599 if (new_value_list)
13600 finish_enum_value_list (type);
13602 finish_enum (type);
13605 if (nested_name_specifier)
13607 if (CLASS_TYPE_P (nested_name_specifier))
13609 TYPE_BEING_DEFINED (nested_name_specifier) = nested_being_defined;
13610 pop_scope (nested_name_specifier);
13612 else if (TREE_CODE (nested_name_specifier) == NAMESPACE_DECL)
13614 pop_nested_namespace (nested_name_specifier);
13618 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
13622 /* Parse an enumerator-list. The enumerators all have the indicated
13626 enumerator-definition
13627 enumerator-list , enumerator-definition */
13630 cp_parser_enumerator_list (cp_parser* parser, tree type)
13634 /* Parse an enumerator-definition. */
13635 cp_parser_enumerator_definition (parser, type);
13637 /* If the next token is not a ',', we've reached the end of
13639 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13641 /* Otherwise, consume the `,' and keep going. */
13642 cp_lexer_consume_token (parser->lexer);
13643 /* If the next token is a `}', there is a trailing comma. */
13644 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
13646 if (!in_system_header)
13647 pedwarn (input_location, OPT_pedantic, "comma at end of enumerator list");
13653 /* Parse an enumerator-definition. The enumerator has the indicated
13656 enumerator-definition:
13658 enumerator = constant-expression
13664 cp_parser_enumerator_definition (cp_parser* parser, tree type)
13670 /* Save the input location because we are interested in the location
13671 of the identifier and not the location of the explicit value. */
13672 loc = cp_lexer_peek_token (parser->lexer)->location;
13674 /* Look for the identifier. */
13675 identifier = cp_parser_identifier (parser);
13676 if (identifier == error_mark_node)
13679 /* If the next token is an '=', then there is an explicit value. */
13680 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
13682 /* Consume the `=' token. */
13683 cp_lexer_consume_token (parser->lexer);
13684 /* Parse the value. */
13685 value = cp_parser_constant_expression (parser,
13686 /*allow_non_constant_p=*/false,
13692 /* If we are processing a template, make sure the initializer of the
13693 enumerator doesn't contain any bare template parameter pack. */
13694 if (check_for_bare_parameter_packs (value))
13695 value = error_mark_node;
13697 /* integral_constant_value will pull out this expression, so make sure
13698 it's folded as appropriate. */
13699 value = fold_non_dependent_expr (value);
13701 /* Create the enumerator. */
13702 build_enumerator (identifier, value, type, loc);
13705 /* Parse a namespace-name.
13708 original-namespace-name
13711 Returns the NAMESPACE_DECL for the namespace. */
13714 cp_parser_namespace_name (cp_parser* parser)
13717 tree namespace_decl;
13719 cp_token *token = cp_lexer_peek_token (parser->lexer);
13721 /* Get the name of the namespace. */
13722 identifier = cp_parser_identifier (parser);
13723 if (identifier == error_mark_node)
13724 return error_mark_node;
13726 /* Look up the identifier in the currently active scope. Look only
13727 for namespaces, due to:
13729 [basic.lookup.udir]
13731 When looking up a namespace-name in a using-directive or alias
13732 definition, only namespace names are considered.
13736 [basic.lookup.qual]
13738 During the lookup of a name preceding the :: scope resolution
13739 operator, object, function, and enumerator names are ignored.
13741 (Note that cp_parser_qualifying_entity only calls this
13742 function if the token after the name is the scope resolution
13744 namespace_decl = cp_parser_lookup_name (parser, identifier,
13746 /*is_template=*/false,
13747 /*is_namespace=*/true,
13748 /*check_dependency=*/true,
13749 /*ambiguous_decls=*/NULL,
13751 /* If it's not a namespace, issue an error. */
13752 if (namespace_decl == error_mark_node
13753 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
13755 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
13756 error_at (token->location, "%qD is not a namespace-name", identifier);
13757 cp_parser_error (parser, "expected namespace-name");
13758 namespace_decl = error_mark_node;
13761 return namespace_decl;
13764 /* Parse a namespace-definition.
13766 namespace-definition:
13767 named-namespace-definition
13768 unnamed-namespace-definition
13770 named-namespace-definition:
13771 original-namespace-definition
13772 extension-namespace-definition
13774 original-namespace-definition:
13775 namespace identifier { namespace-body }
13777 extension-namespace-definition:
13778 namespace original-namespace-name { namespace-body }
13780 unnamed-namespace-definition:
13781 namespace { namespace-body } */
13784 cp_parser_namespace_definition (cp_parser* parser)
13786 tree identifier, attribs;
13787 bool has_visibility;
13790 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_INLINE))
13792 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES);
13794 cp_lexer_consume_token (parser->lexer);
13799 /* Look for the `namespace' keyword. */
13800 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
13802 /* Get the name of the namespace. We do not attempt to distinguish
13803 between an original-namespace-definition and an
13804 extension-namespace-definition at this point. The semantic
13805 analysis routines are responsible for that. */
13806 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
13807 identifier = cp_parser_identifier (parser);
13809 identifier = NULL_TREE;
13811 /* Parse any specified attributes. */
13812 attribs = cp_parser_attributes_opt (parser);
13814 /* Look for the `{' to start the namespace. */
13815 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
13816 /* Start the namespace. */
13817 push_namespace (identifier);
13819 /* "inline namespace" is equivalent to a stub namespace definition
13820 followed by a strong using directive. */
13823 tree name_space = current_namespace;
13824 /* Set up namespace association. */
13825 DECL_NAMESPACE_ASSOCIATIONS (name_space)
13826 = tree_cons (CP_DECL_CONTEXT (name_space), NULL_TREE,
13827 DECL_NAMESPACE_ASSOCIATIONS (name_space));
13828 /* Import the contents of the inline namespace. */
13830 do_using_directive (name_space);
13831 push_namespace (identifier);
13834 has_visibility = handle_namespace_attrs (current_namespace, attribs);
13836 /* Parse the body of the namespace. */
13837 cp_parser_namespace_body (parser);
13839 if (has_visibility)
13840 pop_visibility (1);
13842 /* Finish the namespace. */
13844 /* Look for the final `}'. */
13845 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
13848 /* Parse a namespace-body.
13851 declaration-seq [opt] */
13854 cp_parser_namespace_body (cp_parser* parser)
13856 cp_parser_declaration_seq_opt (parser);
13859 /* Parse a namespace-alias-definition.
13861 namespace-alias-definition:
13862 namespace identifier = qualified-namespace-specifier ; */
13865 cp_parser_namespace_alias_definition (cp_parser* parser)
13868 tree namespace_specifier;
13870 cp_token *token = cp_lexer_peek_token (parser->lexer);
13872 /* Look for the `namespace' keyword. */
13873 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
13874 /* Look for the identifier. */
13875 identifier = cp_parser_identifier (parser);
13876 if (identifier == error_mark_node)
13878 /* Look for the `=' token. */
13879 if (!cp_parser_uncommitted_to_tentative_parse_p (parser)
13880 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13882 error_at (token->location, "%<namespace%> definition is not allowed here");
13883 /* Skip the definition. */
13884 cp_lexer_consume_token (parser->lexer);
13885 if (cp_parser_skip_to_closing_brace (parser))
13886 cp_lexer_consume_token (parser->lexer);
13889 cp_parser_require (parser, CPP_EQ, RT_EQ);
13890 /* Look for the qualified-namespace-specifier. */
13891 namespace_specifier
13892 = cp_parser_qualified_namespace_specifier (parser);
13893 /* Look for the `;' token. */
13894 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
13896 /* Register the alias in the symbol table. */
13897 do_namespace_alias (identifier, namespace_specifier);
13900 /* Parse a qualified-namespace-specifier.
13902 qualified-namespace-specifier:
13903 :: [opt] nested-name-specifier [opt] namespace-name
13905 Returns a NAMESPACE_DECL corresponding to the specified
13909 cp_parser_qualified_namespace_specifier (cp_parser* parser)
13911 /* Look for the optional `::'. */
13912 cp_parser_global_scope_opt (parser,
13913 /*current_scope_valid_p=*/false);
13915 /* Look for the optional nested-name-specifier. */
13916 cp_parser_nested_name_specifier_opt (parser,
13917 /*typename_keyword_p=*/false,
13918 /*check_dependency_p=*/true,
13920 /*is_declaration=*/true);
13922 return cp_parser_namespace_name (parser);
13925 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
13926 access declaration.
13929 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
13930 using :: unqualified-id ;
13932 access-declaration:
13938 cp_parser_using_declaration (cp_parser* parser,
13939 bool access_declaration_p)
13942 bool typename_p = false;
13943 bool global_scope_p;
13948 if (access_declaration_p)
13949 cp_parser_parse_tentatively (parser);
13952 /* Look for the `using' keyword. */
13953 cp_parser_require_keyword (parser, RID_USING, RT_USING);
13955 /* Peek at the next token. */
13956 token = cp_lexer_peek_token (parser->lexer);
13957 /* See if it's `typename'. */
13958 if (token->keyword == RID_TYPENAME)
13960 /* Remember that we've seen it. */
13962 /* Consume the `typename' token. */
13963 cp_lexer_consume_token (parser->lexer);
13967 /* Look for the optional global scope qualification. */
13969 = (cp_parser_global_scope_opt (parser,
13970 /*current_scope_valid_p=*/false)
13973 /* If we saw `typename', or didn't see `::', then there must be a
13974 nested-name-specifier present. */
13975 if (typename_p || !global_scope_p)
13976 qscope = cp_parser_nested_name_specifier (parser, typename_p,
13977 /*check_dependency_p=*/true,
13979 /*is_declaration=*/true);
13980 /* Otherwise, we could be in either of the two productions. In that
13981 case, treat the nested-name-specifier as optional. */
13983 qscope = cp_parser_nested_name_specifier_opt (parser,
13984 /*typename_keyword_p=*/false,
13985 /*check_dependency_p=*/true,
13987 /*is_declaration=*/true);
13989 qscope = global_namespace;
13991 if (access_declaration_p && cp_parser_error_occurred (parser))
13992 /* Something has already gone wrong; there's no need to parse
13993 further. Since an error has occurred, the return value of
13994 cp_parser_parse_definitely will be false, as required. */
13995 return cp_parser_parse_definitely (parser);
13997 token = cp_lexer_peek_token (parser->lexer);
13998 /* Parse the unqualified-id. */
13999 identifier = cp_parser_unqualified_id (parser,
14000 /*template_keyword_p=*/false,
14001 /*check_dependency_p=*/true,
14002 /*declarator_p=*/true,
14003 /*optional_p=*/false);
14005 if (access_declaration_p)
14007 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
14008 cp_parser_simulate_error (parser);
14009 if (!cp_parser_parse_definitely (parser))
14013 /* The function we call to handle a using-declaration is different
14014 depending on what scope we are in. */
14015 if (qscope == error_mark_node || identifier == error_mark_node)
14017 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
14018 && TREE_CODE (identifier) != BIT_NOT_EXPR)
14019 /* [namespace.udecl]
14021 A using declaration shall not name a template-id. */
14022 error_at (token->location,
14023 "a template-id may not appear in a using-declaration");
14026 if (at_class_scope_p ())
14028 /* Create the USING_DECL. */
14029 decl = do_class_using_decl (parser->scope, identifier);
14031 if (check_for_bare_parameter_packs (decl))
14034 /* Add it to the list of members in this class. */
14035 finish_member_declaration (decl);
14039 decl = cp_parser_lookup_name_simple (parser,
14042 if (decl == error_mark_node)
14043 cp_parser_name_lookup_error (parser, identifier,
14046 else if (check_for_bare_parameter_packs (decl))
14048 else if (!at_namespace_scope_p ())
14049 do_local_using_decl (decl, qscope, identifier);
14051 do_toplevel_using_decl (decl, qscope, identifier);
14055 /* Look for the final `;'. */
14056 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
14061 /* Parse a using-directive.
14064 using namespace :: [opt] nested-name-specifier [opt]
14065 namespace-name ; */
14068 cp_parser_using_directive (cp_parser* parser)
14070 tree namespace_decl;
14073 /* Look for the `using' keyword. */
14074 cp_parser_require_keyword (parser, RID_USING, RT_USING);
14075 /* And the `namespace' keyword. */
14076 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
14077 /* Look for the optional `::' operator. */
14078 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
14079 /* And the optional nested-name-specifier. */
14080 cp_parser_nested_name_specifier_opt (parser,
14081 /*typename_keyword_p=*/false,
14082 /*check_dependency_p=*/true,
14084 /*is_declaration=*/true);
14085 /* Get the namespace being used. */
14086 namespace_decl = cp_parser_namespace_name (parser);
14087 /* And any specified attributes. */
14088 attribs = cp_parser_attributes_opt (parser);
14089 /* Update the symbol table. */
14090 parse_using_directive (namespace_decl, attribs);
14091 /* Look for the final `;'. */
14092 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
14095 /* Parse an asm-definition.
14098 asm ( string-literal ) ;
14103 asm volatile [opt] ( string-literal ) ;
14104 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
14105 asm volatile [opt] ( string-literal : asm-operand-list [opt]
14106 : asm-operand-list [opt] ) ;
14107 asm volatile [opt] ( string-literal : asm-operand-list [opt]
14108 : asm-operand-list [opt]
14109 : asm-clobber-list [opt] ) ;
14110 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
14111 : asm-clobber-list [opt]
14112 : asm-goto-list ) ; */
14115 cp_parser_asm_definition (cp_parser* parser)
14118 tree outputs = NULL_TREE;
14119 tree inputs = NULL_TREE;
14120 tree clobbers = NULL_TREE;
14121 tree labels = NULL_TREE;
14123 bool volatile_p = false;
14124 bool extended_p = false;
14125 bool invalid_inputs_p = false;
14126 bool invalid_outputs_p = false;
14127 bool goto_p = false;
14128 required_token missing = RT_NONE;
14130 /* Look for the `asm' keyword. */
14131 cp_parser_require_keyword (parser, RID_ASM, RT_ASM);
14132 /* See if the next token is `volatile'. */
14133 if (cp_parser_allow_gnu_extensions_p (parser)
14134 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
14136 /* Remember that we saw the `volatile' keyword. */
14138 /* Consume the token. */
14139 cp_lexer_consume_token (parser->lexer);
14141 if (cp_parser_allow_gnu_extensions_p (parser)
14142 && parser->in_function_body
14143 && cp_lexer_next_token_is_keyword (parser->lexer, RID_GOTO))
14145 /* Remember that we saw the `goto' keyword. */
14147 /* Consume the token. */
14148 cp_lexer_consume_token (parser->lexer);
14150 /* Look for the opening `('. */
14151 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
14153 /* Look for the string. */
14154 string = cp_parser_string_literal (parser, false, false);
14155 if (string == error_mark_node)
14157 cp_parser_skip_to_closing_parenthesis (parser, true, false,
14158 /*consume_paren=*/true);
14162 /* If we're allowing GNU extensions, check for the extended assembly
14163 syntax. Unfortunately, the `:' tokens need not be separated by
14164 a space in C, and so, for compatibility, we tolerate that here
14165 too. Doing that means that we have to treat the `::' operator as
14167 if (cp_parser_allow_gnu_extensions_p (parser)
14168 && parser->in_function_body
14169 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
14170 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
14172 bool inputs_p = false;
14173 bool clobbers_p = false;
14174 bool labels_p = false;
14176 /* The extended syntax was used. */
14179 /* Look for outputs. */
14180 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
14182 /* Consume the `:'. */
14183 cp_lexer_consume_token (parser->lexer);
14184 /* Parse the output-operands. */
14185 if (cp_lexer_next_token_is_not (parser->lexer,
14187 && cp_lexer_next_token_is_not (parser->lexer,
14189 && cp_lexer_next_token_is_not (parser->lexer,
14192 outputs = cp_parser_asm_operand_list (parser);
14194 if (outputs == error_mark_node)
14195 invalid_outputs_p = true;
14197 /* If the next token is `::', there are no outputs, and the
14198 next token is the beginning of the inputs. */
14199 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14200 /* The inputs are coming next. */
14203 /* Look for inputs. */
14205 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
14207 /* Consume the `:' or `::'. */
14208 cp_lexer_consume_token (parser->lexer);
14209 /* Parse the output-operands. */
14210 if (cp_lexer_next_token_is_not (parser->lexer,
14212 && cp_lexer_next_token_is_not (parser->lexer,
14214 && cp_lexer_next_token_is_not (parser->lexer,
14216 inputs = cp_parser_asm_operand_list (parser);
14218 if (inputs == error_mark_node)
14219 invalid_inputs_p = true;
14221 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14222 /* The clobbers are coming next. */
14225 /* Look for clobbers. */
14227 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
14230 /* Consume the `:' or `::'. */
14231 cp_lexer_consume_token (parser->lexer);
14232 /* Parse the clobbers. */
14233 if (cp_lexer_next_token_is_not (parser->lexer,
14235 && cp_lexer_next_token_is_not (parser->lexer,
14237 clobbers = cp_parser_asm_clobber_list (parser);
14240 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
14241 /* The labels are coming next. */
14244 /* Look for labels. */
14246 || (goto_p && cp_lexer_next_token_is (parser->lexer, CPP_COLON)))
14249 /* Consume the `:' or `::'. */
14250 cp_lexer_consume_token (parser->lexer);
14251 /* Parse the labels. */
14252 labels = cp_parser_asm_label_list (parser);
14255 if (goto_p && !labels_p)
14256 missing = clobbers_p ? RT_COLON : RT_COLON_SCOPE;
14259 missing = RT_COLON_SCOPE;
14261 /* Look for the closing `)'. */
14262 if (!cp_parser_require (parser, missing ? CPP_COLON : CPP_CLOSE_PAREN,
14263 missing ? missing : RT_CLOSE_PAREN))
14264 cp_parser_skip_to_closing_parenthesis (parser, true, false,
14265 /*consume_paren=*/true);
14266 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
14268 if (!invalid_inputs_p && !invalid_outputs_p)
14270 /* Create the ASM_EXPR. */
14271 if (parser->in_function_body)
14273 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
14274 inputs, clobbers, labels);
14275 /* If the extended syntax was not used, mark the ASM_EXPR. */
14278 tree temp = asm_stmt;
14279 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
14280 temp = TREE_OPERAND (temp, 0);
14282 ASM_INPUT_P (temp) = 1;
14286 cgraph_add_asm_node (string);
14290 /* Declarators [gram.dcl.decl] */
14292 /* Parse an init-declarator.
14295 declarator initializer [opt]
14300 declarator asm-specification [opt] attributes [opt] initializer [opt]
14302 function-definition:
14303 decl-specifier-seq [opt] declarator ctor-initializer [opt]
14305 decl-specifier-seq [opt] declarator function-try-block
14309 function-definition:
14310 __extension__ function-definition
14312 The DECL_SPECIFIERS apply to this declarator. Returns a
14313 representation of the entity declared. If MEMBER_P is TRUE, then
14314 this declarator appears in a class scope. The new DECL created by
14315 this declarator is returned.
14317 The CHECKS are access checks that should be performed once we know
14318 what entity is being declared (and, therefore, what classes have
14321 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
14322 for a function-definition here as well. If the declarator is a
14323 declarator for a function-definition, *FUNCTION_DEFINITION_P will
14324 be TRUE upon return. By that point, the function-definition will
14325 have been completely parsed.
14327 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
14330 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
14331 parsed declaration if it is an uninitialized single declarator not followed
14332 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
14333 if present, will not be consumed. If returned, this declarator will be
14334 created with SD_INITIALIZED but will not call cp_finish_decl. */
14337 cp_parser_init_declarator (cp_parser* parser,
14338 cp_decl_specifier_seq *decl_specifiers,
14339 VEC (deferred_access_check,gc)* checks,
14340 bool function_definition_allowed_p,
14342 int declares_class_or_enum,
14343 bool* function_definition_p,
14344 tree* maybe_range_for_decl)
14346 cp_token *token = NULL, *asm_spec_start_token = NULL,
14347 *attributes_start_token = NULL;
14348 cp_declarator *declarator;
14349 tree prefix_attributes;
14351 tree asm_specification;
14353 tree decl = NULL_TREE;
14355 int is_initialized;
14356 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
14357 initialized with "= ..", CPP_OPEN_PAREN if initialized with
14359 enum cpp_ttype initialization_kind;
14360 bool is_direct_init = false;
14361 bool is_non_constant_init;
14362 int ctor_dtor_or_conv_p;
14364 tree pushed_scope = NULL_TREE;
14365 bool range_for_decl_p = false;
14367 /* Gather the attributes that were provided with the
14368 decl-specifiers. */
14369 prefix_attributes = decl_specifiers->attributes;
14371 /* Assume that this is not the declarator for a function
14373 if (function_definition_p)
14374 *function_definition_p = false;
14376 /* Defer access checks while parsing the declarator; we cannot know
14377 what names are accessible until we know what is being
14379 resume_deferring_access_checks ();
14381 /* Parse the declarator. */
14382 token = cp_lexer_peek_token (parser->lexer);
14384 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
14385 &ctor_dtor_or_conv_p,
14386 /*parenthesized_p=*/NULL,
14387 /*member_p=*/false);
14388 /* Gather up the deferred checks. */
14389 stop_deferring_access_checks ();
14391 /* If the DECLARATOR was erroneous, there's no need to go
14393 if (declarator == cp_error_declarator)
14394 return error_mark_node;
14396 /* Check that the number of template-parameter-lists is OK. */
14397 if (!cp_parser_check_declarator_template_parameters (parser, declarator,
14399 return error_mark_node;
14401 if (declares_class_or_enum & 2)
14402 cp_parser_check_for_definition_in_return_type (declarator,
14403 decl_specifiers->type,
14404 decl_specifiers->type_location);
14406 /* Figure out what scope the entity declared by the DECLARATOR is
14407 located in. `grokdeclarator' sometimes changes the scope, so
14408 we compute it now. */
14409 scope = get_scope_of_declarator (declarator);
14411 /* Perform any lookups in the declared type which were thought to be
14412 dependent, but are not in the scope of the declarator. */
14413 decl_specifiers->type
14414 = maybe_update_decl_type (decl_specifiers->type, scope);
14416 /* If we're allowing GNU extensions, look for an asm-specification
14418 if (cp_parser_allow_gnu_extensions_p (parser))
14420 /* Look for an asm-specification. */
14421 asm_spec_start_token = cp_lexer_peek_token (parser->lexer);
14422 asm_specification = cp_parser_asm_specification_opt (parser);
14423 /* And attributes. */
14424 attributes_start_token = cp_lexer_peek_token (parser->lexer);
14425 attributes = cp_parser_attributes_opt (parser);
14429 asm_specification = NULL_TREE;
14430 attributes = NULL_TREE;
14433 /* Peek at the next token. */
14434 token = cp_lexer_peek_token (parser->lexer);
14435 /* Check to see if the token indicates the start of a
14436 function-definition. */
14437 if (function_declarator_p (declarator)
14438 && cp_parser_token_starts_function_definition_p (token))
14440 if (!function_definition_allowed_p)
14442 /* If a function-definition should not appear here, issue an
14444 cp_parser_error (parser,
14445 "a function-definition is not allowed here");
14446 return error_mark_node;
14450 location_t func_brace_location
14451 = cp_lexer_peek_token (parser->lexer)->location;
14453 /* Neither attributes nor an asm-specification are allowed
14454 on a function-definition. */
14455 if (asm_specification)
14456 error_at (asm_spec_start_token->location,
14457 "an asm-specification is not allowed "
14458 "on a function-definition");
14460 error_at (attributes_start_token->location,
14461 "attributes are not allowed on a function-definition");
14462 /* This is a function-definition. */
14463 *function_definition_p = true;
14465 /* Parse the function definition. */
14467 decl = cp_parser_save_member_function_body (parser,
14470 prefix_attributes);
14473 = (cp_parser_function_definition_from_specifiers_and_declarator
14474 (parser, decl_specifiers, prefix_attributes, declarator));
14476 if (decl != error_mark_node && DECL_STRUCT_FUNCTION (decl))
14478 /* This is where the prologue starts... */
14479 DECL_STRUCT_FUNCTION (decl)->function_start_locus
14480 = func_brace_location;
14489 Only in function declarations for constructors, destructors, and
14490 type conversions can the decl-specifier-seq be omitted.
14492 We explicitly postpone this check past the point where we handle
14493 function-definitions because we tolerate function-definitions
14494 that are missing their return types in some modes. */
14495 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
14497 cp_parser_error (parser,
14498 "expected constructor, destructor, or type conversion");
14499 return error_mark_node;
14502 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
14503 if (token->type == CPP_EQ
14504 || token->type == CPP_OPEN_PAREN
14505 || token->type == CPP_OPEN_BRACE)
14507 is_initialized = SD_INITIALIZED;
14508 initialization_kind = token->type;
14509 if (maybe_range_for_decl)
14510 *maybe_range_for_decl = error_mark_node;
14512 if (token->type == CPP_EQ
14513 && function_declarator_p (declarator))
14515 cp_token *t2 = cp_lexer_peek_nth_token (parser->lexer, 2);
14516 if (t2->keyword == RID_DEFAULT)
14517 is_initialized = SD_DEFAULTED;
14518 else if (t2->keyword == RID_DELETE)
14519 is_initialized = SD_DELETED;
14524 /* If the init-declarator isn't initialized and isn't followed by a
14525 `,' or `;', it's not a valid init-declarator. */
14526 if (token->type != CPP_COMMA
14527 && token->type != CPP_SEMICOLON)
14529 if (maybe_range_for_decl && *maybe_range_for_decl != error_mark_node)
14530 range_for_decl_p = true;
14533 cp_parser_error (parser, "expected initializer");
14534 return error_mark_node;
14537 is_initialized = SD_UNINITIALIZED;
14538 initialization_kind = CPP_EOF;
14541 /* Because start_decl has side-effects, we should only call it if we
14542 know we're going ahead. By this point, we know that we cannot
14543 possibly be looking at any other construct. */
14544 cp_parser_commit_to_tentative_parse (parser);
14546 /* If the decl specifiers were bad, issue an error now that we're
14547 sure this was intended to be a declarator. Then continue
14548 declaring the variable(s), as int, to try to cut down on further
14550 if (decl_specifiers->any_specifiers_p
14551 && decl_specifiers->type == error_mark_node)
14553 cp_parser_error (parser, "invalid type in declaration");
14554 decl_specifiers->type = integer_type_node;
14557 /* Check to see whether or not this declaration is a friend. */
14558 friend_p = cp_parser_friend_p (decl_specifiers);
14560 /* Enter the newly declared entry in the symbol table. If we're
14561 processing a declaration in a class-specifier, we wait until
14562 after processing the initializer. */
14565 if (parser->in_unbraced_linkage_specification_p)
14566 decl_specifiers->storage_class = sc_extern;
14567 decl = start_decl (declarator, decl_specifiers,
14568 range_for_decl_p? SD_INITIALIZED : is_initialized,
14569 attributes, prefix_attributes,
14571 /* Adjust location of decl if declarator->id_loc is more appropriate:
14572 set, and decl wasn't merged with another decl, in which case its
14573 location would be different from input_location, and more accurate. */
14575 && declarator->id_loc != UNKNOWN_LOCATION
14576 && DECL_SOURCE_LOCATION (decl) == input_location)
14577 DECL_SOURCE_LOCATION (decl) = declarator->id_loc;
14580 /* Enter the SCOPE. That way unqualified names appearing in the
14581 initializer will be looked up in SCOPE. */
14582 pushed_scope = push_scope (scope);
14584 /* Perform deferred access control checks, now that we know in which
14585 SCOPE the declared entity resides. */
14586 if (!member_p && decl)
14588 tree saved_current_function_decl = NULL_TREE;
14590 /* If the entity being declared is a function, pretend that we
14591 are in its scope. If it is a `friend', it may have access to
14592 things that would not otherwise be accessible. */
14593 if (TREE_CODE (decl) == FUNCTION_DECL)
14595 saved_current_function_decl = current_function_decl;
14596 current_function_decl = decl;
14599 /* Perform access checks for template parameters. */
14600 cp_parser_perform_template_parameter_access_checks (checks);
14602 /* Perform the access control checks for the declarator and the
14603 decl-specifiers. */
14604 perform_deferred_access_checks ();
14606 /* Restore the saved value. */
14607 if (TREE_CODE (decl) == FUNCTION_DECL)
14608 current_function_decl = saved_current_function_decl;
14611 /* Parse the initializer. */
14612 initializer = NULL_TREE;
14613 is_direct_init = false;
14614 is_non_constant_init = true;
14615 if (is_initialized)
14617 if (function_declarator_p (declarator))
14619 cp_token *initializer_start_token = cp_lexer_peek_token (parser->lexer);
14620 if (initialization_kind == CPP_EQ)
14621 initializer = cp_parser_pure_specifier (parser);
14624 /* If the declaration was erroneous, we don't really
14625 know what the user intended, so just silently
14626 consume the initializer. */
14627 if (decl != error_mark_node)
14628 error_at (initializer_start_token->location,
14629 "initializer provided for function");
14630 cp_parser_skip_to_closing_parenthesis (parser,
14631 /*recovering=*/true,
14632 /*or_comma=*/false,
14633 /*consume_paren=*/true);
14638 /* We want to record the extra mangling scope for in-class
14639 initializers of class members and initializers of static data
14640 member templates. The former is a C++0x feature which isn't
14641 implemented yet, and I expect it will involve deferring
14642 parsing of the initializer until end of class as with default
14643 arguments. So right here we only handle the latter. */
14644 if (!member_p && processing_template_decl)
14645 start_lambda_scope (decl);
14646 initializer = cp_parser_initializer (parser,
14648 &is_non_constant_init);
14649 if (!member_p && processing_template_decl)
14650 finish_lambda_scope ();
14654 /* The old parser allows attributes to appear after a parenthesized
14655 initializer. Mark Mitchell proposed removing this functionality
14656 on the GCC mailing lists on 2002-08-13. This parser accepts the
14657 attributes -- but ignores them. */
14658 if (cp_parser_allow_gnu_extensions_p (parser)
14659 && initialization_kind == CPP_OPEN_PAREN)
14660 if (cp_parser_attributes_opt (parser))
14661 warning (OPT_Wattributes,
14662 "attributes after parenthesized initializer ignored");
14664 /* For an in-class declaration, use `grokfield' to create the
14670 pop_scope (pushed_scope);
14671 pushed_scope = NULL_TREE;
14673 decl = grokfield (declarator, decl_specifiers,
14674 initializer, !is_non_constant_init,
14675 /*asmspec=*/NULL_TREE,
14676 prefix_attributes);
14677 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
14678 cp_parser_save_default_args (parser, decl);
14681 /* Finish processing the declaration. But, skip member
14683 if (!member_p && decl && decl != error_mark_node && !range_for_decl_p)
14685 cp_finish_decl (decl,
14686 initializer, !is_non_constant_init,
14688 /* If the initializer is in parentheses, then this is
14689 a direct-initialization, which means that an
14690 `explicit' constructor is OK. Otherwise, an
14691 `explicit' constructor cannot be used. */
14692 ((is_direct_init || !is_initialized)
14693 ? LOOKUP_NORMAL : LOOKUP_IMPLICIT));
14695 else if ((cxx_dialect != cxx98) && friend_p
14696 && decl && TREE_CODE (decl) == FUNCTION_DECL)
14697 /* Core issue #226 (C++0x only): A default template-argument
14698 shall not be specified in a friend class template
14700 check_default_tmpl_args (decl, current_template_parms, /*is_primary=*/1,
14701 /*is_partial=*/0, /*is_friend_decl=*/1);
14703 if (!friend_p && pushed_scope)
14704 pop_scope (pushed_scope);
14709 /* Parse a declarator.
14713 ptr-operator declarator
14715 abstract-declarator:
14716 ptr-operator abstract-declarator [opt]
14717 direct-abstract-declarator
14722 attributes [opt] direct-declarator
14723 attributes [opt] ptr-operator declarator
14725 abstract-declarator:
14726 attributes [opt] ptr-operator abstract-declarator [opt]
14727 attributes [opt] direct-abstract-declarator
14729 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
14730 detect constructor, destructor or conversion operators. It is set
14731 to -1 if the declarator is a name, and +1 if it is a
14732 function. Otherwise it is set to zero. Usually you just want to
14733 test for >0, but internally the negative value is used.
14735 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
14736 a decl-specifier-seq unless it declares a constructor, destructor,
14737 or conversion. It might seem that we could check this condition in
14738 semantic analysis, rather than parsing, but that makes it difficult
14739 to handle something like `f()'. We want to notice that there are
14740 no decl-specifiers, and therefore realize that this is an
14741 expression, not a declaration.)
14743 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
14744 the declarator is a direct-declarator of the form "(...)".
14746 MEMBER_P is true iff this declarator is a member-declarator. */
14748 static cp_declarator *
14749 cp_parser_declarator (cp_parser* parser,
14750 cp_parser_declarator_kind dcl_kind,
14751 int* ctor_dtor_or_conv_p,
14752 bool* parenthesized_p,
14755 cp_declarator *declarator;
14756 enum tree_code code;
14757 cp_cv_quals cv_quals;
14759 tree attributes = NULL_TREE;
14761 /* Assume this is not a constructor, destructor, or type-conversion
14763 if (ctor_dtor_or_conv_p)
14764 *ctor_dtor_or_conv_p = 0;
14766 if (cp_parser_allow_gnu_extensions_p (parser))
14767 attributes = cp_parser_attributes_opt (parser);
14769 /* Check for the ptr-operator production. */
14770 cp_parser_parse_tentatively (parser);
14771 /* Parse the ptr-operator. */
14772 code = cp_parser_ptr_operator (parser,
14775 /* If that worked, then we have a ptr-operator. */
14776 if (cp_parser_parse_definitely (parser))
14778 /* If a ptr-operator was found, then this declarator was not
14780 if (parenthesized_p)
14781 *parenthesized_p = true;
14782 /* The dependent declarator is optional if we are parsing an
14783 abstract-declarator. */
14784 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
14785 cp_parser_parse_tentatively (parser);
14787 /* Parse the dependent declarator. */
14788 declarator = cp_parser_declarator (parser, dcl_kind,
14789 /*ctor_dtor_or_conv_p=*/NULL,
14790 /*parenthesized_p=*/NULL,
14791 /*member_p=*/false);
14793 /* If we are parsing an abstract-declarator, we must handle the
14794 case where the dependent declarator is absent. */
14795 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
14796 && !cp_parser_parse_definitely (parser))
14799 declarator = cp_parser_make_indirect_declarator
14800 (code, class_type, cv_quals, declarator);
14802 /* Everything else is a direct-declarator. */
14805 if (parenthesized_p)
14806 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
14808 declarator = cp_parser_direct_declarator (parser, dcl_kind,
14809 ctor_dtor_or_conv_p,
14813 if (attributes && declarator && declarator != cp_error_declarator)
14814 declarator->attributes = attributes;
14819 /* Parse a direct-declarator or direct-abstract-declarator.
14823 direct-declarator ( parameter-declaration-clause )
14824 cv-qualifier-seq [opt]
14825 exception-specification [opt]
14826 direct-declarator [ constant-expression [opt] ]
14829 direct-abstract-declarator:
14830 direct-abstract-declarator [opt]
14831 ( parameter-declaration-clause )
14832 cv-qualifier-seq [opt]
14833 exception-specification [opt]
14834 direct-abstract-declarator [opt] [ constant-expression [opt] ]
14835 ( abstract-declarator )
14837 Returns a representation of the declarator. DCL_KIND is
14838 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
14839 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
14840 we are parsing a direct-declarator. It is
14841 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
14842 of ambiguity we prefer an abstract declarator, as per
14843 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
14844 cp_parser_declarator. */
14846 static cp_declarator *
14847 cp_parser_direct_declarator (cp_parser* parser,
14848 cp_parser_declarator_kind dcl_kind,
14849 int* ctor_dtor_or_conv_p,
14853 cp_declarator *declarator = NULL;
14854 tree scope = NULL_TREE;
14855 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
14856 bool saved_in_declarator_p = parser->in_declarator_p;
14858 tree pushed_scope = NULL_TREE;
14862 /* Peek at the next token. */
14863 token = cp_lexer_peek_token (parser->lexer);
14864 if (token->type == CPP_OPEN_PAREN)
14866 /* This is either a parameter-declaration-clause, or a
14867 parenthesized declarator. When we know we are parsing a
14868 named declarator, it must be a parenthesized declarator
14869 if FIRST is true. For instance, `(int)' is a
14870 parameter-declaration-clause, with an omitted
14871 direct-abstract-declarator. But `((*))', is a
14872 parenthesized abstract declarator. Finally, when T is a
14873 template parameter `(T)' is a
14874 parameter-declaration-clause, and not a parenthesized
14877 We first try and parse a parameter-declaration-clause,
14878 and then try a nested declarator (if FIRST is true).
14880 It is not an error for it not to be a
14881 parameter-declaration-clause, even when FIRST is
14887 The first is the declaration of a function while the
14888 second is the definition of a variable, including its
14891 Having seen only the parenthesis, we cannot know which of
14892 these two alternatives should be selected. Even more
14893 complex are examples like:
14898 The former is a function-declaration; the latter is a
14899 variable initialization.
14901 Thus again, we try a parameter-declaration-clause, and if
14902 that fails, we back out and return. */
14904 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
14907 unsigned saved_num_template_parameter_lists;
14908 bool is_declarator = false;
14911 /* In a member-declarator, the only valid interpretation
14912 of a parenthesis is the start of a
14913 parameter-declaration-clause. (It is invalid to
14914 initialize a static data member with a parenthesized
14915 initializer; only the "=" form of initialization is
14918 cp_parser_parse_tentatively (parser);
14920 /* Consume the `('. */
14921 cp_lexer_consume_token (parser->lexer);
14924 /* If this is going to be an abstract declarator, we're
14925 in a declarator and we can't have default args. */
14926 parser->default_arg_ok_p = false;
14927 parser->in_declarator_p = true;
14930 /* Inside the function parameter list, surrounding
14931 template-parameter-lists do not apply. */
14932 saved_num_template_parameter_lists
14933 = parser->num_template_parameter_lists;
14934 parser->num_template_parameter_lists = 0;
14936 begin_scope (sk_function_parms, NULL_TREE);
14938 /* Parse the parameter-declaration-clause. */
14939 params = cp_parser_parameter_declaration_clause (parser);
14941 parser->num_template_parameter_lists
14942 = saved_num_template_parameter_lists;
14944 /* Consume the `)'. */
14945 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
14947 /* If all went well, parse the cv-qualifier-seq and the
14948 exception-specification. */
14949 if (member_p || cp_parser_parse_definitely (parser))
14951 cp_cv_quals cv_quals;
14952 cp_virt_specifiers virt_specifiers;
14953 tree exception_specification;
14956 is_declarator = true;
14958 if (ctor_dtor_or_conv_p)
14959 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
14962 /* Parse the cv-qualifier-seq. */
14963 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
14964 /* And the exception-specification. */
14965 exception_specification
14966 = cp_parser_exception_specification_opt (parser);
14967 /* Parse the virt-specifier-seq. */
14968 virt_specifiers = cp_parser_virt_specifier_seq_opt (parser);
14971 = cp_parser_late_return_type_opt (parser);
14973 /* Create the function-declarator. */
14974 declarator = make_call_declarator (declarator,
14978 exception_specification,
14980 /* Any subsequent parameter lists are to do with
14981 return type, so are not those of the declared
14983 parser->default_arg_ok_p = false;
14986 /* Remove the function parms from scope. */
14987 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
14988 pop_binding (DECL_NAME (t), t);
14992 /* Repeat the main loop. */
14996 /* If this is the first, we can try a parenthesized
15000 bool saved_in_type_id_in_expr_p;
15002 parser->default_arg_ok_p = saved_default_arg_ok_p;
15003 parser->in_declarator_p = saved_in_declarator_p;
15005 /* Consume the `('. */
15006 cp_lexer_consume_token (parser->lexer);
15007 /* Parse the nested declarator. */
15008 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15009 parser->in_type_id_in_expr_p = true;
15011 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
15012 /*parenthesized_p=*/NULL,
15014 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15016 /* Expect a `)'. */
15017 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
15018 declarator = cp_error_declarator;
15019 if (declarator == cp_error_declarator)
15022 goto handle_declarator;
15024 /* Otherwise, we must be done. */
15028 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
15029 && token->type == CPP_OPEN_SQUARE)
15031 /* Parse an array-declarator. */
15034 if (ctor_dtor_or_conv_p)
15035 *ctor_dtor_or_conv_p = 0;
15038 parser->default_arg_ok_p = false;
15039 parser->in_declarator_p = true;
15040 /* Consume the `['. */
15041 cp_lexer_consume_token (parser->lexer);
15042 /* Peek at the next token. */
15043 token = cp_lexer_peek_token (parser->lexer);
15044 /* If the next token is `]', then there is no
15045 constant-expression. */
15046 if (token->type != CPP_CLOSE_SQUARE)
15048 bool non_constant_p;
15051 = cp_parser_constant_expression (parser,
15052 /*allow_non_constant=*/true,
15054 if (!non_constant_p)
15056 /* Normally, the array bound must be an integral constant
15057 expression. However, as an extension, we allow VLAs
15058 in function scopes as long as they aren't part of a
15059 parameter declaration. */
15060 else if (!parser->in_function_body
15061 || current_binding_level->kind == sk_function_parms)
15063 cp_parser_error (parser,
15064 "array bound is not an integer constant");
15065 bounds = error_mark_node;
15067 else if (processing_template_decl && !error_operand_p (bounds))
15069 /* Remember this wasn't a constant-expression. */
15070 bounds = build_nop (TREE_TYPE (bounds), bounds);
15071 TREE_SIDE_EFFECTS (bounds) = 1;
15075 bounds = NULL_TREE;
15076 /* Look for the closing `]'. */
15077 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE))
15079 declarator = cp_error_declarator;
15083 declarator = make_array_declarator (declarator, bounds);
15085 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
15088 tree qualifying_scope;
15089 tree unqualified_name;
15090 special_function_kind sfk;
15092 bool pack_expansion_p = false;
15093 cp_token *declarator_id_start_token;
15095 /* Parse a declarator-id */
15096 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
15099 cp_parser_parse_tentatively (parser);
15101 /* If we see an ellipsis, we should be looking at a
15103 if (token->type == CPP_ELLIPSIS)
15105 /* Consume the `...' */
15106 cp_lexer_consume_token (parser->lexer);
15108 pack_expansion_p = true;
15112 declarator_id_start_token = cp_lexer_peek_token (parser->lexer);
15114 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
15115 qualifying_scope = parser->scope;
15120 if (!unqualified_name && pack_expansion_p)
15122 /* Check whether an error occurred. */
15123 okay = !cp_parser_error_occurred (parser);
15125 /* We already consumed the ellipsis to mark a
15126 parameter pack, but we have no way to report it,
15127 so abort the tentative parse. We will be exiting
15128 immediately anyway. */
15129 cp_parser_abort_tentative_parse (parser);
15132 okay = cp_parser_parse_definitely (parser);
15135 unqualified_name = error_mark_node;
15136 else if (unqualified_name
15137 && (qualifying_scope
15138 || (TREE_CODE (unqualified_name)
15139 != IDENTIFIER_NODE)))
15141 cp_parser_error (parser, "expected unqualified-id");
15142 unqualified_name = error_mark_node;
15146 if (!unqualified_name)
15148 if (unqualified_name == error_mark_node)
15150 declarator = cp_error_declarator;
15151 pack_expansion_p = false;
15152 declarator->parameter_pack_p = false;
15156 if (qualifying_scope && at_namespace_scope_p ()
15157 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
15159 /* In the declaration of a member of a template class
15160 outside of the class itself, the SCOPE will sometimes
15161 be a TYPENAME_TYPE. For example, given:
15163 template <typename T>
15164 int S<T>::R::i = 3;
15166 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
15167 this context, we must resolve S<T>::R to an ordinary
15168 type, rather than a typename type.
15170 The reason we normally avoid resolving TYPENAME_TYPEs
15171 is that a specialization of `S' might render
15172 `S<T>::R' not a type. However, if `S' is
15173 specialized, then this `i' will not be used, so there
15174 is no harm in resolving the types here. */
15177 /* Resolve the TYPENAME_TYPE. */
15178 type = resolve_typename_type (qualifying_scope,
15179 /*only_current_p=*/false);
15180 /* If that failed, the declarator is invalid. */
15181 if (TREE_CODE (type) == TYPENAME_TYPE)
15183 if (typedef_variant_p (type))
15184 error_at (declarator_id_start_token->location,
15185 "cannot define member of dependent typedef "
15188 error_at (declarator_id_start_token->location,
15189 "%<%T::%E%> is not a type",
15190 TYPE_CONTEXT (qualifying_scope),
15191 TYPE_IDENTIFIER (qualifying_scope));
15193 qualifying_scope = type;
15198 if (unqualified_name)
15202 if (qualifying_scope
15203 && CLASS_TYPE_P (qualifying_scope))
15204 class_type = qualifying_scope;
15206 class_type = current_class_type;
15208 if (TREE_CODE (unqualified_name) == TYPE_DECL)
15210 tree name_type = TREE_TYPE (unqualified_name);
15211 if (class_type && same_type_p (name_type, class_type))
15213 if (qualifying_scope
15214 && CLASSTYPE_USE_TEMPLATE (name_type))
15216 error_at (declarator_id_start_token->location,
15217 "invalid use of constructor as a template");
15218 inform (declarator_id_start_token->location,
15219 "use %<%T::%D%> instead of %<%T::%D%> to "
15220 "name the constructor in a qualified name",
15222 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
15223 class_type, name_type);
15224 declarator = cp_error_declarator;
15228 unqualified_name = constructor_name (class_type);
15232 /* We do not attempt to print the declarator
15233 here because we do not have enough
15234 information about its original syntactic
15236 cp_parser_error (parser, "invalid declarator");
15237 declarator = cp_error_declarator;
15244 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
15245 sfk = sfk_destructor;
15246 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
15247 sfk = sfk_conversion;
15248 else if (/* There's no way to declare a constructor
15249 for an anonymous type, even if the type
15250 got a name for linkage purposes. */
15251 !TYPE_WAS_ANONYMOUS (class_type)
15252 && constructor_name_p (unqualified_name,
15255 unqualified_name = constructor_name (class_type);
15256 sfk = sfk_constructor;
15258 else if (is_overloaded_fn (unqualified_name)
15259 && DECL_CONSTRUCTOR_P (get_first_fn
15260 (unqualified_name)))
15261 sfk = sfk_constructor;
15263 if (ctor_dtor_or_conv_p && sfk != sfk_none)
15264 *ctor_dtor_or_conv_p = -1;
15267 declarator = make_id_declarator (qualifying_scope,
15270 declarator->id_loc = token->location;
15271 declarator->parameter_pack_p = pack_expansion_p;
15273 if (pack_expansion_p)
15274 maybe_warn_variadic_templates ();
15277 handle_declarator:;
15278 scope = get_scope_of_declarator (declarator);
15280 /* Any names that appear after the declarator-id for a
15281 member are looked up in the containing scope. */
15282 pushed_scope = push_scope (scope);
15283 parser->in_declarator_p = true;
15284 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
15285 || (declarator && declarator->kind == cdk_id))
15286 /* Default args are only allowed on function
15288 parser->default_arg_ok_p = saved_default_arg_ok_p;
15290 parser->default_arg_ok_p = false;
15299 /* For an abstract declarator, we might wind up with nothing at this
15300 point. That's an error; the declarator is not optional. */
15302 cp_parser_error (parser, "expected declarator");
15304 /* If we entered a scope, we must exit it now. */
15306 pop_scope (pushed_scope);
15308 parser->default_arg_ok_p = saved_default_arg_ok_p;
15309 parser->in_declarator_p = saved_in_declarator_p;
15314 /* Parse a ptr-operator.
15317 * cv-qualifier-seq [opt]
15319 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
15324 & cv-qualifier-seq [opt]
15326 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
15327 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
15328 an rvalue reference. In the case of a pointer-to-member, *TYPE is
15329 filled in with the TYPE containing the member. *CV_QUALS is
15330 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
15331 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
15332 Note that the tree codes returned by this function have nothing
15333 to do with the types of trees that will be eventually be created
15334 to represent the pointer or reference type being parsed. They are
15335 just constants with suggestive names. */
15336 static enum tree_code
15337 cp_parser_ptr_operator (cp_parser* parser,
15339 cp_cv_quals *cv_quals)
15341 enum tree_code code = ERROR_MARK;
15344 /* Assume that it's not a pointer-to-member. */
15346 /* And that there are no cv-qualifiers. */
15347 *cv_quals = TYPE_UNQUALIFIED;
15349 /* Peek at the next token. */
15350 token = cp_lexer_peek_token (parser->lexer);
15352 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
15353 if (token->type == CPP_MULT)
15354 code = INDIRECT_REF;
15355 else if (token->type == CPP_AND)
15357 else if ((cxx_dialect != cxx98) &&
15358 token->type == CPP_AND_AND) /* C++0x only */
15359 code = NON_LVALUE_EXPR;
15361 if (code != ERROR_MARK)
15363 /* Consume the `*', `&' or `&&'. */
15364 cp_lexer_consume_token (parser->lexer);
15366 /* A `*' can be followed by a cv-qualifier-seq, and so can a
15367 `&', if we are allowing GNU extensions. (The only qualifier
15368 that can legally appear after `&' is `restrict', but that is
15369 enforced during semantic analysis. */
15370 if (code == INDIRECT_REF
15371 || cp_parser_allow_gnu_extensions_p (parser))
15372 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
15376 /* Try the pointer-to-member case. */
15377 cp_parser_parse_tentatively (parser);
15378 /* Look for the optional `::' operator. */
15379 cp_parser_global_scope_opt (parser,
15380 /*current_scope_valid_p=*/false);
15381 /* Look for the nested-name specifier. */
15382 token = cp_lexer_peek_token (parser->lexer);
15383 cp_parser_nested_name_specifier (parser,
15384 /*typename_keyword_p=*/false,
15385 /*check_dependency_p=*/true,
15387 /*is_declaration=*/false);
15388 /* If we found it, and the next token is a `*', then we are
15389 indeed looking at a pointer-to-member operator. */
15390 if (!cp_parser_error_occurred (parser)
15391 && cp_parser_require (parser, CPP_MULT, RT_MULT))
15393 /* Indicate that the `*' operator was used. */
15394 code = INDIRECT_REF;
15396 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
15397 error_at (token->location, "%qD is a namespace", parser->scope);
15400 /* The type of which the member is a member is given by the
15402 *type = parser->scope;
15403 /* The next name will not be qualified. */
15404 parser->scope = NULL_TREE;
15405 parser->qualifying_scope = NULL_TREE;
15406 parser->object_scope = NULL_TREE;
15407 /* Look for the optional cv-qualifier-seq. */
15408 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
15411 /* If that didn't work we don't have a ptr-operator. */
15412 if (!cp_parser_parse_definitely (parser))
15413 cp_parser_error (parser, "expected ptr-operator");
15419 /* Parse an (optional) cv-qualifier-seq.
15422 cv-qualifier cv-qualifier-seq [opt]
15433 Returns a bitmask representing the cv-qualifiers. */
15436 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
15438 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
15443 cp_cv_quals cv_qualifier;
15445 /* Peek at the next token. */
15446 token = cp_lexer_peek_token (parser->lexer);
15447 /* See if it's a cv-qualifier. */
15448 switch (token->keyword)
15451 cv_qualifier = TYPE_QUAL_CONST;
15455 cv_qualifier = TYPE_QUAL_VOLATILE;
15459 cv_qualifier = TYPE_QUAL_RESTRICT;
15463 cv_qualifier = TYPE_UNQUALIFIED;
15470 if (cv_quals & cv_qualifier)
15472 error_at (token->location, "duplicate cv-qualifier");
15473 cp_lexer_purge_token (parser->lexer);
15477 cp_lexer_consume_token (parser->lexer);
15478 cv_quals |= cv_qualifier;
15485 /* Parse an (optional) virt-specifier-seq.
15487 virt-specifier-seq:
15488 virt-specifier virt-specifier-seq [opt]
15494 Returns a bitmask representing the virt-specifiers. */
15496 static cp_virt_specifiers
15497 cp_parser_virt_specifier_seq_opt (cp_parser* parser)
15499 cp_virt_specifiers virt_specifiers = VIRT_SPEC_UNSPECIFIED;
15504 cp_virt_specifiers virt_specifier;
15506 /* Peek at the next token. */
15507 token = cp_lexer_peek_token (parser->lexer);
15508 /* See if it's a virt-specifier-qualifier. */
15509 if (token->type != CPP_NAME)
15511 if (!strcmp (IDENTIFIER_POINTER(token->u.value), "override"))
15512 virt_specifier = VIRT_SPEC_OVERRIDE;
15513 else if (!strcmp (IDENTIFIER_POINTER(token->u.value), "final"))
15514 virt_specifier = VIRT_SPEC_FINAL;
15518 if (virt_specifiers & virt_specifier)
15520 error_at (token->location, "duplicate virt-specifier");
15521 cp_lexer_purge_token (parser->lexer);
15525 cp_lexer_consume_token (parser->lexer);
15526 virt_specifiers |= virt_specifier;
15529 return virt_specifiers;
15532 /* Parse a late-specified return type, if any. This is not a separate
15533 non-terminal, but part of a function declarator, which looks like
15535 -> trailing-type-specifier-seq abstract-declarator(opt)
15537 Returns the type indicated by the type-id. */
15540 cp_parser_late_return_type_opt (cp_parser* parser)
15544 /* Peek at the next token. */
15545 token = cp_lexer_peek_token (parser->lexer);
15546 /* A late-specified return type is indicated by an initial '->'. */
15547 if (token->type != CPP_DEREF)
15550 /* Consume the ->. */
15551 cp_lexer_consume_token (parser->lexer);
15553 return cp_parser_trailing_type_id (parser);
15556 /* Parse a declarator-id.
15560 :: [opt] nested-name-specifier [opt] type-name
15562 In the `id-expression' case, the value returned is as for
15563 cp_parser_id_expression if the id-expression was an unqualified-id.
15564 If the id-expression was a qualified-id, then a SCOPE_REF is
15565 returned. The first operand is the scope (either a NAMESPACE_DECL
15566 or TREE_TYPE), but the second is still just a representation of an
15570 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
15573 /* The expression must be an id-expression. Assume that qualified
15574 names are the names of types so that:
15577 int S<T>::R::i = 3;
15579 will work; we must treat `S<T>::R' as the name of a type.
15580 Similarly, assume that qualified names are templates, where
15584 int S<T>::R<T>::i = 3;
15587 id = cp_parser_id_expression (parser,
15588 /*template_keyword_p=*/false,
15589 /*check_dependency_p=*/false,
15590 /*template_p=*/NULL,
15591 /*declarator_p=*/true,
15593 if (id && BASELINK_P (id))
15594 id = BASELINK_FUNCTIONS (id);
15598 /* Parse a type-id.
15601 type-specifier-seq abstract-declarator [opt]
15603 Returns the TYPE specified. */
15606 cp_parser_type_id_1 (cp_parser* parser, bool is_template_arg,
15607 bool is_trailing_return)
15609 cp_decl_specifier_seq type_specifier_seq;
15610 cp_declarator *abstract_declarator;
15612 /* Parse the type-specifier-seq. */
15613 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
15614 is_trailing_return,
15615 &type_specifier_seq);
15616 if (type_specifier_seq.type == error_mark_node)
15617 return error_mark_node;
15619 /* There might or might not be an abstract declarator. */
15620 cp_parser_parse_tentatively (parser);
15621 /* Look for the declarator. */
15622 abstract_declarator
15623 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
15624 /*parenthesized_p=*/NULL,
15625 /*member_p=*/false);
15626 /* Check to see if there really was a declarator. */
15627 if (!cp_parser_parse_definitely (parser))
15628 abstract_declarator = NULL;
15630 if (type_specifier_seq.type
15631 && type_uses_auto (type_specifier_seq.type))
15633 /* A type-id with type 'auto' is only ok if the abstract declarator
15634 is a function declarator with a late-specified return type. */
15635 if (abstract_declarator
15636 && abstract_declarator->kind == cdk_function
15637 && abstract_declarator->u.function.late_return_type)
15641 error ("invalid use of %<auto%>");
15642 return error_mark_node;
15646 return groktypename (&type_specifier_seq, abstract_declarator,
15650 static tree cp_parser_type_id (cp_parser *parser)
15652 return cp_parser_type_id_1 (parser, false, false);
15655 static tree cp_parser_template_type_arg (cp_parser *parser)
15658 const char *saved_message = parser->type_definition_forbidden_message;
15659 parser->type_definition_forbidden_message
15660 = G_("types may not be defined in template arguments");
15661 r = cp_parser_type_id_1 (parser, true, false);
15662 parser->type_definition_forbidden_message = saved_message;
15666 static tree cp_parser_trailing_type_id (cp_parser *parser)
15668 return cp_parser_type_id_1 (parser, false, true);
15671 /* Parse a type-specifier-seq.
15673 type-specifier-seq:
15674 type-specifier type-specifier-seq [opt]
15678 type-specifier-seq:
15679 attributes type-specifier-seq [opt]
15681 If IS_DECLARATION is true, we are at the start of a "condition" or
15682 exception-declaration, so we might be followed by a declarator-id.
15684 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
15685 i.e. we've just seen "->".
15687 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
15690 cp_parser_type_specifier_seq (cp_parser* parser,
15691 bool is_declaration,
15692 bool is_trailing_return,
15693 cp_decl_specifier_seq *type_specifier_seq)
15695 bool seen_type_specifier = false;
15696 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
15697 cp_token *start_token = NULL;
15699 /* Clear the TYPE_SPECIFIER_SEQ. */
15700 clear_decl_specs (type_specifier_seq);
15702 /* In the context of a trailing return type, enum E { } is an
15703 elaborated-type-specifier followed by a function-body, not an
15705 if (is_trailing_return)
15706 flags |= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS;
15708 /* Parse the type-specifiers and attributes. */
15711 tree type_specifier;
15712 bool is_cv_qualifier;
15714 /* Check for attributes first. */
15715 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
15717 type_specifier_seq->attributes =
15718 chainon (type_specifier_seq->attributes,
15719 cp_parser_attributes_opt (parser));
15723 /* record the token of the beginning of the type specifier seq,
15724 for error reporting purposes*/
15726 start_token = cp_lexer_peek_token (parser->lexer);
15728 /* Look for the type-specifier. */
15729 type_specifier = cp_parser_type_specifier (parser,
15731 type_specifier_seq,
15732 /*is_declaration=*/false,
15735 if (!type_specifier)
15737 /* If the first type-specifier could not be found, this is not a
15738 type-specifier-seq at all. */
15739 if (!seen_type_specifier)
15741 cp_parser_error (parser, "expected type-specifier");
15742 type_specifier_seq->type = error_mark_node;
15745 /* If subsequent type-specifiers could not be found, the
15746 type-specifier-seq is complete. */
15750 seen_type_specifier = true;
15751 /* The standard says that a condition can be:
15753 type-specifier-seq declarator = assignment-expression
15760 we should treat the "S" as a declarator, not as a
15761 type-specifier. The standard doesn't say that explicitly for
15762 type-specifier-seq, but it does say that for
15763 decl-specifier-seq in an ordinary declaration. Perhaps it
15764 would be clearer just to allow a decl-specifier-seq here, and
15765 then add a semantic restriction that if any decl-specifiers
15766 that are not type-specifiers appear, the program is invalid. */
15767 if (is_declaration && !is_cv_qualifier)
15768 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
15771 cp_parser_check_decl_spec (type_specifier_seq, start_token->location);
15774 /* Parse a parameter-declaration-clause.
15776 parameter-declaration-clause:
15777 parameter-declaration-list [opt] ... [opt]
15778 parameter-declaration-list , ...
15780 Returns a representation for the parameter declarations. A return
15781 value of NULL indicates a parameter-declaration-clause consisting
15782 only of an ellipsis. */
15785 cp_parser_parameter_declaration_clause (cp_parser* parser)
15792 /* Peek at the next token. */
15793 token = cp_lexer_peek_token (parser->lexer);
15794 /* Check for trivial parameter-declaration-clauses. */
15795 if (token->type == CPP_ELLIPSIS)
15797 /* Consume the `...' token. */
15798 cp_lexer_consume_token (parser->lexer);
15801 else if (token->type == CPP_CLOSE_PAREN)
15802 /* There are no parameters. */
15804 #ifndef NO_IMPLICIT_EXTERN_C
15805 if (in_system_header && current_class_type == NULL
15806 && current_lang_name == lang_name_c)
15810 return void_list_node;
15812 /* Check for `(void)', too, which is a special case. */
15813 else if (token->keyword == RID_VOID
15814 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
15815 == CPP_CLOSE_PAREN))
15817 /* Consume the `void' token. */
15818 cp_lexer_consume_token (parser->lexer);
15819 /* There are no parameters. */
15820 return void_list_node;
15823 /* Parse the parameter-declaration-list. */
15824 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
15825 /* If a parse error occurred while parsing the
15826 parameter-declaration-list, then the entire
15827 parameter-declaration-clause is erroneous. */
15831 /* Peek at the next token. */
15832 token = cp_lexer_peek_token (parser->lexer);
15833 /* If it's a `,', the clause should terminate with an ellipsis. */
15834 if (token->type == CPP_COMMA)
15836 /* Consume the `,'. */
15837 cp_lexer_consume_token (parser->lexer);
15838 /* Expect an ellipsis. */
15840 = (cp_parser_require (parser, CPP_ELLIPSIS, RT_ELLIPSIS) != NULL);
15842 /* It might also be `...' if the optional trailing `,' was
15844 else if (token->type == CPP_ELLIPSIS)
15846 /* Consume the `...' token. */
15847 cp_lexer_consume_token (parser->lexer);
15848 /* And remember that we saw it. */
15852 ellipsis_p = false;
15854 /* Finish the parameter list. */
15856 parameters = chainon (parameters, void_list_node);
15861 /* Parse a parameter-declaration-list.
15863 parameter-declaration-list:
15864 parameter-declaration
15865 parameter-declaration-list , parameter-declaration
15867 Returns a representation of the parameter-declaration-list, as for
15868 cp_parser_parameter_declaration_clause. However, the
15869 `void_list_node' is never appended to the list. Upon return,
15870 *IS_ERROR will be true iff an error occurred. */
15873 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
15875 tree parameters = NULL_TREE;
15876 tree *tail = ¶meters;
15877 bool saved_in_unbraced_linkage_specification_p;
15880 /* Assume all will go well. */
15882 /* The special considerations that apply to a function within an
15883 unbraced linkage specifications do not apply to the parameters
15884 to the function. */
15885 saved_in_unbraced_linkage_specification_p
15886 = parser->in_unbraced_linkage_specification_p;
15887 parser->in_unbraced_linkage_specification_p = false;
15889 /* Look for more parameters. */
15892 cp_parameter_declarator *parameter;
15893 tree decl = error_mark_node;
15894 bool parenthesized_p;
15895 /* Parse the parameter. */
15897 = cp_parser_parameter_declaration (parser,
15898 /*template_parm_p=*/false,
15901 /* We don't know yet if the enclosing context is deprecated, so wait
15902 and warn in grokparms if appropriate. */
15903 deprecated_state = DEPRECATED_SUPPRESS;
15906 decl = grokdeclarator (parameter->declarator,
15907 ¶meter->decl_specifiers,
15909 parameter->default_argument != NULL_TREE,
15910 ¶meter->decl_specifiers.attributes);
15912 deprecated_state = DEPRECATED_NORMAL;
15914 /* If a parse error occurred parsing the parameter declaration,
15915 then the entire parameter-declaration-list is erroneous. */
15916 if (decl == error_mark_node)
15919 parameters = error_mark_node;
15923 if (parameter->decl_specifiers.attributes)
15924 cplus_decl_attributes (&decl,
15925 parameter->decl_specifiers.attributes,
15927 if (DECL_NAME (decl))
15928 decl = pushdecl (decl);
15930 if (decl != error_mark_node)
15932 retrofit_lang_decl (decl);
15933 DECL_PARM_INDEX (decl) = ++index;
15934 DECL_PARM_LEVEL (decl) = function_parm_depth ();
15937 /* Add the new parameter to the list. */
15938 *tail = build_tree_list (parameter->default_argument, decl);
15939 tail = &TREE_CHAIN (*tail);
15941 /* Peek at the next token. */
15942 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
15943 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
15944 /* These are for Objective-C++ */
15945 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15946 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
15947 /* The parameter-declaration-list is complete. */
15949 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
15953 /* Peek at the next token. */
15954 token = cp_lexer_peek_nth_token (parser->lexer, 2);
15955 /* If it's an ellipsis, then the list is complete. */
15956 if (token->type == CPP_ELLIPSIS)
15958 /* Otherwise, there must be more parameters. Consume the
15960 cp_lexer_consume_token (parser->lexer);
15961 /* When parsing something like:
15963 int i(float f, double d)
15965 we can tell after seeing the declaration for "f" that we
15966 are not looking at an initialization of a variable "i",
15967 but rather at the declaration of a function "i".
15969 Due to the fact that the parsing of template arguments
15970 (as specified to a template-id) requires backtracking we
15971 cannot use this technique when inside a template argument
15973 if (!parser->in_template_argument_list_p
15974 && !parser->in_type_id_in_expr_p
15975 && cp_parser_uncommitted_to_tentative_parse_p (parser)
15976 /* However, a parameter-declaration of the form
15977 "foat(f)" (which is a valid declaration of a
15978 parameter "f") can also be interpreted as an
15979 expression (the conversion of "f" to "float"). */
15980 && !parenthesized_p)
15981 cp_parser_commit_to_tentative_parse (parser);
15985 cp_parser_error (parser, "expected %<,%> or %<...%>");
15986 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
15987 cp_parser_skip_to_closing_parenthesis (parser,
15988 /*recovering=*/true,
15989 /*or_comma=*/false,
15990 /*consume_paren=*/false);
15995 parser->in_unbraced_linkage_specification_p
15996 = saved_in_unbraced_linkage_specification_p;
16001 /* Parse a parameter declaration.
16003 parameter-declaration:
16004 decl-specifier-seq ... [opt] declarator
16005 decl-specifier-seq declarator = assignment-expression
16006 decl-specifier-seq ... [opt] abstract-declarator [opt]
16007 decl-specifier-seq abstract-declarator [opt] = assignment-expression
16009 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
16010 declares a template parameter. (In that case, a non-nested `>'
16011 token encountered during the parsing of the assignment-expression
16012 is not interpreted as a greater-than operator.)
16014 Returns a representation of the parameter, or NULL if an error
16015 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
16016 true iff the declarator is of the form "(p)". */
16018 static cp_parameter_declarator *
16019 cp_parser_parameter_declaration (cp_parser *parser,
16020 bool template_parm_p,
16021 bool *parenthesized_p)
16023 int declares_class_or_enum;
16024 cp_decl_specifier_seq decl_specifiers;
16025 cp_declarator *declarator;
16026 tree default_argument;
16027 cp_token *token = NULL, *declarator_token_start = NULL;
16028 const char *saved_message;
16030 /* In a template parameter, `>' is not an operator.
16034 When parsing a default template-argument for a non-type
16035 template-parameter, the first non-nested `>' is taken as the end
16036 of the template parameter-list rather than a greater-than
16039 /* Type definitions may not appear in parameter types. */
16040 saved_message = parser->type_definition_forbidden_message;
16041 parser->type_definition_forbidden_message
16042 = G_("types may not be defined in parameter types");
16044 /* Parse the declaration-specifiers. */
16045 cp_parser_decl_specifier_seq (parser,
16046 CP_PARSER_FLAGS_NONE,
16048 &declares_class_or_enum);
16050 /* Complain about missing 'typename' or other invalid type names. */
16051 if (!decl_specifiers.any_type_specifiers_p)
16052 cp_parser_parse_and_diagnose_invalid_type_name (parser);
16054 /* If an error occurred, there's no reason to attempt to parse the
16055 rest of the declaration. */
16056 if (cp_parser_error_occurred (parser))
16058 parser->type_definition_forbidden_message = saved_message;
16062 /* Peek at the next token. */
16063 token = cp_lexer_peek_token (parser->lexer);
16065 /* If the next token is a `)', `,', `=', `>', or `...', then there
16066 is no declarator. However, when variadic templates are enabled,
16067 there may be a declarator following `...'. */
16068 if (token->type == CPP_CLOSE_PAREN
16069 || token->type == CPP_COMMA
16070 || token->type == CPP_EQ
16071 || token->type == CPP_GREATER)
16074 if (parenthesized_p)
16075 *parenthesized_p = false;
16077 /* Otherwise, there should be a declarator. */
16080 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
16081 parser->default_arg_ok_p = false;
16083 /* After seeing a decl-specifier-seq, if the next token is not a
16084 "(", there is no possibility that the code is a valid
16085 expression. Therefore, if parsing tentatively, we commit at
16087 if (!parser->in_template_argument_list_p
16088 /* In an expression context, having seen:
16092 we cannot be sure whether we are looking at a
16093 function-type (taking a "char" as a parameter) or a cast
16094 of some object of type "char" to "int". */
16095 && !parser->in_type_id_in_expr_p
16096 && cp_parser_uncommitted_to_tentative_parse_p (parser)
16097 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
16098 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
16099 cp_parser_commit_to_tentative_parse (parser);
16100 /* Parse the declarator. */
16101 declarator_token_start = token;
16102 declarator = cp_parser_declarator (parser,
16103 CP_PARSER_DECLARATOR_EITHER,
16104 /*ctor_dtor_or_conv_p=*/NULL,
16106 /*member_p=*/false);
16107 parser->default_arg_ok_p = saved_default_arg_ok_p;
16108 /* After the declarator, allow more attributes. */
16109 decl_specifiers.attributes
16110 = chainon (decl_specifiers.attributes,
16111 cp_parser_attributes_opt (parser));
16114 /* If the next token is an ellipsis, and we have not seen a
16115 declarator name, and the type of the declarator contains parameter
16116 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
16117 a parameter pack expansion expression. Otherwise, leave the
16118 ellipsis for a C-style variadic function. */
16119 token = cp_lexer_peek_token (parser->lexer);
16120 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
16122 tree type = decl_specifiers.type;
16124 if (type && DECL_P (type))
16125 type = TREE_TYPE (type);
16128 && TREE_CODE (type) != TYPE_PACK_EXPANSION
16129 && declarator_can_be_parameter_pack (declarator)
16130 && (!declarator || !declarator->parameter_pack_p)
16131 && uses_parameter_packs (type))
16133 /* Consume the `...'. */
16134 cp_lexer_consume_token (parser->lexer);
16135 maybe_warn_variadic_templates ();
16137 /* Build a pack expansion type */
16139 declarator->parameter_pack_p = true;
16141 decl_specifiers.type = make_pack_expansion (type);
16145 /* The restriction on defining new types applies only to the type
16146 of the parameter, not to the default argument. */
16147 parser->type_definition_forbidden_message = saved_message;
16149 /* If the next token is `=', then process a default argument. */
16150 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
16152 /* Consume the `='. */
16153 cp_lexer_consume_token (parser->lexer);
16155 /* If we are defining a class, then the tokens that make up the
16156 default argument must be saved and processed later. */
16157 if (!template_parm_p && at_class_scope_p ()
16158 && TYPE_BEING_DEFINED (current_class_type)
16159 && !LAMBDA_TYPE_P (current_class_type))
16161 unsigned depth = 0;
16162 int maybe_template_id = 0;
16163 cp_token *first_token;
16166 /* Add tokens until we have processed the entire default
16167 argument. We add the range [first_token, token). */
16168 first_token = cp_lexer_peek_token (parser->lexer);
16173 /* Peek at the next token. */
16174 token = cp_lexer_peek_token (parser->lexer);
16175 /* What we do depends on what token we have. */
16176 switch (token->type)
16178 /* In valid code, a default argument must be
16179 immediately followed by a `,' `)', or `...'. */
16181 if (depth == 0 && maybe_template_id)
16183 /* If we've seen a '<', we might be in a
16184 template-argument-list. Until Core issue 325 is
16185 resolved, we don't know how this situation ought
16186 to be handled, so try to DTRT. We check whether
16187 what comes after the comma is a valid parameter
16188 declaration list. If it is, then the comma ends
16189 the default argument; otherwise the default
16190 argument continues. */
16191 bool error = false;
16194 /* Set ITALP so cp_parser_parameter_declaration_list
16195 doesn't decide to commit to this parse. */
16196 bool saved_italp = parser->in_template_argument_list_p;
16197 parser->in_template_argument_list_p = true;
16199 cp_parser_parse_tentatively (parser);
16200 cp_lexer_consume_token (parser->lexer);
16201 begin_scope (sk_function_parms, NULL_TREE);
16202 cp_parser_parameter_declaration_list (parser, &error);
16203 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
16204 pop_binding (DECL_NAME (t), t);
16206 if (!cp_parser_error_occurred (parser) && !error)
16208 cp_parser_abort_tentative_parse (parser);
16210 parser->in_template_argument_list_p = saved_italp;
16213 case CPP_CLOSE_PAREN:
16215 /* If we run into a non-nested `;', `}', or `]',
16216 then the code is invalid -- but the default
16217 argument is certainly over. */
16218 case CPP_SEMICOLON:
16219 case CPP_CLOSE_BRACE:
16220 case CPP_CLOSE_SQUARE:
16223 /* Update DEPTH, if necessary. */
16224 else if (token->type == CPP_CLOSE_PAREN
16225 || token->type == CPP_CLOSE_BRACE
16226 || token->type == CPP_CLOSE_SQUARE)
16230 case CPP_OPEN_PAREN:
16231 case CPP_OPEN_SQUARE:
16232 case CPP_OPEN_BRACE:
16238 /* This might be the comparison operator, or it might
16239 start a template argument list. */
16240 ++maybe_template_id;
16244 if (cxx_dialect == cxx98)
16246 /* Fall through for C++0x, which treats the `>>'
16247 operator like two `>' tokens in certain
16253 /* This might be an operator, or it might close a
16254 template argument list. But if a previous '<'
16255 started a template argument list, this will have
16256 closed it, so we can't be in one anymore. */
16257 maybe_template_id -= 1 + (token->type == CPP_RSHIFT);
16258 if (maybe_template_id < 0)
16259 maybe_template_id = 0;
16263 /* If we run out of tokens, issue an error message. */
16265 case CPP_PRAGMA_EOL:
16266 error_at (token->location, "file ends in default argument");
16272 /* In these cases, we should look for template-ids.
16273 For example, if the default argument is
16274 `X<int, double>()', we need to do name lookup to
16275 figure out whether or not `X' is a template; if
16276 so, the `,' does not end the default argument.
16278 That is not yet done. */
16285 /* If we've reached the end, stop. */
16289 /* Add the token to the token block. */
16290 token = cp_lexer_consume_token (parser->lexer);
16293 /* Create a DEFAULT_ARG to represent the unparsed default
16295 default_argument = make_node (DEFAULT_ARG);
16296 DEFARG_TOKENS (default_argument)
16297 = cp_token_cache_new (first_token, token);
16298 DEFARG_INSTANTIATIONS (default_argument) = NULL;
16300 /* Outside of a class definition, we can just parse the
16301 assignment-expression. */
16304 token = cp_lexer_peek_token (parser->lexer);
16306 = cp_parser_default_argument (parser, template_parm_p);
16309 if (!parser->default_arg_ok_p)
16311 if (flag_permissive)
16312 warning (0, "deprecated use of default argument for parameter of non-function");
16315 error_at (token->location,
16316 "default arguments are only "
16317 "permitted for function parameters");
16318 default_argument = NULL_TREE;
16321 else if ((declarator && declarator->parameter_pack_p)
16322 || (decl_specifiers.type
16323 && PACK_EXPANSION_P (decl_specifiers.type)))
16325 /* Find the name of the parameter pack. */
16326 cp_declarator *id_declarator = declarator;
16327 while (id_declarator && id_declarator->kind != cdk_id)
16328 id_declarator = id_declarator->declarator;
16330 if (id_declarator && id_declarator->kind == cdk_id)
16331 error_at (declarator_token_start->location,
16333 ? "template parameter pack %qD"
16334 " cannot have a default argument"
16335 : "parameter pack %qD cannot have a default argument",
16336 id_declarator->u.id.unqualified_name);
16338 error_at (declarator_token_start->location,
16340 ? "template parameter pack cannot have a default argument"
16341 : "parameter pack cannot have a default argument");
16343 default_argument = NULL_TREE;
16347 default_argument = NULL_TREE;
16349 return make_parameter_declarator (&decl_specifiers,
16354 /* Parse a default argument and return it.
16356 TEMPLATE_PARM_P is true if this is a default argument for a
16357 non-type template parameter. */
16359 cp_parser_default_argument (cp_parser *parser, bool template_parm_p)
16361 tree default_argument = NULL_TREE;
16362 bool saved_greater_than_is_operator_p;
16363 bool saved_local_variables_forbidden_p;
16365 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
16367 saved_greater_than_is_operator_p = parser->greater_than_is_operator_p;
16368 parser->greater_than_is_operator_p = !template_parm_p;
16369 /* Local variable names (and the `this' keyword) may not
16370 appear in a default argument. */
16371 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
16372 parser->local_variables_forbidden_p = true;
16373 /* Parse the assignment-expression. */
16374 if (template_parm_p)
16375 push_deferring_access_checks (dk_no_deferred);
16377 = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
16378 if (template_parm_p)
16379 pop_deferring_access_checks ();
16380 parser->greater_than_is_operator_p = saved_greater_than_is_operator_p;
16381 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
16383 return default_argument;
16386 /* Parse a function-body.
16389 compound_statement */
16392 cp_parser_function_body (cp_parser *parser)
16394 cp_parser_compound_statement (parser, NULL, false, true);
16397 /* Parse a ctor-initializer-opt followed by a function-body. Return
16398 true if a ctor-initializer was present. */
16401 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
16404 bool ctor_initializer_p;
16405 const bool check_body_p =
16406 DECL_CONSTRUCTOR_P (current_function_decl)
16407 && DECL_DECLARED_CONSTEXPR_P (current_function_decl);
16410 /* Begin the function body. */
16411 body = begin_function_body ();
16412 /* Parse the optional ctor-initializer. */
16413 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
16415 /* If we're parsing a constexpr constructor definition, we need
16416 to check that the constructor body is indeed empty. However,
16417 before we get to cp_parser_function_body lot of junk has been
16418 generated, so we can't just check that we have an empty block.
16419 Rather we take a snapshot of the outermost block, and check whether
16420 cp_parser_function_body changed its state. */
16424 if (TREE_CODE (list) == BIND_EXPR)
16425 list = BIND_EXPR_BODY (list);
16426 if (TREE_CODE (list) == STATEMENT_LIST
16427 && STATEMENT_LIST_TAIL (list) != NULL)
16428 last = STATEMENT_LIST_TAIL (list)->stmt;
16430 /* Parse the function-body. */
16431 cp_parser_function_body (parser);
16433 check_constexpr_ctor_body (last, list);
16434 /* Finish the function body. */
16435 finish_function_body (body);
16437 return ctor_initializer_p;
16440 /* Parse an initializer.
16443 = initializer-clause
16444 ( expression-list )
16446 Returns an expression representing the initializer. If no
16447 initializer is present, NULL_TREE is returned.
16449 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
16450 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
16451 set to TRUE if there is no initializer present. If there is an
16452 initializer, and it is not a constant-expression, *NON_CONSTANT_P
16453 is set to true; otherwise it is set to false. */
16456 cp_parser_initializer (cp_parser* parser, bool* is_direct_init,
16457 bool* non_constant_p)
16462 /* Peek at the next token. */
16463 token = cp_lexer_peek_token (parser->lexer);
16465 /* Let our caller know whether or not this initializer was
16467 *is_direct_init = (token->type != CPP_EQ);
16468 /* Assume that the initializer is constant. */
16469 *non_constant_p = false;
16471 if (token->type == CPP_EQ)
16473 /* Consume the `='. */
16474 cp_lexer_consume_token (parser->lexer);
16475 /* Parse the initializer-clause. */
16476 init = cp_parser_initializer_clause (parser, non_constant_p);
16478 else if (token->type == CPP_OPEN_PAREN)
16481 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
16483 /*allow_expansion_p=*/true,
16486 return error_mark_node;
16487 init = build_tree_list_vec (vec);
16488 release_tree_vector (vec);
16490 else if (token->type == CPP_OPEN_BRACE)
16492 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
16493 init = cp_parser_braced_list (parser, non_constant_p);
16494 CONSTRUCTOR_IS_DIRECT_INIT (init) = 1;
16498 /* Anything else is an error. */
16499 cp_parser_error (parser, "expected initializer");
16500 init = error_mark_node;
16506 /* Parse an initializer-clause.
16508 initializer-clause:
16509 assignment-expression
16512 Returns an expression representing the initializer.
16514 If the `assignment-expression' production is used the value
16515 returned is simply a representation for the expression.
16517 Otherwise, calls cp_parser_braced_list. */
16520 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
16524 /* Assume the expression is constant. */
16525 *non_constant_p = false;
16527 /* If it is not a `{', then we are looking at an
16528 assignment-expression. */
16529 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
16532 = cp_parser_constant_expression (parser,
16533 /*allow_non_constant_p=*/true,
16535 if (!*non_constant_p)
16537 /* We only want to fold if this is really a constant
16538 expression. FIXME Actually, we don't want to fold here, but in
16540 tree folded = fold_non_dependent_expr (initializer);
16541 folded = maybe_constant_value (folded);
16542 if (TREE_CONSTANT (folded))
16543 initializer = folded;
16547 initializer = cp_parser_braced_list (parser, non_constant_p);
16549 return initializer;
16552 /* Parse a brace-enclosed initializer list.
16555 { initializer-list , [opt] }
16558 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
16559 the elements of the initializer-list (or NULL, if the last
16560 production is used). The TREE_TYPE for the CONSTRUCTOR will be
16561 NULL_TREE. There is no way to detect whether or not the optional
16562 trailing `,' was provided. NON_CONSTANT_P is as for
16563 cp_parser_initializer. */
16566 cp_parser_braced_list (cp_parser* parser, bool* non_constant_p)
16570 /* Consume the `{' token. */
16571 cp_lexer_consume_token (parser->lexer);
16572 /* Create a CONSTRUCTOR to represent the braced-initializer. */
16573 initializer = make_node (CONSTRUCTOR);
16574 /* If it's not a `}', then there is a non-trivial initializer. */
16575 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
16577 /* Parse the initializer list. */
16578 CONSTRUCTOR_ELTS (initializer)
16579 = cp_parser_initializer_list (parser, non_constant_p);
16580 /* A trailing `,' token is allowed. */
16581 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
16582 cp_lexer_consume_token (parser->lexer);
16584 /* Now, there should be a trailing `}'. */
16585 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
16586 TREE_TYPE (initializer) = init_list_type_node;
16587 return initializer;
16590 /* Parse an initializer-list.
16593 initializer-clause ... [opt]
16594 initializer-list , initializer-clause ... [opt]
16599 identifier : initializer-clause
16600 initializer-list, identifier : initializer-clause
16602 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
16603 for the initializer. If the INDEX of the elt is non-NULL, it is the
16604 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
16605 as for cp_parser_initializer. */
16607 static VEC(constructor_elt,gc) *
16608 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
16610 VEC(constructor_elt,gc) *v = NULL;
16612 /* Assume all of the expressions are constant. */
16613 *non_constant_p = false;
16615 /* Parse the rest of the list. */
16621 bool clause_non_constant_p;
16623 /* If the next token is an identifier and the following one is a
16624 colon, we are looking at the GNU designated-initializer
16626 if (cp_parser_allow_gnu_extensions_p (parser)
16627 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
16628 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
16630 /* Warn the user that they are using an extension. */
16631 pedwarn (input_location, OPT_pedantic,
16632 "ISO C++ does not allow designated initializers");
16633 /* Consume the identifier. */
16634 identifier = cp_lexer_consume_token (parser->lexer)->u.value;
16635 /* Consume the `:'. */
16636 cp_lexer_consume_token (parser->lexer);
16639 identifier = NULL_TREE;
16641 /* Parse the initializer. */
16642 initializer = cp_parser_initializer_clause (parser,
16643 &clause_non_constant_p);
16644 /* If any clause is non-constant, so is the entire initializer. */
16645 if (clause_non_constant_p)
16646 *non_constant_p = true;
16648 /* If we have an ellipsis, this is an initializer pack
16650 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
16652 /* Consume the `...'. */
16653 cp_lexer_consume_token (parser->lexer);
16655 /* Turn the initializer into an initializer expansion. */
16656 initializer = make_pack_expansion (initializer);
16659 /* Add it to the vector. */
16660 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
16662 /* If the next token is not a comma, we have reached the end of
16664 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
16667 /* Peek at the next token. */
16668 token = cp_lexer_peek_nth_token (parser->lexer, 2);
16669 /* If the next token is a `}', then we're still done. An
16670 initializer-clause can have a trailing `,' after the
16671 initializer-list and before the closing `}'. */
16672 if (token->type == CPP_CLOSE_BRACE)
16675 /* Consume the `,' token. */
16676 cp_lexer_consume_token (parser->lexer);
16682 /* Classes [gram.class] */
16684 /* Parse a class-name.
16690 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
16691 to indicate that names looked up in dependent types should be
16692 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
16693 keyword has been used to indicate that the name that appears next
16694 is a template. TAG_TYPE indicates the explicit tag given before
16695 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
16696 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
16697 is the class being defined in a class-head.
16699 Returns the TYPE_DECL representing the class. */
16702 cp_parser_class_name (cp_parser *parser,
16703 bool typename_keyword_p,
16704 bool template_keyword_p,
16705 enum tag_types tag_type,
16706 bool check_dependency_p,
16708 bool is_declaration)
16714 tree identifier = NULL_TREE;
16716 /* All class-names start with an identifier. */
16717 token = cp_lexer_peek_token (parser->lexer);
16718 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
16720 cp_parser_error (parser, "expected class-name");
16721 return error_mark_node;
16724 /* PARSER->SCOPE can be cleared when parsing the template-arguments
16725 to a template-id, so we save it here. */
16726 scope = parser->scope;
16727 if (scope == error_mark_node)
16728 return error_mark_node;
16730 /* Any name names a type if we're following the `typename' keyword
16731 in a qualified name where the enclosing scope is type-dependent. */
16732 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
16733 && dependent_type_p (scope));
16734 /* Handle the common case (an identifier, but not a template-id)
16736 if (token->type == CPP_NAME
16737 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
16739 cp_token *identifier_token;
16742 /* Look for the identifier. */
16743 identifier_token = cp_lexer_peek_token (parser->lexer);
16744 ambiguous_p = identifier_token->ambiguous_p;
16745 identifier = cp_parser_identifier (parser);
16746 /* If the next token isn't an identifier, we are certainly not
16747 looking at a class-name. */
16748 if (identifier == error_mark_node)
16749 decl = error_mark_node;
16750 /* If we know this is a type-name, there's no need to look it
16752 else if (typename_p)
16756 tree ambiguous_decls;
16757 /* If we already know that this lookup is ambiguous, then
16758 we've already issued an error message; there's no reason
16762 cp_parser_simulate_error (parser);
16763 return error_mark_node;
16765 /* If the next token is a `::', then the name must be a type
16768 [basic.lookup.qual]
16770 During the lookup for a name preceding the :: scope
16771 resolution operator, object, function, and enumerator
16772 names are ignored. */
16773 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
16774 tag_type = typename_type;
16775 /* Look up the name. */
16776 decl = cp_parser_lookup_name (parser, identifier,
16778 /*is_template=*/false,
16779 /*is_namespace=*/false,
16780 check_dependency_p,
16782 identifier_token->location);
16783 if (ambiguous_decls)
16785 if (cp_parser_parsing_tentatively (parser))
16786 cp_parser_simulate_error (parser);
16787 return error_mark_node;
16793 /* Try a template-id. */
16794 decl = cp_parser_template_id (parser, template_keyword_p,
16795 check_dependency_p,
16797 if (decl == error_mark_node)
16798 return error_mark_node;
16801 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
16803 /* If this is a typename, create a TYPENAME_TYPE. */
16804 if (typename_p && decl != error_mark_node)
16806 decl = make_typename_type (scope, decl, typename_type,
16807 /*complain=*/tf_error);
16808 if (decl != error_mark_node)
16809 decl = TYPE_NAME (decl);
16812 /* Check to see that it is really the name of a class. */
16813 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
16814 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
16815 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
16816 /* Situations like this:
16818 template <typename T> struct A {
16819 typename T::template X<int>::I i;
16822 are problematic. Is `T::template X<int>' a class-name? The
16823 standard does not seem to be definitive, but there is no other
16824 valid interpretation of the following `::'. Therefore, those
16825 names are considered class-names. */
16827 decl = make_typename_type (scope, decl, tag_type, tf_error);
16828 if (decl != error_mark_node)
16829 decl = TYPE_NAME (decl);
16831 else if (TREE_CODE (decl) != TYPE_DECL
16832 || TREE_TYPE (decl) == error_mark_node
16833 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl))
16834 /* In Objective-C 2.0, a classname followed by '.' starts a
16835 dot-syntax expression, and it's not a type-name. */
16836 || (c_dialect_objc ()
16837 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT
16838 && objc_is_class_name (decl)))
16839 decl = error_mark_node;
16841 if (decl == error_mark_node)
16842 cp_parser_error (parser, "expected class-name");
16843 else if (identifier && !parser->scope)
16844 maybe_note_name_used_in_class (identifier, decl);
16849 /* Parse a class-specifier.
16852 class-head { member-specification [opt] }
16854 Returns the TREE_TYPE representing the class. */
16857 cp_parser_class_specifier_1 (cp_parser* parser)
16860 tree attributes = NULL_TREE;
16861 bool nested_name_specifier_p;
16862 unsigned saved_num_template_parameter_lists;
16863 bool saved_in_function_body;
16864 bool saved_in_unbraced_linkage_specification_p;
16865 tree old_scope = NULL_TREE;
16866 tree scope = NULL_TREE;
16868 cp_token *closing_brace;
16870 push_deferring_access_checks (dk_no_deferred);
16872 /* Parse the class-head. */
16873 type = cp_parser_class_head (parser,
16874 &nested_name_specifier_p,
16877 /* If the class-head was a semantic disaster, skip the entire body
16881 cp_parser_skip_to_end_of_block_or_statement (parser);
16882 pop_deferring_access_checks ();
16883 return error_mark_node;
16886 /* Look for the `{'. */
16887 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
16889 pop_deferring_access_checks ();
16890 return error_mark_node;
16893 /* Process the base classes. If they're invalid, skip the
16894 entire class body. */
16895 if (!xref_basetypes (type, bases))
16897 /* Consuming the closing brace yields better error messages
16899 if (cp_parser_skip_to_closing_brace (parser))
16900 cp_lexer_consume_token (parser->lexer);
16901 pop_deferring_access_checks ();
16902 return error_mark_node;
16905 /* Issue an error message if type-definitions are forbidden here. */
16906 cp_parser_check_type_definition (parser);
16907 /* Remember that we are defining one more class. */
16908 ++parser->num_classes_being_defined;
16909 /* Inside the class, surrounding template-parameter-lists do not
16911 saved_num_template_parameter_lists
16912 = parser->num_template_parameter_lists;
16913 parser->num_template_parameter_lists = 0;
16914 /* We are not in a function body. */
16915 saved_in_function_body = parser->in_function_body;
16916 parser->in_function_body = false;
16917 /* We are not immediately inside an extern "lang" block. */
16918 saved_in_unbraced_linkage_specification_p
16919 = parser->in_unbraced_linkage_specification_p;
16920 parser->in_unbraced_linkage_specification_p = false;
16922 /* Start the class. */
16923 if (nested_name_specifier_p)
16925 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
16926 old_scope = push_inner_scope (scope);
16928 type = begin_class_definition (type, attributes);
16930 if (type == error_mark_node)
16931 /* If the type is erroneous, skip the entire body of the class. */
16932 cp_parser_skip_to_closing_brace (parser);
16934 /* Parse the member-specification. */
16935 cp_parser_member_specification_opt (parser);
16937 /* Look for the trailing `}'. */
16938 closing_brace = cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
16939 /* Look for trailing attributes to apply to this class. */
16940 if (cp_parser_allow_gnu_extensions_p (parser))
16941 attributes = cp_parser_attributes_opt (parser);
16942 if (type != error_mark_node)
16943 type = finish_struct (type, attributes);
16944 if (nested_name_specifier_p)
16945 pop_inner_scope (old_scope, scope);
16947 /* We've finished a type definition. Check for the common syntax
16948 error of forgetting a semicolon after the definition. We need to
16949 be careful, as we can't just check for not-a-semicolon and be done
16950 with it; the user might have typed:
16952 class X { } c = ...;
16953 class X { } *p = ...;
16955 and so forth. Instead, enumerate all the possible tokens that
16956 might follow this production; if we don't see one of them, then
16957 complain and silently insert the semicolon. */
16959 cp_token *token = cp_lexer_peek_token (parser->lexer);
16960 bool want_semicolon = true;
16962 switch (token->type)
16965 case CPP_SEMICOLON:
16968 case CPP_OPEN_PAREN:
16969 case CPP_CLOSE_PAREN:
16971 want_semicolon = false;
16974 /* While it's legal for type qualifiers and storage class
16975 specifiers to follow type definitions in the grammar, only
16976 compiler testsuites contain code like that. Assume that if
16977 we see such code, then what we're really seeing is a case
16981 const <type> var = ...;
16986 static <type> func (...) ...
16988 i.e. the qualifier or specifier applies to the next
16989 declaration. To do so, however, we need to look ahead one
16990 more token to see if *that* token is a type specifier.
16992 This code could be improved to handle:
16995 static const <type> var = ...; */
16997 if (keyword_is_decl_specifier (token->keyword))
16999 cp_token *lookahead = cp_lexer_peek_nth_token (parser->lexer, 2);
17001 /* Handling user-defined types here would be nice, but very
17004 = (lookahead->type == CPP_KEYWORD
17005 && keyword_begins_type_specifier (lookahead->keyword));
17012 /* If we don't have a type, then something is very wrong and we
17013 shouldn't try to do anything clever. Likewise for not seeing the
17015 if (closing_brace && TYPE_P (type) && want_semicolon)
17017 cp_token_position prev
17018 = cp_lexer_previous_token_position (parser->lexer);
17019 cp_token *prev_token = cp_lexer_token_at (parser->lexer, prev);
17020 location_t loc = prev_token->location;
17022 if (CLASSTYPE_DECLARED_CLASS (type))
17023 error_at (loc, "expected %<;%> after class definition");
17024 else if (TREE_CODE (type) == RECORD_TYPE)
17025 error_at (loc, "expected %<;%> after struct definition");
17026 else if (TREE_CODE (type) == UNION_TYPE)
17027 error_at (loc, "expected %<;%> after union definition");
17029 gcc_unreachable ();
17031 /* Unget one token and smash it to look as though we encountered
17032 a semicolon in the input stream. */
17033 cp_lexer_set_token_position (parser->lexer, prev);
17034 token = cp_lexer_peek_token (parser->lexer);
17035 token->type = CPP_SEMICOLON;
17036 token->keyword = RID_MAX;
17040 /* If this class is not itself within the scope of another class,
17041 then we need to parse the bodies of all of the queued function
17042 definitions. Note that the queued functions defined in a class
17043 are not always processed immediately following the
17044 class-specifier for that class. Consider:
17047 struct B { void f() { sizeof (A); } };
17050 If `f' were processed before the processing of `A' were
17051 completed, there would be no way to compute the size of `A'.
17052 Note that the nesting we are interested in here is lexical --
17053 not the semantic nesting given by TYPE_CONTEXT. In particular,
17056 struct A { struct B; };
17057 struct A::B { void f() { } };
17059 there is no need to delay the parsing of `A::B::f'. */
17060 if (--parser->num_classes_being_defined == 0)
17063 tree class_type = NULL_TREE;
17064 tree pushed_scope = NULL_TREE;
17066 cp_default_arg_entry *e;
17068 /* In a first pass, parse default arguments to the functions.
17069 Then, in a second pass, parse the bodies of the functions.
17070 This two-phased approach handles cases like:
17078 FOR_EACH_VEC_ELT (cp_default_arg_entry, unparsed_funs_with_default_args,
17082 /* If there are default arguments that have not yet been processed,
17083 take care of them now. */
17084 if (class_type != e->class_type)
17087 pop_scope (pushed_scope);
17088 class_type = e->class_type;
17089 pushed_scope = push_scope (class_type);
17091 /* Make sure that any template parameters are in scope. */
17092 maybe_begin_member_template_processing (fn);
17093 /* Parse the default argument expressions. */
17094 cp_parser_late_parsing_default_args (parser, fn);
17095 /* Remove any template parameters from the symbol table. */
17096 maybe_end_member_template_processing ();
17099 pop_scope (pushed_scope);
17100 VEC_truncate (cp_default_arg_entry, unparsed_funs_with_default_args, 0);
17101 /* Now parse the body of the functions. */
17102 FOR_EACH_VEC_ELT (tree, unparsed_funs_with_definitions, ix, fn)
17103 cp_parser_late_parsing_for_member (parser, fn);
17104 VEC_truncate (tree, unparsed_funs_with_definitions, 0);
17107 /* Put back any saved access checks. */
17108 pop_deferring_access_checks ();
17110 /* Restore saved state. */
17111 parser->in_function_body = saved_in_function_body;
17112 parser->num_template_parameter_lists
17113 = saved_num_template_parameter_lists;
17114 parser->in_unbraced_linkage_specification_p
17115 = saved_in_unbraced_linkage_specification_p;
17121 cp_parser_class_specifier (cp_parser* parser)
17124 timevar_push (TV_PARSE_STRUCT);
17125 ret = cp_parser_class_specifier_1 (parser);
17126 timevar_pop (TV_PARSE_STRUCT);
17130 /* Parse a class-head.
17133 class-key identifier [opt] base-clause [opt]
17134 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
17135 class-key nested-name-specifier [opt] template-id
17138 class-virt-specifier:
17142 class-key attributes identifier [opt] base-clause [opt]
17143 class-key attributes nested-name-specifier identifier base-clause [opt]
17144 class-key attributes nested-name-specifier [opt] template-id
17147 Upon return BASES is initialized to the list of base classes (or
17148 NULL, if there are none) in the same form returned by
17149 cp_parser_base_clause.
17151 Returns the TYPE of the indicated class. Sets
17152 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
17153 involving a nested-name-specifier was used, and FALSE otherwise.
17155 Returns error_mark_node if this is not a class-head.
17157 Returns NULL_TREE if the class-head is syntactically valid, but
17158 semantically invalid in a way that means we should skip the entire
17159 body of the class. */
17162 cp_parser_class_head (cp_parser* parser,
17163 bool* nested_name_specifier_p,
17164 tree *attributes_p,
17167 tree nested_name_specifier;
17168 enum tag_types class_key;
17169 tree id = NULL_TREE;
17170 tree type = NULL_TREE;
17172 cp_virt_specifiers virt_specifiers = VIRT_SPEC_UNSPECIFIED;
17173 bool template_id_p = false;
17174 bool qualified_p = false;
17175 bool invalid_nested_name_p = false;
17176 bool invalid_explicit_specialization_p = false;
17177 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
17178 tree pushed_scope = NULL_TREE;
17179 unsigned num_templates;
17180 cp_token *type_start_token = NULL, *nested_name_specifier_token_start = NULL;
17181 /* Assume no nested-name-specifier will be present. */
17182 *nested_name_specifier_p = false;
17183 /* Assume no template parameter lists will be used in defining the
17186 parser->colon_corrects_to_scope_p = false;
17188 *bases = NULL_TREE;
17190 /* Look for the class-key. */
17191 class_key = cp_parser_class_key (parser);
17192 if (class_key == none_type)
17193 return error_mark_node;
17195 /* Parse the attributes. */
17196 attributes = cp_parser_attributes_opt (parser);
17198 /* If the next token is `::', that is invalid -- but sometimes
17199 people do try to write:
17203 Handle this gracefully by accepting the extra qualifier, and then
17204 issuing an error about it later if this really is a
17205 class-head. If it turns out just to be an elaborated type
17206 specifier, remain silent. */
17207 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
17208 qualified_p = true;
17210 push_deferring_access_checks (dk_no_check);
17212 /* Determine the name of the class. Begin by looking for an
17213 optional nested-name-specifier. */
17214 nested_name_specifier_token_start = cp_lexer_peek_token (parser->lexer);
17215 nested_name_specifier
17216 = cp_parser_nested_name_specifier_opt (parser,
17217 /*typename_keyword_p=*/false,
17218 /*check_dependency_p=*/false,
17220 /*is_declaration=*/false);
17221 /* If there was a nested-name-specifier, then there *must* be an
17223 if (nested_name_specifier)
17225 type_start_token = cp_lexer_peek_token (parser->lexer);
17226 /* Although the grammar says `identifier', it really means
17227 `class-name' or `template-name'. You are only allowed to
17228 define a class that has already been declared with this
17231 The proposed resolution for Core Issue 180 says that wherever
17232 you see `class T::X' you should treat `X' as a type-name.
17234 It is OK to define an inaccessible class; for example:
17236 class A { class B; };
17239 We do not know if we will see a class-name, or a
17240 template-name. We look for a class-name first, in case the
17241 class-name is a template-id; if we looked for the
17242 template-name first we would stop after the template-name. */
17243 cp_parser_parse_tentatively (parser);
17244 type = cp_parser_class_name (parser,
17245 /*typename_keyword_p=*/false,
17246 /*template_keyword_p=*/false,
17248 /*check_dependency_p=*/false,
17249 /*class_head_p=*/true,
17250 /*is_declaration=*/false);
17251 /* If that didn't work, ignore the nested-name-specifier. */
17252 if (!cp_parser_parse_definitely (parser))
17254 invalid_nested_name_p = true;
17255 type_start_token = cp_lexer_peek_token (parser->lexer);
17256 id = cp_parser_identifier (parser);
17257 if (id == error_mark_node)
17260 /* If we could not find a corresponding TYPE, treat this
17261 declaration like an unqualified declaration. */
17262 if (type == error_mark_node)
17263 nested_name_specifier = NULL_TREE;
17264 /* Otherwise, count the number of templates used in TYPE and its
17265 containing scopes. */
17270 for (scope = TREE_TYPE (type);
17271 scope && TREE_CODE (scope) != NAMESPACE_DECL;
17272 scope = (TYPE_P (scope)
17273 ? TYPE_CONTEXT (scope)
17274 : DECL_CONTEXT (scope)))
17276 && CLASS_TYPE_P (scope)
17277 && CLASSTYPE_TEMPLATE_INFO (scope)
17278 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
17279 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
17283 /* Otherwise, the identifier is optional. */
17286 /* We don't know whether what comes next is a template-id,
17287 an identifier, or nothing at all. */
17288 cp_parser_parse_tentatively (parser);
17289 /* Check for a template-id. */
17290 type_start_token = cp_lexer_peek_token (parser->lexer);
17291 id = cp_parser_template_id (parser,
17292 /*template_keyword_p=*/false,
17293 /*check_dependency_p=*/true,
17294 /*is_declaration=*/true);
17295 /* If that didn't work, it could still be an identifier. */
17296 if (!cp_parser_parse_definitely (parser))
17298 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
17300 type_start_token = cp_lexer_peek_token (parser->lexer);
17301 id = cp_parser_identifier (parser);
17308 template_id_p = true;
17313 pop_deferring_access_checks ();
17317 cp_parser_check_for_invalid_template_id (parser, id,
17318 type_start_token->location);
17319 virt_specifiers = cp_parser_virt_specifier_seq_opt (parser);
17322 /* If it's not a `:' or a `{' then we can't really be looking at a
17323 class-head, since a class-head only appears as part of a
17324 class-specifier. We have to detect this situation before calling
17325 xref_tag, since that has irreversible side-effects. */
17326 if (!cp_parser_next_token_starts_class_definition_p (parser))
17328 cp_parser_error (parser, "expected %<{%> or %<:%>");
17329 type = error_mark_node;
17333 /* At this point, we're going ahead with the class-specifier, even
17334 if some other problem occurs. */
17335 cp_parser_commit_to_tentative_parse (parser);
17336 if (virt_specifiers & VIRT_SPEC_OVERRIDE)
17338 cp_parser_error (parser,
17339 "cannot specify %<override%> for a class");
17340 type = error_mark_node;
17343 /* Issue the error about the overly-qualified name now. */
17346 cp_parser_error (parser,
17347 "global qualification of class name is invalid");
17348 type = error_mark_node;
17351 else if (invalid_nested_name_p)
17353 cp_parser_error (parser,
17354 "qualified name does not name a class");
17355 type = error_mark_node;
17358 else if (nested_name_specifier)
17362 /* Reject typedef-names in class heads. */
17363 if (!DECL_IMPLICIT_TYPEDEF_P (type))
17365 error_at (type_start_token->location,
17366 "invalid class name in declaration of %qD",
17372 /* Figure out in what scope the declaration is being placed. */
17373 scope = current_scope ();
17374 /* If that scope does not contain the scope in which the
17375 class was originally declared, the program is invalid. */
17376 if (scope && !is_ancestor (scope, nested_name_specifier))
17378 if (at_namespace_scope_p ())
17379 error_at (type_start_token->location,
17380 "declaration of %qD in namespace %qD which does not "
17382 type, scope, nested_name_specifier);
17384 error_at (type_start_token->location,
17385 "declaration of %qD in %qD which does not enclose %qD",
17386 type, scope, nested_name_specifier);
17392 A declarator-id shall not be qualified except for the
17393 definition of a ... nested class outside of its class
17394 ... [or] the definition or explicit instantiation of a
17395 class member of a namespace outside of its namespace. */
17396 if (scope == nested_name_specifier)
17398 permerror (nested_name_specifier_token_start->location,
17399 "extra qualification not allowed");
17400 nested_name_specifier = NULL_TREE;
17404 /* An explicit-specialization must be preceded by "template <>". If
17405 it is not, try to recover gracefully. */
17406 if (at_namespace_scope_p ()
17407 && parser->num_template_parameter_lists == 0
17410 error_at (type_start_token->location,
17411 "an explicit specialization must be preceded by %<template <>%>");
17412 invalid_explicit_specialization_p = true;
17413 /* Take the same action that would have been taken by
17414 cp_parser_explicit_specialization. */
17415 ++parser->num_template_parameter_lists;
17416 begin_specialization ();
17418 /* There must be no "return" statements between this point and the
17419 end of this function; set "type "to the correct return value and
17420 use "goto done;" to return. */
17421 /* Make sure that the right number of template parameters were
17423 if (!cp_parser_check_template_parameters (parser, num_templates,
17424 type_start_token->location,
17425 /*declarator=*/NULL))
17427 /* If something went wrong, there is no point in even trying to
17428 process the class-definition. */
17433 /* Look up the type. */
17436 if (TREE_CODE (id) == TEMPLATE_ID_EXPR
17437 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id, 0))
17438 || TREE_CODE (TREE_OPERAND (id, 0)) == OVERLOAD))
17440 error_at (type_start_token->location,
17441 "function template %qD redeclared as a class template", id);
17442 type = error_mark_node;
17446 type = TREE_TYPE (id);
17447 type = maybe_process_partial_specialization (type);
17449 if (nested_name_specifier)
17450 pushed_scope = push_scope (nested_name_specifier);
17452 else if (nested_name_specifier)
17458 template <typename T> struct S { struct T };
17459 template <typename T> struct S<T>::T { };
17461 we will get a TYPENAME_TYPE when processing the definition of
17462 `S::T'. We need to resolve it to the actual type before we
17463 try to define it. */
17464 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
17466 class_type = resolve_typename_type (TREE_TYPE (type),
17467 /*only_current_p=*/false);
17468 if (TREE_CODE (class_type) != TYPENAME_TYPE)
17469 type = TYPE_NAME (class_type);
17472 cp_parser_error (parser, "could not resolve typename type");
17473 type = error_mark_node;
17477 if (maybe_process_partial_specialization (TREE_TYPE (type))
17478 == error_mark_node)
17484 class_type = current_class_type;
17485 /* Enter the scope indicated by the nested-name-specifier. */
17486 pushed_scope = push_scope (nested_name_specifier);
17487 /* Get the canonical version of this type. */
17488 type = TYPE_MAIN_DECL (TREE_TYPE (type));
17489 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
17490 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
17492 type = push_template_decl (type);
17493 if (type == error_mark_node)
17500 type = TREE_TYPE (type);
17501 *nested_name_specifier_p = true;
17503 else /* The name is not a nested name. */
17505 /* If the class was unnamed, create a dummy name. */
17507 id = make_anon_name ();
17508 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
17509 parser->num_template_parameter_lists);
17512 /* Indicate whether this class was declared as a `class' or as a
17514 if (TREE_CODE (type) == RECORD_TYPE)
17515 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
17516 cp_parser_check_class_key (class_key, type);
17518 /* If this type was already complete, and we see another definition,
17519 that's an error. */
17520 if (type != error_mark_node && COMPLETE_TYPE_P (type))
17522 error_at (type_start_token->location, "redefinition of %q#T",
17524 error_at (type_start_token->location, "previous definition of %q+#T",
17529 else if (type == error_mark_node)
17532 /* We will have entered the scope containing the class; the names of
17533 base classes should be looked up in that context. For example:
17535 struct A { struct B {}; struct C; };
17536 struct A::C : B {};
17540 /* Get the list of base-classes, if there is one. */
17541 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
17542 *bases = cp_parser_base_clause (parser);
17545 /* Leave the scope given by the nested-name-specifier. We will
17546 enter the class scope itself while processing the members. */
17548 pop_scope (pushed_scope);
17550 if (invalid_explicit_specialization_p)
17552 end_specialization ();
17553 --parser->num_template_parameter_lists;
17557 DECL_SOURCE_LOCATION (TYPE_NAME (type)) = type_start_token->location;
17558 *attributes_p = attributes;
17559 if (type && (virt_specifiers & VIRT_SPEC_FINAL))
17560 CLASSTYPE_FINAL (type) = 1;
17562 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
17566 /* Parse a class-key.
17573 Returns the kind of class-key specified, or none_type to indicate
17576 static enum tag_types
17577 cp_parser_class_key (cp_parser* parser)
17580 enum tag_types tag_type;
17582 /* Look for the class-key. */
17583 token = cp_parser_require (parser, CPP_KEYWORD, RT_CLASS_KEY);
17587 /* Check to see if the TOKEN is a class-key. */
17588 tag_type = cp_parser_token_is_class_key (token);
17590 cp_parser_error (parser, "expected class-key");
17594 /* Parse an (optional) member-specification.
17596 member-specification:
17597 member-declaration member-specification [opt]
17598 access-specifier : member-specification [opt] */
17601 cp_parser_member_specification_opt (cp_parser* parser)
17608 /* Peek at the next token. */
17609 token = cp_lexer_peek_token (parser->lexer);
17610 /* If it's a `}', or EOF then we've seen all the members. */
17611 if (token->type == CPP_CLOSE_BRACE
17612 || token->type == CPP_EOF
17613 || token->type == CPP_PRAGMA_EOL)
17616 /* See if this token is a keyword. */
17617 keyword = token->keyword;
17621 case RID_PROTECTED:
17623 /* Consume the access-specifier. */
17624 cp_lexer_consume_token (parser->lexer);
17625 /* Remember which access-specifier is active. */
17626 current_access_specifier = token->u.value;
17627 /* Look for the `:'. */
17628 cp_parser_require (parser, CPP_COLON, RT_COLON);
17632 /* Accept #pragmas at class scope. */
17633 if (token->type == CPP_PRAGMA)
17635 cp_parser_pragma (parser, pragma_external);
17639 /* Otherwise, the next construction must be a
17640 member-declaration. */
17641 cp_parser_member_declaration (parser);
17646 /* Parse a member-declaration.
17648 member-declaration:
17649 decl-specifier-seq [opt] member-declarator-list [opt] ;
17650 function-definition ; [opt]
17651 :: [opt] nested-name-specifier template [opt] unqualified-id ;
17653 template-declaration
17655 member-declarator-list:
17657 member-declarator-list , member-declarator
17660 declarator pure-specifier [opt]
17661 declarator constant-initializer [opt]
17662 identifier [opt] : constant-expression
17666 member-declaration:
17667 __extension__ member-declaration
17670 declarator attributes [opt] pure-specifier [opt]
17671 declarator attributes [opt] constant-initializer [opt]
17672 identifier [opt] attributes [opt] : constant-expression
17676 member-declaration:
17677 static_assert-declaration */
17680 cp_parser_member_declaration (cp_parser* parser)
17682 cp_decl_specifier_seq decl_specifiers;
17683 tree prefix_attributes;
17685 int declares_class_or_enum;
17687 cp_token *token = NULL;
17688 cp_token *decl_spec_token_start = NULL;
17689 cp_token *initializer_token_start = NULL;
17690 int saved_pedantic;
17691 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
17693 /* Check for the `__extension__' keyword. */
17694 if (cp_parser_extension_opt (parser, &saved_pedantic))
17697 cp_parser_member_declaration (parser);
17698 /* Restore the old value of the PEDANTIC flag. */
17699 pedantic = saved_pedantic;
17704 /* Check for a template-declaration. */
17705 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
17707 /* An explicit specialization here is an error condition, and we
17708 expect the specialization handler to detect and report this. */
17709 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
17710 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
17711 cp_parser_explicit_specialization (parser);
17713 cp_parser_template_declaration (parser, /*member_p=*/true);
17718 /* Check for a using-declaration. */
17719 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
17721 /* Parse the using-declaration. */
17722 cp_parser_using_declaration (parser,
17723 /*access_declaration_p=*/false);
17727 /* Check for @defs. */
17728 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
17731 tree ivar_chains = cp_parser_objc_defs_expression (parser);
17732 ivar = ivar_chains;
17736 ivar = TREE_CHAIN (member);
17737 TREE_CHAIN (member) = NULL_TREE;
17738 finish_member_declaration (member);
17743 /* If the next token is `static_assert' we have a static assertion. */
17744 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC_ASSERT))
17746 cp_parser_static_assert (parser, /*member_p=*/true);
17750 parser->colon_corrects_to_scope_p = false;
17752 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
17755 /* Parse the decl-specifier-seq. */
17756 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
17757 cp_parser_decl_specifier_seq (parser,
17758 CP_PARSER_FLAGS_OPTIONAL,
17760 &declares_class_or_enum);
17761 prefix_attributes = decl_specifiers.attributes;
17762 decl_specifiers.attributes = NULL_TREE;
17763 /* Check for an invalid type-name. */
17764 if (!decl_specifiers.any_type_specifiers_p
17765 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
17767 /* If there is no declarator, then the decl-specifier-seq should
17769 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17771 /* If there was no decl-specifier-seq, and the next token is a
17772 `;', then we have something like:
17778 Each member-declaration shall declare at least one member
17779 name of the class. */
17780 if (!decl_specifiers.any_specifiers_p)
17782 cp_token *token = cp_lexer_peek_token (parser->lexer);
17783 if (!in_system_header_at (token->location))
17784 pedwarn (token->location, OPT_pedantic, "extra %<;%>");
17790 /* See if this declaration is a friend. */
17791 friend_p = cp_parser_friend_p (&decl_specifiers);
17792 /* If there were decl-specifiers, check to see if there was
17793 a class-declaration. */
17794 type = check_tag_decl (&decl_specifiers);
17795 /* Nested classes have already been added to the class, but
17796 a `friend' needs to be explicitly registered. */
17799 /* If the `friend' keyword was present, the friend must
17800 be introduced with a class-key. */
17801 if (!declares_class_or_enum && cxx_dialect < cxx0x)
17802 pedwarn (decl_spec_token_start->location, OPT_pedantic,
17803 "in C++03 a class-key must be used "
17804 "when declaring a friend");
17807 template <typename T> struct A {
17808 friend struct A<T>::B;
17811 A<T>::B will be represented by a TYPENAME_TYPE, and
17812 therefore not recognized by check_tag_decl. */
17815 type = decl_specifiers.type;
17816 if (type && TREE_CODE (type) == TYPE_DECL)
17817 type = TREE_TYPE (type);
17819 if (!type || !TYPE_P (type))
17820 error_at (decl_spec_token_start->location,
17821 "friend declaration does not name a class or "
17824 make_friend_class (current_class_type, type,
17825 /*complain=*/true);
17827 /* If there is no TYPE, an error message will already have
17829 else if (!type || type == error_mark_node)
17831 /* An anonymous aggregate has to be handled specially; such
17832 a declaration really declares a data member (with a
17833 particular type), as opposed to a nested class. */
17834 else if (ANON_AGGR_TYPE_P (type))
17836 /* Remove constructors and such from TYPE, now that we
17837 know it is an anonymous aggregate. */
17838 fixup_anonymous_aggr (type);
17839 /* And make the corresponding data member. */
17840 decl = build_decl (decl_spec_token_start->location,
17841 FIELD_DECL, NULL_TREE, type);
17842 /* Add it to the class. */
17843 finish_member_declaration (decl);
17846 cp_parser_check_access_in_redeclaration
17848 decl_spec_token_start->location);
17853 bool assume_semicolon = false;
17855 /* See if these declarations will be friends. */
17856 friend_p = cp_parser_friend_p (&decl_specifiers);
17858 /* Keep going until we hit the `;' at the end of the
17860 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
17862 tree attributes = NULL_TREE;
17863 tree first_attribute;
17865 /* Peek at the next token. */
17866 token = cp_lexer_peek_token (parser->lexer);
17868 /* Check for a bitfield declaration. */
17869 if (token->type == CPP_COLON
17870 || (token->type == CPP_NAME
17871 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
17877 /* Get the name of the bitfield. Note that we cannot just
17878 check TOKEN here because it may have been invalidated by
17879 the call to cp_lexer_peek_nth_token above. */
17880 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
17881 identifier = cp_parser_identifier (parser);
17883 identifier = NULL_TREE;
17885 /* Consume the `:' token. */
17886 cp_lexer_consume_token (parser->lexer);
17887 /* Get the width of the bitfield. */
17889 = cp_parser_constant_expression (parser,
17890 /*allow_non_constant=*/false,
17893 /* Look for attributes that apply to the bitfield. */
17894 attributes = cp_parser_attributes_opt (parser);
17895 /* Remember which attributes are prefix attributes and
17897 first_attribute = attributes;
17898 /* Combine the attributes. */
17899 attributes = chainon (prefix_attributes, attributes);
17901 /* Create the bitfield declaration. */
17902 decl = grokbitfield (identifier
17903 ? make_id_declarator (NULL_TREE,
17913 cp_declarator *declarator;
17915 tree asm_specification;
17916 int ctor_dtor_or_conv_p;
17918 /* Parse the declarator. */
17920 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
17921 &ctor_dtor_or_conv_p,
17922 /*parenthesized_p=*/NULL,
17923 /*member_p=*/true);
17925 /* If something went wrong parsing the declarator, make sure
17926 that we at least consume some tokens. */
17927 if (declarator == cp_error_declarator)
17929 /* Skip to the end of the statement. */
17930 cp_parser_skip_to_end_of_statement (parser);
17931 /* If the next token is not a semicolon, that is
17932 probably because we just skipped over the body of
17933 a function. So, we consume a semicolon if
17934 present, but do not issue an error message if it
17936 if (cp_lexer_next_token_is (parser->lexer,
17938 cp_lexer_consume_token (parser->lexer);
17942 if (declares_class_or_enum & 2)
17943 cp_parser_check_for_definition_in_return_type
17944 (declarator, decl_specifiers.type,
17945 decl_specifiers.type_location);
17947 /* Look for an asm-specification. */
17948 asm_specification = cp_parser_asm_specification_opt (parser);
17949 /* Look for attributes that apply to the declaration. */
17950 attributes = cp_parser_attributes_opt (parser);
17951 /* Remember which attributes are prefix attributes and
17953 first_attribute = attributes;
17954 /* Combine the attributes. */
17955 attributes = chainon (prefix_attributes, attributes);
17957 /* If it's an `=', then we have a constant-initializer or a
17958 pure-specifier. It is not correct to parse the
17959 initializer before registering the member declaration
17960 since the member declaration should be in scope while
17961 its initializer is processed. However, the rest of the
17962 front end does not yet provide an interface that allows
17963 us to handle this correctly. */
17964 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
17968 A pure-specifier shall be used only in the declaration of
17969 a virtual function.
17971 A member-declarator can contain a constant-initializer
17972 only if it declares a static member of integral or
17975 Therefore, if the DECLARATOR is for a function, we look
17976 for a pure-specifier; otherwise, we look for a
17977 constant-initializer. When we call `grokfield', it will
17978 perform more stringent semantics checks. */
17979 initializer_token_start = cp_lexer_peek_token (parser->lexer);
17980 if (function_declarator_p (declarator))
17981 initializer = cp_parser_pure_specifier (parser);
17983 /* Parse the initializer. */
17984 initializer = cp_parser_constant_initializer (parser);
17986 /* Otherwise, there is no initializer. */
17988 initializer = NULL_TREE;
17990 /* See if we are probably looking at a function
17991 definition. We are certainly not looking at a
17992 member-declarator. Calling `grokfield' has
17993 side-effects, so we must not do it unless we are sure
17994 that we are looking at a member-declarator. */
17995 if (cp_parser_token_starts_function_definition_p
17996 (cp_lexer_peek_token (parser->lexer)))
17998 /* The grammar does not allow a pure-specifier to be
17999 used when a member function is defined. (It is
18000 possible that this fact is an oversight in the
18001 standard, since a pure function may be defined
18002 outside of the class-specifier. */
18004 error_at (initializer_token_start->location,
18005 "pure-specifier on function-definition");
18006 decl = cp_parser_save_member_function_body (parser,
18010 /* If the member was not a friend, declare it here. */
18012 finish_member_declaration (decl);
18013 /* Peek at the next token. */
18014 token = cp_lexer_peek_token (parser->lexer);
18015 /* If the next token is a semicolon, consume it. */
18016 if (token->type == CPP_SEMICOLON)
18017 cp_lexer_consume_token (parser->lexer);
18021 if (declarator->kind == cdk_function)
18022 declarator->id_loc = token->location;
18023 /* Create the declaration. */
18024 decl = grokfield (declarator, &decl_specifiers,
18025 initializer, /*init_const_expr_p=*/true,
18030 /* Reset PREFIX_ATTRIBUTES. */
18031 while (attributes && TREE_CHAIN (attributes) != first_attribute)
18032 attributes = TREE_CHAIN (attributes);
18034 TREE_CHAIN (attributes) = NULL_TREE;
18036 /* If there is any qualification still in effect, clear it
18037 now; we will be starting fresh with the next declarator. */
18038 parser->scope = NULL_TREE;
18039 parser->qualifying_scope = NULL_TREE;
18040 parser->object_scope = NULL_TREE;
18041 /* If it's a `,', then there are more declarators. */
18042 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
18043 cp_lexer_consume_token (parser->lexer);
18044 /* If the next token isn't a `;', then we have a parse error. */
18045 else if (cp_lexer_next_token_is_not (parser->lexer,
18048 /* The next token might be a ways away from where the
18049 actual semicolon is missing. Find the previous token
18050 and use that for our error position. */
18051 cp_token *token = cp_lexer_previous_token (parser->lexer);
18052 error_at (token->location,
18053 "expected %<;%> at end of member declaration");
18055 /* Assume that the user meant to provide a semicolon. If
18056 we were to cp_parser_skip_to_end_of_statement, we might
18057 skip to a semicolon inside a member function definition
18058 and issue nonsensical error messages. */
18059 assume_semicolon = true;
18064 /* Add DECL to the list of members. */
18066 finish_member_declaration (decl);
18068 if (TREE_CODE (decl) == FUNCTION_DECL)
18069 cp_parser_save_default_args (parser, decl);
18072 if (assume_semicolon)
18077 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
18079 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
18082 /* Parse a pure-specifier.
18087 Returns INTEGER_ZERO_NODE if a pure specifier is found.
18088 Otherwise, ERROR_MARK_NODE is returned. */
18091 cp_parser_pure_specifier (cp_parser* parser)
18095 /* Look for the `=' token. */
18096 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
18097 return error_mark_node;
18098 /* Look for the `0' token. */
18099 token = cp_lexer_peek_token (parser->lexer);
18101 if (token->type == CPP_EOF
18102 || token->type == CPP_PRAGMA_EOL)
18103 return error_mark_node;
18105 cp_lexer_consume_token (parser->lexer);
18107 /* Accept = default or = delete in c++0x mode. */
18108 if (token->keyword == RID_DEFAULT
18109 || token->keyword == RID_DELETE)
18111 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED);
18112 return token->u.value;
18115 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
18116 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
18118 cp_parser_error (parser,
18119 "invalid pure specifier (only %<= 0%> is allowed)");
18120 cp_parser_skip_to_end_of_statement (parser);
18121 return error_mark_node;
18123 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
18125 error_at (token->location, "templates may not be %<virtual%>");
18126 return error_mark_node;
18129 return integer_zero_node;
18132 /* Parse a constant-initializer.
18134 constant-initializer:
18135 = constant-expression
18137 Returns a representation of the constant-expression. */
18140 cp_parser_constant_initializer (cp_parser* parser)
18142 /* Look for the `=' token. */
18143 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
18144 return error_mark_node;
18146 /* It is invalid to write:
18148 struct S { static const int i = { 7 }; };
18151 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
18153 cp_parser_error (parser,
18154 "a brace-enclosed initializer is not allowed here");
18155 /* Consume the opening brace. */
18156 cp_lexer_consume_token (parser->lexer);
18157 /* Skip the initializer. */
18158 cp_parser_skip_to_closing_brace (parser);
18159 /* Look for the trailing `}'. */
18160 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
18162 return error_mark_node;
18165 return cp_parser_constant_expression (parser,
18166 /*allow_non_constant=*/false,
18170 /* Derived classes [gram.class.derived] */
18172 /* Parse a base-clause.
18175 : base-specifier-list
18177 base-specifier-list:
18178 base-specifier ... [opt]
18179 base-specifier-list , base-specifier ... [opt]
18181 Returns a TREE_LIST representing the base-classes, in the order in
18182 which they were declared. The representation of each node is as
18183 described by cp_parser_base_specifier.
18185 In the case that no bases are specified, this function will return
18186 NULL_TREE, not ERROR_MARK_NODE. */
18189 cp_parser_base_clause (cp_parser* parser)
18191 tree bases = NULL_TREE;
18193 /* Look for the `:' that begins the list. */
18194 cp_parser_require (parser, CPP_COLON, RT_COLON);
18196 /* Scan the base-specifier-list. */
18201 bool pack_expansion_p = false;
18203 /* Look for the base-specifier. */
18204 base = cp_parser_base_specifier (parser);
18205 /* Look for the (optional) ellipsis. */
18206 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
18208 /* Consume the `...'. */
18209 cp_lexer_consume_token (parser->lexer);
18211 pack_expansion_p = true;
18214 /* Add BASE to the front of the list. */
18215 if (base != error_mark_node)
18217 if (pack_expansion_p)
18218 /* Make this a pack expansion type. */
18219 TREE_VALUE (base) = make_pack_expansion (TREE_VALUE (base));
18222 if (!check_for_bare_parameter_packs (TREE_VALUE (base)))
18224 TREE_CHAIN (base) = bases;
18228 /* Peek at the next token. */
18229 token = cp_lexer_peek_token (parser->lexer);
18230 /* If it's not a comma, then the list is complete. */
18231 if (token->type != CPP_COMMA)
18233 /* Consume the `,'. */
18234 cp_lexer_consume_token (parser->lexer);
18237 /* PARSER->SCOPE may still be non-NULL at this point, if the last
18238 base class had a qualified name. However, the next name that
18239 appears is certainly not qualified. */
18240 parser->scope = NULL_TREE;
18241 parser->qualifying_scope = NULL_TREE;
18242 parser->object_scope = NULL_TREE;
18244 return nreverse (bases);
18247 /* Parse a base-specifier.
18250 :: [opt] nested-name-specifier [opt] class-name
18251 virtual access-specifier [opt] :: [opt] nested-name-specifier
18253 access-specifier virtual [opt] :: [opt] nested-name-specifier
18256 Returns a TREE_LIST. The TREE_PURPOSE will be one of
18257 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
18258 indicate the specifiers provided. The TREE_VALUE will be a TYPE
18259 (or the ERROR_MARK_NODE) indicating the type that was specified. */
18262 cp_parser_base_specifier (cp_parser* parser)
18266 bool virtual_p = false;
18267 bool duplicate_virtual_error_issued_p = false;
18268 bool duplicate_access_error_issued_p = false;
18269 bool class_scope_p, template_p;
18270 tree access = access_default_node;
18273 /* Process the optional `virtual' and `access-specifier'. */
18276 /* Peek at the next token. */
18277 token = cp_lexer_peek_token (parser->lexer);
18278 /* Process `virtual'. */
18279 switch (token->keyword)
18282 /* If `virtual' appears more than once, issue an error. */
18283 if (virtual_p && !duplicate_virtual_error_issued_p)
18285 cp_parser_error (parser,
18286 "%<virtual%> specified more than once in base-specified");
18287 duplicate_virtual_error_issued_p = true;
18292 /* Consume the `virtual' token. */
18293 cp_lexer_consume_token (parser->lexer);
18298 case RID_PROTECTED:
18300 /* If more than one access specifier appears, issue an
18302 if (access != access_default_node
18303 && !duplicate_access_error_issued_p)
18305 cp_parser_error (parser,
18306 "more than one access specifier in base-specified");
18307 duplicate_access_error_issued_p = true;
18310 access = ridpointers[(int) token->keyword];
18312 /* Consume the access-specifier. */
18313 cp_lexer_consume_token (parser->lexer);
18322 /* It is not uncommon to see programs mechanically, erroneously, use
18323 the 'typename' keyword to denote (dependent) qualified types
18324 as base classes. */
18325 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
18327 token = cp_lexer_peek_token (parser->lexer);
18328 if (!processing_template_decl)
18329 error_at (token->location,
18330 "keyword %<typename%> not allowed outside of templates");
18332 error_at (token->location,
18333 "keyword %<typename%> not allowed in this context "
18334 "(the base class is implicitly a type)");
18335 cp_lexer_consume_token (parser->lexer);
18338 /* Look for the optional `::' operator. */
18339 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
18340 /* Look for the nested-name-specifier. The simplest way to
18345 The keyword `typename' is not permitted in a base-specifier or
18346 mem-initializer; in these contexts a qualified name that
18347 depends on a template-parameter is implicitly assumed to be a
18350 is to pretend that we have seen the `typename' keyword at this
18352 cp_parser_nested_name_specifier_opt (parser,
18353 /*typename_keyword_p=*/true,
18354 /*check_dependency_p=*/true,
18356 /*is_declaration=*/true);
18357 /* If the base class is given by a qualified name, assume that names
18358 we see are type names or templates, as appropriate. */
18359 class_scope_p = (parser->scope && TYPE_P (parser->scope));
18360 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
18362 /* Finally, look for the class-name. */
18363 type = cp_parser_class_name (parser,
18367 /*check_dependency_p=*/true,
18368 /*class_head_p=*/false,
18369 /*is_declaration=*/true);
18371 if (type == error_mark_node)
18372 return error_mark_node;
18374 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
18377 /* Exception handling [gram.exception] */
18379 /* Parse an (optional) exception-specification.
18381 exception-specification:
18382 throw ( type-id-list [opt] )
18384 Returns a TREE_LIST representing the exception-specification. The
18385 TREE_VALUE of each node is a type. */
18388 cp_parser_exception_specification_opt (cp_parser* parser)
18392 const char *saved_message;
18394 /* Peek at the next token. */
18395 token = cp_lexer_peek_token (parser->lexer);
18397 /* Is it a noexcept-specification? */
18398 if (cp_parser_is_keyword (token, RID_NOEXCEPT))
18401 cp_lexer_consume_token (parser->lexer);
18403 if (cp_lexer_peek_token (parser->lexer)->type == CPP_OPEN_PAREN)
18405 cp_lexer_consume_token (parser->lexer);
18407 /* Types may not be defined in an exception-specification. */
18408 saved_message = parser->type_definition_forbidden_message;
18409 parser->type_definition_forbidden_message
18410 = G_("types may not be defined in an exception-specification");
18412 expr = cp_parser_constant_expression (parser, false, NULL);
18414 /* Restore the saved message. */
18415 parser->type_definition_forbidden_message = saved_message;
18417 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18420 expr = boolean_true_node;
18422 return build_noexcept_spec (expr, tf_warning_or_error);
18425 /* If it's not `throw', then there's no exception-specification. */
18426 if (!cp_parser_is_keyword (token, RID_THROW))
18430 /* Enable this once a lot of code has transitioned to noexcept? */
18431 if (cxx_dialect == cxx0x && !in_system_header)
18432 warning (OPT_Wdeprecated, "dynamic exception specifications are "
18433 "deprecated in C++0x; use %<noexcept%> instead");
18436 /* Consume the `throw'. */
18437 cp_lexer_consume_token (parser->lexer);
18439 /* Look for the `('. */
18440 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
18442 /* Peek at the next token. */
18443 token = cp_lexer_peek_token (parser->lexer);
18444 /* If it's not a `)', then there is a type-id-list. */
18445 if (token->type != CPP_CLOSE_PAREN)
18447 /* Types may not be defined in an exception-specification. */
18448 saved_message = parser->type_definition_forbidden_message;
18449 parser->type_definition_forbidden_message
18450 = G_("types may not be defined in an exception-specification");
18451 /* Parse the type-id-list. */
18452 type_id_list = cp_parser_type_id_list (parser);
18453 /* Restore the saved message. */
18454 parser->type_definition_forbidden_message = saved_message;
18457 type_id_list = empty_except_spec;
18459 /* Look for the `)'. */
18460 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18462 return type_id_list;
18465 /* Parse an (optional) type-id-list.
18469 type-id-list , type-id ... [opt]
18471 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
18472 in the order that the types were presented. */
18475 cp_parser_type_id_list (cp_parser* parser)
18477 tree types = NULL_TREE;
18484 /* Get the next type-id. */
18485 type = cp_parser_type_id (parser);
18486 /* Parse the optional ellipsis. */
18487 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
18489 /* Consume the `...'. */
18490 cp_lexer_consume_token (parser->lexer);
18492 /* Turn the type into a pack expansion expression. */
18493 type = make_pack_expansion (type);
18495 /* Add it to the list. */
18496 types = add_exception_specifier (types, type, /*complain=*/1);
18497 /* Peek at the next token. */
18498 token = cp_lexer_peek_token (parser->lexer);
18499 /* If it is not a `,', we are done. */
18500 if (token->type != CPP_COMMA)
18502 /* Consume the `,'. */
18503 cp_lexer_consume_token (parser->lexer);
18506 return nreverse (types);
18509 /* Parse a try-block.
18512 try compound-statement handler-seq */
18515 cp_parser_try_block (cp_parser* parser)
18519 cp_parser_require_keyword (parser, RID_TRY, RT_TRY);
18520 try_block = begin_try_block ();
18521 cp_parser_compound_statement (parser, NULL, true, false);
18522 finish_try_block (try_block);
18523 cp_parser_handler_seq (parser);
18524 finish_handler_sequence (try_block);
18529 /* Parse a function-try-block.
18531 function-try-block:
18532 try ctor-initializer [opt] function-body handler-seq */
18535 cp_parser_function_try_block (cp_parser* parser)
18537 tree compound_stmt;
18539 bool ctor_initializer_p;
18541 /* Look for the `try' keyword. */
18542 if (!cp_parser_require_keyword (parser, RID_TRY, RT_TRY))
18544 /* Let the rest of the front end know where we are. */
18545 try_block = begin_function_try_block (&compound_stmt);
18546 /* Parse the function-body. */
18548 = cp_parser_ctor_initializer_opt_and_function_body (parser);
18549 /* We're done with the `try' part. */
18550 finish_function_try_block (try_block);
18551 /* Parse the handlers. */
18552 cp_parser_handler_seq (parser);
18553 /* We're done with the handlers. */
18554 finish_function_handler_sequence (try_block, compound_stmt);
18556 return ctor_initializer_p;
18559 /* Parse a handler-seq.
18562 handler handler-seq [opt] */
18565 cp_parser_handler_seq (cp_parser* parser)
18571 /* Parse the handler. */
18572 cp_parser_handler (parser);
18573 /* Peek at the next token. */
18574 token = cp_lexer_peek_token (parser->lexer);
18575 /* If it's not `catch' then there are no more handlers. */
18576 if (!cp_parser_is_keyword (token, RID_CATCH))
18581 /* Parse a handler.
18584 catch ( exception-declaration ) compound-statement */
18587 cp_parser_handler (cp_parser* parser)
18592 cp_parser_require_keyword (parser, RID_CATCH, RT_CATCH);
18593 handler = begin_handler ();
18594 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
18595 declaration = cp_parser_exception_declaration (parser);
18596 finish_handler_parms (declaration, handler);
18597 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18598 cp_parser_compound_statement (parser, NULL, false, false);
18599 finish_handler (handler);
18602 /* Parse an exception-declaration.
18604 exception-declaration:
18605 type-specifier-seq declarator
18606 type-specifier-seq abstract-declarator
18610 Returns a VAR_DECL for the declaration, or NULL_TREE if the
18611 ellipsis variant is used. */
18614 cp_parser_exception_declaration (cp_parser* parser)
18616 cp_decl_specifier_seq type_specifiers;
18617 cp_declarator *declarator;
18618 const char *saved_message;
18620 /* If it's an ellipsis, it's easy to handle. */
18621 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
18623 /* Consume the `...' token. */
18624 cp_lexer_consume_token (parser->lexer);
18628 /* Types may not be defined in exception-declarations. */
18629 saved_message = parser->type_definition_forbidden_message;
18630 parser->type_definition_forbidden_message
18631 = G_("types may not be defined in exception-declarations");
18633 /* Parse the type-specifier-seq. */
18634 cp_parser_type_specifier_seq (parser, /*is_declaration=*/true,
18635 /*is_trailing_return=*/false,
18637 /* If it's a `)', then there is no declarator. */
18638 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
18641 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
18642 /*ctor_dtor_or_conv_p=*/NULL,
18643 /*parenthesized_p=*/NULL,
18644 /*member_p=*/false);
18646 /* Restore the saved message. */
18647 parser->type_definition_forbidden_message = saved_message;
18649 if (!type_specifiers.any_specifiers_p)
18650 return error_mark_node;
18652 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
18655 /* Parse a throw-expression.
18658 throw assignment-expression [opt]
18660 Returns a THROW_EXPR representing the throw-expression. */
18663 cp_parser_throw_expression (cp_parser* parser)
18668 cp_parser_require_keyword (parser, RID_THROW, RT_THROW);
18669 token = cp_lexer_peek_token (parser->lexer);
18670 /* Figure out whether or not there is an assignment-expression
18671 following the "throw" keyword. */
18672 if (token->type == CPP_COMMA
18673 || token->type == CPP_SEMICOLON
18674 || token->type == CPP_CLOSE_PAREN
18675 || token->type == CPP_CLOSE_SQUARE
18676 || token->type == CPP_CLOSE_BRACE
18677 || token->type == CPP_COLON)
18678 expression = NULL_TREE;
18680 expression = cp_parser_assignment_expression (parser,
18681 /*cast_p=*/false, NULL);
18683 return build_throw (expression);
18686 /* GNU Extensions */
18688 /* Parse an (optional) asm-specification.
18691 asm ( string-literal )
18693 If the asm-specification is present, returns a STRING_CST
18694 corresponding to the string-literal. Otherwise, returns
18698 cp_parser_asm_specification_opt (cp_parser* parser)
18701 tree asm_specification;
18703 /* Peek at the next token. */
18704 token = cp_lexer_peek_token (parser->lexer);
18705 /* If the next token isn't the `asm' keyword, then there's no
18706 asm-specification. */
18707 if (!cp_parser_is_keyword (token, RID_ASM))
18710 /* Consume the `asm' token. */
18711 cp_lexer_consume_token (parser->lexer);
18712 /* Look for the `('. */
18713 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
18715 /* Look for the string-literal. */
18716 asm_specification = cp_parser_string_literal (parser, false, false);
18718 /* Look for the `)'. */
18719 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18721 return asm_specification;
18724 /* Parse an asm-operand-list.
18728 asm-operand-list , asm-operand
18731 string-literal ( expression )
18732 [ string-literal ] string-literal ( expression )
18734 Returns a TREE_LIST representing the operands. The TREE_VALUE of
18735 each node is the expression. The TREE_PURPOSE is itself a
18736 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
18737 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
18738 is a STRING_CST for the string literal before the parenthesis. Returns
18739 ERROR_MARK_NODE if any of the operands are invalid. */
18742 cp_parser_asm_operand_list (cp_parser* parser)
18744 tree asm_operands = NULL_TREE;
18745 bool invalid_operands = false;
18749 tree string_literal;
18753 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
18755 /* Consume the `[' token. */
18756 cp_lexer_consume_token (parser->lexer);
18757 /* Read the operand name. */
18758 name = cp_parser_identifier (parser);
18759 if (name != error_mark_node)
18760 name = build_string (IDENTIFIER_LENGTH (name),
18761 IDENTIFIER_POINTER (name));
18762 /* Look for the closing `]'. */
18763 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
18767 /* Look for the string-literal. */
18768 string_literal = cp_parser_string_literal (parser, false, false);
18770 /* Look for the `('. */
18771 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
18772 /* Parse the expression. */
18773 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
18774 /* Look for the `)'. */
18775 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18777 if (name == error_mark_node
18778 || string_literal == error_mark_node
18779 || expression == error_mark_node)
18780 invalid_operands = true;
18782 /* Add this operand to the list. */
18783 asm_operands = tree_cons (build_tree_list (name, string_literal),
18786 /* If the next token is not a `,', there are no more
18788 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
18790 /* Consume the `,'. */
18791 cp_lexer_consume_token (parser->lexer);
18794 return invalid_operands ? error_mark_node : nreverse (asm_operands);
18797 /* Parse an asm-clobber-list.
18801 asm-clobber-list , string-literal
18803 Returns a TREE_LIST, indicating the clobbers in the order that they
18804 appeared. The TREE_VALUE of each node is a STRING_CST. */
18807 cp_parser_asm_clobber_list (cp_parser* parser)
18809 tree clobbers = NULL_TREE;
18813 tree string_literal;
18815 /* Look for the string literal. */
18816 string_literal = cp_parser_string_literal (parser, false, false);
18817 /* Add it to the list. */
18818 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
18819 /* If the next token is not a `,', then the list is
18821 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
18823 /* Consume the `,' token. */
18824 cp_lexer_consume_token (parser->lexer);
18830 /* Parse an asm-label-list.
18834 asm-label-list , identifier
18836 Returns a TREE_LIST, indicating the labels in the order that they
18837 appeared. The TREE_VALUE of each node is a label. */
18840 cp_parser_asm_label_list (cp_parser* parser)
18842 tree labels = NULL_TREE;
18846 tree identifier, label, name;
18848 /* Look for the identifier. */
18849 identifier = cp_parser_identifier (parser);
18850 if (!error_operand_p (identifier))
18852 label = lookup_label (identifier);
18853 if (TREE_CODE (label) == LABEL_DECL)
18855 TREE_USED (label) = 1;
18856 check_goto (label);
18857 name = build_string (IDENTIFIER_LENGTH (identifier),
18858 IDENTIFIER_POINTER (identifier));
18859 labels = tree_cons (name, label, labels);
18862 /* If the next token is not a `,', then the list is
18864 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
18866 /* Consume the `,' token. */
18867 cp_lexer_consume_token (parser->lexer);
18870 return nreverse (labels);
18873 /* Parse an (optional) series of attributes.
18876 attributes attribute
18879 __attribute__ (( attribute-list [opt] ))
18881 The return value is as for cp_parser_attribute_list. */
18884 cp_parser_attributes_opt (cp_parser* parser)
18886 tree attributes = NULL_TREE;
18891 tree attribute_list;
18893 /* Peek at the next token. */
18894 token = cp_lexer_peek_token (parser->lexer);
18895 /* If it's not `__attribute__', then we're done. */
18896 if (token->keyword != RID_ATTRIBUTE)
18899 /* Consume the `__attribute__' keyword. */
18900 cp_lexer_consume_token (parser->lexer);
18901 /* Look for the two `(' tokens. */
18902 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
18903 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
18905 /* Peek at the next token. */
18906 token = cp_lexer_peek_token (parser->lexer);
18907 if (token->type != CPP_CLOSE_PAREN)
18908 /* Parse the attribute-list. */
18909 attribute_list = cp_parser_attribute_list (parser);
18911 /* If the next token is a `)', then there is no attribute
18913 attribute_list = NULL;
18915 /* Look for the two `)' tokens. */
18916 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18917 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
18919 /* Add these new attributes to the list. */
18920 attributes = chainon (attributes, attribute_list);
18926 /* Parse an attribute-list.
18930 attribute-list , attribute
18934 identifier ( identifier )
18935 identifier ( identifier , expression-list )
18936 identifier ( expression-list )
18938 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
18939 to an attribute. The TREE_PURPOSE of each node is the identifier
18940 indicating which attribute is in use. The TREE_VALUE represents
18941 the arguments, if any. */
18944 cp_parser_attribute_list (cp_parser* parser)
18946 tree attribute_list = NULL_TREE;
18947 bool save_translate_strings_p = parser->translate_strings_p;
18949 parser->translate_strings_p = false;
18956 /* Look for the identifier. We also allow keywords here; for
18957 example `__attribute__ ((const))' is legal. */
18958 token = cp_lexer_peek_token (parser->lexer);
18959 if (token->type == CPP_NAME
18960 || token->type == CPP_KEYWORD)
18962 tree arguments = NULL_TREE;
18964 /* Consume the token. */
18965 token = cp_lexer_consume_token (parser->lexer);
18967 /* Save away the identifier that indicates which attribute
18969 identifier = (token->type == CPP_KEYWORD)
18970 /* For keywords, use the canonical spelling, not the
18971 parsed identifier. */
18972 ? ridpointers[(int) token->keyword]
18975 attribute = build_tree_list (identifier, NULL_TREE);
18977 /* Peek at the next token. */
18978 token = cp_lexer_peek_token (parser->lexer);
18979 /* If it's an `(', then parse the attribute arguments. */
18980 if (token->type == CPP_OPEN_PAREN)
18983 int attr_flag = (attribute_takes_identifier_p (identifier)
18984 ? id_attr : normal_attr);
18985 vec = cp_parser_parenthesized_expression_list
18986 (parser, attr_flag, /*cast_p=*/false,
18987 /*allow_expansion_p=*/false,
18988 /*non_constant_p=*/NULL);
18990 arguments = error_mark_node;
18993 arguments = build_tree_list_vec (vec);
18994 release_tree_vector (vec);
18996 /* Save the arguments away. */
18997 TREE_VALUE (attribute) = arguments;
19000 if (arguments != error_mark_node)
19002 /* Add this attribute to the list. */
19003 TREE_CHAIN (attribute) = attribute_list;
19004 attribute_list = attribute;
19007 token = cp_lexer_peek_token (parser->lexer);
19009 /* Now, look for more attributes. If the next token isn't a
19010 `,', we're done. */
19011 if (token->type != CPP_COMMA)
19014 /* Consume the comma and keep going. */
19015 cp_lexer_consume_token (parser->lexer);
19017 parser->translate_strings_p = save_translate_strings_p;
19019 /* We built up the list in reverse order. */
19020 return nreverse (attribute_list);
19023 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
19024 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
19025 current value of the PEDANTIC flag, regardless of whether or not
19026 the `__extension__' keyword is present. The caller is responsible
19027 for restoring the value of the PEDANTIC flag. */
19030 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
19032 /* Save the old value of the PEDANTIC flag. */
19033 *saved_pedantic = pedantic;
19035 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
19037 /* Consume the `__extension__' token. */
19038 cp_lexer_consume_token (parser->lexer);
19039 /* We're not being pedantic while the `__extension__' keyword is
19049 /* Parse a label declaration.
19052 __label__ label-declarator-seq ;
19054 label-declarator-seq:
19055 identifier , label-declarator-seq
19059 cp_parser_label_declaration (cp_parser* parser)
19061 /* Look for the `__label__' keyword. */
19062 cp_parser_require_keyword (parser, RID_LABEL, RT_LABEL);
19068 /* Look for an identifier. */
19069 identifier = cp_parser_identifier (parser);
19070 /* If we failed, stop. */
19071 if (identifier == error_mark_node)
19073 /* Declare it as a label. */
19074 finish_label_decl (identifier);
19075 /* If the next token is a `;', stop. */
19076 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
19078 /* Look for the `,' separating the label declarations. */
19079 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
19082 /* Look for the final `;'. */
19083 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
19086 /* Support Functions */
19088 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
19089 NAME should have one of the representations used for an
19090 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
19091 is returned. If PARSER->SCOPE is a dependent type, then a
19092 SCOPE_REF is returned.
19094 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
19095 returned; the name was already resolved when the TEMPLATE_ID_EXPR
19096 was formed. Abstractly, such entities should not be passed to this
19097 function, because they do not need to be looked up, but it is
19098 simpler to check for this special case here, rather than at the
19101 In cases not explicitly covered above, this function returns a
19102 DECL, OVERLOAD, or baselink representing the result of the lookup.
19103 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
19106 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
19107 (e.g., "struct") that was used. In that case bindings that do not
19108 refer to types are ignored.
19110 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
19113 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
19116 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
19119 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
19120 TREE_LIST of candidates if name-lookup results in an ambiguity, and
19121 NULL_TREE otherwise. */
19124 cp_parser_lookup_name (cp_parser *parser, tree name,
19125 enum tag_types tag_type,
19128 bool check_dependency,
19129 tree *ambiguous_decls,
19130 location_t name_location)
19134 tree object_type = parser->context->object_type;
19136 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
19137 flags |= LOOKUP_COMPLAIN;
19139 /* Assume that the lookup will be unambiguous. */
19140 if (ambiguous_decls)
19141 *ambiguous_decls = NULL_TREE;
19143 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
19144 no longer valid. Note that if we are parsing tentatively, and
19145 the parse fails, OBJECT_TYPE will be automatically restored. */
19146 parser->context->object_type = NULL_TREE;
19148 if (name == error_mark_node)
19149 return error_mark_node;
19151 /* A template-id has already been resolved; there is no lookup to
19153 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
19155 if (BASELINK_P (name))
19157 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
19158 == TEMPLATE_ID_EXPR);
19162 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
19163 it should already have been checked to make sure that the name
19164 used matches the type being destroyed. */
19165 if (TREE_CODE (name) == BIT_NOT_EXPR)
19169 /* Figure out to which type this destructor applies. */
19171 type = parser->scope;
19172 else if (object_type)
19173 type = object_type;
19175 type = current_class_type;
19176 /* If that's not a class type, there is no destructor. */
19177 if (!type || !CLASS_TYPE_P (type))
19178 return error_mark_node;
19179 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
19180 lazily_declare_fn (sfk_destructor, type);
19181 if (!CLASSTYPE_DESTRUCTORS (type))
19182 return error_mark_node;
19183 /* If it was a class type, return the destructor. */
19184 return CLASSTYPE_DESTRUCTORS (type);
19187 /* By this point, the NAME should be an ordinary identifier. If
19188 the id-expression was a qualified name, the qualifying scope is
19189 stored in PARSER->SCOPE at this point. */
19190 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
19192 /* Perform the lookup. */
19197 if (parser->scope == error_mark_node)
19198 return error_mark_node;
19200 /* If the SCOPE is dependent, the lookup must be deferred until
19201 the template is instantiated -- unless we are explicitly
19202 looking up names in uninstantiated templates. Even then, we
19203 cannot look up the name if the scope is not a class type; it
19204 might, for example, be a template type parameter. */
19205 dependent_p = (TYPE_P (parser->scope)
19206 && dependent_scope_p (parser->scope));
19207 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
19209 /* Defer lookup. */
19210 decl = error_mark_node;
19213 tree pushed_scope = NULL_TREE;
19215 /* If PARSER->SCOPE is a dependent type, then it must be a
19216 class type, and we must not be checking dependencies;
19217 otherwise, we would have processed this lookup above. So
19218 that PARSER->SCOPE is not considered a dependent base by
19219 lookup_member, we must enter the scope here. */
19221 pushed_scope = push_scope (parser->scope);
19223 /* If the PARSER->SCOPE is a template specialization, it
19224 may be instantiated during name lookup. In that case,
19225 errors may be issued. Even if we rollback the current
19226 tentative parse, those errors are valid. */
19227 decl = lookup_qualified_name (parser->scope, name,
19228 tag_type != none_type,
19229 /*complain=*/true);
19231 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
19232 lookup result and the nested-name-specifier nominates a class C:
19233 * if the name specified after the nested-name-specifier, when
19234 looked up in C, is the injected-class-name of C (Clause 9), or
19235 * if the name specified after the nested-name-specifier is the
19236 same as the identifier or the simple-template-id's template-
19237 name in the last component of the nested-name-specifier,
19238 the name is instead considered to name the constructor of
19239 class C. [ Note: for example, the constructor is not an
19240 acceptable lookup result in an elaborated-type-specifier so
19241 the constructor would not be used in place of the
19242 injected-class-name. --end note ] Such a constructor name
19243 shall be used only in the declarator-id of a declaration that
19244 names a constructor or in a using-declaration. */
19245 if (tag_type == none_type
19246 && DECL_SELF_REFERENCE_P (decl)
19247 && same_type_p (DECL_CONTEXT (decl), parser->scope))
19248 decl = lookup_qualified_name (parser->scope, ctor_identifier,
19249 tag_type != none_type,
19250 /*complain=*/true);
19252 /* If we have a single function from a using decl, pull it out. */
19253 if (TREE_CODE (decl) == OVERLOAD
19254 && !really_overloaded_fn (decl))
19255 decl = OVL_FUNCTION (decl);
19258 pop_scope (pushed_scope);
19261 /* If the scope is a dependent type and either we deferred lookup or
19262 we did lookup but didn't find the name, rememeber the name. */
19263 if (decl == error_mark_node && TYPE_P (parser->scope)
19264 && dependent_type_p (parser->scope))
19270 /* The resolution to Core Issue 180 says that `struct
19271 A::B' should be considered a type-name, even if `A'
19273 type = make_typename_type (parser->scope, name, tag_type,
19274 /*complain=*/tf_error);
19275 decl = TYPE_NAME (type);
19277 else if (is_template
19278 && (cp_parser_next_token_ends_template_argument_p (parser)
19279 || cp_lexer_next_token_is (parser->lexer,
19281 decl = make_unbound_class_template (parser->scope,
19283 /*complain=*/tf_error);
19285 decl = build_qualified_name (/*type=*/NULL_TREE,
19286 parser->scope, name,
19289 parser->qualifying_scope = parser->scope;
19290 parser->object_scope = NULL_TREE;
19292 else if (object_type)
19294 tree object_decl = NULL_TREE;
19295 /* Look up the name in the scope of the OBJECT_TYPE, unless the
19296 OBJECT_TYPE is not a class. */
19297 if (CLASS_TYPE_P (object_type))
19298 /* If the OBJECT_TYPE is a template specialization, it may
19299 be instantiated during name lookup. In that case, errors
19300 may be issued. Even if we rollback the current tentative
19301 parse, those errors are valid. */
19302 object_decl = lookup_member (object_type,
19305 tag_type != none_type);
19306 /* Look it up in the enclosing context, too. */
19307 decl = lookup_name_real (name, tag_type != none_type,
19309 /*block_p=*/true, is_namespace, flags);
19310 parser->object_scope = object_type;
19311 parser->qualifying_scope = NULL_TREE;
19313 decl = object_decl;
19317 decl = lookup_name_real (name, tag_type != none_type,
19319 /*block_p=*/true, is_namespace, flags);
19320 parser->qualifying_scope = NULL_TREE;
19321 parser->object_scope = NULL_TREE;
19324 /* If the lookup failed, let our caller know. */
19325 if (!decl || decl == error_mark_node)
19326 return error_mark_node;
19328 /* Pull out the template from an injected-class-name (or multiple). */
19330 decl = maybe_get_template_decl_from_type_decl (decl);
19332 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
19333 if (TREE_CODE (decl) == TREE_LIST)
19335 if (ambiguous_decls)
19336 *ambiguous_decls = decl;
19337 /* The error message we have to print is too complicated for
19338 cp_parser_error, so we incorporate its actions directly. */
19339 if (!cp_parser_simulate_error (parser))
19341 error_at (name_location, "reference to %qD is ambiguous",
19343 print_candidates (decl);
19345 return error_mark_node;
19348 gcc_assert (DECL_P (decl)
19349 || TREE_CODE (decl) == OVERLOAD
19350 || TREE_CODE (decl) == SCOPE_REF
19351 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
19352 || BASELINK_P (decl));
19354 /* If we have resolved the name of a member declaration, check to
19355 see if the declaration is accessible. When the name resolves to
19356 set of overloaded functions, accessibility is checked when
19357 overload resolution is done.
19359 During an explicit instantiation, access is not checked at all,
19360 as per [temp.explicit]. */
19362 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
19367 /* Like cp_parser_lookup_name, but for use in the typical case where
19368 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
19369 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
19372 cp_parser_lookup_name_simple (cp_parser* parser, tree name, location_t location)
19374 return cp_parser_lookup_name (parser, name,
19376 /*is_template=*/false,
19377 /*is_namespace=*/false,
19378 /*check_dependency=*/true,
19379 /*ambiguous_decls=*/NULL,
19383 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
19384 the current context, return the TYPE_DECL. If TAG_NAME_P is
19385 true, the DECL indicates the class being defined in a class-head,
19386 or declared in an elaborated-type-specifier.
19388 Otherwise, return DECL. */
19391 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
19393 /* If the TEMPLATE_DECL is being declared as part of a class-head,
19394 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
19397 template <typename T> struct B;
19400 template <typename T> struct A::B {};
19402 Similarly, in an elaborated-type-specifier:
19404 namespace N { struct X{}; }
19407 template <typename T> friend struct N::X;
19410 However, if the DECL refers to a class type, and we are in
19411 the scope of the class, then the name lookup automatically
19412 finds the TYPE_DECL created by build_self_reference rather
19413 than a TEMPLATE_DECL. For example, in:
19415 template <class T> struct S {
19419 there is no need to handle such case. */
19421 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
19422 return DECL_TEMPLATE_RESULT (decl);
19427 /* If too many, or too few, template-parameter lists apply to the
19428 declarator, issue an error message. Returns TRUE if all went well,
19429 and FALSE otherwise. */
19432 cp_parser_check_declarator_template_parameters (cp_parser* parser,
19433 cp_declarator *declarator,
19434 location_t declarator_location)
19436 unsigned num_templates;
19438 /* We haven't seen any classes that involve template parameters yet. */
19441 switch (declarator->kind)
19444 if (declarator->u.id.qualifying_scope)
19448 scope = declarator->u.id.qualifying_scope;
19450 while (scope && CLASS_TYPE_P (scope))
19452 /* You're supposed to have one `template <...>'
19453 for every template class, but you don't need one
19454 for a full specialization. For example:
19456 template <class T> struct S{};
19457 template <> struct S<int> { void f(); };
19458 void S<int>::f () {}
19460 is correct; there shouldn't be a `template <>' for
19461 the definition of `S<int>::f'. */
19462 if (!CLASSTYPE_TEMPLATE_INFO (scope))
19463 /* If SCOPE does not have template information of any
19464 kind, then it is not a template, nor is it nested
19465 within a template. */
19467 if (explicit_class_specialization_p (scope))
19469 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
19472 scope = TYPE_CONTEXT (scope);
19475 else if (TREE_CODE (declarator->u.id.unqualified_name)
19476 == TEMPLATE_ID_EXPR)
19477 /* If the DECLARATOR has the form `X<y>' then it uses one
19478 additional level of template parameters. */
19481 return cp_parser_check_template_parameters
19482 (parser, num_templates, declarator_location, declarator);
19488 case cdk_reference:
19490 return (cp_parser_check_declarator_template_parameters
19491 (parser, declarator->declarator, declarator_location));
19497 gcc_unreachable ();
19502 /* NUM_TEMPLATES were used in the current declaration. If that is
19503 invalid, return FALSE and issue an error messages. Otherwise,
19504 return TRUE. If DECLARATOR is non-NULL, then we are checking a
19505 declarator and we can print more accurate diagnostics. */
19508 cp_parser_check_template_parameters (cp_parser* parser,
19509 unsigned num_templates,
19510 location_t location,
19511 cp_declarator *declarator)
19513 /* If there are the same number of template classes and parameter
19514 lists, that's OK. */
19515 if (parser->num_template_parameter_lists == num_templates)
19517 /* If there are more, but only one more, then we are referring to a
19518 member template. That's OK too. */
19519 if (parser->num_template_parameter_lists == num_templates + 1)
19521 /* If there are more template classes than parameter lists, we have
19524 template <class T> void S<T>::R<T>::f (); */
19525 if (parser->num_template_parameter_lists < num_templates)
19527 if (declarator && !current_function_decl)
19528 error_at (location, "specializing member %<%T::%E%> "
19529 "requires %<template<>%> syntax",
19530 declarator->u.id.qualifying_scope,
19531 declarator->u.id.unqualified_name);
19532 else if (declarator)
19533 error_at (location, "invalid declaration of %<%T::%E%>",
19534 declarator->u.id.qualifying_scope,
19535 declarator->u.id.unqualified_name);
19537 error_at (location, "too few template-parameter-lists");
19540 /* Otherwise, there are too many template parameter lists. We have
19543 template <class T> template <class U> void S::f(); */
19544 error_at (location, "too many template-parameter-lists");
19548 /* Parse an optional `::' token indicating that the following name is
19549 from the global namespace. If so, PARSER->SCOPE is set to the
19550 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
19551 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
19552 Returns the new value of PARSER->SCOPE, if the `::' token is
19553 present, and NULL_TREE otherwise. */
19556 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
19560 /* Peek at the next token. */
19561 token = cp_lexer_peek_token (parser->lexer);
19562 /* If we're looking at a `::' token then we're starting from the
19563 global namespace, not our current location. */
19564 if (token->type == CPP_SCOPE)
19566 /* Consume the `::' token. */
19567 cp_lexer_consume_token (parser->lexer);
19568 /* Set the SCOPE so that we know where to start the lookup. */
19569 parser->scope = global_namespace;
19570 parser->qualifying_scope = global_namespace;
19571 parser->object_scope = NULL_TREE;
19573 return parser->scope;
19575 else if (!current_scope_valid_p)
19577 parser->scope = NULL_TREE;
19578 parser->qualifying_scope = NULL_TREE;
19579 parser->object_scope = NULL_TREE;
19585 /* Returns TRUE if the upcoming token sequence is the start of a
19586 constructor declarator. If FRIEND_P is true, the declarator is
19587 preceded by the `friend' specifier. */
19590 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
19592 bool constructor_p;
19593 tree nested_name_specifier;
19594 cp_token *next_token;
19596 /* The common case is that this is not a constructor declarator, so
19597 try to avoid doing lots of work if at all possible. It's not
19598 valid declare a constructor at function scope. */
19599 if (parser->in_function_body)
19601 /* And only certain tokens can begin a constructor declarator. */
19602 next_token = cp_lexer_peek_token (parser->lexer);
19603 if (next_token->type != CPP_NAME
19604 && next_token->type != CPP_SCOPE
19605 && next_token->type != CPP_NESTED_NAME_SPECIFIER
19606 && next_token->type != CPP_TEMPLATE_ID)
19609 /* Parse tentatively; we are going to roll back all of the tokens
19611 cp_parser_parse_tentatively (parser);
19612 /* Assume that we are looking at a constructor declarator. */
19613 constructor_p = true;
19615 /* Look for the optional `::' operator. */
19616 cp_parser_global_scope_opt (parser,
19617 /*current_scope_valid_p=*/false);
19618 /* Look for the nested-name-specifier. */
19619 nested_name_specifier
19620 = (cp_parser_nested_name_specifier_opt (parser,
19621 /*typename_keyword_p=*/false,
19622 /*check_dependency_p=*/false,
19624 /*is_declaration=*/false));
19625 /* Outside of a class-specifier, there must be a
19626 nested-name-specifier. */
19627 if (!nested_name_specifier &&
19628 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
19630 constructor_p = false;
19631 else if (nested_name_specifier == error_mark_node)
19632 constructor_p = false;
19634 /* If we have a class scope, this is easy; DR 147 says that S::S always
19635 names the constructor, and no other qualified name could. */
19636 if (constructor_p && nested_name_specifier
19637 && CLASS_TYPE_P (nested_name_specifier))
19639 tree id = cp_parser_unqualified_id (parser,
19640 /*template_keyword_p=*/false,
19641 /*check_dependency_p=*/false,
19642 /*declarator_p=*/true,
19643 /*optional_p=*/false);
19644 if (is_overloaded_fn (id))
19645 id = DECL_NAME (get_first_fn (id));
19646 if (!constructor_name_p (id, nested_name_specifier))
19647 constructor_p = false;
19649 /* If we still think that this might be a constructor-declarator,
19650 look for a class-name. */
19651 else if (constructor_p)
19655 template <typename T> struct S {
19659 we must recognize that the nested `S' names a class. */
19661 type_decl = cp_parser_class_name (parser,
19662 /*typename_keyword_p=*/false,
19663 /*template_keyword_p=*/false,
19665 /*check_dependency_p=*/false,
19666 /*class_head_p=*/false,
19667 /*is_declaration=*/false);
19668 /* If there was no class-name, then this is not a constructor. */
19669 constructor_p = !cp_parser_error_occurred (parser);
19671 /* If we're still considering a constructor, we have to see a `(',
19672 to begin the parameter-declaration-clause, followed by either a
19673 `)', an `...', or a decl-specifier. We need to check for a
19674 type-specifier to avoid being fooled into thinking that:
19678 is a constructor. (It is actually a function named `f' that
19679 takes one parameter (of type `int') and returns a value of type
19682 && !cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
19683 constructor_p = false;
19686 && cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
19687 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
19688 /* A parameter declaration begins with a decl-specifier,
19689 which is either the "attribute" keyword, a storage class
19690 specifier, or (usually) a type-specifier. */
19691 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
19694 tree pushed_scope = NULL_TREE;
19695 unsigned saved_num_template_parameter_lists;
19697 /* Names appearing in the type-specifier should be looked up
19698 in the scope of the class. */
19699 if (current_class_type)
19703 type = TREE_TYPE (type_decl);
19704 if (TREE_CODE (type) == TYPENAME_TYPE)
19706 type = resolve_typename_type (type,
19707 /*only_current_p=*/false);
19708 if (TREE_CODE (type) == TYPENAME_TYPE)
19710 cp_parser_abort_tentative_parse (parser);
19714 pushed_scope = push_scope (type);
19717 /* Inside the constructor parameter list, surrounding
19718 template-parameter-lists do not apply. */
19719 saved_num_template_parameter_lists
19720 = parser->num_template_parameter_lists;
19721 parser->num_template_parameter_lists = 0;
19723 /* Look for the type-specifier. */
19724 cp_parser_type_specifier (parser,
19725 CP_PARSER_FLAGS_NONE,
19726 /*decl_specs=*/NULL,
19727 /*is_declarator=*/true,
19728 /*declares_class_or_enum=*/NULL,
19729 /*is_cv_qualifier=*/NULL);
19731 parser->num_template_parameter_lists
19732 = saved_num_template_parameter_lists;
19734 /* Leave the scope of the class. */
19736 pop_scope (pushed_scope);
19738 constructor_p = !cp_parser_error_occurred (parser);
19742 /* We did not really want to consume any tokens. */
19743 cp_parser_abort_tentative_parse (parser);
19745 return constructor_p;
19748 /* Parse the definition of the function given by the DECL_SPECIFIERS,
19749 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
19750 they must be performed once we are in the scope of the function.
19752 Returns the function defined. */
19755 cp_parser_function_definition_from_specifiers_and_declarator
19756 (cp_parser* parser,
19757 cp_decl_specifier_seq *decl_specifiers,
19759 const cp_declarator *declarator)
19764 /* Begin the function-definition. */
19765 success_p = start_function (decl_specifiers, declarator, attributes);
19767 /* The things we're about to see are not directly qualified by any
19768 template headers we've seen thus far. */
19769 reset_specialization ();
19771 /* If there were names looked up in the decl-specifier-seq that we
19772 did not check, check them now. We must wait until we are in the
19773 scope of the function to perform the checks, since the function
19774 might be a friend. */
19775 perform_deferred_access_checks ();
19779 /* Skip the entire function. */
19780 cp_parser_skip_to_end_of_block_or_statement (parser);
19781 fn = error_mark_node;
19783 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
19785 /* Seen already, skip it. An error message has already been output. */
19786 cp_parser_skip_to_end_of_block_or_statement (parser);
19787 fn = current_function_decl;
19788 current_function_decl = NULL_TREE;
19789 /* If this is a function from a class, pop the nested class. */
19790 if (current_class_name)
19791 pop_nested_class ();
19796 if (DECL_DECLARED_INLINE_P (current_function_decl))
19797 tv = TV_PARSE_INLINE;
19799 tv = TV_PARSE_FUNC;
19801 fn = cp_parser_function_definition_after_declarator (parser,
19802 /*inline_p=*/false);
19809 /* Parse the part of a function-definition that follows the
19810 declarator. INLINE_P is TRUE iff this function is an inline
19811 function defined within a class-specifier.
19813 Returns the function defined. */
19816 cp_parser_function_definition_after_declarator (cp_parser* parser,
19820 bool ctor_initializer_p = false;
19821 bool saved_in_unbraced_linkage_specification_p;
19822 bool saved_in_function_body;
19823 unsigned saved_num_template_parameter_lists;
19826 saved_in_function_body = parser->in_function_body;
19827 parser->in_function_body = true;
19828 /* If the next token is `return', then the code may be trying to
19829 make use of the "named return value" extension that G++ used to
19831 token = cp_lexer_peek_token (parser->lexer);
19832 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
19834 /* Consume the `return' keyword. */
19835 cp_lexer_consume_token (parser->lexer);
19836 /* Look for the identifier that indicates what value is to be
19838 cp_parser_identifier (parser);
19839 /* Issue an error message. */
19840 error_at (token->location,
19841 "named return values are no longer supported");
19842 /* Skip tokens until we reach the start of the function body. */
19845 cp_token *token = cp_lexer_peek_token (parser->lexer);
19846 if (token->type == CPP_OPEN_BRACE
19847 || token->type == CPP_EOF
19848 || token->type == CPP_PRAGMA_EOL)
19850 cp_lexer_consume_token (parser->lexer);
19853 /* The `extern' in `extern "C" void f () { ... }' does not apply to
19854 anything declared inside `f'. */
19855 saved_in_unbraced_linkage_specification_p
19856 = parser->in_unbraced_linkage_specification_p;
19857 parser->in_unbraced_linkage_specification_p = false;
19858 /* Inside the function, surrounding template-parameter-lists do not
19860 saved_num_template_parameter_lists
19861 = parser->num_template_parameter_lists;
19862 parser->num_template_parameter_lists = 0;
19864 start_lambda_scope (current_function_decl);
19866 /* If the next token is `try', then we are looking at a
19867 function-try-block. */
19868 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
19869 ctor_initializer_p = cp_parser_function_try_block (parser);
19870 /* A function-try-block includes the function-body, so we only do
19871 this next part if we're not processing a function-try-block. */
19874 = cp_parser_ctor_initializer_opt_and_function_body (parser);
19876 finish_lambda_scope ();
19878 /* Finish the function. */
19879 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
19880 (inline_p ? 2 : 0));
19881 /* Generate code for it, if necessary. */
19882 expand_or_defer_fn (fn);
19883 /* Restore the saved values. */
19884 parser->in_unbraced_linkage_specification_p
19885 = saved_in_unbraced_linkage_specification_p;
19886 parser->num_template_parameter_lists
19887 = saved_num_template_parameter_lists;
19888 parser->in_function_body = saved_in_function_body;
19893 /* Parse a template-declaration, assuming that the `export' (and
19894 `extern') keywords, if present, has already been scanned. MEMBER_P
19895 is as for cp_parser_template_declaration. */
19898 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
19900 tree decl = NULL_TREE;
19901 VEC (deferred_access_check,gc) *checks;
19902 tree parameter_list;
19903 bool friend_p = false;
19904 bool need_lang_pop;
19907 /* Look for the `template' keyword. */
19908 token = cp_lexer_peek_token (parser->lexer);
19909 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE))
19913 if (!cp_parser_require (parser, CPP_LESS, RT_LESS))
19915 if (at_class_scope_p () && current_function_decl)
19917 /* 14.5.2.2 [temp.mem]
19919 A local class shall not have member templates. */
19920 error_at (token->location,
19921 "invalid declaration of member template in local class");
19922 cp_parser_skip_to_end_of_block_or_statement (parser);
19927 A template ... shall not have C linkage. */
19928 if (current_lang_name == lang_name_c)
19930 error_at (token->location, "template with C linkage");
19931 /* Give it C++ linkage to avoid confusing other parts of the
19933 push_lang_context (lang_name_cplusplus);
19934 need_lang_pop = true;
19937 need_lang_pop = false;
19939 /* We cannot perform access checks on the template parameter
19940 declarations until we know what is being declared, just as we
19941 cannot check the decl-specifier list. */
19942 push_deferring_access_checks (dk_deferred);
19944 /* If the next token is `>', then we have an invalid
19945 specialization. Rather than complain about an invalid template
19946 parameter, issue an error message here. */
19947 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
19949 cp_parser_error (parser, "invalid explicit specialization");
19950 begin_specialization ();
19951 parameter_list = NULL_TREE;
19955 /* Parse the template parameters. */
19956 parameter_list = cp_parser_template_parameter_list (parser);
19957 fixup_template_parms ();
19960 /* Get the deferred access checks from the parameter list. These
19961 will be checked once we know what is being declared, as for a
19962 member template the checks must be performed in the scope of the
19963 class containing the member. */
19964 checks = get_deferred_access_checks ();
19966 /* Look for the `>'. */
19967 cp_parser_skip_to_end_of_template_parameter_list (parser);
19968 /* We just processed one more parameter list. */
19969 ++parser->num_template_parameter_lists;
19970 /* If the next token is `template', there are more template
19972 if (cp_lexer_next_token_is_keyword (parser->lexer,
19974 cp_parser_template_declaration_after_export (parser, member_p);
19977 /* There are no access checks when parsing a template, as we do not
19978 know if a specialization will be a friend. */
19979 push_deferring_access_checks (dk_no_check);
19980 token = cp_lexer_peek_token (parser->lexer);
19981 decl = cp_parser_single_declaration (parser,
19984 /*explicit_specialization_p=*/false,
19986 pop_deferring_access_checks ();
19988 /* If this is a member template declaration, let the front
19990 if (member_p && !friend_p && decl)
19992 if (TREE_CODE (decl) == TYPE_DECL)
19993 cp_parser_check_access_in_redeclaration (decl, token->location);
19995 decl = finish_member_template_decl (decl);
19997 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
19998 make_friend_class (current_class_type, TREE_TYPE (decl),
19999 /*complain=*/true);
20001 /* We are done with the current parameter list. */
20002 --parser->num_template_parameter_lists;
20004 pop_deferring_access_checks ();
20007 finish_template_decl (parameter_list);
20009 /* Register member declarations. */
20010 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
20011 finish_member_declaration (decl);
20012 /* For the erroneous case of a template with C linkage, we pushed an
20013 implicit C++ linkage scope; exit that scope now. */
20015 pop_lang_context ();
20016 /* If DECL is a function template, we must return to parse it later.
20017 (Even though there is no definition, there might be default
20018 arguments that need handling.) */
20019 if (member_p && decl
20020 && (TREE_CODE (decl) == FUNCTION_DECL
20021 || DECL_FUNCTION_TEMPLATE_P (decl)))
20022 VEC_safe_push (tree, gc, unparsed_funs_with_definitions, decl);
20025 /* Perform the deferred access checks from a template-parameter-list.
20026 CHECKS is a TREE_LIST of access checks, as returned by
20027 get_deferred_access_checks. */
20030 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
20032 ++processing_template_parmlist;
20033 perform_access_checks (checks);
20034 --processing_template_parmlist;
20037 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
20038 `function-definition' sequence. MEMBER_P is true, this declaration
20039 appears in a class scope.
20041 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
20042 *FRIEND_P is set to TRUE iff the declaration is a friend. */
20045 cp_parser_single_declaration (cp_parser* parser,
20046 VEC (deferred_access_check,gc)* checks,
20048 bool explicit_specialization_p,
20051 int declares_class_or_enum;
20052 tree decl = NULL_TREE;
20053 cp_decl_specifier_seq decl_specifiers;
20054 bool function_definition_p = false;
20055 cp_token *decl_spec_token_start;
20057 /* This function is only used when processing a template
20059 gcc_assert (innermost_scope_kind () == sk_template_parms
20060 || innermost_scope_kind () == sk_template_spec);
20062 /* Defer access checks until we know what is being declared. */
20063 push_deferring_access_checks (dk_deferred);
20065 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
20067 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
20068 cp_parser_decl_specifier_seq (parser,
20069 CP_PARSER_FLAGS_OPTIONAL,
20071 &declares_class_or_enum);
20073 *friend_p = cp_parser_friend_p (&decl_specifiers);
20075 /* There are no template typedefs. */
20076 if (decl_specifiers.specs[(int) ds_typedef])
20078 error_at (decl_spec_token_start->location,
20079 "template declaration of %<typedef%>");
20080 decl = error_mark_node;
20083 /* Gather up the access checks that occurred the
20084 decl-specifier-seq. */
20085 stop_deferring_access_checks ();
20087 /* Check for the declaration of a template class. */
20088 if (declares_class_or_enum)
20090 if (cp_parser_declares_only_class_p (parser))
20092 decl = shadow_tag (&decl_specifiers);
20097 friend template <typename T> struct A<T>::B;
20100 A<T>::B will be represented by a TYPENAME_TYPE, and
20101 therefore not recognized by shadow_tag. */
20102 if (friend_p && *friend_p
20104 && decl_specifiers.type
20105 && TYPE_P (decl_specifiers.type))
20106 decl = decl_specifiers.type;
20108 if (decl && decl != error_mark_node)
20109 decl = TYPE_NAME (decl);
20111 decl = error_mark_node;
20113 /* Perform access checks for template parameters. */
20114 cp_parser_perform_template_parameter_access_checks (checks);
20118 /* Complain about missing 'typename' or other invalid type names. */
20119 if (!decl_specifiers.any_type_specifiers_p
20120 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
20122 /* cp_parser_parse_and_diagnose_invalid_type_name calls
20123 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
20124 the rest of this declaration. */
20125 decl = error_mark_node;
20129 /* If it's not a template class, try for a template function. If
20130 the next token is a `;', then this declaration does not declare
20131 anything. But, if there were errors in the decl-specifiers, then
20132 the error might well have come from an attempted class-specifier.
20133 In that case, there's no need to warn about a missing declarator. */
20135 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
20136 || decl_specifiers.type != error_mark_node))
20138 decl = cp_parser_init_declarator (parser,
20141 /*function_definition_allowed_p=*/true,
20143 declares_class_or_enum,
20144 &function_definition_p,
20147 /* 7.1.1-1 [dcl.stc]
20149 A storage-class-specifier shall not be specified in an explicit
20150 specialization... */
20152 && explicit_specialization_p
20153 && decl_specifiers.storage_class != sc_none)
20155 error_at (decl_spec_token_start->location,
20156 "explicit template specialization cannot have a storage class");
20157 decl = error_mark_node;
20161 /* Look for a trailing `;' after the declaration. */
20162 if (!function_definition_p
20163 && (decl == error_mark_node
20164 || !cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON)))
20165 cp_parser_skip_to_end_of_block_or_statement (parser);
20168 pop_deferring_access_checks ();
20170 /* Clear any current qualification; whatever comes next is the start
20171 of something new. */
20172 parser->scope = NULL_TREE;
20173 parser->qualifying_scope = NULL_TREE;
20174 parser->object_scope = NULL_TREE;
20179 /* Parse a cast-expression that is not the operand of a unary "&". */
20182 cp_parser_simple_cast_expression (cp_parser *parser)
20184 return cp_parser_cast_expression (parser, /*address_p=*/false,
20185 /*cast_p=*/false, NULL);
20188 /* Parse a functional cast to TYPE. Returns an expression
20189 representing the cast. */
20192 cp_parser_functional_cast (cp_parser* parser, tree type)
20195 tree expression_list;
20199 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
20201 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
20202 expression_list = cp_parser_braced_list (parser, &nonconst_p);
20203 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
20204 if (TREE_CODE (type) == TYPE_DECL)
20205 type = TREE_TYPE (type);
20206 return finish_compound_literal (type, expression_list,
20207 tf_warning_or_error);
20211 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
20213 /*allow_expansion_p=*/true,
20214 /*non_constant_p=*/NULL);
20216 expression_list = error_mark_node;
20219 expression_list = build_tree_list_vec (vec);
20220 release_tree_vector (vec);
20223 cast = build_functional_cast (type, expression_list,
20224 tf_warning_or_error);
20225 /* [expr.const]/1: In an integral constant expression "only type
20226 conversions to integral or enumeration type can be used". */
20227 if (TREE_CODE (type) == TYPE_DECL)
20228 type = TREE_TYPE (type);
20229 if (cast != error_mark_node
20230 && !cast_valid_in_integral_constant_expression_p (type)
20231 && cp_parser_non_integral_constant_expression (parser,
20233 return error_mark_node;
20237 /* Save the tokens that make up the body of a member function defined
20238 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
20239 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
20240 specifiers applied to the declaration. Returns the FUNCTION_DECL
20241 for the member function. */
20244 cp_parser_save_member_function_body (cp_parser* parser,
20245 cp_decl_specifier_seq *decl_specifiers,
20246 cp_declarator *declarator,
20253 /* Create the FUNCTION_DECL. */
20254 fn = grokmethod (decl_specifiers, declarator, attributes);
20255 /* If something went badly wrong, bail out now. */
20256 if (fn == error_mark_node)
20258 /* If there's a function-body, skip it. */
20259 if (cp_parser_token_starts_function_definition_p
20260 (cp_lexer_peek_token (parser->lexer)))
20261 cp_parser_skip_to_end_of_block_or_statement (parser);
20262 return error_mark_node;
20265 /* Remember it, if there default args to post process. */
20266 cp_parser_save_default_args (parser, fn);
20268 /* Save away the tokens that make up the body of the
20270 first = parser->lexer->next_token;
20271 /* We can have braced-init-list mem-initializers before the fn body. */
20272 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
20274 cp_lexer_consume_token (parser->lexer);
20275 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
20276 && cp_lexer_next_token_is_not_keyword (parser->lexer, RID_TRY))
20278 /* cache_group will stop after an un-nested { } pair, too. */
20279 if (cp_parser_cache_group (parser, CPP_CLOSE_PAREN, /*depth=*/0))
20282 /* variadic mem-inits have ... after the ')'. */
20283 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
20284 cp_lexer_consume_token (parser->lexer);
20287 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
20288 /* Handle function try blocks. */
20289 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
20290 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
20291 last = parser->lexer->next_token;
20293 /* Save away the inline definition; we will process it when the
20294 class is complete. */
20295 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
20296 DECL_PENDING_INLINE_P (fn) = 1;
20298 /* We need to know that this was defined in the class, so that
20299 friend templates are handled correctly. */
20300 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
20302 /* Add FN to the queue of functions to be parsed later. */
20303 VEC_safe_push (tree, gc, unparsed_funs_with_definitions, fn);
20308 /* Parse a template-argument-list, as well as the trailing ">" (but
20309 not the opening ">"). See cp_parser_template_argument_list for the
20313 cp_parser_enclosed_template_argument_list (cp_parser* parser)
20317 tree saved_qualifying_scope;
20318 tree saved_object_scope;
20319 bool saved_greater_than_is_operator_p;
20320 int saved_unevaluated_operand;
20321 int saved_inhibit_evaluation_warnings;
20325 When parsing a template-id, the first non-nested `>' is taken as
20326 the end of the template-argument-list rather than a greater-than
20328 saved_greater_than_is_operator_p
20329 = parser->greater_than_is_operator_p;
20330 parser->greater_than_is_operator_p = false;
20331 /* Parsing the argument list may modify SCOPE, so we save it
20333 saved_scope = parser->scope;
20334 saved_qualifying_scope = parser->qualifying_scope;
20335 saved_object_scope = parser->object_scope;
20336 /* We need to evaluate the template arguments, even though this
20337 template-id may be nested within a "sizeof". */
20338 saved_unevaluated_operand = cp_unevaluated_operand;
20339 cp_unevaluated_operand = 0;
20340 saved_inhibit_evaluation_warnings = c_inhibit_evaluation_warnings;
20341 c_inhibit_evaluation_warnings = 0;
20342 /* Parse the template-argument-list itself. */
20343 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER)
20344 || cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
20345 arguments = NULL_TREE;
20347 arguments = cp_parser_template_argument_list (parser);
20348 /* Look for the `>' that ends the template-argument-list. If we find
20349 a '>>' instead, it's probably just a typo. */
20350 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
20352 if (cxx_dialect != cxx98)
20354 /* In C++0x, a `>>' in a template argument list or cast
20355 expression is considered to be two separate `>'
20356 tokens. So, change the current token to a `>', but don't
20357 consume it: it will be consumed later when the outer
20358 template argument list (or cast expression) is parsed.
20359 Note that this replacement of `>' for `>>' is necessary
20360 even if we are parsing tentatively: in the tentative
20361 case, after calling
20362 cp_parser_enclosed_template_argument_list we will always
20363 throw away all of the template arguments and the first
20364 closing `>', either because the template argument list
20365 was erroneous or because we are replacing those tokens
20366 with a CPP_TEMPLATE_ID token. The second `>' (which will
20367 not have been thrown away) is needed either to close an
20368 outer template argument list or to complete a new-style
20370 cp_token *token = cp_lexer_peek_token (parser->lexer);
20371 token->type = CPP_GREATER;
20373 else if (!saved_greater_than_is_operator_p)
20375 /* If we're in a nested template argument list, the '>>' has
20376 to be a typo for '> >'. We emit the error message, but we
20377 continue parsing and we push a '>' as next token, so that
20378 the argument list will be parsed correctly. Note that the
20379 global source location is still on the token before the
20380 '>>', so we need to say explicitly where we want it. */
20381 cp_token *token = cp_lexer_peek_token (parser->lexer);
20382 error_at (token->location, "%<>>%> should be %<> >%> "
20383 "within a nested template argument list");
20385 token->type = CPP_GREATER;
20389 /* If this is not a nested template argument list, the '>>'
20390 is a typo for '>'. Emit an error message and continue.
20391 Same deal about the token location, but here we can get it
20392 right by consuming the '>>' before issuing the diagnostic. */
20393 cp_token *token = cp_lexer_consume_token (parser->lexer);
20394 error_at (token->location,
20395 "spurious %<>>%>, use %<>%> to terminate "
20396 "a template argument list");
20400 cp_parser_skip_to_end_of_template_parameter_list (parser);
20401 /* The `>' token might be a greater-than operator again now. */
20402 parser->greater_than_is_operator_p
20403 = saved_greater_than_is_operator_p;
20404 /* Restore the SAVED_SCOPE. */
20405 parser->scope = saved_scope;
20406 parser->qualifying_scope = saved_qualifying_scope;
20407 parser->object_scope = saved_object_scope;
20408 cp_unevaluated_operand = saved_unevaluated_operand;
20409 c_inhibit_evaluation_warnings = saved_inhibit_evaluation_warnings;
20414 /* MEMBER_FUNCTION is a member function, or a friend. If default
20415 arguments, or the body of the function have not yet been parsed,
20419 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
20421 timevar_push (TV_PARSE_INMETH);
20422 /* If this member is a template, get the underlying
20424 if (DECL_FUNCTION_TEMPLATE_P (member_function))
20425 member_function = DECL_TEMPLATE_RESULT (member_function);
20427 /* There should not be any class definitions in progress at this
20428 point; the bodies of members are only parsed outside of all class
20430 gcc_assert (parser->num_classes_being_defined == 0);
20431 /* While we're parsing the member functions we might encounter more
20432 classes. We want to handle them right away, but we don't want
20433 them getting mixed up with functions that are currently in the
20435 push_unparsed_function_queues (parser);
20437 /* Make sure that any template parameters are in scope. */
20438 maybe_begin_member_template_processing (member_function);
20440 /* If the body of the function has not yet been parsed, parse it
20442 if (DECL_PENDING_INLINE_P (member_function))
20444 tree function_scope;
20445 cp_token_cache *tokens;
20447 /* The function is no longer pending; we are processing it. */
20448 tokens = DECL_PENDING_INLINE_INFO (member_function);
20449 DECL_PENDING_INLINE_INFO (member_function) = NULL;
20450 DECL_PENDING_INLINE_P (member_function) = 0;
20452 /* If this is a local class, enter the scope of the containing
20454 function_scope = current_function_decl;
20455 if (function_scope)
20456 push_function_context ();
20458 /* Push the body of the function onto the lexer stack. */
20459 cp_parser_push_lexer_for_tokens (parser, tokens);
20461 /* Let the front end know that we going to be defining this
20463 start_preparsed_function (member_function, NULL_TREE,
20464 SF_PRE_PARSED | SF_INCLASS_INLINE);
20466 /* Don't do access checking if it is a templated function. */
20467 if (processing_template_decl)
20468 push_deferring_access_checks (dk_no_check);
20470 /* Now, parse the body of the function. */
20471 cp_parser_function_definition_after_declarator (parser,
20472 /*inline_p=*/true);
20474 if (processing_template_decl)
20475 pop_deferring_access_checks ();
20477 /* Leave the scope of the containing function. */
20478 if (function_scope)
20479 pop_function_context ();
20480 cp_parser_pop_lexer (parser);
20483 /* Remove any template parameters from the symbol table. */
20484 maybe_end_member_template_processing ();
20486 /* Restore the queue. */
20487 pop_unparsed_function_queues (parser);
20488 timevar_pop (TV_PARSE_INMETH);
20491 /* If DECL contains any default args, remember it on the unparsed
20492 functions queue. */
20495 cp_parser_save_default_args (cp_parser* parser, tree decl)
20499 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
20501 probe = TREE_CHAIN (probe))
20502 if (TREE_PURPOSE (probe))
20504 cp_default_arg_entry *entry
20505 = VEC_safe_push (cp_default_arg_entry, gc,
20506 unparsed_funs_with_default_args, NULL);
20507 entry->class_type = current_class_type;
20508 entry->decl = decl;
20513 /* FN is a FUNCTION_DECL which may contains a parameter with an
20514 unparsed DEFAULT_ARG. Parse the default args now. This function
20515 assumes that the current scope is the scope in which the default
20516 argument should be processed. */
20519 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
20521 bool saved_local_variables_forbidden_p;
20522 tree parm, parmdecl;
20524 /* While we're parsing the default args, we might (due to the
20525 statement expression extension) encounter more classes. We want
20526 to handle them right away, but we don't want them getting mixed
20527 up with default args that are currently in the queue. */
20528 push_unparsed_function_queues (parser);
20530 /* Local variable names (and the `this' keyword) may not appear
20531 in a default argument. */
20532 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
20533 parser->local_variables_forbidden_p = true;
20535 push_defarg_context (fn);
20537 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn)),
20538 parmdecl = DECL_ARGUMENTS (fn);
20539 parm && parm != void_list_node;
20540 parm = TREE_CHAIN (parm),
20541 parmdecl = DECL_CHAIN (parmdecl))
20543 cp_token_cache *tokens;
20544 tree default_arg = TREE_PURPOSE (parm);
20546 VEC(tree,gc) *insts;
20553 if (TREE_CODE (default_arg) != DEFAULT_ARG)
20554 /* This can happen for a friend declaration for a function
20555 already declared with default arguments. */
20558 /* Push the saved tokens for the default argument onto the parser's
20560 tokens = DEFARG_TOKENS (default_arg);
20561 cp_parser_push_lexer_for_tokens (parser, tokens);
20563 start_lambda_scope (parmdecl);
20565 /* Parse the assignment-expression. */
20566 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
20567 if (parsed_arg == error_mark_node)
20569 cp_parser_pop_lexer (parser);
20573 if (!processing_template_decl)
20574 parsed_arg = check_default_argument (TREE_VALUE (parm), parsed_arg);
20576 TREE_PURPOSE (parm) = parsed_arg;
20578 /* Update any instantiations we've already created. */
20579 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
20580 VEC_iterate (tree, insts, ix, copy); ix++)
20581 TREE_PURPOSE (copy) = parsed_arg;
20583 finish_lambda_scope ();
20585 /* If the token stream has not been completely used up, then
20586 there was extra junk after the end of the default
20588 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
20589 cp_parser_error (parser, "expected %<,%>");
20591 /* Revert to the main lexer. */
20592 cp_parser_pop_lexer (parser);
20595 pop_defarg_context ();
20597 /* Make sure no default arg is missing. */
20598 check_default_args (fn);
20600 /* Restore the state of local_variables_forbidden_p. */
20601 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
20603 /* Restore the queue. */
20604 pop_unparsed_function_queues (parser);
20607 /* Parse the operand of `sizeof' (or a similar operator). Returns
20608 either a TYPE or an expression, depending on the form of the
20609 input. The KEYWORD indicates which kind of expression we have
20613 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
20615 tree expr = NULL_TREE;
20616 const char *saved_message;
20618 bool saved_integral_constant_expression_p;
20619 bool saved_non_integral_constant_expression_p;
20620 bool pack_expansion_p = false;
20622 /* Types cannot be defined in a `sizeof' expression. Save away the
20624 saved_message = parser->type_definition_forbidden_message;
20625 /* And create the new one. */
20626 tmp = concat ("types may not be defined in %<",
20627 IDENTIFIER_POINTER (ridpointers[keyword]),
20628 "%> expressions", NULL);
20629 parser->type_definition_forbidden_message = tmp;
20631 /* The restrictions on constant-expressions do not apply inside
20632 sizeof expressions. */
20633 saved_integral_constant_expression_p
20634 = parser->integral_constant_expression_p;
20635 saved_non_integral_constant_expression_p
20636 = parser->non_integral_constant_expression_p;
20637 parser->integral_constant_expression_p = false;
20639 /* If it's a `...', then we are computing the length of a parameter
20641 if (keyword == RID_SIZEOF
20642 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
20644 /* Consume the `...'. */
20645 cp_lexer_consume_token (parser->lexer);
20646 maybe_warn_variadic_templates ();
20648 /* Note that this is an expansion. */
20649 pack_expansion_p = true;
20652 /* Do not actually evaluate the expression. */
20653 ++cp_unevaluated_operand;
20654 ++c_inhibit_evaluation_warnings;
20655 /* If it's a `(', then we might be looking at the type-id
20657 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
20660 bool saved_in_type_id_in_expr_p;
20662 /* We can't be sure yet whether we're looking at a type-id or an
20664 cp_parser_parse_tentatively (parser);
20665 /* Consume the `('. */
20666 cp_lexer_consume_token (parser->lexer);
20667 /* Parse the type-id. */
20668 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
20669 parser->in_type_id_in_expr_p = true;
20670 type = cp_parser_type_id (parser);
20671 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
20672 /* Now, look for the trailing `)'. */
20673 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
20674 /* If all went well, then we're done. */
20675 if (cp_parser_parse_definitely (parser))
20677 cp_decl_specifier_seq decl_specs;
20679 /* Build a trivial decl-specifier-seq. */
20680 clear_decl_specs (&decl_specs);
20681 decl_specs.type = type;
20683 /* Call grokdeclarator to figure out what type this is. */
20684 expr = grokdeclarator (NULL,
20688 /*attrlist=*/NULL);
20692 /* If the type-id production did not work out, then we must be
20693 looking at the unary-expression production. */
20695 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
20696 /*cast_p=*/false, NULL);
20698 if (pack_expansion_p)
20699 /* Build a pack expansion. */
20700 expr = make_pack_expansion (expr);
20702 /* Go back to evaluating expressions. */
20703 --cp_unevaluated_operand;
20704 --c_inhibit_evaluation_warnings;
20706 /* Free the message we created. */
20708 /* And restore the old one. */
20709 parser->type_definition_forbidden_message = saved_message;
20710 parser->integral_constant_expression_p
20711 = saved_integral_constant_expression_p;
20712 parser->non_integral_constant_expression_p
20713 = saved_non_integral_constant_expression_p;
20718 /* If the current declaration has no declarator, return true. */
20721 cp_parser_declares_only_class_p (cp_parser *parser)
20723 /* If the next token is a `;' or a `,' then there is no
20725 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
20726 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
20729 /* Update the DECL_SPECS to reflect the storage class indicated by
20733 cp_parser_set_storage_class (cp_parser *parser,
20734 cp_decl_specifier_seq *decl_specs,
20736 location_t location)
20738 cp_storage_class storage_class;
20740 if (parser->in_unbraced_linkage_specification_p)
20742 error_at (location, "invalid use of %qD in linkage specification",
20743 ridpointers[keyword]);
20746 else if (decl_specs->storage_class != sc_none)
20748 decl_specs->conflicting_specifiers_p = true;
20752 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
20753 && decl_specs->specs[(int) ds_thread])
20755 error_at (location, "%<__thread%> before %qD", ridpointers[keyword]);
20756 decl_specs->specs[(int) ds_thread] = 0;
20762 storage_class = sc_auto;
20765 storage_class = sc_register;
20768 storage_class = sc_static;
20771 storage_class = sc_extern;
20774 storage_class = sc_mutable;
20777 gcc_unreachable ();
20779 decl_specs->storage_class = storage_class;
20781 /* A storage class specifier cannot be applied alongside a typedef
20782 specifier. If there is a typedef specifier present then set
20783 conflicting_specifiers_p which will trigger an error later
20784 on in grokdeclarator. */
20785 if (decl_specs->specs[(int)ds_typedef])
20786 decl_specs->conflicting_specifiers_p = true;
20789 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
20790 is true, the type is a user-defined type; otherwise it is a
20791 built-in type specified by a keyword. */
20794 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
20796 location_t location,
20797 bool user_defined_p)
20799 decl_specs->any_specifiers_p = true;
20801 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
20802 (with, for example, in "typedef int wchar_t;") we remember that
20803 this is what happened. In system headers, we ignore these
20804 declarations so that G++ can work with system headers that are not
20806 if (decl_specs->specs[(int) ds_typedef]
20808 && (type_spec == boolean_type_node
20809 || type_spec == char16_type_node
20810 || type_spec == char32_type_node
20811 || type_spec == wchar_type_node)
20812 && (decl_specs->type
20813 || decl_specs->specs[(int) ds_long]
20814 || decl_specs->specs[(int) ds_short]
20815 || decl_specs->specs[(int) ds_unsigned]
20816 || decl_specs->specs[(int) ds_signed]))
20818 decl_specs->redefined_builtin_type = type_spec;
20819 if (!decl_specs->type)
20821 decl_specs->type = type_spec;
20822 decl_specs->user_defined_type_p = false;
20823 decl_specs->type_location = location;
20826 else if (decl_specs->type)
20827 decl_specs->multiple_types_p = true;
20830 decl_specs->type = type_spec;
20831 decl_specs->user_defined_type_p = user_defined_p;
20832 decl_specs->redefined_builtin_type = NULL_TREE;
20833 decl_specs->type_location = location;
20837 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
20838 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
20841 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
20843 return decl_specifiers->specs[(int) ds_friend] != 0;
20846 /* Issue an error message indicating that TOKEN_DESC was expected.
20847 If KEYWORD is true, it indicated this function is called by
20848 cp_parser_require_keword and the required token can only be
20849 a indicated keyword. */
20852 cp_parser_required_error (cp_parser *parser,
20853 required_token token_desc,
20856 switch (token_desc)
20859 cp_parser_error (parser, "expected %<new%>");
20862 cp_parser_error (parser, "expected %<delete%>");
20865 cp_parser_error (parser, "expected %<return%>");
20868 cp_parser_error (parser, "expected %<while%>");
20871 cp_parser_error (parser, "expected %<extern%>");
20873 case RT_STATIC_ASSERT:
20874 cp_parser_error (parser, "expected %<static_assert%>");
20877 cp_parser_error (parser, "expected %<decltype%>");
20880 cp_parser_error (parser, "expected %<operator%>");
20883 cp_parser_error (parser, "expected %<class%>");
20886 cp_parser_error (parser, "expected %<template%>");
20889 cp_parser_error (parser, "expected %<namespace%>");
20892 cp_parser_error (parser, "expected %<using%>");
20895 cp_parser_error (parser, "expected %<asm%>");
20898 cp_parser_error (parser, "expected %<try%>");
20901 cp_parser_error (parser, "expected %<catch%>");
20904 cp_parser_error (parser, "expected %<throw%>");
20907 cp_parser_error (parser, "expected %<__label__%>");
20910 cp_parser_error (parser, "expected %<@try%>");
20912 case RT_AT_SYNCHRONIZED:
20913 cp_parser_error (parser, "expected %<@synchronized%>");
20916 cp_parser_error (parser, "expected %<@throw%>");
20923 switch (token_desc)
20926 cp_parser_error (parser, "expected %<;%>");
20928 case RT_OPEN_PAREN:
20929 cp_parser_error (parser, "expected %<(%>");
20931 case RT_CLOSE_BRACE:
20932 cp_parser_error (parser, "expected %<}%>");
20934 case RT_OPEN_BRACE:
20935 cp_parser_error (parser, "expected %<{%>");
20937 case RT_CLOSE_SQUARE:
20938 cp_parser_error (parser, "expected %<]%>");
20940 case RT_OPEN_SQUARE:
20941 cp_parser_error (parser, "expected %<[%>");
20944 cp_parser_error (parser, "expected %<,%>");
20947 cp_parser_error (parser, "expected %<::%>");
20950 cp_parser_error (parser, "expected %<<%>");
20953 cp_parser_error (parser, "expected %<>%>");
20956 cp_parser_error (parser, "expected %<=%>");
20959 cp_parser_error (parser, "expected %<...%>");
20962 cp_parser_error (parser, "expected %<*%>");
20965 cp_parser_error (parser, "expected %<~%>");
20968 cp_parser_error (parser, "expected %<:%>");
20970 case RT_COLON_SCOPE:
20971 cp_parser_error (parser, "expected %<:%> or %<::%>");
20973 case RT_CLOSE_PAREN:
20974 cp_parser_error (parser, "expected %<)%>");
20976 case RT_COMMA_CLOSE_PAREN:
20977 cp_parser_error (parser, "expected %<,%> or %<)%>");
20979 case RT_PRAGMA_EOL:
20980 cp_parser_error (parser, "expected end of line");
20983 cp_parser_error (parser, "expected identifier");
20986 cp_parser_error (parser, "expected selection-statement");
20988 case RT_INTERATION:
20989 cp_parser_error (parser, "expected iteration-statement");
20992 cp_parser_error (parser, "expected jump-statement");
20995 cp_parser_error (parser, "expected class-key");
20997 case RT_CLASS_TYPENAME_TEMPLATE:
20998 cp_parser_error (parser,
20999 "expected %<class%>, %<typename%>, or %<template%>");
21002 gcc_unreachable ();
21006 gcc_unreachable ();
21011 /* If the next token is of the indicated TYPE, consume it. Otherwise,
21012 issue an error message indicating that TOKEN_DESC was expected.
21014 Returns the token consumed, if the token had the appropriate type.
21015 Otherwise, returns NULL. */
21018 cp_parser_require (cp_parser* parser,
21019 enum cpp_ttype type,
21020 required_token token_desc)
21022 if (cp_lexer_next_token_is (parser->lexer, type))
21023 return cp_lexer_consume_token (parser->lexer);
21026 /* Output the MESSAGE -- unless we're parsing tentatively. */
21027 if (!cp_parser_simulate_error (parser))
21028 cp_parser_required_error (parser, token_desc, /*keyword=*/false);
21033 /* An error message is produced if the next token is not '>'.
21034 All further tokens are skipped until the desired token is
21035 found or '{', '}', ';' or an unbalanced ')' or ']'. */
21038 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
21040 /* Current level of '< ... >'. */
21041 unsigned level = 0;
21042 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
21043 unsigned nesting_depth = 0;
21045 /* Are we ready, yet? If not, issue error message. */
21046 if (cp_parser_require (parser, CPP_GREATER, RT_GREATER))
21049 /* Skip tokens until the desired token is found. */
21052 /* Peek at the next token. */
21053 switch (cp_lexer_peek_token (parser->lexer)->type)
21056 if (!nesting_depth)
21061 if (cxx_dialect == cxx98)
21062 /* C++0x views the `>>' operator as two `>' tokens, but
21065 else if (!nesting_depth && level-- == 0)
21067 /* We've hit a `>>' where the first `>' closes the
21068 template argument list, and the second `>' is
21069 spurious. Just consume the `>>' and stop; we've
21070 already produced at least one error. */
21071 cp_lexer_consume_token (parser->lexer);
21074 /* Fall through for C++0x, so we handle the second `>' in
21078 if (!nesting_depth && level-- == 0)
21080 /* We've reached the token we want, consume it and stop. */
21081 cp_lexer_consume_token (parser->lexer);
21086 case CPP_OPEN_PAREN:
21087 case CPP_OPEN_SQUARE:
21091 case CPP_CLOSE_PAREN:
21092 case CPP_CLOSE_SQUARE:
21093 if (nesting_depth-- == 0)
21098 case CPP_PRAGMA_EOL:
21099 case CPP_SEMICOLON:
21100 case CPP_OPEN_BRACE:
21101 case CPP_CLOSE_BRACE:
21102 /* The '>' was probably forgotten, don't look further. */
21109 /* Consume this token. */
21110 cp_lexer_consume_token (parser->lexer);
21114 /* If the next token is the indicated keyword, consume it. Otherwise,
21115 issue an error message indicating that TOKEN_DESC was expected.
21117 Returns the token consumed, if the token had the appropriate type.
21118 Otherwise, returns NULL. */
21121 cp_parser_require_keyword (cp_parser* parser,
21123 required_token token_desc)
21125 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
21127 if (token && token->keyword != keyword)
21129 cp_parser_required_error (parser, token_desc, /*keyword=*/true);
21136 /* Returns TRUE iff TOKEN is a token that can begin the body of a
21137 function-definition. */
21140 cp_parser_token_starts_function_definition_p (cp_token* token)
21142 return (/* An ordinary function-body begins with an `{'. */
21143 token->type == CPP_OPEN_BRACE
21144 /* A ctor-initializer begins with a `:'. */
21145 || token->type == CPP_COLON
21146 /* A function-try-block begins with `try'. */
21147 || token->keyword == RID_TRY
21148 /* The named return value extension begins with `return'. */
21149 || token->keyword == RID_RETURN);
21152 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
21156 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
21160 token = cp_lexer_peek_token (parser->lexer);
21161 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
21164 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
21165 C++0x) ending a template-argument. */
21168 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
21172 token = cp_lexer_peek_token (parser->lexer);
21173 return (token->type == CPP_COMMA
21174 || token->type == CPP_GREATER
21175 || token->type == CPP_ELLIPSIS
21176 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT));
21179 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
21180 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
21183 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
21188 token = cp_lexer_peek_nth_token (parser->lexer, n);
21189 if (token->type == CPP_LESS)
21191 /* Check for the sequence `<::' in the original code. It would be lexed as
21192 `[:', where `[' is a digraph, and there is no whitespace before
21194 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
21197 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
21198 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
21204 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
21205 or none_type otherwise. */
21207 static enum tag_types
21208 cp_parser_token_is_class_key (cp_token* token)
21210 switch (token->keyword)
21215 return record_type;
21224 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
21227 cp_parser_check_class_key (enum tag_types class_key, tree type)
21229 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
21230 permerror (input_location, "%qs tag used in naming %q#T",
21231 class_key == union_type ? "union"
21232 : class_key == record_type ? "struct" : "class",
21236 /* Issue an error message if DECL is redeclared with different
21237 access than its original declaration [class.access.spec/3].
21238 This applies to nested classes and nested class templates.
21242 cp_parser_check_access_in_redeclaration (tree decl, location_t location)
21244 if (!decl || !CLASS_TYPE_P (TREE_TYPE (decl)))
21247 if ((TREE_PRIVATE (decl)
21248 != (current_access_specifier == access_private_node))
21249 || (TREE_PROTECTED (decl)
21250 != (current_access_specifier == access_protected_node)))
21251 error_at (location, "%qD redeclared with different access", decl);
21254 /* Look for the `template' keyword, as a syntactic disambiguator.
21255 Return TRUE iff it is present, in which case it will be
21259 cp_parser_optional_template_keyword (cp_parser *parser)
21261 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
21263 /* The `template' keyword can only be used within templates;
21264 outside templates the parser can always figure out what is a
21265 template and what is not. */
21266 if (!processing_template_decl)
21268 cp_token *token = cp_lexer_peek_token (parser->lexer);
21269 error_at (token->location,
21270 "%<template%> (as a disambiguator) is only allowed "
21271 "within templates");
21272 /* If this part of the token stream is rescanned, the same
21273 error message would be generated. So, we purge the token
21274 from the stream. */
21275 cp_lexer_purge_token (parser->lexer);
21280 /* Consume the `template' keyword. */
21281 cp_lexer_consume_token (parser->lexer);
21289 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
21290 set PARSER->SCOPE, and perform other related actions. */
21293 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
21296 struct tree_check *check_value;
21297 deferred_access_check *chk;
21298 VEC (deferred_access_check,gc) *checks;
21300 /* Get the stored value. */
21301 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
21302 /* Perform any access checks that were deferred. */
21303 checks = check_value->checks;
21306 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
21307 perform_or_defer_access_check (chk->binfo,
21311 /* Set the scope from the stored value. */
21312 parser->scope = check_value->value;
21313 parser->qualifying_scope = check_value->qualifying_scope;
21314 parser->object_scope = NULL_TREE;
21317 /* Consume tokens up through a non-nested END token. Returns TRUE if we
21318 encounter the end of a block before what we were looking for. */
21321 cp_parser_cache_group (cp_parser *parser,
21322 enum cpp_ttype end,
21327 cp_token *token = cp_lexer_peek_token (parser->lexer);
21329 /* Abort a parenthesized expression if we encounter a semicolon. */
21330 if ((end == CPP_CLOSE_PAREN || depth == 0)
21331 && token->type == CPP_SEMICOLON)
21333 /* If we've reached the end of the file, stop. */
21334 if (token->type == CPP_EOF
21335 || (end != CPP_PRAGMA_EOL
21336 && token->type == CPP_PRAGMA_EOL))
21338 if (token->type == CPP_CLOSE_BRACE && depth == 0)
21339 /* We've hit the end of an enclosing block, so there's been some
21340 kind of syntax error. */
21343 /* Consume the token. */
21344 cp_lexer_consume_token (parser->lexer);
21345 /* See if it starts a new group. */
21346 if (token->type == CPP_OPEN_BRACE)
21348 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
21349 /* In theory this should probably check end == '}', but
21350 cp_parser_save_member_function_body needs it to exit
21351 after either '}' or ')' when called with ')'. */
21355 else if (token->type == CPP_OPEN_PAREN)
21357 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
21358 if (depth == 0 && end == CPP_CLOSE_PAREN)
21361 else if (token->type == CPP_PRAGMA)
21362 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
21363 else if (token->type == end)
21368 /* Begin parsing tentatively. We always save tokens while parsing
21369 tentatively so that if the tentative parsing fails we can restore the
21373 cp_parser_parse_tentatively (cp_parser* parser)
21375 /* Enter a new parsing context. */
21376 parser->context = cp_parser_context_new (parser->context);
21377 /* Begin saving tokens. */
21378 cp_lexer_save_tokens (parser->lexer);
21379 /* In order to avoid repetitive access control error messages,
21380 access checks are queued up until we are no longer parsing
21382 push_deferring_access_checks (dk_deferred);
21385 /* Commit to the currently active tentative parse. */
21388 cp_parser_commit_to_tentative_parse (cp_parser* parser)
21390 cp_parser_context *context;
21393 /* Mark all of the levels as committed. */
21394 lexer = parser->lexer;
21395 for (context = parser->context; context->next; context = context->next)
21397 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
21399 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
21400 while (!cp_lexer_saving_tokens (lexer))
21401 lexer = lexer->next;
21402 cp_lexer_commit_tokens (lexer);
21406 /* Abort the currently active tentative parse. All consumed tokens
21407 will be rolled back, and no diagnostics will be issued. */
21410 cp_parser_abort_tentative_parse (cp_parser* parser)
21412 gcc_assert (parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED
21413 || errorcount > 0);
21414 cp_parser_simulate_error (parser);
21415 /* Now, pretend that we want to see if the construct was
21416 successfully parsed. */
21417 cp_parser_parse_definitely (parser);
21420 /* Stop parsing tentatively. If a parse error has occurred, restore the
21421 token stream. Otherwise, commit to the tokens we have consumed.
21422 Returns true if no error occurred; false otherwise. */
21425 cp_parser_parse_definitely (cp_parser* parser)
21427 bool error_occurred;
21428 cp_parser_context *context;
21430 /* Remember whether or not an error occurred, since we are about to
21431 destroy that information. */
21432 error_occurred = cp_parser_error_occurred (parser);
21433 /* Remove the topmost context from the stack. */
21434 context = parser->context;
21435 parser->context = context->next;
21436 /* If no parse errors occurred, commit to the tentative parse. */
21437 if (!error_occurred)
21439 /* Commit to the tokens read tentatively, unless that was
21441 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
21442 cp_lexer_commit_tokens (parser->lexer);
21444 pop_to_parent_deferring_access_checks ();
21446 /* Otherwise, if errors occurred, roll back our state so that things
21447 are just as they were before we began the tentative parse. */
21450 cp_lexer_rollback_tokens (parser->lexer);
21451 pop_deferring_access_checks ();
21453 /* Add the context to the front of the free list. */
21454 context->next = cp_parser_context_free_list;
21455 cp_parser_context_free_list = context;
21457 return !error_occurred;
21460 /* Returns true if we are parsing tentatively and are not committed to
21461 this tentative parse. */
21464 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
21466 return (cp_parser_parsing_tentatively (parser)
21467 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
21470 /* Returns nonzero iff an error has occurred during the most recent
21471 tentative parse. */
21474 cp_parser_error_occurred (cp_parser* parser)
21476 return (cp_parser_parsing_tentatively (parser)
21477 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
21480 /* Returns nonzero if GNU extensions are allowed. */
21483 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
21485 return parser->allow_gnu_extensions_p;
21488 /* Objective-C++ Productions */
21491 /* Parse an Objective-C expression, which feeds into a primary-expression
21495 objc-message-expression
21496 objc-string-literal
21497 objc-encode-expression
21498 objc-protocol-expression
21499 objc-selector-expression
21501 Returns a tree representation of the expression. */
21504 cp_parser_objc_expression (cp_parser* parser)
21506 /* Try to figure out what kind of declaration is present. */
21507 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
21511 case CPP_OPEN_SQUARE:
21512 return cp_parser_objc_message_expression (parser);
21514 case CPP_OBJC_STRING:
21515 kwd = cp_lexer_consume_token (parser->lexer);
21516 return objc_build_string_object (kwd->u.value);
21519 switch (kwd->keyword)
21521 case RID_AT_ENCODE:
21522 return cp_parser_objc_encode_expression (parser);
21524 case RID_AT_PROTOCOL:
21525 return cp_parser_objc_protocol_expression (parser);
21527 case RID_AT_SELECTOR:
21528 return cp_parser_objc_selector_expression (parser);
21534 error_at (kwd->location,
21535 "misplaced %<@%D%> Objective-C++ construct",
21537 cp_parser_skip_to_end_of_block_or_statement (parser);
21540 return error_mark_node;
21543 /* Parse an Objective-C message expression.
21545 objc-message-expression:
21546 [ objc-message-receiver objc-message-args ]
21548 Returns a representation of an Objective-C message. */
21551 cp_parser_objc_message_expression (cp_parser* parser)
21553 tree receiver, messageargs;
21555 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
21556 receiver = cp_parser_objc_message_receiver (parser);
21557 messageargs = cp_parser_objc_message_args (parser);
21558 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
21560 return objc_build_message_expr (receiver, messageargs);
21563 /* Parse an objc-message-receiver.
21565 objc-message-receiver:
21567 simple-type-specifier
21569 Returns a representation of the type or expression. */
21572 cp_parser_objc_message_receiver (cp_parser* parser)
21576 /* An Objective-C message receiver may be either (1) a type
21577 or (2) an expression. */
21578 cp_parser_parse_tentatively (parser);
21579 rcv = cp_parser_expression (parser, false, NULL);
21581 if (cp_parser_parse_definitely (parser))
21584 rcv = cp_parser_simple_type_specifier (parser,
21585 /*decl_specs=*/NULL,
21586 CP_PARSER_FLAGS_NONE);
21588 return objc_get_class_reference (rcv);
21591 /* Parse the arguments and selectors comprising an Objective-C message.
21596 objc-selector-args , objc-comma-args
21598 objc-selector-args:
21599 objc-selector [opt] : assignment-expression
21600 objc-selector-args objc-selector [opt] : assignment-expression
21603 assignment-expression
21604 objc-comma-args , assignment-expression
21606 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
21607 selector arguments and TREE_VALUE containing a list of comma
21611 cp_parser_objc_message_args (cp_parser* parser)
21613 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
21614 bool maybe_unary_selector_p = true;
21615 cp_token *token = cp_lexer_peek_token (parser->lexer);
21617 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
21619 tree selector = NULL_TREE, arg;
21621 if (token->type != CPP_COLON)
21622 selector = cp_parser_objc_selector (parser);
21624 /* Detect if we have a unary selector. */
21625 if (maybe_unary_selector_p
21626 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
21627 return build_tree_list (selector, NULL_TREE);
21629 maybe_unary_selector_p = false;
21630 cp_parser_require (parser, CPP_COLON, RT_COLON);
21631 arg = cp_parser_assignment_expression (parser, false, NULL);
21634 = chainon (sel_args,
21635 build_tree_list (selector, arg));
21637 token = cp_lexer_peek_token (parser->lexer);
21640 /* Handle non-selector arguments, if any. */
21641 while (token->type == CPP_COMMA)
21645 cp_lexer_consume_token (parser->lexer);
21646 arg = cp_parser_assignment_expression (parser, false, NULL);
21649 = chainon (addl_args,
21650 build_tree_list (NULL_TREE, arg));
21652 token = cp_lexer_peek_token (parser->lexer);
21655 if (sel_args == NULL_TREE && addl_args == NULL_TREE)
21657 cp_parser_error (parser, "objective-c++ message argument(s) are expected");
21658 return build_tree_list (error_mark_node, error_mark_node);
21661 return build_tree_list (sel_args, addl_args);
21664 /* Parse an Objective-C encode expression.
21666 objc-encode-expression:
21667 @encode objc-typename
21669 Returns an encoded representation of the type argument. */
21672 cp_parser_objc_encode_expression (cp_parser* parser)
21677 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
21678 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
21679 token = cp_lexer_peek_token (parser->lexer);
21680 type = complete_type (cp_parser_type_id (parser));
21681 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
21685 error_at (token->location,
21686 "%<@encode%> must specify a type as an argument");
21687 return error_mark_node;
21690 /* This happens if we find @encode(T) (where T is a template
21691 typename or something dependent on a template typename) when
21692 parsing a template. In that case, we can't compile it
21693 immediately, but we rather create an AT_ENCODE_EXPR which will
21694 need to be instantiated when the template is used.
21696 if (dependent_type_p (type))
21698 tree value = build_min (AT_ENCODE_EXPR, size_type_node, type);
21699 TREE_READONLY (value) = 1;
21703 return objc_build_encode_expr (type);
21706 /* Parse an Objective-C @defs expression. */
21709 cp_parser_objc_defs_expression (cp_parser *parser)
21713 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
21714 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
21715 name = cp_parser_identifier (parser);
21716 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
21718 return objc_get_class_ivars (name);
21721 /* Parse an Objective-C protocol expression.
21723 objc-protocol-expression:
21724 @protocol ( identifier )
21726 Returns a representation of the protocol expression. */
21729 cp_parser_objc_protocol_expression (cp_parser* parser)
21733 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
21734 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
21735 proto = cp_parser_identifier (parser);
21736 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
21738 return objc_build_protocol_expr (proto);
21741 /* Parse an Objective-C selector expression.
21743 objc-selector-expression:
21744 @selector ( objc-method-signature )
21746 objc-method-signature:
21752 objc-selector-seq objc-selector :
21754 Returns a representation of the method selector. */
21757 cp_parser_objc_selector_expression (cp_parser* parser)
21759 tree sel_seq = NULL_TREE;
21760 bool maybe_unary_selector_p = true;
21762 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
21764 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
21765 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
21766 token = cp_lexer_peek_token (parser->lexer);
21768 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
21769 || token->type == CPP_SCOPE)
21771 tree selector = NULL_TREE;
21773 if (token->type != CPP_COLON
21774 || token->type == CPP_SCOPE)
21775 selector = cp_parser_objc_selector (parser);
21777 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
21778 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
21780 /* Detect if we have a unary selector. */
21781 if (maybe_unary_selector_p)
21783 sel_seq = selector;
21784 goto finish_selector;
21788 cp_parser_error (parser, "expected %<:%>");
21791 maybe_unary_selector_p = false;
21792 token = cp_lexer_consume_token (parser->lexer);
21794 if (token->type == CPP_SCOPE)
21797 = chainon (sel_seq,
21798 build_tree_list (selector, NULL_TREE));
21800 = chainon (sel_seq,
21801 build_tree_list (NULL_TREE, NULL_TREE));
21805 = chainon (sel_seq,
21806 build_tree_list (selector, NULL_TREE));
21808 token = cp_lexer_peek_token (parser->lexer);
21812 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
21814 return objc_build_selector_expr (loc, sel_seq);
21817 /* Parse a list of identifiers.
21819 objc-identifier-list:
21821 objc-identifier-list , identifier
21823 Returns a TREE_LIST of identifier nodes. */
21826 cp_parser_objc_identifier_list (cp_parser* parser)
21832 identifier = cp_parser_identifier (parser);
21833 if (identifier == error_mark_node)
21834 return error_mark_node;
21836 list = build_tree_list (NULL_TREE, identifier);
21837 sep = cp_lexer_peek_token (parser->lexer);
21839 while (sep->type == CPP_COMMA)
21841 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
21842 identifier = cp_parser_identifier (parser);
21843 if (identifier == error_mark_node)
21846 list = chainon (list, build_tree_list (NULL_TREE,
21848 sep = cp_lexer_peek_token (parser->lexer);
21854 /* Parse an Objective-C alias declaration.
21856 objc-alias-declaration:
21857 @compatibility_alias identifier identifier ;
21859 This function registers the alias mapping with the Objective-C front end.
21860 It returns nothing. */
21863 cp_parser_objc_alias_declaration (cp_parser* parser)
21867 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
21868 alias = cp_parser_identifier (parser);
21869 orig = cp_parser_identifier (parser);
21870 objc_declare_alias (alias, orig);
21871 cp_parser_consume_semicolon_at_end_of_statement (parser);
21874 /* Parse an Objective-C class forward-declaration.
21876 objc-class-declaration:
21877 @class objc-identifier-list ;
21879 The function registers the forward declarations with the Objective-C
21880 front end. It returns nothing. */
21883 cp_parser_objc_class_declaration (cp_parser* parser)
21885 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
21890 id = cp_parser_identifier (parser);
21891 if (id == error_mark_node)
21894 objc_declare_class (id);
21896 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
21897 cp_lexer_consume_token (parser->lexer);
21901 cp_parser_consume_semicolon_at_end_of_statement (parser);
21904 /* Parse a list of Objective-C protocol references.
21906 objc-protocol-refs-opt:
21907 objc-protocol-refs [opt]
21909 objc-protocol-refs:
21910 < objc-identifier-list >
21912 Returns a TREE_LIST of identifiers, if any. */
21915 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
21917 tree protorefs = NULL_TREE;
21919 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
21921 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
21922 protorefs = cp_parser_objc_identifier_list (parser);
21923 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
21929 /* Parse a Objective-C visibility specification. */
21932 cp_parser_objc_visibility_spec (cp_parser* parser)
21934 cp_token *vis = cp_lexer_peek_token (parser->lexer);
21936 switch (vis->keyword)
21938 case RID_AT_PRIVATE:
21939 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE);
21941 case RID_AT_PROTECTED:
21942 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED);
21944 case RID_AT_PUBLIC:
21945 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC);
21947 case RID_AT_PACKAGE:
21948 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE);
21954 /* Eat '@private'/'@protected'/'@public'. */
21955 cp_lexer_consume_token (parser->lexer);
21958 /* Parse an Objective-C method type. Return 'true' if it is a class
21959 (+) method, and 'false' if it is an instance (-) method. */
21962 cp_parser_objc_method_type (cp_parser* parser)
21964 if (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS)
21970 /* Parse an Objective-C protocol qualifier. */
21973 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
21975 tree quals = NULL_TREE, node;
21976 cp_token *token = cp_lexer_peek_token (parser->lexer);
21978 node = token->u.value;
21980 while (node && TREE_CODE (node) == IDENTIFIER_NODE
21981 && (node == ridpointers [(int) RID_IN]
21982 || node == ridpointers [(int) RID_OUT]
21983 || node == ridpointers [(int) RID_INOUT]
21984 || node == ridpointers [(int) RID_BYCOPY]
21985 || node == ridpointers [(int) RID_BYREF]
21986 || node == ridpointers [(int) RID_ONEWAY]))
21988 quals = tree_cons (NULL_TREE, node, quals);
21989 cp_lexer_consume_token (parser->lexer);
21990 token = cp_lexer_peek_token (parser->lexer);
21991 node = token->u.value;
21997 /* Parse an Objective-C typename. */
22000 cp_parser_objc_typename (cp_parser* parser)
22002 tree type_name = NULL_TREE;
22004 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
22006 tree proto_quals, cp_type = NULL_TREE;
22008 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
22009 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
22011 /* An ObjC type name may consist of just protocol qualifiers, in which
22012 case the type shall default to 'id'. */
22013 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
22015 cp_type = cp_parser_type_id (parser);
22017 /* If the type could not be parsed, an error has already
22018 been produced. For error recovery, behave as if it had
22019 not been specified, which will use the default type
22021 if (cp_type == error_mark_node)
22023 cp_type = NULL_TREE;
22024 /* We need to skip to the closing parenthesis as
22025 cp_parser_type_id() does not seem to do it for
22027 cp_parser_skip_to_closing_parenthesis (parser,
22028 /*recovering=*/true,
22029 /*or_comma=*/false,
22030 /*consume_paren=*/false);
22034 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
22035 type_name = build_tree_list (proto_quals, cp_type);
22041 /* Check to see if TYPE refers to an Objective-C selector name. */
22044 cp_parser_objc_selector_p (enum cpp_ttype type)
22046 return (type == CPP_NAME || type == CPP_KEYWORD
22047 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
22048 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
22049 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
22050 || type == CPP_XOR || type == CPP_XOR_EQ);
22053 /* Parse an Objective-C selector. */
22056 cp_parser_objc_selector (cp_parser* parser)
22058 cp_token *token = cp_lexer_consume_token (parser->lexer);
22060 if (!cp_parser_objc_selector_p (token->type))
22062 error_at (token->location, "invalid Objective-C++ selector name");
22063 return error_mark_node;
22066 /* C++ operator names are allowed to appear in ObjC selectors. */
22067 switch (token->type)
22069 case CPP_AND_AND: return get_identifier ("and");
22070 case CPP_AND_EQ: return get_identifier ("and_eq");
22071 case CPP_AND: return get_identifier ("bitand");
22072 case CPP_OR: return get_identifier ("bitor");
22073 case CPP_COMPL: return get_identifier ("compl");
22074 case CPP_NOT: return get_identifier ("not");
22075 case CPP_NOT_EQ: return get_identifier ("not_eq");
22076 case CPP_OR_OR: return get_identifier ("or");
22077 case CPP_OR_EQ: return get_identifier ("or_eq");
22078 case CPP_XOR: return get_identifier ("xor");
22079 case CPP_XOR_EQ: return get_identifier ("xor_eq");
22080 default: return token->u.value;
22084 /* Parse an Objective-C params list. */
22087 cp_parser_objc_method_keyword_params (cp_parser* parser, tree* attributes)
22089 tree params = NULL_TREE;
22090 bool maybe_unary_selector_p = true;
22091 cp_token *token = cp_lexer_peek_token (parser->lexer);
22093 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
22095 tree selector = NULL_TREE, type_name, identifier;
22096 tree parm_attr = NULL_TREE;
22098 if (token->keyword == RID_ATTRIBUTE)
22101 if (token->type != CPP_COLON)
22102 selector = cp_parser_objc_selector (parser);
22104 /* Detect if we have a unary selector. */
22105 if (maybe_unary_selector_p
22106 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
22108 params = selector; /* Might be followed by attributes. */
22112 maybe_unary_selector_p = false;
22113 if (!cp_parser_require (parser, CPP_COLON, RT_COLON))
22115 /* Something went quite wrong. There should be a colon
22116 here, but there is not. Stop parsing parameters. */
22119 type_name = cp_parser_objc_typename (parser);
22120 /* New ObjC allows attributes on parameters too. */
22121 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
22122 parm_attr = cp_parser_attributes_opt (parser);
22123 identifier = cp_parser_identifier (parser);
22127 objc_build_keyword_decl (selector,
22132 token = cp_lexer_peek_token (parser->lexer);
22135 if (params == NULL_TREE)
22137 cp_parser_error (parser, "objective-c++ method declaration is expected");
22138 return error_mark_node;
22141 /* We allow tail attributes for the method. */
22142 if (token->keyword == RID_ATTRIBUTE)
22144 *attributes = cp_parser_attributes_opt (parser);
22145 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
22146 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
22148 cp_parser_error (parser,
22149 "method attributes must be specified at the end");
22150 return error_mark_node;
22153 if (params == NULL_TREE)
22155 cp_parser_error (parser, "objective-c++ method declaration is expected");
22156 return error_mark_node;
22161 /* Parse the non-keyword Objective-C params. */
22164 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp,
22167 tree params = make_node (TREE_LIST);
22168 cp_token *token = cp_lexer_peek_token (parser->lexer);
22169 *ellipsisp = false; /* Initially, assume no ellipsis. */
22171 while (token->type == CPP_COMMA)
22173 cp_parameter_declarator *parmdecl;
22176 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
22177 token = cp_lexer_peek_token (parser->lexer);
22179 if (token->type == CPP_ELLIPSIS)
22181 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
22183 token = cp_lexer_peek_token (parser->lexer);
22187 /* TODO: parse attributes for tail parameters. */
22188 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
22189 parm = grokdeclarator (parmdecl->declarator,
22190 &parmdecl->decl_specifiers,
22191 PARM, /*initialized=*/0,
22192 /*attrlist=*/NULL);
22194 chainon (params, build_tree_list (NULL_TREE, parm));
22195 token = cp_lexer_peek_token (parser->lexer);
22198 /* We allow tail attributes for the method. */
22199 if (token->keyword == RID_ATTRIBUTE)
22201 if (*attributes == NULL_TREE)
22203 *attributes = cp_parser_attributes_opt (parser);
22204 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
22205 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
22209 /* We have an error, but parse the attributes, so that we can
22211 *attributes = cp_parser_attributes_opt (parser);
22213 cp_parser_error (parser,
22214 "method attributes must be specified at the end");
22215 return error_mark_node;
22221 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
22224 cp_parser_objc_interstitial_code (cp_parser* parser)
22226 cp_token *token = cp_lexer_peek_token (parser->lexer);
22228 /* If the next token is `extern' and the following token is a string
22229 literal, then we have a linkage specification. */
22230 if (token->keyword == RID_EXTERN
22231 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
22232 cp_parser_linkage_specification (parser);
22233 /* Handle #pragma, if any. */
22234 else if (token->type == CPP_PRAGMA)
22235 cp_parser_pragma (parser, pragma_external);
22236 /* Allow stray semicolons. */
22237 else if (token->type == CPP_SEMICOLON)
22238 cp_lexer_consume_token (parser->lexer);
22239 /* Mark methods as optional or required, when building protocols. */
22240 else if (token->keyword == RID_AT_OPTIONAL)
22242 cp_lexer_consume_token (parser->lexer);
22243 objc_set_method_opt (true);
22245 else if (token->keyword == RID_AT_REQUIRED)
22247 cp_lexer_consume_token (parser->lexer);
22248 objc_set_method_opt (false);
22250 else if (token->keyword == RID_NAMESPACE)
22251 cp_parser_namespace_definition (parser);
22252 /* Other stray characters must generate errors. */
22253 else if (token->type == CPP_OPEN_BRACE || token->type == CPP_CLOSE_BRACE)
22255 cp_lexer_consume_token (parser->lexer);
22256 error ("stray %qs between Objective-C++ methods",
22257 token->type == CPP_OPEN_BRACE ? "{" : "}");
22259 /* Finally, try to parse a block-declaration, or a function-definition. */
22261 cp_parser_block_declaration (parser, /*statement_p=*/false);
22264 /* Parse a method signature. */
22267 cp_parser_objc_method_signature (cp_parser* parser, tree* attributes)
22269 tree rettype, kwdparms, optparms;
22270 bool ellipsis = false;
22271 bool is_class_method;
22273 is_class_method = cp_parser_objc_method_type (parser);
22274 rettype = cp_parser_objc_typename (parser);
22275 *attributes = NULL_TREE;
22276 kwdparms = cp_parser_objc_method_keyword_params (parser, attributes);
22277 if (kwdparms == error_mark_node)
22278 return error_mark_node;
22279 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis, attributes);
22280 if (optparms == error_mark_node)
22281 return error_mark_node;
22283 return objc_build_method_signature (is_class_method, rettype, kwdparms, optparms, ellipsis);
22287 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser* parser)
22290 cp_lexer_save_tokens (parser->lexer);
22291 tattr = cp_parser_attributes_opt (parser);
22292 gcc_assert (tattr) ;
22294 /* If the attributes are followed by a method introducer, this is not allowed.
22295 Dump the attributes and flag the situation. */
22296 if (cp_lexer_next_token_is (parser->lexer, CPP_PLUS)
22297 || cp_lexer_next_token_is (parser->lexer, CPP_MINUS))
22300 /* Otherwise, the attributes introduce some interstitial code, possibly so
22301 rewind to allow that check. */
22302 cp_lexer_rollback_tokens (parser->lexer);
22306 /* Parse an Objective-C method prototype list. */
22309 cp_parser_objc_method_prototype_list (cp_parser* parser)
22311 cp_token *token = cp_lexer_peek_token (parser->lexer);
22313 while (token->keyword != RID_AT_END && token->type != CPP_EOF)
22315 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
22317 tree attributes, sig;
22318 bool is_class_method;
22319 if (token->type == CPP_PLUS)
22320 is_class_method = true;
22322 is_class_method = false;
22323 sig = cp_parser_objc_method_signature (parser, &attributes);
22324 if (sig == error_mark_node)
22326 cp_parser_skip_to_end_of_block_or_statement (parser);
22327 token = cp_lexer_peek_token (parser->lexer);
22330 objc_add_method_declaration (is_class_method, sig, attributes);
22331 cp_parser_consume_semicolon_at_end_of_statement (parser);
22333 else if (token->keyword == RID_AT_PROPERTY)
22334 cp_parser_objc_at_property_declaration (parser);
22335 else if (token->keyword == RID_ATTRIBUTE
22336 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser))
22337 warning_at (cp_lexer_peek_token (parser->lexer)->location,
22339 "prefix attributes are ignored for methods");
22341 /* Allow for interspersed non-ObjC++ code. */
22342 cp_parser_objc_interstitial_code (parser);
22344 token = cp_lexer_peek_token (parser->lexer);
22347 if (token->type != CPP_EOF)
22348 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
22350 cp_parser_error (parser, "expected %<@end%>");
22352 objc_finish_interface ();
22355 /* Parse an Objective-C method definition list. */
22358 cp_parser_objc_method_definition_list (cp_parser* parser)
22360 cp_token *token = cp_lexer_peek_token (parser->lexer);
22362 while (token->keyword != RID_AT_END && token->type != CPP_EOF)
22366 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
22369 tree sig, attribute;
22370 bool is_class_method;
22371 if (token->type == CPP_PLUS)
22372 is_class_method = true;
22374 is_class_method = false;
22375 push_deferring_access_checks (dk_deferred);
22376 sig = cp_parser_objc_method_signature (parser, &attribute);
22377 if (sig == error_mark_node)
22379 cp_parser_skip_to_end_of_block_or_statement (parser);
22380 token = cp_lexer_peek_token (parser->lexer);
22383 objc_start_method_definition (is_class_method, sig, attribute,
22386 /* For historical reasons, we accept an optional semicolon. */
22387 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
22388 cp_lexer_consume_token (parser->lexer);
22390 ptk = cp_lexer_peek_token (parser->lexer);
22391 if (!(ptk->type == CPP_PLUS || ptk->type == CPP_MINUS
22392 || ptk->type == CPP_EOF || ptk->keyword == RID_AT_END))
22394 perform_deferred_access_checks ();
22395 stop_deferring_access_checks ();
22396 meth = cp_parser_function_definition_after_declarator (parser,
22398 pop_deferring_access_checks ();
22399 objc_finish_method_definition (meth);
22402 /* The following case will be removed once @synthesize is
22403 completely implemented. */
22404 else if (token->keyword == RID_AT_PROPERTY)
22405 cp_parser_objc_at_property_declaration (parser);
22406 else if (token->keyword == RID_AT_SYNTHESIZE)
22407 cp_parser_objc_at_synthesize_declaration (parser);
22408 else if (token->keyword == RID_AT_DYNAMIC)
22409 cp_parser_objc_at_dynamic_declaration (parser);
22410 else if (token->keyword == RID_ATTRIBUTE
22411 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser))
22412 warning_at (token->location, OPT_Wattributes,
22413 "prefix attributes are ignored for methods");
22415 /* Allow for interspersed non-ObjC++ code. */
22416 cp_parser_objc_interstitial_code (parser);
22418 token = cp_lexer_peek_token (parser->lexer);
22421 if (token->type != CPP_EOF)
22422 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
22424 cp_parser_error (parser, "expected %<@end%>");
22426 objc_finish_implementation ();
22429 /* Parse Objective-C ivars. */
22432 cp_parser_objc_class_ivars (cp_parser* parser)
22434 cp_token *token = cp_lexer_peek_token (parser->lexer);
22436 if (token->type != CPP_OPEN_BRACE)
22437 return; /* No ivars specified. */
22439 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
22440 token = cp_lexer_peek_token (parser->lexer);
22442 while (token->type != CPP_CLOSE_BRACE
22443 && token->keyword != RID_AT_END && token->type != CPP_EOF)
22445 cp_decl_specifier_seq declspecs;
22446 int decl_class_or_enum_p;
22447 tree prefix_attributes;
22449 cp_parser_objc_visibility_spec (parser);
22451 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
22454 cp_parser_decl_specifier_seq (parser,
22455 CP_PARSER_FLAGS_OPTIONAL,
22457 &decl_class_or_enum_p);
22459 /* auto, register, static, extern, mutable. */
22460 if (declspecs.storage_class != sc_none)
22462 cp_parser_error (parser, "invalid type for instance variable");
22463 declspecs.storage_class = sc_none;
22467 if (declspecs.specs[(int) ds_thread])
22469 cp_parser_error (parser, "invalid type for instance variable");
22470 declspecs.specs[(int) ds_thread] = 0;
22474 if (declspecs.specs[(int) ds_typedef])
22476 cp_parser_error (parser, "invalid type for instance variable");
22477 declspecs.specs[(int) ds_typedef] = 0;
22480 prefix_attributes = declspecs.attributes;
22481 declspecs.attributes = NULL_TREE;
22483 /* Keep going until we hit the `;' at the end of the
22485 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
22487 tree width = NULL_TREE, attributes, first_attribute, decl;
22488 cp_declarator *declarator = NULL;
22489 int ctor_dtor_or_conv_p;
22491 /* Check for a (possibly unnamed) bitfield declaration. */
22492 token = cp_lexer_peek_token (parser->lexer);
22493 if (token->type == CPP_COLON)
22496 if (token->type == CPP_NAME
22497 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
22500 /* Get the name of the bitfield. */
22501 declarator = make_id_declarator (NULL_TREE,
22502 cp_parser_identifier (parser),
22506 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
22507 /* Get the width of the bitfield. */
22509 = cp_parser_constant_expression (parser,
22510 /*allow_non_constant=*/false,
22515 /* Parse the declarator. */
22517 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
22518 &ctor_dtor_or_conv_p,
22519 /*parenthesized_p=*/NULL,
22520 /*member_p=*/false);
22523 /* Look for attributes that apply to the ivar. */
22524 attributes = cp_parser_attributes_opt (parser);
22525 /* Remember which attributes are prefix attributes and
22527 first_attribute = attributes;
22528 /* Combine the attributes. */
22529 attributes = chainon (prefix_attributes, attributes);
22532 /* Create the bitfield declaration. */
22533 decl = grokbitfield (declarator, &declspecs,
22537 decl = grokfield (declarator, &declspecs,
22538 NULL_TREE, /*init_const_expr_p=*/false,
22539 NULL_TREE, attributes);
22541 /* Add the instance variable. */
22542 if (decl != error_mark_node && decl != NULL_TREE)
22543 objc_add_instance_variable (decl);
22545 /* Reset PREFIX_ATTRIBUTES. */
22546 while (attributes && TREE_CHAIN (attributes) != first_attribute)
22547 attributes = TREE_CHAIN (attributes);
22549 TREE_CHAIN (attributes) = NULL_TREE;
22551 token = cp_lexer_peek_token (parser->lexer);
22553 if (token->type == CPP_COMMA)
22555 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
22561 cp_parser_consume_semicolon_at_end_of_statement (parser);
22562 token = cp_lexer_peek_token (parser->lexer);
22565 if (token->keyword == RID_AT_END)
22566 cp_parser_error (parser, "expected %<}%>");
22568 /* Do not consume the RID_AT_END, so it will be read again as terminating
22569 the @interface of @implementation. */
22570 if (token->keyword != RID_AT_END && token->type != CPP_EOF)
22571 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
22573 /* For historical reasons, we accept an optional semicolon. */
22574 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
22575 cp_lexer_consume_token (parser->lexer);
22578 /* Parse an Objective-C protocol declaration. */
22581 cp_parser_objc_protocol_declaration (cp_parser* parser, tree attributes)
22583 tree proto, protorefs;
22586 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
22587 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
22589 tok = cp_lexer_peek_token (parser->lexer);
22590 error_at (tok->location, "identifier expected after %<@protocol%>");
22591 cp_parser_consume_semicolon_at_end_of_statement (parser);
22595 /* See if we have a forward declaration or a definition. */
22596 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
22598 /* Try a forward declaration first. */
22599 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
22605 id = cp_parser_identifier (parser);
22606 if (id == error_mark_node)
22609 objc_declare_protocol (id, attributes);
22611 if(cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
22612 cp_lexer_consume_token (parser->lexer);
22616 cp_parser_consume_semicolon_at_end_of_statement (parser);
22619 /* Ok, we got a full-fledged definition (or at least should). */
22622 proto = cp_parser_identifier (parser);
22623 protorefs = cp_parser_objc_protocol_refs_opt (parser);
22624 objc_start_protocol (proto, protorefs, attributes);
22625 cp_parser_objc_method_prototype_list (parser);
22629 /* Parse an Objective-C superclass or category. */
22632 cp_parser_objc_superclass_or_category (cp_parser *parser,
22635 tree *categ, bool *is_class_extension)
22637 cp_token *next = cp_lexer_peek_token (parser->lexer);
22639 *super = *categ = NULL_TREE;
22640 *is_class_extension = false;
22641 if (next->type == CPP_COLON)
22643 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
22644 *super = cp_parser_identifier (parser);
22646 else if (next->type == CPP_OPEN_PAREN)
22648 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
22650 /* If there is no category name, and this is an @interface, we
22651 have a class extension. */
22652 if (iface_p && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
22654 *categ = NULL_TREE;
22655 *is_class_extension = true;
22658 *categ = cp_parser_identifier (parser);
22660 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
22664 /* Parse an Objective-C class interface. */
22667 cp_parser_objc_class_interface (cp_parser* parser, tree attributes)
22669 tree name, super, categ, protos;
22670 bool is_class_extension;
22672 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
22673 name = cp_parser_identifier (parser);
22674 if (name == error_mark_node)
22676 /* It's hard to recover because even if valid @interface stuff
22677 is to follow, we can't compile it (or validate it) if we
22678 don't even know which class it refers to. Let's assume this
22679 was a stray '@interface' token in the stream and skip it.
22683 cp_parser_objc_superclass_or_category (parser, true, &super, &categ,
22684 &is_class_extension);
22685 protos = cp_parser_objc_protocol_refs_opt (parser);
22687 /* We have either a class or a category on our hands. */
22688 if (categ || is_class_extension)
22689 objc_start_category_interface (name, categ, protos, attributes);
22692 objc_start_class_interface (name, super, protos, attributes);
22693 /* Handle instance variable declarations, if any. */
22694 cp_parser_objc_class_ivars (parser);
22695 objc_continue_interface ();
22698 cp_parser_objc_method_prototype_list (parser);
22701 /* Parse an Objective-C class implementation. */
22704 cp_parser_objc_class_implementation (cp_parser* parser)
22706 tree name, super, categ;
22707 bool is_class_extension;
22709 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
22710 name = cp_parser_identifier (parser);
22711 if (name == error_mark_node)
22713 /* It's hard to recover because even if valid @implementation
22714 stuff is to follow, we can't compile it (or validate it) if
22715 we don't even know which class it refers to. Let's assume
22716 this was a stray '@implementation' token in the stream and
22721 cp_parser_objc_superclass_or_category (parser, false, &super, &categ,
22722 &is_class_extension);
22724 /* We have either a class or a category on our hands. */
22726 objc_start_category_implementation (name, categ);
22729 objc_start_class_implementation (name, super);
22730 /* Handle instance variable declarations, if any. */
22731 cp_parser_objc_class_ivars (parser);
22732 objc_continue_implementation ();
22735 cp_parser_objc_method_definition_list (parser);
22738 /* Consume the @end token and finish off the implementation. */
22741 cp_parser_objc_end_implementation (cp_parser* parser)
22743 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
22744 objc_finish_implementation ();
22747 /* Parse an Objective-C declaration. */
22750 cp_parser_objc_declaration (cp_parser* parser, tree attributes)
22752 /* Try to figure out what kind of declaration is present. */
22753 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
22756 switch (kwd->keyword)
22761 error_at (kwd->location, "attributes may not be specified before"
22762 " the %<@%D%> Objective-C++ keyword",
22766 case RID_AT_IMPLEMENTATION:
22767 warning_at (kwd->location, OPT_Wattributes,
22768 "prefix attributes are ignored before %<@%D%>",
22775 switch (kwd->keyword)
22778 cp_parser_objc_alias_declaration (parser);
22781 cp_parser_objc_class_declaration (parser);
22783 case RID_AT_PROTOCOL:
22784 cp_parser_objc_protocol_declaration (parser, attributes);
22786 case RID_AT_INTERFACE:
22787 cp_parser_objc_class_interface (parser, attributes);
22789 case RID_AT_IMPLEMENTATION:
22790 cp_parser_objc_class_implementation (parser);
22793 cp_parser_objc_end_implementation (parser);
22796 error_at (kwd->location, "misplaced %<@%D%> Objective-C++ construct",
22798 cp_parser_skip_to_end_of_block_or_statement (parser);
22802 /* Parse an Objective-C try-catch-finally statement.
22804 objc-try-catch-finally-stmt:
22805 @try compound-statement objc-catch-clause-seq [opt]
22806 objc-finally-clause [opt]
22808 objc-catch-clause-seq:
22809 objc-catch-clause objc-catch-clause-seq [opt]
22812 @catch ( objc-exception-declaration ) compound-statement
22814 objc-finally-clause:
22815 @finally compound-statement
22817 objc-exception-declaration:
22818 parameter-declaration
22821 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
22825 PS: This function is identical to c_parser_objc_try_catch_finally_statement
22826 for C. Keep them in sync. */
22829 cp_parser_objc_try_catch_finally_statement (cp_parser *parser)
22831 location_t location;
22834 cp_parser_require_keyword (parser, RID_AT_TRY, RT_AT_TRY);
22835 location = cp_lexer_peek_token (parser->lexer)->location;
22836 objc_maybe_warn_exceptions (location);
22837 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
22838 node, lest it get absorbed into the surrounding block. */
22839 stmt = push_stmt_list ();
22840 cp_parser_compound_statement (parser, NULL, false, false);
22841 objc_begin_try_stmt (location, pop_stmt_list (stmt));
22843 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
22845 cp_parameter_declarator *parm;
22846 tree parameter_declaration = error_mark_node;
22847 bool seen_open_paren = false;
22849 cp_lexer_consume_token (parser->lexer);
22850 if (cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
22851 seen_open_paren = true;
22852 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
22854 /* We have "@catch (...)" (where the '...' are literally
22855 what is in the code). Skip the '...'.
22856 parameter_declaration is set to NULL_TREE, and
22857 objc_being_catch_clauses() knows that that means
22859 cp_lexer_consume_token (parser->lexer);
22860 parameter_declaration = NULL_TREE;
22864 /* We have "@catch (NSException *exception)" or something
22865 like that. Parse the parameter declaration. */
22866 parm = cp_parser_parameter_declaration (parser, false, NULL);
22868 parameter_declaration = error_mark_node;
22870 parameter_declaration = grokdeclarator (parm->declarator,
22871 &parm->decl_specifiers,
22872 PARM, /*initialized=*/0,
22873 /*attrlist=*/NULL);
22875 if (seen_open_paren)
22876 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
22879 /* If there was no open parenthesis, we are recovering from
22880 an error, and we are trying to figure out what mistake
22881 the user has made. */
22883 /* If there is an immediate closing parenthesis, the user
22884 probably forgot the opening one (ie, they typed "@catch
22885 NSException *e)". Parse the closing parenthesis and keep
22887 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
22888 cp_lexer_consume_token (parser->lexer);
22890 /* If these is no immediate closing parenthesis, the user
22891 probably doesn't know that parenthesis are required at
22892 all (ie, they typed "@catch NSException *e"). So, just
22893 forget about the closing parenthesis and keep going. */
22895 objc_begin_catch_clause (parameter_declaration);
22896 cp_parser_compound_statement (parser, NULL, false, false);
22897 objc_finish_catch_clause ();
22899 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
22901 cp_lexer_consume_token (parser->lexer);
22902 location = cp_lexer_peek_token (parser->lexer)->location;
22903 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
22904 node, lest it get absorbed into the surrounding block. */
22905 stmt = push_stmt_list ();
22906 cp_parser_compound_statement (parser, NULL, false, false);
22907 objc_build_finally_clause (location, pop_stmt_list (stmt));
22910 return objc_finish_try_stmt ();
22913 /* Parse an Objective-C synchronized statement.
22915 objc-synchronized-stmt:
22916 @synchronized ( expression ) compound-statement
22918 Returns NULL_TREE. */
22921 cp_parser_objc_synchronized_statement (cp_parser *parser)
22923 location_t location;
22926 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, RT_AT_SYNCHRONIZED);
22928 location = cp_lexer_peek_token (parser->lexer)->location;
22929 objc_maybe_warn_exceptions (location);
22930 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
22931 lock = cp_parser_expression (parser, false, NULL);
22932 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
22934 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
22935 node, lest it get absorbed into the surrounding block. */
22936 stmt = push_stmt_list ();
22937 cp_parser_compound_statement (parser, NULL, false, false);
22939 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
22942 /* Parse an Objective-C throw statement.
22945 @throw assignment-expression [opt] ;
22947 Returns a constructed '@throw' statement. */
22950 cp_parser_objc_throw_statement (cp_parser *parser)
22952 tree expr = NULL_TREE;
22953 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
22955 cp_parser_require_keyword (parser, RID_AT_THROW, RT_AT_THROW);
22957 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
22958 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
22960 cp_parser_consume_semicolon_at_end_of_statement (parser);
22962 return objc_build_throw_stmt (loc, expr);
22965 /* Parse an Objective-C statement. */
22968 cp_parser_objc_statement (cp_parser * parser)
22970 /* Try to figure out what kind of declaration is present. */
22971 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
22973 switch (kwd->keyword)
22976 return cp_parser_objc_try_catch_finally_statement (parser);
22977 case RID_AT_SYNCHRONIZED:
22978 return cp_parser_objc_synchronized_statement (parser);
22980 return cp_parser_objc_throw_statement (parser);
22982 error_at (kwd->location, "misplaced %<@%D%> Objective-C++ construct",
22984 cp_parser_skip_to_end_of_block_or_statement (parser);
22987 return error_mark_node;
22990 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
22991 look ahead to see if an objc keyword follows the attributes. This
22992 is to detect the use of prefix attributes on ObjC @interface and
22996 cp_parser_objc_valid_prefix_attributes (cp_parser* parser, tree *attrib)
22998 cp_lexer_save_tokens (parser->lexer);
22999 *attrib = cp_parser_attributes_opt (parser);
23000 gcc_assert (*attrib);
23001 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser->lexer)->keyword))
23003 cp_lexer_commit_tokens (parser->lexer);
23006 cp_lexer_rollback_tokens (parser->lexer);
23010 /* This routine is a minimal replacement for
23011 c_parser_struct_declaration () used when parsing the list of
23012 types/names or ObjC++ properties. For example, when parsing the
23015 @property (readonly) int a, b, c;
23017 this function is responsible for parsing "int a, int b, int c" and
23018 returning the declarations as CHAIN of DECLs.
23020 TODO: Share this code with cp_parser_objc_class_ivars. It's very
23021 similar parsing. */
23023 cp_parser_objc_struct_declaration (cp_parser *parser)
23025 tree decls = NULL_TREE;
23026 cp_decl_specifier_seq declspecs;
23027 int decl_class_or_enum_p;
23028 tree prefix_attributes;
23030 cp_parser_decl_specifier_seq (parser,
23031 CP_PARSER_FLAGS_NONE,
23033 &decl_class_or_enum_p);
23035 if (declspecs.type == error_mark_node)
23036 return error_mark_node;
23038 /* auto, register, static, extern, mutable. */
23039 if (declspecs.storage_class != sc_none)
23041 cp_parser_error (parser, "invalid type for property");
23042 declspecs.storage_class = sc_none;
23046 if (declspecs.specs[(int) ds_thread])
23048 cp_parser_error (parser, "invalid type for property");
23049 declspecs.specs[(int) ds_thread] = 0;
23053 if (declspecs.specs[(int) ds_typedef])
23055 cp_parser_error (parser, "invalid type for property");
23056 declspecs.specs[(int) ds_typedef] = 0;
23059 prefix_attributes = declspecs.attributes;
23060 declspecs.attributes = NULL_TREE;
23062 /* Keep going until we hit the `;' at the end of the declaration. */
23063 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
23065 tree attributes, first_attribute, decl;
23066 cp_declarator *declarator;
23069 /* Parse the declarator. */
23070 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
23071 NULL, NULL, false);
23073 /* Look for attributes that apply to the ivar. */
23074 attributes = cp_parser_attributes_opt (parser);
23075 /* Remember which attributes are prefix attributes and
23077 first_attribute = attributes;
23078 /* Combine the attributes. */
23079 attributes = chainon (prefix_attributes, attributes);
23081 decl = grokfield (declarator, &declspecs,
23082 NULL_TREE, /*init_const_expr_p=*/false,
23083 NULL_TREE, attributes);
23085 if (decl == error_mark_node || decl == NULL_TREE)
23086 return error_mark_node;
23088 /* Reset PREFIX_ATTRIBUTES. */
23089 while (attributes && TREE_CHAIN (attributes) != first_attribute)
23090 attributes = TREE_CHAIN (attributes);
23092 TREE_CHAIN (attributes) = NULL_TREE;
23094 DECL_CHAIN (decl) = decls;
23097 token = cp_lexer_peek_token (parser->lexer);
23098 if (token->type == CPP_COMMA)
23100 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
23109 /* Parse an Objective-C @property declaration. The syntax is:
23111 objc-property-declaration:
23112 '@property' objc-property-attributes[opt] struct-declaration ;
23114 objc-property-attributes:
23115 '(' objc-property-attribute-list ')'
23117 objc-property-attribute-list:
23118 objc-property-attribute
23119 objc-property-attribute-list, objc-property-attribute
23121 objc-property-attribute
23122 'getter' = identifier
23123 'setter' = identifier
23132 @property NSString *name;
23133 @property (readonly) id object;
23134 @property (retain, nonatomic, getter=getTheName) id name;
23135 @property int a, b, c;
23137 PS: This function is identical to
23138 c_parser_objc_at_property_declaration for C. Keep them in sync. */
23140 cp_parser_objc_at_property_declaration (cp_parser *parser)
23142 /* The following variables hold the attributes of the properties as
23143 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
23144 seen. When we see an attribute, we set them to 'true' (if they
23145 are boolean properties) or to the identifier (if they have an
23146 argument, ie, for getter and setter). Note that here we only
23147 parse the list of attributes, check the syntax and accumulate the
23148 attributes that we find. objc_add_property_declaration() will
23149 then process the information. */
23150 bool property_assign = false;
23151 bool property_copy = false;
23152 tree property_getter_ident = NULL_TREE;
23153 bool property_nonatomic = false;
23154 bool property_readonly = false;
23155 bool property_readwrite = false;
23156 bool property_retain = false;
23157 tree property_setter_ident = NULL_TREE;
23159 /* 'properties' is the list of properties that we read. Usually a
23160 single one, but maybe more (eg, in "@property int a, b, c;" there
23165 loc = cp_lexer_peek_token (parser->lexer)->location;
23167 cp_lexer_consume_token (parser->lexer); /* Eat '@property'. */
23169 /* Parse the optional attribute list... */
23170 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
23173 cp_lexer_consume_token (parser->lexer);
23177 bool syntax_error = false;
23178 cp_token *token = cp_lexer_peek_token (parser->lexer);
23181 if (token->type != CPP_NAME)
23183 cp_parser_error (parser, "expected identifier");
23186 keyword = C_RID_CODE (token->u.value);
23187 cp_lexer_consume_token (parser->lexer);
23190 case RID_ASSIGN: property_assign = true; break;
23191 case RID_COPY: property_copy = true; break;
23192 case RID_NONATOMIC: property_nonatomic = true; break;
23193 case RID_READONLY: property_readonly = true; break;
23194 case RID_READWRITE: property_readwrite = true; break;
23195 case RID_RETAIN: property_retain = true; break;
23199 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
23201 if (keyword == RID_GETTER)
23202 cp_parser_error (parser,
23203 "missing %<=%> (after %<getter%> attribute)");
23205 cp_parser_error (parser,
23206 "missing %<=%> (after %<setter%> attribute)");
23207 syntax_error = true;
23210 cp_lexer_consume_token (parser->lexer); /* eat the = */
23211 if (!cp_parser_objc_selector_p (cp_lexer_peek_token (parser->lexer)->type))
23213 cp_parser_error (parser, "expected identifier");
23214 syntax_error = true;
23217 if (keyword == RID_SETTER)
23219 if (property_setter_ident != NULL_TREE)
23221 cp_parser_error (parser, "the %<setter%> attribute may only be specified once");
23222 cp_lexer_consume_token (parser->lexer);
23225 property_setter_ident = cp_parser_objc_selector (parser);
23226 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
23227 cp_parser_error (parser, "setter name must terminate with %<:%>");
23229 cp_lexer_consume_token (parser->lexer);
23233 if (property_getter_ident != NULL_TREE)
23235 cp_parser_error (parser, "the %<getter%> attribute may only be specified once");
23236 cp_lexer_consume_token (parser->lexer);
23239 property_getter_ident = cp_parser_objc_selector (parser);
23243 cp_parser_error (parser, "unknown property attribute");
23244 syntax_error = true;
23251 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23252 cp_lexer_consume_token (parser->lexer);
23257 /* FIXME: "@property (setter, assign);" will generate a spurious
23258 "error: expected ‘)’ before ‘,’ token". This is because
23259 cp_parser_require, unlike the C counterpart, will produce an
23260 error even if we are in error recovery. */
23261 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23263 cp_parser_skip_to_closing_parenthesis (parser,
23264 /*recovering=*/true,
23265 /*or_comma=*/false,
23266 /*consume_paren=*/true);
23270 /* ... and the property declaration(s). */
23271 properties = cp_parser_objc_struct_declaration (parser);
23273 if (properties == error_mark_node)
23275 cp_parser_skip_to_end_of_statement (parser);
23276 /* If the next token is now a `;', consume it. */
23277 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
23278 cp_lexer_consume_token (parser->lexer);
23282 if (properties == NULL_TREE)
23283 cp_parser_error (parser, "expected identifier");
23286 /* Comma-separated properties are chained together in
23287 reverse order; add them one by one. */
23288 properties = nreverse (properties);
23290 for (; properties; properties = TREE_CHAIN (properties))
23291 objc_add_property_declaration (loc, copy_node (properties),
23292 property_readonly, property_readwrite,
23293 property_assign, property_retain,
23294 property_copy, property_nonatomic,
23295 property_getter_ident, property_setter_ident);
23298 cp_parser_consume_semicolon_at_end_of_statement (parser);
23301 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
23303 objc-synthesize-declaration:
23304 @synthesize objc-synthesize-identifier-list ;
23306 objc-synthesize-identifier-list:
23307 objc-synthesize-identifier
23308 objc-synthesize-identifier-list, objc-synthesize-identifier
23310 objc-synthesize-identifier
23312 identifier = identifier
23315 @synthesize MyProperty;
23316 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
23318 PS: This function is identical to c_parser_objc_at_synthesize_declaration
23319 for C. Keep them in sync.
23322 cp_parser_objc_at_synthesize_declaration (cp_parser *parser)
23324 tree list = NULL_TREE;
23326 loc = cp_lexer_peek_token (parser->lexer)->location;
23328 cp_lexer_consume_token (parser->lexer); /* Eat '@synthesize'. */
23331 tree property, ivar;
23332 property = cp_parser_identifier (parser);
23333 if (property == error_mark_node)
23335 cp_parser_consume_semicolon_at_end_of_statement (parser);
23338 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
23340 cp_lexer_consume_token (parser->lexer);
23341 ivar = cp_parser_identifier (parser);
23342 if (ivar == error_mark_node)
23344 cp_parser_consume_semicolon_at_end_of_statement (parser);
23350 list = chainon (list, build_tree_list (ivar, property));
23351 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23352 cp_lexer_consume_token (parser->lexer);
23356 cp_parser_consume_semicolon_at_end_of_statement (parser);
23357 objc_add_synthesize_declaration (loc, list);
23360 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
23362 objc-dynamic-declaration:
23363 @dynamic identifier-list ;
23366 @dynamic MyProperty;
23367 @dynamic MyProperty, AnotherProperty;
23369 PS: This function is identical to c_parser_objc_at_dynamic_declaration
23370 for C. Keep them in sync.
23373 cp_parser_objc_at_dynamic_declaration (cp_parser *parser)
23375 tree list = NULL_TREE;
23377 loc = cp_lexer_peek_token (parser->lexer)->location;
23379 cp_lexer_consume_token (parser->lexer); /* Eat '@dynamic'. */
23383 property = cp_parser_identifier (parser);
23384 if (property == error_mark_node)
23386 cp_parser_consume_semicolon_at_end_of_statement (parser);
23389 list = chainon (list, build_tree_list (NULL, property));
23390 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23391 cp_lexer_consume_token (parser->lexer);
23395 cp_parser_consume_semicolon_at_end_of_statement (parser);
23396 objc_add_dynamic_declaration (loc, list);
23400 /* OpenMP 2.5 parsing routines. */
23402 /* Returns name of the next clause.
23403 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
23404 the token is not consumed. Otherwise appropriate pragma_omp_clause is
23405 returned and the token is consumed. */
23407 static pragma_omp_clause
23408 cp_parser_omp_clause_name (cp_parser *parser)
23410 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
23412 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
23413 result = PRAGMA_OMP_CLAUSE_IF;
23414 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
23415 result = PRAGMA_OMP_CLAUSE_DEFAULT;
23416 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
23417 result = PRAGMA_OMP_CLAUSE_PRIVATE;
23418 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
23420 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
23421 const char *p = IDENTIFIER_POINTER (id);
23426 if (!strcmp ("collapse", p))
23427 result = PRAGMA_OMP_CLAUSE_COLLAPSE;
23428 else if (!strcmp ("copyin", p))
23429 result = PRAGMA_OMP_CLAUSE_COPYIN;
23430 else if (!strcmp ("copyprivate", p))
23431 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
23434 if (!strcmp ("firstprivate", p))
23435 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
23438 if (!strcmp ("lastprivate", p))
23439 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
23442 if (!strcmp ("nowait", p))
23443 result = PRAGMA_OMP_CLAUSE_NOWAIT;
23444 else if (!strcmp ("num_threads", p))
23445 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
23448 if (!strcmp ("ordered", p))
23449 result = PRAGMA_OMP_CLAUSE_ORDERED;
23452 if (!strcmp ("reduction", p))
23453 result = PRAGMA_OMP_CLAUSE_REDUCTION;
23456 if (!strcmp ("schedule", p))
23457 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
23458 else if (!strcmp ("shared", p))
23459 result = PRAGMA_OMP_CLAUSE_SHARED;
23462 if (!strcmp ("untied", p))
23463 result = PRAGMA_OMP_CLAUSE_UNTIED;
23468 if (result != PRAGMA_OMP_CLAUSE_NONE)
23469 cp_lexer_consume_token (parser->lexer);
23474 /* Validate that a clause of the given type does not already exist. */
23477 check_no_duplicate_clause (tree clauses, enum omp_clause_code code,
23478 const char *name, location_t location)
23482 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
23483 if (OMP_CLAUSE_CODE (c) == code)
23485 error_at (location, "too many %qs clauses", name);
23493 variable-list , identifier
23495 In addition, we match a closing parenthesis. An opening parenthesis
23496 will have been consumed by the caller.
23498 If KIND is nonzero, create the appropriate node and install the decl
23499 in OMP_CLAUSE_DECL and add the node to the head of the list.
23501 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
23502 return the list created. */
23505 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
23513 token = cp_lexer_peek_token (parser->lexer);
23514 name = cp_parser_id_expression (parser, /*template_p=*/false,
23515 /*check_dependency_p=*/true,
23516 /*template_p=*/NULL,
23517 /*declarator_p=*/false,
23518 /*optional_p=*/false);
23519 if (name == error_mark_node)
23522 decl = cp_parser_lookup_name_simple (parser, name, token->location);
23523 if (decl == error_mark_node)
23524 cp_parser_name_lookup_error (parser, name, decl, NLE_NULL,
23526 else if (kind != 0)
23528 tree u = build_omp_clause (token->location, kind);
23529 OMP_CLAUSE_DECL (u) = decl;
23530 OMP_CLAUSE_CHAIN (u) = list;
23534 list = tree_cons (decl, NULL_TREE, list);
23537 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
23539 cp_lexer_consume_token (parser->lexer);
23542 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23546 /* Try to resync to an unnested comma. Copied from
23547 cp_parser_parenthesized_expression_list. */
23549 ending = cp_parser_skip_to_closing_parenthesis (parser,
23550 /*recovering=*/true,
23552 /*consume_paren=*/true);
23560 /* Similarly, but expect leading and trailing parenthesis. This is a very
23561 common case for omp clauses. */
23564 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
23566 if (cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23567 return cp_parser_omp_var_list_no_open (parser, kind, list);
23572 collapse ( constant-expression ) */
23575 cp_parser_omp_clause_collapse (cp_parser *parser, tree list, location_t location)
23581 loc = cp_lexer_peek_token (parser->lexer)->location;
23582 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23585 num = cp_parser_constant_expression (parser, false, NULL);
23587 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23588 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
23589 /*or_comma=*/false,
23590 /*consume_paren=*/true);
23592 if (num == error_mark_node)
23594 num = fold_non_dependent_expr (num);
23595 if (!INTEGRAL_TYPE_P (TREE_TYPE (num))
23596 || !host_integerp (num, 0)
23597 || (n = tree_low_cst (num, 0)) <= 0
23600 error_at (loc, "collapse argument needs positive constant integer expression");
23604 check_no_duplicate_clause (list, OMP_CLAUSE_COLLAPSE, "collapse", location);
23605 c = build_omp_clause (loc, OMP_CLAUSE_COLLAPSE);
23606 OMP_CLAUSE_CHAIN (c) = list;
23607 OMP_CLAUSE_COLLAPSE_EXPR (c) = num;
23613 default ( shared | none ) */
23616 cp_parser_omp_clause_default (cp_parser *parser, tree list, location_t location)
23618 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
23621 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23623 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
23625 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
23626 const char *p = IDENTIFIER_POINTER (id);
23631 if (strcmp ("none", p) != 0)
23633 kind = OMP_CLAUSE_DEFAULT_NONE;
23637 if (strcmp ("shared", p) != 0)
23639 kind = OMP_CLAUSE_DEFAULT_SHARED;
23646 cp_lexer_consume_token (parser->lexer);
23651 cp_parser_error (parser, "expected %<none%> or %<shared%>");
23654 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23655 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
23656 /*or_comma=*/false,
23657 /*consume_paren=*/true);
23659 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
23662 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default", location);
23663 c = build_omp_clause (location, OMP_CLAUSE_DEFAULT);
23664 OMP_CLAUSE_CHAIN (c) = list;
23665 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
23671 if ( expression ) */
23674 cp_parser_omp_clause_if (cp_parser *parser, tree list, location_t location)
23678 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23681 t = cp_parser_condition (parser);
23683 if (t == error_mark_node
23684 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23685 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
23686 /*or_comma=*/false,
23687 /*consume_paren=*/true);
23689 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if", location);
23691 c = build_omp_clause (location, OMP_CLAUSE_IF);
23692 OMP_CLAUSE_IF_EXPR (c) = t;
23693 OMP_CLAUSE_CHAIN (c) = list;
23702 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED,
23703 tree list, location_t location)
23707 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait", location);
23709 c = build_omp_clause (location, OMP_CLAUSE_NOWAIT);
23710 OMP_CLAUSE_CHAIN (c) = list;
23715 num_threads ( expression ) */
23718 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list,
23719 location_t location)
23723 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23726 t = cp_parser_expression (parser, false, NULL);
23728 if (t == error_mark_node
23729 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23730 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
23731 /*or_comma=*/false,
23732 /*consume_paren=*/true);
23734 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS,
23735 "num_threads", location);
23737 c = build_omp_clause (location, OMP_CLAUSE_NUM_THREADS);
23738 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
23739 OMP_CLAUSE_CHAIN (c) = list;
23748 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED,
23749 tree list, location_t location)
23753 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED,
23754 "ordered", location);
23756 c = build_omp_clause (location, OMP_CLAUSE_ORDERED);
23757 OMP_CLAUSE_CHAIN (c) = list;
23762 reduction ( reduction-operator : variable-list )
23764 reduction-operator:
23765 One of: + * - & ^ | && || */
23768 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
23770 enum tree_code code;
23773 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23776 switch (cp_lexer_peek_token (parser->lexer)->type)
23788 code = BIT_AND_EXPR;
23791 code = BIT_XOR_EXPR;
23794 code = BIT_IOR_EXPR;
23797 code = TRUTH_ANDIF_EXPR;
23800 code = TRUTH_ORIF_EXPR;
23803 cp_parser_error (parser, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
23804 "%<|%>, %<&&%>, or %<||%>");
23806 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
23807 /*or_comma=*/false,
23808 /*consume_paren=*/true);
23811 cp_lexer_consume_token (parser->lexer);
23813 if (!cp_parser_require (parser, CPP_COLON, RT_COLON))
23816 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
23817 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
23818 OMP_CLAUSE_REDUCTION_CODE (c) = code;
23824 schedule ( schedule-kind )
23825 schedule ( schedule-kind , expression )
23828 static | dynamic | guided | runtime | auto */
23831 cp_parser_omp_clause_schedule (cp_parser *parser, tree list, location_t location)
23835 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
23838 c = build_omp_clause (location, OMP_CLAUSE_SCHEDULE);
23840 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
23842 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
23843 const char *p = IDENTIFIER_POINTER (id);
23848 if (strcmp ("dynamic", p) != 0)
23850 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
23854 if (strcmp ("guided", p) != 0)
23856 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
23860 if (strcmp ("runtime", p) != 0)
23862 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
23869 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
23870 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
23871 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AUTO))
23872 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_AUTO;
23875 cp_lexer_consume_token (parser->lexer);
23877 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23880 cp_lexer_consume_token (parser->lexer);
23882 token = cp_lexer_peek_token (parser->lexer);
23883 t = cp_parser_assignment_expression (parser, false, NULL);
23885 if (t == error_mark_node)
23887 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
23888 error_at (token->location, "schedule %<runtime%> does not take "
23889 "a %<chunk_size%> parameter");
23890 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_AUTO)
23891 error_at (token->location, "schedule %<auto%> does not take "
23892 "a %<chunk_size%> parameter");
23894 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
23896 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
23899 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_COMMA_CLOSE_PAREN))
23902 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule", location);
23903 OMP_CLAUSE_CHAIN (c) = list;
23907 cp_parser_error (parser, "invalid schedule kind");
23909 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
23910 /*or_comma=*/false,
23911 /*consume_paren=*/true);
23919 cp_parser_omp_clause_untied (cp_parser *parser ATTRIBUTE_UNUSED,
23920 tree list, location_t location)
23924 check_no_duplicate_clause (list, OMP_CLAUSE_UNTIED, "untied", location);
23926 c = build_omp_clause (location, OMP_CLAUSE_UNTIED);
23927 OMP_CLAUSE_CHAIN (c) = list;
23931 /* Parse all OpenMP clauses. The set clauses allowed by the directive
23932 is a bitmask in MASK. Return the list of clauses found; the result
23933 of clause default goes in *pdefault. */
23936 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
23937 const char *where, cp_token *pragma_tok)
23939 tree clauses = NULL;
23941 cp_token *token = NULL;
23943 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
23945 pragma_omp_clause c_kind;
23946 const char *c_name;
23947 tree prev = clauses;
23949 if (!first && cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23950 cp_lexer_consume_token (parser->lexer);
23952 token = cp_lexer_peek_token (parser->lexer);
23953 c_kind = cp_parser_omp_clause_name (parser);
23958 case PRAGMA_OMP_CLAUSE_COLLAPSE:
23959 clauses = cp_parser_omp_clause_collapse (parser, clauses,
23961 c_name = "collapse";
23963 case PRAGMA_OMP_CLAUSE_COPYIN:
23964 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
23967 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
23968 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
23970 c_name = "copyprivate";
23972 case PRAGMA_OMP_CLAUSE_DEFAULT:
23973 clauses = cp_parser_omp_clause_default (parser, clauses,
23975 c_name = "default";
23977 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
23978 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
23980 c_name = "firstprivate";
23982 case PRAGMA_OMP_CLAUSE_IF:
23983 clauses = cp_parser_omp_clause_if (parser, clauses, token->location);
23986 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
23987 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
23989 c_name = "lastprivate";
23991 case PRAGMA_OMP_CLAUSE_NOWAIT:
23992 clauses = cp_parser_omp_clause_nowait (parser, clauses, token->location);
23995 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
23996 clauses = cp_parser_omp_clause_num_threads (parser, clauses,
23998 c_name = "num_threads";
24000 case PRAGMA_OMP_CLAUSE_ORDERED:
24001 clauses = cp_parser_omp_clause_ordered (parser, clauses,
24003 c_name = "ordered";
24005 case PRAGMA_OMP_CLAUSE_PRIVATE:
24006 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
24008 c_name = "private";
24010 case PRAGMA_OMP_CLAUSE_REDUCTION:
24011 clauses = cp_parser_omp_clause_reduction (parser, clauses);
24012 c_name = "reduction";
24014 case PRAGMA_OMP_CLAUSE_SCHEDULE:
24015 clauses = cp_parser_omp_clause_schedule (parser, clauses,
24017 c_name = "schedule";
24019 case PRAGMA_OMP_CLAUSE_SHARED:
24020 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
24024 case PRAGMA_OMP_CLAUSE_UNTIED:
24025 clauses = cp_parser_omp_clause_untied (parser, clauses,
24030 cp_parser_error (parser, "expected %<#pragma omp%> clause");
24034 if (((mask >> c_kind) & 1) == 0)
24036 /* Remove the invalid clause(s) from the list to avoid
24037 confusing the rest of the compiler. */
24039 error_at (token->location, "%qs is not valid for %qs", c_name, where);
24043 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
24044 return finish_omp_clauses (clauses);
24051 In practice, we're also interested in adding the statement to an
24052 outer node. So it is convenient if we work around the fact that
24053 cp_parser_statement calls add_stmt. */
24056 cp_parser_begin_omp_structured_block (cp_parser *parser)
24058 unsigned save = parser->in_statement;
24060 /* Only move the values to IN_OMP_BLOCK if they weren't false.
24061 This preserves the "not within loop or switch" style error messages
24062 for nonsense cases like
24068 if (parser->in_statement)
24069 parser->in_statement = IN_OMP_BLOCK;
24075 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
24077 parser->in_statement = save;
24081 cp_parser_omp_structured_block (cp_parser *parser)
24083 tree stmt = begin_omp_structured_block ();
24084 unsigned int save = cp_parser_begin_omp_structured_block (parser);
24086 cp_parser_statement (parser, NULL_TREE, false, NULL);
24088 cp_parser_end_omp_structured_block (parser, save);
24089 return finish_omp_structured_block (stmt);
24093 # pragma omp atomic new-line
24097 x binop= expr | x++ | ++x | x-- | --x
24099 +, *, -, /, &, ^, |, <<, >>
24101 where x is an lvalue expression with scalar type. */
24104 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
24107 enum tree_code code;
24109 cp_parser_require_pragma_eol (parser, pragma_tok);
24111 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
24112 /*cast_p=*/false, NULL);
24113 switch (TREE_CODE (lhs))
24118 case PREINCREMENT_EXPR:
24119 case POSTINCREMENT_EXPR:
24120 lhs = TREE_OPERAND (lhs, 0);
24122 rhs = integer_one_node;
24125 case PREDECREMENT_EXPR:
24126 case POSTDECREMENT_EXPR:
24127 lhs = TREE_OPERAND (lhs, 0);
24129 rhs = integer_one_node;
24132 case COMPOUND_EXPR:
24133 if (TREE_CODE (TREE_OPERAND (lhs, 0)) == SAVE_EXPR
24134 && TREE_CODE (TREE_OPERAND (lhs, 1)) == COMPOUND_EXPR
24135 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs, 1), 0)) == MODIFY_EXPR
24136 && TREE_OPERAND (TREE_OPERAND (lhs, 1), 1) == TREE_OPERAND (lhs, 0)
24137 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
24138 (TREE_OPERAND (lhs, 1), 0), 0)))
24140 /* Undo effects of boolean_increment for post {in,de}crement. */
24141 lhs = TREE_OPERAND (TREE_OPERAND (lhs, 1), 0);
24144 if (TREE_CODE (lhs) == MODIFY_EXPR
24145 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs, 0))) == BOOLEAN_TYPE)
24147 /* Undo effects of boolean_increment. */
24148 if (integer_onep (TREE_OPERAND (lhs, 1)))
24150 /* This is pre or post increment. */
24151 rhs = TREE_OPERAND (lhs, 1);
24152 lhs = TREE_OPERAND (lhs, 0);
24159 switch (cp_lexer_peek_token (parser->lexer)->type)
24165 code = TRUNC_DIV_EXPR;
24173 case CPP_LSHIFT_EQ:
24174 code = LSHIFT_EXPR;
24176 case CPP_RSHIFT_EQ:
24177 code = RSHIFT_EXPR;
24180 code = BIT_AND_EXPR;
24183 code = BIT_IOR_EXPR;
24186 code = BIT_XOR_EXPR;
24189 cp_parser_error (parser,
24190 "invalid operator for %<#pragma omp atomic%>");
24193 cp_lexer_consume_token (parser->lexer);
24195 rhs = cp_parser_expression (parser, false, NULL);
24196 if (rhs == error_mark_node)
24200 finish_omp_atomic (code, lhs, rhs);
24201 cp_parser_consume_semicolon_at_end_of_statement (parser);
24205 cp_parser_skip_to_end_of_block_or_statement (parser);
24210 # pragma omp barrier new-line */
24213 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
24215 cp_parser_require_pragma_eol (parser, pragma_tok);
24216 finish_omp_barrier ();
24220 # pragma omp critical [(name)] new-line
24221 structured-block */
24224 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
24226 tree stmt, name = NULL;
24228 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
24230 cp_lexer_consume_token (parser->lexer);
24232 name = cp_parser_identifier (parser);
24234 if (name == error_mark_node
24235 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24236 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
24237 /*or_comma=*/false,
24238 /*consume_paren=*/true);
24239 if (name == error_mark_node)
24242 cp_parser_require_pragma_eol (parser, pragma_tok);
24244 stmt = cp_parser_omp_structured_block (parser);
24245 return c_finish_omp_critical (input_location, stmt, name);
24249 # pragma omp flush flush-vars[opt] new-line
24252 ( variable-list ) */
24255 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
24257 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
24258 (void) cp_parser_omp_var_list (parser, OMP_CLAUSE_ERROR, NULL);
24259 cp_parser_require_pragma_eol (parser, pragma_tok);
24261 finish_omp_flush ();
24264 /* Helper function, to parse omp for increment expression. */
24267 cp_parser_omp_for_cond (cp_parser *parser, tree decl)
24269 tree cond = cp_parser_binary_expression (parser, false, true,
24270 PREC_NOT_OPERATOR, NULL);
24271 if (cond == error_mark_node
24272 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24274 cp_parser_skip_to_end_of_statement (parser);
24275 return error_mark_node;
24278 switch (TREE_CODE (cond))
24286 return error_mark_node;
24289 /* If decl is an iterator, preserve LHS and RHS of the relational
24290 expr until finish_omp_for. */
24292 && (type_dependent_expression_p (decl)
24293 || CLASS_TYPE_P (TREE_TYPE (decl))))
24296 return build_x_binary_op (TREE_CODE (cond),
24297 TREE_OPERAND (cond, 0), ERROR_MARK,
24298 TREE_OPERAND (cond, 1), ERROR_MARK,
24299 /*overload=*/NULL, tf_warning_or_error);
24302 /* Helper function, to parse omp for increment expression. */
24305 cp_parser_omp_for_incr (cp_parser *parser, tree decl)
24307 cp_token *token = cp_lexer_peek_token (parser->lexer);
24313 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
24315 op = (token->type == CPP_PLUS_PLUS
24316 ? PREINCREMENT_EXPR : PREDECREMENT_EXPR);
24317 cp_lexer_consume_token (parser->lexer);
24318 lhs = cp_parser_cast_expression (parser, false, false, NULL);
24320 return error_mark_node;
24321 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
24324 lhs = cp_parser_primary_expression (parser, false, false, false, &idk);
24326 return error_mark_node;
24328 token = cp_lexer_peek_token (parser->lexer);
24329 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
24331 op = (token->type == CPP_PLUS_PLUS
24332 ? POSTINCREMENT_EXPR : POSTDECREMENT_EXPR);
24333 cp_lexer_consume_token (parser->lexer);
24334 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
24337 op = cp_parser_assignment_operator_opt (parser);
24338 if (op == ERROR_MARK)
24339 return error_mark_node;
24341 if (op != NOP_EXPR)
24343 rhs = cp_parser_assignment_expression (parser, false, NULL);
24344 rhs = build2 (op, TREE_TYPE (decl), decl, rhs);
24345 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
24348 lhs = cp_parser_binary_expression (parser, false, false,
24349 PREC_ADDITIVE_EXPRESSION, NULL);
24350 token = cp_lexer_peek_token (parser->lexer);
24351 decl_first = lhs == decl;
24354 if (token->type != CPP_PLUS
24355 && token->type != CPP_MINUS)
24356 return error_mark_node;
24360 op = token->type == CPP_PLUS ? PLUS_EXPR : MINUS_EXPR;
24361 cp_lexer_consume_token (parser->lexer);
24362 rhs = cp_parser_binary_expression (parser, false, false,
24363 PREC_ADDITIVE_EXPRESSION, NULL);
24364 token = cp_lexer_peek_token (parser->lexer);
24365 if (token->type == CPP_PLUS || token->type == CPP_MINUS || decl_first)
24367 if (lhs == NULL_TREE)
24369 if (op == PLUS_EXPR)
24372 lhs = build_x_unary_op (NEGATE_EXPR, rhs, tf_warning_or_error);
24375 lhs = build_x_binary_op (op, lhs, ERROR_MARK, rhs, ERROR_MARK,
24376 NULL, tf_warning_or_error);
24379 while (token->type == CPP_PLUS || token->type == CPP_MINUS);
24383 if (rhs != decl || op == MINUS_EXPR)
24384 return error_mark_node;
24385 rhs = build2 (op, TREE_TYPE (decl), lhs, decl);
24388 rhs = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, lhs);
24390 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
24393 /* Parse the restricted form of the for statement allowed by OpenMP. */
24396 cp_parser_omp_for_loop (cp_parser *parser, tree clauses, tree *par_clauses)
24398 tree init, cond, incr, body, decl, pre_body = NULL_TREE, ret;
24399 tree real_decl, initv, condv, incrv, declv;
24400 tree this_pre_body, cl;
24401 location_t loc_first;
24402 bool collapse_err = false;
24403 int i, collapse = 1, nbraces = 0;
24404 VEC(tree,gc) *for_block = make_tree_vector ();
24406 for (cl = clauses; cl; cl = OMP_CLAUSE_CHAIN (cl))
24407 if (OMP_CLAUSE_CODE (cl) == OMP_CLAUSE_COLLAPSE)
24408 collapse = tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl), 0);
24410 gcc_assert (collapse >= 1);
24412 declv = make_tree_vec (collapse);
24413 initv = make_tree_vec (collapse);
24414 condv = make_tree_vec (collapse);
24415 incrv = make_tree_vec (collapse);
24417 loc_first = cp_lexer_peek_token (parser->lexer)->location;
24419 for (i = 0; i < collapse; i++)
24421 int bracecount = 0;
24422 bool add_private_clause = false;
24425 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
24427 cp_parser_error (parser, "for statement expected");
24430 loc = cp_lexer_consume_token (parser->lexer)->location;
24432 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24435 init = decl = real_decl = NULL;
24436 this_pre_body = push_stmt_list ();
24437 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24439 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
24443 integer-type var = lb
24444 random-access-iterator-type var = lb
24445 pointer-type var = lb
24447 cp_decl_specifier_seq type_specifiers;
24449 /* First, try to parse as an initialized declaration. See
24450 cp_parser_condition, from whence the bulk of this is copied. */
24452 cp_parser_parse_tentatively (parser);
24453 cp_parser_type_specifier_seq (parser, /*is_declaration=*/true,
24454 /*is_trailing_return=*/false,
24456 if (cp_parser_parse_definitely (parser))
24458 /* If parsing a type specifier seq succeeded, then this
24459 MUST be a initialized declaration. */
24460 tree asm_specification, attributes;
24461 cp_declarator *declarator;
24463 declarator = cp_parser_declarator (parser,
24464 CP_PARSER_DECLARATOR_NAMED,
24465 /*ctor_dtor_or_conv_p=*/NULL,
24466 /*parenthesized_p=*/NULL,
24467 /*member_p=*/false);
24468 attributes = cp_parser_attributes_opt (parser);
24469 asm_specification = cp_parser_asm_specification_opt (parser);
24471 if (declarator == cp_error_declarator)
24472 cp_parser_skip_to_end_of_statement (parser);
24476 tree pushed_scope, auto_node;
24478 decl = start_decl (declarator, &type_specifiers,
24479 SD_INITIALIZED, attributes,
24480 /*prefix_attributes=*/NULL_TREE,
24483 auto_node = type_uses_auto (TREE_TYPE (decl));
24484 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
24486 if (cp_lexer_next_token_is (parser->lexer,
24488 error ("parenthesized initialization is not allowed in "
24489 "OpenMP %<for%> loop");
24491 /* Trigger an error. */
24492 cp_parser_require (parser, CPP_EQ, RT_EQ);
24494 init = error_mark_node;
24495 cp_parser_skip_to_end_of_statement (parser);
24497 else if (CLASS_TYPE_P (TREE_TYPE (decl))
24498 || type_dependent_expression_p (decl)
24501 bool is_direct_init, is_non_constant_init;
24503 init = cp_parser_initializer (parser,
24505 &is_non_constant_init);
24510 = do_auto_deduction (TREE_TYPE (decl), init,
24513 if (!CLASS_TYPE_P (TREE_TYPE (decl))
24514 && !type_dependent_expression_p (decl))
24518 cp_finish_decl (decl, init, !is_non_constant_init,
24520 LOOKUP_ONLYCONVERTING);
24521 if (CLASS_TYPE_P (TREE_TYPE (decl)))
24523 VEC_safe_push (tree, gc, for_block, this_pre_body);
24527 init = pop_stmt_list (this_pre_body);
24528 this_pre_body = NULL_TREE;
24533 cp_lexer_consume_token (parser->lexer);
24534 init = cp_parser_assignment_expression (parser, false, NULL);
24537 if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
24538 init = error_mark_node;
24540 cp_finish_decl (decl, NULL_TREE,
24541 /*init_const_expr_p=*/false,
24543 LOOKUP_ONLYCONVERTING);
24547 pop_scope (pushed_scope);
24553 /* If parsing a type specifier sequence failed, then
24554 this MUST be a simple expression. */
24555 cp_parser_parse_tentatively (parser);
24556 decl = cp_parser_primary_expression (parser, false, false,
24558 if (!cp_parser_error_occurred (parser)
24561 && CLASS_TYPE_P (TREE_TYPE (decl)))
24565 cp_parser_parse_definitely (parser);
24566 cp_parser_require (parser, CPP_EQ, RT_EQ);
24567 rhs = cp_parser_assignment_expression (parser, false, NULL);
24568 finish_expr_stmt (build_x_modify_expr (decl, NOP_EXPR,
24570 tf_warning_or_error));
24571 add_private_clause = true;
24576 cp_parser_abort_tentative_parse (parser);
24577 init = cp_parser_expression (parser, false, NULL);
24580 if (TREE_CODE (init) == MODIFY_EXPR
24581 || TREE_CODE (init) == MODOP_EXPR)
24582 real_decl = TREE_OPERAND (init, 0);
24587 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
24590 this_pre_body = pop_stmt_list (this_pre_body);
24594 pre_body = push_stmt_list ();
24596 add_stmt (this_pre_body);
24597 pre_body = pop_stmt_list (pre_body);
24600 pre_body = this_pre_body;
24605 if (par_clauses != NULL && real_decl != NULL_TREE)
24608 for (c = par_clauses; *c ; )
24609 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_FIRSTPRIVATE
24610 && OMP_CLAUSE_DECL (*c) == real_decl)
24612 error_at (loc, "iteration variable %qD"
24613 " should not be firstprivate", real_decl);
24614 *c = OMP_CLAUSE_CHAIN (*c);
24616 else if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_LASTPRIVATE
24617 && OMP_CLAUSE_DECL (*c) == real_decl)
24619 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
24620 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
24621 tree l = build_omp_clause (loc, OMP_CLAUSE_LASTPRIVATE);
24622 OMP_CLAUSE_DECL (l) = real_decl;
24623 OMP_CLAUSE_CHAIN (l) = clauses;
24624 CP_OMP_CLAUSE_INFO (l) = CP_OMP_CLAUSE_INFO (*c);
24626 OMP_CLAUSE_SET_CODE (*c, OMP_CLAUSE_SHARED);
24627 CP_OMP_CLAUSE_INFO (*c) = NULL;
24628 add_private_clause = false;
24632 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_PRIVATE
24633 && OMP_CLAUSE_DECL (*c) == real_decl)
24634 add_private_clause = false;
24635 c = &OMP_CLAUSE_CHAIN (*c);
24639 if (add_private_clause)
24642 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
24644 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE
24645 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE)
24646 && OMP_CLAUSE_DECL (c) == decl)
24648 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
24649 && OMP_CLAUSE_DECL (c) == decl)
24650 error_at (loc, "iteration variable %qD "
24651 "should not be firstprivate",
24653 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
24654 && OMP_CLAUSE_DECL (c) == decl)
24655 error_at (loc, "iteration variable %qD should not be reduction",
24660 c = build_omp_clause (loc, OMP_CLAUSE_PRIVATE);
24661 OMP_CLAUSE_DECL (c) = decl;
24662 c = finish_omp_clauses (c);
24665 OMP_CLAUSE_CHAIN (c) = clauses;
24672 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24673 cond = cp_parser_omp_for_cond (parser, decl);
24674 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
24677 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
24679 /* If decl is an iterator, preserve the operator on decl
24680 until finish_omp_for. */
24682 && ((type_dependent_expression_p (decl)
24683 && !POINTER_TYPE_P (TREE_TYPE (decl)))
24684 || CLASS_TYPE_P (TREE_TYPE (decl))))
24685 incr = cp_parser_omp_for_incr (parser, decl);
24687 incr = cp_parser_expression (parser, false, NULL);
24690 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24691 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
24692 /*or_comma=*/false,
24693 /*consume_paren=*/true);
24695 TREE_VEC_ELT (declv, i) = decl;
24696 TREE_VEC_ELT (initv, i) = init;
24697 TREE_VEC_ELT (condv, i) = cond;
24698 TREE_VEC_ELT (incrv, i) = incr;
24700 if (i == collapse - 1)
24703 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
24704 in between the collapsed for loops to be still considered perfectly
24705 nested. Hopefully the final version clarifies this.
24706 For now handle (multiple) {'s and empty statements. */
24707 cp_parser_parse_tentatively (parser);
24710 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
24712 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
24714 cp_lexer_consume_token (parser->lexer);
24717 else if (bracecount
24718 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
24719 cp_lexer_consume_token (parser->lexer);
24722 loc = cp_lexer_peek_token (parser->lexer)->location;
24723 error_at (loc, "not enough collapsed for loops");
24724 collapse_err = true;
24725 cp_parser_abort_tentative_parse (parser);
24734 cp_parser_parse_definitely (parser);
24735 nbraces += bracecount;
24739 /* Note that we saved the original contents of this flag when we entered
24740 the structured block, and so we don't need to re-save it here. */
24741 parser->in_statement = IN_OMP_FOR;
24743 /* Note that the grammar doesn't call for a structured block here,
24744 though the loop as a whole is a structured block. */
24745 body = push_stmt_list ();
24746 cp_parser_statement (parser, NULL_TREE, false, NULL);
24747 body = pop_stmt_list (body);
24749 if (declv == NULL_TREE)
24752 ret = finish_omp_for (loc_first, declv, initv, condv, incrv, body,
24753 pre_body, clauses);
24757 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
24759 cp_lexer_consume_token (parser->lexer);
24762 else if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
24763 cp_lexer_consume_token (parser->lexer);
24768 error_at (cp_lexer_peek_token (parser->lexer)->location,
24769 "collapsed loops not perfectly nested");
24771 collapse_err = true;
24772 cp_parser_statement_seq_opt (parser, NULL);
24773 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
24778 while (!VEC_empty (tree, for_block))
24779 add_stmt (pop_stmt_list (VEC_pop (tree, for_block)));
24780 release_tree_vector (for_block);
24786 #pragma omp for for-clause[optseq] new-line
24789 #define OMP_FOR_CLAUSE_MASK \
24790 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24791 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24792 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
24793 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
24794 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
24795 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
24796 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
24797 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
24800 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
24802 tree clauses, sb, ret;
24805 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
24806 "#pragma omp for", pragma_tok);
24808 sb = begin_omp_structured_block ();
24809 save = cp_parser_begin_omp_structured_block (parser);
24811 ret = cp_parser_omp_for_loop (parser, clauses, NULL);
24813 cp_parser_end_omp_structured_block (parser, save);
24814 add_stmt (finish_omp_structured_block (sb));
24820 # pragma omp master new-line
24821 structured-block */
24824 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
24826 cp_parser_require_pragma_eol (parser, pragma_tok);
24827 return c_finish_omp_master (input_location,
24828 cp_parser_omp_structured_block (parser));
24832 # pragma omp ordered new-line
24833 structured-block */
24836 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
24838 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
24839 cp_parser_require_pragma_eol (parser, pragma_tok);
24840 return c_finish_omp_ordered (loc, cp_parser_omp_structured_block (parser));
24846 { section-sequence }
24849 section-directive[opt] structured-block
24850 section-sequence section-directive structured-block */
24853 cp_parser_omp_sections_scope (cp_parser *parser)
24855 tree stmt, substmt;
24856 bool error_suppress = false;
24859 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
24862 stmt = push_stmt_list ();
24864 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
24868 substmt = begin_omp_structured_block ();
24869 save = cp_parser_begin_omp_structured_block (parser);
24873 cp_parser_statement (parser, NULL_TREE, false, NULL);
24875 tok = cp_lexer_peek_token (parser->lexer);
24876 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
24878 if (tok->type == CPP_CLOSE_BRACE)
24880 if (tok->type == CPP_EOF)
24884 cp_parser_end_omp_structured_block (parser, save);
24885 substmt = finish_omp_structured_block (substmt);
24886 substmt = build1 (OMP_SECTION, void_type_node, substmt);
24887 add_stmt (substmt);
24892 tok = cp_lexer_peek_token (parser->lexer);
24893 if (tok->type == CPP_CLOSE_BRACE)
24895 if (tok->type == CPP_EOF)
24898 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
24900 cp_lexer_consume_token (parser->lexer);
24901 cp_parser_require_pragma_eol (parser, tok);
24902 error_suppress = false;
24904 else if (!error_suppress)
24906 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
24907 error_suppress = true;
24910 substmt = cp_parser_omp_structured_block (parser);
24911 substmt = build1 (OMP_SECTION, void_type_node, substmt);
24912 add_stmt (substmt);
24914 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
24916 substmt = pop_stmt_list (stmt);
24918 stmt = make_node (OMP_SECTIONS);
24919 TREE_TYPE (stmt) = void_type_node;
24920 OMP_SECTIONS_BODY (stmt) = substmt;
24927 # pragma omp sections sections-clause[optseq] newline
24930 #define OMP_SECTIONS_CLAUSE_MASK \
24931 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24932 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24933 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
24934 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
24935 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
24938 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
24942 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
24943 "#pragma omp sections", pragma_tok);
24945 ret = cp_parser_omp_sections_scope (parser);
24947 OMP_SECTIONS_CLAUSES (ret) = clauses;
24953 # pragma parallel parallel-clause new-line
24954 # pragma parallel for parallel-for-clause new-line
24955 # pragma parallel sections parallel-sections-clause new-line */
24957 #define OMP_PARALLEL_CLAUSE_MASK \
24958 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
24959 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24960 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24961 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
24962 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
24963 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
24964 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
24965 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
24968 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
24970 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
24971 const char *p_name = "#pragma omp parallel";
24972 tree stmt, clauses, par_clause, ws_clause, block;
24973 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
24975 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
24977 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
24979 cp_lexer_consume_token (parser->lexer);
24980 p_kind = PRAGMA_OMP_PARALLEL_FOR;
24981 p_name = "#pragma omp parallel for";
24982 mask |= OMP_FOR_CLAUSE_MASK;
24983 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
24985 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
24987 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
24988 const char *p = IDENTIFIER_POINTER (id);
24989 if (strcmp (p, "sections") == 0)
24991 cp_lexer_consume_token (parser->lexer);
24992 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
24993 p_name = "#pragma omp parallel sections";
24994 mask |= OMP_SECTIONS_CLAUSE_MASK;
24995 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
24999 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
25000 block = begin_omp_parallel ();
25001 save = cp_parser_begin_omp_structured_block (parser);
25005 case PRAGMA_OMP_PARALLEL:
25006 cp_parser_statement (parser, NULL_TREE, false, NULL);
25007 par_clause = clauses;
25010 case PRAGMA_OMP_PARALLEL_FOR:
25011 c_split_parallel_clauses (loc, clauses, &par_clause, &ws_clause);
25012 cp_parser_omp_for_loop (parser, ws_clause, &par_clause);
25015 case PRAGMA_OMP_PARALLEL_SECTIONS:
25016 c_split_parallel_clauses (loc, clauses, &par_clause, &ws_clause);
25017 stmt = cp_parser_omp_sections_scope (parser);
25019 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
25023 gcc_unreachable ();
25026 cp_parser_end_omp_structured_block (parser, save);
25027 stmt = finish_omp_parallel (par_clause, block);
25028 if (p_kind != PRAGMA_OMP_PARALLEL)
25029 OMP_PARALLEL_COMBINED (stmt) = 1;
25034 # pragma omp single single-clause[optseq] new-line
25035 structured-block */
25037 #define OMP_SINGLE_CLAUSE_MASK \
25038 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
25039 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
25040 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
25041 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
25044 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
25046 tree stmt = make_node (OMP_SINGLE);
25047 TREE_TYPE (stmt) = void_type_node;
25049 OMP_SINGLE_CLAUSES (stmt)
25050 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
25051 "#pragma omp single", pragma_tok);
25052 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
25054 return add_stmt (stmt);
25058 # pragma omp task task-clause[optseq] new-line
25059 structured-block */
25061 #define OMP_TASK_CLAUSE_MASK \
25062 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
25063 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
25064 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
25065 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
25066 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
25067 | (1u << PRAGMA_OMP_CLAUSE_SHARED))
25070 cp_parser_omp_task (cp_parser *parser, cp_token *pragma_tok)
25072 tree clauses, block;
25075 clauses = cp_parser_omp_all_clauses (parser, OMP_TASK_CLAUSE_MASK,
25076 "#pragma omp task", pragma_tok);
25077 block = begin_omp_task ();
25078 save = cp_parser_begin_omp_structured_block (parser);
25079 cp_parser_statement (parser, NULL_TREE, false, NULL);
25080 cp_parser_end_omp_structured_block (parser, save);
25081 return finish_omp_task (clauses, block);
25085 # pragma omp taskwait new-line */
25088 cp_parser_omp_taskwait (cp_parser *parser, cp_token *pragma_tok)
25090 cp_parser_require_pragma_eol (parser, pragma_tok);
25091 finish_omp_taskwait ();
25095 # pragma omp threadprivate (variable-list) */
25098 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
25102 vars = cp_parser_omp_var_list (parser, OMP_CLAUSE_ERROR, NULL);
25103 cp_parser_require_pragma_eol (parser, pragma_tok);
25105 finish_omp_threadprivate (vars);
25108 /* Main entry point to OpenMP statement pragmas. */
25111 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
25115 switch (pragma_tok->pragma_kind)
25117 case PRAGMA_OMP_ATOMIC:
25118 cp_parser_omp_atomic (parser, pragma_tok);
25120 case PRAGMA_OMP_CRITICAL:
25121 stmt = cp_parser_omp_critical (parser, pragma_tok);
25123 case PRAGMA_OMP_FOR:
25124 stmt = cp_parser_omp_for (parser, pragma_tok);
25126 case PRAGMA_OMP_MASTER:
25127 stmt = cp_parser_omp_master (parser, pragma_tok);
25129 case PRAGMA_OMP_ORDERED:
25130 stmt = cp_parser_omp_ordered (parser, pragma_tok);
25132 case PRAGMA_OMP_PARALLEL:
25133 stmt = cp_parser_omp_parallel (parser, pragma_tok);
25135 case PRAGMA_OMP_SECTIONS:
25136 stmt = cp_parser_omp_sections (parser, pragma_tok);
25138 case PRAGMA_OMP_SINGLE:
25139 stmt = cp_parser_omp_single (parser, pragma_tok);
25141 case PRAGMA_OMP_TASK:
25142 stmt = cp_parser_omp_task (parser, pragma_tok);
25145 gcc_unreachable ();
25149 SET_EXPR_LOCATION (stmt, pragma_tok->location);
25154 static GTY (()) cp_parser *the_parser;
25157 /* Special handling for the first token or line in the file. The first
25158 thing in the file might be #pragma GCC pch_preprocess, which loads a
25159 PCH file, which is a GC collection point. So we need to handle this
25160 first pragma without benefit of an existing lexer structure.
25162 Always returns one token to the caller in *FIRST_TOKEN. This is
25163 either the true first token of the file, or the first token after
25164 the initial pragma. */
25167 cp_parser_initial_pragma (cp_token *first_token)
25171 cp_lexer_get_preprocessor_token (NULL, first_token);
25172 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
25175 cp_lexer_get_preprocessor_token (NULL, first_token);
25176 if (first_token->type == CPP_STRING)
25178 name = first_token->u.value;
25180 cp_lexer_get_preprocessor_token (NULL, first_token);
25181 if (first_token->type != CPP_PRAGMA_EOL)
25182 error_at (first_token->location,
25183 "junk at end of %<#pragma GCC pch_preprocess%>");
25186 error_at (first_token->location, "expected string literal");
25188 /* Skip to the end of the pragma. */
25189 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
25190 cp_lexer_get_preprocessor_token (NULL, first_token);
25192 /* Now actually load the PCH file. */
25194 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
25196 /* Read one more token to return to our caller. We have to do this
25197 after reading the PCH file in, since its pointers have to be
25199 cp_lexer_get_preprocessor_token (NULL, first_token);
25202 /* Normal parsing of a pragma token. Here we can (and must) use the
25206 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
25208 cp_token *pragma_tok;
25211 pragma_tok = cp_lexer_consume_token (parser->lexer);
25212 gcc_assert (pragma_tok->type == CPP_PRAGMA);
25213 parser->lexer->in_pragma = true;
25215 id = pragma_tok->pragma_kind;
25218 case PRAGMA_GCC_PCH_PREPROCESS:
25219 error_at (pragma_tok->location,
25220 "%<#pragma GCC pch_preprocess%> must be first");
25223 case PRAGMA_OMP_BARRIER:
25226 case pragma_compound:
25227 cp_parser_omp_barrier (parser, pragma_tok);
25230 error_at (pragma_tok->location, "%<#pragma omp barrier%> may only be "
25231 "used in compound statements");
25238 case PRAGMA_OMP_FLUSH:
25241 case pragma_compound:
25242 cp_parser_omp_flush (parser, pragma_tok);
25245 error_at (pragma_tok->location, "%<#pragma omp flush%> may only be "
25246 "used in compound statements");
25253 case PRAGMA_OMP_TASKWAIT:
25256 case pragma_compound:
25257 cp_parser_omp_taskwait (parser, pragma_tok);
25260 error_at (pragma_tok->location,
25261 "%<#pragma omp taskwait%> may only be "
25262 "used in compound statements");
25269 case PRAGMA_OMP_THREADPRIVATE:
25270 cp_parser_omp_threadprivate (parser, pragma_tok);
25273 case PRAGMA_OMP_ATOMIC:
25274 case PRAGMA_OMP_CRITICAL:
25275 case PRAGMA_OMP_FOR:
25276 case PRAGMA_OMP_MASTER:
25277 case PRAGMA_OMP_ORDERED:
25278 case PRAGMA_OMP_PARALLEL:
25279 case PRAGMA_OMP_SECTIONS:
25280 case PRAGMA_OMP_SINGLE:
25281 case PRAGMA_OMP_TASK:
25282 if (context == pragma_external)
25284 cp_parser_omp_construct (parser, pragma_tok);
25287 case PRAGMA_OMP_SECTION:
25288 error_at (pragma_tok->location,
25289 "%<#pragma omp section%> may only be used in "
25290 "%<#pragma omp sections%> construct");
25294 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
25295 c_invoke_pragma_handler (id);
25299 cp_parser_error (parser, "expected declaration specifiers");
25303 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
25307 /* The interface the pragma parsers have to the lexer. */
25310 pragma_lex (tree *value)
25313 enum cpp_ttype ret;
25315 tok = cp_lexer_peek_token (the_parser->lexer);
25318 *value = tok->u.value;
25320 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
25322 else if (ret == CPP_STRING)
25323 *value = cp_parser_string_literal (the_parser, false, false);
25326 cp_lexer_consume_token (the_parser->lexer);
25327 if (ret == CPP_KEYWORD)
25335 /* External interface. */
25337 /* Parse one entire translation unit. */
25340 c_parse_file (void)
25342 static bool already_called = false;
25344 if (already_called)
25346 sorry ("inter-module optimizations not implemented for C++");
25349 already_called = true;
25351 the_parser = cp_parser_new ();
25352 push_deferring_access_checks (flag_access_control
25353 ? dk_no_deferred : dk_no_check);
25354 cp_parser_translation_unit (the_parser);
25358 #include "gt-cp-parser.h"