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 /* a transaction expression */
112 } non_integral_constant;
114 /* The various kinds of errors about name-lookup failing. */
115 typedef enum name_lookup_error {
120 /* is not a class or namespace */
122 /* is not a class, namespace, or enumeration */
126 /* The various kinds of required token */
127 typedef enum required_token {
129 RT_SEMICOLON, /* ';' */
130 RT_OPEN_PAREN, /* '(' */
131 RT_CLOSE_BRACE, /* '}' */
132 RT_OPEN_BRACE, /* '{' */
133 RT_CLOSE_SQUARE, /* ']' */
134 RT_OPEN_SQUARE, /* '[' */
138 RT_GREATER, /* '>' */
140 RT_ELLIPSIS, /* '...' */
144 RT_COLON_SCOPE, /* ':' or '::' */
145 RT_CLOSE_PAREN, /* ')' */
146 RT_COMMA_CLOSE_PAREN, /* ',' or ')' */
147 RT_PRAGMA_EOL, /* end of line */
148 RT_NAME, /* identifier */
150 /* The type is CPP_KEYWORD */
152 RT_DELETE, /* delete */
153 RT_RETURN, /* return */
154 RT_WHILE, /* while */
155 RT_EXTERN, /* extern */
156 RT_STATIC_ASSERT, /* static_assert */
157 RT_DECLTYPE, /* decltype */
158 RT_OPERATOR, /* operator */
159 RT_CLASS, /* class */
160 RT_TEMPLATE, /* template */
161 RT_NAMESPACE, /* namespace */
162 RT_USING, /* using */
165 RT_CATCH, /* catch */
166 RT_THROW, /* throw */
167 RT_LABEL, /* __label__ */
168 RT_AT_TRY, /* @try */
169 RT_AT_SYNCHRONIZED, /* @synchronized */
170 RT_AT_THROW, /* @throw */
172 RT_SELECT, /* selection-statement */
173 RT_INTERATION, /* iteration-statement */
174 RT_JUMP, /* jump-statement */
175 RT_CLASS_KEY, /* class-key */
176 RT_CLASS_TYPENAME_TEMPLATE, /* class, typename, or template */
177 RT_TRANSACTION_ATOMIC, /* __transaction_atomic */
178 RT_TRANSACTION_RELAXED, /* __transaction_relaxed */
179 RT_TRANSACTION_CANCEL /* __transaction_cancel */
184 static cp_lexer *cp_lexer_new_main
186 static cp_lexer *cp_lexer_new_from_tokens
187 (cp_token_cache *tokens);
188 static void cp_lexer_destroy
190 static int cp_lexer_saving_tokens
192 static cp_token *cp_lexer_token_at
193 (cp_lexer *, cp_token_position);
194 static void cp_lexer_get_preprocessor_token
195 (cp_lexer *, cp_token *);
196 static inline cp_token *cp_lexer_peek_token
198 static cp_token *cp_lexer_peek_nth_token
199 (cp_lexer *, size_t);
200 static inline bool cp_lexer_next_token_is
201 (cp_lexer *, enum cpp_ttype);
202 static bool cp_lexer_next_token_is_not
203 (cp_lexer *, enum cpp_ttype);
204 static bool cp_lexer_next_token_is_keyword
205 (cp_lexer *, enum rid);
206 static cp_token *cp_lexer_consume_token
208 static void cp_lexer_purge_token
210 static void cp_lexer_purge_tokens_after
211 (cp_lexer *, cp_token_position);
212 static void cp_lexer_save_tokens
214 static void cp_lexer_commit_tokens
216 static void cp_lexer_rollback_tokens
218 static void cp_lexer_print_token
219 (FILE *, cp_token *);
220 static inline bool cp_lexer_debugging_p
222 static void cp_lexer_start_debugging
223 (cp_lexer *) ATTRIBUTE_UNUSED;
224 static void cp_lexer_stop_debugging
225 (cp_lexer *) ATTRIBUTE_UNUSED;
227 static cp_token_cache *cp_token_cache_new
228 (cp_token *, cp_token *);
230 static void cp_parser_initial_pragma
233 static tree cp_literal_operator_id
236 /* Manifest constants. */
237 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
238 #define CP_SAVED_TOKEN_STACK 5
242 /* The stream to which debugging output should be written. */
243 static FILE *cp_lexer_debug_stream;
245 /* Nonzero if we are parsing an unevaluated operand: an operand to
246 sizeof, typeof, or alignof. */
247 int cp_unevaluated_operand;
249 /* Dump up to NUM tokens in BUFFER to FILE starting with token
250 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
251 first token in BUFFER. If NUM is 0, dump all the tokens. If
252 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
253 highlighted by surrounding it in [[ ]]. */
256 cp_lexer_dump_tokens (FILE *file, VEC(cp_token,gc) *buffer,
257 cp_token *start_token, unsigned num,
258 cp_token *curr_token)
260 unsigned i, nprinted;
264 fprintf (file, "%u tokens\n", VEC_length (cp_token, buffer));
270 num = VEC_length (cp_token, buffer);
272 if (start_token == NULL)
273 start_token = VEC_address (cp_token, buffer);
275 if (start_token > VEC_address (cp_token, buffer))
277 cp_lexer_print_token (file, VEC_index (cp_token, buffer, 0));
278 fprintf (file, " ... ");
283 for (i = 0; VEC_iterate (cp_token, buffer, i, token) && nprinted < num; i++)
285 if (token == start_token)
292 if (token == curr_token)
293 fprintf (file, "[[");
295 cp_lexer_print_token (file, token);
297 if (token == curr_token)
298 fprintf (file, "]]");
304 case CPP_CLOSE_BRACE:
314 if (i == num && i < VEC_length (cp_token, buffer))
316 fprintf (file, " ... ");
317 cp_lexer_print_token (file, VEC_index (cp_token, buffer,
318 VEC_length (cp_token, buffer) - 1));
321 fprintf (file, "\n");
325 /* Dump all tokens in BUFFER to stderr. */
328 cp_lexer_debug_tokens (VEC(cp_token,gc) *buffer)
330 cp_lexer_dump_tokens (stderr, buffer, NULL, 0, NULL);
334 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
335 description for T. */
338 cp_debug_print_tree_if_set (FILE *file, const char *desc, tree t)
342 fprintf (file, "%s: ", desc);
343 print_node_brief (file, "", t, 0);
348 /* Dump parser context C to FILE. */
351 cp_debug_print_context (FILE *file, cp_parser_context *c)
353 const char *status_s[] = { "OK", "ERROR", "COMMITTED" };
354 fprintf (file, "{ status = %s, scope = ", status_s[c->status]);
355 print_node_brief (file, "", c->object_type, 0);
356 fprintf (file, "}\n");
360 /* Print the stack of parsing contexts to FILE starting with FIRST. */
363 cp_debug_print_context_stack (FILE *file, cp_parser_context *first)
366 cp_parser_context *c;
368 fprintf (file, "Parsing context stack:\n");
369 for (i = 0, c = first; c; c = c->next, i++)
371 fprintf (file, "\t#%u: ", i);
372 cp_debug_print_context (file, c);
377 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
380 cp_debug_print_flag (FILE *file, const char *desc, bool flag)
383 fprintf (file, "%s: true\n", desc);
387 /* Print an unparsed function entry UF to FILE. */
390 cp_debug_print_unparsed_function (FILE *file, cp_unparsed_functions_entry *uf)
393 cp_default_arg_entry *default_arg_fn;
396 fprintf (file, "\tFunctions with default args:\n");
398 VEC_iterate (cp_default_arg_entry, uf->funs_with_default_args, i,
402 fprintf (file, "\t\tClass type: ");
403 print_node_brief (file, "", default_arg_fn->class_type, 0);
404 fprintf (file, "\t\tDeclaration: ");
405 print_node_brief (file, "", default_arg_fn->decl, 0);
406 fprintf (file, "\n");
409 fprintf (file, "\n\tFunctions with definitions that require "
410 "post-processing\n\t\t");
411 for (i = 0; VEC_iterate (tree, uf->funs_with_definitions, i, fn); i++)
413 print_node_brief (file, "", fn, 0);
416 fprintf (file, "\n");
418 fprintf (file, "\n\tNon-static data members with initializers that require "
419 "post-processing\n\t\t");
420 for (i = 0; VEC_iterate (tree, uf->nsdmis, i, fn); i++)
422 print_node_brief (file, "", fn, 0);
425 fprintf (file, "\n");
429 /* Print the stack of unparsed member functions S to FILE. */
432 cp_debug_print_unparsed_queues (FILE *file,
433 VEC(cp_unparsed_functions_entry, gc) *s)
436 cp_unparsed_functions_entry *uf;
438 fprintf (file, "Unparsed functions\n");
439 for (i = 0; VEC_iterate (cp_unparsed_functions_entry, s, i, uf); i++)
441 fprintf (file, "#%u:\n", i);
442 cp_debug_print_unparsed_function (file, uf);
447 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
448 the given PARSER. If FILE is NULL, the output is printed on stderr. */
451 cp_debug_parser_tokens (FILE *file, cp_parser *parser, int window_size)
453 cp_token *next_token, *first_token, *start_token;
458 next_token = parser->lexer->next_token;
459 first_token = VEC_address (cp_token, parser->lexer->buffer);
460 start_token = (next_token > first_token + window_size / 2)
461 ? next_token - window_size / 2
463 cp_lexer_dump_tokens (file, parser->lexer->buffer, start_token, window_size,
468 /* Dump debugging information for the given PARSER. If FILE is NULL,
469 the output is printed on stderr. */
472 cp_debug_parser (FILE *file, cp_parser *parser)
474 const size_t window_size = 20;
476 expanded_location eloc;
481 fprintf (file, "Parser state\n\n");
482 fprintf (file, "Number of tokens: %u\n",
483 VEC_length (cp_token, parser->lexer->buffer));
484 cp_debug_print_tree_if_set (file, "Lookup scope", parser->scope);
485 cp_debug_print_tree_if_set (file, "Object scope",
486 parser->object_scope);
487 cp_debug_print_tree_if_set (file, "Qualifying scope",
488 parser->qualifying_scope);
489 cp_debug_print_context_stack (file, parser->context);
490 cp_debug_print_flag (file, "Allow GNU extensions",
491 parser->allow_gnu_extensions_p);
492 cp_debug_print_flag (file, "'>' token is greater-than",
493 parser->greater_than_is_operator_p);
494 cp_debug_print_flag (file, "Default args allowed in current "
495 "parameter list", parser->default_arg_ok_p);
496 cp_debug_print_flag (file, "Parsing integral constant-expression",
497 parser->integral_constant_expression_p);
498 cp_debug_print_flag (file, "Allow non-constant expression in current "
499 "constant-expression",
500 parser->allow_non_integral_constant_expression_p);
501 cp_debug_print_flag (file, "Seen non-constant expression",
502 parser->non_integral_constant_expression_p);
503 cp_debug_print_flag (file, "Local names and 'this' forbidden in "
505 parser->local_variables_forbidden_p);
506 cp_debug_print_flag (file, "In unbraced linkage specification",
507 parser->in_unbraced_linkage_specification_p);
508 cp_debug_print_flag (file, "Parsing a declarator",
509 parser->in_declarator_p);
510 cp_debug_print_flag (file, "In template argument list",
511 parser->in_template_argument_list_p);
512 cp_debug_print_flag (file, "Parsing an iteration statement",
513 parser->in_statement & IN_ITERATION_STMT);
514 cp_debug_print_flag (file, "Parsing a switch statement",
515 parser->in_statement & IN_SWITCH_STMT);
516 cp_debug_print_flag (file, "Parsing a structured OpenMP block",
517 parser->in_statement & IN_OMP_BLOCK);
518 cp_debug_print_flag (file, "Parsing a an OpenMP loop",
519 parser->in_statement & IN_OMP_FOR);
520 cp_debug_print_flag (file, "Parsing an if statement",
521 parser->in_statement & IN_IF_STMT);
522 cp_debug_print_flag (file, "Parsing a type-id in an expression "
523 "context", parser->in_type_id_in_expr_p);
524 cp_debug_print_flag (file, "Declarations are implicitly extern \"C\"",
525 parser->implicit_extern_c);
526 cp_debug_print_flag (file, "String expressions should be translated "
527 "to execution character set",
528 parser->translate_strings_p);
529 cp_debug_print_flag (file, "Parsing function body outside of a "
530 "local class", parser->in_function_body);
531 cp_debug_print_flag (file, "Auto correct a colon to a scope operator",
532 parser->colon_corrects_to_scope_p);
533 if (parser->type_definition_forbidden_message)
534 fprintf (file, "Error message for forbidden type definitions: %s\n",
535 parser->type_definition_forbidden_message);
536 cp_debug_print_unparsed_queues (file, parser->unparsed_queues);
537 fprintf (file, "Number of class definitions in progress: %u\n",
538 parser->num_classes_being_defined);
539 fprintf (file, "Number of template parameter lists for the current "
540 "declaration: %u\n", parser->num_template_parameter_lists);
541 cp_debug_parser_tokens (file, parser, window_size);
542 token = parser->lexer->next_token;
543 fprintf (file, "Next token to parse:\n");
544 fprintf (file, "\tToken: ");
545 cp_lexer_print_token (file, token);
546 eloc = expand_location (token->location);
547 fprintf (file, "\n\tFile: %s\n", eloc.file);
548 fprintf (file, "\tLine: %d\n", eloc.line);
549 fprintf (file, "\tColumn: %d\n", eloc.column);
553 /* Allocate memory for a new lexer object and return it. */
556 cp_lexer_alloc (void)
560 c_common_no_more_pch ();
562 /* Allocate the memory. */
563 lexer = ggc_alloc_cleared_cp_lexer ();
565 /* Initially we are not debugging. */
566 lexer->debugging_p = false;
568 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
569 CP_SAVED_TOKEN_STACK);
571 /* Create the buffer. */
572 lexer->buffer = VEC_alloc (cp_token, gc, CP_LEXER_BUFFER_SIZE);
578 /* Create a new main C++ lexer, the lexer that gets tokens from the
582 cp_lexer_new_main (void)
587 /* It's possible that parsing the first pragma will load a PCH file,
588 which is a GC collection point. So we have to do that before
589 allocating any memory. */
590 cp_parser_initial_pragma (&token);
592 lexer = cp_lexer_alloc ();
594 /* Put the first token in the buffer. */
595 VEC_quick_push (cp_token, lexer->buffer, &token);
597 /* Get the remaining tokens from the preprocessor. */
598 while (token.type != CPP_EOF)
600 cp_lexer_get_preprocessor_token (lexer, &token);
601 VEC_safe_push (cp_token, gc, lexer->buffer, &token);
604 lexer->last_token = VEC_address (cp_token, lexer->buffer)
605 + VEC_length (cp_token, lexer->buffer)
607 lexer->next_token = VEC_length (cp_token, lexer->buffer)
608 ? VEC_address (cp_token, lexer->buffer)
611 /* Subsequent preprocessor diagnostics should use compiler
612 diagnostic functions to get the compiler source location. */
615 gcc_assert (!lexer->next_token->purged_p);
619 /* Create a new lexer whose token stream is primed with the tokens in
620 CACHE. When these tokens are exhausted, no new tokens will be read. */
623 cp_lexer_new_from_tokens (cp_token_cache *cache)
625 cp_token *first = cache->first;
626 cp_token *last = cache->last;
627 cp_lexer *lexer = ggc_alloc_cleared_cp_lexer ();
629 /* We do not own the buffer. */
630 lexer->buffer = NULL;
631 lexer->next_token = first == last ? &eof_token : first;
632 lexer->last_token = last;
634 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
635 CP_SAVED_TOKEN_STACK);
637 /* Initially we are not debugging. */
638 lexer->debugging_p = false;
640 gcc_assert (!lexer->next_token->purged_p);
644 /* Frees all resources associated with LEXER. */
647 cp_lexer_destroy (cp_lexer *lexer)
649 VEC_free (cp_token, gc, lexer->buffer);
650 VEC_free (cp_token_position, heap, lexer->saved_tokens);
654 /* Returns nonzero if debugging information should be output. */
657 cp_lexer_debugging_p (cp_lexer *lexer)
659 return lexer->debugging_p;
663 static inline cp_token_position
664 cp_lexer_token_position (cp_lexer *lexer, bool previous_p)
666 gcc_assert (!previous_p || lexer->next_token != &eof_token);
668 return lexer->next_token - previous_p;
671 static inline cp_token *
672 cp_lexer_token_at (cp_lexer *lexer ATTRIBUTE_UNUSED, cp_token_position pos)
678 cp_lexer_set_token_position (cp_lexer *lexer, cp_token_position pos)
680 lexer->next_token = cp_lexer_token_at (lexer, pos);
683 static inline cp_token_position
684 cp_lexer_previous_token_position (cp_lexer *lexer)
686 if (lexer->next_token == &eof_token)
687 return lexer->last_token - 1;
689 return cp_lexer_token_position (lexer, true);
692 static inline cp_token *
693 cp_lexer_previous_token (cp_lexer *lexer)
695 cp_token_position tp = cp_lexer_previous_token_position (lexer);
697 return cp_lexer_token_at (lexer, tp);
700 /* nonzero if we are presently saving tokens. */
703 cp_lexer_saving_tokens (const cp_lexer* lexer)
705 return VEC_length (cp_token_position, lexer->saved_tokens) != 0;
708 /* Store the next token from the preprocessor in *TOKEN. Return true
709 if we reach EOF. If LEXER is NULL, assume we are handling an
710 initial #pragma pch_preprocess, and thus want the lexer to return
711 processed strings. */
714 cp_lexer_get_preprocessor_token (cp_lexer *lexer, cp_token *token)
716 static int is_extern_c = 0;
718 /* Get a new token from the preprocessor. */
720 = c_lex_with_flags (&token->u.value, &token->location, &token->flags,
721 lexer == NULL ? 0 : C_LEX_STRING_NO_JOIN);
722 token->keyword = RID_MAX;
723 token->pragma_kind = PRAGMA_NONE;
724 token->purged_p = false;
726 /* On some systems, some header files are surrounded by an
727 implicit extern "C" block. Set a flag in the token if it
728 comes from such a header. */
729 is_extern_c += pending_lang_change;
730 pending_lang_change = 0;
731 token->implicit_extern_c = is_extern_c > 0;
733 /* Check to see if this token is a keyword. */
734 if (token->type == CPP_NAME)
736 if (C_IS_RESERVED_WORD (token->u.value))
738 /* Mark this token as a keyword. */
739 token->type = CPP_KEYWORD;
740 /* Record which keyword. */
741 token->keyword = C_RID_CODE (token->u.value);
745 if (warn_cxx0x_compat
746 && C_RID_CODE (token->u.value) >= RID_FIRST_CXX0X
747 && C_RID_CODE (token->u.value) <= RID_LAST_CXX0X)
749 /* Warn about the C++0x keyword (but still treat it as
751 warning (OPT_Wc__0x_compat,
752 "identifier %qE is a keyword in C++11",
755 /* Clear out the C_RID_CODE so we don't warn about this
756 particular identifier-turned-keyword again. */
757 C_SET_RID_CODE (token->u.value, RID_MAX);
760 token->ambiguous_p = false;
761 token->keyword = RID_MAX;
764 else if (token->type == CPP_AT_NAME)
766 /* This only happens in Objective-C++; it must be a keyword. */
767 token->type = CPP_KEYWORD;
768 switch (C_RID_CODE (token->u.value))
770 /* Replace 'class' with '@class', 'private' with '@private',
771 etc. This prevents confusion with the C++ keyword
772 'class', and makes the tokens consistent with other
773 Objective-C 'AT' keywords. For example '@class' is
774 reported as RID_AT_CLASS which is consistent with
775 '@synchronized', which is reported as
778 case RID_CLASS: token->keyword = RID_AT_CLASS; break;
779 case RID_PRIVATE: token->keyword = RID_AT_PRIVATE; break;
780 case RID_PROTECTED: token->keyword = RID_AT_PROTECTED; break;
781 case RID_PUBLIC: token->keyword = RID_AT_PUBLIC; break;
782 case RID_THROW: token->keyword = RID_AT_THROW; break;
783 case RID_TRY: token->keyword = RID_AT_TRY; break;
784 case RID_CATCH: token->keyword = RID_AT_CATCH; break;
785 default: token->keyword = C_RID_CODE (token->u.value);
788 else if (token->type == CPP_PRAGMA)
790 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
791 token->pragma_kind = ((enum pragma_kind)
792 TREE_INT_CST_LOW (token->u.value));
793 token->u.value = NULL_TREE;
797 /* Update the globals input_location and the input file stack from TOKEN. */
799 cp_lexer_set_source_position_from_token (cp_token *token)
801 if (token->type != CPP_EOF)
803 input_location = token->location;
807 /* Return a pointer to the next token in the token stream, but do not
810 static inline cp_token *
811 cp_lexer_peek_token (cp_lexer *lexer)
813 if (cp_lexer_debugging_p (lexer))
815 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream);
816 cp_lexer_print_token (cp_lexer_debug_stream, lexer->next_token);
817 putc ('\n', cp_lexer_debug_stream);
819 return lexer->next_token;
822 /* Return true if the next token has the indicated TYPE. */
825 cp_lexer_next_token_is (cp_lexer* lexer, enum cpp_ttype type)
827 return cp_lexer_peek_token (lexer)->type == type;
830 /* Return true if the next token does not have the indicated TYPE. */
833 cp_lexer_next_token_is_not (cp_lexer* lexer, enum cpp_ttype type)
835 return !cp_lexer_next_token_is (lexer, type);
838 /* Return true if the next token is the indicated KEYWORD. */
841 cp_lexer_next_token_is_keyword (cp_lexer* lexer, enum rid keyword)
843 return cp_lexer_peek_token (lexer)->keyword == keyword;
846 /* Return true if the next token is not the indicated KEYWORD. */
849 cp_lexer_next_token_is_not_keyword (cp_lexer* lexer, enum rid keyword)
851 return cp_lexer_peek_token (lexer)->keyword != keyword;
854 /* Return true if the next token is a keyword for a decl-specifier. */
857 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer *lexer)
861 token = cp_lexer_peek_token (lexer);
862 switch (token->keyword)
864 /* auto specifier: storage-class-specifier in C++,
865 simple-type-specifier in C++0x. */
867 /* Storage classes. */
873 /* Elaborated type specifiers. */
879 /* Simple type specifiers. */
894 /* GNU extensions. */
897 /* C++0x extensions. */
899 case RID_UNDERLYING_TYPE:
907 /* Returns TRUE iff the token T begins a decltype type. */
910 token_is_decltype (cp_token *t)
912 return (t->keyword == RID_DECLTYPE
913 || t->type == CPP_DECLTYPE);
916 /* Returns TRUE iff the next token begins a decltype type. */
919 cp_lexer_next_token_is_decltype (cp_lexer *lexer)
921 cp_token *t = cp_lexer_peek_token (lexer);
922 return token_is_decltype (t);
925 /* Return a pointer to the Nth token in the token stream. If N is 1,
926 then this is precisely equivalent to cp_lexer_peek_token (except
927 that it is not inline). One would like to disallow that case, but
928 there is one case (cp_parser_nth_token_starts_template_id) where
929 the caller passes a variable for N and it might be 1. */
932 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
936 /* N is 1-based, not zero-based. */
939 if (cp_lexer_debugging_p (lexer))
940 fprintf (cp_lexer_debug_stream,
941 "cp_lexer: peeking ahead %ld at token: ", (long)n);
944 token = lexer->next_token;
945 gcc_assert (!n || token != &eof_token);
949 if (token == lexer->last_token)
955 if (!token->purged_p)
959 if (cp_lexer_debugging_p (lexer))
961 cp_lexer_print_token (cp_lexer_debug_stream, token);
962 putc ('\n', cp_lexer_debug_stream);
968 /* Return the next token, and advance the lexer's next_token pointer
969 to point to the next non-purged token. */
972 cp_lexer_consume_token (cp_lexer* lexer)
974 cp_token *token = lexer->next_token;
976 gcc_assert (token != &eof_token);
977 gcc_assert (!lexer->in_pragma || token->type != CPP_PRAGMA_EOL);
982 if (lexer->next_token == lexer->last_token)
984 lexer->next_token = &eof_token;
989 while (lexer->next_token->purged_p);
991 cp_lexer_set_source_position_from_token (token);
993 /* Provide debugging output. */
994 if (cp_lexer_debugging_p (lexer))
996 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
997 cp_lexer_print_token (cp_lexer_debug_stream, token);
998 putc ('\n', cp_lexer_debug_stream);
1004 /* Permanently remove the next token from the token stream, and
1005 advance the next_token pointer to refer to the next non-purged
1009 cp_lexer_purge_token (cp_lexer *lexer)
1011 cp_token *tok = lexer->next_token;
1013 gcc_assert (tok != &eof_token);
1014 tok->purged_p = true;
1015 tok->location = UNKNOWN_LOCATION;
1016 tok->u.value = NULL_TREE;
1017 tok->keyword = RID_MAX;
1022 if (tok == lexer->last_token)
1028 while (tok->purged_p);
1029 lexer->next_token = tok;
1032 /* Permanently remove all tokens after TOK, up to, but not
1033 including, the token that will be returned next by
1034 cp_lexer_peek_token. */
1037 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
1039 cp_token *peek = lexer->next_token;
1041 if (peek == &eof_token)
1042 peek = lexer->last_token;
1044 gcc_assert (tok < peek);
1046 for ( tok += 1; tok != peek; tok += 1)
1048 tok->purged_p = true;
1049 tok->location = UNKNOWN_LOCATION;
1050 tok->u.value = NULL_TREE;
1051 tok->keyword = RID_MAX;
1055 /* Begin saving tokens. All tokens consumed after this point will be
1059 cp_lexer_save_tokens (cp_lexer* lexer)
1061 /* Provide debugging output. */
1062 if (cp_lexer_debugging_p (lexer))
1063 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
1065 VEC_safe_push (cp_token_position, heap,
1066 lexer->saved_tokens, lexer->next_token);
1069 /* Commit to the portion of the token stream most recently saved. */
1072 cp_lexer_commit_tokens (cp_lexer* lexer)
1074 /* Provide debugging output. */
1075 if (cp_lexer_debugging_p (lexer))
1076 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
1078 VEC_pop (cp_token_position, lexer->saved_tokens);
1081 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1082 to the token stream. Stop saving tokens. */
1085 cp_lexer_rollback_tokens (cp_lexer* lexer)
1087 /* Provide debugging output. */
1088 if (cp_lexer_debugging_p (lexer))
1089 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
1091 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
1094 /* Print a representation of the TOKEN on the STREAM. */
1097 cp_lexer_print_token (FILE * stream, cp_token *token)
1099 /* We don't use cpp_type2name here because the parser defines
1100 a few tokens of its own. */
1101 static const char *const token_names[] = {
1102 /* cpplib-defined token types */
1103 #define OP(e, s) #e,
1104 #define TK(e, s) #e,
1108 /* C++ parser token types - see "Manifest constants", above. */
1111 "NESTED_NAME_SPECIFIER",
1114 /* For some tokens, print the associated data. */
1115 switch (token->type)
1118 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1119 For example, `struct' is mapped to an INTEGER_CST. */
1120 if (TREE_CODE (token->u.value) != IDENTIFIER_NODE)
1122 /* else fall through */
1124 fputs (IDENTIFIER_POINTER (token->u.value), stream);
1131 case CPP_UTF8STRING:
1132 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->u.value));
1136 print_generic_expr (stream, token->u.value, 0);
1140 /* If we have a name for the token, print it out. Otherwise, we
1141 simply give the numeric code. */
1142 if (token->type < ARRAY_SIZE(token_names))
1143 fputs (token_names[token->type], stream);
1145 fprintf (stream, "[%d]", token->type);
1150 /* Start emitting debugging information. */
1153 cp_lexer_start_debugging (cp_lexer* lexer)
1155 lexer->debugging_p = true;
1156 cp_lexer_debug_stream = stderr;
1159 /* Stop emitting debugging information. */
1162 cp_lexer_stop_debugging (cp_lexer* lexer)
1164 lexer->debugging_p = false;
1165 cp_lexer_debug_stream = NULL;
1168 /* Create a new cp_token_cache, representing a range of tokens. */
1170 static cp_token_cache *
1171 cp_token_cache_new (cp_token *first, cp_token *last)
1173 cp_token_cache *cache = ggc_alloc_cp_token_cache ();
1174 cache->first = first;
1180 /* Decl-specifiers. */
1182 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1185 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
1187 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
1192 /* Nothing other than the parser should be creating declarators;
1193 declarators are a semi-syntactic representation of C++ entities.
1194 Other parts of the front end that need to create entities (like
1195 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1197 static cp_declarator *make_call_declarator
1198 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, tree, tree);
1199 static cp_declarator *make_array_declarator
1200 (cp_declarator *, tree);
1201 static cp_declarator *make_pointer_declarator
1202 (cp_cv_quals, cp_declarator *);
1203 static cp_declarator *make_reference_declarator
1204 (cp_cv_quals, cp_declarator *, bool);
1205 static cp_parameter_declarator *make_parameter_declarator
1206 (cp_decl_specifier_seq *, cp_declarator *, tree);
1207 static cp_declarator *make_ptrmem_declarator
1208 (cp_cv_quals, tree, cp_declarator *);
1210 /* An erroneous declarator. */
1211 static cp_declarator *cp_error_declarator;
1213 /* The obstack on which declarators and related data structures are
1215 static struct obstack declarator_obstack;
1217 /* Alloc BYTES from the declarator memory pool. */
1219 static inline void *
1220 alloc_declarator (size_t bytes)
1222 return obstack_alloc (&declarator_obstack, bytes);
1225 /* Allocate a declarator of the indicated KIND. Clear fields that are
1226 common to all declarators. */
1228 static cp_declarator *
1229 make_declarator (cp_declarator_kind kind)
1231 cp_declarator *declarator;
1233 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
1234 declarator->kind = kind;
1235 declarator->attributes = NULL_TREE;
1236 declarator->declarator = NULL;
1237 declarator->parameter_pack_p = false;
1238 declarator->id_loc = UNKNOWN_LOCATION;
1243 /* Make a declarator for a generalized identifier. If
1244 QUALIFYING_SCOPE is non-NULL, the identifier is
1245 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1246 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1249 static cp_declarator *
1250 make_id_declarator (tree qualifying_scope, tree unqualified_name,
1251 special_function_kind sfk)
1253 cp_declarator *declarator;
1255 /* It is valid to write:
1257 class C { void f(); };
1261 The standard is not clear about whether `typedef const C D' is
1262 legal; as of 2002-09-15 the committee is considering that
1263 question. EDG 3.0 allows that syntax. Therefore, we do as
1265 if (qualifying_scope && TYPE_P (qualifying_scope))
1266 qualifying_scope = TYPE_MAIN_VARIANT (qualifying_scope);
1268 gcc_assert (TREE_CODE (unqualified_name) == IDENTIFIER_NODE
1269 || TREE_CODE (unqualified_name) == BIT_NOT_EXPR
1270 || TREE_CODE (unqualified_name) == TEMPLATE_ID_EXPR);
1272 declarator = make_declarator (cdk_id);
1273 declarator->u.id.qualifying_scope = qualifying_scope;
1274 declarator->u.id.unqualified_name = unqualified_name;
1275 declarator->u.id.sfk = sfk;
1280 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1281 of modifiers such as const or volatile to apply to the pointer
1282 type, represented as identifiers. */
1285 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
1287 cp_declarator *declarator;
1289 declarator = make_declarator (cdk_pointer);
1290 declarator->declarator = target;
1291 declarator->u.pointer.qualifiers = cv_qualifiers;
1292 declarator->u.pointer.class_type = NULL_TREE;
1295 declarator->id_loc = target->id_loc;
1296 declarator->parameter_pack_p = target->parameter_pack_p;
1297 target->parameter_pack_p = false;
1300 declarator->parameter_pack_p = false;
1305 /* Like make_pointer_declarator -- but for references. */
1308 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target,
1311 cp_declarator *declarator;
1313 declarator = make_declarator (cdk_reference);
1314 declarator->declarator = target;
1315 declarator->u.reference.qualifiers = cv_qualifiers;
1316 declarator->u.reference.rvalue_ref = rvalue_ref;
1319 declarator->id_loc = target->id_loc;
1320 declarator->parameter_pack_p = target->parameter_pack_p;
1321 target->parameter_pack_p = false;
1324 declarator->parameter_pack_p = false;
1329 /* Like make_pointer_declarator -- but for a pointer to a non-static
1330 member of CLASS_TYPE. */
1333 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
1334 cp_declarator *pointee)
1336 cp_declarator *declarator;
1338 declarator = make_declarator (cdk_ptrmem);
1339 declarator->declarator = pointee;
1340 declarator->u.pointer.qualifiers = cv_qualifiers;
1341 declarator->u.pointer.class_type = class_type;
1345 declarator->parameter_pack_p = pointee->parameter_pack_p;
1346 pointee->parameter_pack_p = false;
1349 declarator->parameter_pack_p = false;
1354 /* Make a declarator for the function given by TARGET, with the
1355 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1356 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1357 indicates what exceptions can be thrown. */
1360 make_call_declarator (cp_declarator *target,
1362 cp_cv_quals cv_qualifiers,
1363 cp_virt_specifiers virt_specifiers,
1364 tree exception_specification,
1365 tree late_return_type)
1367 cp_declarator *declarator;
1369 declarator = make_declarator (cdk_function);
1370 declarator->declarator = target;
1371 declarator->u.function.parameters = parms;
1372 declarator->u.function.qualifiers = cv_qualifiers;
1373 declarator->u.function.virt_specifiers = virt_specifiers;
1374 declarator->u.function.exception_specification = exception_specification;
1375 declarator->u.function.late_return_type = late_return_type;
1378 declarator->id_loc = target->id_loc;
1379 declarator->parameter_pack_p = target->parameter_pack_p;
1380 target->parameter_pack_p = false;
1383 declarator->parameter_pack_p = false;
1388 /* Make a declarator for an array of BOUNDS elements, each of which is
1389 defined by ELEMENT. */
1392 make_array_declarator (cp_declarator *element, tree bounds)
1394 cp_declarator *declarator;
1396 declarator = make_declarator (cdk_array);
1397 declarator->declarator = element;
1398 declarator->u.array.bounds = bounds;
1401 declarator->id_loc = element->id_loc;
1402 declarator->parameter_pack_p = element->parameter_pack_p;
1403 element->parameter_pack_p = false;
1406 declarator->parameter_pack_p = false;
1411 /* Determine whether the declarator we've seen so far can be a
1412 parameter pack, when followed by an ellipsis. */
1414 declarator_can_be_parameter_pack (cp_declarator *declarator)
1416 /* Search for a declarator name, or any other declarator that goes
1417 after the point where the ellipsis could appear in a parameter
1418 pack. If we find any of these, then this declarator can not be
1419 made into a parameter pack. */
1421 while (declarator && !found)
1423 switch ((int)declarator->kind)
1434 declarator = declarator->declarator;
1442 cp_parameter_declarator *no_parameters;
1444 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1445 DECLARATOR and DEFAULT_ARGUMENT. */
1447 cp_parameter_declarator *
1448 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
1449 cp_declarator *declarator,
1450 tree default_argument)
1452 cp_parameter_declarator *parameter;
1454 parameter = ((cp_parameter_declarator *)
1455 alloc_declarator (sizeof (cp_parameter_declarator)));
1456 parameter->next = NULL;
1457 if (decl_specifiers)
1458 parameter->decl_specifiers = *decl_specifiers;
1460 clear_decl_specs (¶meter->decl_specifiers);
1461 parameter->declarator = declarator;
1462 parameter->default_argument = default_argument;
1463 parameter->ellipsis_p = false;
1468 /* Returns true iff DECLARATOR is a declaration for a function. */
1471 function_declarator_p (const cp_declarator *declarator)
1475 if (declarator->kind == cdk_function
1476 && declarator->declarator->kind == cdk_id)
1478 if (declarator->kind == cdk_id
1479 || declarator->kind == cdk_error)
1481 declarator = declarator->declarator;
1491 A cp_parser parses the token stream as specified by the C++
1492 grammar. Its job is purely parsing, not semantic analysis. For
1493 example, the parser breaks the token stream into declarators,
1494 expressions, statements, and other similar syntactic constructs.
1495 It does not check that the types of the expressions on either side
1496 of an assignment-statement are compatible, or that a function is
1497 not declared with a parameter of type `void'.
1499 The parser invokes routines elsewhere in the compiler to perform
1500 semantic analysis and to build up the abstract syntax tree for the
1503 The parser (and the template instantiation code, which is, in a
1504 way, a close relative of parsing) are the only parts of the
1505 compiler that should be calling push_scope and pop_scope, or
1506 related functions. The parser (and template instantiation code)
1507 keeps track of what scope is presently active; everything else
1508 should simply honor that. (The code that generates static
1509 initializers may also need to set the scope, in order to check
1510 access control correctly when emitting the initializers.)
1515 The parser is of the standard recursive-descent variety. Upcoming
1516 tokens in the token stream are examined in order to determine which
1517 production to use when parsing a non-terminal. Some C++ constructs
1518 require arbitrary look ahead to disambiguate. For example, it is
1519 impossible, in the general case, to tell whether a statement is an
1520 expression or declaration without scanning the entire statement.
1521 Therefore, the parser is capable of "parsing tentatively." When the
1522 parser is not sure what construct comes next, it enters this mode.
1523 Then, while we attempt to parse the construct, the parser queues up
1524 error messages, rather than issuing them immediately, and saves the
1525 tokens it consumes. If the construct is parsed successfully, the
1526 parser "commits", i.e., it issues any queued error messages and
1527 the tokens that were being preserved are permanently discarded.
1528 If, however, the construct is not parsed successfully, the parser
1529 rolls back its state completely so that it can resume parsing using
1530 a different alternative.
1535 The performance of the parser could probably be improved substantially.
1536 We could often eliminate the need to parse tentatively by looking ahead
1537 a little bit. In some places, this approach might not entirely eliminate
1538 the need to parse tentatively, but it might still speed up the average
1541 /* Flags that are passed to some parsing functions. These values can
1542 be bitwise-ored together. */
1547 CP_PARSER_FLAGS_NONE = 0x0,
1548 /* The construct is optional. If it is not present, then no error
1549 should be issued. */
1550 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1551 /* When parsing a type-specifier, treat user-defined type-names
1552 as non-type identifiers. */
1553 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2,
1554 /* When parsing a type-specifier, do not try to parse a class-specifier
1555 or enum-specifier. */
1556 CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS = 0x4,
1557 /* When parsing a decl-specifier-seq, only allow type-specifier or
1559 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR = 0x8
1562 /* This type is used for parameters and variables which hold
1563 combinations of the above flags. */
1564 typedef int cp_parser_flags;
1566 /* The different kinds of declarators we want to parse. */
1568 typedef enum cp_parser_declarator_kind
1570 /* We want an abstract declarator. */
1571 CP_PARSER_DECLARATOR_ABSTRACT,
1572 /* We want a named declarator. */
1573 CP_PARSER_DECLARATOR_NAMED,
1574 /* We don't mind, but the name must be an unqualified-id. */
1575 CP_PARSER_DECLARATOR_EITHER
1576 } cp_parser_declarator_kind;
1578 /* The precedence values used to parse binary expressions. The minimum value
1579 of PREC must be 1, because zero is reserved to quickly discriminate
1580 binary operators from other tokens. */
1585 PREC_LOGICAL_OR_EXPRESSION,
1586 PREC_LOGICAL_AND_EXPRESSION,
1587 PREC_INCLUSIVE_OR_EXPRESSION,
1588 PREC_EXCLUSIVE_OR_EXPRESSION,
1589 PREC_AND_EXPRESSION,
1590 PREC_EQUALITY_EXPRESSION,
1591 PREC_RELATIONAL_EXPRESSION,
1592 PREC_SHIFT_EXPRESSION,
1593 PREC_ADDITIVE_EXPRESSION,
1594 PREC_MULTIPLICATIVE_EXPRESSION,
1596 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1599 /* A mapping from a token type to a corresponding tree node type, with a
1600 precedence value. */
1602 typedef struct cp_parser_binary_operations_map_node
1604 /* The token type. */
1605 enum cpp_ttype token_type;
1606 /* The corresponding tree code. */
1607 enum tree_code tree_type;
1608 /* The precedence of this operator. */
1609 enum cp_parser_prec prec;
1610 } cp_parser_binary_operations_map_node;
1612 typedef struct cp_parser_expression_stack_entry
1614 /* Left hand side of the binary operation we are currently
1617 /* Original tree code for left hand side, if it was a binary
1618 expression itself (used for -Wparentheses). */
1619 enum tree_code lhs_type;
1620 /* Tree code for the binary operation we are parsing. */
1621 enum tree_code tree_type;
1622 /* Precedence of the binary operation we are parsing. */
1623 enum cp_parser_prec prec;
1624 } cp_parser_expression_stack_entry;
1626 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1627 entries because precedence levels on the stack are monotonically
1629 typedef struct cp_parser_expression_stack_entry
1630 cp_parser_expression_stack[NUM_PREC_VALUES];
1634 /* Constructors and destructors. */
1636 static cp_parser_context *cp_parser_context_new
1637 (cp_parser_context *);
1639 /* Class variables. */
1641 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1643 /* The operator-precedence table used by cp_parser_binary_expression.
1644 Transformed into an associative array (binops_by_token) by
1647 static const cp_parser_binary_operations_map_node binops[] = {
1648 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1649 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1651 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1652 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1653 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1655 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1656 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1658 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1659 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1661 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1662 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1663 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1664 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1666 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1667 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1669 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1671 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1673 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1675 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1677 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1680 /* The same as binops, but initialized by cp_parser_new so that
1681 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1683 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1685 /* Constructors and destructors. */
1687 /* Construct a new context. The context below this one on the stack
1688 is given by NEXT. */
1690 static cp_parser_context *
1691 cp_parser_context_new (cp_parser_context* next)
1693 cp_parser_context *context;
1695 /* Allocate the storage. */
1696 if (cp_parser_context_free_list != NULL)
1698 /* Pull the first entry from the free list. */
1699 context = cp_parser_context_free_list;
1700 cp_parser_context_free_list = context->next;
1701 memset (context, 0, sizeof (*context));
1704 context = ggc_alloc_cleared_cp_parser_context ();
1706 /* No errors have occurred yet in this context. */
1707 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1708 /* If this is not the bottommost context, copy information that we
1709 need from the previous context. */
1712 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1713 expression, then we are parsing one in this context, too. */
1714 context->object_type = next->object_type;
1715 /* Thread the stack. */
1716 context->next = next;
1722 /* Managing the unparsed function queues. */
1724 #define unparsed_funs_with_default_args \
1725 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_default_args
1726 #define unparsed_funs_with_definitions \
1727 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_definitions
1728 #define unparsed_nsdmis \
1729 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->nsdmis
1732 push_unparsed_function_queues (cp_parser *parser)
1734 VEC_safe_push (cp_unparsed_functions_entry, gc,
1735 parser->unparsed_queues, NULL);
1736 unparsed_funs_with_default_args = NULL;
1737 unparsed_funs_with_definitions = make_tree_vector ();
1738 unparsed_nsdmis = NULL;
1742 pop_unparsed_function_queues (cp_parser *parser)
1744 release_tree_vector (unparsed_funs_with_definitions);
1745 VEC_pop (cp_unparsed_functions_entry, parser->unparsed_queues);
1750 /* Constructors and destructors. */
1752 static cp_parser *cp_parser_new
1755 /* Routines to parse various constructs.
1757 Those that return `tree' will return the error_mark_node (rather
1758 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1759 Sometimes, they will return an ordinary node if error-recovery was
1760 attempted, even though a parse error occurred. So, to check
1761 whether or not a parse error occurred, you should always use
1762 cp_parser_error_occurred. If the construct is optional (indicated
1763 either by an `_opt' in the name of the function that does the
1764 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1765 the construct is not present. */
1767 /* Lexical conventions [gram.lex] */
1769 static tree cp_parser_identifier
1771 static tree cp_parser_string_literal
1772 (cp_parser *, bool, bool);
1773 static tree cp_parser_userdef_char_literal
1775 static tree cp_parser_userdef_string_literal
1777 static tree cp_parser_userdef_numeric_literal
1780 /* Basic concepts [gram.basic] */
1782 static bool cp_parser_translation_unit
1785 /* Expressions [gram.expr] */
1787 static tree cp_parser_primary_expression
1788 (cp_parser *, bool, bool, bool, cp_id_kind *);
1789 static tree cp_parser_id_expression
1790 (cp_parser *, bool, bool, bool *, bool, bool);
1791 static tree cp_parser_unqualified_id
1792 (cp_parser *, bool, bool, bool, bool);
1793 static tree cp_parser_nested_name_specifier_opt
1794 (cp_parser *, bool, bool, bool, bool);
1795 static tree cp_parser_nested_name_specifier
1796 (cp_parser *, bool, bool, bool, bool);
1797 static tree cp_parser_qualifying_entity
1798 (cp_parser *, bool, bool, bool, bool, bool);
1799 static tree cp_parser_postfix_expression
1800 (cp_parser *, bool, bool, bool, cp_id_kind *);
1801 static tree cp_parser_postfix_open_square_expression
1802 (cp_parser *, tree, bool);
1803 static tree cp_parser_postfix_dot_deref_expression
1804 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *, location_t);
1805 static VEC(tree,gc) *cp_parser_parenthesized_expression_list
1806 (cp_parser *, int, bool, bool, bool *);
1807 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1808 enum { non_attr = 0, normal_attr = 1, id_attr = 2 };
1809 static void cp_parser_pseudo_destructor_name
1810 (cp_parser *, tree *, tree *);
1811 static tree cp_parser_unary_expression
1812 (cp_parser *, bool, bool, cp_id_kind *);
1813 static enum tree_code cp_parser_unary_operator
1815 static tree cp_parser_new_expression
1817 static VEC(tree,gc) *cp_parser_new_placement
1819 static tree cp_parser_new_type_id
1820 (cp_parser *, tree *);
1821 static cp_declarator *cp_parser_new_declarator_opt
1823 static cp_declarator *cp_parser_direct_new_declarator
1825 static VEC(tree,gc) *cp_parser_new_initializer
1827 static tree cp_parser_delete_expression
1829 static tree cp_parser_cast_expression
1830 (cp_parser *, bool, bool, cp_id_kind *);
1831 static tree cp_parser_binary_expression
1832 (cp_parser *, bool, bool, enum cp_parser_prec, cp_id_kind *);
1833 static tree cp_parser_question_colon_clause
1834 (cp_parser *, tree);
1835 static tree cp_parser_assignment_expression
1836 (cp_parser *, bool, cp_id_kind *);
1837 static enum tree_code cp_parser_assignment_operator_opt
1839 static tree cp_parser_expression
1840 (cp_parser *, bool, cp_id_kind *);
1841 static tree cp_parser_constant_expression
1842 (cp_parser *, bool, bool *);
1843 static tree cp_parser_builtin_offsetof
1845 static tree cp_parser_lambda_expression
1847 static void cp_parser_lambda_introducer
1848 (cp_parser *, tree);
1849 static bool cp_parser_lambda_declarator_opt
1850 (cp_parser *, tree);
1851 static void cp_parser_lambda_body
1852 (cp_parser *, tree);
1854 /* Statements [gram.stmt.stmt] */
1856 static void cp_parser_statement
1857 (cp_parser *, tree, bool, bool *);
1858 static void cp_parser_label_for_labeled_statement
1860 static tree cp_parser_expression_statement
1861 (cp_parser *, tree);
1862 static tree cp_parser_compound_statement
1863 (cp_parser *, tree, bool, bool);
1864 static void cp_parser_statement_seq_opt
1865 (cp_parser *, tree);
1866 static tree cp_parser_selection_statement
1867 (cp_parser *, bool *);
1868 static tree cp_parser_condition
1870 static tree cp_parser_iteration_statement
1872 static bool cp_parser_for_init_statement
1873 (cp_parser *, tree *decl);
1874 static tree cp_parser_for
1876 static tree cp_parser_c_for
1877 (cp_parser *, tree, tree);
1878 static tree cp_parser_range_for
1879 (cp_parser *, tree, tree, tree);
1880 static void do_range_for_auto_deduction
1882 static tree cp_parser_perform_range_for_lookup
1883 (tree, tree *, tree *);
1884 static tree cp_parser_range_for_member_function
1886 static tree cp_parser_jump_statement
1888 static void cp_parser_declaration_statement
1891 static tree cp_parser_implicitly_scoped_statement
1892 (cp_parser *, bool *);
1893 static void cp_parser_already_scoped_statement
1896 /* Declarations [gram.dcl.dcl] */
1898 static void cp_parser_declaration_seq_opt
1900 static void cp_parser_declaration
1902 static void cp_parser_block_declaration
1903 (cp_parser *, bool);
1904 static void cp_parser_simple_declaration
1905 (cp_parser *, bool, tree *);
1906 static void cp_parser_decl_specifier_seq
1907 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1908 static tree cp_parser_storage_class_specifier_opt
1910 static tree cp_parser_function_specifier_opt
1911 (cp_parser *, cp_decl_specifier_seq *);
1912 static tree cp_parser_type_specifier
1913 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1915 static tree cp_parser_simple_type_specifier
1916 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1917 static tree cp_parser_type_name
1919 static tree cp_parser_nonclass_name
1920 (cp_parser* parser);
1921 static tree cp_parser_elaborated_type_specifier
1922 (cp_parser *, bool, bool);
1923 static tree cp_parser_enum_specifier
1925 static void cp_parser_enumerator_list
1926 (cp_parser *, tree);
1927 static void cp_parser_enumerator_definition
1928 (cp_parser *, tree);
1929 static tree cp_parser_namespace_name
1931 static void cp_parser_namespace_definition
1933 static void cp_parser_namespace_body
1935 static tree cp_parser_qualified_namespace_specifier
1937 static void cp_parser_namespace_alias_definition
1939 static bool cp_parser_using_declaration
1940 (cp_parser *, bool);
1941 static void cp_parser_using_directive
1943 static tree cp_parser_alias_declaration
1945 static void cp_parser_asm_definition
1947 static void cp_parser_linkage_specification
1949 static void cp_parser_static_assert
1950 (cp_parser *, bool);
1951 static tree cp_parser_decltype
1954 /* Declarators [gram.dcl.decl] */
1956 static tree cp_parser_init_declarator
1957 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *, tree *);
1958 static cp_declarator *cp_parser_declarator
1959 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1960 static cp_declarator *cp_parser_direct_declarator
1961 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1962 static enum tree_code cp_parser_ptr_operator
1963 (cp_parser *, tree *, cp_cv_quals *);
1964 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1966 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1968 static tree cp_parser_late_return_type_opt
1969 (cp_parser *, cp_cv_quals);
1970 static tree cp_parser_declarator_id
1971 (cp_parser *, bool);
1972 static tree cp_parser_type_id
1974 static tree cp_parser_template_type_arg
1976 static tree cp_parser_trailing_type_id (cp_parser *);
1977 static tree cp_parser_type_id_1
1978 (cp_parser *, bool, bool);
1979 static void cp_parser_type_specifier_seq
1980 (cp_parser *, bool, bool, cp_decl_specifier_seq *);
1981 static tree cp_parser_parameter_declaration_clause
1983 static tree cp_parser_parameter_declaration_list
1984 (cp_parser *, bool *);
1985 static cp_parameter_declarator *cp_parser_parameter_declaration
1986 (cp_parser *, bool, bool *);
1987 static tree cp_parser_default_argument
1988 (cp_parser *, bool);
1989 static void cp_parser_function_body
1991 static tree cp_parser_initializer
1992 (cp_parser *, bool *, bool *);
1993 static tree cp_parser_initializer_clause
1994 (cp_parser *, bool *);
1995 static tree cp_parser_braced_list
1996 (cp_parser*, bool*);
1997 static VEC(constructor_elt,gc) *cp_parser_initializer_list
1998 (cp_parser *, bool *);
2000 static bool cp_parser_ctor_initializer_opt_and_function_body
2003 /* Classes [gram.class] */
2005 static tree cp_parser_class_name
2006 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
2007 static tree cp_parser_class_specifier
2009 static tree cp_parser_class_head
2010 (cp_parser *, bool *, tree *, tree *);
2011 static enum tag_types cp_parser_class_key
2013 static void cp_parser_member_specification_opt
2015 static void cp_parser_member_declaration
2017 static tree cp_parser_pure_specifier
2019 static tree cp_parser_constant_initializer
2022 /* Derived classes [gram.class.derived] */
2024 static tree cp_parser_base_clause
2026 static tree cp_parser_base_specifier
2029 /* Special member functions [gram.special] */
2031 static tree cp_parser_conversion_function_id
2033 static tree cp_parser_conversion_type_id
2035 static cp_declarator *cp_parser_conversion_declarator_opt
2037 static bool cp_parser_ctor_initializer_opt
2039 static void cp_parser_mem_initializer_list
2041 static tree cp_parser_mem_initializer
2043 static tree cp_parser_mem_initializer_id
2046 /* Overloading [gram.over] */
2048 static tree cp_parser_operator_function_id
2050 static tree cp_parser_operator
2053 /* Templates [gram.temp] */
2055 static void cp_parser_template_declaration
2056 (cp_parser *, bool);
2057 static tree cp_parser_template_parameter_list
2059 static tree cp_parser_template_parameter
2060 (cp_parser *, bool *, bool *);
2061 static tree cp_parser_type_parameter
2062 (cp_parser *, bool *);
2063 static tree cp_parser_template_id
2064 (cp_parser *, bool, bool, bool);
2065 static tree cp_parser_template_name
2066 (cp_parser *, bool, bool, bool, bool *);
2067 static tree cp_parser_template_argument_list
2069 static tree cp_parser_template_argument
2071 static void cp_parser_explicit_instantiation
2073 static void cp_parser_explicit_specialization
2076 /* Exception handling [gram.exception] */
2078 static tree cp_parser_try_block
2080 static bool cp_parser_function_try_block
2082 static void cp_parser_handler_seq
2084 static void cp_parser_handler
2086 static tree cp_parser_exception_declaration
2088 static tree cp_parser_throw_expression
2090 static tree cp_parser_exception_specification_opt
2092 static tree cp_parser_type_id_list
2095 /* GNU Extensions */
2097 static tree cp_parser_asm_specification_opt
2099 static tree cp_parser_asm_operand_list
2101 static tree cp_parser_asm_clobber_list
2103 static tree cp_parser_asm_label_list
2105 static tree cp_parser_attributes_opt
2107 static tree cp_parser_attribute_list
2109 static bool cp_parser_extension_opt
2110 (cp_parser *, int *);
2111 static void cp_parser_label_declaration
2114 /* Transactional Memory Extensions */
2116 static tree cp_parser_transaction
2117 (cp_parser *, enum rid);
2118 static tree cp_parser_transaction_expression
2119 (cp_parser *, enum rid);
2120 static bool cp_parser_function_transaction
2121 (cp_parser *, enum rid);
2122 static tree cp_parser_transaction_cancel
2125 enum pragma_context { pragma_external, pragma_stmt, pragma_compound };
2126 static bool cp_parser_pragma
2127 (cp_parser *, enum pragma_context);
2129 /* Objective-C++ Productions */
2131 static tree cp_parser_objc_message_receiver
2133 static tree cp_parser_objc_message_args
2135 static tree cp_parser_objc_message_expression
2137 static tree cp_parser_objc_encode_expression
2139 static tree cp_parser_objc_defs_expression
2141 static tree cp_parser_objc_protocol_expression
2143 static tree cp_parser_objc_selector_expression
2145 static tree cp_parser_objc_expression
2147 static bool cp_parser_objc_selector_p
2149 static tree cp_parser_objc_selector
2151 static tree cp_parser_objc_protocol_refs_opt
2153 static void cp_parser_objc_declaration
2154 (cp_parser *, tree);
2155 static tree cp_parser_objc_statement
2157 static bool cp_parser_objc_valid_prefix_attributes
2158 (cp_parser *, tree *);
2159 static void cp_parser_objc_at_property_declaration
2161 static void cp_parser_objc_at_synthesize_declaration
2163 static void cp_parser_objc_at_dynamic_declaration
2165 static tree cp_parser_objc_struct_declaration
2168 /* Utility Routines */
2170 static tree cp_parser_lookup_name
2171 (cp_parser *, tree, enum tag_types, bool, bool, bool, tree *, location_t);
2172 static tree cp_parser_lookup_name_simple
2173 (cp_parser *, tree, location_t);
2174 static tree cp_parser_maybe_treat_template_as_class
2176 static bool cp_parser_check_declarator_template_parameters
2177 (cp_parser *, cp_declarator *, location_t);
2178 static bool cp_parser_check_template_parameters
2179 (cp_parser *, unsigned, location_t, cp_declarator *);
2180 static tree cp_parser_simple_cast_expression
2182 static tree cp_parser_global_scope_opt
2183 (cp_parser *, bool);
2184 static bool cp_parser_constructor_declarator_p
2185 (cp_parser *, bool);
2186 static tree cp_parser_function_definition_from_specifiers_and_declarator
2187 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
2188 static tree cp_parser_function_definition_after_declarator
2189 (cp_parser *, bool);
2190 static void cp_parser_template_declaration_after_export
2191 (cp_parser *, bool);
2192 static void cp_parser_perform_template_parameter_access_checks
2193 (VEC (deferred_access_check,gc)*);
2194 static tree cp_parser_single_declaration
2195 (cp_parser *, VEC (deferred_access_check,gc)*, bool, bool, bool *);
2196 static tree cp_parser_functional_cast
2197 (cp_parser *, tree);
2198 static tree cp_parser_save_member_function_body
2199 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
2200 static tree cp_parser_save_nsdmi
2202 static tree cp_parser_enclosed_template_argument_list
2204 static void cp_parser_save_default_args
2205 (cp_parser *, tree);
2206 static void cp_parser_late_parsing_for_member
2207 (cp_parser *, tree);
2208 static tree cp_parser_late_parse_one_default_arg
2209 (cp_parser *, tree, tree, tree);
2210 static void cp_parser_late_parsing_nsdmi
2211 (cp_parser *, tree);
2212 static void cp_parser_late_parsing_default_args
2213 (cp_parser *, tree);
2214 static tree cp_parser_sizeof_operand
2215 (cp_parser *, enum rid);
2216 static tree cp_parser_trait_expr
2217 (cp_parser *, enum rid);
2218 static bool cp_parser_declares_only_class_p
2220 static void cp_parser_set_storage_class
2221 (cp_parser *, cp_decl_specifier_seq *, enum rid, location_t);
2222 static void cp_parser_set_decl_spec_type
2223 (cp_decl_specifier_seq *, tree, location_t, bool);
2224 static bool cp_parser_friend_p
2225 (const cp_decl_specifier_seq *);
2226 static void cp_parser_required_error
2227 (cp_parser *, required_token, bool);
2228 static cp_token *cp_parser_require
2229 (cp_parser *, enum cpp_ttype, required_token);
2230 static cp_token *cp_parser_require_keyword
2231 (cp_parser *, enum rid, required_token);
2232 static bool cp_parser_token_starts_function_definition_p
2234 static bool cp_parser_next_token_starts_class_definition_p
2236 static bool cp_parser_next_token_ends_template_argument_p
2238 static bool cp_parser_nth_token_starts_template_argument_list_p
2239 (cp_parser *, size_t);
2240 static enum tag_types cp_parser_token_is_class_key
2242 static void cp_parser_check_class_key
2243 (enum tag_types, tree type);
2244 static void cp_parser_check_access_in_redeclaration
2245 (tree type, location_t location);
2246 static bool cp_parser_optional_template_keyword
2248 static void cp_parser_pre_parsed_nested_name_specifier
2250 static bool cp_parser_cache_group
2251 (cp_parser *, enum cpp_ttype, unsigned);
2252 static void cp_parser_parse_tentatively
2254 static void cp_parser_commit_to_tentative_parse
2256 static void cp_parser_abort_tentative_parse
2258 static bool cp_parser_parse_definitely
2260 static inline bool cp_parser_parsing_tentatively
2262 static bool cp_parser_uncommitted_to_tentative_parse_p
2264 static void cp_parser_error
2265 (cp_parser *, const char *);
2266 static void cp_parser_name_lookup_error
2267 (cp_parser *, tree, tree, name_lookup_error, location_t);
2268 static bool cp_parser_simulate_error
2270 static bool cp_parser_check_type_definition
2272 static void cp_parser_check_for_definition_in_return_type
2273 (cp_declarator *, tree, location_t type_location);
2274 static void cp_parser_check_for_invalid_template_id
2275 (cp_parser *, tree, location_t location);
2276 static bool cp_parser_non_integral_constant_expression
2277 (cp_parser *, non_integral_constant);
2278 static void cp_parser_diagnose_invalid_type_name
2279 (cp_parser *, tree, tree, location_t);
2280 static bool cp_parser_parse_and_diagnose_invalid_type_name
2282 static int cp_parser_skip_to_closing_parenthesis
2283 (cp_parser *, bool, bool, bool);
2284 static void cp_parser_skip_to_end_of_statement
2286 static void cp_parser_consume_semicolon_at_end_of_statement
2288 static void cp_parser_skip_to_end_of_block_or_statement
2290 static bool cp_parser_skip_to_closing_brace
2292 static void cp_parser_skip_to_end_of_template_parameter_list
2294 static void cp_parser_skip_to_pragma_eol
2295 (cp_parser*, cp_token *);
2296 static bool cp_parser_error_occurred
2298 static bool cp_parser_allow_gnu_extensions_p
2300 static bool cp_parser_is_pure_string_literal
2302 static bool cp_parser_is_string_literal
2304 static bool cp_parser_is_keyword
2305 (cp_token *, enum rid);
2306 static tree cp_parser_make_typename_type
2307 (cp_parser *, tree, tree, location_t location);
2308 static cp_declarator * cp_parser_make_indirect_declarator
2309 (enum tree_code, tree, cp_cv_quals, cp_declarator *);
2311 /* Returns nonzero if we are parsing tentatively. */
2314 cp_parser_parsing_tentatively (cp_parser* parser)
2316 return parser->context->next != NULL;
2319 /* Returns nonzero if TOKEN is a string literal. */
2322 cp_parser_is_pure_string_literal (cp_token* token)
2324 return (token->type == CPP_STRING ||
2325 token->type == CPP_STRING16 ||
2326 token->type == CPP_STRING32 ||
2327 token->type == CPP_WSTRING ||
2328 token->type == CPP_UTF8STRING);
2331 /* Returns nonzero if TOKEN is a string literal
2332 of a user-defined string literal. */
2335 cp_parser_is_string_literal (cp_token* token)
2337 return (cp_parser_is_pure_string_literal (token) ||
2338 token->type == CPP_STRING_USERDEF ||
2339 token->type == CPP_STRING16_USERDEF ||
2340 token->type == CPP_STRING32_USERDEF ||
2341 token->type == CPP_WSTRING_USERDEF ||
2342 token->type == CPP_UTF8STRING_USERDEF);
2345 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2348 cp_parser_is_keyword (cp_token* token, enum rid keyword)
2350 return token->keyword == keyword;
2353 /* If not parsing tentatively, issue a diagnostic of the form
2354 FILE:LINE: MESSAGE before TOKEN
2355 where TOKEN is the next token in the input stream. MESSAGE
2356 (specified by the caller) is usually of the form "expected
2360 cp_parser_error (cp_parser* parser, const char* gmsgid)
2362 if (!cp_parser_simulate_error (parser))
2364 cp_token *token = cp_lexer_peek_token (parser->lexer);
2365 /* This diagnostic makes more sense if it is tagged to the line
2366 of the token we just peeked at. */
2367 cp_lexer_set_source_position_from_token (token);
2369 if (token->type == CPP_PRAGMA)
2371 error_at (token->location,
2372 "%<#pragma%> is not allowed here");
2373 cp_parser_skip_to_pragma_eol (parser, token);
2377 c_parse_error (gmsgid,
2378 /* Because c_parser_error does not understand
2379 CPP_KEYWORD, keywords are treated like
2381 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
2382 token->u.value, token->flags);
2386 /* Issue an error about name-lookup failing. NAME is the
2387 IDENTIFIER_NODE DECL is the result of
2388 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2389 the thing that we hoped to find. */
2392 cp_parser_name_lookup_error (cp_parser* parser,
2395 name_lookup_error desired,
2396 location_t location)
2398 /* If name lookup completely failed, tell the user that NAME was not
2400 if (decl == error_mark_node)
2402 if (parser->scope && parser->scope != global_namespace)
2403 error_at (location, "%<%E::%E%> has not been declared",
2404 parser->scope, name);
2405 else if (parser->scope == global_namespace)
2406 error_at (location, "%<::%E%> has not been declared", name);
2407 else if (parser->object_scope
2408 && !CLASS_TYPE_P (parser->object_scope))
2409 error_at (location, "request for member %qE in non-class type %qT",
2410 name, parser->object_scope);
2411 else if (parser->object_scope)
2412 error_at (location, "%<%T::%E%> has not been declared",
2413 parser->object_scope, name);
2415 error_at (location, "%qE has not been declared", name);
2417 else if (parser->scope && parser->scope != global_namespace)
2422 error_at (location, "%<%E::%E%> is not a type",
2423 parser->scope, name);
2426 error_at (location, "%<%E::%E%> is not a class or namespace",
2427 parser->scope, name);
2431 "%<%E::%E%> is not a class, namespace, or enumeration",
2432 parser->scope, name);
2439 else if (parser->scope == global_namespace)
2444 error_at (location, "%<::%E%> is not a type", name);
2447 error_at (location, "%<::%E%> is not a class or namespace", name);
2451 "%<::%E%> is not a class, namespace, or enumeration",
2463 error_at (location, "%qE is not a type", name);
2466 error_at (location, "%qE is not a class or namespace", name);
2470 "%qE is not a class, namespace, or enumeration", name);
2478 /* If we are parsing tentatively, remember that an error has occurred
2479 during this tentative parse. Returns true if the error was
2480 simulated; false if a message should be issued by the caller. */
2483 cp_parser_simulate_error (cp_parser* parser)
2485 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2487 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2493 /* Check for repeated decl-specifiers. */
2496 cp_parser_check_decl_spec (cp_decl_specifier_seq *decl_specs,
2497 location_t location)
2501 for (ds = ds_first; ds != ds_last; ++ds)
2503 unsigned count = decl_specs->specs[ds];
2506 /* The "long" specifier is a special case because of "long long". */
2510 error_at (location, "%<long long long%> is too long for GCC");
2512 pedwarn_cxx98 (location, OPT_Wlong_long,
2513 "ISO C++ 1998 does not support %<long long%>");
2517 static const char *const decl_spec_names[] = {
2535 error_at (location, "duplicate %qs", decl_spec_names[ds]);
2540 /* This function is called when a type is defined. If type
2541 definitions are forbidden at this point, an error message is
2545 cp_parser_check_type_definition (cp_parser* parser)
2547 /* If types are forbidden here, issue a message. */
2548 if (parser->type_definition_forbidden_message)
2550 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2551 in the message need to be interpreted. */
2552 error (parser->type_definition_forbidden_message);
2558 /* This function is called when the DECLARATOR is processed. The TYPE
2559 was a type defined in the decl-specifiers. If it is invalid to
2560 define a type in the decl-specifiers for DECLARATOR, an error is
2561 issued. TYPE_LOCATION is the location of TYPE and is used
2562 for error reporting. */
2565 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2566 tree type, location_t type_location)
2568 /* [dcl.fct] forbids type definitions in return types.
2569 Unfortunately, it's not easy to know whether or not we are
2570 processing a return type until after the fact. */
2572 && (declarator->kind == cdk_pointer
2573 || declarator->kind == cdk_reference
2574 || declarator->kind == cdk_ptrmem))
2575 declarator = declarator->declarator;
2577 && declarator->kind == cdk_function)
2579 error_at (type_location,
2580 "new types may not be defined in a return type");
2581 inform (type_location,
2582 "(perhaps a semicolon is missing after the definition of %qT)",
2587 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2588 "<" in any valid C++ program. If the next token is indeed "<",
2589 issue a message warning the user about what appears to be an
2590 invalid attempt to form a template-id. LOCATION is the location
2591 of the type-specifier (TYPE) */
2594 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2595 tree type, location_t location)
2597 cp_token_position start = 0;
2599 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2602 error_at (location, "%qT is not a template", type);
2603 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2604 error_at (location, "%qE is not a template", type);
2606 error_at (location, "invalid template-id");
2607 /* Remember the location of the invalid "<". */
2608 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2609 start = cp_lexer_token_position (parser->lexer, true);
2610 /* Consume the "<". */
2611 cp_lexer_consume_token (parser->lexer);
2612 /* Parse the template arguments. */
2613 cp_parser_enclosed_template_argument_list (parser);
2614 /* Permanently remove the invalid template arguments so that
2615 this error message is not issued again. */
2617 cp_lexer_purge_tokens_after (parser->lexer, start);
2621 /* If parsing an integral constant-expression, issue an error message
2622 about the fact that THING appeared and return true. Otherwise,
2623 return false. In either case, set
2624 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2627 cp_parser_non_integral_constant_expression (cp_parser *parser,
2628 non_integral_constant thing)
2630 parser->non_integral_constant_expression_p = true;
2631 if (parser->integral_constant_expression_p)
2633 if (!parser->allow_non_integral_constant_expression_p)
2635 const char *msg = NULL;
2639 error ("floating-point literal "
2640 "cannot appear in a constant-expression");
2643 error ("a cast to a type other than an integral or "
2644 "enumeration type cannot appear in a "
2645 "constant-expression");
2648 error ("%<typeid%> operator "
2649 "cannot appear in a constant-expression");
2652 error ("non-constant compound literals "
2653 "cannot appear in a constant-expression");
2656 error ("a function call "
2657 "cannot appear in a constant-expression");
2660 error ("an increment "
2661 "cannot appear in a constant-expression");
2664 error ("an decrement "
2665 "cannot appear in a constant-expression");
2668 error ("an array reference "
2669 "cannot appear in a constant-expression");
2671 case NIC_ADDR_LABEL:
2672 error ("the address of a label "
2673 "cannot appear in a constant-expression");
2675 case NIC_OVERLOADED:
2676 error ("calls to overloaded operators "
2677 "cannot appear in a constant-expression");
2679 case NIC_ASSIGNMENT:
2680 error ("an assignment cannot appear in a constant-expression");
2683 error ("a comma operator "
2684 "cannot appear in a constant-expression");
2686 case NIC_CONSTRUCTOR:
2687 error ("a call to a constructor "
2688 "cannot appear in a constant-expression");
2690 case NIC_TRANSACTION:
2691 error ("a transaction expression "
2692 "cannot appear in a constant-expression");
2698 msg = "__FUNCTION__";
2700 case NIC_PRETTY_FUNC:
2701 msg = "__PRETTY_FUNCTION__";
2721 case NIC_PREINCREMENT:
2724 case NIC_PREDECREMENT:
2737 error ("%qs cannot appear in a constant-expression", msg);
2744 /* Emit a diagnostic for an invalid type name. SCOPE is the
2745 qualifying scope (or NULL, if none) for ID. This function commits
2746 to the current active tentative parse, if any. (Otherwise, the
2747 problematic construct might be encountered again later, resulting
2748 in duplicate error messages.) LOCATION is the location of ID. */
2751 cp_parser_diagnose_invalid_type_name (cp_parser *parser,
2752 tree scope, tree id,
2753 location_t location)
2755 tree decl, old_scope;
2756 cp_parser_commit_to_tentative_parse (parser);
2757 /* Try to lookup the identifier. */
2758 old_scope = parser->scope;
2759 parser->scope = scope;
2760 decl = cp_parser_lookup_name_simple (parser, id, location);
2761 parser->scope = old_scope;
2762 /* If the lookup found a template-name, it means that the user forgot
2763 to specify an argument list. Emit a useful error message. */
2764 if (TREE_CODE (decl) == TEMPLATE_DECL)
2766 "invalid use of template-name %qE without an argument list",
2768 else if (TREE_CODE (id) == BIT_NOT_EXPR)
2769 error_at (location, "invalid use of destructor %qD as a type", id);
2770 else if (TREE_CODE (decl) == TYPE_DECL)
2771 /* Something like 'unsigned A a;' */
2772 error_at (location, "invalid combination of multiple type-specifiers");
2773 else if (!parser->scope)
2775 /* Issue an error message. */
2776 error_at (location, "%qE does not name a type", id);
2777 /* If we're in a template class, it's possible that the user was
2778 referring to a type from a base class. For example:
2780 template <typename T> struct A { typedef T X; };
2781 template <typename T> struct B : public A<T> { X x; };
2783 The user should have said "typename A<T>::X". */
2784 if (cxx_dialect < cxx0x && id == ridpointers[(int)RID_CONSTEXPR])
2785 inform (location, "C++11 %<constexpr%> only available with "
2786 "-std=c++11 or -std=gnu++11");
2787 else if (processing_template_decl && current_class_type
2788 && TYPE_BINFO (current_class_type))
2792 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2796 tree base_type = BINFO_TYPE (b);
2797 if (CLASS_TYPE_P (base_type)
2798 && dependent_type_p (base_type))
2801 /* Go from a particular instantiation of the
2802 template (which will have an empty TYPE_FIELDs),
2803 to the main version. */
2804 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2805 for (field = TYPE_FIELDS (base_type);
2807 field = DECL_CHAIN (field))
2808 if (TREE_CODE (field) == TYPE_DECL
2809 && DECL_NAME (field) == id)
2812 "(perhaps %<typename %T::%E%> was intended)",
2813 BINFO_TYPE (b), id);
2822 /* Here we diagnose qualified-ids where the scope is actually correct,
2823 but the identifier does not resolve to a valid type name. */
2824 else if (parser->scope != error_mark_node)
2826 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2827 error_at (location, "%qE in namespace %qE does not name a type",
2829 else if (CLASS_TYPE_P (parser->scope)
2830 && constructor_name_p (id, parser->scope))
2833 error_at (location, "%<%T::%E%> names the constructor, not"
2834 " the type", parser->scope, id);
2835 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2836 error_at (location, "and %qT has no template constructors",
2839 else if (TYPE_P (parser->scope)
2840 && dependent_scope_p (parser->scope))
2841 error_at (location, "need %<typename%> before %<%T::%E%> because "
2842 "%qT is a dependent scope",
2843 parser->scope, id, parser->scope);
2844 else if (TYPE_P (parser->scope))
2845 error_at (location, "%qE in %q#T does not name a type",
2852 /* Check for a common situation where a type-name should be present,
2853 but is not, and issue a sensible error message. Returns true if an
2854 invalid type-name was detected.
2856 The situation handled by this function are variable declarations of the
2857 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2858 Usually, `ID' should name a type, but if we got here it means that it
2859 does not. We try to emit the best possible error message depending on
2860 how exactly the id-expression looks like. */
2863 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2866 cp_token *token = cp_lexer_peek_token (parser->lexer);
2868 /* Avoid duplicate error about ambiguous lookup. */
2869 if (token->type == CPP_NESTED_NAME_SPECIFIER)
2871 cp_token *next = cp_lexer_peek_nth_token (parser->lexer, 2);
2872 if (next->type == CPP_NAME && next->ambiguous_p)
2876 cp_parser_parse_tentatively (parser);
2877 id = cp_parser_id_expression (parser,
2878 /*template_keyword_p=*/false,
2879 /*check_dependency_p=*/true,
2880 /*template_p=*/NULL,
2881 /*declarator_p=*/true,
2882 /*optional_p=*/false);
2883 /* If the next token is a (, this is a function with no explicit return
2884 type, i.e. constructor, destructor or conversion op. */
2885 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
2886 || TREE_CODE (id) == TYPE_DECL)
2888 cp_parser_abort_tentative_parse (parser);
2891 if (!cp_parser_parse_definitely (parser))
2894 /* Emit a diagnostic for the invalid type. */
2895 cp_parser_diagnose_invalid_type_name (parser, parser->scope,
2896 id, token->location);
2898 /* If we aren't in the middle of a declarator (i.e. in a
2899 parameter-declaration-clause), skip to the end of the declaration;
2900 there's no point in trying to process it. */
2901 if (!parser->in_declarator_p)
2902 cp_parser_skip_to_end_of_block_or_statement (parser);
2906 /* Consume tokens up to, and including, the next non-nested closing `)'.
2907 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2908 are doing error recovery. Returns -1 if OR_COMMA is true and we
2909 found an unnested comma. */
2912 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2917 unsigned paren_depth = 0;
2918 unsigned brace_depth = 0;
2919 unsigned square_depth = 0;
2921 if (recovering && !or_comma
2922 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2927 cp_token * token = cp_lexer_peek_token (parser->lexer);
2929 switch (token->type)
2932 case CPP_PRAGMA_EOL:
2933 /* If we've run out of tokens, then there is no closing `)'. */
2936 /* This is good for lambda expression capture-lists. */
2937 case CPP_OPEN_SQUARE:
2940 case CPP_CLOSE_SQUARE:
2941 if (!square_depth--)
2946 /* This matches the processing in skip_to_end_of_statement. */
2951 case CPP_OPEN_BRACE:
2954 case CPP_CLOSE_BRACE:
2960 if (recovering && or_comma && !brace_depth && !paren_depth
2965 case CPP_OPEN_PAREN:
2970 case CPP_CLOSE_PAREN:
2971 if (!brace_depth && !paren_depth--)
2974 cp_lexer_consume_token (parser->lexer);
2983 /* Consume the token. */
2984 cp_lexer_consume_token (parser->lexer);
2988 /* Consume tokens until we reach the end of the current statement.
2989 Normally, that will be just before consuming a `;'. However, if a
2990 non-nested `}' comes first, then we stop before consuming that. */
2993 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2995 unsigned nesting_depth = 0;
2999 cp_token *token = cp_lexer_peek_token (parser->lexer);
3001 switch (token->type)
3004 case CPP_PRAGMA_EOL:
3005 /* If we've run out of tokens, stop. */
3009 /* If the next token is a `;', we have reached the end of the
3015 case CPP_CLOSE_BRACE:
3016 /* If this is a non-nested '}', stop before consuming it.
3017 That way, when confronted with something like:
3021 we stop before consuming the closing '}', even though we
3022 have not yet reached a `;'. */
3023 if (nesting_depth == 0)
3026 /* If it is the closing '}' for a block that we have
3027 scanned, stop -- but only after consuming the token.
3033 we will stop after the body of the erroneously declared
3034 function, but before consuming the following `typedef'
3036 if (--nesting_depth == 0)
3038 cp_lexer_consume_token (parser->lexer);
3042 case CPP_OPEN_BRACE:
3050 /* Consume the token. */
3051 cp_lexer_consume_token (parser->lexer);
3055 /* This function is called at the end of a statement or declaration.
3056 If the next token is a semicolon, it is consumed; otherwise, error
3057 recovery is attempted. */
3060 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
3062 /* Look for the trailing `;'. */
3063 if (!cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON))
3065 /* If there is additional (erroneous) input, skip to the end of
3067 cp_parser_skip_to_end_of_statement (parser);
3068 /* If the next token is now a `;', consume it. */
3069 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
3070 cp_lexer_consume_token (parser->lexer);
3074 /* Skip tokens until we have consumed an entire block, or until we
3075 have consumed a non-nested `;'. */
3078 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
3080 int nesting_depth = 0;
3082 while (nesting_depth >= 0)
3084 cp_token *token = cp_lexer_peek_token (parser->lexer);
3086 switch (token->type)
3089 case CPP_PRAGMA_EOL:
3090 /* If we've run out of tokens, stop. */
3094 /* Stop if this is an unnested ';'. */
3099 case CPP_CLOSE_BRACE:
3100 /* Stop if this is an unnested '}', or closes the outermost
3103 if (nesting_depth < 0)
3109 case CPP_OPEN_BRACE:
3118 /* Consume the token. */
3119 cp_lexer_consume_token (parser->lexer);
3123 /* Skip tokens until a non-nested closing curly brace is the next
3124 token, or there are no more tokens. Return true in the first case,
3128 cp_parser_skip_to_closing_brace (cp_parser *parser)
3130 unsigned nesting_depth = 0;
3134 cp_token *token = cp_lexer_peek_token (parser->lexer);
3136 switch (token->type)
3139 case CPP_PRAGMA_EOL:
3140 /* If we've run out of tokens, stop. */
3143 case CPP_CLOSE_BRACE:
3144 /* If the next token is a non-nested `}', then we have reached
3145 the end of the current block. */
3146 if (nesting_depth-- == 0)
3150 case CPP_OPEN_BRACE:
3151 /* If it the next token is a `{', then we are entering a new
3152 block. Consume the entire block. */
3160 /* Consume the token. */
3161 cp_lexer_consume_token (parser->lexer);
3165 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3166 parameter is the PRAGMA token, allowing us to purge the entire pragma
3170 cp_parser_skip_to_pragma_eol (cp_parser* parser, cp_token *pragma_tok)
3174 parser->lexer->in_pragma = false;
3177 token = cp_lexer_consume_token (parser->lexer);
3178 while (token->type != CPP_PRAGMA_EOL && token->type != CPP_EOF);
3180 /* Ensure that the pragma is not parsed again. */
3181 cp_lexer_purge_tokens_after (parser->lexer, pragma_tok);
3184 /* Require pragma end of line, resyncing with it as necessary. The
3185 arguments are as for cp_parser_skip_to_pragma_eol. */
3188 cp_parser_require_pragma_eol (cp_parser *parser, cp_token *pragma_tok)
3190 parser->lexer->in_pragma = false;
3191 if (!cp_parser_require (parser, CPP_PRAGMA_EOL, RT_PRAGMA_EOL))
3192 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
3195 /* This is a simple wrapper around make_typename_type. When the id is
3196 an unresolved identifier node, we can provide a superior diagnostic
3197 using cp_parser_diagnose_invalid_type_name. */
3200 cp_parser_make_typename_type (cp_parser *parser, tree scope,
3201 tree id, location_t id_location)
3204 if (TREE_CODE (id) == IDENTIFIER_NODE)
3206 result = make_typename_type (scope, id, typename_type,
3207 /*complain=*/tf_none);
3208 if (result == error_mark_node)
3209 cp_parser_diagnose_invalid_type_name (parser, scope, id, id_location);
3212 return make_typename_type (scope, id, typename_type, tf_error);
3215 /* This is a wrapper around the
3216 make_{pointer,ptrmem,reference}_declarator functions that decides
3217 which one to call based on the CODE and CLASS_TYPE arguments. The
3218 CODE argument should be one of the values returned by
3219 cp_parser_ptr_operator. */
3220 static cp_declarator *
3221 cp_parser_make_indirect_declarator (enum tree_code code, tree class_type,
3222 cp_cv_quals cv_qualifiers,
3223 cp_declarator *target)
3225 if (code == ERROR_MARK)
3226 return cp_error_declarator;
3228 if (code == INDIRECT_REF)
3229 if (class_type == NULL_TREE)
3230 return make_pointer_declarator (cv_qualifiers, target);
3232 return make_ptrmem_declarator (cv_qualifiers, class_type, target);
3233 else if (code == ADDR_EXPR && class_type == NULL_TREE)
3234 return make_reference_declarator (cv_qualifiers, target, false);
3235 else if (code == NON_LVALUE_EXPR && class_type == NULL_TREE)
3236 return make_reference_declarator (cv_qualifiers, target, true);
3240 /* Create a new C++ parser. */
3243 cp_parser_new (void)
3249 /* cp_lexer_new_main is called before doing GC allocation because
3250 cp_lexer_new_main might load a PCH file. */
3251 lexer = cp_lexer_new_main ();
3253 /* Initialize the binops_by_token so that we can get the tree
3254 directly from the token. */
3255 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
3256 binops_by_token[binops[i].token_type] = binops[i];
3258 parser = ggc_alloc_cleared_cp_parser ();
3259 parser->lexer = lexer;
3260 parser->context = cp_parser_context_new (NULL);
3262 /* For now, we always accept GNU extensions. */
3263 parser->allow_gnu_extensions_p = 1;
3265 /* The `>' token is a greater-than operator, not the end of a
3267 parser->greater_than_is_operator_p = true;
3269 parser->default_arg_ok_p = true;
3271 /* We are not parsing a constant-expression. */
3272 parser->integral_constant_expression_p = false;
3273 parser->allow_non_integral_constant_expression_p = false;
3274 parser->non_integral_constant_expression_p = false;
3276 /* Local variable names are not forbidden. */
3277 parser->local_variables_forbidden_p = false;
3279 /* We are not processing an `extern "C"' declaration. */
3280 parser->in_unbraced_linkage_specification_p = false;
3282 /* We are not processing a declarator. */
3283 parser->in_declarator_p = false;
3285 /* We are not processing a template-argument-list. */
3286 parser->in_template_argument_list_p = false;
3288 /* We are not in an iteration statement. */
3289 parser->in_statement = 0;
3291 /* We are not in a switch statement. */
3292 parser->in_switch_statement_p = false;
3294 /* We are not parsing a type-id inside an expression. */
3295 parser->in_type_id_in_expr_p = false;
3297 /* Declarations aren't implicitly extern "C". */
3298 parser->implicit_extern_c = false;
3300 /* String literals should be translated to the execution character set. */
3301 parser->translate_strings_p = true;
3303 /* We are not parsing a function body. */
3304 parser->in_function_body = false;
3306 /* We can correct until told otherwise. */
3307 parser->colon_corrects_to_scope_p = true;
3309 /* The unparsed function queue is empty. */
3310 push_unparsed_function_queues (parser);
3312 /* There are no classes being defined. */
3313 parser->num_classes_being_defined = 0;
3315 /* No template parameters apply. */
3316 parser->num_template_parameter_lists = 0;
3321 /* Create a cp_lexer structure which will emit the tokens in CACHE
3322 and push it onto the parser's lexer stack. This is used for delayed
3323 parsing of in-class method bodies and default arguments, and should
3324 not be confused with tentative parsing. */
3326 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
3328 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
3329 lexer->next = parser->lexer;
3330 parser->lexer = lexer;
3332 /* Move the current source position to that of the first token in the
3334 cp_lexer_set_source_position_from_token (lexer->next_token);
3337 /* Pop the top lexer off the parser stack. This is never used for the
3338 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3340 cp_parser_pop_lexer (cp_parser *parser)
3342 cp_lexer *lexer = parser->lexer;
3343 parser->lexer = lexer->next;
3344 cp_lexer_destroy (lexer);
3346 /* Put the current source position back where it was before this
3347 lexer was pushed. */
3348 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
3351 /* Lexical conventions [gram.lex] */
3353 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3357 cp_parser_identifier (cp_parser* parser)
3361 /* Look for the identifier. */
3362 token = cp_parser_require (parser, CPP_NAME, RT_NAME);
3363 /* Return the value. */
3364 return token ? token->u.value : error_mark_node;
3367 /* Parse a sequence of adjacent string constants. Returns a
3368 TREE_STRING representing the combined, nul-terminated string
3369 constant. If TRANSLATE is true, translate the string to the
3370 execution character set. If WIDE_OK is true, a wide string is
3373 C++98 [lex.string] says that if a narrow string literal token is
3374 adjacent to a wide string literal token, the behavior is undefined.
3375 However, C99 6.4.5p4 says that this results in a wide string literal.
3376 We follow C99 here, for consistency with the C front end.
3378 This code is largely lifted from lex_string() in c-lex.c.
3380 FUTURE: ObjC++ will need to handle @-strings here. */
3382 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
3386 struct obstack str_ob;
3387 cpp_string str, istr, *strs;
3389 enum cpp_ttype type, curr_type;
3390 int have_suffix_p = 0;
3392 tree suffix_id = NULL_TREE;
3393 bool curr_tok_is_userdef_p = false;
3395 tok = cp_lexer_peek_token (parser->lexer);
3396 if (!cp_parser_is_string_literal (tok))
3398 cp_parser_error (parser, "expected string-literal");
3399 return error_mark_node;
3402 if (cpp_userdef_string_p (tok->type))
3404 string_tree = USERDEF_LITERAL_VALUE (tok->u.value);
3405 curr_type = cpp_userdef_string_remove_type (tok->type);
3406 curr_tok_is_userdef_p = true;
3410 string_tree = tok->u.value;
3411 curr_type = tok->type;
3415 /* Try to avoid the overhead of creating and destroying an obstack
3416 for the common case of just one string. */
3417 if (!cp_parser_is_string_literal
3418 (cp_lexer_peek_nth_token (parser->lexer, 2)))
3420 cp_lexer_consume_token (parser->lexer);
3422 str.text = (const unsigned char *)TREE_STRING_POINTER (string_tree);
3423 str.len = TREE_STRING_LENGTH (string_tree);
3426 if (curr_tok_is_userdef_p)
3428 suffix_id = USERDEF_LITERAL_SUFFIX_ID (tok->u.value);
3430 curr_type = cpp_userdef_string_remove_type (tok->type);
3433 curr_type = tok->type;
3439 gcc_obstack_init (&str_ob);
3444 cp_lexer_consume_token (parser->lexer);
3446 str.text = (const unsigned char *)TREE_STRING_POINTER (string_tree);
3447 str.len = TREE_STRING_LENGTH (string_tree);
3449 if (curr_tok_is_userdef_p)
3451 tree curr_suffix_id = USERDEF_LITERAL_SUFFIX_ID (tok->u.value);
3452 if (have_suffix_p == 0)
3454 suffix_id = curr_suffix_id;
3457 else if (have_suffix_p == 1
3458 && curr_suffix_id != suffix_id)
3460 error ("inconsistent user-defined literal suffixes"
3461 " %qD and %qD in string literal",
3462 suffix_id, curr_suffix_id);
3465 curr_type = cpp_userdef_string_remove_type (tok->type);
3468 curr_type = tok->type;
3470 if (type != curr_type)
3472 if (type == CPP_STRING)
3474 else if (curr_type != CPP_STRING)
3475 error_at (tok->location,
3476 "unsupported non-standard concatenation "
3477 "of string literals");
3480 obstack_grow (&str_ob, &str, sizeof (cpp_string));
3482 tok = cp_lexer_peek_token (parser->lexer);
3483 if (cpp_userdef_string_p (tok->type))
3485 string_tree = USERDEF_LITERAL_VALUE (tok->u.value);
3486 curr_type = cpp_userdef_string_remove_type (tok->type);
3487 curr_tok_is_userdef_p = true;
3491 string_tree = tok->u.value;
3492 curr_type = tok->type;
3493 curr_tok_is_userdef_p = false;
3496 while (cp_parser_is_string_literal (tok));
3498 strs = (cpp_string *) obstack_finish (&str_ob);
3501 if (type != CPP_STRING && !wide_ok)
3503 cp_parser_error (parser, "a wide string is invalid in this context");
3507 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
3508 (parse_in, strs, count, &istr, type))
3510 value = build_string (istr.len, (const char *)istr.text);
3511 free (CONST_CAST (unsigned char *, istr.text));
3517 case CPP_UTF8STRING:
3518 TREE_TYPE (value) = char_array_type_node;
3521 TREE_TYPE (value) = char16_array_type_node;
3524 TREE_TYPE (value) = char32_array_type_node;
3527 TREE_TYPE (value) = wchar_array_type_node;
3531 value = fix_string_type (value);
3535 tree literal = build_userdef_literal (suffix_id, value, NULL_TREE);
3536 tok->u.value = literal;
3537 return cp_parser_userdef_string_literal (tok);
3541 /* cpp_interpret_string has issued an error. */
3542 value = error_mark_node;
3545 obstack_free (&str_ob, 0);
3550 /* Look up a literal operator with the name and the exact arguments. */
3553 lookup_literal_operator (tree name, VEC(tree,gc) *args)
3556 decl = lookup_name (name);
3557 if (!decl || decl == error_mark_node)
3558 return error_mark_node;
3560 for (fns = decl; fns; fns = OVL_NEXT (fns))
3564 tree fn = OVL_CURRENT (fns);
3565 tree argtypes = NULL_TREE;
3566 argtypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
3567 if (argtypes != NULL_TREE)
3569 for (ix = 0; ix < VEC_length (tree, args) && argtypes != NULL_TREE;
3570 ++ix, argtypes = TREE_CHAIN (argtypes))
3572 tree targ = TREE_VALUE (argtypes);
3573 tree tparm = TREE_TYPE (VEC_index (tree, args, ix));
3574 bool ptr = TREE_CODE (targ) == POINTER_TYPE;
3575 bool arr = TREE_CODE (tparm) == ARRAY_TYPE;
3576 if ((ptr || arr || !same_type_p (targ, tparm))
3578 || !same_type_p (TREE_TYPE (targ),
3579 TREE_TYPE (tparm))))
3587 return error_mark_node;
3590 /* Parse a user-defined char constant. Returns a call to a user-defined
3591 literal operator taking the character as an argument. */
3594 cp_parser_userdef_char_literal (cp_parser *parser)
3596 cp_token *token = cp_lexer_consume_token (parser->lexer);
3597 tree literal = token->u.value;
3598 tree suffix_id = USERDEF_LITERAL_SUFFIX_ID (literal);
3599 tree value = USERDEF_LITERAL_VALUE (literal);
3600 tree name = cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id));
3603 /* Build up a call to the user-defined operator */
3604 /* Lookup the name we got back from the id-expression. */
3605 VEC(tree,gc) *args = make_tree_vector ();
3606 VEC_safe_push (tree, gc, args, value);
3607 decl = lookup_literal_operator (name, args);
3608 if (!decl || decl == error_mark_node)
3610 error ("unable to find character literal operator %qD with %qT argument",
3611 name, TREE_TYPE (value));
3612 release_tree_vector (args);
3613 return error_mark_node;
3615 result = finish_call_expr (decl, &args, false, true, tf_warning_or_error);
3616 release_tree_vector (args);
3617 if (result != error_mark_node)
3620 error ("unable to find character literal operator %qD with %qT argument",
3621 name, TREE_TYPE (value));
3622 return error_mark_node;
3625 /* A subroutine of cp_parser_userdef_numeric_literal to
3626 create a char... template parameter pack from a string node. */
3629 make_char_string_pack (tree value)
3632 tree argpack = make_node (NONTYPE_ARGUMENT_PACK);
3633 const char *str = TREE_STRING_POINTER (value);
3634 int i, len = TREE_STRING_LENGTH (value) - 1;
3635 tree argvec = make_tree_vec (1);
3637 /* Fill in CHARVEC with all of the parameters. */
3638 charvec = make_tree_vec (len);
3639 for (i = 0; i < len; ++i)
3640 TREE_VEC_ELT (charvec, i) = build_int_cst (char_type_node, str[i]);
3642 /* Build the argument packs. */
3643 SET_ARGUMENT_PACK_ARGS (argpack, charvec);
3644 TREE_TYPE (argpack) = char_type_node;
3646 TREE_VEC_ELT (argvec, 0) = argpack;
3651 /* Parse a user-defined numeric constant. returns a call to a user-defined
3652 literal operator. */
3655 cp_parser_userdef_numeric_literal (cp_parser *parser)
3657 cp_token *token = cp_lexer_consume_token (parser->lexer);
3658 tree literal = token->u.value;
3659 tree suffix_id = USERDEF_LITERAL_SUFFIX_ID (literal);
3660 tree value = USERDEF_LITERAL_VALUE (literal);
3661 tree num_string = USERDEF_LITERAL_NUM_STRING (literal);
3662 tree name = cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id));
3666 /* Look for a literal operator taking the exact type of numeric argument
3667 as the literal value. */
3668 args = make_tree_vector ();
3669 VEC_safe_push (tree, gc, args, value);
3670 decl = lookup_literal_operator (name, args);
3671 if (decl && decl != error_mark_node)
3673 result = finish_call_expr (decl, &args, false, true, tf_none);
3674 if (result != error_mark_node)
3676 release_tree_vector (args);
3680 release_tree_vector (args);
3682 /* If the numeric argument didn't work, look for a raw literal
3683 operator taking a const char* argument consisting of the number
3684 in string format. */
3685 args = make_tree_vector ();
3686 VEC_safe_push (tree, gc, args, num_string);
3687 decl = lookup_literal_operator (name, args);
3688 if (decl && decl != error_mark_node)
3690 result = finish_call_expr (decl, &args, false, true, tf_none);
3691 if (result != error_mark_node)
3693 release_tree_vector (args);
3697 release_tree_vector (args);
3699 /* If the raw literal didn't work, look for a non-type template
3700 function with parameter pack char.... Call the function with
3701 template parameter characters representing the number. */
3702 args = make_tree_vector ();
3703 decl = lookup_literal_operator (name, args);
3704 if (decl && decl != error_mark_node)
3706 tree tmpl_args = make_char_string_pack (num_string);
3707 decl = lookup_template_function (decl, tmpl_args);
3708 result = finish_call_expr (decl, &args, false, true, tf_none);
3709 if (result != error_mark_node)
3711 release_tree_vector (args);
3715 release_tree_vector (args);
3717 error ("unable to find numeric literal operator %qD", name);
3718 return error_mark_node;
3721 /* Parse a user-defined string constant. Returns a call to a user-defined
3722 literal operator taking a character pointer and the length of the string
3726 cp_parser_userdef_string_literal (cp_token *token)
3728 tree literal = token->u.value;
3729 tree suffix_id = USERDEF_LITERAL_SUFFIX_ID (literal);
3730 tree name = cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id));
3731 tree value = USERDEF_LITERAL_VALUE (literal);
3732 int len = TREE_STRING_LENGTH (value)
3733 / TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value)))) - 1;
3736 /* Build up a call to the user-defined operator */
3737 /* Lookup the name we got back from the id-expression. */
3738 VEC(tree,gc) *args = make_tree_vector ();
3739 VEC_safe_push (tree, gc, args, value);
3740 VEC_safe_push (tree, gc, args, build_int_cst (size_type_node, len));
3741 decl = lookup_name (name);
3742 if (!decl || decl == error_mark_node)
3744 error ("unable to find string literal operator %qD", name);
3745 release_tree_vector (args);
3746 return error_mark_node;
3748 result = finish_call_expr (decl, &args, false, true, tf_none);
3749 release_tree_vector (args);
3750 if (result != error_mark_node)
3753 error ("unable to find string literal operator %qD with %qT, %qT arguments",
3754 name, TREE_TYPE (value), size_type_node);
3755 return error_mark_node;
3759 /* Basic concepts [gram.basic] */
3761 /* Parse a translation-unit.
3764 declaration-seq [opt]
3766 Returns TRUE if all went well. */
3769 cp_parser_translation_unit (cp_parser* parser)
3771 /* The address of the first non-permanent object on the declarator
3773 static void *declarator_obstack_base;
3777 /* Create the declarator obstack, if necessary. */
3778 if (!cp_error_declarator)
3780 gcc_obstack_init (&declarator_obstack);
3781 /* Create the error declarator. */
3782 cp_error_declarator = make_declarator (cdk_error);
3783 /* Create the empty parameter list. */
3784 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
3785 /* Remember where the base of the declarator obstack lies. */
3786 declarator_obstack_base = obstack_next_free (&declarator_obstack);
3789 cp_parser_declaration_seq_opt (parser);
3791 /* If there are no tokens left then all went well. */
3792 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
3794 /* Get rid of the token array; we don't need it any more. */
3795 cp_lexer_destroy (parser->lexer);
3796 parser->lexer = NULL;
3798 /* This file might have been a context that's implicitly extern
3799 "C". If so, pop the lang context. (Only relevant for PCH.) */
3800 if (parser->implicit_extern_c)
3802 pop_lang_context ();
3803 parser->implicit_extern_c = false;
3807 finish_translation_unit ();
3813 cp_parser_error (parser, "expected declaration");
3817 /* Make sure the declarator obstack was fully cleaned up. */
3818 gcc_assert (obstack_next_free (&declarator_obstack)
3819 == declarator_obstack_base);
3821 /* All went well. */
3825 /* Expressions [gram.expr] */
3827 /* Parse a primary-expression.
3838 ( compound-statement )
3839 __builtin_va_arg ( assignment-expression , type-id )
3840 __builtin_offsetof ( type-id , offsetof-expression )
3843 __has_nothrow_assign ( type-id )
3844 __has_nothrow_constructor ( type-id )
3845 __has_nothrow_copy ( type-id )
3846 __has_trivial_assign ( type-id )
3847 __has_trivial_constructor ( type-id )
3848 __has_trivial_copy ( type-id )
3849 __has_trivial_destructor ( type-id )
3850 __has_virtual_destructor ( type-id )
3851 __is_abstract ( type-id )
3852 __is_base_of ( type-id , type-id )
3853 __is_class ( type-id )
3854 __is_convertible_to ( type-id , type-id )
3855 __is_empty ( type-id )
3856 __is_enum ( type-id )
3857 __is_literal_type ( type-id )
3858 __is_pod ( type-id )
3859 __is_polymorphic ( type-id )
3860 __is_std_layout ( type-id )
3861 __is_trivial ( type-id )
3862 __is_union ( type-id )
3864 Objective-C++ Extension:
3872 ADDRESS_P is true iff this expression was immediately preceded by
3873 "&" and therefore might denote a pointer-to-member. CAST_P is true
3874 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3875 true iff this expression is a template argument.
3877 Returns a representation of the expression. Upon return, *IDK
3878 indicates what kind of id-expression (if any) was present. */
3881 cp_parser_primary_expression (cp_parser *parser,
3884 bool template_arg_p,
3887 cp_token *token = NULL;
3889 /* Assume the primary expression is not an id-expression. */
3890 *idk = CP_ID_KIND_NONE;
3892 /* Peek at the next token. */
3893 token = cp_lexer_peek_token (parser->lexer);
3894 switch (token->type)
3903 user-defined-literal */
3909 if (TREE_CODE (token->u.value) == USERDEF_LITERAL)
3910 return cp_parser_userdef_numeric_literal (parser);
3911 token = cp_lexer_consume_token (parser->lexer);
3912 if (TREE_CODE (token->u.value) == FIXED_CST)
3914 error_at (token->location,
3915 "fixed-point types not supported in C++");
3916 return error_mark_node;
3918 /* Floating-point literals are only allowed in an integral
3919 constant expression if they are cast to an integral or
3920 enumeration type. */
3921 if (TREE_CODE (token->u.value) == REAL_CST
3922 && parser->integral_constant_expression_p
3925 /* CAST_P will be set even in invalid code like "int(2.7 +
3926 ...)". Therefore, we have to check that the next token
3927 is sure to end the cast. */
3930 cp_token *next_token;
3932 next_token = cp_lexer_peek_token (parser->lexer);
3933 if (/* The comma at the end of an
3934 enumerator-definition. */
3935 next_token->type != CPP_COMMA
3936 /* The curly brace at the end of an enum-specifier. */
3937 && next_token->type != CPP_CLOSE_BRACE
3938 /* The end of a statement. */
3939 && next_token->type != CPP_SEMICOLON
3940 /* The end of the cast-expression. */
3941 && next_token->type != CPP_CLOSE_PAREN
3942 /* The end of an array bound. */
3943 && next_token->type != CPP_CLOSE_SQUARE
3944 /* The closing ">" in a template-argument-list. */
3945 && (next_token->type != CPP_GREATER
3946 || parser->greater_than_is_operator_p)
3947 /* C++0x only: A ">>" treated like two ">" tokens,
3948 in a template-argument-list. */
3949 && (next_token->type != CPP_RSHIFT
3950 || (cxx_dialect == cxx98)
3951 || parser->greater_than_is_operator_p))
3955 /* If we are within a cast, then the constraint that the
3956 cast is to an integral or enumeration type will be
3957 checked at that point. If we are not within a cast, then
3958 this code is invalid. */
3960 cp_parser_non_integral_constant_expression (parser, NIC_FLOAT);
3962 return token->u.value;
3964 case CPP_CHAR_USERDEF:
3965 case CPP_CHAR16_USERDEF:
3966 case CPP_CHAR32_USERDEF:
3967 case CPP_WCHAR_USERDEF:
3968 return cp_parser_userdef_char_literal (parser);
3974 case CPP_UTF8STRING:
3975 case CPP_STRING_USERDEF:
3976 case CPP_STRING16_USERDEF:
3977 case CPP_STRING32_USERDEF:
3978 case CPP_WSTRING_USERDEF:
3979 case CPP_UTF8STRING_USERDEF:
3980 /* ??? Should wide strings be allowed when parser->translate_strings_p
3981 is false (i.e. in attributes)? If not, we can kill the third
3982 argument to cp_parser_string_literal. */
3983 return cp_parser_string_literal (parser,
3984 parser->translate_strings_p,
3987 case CPP_OPEN_PAREN:
3990 bool saved_greater_than_is_operator_p;
3992 /* Consume the `('. */
3993 cp_lexer_consume_token (parser->lexer);
3994 /* Within a parenthesized expression, a `>' token is always
3995 the greater-than operator. */
3996 saved_greater_than_is_operator_p
3997 = parser->greater_than_is_operator_p;
3998 parser->greater_than_is_operator_p = true;
3999 /* If we see `( { ' then we are looking at the beginning of
4000 a GNU statement-expression. */
4001 if (cp_parser_allow_gnu_extensions_p (parser)
4002 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
4004 /* Statement-expressions are not allowed by the standard. */
4005 pedwarn (token->location, OPT_pedantic,
4006 "ISO C++ forbids braced-groups within expressions");
4008 /* And they're not allowed outside of a function-body; you
4009 cannot, for example, write:
4011 int i = ({ int j = 3; j + 1; });
4013 at class or namespace scope. */
4014 if (!parser->in_function_body
4015 || parser->in_template_argument_list_p)
4017 error_at (token->location,
4018 "statement-expressions are not allowed outside "
4019 "functions nor in template-argument lists");
4020 cp_parser_skip_to_end_of_block_or_statement (parser);
4021 expr = error_mark_node;
4025 /* Start the statement-expression. */
4026 expr = begin_stmt_expr ();
4027 /* Parse the compound-statement. */
4028 cp_parser_compound_statement (parser, expr, false, false);
4030 expr = finish_stmt_expr (expr, false);
4035 /* Parse the parenthesized expression. */
4036 expr = cp_parser_expression (parser, cast_p, idk);
4037 /* Let the front end know that this expression was
4038 enclosed in parentheses. This matters in case, for
4039 example, the expression is of the form `A::B', since
4040 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4042 finish_parenthesized_expr (expr);
4043 /* DR 705: Wrapping an unqualified name in parentheses
4044 suppresses arg-dependent lookup. We want to pass back
4045 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4046 (c++/37862), but none of the others. */
4047 if (*idk != CP_ID_KIND_QUALIFIED)
4048 *idk = CP_ID_KIND_NONE;
4050 /* The `>' token might be the end of a template-id or
4051 template-parameter-list now. */
4052 parser->greater_than_is_operator_p
4053 = saved_greater_than_is_operator_p;
4054 /* Consume the `)'. */
4055 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
4056 cp_parser_skip_to_end_of_statement (parser);
4061 case CPP_OPEN_SQUARE:
4062 if (c_dialect_objc ())
4063 /* We have an Objective-C++ message. */
4064 return cp_parser_objc_expression (parser);
4066 tree lam = cp_parser_lambda_expression (parser);
4067 /* Don't warn about a failed tentative parse. */
4068 if (cp_parser_error_occurred (parser))
4069 return error_mark_node;
4070 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR);
4074 case CPP_OBJC_STRING:
4075 if (c_dialect_objc ())
4076 /* We have an Objective-C++ string literal. */
4077 return cp_parser_objc_expression (parser);
4078 cp_parser_error (parser, "expected primary-expression");
4079 return error_mark_node;
4082 switch (token->keyword)
4084 /* These two are the boolean literals. */
4086 cp_lexer_consume_token (parser->lexer);
4087 return boolean_true_node;
4089 cp_lexer_consume_token (parser->lexer);
4090 return boolean_false_node;
4092 /* The `__null' literal. */
4094 cp_lexer_consume_token (parser->lexer);
4097 /* The `nullptr' literal. */
4099 cp_lexer_consume_token (parser->lexer);
4100 return nullptr_node;
4102 /* Recognize the `this' keyword. */
4104 cp_lexer_consume_token (parser->lexer);
4105 if (parser->local_variables_forbidden_p)
4107 error_at (token->location,
4108 "%<this%> may not be used in this context");
4109 return error_mark_node;
4111 /* Pointers cannot appear in constant-expressions. */
4112 if (cp_parser_non_integral_constant_expression (parser, NIC_THIS))
4113 return error_mark_node;
4114 return finish_this_expr ();
4116 /* The `operator' keyword can be the beginning of an
4121 case RID_FUNCTION_NAME:
4122 case RID_PRETTY_FUNCTION_NAME:
4123 case RID_C99_FUNCTION_NAME:
4125 non_integral_constant name;
4127 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4128 __func__ are the names of variables -- but they are
4129 treated specially. Therefore, they are handled here,
4130 rather than relying on the generic id-expression logic
4131 below. Grammatically, these names are id-expressions.
4133 Consume the token. */
4134 token = cp_lexer_consume_token (parser->lexer);
4136 switch (token->keyword)
4138 case RID_FUNCTION_NAME:
4139 name = NIC_FUNC_NAME;
4141 case RID_PRETTY_FUNCTION_NAME:
4142 name = NIC_PRETTY_FUNC;
4144 case RID_C99_FUNCTION_NAME:
4145 name = NIC_C99_FUNC;
4151 if (cp_parser_non_integral_constant_expression (parser, name))
4152 return error_mark_node;
4154 /* Look up the name. */
4155 return finish_fname (token->u.value);
4163 /* The `__builtin_va_arg' construct is used to handle
4164 `va_arg'. Consume the `__builtin_va_arg' token. */
4165 cp_lexer_consume_token (parser->lexer);
4166 /* Look for the opening `('. */
4167 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
4168 /* Now, parse the assignment-expression. */
4169 expression = cp_parser_assignment_expression (parser,
4170 /*cast_p=*/false, NULL);
4171 /* Look for the `,'. */
4172 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
4173 /* Parse the type-id. */
4174 type = cp_parser_type_id (parser);
4175 /* Look for the closing `)'. */
4176 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
4177 /* Using `va_arg' in a constant-expression is not
4179 if (cp_parser_non_integral_constant_expression (parser,
4181 return error_mark_node;
4182 return build_x_va_arg (expression, type);
4186 return cp_parser_builtin_offsetof (parser);
4188 case RID_HAS_NOTHROW_ASSIGN:
4189 case RID_HAS_NOTHROW_CONSTRUCTOR:
4190 case RID_HAS_NOTHROW_COPY:
4191 case RID_HAS_TRIVIAL_ASSIGN:
4192 case RID_HAS_TRIVIAL_CONSTRUCTOR:
4193 case RID_HAS_TRIVIAL_COPY:
4194 case RID_HAS_TRIVIAL_DESTRUCTOR:
4195 case RID_HAS_VIRTUAL_DESTRUCTOR:
4196 case RID_IS_ABSTRACT:
4197 case RID_IS_BASE_OF:
4199 case RID_IS_CONVERTIBLE_TO:
4202 case RID_IS_LITERAL_TYPE:
4204 case RID_IS_POLYMORPHIC:
4205 case RID_IS_STD_LAYOUT:
4206 case RID_IS_TRIVIAL:
4208 return cp_parser_trait_expr (parser, token->keyword);
4210 /* Objective-C++ expressions. */
4212 case RID_AT_PROTOCOL:
4213 case RID_AT_SELECTOR:
4214 return cp_parser_objc_expression (parser);
4217 if (parser->in_function_body
4218 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4221 error_at (token->location,
4222 "a template declaration cannot appear at block scope");
4223 cp_parser_skip_to_end_of_block_or_statement (parser);
4224 return error_mark_node;
4227 cp_parser_error (parser, "expected primary-expression");
4228 return error_mark_node;
4231 /* An id-expression can start with either an identifier, a
4232 `::' as the beginning of a qualified-id, or the "operator"
4236 case CPP_TEMPLATE_ID:
4237 case CPP_NESTED_NAME_SPECIFIER:
4241 const char *error_msg;
4244 cp_token *id_expr_token;
4247 /* Parse the id-expression. */
4249 = cp_parser_id_expression (parser,
4250 /*template_keyword_p=*/false,
4251 /*check_dependency_p=*/true,
4253 /*declarator_p=*/false,
4254 /*optional_p=*/false);
4255 if (id_expression == error_mark_node)
4256 return error_mark_node;
4257 id_expr_token = token;
4258 token = cp_lexer_peek_token (parser->lexer);
4259 done = (token->type != CPP_OPEN_SQUARE
4260 && token->type != CPP_OPEN_PAREN
4261 && token->type != CPP_DOT
4262 && token->type != CPP_DEREF
4263 && token->type != CPP_PLUS_PLUS
4264 && token->type != CPP_MINUS_MINUS);
4265 /* If we have a template-id, then no further lookup is
4266 required. If the template-id was for a template-class, we
4267 will sometimes have a TYPE_DECL at this point. */
4268 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
4269 || TREE_CODE (id_expression) == TYPE_DECL)
4270 decl = id_expression;
4271 /* Look up the name. */
4274 tree ambiguous_decls;
4276 /* If we already know that this lookup is ambiguous, then
4277 we've already issued an error message; there's no reason
4279 if (id_expr_token->type == CPP_NAME
4280 && id_expr_token->ambiguous_p)
4282 cp_parser_simulate_error (parser);
4283 return error_mark_node;
4286 decl = cp_parser_lookup_name (parser, id_expression,
4289 /*is_namespace=*/false,
4290 /*check_dependency=*/true,
4292 id_expr_token->location);
4293 /* If the lookup was ambiguous, an error will already have
4295 if (ambiguous_decls)
4296 return error_mark_node;
4298 /* In Objective-C++, we may have an Objective-C 2.0
4299 dot-syntax for classes here. */
4300 if (c_dialect_objc ()
4301 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT
4302 && TREE_CODE (decl) == TYPE_DECL
4303 && objc_is_class_name (decl))
4306 cp_lexer_consume_token (parser->lexer);
4307 component = cp_parser_identifier (parser);
4308 if (component == error_mark_node)
4309 return error_mark_node;
4311 return objc_build_class_component_ref (id_expression, component);
4314 /* In Objective-C++, an instance variable (ivar) may be preferred
4315 to whatever cp_parser_lookup_name() found. */
4316 decl = objc_lookup_ivar (decl, id_expression);
4318 /* If name lookup gives us a SCOPE_REF, then the
4319 qualifying scope was dependent. */
4320 if (TREE_CODE (decl) == SCOPE_REF)
4322 /* At this point, we do not know if DECL is a valid
4323 integral constant expression. We assume that it is
4324 in fact such an expression, so that code like:
4326 template <int N> struct A {
4330 is accepted. At template-instantiation time, we
4331 will check that B<N>::i is actually a constant. */
4334 /* Check to see if DECL is a local variable in a context
4335 where that is forbidden. */
4336 if (parser->local_variables_forbidden_p
4337 && local_variable_p (decl))
4339 /* It might be that we only found DECL because we are
4340 trying to be generous with pre-ISO scoping rules.
4341 For example, consider:
4345 for (int i = 0; i < 10; ++i) {}
4346 extern void f(int j = i);
4349 Here, name look up will originally find the out
4350 of scope `i'. We need to issue a warning message,
4351 but then use the global `i'. */
4352 decl = check_for_out_of_scope_variable (decl);
4353 if (local_variable_p (decl))
4355 error_at (id_expr_token->location,
4356 "local variable %qD may not appear in this context",
4358 return error_mark_node;
4363 decl = (finish_id_expression
4364 (id_expression, decl, parser->scope,
4366 parser->integral_constant_expression_p,
4367 parser->allow_non_integral_constant_expression_p,
4368 &parser->non_integral_constant_expression_p,
4369 template_p, done, address_p,
4372 id_expr_token->location));
4374 cp_parser_error (parser, error_msg);
4378 /* Anything else is an error. */
4380 cp_parser_error (parser, "expected primary-expression");
4381 return error_mark_node;
4385 /* Parse an id-expression.
4392 :: [opt] nested-name-specifier template [opt] unqualified-id
4394 :: operator-function-id
4397 Return a representation of the unqualified portion of the
4398 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4399 a `::' or nested-name-specifier.
4401 Often, if the id-expression was a qualified-id, the caller will
4402 want to make a SCOPE_REF to represent the qualified-id. This
4403 function does not do this in order to avoid wastefully creating
4404 SCOPE_REFs when they are not required.
4406 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4409 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4410 uninstantiated templates.
4412 If *TEMPLATE_P is non-NULL, it is set to true iff the
4413 `template' keyword is used to explicitly indicate that the entity
4414 named is a template.
4416 If DECLARATOR_P is true, the id-expression is appearing as part of
4417 a declarator, rather than as part of an expression. */
4420 cp_parser_id_expression (cp_parser *parser,
4421 bool template_keyword_p,
4422 bool check_dependency_p,
4427 bool global_scope_p;
4428 bool nested_name_specifier_p;
4430 /* Assume the `template' keyword was not used. */
4432 *template_p = template_keyword_p;
4434 /* Look for the optional `::' operator. */
4436 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
4438 /* Look for the optional nested-name-specifier. */
4439 nested_name_specifier_p
4440 = (cp_parser_nested_name_specifier_opt (parser,
4441 /*typename_keyword_p=*/false,
4446 /* If there is a nested-name-specifier, then we are looking at
4447 the first qualified-id production. */
4448 if (nested_name_specifier_p)
4451 tree saved_object_scope;
4452 tree saved_qualifying_scope;
4453 tree unqualified_id;
4456 /* See if the next token is the `template' keyword. */
4458 template_p = &is_template;
4459 *template_p = cp_parser_optional_template_keyword (parser);
4460 /* Name lookup we do during the processing of the
4461 unqualified-id might obliterate SCOPE. */
4462 saved_scope = parser->scope;
4463 saved_object_scope = parser->object_scope;
4464 saved_qualifying_scope = parser->qualifying_scope;
4465 /* Process the final unqualified-id. */
4466 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
4469 /*optional_p=*/false);
4470 /* Restore the SAVED_SCOPE for our caller. */
4471 parser->scope = saved_scope;
4472 parser->object_scope = saved_object_scope;
4473 parser->qualifying_scope = saved_qualifying_scope;
4475 return unqualified_id;
4477 /* Otherwise, if we are in global scope, then we are looking at one
4478 of the other qualified-id productions. */
4479 else if (global_scope_p)
4484 /* Peek at the next token. */
4485 token = cp_lexer_peek_token (parser->lexer);
4487 /* If it's an identifier, and the next token is not a "<", then
4488 we can avoid the template-id case. This is an optimization
4489 for this common case. */
4490 if (token->type == CPP_NAME
4491 && !cp_parser_nth_token_starts_template_argument_list_p
4493 return cp_parser_identifier (parser);
4495 cp_parser_parse_tentatively (parser);
4496 /* Try a template-id. */
4497 id = cp_parser_template_id (parser,
4498 /*template_keyword_p=*/false,
4499 /*check_dependency_p=*/true,
4501 /* If that worked, we're done. */
4502 if (cp_parser_parse_definitely (parser))
4505 /* Peek at the next token. (Changes in the token buffer may
4506 have invalidated the pointer obtained above.) */
4507 token = cp_lexer_peek_token (parser->lexer);
4509 switch (token->type)
4512 return cp_parser_identifier (parser);
4515 if (token->keyword == RID_OPERATOR)
4516 return cp_parser_operator_function_id (parser);
4520 cp_parser_error (parser, "expected id-expression");
4521 return error_mark_node;
4525 return cp_parser_unqualified_id (parser, template_keyword_p,
4526 /*check_dependency_p=*/true,
4531 /* Parse an unqualified-id.
4535 operator-function-id
4536 conversion-function-id
4540 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4541 keyword, in a construct like `A::template ...'.
4543 Returns a representation of unqualified-id. For the `identifier'
4544 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4545 production a BIT_NOT_EXPR is returned; the operand of the
4546 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4547 other productions, see the documentation accompanying the
4548 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4549 names are looked up in uninstantiated templates. If DECLARATOR_P
4550 is true, the unqualified-id is appearing as part of a declarator,
4551 rather than as part of an expression. */
4554 cp_parser_unqualified_id (cp_parser* parser,
4555 bool template_keyword_p,
4556 bool check_dependency_p,
4562 /* Peek at the next token. */
4563 token = cp_lexer_peek_token (parser->lexer);
4565 switch (token->type)
4571 /* We don't know yet whether or not this will be a
4573 cp_parser_parse_tentatively (parser);
4574 /* Try a template-id. */
4575 id = cp_parser_template_id (parser, template_keyword_p,
4578 /* If it worked, we're done. */
4579 if (cp_parser_parse_definitely (parser))
4581 /* Otherwise, it's an ordinary identifier. */
4582 return cp_parser_identifier (parser);
4585 case CPP_TEMPLATE_ID:
4586 return cp_parser_template_id (parser, template_keyword_p,
4593 tree qualifying_scope;
4598 /* Consume the `~' token. */
4599 cp_lexer_consume_token (parser->lexer);
4600 /* Parse the class-name. The standard, as written, seems to
4603 template <typename T> struct S { ~S (); };
4604 template <typename T> S<T>::~S() {}
4606 is invalid, since `~' must be followed by a class-name, but
4607 `S<T>' is dependent, and so not known to be a class.
4608 That's not right; we need to look in uninstantiated
4609 templates. A further complication arises from:
4611 template <typename T> void f(T t) {
4615 Here, it is not possible to look up `T' in the scope of `T'
4616 itself. We must look in both the current scope, and the
4617 scope of the containing complete expression.
4619 Yet another issue is:
4628 The standard does not seem to say that the `S' in `~S'
4629 should refer to the type `S' and not the data member
4632 /* DR 244 says that we look up the name after the "~" in the
4633 same scope as we looked up the qualifying name. That idea
4634 isn't fully worked out; it's more complicated than that. */
4635 scope = parser->scope;
4636 object_scope = parser->object_scope;
4637 qualifying_scope = parser->qualifying_scope;
4639 /* Check for invalid scopes. */
4640 if (scope == error_mark_node)
4642 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
4643 cp_lexer_consume_token (parser->lexer);
4644 return error_mark_node;
4646 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
4648 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
4649 error_at (token->location,
4650 "scope %qT before %<~%> is not a class-name",
4652 cp_parser_simulate_error (parser);
4653 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
4654 cp_lexer_consume_token (parser->lexer);
4655 return error_mark_node;
4657 gcc_assert (!scope || TYPE_P (scope));
4659 /* If the name is of the form "X::~X" it's OK even if X is a
4661 token = cp_lexer_peek_token (parser->lexer);
4663 && token->type == CPP_NAME
4664 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4666 && (token->u.value == TYPE_IDENTIFIER (scope)
4667 || (CLASS_TYPE_P (scope)
4668 && constructor_name_p (token->u.value, scope))))
4670 cp_lexer_consume_token (parser->lexer);
4671 return build_nt (BIT_NOT_EXPR, scope);
4674 /* If there was an explicit qualification (S::~T), first look
4675 in the scope given by the qualification (i.e., S).
4677 Note: in the calls to cp_parser_class_name below we pass
4678 typename_type so that lookup finds the injected-class-name
4679 rather than the constructor. */
4681 type_decl = NULL_TREE;
4684 cp_parser_parse_tentatively (parser);
4685 type_decl = cp_parser_class_name (parser,
4686 /*typename_keyword_p=*/false,
4687 /*template_keyword_p=*/false,
4689 /*check_dependency=*/false,
4690 /*class_head_p=*/false,
4692 if (cp_parser_parse_definitely (parser))
4695 /* In "N::S::~S", look in "N" as well. */
4696 if (!done && scope && qualifying_scope)
4698 cp_parser_parse_tentatively (parser);
4699 parser->scope = qualifying_scope;
4700 parser->object_scope = NULL_TREE;
4701 parser->qualifying_scope = NULL_TREE;
4703 = cp_parser_class_name (parser,
4704 /*typename_keyword_p=*/false,
4705 /*template_keyword_p=*/false,
4707 /*check_dependency=*/false,
4708 /*class_head_p=*/false,
4710 if (cp_parser_parse_definitely (parser))
4713 /* In "p->S::~T", look in the scope given by "*p" as well. */
4714 else if (!done && object_scope)
4716 cp_parser_parse_tentatively (parser);
4717 parser->scope = object_scope;
4718 parser->object_scope = NULL_TREE;
4719 parser->qualifying_scope = NULL_TREE;
4721 = cp_parser_class_name (parser,
4722 /*typename_keyword_p=*/false,
4723 /*template_keyword_p=*/false,
4725 /*check_dependency=*/false,
4726 /*class_head_p=*/false,
4728 if (cp_parser_parse_definitely (parser))
4731 /* Look in the surrounding context. */
4734 parser->scope = NULL_TREE;
4735 parser->object_scope = NULL_TREE;
4736 parser->qualifying_scope = NULL_TREE;
4737 if (processing_template_decl)
4738 cp_parser_parse_tentatively (parser);
4740 = cp_parser_class_name (parser,
4741 /*typename_keyword_p=*/false,
4742 /*template_keyword_p=*/false,
4744 /*check_dependency=*/false,
4745 /*class_head_p=*/false,
4747 if (processing_template_decl
4748 && ! cp_parser_parse_definitely (parser))
4750 /* We couldn't find a type with this name, so just accept
4751 it and check for a match at instantiation time. */
4752 type_decl = cp_parser_identifier (parser);
4753 if (type_decl != error_mark_node)
4754 type_decl = build_nt (BIT_NOT_EXPR, type_decl);
4758 /* If an error occurred, assume that the name of the
4759 destructor is the same as the name of the qualifying
4760 class. That allows us to keep parsing after running
4761 into ill-formed destructor names. */
4762 if (type_decl == error_mark_node && scope)
4763 return build_nt (BIT_NOT_EXPR, scope);
4764 else if (type_decl == error_mark_node)
4765 return error_mark_node;
4767 /* Check that destructor name and scope match. */
4768 if (declarator_p && scope && !check_dtor_name (scope, type_decl))
4770 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
4771 error_at (token->location,
4772 "declaration of %<~%T%> as member of %qT",
4774 cp_parser_simulate_error (parser);
4775 return error_mark_node;
4780 A typedef-name that names a class shall not be used as the
4781 identifier in the declarator for a destructor declaration. */
4783 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
4784 && !DECL_SELF_REFERENCE_P (type_decl)
4785 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
4786 error_at (token->location,
4787 "typedef-name %qD used as destructor declarator",
4790 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
4794 if (token->keyword == RID_OPERATOR)
4798 /* This could be a template-id, so we try that first. */
4799 cp_parser_parse_tentatively (parser);
4800 /* Try a template-id. */
4801 id = cp_parser_template_id (parser, template_keyword_p,
4802 /*check_dependency_p=*/true,
4804 /* If that worked, we're done. */
4805 if (cp_parser_parse_definitely (parser))
4807 /* We still don't know whether we're looking at an
4808 operator-function-id or a conversion-function-id. */
4809 cp_parser_parse_tentatively (parser);
4810 /* Try an operator-function-id. */
4811 id = cp_parser_operator_function_id (parser);
4812 /* If that didn't work, try a conversion-function-id. */
4813 if (!cp_parser_parse_definitely (parser))
4814 id = cp_parser_conversion_function_id (parser);
4815 else if (UDLIT_OPER_P (id))
4818 const char *name = UDLIT_OP_SUFFIX (id);
4819 if (name[0] != '_' && !in_system_header)
4820 warning (0, "literal operator suffixes not preceded by %<_%>"
4821 " are reserved for future standardization");
4831 cp_parser_error (parser, "expected unqualified-id");
4832 return error_mark_node;
4836 /* Parse an (optional) nested-name-specifier.
4838 nested-name-specifier: [C++98]
4839 class-or-namespace-name :: nested-name-specifier [opt]
4840 class-or-namespace-name :: template nested-name-specifier [opt]
4842 nested-name-specifier: [C++0x]
4845 nested-name-specifier identifier ::
4846 nested-name-specifier template [opt] simple-template-id ::
4848 PARSER->SCOPE should be set appropriately before this function is
4849 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4850 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4853 Sets PARSER->SCOPE to the class (TYPE) or namespace
4854 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4855 it unchanged if there is no nested-name-specifier. Returns the new
4856 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4858 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4859 part of a declaration and/or decl-specifier. */
4862 cp_parser_nested_name_specifier_opt (cp_parser *parser,
4863 bool typename_keyword_p,
4864 bool check_dependency_p,
4866 bool is_declaration)
4868 bool success = false;
4869 cp_token_position start = 0;
4872 /* Remember where the nested-name-specifier starts. */
4873 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
4875 start = cp_lexer_token_position (parser->lexer, false);
4876 push_deferring_access_checks (dk_deferred);
4883 tree saved_qualifying_scope;
4884 bool template_keyword_p;
4886 /* Spot cases that cannot be the beginning of a
4887 nested-name-specifier. */
4888 token = cp_lexer_peek_token (parser->lexer);
4890 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4891 the already parsed nested-name-specifier. */
4892 if (token->type == CPP_NESTED_NAME_SPECIFIER)
4894 /* Grab the nested-name-specifier and continue the loop. */
4895 cp_parser_pre_parsed_nested_name_specifier (parser);
4896 /* If we originally encountered this nested-name-specifier
4897 with IS_DECLARATION set to false, we will not have
4898 resolved TYPENAME_TYPEs, so we must do so here. */
4900 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4902 new_scope = resolve_typename_type (parser->scope,
4903 /*only_current_p=*/false);
4904 if (TREE_CODE (new_scope) != TYPENAME_TYPE)
4905 parser->scope = new_scope;
4911 /* Spot cases that cannot be the beginning of a
4912 nested-name-specifier. On the second and subsequent times
4913 through the loop, we look for the `template' keyword. */
4914 if (success && token->keyword == RID_TEMPLATE)
4916 /* A template-id can start a nested-name-specifier. */
4917 else if (token->type == CPP_TEMPLATE_ID)
4919 /* DR 743: decltype can be used in a nested-name-specifier. */
4920 else if (token_is_decltype (token))
4924 /* If the next token is not an identifier, then it is
4925 definitely not a type-name or namespace-name. */
4926 if (token->type != CPP_NAME)
4928 /* If the following token is neither a `<' (to begin a
4929 template-id), nor a `::', then we are not looking at a
4930 nested-name-specifier. */
4931 token = cp_lexer_peek_nth_token (parser->lexer, 2);
4933 if (token->type == CPP_COLON
4934 && parser->colon_corrects_to_scope_p
4935 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_NAME)
4937 error_at (token->location,
4938 "found %<:%> in nested-name-specifier, expected %<::%>");
4939 token->type = CPP_SCOPE;
4942 if (token->type != CPP_SCOPE
4943 && !cp_parser_nth_token_starts_template_argument_list_p
4948 /* The nested-name-specifier is optional, so we parse
4950 cp_parser_parse_tentatively (parser);
4952 /* Look for the optional `template' keyword, if this isn't the
4953 first time through the loop. */
4955 template_keyword_p = cp_parser_optional_template_keyword (parser);
4957 template_keyword_p = false;
4959 /* Save the old scope since the name lookup we are about to do
4960 might destroy it. */
4961 old_scope = parser->scope;
4962 saved_qualifying_scope = parser->qualifying_scope;
4963 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4964 look up names in "X<T>::I" in order to determine that "Y" is
4965 a template. So, if we have a typename at this point, we make
4966 an effort to look through it. */
4968 && !typename_keyword_p
4970 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4971 parser->scope = resolve_typename_type (parser->scope,
4972 /*only_current_p=*/false);
4973 /* Parse the qualifying entity. */
4975 = cp_parser_qualifying_entity (parser,
4981 /* Look for the `::' token. */
4982 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
4984 /* If we found what we wanted, we keep going; otherwise, we're
4986 if (!cp_parser_parse_definitely (parser))
4988 bool error_p = false;
4990 /* Restore the OLD_SCOPE since it was valid before the
4991 failed attempt at finding the last
4992 class-or-namespace-name. */
4993 parser->scope = old_scope;
4994 parser->qualifying_scope = saved_qualifying_scope;
4996 /* If the next token is a decltype, and the one after that is a
4997 `::', then the decltype has failed to resolve to a class or
4998 enumeration type. Give this error even when parsing
4999 tentatively since it can't possibly be valid--and we're going
5000 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5001 won't get another chance.*/
5002 if (cp_lexer_next_token_is (parser->lexer, CPP_DECLTYPE)
5003 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
5006 token = cp_lexer_consume_token (parser->lexer);
5007 error_at (token->location, "decltype evaluates to %qT, "
5008 "which is not a class or enumeration type",
5010 parser->scope = error_mark_node;
5014 cp_lexer_consume_token (parser->lexer);
5017 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
5019 /* If the next token is an identifier, and the one after
5020 that is a `::', then any valid interpretation would have
5021 found a class-or-namespace-name. */
5022 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
5023 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
5025 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
5028 token = cp_lexer_consume_token (parser->lexer);
5031 if (!token->ambiguous_p)
5034 tree ambiguous_decls;
5036 decl = cp_parser_lookup_name (parser, token->u.value,
5038 /*is_template=*/false,
5039 /*is_namespace=*/false,
5040 /*check_dependency=*/true,
5043 if (TREE_CODE (decl) == TEMPLATE_DECL)
5044 error_at (token->location,
5045 "%qD used without template parameters",
5047 else if (ambiguous_decls)
5049 error_at (token->location,
5050 "reference to %qD is ambiguous",
5052 print_candidates (ambiguous_decls);
5053 decl = error_mark_node;
5057 if (cxx_dialect != cxx98)
5058 cp_parser_name_lookup_error
5059 (parser, token->u.value, decl, NLE_NOT_CXX98,
5062 cp_parser_name_lookup_error
5063 (parser, token->u.value, decl, NLE_CXX98,
5067 parser->scope = error_mark_node;
5069 /* Treat this as a successful nested-name-specifier
5074 If the name found is not a class-name (clause
5075 _class_) or namespace-name (_namespace.def_), the
5076 program is ill-formed. */
5079 cp_lexer_consume_token (parser->lexer);
5083 /* We've found one valid nested-name-specifier. */
5085 /* Name lookup always gives us a DECL. */
5086 if (TREE_CODE (new_scope) == TYPE_DECL)
5087 new_scope = TREE_TYPE (new_scope);
5088 /* Uses of "template" must be followed by actual templates. */
5089 if (template_keyword_p
5090 && !(CLASS_TYPE_P (new_scope)
5091 && ((CLASSTYPE_USE_TEMPLATE (new_scope)
5092 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope)))
5093 || CLASSTYPE_IS_TEMPLATE (new_scope)))
5094 && !(TREE_CODE (new_scope) == TYPENAME_TYPE
5095 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope))
5096 == TEMPLATE_ID_EXPR)))
5097 permerror (input_location, TYPE_P (new_scope)
5098 ? G_("%qT is not a template")
5099 : G_("%qD is not a template"),
5101 /* If it is a class scope, try to complete it; we are about to
5102 be looking up names inside the class. */
5103 if (TYPE_P (new_scope)
5104 /* Since checking types for dependency can be expensive,
5105 avoid doing it if the type is already complete. */
5106 && !COMPLETE_TYPE_P (new_scope)
5107 /* Do not try to complete dependent types. */
5108 && !dependent_type_p (new_scope))
5110 new_scope = complete_type (new_scope);
5111 /* If it is a typedef to current class, use the current
5112 class instead, as the typedef won't have any names inside
5114 if (!COMPLETE_TYPE_P (new_scope)
5115 && currently_open_class (new_scope))
5116 new_scope = TYPE_MAIN_VARIANT (new_scope);
5118 /* Make sure we look in the right scope the next time through
5120 parser->scope = new_scope;
5123 /* If parsing tentatively, replace the sequence of tokens that makes
5124 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5125 token. That way, should we re-parse the token stream, we will
5126 not have to repeat the effort required to do the parse, nor will
5127 we issue duplicate error messages. */
5128 if (success && start)
5132 token = cp_lexer_token_at (parser->lexer, start);
5133 /* Reset the contents of the START token. */
5134 token->type = CPP_NESTED_NAME_SPECIFIER;
5135 /* Retrieve any deferred checks. Do not pop this access checks yet
5136 so the memory will not be reclaimed during token replacing below. */
5137 token->u.tree_check_value = ggc_alloc_cleared_tree_check ();
5138 token->u.tree_check_value->value = parser->scope;
5139 token->u.tree_check_value->checks = get_deferred_access_checks ();
5140 token->u.tree_check_value->qualifying_scope =
5141 parser->qualifying_scope;
5142 token->keyword = RID_MAX;
5144 /* Purge all subsequent tokens. */
5145 cp_lexer_purge_tokens_after (parser->lexer, start);
5149 pop_to_parent_deferring_access_checks ();
5151 return success ? parser->scope : NULL_TREE;
5154 /* Parse a nested-name-specifier. See
5155 cp_parser_nested_name_specifier_opt for details. This function
5156 behaves identically, except that it will an issue an error if no
5157 nested-name-specifier is present. */
5160 cp_parser_nested_name_specifier (cp_parser *parser,
5161 bool typename_keyword_p,
5162 bool check_dependency_p,
5164 bool is_declaration)
5168 /* Look for the nested-name-specifier. */
5169 scope = cp_parser_nested_name_specifier_opt (parser,
5174 /* If it was not present, issue an error message. */
5177 cp_parser_error (parser, "expected nested-name-specifier");
5178 parser->scope = NULL_TREE;
5184 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5185 this is either a class-name or a namespace-name (which corresponds
5186 to the class-or-namespace-name production in the grammar). For
5187 C++0x, it can also be a type-name that refers to an enumeration
5188 type or a simple-template-id.
5190 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5191 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5192 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5193 TYPE_P is TRUE iff the next name should be taken as a class-name,
5194 even the same name is declared to be another entity in the same
5197 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5198 specified by the class-or-namespace-name. If neither is found the
5199 ERROR_MARK_NODE is returned. */
5202 cp_parser_qualifying_entity (cp_parser *parser,
5203 bool typename_keyword_p,
5204 bool template_keyword_p,
5205 bool check_dependency_p,
5207 bool is_declaration)
5210 tree saved_qualifying_scope;
5211 tree saved_object_scope;
5214 bool successful_parse_p;
5216 /* DR 743: decltype can appear in a nested-name-specifier. */
5217 if (cp_lexer_next_token_is_decltype (parser->lexer))
5219 scope = cp_parser_decltype (parser);
5220 if (TREE_CODE (scope) != ENUMERAL_TYPE
5221 && !MAYBE_CLASS_TYPE_P (scope))
5223 cp_parser_simulate_error (parser);
5224 return error_mark_node;
5226 if (TYPE_NAME (scope))
5227 scope = TYPE_NAME (scope);
5231 /* Before we try to parse the class-name, we must save away the
5232 current PARSER->SCOPE since cp_parser_class_name will destroy
5234 saved_scope = parser->scope;
5235 saved_qualifying_scope = parser->qualifying_scope;
5236 saved_object_scope = parser->object_scope;
5237 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5238 there is no need to look for a namespace-name. */
5239 only_class_p = template_keyword_p
5240 || (saved_scope && TYPE_P (saved_scope) && cxx_dialect == cxx98);
5242 cp_parser_parse_tentatively (parser);
5243 scope = cp_parser_class_name (parser,
5246 type_p ? class_type : none_type,
5248 /*class_head_p=*/false,
5250 successful_parse_p = only_class_p || cp_parser_parse_definitely (parser);
5251 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5253 && cxx_dialect != cxx98
5254 && !successful_parse_p)
5256 /* Restore the saved scope. */
5257 parser->scope = saved_scope;
5258 parser->qualifying_scope = saved_qualifying_scope;
5259 parser->object_scope = saved_object_scope;
5261 /* Parse tentatively. */
5262 cp_parser_parse_tentatively (parser);
5264 /* Parse a type-name */
5265 scope = cp_parser_type_name (parser);
5267 /* "If the name found does not designate a namespace or a class,
5268 enumeration, or dependent type, the program is ill-formed."
5270 We cover classes and dependent types above and namespaces below,
5271 so this code is only looking for enums. */
5272 if (!scope || TREE_CODE (scope) != TYPE_DECL
5273 || TREE_CODE (TREE_TYPE (scope)) != ENUMERAL_TYPE)
5274 cp_parser_simulate_error (parser);
5276 successful_parse_p = cp_parser_parse_definitely (parser);
5278 /* If that didn't work, try for a namespace-name. */
5279 if (!only_class_p && !successful_parse_p)
5281 /* Restore the saved scope. */
5282 parser->scope = saved_scope;
5283 parser->qualifying_scope = saved_qualifying_scope;
5284 parser->object_scope = saved_object_scope;
5285 /* If we are not looking at an identifier followed by the scope
5286 resolution operator, then this is not part of a
5287 nested-name-specifier. (Note that this function is only used
5288 to parse the components of a nested-name-specifier.) */
5289 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
5290 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
5291 return error_mark_node;
5292 scope = cp_parser_namespace_name (parser);
5298 /* Parse a postfix-expression.
5302 postfix-expression [ expression ]
5303 postfix-expression ( expression-list [opt] )
5304 simple-type-specifier ( expression-list [opt] )
5305 typename :: [opt] nested-name-specifier identifier
5306 ( expression-list [opt] )
5307 typename :: [opt] nested-name-specifier template [opt] template-id
5308 ( expression-list [opt] )
5309 postfix-expression . template [opt] id-expression
5310 postfix-expression -> template [opt] id-expression
5311 postfix-expression . pseudo-destructor-name
5312 postfix-expression -> pseudo-destructor-name
5313 postfix-expression ++
5314 postfix-expression --
5315 dynamic_cast < type-id > ( expression )
5316 static_cast < type-id > ( expression )
5317 reinterpret_cast < type-id > ( expression )
5318 const_cast < type-id > ( expression )
5319 typeid ( expression )
5325 ( type-id ) { initializer-list , [opt] }
5327 This extension is a GNU version of the C99 compound-literal
5328 construct. (The C99 grammar uses `type-name' instead of `type-id',
5329 but they are essentially the same concept.)
5331 If ADDRESS_P is true, the postfix expression is the operand of the
5332 `&' operator. CAST_P is true if this expression is the target of a
5335 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5336 class member access expressions [expr.ref].
5338 Returns a representation of the expression. */
5341 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p,
5342 bool member_access_only_p,
5343 cp_id_kind * pidk_return)
5347 cp_id_kind idk = CP_ID_KIND_NONE;
5348 tree postfix_expression = NULL_TREE;
5349 bool is_member_access = false;
5351 /* Peek at the next token. */
5352 token = cp_lexer_peek_token (parser->lexer);
5353 /* Some of the productions are determined by keywords. */
5354 keyword = token->keyword;
5364 const char *saved_message;
5366 /* All of these can be handled in the same way from the point
5367 of view of parsing. Begin by consuming the token
5368 identifying the cast. */
5369 cp_lexer_consume_token (parser->lexer);
5371 /* New types cannot be defined in the cast. */
5372 saved_message = parser->type_definition_forbidden_message;
5373 parser->type_definition_forbidden_message
5374 = G_("types may not be defined in casts");
5376 /* Look for the opening `<'. */
5377 cp_parser_require (parser, CPP_LESS, RT_LESS);
5378 /* Parse the type to which we are casting. */
5379 type = cp_parser_type_id (parser);
5380 /* Look for the closing `>'. */
5381 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
5382 /* Restore the old message. */
5383 parser->type_definition_forbidden_message = saved_message;
5385 /* And the expression which is being cast. */
5386 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
5387 expression = cp_parser_expression (parser, /*cast_p=*/true, & idk);
5388 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5390 /* Only type conversions to integral or enumeration types
5391 can be used in constant-expressions. */
5392 if (!cast_valid_in_integral_constant_expression_p (type)
5393 && cp_parser_non_integral_constant_expression (parser, NIC_CAST))
5394 return error_mark_node;
5400 = build_dynamic_cast (type, expression, tf_warning_or_error);
5404 = build_static_cast (type, expression, tf_warning_or_error);
5408 = build_reinterpret_cast (type, expression,
5409 tf_warning_or_error);
5413 = build_const_cast (type, expression, tf_warning_or_error);
5424 const char *saved_message;
5425 bool saved_in_type_id_in_expr_p;
5427 /* Consume the `typeid' token. */
5428 cp_lexer_consume_token (parser->lexer);
5429 /* Look for the `(' token. */
5430 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
5431 /* Types cannot be defined in a `typeid' expression. */
5432 saved_message = parser->type_definition_forbidden_message;
5433 parser->type_definition_forbidden_message
5434 = G_("types may not be defined in a %<typeid%> expression");
5435 /* We can't be sure yet whether we're looking at a type-id or an
5437 cp_parser_parse_tentatively (parser);
5438 /* Try a type-id first. */
5439 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5440 parser->in_type_id_in_expr_p = true;
5441 type = cp_parser_type_id (parser);
5442 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5443 /* Look for the `)' token. Otherwise, we can't be sure that
5444 we're not looking at an expression: consider `typeid (int
5445 (3))', for example. */
5446 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5447 /* If all went well, simply lookup the type-id. */
5448 if (cp_parser_parse_definitely (parser))
5449 postfix_expression = get_typeid (type);
5450 /* Otherwise, fall back to the expression variant. */
5455 /* Look for an expression. */
5456 expression = cp_parser_expression (parser, /*cast_p=*/false, & idk);
5457 /* Compute its typeid. */
5458 postfix_expression = build_typeid (expression);
5459 /* Look for the `)' token. */
5460 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5462 /* Restore the saved message. */
5463 parser->type_definition_forbidden_message = saved_message;
5464 /* `typeid' may not appear in an integral constant expression. */
5465 if (cp_parser_non_integral_constant_expression (parser, NIC_TYPEID))
5466 return error_mark_node;
5473 /* The syntax permitted here is the same permitted for an
5474 elaborated-type-specifier. */
5475 type = cp_parser_elaborated_type_specifier (parser,
5476 /*is_friend=*/false,
5477 /*is_declaration=*/false);
5478 postfix_expression = cp_parser_functional_cast (parser, type);
5486 /* If the next thing is a simple-type-specifier, we may be
5487 looking at a functional cast. We could also be looking at
5488 an id-expression. So, we try the functional cast, and if
5489 that doesn't work we fall back to the primary-expression. */
5490 cp_parser_parse_tentatively (parser);
5491 /* Look for the simple-type-specifier. */
5492 type = cp_parser_simple_type_specifier (parser,
5493 /*decl_specs=*/NULL,
5494 CP_PARSER_FLAGS_NONE);
5495 /* Parse the cast itself. */
5496 if (!cp_parser_error_occurred (parser))
5498 = cp_parser_functional_cast (parser, type);
5499 /* If that worked, we're done. */
5500 if (cp_parser_parse_definitely (parser))
5503 /* If the functional-cast didn't work out, try a
5504 compound-literal. */
5505 if (cp_parser_allow_gnu_extensions_p (parser)
5506 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5508 VEC(constructor_elt,gc) *initializer_list = NULL;
5509 bool saved_in_type_id_in_expr_p;
5511 cp_parser_parse_tentatively (parser);
5512 /* Consume the `('. */
5513 cp_lexer_consume_token (parser->lexer);
5514 /* Parse the type. */
5515 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5516 parser->in_type_id_in_expr_p = true;
5517 type = cp_parser_type_id (parser);
5518 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5519 /* Look for the `)'. */
5520 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5521 /* Look for the `{'. */
5522 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
5523 /* If things aren't going well, there's no need to
5525 if (!cp_parser_error_occurred (parser))
5527 bool non_constant_p;
5528 /* Parse the initializer-list. */
5530 = cp_parser_initializer_list (parser, &non_constant_p);
5531 /* Allow a trailing `,'. */
5532 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
5533 cp_lexer_consume_token (parser->lexer);
5534 /* Look for the final `}'. */
5535 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
5537 /* If that worked, we're definitely looking at a
5538 compound-literal expression. */
5539 if (cp_parser_parse_definitely (parser))
5541 /* Warn the user that a compound literal is not
5542 allowed in standard C++. */
5543 pedwarn (input_location, OPT_pedantic, "ISO C++ forbids compound-literals");
5544 /* For simplicity, we disallow compound literals in
5545 constant-expressions. We could
5546 allow compound literals of integer type, whose
5547 initializer was a constant, in constant
5548 expressions. Permitting that usage, as a further
5549 extension, would not change the meaning of any
5550 currently accepted programs. (Of course, as
5551 compound literals are not part of ISO C++, the
5552 standard has nothing to say.) */
5553 if (cp_parser_non_integral_constant_expression (parser,
5556 postfix_expression = error_mark_node;
5559 /* Form the representation of the compound-literal. */
5561 = (finish_compound_literal
5562 (type, build_constructor (init_list_type_node,
5564 tf_warning_or_error));
5569 /* It must be a primary-expression. */
5571 = cp_parser_primary_expression (parser, address_p, cast_p,
5572 /*template_arg_p=*/false,
5578 /* Keep looping until the postfix-expression is complete. */
5581 if (idk == CP_ID_KIND_UNQUALIFIED
5582 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
5583 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
5584 /* It is not a Koenig lookup function call. */
5586 = unqualified_name_lookup_error (postfix_expression);
5588 /* Peek at the next token. */
5589 token = cp_lexer_peek_token (parser->lexer);
5591 switch (token->type)
5593 case CPP_OPEN_SQUARE:
5595 = cp_parser_postfix_open_square_expression (parser,
5598 idk = CP_ID_KIND_NONE;
5599 is_member_access = false;
5602 case CPP_OPEN_PAREN:
5603 /* postfix-expression ( expression-list [opt] ) */
5606 bool is_builtin_constant_p;
5607 bool saved_integral_constant_expression_p = false;
5608 bool saved_non_integral_constant_expression_p = false;
5611 is_member_access = false;
5613 is_builtin_constant_p
5614 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
5615 if (is_builtin_constant_p)
5617 /* The whole point of __builtin_constant_p is to allow
5618 non-constant expressions to appear as arguments. */
5619 saved_integral_constant_expression_p
5620 = parser->integral_constant_expression_p;
5621 saved_non_integral_constant_expression_p
5622 = parser->non_integral_constant_expression_p;
5623 parser->integral_constant_expression_p = false;
5625 args = (cp_parser_parenthesized_expression_list
5627 /*cast_p=*/false, /*allow_expansion_p=*/true,
5628 /*non_constant_p=*/NULL));
5629 if (is_builtin_constant_p)
5631 parser->integral_constant_expression_p
5632 = saved_integral_constant_expression_p;
5633 parser->non_integral_constant_expression_p
5634 = saved_non_integral_constant_expression_p;
5639 postfix_expression = error_mark_node;
5643 /* Function calls are not permitted in
5644 constant-expressions. */
5645 if (! builtin_valid_in_constant_expr_p (postfix_expression)
5646 && cp_parser_non_integral_constant_expression (parser,
5649 postfix_expression = error_mark_node;
5650 release_tree_vector (args);
5655 if (idk == CP_ID_KIND_UNQUALIFIED
5656 || idk == CP_ID_KIND_TEMPLATE_ID)
5658 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
5660 if (!VEC_empty (tree, args))
5663 if (!any_type_dependent_arguments_p (args))
5665 = perform_koenig_lookup (postfix_expression, args,
5666 /*include_std=*/false,
5667 tf_warning_or_error);
5671 = unqualified_fn_lookup_error (postfix_expression);
5673 /* We do not perform argument-dependent lookup if
5674 normal lookup finds a non-function, in accordance
5675 with the expected resolution of DR 218. */
5676 else if (!VEC_empty (tree, args)
5677 && is_overloaded_fn (postfix_expression))
5679 tree fn = get_first_fn (postfix_expression);
5680 fn = STRIP_TEMPLATE (fn);
5682 /* Do not do argument dependent lookup if regular
5683 lookup finds a member function or a block-scope
5684 function declaration. [basic.lookup.argdep]/3 */
5685 if (!DECL_FUNCTION_MEMBER_P (fn)
5686 && !DECL_LOCAL_FUNCTION_P (fn))
5689 if (!any_type_dependent_arguments_p (args))
5691 = perform_koenig_lookup (postfix_expression, args,
5692 /*include_std=*/false,
5693 tf_warning_or_error);
5698 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
5700 tree instance = TREE_OPERAND (postfix_expression, 0);
5701 tree fn = TREE_OPERAND (postfix_expression, 1);
5703 if (processing_template_decl
5704 && (type_dependent_expression_p (instance)
5705 || (!BASELINK_P (fn)
5706 && TREE_CODE (fn) != FIELD_DECL)
5707 || type_dependent_expression_p (fn)
5708 || any_type_dependent_arguments_p (args)))
5711 = build_nt_call_vec (postfix_expression, args);
5712 release_tree_vector (args);
5716 if (BASELINK_P (fn))
5719 = (build_new_method_call
5720 (instance, fn, &args, NULL_TREE,
5721 (idk == CP_ID_KIND_QUALIFIED
5722 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
5725 tf_warning_or_error));
5729 = finish_call_expr (postfix_expression, &args,
5730 /*disallow_virtual=*/false,
5732 tf_warning_or_error);
5734 else if (TREE_CODE (postfix_expression) == OFFSET_REF
5735 || TREE_CODE (postfix_expression) == MEMBER_REF
5736 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
5737 postfix_expression = (build_offset_ref_call_from_tree
5738 (postfix_expression, &args));
5739 else if (idk == CP_ID_KIND_QUALIFIED)
5740 /* A call to a static class member, or a namespace-scope
5743 = finish_call_expr (postfix_expression, &args,
5744 /*disallow_virtual=*/true,
5746 tf_warning_or_error);
5748 /* All other function calls. */
5750 = finish_call_expr (postfix_expression, &args,
5751 /*disallow_virtual=*/false,
5753 tf_warning_or_error);
5755 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5756 idk = CP_ID_KIND_NONE;
5758 release_tree_vector (args);
5764 /* postfix-expression . template [opt] id-expression
5765 postfix-expression . pseudo-destructor-name
5766 postfix-expression -> template [opt] id-expression
5767 postfix-expression -> pseudo-destructor-name */
5769 /* Consume the `.' or `->' operator. */
5770 cp_lexer_consume_token (parser->lexer);
5773 = cp_parser_postfix_dot_deref_expression (parser, token->type,
5778 is_member_access = true;
5782 /* postfix-expression ++ */
5783 /* Consume the `++' token. */
5784 cp_lexer_consume_token (parser->lexer);
5785 /* Generate a representation for the complete expression. */
5787 = finish_increment_expr (postfix_expression,
5788 POSTINCREMENT_EXPR);
5789 /* Increments may not appear in constant-expressions. */
5790 if (cp_parser_non_integral_constant_expression (parser, NIC_INC))
5791 postfix_expression = error_mark_node;
5792 idk = CP_ID_KIND_NONE;
5793 is_member_access = false;
5796 case CPP_MINUS_MINUS:
5797 /* postfix-expression -- */
5798 /* Consume the `--' token. */
5799 cp_lexer_consume_token (parser->lexer);
5800 /* Generate a representation for the complete expression. */
5802 = finish_increment_expr (postfix_expression,
5803 POSTDECREMENT_EXPR);
5804 /* Decrements may not appear in constant-expressions. */
5805 if (cp_parser_non_integral_constant_expression (parser, NIC_DEC))
5806 postfix_expression = error_mark_node;
5807 idk = CP_ID_KIND_NONE;
5808 is_member_access = false;
5812 if (pidk_return != NULL)
5813 * pidk_return = idk;
5814 if (member_access_only_p)
5815 return is_member_access? postfix_expression : error_mark_node;
5817 return postfix_expression;
5821 /* We should never get here. */
5823 return error_mark_node;
5826 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5827 by cp_parser_builtin_offsetof. We're looking for
5829 postfix-expression [ expression ]
5831 FOR_OFFSETOF is set if we're being called in that context, which
5832 changes how we deal with integer constant expressions. */
5835 cp_parser_postfix_open_square_expression (cp_parser *parser,
5836 tree postfix_expression,
5841 /* Consume the `[' token. */
5842 cp_lexer_consume_token (parser->lexer);
5844 /* Parse the index expression. */
5845 /* ??? For offsetof, there is a question of what to allow here. If
5846 offsetof is not being used in an integral constant expression context,
5847 then we *could* get the right answer by computing the value at runtime.
5848 If we are in an integral constant expression context, then we might
5849 could accept any constant expression; hard to say without analysis.
5850 Rather than open the barn door too wide right away, allow only integer
5851 constant expressions here. */
5853 index = cp_parser_constant_expression (parser, false, NULL);
5855 index = cp_parser_expression (parser, /*cast_p=*/false, NULL);
5857 /* Look for the closing `]'. */
5858 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
5860 /* Build the ARRAY_REF. */
5861 postfix_expression = grok_array_decl (postfix_expression, index);
5863 /* When not doing offsetof, array references are not permitted in
5864 constant-expressions. */
5866 && (cp_parser_non_integral_constant_expression (parser, NIC_ARRAY_REF)))
5867 postfix_expression = error_mark_node;
5869 return postfix_expression;
5872 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5873 by cp_parser_builtin_offsetof. We're looking for
5875 postfix-expression . template [opt] id-expression
5876 postfix-expression . pseudo-destructor-name
5877 postfix-expression -> template [opt] id-expression
5878 postfix-expression -> pseudo-destructor-name
5880 FOR_OFFSETOF is set if we're being called in that context. That sorta
5881 limits what of the above we'll actually accept, but nevermind.
5882 TOKEN_TYPE is the "." or "->" token, which will already have been
5883 removed from the stream. */
5886 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
5887 enum cpp_ttype token_type,
5888 tree postfix_expression,
5889 bool for_offsetof, cp_id_kind *idk,
5890 location_t location)
5894 bool pseudo_destructor_p;
5895 tree scope = NULL_TREE;
5897 /* If this is a `->' operator, dereference the pointer. */
5898 if (token_type == CPP_DEREF)
5899 postfix_expression = build_x_arrow (postfix_expression);
5900 /* Check to see whether or not the expression is type-dependent. */
5901 dependent_p = type_dependent_expression_p (postfix_expression);
5902 /* The identifier following the `->' or `.' is not qualified. */
5903 parser->scope = NULL_TREE;
5904 parser->qualifying_scope = NULL_TREE;
5905 parser->object_scope = NULL_TREE;
5906 *idk = CP_ID_KIND_NONE;
5908 /* Enter the scope corresponding to the type of the object
5909 given by the POSTFIX_EXPRESSION. */
5910 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
5912 scope = TREE_TYPE (postfix_expression);
5913 /* According to the standard, no expression should ever have
5914 reference type. Unfortunately, we do not currently match
5915 the standard in this respect in that our internal representation
5916 of an expression may have reference type even when the standard
5917 says it does not. Therefore, we have to manually obtain the
5918 underlying type here. */
5919 scope = non_reference (scope);
5920 /* The type of the POSTFIX_EXPRESSION must be complete. */
5921 if (scope == unknown_type_node)
5923 error_at (location, "%qE does not have class type",
5924 postfix_expression);
5927 /* Unlike the object expression in other contexts, *this is not
5928 required to be of complete type for purposes of class member
5929 access (5.2.5) outside the member function body. */
5930 else if (scope != current_class_ref
5931 && !(processing_template_decl && scope == current_class_type))
5932 scope = complete_type_or_else (scope, NULL_TREE);
5933 /* Let the name lookup machinery know that we are processing a
5934 class member access expression. */
5935 parser->context->object_type = scope;
5936 /* If something went wrong, we want to be able to discern that case,
5937 as opposed to the case where there was no SCOPE due to the type
5938 of expression being dependent. */
5940 scope = error_mark_node;
5941 /* If the SCOPE was erroneous, make the various semantic analysis
5942 functions exit quickly -- and without issuing additional error
5944 if (scope == error_mark_node)
5945 postfix_expression = error_mark_node;
5948 /* Assume this expression is not a pseudo-destructor access. */
5949 pseudo_destructor_p = false;
5951 /* If the SCOPE is a scalar type, then, if this is a valid program,
5952 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5953 is type dependent, it can be pseudo-destructor-name or something else.
5954 Try to parse it as pseudo-destructor-name first. */
5955 if ((scope && SCALAR_TYPE_P (scope)) || dependent_p)
5960 cp_parser_parse_tentatively (parser);
5961 /* Parse the pseudo-destructor-name. */
5963 cp_parser_pseudo_destructor_name (parser, &s, &type);
5965 && (cp_parser_error_occurred (parser)
5966 || TREE_CODE (type) != TYPE_DECL
5967 || !SCALAR_TYPE_P (TREE_TYPE (type))))
5968 cp_parser_abort_tentative_parse (parser);
5969 else if (cp_parser_parse_definitely (parser))
5971 pseudo_destructor_p = true;
5973 = finish_pseudo_destructor_expr (postfix_expression,
5974 s, TREE_TYPE (type));
5978 if (!pseudo_destructor_p)
5980 /* If the SCOPE is not a scalar type, we are looking at an
5981 ordinary class member access expression, rather than a
5982 pseudo-destructor-name. */
5984 cp_token *token = cp_lexer_peek_token (parser->lexer);
5985 /* Parse the id-expression. */
5986 name = (cp_parser_id_expression
5988 cp_parser_optional_template_keyword (parser),
5989 /*check_dependency_p=*/true,
5991 /*declarator_p=*/false,
5992 /*optional_p=*/false));
5993 /* In general, build a SCOPE_REF if the member name is qualified.
5994 However, if the name was not dependent and has already been
5995 resolved; there is no need to build the SCOPE_REF. For example;
5997 struct X { void f(); };
5998 template <typename T> void f(T* t) { t->X::f(); }
6000 Even though "t" is dependent, "X::f" is not and has been resolved
6001 to a BASELINK; there is no need to include scope information. */
6003 /* But we do need to remember that there was an explicit scope for
6004 virtual function calls. */
6006 *idk = CP_ID_KIND_QUALIFIED;
6008 /* If the name is a template-id that names a type, we will get a
6009 TYPE_DECL here. That is invalid code. */
6010 if (TREE_CODE (name) == TYPE_DECL)
6012 error_at (token->location, "invalid use of %qD", name);
6013 postfix_expression = error_mark_node;
6017 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
6019 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
6021 error_at (token->location, "%<%D::%D%> is not a class member",
6022 parser->scope, name);
6023 postfix_expression = error_mark_node;
6026 name = build_qualified_name (/*type=*/NULL_TREE,
6030 parser->scope = NULL_TREE;
6031 parser->qualifying_scope = NULL_TREE;
6032 parser->object_scope = NULL_TREE;
6034 if (scope && name && BASELINK_P (name))
6035 adjust_result_of_qualified_name_lookup
6036 (name, BINFO_TYPE (BASELINK_ACCESS_BINFO (name)), scope);
6038 = finish_class_member_access_expr (postfix_expression, name,
6040 tf_warning_or_error);
6044 /* We no longer need to look up names in the scope of the object on
6045 the left-hand side of the `.' or `->' operator. */
6046 parser->context->object_type = NULL_TREE;
6048 /* Outside of offsetof, these operators may not appear in
6049 constant-expressions. */
6051 && (cp_parser_non_integral_constant_expression
6052 (parser, token_type == CPP_DEREF ? NIC_ARROW : NIC_POINT)))
6053 postfix_expression = error_mark_node;
6055 return postfix_expression;
6058 /* Parse a parenthesized expression-list.
6061 assignment-expression
6062 expression-list, assignment-expression
6067 identifier, expression-list
6069 CAST_P is true if this expression is the target of a cast.
6071 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6074 Returns a vector of trees. Each element is a representation of an
6075 assignment-expression. NULL is returned if the ( and or ) are
6076 missing. An empty, but allocated, vector is returned on no
6077 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6078 if we are parsing an attribute list for an attribute that wants a
6079 plain identifier argument, normal_attr for an attribute that wants
6080 an expression, or non_attr if we aren't parsing an attribute list. If
6081 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6082 not all of the expressions in the list were constant. */
6084 static VEC(tree,gc) *
6085 cp_parser_parenthesized_expression_list (cp_parser* parser,
6086 int is_attribute_list,
6088 bool allow_expansion_p,
6089 bool *non_constant_p)
6091 VEC(tree,gc) *expression_list;
6092 bool fold_expr_p = is_attribute_list != non_attr;
6093 tree identifier = NULL_TREE;
6094 bool saved_greater_than_is_operator_p;
6096 /* Assume all the expressions will be constant. */
6098 *non_constant_p = false;
6100 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
6103 expression_list = make_tree_vector ();
6105 /* Within a parenthesized expression, a `>' token is always
6106 the greater-than operator. */
6107 saved_greater_than_is_operator_p
6108 = parser->greater_than_is_operator_p;
6109 parser->greater_than_is_operator_p = true;
6111 /* Consume expressions until there are no more. */
6112 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6117 /* At the beginning of attribute lists, check to see if the
6118 next token is an identifier. */
6119 if (is_attribute_list == id_attr
6120 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
6124 /* Consume the identifier. */
6125 token = cp_lexer_consume_token (parser->lexer);
6126 /* Save the identifier. */
6127 identifier = token->u.value;
6131 bool expr_non_constant_p;
6133 /* Parse the next assignment-expression. */
6134 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6136 /* A braced-init-list. */
6137 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
6138 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
6139 if (non_constant_p && expr_non_constant_p)
6140 *non_constant_p = true;
6142 else if (non_constant_p)
6144 expr = (cp_parser_constant_expression
6145 (parser, /*allow_non_constant_p=*/true,
6146 &expr_non_constant_p));
6147 if (expr_non_constant_p)
6148 *non_constant_p = true;
6151 expr = cp_parser_assignment_expression (parser, cast_p, NULL);
6154 expr = fold_non_dependent_expr (expr);
6156 /* If we have an ellipsis, then this is an expression
6158 if (allow_expansion_p
6159 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
6161 /* Consume the `...'. */
6162 cp_lexer_consume_token (parser->lexer);
6164 /* Build the argument pack. */
6165 expr = make_pack_expansion (expr);
6168 /* Add it to the list. We add error_mark_node
6169 expressions to the list, so that we can still tell if
6170 the correct form for a parenthesized expression-list
6171 is found. That gives better errors. */
6172 VEC_safe_push (tree, gc, expression_list, expr);
6174 if (expr == error_mark_node)
6178 /* After the first item, attribute lists look the same as
6179 expression lists. */
6180 is_attribute_list = non_attr;
6183 /* If the next token isn't a `,', then we are done. */
6184 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6187 /* Otherwise, consume the `,' and keep going. */
6188 cp_lexer_consume_token (parser->lexer);
6191 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
6196 /* We try and resync to an unnested comma, as that will give the
6197 user better diagnostics. */
6198 ending = cp_parser_skip_to_closing_parenthesis (parser,
6199 /*recovering=*/true,
6201 /*consume_paren=*/true);
6206 parser->greater_than_is_operator_p
6207 = saved_greater_than_is_operator_p;
6212 parser->greater_than_is_operator_p
6213 = saved_greater_than_is_operator_p;
6216 VEC_safe_insert (tree, gc, expression_list, 0, identifier);
6218 return expression_list;
6221 /* Parse a pseudo-destructor-name.
6223 pseudo-destructor-name:
6224 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6225 :: [opt] nested-name-specifier template template-id :: ~ type-name
6226 :: [opt] nested-name-specifier [opt] ~ type-name
6228 If either of the first two productions is used, sets *SCOPE to the
6229 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6230 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6231 or ERROR_MARK_NODE if the parse fails. */
6234 cp_parser_pseudo_destructor_name (cp_parser* parser,
6238 bool nested_name_specifier_p;
6240 /* Assume that things will not work out. */
6241 *type = error_mark_node;
6243 /* Look for the optional `::' operator. */
6244 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
6245 /* Look for the optional nested-name-specifier. */
6246 nested_name_specifier_p
6247 = (cp_parser_nested_name_specifier_opt (parser,
6248 /*typename_keyword_p=*/false,
6249 /*check_dependency_p=*/true,
6251 /*is_declaration=*/false)
6253 /* Now, if we saw a nested-name-specifier, we might be doing the
6254 second production. */
6255 if (nested_name_specifier_p
6256 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
6258 /* Consume the `template' keyword. */
6259 cp_lexer_consume_token (parser->lexer);
6260 /* Parse the template-id. */
6261 cp_parser_template_id (parser,
6262 /*template_keyword_p=*/true,
6263 /*check_dependency_p=*/false,
6264 /*is_declaration=*/true);
6265 /* Look for the `::' token. */
6266 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
6268 /* If the next token is not a `~', then there might be some
6269 additional qualification. */
6270 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
6272 /* At this point, we're looking for "type-name :: ~". The type-name
6273 must not be a class-name, since this is a pseudo-destructor. So,
6274 it must be either an enum-name, or a typedef-name -- both of which
6275 are just identifiers. So, we peek ahead to check that the "::"
6276 and "~" tokens are present; if they are not, then we can avoid
6277 calling type_name. */
6278 if (cp_lexer_peek_token (parser->lexer)->type != CPP_NAME
6279 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE
6280 || cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_COMPL)
6282 cp_parser_error (parser, "non-scalar type");
6286 /* Look for the type-name. */
6287 *scope = TREE_TYPE (cp_parser_nonclass_name (parser));
6288 if (*scope == error_mark_node)
6291 /* Look for the `::' token. */
6292 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
6297 /* Look for the `~'. */
6298 cp_parser_require (parser, CPP_COMPL, RT_COMPL);
6300 /* Once we see the ~, this has to be a pseudo-destructor. */
6301 if (!processing_template_decl && !cp_parser_error_occurred (parser))
6302 cp_parser_commit_to_tentative_parse (parser);
6304 /* Look for the type-name again. We are not responsible for
6305 checking that it matches the first type-name. */
6306 *type = cp_parser_nonclass_name (parser);
6309 /* Parse a unary-expression.
6315 unary-operator cast-expression
6316 sizeof unary-expression
6318 alignof ( type-id ) [C++0x]
6325 __extension__ cast-expression
6326 __alignof__ unary-expression
6327 __alignof__ ( type-id )
6328 alignof unary-expression [C++0x]
6329 __real__ cast-expression
6330 __imag__ cast-expression
6333 ADDRESS_P is true iff the unary-expression is appearing as the
6334 operand of the `&' operator. CAST_P is true if this expression is
6335 the target of a cast.
6337 Returns a representation of the expression. */
6340 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p,
6344 enum tree_code unary_operator;
6346 /* Peek at the next token. */
6347 token = cp_lexer_peek_token (parser->lexer);
6348 /* Some keywords give away the kind of expression. */
6349 if (token->type == CPP_KEYWORD)
6351 enum rid keyword = token->keyword;
6361 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
6362 /* Consume the token. */
6363 cp_lexer_consume_token (parser->lexer);
6364 /* Parse the operand. */
6365 operand = cp_parser_sizeof_operand (parser, keyword);
6367 if (TYPE_P (operand))
6368 return cxx_sizeof_or_alignof_type (operand, op, true);
6371 /* ISO C++ defines alignof only with types, not with
6372 expressions. So pedwarn if alignof is used with a non-
6373 type expression. However, __alignof__ is ok. */
6374 if (!strcmp (IDENTIFIER_POINTER (token->u.value), "alignof"))
6375 pedwarn (token->location, OPT_pedantic,
6376 "ISO C++ does not allow %<alignof%> "
6379 return cxx_sizeof_or_alignof_expr (operand, op, true);
6384 return cp_parser_new_expression (parser);
6387 return cp_parser_delete_expression (parser);
6391 /* The saved value of the PEDANTIC flag. */
6395 /* Save away the PEDANTIC flag. */
6396 cp_parser_extension_opt (parser, &saved_pedantic);
6397 /* Parse the cast-expression. */
6398 expr = cp_parser_simple_cast_expression (parser);
6399 /* Restore the PEDANTIC flag. */
6400 pedantic = saved_pedantic;
6410 /* Consume the `__real__' or `__imag__' token. */
6411 cp_lexer_consume_token (parser->lexer);
6412 /* Parse the cast-expression. */
6413 expression = cp_parser_simple_cast_expression (parser);
6414 /* Create the complete representation. */
6415 return build_x_unary_op ((keyword == RID_REALPART
6416 ? REALPART_EXPR : IMAGPART_EXPR),
6418 tf_warning_or_error);
6422 case RID_TRANSACTION_ATOMIC:
6423 case RID_TRANSACTION_RELAXED:
6424 return cp_parser_transaction_expression (parser, keyword);
6429 const char *saved_message;
6430 bool saved_integral_constant_expression_p;
6431 bool saved_non_integral_constant_expression_p;
6432 bool saved_greater_than_is_operator_p;
6434 cp_lexer_consume_token (parser->lexer);
6435 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
6437 saved_message = parser->type_definition_forbidden_message;
6438 parser->type_definition_forbidden_message
6439 = G_("types may not be defined in %<noexcept%> expressions");
6441 saved_integral_constant_expression_p
6442 = parser->integral_constant_expression_p;
6443 saved_non_integral_constant_expression_p
6444 = parser->non_integral_constant_expression_p;
6445 parser->integral_constant_expression_p = false;
6447 saved_greater_than_is_operator_p
6448 = parser->greater_than_is_operator_p;
6449 parser->greater_than_is_operator_p = true;
6451 ++cp_unevaluated_operand;
6452 ++c_inhibit_evaluation_warnings;
6453 expr = cp_parser_expression (parser, false, NULL);
6454 --c_inhibit_evaluation_warnings;
6455 --cp_unevaluated_operand;
6457 parser->greater_than_is_operator_p
6458 = saved_greater_than_is_operator_p;
6460 parser->integral_constant_expression_p
6461 = saved_integral_constant_expression_p;
6462 parser->non_integral_constant_expression_p
6463 = saved_non_integral_constant_expression_p;
6465 parser->type_definition_forbidden_message = saved_message;
6467 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
6468 return finish_noexcept_expr (expr, tf_warning_or_error);
6476 /* Look for the `:: new' and `:: delete', which also signal the
6477 beginning of a new-expression, or delete-expression,
6478 respectively. If the next token is `::', then it might be one of
6480 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
6484 /* See if the token after the `::' is one of the keywords in
6485 which we're interested. */
6486 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
6487 /* If it's `new', we have a new-expression. */
6488 if (keyword == RID_NEW)
6489 return cp_parser_new_expression (parser);
6490 /* Similarly, for `delete'. */
6491 else if (keyword == RID_DELETE)
6492 return cp_parser_delete_expression (parser);
6495 /* Look for a unary operator. */
6496 unary_operator = cp_parser_unary_operator (token);
6497 /* The `++' and `--' operators can be handled similarly, even though
6498 they are not technically unary-operators in the grammar. */
6499 if (unary_operator == ERROR_MARK)
6501 if (token->type == CPP_PLUS_PLUS)
6502 unary_operator = PREINCREMENT_EXPR;
6503 else if (token->type == CPP_MINUS_MINUS)
6504 unary_operator = PREDECREMENT_EXPR;
6505 /* Handle the GNU address-of-label extension. */
6506 else if (cp_parser_allow_gnu_extensions_p (parser)
6507 && token->type == CPP_AND_AND)
6511 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
6513 /* Consume the '&&' token. */
6514 cp_lexer_consume_token (parser->lexer);
6515 /* Look for the identifier. */
6516 identifier = cp_parser_identifier (parser);
6517 /* Create an expression representing the address. */
6518 expression = finish_label_address_expr (identifier, loc);
6519 if (cp_parser_non_integral_constant_expression (parser,
6521 expression = error_mark_node;
6525 if (unary_operator != ERROR_MARK)
6527 tree cast_expression;
6528 tree expression = error_mark_node;
6529 non_integral_constant non_constant_p = NIC_NONE;
6531 /* Consume the operator token. */
6532 token = cp_lexer_consume_token (parser->lexer);
6533 /* Parse the cast-expression. */
6535 = cp_parser_cast_expression (parser,
6536 unary_operator == ADDR_EXPR,
6537 /*cast_p=*/false, pidk);
6538 /* Now, build an appropriate representation. */
6539 switch (unary_operator)
6542 non_constant_p = NIC_STAR;
6543 expression = build_x_indirect_ref (cast_expression, RO_UNARY_STAR,
6544 tf_warning_or_error);
6548 non_constant_p = NIC_ADDR;
6551 expression = build_x_unary_op (unary_operator, cast_expression,
6552 tf_warning_or_error);
6555 case PREINCREMENT_EXPR:
6556 case PREDECREMENT_EXPR:
6557 non_constant_p = unary_operator == PREINCREMENT_EXPR
6558 ? NIC_PREINCREMENT : NIC_PREDECREMENT;
6560 case UNARY_PLUS_EXPR:
6562 case TRUTH_NOT_EXPR:
6563 expression = finish_unary_op_expr (unary_operator, cast_expression);
6570 if (non_constant_p != NIC_NONE
6571 && cp_parser_non_integral_constant_expression (parser,
6573 expression = error_mark_node;
6578 return cp_parser_postfix_expression (parser, address_p, cast_p,
6579 /*member_access_only_p=*/false,
6583 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6584 unary-operator, the corresponding tree code is returned. */
6586 static enum tree_code
6587 cp_parser_unary_operator (cp_token* token)
6589 switch (token->type)
6592 return INDIRECT_REF;
6598 return UNARY_PLUS_EXPR;
6604 return TRUTH_NOT_EXPR;
6607 return BIT_NOT_EXPR;
6614 /* Parse a new-expression.
6617 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6618 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6620 Returns a representation of the expression. */
6623 cp_parser_new_expression (cp_parser* parser)
6625 bool global_scope_p;
6626 VEC(tree,gc) *placement;
6628 VEC(tree,gc) *initializer;
6632 /* Look for the optional `::' operator. */
6634 = (cp_parser_global_scope_opt (parser,
6635 /*current_scope_valid_p=*/false)
6637 /* Look for the `new' operator. */
6638 cp_parser_require_keyword (parser, RID_NEW, RT_NEW);
6639 /* There's no easy way to tell a new-placement from the
6640 `( type-id )' construct. */
6641 cp_parser_parse_tentatively (parser);
6642 /* Look for a new-placement. */
6643 placement = cp_parser_new_placement (parser);
6644 /* If that didn't work out, there's no new-placement. */
6645 if (!cp_parser_parse_definitely (parser))
6647 if (placement != NULL)
6648 release_tree_vector (placement);
6652 /* If the next token is a `(', then we have a parenthesized
6654 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
6657 /* Consume the `('. */
6658 cp_lexer_consume_token (parser->lexer);
6659 /* Parse the type-id. */
6660 type = cp_parser_type_id (parser);
6661 /* Look for the closing `)'. */
6662 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
6663 token = cp_lexer_peek_token (parser->lexer);
6664 /* There should not be a direct-new-declarator in this production,
6665 but GCC used to allowed this, so we check and emit a sensible error
6666 message for this case. */
6667 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6669 error_at (token->location,
6670 "array bound forbidden after parenthesized type-id");
6671 inform (token->location,
6672 "try removing the parentheses around the type-id");
6673 cp_parser_direct_new_declarator (parser);
6677 /* Otherwise, there must be a new-type-id. */
6679 type = cp_parser_new_type_id (parser, &nelts);
6681 /* If the next token is a `(' or '{', then we have a new-initializer. */
6682 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
6683 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6684 initializer = cp_parser_new_initializer (parser);
6688 /* A new-expression may not appear in an integral constant
6690 if (cp_parser_non_integral_constant_expression (parser, NIC_NEW))
6691 ret = error_mark_node;
6694 /* Create a representation of the new-expression. */
6695 ret = build_new (&placement, type, nelts, &initializer, global_scope_p,
6696 tf_warning_or_error);
6699 if (placement != NULL)
6700 release_tree_vector (placement);
6701 if (initializer != NULL)
6702 release_tree_vector (initializer);
6707 /* Parse a new-placement.
6712 Returns the same representation as for an expression-list. */
6714 static VEC(tree,gc) *
6715 cp_parser_new_placement (cp_parser* parser)
6717 VEC(tree,gc) *expression_list;
6719 /* Parse the expression-list. */
6720 expression_list = (cp_parser_parenthesized_expression_list
6721 (parser, non_attr, /*cast_p=*/false,
6722 /*allow_expansion_p=*/true,
6723 /*non_constant_p=*/NULL));
6725 return expression_list;
6728 /* Parse a new-type-id.
6731 type-specifier-seq new-declarator [opt]
6733 Returns the TYPE allocated. If the new-type-id indicates an array
6734 type, *NELTS is set to the number of elements in the last array
6735 bound; the TYPE will not include the last array bound. */
6738 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
6740 cp_decl_specifier_seq type_specifier_seq;
6741 cp_declarator *new_declarator;
6742 cp_declarator *declarator;
6743 cp_declarator *outer_declarator;
6744 const char *saved_message;
6747 /* The type-specifier sequence must not contain type definitions.
6748 (It cannot contain declarations of new types either, but if they
6749 are not definitions we will catch that because they are not
6751 saved_message = parser->type_definition_forbidden_message;
6752 parser->type_definition_forbidden_message
6753 = G_("types may not be defined in a new-type-id");
6754 /* Parse the type-specifier-seq. */
6755 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
6756 /*is_trailing_return=*/false,
6757 &type_specifier_seq);
6758 /* Restore the old message. */
6759 parser->type_definition_forbidden_message = saved_message;
6760 /* Parse the new-declarator. */
6761 new_declarator = cp_parser_new_declarator_opt (parser);
6763 /* Determine the number of elements in the last array dimension, if
6766 /* Skip down to the last array dimension. */
6767 declarator = new_declarator;
6768 outer_declarator = NULL;
6769 while (declarator && (declarator->kind == cdk_pointer
6770 || declarator->kind == cdk_ptrmem))
6772 outer_declarator = declarator;
6773 declarator = declarator->declarator;
6776 && declarator->kind == cdk_array
6777 && declarator->declarator
6778 && declarator->declarator->kind == cdk_array)
6780 outer_declarator = declarator;
6781 declarator = declarator->declarator;
6784 if (declarator && declarator->kind == cdk_array)
6786 *nelts = declarator->u.array.bounds;
6787 if (*nelts == error_mark_node)
6788 *nelts = integer_one_node;
6790 if (outer_declarator)
6791 outer_declarator->declarator = declarator->declarator;
6793 new_declarator = NULL;
6796 type = groktypename (&type_specifier_seq, new_declarator, false);
6800 /* Parse an (optional) new-declarator.
6803 ptr-operator new-declarator [opt]
6804 direct-new-declarator
6806 Returns the declarator. */
6808 static cp_declarator *
6809 cp_parser_new_declarator_opt (cp_parser* parser)
6811 enum tree_code code;
6813 cp_cv_quals cv_quals;
6815 /* We don't know if there's a ptr-operator next, or not. */
6816 cp_parser_parse_tentatively (parser);
6817 /* Look for a ptr-operator. */
6818 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
6819 /* If that worked, look for more new-declarators. */
6820 if (cp_parser_parse_definitely (parser))
6822 cp_declarator *declarator;
6824 /* Parse another optional declarator. */
6825 declarator = cp_parser_new_declarator_opt (parser);
6827 return cp_parser_make_indirect_declarator
6828 (code, type, cv_quals, declarator);
6831 /* If the next token is a `[', there is a direct-new-declarator. */
6832 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6833 return cp_parser_direct_new_declarator (parser);
6838 /* Parse a direct-new-declarator.
6840 direct-new-declarator:
6842 direct-new-declarator [constant-expression]
6846 static cp_declarator *
6847 cp_parser_direct_new_declarator (cp_parser* parser)
6849 cp_declarator *declarator = NULL;
6855 /* Look for the opening `['. */
6856 cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE);
6857 /* The first expression is not required to be constant. */
6860 cp_token *token = cp_lexer_peek_token (parser->lexer);
6861 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
6862 /* The standard requires that the expression have integral
6863 type. DR 74 adds enumeration types. We believe that the
6864 real intent is that these expressions be handled like the
6865 expression in a `switch' condition, which also allows
6866 classes with a single conversion to integral or
6867 enumeration type. */
6868 if (!processing_template_decl)
6871 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
6876 error_at (token->location,
6877 "expression in new-declarator must have integral "
6878 "or enumeration type");
6879 expression = error_mark_node;
6883 /* But all the other expressions must be. */
6886 = cp_parser_constant_expression (parser,
6887 /*allow_non_constant=*/false,
6889 /* Look for the closing `]'. */
6890 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
6892 /* Add this bound to the declarator. */
6893 declarator = make_array_declarator (declarator, expression);
6895 /* If the next token is not a `[', then there are no more
6897 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
6904 /* Parse a new-initializer.
6907 ( expression-list [opt] )
6910 Returns a representation of the expression-list. */
6912 static VEC(tree,gc) *
6913 cp_parser_new_initializer (cp_parser* parser)
6915 VEC(tree,gc) *expression_list;
6917 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6920 bool expr_non_constant_p;
6921 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
6922 t = cp_parser_braced_list (parser, &expr_non_constant_p);
6923 CONSTRUCTOR_IS_DIRECT_INIT (t) = 1;
6924 expression_list = make_tree_vector_single (t);
6927 expression_list = (cp_parser_parenthesized_expression_list
6928 (parser, non_attr, /*cast_p=*/false,
6929 /*allow_expansion_p=*/true,
6930 /*non_constant_p=*/NULL));
6932 return expression_list;
6935 /* Parse a delete-expression.
6938 :: [opt] delete cast-expression
6939 :: [opt] delete [ ] cast-expression
6941 Returns a representation of the expression. */
6944 cp_parser_delete_expression (cp_parser* parser)
6946 bool global_scope_p;
6950 /* Look for the optional `::' operator. */
6952 = (cp_parser_global_scope_opt (parser,
6953 /*current_scope_valid_p=*/false)
6955 /* Look for the `delete' keyword. */
6956 cp_parser_require_keyword (parser, RID_DELETE, RT_DELETE);
6957 /* See if the array syntax is in use. */
6958 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6960 /* Consume the `[' token. */
6961 cp_lexer_consume_token (parser->lexer);
6962 /* Look for the `]' token. */
6963 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
6964 /* Remember that this is the `[]' construct. */
6970 /* Parse the cast-expression. */
6971 expression = cp_parser_simple_cast_expression (parser);
6973 /* A delete-expression may not appear in an integral constant
6975 if (cp_parser_non_integral_constant_expression (parser, NIC_DEL))
6976 return error_mark_node;
6978 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p,
6979 tf_warning_or_error);
6982 /* Returns true if TOKEN may start a cast-expression and false
6986 cp_parser_token_starts_cast_expression (cp_token *token)
6988 switch (token->type)
6994 case CPP_CLOSE_SQUARE:
6995 case CPP_CLOSE_PAREN:
6996 case CPP_CLOSE_BRACE:
7000 case CPP_DEREF_STAR:
7008 case CPP_GREATER_EQ:
7028 /* '[' may start a primary-expression in obj-c++. */
7029 case CPP_OPEN_SQUARE:
7030 return c_dialect_objc ();
7037 /* Parse a cast-expression.
7041 ( type-id ) cast-expression
7043 ADDRESS_P is true iff the unary-expression is appearing as the
7044 operand of the `&' operator. CAST_P is true if this expression is
7045 the target of a cast.
7047 Returns a representation of the expression. */
7050 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p,
7053 /* If it's a `(', then we might be looking at a cast. */
7054 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7056 tree type = NULL_TREE;
7057 tree expr = NULL_TREE;
7058 bool compound_literal_p;
7059 const char *saved_message;
7061 /* There's no way to know yet whether or not this is a cast.
7062 For example, `(int (3))' is a unary-expression, while `(int)
7063 3' is a cast. So, we resort to parsing tentatively. */
7064 cp_parser_parse_tentatively (parser);
7065 /* Types may not be defined in a cast. */
7066 saved_message = parser->type_definition_forbidden_message;
7067 parser->type_definition_forbidden_message
7068 = G_("types may not be defined in casts");
7069 /* Consume the `('. */
7070 cp_lexer_consume_token (parser->lexer);
7071 /* A very tricky bit is that `(struct S) { 3 }' is a
7072 compound-literal (which we permit in C++ as an extension).
7073 But, that construct is not a cast-expression -- it is a
7074 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7075 is legal; if the compound-literal were a cast-expression,
7076 you'd need an extra set of parentheses.) But, if we parse
7077 the type-id, and it happens to be a class-specifier, then we
7078 will commit to the parse at that point, because we cannot
7079 undo the action that is done when creating a new class. So,
7080 then we cannot back up and do a postfix-expression.
7082 Therefore, we scan ahead to the closing `)', and check to see
7083 if the token after the `)' is a `{'. If so, we are not
7084 looking at a cast-expression.
7086 Save tokens so that we can put them back. */
7087 cp_lexer_save_tokens (parser->lexer);
7088 /* Skip tokens until the next token is a closing parenthesis.
7089 If we find the closing `)', and the next token is a `{', then
7090 we are looking at a compound-literal. */
7092 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
7093 /*consume_paren=*/true)
7094 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
7095 /* Roll back the tokens we skipped. */
7096 cp_lexer_rollback_tokens (parser->lexer);
7097 /* If we were looking at a compound-literal, simulate an error
7098 so that the call to cp_parser_parse_definitely below will
7100 if (compound_literal_p)
7101 cp_parser_simulate_error (parser);
7104 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
7105 parser->in_type_id_in_expr_p = true;
7106 /* Look for the type-id. */
7107 type = cp_parser_type_id (parser);
7108 /* Look for the closing `)'. */
7109 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7110 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
7113 /* Restore the saved message. */
7114 parser->type_definition_forbidden_message = saved_message;
7116 /* At this point this can only be either a cast or a
7117 parenthesized ctor such as `(T ())' that looks like a cast to
7118 function returning T. */
7119 if (!cp_parser_error_occurred (parser)
7120 && cp_parser_token_starts_cast_expression (cp_lexer_peek_token
7123 cp_parser_parse_definitely (parser);
7124 expr = cp_parser_cast_expression (parser,
7125 /*address_p=*/false,
7126 /*cast_p=*/true, pidk);
7128 /* Warn about old-style casts, if so requested. */
7129 if (warn_old_style_cast
7130 && !in_system_header
7131 && !VOID_TYPE_P (type)
7132 && current_lang_name != lang_name_c)
7133 warning (OPT_Wold_style_cast, "use of old-style cast");
7135 /* Only type conversions to integral or enumeration types
7136 can be used in constant-expressions. */
7137 if (!cast_valid_in_integral_constant_expression_p (type)
7138 && cp_parser_non_integral_constant_expression (parser,
7140 return error_mark_node;
7142 /* Perform the cast. */
7143 expr = build_c_cast (input_location, type, expr);
7147 cp_parser_abort_tentative_parse (parser);
7150 /* If we get here, then it's not a cast, so it must be a
7151 unary-expression. */
7152 return cp_parser_unary_expression (parser, address_p, cast_p, pidk);
7155 /* Parse a binary expression of the general form:
7159 pm-expression .* cast-expression
7160 pm-expression ->* cast-expression
7162 multiplicative-expression:
7164 multiplicative-expression * pm-expression
7165 multiplicative-expression / pm-expression
7166 multiplicative-expression % pm-expression
7168 additive-expression:
7169 multiplicative-expression
7170 additive-expression + multiplicative-expression
7171 additive-expression - multiplicative-expression
7175 shift-expression << additive-expression
7176 shift-expression >> additive-expression
7178 relational-expression:
7180 relational-expression < shift-expression
7181 relational-expression > shift-expression
7182 relational-expression <= shift-expression
7183 relational-expression >= shift-expression
7187 relational-expression:
7188 relational-expression <? shift-expression
7189 relational-expression >? shift-expression
7191 equality-expression:
7192 relational-expression
7193 equality-expression == relational-expression
7194 equality-expression != relational-expression
7198 and-expression & equality-expression
7200 exclusive-or-expression:
7202 exclusive-or-expression ^ and-expression
7204 inclusive-or-expression:
7205 exclusive-or-expression
7206 inclusive-or-expression | exclusive-or-expression
7208 logical-and-expression:
7209 inclusive-or-expression
7210 logical-and-expression && inclusive-or-expression
7212 logical-or-expression:
7213 logical-and-expression
7214 logical-or-expression || logical-and-expression
7216 All these are implemented with a single function like:
7219 simple-cast-expression
7220 binary-expression <token> binary-expression
7222 CAST_P is true if this expression is the target of a cast.
7224 The binops_by_token map is used to get the tree codes for each <token> type.
7225 binary-expressions are associated according to a precedence table. */
7227 #define TOKEN_PRECEDENCE(token) \
7228 (((token->type == CPP_GREATER \
7229 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7230 && !parser->greater_than_is_operator_p) \
7231 ? PREC_NOT_OPERATOR \
7232 : binops_by_token[token->type].prec)
7235 cp_parser_binary_expression (cp_parser* parser, bool cast_p,
7236 bool no_toplevel_fold_p,
7237 enum cp_parser_prec prec,
7240 cp_parser_expression_stack stack;
7241 cp_parser_expression_stack_entry *sp = &stack[0];
7244 enum tree_code tree_type, lhs_type, rhs_type;
7245 enum cp_parser_prec new_prec, lookahead_prec;
7248 /* Parse the first expression. */
7249 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p, pidk);
7250 lhs_type = ERROR_MARK;
7254 /* Get an operator token. */
7255 token = cp_lexer_peek_token (parser->lexer);
7257 if (warn_cxx0x_compat
7258 && token->type == CPP_RSHIFT
7259 && !parser->greater_than_is_operator_p)
7261 if (warning_at (token->location, OPT_Wc__0x_compat,
7262 "%<>>%> operator is treated as"
7263 " two right angle brackets in C++11"))
7264 inform (token->location,
7265 "suggest parentheses around %<>>%> expression");
7268 new_prec = TOKEN_PRECEDENCE (token);
7270 /* Popping an entry off the stack means we completed a subexpression:
7271 - either we found a token which is not an operator (`>' where it is not
7272 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7273 will happen repeatedly;
7274 - or, we found an operator which has lower priority. This is the case
7275 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7277 if (new_prec <= prec)
7286 tree_type = binops_by_token[token->type].tree_type;
7288 /* We used the operator token. */
7289 cp_lexer_consume_token (parser->lexer);
7291 /* For "false && x" or "true || x", x will never be executed;
7292 disable warnings while evaluating it. */
7293 if (tree_type == TRUTH_ANDIF_EXPR)
7294 c_inhibit_evaluation_warnings += lhs == truthvalue_false_node;
7295 else if (tree_type == TRUTH_ORIF_EXPR)
7296 c_inhibit_evaluation_warnings += lhs == truthvalue_true_node;
7298 /* Extract another operand. It may be the RHS of this expression
7299 or the LHS of a new, higher priority expression. */
7300 rhs = cp_parser_simple_cast_expression (parser);
7301 rhs_type = ERROR_MARK;
7303 /* Get another operator token. Look up its precedence to avoid
7304 building a useless (immediately popped) stack entry for common
7305 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7306 token = cp_lexer_peek_token (parser->lexer);
7307 lookahead_prec = TOKEN_PRECEDENCE (token);
7308 if (lookahead_prec > new_prec)
7310 /* ... and prepare to parse the RHS of the new, higher priority
7311 expression. Since precedence levels on the stack are
7312 monotonically increasing, we do not have to care about
7315 sp->tree_type = tree_type;
7317 sp->lhs_type = lhs_type;
7320 lhs_type = rhs_type;
7322 new_prec = lookahead_prec;
7326 lookahead_prec = new_prec;
7327 /* If the stack is not empty, we have parsed into LHS the right side
7328 (`4' in the example above) of an expression we had suspended.
7329 We can use the information on the stack to recover the LHS (`3')
7330 from the stack together with the tree code (`MULT_EXPR'), and
7331 the precedence of the higher level subexpression
7332 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7333 which will be used to actually build the additive expression. */
7336 tree_type = sp->tree_type;
7338 rhs_type = lhs_type;
7340 lhs_type = sp->lhs_type;
7343 /* Undo the disabling of warnings done above. */
7344 if (tree_type == TRUTH_ANDIF_EXPR)
7345 c_inhibit_evaluation_warnings -= lhs == truthvalue_false_node;
7346 else if (tree_type == TRUTH_ORIF_EXPR)
7347 c_inhibit_evaluation_warnings -= lhs == truthvalue_true_node;
7350 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7351 ERROR_MARK for everything that is not a binary expression.
7352 This makes warn_about_parentheses miss some warnings that
7353 involve unary operators. For unary expressions we should
7354 pass the correct tree_code unless the unary expression was
7355 surrounded by parentheses.
7357 if (no_toplevel_fold_p
7358 && lookahead_prec <= prec
7360 && TREE_CODE_CLASS (tree_type) == tcc_comparison)
7361 lhs = build2 (tree_type, boolean_type_node, lhs, rhs);
7363 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
7364 &overload, tf_warning_or_error);
7365 lhs_type = tree_type;
7367 /* If the binary operator required the use of an overloaded operator,
7368 then this expression cannot be an integral constant-expression.
7369 An overloaded operator can be used even if both operands are
7370 otherwise permissible in an integral constant-expression if at
7371 least one of the operands is of enumeration type. */
7374 && cp_parser_non_integral_constant_expression (parser,
7376 return error_mark_node;
7383 /* Parse the `? expression : assignment-expression' part of a
7384 conditional-expression. The LOGICAL_OR_EXPR is the
7385 logical-or-expression that started the conditional-expression.
7386 Returns a representation of the entire conditional-expression.
7388 This routine is used by cp_parser_assignment_expression.
7390 ? expression : assignment-expression
7394 ? : assignment-expression */
7397 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
7400 tree assignment_expr;
7401 struct cp_token *token;
7403 /* Consume the `?' token. */
7404 cp_lexer_consume_token (parser->lexer);
7405 token = cp_lexer_peek_token (parser->lexer);
7406 if (cp_parser_allow_gnu_extensions_p (parser)
7407 && token->type == CPP_COLON)
7409 pedwarn (token->location, OPT_pedantic,
7410 "ISO C++ does not allow ?: with omitted middle operand");
7411 /* Implicit true clause. */
7413 c_inhibit_evaluation_warnings += logical_or_expr == truthvalue_true_node;
7414 warn_for_omitted_condop (token->location, logical_or_expr);
7418 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
7419 parser->colon_corrects_to_scope_p = false;
7420 /* Parse the expression. */
7421 c_inhibit_evaluation_warnings += logical_or_expr == truthvalue_false_node;
7422 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
7423 c_inhibit_evaluation_warnings +=
7424 ((logical_or_expr == truthvalue_true_node)
7425 - (logical_or_expr == truthvalue_false_node));
7426 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
7429 /* The next token should be a `:'. */
7430 cp_parser_require (parser, CPP_COLON, RT_COLON);
7431 /* Parse the assignment-expression. */
7432 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
7433 c_inhibit_evaluation_warnings -= logical_or_expr == truthvalue_true_node;
7435 /* Build the conditional-expression. */
7436 return build_x_conditional_expr (logical_or_expr,
7439 tf_warning_or_error);
7442 /* Parse an assignment-expression.
7444 assignment-expression:
7445 conditional-expression
7446 logical-or-expression assignment-operator assignment_expression
7449 CAST_P is true if this expression is the target of a cast.
7451 Returns a representation for the expression. */
7454 cp_parser_assignment_expression (cp_parser* parser, bool cast_p,
7459 /* If the next token is the `throw' keyword, then we're looking at
7460 a throw-expression. */
7461 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
7462 expr = cp_parser_throw_expression (parser);
7463 /* Otherwise, it must be that we are looking at a
7464 logical-or-expression. */
7467 /* Parse the binary expressions (logical-or-expression). */
7468 expr = cp_parser_binary_expression (parser, cast_p, false,
7469 PREC_NOT_OPERATOR, pidk);
7470 /* If the next token is a `?' then we're actually looking at a
7471 conditional-expression. */
7472 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
7473 return cp_parser_question_colon_clause (parser, expr);
7476 enum tree_code assignment_operator;
7478 /* If it's an assignment-operator, we're using the second
7481 = cp_parser_assignment_operator_opt (parser);
7482 if (assignment_operator != ERROR_MARK)
7484 bool non_constant_p;
7486 /* Parse the right-hand side of the assignment. */
7487 tree rhs = cp_parser_initializer_clause (parser, &non_constant_p);
7489 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
7490 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
7492 /* An assignment may not appear in a
7493 constant-expression. */
7494 if (cp_parser_non_integral_constant_expression (parser,
7496 return error_mark_node;
7497 /* Build the assignment expression. */
7498 expr = build_x_modify_expr (expr,
7499 assignment_operator,
7501 tf_warning_or_error);
7509 /* Parse an (optional) assignment-operator.
7511 assignment-operator: one of
7512 = *= /= %= += -= >>= <<= &= ^= |=
7516 assignment-operator: one of
7519 If the next token is an assignment operator, the corresponding tree
7520 code is returned, and the token is consumed. For example, for
7521 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7522 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7523 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7524 operator, ERROR_MARK is returned. */
7526 static enum tree_code
7527 cp_parser_assignment_operator_opt (cp_parser* parser)
7532 /* Peek at the next token. */
7533 token = cp_lexer_peek_token (parser->lexer);
7535 switch (token->type)
7546 op = TRUNC_DIV_EXPR;
7550 op = TRUNC_MOD_EXPR;
7582 /* Nothing else is an assignment operator. */
7586 /* If it was an assignment operator, consume it. */
7587 if (op != ERROR_MARK)
7588 cp_lexer_consume_token (parser->lexer);
7593 /* Parse an expression.
7596 assignment-expression
7597 expression , assignment-expression
7599 CAST_P is true if this expression is the target of a cast.
7601 Returns a representation of the expression. */
7604 cp_parser_expression (cp_parser* parser, bool cast_p, cp_id_kind * pidk)
7606 tree expression = NULL_TREE;
7610 tree assignment_expression;
7612 /* Parse the next assignment-expression. */
7613 assignment_expression
7614 = cp_parser_assignment_expression (parser, cast_p, pidk);
7615 /* If this is the first assignment-expression, we can just
7618 expression = assignment_expression;
7620 expression = build_x_compound_expr (expression,
7621 assignment_expression,
7622 tf_warning_or_error);
7623 /* If the next token is not a comma, then we are done with the
7625 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7627 /* Consume the `,'. */
7628 cp_lexer_consume_token (parser->lexer);
7629 /* A comma operator cannot appear in a constant-expression. */
7630 if (cp_parser_non_integral_constant_expression (parser, NIC_COMMA))
7631 expression = error_mark_node;
7637 /* Parse a constant-expression.
7639 constant-expression:
7640 conditional-expression
7642 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7643 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7644 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7645 is false, NON_CONSTANT_P should be NULL. */
7648 cp_parser_constant_expression (cp_parser* parser,
7649 bool allow_non_constant_p,
7650 bool *non_constant_p)
7652 bool saved_integral_constant_expression_p;
7653 bool saved_allow_non_integral_constant_expression_p;
7654 bool saved_non_integral_constant_expression_p;
7657 /* It might seem that we could simply parse the
7658 conditional-expression, and then check to see if it were
7659 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7660 one that the compiler can figure out is constant, possibly after
7661 doing some simplifications or optimizations. The standard has a
7662 precise definition of constant-expression, and we must honor
7663 that, even though it is somewhat more restrictive.
7669 is not a legal declaration, because `(2, 3)' is not a
7670 constant-expression. The `,' operator is forbidden in a
7671 constant-expression. However, GCC's constant-folding machinery
7672 will fold this operation to an INTEGER_CST for `3'. */
7674 /* Save the old settings. */
7675 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
7676 saved_allow_non_integral_constant_expression_p
7677 = parser->allow_non_integral_constant_expression_p;
7678 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
7679 /* We are now parsing a constant-expression. */
7680 parser->integral_constant_expression_p = true;
7681 parser->allow_non_integral_constant_expression_p
7682 = (allow_non_constant_p || cxx_dialect >= cxx0x);
7683 parser->non_integral_constant_expression_p = false;
7684 /* Although the grammar says "conditional-expression", we parse an
7685 "assignment-expression", which also permits "throw-expression"
7686 and the use of assignment operators. In the case that
7687 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7688 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7689 actually essential that we look for an assignment-expression.
7690 For example, cp_parser_initializer_clauses uses this function to
7691 determine whether a particular assignment-expression is in fact
7693 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
7694 /* Restore the old settings. */
7695 parser->integral_constant_expression_p
7696 = saved_integral_constant_expression_p;
7697 parser->allow_non_integral_constant_expression_p
7698 = saved_allow_non_integral_constant_expression_p;
7699 if (cxx_dialect >= cxx0x)
7701 /* Require an rvalue constant expression here; that's what our
7702 callers expect. Reference constant expressions are handled
7703 separately in e.g. cp_parser_template_argument. */
7704 bool is_const = potential_rvalue_constant_expression (expression);
7705 parser->non_integral_constant_expression_p = !is_const;
7706 if (!is_const && !allow_non_constant_p)
7707 require_potential_rvalue_constant_expression (expression);
7709 if (allow_non_constant_p)
7710 *non_constant_p = parser->non_integral_constant_expression_p;
7711 parser->non_integral_constant_expression_p
7712 = saved_non_integral_constant_expression_p;
7717 /* Parse __builtin_offsetof.
7719 offsetof-expression:
7720 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7722 offsetof-member-designator:
7724 | offsetof-member-designator "." id-expression
7725 | offsetof-member-designator "[" expression "]"
7726 | offsetof-member-designator "->" id-expression */
7729 cp_parser_builtin_offsetof (cp_parser *parser)
7731 int save_ice_p, save_non_ice_p;
7736 /* We're about to accept non-integral-constant things, but will
7737 definitely yield an integral constant expression. Save and
7738 restore these values around our local parsing. */
7739 save_ice_p = parser->integral_constant_expression_p;
7740 save_non_ice_p = parser->non_integral_constant_expression_p;
7742 /* Consume the "__builtin_offsetof" token. */
7743 cp_lexer_consume_token (parser->lexer);
7744 /* Consume the opening `('. */
7745 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
7746 /* Parse the type-id. */
7747 type = cp_parser_type_id (parser);
7748 /* Look for the `,'. */
7749 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7750 token = cp_lexer_peek_token (parser->lexer);
7752 /* Build the (type *)null that begins the traditional offsetof macro. */
7753 expr = build_static_cast (build_pointer_type (type), null_pointer_node,
7754 tf_warning_or_error);
7756 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7757 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
7758 true, &dummy, token->location);
7761 token = cp_lexer_peek_token (parser->lexer);
7762 switch (token->type)
7764 case CPP_OPEN_SQUARE:
7765 /* offsetof-member-designator "[" expression "]" */
7766 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
7770 /* offsetof-member-designator "->" identifier */
7771 expr = grok_array_decl (expr, integer_zero_node);
7775 /* offsetof-member-designator "." identifier */
7776 cp_lexer_consume_token (parser->lexer);
7777 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT,
7782 case CPP_CLOSE_PAREN:
7783 /* Consume the ")" token. */
7784 cp_lexer_consume_token (parser->lexer);
7788 /* Error. We know the following require will fail, but
7789 that gives the proper error message. */
7790 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7791 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
7792 expr = error_mark_node;
7798 /* If we're processing a template, we can't finish the semantics yet.
7799 Otherwise we can fold the entire expression now. */
7800 if (processing_template_decl)
7801 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
7803 expr = finish_offsetof (expr);
7806 parser->integral_constant_expression_p = save_ice_p;
7807 parser->non_integral_constant_expression_p = save_non_ice_p;
7812 /* Parse a trait expression.
7814 Returns a representation of the expression, the underlying type
7815 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7818 cp_parser_trait_expr (cp_parser* parser, enum rid keyword)
7821 tree type1, type2 = NULL_TREE;
7822 bool binary = false;
7823 cp_decl_specifier_seq decl_specs;
7827 case RID_HAS_NOTHROW_ASSIGN:
7828 kind = CPTK_HAS_NOTHROW_ASSIGN;
7830 case RID_HAS_NOTHROW_CONSTRUCTOR:
7831 kind = CPTK_HAS_NOTHROW_CONSTRUCTOR;
7833 case RID_HAS_NOTHROW_COPY:
7834 kind = CPTK_HAS_NOTHROW_COPY;
7836 case RID_HAS_TRIVIAL_ASSIGN:
7837 kind = CPTK_HAS_TRIVIAL_ASSIGN;
7839 case RID_HAS_TRIVIAL_CONSTRUCTOR:
7840 kind = CPTK_HAS_TRIVIAL_CONSTRUCTOR;
7842 case RID_HAS_TRIVIAL_COPY:
7843 kind = CPTK_HAS_TRIVIAL_COPY;
7845 case RID_HAS_TRIVIAL_DESTRUCTOR:
7846 kind = CPTK_HAS_TRIVIAL_DESTRUCTOR;
7848 case RID_HAS_VIRTUAL_DESTRUCTOR:
7849 kind = CPTK_HAS_VIRTUAL_DESTRUCTOR;
7851 case RID_IS_ABSTRACT:
7852 kind = CPTK_IS_ABSTRACT;
7854 case RID_IS_BASE_OF:
7855 kind = CPTK_IS_BASE_OF;
7859 kind = CPTK_IS_CLASS;
7861 case RID_IS_CONVERTIBLE_TO:
7862 kind = CPTK_IS_CONVERTIBLE_TO;
7866 kind = CPTK_IS_EMPTY;
7869 kind = CPTK_IS_ENUM;
7871 case RID_IS_LITERAL_TYPE:
7872 kind = CPTK_IS_LITERAL_TYPE;
7877 case RID_IS_POLYMORPHIC:
7878 kind = CPTK_IS_POLYMORPHIC;
7880 case RID_IS_STD_LAYOUT:
7881 kind = CPTK_IS_STD_LAYOUT;
7883 case RID_IS_TRIVIAL:
7884 kind = CPTK_IS_TRIVIAL;
7887 kind = CPTK_IS_UNION;
7889 case RID_UNDERLYING_TYPE:
7890 kind = CPTK_UNDERLYING_TYPE;
7895 case RID_DIRECT_BASES:
7896 kind = CPTK_DIRECT_BASES;
7902 /* Consume the token. */
7903 cp_lexer_consume_token (parser->lexer);
7905 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
7907 type1 = cp_parser_type_id (parser);
7909 if (type1 == error_mark_node)
7910 return error_mark_node;
7912 /* Build a trivial decl-specifier-seq. */
7913 clear_decl_specs (&decl_specs);
7914 decl_specs.type = type1;
7916 /* Call grokdeclarator to figure out what type this is. */
7917 type1 = grokdeclarator (NULL, &decl_specs, TYPENAME,
7918 /*initialized=*/0, /*attrlist=*/NULL);
7922 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7924 type2 = cp_parser_type_id (parser);
7926 if (type2 == error_mark_node)
7927 return error_mark_node;
7929 /* Build a trivial decl-specifier-seq. */
7930 clear_decl_specs (&decl_specs);
7931 decl_specs.type = type2;
7933 /* Call grokdeclarator to figure out what type this is. */
7934 type2 = grokdeclarator (NULL, &decl_specs, TYPENAME,
7935 /*initialized=*/0, /*attrlist=*/NULL);
7938 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7940 /* Complete the trait expression, which may mean either processing
7941 the trait expr now or saving it for template instantiation. */
7944 case CPTK_UNDERLYING_TYPE:
7945 return finish_underlying_type (type1);
7947 return finish_bases (type1, false);
7948 case CPTK_DIRECT_BASES:
7949 return finish_bases (type1, true);
7951 return finish_trait_expr (kind, type1, type2);
7955 /* Lambdas that appear in variable initializer or default argument scope
7956 get that in their mangling, so we need to record it. We might as well
7957 use the count for function and namespace scopes as well. */
7958 static GTY(()) tree lambda_scope;
7959 static GTY(()) int lambda_count;
7960 typedef struct GTY(()) tree_int
7965 DEF_VEC_O(tree_int);
7966 DEF_VEC_ALLOC_O(tree_int,gc);
7967 static GTY(()) VEC(tree_int,gc) *lambda_scope_stack;
7970 start_lambda_scope (tree decl)
7974 /* Once we're inside a function, we ignore other scopes and just push
7975 the function again so that popping works properly. */
7976 if (current_function_decl && TREE_CODE (decl) != FUNCTION_DECL)
7977 decl = current_function_decl;
7978 ti.t = lambda_scope;
7979 ti.i = lambda_count;
7980 VEC_safe_push (tree_int, gc, lambda_scope_stack, &ti);
7981 if (lambda_scope != decl)
7983 /* Don't reset the count if we're still in the same function. */
7984 lambda_scope = decl;
7990 record_lambda_scope (tree lambda)
7992 LAMBDA_EXPR_EXTRA_SCOPE (lambda) = lambda_scope;
7993 LAMBDA_EXPR_DISCRIMINATOR (lambda) = lambda_count++;
7997 finish_lambda_scope (void)
7999 tree_int *p = VEC_last (tree_int, lambda_scope_stack);
8000 if (lambda_scope != p->t)
8002 lambda_scope = p->t;
8003 lambda_count = p->i;
8005 VEC_pop (tree_int, lambda_scope_stack);
8008 /* Parse a lambda expression.
8011 lambda-introducer lambda-declarator [opt] compound-statement
8013 Returns a representation of the expression. */
8016 cp_parser_lambda_expression (cp_parser* parser)
8018 tree lambda_expr = build_lambda_expr ();
8022 LAMBDA_EXPR_LOCATION (lambda_expr)
8023 = cp_lexer_peek_token (parser->lexer)->location;
8025 if (cp_unevaluated_operand)
8026 error_at (LAMBDA_EXPR_LOCATION (lambda_expr),
8027 "lambda-expression in unevaluated context");
8029 /* We may be in the middle of deferred access check. Disable
8031 push_deferring_access_checks (dk_no_deferred);
8033 cp_parser_lambda_introducer (parser, lambda_expr);
8035 type = begin_lambda_type (lambda_expr);
8037 record_lambda_scope (lambda_expr);
8039 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8040 determine_visibility (TYPE_NAME (type));
8042 /* Now that we've started the type, add the capture fields for any
8043 explicit captures. */
8044 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr));
8047 /* Inside the class, surrounding template-parameter-lists do not apply. */
8048 unsigned int saved_num_template_parameter_lists
8049 = parser->num_template_parameter_lists;
8050 unsigned char in_statement = parser->in_statement;
8051 bool in_switch_statement_p = parser->in_switch_statement_p;
8053 parser->num_template_parameter_lists = 0;
8054 parser->in_statement = 0;
8055 parser->in_switch_statement_p = false;
8057 /* By virtue of defining a local class, a lambda expression has access to
8058 the private variables of enclosing classes. */
8060 ok = cp_parser_lambda_declarator_opt (parser, lambda_expr);
8063 cp_parser_lambda_body (parser, lambda_expr);
8064 else if (cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8065 cp_parser_skip_to_end_of_block_or_statement (parser);
8067 /* The capture list was built up in reverse order; fix that now. */
8069 tree newlist = NULL_TREE;
8072 for (elt = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8075 next = TREE_CHAIN (elt);
8076 TREE_CHAIN (elt) = newlist;
8079 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr) = newlist;
8083 maybe_add_lambda_conv_op (type);
8085 type = finish_struct (type, /*attributes=*/NULL_TREE);
8087 parser->num_template_parameter_lists = saved_num_template_parameter_lists;
8088 parser->in_statement = in_statement;
8089 parser->in_switch_statement_p = in_switch_statement_p;
8092 pop_deferring_access_checks ();
8094 /* This field is only used during parsing of the lambda. */
8095 LAMBDA_EXPR_THIS_CAPTURE (lambda_expr) = NULL_TREE;
8097 /* This lambda shouldn't have any proxies left at this point. */
8098 gcc_assert (LAMBDA_EXPR_PENDING_PROXIES (lambda_expr) == NULL);
8099 /* And now that we're done, push proxies for an enclosing lambda. */
8100 insert_pending_capture_proxies ();
8103 return build_lambda_object (lambda_expr);
8105 return error_mark_node;
8108 /* Parse the beginning of a lambda expression.
8111 [ lambda-capture [opt] ]
8113 LAMBDA_EXPR is the current representation of the lambda expression. */
8116 cp_parser_lambda_introducer (cp_parser* parser, tree lambda_expr)
8118 /* Need commas after the first capture. */
8121 /* Eat the leading `['. */
8122 cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE);
8124 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8125 if (cp_lexer_next_token_is (parser->lexer, CPP_AND)
8126 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_NAME)
8127 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) = CPLD_REFERENCE;
8128 else if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8129 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) = CPLD_COPY;
8131 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) != CPLD_NONE)
8133 cp_lexer_consume_token (parser->lexer);
8137 while (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_SQUARE))
8139 cp_token* capture_token;
8141 tree capture_init_expr;
8142 cp_id_kind idk = CP_ID_KIND_NONE;
8143 bool explicit_init_p = false;
8145 enum capture_kind_type
8150 enum capture_kind_type capture_kind = BY_COPY;
8152 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
8154 error ("expected end of capture-list");
8161 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
8163 /* Possibly capture `this'. */
8164 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THIS))
8166 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
8167 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_COPY)
8168 pedwarn (loc, 0, "explicit by-copy capture of %<this%> redundant "
8169 "with by-copy capture default");
8170 cp_lexer_consume_token (parser->lexer);
8171 add_capture (lambda_expr,
8172 /*id=*/this_identifier,
8173 /*initializer=*/finish_this_expr(),
8174 /*by_reference_p=*/false,
8179 /* Remember whether we want to capture as a reference or not. */
8180 if (cp_lexer_next_token_is (parser->lexer, CPP_AND))
8182 capture_kind = BY_REFERENCE;
8183 cp_lexer_consume_token (parser->lexer);
8186 /* Get the identifier. */
8187 capture_token = cp_lexer_peek_token (parser->lexer);
8188 capture_id = cp_parser_identifier (parser);
8190 if (capture_id == error_mark_node)
8191 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8192 delimiters, but I modified this to stop on unnested ']' as well. It
8193 was already changed to stop on unnested '}', so the
8194 "closing_parenthesis" name is no more misleading with my change. */
8196 cp_parser_skip_to_closing_parenthesis (parser,
8197 /*recovering=*/true,
8199 /*consume_paren=*/true);
8203 /* Find the initializer for this capture. */
8204 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8206 /* An explicit expression exists. */
8207 cp_lexer_consume_token (parser->lexer);
8208 pedwarn (input_location, OPT_pedantic,
8209 "ISO C++ does not allow initializers "
8210 "in lambda expression capture lists");
8211 capture_init_expr = cp_parser_assignment_expression (parser,
8214 explicit_init_p = true;
8218 const char* error_msg;
8220 /* Turn the identifier into an id-expression. */
8222 = cp_parser_lookup_name
8226 /*is_template=*/false,
8227 /*is_namespace=*/false,
8228 /*check_dependency=*/true,
8229 /*ambiguous_decls=*/NULL,
8230 capture_token->location);
8232 if (capture_init_expr == error_mark_node)
8234 unqualified_name_lookup_error (capture_id);
8237 else if (DECL_P (capture_init_expr)
8238 && (TREE_CODE (capture_init_expr) != VAR_DECL
8239 && TREE_CODE (capture_init_expr) != PARM_DECL))
8241 error_at (capture_token->location,
8242 "capture of non-variable %qD ",
8244 inform (0, "%q+#D declared here", capture_init_expr);
8247 if (TREE_CODE (capture_init_expr) == VAR_DECL
8248 && decl_storage_duration (capture_init_expr) != dk_auto)
8250 pedwarn (capture_token->location, 0, "capture of variable "
8251 "%qD with non-automatic storage duration",
8253 inform (0, "%q+#D declared here", capture_init_expr);
8258 = finish_id_expression
8263 /*integral_constant_expression_p=*/false,
8264 /*allow_non_integral_constant_expression_p=*/false,
8265 /*non_integral_constant_expression_p=*/NULL,
8266 /*template_p=*/false,
8268 /*address_p=*/false,
8269 /*template_arg_p=*/false,
8271 capture_token->location);
8274 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) != CPLD_NONE
8275 && !explicit_init_p)
8277 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_COPY
8278 && capture_kind == BY_COPY)
8279 pedwarn (capture_token->location, 0, "explicit by-copy capture "
8280 "of %qD redundant with by-copy capture default",
8282 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_REFERENCE
8283 && capture_kind == BY_REFERENCE)
8284 pedwarn (capture_token->location, 0, "explicit by-reference "
8285 "capture of %qD redundant with by-reference capture "
8286 "default", capture_id);
8289 add_capture (lambda_expr,
8292 /*by_reference_p=*/capture_kind == BY_REFERENCE,
8296 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
8299 /* Parse the (optional) middle of a lambda expression.
8302 ( parameter-declaration-clause [opt] )
8303 attribute-specifier [opt]
8305 exception-specification [opt]
8306 lambda-return-type-clause [opt]
8308 LAMBDA_EXPR is the current representation of the lambda expression. */
8311 cp_parser_lambda_declarator_opt (cp_parser* parser, tree lambda_expr)
8313 /* 5.1.1.4 of the standard says:
8314 If a lambda-expression does not include a lambda-declarator, it is as if
8315 the lambda-declarator were ().
8316 This means an empty parameter list, no attributes, and no exception
8318 tree param_list = void_list_node;
8319 tree attributes = NULL_TREE;
8320 tree exception_spec = NULL_TREE;
8323 /* The lambda-declarator is optional, but must begin with an opening
8324 parenthesis if present. */
8325 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
8327 cp_lexer_consume_token (parser->lexer);
8329 begin_scope (sk_function_parms, /*entity=*/NULL_TREE);
8331 /* Parse parameters. */
8332 param_list = cp_parser_parameter_declaration_clause (parser);
8334 /* Default arguments shall not be specified in the
8335 parameter-declaration-clause of a lambda-declarator. */
8336 for (t = param_list; t; t = TREE_CHAIN (t))
8337 if (TREE_PURPOSE (t))
8338 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t)), OPT_pedantic,
8339 "default argument specified for lambda parameter");
8341 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
8343 attributes = cp_parser_attributes_opt (parser);
8345 /* Parse optional `mutable' keyword. */
8346 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_MUTABLE))
8348 cp_lexer_consume_token (parser->lexer);
8349 LAMBDA_EXPR_MUTABLE_P (lambda_expr) = 1;
8352 /* Parse optional exception specification. */
8353 exception_spec = cp_parser_exception_specification_opt (parser);
8355 /* Parse optional trailing return type. */
8356 if (cp_lexer_next_token_is (parser->lexer, CPP_DEREF))
8358 cp_lexer_consume_token (parser->lexer);
8359 LAMBDA_EXPR_RETURN_TYPE (lambda_expr) = cp_parser_type_id (parser);
8362 /* The function parameters must be in scope all the way until after the
8363 trailing-return-type in case of decltype. */
8364 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
8365 pop_binding (DECL_NAME (t), t);
8370 /* Create the function call operator.
8372 Messing with declarators like this is no uglier than building up the
8373 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8376 cp_decl_specifier_seq return_type_specs;
8377 cp_declarator* declarator;
8382 clear_decl_specs (&return_type_specs);
8383 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr))
8384 return_type_specs.type = LAMBDA_EXPR_RETURN_TYPE (lambda_expr);
8386 /* Maybe we will deduce the return type later, but we can use void
8387 as a placeholder return type anyways. */
8388 return_type_specs.type = void_type_node;
8390 p = obstack_alloc (&declarator_obstack, 0);
8392 declarator = make_id_declarator (NULL_TREE, ansi_opname (CALL_EXPR),
8395 quals = (LAMBDA_EXPR_MUTABLE_P (lambda_expr)
8396 ? TYPE_UNQUALIFIED : TYPE_QUAL_CONST);
8397 declarator = make_call_declarator (declarator, param_list, quals,
8398 VIRT_SPEC_UNSPECIFIED,
8400 /*late_return_type=*/NULL_TREE);
8401 declarator->id_loc = LAMBDA_EXPR_LOCATION (lambda_expr);
8403 fco = grokmethod (&return_type_specs,
8406 if (fco != error_mark_node)
8408 DECL_INITIALIZED_IN_CLASS_P (fco) = 1;
8409 DECL_ARTIFICIAL (fco) = 1;
8410 /* Give the object parameter a different name. */
8411 DECL_NAME (DECL_ARGUMENTS (fco)) = get_identifier ("__closure");
8414 finish_member_declaration (fco);
8416 obstack_free (&declarator_obstack, p);
8418 return (fco != error_mark_node);
8422 /* Parse the body of a lambda expression, which is simply
8426 but which requires special handling.
8427 LAMBDA_EXPR is the current representation of the lambda expression. */
8430 cp_parser_lambda_body (cp_parser* parser, tree lambda_expr)
8432 bool nested = (current_function_decl != NULL_TREE);
8433 bool local_variables_forbidden_p = parser->local_variables_forbidden_p;
8435 push_function_context ();
8437 /* Still increment function_depth so that we don't GC in the
8438 middle of an expression. */
8440 /* Clear this in case we're in the middle of a default argument. */
8441 parser->local_variables_forbidden_p = false;
8443 /* Finish the function call operator
8445 + late_parsing_for_member
8446 + function_definition_after_declarator
8447 + ctor_initializer_opt_and_function_body */
8449 tree fco = lambda_function (lambda_expr);
8455 /* Let the front end know that we are going to be defining this
8457 start_preparsed_function (fco,
8459 SF_PRE_PARSED | SF_INCLASS_INLINE);
8461 start_lambda_scope (fco);
8462 body = begin_function_body ();
8464 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8467 /* Push the proxies for any explicit captures. */
8468 for (cap = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr); cap;
8469 cap = TREE_CHAIN (cap))
8470 build_capture_proxy (TREE_PURPOSE (cap));
8472 compound_stmt = begin_compound_stmt (0);
8474 /* 5.1.1.4 of the standard says:
8475 If a lambda-expression does not include a trailing-return-type, it
8476 is as if the trailing-return-type denotes the following type:
8477 * if the compound-statement is of the form
8478 { return attribute-specifier [opt] expression ; }
8479 the type of the returned expression after lvalue-to-rvalue
8480 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8481 (_conv.array_ 4.2), and function-to-pointer conversion
8483 * otherwise, void. */
8485 /* In a lambda that has neither a lambda-return-type-clause
8486 nor a deducible form, errors should be reported for return statements
8487 in the body. Since we used void as the placeholder return type, parsing
8488 the body as usual will give such desired behavior. */
8489 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr)
8490 && cp_lexer_peek_nth_token (parser->lexer, 1)->keyword == RID_RETURN
8491 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SEMICOLON)
8493 tree expr = NULL_TREE;
8494 cp_id_kind idk = CP_ID_KIND_NONE;
8496 /* Parse tentatively in case there's more after the initial return
8498 cp_parser_parse_tentatively (parser);
8500 cp_parser_require_keyword (parser, RID_RETURN, RT_RETURN);
8502 expr = cp_parser_expression (parser, /*cast_p=*/false, &idk);
8504 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
8505 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8507 if (cp_parser_parse_definitely (parser))
8509 apply_lambda_return_type (lambda_expr, lambda_return_type (expr));
8511 /* Will get error here if type not deduced yet. */
8512 finish_return_stmt (expr);
8520 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr))
8521 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr) = true;
8522 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
8523 cp_parser_label_declaration (parser);
8524 cp_parser_statement_seq_opt (parser, NULL_TREE);
8525 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8526 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr) = false;
8529 finish_compound_stmt (compound_stmt);
8532 finish_function_body (body);
8533 finish_lambda_scope ();
8535 /* Finish the function and generate code for it if necessary. */
8536 expand_or_defer_fn (finish_function (/*inline*/2));
8539 parser->local_variables_forbidden_p = local_variables_forbidden_p;
8541 pop_function_context();
8546 /* Statements [gram.stmt.stmt] */
8548 /* Parse a statement.
8552 expression-statement
8557 declaration-statement
8565 IN_COMPOUND is true when the statement is nested inside a
8566 cp_parser_compound_statement; this matters for certain pragmas.
8568 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8569 is a (possibly labeled) if statement which is not enclosed in braces
8570 and has an else clause. This is used to implement -Wparentheses. */
8573 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
8574 bool in_compound, bool *if_p)
8578 location_t statement_location;
8583 /* There is no statement yet. */
8584 statement = NULL_TREE;
8585 /* Peek at the next token. */
8586 token = cp_lexer_peek_token (parser->lexer);
8587 /* Remember the location of the first token in the statement. */
8588 statement_location = token->location;
8589 /* If this is a keyword, then that will often determine what kind of
8590 statement we have. */
8591 if (token->type == CPP_KEYWORD)
8593 enum rid keyword = token->keyword;
8599 /* Looks like a labeled-statement with a case label.
8600 Parse the label, and then use tail recursion to parse
8602 cp_parser_label_for_labeled_statement (parser);
8607 statement = cp_parser_selection_statement (parser, if_p);
8613 statement = cp_parser_iteration_statement (parser);
8620 statement = cp_parser_jump_statement (parser);
8623 /* Objective-C++ exception-handling constructs. */
8626 case RID_AT_FINALLY:
8627 case RID_AT_SYNCHRONIZED:
8629 statement = cp_parser_objc_statement (parser);
8633 statement = cp_parser_try_block (parser);
8637 /* This must be a namespace alias definition. */
8638 cp_parser_declaration_statement (parser);
8641 case RID_TRANSACTION_ATOMIC:
8642 case RID_TRANSACTION_RELAXED:
8643 statement = cp_parser_transaction (parser, keyword);
8645 case RID_TRANSACTION_CANCEL:
8646 statement = cp_parser_transaction_cancel (parser);
8650 /* It might be a keyword like `int' that can start a
8651 declaration-statement. */
8655 else if (token->type == CPP_NAME)
8657 /* If the next token is a `:', then we are looking at a
8658 labeled-statement. */
8659 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8660 if (token->type == CPP_COLON)
8662 /* Looks like a labeled-statement with an ordinary label.
8663 Parse the label, and then use tail recursion to parse
8665 cp_parser_label_for_labeled_statement (parser);
8669 /* Anything that starts with a `{' must be a compound-statement. */
8670 else if (token->type == CPP_OPEN_BRACE)
8671 statement = cp_parser_compound_statement (parser, NULL, false, false);
8672 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8673 a statement all its own. */
8674 else if (token->type == CPP_PRAGMA)
8676 /* Only certain OpenMP pragmas are attached to statements, and thus
8677 are considered statements themselves. All others are not. In
8678 the context of a compound, accept the pragma as a "statement" and
8679 return so that we can check for a close brace. Otherwise we
8680 require a real statement and must go back and read one. */
8682 cp_parser_pragma (parser, pragma_compound);
8683 else if (!cp_parser_pragma (parser, pragma_stmt))
8687 else if (token->type == CPP_EOF)
8689 cp_parser_error (parser, "expected statement");
8693 /* Everything else must be a declaration-statement or an
8694 expression-statement. Try for the declaration-statement
8695 first, unless we are looking at a `;', in which case we know that
8696 we have an expression-statement. */
8699 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8701 cp_parser_parse_tentatively (parser);
8702 /* Try to parse the declaration-statement. */
8703 cp_parser_declaration_statement (parser);
8704 /* If that worked, we're done. */
8705 if (cp_parser_parse_definitely (parser))
8708 /* Look for an expression-statement instead. */
8709 statement = cp_parser_expression_statement (parser, in_statement_expr);
8712 /* Set the line number for the statement. */
8713 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
8714 SET_EXPR_LOCATION (statement, statement_location);
8717 /* Parse the label for a labeled-statement, i.e.
8720 case constant-expression :
8724 case constant-expression ... constant-expression : statement
8726 When a label is parsed without errors, the label is added to the
8727 parse tree by the finish_* functions, so this function doesn't
8728 have to return the label. */
8731 cp_parser_label_for_labeled_statement (cp_parser* parser)
8734 tree label = NULL_TREE;
8735 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
8737 /* The next token should be an identifier. */
8738 token = cp_lexer_peek_token (parser->lexer);
8739 if (token->type != CPP_NAME
8740 && token->type != CPP_KEYWORD)
8742 cp_parser_error (parser, "expected labeled-statement");
8746 parser->colon_corrects_to_scope_p = false;
8747 switch (token->keyword)
8754 /* Consume the `case' token. */
8755 cp_lexer_consume_token (parser->lexer);
8756 /* Parse the constant-expression. */
8757 expr = cp_parser_constant_expression (parser,
8758 /*allow_non_constant_p=*/false,
8761 ellipsis = cp_lexer_peek_token (parser->lexer);
8762 if (ellipsis->type == CPP_ELLIPSIS)
8764 /* Consume the `...' token. */
8765 cp_lexer_consume_token (parser->lexer);
8767 cp_parser_constant_expression (parser,
8768 /*allow_non_constant_p=*/false,
8770 /* We don't need to emit warnings here, as the common code
8771 will do this for us. */
8774 expr_hi = NULL_TREE;
8776 if (parser->in_switch_statement_p)
8777 finish_case_label (token->location, expr, expr_hi);
8779 error_at (token->location,
8780 "case label %qE not within a switch statement",
8786 /* Consume the `default' token. */
8787 cp_lexer_consume_token (parser->lexer);
8789 if (parser->in_switch_statement_p)
8790 finish_case_label (token->location, NULL_TREE, NULL_TREE);
8792 error_at (token->location, "case label not within a switch statement");
8796 /* Anything else must be an ordinary label. */
8797 label = finish_label_stmt (cp_parser_identifier (parser));
8801 /* Require the `:' token. */
8802 cp_parser_require (parser, CPP_COLON, RT_COLON);
8804 /* An ordinary label may optionally be followed by attributes.
8805 However, this is only permitted if the attributes are then
8806 followed by a semicolon. This is because, for backward
8807 compatibility, when parsing
8808 lab: __attribute__ ((unused)) int i;
8809 we want the attribute to attach to "i", not "lab". */
8810 if (label != NULL_TREE
8811 && cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
8815 cp_parser_parse_tentatively (parser);
8816 attrs = cp_parser_attributes_opt (parser);
8817 if (attrs == NULL_TREE
8818 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8819 cp_parser_abort_tentative_parse (parser);
8820 else if (!cp_parser_parse_definitely (parser))
8823 cplus_decl_attributes (&label, attrs, 0);
8826 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
8829 /* Parse an expression-statement.
8831 expression-statement:
8834 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8835 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8836 indicates whether this expression-statement is part of an
8837 expression statement. */
8840 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
8842 tree statement = NULL_TREE;
8843 cp_token *token = cp_lexer_peek_token (parser->lexer);
8845 /* If the next token is a ';', then there is no expression
8847 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8848 statement = cp_parser_expression (parser, /*cast_p=*/false, NULL);
8850 /* Give a helpful message for "A<T>::type t;" and the like. */
8851 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
8852 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
8854 if (TREE_CODE (statement) == SCOPE_REF)
8855 error_at (token->location, "need %<typename%> before %qE because "
8856 "%qT is a dependent scope",
8857 statement, TREE_OPERAND (statement, 0));
8858 else if (is_overloaded_fn (statement)
8859 && DECL_CONSTRUCTOR_P (get_first_fn (statement)))
8862 tree fn = get_first_fn (statement);
8863 error_at (token->location,
8864 "%<%T::%D%> names the constructor, not the type",
8865 DECL_CONTEXT (fn), DECL_NAME (fn));
8869 /* Consume the final `;'. */
8870 cp_parser_consume_semicolon_at_end_of_statement (parser);
8872 if (in_statement_expr
8873 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
8874 /* This is the final expression statement of a statement
8876 statement = finish_stmt_expr_expr (statement, in_statement_expr);
8878 statement = finish_expr_stmt (statement);
8885 /* Parse a compound-statement.
8888 { statement-seq [opt] }
8893 { label-declaration-seq [opt] statement-seq [opt] }
8895 label-declaration-seq:
8897 label-declaration-seq label-declaration
8899 Returns a tree representing the statement. */
8902 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
8903 bool in_try, bool function_body)
8907 /* Consume the `{'. */
8908 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8909 return error_mark_node;
8910 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
8912 pedwarn (input_location, OPT_pedantic,
8913 "compound-statement in constexpr function");
8914 /* Begin the compound-statement. */
8915 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
8916 /* If the next keyword is `__label__' we have a label declaration. */
8917 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
8918 cp_parser_label_declaration (parser);
8919 /* Parse an (optional) statement-seq. */
8920 cp_parser_statement_seq_opt (parser, in_statement_expr);
8921 /* Finish the compound-statement. */
8922 finish_compound_stmt (compound_stmt);
8923 /* Consume the `}'. */
8924 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8926 return compound_stmt;
8929 /* Parse an (optional) statement-seq.
8933 statement-seq [opt] statement */
8936 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
8938 /* Scan statements until there aren't any more. */
8941 cp_token *token = cp_lexer_peek_token (parser->lexer);
8943 /* If we are looking at a `}', then we have run out of
8944 statements; the same is true if we have reached the end
8945 of file, or have stumbled upon a stray '@end'. */
8946 if (token->type == CPP_CLOSE_BRACE
8947 || token->type == CPP_EOF
8948 || token->type == CPP_PRAGMA_EOL
8949 || (token->type == CPP_KEYWORD && token->keyword == RID_AT_END))
8952 /* If we are in a compound statement and find 'else' then
8953 something went wrong. */
8954 else if (token->type == CPP_KEYWORD && token->keyword == RID_ELSE)
8956 if (parser->in_statement & IN_IF_STMT)
8960 token = cp_lexer_consume_token (parser->lexer);
8961 error_at (token->location, "%<else%> without a previous %<if%>");
8965 /* Parse the statement. */
8966 cp_parser_statement (parser, in_statement_expr, true, NULL);
8970 /* Parse a selection-statement.
8972 selection-statement:
8973 if ( condition ) statement
8974 if ( condition ) statement else statement
8975 switch ( condition ) statement
8977 Returns the new IF_STMT or SWITCH_STMT.
8979 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8980 is a (possibly labeled) if statement which is not enclosed in
8981 braces and has an else clause. This is used to implement
8985 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
8993 /* Peek at the next token. */
8994 token = cp_parser_require (parser, CPP_KEYWORD, RT_SELECT);
8996 /* See what kind of keyword it is. */
8997 keyword = token->keyword;
9006 /* Look for the `('. */
9007 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
9009 cp_parser_skip_to_end_of_statement (parser);
9010 return error_mark_node;
9013 /* Begin the selection-statement. */
9014 if (keyword == RID_IF)
9015 statement = begin_if_stmt ();
9017 statement = begin_switch_stmt ();
9019 /* Parse the condition. */
9020 condition = cp_parser_condition (parser);
9021 /* Look for the `)'. */
9022 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
9023 cp_parser_skip_to_closing_parenthesis (parser, true, false,
9024 /*consume_paren=*/true);
9026 if (keyword == RID_IF)
9029 unsigned char in_statement;
9031 /* Add the condition. */
9032 finish_if_stmt_cond (condition, statement);
9034 /* Parse the then-clause. */
9035 in_statement = parser->in_statement;
9036 parser->in_statement |= IN_IF_STMT;
9037 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9039 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
9040 add_stmt (build_empty_stmt (loc));
9041 cp_lexer_consume_token (parser->lexer);
9042 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_ELSE))
9043 warning_at (loc, OPT_Wempty_body, "suggest braces around "
9044 "empty body in an %<if%> statement");
9048 cp_parser_implicitly_scoped_statement (parser, &nested_if);
9049 parser->in_statement = in_statement;
9051 finish_then_clause (statement);
9053 /* If the next token is `else', parse the else-clause. */
9054 if (cp_lexer_next_token_is_keyword (parser->lexer,
9057 /* Consume the `else' keyword. */
9058 cp_lexer_consume_token (parser->lexer);
9059 begin_else_clause (statement);
9060 /* Parse the else-clause. */
9061 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9064 loc = cp_lexer_peek_token (parser->lexer)->location;
9066 OPT_Wempty_body, "suggest braces around "
9067 "empty body in an %<else%> statement");
9068 add_stmt (build_empty_stmt (loc));
9069 cp_lexer_consume_token (parser->lexer);
9072 cp_parser_implicitly_scoped_statement (parser, NULL);
9074 finish_else_clause (statement);
9076 /* If we are currently parsing a then-clause, then
9077 IF_P will not be NULL. We set it to true to
9078 indicate that this if statement has an else clause.
9079 This may trigger the Wparentheses warning below
9080 when we get back up to the parent if statement. */
9086 /* This if statement does not have an else clause. If
9087 NESTED_IF is true, then the then-clause is an if
9088 statement which does have an else clause. We warn
9089 about the potential ambiguity. */
9091 warning_at (EXPR_LOCATION (statement), OPT_Wparentheses,
9092 "suggest explicit braces to avoid ambiguous"
9096 /* Now we're all done with the if-statement. */
9097 finish_if_stmt (statement);
9101 bool in_switch_statement_p;
9102 unsigned char in_statement;
9104 /* Add the condition. */
9105 finish_switch_cond (condition, statement);
9107 /* Parse the body of the switch-statement. */
9108 in_switch_statement_p = parser->in_switch_statement_p;
9109 in_statement = parser->in_statement;
9110 parser->in_switch_statement_p = true;
9111 parser->in_statement |= IN_SWITCH_STMT;
9112 cp_parser_implicitly_scoped_statement (parser, NULL);
9113 parser->in_switch_statement_p = in_switch_statement_p;
9114 parser->in_statement = in_statement;
9116 /* Now we're all done with the switch-statement. */
9117 finish_switch_stmt (statement);
9125 cp_parser_error (parser, "expected selection-statement");
9126 return error_mark_node;
9130 /* Parse a condition.
9134 type-specifier-seq declarator = initializer-clause
9135 type-specifier-seq declarator braced-init-list
9140 type-specifier-seq declarator asm-specification [opt]
9141 attributes [opt] = assignment-expression
9143 Returns the expression that should be tested. */
9146 cp_parser_condition (cp_parser* parser)
9148 cp_decl_specifier_seq type_specifiers;
9149 const char *saved_message;
9150 int declares_class_or_enum;
9152 /* Try the declaration first. */
9153 cp_parser_parse_tentatively (parser);
9154 /* New types are not allowed in the type-specifier-seq for a
9156 saved_message = parser->type_definition_forbidden_message;
9157 parser->type_definition_forbidden_message
9158 = G_("types may not be defined in conditions");
9159 /* Parse the type-specifier-seq. */
9160 cp_parser_decl_specifier_seq (parser,
9161 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9163 &declares_class_or_enum);
9164 /* Restore the saved message. */
9165 parser->type_definition_forbidden_message = saved_message;
9166 /* If all is well, we might be looking at a declaration. */
9167 if (!cp_parser_error_occurred (parser))
9170 tree asm_specification;
9172 cp_declarator *declarator;
9173 tree initializer = NULL_TREE;
9175 /* Parse the declarator. */
9176 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9177 /*ctor_dtor_or_conv_p=*/NULL,
9178 /*parenthesized_p=*/NULL,
9179 /*member_p=*/false);
9180 /* Parse the attributes. */
9181 attributes = cp_parser_attributes_opt (parser);
9182 /* Parse the asm-specification. */
9183 asm_specification = cp_parser_asm_specification_opt (parser);
9184 /* If the next token is not an `=' or '{', then we might still be
9185 looking at an expression. For example:
9189 looks like a decl-specifier-seq and a declarator -- but then
9190 there is no `=', so this is an expression. */
9191 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
9192 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
9193 cp_parser_simulate_error (parser);
9195 /* If we did see an `=' or '{', then we are looking at a declaration
9197 if (cp_parser_parse_definitely (parser))
9200 bool non_constant_p;
9201 bool flags = LOOKUP_ONLYCONVERTING;
9203 /* Create the declaration. */
9204 decl = start_decl (declarator, &type_specifiers,
9205 /*initialized_p=*/true,
9206 attributes, /*prefix_attributes=*/NULL_TREE,
9209 /* Parse the initializer. */
9210 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9212 initializer = cp_parser_braced_list (parser, &non_constant_p);
9213 CONSTRUCTOR_IS_DIRECT_INIT (initializer) = 1;
9218 /* Consume the `='. */
9219 cp_parser_require (parser, CPP_EQ, RT_EQ);
9220 initializer = cp_parser_initializer_clause (parser, &non_constant_p);
9222 if (BRACE_ENCLOSED_INITIALIZER_P (initializer))
9223 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
9225 /* Process the initializer. */
9226 cp_finish_decl (decl,
9227 initializer, !non_constant_p,
9232 pop_scope (pushed_scope);
9234 return convert_from_reference (decl);
9237 /* If we didn't even get past the declarator successfully, we are
9238 definitely not looking at a declaration. */
9240 cp_parser_abort_tentative_parse (parser);
9242 /* Otherwise, we are looking at an expression. */
9243 return cp_parser_expression (parser, /*cast_p=*/false, NULL);
9246 /* Parses a for-statement or range-for-statement until the closing ')',
9250 cp_parser_for (cp_parser *parser)
9252 tree init, scope, decl;
9255 /* Begin the for-statement. */
9256 scope = begin_for_scope (&init);
9258 /* Parse the initialization. */
9259 is_range_for = cp_parser_for_init_statement (parser, &decl);
9262 return cp_parser_range_for (parser, scope, init, decl);
9264 return cp_parser_c_for (parser, scope, init);
9268 cp_parser_c_for (cp_parser *parser, tree scope, tree init)
9270 /* Normal for loop */
9271 tree condition = NULL_TREE;
9272 tree expression = NULL_TREE;
9275 stmt = begin_for_stmt (scope, init);
9276 /* The for-init-statement has already been parsed in
9277 cp_parser_for_init_statement, so no work is needed here. */
9278 finish_for_init_stmt (stmt);
9280 /* If there's a condition, process it. */
9281 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9282 condition = cp_parser_condition (parser);
9283 finish_for_cond (condition, stmt);
9284 /* Look for the `;'. */
9285 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9287 /* If there's an expression, process it. */
9288 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
9289 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9290 finish_for_expr (expression, stmt);
9295 /* Tries to parse a range-based for-statement:
9298 decl-specifier-seq declarator : expression
9300 The decl-specifier-seq declarator and the `:' are already parsed by
9301 cp_parser_for_init_statement. If processing_template_decl it returns a
9302 newly created RANGE_FOR_STMT; if not, it is converted to a
9303 regular FOR_STMT. */
9306 cp_parser_range_for (cp_parser *parser, tree scope, tree init, tree range_decl)
9308 tree stmt, range_expr;
9310 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9312 bool expr_non_constant_p;
9313 range_expr = cp_parser_braced_list (parser, &expr_non_constant_p);
9316 range_expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9318 /* If in template, STMT is converted to a normal for-statement
9319 at instantiation. If not, it is done just ahead. */
9320 if (processing_template_decl)
9322 if (check_for_bare_parameter_packs (range_expr))
9323 range_expr = error_mark_node;
9324 stmt = begin_range_for_stmt (scope, init);
9325 finish_range_for_decl (stmt, range_decl, range_expr);
9326 if (!type_dependent_expression_p (range_expr)
9327 /* do_auto_deduction doesn't mess with template init-lists. */
9328 && !BRACE_ENCLOSED_INITIALIZER_P (range_expr))
9329 do_range_for_auto_deduction (range_decl, range_expr);
9333 stmt = begin_for_stmt (scope, init);
9334 stmt = cp_convert_range_for (stmt, range_decl, range_expr);
9339 /* Subroutine of cp_convert_range_for: given the initializer expression,
9340 builds up the range temporary. */
9343 build_range_temp (tree range_expr)
9345 tree range_type, range_temp;
9347 /* Find out the type deduced by the declaration
9348 `auto &&__range = range_expr'. */
9349 range_type = cp_build_reference_type (make_auto (), true);
9350 range_type = do_auto_deduction (range_type, range_expr,
9351 type_uses_auto (range_type));
9353 /* Create the __range variable. */
9354 range_temp = build_decl (input_location, VAR_DECL,
9355 get_identifier ("__for_range"), range_type);
9356 TREE_USED (range_temp) = 1;
9357 DECL_ARTIFICIAL (range_temp) = 1;
9362 /* Used by cp_parser_range_for in template context: we aren't going to
9363 do a full conversion yet, but we still need to resolve auto in the
9364 type of the for-range-declaration if present. This is basically
9365 a shortcut version of cp_convert_range_for. */
9368 do_range_for_auto_deduction (tree decl, tree range_expr)
9370 tree auto_node = type_uses_auto (TREE_TYPE (decl));
9373 tree begin_dummy, end_dummy, range_temp, iter_type, iter_decl;
9374 range_temp = convert_from_reference (build_range_temp (range_expr));
9375 iter_type = (cp_parser_perform_range_for_lookup
9376 (range_temp, &begin_dummy, &end_dummy));
9377 iter_decl = build_decl (input_location, VAR_DECL, NULL_TREE, iter_type);
9378 iter_decl = build_x_indirect_ref (iter_decl, RO_NULL,
9379 tf_warning_or_error);
9380 TREE_TYPE (decl) = do_auto_deduction (TREE_TYPE (decl),
9381 iter_decl, auto_node);
9385 /* Converts a range-based for-statement into a normal
9386 for-statement, as per the definition.
9388 for (RANGE_DECL : RANGE_EXPR)
9391 should be equivalent to:
9394 auto &&__range = RANGE_EXPR;
9395 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9399 RANGE_DECL = *__begin;
9404 If RANGE_EXPR is an array:
9405 BEGIN_EXPR = __range
9406 END_EXPR = __range + ARRAY_SIZE(__range)
9407 Else if RANGE_EXPR has a member 'begin' or 'end':
9408 BEGIN_EXPR = __range.begin()
9409 END_EXPR = __range.end()
9411 BEGIN_EXPR = begin(__range)
9412 END_EXPR = end(__range);
9414 If __range has a member 'begin' but not 'end', or vice versa, we must
9415 still use the second alternative (it will surely fail, however).
9416 When calling begin()/end() in the third alternative we must use
9417 argument dependent lookup, but always considering 'std' as an associated
9421 cp_convert_range_for (tree statement, tree range_decl, tree range_expr)
9424 tree iter_type, begin_expr, end_expr;
9425 tree condition, expression;
9427 if (range_decl == error_mark_node || range_expr == error_mark_node)
9428 /* If an error happened previously do nothing or else a lot of
9429 unhelpful errors would be issued. */
9430 begin_expr = end_expr = iter_type = error_mark_node;
9433 tree range_temp = build_range_temp (range_expr);
9434 pushdecl (range_temp);
9435 cp_finish_decl (range_temp, range_expr,
9436 /*is_constant_init*/false, NULL_TREE,
9437 LOOKUP_ONLYCONVERTING);
9439 range_temp = convert_from_reference (range_temp);
9440 iter_type = cp_parser_perform_range_for_lookup (range_temp,
9441 &begin_expr, &end_expr);
9444 /* The new for initialization statement. */
9445 begin = build_decl (input_location, VAR_DECL,
9446 get_identifier ("__for_begin"), iter_type);
9447 TREE_USED (begin) = 1;
9448 DECL_ARTIFICIAL (begin) = 1;
9450 cp_finish_decl (begin, begin_expr,
9451 /*is_constant_init*/false, NULL_TREE,
9452 LOOKUP_ONLYCONVERTING);
9454 end = build_decl (input_location, VAR_DECL,
9455 get_identifier ("__for_end"), iter_type);
9456 TREE_USED (end) = 1;
9457 DECL_ARTIFICIAL (end) = 1;
9459 cp_finish_decl (end, end_expr,
9460 /*is_constant_init*/false, NULL_TREE,
9461 LOOKUP_ONLYCONVERTING);
9463 finish_for_init_stmt (statement);
9465 /* The new for condition. */
9466 condition = build_x_binary_op (NE_EXPR,
9469 NULL, tf_warning_or_error);
9470 finish_for_cond (condition, statement);
9472 /* The new increment expression. */
9473 expression = finish_unary_op_expr (PREINCREMENT_EXPR, begin);
9474 finish_for_expr (expression, statement);
9476 /* The declaration is initialized with *__begin inside the loop body. */
9477 cp_finish_decl (range_decl,
9478 build_x_indirect_ref (begin, RO_NULL, tf_warning_or_error),
9479 /*is_constant_init*/false, NULL_TREE,
9480 LOOKUP_ONLYCONVERTING);
9485 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9486 We need to solve both at the same time because the method used
9487 depends on the existence of members begin or end.
9488 Returns the type deduced for the iterator expression. */
9491 cp_parser_perform_range_for_lookup (tree range, tree *begin, tree *end)
9493 if (error_operand_p (range))
9495 *begin = *end = error_mark_node;
9496 return error_mark_node;
9499 if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (range))))
9501 error ("range-based %<for%> expression of type %qT "
9502 "has incomplete type", TREE_TYPE (range));
9503 *begin = *end = error_mark_node;
9504 return error_mark_node;
9506 if (TREE_CODE (TREE_TYPE (range)) == ARRAY_TYPE)
9508 /* If RANGE is an array, we will use pointer arithmetic. */
9510 *end = build_binary_op (input_location, PLUS_EXPR,
9512 array_type_nelts_top (TREE_TYPE (range)),
9514 return build_pointer_type (TREE_TYPE (TREE_TYPE (range)));
9518 /* If it is not an array, we must do a bit of magic. */
9519 tree id_begin, id_end;
9520 tree member_begin, member_end;
9522 *begin = *end = error_mark_node;
9524 id_begin = get_identifier ("begin");
9525 id_end = get_identifier ("end");
9526 member_begin = lookup_member (TREE_TYPE (range), id_begin,
9527 /*protect=*/2, /*want_type=*/false,
9528 tf_warning_or_error);
9529 member_end = lookup_member (TREE_TYPE (range), id_end,
9530 /*protect=*/2, /*want_type=*/false,
9531 tf_warning_or_error);
9533 if (member_begin != NULL_TREE || member_end != NULL_TREE)
9535 /* Use the member functions. */
9536 if (member_begin != NULL_TREE)
9537 *begin = cp_parser_range_for_member_function (range, id_begin);
9539 error ("range-based %<for%> expression of type %qT has an "
9540 "%<end%> member but not a %<begin%>", TREE_TYPE (range));
9542 if (member_end != NULL_TREE)
9543 *end = cp_parser_range_for_member_function (range, id_end);
9545 error ("range-based %<for%> expression of type %qT has a "
9546 "%<begin%> member but not an %<end%>", TREE_TYPE (range));
9550 /* Use global functions with ADL. */
9552 vec = make_tree_vector ();
9554 VEC_safe_push (tree, gc, vec, range);
9556 member_begin = perform_koenig_lookup (id_begin, vec,
9557 /*include_std=*/true,
9558 tf_warning_or_error);
9559 *begin = finish_call_expr (member_begin, &vec, false, true,
9560 tf_warning_or_error);
9561 member_end = perform_koenig_lookup (id_end, vec,
9562 /*include_std=*/true,
9563 tf_warning_or_error);
9564 *end = finish_call_expr (member_end, &vec, false, true,
9565 tf_warning_or_error);
9567 release_tree_vector (vec);
9570 /* Last common checks. */
9571 if (*begin == error_mark_node || *end == error_mark_node)
9573 /* If one of the expressions is an error do no more checks. */
9574 *begin = *end = error_mark_node;
9575 return error_mark_node;
9579 tree iter_type = cv_unqualified (TREE_TYPE (*begin));
9580 /* The unqualified type of the __begin and __end temporaries should
9581 be the same, as required by the multiple auto declaration. */
9582 if (!same_type_p (iter_type, cv_unqualified (TREE_TYPE (*end))))
9583 error ("inconsistent begin/end types in range-based %<for%> "
9584 "statement: %qT and %qT",
9585 TREE_TYPE (*begin), TREE_TYPE (*end));
9591 /* Helper function for cp_parser_perform_range_for_lookup.
9592 Builds a tree for RANGE.IDENTIFIER(). */
9595 cp_parser_range_for_member_function (tree range, tree identifier)
9600 member = finish_class_member_access_expr (range, identifier,
9601 false, tf_warning_or_error);
9602 if (member == error_mark_node)
9603 return error_mark_node;
9605 vec = make_tree_vector ();
9606 res = finish_call_expr (member, &vec,
9607 /*disallow_virtual=*/false,
9609 tf_warning_or_error);
9610 release_tree_vector (vec);
9614 /* Parse an iteration-statement.
9616 iteration-statement:
9617 while ( condition ) statement
9618 do statement while ( expression ) ;
9619 for ( for-init-statement condition [opt] ; expression [opt] )
9622 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9625 cp_parser_iteration_statement (cp_parser* parser)
9630 unsigned char in_statement;
9632 /* Peek at the next token. */
9633 token = cp_parser_require (parser, CPP_KEYWORD, RT_INTERATION);
9635 return error_mark_node;
9637 /* Remember whether or not we are already within an iteration
9639 in_statement = parser->in_statement;
9641 /* See what kind of keyword it is. */
9642 keyword = token->keyword;
9649 /* Begin the while-statement. */
9650 statement = begin_while_stmt ();
9651 /* Look for the `('. */
9652 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
9653 /* Parse the condition. */
9654 condition = cp_parser_condition (parser);
9655 finish_while_stmt_cond (condition, statement);
9656 /* Look for the `)'. */
9657 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
9658 /* Parse the dependent statement. */
9659 parser->in_statement = IN_ITERATION_STMT;
9660 cp_parser_already_scoped_statement (parser);
9661 parser->in_statement = in_statement;
9662 /* We're done with the while-statement. */
9663 finish_while_stmt (statement);
9671 /* Begin the do-statement. */
9672 statement = begin_do_stmt ();
9673 /* Parse the body of the do-statement. */
9674 parser->in_statement = IN_ITERATION_STMT;
9675 cp_parser_implicitly_scoped_statement (parser, NULL);
9676 parser->in_statement = in_statement;
9677 finish_do_body (statement);
9678 /* Look for the `while' keyword. */
9679 cp_parser_require_keyword (parser, RID_WHILE, RT_WHILE);
9680 /* Look for the `('. */
9681 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
9682 /* Parse the expression. */
9683 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9684 /* We're done with the do-statement. */
9685 finish_do_stmt (expression, statement);
9686 /* Look for the `)'. */
9687 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
9688 /* Look for the `;'. */
9689 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9695 /* Look for the `('. */
9696 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
9698 statement = cp_parser_for (parser);
9700 /* Look for the `)'. */
9701 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
9703 /* Parse the body of the for-statement. */
9704 parser->in_statement = IN_ITERATION_STMT;
9705 cp_parser_already_scoped_statement (parser);
9706 parser->in_statement = in_statement;
9708 /* We're done with the for-statement. */
9709 finish_for_stmt (statement);
9714 cp_parser_error (parser, "expected iteration-statement");
9715 statement = error_mark_node;
9722 /* Parse a for-init-statement or the declarator of a range-based-for.
9723 Returns true if a range-based-for declaration is seen.
9726 expression-statement
9727 simple-declaration */
9730 cp_parser_for_init_statement (cp_parser* parser, tree *decl)
9732 /* If the next token is a `;', then we have an empty
9733 expression-statement. Grammatically, this is also a
9734 simple-declaration, but an invalid one, because it does not
9735 declare anything. Therefore, if we did not handle this case
9736 specially, we would issue an error message about an invalid
9738 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9740 bool is_range_for = false;
9741 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
9743 parser->colon_corrects_to_scope_p = false;
9745 /* We're going to speculatively look for a declaration, falling back
9746 to an expression, if necessary. */
9747 cp_parser_parse_tentatively (parser);
9748 /* Parse the declaration. */
9749 cp_parser_simple_declaration (parser,
9750 /*function_definition_allowed_p=*/false,
9752 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
9753 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
9755 /* It is a range-for, consume the ':' */
9756 cp_lexer_consume_token (parser->lexer);
9757 is_range_for = true;
9758 if (cxx_dialect < cxx0x)
9760 error_at (cp_lexer_peek_token (parser->lexer)->location,
9761 "range-based %<for%> loops are not allowed "
9763 *decl = error_mark_node;
9767 /* The ';' is not consumed yet because we told
9768 cp_parser_simple_declaration not to. */
9769 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9771 if (cp_parser_parse_definitely (parser))
9772 return is_range_for;
9773 /* If the tentative parse failed, then we shall need to look for an
9774 expression-statement. */
9776 /* If we are here, it is an expression-statement. */
9777 cp_parser_expression_statement (parser, NULL_TREE);
9781 /* Parse a jump-statement.
9786 return expression [opt] ;
9787 return braced-init-list ;
9795 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9798 cp_parser_jump_statement (cp_parser* parser)
9800 tree statement = error_mark_node;
9803 unsigned char in_statement;
9805 /* Peek at the next token. */
9806 token = cp_parser_require (parser, CPP_KEYWORD, RT_JUMP);
9808 return error_mark_node;
9810 /* See what kind of keyword it is. */
9811 keyword = token->keyword;
9815 in_statement = parser->in_statement & ~IN_IF_STMT;
9816 switch (in_statement)
9819 error_at (token->location, "break statement not within loop or switch");
9822 gcc_assert ((in_statement & IN_SWITCH_STMT)
9823 || in_statement == IN_ITERATION_STMT);
9824 statement = finish_break_stmt ();
9827 error_at (token->location, "invalid exit from OpenMP structured block");
9830 error_at (token->location, "break statement used with OpenMP for loop");
9833 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9837 switch (parser->in_statement & ~(IN_SWITCH_STMT | IN_IF_STMT))
9840 error_at (token->location, "continue statement not within a loop");
9842 case IN_ITERATION_STMT:
9844 statement = finish_continue_stmt ();
9847 error_at (token->location, "invalid exit from OpenMP structured block");
9852 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9858 bool expr_non_constant_p;
9860 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9862 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
9863 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
9865 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9866 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9868 /* If the next token is a `;', then there is no
9871 /* Build the return-statement. */
9872 statement = finish_return_stmt (expr);
9873 /* Look for the final `;'. */
9874 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9879 /* Create the goto-statement. */
9880 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
9882 /* Issue a warning about this use of a GNU extension. */
9883 pedwarn (token->location, OPT_pedantic, "ISO C++ forbids computed gotos");
9884 /* Consume the '*' token. */
9885 cp_lexer_consume_token (parser->lexer);
9886 /* Parse the dependent expression. */
9887 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false, NULL));
9890 finish_goto_stmt (cp_parser_identifier (parser));
9891 /* Look for the final `;'. */
9892 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9896 cp_parser_error (parser, "expected jump-statement");
9903 /* Parse a declaration-statement.
9905 declaration-statement:
9906 block-declaration */
9909 cp_parser_declaration_statement (cp_parser* parser)
9913 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9914 p = obstack_alloc (&declarator_obstack, 0);
9916 /* Parse the block-declaration. */
9917 cp_parser_block_declaration (parser, /*statement_p=*/true);
9919 /* Free any declarators allocated. */
9920 obstack_free (&declarator_obstack, p);
9922 /* Finish off the statement. */
9926 /* Some dependent statements (like `if (cond) statement'), are
9927 implicitly in their own scope. In other words, if the statement is
9928 a single statement (as opposed to a compound-statement), it is
9929 none-the-less treated as if it were enclosed in braces. Any
9930 declarations appearing in the dependent statement are out of scope
9931 after control passes that point. This function parses a statement,
9932 but ensures that is in its own scope, even if it is not a
9935 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9936 is a (possibly labeled) if statement which is not enclosed in
9937 braces and has an else clause. This is used to implement
9940 Returns the new statement. */
9943 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
9950 /* Mark if () ; with a special NOP_EXPR. */
9951 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9953 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
9954 cp_lexer_consume_token (parser->lexer);
9955 statement = add_stmt (build_empty_stmt (loc));
9957 /* if a compound is opened, we simply parse the statement directly. */
9958 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9959 statement = cp_parser_compound_statement (parser, NULL, false, false);
9960 /* If the token is not a `{', then we must take special action. */
9963 /* Create a compound-statement. */
9964 statement = begin_compound_stmt (0);
9965 /* Parse the dependent-statement. */
9966 cp_parser_statement (parser, NULL_TREE, false, if_p);
9967 /* Finish the dummy compound-statement. */
9968 finish_compound_stmt (statement);
9971 /* Return the statement. */
9975 /* For some dependent statements (like `while (cond) statement'), we
9976 have already created a scope. Therefore, even if the dependent
9977 statement is a compound-statement, we do not want to create another
9981 cp_parser_already_scoped_statement (cp_parser* parser)
9983 /* If the token is a `{', then we must take special action. */
9984 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
9985 cp_parser_statement (parser, NULL_TREE, false, NULL);
9988 /* Avoid calling cp_parser_compound_statement, so that we
9989 don't create a new scope. Do everything else by hand. */
9990 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
9991 /* If the next keyword is `__label__' we have a label declaration. */
9992 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
9993 cp_parser_label_declaration (parser);
9994 /* Parse an (optional) statement-seq. */
9995 cp_parser_statement_seq_opt (parser, NULL_TREE);
9996 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
10000 /* Declarations [gram.dcl.dcl] */
10002 /* Parse an optional declaration-sequence.
10006 declaration-seq declaration */
10009 cp_parser_declaration_seq_opt (cp_parser* parser)
10015 token = cp_lexer_peek_token (parser->lexer);
10017 if (token->type == CPP_CLOSE_BRACE
10018 || token->type == CPP_EOF
10019 || token->type == CPP_PRAGMA_EOL)
10022 if (token->type == CPP_SEMICOLON)
10024 /* A declaration consisting of a single semicolon is
10025 invalid. Allow it unless we're being pedantic. */
10026 cp_lexer_consume_token (parser->lexer);
10027 if (!in_system_header)
10028 pedwarn (input_location, OPT_pedantic, "extra %<;%>");
10032 /* If we're entering or exiting a region that's implicitly
10033 extern "C", modify the lang context appropriately. */
10034 if (!parser->implicit_extern_c && token->implicit_extern_c)
10036 push_lang_context (lang_name_c);
10037 parser->implicit_extern_c = true;
10039 else if (parser->implicit_extern_c && !token->implicit_extern_c)
10041 pop_lang_context ();
10042 parser->implicit_extern_c = false;
10045 if (token->type == CPP_PRAGMA)
10047 /* A top-level declaration can consist solely of a #pragma.
10048 A nested declaration cannot, so this is done here and not
10049 in cp_parser_declaration. (A #pragma at block scope is
10050 handled in cp_parser_statement.) */
10051 cp_parser_pragma (parser, pragma_external);
10055 /* Parse the declaration itself. */
10056 cp_parser_declaration (parser);
10060 /* Parse a declaration.
10064 function-definition
10065 template-declaration
10066 explicit-instantiation
10067 explicit-specialization
10068 linkage-specification
10069 namespace-definition
10074 __extension__ declaration */
10077 cp_parser_declaration (cp_parser* parser)
10081 int saved_pedantic;
10083 tree attributes = NULL_TREE;
10085 /* Check for the `__extension__' keyword. */
10086 if (cp_parser_extension_opt (parser, &saved_pedantic))
10088 /* Parse the qualified declaration. */
10089 cp_parser_declaration (parser);
10090 /* Restore the PEDANTIC flag. */
10091 pedantic = saved_pedantic;
10096 /* Try to figure out what kind of declaration is present. */
10097 token1 = *cp_lexer_peek_token (parser->lexer);
10099 if (token1.type != CPP_EOF)
10100 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
10103 token2.type = CPP_EOF;
10104 token2.keyword = RID_MAX;
10107 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10108 p = obstack_alloc (&declarator_obstack, 0);
10110 /* If the next token is `extern' and the following token is a string
10111 literal, then we have a linkage specification. */
10112 if (token1.keyword == RID_EXTERN
10113 && cp_parser_is_pure_string_literal (&token2))
10114 cp_parser_linkage_specification (parser);
10115 /* If the next token is `template', then we have either a template
10116 declaration, an explicit instantiation, or an explicit
10118 else if (token1.keyword == RID_TEMPLATE)
10120 /* `template <>' indicates a template specialization. */
10121 if (token2.type == CPP_LESS
10122 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
10123 cp_parser_explicit_specialization (parser);
10124 /* `template <' indicates a template declaration. */
10125 else if (token2.type == CPP_LESS)
10126 cp_parser_template_declaration (parser, /*member_p=*/false);
10127 /* Anything else must be an explicit instantiation. */
10129 cp_parser_explicit_instantiation (parser);
10131 /* If the next token is `export', then we have a template
10133 else if (token1.keyword == RID_EXPORT)
10134 cp_parser_template_declaration (parser, /*member_p=*/false);
10135 /* If the next token is `extern', 'static' or 'inline' and the one
10136 after that is `template', we have a GNU extended explicit
10137 instantiation directive. */
10138 else if (cp_parser_allow_gnu_extensions_p (parser)
10139 && (token1.keyword == RID_EXTERN
10140 || token1.keyword == RID_STATIC
10141 || token1.keyword == RID_INLINE)
10142 && token2.keyword == RID_TEMPLATE)
10143 cp_parser_explicit_instantiation (parser);
10144 /* If the next token is `namespace', check for a named or unnamed
10145 namespace definition. */
10146 else if (token1.keyword == RID_NAMESPACE
10147 && (/* A named namespace definition. */
10148 (token2.type == CPP_NAME
10149 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
10151 /* An unnamed namespace definition. */
10152 || token2.type == CPP_OPEN_BRACE
10153 || token2.keyword == RID_ATTRIBUTE))
10154 cp_parser_namespace_definition (parser);
10155 /* An inline (associated) namespace definition. */
10156 else if (token1.keyword == RID_INLINE
10157 && token2.keyword == RID_NAMESPACE)
10158 cp_parser_namespace_definition (parser);
10159 /* Objective-C++ declaration/definition. */
10160 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
10161 cp_parser_objc_declaration (parser, NULL_TREE);
10162 else if (c_dialect_objc ()
10163 && token1.keyword == RID_ATTRIBUTE
10164 && cp_parser_objc_valid_prefix_attributes (parser, &attributes))
10165 cp_parser_objc_declaration (parser, attributes);
10166 /* We must have either a block declaration or a function
10169 /* Try to parse a block-declaration, or a function-definition. */
10170 cp_parser_block_declaration (parser, /*statement_p=*/false);
10172 /* Free any declarators allocated. */
10173 obstack_free (&declarator_obstack, p);
10176 /* Parse a block-declaration.
10181 namespace-alias-definition
10188 __extension__ block-declaration
10193 static_assert-declaration
10195 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10196 part of a declaration-statement. */
10199 cp_parser_block_declaration (cp_parser *parser,
10203 int saved_pedantic;
10205 /* Check for the `__extension__' keyword. */
10206 if (cp_parser_extension_opt (parser, &saved_pedantic))
10208 /* Parse the qualified declaration. */
10209 cp_parser_block_declaration (parser, statement_p);
10210 /* Restore the PEDANTIC flag. */
10211 pedantic = saved_pedantic;
10216 /* Peek at the next token to figure out which kind of declaration is
10218 token1 = cp_lexer_peek_token (parser->lexer);
10220 /* If the next keyword is `asm', we have an asm-definition. */
10221 if (token1->keyword == RID_ASM)
10224 cp_parser_commit_to_tentative_parse (parser);
10225 cp_parser_asm_definition (parser);
10227 /* If the next keyword is `namespace', we have a
10228 namespace-alias-definition. */
10229 else if (token1->keyword == RID_NAMESPACE)
10230 cp_parser_namespace_alias_definition (parser);
10231 /* If the next keyword is `using', we have a
10232 using-declaration, a using-directive, or an alias-declaration. */
10233 else if (token1->keyword == RID_USING)
10238 cp_parser_commit_to_tentative_parse (parser);
10239 /* If the token after `using' is `namespace', then we have a
10240 using-directive. */
10241 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
10242 if (token2->keyword == RID_NAMESPACE)
10243 cp_parser_using_directive (parser);
10244 /* If the second token after 'using' is '=', then we have an
10245 alias-declaration. */
10246 else if (cxx_dialect >= cxx0x
10247 && token2->type == CPP_NAME
10248 && ((cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_EQ)
10249 || (cp_lexer_peek_nth_token (parser->lexer, 3)->keyword
10250 == RID_ATTRIBUTE)))
10251 cp_parser_alias_declaration (parser);
10252 /* Otherwise, it's a using-declaration. */
10254 cp_parser_using_declaration (parser,
10255 /*access_declaration_p=*/false);
10257 /* If the next keyword is `__label__' we have a misplaced label
10259 else if (token1->keyword == RID_LABEL)
10261 cp_lexer_consume_token (parser->lexer);
10262 error_at (token1->location, "%<__label__%> not at the beginning of a block");
10263 cp_parser_skip_to_end_of_statement (parser);
10264 /* If the next token is now a `;', consume it. */
10265 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
10266 cp_lexer_consume_token (parser->lexer);
10268 /* If the next token is `static_assert' we have a static assertion. */
10269 else if (token1->keyword == RID_STATIC_ASSERT)
10270 cp_parser_static_assert (parser, /*member_p=*/false);
10271 /* Anything else must be a simple-declaration. */
10273 cp_parser_simple_declaration (parser, !statement_p,
10274 /*maybe_range_for_decl*/NULL);
10277 /* Parse a simple-declaration.
10279 simple-declaration:
10280 decl-specifier-seq [opt] init-declarator-list [opt] ;
10282 init-declarator-list:
10284 init-declarator-list , init-declarator
10286 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10287 function-definition as a simple-declaration.
10289 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10290 parsed declaration if it is an uninitialized single declarator not followed
10291 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10292 if present, will not be consumed. */
10295 cp_parser_simple_declaration (cp_parser* parser,
10296 bool function_definition_allowed_p,
10297 tree *maybe_range_for_decl)
10299 cp_decl_specifier_seq decl_specifiers;
10300 int declares_class_or_enum;
10301 bool saw_declarator;
10303 if (maybe_range_for_decl)
10304 *maybe_range_for_decl = NULL_TREE;
10306 /* Defer access checks until we know what is being declared; the
10307 checks for names appearing in the decl-specifier-seq should be
10308 done as if we were in the scope of the thing being declared. */
10309 push_deferring_access_checks (dk_deferred);
10311 /* Parse the decl-specifier-seq. We have to keep track of whether
10312 or not the decl-specifier-seq declares a named class or
10313 enumeration type, since that is the only case in which the
10314 init-declarator-list is allowed to be empty.
10318 In a simple-declaration, the optional init-declarator-list can be
10319 omitted only when declaring a class or enumeration, that is when
10320 the decl-specifier-seq contains either a class-specifier, an
10321 elaborated-type-specifier, or an enum-specifier. */
10322 cp_parser_decl_specifier_seq (parser,
10323 CP_PARSER_FLAGS_OPTIONAL,
10325 &declares_class_or_enum);
10326 /* We no longer need to defer access checks. */
10327 stop_deferring_access_checks ();
10329 /* In a block scope, a valid declaration must always have a
10330 decl-specifier-seq. By not trying to parse declarators, we can
10331 resolve the declaration/expression ambiguity more quickly. */
10332 if (!function_definition_allowed_p
10333 && !decl_specifiers.any_specifiers_p)
10335 cp_parser_error (parser, "expected declaration");
10339 /* If the next two tokens are both identifiers, the code is
10340 erroneous. The usual cause of this situation is code like:
10344 where "T" should name a type -- but does not. */
10345 if (!decl_specifiers.any_type_specifiers_p
10346 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
10348 /* If parsing tentatively, we should commit; we really are
10349 looking at a declaration. */
10350 cp_parser_commit_to_tentative_parse (parser);
10355 /* If we have seen at least one decl-specifier, and the next token
10356 is not a parenthesis, then we must be looking at a declaration.
10357 (After "int (" we might be looking at a functional cast.) */
10358 if (decl_specifiers.any_specifiers_p
10359 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN)
10360 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
10361 && !cp_parser_error_occurred (parser))
10362 cp_parser_commit_to_tentative_parse (parser);
10364 /* Keep going until we hit the `;' at the end of the simple
10366 saw_declarator = false;
10367 while (cp_lexer_next_token_is_not (parser->lexer,
10371 bool function_definition_p;
10374 if (saw_declarator)
10376 /* If we are processing next declarator, coma is expected */
10377 token = cp_lexer_peek_token (parser->lexer);
10378 gcc_assert (token->type == CPP_COMMA);
10379 cp_lexer_consume_token (parser->lexer);
10380 if (maybe_range_for_decl)
10381 *maybe_range_for_decl = error_mark_node;
10384 saw_declarator = true;
10386 /* Parse the init-declarator. */
10387 decl = cp_parser_init_declarator (parser, &decl_specifiers,
10389 function_definition_allowed_p,
10390 /*member_p=*/false,
10391 declares_class_or_enum,
10392 &function_definition_p,
10393 maybe_range_for_decl);
10394 /* If an error occurred while parsing tentatively, exit quickly.
10395 (That usually happens when in the body of a function; each
10396 statement is treated as a declaration-statement until proven
10398 if (cp_parser_error_occurred (parser))
10400 /* Handle function definitions specially. */
10401 if (function_definition_p)
10403 /* If the next token is a `,', then we are probably
10404 processing something like:
10408 which is erroneous. */
10409 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
10411 cp_token *token = cp_lexer_peek_token (parser->lexer);
10412 error_at (token->location,
10414 " declarations and function-definitions is forbidden");
10416 /* Otherwise, we're done with the list of declarators. */
10419 pop_deferring_access_checks ();
10423 if (maybe_range_for_decl && *maybe_range_for_decl == NULL_TREE)
10424 *maybe_range_for_decl = decl;
10425 /* The next token should be either a `,' or a `;'. */
10426 token = cp_lexer_peek_token (parser->lexer);
10427 /* If it's a `,', there are more declarators to come. */
10428 if (token->type == CPP_COMMA)
10429 /* will be consumed next time around */;
10430 /* If it's a `;', we are done. */
10431 else if (token->type == CPP_SEMICOLON || maybe_range_for_decl)
10433 /* Anything else is an error. */
10436 /* If we have already issued an error message we don't need
10437 to issue another one. */
10438 if (decl != error_mark_node
10439 || cp_parser_uncommitted_to_tentative_parse_p (parser))
10440 cp_parser_error (parser, "expected %<,%> or %<;%>");
10441 /* Skip tokens until we reach the end of the statement. */
10442 cp_parser_skip_to_end_of_statement (parser);
10443 /* If the next token is now a `;', consume it. */
10444 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
10445 cp_lexer_consume_token (parser->lexer);
10448 /* After the first time around, a function-definition is not
10449 allowed -- even if it was OK at first. For example:
10454 function_definition_allowed_p = false;
10457 /* Issue an error message if no declarators are present, and the
10458 decl-specifier-seq does not itself declare a class or
10460 if (!saw_declarator)
10462 if (cp_parser_declares_only_class_p (parser))
10463 shadow_tag (&decl_specifiers);
10464 /* Perform any deferred access checks. */
10465 perform_deferred_access_checks ();
10468 /* Consume the `;'. */
10469 if (!maybe_range_for_decl)
10470 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
10473 pop_deferring_access_checks ();
10476 /* Parse a decl-specifier-seq.
10478 decl-specifier-seq:
10479 decl-specifier-seq [opt] decl-specifier
10482 storage-class-specifier
10493 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10495 The parser flags FLAGS is used to control type-specifier parsing.
10497 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10500 1: one of the decl-specifiers is an elaborated-type-specifier
10501 (i.e., a type declaration)
10502 2: one of the decl-specifiers is an enum-specifier or a
10503 class-specifier (i.e., a type definition)
10508 cp_parser_decl_specifier_seq (cp_parser* parser,
10509 cp_parser_flags flags,
10510 cp_decl_specifier_seq *decl_specs,
10511 int* declares_class_or_enum)
10513 bool constructor_possible_p = !parser->in_declarator_p;
10514 cp_token *start_token = NULL;
10516 /* Clear DECL_SPECS. */
10517 clear_decl_specs (decl_specs);
10519 /* Assume no class or enumeration type is declared. */
10520 *declares_class_or_enum = 0;
10522 /* Keep reading specifiers until there are no more to read. */
10525 bool constructor_p;
10526 bool found_decl_spec;
10529 /* Peek at the next token. */
10530 token = cp_lexer_peek_token (parser->lexer);
10532 /* Save the first token of the decl spec list for error
10535 start_token = token;
10536 /* Handle attributes. */
10537 if (token->keyword == RID_ATTRIBUTE)
10539 /* Parse the attributes. */
10540 decl_specs->attributes
10541 = chainon (decl_specs->attributes,
10542 cp_parser_attributes_opt (parser));
10545 /* Assume we will find a decl-specifier keyword. */
10546 found_decl_spec = true;
10547 /* If the next token is an appropriate keyword, we can simply
10548 add it to the list. */
10549 switch (token->keyword)
10555 if (!at_class_scope_p ())
10557 error_at (token->location, "%<friend%> used outside of class");
10558 cp_lexer_purge_token (parser->lexer);
10562 ++decl_specs->specs[(int) ds_friend];
10563 /* Consume the token. */
10564 cp_lexer_consume_token (parser->lexer);
10568 case RID_CONSTEXPR:
10569 ++decl_specs->specs[(int) ds_constexpr];
10570 cp_lexer_consume_token (parser->lexer);
10573 /* function-specifier:
10580 cp_parser_function_specifier_opt (parser, decl_specs);
10586 ++decl_specs->specs[(int) ds_typedef];
10587 /* Consume the token. */
10588 cp_lexer_consume_token (parser->lexer);
10589 /* A constructor declarator cannot appear in a typedef. */
10590 constructor_possible_p = false;
10591 /* The "typedef" keyword can only occur in a declaration; we
10592 may as well commit at this point. */
10593 cp_parser_commit_to_tentative_parse (parser);
10595 if (decl_specs->storage_class != sc_none)
10596 decl_specs->conflicting_specifiers_p = true;
10599 /* storage-class-specifier:
10609 if (cxx_dialect == cxx98)
10611 /* Consume the token. */
10612 cp_lexer_consume_token (parser->lexer);
10614 /* Complain about `auto' as a storage specifier, if
10615 we're complaining about C++0x compatibility. */
10616 warning_at (token->location, OPT_Wc__0x_compat, "%<auto%>"
10617 " changes meaning in C++11; please remove it");
10619 /* Set the storage class anyway. */
10620 cp_parser_set_storage_class (parser, decl_specs, RID_AUTO,
10624 /* C++0x auto type-specifier. */
10625 found_decl_spec = false;
10632 /* Consume the token. */
10633 cp_lexer_consume_token (parser->lexer);
10634 cp_parser_set_storage_class (parser, decl_specs, token->keyword,
10638 /* Consume the token. */
10639 cp_lexer_consume_token (parser->lexer);
10640 ++decl_specs->specs[(int) ds_thread];
10644 /* We did not yet find a decl-specifier yet. */
10645 found_decl_spec = false;
10649 if (found_decl_spec
10650 && (flags & CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR)
10651 && token->keyword != RID_CONSTEXPR)
10652 error ("decl-specifier invalid in condition");
10654 /* Constructors are a special case. The `S' in `S()' is not a
10655 decl-specifier; it is the beginning of the declarator. */
10657 = (!found_decl_spec
10658 && constructor_possible_p
10659 && (cp_parser_constructor_declarator_p
10660 (parser, decl_specs->specs[(int) ds_friend] != 0)));
10662 /* If we don't have a DECL_SPEC yet, then we must be looking at
10663 a type-specifier. */
10664 if (!found_decl_spec && !constructor_p)
10666 int decl_spec_declares_class_or_enum;
10667 bool is_cv_qualifier;
10671 = cp_parser_type_specifier (parser, flags,
10673 /*is_declaration=*/true,
10674 &decl_spec_declares_class_or_enum,
10676 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
10678 /* If this type-specifier referenced a user-defined type
10679 (a typedef, class-name, etc.), then we can't allow any
10680 more such type-specifiers henceforth.
10684 The longest sequence of decl-specifiers that could
10685 possibly be a type name is taken as the
10686 decl-specifier-seq of a declaration. The sequence shall
10687 be self-consistent as described below.
10691 As a general rule, at most one type-specifier is allowed
10692 in the complete decl-specifier-seq of a declaration. The
10693 only exceptions are the following:
10695 -- const or volatile can be combined with any other
10698 -- signed or unsigned can be combined with char, long,
10706 void g (const int Pc);
10708 Here, Pc is *not* part of the decl-specifier seq; it's
10709 the declarator. Therefore, once we see a type-specifier
10710 (other than a cv-qualifier), we forbid any additional
10711 user-defined types. We *do* still allow things like `int
10712 int' to be considered a decl-specifier-seq, and issue the
10713 error message later. */
10714 if (type_spec && !is_cv_qualifier)
10715 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
10716 /* A constructor declarator cannot follow a type-specifier. */
10719 constructor_possible_p = false;
10720 found_decl_spec = true;
10721 if (!is_cv_qualifier)
10722 decl_specs->any_type_specifiers_p = true;
10726 /* If we still do not have a DECL_SPEC, then there are no more
10727 decl-specifiers. */
10728 if (!found_decl_spec)
10731 decl_specs->any_specifiers_p = true;
10732 /* After we see one decl-specifier, further decl-specifiers are
10733 always optional. */
10734 flags |= CP_PARSER_FLAGS_OPTIONAL;
10737 cp_parser_check_decl_spec (decl_specs, start_token->location);
10739 /* Don't allow a friend specifier with a class definition. */
10740 if (decl_specs->specs[(int) ds_friend] != 0
10741 && (*declares_class_or_enum & 2))
10742 error_at (start_token->location,
10743 "class definition may not be declared a friend");
10746 /* Parse an (optional) storage-class-specifier.
10748 storage-class-specifier:
10757 storage-class-specifier:
10760 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10763 cp_parser_storage_class_specifier_opt (cp_parser* parser)
10765 switch (cp_lexer_peek_token (parser->lexer)->keyword)
10768 if (cxx_dialect != cxx98)
10770 /* Fall through for C++98. */
10777 /* Consume the token. */
10778 return cp_lexer_consume_token (parser->lexer)->u.value;
10785 /* Parse an (optional) function-specifier.
10787 function-specifier:
10792 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10793 Updates DECL_SPECS, if it is non-NULL. */
10796 cp_parser_function_specifier_opt (cp_parser* parser,
10797 cp_decl_specifier_seq *decl_specs)
10799 cp_token *token = cp_lexer_peek_token (parser->lexer);
10800 switch (token->keyword)
10804 ++decl_specs->specs[(int) ds_inline];
10808 /* 14.5.2.3 [temp.mem]
10810 A member function template shall not be virtual. */
10811 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
10812 error_at (token->location, "templates may not be %<virtual%>");
10813 else if (decl_specs)
10814 ++decl_specs->specs[(int) ds_virtual];
10819 ++decl_specs->specs[(int) ds_explicit];
10826 /* Consume the token. */
10827 return cp_lexer_consume_token (parser->lexer)->u.value;
10830 /* Parse a linkage-specification.
10832 linkage-specification:
10833 extern string-literal { declaration-seq [opt] }
10834 extern string-literal declaration */
10837 cp_parser_linkage_specification (cp_parser* parser)
10841 /* Look for the `extern' keyword. */
10842 cp_parser_require_keyword (parser, RID_EXTERN, RT_EXTERN);
10844 /* Look for the string-literal. */
10845 linkage = cp_parser_string_literal (parser, false, false);
10847 /* Transform the literal into an identifier. If the literal is a
10848 wide-character string, or contains embedded NULs, then we can't
10849 handle it as the user wants. */
10850 if (strlen (TREE_STRING_POINTER (linkage))
10851 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
10853 cp_parser_error (parser, "invalid linkage-specification");
10854 /* Assume C++ linkage. */
10855 linkage = lang_name_cplusplus;
10858 linkage = get_identifier (TREE_STRING_POINTER (linkage));
10860 /* We're now using the new linkage. */
10861 push_lang_context (linkage);
10863 /* If the next token is a `{', then we're using the first
10865 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
10867 /* Consume the `{' token. */
10868 cp_lexer_consume_token (parser->lexer);
10869 /* Parse the declarations. */
10870 cp_parser_declaration_seq_opt (parser);
10871 /* Look for the closing `}'. */
10872 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
10874 /* Otherwise, there's just one declaration. */
10877 bool saved_in_unbraced_linkage_specification_p;
10879 saved_in_unbraced_linkage_specification_p
10880 = parser->in_unbraced_linkage_specification_p;
10881 parser->in_unbraced_linkage_specification_p = true;
10882 cp_parser_declaration (parser);
10883 parser->in_unbraced_linkage_specification_p
10884 = saved_in_unbraced_linkage_specification_p;
10887 /* We're done with the linkage-specification. */
10888 pop_lang_context ();
10891 /* Parse a static_assert-declaration.
10893 static_assert-declaration:
10894 static_assert ( constant-expression , string-literal ) ;
10896 If MEMBER_P, this static_assert is a class member. */
10899 cp_parser_static_assert(cp_parser *parser, bool member_p)
10904 location_t saved_loc;
10907 /* Peek at the `static_assert' token so we can keep track of exactly
10908 where the static assertion started. */
10909 token = cp_lexer_peek_token (parser->lexer);
10910 saved_loc = token->location;
10912 /* Look for the `static_assert' keyword. */
10913 if (!cp_parser_require_keyword (parser, RID_STATIC_ASSERT,
10917 /* We know we are in a static assertion; commit to any tentative
10919 if (cp_parser_parsing_tentatively (parser))
10920 cp_parser_commit_to_tentative_parse (parser);
10922 /* Parse the `(' starting the static assertion condition. */
10923 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
10925 /* Parse the constant-expression. Allow a non-constant expression
10926 here in order to give better diagnostics in finish_static_assert. */
10928 cp_parser_constant_expression (parser,
10929 /*allow_non_constant_p=*/true,
10930 /*non_constant_p=*/&dummy);
10932 /* Parse the separating `,'. */
10933 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
10935 /* Parse the string-literal message. */
10936 message = cp_parser_string_literal (parser,
10937 /*translate=*/false,
10940 /* A `)' completes the static assertion. */
10941 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
10942 cp_parser_skip_to_closing_parenthesis (parser,
10943 /*recovering=*/true,
10944 /*or_comma=*/false,
10945 /*consume_paren=*/true);
10947 /* A semicolon terminates the declaration. */
10948 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
10950 /* Complete the static assertion, which may mean either processing
10951 the static assert now or saving it for template instantiation. */
10952 finish_static_assert (condition, message, saved_loc, member_p);
10955 /* Parse a `decltype' type. Returns the type.
10957 simple-type-specifier:
10958 decltype ( expression ) */
10961 cp_parser_decltype (cp_parser *parser)
10964 bool id_expression_or_member_access_p = false;
10965 const char *saved_message;
10966 bool saved_integral_constant_expression_p;
10967 bool saved_non_integral_constant_expression_p;
10968 cp_token *id_expr_start_token;
10969 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
10971 if (start_token->type == CPP_DECLTYPE)
10973 /* Already parsed. */
10974 cp_lexer_consume_token (parser->lexer);
10975 return start_token->u.value;
10978 /* Look for the `decltype' token. */
10979 if (!cp_parser_require_keyword (parser, RID_DECLTYPE, RT_DECLTYPE))
10980 return error_mark_node;
10982 /* Types cannot be defined in a `decltype' expression. Save away the
10984 saved_message = parser->type_definition_forbidden_message;
10986 /* And create the new one. */
10987 parser->type_definition_forbidden_message
10988 = G_("types may not be defined in %<decltype%> expressions");
10990 /* The restrictions on constant-expressions do not apply inside
10991 decltype expressions. */
10992 saved_integral_constant_expression_p
10993 = parser->integral_constant_expression_p;
10994 saved_non_integral_constant_expression_p
10995 = parser->non_integral_constant_expression_p;
10996 parser->integral_constant_expression_p = false;
10998 /* Do not actually evaluate the expression. */
10999 ++cp_unevaluated_operand;
11001 /* Do not warn about problems with the expression. */
11002 ++c_inhibit_evaluation_warnings;
11004 /* Parse the opening `('. */
11005 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
11006 return error_mark_node;
11008 /* First, try parsing an id-expression. */
11009 id_expr_start_token = cp_lexer_peek_token (parser->lexer);
11010 cp_parser_parse_tentatively (parser);
11011 expr = cp_parser_id_expression (parser,
11012 /*template_keyword_p=*/false,
11013 /*check_dependency_p=*/true,
11014 /*template_p=*/NULL,
11015 /*declarator_p=*/false,
11016 /*optional_p=*/false);
11018 if (!cp_parser_error_occurred (parser) && expr != error_mark_node)
11020 bool non_integral_constant_expression_p = false;
11021 tree id_expression = expr;
11023 const char *error_msg;
11025 if (TREE_CODE (expr) == IDENTIFIER_NODE)
11026 /* Lookup the name we got back from the id-expression. */
11027 expr = cp_parser_lookup_name (parser, expr,
11029 /*is_template=*/false,
11030 /*is_namespace=*/false,
11031 /*check_dependency=*/true,
11032 /*ambiguous_decls=*/NULL,
11033 id_expr_start_token->location);
11036 && expr != error_mark_node
11037 && TREE_CODE (expr) != TEMPLATE_ID_EXPR
11038 && TREE_CODE (expr) != TYPE_DECL
11039 && (TREE_CODE (expr) != BIT_NOT_EXPR
11040 || !TYPE_P (TREE_OPERAND (expr, 0)))
11041 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
11043 /* Complete lookup of the id-expression. */
11044 expr = (finish_id_expression
11045 (id_expression, expr, parser->scope, &idk,
11046 /*integral_constant_expression_p=*/false,
11047 /*allow_non_integral_constant_expression_p=*/true,
11048 &non_integral_constant_expression_p,
11049 /*template_p=*/false,
11051 /*address_p=*/false,
11052 /*template_arg_p=*/false,
11054 id_expr_start_token->location));
11056 if (expr == error_mark_node)
11057 /* We found an id-expression, but it was something that we
11058 should not have found. This is an error, not something
11059 we can recover from, so note that we found an
11060 id-expression and we'll recover as gracefully as
11062 id_expression_or_member_access_p = true;
11066 && expr != error_mark_node
11067 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
11068 /* We have an id-expression. */
11069 id_expression_or_member_access_p = true;
11072 if (!id_expression_or_member_access_p)
11074 /* Abort the id-expression parse. */
11075 cp_parser_abort_tentative_parse (parser);
11077 /* Parsing tentatively, again. */
11078 cp_parser_parse_tentatively (parser);
11080 /* Parse a class member access. */
11081 expr = cp_parser_postfix_expression (parser, /*address_p=*/false,
11083 /*member_access_only_p=*/true, NULL);
11086 && expr != error_mark_node
11087 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
11088 /* We have an id-expression. */
11089 id_expression_or_member_access_p = true;
11092 if (id_expression_or_member_access_p)
11093 /* We have parsed the complete id-expression or member access. */
11094 cp_parser_parse_definitely (parser);
11097 bool saved_greater_than_is_operator_p;
11099 /* Abort our attempt to parse an id-expression or member access
11101 cp_parser_abort_tentative_parse (parser);
11103 /* Within a parenthesized expression, a `>' token is always
11104 the greater-than operator. */
11105 saved_greater_than_is_operator_p
11106 = parser->greater_than_is_operator_p;
11107 parser->greater_than_is_operator_p = true;
11109 /* Parse a full expression. */
11110 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
11112 /* The `>' token might be the end of a template-id or
11113 template-parameter-list now. */
11114 parser->greater_than_is_operator_p
11115 = saved_greater_than_is_operator_p;
11118 /* Go back to evaluating expressions. */
11119 --cp_unevaluated_operand;
11120 --c_inhibit_evaluation_warnings;
11122 /* Restore the old message and the integral constant expression
11124 parser->type_definition_forbidden_message = saved_message;
11125 parser->integral_constant_expression_p
11126 = saved_integral_constant_expression_p;
11127 parser->non_integral_constant_expression_p
11128 = saved_non_integral_constant_expression_p;
11130 /* Parse to the closing `)'. */
11131 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
11133 cp_parser_skip_to_closing_parenthesis (parser, true, false,
11134 /*consume_paren=*/true);
11135 return error_mark_node;
11138 expr = finish_decltype_type (expr, id_expression_or_member_access_p,
11139 tf_warning_or_error);
11141 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11143 start_token->type = CPP_DECLTYPE;
11144 start_token->u.value = expr;
11145 start_token->keyword = RID_MAX;
11146 cp_lexer_purge_tokens_after (parser->lexer, start_token);
11151 /* Special member functions [gram.special] */
11153 /* Parse a conversion-function-id.
11155 conversion-function-id:
11156 operator conversion-type-id
11158 Returns an IDENTIFIER_NODE representing the operator. */
11161 cp_parser_conversion_function_id (cp_parser* parser)
11165 tree saved_qualifying_scope;
11166 tree saved_object_scope;
11167 tree pushed_scope = NULL_TREE;
11169 /* Look for the `operator' token. */
11170 if (!cp_parser_require_keyword (parser, RID_OPERATOR, RT_OPERATOR))
11171 return error_mark_node;
11172 /* When we parse the conversion-type-id, the current scope will be
11173 reset. However, we need that information in able to look up the
11174 conversion function later, so we save it here. */
11175 saved_scope = parser->scope;
11176 saved_qualifying_scope = parser->qualifying_scope;
11177 saved_object_scope = parser->object_scope;
11178 /* We must enter the scope of the class so that the names of
11179 entities declared within the class are available in the
11180 conversion-type-id. For example, consider:
11187 S::operator I() { ... }
11189 In order to see that `I' is a type-name in the definition, we
11190 must be in the scope of `S'. */
11192 pushed_scope = push_scope (saved_scope);
11193 /* Parse the conversion-type-id. */
11194 type = cp_parser_conversion_type_id (parser);
11195 /* Leave the scope of the class, if any. */
11197 pop_scope (pushed_scope);
11198 /* Restore the saved scope. */
11199 parser->scope = saved_scope;
11200 parser->qualifying_scope = saved_qualifying_scope;
11201 parser->object_scope = saved_object_scope;
11202 /* If the TYPE is invalid, indicate failure. */
11203 if (type == error_mark_node)
11204 return error_mark_node;
11205 return mangle_conv_op_name_for_type (type);
11208 /* Parse a conversion-type-id:
11210 conversion-type-id:
11211 type-specifier-seq conversion-declarator [opt]
11213 Returns the TYPE specified. */
11216 cp_parser_conversion_type_id (cp_parser* parser)
11219 cp_decl_specifier_seq type_specifiers;
11220 cp_declarator *declarator;
11221 tree type_specified;
11223 /* Parse the attributes. */
11224 attributes = cp_parser_attributes_opt (parser);
11225 /* Parse the type-specifiers. */
11226 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
11227 /*is_trailing_return=*/false,
11229 /* If that didn't work, stop. */
11230 if (type_specifiers.type == error_mark_node)
11231 return error_mark_node;
11232 /* Parse the conversion-declarator. */
11233 declarator = cp_parser_conversion_declarator_opt (parser);
11235 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
11236 /*initialized=*/0, &attributes);
11238 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
11240 /* Don't give this error when parsing tentatively. This happens to
11241 work because we always parse this definitively once. */
11242 if (! cp_parser_uncommitted_to_tentative_parse_p (parser)
11243 && type_uses_auto (type_specified))
11245 error ("invalid use of %<auto%> in conversion operator");
11246 return error_mark_node;
11249 return type_specified;
11252 /* Parse an (optional) conversion-declarator.
11254 conversion-declarator:
11255 ptr-operator conversion-declarator [opt]
11259 static cp_declarator *
11260 cp_parser_conversion_declarator_opt (cp_parser* parser)
11262 enum tree_code code;
11264 cp_cv_quals cv_quals;
11266 /* We don't know if there's a ptr-operator next, or not. */
11267 cp_parser_parse_tentatively (parser);
11268 /* Try the ptr-operator. */
11269 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
11270 /* If it worked, look for more conversion-declarators. */
11271 if (cp_parser_parse_definitely (parser))
11273 cp_declarator *declarator;
11275 /* Parse another optional declarator. */
11276 declarator = cp_parser_conversion_declarator_opt (parser);
11278 return cp_parser_make_indirect_declarator
11279 (code, class_type, cv_quals, declarator);
11285 /* Parse an (optional) ctor-initializer.
11288 : mem-initializer-list
11290 Returns TRUE iff the ctor-initializer was actually present. */
11293 cp_parser_ctor_initializer_opt (cp_parser* parser)
11295 /* If the next token is not a `:', then there is no
11296 ctor-initializer. */
11297 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
11299 /* Do default initialization of any bases and members. */
11300 if (DECL_CONSTRUCTOR_P (current_function_decl))
11301 finish_mem_initializers (NULL_TREE);
11306 /* Consume the `:' token. */
11307 cp_lexer_consume_token (parser->lexer);
11308 /* And the mem-initializer-list. */
11309 cp_parser_mem_initializer_list (parser);
11314 /* Parse a mem-initializer-list.
11316 mem-initializer-list:
11317 mem-initializer ... [opt]
11318 mem-initializer ... [opt] , mem-initializer-list */
11321 cp_parser_mem_initializer_list (cp_parser* parser)
11323 tree mem_initializer_list = NULL_TREE;
11324 cp_token *token = cp_lexer_peek_token (parser->lexer);
11326 /* Let the semantic analysis code know that we are starting the
11327 mem-initializer-list. */
11328 if (!DECL_CONSTRUCTOR_P (current_function_decl))
11329 error_at (token->location,
11330 "only constructors take member initializers");
11332 /* Loop through the list. */
11335 tree mem_initializer;
11337 token = cp_lexer_peek_token (parser->lexer);
11338 /* Parse the mem-initializer. */
11339 mem_initializer = cp_parser_mem_initializer (parser);
11340 /* If the next token is a `...', we're expanding member initializers. */
11341 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11343 /* Consume the `...'. */
11344 cp_lexer_consume_token (parser->lexer);
11346 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11347 can be expanded but members cannot. */
11348 if (mem_initializer != error_mark_node
11349 && !TYPE_P (TREE_PURPOSE (mem_initializer)))
11351 error_at (token->location,
11352 "cannot expand initializer for member %<%D%>",
11353 TREE_PURPOSE (mem_initializer));
11354 mem_initializer = error_mark_node;
11357 /* Construct the pack expansion type. */
11358 if (mem_initializer != error_mark_node)
11359 mem_initializer = make_pack_expansion (mem_initializer);
11361 /* Add it to the list, unless it was erroneous. */
11362 if (mem_initializer != error_mark_node)
11364 TREE_CHAIN (mem_initializer) = mem_initializer_list;
11365 mem_initializer_list = mem_initializer;
11367 /* If the next token is not a `,', we're done. */
11368 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11370 /* Consume the `,' token. */
11371 cp_lexer_consume_token (parser->lexer);
11374 /* Perform semantic analysis. */
11375 if (DECL_CONSTRUCTOR_P (current_function_decl))
11376 finish_mem_initializers (mem_initializer_list);
11379 /* Parse a mem-initializer.
11382 mem-initializer-id ( expression-list [opt] )
11383 mem-initializer-id braced-init-list
11388 ( expression-list [opt] )
11390 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11391 class) or FIELD_DECL (for a non-static data member) to initialize;
11392 the TREE_VALUE is the expression-list. An empty initialization
11393 list is represented by void_list_node. */
11396 cp_parser_mem_initializer (cp_parser* parser)
11398 tree mem_initializer_id;
11399 tree expression_list;
11401 cp_token *token = cp_lexer_peek_token (parser->lexer);
11403 /* Find out what is being initialized. */
11404 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
11406 permerror (token->location,
11407 "anachronistic old-style base class initializer");
11408 mem_initializer_id = NULL_TREE;
11412 mem_initializer_id = cp_parser_mem_initializer_id (parser);
11413 if (mem_initializer_id == error_mark_node)
11414 return mem_initializer_id;
11416 member = expand_member_init (mem_initializer_id);
11417 if (member && !DECL_P (member))
11418 in_base_initializer = 1;
11420 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11422 bool expr_non_constant_p;
11423 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
11424 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
11425 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
11426 expression_list = build_tree_list (NULL_TREE, expression_list);
11431 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
11433 /*allow_expansion_p=*/true,
11434 /*non_constant_p=*/NULL);
11436 return error_mark_node;
11437 expression_list = build_tree_list_vec (vec);
11438 release_tree_vector (vec);
11441 if (expression_list == error_mark_node)
11442 return error_mark_node;
11443 if (!expression_list)
11444 expression_list = void_type_node;
11446 in_base_initializer = 0;
11448 return member ? build_tree_list (member, expression_list) : error_mark_node;
11451 /* Parse a mem-initializer-id.
11453 mem-initializer-id:
11454 :: [opt] nested-name-specifier [opt] class-name
11457 Returns a TYPE indicating the class to be initializer for the first
11458 production. Returns an IDENTIFIER_NODE indicating the data member
11459 to be initialized for the second production. */
11462 cp_parser_mem_initializer_id (cp_parser* parser)
11464 bool global_scope_p;
11465 bool nested_name_specifier_p;
11466 bool template_p = false;
11469 cp_token *token = cp_lexer_peek_token (parser->lexer);
11471 /* `typename' is not allowed in this context ([temp.res]). */
11472 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
11474 error_at (token->location,
11475 "keyword %<typename%> not allowed in this context (a qualified "
11476 "member initializer is implicitly a type)");
11477 cp_lexer_consume_token (parser->lexer);
11479 /* Look for the optional `::' operator. */
11481 = (cp_parser_global_scope_opt (parser,
11482 /*current_scope_valid_p=*/false)
11484 /* Look for the optional nested-name-specifier. The simplest way to
11489 The keyword `typename' is not permitted in a base-specifier or
11490 mem-initializer; in these contexts a qualified name that
11491 depends on a template-parameter is implicitly assumed to be a
11494 is to assume that we have seen the `typename' keyword at this
11496 nested_name_specifier_p
11497 = (cp_parser_nested_name_specifier_opt (parser,
11498 /*typename_keyword_p=*/true,
11499 /*check_dependency_p=*/true,
11501 /*is_declaration=*/true)
11503 if (nested_name_specifier_p)
11504 template_p = cp_parser_optional_template_keyword (parser);
11505 /* If there is a `::' operator or a nested-name-specifier, then we
11506 are definitely looking for a class-name. */
11507 if (global_scope_p || nested_name_specifier_p)
11508 return cp_parser_class_name (parser,
11509 /*typename_keyword_p=*/true,
11510 /*template_keyword_p=*/template_p,
11512 /*check_dependency_p=*/true,
11513 /*class_head_p=*/false,
11514 /*is_declaration=*/true);
11515 /* Otherwise, we could also be looking for an ordinary identifier. */
11516 cp_parser_parse_tentatively (parser);
11517 /* Try a class-name. */
11518 id = cp_parser_class_name (parser,
11519 /*typename_keyword_p=*/true,
11520 /*template_keyword_p=*/false,
11522 /*check_dependency_p=*/true,
11523 /*class_head_p=*/false,
11524 /*is_declaration=*/true);
11525 /* If we found one, we're done. */
11526 if (cp_parser_parse_definitely (parser))
11528 /* Otherwise, look for an ordinary identifier. */
11529 return cp_parser_identifier (parser);
11532 /* Overloading [gram.over] */
11534 /* Parse an operator-function-id.
11536 operator-function-id:
11539 Returns an IDENTIFIER_NODE for the operator which is a
11540 human-readable spelling of the identifier, e.g., `operator +'. */
11543 cp_parser_operator_function_id (cp_parser* parser)
11545 /* Look for the `operator' keyword. */
11546 if (!cp_parser_require_keyword (parser, RID_OPERATOR, RT_OPERATOR))
11547 return error_mark_node;
11548 /* And then the name of the operator itself. */
11549 return cp_parser_operator (parser);
11552 /* Return an identifier node for a user-defined literal operator.
11553 The suffix identifier is chained to the operator name identifier. */
11556 cp_literal_operator_id (const char* name)
11559 char *buffer = XNEWVEC (char, strlen (UDLIT_OP_ANSI_PREFIX)
11560 + strlen (name) + 10);
11561 sprintf (buffer, UDLIT_OP_ANSI_FORMAT, name);
11562 identifier = get_identifier (buffer);
11563 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11568 /* Parse an operator.
11571 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11572 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11573 || ++ -- , ->* -> () []
11580 Returns an IDENTIFIER_NODE for the operator which is a
11581 human-readable spelling of the identifier, e.g., `operator +'. */
11584 cp_parser_operator (cp_parser* parser)
11586 tree id = NULL_TREE;
11589 /* Peek at the next token. */
11590 token = cp_lexer_peek_token (parser->lexer);
11591 /* Figure out which operator we have. */
11592 switch (token->type)
11598 /* The keyword should be either `new' or `delete'. */
11599 if (token->keyword == RID_NEW)
11601 else if (token->keyword == RID_DELETE)
11606 /* Consume the `new' or `delete' token. */
11607 cp_lexer_consume_token (parser->lexer);
11609 /* Peek at the next token. */
11610 token = cp_lexer_peek_token (parser->lexer);
11611 /* If it's a `[' token then this is the array variant of the
11613 if (token->type == CPP_OPEN_SQUARE)
11615 /* Consume the `[' token. */
11616 cp_lexer_consume_token (parser->lexer);
11617 /* Look for the `]' token. */
11618 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
11619 id = ansi_opname (op == NEW_EXPR
11620 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
11622 /* Otherwise, we have the non-array variant. */
11624 id = ansi_opname (op);
11630 id = ansi_opname (PLUS_EXPR);
11634 id = ansi_opname (MINUS_EXPR);
11638 id = ansi_opname (MULT_EXPR);
11642 id = ansi_opname (TRUNC_DIV_EXPR);
11646 id = ansi_opname (TRUNC_MOD_EXPR);
11650 id = ansi_opname (BIT_XOR_EXPR);
11654 id = ansi_opname (BIT_AND_EXPR);
11658 id = ansi_opname (BIT_IOR_EXPR);
11662 id = ansi_opname (BIT_NOT_EXPR);
11666 id = ansi_opname (TRUTH_NOT_EXPR);
11670 id = ansi_assopname (NOP_EXPR);
11674 id = ansi_opname (LT_EXPR);
11678 id = ansi_opname (GT_EXPR);
11682 id = ansi_assopname (PLUS_EXPR);
11686 id = ansi_assopname (MINUS_EXPR);
11690 id = ansi_assopname (MULT_EXPR);
11694 id = ansi_assopname (TRUNC_DIV_EXPR);
11698 id = ansi_assopname (TRUNC_MOD_EXPR);
11702 id = ansi_assopname (BIT_XOR_EXPR);
11706 id = ansi_assopname (BIT_AND_EXPR);
11710 id = ansi_assopname (BIT_IOR_EXPR);
11714 id = ansi_opname (LSHIFT_EXPR);
11718 id = ansi_opname (RSHIFT_EXPR);
11721 case CPP_LSHIFT_EQ:
11722 id = ansi_assopname (LSHIFT_EXPR);
11725 case CPP_RSHIFT_EQ:
11726 id = ansi_assopname (RSHIFT_EXPR);
11730 id = ansi_opname (EQ_EXPR);
11734 id = ansi_opname (NE_EXPR);
11738 id = ansi_opname (LE_EXPR);
11741 case CPP_GREATER_EQ:
11742 id = ansi_opname (GE_EXPR);
11746 id = ansi_opname (TRUTH_ANDIF_EXPR);
11750 id = ansi_opname (TRUTH_ORIF_EXPR);
11753 case CPP_PLUS_PLUS:
11754 id = ansi_opname (POSTINCREMENT_EXPR);
11757 case CPP_MINUS_MINUS:
11758 id = ansi_opname (PREDECREMENT_EXPR);
11762 id = ansi_opname (COMPOUND_EXPR);
11765 case CPP_DEREF_STAR:
11766 id = ansi_opname (MEMBER_REF);
11770 id = ansi_opname (COMPONENT_REF);
11773 case CPP_OPEN_PAREN:
11774 /* Consume the `('. */
11775 cp_lexer_consume_token (parser->lexer);
11776 /* Look for the matching `)'. */
11777 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
11778 return ansi_opname (CALL_EXPR);
11780 case CPP_OPEN_SQUARE:
11781 /* Consume the `['. */
11782 cp_lexer_consume_token (parser->lexer);
11783 /* Look for the matching `]'. */
11784 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
11785 return ansi_opname (ARRAY_REF);
11788 if (cxx_dialect == cxx98)
11789 maybe_warn_cpp0x (CPP0X_USER_DEFINED_LITERALS);
11790 if (TREE_STRING_LENGTH (token->u.value) > 2)
11792 error ("expected empty string after %<operator%> keyword");
11793 return error_mark_node;
11795 /* Consume the string. */
11796 cp_lexer_consume_token (parser->lexer);
11797 /* Look for the suffix identifier. */
11798 token = cp_lexer_peek_token (parser->lexer);
11799 if (token->type == CPP_NAME)
11801 id = cp_parser_identifier (parser);
11802 if (id != error_mark_node)
11804 const char *name = IDENTIFIER_POINTER (id);
11805 return cp_literal_operator_id (name);
11810 error ("expected suffix identifier");
11811 return error_mark_node;
11814 case CPP_STRING_USERDEF:
11815 error ("missing space between %<\"\"%> and suffix identifier");
11816 return error_mark_node;
11819 /* Anything else is an error. */
11823 /* If we have selected an identifier, we need to consume the
11826 cp_lexer_consume_token (parser->lexer);
11827 /* Otherwise, no valid operator name was present. */
11830 cp_parser_error (parser, "expected operator");
11831 id = error_mark_node;
11837 /* Parse a template-declaration.
11839 template-declaration:
11840 export [opt] template < template-parameter-list > declaration
11842 If MEMBER_P is TRUE, this template-declaration occurs within a
11845 The grammar rule given by the standard isn't correct. What
11846 is really meant is:
11848 template-declaration:
11849 export [opt] template-parameter-list-seq
11850 decl-specifier-seq [opt] init-declarator [opt] ;
11851 export [opt] template-parameter-list-seq
11852 function-definition
11854 template-parameter-list-seq:
11855 template-parameter-list-seq [opt]
11856 template < template-parameter-list > */
11859 cp_parser_template_declaration (cp_parser* parser, bool member_p)
11861 /* Check for `export'. */
11862 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
11864 /* Consume the `export' token. */
11865 cp_lexer_consume_token (parser->lexer);
11866 /* Warn that we do not support `export'. */
11867 warning (0, "keyword %<export%> not implemented, and will be ignored");
11870 cp_parser_template_declaration_after_export (parser, member_p);
11873 /* Parse a template-parameter-list.
11875 template-parameter-list:
11877 template-parameter-list , template-parameter
11879 Returns a TREE_LIST. Each node represents a template parameter.
11880 The nodes are connected via their TREE_CHAINs. */
11883 cp_parser_template_parameter_list (cp_parser* parser)
11885 tree parameter_list = NULL_TREE;
11887 begin_template_parm_list ();
11889 /* The loop below parses the template parms. We first need to know
11890 the total number of template parms to be able to compute proper
11891 canonical types of each dependent type. So after the loop, when
11892 we know the total number of template parms,
11893 end_template_parm_list computes the proper canonical types and
11894 fixes up the dependent types accordingly. */
11899 bool is_parameter_pack;
11900 location_t parm_loc;
11902 /* Parse the template-parameter. */
11903 parm_loc = cp_lexer_peek_token (parser->lexer)->location;
11904 parameter = cp_parser_template_parameter (parser,
11906 &is_parameter_pack);
11907 /* Add it to the list. */
11908 if (parameter != error_mark_node)
11909 parameter_list = process_template_parm (parameter_list,
11917 tree err_parm = build_tree_list (parameter, parameter);
11918 parameter_list = chainon (parameter_list, err_parm);
11921 /* If the next token is not a `,', we're done. */
11922 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11924 /* Otherwise, consume the `,' token. */
11925 cp_lexer_consume_token (parser->lexer);
11928 return end_template_parm_list (parameter_list);
11931 /* Parse a template-parameter.
11933 template-parameter:
11935 parameter-declaration
11937 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11938 the parameter. The TREE_PURPOSE is the default value, if any.
11939 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
11940 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
11941 set to true iff this parameter is a parameter pack. */
11944 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type,
11945 bool *is_parameter_pack)
11948 cp_parameter_declarator *parameter_declarator;
11949 cp_declarator *id_declarator;
11952 /* Assume it is a type parameter or a template parameter. */
11953 *is_non_type = false;
11954 /* Assume it not a parameter pack. */
11955 *is_parameter_pack = false;
11956 /* Peek at the next token. */
11957 token = cp_lexer_peek_token (parser->lexer);
11958 /* If it is `class' or `template', we have a type-parameter. */
11959 if (token->keyword == RID_TEMPLATE)
11960 return cp_parser_type_parameter (parser, is_parameter_pack);
11961 /* If it is `class' or `typename' we do not know yet whether it is a
11962 type parameter or a non-type parameter. Consider:
11964 template <typename T, typename T::X X> ...
11968 template <class C, class D*> ...
11970 Here, the first parameter is a type parameter, and the second is
11971 a non-type parameter. We can tell by looking at the token after
11972 the identifier -- if it is a `,', `=', or `>' then we have a type
11974 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
11976 /* Peek at the token after `class' or `typename'. */
11977 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11978 /* If it's an ellipsis, we have a template type parameter
11980 if (token->type == CPP_ELLIPSIS)
11981 return cp_parser_type_parameter (parser, is_parameter_pack);
11982 /* If it's an identifier, skip it. */
11983 if (token->type == CPP_NAME)
11984 token = cp_lexer_peek_nth_token (parser->lexer, 3);
11985 /* Now, see if the token looks like the end of a template
11987 if (token->type == CPP_COMMA
11988 || token->type == CPP_EQ
11989 || token->type == CPP_GREATER)
11990 return cp_parser_type_parameter (parser, is_parameter_pack);
11993 /* Otherwise, it is a non-type parameter.
11997 When parsing a default template-argument for a non-type
11998 template-parameter, the first non-nested `>' is taken as the end
11999 of the template parameter-list rather than a greater-than
12001 *is_non_type = true;
12002 parameter_declarator
12003 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
12004 /*parenthesized_p=*/NULL);
12006 /* If the parameter declaration is marked as a parameter pack, set
12007 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12008 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12010 if (parameter_declarator
12011 && parameter_declarator->declarator
12012 && parameter_declarator->declarator->parameter_pack_p)
12014 *is_parameter_pack = true;
12015 parameter_declarator->declarator->parameter_pack_p = false;
12018 /* If the next token is an ellipsis, and we don't already have it
12019 marked as a parameter pack, then we have a parameter pack (that
12020 has no declarator). */
12021 if (!*is_parameter_pack
12022 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
12023 && declarator_can_be_parameter_pack (parameter_declarator->declarator))
12025 /* Consume the `...'. */
12026 cp_lexer_consume_token (parser->lexer);
12027 maybe_warn_variadic_templates ();
12029 *is_parameter_pack = true;
12031 /* We might end up with a pack expansion as the type of the non-type
12032 template parameter, in which case this is a non-type template
12034 else if (parameter_declarator
12035 && parameter_declarator->decl_specifiers.type
12036 && PACK_EXPANSION_P (parameter_declarator->decl_specifiers.type))
12038 *is_parameter_pack = true;
12039 parameter_declarator->decl_specifiers.type =
12040 PACK_EXPANSION_PATTERN (parameter_declarator->decl_specifiers.type);
12043 if (*is_parameter_pack && cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12045 /* Parameter packs cannot have default arguments. However, a
12046 user may try to do so, so we'll parse them and give an
12047 appropriate diagnostic here. */
12049 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
12051 /* Find the name of the parameter pack. */
12052 id_declarator = parameter_declarator->declarator;
12053 while (id_declarator && id_declarator->kind != cdk_id)
12054 id_declarator = id_declarator->declarator;
12056 if (id_declarator && id_declarator->kind == cdk_id)
12057 error_at (start_token->location,
12058 "template parameter pack %qD cannot have a default argument",
12059 id_declarator->u.id.unqualified_name);
12061 error_at (start_token->location,
12062 "template parameter pack cannot have a default argument");
12064 /* Parse the default argument, but throw away the result. */
12065 cp_parser_default_argument (parser, /*template_parm_p=*/true);
12068 parm = grokdeclarator (parameter_declarator->declarator,
12069 ¶meter_declarator->decl_specifiers,
12070 TPARM, /*initialized=*/0,
12071 /*attrlist=*/NULL);
12072 if (parm == error_mark_node)
12073 return error_mark_node;
12075 return build_tree_list (parameter_declarator->default_argument, parm);
12078 /* Parse a type-parameter.
12081 class identifier [opt]
12082 class identifier [opt] = type-id
12083 typename identifier [opt]
12084 typename identifier [opt] = type-id
12085 template < template-parameter-list > class identifier [opt]
12086 template < template-parameter-list > class identifier [opt]
12089 GNU Extension (variadic templates):
12092 class ... identifier [opt]
12093 typename ... identifier [opt]
12095 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12096 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12097 the declaration of the parameter.
12099 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12102 cp_parser_type_parameter (cp_parser* parser, bool *is_parameter_pack)
12107 /* Look for a keyword to tell us what kind of parameter this is. */
12108 token = cp_parser_require (parser, CPP_KEYWORD, RT_CLASS_TYPENAME_TEMPLATE);
12110 return error_mark_node;
12112 switch (token->keyword)
12118 tree default_argument;
12120 /* If the next token is an ellipsis, we have a template
12122 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
12124 /* Consume the `...' token. */
12125 cp_lexer_consume_token (parser->lexer);
12126 maybe_warn_variadic_templates ();
12128 *is_parameter_pack = true;
12131 /* If the next token is an identifier, then it names the
12133 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12134 identifier = cp_parser_identifier (parser);
12136 identifier = NULL_TREE;
12138 /* Create the parameter. */
12139 parameter = finish_template_type_parm (class_type_node, identifier);
12141 /* If the next token is an `=', we have a default argument. */
12142 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12144 /* Consume the `=' token. */
12145 cp_lexer_consume_token (parser->lexer);
12146 /* Parse the default-argument. */
12147 push_deferring_access_checks (dk_no_deferred);
12148 default_argument = cp_parser_type_id (parser);
12150 /* Template parameter packs cannot have default
12152 if (*is_parameter_pack)
12155 error_at (token->location,
12156 "template parameter pack %qD cannot have a "
12157 "default argument", identifier);
12159 error_at (token->location,
12160 "template parameter packs cannot have "
12161 "default arguments");
12162 default_argument = NULL_TREE;
12164 pop_deferring_access_checks ();
12167 default_argument = NULL_TREE;
12169 /* Create the combined representation of the parameter and the
12170 default argument. */
12171 parameter = build_tree_list (default_argument, parameter);
12178 tree default_argument;
12180 /* Look for the `<'. */
12181 cp_parser_require (parser, CPP_LESS, RT_LESS);
12182 /* Parse the template-parameter-list. */
12183 cp_parser_template_parameter_list (parser);
12184 /* Look for the `>'. */
12185 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
12186 /* Look for the `class' keyword. */
12187 cp_parser_require_keyword (parser, RID_CLASS, RT_CLASS);
12188 /* If the next token is an ellipsis, we have a template
12190 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
12192 /* Consume the `...' token. */
12193 cp_lexer_consume_token (parser->lexer);
12194 maybe_warn_variadic_templates ();
12196 *is_parameter_pack = true;
12198 /* If the next token is an `=', then there is a
12199 default-argument. If the next token is a `>', we are at
12200 the end of the parameter-list. If the next token is a `,',
12201 then we are at the end of this parameter. */
12202 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
12203 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
12204 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12206 identifier = cp_parser_identifier (parser);
12207 /* Treat invalid names as if the parameter were nameless. */
12208 if (identifier == error_mark_node)
12209 identifier = NULL_TREE;
12212 identifier = NULL_TREE;
12214 /* Create the template parameter. */
12215 parameter = finish_template_template_parm (class_type_node,
12218 /* If the next token is an `=', then there is a
12219 default-argument. */
12220 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12224 /* Consume the `='. */
12225 cp_lexer_consume_token (parser->lexer);
12226 /* Parse the id-expression. */
12227 push_deferring_access_checks (dk_no_deferred);
12228 /* save token before parsing the id-expression, for error
12230 token = cp_lexer_peek_token (parser->lexer);
12232 = cp_parser_id_expression (parser,
12233 /*template_keyword_p=*/false,
12234 /*check_dependency_p=*/true,
12235 /*template_p=*/&is_template,
12236 /*declarator_p=*/false,
12237 /*optional_p=*/false);
12238 if (TREE_CODE (default_argument) == TYPE_DECL)
12239 /* If the id-expression was a template-id that refers to
12240 a template-class, we already have the declaration here,
12241 so no further lookup is needed. */
12244 /* Look up the name. */
12246 = cp_parser_lookup_name (parser, default_argument,
12248 /*is_template=*/is_template,
12249 /*is_namespace=*/false,
12250 /*check_dependency=*/true,
12251 /*ambiguous_decls=*/NULL,
12253 /* See if the default argument is valid. */
12255 = check_template_template_default_arg (default_argument);
12257 /* Template parameter packs cannot have default
12259 if (*is_parameter_pack)
12262 error_at (token->location,
12263 "template parameter pack %qD cannot "
12264 "have a default argument",
12267 error_at (token->location, "template parameter packs cannot "
12268 "have default arguments");
12269 default_argument = NULL_TREE;
12271 pop_deferring_access_checks ();
12274 default_argument = NULL_TREE;
12276 /* Create the combined representation of the parameter and the
12277 default argument. */
12278 parameter = build_tree_list (default_argument, parameter);
12283 gcc_unreachable ();
12290 /* Parse a template-id.
12293 template-name < template-argument-list [opt] >
12295 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12296 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12297 returned. Otherwise, if the template-name names a function, or set
12298 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12299 names a class, returns a TYPE_DECL for the specialization.
12301 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12302 uninstantiated templates. */
12305 cp_parser_template_id (cp_parser *parser,
12306 bool template_keyword_p,
12307 bool check_dependency_p,
12308 bool is_declaration)
12314 cp_token_position start_of_id = 0;
12315 deferred_access_check *chk;
12316 VEC (deferred_access_check,gc) *access_check;
12317 cp_token *next_token = NULL, *next_token_2 = NULL;
12318 bool is_identifier;
12320 /* If the next token corresponds to a template-id, there is no need
12322 next_token = cp_lexer_peek_token (parser->lexer);
12323 if (next_token->type == CPP_TEMPLATE_ID)
12325 struct tree_check *check_value;
12327 /* Get the stored value. */
12328 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
12329 /* Perform any access checks that were deferred. */
12330 access_check = check_value->checks;
12333 FOR_EACH_VEC_ELT (deferred_access_check, access_check, i, chk)
12334 perform_or_defer_access_check (chk->binfo,
12338 /* Return the stored value. */
12339 return check_value->value;
12342 /* Avoid performing name lookup if there is no possibility of
12343 finding a template-id. */
12344 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
12345 || (next_token->type == CPP_NAME
12346 && !cp_parser_nth_token_starts_template_argument_list_p
12349 cp_parser_error (parser, "expected template-id");
12350 return error_mark_node;
12353 /* Remember where the template-id starts. */
12354 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
12355 start_of_id = cp_lexer_token_position (parser->lexer, false);
12357 push_deferring_access_checks (dk_deferred);
12359 /* Parse the template-name. */
12360 is_identifier = false;
12361 templ = cp_parser_template_name (parser, template_keyword_p,
12362 check_dependency_p,
12365 if (templ == error_mark_node || is_identifier)
12367 pop_deferring_access_checks ();
12371 /* If we find the sequence `[:' after a template-name, it's probably
12372 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12373 parse correctly the argument list. */
12374 next_token = cp_lexer_peek_token (parser->lexer);
12375 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
12376 if (next_token->type == CPP_OPEN_SQUARE
12377 && next_token->flags & DIGRAPH
12378 && next_token_2->type == CPP_COLON
12379 && !(next_token_2->flags & PREV_WHITE))
12381 cp_parser_parse_tentatively (parser);
12382 /* Change `:' into `::'. */
12383 next_token_2->type = CPP_SCOPE;
12384 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12386 cp_lexer_consume_token (parser->lexer);
12388 /* Parse the arguments. */
12389 arguments = cp_parser_enclosed_template_argument_list (parser);
12390 if (!cp_parser_parse_definitely (parser))
12392 /* If we couldn't parse an argument list, then we revert our changes
12393 and return simply an error. Maybe this is not a template-id
12395 next_token_2->type = CPP_COLON;
12396 cp_parser_error (parser, "expected %<<%>");
12397 pop_deferring_access_checks ();
12398 return error_mark_node;
12400 /* Otherwise, emit an error about the invalid digraph, but continue
12401 parsing because we got our argument list. */
12402 if (permerror (next_token->location,
12403 "%<<::%> cannot begin a template-argument list"))
12405 static bool hint = false;
12406 inform (next_token->location,
12407 "%<<:%> is an alternate spelling for %<[%>."
12408 " Insert whitespace between %<<%> and %<::%>");
12409 if (!hint && !flag_permissive)
12411 inform (next_token->location, "(if you use %<-fpermissive%>"
12412 " G++ will accept your code)");
12419 /* Look for the `<' that starts the template-argument-list. */
12420 if (!cp_parser_require (parser, CPP_LESS, RT_LESS))
12422 pop_deferring_access_checks ();
12423 return error_mark_node;
12425 /* Parse the arguments. */
12426 arguments = cp_parser_enclosed_template_argument_list (parser);
12429 /* Build a representation of the specialization. */
12430 if (TREE_CODE (templ) == IDENTIFIER_NODE)
12431 template_id = build_min_nt (TEMPLATE_ID_EXPR, templ, arguments);
12432 else if (DECL_TYPE_TEMPLATE_P (templ)
12433 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ))
12435 bool entering_scope;
12436 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12437 template (rather than some instantiation thereof) only if
12438 is not nested within some other construct. For example, in
12439 "template <typename T> void f(T) { A<T>::", A<T> is just an
12440 instantiation of A. */
12441 entering_scope = (template_parm_scope_p ()
12442 && cp_lexer_next_token_is (parser->lexer,
12445 = finish_template_type (templ, arguments, entering_scope);
12449 /* If it's not a class-template or a template-template, it should be
12450 a function-template. */
12451 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ)
12452 || TREE_CODE (templ) == OVERLOAD
12453 || BASELINK_P (templ)));
12455 template_id = lookup_template_function (templ, arguments);
12458 /* If parsing tentatively, replace the sequence of tokens that makes
12459 up the template-id with a CPP_TEMPLATE_ID token. That way,
12460 should we re-parse the token stream, we will not have to repeat
12461 the effort required to do the parse, nor will we issue duplicate
12462 error messages about problems during instantiation of the
12466 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
12468 /* Reset the contents of the START_OF_ID token. */
12469 token->type = CPP_TEMPLATE_ID;
12470 /* Retrieve any deferred checks. Do not pop this access checks yet
12471 so the memory will not be reclaimed during token replacing below. */
12472 token->u.tree_check_value = ggc_alloc_cleared_tree_check ();
12473 token->u.tree_check_value->value = template_id;
12474 token->u.tree_check_value->checks = get_deferred_access_checks ();
12475 token->keyword = RID_MAX;
12477 /* Purge all subsequent tokens. */
12478 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
12480 /* ??? Can we actually assume that, if template_id ==
12481 error_mark_node, we will have issued a diagnostic to the
12482 user, as opposed to simply marking the tentative parse as
12484 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
12485 error_at (token->location, "parse error in template argument list");
12488 pop_deferring_access_checks ();
12489 return template_id;
12492 /* Parse a template-name.
12497 The standard should actually say:
12501 operator-function-id
12503 A defect report has been filed about this issue.
12505 A conversion-function-id cannot be a template name because they cannot
12506 be part of a template-id. In fact, looking at this code:
12508 a.operator K<int>()
12510 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12511 It is impossible to call a templated conversion-function-id with an
12512 explicit argument list, since the only allowed template parameter is
12513 the type to which it is converting.
12515 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12516 `template' keyword, in a construction like:
12520 In that case `f' is taken to be a template-name, even though there
12521 is no way of knowing for sure.
12523 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12524 name refers to a set of overloaded functions, at least one of which
12525 is a template, or an IDENTIFIER_NODE with the name of the template,
12526 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12527 names are looked up inside uninstantiated templates. */
12530 cp_parser_template_name (cp_parser* parser,
12531 bool template_keyword_p,
12532 bool check_dependency_p,
12533 bool is_declaration,
12534 bool *is_identifier)
12539 cp_token *token = cp_lexer_peek_token (parser->lexer);
12541 /* If the next token is `operator', then we have either an
12542 operator-function-id or a conversion-function-id. */
12543 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
12545 /* We don't know whether we're looking at an
12546 operator-function-id or a conversion-function-id. */
12547 cp_parser_parse_tentatively (parser);
12548 /* Try an operator-function-id. */
12549 identifier = cp_parser_operator_function_id (parser);
12550 /* If that didn't work, try a conversion-function-id. */
12551 if (!cp_parser_parse_definitely (parser))
12553 cp_parser_error (parser, "expected template-name");
12554 return error_mark_node;
12557 /* Look for the identifier. */
12559 identifier = cp_parser_identifier (parser);
12561 /* If we didn't find an identifier, we don't have a template-id. */
12562 if (identifier == error_mark_node)
12563 return error_mark_node;
12565 /* If the name immediately followed the `template' keyword, then it
12566 is a template-name. However, if the next token is not `<', then
12567 we do not treat it as a template-name, since it is not being used
12568 as part of a template-id. This enables us to handle constructs
12571 template <typename T> struct S { S(); };
12572 template <typename T> S<T>::S();
12574 correctly. We would treat `S' as a template -- if it were `S<T>'
12575 -- but we do not if there is no `<'. */
12577 if (processing_template_decl
12578 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
12580 /* In a declaration, in a dependent context, we pretend that the
12581 "template" keyword was present in order to improve error
12582 recovery. For example, given:
12584 template <typename T> void f(T::X<int>);
12586 we want to treat "X<int>" as a template-id. */
12588 && !template_keyword_p
12589 && parser->scope && TYPE_P (parser->scope)
12590 && check_dependency_p
12591 && dependent_scope_p (parser->scope)
12592 /* Do not do this for dtors (or ctors), since they never
12593 need the template keyword before their name. */
12594 && !constructor_name_p (identifier, parser->scope))
12596 cp_token_position start = 0;
12598 /* Explain what went wrong. */
12599 error_at (token->location, "non-template %qD used as template",
12601 inform (token->location, "use %<%T::template %D%> to indicate that it is a template",
12602 parser->scope, identifier);
12603 /* If parsing tentatively, find the location of the "<" token. */
12604 if (cp_parser_simulate_error (parser))
12605 start = cp_lexer_token_position (parser->lexer, true);
12606 /* Parse the template arguments so that we can issue error
12607 messages about them. */
12608 cp_lexer_consume_token (parser->lexer);
12609 cp_parser_enclosed_template_argument_list (parser);
12610 /* Skip tokens until we find a good place from which to
12611 continue parsing. */
12612 cp_parser_skip_to_closing_parenthesis (parser,
12613 /*recovering=*/true,
12615 /*consume_paren=*/false);
12616 /* If parsing tentatively, permanently remove the
12617 template argument list. That will prevent duplicate
12618 error messages from being issued about the missing
12619 "template" keyword. */
12621 cp_lexer_purge_tokens_after (parser->lexer, start);
12623 *is_identifier = true;
12627 /* If the "template" keyword is present, then there is generally
12628 no point in doing name-lookup, so we just return IDENTIFIER.
12629 But, if the qualifying scope is non-dependent then we can
12630 (and must) do name-lookup normally. */
12631 if (template_keyword_p
12633 || (TYPE_P (parser->scope)
12634 && dependent_type_p (parser->scope))))
12638 /* Look up the name. */
12639 decl = cp_parser_lookup_name (parser, identifier,
12641 /*is_template=*/true,
12642 /*is_namespace=*/false,
12643 check_dependency_p,
12644 /*ambiguous_decls=*/NULL,
12647 /* If DECL is a template, then the name was a template-name. */
12648 if (TREE_CODE (decl) == TEMPLATE_DECL)
12652 tree fn = NULL_TREE;
12654 /* The standard does not explicitly indicate whether a name that
12655 names a set of overloaded declarations, some of which are
12656 templates, is a template-name. However, such a name should
12657 be a template-name; otherwise, there is no way to form a
12658 template-id for the overloaded templates. */
12659 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
12660 if (TREE_CODE (fns) == OVERLOAD)
12661 for (fn = fns; fn; fn = OVL_NEXT (fn))
12662 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
12667 /* The name does not name a template. */
12668 cp_parser_error (parser, "expected template-name");
12669 return error_mark_node;
12673 /* If DECL is dependent, and refers to a function, then just return
12674 its name; we will look it up again during template instantiation. */
12675 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
12677 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
12678 if (TYPE_P (scope) && dependent_type_p (scope))
12685 /* Parse a template-argument-list.
12687 template-argument-list:
12688 template-argument ... [opt]
12689 template-argument-list , template-argument ... [opt]
12691 Returns a TREE_VEC containing the arguments. */
12694 cp_parser_template_argument_list (cp_parser* parser)
12696 tree fixed_args[10];
12697 unsigned n_args = 0;
12698 unsigned alloced = 10;
12699 tree *arg_ary = fixed_args;
12701 bool saved_in_template_argument_list_p;
12703 bool saved_non_ice_p;
12705 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
12706 parser->in_template_argument_list_p = true;
12707 /* Even if the template-id appears in an integral
12708 constant-expression, the contents of the argument list do
12710 saved_ice_p = parser->integral_constant_expression_p;
12711 parser->integral_constant_expression_p = false;
12712 saved_non_ice_p = parser->non_integral_constant_expression_p;
12713 parser->non_integral_constant_expression_p = false;
12715 /* Parse the arguments. */
12721 /* Consume the comma. */
12722 cp_lexer_consume_token (parser->lexer);
12724 /* Parse the template-argument. */
12725 argument = cp_parser_template_argument (parser);
12727 /* If the next token is an ellipsis, we're expanding a template
12729 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
12731 if (argument == error_mark_node)
12733 cp_token *token = cp_lexer_peek_token (parser->lexer);
12734 error_at (token->location,
12735 "expected parameter pack before %<...%>");
12737 /* Consume the `...' token. */
12738 cp_lexer_consume_token (parser->lexer);
12740 /* Make the argument into a TYPE_PACK_EXPANSION or
12741 EXPR_PACK_EXPANSION. */
12742 argument = make_pack_expansion (argument);
12745 if (n_args == alloced)
12749 if (arg_ary == fixed_args)
12751 arg_ary = XNEWVEC (tree, alloced);
12752 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
12755 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
12757 arg_ary[n_args++] = argument;
12759 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
12761 vec = make_tree_vec (n_args);
12764 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
12766 if (arg_ary != fixed_args)
12768 parser->non_integral_constant_expression_p = saved_non_ice_p;
12769 parser->integral_constant_expression_p = saved_ice_p;
12770 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
12771 #ifdef ENABLE_CHECKING
12772 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec, TREE_VEC_LENGTH (vec));
12777 /* Parse a template-argument.
12780 assignment-expression
12784 The representation is that of an assignment-expression, type-id, or
12785 id-expression -- except that the qualified id-expression is
12786 evaluated, so that the value returned is either a DECL or an
12789 Although the standard says "assignment-expression", it forbids
12790 throw-expressions or assignments in the template argument.
12791 Therefore, we use "conditional-expression" instead. */
12794 cp_parser_template_argument (cp_parser* parser)
12799 bool maybe_type_id = false;
12800 cp_token *token = NULL, *argument_start_token = NULL;
12803 /* There's really no way to know what we're looking at, so we just
12804 try each alternative in order.
12808 In a template-argument, an ambiguity between a type-id and an
12809 expression is resolved to a type-id, regardless of the form of
12810 the corresponding template-parameter.
12812 Therefore, we try a type-id first. */
12813 cp_parser_parse_tentatively (parser);
12814 argument = cp_parser_template_type_arg (parser);
12815 /* If there was no error parsing the type-id but the next token is a
12816 '>>', our behavior depends on which dialect of C++ we're
12817 parsing. In C++98, we probably found a typo for '> >'. But there
12818 are type-id which are also valid expressions. For instance:
12820 struct X { int operator >> (int); };
12821 template <int V> struct Foo {};
12824 Here 'X()' is a valid type-id of a function type, but the user just
12825 wanted to write the expression "X() >> 5". Thus, we remember that we
12826 found a valid type-id, but we still try to parse the argument as an
12827 expression to see what happens.
12829 In C++0x, the '>>' will be considered two separate '>'
12831 if (!cp_parser_error_occurred (parser)
12832 && cxx_dialect == cxx98
12833 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
12835 maybe_type_id = true;
12836 cp_parser_abort_tentative_parse (parser);
12840 /* If the next token isn't a `,' or a `>', then this argument wasn't
12841 really finished. This means that the argument is not a valid
12843 if (!cp_parser_next_token_ends_template_argument_p (parser))
12844 cp_parser_error (parser, "expected template-argument");
12845 /* If that worked, we're done. */
12846 if (cp_parser_parse_definitely (parser))
12849 /* We're still not sure what the argument will be. */
12850 cp_parser_parse_tentatively (parser);
12851 /* Try a template. */
12852 argument_start_token = cp_lexer_peek_token (parser->lexer);
12853 argument = cp_parser_id_expression (parser,
12854 /*template_keyword_p=*/false,
12855 /*check_dependency_p=*/true,
12857 /*declarator_p=*/false,
12858 /*optional_p=*/false);
12859 /* If the next token isn't a `,' or a `>', then this argument wasn't
12860 really finished. */
12861 if (!cp_parser_next_token_ends_template_argument_p (parser))
12862 cp_parser_error (parser, "expected template-argument");
12863 if (!cp_parser_error_occurred (parser))
12865 /* Figure out what is being referred to. If the id-expression
12866 was for a class template specialization, then we will have a
12867 TYPE_DECL at this point. There is no need to do name lookup
12868 at this point in that case. */
12869 if (TREE_CODE (argument) != TYPE_DECL)
12870 argument = cp_parser_lookup_name (parser, argument,
12872 /*is_template=*/template_p,
12873 /*is_namespace=*/false,
12874 /*check_dependency=*/true,
12875 /*ambiguous_decls=*/NULL,
12876 argument_start_token->location);
12877 if (TREE_CODE (argument) != TEMPLATE_DECL
12878 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
12879 cp_parser_error (parser, "expected template-name");
12881 if (cp_parser_parse_definitely (parser))
12883 /* It must be a non-type argument. There permitted cases are given
12884 in [temp.arg.nontype]:
12886 -- an integral constant-expression of integral or enumeration
12889 -- the name of a non-type template-parameter; or
12891 -- the name of an object or function with external linkage...
12893 -- the address of an object or function with external linkage...
12895 -- a pointer to member... */
12896 /* Look for a non-type template parameter. */
12897 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12899 cp_parser_parse_tentatively (parser);
12900 argument = cp_parser_primary_expression (parser,
12901 /*address_p=*/false,
12903 /*template_arg_p=*/true,
12905 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
12906 || !cp_parser_next_token_ends_template_argument_p (parser))
12907 cp_parser_simulate_error (parser);
12908 if (cp_parser_parse_definitely (parser))
12912 /* If the next token is "&", the argument must be the address of an
12913 object or function with external linkage. */
12914 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
12916 cp_lexer_consume_token (parser->lexer);
12917 /* See if we might have an id-expression. */
12918 token = cp_lexer_peek_token (parser->lexer);
12919 if (token->type == CPP_NAME
12920 || token->keyword == RID_OPERATOR
12921 || token->type == CPP_SCOPE
12922 || token->type == CPP_TEMPLATE_ID
12923 || token->type == CPP_NESTED_NAME_SPECIFIER)
12925 cp_parser_parse_tentatively (parser);
12926 argument = cp_parser_primary_expression (parser,
12929 /*template_arg_p=*/true,
12931 if (cp_parser_error_occurred (parser)
12932 || !cp_parser_next_token_ends_template_argument_p (parser))
12933 cp_parser_abort_tentative_parse (parser);
12938 if (TREE_CODE (argument) == INDIRECT_REF)
12940 gcc_assert (REFERENCE_REF_P (argument));
12941 argument = TREE_OPERAND (argument, 0);
12944 /* If we're in a template, we represent a qualified-id referring
12945 to a static data member as a SCOPE_REF even if the scope isn't
12946 dependent so that we can check access control later. */
12948 if (TREE_CODE (probe) == SCOPE_REF)
12949 probe = TREE_OPERAND (probe, 1);
12950 if (TREE_CODE (probe) == VAR_DECL)
12952 /* A variable without external linkage might still be a
12953 valid constant-expression, so no error is issued here
12954 if the external-linkage check fails. */
12955 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (probe))
12956 cp_parser_simulate_error (parser);
12958 else if (is_overloaded_fn (argument))
12959 /* All overloaded functions are allowed; if the external
12960 linkage test does not pass, an error will be issued
12964 && (TREE_CODE (argument) == OFFSET_REF
12965 || TREE_CODE (argument) == SCOPE_REF))
12966 /* A pointer-to-member. */
12968 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
12971 cp_parser_simulate_error (parser);
12973 if (cp_parser_parse_definitely (parser))
12976 argument = build_x_unary_op (ADDR_EXPR, argument,
12977 tf_warning_or_error);
12982 /* If the argument started with "&", there are no other valid
12983 alternatives at this point. */
12986 cp_parser_error (parser, "invalid non-type template argument");
12987 return error_mark_node;
12990 /* If the argument wasn't successfully parsed as a type-id followed
12991 by '>>', the argument can only be a constant expression now.
12992 Otherwise, we try parsing the constant-expression tentatively,
12993 because the argument could really be a type-id. */
12995 cp_parser_parse_tentatively (parser);
12996 argument = cp_parser_constant_expression (parser,
12997 /*allow_non_constant_p=*/false,
12998 /*non_constant_p=*/NULL);
12999 argument = fold_non_dependent_expr (argument);
13000 if (!maybe_type_id)
13002 if (!cp_parser_next_token_ends_template_argument_p (parser))
13003 cp_parser_error (parser, "expected template-argument");
13004 if (cp_parser_parse_definitely (parser))
13006 /* We did our best to parse the argument as a non type-id, but that
13007 was the only alternative that matched (albeit with a '>' after
13008 it). We can assume it's just a typo from the user, and a
13009 diagnostic will then be issued. */
13010 return cp_parser_template_type_arg (parser);
13013 /* Parse an explicit-instantiation.
13015 explicit-instantiation:
13016 template declaration
13018 Although the standard says `declaration', what it really means is:
13020 explicit-instantiation:
13021 template decl-specifier-seq [opt] declarator [opt] ;
13023 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13024 supposed to be allowed. A defect report has been filed about this
13029 explicit-instantiation:
13030 storage-class-specifier template
13031 decl-specifier-seq [opt] declarator [opt] ;
13032 function-specifier template
13033 decl-specifier-seq [opt] declarator [opt] ; */
13036 cp_parser_explicit_instantiation (cp_parser* parser)
13038 int declares_class_or_enum;
13039 cp_decl_specifier_seq decl_specifiers;
13040 tree extension_specifier = NULL_TREE;
13042 timevar_push (TV_TEMPLATE_INST);
13044 /* Look for an (optional) storage-class-specifier or
13045 function-specifier. */
13046 if (cp_parser_allow_gnu_extensions_p (parser))
13048 extension_specifier
13049 = cp_parser_storage_class_specifier_opt (parser);
13050 if (!extension_specifier)
13051 extension_specifier
13052 = cp_parser_function_specifier_opt (parser,
13053 /*decl_specs=*/NULL);
13056 /* Look for the `template' keyword. */
13057 cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE);
13058 /* Let the front end know that we are processing an explicit
13060 begin_explicit_instantiation ();
13061 /* [temp.explicit] says that we are supposed to ignore access
13062 control while processing explicit instantiation directives. */
13063 push_deferring_access_checks (dk_no_check);
13064 /* Parse a decl-specifier-seq. */
13065 cp_parser_decl_specifier_seq (parser,
13066 CP_PARSER_FLAGS_OPTIONAL,
13068 &declares_class_or_enum);
13069 /* If there was exactly one decl-specifier, and it declared a class,
13070 and there's no declarator, then we have an explicit type
13072 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
13076 type = check_tag_decl (&decl_specifiers);
13077 /* Turn access control back on for names used during
13078 template instantiation. */
13079 pop_deferring_access_checks ();
13081 do_type_instantiation (type, extension_specifier,
13082 /*complain=*/tf_error);
13086 cp_declarator *declarator;
13089 /* Parse the declarator. */
13091 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13092 /*ctor_dtor_or_conv_p=*/NULL,
13093 /*parenthesized_p=*/NULL,
13094 /*member_p=*/false);
13095 if (declares_class_or_enum & 2)
13096 cp_parser_check_for_definition_in_return_type (declarator,
13097 decl_specifiers.type,
13098 decl_specifiers.type_location);
13099 if (declarator != cp_error_declarator)
13101 if (decl_specifiers.specs[(int)ds_inline])
13102 permerror (input_location, "explicit instantiation shall not use"
13103 " %<inline%> specifier");
13104 if (decl_specifiers.specs[(int)ds_constexpr])
13105 permerror (input_location, "explicit instantiation shall not use"
13106 " %<constexpr%> specifier");
13108 decl = grokdeclarator (declarator, &decl_specifiers,
13109 NORMAL, 0, &decl_specifiers.attributes);
13110 /* Turn access control back on for names used during
13111 template instantiation. */
13112 pop_deferring_access_checks ();
13113 /* Do the explicit instantiation. */
13114 do_decl_instantiation (decl, extension_specifier);
13118 pop_deferring_access_checks ();
13119 /* Skip the body of the explicit instantiation. */
13120 cp_parser_skip_to_end_of_statement (parser);
13123 /* We're done with the instantiation. */
13124 end_explicit_instantiation ();
13126 cp_parser_consume_semicolon_at_end_of_statement (parser);
13128 timevar_pop (TV_TEMPLATE_INST);
13131 /* Parse an explicit-specialization.
13133 explicit-specialization:
13134 template < > declaration
13136 Although the standard says `declaration', what it really means is:
13138 explicit-specialization:
13139 template <> decl-specifier [opt] init-declarator [opt] ;
13140 template <> function-definition
13141 template <> explicit-specialization
13142 template <> template-declaration */
13145 cp_parser_explicit_specialization (cp_parser* parser)
13147 bool need_lang_pop;
13148 cp_token *token = cp_lexer_peek_token (parser->lexer);
13150 /* Look for the `template' keyword. */
13151 cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE);
13152 /* Look for the `<'. */
13153 cp_parser_require (parser, CPP_LESS, RT_LESS);
13154 /* Look for the `>'. */
13155 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
13156 /* We have processed another parameter list. */
13157 ++parser->num_template_parameter_lists;
13160 A template ... explicit specialization ... shall not have C
13162 if (current_lang_name == lang_name_c)
13164 error_at (token->location, "template specialization with C linkage");
13165 /* Give it C++ linkage to avoid confusing other parts of the
13167 push_lang_context (lang_name_cplusplus);
13168 need_lang_pop = true;
13171 need_lang_pop = false;
13172 /* Let the front end know that we are beginning a specialization. */
13173 if (!begin_specialization ())
13175 end_specialization ();
13179 /* If the next keyword is `template', we need to figure out whether
13180 or not we're looking a template-declaration. */
13181 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13183 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
13184 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
13185 cp_parser_template_declaration_after_export (parser,
13186 /*member_p=*/false);
13188 cp_parser_explicit_specialization (parser);
13191 /* Parse the dependent declaration. */
13192 cp_parser_single_declaration (parser,
13194 /*member_p=*/false,
13195 /*explicit_specialization_p=*/true,
13196 /*friend_p=*/NULL);
13197 /* We're done with the specialization. */
13198 end_specialization ();
13199 /* For the erroneous case of a template with C linkage, we pushed an
13200 implicit C++ linkage scope; exit that scope now. */
13202 pop_lang_context ();
13203 /* We're done with this parameter list. */
13204 --parser->num_template_parameter_lists;
13207 /* Parse a type-specifier.
13210 simple-type-specifier
13213 elaborated-type-specifier
13221 Returns a representation of the type-specifier. For a
13222 class-specifier, enum-specifier, or elaborated-type-specifier, a
13223 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13225 The parser flags FLAGS is used to control type-specifier parsing.
13227 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13228 in a decl-specifier-seq.
13230 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13231 class-specifier, enum-specifier, or elaborated-type-specifier, then
13232 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13233 if a type is declared; 2 if it is defined. Otherwise, it is set to
13236 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13237 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13238 is set to FALSE. */
13241 cp_parser_type_specifier (cp_parser* parser,
13242 cp_parser_flags flags,
13243 cp_decl_specifier_seq *decl_specs,
13244 bool is_declaration,
13245 int* declares_class_or_enum,
13246 bool* is_cv_qualifier)
13248 tree type_spec = NULL_TREE;
13251 cp_decl_spec ds = ds_last;
13253 /* Assume this type-specifier does not declare a new type. */
13254 if (declares_class_or_enum)
13255 *declares_class_or_enum = 0;
13256 /* And that it does not specify a cv-qualifier. */
13257 if (is_cv_qualifier)
13258 *is_cv_qualifier = false;
13259 /* Peek at the next token. */
13260 token = cp_lexer_peek_token (parser->lexer);
13262 /* If we're looking at a keyword, we can use that to guide the
13263 production we choose. */
13264 keyword = token->keyword;
13268 if ((flags & CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS))
13269 goto elaborated_type_specifier;
13271 /* Look for the enum-specifier. */
13272 type_spec = cp_parser_enum_specifier (parser);
13273 /* If that worked, we're done. */
13276 if (declares_class_or_enum)
13277 *declares_class_or_enum = 2;
13279 cp_parser_set_decl_spec_type (decl_specs,
13282 /*type_definition_p=*/true);
13286 goto elaborated_type_specifier;
13288 /* Any of these indicate either a class-specifier, or an
13289 elaborated-type-specifier. */
13293 if ((flags & CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS))
13294 goto elaborated_type_specifier;
13296 /* Parse tentatively so that we can back up if we don't find a
13297 class-specifier. */
13298 cp_parser_parse_tentatively (parser);
13299 /* Look for the class-specifier. */
13300 type_spec = cp_parser_class_specifier (parser);
13301 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE, type_spec);
13302 /* If that worked, we're done. */
13303 if (cp_parser_parse_definitely (parser))
13305 if (declares_class_or_enum)
13306 *declares_class_or_enum = 2;
13308 cp_parser_set_decl_spec_type (decl_specs,
13311 /*type_definition_p=*/true);
13315 /* Fall through. */
13316 elaborated_type_specifier:
13317 /* We're declaring (not defining) a class or enum. */
13318 if (declares_class_or_enum)
13319 *declares_class_or_enum = 1;
13321 /* Fall through. */
13323 /* Look for an elaborated-type-specifier. */
13325 = (cp_parser_elaborated_type_specifier
13327 decl_specs && decl_specs->specs[(int) ds_friend],
13330 cp_parser_set_decl_spec_type (decl_specs,
13333 /*type_definition_p=*/false);
13338 if (is_cv_qualifier)
13339 *is_cv_qualifier = true;
13344 if (is_cv_qualifier)
13345 *is_cv_qualifier = true;
13350 if (is_cv_qualifier)
13351 *is_cv_qualifier = true;
13355 /* The `__complex__' keyword is a GNU extension. */
13363 /* Handle simple keywords. */
13368 ++decl_specs->specs[(int)ds];
13369 decl_specs->any_specifiers_p = true;
13371 return cp_lexer_consume_token (parser->lexer)->u.value;
13374 /* If we do not already have a type-specifier, assume we are looking
13375 at a simple-type-specifier. */
13376 type_spec = cp_parser_simple_type_specifier (parser,
13380 /* If we didn't find a type-specifier, and a type-specifier was not
13381 optional in this context, issue an error message. */
13382 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
13384 cp_parser_error (parser, "expected type specifier");
13385 return error_mark_node;
13391 /* Parse a simple-type-specifier.
13393 simple-type-specifier:
13394 :: [opt] nested-name-specifier [opt] type-name
13395 :: [opt] nested-name-specifier template template-id
13410 simple-type-specifier:
13412 decltype ( expression )
13415 __underlying_type ( type-id )
13419 simple-type-specifier:
13421 __typeof__ unary-expression
13422 __typeof__ ( type-id )
13424 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13425 appropriately updated. */
13428 cp_parser_simple_type_specifier (cp_parser* parser,
13429 cp_decl_specifier_seq *decl_specs,
13430 cp_parser_flags flags)
13432 tree type = NULL_TREE;
13435 /* Peek at the next token. */
13436 token = cp_lexer_peek_token (parser->lexer);
13438 /* If we're looking at a keyword, things are easy. */
13439 switch (token->keyword)
13443 decl_specs->explicit_char_p = true;
13444 type = char_type_node;
13447 type = char16_type_node;
13450 type = char32_type_node;
13453 type = wchar_type_node;
13456 type = boolean_type_node;
13460 ++decl_specs->specs[(int) ds_short];
13461 type = short_integer_type_node;
13465 decl_specs->explicit_int_p = true;
13466 type = integer_type_node;
13469 if (!int128_integer_type_node)
13472 decl_specs->explicit_int128_p = true;
13473 type = int128_integer_type_node;
13477 ++decl_specs->specs[(int) ds_long];
13478 type = long_integer_type_node;
13482 ++decl_specs->specs[(int) ds_signed];
13483 type = integer_type_node;
13487 ++decl_specs->specs[(int) ds_unsigned];
13488 type = unsigned_type_node;
13491 type = float_type_node;
13494 type = double_type_node;
13497 type = void_type_node;
13501 maybe_warn_cpp0x (CPP0X_AUTO);
13502 type = make_auto ();
13506 /* Since DR 743, decltype can either be a simple-type-specifier by
13507 itself or begin a nested-name-specifier. Parsing it will replace
13508 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13509 handling below decide what to do. */
13510 cp_parser_decltype (parser);
13511 cp_lexer_set_token_position (parser->lexer, token);
13515 /* Consume the `typeof' token. */
13516 cp_lexer_consume_token (parser->lexer);
13517 /* Parse the operand to `typeof'. */
13518 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
13519 /* If it is not already a TYPE, take its type. */
13520 if (!TYPE_P (type))
13521 type = finish_typeof (type);
13524 cp_parser_set_decl_spec_type (decl_specs, type,
13526 /*type_definition_p=*/false);
13530 case RID_UNDERLYING_TYPE:
13531 type = cp_parser_trait_expr (parser, RID_UNDERLYING_TYPE);
13533 cp_parser_set_decl_spec_type (decl_specs, type,
13535 /*type_definition_p=*/false);
13540 case RID_DIRECT_BASES:
13541 type = cp_parser_trait_expr (parser, token->keyword);
13543 cp_parser_set_decl_spec_type (decl_specs, type,
13545 /*type_definition_p=*/false);
13551 /* If token is an already-parsed decltype not followed by ::,
13552 it's a simple-type-specifier. */
13553 if (token->type == CPP_DECLTYPE
13554 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
13556 type = token->u.value;
13558 cp_parser_set_decl_spec_type (decl_specs, type,
13560 /*type_definition_p=*/false);
13561 cp_lexer_consume_token (parser->lexer);
13565 /* If the type-specifier was for a built-in type, we're done. */
13568 /* Record the type. */
13570 && (token->keyword != RID_SIGNED
13571 && token->keyword != RID_UNSIGNED
13572 && token->keyword != RID_SHORT
13573 && token->keyword != RID_LONG))
13574 cp_parser_set_decl_spec_type (decl_specs,
13577 /*type_definition_p=*/false);
13579 decl_specs->any_specifiers_p = true;
13581 /* Consume the token. */
13582 cp_lexer_consume_token (parser->lexer);
13584 /* There is no valid C++ program where a non-template type is
13585 followed by a "<". That usually indicates that the user thought
13586 that the type was a template. */
13587 cp_parser_check_for_invalid_template_id (parser, type, token->location);
13589 return TYPE_NAME (type);
13592 /* The type-specifier must be a user-defined type. */
13593 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
13598 /* Don't gobble tokens or issue error messages if this is an
13599 optional type-specifier. */
13600 if (flags & CP_PARSER_FLAGS_OPTIONAL)
13601 cp_parser_parse_tentatively (parser);
13603 /* Look for the optional `::' operator. */
13605 = (cp_parser_global_scope_opt (parser,
13606 /*current_scope_valid_p=*/false)
13608 /* Look for the nested-name specifier. */
13610 = (cp_parser_nested_name_specifier_opt (parser,
13611 /*typename_keyword_p=*/false,
13612 /*check_dependency_p=*/true,
13614 /*is_declaration=*/false)
13616 token = cp_lexer_peek_token (parser->lexer);
13617 /* If we have seen a nested-name-specifier, and the next token
13618 is `template', then we are using the template-id production. */
13620 && cp_parser_optional_template_keyword (parser))
13622 /* Look for the template-id. */
13623 type = cp_parser_template_id (parser,
13624 /*template_keyword_p=*/true,
13625 /*check_dependency_p=*/true,
13626 /*is_declaration=*/false);
13627 /* If the template-id did not name a type, we are out of
13629 if (TREE_CODE (type) != TYPE_DECL)
13631 cp_parser_error (parser, "expected template-id for type");
13635 /* Otherwise, look for a type-name. */
13637 type = cp_parser_type_name (parser);
13638 /* Keep track of all name-lookups performed in class scopes. */
13642 && TREE_CODE (type) == TYPE_DECL
13643 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
13644 maybe_note_name_used_in_class (DECL_NAME (type), type);
13645 /* If it didn't work out, we don't have a TYPE. */
13646 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
13647 && !cp_parser_parse_definitely (parser))
13649 if (type && decl_specs)
13650 cp_parser_set_decl_spec_type (decl_specs, type,
13652 /*type_definition_p=*/false);
13655 /* If we didn't get a type-name, issue an error message. */
13656 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
13658 cp_parser_error (parser, "expected type-name");
13659 return error_mark_node;
13662 if (type && type != error_mark_node)
13664 /* See if TYPE is an Objective-C type, and if so, parse and
13665 accept any protocol references following it. Do this before
13666 the cp_parser_check_for_invalid_template_id() call, because
13667 Objective-C types can be followed by '<...>' which would
13668 enclose protocol names rather than template arguments, and so
13669 everything is fine. */
13670 if (c_dialect_objc () && !parser->scope
13671 && (objc_is_id (type) || objc_is_class_name (type)))
13673 tree protos = cp_parser_objc_protocol_refs_opt (parser);
13674 tree qual_type = objc_get_protocol_qualified_type (type, protos);
13676 /* Clobber the "unqualified" type previously entered into
13677 DECL_SPECS with the new, improved protocol-qualified version. */
13679 decl_specs->type = qual_type;
13684 /* There is no valid C++ program where a non-template type is
13685 followed by a "<". That usually indicates that the user
13686 thought that the type was a template. */
13687 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type),
13694 /* Parse a type-name.
13700 simple-template-id [in c++0x]
13708 Returns a TYPE_DECL for the type. */
13711 cp_parser_type_name (cp_parser* parser)
13715 /* We can't know yet whether it is a class-name or not. */
13716 cp_parser_parse_tentatively (parser);
13717 /* Try a class-name. */
13718 type_decl = cp_parser_class_name (parser,
13719 /*typename_keyword_p=*/false,
13720 /*template_keyword_p=*/false,
13722 /*check_dependency_p=*/true,
13723 /*class_head_p=*/false,
13724 /*is_declaration=*/false);
13725 /* If it's not a class-name, keep looking. */
13726 if (!cp_parser_parse_definitely (parser))
13728 if (cxx_dialect < cxx0x)
13729 /* It must be a typedef-name or an enum-name. */
13730 return cp_parser_nonclass_name (parser);
13732 cp_parser_parse_tentatively (parser);
13733 /* It is either a simple-template-id representing an
13734 instantiation of an alias template... */
13735 type_decl = cp_parser_template_id (parser,
13736 /*template_keyword_p=*/false,
13737 /*check_dependency_p=*/false,
13738 /*is_declaration=*/false);
13739 /* Note that this must be an instantiation of an alias template
13740 because [temp.names]/6 says:
13742 A template-id that names an alias template specialization
13745 Whereas [temp.names]/7 says:
13747 A simple-template-id that names a class template
13748 specialization is a class-name. */
13749 if (type_decl != NULL_TREE
13750 && TREE_CODE (type_decl) == TYPE_DECL
13751 && TYPE_DECL_ALIAS_P (type_decl))
13752 gcc_assert (DECL_TEMPLATE_INSTANTIATION (type_decl));
13754 cp_parser_simulate_error (parser);
13756 if (!cp_parser_parse_definitely (parser))
13757 /* ... Or a typedef-name or an enum-name. */
13758 return cp_parser_nonclass_name (parser);
13764 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13772 Returns a TYPE_DECL for the type. */
13775 cp_parser_nonclass_name (cp_parser* parser)
13780 cp_token *token = cp_lexer_peek_token (parser->lexer);
13781 identifier = cp_parser_identifier (parser);
13782 if (identifier == error_mark_node)
13783 return error_mark_node;
13785 /* Look up the type-name. */
13786 type_decl = cp_parser_lookup_name_simple (parser, identifier, token->location);
13788 /* If it is a using decl, use its underlying decl. */
13789 type_decl = strip_using_decl (type_decl);
13791 if (TREE_CODE (type_decl) != TYPE_DECL
13792 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
13794 /* See if this is an Objective-C type. */
13795 tree protos = cp_parser_objc_protocol_refs_opt (parser);
13796 tree type = objc_get_protocol_qualified_type (identifier, protos);
13798 type_decl = TYPE_NAME (type);
13801 /* Issue an error if we did not find a type-name. */
13802 if (TREE_CODE (type_decl) != TYPE_DECL
13803 /* In Objective-C, we have the complication that class names are
13804 normally type names and start declarations (eg, the
13805 "NSObject" in "NSObject *object;"), but can be used in an
13806 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13807 is an expression. So, a classname followed by a dot is not a
13808 valid type-name. */
13809 || (objc_is_class_name (TREE_TYPE (type_decl))
13810 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT))
13812 if (!cp_parser_simulate_error (parser))
13813 cp_parser_name_lookup_error (parser, identifier, type_decl,
13814 NLE_TYPE, token->location);
13815 return error_mark_node;
13817 /* Remember that the name was used in the definition of the
13818 current class so that we can check later to see if the
13819 meaning would have been different after the class was
13820 entirely defined. */
13821 else if (type_decl != error_mark_node
13823 maybe_note_name_used_in_class (identifier, type_decl);
13828 /* Parse an elaborated-type-specifier. Note that the grammar given
13829 here incorporates the resolution to DR68.
13831 elaborated-type-specifier:
13832 class-key :: [opt] nested-name-specifier [opt] identifier
13833 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13834 enum-key :: [opt] nested-name-specifier [opt] identifier
13835 typename :: [opt] nested-name-specifier identifier
13836 typename :: [opt] nested-name-specifier template [opt]
13841 elaborated-type-specifier:
13842 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13843 class-key attributes :: [opt] nested-name-specifier [opt]
13844 template [opt] template-id
13845 enum attributes :: [opt] nested-name-specifier [opt] identifier
13847 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13848 declared `friend'. If IS_DECLARATION is TRUE, then this
13849 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13850 something is being declared.
13852 Returns the TYPE specified. */
13855 cp_parser_elaborated_type_specifier (cp_parser* parser,
13857 bool is_declaration)
13859 enum tag_types tag_type;
13861 tree type = NULL_TREE;
13862 tree attributes = NULL_TREE;
13864 cp_token *token = NULL;
13866 /* See if we're looking at the `enum' keyword. */
13867 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
13869 /* Consume the `enum' token. */
13870 cp_lexer_consume_token (parser->lexer);
13871 /* Remember that it's an enumeration type. */
13872 tag_type = enum_type;
13873 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13874 enums) is used here. */
13875 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
13876 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
13878 pedwarn (input_location, 0, "elaborated-type-specifier "
13879 "for a scoped enum must not use the %<%D%> keyword",
13880 cp_lexer_peek_token (parser->lexer)->u.value);
13881 /* Consume the `struct' or `class' and parse it anyway. */
13882 cp_lexer_consume_token (parser->lexer);
13884 /* Parse the attributes. */
13885 attributes = cp_parser_attributes_opt (parser);
13887 /* Or, it might be `typename'. */
13888 else if (cp_lexer_next_token_is_keyword (parser->lexer,
13891 /* Consume the `typename' token. */
13892 cp_lexer_consume_token (parser->lexer);
13893 /* Remember that it's a `typename' type. */
13894 tag_type = typename_type;
13896 /* Otherwise it must be a class-key. */
13899 tag_type = cp_parser_class_key (parser);
13900 if (tag_type == none_type)
13901 return error_mark_node;
13902 /* Parse the attributes. */
13903 attributes = cp_parser_attributes_opt (parser);
13906 /* Look for the `::' operator. */
13907 globalscope = cp_parser_global_scope_opt (parser,
13908 /*current_scope_valid_p=*/false);
13909 /* Look for the nested-name-specifier. */
13910 if (tag_type == typename_type && !globalscope)
13912 if (!cp_parser_nested_name_specifier (parser,
13913 /*typename_keyword_p=*/true,
13914 /*check_dependency_p=*/true,
13917 return error_mark_node;
13920 /* Even though `typename' is not present, the proposed resolution
13921 to Core Issue 180 says that in `class A<T>::B', `B' should be
13922 considered a type-name, even if `A<T>' is dependent. */
13923 cp_parser_nested_name_specifier_opt (parser,
13924 /*typename_keyword_p=*/true,
13925 /*check_dependency_p=*/true,
13928 /* For everything but enumeration types, consider a template-id.
13929 For an enumeration type, consider only a plain identifier. */
13930 if (tag_type != enum_type)
13932 bool template_p = false;
13935 /* Allow the `template' keyword. */
13936 template_p = cp_parser_optional_template_keyword (parser);
13937 /* If we didn't see `template', we don't know if there's a
13938 template-id or not. */
13940 cp_parser_parse_tentatively (parser);
13941 /* Parse the template-id. */
13942 token = cp_lexer_peek_token (parser->lexer);
13943 decl = cp_parser_template_id (parser, template_p,
13944 /*check_dependency_p=*/true,
13946 /* If we didn't find a template-id, look for an ordinary
13948 if (!template_p && !cp_parser_parse_definitely (parser))
13950 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
13951 in effect, then we must assume that, upon instantiation, the
13952 template will correspond to a class. */
13953 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
13954 && tag_type == typename_type)
13955 type = make_typename_type (parser->scope, decl,
13957 /*complain=*/tf_error);
13958 /* If the `typename' keyword is in effect and DECL is not a type
13959 decl. Then type is non existant. */
13960 else if (tag_type == typename_type && TREE_CODE (decl) != TYPE_DECL)
13963 type = check_elaborated_type_specifier (tag_type, decl,
13964 /*allow_template_p=*/true);
13969 token = cp_lexer_peek_token (parser->lexer);
13970 identifier = cp_parser_identifier (parser);
13972 if (identifier == error_mark_node)
13974 parser->scope = NULL_TREE;
13975 return error_mark_node;
13978 /* For a `typename', we needn't call xref_tag. */
13979 if (tag_type == typename_type
13980 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
13981 return cp_parser_make_typename_type (parser, parser->scope,
13984 /* Look up a qualified name in the usual way. */
13988 tree ambiguous_decls;
13990 decl = cp_parser_lookup_name (parser, identifier,
13992 /*is_template=*/false,
13993 /*is_namespace=*/false,
13994 /*check_dependency=*/true,
13998 /* If the lookup was ambiguous, an error will already have been
14000 if (ambiguous_decls)
14001 return error_mark_node;
14003 /* If we are parsing friend declaration, DECL may be a
14004 TEMPLATE_DECL tree node here. However, we need to check
14005 whether this TEMPLATE_DECL results in valid code. Consider
14006 the following example:
14009 template <class T> class C {};
14012 template <class T> friend class N::C; // #1, valid code
14014 template <class T> class Y {
14015 friend class N::C; // #2, invalid code
14018 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14019 name lookup of `N::C'. We see that friend declaration must
14020 be template for the code to be valid. Note that
14021 processing_template_decl does not work here since it is
14022 always 1 for the above two cases. */
14024 decl = (cp_parser_maybe_treat_template_as_class
14025 (decl, /*tag_name_p=*/is_friend
14026 && parser->num_template_parameter_lists));
14028 if (TREE_CODE (decl) != TYPE_DECL)
14030 cp_parser_diagnose_invalid_type_name (parser,
14034 return error_mark_node;
14037 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
14039 bool allow_template = (parser->num_template_parameter_lists
14040 || DECL_SELF_REFERENCE_P (decl));
14041 type = check_elaborated_type_specifier (tag_type, decl,
14044 if (type == error_mark_node)
14045 return error_mark_node;
14048 /* Forward declarations of nested types, such as
14053 are invalid unless all components preceding the final '::'
14054 are complete. If all enclosing types are complete, these
14055 declarations become merely pointless.
14057 Invalid forward declarations of nested types are errors
14058 caught elsewhere in parsing. Those that are pointless arrive
14061 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
14062 && !is_friend && !processing_explicit_instantiation)
14063 warning (0, "declaration %qD does not declare anything", decl);
14065 type = TREE_TYPE (decl);
14069 /* An elaborated-type-specifier sometimes introduces a new type and
14070 sometimes names an existing type. Normally, the rule is that it
14071 introduces a new type only if there is not an existing type of
14072 the same name already in scope. For example, given:
14075 void f() { struct S s; }
14077 the `struct S' in the body of `f' is the same `struct S' as in
14078 the global scope; the existing definition is used. However, if
14079 there were no global declaration, this would introduce a new
14080 local class named `S'.
14082 An exception to this rule applies to the following code:
14084 namespace N { struct S; }
14086 Here, the elaborated-type-specifier names a new type
14087 unconditionally; even if there is already an `S' in the
14088 containing scope this declaration names a new type.
14089 This exception only applies if the elaborated-type-specifier
14090 forms the complete declaration:
14094 A declaration consisting solely of `class-key identifier ;' is
14095 either a redeclaration of the name in the current scope or a
14096 forward declaration of the identifier as a class name. It
14097 introduces the name into the current scope.
14099 We are in this situation precisely when the next token is a `;'.
14101 An exception to the exception is that a `friend' declaration does
14102 *not* name a new type; i.e., given:
14104 struct S { friend struct T; };
14106 `T' is not a new type in the scope of `S'.
14108 Also, `new struct S' or `sizeof (struct S)' never results in the
14109 definition of a new type; a new type can only be declared in a
14110 declaration context. */
14116 /* Friends have special name lookup rules. */
14117 ts = ts_within_enclosing_non_class;
14118 else if (is_declaration
14119 && cp_lexer_next_token_is (parser->lexer,
14121 /* This is a `class-key identifier ;' */
14127 (parser->num_template_parameter_lists
14128 && (cp_parser_next_token_starts_class_definition_p (parser)
14129 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
14130 /* An unqualified name was used to reference this type, so
14131 there were no qualifying templates. */
14132 if (!cp_parser_check_template_parameters (parser,
14133 /*num_templates=*/0,
14135 /*declarator=*/NULL))
14136 return error_mark_node;
14137 type = xref_tag (tag_type, identifier, ts, template_p);
14141 if (type == error_mark_node)
14142 return error_mark_node;
14144 /* Allow attributes on forward declarations of classes. */
14147 if (TREE_CODE (type) == TYPENAME_TYPE)
14148 warning (OPT_Wattributes,
14149 "attributes ignored on uninstantiated type");
14150 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
14151 && ! processing_explicit_instantiation)
14152 warning (OPT_Wattributes,
14153 "attributes ignored on template instantiation");
14154 else if (is_declaration && cp_parser_declares_only_class_p (parser))
14155 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
14157 warning (OPT_Wattributes,
14158 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
14161 if (tag_type != enum_type)
14163 /* Indicate whether this class was declared as a `class' or as a
14165 if (TREE_CODE (type) == RECORD_TYPE)
14166 CLASSTYPE_DECLARED_CLASS (type) = (tag_type == class_type);
14167 cp_parser_check_class_key (tag_type, type);
14170 /* A "<" cannot follow an elaborated type specifier. If that
14171 happens, the user was probably trying to form a template-id. */
14172 cp_parser_check_for_invalid_template_id (parser, type, token->location);
14177 /* Parse an enum-specifier.
14180 enum-head { enumerator-list [opt] }
14181 enum-head { enumerator-list , } [C++0x]
14184 enum-key identifier [opt] enum-base [opt]
14185 enum-key nested-name-specifier identifier enum-base [opt]
14190 enum struct [C++0x]
14193 : type-specifier-seq
14195 opaque-enum-specifier:
14196 enum-key identifier enum-base [opt] ;
14199 enum-key attributes[opt] identifier [opt] enum-base [opt]
14200 { enumerator-list [opt] }attributes[opt]
14201 enum-key attributes[opt] identifier [opt] enum-base [opt]
14202 { enumerator-list, }attributes[opt] [C++0x]
14204 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14205 if the token stream isn't an enum-specifier after all. */
14208 cp_parser_enum_specifier (cp_parser* parser)
14211 tree type = NULL_TREE;
14213 tree nested_name_specifier = NULL_TREE;
14215 bool scoped_enum_p = false;
14216 bool has_underlying_type = false;
14217 bool nested_being_defined = false;
14218 bool new_value_list = false;
14219 bool is_new_type = false;
14220 bool is_anonymous = false;
14221 tree underlying_type = NULL_TREE;
14222 cp_token *type_start_token = NULL;
14223 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
14225 parser->colon_corrects_to_scope_p = false;
14227 /* Parse tentatively so that we can back up if we don't find a
14229 cp_parser_parse_tentatively (parser);
14231 /* Caller guarantees that the current token is 'enum', an identifier
14232 possibly follows, and the token after that is an opening brace.
14233 If we don't have an identifier, fabricate an anonymous name for
14234 the enumeration being defined. */
14235 cp_lexer_consume_token (parser->lexer);
14237 /* Parse the "class" or "struct", which indicates a scoped
14238 enumeration type in C++0x. */
14239 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
14240 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
14242 if (cxx_dialect < cxx0x)
14243 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS);
14245 /* Consume the `struct' or `class' token. */
14246 cp_lexer_consume_token (parser->lexer);
14248 scoped_enum_p = true;
14251 attributes = cp_parser_attributes_opt (parser);
14253 /* Clear the qualification. */
14254 parser->scope = NULL_TREE;
14255 parser->qualifying_scope = NULL_TREE;
14256 parser->object_scope = NULL_TREE;
14258 /* Figure out in what scope the declaration is being placed. */
14259 prev_scope = current_scope ();
14261 type_start_token = cp_lexer_peek_token (parser->lexer);
14263 push_deferring_access_checks (dk_no_check);
14264 nested_name_specifier
14265 = cp_parser_nested_name_specifier_opt (parser,
14266 /*typename_keyword_p=*/true,
14267 /*check_dependency_p=*/false,
14269 /*is_declaration=*/false);
14271 if (nested_name_specifier)
14275 identifier = cp_parser_identifier (parser);
14276 name = cp_parser_lookup_name (parser, identifier,
14278 /*is_template=*/false,
14279 /*is_namespace=*/false,
14280 /*check_dependency=*/true,
14281 /*ambiguous_decls=*/NULL,
14285 type = TREE_TYPE (name);
14286 if (TREE_CODE (type) == TYPENAME_TYPE)
14288 /* Are template enums allowed in ISO? */
14289 if (template_parm_scope_p ())
14290 pedwarn (type_start_token->location, OPT_pedantic,
14291 "%qD is an enumeration template", name);
14292 /* ignore a typename reference, for it will be solved by name
14298 error_at (type_start_token->location,
14299 "%qD is not an enumerator-name", identifier);
14303 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
14304 identifier = cp_parser_identifier (parser);
14307 identifier = make_anon_name ();
14308 is_anonymous = true;
14311 pop_deferring_access_checks ();
14313 /* Check for the `:' that denotes a specified underlying type in C++0x.
14314 Note that a ':' could also indicate a bitfield width, however. */
14315 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
14317 cp_decl_specifier_seq type_specifiers;
14319 /* Consume the `:'. */
14320 cp_lexer_consume_token (parser->lexer);
14322 /* Parse the type-specifier-seq. */
14323 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
14324 /*is_trailing_return=*/false,
14327 /* At this point this is surely not elaborated type specifier. */
14328 if (!cp_parser_parse_definitely (parser))
14331 if (cxx_dialect < cxx0x)
14332 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS);
14334 has_underlying_type = true;
14336 /* If that didn't work, stop. */
14337 if (type_specifiers.type != error_mark_node)
14339 underlying_type = grokdeclarator (NULL, &type_specifiers, TYPENAME,
14340 /*initialized=*/0, NULL);
14341 if (underlying_type == error_mark_node)
14342 underlying_type = NULL_TREE;
14346 /* Look for the `{' but don't consume it yet. */
14347 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14349 if (cxx_dialect < cxx0x || (!scoped_enum_p && !underlying_type))
14351 cp_parser_error (parser, "expected %<{%>");
14352 if (has_underlying_type)
14358 /* An opaque-enum-specifier must have a ';' here. */
14359 if ((scoped_enum_p || underlying_type)
14360 && cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
14362 cp_parser_error (parser, "expected %<;%> or %<{%>");
14363 if (has_underlying_type)
14371 if (!has_underlying_type && !cp_parser_parse_definitely (parser))
14374 if (nested_name_specifier)
14376 if (CLASS_TYPE_P (nested_name_specifier))
14378 nested_being_defined = TYPE_BEING_DEFINED (nested_name_specifier);
14379 TYPE_BEING_DEFINED (nested_name_specifier) = 1;
14380 push_scope (nested_name_specifier);
14382 else if (TREE_CODE (nested_name_specifier) == NAMESPACE_DECL)
14384 push_nested_namespace (nested_name_specifier);
14388 /* Issue an error message if type-definitions are forbidden here. */
14389 if (!cp_parser_check_type_definition (parser))
14390 type = error_mark_node;
14392 /* Create the new type. We do this before consuming the opening
14393 brace so the enum will be recorded as being on the line of its
14394 tag (or the 'enum' keyword, if there is no tag). */
14395 type = start_enum (identifier, type, underlying_type,
14396 scoped_enum_p, &is_new_type);
14398 /* If the next token is not '{' it is an opaque-enum-specifier or an
14399 elaborated-type-specifier. */
14400 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14402 timevar_push (TV_PARSE_ENUM);
14403 if (nested_name_specifier)
14405 /* The following catches invalid code such as:
14406 enum class S<int>::E { A, B, C }; */
14407 if (!processing_specialization
14408 && CLASS_TYPE_P (nested_name_specifier)
14409 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier))
14410 error_at (type_start_token->location, "cannot add an enumerator "
14411 "list to a template instantiation");
14413 /* If that scope does not contain the scope in which the
14414 class was originally declared, the program is invalid. */
14415 if (prev_scope && !is_ancestor (prev_scope, nested_name_specifier))
14417 if (at_namespace_scope_p ())
14418 error_at (type_start_token->location,
14419 "declaration of %qD in namespace %qD which does not "
14421 type, prev_scope, nested_name_specifier);
14423 error_at (type_start_token->location,
14424 "declaration of %qD in %qD which does not enclose %qD",
14425 type, prev_scope, nested_name_specifier);
14426 type = error_mark_node;
14431 begin_scope (sk_scoped_enum, type);
14433 /* Consume the opening brace. */
14434 cp_lexer_consume_token (parser->lexer);
14436 if (type == error_mark_node)
14437 ; /* Nothing to add */
14438 else if (OPAQUE_ENUM_P (type)
14439 || (cxx_dialect > cxx98 && processing_specialization))
14441 new_value_list = true;
14442 SET_OPAQUE_ENUM_P (type, false);
14443 DECL_SOURCE_LOCATION (TYPE_NAME (type)) = type_start_token->location;
14447 error_at (type_start_token->location, "multiple definition of %q#T", type);
14448 error_at (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type)),
14449 "previous definition here");
14450 type = error_mark_node;
14453 if (type == error_mark_node)
14454 cp_parser_skip_to_end_of_block_or_statement (parser);
14455 /* If the next token is not '}', then there are some enumerators. */
14456 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
14457 cp_parser_enumerator_list (parser, type);
14459 /* Consume the final '}'. */
14460 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
14464 timevar_pop (TV_PARSE_ENUM);
14468 /* If a ';' follows, then it is an opaque-enum-specifier
14469 and additional restrictions apply. */
14470 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14473 error_at (type_start_token->location,
14474 "opaque-enum-specifier without name");
14475 else if (nested_name_specifier)
14476 error_at (type_start_token->location,
14477 "opaque-enum-specifier must use a simple identifier");
14481 /* Look for trailing attributes to apply to this enumeration, and
14482 apply them if appropriate. */
14483 if (cp_parser_allow_gnu_extensions_p (parser))
14485 tree trailing_attr = cp_parser_attributes_opt (parser);
14486 trailing_attr = chainon (trailing_attr, attributes);
14487 cplus_decl_attributes (&type,
14489 (int) ATTR_FLAG_TYPE_IN_PLACE);
14492 /* Finish up the enumeration. */
14493 if (type != error_mark_node)
14495 if (new_value_list)
14496 finish_enum_value_list (type);
14498 finish_enum (type);
14501 if (nested_name_specifier)
14503 if (CLASS_TYPE_P (nested_name_specifier))
14505 TYPE_BEING_DEFINED (nested_name_specifier) = nested_being_defined;
14506 pop_scope (nested_name_specifier);
14508 else if (TREE_CODE (nested_name_specifier) == NAMESPACE_DECL)
14510 pop_nested_namespace (nested_name_specifier);
14514 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
14518 /* Parse an enumerator-list. The enumerators all have the indicated
14522 enumerator-definition
14523 enumerator-list , enumerator-definition */
14526 cp_parser_enumerator_list (cp_parser* parser, tree type)
14530 /* Parse an enumerator-definition. */
14531 cp_parser_enumerator_definition (parser, type);
14533 /* If the next token is not a ',', we've reached the end of
14535 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14537 /* Otherwise, consume the `,' and keep going. */
14538 cp_lexer_consume_token (parser->lexer);
14539 /* If the next token is a `}', there is a trailing comma. */
14540 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
14542 if (cxx_dialect < cxx0x && !in_system_header)
14543 pedwarn (input_location, OPT_pedantic,
14544 "comma at end of enumerator list");
14550 /* Parse an enumerator-definition. The enumerator has the indicated
14553 enumerator-definition:
14555 enumerator = constant-expression
14561 cp_parser_enumerator_definition (cp_parser* parser, tree type)
14567 /* Save the input location because we are interested in the location
14568 of the identifier and not the location of the explicit value. */
14569 loc = cp_lexer_peek_token (parser->lexer)->location;
14571 /* Look for the identifier. */
14572 identifier = cp_parser_identifier (parser);
14573 if (identifier == error_mark_node)
14576 /* If the next token is an '=', then there is an explicit value. */
14577 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
14579 /* Consume the `=' token. */
14580 cp_lexer_consume_token (parser->lexer);
14581 /* Parse the value. */
14582 value = cp_parser_constant_expression (parser,
14583 /*allow_non_constant_p=*/false,
14589 /* If we are processing a template, make sure the initializer of the
14590 enumerator doesn't contain any bare template parameter pack. */
14591 if (check_for_bare_parameter_packs (value))
14592 value = error_mark_node;
14594 /* integral_constant_value will pull out this expression, so make sure
14595 it's folded as appropriate. */
14596 value = fold_non_dependent_expr (value);
14598 /* Create the enumerator. */
14599 build_enumerator (identifier, value, type, loc);
14602 /* Parse a namespace-name.
14605 original-namespace-name
14608 Returns the NAMESPACE_DECL for the namespace. */
14611 cp_parser_namespace_name (cp_parser* parser)
14614 tree namespace_decl;
14616 cp_token *token = cp_lexer_peek_token (parser->lexer);
14618 /* Get the name of the namespace. */
14619 identifier = cp_parser_identifier (parser);
14620 if (identifier == error_mark_node)
14621 return error_mark_node;
14623 /* Look up the identifier in the currently active scope. Look only
14624 for namespaces, due to:
14626 [basic.lookup.udir]
14628 When looking up a namespace-name in a using-directive or alias
14629 definition, only namespace names are considered.
14633 [basic.lookup.qual]
14635 During the lookup of a name preceding the :: scope resolution
14636 operator, object, function, and enumerator names are ignored.
14638 (Note that cp_parser_qualifying_entity only calls this
14639 function if the token after the name is the scope resolution
14641 namespace_decl = cp_parser_lookup_name (parser, identifier,
14643 /*is_template=*/false,
14644 /*is_namespace=*/true,
14645 /*check_dependency=*/true,
14646 /*ambiguous_decls=*/NULL,
14648 /* If it's not a namespace, issue an error. */
14649 if (namespace_decl == error_mark_node
14650 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
14652 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
14653 error_at (token->location, "%qD is not a namespace-name", identifier);
14654 cp_parser_error (parser, "expected namespace-name");
14655 namespace_decl = error_mark_node;
14658 return namespace_decl;
14661 /* Parse a namespace-definition.
14663 namespace-definition:
14664 named-namespace-definition
14665 unnamed-namespace-definition
14667 named-namespace-definition:
14668 original-namespace-definition
14669 extension-namespace-definition
14671 original-namespace-definition:
14672 namespace identifier { namespace-body }
14674 extension-namespace-definition:
14675 namespace original-namespace-name { namespace-body }
14677 unnamed-namespace-definition:
14678 namespace { namespace-body } */
14681 cp_parser_namespace_definition (cp_parser* parser)
14683 tree identifier, attribs;
14684 bool has_visibility;
14687 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_INLINE))
14689 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES);
14691 cp_lexer_consume_token (parser->lexer);
14696 /* Look for the `namespace' keyword. */
14697 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
14699 /* Get the name of the namespace. We do not attempt to distinguish
14700 between an original-namespace-definition and an
14701 extension-namespace-definition at this point. The semantic
14702 analysis routines are responsible for that. */
14703 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
14704 identifier = cp_parser_identifier (parser);
14706 identifier = NULL_TREE;
14708 /* Parse any specified attributes. */
14709 attribs = cp_parser_attributes_opt (parser);
14711 /* Look for the `{' to start the namespace. */
14712 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
14713 /* Start the namespace. */
14714 push_namespace (identifier);
14716 /* "inline namespace" is equivalent to a stub namespace definition
14717 followed by a strong using directive. */
14720 tree name_space = current_namespace;
14721 /* Set up namespace association. */
14722 DECL_NAMESPACE_ASSOCIATIONS (name_space)
14723 = tree_cons (CP_DECL_CONTEXT (name_space), NULL_TREE,
14724 DECL_NAMESPACE_ASSOCIATIONS (name_space));
14725 /* Import the contents of the inline namespace. */
14727 do_using_directive (name_space);
14728 push_namespace (identifier);
14731 has_visibility = handle_namespace_attrs (current_namespace, attribs);
14733 /* Parse the body of the namespace. */
14734 cp_parser_namespace_body (parser);
14736 if (has_visibility)
14737 pop_visibility (1);
14739 /* Finish the namespace. */
14741 /* Look for the final `}'. */
14742 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
14745 /* Parse a namespace-body.
14748 declaration-seq [opt] */
14751 cp_parser_namespace_body (cp_parser* parser)
14753 cp_parser_declaration_seq_opt (parser);
14756 /* Parse a namespace-alias-definition.
14758 namespace-alias-definition:
14759 namespace identifier = qualified-namespace-specifier ; */
14762 cp_parser_namespace_alias_definition (cp_parser* parser)
14765 tree namespace_specifier;
14767 cp_token *token = cp_lexer_peek_token (parser->lexer);
14769 /* Look for the `namespace' keyword. */
14770 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
14771 /* Look for the identifier. */
14772 identifier = cp_parser_identifier (parser);
14773 if (identifier == error_mark_node)
14775 /* Look for the `=' token. */
14776 if (!cp_parser_uncommitted_to_tentative_parse_p (parser)
14777 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14779 error_at (token->location, "%<namespace%> definition is not allowed here");
14780 /* Skip the definition. */
14781 cp_lexer_consume_token (parser->lexer);
14782 if (cp_parser_skip_to_closing_brace (parser))
14783 cp_lexer_consume_token (parser->lexer);
14786 cp_parser_require (parser, CPP_EQ, RT_EQ);
14787 /* Look for the qualified-namespace-specifier. */
14788 namespace_specifier
14789 = cp_parser_qualified_namespace_specifier (parser);
14790 /* Look for the `;' token. */
14791 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
14793 /* Register the alias in the symbol table. */
14794 do_namespace_alias (identifier, namespace_specifier);
14797 /* Parse a qualified-namespace-specifier.
14799 qualified-namespace-specifier:
14800 :: [opt] nested-name-specifier [opt] namespace-name
14802 Returns a NAMESPACE_DECL corresponding to the specified
14806 cp_parser_qualified_namespace_specifier (cp_parser* parser)
14808 /* Look for the optional `::'. */
14809 cp_parser_global_scope_opt (parser,
14810 /*current_scope_valid_p=*/false);
14812 /* Look for the optional nested-name-specifier. */
14813 cp_parser_nested_name_specifier_opt (parser,
14814 /*typename_keyword_p=*/false,
14815 /*check_dependency_p=*/true,
14817 /*is_declaration=*/true);
14819 return cp_parser_namespace_name (parser);
14822 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14823 access declaration.
14826 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14827 using :: unqualified-id ;
14829 access-declaration:
14835 cp_parser_using_declaration (cp_parser* parser,
14836 bool access_declaration_p)
14839 bool typename_p = false;
14840 bool global_scope_p;
14845 if (access_declaration_p)
14846 cp_parser_parse_tentatively (parser);
14849 /* Look for the `using' keyword. */
14850 cp_parser_require_keyword (parser, RID_USING, RT_USING);
14852 /* Peek at the next token. */
14853 token = cp_lexer_peek_token (parser->lexer);
14854 /* See if it's `typename'. */
14855 if (token->keyword == RID_TYPENAME)
14857 /* Remember that we've seen it. */
14859 /* Consume the `typename' token. */
14860 cp_lexer_consume_token (parser->lexer);
14864 /* Look for the optional global scope qualification. */
14866 = (cp_parser_global_scope_opt (parser,
14867 /*current_scope_valid_p=*/false)
14870 /* If we saw `typename', or didn't see `::', then there must be a
14871 nested-name-specifier present. */
14872 if (typename_p || !global_scope_p)
14873 qscope = cp_parser_nested_name_specifier (parser, typename_p,
14874 /*check_dependency_p=*/true,
14876 /*is_declaration=*/true);
14877 /* Otherwise, we could be in either of the two productions. In that
14878 case, treat the nested-name-specifier as optional. */
14880 qscope = cp_parser_nested_name_specifier_opt (parser,
14881 /*typename_keyword_p=*/false,
14882 /*check_dependency_p=*/true,
14884 /*is_declaration=*/true);
14886 qscope = global_namespace;
14888 if (access_declaration_p && cp_parser_error_occurred (parser))
14889 /* Something has already gone wrong; there's no need to parse
14890 further. Since an error has occurred, the return value of
14891 cp_parser_parse_definitely will be false, as required. */
14892 return cp_parser_parse_definitely (parser);
14894 token = cp_lexer_peek_token (parser->lexer);
14895 /* Parse the unqualified-id. */
14896 identifier = cp_parser_unqualified_id (parser,
14897 /*template_keyword_p=*/false,
14898 /*check_dependency_p=*/true,
14899 /*declarator_p=*/true,
14900 /*optional_p=*/false);
14902 if (access_declaration_p)
14904 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
14905 cp_parser_simulate_error (parser);
14906 if (!cp_parser_parse_definitely (parser))
14910 /* The function we call to handle a using-declaration is different
14911 depending on what scope we are in. */
14912 if (qscope == error_mark_node || identifier == error_mark_node)
14914 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
14915 && TREE_CODE (identifier) != BIT_NOT_EXPR)
14916 /* [namespace.udecl]
14918 A using declaration shall not name a template-id. */
14919 error_at (token->location,
14920 "a template-id may not appear in a using-declaration");
14923 if (at_class_scope_p ())
14925 /* Create the USING_DECL. */
14926 decl = do_class_using_decl (parser->scope, identifier);
14928 if (check_for_bare_parameter_packs (decl))
14931 /* Add it to the list of members in this class. */
14932 finish_member_declaration (decl);
14936 decl = cp_parser_lookup_name_simple (parser,
14939 if (decl == error_mark_node)
14940 cp_parser_name_lookup_error (parser, identifier,
14943 else if (check_for_bare_parameter_packs (decl))
14945 else if (!at_namespace_scope_p ())
14946 do_local_using_decl (decl, qscope, identifier);
14948 do_toplevel_using_decl (decl, qscope, identifier);
14952 /* Look for the final `;'. */
14953 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
14958 /* Parse an alias-declaration.
14961 using identifier attribute-specifier-seq [opt] = type-id */
14964 cp_parser_alias_declaration (cp_parser* parser)
14966 tree id, type, decl, pushed_scope = NULL_TREE, attributes;
14967 location_t id_location;
14968 cp_declarator *declarator;
14969 cp_decl_specifier_seq decl_specs;
14971 const char *saved_message = NULL;
14973 /* Look for the `using' keyword. */
14974 cp_parser_require_keyword (parser, RID_USING, RT_USING);
14975 id_location = cp_lexer_peek_token (parser->lexer)->location;
14976 id = cp_parser_identifier (parser);
14977 attributes = cp_parser_attributes_opt (parser);
14978 cp_parser_require (parser, CPP_EQ, RT_EQ);
14980 /* Now we are going to parse the type-id of the declaration. */
14985 "A type-specifier-seq shall not define a class or enumeration
14986 unless it appears in the type-id of an alias-declaration (7.1.3) that
14987 is not the declaration of a template-declaration."
14989 In other words, if we currently are in an alias template, the
14990 type-id should not define a type.
14992 So let's set parser->type_definition_forbidden_message in that
14993 case; cp_parser_check_type_definition (called by
14994 cp_parser_class_specifier) will then emit an error if a type is
14995 defined in the type-id. */
14996 if (parser->num_template_parameter_lists)
14998 saved_message = parser->type_definition_forbidden_message;
14999 parser->type_definition_forbidden_message =
15000 G_("types may not be defined in alias template declarations");
15003 type = cp_parser_type_id (parser);
15005 /* Restore the error message if need be. */
15006 if (parser->num_template_parameter_lists)
15007 parser->type_definition_forbidden_message = saved_message;
15009 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15011 if (cp_parser_error_occurred (parser))
15012 return error_mark_node;
15014 /* A typedef-name can also be introduced by an alias-declaration. The
15015 identifier following the using keyword becomes a typedef-name. It has
15016 the same semantics as if it were introduced by the typedef
15017 specifier. In particular, it does not define a new type and it shall
15018 not appear in the type-id. */
15020 clear_decl_specs (&decl_specs);
15021 decl_specs.type = type;
15022 decl_specs.attributes = attributes;
15023 ++decl_specs.specs[(int) ds_typedef];
15024 ++decl_specs.specs[(int) ds_alias];
15026 declarator = make_id_declarator (NULL_TREE, id, sfk_none);
15027 declarator->id_loc = id_location;
15029 member_p = at_class_scope_p ();
15031 decl = grokfield (declarator, &decl_specs, NULL_TREE, false,
15032 NULL_TREE, attributes);
15034 decl = start_decl (declarator, &decl_specs, 0,
15035 attributes, NULL_TREE, &pushed_scope);
15036 if (decl == error_mark_node)
15039 cp_finish_decl (decl, NULL_TREE, 0, NULL_TREE, 0);
15042 pop_scope (pushed_scope);
15044 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15045 added into the symbol table; otherwise, return the TYPE_DECL. */
15046 if (DECL_LANG_SPECIFIC (decl)
15047 && DECL_TEMPLATE_INFO (decl)
15048 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)))
15050 decl = DECL_TI_TEMPLATE (decl);
15052 check_member_template (decl);
15058 /* Parse a using-directive.
15061 using namespace :: [opt] nested-name-specifier [opt]
15062 namespace-name ; */
15065 cp_parser_using_directive (cp_parser* parser)
15067 tree namespace_decl;
15070 /* Look for the `using' keyword. */
15071 cp_parser_require_keyword (parser, RID_USING, RT_USING);
15072 /* And the `namespace' keyword. */
15073 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
15074 /* Look for the optional `::' operator. */
15075 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
15076 /* And the optional nested-name-specifier. */
15077 cp_parser_nested_name_specifier_opt (parser,
15078 /*typename_keyword_p=*/false,
15079 /*check_dependency_p=*/true,
15081 /*is_declaration=*/true);
15082 /* Get the namespace being used. */
15083 namespace_decl = cp_parser_namespace_name (parser);
15084 /* And any specified attributes. */
15085 attribs = cp_parser_attributes_opt (parser);
15086 /* Update the symbol table. */
15087 parse_using_directive (namespace_decl, attribs);
15088 /* Look for the final `;'. */
15089 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15092 /* Parse an asm-definition.
15095 asm ( string-literal ) ;
15100 asm volatile [opt] ( string-literal ) ;
15101 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15102 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15103 : asm-operand-list [opt] ) ;
15104 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15105 : asm-operand-list [opt]
15106 : asm-clobber-list [opt] ) ;
15107 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15108 : asm-clobber-list [opt]
15109 : asm-goto-list ) ; */
15112 cp_parser_asm_definition (cp_parser* parser)
15115 tree outputs = NULL_TREE;
15116 tree inputs = NULL_TREE;
15117 tree clobbers = NULL_TREE;
15118 tree labels = NULL_TREE;
15120 bool volatile_p = false;
15121 bool extended_p = false;
15122 bool invalid_inputs_p = false;
15123 bool invalid_outputs_p = false;
15124 bool goto_p = false;
15125 required_token missing = RT_NONE;
15127 /* Look for the `asm' keyword. */
15128 cp_parser_require_keyword (parser, RID_ASM, RT_ASM);
15129 /* See if the next token is `volatile'. */
15130 if (cp_parser_allow_gnu_extensions_p (parser)
15131 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
15133 /* Remember that we saw the `volatile' keyword. */
15135 /* Consume the token. */
15136 cp_lexer_consume_token (parser->lexer);
15138 if (cp_parser_allow_gnu_extensions_p (parser)
15139 && parser->in_function_body
15140 && cp_lexer_next_token_is_keyword (parser->lexer, RID_GOTO))
15142 /* Remember that we saw the `goto' keyword. */
15144 /* Consume the token. */
15145 cp_lexer_consume_token (parser->lexer);
15147 /* Look for the opening `('. */
15148 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
15150 /* Look for the string. */
15151 string = cp_parser_string_literal (parser, false, false);
15152 if (string == error_mark_node)
15154 cp_parser_skip_to_closing_parenthesis (parser, true, false,
15155 /*consume_paren=*/true);
15159 /* If we're allowing GNU extensions, check for the extended assembly
15160 syntax. Unfortunately, the `:' tokens need not be separated by
15161 a space in C, and so, for compatibility, we tolerate that here
15162 too. Doing that means that we have to treat the `::' operator as
15164 if (cp_parser_allow_gnu_extensions_p (parser)
15165 && parser->in_function_body
15166 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
15167 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
15169 bool inputs_p = false;
15170 bool clobbers_p = false;
15171 bool labels_p = false;
15173 /* The extended syntax was used. */
15176 /* Look for outputs. */
15177 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15179 /* Consume the `:'. */
15180 cp_lexer_consume_token (parser->lexer);
15181 /* Parse the output-operands. */
15182 if (cp_lexer_next_token_is_not (parser->lexer,
15184 && cp_lexer_next_token_is_not (parser->lexer,
15186 && cp_lexer_next_token_is_not (parser->lexer,
15189 outputs = cp_parser_asm_operand_list (parser);
15191 if (outputs == error_mark_node)
15192 invalid_outputs_p = true;
15194 /* If the next token is `::', there are no outputs, and the
15195 next token is the beginning of the inputs. */
15196 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
15197 /* The inputs are coming next. */
15200 /* Look for inputs. */
15202 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15204 /* Consume the `:' or `::'. */
15205 cp_lexer_consume_token (parser->lexer);
15206 /* Parse the output-operands. */
15207 if (cp_lexer_next_token_is_not (parser->lexer,
15209 && cp_lexer_next_token_is_not (parser->lexer,
15211 && cp_lexer_next_token_is_not (parser->lexer,
15213 inputs = cp_parser_asm_operand_list (parser);
15215 if (inputs == error_mark_node)
15216 invalid_inputs_p = true;
15218 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
15219 /* The clobbers are coming next. */
15222 /* Look for clobbers. */
15224 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15227 /* Consume the `:' or `::'. */
15228 cp_lexer_consume_token (parser->lexer);
15229 /* Parse the clobbers. */
15230 if (cp_lexer_next_token_is_not (parser->lexer,
15232 && cp_lexer_next_token_is_not (parser->lexer,
15234 clobbers = cp_parser_asm_clobber_list (parser);
15237 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
15238 /* The labels are coming next. */
15241 /* Look for labels. */
15243 || (goto_p && cp_lexer_next_token_is (parser->lexer, CPP_COLON)))
15246 /* Consume the `:' or `::'. */
15247 cp_lexer_consume_token (parser->lexer);
15248 /* Parse the labels. */
15249 labels = cp_parser_asm_label_list (parser);
15252 if (goto_p && !labels_p)
15253 missing = clobbers_p ? RT_COLON : RT_COLON_SCOPE;
15256 missing = RT_COLON_SCOPE;
15258 /* Look for the closing `)'. */
15259 if (!cp_parser_require (parser, missing ? CPP_COLON : CPP_CLOSE_PAREN,
15260 missing ? missing : RT_CLOSE_PAREN))
15261 cp_parser_skip_to_closing_parenthesis (parser, true, false,
15262 /*consume_paren=*/true);
15263 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15265 if (!invalid_inputs_p && !invalid_outputs_p)
15267 /* Create the ASM_EXPR. */
15268 if (parser->in_function_body)
15270 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
15271 inputs, clobbers, labels);
15272 /* If the extended syntax was not used, mark the ASM_EXPR. */
15275 tree temp = asm_stmt;
15276 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
15277 temp = TREE_OPERAND (temp, 0);
15279 ASM_INPUT_P (temp) = 1;
15283 cgraph_add_asm_node (string);
15287 /* Declarators [gram.dcl.decl] */
15289 /* Parse an init-declarator.
15292 declarator initializer [opt]
15297 declarator asm-specification [opt] attributes [opt] initializer [opt]
15299 function-definition:
15300 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15302 decl-specifier-seq [opt] declarator function-try-block
15306 function-definition:
15307 __extension__ function-definition
15311 function-definition:
15312 decl-specifier-seq [opt] declarator function-transaction-block
15314 The DECL_SPECIFIERS apply to this declarator. Returns a
15315 representation of the entity declared. If MEMBER_P is TRUE, then
15316 this declarator appears in a class scope. The new DECL created by
15317 this declarator is returned.
15319 The CHECKS are access checks that should be performed once we know
15320 what entity is being declared (and, therefore, what classes have
15323 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15324 for a function-definition here as well. If the declarator is a
15325 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15326 be TRUE upon return. By that point, the function-definition will
15327 have been completely parsed.
15329 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15332 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15333 parsed declaration if it is an uninitialized single declarator not followed
15334 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15335 if present, will not be consumed. If returned, this declarator will be
15336 created with SD_INITIALIZED but will not call cp_finish_decl. */
15339 cp_parser_init_declarator (cp_parser* parser,
15340 cp_decl_specifier_seq *decl_specifiers,
15341 VEC (deferred_access_check,gc)* checks,
15342 bool function_definition_allowed_p,
15344 int declares_class_or_enum,
15345 bool* function_definition_p,
15346 tree* maybe_range_for_decl)
15348 cp_token *token = NULL, *asm_spec_start_token = NULL,
15349 *attributes_start_token = NULL;
15350 cp_declarator *declarator;
15351 tree prefix_attributes;
15353 tree asm_specification;
15355 tree decl = NULL_TREE;
15357 int is_initialized;
15358 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15359 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15361 enum cpp_ttype initialization_kind;
15362 bool is_direct_init = false;
15363 bool is_non_constant_init;
15364 int ctor_dtor_or_conv_p;
15366 tree pushed_scope = NULL_TREE;
15367 bool range_for_decl_p = false;
15369 /* Gather the attributes that were provided with the
15370 decl-specifiers. */
15371 prefix_attributes = decl_specifiers->attributes;
15373 /* Assume that this is not the declarator for a function
15375 if (function_definition_p)
15376 *function_definition_p = false;
15378 /* Defer access checks while parsing the declarator; we cannot know
15379 what names are accessible until we know what is being
15381 resume_deferring_access_checks ();
15383 /* Parse the declarator. */
15384 token = cp_lexer_peek_token (parser->lexer);
15386 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
15387 &ctor_dtor_or_conv_p,
15388 /*parenthesized_p=*/NULL,
15390 /* Gather up the deferred checks. */
15391 stop_deferring_access_checks ();
15393 /* If the DECLARATOR was erroneous, there's no need to go
15395 if (declarator == cp_error_declarator)
15396 return error_mark_node;
15398 /* Check that the number of template-parameter-lists is OK. */
15399 if (!cp_parser_check_declarator_template_parameters (parser, declarator,
15401 return error_mark_node;
15403 if (declares_class_or_enum & 2)
15404 cp_parser_check_for_definition_in_return_type (declarator,
15405 decl_specifiers->type,
15406 decl_specifiers->type_location);
15408 /* Figure out what scope the entity declared by the DECLARATOR is
15409 located in. `grokdeclarator' sometimes changes the scope, so
15410 we compute it now. */
15411 scope = get_scope_of_declarator (declarator);
15413 /* Perform any lookups in the declared type which were thought to be
15414 dependent, but are not in the scope of the declarator. */
15415 decl_specifiers->type
15416 = maybe_update_decl_type (decl_specifiers->type, scope);
15418 /* If we're allowing GNU extensions, look for an asm-specification
15420 if (cp_parser_allow_gnu_extensions_p (parser))
15422 /* Look for an asm-specification. */
15423 asm_spec_start_token = cp_lexer_peek_token (parser->lexer);
15424 asm_specification = cp_parser_asm_specification_opt (parser);
15425 /* And attributes. */
15426 attributes_start_token = cp_lexer_peek_token (parser->lexer);
15427 attributes = cp_parser_attributes_opt (parser);
15431 asm_specification = NULL_TREE;
15432 attributes = NULL_TREE;
15435 /* Peek at the next token. */
15436 token = cp_lexer_peek_token (parser->lexer);
15437 /* Check to see if the token indicates the start of a
15438 function-definition. */
15439 if (function_declarator_p (declarator)
15440 && cp_parser_token_starts_function_definition_p (token))
15442 if (!function_definition_allowed_p)
15444 /* If a function-definition should not appear here, issue an
15446 cp_parser_error (parser,
15447 "a function-definition is not allowed here");
15448 return error_mark_node;
15452 location_t func_brace_location
15453 = cp_lexer_peek_token (parser->lexer)->location;
15455 /* Neither attributes nor an asm-specification are allowed
15456 on a function-definition. */
15457 if (asm_specification)
15458 error_at (asm_spec_start_token->location,
15459 "an asm-specification is not allowed "
15460 "on a function-definition");
15462 error_at (attributes_start_token->location,
15463 "attributes are not allowed on a function-definition");
15464 /* This is a function-definition. */
15465 *function_definition_p = true;
15467 /* Parse the function definition. */
15469 decl = cp_parser_save_member_function_body (parser,
15472 prefix_attributes);
15475 = (cp_parser_function_definition_from_specifiers_and_declarator
15476 (parser, decl_specifiers, prefix_attributes, declarator));
15478 if (decl != error_mark_node && DECL_STRUCT_FUNCTION (decl))
15480 /* This is where the prologue starts... */
15481 DECL_STRUCT_FUNCTION (decl)->function_start_locus
15482 = func_brace_location;
15491 Only in function declarations for constructors, destructors, and
15492 type conversions can the decl-specifier-seq be omitted.
15494 We explicitly postpone this check past the point where we handle
15495 function-definitions because we tolerate function-definitions
15496 that are missing their return types in some modes. */
15497 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
15499 cp_parser_error (parser,
15500 "expected constructor, destructor, or type conversion");
15501 return error_mark_node;
15504 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15505 if (token->type == CPP_EQ
15506 || token->type == CPP_OPEN_PAREN
15507 || token->type == CPP_OPEN_BRACE)
15509 is_initialized = SD_INITIALIZED;
15510 initialization_kind = token->type;
15511 if (maybe_range_for_decl)
15512 *maybe_range_for_decl = error_mark_node;
15514 if (token->type == CPP_EQ
15515 && function_declarator_p (declarator))
15517 cp_token *t2 = cp_lexer_peek_nth_token (parser->lexer, 2);
15518 if (t2->keyword == RID_DEFAULT)
15519 is_initialized = SD_DEFAULTED;
15520 else if (t2->keyword == RID_DELETE)
15521 is_initialized = SD_DELETED;
15526 /* If the init-declarator isn't initialized and isn't followed by a
15527 `,' or `;', it's not a valid init-declarator. */
15528 if (token->type != CPP_COMMA
15529 && token->type != CPP_SEMICOLON)
15531 if (maybe_range_for_decl && *maybe_range_for_decl != error_mark_node)
15532 range_for_decl_p = true;
15535 cp_parser_error (parser, "expected initializer");
15536 return error_mark_node;
15539 is_initialized = SD_UNINITIALIZED;
15540 initialization_kind = CPP_EOF;
15543 /* Because start_decl has side-effects, we should only call it if we
15544 know we're going ahead. By this point, we know that we cannot
15545 possibly be looking at any other construct. */
15546 cp_parser_commit_to_tentative_parse (parser);
15548 /* If the decl specifiers were bad, issue an error now that we're
15549 sure this was intended to be a declarator. Then continue
15550 declaring the variable(s), as int, to try to cut down on further
15552 if (decl_specifiers->any_specifiers_p
15553 && decl_specifiers->type == error_mark_node)
15555 cp_parser_error (parser, "invalid type in declaration");
15556 decl_specifiers->type = integer_type_node;
15559 /* Check to see whether or not this declaration is a friend. */
15560 friend_p = cp_parser_friend_p (decl_specifiers);
15562 /* Enter the newly declared entry in the symbol table. If we're
15563 processing a declaration in a class-specifier, we wait until
15564 after processing the initializer. */
15567 if (parser->in_unbraced_linkage_specification_p)
15568 decl_specifiers->storage_class = sc_extern;
15569 decl = start_decl (declarator, decl_specifiers,
15570 range_for_decl_p? SD_INITIALIZED : is_initialized,
15571 attributes, prefix_attributes,
15573 /* Adjust location of decl if declarator->id_loc is more appropriate:
15574 set, and decl wasn't merged with another decl, in which case its
15575 location would be different from input_location, and more accurate. */
15577 && declarator->id_loc != UNKNOWN_LOCATION
15578 && DECL_SOURCE_LOCATION (decl) == input_location)
15579 DECL_SOURCE_LOCATION (decl) = declarator->id_loc;
15582 /* Enter the SCOPE. That way unqualified names appearing in the
15583 initializer will be looked up in SCOPE. */
15584 pushed_scope = push_scope (scope);
15586 /* Perform deferred access control checks, now that we know in which
15587 SCOPE the declared entity resides. */
15588 if (!member_p && decl)
15590 tree saved_current_function_decl = NULL_TREE;
15592 /* If the entity being declared is a function, pretend that we
15593 are in its scope. If it is a `friend', it may have access to
15594 things that would not otherwise be accessible. */
15595 if (TREE_CODE (decl) == FUNCTION_DECL)
15597 saved_current_function_decl = current_function_decl;
15598 current_function_decl = decl;
15601 /* Perform access checks for template parameters. */
15602 cp_parser_perform_template_parameter_access_checks (checks);
15604 /* Perform the access control checks for the declarator and the
15605 decl-specifiers. */
15606 perform_deferred_access_checks ();
15608 /* Restore the saved value. */
15609 if (TREE_CODE (decl) == FUNCTION_DECL)
15610 current_function_decl = saved_current_function_decl;
15613 /* Parse the initializer. */
15614 initializer = NULL_TREE;
15615 is_direct_init = false;
15616 is_non_constant_init = true;
15617 if (is_initialized)
15619 if (function_declarator_p (declarator))
15621 cp_token *initializer_start_token = cp_lexer_peek_token (parser->lexer);
15622 if (initialization_kind == CPP_EQ)
15623 initializer = cp_parser_pure_specifier (parser);
15626 /* If the declaration was erroneous, we don't really
15627 know what the user intended, so just silently
15628 consume the initializer. */
15629 if (decl != error_mark_node)
15630 error_at (initializer_start_token->location,
15631 "initializer provided for function");
15632 cp_parser_skip_to_closing_parenthesis (parser,
15633 /*recovering=*/true,
15634 /*or_comma=*/false,
15635 /*consume_paren=*/true);
15640 /* We want to record the extra mangling scope for in-class
15641 initializers of class members and initializers of static data
15642 member templates. The former is a C++0x feature which isn't
15643 implemented yet, and I expect it will involve deferring
15644 parsing of the initializer until end of class as with default
15645 arguments. So right here we only handle the latter. */
15646 if (!member_p && processing_template_decl)
15647 start_lambda_scope (decl);
15648 initializer = cp_parser_initializer (parser,
15650 &is_non_constant_init);
15651 if (!member_p && processing_template_decl)
15652 finish_lambda_scope ();
15656 /* The old parser allows attributes to appear after a parenthesized
15657 initializer. Mark Mitchell proposed removing this functionality
15658 on the GCC mailing lists on 2002-08-13. This parser accepts the
15659 attributes -- but ignores them. */
15660 if (cp_parser_allow_gnu_extensions_p (parser)
15661 && initialization_kind == CPP_OPEN_PAREN)
15662 if (cp_parser_attributes_opt (parser))
15663 warning (OPT_Wattributes,
15664 "attributes after parenthesized initializer ignored");
15666 /* For an in-class declaration, use `grokfield' to create the
15672 pop_scope (pushed_scope);
15673 pushed_scope = NULL_TREE;
15675 decl = grokfield (declarator, decl_specifiers,
15676 initializer, !is_non_constant_init,
15677 /*asmspec=*/NULL_TREE,
15678 prefix_attributes);
15679 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
15680 cp_parser_save_default_args (parser, decl);
15683 /* Finish processing the declaration. But, skip member
15685 if (!member_p && decl && decl != error_mark_node && !range_for_decl_p)
15687 cp_finish_decl (decl,
15688 initializer, !is_non_constant_init,
15690 /* If the initializer is in parentheses, then this is
15691 a direct-initialization, which means that an
15692 `explicit' constructor is OK. Otherwise, an
15693 `explicit' constructor cannot be used. */
15694 ((is_direct_init || !is_initialized)
15695 ? LOOKUP_NORMAL : LOOKUP_IMPLICIT));
15697 else if ((cxx_dialect != cxx98) && friend_p
15698 && decl && TREE_CODE (decl) == FUNCTION_DECL)
15699 /* Core issue #226 (C++0x only): A default template-argument
15700 shall not be specified in a friend class template
15702 check_default_tmpl_args (decl, current_template_parms, /*is_primary=*/1,
15703 /*is_partial=*/0, /*is_friend_decl=*/1);
15705 if (!friend_p && pushed_scope)
15706 pop_scope (pushed_scope);
15711 /* Parse a declarator.
15715 ptr-operator declarator
15717 abstract-declarator:
15718 ptr-operator abstract-declarator [opt]
15719 direct-abstract-declarator
15724 attributes [opt] direct-declarator
15725 attributes [opt] ptr-operator declarator
15727 abstract-declarator:
15728 attributes [opt] ptr-operator abstract-declarator [opt]
15729 attributes [opt] direct-abstract-declarator
15731 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15732 detect constructor, destructor or conversion operators. It is set
15733 to -1 if the declarator is a name, and +1 if it is a
15734 function. Otherwise it is set to zero. Usually you just want to
15735 test for >0, but internally the negative value is used.
15737 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15738 a decl-specifier-seq unless it declares a constructor, destructor,
15739 or conversion. It might seem that we could check this condition in
15740 semantic analysis, rather than parsing, but that makes it difficult
15741 to handle something like `f()'. We want to notice that there are
15742 no decl-specifiers, and therefore realize that this is an
15743 expression, not a declaration.)
15745 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15746 the declarator is a direct-declarator of the form "(...)".
15748 MEMBER_P is true iff this declarator is a member-declarator. */
15750 static cp_declarator *
15751 cp_parser_declarator (cp_parser* parser,
15752 cp_parser_declarator_kind dcl_kind,
15753 int* ctor_dtor_or_conv_p,
15754 bool* parenthesized_p,
15757 cp_declarator *declarator;
15758 enum tree_code code;
15759 cp_cv_quals cv_quals;
15761 tree attributes = NULL_TREE;
15763 /* Assume this is not a constructor, destructor, or type-conversion
15765 if (ctor_dtor_or_conv_p)
15766 *ctor_dtor_or_conv_p = 0;
15768 if (cp_parser_allow_gnu_extensions_p (parser))
15769 attributes = cp_parser_attributes_opt (parser);
15771 /* Check for the ptr-operator production. */
15772 cp_parser_parse_tentatively (parser);
15773 /* Parse the ptr-operator. */
15774 code = cp_parser_ptr_operator (parser,
15777 /* If that worked, then we have a ptr-operator. */
15778 if (cp_parser_parse_definitely (parser))
15780 /* If a ptr-operator was found, then this declarator was not
15782 if (parenthesized_p)
15783 *parenthesized_p = true;
15784 /* The dependent declarator is optional if we are parsing an
15785 abstract-declarator. */
15786 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
15787 cp_parser_parse_tentatively (parser);
15789 /* Parse the dependent declarator. */
15790 declarator = cp_parser_declarator (parser, dcl_kind,
15791 /*ctor_dtor_or_conv_p=*/NULL,
15792 /*parenthesized_p=*/NULL,
15793 /*member_p=*/false);
15795 /* If we are parsing an abstract-declarator, we must handle the
15796 case where the dependent declarator is absent. */
15797 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
15798 && !cp_parser_parse_definitely (parser))
15801 declarator = cp_parser_make_indirect_declarator
15802 (code, class_type, cv_quals, declarator);
15804 /* Everything else is a direct-declarator. */
15807 if (parenthesized_p)
15808 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
15810 declarator = cp_parser_direct_declarator (parser, dcl_kind,
15811 ctor_dtor_or_conv_p,
15815 if (attributes && declarator && declarator != cp_error_declarator)
15816 declarator->attributes = attributes;
15821 /* Parse a direct-declarator or direct-abstract-declarator.
15825 direct-declarator ( parameter-declaration-clause )
15826 cv-qualifier-seq [opt]
15827 exception-specification [opt]
15828 direct-declarator [ constant-expression [opt] ]
15831 direct-abstract-declarator:
15832 direct-abstract-declarator [opt]
15833 ( parameter-declaration-clause )
15834 cv-qualifier-seq [opt]
15835 exception-specification [opt]
15836 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15837 ( abstract-declarator )
15839 Returns a representation of the declarator. DCL_KIND is
15840 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15841 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15842 we are parsing a direct-declarator. It is
15843 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15844 of ambiguity we prefer an abstract declarator, as per
15845 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15846 cp_parser_declarator. */
15848 static cp_declarator *
15849 cp_parser_direct_declarator (cp_parser* parser,
15850 cp_parser_declarator_kind dcl_kind,
15851 int* ctor_dtor_or_conv_p,
15855 cp_declarator *declarator = NULL;
15856 tree scope = NULL_TREE;
15857 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
15858 bool saved_in_declarator_p = parser->in_declarator_p;
15860 tree pushed_scope = NULL_TREE;
15864 /* Peek at the next token. */
15865 token = cp_lexer_peek_token (parser->lexer);
15866 if (token->type == CPP_OPEN_PAREN)
15868 /* This is either a parameter-declaration-clause, or a
15869 parenthesized declarator. When we know we are parsing a
15870 named declarator, it must be a parenthesized declarator
15871 if FIRST is true. For instance, `(int)' is a
15872 parameter-declaration-clause, with an omitted
15873 direct-abstract-declarator. But `((*))', is a
15874 parenthesized abstract declarator. Finally, when T is a
15875 template parameter `(T)' is a
15876 parameter-declaration-clause, and not a parenthesized
15879 We first try and parse a parameter-declaration-clause,
15880 and then try a nested declarator (if FIRST is true).
15882 It is not an error for it not to be a
15883 parameter-declaration-clause, even when FIRST is
15889 The first is the declaration of a function while the
15890 second is the definition of a variable, including its
15893 Having seen only the parenthesis, we cannot know which of
15894 these two alternatives should be selected. Even more
15895 complex are examples like:
15900 The former is a function-declaration; the latter is a
15901 variable initialization.
15903 Thus again, we try a parameter-declaration-clause, and if
15904 that fails, we back out and return. */
15906 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
15909 unsigned saved_num_template_parameter_lists;
15910 bool is_declarator = false;
15913 /* In a member-declarator, the only valid interpretation
15914 of a parenthesis is the start of a
15915 parameter-declaration-clause. (It is invalid to
15916 initialize a static data member with a parenthesized
15917 initializer; only the "=" form of initialization is
15920 cp_parser_parse_tentatively (parser);
15922 /* Consume the `('. */
15923 cp_lexer_consume_token (parser->lexer);
15926 /* If this is going to be an abstract declarator, we're
15927 in a declarator and we can't have default args. */
15928 parser->default_arg_ok_p = false;
15929 parser->in_declarator_p = true;
15932 /* Inside the function parameter list, surrounding
15933 template-parameter-lists do not apply. */
15934 saved_num_template_parameter_lists
15935 = parser->num_template_parameter_lists;
15936 parser->num_template_parameter_lists = 0;
15938 begin_scope (sk_function_parms, NULL_TREE);
15940 /* Parse the parameter-declaration-clause. */
15941 params = cp_parser_parameter_declaration_clause (parser);
15943 parser->num_template_parameter_lists
15944 = saved_num_template_parameter_lists;
15946 /* Consume the `)'. */
15947 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
15949 /* If all went well, parse the cv-qualifier-seq and the
15950 exception-specification. */
15951 if (member_p || cp_parser_parse_definitely (parser))
15953 cp_cv_quals cv_quals;
15954 cp_virt_specifiers virt_specifiers;
15955 tree exception_specification;
15958 is_declarator = true;
15960 if (ctor_dtor_or_conv_p)
15961 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
15964 /* Parse the cv-qualifier-seq. */
15965 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
15966 /* And the exception-specification. */
15967 exception_specification
15968 = cp_parser_exception_specification_opt (parser);
15969 /* Parse the virt-specifier-seq. */
15970 virt_specifiers = cp_parser_virt_specifier_seq_opt (parser);
15972 late_return = (cp_parser_late_return_type_opt
15973 (parser, member_p ? cv_quals : -1));
15975 /* Create the function-declarator. */
15976 declarator = make_call_declarator (declarator,
15980 exception_specification,
15982 /* Any subsequent parameter lists are to do with
15983 return type, so are not those of the declared
15985 parser->default_arg_ok_p = false;
15988 /* Remove the function parms from scope. */
15989 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
15990 pop_binding (DECL_NAME (t), t);
15994 /* Repeat the main loop. */
15998 /* If this is the first, we can try a parenthesized
16002 bool saved_in_type_id_in_expr_p;
16004 parser->default_arg_ok_p = saved_default_arg_ok_p;
16005 parser->in_declarator_p = saved_in_declarator_p;
16007 /* Consume the `('. */
16008 cp_lexer_consume_token (parser->lexer);
16009 /* Parse the nested declarator. */
16010 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
16011 parser->in_type_id_in_expr_p = true;
16013 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
16014 /*parenthesized_p=*/NULL,
16016 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
16018 /* Expect a `)'. */
16019 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
16020 declarator = cp_error_declarator;
16021 if (declarator == cp_error_declarator)
16024 goto handle_declarator;
16026 /* Otherwise, we must be done. */
16030 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
16031 && token->type == CPP_OPEN_SQUARE)
16033 /* Parse an array-declarator. */
16036 if (ctor_dtor_or_conv_p)
16037 *ctor_dtor_or_conv_p = 0;
16040 parser->default_arg_ok_p = false;
16041 parser->in_declarator_p = true;
16042 /* Consume the `['. */
16043 cp_lexer_consume_token (parser->lexer);
16044 /* Peek at the next token. */
16045 token = cp_lexer_peek_token (parser->lexer);
16046 /* If the next token is `]', then there is no
16047 constant-expression. */
16048 if (token->type != CPP_CLOSE_SQUARE)
16050 bool non_constant_p;
16053 = cp_parser_constant_expression (parser,
16054 /*allow_non_constant=*/true,
16056 if (!non_constant_p)
16058 else if (error_operand_p (bounds))
16059 /* Already gave an error. */;
16060 else if (!parser->in_function_body
16061 || current_binding_level->kind == sk_function_parms)
16063 /* Normally, the array bound must be an integral constant
16064 expression. However, as an extension, we allow VLAs
16065 in function scopes as long as they aren't part of a
16066 parameter declaration. */
16067 cp_parser_error (parser,
16068 "array bound is not an integer constant");
16069 bounds = error_mark_node;
16071 else if (processing_template_decl)
16073 /* Remember this wasn't a constant-expression. */
16074 bounds = build_nop (TREE_TYPE (bounds), bounds);
16075 TREE_SIDE_EFFECTS (bounds) = 1;
16079 bounds = NULL_TREE;
16080 /* Look for the closing `]'. */
16081 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE))
16083 declarator = cp_error_declarator;
16087 declarator = make_array_declarator (declarator, bounds);
16089 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
16092 tree qualifying_scope;
16093 tree unqualified_name;
16094 special_function_kind sfk;
16096 bool pack_expansion_p = false;
16097 cp_token *declarator_id_start_token;
16099 /* Parse a declarator-id */
16100 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
16103 cp_parser_parse_tentatively (parser);
16105 /* If we see an ellipsis, we should be looking at a
16107 if (token->type == CPP_ELLIPSIS)
16109 /* Consume the `...' */
16110 cp_lexer_consume_token (parser->lexer);
16112 pack_expansion_p = true;
16116 declarator_id_start_token = cp_lexer_peek_token (parser->lexer);
16118 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
16119 qualifying_scope = parser->scope;
16124 if (!unqualified_name && pack_expansion_p)
16126 /* Check whether an error occurred. */
16127 okay = !cp_parser_error_occurred (parser);
16129 /* We already consumed the ellipsis to mark a
16130 parameter pack, but we have no way to report it,
16131 so abort the tentative parse. We will be exiting
16132 immediately anyway. */
16133 cp_parser_abort_tentative_parse (parser);
16136 okay = cp_parser_parse_definitely (parser);
16139 unqualified_name = error_mark_node;
16140 else if (unqualified_name
16141 && (qualifying_scope
16142 || (TREE_CODE (unqualified_name)
16143 != IDENTIFIER_NODE)))
16145 cp_parser_error (parser, "expected unqualified-id");
16146 unqualified_name = error_mark_node;
16150 if (!unqualified_name)
16152 if (unqualified_name == error_mark_node)
16154 declarator = cp_error_declarator;
16155 pack_expansion_p = false;
16156 declarator->parameter_pack_p = false;
16160 if (qualifying_scope && at_namespace_scope_p ()
16161 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
16163 /* In the declaration of a member of a template class
16164 outside of the class itself, the SCOPE will sometimes
16165 be a TYPENAME_TYPE. For example, given:
16167 template <typename T>
16168 int S<T>::R::i = 3;
16170 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16171 this context, we must resolve S<T>::R to an ordinary
16172 type, rather than a typename type.
16174 The reason we normally avoid resolving TYPENAME_TYPEs
16175 is that a specialization of `S' might render
16176 `S<T>::R' not a type. However, if `S' is
16177 specialized, then this `i' will not be used, so there
16178 is no harm in resolving the types here. */
16181 /* Resolve the TYPENAME_TYPE. */
16182 type = resolve_typename_type (qualifying_scope,
16183 /*only_current_p=*/false);
16184 /* If that failed, the declarator is invalid. */
16185 if (TREE_CODE (type) == TYPENAME_TYPE)
16187 if (typedef_variant_p (type))
16188 error_at (declarator_id_start_token->location,
16189 "cannot define member of dependent typedef "
16192 error_at (declarator_id_start_token->location,
16193 "%<%T::%E%> is not a type",
16194 TYPE_CONTEXT (qualifying_scope),
16195 TYPE_IDENTIFIER (qualifying_scope));
16197 qualifying_scope = type;
16202 if (unqualified_name)
16206 if (qualifying_scope
16207 && CLASS_TYPE_P (qualifying_scope))
16208 class_type = qualifying_scope;
16210 class_type = current_class_type;
16212 if (TREE_CODE (unqualified_name) == TYPE_DECL)
16214 tree name_type = TREE_TYPE (unqualified_name);
16215 if (class_type && same_type_p (name_type, class_type))
16217 if (qualifying_scope
16218 && CLASSTYPE_USE_TEMPLATE (name_type))
16220 error_at (declarator_id_start_token->location,
16221 "invalid use of constructor as a template");
16222 inform (declarator_id_start_token->location,
16223 "use %<%T::%D%> instead of %<%T::%D%> to "
16224 "name the constructor in a qualified name",
16226 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
16227 class_type, name_type);
16228 declarator = cp_error_declarator;
16232 unqualified_name = constructor_name (class_type);
16236 /* We do not attempt to print the declarator
16237 here because we do not have enough
16238 information about its original syntactic
16240 cp_parser_error (parser, "invalid declarator");
16241 declarator = cp_error_declarator;
16248 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
16249 sfk = sfk_destructor;
16250 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
16251 sfk = sfk_conversion;
16252 else if (/* There's no way to declare a constructor
16253 for an anonymous type, even if the type
16254 got a name for linkage purposes. */
16255 !TYPE_WAS_ANONYMOUS (class_type)
16256 && constructor_name_p (unqualified_name,
16259 unqualified_name = constructor_name (class_type);
16260 sfk = sfk_constructor;
16262 else if (is_overloaded_fn (unqualified_name)
16263 && DECL_CONSTRUCTOR_P (get_first_fn
16264 (unqualified_name)))
16265 sfk = sfk_constructor;
16267 if (ctor_dtor_or_conv_p && sfk != sfk_none)
16268 *ctor_dtor_or_conv_p = -1;
16271 declarator = make_id_declarator (qualifying_scope,
16274 declarator->id_loc = token->location;
16275 declarator->parameter_pack_p = pack_expansion_p;
16277 if (pack_expansion_p)
16278 maybe_warn_variadic_templates ();
16281 handle_declarator:;
16282 scope = get_scope_of_declarator (declarator);
16284 /* Any names that appear after the declarator-id for a
16285 member are looked up in the containing scope. */
16286 pushed_scope = push_scope (scope);
16287 parser->in_declarator_p = true;
16288 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
16289 || (declarator && declarator->kind == cdk_id))
16290 /* Default args are only allowed on function
16292 parser->default_arg_ok_p = saved_default_arg_ok_p;
16294 parser->default_arg_ok_p = false;
16303 /* For an abstract declarator, we might wind up with nothing at this
16304 point. That's an error; the declarator is not optional. */
16306 cp_parser_error (parser, "expected declarator");
16308 /* If we entered a scope, we must exit it now. */
16310 pop_scope (pushed_scope);
16312 parser->default_arg_ok_p = saved_default_arg_ok_p;
16313 parser->in_declarator_p = saved_in_declarator_p;
16318 /* Parse a ptr-operator.
16321 * cv-qualifier-seq [opt]
16323 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16328 & cv-qualifier-seq [opt]
16330 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16331 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16332 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16333 filled in with the TYPE containing the member. *CV_QUALS is
16334 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16335 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16336 Note that the tree codes returned by this function have nothing
16337 to do with the types of trees that will be eventually be created
16338 to represent the pointer or reference type being parsed. They are
16339 just constants with suggestive names. */
16340 static enum tree_code
16341 cp_parser_ptr_operator (cp_parser* parser,
16343 cp_cv_quals *cv_quals)
16345 enum tree_code code = ERROR_MARK;
16348 /* Assume that it's not a pointer-to-member. */
16350 /* And that there are no cv-qualifiers. */
16351 *cv_quals = TYPE_UNQUALIFIED;
16353 /* Peek at the next token. */
16354 token = cp_lexer_peek_token (parser->lexer);
16356 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16357 if (token->type == CPP_MULT)
16358 code = INDIRECT_REF;
16359 else if (token->type == CPP_AND)
16361 else if ((cxx_dialect != cxx98) &&
16362 token->type == CPP_AND_AND) /* C++0x only */
16363 code = NON_LVALUE_EXPR;
16365 if (code != ERROR_MARK)
16367 /* Consume the `*', `&' or `&&'. */
16368 cp_lexer_consume_token (parser->lexer);
16370 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16371 `&', if we are allowing GNU extensions. (The only qualifier
16372 that can legally appear after `&' is `restrict', but that is
16373 enforced during semantic analysis. */
16374 if (code == INDIRECT_REF
16375 || cp_parser_allow_gnu_extensions_p (parser))
16376 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
16380 /* Try the pointer-to-member case. */
16381 cp_parser_parse_tentatively (parser);
16382 /* Look for the optional `::' operator. */
16383 cp_parser_global_scope_opt (parser,
16384 /*current_scope_valid_p=*/false);
16385 /* Look for the nested-name specifier. */
16386 token = cp_lexer_peek_token (parser->lexer);
16387 cp_parser_nested_name_specifier (parser,
16388 /*typename_keyword_p=*/false,
16389 /*check_dependency_p=*/true,
16391 /*is_declaration=*/false);
16392 /* If we found it, and the next token is a `*', then we are
16393 indeed looking at a pointer-to-member operator. */
16394 if (!cp_parser_error_occurred (parser)
16395 && cp_parser_require (parser, CPP_MULT, RT_MULT))
16397 /* Indicate that the `*' operator was used. */
16398 code = INDIRECT_REF;
16400 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
16401 error_at (token->location, "%qD is a namespace", parser->scope);
16404 /* The type of which the member is a member is given by the
16406 *type = parser->scope;
16407 /* The next name will not be qualified. */
16408 parser->scope = NULL_TREE;
16409 parser->qualifying_scope = NULL_TREE;
16410 parser->object_scope = NULL_TREE;
16411 /* Look for the optional cv-qualifier-seq. */
16412 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
16415 /* If that didn't work we don't have a ptr-operator. */
16416 if (!cp_parser_parse_definitely (parser))
16417 cp_parser_error (parser, "expected ptr-operator");
16423 /* Parse an (optional) cv-qualifier-seq.
16426 cv-qualifier cv-qualifier-seq [opt]
16437 Returns a bitmask representing the cv-qualifiers. */
16440 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
16442 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
16447 cp_cv_quals cv_qualifier;
16449 /* Peek at the next token. */
16450 token = cp_lexer_peek_token (parser->lexer);
16451 /* See if it's a cv-qualifier. */
16452 switch (token->keyword)
16455 cv_qualifier = TYPE_QUAL_CONST;
16459 cv_qualifier = TYPE_QUAL_VOLATILE;
16463 cv_qualifier = TYPE_QUAL_RESTRICT;
16467 cv_qualifier = TYPE_UNQUALIFIED;
16474 if (cv_quals & cv_qualifier)
16476 error_at (token->location, "duplicate cv-qualifier");
16477 cp_lexer_purge_token (parser->lexer);
16481 cp_lexer_consume_token (parser->lexer);
16482 cv_quals |= cv_qualifier;
16489 /* Parse an (optional) virt-specifier-seq.
16491 virt-specifier-seq:
16492 virt-specifier virt-specifier-seq [opt]
16498 Returns a bitmask representing the virt-specifiers. */
16500 static cp_virt_specifiers
16501 cp_parser_virt_specifier_seq_opt (cp_parser* parser)
16503 cp_virt_specifiers virt_specifiers = VIRT_SPEC_UNSPECIFIED;
16508 cp_virt_specifiers virt_specifier;
16510 /* Peek at the next token. */
16511 token = cp_lexer_peek_token (parser->lexer);
16512 /* See if it's a virt-specifier-qualifier. */
16513 if (token->type != CPP_NAME)
16515 if (!strcmp (IDENTIFIER_POINTER(token->u.value), "override"))
16517 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS);
16518 virt_specifier = VIRT_SPEC_OVERRIDE;
16520 else if (!strcmp (IDENTIFIER_POINTER(token->u.value), "final"))
16522 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS);
16523 virt_specifier = VIRT_SPEC_FINAL;
16525 else if (!strcmp (IDENTIFIER_POINTER(token->u.value), "__final"))
16527 virt_specifier = VIRT_SPEC_FINAL;
16532 if (virt_specifiers & virt_specifier)
16534 error_at (token->location, "duplicate virt-specifier");
16535 cp_lexer_purge_token (parser->lexer);
16539 cp_lexer_consume_token (parser->lexer);
16540 virt_specifiers |= virt_specifier;
16543 return virt_specifiers;
16546 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16547 is in scope even though it isn't real. */
16550 inject_this_parameter (tree ctype, cp_cv_quals quals)
16554 if (current_class_ptr)
16556 /* We don't clear this between NSDMIs. Is it already what we want? */
16557 tree type = TREE_TYPE (TREE_TYPE (current_class_ptr));
16558 if (same_type_ignoring_top_level_qualifiers_p (ctype, type)
16559 && cp_type_quals (type) == quals)
16563 this_parm = build_this_parm (ctype, quals);
16564 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16565 current_class_ptr = NULL_TREE;
16567 = cp_build_indirect_ref (this_parm, RO_NULL, tf_warning_or_error);
16568 current_class_ptr = this_parm;
16571 /* Parse a late-specified return type, if any. This is not a separate
16572 non-terminal, but part of a function declarator, which looks like
16574 -> trailing-type-specifier-seq abstract-declarator(opt)
16576 Returns the type indicated by the type-id.
16578 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16582 cp_parser_late_return_type_opt (cp_parser* parser, cp_cv_quals quals)
16587 /* Peek at the next token. */
16588 token = cp_lexer_peek_token (parser->lexer);
16589 /* A late-specified return type is indicated by an initial '->'. */
16590 if (token->type != CPP_DEREF)
16593 /* Consume the ->. */
16594 cp_lexer_consume_token (parser->lexer);
16598 /* DR 1207: 'this' is in scope in the trailing return type. */
16599 gcc_assert (current_class_ptr == NULL_TREE);
16600 inject_this_parameter (current_class_type, quals);
16603 type = cp_parser_trailing_type_id (parser);
16606 current_class_ptr = current_class_ref = NULL_TREE;
16611 /* Parse a declarator-id.
16615 :: [opt] nested-name-specifier [opt] type-name
16617 In the `id-expression' case, the value returned is as for
16618 cp_parser_id_expression if the id-expression was an unqualified-id.
16619 If the id-expression was a qualified-id, then a SCOPE_REF is
16620 returned. The first operand is the scope (either a NAMESPACE_DECL
16621 or TREE_TYPE), but the second is still just a representation of an
16625 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
16628 /* The expression must be an id-expression. Assume that qualified
16629 names are the names of types so that:
16632 int S<T>::R::i = 3;
16634 will work; we must treat `S<T>::R' as the name of a type.
16635 Similarly, assume that qualified names are templates, where
16639 int S<T>::R<T>::i = 3;
16642 id = cp_parser_id_expression (parser,
16643 /*template_keyword_p=*/false,
16644 /*check_dependency_p=*/false,
16645 /*template_p=*/NULL,
16646 /*declarator_p=*/true,
16648 if (id && BASELINK_P (id))
16649 id = BASELINK_FUNCTIONS (id);
16653 /* Parse a type-id.
16656 type-specifier-seq abstract-declarator [opt]
16658 Returns the TYPE specified. */
16661 cp_parser_type_id_1 (cp_parser* parser, bool is_template_arg,
16662 bool is_trailing_return)
16664 cp_decl_specifier_seq type_specifier_seq;
16665 cp_declarator *abstract_declarator;
16667 /* Parse the type-specifier-seq. */
16668 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
16669 is_trailing_return,
16670 &type_specifier_seq);
16671 if (type_specifier_seq.type == error_mark_node)
16672 return error_mark_node;
16674 /* There might or might not be an abstract declarator. */
16675 cp_parser_parse_tentatively (parser);
16676 /* Look for the declarator. */
16677 abstract_declarator
16678 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
16679 /*parenthesized_p=*/NULL,
16680 /*member_p=*/false);
16681 /* Check to see if there really was a declarator. */
16682 if (!cp_parser_parse_definitely (parser))
16683 abstract_declarator = NULL;
16685 if (type_specifier_seq.type
16686 && type_uses_auto (type_specifier_seq.type))
16688 /* A type-id with type 'auto' is only ok if the abstract declarator
16689 is a function declarator with a late-specified return type. */
16690 if (abstract_declarator
16691 && abstract_declarator->kind == cdk_function
16692 && abstract_declarator->u.function.late_return_type)
16696 error ("invalid use of %<auto%>");
16697 return error_mark_node;
16701 return groktypename (&type_specifier_seq, abstract_declarator,
16705 static tree cp_parser_type_id (cp_parser *parser)
16707 return cp_parser_type_id_1 (parser, false, false);
16710 static tree cp_parser_template_type_arg (cp_parser *parser)
16713 const char *saved_message = parser->type_definition_forbidden_message;
16714 parser->type_definition_forbidden_message
16715 = G_("types may not be defined in template arguments");
16716 r = cp_parser_type_id_1 (parser, true, false);
16717 parser->type_definition_forbidden_message = saved_message;
16721 static tree cp_parser_trailing_type_id (cp_parser *parser)
16723 return cp_parser_type_id_1 (parser, false, true);
16726 /* Parse a type-specifier-seq.
16728 type-specifier-seq:
16729 type-specifier type-specifier-seq [opt]
16733 type-specifier-seq:
16734 attributes type-specifier-seq [opt]
16736 If IS_DECLARATION is true, we are at the start of a "condition" or
16737 exception-declaration, so we might be followed by a declarator-id.
16739 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16740 i.e. we've just seen "->".
16742 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16745 cp_parser_type_specifier_seq (cp_parser* parser,
16746 bool is_declaration,
16747 bool is_trailing_return,
16748 cp_decl_specifier_seq *type_specifier_seq)
16750 bool seen_type_specifier = false;
16751 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
16752 cp_token *start_token = NULL;
16754 /* Clear the TYPE_SPECIFIER_SEQ. */
16755 clear_decl_specs (type_specifier_seq);
16757 /* In the context of a trailing return type, enum E { } is an
16758 elaborated-type-specifier followed by a function-body, not an
16760 if (is_trailing_return)
16761 flags |= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS;
16763 /* Parse the type-specifiers and attributes. */
16766 tree type_specifier;
16767 bool is_cv_qualifier;
16769 /* Check for attributes first. */
16770 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
16772 type_specifier_seq->attributes =
16773 chainon (type_specifier_seq->attributes,
16774 cp_parser_attributes_opt (parser));
16778 /* record the token of the beginning of the type specifier seq,
16779 for error reporting purposes*/
16781 start_token = cp_lexer_peek_token (parser->lexer);
16783 /* Look for the type-specifier. */
16784 type_specifier = cp_parser_type_specifier (parser,
16786 type_specifier_seq,
16787 /*is_declaration=*/false,
16790 if (!type_specifier)
16792 /* If the first type-specifier could not be found, this is not a
16793 type-specifier-seq at all. */
16794 if (!seen_type_specifier)
16796 cp_parser_error (parser, "expected type-specifier");
16797 type_specifier_seq->type = error_mark_node;
16800 /* If subsequent type-specifiers could not be found, the
16801 type-specifier-seq is complete. */
16805 seen_type_specifier = true;
16806 /* The standard says that a condition can be:
16808 type-specifier-seq declarator = assignment-expression
16815 we should treat the "S" as a declarator, not as a
16816 type-specifier. The standard doesn't say that explicitly for
16817 type-specifier-seq, but it does say that for
16818 decl-specifier-seq in an ordinary declaration. Perhaps it
16819 would be clearer just to allow a decl-specifier-seq here, and
16820 then add a semantic restriction that if any decl-specifiers
16821 that are not type-specifiers appear, the program is invalid. */
16822 if (is_declaration && !is_cv_qualifier)
16823 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
16826 cp_parser_check_decl_spec (type_specifier_seq, start_token->location);
16829 /* Parse a parameter-declaration-clause.
16831 parameter-declaration-clause:
16832 parameter-declaration-list [opt] ... [opt]
16833 parameter-declaration-list , ...
16835 Returns a representation for the parameter declarations. A return
16836 value of NULL indicates a parameter-declaration-clause consisting
16837 only of an ellipsis. */
16840 cp_parser_parameter_declaration_clause (cp_parser* parser)
16847 /* Peek at the next token. */
16848 token = cp_lexer_peek_token (parser->lexer);
16849 /* Check for trivial parameter-declaration-clauses. */
16850 if (token->type == CPP_ELLIPSIS)
16852 /* Consume the `...' token. */
16853 cp_lexer_consume_token (parser->lexer);
16856 else if (token->type == CPP_CLOSE_PAREN)
16857 /* There are no parameters. */
16859 #ifndef NO_IMPLICIT_EXTERN_C
16860 if (in_system_header && current_class_type == NULL
16861 && current_lang_name == lang_name_c)
16865 return void_list_node;
16867 /* Check for `(void)', too, which is a special case. */
16868 else if (token->keyword == RID_VOID
16869 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
16870 == CPP_CLOSE_PAREN))
16872 /* Consume the `void' token. */
16873 cp_lexer_consume_token (parser->lexer);
16874 /* There are no parameters. */
16875 return void_list_node;
16878 /* Parse the parameter-declaration-list. */
16879 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
16880 /* If a parse error occurred while parsing the
16881 parameter-declaration-list, then the entire
16882 parameter-declaration-clause is erroneous. */
16886 /* Peek at the next token. */
16887 token = cp_lexer_peek_token (parser->lexer);
16888 /* If it's a `,', the clause should terminate with an ellipsis. */
16889 if (token->type == CPP_COMMA)
16891 /* Consume the `,'. */
16892 cp_lexer_consume_token (parser->lexer);
16893 /* Expect an ellipsis. */
16895 = (cp_parser_require (parser, CPP_ELLIPSIS, RT_ELLIPSIS) != NULL);
16897 /* It might also be `...' if the optional trailing `,' was
16899 else if (token->type == CPP_ELLIPSIS)
16901 /* Consume the `...' token. */
16902 cp_lexer_consume_token (parser->lexer);
16903 /* And remember that we saw it. */
16907 ellipsis_p = false;
16909 /* Finish the parameter list. */
16911 parameters = chainon (parameters, void_list_node);
16916 /* Parse a parameter-declaration-list.
16918 parameter-declaration-list:
16919 parameter-declaration
16920 parameter-declaration-list , parameter-declaration
16922 Returns a representation of the parameter-declaration-list, as for
16923 cp_parser_parameter_declaration_clause. However, the
16924 `void_list_node' is never appended to the list. Upon return,
16925 *IS_ERROR will be true iff an error occurred. */
16928 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
16930 tree parameters = NULL_TREE;
16931 tree *tail = ¶meters;
16932 bool saved_in_unbraced_linkage_specification_p;
16935 /* Assume all will go well. */
16937 /* The special considerations that apply to a function within an
16938 unbraced linkage specifications do not apply to the parameters
16939 to the function. */
16940 saved_in_unbraced_linkage_specification_p
16941 = parser->in_unbraced_linkage_specification_p;
16942 parser->in_unbraced_linkage_specification_p = false;
16944 /* Look for more parameters. */
16947 cp_parameter_declarator *parameter;
16948 tree decl = error_mark_node;
16949 bool parenthesized_p = false;
16950 /* Parse the parameter. */
16952 = cp_parser_parameter_declaration (parser,
16953 /*template_parm_p=*/false,
16956 /* We don't know yet if the enclosing context is deprecated, so wait
16957 and warn in grokparms if appropriate. */
16958 deprecated_state = DEPRECATED_SUPPRESS;
16961 decl = grokdeclarator (parameter->declarator,
16962 ¶meter->decl_specifiers,
16964 parameter->default_argument != NULL_TREE,
16965 ¶meter->decl_specifiers.attributes);
16967 deprecated_state = DEPRECATED_NORMAL;
16969 /* If a parse error occurred parsing the parameter declaration,
16970 then the entire parameter-declaration-list is erroneous. */
16971 if (decl == error_mark_node)
16974 parameters = error_mark_node;
16978 if (parameter->decl_specifiers.attributes)
16979 cplus_decl_attributes (&decl,
16980 parameter->decl_specifiers.attributes,
16982 if (DECL_NAME (decl))
16983 decl = pushdecl (decl);
16985 if (decl != error_mark_node)
16987 retrofit_lang_decl (decl);
16988 DECL_PARM_INDEX (decl) = ++index;
16989 DECL_PARM_LEVEL (decl) = function_parm_depth ();
16992 /* Add the new parameter to the list. */
16993 *tail = build_tree_list (parameter->default_argument, decl);
16994 tail = &TREE_CHAIN (*tail);
16996 /* Peek at the next token. */
16997 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
16998 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
16999 /* These are for Objective-C++ */
17000 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
17001 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
17002 /* The parameter-declaration-list is complete. */
17004 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
17008 /* Peek at the next token. */
17009 token = cp_lexer_peek_nth_token (parser->lexer, 2);
17010 /* If it's an ellipsis, then the list is complete. */
17011 if (token->type == CPP_ELLIPSIS)
17013 /* Otherwise, there must be more parameters. Consume the
17015 cp_lexer_consume_token (parser->lexer);
17016 /* When parsing something like:
17018 int i(float f, double d)
17020 we can tell after seeing the declaration for "f" that we
17021 are not looking at an initialization of a variable "i",
17022 but rather at the declaration of a function "i".
17024 Due to the fact that the parsing of template arguments
17025 (as specified to a template-id) requires backtracking we
17026 cannot use this technique when inside a template argument
17028 if (!parser->in_template_argument_list_p
17029 && !parser->in_type_id_in_expr_p
17030 && cp_parser_uncommitted_to_tentative_parse_p (parser)
17031 /* However, a parameter-declaration of the form
17032 "foat(f)" (which is a valid declaration of a
17033 parameter "f") can also be interpreted as an
17034 expression (the conversion of "f" to "float"). */
17035 && !parenthesized_p)
17036 cp_parser_commit_to_tentative_parse (parser);
17040 cp_parser_error (parser, "expected %<,%> or %<...%>");
17041 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
17042 cp_parser_skip_to_closing_parenthesis (parser,
17043 /*recovering=*/true,
17044 /*or_comma=*/false,
17045 /*consume_paren=*/false);
17050 parser->in_unbraced_linkage_specification_p
17051 = saved_in_unbraced_linkage_specification_p;
17056 /* Parse a parameter declaration.
17058 parameter-declaration:
17059 decl-specifier-seq ... [opt] declarator
17060 decl-specifier-seq declarator = assignment-expression
17061 decl-specifier-seq ... [opt] abstract-declarator [opt]
17062 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17064 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17065 declares a template parameter. (In that case, a non-nested `>'
17066 token encountered during the parsing of the assignment-expression
17067 is not interpreted as a greater-than operator.)
17069 Returns a representation of the parameter, or NULL if an error
17070 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17071 true iff the declarator is of the form "(p)". */
17073 static cp_parameter_declarator *
17074 cp_parser_parameter_declaration (cp_parser *parser,
17075 bool template_parm_p,
17076 bool *parenthesized_p)
17078 int declares_class_or_enum;
17079 cp_decl_specifier_seq decl_specifiers;
17080 cp_declarator *declarator;
17081 tree default_argument;
17082 cp_token *token = NULL, *declarator_token_start = NULL;
17083 const char *saved_message;
17085 /* In a template parameter, `>' is not an operator.
17089 When parsing a default template-argument for a non-type
17090 template-parameter, the first non-nested `>' is taken as the end
17091 of the template parameter-list rather than a greater-than
17094 /* Type definitions may not appear in parameter types. */
17095 saved_message = parser->type_definition_forbidden_message;
17096 parser->type_definition_forbidden_message
17097 = G_("types may not be defined in parameter types");
17099 /* Parse the declaration-specifiers. */
17100 cp_parser_decl_specifier_seq (parser,
17101 CP_PARSER_FLAGS_NONE,
17103 &declares_class_or_enum);
17105 /* Complain about missing 'typename' or other invalid type names. */
17106 if (!decl_specifiers.any_type_specifiers_p)
17107 cp_parser_parse_and_diagnose_invalid_type_name (parser);
17109 /* If an error occurred, there's no reason to attempt to parse the
17110 rest of the declaration. */
17111 if (cp_parser_error_occurred (parser))
17113 parser->type_definition_forbidden_message = saved_message;
17117 /* Peek at the next token. */
17118 token = cp_lexer_peek_token (parser->lexer);
17120 /* If the next token is a `)', `,', `=', `>', or `...', then there
17121 is no declarator. However, when variadic templates are enabled,
17122 there may be a declarator following `...'. */
17123 if (token->type == CPP_CLOSE_PAREN
17124 || token->type == CPP_COMMA
17125 || token->type == CPP_EQ
17126 || token->type == CPP_GREATER)
17129 if (parenthesized_p)
17130 *parenthesized_p = false;
17132 /* Otherwise, there should be a declarator. */
17135 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
17136 parser->default_arg_ok_p = false;
17138 /* After seeing a decl-specifier-seq, if the next token is not a
17139 "(", there is no possibility that the code is a valid
17140 expression. Therefore, if parsing tentatively, we commit at
17142 if (!parser->in_template_argument_list_p
17143 /* In an expression context, having seen:
17147 we cannot be sure whether we are looking at a
17148 function-type (taking a "char" as a parameter) or a cast
17149 of some object of type "char" to "int". */
17150 && !parser->in_type_id_in_expr_p
17151 && cp_parser_uncommitted_to_tentative_parse_p (parser)
17152 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
17153 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
17154 cp_parser_commit_to_tentative_parse (parser);
17155 /* Parse the declarator. */
17156 declarator_token_start = token;
17157 declarator = cp_parser_declarator (parser,
17158 CP_PARSER_DECLARATOR_EITHER,
17159 /*ctor_dtor_or_conv_p=*/NULL,
17161 /*member_p=*/false);
17162 parser->default_arg_ok_p = saved_default_arg_ok_p;
17163 /* After the declarator, allow more attributes. */
17164 decl_specifiers.attributes
17165 = chainon (decl_specifiers.attributes,
17166 cp_parser_attributes_opt (parser));
17169 /* If the next token is an ellipsis, and we have not seen a
17170 declarator name, and the type of the declarator contains parameter
17171 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17172 a parameter pack expansion expression. Otherwise, leave the
17173 ellipsis for a C-style variadic function. */
17174 token = cp_lexer_peek_token (parser->lexer);
17175 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
17177 tree type = decl_specifiers.type;
17179 if (type && DECL_P (type))
17180 type = TREE_TYPE (type);
17183 && TREE_CODE (type) != TYPE_PACK_EXPANSION
17184 && declarator_can_be_parameter_pack (declarator)
17185 && (!declarator || !declarator->parameter_pack_p)
17186 && uses_parameter_packs (type))
17188 /* Consume the `...'. */
17189 cp_lexer_consume_token (parser->lexer);
17190 maybe_warn_variadic_templates ();
17192 /* Build a pack expansion type */
17194 declarator->parameter_pack_p = true;
17196 decl_specifiers.type = make_pack_expansion (type);
17200 /* The restriction on defining new types applies only to the type
17201 of the parameter, not to the default argument. */
17202 parser->type_definition_forbidden_message = saved_message;
17204 /* If the next token is `=', then process a default argument. */
17205 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
17207 /* If we are defining a class, then the tokens that make up the
17208 default argument must be saved and processed later. */
17209 if (!template_parm_p && at_class_scope_p ()
17210 && TYPE_BEING_DEFINED (current_class_type)
17211 && !LAMBDA_TYPE_P (current_class_type))
17213 unsigned depth = 0;
17214 int maybe_template_id = 0;
17215 cp_token *first_token;
17218 /* Add tokens until we have processed the entire default
17219 argument. We add the range [first_token, token). */
17220 first_token = cp_lexer_peek_token (parser->lexer);
17225 /* Peek at the next token. */
17226 token = cp_lexer_peek_token (parser->lexer);
17227 /* What we do depends on what token we have. */
17228 switch (token->type)
17230 /* In valid code, a default argument must be
17231 immediately followed by a `,' `)', or `...'. */
17233 if (depth == 0 && maybe_template_id)
17235 /* If we've seen a '<', we might be in a
17236 template-argument-list. Until Core issue 325 is
17237 resolved, we don't know how this situation ought
17238 to be handled, so try to DTRT. We check whether
17239 what comes after the comma is a valid parameter
17240 declaration list. If it is, then the comma ends
17241 the default argument; otherwise the default
17242 argument continues. */
17243 bool error = false;
17246 /* Set ITALP so cp_parser_parameter_declaration_list
17247 doesn't decide to commit to this parse. */
17248 bool saved_italp = parser->in_template_argument_list_p;
17249 parser->in_template_argument_list_p = true;
17251 cp_parser_parse_tentatively (parser);
17252 cp_lexer_consume_token (parser->lexer);
17253 begin_scope (sk_function_parms, NULL_TREE);
17254 cp_parser_parameter_declaration_list (parser, &error);
17255 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
17256 pop_binding (DECL_NAME (t), t);
17258 if (!cp_parser_error_occurred (parser) && !error)
17260 cp_parser_abort_tentative_parse (parser);
17262 parser->in_template_argument_list_p = saved_italp;
17265 case CPP_CLOSE_PAREN:
17267 /* If we run into a non-nested `;', `}', or `]',
17268 then the code is invalid -- but the default
17269 argument is certainly over. */
17270 case CPP_SEMICOLON:
17271 case CPP_CLOSE_BRACE:
17272 case CPP_CLOSE_SQUARE:
17275 /* Update DEPTH, if necessary. */
17276 else if (token->type == CPP_CLOSE_PAREN
17277 || token->type == CPP_CLOSE_BRACE
17278 || token->type == CPP_CLOSE_SQUARE)
17282 case CPP_OPEN_PAREN:
17283 case CPP_OPEN_SQUARE:
17284 case CPP_OPEN_BRACE:
17290 /* This might be the comparison operator, or it might
17291 start a template argument list. */
17292 ++maybe_template_id;
17296 if (cxx_dialect == cxx98)
17298 /* Fall through for C++0x, which treats the `>>'
17299 operator like two `>' tokens in certain
17305 /* This might be an operator, or it might close a
17306 template argument list. But if a previous '<'
17307 started a template argument list, this will have
17308 closed it, so we can't be in one anymore. */
17309 maybe_template_id -= 1 + (token->type == CPP_RSHIFT);
17310 if (maybe_template_id < 0)
17311 maybe_template_id = 0;
17315 /* If we run out of tokens, issue an error message. */
17317 case CPP_PRAGMA_EOL:
17318 error_at (token->location, "file ends in default argument");
17324 /* In these cases, we should look for template-ids.
17325 For example, if the default argument is
17326 `X<int, double>()', we need to do name lookup to
17327 figure out whether or not `X' is a template; if
17328 so, the `,' does not end the default argument.
17330 That is not yet done. */
17337 /* If we've reached the end, stop. */
17341 /* Add the token to the token block. */
17342 token = cp_lexer_consume_token (parser->lexer);
17345 /* Create a DEFAULT_ARG to represent the unparsed default
17347 default_argument = make_node (DEFAULT_ARG);
17348 DEFARG_TOKENS (default_argument)
17349 = cp_token_cache_new (first_token, token);
17350 DEFARG_INSTANTIATIONS (default_argument) = NULL;
17352 /* Outside of a class definition, we can just parse the
17353 assignment-expression. */
17356 token = cp_lexer_peek_token (parser->lexer);
17358 = cp_parser_default_argument (parser, template_parm_p);
17361 if (!parser->default_arg_ok_p)
17363 if (flag_permissive)
17364 warning (0, "deprecated use of default argument for parameter of non-function");
17367 error_at (token->location,
17368 "default arguments are only "
17369 "permitted for function parameters");
17370 default_argument = NULL_TREE;
17373 else if ((declarator && declarator->parameter_pack_p)
17374 || (decl_specifiers.type
17375 && PACK_EXPANSION_P (decl_specifiers.type)))
17377 /* Find the name of the parameter pack. */
17378 cp_declarator *id_declarator = declarator;
17379 while (id_declarator && id_declarator->kind != cdk_id)
17380 id_declarator = id_declarator->declarator;
17382 if (id_declarator && id_declarator->kind == cdk_id)
17383 error_at (declarator_token_start->location,
17385 ? G_("template parameter pack %qD "
17386 "cannot have a default argument")
17387 : G_("parameter pack %qD cannot have "
17388 "a default argument"),
17389 id_declarator->u.id.unqualified_name);
17391 error_at (declarator_token_start->location,
17393 ? G_("template parameter pack cannot have "
17394 "a default argument")
17395 : G_("parameter pack cannot have a "
17396 "default argument"));
17398 default_argument = NULL_TREE;
17402 default_argument = NULL_TREE;
17404 return make_parameter_declarator (&decl_specifiers,
17409 /* Parse a default argument and return it.
17411 TEMPLATE_PARM_P is true if this is a default argument for a
17412 non-type template parameter. */
17414 cp_parser_default_argument (cp_parser *parser, bool template_parm_p)
17416 tree default_argument = NULL_TREE;
17417 bool saved_greater_than_is_operator_p;
17418 bool saved_local_variables_forbidden_p;
17419 bool non_constant_p, is_direct_init;
17421 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17423 saved_greater_than_is_operator_p = parser->greater_than_is_operator_p;
17424 parser->greater_than_is_operator_p = !template_parm_p;
17425 /* Local variable names (and the `this' keyword) may not
17426 appear in a default argument. */
17427 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
17428 parser->local_variables_forbidden_p = true;
17429 /* Parse the assignment-expression. */
17430 if (template_parm_p)
17431 push_deferring_access_checks (dk_no_deferred);
17433 = cp_parser_initializer (parser, &is_direct_init, &non_constant_p);
17434 if (BRACE_ENCLOSED_INITIALIZER_P (default_argument))
17435 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
17436 if (template_parm_p)
17437 pop_deferring_access_checks ();
17438 parser->greater_than_is_operator_p = saved_greater_than_is_operator_p;
17439 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
17441 return default_argument;
17444 /* Parse a function-body.
17447 compound_statement */
17450 cp_parser_function_body (cp_parser *parser)
17452 cp_parser_compound_statement (parser, NULL, false, true);
17455 /* Parse a ctor-initializer-opt followed by a function-body. Return
17456 true if a ctor-initializer was present. */
17459 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
17462 bool ctor_initializer_p;
17463 const bool check_body_p =
17464 DECL_CONSTRUCTOR_P (current_function_decl)
17465 && DECL_DECLARED_CONSTEXPR_P (current_function_decl);
17468 /* Begin the function body. */
17469 body = begin_function_body ();
17470 /* Parse the optional ctor-initializer. */
17471 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
17473 /* If we're parsing a constexpr constructor definition, we need
17474 to check that the constructor body is indeed empty. However,
17475 before we get to cp_parser_function_body lot of junk has been
17476 generated, so we can't just check that we have an empty block.
17477 Rather we take a snapshot of the outermost block, and check whether
17478 cp_parser_function_body changed its state. */
17482 if (TREE_CODE (list) == BIND_EXPR)
17483 list = BIND_EXPR_BODY (list);
17484 if (TREE_CODE (list) == STATEMENT_LIST
17485 && STATEMENT_LIST_TAIL (list) != NULL)
17486 last = STATEMENT_LIST_TAIL (list)->stmt;
17488 /* Parse the function-body. */
17489 cp_parser_function_body (parser);
17491 check_constexpr_ctor_body (last, list);
17492 /* Finish the function body. */
17493 finish_function_body (body);
17495 return ctor_initializer_p;
17498 /* Parse an initializer.
17501 = initializer-clause
17502 ( expression-list )
17504 Returns an expression representing the initializer. If no
17505 initializer is present, NULL_TREE is returned.
17507 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17508 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17509 set to TRUE if there is no initializer present. If there is an
17510 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17511 is set to true; otherwise it is set to false. */
17514 cp_parser_initializer (cp_parser* parser, bool* is_direct_init,
17515 bool* non_constant_p)
17520 /* Peek at the next token. */
17521 token = cp_lexer_peek_token (parser->lexer);
17523 /* Let our caller know whether or not this initializer was
17525 *is_direct_init = (token->type != CPP_EQ);
17526 /* Assume that the initializer is constant. */
17527 *non_constant_p = false;
17529 if (token->type == CPP_EQ)
17531 /* Consume the `='. */
17532 cp_lexer_consume_token (parser->lexer);
17533 /* Parse the initializer-clause. */
17534 init = cp_parser_initializer_clause (parser, non_constant_p);
17536 else if (token->type == CPP_OPEN_PAREN)
17539 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
17541 /*allow_expansion_p=*/true,
17544 return error_mark_node;
17545 init = build_tree_list_vec (vec);
17546 release_tree_vector (vec);
17548 else if (token->type == CPP_OPEN_BRACE)
17550 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
17551 init = cp_parser_braced_list (parser, non_constant_p);
17552 CONSTRUCTOR_IS_DIRECT_INIT (init) = 1;
17556 /* Anything else is an error. */
17557 cp_parser_error (parser, "expected initializer");
17558 init = error_mark_node;
17564 /* Parse an initializer-clause.
17566 initializer-clause:
17567 assignment-expression
17570 Returns an expression representing the initializer.
17572 If the `assignment-expression' production is used the value
17573 returned is simply a representation for the expression.
17575 Otherwise, calls cp_parser_braced_list. */
17578 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
17582 /* Assume the expression is constant. */
17583 *non_constant_p = false;
17585 /* If it is not a `{', then we are looking at an
17586 assignment-expression. */
17587 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
17590 = cp_parser_constant_expression (parser,
17591 /*allow_non_constant_p=*/true,
17595 initializer = cp_parser_braced_list (parser, non_constant_p);
17597 return initializer;
17600 /* Parse a brace-enclosed initializer list.
17603 { initializer-list , [opt] }
17606 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17607 the elements of the initializer-list (or NULL, if the last
17608 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17609 NULL_TREE. There is no way to detect whether or not the optional
17610 trailing `,' was provided. NON_CONSTANT_P is as for
17611 cp_parser_initializer. */
17614 cp_parser_braced_list (cp_parser* parser, bool* non_constant_p)
17618 /* Consume the `{' token. */
17619 cp_lexer_consume_token (parser->lexer);
17620 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17621 initializer = make_node (CONSTRUCTOR);
17622 /* If it's not a `}', then there is a non-trivial initializer. */
17623 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
17625 /* Parse the initializer list. */
17626 CONSTRUCTOR_ELTS (initializer)
17627 = cp_parser_initializer_list (parser, non_constant_p);
17628 /* A trailing `,' token is allowed. */
17629 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
17630 cp_lexer_consume_token (parser->lexer);
17632 /* Now, there should be a trailing `}'. */
17633 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
17634 TREE_TYPE (initializer) = init_list_type_node;
17635 return initializer;
17638 /* Parse an initializer-list.
17641 initializer-clause ... [opt]
17642 initializer-list , initializer-clause ... [opt]
17647 designation initializer-clause ...[opt]
17648 initializer-list , designation initializer-clause ...[opt]
17653 [ constant-expression ] =
17655 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17656 for the initializer. If the INDEX of the elt is non-NULL, it is the
17657 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17658 as for cp_parser_initializer. */
17660 static VEC(constructor_elt,gc) *
17661 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
17663 VEC(constructor_elt,gc) *v = NULL;
17665 /* Assume all of the expressions are constant. */
17666 *non_constant_p = false;
17668 /* Parse the rest of the list. */
17674 bool clause_non_constant_p;
17676 /* If the next token is an identifier and the following one is a
17677 colon, we are looking at the GNU designated-initializer
17679 if (cp_parser_allow_gnu_extensions_p (parser)
17680 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
17681 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
17683 /* Warn the user that they are using an extension. */
17684 pedwarn (input_location, OPT_pedantic,
17685 "ISO C++ does not allow designated initializers");
17686 /* Consume the identifier. */
17687 designator = cp_lexer_consume_token (parser->lexer)->u.value;
17688 /* Consume the `:'. */
17689 cp_lexer_consume_token (parser->lexer);
17691 /* Also handle the C99 syntax, '. id ='. */
17692 else if (cp_parser_allow_gnu_extensions_p (parser)
17693 && cp_lexer_next_token_is (parser->lexer, CPP_DOT)
17694 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_NAME
17695 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_EQ)
17697 /* Warn the user that they are using an extension. */
17698 pedwarn (input_location, OPT_pedantic,
17699 "ISO C++ does not allow C99 designated initializers");
17700 /* Consume the `.'. */
17701 cp_lexer_consume_token (parser->lexer);
17702 /* Consume the identifier. */
17703 designator = cp_lexer_consume_token (parser->lexer)->u.value;
17704 /* Consume the `='. */
17705 cp_lexer_consume_token (parser->lexer);
17707 /* Also handle C99 array designators, '[ const ] ='. */
17708 else if (cp_parser_allow_gnu_extensions_p (parser)
17709 && !c_dialect_objc ()
17710 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
17712 /* In C++11, [ could start a lambda-introducer. */
17713 cp_parser_parse_tentatively (parser);
17714 cp_lexer_consume_token (parser->lexer);
17715 designator = cp_parser_constant_expression (parser, false, NULL);
17716 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
17717 cp_parser_require (parser, CPP_EQ, RT_EQ);
17718 cp_parser_parse_definitely (parser);
17721 designator = NULL_TREE;
17723 /* Parse the initializer. */
17724 initializer = cp_parser_initializer_clause (parser,
17725 &clause_non_constant_p);
17726 /* If any clause is non-constant, so is the entire initializer. */
17727 if (clause_non_constant_p)
17728 *non_constant_p = true;
17730 /* If we have an ellipsis, this is an initializer pack
17732 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
17734 /* Consume the `...'. */
17735 cp_lexer_consume_token (parser->lexer);
17737 /* Turn the initializer into an initializer expansion. */
17738 initializer = make_pack_expansion (initializer);
17741 /* Add it to the vector. */
17742 CONSTRUCTOR_APPEND_ELT (v, designator, initializer);
17744 /* If the next token is not a comma, we have reached the end of
17746 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
17749 /* Peek at the next token. */
17750 token = cp_lexer_peek_nth_token (parser->lexer, 2);
17751 /* If the next token is a `}', then we're still done. An
17752 initializer-clause can have a trailing `,' after the
17753 initializer-list and before the closing `}'. */
17754 if (token->type == CPP_CLOSE_BRACE)
17757 /* Consume the `,' token. */
17758 cp_lexer_consume_token (parser->lexer);
17764 /* Classes [gram.class] */
17766 /* Parse a class-name.
17772 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17773 to indicate that names looked up in dependent types should be
17774 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17775 keyword has been used to indicate that the name that appears next
17776 is a template. TAG_TYPE indicates the explicit tag given before
17777 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17778 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17779 is the class being defined in a class-head.
17781 Returns the TYPE_DECL representing the class. */
17784 cp_parser_class_name (cp_parser *parser,
17785 bool typename_keyword_p,
17786 bool template_keyword_p,
17787 enum tag_types tag_type,
17788 bool check_dependency_p,
17790 bool is_declaration)
17796 tree identifier = NULL_TREE;
17798 /* All class-names start with an identifier. */
17799 token = cp_lexer_peek_token (parser->lexer);
17800 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
17802 cp_parser_error (parser, "expected class-name");
17803 return error_mark_node;
17806 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17807 to a template-id, so we save it here. */
17808 scope = parser->scope;
17809 if (scope == error_mark_node)
17810 return error_mark_node;
17812 /* Any name names a type if we're following the `typename' keyword
17813 in a qualified name where the enclosing scope is type-dependent. */
17814 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
17815 && dependent_type_p (scope));
17816 /* Handle the common case (an identifier, but not a template-id)
17818 if (token->type == CPP_NAME
17819 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
17821 cp_token *identifier_token;
17824 /* Look for the identifier. */
17825 identifier_token = cp_lexer_peek_token (parser->lexer);
17826 ambiguous_p = identifier_token->ambiguous_p;
17827 identifier = cp_parser_identifier (parser);
17828 /* If the next token isn't an identifier, we are certainly not
17829 looking at a class-name. */
17830 if (identifier == error_mark_node)
17831 decl = error_mark_node;
17832 /* If we know this is a type-name, there's no need to look it
17834 else if (typename_p)
17838 tree ambiguous_decls;
17839 /* If we already know that this lookup is ambiguous, then
17840 we've already issued an error message; there's no reason
17844 cp_parser_simulate_error (parser);
17845 return error_mark_node;
17847 /* If the next token is a `::', then the name must be a type
17850 [basic.lookup.qual]
17852 During the lookup for a name preceding the :: scope
17853 resolution operator, object, function, and enumerator
17854 names are ignored. */
17855 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
17856 tag_type = typename_type;
17857 /* Look up the name. */
17858 decl = cp_parser_lookup_name (parser, identifier,
17860 /*is_template=*/false,
17861 /*is_namespace=*/false,
17862 check_dependency_p,
17864 identifier_token->location);
17865 if (ambiguous_decls)
17867 if (cp_parser_parsing_tentatively (parser))
17868 cp_parser_simulate_error (parser);
17869 return error_mark_node;
17875 /* Try a template-id. */
17876 decl = cp_parser_template_id (parser, template_keyword_p,
17877 check_dependency_p,
17879 if (decl == error_mark_node)
17880 return error_mark_node;
17883 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
17885 /* If this is a typename, create a TYPENAME_TYPE. */
17886 if (typename_p && decl != error_mark_node)
17888 decl = make_typename_type (scope, decl, typename_type,
17889 /*complain=*/tf_error);
17890 if (decl != error_mark_node)
17891 decl = TYPE_NAME (decl);
17894 /* Check to see that it is really the name of a class. */
17895 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
17896 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
17897 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
17898 /* Situations like this:
17900 template <typename T> struct A {
17901 typename T::template X<int>::I i;
17904 are problematic. Is `T::template X<int>' a class-name? The
17905 standard does not seem to be definitive, but there is no other
17906 valid interpretation of the following `::'. Therefore, those
17907 names are considered class-names. */
17909 decl = make_typename_type (scope, decl, tag_type, tf_error);
17910 if (decl != error_mark_node)
17911 decl = TYPE_NAME (decl);
17913 else if (TREE_CODE (decl) != TYPE_DECL
17914 || TREE_TYPE (decl) == error_mark_node
17915 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl))
17916 /* In Objective-C 2.0, a classname followed by '.' starts a
17917 dot-syntax expression, and it's not a type-name. */
17918 || (c_dialect_objc ()
17919 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT
17920 && objc_is_class_name (decl)))
17921 decl = error_mark_node;
17923 if (decl == error_mark_node)
17924 cp_parser_error (parser, "expected class-name");
17925 else if (identifier && !parser->scope)
17926 maybe_note_name_used_in_class (identifier, decl);
17931 /* Parse a class-specifier.
17934 class-head { member-specification [opt] }
17936 Returns the TREE_TYPE representing the class. */
17939 cp_parser_class_specifier_1 (cp_parser* parser)
17942 tree attributes = NULL_TREE;
17943 bool nested_name_specifier_p;
17944 unsigned saved_num_template_parameter_lists;
17945 bool saved_in_function_body;
17946 unsigned char in_statement;
17947 bool in_switch_statement_p;
17948 bool saved_in_unbraced_linkage_specification_p;
17949 tree old_scope = NULL_TREE;
17950 tree scope = NULL_TREE;
17952 cp_token *closing_brace;
17954 push_deferring_access_checks (dk_no_deferred);
17956 /* Parse the class-head. */
17957 type = cp_parser_class_head (parser,
17958 &nested_name_specifier_p,
17961 /* If the class-head was a semantic disaster, skip the entire body
17965 cp_parser_skip_to_end_of_block_or_statement (parser);
17966 pop_deferring_access_checks ();
17967 return error_mark_node;
17970 /* Look for the `{'. */
17971 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
17973 pop_deferring_access_checks ();
17974 return error_mark_node;
17977 /* Process the base classes. If they're invalid, skip the
17978 entire class body. */
17979 if (!xref_basetypes (type, bases))
17981 /* Consuming the closing brace yields better error messages
17983 if (cp_parser_skip_to_closing_brace (parser))
17984 cp_lexer_consume_token (parser->lexer);
17985 pop_deferring_access_checks ();
17986 return error_mark_node;
17989 /* Issue an error message if type-definitions are forbidden here. */
17990 cp_parser_check_type_definition (parser);
17991 /* Remember that we are defining one more class. */
17992 ++parser->num_classes_being_defined;
17993 /* Inside the class, surrounding template-parameter-lists do not
17995 saved_num_template_parameter_lists
17996 = parser->num_template_parameter_lists;
17997 parser->num_template_parameter_lists = 0;
17998 /* We are not in a function body. */
17999 saved_in_function_body = parser->in_function_body;
18000 parser->in_function_body = false;
18001 /* Or in a loop. */
18002 in_statement = parser->in_statement;
18003 parser->in_statement = 0;
18004 /* Or in a switch. */
18005 in_switch_statement_p = parser->in_switch_statement_p;
18006 parser->in_switch_statement_p = false;
18007 /* We are not immediately inside an extern "lang" block. */
18008 saved_in_unbraced_linkage_specification_p
18009 = parser->in_unbraced_linkage_specification_p;
18010 parser->in_unbraced_linkage_specification_p = false;
18012 /* Start the class. */
18013 if (nested_name_specifier_p)
18015 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
18016 old_scope = push_inner_scope (scope);
18018 type = begin_class_definition (type, attributes);
18020 if (type == error_mark_node)
18021 /* If the type is erroneous, skip the entire body of the class. */
18022 cp_parser_skip_to_closing_brace (parser);
18024 /* Parse the member-specification. */
18025 cp_parser_member_specification_opt (parser);
18027 /* Look for the trailing `}'. */
18028 closing_brace = cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
18029 /* Look for trailing attributes to apply to this class. */
18030 if (cp_parser_allow_gnu_extensions_p (parser))
18031 attributes = cp_parser_attributes_opt (parser);
18032 if (type != error_mark_node)
18033 type = finish_struct (type, attributes);
18034 if (nested_name_specifier_p)
18035 pop_inner_scope (old_scope, scope);
18037 /* We've finished a type definition. Check for the common syntax
18038 error of forgetting a semicolon after the definition. We need to
18039 be careful, as we can't just check for not-a-semicolon and be done
18040 with it; the user might have typed:
18042 class X { } c = ...;
18043 class X { } *p = ...;
18045 and so forth. Instead, enumerate all the possible tokens that
18046 might follow this production; if we don't see one of them, then
18047 complain and silently insert the semicolon. */
18049 cp_token *token = cp_lexer_peek_token (parser->lexer);
18050 bool want_semicolon = true;
18052 switch (token->type)
18055 case CPP_SEMICOLON:
18058 case CPP_OPEN_PAREN:
18059 case CPP_CLOSE_PAREN:
18061 want_semicolon = false;
18064 /* While it's legal for type qualifiers and storage class
18065 specifiers to follow type definitions in the grammar, only
18066 compiler testsuites contain code like that. Assume that if
18067 we see such code, then what we're really seeing is a case
18071 const <type> var = ...;
18076 static <type> func (...) ...
18078 i.e. the qualifier or specifier applies to the next
18079 declaration. To do so, however, we need to look ahead one
18080 more token to see if *that* token is a type specifier.
18082 This code could be improved to handle:
18085 static const <type> var = ...; */
18087 if (keyword_is_decl_specifier (token->keyword))
18089 cp_token *lookahead = cp_lexer_peek_nth_token (parser->lexer, 2);
18091 /* Handling user-defined types here would be nice, but very
18094 = (lookahead->type == CPP_KEYWORD
18095 && keyword_begins_type_specifier (lookahead->keyword));
18102 /* If we don't have a type, then something is very wrong and we
18103 shouldn't try to do anything clever. Likewise for not seeing the
18105 if (closing_brace && TYPE_P (type) && want_semicolon)
18107 cp_token_position prev
18108 = cp_lexer_previous_token_position (parser->lexer);
18109 cp_token *prev_token = cp_lexer_token_at (parser->lexer, prev);
18110 location_t loc = prev_token->location;
18112 if (CLASSTYPE_DECLARED_CLASS (type))
18113 error_at (loc, "expected %<;%> after class definition");
18114 else if (TREE_CODE (type) == RECORD_TYPE)
18115 error_at (loc, "expected %<;%> after struct definition");
18116 else if (TREE_CODE (type) == UNION_TYPE)
18117 error_at (loc, "expected %<;%> after union definition");
18119 gcc_unreachable ();
18121 /* Unget one token and smash it to look as though we encountered
18122 a semicolon in the input stream. */
18123 cp_lexer_set_token_position (parser->lexer, prev);
18124 token = cp_lexer_peek_token (parser->lexer);
18125 token->type = CPP_SEMICOLON;
18126 token->keyword = RID_MAX;
18130 /* If this class is not itself within the scope of another class,
18131 then we need to parse the bodies of all of the queued function
18132 definitions. Note that the queued functions defined in a class
18133 are not always processed immediately following the
18134 class-specifier for that class. Consider:
18137 struct B { void f() { sizeof (A); } };
18140 If `f' were processed before the processing of `A' were
18141 completed, there would be no way to compute the size of `A'.
18142 Note that the nesting we are interested in here is lexical --
18143 not the semantic nesting given by TYPE_CONTEXT. In particular,
18146 struct A { struct B; };
18147 struct A::B { void f() { } };
18149 there is no need to delay the parsing of `A::B::f'. */
18150 if (--parser->num_classes_being_defined == 0)
18153 tree class_type = NULL_TREE;
18154 tree pushed_scope = NULL_TREE;
18156 cp_default_arg_entry *e;
18157 tree save_ccp, save_ccr;
18159 /* In a first pass, parse default arguments to the functions.
18160 Then, in a second pass, parse the bodies of the functions.
18161 This two-phased approach handles cases like:
18169 FOR_EACH_VEC_ELT (cp_default_arg_entry, unparsed_funs_with_default_args,
18173 /* If there are default arguments that have not yet been processed,
18174 take care of them now. */
18175 if (class_type != e->class_type)
18178 pop_scope (pushed_scope);
18179 class_type = e->class_type;
18180 pushed_scope = push_scope (class_type);
18182 /* Make sure that any template parameters are in scope. */
18183 maybe_begin_member_template_processing (decl);
18184 /* Parse the default argument expressions. */
18185 cp_parser_late_parsing_default_args (parser, decl);
18186 /* Remove any template parameters from the symbol table. */
18187 maybe_end_member_template_processing ();
18189 VEC_truncate (cp_default_arg_entry, unparsed_funs_with_default_args, 0);
18190 /* Now parse any NSDMIs. */
18191 save_ccp = current_class_ptr;
18192 save_ccr = current_class_ref;
18193 FOR_EACH_VEC_ELT (tree, unparsed_nsdmis, ix, decl)
18195 if (class_type != DECL_CONTEXT (decl))
18198 pop_scope (pushed_scope);
18199 class_type = DECL_CONTEXT (decl);
18200 pushed_scope = push_scope (class_type);
18202 inject_this_parameter (class_type, TYPE_UNQUALIFIED);
18203 cp_parser_late_parsing_nsdmi (parser, decl);
18205 VEC_truncate (tree, unparsed_nsdmis, 0);
18206 current_class_ptr = save_ccp;
18207 current_class_ref = save_ccr;
18209 pop_scope (pushed_scope);
18210 /* Now parse the body of the functions. */
18211 FOR_EACH_VEC_ELT (tree, unparsed_funs_with_definitions, ix, decl)
18212 cp_parser_late_parsing_for_member (parser, decl);
18213 VEC_truncate (tree, unparsed_funs_with_definitions, 0);
18216 /* Put back any saved access checks. */
18217 pop_deferring_access_checks ();
18219 /* Restore saved state. */
18220 parser->in_switch_statement_p = in_switch_statement_p;
18221 parser->in_statement = in_statement;
18222 parser->in_function_body = saved_in_function_body;
18223 parser->num_template_parameter_lists
18224 = saved_num_template_parameter_lists;
18225 parser->in_unbraced_linkage_specification_p
18226 = saved_in_unbraced_linkage_specification_p;
18232 cp_parser_class_specifier (cp_parser* parser)
18235 timevar_push (TV_PARSE_STRUCT);
18236 ret = cp_parser_class_specifier_1 (parser);
18237 timevar_pop (TV_PARSE_STRUCT);
18241 /* Parse a class-head.
18244 class-key identifier [opt] base-clause [opt]
18245 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18246 class-key nested-name-specifier [opt] template-id
18249 class-virt-specifier:
18253 class-key attributes identifier [opt] base-clause [opt]
18254 class-key attributes nested-name-specifier identifier base-clause [opt]
18255 class-key attributes nested-name-specifier [opt] template-id
18258 Upon return BASES is initialized to the list of base classes (or
18259 NULL, if there are none) in the same form returned by
18260 cp_parser_base_clause.
18262 Returns the TYPE of the indicated class. Sets
18263 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18264 involving a nested-name-specifier was used, and FALSE otherwise.
18266 Returns error_mark_node if this is not a class-head.
18268 Returns NULL_TREE if the class-head is syntactically valid, but
18269 semantically invalid in a way that means we should skip the entire
18270 body of the class. */
18273 cp_parser_class_head (cp_parser* parser,
18274 bool* nested_name_specifier_p,
18275 tree *attributes_p,
18278 tree nested_name_specifier;
18279 enum tag_types class_key;
18280 tree id = NULL_TREE;
18281 tree type = NULL_TREE;
18283 cp_virt_specifiers virt_specifiers = VIRT_SPEC_UNSPECIFIED;
18284 bool template_id_p = false;
18285 bool qualified_p = false;
18286 bool invalid_nested_name_p = false;
18287 bool invalid_explicit_specialization_p = false;
18288 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
18289 tree pushed_scope = NULL_TREE;
18290 unsigned num_templates;
18291 cp_token *type_start_token = NULL, *nested_name_specifier_token_start = NULL;
18292 /* Assume no nested-name-specifier will be present. */
18293 *nested_name_specifier_p = false;
18294 /* Assume no template parameter lists will be used in defining the
18297 parser->colon_corrects_to_scope_p = false;
18299 *bases = NULL_TREE;
18301 /* Look for the class-key. */
18302 class_key = cp_parser_class_key (parser);
18303 if (class_key == none_type)
18304 return error_mark_node;
18306 /* Parse the attributes. */
18307 attributes = cp_parser_attributes_opt (parser);
18309 /* If the next token is `::', that is invalid -- but sometimes
18310 people do try to write:
18314 Handle this gracefully by accepting the extra qualifier, and then
18315 issuing an error about it later if this really is a
18316 class-head. If it turns out just to be an elaborated type
18317 specifier, remain silent. */
18318 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
18319 qualified_p = true;
18321 push_deferring_access_checks (dk_no_check);
18323 /* Determine the name of the class. Begin by looking for an
18324 optional nested-name-specifier. */
18325 nested_name_specifier_token_start = cp_lexer_peek_token (parser->lexer);
18326 nested_name_specifier
18327 = cp_parser_nested_name_specifier_opt (parser,
18328 /*typename_keyword_p=*/false,
18329 /*check_dependency_p=*/false,
18331 /*is_declaration=*/false);
18332 /* If there was a nested-name-specifier, then there *must* be an
18334 if (nested_name_specifier)
18336 type_start_token = cp_lexer_peek_token (parser->lexer);
18337 /* Although the grammar says `identifier', it really means
18338 `class-name' or `template-name'. You are only allowed to
18339 define a class that has already been declared with this
18342 The proposed resolution for Core Issue 180 says that wherever
18343 you see `class T::X' you should treat `X' as a type-name.
18345 It is OK to define an inaccessible class; for example:
18347 class A { class B; };
18350 We do not know if we will see a class-name, or a
18351 template-name. We look for a class-name first, in case the
18352 class-name is a template-id; if we looked for the
18353 template-name first we would stop after the template-name. */
18354 cp_parser_parse_tentatively (parser);
18355 type = cp_parser_class_name (parser,
18356 /*typename_keyword_p=*/false,
18357 /*template_keyword_p=*/false,
18359 /*check_dependency_p=*/false,
18360 /*class_head_p=*/true,
18361 /*is_declaration=*/false);
18362 /* If that didn't work, ignore the nested-name-specifier. */
18363 if (!cp_parser_parse_definitely (parser))
18365 invalid_nested_name_p = true;
18366 type_start_token = cp_lexer_peek_token (parser->lexer);
18367 id = cp_parser_identifier (parser);
18368 if (id == error_mark_node)
18371 /* If we could not find a corresponding TYPE, treat this
18372 declaration like an unqualified declaration. */
18373 if (type == error_mark_node)
18374 nested_name_specifier = NULL_TREE;
18375 /* Otherwise, count the number of templates used in TYPE and its
18376 containing scopes. */
18381 for (scope = TREE_TYPE (type);
18382 scope && TREE_CODE (scope) != NAMESPACE_DECL;
18383 scope = (TYPE_P (scope)
18384 ? TYPE_CONTEXT (scope)
18385 : DECL_CONTEXT (scope)))
18387 && CLASS_TYPE_P (scope)
18388 && CLASSTYPE_TEMPLATE_INFO (scope)
18389 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
18390 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
18394 /* Otherwise, the identifier is optional. */
18397 /* We don't know whether what comes next is a template-id,
18398 an identifier, or nothing at all. */
18399 cp_parser_parse_tentatively (parser);
18400 /* Check for a template-id. */
18401 type_start_token = cp_lexer_peek_token (parser->lexer);
18402 id = cp_parser_template_id (parser,
18403 /*template_keyword_p=*/false,
18404 /*check_dependency_p=*/true,
18405 /*is_declaration=*/true);
18406 /* If that didn't work, it could still be an identifier. */
18407 if (!cp_parser_parse_definitely (parser))
18409 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18411 type_start_token = cp_lexer_peek_token (parser->lexer);
18412 id = cp_parser_identifier (parser);
18419 template_id_p = true;
18424 pop_deferring_access_checks ();
18428 cp_parser_check_for_invalid_template_id (parser, id,
18429 type_start_token->location);
18431 virt_specifiers = cp_parser_virt_specifier_seq_opt (parser);
18433 /* If it's not a `:' or a `{' then we can't really be looking at a
18434 class-head, since a class-head only appears as part of a
18435 class-specifier. We have to detect this situation before calling
18436 xref_tag, since that has irreversible side-effects. */
18437 if (!cp_parser_next_token_starts_class_definition_p (parser))
18439 cp_parser_error (parser, "expected %<{%> or %<:%>");
18440 type = error_mark_node;
18444 /* At this point, we're going ahead with the class-specifier, even
18445 if some other problem occurs. */
18446 cp_parser_commit_to_tentative_parse (parser);
18447 if (virt_specifiers & VIRT_SPEC_OVERRIDE)
18449 cp_parser_error (parser,
18450 "cannot specify %<override%> for a class");
18451 type = error_mark_node;
18454 /* Issue the error about the overly-qualified name now. */
18457 cp_parser_error (parser,
18458 "global qualification of class name is invalid");
18459 type = error_mark_node;
18462 else if (invalid_nested_name_p)
18464 cp_parser_error (parser,
18465 "qualified name does not name a class");
18466 type = error_mark_node;
18469 else if (nested_name_specifier)
18473 /* Reject typedef-names in class heads. */
18474 if (!DECL_IMPLICIT_TYPEDEF_P (type))
18476 error_at (type_start_token->location,
18477 "invalid class name in declaration of %qD",
18483 /* Figure out in what scope the declaration is being placed. */
18484 scope = current_scope ();
18485 /* If that scope does not contain the scope in which the
18486 class was originally declared, the program is invalid. */
18487 if (scope && !is_ancestor (scope, nested_name_specifier))
18489 if (at_namespace_scope_p ())
18490 error_at (type_start_token->location,
18491 "declaration of %qD in namespace %qD which does not "
18493 type, scope, nested_name_specifier);
18495 error_at (type_start_token->location,
18496 "declaration of %qD in %qD which does not enclose %qD",
18497 type, scope, nested_name_specifier);
18503 A declarator-id shall not be qualified except for the
18504 definition of a ... nested class outside of its class
18505 ... [or] the definition or explicit instantiation of a
18506 class member of a namespace outside of its namespace. */
18507 if (scope == nested_name_specifier)
18509 permerror (nested_name_specifier_token_start->location,
18510 "extra qualification not allowed");
18511 nested_name_specifier = NULL_TREE;
18515 /* An explicit-specialization must be preceded by "template <>". If
18516 it is not, try to recover gracefully. */
18517 if (at_namespace_scope_p ()
18518 && parser->num_template_parameter_lists == 0
18521 error_at (type_start_token->location,
18522 "an explicit specialization must be preceded by %<template <>%>");
18523 invalid_explicit_specialization_p = true;
18524 /* Take the same action that would have been taken by
18525 cp_parser_explicit_specialization. */
18526 ++parser->num_template_parameter_lists;
18527 begin_specialization ();
18529 /* There must be no "return" statements between this point and the
18530 end of this function; set "type "to the correct return value and
18531 use "goto done;" to return. */
18532 /* Make sure that the right number of template parameters were
18534 if (!cp_parser_check_template_parameters (parser, num_templates,
18535 type_start_token->location,
18536 /*declarator=*/NULL))
18538 /* If something went wrong, there is no point in even trying to
18539 process the class-definition. */
18544 /* Look up the type. */
18547 if (TREE_CODE (id) == TEMPLATE_ID_EXPR
18548 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id, 0))
18549 || TREE_CODE (TREE_OPERAND (id, 0)) == OVERLOAD))
18551 error_at (type_start_token->location,
18552 "function template %qD redeclared as a class template", id);
18553 type = error_mark_node;
18557 type = TREE_TYPE (id);
18558 type = maybe_process_partial_specialization (type);
18560 if (nested_name_specifier)
18561 pushed_scope = push_scope (nested_name_specifier);
18563 else if (nested_name_specifier)
18569 template <typename T> struct S { struct T };
18570 template <typename T> struct S<T>::T { };
18572 we will get a TYPENAME_TYPE when processing the definition of
18573 `S::T'. We need to resolve it to the actual type before we
18574 try to define it. */
18575 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
18577 class_type = resolve_typename_type (TREE_TYPE (type),
18578 /*only_current_p=*/false);
18579 if (TREE_CODE (class_type) != TYPENAME_TYPE)
18580 type = TYPE_NAME (class_type);
18583 cp_parser_error (parser, "could not resolve typename type");
18584 type = error_mark_node;
18588 if (maybe_process_partial_specialization (TREE_TYPE (type))
18589 == error_mark_node)
18595 class_type = current_class_type;
18596 /* Enter the scope indicated by the nested-name-specifier. */
18597 pushed_scope = push_scope (nested_name_specifier);
18598 /* Get the canonical version of this type. */
18599 type = TYPE_MAIN_DECL (TREE_TYPE (type));
18600 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
18601 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
18603 type = push_template_decl (type);
18604 if (type == error_mark_node)
18611 type = TREE_TYPE (type);
18612 *nested_name_specifier_p = true;
18614 else /* The name is not a nested name. */
18616 /* If the class was unnamed, create a dummy name. */
18618 id = make_anon_name ();
18619 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
18620 parser->num_template_parameter_lists);
18623 /* Indicate whether this class was declared as a `class' or as a
18625 if (TREE_CODE (type) == RECORD_TYPE)
18626 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
18627 cp_parser_check_class_key (class_key, type);
18629 /* If this type was already complete, and we see another definition,
18630 that's an error. */
18631 if (type != error_mark_node && COMPLETE_TYPE_P (type))
18633 error_at (type_start_token->location, "redefinition of %q#T",
18635 error_at (type_start_token->location, "previous definition of %q+#T",
18640 else if (type == error_mark_node)
18643 /* We will have entered the scope containing the class; the names of
18644 base classes should be looked up in that context. For example:
18646 struct A { struct B {}; struct C; };
18647 struct A::C : B {};
18651 /* Get the list of base-classes, if there is one. */
18652 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
18653 *bases = cp_parser_base_clause (parser);
18656 /* Leave the scope given by the nested-name-specifier. We will
18657 enter the class scope itself while processing the members. */
18659 pop_scope (pushed_scope);
18661 if (invalid_explicit_specialization_p)
18663 end_specialization ();
18664 --parser->num_template_parameter_lists;
18668 DECL_SOURCE_LOCATION (TYPE_NAME (type)) = type_start_token->location;
18669 *attributes_p = attributes;
18670 if (type && (virt_specifiers & VIRT_SPEC_FINAL))
18671 CLASSTYPE_FINAL (type) = 1;
18673 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
18677 /* Parse a class-key.
18684 Returns the kind of class-key specified, or none_type to indicate
18687 static enum tag_types
18688 cp_parser_class_key (cp_parser* parser)
18691 enum tag_types tag_type;
18693 /* Look for the class-key. */
18694 token = cp_parser_require (parser, CPP_KEYWORD, RT_CLASS_KEY);
18698 /* Check to see if the TOKEN is a class-key. */
18699 tag_type = cp_parser_token_is_class_key (token);
18701 cp_parser_error (parser, "expected class-key");
18705 /* Parse an (optional) member-specification.
18707 member-specification:
18708 member-declaration member-specification [opt]
18709 access-specifier : member-specification [opt] */
18712 cp_parser_member_specification_opt (cp_parser* parser)
18719 /* Peek at the next token. */
18720 token = cp_lexer_peek_token (parser->lexer);
18721 /* If it's a `}', or EOF then we've seen all the members. */
18722 if (token->type == CPP_CLOSE_BRACE
18723 || token->type == CPP_EOF
18724 || token->type == CPP_PRAGMA_EOL)
18727 /* See if this token is a keyword. */
18728 keyword = token->keyword;
18732 case RID_PROTECTED:
18734 /* Consume the access-specifier. */
18735 cp_lexer_consume_token (parser->lexer);
18736 /* Remember which access-specifier is active. */
18737 current_access_specifier = token->u.value;
18738 /* Look for the `:'. */
18739 cp_parser_require (parser, CPP_COLON, RT_COLON);
18743 /* Accept #pragmas at class scope. */
18744 if (token->type == CPP_PRAGMA)
18746 cp_parser_pragma (parser, pragma_external);
18750 /* Otherwise, the next construction must be a
18751 member-declaration. */
18752 cp_parser_member_declaration (parser);
18757 /* Parse a member-declaration.
18759 member-declaration:
18760 decl-specifier-seq [opt] member-declarator-list [opt] ;
18761 function-definition ; [opt]
18762 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18764 template-declaration
18767 member-declarator-list:
18769 member-declarator-list , member-declarator
18772 declarator pure-specifier [opt]
18773 declarator constant-initializer [opt]
18774 identifier [opt] : constant-expression
18778 member-declaration:
18779 __extension__ member-declaration
18782 declarator attributes [opt] pure-specifier [opt]
18783 declarator attributes [opt] constant-initializer [opt]
18784 identifier [opt] attributes [opt] : constant-expression
18788 member-declaration:
18789 static_assert-declaration */
18792 cp_parser_member_declaration (cp_parser* parser)
18794 cp_decl_specifier_seq decl_specifiers;
18795 tree prefix_attributes;
18797 int declares_class_or_enum;
18799 cp_token *token = NULL;
18800 cp_token *decl_spec_token_start = NULL;
18801 cp_token *initializer_token_start = NULL;
18802 int saved_pedantic;
18803 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
18805 /* Check for the `__extension__' keyword. */
18806 if (cp_parser_extension_opt (parser, &saved_pedantic))
18809 cp_parser_member_declaration (parser);
18810 /* Restore the old value of the PEDANTIC flag. */
18811 pedantic = saved_pedantic;
18816 /* Check for a template-declaration. */
18817 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
18819 /* An explicit specialization here is an error condition, and we
18820 expect the specialization handler to detect and report this. */
18821 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
18822 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
18823 cp_parser_explicit_specialization (parser);
18825 cp_parser_template_declaration (parser, /*member_p=*/true);
18830 /* Check for a using-declaration. */
18831 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
18833 if (cxx_dialect < cxx0x)
18835 /* Parse the using-declaration. */
18836 cp_parser_using_declaration (parser,
18837 /*access_declaration_p=*/false);
18843 cp_parser_parse_tentatively (parser);
18844 decl = cp_parser_alias_declaration (parser);
18845 if (cp_parser_parse_definitely (parser))
18846 finish_member_declaration (decl);
18848 cp_parser_using_declaration (parser,
18849 /*access_declaration_p=*/false);
18854 /* Check for @defs. */
18855 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
18858 tree ivar_chains = cp_parser_objc_defs_expression (parser);
18859 ivar = ivar_chains;
18863 ivar = TREE_CHAIN (member);
18864 TREE_CHAIN (member) = NULL_TREE;
18865 finish_member_declaration (member);
18870 /* If the next token is `static_assert' we have a static assertion. */
18871 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC_ASSERT))
18873 cp_parser_static_assert (parser, /*member_p=*/true);
18877 parser->colon_corrects_to_scope_p = false;
18879 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
18882 /* Parse the decl-specifier-seq. */
18883 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
18884 cp_parser_decl_specifier_seq (parser,
18885 CP_PARSER_FLAGS_OPTIONAL,
18887 &declares_class_or_enum);
18888 prefix_attributes = decl_specifiers.attributes;
18889 decl_specifiers.attributes = NULL_TREE;
18890 /* Check for an invalid type-name. */
18891 if (!decl_specifiers.any_type_specifiers_p
18892 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
18894 /* If there is no declarator, then the decl-specifier-seq should
18896 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
18898 /* If there was no decl-specifier-seq, and the next token is a
18899 `;', then we have something like:
18905 Each member-declaration shall declare at least one member
18906 name of the class. */
18907 if (!decl_specifiers.any_specifiers_p)
18909 cp_token *token = cp_lexer_peek_token (parser->lexer);
18910 if (!in_system_header_at (token->location))
18911 pedwarn (token->location, OPT_pedantic, "extra %<;%>");
18917 /* See if this declaration is a friend. */
18918 friend_p = cp_parser_friend_p (&decl_specifiers);
18919 /* If there were decl-specifiers, check to see if there was
18920 a class-declaration. */
18921 type = check_tag_decl (&decl_specifiers);
18922 /* Nested classes have already been added to the class, but
18923 a `friend' needs to be explicitly registered. */
18926 /* If the `friend' keyword was present, the friend must
18927 be introduced with a class-key. */
18928 if (!declares_class_or_enum && cxx_dialect < cxx0x)
18929 pedwarn (decl_spec_token_start->location, OPT_pedantic,
18930 "in C++03 a class-key must be used "
18931 "when declaring a friend");
18934 template <typename T> struct A {
18935 friend struct A<T>::B;
18938 A<T>::B will be represented by a TYPENAME_TYPE, and
18939 therefore not recognized by check_tag_decl. */
18942 type = decl_specifiers.type;
18943 if (type && TREE_CODE (type) == TYPE_DECL)
18944 type = TREE_TYPE (type);
18946 if (!type || !TYPE_P (type))
18947 error_at (decl_spec_token_start->location,
18948 "friend declaration does not name a class or "
18951 make_friend_class (current_class_type, type,
18952 /*complain=*/true);
18954 /* If there is no TYPE, an error message will already have
18956 else if (!type || type == error_mark_node)
18958 /* An anonymous aggregate has to be handled specially; such
18959 a declaration really declares a data member (with a
18960 particular type), as opposed to a nested class. */
18961 else if (ANON_AGGR_TYPE_P (type))
18963 /* Remove constructors and such from TYPE, now that we
18964 know it is an anonymous aggregate. */
18965 fixup_anonymous_aggr (type);
18966 /* And make the corresponding data member. */
18967 decl = build_decl (decl_spec_token_start->location,
18968 FIELD_DECL, NULL_TREE, type);
18969 /* Add it to the class. */
18970 finish_member_declaration (decl);
18973 cp_parser_check_access_in_redeclaration
18975 decl_spec_token_start->location);
18980 bool assume_semicolon = false;
18982 /* See if these declarations will be friends. */
18983 friend_p = cp_parser_friend_p (&decl_specifiers);
18985 /* Keep going until we hit the `;' at the end of the
18987 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18989 tree attributes = NULL_TREE;
18990 tree first_attribute;
18992 /* Peek at the next token. */
18993 token = cp_lexer_peek_token (parser->lexer);
18995 /* Check for a bitfield declaration. */
18996 if (token->type == CPP_COLON
18997 || (token->type == CPP_NAME
18998 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
19004 /* Get the name of the bitfield. Note that we cannot just
19005 check TOKEN here because it may have been invalidated by
19006 the call to cp_lexer_peek_nth_token above. */
19007 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
19008 identifier = cp_parser_identifier (parser);
19010 identifier = NULL_TREE;
19012 /* Consume the `:' token. */
19013 cp_lexer_consume_token (parser->lexer);
19014 /* Get the width of the bitfield. */
19016 = cp_parser_constant_expression (parser,
19017 /*allow_non_constant=*/false,
19020 /* Look for attributes that apply to the bitfield. */
19021 attributes = cp_parser_attributes_opt (parser);
19022 /* Remember which attributes are prefix attributes and
19024 first_attribute = attributes;
19025 /* Combine the attributes. */
19026 attributes = chainon (prefix_attributes, attributes);
19028 /* Create the bitfield declaration. */
19029 decl = grokbitfield (identifier
19030 ? make_id_declarator (NULL_TREE,
19040 cp_declarator *declarator;
19042 tree asm_specification;
19043 int ctor_dtor_or_conv_p;
19045 /* Parse the declarator. */
19047 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
19048 &ctor_dtor_or_conv_p,
19049 /*parenthesized_p=*/NULL,
19050 /*member_p=*/true);
19052 /* If something went wrong parsing the declarator, make sure
19053 that we at least consume some tokens. */
19054 if (declarator == cp_error_declarator)
19056 /* Skip to the end of the statement. */
19057 cp_parser_skip_to_end_of_statement (parser);
19058 /* If the next token is not a semicolon, that is
19059 probably because we just skipped over the body of
19060 a function. So, we consume a semicolon if
19061 present, but do not issue an error message if it
19063 if (cp_lexer_next_token_is (parser->lexer,
19065 cp_lexer_consume_token (parser->lexer);
19069 if (declares_class_or_enum & 2)
19070 cp_parser_check_for_definition_in_return_type
19071 (declarator, decl_specifiers.type,
19072 decl_specifiers.type_location);
19074 /* Look for an asm-specification. */
19075 asm_specification = cp_parser_asm_specification_opt (parser);
19076 /* Look for attributes that apply to the declaration. */
19077 attributes = cp_parser_attributes_opt (parser);
19078 /* Remember which attributes are prefix attributes and
19080 first_attribute = attributes;
19081 /* Combine the attributes. */
19082 attributes = chainon (prefix_attributes, attributes);
19084 /* If it's an `=', then we have a constant-initializer or a
19085 pure-specifier. It is not correct to parse the
19086 initializer before registering the member declaration
19087 since the member declaration should be in scope while
19088 its initializer is processed. However, the rest of the
19089 front end does not yet provide an interface that allows
19090 us to handle this correctly. */
19091 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
19095 A pure-specifier shall be used only in the declaration of
19096 a virtual function.
19098 A member-declarator can contain a constant-initializer
19099 only if it declares a static member of integral or
19102 Therefore, if the DECLARATOR is for a function, we look
19103 for a pure-specifier; otherwise, we look for a
19104 constant-initializer. When we call `grokfield', it will
19105 perform more stringent semantics checks. */
19106 initializer_token_start = cp_lexer_peek_token (parser->lexer);
19107 if (function_declarator_p (declarator)
19108 || (decl_specifiers.type
19109 && TREE_CODE (decl_specifiers.type) == TYPE_DECL
19110 && (TREE_CODE (TREE_TYPE (decl_specifiers.type))
19111 == FUNCTION_TYPE)))
19112 initializer = cp_parser_pure_specifier (parser);
19113 else if (decl_specifiers.storage_class != sc_static)
19114 initializer = cp_parser_save_nsdmi (parser);
19115 else if (cxx_dialect >= cxx0x)
19118 /* Don't require a constant rvalue in C++11, since we
19119 might want a reference constant. We'll enforce
19120 constancy later. */
19121 cp_lexer_consume_token (parser->lexer);
19122 /* Parse the initializer. */
19123 initializer = cp_parser_initializer_clause (parser,
19127 /* Parse the initializer. */
19128 initializer = cp_parser_constant_initializer (parser);
19130 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE)
19131 && !function_declarator_p (declarator))
19134 if (decl_specifiers.storage_class != sc_static)
19135 initializer = cp_parser_save_nsdmi (parser);
19137 initializer = cp_parser_initializer (parser, &x, &x);
19139 /* Otherwise, there is no initializer. */
19141 initializer = NULL_TREE;
19143 /* See if we are probably looking at a function
19144 definition. We are certainly not looking at a
19145 member-declarator. Calling `grokfield' has
19146 side-effects, so we must not do it unless we are sure
19147 that we are looking at a member-declarator. */
19148 if (cp_parser_token_starts_function_definition_p
19149 (cp_lexer_peek_token (parser->lexer)))
19151 /* The grammar does not allow a pure-specifier to be
19152 used when a member function is defined. (It is
19153 possible that this fact is an oversight in the
19154 standard, since a pure function may be defined
19155 outside of the class-specifier. */
19157 error_at (initializer_token_start->location,
19158 "pure-specifier on function-definition");
19159 decl = cp_parser_save_member_function_body (parser,
19163 /* If the member was not a friend, declare it here. */
19165 finish_member_declaration (decl);
19166 /* Peek at the next token. */
19167 token = cp_lexer_peek_token (parser->lexer);
19168 /* If the next token is a semicolon, consume it. */
19169 if (token->type == CPP_SEMICOLON)
19170 cp_lexer_consume_token (parser->lexer);
19174 if (declarator->kind == cdk_function)
19175 declarator->id_loc = token->location;
19176 /* Create the declaration. */
19177 decl = grokfield (declarator, &decl_specifiers,
19178 initializer, /*init_const_expr_p=*/true,
19183 /* Reset PREFIX_ATTRIBUTES. */
19184 while (attributes && TREE_CHAIN (attributes) != first_attribute)
19185 attributes = TREE_CHAIN (attributes);
19187 TREE_CHAIN (attributes) = NULL_TREE;
19189 /* If there is any qualification still in effect, clear it
19190 now; we will be starting fresh with the next declarator. */
19191 parser->scope = NULL_TREE;
19192 parser->qualifying_scope = NULL_TREE;
19193 parser->object_scope = NULL_TREE;
19194 /* If it's a `,', then there are more declarators. */
19195 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
19196 cp_lexer_consume_token (parser->lexer);
19197 /* If the next token isn't a `;', then we have a parse error. */
19198 else if (cp_lexer_next_token_is_not (parser->lexer,
19201 /* The next token might be a ways away from where the
19202 actual semicolon is missing. Find the previous token
19203 and use that for our error position. */
19204 cp_token *token = cp_lexer_previous_token (parser->lexer);
19205 error_at (token->location,
19206 "expected %<;%> at end of member declaration");
19208 /* Assume that the user meant to provide a semicolon. If
19209 we were to cp_parser_skip_to_end_of_statement, we might
19210 skip to a semicolon inside a member function definition
19211 and issue nonsensical error messages. */
19212 assume_semicolon = true;
19217 /* Add DECL to the list of members. */
19219 finish_member_declaration (decl);
19221 if (TREE_CODE (decl) == FUNCTION_DECL)
19222 cp_parser_save_default_args (parser, decl);
19223 else if (TREE_CODE (decl) == FIELD_DECL
19224 && !DECL_C_BIT_FIELD (decl)
19225 && DECL_INITIAL (decl))
19226 /* Add DECL to the queue of NSDMI to be parsed later. */
19227 VEC_safe_push (tree, gc, unparsed_nsdmis, decl);
19230 if (assume_semicolon)
19235 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
19237 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
19240 /* Parse a pure-specifier.
19245 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19246 Otherwise, ERROR_MARK_NODE is returned. */
19249 cp_parser_pure_specifier (cp_parser* parser)
19253 /* Look for the `=' token. */
19254 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
19255 return error_mark_node;
19256 /* Look for the `0' token. */
19257 token = cp_lexer_peek_token (parser->lexer);
19259 if (token->type == CPP_EOF
19260 || token->type == CPP_PRAGMA_EOL)
19261 return error_mark_node;
19263 cp_lexer_consume_token (parser->lexer);
19265 /* Accept = default or = delete in c++0x mode. */
19266 if (token->keyword == RID_DEFAULT
19267 || token->keyword == RID_DELETE)
19269 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED);
19270 return token->u.value;
19273 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19274 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
19276 cp_parser_error (parser,
19277 "invalid pure specifier (only %<= 0%> is allowed)");
19278 cp_parser_skip_to_end_of_statement (parser);
19279 return error_mark_node;
19281 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
19283 error_at (token->location, "templates may not be %<virtual%>");
19284 return error_mark_node;
19287 return integer_zero_node;
19290 /* Parse a constant-initializer.
19292 constant-initializer:
19293 = constant-expression
19295 Returns a representation of the constant-expression. */
19298 cp_parser_constant_initializer (cp_parser* parser)
19300 /* Look for the `=' token. */
19301 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
19302 return error_mark_node;
19304 /* It is invalid to write:
19306 struct S { static const int i = { 7 }; };
19309 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
19311 cp_parser_error (parser,
19312 "a brace-enclosed initializer is not allowed here");
19313 /* Consume the opening brace. */
19314 cp_lexer_consume_token (parser->lexer);
19315 /* Skip the initializer. */
19316 cp_parser_skip_to_closing_brace (parser);
19317 /* Look for the trailing `}'. */
19318 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
19320 return error_mark_node;
19323 return cp_parser_constant_expression (parser,
19324 /*allow_non_constant=*/false,
19328 /* Derived classes [gram.class.derived] */
19330 /* Parse a base-clause.
19333 : base-specifier-list
19335 base-specifier-list:
19336 base-specifier ... [opt]
19337 base-specifier-list , base-specifier ... [opt]
19339 Returns a TREE_LIST representing the base-classes, in the order in
19340 which they were declared. The representation of each node is as
19341 described by cp_parser_base_specifier.
19343 In the case that no bases are specified, this function will return
19344 NULL_TREE, not ERROR_MARK_NODE. */
19347 cp_parser_base_clause (cp_parser* parser)
19349 tree bases = NULL_TREE;
19351 /* Look for the `:' that begins the list. */
19352 cp_parser_require (parser, CPP_COLON, RT_COLON);
19354 /* Scan the base-specifier-list. */
19359 bool pack_expansion_p = false;
19361 /* Look for the base-specifier. */
19362 base = cp_parser_base_specifier (parser);
19363 /* Look for the (optional) ellipsis. */
19364 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
19366 /* Consume the `...'. */
19367 cp_lexer_consume_token (parser->lexer);
19369 pack_expansion_p = true;
19372 /* Add BASE to the front of the list. */
19373 if (base && base != error_mark_node)
19375 if (pack_expansion_p)
19376 /* Make this a pack expansion type. */
19377 TREE_VALUE (base) = make_pack_expansion (TREE_VALUE (base));
19379 if (!check_for_bare_parameter_packs (TREE_VALUE (base)))
19381 TREE_CHAIN (base) = bases;
19385 /* Peek at the next token. */
19386 token = cp_lexer_peek_token (parser->lexer);
19387 /* If it's not a comma, then the list is complete. */
19388 if (token->type != CPP_COMMA)
19390 /* Consume the `,'. */
19391 cp_lexer_consume_token (parser->lexer);
19394 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19395 base class had a qualified name. However, the next name that
19396 appears is certainly not qualified. */
19397 parser->scope = NULL_TREE;
19398 parser->qualifying_scope = NULL_TREE;
19399 parser->object_scope = NULL_TREE;
19401 return nreverse (bases);
19404 /* Parse a base-specifier.
19407 :: [opt] nested-name-specifier [opt] class-name
19408 virtual access-specifier [opt] :: [opt] nested-name-specifier
19410 access-specifier virtual [opt] :: [opt] nested-name-specifier
19413 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19414 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19415 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19416 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19419 cp_parser_base_specifier (cp_parser* parser)
19423 bool virtual_p = false;
19424 bool duplicate_virtual_error_issued_p = false;
19425 bool duplicate_access_error_issued_p = false;
19426 bool class_scope_p, template_p;
19427 tree access = access_default_node;
19430 /* Process the optional `virtual' and `access-specifier'. */
19433 /* Peek at the next token. */
19434 token = cp_lexer_peek_token (parser->lexer);
19435 /* Process `virtual'. */
19436 switch (token->keyword)
19439 /* If `virtual' appears more than once, issue an error. */
19440 if (virtual_p && !duplicate_virtual_error_issued_p)
19442 cp_parser_error (parser,
19443 "%<virtual%> specified more than once in base-specified");
19444 duplicate_virtual_error_issued_p = true;
19449 /* Consume the `virtual' token. */
19450 cp_lexer_consume_token (parser->lexer);
19455 case RID_PROTECTED:
19457 /* If more than one access specifier appears, issue an
19459 if (access != access_default_node
19460 && !duplicate_access_error_issued_p)
19462 cp_parser_error (parser,
19463 "more than one access specifier in base-specified");
19464 duplicate_access_error_issued_p = true;
19467 access = ridpointers[(int) token->keyword];
19469 /* Consume the access-specifier. */
19470 cp_lexer_consume_token (parser->lexer);
19479 /* It is not uncommon to see programs mechanically, erroneously, use
19480 the 'typename' keyword to denote (dependent) qualified types
19481 as base classes. */
19482 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
19484 token = cp_lexer_peek_token (parser->lexer);
19485 if (!processing_template_decl)
19486 error_at (token->location,
19487 "keyword %<typename%> not allowed outside of templates");
19489 error_at (token->location,
19490 "keyword %<typename%> not allowed in this context "
19491 "(the base class is implicitly a type)");
19492 cp_lexer_consume_token (parser->lexer);
19495 /* Look for the optional `::' operator. */
19496 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
19497 /* Look for the nested-name-specifier. The simplest way to
19502 The keyword `typename' is not permitted in a base-specifier or
19503 mem-initializer; in these contexts a qualified name that
19504 depends on a template-parameter is implicitly assumed to be a
19507 is to pretend that we have seen the `typename' keyword at this
19509 cp_parser_nested_name_specifier_opt (parser,
19510 /*typename_keyword_p=*/true,
19511 /*check_dependency_p=*/true,
19513 /*is_declaration=*/true);
19514 /* If the base class is given by a qualified name, assume that names
19515 we see are type names or templates, as appropriate. */
19516 class_scope_p = (parser->scope && TYPE_P (parser->scope));
19517 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
19520 && cp_lexer_next_token_is_decltype (parser->lexer))
19521 /* DR 950 allows decltype as a base-specifier. */
19522 type = cp_parser_decltype (parser);
19525 /* Otherwise, look for the class-name. */
19526 type = cp_parser_class_name (parser,
19530 /*check_dependency_p=*/true,
19531 /*class_head_p=*/false,
19532 /*is_declaration=*/true);
19533 type = TREE_TYPE (type);
19536 if (type == error_mark_node)
19537 return error_mark_node;
19539 return finish_base_specifier (type, access, virtual_p);
19542 /* Exception handling [gram.exception] */
19544 /* Parse an (optional) exception-specification.
19546 exception-specification:
19547 throw ( type-id-list [opt] )
19549 Returns a TREE_LIST representing the exception-specification. The
19550 TREE_VALUE of each node is a type. */
19553 cp_parser_exception_specification_opt (cp_parser* parser)
19557 const char *saved_message;
19559 /* Peek at the next token. */
19560 token = cp_lexer_peek_token (parser->lexer);
19562 /* Is it a noexcept-specification? */
19563 if (cp_parser_is_keyword (token, RID_NOEXCEPT))
19566 cp_lexer_consume_token (parser->lexer);
19568 if (cp_lexer_peek_token (parser->lexer)->type == CPP_OPEN_PAREN)
19570 cp_lexer_consume_token (parser->lexer);
19572 /* Types may not be defined in an exception-specification. */
19573 saved_message = parser->type_definition_forbidden_message;
19574 parser->type_definition_forbidden_message
19575 = G_("types may not be defined in an exception-specification");
19577 expr = cp_parser_constant_expression (parser, false, NULL);
19579 /* Restore the saved message. */
19580 parser->type_definition_forbidden_message = saved_message;
19582 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19585 expr = boolean_true_node;
19587 return build_noexcept_spec (expr, tf_warning_or_error);
19590 /* If it's not `throw', then there's no exception-specification. */
19591 if (!cp_parser_is_keyword (token, RID_THROW))
19595 /* Enable this once a lot of code has transitioned to noexcept? */
19596 if (cxx_dialect == cxx0x && !in_system_header)
19597 warning (OPT_Wdeprecated, "dynamic exception specifications are "
19598 "deprecated in C++0x; use %<noexcept%> instead");
19601 /* Consume the `throw'. */
19602 cp_lexer_consume_token (parser->lexer);
19604 /* Look for the `('. */
19605 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19607 /* Peek at the next token. */
19608 token = cp_lexer_peek_token (parser->lexer);
19609 /* If it's not a `)', then there is a type-id-list. */
19610 if (token->type != CPP_CLOSE_PAREN)
19612 /* Types may not be defined in an exception-specification. */
19613 saved_message = parser->type_definition_forbidden_message;
19614 parser->type_definition_forbidden_message
19615 = G_("types may not be defined in an exception-specification");
19616 /* Parse the type-id-list. */
19617 type_id_list = cp_parser_type_id_list (parser);
19618 /* Restore the saved message. */
19619 parser->type_definition_forbidden_message = saved_message;
19622 type_id_list = empty_except_spec;
19624 /* Look for the `)'. */
19625 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19627 return type_id_list;
19630 /* Parse an (optional) type-id-list.
19634 type-id-list , type-id ... [opt]
19636 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19637 in the order that the types were presented. */
19640 cp_parser_type_id_list (cp_parser* parser)
19642 tree types = NULL_TREE;
19649 /* Get the next type-id. */
19650 type = cp_parser_type_id (parser);
19651 /* Parse the optional ellipsis. */
19652 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
19654 /* Consume the `...'. */
19655 cp_lexer_consume_token (parser->lexer);
19657 /* Turn the type into a pack expansion expression. */
19658 type = make_pack_expansion (type);
19660 /* Add it to the list. */
19661 types = add_exception_specifier (types, type, /*complain=*/1);
19662 /* Peek at the next token. */
19663 token = cp_lexer_peek_token (parser->lexer);
19664 /* If it is not a `,', we are done. */
19665 if (token->type != CPP_COMMA)
19667 /* Consume the `,'. */
19668 cp_lexer_consume_token (parser->lexer);
19671 return nreverse (types);
19674 /* Parse a try-block.
19677 try compound-statement handler-seq */
19680 cp_parser_try_block (cp_parser* parser)
19684 cp_parser_require_keyword (parser, RID_TRY, RT_TRY);
19685 try_block = begin_try_block ();
19686 cp_parser_compound_statement (parser, NULL, true, false);
19687 finish_try_block (try_block);
19688 cp_parser_handler_seq (parser);
19689 finish_handler_sequence (try_block);
19694 /* Parse a function-try-block.
19696 function-try-block:
19697 try ctor-initializer [opt] function-body handler-seq */
19700 cp_parser_function_try_block (cp_parser* parser)
19702 tree compound_stmt;
19704 bool ctor_initializer_p;
19706 /* Look for the `try' keyword. */
19707 if (!cp_parser_require_keyword (parser, RID_TRY, RT_TRY))
19709 /* Let the rest of the front end know where we are. */
19710 try_block = begin_function_try_block (&compound_stmt);
19711 /* Parse the function-body. */
19713 = cp_parser_ctor_initializer_opt_and_function_body (parser);
19714 /* We're done with the `try' part. */
19715 finish_function_try_block (try_block);
19716 /* Parse the handlers. */
19717 cp_parser_handler_seq (parser);
19718 /* We're done with the handlers. */
19719 finish_function_handler_sequence (try_block, compound_stmt);
19721 return ctor_initializer_p;
19724 /* Parse a handler-seq.
19727 handler handler-seq [opt] */
19730 cp_parser_handler_seq (cp_parser* parser)
19736 /* Parse the handler. */
19737 cp_parser_handler (parser);
19738 /* Peek at the next token. */
19739 token = cp_lexer_peek_token (parser->lexer);
19740 /* If it's not `catch' then there are no more handlers. */
19741 if (!cp_parser_is_keyword (token, RID_CATCH))
19746 /* Parse a handler.
19749 catch ( exception-declaration ) compound-statement */
19752 cp_parser_handler (cp_parser* parser)
19757 cp_parser_require_keyword (parser, RID_CATCH, RT_CATCH);
19758 handler = begin_handler ();
19759 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19760 declaration = cp_parser_exception_declaration (parser);
19761 finish_handler_parms (declaration, handler);
19762 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19763 cp_parser_compound_statement (parser, NULL, false, false);
19764 finish_handler (handler);
19767 /* Parse an exception-declaration.
19769 exception-declaration:
19770 type-specifier-seq declarator
19771 type-specifier-seq abstract-declarator
19775 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19776 ellipsis variant is used. */
19779 cp_parser_exception_declaration (cp_parser* parser)
19781 cp_decl_specifier_seq type_specifiers;
19782 cp_declarator *declarator;
19783 const char *saved_message;
19785 /* If it's an ellipsis, it's easy to handle. */
19786 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
19788 /* Consume the `...' token. */
19789 cp_lexer_consume_token (parser->lexer);
19793 /* Types may not be defined in exception-declarations. */
19794 saved_message = parser->type_definition_forbidden_message;
19795 parser->type_definition_forbidden_message
19796 = G_("types may not be defined in exception-declarations");
19798 /* Parse the type-specifier-seq. */
19799 cp_parser_type_specifier_seq (parser, /*is_declaration=*/true,
19800 /*is_trailing_return=*/false,
19802 /* If it's a `)', then there is no declarator. */
19803 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
19806 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
19807 /*ctor_dtor_or_conv_p=*/NULL,
19808 /*parenthesized_p=*/NULL,
19809 /*member_p=*/false);
19811 /* Restore the saved message. */
19812 parser->type_definition_forbidden_message = saved_message;
19814 if (!type_specifiers.any_specifiers_p)
19815 return error_mark_node;
19817 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
19820 /* Parse a throw-expression.
19823 throw assignment-expression [opt]
19825 Returns a THROW_EXPR representing the throw-expression. */
19828 cp_parser_throw_expression (cp_parser* parser)
19833 cp_parser_require_keyword (parser, RID_THROW, RT_THROW);
19834 token = cp_lexer_peek_token (parser->lexer);
19835 /* Figure out whether or not there is an assignment-expression
19836 following the "throw" keyword. */
19837 if (token->type == CPP_COMMA
19838 || token->type == CPP_SEMICOLON
19839 || token->type == CPP_CLOSE_PAREN
19840 || token->type == CPP_CLOSE_SQUARE
19841 || token->type == CPP_CLOSE_BRACE
19842 || token->type == CPP_COLON)
19843 expression = NULL_TREE;
19845 expression = cp_parser_assignment_expression (parser,
19846 /*cast_p=*/false, NULL);
19848 return build_throw (expression);
19851 /* GNU Extensions */
19853 /* Parse an (optional) asm-specification.
19856 asm ( string-literal )
19858 If the asm-specification is present, returns a STRING_CST
19859 corresponding to the string-literal. Otherwise, returns
19863 cp_parser_asm_specification_opt (cp_parser* parser)
19866 tree asm_specification;
19868 /* Peek at the next token. */
19869 token = cp_lexer_peek_token (parser->lexer);
19870 /* If the next token isn't the `asm' keyword, then there's no
19871 asm-specification. */
19872 if (!cp_parser_is_keyword (token, RID_ASM))
19875 /* Consume the `asm' token. */
19876 cp_lexer_consume_token (parser->lexer);
19877 /* Look for the `('. */
19878 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19880 /* Look for the string-literal. */
19881 asm_specification = cp_parser_string_literal (parser, false, false);
19883 /* Look for the `)'. */
19884 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19886 return asm_specification;
19889 /* Parse an asm-operand-list.
19893 asm-operand-list , asm-operand
19896 string-literal ( expression )
19897 [ string-literal ] string-literal ( expression )
19899 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19900 each node is the expression. The TREE_PURPOSE is itself a
19901 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19902 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19903 is a STRING_CST for the string literal before the parenthesis. Returns
19904 ERROR_MARK_NODE if any of the operands are invalid. */
19907 cp_parser_asm_operand_list (cp_parser* parser)
19909 tree asm_operands = NULL_TREE;
19910 bool invalid_operands = false;
19914 tree string_literal;
19918 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
19920 /* Consume the `[' token. */
19921 cp_lexer_consume_token (parser->lexer);
19922 /* Read the operand name. */
19923 name = cp_parser_identifier (parser);
19924 if (name != error_mark_node)
19925 name = build_string (IDENTIFIER_LENGTH (name),
19926 IDENTIFIER_POINTER (name));
19927 /* Look for the closing `]'. */
19928 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
19932 /* Look for the string-literal. */
19933 string_literal = cp_parser_string_literal (parser, false, false);
19935 /* Look for the `('. */
19936 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19937 /* Parse the expression. */
19938 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
19939 /* Look for the `)'. */
19940 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19942 if (name == error_mark_node
19943 || string_literal == error_mark_node
19944 || expression == error_mark_node)
19945 invalid_operands = true;
19947 /* Add this operand to the list. */
19948 asm_operands = tree_cons (build_tree_list (name, string_literal),
19951 /* If the next token is not a `,', there are no more
19953 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
19955 /* Consume the `,'. */
19956 cp_lexer_consume_token (parser->lexer);
19959 return invalid_operands ? error_mark_node : nreverse (asm_operands);
19962 /* Parse an asm-clobber-list.
19966 asm-clobber-list , string-literal
19968 Returns a TREE_LIST, indicating the clobbers in the order that they
19969 appeared. The TREE_VALUE of each node is a STRING_CST. */
19972 cp_parser_asm_clobber_list (cp_parser* parser)
19974 tree clobbers = NULL_TREE;
19978 tree string_literal;
19980 /* Look for the string literal. */
19981 string_literal = cp_parser_string_literal (parser, false, false);
19982 /* Add it to the list. */
19983 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
19984 /* If the next token is not a `,', then the list is
19986 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
19988 /* Consume the `,' token. */
19989 cp_lexer_consume_token (parser->lexer);
19995 /* Parse an asm-label-list.
19999 asm-label-list , identifier
20001 Returns a TREE_LIST, indicating the labels in the order that they
20002 appeared. The TREE_VALUE of each node is a label. */
20005 cp_parser_asm_label_list (cp_parser* parser)
20007 tree labels = NULL_TREE;
20011 tree identifier, label, name;
20013 /* Look for the identifier. */
20014 identifier = cp_parser_identifier (parser);
20015 if (!error_operand_p (identifier))
20017 label = lookup_label (identifier);
20018 if (TREE_CODE (label) == LABEL_DECL)
20020 TREE_USED (label) = 1;
20021 check_goto (label);
20022 name = build_string (IDENTIFIER_LENGTH (identifier),
20023 IDENTIFIER_POINTER (identifier));
20024 labels = tree_cons (name, label, labels);
20027 /* If the next token is not a `,', then the list is
20029 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
20031 /* Consume the `,' token. */
20032 cp_lexer_consume_token (parser->lexer);
20035 return nreverse (labels);
20038 /* Parse an (optional) series of attributes.
20041 attributes attribute
20044 __attribute__ (( attribute-list [opt] ))
20046 The return value is as for cp_parser_attribute_list. */
20049 cp_parser_attributes_opt (cp_parser* parser)
20051 tree attributes = NULL_TREE;
20056 tree attribute_list;
20058 /* Peek at the next token. */
20059 token = cp_lexer_peek_token (parser->lexer);
20060 /* If it's not `__attribute__', then we're done. */
20061 if (token->keyword != RID_ATTRIBUTE)
20064 /* Consume the `__attribute__' keyword. */
20065 cp_lexer_consume_token (parser->lexer);
20066 /* Look for the two `(' tokens. */
20067 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
20068 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
20070 /* Peek at the next token. */
20071 token = cp_lexer_peek_token (parser->lexer);
20072 if (token->type != CPP_CLOSE_PAREN)
20073 /* Parse the attribute-list. */
20074 attribute_list = cp_parser_attribute_list (parser);
20076 /* If the next token is a `)', then there is no attribute
20078 attribute_list = NULL;
20080 /* Look for the two `)' tokens. */
20081 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
20082 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
20084 /* Add these new attributes to the list. */
20085 attributes = chainon (attributes, attribute_list);
20091 /* Parse an attribute-list.
20095 attribute-list , attribute
20099 identifier ( identifier )
20100 identifier ( identifier , expression-list )
20101 identifier ( expression-list )
20103 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20104 to an attribute. The TREE_PURPOSE of each node is the identifier
20105 indicating which attribute is in use. The TREE_VALUE represents
20106 the arguments, if any. */
20109 cp_parser_attribute_list (cp_parser* parser)
20111 tree attribute_list = NULL_TREE;
20112 bool save_translate_strings_p = parser->translate_strings_p;
20114 parser->translate_strings_p = false;
20121 /* Look for the identifier. We also allow keywords here; for
20122 example `__attribute__ ((const))' is legal. */
20123 token = cp_lexer_peek_token (parser->lexer);
20124 if (token->type == CPP_NAME
20125 || token->type == CPP_KEYWORD)
20127 tree arguments = NULL_TREE;
20129 /* Consume the token. */
20130 token = cp_lexer_consume_token (parser->lexer);
20132 /* Save away the identifier that indicates which attribute
20134 identifier = (token->type == CPP_KEYWORD)
20135 /* For keywords, use the canonical spelling, not the
20136 parsed identifier. */
20137 ? ridpointers[(int) token->keyword]
20140 attribute = build_tree_list (identifier, NULL_TREE);
20142 /* Peek at the next token. */
20143 token = cp_lexer_peek_token (parser->lexer);
20144 /* If it's an `(', then parse the attribute arguments. */
20145 if (token->type == CPP_OPEN_PAREN)
20148 int attr_flag = (attribute_takes_identifier_p (identifier)
20149 ? id_attr : normal_attr);
20150 vec = cp_parser_parenthesized_expression_list
20151 (parser, attr_flag, /*cast_p=*/false,
20152 /*allow_expansion_p=*/false,
20153 /*non_constant_p=*/NULL);
20155 arguments = error_mark_node;
20158 arguments = build_tree_list_vec (vec);
20159 release_tree_vector (vec);
20161 /* Save the arguments away. */
20162 TREE_VALUE (attribute) = arguments;
20165 if (arguments != error_mark_node)
20167 /* Add this attribute to the list. */
20168 TREE_CHAIN (attribute) = attribute_list;
20169 attribute_list = attribute;
20172 token = cp_lexer_peek_token (parser->lexer);
20174 /* Now, look for more attributes. If the next token isn't a
20175 `,', we're done. */
20176 if (token->type != CPP_COMMA)
20179 /* Consume the comma and keep going. */
20180 cp_lexer_consume_token (parser->lexer);
20182 parser->translate_strings_p = save_translate_strings_p;
20184 /* We built up the list in reverse order. */
20185 return nreverse (attribute_list);
20188 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20189 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20190 current value of the PEDANTIC flag, regardless of whether or not
20191 the `__extension__' keyword is present. The caller is responsible
20192 for restoring the value of the PEDANTIC flag. */
20195 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
20197 /* Save the old value of the PEDANTIC flag. */
20198 *saved_pedantic = pedantic;
20200 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
20202 /* Consume the `__extension__' token. */
20203 cp_lexer_consume_token (parser->lexer);
20204 /* We're not being pedantic while the `__extension__' keyword is
20214 /* Parse a label declaration.
20217 __label__ label-declarator-seq ;
20219 label-declarator-seq:
20220 identifier , label-declarator-seq
20224 cp_parser_label_declaration (cp_parser* parser)
20226 /* Look for the `__label__' keyword. */
20227 cp_parser_require_keyword (parser, RID_LABEL, RT_LABEL);
20233 /* Look for an identifier. */
20234 identifier = cp_parser_identifier (parser);
20235 /* If we failed, stop. */
20236 if (identifier == error_mark_node)
20238 /* Declare it as a label. */
20239 finish_label_decl (identifier);
20240 /* If the next token is a `;', stop. */
20241 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
20243 /* Look for the `,' separating the label declarations. */
20244 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
20247 /* Look for the final `;'. */
20248 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
20251 /* Support Functions */
20253 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20254 NAME should have one of the representations used for an
20255 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20256 is returned. If PARSER->SCOPE is a dependent type, then a
20257 SCOPE_REF is returned.
20259 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20260 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20261 was formed. Abstractly, such entities should not be passed to this
20262 function, because they do not need to be looked up, but it is
20263 simpler to check for this special case here, rather than at the
20266 In cases not explicitly covered above, this function returns a
20267 DECL, OVERLOAD, or baselink representing the result of the lookup.
20268 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20271 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20272 (e.g., "struct") that was used. In that case bindings that do not
20273 refer to types are ignored.
20275 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20278 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20281 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20284 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20285 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20286 NULL_TREE otherwise. */
20289 cp_parser_lookup_name (cp_parser *parser, tree name,
20290 enum tag_types tag_type,
20293 bool check_dependency,
20294 tree *ambiguous_decls,
20295 location_t name_location)
20299 tree object_type = parser->context->object_type;
20301 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
20302 flags |= LOOKUP_COMPLAIN;
20304 /* Assume that the lookup will be unambiguous. */
20305 if (ambiguous_decls)
20306 *ambiguous_decls = NULL_TREE;
20308 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20309 no longer valid. Note that if we are parsing tentatively, and
20310 the parse fails, OBJECT_TYPE will be automatically restored. */
20311 parser->context->object_type = NULL_TREE;
20313 if (name == error_mark_node)
20314 return error_mark_node;
20316 /* A template-id has already been resolved; there is no lookup to
20318 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
20320 if (BASELINK_P (name))
20322 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
20323 == TEMPLATE_ID_EXPR);
20327 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20328 it should already have been checked to make sure that the name
20329 used matches the type being destroyed. */
20330 if (TREE_CODE (name) == BIT_NOT_EXPR)
20334 /* Figure out to which type this destructor applies. */
20336 type = parser->scope;
20337 else if (object_type)
20338 type = object_type;
20340 type = current_class_type;
20341 /* If that's not a class type, there is no destructor. */
20342 if (!type || !CLASS_TYPE_P (type))
20343 return error_mark_node;
20344 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
20345 lazily_declare_fn (sfk_destructor, type);
20346 if (!CLASSTYPE_DESTRUCTORS (type))
20347 return error_mark_node;
20348 /* If it was a class type, return the destructor. */
20349 return CLASSTYPE_DESTRUCTORS (type);
20352 /* By this point, the NAME should be an ordinary identifier. If
20353 the id-expression was a qualified name, the qualifying scope is
20354 stored in PARSER->SCOPE at this point. */
20355 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
20357 /* Perform the lookup. */
20362 if (parser->scope == error_mark_node)
20363 return error_mark_node;
20365 /* If the SCOPE is dependent, the lookup must be deferred until
20366 the template is instantiated -- unless we are explicitly
20367 looking up names in uninstantiated templates. Even then, we
20368 cannot look up the name if the scope is not a class type; it
20369 might, for example, be a template type parameter. */
20370 dependent_p = (TYPE_P (parser->scope)
20371 && dependent_scope_p (parser->scope));
20372 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
20374 /* Defer lookup. */
20375 decl = error_mark_node;
20378 tree pushed_scope = NULL_TREE;
20380 /* If PARSER->SCOPE is a dependent type, then it must be a
20381 class type, and we must not be checking dependencies;
20382 otherwise, we would have processed this lookup above. So
20383 that PARSER->SCOPE is not considered a dependent base by
20384 lookup_member, we must enter the scope here. */
20386 pushed_scope = push_scope (parser->scope);
20388 /* If the PARSER->SCOPE is a template specialization, it
20389 may be instantiated during name lookup. In that case,
20390 errors may be issued. Even if we rollback the current
20391 tentative parse, those errors are valid. */
20392 decl = lookup_qualified_name (parser->scope, name,
20393 tag_type != none_type,
20394 /*complain=*/true);
20396 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20397 lookup result and the nested-name-specifier nominates a class C:
20398 * if the name specified after the nested-name-specifier, when
20399 looked up in C, is the injected-class-name of C (Clause 9), or
20400 * if the name specified after the nested-name-specifier is the
20401 same as the identifier or the simple-template-id's template-
20402 name in the last component of the nested-name-specifier,
20403 the name is instead considered to name the constructor of
20404 class C. [ Note: for example, the constructor is not an
20405 acceptable lookup result in an elaborated-type-specifier so
20406 the constructor would not be used in place of the
20407 injected-class-name. --end note ] Such a constructor name
20408 shall be used only in the declarator-id of a declaration that
20409 names a constructor or in a using-declaration. */
20410 if (tag_type == none_type
20411 && DECL_SELF_REFERENCE_P (decl)
20412 && same_type_p (DECL_CONTEXT (decl), parser->scope))
20413 decl = lookup_qualified_name (parser->scope, ctor_identifier,
20414 tag_type != none_type,
20415 /*complain=*/true);
20417 /* If we have a single function from a using decl, pull it out. */
20418 if (TREE_CODE (decl) == OVERLOAD
20419 && !really_overloaded_fn (decl))
20420 decl = OVL_FUNCTION (decl);
20423 pop_scope (pushed_scope);
20426 /* If the scope is a dependent type and either we deferred lookup or
20427 we did lookup but didn't find the name, rememeber the name. */
20428 if (decl == error_mark_node && TYPE_P (parser->scope)
20429 && dependent_type_p (parser->scope))
20435 /* The resolution to Core Issue 180 says that `struct
20436 A::B' should be considered a type-name, even if `A'
20438 type = make_typename_type (parser->scope, name, tag_type,
20439 /*complain=*/tf_error);
20440 decl = TYPE_NAME (type);
20442 else if (is_template
20443 && (cp_parser_next_token_ends_template_argument_p (parser)
20444 || cp_lexer_next_token_is (parser->lexer,
20446 decl = make_unbound_class_template (parser->scope,
20448 /*complain=*/tf_error);
20450 decl = build_qualified_name (/*type=*/NULL_TREE,
20451 parser->scope, name,
20454 parser->qualifying_scope = parser->scope;
20455 parser->object_scope = NULL_TREE;
20457 else if (object_type)
20459 tree object_decl = NULL_TREE;
20460 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20461 OBJECT_TYPE is not a class. */
20462 if (CLASS_TYPE_P (object_type))
20463 /* If the OBJECT_TYPE is a template specialization, it may
20464 be instantiated during name lookup. In that case, errors
20465 may be issued. Even if we rollback the current tentative
20466 parse, those errors are valid. */
20467 object_decl = lookup_member (object_type,
20470 tag_type != none_type,
20471 tf_warning_or_error);
20472 /* Look it up in the enclosing context, too. */
20473 decl = lookup_name_real (name, tag_type != none_type,
20475 /*block_p=*/true, is_namespace, flags);
20476 parser->object_scope = object_type;
20477 parser->qualifying_scope = NULL_TREE;
20479 decl = object_decl;
20483 decl = lookup_name_real (name, tag_type != none_type,
20485 /*block_p=*/true, is_namespace, flags);
20486 parser->qualifying_scope = NULL_TREE;
20487 parser->object_scope = NULL_TREE;
20490 /* If the lookup failed, let our caller know. */
20491 if (!decl || decl == error_mark_node)
20492 return error_mark_node;
20494 /* Pull out the template from an injected-class-name (or multiple). */
20496 decl = maybe_get_template_decl_from_type_decl (decl);
20498 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20499 if (TREE_CODE (decl) == TREE_LIST)
20501 if (ambiguous_decls)
20502 *ambiguous_decls = decl;
20503 /* The error message we have to print is too complicated for
20504 cp_parser_error, so we incorporate its actions directly. */
20505 if (!cp_parser_simulate_error (parser))
20507 error_at (name_location, "reference to %qD is ambiguous",
20509 print_candidates (decl);
20511 return error_mark_node;
20514 gcc_assert (DECL_P (decl)
20515 || TREE_CODE (decl) == OVERLOAD
20516 || TREE_CODE (decl) == SCOPE_REF
20517 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
20518 || BASELINK_P (decl));
20520 /* If we have resolved the name of a member declaration, check to
20521 see if the declaration is accessible. When the name resolves to
20522 set of overloaded functions, accessibility is checked when
20523 overload resolution is done.
20525 During an explicit instantiation, access is not checked at all,
20526 as per [temp.explicit]. */
20528 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
20530 maybe_record_typedef_use (decl);
20535 /* Like cp_parser_lookup_name, but for use in the typical case where
20536 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20537 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20540 cp_parser_lookup_name_simple (cp_parser* parser, tree name, location_t location)
20542 return cp_parser_lookup_name (parser, name,
20544 /*is_template=*/false,
20545 /*is_namespace=*/false,
20546 /*check_dependency=*/true,
20547 /*ambiguous_decls=*/NULL,
20551 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20552 the current context, return the TYPE_DECL. If TAG_NAME_P is
20553 true, the DECL indicates the class being defined in a class-head,
20554 or declared in an elaborated-type-specifier.
20556 Otherwise, return DECL. */
20559 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
20561 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20562 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20565 template <typename T> struct B;
20568 template <typename T> struct A::B {};
20570 Similarly, in an elaborated-type-specifier:
20572 namespace N { struct X{}; }
20575 template <typename T> friend struct N::X;
20578 However, if the DECL refers to a class type, and we are in
20579 the scope of the class, then the name lookup automatically
20580 finds the TYPE_DECL created by build_self_reference rather
20581 than a TEMPLATE_DECL. For example, in:
20583 template <class T> struct S {
20587 there is no need to handle such case. */
20589 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
20590 return DECL_TEMPLATE_RESULT (decl);
20595 /* If too many, or too few, template-parameter lists apply to the
20596 declarator, issue an error message. Returns TRUE if all went well,
20597 and FALSE otherwise. */
20600 cp_parser_check_declarator_template_parameters (cp_parser* parser,
20601 cp_declarator *declarator,
20602 location_t declarator_location)
20604 unsigned num_templates;
20606 /* We haven't seen any classes that involve template parameters yet. */
20609 switch (declarator->kind)
20612 if (declarator->u.id.qualifying_scope)
20616 scope = declarator->u.id.qualifying_scope;
20618 while (scope && CLASS_TYPE_P (scope))
20620 /* You're supposed to have one `template <...>'
20621 for every template class, but you don't need one
20622 for a full specialization. For example:
20624 template <class T> struct S{};
20625 template <> struct S<int> { void f(); };
20626 void S<int>::f () {}
20628 is correct; there shouldn't be a `template <>' for
20629 the definition of `S<int>::f'. */
20630 if (!CLASSTYPE_TEMPLATE_INFO (scope))
20631 /* If SCOPE does not have template information of any
20632 kind, then it is not a template, nor is it nested
20633 within a template. */
20635 if (explicit_class_specialization_p (scope))
20637 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
20640 scope = TYPE_CONTEXT (scope);
20643 else if (TREE_CODE (declarator->u.id.unqualified_name)
20644 == TEMPLATE_ID_EXPR)
20645 /* If the DECLARATOR has the form `X<y>' then it uses one
20646 additional level of template parameters. */
20649 return cp_parser_check_template_parameters
20650 (parser, num_templates, declarator_location, declarator);
20656 case cdk_reference:
20658 return (cp_parser_check_declarator_template_parameters
20659 (parser, declarator->declarator, declarator_location));
20665 gcc_unreachable ();
20670 /* NUM_TEMPLATES were used in the current declaration. If that is
20671 invalid, return FALSE and issue an error messages. Otherwise,
20672 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20673 declarator and we can print more accurate diagnostics. */
20676 cp_parser_check_template_parameters (cp_parser* parser,
20677 unsigned num_templates,
20678 location_t location,
20679 cp_declarator *declarator)
20681 /* If there are the same number of template classes and parameter
20682 lists, that's OK. */
20683 if (parser->num_template_parameter_lists == num_templates)
20685 /* If there are more, but only one more, then we are referring to a
20686 member template. That's OK too. */
20687 if (parser->num_template_parameter_lists == num_templates + 1)
20689 /* If there are more template classes than parameter lists, we have
20692 template <class T> void S<T>::R<T>::f (); */
20693 if (parser->num_template_parameter_lists < num_templates)
20695 if (declarator && !current_function_decl)
20696 error_at (location, "specializing member %<%T::%E%> "
20697 "requires %<template<>%> syntax",
20698 declarator->u.id.qualifying_scope,
20699 declarator->u.id.unqualified_name);
20700 else if (declarator)
20701 error_at (location, "invalid declaration of %<%T::%E%>",
20702 declarator->u.id.qualifying_scope,
20703 declarator->u.id.unqualified_name);
20705 error_at (location, "too few template-parameter-lists");
20708 /* Otherwise, there are too many template parameter lists. We have
20711 template <class T> template <class U> void S::f(); */
20712 error_at (location, "too many template-parameter-lists");
20716 /* Parse an optional `::' token indicating that the following name is
20717 from the global namespace. If so, PARSER->SCOPE is set to the
20718 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20719 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20720 Returns the new value of PARSER->SCOPE, if the `::' token is
20721 present, and NULL_TREE otherwise. */
20724 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
20728 /* Peek at the next token. */
20729 token = cp_lexer_peek_token (parser->lexer);
20730 /* If we're looking at a `::' token then we're starting from the
20731 global namespace, not our current location. */
20732 if (token->type == CPP_SCOPE)
20734 /* Consume the `::' token. */
20735 cp_lexer_consume_token (parser->lexer);
20736 /* Set the SCOPE so that we know where to start the lookup. */
20737 parser->scope = global_namespace;
20738 parser->qualifying_scope = global_namespace;
20739 parser->object_scope = NULL_TREE;
20741 return parser->scope;
20743 else if (!current_scope_valid_p)
20745 parser->scope = NULL_TREE;
20746 parser->qualifying_scope = NULL_TREE;
20747 parser->object_scope = NULL_TREE;
20753 /* Returns TRUE if the upcoming token sequence is the start of a
20754 constructor declarator. If FRIEND_P is true, the declarator is
20755 preceded by the `friend' specifier. */
20758 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
20760 bool constructor_p;
20761 tree nested_name_specifier;
20762 cp_token *next_token;
20764 /* The common case is that this is not a constructor declarator, so
20765 try to avoid doing lots of work if at all possible. It's not
20766 valid declare a constructor at function scope. */
20767 if (parser->in_function_body)
20769 /* And only certain tokens can begin a constructor declarator. */
20770 next_token = cp_lexer_peek_token (parser->lexer);
20771 if (next_token->type != CPP_NAME
20772 && next_token->type != CPP_SCOPE
20773 && next_token->type != CPP_NESTED_NAME_SPECIFIER
20774 && next_token->type != CPP_TEMPLATE_ID)
20777 /* Parse tentatively; we are going to roll back all of the tokens
20779 cp_parser_parse_tentatively (parser);
20780 /* Assume that we are looking at a constructor declarator. */
20781 constructor_p = true;
20783 /* Look for the optional `::' operator. */
20784 cp_parser_global_scope_opt (parser,
20785 /*current_scope_valid_p=*/false);
20786 /* Look for the nested-name-specifier. */
20787 nested_name_specifier
20788 = (cp_parser_nested_name_specifier_opt (parser,
20789 /*typename_keyword_p=*/false,
20790 /*check_dependency_p=*/false,
20792 /*is_declaration=*/false));
20793 /* Outside of a class-specifier, there must be a
20794 nested-name-specifier. */
20795 if (!nested_name_specifier &&
20796 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
20798 constructor_p = false;
20799 else if (nested_name_specifier == error_mark_node)
20800 constructor_p = false;
20802 /* If we have a class scope, this is easy; DR 147 says that S::S always
20803 names the constructor, and no other qualified name could. */
20804 if (constructor_p && nested_name_specifier
20805 && CLASS_TYPE_P (nested_name_specifier))
20807 tree id = cp_parser_unqualified_id (parser,
20808 /*template_keyword_p=*/false,
20809 /*check_dependency_p=*/false,
20810 /*declarator_p=*/true,
20811 /*optional_p=*/false);
20812 if (is_overloaded_fn (id))
20813 id = DECL_NAME (get_first_fn (id));
20814 if (!constructor_name_p (id, nested_name_specifier))
20815 constructor_p = false;
20817 /* If we still think that this might be a constructor-declarator,
20818 look for a class-name. */
20819 else if (constructor_p)
20823 template <typename T> struct S {
20827 we must recognize that the nested `S' names a class. */
20829 type_decl = cp_parser_class_name (parser,
20830 /*typename_keyword_p=*/false,
20831 /*template_keyword_p=*/false,
20833 /*check_dependency_p=*/false,
20834 /*class_head_p=*/false,
20835 /*is_declaration=*/false);
20836 /* If there was no class-name, then this is not a constructor. */
20837 constructor_p = !cp_parser_error_occurred (parser);
20839 /* If we're still considering a constructor, we have to see a `(',
20840 to begin the parameter-declaration-clause, followed by either a
20841 `)', an `...', or a decl-specifier. We need to check for a
20842 type-specifier to avoid being fooled into thinking that:
20846 is a constructor. (It is actually a function named `f' that
20847 takes one parameter (of type `int') and returns a value of type
20850 && !cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
20851 constructor_p = false;
20854 && cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
20855 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
20856 /* A parameter declaration begins with a decl-specifier,
20857 which is either the "attribute" keyword, a storage class
20858 specifier, or (usually) a type-specifier. */
20859 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
20862 tree pushed_scope = NULL_TREE;
20863 unsigned saved_num_template_parameter_lists;
20865 /* Names appearing in the type-specifier should be looked up
20866 in the scope of the class. */
20867 if (current_class_type)
20871 type = TREE_TYPE (type_decl);
20872 if (TREE_CODE (type) == TYPENAME_TYPE)
20874 type = resolve_typename_type (type,
20875 /*only_current_p=*/false);
20876 if (TREE_CODE (type) == TYPENAME_TYPE)
20878 cp_parser_abort_tentative_parse (parser);
20882 pushed_scope = push_scope (type);
20885 /* Inside the constructor parameter list, surrounding
20886 template-parameter-lists do not apply. */
20887 saved_num_template_parameter_lists
20888 = parser->num_template_parameter_lists;
20889 parser->num_template_parameter_lists = 0;
20891 /* Look for the type-specifier. */
20892 cp_parser_type_specifier (parser,
20893 CP_PARSER_FLAGS_NONE,
20894 /*decl_specs=*/NULL,
20895 /*is_declarator=*/true,
20896 /*declares_class_or_enum=*/NULL,
20897 /*is_cv_qualifier=*/NULL);
20899 parser->num_template_parameter_lists
20900 = saved_num_template_parameter_lists;
20902 /* Leave the scope of the class. */
20904 pop_scope (pushed_scope);
20906 constructor_p = !cp_parser_error_occurred (parser);
20910 /* We did not really want to consume any tokens. */
20911 cp_parser_abort_tentative_parse (parser);
20913 return constructor_p;
20916 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20917 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20918 they must be performed once we are in the scope of the function.
20920 Returns the function defined. */
20923 cp_parser_function_definition_from_specifiers_and_declarator
20924 (cp_parser* parser,
20925 cp_decl_specifier_seq *decl_specifiers,
20927 const cp_declarator *declarator)
20932 /* Begin the function-definition. */
20933 success_p = start_function (decl_specifiers, declarator, attributes);
20935 /* The things we're about to see are not directly qualified by any
20936 template headers we've seen thus far. */
20937 reset_specialization ();
20939 /* If there were names looked up in the decl-specifier-seq that we
20940 did not check, check them now. We must wait until we are in the
20941 scope of the function to perform the checks, since the function
20942 might be a friend. */
20943 perform_deferred_access_checks ();
20947 /* Skip the entire function. */
20948 cp_parser_skip_to_end_of_block_or_statement (parser);
20949 fn = error_mark_node;
20951 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
20953 /* Seen already, skip it. An error message has already been output. */
20954 cp_parser_skip_to_end_of_block_or_statement (parser);
20955 fn = current_function_decl;
20956 current_function_decl = NULL_TREE;
20957 /* If this is a function from a class, pop the nested class. */
20958 if (current_class_name)
20959 pop_nested_class ();
20964 if (DECL_DECLARED_INLINE_P (current_function_decl))
20965 tv = TV_PARSE_INLINE;
20967 tv = TV_PARSE_FUNC;
20969 fn = cp_parser_function_definition_after_declarator (parser,
20970 /*inline_p=*/false);
20977 /* Parse the part of a function-definition that follows the
20978 declarator. INLINE_P is TRUE iff this function is an inline
20979 function defined within a class-specifier.
20981 Returns the function defined. */
20984 cp_parser_function_definition_after_declarator (cp_parser* parser,
20988 bool ctor_initializer_p = false;
20989 bool saved_in_unbraced_linkage_specification_p;
20990 bool saved_in_function_body;
20991 unsigned saved_num_template_parameter_lists;
20994 saved_in_function_body = parser->in_function_body;
20995 parser->in_function_body = true;
20996 /* If the next token is `return', then the code may be trying to
20997 make use of the "named return value" extension that G++ used to
20999 token = cp_lexer_peek_token (parser->lexer);
21000 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
21002 /* Consume the `return' keyword. */
21003 cp_lexer_consume_token (parser->lexer);
21004 /* Look for the identifier that indicates what value is to be
21006 cp_parser_identifier (parser);
21007 /* Issue an error message. */
21008 error_at (token->location,
21009 "named return values are no longer supported");
21010 /* Skip tokens until we reach the start of the function body. */
21013 cp_token *token = cp_lexer_peek_token (parser->lexer);
21014 if (token->type == CPP_OPEN_BRACE
21015 || token->type == CPP_EOF
21016 || token->type == CPP_PRAGMA_EOL)
21018 cp_lexer_consume_token (parser->lexer);
21021 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21022 anything declared inside `f'. */
21023 saved_in_unbraced_linkage_specification_p
21024 = parser->in_unbraced_linkage_specification_p;
21025 parser->in_unbraced_linkage_specification_p = false;
21026 /* Inside the function, surrounding template-parameter-lists do not
21028 saved_num_template_parameter_lists
21029 = parser->num_template_parameter_lists;
21030 parser->num_template_parameter_lists = 0;
21032 start_lambda_scope (current_function_decl);
21034 /* If the next token is `try', `__transaction_atomic', or
21035 `__transaction_relaxed`, then we are looking at either function-try-block
21036 or function-transaction-block. Note that all of these include the
21038 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRANSACTION_ATOMIC))
21039 ctor_initializer_p = cp_parser_function_transaction (parser,
21040 RID_TRANSACTION_ATOMIC);
21041 else if (cp_lexer_next_token_is_keyword (parser->lexer,
21042 RID_TRANSACTION_RELAXED))
21043 ctor_initializer_p = cp_parser_function_transaction (parser,
21044 RID_TRANSACTION_RELAXED);
21045 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
21046 ctor_initializer_p = cp_parser_function_try_block (parser);
21049 = cp_parser_ctor_initializer_opt_and_function_body (parser);
21051 finish_lambda_scope ();
21053 /* Finish the function. */
21054 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
21055 (inline_p ? 2 : 0));
21056 /* Generate code for it, if necessary. */
21057 expand_or_defer_fn (fn);
21058 /* Restore the saved values. */
21059 parser->in_unbraced_linkage_specification_p
21060 = saved_in_unbraced_linkage_specification_p;
21061 parser->num_template_parameter_lists
21062 = saved_num_template_parameter_lists;
21063 parser->in_function_body = saved_in_function_body;
21068 /* Parse a template-declaration, assuming that the `export' (and
21069 `extern') keywords, if present, has already been scanned. MEMBER_P
21070 is as for cp_parser_template_declaration. */
21073 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
21075 tree decl = NULL_TREE;
21076 VEC (deferred_access_check,gc) *checks;
21077 tree parameter_list;
21078 bool friend_p = false;
21079 bool need_lang_pop;
21082 /* Look for the `template' keyword. */
21083 token = cp_lexer_peek_token (parser->lexer);
21084 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE))
21088 if (!cp_parser_require (parser, CPP_LESS, RT_LESS))
21090 if (at_class_scope_p () && current_function_decl)
21092 /* 14.5.2.2 [temp.mem]
21094 A local class shall not have member templates. */
21095 error_at (token->location,
21096 "invalid declaration of member template in local class");
21097 cp_parser_skip_to_end_of_block_or_statement (parser);
21102 A template ... shall not have C linkage. */
21103 if (current_lang_name == lang_name_c)
21105 error_at (token->location, "template with C linkage");
21106 /* Give it C++ linkage to avoid confusing other parts of the
21108 push_lang_context (lang_name_cplusplus);
21109 need_lang_pop = true;
21112 need_lang_pop = false;
21114 /* We cannot perform access checks on the template parameter
21115 declarations until we know what is being declared, just as we
21116 cannot check the decl-specifier list. */
21117 push_deferring_access_checks (dk_deferred);
21119 /* If the next token is `>', then we have an invalid
21120 specialization. Rather than complain about an invalid template
21121 parameter, issue an error message here. */
21122 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
21124 cp_parser_error (parser, "invalid explicit specialization");
21125 begin_specialization ();
21126 parameter_list = NULL_TREE;
21130 /* Parse the template parameters. */
21131 parameter_list = cp_parser_template_parameter_list (parser);
21132 fixup_template_parms ();
21135 /* Get the deferred access checks from the parameter list. These
21136 will be checked once we know what is being declared, as for a
21137 member template the checks must be performed in the scope of the
21138 class containing the member. */
21139 checks = get_deferred_access_checks ();
21141 /* Look for the `>'. */
21142 cp_parser_skip_to_end_of_template_parameter_list (parser);
21143 /* We just processed one more parameter list. */
21144 ++parser->num_template_parameter_lists;
21145 /* If the next token is `template', there are more template
21147 if (cp_lexer_next_token_is_keyword (parser->lexer,
21149 cp_parser_template_declaration_after_export (parser, member_p);
21150 else if (cxx_dialect >= cxx0x
21151 && cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
21152 decl = cp_parser_alias_declaration (parser);
21155 /* There are no access checks when parsing a template, as we do not
21156 know if a specialization will be a friend. */
21157 push_deferring_access_checks (dk_no_check);
21158 token = cp_lexer_peek_token (parser->lexer);
21159 decl = cp_parser_single_declaration (parser,
21162 /*explicit_specialization_p=*/false,
21164 pop_deferring_access_checks ();
21166 /* If this is a member template declaration, let the front
21168 if (member_p && !friend_p && decl)
21170 if (TREE_CODE (decl) == TYPE_DECL)
21171 cp_parser_check_access_in_redeclaration (decl, token->location);
21173 decl = finish_member_template_decl (decl);
21175 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
21176 make_friend_class (current_class_type, TREE_TYPE (decl),
21177 /*complain=*/true);
21179 /* We are done with the current parameter list. */
21180 --parser->num_template_parameter_lists;
21182 pop_deferring_access_checks ();
21185 finish_template_decl (parameter_list);
21187 /* Check the template arguments for a literal operator template. */
21189 && (TREE_CODE (decl) == FUNCTION_DECL || DECL_FUNCTION_TEMPLATE_P (decl))
21190 && UDLIT_OPER_P (DECL_NAME (decl)))
21193 if (parameter_list == NULL_TREE)
21197 int num_parms = TREE_VEC_LENGTH (parameter_list);
21198 if (num_parms != 1)
21202 tree parm_list = TREE_VEC_ELT (parameter_list, 0);
21203 tree parm = INNERMOST_TEMPLATE_PARMS (parm_list);
21204 if (TREE_TYPE (parm) != char_type_node
21205 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm)))
21210 error ("literal operator template %qD has invalid parameter list."
21211 " Expected non-type template argument pack <char...>",
21214 /* Register member declarations. */
21215 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
21216 finish_member_declaration (decl);
21217 /* For the erroneous case of a template with C linkage, we pushed an
21218 implicit C++ linkage scope; exit that scope now. */
21220 pop_lang_context ();
21221 /* If DECL is a function template, we must return to parse it later.
21222 (Even though there is no definition, there might be default
21223 arguments that need handling.) */
21224 if (member_p && decl
21225 && (TREE_CODE (decl) == FUNCTION_DECL
21226 || DECL_FUNCTION_TEMPLATE_P (decl)))
21227 VEC_safe_push (tree, gc, unparsed_funs_with_definitions, decl);
21230 /* Perform the deferred access checks from a template-parameter-list.
21231 CHECKS is a TREE_LIST of access checks, as returned by
21232 get_deferred_access_checks. */
21235 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
21237 ++processing_template_parmlist;
21238 perform_access_checks (checks);
21239 --processing_template_parmlist;
21242 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21243 `function-definition' sequence. MEMBER_P is true, this declaration
21244 appears in a class scope.
21246 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21247 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21250 cp_parser_single_declaration (cp_parser* parser,
21251 VEC (deferred_access_check,gc)* checks,
21253 bool explicit_specialization_p,
21256 int declares_class_or_enum;
21257 tree decl = NULL_TREE;
21258 cp_decl_specifier_seq decl_specifiers;
21259 bool function_definition_p = false;
21260 cp_token *decl_spec_token_start;
21262 /* This function is only used when processing a template
21264 gcc_assert (innermost_scope_kind () == sk_template_parms
21265 || innermost_scope_kind () == sk_template_spec);
21267 /* Defer access checks until we know what is being declared. */
21268 push_deferring_access_checks (dk_deferred);
21270 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21272 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
21273 cp_parser_decl_specifier_seq (parser,
21274 CP_PARSER_FLAGS_OPTIONAL,
21276 &declares_class_or_enum);
21278 *friend_p = cp_parser_friend_p (&decl_specifiers);
21280 /* There are no template typedefs. */
21281 if (decl_specifiers.specs[(int) ds_typedef])
21283 error_at (decl_spec_token_start->location,
21284 "template declaration of %<typedef%>");
21285 decl = error_mark_node;
21288 /* Gather up the access checks that occurred the
21289 decl-specifier-seq. */
21290 stop_deferring_access_checks ();
21292 /* Check for the declaration of a template class. */
21293 if (declares_class_or_enum)
21295 if (cp_parser_declares_only_class_p (parser))
21297 decl = shadow_tag (&decl_specifiers);
21302 friend template <typename T> struct A<T>::B;
21305 A<T>::B will be represented by a TYPENAME_TYPE, and
21306 therefore not recognized by shadow_tag. */
21307 if (friend_p && *friend_p
21309 && decl_specifiers.type
21310 && TYPE_P (decl_specifiers.type))
21311 decl = decl_specifiers.type;
21313 if (decl && decl != error_mark_node)
21314 decl = TYPE_NAME (decl);
21316 decl = error_mark_node;
21318 /* Perform access checks for template parameters. */
21319 cp_parser_perform_template_parameter_access_checks (checks);
21323 /* Complain about missing 'typename' or other invalid type names. */
21324 if (!decl_specifiers.any_type_specifiers_p
21325 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
21327 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21328 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21329 the rest of this declaration. */
21330 decl = error_mark_node;
21334 /* If it's not a template class, try for a template function. If
21335 the next token is a `;', then this declaration does not declare
21336 anything. But, if there were errors in the decl-specifiers, then
21337 the error might well have come from an attempted class-specifier.
21338 In that case, there's no need to warn about a missing declarator. */
21340 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
21341 || decl_specifiers.type != error_mark_node))
21343 decl = cp_parser_init_declarator (parser,
21346 /*function_definition_allowed_p=*/true,
21348 declares_class_or_enum,
21349 &function_definition_p,
21352 /* 7.1.1-1 [dcl.stc]
21354 A storage-class-specifier shall not be specified in an explicit
21355 specialization... */
21357 && explicit_specialization_p
21358 && decl_specifiers.storage_class != sc_none)
21360 error_at (decl_spec_token_start->location,
21361 "explicit template specialization cannot have a storage class");
21362 decl = error_mark_node;
21366 /* Look for a trailing `;' after the declaration. */
21367 if (!function_definition_p
21368 && (decl == error_mark_node
21369 || !cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON)))
21370 cp_parser_skip_to_end_of_block_or_statement (parser);
21373 pop_deferring_access_checks ();
21375 /* Clear any current qualification; whatever comes next is the start
21376 of something new. */
21377 parser->scope = NULL_TREE;
21378 parser->qualifying_scope = NULL_TREE;
21379 parser->object_scope = NULL_TREE;
21384 /* Parse a cast-expression that is not the operand of a unary "&". */
21387 cp_parser_simple_cast_expression (cp_parser *parser)
21389 return cp_parser_cast_expression (parser, /*address_p=*/false,
21390 /*cast_p=*/false, NULL);
21393 /* Parse a functional cast to TYPE. Returns an expression
21394 representing the cast. */
21397 cp_parser_functional_cast (cp_parser* parser, tree type)
21400 tree expression_list;
21404 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
21406 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
21407 expression_list = cp_parser_braced_list (parser, &nonconst_p);
21408 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
21409 if (TREE_CODE (type) == TYPE_DECL)
21410 type = TREE_TYPE (type);
21411 return finish_compound_literal (type, expression_list,
21412 tf_warning_or_error);
21416 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
21418 /*allow_expansion_p=*/true,
21419 /*non_constant_p=*/NULL);
21421 expression_list = error_mark_node;
21424 expression_list = build_tree_list_vec (vec);
21425 release_tree_vector (vec);
21428 cast = build_functional_cast (type, expression_list,
21429 tf_warning_or_error);
21430 /* [expr.const]/1: In an integral constant expression "only type
21431 conversions to integral or enumeration type can be used". */
21432 if (TREE_CODE (type) == TYPE_DECL)
21433 type = TREE_TYPE (type);
21434 if (cast != error_mark_node
21435 && !cast_valid_in_integral_constant_expression_p (type)
21436 && cp_parser_non_integral_constant_expression (parser,
21438 return error_mark_node;
21442 /* Save the tokens that make up the body of a member function defined
21443 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21444 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21445 specifiers applied to the declaration. Returns the FUNCTION_DECL
21446 for the member function. */
21449 cp_parser_save_member_function_body (cp_parser* parser,
21450 cp_decl_specifier_seq *decl_specifiers,
21451 cp_declarator *declarator,
21458 /* Create the FUNCTION_DECL. */
21459 fn = grokmethod (decl_specifiers, declarator, attributes);
21460 /* If something went badly wrong, bail out now. */
21461 if (fn == error_mark_node)
21463 /* If there's a function-body, skip it. */
21464 if (cp_parser_token_starts_function_definition_p
21465 (cp_lexer_peek_token (parser->lexer)))
21466 cp_parser_skip_to_end_of_block_or_statement (parser);
21467 return error_mark_node;
21470 /* Remember it, if there default args to post process. */
21471 cp_parser_save_default_args (parser, fn);
21473 /* Save away the tokens that make up the body of the
21475 first = parser->lexer->next_token;
21476 /* We can have braced-init-list mem-initializers before the fn body. */
21477 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
21479 cp_lexer_consume_token (parser->lexer);
21480 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
21481 && cp_lexer_next_token_is_not_keyword (parser->lexer, RID_TRY))
21483 /* cache_group will stop after an un-nested { } pair, too. */
21484 if (cp_parser_cache_group (parser, CPP_CLOSE_PAREN, /*depth=*/0))
21487 /* variadic mem-inits have ... after the ')'. */
21488 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
21489 cp_lexer_consume_token (parser->lexer);
21492 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
21493 /* Handle function try blocks. */
21494 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
21495 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
21496 last = parser->lexer->next_token;
21498 /* Save away the inline definition; we will process it when the
21499 class is complete. */
21500 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
21501 DECL_PENDING_INLINE_P (fn) = 1;
21503 /* We need to know that this was defined in the class, so that
21504 friend templates are handled correctly. */
21505 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
21507 /* Add FN to the queue of functions to be parsed later. */
21508 VEC_safe_push (tree, gc, unparsed_funs_with_definitions, fn);
21513 /* Save the tokens that make up the in-class initializer for a non-static
21514 data member. Returns a DEFAULT_ARG. */
21517 cp_parser_save_nsdmi (cp_parser* parser)
21519 /* Save away the tokens that make up the body of the
21521 cp_token *first = parser->lexer->next_token;
21525 /* Save tokens until the next comma or semicolon. */
21526 cp_parser_cache_group (parser, CPP_COMMA, /*depth=*/0);
21528 last = parser->lexer->next_token;
21530 node = make_node (DEFAULT_ARG);
21531 DEFARG_TOKENS (node) = cp_token_cache_new (first, last);
21532 DEFARG_INSTANTIATIONS (node) = NULL;
21538 /* Parse a template-argument-list, as well as the trailing ">" (but
21539 not the opening "<"). See cp_parser_template_argument_list for the
21543 cp_parser_enclosed_template_argument_list (cp_parser* parser)
21547 tree saved_qualifying_scope;
21548 tree saved_object_scope;
21549 bool saved_greater_than_is_operator_p;
21550 int saved_unevaluated_operand;
21551 int saved_inhibit_evaluation_warnings;
21555 When parsing a template-id, the first non-nested `>' is taken as
21556 the end of the template-argument-list rather than a greater-than
21558 saved_greater_than_is_operator_p
21559 = parser->greater_than_is_operator_p;
21560 parser->greater_than_is_operator_p = false;
21561 /* Parsing the argument list may modify SCOPE, so we save it
21563 saved_scope = parser->scope;
21564 saved_qualifying_scope = parser->qualifying_scope;
21565 saved_object_scope = parser->object_scope;
21566 /* We need to evaluate the template arguments, even though this
21567 template-id may be nested within a "sizeof". */
21568 saved_unevaluated_operand = cp_unevaluated_operand;
21569 cp_unevaluated_operand = 0;
21570 saved_inhibit_evaluation_warnings = c_inhibit_evaluation_warnings;
21571 c_inhibit_evaluation_warnings = 0;
21572 /* Parse the template-argument-list itself. */
21573 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER)
21574 || cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
21575 arguments = NULL_TREE;
21577 arguments = cp_parser_template_argument_list (parser);
21578 /* Look for the `>' that ends the template-argument-list. If we find
21579 a '>>' instead, it's probably just a typo. */
21580 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
21582 if (cxx_dialect != cxx98)
21584 /* In C++0x, a `>>' in a template argument list or cast
21585 expression is considered to be two separate `>'
21586 tokens. So, change the current token to a `>', but don't
21587 consume it: it will be consumed later when the outer
21588 template argument list (or cast expression) is parsed.
21589 Note that this replacement of `>' for `>>' is necessary
21590 even if we are parsing tentatively: in the tentative
21591 case, after calling
21592 cp_parser_enclosed_template_argument_list we will always
21593 throw away all of the template arguments and the first
21594 closing `>', either because the template argument list
21595 was erroneous or because we are replacing those tokens
21596 with a CPP_TEMPLATE_ID token. The second `>' (which will
21597 not have been thrown away) is needed either to close an
21598 outer template argument list or to complete a new-style
21600 cp_token *token = cp_lexer_peek_token (parser->lexer);
21601 token->type = CPP_GREATER;
21603 else if (!saved_greater_than_is_operator_p)
21605 /* If we're in a nested template argument list, the '>>' has
21606 to be a typo for '> >'. We emit the error message, but we
21607 continue parsing and we push a '>' as next token, so that
21608 the argument list will be parsed correctly. Note that the
21609 global source location is still on the token before the
21610 '>>', so we need to say explicitly where we want it. */
21611 cp_token *token = cp_lexer_peek_token (parser->lexer);
21612 error_at (token->location, "%<>>%> should be %<> >%> "
21613 "within a nested template argument list");
21615 token->type = CPP_GREATER;
21619 /* If this is not a nested template argument list, the '>>'
21620 is a typo for '>'. Emit an error message and continue.
21621 Same deal about the token location, but here we can get it
21622 right by consuming the '>>' before issuing the diagnostic. */
21623 cp_token *token = cp_lexer_consume_token (parser->lexer);
21624 error_at (token->location,
21625 "spurious %<>>%>, use %<>%> to terminate "
21626 "a template argument list");
21630 cp_parser_skip_to_end_of_template_parameter_list (parser);
21631 /* The `>' token might be a greater-than operator again now. */
21632 parser->greater_than_is_operator_p
21633 = saved_greater_than_is_operator_p;
21634 /* Restore the SAVED_SCOPE. */
21635 parser->scope = saved_scope;
21636 parser->qualifying_scope = saved_qualifying_scope;
21637 parser->object_scope = saved_object_scope;
21638 cp_unevaluated_operand = saved_unevaluated_operand;
21639 c_inhibit_evaluation_warnings = saved_inhibit_evaluation_warnings;
21644 /* MEMBER_FUNCTION is a member function, or a friend. If default
21645 arguments, or the body of the function have not yet been parsed,
21649 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
21651 timevar_push (TV_PARSE_INMETH);
21652 /* If this member is a template, get the underlying
21654 if (DECL_FUNCTION_TEMPLATE_P (member_function))
21655 member_function = DECL_TEMPLATE_RESULT (member_function);
21657 /* There should not be any class definitions in progress at this
21658 point; the bodies of members are only parsed outside of all class
21660 gcc_assert (parser->num_classes_being_defined == 0);
21661 /* While we're parsing the member functions we might encounter more
21662 classes. We want to handle them right away, but we don't want
21663 them getting mixed up with functions that are currently in the
21665 push_unparsed_function_queues (parser);
21667 /* Make sure that any template parameters are in scope. */
21668 maybe_begin_member_template_processing (member_function);
21670 /* If the body of the function has not yet been parsed, parse it
21672 if (DECL_PENDING_INLINE_P (member_function))
21674 tree function_scope;
21675 cp_token_cache *tokens;
21677 /* The function is no longer pending; we are processing it. */
21678 tokens = DECL_PENDING_INLINE_INFO (member_function);
21679 DECL_PENDING_INLINE_INFO (member_function) = NULL;
21680 DECL_PENDING_INLINE_P (member_function) = 0;
21682 /* If this is a local class, enter the scope of the containing
21684 function_scope = current_function_decl;
21685 if (function_scope)
21686 push_function_context ();
21688 /* Push the body of the function onto the lexer stack. */
21689 cp_parser_push_lexer_for_tokens (parser, tokens);
21691 /* Let the front end know that we going to be defining this
21693 start_preparsed_function (member_function, NULL_TREE,
21694 SF_PRE_PARSED | SF_INCLASS_INLINE);
21696 /* Don't do access checking if it is a templated function. */
21697 if (processing_template_decl)
21698 push_deferring_access_checks (dk_no_check);
21700 /* Now, parse the body of the function. */
21701 cp_parser_function_definition_after_declarator (parser,
21702 /*inline_p=*/true);
21704 if (processing_template_decl)
21705 pop_deferring_access_checks ();
21707 /* Leave the scope of the containing function. */
21708 if (function_scope)
21709 pop_function_context ();
21710 cp_parser_pop_lexer (parser);
21713 /* Remove any template parameters from the symbol table. */
21714 maybe_end_member_template_processing ();
21716 /* Restore the queue. */
21717 pop_unparsed_function_queues (parser);
21718 timevar_pop (TV_PARSE_INMETH);
21721 /* If DECL contains any default args, remember it on the unparsed
21722 functions queue. */
21725 cp_parser_save_default_args (cp_parser* parser, tree decl)
21729 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
21731 probe = TREE_CHAIN (probe))
21732 if (TREE_PURPOSE (probe))
21734 cp_default_arg_entry *entry
21735 = VEC_safe_push (cp_default_arg_entry, gc,
21736 unparsed_funs_with_default_args, NULL);
21737 entry->class_type = current_class_type;
21738 entry->decl = decl;
21743 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21744 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21745 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21746 from the parameter-type-list. */
21749 cp_parser_late_parse_one_default_arg (cp_parser *parser, tree decl,
21750 tree default_arg, tree parmtype)
21752 cp_token_cache *tokens;
21756 /* Push the saved tokens for the default argument onto the parser's
21758 tokens = DEFARG_TOKENS (default_arg);
21759 cp_parser_push_lexer_for_tokens (parser, tokens);
21761 start_lambda_scope (decl);
21763 /* Parse the default argument. */
21764 parsed_arg = cp_parser_initializer (parser, &dummy, &dummy);
21765 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg))
21766 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
21768 finish_lambda_scope ();
21770 if (!processing_template_decl)
21772 /* In a non-template class, check conversions now. In a template,
21773 we'll wait and instantiate these as needed. */
21774 if (TREE_CODE (decl) == PARM_DECL)
21775 parsed_arg = check_default_argument (parmtype, parsed_arg);
21778 int flags = LOOKUP_IMPLICIT;
21779 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg)
21780 && CONSTRUCTOR_IS_DIRECT_INIT (parsed_arg))
21781 flags = LOOKUP_NORMAL;
21782 parsed_arg = digest_init_flags (TREE_TYPE (decl), parsed_arg, flags);
21786 /* If the token stream has not been completely used up, then
21787 there was extra junk after the end of the default
21789 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
21791 if (TREE_CODE (decl) == PARM_DECL)
21792 cp_parser_error (parser, "expected %<,%>");
21794 cp_parser_error (parser, "expected %<;%>");
21797 /* Revert to the main lexer. */
21798 cp_parser_pop_lexer (parser);
21803 /* FIELD is a non-static data member with an initializer which we saved for
21804 later; parse it now. */
21807 cp_parser_late_parsing_nsdmi (cp_parser *parser, tree field)
21811 push_unparsed_function_queues (parser);
21812 def = cp_parser_late_parse_one_default_arg (parser, field,
21813 DECL_INITIAL (field),
21815 pop_unparsed_function_queues (parser);
21817 DECL_INITIAL (field) = def;
21820 /* FN is a FUNCTION_DECL which may contains a parameter with an
21821 unparsed DEFAULT_ARG. Parse the default args now. This function
21822 assumes that the current scope is the scope in which the default
21823 argument should be processed. */
21826 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
21828 bool saved_local_variables_forbidden_p;
21829 tree parm, parmdecl;
21831 /* While we're parsing the default args, we might (due to the
21832 statement expression extension) encounter more classes. We want
21833 to handle them right away, but we don't want them getting mixed
21834 up with default args that are currently in the queue. */
21835 push_unparsed_function_queues (parser);
21837 /* Local variable names (and the `this' keyword) may not appear
21838 in a default argument. */
21839 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
21840 parser->local_variables_forbidden_p = true;
21842 push_defarg_context (fn);
21844 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn)),
21845 parmdecl = DECL_ARGUMENTS (fn);
21846 parm && parm != void_list_node;
21847 parm = TREE_CHAIN (parm),
21848 parmdecl = DECL_CHAIN (parmdecl))
21850 tree default_arg = TREE_PURPOSE (parm);
21852 VEC(tree,gc) *insts;
21859 if (TREE_CODE (default_arg) != DEFAULT_ARG)
21860 /* This can happen for a friend declaration for a function
21861 already declared with default arguments. */
21865 = cp_parser_late_parse_one_default_arg (parser, parmdecl,
21867 TREE_VALUE (parm));
21868 if (parsed_arg == error_mark_node)
21873 TREE_PURPOSE (parm) = parsed_arg;
21875 /* Update any instantiations we've already created. */
21876 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
21877 VEC_iterate (tree, insts, ix, copy); ix++)
21878 TREE_PURPOSE (copy) = parsed_arg;
21881 pop_defarg_context ();
21883 /* Make sure no default arg is missing. */
21884 check_default_args (fn);
21886 /* Restore the state of local_variables_forbidden_p. */
21887 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
21889 /* Restore the queue. */
21890 pop_unparsed_function_queues (parser);
21893 /* Parse the operand of `sizeof' (or a similar operator). Returns
21894 either a TYPE or an expression, depending on the form of the
21895 input. The KEYWORD indicates which kind of expression we have
21899 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
21901 tree expr = NULL_TREE;
21902 const char *saved_message;
21904 bool saved_integral_constant_expression_p;
21905 bool saved_non_integral_constant_expression_p;
21906 bool pack_expansion_p = false;
21908 /* Types cannot be defined in a `sizeof' expression. Save away the
21910 saved_message = parser->type_definition_forbidden_message;
21911 /* And create the new one. */
21912 tmp = concat ("types may not be defined in %<",
21913 IDENTIFIER_POINTER (ridpointers[keyword]),
21914 "%> expressions", NULL);
21915 parser->type_definition_forbidden_message = tmp;
21917 /* The restrictions on constant-expressions do not apply inside
21918 sizeof expressions. */
21919 saved_integral_constant_expression_p
21920 = parser->integral_constant_expression_p;
21921 saved_non_integral_constant_expression_p
21922 = parser->non_integral_constant_expression_p;
21923 parser->integral_constant_expression_p = false;
21925 /* If it's a `...', then we are computing the length of a parameter
21927 if (keyword == RID_SIZEOF
21928 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
21930 /* Consume the `...'. */
21931 cp_lexer_consume_token (parser->lexer);
21932 maybe_warn_variadic_templates ();
21934 /* Note that this is an expansion. */
21935 pack_expansion_p = true;
21938 /* Do not actually evaluate the expression. */
21939 ++cp_unevaluated_operand;
21940 ++c_inhibit_evaluation_warnings;
21941 /* If it's a `(', then we might be looking at the type-id
21943 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
21946 bool saved_in_type_id_in_expr_p;
21948 /* We can't be sure yet whether we're looking at a type-id or an
21950 cp_parser_parse_tentatively (parser);
21951 /* Consume the `('. */
21952 cp_lexer_consume_token (parser->lexer);
21953 /* Parse the type-id. */
21954 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
21955 parser->in_type_id_in_expr_p = true;
21956 type = cp_parser_type_id (parser);
21957 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
21958 /* Now, look for the trailing `)'. */
21959 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
21960 /* If all went well, then we're done. */
21961 if (cp_parser_parse_definitely (parser))
21963 cp_decl_specifier_seq decl_specs;
21965 /* Build a trivial decl-specifier-seq. */
21966 clear_decl_specs (&decl_specs);
21967 decl_specs.type = type;
21969 /* Call grokdeclarator to figure out what type this is. */
21970 expr = grokdeclarator (NULL,
21974 /*attrlist=*/NULL);
21978 /* If the type-id production did not work out, then we must be
21979 looking at the unary-expression production. */
21981 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
21982 /*cast_p=*/false, NULL);
21984 if (pack_expansion_p)
21985 /* Build a pack expansion. */
21986 expr = make_pack_expansion (expr);
21988 /* Go back to evaluating expressions. */
21989 --cp_unevaluated_operand;
21990 --c_inhibit_evaluation_warnings;
21992 /* Free the message we created. */
21994 /* And restore the old one. */
21995 parser->type_definition_forbidden_message = saved_message;
21996 parser->integral_constant_expression_p
21997 = saved_integral_constant_expression_p;
21998 parser->non_integral_constant_expression_p
21999 = saved_non_integral_constant_expression_p;
22004 /* If the current declaration has no declarator, return true. */
22007 cp_parser_declares_only_class_p (cp_parser *parser)
22009 /* If the next token is a `;' or a `,' then there is no
22011 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
22012 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
22015 /* Update the DECL_SPECS to reflect the storage class indicated by
22019 cp_parser_set_storage_class (cp_parser *parser,
22020 cp_decl_specifier_seq *decl_specs,
22022 location_t location)
22024 cp_storage_class storage_class;
22026 if (parser->in_unbraced_linkage_specification_p)
22028 error_at (location, "invalid use of %qD in linkage specification",
22029 ridpointers[keyword]);
22032 else if (decl_specs->storage_class != sc_none)
22034 decl_specs->conflicting_specifiers_p = true;
22038 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
22039 && decl_specs->specs[(int) ds_thread])
22041 error_at (location, "%<__thread%> before %qD", ridpointers[keyword]);
22042 decl_specs->specs[(int) ds_thread] = 0;
22048 storage_class = sc_auto;
22051 storage_class = sc_register;
22054 storage_class = sc_static;
22057 storage_class = sc_extern;
22060 storage_class = sc_mutable;
22063 gcc_unreachable ();
22065 decl_specs->storage_class = storage_class;
22067 /* A storage class specifier cannot be applied alongside a typedef
22068 specifier. If there is a typedef specifier present then set
22069 conflicting_specifiers_p which will trigger an error later
22070 on in grokdeclarator. */
22071 if (decl_specs->specs[(int)ds_typedef])
22072 decl_specs->conflicting_specifiers_p = true;
22075 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22076 is true, the type is a class or enum definition. */
22079 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
22081 location_t location,
22082 bool type_definition_p)
22084 decl_specs->any_specifiers_p = true;
22086 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22087 (with, for example, in "typedef int wchar_t;") we remember that
22088 this is what happened. In system headers, we ignore these
22089 declarations so that G++ can work with system headers that are not
22091 if (decl_specs->specs[(int) ds_typedef]
22092 && !type_definition_p
22093 && (type_spec == boolean_type_node
22094 || type_spec == char16_type_node
22095 || type_spec == char32_type_node
22096 || type_spec == wchar_type_node)
22097 && (decl_specs->type
22098 || decl_specs->specs[(int) ds_long]
22099 || decl_specs->specs[(int) ds_short]
22100 || decl_specs->specs[(int) ds_unsigned]
22101 || decl_specs->specs[(int) ds_signed]))
22103 decl_specs->redefined_builtin_type = type_spec;
22104 if (!decl_specs->type)
22106 decl_specs->type = type_spec;
22107 decl_specs->type_definition_p = false;
22108 decl_specs->type_location = location;
22111 else if (decl_specs->type)
22112 decl_specs->multiple_types_p = true;
22115 decl_specs->type = type_spec;
22116 decl_specs->type_definition_p = type_definition_p;
22117 decl_specs->redefined_builtin_type = NULL_TREE;
22118 decl_specs->type_location = location;
22122 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22123 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22126 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
22128 return decl_specifiers->specs[(int) ds_friend] != 0;
22131 /* Issue an error message indicating that TOKEN_DESC was expected.
22132 If KEYWORD is true, it indicated this function is called by
22133 cp_parser_require_keword and the required token can only be
22134 a indicated keyword. */
22137 cp_parser_required_error (cp_parser *parser,
22138 required_token token_desc,
22141 switch (token_desc)
22144 cp_parser_error (parser, "expected %<new%>");
22147 cp_parser_error (parser, "expected %<delete%>");
22150 cp_parser_error (parser, "expected %<return%>");
22153 cp_parser_error (parser, "expected %<while%>");
22156 cp_parser_error (parser, "expected %<extern%>");
22158 case RT_STATIC_ASSERT:
22159 cp_parser_error (parser, "expected %<static_assert%>");
22162 cp_parser_error (parser, "expected %<decltype%>");
22165 cp_parser_error (parser, "expected %<operator%>");
22168 cp_parser_error (parser, "expected %<class%>");
22171 cp_parser_error (parser, "expected %<template%>");
22174 cp_parser_error (parser, "expected %<namespace%>");
22177 cp_parser_error (parser, "expected %<using%>");
22180 cp_parser_error (parser, "expected %<asm%>");
22183 cp_parser_error (parser, "expected %<try%>");
22186 cp_parser_error (parser, "expected %<catch%>");
22189 cp_parser_error (parser, "expected %<throw%>");
22192 cp_parser_error (parser, "expected %<__label__%>");
22195 cp_parser_error (parser, "expected %<@try%>");
22197 case RT_AT_SYNCHRONIZED:
22198 cp_parser_error (parser, "expected %<@synchronized%>");
22201 cp_parser_error (parser, "expected %<@throw%>");
22203 case RT_TRANSACTION_ATOMIC:
22204 cp_parser_error (parser, "expected %<__transaction_atomic%>");
22206 case RT_TRANSACTION_RELAXED:
22207 cp_parser_error (parser, "expected %<__transaction_relaxed%>");
22214 switch (token_desc)
22217 cp_parser_error (parser, "expected %<;%>");
22219 case RT_OPEN_PAREN:
22220 cp_parser_error (parser, "expected %<(%>");
22222 case RT_CLOSE_BRACE:
22223 cp_parser_error (parser, "expected %<}%>");
22225 case RT_OPEN_BRACE:
22226 cp_parser_error (parser, "expected %<{%>");
22228 case RT_CLOSE_SQUARE:
22229 cp_parser_error (parser, "expected %<]%>");
22231 case RT_OPEN_SQUARE:
22232 cp_parser_error (parser, "expected %<[%>");
22235 cp_parser_error (parser, "expected %<,%>");
22238 cp_parser_error (parser, "expected %<::%>");
22241 cp_parser_error (parser, "expected %<<%>");
22244 cp_parser_error (parser, "expected %<>%>");
22247 cp_parser_error (parser, "expected %<=%>");
22250 cp_parser_error (parser, "expected %<...%>");
22253 cp_parser_error (parser, "expected %<*%>");
22256 cp_parser_error (parser, "expected %<~%>");
22259 cp_parser_error (parser, "expected %<:%>");
22261 case RT_COLON_SCOPE:
22262 cp_parser_error (parser, "expected %<:%> or %<::%>");
22264 case RT_CLOSE_PAREN:
22265 cp_parser_error (parser, "expected %<)%>");
22267 case RT_COMMA_CLOSE_PAREN:
22268 cp_parser_error (parser, "expected %<,%> or %<)%>");
22270 case RT_PRAGMA_EOL:
22271 cp_parser_error (parser, "expected end of line");
22274 cp_parser_error (parser, "expected identifier");
22277 cp_parser_error (parser, "expected selection-statement");
22279 case RT_INTERATION:
22280 cp_parser_error (parser, "expected iteration-statement");
22283 cp_parser_error (parser, "expected jump-statement");
22286 cp_parser_error (parser, "expected class-key");
22288 case RT_CLASS_TYPENAME_TEMPLATE:
22289 cp_parser_error (parser,
22290 "expected %<class%>, %<typename%>, or %<template%>");
22293 gcc_unreachable ();
22297 gcc_unreachable ();
22302 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22303 issue an error message indicating that TOKEN_DESC was expected.
22305 Returns the token consumed, if the token had the appropriate type.
22306 Otherwise, returns NULL. */
22309 cp_parser_require (cp_parser* parser,
22310 enum cpp_ttype type,
22311 required_token token_desc)
22313 if (cp_lexer_next_token_is (parser->lexer, type))
22314 return cp_lexer_consume_token (parser->lexer);
22317 /* Output the MESSAGE -- unless we're parsing tentatively. */
22318 if (!cp_parser_simulate_error (parser))
22319 cp_parser_required_error (parser, token_desc, /*keyword=*/false);
22324 /* An error message is produced if the next token is not '>'.
22325 All further tokens are skipped until the desired token is
22326 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22329 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
22331 /* Current level of '< ... >'. */
22332 unsigned level = 0;
22333 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22334 unsigned nesting_depth = 0;
22336 /* Are we ready, yet? If not, issue error message. */
22337 if (cp_parser_require (parser, CPP_GREATER, RT_GREATER))
22340 /* Skip tokens until the desired token is found. */
22343 /* Peek at the next token. */
22344 switch (cp_lexer_peek_token (parser->lexer)->type)
22347 if (!nesting_depth)
22352 if (cxx_dialect == cxx98)
22353 /* C++0x views the `>>' operator as two `>' tokens, but
22356 else if (!nesting_depth && level-- == 0)
22358 /* We've hit a `>>' where the first `>' closes the
22359 template argument list, and the second `>' is
22360 spurious. Just consume the `>>' and stop; we've
22361 already produced at least one error. */
22362 cp_lexer_consume_token (parser->lexer);
22365 /* Fall through for C++0x, so we handle the second `>' in
22369 if (!nesting_depth && level-- == 0)
22371 /* We've reached the token we want, consume it and stop. */
22372 cp_lexer_consume_token (parser->lexer);
22377 case CPP_OPEN_PAREN:
22378 case CPP_OPEN_SQUARE:
22382 case CPP_CLOSE_PAREN:
22383 case CPP_CLOSE_SQUARE:
22384 if (nesting_depth-- == 0)
22389 case CPP_PRAGMA_EOL:
22390 case CPP_SEMICOLON:
22391 case CPP_OPEN_BRACE:
22392 case CPP_CLOSE_BRACE:
22393 /* The '>' was probably forgotten, don't look further. */
22400 /* Consume this token. */
22401 cp_lexer_consume_token (parser->lexer);
22405 /* If the next token is the indicated keyword, consume it. Otherwise,
22406 issue an error message indicating that TOKEN_DESC was expected.
22408 Returns the token consumed, if the token had the appropriate type.
22409 Otherwise, returns NULL. */
22412 cp_parser_require_keyword (cp_parser* parser,
22414 required_token token_desc)
22416 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
22418 if (token && token->keyword != keyword)
22420 cp_parser_required_error (parser, token_desc, /*keyword=*/true);
22427 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22428 function-definition. */
22431 cp_parser_token_starts_function_definition_p (cp_token* token)
22433 return (/* An ordinary function-body begins with an `{'. */
22434 token->type == CPP_OPEN_BRACE
22435 /* A ctor-initializer begins with a `:'. */
22436 || token->type == CPP_COLON
22437 /* A function-try-block begins with `try'. */
22438 || token->keyword == RID_TRY
22439 /* A function-transaction-block begins with `__transaction_atomic'
22440 or `__transaction_relaxed'. */
22441 || token->keyword == RID_TRANSACTION_ATOMIC
22442 || token->keyword == RID_TRANSACTION_RELAXED
22443 /* The named return value extension begins with `return'. */
22444 || token->keyword == RID_RETURN);
22447 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22451 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
22455 token = cp_lexer_peek_token (parser->lexer);
22456 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
22459 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22460 C++0x) ending a template-argument. */
22463 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
22467 token = cp_lexer_peek_token (parser->lexer);
22468 return (token->type == CPP_COMMA
22469 || token->type == CPP_GREATER
22470 || token->type == CPP_ELLIPSIS
22471 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT));
22474 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22475 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22478 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
22483 token = cp_lexer_peek_nth_token (parser->lexer, n);
22484 if (token->type == CPP_LESS)
22486 /* Check for the sequence `<::' in the original code. It would be lexed as
22487 `[:', where `[' is a digraph, and there is no whitespace before
22489 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
22492 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
22493 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
22499 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22500 or none_type otherwise. */
22502 static enum tag_types
22503 cp_parser_token_is_class_key (cp_token* token)
22505 switch (token->keyword)
22510 return record_type;
22519 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22522 cp_parser_check_class_key (enum tag_types class_key, tree type)
22524 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
22525 permerror (input_location, "%qs tag used in naming %q#T",
22526 class_key == union_type ? "union"
22527 : class_key == record_type ? "struct" : "class",
22531 /* Issue an error message if DECL is redeclared with different
22532 access than its original declaration [class.access.spec/3].
22533 This applies to nested classes and nested class templates.
22537 cp_parser_check_access_in_redeclaration (tree decl, location_t location)
22539 if (!decl || !CLASS_TYPE_P (TREE_TYPE (decl)))
22542 if ((TREE_PRIVATE (decl)
22543 != (current_access_specifier == access_private_node))
22544 || (TREE_PROTECTED (decl)
22545 != (current_access_specifier == access_protected_node)))
22546 error_at (location, "%qD redeclared with different access", decl);
22549 /* Look for the `template' keyword, as a syntactic disambiguator.
22550 Return TRUE iff it is present, in which case it will be
22554 cp_parser_optional_template_keyword (cp_parser *parser)
22556 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
22558 /* The `template' keyword can only be used within templates;
22559 outside templates the parser can always figure out what is a
22560 template and what is not. */
22561 if (!processing_template_decl)
22563 cp_token *token = cp_lexer_peek_token (parser->lexer);
22564 error_at (token->location,
22565 "%<template%> (as a disambiguator) is only allowed "
22566 "within templates");
22567 /* If this part of the token stream is rescanned, the same
22568 error message would be generated. So, we purge the token
22569 from the stream. */
22570 cp_lexer_purge_token (parser->lexer);
22575 /* Consume the `template' keyword. */
22576 cp_lexer_consume_token (parser->lexer);
22584 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22585 set PARSER->SCOPE, and perform other related actions. */
22588 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
22591 struct tree_check *check_value;
22592 deferred_access_check *chk;
22593 VEC (deferred_access_check,gc) *checks;
22595 /* Get the stored value. */
22596 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
22597 /* Perform any access checks that were deferred. */
22598 checks = check_value->checks;
22601 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
22602 perform_or_defer_access_check (chk->binfo,
22606 /* Set the scope from the stored value. */
22607 parser->scope = check_value->value;
22608 parser->qualifying_scope = check_value->qualifying_scope;
22609 parser->object_scope = NULL_TREE;
22612 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22613 encounter the end of a block before what we were looking for. */
22616 cp_parser_cache_group (cp_parser *parser,
22617 enum cpp_ttype end,
22622 cp_token *token = cp_lexer_peek_token (parser->lexer);
22624 /* Abort a parenthesized expression if we encounter a semicolon. */
22625 if ((end == CPP_CLOSE_PAREN || depth == 0)
22626 && token->type == CPP_SEMICOLON)
22628 /* If we've reached the end of the file, stop. */
22629 if (token->type == CPP_EOF
22630 || (end != CPP_PRAGMA_EOL
22631 && token->type == CPP_PRAGMA_EOL))
22633 if (token->type == CPP_CLOSE_BRACE && depth == 0)
22634 /* We've hit the end of an enclosing block, so there's been some
22635 kind of syntax error. */
22638 /* If we're caching something finished by a comma (or semicolon),
22639 such as an NSDMI, don't consume the comma. */
22640 if (end == CPP_COMMA
22641 && (token->type == CPP_SEMICOLON || token->type == CPP_COMMA))
22644 /* Consume the token. */
22645 cp_lexer_consume_token (parser->lexer);
22646 /* See if it starts a new group. */
22647 if (token->type == CPP_OPEN_BRACE)
22649 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
22650 /* In theory this should probably check end == '}', but
22651 cp_parser_save_member_function_body needs it to exit
22652 after either '}' or ')' when called with ')'. */
22656 else if (token->type == CPP_OPEN_PAREN)
22658 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
22659 if (depth == 0 && end == CPP_CLOSE_PAREN)
22662 else if (token->type == CPP_PRAGMA)
22663 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
22664 else if (token->type == end)
22669 /* Begin parsing tentatively. We always save tokens while parsing
22670 tentatively so that if the tentative parsing fails we can restore the
22674 cp_parser_parse_tentatively (cp_parser* parser)
22676 /* Enter a new parsing context. */
22677 parser->context = cp_parser_context_new (parser->context);
22678 /* Begin saving tokens. */
22679 cp_lexer_save_tokens (parser->lexer);
22680 /* In order to avoid repetitive access control error messages,
22681 access checks are queued up until we are no longer parsing
22683 push_deferring_access_checks (dk_deferred);
22686 /* Commit to the currently active tentative parse. */
22689 cp_parser_commit_to_tentative_parse (cp_parser* parser)
22691 cp_parser_context *context;
22694 /* Mark all of the levels as committed. */
22695 lexer = parser->lexer;
22696 for (context = parser->context; context->next; context = context->next)
22698 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
22700 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
22701 while (!cp_lexer_saving_tokens (lexer))
22702 lexer = lexer->next;
22703 cp_lexer_commit_tokens (lexer);
22707 /* Abort the currently active tentative parse. All consumed tokens
22708 will be rolled back, and no diagnostics will be issued. */
22711 cp_parser_abort_tentative_parse (cp_parser* parser)
22713 gcc_assert (parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED
22714 || errorcount > 0);
22715 cp_parser_simulate_error (parser);
22716 /* Now, pretend that we want to see if the construct was
22717 successfully parsed. */
22718 cp_parser_parse_definitely (parser);
22721 /* Stop parsing tentatively. If a parse error has occurred, restore the
22722 token stream. Otherwise, commit to the tokens we have consumed.
22723 Returns true if no error occurred; false otherwise. */
22726 cp_parser_parse_definitely (cp_parser* parser)
22728 bool error_occurred;
22729 cp_parser_context *context;
22731 /* Remember whether or not an error occurred, since we are about to
22732 destroy that information. */
22733 error_occurred = cp_parser_error_occurred (parser);
22734 /* Remove the topmost context from the stack. */
22735 context = parser->context;
22736 parser->context = context->next;
22737 /* If no parse errors occurred, commit to the tentative parse. */
22738 if (!error_occurred)
22740 /* Commit to the tokens read tentatively, unless that was
22742 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
22743 cp_lexer_commit_tokens (parser->lexer);
22745 pop_to_parent_deferring_access_checks ();
22747 /* Otherwise, if errors occurred, roll back our state so that things
22748 are just as they were before we began the tentative parse. */
22751 cp_lexer_rollback_tokens (parser->lexer);
22752 pop_deferring_access_checks ();
22754 /* Add the context to the front of the free list. */
22755 context->next = cp_parser_context_free_list;
22756 cp_parser_context_free_list = context;
22758 return !error_occurred;
22761 /* Returns true if we are parsing tentatively and are not committed to
22762 this tentative parse. */
22765 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
22767 return (cp_parser_parsing_tentatively (parser)
22768 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
22771 /* Returns nonzero iff an error has occurred during the most recent
22772 tentative parse. */
22775 cp_parser_error_occurred (cp_parser* parser)
22777 return (cp_parser_parsing_tentatively (parser)
22778 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
22781 /* Returns nonzero if GNU extensions are allowed. */
22784 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
22786 return parser->allow_gnu_extensions_p;
22789 /* Objective-C++ Productions */
22792 /* Parse an Objective-C expression, which feeds into a primary-expression
22796 objc-message-expression
22797 objc-string-literal
22798 objc-encode-expression
22799 objc-protocol-expression
22800 objc-selector-expression
22802 Returns a tree representation of the expression. */
22805 cp_parser_objc_expression (cp_parser* parser)
22807 /* Try to figure out what kind of declaration is present. */
22808 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
22812 case CPP_OPEN_SQUARE:
22813 return cp_parser_objc_message_expression (parser);
22815 case CPP_OBJC_STRING:
22816 kwd = cp_lexer_consume_token (parser->lexer);
22817 return objc_build_string_object (kwd->u.value);
22820 switch (kwd->keyword)
22822 case RID_AT_ENCODE:
22823 return cp_parser_objc_encode_expression (parser);
22825 case RID_AT_PROTOCOL:
22826 return cp_parser_objc_protocol_expression (parser);
22828 case RID_AT_SELECTOR:
22829 return cp_parser_objc_selector_expression (parser);
22835 error_at (kwd->location,
22836 "misplaced %<@%D%> Objective-C++ construct",
22838 cp_parser_skip_to_end_of_block_or_statement (parser);
22841 return error_mark_node;
22844 /* Parse an Objective-C message expression.
22846 objc-message-expression:
22847 [ objc-message-receiver objc-message-args ]
22849 Returns a representation of an Objective-C message. */
22852 cp_parser_objc_message_expression (cp_parser* parser)
22854 tree receiver, messageargs;
22856 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
22857 receiver = cp_parser_objc_message_receiver (parser);
22858 messageargs = cp_parser_objc_message_args (parser);
22859 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
22861 return objc_build_message_expr (receiver, messageargs);
22864 /* Parse an objc-message-receiver.
22866 objc-message-receiver:
22868 simple-type-specifier
22870 Returns a representation of the type or expression. */
22873 cp_parser_objc_message_receiver (cp_parser* parser)
22877 /* An Objective-C message receiver may be either (1) a type
22878 or (2) an expression. */
22879 cp_parser_parse_tentatively (parser);
22880 rcv = cp_parser_expression (parser, false, NULL);
22882 if (cp_parser_parse_definitely (parser))
22885 rcv = cp_parser_simple_type_specifier (parser,
22886 /*decl_specs=*/NULL,
22887 CP_PARSER_FLAGS_NONE);
22889 return objc_get_class_reference (rcv);
22892 /* Parse the arguments and selectors comprising an Objective-C message.
22897 objc-selector-args , objc-comma-args
22899 objc-selector-args:
22900 objc-selector [opt] : assignment-expression
22901 objc-selector-args objc-selector [opt] : assignment-expression
22904 assignment-expression
22905 objc-comma-args , assignment-expression
22907 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
22908 selector arguments and TREE_VALUE containing a list of comma
22912 cp_parser_objc_message_args (cp_parser* parser)
22914 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
22915 bool maybe_unary_selector_p = true;
22916 cp_token *token = cp_lexer_peek_token (parser->lexer);
22918 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
22920 tree selector = NULL_TREE, arg;
22922 if (token->type != CPP_COLON)
22923 selector = cp_parser_objc_selector (parser);
22925 /* Detect if we have a unary selector. */
22926 if (maybe_unary_selector_p
22927 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
22928 return build_tree_list (selector, NULL_TREE);
22930 maybe_unary_selector_p = false;
22931 cp_parser_require (parser, CPP_COLON, RT_COLON);
22932 arg = cp_parser_assignment_expression (parser, false, NULL);
22935 = chainon (sel_args,
22936 build_tree_list (selector, arg));
22938 token = cp_lexer_peek_token (parser->lexer);
22941 /* Handle non-selector arguments, if any. */
22942 while (token->type == CPP_COMMA)
22946 cp_lexer_consume_token (parser->lexer);
22947 arg = cp_parser_assignment_expression (parser, false, NULL);
22950 = chainon (addl_args,
22951 build_tree_list (NULL_TREE, arg));
22953 token = cp_lexer_peek_token (parser->lexer);
22956 if (sel_args == NULL_TREE && addl_args == NULL_TREE)
22958 cp_parser_error (parser, "objective-c++ message argument(s) are expected");
22959 return build_tree_list (error_mark_node, error_mark_node);
22962 return build_tree_list (sel_args, addl_args);
22965 /* Parse an Objective-C encode expression.
22967 objc-encode-expression:
22968 @encode objc-typename
22970 Returns an encoded representation of the type argument. */
22973 cp_parser_objc_encode_expression (cp_parser* parser)
22978 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
22979 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
22980 token = cp_lexer_peek_token (parser->lexer);
22981 type = complete_type (cp_parser_type_id (parser));
22982 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
22986 error_at (token->location,
22987 "%<@encode%> must specify a type as an argument");
22988 return error_mark_node;
22991 /* This happens if we find @encode(T) (where T is a template
22992 typename or something dependent on a template typename) when
22993 parsing a template. In that case, we can't compile it
22994 immediately, but we rather create an AT_ENCODE_EXPR which will
22995 need to be instantiated when the template is used.
22997 if (dependent_type_p (type))
22999 tree value = build_min (AT_ENCODE_EXPR, size_type_node, type);
23000 TREE_READONLY (value) = 1;
23004 return objc_build_encode_expr (type);
23007 /* Parse an Objective-C @defs expression. */
23010 cp_parser_objc_defs_expression (cp_parser *parser)
23014 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
23015 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23016 name = cp_parser_identifier (parser);
23017 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23019 return objc_get_class_ivars (name);
23022 /* Parse an Objective-C protocol expression.
23024 objc-protocol-expression:
23025 @protocol ( identifier )
23027 Returns a representation of the protocol expression. */
23030 cp_parser_objc_protocol_expression (cp_parser* parser)
23034 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
23035 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23036 proto = cp_parser_identifier (parser);
23037 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23039 return objc_build_protocol_expr (proto);
23042 /* Parse an Objective-C selector expression.
23044 objc-selector-expression:
23045 @selector ( objc-method-signature )
23047 objc-method-signature:
23053 objc-selector-seq objc-selector :
23055 Returns a representation of the method selector. */
23058 cp_parser_objc_selector_expression (cp_parser* parser)
23060 tree sel_seq = NULL_TREE;
23061 bool maybe_unary_selector_p = true;
23063 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
23065 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
23066 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23067 token = cp_lexer_peek_token (parser->lexer);
23069 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
23070 || token->type == CPP_SCOPE)
23072 tree selector = NULL_TREE;
23074 if (token->type != CPP_COLON
23075 || token->type == CPP_SCOPE)
23076 selector = cp_parser_objc_selector (parser);
23078 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
23079 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
23081 /* Detect if we have a unary selector. */
23082 if (maybe_unary_selector_p)
23084 sel_seq = selector;
23085 goto finish_selector;
23089 cp_parser_error (parser, "expected %<:%>");
23092 maybe_unary_selector_p = false;
23093 token = cp_lexer_consume_token (parser->lexer);
23095 if (token->type == CPP_SCOPE)
23098 = chainon (sel_seq,
23099 build_tree_list (selector, NULL_TREE));
23101 = chainon (sel_seq,
23102 build_tree_list (NULL_TREE, NULL_TREE));
23106 = chainon (sel_seq,
23107 build_tree_list (selector, NULL_TREE));
23109 token = cp_lexer_peek_token (parser->lexer);
23113 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23115 return objc_build_selector_expr (loc, sel_seq);
23118 /* Parse a list of identifiers.
23120 objc-identifier-list:
23122 objc-identifier-list , identifier
23124 Returns a TREE_LIST of identifier nodes. */
23127 cp_parser_objc_identifier_list (cp_parser* parser)
23133 identifier = cp_parser_identifier (parser);
23134 if (identifier == error_mark_node)
23135 return error_mark_node;
23137 list = build_tree_list (NULL_TREE, identifier);
23138 sep = cp_lexer_peek_token (parser->lexer);
23140 while (sep->type == CPP_COMMA)
23142 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
23143 identifier = cp_parser_identifier (parser);
23144 if (identifier == error_mark_node)
23147 list = chainon (list, build_tree_list (NULL_TREE,
23149 sep = cp_lexer_peek_token (parser->lexer);
23155 /* Parse an Objective-C alias declaration.
23157 objc-alias-declaration:
23158 @compatibility_alias identifier identifier ;
23160 This function registers the alias mapping with the Objective-C front end.
23161 It returns nothing. */
23164 cp_parser_objc_alias_declaration (cp_parser* parser)
23168 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
23169 alias = cp_parser_identifier (parser);
23170 orig = cp_parser_identifier (parser);
23171 objc_declare_alias (alias, orig);
23172 cp_parser_consume_semicolon_at_end_of_statement (parser);
23175 /* Parse an Objective-C class forward-declaration.
23177 objc-class-declaration:
23178 @class objc-identifier-list ;
23180 The function registers the forward declarations with the Objective-C
23181 front end. It returns nothing. */
23184 cp_parser_objc_class_declaration (cp_parser* parser)
23186 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
23191 id = cp_parser_identifier (parser);
23192 if (id == error_mark_node)
23195 objc_declare_class (id);
23197 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23198 cp_lexer_consume_token (parser->lexer);
23202 cp_parser_consume_semicolon_at_end_of_statement (parser);
23205 /* Parse a list of Objective-C protocol references.
23207 objc-protocol-refs-opt:
23208 objc-protocol-refs [opt]
23210 objc-protocol-refs:
23211 < objc-identifier-list >
23213 Returns a TREE_LIST of identifiers, if any. */
23216 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
23218 tree protorefs = NULL_TREE;
23220 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
23222 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
23223 protorefs = cp_parser_objc_identifier_list (parser);
23224 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
23230 /* Parse a Objective-C visibility specification. */
23233 cp_parser_objc_visibility_spec (cp_parser* parser)
23235 cp_token *vis = cp_lexer_peek_token (parser->lexer);
23237 switch (vis->keyword)
23239 case RID_AT_PRIVATE:
23240 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE);
23242 case RID_AT_PROTECTED:
23243 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED);
23245 case RID_AT_PUBLIC:
23246 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC);
23248 case RID_AT_PACKAGE:
23249 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE);
23255 /* Eat '@private'/'@protected'/'@public'. */
23256 cp_lexer_consume_token (parser->lexer);
23259 /* Parse an Objective-C method type. Return 'true' if it is a class
23260 (+) method, and 'false' if it is an instance (-) method. */
23263 cp_parser_objc_method_type (cp_parser* parser)
23265 if (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS)
23271 /* Parse an Objective-C protocol qualifier. */
23274 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
23276 tree quals = NULL_TREE, node;
23277 cp_token *token = cp_lexer_peek_token (parser->lexer);
23279 node = token->u.value;
23281 while (node && TREE_CODE (node) == IDENTIFIER_NODE
23282 && (node == ridpointers [(int) RID_IN]
23283 || node == ridpointers [(int) RID_OUT]
23284 || node == ridpointers [(int) RID_INOUT]
23285 || node == ridpointers [(int) RID_BYCOPY]
23286 || node == ridpointers [(int) RID_BYREF]
23287 || node == ridpointers [(int) RID_ONEWAY]))
23289 quals = tree_cons (NULL_TREE, node, quals);
23290 cp_lexer_consume_token (parser->lexer);
23291 token = cp_lexer_peek_token (parser->lexer);
23292 node = token->u.value;
23298 /* Parse an Objective-C typename. */
23301 cp_parser_objc_typename (cp_parser* parser)
23303 tree type_name = NULL_TREE;
23305 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
23307 tree proto_quals, cp_type = NULL_TREE;
23309 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
23310 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
23312 /* An ObjC type name may consist of just protocol qualifiers, in which
23313 case the type shall default to 'id'. */
23314 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
23316 cp_type = cp_parser_type_id (parser);
23318 /* If the type could not be parsed, an error has already
23319 been produced. For error recovery, behave as if it had
23320 not been specified, which will use the default type
23322 if (cp_type == error_mark_node)
23324 cp_type = NULL_TREE;
23325 /* We need to skip to the closing parenthesis as
23326 cp_parser_type_id() does not seem to do it for
23328 cp_parser_skip_to_closing_parenthesis (parser,
23329 /*recovering=*/true,
23330 /*or_comma=*/false,
23331 /*consume_paren=*/false);
23335 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23336 type_name = build_tree_list (proto_quals, cp_type);
23342 /* Check to see if TYPE refers to an Objective-C selector name. */
23345 cp_parser_objc_selector_p (enum cpp_ttype type)
23347 return (type == CPP_NAME || type == CPP_KEYWORD
23348 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
23349 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
23350 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
23351 || type == CPP_XOR || type == CPP_XOR_EQ);
23354 /* Parse an Objective-C selector. */
23357 cp_parser_objc_selector (cp_parser* parser)
23359 cp_token *token = cp_lexer_consume_token (parser->lexer);
23361 if (!cp_parser_objc_selector_p (token->type))
23363 error_at (token->location, "invalid Objective-C++ selector name");
23364 return error_mark_node;
23367 /* C++ operator names are allowed to appear in ObjC selectors. */
23368 switch (token->type)
23370 case CPP_AND_AND: return get_identifier ("and");
23371 case CPP_AND_EQ: return get_identifier ("and_eq");
23372 case CPP_AND: return get_identifier ("bitand");
23373 case CPP_OR: return get_identifier ("bitor");
23374 case CPP_COMPL: return get_identifier ("compl");
23375 case CPP_NOT: return get_identifier ("not");
23376 case CPP_NOT_EQ: return get_identifier ("not_eq");
23377 case CPP_OR_OR: return get_identifier ("or");
23378 case CPP_OR_EQ: return get_identifier ("or_eq");
23379 case CPP_XOR: return get_identifier ("xor");
23380 case CPP_XOR_EQ: return get_identifier ("xor_eq");
23381 default: return token->u.value;
23385 /* Parse an Objective-C params list. */
23388 cp_parser_objc_method_keyword_params (cp_parser* parser, tree* attributes)
23390 tree params = NULL_TREE;
23391 bool maybe_unary_selector_p = true;
23392 cp_token *token = cp_lexer_peek_token (parser->lexer);
23394 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
23396 tree selector = NULL_TREE, type_name, identifier;
23397 tree parm_attr = NULL_TREE;
23399 if (token->keyword == RID_ATTRIBUTE)
23402 if (token->type != CPP_COLON)
23403 selector = cp_parser_objc_selector (parser);
23405 /* Detect if we have a unary selector. */
23406 if (maybe_unary_selector_p
23407 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
23409 params = selector; /* Might be followed by attributes. */
23413 maybe_unary_selector_p = false;
23414 if (!cp_parser_require (parser, CPP_COLON, RT_COLON))
23416 /* Something went quite wrong. There should be a colon
23417 here, but there is not. Stop parsing parameters. */
23420 type_name = cp_parser_objc_typename (parser);
23421 /* New ObjC allows attributes on parameters too. */
23422 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
23423 parm_attr = cp_parser_attributes_opt (parser);
23424 identifier = cp_parser_identifier (parser);
23428 objc_build_keyword_decl (selector,
23433 token = cp_lexer_peek_token (parser->lexer);
23436 if (params == NULL_TREE)
23438 cp_parser_error (parser, "objective-c++ method declaration is expected");
23439 return error_mark_node;
23442 /* We allow tail attributes for the method. */
23443 if (token->keyword == RID_ATTRIBUTE)
23445 *attributes = cp_parser_attributes_opt (parser);
23446 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
23447 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
23449 cp_parser_error (parser,
23450 "method attributes must be specified at the end");
23451 return error_mark_node;
23454 if (params == NULL_TREE)
23456 cp_parser_error (parser, "objective-c++ method declaration is expected");
23457 return error_mark_node;
23462 /* Parse the non-keyword Objective-C params. */
23465 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp,
23468 tree params = make_node (TREE_LIST);
23469 cp_token *token = cp_lexer_peek_token (parser->lexer);
23470 *ellipsisp = false; /* Initially, assume no ellipsis. */
23472 while (token->type == CPP_COMMA)
23474 cp_parameter_declarator *parmdecl;
23477 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
23478 token = cp_lexer_peek_token (parser->lexer);
23480 if (token->type == CPP_ELLIPSIS)
23482 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
23484 token = cp_lexer_peek_token (parser->lexer);
23488 /* TODO: parse attributes for tail parameters. */
23489 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
23490 parm = grokdeclarator (parmdecl->declarator,
23491 &parmdecl->decl_specifiers,
23492 PARM, /*initialized=*/0,
23493 /*attrlist=*/NULL);
23495 chainon (params, build_tree_list (NULL_TREE, parm));
23496 token = cp_lexer_peek_token (parser->lexer);
23499 /* We allow tail attributes for the method. */
23500 if (token->keyword == RID_ATTRIBUTE)
23502 if (*attributes == NULL_TREE)
23504 *attributes = cp_parser_attributes_opt (parser);
23505 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
23506 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
23510 /* We have an error, but parse the attributes, so that we can
23512 *attributes = cp_parser_attributes_opt (parser);
23514 cp_parser_error (parser,
23515 "method attributes must be specified at the end");
23516 return error_mark_node;
23522 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23525 cp_parser_objc_interstitial_code (cp_parser* parser)
23527 cp_token *token = cp_lexer_peek_token (parser->lexer);
23529 /* If the next token is `extern' and the following token is a string
23530 literal, then we have a linkage specification. */
23531 if (token->keyword == RID_EXTERN
23532 && cp_parser_is_pure_string_literal
23533 (cp_lexer_peek_nth_token (parser->lexer, 2)))
23534 cp_parser_linkage_specification (parser);
23535 /* Handle #pragma, if any. */
23536 else if (token->type == CPP_PRAGMA)
23537 cp_parser_pragma (parser, pragma_external);
23538 /* Allow stray semicolons. */
23539 else if (token->type == CPP_SEMICOLON)
23540 cp_lexer_consume_token (parser->lexer);
23541 /* Mark methods as optional or required, when building protocols. */
23542 else if (token->keyword == RID_AT_OPTIONAL)
23544 cp_lexer_consume_token (parser->lexer);
23545 objc_set_method_opt (true);
23547 else if (token->keyword == RID_AT_REQUIRED)
23549 cp_lexer_consume_token (parser->lexer);
23550 objc_set_method_opt (false);
23552 else if (token->keyword == RID_NAMESPACE)
23553 cp_parser_namespace_definition (parser);
23554 /* Other stray characters must generate errors. */
23555 else if (token->type == CPP_OPEN_BRACE || token->type == CPP_CLOSE_BRACE)
23557 cp_lexer_consume_token (parser->lexer);
23558 error ("stray %qs between Objective-C++ methods",
23559 token->type == CPP_OPEN_BRACE ? "{" : "}");
23561 /* Finally, try to parse a block-declaration, or a function-definition. */
23563 cp_parser_block_declaration (parser, /*statement_p=*/false);
23566 /* Parse a method signature. */
23569 cp_parser_objc_method_signature (cp_parser* parser, tree* attributes)
23571 tree rettype, kwdparms, optparms;
23572 bool ellipsis = false;
23573 bool is_class_method;
23575 is_class_method = cp_parser_objc_method_type (parser);
23576 rettype = cp_parser_objc_typename (parser);
23577 *attributes = NULL_TREE;
23578 kwdparms = cp_parser_objc_method_keyword_params (parser, attributes);
23579 if (kwdparms == error_mark_node)
23580 return error_mark_node;
23581 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis, attributes);
23582 if (optparms == error_mark_node)
23583 return error_mark_node;
23585 return objc_build_method_signature (is_class_method, rettype, kwdparms, optparms, ellipsis);
23589 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser* parser)
23592 cp_lexer_save_tokens (parser->lexer);
23593 tattr = cp_parser_attributes_opt (parser);
23594 gcc_assert (tattr) ;
23596 /* If the attributes are followed by a method introducer, this is not allowed.
23597 Dump the attributes and flag the situation. */
23598 if (cp_lexer_next_token_is (parser->lexer, CPP_PLUS)
23599 || cp_lexer_next_token_is (parser->lexer, CPP_MINUS))
23602 /* Otherwise, the attributes introduce some interstitial code, possibly so
23603 rewind to allow that check. */
23604 cp_lexer_rollback_tokens (parser->lexer);
23608 /* Parse an Objective-C method prototype list. */
23611 cp_parser_objc_method_prototype_list (cp_parser* parser)
23613 cp_token *token = cp_lexer_peek_token (parser->lexer);
23615 while (token->keyword != RID_AT_END && token->type != CPP_EOF)
23617 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
23619 tree attributes, sig;
23620 bool is_class_method;
23621 if (token->type == CPP_PLUS)
23622 is_class_method = true;
23624 is_class_method = false;
23625 sig = cp_parser_objc_method_signature (parser, &attributes);
23626 if (sig == error_mark_node)
23628 cp_parser_skip_to_end_of_block_or_statement (parser);
23629 token = cp_lexer_peek_token (parser->lexer);
23632 objc_add_method_declaration (is_class_method, sig, attributes);
23633 cp_parser_consume_semicolon_at_end_of_statement (parser);
23635 else if (token->keyword == RID_AT_PROPERTY)
23636 cp_parser_objc_at_property_declaration (parser);
23637 else if (token->keyword == RID_ATTRIBUTE
23638 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser))
23639 warning_at (cp_lexer_peek_token (parser->lexer)->location,
23641 "prefix attributes are ignored for methods");
23643 /* Allow for interspersed non-ObjC++ code. */
23644 cp_parser_objc_interstitial_code (parser);
23646 token = cp_lexer_peek_token (parser->lexer);
23649 if (token->type != CPP_EOF)
23650 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
23652 cp_parser_error (parser, "expected %<@end%>");
23654 objc_finish_interface ();
23657 /* Parse an Objective-C method definition list. */
23660 cp_parser_objc_method_definition_list (cp_parser* parser)
23662 cp_token *token = cp_lexer_peek_token (parser->lexer);
23664 while (token->keyword != RID_AT_END && token->type != CPP_EOF)
23668 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
23671 tree sig, attribute;
23672 bool is_class_method;
23673 if (token->type == CPP_PLUS)
23674 is_class_method = true;
23676 is_class_method = false;
23677 push_deferring_access_checks (dk_deferred);
23678 sig = cp_parser_objc_method_signature (parser, &attribute);
23679 if (sig == error_mark_node)
23681 cp_parser_skip_to_end_of_block_or_statement (parser);
23682 token = cp_lexer_peek_token (parser->lexer);
23685 objc_start_method_definition (is_class_method, sig, attribute,
23688 /* For historical reasons, we accept an optional semicolon. */
23689 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
23690 cp_lexer_consume_token (parser->lexer);
23692 ptk = cp_lexer_peek_token (parser->lexer);
23693 if (!(ptk->type == CPP_PLUS || ptk->type == CPP_MINUS
23694 || ptk->type == CPP_EOF || ptk->keyword == RID_AT_END))
23696 perform_deferred_access_checks ();
23697 stop_deferring_access_checks ();
23698 meth = cp_parser_function_definition_after_declarator (parser,
23700 pop_deferring_access_checks ();
23701 objc_finish_method_definition (meth);
23704 /* The following case will be removed once @synthesize is
23705 completely implemented. */
23706 else if (token->keyword == RID_AT_PROPERTY)
23707 cp_parser_objc_at_property_declaration (parser);
23708 else if (token->keyword == RID_AT_SYNTHESIZE)
23709 cp_parser_objc_at_synthesize_declaration (parser);
23710 else if (token->keyword == RID_AT_DYNAMIC)
23711 cp_parser_objc_at_dynamic_declaration (parser);
23712 else if (token->keyword == RID_ATTRIBUTE
23713 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser))
23714 warning_at (token->location, OPT_Wattributes,
23715 "prefix attributes are ignored for methods");
23717 /* Allow for interspersed non-ObjC++ code. */
23718 cp_parser_objc_interstitial_code (parser);
23720 token = cp_lexer_peek_token (parser->lexer);
23723 if (token->type != CPP_EOF)
23724 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
23726 cp_parser_error (parser, "expected %<@end%>");
23728 objc_finish_implementation ();
23731 /* Parse Objective-C ivars. */
23734 cp_parser_objc_class_ivars (cp_parser* parser)
23736 cp_token *token = cp_lexer_peek_token (parser->lexer);
23738 if (token->type != CPP_OPEN_BRACE)
23739 return; /* No ivars specified. */
23741 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
23742 token = cp_lexer_peek_token (parser->lexer);
23744 while (token->type != CPP_CLOSE_BRACE
23745 && token->keyword != RID_AT_END && token->type != CPP_EOF)
23747 cp_decl_specifier_seq declspecs;
23748 int decl_class_or_enum_p;
23749 tree prefix_attributes;
23751 cp_parser_objc_visibility_spec (parser);
23753 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
23756 cp_parser_decl_specifier_seq (parser,
23757 CP_PARSER_FLAGS_OPTIONAL,
23759 &decl_class_or_enum_p);
23761 /* auto, register, static, extern, mutable. */
23762 if (declspecs.storage_class != sc_none)
23764 cp_parser_error (parser, "invalid type for instance variable");
23765 declspecs.storage_class = sc_none;
23769 if (declspecs.specs[(int) ds_thread])
23771 cp_parser_error (parser, "invalid type for instance variable");
23772 declspecs.specs[(int) ds_thread] = 0;
23776 if (declspecs.specs[(int) ds_typedef])
23778 cp_parser_error (parser, "invalid type for instance variable");
23779 declspecs.specs[(int) ds_typedef] = 0;
23782 prefix_attributes = declspecs.attributes;
23783 declspecs.attributes = NULL_TREE;
23785 /* Keep going until we hit the `;' at the end of the
23787 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
23789 tree width = NULL_TREE, attributes, first_attribute, decl;
23790 cp_declarator *declarator = NULL;
23791 int ctor_dtor_or_conv_p;
23793 /* Check for a (possibly unnamed) bitfield declaration. */
23794 token = cp_lexer_peek_token (parser->lexer);
23795 if (token->type == CPP_COLON)
23798 if (token->type == CPP_NAME
23799 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
23802 /* Get the name of the bitfield. */
23803 declarator = make_id_declarator (NULL_TREE,
23804 cp_parser_identifier (parser),
23808 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
23809 /* Get the width of the bitfield. */
23811 = cp_parser_constant_expression (parser,
23812 /*allow_non_constant=*/false,
23817 /* Parse the declarator. */
23819 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
23820 &ctor_dtor_or_conv_p,
23821 /*parenthesized_p=*/NULL,
23822 /*member_p=*/false);
23825 /* Look for attributes that apply to the ivar. */
23826 attributes = cp_parser_attributes_opt (parser);
23827 /* Remember which attributes are prefix attributes and
23829 first_attribute = attributes;
23830 /* Combine the attributes. */
23831 attributes = chainon (prefix_attributes, attributes);
23834 /* Create the bitfield declaration. */
23835 decl = grokbitfield (declarator, &declspecs,
23839 decl = grokfield (declarator, &declspecs,
23840 NULL_TREE, /*init_const_expr_p=*/false,
23841 NULL_TREE, attributes);
23843 /* Add the instance variable. */
23844 if (decl != error_mark_node && decl != NULL_TREE)
23845 objc_add_instance_variable (decl);
23847 /* Reset PREFIX_ATTRIBUTES. */
23848 while (attributes && TREE_CHAIN (attributes) != first_attribute)
23849 attributes = TREE_CHAIN (attributes);
23851 TREE_CHAIN (attributes) = NULL_TREE;
23853 token = cp_lexer_peek_token (parser->lexer);
23855 if (token->type == CPP_COMMA)
23857 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
23863 cp_parser_consume_semicolon_at_end_of_statement (parser);
23864 token = cp_lexer_peek_token (parser->lexer);
23867 if (token->keyword == RID_AT_END)
23868 cp_parser_error (parser, "expected %<}%>");
23870 /* Do not consume the RID_AT_END, so it will be read again as terminating
23871 the @interface of @implementation. */
23872 if (token->keyword != RID_AT_END && token->type != CPP_EOF)
23873 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
23875 /* For historical reasons, we accept an optional semicolon. */
23876 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
23877 cp_lexer_consume_token (parser->lexer);
23880 /* Parse an Objective-C protocol declaration. */
23883 cp_parser_objc_protocol_declaration (cp_parser* parser, tree attributes)
23885 tree proto, protorefs;
23888 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
23889 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
23891 tok = cp_lexer_peek_token (parser->lexer);
23892 error_at (tok->location, "identifier expected after %<@protocol%>");
23893 cp_parser_consume_semicolon_at_end_of_statement (parser);
23897 /* See if we have a forward declaration or a definition. */
23898 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
23900 /* Try a forward declaration first. */
23901 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
23907 id = cp_parser_identifier (parser);
23908 if (id == error_mark_node)
23911 objc_declare_protocol (id, attributes);
23913 if(cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23914 cp_lexer_consume_token (parser->lexer);
23918 cp_parser_consume_semicolon_at_end_of_statement (parser);
23921 /* Ok, we got a full-fledged definition (or at least should). */
23924 proto = cp_parser_identifier (parser);
23925 protorefs = cp_parser_objc_protocol_refs_opt (parser);
23926 objc_start_protocol (proto, protorefs, attributes);
23927 cp_parser_objc_method_prototype_list (parser);
23931 /* Parse an Objective-C superclass or category. */
23934 cp_parser_objc_superclass_or_category (cp_parser *parser,
23937 tree *categ, bool *is_class_extension)
23939 cp_token *next = cp_lexer_peek_token (parser->lexer);
23941 *super = *categ = NULL_TREE;
23942 *is_class_extension = false;
23943 if (next->type == CPP_COLON)
23945 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
23946 *super = cp_parser_identifier (parser);
23948 else if (next->type == CPP_OPEN_PAREN)
23950 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
23952 /* If there is no category name, and this is an @interface, we
23953 have a class extension. */
23954 if (iface_p && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
23956 *categ = NULL_TREE;
23957 *is_class_extension = true;
23960 *categ = cp_parser_identifier (parser);
23962 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23966 /* Parse an Objective-C class interface. */
23969 cp_parser_objc_class_interface (cp_parser* parser, tree attributes)
23971 tree name, super, categ, protos;
23972 bool is_class_extension;
23974 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
23975 name = cp_parser_identifier (parser);
23976 if (name == error_mark_node)
23978 /* It's hard to recover because even if valid @interface stuff
23979 is to follow, we can't compile it (or validate it) if we
23980 don't even know which class it refers to. Let's assume this
23981 was a stray '@interface' token in the stream and skip it.
23985 cp_parser_objc_superclass_or_category (parser, true, &super, &categ,
23986 &is_class_extension);
23987 protos = cp_parser_objc_protocol_refs_opt (parser);
23989 /* We have either a class or a category on our hands. */
23990 if (categ || is_class_extension)
23991 objc_start_category_interface (name, categ, protos, attributes);
23994 objc_start_class_interface (name, super, protos, attributes);
23995 /* Handle instance variable declarations, if any. */
23996 cp_parser_objc_class_ivars (parser);
23997 objc_continue_interface ();
24000 cp_parser_objc_method_prototype_list (parser);
24003 /* Parse an Objective-C class implementation. */
24006 cp_parser_objc_class_implementation (cp_parser* parser)
24008 tree name, super, categ;
24009 bool is_class_extension;
24011 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
24012 name = cp_parser_identifier (parser);
24013 if (name == error_mark_node)
24015 /* It's hard to recover because even if valid @implementation
24016 stuff is to follow, we can't compile it (or validate it) if
24017 we don't even know which class it refers to. Let's assume
24018 this was a stray '@implementation' token in the stream and
24023 cp_parser_objc_superclass_or_category (parser, false, &super, &categ,
24024 &is_class_extension);
24026 /* We have either a class or a category on our hands. */
24028 objc_start_category_implementation (name, categ);
24031 objc_start_class_implementation (name, super);
24032 /* Handle instance variable declarations, if any. */
24033 cp_parser_objc_class_ivars (parser);
24034 objc_continue_implementation ();
24037 cp_parser_objc_method_definition_list (parser);
24040 /* Consume the @end token and finish off the implementation. */
24043 cp_parser_objc_end_implementation (cp_parser* parser)
24045 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
24046 objc_finish_implementation ();
24049 /* Parse an Objective-C declaration. */
24052 cp_parser_objc_declaration (cp_parser* parser, tree attributes)
24054 /* Try to figure out what kind of declaration is present. */
24055 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
24058 switch (kwd->keyword)
24063 error_at (kwd->location, "attributes may not be specified before"
24064 " the %<@%D%> Objective-C++ keyword",
24068 case RID_AT_IMPLEMENTATION:
24069 warning_at (kwd->location, OPT_Wattributes,
24070 "prefix attributes are ignored before %<@%D%>",
24077 switch (kwd->keyword)
24080 cp_parser_objc_alias_declaration (parser);
24083 cp_parser_objc_class_declaration (parser);
24085 case RID_AT_PROTOCOL:
24086 cp_parser_objc_protocol_declaration (parser, attributes);
24088 case RID_AT_INTERFACE:
24089 cp_parser_objc_class_interface (parser, attributes);
24091 case RID_AT_IMPLEMENTATION:
24092 cp_parser_objc_class_implementation (parser);
24095 cp_parser_objc_end_implementation (parser);
24098 error_at (kwd->location, "misplaced %<@%D%> Objective-C++ construct",
24100 cp_parser_skip_to_end_of_block_or_statement (parser);
24104 /* Parse an Objective-C try-catch-finally statement.
24106 objc-try-catch-finally-stmt:
24107 @try compound-statement objc-catch-clause-seq [opt]
24108 objc-finally-clause [opt]
24110 objc-catch-clause-seq:
24111 objc-catch-clause objc-catch-clause-seq [opt]
24114 @catch ( objc-exception-declaration ) compound-statement
24116 objc-finally-clause:
24117 @finally compound-statement
24119 objc-exception-declaration:
24120 parameter-declaration
24123 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24127 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24128 for C. Keep them in sync. */
24131 cp_parser_objc_try_catch_finally_statement (cp_parser *parser)
24133 location_t location;
24136 cp_parser_require_keyword (parser, RID_AT_TRY, RT_AT_TRY);
24137 location = cp_lexer_peek_token (parser->lexer)->location;
24138 objc_maybe_warn_exceptions (location);
24139 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24140 node, lest it get absorbed into the surrounding block. */
24141 stmt = push_stmt_list ();
24142 cp_parser_compound_statement (parser, NULL, false, false);
24143 objc_begin_try_stmt (location, pop_stmt_list (stmt));
24145 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
24147 cp_parameter_declarator *parm;
24148 tree parameter_declaration = error_mark_node;
24149 bool seen_open_paren = false;
24151 cp_lexer_consume_token (parser->lexer);
24152 if (cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24153 seen_open_paren = true;
24154 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
24156 /* We have "@catch (...)" (where the '...' are literally
24157 what is in the code). Skip the '...'.
24158 parameter_declaration is set to NULL_TREE, and
24159 objc_being_catch_clauses() knows that that means
24161 cp_lexer_consume_token (parser->lexer);
24162 parameter_declaration = NULL_TREE;
24166 /* We have "@catch (NSException *exception)" or something
24167 like that. Parse the parameter declaration. */
24168 parm = cp_parser_parameter_declaration (parser, false, NULL);
24170 parameter_declaration = error_mark_node;
24172 parameter_declaration = grokdeclarator (parm->declarator,
24173 &parm->decl_specifiers,
24174 PARM, /*initialized=*/0,
24175 /*attrlist=*/NULL);
24177 if (seen_open_paren)
24178 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
24181 /* If there was no open parenthesis, we are recovering from
24182 an error, and we are trying to figure out what mistake
24183 the user has made. */
24185 /* If there is an immediate closing parenthesis, the user
24186 probably forgot the opening one (ie, they typed "@catch
24187 NSException *e)". Parse the closing parenthesis and keep
24189 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
24190 cp_lexer_consume_token (parser->lexer);
24192 /* If these is no immediate closing parenthesis, the user
24193 probably doesn't know that parenthesis are required at
24194 all (ie, they typed "@catch NSException *e"). So, just
24195 forget about the closing parenthesis and keep going. */
24197 objc_begin_catch_clause (parameter_declaration);
24198 cp_parser_compound_statement (parser, NULL, false, false);
24199 objc_finish_catch_clause ();
24201 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
24203 cp_lexer_consume_token (parser->lexer);
24204 location = cp_lexer_peek_token (parser->lexer)->location;
24205 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24206 node, lest it get absorbed into the surrounding block. */
24207 stmt = push_stmt_list ();
24208 cp_parser_compound_statement (parser, NULL, false, false);
24209 objc_build_finally_clause (location, pop_stmt_list (stmt));
24212 return objc_finish_try_stmt ();
24215 /* Parse an Objective-C synchronized statement.
24217 objc-synchronized-stmt:
24218 @synchronized ( expression ) compound-statement
24220 Returns NULL_TREE. */
24223 cp_parser_objc_synchronized_statement (cp_parser *parser)
24225 location_t location;
24228 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, RT_AT_SYNCHRONIZED);
24230 location = cp_lexer_peek_token (parser->lexer)->location;
24231 objc_maybe_warn_exceptions (location);
24232 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
24233 lock = cp_parser_expression (parser, false, NULL);
24234 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
24236 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24237 node, lest it get absorbed into the surrounding block. */
24238 stmt = push_stmt_list ();
24239 cp_parser_compound_statement (parser, NULL, false, false);
24241 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
24244 /* Parse an Objective-C throw statement.
24247 @throw assignment-expression [opt] ;
24249 Returns a constructed '@throw' statement. */
24252 cp_parser_objc_throw_statement (cp_parser *parser)
24254 tree expr = NULL_TREE;
24255 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
24257 cp_parser_require_keyword (parser, RID_AT_THROW, RT_AT_THROW);
24259 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24260 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
24262 cp_parser_consume_semicolon_at_end_of_statement (parser);
24264 return objc_build_throw_stmt (loc, expr);
24267 /* Parse an Objective-C statement. */
24270 cp_parser_objc_statement (cp_parser * parser)
24272 /* Try to figure out what kind of declaration is present. */
24273 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
24275 switch (kwd->keyword)
24278 return cp_parser_objc_try_catch_finally_statement (parser);
24279 case RID_AT_SYNCHRONIZED:
24280 return cp_parser_objc_synchronized_statement (parser);
24282 return cp_parser_objc_throw_statement (parser);
24284 error_at (kwd->location, "misplaced %<@%D%> Objective-C++ construct",
24286 cp_parser_skip_to_end_of_block_or_statement (parser);
24289 return error_mark_node;
24292 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24293 look ahead to see if an objc keyword follows the attributes. This
24294 is to detect the use of prefix attributes on ObjC @interface and
24298 cp_parser_objc_valid_prefix_attributes (cp_parser* parser, tree *attrib)
24300 cp_lexer_save_tokens (parser->lexer);
24301 *attrib = cp_parser_attributes_opt (parser);
24302 gcc_assert (*attrib);
24303 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser->lexer)->keyword))
24305 cp_lexer_commit_tokens (parser->lexer);
24308 cp_lexer_rollback_tokens (parser->lexer);
24312 /* This routine is a minimal replacement for
24313 c_parser_struct_declaration () used when parsing the list of
24314 types/names or ObjC++ properties. For example, when parsing the
24317 @property (readonly) int a, b, c;
24319 this function is responsible for parsing "int a, int b, int c" and
24320 returning the declarations as CHAIN of DECLs.
24322 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24323 similar parsing. */
24325 cp_parser_objc_struct_declaration (cp_parser *parser)
24327 tree decls = NULL_TREE;
24328 cp_decl_specifier_seq declspecs;
24329 int decl_class_or_enum_p;
24330 tree prefix_attributes;
24332 cp_parser_decl_specifier_seq (parser,
24333 CP_PARSER_FLAGS_NONE,
24335 &decl_class_or_enum_p);
24337 if (declspecs.type == error_mark_node)
24338 return error_mark_node;
24340 /* auto, register, static, extern, mutable. */
24341 if (declspecs.storage_class != sc_none)
24343 cp_parser_error (parser, "invalid type for property");
24344 declspecs.storage_class = sc_none;
24348 if (declspecs.specs[(int) ds_thread])
24350 cp_parser_error (parser, "invalid type for property");
24351 declspecs.specs[(int) ds_thread] = 0;
24355 if (declspecs.specs[(int) ds_typedef])
24357 cp_parser_error (parser, "invalid type for property");
24358 declspecs.specs[(int) ds_typedef] = 0;
24361 prefix_attributes = declspecs.attributes;
24362 declspecs.attributes = NULL_TREE;
24364 /* Keep going until we hit the `;' at the end of the declaration. */
24365 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24367 tree attributes, first_attribute, decl;
24368 cp_declarator *declarator;
24371 /* Parse the declarator. */
24372 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
24373 NULL, NULL, false);
24375 /* Look for attributes that apply to the ivar. */
24376 attributes = cp_parser_attributes_opt (parser);
24377 /* Remember which attributes are prefix attributes and
24379 first_attribute = attributes;
24380 /* Combine the attributes. */
24381 attributes = chainon (prefix_attributes, attributes);
24383 decl = grokfield (declarator, &declspecs,
24384 NULL_TREE, /*init_const_expr_p=*/false,
24385 NULL_TREE, attributes);
24387 if (decl == error_mark_node || decl == NULL_TREE)
24388 return error_mark_node;
24390 /* Reset PREFIX_ATTRIBUTES. */
24391 while (attributes && TREE_CHAIN (attributes) != first_attribute)
24392 attributes = TREE_CHAIN (attributes);
24394 TREE_CHAIN (attributes) = NULL_TREE;
24396 DECL_CHAIN (decl) = decls;
24399 token = cp_lexer_peek_token (parser->lexer);
24400 if (token->type == CPP_COMMA)
24402 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
24411 /* Parse an Objective-C @property declaration. The syntax is:
24413 objc-property-declaration:
24414 '@property' objc-property-attributes[opt] struct-declaration ;
24416 objc-property-attributes:
24417 '(' objc-property-attribute-list ')'
24419 objc-property-attribute-list:
24420 objc-property-attribute
24421 objc-property-attribute-list, objc-property-attribute
24423 objc-property-attribute
24424 'getter' = identifier
24425 'setter' = identifier
24434 @property NSString *name;
24435 @property (readonly) id object;
24436 @property (retain, nonatomic, getter=getTheName) id name;
24437 @property int a, b, c;
24439 PS: This function is identical to
24440 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24442 cp_parser_objc_at_property_declaration (cp_parser *parser)
24444 /* The following variables hold the attributes of the properties as
24445 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24446 seen. When we see an attribute, we set them to 'true' (if they
24447 are boolean properties) or to the identifier (if they have an
24448 argument, ie, for getter and setter). Note that here we only
24449 parse the list of attributes, check the syntax and accumulate the
24450 attributes that we find. objc_add_property_declaration() will
24451 then process the information. */
24452 bool property_assign = false;
24453 bool property_copy = false;
24454 tree property_getter_ident = NULL_TREE;
24455 bool property_nonatomic = false;
24456 bool property_readonly = false;
24457 bool property_readwrite = false;
24458 bool property_retain = false;
24459 tree property_setter_ident = NULL_TREE;
24461 /* 'properties' is the list of properties that we read. Usually a
24462 single one, but maybe more (eg, in "@property int a, b, c;" there
24467 loc = cp_lexer_peek_token (parser->lexer)->location;
24469 cp_lexer_consume_token (parser->lexer); /* Eat '@property'. */
24471 /* Parse the optional attribute list... */
24472 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
24475 cp_lexer_consume_token (parser->lexer);
24479 bool syntax_error = false;
24480 cp_token *token = cp_lexer_peek_token (parser->lexer);
24483 if (token->type != CPP_NAME)
24485 cp_parser_error (parser, "expected identifier");
24488 keyword = C_RID_CODE (token->u.value);
24489 cp_lexer_consume_token (parser->lexer);
24492 case RID_ASSIGN: property_assign = true; break;
24493 case RID_COPY: property_copy = true; break;
24494 case RID_NONATOMIC: property_nonatomic = true; break;
24495 case RID_READONLY: property_readonly = true; break;
24496 case RID_READWRITE: property_readwrite = true; break;
24497 case RID_RETAIN: property_retain = true; break;
24501 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
24503 if (keyword == RID_GETTER)
24504 cp_parser_error (parser,
24505 "missing %<=%> (after %<getter%> attribute)");
24507 cp_parser_error (parser,
24508 "missing %<=%> (after %<setter%> attribute)");
24509 syntax_error = true;
24512 cp_lexer_consume_token (parser->lexer); /* eat the = */
24513 if (!cp_parser_objc_selector_p (cp_lexer_peek_token (parser->lexer)->type))
24515 cp_parser_error (parser, "expected identifier");
24516 syntax_error = true;
24519 if (keyword == RID_SETTER)
24521 if (property_setter_ident != NULL_TREE)
24523 cp_parser_error (parser, "the %<setter%> attribute may only be specified once");
24524 cp_lexer_consume_token (parser->lexer);
24527 property_setter_ident = cp_parser_objc_selector (parser);
24528 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
24529 cp_parser_error (parser, "setter name must terminate with %<:%>");
24531 cp_lexer_consume_token (parser->lexer);
24535 if (property_getter_ident != NULL_TREE)
24537 cp_parser_error (parser, "the %<getter%> attribute may only be specified once");
24538 cp_lexer_consume_token (parser->lexer);
24541 property_getter_ident = cp_parser_objc_selector (parser);
24545 cp_parser_error (parser, "unknown property attribute");
24546 syntax_error = true;
24553 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24554 cp_lexer_consume_token (parser->lexer);
24559 /* FIXME: "@property (setter, assign);" will generate a spurious
24560 "error: expected ‘)’ before ‘,’ token". This is because
24561 cp_parser_require, unlike the C counterpart, will produce an
24562 error even if we are in error recovery. */
24563 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24565 cp_parser_skip_to_closing_parenthesis (parser,
24566 /*recovering=*/true,
24567 /*or_comma=*/false,
24568 /*consume_paren=*/true);
24572 /* ... and the property declaration(s). */
24573 properties = cp_parser_objc_struct_declaration (parser);
24575 if (properties == error_mark_node)
24577 cp_parser_skip_to_end_of_statement (parser);
24578 /* If the next token is now a `;', consume it. */
24579 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
24580 cp_lexer_consume_token (parser->lexer);
24584 if (properties == NULL_TREE)
24585 cp_parser_error (parser, "expected identifier");
24588 /* Comma-separated properties are chained together in
24589 reverse order; add them one by one. */
24590 properties = nreverse (properties);
24592 for (; properties; properties = TREE_CHAIN (properties))
24593 objc_add_property_declaration (loc, copy_node (properties),
24594 property_readonly, property_readwrite,
24595 property_assign, property_retain,
24596 property_copy, property_nonatomic,
24597 property_getter_ident, property_setter_ident);
24600 cp_parser_consume_semicolon_at_end_of_statement (parser);
24603 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24605 objc-synthesize-declaration:
24606 @synthesize objc-synthesize-identifier-list ;
24608 objc-synthesize-identifier-list:
24609 objc-synthesize-identifier
24610 objc-synthesize-identifier-list, objc-synthesize-identifier
24612 objc-synthesize-identifier
24614 identifier = identifier
24617 @synthesize MyProperty;
24618 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24620 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24621 for C. Keep them in sync.
24624 cp_parser_objc_at_synthesize_declaration (cp_parser *parser)
24626 tree list = NULL_TREE;
24628 loc = cp_lexer_peek_token (parser->lexer)->location;
24630 cp_lexer_consume_token (parser->lexer); /* Eat '@synthesize'. */
24633 tree property, ivar;
24634 property = cp_parser_identifier (parser);
24635 if (property == error_mark_node)
24637 cp_parser_consume_semicolon_at_end_of_statement (parser);
24640 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
24642 cp_lexer_consume_token (parser->lexer);
24643 ivar = cp_parser_identifier (parser);
24644 if (ivar == error_mark_node)
24646 cp_parser_consume_semicolon_at_end_of_statement (parser);
24652 list = chainon (list, build_tree_list (ivar, property));
24653 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24654 cp_lexer_consume_token (parser->lexer);
24658 cp_parser_consume_semicolon_at_end_of_statement (parser);
24659 objc_add_synthesize_declaration (loc, list);
24662 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24664 objc-dynamic-declaration:
24665 @dynamic identifier-list ;
24668 @dynamic MyProperty;
24669 @dynamic MyProperty, AnotherProperty;
24671 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24672 for C. Keep them in sync.
24675 cp_parser_objc_at_dynamic_declaration (cp_parser *parser)
24677 tree list = NULL_TREE;
24679 loc = cp_lexer_peek_token (parser->lexer)->location;
24681 cp_lexer_consume_token (parser->lexer); /* Eat '@dynamic'. */
24685 property = cp_parser_identifier (parser);
24686 if (property == error_mark_node)
24688 cp_parser_consume_semicolon_at_end_of_statement (parser);
24691 list = chainon (list, build_tree_list (NULL, property));
24692 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24693 cp_lexer_consume_token (parser->lexer);
24697 cp_parser_consume_semicolon_at_end_of_statement (parser);
24698 objc_add_dynamic_declaration (loc, list);
24702 /* OpenMP 2.5 parsing routines. */
24704 /* Returns name of the next clause.
24705 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
24706 the token is not consumed. Otherwise appropriate pragma_omp_clause is
24707 returned and the token is consumed. */
24709 static pragma_omp_clause
24710 cp_parser_omp_clause_name (cp_parser *parser)
24712 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
24714 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
24715 result = PRAGMA_OMP_CLAUSE_IF;
24716 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
24717 result = PRAGMA_OMP_CLAUSE_DEFAULT;
24718 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
24719 result = PRAGMA_OMP_CLAUSE_PRIVATE;
24720 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
24722 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
24723 const char *p = IDENTIFIER_POINTER (id);
24728 if (!strcmp ("collapse", p))
24729 result = PRAGMA_OMP_CLAUSE_COLLAPSE;
24730 else if (!strcmp ("copyin", p))
24731 result = PRAGMA_OMP_CLAUSE_COPYIN;
24732 else if (!strcmp ("copyprivate", p))
24733 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
24736 if (!strcmp ("final", p))
24737 result = PRAGMA_OMP_CLAUSE_FINAL;
24738 else if (!strcmp ("firstprivate", p))
24739 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
24742 if (!strcmp ("lastprivate", p))
24743 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
24746 if (!strcmp ("mergeable", p))
24747 result = PRAGMA_OMP_CLAUSE_MERGEABLE;
24750 if (!strcmp ("nowait", p))
24751 result = PRAGMA_OMP_CLAUSE_NOWAIT;
24752 else if (!strcmp ("num_threads", p))
24753 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
24756 if (!strcmp ("ordered", p))
24757 result = PRAGMA_OMP_CLAUSE_ORDERED;
24760 if (!strcmp ("reduction", p))
24761 result = PRAGMA_OMP_CLAUSE_REDUCTION;
24764 if (!strcmp ("schedule", p))
24765 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
24766 else if (!strcmp ("shared", p))
24767 result = PRAGMA_OMP_CLAUSE_SHARED;
24770 if (!strcmp ("untied", p))
24771 result = PRAGMA_OMP_CLAUSE_UNTIED;
24776 if (result != PRAGMA_OMP_CLAUSE_NONE)
24777 cp_lexer_consume_token (parser->lexer);
24782 /* Validate that a clause of the given type does not already exist. */
24785 check_no_duplicate_clause (tree clauses, enum omp_clause_code code,
24786 const char *name, location_t location)
24790 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
24791 if (OMP_CLAUSE_CODE (c) == code)
24793 error_at (location, "too many %qs clauses", name);
24801 variable-list , identifier
24803 In addition, we match a closing parenthesis. An opening parenthesis
24804 will have been consumed by the caller.
24806 If KIND is nonzero, create the appropriate node and install the decl
24807 in OMP_CLAUSE_DECL and add the node to the head of the list.
24809 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
24810 return the list created. */
24813 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
24821 token = cp_lexer_peek_token (parser->lexer);
24822 name = cp_parser_id_expression (parser, /*template_p=*/false,
24823 /*check_dependency_p=*/true,
24824 /*template_p=*/NULL,
24825 /*declarator_p=*/false,
24826 /*optional_p=*/false);
24827 if (name == error_mark_node)
24830 decl = cp_parser_lookup_name_simple (parser, name, token->location);
24831 if (decl == error_mark_node)
24832 cp_parser_name_lookup_error (parser, name, decl, NLE_NULL,
24834 else if (kind != 0)
24836 tree u = build_omp_clause (token->location, kind);
24837 OMP_CLAUSE_DECL (u) = decl;
24838 OMP_CLAUSE_CHAIN (u) = list;
24842 list = tree_cons (decl, NULL_TREE, list);
24845 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
24847 cp_lexer_consume_token (parser->lexer);
24850 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24854 /* Try to resync to an unnested comma. Copied from
24855 cp_parser_parenthesized_expression_list. */
24857 ending = cp_parser_skip_to_closing_parenthesis (parser,
24858 /*recovering=*/true,
24860 /*consume_paren=*/true);
24868 /* Similarly, but expect leading and trailing parenthesis. This is a very
24869 common case for omp clauses. */
24872 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
24874 if (cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24875 return cp_parser_omp_var_list_no_open (parser, kind, list);
24880 collapse ( constant-expression ) */
24883 cp_parser_omp_clause_collapse (cp_parser *parser, tree list, location_t location)
24889 loc = cp_lexer_peek_token (parser->lexer)->location;
24890 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24893 num = cp_parser_constant_expression (parser, false, NULL);
24895 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24896 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
24897 /*or_comma=*/false,
24898 /*consume_paren=*/true);
24900 if (num == error_mark_node)
24902 num = fold_non_dependent_expr (num);
24903 if (!INTEGRAL_TYPE_P (TREE_TYPE (num))
24904 || !host_integerp (num, 0)
24905 || (n = tree_low_cst (num, 0)) <= 0
24908 error_at (loc, "collapse argument needs positive constant integer expression");
24912 check_no_duplicate_clause (list, OMP_CLAUSE_COLLAPSE, "collapse", location);
24913 c = build_omp_clause (loc, OMP_CLAUSE_COLLAPSE);
24914 OMP_CLAUSE_CHAIN (c) = list;
24915 OMP_CLAUSE_COLLAPSE_EXPR (c) = num;
24921 default ( shared | none ) */
24924 cp_parser_omp_clause_default (cp_parser *parser, tree list, location_t location)
24926 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
24929 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24931 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
24933 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
24934 const char *p = IDENTIFIER_POINTER (id);
24939 if (strcmp ("none", p) != 0)
24941 kind = OMP_CLAUSE_DEFAULT_NONE;
24945 if (strcmp ("shared", p) != 0)
24947 kind = OMP_CLAUSE_DEFAULT_SHARED;
24954 cp_lexer_consume_token (parser->lexer);
24959 cp_parser_error (parser, "expected %<none%> or %<shared%>");
24962 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24963 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
24964 /*or_comma=*/false,
24965 /*consume_paren=*/true);
24967 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
24970 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default", location);
24971 c = build_omp_clause (location, OMP_CLAUSE_DEFAULT);
24972 OMP_CLAUSE_CHAIN (c) = list;
24973 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
24979 final ( expression ) */
24982 cp_parser_omp_clause_final (cp_parser *parser, tree list, location_t location)
24986 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24989 t = cp_parser_condition (parser);
24991 if (t == error_mark_node
24992 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24993 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
24994 /*or_comma=*/false,
24995 /*consume_paren=*/true);
24997 check_no_duplicate_clause (list, OMP_CLAUSE_FINAL, "final", location);
24999 c = build_omp_clause (location, OMP_CLAUSE_FINAL);
25000 OMP_CLAUSE_FINAL_EXPR (c) = t;
25001 OMP_CLAUSE_CHAIN (c) = list;
25007 if ( expression ) */
25010 cp_parser_omp_clause_if (cp_parser *parser, tree list, location_t location)
25014 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25017 t = cp_parser_condition (parser);
25019 if (t == error_mark_node
25020 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25021 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25022 /*or_comma=*/false,
25023 /*consume_paren=*/true);
25025 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if", location);
25027 c = build_omp_clause (location, OMP_CLAUSE_IF);
25028 OMP_CLAUSE_IF_EXPR (c) = t;
25029 OMP_CLAUSE_CHAIN (c) = list;
25038 cp_parser_omp_clause_mergeable (cp_parser *parser ATTRIBUTE_UNUSED,
25039 tree list, location_t location)
25043 check_no_duplicate_clause (list, OMP_CLAUSE_MERGEABLE, "mergeable",
25046 c = build_omp_clause (location, OMP_CLAUSE_MERGEABLE);
25047 OMP_CLAUSE_CHAIN (c) = list;
25055 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED,
25056 tree list, location_t location)
25060 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait", location);
25062 c = build_omp_clause (location, OMP_CLAUSE_NOWAIT);
25063 OMP_CLAUSE_CHAIN (c) = list;
25068 num_threads ( expression ) */
25071 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list,
25072 location_t location)
25076 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25079 t = cp_parser_expression (parser, false, NULL);
25081 if (t == error_mark_node
25082 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25083 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25084 /*or_comma=*/false,
25085 /*consume_paren=*/true);
25087 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS,
25088 "num_threads", location);
25090 c = build_omp_clause (location, OMP_CLAUSE_NUM_THREADS);
25091 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
25092 OMP_CLAUSE_CHAIN (c) = list;
25101 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED,
25102 tree list, location_t location)
25106 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED,
25107 "ordered", location);
25109 c = build_omp_clause (location, OMP_CLAUSE_ORDERED);
25110 OMP_CLAUSE_CHAIN (c) = list;
25115 reduction ( reduction-operator : variable-list )
25117 reduction-operator:
25118 One of: + * - & ^ | && ||
25122 reduction-operator:
25123 One of: + * - & ^ | && || min max */
25126 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
25128 enum tree_code code;
25131 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25134 switch (cp_lexer_peek_token (parser->lexer)->type)
25146 code = BIT_AND_EXPR;
25149 code = BIT_XOR_EXPR;
25152 code = BIT_IOR_EXPR;
25155 code = TRUTH_ANDIF_EXPR;
25158 code = TRUTH_ORIF_EXPR;
25162 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25163 const char *p = IDENTIFIER_POINTER (id);
25165 if (strcmp (p, "min") == 0)
25170 if (strcmp (p, "max") == 0)
25178 cp_parser_error (parser, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
25179 "%<|%>, %<&&%>, %<||%>, %<min%> or %<max%>");
25181 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25182 /*or_comma=*/false,
25183 /*consume_paren=*/true);
25186 cp_lexer_consume_token (parser->lexer);
25188 if (!cp_parser_require (parser, CPP_COLON, RT_COLON))
25191 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
25192 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
25193 OMP_CLAUSE_REDUCTION_CODE (c) = code;
25199 schedule ( schedule-kind )
25200 schedule ( schedule-kind , expression )
25203 static | dynamic | guided | runtime | auto */
25206 cp_parser_omp_clause_schedule (cp_parser *parser, tree list, location_t location)
25210 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25213 c = build_omp_clause (location, OMP_CLAUSE_SCHEDULE);
25215 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
25217 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25218 const char *p = IDENTIFIER_POINTER (id);
25223 if (strcmp ("dynamic", p) != 0)
25225 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
25229 if (strcmp ("guided", p) != 0)
25231 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
25235 if (strcmp ("runtime", p) != 0)
25237 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
25244 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
25245 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
25246 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AUTO))
25247 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_AUTO;
25250 cp_lexer_consume_token (parser->lexer);
25252 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
25255 cp_lexer_consume_token (parser->lexer);
25257 token = cp_lexer_peek_token (parser->lexer);
25258 t = cp_parser_assignment_expression (parser, false, NULL);
25260 if (t == error_mark_node)
25262 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
25263 error_at (token->location, "schedule %<runtime%> does not take "
25264 "a %<chunk_size%> parameter");
25265 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_AUTO)
25266 error_at (token->location, "schedule %<auto%> does not take "
25267 "a %<chunk_size%> parameter");
25269 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
25271 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25274 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_COMMA_CLOSE_PAREN))
25277 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule", location);
25278 OMP_CLAUSE_CHAIN (c) = list;
25282 cp_parser_error (parser, "invalid schedule kind");
25284 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25285 /*or_comma=*/false,
25286 /*consume_paren=*/true);
25294 cp_parser_omp_clause_untied (cp_parser *parser ATTRIBUTE_UNUSED,
25295 tree list, location_t location)
25299 check_no_duplicate_clause (list, OMP_CLAUSE_UNTIED, "untied", location);
25301 c = build_omp_clause (location, OMP_CLAUSE_UNTIED);
25302 OMP_CLAUSE_CHAIN (c) = list;
25306 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25307 is a bitmask in MASK. Return the list of clauses found; the result
25308 of clause default goes in *pdefault. */
25311 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
25312 const char *where, cp_token *pragma_tok)
25314 tree clauses = NULL;
25316 cp_token *token = NULL;
25318 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
25320 pragma_omp_clause c_kind;
25321 const char *c_name;
25322 tree prev = clauses;
25324 if (!first && cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
25325 cp_lexer_consume_token (parser->lexer);
25327 token = cp_lexer_peek_token (parser->lexer);
25328 c_kind = cp_parser_omp_clause_name (parser);
25333 case PRAGMA_OMP_CLAUSE_COLLAPSE:
25334 clauses = cp_parser_omp_clause_collapse (parser, clauses,
25336 c_name = "collapse";
25338 case PRAGMA_OMP_CLAUSE_COPYIN:
25339 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
25342 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
25343 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
25345 c_name = "copyprivate";
25347 case PRAGMA_OMP_CLAUSE_DEFAULT:
25348 clauses = cp_parser_omp_clause_default (parser, clauses,
25350 c_name = "default";
25352 case PRAGMA_OMP_CLAUSE_FINAL:
25353 clauses = cp_parser_omp_clause_final (parser, clauses, token->location);
25356 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
25357 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
25359 c_name = "firstprivate";
25361 case PRAGMA_OMP_CLAUSE_IF:
25362 clauses = cp_parser_omp_clause_if (parser, clauses, token->location);
25365 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
25366 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
25368 c_name = "lastprivate";
25370 case PRAGMA_OMP_CLAUSE_MERGEABLE:
25371 clauses = cp_parser_omp_clause_mergeable (parser, clauses,
25373 c_name = "mergeable";
25375 case PRAGMA_OMP_CLAUSE_NOWAIT:
25376 clauses = cp_parser_omp_clause_nowait (parser, clauses, token->location);
25379 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
25380 clauses = cp_parser_omp_clause_num_threads (parser, clauses,
25382 c_name = "num_threads";
25384 case PRAGMA_OMP_CLAUSE_ORDERED:
25385 clauses = cp_parser_omp_clause_ordered (parser, clauses,
25387 c_name = "ordered";
25389 case PRAGMA_OMP_CLAUSE_PRIVATE:
25390 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
25392 c_name = "private";
25394 case PRAGMA_OMP_CLAUSE_REDUCTION:
25395 clauses = cp_parser_omp_clause_reduction (parser, clauses);
25396 c_name = "reduction";
25398 case PRAGMA_OMP_CLAUSE_SCHEDULE:
25399 clauses = cp_parser_omp_clause_schedule (parser, clauses,
25401 c_name = "schedule";
25403 case PRAGMA_OMP_CLAUSE_SHARED:
25404 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
25408 case PRAGMA_OMP_CLAUSE_UNTIED:
25409 clauses = cp_parser_omp_clause_untied (parser, clauses,
25414 cp_parser_error (parser, "expected %<#pragma omp%> clause");
25418 if (((mask >> c_kind) & 1) == 0)
25420 /* Remove the invalid clause(s) from the list to avoid
25421 confusing the rest of the compiler. */
25423 error_at (token->location, "%qs is not valid for %qs", c_name, where);
25427 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
25428 return finish_omp_clauses (clauses);
25435 In practice, we're also interested in adding the statement to an
25436 outer node. So it is convenient if we work around the fact that
25437 cp_parser_statement calls add_stmt. */
25440 cp_parser_begin_omp_structured_block (cp_parser *parser)
25442 unsigned save = parser->in_statement;
25444 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25445 This preserves the "not within loop or switch" style error messages
25446 for nonsense cases like
25452 if (parser->in_statement)
25453 parser->in_statement = IN_OMP_BLOCK;
25459 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
25461 parser->in_statement = save;
25465 cp_parser_omp_structured_block (cp_parser *parser)
25467 tree stmt = begin_omp_structured_block ();
25468 unsigned int save = cp_parser_begin_omp_structured_block (parser);
25470 cp_parser_statement (parser, NULL_TREE, false, NULL);
25472 cp_parser_end_omp_structured_block (parser, save);
25473 return finish_omp_structured_block (stmt);
25477 # pragma omp atomic new-line
25481 x binop= expr | x++ | ++x | x-- | --x
25483 +, *, -, /, &, ^, |, <<, >>
25485 where x is an lvalue expression with scalar type.
25488 # pragma omp atomic new-line
25491 # pragma omp atomic read new-line
25494 # pragma omp atomic write new-line
25497 # pragma omp atomic update new-line
25500 # pragma omp atomic capture new-line
25503 # pragma omp atomic capture new-line
25511 expression-stmt | x = x binop expr
25513 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25515 { v = x; update-stmt; } | { update-stmt; v = x; }
25517 where x and v are lvalue expressions with scalar type. */
25520 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
25522 tree lhs = NULL_TREE, rhs = NULL_TREE, v = NULL_TREE, lhs1 = NULL_TREE;
25523 tree rhs1 = NULL_TREE, orig_lhs;
25524 enum tree_code code = OMP_ATOMIC, opcode = NOP_EXPR;
25525 bool structured_block = false;
25527 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
25529 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25530 const char *p = IDENTIFIER_POINTER (id);
25532 if (!strcmp (p, "read"))
25533 code = OMP_ATOMIC_READ;
25534 else if (!strcmp (p, "write"))
25536 else if (!strcmp (p, "update"))
25538 else if (!strcmp (p, "capture"))
25539 code = OMP_ATOMIC_CAPTURE_NEW;
25543 cp_lexer_consume_token (parser->lexer);
25545 cp_parser_require_pragma_eol (parser, pragma_tok);
25549 case OMP_ATOMIC_READ:
25550 case NOP_EXPR: /* atomic write */
25551 v = cp_parser_unary_expression (parser, /*address_p=*/false,
25552 /*cast_p=*/false, NULL);
25553 if (v == error_mark_node)
25555 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
25557 if (code == NOP_EXPR)
25558 lhs = cp_parser_expression (parser, /*cast_p=*/false, NULL);
25560 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
25561 /*cast_p=*/false, NULL);
25562 if (lhs == error_mark_node)
25564 if (code == NOP_EXPR)
25566 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25574 case OMP_ATOMIC_CAPTURE_NEW:
25575 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
25577 cp_lexer_consume_token (parser->lexer);
25578 structured_block = true;
25582 v = cp_parser_unary_expression (parser, /*address_p=*/false,
25583 /*cast_p=*/false, NULL);
25584 if (v == error_mark_node)
25586 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
25594 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
25595 /*cast_p=*/false, NULL);
25597 switch (TREE_CODE (lhs))
25602 case POSTINCREMENT_EXPR:
25603 if (code == OMP_ATOMIC_CAPTURE_NEW && !structured_block)
25604 code = OMP_ATOMIC_CAPTURE_OLD;
25606 case PREINCREMENT_EXPR:
25607 lhs = TREE_OPERAND (lhs, 0);
25608 opcode = PLUS_EXPR;
25609 rhs = integer_one_node;
25612 case POSTDECREMENT_EXPR:
25613 if (code == OMP_ATOMIC_CAPTURE_NEW && !structured_block)
25614 code = OMP_ATOMIC_CAPTURE_OLD;
25616 case PREDECREMENT_EXPR:
25617 lhs = TREE_OPERAND (lhs, 0);
25618 opcode = MINUS_EXPR;
25619 rhs = integer_one_node;
25622 case COMPOUND_EXPR:
25623 if (TREE_CODE (TREE_OPERAND (lhs, 0)) == SAVE_EXPR
25624 && TREE_CODE (TREE_OPERAND (lhs, 1)) == COMPOUND_EXPR
25625 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs, 1), 0)) == MODIFY_EXPR
25626 && TREE_OPERAND (TREE_OPERAND (lhs, 1), 1) == TREE_OPERAND (lhs, 0)
25627 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
25628 (TREE_OPERAND (lhs, 1), 0), 0)))
25630 /* Undo effects of boolean_increment for post {in,de}crement. */
25631 lhs = TREE_OPERAND (TREE_OPERAND (lhs, 1), 0);
25634 if (TREE_CODE (lhs) == MODIFY_EXPR
25635 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs, 0))) == BOOLEAN_TYPE)
25637 /* Undo effects of boolean_increment. */
25638 if (integer_onep (TREE_OPERAND (lhs, 1)))
25640 /* This is pre or post increment. */
25641 rhs = TREE_OPERAND (lhs, 1);
25642 lhs = TREE_OPERAND (lhs, 0);
25644 if (code == OMP_ATOMIC_CAPTURE_NEW
25645 && !structured_block
25646 && TREE_CODE (orig_lhs) == COMPOUND_EXPR)
25647 code = OMP_ATOMIC_CAPTURE_OLD;
25653 switch (cp_lexer_peek_token (parser->lexer)->type)
25656 opcode = MULT_EXPR;
25659 opcode = TRUNC_DIV_EXPR;
25662 opcode = PLUS_EXPR;
25665 opcode = MINUS_EXPR;
25667 case CPP_LSHIFT_EQ:
25668 opcode = LSHIFT_EXPR;
25670 case CPP_RSHIFT_EQ:
25671 opcode = RSHIFT_EXPR;
25674 opcode = BIT_AND_EXPR;
25677 opcode = BIT_IOR_EXPR;
25680 opcode = BIT_XOR_EXPR;
25683 if (structured_block || code == OMP_ATOMIC)
25685 enum cp_parser_prec oprec;
25687 cp_lexer_consume_token (parser->lexer);
25688 rhs1 = cp_parser_unary_expression (parser, /*address_p=*/false,
25689 /*cast_p=*/false, NULL);
25690 if (rhs1 == error_mark_node)
25692 token = cp_lexer_peek_token (parser->lexer);
25693 switch (token->type)
25695 case CPP_SEMICOLON:
25696 if (code == OMP_ATOMIC_CAPTURE_NEW)
25698 code = OMP_ATOMIC_CAPTURE_OLD;
25703 cp_lexer_consume_token (parser->lexer);
25706 cp_parser_error (parser,
25707 "invalid form of %<#pragma omp atomic%>");
25710 opcode = MULT_EXPR;
25713 opcode = TRUNC_DIV_EXPR;
25716 opcode = PLUS_EXPR;
25719 opcode = MINUS_EXPR;
25722 opcode = LSHIFT_EXPR;
25725 opcode = RSHIFT_EXPR;
25728 opcode = BIT_AND_EXPR;
25731 opcode = BIT_IOR_EXPR;
25734 opcode = BIT_XOR_EXPR;
25737 cp_parser_error (parser,
25738 "invalid operator for %<#pragma omp atomic%>");
25741 oprec = TOKEN_PRECEDENCE (token);
25742 gcc_assert (oprec != PREC_NOT_OPERATOR);
25743 if (commutative_tree_code (opcode))
25744 oprec = (enum cp_parser_prec) (oprec - 1);
25745 cp_lexer_consume_token (parser->lexer);
25746 rhs = cp_parser_binary_expression (parser, false, false,
25748 if (rhs == error_mark_node)
25754 cp_parser_error (parser,
25755 "invalid operator for %<#pragma omp atomic%>");
25758 cp_lexer_consume_token (parser->lexer);
25760 rhs = cp_parser_expression (parser, false, NULL);
25761 if (rhs == error_mark_node)
25766 if (structured_block && code == OMP_ATOMIC_CAPTURE_NEW)
25768 if (!cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON))
25770 v = cp_parser_unary_expression (parser, /*address_p=*/false,
25771 /*cast_p=*/false, NULL);
25772 if (v == error_mark_node)
25774 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
25776 lhs1 = cp_parser_unary_expression (parser, /*address_p=*/false,
25777 /*cast_p=*/false, NULL);
25778 if (lhs1 == error_mark_node)
25781 if (structured_block)
25783 cp_parser_consume_semicolon_at_end_of_statement (parser);
25784 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
25787 finish_omp_atomic (code, opcode, lhs, rhs, v, lhs1, rhs1);
25788 if (!structured_block)
25789 cp_parser_consume_semicolon_at_end_of_statement (parser);
25793 cp_parser_skip_to_end_of_block_or_statement (parser);
25794 if (structured_block)
25796 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
25797 cp_lexer_consume_token (parser->lexer);
25798 else if (code == OMP_ATOMIC_CAPTURE_NEW)
25800 cp_parser_skip_to_end_of_block_or_statement (parser);
25801 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
25802 cp_lexer_consume_token (parser->lexer);
25809 # pragma omp barrier new-line */
25812 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
25814 cp_parser_require_pragma_eol (parser, pragma_tok);
25815 finish_omp_barrier ();
25819 # pragma omp critical [(name)] new-line
25820 structured-block */
25823 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
25825 tree stmt, name = NULL;
25827 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
25829 cp_lexer_consume_token (parser->lexer);
25831 name = cp_parser_identifier (parser);
25833 if (name == error_mark_node
25834 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25835 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25836 /*or_comma=*/false,
25837 /*consume_paren=*/true);
25838 if (name == error_mark_node)
25841 cp_parser_require_pragma_eol (parser, pragma_tok);
25843 stmt = cp_parser_omp_structured_block (parser);
25844 return c_finish_omp_critical (input_location, stmt, name);
25848 # pragma omp flush flush-vars[opt] new-line
25851 ( variable-list ) */
25854 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
25856 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
25857 (void) cp_parser_omp_var_list (parser, OMP_CLAUSE_ERROR, NULL);
25858 cp_parser_require_pragma_eol (parser, pragma_tok);
25860 finish_omp_flush ();
25863 /* Helper function, to parse omp for increment expression. */
25866 cp_parser_omp_for_cond (cp_parser *parser, tree decl)
25868 tree cond = cp_parser_binary_expression (parser, false, true,
25869 PREC_NOT_OPERATOR, NULL);
25870 if (cond == error_mark_node
25871 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
25873 cp_parser_skip_to_end_of_statement (parser);
25874 return error_mark_node;
25877 switch (TREE_CODE (cond))
25885 return error_mark_node;
25888 /* If decl is an iterator, preserve LHS and RHS of the relational
25889 expr until finish_omp_for. */
25891 && (type_dependent_expression_p (decl)
25892 || CLASS_TYPE_P (TREE_TYPE (decl))))
25895 return build_x_binary_op (TREE_CODE (cond),
25896 TREE_OPERAND (cond, 0), ERROR_MARK,
25897 TREE_OPERAND (cond, 1), ERROR_MARK,
25898 /*overload=*/NULL, tf_warning_or_error);
25901 /* Helper function, to parse omp for increment expression. */
25904 cp_parser_omp_for_incr (cp_parser *parser, tree decl)
25906 cp_token *token = cp_lexer_peek_token (parser->lexer);
25912 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
25914 op = (token->type == CPP_PLUS_PLUS
25915 ? PREINCREMENT_EXPR : PREDECREMENT_EXPR);
25916 cp_lexer_consume_token (parser->lexer);
25917 lhs = cp_parser_cast_expression (parser, false, false, NULL);
25919 return error_mark_node;
25920 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
25923 lhs = cp_parser_primary_expression (parser, false, false, false, &idk);
25925 return error_mark_node;
25927 token = cp_lexer_peek_token (parser->lexer);
25928 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
25930 op = (token->type == CPP_PLUS_PLUS
25931 ? POSTINCREMENT_EXPR : POSTDECREMENT_EXPR);
25932 cp_lexer_consume_token (parser->lexer);
25933 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
25936 op = cp_parser_assignment_operator_opt (parser);
25937 if (op == ERROR_MARK)
25938 return error_mark_node;
25940 if (op != NOP_EXPR)
25942 rhs = cp_parser_assignment_expression (parser, false, NULL);
25943 rhs = build2 (op, TREE_TYPE (decl), decl, rhs);
25944 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
25947 lhs = cp_parser_binary_expression (parser, false, false,
25948 PREC_ADDITIVE_EXPRESSION, NULL);
25949 token = cp_lexer_peek_token (parser->lexer);
25950 decl_first = lhs == decl;
25953 if (token->type != CPP_PLUS
25954 && token->type != CPP_MINUS)
25955 return error_mark_node;
25959 op = token->type == CPP_PLUS ? PLUS_EXPR : MINUS_EXPR;
25960 cp_lexer_consume_token (parser->lexer);
25961 rhs = cp_parser_binary_expression (parser, false, false,
25962 PREC_ADDITIVE_EXPRESSION, NULL);
25963 token = cp_lexer_peek_token (parser->lexer);
25964 if (token->type == CPP_PLUS || token->type == CPP_MINUS || decl_first)
25966 if (lhs == NULL_TREE)
25968 if (op == PLUS_EXPR)
25971 lhs = build_x_unary_op (NEGATE_EXPR, rhs, tf_warning_or_error);
25974 lhs = build_x_binary_op (op, lhs, ERROR_MARK, rhs, ERROR_MARK,
25975 NULL, tf_warning_or_error);
25978 while (token->type == CPP_PLUS || token->type == CPP_MINUS);
25982 if (rhs != decl || op == MINUS_EXPR)
25983 return error_mark_node;
25984 rhs = build2 (op, TREE_TYPE (decl), lhs, decl);
25987 rhs = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, lhs);
25989 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
25992 /* Parse the restricted form of the for statement allowed by OpenMP. */
25995 cp_parser_omp_for_loop (cp_parser *parser, tree clauses, tree *par_clauses)
25997 tree init, cond, incr, body, decl, pre_body = NULL_TREE, ret;
25998 tree real_decl, initv, condv, incrv, declv;
25999 tree this_pre_body, cl;
26000 location_t loc_first;
26001 bool collapse_err = false;
26002 int i, collapse = 1, nbraces = 0;
26003 VEC(tree,gc) *for_block = make_tree_vector ();
26005 for (cl = clauses; cl; cl = OMP_CLAUSE_CHAIN (cl))
26006 if (OMP_CLAUSE_CODE (cl) == OMP_CLAUSE_COLLAPSE)
26007 collapse = tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl), 0);
26009 gcc_assert (collapse >= 1);
26011 declv = make_tree_vec (collapse);
26012 initv = make_tree_vec (collapse);
26013 condv = make_tree_vec (collapse);
26014 incrv = make_tree_vec (collapse);
26016 loc_first = cp_lexer_peek_token (parser->lexer)->location;
26018 for (i = 0; i < collapse; i++)
26020 int bracecount = 0;
26021 bool add_private_clause = false;
26024 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
26026 cp_parser_error (parser, "for statement expected");
26029 loc = cp_lexer_consume_token (parser->lexer)->location;
26031 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
26034 init = decl = real_decl = NULL;
26035 this_pre_body = push_stmt_list ();
26036 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
26038 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26042 integer-type var = lb
26043 random-access-iterator-type var = lb
26044 pointer-type var = lb
26046 cp_decl_specifier_seq type_specifiers;
26048 /* First, try to parse as an initialized declaration. See
26049 cp_parser_condition, from whence the bulk of this is copied. */
26051 cp_parser_parse_tentatively (parser);
26052 cp_parser_type_specifier_seq (parser, /*is_declaration=*/true,
26053 /*is_trailing_return=*/false,
26055 if (cp_parser_parse_definitely (parser))
26057 /* If parsing a type specifier seq succeeded, then this
26058 MUST be a initialized declaration. */
26059 tree asm_specification, attributes;
26060 cp_declarator *declarator;
26062 declarator = cp_parser_declarator (parser,
26063 CP_PARSER_DECLARATOR_NAMED,
26064 /*ctor_dtor_or_conv_p=*/NULL,
26065 /*parenthesized_p=*/NULL,
26066 /*member_p=*/false);
26067 attributes = cp_parser_attributes_opt (parser);
26068 asm_specification = cp_parser_asm_specification_opt (parser);
26070 if (declarator == cp_error_declarator)
26071 cp_parser_skip_to_end_of_statement (parser);
26075 tree pushed_scope, auto_node;
26077 decl = start_decl (declarator, &type_specifiers,
26078 SD_INITIALIZED, attributes,
26079 /*prefix_attributes=*/NULL_TREE,
26082 auto_node = type_uses_auto (TREE_TYPE (decl));
26083 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
26085 if (cp_lexer_next_token_is (parser->lexer,
26087 error ("parenthesized initialization is not allowed in "
26088 "OpenMP %<for%> loop");
26090 /* Trigger an error. */
26091 cp_parser_require (parser, CPP_EQ, RT_EQ);
26093 init = error_mark_node;
26094 cp_parser_skip_to_end_of_statement (parser);
26096 else if (CLASS_TYPE_P (TREE_TYPE (decl))
26097 || type_dependent_expression_p (decl)
26100 bool is_direct_init, is_non_constant_init;
26102 init = cp_parser_initializer (parser,
26104 &is_non_constant_init);
26109 = do_auto_deduction (TREE_TYPE (decl), init,
26112 if (!CLASS_TYPE_P (TREE_TYPE (decl))
26113 && !type_dependent_expression_p (decl))
26117 cp_finish_decl (decl, init, !is_non_constant_init,
26119 LOOKUP_ONLYCONVERTING);
26120 if (CLASS_TYPE_P (TREE_TYPE (decl)))
26122 VEC_safe_push (tree, gc, for_block, this_pre_body);
26126 init = pop_stmt_list (this_pre_body);
26127 this_pre_body = NULL_TREE;
26132 cp_lexer_consume_token (parser->lexer);
26133 init = cp_parser_assignment_expression (parser, false, NULL);
26136 if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
26137 init = error_mark_node;
26139 cp_finish_decl (decl, NULL_TREE,
26140 /*init_const_expr_p=*/false,
26142 LOOKUP_ONLYCONVERTING);
26146 pop_scope (pushed_scope);
26152 /* If parsing a type specifier sequence failed, then
26153 this MUST be a simple expression. */
26154 cp_parser_parse_tentatively (parser);
26155 decl = cp_parser_primary_expression (parser, false, false,
26157 if (!cp_parser_error_occurred (parser)
26160 && CLASS_TYPE_P (TREE_TYPE (decl)))
26164 cp_parser_parse_definitely (parser);
26165 cp_parser_require (parser, CPP_EQ, RT_EQ);
26166 rhs = cp_parser_assignment_expression (parser, false, NULL);
26167 finish_expr_stmt (build_x_modify_expr (decl, NOP_EXPR,
26169 tf_warning_or_error));
26170 add_private_clause = true;
26175 cp_parser_abort_tentative_parse (parser);
26176 init = cp_parser_expression (parser, false, NULL);
26179 if (TREE_CODE (init) == MODIFY_EXPR
26180 || TREE_CODE (init) == MODOP_EXPR)
26181 real_decl = TREE_OPERAND (init, 0);
26186 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
26189 this_pre_body = pop_stmt_list (this_pre_body);
26193 pre_body = push_stmt_list ();
26195 add_stmt (this_pre_body);
26196 pre_body = pop_stmt_list (pre_body);
26199 pre_body = this_pre_body;
26204 if (par_clauses != NULL && real_decl != NULL_TREE)
26207 for (c = par_clauses; *c ; )
26208 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_FIRSTPRIVATE
26209 && OMP_CLAUSE_DECL (*c) == real_decl)
26211 error_at (loc, "iteration variable %qD"
26212 " should not be firstprivate", real_decl);
26213 *c = OMP_CLAUSE_CHAIN (*c);
26215 else if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_LASTPRIVATE
26216 && OMP_CLAUSE_DECL (*c) == real_decl)
26218 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26219 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26220 tree l = build_omp_clause (loc, OMP_CLAUSE_LASTPRIVATE);
26221 OMP_CLAUSE_DECL (l) = real_decl;
26222 OMP_CLAUSE_CHAIN (l) = clauses;
26223 CP_OMP_CLAUSE_INFO (l) = CP_OMP_CLAUSE_INFO (*c);
26225 OMP_CLAUSE_SET_CODE (*c, OMP_CLAUSE_SHARED);
26226 CP_OMP_CLAUSE_INFO (*c) = NULL;
26227 add_private_clause = false;
26231 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_PRIVATE
26232 && OMP_CLAUSE_DECL (*c) == real_decl)
26233 add_private_clause = false;
26234 c = &OMP_CLAUSE_CHAIN (*c);
26238 if (add_private_clause)
26241 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
26243 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE
26244 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE)
26245 && OMP_CLAUSE_DECL (c) == decl)
26247 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
26248 && OMP_CLAUSE_DECL (c) == decl)
26249 error_at (loc, "iteration variable %qD "
26250 "should not be firstprivate",
26252 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
26253 && OMP_CLAUSE_DECL (c) == decl)
26254 error_at (loc, "iteration variable %qD should not be reduction",
26259 c = build_omp_clause (loc, OMP_CLAUSE_PRIVATE);
26260 OMP_CLAUSE_DECL (c) = decl;
26261 c = finish_omp_clauses (c);
26264 OMP_CLAUSE_CHAIN (c) = clauses;
26271 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
26272 cond = cp_parser_omp_for_cond (parser, decl);
26273 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
26276 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
26278 /* If decl is an iterator, preserve the operator on decl
26279 until finish_omp_for. */
26281 && ((type_dependent_expression_p (decl)
26282 && !POINTER_TYPE_P (TREE_TYPE (decl)))
26283 || CLASS_TYPE_P (TREE_TYPE (decl))))
26284 incr = cp_parser_omp_for_incr (parser, decl);
26286 incr = cp_parser_expression (parser, false, NULL);
26289 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
26290 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
26291 /*or_comma=*/false,
26292 /*consume_paren=*/true);
26294 TREE_VEC_ELT (declv, i) = decl;
26295 TREE_VEC_ELT (initv, i) = init;
26296 TREE_VEC_ELT (condv, i) = cond;
26297 TREE_VEC_ELT (incrv, i) = incr;
26299 if (i == collapse - 1)
26302 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26303 in between the collapsed for loops to be still considered perfectly
26304 nested. Hopefully the final version clarifies this.
26305 For now handle (multiple) {'s and empty statements. */
26306 cp_parser_parse_tentatively (parser);
26309 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
26311 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
26313 cp_lexer_consume_token (parser->lexer);
26316 else if (bracecount
26317 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
26318 cp_lexer_consume_token (parser->lexer);
26321 loc = cp_lexer_peek_token (parser->lexer)->location;
26322 error_at (loc, "not enough collapsed for loops");
26323 collapse_err = true;
26324 cp_parser_abort_tentative_parse (parser);
26333 cp_parser_parse_definitely (parser);
26334 nbraces += bracecount;
26338 /* Note that we saved the original contents of this flag when we entered
26339 the structured block, and so we don't need to re-save it here. */
26340 parser->in_statement = IN_OMP_FOR;
26342 /* Note that the grammar doesn't call for a structured block here,
26343 though the loop as a whole is a structured block. */
26344 body = push_stmt_list ();
26345 cp_parser_statement (parser, NULL_TREE, false, NULL);
26346 body = pop_stmt_list (body);
26348 if (declv == NULL_TREE)
26351 ret = finish_omp_for (loc_first, declv, initv, condv, incrv, body,
26352 pre_body, clauses);
26356 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
26358 cp_lexer_consume_token (parser->lexer);
26361 else if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
26362 cp_lexer_consume_token (parser->lexer);
26367 error_at (cp_lexer_peek_token (parser->lexer)->location,
26368 "collapsed loops not perfectly nested");
26370 collapse_err = true;
26371 cp_parser_statement_seq_opt (parser, NULL);
26372 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
26377 while (!VEC_empty (tree, for_block))
26378 add_stmt (pop_stmt_list (VEC_pop (tree, for_block)));
26379 release_tree_vector (for_block);
26385 #pragma omp for for-clause[optseq] new-line
26388 #define OMP_FOR_CLAUSE_MASK \
26389 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26390 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26391 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26392 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26393 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26394 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26395 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26396 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26399 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
26401 tree clauses, sb, ret;
26404 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
26405 "#pragma omp for", pragma_tok);
26407 sb = begin_omp_structured_block ();
26408 save = cp_parser_begin_omp_structured_block (parser);
26410 ret = cp_parser_omp_for_loop (parser, clauses, NULL);
26412 cp_parser_end_omp_structured_block (parser, save);
26413 add_stmt (finish_omp_structured_block (sb));
26419 # pragma omp master new-line
26420 structured-block */
26423 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
26425 cp_parser_require_pragma_eol (parser, pragma_tok);
26426 return c_finish_omp_master (input_location,
26427 cp_parser_omp_structured_block (parser));
26431 # pragma omp ordered new-line
26432 structured-block */
26435 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
26437 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
26438 cp_parser_require_pragma_eol (parser, pragma_tok);
26439 return c_finish_omp_ordered (loc, cp_parser_omp_structured_block (parser));
26445 { section-sequence }
26448 section-directive[opt] structured-block
26449 section-sequence section-directive structured-block */
26452 cp_parser_omp_sections_scope (cp_parser *parser)
26454 tree stmt, substmt;
26455 bool error_suppress = false;
26458 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
26461 stmt = push_stmt_list ();
26463 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
26467 substmt = begin_omp_structured_block ();
26468 save = cp_parser_begin_omp_structured_block (parser);
26472 cp_parser_statement (parser, NULL_TREE, false, NULL);
26474 tok = cp_lexer_peek_token (parser->lexer);
26475 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
26477 if (tok->type == CPP_CLOSE_BRACE)
26479 if (tok->type == CPP_EOF)
26483 cp_parser_end_omp_structured_block (parser, save);
26484 substmt = finish_omp_structured_block (substmt);
26485 substmt = build1 (OMP_SECTION, void_type_node, substmt);
26486 add_stmt (substmt);
26491 tok = cp_lexer_peek_token (parser->lexer);
26492 if (tok->type == CPP_CLOSE_BRACE)
26494 if (tok->type == CPP_EOF)
26497 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
26499 cp_lexer_consume_token (parser->lexer);
26500 cp_parser_require_pragma_eol (parser, tok);
26501 error_suppress = false;
26503 else if (!error_suppress)
26505 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
26506 error_suppress = true;
26509 substmt = cp_parser_omp_structured_block (parser);
26510 substmt = build1 (OMP_SECTION, void_type_node, substmt);
26511 add_stmt (substmt);
26513 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
26515 substmt = pop_stmt_list (stmt);
26517 stmt = make_node (OMP_SECTIONS);
26518 TREE_TYPE (stmt) = void_type_node;
26519 OMP_SECTIONS_BODY (stmt) = substmt;
26526 # pragma omp sections sections-clause[optseq] newline
26529 #define OMP_SECTIONS_CLAUSE_MASK \
26530 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26531 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26532 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26533 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26534 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26537 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
26541 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
26542 "#pragma omp sections", pragma_tok);
26544 ret = cp_parser_omp_sections_scope (parser);
26546 OMP_SECTIONS_CLAUSES (ret) = clauses;
26552 # pragma parallel parallel-clause new-line
26553 # pragma parallel for parallel-for-clause new-line
26554 # pragma parallel sections parallel-sections-clause new-line */
26556 #define OMP_PARALLEL_CLAUSE_MASK \
26557 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26558 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26559 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26560 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26561 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26562 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26563 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26564 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26567 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
26569 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
26570 const char *p_name = "#pragma omp parallel";
26571 tree stmt, clauses, par_clause, ws_clause, block;
26572 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
26574 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
26576 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
26578 cp_lexer_consume_token (parser->lexer);
26579 p_kind = PRAGMA_OMP_PARALLEL_FOR;
26580 p_name = "#pragma omp parallel for";
26581 mask |= OMP_FOR_CLAUSE_MASK;
26582 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
26584 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
26586 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
26587 const char *p = IDENTIFIER_POINTER (id);
26588 if (strcmp (p, "sections") == 0)
26590 cp_lexer_consume_token (parser->lexer);
26591 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
26592 p_name = "#pragma omp parallel sections";
26593 mask |= OMP_SECTIONS_CLAUSE_MASK;
26594 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
26598 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
26599 block = begin_omp_parallel ();
26600 save = cp_parser_begin_omp_structured_block (parser);
26604 case PRAGMA_OMP_PARALLEL:
26605 cp_parser_statement (parser, NULL_TREE, false, NULL);
26606 par_clause = clauses;
26609 case PRAGMA_OMP_PARALLEL_FOR:
26610 c_split_parallel_clauses (loc, clauses, &par_clause, &ws_clause);
26611 cp_parser_omp_for_loop (parser, ws_clause, &par_clause);
26614 case PRAGMA_OMP_PARALLEL_SECTIONS:
26615 c_split_parallel_clauses (loc, clauses, &par_clause, &ws_clause);
26616 stmt = cp_parser_omp_sections_scope (parser);
26618 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
26622 gcc_unreachable ();
26625 cp_parser_end_omp_structured_block (parser, save);
26626 stmt = finish_omp_parallel (par_clause, block);
26627 if (p_kind != PRAGMA_OMP_PARALLEL)
26628 OMP_PARALLEL_COMBINED (stmt) = 1;
26633 # pragma omp single single-clause[optseq] new-line
26634 structured-block */
26636 #define OMP_SINGLE_CLAUSE_MASK \
26637 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26638 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26639 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26640 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26643 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
26645 tree stmt = make_node (OMP_SINGLE);
26646 TREE_TYPE (stmt) = void_type_node;
26648 OMP_SINGLE_CLAUSES (stmt)
26649 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
26650 "#pragma omp single", pragma_tok);
26651 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
26653 return add_stmt (stmt);
26657 # pragma omp task task-clause[optseq] new-line
26658 structured-block */
26660 #define OMP_TASK_CLAUSE_MASK \
26661 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26662 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26663 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26664 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26665 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26666 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26667 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26668 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26671 cp_parser_omp_task (cp_parser *parser, cp_token *pragma_tok)
26673 tree clauses, block;
26676 clauses = cp_parser_omp_all_clauses (parser, OMP_TASK_CLAUSE_MASK,
26677 "#pragma omp task", pragma_tok);
26678 block = begin_omp_task ();
26679 save = cp_parser_begin_omp_structured_block (parser);
26680 cp_parser_statement (parser, NULL_TREE, false, NULL);
26681 cp_parser_end_omp_structured_block (parser, save);
26682 return finish_omp_task (clauses, block);
26686 # pragma omp taskwait new-line */
26689 cp_parser_omp_taskwait (cp_parser *parser, cp_token *pragma_tok)
26691 cp_parser_require_pragma_eol (parser, pragma_tok);
26692 finish_omp_taskwait ();
26696 # pragma omp taskyield new-line */
26699 cp_parser_omp_taskyield (cp_parser *parser, cp_token *pragma_tok)
26701 cp_parser_require_pragma_eol (parser, pragma_tok);
26702 finish_omp_taskyield ();
26706 # pragma omp threadprivate (variable-list) */
26709 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
26713 vars = cp_parser_omp_var_list (parser, OMP_CLAUSE_ERROR, NULL);
26714 cp_parser_require_pragma_eol (parser, pragma_tok);
26716 finish_omp_threadprivate (vars);
26719 /* Main entry point to OpenMP statement pragmas. */
26722 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
26726 switch (pragma_tok->pragma_kind)
26728 case PRAGMA_OMP_ATOMIC:
26729 cp_parser_omp_atomic (parser, pragma_tok);
26731 case PRAGMA_OMP_CRITICAL:
26732 stmt = cp_parser_omp_critical (parser, pragma_tok);
26734 case PRAGMA_OMP_FOR:
26735 stmt = cp_parser_omp_for (parser, pragma_tok);
26737 case PRAGMA_OMP_MASTER:
26738 stmt = cp_parser_omp_master (parser, pragma_tok);
26740 case PRAGMA_OMP_ORDERED:
26741 stmt = cp_parser_omp_ordered (parser, pragma_tok);
26743 case PRAGMA_OMP_PARALLEL:
26744 stmt = cp_parser_omp_parallel (parser, pragma_tok);
26746 case PRAGMA_OMP_SECTIONS:
26747 stmt = cp_parser_omp_sections (parser, pragma_tok);
26749 case PRAGMA_OMP_SINGLE:
26750 stmt = cp_parser_omp_single (parser, pragma_tok);
26752 case PRAGMA_OMP_TASK:
26753 stmt = cp_parser_omp_task (parser, pragma_tok);
26756 gcc_unreachable ();
26760 SET_EXPR_LOCATION (stmt, pragma_tok->location);
26763 /* Transactional Memory parsing routines. */
26765 /* Parse a transaction attribute.
26771 ??? Simplify this when C++0x bracket attributes are
26772 implemented properly. */
26775 cp_parser_txn_attribute_opt (cp_parser *parser)
26778 tree attr_name, attr = NULL;
26780 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
26781 return cp_parser_attributes_opt (parser);
26783 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
26785 cp_lexer_consume_token (parser->lexer);
26786 if (!cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE))
26789 token = cp_lexer_peek_token (parser->lexer);
26790 if (token->type == CPP_NAME || token->type == CPP_KEYWORD)
26792 token = cp_lexer_consume_token (parser->lexer);
26794 attr_name = (token->type == CPP_KEYWORD
26795 /* For keywords, use the canonical spelling,
26796 not the parsed identifier. */
26797 ? ridpointers[(int) token->keyword]
26799 attr = build_tree_list (attr_name, NULL_TREE);
26802 cp_parser_error (parser, "expected identifier");
26804 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
26806 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
26810 /* Parse a __transaction_atomic or __transaction_relaxed statement.
26812 transaction-statement:
26813 __transaction_atomic txn-attribute[opt] txn-exception-spec[opt]
26815 __transaction_relaxed txn-exception-spec[opt] compound-statement
26817 ??? The exception specification is not yet implemented.
26821 cp_parser_transaction (cp_parser *parser, enum rid keyword)
26823 unsigned char old_in = parser->in_transaction;
26824 unsigned char this_in = 1, new_in;
26828 gcc_assert (keyword == RID_TRANSACTION_ATOMIC
26829 || keyword == RID_TRANSACTION_RELAXED);
26830 token = cp_parser_require_keyword (parser, keyword,
26831 (keyword == RID_TRANSACTION_ATOMIC ? RT_TRANSACTION_ATOMIC
26832 : RT_TRANSACTION_RELAXED));
26833 gcc_assert (token != NULL);
26835 if (keyword == RID_TRANSACTION_RELAXED)
26836 this_in |= TM_STMT_ATTR_RELAXED;
26839 attrs = cp_parser_txn_attribute_opt (parser);
26841 this_in |= parse_tm_stmt_attr (attrs, TM_STMT_ATTR_OUTER);
26844 /* Keep track if we're in the lexical scope of an outer transaction. */
26845 new_in = this_in | (old_in & TM_STMT_ATTR_OUTER);
26847 stmt = begin_transaction_stmt (token->location, NULL, this_in);
26849 parser->in_transaction = new_in;
26850 cp_parser_compound_statement (parser, NULL, false, false);
26851 parser->in_transaction = old_in;
26853 finish_transaction_stmt (stmt, NULL, this_in);
26858 /* Parse a __transaction_atomic or __transaction_relaxed expression.
26860 transaction-expression:
26861 __transaction_atomic txn-exception-spec[opt] ( expression )
26862 __transaction_relaxed txn-exception-spec[opt] ( expression )
26864 ??? The exception specification is not yet implemented.
26868 cp_parser_transaction_expression (cp_parser *parser, enum rid keyword)
26870 unsigned char old_in = parser->in_transaction;
26871 unsigned char this_in = 1;
26875 gcc_assert (keyword == RID_TRANSACTION_ATOMIC
26876 || keyword == RID_TRANSACTION_RELAXED);
26879 error (keyword == RID_TRANSACTION_RELAXED
26880 ? G_("%<__transaction_relaxed%> without transactional memory "
26882 : G_("%<__transaction_atomic%> without transactional memory "
26883 "support enabled"));
26885 token = cp_parser_require_keyword (parser, keyword,
26886 (keyword == RID_TRANSACTION_ATOMIC ? RT_TRANSACTION_ATOMIC
26887 : RT_TRANSACTION_RELAXED));
26888 gcc_assert (token != NULL);
26890 if (keyword == RID_TRANSACTION_RELAXED)
26891 this_in |= TM_STMT_ATTR_RELAXED;
26893 parser->in_transaction = this_in;
26894 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
26896 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
26897 finish_parenthesized_expr (expr);
26898 expr = build_transaction_expr (token->location, expr, this_in);
26900 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
26901 parser->in_transaction = old_in;
26903 if (cp_parser_non_integral_constant_expression (parser, NIC_TRANSACTION))
26904 return error_mark_node;
26906 return (flag_tm ? expr : error_mark_node);
26909 /* Parse a function-transaction-block.
26911 function-transaction-block:
26912 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
26914 __transaction_atomic txn-attribute[opt] function-try-block
26915 __transaction_relaxed ctor-initializer[opt] function-body
26916 __transaction_relaxed function-try-block
26920 cp_parser_function_transaction (cp_parser *parser, enum rid keyword)
26922 unsigned char old_in = parser->in_transaction;
26923 unsigned char new_in = 1;
26924 tree compound_stmt, stmt, attrs;
26925 bool ctor_initializer_p;
26928 gcc_assert (keyword == RID_TRANSACTION_ATOMIC
26929 || keyword == RID_TRANSACTION_RELAXED);
26930 token = cp_parser_require_keyword (parser, keyword,
26931 (keyword == RID_TRANSACTION_ATOMIC ? RT_TRANSACTION_ATOMIC
26932 : RT_TRANSACTION_RELAXED));
26933 gcc_assert (token != NULL);
26935 if (keyword == RID_TRANSACTION_RELAXED)
26936 new_in |= TM_STMT_ATTR_RELAXED;
26939 attrs = cp_parser_txn_attribute_opt (parser);
26941 new_in |= parse_tm_stmt_attr (attrs, TM_STMT_ATTR_OUTER);
26944 stmt = begin_transaction_stmt (token->location, &compound_stmt, new_in);
26946 parser->in_transaction = new_in;
26948 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
26949 ctor_initializer_p = cp_parser_function_try_block (parser);
26952 = cp_parser_ctor_initializer_opt_and_function_body (parser);
26954 parser->in_transaction = old_in;
26956 finish_transaction_stmt (stmt, compound_stmt, new_in);
26958 return ctor_initializer_p;
26961 /* Parse a __transaction_cancel statement.
26964 __transaction_cancel txn-attribute[opt] ;
26965 __transaction_cancel txn-attribute[opt] throw-expression ;
26967 ??? Cancel and throw is not yet implemented. */
26970 cp_parser_transaction_cancel (cp_parser *parser)
26973 bool is_outer = false;
26976 token = cp_parser_require_keyword (parser, RID_TRANSACTION_CANCEL,
26977 RT_TRANSACTION_CANCEL);
26978 gcc_assert (token != NULL);
26980 attrs = cp_parser_txn_attribute_opt (parser);
26982 is_outer = (parse_tm_stmt_attr (attrs, TM_STMT_ATTR_OUTER) != 0);
26984 /* ??? Parse cancel-and-throw here. */
26986 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
26990 error_at (token->location, "%<__transaction_cancel%> without "
26991 "transactional memory support enabled");
26992 return error_mark_node;
26994 else if (parser->in_transaction & TM_STMT_ATTR_RELAXED)
26996 error_at (token->location, "%<__transaction_cancel%> within a "
26997 "%<__transaction_relaxed%>");
26998 return error_mark_node;
27002 if ((parser->in_transaction & TM_STMT_ATTR_OUTER) == 0
27003 && !is_tm_may_cancel_outer (current_function_decl))
27005 error_at (token->location, "outer %<__transaction_cancel%> not "
27006 "within outer %<__transaction_atomic%>");
27007 error_at (token->location,
27008 " or a %<transaction_may_cancel_outer%> function");
27009 return error_mark_node;
27012 else if (parser->in_transaction == 0)
27014 error_at (token->location, "%<__transaction_cancel%> not within "
27015 "%<__transaction_atomic%>");
27016 return error_mark_node;
27019 stmt = build_tm_abort_call (token->location, is_outer);
27028 static GTY (()) cp_parser *the_parser;
27031 /* Special handling for the first token or line in the file. The first
27032 thing in the file might be #pragma GCC pch_preprocess, which loads a
27033 PCH file, which is a GC collection point. So we need to handle this
27034 first pragma without benefit of an existing lexer structure.
27036 Always returns one token to the caller in *FIRST_TOKEN. This is
27037 either the true first token of the file, or the first token after
27038 the initial pragma. */
27041 cp_parser_initial_pragma (cp_token *first_token)
27045 cp_lexer_get_preprocessor_token (NULL, first_token);
27046 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
27049 cp_lexer_get_preprocessor_token (NULL, first_token);
27050 if (first_token->type == CPP_STRING)
27052 name = first_token->u.value;
27054 cp_lexer_get_preprocessor_token (NULL, first_token);
27055 if (first_token->type != CPP_PRAGMA_EOL)
27056 error_at (first_token->location,
27057 "junk at end of %<#pragma GCC pch_preprocess%>");
27060 error_at (first_token->location, "expected string literal");
27062 /* Skip to the end of the pragma. */
27063 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
27064 cp_lexer_get_preprocessor_token (NULL, first_token);
27066 /* Now actually load the PCH file. */
27068 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
27070 /* Read one more token to return to our caller. We have to do this
27071 after reading the PCH file in, since its pointers have to be
27073 cp_lexer_get_preprocessor_token (NULL, first_token);
27076 /* Normal parsing of a pragma token. Here we can (and must) use the
27080 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
27082 cp_token *pragma_tok;
27085 pragma_tok = cp_lexer_consume_token (parser->lexer);
27086 gcc_assert (pragma_tok->type == CPP_PRAGMA);
27087 parser->lexer->in_pragma = true;
27089 id = pragma_tok->pragma_kind;
27092 case PRAGMA_GCC_PCH_PREPROCESS:
27093 error_at (pragma_tok->location,
27094 "%<#pragma GCC pch_preprocess%> must be first");
27097 case PRAGMA_OMP_BARRIER:
27100 case pragma_compound:
27101 cp_parser_omp_barrier (parser, pragma_tok);
27104 error_at (pragma_tok->location, "%<#pragma omp barrier%> may only be "
27105 "used in compound statements");
27112 case PRAGMA_OMP_FLUSH:
27115 case pragma_compound:
27116 cp_parser_omp_flush (parser, pragma_tok);
27119 error_at (pragma_tok->location, "%<#pragma omp flush%> may only be "
27120 "used in compound statements");
27127 case PRAGMA_OMP_TASKWAIT:
27130 case pragma_compound:
27131 cp_parser_omp_taskwait (parser, pragma_tok);
27134 error_at (pragma_tok->location,
27135 "%<#pragma omp taskwait%> may only be "
27136 "used in compound statements");
27143 case PRAGMA_OMP_TASKYIELD:
27146 case pragma_compound:
27147 cp_parser_omp_taskyield (parser, pragma_tok);
27150 error_at (pragma_tok->location,
27151 "%<#pragma omp taskyield%> may only be "
27152 "used in compound statements");
27159 case PRAGMA_OMP_THREADPRIVATE:
27160 cp_parser_omp_threadprivate (parser, pragma_tok);
27163 case PRAGMA_OMP_ATOMIC:
27164 case PRAGMA_OMP_CRITICAL:
27165 case PRAGMA_OMP_FOR:
27166 case PRAGMA_OMP_MASTER:
27167 case PRAGMA_OMP_ORDERED:
27168 case PRAGMA_OMP_PARALLEL:
27169 case PRAGMA_OMP_SECTIONS:
27170 case PRAGMA_OMP_SINGLE:
27171 case PRAGMA_OMP_TASK:
27172 if (context == pragma_external)
27174 cp_parser_omp_construct (parser, pragma_tok);
27177 case PRAGMA_OMP_SECTION:
27178 error_at (pragma_tok->location,
27179 "%<#pragma omp section%> may only be used in "
27180 "%<#pragma omp sections%> construct");
27184 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
27185 c_invoke_pragma_handler (id);
27189 cp_parser_error (parser, "expected declaration specifiers");
27193 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
27197 /* The interface the pragma parsers have to the lexer. */
27200 pragma_lex (tree *value)
27203 enum cpp_ttype ret;
27205 tok = cp_lexer_peek_token (the_parser->lexer);
27208 *value = tok->u.value;
27210 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
27212 else if (ret == CPP_STRING)
27213 *value = cp_parser_string_literal (the_parser, false, false);
27216 cp_lexer_consume_token (the_parser->lexer);
27217 if (ret == CPP_KEYWORD)
27225 /* External interface. */
27227 /* Parse one entire translation unit. */
27230 c_parse_file (void)
27232 static bool already_called = false;
27234 if (already_called)
27236 sorry ("inter-module optimizations not implemented for C++");
27239 already_called = true;
27241 the_parser = cp_parser_new ();
27242 push_deferring_access_checks (flag_access_control
27243 ? dk_no_deferred : dk_no_check);
27244 cp_parser_translation_unit (the_parser);
27248 #include "gt-cp-parser.h"