2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011, 2012 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 tree cp_parser_cache_defarg
2253 (cp_parser *parser, bool nsdmi);
2254 static void cp_parser_parse_tentatively
2256 static void cp_parser_commit_to_tentative_parse
2258 static void cp_parser_abort_tentative_parse
2260 static bool cp_parser_parse_definitely
2262 static inline bool cp_parser_parsing_tentatively
2264 static bool cp_parser_uncommitted_to_tentative_parse_p
2266 static void cp_parser_error
2267 (cp_parser *, const char *);
2268 static void cp_parser_name_lookup_error
2269 (cp_parser *, tree, tree, name_lookup_error, location_t);
2270 static bool cp_parser_simulate_error
2272 static bool cp_parser_check_type_definition
2274 static void cp_parser_check_for_definition_in_return_type
2275 (cp_declarator *, tree, location_t type_location);
2276 static void cp_parser_check_for_invalid_template_id
2277 (cp_parser *, tree, location_t location);
2278 static bool cp_parser_non_integral_constant_expression
2279 (cp_parser *, non_integral_constant);
2280 static void cp_parser_diagnose_invalid_type_name
2281 (cp_parser *, tree, tree, location_t);
2282 static bool cp_parser_parse_and_diagnose_invalid_type_name
2284 static int cp_parser_skip_to_closing_parenthesis
2285 (cp_parser *, bool, bool, bool);
2286 static void cp_parser_skip_to_end_of_statement
2288 static void cp_parser_consume_semicolon_at_end_of_statement
2290 static void cp_parser_skip_to_end_of_block_or_statement
2292 static bool cp_parser_skip_to_closing_brace
2294 static void cp_parser_skip_to_end_of_template_parameter_list
2296 static void cp_parser_skip_to_pragma_eol
2297 (cp_parser*, cp_token *);
2298 static bool cp_parser_error_occurred
2300 static bool cp_parser_allow_gnu_extensions_p
2302 static bool cp_parser_is_pure_string_literal
2304 static bool cp_parser_is_string_literal
2306 static bool cp_parser_is_keyword
2307 (cp_token *, enum rid);
2308 static tree cp_parser_make_typename_type
2309 (cp_parser *, tree, tree, location_t location);
2310 static cp_declarator * cp_parser_make_indirect_declarator
2311 (enum tree_code, tree, cp_cv_quals, cp_declarator *);
2313 /* Returns nonzero if we are parsing tentatively. */
2316 cp_parser_parsing_tentatively (cp_parser* parser)
2318 return parser->context->next != NULL;
2321 /* Returns nonzero if TOKEN is a string literal. */
2324 cp_parser_is_pure_string_literal (cp_token* token)
2326 return (token->type == CPP_STRING ||
2327 token->type == CPP_STRING16 ||
2328 token->type == CPP_STRING32 ||
2329 token->type == CPP_WSTRING ||
2330 token->type == CPP_UTF8STRING);
2333 /* Returns nonzero if TOKEN is a string literal
2334 of a user-defined string literal. */
2337 cp_parser_is_string_literal (cp_token* token)
2339 return (cp_parser_is_pure_string_literal (token) ||
2340 token->type == CPP_STRING_USERDEF ||
2341 token->type == CPP_STRING16_USERDEF ||
2342 token->type == CPP_STRING32_USERDEF ||
2343 token->type == CPP_WSTRING_USERDEF ||
2344 token->type == CPP_UTF8STRING_USERDEF);
2347 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2350 cp_parser_is_keyword (cp_token* token, enum rid keyword)
2352 return token->keyword == keyword;
2355 /* If not parsing tentatively, issue a diagnostic of the form
2356 FILE:LINE: MESSAGE before TOKEN
2357 where TOKEN is the next token in the input stream. MESSAGE
2358 (specified by the caller) is usually of the form "expected
2362 cp_parser_error (cp_parser* parser, const char* gmsgid)
2364 if (!cp_parser_simulate_error (parser))
2366 cp_token *token = cp_lexer_peek_token (parser->lexer);
2367 /* This diagnostic makes more sense if it is tagged to the line
2368 of the token we just peeked at. */
2369 cp_lexer_set_source_position_from_token (token);
2371 if (token->type == CPP_PRAGMA)
2373 error_at (token->location,
2374 "%<#pragma%> is not allowed here");
2375 cp_parser_skip_to_pragma_eol (parser, token);
2379 c_parse_error (gmsgid,
2380 /* Because c_parser_error does not understand
2381 CPP_KEYWORD, keywords are treated like
2383 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
2384 token->u.value, token->flags);
2388 /* Issue an error about name-lookup failing. NAME is the
2389 IDENTIFIER_NODE DECL is the result of
2390 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2391 the thing that we hoped to find. */
2394 cp_parser_name_lookup_error (cp_parser* parser,
2397 name_lookup_error desired,
2398 location_t location)
2400 /* If name lookup completely failed, tell the user that NAME was not
2402 if (decl == error_mark_node)
2404 if (parser->scope && parser->scope != global_namespace)
2405 error_at (location, "%<%E::%E%> has not been declared",
2406 parser->scope, name);
2407 else if (parser->scope == global_namespace)
2408 error_at (location, "%<::%E%> has not been declared", name);
2409 else if (parser->object_scope
2410 && !CLASS_TYPE_P (parser->object_scope))
2411 error_at (location, "request for member %qE in non-class type %qT",
2412 name, parser->object_scope);
2413 else if (parser->object_scope)
2414 error_at (location, "%<%T::%E%> has not been declared",
2415 parser->object_scope, name);
2417 error_at (location, "%qE has not been declared", name);
2419 else if (parser->scope && parser->scope != global_namespace)
2424 error_at (location, "%<%E::%E%> is not a type",
2425 parser->scope, name);
2428 error_at (location, "%<%E::%E%> is not a class or namespace",
2429 parser->scope, name);
2433 "%<%E::%E%> is not a class, namespace, or enumeration",
2434 parser->scope, name);
2441 else if (parser->scope == global_namespace)
2446 error_at (location, "%<::%E%> is not a type", name);
2449 error_at (location, "%<::%E%> is not a class or namespace", name);
2453 "%<::%E%> is not a class, namespace, or enumeration",
2465 error_at (location, "%qE is not a type", name);
2468 error_at (location, "%qE is not a class or namespace", name);
2472 "%qE is not a class, namespace, or enumeration", name);
2480 /* If we are parsing tentatively, remember that an error has occurred
2481 during this tentative parse. Returns true if the error was
2482 simulated; false if a message should be issued by the caller. */
2485 cp_parser_simulate_error (cp_parser* parser)
2487 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2489 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2495 /* Check for repeated decl-specifiers. */
2498 cp_parser_check_decl_spec (cp_decl_specifier_seq *decl_specs,
2499 location_t location)
2503 for (ds = ds_first; ds != ds_last; ++ds)
2505 unsigned count = decl_specs->specs[ds];
2508 /* The "long" specifier is a special case because of "long long". */
2512 error_at (location, "%<long long long%> is too long for GCC");
2514 pedwarn_cxx98 (location, OPT_Wlong_long,
2515 "ISO C++ 1998 does not support %<long long%>");
2519 static const char *const decl_spec_names[] = {
2537 error_at (location, "duplicate %qs", decl_spec_names[ds]);
2542 /* This function is called when a type is defined. If type
2543 definitions are forbidden at this point, an error message is
2547 cp_parser_check_type_definition (cp_parser* parser)
2549 /* If types are forbidden here, issue a message. */
2550 if (parser->type_definition_forbidden_message)
2552 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2553 in the message need to be interpreted. */
2554 error (parser->type_definition_forbidden_message);
2560 /* This function is called when the DECLARATOR is processed. The TYPE
2561 was a type defined in the decl-specifiers. If it is invalid to
2562 define a type in the decl-specifiers for DECLARATOR, an error is
2563 issued. TYPE_LOCATION is the location of TYPE and is used
2564 for error reporting. */
2567 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2568 tree type, location_t type_location)
2570 /* [dcl.fct] forbids type definitions in return types.
2571 Unfortunately, it's not easy to know whether or not we are
2572 processing a return type until after the fact. */
2574 && (declarator->kind == cdk_pointer
2575 || declarator->kind == cdk_reference
2576 || declarator->kind == cdk_ptrmem))
2577 declarator = declarator->declarator;
2579 && declarator->kind == cdk_function)
2581 error_at (type_location,
2582 "new types may not be defined in a return type");
2583 inform (type_location,
2584 "(perhaps a semicolon is missing after the definition of %qT)",
2589 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2590 "<" in any valid C++ program. If the next token is indeed "<",
2591 issue a message warning the user about what appears to be an
2592 invalid attempt to form a template-id. LOCATION is the location
2593 of the type-specifier (TYPE) */
2596 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2597 tree type, location_t location)
2599 cp_token_position start = 0;
2601 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2604 error_at (location, "%qT is not a template", type);
2605 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2606 error_at (location, "%qE is not a template", type);
2608 error_at (location, "invalid template-id");
2609 /* Remember the location of the invalid "<". */
2610 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
2611 start = cp_lexer_token_position (parser->lexer, true);
2612 /* Consume the "<". */
2613 cp_lexer_consume_token (parser->lexer);
2614 /* Parse the template arguments. */
2615 cp_parser_enclosed_template_argument_list (parser);
2616 /* Permanently remove the invalid template arguments so that
2617 this error message is not issued again. */
2619 cp_lexer_purge_tokens_after (parser->lexer, start);
2623 /* If parsing an integral constant-expression, issue an error message
2624 about the fact that THING appeared and return true. Otherwise,
2625 return false. In either case, set
2626 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2629 cp_parser_non_integral_constant_expression (cp_parser *parser,
2630 non_integral_constant thing)
2632 parser->non_integral_constant_expression_p = true;
2633 if (parser->integral_constant_expression_p)
2635 if (!parser->allow_non_integral_constant_expression_p)
2637 const char *msg = NULL;
2641 error ("floating-point literal "
2642 "cannot appear in a constant-expression");
2645 error ("a cast to a type other than an integral or "
2646 "enumeration type cannot appear in a "
2647 "constant-expression");
2650 error ("%<typeid%> operator "
2651 "cannot appear in a constant-expression");
2654 error ("non-constant compound literals "
2655 "cannot appear in a constant-expression");
2658 error ("a function call "
2659 "cannot appear in a constant-expression");
2662 error ("an increment "
2663 "cannot appear in a constant-expression");
2666 error ("an decrement "
2667 "cannot appear in a constant-expression");
2670 error ("an array reference "
2671 "cannot appear in a constant-expression");
2673 case NIC_ADDR_LABEL:
2674 error ("the address of a label "
2675 "cannot appear in a constant-expression");
2677 case NIC_OVERLOADED:
2678 error ("calls to overloaded operators "
2679 "cannot appear in a constant-expression");
2681 case NIC_ASSIGNMENT:
2682 error ("an assignment cannot appear in a constant-expression");
2685 error ("a comma operator "
2686 "cannot appear in a constant-expression");
2688 case NIC_CONSTRUCTOR:
2689 error ("a call to a constructor "
2690 "cannot appear in a constant-expression");
2692 case NIC_TRANSACTION:
2693 error ("a transaction expression "
2694 "cannot appear in a constant-expression");
2700 msg = "__FUNCTION__";
2702 case NIC_PRETTY_FUNC:
2703 msg = "__PRETTY_FUNCTION__";
2723 case NIC_PREINCREMENT:
2726 case NIC_PREDECREMENT:
2739 error ("%qs cannot appear in a constant-expression", msg);
2746 /* Emit a diagnostic for an invalid type name. SCOPE is the
2747 qualifying scope (or NULL, if none) for ID. This function commits
2748 to the current active tentative parse, if any. (Otherwise, the
2749 problematic construct might be encountered again later, resulting
2750 in duplicate error messages.) LOCATION is the location of ID. */
2753 cp_parser_diagnose_invalid_type_name (cp_parser *parser,
2754 tree scope, tree id,
2755 location_t location)
2757 tree decl, old_scope;
2758 cp_parser_commit_to_tentative_parse (parser);
2759 /* Try to lookup the identifier. */
2760 old_scope = parser->scope;
2761 parser->scope = scope;
2762 decl = cp_parser_lookup_name_simple (parser, id, location);
2763 parser->scope = old_scope;
2764 /* If the lookup found a template-name, it means that the user forgot
2765 to specify an argument list. Emit a useful error message. */
2766 if (TREE_CODE (decl) == TEMPLATE_DECL)
2768 "invalid use of template-name %qE without an argument list",
2770 else if (TREE_CODE (id) == BIT_NOT_EXPR)
2771 error_at (location, "invalid use of destructor %qD as a type", id);
2772 else if (TREE_CODE (decl) == TYPE_DECL)
2773 /* Something like 'unsigned A a;' */
2774 error_at (location, "invalid combination of multiple type-specifiers");
2775 else if (!parser->scope)
2777 /* Issue an error message. */
2778 error_at (location, "%qE does not name a type", id);
2779 /* If we're in a template class, it's possible that the user was
2780 referring to a type from a base class. For example:
2782 template <typename T> struct A { typedef T X; };
2783 template <typename T> struct B : public A<T> { X x; };
2785 The user should have said "typename A<T>::X". */
2786 if (cxx_dialect < cxx0x && id == ridpointers[(int)RID_CONSTEXPR])
2787 inform (location, "C++11 %<constexpr%> only available with "
2788 "-std=c++11 or -std=gnu++11");
2789 else if (processing_template_decl && current_class_type
2790 && TYPE_BINFO (current_class_type))
2794 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2798 tree base_type = BINFO_TYPE (b);
2799 if (CLASS_TYPE_P (base_type)
2800 && dependent_type_p (base_type))
2803 /* Go from a particular instantiation of the
2804 template (which will have an empty TYPE_FIELDs),
2805 to the main version. */
2806 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2807 for (field = TYPE_FIELDS (base_type);
2809 field = DECL_CHAIN (field))
2810 if (TREE_CODE (field) == TYPE_DECL
2811 && DECL_NAME (field) == id)
2814 "(perhaps %<typename %T::%E%> was intended)",
2815 BINFO_TYPE (b), id);
2824 /* Here we diagnose qualified-ids where the scope is actually correct,
2825 but the identifier does not resolve to a valid type name. */
2826 else if (parser->scope != error_mark_node)
2828 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2829 error_at (location, "%qE in namespace %qE does not name a type",
2831 else if (CLASS_TYPE_P (parser->scope)
2832 && constructor_name_p (id, parser->scope))
2835 error_at (location, "%<%T::%E%> names the constructor, not"
2836 " the type", parser->scope, id);
2837 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2838 error_at (location, "and %qT has no template constructors",
2841 else if (TYPE_P (parser->scope)
2842 && dependent_scope_p (parser->scope))
2843 error_at (location, "need %<typename%> before %<%T::%E%> because "
2844 "%qT is a dependent scope",
2845 parser->scope, id, parser->scope);
2846 else if (TYPE_P (parser->scope))
2847 error_at (location, "%qE in %q#T does not name a type",
2854 /* Check for a common situation where a type-name should be present,
2855 but is not, and issue a sensible error message. Returns true if an
2856 invalid type-name was detected.
2858 The situation handled by this function are variable declarations of the
2859 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2860 Usually, `ID' should name a type, but if we got here it means that it
2861 does not. We try to emit the best possible error message depending on
2862 how exactly the id-expression looks like. */
2865 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2868 cp_token *token = cp_lexer_peek_token (parser->lexer);
2870 /* Avoid duplicate error about ambiguous lookup. */
2871 if (token->type == CPP_NESTED_NAME_SPECIFIER)
2873 cp_token *next = cp_lexer_peek_nth_token (parser->lexer, 2);
2874 if (next->type == CPP_NAME && next->ambiguous_p)
2878 cp_parser_parse_tentatively (parser);
2879 id = cp_parser_id_expression (parser,
2880 /*template_keyword_p=*/false,
2881 /*check_dependency_p=*/true,
2882 /*template_p=*/NULL,
2883 /*declarator_p=*/true,
2884 /*optional_p=*/false);
2885 /* If the next token is a (, this is a function with no explicit return
2886 type, i.e. constructor, destructor or conversion op. */
2887 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
2888 || TREE_CODE (id) == TYPE_DECL)
2890 cp_parser_abort_tentative_parse (parser);
2893 if (!cp_parser_parse_definitely (parser))
2896 /* Emit a diagnostic for the invalid type. */
2897 cp_parser_diagnose_invalid_type_name (parser, parser->scope,
2898 id, token->location);
2900 /* If we aren't in the middle of a declarator (i.e. in a
2901 parameter-declaration-clause), skip to the end of the declaration;
2902 there's no point in trying to process it. */
2903 if (!parser->in_declarator_p)
2904 cp_parser_skip_to_end_of_block_or_statement (parser);
2908 /* Consume tokens up to, and including, the next non-nested closing `)'.
2909 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2910 are doing error recovery. Returns -1 if OR_COMMA is true and we
2911 found an unnested comma. */
2914 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2919 unsigned paren_depth = 0;
2920 unsigned brace_depth = 0;
2921 unsigned square_depth = 0;
2923 if (recovering && !or_comma
2924 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2929 cp_token * token = cp_lexer_peek_token (parser->lexer);
2931 switch (token->type)
2934 case CPP_PRAGMA_EOL:
2935 /* If we've run out of tokens, then there is no closing `)'. */
2938 /* This is good for lambda expression capture-lists. */
2939 case CPP_OPEN_SQUARE:
2942 case CPP_CLOSE_SQUARE:
2943 if (!square_depth--)
2948 /* This matches the processing in skip_to_end_of_statement. */
2953 case CPP_OPEN_BRACE:
2956 case CPP_CLOSE_BRACE:
2962 if (recovering && or_comma && !brace_depth && !paren_depth
2967 case CPP_OPEN_PAREN:
2972 case CPP_CLOSE_PAREN:
2973 if (!brace_depth && !paren_depth--)
2976 cp_lexer_consume_token (parser->lexer);
2985 /* Consume the token. */
2986 cp_lexer_consume_token (parser->lexer);
2990 /* Consume tokens until we reach the end of the current statement.
2991 Normally, that will be just before consuming a `;'. However, if a
2992 non-nested `}' comes first, then we stop before consuming that. */
2995 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2997 unsigned nesting_depth = 0;
3001 cp_token *token = cp_lexer_peek_token (parser->lexer);
3003 switch (token->type)
3006 case CPP_PRAGMA_EOL:
3007 /* If we've run out of tokens, stop. */
3011 /* If the next token is a `;', we have reached the end of the
3017 case CPP_CLOSE_BRACE:
3018 /* If this is a non-nested '}', stop before consuming it.
3019 That way, when confronted with something like:
3023 we stop before consuming the closing '}', even though we
3024 have not yet reached a `;'. */
3025 if (nesting_depth == 0)
3028 /* If it is the closing '}' for a block that we have
3029 scanned, stop -- but only after consuming the token.
3035 we will stop after the body of the erroneously declared
3036 function, but before consuming the following `typedef'
3038 if (--nesting_depth == 0)
3040 cp_lexer_consume_token (parser->lexer);
3044 case CPP_OPEN_BRACE:
3052 /* Consume the token. */
3053 cp_lexer_consume_token (parser->lexer);
3057 /* This function is called at the end of a statement or declaration.
3058 If the next token is a semicolon, it is consumed; otherwise, error
3059 recovery is attempted. */
3062 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
3064 /* Look for the trailing `;'. */
3065 if (!cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON))
3067 /* If there is additional (erroneous) input, skip to the end of
3069 cp_parser_skip_to_end_of_statement (parser);
3070 /* If the next token is now a `;', consume it. */
3071 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
3072 cp_lexer_consume_token (parser->lexer);
3076 /* Skip tokens until we have consumed an entire block, or until we
3077 have consumed a non-nested `;'. */
3080 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
3082 int nesting_depth = 0;
3084 while (nesting_depth >= 0)
3086 cp_token *token = cp_lexer_peek_token (parser->lexer);
3088 switch (token->type)
3091 case CPP_PRAGMA_EOL:
3092 /* If we've run out of tokens, stop. */
3096 /* Stop if this is an unnested ';'. */
3101 case CPP_CLOSE_BRACE:
3102 /* Stop if this is an unnested '}', or closes the outermost
3105 if (nesting_depth < 0)
3111 case CPP_OPEN_BRACE:
3120 /* Consume the token. */
3121 cp_lexer_consume_token (parser->lexer);
3125 /* Skip tokens until a non-nested closing curly brace is the next
3126 token, or there are no more tokens. Return true in the first case,
3130 cp_parser_skip_to_closing_brace (cp_parser *parser)
3132 unsigned nesting_depth = 0;
3136 cp_token *token = cp_lexer_peek_token (parser->lexer);
3138 switch (token->type)
3141 case CPP_PRAGMA_EOL:
3142 /* If we've run out of tokens, stop. */
3145 case CPP_CLOSE_BRACE:
3146 /* If the next token is a non-nested `}', then we have reached
3147 the end of the current block. */
3148 if (nesting_depth-- == 0)
3152 case CPP_OPEN_BRACE:
3153 /* If it the next token is a `{', then we are entering a new
3154 block. Consume the entire block. */
3162 /* Consume the token. */
3163 cp_lexer_consume_token (parser->lexer);
3167 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3168 parameter is the PRAGMA token, allowing us to purge the entire pragma
3172 cp_parser_skip_to_pragma_eol (cp_parser* parser, cp_token *pragma_tok)
3176 parser->lexer->in_pragma = false;
3179 token = cp_lexer_consume_token (parser->lexer);
3180 while (token->type != CPP_PRAGMA_EOL && token->type != CPP_EOF);
3182 /* Ensure that the pragma is not parsed again. */
3183 cp_lexer_purge_tokens_after (parser->lexer, pragma_tok);
3186 /* Require pragma end of line, resyncing with it as necessary. The
3187 arguments are as for cp_parser_skip_to_pragma_eol. */
3190 cp_parser_require_pragma_eol (cp_parser *parser, cp_token *pragma_tok)
3192 parser->lexer->in_pragma = false;
3193 if (!cp_parser_require (parser, CPP_PRAGMA_EOL, RT_PRAGMA_EOL))
3194 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
3197 /* This is a simple wrapper around make_typename_type. When the id is
3198 an unresolved identifier node, we can provide a superior diagnostic
3199 using cp_parser_diagnose_invalid_type_name. */
3202 cp_parser_make_typename_type (cp_parser *parser, tree scope,
3203 tree id, location_t id_location)
3206 if (TREE_CODE (id) == IDENTIFIER_NODE)
3208 result = make_typename_type (scope, id, typename_type,
3209 /*complain=*/tf_none);
3210 if (result == error_mark_node)
3211 cp_parser_diagnose_invalid_type_name (parser, scope, id, id_location);
3214 return make_typename_type (scope, id, typename_type, tf_error);
3217 /* This is a wrapper around the
3218 make_{pointer,ptrmem,reference}_declarator functions that decides
3219 which one to call based on the CODE and CLASS_TYPE arguments. The
3220 CODE argument should be one of the values returned by
3221 cp_parser_ptr_operator. */
3222 static cp_declarator *
3223 cp_parser_make_indirect_declarator (enum tree_code code, tree class_type,
3224 cp_cv_quals cv_qualifiers,
3225 cp_declarator *target)
3227 if (code == ERROR_MARK)
3228 return cp_error_declarator;
3230 if (code == INDIRECT_REF)
3231 if (class_type == NULL_TREE)
3232 return make_pointer_declarator (cv_qualifiers, target);
3234 return make_ptrmem_declarator (cv_qualifiers, class_type, target);
3235 else if (code == ADDR_EXPR && class_type == NULL_TREE)
3236 return make_reference_declarator (cv_qualifiers, target, false);
3237 else if (code == NON_LVALUE_EXPR && class_type == NULL_TREE)
3238 return make_reference_declarator (cv_qualifiers, target, true);
3242 /* Create a new C++ parser. */
3245 cp_parser_new (void)
3251 /* cp_lexer_new_main is called before doing GC allocation because
3252 cp_lexer_new_main might load a PCH file. */
3253 lexer = cp_lexer_new_main ();
3255 /* Initialize the binops_by_token so that we can get the tree
3256 directly from the token. */
3257 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
3258 binops_by_token[binops[i].token_type] = binops[i];
3260 parser = ggc_alloc_cleared_cp_parser ();
3261 parser->lexer = lexer;
3262 parser->context = cp_parser_context_new (NULL);
3264 /* For now, we always accept GNU extensions. */
3265 parser->allow_gnu_extensions_p = 1;
3267 /* The `>' token is a greater-than operator, not the end of a
3269 parser->greater_than_is_operator_p = true;
3271 parser->default_arg_ok_p = true;
3273 /* We are not parsing a constant-expression. */
3274 parser->integral_constant_expression_p = false;
3275 parser->allow_non_integral_constant_expression_p = false;
3276 parser->non_integral_constant_expression_p = false;
3278 /* Local variable names are not forbidden. */
3279 parser->local_variables_forbidden_p = false;
3281 /* We are not processing an `extern "C"' declaration. */
3282 parser->in_unbraced_linkage_specification_p = false;
3284 /* We are not processing a declarator. */
3285 parser->in_declarator_p = false;
3287 /* We are not processing a template-argument-list. */
3288 parser->in_template_argument_list_p = false;
3290 /* We are not in an iteration statement. */
3291 parser->in_statement = 0;
3293 /* We are not in a switch statement. */
3294 parser->in_switch_statement_p = false;
3296 /* We are not parsing a type-id inside an expression. */
3297 parser->in_type_id_in_expr_p = false;
3299 /* Declarations aren't implicitly extern "C". */
3300 parser->implicit_extern_c = false;
3302 /* String literals should be translated to the execution character set. */
3303 parser->translate_strings_p = true;
3305 /* We are not parsing a function body. */
3306 parser->in_function_body = false;
3308 /* We can correct until told otherwise. */
3309 parser->colon_corrects_to_scope_p = true;
3311 /* The unparsed function queue is empty. */
3312 push_unparsed_function_queues (parser);
3314 /* There are no classes being defined. */
3315 parser->num_classes_being_defined = 0;
3317 /* No template parameters apply. */
3318 parser->num_template_parameter_lists = 0;
3323 /* Create a cp_lexer structure which will emit the tokens in CACHE
3324 and push it onto the parser's lexer stack. This is used for delayed
3325 parsing of in-class method bodies and default arguments, and should
3326 not be confused with tentative parsing. */
3328 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
3330 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
3331 lexer->next = parser->lexer;
3332 parser->lexer = lexer;
3334 /* Move the current source position to that of the first token in the
3336 cp_lexer_set_source_position_from_token (lexer->next_token);
3339 /* Pop the top lexer off the parser stack. This is never used for the
3340 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3342 cp_parser_pop_lexer (cp_parser *parser)
3344 cp_lexer *lexer = parser->lexer;
3345 parser->lexer = lexer->next;
3346 cp_lexer_destroy (lexer);
3348 /* Put the current source position back where it was before this
3349 lexer was pushed. */
3350 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
3353 /* Lexical conventions [gram.lex] */
3355 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3359 cp_parser_identifier (cp_parser* parser)
3363 /* Look for the identifier. */
3364 token = cp_parser_require (parser, CPP_NAME, RT_NAME);
3365 /* Return the value. */
3366 return token ? token->u.value : error_mark_node;
3369 /* Parse a sequence of adjacent string constants. Returns a
3370 TREE_STRING representing the combined, nul-terminated string
3371 constant. If TRANSLATE is true, translate the string to the
3372 execution character set. If WIDE_OK is true, a wide string is
3375 C++98 [lex.string] says that if a narrow string literal token is
3376 adjacent to a wide string literal token, the behavior is undefined.
3377 However, C99 6.4.5p4 says that this results in a wide string literal.
3378 We follow C99 here, for consistency with the C front end.
3380 This code is largely lifted from lex_string() in c-lex.c.
3382 FUTURE: ObjC++ will need to handle @-strings here. */
3384 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
3388 struct obstack str_ob;
3389 cpp_string str, istr, *strs;
3391 enum cpp_ttype type, curr_type;
3392 int have_suffix_p = 0;
3394 tree suffix_id = NULL_TREE;
3395 bool curr_tok_is_userdef_p = false;
3397 tok = cp_lexer_peek_token (parser->lexer);
3398 if (!cp_parser_is_string_literal (tok))
3400 cp_parser_error (parser, "expected string-literal");
3401 return error_mark_node;
3404 if (cpp_userdef_string_p (tok->type))
3406 string_tree = USERDEF_LITERAL_VALUE (tok->u.value);
3407 curr_type = cpp_userdef_string_remove_type (tok->type);
3408 curr_tok_is_userdef_p = true;
3412 string_tree = tok->u.value;
3413 curr_type = tok->type;
3417 /* Try to avoid the overhead of creating and destroying an obstack
3418 for the common case of just one string. */
3419 if (!cp_parser_is_string_literal
3420 (cp_lexer_peek_nth_token (parser->lexer, 2)))
3422 cp_lexer_consume_token (parser->lexer);
3424 str.text = (const unsigned char *)TREE_STRING_POINTER (string_tree);
3425 str.len = TREE_STRING_LENGTH (string_tree);
3428 if (curr_tok_is_userdef_p)
3430 suffix_id = USERDEF_LITERAL_SUFFIX_ID (tok->u.value);
3432 curr_type = cpp_userdef_string_remove_type (tok->type);
3435 curr_type = tok->type;
3441 gcc_obstack_init (&str_ob);
3446 cp_lexer_consume_token (parser->lexer);
3448 str.text = (const unsigned char *)TREE_STRING_POINTER (string_tree);
3449 str.len = TREE_STRING_LENGTH (string_tree);
3451 if (curr_tok_is_userdef_p)
3453 tree curr_suffix_id = USERDEF_LITERAL_SUFFIX_ID (tok->u.value);
3454 if (have_suffix_p == 0)
3456 suffix_id = curr_suffix_id;
3459 else if (have_suffix_p == 1
3460 && curr_suffix_id != suffix_id)
3462 error ("inconsistent user-defined literal suffixes"
3463 " %qD and %qD in string literal",
3464 suffix_id, curr_suffix_id);
3467 curr_type = cpp_userdef_string_remove_type (tok->type);
3470 curr_type = tok->type;
3472 if (type != curr_type)
3474 if (type == CPP_STRING)
3476 else if (curr_type != CPP_STRING)
3477 error_at (tok->location,
3478 "unsupported non-standard concatenation "
3479 "of string literals");
3482 obstack_grow (&str_ob, &str, sizeof (cpp_string));
3484 tok = cp_lexer_peek_token (parser->lexer);
3485 if (cpp_userdef_string_p (tok->type))
3487 string_tree = USERDEF_LITERAL_VALUE (tok->u.value);
3488 curr_type = cpp_userdef_string_remove_type (tok->type);
3489 curr_tok_is_userdef_p = true;
3493 string_tree = tok->u.value;
3494 curr_type = tok->type;
3495 curr_tok_is_userdef_p = false;
3498 while (cp_parser_is_string_literal (tok));
3500 strs = (cpp_string *) obstack_finish (&str_ob);
3503 if (type != CPP_STRING && !wide_ok)
3505 cp_parser_error (parser, "a wide string is invalid in this context");
3509 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
3510 (parse_in, strs, count, &istr, type))
3512 value = build_string (istr.len, (const char *)istr.text);
3513 free (CONST_CAST (unsigned char *, istr.text));
3519 case CPP_UTF8STRING:
3520 TREE_TYPE (value) = char_array_type_node;
3523 TREE_TYPE (value) = char16_array_type_node;
3526 TREE_TYPE (value) = char32_array_type_node;
3529 TREE_TYPE (value) = wchar_array_type_node;
3533 value = fix_string_type (value);
3537 tree literal = build_userdef_literal (suffix_id, value, NULL_TREE);
3538 tok->u.value = literal;
3539 return cp_parser_userdef_string_literal (tok);
3543 /* cpp_interpret_string has issued an error. */
3544 value = error_mark_node;
3547 obstack_free (&str_ob, 0);
3552 /* Look up a literal operator with the name and the exact arguments. */
3555 lookup_literal_operator (tree name, VEC(tree,gc) *args)
3558 decl = lookup_name (name);
3559 if (!decl || !is_overloaded_fn (decl))
3560 return error_mark_node;
3562 for (fns = decl; fns; fns = OVL_NEXT (fns))
3566 tree fn = OVL_CURRENT (fns);
3567 tree argtypes = NULL_TREE;
3568 argtypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
3569 if (argtypes != NULL_TREE)
3571 for (ix = 0; ix < VEC_length (tree, args) && argtypes != NULL_TREE;
3572 ++ix, argtypes = TREE_CHAIN (argtypes))
3574 tree targ = TREE_VALUE (argtypes);
3575 tree tparm = TREE_TYPE (VEC_index (tree, args, ix));
3576 bool ptr = TREE_CODE (targ) == POINTER_TYPE;
3577 bool arr = TREE_CODE (tparm) == ARRAY_TYPE;
3578 if ((ptr || arr || !same_type_p (targ, tparm))
3580 || !same_type_p (TREE_TYPE (targ),
3581 TREE_TYPE (tparm))))
3585 && ix == VEC_length (tree, args)
3586 /* May be this should be sufficient_parms_p instead,
3587 depending on how exactly should user-defined literals
3588 work in presence of default arguments on the literal
3589 operator parameters. */
3590 && argtypes == void_list_node)
3595 return error_mark_node;
3598 /* Parse a user-defined char constant. Returns a call to a user-defined
3599 literal operator taking the character as an argument. */
3602 cp_parser_userdef_char_literal (cp_parser *parser)
3604 cp_token *token = cp_lexer_consume_token (parser->lexer);
3605 tree literal = token->u.value;
3606 tree suffix_id = USERDEF_LITERAL_SUFFIX_ID (literal);
3607 tree value = USERDEF_LITERAL_VALUE (literal);
3608 tree name = cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id));
3611 /* Build up a call to the user-defined operator */
3612 /* Lookup the name we got back from the id-expression. */
3613 VEC(tree,gc) *args = make_tree_vector ();
3614 VEC_safe_push (tree, gc, args, value);
3615 decl = lookup_literal_operator (name, args);
3616 if (!decl || decl == error_mark_node)
3618 error ("unable to find character literal operator %qD with %qT argument",
3619 name, TREE_TYPE (value));
3620 release_tree_vector (args);
3621 return error_mark_node;
3623 result = finish_call_expr (decl, &args, false, true, tf_warning_or_error);
3624 release_tree_vector (args);
3625 if (result != error_mark_node)
3628 error ("unable to find character literal operator %qD with %qT argument",
3629 name, TREE_TYPE (value));
3630 return error_mark_node;
3633 /* A subroutine of cp_parser_userdef_numeric_literal to
3634 create a char... template parameter pack from a string node. */
3637 make_char_string_pack (tree value)
3640 tree argpack = make_node (NONTYPE_ARGUMENT_PACK);
3641 const char *str = TREE_STRING_POINTER (value);
3642 int i, len = TREE_STRING_LENGTH (value) - 1;
3643 tree argvec = make_tree_vec (1);
3645 /* Fill in CHARVEC with all of the parameters. */
3646 charvec = make_tree_vec (len);
3647 for (i = 0; i < len; ++i)
3648 TREE_VEC_ELT (charvec, i) = build_int_cst (char_type_node, str[i]);
3650 /* Build the argument packs. */
3651 SET_ARGUMENT_PACK_ARGS (argpack, charvec);
3652 TREE_TYPE (argpack) = char_type_node;
3654 TREE_VEC_ELT (argvec, 0) = argpack;
3659 /* Parse a user-defined numeric constant. returns a call to a user-defined
3660 literal operator. */
3663 cp_parser_userdef_numeric_literal (cp_parser *parser)
3665 cp_token *token = cp_lexer_consume_token (parser->lexer);
3666 tree literal = token->u.value;
3667 tree suffix_id = USERDEF_LITERAL_SUFFIX_ID (literal);
3668 tree value = USERDEF_LITERAL_VALUE (literal);
3669 tree num_string = USERDEF_LITERAL_NUM_STRING (literal);
3670 tree name = cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id));
3674 /* Look for a literal operator taking the exact type of numeric argument
3675 as the literal value. */
3676 args = make_tree_vector ();
3677 VEC_safe_push (tree, gc, args, value);
3678 decl = lookup_literal_operator (name, args);
3679 if (decl && decl != error_mark_node)
3681 result = finish_call_expr (decl, &args, false, true, tf_none);
3682 if (result != error_mark_node)
3684 release_tree_vector (args);
3688 release_tree_vector (args);
3690 /* If the numeric argument didn't work, look for a raw literal
3691 operator taking a const char* argument consisting of the number
3692 in string format. */
3693 args = make_tree_vector ();
3694 VEC_safe_push (tree, gc, args, num_string);
3695 decl = lookup_literal_operator (name, args);
3696 if (decl && decl != error_mark_node)
3698 result = finish_call_expr (decl, &args, false, true, tf_none);
3699 if (result != error_mark_node)
3701 release_tree_vector (args);
3705 release_tree_vector (args);
3707 /* If the raw literal didn't work, look for a non-type template
3708 function with parameter pack char.... Call the function with
3709 template parameter characters representing the number. */
3710 args = make_tree_vector ();
3711 decl = lookup_literal_operator (name, args);
3712 if (decl && decl != error_mark_node)
3714 tree tmpl_args = make_char_string_pack (num_string);
3715 decl = lookup_template_function (decl, tmpl_args);
3716 result = finish_call_expr (decl, &args, false, true, tf_none);
3717 if (result != error_mark_node)
3719 release_tree_vector (args);
3723 release_tree_vector (args);
3725 error ("unable to find numeric literal operator %qD", name);
3726 return error_mark_node;
3729 /* Parse a user-defined string constant. Returns a call to a user-defined
3730 literal operator taking a character pointer and the length of the string
3734 cp_parser_userdef_string_literal (cp_token *token)
3736 tree literal = token->u.value;
3737 tree suffix_id = USERDEF_LITERAL_SUFFIX_ID (literal);
3738 tree name = cp_literal_operator_id (IDENTIFIER_POINTER (suffix_id));
3739 tree value = USERDEF_LITERAL_VALUE (literal);
3740 int len = TREE_STRING_LENGTH (value)
3741 / TREE_INT_CST_LOW (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (value)))) - 1;
3744 /* Build up a call to the user-defined operator */
3745 /* Lookup the name we got back from the id-expression. */
3746 VEC(tree,gc) *args = make_tree_vector ();
3747 VEC_safe_push (tree, gc, args, value);
3748 VEC_safe_push (tree, gc, args, build_int_cst (size_type_node, len));
3749 decl = lookup_name (name);
3750 if (!decl || decl == error_mark_node)
3752 error ("unable to find string literal operator %qD", name);
3753 release_tree_vector (args);
3754 return error_mark_node;
3756 result = finish_call_expr (decl, &args, false, true, tf_none);
3757 release_tree_vector (args);
3758 if (result != error_mark_node)
3761 error ("unable to find string literal operator %qD with %qT, %qT arguments",
3762 name, TREE_TYPE (value), size_type_node);
3763 return error_mark_node;
3767 /* Basic concepts [gram.basic] */
3769 /* Parse a translation-unit.
3772 declaration-seq [opt]
3774 Returns TRUE if all went well. */
3777 cp_parser_translation_unit (cp_parser* parser)
3779 /* The address of the first non-permanent object on the declarator
3781 static void *declarator_obstack_base;
3785 /* Create the declarator obstack, if necessary. */
3786 if (!cp_error_declarator)
3788 gcc_obstack_init (&declarator_obstack);
3789 /* Create the error declarator. */
3790 cp_error_declarator = make_declarator (cdk_error);
3791 /* Create the empty parameter list. */
3792 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
3793 /* Remember where the base of the declarator obstack lies. */
3794 declarator_obstack_base = obstack_next_free (&declarator_obstack);
3797 cp_parser_declaration_seq_opt (parser);
3799 /* If there are no tokens left then all went well. */
3800 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
3802 /* Get rid of the token array; we don't need it any more. */
3803 cp_lexer_destroy (parser->lexer);
3804 parser->lexer = NULL;
3806 /* This file might have been a context that's implicitly extern
3807 "C". If so, pop the lang context. (Only relevant for PCH.) */
3808 if (parser->implicit_extern_c)
3810 pop_lang_context ();
3811 parser->implicit_extern_c = false;
3815 finish_translation_unit ();
3821 cp_parser_error (parser, "expected declaration");
3825 /* Make sure the declarator obstack was fully cleaned up. */
3826 gcc_assert (obstack_next_free (&declarator_obstack)
3827 == declarator_obstack_base);
3829 /* All went well. */
3833 /* Expressions [gram.expr] */
3835 /* Parse a primary-expression.
3846 ( compound-statement )
3847 __builtin_va_arg ( assignment-expression , type-id )
3848 __builtin_offsetof ( type-id , offsetof-expression )
3851 __has_nothrow_assign ( type-id )
3852 __has_nothrow_constructor ( type-id )
3853 __has_nothrow_copy ( type-id )
3854 __has_trivial_assign ( type-id )
3855 __has_trivial_constructor ( type-id )
3856 __has_trivial_copy ( type-id )
3857 __has_trivial_destructor ( type-id )
3858 __has_virtual_destructor ( type-id )
3859 __is_abstract ( type-id )
3860 __is_base_of ( type-id , type-id )
3861 __is_class ( type-id )
3862 __is_convertible_to ( type-id , type-id )
3863 __is_empty ( type-id )
3864 __is_enum ( type-id )
3865 __is_final ( type-id )
3866 __is_literal_type ( type-id )
3867 __is_pod ( type-id )
3868 __is_polymorphic ( type-id )
3869 __is_std_layout ( type-id )
3870 __is_trivial ( type-id )
3871 __is_union ( type-id )
3873 Objective-C++ Extension:
3881 ADDRESS_P is true iff this expression was immediately preceded by
3882 "&" and therefore might denote a pointer-to-member. CAST_P is true
3883 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3884 true iff this expression is a template argument.
3886 Returns a representation of the expression. Upon return, *IDK
3887 indicates what kind of id-expression (if any) was present. */
3890 cp_parser_primary_expression (cp_parser *parser,
3893 bool template_arg_p,
3896 cp_token *token = NULL;
3898 /* Assume the primary expression is not an id-expression. */
3899 *idk = CP_ID_KIND_NONE;
3901 /* Peek at the next token. */
3902 token = cp_lexer_peek_token (parser->lexer);
3903 switch (token->type)
3912 user-defined-literal */
3918 if (TREE_CODE (token->u.value) == USERDEF_LITERAL)
3919 return cp_parser_userdef_numeric_literal (parser);
3920 token = cp_lexer_consume_token (parser->lexer);
3921 if (TREE_CODE (token->u.value) == FIXED_CST)
3923 error_at (token->location,
3924 "fixed-point types not supported in C++");
3925 return error_mark_node;
3927 /* Floating-point literals are only allowed in an integral
3928 constant expression if they are cast to an integral or
3929 enumeration type. */
3930 if (TREE_CODE (token->u.value) == REAL_CST
3931 && parser->integral_constant_expression_p
3934 /* CAST_P will be set even in invalid code like "int(2.7 +
3935 ...)". Therefore, we have to check that the next token
3936 is sure to end the cast. */
3939 cp_token *next_token;
3941 next_token = cp_lexer_peek_token (parser->lexer);
3942 if (/* The comma at the end of an
3943 enumerator-definition. */
3944 next_token->type != CPP_COMMA
3945 /* The curly brace at the end of an enum-specifier. */
3946 && next_token->type != CPP_CLOSE_BRACE
3947 /* The end of a statement. */
3948 && next_token->type != CPP_SEMICOLON
3949 /* The end of the cast-expression. */
3950 && next_token->type != CPP_CLOSE_PAREN
3951 /* The end of an array bound. */
3952 && next_token->type != CPP_CLOSE_SQUARE
3953 /* The closing ">" in a template-argument-list. */
3954 && (next_token->type != CPP_GREATER
3955 || parser->greater_than_is_operator_p)
3956 /* C++0x only: A ">>" treated like two ">" tokens,
3957 in a template-argument-list. */
3958 && (next_token->type != CPP_RSHIFT
3959 || (cxx_dialect == cxx98)
3960 || parser->greater_than_is_operator_p))
3964 /* If we are within a cast, then the constraint that the
3965 cast is to an integral or enumeration type will be
3966 checked at that point. If we are not within a cast, then
3967 this code is invalid. */
3969 cp_parser_non_integral_constant_expression (parser, NIC_FLOAT);
3971 return token->u.value;
3973 case CPP_CHAR_USERDEF:
3974 case CPP_CHAR16_USERDEF:
3975 case CPP_CHAR32_USERDEF:
3976 case CPP_WCHAR_USERDEF:
3977 return cp_parser_userdef_char_literal (parser);
3983 case CPP_UTF8STRING:
3984 case CPP_STRING_USERDEF:
3985 case CPP_STRING16_USERDEF:
3986 case CPP_STRING32_USERDEF:
3987 case CPP_WSTRING_USERDEF:
3988 case CPP_UTF8STRING_USERDEF:
3989 /* ??? Should wide strings be allowed when parser->translate_strings_p
3990 is false (i.e. in attributes)? If not, we can kill the third
3991 argument to cp_parser_string_literal. */
3992 return cp_parser_string_literal (parser,
3993 parser->translate_strings_p,
3996 case CPP_OPEN_PAREN:
3999 bool saved_greater_than_is_operator_p;
4001 /* Consume the `('. */
4002 cp_lexer_consume_token (parser->lexer);
4003 /* Within a parenthesized expression, a `>' token is always
4004 the greater-than operator. */
4005 saved_greater_than_is_operator_p
4006 = parser->greater_than_is_operator_p;
4007 parser->greater_than_is_operator_p = true;
4008 /* If we see `( { ' then we are looking at the beginning of
4009 a GNU statement-expression. */
4010 if (cp_parser_allow_gnu_extensions_p (parser)
4011 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
4013 /* Statement-expressions are not allowed by the standard. */
4014 pedwarn (token->location, OPT_pedantic,
4015 "ISO C++ forbids braced-groups within expressions");
4017 /* And they're not allowed outside of a function-body; you
4018 cannot, for example, write:
4020 int i = ({ int j = 3; j + 1; });
4022 at class or namespace scope. */
4023 if (!parser->in_function_body
4024 || parser->in_template_argument_list_p)
4026 error_at (token->location,
4027 "statement-expressions are not allowed outside "
4028 "functions nor in template-argument lists");
4029 cp_parser_skip_to_end_of_block_or_statement (parser);
4030 expr = error_mark_node;
4034 /* Start the statement-expression. */
4035 expr = begin_stmt_expr ();
4036 /* Parse the compound-statement. */
4037 cp_parser_compound_statement (parser, expr, false, false);
4039 expr = finish_stmt_expr (expr, false);
4044 /* Parse the parenthesized expression. */
4045 expr = cp_parser_expression (parser, cast_p, idk);
4046 /* Let the front end know that this expression was
4047 enclosed in parentheses. This matters in case, for
4048 example, the expression is of the form `A::B', since
4049 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4051 finish_parenthesized_expr (expr);
4052 /* DR 705: Wrapping an unqualified name in parentheses
4053 suppresses arg-dependent lookup. We want to pass back
4054 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4055 (c++/37862), but none of the others. */
4056 if (*idk != CP_ID_KIND_QUALIFIED)
4057 *idk = CP_ID_KIND_NONE;
4059 /* The `>' token might be the end of a template-id or
4060 template-parameter-list now. */
4061 parser->greater_than_is_operator_p
4062 = saved_greater_than_is_operator_p;
4063 /* Consume the `)'. */
4064 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
4065 cp_parser_skip_to_end_of_statement (parser);
4070 case CPP_OPEN_SQUARE:
4071 if (c_dialect_objc ())
4072 /* We have an Objective-C++ message. */
4073 return cp_parser_objc_expression (parser);
4075 tree lam = cp_parser_lambda_expression (parser);
4076 /* Don't warn about a failed tentative parse. */
4077 if (cp_parser_error_occurred (parser))
4078 return error_mark_node;
4079 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR);
4083 case CPP_OBJC_STRING:
4084 if (c_dialect_objc ())
4085 /* We have an Objective-C++ string literal. */
4086 return cp_parser_objc_expression (parser);
4087 cp_parser_error (parser, "expected primary-expression");
4088 return error_mark_node;
4091 switch (token->keyword)
4093 /* These two are the boolean literals. */
4095 cp_lexer_consume_token (parser->lexer);
4096 return boolean_true_node;
4098 cp_lexer_consume_token (parser->lexer);
4099 return boolean_false_node;
4101 /* The `__null' literal. */
4103 cp_lexer_consume_token (parser->lexer);
4106 /* The `nullptr' literal. */
4108 cp_lexer_consume_token (parser->lexer);
4109 return nullptr_node;
4111 /* Recognize the `this' keyword. */
4113 cp_lexer_consume_token (parser->lexer);
4114 if (parser->local_variables_forbidden_p)
4116 error_at (token->location,
4117 "%<this%> may not be used in this context");
4118 return error_mark_node;
4120 /* Pointers cannot appear in constant-expressions. */
4121 if (cp_parser_non_integral_constant_expression (parser, NIC_THIS))
4122 return error_mark_node;
4123 return finish_this_expr ();
4125 /* The `operator' keyword can be the beginning of an
4130 case RID_FUNCTION_NAME:
4131 case RID_PRETTY_FUNCTION_NAME:
4132 case RID_C99_FUNCTION_NAME:
4134 non_integral_constant name;
4136 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4137 __func__ are the names of variables -- but they are
4138 treated specially. Therefore, they are handled here,
4139 rather than relying on the generic id-expression logic
4140 below. Grammatically, these names are id-expressions.
4142 Consume the token. */
4143 token = cp_lexer_consume_token (parser->lexer);
4145 switch (token->keyword)
4147 case RID_FUNCTION_NAME:
4148 name = NIC_FUNC_NAME;
4150 case RID_PRETTY_FUNCTION_NAME:
4151 name = NIC_PRETTY_FUNC;
4153 case RID_C99_FUNCTION_NAME:
4154 name = NIC_C99_FUNC;
4160 if (cp_parser_non_integral_constant_expression (parser, name))
4161 return error_mark_node;
4163 /* Look up the name. */
4164 return finish_fname (token->u.value);
4172 /* The `__builtin_va_arg' construct is used to handle
4173 `va_arg'. Consume the `__builtin_va_arg' token. */
4174 cp_lexer_consume_token (parser->lexer);
4175 /* Look for the opening `('. */
4176 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
4177 /* Now, parse the assignment-expression. */
4178 expression = cp_parser_assignment_expression (parser,
4179 /*cast_p=*/false, NULL);
4180 /* Look for the `,'. */
4181 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
4182 /* Parse the type-id. */
4183 type = cp_parser_type_id (parser);
4184 /* Look for the closing `)'. */
4185 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
4186 /* Using `va_arg' in a constant-expression is not
4188 if (cp_parser_non_integral_constant_expression (parser,
4190 return error_mark_node;
4191 return build_x_va_arg (expression, type);
4195 return cp_parser_builtin_offsetof (parser);
4197 case RID_HAS_NOTHROW_ASSIGN:
4198 case RID_HAS_NOTHROW_CONSTRUCTOR:
4199 case RID_HAS_NOTHROW_COPY:
4200 case RID_HAS_TRIVIAL_ASSIGN:
4201 case RID_HAS_TRIVIAL_CONSTRUCTOR:
4202 case RID_HAS_TRIVIAL_COPY:
4203 case RID_HAS_TRIVIAL_DESTRUCTOR:
4204 case RID_HAS_VIRTUAL_DESTRUCTOR:
4205 case RID_IS_ABSTRACT:
4206 case RID_IS_BASE_OF:
4208 case RID_IS_CONVERTIBLE_TO:
4212 case RID_IS_LITERAL_TYPE:
4214 case RID_IS_POLYMORPHIC:
4215 case RID_IS_STD_LAYOUT:
4216 case RID_IS_TRIVIAL:
4218 return cp_parser_trait_expr (parser, token->keyword);
4220 /* Objective-C++ expressions. */
4222 case RID_AT_PROTOCOL:
4223 case RID_AT_SELECTOR:
4224 return cp_parser_objc_expression (parser);
4227 if (parser->in_function_body
4228 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4231 error_at (token->location,
4232 "a template declaration cannot appear at block scope");
4233 cp_parser_skip_to_end_of_block_or_statement (parser);
4234 return error_mark_node;
4237 cp_parser_error (parser, "expected primary-expression");
4238 return error_mark_node;
4241 /* An id-expression can start with either an identifier, a
4242 `::' as the beginning of a qualified-id, or the "operator"
4246 case CPP_TEMPLATE_ID:
4247 case CPP_NESTED_NAME_SPECIFIER:
4251 const char *error_msg;
4254 cp_token *id_expr_token;
4257 /* Parse the id-expression. */
4259 = cp_parser_id_expression (parser,
4260 /*template_keyword_p=*/false,
4261 /*check_dependency_p=*/true,
4263 /*declarator_p=*/false,
4264 /*optional_p=*/false);
4265 if (id_expression == error_mark_node)
4266 return error_mark_node;
4267 id_expr_token = token;
4268 token = cp_lexer_peek_token (parser->lexer);
4269 done = (token->type != CPP_OPEN_SQUARE
4270 && token->type != CPP_OPEN_PAREN
4271 && token->type != CPP_DOT
4272 && token->type != CPP_DEREF
4273 && token->type != CPP_PLUS_PLUS
4274 && token->type != CPP_MINUS_MINUS);
4275 /* If we have a template-id, then no further lookup is
4276 required. If the template-id was for a template-class, we
4277 will sometimes have a TYPE_DECL at this point. */
4278 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
4279 || TREE_CODE (id_expression) == TYPE_DECL)
4280 decl = id_expression;
4281 /* Look up the name. */
4284 tree ambiguous_decls;
4286 /* If we already know that this lookup is ambiguous, then
4287 we've already issued an error message; there's no reason
4289 if (id_expr_token->type == CPP_NAME
4290 && id_expr_token->ambiguous_p)
4292 cp_parser_simulate_error (parser);
4293 return error_mark_node;
4296 decl = cp_parser_lookup_name (parser, id_expression,
4299 /*is_namespace=*/false,
4300 /*check_dependency=*/true,
4302 id_expr_token->location);
4303 /* If the lookup was ambiguous, an error will already have
4305 if (ambiguous_decls)
4306 return error_mark_node;
4308 /* In Objective-C++, we may have an Objective-C 2.0
4309 dot-syntax for classes here. */
4310 if (c_dialect_objc ()
4311 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT
4312 && TREE_CODE (decl) == TYPE_DECL
4313 && objc_is_class_name (decl))
4316 cp_lexer_consume_token (parser->lexer);
4317 component = cp_parser_identifier (parser);
4318 if (component == error_mark_node)
4319 return error_mark_node;
4321 return objc_build_class_component_ref (id_expression, component);
4324 /* In Objective-C++, an instance variable (ivar) may be preferred
4325 to whatever cp_parser_lookup_name() found. */
4326 decl = objc_lookup_ivar (decl, id_expression);
4328 /* If name lookup gives us a SCOPE_REF, then the
4329 qualifying scope was dependent. */
4330 if (TREE_CODE (decl) == SCOPE_REF)
4332 /* At this point, we do not know if DECL is a valid
4333 integral constant expression. We assume that it is
4334 in fact such an expression, so that code like:
4336 template <int N> struct A {
4340 is accepted. At template-instantiation time, we
4341 will check that B<N>::i is actually a constant. */
4344 /* Check to see if DECL is a local variable in a context
4345 where that is forbidden. */
4346 if (parser->local_variables_forbidden_p
4347 && local_variable_p (decl))
4349 /* It might be that we only found DECL because we are
4350 trying to be generous with pre-ISO scoping rules.
4351 For example, consider:
4355 for (int i = 0; i < 10; ++i) {}
4356 extern void f(int j = i);
4359 Here, name look up will originally find the out
4360 of scope `i'. We need to issue a warning message,
4361 but then use the global `i'. */
4362 decl = check_for_out_of_scope_variable (decl);
4363 if (local_variable_p (decl))
4365 error_at (id_expr_token->location,
4366 "local variable %qD may not appear in this context",
4368 return error_mark_node;
4373 decl = (finish_id_expression
4374 (id_expression, decl, parser->scope,
4376 parser->integral_constant_expression_p,
4377 parser->allow_non_integral_constant_expression_p,
4378 &parser->non_integral_constant_expression_p,
4379 template_p, done, address_p,
4382 id_expr_token->location));
4384 cp_parser_error (parser, error_msg);
4388 /* Anything else is an error. */
4390 cp_parser_error (parser, "expected primary-expression");
4391 return error_mark_node;
4395 /* Parse an id-expression.
4402 :: [opt] nested-name-specifier template [opt] unqualified-id
4404 :: operator-function-id
4407 Return a representation of the unqualified portion of the
4408 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4409 a `::' or nested-name-specifier.
4411 Often, if the id-expression was a qualified-id, the caller will
4412 want to make a SCOPE_REF to represent the qualified-id. This
4413 function does not do this in order to avoid wastefully creating
4414 SCOPE_REFs when they are not required.
4416 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4419 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4420 uninstantiated templates.
4422 If *TEMPLATE_P is non-NULL, it is set to true iff the
4423 `template' keyword is used to explicitly indicate that the entity
4424 named is a template.
4426 If DECLARATOR_P is true, the id-expression is appearing as part of
4427 a declarator, rather than as part of an expression. */
4430 cp_parser_id_expression (cp_parser *parser,
4431 bool template_keyword_p,
4432 bool check_dependency_p,
4437 bool global_scope_p;
4438 bool nested_name_specifier_p;
4440 /* Assume the `template' keyword was not used. */
4442 *template_p = template_keyword_p;
4444 /* Look for the optional `::' operator. */
4446 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
4448 /* Look for the optional nested-name-specifier. */
4449 nested_name_specifier_p
4450 = (cp_parser_nested_name_specifier_opt (parser,
4451 /*typename_keyword_p=*/false,
4456 /* If there is a nested-name-specifier, then we are looking at
4457 the first qualified-id production. */
4458 if (nested_name_specifier_p)
4461 tree saved_object_scope;
4462 tree saved_qualifying_scope;
4463 tree unqualified_id;
4466 /* See if the next token is the `template' keyword. */
4468 template_p = &is_template;
4469 *template_p = cp_parser_optional_template_keyword (parser);
4470 /* Name lookup we do during the processing of the
4471 unqualified-id might obliterate SCOPE. */
4472 saved_scope = parser->scope;
4473 saved_object_scope = parser->object_scope;
4474 saved_qualifying_scope = parser->qualifying_scope;
4475 /* Process the final unqualified-id. */
4476 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
4479 /*optional_p=*/false);
4480 /* Restore the SAVED_SCOPE for our caller. */
4481 parser->scope = saved_scope;
4482 parser->object_scope = saved_object_scope;
4483 parser->qualifying_scope = saved_qualifying_scope;
4485 return unqualified_id;
4487 /* Otherwise, if we are in global scope, then we are looking at one
4488 of the other qualified-id productions. */
4489 else if (global_scope_p)
4494 /* Peek at the next token. */
4495 token = cp_lexer_peek_token (parser->lexer);
4497 /* If it's an identifier, and the next token is not a "<", then
4498 we can avoid the template-id case. This is an optimization
4499 for this common case. */
4500 if (token->type == CPP_NAME
4501 && !cp_parser_nth_token_starts_template_argument_list_p
4503 return cp_parser_identifier (parser);
4505 cp_parser_parse_tentatively (parser);
4506 /* Try a template-id. */
4507 id = cp_parser_template_id (parser,
4508 /*template_keyword_p=*/false,
4509 /*check_dependency_p=*/true,
4511 /* If that worked, we're done. */
4512 if (cp_parser_parse_definitely (parser))
4515 /* Peek at the next token. (Changes in the token buffer may
4516 have invalidated the pointer obtained above.) */
4517 token = cp_lexer_peek_token (parser->lexer);
4519 switch (token->type)
4522 return cp_parser_identifier (parser);
4525 if (token->keyword == RID_OPERATOR)
4526 return cp_parser_operator_function_id (parser);
4530 cp_parser_error (parser, "expected id-expression");
4531 return error_mark_node;
4535 return cp_parser_unqualified_id (parser, template_keyword_p,
4536 /*check_dependency_p=*/true,
4541 /* Parse an unqualified-id.
4545 operator-function-id
4546 conversion-function-id
4550 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4551 keyword, in a construct like `A::template ...'.
4553 Returns a representation of unqualified-id. For the `identifier'
4554 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4555 production a BIT_NOT_EXPR is returned; the operand of the
4556 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4557 other productions, see the documentation accompanying the
4558 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4559 names are looked up in uninstantiated templates. If DECLARATOR_P
4560 is true, the unqualified-id is appearing as part of a declarator,
4561 rather than as part of an expression. */
4564 cp_parser_unqualified_id (cp_parser* parser,
4565 bool template_keyword_p,
4566 bool check_dependency_p,
4572 /* Peek at the next token. */
4573 token = cp_lexer_peek_token (parser->lexer);
4575 switch (token->type)
4581 /* We don't know yet whether or not this will be a
4583 cp_parser_parse_tentatively (parser);
4584 /* Try a template-id. */
4585 id = cp_parser_template_id (parser, template_keyword_p,
4588 /* If it worked, we're done. */
4589 if (cp_parser_parse_definitely (parser))
4591 /* Otherwise, it's an ordinary identifier. */
4592 return cp_parser_identifier (parser);
4595 case CPP_TEMPLATE_ID:
4596 return cp_parser_template_id (parser, template_keyword_p,
4603 tree qualifying_scope;
4608 /* Consume the `~' token. */
4609 cp_lexer_consume_token (parser->lexer);
4610 /* Parse the class-name. The standard, as written, seems to
4613 template <typename T> struct S { ~S (); };
4614 template <typename T> S<T>::~S() {}
4616 is invalid, since `~' must be followed by a class-name, but
4617 `S<T>' is dependent, and so not known to be a class.
4618 That's not right; we need to look in uninstantiated
4619 templates. A further complication arises from:
4621 template <typename T> void f(T t) {
4625 Here, it is not possible to look up `T' in the scope of `T'
4626 itself. We must look in both the current scope, and the
4627 scope of the containing complete expression.
4629 Yet another issue is:
4638 The standard does not seem to say that the `S' in `~S'
4639 should refer to the type `S' and not the data member
4642 /* DR 244 says that we look up the name after the "~" in the
4643 same scope as we looked up the qualifying name. That idea
4644 isn't fully worked out; it's more complicated than that. */
4645 scope = parser->scope;
4646 object_scope = parser->object_scope;
4647 qualifying_scope = parser->qualifying_scope;
4649 /* Check for invalid scopes. */
4650 if (scope == error_mark_node)
4652 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
4653 cp_lexer_consume_token (parser->lexer);
4654 return error_mark_node;
4656 if (scope && TREE_CODE (scope) == NAMESPACE_DECL)
4658 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
4659 error_at (token->location,
4660 "scope %qT before %<~%> is not a class-name",
4662 cp_parser_simulate_error (parser);
4663 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
4664 cp_lexer_consume_token (parser->lexer);
4665 return error_mark_node;
4667 gcc_assert (!scope || TYPE_P (scope));
4669 /* If the name is of the form "X::~X" it's OK even if X is a
4671 token = cp_lexer_peek_token (parser->lexer);
4673 && token->type == CPP_NAME
4674 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
4676 && (token->u.value == TYPE_IDENTIFIER (scope)
4677 || (CLASS_TYPE_P (scope)
4678 && constructor_name_p (token->u.value, scope))))
4680 cp_lexer_consume_token (parser->lexer);
4681 return build_nt (BIT_NOT_EXPR, scope);
4684 /* If there was an explicit qualification (S::~T), first look
4685 in the scope given by the qualification (i.e., S).
4687 Note: in the calls to cp_parser_class_name below we pass
4688 typename_type so that lookup finds the injected-class-name
4689 rather than the constructor. */
4691 type_decl = NULL_TREE;
4694 cp_parser_parse_tentatively (parser);
4695 type_decl = cp_parser_class_name (parser,
4696 /*typename_keyword_p=*/false,
4697 /*template_keyword_p=*/false,
4699 /*check_dependency=*/false,
4700 /*class_head_p=*/false,
4702 if (cp_parser_parse_definitely (parser))
4705 /* In "N::S::~S", look in "N" as well. */
4706 if (!done && scope && qualifying_scope)
4708 cp_parser_parse_tentatively (parser);
4709 parser->scope = qualifying_scope;
4710 parser->object_scope = NULL_TREE;
4711 parser->qualifying_scope = NULL_TREE;
4713 = cp_parser_class_name (parser,
4714 /*typename_keyword_p=*/false,
4715 /*template_keyword_p=*/false,
4717 /*check_dependency=*/false,
4718 /*class_head_p=*/false,
4720 if (cp_parser_parse_definitely (parser))
4723 /* In "p->S::~T", look in the scope given by "*p" as well. */
4724 else if (!done && object_scope)
4726 cp_parser_parse_tentatively (parser);
4727 parser->scope = object_scope;
4728 parser->object_scope = NULL_TREE;
4729 parser->qualifying_scope = NULL_TREE;
4731 = cp_parser_class_name (parser,
4732 /*typename_keyword_p=*/false,
4733 /*template_keyword_p=*/false,
4735 /*check_dependency=*/false,
4736 /*class_head_p=*/false,
4738 if (cp_parser_parse_definitely (parser))
4741 /* Look in the surrounding context. */
4744 parser->scope = NULL_TREE;
4745 parser->object_scope = NULL_TREE;
4746 parser->qualifying_scope = NULL_TREE;
4747 if (processing_template_decl)
4748 cp_parser_parse_tentatively (parser);
4750 = cp_parser_class_name (parser,
4751 /*typename_keyword_p=*/false,
4752 /*template_keyword_p=*/false,
4754 /*check_dependency=*/false,
4755 /*class_head_p=*/false,
4757 if (processing_template_decl
4758 && ! cp_parser_parse_definitely (parser))
4760 /* We couldn't find a type with this name, so just accept
4761 it and check for a match at instantiation time. */
4762 type_decl = cp_parser_identifier (parser);
4763 if (type_decl != error_mark_node)
4764 type_decl = build_nt (BIT_NOT_EXPR, type_decl);
4768 /* If an error occurred, assume that the name of the
4769 destructor is the same as the name of the qualifying
4770 class. That allows us to keep parsing after running
4771 into ill-formed destructor names. */
4772 if (type_decl == error_mark_node && scope)
4773 return build_nt (BIT_NOT_EXPR, scope);
4774 else if (type_decl == error_mark_node)
4775 return error_mark_node;
4777 /* Check that destructor name and scope match. */
4778 if (declarator_p && scope && !check_dtor_name (scope, type_decl))
4780 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
4781 error_at (token->location,
4782 "declaration of %<~%T%> as member of %qT",
4784 cp_parser_simulate_error (parser);
4785 return error_mark_node;
4790 A typedef-name that names a class shall not be used as the
4791 identifier in the declarator for a destructor declaration. */
4793 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
4794 && !DECL_SELF_REFERENCE_P (type_decl)
4795 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
4796 error_at (token->location,
4797 "typedef-name %qD used as destructor declarator",
4800 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
4804 if (token->keyword == RID_OPERATOR)
4808 /* This could be a template-id, so we try that first. */
4809 cp_parser_parse_tentatively (parser);
4810 /* Try a template-id. */
4811 id = cp_parser_template_id (parser, template_keyword_p,
4812 /*check_dependency_p=*/true,
4814 /* If that worked, we're done. */
4815 if (cp_parser_parse_definitely (parser))
4817 /* We still don't know whether we're looking at an
4818 operator-function-id or a conversion-function-id. */
4819 cp_parser_parse_tentatively (parser);
4820 /* Try an operator-function-id. */
4821 id = cp_parser_operator_function_id (parser);
4822 /* If that didn't work, try a conversion-function-id. */
4823 if (!cp_parser_parse_definitely (parser))
4824 id = cp_parser_conversion_function_id (parser);
4825 else if (UDLIT_OPER_P (id))
4828 const char *name = UDLIT_OP_SUFFIX (id);
4829 if (name[0] != '_' && !in_system_header)
4830 warning (0, "literal operator suffixes not preceded by %<_%>"
4831 " are reserved for future standardization");
4841 cp_parser_error (parser, "expected unqualified-id");
4842 return error_mark_node;
4846 /* Parse an (optional) nested-name-specifier.
4848 nested-name-specifier: [C++98]
4849 class-or-namespace-name :: nested-name-specifier [opt]
4850 class-or-namespace-name :: template nested-name-specifier [opt]
4852 nested-name-specifier: [C++0x]
4855 nested-name-specifier identifier ::
4856 nested-name-specifier template [opt] simple-template-id ::
4858 PARSER->SCOPE should be set appropriately before this function is
4859 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4860 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4863 Sets PARSER->SCOPE to the class (TYPE) or namespace
4864 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4865 it unchanged if there is no nested-name-specifier. Returns the new
4866 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4868 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4869 part of a declaration and/or decl-specifier. */
4872 cp_parser_nested_name_specifier_opt (cp_parser *parser,
4873 bool typename_keyword_p,
4874 bool check_dependency_p,
4876 bool is_declaration)
4878 bool success = false;
4879 cp_token_position start = 0;
4882 /* Remember where the nested-name-specifier starts. */
4883 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
4885 start = cp_lexer_token_position (parser->lexer, false);
4886 push_deferring_access_checks (dk_deferred);
4893 tree saved_qualifying_scope;
4894 bool template_keyword_p;
4896 /* Spot cases that cannot be the beginning of a
4897 nested-name-specifier. */
4898 token = cp_lexer_peek_token (parser->lexer);
4900 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4901 the already parsed nested-name-specifier. */
4902 if (token->type == CPP_NESTED_NAME_SPECIFIER)
4904 /* Grab the nested-name-specifier and continue the loop. */
4905 cp_parser_pre_parsed_nested_name_specifier (parser);
4906 /* If we originally encountered this nested-name-specifier
4907 with IS_DECLARATION set to false, we will not have
4908 resolved TYPENAME_TYPEs, so we must do so here. */
4910 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4912 new_scope = resolve_typename_type (parser->scope,
4913 /*only_current_p=*/false);
4914 if (TREE_CODE (new_scope) != TYPENAME_TYPE)
4915 parser->scope = new_scope;
4921 /* Spot cases that cannot be the beginning of a
4922 nested-name-specifier. On the second and subsequent times
4923 through the loop, we look for the `template' keyword. */
4924 if (success && token->keyword == RID_TEMPLATE)
4926 /* A template-id can start a nested-name-specifier. */
4927 else if (token->type == CPP_TEMPLATE_ID)
4929 /* DR 743: decltype can be used in a nested-name-specifier. */
4930 else if (token_is_decltype (token))
4934 /* If the next token is not an identifier, then it is
4935 definitely not a type-name or namespace-name. */
4936 if (token->type != CPP_NAME)
4938 /* If the following token is neither a `<' (to begin a
4939 template-id), nor a `::', then we are not looking at a
4940 nested-name-specifier. */
4941 token = cp_lexer_peek_nth_token (parser->lexer, 2);
4943 if (token->type == CPP_COLON
4944 && parser->colon_corrects_to_scope_p
4945 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_NAME)
4947 error_at (token->location,
4948 "found %<:%> in nested-name-specifier, expected %<::%>");
4949 token->type = CPP_SCOPE;
4952 if (token->type != CPP_SCOPE
4953 && !cp_parser_nth_token_starts_template_argument_list_p
4958 /* The nested-name-specifier is optional, so we parse
4960 cp_parser_parse_tentatively (parser);
4962 /* Look for the optional `template' keyword, if this isn't the
4963 first time through the loop. */
4965 template_keyword_p = cp_parser_optional_template_keyword (parser);
4967 template_keyword_p = false;
4969 /* Save the old scope since the name lookup we are about to do
4970 might destroy it. */
4971 old_scope = parser->scope;
4972 saved_qualifying_scope = parser->qualifying_scope;
4973 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4974 look up names in "X<T>::I" in order to determine that "Y" is
4975 a template. So, if we have a typename at this point, we make
4976 an effort to look through it. */
4978 && !typename_keyword_p
4980 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
4981 parser->scope = resolve_typename_type (parser->scope,
4982 /*only_current_p=*/false);
4983 /* Parse the qualifying entity. */
4985 = cp_parser_qualifying_entity (parser,
4991 /* Look for the `::' token. */
4992 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
4994 /* If we found what we wanted, we keep going; otherwise, we're
4996 if (!cp_parser_parse_definitely (parser))
4998 bool error_p = false;
5000 /* Restore the OLD_SCOPE since it was valid before the
5001 failed attempt at finding the last
5002 class-or-namespace-name. */
5003 parser->scope = old_scope;
5004 parser->qualifying_scope = saved_qualifying_scope;
5006 /* If the next token is a decltype, and the one after that is a
5007 `::', then the decltype has failed to resolve to a class or
5008 enumeration type. Give this error even when parsing
5009 tentatively since it can't possibly be valid--and we're going
5010 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5011 won't get another chance.*/
5012 if (cp_lexer_next_token_is (parser->lexer, CPP_DECLTYPE)
5013 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
5016 token = cp_lexer_consume_token (parser->lexer);
5017 error_at (token->location, "decltype evaluates to %qT, "
5018 "which is not a class or enumeration type",
5020 parser->scope = error_mark_node;
5024 cp_lexer_consume_token (parser->lexer);
5027 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
5029 /* If the next token is an identifier, and the one after
5030 that is a `::', then any valid interpretation would have
5031 found a class-or-namespace-name. */
5032 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
5033 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
5035 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
5038 token = cp_lexer_consume_token (parser->lexer);
5041 if (!token->ambiguous_p)
5044 tree ambiguous_decls;
5046 decl = cp_parser_lookup_name (parser, token->u.value,
5048 /*is_template=*/false,
5049 /*is_namespace=*/false,
5050 /*check_dependency=*/true,
5053 if (TREE_CODE (decl) == TEMPLATE_DECL)
5054 error_at (token->location,
5055 "%qD used without template parameters",
5057 else if (ambiguous_decls)
5059 error_at (token->location,
5060 "reference to %qD is ambiguous",
5062 print_candidates (ambiguous_decls);
5063 decl = error_mark_node;
5067 if (cxx_dialect != cxx98)
5068 cp_parser_name_lookup_error
5069 (parser, token->u.value, decl, NLE_NOT_CXX98,
5072 cp_parser_name_lookup_error
5073 (parser, token->u.value, decl, NLE_CXX98,
5077 parser->scope = error_mark_node;
5079 /* Treat this as a successful nested-name-specifier
5084 If the name found is not a class-name (clause
5085 _class_) or namespace-name (_namespace.def_), the
5086 program is ill-formed. */
5089 cp_lexer_consume_token (parser->lexer);
5093 /* We've found one valid nested-name-specifier. */
5095 /* Name lookup always gives us a DECL. */
5096 if (TREE_CODE (new_scope) == TYPE_DECL)
5097 new_scope = TREE_TYPE (new_scope);
5098 /* Uses of "template" must be followed by actual templates. */
5099 if (template_keyword_p
5100 && !(CLASS_TYPE_P (new_scope)
5101 && ((CLASSTYPE_USE_TEMPLATE (new_scope)
5102 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope)))
5103 || CLASSTYPE_IS_TEMPLATE (new_scope)))
5104 && !(TREE_CODE (new_scope) == TYPENAME_TYPE
5105 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope))
5106 == TEMPLATE_ID_EXPR)))
5107 permerror (input_location, TYPE_P (new_scope)
5108 ? G_("%qT is not a template")
5109 : G_("%qD is not a template"),
5111 /* If it is a class scope, try to complete it; we are about to
5112 be looking up names inside the class. */
5113 if (TYPE_P (new_scope)
5114 /* Since checking types for dependency can be expensive,
5115 avoid doing it if the type is already complete. */
5116 && !COMPLETE_TYPE_P (new_scope)
5117 /* Do not try to complete dependent types. */
5118 && !dependent_type_p (new_scope))
5120 new_scope = complete_type (new_scope);
5121 /* If it is a typedef to current class, use the current
5122 class instead, as the typedef won't have any names inside
5124 if (!COMPLETE_TYPE_P (new_scope)
5125 && currently_open_class (new_scope))
5126 new_scope = TYPE_MAIN_VARIANT (new_scope);
5128 /* Make sure we look in the right scope the next time through
5130 parser->scope = new_scope;
5133 /* If parsing tentatively, replace the sequence of tokens that makes
5134 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5135 token. That way, should we re-parse the token stream, we will
5136 not have to repeat the effort required to do the parse, nor will
5137 we issue duplicate error messages. */
5138 if (success && start)
5142 token = cp_lexer_token_at (parser->lexer, start);
5143 /* Reset the contents of the START token. */
5144 token->type = CPP_NESTED_NAME_SPECIFIER;
5145 /* Retrieve any deferred checks. Do not pop this access checks yet
5146 so the memory will not be reclaimed during token replacing below. */
5147 token->u.tree_check_value = ggc_alloc_cleared_tree_check ();
5148 token->u.tree_check_value->value = parser->scope;
5149 token->u.tree_check_value->checks = get_deferred_access_checks ();
5150 token->u.tree_check_value->qualifying_scope =
5151 parser->qualifying_scope;
5152 token->keyword = RID_MAX;
5154 /* Purge all subsequent tokens. */
5155 cp_lexer_purge_tokens_after (parser->lexer, start);
5159 pop_to_parent_deferring_access_checks ();
5161 return success ? parser->scope : NULL_TREE;
5164 /* Parse a nested-name-specifier. See
5165 cp_parser_nested_name_specifier_opt for details. This function
5166 behaves identically, except that it will an issue an error if no
5167 nested-name-specifier is present. */
5170 cp_parser_nested_name_specifier (cp_parser *parser,
5171 bool typename_keyword_p,
5172 bool check_dependency_p,
5174 bool is_declaration)
5178 /* Look for the nested-name-specifier. */
5179 scope = cp_parser_nested_name_specifier_opt (parser,
5184 /* If it was not present, issue an error message. */
5187 cp_parser_error (parser, "expected nested-name-specifier");
5188 parser->scope = NULL_TREE;
5194 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5195 this is either a class-name or a namespace-name (which corresponds
5196 to the class-or-namespace-name production in the grammar). For
5197 C++0x, it can also be a type-name that refers to an enumeration
5198 type or a simple-template-id.
5200 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5201 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5202 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5203 TYPE_P is TRUE iff the next name should be taken as a class-name,
5204 even the same name is declared to be another entity in the same
5207 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5208 specified by the class-or-namespace-name. If neither is found the
5209 ERROR_MARK_NODE is returned. */
5212 cp_parser_qualifying_entity (cp_parser *parser,
5213 bool typename_keyword_p,
5214 bool template_keyword_p,
5215 bool check_dependency_p,
5217 bool is_declaration)
5220 tree saved_qualifying_scope;
5221 tree saved_object_scope;
5224 bool successful_parse_p;
5226 /* DR 743: decltype can appear in a nested-name-specifier. */
5227 if (cp_lexer_next_token_is_decltype (parser->lexer))
5229 scope = cp_parser_decltype (parser);
5230 if (TREE_CODE (scope) != ENUMERAL_TYPE
5231 && !MAYBE_CLASS_TYPE_P (scope))
5233 cp_parser_simulate_error (parser);
5234 return error_mark_node;
5236 if (TYPE_NAME (scope))
5237 scope = TYPE_NAME (scope);
5241 /* Before we try to parse the class-name, we must save away the
5242 current PARSER->SCOPE since cp_parser_class_name will destroy
5244 saved_scope = parser->scope;
5245 saved_qualifying_scope = parser->qualifying_scope;
5246 saved_object_scope = parser->object_scope;
5247 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5248 there is no need to look for a namespace-name. */
5249 only_class_p = template_keyword_p
5250 || (saved_scope && TYPE_P (saved_scope) && cxx_dialect == cxx98);
5252 cp_parser_parse_tentatively (parser);
5253 scope = cp_parser_class_name (parser,
5256 type_p ? class_type : none_type,
5258 /*class_head_p=*/false,
5260 successful_parse_p = only_class_p || cp_parser_parse_definitely (parser);
5261 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5263 && cxx_dialect != cxx98
5264 && !successful_parse_p)
5266 /* Restore the saved scope. */
5267 parser->scope = saved_scope;
5268 parser->qualifying_scope = saved_qualifying_scope;
5269 parser->object_scope = saved_object_scope;
5271 /* Parse tentatively. */
5272 cp_parser_parse_tentatively (parser);
5274 /* Parse a type-name */
5275 scope = cp_parser_type_name (parser);
5277 /* "If the name found does not designate a namespace or a class,
5278 enumeration, or dependent type, the program is ill-formed."
5280 We cover classes and dependent types above and namespaces below,
5281 so this code is only looking for enums. */
5282 if (!scope || TREE_CODE (scope) != TYPE_DECL
5283 || TREE_CODE (TREE_TYPE (scope)) != ENUMERAL_TYPE)
5284 cp_parser_simulate_error (parser);
5286 successful_parse_p = cp_parser_parse_definitely (parser);
5288 /* If that didn't work, try for a namespace-name. */
5289 if (!only_class_p && !successful_parse_p)
5291 /* Restore the saved scope. */
5292 parser->scope = saved_scope;
5293 parser->qualifying_scope = saved_qualifying_scope;
5294 parser->object_scope = saved_object_scope;
5295 /* If we are not looking at an identifier followed by the scope
5296 resolution operator, then this is not part of a
5297 nested-name-specifier. (Note that this function is only used
5298 to parse the components of a nested-name-specifier.) */
5299 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
5300 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
5301 return error_mark_node;
5302 scope = cp_parser_namespace_name (parser);
5308 /* Parse a postfix-expression.
5312 postfix-expression [ expression ]
5313 postfix-expression ( expression-list [opt] )
5314 simple-type-specifier ( expression-list [opt] )
5315 typename :: [opt] nested-name-specifier identifier
5316 ( expression-list [opt] )
5317 typename :: [opt] nested-name-specifier template [opt] template-id
5318 ( expression-list [opt] )
5319 postfix-expression . template [opt] id-expression
5320 postfix-expression -> template [opt] id-expression
5321 postfix-expression . pseudo-destructor-name
5322 postfix-expression -> pseudo-destructor-name
5323 postfix-expression ++
5324 postfix-expression --
5325 dynamic_cast < type-id > ( expression )
5326 static_cast < type-id > ( expression )
5327 reinterpret_cast < type-id > ( expression )
5328 const_cast < type-id > ( expression )
5329 typeid ( expression )
5335 ( type-id ) { initializer-list , [opt] }
5337 This extension is a GNU version of the C99 compound-literal
5338 construct. (The C99 grammar uses `type-name' instead of `type-id',
5339 but they are essentially the same concept.)
5341 If ADDRESS_P is true, the postfix expression is the operand of the
5342 `&' operator. CAST_P is true if this expression is the target of a
5345 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5346 class member access expressions [expr.ref].
5348 Returns a representation of the expression. */
5351 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p,
5352 bool member_access_only_p,
5353 cp_id_kind * pidk_return)
5357 cp_id_kind idk = CP_ID_KIND_NONE;
5358 tree postfix_expression = NULL_TREE;
5359 bool is_member_access = false;
5361 /* Peek at the next token. */
5362 token = cp_lexer_peek_token (parser->lexer);
5363 /* Some of the productions are determined by keywords. */
5364 keyword = token->keyword;
5374 const char *saved_message;
5376 /* All of these can be handled in the same way from the point
5377 of view of parsing. Begin by consuming the token
5378 identifying the cast. */
5379 cp_lexer_consume_token (parser->lexer);
5381 /* New types cannot be defined in the cast. */
5382 saved_message = parser->type_definition_forbidden_message;
5383 parser->type_definition_forbidden_message
5384 = G_("types may not be defined in casts");
5386 /* Look for the opening `<'. */
5387 cp_parser_require (parser, CPP_LESS, RT_LESS);
5388 /* Parse the type to which we are casting. */
5389 type = cp_parser_type_id (parser);
5390 /* Look for the closing `>'. */
5391 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
5392 /* Restore the old message. */
5393 parser->type_definition_forbidden_message = saved_message;
5395 /* And the expression which is being cast. */
5396 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
5397 expression = cp_parser_expression (parser, /*cast_p=*/true, & idk);
5398 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5400 /* Only type conversions to integral or enumeration types
5401 can be used in constant-expressions. */
5402 if (!cast_valid_in_integral_constant_expression_p (type)
5403 && cp_parser_non_integral_constant_expression (parser, NIC_CAST))
5404 return error_mark_node;
5410 = build_dynamic_cast (type, expression, tf_warning_or_error);
5414 = build_static_cast (type, expression, tf_warning_or_error);
5418 = build_reinterpret_cast (type, expression,
5419 tf_warning_or_error);
5423 = build_const_cast (type, expression, tf_warning_or_error);
5434 const char *saved_message;
5435 bool saved_in_type_id_in_expr_p;
5437 /* Consume the `typeid' token. */
5438 cp_lexer_consume_token (parser->lexer);
5439 /* Look for the `(' token. */
5440 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
5441 /* Types cannot be defined in a `typeid' expression. */
5442 saved_message = parser->type_definition_forbidden_message;
5443 parser->type_definition_forbidden_message
5444 = G_("types may not be defined in a %<typeid%> expression");
5445 /* We can't be sure yet whether we're looking at a type-id or an
5447 cp_parser_parse_tentatively (parser);
5448 /* Try a type-id first. */
5449 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5450 parser->in_type_id_in_expr_p = true;
5451 type = cp_parser_type_id (parser);
5452 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5453 /* Look for the `)' token. Otherwise, we can't be sure that
5454 we're not looking at an expression: consider `typeid (int
5455 (3))', for example. */
5456 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5457 /* If all went well, simply lookup the type-id. */
5458 if (cp_parser_parse_definitely (parser))
5459 postfix_expression = get_typeid (type);
5460 /* Otherwise, fall back to the expression variant. */
5465 /* Look for an expression. */
5466 expression = cp_parser_expression (parser, /*cast_p=*/false, & idk);
5467 /* Compute its typeid. */
5468 postfix_expression = build_typeid (expression);
5469 /* Look for the `)' token. */
5470 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5472 /* Restore the saved message. */
5473 parser->type_definition_forbidden_message = saved_message;
5474 /* `typeid' may not appear in an integral constant expression. */
5475 if (cp_parser_non_integral_constant_expression (parser, NIC_TYPEID))
5476 return error_mark_node;
5483 /* The syntax permitted here is the same permitted for an
5484 elaborated-type-specifier. */
5485 type = cp_parser_elaborated_type_specifier (parser,
5486 /*is_friend=*/false,
5487 /*is_declaration=*/false);
5488 postfix_expression = cp_parser_functional_cast (parser, type);
5496 /* If the next thing is a simple-type-specifier, we may be
5497 looking at a functional cast. We could also be looking at
5498 an id-expression. So, we try the functional cast, and if
5499 that doesn't work we fall back to the primary-expression. */
5500 cp_parser_parse_tentatively (parser);
5501 /* Look for the simple-type-specifier. */
5502 type = cp_parser_simple_type_specifier (parser,
5503 /*decl_specs=*/NULL,
5504 CP_PARSER_FLAGS_NONE);
5505 /* Parse the cast itself. */
5506 if (!cp_parser_error_occurred (parser))
5508 = cp_parser_functional_cast (parser, type);
5509 /* If that worked, we're done. */
5510 if (cp_parser_parse_definitely (parser))
5513 /* If the functional-cast didn't work out, try a
5514 compound-literal. */
5515 if (cp_parser_allow_gnu_extensions_p (parser)
5516 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5518 VEC(constructor_elt,gc) *initializer_list = NULL;
5519 bool saved_in_type_id_in_expr_p;
5521 cp_parser_parse_tentatively (parser);
5522 /* Consume the `('. */
5523 cp_lexer_consume_token (parser->lexer);
5524 /* Parse the type. */
5525 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5526 parser->in_type_id_in_expr_p = true;
5527 type = cp_parser_type_id (parser);
5528 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5529 /* Look for the `)'. */
5530 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
5531 /* Look for the `{'. */
5532 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
5533 /* If things aren't going well, there's no need to
5535 if (!cp_parser_error_occurred (parser))
5537 bool non_constant_p;
5538 /* Parse the initializer-list. */
5540 = cp_parser_initializer_list (parser, &non_constant_p);
5541 /* Allow a trailing `,'. */
5542 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
5543 cp_lexer_consume_token (parser->lexer);
5544 /* Look for the final `}'. */
5545 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
5547 /* If that worked, we're definitely looking at a
5548 compound-literal expression. */
5549 if (cp_parser_parse_definitely (parser))
5551 /* Warn the user that a compound literal is not
5552 allowed in standard C++. */
5553 pedwarn (input_location, OPT_pedantic, "ISO C++ forbids compound-literals");
5554 /* For simplicity, we disallow compound literals in
5555 constant-expressions. We could
5556 allow compound literals of integer type, whose
5557 initializer was a constant, in constant
5558 expressions. Permitting that usage, as a further
5559 extension, would not change the meaning of any
5560 currently accepted programs. (Of course, as
5561 compound literals are not part of ISO C++, the
5562 standard has nothing to say.) */
5563 if (cp_parser_non_integral_constant_expression (parser,
5566 postfix_expression = error_mark_node;
5569 /* Form the representation of the compound-literal. */
5571 = (finish_compound_literal
5572 (type, build_constructor (init_list_type_node,
5574 tf_warning_or_error));
5579 /* It must be a primary-expression. */
5581 = cp_parser_primary_expression (parser, address_p, cast_p,
5582 /*template_arg_p=*/false,
5588 /* Keep looping until the postfix-expression is complete. */
5591 if (idk == CP_ID_KIND_UNQUALIFIED
5592 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
5593 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
5594 /* It is not a Koenig lookup function call. */
5596 = unqualified_name_lookup_error (postfix_expression);
5598 /* Peek at the next token. */
5599 token = cp_lexer_peek_token (parser->lexer);
5601 switch (token->type)
5603 case CPP_OPEN_SQUARE:
5605 = cp_parser_postfix_open_square_expression (parser,
5608 idk = CP_ID_KIND_NONE;
5609 is_member_access = false;
5612 case CPP_OPEN_PAREN:
5613 /* postfix-expression ( expression-list [opt] ) */
5616 bool is_builtin_constant_p;
5617 bool saved_integral_constant_expression_p = false;
5618 bool saved_non_integral_constant_expression_p = false;
5621 is_member_access = false;
5623 is_builtin_constant_p
5624 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
5625 if (is_builtin_constant_p)
5627 /* The whole point of __builtin_constant_p is to allow
5628 non-constant expressions to appear as arguments. */
5629 saved_integral_constant_expression_p
5630 = parser->integral_constant_expression_p;
5631 saved_non_integral_constant_expression_p
5632 = parser->non_integral_constant_expression_p;
5633 parser->integral_constant_expression_p = false;
5635 args = (cp_parser_parenthesized_expression_list
5637 /*cast_p=*/false, /*allow_expansion_p=*/true,
5638 /*non_constant_p=*/NULL));
5639 if (is_builtin_constant_p)
5641 parser->integral_constant_expression_p
5642 = saved_integral_constant_expression_p;
5643 parser->non_integral_constant_expression_p
5644 = saved_non_integral_constant_expression_p;
5649 postfix_expression = error_mark_node;
5653 /* Function calls are not permitted in
5654 constant-expressions. */
5655 if (! builtin_valid_in_constant_expr_p (postfix_expression)
5656 && cp_parser_non_integral_constant_expression (parser,
5659 postfix_expression = error_mark_node;
5660 release_tree_vector (args);
5665 if (idk == CP_ID_KIND_UNQUALIFIED
5666 || idk == CP_ID_KIND_TEMPLATE_ID)
5668 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
5670 if (!VEC_empty (tree, args))
5673 if (!any_type_dependent_arguments_p (args))
5675 = perform_koenig_lookup (postfix_expression, args,
5676 /*include_std=*/false,
5677 tf_warning_or_error);
5681 = unqualified_fn_lookup_error (postfix_expression);
5683 /* We do not perform argument-dependent lookup if
5684 normal lookup finds a non-function, in accordance
5685 with the expected resolution of DR 218. */
5686 else if (!VEC_empty (tree, args)
5687 && is_overloaded_fn (postfix_expression))
5689 tree fn = get_first_fn (postfix_expression);
5690 fn = STRIP_TEMPLATE (fn);
5692 /* Do not do argument dependent lookup if regular
5693 lookup finds a member function or a block-scope
5694 function declaration. [basic.lookup.argdep]/3 */
5695 if (!DECL_FUNCTION_MEMBER_P (fn)
5696 && !DECL_LOCAL_FUNCTION_P (fn))
5699 if (!any_type_dependent_arguments_p (args))
5701 = perform_koenig_lookup (postfix_expression, args,
5702 /*include_std=*/false,
5703 tf_warning_or_error);
5708 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
5710 tree instance = TREE_OPERAND (postfix_expression, 0);
5711 tree fn = TREE_OPERAND (postfix_expression, 1);
5713 if (processing_template_decl
5714 && (type_dependent_expression_p (instance)
5715 || (!BASELINK_P (fn)
5716 && TREE_CODE (fn) != FIELD_DECL)
5717 || type_dependent_expression_p (fn)
5718 || any_type_dependent_arguments_p (args)))
5721 = build_nt_call_vec (postfix_expression, args);
5722 release_tree_vector (args);
5726 if (BASELINK_P (fn))
5729 = (build_new_method_call
5730 (instance, fn, &args, NULL_TREE,
5731 (idk == CP_ID_KIND_QUALIFIED
5732 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
5735 tf_warning_or_error));
5739 = finish_call_expr (postfix_expression, &args,
5740 /*disallow_virtual=*/false,
5742 tf_warning_or_error);
5744 else if (TREE_CODE (postfix_expression) == OFFSET_REF
5745 || TREE_CODE (postfix_expression) == MEMBER_REF
5746 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
5747 postfix_expression = (build_offset_ref_call_from_tree
5748 (postfix_expression, &args));
5749 else if (idk == CP_ID_KIND_QUALIFIED)
5750 /* A call to a static class member, or a namespace-scope
5753 = finish_call_expr (postfix_expression, &args,
5754 /*disallow_virtual=*/true,
5756 tf_warning_or_error);
5758 /* All other function calls. */
5760 = finish_call_expr (postfix_expression, &args,
5761 /*disallow_virtual=*/false,
5763 tf_warning_or_error);
5765 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5766 idk = CP_ID_KIND_NONE;
5768 release_tree_vector (args);
5774 /* postfix-expression . template [opt] id-expression
5775 postfix-expression . pseudo-destructor-name
5776 postfix-expression -> template [opt] id-expression
5777 postfix-expression -> pseudo-destructor-name */
5779 /* Consume the `.' or `->' operator. */
5780 cp_lexer_consume_token (parser->lexer);
5783 = cp_parser_postfix_dot_deref_expression (parser, token->type,
5788 is_member_access = true;
5792 /* postfix-expression ++ */
5793 /* Consume the `++' token. */
5794 cp_lexer_consume_token (parser->lexer);
5795 /* Generate a representation for the complete expression. */
5797 = finish_increment_expr (postfix_expression,
5798 POSTINCREMENT_EXPR);
5799 /* Increments may not appear in constant-expressions. */
5800 if (cp_parser_non_integral_constant_expression (parser, NIC_INC))
5801 postfix_expression = error_mark_node;
5802 idk = CP_ID_KIND_NONE;
5803 is_member_access = false;
5806 case CPP_MINUS_MINUS:
5807 /* postfix-expression -- */
5808 /* Consume the `--' token. */
5809 cp_lexer_consume_token (parser->lexer);
5810 /* Generate a representation for the complete expression. */
5812 = finish_increment_expr (postfix_expression,
5813 POSTDECREMENT_EXPR);
5814 /* Decrements may not appear in constant-expressions. */
5815 if (cp_parser_non_integral_constant_expression (parser, NIC_DEC))
5816 postfix_expression = error_mark_node;
5817 idk = CP_ID_KIND_NONE;
5818 is_member_access = false;
5822 if (pidk_return != NULL)
5823 * pidk_return = idk;
5824 if (member_access_only_p)
5825 return is_member_access? postfix_expression : error_mark_node;
5827 return postfix_expression;
5831 /* We should never get here. */
5833 return error_mark_node;
5836 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5837 by cp_parser_builtin_offsetof. We're looking for
5839 postfix-expression [ expression ]
5840 postfix-expression [ braced-init-list ] (C++11)
5842 FOR_OFFSETOF is set if we're being called in that context, which
5843 changes how we deal with integer constant expressions. */
5846 cp_parser_postfix_open_square_expression (cp_parser *parser,
5847 tree postfix_expression,
5852 /* Consume the `[' token. */
5853 cp_lexer_consume_token (parser->lexer);
5855 /* Parse the index expression. */
5856 /* ??? For offsetof, there is a question of what to allow here. If
5857 offsetof is not being used in an integral constant expression context,
5858 then we *could* get the right answer by computing the value at runtime.
5859 If we are in an integral constant expression context, then we might
5860 could accept any constant expression; hard to say without analysis.
5861 Rather than open the barn door too wide right away, allow only integer
5862 constant expressions here. */
5864 index = cp_parser_constant_expression (parser, false, NULL);
5867 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
5869 bool expr_nonconst_p;
5870 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
5871 index = cp_parser_braced_list (parser, &expr_nonconst_p);
5874 index = cp_parser_expression (parser, /*cast_p=*/false, NULL);
5877 /* Look for the closing `]'. */
5878 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
5880 /* Build the ARRAY_REF. */
5881 postfix_expression = grok_array_decl (postfix_expression, index);
5883 /* When not doing offsetof, array references are not permitted in
5884 constant-expressions. */
5886 && (cp_parser_non_integral_constant_expression (parser, NIC_ARRAY_REF)))
5887 postfix_expression = error_mark_node;
5889 return postfix_expression;
5892 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5893 by cp_parser_builtin_offsetof. We're looking for
5895 postfix-expression . template [opt] id-expression
5896 postfix-expression . pseudo-destructor-name
5897 postfix-expression -> template [opt] id-expression
5898 postfix-expression -> pseudo-destructor-name
5900 FOR_OFFSETOF is set if we're being called in that context. That sorta
5901 limits what of the above we'll actually accept, but nevermind.
5902 TOKEN_TYPE is the "." or "->" token, which will already have been
5903 removed from the stream. */
5906 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
5907 enum cpp_ttype token_type,
5908 tree postfix_expression,
5909 bool for_offsetof, cp_id_kind *idk,
5910 location_t location)
5914 bool pseudo_destructor_p;
5915 tree scope = NULL_TREE;
5917 /* If this is a `->' operator, dereference the pointer. */
5918 if (token_type == CPP_DEREF)
5919 postfix_expression = build_x_arrow (postfix_expression);
5920 /* Check to see whether or not the expression is type-dependent. */
5921 dependent_p = type_dependent_expression_p (postfix_expression);
5922 /* The identifier following the `->' or `.' is not qualified. */
5923 parser->scope = NULL_TREE;
5924 parser->qualifying_scope = NULL_TREE;
5925 parser->object_scope = NULL_TREE;
5926 *idk = CP_ID_KIND_NONE;
5928 /* Enter the scope corresponding to the type of the object
5929 given by the POSTFIX_EXPRESSION. */
5930 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
5932 scope = TREE_TYPE (postfix_expression);
5933 /* According to the standard, no expression should ever have
5934 reference type. Unfortunately, we do not currently match
5935 the standard in this respect in that our internal representation
5936 of an expression may have reference type even when the standard
5937 says it does not. Therefore, we have to manually obtain the
5938 underlying type here. */
5939 scope = non_reference (scope);
5940 /* The type of the POSTFIX_EXPRESSION must be complete. */
5941 if (scope == unknown_type_node)
5943 error_at (location, "%qE does not have class type",
5944 postfix_expression);
5947 /* Unlike the object expression in other contexts, *this is not
5948 required to be of complete type for purposes of class member
5949 access (5.2.5) outside the member function body. */
5950 else if (scope != current_class_ref
5951 && !(processing_template_decl && scope == current_class_type))
5952 scope = complete_type_or_else (scope, NULL_TREE);
5953 /* Let the name lookup machinery know that we are processing a
5954 class member access expression. */
5955 parser->context->object_type = scope;
5956 /* If something went wrong, we want to be able to discern that case,
5957 as opposed to the case where there was no SCOPE due to the type
5958 of expression being dependent. */
5960 scope = error_mark_node;
5961 /* If the SCOPE was erroneous, make the various semantic analysis
5962 functions exit quickly -- and without issuing additional error
5964 if (scope == error_mark_node)
5965 postfix_expression = error_mark_node;
5968 /* Assume this expression is not a pseudo-destructor access. */
5969 pseudo_destructor_p = false;
5971 /* If the SCOPE is a scalar type, then, if this is a valid program,
5972 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5973 is type dependent, it can be pseudo-destructor-name or something else.
5974 Try to parse it as pseudo-destructor-name first. */
5975 if ((scope && SCALAR_TYPE_P (scope)) || dependent_p)
5980 cp_parser_parse_tentatively (parser);
5981 /* Parse the pseudo-destructor-name. */
5983 cp_parser_pseudo_destructor_name (parser, &s, &type);
5985 && (cp_parser_error_occurred (parser)
5986 || TREE_CODE (type) != TYPE_DECL
5987 || !SCALAR_TYPE_P (TREE_TYPE (type))))
5988 cp_parser_abort_tentative_parse (parser);
5989 else if (cp_parser_parse_definitely (parser))
5991 pseudo_destructor_p = true;
5993 = finish_pseudo_destructor_expr (postfix_expression,
5994 s, TREE_TYPE (type));
5998 if (!pseudo_destructor_p)
6000 /* If the SCOPE is not a scalar type, we are looking at an
6001 ordinary class member access expression, rather than a
6002 pseudo-destructor-name. */
6004 cp_token *token = cp_lexer_peek_token (parser->lexer);
6005 /* Parse the id-expression. */
6006 name = (cp_parser_id_expression
6008 cp_parser_optional_template_keyword (parser),
6009 /*check_dependency_p=*/true,
6011 /*declarator_p=*/false,
6012 /*optional_p=*/false));
6013 /* In general, build a SCOPE_REF if the member name is qualified.
6014 However, if the name was not dependent and has already been
6015 resolved; there is no need to build the SCOPE_REF. For example;
6017 struct X { void f(); };
6018 template <typename T> void f(T* t) { t->X::f(); }
6020 Even though "t" is dependent, "X::f" is not and has been resolved
6021 to a BASELINK; there is no need to include scope information. */
6023 /* But we do need to remember that there was an explicit scope for
6024 virtual function calls. */
6026 *idk = CP_ID_KIND_QUALIFIED;
6028 /* If the name is a template-id that names a type, we will get a
6029 TYPE_DECL here. That is invalid code. */
6030 if (TREE_CODE (name) == TYPE_DECL)
6032 error_at (token->location, "invalid use of %qD", name);
6033 postfix_expression = error_mark_node;
6037 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
6039 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
6041 error_at (token->location, "%<%D::%D%> is not a class member",
6042 parser->scope, name);
6043 postfix_expression = error_mark_node;
6046 name = build_qualified_name (/*type=*/NULL_TREE,
6050 parser->scope = NULL_TREE;
6051 parser->qualifying_scope = NULL_TREE;
6052 parser->object_scope = NULL_TREE;
6054 if (parser->scope && name && BASELINK_P (name))
6055 adjust_result_of_qualified_name_lookup
6056 (name, parser->scope, scope);
6058 = finish_class_member_access_expr (postfix_expression, name,
6060 tf_warning_or_error);
6064 /* We no longer need to look up names in the scope of the object on
6065 the left-hand side of the `.' or `->' operator. */
6066 parser->context->object_type = NULL_TREE;
6068 /* Outside of offsetof, these operators may not appear in
6069 constant-expressions. */
6071 && (cp_parser_non_integral_constant_expression
6072 (parser, token_type == CPP_DEREF ? NIC_ARROW : NIC_POINT)))
6073 postfix_expression = error_mark_node;
6075 return postfix_expression;
6078 /* Parse a parenthesized expression-list.
6081 assignment-expression
6082 expression-list, assignment-expression
6087 identifier, expression-list
6089 CAST_P is true if this expression is the target of a cast.
6091 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6094 Returns a vector of trees. Each element is a representation of an
6095 assignment-expression. NULL is returned if the ( and or ) are
6096 missing. An empty, but allocated, vector is returned on no
6097 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6098 if we are parsing an attribute list for an attribute that wants a
6099 plain identifier argument, normal_attr for an attribute that wants
6100 an expression, or non_attr if we aren't parsing an attribute list. If
6101 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6102 not all of the expressions in the list were constant. */
6104 static VEC(tree,gc) *
6105 cp_parser_parenthesized_expression_list (cp_parser* parser,
6106 int is_attribute_list,
6108 bool allow_expansion_p,
6109 bool *non_constant_p)
6111 VEC(tree,gc) *expression_list;
6112 bool fold_expr_p = is_attribute_list != non_attr;
6113 tree identifier = NULL_TREE;
6114 bool saved_greater_than_is_operator_p;
6116 /* Assume all the expressions will be constant. */
6118 *non_constant_p = false;
6120 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
6123 expression_list = make_tree_vector ();
6125 /* Within a parenthesized expression, a `>' token is always
6126 the greater-than operator. */
6127 saved_greater_than_is_operator_p
6128 = parser->greater_than_is_operator_p;
6129 parser->greater_than_is_operator_p = true;
6131 /* Consume expressions until there are no more. */
6132 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6137 /* At the beginning of attribute lists, check to see if the
6138 next token is an identifier. */
6139 if (is_attribute_list == id_attr
6140 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
6144 /* Consume the identifier. */
6145 token = cp_lexer_consume_token (parser->lexer);
6146 /* Save the identifier. */
6147 identifier = token->u.value;
6151 bool expr_non_constant_p;
6153 /* Parse the next assignment-expression. */
6154 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6156 /* A braced-init-list. */
6157 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
6158 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
6159 if (non_constant_p && expr_non_constant_p)
6160 *non_constant_p = true;
6162 else if (non_constant_p)
6164 expr = (cp_parser_constant_expression
6165 (parser, /*allow_non_constant_p=*/true,
6166 &expr_non_constant_p));
6167 if (expr_non_constant_p)
6168 *non_constant_p = true;
6171 expr = cp_parser_assignment_expression (parser, cast_p, NULL);
6174 expr = fold_non_dependent_expr (expr);
6176 /* If we have an ellipsis, then this is an expression
6178 if (allow_expansion_p
6179 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
6181 /* Consume the `...'. */
6182 cp_lexer_consume_token (parser->lexer);
6184 /* Build the argument pack. */
6185 expr = make_pack_expansion (expr);
6188 /* Add it to the list. We add error_mark_node
6189 expressions to the list, so that we can still tell if
6190 the correct form for a parenthesized expression-list
6191 is found. That gives better errors. */
6192 VEC_safe_push (tree, gc, expression_list, expr);
6194 if (expr == error_mark_node)
6198 /* After the first item, attribute lists look the same as
6199 expression lists. */
6200 is_attribute_list = non_attr;
6203 /* If the next token isn't a `,', then we are done. */
6204 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
6207 /* Otherwise, consume the `,' and keep going. */
6208 cp_lexer_consume_token (parser->lexer);
6211 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
6216 /* We try and resync to an unnested comma, as that will give the
6217 user better diagnostics. */
6218 ending = cp_parser_skip_to_closing_parenthesis (parser,
6219 /*recovering=*/true,
6221 /*consume_paren=*/true);
6226 parser->greater_than_is_operator_p
6227 = saved_greater_than_is_operator_p;
6232 parser->greater_than_is_operator_p
6233 = saved_greater_than_is_operator_p;
6236 VEC_safe_insert (tree, gc, expression_list, 0, identifier);
6238 return expression_list;
6241 /* Parse a pseudo-destructor-name.
6243 pseudo-destructor-name:
6244 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6245 :: [opt] nested-name-specifier template template-id :: ~ type-name
6246 :: [opt] nested-name-specifier [opt] ~ type-name
6248 If either of the first two productions is used, sets *SCOPE to the
6249 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6250 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6251 or ERROR_MARK_NODE if the parse fails. */
6254 cp_parser_pseudo_destructor_name (cp_parser* parser,
6258 bool nested_name_specifier_p;
6260 /* Assume that things will not work out. */
6261 *type = error_mark_node;
6263 /* Look for the optional `::' operator. */
6264 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
6265 /* Look for the optional nested-name-specifier. */
6266 nested_name_specifier_p
6267 = (cp_parser_nested_name_specifier_opt (parser,
6268 /*typename_keyword_p=*/false,
6269 /*check_dependency_p=*/true,
6271 /*is_declaration=*/false)
6273 /* Now, if we saw a nested-name-specifier, we might be doing the
6274 second production. */
6275 if (nested_name_specifier_p
6276 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
6278 /* Consume the `template' keyword. */
6279 cp_lexer_consume_token (parser->lexer);
6280 /* Parse the template-id. */
6281 cp_parser_template_id (parser,
6282 /*template_keyword_p=*/true,
6283 /*check_dependency_p=*/false,
6284 /*is_declaration=*/true);
6285 /* Look for the `::' token. */
6286 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
6288 /* If the next token is not a `~', then there might be some
6289 additional qualification. */
6290 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
6292 /* At this point, we're looking for "type-name :: ~". The type-name
6293 must not be a class-name, since this is a pseudo-destructor. So,
6294 it must be either an enum-name, or a typedef-name -- both of which
6295 are just identifiers. So, we peek ahead to check that the "::"
6296 and "~" tokens are present; if they are not, then we can avoid
6297 calling type_name. */
6298 if (cp_lexer_peek_token (parser->lexer)->type != CPP_NAME
6299 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE
6300 || cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_COMPL)
6302 cp_parser_error (parser, "non-scalar type");
6306 /* Look for the type-name. */
6307 *scope = TREE_TYPE (cp_parser_nonclass_name (parser));
6308 if (*scope == error_mark_node)
6311 /* Look for the `::' token. */
6312 cp_parser_require (parser, CPP_SCOPE, RT_SCOPE);
6317 /* Look for the `~'. */
6318 cp_parser_require (parser, CPP_COMPL, RT_COMPL);
6320 /* Once we see the ~, this has to be a pseudo-destructor. */
6321 if (!processing_template_decl && !cp_parser_error_occurred (parser))
6322 cp_parser_commit_to_tentative_parse (parser);
6324 /* Look for the type-name again. We are not responsible for
6325 checking that it matches the first type-name. */
6326 *type = cp_parser_nonclass_name (parser);
6329 /* Parse a unary-expression.
6335 unary-operator cast-expression
6336 sizeof unary-expression
6338 alignof ( type-id ) [C++0x]
6345 __extension__ cast-expression
6346 __alignof__ unary-expression
6347 __alignof__ ( type-id )
6348 alignof unary-expression [C++0x]
6349 __real__ cast-expression
6350 __imag__ cast-expression
6353 ADDRESS_P is true iff the unary-expression is appearing as the
6354 operand of the `&' operator. CAST_P is true if this expression is
6355 the target of a cast.
6357 Returns a representation of the expression. */
6360 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p,
6364 enum tree_code unary_operator;
6366 /* Peek at the next token. */
6367 token = cp_lexer_peek_token (parser->lexer);
6368 /* Some keywords give away the kind of expression. */
6369 if (token->type == CPP_KEYWORD)
6371 enum rid keyword = token->keyword;
6381 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
6382 /* Consume the token. */
6383 cp_lexer_consume_token (parser->lexer);
6384 /* Parse the operand. */
6385 operand = cp_parser_sizeof_operand (parser, keyword);
6387 if (TYPE_P (operand))
6388 return cxx_sizeof_or_alignof_type (operand, op, true);
6391 /* ISO C++ defines alignof only with types, not with
6392 expressions. So pedwarn if alignof is used with a non-
6393 type expression. However, __alignof__ is ok. */
6394 if (!strcmp (IDENTIFIER_POINTER (token->u.value), "alignof"))
6395 pedwarn (token->location, OPT_pedantic,
6396 "ISO C++ does not allow %<alignof%> "
6399 return cxx_sizeof_or_alignof_expr (operand, op, true);
6404 return cp_parser_new_expression (parser);
6407 return cp_parser_delete_expression (parser);
6411 /* The saved value of the PEDANTIC flag. */
6415 /* Save away the PEDANTIC flag. */
6416 cp_parser_extension_opt (parser, &saved_pedantic);
6417 /* Parse the cast-expression. */
6418 expr = cp_parser_simple_cast_expression (parser);
6419 /* Restore the PEDANTIC flag. */
6420 pedantic = saved_pedantic;
6430 /* Consume the `__real__' or `__imag__' token. */
6431 cp_lexer_consume_token (parser->lexer);
6432 /* Parse the cast-expression. */
6433 expression = cp_parser_simple_cast_expression (parser);
6434 /* Create the complete representation. */
6435 return build_x_unary_op ((keyword == RID_REALPART
6436 ? REALPART_EXPR : IMAGPART_EXPR),
6438 tf_warning_or_error);
6442 case RID_TRANSACTION_ATOMIC:
6443 case RID_TRANSACTION_RELAXED:
6444 return cp_parser_transaction_expression (parser, keyword);
6449 const char *saved_message;
6450 bool saved_integral_constant_expression_p;
6451 bool saved_non_integral_constant_expression_p;
6452 bool saved_greater_than_is_operator_p;
6454 cp_lexer_consume_token (parser->lexer);
6455 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
6457 saved_message = parser->type_definition_forbidden_message;
6458 parser->type_definition_forbidden_message
6459 = G_("types may not be defined in %<noexcept%> expressions");
6461 saved_integral_constant_expression_p
6462 = parser->integral_constant_expression_p;
6463 saved_non_integral_constant_expression_p
6464 = parser->non_integral_constant_expression_p;
6465 parser->integral_constant_expression_p = false;
6467 saved_greater_than_is_operator_p
6468 = parser->greater_than_is_operator_p;
6469 parser->greater_than_is_operator_p = true;
6471 ++cp_unevaluated_operand;
6472 ++c_inhibit_evaluation_warnings;
6473 expr = cp_parser_expression (parser, false, NULL);
6474 --c_inhibit_evaluation_warnings;
6475 --cp_unevaluated_operand;
6477 parser->greater_than_is_operator_p
6478 = saved_greater_than_is_operator_p;
6480 parser->integral_constant_expression_p
6481 = saved_integral_constant_expression_p;
6482 parser->non_integral_constant_expression_p
6483 = saved_non_integral_constant_expression_p;
6485 parser->type_definition_forbidden_message = saved_message;
6487 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
6488 return finish_noexcept_expr (expr, tf_warning_or_error);
6496 /* Look for the `:: new' and `:: delete', which also signal the
6497 beginning of a new-expression, or delete-expression,
6498 respectively. If the next token is `::', then it might be one of
6500 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
6504 /* See if the token after the `::' is one of the keywords in
6505 which we're interested. */
6506 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
6507 /* If it's `new', we have a new-expression. */
6508 if (keyword == RID_NEW)
6509 return cp_parser_new_expression (parser);
6510 /* Similarly, for `delete'. */
6511 else if (keyword == RID_DELETE)
6512 return cp_parser_delete_expression (parser);
6515 /* Look for a unary operator. */
6516 unary_operator = cp_parser_unary_operator (token);
6517 /* The `++' and `--' operators can be handled similarly, even though
6518 they are not technically unary-operators in the grammar. */
6519 if (unary_operator == ERROR_MARK)
6521 if (token->type == CPP_PLUS_PLUS)
6522 unary_operator = PREINCREMENT_EXPR;
6523 else if (token->type == CPP_MINUS_MINUS)
6524 unary_operator = PREDECREMENT_EXPR;
6525 /* Handle the GNU address-of-label extension. */
6526 else if (cp_parser_allow_gnu_extensions_p (parser)
6527 && token->type == CPP_AND_AND)
6531 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
6533 /* Consume the '&&' token. */
6534 cp_lexer_consume_token (parser->lexer);
6535 /* Look for the identifier. */
6536 identifier = cp_parser_identifier (parser);
6537 /* Create an expression representing the address. */
6538 expression = finish_label_address_expr (identifier, loc);
6539 if (cp_parser_non_integral_constant_expression (parser,
6541 expression = error_mark_node;
6545 if (unary_operator != ERROR_MARK)
6547 tree cast_expression;
6548 tree expression = error_mark_node;
6549 non_integral_constant non_constant_p = NIC_NONE;
6551 /* Consume the operator token. */
6552 token = cp_lexer_consume_token (parser->lexer);
6553 /* Parse the cast-expression. */
6555 = cp_parser_cast_expression (parser,
6556 unary_operator == ADDR_EXPR,
6557 /*cast_p=*/false, pidk);
6558 /* Now, build an appropriate representation. */
6559 switch (unary_operator)
6562 non_constant_p = NIC_STAR;
6563 expression = build_x_indirect_ref (cast_expression, RO_UNARY_STAR,
6564 tf_warning_or_error);
6568 non_constant_p = NIC_ADDR;
6571 expression = build_x_unary_op (unary_operator, cast_expression,
6572 tf_warning_or_error);
6575 case PREINCREMENT_EXPR:
6576 case PREDECREMENT_EXPR:
6577 non_constant_p = unary_operator == PREINCREMENT_EXPR
6578 ? NIC_PREINCREMENT : NIC_PREDECREMENT;
6580 case UNARY_PLUS_EXPR:
6582 case TRUTH_NOT_EXPR:
6583 expression = finish_unary_op_expr (unary_operator, cast_expression);
6590 if (non_constant_p != NIC_NONE
6591 && cp_parser_non_integral_constant_expression (parser,
6593 expression = error_mark_node;
6598 return cp_parser_postfix_expression (parser, address_p, cast_p,
6599 /*member_access_only_p=*/false,
6603 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6604 unary-operator, the corresponding tree code is returned. */
6606 static enum tree_code
6607 cp_parser_unary_operator (cp_token* token)
6609 switch (token->type)
6612 return INDIRECT_REF;
6618 return UNARY_PLUS_EXPR;
6624 return TRUTH_NOT_EXPR;
6627 return BIT_NOT_EXPR;
6634 /* Parse a new-expression.
6637 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6638 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6640 Returns a representation of the expression. */
6643 cp_parser_new_expression (cp_parser* parser)
6645 bool global_scope_p;
6646 VEC(tree,gc) *placement;
6648 VEC(tree,gc) *initializer;
6652 /* Look for the optional `::' operator. */
6654 = (cp_parser_global_scope_opt (parser,
6655 /*current_scope_valid_p=*/false)
6657 /* Look for the `new' operator. */
6658 cp_parser_require_keyword (parser, RID_NEW, RT_NEW);
6659 /* There's no easy way to tell a new-placement from the
6660 `( type-id )' construct. */
6661 cp_parser_parse_tentatively (parser);
6662 /* Look for a new-placement. */
6663 placement = cp_parser_new_placement (parser);
6664 /* If that didn't work out, there's no new-placement. */
6665 if (!cp_parser_parse_definitely (parser))
6667 if (placement != NULL)
6668 release_tree_vector (placement);
6672 /* If the next token is a `(', then we have a parenthesized
6674 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
6677 const char *saved_message = parser->type_definition_forbidden_message;
6679 /* Consume the `('. */
6680 cp_lexer_consume_token (parser->lexer);
6682 /* Parse the type-id. */
6683 parser->type_definition_forbidden_message
6684 = G_("types may not be defined in a new-expression");
6685 type = cp_parser_type_id (parser);
6686 parser->type_definition_forbidden_message = saved_message;
6688 /* Look for the closing `)'. */
6689 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
6690 token = cp_lexer_peek_token (parser->lexer);
6691 /* There should not be a direct-new-declarator in this production,
6692 but GCC used to allowed this, so we check and emit a sensible error
6693 message for this case. */
6694 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6696 error_at (token->location,
6697 "array bound forbidden after parenthesized type-id");
6698 inform (token->location,
6699 "try removing the parentheses around the type-id");
6700 cp_parser_direct_new_declarator (parser);
6704 /* Otherwise, there must be a new-type-id. */
6706 type = cp_parser_new_type_id (parser, &nelts);
6708 /* If the next token is a `(' or '{', then we have a new-initializer. */
6709 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN)
6710 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6711 initializer = cp_parser_new_initializer (parser);
6715 /* A new-expression may not appear in an integral constant
6717 if (cp_parser_non_integral_constant_expression (parser, NIC_NEW))
6718 ret = error_mark_node;
6721 /* Create a representation of the new-expression. */
6722 ret = build_new (&placement, type, nelts, &initializer, global_scope_p,
6723 tf_warning_or_error);
6726 if (placement != NULL)
6727 release_tree_vector (placement);
6728 if (initializer != NULL)
6729 release_tree_vector (initializer);
6734 /* Parse a new-placement.
6739 Returns the same representation as for an expression-list. */
6741 static VEC(tree,gc) *
6742 cp_parser_new_placement (cp_parser* parser)
6744 VEC(tree,gc) *expression_list;
6746 /* Parse the expression-list. */
6747 expression_list = (cp_parser_parenthesized_expression_list
6748 (parser, non_attr, /*cast_p=*/false,
6749 /*allow_expansion_p=*/true,
6750 /*non_constant_p=*/NULL));
6752 return expression_list;
6755 /* Parse a new-type-id.
6758 type-specifier-seq new-declarator [opt]
6760 Returns the TYPE allocated. If the new-type-id indicates an array
6761 type, *NELTS is set to the number of elements in the last array
6762 bound; the TYPE will not include the last array bound. */
6765 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
6767 cp_decl_specifier_seq type_specifier_seq;
6768 cp_declarator *new_declarator;
6769 cp_declarator *declarator;
6770 cp_declarator *outer_declarator;
6771 const char *saved_message;
6774 /* The type-specifier sequence must not contain type definitions.
6775 (It cannot contain declarations of new types either, but if they
6776 are not definitions we will catch that because they are not
6778 saved_message = parser->type_definition_forbidden_message;
6779 parser->type_definition_forbidden_message
6780 = G_("types may not be defined in a new-type-id");
6781 /* Parse the type-specifier-seq. */
6782 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
6783 /*is_trailing_return=*/false,
6784 &type_specifier_seq);
6785 /* Restore the old message. */
6786 parser->type_definition_forbidden_message = saved_message;
6787 /* Parse the new-declarator. */
6788 new_declarator = cp_parser_new_declarator_opt (parser);
6790 /* Determine the number of elements in the last array dimension, if
6793 /* Skip down to the last array dimension. */
6794 declarator = new_declarator;
6795 outer_declarator = NULL;
6796 while (declarator && (declarator->kind == cdk_pointer
6797 || declarator->kind == cdk_ptrmem))
6799 outer_declarator = declarator;
6800 declarator = declarator->declarator;
6803 && declarator->kind == cdk_array
6804 && declarator->declarator
6805 && declarator->declarator->kind == cdk_array)
6807 outer_declarator = declarator;
6808 declarator = declarator->declarator;
6811 if (declarator && declarator->kind == cdk_array)
6813 *nelts = declarator->u.array.bounds;
6814 if (*nelts == error_mark_node)
6815 *nelts = integer_one_node;
6817 if (outer_declarator)
6818 outer_declarator->declarator = declarator->declarator;
6820 new_declarator = NULL;
6823 type = groktypename (&type_specifier_seq, new_declarator, false);
6827 /* Parse an (optional) new-declarator.
6830 ptr-operator new-declarator [opt]
6831 direct-new-declarator
6833 Returns the declarator. */
6835 static cp_declarator *
6836 cp_parser_new_declarator_opt (cp_parser* parser)
6838 enum tree_code code;
6840 cp_cv_quals cv_quals;
6842 /* We don't know if there's a ptr-operator next, or not. */
6843 cp_parser_parse_tentatively (parser);
6844 /* Look for a ptr-operator. */
6845 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
6846 /* If that worked, look for more new-declarators. */
6847 if (cp_parser_parse_definitely (parser))
6849 cp_declarator *declarator;
6851 /* Parse another optional declarator. */
6852 declarator = cp_parser_new_declarator_opt (parser);
6854 return cp_parser_make_indirect_declarator
6855 (code, type, cv_quals, declarator);
6858 /* If the next token is a `[', there is a direct-new-declarator. */
6859 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6860 return cp_parser_direct_new_declarator (parser);
6865 /* Parse a direct-new-declarator.
6867 direct-new-declarator:
6869 direct-new-declarator [constant-expression]
6873 static cp_declarator *
6874 cp_parser_direct_new_declarator (cp_parser* parser)
6876 cp_declarator *declarator = NULL;
6882 /* Look for the opening `['. */
6883 cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE);
6884 /* The first expression is not required to be constant. */
6887 cp_token *token = cp_lexer_peek_token (parser->lexer);
6888 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
6889 /* The standard requires that the expression have integral
6890 type. DR 74 adds enumeration types. We believe that the
6891 real intent is that these expressions be handled like the
6892 expression in a `switch' condition, which also allows
6893 classes with a single conversion to integral or
6894 enumeration type. */
6895 if (!processing_template_decl)
6898 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
6903 error_at (token->location,
6904 "expression in new-declarator must have integral "
6905 "or enumeration type");
6906 expression = error_mark_node;
6910 /* But all the other expressions must be. */
6913 = cp_parser_constant_expression (parser,
6914 /*allow_non_constant=*/false,
6916 /* Look for the closing `]'. */
6917 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
6919 /* Add this bound to the declarator. */
6920 declarator = make_array_declarator (declarator, expression);
6922 /* If the next token is not a `[', then there are no more
6924 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
6931 /* Parse a new-initializer.
6934 ( expression-list [opt] )
6937 Returns a representation of the expression-list. */
6939 static VEC(tree,gc) *
6940 cp_parser_new_initializer (cp_parser* parser)
6942 VEC(tree,gc) *expression_list;
6944 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
6947 bool expr_non_constant_p;
6948 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
6949 t = cp_parser_braced_list (parser, &expr_non_constant_p);
6950 CONSTRUCTOR_IS_DIRECT_INIT (t) = 1;
6951 expression_list = make_tree_vector_single (t);
6954 expression_list = (cp_parser_parenthesized_expression_list
6955 (parser, non_attr, /*cast_p=*/false,
6956 /*allow_expansion_p=*/true,
6957 /*non_constant_p=*/NULL));
6959 return expression_list;
6962 /* Parse a delete-expression.
6965 :: [opt] delete cast-expression
6966 :: [opt] delete [ ] cast-expression
6968 Returns a representation of the expression. */
6971 cp_parser_delete_expression (cp_parser* parser)
6973 bool global_scope_p;
6977 /* Look for the optional `::' operator. */
6979 = (cp_parser_global_scope_opt (parser,
6980 /*current_scope_valid_p=*/false)
6982 /* Look for the `delete' keyword. */
6983 cp_parser_require_keyword (parser, RID_DELETE, RT_DELETE);
6984 /* See if the array syntax is in use. */
6985 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
6987 /* Consume the `[' token. */
6988 cp_lexer_consume_token (parser->lexer);
6989 /* Look for the `]' token. */
6990 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
6991 /* Remember that this is the `[]' construct. */
6997 /* Parse the cast-expression. */
6998 expression = cp_parser_simple_cast_expression (parser);
7000 /* A delete-expression may not appear in an integral constant
7002 if (cp_parser_non_integral_constant_expression (parser, NIC_DEL))
7003 return error_mark_node;
7005 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p,
7006 tf_warning_or_error);
7009 /* Returns true if TOKEN may start a cast-expression and false
7013 cp_parser_token_starts_cast_expression (cp_token *token)
7015 switch (token->type)
7021 case CPP_CLOSE_SQUARE:
7022 case CPP_CLOSE_PAREN:
7023 case CPP_CLOSE_BRACE:
7027 case CPP_DEREF_STAR:
7035 case CPP_GREATER_EQ:
7055 /* '[' may start a primary-expression in obj-c++. */
7056 case CPP_OPEN_SQUARE:
7057 return c_dialect_objc ();
7064 /* Parse a cast-expression.
7068 ( type-id ) cast-expression
7070 ADDRESS_P is true iff the unary-expression is appearing as the
7071 operand of the `&' operator. CAST_P is true if this expression is
7072 the target of a cast.
7074 Returns a representation of the expression. */
7077 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p,
7080 /* If it's a `(', then we might be looking at a cast. */
7081 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7083 tree type = NULL_TREE;
7084 tree expr = NULL_TREE;
7085 bool compound_literal_p;
7086 const char *saved_message;
7088 /* There's no way to know yet whether or not this is a cast.
7089 For example, `(int (3))' is a unary-expression, while `(int)
7090 3' is a cast. So, we resort to parsing tentatively. */
7091 cp_parser_parse_tentatively (parser);
7092 /* Types may not be defined in a cast. */
7093 saved_message = parser->type_definition_forbidden_message;
7094 parser->type_definition_forbidden_message
7095 = G_("types may not be defined in casts");
7096 /* Consume the `('. */
7097 cp_lexer_consume_token (parser->lexer);
7098 /* A very tricky bit is that `(struct S) { 3 }' is a
7099 compound-literal (which we permit in C++ as an extension).
7100 But, that construct is not a cast-expression -- it is a
7101 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7102 is legal; if the compound-literal were a cast-expression,
7103 you'd need an extra set of parentheses.) But, if we parse
7104 the type-id, and it happens to be a class-specifier, then we
7105 will commit to the parse at that point, because we cannot
7106 undo the action that is done when creating a new class. So,
7107 then we cannot back up and do a postfix-expression.
7109 Therefore, we scan ahead to the closing `)', and check to see
7110 if the token after the `)' is a `{'. If so, we are not
7111 looking at a cast-expression.
7113 Save tokens so that we can put them back. */
7114 cp_lexer_save_tokens (parser->lexer);
7115 /* Skip tokens until the next token is a closing parenthesis.
7116 If we find the closing `)', and the next token is a `{', then
7117 we are looking at a compound-literal. */
7119 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
7120 /*consume_paren=*/true)
7121 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
7122 /* Roll back the tokens we skipped. */
7123 cp_lexer_rollback_tokens (parser->lexer);
7124 /* If we were looking at a compound-literal, simulate an error
7125 so that the call to cp_parser_parse_definitely below will
7127 if (compound_literal_p)
7128 cp_parser_simulate_error (parser);
7131 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
7132 parser->in_type_id_in_expr_p = true;
7133 /* Look for the type-id. */
7134 type = cp_parser_type_id (parser);
7135 /* Look for the closing `)'. */
7136 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7137 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
7140 /* Restore the saved message. */
7141 parser->type_definition_forbidden_message = saved_message;
7143 /* At this point this can only be either a cast or a
7144 parenthesized ctor such as `(T ())' that looks like a cast to
7145 function returning T. */
7146 if (!cp_parser_error_occurred (parser)
7147 && cp_parser_token_starts_cast_expression (cp_lexer_peek_token
7150 cp_parser_parse_definitely (parser);
7151 expr = cp_parser_cast_expression (parser,
7152 /*address_p=*/false,
7153 /*cast_p=*/true, pidk);
7155 /* Warn about old-style casts, if so requested. */
7156 if (warn_old_style_cast
7157 && !in_system_header
7158 && !VOID_TYPE_P (type)
7159 && current_lang_name != lang_name_c)
7160 warning (OPT_Wold_style_cast, "use of old-style cast");
7162 /* Only type conversions to integral or enumeration types
7163 can be used in constant-expressions. */
7164 if (!cast_valid_in_integral_constant_expression_p (type)
7165 && cp_parser_non_integral_constant_expression (parser,
7167 return error_mark_node;
7169 /* Perform the cast. */
7170 expr = build_c_cast (input_location, type, expr);
7174 cp_parser_abort_tentative_parse (parser);
7177 /* If we get here, then it's not a cast, so it must be a
7178 unary-expression. */
7179 return cp_parser_unary_expression (parser, address_p, cast_p, pidk);
7182 /* Parse a binary expression of the general form:
7186 pm-expression .* cast-expression
7187 pm-expression ->* cast-expression
7189 multiplicative-expression:
7191 multiplicative-expression * pm-expression
7192 multiplicative-expression / pm-expression
7193 multiplicative-expression % pm-expression
7195 additive-expression:
7196 multiplicative-expression
7197 additive-expression + multiplicative-expression
7198 additive-expression - multiplicative-expression
7202 shift-expression << additive-expression
7203 shift-expression >> additive-expression
7205 relational-expression:
7207 relational-expression < shift-expression
7208 relational-expression > shift-expression
7209 relational-expression <= shift-expression
7210 relational-expression >= shift-expression
7214 relational-expression:
7215 relational-expression <? shift-expression
7216 relational-expression >? shift-expression
7218 equality-expression:
7219 relational-expression
7220 equality-expression == relational-expression
7221 equality-expression != relational-expression
7225 and-expression & equality-expression
7227 exclusive-or-expression:
7229 exclusive-or-expression ^ and-expression
7231 inclusive-or-expression:
7232 exclusive-or-expression
7233 inclusive-or-expression | exclusive-or-expression
7235 logical-and-expression:
7236 inclusive-or-expression
7237 logical-and-expression && inclusive-or-expression
7239 logical-or-expression:
7240 logical-and-expression
7241 logical-or-expression || logical-and-expression
7243 All these are implemented with a single function like:
7246 simple-cast-expression
7247 binary-expression <token> binary-expression
7249 CAST_P is true if this expression is the target of a cast.
7251 The binops_by_token map is used to get the tree codes for each <token> type.
7252 binary-expressions are associated according to a precedence table. */
7254 #define TOKEN_PRECEDENCE(token) \
7255 (((token->type == CPP_GREATER \
7256 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7257 && !parser->greater_than_is_operator_p) \
7258 ? PREC_NOT_OPERATOR \
7259 : binops_by_token[token->type].prec)
7262 cp_parser_binary_expression (cp_parser* parser, bool cast_p,
7263 bool no_toplevel_fold_p,
7264 enum cp_parser_prec prec,
7267 cp_parser_expression_stack stack;
7268 cp_parser_expression_stack_entry *sp = &stack[0];
7271 enum tree_code tree_type, lhs_type, rhs_type;
7272 enum cp_parser_prec new_prec, lookahead_prec;
7275 /* Parse the first expression. */
7276 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p, pidk);
7277 lhs_type = ERROR_MARK;
7279 if (cp_parser_error_occurred (parser))
7280 return error_mark_node;
7284 /* Get an operator token. */
7285 token = cp_lexer_peek_token (parser->lexer);
7287 if (warn_cxx0x_compat
7288 && token->type == CPP_RSHIFT
7289 && !parser->greater_than_is_operator_p)
7291 if (warning_at (token->location, OPT_Wc__0x_compat,
7292 "%<>>%> operator is treated as"
7293 " two right angle brackets in C++11"))
7294 inform (token->location,
7295 "suggest parentheses around %<>>%> expression");
7298 new_prec = TOKEN_PRECEDENCE (token);
7300 /* Popping an entry off the stack means we completed a subexpression:
7301 - either we found a token which is not an operator (`>' where it is not
7302 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7303 will happen repeatedly;
7304 - or, we found an operator which has lower priority. This is the case
7305 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7307 if (new_prec <= prec)
7316 tree_type = binops_by_token[token->type].tree_type;
7318 /* We used the operator token. */
7319 cp_lexer_consume_token (parser->lexer);
7321 /* For "false && x" or "true || x", x will never be executed;
7322 disable warnings while evaluating it. */
7323 if (tree_type == TRUTH_ANDIF_EXPR)
7324 c_inhibit_evaluation_warnings += lhs == truthvalue_false_node;
7325 else if (tree_type == TRUTH_ORIF_EXPR)
7326 c_inhibit_evaluation_warnings += lhs == truthvalue_true_node;
7328 /* Extract another operand. It may be the RHS of this expression
7329 or the LHS of a new, higher priority expression. */
7330 rhs = cp_parser_simple_cast_expression (parser);
7331 rhs_type = ERROR_MARK;
7333 /* Get another operator token. Look up its precedence to avoid
7334 building a useless (immediately popped) stack entry for common
7335 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7336 token = cp_lexer_peek_token (parser->lexer);
7337 lookahead_prec = TOKEN_PRECEDENCE (token);
7338 if (lookahead_prec > new_prec)
7340 /* ... and prepare to parse the RHS of the new, higher priority
7341 expression. Since precedence levels on the stack are
7342 monotonically increasing, we do not have to care about
7345 sp->tree_type = tree_type;
7347 sp->lhs_type = lhs_type;
7350 lhs_type = rhs_type;
7352 new_prec = lookahead_prec;
7356 lookahead_prec = new_prec;
7357 /* If the stack is not empty, we have parsed into LHS the right side
7358 (`4' in the example above) of an expression we had suspended.
7359 We can use the information on the stack to recover the LHS (`3')
7360 from the stack together with the tree code (`MULT_EXPR'), and
7361 the precedence of the higher level subexpression
7362 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7363 which will be used to actually build the additive expression. */
7366 tree_type = sp->tree_type;
7368 rhs_type = lhs_type;
7370 lhs_type = sp->lhs_type;
7373 /* Undo the disabling of warnings done above. */
7374 if (tree_type == TRUTH_ANDIF_EXPR)
7375 c_inhibit_evaluation_warnings -= lhs == truthvalue_false_node;
7376 else if (tree_type == TRUTH_ORIF_EXPR)
7377 c_inhibit_evaluation_warnings -= lhs == truthvalue_true_node;
7380 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7381 ERROR_MARK for everything that is not a binary expression.
7382 This makes warn_about_parentheses miss some warnings that
7383 involve unary operators. For unary expressions we should
7384 pass the correct tree_code unless the unary expression was
7385 surrounded by parentheses.
7387 if (no_toplevel_fold_p
7388 && lookahead_prec <= prec
7390 && TREE_CODE_CLASS (tree_type) == tcc_comparison)
7391 lhs = build2 (tree_type, boolean_type_node, lhs, rhs);
7393 lhs = build_x_binary_op (tree_type, lhs, lhs_type, rhs, rhs_type,
7394 &overload, tf_warning_or_error);
7395 lhs_type = tree_type;
7397 /* If the binary operator required the use of an overloaded operator,
7398 then this expression cannot be an integral constant-expression.
7399 An overloaded operator can be used even if both operands are
7400 otherwise permissible in an integral constant-expression if at
7401 least one of the operands is of enumeration type. */
7404 && cp_parser_non_integral_constant_expression (parser,
7406 return error_mark_node;
7413 /* Parse the `? expression : assignment-expression' part of a
7414 conditional-expression. The LOGICAL_OR_EXPR is the
7415 logical-or-expression that started the conditional-expression.
7416 Returns a representation of the entire conditional-expression.
7418 This routine is used by cp_parser_assignment_expression.
7420 ? expression : assignment-expression
7424 ? : assignment-expression */
7427 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
7430 tree assignment_expr;
7431 struct cp_token *token;
7433 /* Consume the `?' token. */
7434 cp_lexer_consume_token (parser->lexer);
7435 token = cp_lexer_peek_token (parser->lexer);
7436 if (cp_parser_allow_gnu_extensions_p (parser)
7437 && token->type == CPP_COLON)
7439 pedwarn (token->location, OPT_pedantic,
7440 "ISO C++ does not allow ?: with omitted middle operand");
7441 /* Implicit true clause. */
7443 c_inhibit_evaluation_warnings += logical_or_expr == truthvalue_true_node;
7444 warn_for_omitted_condop (token->location, logical_or_expr);
7448 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
7449 parser->colon_corrects_to_scope_p = false;
7450 /* Parse the expression. */
7451 c_inhibit_evaluation_warnings += logical_or_expr == truthvalue_false_node;
7452 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
7453 c_inhibit_evaluation_warnings +=
7454 ((logical_or_expr == truthvalue_true_node)
7455 - (logical_or_expr == truthvalue_false_node));
7456 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
7459 /* The next token should be a `:'. */
7460 cp_parser_require (parser, CPP_COLON, RT_COLON);
7461 /* Parse the assignment-expression. */
7462 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
7463 c_inhibit_evaluation_warnings -= logical_or_expr == truthvalue_true_node;
7465 /* Build the conditional-expression. */
7466 return build_x_conditional_expr (logical_or_expr,
7469 tf_warning_or_error);
7472 /* Parse an assignment-expression.
7474 assignment-expression:
7475 conditional-expression
7476 logical-or-expression assignment-operator assignment_expression
7479 CAST_P is true if this expression is the target of a cast.
7481 Returns a representation for the expression. */
7484 cp_parser_assignment_expression (cp_parser* parser, bool cast_p,
7489 /* If the next token is the `throw' keyword, then we're looking at
7490 a throw-expression. */
7491 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
7492 expr = cp_parser_throw_expression (parser);
7493 /* Otherwise, it must be that we are looking at a
7494 logical-or-expression. */
7497 /* Parse the binary expressions (logical-or-expression). */
7498 expr = cp_parser_binary_expression (parser, cast_p, false,
7499 PREC_NOT_OPERATOR, pidk);
7500 /* If the next token is a `?' then we're actually looking at a
7501 conditional-expression. */
7502 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
7503 return cp_parser_question_colon_clause (parser, expr);
7506 enum tree_code assignment_operator;
7508 /* If it's an assignment-operator, we're using the second
7511 = cp_parser_assignment_operator_opt (parser);
7512 if (assignment_operator != ERROR_MARK)
7514 bool non_constant_p;
7516 /* Parse the right-hand side of the assignment. */
7517 tree rhs = cp_parser_initializer_clause (parser, &non_constant_p);
7519 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
7520 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
7522 /* An assignment may not appear in a
7523 constant-expression. */
7524 if (cp_parser_non_integral_constant_expression (parser,
7526 return error_mark_node;
7527 /* Build the assignment expression. */
7528 expr = build_x_modify_expr (expr,
7529 assignment_operator,
7531 tf_warning_or_error);
7539 /* Parse an (optional) assignment-operator.
7541 assignment-operator: one of
7542 = *= /= %= += -= >>= <<= &= ^= |=
7546 assignment-operator: one of
7549 If the next token is an assignment operator, the corresponding tree
7550 code is returned, and the token is consumed. For example, for
7551 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7552 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7553 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7554 operator, ERROR_MARK is returned. */
7556 static enum tree_code
7557 cp_parser_assignment_operator_opt (cp_parser* parser)
7562 /* Peek at the next token. */
7563 token = cp_lexer_peek_token (parser->lexer);
7565 switch (token->type)
7576 op = TRUNC_DIV_EXPR;
7580 op = TRUNC_MOD_EXPR;
7612 /* Nothing else is an assignment operator. */
7616 /* If it was an assignment operator, consume it. */
7617 if (op != ERROR_MARK)
7618 cp_lexer_consume_token (parser->lexer);
7623 /* Parse an expression.
7626 assignment-expression
7627 expression , assignment-expression
7629 CAST_P is true if this expression is the target of a cast.
7631 Returns a representation of the expression. */
7634 cp_parser_expression (cp_parser* parser, bool cast_p, cp_id_kind * pidk)
7636 tree expression = NULL_TREE;
7640 tree assignment_expression;
7642 /* Parse the next assignment-expression. */
7643 assignment_expression
7644 = cp_parser_assignment_expression (parser, cast_p, pidk);
7645 /* If this is the first assignment-expression, we can just
7648 expression = assignment_expression;
7650 expression = build_x_compound_expr (expression,
7651 assignment_expression,
7652 tf_warning_or_error);
7653 /* If the next token is not a comma, then we are done with the
7655 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7657 /* Consume the `,'. */
7658 cp_lexer_consume_token (parser->lexer);
7659 /* A comma operator cannot appear in a constant-expression. */
7660 if (cp_parser_non_integral_constant_expression (parser, NIC_COMMA))
7661 expression = error_mark_node;
7667 /* Parse a constant-expression.
7669 constant-expression:
7670 conditional-expression
7672 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7673 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7674 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7675 is false, NON_CONSTANT_P should be NULL. */
7678 cp_parser_constant_expression (cp_parser* parser,
7679 bool allow_non_constant_p,
7680 bool *non_constant_p)
7682 bool saved_integral_constant_expression_p;
7683 bool saved_allow_non_integral_constant_expression_p;
7684 bool saved_non_integral_constant_expression_p;
7687 /* It might seem that we could simply parse the
7688 conditional-expression, and then check to see if it were
7689 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7690 one that the compiler can figure out is constant, possibly after
7691 doing some simplifications or optimizations. The standard has a
7692 precise definition of constant-expression, and we must honor
7693 that, even though it is somewhat more restrictive.
7699 is not a legal declaration, because `(2, 3)' is not a
7700 constant-expression. The `,' operator is forbidden in a
7701 constant-expression. However, GCC's constant-folding machinery
7702 will fold this operation to an INTEGER_CST for `3'. */
7704 /* Save the old settings. */
7705 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
7706 saved_allow_non_integral_constant_expression_p
7707 = parser->allow_non_integral_constant_expression_p;
7708 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
7709 /* We are now parsing a constant-expression. */
7710 parser->integral_constant_expression_p = true;
7711 parser->allow_non_integral_constant_expression_p
7712 = (allow_non_constant_p || cxx_dialect >= cxx0x);
7713 parser->non_integral_constant_expression_p = false;
7714 /* Although the grammar says "conditional-expression", we parse an
7715 "assignment-expression", which also permits "throw-expression"
7716 and the use of assignment operators. In the case that
7717 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7718 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7719 actually essential that we look for an assignment-expression.
7720 For example, cp_parser_initializer_clauses uses this function to
7721 determine whether a particular assignment-expression is in fact
7723 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false, NULL);
7724 /* Restore the old settings. */
7725 parser->integral_constant_expression_p
7726 = saved_integral_constant_expression_p;
7727 parser->allow_non_integral_constant_expression_p
7728 = saved_allow_non_integral_constant_expression_p;
7729 if (cxx_dialect >= cxx0x)
7731 /* Require an rvalue constant expression here; that's what our
7732 callers expect. Reference constant expressions are handled
7733 separately in e.g. cp_parser_template_argument. */
7734 bool is_const = potential_rvalue_constant_expression (expression);
7735 parser->non_integral_constant_expression_p = !is_const;
7736 if (!is_const && !allow_non_constant_p)
7737 require_potential_rvalue_constant_expression (expression);
7739 if (allow_non_constant_p)
7740 *non_constant_p = parser->non_integral_constant_expression_p;
7741 parser->non_integral_constant_expression_p
7742 = saved_non_integral_constant_expression_p;
7747 /* Parse __builtin_offsetof.
7749 offsetof-expression:
7750 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7752 offsetof-member-designator:
7754 | offsetof-member-designator "." id-expression
7755 | offsetof-member-designator "[" expression "]"
7756 | offsetof-member-designator "->" id-expression */
7759 cp_parser_builtin_offsetof (cp_parser *parser)
7761 int save_ice_p, save_non_ice_p;
7766 /* We're about to accept non-integral-constant things, but will
7767 definitely yield an integral constant expression. Save and
7768 restore these values around our local parsing. */
7769 save_ice_p = parser->integral_constant_expression_p;
7770 save_non_ice_p = parser->non_integral_constant_expression_p;
7772 /* Consume the "__builtin_offsetof" token. */
7773 cp_lexer_consume_token (parser->lexer);
7774 /* Consume the opening `('. */
7775 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
7776 /* Parse the type-id. */
7777 type = cp_parser_type_id (parser);
7778 /* Look for the `,'. */
7779 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7780 token = cp_lexer_peek_token (parser->lexer);
7782 /* Build the (type *)null that begins the traditional offsetof macro. */
7783 expr = build_static_cast (build_pointer_type (type), null_pointer_node,
7784 tf_warning_or_error);
7786 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7787 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
7788 true, &dummy, token->location);
7791 token = cp_lexer_peek_token (parser->lexer);
7792 switch (token->type)
7794 case CPP_OPEN_SQUARE:
7795 /* offsetof-member-designator "[" expression "]" */
7796 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
7800 /* offsetof-member-designator "->" identifier */
7801 expr = grok_array_decl (expr, integer_zero_node);
7805 /* offsetof-member-designator "." identifier */
7806 cp_lexer_consume_token (parser->lexer);
7807 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT,
7812 case CPP_CLOSE_PAREN:
7813 /* Consume the ")" token. */
7814 cp_lexer_consume_token (parser->lexer);
7818 /* Error. We know the following require will fail, but
7819 that gives the proper error message. */
7820 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7821 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
7822 expr = error_mark_node;
7828 /* If we're processing a template, we can't finish the semantics yet.
7829 Otherwise we can fold the entire expression now. */
7830 if (processing_template_decl)
7831 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
7833 expr = finish_offsetof (expr);
7836 parser->integral_constant_expression_p = save_ice_p;
7837 parser->non_integral_constant_expression_p = save_non_ice_p;
7842 /* Parse a trait expression.
7844 Returns a representation of the expression, the underlying type
7845 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7848 cp_parser_trait_expr (cp_parser* parser, enum rid keyword)
7851 tree type1, type2 = NULL_TREE;
7852 bool binary = false;
7853 cp_decl_specifier_seq decl_specs;
7857 case RID_HAS_NOTHROW_ASSIGN:
7858 kind = CPTK_HAS_NOTHROW_ASSIGN;
7860 case RID_HAS_NOTHROW_CONSTRUCTOR:
7861 kind = CPTK_HAS_NOTHROW_CONSTRUCTOR;
7863 case RID_HAS_NOTHROW_COPY:
7864 kind = CPTK_HAS_NOTHROW_COPY;
7866 case RID_HAS_TRIVIAL_ASSIGN:
7867 kind = CPTK_HAS_TRIVIAL_ASSIGN;
7869 case RID_HAS_TRIVIAL_CONSTRUCTOR:
7870 kind = CPTK_HAS_TRIVIAL_CONSTRUCTOR;
7872 case RID_HAS_TRIVIAL_COPY:
7873 kind = CPTK_HAS_TRIVIAL_COPY;
7875 case RID_HAS_TRIVIAL_DESTRUCTOR:
7876 kind = CPTK_HAS_TRIVIAL_DESTRUCTOR;
7878 case RID_HAS_VIRTUAL_DESTRUCTOR:
7879 kind = CPTK_HAS_VIRTUAL_DESTRUCTOR;
7881 case RID_IS_ABSTRACT:
7882 kind = CPTK_IS_ABSTRACT;
7884 case RID_IS_BASE_OF:
7885 kind = CPTK_IS_BASE_OF;
7889 kind = CPTK_IS_CLASS;
7891 case RID_IS_CONVERTIBLE_TO:
7892 kind = CPTK_IS_CONVERTIBLE_TO;
7896 kind = CPTK_IS_EMPTY;
7899 kind = CPTK_IS_ENUM;
7902 kind = CPTK_IS_FINAL;
7904 case RID_IS_LITERAL_TYPE:
7905 kind = CPTK_IS_LITERAL_TYPE;
7910 case RID_IS_POLYMORPHIC:
7911 kind = CPTK_IS_POLYMORPHIC;
7913 case RID_IS_STD_LAYOUT:
7914 kind = CPTK_IS_STD_LAYOUT;
7916 case RID_IS_TRIVIAL:
7917 kind = CPTK_IS_TRIVIAL;
7920 kind = CPTK_IS_UNION;
7922 case RID_UNDERLYING_TYPE:
7923 kind = CPTK_UNDERLYING_TYPE;
7928 case RID_DIRECT_BASES:
7929 kind = CPTK_DIRECT_BASES;
7935 /* Consume the token. */
7936 cp_lexer_consume_token (parser->lexer);
7938 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
7940 type1 = cp_parser_type_id (parser);
7942 if (type1 == error_mark_node)
7943 return error_mark_node;
7945 /* Build a trivial decl-specifier-seq. */
7946 clear_decl_specs (&decl_specs);
7947 decl_specs.type = type1;
7949 /* Call grokdeclarator to figure out what type this is. */
7950 type1 = grokdeclarator (NULL, &decl_specs, TYPENAME,
7951 /*initialized=*/0, /*attrlist=*/NULL);
7955 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
7957 type2 = cp_parser_type_id (parser);
7959 if (type2 == error_mark_node)
7960 return error_mark_node;
7962 /* Build a trivial decl-specifier-seq. */
7963 clear_decl_specs (&decl_specs);
7964 decl_specs.type = type2;
7966 /* Call grokdeclarator to figure out what type this is. */
7967 type2 = grokdeclarator (NULL, &decl_specs, TYPENAME,
7968 /*initialized=*/0, /*attrlist=*/NULL);
7971 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
7973 /* Complete the trait expression, which may mean either processing
7974 the trait expr now or saving it for template instantiation. */
7977 case CPTK_UNDERLYING_TYPE:
7978 return finish_underlying_type (type1);
7980 return finish_bases (type1, false);
7981 case CPTK_DIRECT_BASES:
7982 return finish_bases (type1, true);
7984 return finish_trait_expr (kind, type1, type2);
7988 /* Lambdas that appear in variable initializer or default argument scope
7989 get that in their mangling, so we need to record it. We might as well
7990 use the count for function and namespace scopes as well. */
7991 static GTY(()) tree lambda_scope;
7992 static GTY(()) int lambda_count;
7993 typedef struct GTY(()) tree_int
7998 DEF_VEC_O(tree_int);
7999 DEF_VEC_ALLOC_O(tree_int,gc);
8000 static GTY(()) VEC(tree_int,gc) *lambda_scope_stack;
8003 start_lambda_scope (tree decl)
8007 /* Once we're inside a function, we ignore other scopes and just push
8008 the function again so that popping works properly. */
8009 if (current_function_decl && TREE_CODE (decl) != FUNCTION_DECL)
8010 decl = current_function_decl;
8011 ti.t = lambda_scope;
8012 ti.i = lambda_count;
8013 VEC_safe_push (tree_int, gc, lambda_scope_stack, &ti);
8014 if (lambda_scope != decl)
8016 /* Don't reset the count if we're still in the same function. */
8017 lambda_scope = decl;
8023 record_lambda_scope (tree lambda)
8025 LAMBDA_EXPR_EXTRA_SCOPE (lambda) = lambda_scope;
8026 LAMBDA_EXPR_DISCRIMINATOR (lambda) = lambda_count++;
8030 finish_lambda_scope (void)
8032 tree_int *p = VEC_last (tree_int, lambda_scope_stack);
8033 if (lambda_scope != p->t)
8035 lambda_scope = p->t;
8036 lambda_count = p->i;
8038 VEC_pop (tree_int, lambda_scope_stack);
8041 /* Parse a lambda expression.
8044 lambda-introducer lambda-declarator [opt] compound-statement
8046 Returns a representation of the expression. */
8049 cp_parser_lambda_expression (cp_parser* parser)
8051 tree lambda_expr = build_lambda_expr ();
8055 LAMBDA_EXPR_LOCATION (lambda_expr)
8056 = cp_lexer_peek_token (parser->lexer)->location;
8058 if (cp_unevaluated_operand)
8059 error_at (LAMBDA_EXPR_LOCATION (lambda_expr),
8060 "lambda-expression in unevaluated context");
8062 /* We may be in the middle of deferred access check. Disable
8064 push_deferring_access_checks (dk_no_deferred);
8066 cp_parser_lambda_introducer (parser, lambda_expr);
8068 type = begin_lambda_type (lambda_expr);
8069 if (type == error_mark_node)
8070 return error_mark_node;
8072 record_lambda_scope (lambda_expr);
8074 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8075 determine_visibility (TYPE_NAME (type));
8077 /* Now that we've started the type, add the capture fields for any
8078 explicit captures. */
8079 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr));
8082 /* Inside the class, surrounding template-parameter-lists do not apply. */
8083 unsigned int saved_num_template_parameter_lists
8084 = parser->num_template_parameter_lists;
8085 unsigned char in_statement = parser->in_statement;
8086 bool in_switch_statement_p = parser->in_switch_statement_p;
8088 parser->num_template_parameter_lists = 0;
8089 parser->in_statement = 0;
8090 parser->in_switch_statement_p = false;
8092 /* By virtue of defining a local class, a lambda expression has access to
8093 the private variables of enclosing classes. */
8095 ok = cp_parser_lambda_declarator_opt (parser, lambda_expr);
8098 cp_parser_lambda_body (parser, lambda_expr);
8099 else if (cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8100 cp_parser_skip_to_end_of_block_or_statement (parser);
8102 /* The capture list was built up in reverse order; fix that now. */
8104 tree newlist = NULL_TREE;
8107 for (elt = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8110 next = TREE_CHAIN (elt);
8111 TREE_CHAIN (elt) = newlist;
8114 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr) = newlist;
8118 maybe_add_lambda_conv_op (type);
8120 type = finish_struct (type, /*attributes=*/NULL_TREE);
8122 parser->num_template_parameter_lists = saved_num_template_parameter_lists;
8123 parser->in_statement = in_statement;
8124 parser->in_switch_statement_p = in_switch_statement_p;
8127 pop_deferring_access_checks ();
8129 /* This field is only used during parsing of the lambda. */
8130 LAMBDA_EXPR_THIS_CAPTURE (lambda_expr) = NULL_TREE;
8132 /* This lambda shouldn't have any proxies left at this point. */
8133 gcc_assert (LAMBDA_EXPR_PENDING_PROXIES (lambda_expr) == NULL);
8134 /* And now that we're done, push proxies for an enclosing lambda. */
8135 insert_pending_capture_proxies ();
8138 return build_lambda_object (lambda_expr);
8140 return error_mark_node;
8143 /* Parse the beginning of a lambda expression.
8146 [ lambda-capture [opt] ]
8148 LAMBDA_EXPR is the current representation of the lambda expression. */
8151 cp_parser_lambda_introducer (cp_parser* parser, tree lambda_expr)
8153 /* Need commas after the first capture. */
8156 /* Eat the leading `['. */
8157 cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE);
8159 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8160 if (cp_lexer_next_token_is (parser->lexer, CPP_AND)
8161 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_NAME)
8162 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) = CPLD_REFERENCE;
8163 else if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8164 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) = CPLD_COPY;
8166 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) != CPLD_NONE)
8168 cp_lexer_consume_token (parser->lexer);
8172 while (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_SQUARE))
8174 cp_token* capture_token;
8176 tree capture_init_expr;
8177 cp_id_kind idk = CP_ID_KIND_NONE;
8178 bool explicit_init_p = false;
8180 enum capture_kind_type
8185 enum capture_kind_type capture_kind = BY_COPY;
8187 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
8189 error ("expected end of capture-list");
8196 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
8198 /* Possibly capture `this'. */
8199 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THIS))
8201 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
8202 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_COPY)
8203 pedwarn (loc, 0, "explicit by-copy capture of %<this%> redundant "
8204 "with by-copy capture default");
8205 cp_lexer_consume_token (parser->lexer);
8206 add_capture (lambda_expr,
8207 /*id=*/this_identifier,
8208 /*initializer=*/finish_this_expr(),
8209 /*by_reference_p=*/false,
8214 /* Remember whether we want to capture as a reference or not. */
8215 if (cp_lexer_next_token_is (parser->lexer, CPP_AND))
8217 capture_kind = BY_REFERENCE;
8218 cp_lexer_consume_token (parser->lexer);
8221 /* Get the identifier. */
8222 capture_token = cp_lexer_peek_token (parser->lexer);
8223 capture_id = cp_parser_identifier (parser);
8225 if (capture_id == error_mark_node)
8226 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8227 delimiters, but I modified this to stop on unnested ']' as well. It
8228 was already changed to stop on unnested '}', so the
8229 "closing_parenthesis" name is no more misleading with my change. */
8231 cp_parser_skip_to_closing_parenthesis (parser,
8232 /*recovering=*/true,
8234 /*consume_paren=*/true);
8238 /* Find the initializer for this capture. */
8239 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8241 /* An explicit expression exists. */
8242 cp_lexer_consume_token (parser->lexer);
8243 pedwarn (input_location, OPT_pedantic,
8244 "ISO C++ does not allow initializers "
8245 "in lambda expression capture lists");
8246 capture_init_expr = cp_parser_assignment_expression (parser,
8249 explicit_init_p = true;
8253 const char* error_msg;
8255 /* Turn the identifier into an id-expression. */
8257 = cp_parser_lookup_name
8261 /*is_template=*/false,
8262 /*is_namespace=*/false,
8263 /*check_dependency=*/true,
8264 /*ambiguous_decls=*/NULL,
8265 capture_token->location);
8267 if (capture_init_expr == error_mark_node)
8269 unqualified_name_lookup_error (capture_id);
8272 else if (DECL_P (capture_init_expr)
8273 && (TREE_CODE (capture_init_expr) != VAR_DECL
8274 && TREE_CODE (capture_init_expr) != PARM_DECL))
8276 error_at (capture_token->location,
8277 "capture of non-variable %qD ",
8279 inform (0, "%q+#D declared here", capture_init_expr);
8282 if (TREE_CODE (capture_init_expr) == VAR_DECL
8283 && decl_storage_duration (capture_init_expr) != dk_auto)
8285 pedwarn (capture_token->location, 0, "capture of variable "
8286 "%qD with non-automatic storage duration",
8288 inform (0, "%q+#D declared here", capture_init_expr);
8293 = finish_id_expression
8298 /*integral_constant_expression_p=*/false,
8299 /*allow_non_integral_constant_expression_p=*/false,
8300 /*non_integral_constant_expression_p=*/NULL,
8301 /*template_p=*/false,
8303 /*address_p=*/false,
8304 /*template_arg_p=*/false,
8306 capture_token->location);
8309 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) != CPLD_NONE
8310 && !explicit_init_p)
8312 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_COPY
8313 && capture_kind == BY_COPY)
8314 pedwarn (capture_token->location, 0, "explicit by-copy capture "
8315 "of %qD redundant with by-copy capture default",
8317 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr) == CPLD_REFERENCE
8318 && capture_kind == BY_REFERENCE)
8319 pedwarn (capture_token->location, 0, "explicit by-reference "
8320 "capture of %qD redundant with by-reference capture "
8321 "default", capture_id);
8324 add_capture (lambda_expr,
8327 /*by_reference_p=*/capture_kind == BY_REFERENCE,
8331 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
8334 /* Parse the (optional) middle of a lambda expression.
8337 ( parameter-declaration-clause [opt] )
8338 attribute-specifier [opt]
8340 exception-specification [opt]
8341 lambda-return-type-clause [opt]
8343 LAMBDA_EXPR is the current representation of the lambda expression. */
8346 cp_parser_lambda_declarator_opt (cp_parser* parser, tree lambda_expr)
8348 /* 5.1.1.4 of the standard says:
8349 If a lambda-expression does not include a lambda-declarator, it is as if
8350 the lambda-declarator were ().
8351 This means an empty parameter list, no attributes, and no exception
8353 tree param_list = void_list_node;
8354 tree attributes = NULL_TREE;
8355 tree exception_spec = NULL_TREE;
8358 /* The lambda-declarator is optional, but must begin with an opening
8359 parenthesis if present. */
8360 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
8362 cp_lexer_consume_token (parser->lexer);
8364 begin_scope (sk_function_parms, /*entity=*/NULL_TREE);
8366 /* Parse parameters. */
8367 param_list = cp_parser_parameter_declaration_clause (parser);
8369 /* Default arguments shall not be specified in the
8370 parameter-declaration-clause of a lambda-declarator. */
8371 for (t = param_list; t; t = TREE_CHAIN (t))
8372 if (TREE_PURPOSE (t))
8373 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t)), OPT_pedantic,
8374 "default argument specified for lambda parameter");
8376 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
8378 attributes = cp_parser_attributes_opt (parser);
8380 /* Parse optional `mutable' keyword. */
8381 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_MUTABLE))
8383 cp_lexer_consume_token (parser->lexer);
8384 LAMBDA_EXPR_MUTABLE_P (lambda_expr) = 1;
8387 /* Parse optional exception specification. */
8388 exception_spec = cp_parser_exception_specification_opt (parser);
8390 /* Parse optional trailing return type. */
8391 if (cp_lexer_next_token_is (parser->lexer, CPP_DEREF))
8393 cp_lexer_consume_token (parser->lexer);
8394 LAMBDA_EXPR_RETURN_TYPE (lambda_expr) = cp_parser_type_id (parser);
8397 /* The function parameters must be in scope all the way until after the
8398 trailing-return-type in case of decltype. */
8399 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
8400 pop_binding (DECL_NAME (t), t);
8405 /* Create the function call operator.
8407 Messing with declarators like this is no uglier than building up the
8408 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8411 cp_decl_specifier_seq return_type_specs;
8412 cp_declarator* declarator;
8417 clear_decl_specs (&return_type_specs);
8418 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr))
8419 return_type_specs.type = LAMBDA_EXPR_RETURN_TYPE (lambda_expr);
8421 /* Maybe we will deduce the return type later, but we can use void
8422 as a placeholder return type anyways. */
8423 return_type_specs.type = void_type_node;
8425 p = obstack_alloc (&declarator_obstack, 0);
8427 declarator = make_id_declarator (NULL_TREE, ansi_opname (CALL_EXPR),
8430 quals = (LAMBDA_EXPR_MUTABLE_P (lambda_expr)
8431 ? TYPE_UNQUALIFIED : TYPE_QUAL_CONST);
8432 declarator = make_call_declarator (declarator, param_list, quals,
8433 VIRT_SPEC_UNSPECIFIED,
8435 /*late_return_type=*/NULL_TREE);
8436 declarator->id_loc = LAMBDA_EXPR_LOCATION (lambda_expr);
8438 fco = grokmethod (&return_type_specs,
8441 if (fco != error_mark_node)
8443 DECL_INITIALIZED_IN_CLASS_P (fco) = 1;
8444 DECL_ARTIFICIAL (fco) = 1;
8445 /* Give the object parameter a different name. */
8446 DECL_NAME (DECL_ARGUMENTS (fco)) = get_identifier ("__closure");
8449 finish_member_declaration (fco);
8451 obstack_free (&declarator_obstack, p);
8453 return (fco != error_mark_node);
8457 /* Parse the body of a lambda expression, which is simply
8461 but which requires special handling.
8462 LAMBDA_EXPR is the current representation of the lambda expression. */
8465 cp_parser_lambda_body (cp_parser* parser, tree lambda_expr)
8467 bool nested = (current_function_decl != NULL_TREE);
8468 bool local_variables_forbidden_p = parser->local_variables_forbidden_p;
8470 push_function_context ();
8472 /* Still increment function_depth so that we don't GC in the
8473 middle of an expression. */
8475 /* Clear this in case we're in the middle of a default argument. */
8476 parser->local_variables_forbidden_p = false;
8478 /* Finish the function call operator
8480 + late_parsing_for_member
8481 + function_definition_after_declarator
8482 + ctor_initializer_opt_and_function_body */
8484 tree fco = lambda_function (lambda_expr);
8490 /* Let the front end know that we are going to be defining this
8492 start_preparsed_function (fco,
8494 SF_PRE_PARSED | SF_INCLASS_INLINE);
8496 start_lambda_scope (fco);
8497 body = begin_function_body ();
8499 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8502 /* Push the proxies for any explicit captures. */
8503 for (cap = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr); cap;
8504 cap = TREE_CHAIN (cap))
8505 build_capture_proxy (TREE_PURPOSE (cap));
8507 compound_stmt = begin_compound_stmt (0);
8509 /* 5.1.1.4 of the standard says:
8510 If a lambda-expression does not include a trailing-return-type, it
8511 is as if the trailing-return-type denotes the following type:
8512 * if the compound-statement is of the form
8513 { return attribute-specifier [opt] expression ; }
8514 the type of the returned expression after lvalue-to-rvalue
8515 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8516 (_conv.array_ 4.2), and function-to-pointer conversion
8518 * otherwise, void. */
8520 /* In a lambda that has neither a lambda-return-type-clause
8521 nor a deducible form, errors should be reported for return statements
8522 in the body. Since we used void as the placeholder return type, parsing
8523 the body as usual will give such desired behavior. */
8524 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr)
8525 && cp_lexer_peek_nth_token (parser->lexer, 1)->keyword == RID_RETURN
8526 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SEMICOLON)
8528 tree expr = NULL_TREE;
8529 cp_id_kind idk = CP_ID_KIND_NONE;
8531 /* Parse tentatively in case there's more after the initial return
8533 cp_parser_parse_tentatively (parser);
8535 cp_parser_require_keyword (parser, RID_RETURN, RT_RETURN);
8537 expr = cp_parser_expression (parser, /*cast_p=*/false, &idk);
8539 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
8540 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8542 if (cp_parser_parse_definitely (parser))
8544 apply_lambda_return_type (lambda_expr, lambda_return_type (expr));
8546 /* Will get error here if type not deduced yet. */
8547 finish_return_stmt (expr);
8555 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr))
8556 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr) = true;
8557 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
8558 cp_parser_label_declaration (parser);
8559 cp_parser_statement_seq_opt (parser, NULL_TREE);
8560 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8561 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr) = false;
8564 finish_compound_stmt (compound_stmt);
8567 finish_function_body (body);
8568 finish_lambda_scope ();
8570 /* Finish the function and generate code for it if necessary. */
8571 expand_or_defer_fn (finish_function (/*inline*/2));
8574 parser->local_variables_forbidden_p = local_variables_forbidden_p;
8576 pop_function_context();
8581 /* Statements [gram.stmt.stmt] */
8583 /* Parse a statement.
8587 expression-statement
8592 declaration-statement
8600 IN_COMPOUND is true when the statement is nested inside a
8601 cp_parser_compound_statement; this matters for certain pragmas.
8603 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8604 is a (possibly labeled) if statement which is not enclosed in braces
8605 and has an else clause. This is used to implement -Wparentheses. */
8608 cp_parser_statement (cp_parser* parser, tree in_statement_expr,
8609 bool in_compound, bool *if_p)
8613 location_t statement_location;
8618 /* There is no statement yet. */
8619 statement = NULL_TREE;
8620 /* Peek at the next token. */
8621 token = cp_lexer_peek_token (parser->lexer);
8622 /* Remember the location of the first token in the statement. */
8623 statement_location = token->location;
8624 /* If this is a keyword, then that will often determine what kind of
8625 statement we have. */
8626 if (token->type == CPP_KEYWORD)
8628 enum rid keyword = token->keyword;
8634 /* Looks like a labeled-statement with a case label.
8635 Parse the label, and then use tail recursion to parse
8637 cp_parser_label_for_labeled_statement (parser);
8642 statement = cp_parser_selection_statement (parser, if_p);
8648 statement = cp_parser_iteration_statement (parser);
8655 statement = cp_parser_jump_statement (parser);
8658 /* Objective-C++ exception-handling constructs. */
8661 case RID_AT_FINALLY:
8662 case RID_AT_SYNCHRONIZED:
8664 statement = cp_parser_objc_statement (parser);
8668 statement = cp_parser_try_block (parser);
8672 /* This must be a namespace alias definition. */
8673 cp_parser_declaration_statement (parser);
8676 case RID_TRANSACTION_ATOMIC:
8677 case RID_TRANSACTION_RELAXED:
8678 statement = cp_parser_transaction (parser, keyword);
8680 case RID_TRANSACTION_CANCEL:
8681 statement = cp_parser_transaction_cancel (parser);
8685 /* It might be a keyword like `int' that can start a
8686 declaration-statement. */
8690 else if (token->type == CPP_NAME)
8692 /* If the next token is a `:', then we are looking at a
8693 labeled-statement. */
8694 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8695 if (token->type == CPP_COLON)
8697 /* Looks like a labeled-statement with an ordinary label.
8698 Parse the label, and then use tail recursion to parse
8700 cp_parser_label_for_labeled_statement (parser);
8704 /* Anything that starts with a `{' must be a compound-statement. */
8705 else if (token->type == CPP_OPEN_BRACE)
8706 statement = cp_parser_compound_statement (parser, NULL, false, false);
8707 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8708 a statement all its own. */
8709 else if (token->type == CPP_PRAGMA)
8711 /* Only certain OpenMP pragmas are attached to statements, and thus
8712 are considered statements themselves. All others are not. In
8713 the context of a compound, accept the pragma as a "statement" and
8714 return so that we can check for a close brace. Otherwise we
8715 require a real statement and must go back and read one. */
8717 cp_parser_pragma (parser, pragma_compound);
8718 else if (!cp_parser_pragma (parser, pragma_stmt))
8722 else if (token->type == CPP_EOF)
8724 cp_parser_error (parser, "expected statement");
8728 /* Everything else must be a declaration-statement or an
8729 expression-statement. Try for the declaration-statement
8730 first, unless we are looking at a `;', in which case we know that
8731 we have an expression-statement. */
8734 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8736 cp_parser_parse_tentatively (parser);
8737 /* Try to parse the declaration-statement. */
8738 cp_parser_declaration_statement (parser);
8739 /* If that worked, we're done. */
8740 if (cp_parser_parse_definitely (parser))
8743 /* Look for an expression-statement instead. */
8744 statement = cp_parser_expression_statement (parser, in_statement_expr);
8747 /* Set the line number for the statement. */
8748 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
8749 SET_EXPR_LOCATION (statement, statement_location);
8752 /* Parse the label for a labeled-statement, i.e.
8755 case constant-expression :
8759 case constant-expression ... constant-expression : statement
8761 When a label is parsed without errors, the label is added to the
8762 parse tree by the finish_* functions, so this function doesn't
8763 have to return the label. */
8766 cp_parser_label_for_labeled_statement (cp_parser* parser)
8769 tree label = NULL_TREE;
8770 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
8772 /* The next token should be an identifier. */
8773 token = cp_lexer_peek_token (parser->lexer);
8774 if (token->type != CPP_NAME
8775 && token->type != CPP_KEYWORD)
8777 cp_parser_error (parser, "expected labeled-statement");
8781 parser->colon_corrects_to_scope_p = false;
8782 switch (token->keyword)
8789 /* Consume the `case' token. */
8790 cp_lexer_consume_token (parser->lexer);
8791 /* Parse the constant-expression. */
8792 expr = cp_parser_constant_expression (parser,
8793 /*allow_non_constant_p=*/false,
8796 ellipsis = cp_lexer_peek_token (parser->lexer);
8797 if (ellipsis->type == CPP_ELLIPSIS)
8799 /* Consume the `...' token. */
8800 cp_lexer_consume_token (parser->lexer);
8802 cp_parser_constant_expression (parser,
8803 /*allow_non_constant_p=*/false,
8805 /* We don't need to emit warnings here, as the common code
8806 will do this for us. */
8809 expr_hi = NULL_TREE;
8811 if (parser->in_switch_statement_p)
8812 finish_case_label (token->location, expr, expr_hi);
8814 error_at (token->location,
8815 "case label %qE not within a switch statement",
8821 /* Consume the `default' token. */
8822 cp_lexer_consume_token (parser->lexer);
8824 if (parser->in_switch_statement_p)
8825 finish_case_label (token->location, NULL_TREE, NULL_TREE);
8827 error_at (token->location, "case label not within a switch statement");
8831 /* Anything else must be an ordinary label. */
8832 label = finish_label_stmt (cp_parser_identifier (parser));
8836 /* Require the `:' token. */
8837 cp_parser_require (parser, CPP_COLON, RT_COLON);
8839 /* An ordinary label may optionally be followed by attributes.
8840 However, this is only permitted if the attributes are then
8841 followed by a semicolon. This is because, for backward
8842 compatibility, when parsing
8843 lab: __attribute__ ((unused)) int i;
8844 we want the attribute to attach to "i", not "lab". */
8845 if (label != NULL_TREE
8846 && cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
8850 cp_parser_parse_tentatively (parser);
8851 attrs = cp_parser_attributes_opt (parser);
8852 if (attrs == NULL_TREE
8853 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8854 cp_parser_abort_tentative_parse (parser);
8855 else if (!cp_parser_parse_definitely (parser))
8858 cplus_decl_attributes (&label, attrs, 0);
8861 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
8864 /* Parse an expression-statement.
8866 expression-statement:
8869 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8870 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8871 indicates whether this expression-statement is part of an
8872 expression statement. */
8875 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
8877 tree statement = NULL_TREE;
8878 cp_token *token = cp_lexer_peek_token (parser->lexer);
8880 /* If the next token is a ';', then there is no expression
8882 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
8883 statement = cp_parser_expression (parser, /*cast_p=*/false, NULL);
8885 /* Give a helpful message for "A<T>::type t;" and the like. */
8886 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
8887 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
8889 if (TREE_CODE (statement) == SCOPE_REF)
8890 error_at (token->location, "need %<typename%> before %qE because "
8891 "%qT is a dependent scope",
8892 statement, TREE_OPERAND (statement, 0));
8893 else if (is_overloaded_fn (statement)
8894 && DECL_CONSTRUCTOR_P (get_first_fn (statement)))
8897 tree fn = get_first_fn (statement);
8898 error_at (token->location,
8899 "%<%T::%D%> names the constructor, not the type",
8900 DECL_CONTEXT (fn), DECL_NAME (fn));
8904 /* Consume the final `;'. */
8905 cp_parser_consume_semicolon_at_end_of_statement (parser);
8907 if (in_statement_expr
8908 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
8909 /* This is the final expression statement of a statement
8911 statement = finish_stmt_expr_expr (statement, in_statement_expr);
8913 statement = finish_expr_stmt (statement);
8920 /* Parse a compound-statement.
8923 { statement-seq [opt] }
8928 { label-declaration-seq [opt] statement-seq [opt] }
8930 label-declaration-seq:
8932 label-declaration-seq label-declaration
8934 Returns a tree representing the statement. */
8937 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
8938 bool in_try, bool function_body)
8942 /* Consume the `{'. */
8943 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
8944 return error_mark_node;
8945 if (DECL_DECLARED_CONSTEXPR_P (current_function_decl)
8947 pedwarn (input_location, OPT_pedantic,
8948 "compound-statement in constexpr function");
8949 /* Begin the compound-statement. */
8950 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
8951 /* If the next keyword is `__label__' we have a label declaration. */
8952 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
8953 cp_parser_label_declaration (parser);
8954 /* Parse an (optional) statement-seq. */
8955 cp_parser_statement_seq_opt (parser, in_statement_expr);
8956 /* Finish the compound-statement. */
8957 finish_compound_stmt (compound_stmt);
8958 /* Consume the `}'. */
8959 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
8961 return compound_stmt;
8964 /* Parse an (optional) statement-seq.
8968 statement-seq [opt] statement */
8971 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
8973 /* Scan statements until there aren't any more. */
8976 cp_token *token = cp_lexer_peek_token (parser->lexer);
8978 /* If we are looking at a `}', then we have run out of
8979 statements; the same is true if we have reached the end
8980 of file, or have stumbled upon a stray '@end'. */
8981 if (token->type == CPP_CLOSE_BRACE
8982 || token->type == CPP_EOF
8983 || token->type == CPP_PRAGMA_EOL
8984 || (token->type == CPP_KEYWORD && token->keyword == RID_AT_END))
8987 /* If we are in a compound statement and find 'else' then
8988 something went wrong. */
8989 else if (token->type == CPP_KEYWORD && token->keyword == RID_ELSE)
8991 if (parser->in_statement & IN_IF_STMT)
8995 token = cp_lexer_consume_token (parser->lexer);
8996 error_at (token->location, "%<else%> without a previous %<if%>");
9000 /* Parse the statement. */
9001 cp_parser_statement (parser, in_statement_expr, true, NULL);
9005 /* Parse a selection-statement.
9007 selection-statement:
9008 if ( condition ) statement
9009 if ( condition ) statement else statement
9010 switch ( condition ) statement
9012 Returns the new IF_STMT or SWITCH_STMT.
9014 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9015 is a (possibly labeled) if statement which is not enclosed in
9016 braces and has an else clause. This is used to implement
9020 cp_parser_selection_statement (cp_parser* parser, bool *if_p)
9028 /* Peek at the next token. */
9029 token = cp_parser_require (parser, CPP_KEYWORD, RT_SELECT);
9031 /* See what kind of keyword it is. */
9032 keyword = token->keyword;
9041 /* Look for the `('. */
9042 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
9044 cp_parser_skip_to_end_of_statement (parser);
9045 return error_mark_node;
9048 /* Begin the selection-statement. */
9049 if (keyword == RID_IF)
9050 statement = begin_if_stmt ();
9052 statement = begin_switch_stmt ();
9054 /* Parse the condition. */
9055 condition = cp_parser_condition (parser);
9056 /* Look for the `)'. */
9057 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
9058 cp_parser_skip_to_closing_parenthesis (parser, true, false,
9059 /*consume_paren=*/true);
9061 if (keyword == RID_IF)
9064 unsigned char in_statement;
9066 /* Add the condition. */
9067 finish_if_stmt_cond (condition, statement);
9069 /* Parse the then-clause. */
9070 in_statement = parser->in_statement;
9071 parser->in_statement |= IN_IF_STMT;
9072 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9074 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
9075 add_stmt (build_empty_stmt (loc));
9076 cp_lexer_consume_token (parser->lexer);
9077 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_ELSE))
9078 warning_at (loc, OPT_Wempty_body, "suggest braces around "
9079 "empty body in an %<if%> statement");
9083 cp_parser_implicitly_scoped_statement (parser, &nested_if);
9084 parser->in_statement = in_statement;
9086 finish_then_clause (statement);
9088 /* If the next token is `else', parse the else-clause. */
9089 if (cp_lexer_next_token_is_keyword (parser->lexer,
9092 /* Consume the `else' keyword. */
9093 cp_lexer_consume_token (parser->lexer);
9094 begin_else_clause (statement);
9095 /* Parse the else-clause. */
9096 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9099 loc = cp_lexer_peek_token (parser->lexer)->location;
9101 OPT_Wempty_body, "suggest braces around "
9102 "empty body in an %<else%> statement");
9103 add_stmt (build_empty_stmt (loc));
9104 cp_lexer_consume_token (parser->lexer);
9107 cp_parser_implicitly_scoped_statement (parser, NULL);
9109 finish_else_clause (statement);
9111 /* If we are currently parsing a then-clause, then
9112 IF_P will not be NULL. We set it to true to
9113 indicate that this if statement has an else clause.
9114 This may trigger the Wparentheses warning below
9115 when we get back up to the parent if statement. */
9121 /* This if statement does not have an else clause. If
9122 NESTED_IF is true, then the then-clause is an if
9123 statement which does have an else clause. We warn
9124 about the potential ambiguity. */
9126 warning_at (EXPR_LOCATION (statement), OPT_Wparentheses,
9127 "suggest explicit braces to avoid ambiguous"
9131 /* Now we're all done with the if-statement. */
9132 finish_if_stmt (statement);
9136 bool in_switch_statement_p;
9137 unsigned char in_statement;
9139 /* Add the condition. */
9140 finish_switch_cond (condition, statement);
9142 /* Parse the body of the switch-statement. */
9143 in_switch_statement_p = parser->in_switch_statement_p;
9144 in_statement = parser->in_statement;
9145 parser->in_switch_statement_p = true;
9146 parser->in_statement |= IN_SWITCH_STMT;
9147 cp_parser_implicitly_scoped_statement (parser, NULL);
9148 parser->in_switch_statement_p = in_switch_statement_p;
9149 parser->in_statement = in_statement;
9151 /* Now we're all done with the switch-statement. */
9152 finish_switch_stmt (statement);
9160 cp_parser_error (parser, "expected selection-statement");
9161 return error_mark_node;
9165 /* Parse a condition.
9169 type-specifier-seq declarator = initializer-clause
9170 type-specifier-seq declarator braced-init-list
9175 type-specifier-seq declarator asm-specification [opt]
9176 attributes [opt] = assignment-expression
9178 Returns the expression that should be tested. */
9181 cp_parser_condition (cp_parser* parser)
9183 cp_decl_specifier_seq type_specifiers;
9184 const char *saved_message;
9185 int declares_class_or_enum;
9187 /* Try the declaration first. */
9188 cp_parser_parse_tentatively (parser);
9189 /* New types are not allowed in the type-specifier-seq for a
9191 saved_message = parser->type_definition_forbidden_message;
9192 parser->type_definition_forbidden_message
9193 = G_("types may not be defined in conditions");
9194 /* Parse the type-specifier-seq. */
9195 cp_parser_decl_specifier_seq (parser,
9196 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9198 &declares_class_or_enum);
9199 /* Restore the saved message. */
9200 parser->type_definition_forbidden_message = saved_message;
9201 /* If all is well, we might be looking at a declaration. */
9202 if (!cp_parser_error_occurred (parser))
9205 tree asm_specification;
9207 cp_declarator *declarator;
9208 tree initializer = NULL_TREE;
9210 /* Parse the declarator. */
9211 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9212 /*ctor_dtor_or_conv_p=*/NULL,
9213 /*parenthesized_p=*/NULL,
9214 /*member_p=*/false);
9215 /* Parse the attributes. */
9216 attributes = cp_parser_attributes_opt (parser);
9217 /* Parse the asm-specification. */
9218 asm_specification = cp_parser_asm_specification_opt (parser);
9219 /* If the next token is not an `=' or '{', then we might still be
9220 looking at an expression. For example:
9224 looks like a decl-specifier-seq and a declarator -- but then
9225 there is no `=', so this is an expression. */
9226 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
9227 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
9228 cp_parser_simulate_error (parser);
9230 /* If we did see an `=' or '{', then we are looking at a declaration
9232 if (cp_parser_parse_definitely (parser))
9235 bool non_constant_p;
9236 bool flags = LOOKUP_ONLYCONVERTING;
9238 /* Create the declaration. */
9239 decl = start_decl (declarator, &type_specifiers,
9240 /*initialized_p=*/true,
9241 attributes, /*prefix_attributes=*/NULL_TREE,
9244 /* Parse the initializer. */
9245 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9247 initializer = cp_parser_braced_list (parser, &non_constant_p);
9248 CONSTRUCTOR_IS_DIRECT_INIT (initializer) = 1;
9253 /* Consume the `='. */
9254 cp_parser_require (parser, CPP_EQ, RT_EQ);
9255 initializer = cp_parser_initializer_clause (parser, &non_constant_p);
9257 if (BRACE_ENCLOSED_INITIALIZER_P (initializer))
9258 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
9260 /* Process the initializer. */
9261 cp_finish_decl (decl,
9262 initializer, !non_constant_p,
9267 pop_scope (pushed_scope);
9269 return convert_from_reference (decl);
9272 /* If we didn't even get past the declarator successfully, we are
9273 definitely not looking at a declaration. */
9275 cp_parser_abort_tentative_parse (parser);
9277 /* Otherwise, we are looking at an expression. */
9278 return cp_parser_expression (parser, /*cast_p=*/false, NULL);
9281 /* Parses a for-statement or range-for-statement until the closing ')',
9285 cp_parser_for (cp_parser *parser)
9287 tree init, scope, decl;
9290 /* Begin the for-statement. */
9291 scope = begin_for_scope (&init);
9293 /* Parse the initialization. */
9294 is_range_for = cp_parser_for_init_statement (parser, &decl);
9297 return cp_parser_range_for (parser, scope, init, decl);
9299 return cp_parser_c_for (parser, scope, init);
9303 cp_parser_c_for (cp_parser *parser, tree scope, tree init)
9305 /* Normal for loop */
9306 tree condition = NULL_TREE;
9307 tree expression = NULL_TREE;
9310 stmt = begin_for_stmt (scope, init);
9311 /* The for-init-statement has already been parsed in
9312 cp_parser_for_init_statement, so no work is needed here. */
9313 finish_for_init_stmt (stmt);
9315 /* If there's a condition, process it. */
9316 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9317 condition = cp_parser_condition (parser);
9318 finish_for_cond (condition, stmt);
9319 /* Look for the `;'. */
9320 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9322 /* If there's an expression, process it. */
9323 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
9324 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9325 finish_for_expr (expression, stmt);
9330 /* Tries to parse a range-based for-statement:
9333 decl-specifier-seq declarator : expression
9335 The decl-specifier-seq declarator and the `:' are already parsed by
9336 cp_parser_for_init_statement. If processing_template_decl it returns a
9337 newly created RANGE_FOR_STMT; if not, it is converted to a
9338 regular FOR_STMT. */
9341 cp_parser_range_for (cp_parser *parser, tree scope, tree init, tree range_decl)
9343 tree stmt, range_expr;
9345 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9347 bool expr_non_constant_p;
9348 range_expr = cp_parser_braced_list (parser, &expr_non_constant_p);
9351 range_expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9353 /* If in template, STMT is converted to a normal for-statement
9354 at instantiation. If not, it is done just ahead. */
9355 if (processing_template_decl)
9357 if (check_for_bare_parameter_packs (range_expr))
9358 range_expr = error_mark_node;
9359 stmt = begin_range_for_stmt (scope, init);
9360 finish_range_for_decl (stmt, range_decl, range_expr);
9361 if (!type_dependent_expression_p (range_expr)
9362 /* do_auto_deduction doesn't mess with template init-lists. */
9363 && !BRACE_ENCLOSED_INITIALIZER_P (range_expr))
9364 do_range_for_auto_deduction (range_decl, range_expr);
9368 stmt = begin_for_stmt (scope, init);
9369 stmt = cp_convert_range_for (stmt, range_decl, range_expr);
9374 /* Subroutine of cp_convert_range_for: given the initializer expression,
9375 builds up the range temporary. */
9378 build_range_temp (tree range_expr)
9380 tree range_type, range_temp;
9382 /* Find out the type deduced by the declaration
9383 `auto &&__range = range_expr'. */
9384 range_type = cp_build_reference_type (make_auto (), true);
9385 range_type = do_auto_deduction (range_type, range_expr,
9386 type_uses_auto (range_type));
9388 /* Create the __range variable. */
9389 range_temp = build_decl (input_location, VAR_DECL,
9390 get_identifier ("__for_range"), range_type);
9391 TREE_USED (range_temp) = 1;
9392 DECL_ARTIFICIAL (range_temp) = 1;
9397 /* Used by cp_parser_range_for in template context: we aren't going to
9398 do a full conversion yet, but we still need to resolve auto in the
9399 type of the for-range-declaration if present. This is basically
9400 a shortcut version of cp_convert_range_for. */
9403 do_range_for_auto_deduction (tree decl, tree range_expr)
9405 tree auto_node = type_uses_auto (TREE_TYPE (decl));
9408 tree begin_dummy, end_dummy, range_temp, iter_type, iter_decl;
9409 range_temp = convert_from_reference (build_range_temp (range_expr));
9410 iter_type = (cp_parser_perform_range_for_lookup
9411 (range_temp, &begin_dummy, &end_dummy));
9412 iter_decl = build_decl (input_location, VAR_DECL, NULL_TREE, iter_type);
9413 iter_decl = build_x_indirect_ref (iter_decl, RO_NULL,
9414 tf_warning_or_error);
9415 TREE_TYPE (decl) = do_auto_deduction (TREE_TYPE (decl),
9416 iter_decl, auto_node);
9420 /* Converts a range-based for-statement into a normal
9421 for-statement, as per the definition.
9423 for (RANGE_DECL : RANGE_EXPR)
9426 should be equivalent to:
9429 auto &&__range = RANGE_EXPR;
9430 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9434 RANGE_DECL = *__begin;
9439 If RANGE_EXPR is an array:
9440 BEGIN_EXPR = __range
9441 END_EXPR = __range + ARRAY_SIZE(__range)
9442 Else if RANGE_EXPR has a member 'begin' or 'end':
9443 BEGIN_EXPR = __range.begin()
9444 END_EXPR = __range.end()
9446 BEGIN_EXPR = begin(__range)
9447 END_EXPR = end(__range);
9449 If __range has a member 'begin' but not 'end', or vice versa, we must
9450 still use the second alternative (it will surely fail, however).
9451 When calling begin()/end() in the third alternative we must use
9452 argument dependent lookup, but always considering 'std' as an associated
9456 cp_convert_range_for (tree statement, tree range_decl, tree range_expr)
9459 tree iter_type, begin_expr, end_expr;
9460 tree condition, expression;
9462 if (range_decl == error_mark_node || range_expr == error_mark_node)
9463 /* If an error happened previously do nothing or else a lot of
9464 unhelpful errors would be issued. */
9465 begin_expr = end_expr = iter_type = error_mark_node;
9468 tree range_temp = build_range_temp (range_expr);
9469 pushdecl (range_temp);
9470 cp_finish_decl (range_temp, range_expr,
9471 /*is_constant_init*/false, NULL_TREE,
9472 LOOKUP_ONLYCONVERTING);
9474 range_temp = convert_from_reference (range_temp);
9475 iter_type = cp_parser_perform_range_for_lookup (range_temp,
9476 &begin_expr, &end_expr);
9479 /* The new for initialization statement. */
9480 begin = build_decl (input_location, VAR_DECL,
9481 get_identifier ("__for_begin"), iter_type);
9482 TREE_USED (begin) = 1;
9483 DECL_ARTIFICIAL (begin) = 1;
9485 cp_finish_decl (begin, begin_expr,
9486 /*is_constant_init*/false, NULL_TREE,
9487 LOOKUP_ONLYCONVERTING);
9489 end = build_decl (input_location, VAR_DECL,
9490 get_identifier ("__for_end"), iter_type);
9491 TREE_USED (end) = 1;
9492 DECL_ARTIFICIAL (end) = 1;
9494 cp_finish_decl (end, end_expr,
9495 /*is_constant_init*/false, NULL_TREE,
9496 LOOKUP_ONLYCONVERTING);
9498 finish_for_init_stmt (statement);
9500 /* The new for condition. */
9501 condition = build_x_binary_op (NE_EXPR,
9504 NULL, tf_warning_or_error);
9505 finish_for_cond (condition, statement);
9507 /* The new increment expression. */
9508 expression = finish_unary_op_expr (PREINCREMENT_EXPR, begin);
9509 finish_for_expr (expression, statement);
9511 /* The declaration is initialized with *__begin inside the loop body. */
9512 cp_finish_decl (range_decl,
9513 build_x_indirect_ref (begin, RO_NULL, tf_warning_or_error),
9514 /*is_constant_init*/false, NULL_TREE,
9515 LOOKUP_ONLYCONVERTING);
9520 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9521 We need to solve both at the same time because the method used
9522 depends on the existence of members begin or end.
9523 Returns the type deduced for the iterator expression. */
9526 cp_parser_perform_range_for_lookup (tree range, tree *begin, tree *end)
9528 if (error_operand_p (range))
9530 *begin = *end = error_mark_node;
9531 return error_mark_node;
9534 if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (range))))
9536 error ("range-based %<for%> expression of type %qT "
9537 "has incomplete type", TREE_TYPE (range));
9538 *begin = *end = error_mark_node;
9539 return error_mark_node;
9541 if (TREE_CODE (TREE_TYPE (range)) == ARRAY_TYPE)
9543 /* If RANGE is an array, we will use pointer arithmetic. */
9545 *end = build_binary_op (input_location, PLUS_EXPR,
9547 array_type_nelts_top (TREE_TYPE (range)),
9549 return build_pointer_type (TREE_TYPE (TREE_TYPE (range)));
9553 /* If it is not an array, we must do a bit of magic. */
9554 tree id_begin, id_end;
9555 tree member_begin, member_end;
9557 *begin = *end = error_mark_node;
9559 id_begin = get_identifier ("begin");
9560 id_end = get_identifier ("end");
9561 member_begin = lookup_member (TREE_TYPE (range), id_begin,
9562 /*protect=*/2, /*want_type=*/false,
9563 tf_warning_or_error);
9564 member_end = lookup_member (TREE_TYPE (range), id_end,
9565 /*protect=*/2, /*want_type=*/false,
9566 tf_warning_or_error);
9568 if (member_begin != NULL_TREE || member_end != NULL_TREE)
9570 /* Use the member functions. */
9571 if (member_begin != NULL_TREE)
9572 *begin = cp_parser_range_for_member_function (range, id_begin);
9574 error ("range-based %<for%> expression of type %qT has an "
9575 "%<end%> member but not a %<begin%>", TREE_TYPE (range));
9577 if (member_end != NULL_TREE)
9578 *end = cp_parser_range_for_member_function (range, id_end);
9580 error ("range-based %<for%> expression of type %qT has a "
9581 "%<begin%> member but not an %<end%>", TREE_TYPE (range));
9585 /* Use global functions with ADL. */
9587 vec = make_tree_vector ();
9589 VEC_safe_push (tree, gc, vec, range);
9591 member_begin = perform_koenig_lookup (id_begin, vec,
9592 /*include_std=*/true,
9593 tf_warning_or_error);
9594 *begin = finish_call_expr (member_begin, &vec, false, true,
9595 tf_warning_or_error);
9596 member_end = perform_koenig_lookup (id_end, vec,
9597 /*include_std=*/true,
9598 tf_warning_or_error);
9599 *end = finish_call_expr (member_end, &vec, false, true,
9600 tf_warning_or_error);
9602 release_tree_vector (vec);
9605 /* Last common checks. */
9606 if (*begin == error_mark_node || *end == error_mark_node)
9608 /* If one of the expressions is an error do no more checks. */
9609 *begin = *end = error_mark_node;
9610 return error_mark_node;
9614 tree iter_type = cv_unqualified (TREE_TYPE (*begin));
9615 /* The unqualified type of the __begin and __end temporaries should
9616 be the same, as required by the multiple auto declaration. */
9617 if (!same_type_p (iter_type, cv_unqualified (TREE_TYPE (*end))))
9618 error ("inconsistent begin/end types in range-based %<for%> "
9619 "statement: %qT and %qT",
9620 TREE_TYPE (*begin), TREE_TYPE (*end));
9626 /* Helper function for cp_parser_perform_range_for_lookup.
9627 Builds a tree for RANGE.IDENTIFIER(). */
9630 cp_parser_range_for_member_function (tree range, tree identifier)
9635 member = finish_class_member_access_expr (range, identifier,
9636 false, tf_warning_or_error);
9637 if (member == error_mark_node)
9638 return error_mark_node;
9640 vec = make_tree_vector ();
9641 res = finish_call_expr (member, &vec,
9642 /*disallow_virtual=*/false,
9644 tf_warning_or_error);
9645 release_tree_vector (vec);
9649 /* Parse an iteration-statement.
9651 iteration-statement:
9652 while ( condition ) statement
9653 do statement while ( expression ) ;
9654 for ( for-init-statement condition [opt] ; expression [opt] )
9657 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9660 cp_parser_iteration_statement (cp_parser* parser)
9665 unsigned char in_statement;
9667 /* Peek at the next token. */
9668 token = cp_parser_require (parser, CPP_KEYWORD, RT_INTERATION);
9670 return error_mark_node;
9672 /* Remember whether or not we are already within an iteration
9674 in_statement = parser->in_statement;
9676 /* See what kind of keyword it is. */
9677 keyword = token->keyword;
9684 /* Begin the while-statement. */
9685 statement = begin_while_stmt ();
9686 /* Look for the `('. */
9687 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
9688 /* Parse the condition. */
9689 condition = cp_parser_condition (parser);
9690 finish_while_stmt_cond (condition, statement);
9691 /* Look for the `)'. */
9692 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
9693 /* Parse the dependent statement. */
9694 parser->in_statement = IN_ITERATION_STMT;
9695 cp_parser_already_scoped_statement (parser);
9696 parser->in_statement = in_statement;
9697 /* We're done with the while-statement. */
9698 finish_while_stmt (statement);
9706 /* Begin the do-statement. */
9707 statement = begin_do_stmt ();
9708 /* Parse the body of the do-statement. */
9709 parser->in_statement = IN_ITERATION_STMT;
9710 cp_parser_implicitly_scoped_statement (parser, NULL);
9711 parser->in_statement = in_statement;
9712 finish_do_body (statement);
9713 /* Look for the `while' keyword. */
9714 cp_parser_require_keyword (parser, RID_WHILE, RT_WHILE);
9715 /* Look for the `('. */
9716 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
9717 /* Parse the expression. */
9718 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9719 /* We're done with the do-statement. */
9720 finish_do_stmt (expression, statement);
9721 /* Look for the `)'. */
9722 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
9723 /* Look for the `;'. */
9724 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9730 /* Look for the `('. */
9731 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
9733 statement = cp_parser_for (parser);
9735 /* Look for the `)'. */
9736 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
9738 /* Parse the body of the for-statement. */
9739 parser->in_statement = IN_ITERATION_STMT;
9740 cp_parser_already_scoped_statement (parser);
9741 parser->in_statement = in_statement;
9743 /* We're done with the for-statement. */
9744 finish_for_stmt (statement);
9749 cp_parser_error (parser, "expected iteration-statement");
9750 statement = error_mark_node;
9757 /* Parse a for-init-statement or the declarator of a range-based-for.
9758 Returns true if a range-based-for declaration is seen.
9761 expression-statement
9762 simple-declaration */
9765 cp_parser_for_init_statement (cp_parser* parser, tree *decl)
9767 /* If the next token is a `;', then we have an empty
9768 expression-statement. Grammatically, this is also a
9769 simple-declaration, but an invalid one, because it does not
9770 declare anything. Therefore, if we did not handle this case
9771 specially, we would issue an error message about an invalid
9773 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9775 bool is_range_for = false;
9776 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
9778 parser->colon_corrects_to_scope_p = false;
9780 /* We're going to speculatively look for a declaration, falling back
9781 to an expression, if necessary. */
9782 cp_parser_parse_tentatively (parser);
9783 /* Parse the declaration. */
9784 cp_parser_simple_declaration (parser,
9785 /*function_definition_allowed_p=*/false,
9787 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
9788 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
9790 /* It is a range-for, consume the ':' */
9791 cp_lexer_consume_token (parser->lexer);
9792 is_range_for = true;
9793 if (cxx_dialect < cxx0x)
9795 error_at (cp_lexer_peek_token (parser->lexer)->location,
9796 "range-based %<for%> loops are not allowed "
9798 *decl = error_mark_node;
9802 /* The ';' is not consumed yet because we told
9803 cp_parser_simple_declaration not to. */
9804 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9806 if (cp_parser_parse_definitely (parser))
9807 return is_range_for;
9808 /* If the tentative parse failed, then we shall need to look for an
9809 expression-statement. */
9811 /* If we are here, it is an expression-statement. */
9812 cp_parser_expression_statement (parser, NULL_TREE);
9816 /* Parse a jump-statement.
9821 return expression [opt] ;
9822 return braced-init-list ;
9830 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9833 cp_parser_jump_statement (cp_parser* parser)
9835 tree statement = error_mark_node;
9838 unsigned char in_statement;
9840 /* Peek at the next token. */
9841 token = cp_parser_require (parser, CPP_KEYWORD, RT_JUMP);
9843 return error_mark_node;
9845 /* See what kind of keyword it is. */
9846 keyword = token->keyword;
9850 in_statement = parser->in_statement & ~IN_IF_STMT;
9851 switch (in_statement)
9854 error_at (token->location, "break statement not within loop or switch");
9857 gcc_assert ((in_statement & IN_SWITCH_STMT)
9858 || in_statement == IN_ITERATION_STMT);
9859 statement = finish_break_stmt ();
9862 error_at (token->location, "invalid exit from OpenMP structured block");
9865 error_at (token->location, "break statement used with OpenMP for loop");
9868 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9872 switch (parser->in_statement & ~(IN_SWITCH_STMT | IN_IF_STMT))
9875 error_at (token->location, "continue statement not within a loop");
9877 case IN_ITERATION_STMT:
9879 statement = finish_continue_stmt ();
9882 error_at (token->location, "invalid exit from OpenMP structured block");
9887 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9893 bool expr_non_constant_p;
9895 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9897 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
9898 expr = cp_parser_braced_list (parser, &expr_non_constant_p);
9900 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
9901 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
9903 /* If the next token is a `;', then there is no
9906 /* Build the return-statement. */
9907 statement = finish_return_stmt (expr);
9908 /* Look for the final `;'. */
9909 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9914 /* Create the goto-statement. */
9915 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
9917 /* Issue a warning about this use of a GNU extension. */
9918 pedwarn (token->location, OPT_pedantic, "ISO C++ forbids computed gotos");
9919 /* Consume the '*' token. */
9920 cp_lexer_consume_token (parser->lexer);
9921 /* Parse the dependent expression. */
9922 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false, NULL));
9925 finish_goto_stmt (cp_parser_identifier (parser));
9926 /* Look for the final `;'. */
9927 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
9931 cp_parser_error (parser, "expected jump-statement");
9938 /* Parse a declaration-statement.
9940 declaration-statement:
9941 block-declaration */
9944 cp_parser_declaration_statement (cp_parser* parser)
9948 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9949 p = obstack_alloc (&declarator_obstack, 0);
9951 /* Parse the block-declaration. */
9952 cp_parser_block_declaration (parser, /*statement_p=*/true);
9954 /* Free any declarators allocated. */
9955 obstack_free (&declarator_obstack, p);
9957 /* Finish off the statement. */
9961 /* Some dependent statements (like `if (cond) statement'), are
9962 implicitly in their own scope. In other words, if the statement is
9963 a single statement (as opposed to a compound-statement), it is
9964 none-the-less treated as if it were enclosed in braces. Any
9965 declarations appearing in the dependent statement are out of scope
9966 after control passes that point. This function parses a statement,
9967 but ensures that is in its own scope, even if it is not a
9970 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9971 is a (possibly labeled) if statement which is not enclosed in
9972 braces and has an else clause. This is used to implement
9975 Returns the new statement. */
9978 cp_parser_implicitly_scoped_statement (cp_parser* parser, bool *if_p)
9985 /* Mark if () ; with a special NOP_EXPR. */
9986 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
9988 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
9989 cp_lexer_consume_token (parser->lexer);
9990 statement = add_stmt (build_empty_stmt (loc));
9992 /* if a compound is opened, we simply parse the statement directly. */
9993 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
9994 statement = cp_parser_compound_statement (parser, NULL, false, false);
9995 /* If the token is not a `{', then we must take special action. */
9998 /* Create a compound-statement. */
9999 statement = begin_compound_stmt (0);
10000 /* Parse the dependent-statement. */
10001 cp_parser_statement (parser, NULL_TREE, false, if_p);
10002 /* Finish the dummy compound-statement. */
10003 finish_compound_stmt (statement);
10006 /* Return the statement. */
10010 /* For some dependent statements (like `while (cond) statement'), we
10011 have already created a scope. Therefore, even if the dependent
10012 statement is a compound-statement, we do not want to create another
10016 cp_parser_already_scoped_statement (cp_parser* parser)
10018 /* If the token is a `{', then we must take special action. */
10019 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
10020 cp_parser_statement (parser, NULL_TREE, false, NULL);
10023 /* Avoid calling cp_parser_compound_statement, so that we
10024 don't create a new scope. Do everything else by hand. */
10025 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
10026 /* If the next keyword is `__label__' we have a label declaration. */
10027 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_LABEL))
10028 cp_parser_label_declaration (parser);
10029 /* Parse an (optional) statement-seq. */
10030 cp_parser_statement_seq_opt (parser, NULL_TREE);
10031 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
10035 /* Declarations [gram.dcl.dcl] */
10037 /* Parse an optional declaration-sequence.
10041 declaration-seq declaration */
10044 cp_parser_declaration_seq_opt (cp_parser* parser)
10050 token = cp_lexer_peek_token (parser->lexer);
10052 if (token->type == CPP_CLOSE_BRACE
10053 || token->type == CPP_EOF
10054 || token->type == CPP_PRAGMA_EOL)
10057 if (token->type == CPP_SEMICOLON)
10059 /* A declaration consisting of a single semicolon is
10060 invalid. Allow it unless we're being pedantic. */
10061 cp_lexer_consume_token (parser->lexer);
10062 if (!in_system_header)
10063 pedwarn (input_location, OPT_pedantic, "extra %<;%>");
10067 /* If we're entering or exiting a region that's implicitly
10068 extern "C", modify the lang context appropriately. */
10069 if (!parser->implicit_extern_c && token->implicit_extern_c)
10071 push_lang_context (lang_name_c);
10072 parser->implicit_extern_c = true;
10074 else if (parser->implicit_extern_c && !token->implicit_extern_c)
10076 pop_lang_context ();
10077 parser->implicit_extern_c = false;
10080 if (token->type == CPP_PRAGMA)
10082 /* A top-level declaration can consist solely of a #pragma.
10083 A nested declaration cannot, so this is done here and not
10084 in cp_parser_declaration. (A #pragma at block scope is
10085 handled in cp_parser_statement.) */
10086 cp_parser_pragma (parser, pragma_external);
10090 /* Parse the declaration itself. */
10091 cp_parser_declaration (parser);
10095 /* Parse a declaration.
10099 function-definition
10100 template-declaration
10101 explicit-instantiation
10102 explicit-specialization
10103 linkage-specification
10104 namespace-definition
10109 __extension__ declaration */
10112 cp_parser_declaration (cp_parser* parser)
10116 int saved_pedantic;
10118 tree attributes = NULL_TREE;
10120 /* Check for the `__extension__' keyword. */
10121 if (cp_parser_extension_opt (parser, &saved_pedantic))
10123 /* Parse the qualified declaration. */
10124 cp_parser_declaration (parser);
10125 /* Restore the PEDANTIC flag. */
10126 pedantic = saved_pedantic;
10131 /* Try to figure out what kind of declaration is present. */
10132 token1 = *cp_lexer_peek_token (parser->lexer);
10134 if (token1.type != CPP_EOF)
10135 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
10138 token2.type = CPP_EOF;
10139 token2.keyword = RID_MAX;
10142 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10143 p = obstack_alloc (&declarator_obstack, 0);
10145 /* If the next token is `extern' and the following token is a string
10146 literal, then we have a linkage specification. */
10147 if (token1.keyword == RID_EXTERN
10148 && cp_parser_is_pure_string_literal (&token2))
10149 cp_parser_linkage_specification (parser);
10150 /* If the next token is `template', then we have either a template
10151 declaration, an explicit instantiation, or an explicit
10153 else if (token1.keyword == RID_TEMPLATE)
10155 /* `template <>' indicates a template specialization. */
10156 if (token2.type == CPP_LESS
10157 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
10158 cp_parser_explicit_specialization (parser);
10159 /* `template <' indicates a template declaration. */
10160 else if (token2.type == CPP_LESS)
10161 cp_parser_template_declaration (parser, /*member_p=*/false);
10162 /* Anything else must be an explicit instantiation. */
10164 cp_parser_explicit_instantiation (parser);
10166 /* If the next token is `export', then we have a template
10168 else if (token1.keyword == RID_EXPORT)
10169 cp_parser_template_declaration (parser, /*member_p=*/false);
10170 /* If the next token is `extern', 'static' or 'inline' and the one
10171 after that is `template', we have a GNU extended explicit
10172 instantiation directive. */
10173 else if (cp_parser_allow_gnu_extensions_p (parser)
10174 && (token1.keyword == RID_EXTERN
10175 || token1.keyword == RID_STATIC
10176 || token1.keyword == RID_INLINE)
10177 && token2.keyword == RID_TEMPLATE)
10178 cp_parser_explicit_instantiation (parser);
10179 /* If the next token is `namespace', check for a named or unnamed
10180 namespace definition. */
10181 else if (token1.keyword == RID_NAMESPACE
10182 && (/* A named namespace definition. */
10183 (token2.type == CPP_NAME
10184 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
10186 /* An unnamed namespace definition. */
10187 || token2.type == CPP_OPEN_BRACE
10188 || token2.keyword == RID_ATTRIBUTE))
10189 cp_parser_namespace_definition (parser);
10190 /* An inline (associated) namespace definition. */
10191 else if (token1.keyword == RID_INLINE
10192 && token2.keyword == RID_NAMESPACE)
10193 cp_parser_namespace_definition (parser);
10194 /* Objective-C++ declaration/definition. */
10195 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
10196 cp_parser_objc_declaration (parser, NULL_TREE);
10197 else if (c_dialect_objc ()
10198 && token1.keyword == RID_ATTRIBUTE
10199 && cp_parser_objc_valid_prefix_attributes (parser, &attributes))
10200 cp_parser_objc_declaration (parser, attributes);
10201 /* We must have either a block declaration or a function
10204 /* Try to parse a block-declaration, or a function-definition. */
10205 cp_parser_block_declaration (parser, /*statement_p=*/false);
10207 /* Free any declarators allocated. */
10208 obstack_free (&declarator_obstack, p);
10211 /* Parse a block-declaration.
10216 namespace-alias-definition
10223 __extension__ block-declaration
10228 static_assert-declaration
10230 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10231 part of a declaration-statement. */
10234 cp_parser_block_declaration (cp_parser *parser,
10238 int saved_pedantic;
10240 /* Check for the `__extension__' keyword. */
10241 if (cp_parser_extension_opt (parser, &saved_pedantic))
10243 /* Parse the qualified declaration. */
10244 cp_parser_block_declaration (parser, statement_p);
10245 /* Restore the PEDANTIC flag. */
10246 pedantic = saved_pedantic;
10251 /* Peek at the next token to figure out which kind of declaration is
10253 token1 = cp_lexer_peek_token (parser->lexer);
10255 /* If the next keyword is `asm', we have an asm-definition. */
10256 if (token1->keyword == RID_ASM)
10259 cp_parser_commit_to_tentative_parse (parser);
10260 cp_parser_asm_definition (parser);
10262 /* If the next keyword is `namespace', we have a
10263 namespace-alias-definition. */
10264 else if (token1->keyword == RID_NAMESPACE)
10265 cp_parser_namespace_alias_definition (parser);
10266 /* If the next keyword is `using', we have a
10267 using-declaration, a using-directive, or an alias-declaration. */
10268 else if (token1->keyword == RID_USING)
10273 cp_parser_commit_to_tentative_parse (parser);
10274 /* If the token after `using' is `namespace', then we have a
10275 using-directive. */
10276 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
10277 if (token2->keyword == RID_NAMESPACE)
10278 cp_parser_using_directive (parser);
10279 /* If the second token after 'using' is '=', then we have an
10280 alias-declaration. */
10281 else if (cxx_dialect >= cxx0x
10282 && token2->type == CPP_NAME
10283 && ((cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_EQ)
10284 || (cp_lexer_peek_nth_token (parser->lexer, 3)->keyword
10285 == RID_ATTRIBUTE)))
10286 cp_parser_alias_declaration (parser);
10287 /* Otherwise, it's a using-declaration. */
10289 cp_parser_using_declaration (parser,
10290 /*access_declaration_p=*/false);
10292 /* If the next keyword is `__label__' we have a misplaced label
10294 else if (token1->keyword == RID_LABEL)
10296 cp_lexer_consume_token (parser->lexer);
10297 error_at (token1->location, "%<__label__%> not at the beginning of a block");
10298 cp_parser_skip_to_end_of_statement (parser);
10299 /* If the next token is now a `;', consume it. */
10300 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
10301 cp_lexer_consume_token (parser->lexer);
10303 /* If the next token is `static_assert' we have a static assertion. */
10304 else if (token1->keyword == RID_STATIC_ASSERT)
10305 cp_parser_static_assert (parser, /*member_p=*/false);
10306 /* Anything else must be a simple-declaration. */
10308 cp_parser_simple_declaration (parser, !statement_p,
10309 /*maybe_range_for_decl*/NULL);
10312 /* Parse a simple-declaration.
10314 simple-declaration:
10315 decl-specifier-seq [opt] init-declarator-list [opt] ;
10317 init-declarator-list:
10319 init-declarator-list , init-declarator
10321 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10322 function-definition as a simple-declaration.
10324 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10325 parsed declaration if it is an uninitialized single declarator not followed
10326 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10327 if present, will not be consumed. */
10330 cp_parser_simple_declaration (cp_parser* parser,
10331 bool function_definition_allowed_p,
10332 tree *maybe_range_for_decl)
10334 cp_decl_specifier_seq decl_specifiers;
10335 int declares_class_or_enum;
10336 bool saw_declarator;
10338 if (maybe_range_for_decl)
10339 *maybe_range_for_decl = NULL_TREE;
10341 /* Defer access checks until we know what is being declared; the
10342 checks for names appearing in the decl-specifier-seq should be
10343 done as if we were in the scope of the thing being declared. */
10344 push_deferring_access_checks (dk_deferred);
10346 /* Parse the decl-specifier-seq. We have to keep track of whether
10347 or not the decl-specifier-seq declares a named class or
10348 enumeration type, since that is the only case in which the
10349 init-declarator-list is allowed to be empty.
10353 In a simple-declaration, the optional init-declarator-list can be
10354 omitted only when declaring a class or enumeration, that is when
10355 the decl-specifier-seq contains either a class-specifier, an
10356 elaborated-type-specifier, or an enum-specifier. */
10357 cp_parser_decl_specifier_seq (parser,
10358 CP_PARSER_FLAGS_OPTIONAL,
10360 &declares_class_or_enum);
10361 /* We no longer need to defer access checks. */
10362 stop_deferring_access_checks ();
10364 /* In a block scope, a valid declaration must always have a
10365 decl-specifier-seq. By not trying to parse declarators, we can
10366 resolve the declaration/expression ambiguity more quickly. */
10367 if (!function_definition_allowed_p
10368 && !decl_specifiers.any_specifiers_p)
10370 cp_parser_error (parser, "expected declaration");
10374 /* If the next two tokens are both identifiers, the code is
10375 erroneous. The usual cause of this situation is code like:
10379 where "T" should name a type -- but does not. */
10380 if (!decl_specifiers.any_type_specifiers_p
10381 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
10383 /* If parsing tentatively, we should commit; we really are
10384 looking at a declaration. */
10385 cp_parser_commit_to_tentative_parse (parser);
10390 /* If we have seen at least one decl-specifier, and the next token
10391 is not a parenthesis, then we must be looking at a declaration.
10392 (After "int (" we might be looking at a functional cast.) */
10393 if (decl_specifiers.any_specifiers_p
10394 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN)
10395 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
10396 && !cp_parser_error_occurred (parser))
10397 cp_parser_commit_to_tentative_parse (parser);
10399 /* Keep going until we hit the `;' at the end of the simple
10401 saw_declarator = false;
10402 while (cp_lexer_next_token_is_not (parser->lexer,
10406 bool function_definition_p;
10409 if (saw_declarator)
10411 /* If we are processing next declarator, coma is expected */
10412 token = cp_lexer_peek_token (parser->lexer);
10413 gcc_assert (token->type == CPP_COMMA);
10414 cp_lexer_consume_token (parser->lexer);
10415 if (maybe_range_for_decl)
10416 *maybe_range_for_decl = error_mark_node;
10419 saw_declarator = true;
10421 /* Parse the init-declarator. */
10422 decl = cp_parser_init_declarator (parser, &decl_specifiers,
10424 function_definition_allowed_p,
10425 /*member_p=*/false,
10426 declares_class_or_enum,
10427 &function_definition_p,
10428 maybe_range_for_decl);
10429 /* If an error occurred while parsing tentatively, exit quickly.
10430 (That usually happens when in the body of a function; each
10431 statement is treated as a declaration-statement until proven
10433 if (cp_parser_error_occurred (parser))
10435 /* Handle function definitions specially. */
10436 if (function_definition_p)
10438 /* If the next token is a `,', then we are probably
10439 processing something like:
10443 which is erroneous. */
10444 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
10446 cp_token *token = cp_lexer_peek_token (parser->lexer);
10447 error_at (token->location,
10449 " declarations and function-definitions is forbidden");
10451 /* Otherwise, we're done with the list of declarators. */
10454 pop_deferring_access_checks ();
10458 if (maybe_range_for_decl && *maybe_range_for_decl == NULL_TREE)
10459 *maybe_range_for_decl = decl;
10460 /* The next token should be either a `,' or a `;'. */
10461 token = cp_lexer_peek_token (parser->lexer);
10462 /* If it's a `,', there are more declarators to come. */
10463 if (token->type == CPP_COMMA)
10464 /* will be consumed next time around */;
10465 /* If it's a `;', we are done. */
10466 else if (token->type == CPP_SEMICOLON || maybe_range_for_decl)
10468 /* Anything else is an error. */
10471 /* If we have already issued an error message we don't need
10472 to issue another one. */
10473 if (decl != error_mark_node
10474 || cp_parser_uncommitted_to_tentative_parse_p (parser))
10475 cp_parser_error (parser, "expected %<,%> or %<;%>");
10476 /* Skip tokens until we reach the end of the statement. */
10477 cp_parser_skip_to_end_of_statement (parser);
10478 /* If the next token is now a `;', consume it. */
10479 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
10480 cp_lexer_consume_token (parser->lexer);
10483 /* After the first time around, a function-definition is not
10484 allowed -- even if it was OK at first. For example:
10489 function_definition_allowed_p = false;
10492 /* Issue an error message if no declarators are present, and the
10493 decl-specifier-seq does not itself declare a class or
10495 if (!saw_declarator)
10497 if (cp_parser_declares_only_class_p (parser))
10498 shadow_tag (&decl_specifiers);
10499 /* Perform any deferred access checks. */
10500 perform_deferred_access_checks ();
10503 /* Consume the `;'. */
10504 if (!maybe_range_for_decl)
10505 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
10508 pop_deferring_access_checks ();
10511 /* Parse a decl-specifier-seq.
10513 decl-specifier-seq:
10514 decl-specifier-seq [opt] decl-specifier
10517 storage-class-specifier
10528 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10530 The parser flags FLAGS is used to control type-specifier parsing.
10532 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10535 1: one of the decl-specifiers is an elaborated-type-specifier
10536 (i.e., a type declaration)
10537 2: one of the decl-specifiers is an enum-specifier or a
10538 class-specifier (i.e., a type definition)
10543 cp_parser_decl_specifier_seq (cp_parser* parser,
10544 cp_parser_flags flags,
10545 cp_decl_specifier_seq *decl_specs,
10546 int* declares_class_or_enum)
10548 bool constructor_possible_p = !parser->in_declarator_p;
10549 cp_token *start_token = NULL;
10551 /* Clear DECL_SPECS. */
10552 clear_decl_specs (decl_specs);
10554 /* Assume no class or enumeration type is declared. */
10555 *declares_class_or_enum = 0;
10557 /* Keep reading specifiers until there are no more to read. */
10560 bool constructor_p;
10561 bool found_decl_spec;
10564 /* Peek at the next token. */
10565 token = cp_lexer_peek_token (parser->lexer);
10567 /* Save the first token of the decl spec list for error
10570 start_token = token;
10571 /* Handle attributes. */
10572 if (token->keyword == RID_ATTRIBUTE)
10574 /* Parse the attributes. */
10575 decl_specs->attributes
10576 = chainon (decl_specs->attributes,
10577 cp_parser_attributes_opt (parser));
10580 /* Assume we will find a decl-specifier keyword. */
10581 found_decl_spec = true;
10582 /* If the next token is an appropriate keyword, we can simply
10583 add it to the list. */
10584 switch (token->keyword)
10590 if (!at_class_scope_p ())
10592 error_at (token->location, "%<friend%> used outside of class");
10593 cp_lexer_purge_token (parser->lexer);
10597 ++decl_specs->specs[(int) ds_friend];
10598 /* Consume the token. */
10599 cp_lexer_consume_token (parser->lexer);
10603 case RID_CONSTEXPR:
10604 ++decl_specs->specs[(int) ds_constexpr];
10605 cp_lexer_consume_token (parser->lexer);
10608 /* function-specifier:
10615 cp_parser_function_specifier_opt (parser, decl_specs);
10621 ++decl_specs->specs[(int) ds_typedef];
10622 /* Consume the token. */
10623 cp_lexer_consume_token (parser->lexer);
10624 /* A constructor declarator cannot appear in a typedef. */
10625 constructor_possible_p = false;
10626 /* The "typedef" keyword can only occur in a declaration; we
10627 may as well commit at this point. */
10628 cp_parser_commit_to_tentative_parse (parser);
10630 if (decl_specs->storage_class != sc_none)
10631 decl_specs->conflicting_specifiers_p = true;
10634 /* storage-class-specifier:
10644 if (cxx_dialect == cxx98)
10646 /* Consume the token. */
10647 cp_lexer_consume_token (parser->lexer);
10649 /* Complain about `auto' as a storage specifier, if
10650 we're complaining about C++0x compatibility. */
10651 warning_at (token->location, OPT_Wc__0x_compat, "%<auto%>"
10652 " changes meaning in C++11; please remove it");
10654 /* Set the storage class anyway. */
10655 cp_parser_set_storage_class (parser, decl_specs, RID_AUTO,
10659 /* C++0x auto type-specifier. */
10660 found_decl_spec = false;
10667 /* Consume the token. */
10668 cp_lexer_consume_token (parser->lexer);
10669 cp_parser_set_storage_class (parser, decl_specs, token->keyword,
10673 /* Consume the token. */
10674 cp_lexer_consume_token (parser->lexer);
10675 ++decl_specs->specs[(int) ds_thread];
10679 /* We did not yet find a decl-specifier yet. */
10680 found_decl_spec = false;
10684 if (found_decl_spec
10685 && (flags & CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR)
10686 && token->keyword != RID_CONSTEXPR)
10687 error ("decl-specifier invalid in condition");
10689 /* Constructors are a special case. The `S' in `S()' is not a
10690 decl-specifier; it is the beginning of the declarator. */
10692 = (!found_decl_spec
10693 && constructor_possible_p
10694 && (cp_parser_constructor_declarator_p
10695 (parser, decl_specs->specs[(int) ds_friend] != 0)));
10697 /* If we don't have a DECL_SPEC yet, then we must be looking at
10698 a type-specifier. */
10699 if (!found_decl_spec && !constructor_p)
10701 int decl_spec_declares_class_or_enum;
10702 bool is_cv_qualifier;
10706 = cp_parser_type_specifier (parser, flags,
10708 /*is_declaration=*/true,
10709 &decl_spec_declares_class_or_enum,
10711 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
10713 /* If this type-specifier referenced a user-defined type
10714 (a typedef, class-name, etc.), then we can't allow any
10715 more such type-specifiers henceforth.
10719 The longest sequence of decl-specifiers that could
10720 possibly be a type name is taken as the
10721 decl-specifier-seq of a declaration. The sequence shall
10722 be self-consistent as described below.
10726 As a general rule, at most one type-specifier is allowed
10727 in the complete decl-specifier-seq of a declaration. The
10728 only exceptions are the following:
10730 -- const or volatile can be combined with any other
10733 -- signed or unsigned can be combined with char, long,
10741 void g (const int Pc);
10743 Here, Pc is *not* part of the decl-specifier seq; it's
10744 the declarator. Therefore, once we see a type-specifier
10745 (other than a cv-qualifier), we forbid any additional
10746 user-defined types. We *do* still allow things like `int
10747 int' to be considered a decl-specifier-seq, and issue the
10748 error message later. */
10749 if (type_spec && !is_cv_qualifier)
10750 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
10751 /* A constructor declarator cannot follow a type-specifier. */
10754 constructor_possible_p = false;
10755 found_decl_spec = true;
10756 if (!is_cv_qualifier)
10757 decl_specs->any_type_specifiers_p = true;
10761 /* If we still do not have a DECL_SPEC, then there are no more
10762 decl-specifiers. */
10763 if (!found_decl_spec)
10766 decl_specs->any_specifiers_p = true;
10767 /* After we see one decl-specifier, further decl-specifiers are
10768 always optional. */
10769 flags |= CP_PARSER_FLAGS_OPTIONAL;
10772 cp_parser_check_decl_spec (decl_specs, start_token->location);
10774 /* Don't allow a friend specifier with a class definition. */
10775 if (decl_specs->specs[(int) ds_friend] != 0
10776 && (*declares_class_or_enum & 2))
10777 error_at (start_token->location,
10778 "class definition may not be declared a friend");
10781 /* Parse an (optional) storage-class-specifier.
10783 storage-class-specifier:
10792 storage-class-specifier:
10795 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10798 cp_parser_storage_class_specifier_opt (cp_parser* parser)
10800 switch (cp_lexer_peek_token (parser->lexer)->keyword)
10803 if (cxx_dialect != cxx98)
10805 /* Fall through for C++98. */
10812 /* Consume the token. */
10813 return cp_lexer_consume_token (parser->lexer)->u.value;
10820 /* Parse an (optional) function-specifier.
10822 function-specifier:
10827 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10828 Updates DECL_SPECS, if it is non-NULL. */
10831 cp_parser_function_specifier_opt (cp_parser* parser,
10832 cp_decl_specifier_seq *decl_specs)
10834 cp_token *token = cp_lexer_peek_token (parser->lexer);
10835 switch (token->keyword)
10839 ++decl_specs->specs[(int) ds_inline];
10843 /* 14.5.2.3 [temp.mem]
10845 A member function template shall not be virtual. */
10846 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
10847 error_at (token->location, "templates may not be %<virtual%>");
10848 else if (decl_specs)
10849 ++decl_specs->specs[(int) ds_virtual];
10854 ++decl_specs->specs[(int) ds_explicit];
10861 /* Consume the token. */
10862 return cp_lexer_consume_token (parser->lexer)->u.value;
10865 /* Parse a linkage-specification.
10867 linkage-specification:
10868 extern string-literal { declaration-seq [opt] }
10869 extern string-literal declaration */
10872 cp_parser_linkage_specification (cp_parser* parser)
10876 /* Look for the `extern' keyword. */
10877 cp_parser_require_keyword (parser, RID_EXTERN, RT_EXTERN);
10879 /* Look for the string-literal. */
10880 linkage = cp_parser_string_literal (parser, false, false);
10882 /* Transform the literal into an identifier. If the literal is a
10883 wide-character string, or contains embedded NULs, then we can't
10884 handle it as the user wants. */
10885 if (strlen (TREE_STRING_POINTER (linkage))
10886 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
10888 cp_parser_error (parser, "invalid linkage-specification");
10889 /* Assume C++ linkage. */
10890 linkage = lang_name_cplusplus;
10893 linkage = get_identifier (TREE_STRING_POINTER (linkage));
10895 /* We're now using the new linkage. */
10896 push_lang_context (linkage);
10898 /* If the next token is a `{', then we're using the first
10900 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
10902 /* Consume the `{' token. */
10903 cp_lexer_consume_token (parser->lexer);
10904 /* Parse the declarations. */
10905 cp_parser_declaration_seq_opt (parser);
10906 /* Look for the closing `}'. */
10907 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
10909 /* Otherwise, there's just one declaration. */
10912 bool saved_in_unbraced_linkage_specification_p;
10914 saved_in_unbraced_linkage_specification_p
10915 = parser->in_unbraced_linkage_specification_p;
10916 parser->in_unbraced_linkage_specification_p = true;
10917 cp_parser_declaration (parser);
10918 parser->in_unbraced_linkage_specification_p
10919 = saved_in_unbraced_linkage_specification_p;
10922 /* We're done with the linkage-specification. */
10923 pop_lang_context ();
10926 /* Parse a static_assert-declaration.
10928 static_assert-declaration:
10929 static_assert ( constant-expression , string-literal ) ;
10931 If MEMBER_P, this static_assert is a class member. */
10934 cp_parser_static_assert(cp_parser *parser, bool member_p)
10939 location_t saved_loc;
10942 /* Peek at the `static_assert' token so we can keep track of exactly
10943 where the static assertion started. */
10944 token = cp_lexer_peek_token (parser->lexer);
10945 saved_loc = token->location;
10947 /* Look for the `static_assert' keyword. */
10948 if (!cp_parser_require_keyword (parser, RID_STATIC_ASSERT,
10952 /* We know we are in a static assertion; commit to any tentative
10954 if (cp_parser_parsing_tentatively (parser))
10955 cp_parser_commit_to_tentative_parse (parser);
10957 /* Parse the `(' starting the static assertion condition. */
10958 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
10960 /* Parse the constant-expression. Allow a non-constant expression
10961 here in order to give better diagnostics in finish_static_assert. */
10963 cp_parser_constant_expression (parser,
10964 /*allow_non_constant_p=*/true,
10965 /*non_constant_p=*/&dummy);
10967 /* Parse the separating `,'. */
10968 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
10970 /* Parse the string-literal message. */
10971 message = cp_parser_string_literal (parser,
10972 /*translate=*/false,
10975 /* A `)' completes the static assertion. */
10976 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
10977 cp_parser_skip_to_closing_parenthesis (parser,
10978 /*recovering=*/true,
10979 /*or_comma=*/false,
10980 /*consume_paren=*/true);
10982 /* A semicolon terminates the declaration. */
10983 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
10985 /* Complete the static assertion, which may mean either processing
10986 the static assert now or saving it for template instantiation. */
10987 finish_static_assert (condition, message, saved_loc, member_p);
10990 /* Parse a `decltype' type. Returns the type.
10992 simple-type-specifier:
10993 decltype ( expression ) */
10996 cp_parser_decltype (cp_parser *parser)
10999 bool id_expression_or_member_access_p = false;
11000 const char *saved_message;
11001 bool saved_integral_constant_expression_p;
11002 bool saved_non_integral_constant_expression_p;
11003 cp_token *id_expr_start_token;
11004 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
11006 if (start_token->type == CPP_DECLTYPE)
11008 /* Already parsed. */
11009 cp_lexer_consume_token (parser->lexer);
11010 return start_token->u.value;
11013 /* Look for the `decltype' token. */
11014 if (!cp_parser_require_keyword (parser, RID_DECLTYPE, RT_DECLTYPE))
11015 return error_mark_node;
11017 /* Types cannot be defined in a `decltype' expression. Save away the
11019 saved_message = parser->type_definition_forbidden_message;
11021 /* And create the new one. */
11022 parser->type_definition_forbidden_message
11023 = G_("types may not be defined in %<decltype%> expressions");
11025 /* The restrictions on constant-expressions do not apply inside
11026 decltype expressions. */
11027 saved_integral_constant_expression_p
11028 = parser->integral_constant_expression_p;
11029 saved_non_integral_constant_expression_p
11030 = parser->non_integral_constant_expression_p;
11031 parser->integral_constant_expression_p = false;
11033 /* Do not actually evaluate the expression. */
11034 ++cp_unevaluated_operand;
11036 /* Do not warn about problems with the expression. */
11037 ++c_inhibit_evaluation_warnings;
11039 /* Parse the opening `('. */
11040 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
11041 return error_mark_node;
11043 /* First, try parsing an id-expression. */
11044 id_expr_start_token = cp_lexer_peek_token (parser->lexer);
11045 cp_parser_parse_tentatively (parser);
11046 expr = cp_parser_id_expression (parser,
11047 /*template_keyword_p=*/false,
11048 /*check_dependency_p=*/true,
11049 /*template_p=*/NULL,
11050 /*declarator_p=*/false,
11051 /*optional_p=*/false);
11053 if (!cp_parser_error_occurred (parser) && expr != error_mark_node)
11055 bool non_integral_constant_expression_p = false;
11056 tree id_expression = expr;
11058 const char *error_msg;
11060 if (TREE_CODE (expr) == IDENTIFIER_NODE)
11061 /* Lookup the name we got back from the id-expression. */
11062 expr = cp_parser_lookup_name (parser, expr,
11064 /*is_template=*/false,
11065 /*is_namespace=*/false,
11066 /*check_dependency=*/true,
11067 /*ambiguous_decls=*/NULL,
11068 id_expr_start_token->location);
11071 && expr != error_mark_node
11072 && TREE_CODE (expr) != TEMPLATE_ID_EXPR
11073 && TREE_CODE (expr) != TYPE_DECL
11074 && (TREE_CODE (expr) != BIT_NOT_EXPR
11075 || !TYPE_P (TREE_OPERAND (expr, 0)))
11076 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
11078 /* Complete lookup of the id-expression. */
11079 expr = (finish_id_expression
11080 (id_expression, expr, parser->scope, &idk,
11081 /*integral_constant_expression_p=*/false,
11082 /*allow_non_integral_constant_expression_p=*/true,
11083 &non_integral_constant_expression_p,
11084 /*template_p=*/false,
11086 /*address_p=*/false,
11087 /*template_arg_p=*/false,
11089 id_expr_start_token->location));
11091 if (expr == error_mark_node)
11092 /* We found an id-expression, but it was something that we
11093 should not have found. This is an error, not something
11094 we can recover from, so note that we found an
11095 id-expression and we'll recover as gracefully as
11097 id_expression_or_member_access_p = true;
11101 && expr != error_mark_node
11102 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
11103 /* We have an id-expression. */
11104 id_expression_or_member_access_p = true;
11107 if (!id_expression_or_member_access_p)
11109 /* Abort the id-expression parse. */
11110 cp_parser_abort_tentative_parse (parser);
11112 /* Parsing tentatively, again. */
11113 cp_parser_parse_tentatively (parser);
11115 /* Parse a class member access. */
11116 expr = cp_parser_postfix_expression (parser, /*address_p=*/false,
11118 /*member_access_only_p=*/true, NULL);
11121 && expr != error_mark_node
11122 && cp_lexer_peek_token (parser->lexer)->type == CPP_CLOSE_PAREN)
11123 /* We have an id-expression. */
11124 id_expression_or_member_access_p = true;
11127 if (id_expression_or_member_access_p)
11128 /* We have parsed the complete id-expression or member access. */
11129 cp_parser_parse_definitely (parser);
11132 bool saved_greater_than_is_operator_p;
11134 /* Abort our attempt to parse an id-expression or member access
11136 cp_parser_abort_tentative_parse (parser);
11138 /* Within a parenthesized expression, a `>' token is always
11139 the greater-than operator. */
11140 saved_greater_than_is_operator_p
11141 = parser->greater_than_is_operator_p;
11142 parser->greater_than_is_operator_p = true;
11144 /* Parse a full expression. */
11145 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
11147 /* The `>' token might be the end of a template-id or
11148 template-parameter-list now. */
11149 parser->greater_than_is_operator_p
11150 = saved_greater_than_is_operator_p;
11153 /* Go back to evaluating expressions. */
11154 --cp_unevaluated_operand;
11155 --c_inhibit_evaluation_warnings;
11157 /* Restore the old message and the integral constant expression
11159 parser->type_definition_forbidden_message = saved_message;
11160 parser->integral_constant_expression_p
11161 = saved_integral_constant_expression_p;
11162 parser->non_integral_constant_expression_p
11163 = saved_non_integral_constant_expression_p;
11165 /* Parse to the closing `)'. */
11166 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
11168 cp_parser_skip_to_closing_parenthesis (parser, true, false,
11169 /*consume_paren=*/true);
11170 return error_mark_node;
11173 expr = finish_decltype_type (expr, id_expression_or_member_access_p,
11174 tf_warning_or_error);
11176 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11178 start_token->type = CPP_DECLTYPE;
11179 start_token->u.value = expr;
11180 start_token->keyword = RID_MAX;
11181 cp_lexer_purge_tokens_after (parser->lexer, start_token);
11186 /* Special member functions [gram.special] */
11188 /* Parse a conversion-function-id.
11190 conversion-function-id:
11191 operator conversion-type-id
11193 Returns an IDENTIFIER_NODE representing the operator. */
11196 cp_parser_conversion_function_id (cp_parser* parser)
11200 tree saved_qualifying_scope;
11201 tree saved_object_scope;
11202 tree pushed_scope = NULL_TREE;
11204 /* Look for the `operator' token. */
11205 if (!cp_parser_require_keyword (parser, RID_OPERATOR, RT_OPERATOR))
11206 return error_mark_node;
11207 /* When we parse the conversion-type-id, the current scope will be
11208 reset. However, we need that information in able to look up the
11209 conversion function later, so we save it here. */
11210 saved_scope = parser->scope;
11211 saved_qualifying_scope = parser->qualifying_scope;
11212 saved_object_scope = parser->object_scope;
11213 /* We must enter the scope of the class so that the names of
11214 entities declared within the class are available in the
11215 conversion-type-id. For example, consider:
11222 S::operator I() { ... }
11224 In order to see that `I' is a type-name in the definition, we
11225 must be in the scope of `S'. */
11227 pushed_scope = push_scope (saved_scope);
11228 /* Parse the conversion-type-id. */
11229 type = cp_parser_conversion_type_id (parser);
11230 /* Leave the scope of the class, if any. */
11232 pop_scope (pushed_scope);
11233 /* Restore the saved scope. */
11234 parser->scope = saved_scope;
11235 parser->qualifying_scope = saved_qualifying_scope;
11236 parser->object_scope = saved_object_scope;
11237 /* If the TYPE is invalid, indicate failure. */
11238 if (type == error_mark_node)
11239 return error_mark_node;
11240 return mangle_conv_op_name_for_type (type);
11243 /* Parse a conversion-type-id:
11245 conversion-type-id:
11246 type-specifier-seq conversion-declarator [opt]
11248 Returns the TYPE specified. */
11251 cp_parser_conversion_type_id (cp_parser* parser)
11254 cp_decl_specifier_seq type_specifiers;
11255 cp_declarator *declarator;
11256 tree type_specified;
11258 /* Parse the attributes. */
11259 attributes = cp_parser_attributes_opt (parser);
11260 /* Parse the type-specifiers. */
11261 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
11262 /*is_trailing_return=*/false,
11264 /* If that didn't work, stop. */
11265 if (type_specifiers.type == error_mark_node)
11266 return error_mark_node;
11267 /* Parse the conversion-declarator. */
11268 declarator = cp_parser_conversion_declarator_opt (parser);
11270 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
11271 /*initialized=*/0, &attributes);
11273 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
11275 /* Don't give this error when parsing tentatively. This happens to
11276 work because we always parse this definitively once. */
11277 if (! cp_parser_uncommitted_to_tentative_parse_p (parser)
11278 && type_uses_auto (type_specified))
11280 error ("invalid use of %<auto%> in conversion operator");
11281 return error_mark_node;
11284 return type_specified;
11287 /* Parse an (optional) conversion-declarator.
11289 conversion-declarator:
11290 ptr-operator conversion-declarator [opt]
11294 static cp_declarator *
11295 cp_parser_conversion_declarator_opt (cp_parser* parser)
11297 enum tree_code code;
11299 cp_cv_quals cv_quals;
11301 /* We don't know if there's a ptr-operator next, or not. */
11302 cp_parser_parse_tentatively (parser);
11303 /* Try the ptr-operator. */
11304 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
11305 /* If it worked, look for more conversion-declarators. */
11306 if (cp_parser_parse_definitely (parser))
11308 cp_declarator *declarator;
11310 /* Parse another optional declarator. */
11311 declarator = cp_parser_conversion_declarator_opt (parser);
11313 return cp_parser_make_indirect_declarator
11314 (code, class_type, cv_quals, declarator);
11320 /* Parse an (optional) ctor-initializer.
11323 : mem-initializer-list
11325 Returns TRUE iff the ctor-initializer was actually present. */
11328 cp_parser_ctor_initializer_opt (cp_parser* parser)
11330 /* If the next token is not a `:', then there is no
11331 ctor-initializer. */
11332 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
11334 /* Do default initialization of any bases and members. */
11335 if (DECL_CONSTRUCTOR_P (current_function_decl))
11336 finish_mem_initializers (NULL_TREE);
11341 /* Consume the `:' token. */
11342 cp_lexer_consume_token (parser->lexer);
11343 /* And the mem-initializer-list. */
11344 cp_parser_mem_initializer_list (parser);
11349 /* Parse a mem-initializer-list.
11351 mem-initializer-list:
11352 mem-initializer ... [opt]
11353 mem-initializer ... [opt] , mem-initializer-list */
11356 cp_parser_mem_initializer_list (cp_parser* parser)
11358 tree mem_initializer_list = NULL_TREE;
11359 tree target_ctor = error_mark_node;
11360 cp_token *token = cp_lexer_peek_token (parser->lexer);
11362 /* Let the semantic analysis code know that we are starting the
11363 mem-initializer-list. */
11364 if (!DECL_CONSTRUCTOR_P (current_function_decl))
11365 error_at (token->location,
11366 "only constructors take member initializers");
11368 /* Loop through the list. */
11371 tree mem_initializer;
11373 token = cp_lexer_peek_token (parser->lexer);
11374 /* Parse the mem-initializer. */
11375 mem_initializer = cp_parser_mem_initializer (parser);
11376 /* If the next token is a `...', we're expanding member initializers. */
11377 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11379 /* Consume the `...'. */
11380 cp_lexer_consume_token (parser->lexer);
11382 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11383 can be expanded but members cannot. */
11384 if (mem_initializer != error_mark_node
11385 && !TYPE_P (TREE_PURPOSE (mem_initializer)))
11387 error_at (token->location,
11388 "cannot expand initializer for member %<%D%>",
11389 TREE_PURPOSE (mem_initializer));
11390 mem_initializer = error_mark_node;
11393 /* Construct the pack expansion type. */
11394 if (mem_initializer != error_mark_node)
11395 mem_initializer = make_pack_expansion (mem_initializer);
11397 if (target_ctor != error_mark_node
11398 && mem_initializer != error_mark_node)
11400 error ("mem-initializer for %qD follows constructor delegation",
11401 TREE_PURPOSE (mem_initializer));
11402 mem_initializer = error_mark_node;
11404 /* Look for a target constructor. */
11405 if (mem_initializer != error_mark_node
11406 && TYPE_P (TREE_PURPOSE (mem_initializer))
11407 && same_type_p (TREE_PURPOSE (mem_initializer), current_class_type))
11409 maybe_warn_cpp0x (CPP0X_DELEGATING_CTORS);
11410 if (mem_initializer_list)
11412 error ("constructor delegation follows mem-initializer for %qD",
11413 TREE_PURPOSE (mem_initializer_list));
11414 mem_initializer = error_mark_node;
11416 target_ctor = mem_initializer;
11418 /* Add it to the list, unless it was erroneous. */
11419 if (mem_initializer != error_mark_node)
11421 TREE_CHAIN (mem_initializer) = mem_initializer_list;
11422 mem_initializer_list = mem_initializer;
11424 /* If the next token is not a `,', we're done. */
11425 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11427 /* Consume the `,' token. */
11428 cp_lexer_consume_token (parser->lexer);
11431 /* Perform semantic analysis. */
11432 if (DECL_CONSTRUCTOR_P (current_function_decl))
11433 finish_mem_initializers (mem_initializer_list);
11436 /* Parse a mem-initializer.
11439 mem-initializer-id ( expression-list [opt] )
11440 mem-initializer-id braced-init-list
11445 ( expression-list [opt] )
11447 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11448 class) or FIELD_DECL (for a non-static data member) to initialize;
11449 the TREE_VALUE is the expression-list. An empty initialization
11450 list is represented by void_list_node. */
11453 cp_parser_mem_initializer (cp_parser* parser)
11455 tree mem_initializer_id;
11456 tree expression_list;
11458 cp_token *token = cp_lexer_peek_token (parser->lexer);
11460 /* Find out what is being initialized. */
11461 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
11463 permerror (token->location,
11464 "anachronistic old-style base class initializer");
11465 mem_initializer_id = NULL_TREE;
11469 mem_initializer_id = cp_parser_mem_initializer_id (parser);
11470 if (mem_initializer_id == error_mark_node)
11471 return mem_initializer_id;
11473 member = expand_member_init (mem_initializer_id);
11474 if (member && !DECL_P (member))
11475 in_base_initializer = 1;
11477 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11479 bool expr_non_constant_p;
11480 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
11481 expression_list = cp_parser_braced_list (parser, &expr_non_constant_p);
11482 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
11483 expression_list = build_tree_list (NULL_TREE, expression_list);
11488 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
11490 /*allow_expansion_p=*/true,
11491 /*non_constant_p=*/NULL);
11493 return error_mark_node;
11494 expression_list = build_tree_list_vec (vec);
11495 release_tree_vector (vec);
11498 if (expression_list == error_mark_node)
11499 return error_mark_node;
11500 if (!expression_list)
11501 expression_list = void_type_node;
11503 in_base_initializer = 0;
11505 return member ? build_tree_list (member, expression_list) : error_mark_node;
11508 /* Parse a mem-initializer-id.
11510 mem-initializer-id:
11511 :: [opt] nested-name-specifier [opt] class-name
11514 Returns a TYPE indicating the class to be initializer for the first
11515 production. Returns an IDENTIFIER_NODE indicating the data member
11516 to be initialized for the second production. */
11519 cp_parser_mem_initializer_id (cp_parser* parser)
11521 bool global_scope_p;
11522 bool nested_name_specifier_p;
11523 bool template_p = false;
11526 cp_token *token = cp_lexer_peek_token (parser->lexer);
11528 /* `typename' is not allowed in this context ([temp.res]). */
11529 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
11531 error_at (token->location,
11532 "keyword %<typename%> not allowed in this context (a qualified "
11533 "member initializer is implicitly a type)");
11534 cp_lexer_consume_token (parser->lexer);
11536 /* Look for the optional `::' operator. */
11538 = (cp_parser_global_scope_opt (parser,
11539 /*current_scope_valid_p=*/false)
11541 /* Look for the optional nested-name-specifier. The simplest way to
11546 The keyword `typename' is not permitted in a base-specifier or
11547 mem-initializer; in these contexts a qualified name that
11548 depends on a template-parameter is implicitly assumed to be a
11551 is to assume that we have seen the `typename' keyword at this
11553 nested_name_specifier_p
11554 = (cp_parser_nested_name_specifier_opt (parser,
11555 /*typename_keyword_p=*/true,
11556 /*check_dependency_p=*/true,
11558 /*is_declaration=*/true)
11560 if (nested_name_specifier_p)
11561 template_p = cp_parser_optional_template_keyword (parser);
11562 /* If there is a `::' operator or a nested-name-specifier, then we
11563 are definitely looking for a class-name. */
11564 if (global_scope_p || nested_name_specifier_p)
11565 return cp_parser_class_name (parser,
11566 /*typename_keyword_p=*/true,
11567 /*template_keyword_p=*/template_p,
11569 /*check_dependency_p=*/true,
11570 /*class_head_p=*/false,
11571 /*is_declaration=*/true);
11572 /* Otherwise, we could also be looking for an ordinary identifier. */
11573 cp_parser_parse_tentatively (parser);
11574 /* Try a class-name. */
11575 id = cp_parser_class_name (parser,
11576 /*typename_keyword_p=*/true,
11577 /*template_keyword_p=*/false,
11579 /*check_dependency_p=*/true,
11580 /*class_head_p=*/false,
11581 /*is_declaration=*/true);
11582 /* If we found one, we're done. */
11583 if (cp_parser_parse_definitely (parser))
11585 /* Otherwise, look for an ordinary identifier. */
11586 return cp_parser_identifier (parser);
11589 /* Overloading [gram.over] */
11591 /* Parse an operator-function-id.
11593 operator-function-id:
11596 Returns an IDENTIFIER_NODE for the operator which is a
11597 human-readable spelling of the identifier, e.g., `operator +'. */
11600 cp_parser_operator_function_id (cp_parser* parser)
11602 /* Look for the `operator' keyword. */
11603 if (!cp_parser_require_keyword (parser, RID_OPERATOR, RT_OPERATOR))
11604 return error_mark_node;
11605 /* And then the name of the operator itself. */
11606 return cp_parser_operator (parser);
11609 /* Return an identifier node for a user-defined literal operator.
11610 The suffix identifier is chained to the operator name identifier. */
11613 cp_literal_operator_id (const char* name)
11616 char *buffer = XNEWVEC (char, strlen (UDLIT_OP_ANSI_PREFIX)
11617 + strlen (name) + 10);
11618 sprintf (buffer, UDLIT_OP_ANSI_FORMAT, name);
11619 identifier = get_identifier (buffer);
11620 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11625 /* Parse an operator.
11628 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11629 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11630 || ++ -- , ->* -> () []
11637 Returns an IDENTIFIER_NODE for the operator which is a
11638 human-readable spelling of the identifier, e.g., `operator +'. */
11641 cp_parser_operator (cp_parser* parser)
11643 tree id = NULL_TREE;
11646 /* Peek at the next token. */
11647 token = cp_lexer_peek_token (parser->lexer);
11648 /* Figure out which operator we have. */
11649 switch (token->type)
11655 /* The keyword should be either `new' or `delete'. */
11656 if (token->keyword == RID_NEW)
11658 else if (token->keyword == RID_DELETE)
11663 /* Consume the `new' or `delete' token. */
11664 cp_lexer_consume_token (parser->lexer);
11666 /* Peek at the next token. */
11667 token = cp_lexer_peek_token (parser->lexer);
11668 /* If it's a `[' token then this is the array variant of the
11670 if (token->type == CPP_OPEN_SQUARE)
11672 /* Consume the `[' token. */
11673 cp_lexer_consume_token (parser->lexer);
11674 /* Look for the `]' token. */
11675 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
11676 id = ansi_opname (op == NEW_EXPR
11677 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
11679 /* Otherwise, we have the non-array variant. */
11681 id = ansi_opname (op);
11687 id = ansi_opname (PLUS_EXPR);
11691 id = ansi_opname (MINUS_EXPR);
11695 id = ansi_opname (MULT_EXPR);
11699 id = ansi_opname (TRUNC_DIV_EXPR);
11703 id = ansi_opname (TRUNC_MOD_EXPR);
11707 id = ansi_opname (BIT_XOR_EXPR);
11711 id = ansi_opname (BIT_AND_EXPR);
11715 id = ansi_opname (BIT_IOR_EXPR);
11719 id = ansi_opname (BIT_NOT_EXPR);
11723 id = ansi_opname (TRUTH_NOT_EXPR);
11727 id = ansi_assopname (NOP_EXPR);
11731 id = ansi_opname (LT_EXPR);
11735 id = ansi_opname (GT_EXPR);
11739 id = ansi_assopname (PLUS_EXPR);
11743 id = ansi_assopname (MINUS_EXPR);
11747 id = ansi_assopname (MULT_EXPR);
11751 id = ansi_assopname (TRUNC_DIV_EXPR);
11755 id = ansi_assopname (TRUNC_MOD_EXPR);
11759 id = ansi_assopname (BIT_XOR_EXPR);
11763 id = ansi_assopname (BIT_AND_EXPR);
11767 id = ansi_assopname (BIT_IOR_EXPR);
11771 id = ansi_opname (LSHIFT_EXPR);
11775 id = ansi_opname (RSHIFT_EXPR);
11778 case CPP_LSHIFT_EQ:
11779 id = ansi_assopname (LSHIFT_EXPR);
11782 case CPP_RSHIFT_EQ:
11783 id = ansi_assopname (RSHIFT_EXPR);
11787 id = ansi_opname (EQ_EXPR);
11791 id = ansi_opname (NE_EXPR);
11795 id = ansi_opname (LE_EXPR);
11798 case CPP_GREATER_EQ:
11799 id = ansi_opname (GE_EXPR);
11803 id = ansi_opname (TRUTH_ANDIF_EXPR);
11807 id = ansi_opname (TRUTH_ORIF_EXPR);
11810 case CPP_PLUS_PLUS:
11811 id = ansi_opname (POSTINCREMENT_EXPR);
11814 case CPP_MINUS_MINUS:
11815 id = ansi_opname (PREDECREMENT_EXPR);
11819 id = ansi_opname (COMPOUND_EXPR);
11822 case CPP_DEREF_STAR:
11823 id = ansi_opname (MEMBER_REF);
11827 id = ansi_opname (COMPONENT_REF);
11830 case CPP_OPEN_PAREN:
11831 /* Consume the `('. */
11832 cp_lexer_consume_token (parser->lexer);
11833 /* Look for the matching `)'. */
11834 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
11835 return ansi_opname (CALL_EXPR);
11837 case CPP_OPEN_SQUARE:
11838 /* Consume the `['. */
11839 cp_lexer_consume_token (parser->lexer);
11840 /* Look for the matching `]'. */
11841 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
11842 return ansi_opname (ARRAY_REF);
11845 if (cxx_dialect == cxx98)
11846 maybe_warn_cpp0x (CPP0X_USER_DEFINED_LITERALS);
11847 if (TREE_STRING_LENGTH (token->u.value) > 2)
11849 error ("expected empty string after %<operator%> keyword");
11850 return error_mark_node;
11852 /* Consume the string. */
11853 cp_lexer_consume_token (parser->lexer);
11854 /* Look for the suffix identifier. */
11855 token = cp_lexer_peek_token (parser->lexer);
11856 if (token->type == CPP_NAME)
11858 id = cp_parser_identifier (parser);
11859 if (id != error_mark_node)
11861 const char *name = IDENTIFIER_POINTER (id);
11862 return cp_literal_operator_id (name);
11867 error ("expected suffix identifier");
11868 return error_mark_node;
11871 case CPP_STRING_USERDEF:
11872 error ("missing space between %<\"\"%> and suffix identifier");
11873 return error_mark_node;
11876 /* Anything else is an error. */
11880 /* If we have selected an identifier, we need to consume the
11883 cp_lexer_consume_token (parser->lexer);
11884 /* Otherwise, no valid operator name was present. */
11887 cp_parser_error (parser, "expected operator");
11888 id = error_mark_node;
11894 /* Parse a template-declaration.
11896 template-declaration:
11897 export [opt] template < template-parameter-list > declaration
11899 If MEMBER_P is TRUE, this template-declaration occurs within a
11902 The grammar rule given by the standard isn't correct. What
11903 is really meant is:
11905 template-declaration:
11906 export [opt] template-parameter-list-seq
11907 decl-specifier-seq [opt] init-declarator [opt] ;
11908 export [opt] template-parameter-list-seq
11909 function-definition
11911 template-parameter-list-seq:
11912 template-parameter-list-seq [opt]
11913 template < template-parameter-list > */
11916 cp_parser_template_declaration (cp_parser* parser, bool member_p)
11918 /* Check for `export'. */
11919 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
11921 /* Consume the `export' token. */
11922 cp_lexer_consume_token (parser->lexer);
11923 /* Warn that we do not support `export'. */
11924 warning (0, "keyword %<export%> not implemented, and will be ignored");
11927 cp_parser_template_declaration_after_export (parser, member_p);
11930 /* Parse a template-parameter-list.
11932 template-parameter-list:
11934 template-parameter-list , template-parameter
11936 Returns a TREE_LIST. Each node represents a template parameter.
11937 The nodes are connected via their TREE_CHAINs. */
11940 cp_parser_template_parameter_list (cp_parser* parser)
11942 tree parameter_list = NULL_TREE;
11944 begin_template_parm_list ();
11946 /* The loop below parses the template parms. We first need to know
11947 the total number of template parms to be able to compute proper
11948 canonical types of each dependent type. So after the loop, when
11949 we know the total number of template parms,
11950 end_template_parm_list computes the proper canonical types and
11951 fixes up the dependent types accordingly. */
11956 bool is_parameter_pack;
11957 location_t parm_loc;
11959 /* Parse the template-parameter. */
11960 parm_loc = cp_lexer_peek_token (parser->lexer)->location;
11961 parameter = cp_parser_template_parameter (parser,
11963 &is_parameter_pack);
11964 /* Add it to the list. */
11965 if (parameter != error_mark_node)
11966 parameter_list = process_template_parm (parameter_list,
11974 tree err_parm = build_tree_list (parameter, parameter);
11975 parameter_list = chainon (parameter_list, err_parm);
11978 /* If the next token is not a `,', we're done. */
11979 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11981 /* Otherwise, consume the `,' token. */
11982 cp_lexer_consume_token (parser->lexer);
11985 return end_template_parm_list (parameter_list);
11988 /* Parse a template-parameter.
11990 template-parameter:
11992 parameter-declaration
11994 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11995 the parameter. The TREE_PURPOSE is the default value, if any.
11996 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
11997 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
11998 set to true iff this parameter is a parameter pack. */
12001 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type,
12002 bool *is_parameter_pack)
12005 cp_parameter_declarator *parameter_declarator;
12006 cp_declarator *id_declarator;
12009 /* Assume it is a type parameter or a template parameter. */
12010 *is_non_type = false;
12011 /* Assume it not a parameter pack. */
12012 *is_parameter_pack = false;
12013 /* Peek at the next token. */
12014 token = cp_lexer_peek_token (parser->lexer);
12015 /* If it is `class' or `template', we have a type-parameter. */
12016 if (token->keyword == RID_TEMPLATE)
12017 return cp_parser_type_parameter (parser, is_parameter_pack);
12018 /* If it is `class' or `typename' we do not know yet whether it is a
12019 type parameter or a non-type parameter. Consider:
12021 template <typename T, typename T::X X> ...
12025 template <class C, class D*> ...
12027 Here, the first parameter is a type parameter, and the second is
12028 a non-type parameter. We can tell by looking at the token after
12029 the identifier -- if it is a `,', `=', or `>' then we have a type
12031 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
12033 /* Peek at the token after `class' or `typename'. */
12034 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12035 /* If it's an ellipsis, we have a template type parameter
12037 if (token->type == CPP_ELLIPSIS)
12038 return cp_parser_type_parameter (parser, is_parameter_pack);
12039 /* If it's an identifier, skip it. */
12040 if (token->type == CPP_NAME)
12041 token = cp_lexer_peek_nth_token (parser->lexer, 3);
12042 /* Now, see if the token looks like the end of a template
12044 if (token->type == CPP_COMMA
12045 || token->type == CPP_EQ
12046 || token->type == CPP_GREATER)
12047 return cp_parser_type_parameter (parser, is_parameter_pack);
12050 /* Otherwise, it is a non-type parameter.
12054 When parsing a default template-argument for a non-type
12055 template-parameter, the first non-nested `>' is taken as the end
12056 of the template parameter-list rather than a greater-than
12058 *is_non_type = true;
12059 parameter_declarator
12060 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
12061 /*parenthesized_p=*/NULL);
12063 /* If the parameter declaration is marked as a parameter pack, set
12064 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12065 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12067 if (parameter_declarator
12068 && parameter_declarator->declarator
12069 && parameter_declarator->declarator->parameter_pack_p)
12071 *is_parameter_pack = true;
12072 parameter_declarator->declarator->parameter_pack_p = false;
12075 /* If the next token is an ellipsis, and we don't already have it
12076 marked as a parameter pack, then we have a parameter pack (that
12077 has no declarator). */
12078 if (!*is_parameter_pack
12079 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
12080 && declarator_can_be_parameter_pack (parameter_declarator->declarator))
12082 /* Consume the `...'. */
12083 cp_lexer_consume_token (parser->lexer);
12084 maybe_warn_variadic_templates ();
12086 *is_parameter_pack = true;
12088 /* We might end up with a pack expansion as the type of the non-type
12089 template parameter, in which case this is a non-type template
12091 else if (parameter_declarator
12092 && parameter_declarator->decl_specifiers.type
12093 && PACK_EXPANSION_P (parameter_declarator->decl_specifiers.type))
12095 *is_parameter_pack = true;
12096 parameter_declarator->decl_specifiers.type =
12097 PACK_EXPANSION_PATTERN (parameter_declarator->decl_specifiers.type);
12100 if (*is_parameter_pack && cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12102 /* Parameter packs cannot have default arguments. However, a
12103 user may try to do so, so we'll parse them and give an
12104 appropriate diagnostic here. */
12106 cp_token *start_token = cp_lexer_peek_token (parser->lexer);
12108 /* Find the name of the parameter pack. */
12109 id_declarator = parameter_declarator->declarator;
12110 while (id_declarator && id_declarator->kind != cdk_id)
12111 id_declarator = id_declarator->declarator;
12113 if (id_declarator && id_declarator->kind == cdk_id)
12114 error_at (start_token->location,
12115 "template parameter pack %qD cannot have a default argument",
12116 id_declarator->u.id.unqualified_name);
12118 error_at (start_token->location,
12119 "template parameter pack cannot have a default argument");
12121 /* Parse the default argument, but throw away the result. */
12122 cp_parser_default_argument (parser, /*template_parm_p=*/true);
12125 parm = grokdeclarator (parameter_declarator->declarator,
12126 ¶meter_declarator->decl_specifiers,
12127 TPARM, /*initialized=*/0,
12128 /*attrlist=*/NULL);
12129 if (parm == error_mark_node)
12130 return error_mark_node;
12132 return build_tree_list (parameter_declarator->default_argument, parm);
12135 /* Parse a type-parameter.
12138 class identifier [opt]
12139 class identifier [opt] = type-id
12140 typename identifier [opt]
12141 typename identifier [opt] = type-id
12142 template < template-parameter-list > class identifier [opt]
12143 template < template-parameter-list > class identifier [opt]
12146 GNU Extension (variadic templates):
12149 class ... identifier [opt]
12150 typename ... identifier [opt]
12152 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12153 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12154 the declaration of the parameter.
12156 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12159 cp_parser_type_parameter (cp_parser* parser, bool *is_parameter_pack)
12164 /* Look for a keyword to tell us what kind of parameter this is. */
12165 token = cp_parser_require (parser, CPP_KEYWORD, RT_CLASS_TYPENAME_TEMPLATE);
12167 return error_mark_node;
12169 switch (token->keyword)
12175 tree default_argument;
12177 /* If the next token is an ellipsis, we have a template
12179 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
12181 /* Consume the `...' token. */
12182 cp_lexer_consume_token (parser->lexer);
12183 maybe_warn_variadic_templates ();
12185 *is_parameter_pack = true;
12188 /* If the next token is an identifier, then it names the
12190 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12191 identifier = cp_parser_identifier (parser);
12193 identifier = NULL_TREE;
12195 /* Create the parameter. */
12196 parameter = finish_template_type_parm (class_type_node, identifier);
12198 /* If the next token is an `=', we have a default argument. */
12199 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12201 /* Consume the `=' token. */
12202 cp_lexer_consume_token (parser->lexer);
12203 /* Parse the default-argument. */
12204 push_deferring_access_checks (dk_no_deferred);
12205 default_argument = cp_parser_type_id (parser);
12207 /* Template parameter packs cannot have default
12209 if (*is_parameter_pack)
12212 error_at (token->location,
12213 "template parameter pack %qD cannot have a "
12214 "default argument", identifier);
12216 error_at (token->location,
12217 "template parameter packs cannot have "
12218 "default arguments");
12219 default_argument = NULL_TREE;
12221 pop_deferring_access_checks ();
12224 default_argument = NULL_TREE;
12226 /* Create the combined representation of the parameter and the
12227 default argument. */
12228 parameter = build_tree_list (default_argument, parameter);
12235 tree default_argument;
12237 /* Look for the `<'. */
12238 cp_parser_require (parser, CPP_LESS, RT_LESS);
12239 /* Parse the template-parameter-list. */
12240 cp_parser_template_parameter_list (parser);
12241 /* Look for the `>'. */
12242 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
12243 /* Look for the `class' keyword. */
12244 cp_parser_require_keyword (parser, RID_CLASS, RT_CLASS);
12245 /* If the next token is an ellipsis, we have a template
12247 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
12249 /* Consume the `...' token. */
12250 cp_lexer_consume_token (parser->lexer);
12251 maybe_warn_variadic_templates ();
12253 *is_parameter_pack = true;
12255 /* If the next token is an `=', then there is a
12256 default-argument. If the next token is a `>', we are at
12257 the end of the parameter-list. If the next token is a `,',
12258 then we are at the end of this parameter. */
12259 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
12260 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
12261 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12263 identifier = cp_parser_identifier (parser);
12264 /* Treat invalid names as if the parameter were nameless. */
12265 if (identifier == error_mark_node)
12266 identifier = NULL_TREE;
12269 identifier = NULL_TREE;
12271 /* Create the template parameter. */
12272 parameter = finish_template_template_parm (class_type_node,
12275 /* If the next token is an `=', then there is a
12276 default-argument. */
12277 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12281 /* Consume the `='. */
12282 cp_lexer_consume_token (parser->lexer);
12283 /* Parse the id-expression. */
12284 push_deferring_access_checks (dk_no_deferred);
12285 /* save token before parsing the id-expression, for error
12287 token = cp_lexer_peek_token (parser->lexer);
12289 = cp_parser_id_expression (parser,
12290 /*template_keyword_p=*/false,
12291 /*check_dependency_p=*/true,
12292 /*template_p=*/&is_template,
12293 /*declarator_p=*/false,
12294 /*optional_p=*/false);
12295 if (TREE_CODE (default_argument) == TYPE_DECL)
12296 /* If the id-expression was a template-id that refers to
12297 a template-class, we already have the declaration here,
12298 so no further lookup is needed. */
12301 /* Look up the name. */
12303 = cp_parser_lookup_name (parser, default_argument,
12305 /*is_template=*/is_template,
12306 /*is_namespace=*/false,
12307 /*check_dependency=*/true,
12308 /*ambiguous_decls=*/NULL,
12310 /* See if the default argument is valid. */
12312 = check_template_template_default_arg (default_argument);
12314 /* Template parameter packs cannot have default
12316 if (*is_parameter_pack)
12319 error_at (token->location,
12320 "template parameter pack %qD cannot "
12321 "have a default argument",
12324 error_at (token->location, "template parameter packs cannot "
12325 "have default arguments");
12326 default_argument = NULL_TREE;
12328 pop_deferring_access_checks ();
12331 default_argument = NULL_TREE;
12333 /* Create the combined representation of the parameter and the
12334 default argument. */
12335 parameter = build_tree_list (default_argument, parameter);
12340 gcc_unreachable ();
12347 /* Parse a template-id.
12350 template-name < template-argument-list [opt] >
12352 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12353 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12354 returned. Otherwise, if the template-name names a function, or set
12355 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12356 names a class, returns a TYPE_DECL for the specialization.
12358 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12359 uninstantiated templates. */
12362 cp_parser_template_id (cp_parser *parser,
12363 bool template_keyword_p,
12364 bool check_dependency_p,
12365 bool is_declaration)
12371 cp_token_position start_of_id = 0;
12372 deferred_access_check *chk;
12373 VEC (deferred_access_check,gc) *access_check;
12374 cp_token *next_token = NULL, *next_token_2 = NULL;
12375 bool is_identifier;
12377 /* If the next token corresponds to a template-id, there is no need
12379 next_token = cp_lexer_peek_token (parser->lexer);
12380 if (next_token->type == CPP_TEMPLATE_ID)
12382 struct tree_check *check_value;
12384 /* Get the stored value. */
12385 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
12386 /* Perform any access checks that were deferred. */
12387 access_check = check_value->checks;
12390 FOR_EACH_VEC_ELT (deferred_access_check, access_check, i, chk)
12391 perform_or_defer_access_check (chk->binfo,
12395 /* Return the stored value. */
12396 return check_value->value;
12399 /* Avoid performing name lookup if there is no possibility of
12400 finding a template-id. */
12401 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
12402 || (next_token->type == CPP_NAME
12403 && !cp_parser_nth_token_starts_template_argument_list_p
12406 cp_parser_error (parser, "expected template-id");
12407 return error_mark_node;
12410 /* Remember where the template-id starts. */
12411 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
12412 start_of_id = cp_lexer_token_position (parser->lexer, false);
12414 push_deferring_access_checks (dk_deferred);
12416 /* Parse the template-name. */
12417 is_identifier = false;
12418 templ = cp_parser_template_name (parser, template_keyword_p,
12419 check_dependency_p,
12422 if (templ == error_mark_node || is_identifier)
12424 pop_deferring_access_checks ();
12428 /* If we find the sequence `[:' after a template-name, it's probably
12429 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12430 parse correctly the argument list. */
12431 next_token = cp_lexer_peek_token (parser->lexer);
12432 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
12433 if (next_token->type == CPP_OPEN_SQUARE
12434 && next_token->flags & DIGRAPH
12435 && next_token_2->type == CPP_COLON
12436 && !(next_token_2->flags & PREV_WHITE))
12438 cp_parser_parse_tentatively (parser);
12439 /* Change `:' into `::'. */
12440 next_token_2->type = CPP_SCOPE;
12441 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12443 cp_lexer_consume_token (parser->lexer);
12445 /* Parse the arguments. */
12446 arguments = cp_parser_enclosed_template_argument_list (parser);
12447 if (!cp_parser_parse_definitely (parser))
12449 /* If we couldn't parse an argument list, then we revert our changes
12450 and return simply an error. Maybe this is not a template-id
12452 next_token_2->type = CPP_COLON;
12453 cp_parser_error (parser, "expected %<<%>");
12454 pop_deferring_access_checks ();
12455 return error_mark_node;
12457 /* Otherwise, emit an error about the invalid digraph, but continue
12458 parsing because we got our argument list. */
12459 if (permerror (next_token->location,
12460 "%<<::%> cannot begin a template-argument list"))
12462 static bool hint = false;
12463 inform (next_token->location,
12464 "%<<:%> is an alternate spelling for %<[%>."
12465 " Insert whitespace between %<<%> and %<::%>");
12466 if (!hint && !flag_permissive)
12468 inform (next_token->location, "(if you use %<-fpermissive%>"
12469 " G++ will accept your code)");
12476 /* Look for the `<' that starts the template-argument-list. */
12477 if (!cp_parser_require (parser, CPP_LESS, RT_LESS))
12479 pop_deferring_access_checks ();
12480 return error_mark_node;
12482 /* Parse the arguments. */
12483 arguments = cp_parser_enclosed_template_argument_list (parser);
12486 /* Build a representation of the specialization. */
12487 if (TREE_CODE (templ) == IDENTIFIER_NODE)
12488 template_id = build_min_nt (TEMPLATE_ID_EXPR, templ, arguments);
12489 else if (DECL_TYPE_TEMPLATE_P (templ)
12490 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ))
12492 bool entering_scope;
12493 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12494 template (rather than some instantiation thereof) only if
12495 is not nested within some other construct. For example, in
12496 "template <typename T> void f(T) { A<T>::", A<T> is just an
12497 instantiation of A. */
12498 entering_scope = (template_parm_scope_p ()
12499 && cp_lexer_next_token_is (parser->lexer,
12502 = finish_template_type (templ, arguments, entering_scope);
12506 /* If it's not a class-template or a template-template, it should be
12507 a function-template. */
12508 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ)
12509 || TREE_CODE (templ) == OVERLOAD
12510 || BASELINK_P (templ)));
12512 template_id = lookup_template_function (templ, arguments);
12515 /* If parsing tentatively, replace the sequence of tokens that makes
12516 up the template-id with a CPP_TEMPLATE_ID token. That way,
12517 should we re-parse the token stream, we will not have to repeat
12518 the effort required to do the parse, nor will we issue duplicate
12519 error messages about problems during instantiation of the
12523 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
12525 /* Reset the contents of the START_OF_ID token. */
12526 token->type = CPP_TEMPLATE_ID;
12527 /* Retrieve any deferred checks. Do not pop this access checks yet
12528 so the memory will not be reclaimed during token replacing below. */
12529 token->u.tree_check_value = ggc_alloc_cleared_tree_check ();
12530 token->u.tree_check_value->value = template_id;
12531 token->u.tree_check_value->checks = get_deferred_access_checks ();
12532 token->keyword = RID_MAX;
12534 /* Purge all subsequent tokens. */
12535 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
12537 /* ??? Can we actually assume that, if template_id ==
12538 error_mark_node, we will have issued a diagnostic to the
12539 user, as opposed to simply marking the tentative parse as
12541 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
12542 error_at (token->location, "parse error in template argument list");
12545 pop_deferring_access_checks ();
12546 return template_id;
12549 /* Parse a template-name.
12554 The standard should actually say:
12558 operator-function-id
12560 A defect report has been filed about this issue.
12562 A conversion-function-id cannot be a template name because they cannot
12563 be part of a template-id. In fact, looking at this code:
12565 a.operator K<int>()
12567 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12568 It is impossible to call a templated conversion-function-id with an
12569 explicit argument list, since the only allowed template parameter is
12570 the type to which it is converting.
12572 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12573 `template' keyword, in a construction like:
12577 In that case `f' is taken to be a template-name, even though there
12578 is no way of knowing for sure.
12580 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12581 name refers to a set of overloaded functions, at least one of which
12582 is a template, or an IDENTIFIER_NODE with the name of the template,
12583 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12584 names are looked up inside uninstantiated templates. */
12587 cp_parser_template_name (cp_parser* parser,
12588 bool template_keyword_p,
12589 bool check_dependency_p,
12590 bool is_declaration,
12591 bool *is_identifier)
12596 cp_token *token = cp_lexer_peek_token (parser->lexer);
12598 /* If the next token is `operator', then we have either an
12599 operator-function-id or a conversion-function-id. */
12600 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
12602 /* We don't know whether we're looking at an
12603 operator-function-id or a conversion-function-id. */
12604 cp_parser_parse_tentatively (parser);
12605 /* Try an operator-function-id. */
12606 identifier = cp_parser_operator_function_id (parser);
12607 /* If that didn't work, try a conversion-function-id. */
12608 if (!cp_parser_parse_definitely (parser))
12610 cp_parser_error (parser, "expected template-name");
12611 return error_mark_node;
12614 /* Look for the identifier. */
12616 identifier = cp_parser_identifier (parser);
12618 /* If we didn't find an identifier, we don't have a template-id. */
12619 if (identifier == error_mark_node)
12620 return error_mark_node;
12622 /* If the name immediately followed the `template' keyword, then it
12623 is a template-name. However, if the next token is not `<', then
12624 we do not treat it as a template-name, since it is not being used
12625 as part of a template-id. This enables us to handle constructs
12628 template <typename T> struct S { S(); };
12629 template <typename T> S<T>::S();
12631 correctly. We would treat `S' as a template -- if it were `S<T>'
12632 -- but we do not if there is no `<'. */
12634 if (processing_template_decl
12635 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
12637 /* In a declaration, in a dependent context, we pretend that the
12638 "template" keyword was present in order to improve error
12639 recovery. For example, given:
12641 template <typename T> void f(T::X<int>);
12643 we want to treat "X<int>" as a template-id. */
12645 && !template_keyword_p
12646 && parser->scope && TYPE_P (parser->scope)
12647 && check_dependency_p
12648 && dependent_scope_p (parser->scope)
12649 /* Do not do this for dtors (or ctors), since they never
12650 need the template keyword before their name. */
12651 && !constructor_name_p (identifier, parser->scope))
12653 cp_token_position start = 0;
12655 /* Explain what went wrong. */
12656 error_at (token->location, "non-template %qD used as template",
12658 inform (token->location, "use %<%T::template %D%> to indicate that it is a template",
12659 parser->scope, identifier);
12660 /* If parsing tentatively, find the location of the "<" token. */
12661 if (cp_parser_simulate_error (parser))
12662 start = cp_lexer_token_position (parser->lexer, true);
12663 /* Parse the template arguments so that we can issue error
12664 messages about them. */
12665 cp_lexer_consume_token (parser->lexer);
12666 cp_parser_enclosed_template_argument_list (parser);
12667 /* Skip tokens until we find a good place from which to
12668 continue parsing. */
12669 cp_parser_skip_to_closing_parenthesis (parser,
12670 /*recovering=*/true,
12672 /*consume_paren=*/false);
12673 /* If parsing tentatively, permanently remove the
12674 template argument list. That will prevent duplicate
12675 error messages from being issued about the missing
12676 "template" keyword. */
12678 cp_lexer_purge_tokens_after (parser->lexer, start);
12680 *is_identifier = true;
12684 /* If the "template" keyword is present, then there is generally
12685 no point in doing name-lookup, so we just return IDENTIFIER.
12686 But, if the qualifying scope is non-dependent then we can
12687 (and must) do name-lookup normally. */
12688 if (template_keyword_p
12690 || (TYPE_P (parser->scope)
12691 && dependent_type_p (parser->scope))))
12695 /* Look up the name. */
12696 decl = cp_parser_lookup_name (parser, identifier,
12698 /*is_template=*/true,
12699 /*is_namespace=*/false,
12700 check_dependency_p,
12701 /*ambiguous_decls=*/NULL,
12704 /* If DECL is a template, then the name was a template-name. */
12705 if (TREE_CODE (decl) == TEMPLATE_DECL)
12709 tree fn = NULL_TREE;
12711 /* The standard does not explicitly indicate whether a name that
12712 names a set of overloaded declarations, some of which are
12713 templates, is a template-name. However, such a name should
12714 be a template-name; otherwise, there is no way to form a
12715 template-id for the overloaded templates. */
12716 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
12717 if (TREE_CODE (fns) == OVERLOAD)
12718 for (fn = fns; fn; fn = OVL_NEXT (fn))
12719 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
12724 /* The name does not name a template. */
12725 cp_parser_error (parser, "expected template-name");
12726 return error_mark_node;
12730 /* If DECL is dependent, and refers to a function, then just return
12731 its name; we will look it up again during template instantiation. */
12732 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
12734 tree scope = ovl_scope (decl);
12735 if (TYPE_P (scope) && dependent_type_p (scope))
12742 /* Parse a template-argument-list.
12744 template-argument-list:
12745 template-argument ... [opt]
12746 template-argument-list , template-argument ... [opt]
12748 Returns a TREE_VEC containing the arguments. */
12751 cp_parser_template_argument_list (cp_parser* parser)
12753 tree fixed_args[10];
12754 unsigned n_args = 0;
12755 unsigned alloced = 10;
12756 tree *arg_ary = fixed_args;
12758 bool saved_in_template_argument_list_p;
12760 bool saved_non_ice_p;
12762 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
12763 parser->in_template_argument_list_p = true;
12764 /* Even if the template-id appears in an integral
12765 constant-expression, the contents of the argument list do
12767 saved_ice_p = parser->integral_constant_expression_p;
12768 parser->integral_constant_expression_p = false;
12769 saved_non_ice_p = parser->non_integral_constant_expression_p;
12770 parser->non_integral_constant_expression_p = false;
12772 /* Parse the arguments. */
12778 /* Consume the comma. */
12779 cp_lexer_consume_token (parser->lexer);
12781 /* Parse the template-argument. */
12782 argument = cp_parser_template_argument (parser);
12784 /* If the next token is an ellipsis, we're expanding a template
12786 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
12788 if (argument == error_mark_node)
12790 cp_token *token = cp_lexer_peek_token (parser->lexer);
12791 error_at (token->location,
12792 "expected parameter pack before %<...%>");
12794 /* Consume the `...' token. */
12795 cp_lexer_consume_token (parser->lexer);
12797 /* Make the argument into a TYPE_PACK_EXPANSION or
12798 EXPR_PACK_EXPANSION. */
12799 argument = make_pack_expansion (argument);
12802 if (n_args == alloced)
12806 if (arg_ary == fixed_args)
12808 arg_ary = XNEWVEC (tree, alloced);
12809 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
12812 arg_ary = XRESIZEVEC (tree, arg_ary, alloced);
12814 arg_ary[n_args++] = argument;
12816 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
12818 vec = make_tree_vec (n_args);
12821 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
12823 if (arg_ary != fixed_args)
12825 parser->non_integral_constant_expression_p = saved_non_ice_p;
12826 parser->integral_constant_expression_p = saved_ice_p;
12827 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
12828 #ifdef ENABLE_CHECKING
12829 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec, TREE_VEC_LENGTH (vec));
12834 /* Parse a template-argument.
12837 assignment-expression
12841 The representation is that of an assignment-expression, type-id, or
12842 id-expression -- except that the qualified id-expression is
12843 evaluated, so that the value returned is either a DECL or an
12846 Although the standard says "assignment-expression", it forbids
12847 throw-expressions or assignments in the template argument.
12848 Therefore, we use "conditional-expression" instead. */
12851 cp_parser_template_argument (cp_parser* parser)
12856 bool maybe_type_id = false;
12857 cp_token *token = NULL, *argument_start_token = NULL;
12860 /* There's really no way to know what we're looking at, so we just
12861 try each alternative in order.
12865 In a template-argument, an ambiguity between a type-id and an
12866 expression is resolved to a type-id, regardless of the form of
12867 the corresponding template-parameter.
12869 Therefore, we try a type-id first. */
12870 cp_parser_parse_tentatively (parser);
12871 argument = cp_parser_template_type_arg (parser);
12872 /* If there was no error parsing the type-id but the next token is a
12873 '>>', our behavior depends on which dialect of C++ we're
12874 parsing. In C++98, we probably found a typo for '> >'. But there
12875 are type-id which are also valid expressions. For instance:
12877 struct X { int operator >> (int); };
12878 template <int V> struct Foo {};
12881 Here 'X()' is a valid type-id of a function type, but the user just
12882 wanted to write the expression "X() >> 5". Thus, we remember that we
12883 found a valid type-id, but we still try to parse the argument as an
12884 expression to see what happens.
12886 In C++0x, the '>>' will be considered two separate '>'
12888 if (!cp_parser_error_occurred (parser)
12889 && cxx_dialect == cxx98
12890 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
12892 maybe_type_id = true;
12893 cp_parser_abort_tentative_parse (parser);
12897 /* If the next token isn't a `,' or a `>', then this argument wasn't
12898 really finished. This means that the argument is not a valid
12900 if (!cp_parser_next_token_ends_template_argument_p (parser))
12901 cp_parser_error (parser, "expected template-argument");
12902 /* If that worked, we're done. */
12903 if (cp_parser_parse_definitely (parser))
12906 /* We're still not sure what the argument will be. */
12907 cp_parser_parse_tentatively (parser);
12908 /* Try a template. */
12909 argument_start_token = cp_lexer_peek_token (parser->lexer);
12910 argument = cp_parser_id_expression (parser,
12911 /*template_keyword_p=*/false,
12912 /*check_dependency_p=*/true,
12914 /*declarator_p=*/false,
12915 /*optional_p=*/false);
12916 /* If the next token isn't a `,' or a `>', then this argument wasn't
12917 really finished. */
12918 if (!cp_parser_next_token_ends_template_argument_p (parser))
12919 cp_parser_error (parser, "expected template-argument");
12920 if (!cp_parser_error_occurred (parser))
12922 /* Figure out what is being referred to. If the id-expression
12923 was for a class template specialization, then we will have a
12924 TYPE_DECL at this point. There is no need to do name lookup
12925 at this point in that case. */
12926 if (TREE_CODE (argument) != TYPE_DECL)
12927 argument = cp_parser_lookup_name (parser, argument,
12929 /*is_template=*/template_p,
12930 /*is_namespace=*/false,
12931 /*check_dependency=*/true,
12932 /*ambiguous_decls=*/NULL,
12933 argument_start_token->location);
12934 if (TREE_CODE (argument) != TEMPLATE_DECL
12935 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
12936 cp_parser_error (parser, "expected template-name");
12938 if (cp_parser_parse_definitely (parser))
12940 /* It must be a non-type argument. There permitted cases are given
12941 in [temp.arg.nontype]:
12943 -- an integral constant-expression of integral or enumeration
12946 -- the name of a non-type template-parameter; or
12948 -- the name of an object or function with external linkage...
12950 -- the address of an object or function with external linkage...
12952 -- a pointer to member... */
12953 /* Look for a non-type template parameter. */
12954 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12956 cp_parser_parse_tentatively (parser);
12957 argument = cp_parser_primary_expression (parser,
12958 /*address_p=*/false,
12960 /*template_arg_p=*/true,
12962 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
12963 || !cp_parser_next_token_ends_template_argument_p (parser))
12964 cp_parser_simulate_error (parser);
12965 if (cp_parser_parse_definitely (parser))
12969 /* If the next token is "&", the argument must be the address of an
12970 object or function with external linkage. */
12971 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
12973 cp_lexer_consume_token (parser->lexer);
12974 /* See if we might have an id-expression. */
12975 token = cp_lexer_peek_token (parser->lexer);
12976 if (token->type == CPP_NAME
12977 || token->keyword == RID_OPERATOR
12978 || token->type == CPP_SCOPE
12979 || token->type == CPP_TEMPLATE_ID
12980 || token->type == CPP_NESTED_NAME_SPECIFIER)
12982 cp_parser_parse_tentatively (parser);
12983 argument = cp_parser_primary_expression (parser,
12986 /*template_arg_p=*/true,
12988 if (cp_parser_error_occurred (parser)
12989 || !cp_parser_next_token_ends_template_argument_p (parser))
12990 cp_parser_abort_tentative_parse (parser);
12995 if (TREE_CODE (argument) == INDIRECT_REF)
12997 gcc_assert (REFERENCE_REF_P (argument));
12998 argument = TREE_OPERAND (argument, 0);
13001 /* If we're in a template, we represent a qualified-id referring
13002 to a static data member as a SCOPE_REF even if the scope isn't
13003 dependent so that we can check access control later. */
13005 if (TREE_CODE (probe) == SCOPE_REF)
13006 probe = TREE_OPERAND (probe, 1);
13007 if (TREE_CODE (probe) == VAR_DECL)
13009 /* A variable without external linkage might still be a
13010 valid constant-expression, so no error is issued here
13011 if the external-linkage check fails. */
13012 if (!address_p && !DECL_EXTERNAL_LINKAGE_P (probe))
13013 cp_parser_simulate_error (parser);
13015 else if (is_overloaded_fn (argument))
13016 /* All overloaded functions are allowed; if the external
13017 linkage test does not pass, an error will be issued
13021 && (TREE_CODE (argument) == OFFSET_REF
13022 || TREE_CODE (argument) == SCOPE_REF))
13023 /* A pointer-to-member. */
13025 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
13028 cp_parser_simulate_error (parser);
13030 if (cp_parser_parse_definitely (parser))
13033 argument = build_x_unary_op (ADDR_EXPR, argument,
13034 tf_warning_or_error);
13039 /* If the argument started with "&", there are no other valid
13040 alternatives at this point. */
13043 cp_parser_error (parser, "invalid non-type template argument");
13044 return error_mark_node;
13047 /* If the argument wasn't successfully parsed as a type-id followed
13048 by '>>', the argument can only be a constant expression now.
13049 Otherwise, we try parsing the constant-expression tentatively,
13050 because the argument could really be a type-id. */
13052 cp_parser_parse_tentatively (parser);
13053 argument = cp_parser_constant_expression (parser,
13054 /*allow_non_constant_p=*/false,
13055 /*non_constant_p=*/NULL);
13056 argument = fold_non_dependent_expr (argument);
13057 if (!maybe_type_id)
13059 if (!cp_parser_next_token_ends_template_argument_p (parser))
13060 cp_parser_error (parser, "expected template-argument");
13061 if (cp_parser_parse_definitely (parser))
13063 /* We did our best to parse the argument as a non type-id, but that
13064 was the only alternative that matched (albeit with a '>' after
13065 it). We can assume it's just a typo from the user, and a
13066 diagnostic will then be issued. */
13067 return cp_parser_template_type_arg (parser);
13070 /* Parse an explicit-instantiation.
13072 explicit-instantiation:
13073 template declaration
13075 Although the standard says `declaration', what it really means is:
13077 explicit-instantiation:
13078 template decl-specifier-seq [opt] declarator [opt] ;
13080 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13081 supposed to be allowed. A defect report has been filed about this
13086 explicit-instantiation:
13087 storage-class-specifier template
13088 decl-specifier-seq [opt] declarator [opt] ;
13089 function-specifier template
13090 decl-specifier-seq [opt] declarator [opt] ; */
13093 cp_parser_explicit_instantiation (cp_parser* parser)
13095 int declares_class_or_enum;
13096 cp_decl_specifier_seq decl_specifiers;
13097 tree extension_specifier = NULL_TREE;
13099 timevar_push (TV_TEMPLATE_INST);
13101 /* Look for an (optional) storage-class-specifier or
13102 function-specifier. */
13103 if (cp_parser_allow_gnu_extensions_p (parser))
13105 extension_specifier
13106 = cp_parser_storage_class_specifier_opt (parser);
13107 if (!extension_specifier)
13108 extension_specifier
13109 = cp_parser_function_specifier_opt (parser,
13110 /*decl_specs=*/NULL);
13113 /* Look for the `template' keyword. */
13114 cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE);
13115 /* Let the front end know that we are processing an explicit
13117 begin_explicit_instantiation ();
13118 /* [temp.explicit] says that we are supposed to ignore access
13119 control while processing explicit instantiation directives. */
13120 push_deferring_access_checks (dk_no_check);
13121 /* Parse a decl-specifier-seq. */
13122 cp_parser_decl_specifier_seq (parser,
13123 CP_PARSER_FLAGS_OPTIONAL,
13125 &declares_class_or_enum);
13126 /* If there was exactly one decl-specifier, and it declared a class,
13127 and there's no declarator, then we have an explicit type
13129 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
13133 type = check_tag_decl (&decl_specifiers);
13134 /* Turn access control back on for names used during
13135 template instantiation. */
13136 pop_deferring_access_checks ();
13138 do_type_instantiation (type, extension_specifier,
13139 /*complain=*/tf_error);
13143 cp_declarator *declarator;
13146 /* Parse the declarator. */
13148 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13149 /*ctor_dtor_or_conv_p=*/NULL,
13150 /*parenthesized_p=*/NULL,
13151 /*member_p=*/false);
13152 if (declares_class_or_enum & 2)
13153 cp_parser_check_for_definition_in_return_type (declarator,
13154 decl_specifiers.type,
13155 decl_specifiers.type_location);
13156 if (declarator != cp_error_declarator)
13158 if (decl_specifiers.specs[(int)ds_inline])
13159 permerror (input_location, "explicit instantiation shall not use"
13160 " %<inline%> specifier");
13161 if (decl_specifiers.specs[(int)ds_constexpr])
13162 permerror (input_location, "explicit instantiation shall not use"
13163 " %<constexpr%> specifier");
13165 decl = grokdeclarator (declarator, &decl_specifiers,
13166 NORMAL, 0, &decl_specifiers.attributes);
13167 /* Turn access control back on for names used during
13168 template instantiation. */
13169 pop_deferring_access_checks ();
13170 /* Do the explicit instantiation. */
13171 do_decl_instantiation (decl, extension_specifier);
13175 pop_deferring_access_checks ();
13176 /* Skip the body of the explicit instantiation. */
13177 cp_parser_skip_to_end_of_statement (parser);
13180 /* We're done with the instantiation. */
13181 end_explicit_instantiation ();
13183 cp_parser_consume_semicolon_at_end_of_statement (parser);
13185 timevar_pop (TV_TEMPLATE_INST);
13188 /* Parse an explicit-specialization.
13190 explicit-specialization:
13191 template < > declaration
13193 Although the standard says `declaration', what it really means is:
13195 explicit-specialization:
13196 template <> decl-specifier [opt] init-declarator [opt] ;
13197 template <> function-definition
13198 template <> explicit-specialization
13199 template <> template-declaration */
13202 cp_parser_explicit_specialization (cp_parser* parser)
13204 bool need_lang_pop;
13205 cp_token *token = cp_lexer_peek_token (parser->lexer);
13207 /* Look for the `template' keyword. */
13208 cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE);
13209 /* Look for the `<'. */
13210 cp_parser_require (parser, CPP_LESS, RT_LESS);
13211 /* Look for the `>'. */
13212 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
13213 /* We have processed another parameter list. */
13214 ++parser->num_template_parameter_lists;
13217 A template ... explicit specialization ... shall not have C
13219 if (current_lang_name == lang_name_c)
13221 error_at (token->location, "template specialization with C linkage");
13222 /* Give it C++ linkage to avoid confusing other parts of the
13224 push_lang_context (lang_name_cplusplus);
13225 need_lang_pop = true;
13228 need_lang_pop = false;
13229 /* Let the front end know that we are beginning a specialization. */
13230 if (!begin_specialization ())
13232 end_specialization ();
13236 /* If the next keyword is `template', we need to figure out whether
13237 or not we're looking a template-declaration. */
13238 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13240 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
13241 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
13242 cp_parser_template_declaration_after_export (parser,
13243 /*member_p=*/false);
13245 cp_parser_explicit_specialization (parser);
13248 /* Parse the dependent declaration. */
13249 cp_parser_single_declaration (parser,
13251 /*member_p=*/false,
13252 /*explicit_specialization_p=*/true,
13253 /*friend_p=*/NULL);
13254 /* We're done with the specialization. */
13255 end_specialization ();
13256 /* For the erroneous case of a template with C linkage, we pushed an
13257 implicit C++ linkage scope; exit that scope now. */
13259 pop_lang_context ();
13260 /* We're done with this parameter list. */
13261 --parser->num_template_parameter_lists;
13264 /* Parse a type-specifier.
13267 simple-type-specifier
13270 elaborated-type-specifier
13278 Returns a representation of the type-specifier. For a
13279 class-specifier, enum-specifier, or elaborated-type-specifier, a
13280 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13282 The parser flags FLAGS is used to control type-specifier parsing.
13284 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13285 in a decl-specifier-seq.
13287 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13288 class-specifier, enum-specifier, or elaborated-type-specifier, then
13289 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13290 if a type is declared; 2 if it is defined. Otherwise, it is set to
13293 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13294 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13295 is set to FALSE. */
13298 cp_parser_type_specifier (cp_parser* parser,
13299 cp_parser_flags flags,
13300 cp_decl_specifier_seq *decl_specs,
13301 bool is_declaration,
13302 int* declares_class_or_enum,
13303 bool* is_cv_qualifier)
13305 tree type_spec = NULL_TREE;
13308 cp_decl_spec ds = ds_last;
13310 /* Assume this type-specifier does not declare a new type. */
13311 if (declares_class_or_enum)
13312 *declares_class_or_enum = 0;
13313 /* And that it does not specify a cv-qualifier. */
13314 if (is_cv_qualifier)
13315 *is_cv_qualifier = false;
13316 /* Peek at the next token. */
13317 token = cp_lexer_peek_token (parser->lexer);
13319 /* If we're looking at a keyword, we can use that to guide the
13320 production we choose. */
13321 keyword = token->keyword;
13325 if ((flags & CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS))
13326 goto elaborated_type_specifier;
13328 /* Look for the enum-specifier. */
13329 type_spec = cp_parser_enum_specifier (parser);
13330 /* If that worked, we're done. */
13333 if (declares_class_or_enum)
13334 *declares_class_or_enum = 2;
13336 cp_parser_set_decl_spec_type (decl_specs,
13339 /*type_definition_p=*/true);
13343 goto elaborated_type_specifier;
13345 /* Any of these indicate either a class-specifier, or an
13346 elaborated-type-specifier. */
13350 if ((flags & CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS))
13351 goto elaborated_type_specifier;
13353 /* Parse tentatively so that we can back up if we don't find a
13354 class-specifier. */
13355 cp_parser_parse_tentatively (parser);
13356 /* Look for the class-specifier. */
13357 type_spec = cp_parser_class_specifier (parser);
13358 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE, type_spec);
13359 /* If that worked, we're done. */
13360 if (cp_parser_parse_definitely (parser))
13362 if (declares_class_or_enum)
13363 *declares_class_or_enum = 2;
13365 cp_parser_set_decl_spec_type (decl_specs,
13368 /*type_definition_p=*/true);
13372 /* Fall through. */
13373 elaborated_type_specifier:
13374 /* We're declaring (not defining) a class or enum. */
13375 if (declares_class_or_enum)
13376 *declares_class_or_enum = 1;
13378 /* Fall through. */
13380 /* Look for an elaborated-type-specifier. */
13382 = (cp_parser_elaborated_type_specifier
13384 decl_specs && decl_specs->specs[(int) ds_friend],
13387 cp_parser_set_decl_spec_type (decl_specs,
13390 /*type_definition_p=*/false);
13395 if (is_cv_qualifier)
13396 *is_cv_qualifier = true;
13401 if (is_cv_qualifier)
13402 *is_cv_qualifier = true;
13407 if (is_cv_qualifier)
13408 *is_cv_qualifier = true;
13412 /* The `__complex__' keyword is a GNU extension. */
13420 /* Handle simple keywords. */
13425 ++decl_specs->specs[(int)ds];
13426 decl_specs->any_specifiers_p = true;
13428 return cp_lexer_consume_token (parser->lexer)->u.value;
13431 /* If we do not already have a type-specifier, assume we are looking
13432 at a simple-type-specifier. */
13433 type_spec = cp_parser_simple_type_specifier (parser,
13437 /* If we didn't find a type-specifier, and a type-specifier was not
13438 optional in this context, issue an error message. */
13439 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
13441 cp_parser_error (parser, "expected type specifier");
13442 return error_mark_node;
13448 /* Parse a simple-type-specifier.
13450 simple-type-specifier:
13451 :: [opt] nested-name-specifier [opt] type-name
13452 :: [opt] nested-name-specifier template template-id
13467 simple-type-specifier:
13469 decltype ( expression )
13472 __underlying_type ( type-id )
13476 simple-type-specifier:
13478 __typeof__ unary-expression
13479 __typeof__ ( type-id )
13481 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13482 appropriately updated. */
13485 cp_parser_simple_type_specifier (cp_parser* parser,
13486 cp_decl_specifier_seq *decl_specs,
13487 cp_parser_flags flags)
13489 tree type = NULL_TREE;
13492 /* Peek at the next token. */
13493 token = cp_lexer_peek_token (parser->lexer);
13495 /* If we're looking at a keyword, things are easy. */
13496 switch (token->keyword)
13500 decl_specs->explicit_char_p = true;
13501 type = char_type_node;
13504 type = char16_type_node;
13507 type = char32_type_node;
13510 type = wchar_type_node;
13513 type = boolean_type_node;
13517 ++decl_specs->specs[(int) ds_short];
13518 type = short_integer_type_node;
13522 decl_specs->explicit_int_p = true;
13523 type = integer_type_node;
13526 if (!int128_integer_type_node)
13529 decl_specs->explicit_int128_p = true;
13530 type = int128_integer_type_node;
13534 ++decl_specs->specs[(int) ds_long];
13535 type = long_integer_type_node;
13539 ++decl_specs->specs[(int) ds_signed];
13540 type = integer_type_node;
13544 ++decl_specs->specs[(int) ds_unsigned];
13545 type = unsigned_type_node;
13548 type = float_type_node;
13551 type = double_type_node;
13554 type = void_type_node;
13558 maybe_warn_cpp0x (CPP0X_AUTO);
13559 type = make_auto ();
13563 /* Since DR 743, decltype can either be a simple-type-specifier by
13564 itself or begin a nested-name-specifier. Parsing it will replace
13565 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13566 handling below decide what to do. */
13567 cp_parser_decltype (parser);
13568 cp_lexer_set_token_position (parser->lexer, token);
13572 /* Consume the `typeof' token. */
13573 cp_lexer_consume_token (parser->lexer);
13574 /* Parse the operand to `typeof'. */
13575 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
13576 /* If it is not already a TYPE, take its type. */
13577 if (!TYPE_P (type))
13578 type = finish_typeof (type);
13581 cp_parser_set_decl_spec_type (decl_specs, type,
13583 /*type_definition_p=*/false);
13587 case RID_UNDERLYING_TYPE:
13588 type = cp_parser_trait_expr (parser, RID_UNDERLYING_TYPE);
13590 cp_parser_set_decl_spec_type (decl_specs, type,
13592 /*type_definition_p=*/false);
13597 case RID_DIRECT_BASES:
13598 type = cp_parser_trait_expr (parser, token->keyword);
13600 cp_parser_set_decl_spec_type (decl_specs, type,
13602 /*type_definition_p=*/false);
13608 /* If token is an already-parsed decltype not followed by ::,
13609 it's a simple-type-specifier. */
13610 if (token->type == CPP_DECLTYPE
13611 && cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
13613 type = token->u.value;
13615 cp_parser_set_decl_spec_type (decl_specs, type,
13617 /*type_definition_p=*/false);
13618 cp_lexer_consume_token (parser->lexer);
13622 /* If the type-specifier was for a built-in type, we're done. */
13625 /* Record the type. */
13627 && (token->keyword != RID_SIGNED
13628 && token->keyword != RID_UNSIGNED
13629 && token->keyword != RID_SHORT
13630 && token->keyword != RID_LONG))
13631 cp_parser_set_decl_spec_type (decl_specs,
13634 /*type_definition_p=*/false);
13636 decl_specs->any_specifiers_p = true;
13638 /* Consume the token. */
13639 cp_lexer_consume_token (parser->lexer);
13641 /* There is no valid C++ program where a non-template type is
13642 followed by a "<". That usually indicates that the user thought
13643 that the type was a template. */
13644 cp_parser_check_for_invalid_template_id (parser, type, token->location);
13646 return TYPE_NAME (type);
13649 /* The type-specifier must be a user-defined type. */
13650 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
13655 /* Don't gobble tokens or issue error messages if this is an
13656 optional type-specifier. */
13657 if (flags & CP_PARSER_FLAGS_OPTIONAL)
13658 cp_parser_parse_tentatively (parser);
13660 /* Look for the optional `::' operator. */
13662 = (cp_parser_global_scope_opt (parser,
13663 /*current_scope_valid_p=*/false)
13665 /* Look for the nested-name specifier. */
13667 = (cp_parser_nested_name_specifier_opt (parser,
13668 /*typename_keyword_p=*/false,
13669 /*check_dependency_p=*/true,
13671 /*is_declaration=*/false)
13673 token = cp_lexer_peek_token (parser->lexer);
13674 /* If we have seen a nested-name-specifier, and the next token
13675 is `template', then we are using the template-id production. */
13677 && cp_parser_optional_template_keyword (parser))
13679 /* Look for the template-id. */
13680 type = cp_parser_template_id (parser,
13681 /*template_keyword_p=*/true,
13682 /*check_dependency_p=*/true,
13683 /*is_declaration=*/false);
13684 /* If the template-id did not name a type, we are out of
13686 if (TREE_CODE (type) != TYPE_DECL)
13688 cp_parser_error (parser, "expected template-id for type");
13692 /* Otherwise, look for a type-name. */
13694 type = cp_parser_type_name (parser);
13695 /* Keep track of all name-lookups performed in class scopes. */
13699 && TREE_CODE (type) == TYPE_DECL
13700 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
13701 maybe_note_name_used_in_class (DECL_NAME (type), type);
13702 /* If it didn't work out, we don't have a TYPE. */
13703 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
13704 && !cp_parser_parse_definitely (parser))
13706 if (type && decl_specs)
13707 cp_parser_set_decl_spec_type (decl_specs, type,
13709 /*type_definition_p=*/false);
13712 /* If we didn't get a type-name, issue an error message. */
13713 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
13715 cp_parser_error (parser, "expected type-name");
13716 return error_mark_node;
13719 if (type && type != error_mark_node)
13721 /* See if TYPE is an Objective-C type, and if so, parse and
13722 accept any protocol references following it. Do this before
13723 the cp_parser_check_for_invalid_template_id() call, because
13724 Objective-C types can be followed by '<...>' which would
13725 enclose protocol names rather than template arguments, and so
13726 everything is fine. */
13727 if (c_dialect_objc () && !parser->scope
13728 && (objc_is_id (type) || objc_is_class_name (type)))
13730 tree protos = cp_parser_objc_protocol_refs_opt (parser);
13731 tree qual_type = objc_get_protocol_qualified_type (type, protos);
13733 /* Clobber the "unqualified" type previously entered into
13734 DECL_SPECS with the new, improved protocol-qualified version. */
13736 decl_specs->type = qual_type;
13741 /* There is no valid C++ program where a non-template type is
13742 followed by a "<". That usually indicates that the user
13743 thought that the type was a template. */
13744 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type),
13751 /* Parse a type-name.
13757 simple-template-id [in c++0x]
13765 Returns a TYPE_DECL for the type. */
13768 cp_parser_type_name (cp_parser* parser)
13772 /* We can't know yet whether it is a class-name or not. */
13773 cp_parser_parse_tentatively (parser);
13774 /* Try a class-name. */
13775 type_decl = cp_parser_class_name (parser,
13776 /*typename_keyword_p=*/false,
13777 /*template_keyword_p=*/false,
13779 /*check_dependency_p=*/true,
13780 /*class_head_p=*/false,
13781 /*is_declaration=*/false);
13782 /* If it's not a class-name, keep looking. */
13783 if (!cp_parser_parse_definitely (parser))
13785 if (cxx_dialect < cxx0x)
13786 /* It must be a typedef-name or an enum-name. */
13787 return cp_parser_nonclass_name (parser);
13789 cp_parser_parse_tentatively (parser);
13790 /* It is either a simple-template-id representing an
13791 instantiation of an alias template... */
13792 type_decl = cp_parser_template_id (parser,
13793 /*template_keyword_p=*/false,
13794 /*check_dependency_p=*/false,
13795 /*is_declaration=*/false);
13796 /* Note that this must be an instantiation of an alias template
13797 because [temp.names]/6 says:
13799 A template-id that names an alias template specialization
13802 Whereas [temp.names]/7 says:
13804 A simple-template-id that names a class template
13805 specialization is a class-name. */
13806 if (type_decl != NULL_TREE
13807 && TREE_CODE (type_decl) == TYPE_DECL
13808 && TYPE_DECL_ALIAS_P (type_decl))
13809 gcc_assert (DECL_TEMPLATE_INSTANTIATION (type_decl));
13811 cp_parser_simulate_error (parser);
13813 if (!cp_parser_parse_definitely (parser))
13814 /* ... Or a typedef-name or an enum-name. */
13815 return cp_parser_nonclass_name (parser);
13821 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13829 Returns a TYPE_DECL for the type. */
13832 cp_parser_nonclass_name (cp_parser* parser)
13837 cp_token *token = cp_lexer_peek_token (parser->lexer);
13838 identifier = cp_parser_identifier (parser);
13839 if (identifier == error_mark_node)
13840 return error_mark_node;
13842 /* Look up the type-name. */
13843 type_decl = cp_parser_lookup_name_simple (parser, identifier, token->location);
13845 if (TREE_CODE (type_decl) == USING_DECL)
13847 if (!DECL_DEPENDENT_P (type_decl))
13848 type_decl = strip_using_decl (type_decl);
13849 else if (USING_DECL_TYPENAME_P (type_decl))
13851 /* We have found a type introduced by a using
13852 declaration at class scope that refers to a dependent
13855 using typename :: [opt] nested-name-specifier unqualified-id ;
13857 type_decl = make_typename_type (TREE_TYPE (type_decl),
13858 DECL_NAME (type_decl),
13859 typename_type, tf_error);
13860 if (type_decl != error_mark_node)
13861 type_decl = TYPE_NAME (type_decl);
13865 if (TREE_CODE (type_decl) != TYPE_DECL
13866 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
13868 /* See if this is an Objective-C type. */
13869 tree protos = cp_parser_objc_protocol_refs_opt (parser);
13870 tree type = objc_get_protocol_qualified_type (identifier, protos);
13872 type_decl = TYPE_NAME (type);
13875 /* Issue an error if we did not find a type-name. */
13876 if (TREE_CODE (type_decl) != TYPE_DECL
13877 /* In Objective-C, we have the complication that class names are
13878 normally type names and start declarations (eg, the
13879 "NSObject" in "NSObject *object;"), but can be used in an
13880 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13881 is an expression. So, a classname followed by a dot is not a
13882 valid type-name. */
13883 || (objc_is_class_name (TREE_TYPE (type_decl))
13884 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT))
13886 if (!cp_parser_simulate_error (parser))
13887 cp_parser_name_lookup_error (parser, identifier, type_decl,
13888 NLE_TYPE, token->location);
13889 return error_mark_node;
13891 /* Remember that the name was used in the definition of the
13892 current class so that we can check later to see if the
13893 meaning would have been different after the class was
13894 entirely defined. */
13895 else if (type_decl != error_mark_node
13897 maybe_note_name_used_in_class (identifier, type_decl);
13902 /* Parse an elaborated-type-specifier. Note that the grammar given
13903 here incorporates the resolution to DR68.
13905 elaborated-type-specifier:
13906 class-key :: [opt] nested-name-specifier [opt] identifier
13907 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13908 enum-key :: [opt] nested-name-specifier [opt] identifier
13909 typename :: [opt] nested-name-specifier identifier
13910 typename :: [opt] nested-name-specifier template [opt]
13915 elaborated-type-specifier:
13916 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13917 class-key attributes :: [opt] nested-name-specifier [opt]
13918 template [opt] template-id
13919 enum attributes :: [opt] nested-name-specifier [opt] identifier
13921 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13922 declared `friend'. If IS_DECLARATION is TRUE, then this
13923 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13924 something is being declared.
13926 Returns the TYPE specified. */
13929 cp_parser_elaborated_type_specifier (cp_parser* parser,
13931 bool is_declaration)
13933 enum tag_types tag_type;
13935 tree type = NULL_TREE;
13936 tree attributes = NULL_TREE;
13938 cp_token *token = NULL;
13940 /* See if we're looking at the `enum' keyword. */
13941 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
13943 /* Consume the `enum' token. */
13944 cp_lexer_consume_token (parser->lexer);
13945 /* Remember that it's an enumeration type. */
13946 tag_type = enum_type;
13947 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13948 enums) is used here. */
13949 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
13950 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
13952 pedwarn (input_location, 0, "elaborated-type-specifier "
13953 "for a scoped enum must not use the %<%D%> keyword",
13954 cp_lexer_peek_token (parser->lexer)->u.value);
13955 /* Consume the `struct' or `class' and parse it anyway. */
13956 cp_lexer_consume_token (parser->lexer);
13958 /* Parse the attributes. */
13959 attributes = cp_parser_attributes_opt (parser);
13961 /* Or, it might be `typename'. */
13962 else if (cp_lexer_next_token_is_keyword (parser->lexer,
13965 /* Consume the `typename' token. */
13966 cp_lexer_consume_token (parser->lexer);
13967 /* Remember that it's a `typename' type. */
13968 tag_type = typename_type;
13970 /* Otherwise it must be a class-key. */
13973 tag_type = cp_parser_class_key (parser);
13974 if (tag_type == none_type)
13975 return error_mark_node;
13976 /* Parse the attributes. */
13977 attributes = cp_parser_attributes_opt (parser);
13980 /* Look for the `::' operator. */
13981 globalscope = cp_parser_global_scope_opt (parser,
13982 /*current_scope_valid_p=*/false);
13983 /* Look for the nested-name-specifier. */
13984 if (tag_type == typename_type && !globalscope)
13986 if (!cp_parser_nested_name_specifier (parser,
13987 /*typename_keyword_p=*/true,
13988 /*check_dependency_p=*/true,
13991 return error_mark_node;
13994 /* Even though `typename' is not present, the proposed resolution
13995 to Core Issue 180 says that in `class A<T>::B', `B' should be
13996 considered a type-name, even if `A<T>' is dependent. */
13997 cp_parser_nested_name_specifier_opt (parser,
13998 /*typename_keyword_p=*/true,
13999 /*check_dependency_p=*/true,
14002 /* For everything but enumeration types, consider a template-id.
14003 For an enumeration type, consider only a plain identifier. */
14004 if (tag_type != enum_type)
14006 bool template_p = false;
14009 /* Allow the `template' keyword. */
14010 template_p = cp_parser_optional_template_keyword (parser);
14011 /* If we didn't see `template', we don't know if there's a
14012 template-id or not. */
14014 cp_parser_parse_tentatively (parser);
14015 /* Parse the template-id. */
14016 token = cp_lexer_peek_token (parser->lexer);
14017 decl = cp_parser_template_id (parser, template_p,
14018 /*check_dependency_p=*/true,
14020 /* If we didn't find a template-id, look for an ordinary
14022 if (!template_p && !cp_parser_parse_definitely (parser))
14024 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14025 in effect, then we must assume that, upon instantiation, the
14026 template will correspond to a class. */
14027 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
14028 && tag_type == typename_type)
14029 type = make_typename_type (parser->scope, decl,
14031 /*complain=*/tf_error);
14032 /* If the `typename' keyword is in effect and DECL is not a type
14033 decl. Then type is non existant. */
14034 else if (tag_type == typename_type && TREE_CODE (decl) != TYPE_DECL)
14037 type = check_elaborated_type_specifier (tag_type, decl,
14038 /*allow_template_p=*/true);
14043 token = cp_lexer_peek_token (parser->lexer);
14044 identifier = cp_parser_identifier (parser);
14046 if (identifier == error_mark_node)
14048 parser->scope = NULL_TREE;
14049 return error_mark_node;
14052 /* For a `typename', we needn't call xref_tag. */
14053 if (tag_type == typename_type
14054 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
14055 return cp_parser_make_typename_type (parser, parser->scope,
14058 /* Look up a qualified name in the usual way. */
14062 tree ambiguous_decls;
14064 decl = cp_parser_lookup_name (parser, identifier,
14066 /*is_template=*/false,
14067 /*is_namespace=*/false,
14068 /*check_dependency=*/true,
14072 /* If the lookup was ambiguous, an error will already have been
14074 if (ambiguous_decls)
14075 return error_mark_node;
14077 /* If we are parsing friend declaration, DECL may be a
14078 TEMPLATE_DECL tree node here. However, we need to check
14079 whether this TEMPLATE_DECL results in valid code. Consider
14080 the following example:
14083 template <class T> class C {};
14086 template <class T> friend class N::C; // #1, valid code
14088 template <class T> class Y {
14089 friend class N::C; // #2, invalid code
14092 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14093 name lookup of `N::C'. We see that friend declaration must
14094 be template for the code to be valid. Note that
14095 processing_template_decl does not work here since it is
14096 always 1 for the above two cases. */
14098 decl = (cp_parser_maybe_treat_template_as_class
14099 (decl, /*tag_name_p=*/is_friend
14100 && parser->num_template_parameter_lists));
14102 if (TREE_CODE (decl) != TYPE_DECL)
14104 cp_parser_diagnose_invalid_type_name (parser,
14108 return error_mark_node;
14111 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
14113 bool allow_template = (parser->num_template_parameter_lists
14114 || DECL_SELF_REFERENCE_P (decl));
14115 type = check_elaborated_type_specifier (tag_type, decl,
14118 if (type == error_mark_node)
14119 return error_mark_node;
14122 /* Forward declarations of nested types, such as
14127 are invalid unless all components preceding the final '::'
14128 are complete. If all enclosing types are complete, these
14129 declarations become merely pointless.
14131 Invalid forward declarations of nested types are errors
14132 caught elsewhere in parsing. Those that are pointless arrive
14135 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
14136 && !is_friend && !processing_explicit_instantiation)
14137 warning (0, "declaration %qD does not declare anything", decl);
14139 type = TREE_TYPE (decl);
14143 /* An elaborated-type-specifier sometimes introduces a new type and
14144 sometimes names an existing type. Normally, the rule is that it
14145 introduces a new type only if there is not an existing type of
14146 the same name already in scope. For example, given:
14149 void f() { struct S s; }
14151 the `struct S' in the body of `f' is the same `struct S' as in
14152 the global scope; the existing definition is used. However, if
14153 there were no global declaration, this would introduce a new
14154 local class named `S'.
14156 An exception to this rule applies to the following code:
14158 namespace N { struct S; }
14160 Here, the elaborated-type-specifier names a new type
14161 unconditionally; even if there is already an `S' in the
14162 containing scope this declaration names a new type.
14163 This exception only applies if the elaborated-type-specifier
14164 forms the complete declaration:
14168 A declaration consisting solely of `class-key identifier ;' is
14169 either a redeclaration of the name in the current scope or a
14170 forward declaration of the identifier as a class name. It
14171 introduces the name into the current scope.
14173 We are in this situation precisely when the next token is a `;'.
14175 An exception to the exception is that a `friend' declaration does
14176 *not* name a new type; i.e., given:
14178 struct S { friend struct T; };
14180 `T' is not a new type in the scope of `S'.
14182 Also, `new struct S' or `sizeof (struct S)' never results in the
14183 definition of a new type; a new type can only be declared in a
14184 declaration context. */
14190 /* Friends have special name lookup rules. */
14191 ts = ts_within_enclosing_non_class;
14192 else if (is_declaration
14193 && cp_lexer_next_token_is (parser->lexer,
14195 /* This is a `class-key identifier ;' */
14201 (parser->num_template_parameter_lists
14202 && (cp_parser_next_token_starts_class_definition_p (parser)
14203 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)));
14204 /* An unqualified name was used to reference this type, so
14205 there were no qualifying templates. */
14206 if (!cp_parser_check_template_parameters (parser,
14207 /*num_templates=*/0,
14209 /*declarator=*/NULL))
14210 return error_mark_node;
14211 type = xref_tag (tag_type, identifier, ts, template_p);
14215 if (type == error_mark_node)
14216 return error_mark_node;
14218 /* Allow attributes on forward declarations of classes. */
14221 if (TREE_CODE (type) == TYPENAME_TYPE)
14222 warning (OPT_Wattributes,
14223 "attributes ignored on uninstantiated type");
14224 else if (tag_type != enum_type && CLASSTYPE_TEMPLATE_INSTANTIATION (type)
14225 && ! processing_explicit_instantiation)
14226 warning (OPT_Wattributes,
14227 "attributes ignored on template instantiation");
14228 else if (is_declaration && cp_parser_declares_only_class_p (parser))
14229 cplus_decl_attributes (&type, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
14231 warning (OPT_Wattributes,
14232 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
14235 if (tag_type != enum_type)
14237 /* Indicate whether this class was declared as a `class' or as a
14239 if (TREE_CODE (type) == RECORD_TYPE)
14240 CLASSTYPE_DECLARED_CLASS (type) = (tag_type == class_type);
14241 cp_parser_check_class_key (tag_type, type);
14244 /* A "<" cannot follow an elaborated type specifier. If that
14245 happens, the user was probably trying to form a template-id. */
14246 cp_parser_check_for_invalid_template_id (parser, type, token->location);
14251 /* Parse an enum-specifier.
14254 enum-head { enumerator-list [opt] }
14255 enum-head { enumerator-list , } [C++0x]
14258 enum-key identifier [opt] enum-base [opt]
14259 enum-key nested-name-specifier identifier enum-base [opt]
14264 enum struct [C++0x]
14267 : type-specifier-seq
14269 opaque-enum-specifier:
14270 enum-key identifier enum-base [opt] ;
14273 enum-key attributes[opt] identifier [opt] enum-base [opt]
14274 { enumerator-list [opt] }attributes[opt]
14275 enum-key attributes[opt] identifier [opt] enum-base [opt]
14276 { enumerator-list, }attributes[opt] [C++0x]
14278 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14279 if the token stream isn't an enum-specifier after all. */
14282 cp_parser_enum_specifier (cp_parser* parser)
14285 tree type = NULL_TREE;
14287 tree nested_name_specifier = NULL_TREE;
14289 bool scoped_enum_p = false;
14290 bool has_underlying_type = false;
14291 bool nested_being_defined = false;
14292 bool new_value_list = false;
14293 bool is_new_type = false;
14294 bool is_anonymous = false;
14295 tree underlying_type = NULL_TREE;
14296 cp_token *type_start_token = NULL;
14297 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
14299 parser->colon_corrects_to_scope_p = false;
14301 /* Parse tentatively so that we can back up if we don't find a
14303 cp_parser_parse_tentatively (parser);
14305 /* Caller guarantees that the current token is 'enum', an identifier
14306 possibly follows, and the token after that is an opening brace.
14307 If we don't have an identifier, fabricate an anonymous name for
14308 the enumeration being defined. */
14309 cp_lexer_consume_token (parser->lexer);
14311 /* Parse the "class" or "struct", which indicates a scoped
14312 enumeration type in C++0x. */
14313 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_CLASS)
14314 || cp_lexer_next_token_is_keyword (parser->lexer, RID_STRUCT))
14316 if (cxx_dialect < cxx0x)
14317 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS);
14319 /* Consume the `struct' or `class' token. */
14320 cp_lexer_consume_token (parser->lexer);
14322 scoped_enum_p = true;
14325 attributes = cp_parser_attributes_opt (parser);
14327 /* Clear the qualification. */
14328 parser->scope = NULL_TREE;
14329 parser->qualifying_scope = NULL_TREE;
14330 parser->object_scope = NULL_TREE;
14332 /* Figure out in what scope the declaration is being placed. */
14333 prev_scope = current_scope ();
14335 type_start_token = cp_lexer_peek_token (parser->lexer);
14337 push_deferring_access_checks (dk_no_check);
14338 nested_name_specifier
14339 = cp_parser_nested_name_specifier_opt (parser,
14340 /*typename_keyword_p=*/true,
14341 /*check_dependency_p=*/false,
14343 /*is_declaration=*/false);
14345 if (nested_name_specifier)
14349 identifier = cp_parser_identifier (parser);
14350 name = cp_parser_lookup_name (parser, identifier,
14352 /*is_template=*/false,
14353 /*is_namespace=*/false,
14354 /*check_dependency=*/true,
14355 /*ambiguous_decls=*/NULL,
14359 type = TREE_TYPE (name);
14360 if (TREE_CODE (type) == TYPENAME_TYPE)
14362 /* Are template enums allowed in ISO? */
14363 if (template_parm_scope_p ())
14364 pedwarn (type_start_token->location, OPT_pedantic,
14365 "%qD is an enumeration template", name);
14366 /* ignore a typename reference, for it will be solved by name
14372 error_at (type_start_token->location,
14373 "%qD is not an enumerator-name", identifier);
14377 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
14378 identifier = cp_parser_identifier (parser);
14381 identifier = make_anon_name ();
14382 is_anonymous = true;
14385 pop_deferring_access_checks ();
14387 /* Check for the `:' that denotes a specified underlying type in C++0x.
14388 Note that a ':' could also indicate a bitfield width, however. */
14389 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
14391 cp_decl_specifier_seq type_specifiers;
14393 /* Consume the `:'. */
14394 cp_lexer_consume_token (parser->lexer);
14396 /* Parse the type-specifier-seq. */
14397 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
14398 /*is_trailing_return=*/false,
14401 /* At this point this is surely not elaborated type specifier. */
14402 if (!cp_parser_parse_definitely (parser))
14405 if (cxx_dialect < cxx0x)
14406 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS);
14408 has_underlying_type = true;
14410 /* If that didn't work, stop. */
14411 if (type_specifiers.type != error_mark_node)
14413 underlying_type = grokdeclarator (NULL, &type_specifiers, TYPENAME,
14414 /*initialized=*/0, NULL);
14415 if (underlying_type == error_mark_node)
14416 underlying_type = NULL_TREE;
14420 /* Look for the `{' but don't consume it yet. */
14421 if (!cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14423 if (cxx_dialect < cxx0x || (!scoped_enum_p && !underlying_type))
14425 cp_parser_error (parser, "expected %<{%>");
14426 if (has_underlying_type)
14432 /* An opaque-enum-specifier must have a ';' here. */
14433 if ((scoped_enum_p || underlying_type)
14434 && cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
14436 cp_parser_error (parser, "expected %<;%> or %<{%>");
14437 if (has_underlying_type)
14445 if (!has_underlying_type && !cp_parser_parse_definitely (parser))
14448 if (nested_name_specifier)
14450 if (CLASS_TYPE_P (nested_name_specifier))
14452 nested_being_defined = TYPE_BEING_DEFINED (nested_name_specifier);
14453 TYPE_BEING_DEFINED (nested_name_specifier) = 1;
14454 push_scope (nested_name_specifier);
14456 else if (TREE_CODE (nested_name_specifier) == NAMESPACE_DECL)
14458 push_nested_namespace (nested_name_specifier);
14462 /* Issue an error message if type-definitions are forbidden here. */
14463 if (!cp_parser_check_type_definition (parser))
14464 type = error_mark_node;
14466 /* Create the new type. We do this before consuming the opening
14467 brace so the enum will be recorded as being on the line of its
14468 tag (or the 'enum' keyword, if there is no tag). */
14469 type = start_enum (identifier, type, underlying_type,
14470 scoped_enum_p, &is_new_type);
14472 /* If the next token is not '{' it is an opaque-enum-specifier or an
14473 elaborated-type-specifier. */
14474 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14476 timevar_push (TV_PARSE_ENUM);
14477 if (nested_name_specifier)
14479 /* The following catches invalid code such as:
14480 enum class S<int>::E { A, B, C }; */
14481 if (!processing_specialization
14482 && CLASS_TYPE_P (nested_name_specifier)
14483 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier))
14484 error_at (type_start_token->location, "cannot add an enumerator "
14485 "list to a template instantiation");
14487 /* If that scope does not contain the scope in which the
14488 class was originally declared, the program is invalid. */
14489 if (prev_scope && !is_ancestor (prev_scope, nested_name_specifier))
14491 if (at_namespace_scope_p ())
14492 error_at (type_start_token->location,
14493 "declaration of %qD in namespace %qD which does not "
14495 type, prev_scope, nested_name_specifier);
14497 error_at (type_start_token->location,
14498 "declaration of %qD in %qD which does not enclose %qD",
14499 type, prev_scope, nested_name_specifier);
14500 type = error_mark_node;
14505 begin_scope (sk_scoped_enum, type);
14507 /* Consume the opening brace. */
14508 cp_lexer_consume_token (parser->lexer);
14510 if (type == error_mark_node)
14511 ; /* Nothing to add */
14512 else if (OPAQUE_ENUM_P (type)
14513 || (cxx_dialect > cxx98 && processing_specialization))
14515 new_value_list = true;
14516 SET_OPAQUE_ENUM_P (type, false);
14517 DECL_SOURCE_LOCATION (TYPE_NAME (type)) = type_start_token->location;
14521 error_at (type_start_token->location, "multiple definition of %q#T", type);
14522 error_at (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type)),
14523 "previous definition here");
14524 type = error_mark_node;
14527 if (type == error_mark_node)
14528 cp_parser_skip_to_end_of_block_or_statement (parser);
14529 /* If the next token is not '}', then there are some enumerators. */
14530 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
14531 cp_parser_enumerator_list (parser, type);
14533 /* Consume the final '}'. */
14534 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
14538 timevar_pop (TV_PARSE_ENUM);
14542 /* If a ';' follows, then it is an opaque-enum-specifier
14543 and additional restrictions apply. */
14544 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14547 error_at (type_start_token->location,
14548 "opaque-enum-specifier without name");
14549 else if (nested_name_specifier)
14550 error_at (type_start_token->location,
14551 "opaque-enum-specifier must use a simple identifier");
14555 /* Look for trailing attributes to apply to this enumeration, and
14556 apply them if appropriate. */
14557 if (cp_parser_allow_gnu_extensions_p (parser))
14559 tree trailing_attr = cp_parser_attributes_opt (parser);
14560 trailing_attr = chainon (trailing_attr, attributes);
14561 cplus_decl_attributes (&type,
14563 (int) ATTR_FLAG_TYPE_IN_PLACE);
14566 /* Finish up the enumeration. */
14567 if (type != error_mark_node)
14569 if (new_value_list)
14570 finish_enum_value_list (type);
14572 finish_enum (type);
14575 if (nested_name_specifier)
14577 if (CLASS_TYPE_P (nested_name_specifier))
14579 TYPE_BEING_DEFINED (nested_name_specifier) = nested_being_defined;
14580 pop_scope (nested_name_specifier);
14582 else if (TREE_CODE (nested_name_specifier) == NAMESPACE_DECL)
14584 pop_nested_namespace (nested_name_specifier);
14588 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
14592 /* Parse an enumerator-list. The enumerators all have the indicated
14596 enumerator-definition
14597 enumerator-list , enumerator-definition */
14600 cp_parser_enumerator_list (cp_parser* parser, tree type)
14604 /* Parse an enumerator-definition. */
14605 cp_parser_enumerator_definition (parser, type);
14607 /* If the next token is not a ',', we've reached the end of
14609 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14611 /* Otherwise, consume the `,' and keep going. */
14612 cp_lexer_consume_token (parser->lexer);
14613 /* If the next token is a `}', there is a trailing comma. */
14614 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
14616 if (cxx_dialect < cxx0x && !in_system_header)
14617 pedwarn (input_location, OPT_pedantic,
14618 "comma at end of enumerator list");
14624 /* Parse an enumerator-definition. The enumerator has the indicated
14627 enumerator-definition:
14629 enumerator = constant-expression
14635 cp_parser_enumerator_definition (cp_parser* parser, tree type)
14641 /* Save the input location because we are interested in the location
14642 of the identifier and not the location of the explicit value. */
14643 loc = cp_lexer_peek_token (parser->lexer)->location;
14645 /* Look for the identifier. */
14646 identifier = cp_parser_identifier (parser);
14647 if (identifier == error_mark_node)
14650 /* If the next token is an '=', then there is an explicit value. */
14651 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
14653 /* Consume the `=' token. */
14654 cp_lexer_consume_token (parser->lexer);
14655 /* Parse the value. */
14656 value = cp_parser_constant_expression (parser,
14657 /*allow_non_constant_p=*/false,
14663 /* If we are processing a template, make sure the initializer of the
14664 enumerator doesn't contain any bare template parameter pack. */
14665 if (check_for_bare_parameter_packs (value))
14666 value = error_mark_node;
14668 /* integral_constant_value will pull out this expression, so make sure
14669 it's folded as appropriate. */
14670 value = fold_non_dependent_expr (value);
14672 /* Create the enumerator. */
14673 build_enumerator (identifier, value, type, loc);
14676 /* Parse a namespace-name.
14679 original-namespace-name
14682 Returns the NAMESPACE_DECL for the namespace. */
14685 cp_parser_namespace_name (cp_parser* parser)
14688 tree namespace_decl;
14690 cp_token *token = cp_lexer_peek_token (parser->lexer);
14692 /* Get the name of the namespace. */
14693 identifier = cp_parser_identifier (parser);
14694 if (identifier == error_mark_node)
14695 return error_mark_node;
14697 /* Look up the identifier in the currently active scope. Look only
14698 for namespaces, due to:
14700 [basic.lookup.udir]
14702 When looking up a namespace-name in a using-directive or alias
14703 definition, only namespace names are considered.
14707 [basic.lookup.qual]
14709 During the lookup of a name preceding the :: scope resolution
14710 operator, object, function, and enumerator names are ignored.
14712 (Note that cp_parser_qualifying_entity only calls this
14713 function if the token after the name is the scope resolution
14715 namespace_decl = cp_parser_lookup_name (parser, identifier,
14717 /*is_template=*/false,
14718 /*is_namespace=*/true,
14719 /*check_dependency=*/true,
14720 /*ambiguous_decls=*/NULL,
14722 /* If it's not a namespace, issue an error. */
14723 if (namespace_decl == error_mark_node
14724 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
14726 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
14727 error_at (token->location, "%qD is not a namespace-name", identifier);
14728 cp_parser_error (parser, "expected namespace-name");
14729 namespace_decl = error_mark_node;
14732 return namespace_decl;
14735 /* Parse a namespace-definition.
14737 namespace-definition:
14738 named-namespace-definition
14739 unnamed-namespace-definition
14741 named-namespace-definition:
14742 original-namespace-definition
14743 extension-namespace-definition
14745 original-namespace-definition:
14746 namespace identifier { namespace-body }
14748 extension-namespace-definition:
14749 namespace original-namespace-name { namespace-body }
14751 unnamed-namespace-definition:
14752 namespace { namespace-body } */
14755 cp_parser_namespace_definition (cp_parser* parser)
14757 tree identifier, attribs;
14758 bool has_visibility;
14761 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_INLINE))
14763 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES);
14765 cp_lexer_consume_token (parser->lexer);
14770 /* Look for the `namespace' keyword. */
14771 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
14773 /* Get the name of the namespace. We do not attempt to distinguish
14774 between an original-namespace-definition and an
14775 extension-namespace-definition at this point. The semantic
14776 analysis routines are responsible for that. */
14777 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
14778 identifier = cp_parser_identifier (parser);
14780 identifier = NULL_TREE;
14782 /* Parse any specified attributes. */
14783 attribs = cp_parser_attributes_opt (parser);
14785 /* Look for the `{' to start the namespace. */
14786 cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE);
14787 /* Start the namespace. */
14788 push_namespace (identifier);
14790 /* "inline namespace" is equivalent to a stub namespace definition
14791 followed by a strong using directive. */
14794 tree name_space = current_namespace;
14795 /* Set up namespace association. */
14796 DECL_NAMESPACE_ASSOCIATIONS (name_space)
14797 = tree_cons (CP_DECL_CONTEXT (name_space), NULL_TREE,
14798 DECL_NAMESPACE_ASSOCIATIONS (name_space));
14799 /* Import the contents of the inline namespace. */
14801 do_using_directive (name_space);
14802 push_namespace (identifier);
14805 has_visibility = handle_namespace_attrs (current_namespace, attribs);
14807 /* Parse the body of the namespace. */
14808 cp_parser_namespace_body (parser);
14810 if (has_visibility)
14811 pop_visibility (1);
14813 /* Finish the namespace. */
14815 /* Look for the final `}'. */
14816 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
14819 /* Parse a namespace-body.
14822 declaration-seq [opt] */
14825 cp_parser_namespace_body (cp_parser* parser)
14827 cp_parser_declaration_seq_opt (parser);
14830 /* Parse a namespace-alias-definition.
14832 namespace-alias-definition:
14833 namespace identifier = qualified-namespace-specifier ; */
14836 cp_parser_namespace_alias_definition (cp_parser* parser)
14839 tree namespace_specifier;
14841 cp_token *token = cp_lexer_peek_token (parser->lexer);
14843 /* Look for the `namespace' keyword. */
14844 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
14845 /* Look for the identifier. */
14846 identifier = cp_parser_identifier (parser);
14847 if (identifier == error_mark_node)
14849 /* Look for the `=' token. */
14850 if (!cp_parser_uncommitted_to_tentative_parse_p (parser)
14851 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
14853 error_at (token->location, "%<namespace%> definition is not allowed here");
14854 /* Skip the definition. */
14855 cp_lexer_consume_token (parser->lexer);
14856 if (cp_parser_skip_to_closing_brace (parser))
14857 cp_lexer_consume_token (parser->lexer);
14860 cp_parser_require (parser, CPP_EQ, RT_EQ);
14861 /* Look for the qualified-namespace-specifier. */
14862 namespace_specifier
14863 = cp_parser_qualified_namespace_specifier (parser);
14864 /* Look for the `;' token. */
14865 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
14867 /* Register the alias in the symbol table. */
14868 do_namespace_alias (identifier, namespace_specifier);
14871 /* Parse a qualified-namespace-specifier.
14873 qualified-namespace-specifier:
14874 :: [opt] nested-name-specifier [opt] namespace-name
14876 Returns a NAMESPACE_DECL corresponding to the specified
14880 cp_parser_qualified_namespace_specifier (cp_parser* parser)
14882 /* Look for the optional `::'. */
14883 cp_parser_global_scope_opt (parser,
14884 /*current_scope_valid_p=*/false);
14886 /* Look for the optional nested-name-specifier. */
14887 cp_parser_nested_name_specifier_opt (parser,
14888 /*typename_keyword_p=*/false,
14889 /*check_dependency_p=*/true,
14891 /*is_declaration=*/true);
14893 return cp_parser_namespace_name (parser);
14896 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14897 access declaration.
14900 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14901 using :: unqualified-id ;
14903 access-declaration:
14909 cp_parser_using_declaration (cp_parser* parser,
14910 bool access_declaration_p)
14913 bool typename_p = false;
14914 bool global_scope_p;
14918 int oldcount = errorcount;
14919 cp_token *diag_token = NULL;
14921 if (access_declaration_p)
14923 diag_token = cp_lexer_peek_token (parser->lexer);
14924 cp_parser_parse_tentatively (parser);
14928 /* Look for the `using' keyword. */
14929 cp_parser_require_keyword (parser, RID_USING, RT_USING);
14931 /* Peek at the next token. */
14932 token = cp_lexer_peek_token (parser->lexer);
14933 /* See if it's `typename'. */
14934 if (token->keyword == RID_TYPENAME)
14936 /* Remember that we've seen it. */
14938 /* Consume the `typename' token. */
14939 cp_lexer_consume_token (parser->lexer);
14943 /* Look for the optional global scope qualification. */
14945 = (cp_parser_global_scope_opt (parser,
14946 /*current_scope_valid_p=*/false)
14949 /* If we saw `typename', or didn't see `::', then there must be a
14950 nested-name-specifier present. */
14951 if (typename_p || !global_scope_p)
14952 qscope = cp_parser_nested_name_specifier (parser, typename_p,
14953 /*check_dependency_p=*/true,
14955 /*is_declaration=*/true);
14956 /* Otherwise, we could be in either of the two productions. In that
14957 case, treat the nested-name-specifier as optional. */
14959 qscope = cp_parser_nested_name_specifier_opt (parser,
14960 /*typename_keyword_p=*/false,
14961 /*check_dependency_p=*/true,
14963 /*is_declaration=*/true);
14965 qscope = global_namespace;
14967 if (access_declaration_p && cp_parser_error_occurred (parser))
14968 /* Something has already gone wrong; there's no need to parse
14969 further. Since an error has occurred, the return value of
14970 cp_parser_parse_definitely will be false, as required. */
14971 return cp_parser_parse_definitely (parser);
14973 token = cp_lexer_peek_token (parser->lexer);
14974 /* Parse the unqualified-id. */
14975 identifier = cp_parser_unqualified_id (parser,
14976 /*template_keyword_p=*/false,
14977 /*check_dependency_p=*/true,
14978 /*declarator_p=*/true,
14979 /*optional_p=*/false);
14981 if (access_declaration_p)
14983 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
14984 cp_parser_simulate_error (parser);
14985 if (!cp_parser_parse_definitely (parser))
14989 /* The function we call to handle a using-declaration is different
14990 depending on what scope we are in. */
14991 if (qscope == error_mark_node || identifier == error_mark_node)
14993 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
14994 && TREE_CODE (identifier) != BIT_NOT_EXPR)
14995 /* [namespace.udecl]
14997 A using declaration shall not name a template-id. */
14998 error_at (token->location,
14999 "a template-id may not appear in a using-declaration");
15002 if (at_class_scope_p ())
15004 /* Create the USING_DECL. */
15005 decl = do_class_using_decl (parser->scope, identifier);
15007 if (decl && typename_p)
15008 USING_DECL_TYPENAME_P (decl) = 1;
15010 if (check_for_bare_parameter_packs (decl))
15013 /* Add it to the list of members in this class. */
15014 finish_member_declaration (decl);
15018 decl = cp_parser_lookup_name_simple (parser,
15021 if (decl == error_mark_node)
15022 cp_parser_name_lookup_error (parser, identifier,
15025 else if (check_for_bare_parameter_packs (decl))
15027 else if (!at_namespace_scope_p ())
15028 do_local_using_decl (decl, qscope, identifier);
15030 do_toplevel_using_decl (decl, qscope, identifier);
15034 /* Look for the final `;'. */
15035 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15037 if (access_declaration_p && errorcount == oldcount)
15038 warning_at (diag_token->location, OPT_Wdeprecated,
15039 "access declarations are deprecated "
15040 "in favour of using-declarations; "
15041 "suggestion: add the %<using%> keyword");
15046 /* Parse an alias-declaration.
15049 using identifier attribute-specifier-seq [opt] = type-id */
15052 cp_parser_alias_declaration (cp_parser* parser)
15054 tree id, type, decl, pushed_scope = NULL_TREE, attributes;
15055 location_t id_location;
15056 cp_declarator *declarator;
15057 cp_decl_specifier_seq decl_specs;
15059 const char *saved_message = NULL;
15061 /* Look for the `using' keyword. */
15062 cp_parser_require_keyword (parser, RID_USING, RT_USING);
15063 id_location = cp_lexer_peek_token (parser->lexer)->location;
15064 id = cp_parser_identifier (parser);
15065 if (id == error_mark_node)
15066 return error_mark_node;
15068 attributes = cp_parser_attributes_opt (parser);
15069 if (attributes == error_mark_node)
15070 return error_mark_node;
15072 cp_parser_require (parser, CPP_EQ, RT_EQ);
15074 /* Now we are going to parse the type-id of the declaration. */
15079 "A type-specifier-seq shall not define a class or enumeration
15080 unless it appears in the type-id of an alias-declaration (7.1.3) that
15081 is not the declaration of a template-declaration."
15083 In other words, if we currently are in an alias template, the
15084 type-id should not define a type.
15086 So let's set parser->type_definition_forbidden_message in that
15087 case; cp_parser_check_type_definition (called by
15088 cp_parser_class_specifier) will then emit an error if a type is
15089 defined in the type-id. */
15090 if (parser->num_template_parameter_lists)
15092 saved_message = parser->type_definition_forbidden_message;
15093 parser->type_definition_forbidden_message =
15094 G_("types may not be defined in alias template declarations");
15097 type = cp_parser_type_id (parser);
15099 /* Restore the error message if need be. */
15100 if (parser->num_template_parameter_lists)
15101 parser->type_definition_forbidden_message = saved_message;
15103 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15105 if (cp_parser_error_occurred (parser))
15106 return error_mark_node;
15108 /* A typedef-name can also be introduced by an alias-declaration. The
15109 identifier following the using keyword becomes a typedef-name. It has
15110 the same semantics as if it were introduced by the typedef
15111 specifier. In particular, it does not define a new type and it shall
15112 not appear in the type-id. */
15114 clear_decl_specs (&decl_specs);
15115 decl_specs.type = type;
15116 decl_specs.attributes = attributes;
15117 ++decl_specs.specs[(int) ds_typedef];
15118 ++decl_specs.specs[(int) ds_alias];
15120 declarator = make_id_declarator (NULL_TREE, id, sfk_none);
15121 declarator->id_loc = id_location;
15123 member_p = at_class_scope_p ();
15125 decl = grokfield (declarator, &decl_specs, NULL_TREE, false,
15126 NULL_TREE, attributes);
15128 decl = start_decl (declarator, &decl_specs, 0,
15129 attributes, NULL_TREE, &pushed_scope);
15130 if (decl == error_mark_node)
15133 cp_finish_decl (decl, NULL_TREE, 0, NULL_TREE, 0);
15136 pop_scope (pushed_scope);
15138 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15139 added into the symbol table; otherwise, return the TYPE_DECL. */
15140 if (DECL_LANG_SPECIFIC (decl)
15141 && DECL_TEMPLATE_INFO (decl)
15142 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl)))
15144 decl = DECL_TI_TEMPLATE (decl);
15146 check_member_template (decl);
15152 /* Parse a using-directive.
15155 using namespace :: [opt] nested-name-specifier [opt]
15156 namespace-name ; */
15159 cp_parser_using_directive (cp_parser* parser)
15161 tree namespace_decl;
15164 /* Look for the `using' keyword. */
15165 cp_parser_require_keyword (parser, RID_USING, RT_USING);
15166 /* And the `namespace' keyword. */
15167 cp_parser_require_keyword (parser, RID_NAMESPACE, RT_NAMESPACE);
15168 /* Look for the optional `::' operator. */
15169 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
15170 /* And the optional nested-name-specifier. */
15171 cp_parser_nested_name_specifier_opt (parser,
15172 /*typename_keyword_p=*/false,
15173 /*check_dependency_p=*/true,
15175 /*is_declaration=*/true);
15176 /* Get the namespace being used. */
15177 namespace_decl = cp_parser_namespace_name (parser);
15178 /* And any specified attributes. */
15179 attribs = cp_parser_attributes_opt (parser);
15180 /* Update the symbol table. */
15181 parse_using_directive (namespace_decl, attribs);
15182 /* Look for the final `;'. */
15183 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15186 /* Parse an asm-definition.
15189 asm ( string-literal ) ;
15194 asm volatile [opt] ( string-literal ) ;
15195 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15196 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15197 : asm-operand-list [opt] ) ;
15198 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15199 : asm-operand-list [opt]
15200 : asm-clobber-list [opt] ) ;
15201 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15202 : asm-clobber-list [opt]
15203 : asm-goto-list ) ; */
15206 cp_parser_asm_definition (cp_parser* parser)
15209 tree outputs = NULL_TREE;
15210 tree inputs = NULL_TREE;
15211 tree clobbers = NULL_TREE;
15212 tree labels = NULL_TREE;
15214 bool volatile_p = false;
15215 bool extended_p = false;
15216 bool invalid_inputs_p = false;
15217 bool invalid_outputs_p = false;
15218 bool goto_p = false;
15219 required_token missing = RT_NONE;
15221 /* Look for the `asm' keyword. */
15222 cp_parser_require_keyword (parser, RID_ASM, RT_ASM);
15223 /* See if the next token is `volatile'. */
15224 if (cp_parser_allow_gnu_extensions_p (parser)
15225 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
15227 /* Remember that we saw the `volatile' keyword. */
15229 /* Consume the token. */
15230 cp_lexer_consume_token (parser->lexer);
15232 if (cp_parser_allow_gnu_extensions_p (parser)
15233 && parser->in_function_body
15234 && cp_lexer_next_token_is_keyword (parser->lexer, RID_GOTO))
15236 /* Remember that we saw the `goto' keyword. */
15238 /* Consume the token. */
15239 cp_lexer_consume_token (parser->lexer);
15241 /* Look for the opening `('. */
15242 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
15244 /* Look for the string. */
15245 string = cp_parser_string_literal (parser, false, false);
15246 if (string == error_mark_node)
15248 cp_parser_skip_to_closing_parenthesis (parser, true, false,
15249 /*consume_paren=*/true);
15253 /* If we're allowing GNU extensions, check for the extended assembly
15254 syntax. Unfortunately, the `:' tokens need not be separated by
15255 a space in C, and so, for compatibility, we tolerate that here
15256 too. Doing that means that we have to treat the `::' operator as
15258 if (cp_parser_allow_gnu_extensions_p (parser)
15259 && parser->in_function_body
15260 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
15261 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
15263 bool inputs_p = false;
15264 bool clobbers_p = false;
15265 bool labels_p = false;
15267 /* The extended syntax was used. */
15270 /* Look for outputs. */
15271 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15273 /* Consume the `:'. */
15274 cp_lexer_consume_token (parser->lexer);
15275 /* Parse the output-operands. */
15276 if (cp_lexer_next_token_is_not (parser->lexer,
15278 && cp_lexer_next_token_is_not (parser->lexer,
15280 && cp_lexer_next_token_is_not (parser->lexer,
15283 outputs = cp_parser_asm_operand_list (parser);
15285 if (outputs == error_mark_node)
15286 invalid_outputs_p = true;
15288 /* If the next token is `::', there are no outputs, and the
15289 next token is the beginning of the inputs. */
15290 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
15291 /* The inputs are coming next. */
15294 /* Look for inputs. */
15296 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15298 /* Consume the `:' or `::'. */
15299 cp_lexer_consume_token (parser->lexer);
15300 /* Parse the output-operands. */
15301 if (cp_lexer_next_token_is_not (parser->lexer,
15303 && cp_lexer_next_token_is_not (parser->lexer,
15305 && cp_lexer_next_token_is_not (parser->lexer,
15307 inputs = cp_parser_asm_operand_list (parser);
15309 if (inputs == error_mark_node)
15310 invalid_inputs_p = true;
15312 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
15313 /* The clobbers are coming next. */
15316 /* Look for clobbers. */
15318 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
15321 /* Consume the `:' or `::'. */
15322 cp_lexer_consume_token (parser->lexer);
15323 /* Parse the clobbers. */
15324 if (cp_lexer_next_token_is_not (parser->lexer,
15326 && cp_lexer_next_token_is_not (parser->lexer,
15328 clobbers = cp_parser_asm_clobber_list (parser);
15331 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
15332 /* The labels are coming next. */
15335 /* Look for labels. */
15337 || (goto_p && cp_lexer_next_token_is (parser->lexer, CPP_COLON)))
15340 /* Consume the `:' or `::'. */
15341 cp_lexer_consume_token (parser->lexer);
15342 /* Parse the labels. */
15343 labels = cp_parser_asm_label_list (parser);
15346 if (goto_p && !labels_p)
15347 missing = clobbers_p ? RT_COLON : RT_COLON_SCOPE;
15350 missing = RT_COLON_SCOPE;
15352 /* Look for the closing `)'. */
15353 if (!cp_parser_require (parser, missing ? CPP_COLON : CPP_CLOSE_PAREN,
15354 missing ? missing : RT_CLOSE_PAREN))
15355 cp_parser_skip_to_closing_parenthesis (parser, true, false,
15356 /*consume_paren=*/true);
15357 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
15359 if (!invalid_inputs_p && !invalid_outputs_p)
15361 /* Create the ASM_EXPR. */
15362 if (parser->in_function_body)
15364 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
15365 inputs, clobbers, labels);
15366 /* If the extended syntax was not used, mark the ASM_EXPR. */
15369 tree temp = asm_stmt;
15370 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
15371 temp = TREE_OPERAND (temp, 0);
15373 ASM_INPUT_P (temp) = 1;
15377 cgraph_add_asm_node (string);
15381 /* Declarators [gram.dcl.decl] */
15383 /* Parse an init-declarator.
15386 declarator initializer [opt]
15391 declarator asm-specification [opt] attributes [opt] initializer [opt]
15393 function-definition:
15394 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15396 decl-specifier-seq [opt] declarator function-try-block
15400 function-definition:
15401 __extension__ function-definition
15405 function-definition:
15406 decl-specifier-seq [opt] declarator function-transaction-block
15408 The DECL_SPECIFIERS apply to this declarator. Returns a
15409 representation of the entity declared. If MEMBER_P is TRUE, then
15410 this declarator appears in a class scope. The new DECL created by
15411 this declarator is returned.
15413 The CHECKS are access checks that should be performed once we know
15414 what entity is being declared (and, therefore, what classes have
15417 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15418 for a function-definition here as well. If the declarator is a
15419 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15420 be TRUE upon return. By that point, the function-definition will
15421 have been completely parsed.
15423 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15426 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15427 parsed declaration if it is an uninitialized single declarator not followed
15428 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15429 if present, will not be consumed. If returned, this declarator will be
15430 created with SD_INITIALIZED but will not call cp_finish_decl. */
15433 cp_parser_init_declarator (cp_parser* parser,
15434 cp_decl_specifier_seq *decl_specifiers,
15435 VEC (deferred_access_check,gc)* checks,
15436 bool function_definition_allowed_p,
15438 int declares_class_or_enum,
15439 bool* function_definition_p,
15440 tree* maybe_range_for_decl)
15442 cp_token *token = NULL, *asm_spec_start_token = NULL,
15443 *attributes_start_token = NULL;
15444 cp_declarator *declarator;
15445 tree prefix_attributes;
15447 tree asm_specification;
15449 tree decl = NULL_TREE;
15451 int is_initialized;
15452 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15453 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15455 enum cpp_ttype initialization_kind;
15456 bool is_direct_init = false;
15457 bool is_non_constant_init;
15458 int ctor_dtor_or_conv_p;
15460 tree pushed_scope = NULL_TREE;
15461 bool range_for_decl_p = false;
15463 /* Gather the attributes that were provided with the
15464 decl-specifiers. */
15465 prefix_attributes = decl_specifiers->attributes;
15467 /* Assume that this is not the declarator for a function
15469 if (function_definition_p)
15470 *function_definition_p = false;
15472 /* Defer access checks while parsing the declarator; we cannot know
15473 what names are accessible until we know what is being
15475 resume_deferring_access_checks ();
15477 /* Parse the declarator. */
15478 token = cp_lexer_peek_token (parser->lexer);
15480 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
15481 &ctor_dtor_or_conv_p,
15482 /*parenthesized_p=*/NULL,
15484 /* Gather up the deferred checks. */
15485 stop_deferring_access_checks ();
15487 /* If the DECLARATOR was erroneous, there's no need to go
15489 if (declarator == cp_error_declarator)
15490 return error_mark_node;
15492 /* Check that the number of template-parameter-lists is OK. */
15493 if (!cp_parser_check_declarator_template_parameters (parser, declarator,
15495 return error_mark_node;
15497 if (declares_class_or_enum & 2)
15498 cp_parser_check_for_definition_in_return_type (declarator,
15499 decl_specifiers->type,
15500 decl_specifiers->type_location);
15502 /* Figure out what scope the entity declared by the DECLARATOR is
15503 located in. `grokdeclarator' sometimes changes the scope, so
15504 we compute it now. */
15505 scope = get_scope_of_declarator (declarator);
15507 /* Perform any lookups in the declared type which were thought to be
15508 dependent, but are not in the scope of the declarator. */
15509 decl_specifiers->type
15510 = maybe_update_decl_type (decl_specifiers->type, scope);
15512 /* If we're allowing GNU extensions, look for an asm-specification
15514 if (cp_parser_allow_gnu_extensions_p (parser))
15516 /* Look for an asm-specification. */
15517 asm_spec_start_token = cp_lexer_peek_token (parser->lexer);
15518 asm_specification = cp_parser_asm_specification_opt (parser);
15519 /* And attributes. */
15520 attributes_start_token = cp_lexer_peek_token (parser->lexer);
15521 attributes = cp_parser_attributes_opt (parser);
15525 asm_specification = NULL_TREE;
15526 attributes = NULL_TREE;
15529 /* Peek at the next token. */
15530 token = cp_lexer_peek_token (parser->lexer);
15531 /* Check to see if the token indicates the start of a
15532 function-definition. */
15533 if (function_declarator_p (declarator)
15534 && cp_parser_token_starts_function_definition_p (token))
15536 if (!function_definition_allowed_p)
15538 /* If a function-definition should not appear here, issue an
15540 cp_parser_error (parser,
15541 "a function-definition is not allowed here");
15542 return error_mark_node;
15546 location_t func_brace_location
15547 = cp_lexer_peek_token (parser->lexer)->location;
15549 /* Neither attributes nor an asm-specification are allowed
15550 on a function-definition. */
15551 if (asm_specification)
15552 error_at (asm_spec_start_token->location,
15553 "an asm-specification is not allowed "
15554 "on a function-definition");
15556 error_at (attributes_start_token->location,
15557 "attributes are not allowed on a function-definition");
15558 /* This is a function-definition. */
15559 *function_definition_p = true;
15561 /* Parse the function definition. */
15563 decl = cp_parser_save_member_function_body (parser,
15566 prefix_attributes);
15569 = (cp_parser_function_definition_from_specifiers_and_declarator
15570 (parser, decl_specifiers, prefix_attributes, declarator));
15572 if (decl != error_mark_node && DECL_STRUCT_FUNCTION (decl))
15574 /* This is where the prologue starts... */
15575 DECL_STRUCT_FUNCTION (decl)->function_start_locus
15576 = func_brace_location;
15585 Only in function declarations for constructors, destructors, and
15586 type conversions can the decl-specifier-seq be omitted.
15588 We explicitly postpone this check past the point where we handle
15589 function-definitions because we tolerate function-definitions
15590 that are missing their return types in some modes. */
15591 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
15593 cp_parser_error (parser,
15594 "expected constructor, destructor, or type conversion");
15595 return error_mark_node;
15598 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15599 if (token->type == CPP_EQ
15600 || token->type == CPP_OPEN_PAREN
15601 || token->type == CPP_OPEN_BRACE)
15603 is_initialized = SD_INITIALIZED;
15604 initialization_kind = token->type;
15605 if (maybe_range_for_decl)
15606 *maybe_range_for_decl = error_mark_node;
15608 if (token->type == CPP_EQ
15609 && function_declarator_p (declarator))
15611 cp_token *t2 = cp_lexer_peek_nth_token (parser->lexer, 2);
15612 if (t2->keyword == RID_DEFAULT)
15613 is_initialized = SD_DEFAULTED;
15614 else if (t2->keyword == RID_DELETE)
15615 is_initialized = SD_DELETED;
15620 /* If the init-declarator isn't initialized and isn't followed by a
15621 `,' or `;', it's not a valid init-declarator. */
15622 if (token->type != CPP_COMMA
15623 && token->type != CPP_SEMICOLON)
15625 if (maybe_range_for_decl && *maybe_range_for_decl != error_mark_node)
15626 range_for_decl_p = true;
15629 cp_parser_error (parser, "expected initializer");
15630 return error_mark_node;
15633 is_initialized = SD_UNINITIALIZED;
15634 initialization_kind = CPP_EOF;
15637 /* Because start_decl has side-effects, we should only call it if we
15638 know we're going ahead. By this point, we know that we cannot
15639 possibly be looking at any other construct. */
15640 cp_parser_commit_to_tentative_parse (parser);
15642 /* If the decl specifiers were bad, issue an error now that we're
15643 sure this was intended to be a declarator. Then continue
15644 declaring the variable(s), as int, to try to cut down on further
15646 if (decl_specifiers->any_specifiers_p
15647 && decl_specifiers->type == error_mark_node)
15649 cp_parser_error (parser, "invalid type in declaration");
15650 decl_specifiers->type = integer_type_node;
15653 /* Check to see whether or not this declaration is a friend. */
15654 friend_p = cp_parser_friend_p (decl_specifiers);
15656 /* Enter the newly declared entry in the symbol table. If we're
15657 processing a declaration in a class-specifier, we wait until
15658 after processing the initializer. */
15661 if (parser->in_unbraced_linkage_specification_p)
15662 decl_specifiers->storage_class = sc_extern;
15663 decl = start_decl (declarator, decl_specifiers,
15664 range_for_decl_p? SD_INITIALIZED : is_initialized,
15665 attributes, prefix_attributes,
15667 /* Adjust location of decl if declarator->id_loc is more appropriate:
15668 set, and decl wasn't merged with another decl, in which case its
15669 location would be different from input_location, and more accurate. */
15671 && declarator->id_loc != UNKNOWN_LOCATION
15672 && DECL_SOURCE_LOCATION (decl) == input_location)
15673 DECL_SOURCE_LOCATION (decl) = declarator->id_loc;
15676 /* Enter the SCOPE. That way unqualified names appearing in the
15677 initializer will be looked up in SCOPE. */
15678 pushed_scope = push_scope (scope);
15680 /* Perform deferred access control checks, now that we know in which
15681 SCOPE the declared entity resides. */
15682 if (!member_p && decl)
15684 tree saved_current_function_decl = NULL_TREE;
15686 /* If the entity being declared is a function, pretend that we
15687 are in its scope. If it is a `friend', it may have access to
15688 things that would not otherwise be accessible. */
15689 if (TREE_CODE (decl) == FUNCTION_DECL)
15691 saved_current_function_decl = current_function_decl;
15692 current_function_decl = decl;
15695 /* Perform access checks for template parameters. */
15696 cp_parser_perform_template_parameter_access_checks (checks);
15698 /* Perform the access control checks for the declarator and the
15699 decl-specifiers. */
15700 perform_deferred_access_checks ();
15702 /* Restore the saved value. */
15703 if (TREE_CODE (decl) == FUNCTION_DECL)
15704 current_function_decl = saved_current_function_decl;
15707 /* Parse the initializer. */
15708 initializer = NULL_TREE;
15709 is_direct_init = false;
15710 is_non_constant_init = true;
15711 if (is_initialized)
15713 if (function_declarator_p (declarator))
15715 cp_token *initializer_start_token = cp_lexer_peek_token (parser->lexer);
15716 if (initialization_kind == CPP_EQ)
15717 initializer = cp_parser_pure_specifier (parser);
15720 /* If the declaration was erroneous, we don't really
15721 know what the user intended, so just silently
15722 consume the initializer. */
15723 if (decl != error_mark_node)
15724 error_at (initializer_start_token->location,
15725 "initializer provided for function");
15726 cp_parser_skip_to_closing_parenthesis (parser,
15727 /*recovering=*/true,
15728 /*or_comma=*/false,
15729 /*consume_paren=*/true);
15734 /* We want to record the extra mangling scope for in-class
15735 initializers of class members and initializers of static data
15736 member templates. The former involves deferring
15737 parsing of the initializer until end of class as with default
15738 arguments. So right here we only handle the latter. */
15739 if (!member_p && processing_template_decl)
15740 start_lambda_scope (decl);
15741 initializer = cp_parser_initializer (parser,
15743 &is_non_constant_init);
15744 if (!member_p && processing_template_decl)
15745 finish_lambda_scope ();
15749 /* The old parser allows attributes to appear after a parenthesized
15750 initializer. Mark Mitchell proposed removing this functionality
15751 on the GCC mailing lists on 2002-08-13. This parser accepts the
15752 attributes -- but ignores them. */
15753 if (cp_parser_allow_gnu_extensions_p (parser)
15754 && initialization_kind == CPP_OPEN_PAREN)
15755 if (cp_parser_attributes_opt (parser))
15756 warning (OPT_Wattributes,
15757 "attributes after parenthesized initializer ignored");
15759 /* For an in-class declaration, use `grokfield' to create the
15765 pop_scope (pushed_scope);
15766 pushed_scope = NULL_TREE;
15768 decl = grokfield (declarator, decl_specifiers,
15769 initializer, !is_non_constant_init,
15770 /*asmspec=*/NULL_TREE,
15771 prefix_attributes);
15772 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
15773 cp_parser_save_default_args (parser, decl);
15776 /* Finish processing the declaration. But, skip member
15778 if (!member_p && decl && decl != error_mark_node && !range_for_decl_p)
15780 cp_finish_decl (decl,
15781 initializer, !is_non_constant_init,
15783 /* If the initializer is in parentheses, then this is
15784 a direct-initialization, which means that an
15785 `explicit' constructor is OK. Otherwise, an
15786 `explicit' constructor cannot be used. */
15787 ((is_direct_init || !is_initialized)
15788 ? LOOKUP_NORMAL : LOOKUP_IMPLICIT));
15790 else if ((cxx_dialect != cxx98) && friend_p
15791 && decl && TREE_CODE (decl) == FUNCTION_DECL)
15792 /* Core issue #226 (C++0x only): A default template-argument
15793 shall not be specified in a friend class template
15795 check_default_tmpl_args (decl, current_template_parms, /*is_primary=*/1,
15796 /*is_partial=*/0, /*is_friend_decl=*/1);
15798 if (!friend_p && pushed_scope)
15799 pop_scope (pushed_scope);
15804 /* Parse a declarator.
15808 ptr-operator declarator
15810 abstract-declarator:
15811 ptr-operator abstract-declarator [opt]
15812 direct-abstract-declarator
15817 attributes [opt] direct-declarator
15818 attributes [opt] ptr-operator declarator
15820 abstract-declarator:
15821 attributes [opt] ptr-operator abstract-declarator [opt]
15822 attributes [opt] direct-abstract-declarator
15824 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15825 detect constructor, destructor or conversion operators. It is set
15826 to -1 if the declarator is a name, and +1 if it is a
15827 function. Otherwise it is set to zero. Usually you just want to
15828 test for >0, but internally the negative value is used.
15830 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15831 a decl-specifier-seq unless it declares a constructor, destructor,
15832 or conversion. It might seem that we could check this condition in
15833 semantic analysis, rather than parsing, but that makes it difficult
15834 to handle something like `f()'. We want to notice that there are
15835 no decl-specifiers, and therefore realize that this is an
15836 expression, not a declaration.)
15838 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15839 the declarator is a direct-declarator of the form "(...)".
15841 MEMBER_P is true iff this declarator is a member-declarator. */
15843 static cp_declarator *
15844 cp_parser_declarator (cp_parser* parser,
15845 cp_parser_declarator_kind dcl_kind,
15846 int* ctor_dtor_or_conv_p,
15847 bool* parenthesized_p,
15850 cp_declarator *declarator;
15851 enum tree_code code;
15852 cp_cv_quals cv_quals;
15854 tree attributes = NULL_TREE;
15856 /* Assume this is not a constructor, destructor, or type-conversion
15858 if (ctor_dtor_or_conv_p)
15859 *ctor_dtor_or_conv_p = 0;
15861 if (cp_parser_allow_gnu_extensions_p (parser))
15862 attributes = cp_parser_attributes_opt (parser);
15864 /* Check for the ptr-operator production. */
15865 cp_parser_parse_tentatively (parser);
15866 /* Parse the ptr-operator. */
15867 code = cp_parser_ptr_operator (parser,
15870 /* If that worked, then we have a ptr-operator. */
15871 if (cp_parser_parse_definitely (parser))
15873 /* If a ptr-operator was found, then this declarator was not
15875 if (parenthesized_p)
15876 *parenthesized_p = true;
15877 /* The dependent declarator is optional if we are parsing an
15878 abstract-declarator. */
15879 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
15880 cp_parser_parse_tentatively (parser);
15882 /* Parse the dependent declarator. */
15883 declarator = cp_parser_declarator (parser, dcl_kind,
15884 /*ctor_dtor_or_conv_p=*/NULL,
15885 /*parenthesized_p=*/NULL,
15886 /*member_p=*/false);
15888 /* If we are parsing an abstract-declarator, we must handle the
15889 case where the dependent declarator is absent. */
15890 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
15891 && !cp_parser_parse_definitely (parser))
15894 declarator = cp_parser_make_indirect_declarator
15895 (code, class_type, cv_quals, declarator);
15897 /* Everything else is a direct-declarator. */
15900 if (parenthesized_p)
15901 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
15903 declarator = cp_parser_direct_declarator (parser, dcl_kind,
15904 ctor_dtor_or_conv_p,
15908 if (attributes && declarator && declarator != cp_error_declarator)
15909 declarator->attributes = attributes;
15914 /* Parse a direct-declarator or direct-abstract-declarator.
15918 direct-declarator ( parameter-declaration-clause )
15919 cv-qualifier-seq [opt]
15920 exception-specification [opt]
15921 direct-declarator [ constant-expression [opt] ]
15924 direct-abstract-declarator:
15925 direct-abstract-declarator [opt]
15926 ( parameter-declaration-clause )
15927 cv-qualifier-seq [opt]
15928 exception-specification [opt]
15929 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15930 ( abstract-declarator )
15932 Returns a representation of the declarator. DCL_KIND is
15933 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15934 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15935 we are parsing a direct-declarator. It is
15936 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15937 of ambiguity we prefer an abstract declarator, as per
15938 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15939 cp_parser_declarator. */
15941 static cp_declarator *
15942 cp_parser_direct_declarator (cp_parser* parser,
15943 cp_parser_declarator_kind dcl_kind,
15944 int* ctor_dtor_or_conv_p,
15948 cp_declarator *declarator = NULL;
15949 tree scope = NULL_TREE;
15950 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
15951 bool saved_in_declarator_p = parser->in_declarator_p;
15953 tree pushed_scope = NULL_TREE;
15957 /* Peek at the next token. */
15958 token = cp_lexer_peek_token (parser->lexer);
15959 if (token->type == CPP_OPEN_PAREN)
15961 /* This is either a parameter-declaration-clause, or a
15962 parenthesized declarator. When we know we are parsing a
15963 named declarator, it must be a parenthesized declarator
15964 if FIRST is true. For instance, `(int)' is a
15965 parameter-declaration-clause, with an omitted
15966 direct-abstract-declarator. But `((*))', is a
15967 parenthesized abstract declarator. Finally, when T is a
15968 template parameter `(T)' is a
15969 parameter-declaration-clause, and not a parenthesized
15972 We first try and parse a parameter-declaration-clause,
15973 and then try a nested declarator (if FIRST is true).
15975 It is not an error for it not to be a
15976 parameter-declaration-clause, even when FIRST is
15982 The first is the declaration of a function while the
15983 second is the definition of a variable, including its
15986 Having seen only the parenthesis, we cannot know which of
15987 these two alternatives should be selected. Even more
15988 complex are examples like:
15993 The former is a function-declaration; the latter is a
15994 variable initialization.
15996 Thus again, we try a parameter-declaration-clause, and if
15997 that fails, we back out and return. */
15999 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
16002 unsigned saved_num_template_parameter_lists;
16003 bool is_declarator = false;
16006 /* In a member-declarator, the only valid interpretation
16007 of a parenthesis is the start of a
16008 parameter-declaration-clause. (It is invalid to
16009 initialize a static data member with a parenthesized
16010 initializer; only the "=" form of initialization is
16013 cp_parser_parse_tentatively (parser);
16015 /* Consume the `('. */
16016 cp_lexer_consume_token (parser->lexer);
16019 /* If this is going to be an abstract declarator, we're
16020 in a declarator and we can't have default args. */
16021 parser->default_arg_ok_p = false;
16022 parser->in_declarator_p = true;
16025 /* Inside the function parameter list, surrounding
16026 template-parameter-lists do not apply. */
16027 saved_num_template_parameter_lists
16028 = parser->num_template_parameter_lists;
16029 parser->num_template_parameter_lists = 0;
16031 begin_scope (sk_function_parms, NULL_TREE);
16033 /* Parse the parameter-declaration-clause. */
16034 params = cp_parser_parameter_declaration_clause (parser);
16036 parser->num_template_parameter_lists
16037 = saved_num_template_parameter_lists;
16039 /* Consume the `)'. */
16040 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
16042 /* If all went well, parse the cv-qualifier-seq and the
16043 exception-specification. */
16044 if (member_p || cp_parser_parse_definitely (parser))
16046 cp_cv_quals cv_quals;
16047 cp_virt_specifiers virt_specifiers;
16048 tree exception_specification;
16051 is_declarator = true;
16053 if (ctor_dtor_or_conv_p)
16054 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
16057 /* Parse the cv-qualifier-seq. */
16058 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
16059 /* And the exception-specification. */
16060 exception_specification
16061 = cp_parser_exception_specification_opt (parser);
16062 /* Parse the virt-specifier-seq. */
16063 virt_specifiers = cp_parser_virt_specifier_seq_opt (parser);
16065 late_return = (cp_parser_late_return_type_opt
16066 (parser, member_p ? cv_quals : -1));
16068 /* Create the function-declarator. */
16069 declarator = make_call_declarator (declarator,
16073 exception_specification,
16075 /* Any subsequent parameter lists are to do with
16076 return type, so are not those of the declared
16078 parser->default_arg_ok_p = false;
16081 /* Remove the function parms from scope. */
16082 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
16083 pop_binding (DECL_NAME (t), t);
16087 /* Repeat the main loop. */
16091 /* If this is the first, we can try a parenthesized
16095 bool saved_in_type_id_in_expr_p;
16097 parser->default_arg_ok_p = saved_default_arg_ok_p;
16098 parser->in_declarator_p = saved_in_declarator_p;
16100 /* Consume the `('. */
16101 cp_lexer_consume_token (parser->lexer);
16102 /* Parse the nested declarator. */
16103 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
16104 parser->in_type_id_in_expr_p = true;
16106 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
16107 /*parenthesized_p=*/NULL,
16109 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
16111 /* Expect a `)'. */
16112 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
16113 declarator = cp_error_declarator;
16114 if (declarator == cp_error_declarator)
16117 goto handle_declarator;
16119 /* Otherwise, we must be done. */
16123 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
16124 && token->type == CPP_OPEN_SQUARE)
16126 /* Parse an array-declarator. */
16129 if (ctor_dtor_or_conv_p)
16130 *ctor_dtor_or_conv_p = 0;
16133 parser->default_arg_ok_p = false;
16134 parser->in_declarator_p = true;
16135 /* Consume the `['. */
16136 cp_lexer_consume_token (parser->lexer);
16137 /* Peek at the next token. */
16138 token = cp_lexer_peek_token (parser->lexer);
16139 /* If the next token is `]', then there is no
16140 constant-expression. */
16141 if (token->type != CPP_CLOSE_SQUARE)
16143 bool non_constant_p;
16146 = cp_parser_constant_expression (parser,
16147 /*allow_non_constant=*/true,
16149 if (!non_constant_p)
16151 else if (error_operand_p (bounds))
16152 /* Already gave an error. */;
16153 else if (!parser->in_function_body
16154 || current_binding_level->kind == sk_function_parms)
16156 /* Normally, the array bound must be an integral constant
16157 expression. However, as an extension, we allow VLAs
16158 in function scopes as long as they aren't part of a
16159 parameter declaration. */
16160 cp_parser_error (parser,
16161 "array bound is not an integer constant");
16162 bounds = error_mark_node;
16164 else if (processing_template_decl)
16166 /* Remember this wasn't a constant-expression. */
16167 bounds = build_nop (TREE_TYPE (bounds), bounds);
16168 TREE_SIDE_EFFECTS (bounds) = 1;
16172 bounds = NULL_TREE;
16173 /* Look for the closing `]'. */
16174 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE))
16176 declarator = cp_error_declarator;
16180 declarator = make_array_declarator (declarator, bounds);
16182 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
16185 tree qualifying_scope;
16186 tree unqualified_name;
16187 special_function_kind sfk;
16189 bool pack_expansion_p = false;
16190 cp_token *declarator_id_start_token;
16192 /* Parse a declarator-id */
16193 abstract_ok = (dcl_kind == CP_PARSER_DECLARATOR_EITHER);
16196 cp_parser_parse_tentatively (parser);
16198 /* If we see an ellipsis, we should be looking at a
16200 if (token->type == CPP_ELLIPSIS)
16202 /* Consume the `...' */
16203 cp_lexer_consume_token (parser->lexer);
16205 pack_expansion_p = true;
16209 declarator_id_start_token = cp_lexer_peek_token (parser->lexer);
16211 = cp_parser_declarator_id (parser, /*optional_p=*/abstract_ok);
16212 qualifying_scope = parser->scope;
16217 if (!unqualified_name && pack_expansion_p)
16219 /* Check whether an error occurred. */
16220 okay = !cp_parser_error_occurred (parser);
16222 /* We already consumed the ellipsis to mark a
16223 parameter pack, but we have no way to report it,
16224 so abort the tentative parse. We will be exiting
16225 immediately anyway. */
16226 cp_parser_abort_tentative_parse (parser);
16229 okay = cp_parser_parse_definitely (parser);
16232 unqualified_name = error_mark_node;
16233 else if (unqualified_name
16234 && (qualifying_scope
16235 || (TREE_CODE (unqualified_name)
16236 != IDENTIFIER_NODE)))
16238 cp_parser_error (parser, "expected unqualified-id");
16239 unqualified_name = error_mark_node;
16243 if (!unqualified_name)
16245 if (unqualified_name == error_mark_node)
16247 declarator = cp_error_declarator;
16248 pack_expansion_p = false;
16249 declarator->parameter_pack_p = false;
16253 if (qualifying_scope && at_namespace_scope_p ()
16254 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
16256 /* In the declaration of a member of a template class
16257 outside of the class itself, the SCOPE will sometimes
16258 be a TYPENAME_TYPE. For example, given:
16260 template <typename T>
16261 int S<T>::R::i = 3;
16263 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16264 this context, we must resolve S<T>::R to an ordinary
16265 type, rather than a typename type.
16267 The reason we normally avoid resolving TYPENAME_TYPEs
16268 is that a specialization of `S' might render
16269 `S<T>::R' not a type. However, if `S' is
16270 specialized, then this `i' will not be used, so there
16271 is no harm in resolving the types here. */
16274 /* Resolve the TYPENAME_TYPE. */
16275 type = resolve_typename_type (qualifying_scope,
16276 /*only_current_p=*/false);
16277 /* If that failed, the declarator is invalid. */
16278 if (TREE_CODE (type) == TYPENAME_TYPE)
16280 if (typedef_variant_p (type))
16281 error_at (declarator_id_start_token->location,
16282 "cannot define member of dependent typedef "
16285 error_at (declarator_id_start_token->location,
16286 "%<%T::%E%> is not a type",
16287 TYPE_CONTEXT (qualifying_scope),
16288 TYPE_IDENTIFIER (qualifying_scope));
16290 qualifying_scope = type;
16295 if (unqualified_name)
16299 if (qualifying_scope
16300 && CLASS_TYPE_P (qualifying_scope))
16301 class_type = qualifying_scope;
16303 class_type = current_class_type;
16305 if (TREE_CODE (unqualified_name) == TYPE_DECL)
16307 tree name_type = TREE_TYPE (unqualified_name);
16308 if (class_type && same_type_p (name_type, class_type))
16310 if (qualifying_scope
16311 && CLASSTYPE_USE_TEMPLATE (name_type))
16313 error_at (declarator_id_start_token->location,
16314 "invalid use of constructor as a template");
16315 inform (declarator_id_start_token->location,
16316 "use %<%T::%D%> instead of %<%T::%D%> to "
16317 "name the constructor in a qualified name",
16319 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
16320 class_type, name_type);
16321 declarator = cp_error_declarator;
16325 unqualified_name = constructor_name (class_type);
16329 /* We do not attempt to print the declarator
16330 here because we do not have enough
16331 information about its original syntactic
16333 cp_parser_error (parser, "invalid declarator");
16334 declarator = cp_error_declarator;
16341 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
16342 sfk = sfk_destructor;
16343 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
16344 sfk = sfk_conversion;
16345 else if (/* There's no way to declare a constructor
16346 for an anonymous type, even if the type
16347 got a name for linkage purposes. */
16348 !TYPE_WAS_ANONYMOUS (class_type)
16349 && constructor_name_p (unqualified_name,
16352 unqualified_name = constructor_name (class_type);
16353 sfk = sfk_constructor;
16355 else if (is_overloaded_fn (unqualified_name)
16356 && DECL_CONSTRUCTOR_P (get_first_fn
16357 (unqualified_name)))
16358 sfk = sfk_constructor;
16360 if (ctor_dtor_or_conv_p && sfk != sfk_none)
16361 *ctor_dtor_or_conv_p = -1;
16364 declarator = make_id_declarator (qualifying_scope,
16367 declarator->id_loc = token->location;
16368 declarator->parameter_pack_p = pack_expansion_p;
16370 if (pack_expansion_p)
16371 maybe_warn_variadic_templates ();
16374 handle_declarator:;
16375 scope = get_scope_of_declarator (declarator);
16377 /* Any names that appear after the declarator-id for a
16378 member are looked up in the containing scope. */
16379 pushed_scope = push_scope (scope);
16380 parser->in_declarator_p = true;
16381 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
16382 || (declarator && declarator->kind == cdk_id))
16383 /* Default args are only allowed on function
16385 parser->default_arg_ok_p = saved_default_arg_ok_p;
16387 parser->default_arg_ok_p = false;
16396 /* For an abstract declarator, we might wind up with nothing at this
16397 point. That's an error; the declarator is not optional. */
16399 cp_parser_error (parser, "expected declarator");
16401 /* If we entered a scope, we must exit it now. */
16403 pop_scope (pushed_scope);
16405 parser->default_arg_ok_p = saved_default_arg_ok_p;
16406 parser->in_declarator_p = saved_in_declarator_p;
16411 /* Parse a ptr-operator.
16414 * cv-qualifier-seq [opt]
16416 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16421 & cv-qualifier-seq [opt]
16423 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16424 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16425 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16426 filled in with the TYPE containing the member. *CV_QUALS is
16427 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16428 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16429 Note that the tree codes returned by this function have nothing
16430 to do with the types of trees that will be eventually be created
16431 to represent the pointer or reference type being parsed. They are
16432 just constants with suggestive names. */
16433 static enum tree_code
16434 cp_parser_ptr_operator (cp_parser* parser,
16436 cp_cv_quals *cv_quals)
16438 enum tree_code code = ERROR_MARK;
16441 /* Assume that it's not a pointer-to-member. */
16443 /* And that there are no cv-qualifiers. */
16444 *cv_quals = TYPE_UNQUALIFIED;
16446 /* Peek at the next token. */
16447 token = cp_lexer_peek_token (parser->lexer);
16449 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16450 if (token->type == CPP_MULT)
16451 code = INDIRECT_REF;
16452 else if (token->type == CPP_AND)
16454 else if ((cxx_dialect != cxx98) &&
16455 token->type == CPP_AND_AND) /* C++0x only */
16456 code = NON_LVALUE_EXPR;
16458 if (code != ERROR_MARK)
16460 /* Consume the `*', `&' or `&&'. */
16461 cp_lexer_consume_token (parser->lexer);
16463 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16464 `&', if we are allowing GNU extensions. (The only qualifier
16465 that can legally appear after `&' is `restrict', but that is
16466 enforced during semantic analysis. */
16467 if (code == INDIRECT_REF
16468 || cp_parser_allow_gnu_extensions_p (parser))
16469 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
16473 /* Try the pointer-to-member case. */
16474 cp_parser_parse_tentatively (parser);
16475 /* Look for the optional `::' operator. */
16476 cp_parser_global_scope_opt (parser,
16477 /*current_scope_valid_p=*/false);
16478 /* Look for the nested-name specifier. */
16479 token = cp_lexer_peek_token (parser->lexer);
16480 cp_parser_nested_name_specifier (parser,
16481 /*typename_keyword_p=*/false,
16482 /*check_dependency_p=*/true,
16484 /*is_declaration=*/false);
16485 /* If we found it, and the next token is a `*', then we are
16486 indeed looking at a pointer-to-member operator. */
16487 if (!cp_parser_error_occurred (parser)
16488 && cp_parser_require (parser, CPP_MULT, RT_MULT))
16490 /* Indicate that the `*' operator was used. */
16491 code = INDIRECT_REF;
16493 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
16494 error_at (token->location, "%qD is a namespace", parser->scope);
16495 else if (TREE_CODE (parser->scope) == ENUMERAL_TYPE)
16496 error_at (token->location, "cannot form pointer to member of "
16497 "non-class %q#T", parser->scope);
16500 /* The type of which the member is a member is given by the
16502 *type = parser->scope;
16503 /* The next name will not be qualified. */
16504 parser->scope = NULL_TREE;
16505 parser->qualifying_scope = NULL_TREE;
16506 parser->object_scope = NULL_TREE;
16507 /* Look for the optional cv-qualifier-seq. */
16508 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
16511 /* If that didn't work we don't have a ptr-operator. */
16512 if (!cp_parser_parse_definitely (parser))
16513 cp_parser_error (parser, "expected ptr-operator");
16519 /* Parse an (optional) cv-qualifier-seq.
16522 cv-qualifier cv-qualifier-seq [opt]
16533 Returns a bitmask representing the cv-qualifiers. */
16536 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
16538 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
16543 cp_cv_quals cv_qualifier;
16545 /* Peek at the next token. */
16546 token = cp_lexer_peek_token (parser->lexer);
16547 /* See if it's a cv-qualifier. */
16548 switch (token->keyword)
16551 cv_qualifier = TYPE_QUAL_CONST;
16555 cv_qualifier = TYPE_QUAL_VOLATILE;
16559 cv_qualifier = TYPE_QUAL_RESTRICT;
16563 cv_qualifier = TYPE_UNQUALIFIED;
16570 if (cv_quals & cv_qualifier)
16572 error_at (token->location, "duplicate cv-qualifier");
16573 cp_lexer_purge_token (parser->lexer);
16577 cp_lexer_consume_token (parser->lexer);
16578 cv_quals |= cv_qualifier;
16585 /* Parse an (optional) virt-specifier-seq.
16587 virt-specifier-seq:
16588 virt-specifier virt-specifier-seq [opt]
16594 Returns a bitmask representing the virt-specifiers. */
16596 static cp_virt_specifiers
16597 cp_parser_virt_specifier_seq_opt (cp_parser* parser)
16599 cp_virt_specifiers virt_specifiers = VIRT_SPEC_UNSPECIFIED;
16604 cp_virt_specifiers virt_specifier;
16606 /* Peek at the next token. */
16607 token = cp_lexer_peek_token (parser->lexer);
16608 /* See if it's a virt-specifier-qualifier. */
16609 if (token->type != CPP_NAME)
16611 if (!strcmp (IDENTIFIER_POINTER(token->u.value), "override"))
16613 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS);
16614 virt_specifier = VIRT_SPEC_OVERRIDE;
16616 else if (!strcmp (IDENTIFIER_POINTER(token->u.value), "final"))
16618 maybe_warn_cpp0x (CPP0X_OVERRIDE_CONTROLS);
16619 virt_specifier = VIRT_SPEC_FINAL;
16621 else if (!strcmp (IDENTIFIER_POINTER(token->u.value), "__final"))
16623 virt_specifier = VIRT_SPEC_FINAL;
16628 if (virt_specifiers & virt_specifier)
16630 error_at (token->location, "duplicate virt-specifier");
16631 cp_lexer_purge_token (parser->lexer);
16635 cp_lexer_consume_token (parser->lexer);
16636 virt_specifiers |= virt_specifier;
16639 return virt_specifiers;
16642 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16643 is in scope even though it isn't real. */
16646 inject_this_parameter (tree ctype, cp_cv_quals quals)
16650 if (current_class_ptr)
16652 /* We don't clear this between NSDMIs. Is it already what we want? */
16653 tree type = TREE_TYPE (TREE_TYPE (current_class_ptr));
16654 if (same_type_ignoring_top_level_qualifiers_p (ctype, type)
16655 && cp_type_quals (type) == quals)
16659 this_parm = build_this_parm (ctype, quals);
16660 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16661 current_class_ptr = NULL_TREE;
16663 = cp_build_indirect_ref (this_parm, RO_NULL, tf_warning_or_error);
16664 current_class_ptr = this_parm;
16667 /* Parse a late-specified return type, if any. This is not a separate
16668 non-terminal, but part of a function declarator, which looks like
16670 -> trailing-type-specifier-seq abstract-declarator(opt)
16672 Returns the type indicated by the type-id.
16674 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16678 cp_parser_late_return_type_opt (cp_parser* parser, cp_cv_quals quals)
16683 /* Peek at the next token. */
16684 token = cp_lexer_peek_token (parser->lexer);
16685 /* A late-specified return type is indicated by an initial '->'. */
16686 if (token->type != CPP_DEREF)
16689 /* Consume the ->. */
16690 cp_lexer_consume_token (parser->lexer);
16694 /* DR 1207: 'this' is in scope in the trailing return type. */
16695 gcc_assert (current_class_ptr == NULL_TREE);
16696 inject_this_parameter (current_class_type, quals);
16699 type = cp_parser_trailing_type_id (parser);
16702 current_class_ptr = current_class_ref = NULL_TREE;
16707 /* Parse a declarator-id.
16711 :: [opt] nested-name-specifier [opt] type-name
16713 In the `id-expression' case, the value returned is as for
16714 cp_parser_id_expression if the id-expression was an unqualified-id.
16715 If the id-expression was a qualified-id, then a SCOPE_REF is
16716 returned. The first operand is the scope (either a NAMESPACE_DECL
16717 or TREE_TYPE), but the second is still just a representation of an
16721 cp_parser_declarator_id (cp_parser* parser, bool optional_p)
16724 /* The expression must be an id-expression. Assume that qualified
16725 names are the names of types so that:
16728 int S<T>::R::i = 3;
16730 will work; we must treat `S<T>::R' as the name of a type.
16731 Similarly, assume that qualified names are templates, where
16735 int S<T>::R<T>::i = 3;
16738 id = cp_parser_id_expression (parser,
16739 /*template_keyword_p=*/false,
16740 /*check_dependency_p=*/false,
16741 /*template_p=*/NULL,
16742 /*declarator_p=*/true,
16744 if (id && BASELINK_P (id))
16745 id = BASELINK_FUNCTIONS (id);
16749 /* Parse a type-id.
16752 type-specifier-seq abstract-declarator [opt]
16754 Returns the TYPE specified. */
16757 cp_parser_type_id_1 (cp_parser* parser, bool is_template_arg,
16758 bool is_trailing_return)
16760 cp_decl_specifier_seq type_specifier_seq;
16761 cp_declarator *abstract_declarator;
16763 /* Parse the type-specifier-seq. */
16764 cp_parser_type_specifier_seq (parser, /*is_declaration=*/false,
16765 is_trailing_return,
16766 &type_specifier_seq);
16767 if (type_specifier_seq.type == error_mark_node)
16768 return error_mark_node;
16770 /* There might or might not be an abstract declarator. */
16771 cp_parser_parse_tentatively (parser);
16772 /* Look for the declarator. */
16773 abstract_declarator
16774 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
16775 /*parenthesized_p=*/NULL,
16776 /*member_p=*/false);
16777 /* Check to see if there really was a declarator. */
16778 if (!cp_parser_parse_definitely (parser))
16779 abstract_declarator = NULL;
16781 if (type_specifier_seq.type
16782 && type_uses_auto (type_specifier_seq.type))
16784 /* A type-id with type 'auto' is only ok if the abstract declarator
16785 is a function declarator with a late-specified return type. */
16786 if (abstract_declarator
16787 && abstract_declarator->kind == cdk_function
16788 && abstract_declarator->u.function.late_return_type)
16792 error ("invalid use of %<auto%>");
16793 return error_mark_node;
16797 return groktypename (&type_specifier_seq, abstract_declarator,
16801 static tree cp_parser_type_id (cp_parser *parser)
16803 return cp_parser_type_id_1 (parser, false, false);
16806 static tree cp_parser_template_type_arg (cp_parser *parser)
16809 const char *saved_message = parser->type_definition_forbidden_message;
16810 parser->type_definition_forbidden_message
16811 = G_("types may not be defined in template arguments");
16812 r = cp_parser_type_id_1 (parser, true, false);
16813 parser->type_definition_forbidden_message = saved_message;
16817 static tree cp_parser_trailing_type_id (cp_parser *parser)
16819 return cp_parser_type_id_1 (parser, false, true);
16822 /* Parse a type-specifier-seq.
16824 type-specifier-seq:
16825 type-specifier type-specifier-seq [opt]
16829 type-specifier-seq:
16830 attributes type-specifier-seq [opt]
16832 If IS_DECLARATION is true, we are at the start of a "condition" or
16833 exception-declaration, so we might be followed by a declarator-id.
16835 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16836 i.e. we've just seen "->".
16838 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16841 cp_parser_type_specifier_seq (cp_parser* parser,
16842 bool is_declaration,
16843 bool is_trailing_return,
16844 cp_decl_specifier_seq *type_specifier_seq)
16846 bool seen_type_specifier = false;
16847 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
16848 cp_token *start_token = NULL;
16850 /* Clear the TYPE_SPECIFIER_SEQ. */
16851 clear_decl_specs (type_specifier_seq);
16853 /* In the context of a trailing return type, enum E { } is an
16854 elaborated-type-specifier followed by a function-body, not an
16856 if (is_trailing_return)
16857 flags |= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS;
16859 /* Parse the type-specifiers and attributes. */
16862 tree type_specifier;
16863 bool is_cv_qualifier;
16865 /* Check for attributes first. */
16866 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
16868 type_specifier_seq->attributes =
16869 chainon (type_specifier_seq->attributes,
16870 cp_parser_attributes_opt (parser));
16874 /* record the token of the beginning of the type specifier seq,
16875 for error reporting purposes*/
16877 start_token = cp_lexer_peek_token (parser->lexer);
16879 /* Look for the type-specifier. */
16880 type_specifier = cp_parser_type_specifier (parser,
16882 type_specifier_seq,
16883 /*is_declaration=*/false,
16886 if (!type_specifier)
16888 /* If the first type-specifier could not be found, this is not a
16889 type-specifier-seq at all. */
16890 if (!seen_type_specifier)
16892 cp_parser_error (parser, "expected type-specifier");
16893 type_specifier_seq->type = error_mark_node;
16896 /* If subsequent type-specifiers could not be found, the
16897 type-specifier-seq is complete. */
16901 seen_type_specifier = true;
16902 /* The standard says that a condition can be:
16904 type-specifier-seq declarator = assignment-expression
16911 we should treat the "S" as a declarator, not as a
16912 type-specifier. The standard doesn't say that explicitly for
16913 type-specifier-seq, but it does say that for
16914 decl-specifier-seq in an ordinary declaration. Perhaps it
16915 would be clearer just to allow a decl-specifier-seq here, and
16916 then add a semantic restriction that if any decl-specifiers
16917 that are not type-specifiers appear, the program is invalid. */
16918 if (is_declaration && !is_cv_qualifier)
16919 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
16922 cp_parser_check_decl_spec (type_specifier_seq, start_token->location);
16925 /* Parse a parameter-declaration-clause.
16927 parameter-declaration-clause:
16928 parameter-declaration-list [opt] ... [opt]
16929 parameter-declaration-list , ...
16931 Returns a representation for the parameter declarations. A return
16932 value of NULL indicates a parameter-declaration-clause consisting
16933 only of an ellipsis. */
16936 cp_parser_parameter_declaration_clause (cp_parser* parser)
16943 /* Peek at the next token. */
16944 token = cp_lexer_peek_token (parser->lexer);
16945 /* Check for trivial parameter-declaration-clauses. */
16946 if (token->type == CPP_ELLIPSIS)
16948 /* Consume the `...' token. */
16949 cp_lexer_consume_token (parser->lexer);
16952 else if (token->type == CPP_CLOSE_PAREN)
16953 /* There are no parameters. */
16955 #ifndef NO_IMPLICIT_EXTERN_C
16956 if (in_system_header && current_class_type == NULL
16957 && current_lang_name == lang_name_c)
16961 return void_list_node;
16963 /* Check for `(void)', too, which is a special case. */
16964 else if (token->keyword == RID_VOID
16965 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
16966 == CPP_CLOSE_PAREN))
16968 /* Consume the `void' token. */
16969 cp_lexer_consume_token (parser->lexer);
16970 /* There are no parameters. */
16971 return void_list_node;
16974 /* Parse the parameter-declaration-list. */
16975 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
16976 /* If a parse error occurred while parsing the
16977 parameter-declaration-list, then the entire
16978 parameter-declaration-clause is erroneous. */
16982 /* Peek at the next token. */
16983 token = cp_lexer_peek_token (parser->lexer);
16984 /* If it's a `,', the clause should terminate with an ellipsis. */
16985 if (token->type == CPP_COMMA)
16987 /* Consume the `,'. */
16988 cp_lexer_consume_token (parser->lexer);
16989 /* Expect an ellipsis. */
16991 = (cp_parser_require (parser, CPP_ELLIPSIS, RT_ELLIPSIS) != NULL);
16993 /* It might also be `...' if the optional trailing `,' was
16995 else if (token->type == CPP_ELLIPSIS)
16997 /* Consume the `...' token. */
16998 cp_lexer_consume_token (parser->lexer);
16999 /* And remember that we saw it. */
17003 ellipsis_p = false;
17005 /* Finish the parameter list. */
17007 parameters = chainon (parameters, void_list_node);
17012 /* Parse a parameter-declaration-list.
17014 parameter-declaration-list:
17015 parameter-declaration
17016 parameter-declaration-list , parameter-declaration
17018 Returns a representation of the parameter-declaration-list, as for
17019 cp_parser_parameter_declaration_clause. However, the
17020 `void_list_node' is never appended to the list. Upon return,
17021 *IS_ERROR will be true iff an error occurred. */
17024 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
17026 tree parameters = NULL_TREE;
17027 tree *tail = ¶meters;
17028 bool saved_in_unbraced_linkage_specification_p;
17031 /* Assume all will go well. */
17033 /* The special considerations that apply to a function within an
17034 unbraced linkage specifications do not apply to the parameters
17035 to the function. */
17036 saved_in_unbraced_linkage_specification_p
17037 = parser->in_unbraced_linkage_specification_p;
17038 parser->in_unbraced_linkage_specification_p = false;
17040 /* Look for more parameters. */
17043 cp_parameter_declarator *parameter;
17044 tree decl = error_mark_node;
17045 bool parenthesized_p = false;
17046 /* Parse the parameter. */
17048 = cp_parser_parameter_declaration (parser,
17049 /*template_parm_p=*/false,
17052 /* We don't know yet if the enclosing context is deprecated, so wait
17053 and warn in grokparms if appropriate. */
17054 deprecated_state = DEPRECATED_SUPPRESS;
17057 decl = grokdeclarator (parameter->declarator,
17058 ¶meter->decl_specifiers,
17060 parameter->default_argument != NULL_TREE,
17061 ¶meter->decl_specifiers.attributes);
17063 deprecated_state = DEPRECATED_NORMAL;
17065 /* If a parse error occurred parsing the parameter declaration,
17066 then the entire parameter-declaration-list is erroneous. */
17067 if (decl == error_mark_node)
17070 parameters = error_mark_node;
17074 if (parameter->decl_specifiers.attributes)
17075 cplus_decl_attributes (&decl,
17076 parameter->decl_specifiers.attributes,
17078 if (DECL_NAME (decl))
17079 decl = pushdecl (decl);
17081 if (decl != error_mark_node)
17083 retrofit_lang_decl (decl);
17084 DECL_PARM_INDEX (decl) = ++index;
17085 DECL_PARM_LEVEL (decl) = function_parm_depth ();
17088 /* Add the new parameter to the list. */
17089 *tail = build_tree_list (parameter->default_argument, decl);
17090 tail = &TREE_CHAIN (*tail);
17092 /* Peek at the next token. */
17093 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
17094 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
17095 /* These are for Objective-C++ */
17096 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
17097 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
17098 /* The parameter-declaration-list is complete. */
17100 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
17104 /* Peek at the next token. */
17105 token = cp_lexer_peek_nth_token (parser->lexer, 2);
17106 /* If it's an ellipsis, then the list is complete. */
17107 if (token->type == CPP_ELLIPSIS)
17109 /* Otherwise, there must be more parameters. Consume the
17111 cp_lexer_consume_token (parser->lexer);
17112 /* When parsing something like:
17114 int i(float f, double d)
17116 we can tell after seeing the declaration for "f" that we
17117 are not looking at an initialization of a variable "i",
17118 but rather at the declaration of a function "i".
17120 Due to the fact that the parsing of template arguments
17121 (as specified to a template-id) requires backtracking we
17122 cannot use this technique when inside a template argument
17124 if (!parser->in_template_argument_list_p
17125 && !parser->in_type_id_in_expr_p
17126 && cp_parser_uncommitted_to_tentative_parse_p (parser)
17127 /* However, a parameter-declaration of the form
17128 "foat(f)" (which is a valid declaration of a
17129 parameter "f") can also be interpreted as an
17130 expression (the conversion of "f" to "float"). */
17131 && !parenthesized_p)
17132 cp_parser_commit_to_tentative_parse (parser);
17136 cp_parser_error (parser, "expected %<,%> or %<...%>");
17137 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
17138 cp_parser_skip_to_closing_parenthesis (parser,
17139 /*recovering=*/true,
17140 /*or_comma=*/false,
17141 /*consume_paren=*/false);
17146 parser->in_unbraced_linkage_specification_p
17147 = saved_in_unbraced_linkage_specification_p;
17152 /* Parse a parameter declaration.
17154 parameter-declaration:
17155 decl-specifier-seq ... [opt] declarator
17156 decl-specifier-seq declarator = assignment-expression
17157 decl-specifier-seq ... [opt] abstract-declarator [opt]
17158 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17160 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17161 declares a template parameter. (In that case, a non-nested `>'
17162 token encountered during the parsing of the assignment-expression
17163 is not interpreted as a greater-than operator.)
17165 Returns a representation of the parameter, or NULL if an error
17166 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17167 true iff the declarator is of the form "(p)". */
17169 static cp_parameter_declarator *
17170 cp_parser_parameter_declaration (cp_parser *parser,
17171 bool template_parm_p,
17172 bool *parenthesized_p)
17174 int declares_class_or_enum;
17175 cp_decl_specifier_seq decl_specifiers;
17176 cp_declarator *declarator;
17177 tree default_argument;
17178 cp_token *token = NULL, *declarator_token_start = NULL;
17179 const char *saved_message;
17181 /* In a template parameter, `>' is not an operator.
17185 When parsing a default template-argument for a non-type
17186 template-parameter, the first non-nested `>' is taken as the end
17187 of the template parameter-list rather than a greater-than
17190 /* Type definitions may not appear in parameter types. */
17191 saved_message = parser->type_definition_forbidden_message;
17192 parser->type_definition_forbidden_message
17193 = G_("types may not be defined in parameter types");
17195 /* Parse the declaration-specifiers. */
17196 cp_parser_decl_specifier_seq (parser,
17197 CP_PARSER_FLAGS_NONE,
17199 &declares_class_or_enum);
17201 /* Complain about missing 'typename' or other invalid type names. */
17202 if (!decl_specifiers.any_type_specifiers_p)
17203 cp_parser_parse_and_diagnose_invalid_type_name (parser);
17205 /* If an error occurred, there's no reason to attempt to parse the
17206 rest of the declaration. */
17207 if (cp_parser_error_occurred (parser))
17209 parser->type_definition_forbidden_message = saved_message;
17213 /* Peek at the next token. */
17214 token = cp_lexer_peek_token (parser->lexer);
17216 /* If the next token is a `)', `,', `=', `>', or `...', then there
17217 is no declarator. However, when variadic templates are enabled,
17218 there may be a declarator following `...'. */
17219 if (token->type == CPP_CLOSE_PAREN
17220 || token->type == CPP_COMMA
17221 || token->type == CPP_EQ
17222 || token->type == CPP_GREATER)
17225 if (parenthesized_p)
17226 *parenthesized_p = false;
17228 /* Otherwise, there should be a declarator. */
17231 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
17232 parser->default_arg_ok_p = false;
17234 /* After seeing a decl-specifier-seq, if the next token is not a
17235 "(", there is no possibility that the code is a valid
17236 expression. Therefore, if parsing tentatively, we commit at
17238 if (!parser->in_template_argument_list_p
17239 /* In an expression context, having seen:
17243 we cannot be sure whether we are looking at a
17244 function-type (taking a "char" as a parameter) or a cast
17245 of some object of type "char" to "int". */
17246 && !parser->in_type_id_in_expr_p
17247 && cp_parser_uncommitted_to_tentative_parse_p (parser)
17248 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
17249 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
17250 cp_parser_commit_to_tentative_parse (parser);
17251 /* Parse the declarator. */
17252 declarator_token_start = token;
17253 declarator = cp_parser_declarator (parser,
17254 CP_PARSER_DECLARATOR_EITHER,
17255 /*ctor_dtor_or_conv_p=*/NULL,
17257 /*member_p=*/false);
17258 parser->default_arg_ok_p = saved_default_arg_ok_p;
17259 /* After the declarator, allow more attributes. */
17260 decl_specifiers.attributes
17261 = chainon (decl_specifiers.attributes,
17262 cp_parser_attributes_opt (parser));
17265 /* If the next token is an ellipsis, and we have not seen a
17266 declarator name, and the type of the declarator contains parameter
17267 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17268 a parameter pack expansion expression. Otherwise, leave the
17269 ellipsis for a C-style variadic function. */
17270 token = cp_lexer_peek_token (parser->lexer);
17271 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
17273 tree type = decl_specifiers.type;
17275 if (type && DECL_P (type))
17276 type = TREE_TYPE (type);
17279 && TREE_CODE (type) != TYPE_PACK_EXPANSION
17280 && declarator_can_be_parameter_pack (declarator)
17281 && (!declarator || !declarator->parameter_pack_p)
17282 && uses_parameter_packs (type))
17284 /* Consume the `...'. */
17285 cp_lexer_consume_token (parser->lexer);
17286 maybe_warn_variadic_templates ();
17288 /* Build a pack expansion type */
17290 declarator->parameter_pack_p = true;
17292 decl_specifiers.type = make_pack_expansion (type);
17296 /* The restriction on defining new types applies only to the type
17297 of the parameter, not to the default argument. */
17298 parser->type_definition_forbidden_message = saved_message;
17300 /* If the next token is `=', then process a default argument. */
17301 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
17303 token = cp_lexer_peek_token (parser->lexer);
17304 /* If we are defining a class, then the tokens that make up the
17305 default argument must be saved and processed later. */
17306 if (!template_parm_p && at_class_scope_p ()
17307 && TYPE_BEING_DEFINED (current_class_type)
17308 && !LAMBDA_TYPE_P (current_class_type))
17309 default_argument = cp_parser_cache_defarg (parser, /*nsdmi=*/false);
17310 /* Outside of a class definition, we can just parse the
17311 assignment-expression. */
17314 = cp_parser_default_argument (parser, template_parm_p);
17316 if (!parser->default_arg_ok_p)
17318 if (flag_permissive)
17319 warning (0, "deprecated use of default argument for parameter of non-function");
17322 error_at (token->location,
17323 "default arguments are only "
17324 "permitted for function parameters");
17325 default_argument = NULL_TREE;
17328 else if ((declarator && declarator->parameter_pack_p)
17329 || (decl_specifiers.type
17330 && PACK_EXPANSION_P (decl_specifiers.type)))
17332 /* Find the name of the parameter pack. */
17333 cp_declarator *id_declarator = declarator;
17334 while (id_declarator && id_declarator->kind != cdk_id)
17335 id_declarator = id_declarator->declarator;
17337 if (id_declarator && id_declarator->kind == cdk_id)
17338 error_at (declarator_token_start->location,
17340 ? G_("template parameter pack %qD "
17341 "cannot have a default argument")
17342 : G_("parameter pack %qD cannot have "
17343 "a default argument"),
17344 id_declarator->u.id.unqualified_name);
17346 error_at (declarator_token_start->location,
17348 ? G_("template parameter pack cannot have "
17349 "a default argument")
17350 : G_("parameter pack cannot have a "
17351 "default argument"));
17353 default_argument = NULL_TREE;
17357 default_argument = NULL_TREE;
17359 return make_parameter_declarator (&decl_specifiers,
17364 /* Parse a default argument and return it.
17366 TEMPLATE_PARM_P is true if this is a default argument for a
17367 non-type template parameter. */
17369 cp_parser_default_argument (cp_parser *parser, bool template_parm_p)
17371 tree default_argument = NULL_TREE;
17372 bool saved_greater_than_is_operator_p;
17373 bool saved_local_variables_forbidden_p;
17374 bool non_constant_p, is_direct_init;
17376 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17378 saved_greater_than_is_operator_p = parser->greater_than_is_operator_p;
17379 parser->greater_than_is_operator_p = !template_parm_p;
17380 /* Local variable names (and the `this' keyword) may not
17381 appear in a default argument. */
17382 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
17383 parser->local_variables_forbidden_p = true;
17384 /* Parse the assignment-expression. */
17385 if (template_parm_p)
17386 push_deferring_access_checks (dk_no_deferred);
17388 = cp_parser_initializer (parser, &is_direct_init, &non_constant_p);
17389 if (BRACE_ENCLOSED_INITIALIZER_P (default_argument))
17390 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
17391 if (template_parm_p)
17392 pop_deferring_access_checks ();
17393 parser->greater_than_is_operator_p = saved_greater_than_is_operator_p;
17394 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
17396 return default_argument;
17399 /* Parse a function-body.
17402 compound_statement */
17405 cp_parser_function_body (cp_parser *parser)
17407 cp_parser_compound_statement (parser, NULL, false, true);
17410 /* Parse a ctor-initializer-opt followed by a function-body. Return
17411 true if a ctor-initializer was present. */
17414 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
17417 bool ctor_initializer_p;
17418 const bool check_body_p =
17419 DECL_CONSTRUCTOR_P (current_function_decl)
17420 && DECL_DECLARED_CONSTEXPR_P (current_function_decl);
17423 /* Begin the function body. */
17424 body = begin_function_body ();
17425 /* Parse the optional ctor-initializer. */
17426 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
17428 /* If we're parsing a constexpr constructor definition, we need
17429 to check that the constructor body is indeed empty. However,
17430 before we get to cp_parser_function_body lot of junk has been
17431 generated, so we can't just check that we have an empty block.
17432 Rather we take a snapshot of the outermost block, and check whether
17433 cp_parser_function_body changed its state. */
17436 list = cur_stmt_list;
17437 if (STATEMENT_LIST_TAIL (list))
17438 last = STATEMENT_LIST_TAIL (list)->stmt;
17440 /* Parse the function-body. */
17441 cp_parser_function_body (parser);
17443 check_constexpr_ctor_body (last, list);
17444 /* Finish the function body. */
17445 finish_function_body (body);
17447 return ctor_initializer_p;
17450 /* Parse an initializer.
17453 = initializer-clause
17454 ( expression-list )
17456 Returns an expression representing the initializer. If no
17457 initializer is present, NULL_TREE is returned.
17459 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17460 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17461 set to TRUE if there is no initializer present. If there is an
17462 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17463 is set to true; otherwise it is set to false. */
17466 cp_parser_initializer (cp_parser* parser, bool* is_direct_init,
17467 bool* non_constant_p)
17472 /* Peek at the next token. */
17473 token = cp_lexer_peek_token (parser->lexer);
17475 /* Let our caller know whether or not this initializer was
17477 *is_direct_init = (token->type != CPP_EQ);
17478 /* Assume that the initializer is constant. */
17479 *non_constant_p = false;
17481 if (token->type == CPP_EQ)
17483 /* Consume the `='. */
17484 cp_lexer_consume_token (parser->lexer);
17485 /* Parse the initializer-clause. */
17486 init = cp_parser_initializer_clause (parser, non_constant_p);
17488 else if (token->type == CPP_OPEN_PAREN)
17491 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
17493 /*allow_expansion_p=*/true,
17496 return error_mark_node;
17497 init = build_tree_list_vec (vec);
17498 release_tree_vector (vec);
17500 else if (token->type == CPP_OPEN_BRACE)
17502 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
17503 init = cp_parser_braced_list (parser, non_constant_p);
17504 CONSTRUCTOR_IS_DIRECT_INIT (init) = 1;
17508 /* Anything else is an error. */
17509 cp_parser_error (parser, "expected initializer");
17510 init = error_mark_node;
17516 /* Parse an initializer-clause.
17518 initializer-clause:
17519 assignment-expression
17522 Returns an expression representing the initializer.
17524 If the `assignment-expression' production is used the value
17525 returned is simply a representation for the expression.
17527 Otherwise, calls cp_parser_braced_list. */
17530 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
17534 /* Assume the expression is constant. */
17535 *non_constant_p = false;
17537 /* If it is not a `{', then we are looking at an
17538 assignment-expression. */
17539 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
17542 = cp_parser_constant_expression (parser,
17543 /*allow_non_constant_p=*/true,
17547 initializer = cp_parser_braced_list (parser, non_constant_p);
17549 return initializer;
17552 /* Parse a brace-enclosed initializer list.
17555 { initializer-list , [opt] }
17558 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17559 the elements of the initializer-list (or NULL, if the last
17560 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17561 NULL_TREE. There is no way to detect whether or not the optional
17562 trailing `,' was provided. NON_CONSTANT_P is as for
17563 cp_parser_initializer. */
17566 cp_parser_braced_list (cp_parser* parser, bool* non_constant_p)
17570 /* Consume the `{' token. */
17571 cp_lexer_consume_token (parser->lexer);
17572 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17573 initializer = make_node (CONSTRUCTOR);
17574 /* If it's not a `}', then there is a non-trivial initializer. */
17575 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
17577 /* Parse the initializer list. */
17578 CONSTRUCTOR_ELTS (initializer)
17579 = cp_parser_initializer_list (parser, non_constant_p);
17580 /* A trailing `,' token is allowed. */
17581 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
17582 cp_lexer_consume_token (parser->lexer);
17584 /* Now, there should be a trailing `}'. */
17585 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
17586 TREE_TYPE (initializer) = init_list_type_node;
17587 return initializer;
17590 /* Parse an initializer-list.
17593 initializer-clause ... [opt]
17594 initializer-list , initializer-clause ... [opt]
17599 designation initializer-clause ...[opt]
17600 initializer-list , designation initializer-clause ...[opt]
17605 [ constant-expression ] =
17607 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17608 for the initializer. If the INDEX of the elt is non-NULL, it is the
17609 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17610 as for cp_parser_initializer. */
17612 static VEC(constructor_elt,gc) *
17613 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
17615 VEC(constructor_elt,gc) *v = NULL;
17617 /* Assume all of the expressions are constant. */
17618 *non_constant_p = false;
17620 /* Parse the rest of the list. */
17626 bool clause_non_constant_p;
17628 /* If the next token is an identifier and the following one is a
17629 colon, we are looking at the GNU designated-initializer
17631 if (cp_parser_allow_gnu_extensions_p (parser)
17632 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
17633 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
17635 /* Warn the user that they are using an extension. */
17636 pedwarn (input_location, OPT_pedantic,
17637 "ISO C++ does not allow designated initializers");
17638 /* Consume the identifier. */
17639 designator = cp_lexer_consume_token (parser->lexer)->u.value;
17640 /* Consume the `:'. */
17641 cp_lexer_consume_token (parser->lexer);
17643 /* Also handle the C99 syntax, '. id ='. */
17644 else if (cp_parser_allow_gnu_extensions_p (parser)
17645 && cp_lexer_next_token_is (parser->lexer, CPP_DOT)
17646 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_NAME
17647 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_EQ)
17649 /* Warn the user that they are using an extension. */
17650 pedwarn (input_location, OPT_pedantic,
17651 "ISO C++ does not allow C99 designated initializers");
17652 /* Consume the `.'. */
17653 cp_lexer_consume_token (parser->lexer);
17654 /* Consume the identifier. */
17655 designator = cp_lexer_consume_token (parser->lexer)->u.value;
17656 /* Consume the `='. */
17657 cp_lexer_consume_token (parser->lexer);
17659 /* Also handle C99 array designators, '[ const ] ='. */
17660 else if (cp_parser_allow_gnu_extensions_p (parser)
17661 && !c_dialect_objc ()
17662 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
17664 /* In C++11, [ could start a lambda-introducer. */
17665 cp_parser_parse_tentatively (parser);
17666 cp_lexer_consume_token (parser->lexer);
17667 designator = cp_parser_constant_expression (parser, false, NULL);
17668 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
17669 cp_parser_require (parser, CPP_EQ, RT_EQ);
17670 if (!cp_parser_parse_definitely (parser))
17671 designator = NULL_TREE;
17674 designator = NULL_TREE;
17676 /* Parse the initializer. */
17677 initializer = cp_parser_initializer_clause (parser,
17678 &clause_non_constant_p);
17679 /* If any clause is non-constant, so is the entire initializer. */
17680 if (clause_non_constant_p)
17681 *non_constant_p = true;
17683 /* If we have an ellipsis, this is an initializer pack
17685 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
17687 /* Consume the `...'. */
17688 cp_lexer_consume_token (parser->lexer);
17690 /* Turn the initializer into an initializer expansion. */
17691 initializer = make_pack_expansion (initializer);
17694 /* Add it to the vector. */
17695 CONSTRUCTOR_APPEND_ELT (v, designator, initializer);
17697 /* If the next token is not a comma, we have reached the end of
17699 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
17702 /* Peek at the next token. */
17703 token = cp_lexer_peek_nth_token (parser->lexer, 2);
17704 /* If the next token is a `}', then we're still done. An
17705 initializer-clause can have a trailing `,' after the
17706 initializer-list and before the closing `}'. */
17707 if (token->type == CPP_CLOSE_BRACE)
17710 /* Consume the `,' token. */
17711 cp_lexer_consume_token (parser->lexer);
17717 /* Classes [gram.class] */
17719 /* Parse a class-name.
17725 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17726 to indicate that names looked up in dependent types should be
17727 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17728 keyword has been used to indicate that the name that appears next
17729 is a template. TAG_TYPE indicates the explicit tag given before
17730 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17731 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17732 is the class being defined in a class-head.
17734 Returns the TYPE_DECL representing the class. */
17737 cp_parser_class_name (cp_parser *parser,
17738 bool typename_keyword_p,
17739 bool template_keyword_p,
17740 enum tag_types tag_type,
17741 bool check_dependency_p,
17743 bool is_declaration)
17749 tree identifier = NULL_TREE;
17751 /* All class-names start with an identifier. */
17752 token = cp_lexer_peek_token (parser->lexer);
17753 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
17755 cp_parser_error (parser, "expected class-name");
17756 return error_mark_node;
17759 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17760 to a template-id, so we save it here. */
17761 scope = parser->scope;
17762 if (scope == error_mark_node)
17763 return error_mark_node;
17765 /* Any name names a type if we're following the `typename' keyword
17766 in a qualified name where the enclosing scope is type-dependent. */
17767 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
17768 && dependent_type_p (scope));
17769 /* Handle the common case (an identifier, but not a template-id)
17771 if (token->type == CPP_NAME
17772 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
17774 cp_token *identifier_token;
17777 /* Look for the identifier. */
17778 identifier_token = cp_lexer_peek_token (parser->lexer);
17779 ambiguous_p = identifier_token->ambiguous_p;
17780 identifier = cp_parser_identifier (parser);
17781 /* If the next token isn't an identifier, we are certainly not
17782 looking at a class-name. */
17783 if (identifier == error_mark_node)
17784 decl = error_mark_node;
17785 /* If we know this is a type-name, there's no need to look it
17787 else if (typename_p)
17791 tree ambiguous_decls;
17792 /* If we already know that this lookup is ambiguous, then
17793 we've already issued an error message; there's no reason
17797 cp_parser_simulate_error (parser);
17798 return error_mark_node;
17800 /* If the next token is a `::', then the name must be a type
17803 [basic.lookup.qual]
17805 During the lookup for a name preceding the :: scope
17806 resolution operator, object, function, and enumerator
17807 names are ignored. */
17808 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
17809 tag_type = typename_type;
17810 /* Look up the name. */
17811 decl = cp_parser_lookup_name (parser, identifier,
17813 /*is_template=*/false,
17814 /*is_namespace=*/false,
17815 check_dependency_p,
17817 identifier_token->location);
17818 if (ambiguous_decls)
17820 if (cp_parser_parsing_tentatively (parser))
17821 cp_parser_simulate_error (parser);
17822 return error_mark_node;
17828 /* Try a template-id. */
17829 decl = cp_parser_template_id (parser, template_keyword_p,
17830 check_dependency_p,
17832 if (decl == error_mark_node)
17833 return error_mark_node;
17836 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
17838 /* If this is a typename, create a TYPENAME_TYPE. */
17839 if (typename_p && decl != error_mark_node)
17841 decl = make_typename_type (scope, decl, typename_type,
17842 /*complain=*/tf_error);
17843 if (decl != error_mark_node)
17844 decl = TYPE_NAME (decl);
17847 decl = strip_using_decl (decl);
17849 /* Check to see that it is really the name of a class. */
17850 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
17851 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
17852 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
17853 /* Situations like this:
17855 template <typename T> struct A {
17856 typename T::template X<int>::I i;
17859 are problematic. Is `T::template X<int>' a class-name? The
17860 standard does not seem to be definitive, but there is no other
17861 valid interpretation of the following `::'. Therefore, those
17862 names are considered class-names. */
17864 decl = make_typename_type (scope, decl, tag_type, tf_error);
17865 if (decl != error_mark_node)
17866 decl = TYPE_NAME (decl);
17868 else if (TREE_CODE (decl) != TYPE_DECL
17869 || TREE_TYPE (decl) == error_mark_node
17870 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl))
17871 /* In Objective-C 2.0, a classname followed by '.' starts a
17872 dot-syntax expression, and it's not a type-name. */
17873 || (c_dialect_objc ()
17874 && cp_lexer_peek_token (parser->lexer)->type == CPP_DOT
17875 && objc_is_class_name (decl)))
17876 decl = error_mark_node;
17878 if (decl == error_mark_node)
17879 cp_parser_error (parser, "expected class-name");
17880 else if (identifier && !parser->scope)
17881 maybe_note_name_used_in_class (identifier, decl);
17886 /* Parse a class-specifier.
17889 class-head { member-specification [opt] }
17891 Returns the TREE_TYPE representing the class. */
17894 cp_parser_class_specifier_1 (cp_parser* parser)
17897 tree attributes = NULL_TREE;
17898 bool nested_name_specifier_p;
17899 unsigned saved_num_template_parameter_lists;
17900 bool saved_in_function_body;
17901 unsigned char in_statement;
17902 bool in_switch_statement_p;
17903 bool saved_in_unbraced_linkage_specification_p;
17904 tree old_scope = NULL_TREE;
17905 tree scope = NULL_TREE;
17907 cp_token *closing_brace;
17909 push_deferring_access_checks (dk_no_deferred);
17911 /* Parse the class-head. */
17912 type = cp_parser_class_head (parser,
17913 &nested_name_specifier_p,
17916 /* If the class-head was a semantic disaster, skip the entire body
17920 cp_parser_skip_to_end_of_block_or_statement (parser);
17921 pop_deferring_access_checks ();
17922 return error_mark_node;
17925 /* Look for the `{'. */
17926 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
17928 pop_deferring_access_checks ();
17929 return error_mark_node;
17932 /* Process the base classes. If they're invalid, skip the
17933 entire class body. */
17934 if (!xref_basetypes (type, bases))
17936 /* Consuming the closing brace yields better error messages
17938 if (cp_parser_skip_to_closing_brace (parser))
17939 cp_lexer_consume_token (parser->lexer);
17940 pop_deferring_access_checks ();
17941 return error_mark_node;
17944 /* Issue an error message if type-definitions are forbidden here. */
17945 cp_parser_check_type_definition (parser);
17946 /* Remember that we are defining one more class. */
17947 ++parser->num_classes_being_defined;
17948 /* Inside the class, surrounding template-parameter-lists do not
17950 saved_num_template_parameter_lists
17951 = parser->num_template_parameter_lists;
17952 parser->num_template_parameter_lists = 0;
17953 /* We are not in a function body. */
17954 saved_in_function_body = parser->in_function_body;
17955 parser->in_function_body = false;
17956 /* Or in a loop. */
17957 in_statement = parser->in_statement;
17958 parser->in_statement = 0;
17959 /* Or in a switch. */
17960 in_switch_statement_p = parser->in_switch_statement_p;
17961 parser->in_switch_statement_p = false;
17962 /* We are not immediately inside an extern "lang" block. */
17963 saved_in_unbraced_linkage_specification_p
17964 = parser->in_unbraced_linkage_specification_p;
17965 parser->in_unbraced_linkage_specification_p = false;
17967 /* Start the class. */
17968 if (nested_name_specifier_p)
17970 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
17971 old_scope = push_inner_scope (scope);
17973 type = begin_class_definition (type, attributes);
17975 if (type == error_mark_node)
17976 /* If the type is erroneous, skip the entire body of the class. */
17977 cp_parser_skip_to_closing_brace (parser);
17979 /* Parse the member-specification. */
17980 cp_parser_member_specification_opt (parser);
17982 /* Look for the trailing `}'. */
17983 closing_brace = cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
17984 /* Look for trailing attributes to apply to this class. */
17985 if (cp_parser_allow_gnu_extensions_p (parser))
17986 attributes = cp_parser_attributes_opt (parser);
17987 if (type != error_mark_node)
17988 type = finish_struct (type, attributes);
17989 if (nested_name_specifier_p)
17990 pop_inner_scope (old_scope, scope);
17992 /* We've finished a type definition. Check for the common syntax
17993 error of forgetting a semicolon after the definition. We need to
17994 be careful, as we can't just check for not-a-semicolon and be done
17995 with it; the user might have typed:
17997 class X { } c = ...;
17998 class X { } *p = ...;
18000 and so forth. Instead, enumerate all the possible tokens that
18001 might follow this production; if we don't see one of them, then
18002 complain and silently insert the semicolon. */
18004 cp_token *token = cp_lexer_peek_token (parser->lexer);
18005 bool want_semicolon = true;
18007 switch (token->type)
18010 case CPP_SEMICOLON:
18013 case CPP_OPEN_PAREN:
18014 case CPP_CLOSE_PAREN:
18016 want_semicolon = false;
18019 /* While it's legal for type qualifiers and storage class
18020 specifiers to follow type definitions in the grammar, only
18021 compiler testsuites contain code like that. Assume that if
18022 we see such code, then what we're really seeing is a case
18026 const <type> var = ...;
18031 static <type> func (...) ...
18033 i.e. the qualifier or specifier applies to the next
18034 declaration. To do so, however, we need to look ahead one
18035 more token to see if *that* token is a type specifier.
18037 This code could be improved to handle:
18040 static const <type> var = ...; */
18042 if (keyword_is_decl_specifier (token->keyword))
18044 cp_token *lookahead = cp_lexer_peek_nth_token (parser->lexer, 2);
18046 /* Handling user-defined types here would be nice, but very
18049 = (lookahead->type == CPP_KEYWORD
18050 && keyword_begins_type_specifier (lookahead->keyword));
18057 /* If we don't have a type, then something is very wrong and we
18058 shouldn't try to do anything clever. Likewise for not seeing the
18060 if (closing_brace && TYPE_P (type) && want_semicolon)
18062 cp_token_position prev
18063 = cp_lexer_previous_token_position (parser->lexer);
18064 cp_token *prev_token = cp_lexer_token_at (parser->lexer, prev);
18065 location_t loc = prev_token->location;
18067 if (CLASSTYPE_DECLARED_CLASS (type))
18068 error_at (loc, "expected %<;%> after class definition");
18069 else if (TREE_CODE (type) == RECORD_TYPE)
18070 error_at (loc, "expected %<;%> after struct definition");
18071 else if (TREE_CODE (type) == UNION_TYPE)
18072 error_at (loc, "expected %<;%> after union definition");
18074 gcc_unreachable ();
18076 /* Unget one token and smash it to look as though we encountered
18077 a semicolon in the input stream. */
18078 cp_lexer_set_token_position (parser->lexer, prev);
18079 token = cp_lexer_peek_token (parser->lexer);
18080 token->type = CPP_SEMICOLON;
18081 token->keyword = RID_MAX;
18085 /* If this class is not itself within the scope of another class,
18086 then we need to parse the bodies of all of the queued function
18087 definitions. Note that the queued functions defined in a class
18088 are not always processed immediately following the
18089 class-specifier for that class. Consider:
18092 struct B { void f() { sizeof (A); } };
18095 If `f' were processed before the processing of `A' were
18096 completed, there would be no way to compute the size of `A'.
18097 Note that the nesting we are interested in here is lexical --
18098 not the semantic nesting given by TYPE_CONTEXT. In particular,
18101 struct A { struct B; };
18102 struct A::B { void f() { } };
18104 there is no need to delay the parsing of `A::B::f'. */
18105 if (--parser->num_classes_being_defined == 0)
18108 tree class_type = NULL_TREE;
18109 tree pushed_scope = NULL_TREE;
18111 cp_default_arg_entry *e;
18112 tree save_ccp, save_ccr;
18114 /* In a first pass, parse default arguments to the functions.
18115 Then, in a second pass, parse the bodies of the functions.
18116 This two-phased approach handles cases like:
18124 FOR_EACH_VEC_ELT (cp_default_arg_entry, unparsed_funs_with_default_args,
18128 /* If there are default arguments that have not yet been processed,
18129 take care of them now. */
18130 if (class_type != e->class_type)
18133 pop_scope (pushed_scope);
18134 class_type = e->class_type;
18135 pushed_scope = push_scope (class_type);
18137 /* Make sure that any template parameters are in scope. */
18138 maybe_begin_member_template_processing (decl);
18139 /* Parse the default argument expressions. */
18140 cp_parser_late_parsing_default_args (parser, decl);
18141 /* Remove any template parameters from the symbol table. */
18142 maybe_end_member_template_processing ();
18144 VEC_truncate (cp_default_arg_entry, unparsed_funs_with_default_args, 0);
18145 /* Now parse any NSDMIs. */
18146 save_ccp = current_class_ptr;
18147 save_ccr = current_class_ref;
18148 FOR_EACH_VEC_ELT (tree, unparsed_nsdmis, ix, decl)
18150 if (class_type != DECL_CONTEXT (decl))
18153 pop_scope (pushed_scope);
18154 class_type = DECL_CONTEXT (decl);
18155 pushed_scope = push_scope (class_type);
18157 inject_this_parameter (class_type, TYPE_UNQUALIFIED);
18158 cp_parser_late_parsing_nsdmi (parser, decl);
18160 VEC_truncate (tree, unparsed_nsdmis, 0);
18161 current_class_ptr = save_ccp;
18162 current_class_ref = save_ccr;
18164 pop_scope (pushed_scope);
18165 /* Now parse the body of the functions. */
18166 FOR_EACH_VEC_ELT (tree, unparsed_funs_with_definitions, ix, decl)
18167 cp_parser_late_parsing_for_member (parser, decl);
18168 VEC_truncate (tree, unparsed_funs_with_definitions, 0);
18171 /* Put back any saved access checks. */
18172 pop_deferring_access_checks ();
18174 /* Restore saved state. */
18175 parser->in_switch_statement_p = in_switch_statement_p;
18176 parser->in_statement = in_statement;
18177 parser->in_function_body = saved_in_function_body;
18178 parser->num_template_parameter_lists
18179 = saved_num_template_parameter_lists;
18180 parser->in_unbraced_linkage_specification_p
18181 = saved_in_unbraced_linkage_specification_p;
18187 cp_parser_class_specifier (cp_parser* parser)
18190 timevar_push (TV_PARSE_STRUCT);
18191 ret = cp_parser_class_specifier_1 (parser);
18192 timevar_pop (TV_PARSE_STRUCT);
18196 /* Parse a class-head.
18199 class-key identifier [opt] base-clause [opt]
18200 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18201 class-key nested-name-specifier [opt] template-id
18204 class-virt-specifier:
18208 class-key attributes identifier [opt] base-clause [opt]
18209 class-key attributes nested-name-specifier identifier base-clause [opt]
18210 class-key attributes nested-name-specifier [opt] template-id
18213 Upon return BASES is initialized to the list of base classes (or
18214 NULL, if there are none) in the same form returned by
18215 cp_parser_base_clause.
18217 Returns the TYPE of the indicated class. Sets
18218 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18219 involving a nested-name-specifier was used, and FALSE otherwise.
18221 Returns error_mark_node if this is not a class-head.
18223 Returns NULL_TREE if the class-head is syntactically valid, but
18224 semantically invalid in a way that means we should skip the entire
18225 body of the class. */
18228 cp_parser_class_head (cp_parser* parser,
18229 bool* nested_name_specifier_p,
18230 tree *attributes_p,
18233 tree nested_name_specifier;
18234 enum tag_types class_key;
18235 tree id = NULL_TREE;
18236 tree type = NULL_TREE;
18238 cp_virt_specifiers virt_specifiers = VIRT_SPEC_UNSPECIFIED;
18239 bool template_id_p = false;
18240 bool qualified_p = false;
18241 bool invalid_nested_name_p = false;
18242 bool invalid_explicit_specialization_p = false;
18243 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
18244 tree pushed_scope = NULL_TREE;
18245 unsigned num_templates;
18246 cp_token *type_start_token = NULL, *nested_name_specifier_token_start = NULL;
18247 /* Assume no nested-name-specifier will be present. */
18248 *nested_name_specifier_p = false;
18249 /* Assume no template parameter lists will be used in defining the
18252 parser->colon_corrects_to_scope_p = false;
18254 *bases = NULL_TREE;
18256 /* Look for the class-key. */
18257 class_key = cp_parser_class_key (parser);
18258 if (class_key == none_type)
18259 return error_mark_node;
18261 /* Parse the attributes. */
18262 attributes = cp_parser_attributes_opt (parser);
18264 /* If the next token is `::', that is invalid -- but sometimes
18265 people do try to write:
18269 Handle this gracefully by accepting the extra qualifier, and then
18270 issuing an error about it later if this really is a
18271 class-head. If it turns out just to be an elaborated type
18272 specifier, remain silent. */
18273 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
18274 qualified_p = true;
18276 push_deferring_access_checks (dk_no_check);
18278 /* Determine the name of the class. Begin by looking for an
18279 optional nested-name-specifier. */
18280 nested_name_specifier_token_start = cp_lexer_peek_token (parser->lexer);
18281 nested_name_specifier
18282 = cp_parser_nested_name_specifier_opt (parser,
18283 /*typename_keyword_p=*/false,
18284 /*check_dependency_p=*/false,
18286 /*is_declaration=*/false);
18287 /* If there was a nested-name-specifier, then there *must* be an
18289 if (nested_name_specifier)
18291 type_start_token = cp_lexer_peek_token (parser->lexer);
18292 /* Although the grammar says `identifier', it really means
18293 `class-name' or `template-name'. You are only allowed to
18294 define a class that has already been declared with this
18297 The proposed resolution for Core Issue 180 says that wherever
18298 you see `class T::X' you should treat `X' as a type-name.
18300 It is OK to define an inaccessible class; for example:
18302 class A { class B; };
18305 We do not know if we will see a class-name, or a
18306 template-name. We look for a class-name first, in case the
18307 class-name is a template-id; if we looked for the
18308 template-name first we would stop after the template-name. */
18309 cp_parser_parse_tentatively (parser);
18310 type = cp_parser_class_name (parser,
18311 /*typename_keyword_p=*/false,
18312 /*template_keyword_p=*/false,
18314 /*check_dependency_p=*/false,
18315 /*class_head_p=*/true,
18316 /*is_declaration=*/false);
18317 /* If that didn't work, ignore the nested-name-specifier. */
18318 if (!cp_parser_parse_definitely (parser))
18320 invalid_nested_name_p = true;
18321 type_start_token = cp_lexer_peek_token (parser->lexer);
18322 id = cp_parser_identifier (parser);
18323 if (id == error_mark_node)
18326 /* If we could not find a corresponding TYPE, treat this
18327 declaration like an unqualified declaration. */
18328 if (type == error_mark_node)
18329 nested_name_specifier = NULL_TREE;
18330 /* Otherwise, count the number of templates used in TYPE and its
18331 containing scopes. */
18336 for (scope = TREE_TYPE (type);
18337 scope && TREE_CODE (scope) != NAMESPACE_DECL;
18338 scope = (TYPE_P (scope)
18339 ? TYPE_CONTEXT (scope)
18340 : DECL_CONTEXT (scope)))
18342 && CLASS_TYPE_P (scope)
18343 && CLASSTYPE_TEMPLATE_INFO (scope)
18344 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
18345 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
18349 /* Otherwise, the identifier is optional. */
18352 /* We don't know whether what comes next is a template-id,
18353 an identifier, or nothing at all. */
18354 cp_parser_parse_tentatively (parser);
18355 /* Check for a template-id. */
18356 type_start_token = cp_lexer_peek_token (parser->lexer);
18357 id = cp_parser_template_id (parser,
18358 /*template_keyword_p=*/false,
18359 /*check_dependency_p=*/true,
18360 /*is_declaration=*/true);
18361 /* If that didn't work, it could still be an identifier. */
18362 if (!cp_parser_parse_definitely (parser))
18364 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
18366 type_start_token = cp_lexer_peek_token (parser->lexer);
18367 id = cp_parser_identifier (parser);
18374 template_id_p = true;
18379 pop_deferring_access_checks ();
18383 cp_parser_check_for_invalid_template_id (parser, id,
18384 type_start_token->location);
18386 virt_specifiers = cp_parser_virt_specifier_seq_opt (parser);
18388 /* If it's not a `:' or a `{' then we can't really be looking at a
18389 class-head, since a class-head only appears as part of a
18390 class-specifier. We have to detect this situation before calling
18391 xref_tag, since that has irreversible side-effects. */
18392 if (!cp_parser_next_token_starts_class_definition_p (parser))
18394 cp_parser_error (parser, "expected %<{%> or %<:%>");
18395 type = error_mark_node;
18399 /* At this point, we're going ahead with the class-specifier, even
18400 if some other problem occurs. */
18401 cp_parser_commit_to_tentative_parse (parser);
18402 if (virt_specifiers & VIRT_SPEC_OVERRIDE)
18404 cp_parser_error (parser,
18405 "cannot specify %<override%> for a class");
18406 type = error_mark_node;
18409 /* Issue the error about the overly-qualified name now. */
18412 cp_parser_error (parser,
18413 "global qualification of class name is invalid");
18414 type = error_mark_node;
18417 else if (invalid_nested_name_p)
18419 cp_parser_error (parser,
18420 "qualified name does not name a class");
18421 type = error_mark_node;
18424 else if (nested_name_specifier)
18428 /* Reject typedef-names in class heads. */
18429 if (!DECL_IMPLICIT_TYPEDEF_P (type))
18431 error_at (type_start_token->location,
18432 "invalid class name in declaration of %qD",
18438 /* Figure out in what scope the declaration is being placed. */
18439 scope = current_scope ();
18440 /* If that scope does not contain the scope in which the
18441 class was originally declared, the program is invalid. */
18442 if (scope && !is_ancestor (scope, nested_name_specifier))
18444 if (at_namespace_scope_p ())
18445 error_at (type_start_token->location,
18446 "declaration of %qD in namespace %qD which does not "
18448 type, scope, nested_name_specifier);
18450 error_at (type_start_token->location,
18451 "declaration of %qD in %qD which does not enclose %qD",
18452 type, scope, nested_name_specifier);
18458 A declarator-id shall not be qualified except for the
18459 definition of a ... nested class outside of its class
18460 ... [or] the definition or explicit instantiation of a
18461 class member of a namespace outside of its namespace. */
18462 if (scope == nested_name_specifier)
18464 permerror (nested_name_specifier_token_start->location,
18465 "extra qualification not allowed");
18466 nested_name_specifier = NULL_TREE;
18470 /* An explicit-specialization must be preceded by "template <>". If
18471 it is not, try to recover gracefully. */
18472 if (at_namespace_scope_p ()
18473 && parser->num_template_parameter_lists == 0
18476 error_at (type_start_token->location,
18477 "an explicit specialization must be preceded by %<template <>%>");
18478 invalid_explicit_specialization_p = true;
18479 /* Take the same action that would have been taken by
18480 cp_parser_explicit_specialization. */
18481 ++parser->num_template_parameter_lists;
18482 begin_specialization ();
18484 /* There must be no "return" statements between this point and the
18485 end of this function; set "type "to the correct return value and
18486 use "goto done;" to return. */
18487 /* Make sure that the right number of template parameters were
18489 if (!cp_parser_check_template_parameters (parser, num_templates,
18490 type_start_token->location,
18491 /*declarator=*/NULL))
18493 /* If something went wrong, there is no point in even trying to
18494 process the class-definition. */
18499 /* Look up the type. */
18502 if (TREE_CODE (id) == TEMPLATE_ID_EXPR
18503 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id, 0))
18504 || TREE_CODE (TREE_OPERAND (id, 0)) == OVERLOAD))
18506 error_at (type_start_token->location,
18507 "function template %qD redeclared as a class template", id);
18508 type = error_mark_node;
18512 type = TREE_TYPE (id);
18513 type = maybe_process_partial_specialization (type);
18515 if (nested_name_specifier)
18516 pushed_scope = push_scope (nested_name_specifier);
18518 else if (nested_name_specifier)
18524 template <typename T> struct S { struct T };
18525 template <typename T> struct S<T>::T { };
18527 we will get a TYPENAME_TYPE when processing the definition of
18528 `S::T'. We need to resolve it to the actual type before we
18529 try to define it. */
18530 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
18532 class_type = resolve_typename_type (TREE_TYPE (type),
18533 /*only_current_p=*/false);
18534 if (TREE_CODE (class_type) != TYPENAME_TYPE)
18535 type = TYPE_NAME (class_type);
18538 cp_parser_error (parser, "could not resolve typename type");
18539 type = error_mark_node;
18543 if (maybe_process_partial_specialization (TREE_TYPE (type))
18544 == error_mark_node)
18550 class_type = current_class_type;
18551 /* Enter the scope indicated by the nested-name-specifier. */
18552 pushed_scope = push_scope (nested_name_specifier);
18553 /* Get the canonical version of this type. */
18554 type = TYPE_MAIN_DECL (TREE_TYPE (type));
18555 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
18556 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
18558 type = push_template_decl (type);
18559 if (type == error_mark_node)
18566 type = TREE_TYPE (type);
18567 *nested_name_specifier_p = true;
18569 else /* The name is not a nested name. */
18571 /* If the class was unnamed, create a dummy name. */
18573 id = make_anon_name ();
18574 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
18575 parser->num_template_parameter_lists);
18578 /* Indicate whether this class was declared as a `class' or as a
18580 if (TREE_CODE (type) == RECORD_TYPE)
18581 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
18582 cp_parser_check_class_key (class_key, type);
18584 /* If this type was already complete, and we see another definition,
18585 that's an error. */
18586 if (type != error_mark_node && COMPLETE_TYPE_P (type))
18588 error_at (type_start_token->location, "redefinition of %q#T",
18590 error_at (type_start_token->location, "previous definition of %q+#T",
18595 else if (type == error_mark_node)
18598 /* We will have entered the scope containing the class; the names of
18599 base classes should be looked up in that context. For example:
18601 struct A { struct B {}; struct C; };
18602 struct A::C : B {};
18606 /* Get the list of base-classes, if there is one. */
18607 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
18608 *bases = cp_parser_base_clause (parser);
18611 /* Leave the scope given by the nested-name-specifier. We will
18612 enter the class scope itself while processing the members. */
18614 pop_scope (pushed_scope);
18616 if (invalid_explicit_specialization_p)
18618 end_specialization ();
18619 --parser->num_template_parameter_lists;
18623 DECL_SOURCE_LOCATION (TYPE_NAME (type)) = type_start_token->location;
18624 *attributes_p = attributes;
18625 if (type && (virt_specifiers & VIRT_SPEC_FINAL))
18626 CLASSTYPE_FINAL (type) = 1;
18628 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
18632 /* Parse a class-key.
18639 Returns the kind of class-key specified, or none_type to indicate
18642 static enum tag_types
18643 cp_parser_class_key (cp_parser* parser)
18646 enum tag_types tag_type;
18648 /* Look for the class-key. */
18649 token = cp_parser_require (parser, CPP_KEYWORD, RT_CLASS_KEY);
18653 /* Check to see if the TOKEN is a class-key. */
18654 tag_type = cp_parser_token_is_class_key (token);
18656 cp_parser_error (parser, "expected class-key");
18660 /* Parse an (optional) member-specification.
18662 member-specification:
18663 member-declaration member-specification [opt]
18664 access-specifier : member-specification [opt] */
18667 cp_parser_member_specification_opt (cp_parser* parser)
18674 /* Peek at the next token. */
18675 token = cp_lexer_peek_token (parser->lexer);
18676 /* If it's a `}', or EOF then we've seen all the members. */
18677 if (token->type == CPP_CLOSE_BRACE
18678 || token->type == CPP_EOF
18679 || token->type == CPP_PRAGMA_EOL)
18682 /* See if this token is a keyword. */
18683 keyword = token->keyword;
18687 case RID_PROTECTED:
18689 /* Consume the access-specifier. */
18690 cp_lexer_consume_token (parser->lexer);
18691 /* Remember which access-specifier is active. */
18692 current_access_specifier = token->u.value;
18693 /* Look for the `:'. */
18694 cp_parser_require (parser, CPP_COLON, RT_COLON);
18698 /* Accept #pragmas at class scope. */
18699 if (token->type == CPP_PRAGMA)
18701 cp_parser_pragma (parser, pragma_external);
18705 /* Otherwise, the next construction must be a
18706 member-declaration. */
18707 cp_parser_member_declaration (parser);
18712 /* Parse a member-declaration.
18714 member-declaration:
18715 decl-specifier-seq [opt] member-declarator-list [opt] ;
18716 function-definition ; [opt]
18717 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18719 template-declaration
18722 member-declarator-list:
18724 member-declarator-list , member-declarator
18727 declarator pure-specifier [opt]
18728 declarator constant-initializer [opt]
18729 identifier [opt] : constant-expression
18733 member-declaration:
18734 __extension__ member-declaration
18737 declarator attributes [opt] pure-specifier [opt]
18738 declarator attributes [opt] constant-initializer [opt]
18739 identifier [opt] attributes [opt] : constant-expression
18743 member-declaration:
18744 static_assert-declaration */
18747 cp_parser_member_declaration (cp_parser* parser)
18749 cp_decl_specifier_seq decl_specifiers;
18750 tree prefix_attributes;
18752 int declares_class_or_enum;
18754 cp_token *token = NULL;
18755 cp_token *decl_spec_token_start = NULL;
18756 cp_token *initializer_token_start = NULL;
18757 int saved_pedantic;
18758 bool saved_colon_corrects_to_scope_p = parser->colon_corrects_to_scope_p;
18760 /* Check for the `__extension__' keyword. */
18761 if (cp_parser_extension_opt (parser, &saved_pedantic))
18764 cp_parser_member_declaration (parser);
18765 /* Restore the old value of the PEDANTIC flag. */
18766 pedantic = saved_pedantic;
18771 /* Check for a template-declaration. */
18772 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
18774 /* An explicit specialization here is an error condition, and we
18775 expect the specialization handler to detect and report this. */
18776 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
18777 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
18778 cp_parser_explicit_specialization (parser);
18780 cp_parser_template_declaration (parser, /*member_p=*/true);
18785 /* Check for a using-declaration. */
18786 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
18788 if (cxx_dialect < cxx0x)
18790 /* Parse the using-declaration. */
18791 cp_parser_using_declaration (parser,
18792 /*access_declaration_p=*/false);
18798 cp_parser_parse_tentatively (parser);
18799 decl = cp_parser_alias_declaration (parser);
18800 if (cp_parser_parse_definitely (parser))
18801 finish_member_declaration (decl);
18803 cp_parser_using_declaration (parser,
18804 /*access_declaration_p=*/false);
18809 /* Check for @defs. */
18810 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
18813 tree ivar_chains = cp_parser_objc_defs_expression (parser);
18814 ivar = ivar_chains;
18818 ivar = TREE_CHAIN (member);
18819 TREE_CHAIN (member) = NULL_TREE;
18820 finish_member_declaration (member);
18825 /* If the next token is `static_assert' we have a static assertion. */
18826 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC_ASSERT))
18828 cp_parser_static_assert (parser, /*member_p=*/true);
18832 parser->colon_corrects_to_scope_p = false;
18834 if (cp_parser_using_declaration (parser, /*access_declaration=*/true))
18837 /* Parse the decl-specifier-seq. */
18838 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
18839 cp_parser_decl_specifier_seq (parser,
18840 CP_PARSER_FLAGS_OPTIONAL,
18842 &declares_class_or_enum);
18843 prefix_attributes = decl_specifiers.attributes;
18844 decl_specifiers.attributes = NULL_TREE;
18845 /* Check for an invalid type-name. */
18846 if (!decl_specifiers.any_type_specifiers_p
18847 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
18849 /* If there is no declarator, then the decl-specifier-seq should
18851 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
18853 /* If there was no decl-specifier-seq, and the next token is a
18854 `;', then we have something like:
18860 Each member-declaration shall declare at least one member
18861 name of the class. */
18862 if (!decl_specifiers.any_specifiers_p)
18864 cp_token *token = cp_lexer_peek_token (parser->lexer);
18865 if (!in_system_header_at (token->location))
18866 pedwarn (token->location, OPT_pedantic, "extra %<;%>");
18872 /* See if this declaration is a friend. */
18873 friend_p = cp_parser_friend_p (&decl_specifiers);
18874 /* If there were decl-specifiers, check to see if there was
18875 a class-declaration. */
18876 type = check_tag_decl (&decl_specifiers);
18877 /* Nested classes have already been added to the class, but
18878 a `friend' needs to be explicitly registered. */
18881 /* If the `friend' keyword was present, the friend must
18882 be introduced with a class-key. */
18883 if (!declares_class_or_enum && cxx_dialect < cxx0x)
18884 pedwarn (decl_spec_token_start->location, OPT_pedantic,
18885 "in C++03 a class-key must be used "
18886 "when declaring a friend");
18889 template <typename T> struct A {
18890 friend struct A<T>::B;
18893 A<T>::B will be represented by a TYPENAME_TYPE, and
18894 therefore not recognized by check_tag_decl. */
18897 type = decl_specifiers.type;
18898 if (type && TREE_CODE (type) == TYPE_DECL)
18899 type = TREE_TYPE (type);
18901 if (!type || !TYPE_P (type))
18902 error_at (decl_spec_token_start->location,
18903 "friend declaration does not name a class or "
18906 make_friend_class (current_class_type, type,
18907 /*complain=*/true);
18909 /* If there is no TYPE, an error message will already have
18911 else if (!type || type == error_mark_node)
18913 /* An anonymous aggregate has to be handled specially; such
18914 a declaration really declares a data member (with a
18915 particular type), as opposed to a nested class. */
18916 else if (ANON_AGGR_TYPE_P (type))
18918 /* Remove constructors and such from TYPE, now that we
18919 know it is an anonymous aggregate. */
18920 fixup_anonymous_aggr (type);
18921 /* And make the corresponding data member. */
18922 decl = build_decl (decl_spec_token_start->location,
18923 FIELD_DECL, NULL_TREE, type);
18924 /* Add it to the class. */
18925 finish_member_declaration (decl);
18928 cp_parser_check_access_in_redeclaration
18930 decl_spec_token_start->location);
18935 bool assume_semicolon = false;
18937 /* See if these declarations will be friends. */
18938 friend_p = cp_parser_friend_p (&decl_specifiers);
18940 /* Keep going until we hit the `;' at the end of the
18942 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
18944 tree attributes = NULL_TREE;
18945 tree first_attribute;
18947 /* Peek at the next token. */
18948 token = cp_lexer_peek_token (parser->lexer);
18950 /* Check for a bitfield declaration. */
18951 if (token->type == CPP_COLON
18952 || (token->type == CPP_NAME
18953 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
18959 /* Get the name of the bitfield. Note that we cannot just
18960 check TOKEN here because it may have been invalidated by
18961 the call to cp_lexer_peek_nth_token above. */
18962 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
18963 identifier = cp_parser_identifier (parser);
18965 identifier = NULL_TREE;
18967 /* Consume the `:' token. */
18968 cp_lexer_consume_token (parser->lexer);
18969 /* Get the width of the bitfield. */
18971 = cp_parser_constant_expression (parser,
18972 /*allow_non_constant=*/false,
18975 /* Look for attributes that apply to the bitfield. */
18976 attributes = cp_parser_attributes_opt (parser);
18977 /* Remember which attributes are prefix attributes and
18979 first_attribute = attributes;
18980 /* Combine the attributes. */
18981 attributes = chainon (prefix_attributes, attributes);
18983 /* Create the bitfield declaration. */
18984 decl = grokbitfield (identifier
18985 ? make_id_declarator (NULL_TREE,
18995 cp_declarator *declarator;
18997 tree asm_specification;
18998 int ctor_dtor_or_conv_p;
19000 /* Parse the declarator. */
19002 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
19003 &ctor_dtor_or_conv_p,
19004 /*parenthesized_p=*/NULL,
19005 /*member_p=*/true);
19007 /* If something went wrong parsing the declarator, make sure
19008 that we at least consume some tokens. */
19009 if (declarator == cp_error_declarator)
19011 /* Skip to the end of the statement. */
19012 cp_parser_skip_to_end_of_statement (parser);
19013 /* If the next token is not a semicolon, that is
19014 probably because we just skipped over the body of
19015 a function. So, we consume a semicolon if
19016 present, but do not issue an error message if it
19018 if (cp_lexer_next_token_is (parser->lexer,
19020 cp_lexer_consume_token (parser->lexer);
19024 if (declares_class_or_enum & 2)
19025 cp_parser_check_for_definition_in_return_type
19026 (declarator, decl_specifiers.type,
19027 decl_specifiers.type_location);
19029 /* Look for an asm-specification. */
19030 asm_specification = cp_parser_asm_specification_opt (parser);
19031 /* Look for attributes that apply to the declaration. */
19032 attributes = cp_parser_attributes_opt (parser);
19033 /* Remember which attributes are prefix attributes and
19035 first_attribute = attributes;
19036 /* Combine the attributes. */
19037 attributes = chainon (prefix_attributes, attributes);
19039 /* If it's an `=', then we have a constant-initializer or a
19040 pure-specifier. It is not correct to parse the
19041 initializer before registering the member declaration
19042 since the member declaration should be in scope while
19043 its initializer is processed. However, the rest of the
19044 front end does not yet provide an interface that allows
19045 us to handle this correctly. */
19046 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
19050 A pure-specifier shall be used only in the declaration of
19051 a virtual function.
19053 A member-declarator can contain a constant-initializer
19054 only if it declares a static member of integral or
19057 Therefore, if the DECLARATOR is for a function, we look
19058 for a pure-specifier; otherwise, we look for a
19059 constant-initializer. When we call `grokfield', it will
19060 perform more stringent semantics checks. */
19061 initializer_token_start = cp_lexer_peek_token (parser->lexer);
19062 if (function_declarator_p (declarator)
19063 || (decl_specifiers.type
19064 && TREE_CODE (decl_specifiers.type) == TYPE_DECL
19065 && (TREE_CODE (TREE_TYPE (decl_specifiers.type))
19066 == FUNCTION_TYPE)))
19067 initializer = cp_parser_pure_specifier (parser);
19068 else if (decl_specifiers.storage_class != sc_static)
19069 initializer = cp_parser_save_nsdmi (parser);
19070 else if (cxx_dialect >= cxx0x)
19073 /* Don't require a constant rvalue in C++11, since we
19074 might want a reference constant. We'll enforce
19075 constancy later. */
19076 cp_lexer_consume_token (parser->lexer);
19077 /* Parse the initializer. */
19078 initializer = cp_parser_initializer_clause (parser,
19082 /* Parse the initializer. */
19083 initializer = cp_parser_constant_initializer (parser);
19085 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE)
19086 && !function_declarator_p (declarator))
19089 if (decl_specifiers.storage_class != sc_static)
19090 initializer = cp_parser_save_nsdmi (parser);
19092 initializer = cp_parser_initializer (parser, &x, &x);
19094 /* Otherwise, there is no initializer. */
19096 initializer = NULL_TREE;
19098 /* See if we are probably looking at a function
19099 definition. We are certainly not looking at a
19100 member-declarator. Calling `grokfield' has
19101 side-effects, so we must not do it unless we are sure
19102 that we are looking at a member-declarator. */
19103 if (cp_parser_token_starts_function_definition_p
19104 (cp_lexer_peek_token (parser->lexer)))
19106 /* The grammar does not allow a pure-specifier to be
19107 used when a member function is defined. (It is
19108 possible that this fact is an oversight in the
19109 standard, since a pure function may be defined
19110 outside of the class-specifier. */
19111 if (initializer && initializer_token_start)
19112 error_at (initializer_token_start->location,
19113 "pure-specifier on function-definition");
19114 decl = cp_parser_save_member_function_body (parser,
19118 /* If the member was not a friend, declare it here. */
19120 finish_member_declaration (decl);
19121 /* Peek at the next token. */
19122 token = cp_lexer_peek_token (parser->lexer);
19123 /* If the next token is a semicolon, consume it. */
19124 if (token->type == CPP_SEMICOLON)
19125 cp_lexer_consume_token (parser->lexer);
19129 if (declarator->kind == cdk_function)
19130 declarator->id_loc = token->location;
19131 /* Create the declaration. */
19132 decl = grokfield (declarator, &decl_specifiers,
19133 initializer, /*init_const_expr_p=*/true,
19138 /* Reset PREFIX_ATTRIBUTES. */
19139 while (attributes && TREE_CHAIN (attributes) != first_attribute)
19140 attributes = TREE_CHAIN (attributes);
19142 TREE_CHAIN (attributes) = NULL_TREE;
19144 /* If there is any qualification still in effect, clear it
19145 now; we will be starting fresh with the next declarator. */
19146 parser->scope = NULL_TREE;
19147 parser->qualifying_scope = NULL_TREE;
19148 parser->object_scope = NULL_TREE;
19149 /* If it's a `,', then there are more declarators. */
19150 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
19151 cp_lexer_consume_token (parser->lexer);
19152 /* If the next token isn't a `;', then we have a parse error. */
19153 else if (cp_lexer_next_token_is_not (parser->lexer,
19156 /* The next token might be a ways away from where the
19157 actual semicolon is missing. Find the previous token
19158 and use that for our error position. */
19159 cp_token *token = cp_lexer_previous_token (parser->lexer);
19160 error_at (token->location,
19161 "expected %<;%> at end of member declaration");
19163 /* Assume that the user meant to provide a semicolon. If
19164 we were to cp_parser_skip_to_end_of_statement, we might
19165 skip to a semicolon inside a member function definition
19166 and issue nonsensical error messages. */
19167 assume_semicolon = true;
19172 /* Add DECL to the list of members. */
19174 finish_member_declaration (decl);
19176 if (TREE_CODE (decl) == FUNCTION_DECL)
19177 cp_parser_save_default_args (parser, decl);
19178 else if (TREE_CODE (decl) == FIELD_DECL
19179 && !DECL_C_BIT_FIELD (decl)
19180 && DECL_INITIAL (decl))
19181 /* Add DECL to the queue of NSDMI to be parsed later. */
19182 VEC_safe_push (tree, gc, unparsed_nsdmis, decl);
19185 if (assume_semicolon)
19190 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
19192 parser->colon_corrects_to_scope_p = saved_colon_corrects_to_scope_p;
19195 /* Parse a pure-specifier.
19200 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19201 Otherwise, ERROR_MARK_NODE is returned. */
19204 cp_parser_pure_specifier (cp_parser* parser)
19208 /* Look for the `=' token. */
19209 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
19210 return error_mark_node;
19211 /* Look for the `0' token. */
19212 token = cp_lexer_peek_token (parser->lexer);
19214 if (token->type == CPP_EOF
19215 || token->type == CPP_PRAGMA_EOL)
19216 return error_mark_node;
19218 cp_lexer_consume_token (parser->lexer);
19220 /* Accept = default or = delete in c++0x mode. */
19221 if (token->keyword == RID_DEFAULT
19222 || token->keyword == RID_DELETE)
19224 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED);
19225 return token->u.value;
19228 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19229 if (token->type != CPP_NUMBER || !(token->flags & PURE_ZERO))
19231 cp_parser_error (parser,
19232 "invalid pure specifier (only %<= 0%> is allowed)");
19233 cp_parser_skip_to_end_of_statement (parser);
19234 return error_mark_node;
19236 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
19238 error_at (token->location, "templates may not be %<virtual%>");
19239 return error_mark_node;
19242 return integer_zero_node;
19245 /* Parse a constant-initializer.
19247 constant-initializer:
19248 = constant-expression
19250 Returns a representation of the constant-expression. */
19253 cp_parser_constant_initializer (cp_parser* parser)
19255 /* Look for the `=' token. */
19256 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
19257 return error_mark_node;
19259 /* It is invalid to write:
19261 struct S { static const int i = { 7 }; };
19264 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
19266 cp_parser_error (parser,
19267 "a brace-enclosed initializer is not allowed here");
19268 /* Consume the opening brace. */
19269 cp_lexer_consume_token (parser->lexer);
19270 /* Skip the initializer. */
19271 cp_parser_skip_to_closing_brace (parser);
19272 /* Look for the trailing `}'. */
19273 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
19275 return error_mark_node;
19278 return cp_parser_constant_expression (parser,
19279 /*allow_non_constant=*/false,
19283 /* Derived classes [gram.class.derived] */
19285 /* Parse a base-clause.
19288 : base-specifier-list
19290 base-specifier-list:
19291 base-specifier ... [opt]
19292 base-specifier-list , base-specifier ... [opt]
19294 Returns a TREE_LIST representing the base-classes, in the order in
19295 which they were declared. The representation of each node is as
19296 described by cp_parser_base_specifier.
19298 In the case that no bases are specified, this function will return
19299 NULL_TREE, not ERROR_MARK_NODE. */
19302 cp_parser_base_clause (cp_parser* parser)
19304 tree bases = NULL_TREE;
19306 /* Look for the `:' that begins the list. */
19307 cp_parser_require (parser, CPP_COLON, RT_COLON);
19309 /* Scan the base-specifier-list. */
19314 bool pack_expansion_p = false;
19316 /* Look for the base-specifier. */
19317 base = cp_parser_base_specifier (parser);
19318 /* Look for the (optional) ellipsis. */
19319 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
19321 /* Consume the `...'. */
19322 cp_lexer_consume_token (parser->lexer);
19324 pack_expansion_p = true;
19327 /* Add BASE to the front of the list. */
19328 if (base && base != error_mark_node)
19330 if (pack_expansion_p)
19331 /* Make this a pack expansion type. */
19332 TREE_VALUE (base) = make_pack_expansion (TREE_VALUE (base));
19334 if (!check_for_bare_parameter_packs (TREE_VALUE (base)))
19336 TREE_CHAIN (base) = bases;
19340 /* Peek at the next token. */
19341 token = cp_lexer_peek_token (parser->lexer);
19342 /* If it's not a comma, then the list is complete. */
19343 if (token->type != CPP_COMMA)
19345 /* Consume the `,'. */
19346 cp_lexer_consume_token (parser->lexer);
19349 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19350 base class had a qualified name. However, the next name that
19351 appears is certainly not qualified. */
19352 parser->scope = NULL_TREE;
19353 parser->qualifying_scope = NULL_TREE;
19354 parser->object_scope = NULL_TREE;
19356 return nreverse (bases);
19359 /* Parse a base-specifier.
19362 :: [opt] nested-name-specifier [opt] class-name
19363 virtual access-specifier [opt] :: [opt] nested-name-specifier
19365 access-specifier virtual [opt] :: [opt] nested-name-specifier
19368 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19369 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19370 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19371 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19374 cp_parser_base_specifier (cp_parser* parser)
19378 bool virtual_p = false;
19379 bool duplicate_virtual_error_issued_p = false;
19380 bool duplicate_access_error_issued_p = false;
19381 bool class_scope_p, template_p;
19382 tree access = access_default_node;
19385 /* Process the optional `virtual' and `access-specifier'. */
19388 /* Peek at the next token. */
19389 token = cp_lexer_peek_token (parser->lexer);
19390 /* Process `virtual'. */
19391 switch (token->keyword)
19394 /* If `virtual' appears more than once, issue an error. */
19395 if (virtual_p && !duplicate_virtual_error_issued_p)
19397 cp_parser_error (parser,
19398 "%<virtual%> specified more than once in base-specified");
19399 duplicate_virtual_error_issued_p = true;
19404 /* Consume the `virtual' token. */
19405 cp_lexer_consume_token (parser->lexer);
19410 case RID_PROTECTED:
19412 /* If more than one access specifier appears, issue an
19414 if (access != access_default_node
19415 && !duplicate_access_error_issued_p)
19417 cp_parser_error (parser,
19418 "more than one access specifier in base-specified");
19419 duplicate_access_error_issued_p = true;
19422 access = ridpointers[(int) token->keyword];
19424 /* Consume the access-specifier. */
19425 cp_lexer_consume_token (parser->lexer);
19434 /* It is not uncommon to see programs mechanically, erroneously, use
19435 the 'typename' keyword to denote (dependent) qualified types
19436 as base classes. */
19437 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
19439 token = cp_lexer_peek_token (parser->lexer);
19440 if (!processing_template_decl)
19441 error_at (token->location,
19442 "keyword %<typename%> not allowed outside of templates");
19444 error_at (token->location,
19445 "keyword %<typename%> not allowed in this context "
19446 "(the base class is implicitly a type)");
19447 cp_lexer_consume_token (parser->lexer);
19450 /* Look for the optional `::' operator. */
19451 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
19452 /* Look for the nested-name-specifier. The simplest way to
19457 The keyword `typename' is not permitted in a base-specifier or
19458 mem-initializer; in these contexts a qualified name that
19459 depends on a template-parameter is implicitly assumed to be a
19462 is to pretend that we have seen the `typename' keyword at this
19464 cp_parser_nested_name_specifier_opt (parser,
19465 /*typename_keyword_p=*/true,
19466 /*check_dependency_p=*/true,
19468 /*is_declaration=*/true);
19469 /* If the base class is given by a qualified name, assume that names
19470 we see are type names or templates, as appropriate. */
19471 class_scope_p = (parser->scope && TYPE_P (parser->scope));
19472 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
19475 && cp_lexer_next_token_is_decltype (parser->lexer))
19476 /* DR 950 allows decltype as a base-specifier. */
19477 type = cp_parser_decltype (parser);
19480 /* Otherwise, look for the class-name. */
19481 type = cp_parser_class_name (parser,
19485 /*check_dependency_p=*/true,
19486 /*class_head_p=*/false,
19487 /*is_declaration=*/true);
19488 type = TREE_TYPE (type);
19491 if (type == error_mark_node)
19492 return error_mark_node;
19494 return finish_base_specifier (type, access, virtual_p);
19497 /* Exception handling [gram.exception] */
19499 /* Parse an (optional) noexcept-specification.
19501 noexcept-specification:
19502 noexcept ( constant-expression ) [opt]
19504 If no noexcept-specification is present, returns NULL_TREE.
19505 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19506 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19507 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19508 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19509 in which case a boolean condition is returned instead. */
19512 cp_parser_noexcept_specification_opt (cp_parser* parser,
19513 bool require_constexpr,
19514 bool* consumed_expr,
19518 const char *saved_message;
19520 /* Peek at the next token. */
19521 token = cp_lexer_peek_token (parser->lexer);
19523 /* Is it a noexcept-specification? */
19524 if (cp_parser_is_keyword (token, RID_NOEXCEPT))
19527 cp_lexer_consume_token (parser->lexer);
19529 if (cp_lexer_peek_token (parser->lexer)->type == CPP_OPEN_PAREN)
19531 cp_lexer_consume_token (parser->lexer);
19533 if (require_constexpr)
19535 /* Types may not be defined in an exception-specification. */
19536 saved_message = parser->type_definition_forbidden_message;
19537 parser->type_definition_forbidden_message
19538 = G_("types may not be defined in an exception-specification");
19540 expr = cp_parser_constant_expression (parser, false, NULL);
19542 /* Restore the saved message. */
19543 parser->type_definition_forbidden_message = saved_message;
19547 expr = cp_parser_expression (parser, false, NULL);
19548 *consumed_expr = true;
19551 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19555 expr = boolean_true_node;
19556 if (!require_constexpr)
19557 *consumed_expr = false;
19560 /* We cannot build a noexcept-spec right away because this will check
19561 that expr is a constexpr. */
19563 return build_noexcept_spec (expr, tf_warning_or_error);
19571 /* Parse an (optional) exception-specification.
19573 exception-specification:
19574 throw ( type-id-list [opt] )
19576 Returns a TREE_LIST representing the exception-specification. The
19577 TREE_VALUE of each node is a type. */
19580 cp_parser_exception_specification_opt (cp_parser* parser)
19584 const char *saved_message;
19586 /* Peek at the next token. */
19587 token = cp_lexer_peek_token (parser->lexer);
19589 /* Is it a noexcept-specification? */
19590 type_id_list = cp_parser_noexcept_specification_opt(parser, true, NULL,
19592 if (type_id_list != NULL_TREE)
19593 return type_id_list;
19595 /* If it's not `throw', then there's no exception-specification. */
19596 if (!cp_parser_is_keyword (token, RID_THROW))
19600 /* Enable this once a lot of code has transitioned to noexcept? */
19601 if (cxx_dialect == cxx0x && !in_system_header)
19602 warning (OPT_Wdeprecated, "dynamic exception specifications are "
19603 "deprecated in C++0x; use %<noexcept%> instead");
19606 /* Consume the `throw'. */
19607 cp_lexer_consume_token (parser->lexer);
19609 /* Look for the `('. */
19610 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19612 /* Peek at the next token. */
19613 token = cp_lexer_peek_token (parser->lexer);
19614 /* If it's not a `)', then there is a type-id-list. */
19615 if (token->type != CPP_CLOSE_PAREN)
19617 /* Types may not be defined in an exception-specification. */
19618 saved_message = parser->type_definition_forbidden_message;
19619 parser->type_definition_forbidden_message
19620 = G_("types may not be defined in an exception-specification");
19621 /* Parse the type-id-list. */
19622 type_id_list = cp_parser_type_id_list (parser);
19623 /* Restore the saved message. */
19624 parser->type_definition_forbidden_message = saved_message;
19627 type_id_list = empty_except_spec;
19629 /* Look for the `)'. */
19630 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19632 return type_id_list;
19635 /* Parse an (optional) type-id-list.
19639 type-id-list , type-id ... [opt]
19641 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19642 in the order that the types were presented. */
19645 cp_parser_type_id_list (cp_parser* parser)
19647 tree types = NULL_TREE;
19654 /* Get the next type-id. */
19655 type = cp_parser_type_id (parser);
19656 /* Parse the optional ellipsis. */
19657 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
19659 /* Consume the `...'. */
19660 cp_lexer_consume_token (parser->lexer);
19662 /* Turn the type into a pack expansion expression. */
19663 type = make_pack_expansion (type);
19665 /* Add it to the list. */
19666 types = add_exception_specifier (types, type, /*complain=*/1);
19667 /* Peek at the next token. */
19668 token = cp_lexer_peek_token (parser->lexer);
19669 /* If it is not a `,', we are done. */
19670 if (token->type != CPP_COMMA)
19672 /* Consume the `,'. */
19673 cp_lexer_consume_token (parser->lexer);
19676 return nreverse (types);
19679 /* Parse a try-block.
19682 try compound-statement handler-seq */
19685 cp_parser_try_block (cp_parser* parser)
19689 cp_parser_require_keyword (parser, RID_TRY, RT_TRY);
19690 try_block = begin_try_block ();
19691 cp_parser_compound_statement (parser, NULL, true, false);
19692 finish_try_block (try_block);
19693 cp_parser_handler_seq (parser);
19694 finish_handler_sequence (try_block);
19699 /* Parse a function-try-block.
19701 function-try-block:
19702 try ctor-initializer [opt] function-body handler-seq */
19705 cp_parser_function_try_block (cp_parser* parser)
19707 tree compound_stmt;
19709 bool ctor_initializer_p;
19711 /* Look for the `try' keyword. */
19712 if (!cp_parser_require_keyword (parser, RID_TRY, RT_TRY))
19714 /* Let the rest of the front end know where we are. */
19715 try_block = begin_function_try_block (&compound_stmt);
19716 /* Parse the function-body. */
19718 = cp_parser_ctor_initializer_opt_and_function_body (parser);
19719 /* We're done with the `try' part. */
19720 finish_function_try_block (try_block);
19721 /* Parse the handlers. */
19722 cp_parser_handler_seq (parser);
19723 /* We're done with the handlers. */
19724 finish_function_handler_sequence (try_block, compound_stmt);
19726 return ctor_initializer_p;
19729 /* Parse a handler-seq.
19732 handler handler-seq [opt] */
19735 cp_parser_handler_seq (cp_parser* parser)
19741 /* Parse the handler. */
19742 cp_parser_handler (parser);
19743 /* Peek at the next token. */
19744 token = cp_lexer_peek_token (parser->lexer);
19745 /* If it's not `catch' then there are no more handlers. */
19746 if (!cp_parser_is_keyword (token, RID_CATCH))
19751 /* Parse a handler.
19754 catch ( exception-declaration ) compound-statement */
19757 cp_parser_handler (cp_parser* parser)
19762 cp_parser_require_keyword (parser, RID_CATCH, RT_CATCH);
19763 handler = begin_handler ();
19764 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19765 declaration = cp_parser_exception_declaration (parser);
19766 finish_handler_parms (declaration, handler);
19767 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19768 cp_parser_compound_statement (parser, NULL, false, false);
19769 finish_handler (handler);
19772 /* Parse an exception-declaration.
19774 exception-declaration:
19775 type-specifier-seq declarator
19776 type-specifier-seq abstract-declarator
19780 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19781 ellipsis variant is used. */
19784 cp_parser_exception_declaration (cp_parser* parser)
19786 cp_decl_specifier_seq type_specifiers;
19787 cp_declarator *declarator;
19788 const char *saved_message;
19790 /* If it's an ellipsis, it's easy to handle. */
19791 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
19793 /* Consume the `...' token. */
19794 cp_lexer_consume_token (parser->lexer);
19798 /* Types may not be defined in exception-declarations. */
19799 saved_message = parser->type_definition_forbidden_message;
19800 parser->type_definition_forbidden_message
19801 = G_("types may not be defined in exception-declarations");
19803 /* Parse the type-specifier-seq. */
19804 cp_parser_type_specifier_seq (parser, /*is_declaration=*/true,
19805 /*is_trailing_return=*/false,
19807 /* If it's a `)', then there is no declarator. */
19808 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
19811 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
19812 /*ctor_dtor_or_conv_p=*/NULL,
19813 /*parenthesized_p=*/NULL,
19814 /*member_p=*/false);
19816 /* Restore the saved message. */
19817 parser->type_definition_forbidden_message = saved_message;
19819 if (!type_specifiers.any_specifiers_p)
19820 return error_mark_node;
19822 return grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
19825 /* Parse a throw-expression.
19828 throw assignment-expression [opt]
19830 Returns a THROW_EXPR representing the throw-expression. */
19833 cp_parser_throw_expression (cp_parser* parser)
19838 cp_parser_require_keyword (parser, RID_THROW, RT_THROW);
19839 token = cp_lexer_peek_token (parser->lexer);
19840 /* Figure out whether or not there is an assignment-expression
19841 following the "throw" keyword. */
19842 if (token->type == CPP_COMMA
19843 || token->type == CPP_SEMICOLON
19844 || token->type == CPP_CLOSE_PAREN
19845 || token->type == CPP_CLOSE_SQUARE
19846 || token->type == CPP_CLOSE_BRACE
19847 || token->type == CPP_COLON)
19848 expression = NULL_TREE;
19850 expression = cp_parser_assignment_expression (parser,
19851 /*cast_p=*/false, NULL);
19853 return build_throw (expression);
19856 /* GNU Extensions */
19858 /* Parse an (optional) asm-specification.
19861 asm ( string-literal )
19863 If the asm-specification is present, returns a STRING_CST
19864 corresponding to the string-literal. Otherwise, returns
19868 cp_parser_asm_specification_opt (cp_parser* parser)
19871 tree asm_specification;
19873 /* Peek at the next token. */
19874 token = cp_lexer_peek_token (parser->lexer);
19875 /* If the next token isn't the `asm' keyword, then there's no
19876 asm-specification. */
19877 if (!cp_parser_is_keyword (token, RID_ASM))
19880 /* Consume the `asm' token. */
19881 cp_lexer_consume_token (parser->lexer);
19882 /* Look for the `('. */
19883 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19885 /* Look for the string-literal. */
19886 asm_specification = cp_parser_string_literal (parser, false, false);
19888 /* Look for the `)'. */
19889 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19891 return asm_specification;
19894 /* Parse an asm-operand-list.
19898 asm-operand-list , asm-operand
19901 string-literal ( expression )
19902 [ string-literal ] string-literal ( expression )
19904 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19905 each node is the expression. The TREE_PURPOSE is itself a
19906 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19907 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19908 is a STRING_CST for the string literal before the parenthesis. Returns
19909 ERROR_MARK_NODE if any of the operands are invalid. */
19912 cp_parser_asm_operand_list (cp_parser* parser)
19914 tree asm_operands = NULL_TREE;
19915 bool invalid_operands = false;
19919 tree string_literal;
19923 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
19925 /* Consume the `[' token. */
19926 cp_lexer_consume_token (parser->lexer);
19927 /* Read the operand name. */
19928 name = cp_parser_identifier (parser);
19929 if (name != error_mark_node)
19930 name = build_string (IDENTIFIER_LENGTH (name),
19931 IDENTIFIER_POINTER (name));
19932 /* Look for the closing `]'. */
19933 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
19937 /* Look for the string-literal. */
19938 string_literal = cp_parser_string_literal (parser, false, false);
19940 /* Look for the `('. */
19941 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
19942 /* Parse the expression. */
19943 expression = cp_parser_expression (parser, /*cast_p=*/false, NULL);
19944 /* Look for the `)'. */
19945 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
19947 if (name == error_mark_node
19948 || string_literal == error_mark_node
19949 || expression == error_mark_node)
19950 invalid_operands = true;
19952 /* Add this operand to the list. */
19953 asm_operands = tree_cons (build_tree_list (name, string_literal),
19956 /* If the next token is not a `,', there are no more
19958 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
19960 /* Consume the `,'. */
19961 cp_lexer_consume_token (parser->lexer);
19964 return invalid_operands ? error_mark_node : nreverse (asm_operands);
19967 /* Parse an asm-clobber-list.
19971 asm-clobber-list , string-literal
19973 Returns a TREE_LIST, indicating the clobbers in the order that they
19974 appeared. The TREE_VALUE of each node is a STRING_CST. */
19977 cp_parser_asm_clobber_list (cp_parser* parser)
19979 tree clobbers = NULL_TREE;
19983 tree string_literal;
19985 /* Look for the string literal. */
19986 string_literal = cp_parser_string_literal (parser, false, false);
19987 /* Add it to the list. */
19988 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
19989 /* If the next token is not a `,', then the list is
19991 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
19993 /* Consume the `,' token. */
19994 cp_lexer_consume_token (parser->lexer);
20000 /* Parse an asm-label-list.
20004 asm-label-list , identifier
20006 Returns a TREE_LIST, indicating the labels in the order that they
20007 appeared. The TREE_VALUE of each node is a label. */
20010 cp_parser_asm_label_list (cp_parser* parser)
20012 tree labels = NULL_TREE;
20016 tree identifier, label, name;
20018 /* Look for the identifier. */
20019 identifier = cp_parser_identifier (parser);
20020 if (!error_operand_p (identifier))
20022 label = lookup_label (identifier);
20023 if (TREE_CODE (label) == LABEL_DECL)
20025 TREE_USED (label) = 1;
20026 check_goto (label);
20027 name = build_string (IDENTIFIER_LENGTH (identifier),
20028 IDENTIFIER_POINTER (identifier));
20029 labels = tree_cons (name, label, labels);
20032 /* If the next token is not a `,', then the list is
20034 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
20036 /* Consume the `,' token. */
20037 cp_lexer_consume_token (parser->lexer);
20040 return nreverse (labels);
20043 /* Parse an (optional) series of attributes.
20046 attributes attribute
20049 __attribute__ (( attribute-list [opt] ))
20051 The return value is as for cp_parser_attribute_list. */
20054 cp_parser_attributes_opt (cp_parser* parser)
20056 tree attributes = NULL_TREE;
20061 tree attribute_list;
20063 /* Peek at the next token. */
20064 token = cp_lexer_peek_token (parser->lexer);
20065 /* If it's not `__attribute__', then we're done. */
20066 if (token->keyword != RID_ATTRIBUTE)
20069 /* Consume the `__attribute__' keyword. */
20070 cp_lexer_consume_token (parser->lexer);
20071 /* Look for the two `(' tokens. */
20072 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
20073 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
20075 /* Peek at the next token. */
20076 token = cp_lexer_peek_token (parser->lexer);
20077 if (token->type != CPP_CLOSE_PAREN)
20078 /* Parse the attribute-list. */
20079 attribute_list = cp_parser_attribute_list (parser);
20081 /* If the next token is a `)', then there is no attribute
20083 attribute_list = NULL;
20085 /* Look for the two `)' tokens. */
20086 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
20087 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
20089 /* Add these new attributes to the list. */
20090 attributes = chainon (attributes, attribute_list);
20096 /* Parse an attribute-list.
20100 attribute-list , attribute
20104 identifier ( identifier )
20105 identifier ( identifier , expression-list )
20106 identifier ( expression-list )
20108 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20109 to an attribute. The TREE_PURPOSE of each node is the identifier
20110 indicating which attribute is in use. The TREE_VALUE represents
20111 the arguments, if any. */
20114 cp_parser_attribute_list (cp_parser* parser)
20116 tree attribute_list = NULL_TREE;
20117 bool save_translate_strings_p = parser->translate_strings_p;
20119 parser->translate_strings_p = false;
20126 /* Look for the identifier. We also allow keywords here; for
20127 example `__attribute__ ((const))' is legal. */
20128 token = cp_lexer_peek_token (parser->lexer);
20129 if (token->type == CPP_NAME
20130 || token->type == CPP_KEYWORD)
20132 tree arguments = NULL_TREE;
20134 /* Consume the token. */
20135 token = cp_lexer_consume_token (parser->lexer);
20137 /* Save away the identifier that indicates which attribute
20139 identifier = (token->type == CPP_KEYWORD)
20140 /* For keywords, use the canonical spelling, not the
20141 parsed identifier. */
20142 ? ridpointers[(int) token->keyword]
20145 attribute = build_tree_list (identifier, NULL_TREE);
20147 /* Peek at the next token. */
20148 token = cp_lexer_peek_token (parser->lexer);
20149 /* If it's an `(', then parse the attribute arguments. */
20150 if (token->type == CPP_OPEN_PAREN)
20153 int attr_flag = (attribute_takes_identifier_p (identifier)
20154 ? id_attr : normal_attr);
20155 vec = cp_parser_parenthesized_expression_list
20156 (parser, attr_flag, /*cast_p=*/false,
20157 /*allow_expansion_p=*/false,
20158 /*non_constant_p=*/NULL);
20160 arguments = error_mark_node;
20163 arguments = build_tree_list_vec (vec);
20164 release_tree_vector (vec);
20166 /* Save the arguments away. */
20167 TREE_VALUE (attribute) = arguments;
20170 if (arguments != error_mark_node)
20172 /* Add this attribute to the list. */
20173 TREE_CHAIN (attribute) = attribute_list;
20174 attribute_list = attribute;
20177 token = cp_lexer_peek_token (parser->lexer);
20179 /* Now, look for more attributes. If the next token isn't a
20180 `,', we're done. */
20181 if (token->type != CPP_COMMA)
20184 /* Consume the comma and keep going. */
20185 cp_lexer_consume_token (parser->lexer);
20187 parser->translate_strings_p = save_translate_strings_p;
20189 /* We built up the list in reverse order. */
20190 return nreverse (attribute_list);
20193 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20194 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20195 current value of the PEDANTIC flag, regardless of whether or not
20196 the `__extension__' keyword is present. The caller is responsible
20197 for restoring the value of the PEDANTIC flag. */
20200 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
20202 /* Save the old value of the PEDANTIC flag. */
20203 *saved_pedantic = pedantic;
20205 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
20207 /* Consume the `__extension__' token. */
20208 cp_lexer_consume_token (parser->lexer);
20209 /* We're not being pedantic while the `__extension__' keyword is
20219 /* Parse a label declaration.
20222 __label__ label-declarator-seq ;
20224 label-declarator-seq:
20225 identifier , label-declarator-seq
20229 cp_parser_label_declaration (cp_parser* parser)
20231 /* Look for the `__label__' keyword. */
20232 cp_parser_require_keyword (parser, RID_LABEL, RT_LABEL);
20238 /* Look for an identifier. */
20239 identifier = cp_parser_identifier (parser);
20240 /* If we failed, stop. */
20241 if (identifier == error_mark_node)
20243 /* Declare it as a label. */
20244 finish_label_decl (identifier);
20245 /* If the next token is a `;', stop. */
20246 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
20248 /* Look for the `,' separating the label declarations. */
20249 cp_parser_require (parser, CPP_COMMA, RT_COMMA);
20252 /* Look for the final `;'. */
20253 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
20256 /* Support Functions */
20258 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20259 NAME should have one of the representations used for an
20260 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20261 is returned. If PARSER->SCOPE is a dependent type, then a
20262 SCOPE_REF is returned.
20264 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20265 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20266 was formed. Abstractly, such entities should not be passed to this
20267 function, because they do not need to be looked up, but it is
20268 simpler to check for this special case here, rather than at the
20271 In cases not explicitly covered above, this function returns a
20272 DECL, OVERLOAD, or baselink representing the result of the lookup.
20273 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20276 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20277 (e.g., "struct") that was used. In that case bindings that do not
20278 refer to types are ignored.
20280 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20283 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20286 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20289 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20290 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20291 NULL_TREE otherwise. */
20294 cp_parser_lookup_name (cp_parser *parser, tree name,
20295 enum tag_types tag_type,
20298 bool check_dependency,
20299 tree *ambiguous_decls,
20300 location_t name_location)
20304 tree object_type = parser->context->object_type;
20306 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
20307 flags |= LOOKUP_COMPLAIN;
20309 /* Assume that the lookup will be unambiguous. */
20310 if (ambiguous_decls)
20311 *ambiguous_decls = NULL_TREE;
20313 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20314 no longer valid. Note that if we are parsing tentatively, and
20315 the parse fails, OBJECT_TYPE will be automatically restored. */
20316 parser->context->object_type = NULL_TREE;
20318 if (name == error_mark_node)
20319 return error_mark_node;
20321 /* A template-id has already been resolved; there is no lookup to
20323 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
20325 if (BASELINK_P (name))
20327 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
20328 == TEMPLATE_ID_EXPR);
20332 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20333 it should already have been checked to make sure that the name
20334 used matches the type being destroyed. */
20335 if (TREE_CODE (name) == BIT_NOT_EXPR)
20339 /* Figure out to which type this destructor applies. */
20341 type = parser->scope;
20342 else if (object_type)
20343 type = object_type;
20345 type = current_class_type;
20346 /* If that's not a class type, there is no destructor. */
20347 if (!type || !CLASS_TYPE_P (type))
20348 return error_mark_node;
20349 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
20350 lazily_declare_fn (sfk_destructor, type);
20351 if (!CLASSTYPE_DESTRUCTORS (type))
20352 return error_mark_node;
20353 /* If it was a class type, return the destructor. */
20354 return CLASSTYPE_DESTRUCTORS (type);
20357 /* By this point, the NAME should be an ordinary identifier. If
20358 the id-expression was a qualified name, the qualifying scope is
20359 stored in PARSER->SCOPE at this point. */
20360 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
20362 /* Perform the lookup. */
20367 if (parser->scope == error_mark_node)
20368 return error_mark_node;
20370 /* If the SCOPE is dependent, the lookup must be deferred until
20371 the template is instantiated -- unless we are explicitly
20372 looking up names in uninstantiated templates. Even then, we
20373 cannot look up the name if the scope is not a class type; it
20374 might, for example, be a template type parameter. */
20375 dependent_p = (TYPE_P (parser->scope)
20376 && dependent_scope_p (parser->scope));
20377 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
20379 /* Defer lookup. */
20380 decl = error_mark_node;
20383 tree pushed_scope = NULL_TREE;
20385 /* If PARSER->SCOPE is a dependent type, then it must be a
20386 class type, and we must not be checking dependencies;
20387 otherwise, we would have processed this lookup above. So
20388 that PARSER->SCOPE is not considered a dependent base by
20389 lookup_member, we must enter the scope here. */
20391 pushed_scope = push_scope (parser->scope);
20393 /* If the PARSER->SCOPE is a template specialization, it
20394 may be instantiated during name lookup. In that case,
20395 errors may be issued. Even if we rollback the current
20396 tentative parse, those errors are valid. */
20397 decl = lookup_qualified_name (parser->scope, name,
20398 tag_type != none_type,
20399 /*complain=*/true);
20401 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20402 lookup result and the nested-name-specifier nominates a class C:
20403 * if the name specified after the nested-name-specifier, when
20404 looked up in C, is the injected-class-name of C (Clause 9), or
20405 * if the name specified after the nested-name-specifier is the
20406 same as the identifier or the simple-template-id's template-
20407 name in the last component of the nested-name-specifier,
20408 the name is instead considered to name the constructor of
20409 class C. [ Note: for example, the constructor is not an
20410 acceptable lookup result in an elaborated-type-specifier so
20411 the constructor would not be used in place of the
20412 injected-class-name. --end note ] Such a constructor name
20413 shall be used only in the declarator-id of a declaration that
20414 names a constructor or in a using-declaration. */
20415 if (tag_type == none_type
20416 && DECL_SELF_REFERENCE_P (decl)
20417 && same_type_p (DECL_CONTEXT (decl), parser->scope))
20418 decl = lookup_qualified_name (parser->scope, ctor_identifier,
20419 tag_type != none_type,
20420 /*complain=*/true);
20422 /* If we have a single function from a using decl, pull it out. */
20423 if (TREE_CODE (decl) == OVERLOAD
20424 && !really_overloaded_fn (decl))
20425 decl = OVL_FUNCTION (decl);
20428 pop_scope (pushed_scope);
20431 /* If the scope is a dependent type and either we deferred lookup or
20432 we did lookup but didn't find the name, rememeber the name. */
20433 if (decl == error_mark_node && TYPE_P (parser->scope)
20434 && dependent_type_p (parser->scope))
20440 /* The resolution to Core Issue 180 says that `struct
20441 A::B' should be considered a type-name, even if `A'
20443 type = make_typename_type (parser->scope, name, tag_type,
20444 /*complain=*/tf_error);
20445 decl = TYPE_NAME (type);
20447 else if (is_template
20448 && (cp_parser_next_token_ends_template_argument_p (parser)
20449 || cp_lexer_next_token_is (parser->lexer,
20451 decl = make_unbound_class_template (parser->scope,
20453 /*complain=*/tf_error);
20455 decl = build_qualified_name (/*type=*/NULL_TREE,
20456 parser->scope, name,
20459 parser->qualifying_scope = parser->scope;
20460 parser->object_scope = NULL_TREE;
20462 else if (object_type)
20464 tree object_decl = NULL_TREE;
20465 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20466 OBJECT_TYPE is not a class. */
20467 if (CLASS_TYPE_P (object_type))
20468 /* If the OBJECT_TYPE is a template specialization, it may
20469 be instantiated during name lookup. In that case, errors
20470 may be issued. Even if we rollback the current tentative
20471 parse, those errors are valid. */
20472 object_decl = lookup_member (object_type,
20475 tag_type != none_type,
20476 tf_warning_or_error);
20477 /* Look it up in the enclosing context, too. */
20478 decl = lookup_name_real (name, tag_type != none_type,
20480 /*block_p=*/true, is_namespace, flags);
20481 parser->object_scope = object_type;
20482 parser->qualifying_scope = NULL_TREE;
20484 decl = object_decl;
20488 decl = lookup_name_real (name, tag_type != none_type,
20490 /*block_p=*/true, is_namespace, flags);
20491 parser->qualifying_scope = NULL_TREE;
20492 parser->object_scope = NULL_TREE;
20495 /* If the lookup failed, let our caller know. */
20496 if (!decl || decl == error_mark_node)
20497 return error_mark_node;
20499 /* Pull out the template from an injected-class-name (or multiple). */
20501 decl = maybe_get_template_decl_from_type_decl (decl);
20503 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20504 if (TREE_CODE (decl) == TREE_LIST)
20506 if (ambiguous_decls)
20507 *ambiguous_decls = decl;
20508 /* The error message we have to print is too complicated for
20509 cp_parser_error, so we incorporate its actions directly. */
20510 if (!cp_parser_simulate_error (parser))
20512 error_at (name_location, "reference to %qD is ambiguous",
20514 print_candidates (decl);
20516 return error_mark_node;
20519 gcc_assert (DECL_P (decl)
20520 || TREE_CODE (decl) == OVERLOAD
20521 || TREE_CODE (decl) == SCOPE_REF
20522 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
20523 || BASELINK_P (decl));
20525 /* If we have resolved the name of a member declaration, check to
20526 see if the declaration is accessible. When the name resolves to
20527 set of overloaded functions, accessibility is checked when
20528 overload resolution is done.
20530 During an explicit instantiation, access is not checked at all,
20531 as per [temp.explicit]. */
20533 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
20535 maybe_record_typedef_use (decl);
20540 /* Like cp_parser_lookup_name, but for use in the typical case where
20541 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20542 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20545 cp_parser_lookup_name_simple (cp_parser* parser, tree name, location_t location)
20547 return cp_parser_lookup_name (parser, name,
20549 /*is_template=*/false,
20550 /*is_namespace=*/false,
20551 /*check_dependency=*/true,
20552 /*ambiguous_decls=*/NULL,
20556 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20557 the current context, return the TYPE_DECL. If TAG_NAME_P is
20558 true, the DECL indicates the class being defined in a class-head,
20559 or declared in an elaborated-type-specifier.
20561 Otherwise, return DECL. */
20564 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
20566 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20567 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20570 template <typename T> struct B;
20573 template <typename T> struct A::B {};
20575 Similarly, in an elaborated-type-specifier:
20577 namespace N { struct X{}; }
20580 template <typename T> friend struct N::X;
20583 However, if the DECL refers to a class type, and we are in
20584 the scope of the class, then the name lookup automatically
20585 finds the TYPE_DECL created by build_self_reference rather
20586 than a TEMPLATE_DECL. For example, in:
20588 template <class T> struct S {
20592 there is no need to handle such case. */
20594 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
20595 return DECL_TEMPLATE_RESULT (decl);
20600 /* If too many, or too few, template-parameter lists apply to the
20601 declarator, issue an error message. Returns TRUE if all went well,
20602 and FALSE otherwise. */
20605 cp_parser_check_declarator_template_parameters (cp_parser* parser,
20606 cp_declarator *declarator,
20607 location_t declarator_location)
20609 unsigned num_templates;
20611 /* We haven't seen any classes that involve template parameters yet. */
20614 switch (declarator->kind)
20617 if (declarator->u.id.qualifying_scope)
20621 scope = declarator->u.id.qualifying_scope;
20623 while (scope && CLASS_TYPE_P (scope))
20625 /* You're supposed to have one `template <...>'
20626 for every template class, but you don't need one
20627 for a full specialization. For example:
20629 template <class T> struct S{};
20630 template <> struct S<int> { void f(); };
20631 void S<int>::f () {}
20633 is correct; there shouldn't be a `template <>' for
20634 the definition of `S<int>::f'. */
20635 if (!CLASSTYPE_TEMPLATE_INFO (scope))
20636 /* If SCOPE does not have template information of any
20637 kind, then it is not a template, nor is it nested
20638 within a template. */
20640 if (explicit_class_specialization_p (scope))
20642 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
20645 scope = TYPE_CONTEXT (scope);
20648 else if (TREE_CODE (declarator->u.id.unqualified_name)
20649 == TEMPLATE_ID_EXPR)
20650 /* If the DECLARATOR has the form `X<y>' then it uses one
20651 additional level of template parameters. */
20654 return cp_parser_check_template_parameters
20655 (parser, num_templates, declarator_location, declarator);
20661 case cdk_reference:
20663 return (cp_parser_check_declarator_template_parameters
20664 (parser, declarator->declarator, declarator_location));
20670 gcc_unreachable ();
20675 /* NUM_TEMPLATES were used in the current declaration. If that is
20676 invalid, return FALSE and issue an error messages. Otherwise,
20677 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20678 declarator and we can print more accurate diagnostics. */
20681 cp_parser_check_template_parameters (cp_parser* parser,
20682 unsigned num_templates,
20683 location_t location,
20684 cp_declarator *declarator)
20686 /* If there are the same number of template classes and parameter
20687 lists, that's OK. */
20688 if (parser->num_template_parameter_lists == num_templates)
20690 /* If there are more, but only one more, then we are referring to a
20691 member template. That's OK too. */
20692 if (parser->num_template_parameter_lists == num_templates + 1)
20694 /* If there are more template classes than parameter lists, we have
20697 template <class T> void S<T>::R<T>::f (); */
20698 if (parser->num_template_parameter_lists < num_templates)
20700 if (declarator && !current_function_decl)
20701 error_at (location, "specializing member %<%T::%E%> "
20702 "requires %<template<>%> syntax",
20703 declarator->u.id.qualifying_scope,
20704 declarator->u.id.unqualified_name);
20705 else if (declarator)
20706 error_at (location, "invalid declaration of %<%T::%E%>",
20707 declarator->u.id.qualifying_scope,
20708 declarator->u.id.unqualified_name);
20710 error_at (location, "too few template-parameter-lists");
20713 /* Otherwise, there are too many template parameter lists. We have
20716 template <class T> template <class U> void S::f(); */
20717 error_at (location, "too many template-parameter-lists");
20721 /* Parse an optional `::' token indicating that the following name is
20722 from the global namespace. If so, PARSER->SCOPE is set to the
20723 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20724 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20725 Returns the new value of PARSER->SCOPE, if the `::' token is
20726 present, and NULL_TREE otherwise. */
20729 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
20733 /* Peek at the next token. */
20734 token = cp_lexer_peek_token (parser->lexer);
20735 /* If we're looking at a `::' token then we're starting from the
20736 global namespace, not our current location. */
20737 if (token->type == CPP_SCOPE)
20739 /* Consume the `::' token. */
20740 cp_lexer_consume_token (parser->lexer);
20741 /* Set the SCOPE so that we know where to start the lookup. */
20742 parser->scope = global_namespace;
20743 parser->qualifying_scope = global_namespace;
20744 parser->object_scope = NULL_TREE;
20746 return parser->scope;
20748 else if (!current_scope_valid_p)
20750 parser->scope = NULL_TREE;
20751 parser->qualifying_scope = NULL_TREE;
20752 parser->object_scope = NULL_TREE;
20758 /* Returns TRUE if the upcoming token sequence is the start of a
20759 constructor declarator. If FRIEND_P is true, the declarator is
20760 preceded by the `friend' specifier. */
20763 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
20765 bool constructor_p;
20766 tree nested_name_specifier;
20767 cp_token *next_token;
20769 /* The common case is that this is not a constructor declarator, so
20770 try to avoid doing lots of work if at all possible. It's not
20771 valid declare a constructor at function scope. */
20772 if (parser->in_function_body)
20774 /* And only certain tokens can begin a constructor declarator. */
20775 next_token = cp_lexer_peek_token (parser->lexer);
20776 if (next_token->type != CPP_NAME
20777 && next_token->type != CPP_SCOPE
20778 && next_token->type != CPP_NESTED_NAME_SPECIFIER
20779 && next_token->type != CPP_TEMPLATE_ID)
20782 /* Parse tentatively; we are going to roll back all of the tokens
20784 cp_parser_parse_tentatively (parser);
20785 /* Assume that we are looking at a constructor declarator. */
20786 constructor_p = true;
20788 /* Look for the optional `::' operator. */
20789 cp_parser_global_scope_opt (parser,
20790 /*current_scope_valid_p=*/false);
20791 /* Look for the nested-name-specifier. */
20792 nested_name_specifier
20793 = (cp_parser_nested_name_specifier_opt (parser,
20794 /*typename_keyword_p=*/false,
20795 /*check_dependency_p=*/false,
20797 /*is_declaration=*/false));
20798 /* Outside of a class-specifier, there must be a
20799 nested-name-specifier. */
20800 if (!nested_name_specifier &&
20801 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
20803 constructor_p = false;
20804 else if (nested_name_specifier == error_mark_node)
20805 constructor_p = false;
20807 /* If we have a class scope, this is easy; DR 147 says that S::S always
20808 names the constructor, and no other qualified name could. */
20809 if (constructor_p && nested_name_specifier
20810 && CLASS_TYPE_P (nested_name_specifier))
20812 tree id = cp_parser_unqualified_id (parser,
20813 /*template_keyword_p=*/false,
20814 /*check_dependency_p=*/false,
20815 /*declarator_p=*/true,
20816 /*optional_p=*/false);
20817 if (is_overloaded_fn (id))
20818 id = DECL_NAME (get_first_fn (id));
20819 if (!constructor_name_p (id, nested_name_specifier))
20820 constructor_p = false;
20822 /* If we still think that this might be a constructor-declarator,
20823 look for a class-name. */
20824 else if (constructor_p)
20828 template <typename T> struct S {
20832 we must recognize that the nested `S' names a class. */
20834 type_decl = cp_parser_class_name (parser,
20835 /*typename_keyword_p=*/false,
20836 /*template_keyword_p=*/false,
20838 /*check_dependency_p=*/false,
20839 /*class_head_p=*/false,
20840 /*is_declaration=*/false);
20841 /* If there was no class-name, then this is not a constructor. */
20842 constructor_p = !cp_parser_error_occurred (parser);
20844 /* If we're still considering a constructor, we have to see a `(',
20845 to begin the parameter-declaration-clause, followed by either a
20846 `)', an `...', or a decl-specifier. We need to check for a
20847 type-specifier to avoid being fooled into thinking that:
20851 is a constructor. (It is actually a function named `f' that
20852 takes one parameter (of type `int') and returns a value of type
20855 && !cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
20856 constructor_p = false;
20859 && cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
20860 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
20861 /* A parameter declaration begins with a decl-specifier,
20862 which is either the "attribute" keyword, a storage class
20863 specifier, or (usually) a type-specifier. */
20864 && !cp_lexer_next_token_is_decl_specifier_keyword (parser->lexer))
20867 tree pushed_scope = NULL_TREE;
20868 unsigned saved_num_template_parameter_lists;
20870 /* Names appearing in the type-specifier should be looked up
20871 in the scope of the class. */
20872 if (current_class_type)
20876 type = TREE_TYPE (type_decl);
20877 if (TREE_CODE (type) == TYPENAME_TYPE)
20879 type = resolve_typename_type (type,
20880 /*only_current_p=*/false);
20881 if (TREE_CODE (type) == TYPENAME_TYPE)
20883 cp_parser_abort_tentative_parse (parser);
20887 pushed_scope = push_scope (type);
20890 /* Inside the constructor parameter list, surrounding
20891 template-parameter-lists do not apply. */
20892 saved_num_template_parameter_lists
20893 = parser->num_template_parameter_lists;
20894 parser->num_template_parameter_lists = 0;
20896 /* Look for the type-specifier. */
20897 cp_parser_type_specifier (parser,
20898 CP_PARSER_FLAGS_NONE,
20899 /*decl_specs=*/NULL,
20900 /*is_declarator=*/true,
20901 /*declares_class_or_enum=*/NULL,
20902 /*is_cv_qualifier=*/NULL);
20904 parser->num_template_parameter_lists
20905 = saved_num_template_parameter_lists;
20907 /* Leave the scope of the class. */
20909 pop_scope (pushed_scope);
20911 constructor_p = !cp_parser_error_occurred (parser);
20915 /* We did not really want to consume any tokens. */
20916 cp_parser_abort_tentative_parse (parser);
20918 return constructor_p;
20921 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20922 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20923 they must be performed once we are in the scope of the function.
20925 Returns the function defined. */
20928 cp_parser_function_definition_from_specifiers_and_declarator
20929 (cp_parser* parser,
20930 cp_decl_specifier_seq *decl_specifiers,
20932 const cp_declarator *declarator)
20937 /* Begin the function-definition. */
20938 success_p = start_function (decl_specifiers, declarator, attributes);
20940 /* The things we're about to see are not directly qualified by any
20941 template headers we've seen thus far. */
20942 reset_specialization ();
20944 /* If there were names looked up in the decl-specifier-seq that we
20945 did not check, check them now. We must wait until we are in the
20946 scope of the function to perform the checks, since the function
20947 might be a friend. */
20948 perform_deferred_access_checks ();
20952 /* Skip the entire function. */
20953 cp_parser_skip_to_end_of_block_or_statement (parser);
20954 fn = error_mark_node;
20956 else if (DECL_INITIAL (current_function_decl) != error_mark_node)
20958 /* Seen already, skip it. An error message has already been output. */
20959 cp_parser_skip_to_end_of_block_or_statement (parser);
20960 fn = current_function_decl;
20961 current_function_decl = NULL_TREE;
20962 /* If this is a function from a class, pop the nested class. */
20963 if (current_class_name)
20964 pop_nested_class ();
20969 if (DECL_DECLARED_INLINE_P (current_function_decl))
20970 tv = TV_PARSE_INLINE;
20972 tv = TV_PARSE_FUNC;
20974 fn = cp_parser_function_definition_after_declarator (parser,
20975 /*inline_p=*/false);
20982 /* Parse the part of a function-definition that follows the
20983 declarator. INLINE_P is TRUE iff this function is an inline
20984 function defined within a class-specifier.
20986 Returns the function defined. */
20989 cp_parser_function_definition_after_declarator (cp_parser* parser,
20993 bool ctor_initializer_p = false;
20994 bool saved_in_unbraced_linkage_specification_p;
20995 bool saved_in_function_body;
20996 unsigned saved_num_template_parameter_lists;
20999 saved_in_function_body = parser->in_function_body;
21000 parser->in_function_body = true;
21001 /* If the next token is `return', then the code may be trying to
21002 make use of the "named return value" extension that G++ used to
21004 token = cp_lexer_peek_token (parser->lexer);
21005 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
21007 /* Consume the `return' keyword. */
21008 cp_lexer_consume_token (parser->lexer);
21009 /* Look for the identifier that indicates what value is to be
21011 cp_parser_identifier (parser);
21012 /* Issue an error message. */
21013 error_at (token->location,
21014 "named return values are no longer supported");
21015 /* Skip tokens until we reach the start of the function body. */
21018 cp_token *token = cp_lexer_peek_token (parser->lexer);
21019 if (token->type == CPP_OPEN_BRACE
21020 || token->type == CPP_EOF
21021 || token->type == CPP_PRAGMA_EOL)
21023 cp_lexer_consume_token (parser->lexer);
21026 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21027 anything declared inside `f'. */
21028 saved_in_unbraced_linkage_specification_p
21029 = parser->in_unbraced_linkage_specification_p;
21030 parser->in_unbraced_linkage_specification_p = false;
21031 /* Inside the function, surrounding template-parameter-lists do not
21033 saved_num_template_parameter_lists
21034 = parser->num_template_parameter_lists;
21035 parser->num_template_parameter_lists = 0;
21037 start_lambda_scope (current_function_decl);
21039 /* If the next token is `try', `__transaction_atomic', or
21040 `__transaction_relaxed`, then we are looking at either function-try-block
21041 or function-transaction-block. Note that all of these include the
21043 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRANSACTION_ATOMIC))
21044 ctor_initializer_p = cp_parser_function_transaction (parser,
21045 RID_TRANSACTION_ATOMIC);
21046 else if (cp_lexer_next_token_is_keyword (parser->lexer,
21047 RID_TRANSACTION_RELAXED))
21048 ctor_initializer_p = cp_parser_function_transaction (parser,
21049 RID_TRANSACTION_RELAXED);
21050 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
21051 ctor_initializer_p = cp_parser_function_try_block (parser);
21054 = cp_parser_ctor_initializer_opt_and_function_body (parser);
21056 finish_lambda_scope ();
21058 /* Finish the function. */
21059 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
21060 (inline_p ? 2 : 0));
21061 /* Generate code for it, if necessary. */
21062 expand_or_defer_fn (fn);
21063 /* Restore the saved values. */
21064 parser->in_unbraced_linkage_specification_p
21065 = saved_in_unbraced_linkage_specification_p;
21066 parser->num_template_parameter_lists
21067 = saved_num_template_parameter_lists;
21068 parser->in_function_body = saved_in_function_body;
21073 /* Parse a template-declaration, assuming that the `export' (and
21074 `extern') keywords, if present, has already been scanned. MEMBER_P
21075 is as for cp_parser_template_declaration. */
21078 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
21080 tree decl = NULL_TREE;
21081 VEC (deferred_access_check,gc) *checks;
21082 tree parameter_list;
21083 bool friend_p = false;
21084 bool need_lang_pop;
21087 /* Look for the `template' keyword. */
21088 token = cp_lexer_peek_token (parser->lexer);
21089 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, RT_TEMPLATE))
21093 if (!cp_parser_require (parser, CPP_LESS, RT_LESS))
21095 if (at_class_scope_p () && current_function_decl)
21097 /* 14.5.2.2 [temp.mem]
21099 A local class shall not have member templates. */
21100 error_at (token->location,
21101 "invalid declaration of member template in local class");
21102 cp_parser_skip_to_end_of_block_or_statement (parser);
21107 A template ... shall not have C linkage. */
21108 if (current_lang_name == lang_name_c)
21110 error_at (token->location, "template with C linkage");
21111 /* Give it C++ linkage to avoid confusing other parts of the
21113 push_lang_context (lang_name_cplusplus);
21114 need_lang_pop = true;
21117 need_lang_pop = false;
21119 /* We cannot perform access checks on the template parameter
21120 declarations until we know what is being declared, just as we
21121 cannot check the decl-specifier list. */
21122 push_deferring_access_checks (dk_deferred);
21124 /* If the next token is `>', then we have an invalid
21125 specialization. Rather than complain about an invalid template
21126 parameter, issue an error message here. */
21127 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
21129 cp_parser_error (parser, "invalid explicit specialization");
21130 begin_specialization ();
21131 parameter_list = NULL_TREE;
21135 /* Parse the template parameters. */
21136 parameter_list = cp_parser_template_parameter_list (parser);
21137 fixup_template_parms ();
21140 /* Get the deferred access checks from the parameter list. These
21141 will be checked once we know what is being declared, as for a
21142 member template the checks must be performed in the scope of the
21143 class containing the member. */
21144 checks = get_deferred_access_checks ();
21146 /* Look for the `>'. */
21147 cp_parser_skip_to_end_of_template_parameter_list (parser);
21148 /* We just processed one more parameter list. */
21149 ++parser->num_template_parameter_lists;
21150 /* If the next token is `template', there are more template
21152 if (cp_lexer_next_token_is_keyword (parser->lexer,
21154 cp_parser_template_declaration_after_export (parser, member_p);
21155 else if (cxx_dialect >= cxx0x
21156 && cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
21157 decl = cp_parser_alias_declaration (parser);
21160 /* There are no access checks when parsing a template, as we do not
21161 know if a specialization will be a friend. */
21162 push_deferring_access_checks (dk_no_check);
21163 token = cp_lexer_peek_token (parser->lexer);
21164 decl = cp_parser_single_declaration (parser,
21167 /*explicit_specialization_p=*/false,
21169 pop_deferring_access_checks ();
21171 /* If this is a member template declaration, let the front
21173 if (member_p && !friend_p && decl)
21175 if (TREE_CODE (decl) == TYPE_DECL)
21176 cp_parser_check_access_in_redeclaration (decl, token->location);
21178 decl = finish_member_template_decl (decl);
21180 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
21181 make_friend_class (current_class_type, TREE_TYPE (decl),
21182 /*complain=*/true);
21184 /* We are done with the current parameter list. */
21185 --parser->num_template_parameter_lists;
21187 pop_deferring_access_checks ();
21190 finish_template_decl (parameter_list);
21192 /* Check the template arguments for a literal operator template. */
21194 && (TREE_CODE (decl) == FUNCTION_DECL || DECL_FUNCTION_TEMPLATE_P (decl))
21195 && UDLIT_OPER_P (DECL_NAME (decl)))
21198 if (parameter_list == NULL_TREE)
21202 int num_parms = TREE_VEC_LENGTH (parameter_list);
21203 if (num_parms != 1)
21207 tree parm_list = TREE_VEC_ELT (parameter_list, 0);
21208 tree parm = INNERMOST_TEMPLATE_PARMS (parm_list);
21209 if (TREE_TYPE (parm) != char_type_node
21210 || !TEMPLATE_PARM_PARAMETER_PACK (DECL_INITIAL (parm)))
21215 error ("literal operator template %qD has invalid parameter list."
21216 " Expected non-type template argument pack <char...>",
21219 /* Register member declarations. */
21220 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
21221 finish_member_declaration (decl);
21222 /* For the erroneous case of a template with C linkage, we pushed an
21223 implicit C++ linkage scope; exit that scope now. */
21225 pop_lang_context ();
21226 /* If DECL is a function template, we must return to parse it later.
21227 (Even though there is no definition, there might be default
21228 arguments that need handling.) */
21229 if (member_p && decl
21230 && (TREE_CODE (decl) == FUNCTION_DECL
21231 || DECL_FUNCTION_TEMPLATE_P (decl)))
21232 VEC_safe_push (tree, gc, unparsed_funs_with_definitions, decl);
21235 /* Perform the deferred access checks from a template-parameter-list.
21236 CHECKS is a TREE_LIST of access checks, as returned by
21237 get_deferred_access_checks. */
21240 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check,gc)* checks)
21242 ++processing_template_parmlist;
21243 perform_access_checks (checks);
21244 --processing_template_parmlist;
21247 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21248 `function-definition' sequence. MEMBER_P is true, this declaration
21249 appears in a class scope.
21251 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21252 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21255 cp_parser_single_declaration (cp_parser* parser,
21256 VEC (deferred_access_check,gc)* checks,
21258 bool explicit_specialization_p,
21261 int declares_class_or_enum;
21262 tree decl = NULL_TREE;
21263 cp_decl_specifier_seq decl_specifiers;
21264 bool function_definition_p = false;
21265 cp_token *decl_spec_token_start;
21267 /* This function is only used when processing a template
21269 gcc_assert (innermost_scope_kind () == sk_template_parms
21270 || innermost_scope_kind () == sk_template_spec);
21272 /* Defer access checks until we know what is being declared. */
21273 push_deferring_access_checks (dk_deferred);
21275 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21277 decl_spec_token_start = cp_lexer_peek_token (parser->lexer);
21278 cp_parser_decl_specifier_seq (parser,
21279 CP_PARSER_FLAGS_OPTIONAL,
21281 &declares_class_or_enum);
21283 *friend_p = cp_parser_friend_p (&decl_specifiers);
21285 /* There are no template typedefs. */
21286 if (decl_specifiers.specs[(int) ds_typedef])
21288 error_at (decl_spec_token_start->location,
21289 "template declaration of %<typedef%>");
21290 decl = error_mark_node;
21293 /* Gather up the access checks that occurred the
21294 decl-specifier-seq. */
21295 stop_deferring_access_checks ();
21297 /* Check for the declaration of a template class. */
21298 if (declares_class_or_enum)
21300 if (cp_parser_declares_only_class_p (parser))
21302 decl = shadow_tag (&decl_specifiers);
21307 friend template <typename T> struct A<T>::B;
21310 A<T>::B will be represented by a TYPENAME_TYPE, and
21311 therefore not recognized by shadow_tag. */
21312 if (friend_p && *friend_p
21314 && decl_specifiers.type
21315 && TYPE_P (decl_specifiers.type))
21316 decl = decl_specifiers.type;
21318 if (decl && decl != error_mark_node)
21319 decl = TYPE_NAME (decl);
21321 decl = error_mark_node;
21323 /* Perform access checks for template parameters. */
21324 cp_parser_perform_template_parameter_access_checks (checks);
21328 /* Complain about missing 'typename' or other invalid type names. */
21329 if (!decl_specifiers.any_type_specifiers_p
21330 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
21332 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21333 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21334 the rest of this declaration. */
21335 decl = error_mark_node;
21339 /* If it's not a template class, try for a template function. If
21340 the next token is a `;', then this declaration does not declare
21341 anything. But, if there were errors in the decl-specifiers, then
21342 the error might well have come from an attempted class-specifier.
21343 In that case, there's no need to warn about a missing declarator. */
21345 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
21346 || decl_specifiers.type != error_mark_node))
21348 decl = cp_parser_init_declarator (parser,
21351 /*function_definition_allowed_p=*/true,
21353 declares_class_or_enum,
21354 &function_definition_p,
21357 /* 7.1.1-1 [dcl.stc]
21359 A storage-class-specifier shall not be specified in an explicit
21360 specialization... */
21362 && explicit_specialization_p
21363 && decl_specifiers.storage_class != sc_none)
21365 error_at (decl_spec_token_start->location,
21366 "explicit template specialization cannot have a storage class");
21367 decl = error_mark_node;
21371 /* Look for a trailing `;' after the declaration. */
21372 if (!function_definition_p
21373 && (decl == error_mark_node
21374 || !cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON)))
21375 cp_parser_skip_to_end_of_block_or_statement (parser);
21378 pop_deferring_access_checks ();
21380 /* Clear any current qualification; whatever comes next is the start
21381 of something new. */
21382 parser->scope = NULL_TREE;
21383 parser->qualifying_scope = NULL_TREE;
21384 parser->object_scope = NULL_TREE;
21389 /* Parse a cast-expression that is not the operand of a unary "&". */
21392 cp_parser_simple_cast_expression (cp_parser *parser)
21394 return cp_parser_cast_expression (parser, /*address_p=*/false,
21395 /*cast_p=*/false, NULL);
21398 /* Parse a functional cast to TYPE. Returns an expression
21399 representing the cast. */
21402 cp_parser_functional_cast (cp_parser* parser, tree type)
21405 tree expression_list;
21409 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
21411 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
21412 expression_list = cp_parser_braced_list (parser, &nonconst_p);
21413 CONSTRUCTOR_IS_DIRECT_INIT (expression_list) = 1;
21414 if (TREE_CODE (type) == TYPE_DECL)
21415 type = TREE_TYPE (type);
21416 return finish_compound_literal (type, expression_list,
21417 tf_warning_or_error);
21421 vec = cp_parser_parenthesized_expression_list (parser, non_attr,
21423 /*allow_expansion_p=*/true,
21424 /*non_constant_p=*/NULL);
21426 expression_list = error_mark_node;
21429 expression_list = build_tree_list_vec (vec);
21430 release_tree_vector (vec);
21433 cast = build_functional_cast (type, expression_list,
21434 tf_warning_or_error);
21435 /* [expr.const]/1: In an integral constant expression "only type
21436 conversions to integral or enumeration type can be used". */
21437 if (TREE_CODE (type) == TYPE_DECL)
21438 type = TREE_TYPE (type);
21439 if (cast != error_mark_node
21440 && !cast_valid_in_integral_constant_expression_p (type)
21441 && cp_parser_non_integral_constant_expression (parser,
21443 return error_mark_node;
21447 /* Save the tokens that make up the body of a member function defined
21448 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21449 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21450 specifiers applied to the declaration. Returns the FUNCTION_DECL
21451 for the member function. */
21454 cp_parser_save_member_function_body (cp_parser* parser,
21455 cp_decl_specifier_seq *decl_specifiers,
21456 cp_declarator *declarator,
21463 /* Create the FUNCTION_DECL. */
21464 fn = grokmethod (decl_specifiers, declarator, attributes);
21465 /* If something went badly wrong, bail out now. */
21466 if (fn == error_mark_node)
21468 /* If there's a function-body, skip it. */
21469 if (cp_parser_token_starts_function_definition_p
21470 (cp_lexer_peek_token (parser->lexer)))
21471 cp_parser_skip_to_end_of_block_or_statement (parser);
21472 return error_mark_node;
21475 /* Remember it, if there default args to post process. */
21476 cp_parser_save_default_args (parser, fn);
21478 /* Save away the tokens that make up the body of the
21480 first = parser->lexer->next_token;
21481 /* We can have braced-init-list mem-initializers before the fn body. */
21482 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
21484 cp_lexer_consume_token (parser->lexer);
21485 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
21486 && cp_lexer_next_token_is_not_keyword (parser->lexer, RID_TRY))
21488 /* cache_group will stop after an un-nested { } pair, too. */
21489 if (cp_parser_cache_group (parser, CPP_CLOSE_PAREN, /*depth=*/0))
21492 /* variadic mem-inits have ... after the ')'. */
21493 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
21494 cp_lexer_consume_token (parser->lexer);
21497 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
21498 /* Handle function try blocks. */
21499 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
21500 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
21501 last = parser->lexer->next_token;
21503 /* Save away the inline definition; we will process it when the
21504 class is complete. */
21505 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
21506 DECL_PENDING_INLINE_P (fn) = 1;
21508 /* We need to know that this was defined in the class, so that
21509 friend templates are handled correctly. */
21510 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
21512 /* Add FN to the queue of functions to be parsed later. */
21513 VEC_safe_push (tree, gc, unparsed_funs_with_definitions, fn);
21518 /* Save the tokens that make up the in-class initializer for a non-static
21519 data member. Returns a DEFAULT_ARG. */
21522 cp_parser_save_nsdmi (cp_parser* parser)
21524 return cp_parser_cache_defarg (parser, /*nsdmi=*/true);
21527 /* Parse a template-argument-list, as well as the trailing ">" (but
21528 not the opening "<"). See cp_parser_template_argument_list for the
21532 cp_parser_enclosed_template_argument_list (cp_parser* parser)
21536 tree saved_qualifying_scope;
21537 tree saved_object_scope;
21538 bool saved_greater_than_is_operator_p;
21539 int saved_unevaluated_operand;
21540 int saved_inhibit_evaluation_warnings;
21544 When parsing a template-id, the first non-nested `>' is taken as
21545 the end of the template-argument-list rather than a greater-than
21547 saved_greater_than_is_operator_p
21548 = parser->greater_than_is_operator_p;
21549 parser->greater_than_is_operator_p = false;
21550 /* Parsing the argument list may modify SCOPE, so we save it
21552 saved_scope = parser->scope;
21553 saved_qualifying_scope = parser->qualifying_scope;
21554 saved_object_scope = parser->object_scope;
21555 /* We need to evaluate the template arguments, even though this
21556 template-id may be nested within a "sizeof". */
21557 saved_unevaluated_operand = cp_unevaluated_operand;
21558 cp_unevaluated_operand = 0;
21559 saved_inhibit_evaluation_warnings = c_inhibit_evaluation_warnings;
21560 c_inhibit_evaluation_warnings = 0;
21561 /* Parse the template-argument-list itself. */
21562 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER)
21563 || cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
21564 arguments = NULL_TREE;
21566 arguments = cp_parser_template_argument_list (parser);
21567 /* Look for the `>' that ends the template-argument-list. If we find
21568 a '>>' instead, it's probably just a typo. */
21569 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
21571 if (cxx_dialect != cxx98)
21573 /* In C++0x, a `>>' in a template argument list or cast
21574 expression is considered to be two separate `>'
21575 tokens. So, change the current token to a `>', but don't
21576 consume it: it will be consumed later when the outer
21577 template argument list (or cast expression) is parsed.
21578 Note that this replacement of `>' for `>>' is necessary
21579 even if we are parsing tentatively: in the tentative
21580 case, after calling
21581 cp_parser_enclosed_template_argument_list we will always
21582 throw away all of the template arguments and the first
21583 closing `>', either because the template argument list
21584 was erroneous or because we are replacing those tokens
21585 with a CPP_TEMPLATE_ID token. The second `>' (which will
21586 not have been thrown away) is needed either to close an
21587 outer template argument list or to complete a new-style
21589 cp_token *token = cp_lexer_peek_token (parser->lexer);
21590 token->type = CPP_GREATER;
21592 else if (!saved_greater_than_is_operator_p)
21594 /* If we're in a nested template argument list, the '>>' has
21595 to be a typo for '> >'. We emit the error message, but we
21596 continue parsing and we push a '>' as next token, so that
21597 the argument list will be parsed correctly. Note that the
21598 global source location is still on the token before the
21599 '>>', so we need to say explicitly where we want it. */
21600 cp_token *token = cp_lexer_peek_token (parser->lexer);
21601 error_at (token->location, "%<>>%> should be %<> >%> "
21602 "within a nested template argument list");
21604 token->type = CPP_GREATER;
21608 /* If this is not a nested template argument list, the '>>'
21609 is a typo for '>'. Emit an error message and continue.
21610 Same deal about the token location, but here we can get it
21611 right by consuming the '>>' before issuing the diagnostic. */
21612 cp_token *token = cp_lexer_consume_token (parser->lexer);
21613 error_at (token->location,
21614 "spurious %<>>%>, use %<>%> to terminate "
21615 "a template argument list");
21619 cp_parser_skip_to_end_of_template_parameter_list (parser);
21620 /* The `>' token might be a greater-than operator again now. */
21621 parser->greater_than_is_operator_p
21622 = saved_greater_than_is_operator_p;
21623 /* Restore the SAVED_SCOPE. */
21624 parser->scope = saved_scope;
21625 parser->qualifying_scope = saved_qualifying_scope;
21626 parser->object_scope = saved_object_scope;
21627 cp_unevaluated_operand = saved_unevaluated_operand;
21628 c_inhibit_evaluation_warnings = saved_inhibit_evaluation_warnings;
21633 /* MEMBER_FUNCTION is a member function, or a friend. If default
21634 arguments, or the body of the function have not yet been parsed,
21638 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
21640 timevar_push (TV_PARSE_INMETH);
21641 /* If this member is a template, get the underlying
21643 if (DECL_FUNCTION_TEMPLATE_P (member_function))
21644 member_function = DECL_TEMPLATE_RESULT (member_function);
21646 /* There should not be any class definitions in progress at this
21647 point; the bodies of members are only parsed outside of all class
21649 gcc_assert (parser->num_classes_being_defined == 0);
21650 /* While we're parsing the member functions we might encounter more
21651 classes. We want to handle them right away, but we don't want
21652 them getting mixed up with functions that are currently in the
21654 push_unparsed_function_queues (parser);
21656 /* Make sure that any template parameters are in scope. */
21657 maybe_begin_member_template_processing (member_function);
21659 /* If the body of the function has not yet been parsed, parse it
21661 if (DECL_PENDING_INLINE_P (member_function))
21663 tree function_scope;
21664 cp_token_cache *tokens;
21666 /* The function is no longer pending; we are processing it. */
21667 tokens = DECL_PENDING_INLINE_INFO (member_function);
21668 DECL_PENDING_INLINE_INFO (member_function) = NULL;
21669 DECL_PENDING_INLINE_P (member_function) = 0;
21671 /* If this is a local class, enter the scope of the containing
21673 function_scope = current_function_decl;
21674 if (function_scope)
21675 push_function_context ();
21677 /* Push the body of the function onto the lexer stack. */
21678 cp_parser_push_lexer_for_tokens (parser, tokens);
21680 /* Let the front end know that we going to be defining this
21682 start_preparsed_function (member_function, NULL_TREE,
21683 SF_PRE_PARSED | SF_INCLASS_INLINE);
21685 /* Don't do access checking if it is a templated function. */
21686 if (processing_template_decl)
21687 push_deferring_access_checks (dk_no_check);
21689 /* Now, parse the body of the function. */
21690 cp_parser_function_definition_after_declarator (parser,
21691 /*inline_p=*/true);
21693 if (processing_template_decl)
21694 pop_deferring_access_checks ();
21696 /* Leave the scope of the containing function. */
21697 if (function_scope)
21698 pop_function_context ();
21699 cp_parser_pop_lexer (parser);
21702 /* Remove any template parameters from the symbol table. */
21703 maybe_end_member_template_processing ();
21705 /* Restore the queue. */
21706 pop_unparsed_function_queues (parser);
21707 timevar_pop (TV_PARSE_INMETH);
21710 /* If DECL contains any default args, remember it on the unparsed
21711 functions queue. */
21714 cp_parser_save_default_args (cp_parser* parser, tree decl)
21718 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
21720 probe = TREE_CHAIN (probe))
21721 if (TREE_PURPOSE (probe))
21723 cp_default_arg_entry *entry
21724 = VEC_safe_push (cp_default_arg_entry, gc,
21725 unparsed_funs_with_default_args, NULL);
21726 entry->class_type = current_class_type;
21727 entry->decl = decl;
21732 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21733 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21734 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21735 from the parameter-type-list. */
21738 cp_parser_late_parse_one_default_arg (cp_parser *parser, tree decl,
21739 tree default_arg, tree parmtype)
21741 cp_token_cache *tokens;
21745 if (default_arg == error_mark_node)
21746 return error_mark_node;
21748 /* Push the saved tokens for the default argument onto the parser's
21750 tokens = DEFARG_TOKENS (default_arg);
21751 cp_parser_push_lexer_for_tokens (parser, tokens);
21753 start_lambda_scope (decl);
21755 /* Parse the default argument. */
21756 parsed_arg = cp_parser_initializer (parser, &dummy, &dummy);
21757 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg))
21758 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS);
21760 finish_lambda_scope ();
21762 if (!processing_template_decl)
21764 /* In a non-template class, check conversions now. In a template,
21765 we'll wait and instantiate these as needed. */
21766 if (TREE_CODE (decl) == PARM_DECL)
21767 parsed_arg = check_default_argument (parmtype, parsed_arg);
21770 int flags = LOOKUP_IMPLICIT;
21771 if (BRACE_ENCLOSED_INITIALIZER_P (parsed_arg)
21772 && CONSTRUCTOR_IS_DIRECT_INIT (parsed_arg))
21773 flags = LOOKUP_NORMAL;
21774 parsed_arg = digest_init_flags (TREE_TYPE (decl), parsed_arg, flags);
21778 /* If the token stream has not been completely used up, then
21779 there was extra junk after the end of the default
21781 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
21783 if (TREE_CODE (decl) == PARM_DECL)
21784 cp_parser_error (parser, "expected %<,%>");
21786 cp_parser_error (parser, "expected %<;%>");
21789 /* Revert to the main lexer. */
21790 cp_parser_pop_lexer (parser);
21795 /* FIELD is a non-static data member with an initializer which we saved for
21796 later; parse it now. */
21799 cp_parser_late_parsing_nsdmi (cp_parser *parser, tree field)
21803 push_unparsed_function_queues (parser);
21804 def = cp_parser_late_parse_one_default_arg (parser, field,
21805 DECL_INITIAL (field),
21807 pop_unparsed_function_queues (parser);
21809 DECL_INITIAL (field) = def;
21812 /* FN is a FUNCTION_DECL which may contains a parameter with an
21813 unparsed DEFAULT_ARG. Parse the default args now. This function
21814 assumes that the current scope is the scope in which the default
21815 argument should be processed. */
21818 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
21820 bool saved_local_variables_forbidden_p;
21821 tree parm, parmdecl;
21823 /* While we're parsing the default args, we might (due to the
21824 statement expression extension) encounter more classes. We want
21825 to handle them right away, but we don't want them getting mixed
21826 up with default args that are currently in the queue. */
21827 push_unparsed_function_queues (parser);
21829 /* Local variable names (and the `this' keyword) may not appear
21830 in a default argument. */
21831 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
21832 parser->local_variables_forbidden_p = true;
21834 push_defarg_context (fn);
21836 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn)),
21837 parmdecl = DECL_ARGUMENTS (fn);
21838 parm && parm != void_list_node;
21839 parm = TREE_CHAIN (parm),
21840 parmdecl = DECL_CHAIN (parmdecl))
21842 tree default_arg = TREE_PURPOSE (parm);
21844 VEC(tree,gc) *insts;
21851 if (TREE_CODE (default_arg) != DEFAULT_ARG)
21852 /* This can happen for a friend declaration for a function
21853 already declared with default arguments. */
21857 = cp_parser_late_parse_one_default_arg (parser, parmdecl,
21859 TREE_VALUE (parm));
21860 if (parsed_arg == error_mark_node)
21865 TREE_PURPOSE (parm) = parsed_arg;
21867 /* Update any instantiations we've already created. */
21868 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
21869 VEC_iterate (tree, insts, ix, copy); ix++)
21870 TREE_PURPOSE (copy) = parsed_arg;
21873 pop_defarg_context ();
21875 /* Make sure no default arg is missing. */
21876 check_default_args (fn);
21878 /* Restore the state of local_variables_forbidden_p. */
21879 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
21881 /* Restore the queue. */
21882 pop_unparsed_function_queues (parser);
21885 /* Parse the operand of `sizeof' (or a similar operator). Returns
21886 either a TYPE or an expression, depending on the form of the
21887 input. The KEYWORD indicates which kind of expression we have
21891 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
21893 tree expr = NULL_TREE;
21894 const char *saved_message;
21896 bool saved_integral_constant_expression_p;
21897 bool saved_non_integral_constant_expression_p;
21898 bool pack_expansion_p = false;
21900 /* Types cannot be defined in a `sizeof' expression. Save away the
21902 saved_message = parser->type_definition_forbidden_message;
21903 /* And create the new one. */
21904 tmp = concat ("types may not be defined in %<",
21905 IDENTIFIER_POINTER (ridpointers[keyword]),
21906 "%> expressions", NULL);
21907 parser->type_definition_forbidden_message = tmp;
21909 /* The restrictions on constant-expressions do not apply inside
21910 sizeof expressions. */
21911 saved_integral_constant_expression_p
21912 = parser->integral_constant_expression_p;
21913 saved_non_integral_constant_expression_p
21914 = parser->non_integral_constant_expression_p;
21915 parser->integral_constant_expression_p = false;
21917 /* If it's a `...', then we are computing the length of a parameter
21919 if (keyword == RID_SIZEOF
21920 && cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
21922 /* Consume the `...'. */
21923 cp_lexer_consume_token (parser->lexer);
21924 maybe_warn_variadic_templates ();
21926 /* Note that this is an expansion. */
21927 pack_expansion_p = true;
21930 /* Do not actually evaluate the expression. */
21931 ++cp_unevaluated_operand;
21932 ++c_inhibit_evaluation_warnings;
21933 /* If it's a `(', then we might be looking at the type-id
21935 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
21938 bool saved_in_type_id_in_expr_p;
21940 /* We can't be sure yet whether we're looking at a type-id or an
21942 cp_parser_parse_tentatively (parser);
21943 /* Consume the `('. */
21944 cp_lexer_consume_token (parser->lexer);
21945 /* Parse the type-id. */
21946 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
21947 parser->in_type_id_in_expr_p = true;
21948 type = cp_parser_type_id (parser);
21949 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
21950 /* Now, look for the trailing `)'. */
21951 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
21952 /* If all went well, then we're done. */
21953 if (cp_parser_parse_definitely (parser))
21955 cp_decl_specifier_seq decl_specs;
21957 /* Build a trivial decl-specifier-seq. */
21958 clear_decl_specs (&decl_specs);
21959 decl_specs.type = type;
21961 /* Call grokdeclarator to figure out what type this is. */
21962 expr = grokdeclarator (NULL,
21966 /*attrlist=*/NULL);
21970 /* If the type-id production did not work out, then we must be
21971 looking at the unary-expression production. */
21973 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
21974 /*cast_p=*/false, NULL);
21976 if (pack_expansion_p)
21977 /* Build a pack expansion. */
21978 expr = make_pack_expansion (expr);
21980 /* Go back to evaluating expressions. */
21981 --cp_unevaluated_operand;
21982 --c_inhibit_evaluation_warnings;
21984 /* Free the message we created. */
21986 /* And restore the old one. */
21987 parser->type_definition_forbidden_message = saved_message;
21988 parser->integral_constant_expression_p
21989 = saved_integral_constant_expression_p;
21990 parser->non_integral_constant_expression_p
21991 = saved_non_integral_constant_expression_p;
21996 /* If the current declaration has no declarator, return true. */
21999 cp_parser_declares_only_class_p (cp_parser *parser)
22001 /* If the next token is a `;' or a `,' then there is no
22003 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
22004 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
22007 /* Update the DECL_SPECS to reflect the storage class indicated by
22011 cp_parser_set_storage_class (cp_parser *parser,
22012 cp_decl_specifier_seq *decl_specs,
22014 location_t location)
22016 cp_storage_class storage_class;
22018 if (parser->in_unbraced_linkage_specification_p)
22020 error_at (location, "invalid use of %qD in linkage specification",
22021 ridpointers[keyword]);
22024 else if (decl_specs->storage_class != sc_none)
22026 decl_specs->conflicting_specifiers_p = true;
22030 if ((keyword == RID_EXTERN || keyword == RID_STATIC)
22031 && decl_specs->specs[(int) ds_thread])
22033 error_at (location, "%<__thread%> before %qD", ridpointers[keyword]);
22034 decl_specs->specs[(int) ds_thread] = 0;
22040 storage_class = sc_auto;
22043 storage_class = sc_register;
22046 storage_class = sc_static;
22049 storage_class = sc_extern;
22052 storage_class = sc_mutable;
22055 gcc_unreachable ();
22057 decl_specs->storage_class = storage_class;
22059 /* A storage class specifier cannot be applied alongside a typedef
22060 specifier. If there is a typedef specifier present then set
22061 conflicting_specifiers_p which will trigger an error later
22062 on in grokdeclarator. */
22063 if (decl_specs->specs[(int)ds_typedef])
22064 decl_specs->conflicting_specifiers_p = true;
22067 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22068 is true, the type is a class or enum definition. */
22071 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
22073 location_t location,
22074 bool type_definition_p)
22076 decl_specs->any_specifiers_p = true;
22078 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22079 (with, for example, in "typedef int wchar_t;") we remember that
22080 this is what happened. In system headers, we ignore these
22081 declarations so that G++ can work with system headers that are not
22083 if (decl_specs->specs[(int) ds_typedef]
22084 && !type_definition_p
22085 && (type_spec == boolean_type_node
22086 || type_spec == char16_type_node
22087 || type_spec == char32_type_node
22088 || type_spec == wchar_type_node)
22089 && (decl_specs->type
22090 || decl_specs->specs[(int) ds_long]
22091 || decl_specs->specs[(int) ds_short]
22092 || decl_specs->specs[(int) ds_unsigned]
22093 || decl_specs->specs[(int) ds_signed]))
22095 decl_specs->redefined_builtin_type = type_spec;
22096 if (!decl_specs->type)
22098 decl_specs->type = type_spec;
22099 decl_specs->type_definition_p = false;
22100 decl_specs->type_location = location;
22103 else if (decl_specs->type)
22104 decl_specs->multiple_types_p = true;
22107 decl_specs->type = type_spec;
22108 decl_specs->type_definition_p = type_definition_p;
22109 decl_specs->redefined_builtin_type = NULL_TREE;
22110 decl_specs->type_location = location;
22114 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22115 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22118 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
22120 return decl_specifiers->specs[(int) ds_friend] != 0;
22123 /* Issue an error message indicating that TOKEN_DESC was expected.
22124 If KEYWORD is true, it indicated this function is called by
22125 cp_parser_require_keword and the required token can only be
22126 a indicated keyword. */
22129 cp_parser_required_error (cp_parser *parser,
22130 required_token token_desc,
22133 switch (token_desc)
22136 cp_parser_error (parser, "expected %<new%>");
22139 cp_parser_error (parser, "expected %<delete%>");
22142 cp_parser_error (parser, "expected %<return%>");
22145 cp_parser_error (parser, "expected %<while%>");
22148 cp_parser_error (parser, "expected %<extern%>");
22150 case RT_STATIC_ASSERT:
22151 cp_parser_error (parser, "expected %<static_assert%>");
22154 cp_parser_error (parser, "expected %<decltype%>");
22157 cp_parser_error (parser, "expected %<operator%>");
22160 cp_parser_error (parser, "expected %<class%>");
22163 cp_parser_error (parser, "expected %<template%>");
22166 cp_parser_error (parser, "expected %<namespace%>");
22169 cp_parser_error (parser, "expected %<using%>");
22172 cp_parser_error (parser, "expected %<asm%>");
22175 cp_parser_error (parser, "expected %<try%>");
22178 cp_parser_error (parser, "expected %<catch%>");
22181 cp_parser_error (parser, "expected %<throw%>");
22184 cp_parser_error (parser, "expected %<__label__%>");
22187 cp_parser_error (parser, "expected %<@try%>");
22189 case RT_AT_SYNCHRONIZED:
22190 cp_parser_error (parser, "expected %<@synchronized%>");
22193 cp_parser_error (parser, "expected %<@throw%>");
22195 case RT_TRANSACTION_ATOMIC:
22196 cp_parser_error (parser, "expected %<__transaction_atomic%>");
22198 case RT_TRANSACTION_RELAXED:
22199 cp_parser_error (parser, "expected %<__transaction_relaxed%>");
22206 switch (token_desc)
22209 cp_parser_error (parser, "expected %<;%>");
22211 case RT_OPEN_PAREN:
22212 cp_parser_error (parser, "expected %<(%>");
22214 case RT_CLOSE_BRACE:
22215 cp_parser_error (parser, "expected %<}%>");
22217 case RT_OPEN_BRACE:
22218 cp_parser_error (parser, "expected %<{%>");
22220 case RT_CLOSE_SQUARE:
22221 cp_parser_error (parser, "expected %<]%>");
22223 case RT_OPEN_SQUARE:
22224 cp_parser_error (parser, "expected %<[%>");
22227 cp_parser_error (parser, "expected %<,%>");
22230 cp_parser_error (parser, "expected %<::%>");
22233 cp_parser_error (parser, "expected %<<%>");
22236 cp_parser_error (parser, "expected %<>%>");
22239 cp_parser_error (parser, "expected %<=%>");
22242 cp_parser_error (parser, "expected %<...%>");
22245 cp_parser_error (parser, "expected %<*%>");
22248 cp_parser_error (parser, "expected %<~%>");
22251 cp_parser_error (parser, "expected %<:%>");
22253 case RT_COLON_SCOPE:
22254 cp_parser_error (parser, "expected %<:%> or %<::%>");
22256 case RT_CLOSE_PAREN:
22257 cp_parser_error (parser, "expected %<)%>");
22259 case RT_COMMA_CLOSE_PAREN:
22260 cp_parser_error (parser, "expected %<,%> or %<)%>");
22262 case RT_PRAGMA_EOL:
22263 cp_parser_error (parser, "expected end of line");
22266 cp_parser_error (parser, "expected identifier");
22269 cp_parser_error (parser, "expected selection-statement");
22271 case RT_INTERATION:
22272 cp_parser_error (parser, "expected iteration-statement");
22275 cp_parser_error (parser, "expected jump-statement");
22278 cp_parser_error (parser, "expected class-key");
22280 case RT_CLASS_TYPENAME_TEMPLATE:
22281 cp_parser_error (parser,
22282 "expected %<class%>, %<typename%>, or %<template%>");
22285 gcc_unreachable ();
22289 gcc_unreachable ();
22294 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22295 issue an error message indicating that TOKEN_DESC was expected.
22297 Returns the token consumed, if the token had the appropriate type.
22298 Otherwise, returns NULL. */
22301 cp_parser_require (cp_parser* parser,
22302 enum cpp_ttype type,
22303 required_token token_desc)
22305 if (cp_lexer_next_token_is (parser->lexer, type))
22306 return cp_lexer_consume_token (parser->lexer);
22309 /* Output the MESSAGE -- unless we're parsing tentatively. */
22310 if (!cp_parser_simulate_error (parser))
22311 cp_parser_required_error (parser, token_desc, /*keyword=*/false);
22316 /* An error message is produced if the next token is not '>'.
22317 All further tokens are skipped until the desired token is
22318 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22321 cp_parser_skip_to_end_of_template_parameter_list (cp_parser* parser)
22323 /* Current level of '< ... >'. */
22324 unsigned level = 0;
22325 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22326 unsigned nesting_depth = 0;
22328 /* Are we ready, yet? If not, issue error message. */
22329 if (cp_parser_require (parser, CPP_GREATER, RT_GREATER))
22332 /* Skip tokens until the desired token is found. */
22335 /* Peek at the next token. */
22336 switch (cp_lexer_peek_token (parser->lexer)->type)
22339 if (!nesting_depth)
22344 if (cxx_dialect == cxx98)
22345 /* C++0x views the `>>' operator as two `>' tokens, but
22348 else if (!nesting_depth && level-- == 0)
22350 /* We've hit a `>>' where the first `>' closes the
22351 template argument list, and the second `>' is
22352 spurious. Just consume the `>>' and stop; we've
22353 already produced at least one error. */
22354 cp_lexer_consume_token (parser->lexer);
22357 /* Fall through for C++0x, so we handle the second `>' in
22361 if (!nesting_depth && level-- == 0)
22363 /* We've reached the token we want, consume it and stop. */
22364 cp_lexer_consume_token (parser->lexer);
22369 case CPP_OPEN_PAREN:
22370 case CPP_OPEN_SQUARE:
22374 case CPP_CLOSE_PAREN:
22375 case CPP_CLOSE_SQUARE:
22376 if (nesting_depth-- == 0)
22381 case CPP_PRAGMA_EOL:
22382 case CPP_SEMICOLON:
22383 case CPP_OPEN_BRACE:
22384 case CPP_CLOSE_BRACE:
22385 /* The '>' was probably forgotten, don't look further. */
22392 /* Consume this token. */
22393 cp_lexer_consume_token (parser->lexer);
22397 /* If the next token is the indicated keyword, consume it. Otherwise,
22398 issue an error message indicating that TOKEN_DESC was expected.
22400 Returns the token consumed, if the token had the appropriate type.
22401 Otherwise, returns NULL. */
22404 cp_parser_require_keyword (cp_parser* parser,
22406 required_token token_desc)
22408 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
22410 if (token && token->keyword != keyword)
22412 cp_parser_required_error (parser, token_desc, /*keyword=*/true);
22419 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22420 function-definition. */
22423 cp_parser_token_starts_function_definition_p (cp_token* token)
22425 return (/* An ordinary function-body begins with an `{'. */
22426 token->type == CPP_OPEN_BRACE
22427 /* A ctor-initializer begins with a `:'. */
22428 || token->type == CPP_COLON
22429 /* A function-try-block begins with `try'. */
22430 || token->keyword == RID_TRY
22431 /* A function-transaction-block begins with `__transaction_atomic'
22432 or `__transaction_relaxed'. */
22433 || token->keyword == RID_TRANSACTION_ATOMIC
22434 || token->keyword == RID_TRANSACTION_RELAXED
22435 /* The named return value extension begins with `return'. */
22436 || token->keyword == RID_RETURN);
22439 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22443 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
22447 token = cp_lexer_peek_token (parser->lexer);
22448 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
22451 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22452 C++0x) ending a template-argument. */
22455 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
22459 token = cp_lexer_peek_token (parser->lexer);
22460 return (token->type == CPP_COMMA
22461 || token->type == CPP_GREATER
22462 || token->type == CPP_ELLIPSIS
22463 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT));
22466 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22467 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22470 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
22475 token = cp_lexer_peek_nth_token (parser->lexer, n);
22476 if (token->type == CPP_LESS)
22478 /* Check for the sequence `<::' in the original code. It would be lexed as
22479 `[:', where `[' is a digraph, and there is no whitespace before
22481 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
22484 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
22485 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
22491 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22492 or none_type otherwise. */
22494 static enum tag_types
22495 cp_parser_token_is_class_key (cp_token* token)
22497 switch (token->keyword)
22502 return record_type;
22511 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22514 cp_parser_check_class_key (enum tag_types class_key, tree type)
22516 if (type == error_mark_node)
22518 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
22520 permerror (input_location, "%qs tag used in naming %q#T",
22521 class_key == union_type ? "union"
22522 : class_key == record_type ? "struct" : "class",
22524 inform (DECL_SOURCE_LOCATION (TYPE_NAME (type)),
22525 "%q#T was previously declared here", type);
22529 /* Issue an error message if DECL is redeclared with different
22530 access than its original declaration [class.access.spec/3].
22531 This applies to nested classes and nested class templates.
22535 cp_parser_check_access_in_redeclaration (tree decl, location_t location)
22537 if (!decl || !CLASS_TYPE_P (TREE_TYPE (decl)))
22540 if ((TREE_PRIVATE (decl)
22541 != (current_access_specifier == access_private_node))
22542 || (TREE_PROTECTED (decl)
22543 != (current_access_specifier == access_protected_node)))
22544 error_at (location, "%qD redeclared with different access", decl);
22547 /* Look for the `template' keyword, as a syntactic disambiguator.
22548 Return TRUE iff it is present, in which case it will be
22552 cp_parser_optional_template_keyword (cp_parser *parser)
22554 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
22556 /* The `template' keyword can only be used within templates;
22557 outside templates the parser can always figure out what is a
22558 template and what is not. */
22559 if (!processing_template_decl)
22561 cp_token *token = cp_lexer_peek_token (parser->lexer);
22562 error_at (token->location,
22563 "%<template%> (as a disambiguator) is only allowed "
22564 "within templates");
22565 /* If this part of the token stream is rescanned, the same
22566 error message would be generated. So, we purge the token
22567 from the stream. */
22568 cp_lexer_purge_token (parser->lexer);
22573 /* Consume the `template' keyword. */
22574 cp_lexer_consume_token (parser->lexer);
22582 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22583 set PARSER->SCOPE, and perform other related actions. */
22586 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
22589 struct tree_check *check_value;
22590 deferred_access_check *chk;
22591 VEC (deferred_access_check,gc) *checks;
22593 /* Get the stored value. */
22594 check_value = cp_lexer_consume_token (parser->lexer)->u.tree_check_value;
22595 /* Perform any access checks that were deferred. */
22596 checks = check_value->checks;
22599 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
22600 perform_or_defer_access_check (chk->binfo,
22604 /* Set the scope from the stored value. */
22605 parser->scope = check_value->value;
22606 parser->qualifying_scope = check_value->qualifying_scope;
22607 parser->object_scope = NULL_TREE;
22610 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22611 encounter the end of a block before what we were looking for. */
22614 cp_parser_cache_group (cp_parser *parser,
22615 enum cpp_ttype end,
22620 cp_token *token = cp_lexer_peek_token (parser->lexer);
22622 /* Abort a parenthesized expression if we encounter a semicolon. */
22623 if ((end == CPP_CLOSE_PAREN || depth == 0)
22624 && token->type == CPP_SEMICOLON)
22626 /* If we've reached the end of the file, stop. */
22627 if (token->type == CPP_EOF
22628 || (end != CPP_PRAGMA_EOL
22629 && token->type == CPP_PRAGMA_EOL))
22631 if (token->type == CPP_CLOSE_BRACE && depth == 0)
22632 /* We've hit the end of an enclosing block, so there's been some
22633 kind of syntax error. */
22636 /* Consume the token. */
22637 cp_lexer_consume_token (parser->lexer);
22638 /* See if it starts a new group. */
22639 if (token->type == CPP_OPEN_BRACE)
22641 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
22642 /* In theory this should probably check end == '}', but
22643 cp_parser_save_member_function_body needs it to exit
22644 after either '}' or ')' when called with ')'. */
22648 else if (token->type == CPP_OPEN_PAREN)
22650 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
22651 if (depth == 0 && end == CPP_CLOSE_PAREN)
22654 else if (token->type == CPP_PRAGMA)
22655 cp_parser_cache_group (parser, CPP_PRAGMA_EOL, depth + 1);
22656 else if (token->type == end)
22661 /* Like above, for caching a default argument or NSDMI. Both of these are
22662 terminated by a non-nested comma, but it can be unclear whether or not a
22663 comma is nested in a template argument list unless we do more parsing.
22664 In order to handle this ambiguity, when we encounter a ',' after a '<'
22665 we try to parse what follows as a parameter-declaration-list (in the
22666 case of a default argument) or a member-declarator (in the case of an
22667 NSDMI). If that succeeds, then we stop caching. */
22670 cp_parser_cache_defarg (cp_parser *parser, bool nsdmi)
22672 unsigned depth = 0;
22673 int maybe_template_id = 0;
22674 cp_token *first_token;
22676 tree default_argument;
22678 /* Add tokens until we have processed the entire default
22679 argument. We add the range [first_token, token). */
22680 first_token = cp_lexer_peek_token (parser->lexer);
22681 if (first_token->type == CPP_OPEN_BRACE)
22683 /* For list-initialization, this is straightforward. */
22684 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
22685 token = cp_lexer_peek_token (parser->lexer);
22691 /* Peek at the next token. */
22692 token = cp_lexer_peek_token (parser->lexer);
22693 /* What we do depends on what token we have. */
22694 switch (token->type)
22696 /* In valid code, a default argument must be
22697 immediately followed by a `,' `)', or `...'. */
22699 if (depth == 0 && maybe_template_id)
22701 /* If we've seen a '<', we might be in a
22702 template-argument-list. Until Core issue 325 is
22703 resolved, we don't know how this situation ought
22704 to be handled, so try to DTRT. We check whether
22705 what comes after the comma is a valid parameter
22706 declaration list. If it is, then the comma ends
22707 the default argument; otherwise the default
22708 argument continues. */
22709 bool error = false;
22712 /* Set ITALP so cp_parser_parameter_declaration_list
22713 doesn't decide to commit to this parse. */
22714 bool saved_italp = parser->in_template_argument_list_p;
22715 parser->in_template_argument_list_p = true;
22717 cp_parser_parse_tentatively (parser);
22718 cp_lexer_consume_token (parser->lexer);
22722 int ctor_dtor_or_conv_p;
22723 cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
22724 &ctor_dtor_or_conv_p,
22725 /*parenthesized_p=*/NULL,
22726 /*member_p=*/true);
22730 begin_scope (sk_function_parms, NULL_TREE);
22731 cp_parser_parameter_declaration_list (parser, &error);
22732 for (t = current_binding_level->names; t; t = DECL_CHAIN (t))
22733 pop_binding (DECL_NAME (t), t);
22736 if (!cp_parser_error_occurred (parser) && !error)
22738 cp_parser_abort_tentative_parse (parser);
22740 parser->in_template_argument_list_p = saved_italp;
22743 case CPP_CLOSE_PAREN:
22745 /* If we run into a non-nested `;', `}', or `]',
22746 then the code is invalid -- but the default
22747 argument is certainly over. */
22748 case CPP_SEMICOLON:
22749 case CPP_CLOSE_BRACE:
22750 case CPP_CLOSE_SQUARE:
22753 /* Update DEPTH, if necessary. */
22754 else if (token->type == CPP_CLOSE_PAREN
22755 || token->type == CPP_CLOSE_BRACE
22756 || token->type == CPP_CLOSE_SQUARE)
22760 case CPP_OPEN_PAREN:
22761 case CPP_OPEN_SQUARE:
22762 case CPP_OPEN_BRACE:
22768 /* This might be the comparison operator, or it might
22769 start a template argument list. */
22770 ++maybe_template_id;
22774 if (cxx_dialect == cxx98)
22776 /* Fall through for C++0x, which treats the `>>'
22777 operator like two `>' tokens in certain
22783 /* This might be an operator, or it might close a
22784 template argument list. But if a previous '<'
22785 started a template argument list, this will have
22786 closed it, so we can't be in one anymore. */
22787 maybe_template_id -= 1 + (token->type == CPP_RSHIFT);
22788 if (maybe_template_id < 0)
22789 maybe_template_id = 0;
22793 /* If we run out of tokens, issue an error message. */
22795 case CPP_PRAGMA_EOL:
22796 error_at (token->location, "file ends in default argument");
22802 /* In these cases, we should look for template-ids.
22803 For example, if the default argument is
22804 `X<int, double>()', we need to do name lookup to
22805 figure out whether or not `X' is a template; if
22806 so, the `,' does not end the default argument.
22808 That is not yet done. */
22815 /* If we've reached the end, stop. */
22819 /* Add the token to the token block. */
22820 token = cp_lexer_consume_token (parser->lexer);
22823 /* Create a DEFAULT_ARG to represent the unparsed default
22825 default_argument = make_node (DEFAULT_ARG);
22826 DEFARG_TOKENS (default_argument)
22827 = cp_token_cache_new (first_token, token);
22828 DEFARG_INSTANTIATIONS (default_argument) = NULL;
22830 return default_argument;
22833 /* Begin parsing tentatively. We always save tokens while parsing
22834 tentatively so that if the tentative parsing fails we can restore the
22838 cp_parser_parse_tentatively (cp_parser* parser)
22840 /* Enter a new parsing context. */
22841 parser->context = cp_parser_context_new (parser->context);
22842 /* Begin saving tokens. */
22843 cp_lexer_save_tokens (parser->lexer);
22844 /* In order to avoid repetitive access control error messages,
22845 access checks are queued up until we are no longer parsing
22847 push_deferring_access_checks (dk_deferred);
22850 /* Commit to the currently active tentative parse. */
22853 cp_parser_commit_to_tentative_parse (cp_parser* parser)
22855 cp_parser_context *context;
22858 /* Mark all of the levels as committed. */
22859 lexer = parser->lexer;
22860 for (context = parser->context; context->next; context = context->next)
22862 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
22864 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
22865 while (!cp_lexer_saving_tokens (lexer))
22866 lexer = lexer->next;
22867 cp_lexer_commit_tokens (lexer);
22871 /* Abort the currently active tentative parse. All consumed tokens
22872 will be rolled back, and no diagnostics will be issued. */
22875 cp_parser_abort_tentative_parse (cp_parser* parser)
22877 gcc_assert (parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED
22878 || errorcount > 0);
22879 cp_parser_simulate_error (parser);
22880 /* Now, pretend that we want to see if the construct was
22881 successfully parsed. */
22882 cp_parser_parse_definitely (parser);
22885 /* Stop parsing tentatively. If a parse error has occurred, restore the
22886 token stream. Otherwise, commit to the tokens we have consumed.
22887 Returns true if no error occurred; false otherwise. */
22890 cp_parser_parse_definitely (cp_parser* parser)
22892 bool error_occurred;
22893 cp_parser_context *context;
22895 /* Remember whether or not an error occurred, since we are about to
22896 destroy that information. */
22897 error_occurred = cp_parser_error_occurred (parser);
22898 /* Remove the topmost context from the stack. */
22899 context = parser->context;
22900 parser->context = context->next;
22901 /* If no parse errors occurred, commit to the tentative parse. */
22902 if (!error_occurred)
22904 /* Commit to the tokens read tentatively, unless that was
22906 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
22907 cp_lexer_commit_tokens (parser->lexer);
22909 pop_to_parent_deferring_access_checks ();
22911 /* Otherwise, if errors occurred, roll back our state so that things
22912 are just as they were before we began the tentative parse. */
22915 cp_lexer_rollback_tokens (parser->lexer);
22916 pop_deferring_access_checks ();
22918 /* Add the context to the front of the free list. */
22919 context->next = cp_parser_context_free_list;
22920 cp_parser_context_free_list = context;
22922 return !error_occurred;
22925 /* Returns true if we are parsing tentatively and are not committed to
22926 this tentative parse. */
22929 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
22931 return (cp_parser_parsing_tentatively (parser)
22932 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
22935 /* Returns nonzero iff an error has occurred during the most recent
22936 tentative parse. */
22939 cp_parser_error_occurred (cp_parser* parser)
22941 return (cp_parser_parsing_tentatively (parser)
22942 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
22945 /* Returns nonzero if GNU extensions are allowed. */
22948 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
22950 return parser->allow_gnu_extensions_p;
22953 /* Objective-C++ Productions */
22956 /* Parse an Objective-C expression, which feeds into a primary-expression
22960 objc-message-expression
22961 objc-string-literal
22962 objc-encode-expression
22963 objc-protocol-expression
22964 objc-selector-expression
22966 Returns a tree representation of the expression. */
22969 cp_parser_objc_expression (cp_parser* parser)
22971 /* Try to figure out what kind of declaration is present. */
22972 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
22976 case CPP_OPEN_SQUARE:
22977 return cp_parser_objc_message_expression (parser);
22979 case CPP_OBJC_STRING:
22980 kwd = cp_lexer_consume_token (parser->lexer);
22981 return objc_build_string_object (kwd->u.value);
22984 switch (kwd->keyword)
22986 case RID_AT_ENCODE:
22987 return cp_parser_objc_encode_expression (parser);
22989 case RID_AT_PROTOCOL:
22990 return cp_parser_objc_protocol_expression (parser);
22992 case RID_AT_SELECTOR:
22993 return cp_parser_objc_selector_expression (parser);
22999 error_at (kwd->location,
23000 "misplaced %<@%D%> Objective-C++ construct",
23002 cp_parser_skip_to_end_of_block_or_statement (parser);
23005 return error_mark_node;
23008 /* Parse an Objective-C message expression.
23010 objc-message-expression:
23011 [ objc-message-receiver objc-message-args ]
23013 Returns a representation of an Objective-C message. */
23016 cp_parser_objc_message_expression (cp_parser* parser)
23018 tree receiver, messageargs;
23020 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
23021 receiver = cp_parser_objc_message_receiver (parser);
23022 messageargs = cp_parser_objc_message_args (parser);
23023 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
23025 return objc_build_message_expr (receiver, messageargs);
23028 /* Parse an objc-message-receiver.
23030 objc-message-receiver:
23032 simple-type-specifier
23034 Returns a representation of the type or expression. */
23037 cp_parser_objc_message_receiver (cp_parser* parser)
23041 /* An Objective-C message receiver may be either (1) a type
23042 or (2) an expression. */
23043 cp_parser_parse_tentatively (parser);
23044 rcv = cp_parser_expression (parser, false, NULL);
23046 if (cp_parser_parse_definitely (parser))
23049 rcv = cp_parser_simple_type_specifier (parser,
23050 /*decl_specs=*/NULL,
23051 CP_PARSER_FLAGS_NONE);
23053 return objc_get_class_reference (rcv);
23056 /* Parse the arguments and selectors comprising an Objective-C message.
23061 objc-selector-args , objc-comma-args
23063 objc-selector-args:
23064 objc-selector [opt] : assignment-expression
23065 objc-selector-args objc-selector [opt] : assignment-expression
23068 assignment-expression
23069 objc-comma-args , assignment-expression
23071 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23072 selector arguments and TREE_VALUE containing a list of comma
23076 cp_parser_objc_message_args (cp_parser* parser)
23078 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
23079 bool maybe_unary_selector_p = true;
23080 cp_token *token = cp_lexer_peek_token (parser->lexer);
23082 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
23084 tree selector = NULL_TREE, arg;
23086 if (token->type != CPP_COLON)
23087 selector = cp_parser_objc_selector (parser);
23089 /* Detect if we have a unary selector. */
23090 if (maybe_unary_selector_p
23091 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
23092 return build_tree_list (selector, NULL_TREE);
23094 maybe_unary_selector_p = false;
23095 cp_parser_require (parser, CPP_COLON, RT_COLON);
23096 arg = cp_parser_assignment_expression (parser, false, NULL);
23099 = chainon (sel_args,
23100 build_tree_list (selector, arg));
23102 token = cp_lexer_peek_token (parser->lexer);
23105 /* Handle non-selector arguments, if any. */
23106 while (token->type == CPP_COMMA)
23110 cp_lexer_consume_token (parser->lexer);
23111 arg = cp_parser_assignment_expression (parser, false, NULL);
23114 = chainon (addl_args,
23115 build_tree_list (NULL_TREE, arg));
23117 token = cp_lexer_peek_token (parser->lexer);
23120 if (sel_args == NULL_TREE && addl_args == NULL_TREE)
23122 cp_parser_error (parser, "objective-c++ message argument(s) are expected");
23123 return build_tree_list (error_mark_node, error_mark_node);
23126 return build_tree_list (sel_args, addl_args);
23129 /* Parse an Objective-C encode expression.
23131 objc-encode-expression:
23132 @encode objc-typename
23134 Returns an encoded representation of the type argument. */
23137 cp_parser_objc_encode_expression (cp_parser* parser)
23142 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
23143 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23144 token = cp_lexer_peek_token (parser->lexer);
23145 type = complete_type (cp_parser_type_id (parser));
23146 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23150 error_at (token->location,
23151 "%<@encode%> must specify a type as an argument");
23152 return error_mark_node;
23155 /* This happens if we find @encode(T) (where T is a template
23156 typename or something dependent on a template typename) when
23157 parsing a template. In that case, we can't compile it
23158 immediately, but we rather create an AT_ENCODE_EXPR which will
23159 need to be instantiated when the template is used.
23161 if (dependent_type_p (type))
23163 tree value = build_min (AT_ENCODE_EXPR, size_type_node, type);
23164 TREE_READONLY (value) = 1;
23168 return objc_build_encode_expr (type);
23171 /* Parse an Objective-C @defs expression. */
23174 cp_parser_objc_defs_expression (cp_parser *parser)
23178 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
23179 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23180 name = cp_parser_identifier (parser);
23181 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23183 return objc_get_class_ivars (name);
23186 /* Parse an Objective-C protocol expression.
23188 objc-protocol-expression:
23189 @protocol ( identifier )
23191 Returns a representation of the protocol expression. */
23194 cp_parser_objc_protocol_expression (cp_parser* parser)
23198 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
23199 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23200 proto = cp_parser_identifier (parser);
23201 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23203 return objc_build_protocol_expr (proto);
23206 /* Parse an Objective-C selector expression.
23208 objc-selector-expression:
23209 @selector ( objc-method-signature )
23211 objc-method-signature:
23217 objc-selector-seq objc-selector :
23219 Returns a representation of the method selector. */
23222 cp_parser_objc_selector_expression (cp_parser* parser)
23224 tree sel_seq = NULL_TREE;
23225 bool maybe_unary_selector_p = true;
23227 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
23229 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
23230 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
23231 token = cp_lexer_peek_token (parser->lexer);
23233 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
23234 || token->type == CPP_SCOPE)
23236 tree selector = NULL_TREE;
23238 if (token->type != CPP_COLON
23239 || token->type == CPP_SCOPE)
23240 selector = cp_parser_objc_selector (parser);
23242 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
23243 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
23245 /* Detect if we have a unary selector. */
23246 if (maybe_unary_selector_p)
23248 sel_seq = selector;
23249 goto finish_selector;
23253 cp_parser_error (parser, "expected %<:%>");
23256 maybe_unary_selector_p = false;
23257 token = cp_lexer_consume_token (parser->lexer);
23259 if (token->type == CPP_SCOPE)
23262 = chainon (sel_seq,
23263 build_tree_list (selector, NULL_TREE));
23265 = chainon (sel_seq,
23266 build_tree_list (NULL_TREE, NULL_TREE));
23270 = chainon (sel_seq,
23271 build_tree_list (selector, NULL_TREE));
23273 token = cp_lexer_peek_token (parser->lexer);
23277 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23279 return objc_build_selector_expr (loc, sel_seq);
23282 /* Parse a list of identifiers.
23284 objc-identifier-list:
23286 objc-identifier-list , identifier
23288 Returns a TREE_LIST of identifier nodes. */
23291 cp_parser_objc_identifier_list (cp_parser* parser)
23297 identifier = cp_parser_identifier (parser);
23298 if (identifier == error_mark_node)
23299 return error_mark_node;
23301 list = build_tree_list (NULL_TREE, identifier);
23302 sep = cp_lexer_peek_token (parser->lexer);
23304 while (sep->type == CPP_COMMA)
23306 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
23307 identifier = cp_parser_identifier (parser);
23308 if (identifier == error_mark_node)
23311 list = chainon (list, build_tree_list (NULL_TREE,
23313 sep = cp_lexer_peek_token (parser->lexer);
23319 /* Parse an Objective-C alias declaration.
23321 objc-alias-declaration:
23322 @compatibility_alias identifier identifier ;
23324 This function registers the alias mapping with the Objective-C front end.
23325 It returns nothing. */
23328 cp_parser_objc_alias_declaration (cp_parser* parser)
23332 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
23333 alias = cp_parser_identifier (parser);
23334 orig = cp_parser_identifier (parser);
23335 objc_declare_alias (alias, orig);
23336 cp_parser_consume_semicolon_at_end_of_statement (parser);
23339 /* Parse an Objective-C class forward-declaration.
23341 objc-class-declaration:
23342 @class objc-identifier-list ;
23344 The function registers the forward declarations with the Objective-C
23345 front end. It returns nothing. */
23348 cp_parser_objc_class_declaration (cp_parser* parser)
23350 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
23355 id = cp_parser_identifier (parser);
23356 if (id == error_mark_node)
23359 objc_declare_class (id);
23361 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
23362 cp_lexer_consume_token (parser->lexer);
23366 cp_parser_consume_semicolon_at_end_of_statement (parser);
23369 /* Parse a list of Objective-C protocol references.
23371 objc-protocol-refs-opt:
23372 objc-protocol-refs [opt]
23374 objc-protocol-refs:
23375 < objc-identifier-list >
23377 Returns a TREE_LIST of identifiers, if any. */
23380 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
23382 tree protorefs = NULL_TREE;
23384 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
23386 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
23387 protorefs = cp_parser_objc_identifier_list (parser);
23388 cp_parser_require (parser, CPP_GREATER, RT_GREATER);
23394 /* Parse a Objective-C visibility specification. */
23397 cp_parser_objc_visibility_spec (cp_parser* parser)
23399 cp_token *vis = cp_lexer_peek_token (parser->lexer);
23401 switch (vis->keyword)
23403 case RID_AT_PRIVATE:
23404 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE);
23406 case RID_AT_PROTECTED:
23407 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED);
23409 case RID_AT_PUBLIC:
23410 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC);
23412 case RID_AT_PACKAGE:
23413 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE);
23419 /* Eat '@private'/'@protected'/'@public'. */
23420 cp_lexer_consume_token (parser->lexer);
23423 /* Parse an Objective-C method type. Return 'true' if it is a class
23424 (+) method, and 'false' if it is an instance (-) method. */
23427 cp_parser_objc_method_type (cp_parser* parser)
23429 if (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS)
23435 /* Parse an Objective-C protocol qualifier. */
23438 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
23440 tree quals = NULL_TREE, node;
23441 cp_token *token = cp_lexer_peek_token (parser->lexer);
23443 node = token->u.value;
23445 while (node && TREE_CODE (node) == IDENTIFIER_NODE
23446 && (node == ridpointers [(int) RID_IN]
23447 || node == ridpointers [(int) RID_OUT]
23448 || node == ridpointers [(int) RID_INOUT]
23449 || node == ridpointers [(int) RID_BYCOPY]
23450 || node == ridpointers [(int) RID_BYREF]
23451 || node == ridpointers [(int) RID_ONEWAY]))
23453 quals = tree_cons (NULL_TREE, node, quals);
23454 cp_lexer_consume_token (parser->lexer);
23455 token = cp_lexer_peek_token (parser->lexer);
23456 node = token->u.value;
23462 /* Parse an Objective-C typename. */
23465 cp_parser_objc_typename (cp_parser* parser)
23467 tree type_name = NULL_TREE;
23469 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
23471 tree proto_quals, cp_type = NULL_TREE;
23473 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
23474 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
23476 /* An ObjC type name may consist of just protocol qualifiers, in which
23477 case the type shall default to 'id'. */
23478 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
23480 cp_type = cp_parser_type_id (parser);
23482 /* If the type could not be parsed, an error has already
23483 been produced. For error recovery, behave as if it had
23484 not been specified, which will use the default type
23486 if (cp_type == error_mark_node)
23488 cp_type = NULL_TREE;
23489 /* We need to skip to the closing parenthesis as
23490 cp_parser_type_id() does not seem to do it for
23492 cp_parser_skip_to_closing_parenthesis (parser,
23493 /*recovering=*/true,
23494 /*or_comma=*/false,
23495 /*consume_paren=*/false);
23499 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
23500 type_name = build_tree_list (proto_quals, cp_type);
23506 /* Check to see if TYPE refers to an Objective-C selector name. */
23509 cp_parser_objc_selector_p (enum cpp_ttype type)
23511 return (type == CPP_NAME || type == CPP_KEYWORD
23512 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
23513 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
23514 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
23515 || type == CPP_XOR || type == CPP_XOR_EQ);
23518 /* Parse an Objective-C selector. */
23521 cp_parser_objc_selector (cp_parser* parser)
23523 cp_token *token = cp_lexer_consume_token (parser->lexer);
23525 if (!cp_parser_objc_selector_p (token->type))
23527 error_at (token->location, "invalid Objective-C++ selector name");
23528 return error_mark_node;
23531 /* C++ operator names are allowed to appear in ObjC selectors. */
23532 switch (token->type)
23534 case CPP_AND_AND: return get_identifier ("and");
23535 case CPP_AND_EQ: return get_identifier ("and_eq");
23536 case CPP_AND: return get_identifier ("bitand");
23537 case CPP_OR: return get_identifier ("bitor");
23538 case CPP_COMPL: return get_identifier ("compl");
23539 case CPP_NOT: return get_identifier ("not");
23540 case CPP_NOT_EQ: return get_identifier ("not_eq");
23541 case CPP_OR_OR: return get_identifier ("or");
23542 case CPP_OR_EQ: return get_identifier ("or_eq");
23543 case CPP_XOR: return get_identifier ("xor");
23544 case CPP_XOR_EQ: return get_identifier ("xor_eq");
23545 default: return token->u.value;
23549 /* Parse an Objective-C params list. */
23552 cp_parser_objc_method_keyword_params (cp_parser* parser, tree* attributes)
23554 tree params = NULL_TREE;
23555 bool maybe_unary_selector_p = true;
23556 cp_token *token = cp_lexer_peek_token (parser->lexer);
23558 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
23560 tree selector = NULL_TREE, type_name, identifier;
23561 tree parm_attr = NULL_TREE;
23563 if (token->keyword == RID_ATTRIBUTE)
23566 if (token->type != CPP_COLON)
23567 selector = cp_parser_objc_selector (parser);
23569 /* Detect if we have a unary selector. */
23570 if (maybe_unary_selector_p
23571 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
23573 params = selector; /* Might be followed by attributes. */
23577 maybe_unary_selector_p = false;
23578 if (!cp_parser_require (parser, CPP_COLON, RT_COLON))
23580 /* Something went quite wrong. There should be a colon
23581 here, but there is not. Stop parsing parameters. */
23584 type_name = cp_parser_objc_typename (parser);
23585 /* New ObjC allows attributes on parameters too. */
23586 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
23587 parm_attr = cp_parser_attributes_opt (parser);
23588 identifier = cp_parser_identifier (parser);
23592 objc_build_keyword_decl (selector,
23597 token = cp_lexer_peek_token (parser->lexer);
23600 if (params == NULL_TREE)
23602 cp_parser_error (parser, "objective-c++ method declaration is expected");
23603 return error_mark_node;
23606 /* We allow tail attributes for the method. */
23607 if (token->keyword == RID_ATTRIBUTE)
23609 *attributes = cp_parser_attributes_opt (parser);
23610 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
23611 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
23613 cp_parser_error (parser,
23614 "method attributes must be specified at the end");
23615 return error_mark_node;
23618 if (params == NULL_TREE)
23620 cp_parser_error (parser, "objective-c++ method declaration is expected");
23621 return error_mark_node;
23626 /* Parse the non-keyword Objective-C params. */
23629 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp,
23632 tree params = make_node (TREE_LIST);
23633 cp_token *token = cp_lexer_peek_token (parser->lexer);
23634 *ellipsisp = false; /* Initially, assume no ellipsis. */
23636 while (token->type == CPP_COMMA)
23638 cp_parameter_declarator *parmdecl;
23641 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
23642 token = cp_lexer_peek_token (parser->lexer);
23644 if (token->type == CPP_ELLIPSIS)
23646 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
23648 token = cp_lexer_peek_token (parser->lexer);
23652 /* TODO: parse attributes for tail parameters. */
23653 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
23654 parm = grokdeclarator (parmdecl->declarator,
23655 &parmdecl->decl_specifiers,
23656 PARM, /*initialized=*/0,
23657 /*attrlist=*/NULL);
23659 chainon (params, build_tree_list (NULL_TREE, parm));
23660 token = cp_lexer_peek_token (parser->lexer);
23663 /* We allow tail attributes for the method. */
23664 if (token->keyword == RID_ATTRIBUTE)
23666 if (*attributes == NULL_TREE)
23668 *attributes = cp_parser_attributes_opt (parser);
23669 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
23670 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
23674 /* We have an error, but parse the attributes, so that we can
23676 *attributes = cp_parser_attributes_opt (parser);
23678 cp_parser_error (parser,
23679 "method attributes must be specified at the end");
23680 return error_mark_node;
23686 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23689 cp_parser_objc_interstitial_code (cp_parser* parser)
23691 cp_token *token = cp_lexer_peek_token (parser->lexer);
23693 /* If the next token is `extern' and the following token is a string
23694 literal, then we have a linkage specification. */
23695 if (token->keyword == RID_EXTERN
23696 && cp_parser_is_pure_string_literal
23697 (cp_lexer_peek_nth_token (parser->lexer, 2)))
23698 cp_parser_linkage_specification (parser);
23699 /* Handle #pragma, if any. */
23700 else if (token->type == CPP_PRAGMA)
23701 cp_parser_pragma (parser, pragma_external);
23702 /* Allow stray semicolons. */
23703 else if (token->type == CPP_SEMICOLON)
23704 cp_lexer_consume_token (parser->lexer);
23705 /* Mark methods as optional or required, when building protocols. */
23706 else if (token->keyword == RID_AT_OPTIONAL)
23708 cp_lexer_consume_token (parser->lexer);
23709 objc_set_method_opt (true);
23711 else if (token->keyword == RID_AT_REQUIRED)
23713 cp_lexer_consume_token (parser->lexer);
23714 objc_set_method_opt (false);
23716 else if (token->keyword == RID_NAMESPACE)
23717 cp_parser_namespace_definition (parser);
23718 /* Other stray characters must generate errors. */
23719 else if (token->type == CPP_OPEN_BRACE || token->type == CPP_CLOSE_BRACE)
23721 cp_lexer_consume_token (parser->lexer);
23722 error ("stray %qs between Objective-C++ methods",
23723 token->type == CPP_OPEN_BRACE ? "{" : "}");
23725 /* Finally, try to parse a block-declaration, or a function-definition. */
23727 cp_parser_block_declaration (parser, /*statement_p=*/false);
23730 /* Parse a method signature. */
23733 cp_parser_objc_method_signature (cp_parser* parser, tree* attributes)
23735 tree rettype, kwdparms, optparms;
23736 bool ellipsis = false;
23737 bool is_class_method;
23739 is_class_method = cp_parser_objc_method_type (parser);
23740 rettype = cp_parser_objc_typename (parser);
23741 *attributes = NULL_TREE;
23742 kwdparms = cp_parser_objc_method_keyword_params (parser, attributes);
23743 if (kwdparms == error_mark_node)
23744 return error_mark_node;
23745 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis, attributes);
23746 if (optparms == error_mark_node)
23747 return error_mark_node;
23749 return objc_build_method_signature (is_class_method, rettype, kwdparms, optparms, ellipsis);
23753 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser* parser)
23756 cp_lexer_save_tokens (parser->lexer);
23757 tattr = cp_parser_attributes_opt (parser);
23758 gcc_assert (tattr) ;
23760 /* If the attributes are followed by a method introducer, this is not allowed.
23761 Dump the attributes and flag the situation. */
23762 if (cp_lexer_next_token_is (parser->lexer, CPP_PLUS)
23763 || cp_lexer_next_token_is (parser->lexer, CPP_MINUS))
23766 /* Otherwise, the attributes introduce some interstitial code, possibly so
23767 rewind to allow that check. */
23768 cp_lexer_rollback_tokens (parser->lexer);
23772 /* Parse an Objective-C method prototype list. */
23775 cp_parser_objc_method_prototype_list (cp_parser* parser)
23777 cp_token *token = cp_lexer_peek_token (parser->lexer);
23779 while (token->keyword != RID_AT_END && token->type != CPP_EOF)
23781 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
23783 tree attributes, sig;
23784 bool is_class_method;
23785 if (token->type == CPP_PLUS)
23786 is_class_method = true;
23788 is_class_method = false;
23789 sig = cp_parser_objc_method_signature (parser, &attributes);
23790 if (sig == error_mark_node)
23792 cp_parser_skip_to_end_of_block_or_statement (parser);
23793 token = cp_lexer_peek_token (parser->lexer);
23796 objc_add_method_declaration (is_class_method, sig, attributes);
23797 cp_parser_consume_semicolon_at_end_of_statement (parser);
23799 else if (token->keyword == RID_AT_PROPERTY)
23800 cp_parser_objc_at_property_declaration (parser);
23801 else if (token->keyword == RID_ATTRIBUTE
23802 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser))
23803 warning_at (cp_lexer_peek_token (parser->lexer)->location,
23805 "prefix attributes are ignored for methods");
23807 /* Allow for interspersed non-ObjC++ code. */
23808 cp_parser_objc_interstitial_code (parser);
23810 token = cp_lexer_peek_token (parser->lexer);
23813 if (token->type != CPP_EOF)
23814 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
23816 cp_parser_error (parser, "expected %<@end%>");
23818 objc_finish_interface ();
23821 /* Parse an Objective-C method definition list. */
23824 cp_parser_objc_method_definition_list (cp_parser* parser)
23826 cp_token *token = cp_lexer_peek_token (parser->lexer);
23828 while (token->keyword != RID_AT_END && token->type != CPP_EOF)
23832 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
23835 tree sig, attribute;
23836 bool is_class_method;
23837 if (token->type == CPP_PLUS)
23838 is_class_method = true;
23840 is_class_method = false;
23841 push_deferring_access_checks (dk_deferred);
23842 sig = cp_parser_objc_method_signature (parser, &attribute);
23843 if (sig == error_mark_node)
23845 cp_parser_skip_to_end_of_block_or_statement (parser);
23846 token = cp_lexer_peek_token (parser->lexer);
23849 objc_start_method_definition (is_class_method, sig, attribute,
23852 /* For historical reasons, we accept an optional semicolon. */
23853 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
23854 cp_lexer_consume_token (parser->lexer);
23856 ptk = cp_lexer_peek_token (parser->lexer);
23857 if (!(ptk->type == CPP_PLUS || ptk->type == CPP_MINUS
23858 || ptk->type == CPP_EOF || ptk->keyword == RID_AT_END))
23860 perform_deferred_access_checks ();
23861 stop_deferring_access_checks ();
23862 meth = cp_parser_function_definition_after_declarator (parser,
23864 pop_deferring_access_checks ();
23865 objc_finish_method_definition (meth);
23868 /* The following case will be removed once @synthesize is
23869 completely implemented. */
23870 else if (token->keyword == RID_AT_PROPERTY)
23871 cp_parser_objc_at_property_declaration (parser);
23872 else if (token->keyword == RID_AT_SYNTHESIZE)
23873 cp_parser_objc_at_synthesize_declaration (parser);
23874 else if (token->keyword == RID_AT_DYNAMIC)
23875 cp_parser_objc_at_dynamic_declaration (parser);
23876 else if (token->keyword == RID_ATTRIBUTE
23877 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser))
23878 warning_at (token->location, OPT_Wattributes,
23879 "prefix attributes are ignored for methods");
23881 /* Allow for interspersed non-ObjC++ code. */
23882 cp_parser_objc_interstitial_code (parser);
23884 token = cp_lexer_peek_token (parser->lexer);
23887 if (token->type != CPP_EOF)
23888 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
23890 cp_parser_error (parser, "expected %<@end%>");
23892 objc_finish_implementation ();
23895 /* Parse Objective-C ivars. */
23898 cp_parser_objc_class_ivars (cp_parser* parser)
23900 cp_token *token = cp_lexer_peek_token (parser->lexer);
23902 if (token->type != CPP_OPEN_BRACE)
23903 return; /* No ivars specified. */
23905 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
23906 token = cp_lexer_peek_token (parser->lexer);
23908 while (token->type != CPP_CLOSE_BRACE
23909 && token->keyword != RID_AT_END && token->type != CPP_EOF)
23911 cp_decl_specifier_seq declspecs;
23912 int decl_class_or_enum_p;
23913 tree prefix_attributes;
23915 cp_parser_objc_visibility_spec (parser);
23917 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
23920 cp_parser_decl_specifier_seq (parser,
23921 CP_PARSER_FLAGS_OPTIONAL,
23923 &decl_class_or_enum_p);
23925 /* auto, register, static, extern, mutable. */
23926 if (declspecs.storage_class != sc_none)
23928 cp_parser_error (parser, "invalid type for instance variable");
23929 declspecs.storage_class = sc_none;
23933 if (declspecs.specs[(int) ds_thread])
23935 cp_parser_error (parser, "invalid type for instance variable");
23936 declspecs.specs[(int) ds_thread] = 0;
23940 if (declspecs.specs[(int) ds_typedef])
23942 cp_parser_error (parser, "invalid type for instance variable");
23943 declspecs.specs[(int) ds_typedef] = 0;
23946 prefix_attributes = declspecs.attributes;
23947 declspecs.attributes = NULL_TREE;
23949 /* Keep going until we hit the `;' at the end of the
23951 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
23953 tree width = NULL_TREE, attributes, first_attribute, decl;
23954 cp_declarator *declarator = NULL;
23955 int ctor_dtor_or_conv_p;
23957 /* Check for a (possibly unnamed) bitfield declaration. */
23958 token = cp_lexer_peek_token (parser->lexer);
23959 if (token->type == CPP_COLON)
23962 if (token->type == CPP_NAME
23963 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
23966 /* Get the name of the bitfield. */
23967 declarator = make_id_declarator (NULL_TREE,
23968 cp_parser_identifier (parser),
23972 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
23973 /* Get the width of the bitfield. */
23975 = cp_parser_constant_expression (parser,
23976 /*allow_non_constant=*/false,
23981 /* Parse the declarator. */
23983 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
23984 &ctor_dtor_or_conv_p,
23985 /*parenthesized_p=*/NULL,
23986 /*member_p=*/false);
23989 /* Look for attributes that apply to the ivar. */
23990 attributes = cp_parser_attributes_opt (parser);
23991 /* Remember which attributes are prefix attributes and
23993 first_attribute = attributes;
23994 /* Combine the attributes. */
23995 attributes = chainon (prefix_attributes, attributes);
23998 /* Create the bitfield declaration. */
23999 decl = grokbitfield (declarator, &declspecs,
24003 decl = grokfield (declarator, &declspecs,
24004 NULL_TREE, /*init_const_expr_p=*/false,
24005 NULL_TREE, attributes);
24007 /* Add the instance variable. */
24008 if (decl != error_mark_node && decl != NULL_TREE)
24009 objc_add_instance_variable (decl);
24011 /* Reset PREFIX_ATTRIBUTES. */
24012 while (attributes && TREE_CHAIN (attributes) != first_attribute)
24013 attributes = TREE_CHAIN (attributes);
24015 TREE_CHAIN (attributes) = NULL_TREE;
24017 token = cp_lexer_peek_token (parser->lexer);
24019 if (token->type == CPP_COMMA)
24021 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
24027 cp_parser_consume_semicolon_at_end_of_statement (parser);
24028 token = cp_lexer_peek_token (parser->lexer);
24031 if (token->keyword == RID_AT_END)
24032 cp_parser_error (parser, "expected %<}%>");
24034 /* Do not consume the RID_AT_END, so it will be read again as terminating
24035 the @interface of @implementation. */
24036 if (token->keyword != RID_AT_END && token->type != CPP_EOF)
24037 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
24039 /* For historical reasons, we accept an optional semicolon. */
24040 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
24041 cp_lexer_consume_token (parser->lexer);
24044 /* Parse an Objective-C protocol declaration. */
24047 cp_parser_objc_protocol_declaration (cp_parser* parser, tree attributes)
24049 tree proto, protorefs;
24052 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
24053 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
24055 tok = cp_lexer_peek_token (parser->lexer);
24056 error_at (tok->location, "identifier expected after %<@protocol%>");
24057 cp_parser_consume_semicolon_at_end_of_statement (parser);
24061 /* See if we have a forward declaration or a definition. */
24062 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
24064 /* Try a forward declaration first. */
24065 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
24071 id = cp_parser_identifier (parser);
24072 if (id == error_mark_node)
24075 objc_declare_protocol (id, attributes);
24077 if(cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24078 cp_lexer_consume_token (parser->lexer);
24082 cp_parser_consume_semicolon_at_end_of_statement (parser);
24085 /* Ok, we got a full-fledged definition (or at least should). */
24088 proto = cp_parser_identifier (parser);
24089 protorefs = cp_parser_objc_protocol_refs_opt (parser);
24090 objc_start_protocol (proto, protorefs, attributes);
24091 cp_parser_objc_method_prototype_list (parser);
24095 /* Parse an Objective-C superclass or category. */
24098 cp_parser_objc_superclass_or_category (cp_parser *parser,
24101 tree *categ, bool *is_class_extension)
24103 cp_token *next = cp_lexer_peek_token (parser->lexer);
24105 *super = *categ = NULL_TREE;
24106 *is_class_extension = false;
24107 if (next->type == CPP_COLON)
24109 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
24110 *super = cp_parser_identifier (parser);
24112 else if (next->type == CPP_OPEN_PAREN)
24114 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
24116 /* If there is no category name, and this is an @interface, we
24117 have a class extension. */
24118 if (iface_p && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
24120 *categ = NULL_TREE;
24121 *is_class_extension = true;
24124 *categ = cp_parser_identifier (parser);
24126 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
24130 /* Parse an Objective-C class interface. */
24133 cp_parser_objc_class_interface (cp_parser* parser, tree attributes)
24135 tree name, super, categ, protos;
24136 bool is_class_extension;
24138 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
24139 name = cp_parser_identifier (parser);
24140 if (name == error_mark_node)
24142 /* It's hard to recover because even if valid @interface stuff
24143 is to follow, we can't compile it (or validate it) if we
24144 don't even know which class it refers to. Let's assume this
24145 was a stray '@interface' token in the stream and skip it.
24149 cp_parser_objc_superclass_or_category (parser, true, &super, &categ,
24150 &is_class_extension);
24151 protos = cp_parser_objc_protocol_refs_opt (parser);
24153 /* We have either a class or a category on our hands. */
24154 if (categ || is_class_extension)
24155 objc_start_category_interface (name, categ, protos, attributes);
24158 objc_start_class_interface (name, super, protos, attributes);
24159 /* Handle instance variable declarations, if any. */
24160 cp_parser_objc_class_ivars (parser);
24161 objc_continue_interface ();
24164 cp_parser_objc_method_prototype_list (parser);
24167 /* Parse an Objective-C class implementation. */
24170 cp_parser_objc_class_implementation (cp_parser* parser)
24172 tree name, super, categ;
24173 bool is_class_extension;
24175 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
24176 name = cp_parser_identifier (parser);
24177 if (name == error_mark_node)
24179 /* It's hard to recover because even if valid @implementation
24180 stuff is to follow, we can't compile it (or validate it) if
24181 we don't even know which class it refers to. Let's assume
24182 this was a stray '@implementation' token in the stream and
24187 cp_parser_objc_superclass_or_category (parser, false, &super, &categ,
24188 &is_class_extension);
24190 /* We have either a class or a category on our hands. */
24192 objc_start_category_implementation (name, categ);
24195 objc_start_class_implementation (name, super);
24196 /* Handle instance variable declarations, if any. */
24197 cp_parser_objc_class_ivars (parser);
24198 objc_continue_implementation ();
24201 cp_parser_objc_method_definition_list (parser);
24204 /* Consume the @end token and finish off the implementation. */
24207 cp_parser_objc_end_implementation (cp_parser* parser)
24209 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
24210 objc_finish_implementation ();
24213 /* Parse an Objective-C declaration. */
24216 cp_parser_objc_declaration (cp_parser* parser, tree attributes)
24218 /* Try to figure out what kind of declaration is present. */
24219 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
24222 switch (kwd->keyword)
24227 error_at (kwd->location, "attributes may not be specified before"
24228 " the %<@%D%> Objective-C++ keyword",
24232 case RID_AT_IMPLEMENTATION:
24233 warning_at (kwd->location, OPT_Wattributes,
24234 "prefix attributes are ignored before %<@%D%>",
24241 switch (kwd->keyword)
24244 cp_parser_objc_alias_declaration (parser);
24247 cp_parser_objc_class_declaration (parser);
24249 case RID_AT_PROTOCOL:
24250 cp_parser_objc_protocol_declaration (parser, attributes);
24252 case RID_AT_INTERFACE:
24253 cp_parser_objc_class_interface (parser, attributes);
24255 case RID_AT_IMPLEMENTATION:
24256 cp_parser_objc_class_implementation (parser);
24259 cp_parser_objc_end_implementation (parser);
24262 error_at (kwd->location, "misplaced %<@%D%> Objective-C++ construct",
24264 cp_parser_skip_to_end_of_block_or_statement (parser);
24268 /* Parse an Objective-C try-catch-finally statement.
24270 objc-try-catch-finally-stmt:
24271 @try compound-statement objc-catch-clause-seq [opt]
24272 objc-finally-clause [opt]
24274 objc-catch-clause-seq:
24275 objc-catch-clause objc-catch-clause-seq [opt]
24278 @catch ( objc-exception-declaration ) compound-statement
24280 objc-finally-clause:
24281 @finally compound-statement
24283 objc-exception-declaration:
24284 parameter-declaration
24287 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24291 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24292 for C. Keep them in sync. */
24295 cp_parser_objc_try_catch_finally_statement (cp_parser *parser)
24297 location_t location;
24300 cp_parser_require_keyword (parser, RID_AT_TRY, RT_AT_TRY);
24301 location = cp_lexer_peek_token (parser->lexer)->location;
24302 objc_maybe_warn_exceptions (location);
24303 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24304 node, lest it get absorbed into the surrounding block. */
24305 stmt = push_stmt_list ();
24306 cp_parser_compound_statement (parser, NULL, false, false);
24307 objc_begin_try_stmt (location, pop_stmt_list (stmt));
24309 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
24311 cp_parameter_declarator *parm;
24312 tree parameter_declaration = error_mark_node;
24313 bool seen_open_paren = false;
24315 cp_lexer_consume_token (parser->lexer);
24316 if (cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
24317 seen_open_paren = true;
24318 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
24320 /* We have "@catch (...)" (where the '...' are literally
24321 what is in the code). Skip the '...'.
24322 parameter_declaration is set to NULL_TREE, and
24323 objc_being_catch_clauses() knows that that means
24325 cp_lexer_consume_token (parser->lexer);
24326 parameter_declaration = NULL_TREE;
24330 /* We have "@catch (NSException *exception)" or something
24331 like that. Parse the parameter declaration. */
24332 parm = cp_parser_parameter_declaration (parser, false, NULL);
24334 parameter_declaration = error_mark_node;
24336 parameter_declaration = grokdeclarator (parm->declarator,
24337 &parm->decl_specifiers,
24338 PARM, /*initialized=*/0,
24339 /*attrlist=*/NULL);
24341 if (seen_open_paren)
24342 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
24345 /* If there was no open parenthesis, we are recovering from
24346 an error, and we are trying to figure out what mistake
24347 the user has made. */
24349 /* If there is an immediate closing parenthesis, the user
24350 probably forgot the opening one (ie, they typed "@catch
24351 NSException *e)". Parse the closing parenthesis and keep
24353 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
24354 cp_lexer_consume_token (parser->lexer);
24356 /* If these is no immediate closing parenthesis, the user
24357 probably doesn't know that parenthesis are required at
24358 all (ie, they typed "@catch NSException *e"). So, just
24359 forget about the closing parenthesis and keep going. */
24361 objc_begin_catch_clause (parameter_declaration);
24362 cp_parser_compound_statement (parser, NULL, false, false);
24363 objc_finish_catch_clause ();
24365 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
24367 cp_lexer_consume_token (parser->lexer);
24368 location = cp_lexer_peek_token (parser->lexer)->location;
24369 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24370 node, lest it get absorbed into the surrounding block. */
24371 stmt = push_stmt_list ();
24372 cp_parser_compound_statement (parser, NULL, false, false);
24373 objc_build_finally_clause (location, pop_stmt_list (stmt));
24376 return objc_finish_try_stmt ();
24379 /* Parse an Objective-C synchronized statement.
24381 objc-synchronized-stmt:
24382 @synchronized ( expression ) compound-statement
24384 Returns NULL_TREE. */
24387 cp_parser_objc_synchronized_statement (cp_parser *parser)
24389 location_t location;
24392 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, RT_AT_SYNCHRONIZED);
24394 location = cp_lexer_peek_token (parser->lexer)->location;
24395 objc_maybe_warn_exceptions (location);
24396 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
24397 lock = cp_parser_expression (parser, false, NULL);
24398 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
24400 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24401 node, lest it get absorbed into the surrounding block. */
24402 stmt = push_stmt_list ();
24403 cp_parser_compound_statement (parser, NULL, false, false);
24405 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
24408 /* Parse an Objective-C throw statement.
24411 @throw assignment-expression [opt] ;
24413 Returns a constructed '@throw' statement. */
24416 cp_parser_objc_throw_statement (cp_parser *parser)
24418 tree expr = NULL_TREE;
24419 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
24421 cp_parser_require_keyword (parser, RID_AT_THROW, RT_AT_THROW);
24423 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24424 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
24426 cp_parser_consume_semicolon_at_end_of_statement (parser);
24428 return objc_build_throw_stmt (loc, expr);
24431 /* Parse an Objective-C statement. */
24434 cp_parser_objc_statement (cp_parser * parser)
24436 /* Try to figure out what kind of declaration is present. */
24437 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
24439 switch (kwd->keyword)
24442 return cp_parser_objc_try_catch_finally_statement (parser);
24443 case RID_AT_SYNCHRONIZED:
24444 return cp_parser_objc_synchronized_statement (parser);
24446 return cp_parser_objc_throw_statement (parser);
24448 error_at (kwd->location, "misplaced %<@%D%> Objective-C++ construct",
24450 cp_parser_skip_to_end_of_block_or_statement (parser);
24453 return error_mark_node;
24456 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24457 look ahead to see if an objc keyword follows the attributes. This
24458 is to detect the use of prefix attributes on ObjC @interface and
24462 cp_parser_objc_valid_prefix_attributes (cp_parser* parser, tree *attrib)
24464 cp_lexer_save_tokens (parser->lexer);
24465 *attrib = cp_parser_attributes_opt (parser);
24466 gcc_assert (*attrib);
24467 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser->lexer)->keyword))
24469 cp_lexer_commit_tokens (parser->lexer);
24472 cp_lexer_rollback_tokens (parser->lexer);
24476 /* This routine is a minimal replacement for
24477 c_parser_struct_declaration () used when parsing the list of
24478 types/names or ObjC++ properties. For example, when parsing the
24481 @property (readonly) int a, b, c;
24483 this function is responsible for parsing "int a, int b, int c" and
24484 returning the declarations as CHAIN of DECLs.
24486 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24487 similar parsing. */
24489 cp_parser_objc_struct_declaration (cp_parser *parser)
24491 tree decls = NULL_TREE;
24492 cp_decl_specifier_seq declspecs;
24493 int decl_class_or_enum_p;
24494 tree prefix_attributes;
24496 cp_parser_decl_specifier_seq (parser,
24497 CP_PARSER_FLAGS_NONE,
24499 &decl_class_or_enum_p);
24501 if (declspecs.type == error_mark_node)
24502 return error_mark_node;
24504 /* auto, register, static, extern, mutable. */
24505 if (declspecs.storage_class != sc_none)
24507 cp_parser_error (parser, "invalid type for property");
24508 declspecs.storage_class = sc_none;
24512 if (declspecs.specs[(int) ds_thread])
24514 cp_parser_error (parser, "invalid type for property");
24515 declspecs.specs[(int) ds_thread] = 0;
24519 if (declspecs.specs[(int) ds_typedef])
24521 cp_parser_error (parser, "invalid type for property");
24522 declspecs.specs[(int) ds_typedef] = 0;
24525 prefix_attributes = declspecs.attributes;
24526 declspecs.attributes = NULL_TREE;
24528 /* Keep going until we hit the `;' at the end of the declaration. */
24529 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
24531 tree attributes, first_attribute, decl;
24532 cp_declarator *declarator;
24535 /* Parse the declarator. */
24536 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
24537 NULL, NULL, false);
24539 /* Look for attributes that apply to the ivar. */
24540 attributes = cp_parser_attributes_opt (parser);
24541 /* Remember which attributes are prefix attributes and
24543 first_attribute = attributes;
24544 /* Combine the attributes. */
24545 attributes = chainon (prefix_attributes, attributes);
24547 decl = grokfield (declarator, &declspecs,
24548 NULL_TREE, /*init_const_expr_p=*/false,
24549 NULL_TREE, attributes);
24551 if (decl == error_mark_node || decl == NULL_TREE)
24552 return error_mark_node;
24554 /* Reset PREFIX_ATTRIBUTES. */
24555 while (attributes && TREE_CHAIN (attributes) != first_attribute)
24556 attributes = TREE_CHAIN (attributes);
24558 TREE_CHAIN (attributes) = NULL_TREE;
24560 DECL_CHAIN (decl) = decls;
24563 token = cp_lexer_peek_token (parser->lexer);
24564 if (token->type == CPP_COMMA)
24566 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
24575 /* Parse an Objective-C @property declaration. The syntax is:
24577 objc-property-declaration:
24578 '@property' objc-property-attributes[opt] struct-declaration ;
24580 objc-property-attributes:
24581 '(' objc-property-attribute-list ')'
24583 objc-property-attribute-list:
24584 objc-property-attribute
24585 objc-property-attribute-list, objc-property-attribute
24587 objc-property-attribute
24588 'getter' = identifier
24589 'setter' = identifier
24598 @property NSString *name;
24599 @property (readonly) id object;
24600 @property (retain, nonatomic, getter=getTheName) id name;
24601 @property int a, b, c;
24603 PS: This function is identical to
24604 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24606 cp_parser_objc_at_property_declaration (cp_parser *parser)
24608 /* The following variables hold the attributes of the properties as
24609 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24610 seen. When we see an attribute, we set them to 'true' (if they
24611 are boolean properties) or to the identifier (if they have an
24612 argument, ie, for getter and setter). Note that here we only
24613 parse the list of attributes, check the syntax and accumulate the
24614 attributes that we find. objc_add_property_declaration() will
24615 then process the information. */
24616 bool property_assign = false;
24617 bool property_copy = false;
24618 tree property_getter_ident = NULL_TREE;
24619 bool property_nonatomic = false;
24620 bool property_readonly = false;
24621 bool property_readwrite = false;
24622 bool property_retain = false;
24623 tree property_setter_ident = NULL_TREE;
24625 /* 'properties' is the list of properties that we read. Usually a
24626 single one, but maybe more (eg, in "@property int a, b, c;" there
24631 loc = cp_lexer_peek_token (parser->lexer)->location;
24633 cp_lexer_consume_token (parser->lexer); /* Eat '@property'. */
24635 /* Parse the optional attribute list... */
24636 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
24639 cp_lexer_consume_token (parser->lexer);
24643 bool syntax_error = false;
24644 cp_token *token = cp_lexer_peek_token (parser->lexer);
24647 if (token->type != CPP_NAME)
24649 cp_parser_error (parser, "expected identifier");
24652 keyword = C_RID_CODE (token->u.value);
24653 cp_lexer_consume_token (parser->lexer);
24656 case RID_ASSIGN: property_assign = true; break;
24657 case RID_COPY: property_copy = true; break;
24658 case RID_NONATOMIC: property_nonatomic = true; break;
24659 case RID_READONLY: property_readonly = true; break;
24660 case RID_READWRITE: property_readwrite = true; break;
24661 case RID_RETAIN: property_retain = true; break;
24665 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
24667 if (keyword == RID_GETTER)
24668 cp_parser_error (parser,
24669 "missing %<=%> (after %<getter%> attribute)");
24671 cp_parser_error (parser,
24672 "missing %<=%> (after %<setter%> attribute)");
24673 syntax_error = true;
24676 cp_lexer_consume_token (parser->lexer); /* eat the = */
24677 if (!cp_parser_objc_selector_p (cp_lexer_peek_token (parser->lexer)->type))
24679 cp_parser_error (parser, "expected identifier");
24680 syntax_error = true;
24683 if (keyword == RID_SETTER)
24685 if (property_setter_ident != NULL_TREE)
24687 cp_parser_error (parser, "the %<setter%> attribute may only be specified once");
24688 cp_lexer_consume_token (parser->lexer);
24691 property_setter_ident = cp_parser_objc_selector (parser);
24692 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
24693 cp_parser_error (parser, "setter name must terminate with %<:%>");
24695 cp_lexer_consume_token (parser->lexer);
24699 if (property_getter_ident != NULL_TREE)
24701 cp_parser_error (parser, "the %<getter%> attribute may only be specified once");
24702 cp_lexer_consume_token (parser->lexer);
24705 property_getter_ident = cp_parser_objc_selector (parser);
24709 cp_parser_error (parser, "unknown property attribute");
24710 syntax_error = true;
24717 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24718 cp_lexer_consume_token (parser->lexer);
24723 /* FIXME: "@property (setter, assign);" will generate a spurious
24724 "error: expected ‘)’ before ‘,’ token". This is because
24725 cp_parser_require, unlike the C counterpart, will produce an
24726 error even if we are in error recovery. */
24727 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
24729 cp_parser_skip_to_closing_parenthesis (parser,
24730 /*recovering=*/true,
24731 /*or_comma=*/false,
24732 /*consume_paren=*/true);
24736 /* ... and the property declaration(s). */
24737 properties = cp_parser_objc_struct_declaration (parser);
24739 if (properties == error_mark_node)
24741 cp_parser_skip_to_end_of_statement (parser);
24742 /* If the next token is now a `;', consume it. */
24743 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
24744 cp_lexer_consume_token (parser->lexer);
24748 if (properties == NULL_TREE)
24749 cp_parser_error (parser, "expected identifier");
24752 /* Comma-separated properties are chained together in
24753 reverse order; add them one by one. */
24754 properties = nreverse (properties);
24756 for (; properties; properties = TREE_CHAIN (properties))
24757 objc_add_property_declaration (loc, copy_node (properties),
24758 property_readonly, property_readwrite,
24759 property_assign, property_retain,
24760 property_copy, property_nonatomic,
24761 property_getter_ident, property_setter_ident);
24764 cp_parser_consume_semicolon_at_end_of_statement (parser);
24767 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24769 objc-synthesize-declaration:
24770 @synthesize objc-synthesize-identifier-list ;
24772 objc-synthesize-identifier-list:
24773 objc-synthesize-identifier
24774 objc-synthesize-identifier-list, objc-synthesize-identifier
24776 objc-synthesize-identifier
24778 identifier = identifier
24781 @synthesize MyProperty;
24782 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24784 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24785 for C. Keep them in sync.
24788 cp_parser_objc_at_synthesize_declaration (cp_parser *parser)
24790 tree list = NULL_TREE;
24792 loc = cp_lexer_peek_token (parser->lexer)->location;
24794 cp_lexer_consume_token (parser->lexer); /* Eat '@synthesize'. */
24797 tree property, ivar;
24798 property = cp_parser_identifier (parser);
24799 if (property == error_mark_node)
24801 cp_parser_consume_semicolon_at_end_of_statement (parser);
24804 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
24806 cp_lexer_consume_token (parser->lexer);
24807 ivar = cp_parser_identifier (parser);
24808 if (ivar == error_mark_node)
24810 cp_parser_consume_semicolon_at_end_of_statement (parser);
24816 list = chainon (list, build_tree_list (ivar, property));
24817 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24818 cp_lexer_consume_token (parser->lexer);
24822 cp_parser_consume_semicolon_at_end_of_statement (parser);
24823 objc_add_synthesize_declaration (loc, list);
24826 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24828 objc-dynamic-declaration:
24829 @dynamic identifier-list ;
24832 @dynamic MyProperty;
24833 @dynamic MyProperty, AnotherProperty;
24835 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24836 for C. Keep them in sync.
24839 cp_parser_objc_at_dynamic_declaration (cp_parser *parser)
24841 tree list = NULL_TREE;
24843 loc = cp_lexer_peek_token (parser->lexer)->location;
24845 cp_lexer_consume_token (parser->lexer); /* Eat '@dynamic'. */
24849 property = cp_parser_identifier (parser);
24850 if (property == error_mark_node)
24852 cp_parser_consume_semicolon_at_end_of_statement (parser);
24855 list = chainon (list, build_tree_list (NULL, property));
24856 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
24857 cp_lexer_consume_token (parser->lexer);
24861 cp_parser_consume_semicolon_at_end_of_statement (parser);
24862 objc_add_dynamic_declaration (loc, list);
24866 /* OpenMP 2.5 parsing routines. */
24868 /* Returns name of the next clause.
24869 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
24870 the token is not consumed. Otherwise appropriate pragma_omp_clause is
24871 returned and the token is consumed. */
24873 static pragma_omp_clause
24874 cp_parser_omp_clause_name (cp_parser *parser)
24876 pragma_omp_clause result = PRAGMA_OMP_CLAUSE_NONE;
24878 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_IF))
24879 result = PRAGMA_OMP_CLAUSE_IF;
24880 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_DEFAULT))
24881 result = PRAGMA_OMP_CLAUSE_DEFAULT;
24882 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_PRIVATE))
24883 result = PRAGMA_OMP_CLAUSE_PRIVATE;
24884 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
24886 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
24887 const char *p = IDENTIFIER_POINTER (id);
24892 if (!strcmp ("collapse", p))
24893 result = PRAGMA_OMP_CLAUSE_COLLAPSE;
24894 else if (!strcmp ("copyin", p))
24895 result = PRAGMA_OMP_CLAUSE_COPYIN;
24896 else if (!strcmp ("copyprivate", p))
24897 result = PRAGMA_OMP_CLAUSE_COPYPRIVATE;
24900 if (!strcmp ("final", p))
24901 result = PRAGMA_OMP_CLAUSE_FINAL;
24902 else if (!strcmp ("firstprivate", p))
24903 result = PRAGMA_OMP_CLAUSE_FIRSTPRIVATE;
24906 if (!strcmp ("lastprivate", p))
24907 result = PRAGMA_OMP_CLAUSE_LASTPRIVATE;
24910 if (!strcmp ("mergeable", p))
24911 result = PRAGMA_OMP_CLAUSE_MERGEABLE;
24914 if (!strcmp ("nowait", p))
24915 result = PRAGMA_OMP_CLAUSE_NOWAIT;
24916 else if (!strcmp ("num_threads", p))
24917 result = PRAGMA_OMP_CLAUSE_NUM_THREADS;
24920 if (!strcmp ("ordered", p))
24921 result = PRAGMA_OMP_CLAUSE_ORDERED;
24924 if (!strcmp ("reduction", p))
24925 result = PRAGMA_OMP_CLAUSE_REDUCTION;
24928 if (!strcmp ("schedule", p))
24929 result = PRAGMA_OMP_CLAUSE_SCHEDULE;
24930 else if (!strcmp ("shared", p))
24931 result = PRAGMA_OMP_CLAUSE_SHARED;
24934 if (!strcmp ("untied", p))
24935 result = PRAGMA_OMP_CLAUSE_UNTIED;
24940 if (result != PRAGMA_OMP_CLAUSE_NONE)
24941 cp_lexer_consume_token (parser->lexer);
24946 /* Validate that a clause of the given type does not already exist. */
24949 check_no_duplicate_clause (tree clauses, enum omp_clause_code code,
24950 const char *name, location_t location)
24954 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
24955 if (OMP_CLAUSE_CODE (c) == code)
24957 error_at (location, "too many %qs clauses", name);
24965 variable-list , identifier
24967 In addition, we match a closing parenthesis. An opening parenthesis
24968 will have been consumed by the caller.
24970 If KIND is nonzero, create the appropriate node and install the decl
24971 in OMP_CLAUSE_DECL and add the node to the head of the list.
24973 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
24974 return the list created. */
24977 cp_parser_omp_var_list_no_open (cp_parser *parser, enum omp_clause_code kind,
24985 token = cp_lexer_peek_token (parser->lexer);
24986 name = cp_parser_id_expression (parser, /*template_p=*/false,
24987 /*check_dependency_p=*/true,
24988 /*template_p=*/NULL,
24989 /*declarator_p=*/false,
24990 /*optional_p=*/false);
24991 if (name == error_mark_node)
24994 decl = cp_parser_lookup_name_simple (parser, name, token->location);
24995 if (decl == error_mark_node)
24996 cp_parser_name_lookup_error (parser, name, decl, NLE_NULL,
24998 else if (kind != 0)
25000 tree u = build_omp_clause (token->location, kind);
25001 OMP_CLAUSE_DECL (u) = decl;
25002 OMP_CLAUSE_CHAIN (u) = list;
25006 list = tree_cons (decl, NULL_TREE, list);
25009 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
25011 cp_lexer_consume_token (parser->lexer);
25014 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25018 /* Try to resync to an unnested comma. Copied from
25019 cp_parser_parenthesized_expression_list. */
25021 ending = cp_parser_skip_to_closing_parenthesis (parser,
25022 /*recovering=*/true,
25024 /*consume_paren=*/true);
25032 /* Similarly, but expect leading and trailing parenthesis. This is a very
25033 common case for omp clauses. */
25036 cp_parser_omp_var_list (cp_parser *parser, enum omp_clause_code kind, tree list)
25038 if (cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25039 return cp_parser_omp_var_list_no_open (parser, kind, list);
25044 collapse ( constant-expression ) */
25047 cp_parser_omp_clause_collapse (cp_parser *parser, tree list, location_t location)
25053 loc = cp_lexer_peek_token (parser->lexer)->location;
25054 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25057 num = cp_parser_constant_expression (parser, false, NULL);
25059 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25060 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25061 /*or_comma=*/false,
25062 /*consume_paren=*/true);
25064 if (num == error_mark_node)
25066 num = fold_non_dependent_expr (num);
25067 if (!INTEGRAL_TYPE_P (TREE_TYPE (num))
25068 || !host_integerp (num, 0)
25069 || (n = tree_low_cst (num, 0)) <= 0
25072 error_at (loc, "collapse argument needs positive constant integer expression");
25076 check_no_duplicate_clause (list, OMP_CLAUSE_COLLAPSE, "collapse", location);
25077 c = build_omp_clause (loc, OMP_CLAUSE_COLLAPSE);
25078 OMP_CLAUSE_CHAIN (c) = list;
25079 OMP_CLAUSE_COLLAPSE_EXPR (c) = num;
25085 default ( shared | none ) */
25088 cp_parser_omp_clause_default (cp_parser *parser, tree list, location_t location)
25090 enum omp_clause_default_kind kind = OMP_CLAUSE_DEFAULT_UNSPECIFIED;
25093 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25095 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
25097 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25098 const char *p = IDENTIFIER_POINTER (id);
25103 if (strcmp ("none", p) != 0)
25105 kind = OMP_CLAUSE_DEFAULT_NONE;
25109 if (strcmp ("shared", p) != 0)
25111 kind = OMP_CLAUSE_DEFAULT_SHARED;
25118 cp_lexer_consume_token (parser->lexer);
25123 cp_parser_error (parser, "expected %<none%> or %<shared%>");
25126 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25127 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25128 /*or_comma=*/false,
25129 /*consume_paren=*/true);
25131 if (kind == OMP_CLAUSE_DEFAULT_UNSPECIFIED)
25134 check_no_duplicate_clause (list, OMP_CLAUSE_DEFAULT, "default", location);
25135 c = build_omp_clause (location, OMP_CLAUSE_DEFAULT);
25136 OMP_CLAUSE_CHAIN (c) = list;
25137 OMP_CLAUSE_DEFAULT_KIND (c) = kind;
25143 final ( expression ) */
25146 cp_parser_omp_clause_final (cp_parser *parser, tree list, location_t location)
25150 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25153 t = cp_parser_condition (parser);
25155 if (t == error_mark_node
25156 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25157 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25158 /*or_comma=*/false,
25159 /*consume_paren=*/true);
25161 check_no_duplicate_clause (list, OMP_CLAUSE_FINAL, "final", location);
25163 c = build_omp_clause (location, OMP_CLAUSE_FINAL);
25164 OMP_CLAUSE_FINAL_EXPR (c) = t;
25165 OMP_CLAUSE_CHAIN (c) = list;
25171 if ( expression ) */
25174 cp_parser_omp_clause_if (cp_parser *parser, tree list, location_t location)
25178 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25181 t = cp_parser_condition (parser);
25183 if (t == error_mark_node
25184 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25185 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25186 /*or_comma=*/false,
25187 /*consume_paren=*/true);
25189 check_no_duplicate_clause (list, OMP_CLAUSE_IF, "if", location);
25191 c = build_omp_clause (location, OMP_CLAUSE_IF);
25192 OMP_CLAUSE_IF_EXPR (c) = t;
25193 OMP_CLAUSE_CHAIN (c) = list;
25202 cp_parser_omp_clause_mergeable (cp_parser *parser ATTRIBUTE_UNUSED,
25203 tree list, location_t location)
25207 check_no_duplicate_clause (list, OMP_CLAUSE_MERGEABLE, "mergeable",
25210 c = build_omp_clause (location, OMP_CLAUSE_MERGEABLE);
25211 OMP_CLAUSE_CHAIN (c) = list;
25219 cp_parser_omp_clause_nowait (cp_parser *parser ATTRIBUTE_UNUSED,
25220 tree list, location_t location)
25224 check_no_duplicate_clause (list, OMP_CLAUSE_NOWAIT, "nowait", location);
25226 c = build_omp_clause (location, OMP_CLAUSE_NOWAIT);
25227 OMP_CLAUSE_CHAIN (c) = list;
25232 num_threads ( expression ) */
25235 cp_parser_omp_clause_num_threads (cp_parser *parser, tree list,
25236 location_t location)
25240 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25243 t = cp_parser_expression (parser, false, NULL);
25245 if (t == error_mark_node
25246 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25247 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25248 /*or_comma=*/false,
25249 /*consume_paren=*/true);
25251 check_no_duplicate_clause (list, OMP_CLAUSE_NUM_THREADS,
25252 "num_threads", location);
25254 c = build_omp_clause (location, OMP_CLAUSE_NUM_THREADS);
25255 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
25256 OMP_CLAUSE_CHAIN (c) = list;
25265 cp_parser_omp_clause_ordered (cp_parser *parser ATTRIBUTE_UNUSED,
25266 tree list, location_t location)
25270 check_no_duplicate_clause (list, OMP_CLAUSE_ORDERED,
25271 "ordered", location);
25273 c = build_omp_clause (location, OMP_CLAUSE_ORDERED);
25274 OMP_CLAUSE_CHAIN (c) = list;
25279 reduction ( reduction-operator : variable-list )
25281 reduction-operator:
25282 One of: + * - & ^ | && ||
25286 reduction-operator:
25287 One of: + * - & ^ | && || min max */
25290 cp_parser_omp_clause_reduction (cp_parser *parser, tree list)
25292 enum tree_code code;
25295 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25298 switch (cp_lexer_peek_token (parser->lexer)->type)
25310 code = BIT_AND_EXPR;
25313 code = BIT_XOR_EXPR;
25316 code = BIT_IOR_EXPR;
25319 code = TRUTH_ANDIF_EXPR;
25322 code = TRUTH_ORIF_EXPR;
25326 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25327 const char *p = IDENTIFIER_POINTER (id);
25329 if (strcmp (p, "min") == 0)
25334 if (strcmp (p, "max") == 0)
25342 cp_parser_error (parser, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
25343 "%<|%>, %<&&%>, %<||%>, %<min%> or %<max%>");
25345 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25346 /*or_comma=*/false,
25347 /*consume_paren=*/true);
25350 cp_lexer_consume_token (parser->lexer);
25352 if (!cp_parser_require (parser, CPP_COLON, RT_COLON))
25355 nlist = cp_parser_omp_var_list_no_open (parser, OMP_CLAUSE_REDUCTION, list);
25356 for (c = nlist; c != list; c = OMP_CLAUSE_CHAIN (c))
25357 OMP_CLAUSE_REDUCTION_CODE (c) = code;
25363 schedule ( schedule-kind )
25364 schedule ( schedule-kind , expression )
25367 static | dynamic | guided | runtime | auto */
25370 cp_parser_omp_clause_schedule (cp_parser *parser, tree list, location_t location)
25374 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
25377 c = build_omp_clause (location, OMP_CLAUSE_SCHEDULE);
25379 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
25381 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25382 const char *p = IDENTIFIER_POINTER (id);
25387 if (strcmp ("dynamic", p) != 0)
25389 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_DYNAMIC;
25393 if (strcmp ("guided", p) != 0)
25395 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_GUIDED;
25399 if (strcmp ("runtime", p) != 0)
25401 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_RUNTIME;
25408 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_STATIC))
25409 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_STATIC;
25410 else if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AUTO))
25411 OMP_CLAUSE_SCHEDULE_KIND (c) = OMP_CLAUSE_SCHEDULE_AUTO;
25414 cp_lexer_consume_token (parser->lexer);
25416 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
25419 cp_lexer_consume_token (parser->lexer);
25421 token = cp_lexer_peek_token (parser->lexer);
25422 t = cp_parser_assignment_expression (parser, false, NULL);
25424 if (t == error_mark_node)
25426 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_RUNTIME)
25427 error_at (token->location, "schedule %<runtime%> does not take "
25428 "a %<chunk_size%> parameter");
25429 else if (OMP_CLAUSE_SCHEDULE_KIND (c) == OMP_CLAUSE_SCHEDULE_AUTO)
25430 error_at (token->location, "schedule %<auto%> does not take "
25431 "a %<chunk_size%> parameter");
25433 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
25435 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25438 else if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_COMMA_CLOSE_PAREN))
25441 check_no_duplicate_clause (list, OMP_CLAUSE_SCHEDULE, "schedule", location);
25442 OMP_CLAUSE_CHAIN (c) = list;
25446 cp_parser_error (parser, "invalid schedule kind");
25448 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
25449 /*or_comma=*/false,
25450 /*consume_paren=*/true);
25458 cp_parser_omp_clause_untied (cp_parser *parser ATTRIBUTE_UNUSED,
25459 tree list, location_t location)
25463 check_no_duplicate_clause (list, OMP_CLAUSE_UNTIED, "untied", location);
25465 c = build_omp_clause (location, OMP_CLAUSE_UNTIED);
25466 OMP_CLAUSE_CHAIN (c) = list;
25470 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25471 is a bitmask in MASK. Return the list of clauses found; the result
25472 of clause default goes in *pdefault. */
25475 cp_parser_omp_all_clauses (cp_parser *parser, unsigned int mask,
25476 const char *where, cp_token *pragma_tok)
25478 tree clauses = NULL;
25480 cp_token *token = NULL;
25482 while (cp_lexer_next_token_is_not (parser->lexer, CPP_PRAGMA_EOL))
25484 pragma_omp_clause c_kind;
25485 const char *c_name;
25486 tree prev = clauses;
25488 if (!first && cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
25489 cp_lexer_consume_token (parser->lexer);
25491 token = cp_lexer_peek_token (parser->lexer);
25492 c_kind = cp_parser_omp_clause_name (parser);
25497 case PRAGMA_OMP_CLAUSE_COLLAPSE:
25498 clauses = cp_parser_omp_clause_collapse (parser, clauses,
25500 c_name = "collapse";
25502 case PRAGMA_OMP_CLAUSE_COPYIN:
25503 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYIN, clauses);
25506 case PRAGMA_OMP_CLAUSE_COPYPRIVATE:
25507 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_COPYPRIVATE,
25509 c_name = "copyprivate";
25511 case PRAGMA_OMP_CLAUSE_DEFAULT:
25512 clauses = cp_parser_omp_clause_default (parser, clauses,
25514 c_name = "default";
25516 case PRAGMA_OMP_CLAUSE_FINAL:
25517 clauses = cp_parser_omp_clause_final (parser, clauses, token->location);
25520 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE:
25521 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_FIRSTPRIVATE,
25523 c_name = "firstprivate";
25525 case PRAGMA_OMP_CLAUSE_IF:
25526 clauses = cp_parser_omp_clause_if (parser, clauses, token->location);
25529 case PRAGMA_OMP_CLAUSE_LASTPRIVATE:
25530 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_LASTPRIVATE,
25532 c_name = "lastprivate";
25534 case PRAGMA_OMP_CLAUSE_MERGEABLE:
25535 clauses = cp_parser_omp_clause_mergeable (parser, clauses,
25537 c_name = "mergeable";
25539 case PRAGMA_OMP_CLAUSE_NOWAIT:
25540 clauses = cp_parser_omp_clause_nowait (parser, clauses, token->location);
25543 case PRAGMA_OMP_CLAUSE_NUM_THREADS:
25544 clauses = cp_parser_omp_clause_num_threads (parser, clauses,
25546 c_name = "num_threads";
25548 case PRAGMA_OMP_CLAUSE_ORDERED:
25549 clauses = cp_parser_omp_clause_ordered (parser, clauses,
25551 c_name = "ordered";
25553 case PRAGMA_OMP_CLAUSE_PRIVATE:
25554 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_PRIVATE,
25556 c_name = "private";
25558 case PRAGMA_OMP_CLAUSE_REDUCTION:
25559 clauses = cp_parser_omp_clause_reduction (parser, clauses);
25560 c_name = "reduction";
25562 case PRAGMA_OMP_CLAUSE_SCHEDULE:
25563 clauses = cp_parser_omp_clause_schedule (parser, clauses,
25565 c_name = "schedule";
25567 case PRAGMA_OMP_CLAUSE_SHARED:
25568 clauses = cp_parser_omp_var_list (parser, OMP_CLAUSE_SHARED,
25572 case PRAGMA_OMP_CLAUSE_UNTIED:
25573 clauses = cp_parser_omp_clause_untied (parser, clauses,
25578 cp_parser_error (parser, "expected %<#pragma omp%> clause");
25582 if (((mask >> c_kind) & 1) == 0)
25584 /* Remove the invalid clause(s) from the list to avoid
25585 confusing the rest of the compiler. */
25587 error_at (token->location, "%qs is not valid for %qs", c_name, where);
25591 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
25592 return finish_omp_clauses (clauses);
25599 In practice, we're also interested in adding the statement to an
25600 outer node. So it is convenient if we work around the fact that
25601 cp_parser_statement calls add_stmt. */
25604 cp_parser_begin_omp_structured_block (cp_parser *parser)
25606 unsigned save = parser->in_statement;
25608 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25609 This preserves the "not within loop or switch" style error messages
25610 for nonsense cases like
25616 if (parser->in_statement)
25617 parser->in_statement = IN_OMP_BLOCK;
25623 cp_parser_end_omp_structured_block (cp_parser *parser, unsigned save)
25625 parser->in_statement = save;
25629 cp_parser_omp_structured_block (cp_parser *parser)
25631 tree stmt = begin_omp_structured_block ();
25632 unsigned int save = cp_parser_begin_omp_structured_block (parser);
25634 cp_parser_statement (parser, NULL_TREE, false, NULL);
25636 cp_parser_end_omp_structured_block (parser, save);
25637 return finish_omp_structured_block (stmt);
25641 # pragma omp atomic new-line
25645 x binop= expr | x++ | ++x | x-- | --x
25647 +, *, -, /, &, ^, |, <<, >>
25649 where x is an lvalue expression with scalar type.
25652 # pragma omp atomic new-line
25655 # pragma omp atomic read new-line
25658 # pragma omp atomic write new-line
25661 # pragma omp atomic update new-line
25664 # pragma omp atomic capture new-line
25667 # pragma omp atomic capture new-line
25675 expression-stmt | x = x binop expr
25677 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25679 { v = x; update-stmt; } | { update-stmt; v = x; }
25681 where x and v are lvalue expressions with scalar type. */
25684 cp_parser_omp_atomic (cp_parser *parser, cp_token *pragma_tok)
25686 tree lhs = NULL_TREE, rhs = NULL_TREE, v = NULL_TREE, lhs1 = NULL_TREE;
25687 tree rhs1 = NULL_TREE, orig_lhs;
25688 enum tree_code code = OMP_ATOMIC, opcode = NOP_EXPR;
25689 bool structured_block = false;
25691 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
25693 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
25694 const char *p = IDENTIFIER_POINTER (id);
25696 if (!strcmp (p, "read"))
25697 code = OMP_ATOMIC_READ;
25698 else if (!strcmp (p, "write"))
25700 else if (!strcmp (p, "update"))
25702 else if (!strcmp (p, "capture"))
25703 code = OMP_ATOMIC_CAPTURE_NEW;
25707 cp_lexer_consume_token (parser->lexer);
25709 cp_parser_require_pragma_eol (parser, pragma_tok);
25713 case OMP_ATOMIC_READ:
25714 case NOP_EXPR: /* atomic write */
25715 v = cp_parser_unary_expression (parser, /*address_p=*/false,
25716 /*cast_p=*/false, NULL);
25717 if (v == error_mark_node)
25719 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
25721 if (code == NOP_EXPR)
25722 lhs = cp_parser_expression (parser, /*cast_p=*/false, NULL);
25724 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
25725 /*cast_p=*/false, NULL);
25726 if (lhs == error_mark_node)
25728 if (code == NOP_EXPR)
25730 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25738 case OMP_ATOMIC_CAPTURE_NEW:
25739 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
25741 cp_lexer_consume_token (parser->lexer);
25742 structured_block = true;
25746 v = cp_parser_unary_expression (parser, /*address_p=*/false,
25747 /*cast_p=*/false, NULL);
25748 if (v == error_mark_node)
25750 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
25758 lhs = cp_parser_unary_expression (parser, /*address_p=*/false,
25759 /*cast_p=*/false, NULL);
25761 switch (TREE_CODE (lhs))
25766 case POSTINCREMENT_EXPR:
25767 if (code == OMP_ATOMIC_CAPTURE_NEW && !structured_block)
25768 code = OMP_ATOMIC_CAPTURE_OLD;
25770 case PREINCREMENT_EXPR:
25771 lhs = TREE_OPERAND (lhs, 0);
25772 opcode = PLUS_EXPR;
25773 rhs = integer_one_node;
25776 case POSTDECREMENT_EXPR:
25777 if (code == OMP_ATOMIC_CAPTURE_NEW && !structured_block)
25778 code = OMP_ATOMIC_CAPTURE_OLD;
25780 case PREDECREMENT_EXPR:
25781 lhs = TREE_OPERAND (lhs, 0);
25782 opcode = MINUS_EXPR;
25783 rhs = integer_one_node;
25786 case COMPOUND_EXPR:
25787 if (TREE_CODE (TREE_OPERAND (lhs, 0)) == SAVE_EXPR
25788 && TREE_CODE (TREE_OPERAND (lhs, 1)) == COMPOUND_EXPR
25789 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs, 1), 0)) == MODIFY_EXPR
25790 && TREE_OPERAND (TREE_OPERAND (lhs, 1), 1) == TREE_OPERAND (lhs, 0)
25791 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
25792 (TREE_OPERAND (lhs, 1), 0), 0)))
25794 /* Undo effects of boolean_increment for post {in,de}crement. */
25795 lhs = TREE_OPERAND (TREE_OPERAND (lhs, 1), 0);
25798 if (TREE_CODE (lhs) == MODIFY_EXPR
25799 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs, 0))) == BOOLEAN_TYPE)
25801 /* Undo effects of boolean_increment. */
25802 if (integer_onep (TREE_OPERAND (lhs, 1)))
25804 /* This is pre or post increment. */
25805 rhs = TREE_OPERAND (lhs, 1);
25806 lhs = TREE_OPERAND (lhs, 0);
25808 if (code == OMP_ATOMIC_CAPTURE_NEW
25809 && !structured_block
25810 && TREE_CODE (orig_lhs) == COMPOUND_EXPR)
25811 code = OMP_ATOMIC_CAPTURE_OLD;
25817 switch (cp_lexer_peek_token (parser->lexer)->type)
25820 opcode = MULT_EXPR;
25823 opcode = TRUNC_DIV_EXPR;
25826 opcode = PLUS_EXPR;
25829 opcode = MINUS_EXPR;
25831 case CPP_LSHIFT_EQ:
25832 opcode = LSHIFT_EXPR;
25834 case CPP_RSHIFT_EQ:
25835 opcode = RSHIFT_EXPR;
25838 opcode = BIT_AND_EXPR;
25841 opcode = BIT_IOR_EXPR;
25844 opcode = BIT_XOR_EXPR;
25847 if (structured_block || code == OMP_ATOMIC)
25849 enum cp_parser_prec oprec;
25851 cp_lexer_consume_token (parser->lexer);
25852 rhs1 = cp_parser_unary_expression (parser, /*address_p=*/false,
25853 /*cast_p=*/false, NULL);
25854 if (rhs1 == error_mark_node)
25856 token = cp_lexer_peek_token (parser->lexer);
25857 switch (token->type)
25859 case CPP_SEMICOLON:
25860 if (code == OMP_ATOMIC_CAPTURE_NEW)
25862 code = OMP_ATOMIC_CAPTURE_OLD;
25867 cp_lexer_consume_token (parser->lexer);
25870 cp_parser_error (parser,
25871 "invalid form of %<#pragma omp atomic%>");
25874 opcode = MULT_EXPR;
25877 opcode = TRUNC_DIV_EXPR;
25880 opcode = PLUS_EXPR;
25883 opcode = MINUS_EXPR;
25886 opcode = LSHIFT_EXPR;
25889 opcode = RSHIFT_EXPR;
25892 opcode = BIT_AND_EXPR;
25895 opcode = BIT_IOR_EXPR;
25898 opcode = BIT_XOR_EXPR;
25901 cp_parser_error (parser,
25902 "invalid operator for %<#pragma omp atomic%>");
25905 oprec = TOKEN_PRECEDENCE (token);
25906 gcc_assert (oprec != PREC_NOT_OPERATOR);
25907 if (commutative_tree_code (opcode))
25908 oprec = (enum cp_parser_prec) (oprec - 1);
25909 cp_lexer_consume_token (parser->lexer);
25910 rhs = cp_parser_binary_expression (parser, false, false,
25912 if (rhs == error_mark_node)
25918 cp_parser_error (parser,
25919 "invalid operator for %<#pragma omp atomic%>");
25922 cp_lexer_consume_token (parser->lexer);
25924 rhs = cp_parser_expression (parser, false, NULL);
25925 if (rhs == error_mark_node)
25930 if (structured_block && code == OMP_ATOMIC_CAPTURE_NEW)
25932 if (!cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON))
25934 v = cp_parser_unary_expression (parser, /*address_p=*/false,
25935 /*cast_p=*/false, NULL);
25936 if (v == error_mark_node)
25938 if (!cp_parser_require (parser, CPP_EQ, RT_EQ))
25940 lhs1 = cp_parser_unary_expression (parser, /*address_p=*/false,
25941 /*cast_p=*/false, NULL);
25942 if (lhs1 == error_mark_node)
25945 if (structured_block)
25947 cp_parser_consume_semicolon_at_end_of_statement (parser);
25948 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
25951 finish_omp_atomic (code, opcode, lhs, rhs, v, lhs1, rhs1);
25952 if (!structured_block)
25953 cp_parser_consume_semicolon_at_end_of_statement (parser);
25957 cp_parser_skip_to_end_of_block_or_statement (parser);
25958 if (structured_block)
25960 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
25961 cp_lexer_consume_token (parser->lexer);
25962 else if (code == OMP_ATOMIC_CAPTURE_NEW)
25964 cp_parser_skip_to_end_of_block_or_statement (parser);
25965 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
25966 cp_lexer_consume_token (parser->lexer);
25973 # pragma omp barrier new-line */
25976 cp_parser_omp_barrier (cp_parser *parser, cp_token *pragma_tok)
25978 cp_parser_require_pragma_eol (parser, pragma_tok);
25979 finish_omp_barrier ();
25983 # pragma omp critical [(name)] new-line
25984 structured-block */
25987 cp_parser_omp_critical (cp_parser *parser, cp_token *pragma_tok)
25989 tree stmt, name = NULL;
25991 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
25993 cp_lexer_consume_token (parser->lexer);
25995 name = cp_parser_identifier (parser);
25997 if (name == error_mark_node
25998 || !cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
25999 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
26000 /*or_comma=*/false,
26001 /*consume_paren=*/true);
26002 if (name == error_mark_node)
26005 cp_parser_require_pragma_eol (parser, pragma_tok);
26007 stmt = cp_parser_omp_structured_block (parser);
26008 return c_finish_omp_critical (input_location, stmt, name);
26012 # pragma omp flush flush-vars[opt] new-line
26015 ( variable-list ) */
26018 cp_parser_omp_flush (cp_parser *parser, cp_token *pragma_tok)
26020 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
26021 (void) cp_parser_omp_var_list (parser, OMP_CLAUSE_ERROR, NULL);
26022 cp_parser_require_pragma_eol (parser, pragma_tok);
26024 finish_omp_flush ();
26027 /* Helper function, to parse omp for increment expression. */
26030 cp_parser_omp_for_cond (cp_parser *parser, tree decl)
26032 tree cond = cp_parser_binary_expression (parser, false, true,
26033 PREC_NOT_OPERATOR, NULL);
26034 if (cond == error_mark_node
26035 || cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
26037 cp_parser_skip_to_end_of_statement (parser);
26038 return error_mark_node;
26041 switch (TREE_CODE (cond))
26049 return error_mark_node;
26052 /* If decl is an iterator, preserve LHS and RHS of the relational
26053 expr until finish_omp_for. */
26055 && (type_dependent_expression_p (decl)
26056 || CLASS_TYPE_P (TREE_TYPE (decl))))
26059 return build_x_binary_op (TREE_CODE (cond),
26060 TREE_OPERAND (cond, 0), ERROR_MARK,
26061 TREE_OPERAND (cond, 1), ERROR_MARK,
26062 /*overload=*/NULL, tf_warning_or_error);
26065 /* Helper function, to parse omp for increment expression. */
26068 cp_parser_omp_for_incr (cp_parser *parser, tree decl)
26070 cp_token *token = cp_lexer_peek_token (parser->lexer);
26076 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
26078 op = (token->type == CPP_PLUS_PLUS
26079 ? PREINCREMENT_EXPR : PREDECREMENT_EXPR);
26080 cp_lexer_consume_token (parser->lexer);
26081 lhs = cp_parser_cast_expression (parser, false, false, NULL);
26083 return error_mark_node;
26084 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
26087 lhs = cp_parser_primary_expression (parser, false, false, false, &idk);
26089 return error_mark_node;
26091 token = cp_lexer_peek_token (parser->lexer);
26092 if (token->type == CPP_PLUS_PLUS || token->type == CPP_MINUS_MINUS)
26094 op = (token->type == CPP_PLUS_PLUS
26095 ? POSTINCREMENT_EXPR : POSTDECREMENT_EXPR);
26096 cp_lexer_consume_token (parser->lexer);
26097 return build2 (op, TREE_TYPE (decl), decl, NULL_TREE);
26100 op = cp_parser_assignment_operator_opt (parser);
26101 if (op == ERROR_MARK)
26102 return error_mark_node;
26104 if (op != NOP_EXPR)
26106 rhs = cp_parser_assignment_expression (parser, false, NULL);
26107 rhs = build2 (op, TREE_TYPE (decl), decl, rhs);
26108 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
26111 lhs = cp_parser_binary_expression (parser, false, false,
26112 PREC_ADDITIVE_EXPRESSION, NULL);
26113 token = cp_lexer_peek_token (parser->lexer);
26114 decl_first = lhs == decl;
26117 if (token->type != CPP_PLUS
26118 && token->type != CPP_MINUS)
26119 return error_mark_node;
26123 op = token->type == CPP_PLUS ? PLUS_EXPR : MINUS_EXPR;
26124 cp_lexer_consume_token (parser->lexer);
26125 rhs = cp_parser_binary_expression (parser, false, false,
26126 PREC_ADDITIVE_EXPRESSION, NULL);
26127 token = cp_lexer_peek_token (parser->lexer);
26128 if (token->type == CPP_PLUS || token->type == CPP_MINUS || decl_first)
26130 if (lhs == NULL_TREE)
26132 if (op == PLUS_EXPR)
26135 lhs = build_x_unary_op (NEGATE_EXPR, rhs, tf_warning_or_error);
26138 lhs = build_x_binary_op (op, lhs, ERROR_MARK, rhs, ERROR_MARK,
26139 NULL, tf_warning_or_error);
26142 while (token->type == CPP_PLUS || token->type == CPP_MINUS);
26146 if (rhs != decl || op == MINUS_EXPR)
26147 return error_mark_node;
26148 rhs = build2 (op, TREE_TYPE (decl), lhs, decl);
26151 rhs = build2 (PLUS_EXPR, TREE_TYPE (decl), decl, lhs);
26153 return build2 (MODIFY_EXPR, TREE_TYPE (decl), decl, rhs);
26156 /* Parse the restricted form of the for statement allowed by OpenMP. */
26159 cp_parser_omp_for_loop (cp_parser *parser, tree clauses, tree *par_clauses)
26161 tree init, cond, incr, body, decl, pre_body = NULL_TREE, ret;
26162 tree real_decl, initv, condv, incrv, declv;
26163 tree this_pre_body, cl;
26164 location_t loc_first;
26165 bool collapse_err = false;
26166 int i, collapse = 1, nbraces = 0;
26167 VEC(tree,gc) *for_block = make_tree_vector ();
26169 for (cl = clauses; cl; cl = OMP_CLAUSE_CHAIN (cl))
26170 if (OMP_CLAUSE_CODE (cl) == OMP_CLAUSE_COLLAPSE)
26171 collapse = tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl), 0);
26173 gcc_assert (collapse >= 1);
26175 declv = make_tree_vec (collapse);
26176 initv = make_tree_vec (collapse);
26177 condv = make_tree_vec (collapse);
26178 incrv = make_tree_vec (collapse);
26180 loc_first = cp_lexer_peek_token (parser->lexer)->location;
26182 for (i = 0; i < collapse; i++)
26184 int bracecount = 0;
26185 bool add_private_clause = false;
26188 if (!cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
26190 cp_parser_error (parser, "for statement expected");
26193 loc = cp_lexer_consume_token (parser->lexer)->location;
26195 if (!cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN))
26198 init = decl = real_decl = NULL;
26199 this_pre_body = push_stmt_list ();
26200 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
26202 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26206 integer-type var = lb
26207 random-access-iterator-type var = lb
26208 pointer-type var = lb
26210 cp_decl_specifier_seq type_specifiers;
26212 /* First, try to parse as an initialized declaration. See
26213 cp_parser_condition, from whence the bulk of this is copied. */
26215 cp_parser_parse_tentatively (parser);
26216 cp_parser_type_specifier_seq (parser, /*is_declaration=*/true,
26217 /*is_trailing_return=*/false,
26219 if (cp_parser_parse_definitely (parser))
26221 /* If parsing a type specifier seq succeeded, then this
26222 MUST be a initialized declaration. */
26223 tree asm_specification, attributes;
26224 cp_declarator *declarator;
26226 declarator = cp_parser_declarator (parser,
26227 CP_PARSER_DECLARATOR_NAMED,
26228 /*ctor_dtor_or_conv_p=*/NULL,
26229 /*parenthesized_p=*/NULL,
26230 /*member_p=*/false);
26231 attributes = cp_parser_attributes_opt (parser);
26232 asm_specification = cp_parser_asm_specification_opt (parser);
26234 if (declarator == cp_error_declarator)
26235 cp_parser_skip_to_end_of_statement (parser);
26239 tree pushed_scope, auto_node;
26241 decl = start_decl (declarator, &type_specifiers,
26242 SD_INITIALIZED, attributes,
26243 /*prefix_attributes=*/NULL_TREE,
26246 auto_node = type_uses_auto (TREE_TYPE (decl));
26247 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ))
26249 if (cp_lexer_next_token_is (parser->lexer,
26251 error ("parenthesized initialization is not allowed in "
26252 "OpenMP %<for%> loop");
26254 /* Trigger an error. */
26255 cp_parser_require (parser, CPP_EQ, RT_EQ);
26257 init = error_mark_node;
26258 cp_parser_skip_to_end_of_statement (parser);
26260 else if (CLASS_TYPE_P (TREE_TYPE (decl))
26261 || type_dependent_expression_p (decl)
26264 bool is_direct_init, is_non_constant_init;
26266 init = cp_parser_initializer (parser,
26268 &is_non_constant_init);
26273 = do_auto_deduction (TREE_TYPE (decl), init,
26276 if (!CLASS_TYPE_P (TREE_TYPE (decl))
26277 && !type_dependent_expression_p (decl))
26281 cp_finish_decl (decl, init, !is_non_constant_init,
26283 LOOKUP_ONLYCONVERTING);
26284 if (CLASS_TYPE_P (TREE_TYPE (decl)))
26286 VEC_safe_push (tree, gc, for_block, this_pre_body);
26290 init = pop_stmt_list (this_pre_body);
26291 this_pre_body = NULL_TREE;
26296 cp_lexer_consume_token (parser->lexer);
26297 init = cp_parser_assignment_expression (parser, false, NULL);
26300 if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
26301 init = error_mark_node;
26303 cp_finish_decl (decl, NULL_TREE,
26304 /*init_const_expr_p=*/false,
26306 LOOKUP_ONLYCONVERTING);
26310 pop_scope (pushed_scope);
26316 /* If parsing a type specifier sequence failed, then
26317 this MUST be a simple expression. */
26318 cp_parser_parse_tentatively (parser);
26319 decl = cp_parser_primary_expression (parser, false, false,
26321 if (!cp_parser_error_occurred (parser)
26324 && CLASS_TYPE_P (TREE_TYPE (decl)))
26328 cp_parser_parse_definitely (parser);
26329 cp_parser_require (parser, CPP_EQ, RT_EQ);
26330 rhs = cp_parser_assignment_expression (parser, false, NULL);
26331 finish_expr_stmt (build_x_modify_expr (decl, NOP_EXPR,
26333 tf_warning_or_error));
26334 add_private_clause = true;
26339 cp_parser_abort_tentative_parse (parser);
26340 init = cp_parser_expression (parser, false, NULL);
26343 if (TREE_CODE (init) == MODIFY_EXPR
26344 || TREE_CODE (init) == MODOP_EXPR)
26345 real_decl = TREE_OPERAND (init, 0);
26350 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
26353 this_pre_body = pop_stmt_list (this_pre_body);
26357 pre_body = push_stmt_list ();
26359 add_stmt (this_pre_body);
26360 pre_body = pop_stmt_list (pre_body);
26363 pre_body = this_pre_body;
26368 if (par_clauses != NULL && real_decl != NULL_TREE)
26371 for (c = par_clauses; *c ; )
26372 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_FIRSTPRIVATE
26373 && OMP_CLAUSE_DECL (*c) == real_decl)
26375 error_at (loc, "iteration variable %qD"
26376 " should not be firstprivate", real_decl);
26377 *c = OMP_CLAUSE_CHAIN (*c);
26379 else if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_LASTPRIVATE
26380 && OMP_CLAUSE_DECL (*c) == real_decl)
26382 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26383 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26384 tree l = build_omp_clause (loc, OMP_CLAUSE_LASTPRIVATE);
26385 OMP_CLAUSE_DECL (l) = real_decl;
26386 OMP_CLAUSE_CHAIN (l) = clauses;
26387 CP_OMP_CLAUSE_INFO (l) = CP_OMP_CLAUSE_INFO (*c);
26389 OMP_CLAUSE_SET_CODE (*c, OMP_CLAUSE_SHARED);
26390 CP_OMP_CLAUSE_INFO (*c) = NULL;
26391 add_private_clause = false;
26395 if (OMP_CLAUSE_CODE (*c) == OMP_CLAUSE_PRIVATE
26396 && OMP_CLAUSE_DECL (*c) == real_decl)
26397 add_private_clause = false;
26398 c = &OMP_CLAUSE_CHAIN (*c);
26402 if (add_private_clause)
26405 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
26407 if ((OMP_CLAUSE_CODE (c) == OMP_CLAUSE_PRIVATE
26408 || OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE)
26409 && OMP_CLAUSE_DECL (c) == decl)
26411 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
26412 && OMP_CLAUSE_DECL (c) == decl)
26413 error_at (loc, "iteration variable %qD "
26414 "should not be firstprivate",
26416 else if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
26417 && OMP_CLAUSE_DECL (c) == decl)
26418 error_at (loc, "iteration variable %qD should not be reduction",
26423 c = build_omp_clause (loc, OMP_CLAUSE_PRIVATE);
26424 OMP_CLAUSE_DECL (c) = decl;
26425 c = finish_omp_clauses (c);
26428 OMP_CLAUSE_CHAIN (c) = clauses;
26435 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
26436 cond = cp_parser_omp_for_cond (parser, decl);
26437 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
26440 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
26442 /* If decl is an iterator, preserve the operator on decl
26443 until finish_omp_for. */
26445 && ((processing_template_decl
26446 && !POINTER_TYPE_P (TREE_TYPE (real_decl)))
26447 || CLASS_TYPE_P (TREE_TYPE (real_decl))))
26448 incr = cp_parser_omp_for_incr (parser, real_decl);
26450 incr = cp_parser_expression (parser, false, NULL);
26453 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN))
26454 cp_parser_skip_to_closing_parenthesis (parser, /*recovering=*/true,
26455 /*or_comma=*/false,
26456 /*consume_paren=*/true);
26458 TREE_VEC_ELT (declv, i) = decl;
26459 TREE_VEC_ELT (initv, i) = init;
26460 TREE_VEC_ELT (condv, i) = cond;
26461 TREE_VEC_ELT (incrv, i) = incr;
26463 if (i == collapse - 1)
26466 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26467 in between the collapsed for loops to be still considered perfectly
26468 nested. Hopefully the final version clarifies this.
26469 For now handle (multiple) {'s and empty statements. */
26470 cp_parser_parse_tentatively (parser);
26473 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
26475 else if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
26477 cp_lexer_consume_token (parser->lexer);
26480 else if (bracecount
26481 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
26482 cp_lexer_consume_token (parser->lexer);
26485 loc = cp_lexer_peek_token (parser->lexer)->location;
26486 error_at (loc, "not enough collapsed for loops");
26487 collapse_err = true;
26488 cp_parser_abort_tentative_parse (parser);
26497 cp_parser_parse_definitely (parser);
26498 nbraces += bracecount;
26502 /* Note that we saved the original contents of this flag when we entered
26503 the structured block, and so we don't need to re-save it here. */
26504 parser->in_statement = IN_OMP_FOR;
26506 /* Note that the grammar doesn't call for a structured block here,
26507 though the loop as a whole is a structured block. */
26508 body = push_stmt_list ();
26509 cp_parser_statement (parser, NULL_TREE, false, NULL);
26510 body = pop_stmt_list (body);
26512 if (declv == NULL_TREE)
26515 ret = finish_omp_for (loc_first, declv, initv, condv, incrv, body,
26516 pre_body, clauses);
26520 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
26522 cp_lexer_consume_token (parser->lexer);
26525 else if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
26526 cp_lexer_consume_token (parser->lexer);
26531 error_at (cp_lexer_peek_token (parser->lexer)->location,
26532 "collapsed loops not perfectly nested");
26534 collapse_err = true;
26535 cp_parser_statement_seq_opt (parser, NULL);
26536 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
26541 while (!VEC_empty (tree, for_block))
26542 add_stmt (pop_stmt_list (VEC_pop (tree, for_block)));
26543 release_tree_vector (for_block);
26549 #pragma omp for for-clause[optseq] new-line
26552 #define OMP_FOR_CLAUSE_MASK \
26553 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26554 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26555 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26556 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26557 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26558 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26559 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26560 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26563 cp_parser_omp_for (cp_parser *parser, cp_token *pragma_tok)
26565 tree clauses, sb, ret;
26568 clauses = cp_parser_omp_all_clauses (parser, OMP_FOR_CLAUSE_MASK,
26569 "#pragma omp for", pragma_tok);
26571 sb = begin_omp_structured_block ();
26572 save = cp_parser_begin_omp_structured_block (parser);
26574 ret = cp_parser_omp_for_loop (parser, clauses, NULL);
26576 cp_parser_end_omp_structured_block (parser, save);
26577 add_stmt (finish_omp_structured_block (sb));
26583 # pragma omp master new-line
26584 structured-block */
26587 cp_parser_omp_master (cp_parser *parser, cp_token *pragma_tok)
26589 cp_parser_require_pragma_eol (parser, pragma_tok);
26590 return c_finish_omp_master (input_location,
26591 cp_parser_omp_structured_block (parser));
26595 # pragma omp ordered new-line
26596 structured-block */
26599 cp_parser_omp_ordered (cp_parser *parser, cp_token *pragma_tok)
26601 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
26602 cp_parser_require_pragma_eol (parser, pragma_tok);
26603 return c_finish_omp_ordered (loc, cp_parser_omp_structured_block (parser));
26609 { section-sequence }
26612 section-directive[opt] structured-block
26613 section-sequence section-directive structured-block */
26616 cp_parser_omp_sections_scope (cp_parser *parser)
26618 tree stmt, substmt;
26619 bool error_suppress = false;
26622 if (!cp_parser_require (parser, CPP_OPEN_BRACE, RT_OPEN_BRACE))
26625 stmt = push_stmt_list ();
26627 if (cp_lexer_peek_token (parser->lexer)->pragma_kind != PRAGMA_OMP_SECTION)
26631 substmt = begin_omp_structured_block ();
26632 save = cp_parser_begin_omp_structured_block (parser);
26636 cp_parser_statement (parser, NULL_TREE, false, NULL);
26638 tok = cp_lexer_peek_token (parser->lexer);
26639 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
26641 if (tok->type == CPP_CLOSE_BRACE)
26643 if (tok->type == CPP_EOF)
26647 cp_parser_end_omp_structured_block (parser, save);
26648 substmt = finish_omp_structured_block (substmt);
26649 substmt = build1 (OMP_SECTION, void_type_node, substmt);
26650 add_stmt (substmt);
26655 tok = cp_lexer_peek_token (parser->lexer);
26656 if (tok->type == CPP_CLOSE_BRACE)
26658 if (tok->type == CPP_EOF)
26661 if (tok->pragma_kind == PRAGMA_OMP_SECTION)
26663 cp_lexer_consume_token (parser->lexer);
26664 cp_parser_require_pragma_eol (parser, tok);
26665 error_suppress = false;
26667 else if (!error_suppress)
26669 cp_parser_error (parser, "expected %<#pragma omp section%> or %<}%>");
26670 error_suppress = true;
26673 substmt = cp_parser_omp_structured_block (parser);
26674 substmt = build1 (OMP_SECTION, void_type_node, substmt);
26675 add_stmt (substmt);
26677 cp_parser_require (parser, CPP_CLOSE_BRACE, RT_CLOSE_BRACE);
26679 substmt = pop_stmt_list (stmt);
26681 stmt = make_node (OMP_SECTIONS);
26682 TREE_TYPE (stmt) = void_type_node;
26683 OMP_SECTIONS_BODY (stmt) = substmt;
26690 # pragma omp sections sections-clause[optseq] newline
26693 #define OMP_SECTIONS_CLAUSE_MASK \
26694 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26695 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26696 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26697 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26698 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26701 cp_parser_omp_sections (cp_parser *parser, cp_token *pragma_tok)
26705 clauses = cp_parser_omp_all_clauses (parser, OMP_SECTIONS_CLAUSE_MASK,
26706 "#pragma omp sections", pragma_tok);
26708 ret = cp_parser_omp_sections_scope (parser);
26710 OMP_SECTIONS_CLAUSES (ret) = clauses;
26716 # pragma parallel parallel-clause new-line
26717 # pragma parallel for parallel-for-clause new-line
26718 # pragma parallel sections parallel-sections-clause new-line */
26720 #define OMP_PARALLEL_CLAUSE_MASK \
26721 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26722 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26723 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26724 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26725 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26726 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26727 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26728 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26731 cp_parser_omp_parallel (cp_parser *parser, cp_token *pragma_tok)
26733 enum pragma_kind p_kind = PRAGMA_OMP_PARALLEL;
26734 const char *p_name = "#pragma omp parallel";
26735 tree stmt, clauses, par_clause, ws_clause, block;
26736 unsigned int mask = OMP_PARALLEL_CLAUSE_MASK;
26738 location_t loc = cp_lexer_peek_token (parser->lexer)->location;
26740 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_FOR))
26742 cp_lexer_consume_token (parser->lexer);
26743 p_kind = PRAGMA_OMP_PARALLEL_FOR;
26744 p_name = "#pragma omp parallel for";
26745 mask |= OMP_FOR_CLAUSE_MASK;
26746 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
26748 else if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
26750 tree id = cp_lexer_peek_token (parser->lexer)->u.value;
26751 const char *p = IDENTIFIER_POINTER (id);
26752 if (strcmp (p, "sections") == 0)
26754 cp_lexer_consume_token (parser->lexer);
26755 p_kind = PRAGMA_OMP_PARALLEL_SECTIONS;
26756 p_name = "#pragma omp parallel sections";
26757 mask |= OMP_SECTIONS_CLAUSE_MASK;
26758 mask &= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT);
26762 clauses = cp_parser_omp_all_clauses (parser, mask, p_name, pragma_tok);
26763 block = begin_omp_parallel ();
26764 save = cp_parser_begin_omp_structured_block (parser);
26768 case PRAGMA_OMP_PARALLEL:
26769 cp_parser_statement (parser, NULL_TREE, false, NULL);
26770 par_clause = clauses;
26773 case PRAGMA_OMP_PARALLEL_FOR:
26774 c_split_parallel_clauses (loc, clauses, &par_clause, &ws_clause);
26775 cp_parser_omp_for_loop (parser, ws_clause, &par_clause);
26778 case PRAGMA_OMP_PARALLEL_SECTIONS:
26779 c_split_parallel_clauses (loc, clauses, &par_clause, &ws_clause);
26780 stmt = cp_parser_omp_sections_scope (parser);
26782 OMP_SECTIONS_CLAUSES (stmt) = ws_clause;
26786 gcc_unreachable ();
26789 cp_parser_end_omp_structured_block (parser, save);
26790 stmt = finish_omp_parallel (par_clause, block);
26791 if (p_kind != PRAGMA_OMP_PARALLEL)
26792 OMP_PARALLEL_COMBINED (stmt) = 1;
26797 # pragma omp single single-clause[optseq] new-line
26798 structured-block */
26800 #define OMP_SINGLE_CLAUSE_MASK \
26801 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26802 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26803 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26804 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26807 cp_parser_omp_single (cp_parser *parser, cp_token *pragma_tok)
26809 tree stmt = make_node (OMP_SINGLE);
26810 TREE_TYPE (stmt) = void_type_node;
26812 OMP_SINGLE_CLAUSES (stmt)
26813 = cp_parser_omp_all_clauses (parser, OMP_SINGLE_CLAUSE_MASK,
26814 "#pragma omp single", pragma_tok);
26815 OMP_SINGLE_BODY (stmt) = cp_parser_omp_structured_block (parser);
26817 return add_stmt (stmt);
26821 # pragma omp task task-clause[optseq] new-line
26822 structured-block */
26824 #define OMP_TASK_CLAUSE_MASK \
26825 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26826 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26827 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26828 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26829 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26830 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26831 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26832 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26835 cp_parser_omp_task (cp_parser *parser, cp_token *pragma_tok)
26837 tree clauses, block;
26840 clauses = cp_parser_omp_all_clauses (parser, OMP_TASK_CLAUSE_MASK,
26841 "#pragma omp task", pragma_tok);
26842 block = begin_omp_task ();
26843 save = cp_parser_begin_omp_structured_block (parser);
26844 cp_parser_statement (parser, NULL_TREE, false, NULL);
26845 cp_parser_end_omp_structured_block (parser, save);
26846 return finish_omp_task (clauses, block);
26850 # pragma omp taskwait new-line */
26853 cp_parser_omp_taskwait (cp_parser *parser, cp_token *pragma_tok)
26855 cp_parser_require_pragma_eol (parser, pragma_tok);
26856 finish_omp_taskwait ();
26860 # pragma omp taskyield new-line */
26863 cp_parser_omp_taskyield (cp_parser *parser, cp_token *pragma_tok)
26865 cp_parser_require_pragma_eol (parser, pragma_tok);
26866 finish_omp_taskyield ();
26870 # pragma omp threadprivate (variable-list) */
26873 cp_parser_omp_threadprivate (cp_parser *parser, cp_token *pragma_tok)
26877 vars = cp_parser_omp_var_list (parser, OMP_CLAUSE_ERROR, NULL);
26878 cp_parser_require_pragma_eol (parser, pragma_tok);
26880 finish_omp_threadprivate (vars);
26883 /* Main entry point to OpenMP statement pragmas. */
26886 cp_parser_omp_construct (cp_parser *parser, cp_token *pragma_tok)
26890 switch (pragma_tok->pragma_kind)
26892 case PRAGMA_OMP_ATOMIC:
26893 cp_parser_omp_atomic (parser, pragma_tok);
26895 case PRAGMA_OMP_CRITICAL:
26896 stmt = cp_parser_omp_critical (parser, pragma_tok);
26898 case PRAGMA_OMP_FOR:
26899 stmt = cp_parser_omp_for (parser, pragma_tok);
26901 case PRAGMA_OMP_MASTER:
26902 stmt = cp_parser_omp_master (parser, pragma_tok);
26904 case PRAGMA_OMP_ORDERED:
26905 stmt = cp_parser_omp_ordered (parser, pragma_tok);
26907 case PRAGMA_OMP_PARALLEL:
26908 stmt = cp_parser_omp_parallel (parser, pragma_tok);
26910 case PRAGMA_OMP_SECTIONS:
26911 stmt = cp_parser_omp_sections (parser, pragma_tok);
26913 case PRAGMA_OMP_SINGLE:
26914 stmt = cp_parser_omp_single (parser, pragma_tok);
26916 case PRAGMA_OMP_TASK:
26917 stmt = cp_parser_omp_task (parser, pragma_tok);
26920 gcc_unreachable ();
26924 SET_EXPR_LOCATION (stmt, pragma_tok->location);
26927 /* Transactional Memory parsing routines. */
26929 /* Parse a transaction attribute.
26935 ??? Simplify this when C++0x bracket attributes are
26936 implemented properly. */
26939 cp_parser_txn_attribute_opt (cp_parser *parser)
26942 tree attr_name, attr = NULL;
26944 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
26945 return cp_parser_attributes_opt (parser);
26947 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
26949 cp_lexer_consume_token (parser->lexer);
26950 if (!cp_parser_require (parser, CPP_OPEN_SQUARE, RT_OPEN_SQUARE))
26953 token = cp_lexer_peek_token (parser->lexer);
26954 if (token->type == CPP_NAME || token->type == CPP_KEYWORD)
26956 token = cp_lexer_consume_token (parser->lexer);
26958 attr_name = (token->type == CPP_KEYWORD
26959 /* For keywords, use the canonical spelling,
26960 not the parsed identifier. */
26961 ? ridpointers[(int) token->keyword]
26963 attr = build_tree_list (attr_name, NULL_TREE);
26966 cp_parser_error (parser, "expected identifier");
26968 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
26970 cp_parser_require (parser, CPP_CLOSE_SQUARE, RT_CLOSE_SQUARE);
26974 /* Parse a __transaction_atomic or __transaction_relaxed statement.
26976 transaction-statement:
26977 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
26979 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
26983 cp_parser_transaction (cp_parser *parser, enum rid keyword)
26985 unsigned char old_in = parser->in_transaction;
26986 unsigned char this_in = 1, new_in;
26988 tree stmt, attrs, noex;
26990 gcc_assert (keyword == RID_TRANSACTION_ATOMIC
26991 || keyword == RID_TRANSACTION_RELAXED);
26992 token = cp_parser_require_keyword (parser, keyword,
26993 (keyword == RID_TRANSACTION_ATOMIC ? RT_TRANSACTION_ATOMIC
26994 : RT_TRANSACTION_RELAXED));
26995 gcc_assert (token != NULL);
26997 if (keyword == RID_TRANSACTION_RELAXED)
26998 this_in |= TM_STMT_ATTR_RELAXED;
27001 attrs = cp_parser_txn_attribute_opt (parser);
27003 this_in |= parse_tm_stmt_attr (attrs, TM_STMT_ATTR_OUTER);
27006 /* Parse a noexcept specification. */
27007 noex = cp_parser_noexcept_specification_opt (parser, true, NULL, true);
27009 /* Keep track if we're in the lexical scope of an outer transaction. */
27010 new_in = this_in | (old_in & TM_STMT_ATTR_OUTER);
27012 stmt = begin_transaction_stmt (token->location, NULL, this_in);
27014 parser->in_transaction = new_in;
27015 cp_parser_compound_statement (parser, NULL, false, false);
27016 parser->in_transaction = old_in;
27018 finish_transaction_stmt (stmt, NULL, this_in, noex);
27023 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27025 transaction-expression:
27026 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27027 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27031 cp_parser_transaction_expression (cp_parser *parser, enum rid keyword)
27033 unsigned char old_in = parser->in_transaction;
27034 unsigned char this_in = 1;
27039 gcc_assert (keyword == RID_TRANSACTION_ATOMIC
27040 || keyword == RID_TRANSACTION_RELAXED);
27043 error (keyword == RID_TRANSACTION_RELAXED
27044 ? G_("%<__transaction_relaxed%> without transactional memory "
27046 : G_("%<__transaction_atomic%> without transactional memory "
27047 "support enabled"));
27049 token = cp_parser_require_keyword (parser, keyword,
27050 (keyword == RID_TRANSACTION_ATOMIC ? RT_TRANSACTION_ATOMIC
27051 : RT_TRANSACTION_RELAXED));
27052 gcc_assert (token != NULL);
27054 if (keyword == RID_TRANSACTION_RELAXED)
27055 this_in |= TM_STMT_ATTR_RELAXED;
27057 /* Set this early. This might mean that we allow transaction_cancel in
27058 an expression that we find out later actually has to be a constexpr.
27059 However, we expect that cxx_constant_value will be able to deal with
27060 this; also, if the noexcept has no constexpr, then what we parse next
27061 really is a transaction's body. */
27062 parser->in_transaction = this_in;
27064 /* Parse a noexcept specification. */
27065 noex = cp_parser_noexcept_specification_opt (parser, false, &noex_expr,
27068 if (!noex || !noex_expr
27069 || cp_lexer_peek_token (parser->lexer)->type == CPP_OPEN_PAREN)
27071 cp_parser_require (parser, CPP_OPEN_PAREN, RT_OPEN_PAREN);
27073 expr = cp_parser_expression (parser, /*cast_p=*/false, NULL);
27074 finish_parenthesized_expr (expr);
27076 cp_parser_require (parser, CPP_CLOSE_PAREN, RT_CLOSE_PAREN);
27080 /* The only expression that is available got parsed for the noexcept
27081 already. noexcept is true then. */
27083 noex = boolean_true_node;
27086 expr = build_transaction_expr (token->location, expr, this_in, noex);
27087 parser->in_transaction = old_in;
27089 if (cp_parser_non_integral_constant_expression (parser, NIC_TRANSACTION))
27090 return error_mark_node;
27092 return (flag_tm ? expr : error_mark_node);
27095 /* Parse a function-transaction-block.
27097 function-transaction-block:
27098 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27100 __transaction_atomic txn-attribute[opt] function-try-block
27101 __transaction_relaxed ctor-initializer[opt] function-body
27102 __transaction_relaxed function-try-block
27106 cp_parser_function_transaction (cp_parser *parser, enum rid keyword)
27108 unsigned char old_in = parser->in_transaction;
27109 unsigned char new_in = 1;
27110 tree compound_stmt, stmt, attrs;
27111 bool ctor_initializer_p;
27114 gcc_assert (keyword == RID_TRANSACTION_ATOMIC
27115 || keyword == RID_TRANSACTION_RELAXED);
27116 token = cp_parser_require_keyword (parser, keyword,
27117 (keyword == RID_TRANSACTION_ATOMIC ? RT_TRANSACTION_ATOMIC
27118 : RT_TRANSACTION_RELAXED));
27119 gcc_assert (token != NULL);
27121 if (keyword == RID_TRANSACTION_RELAXED)
27122 new_in |= TM_STMT_ATTR_RELAXED;
27125 attrs = cp_parser_txn_attribute_opt (parser);
27127 new_in |= parse_tm_stmt_attr (attrs, TM_STMT_ATTR_OUTER);
27130 stmt = begin_transaction_stmt (token->location, &compound_stmt, new_in);
27132 parser->in_transaction = new_in;
27134 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
27135 ctor_initializer_p = cp_parser_function_try_block (parser);
27138 = cp_parser_ctor_initializer_opt_and_function_body (parser);
27140 parser->in_transaction = old_in;
27142 finish_transaction_stmt (stmt, compound_stmt, new_in, NULL_TREE);
27144 return ctor_initializer_p;
27147 /* Parse a __transaction_cancel statement.
27150 __transaction_cancel txn-attribute[opt] ;
27151 __transaction_cancel txn-attribute[opt] throw-expression ;
27153 ??? Cancel and throw is not yet implemented. */
27156 cp_parser_transaction_cancel (cp_parser *parser)
27159 bool is_outer = false;
27162 token = cp_parser_require_keyword (parser, RID_TRANSACTION_CANCEL,
27163 RT_TRANSACTION_CANCEL);
27164 gcc_assert (token != NULL);
27166 attrs = cp_parser_txn_attribute_opt (parser);
27168 is_outer = (parse_tm_stmt_attr (attrs, TM_STMT_ATTR_OUTER) != 0);
27170 /* ??? Parse cancel-and-throw here. */
27172 cp_parser_require (parser, CPP_SEMICOLON, RT_SEMICOLON);
27176 error_at (token->location, "%<__transaction_cancel%> without "
27177 "transactional memory support enabled");
27178 return error_mark_node;
27180 else if (parser->in_transaction & TM_STMT_ATTR_RELAXED)
27182 error_at (token->location, "%<__transaction_cancel%> within a "
27183 "%<__transaction_relaxed%>");
27184 return error_mark_node;
27188 if ((parser->in_transaction & TM_STMT_ATTR_OUTER) == 0
27189 && !is_tm_may_cancel_outer (current_function_decl))
27191 error_at (token->location, "outer %<__transaction_cancel%> not "
27192 "within outer %<__transaction_atomic%>");
27193 error_at (token->location,
27194 " or a %<transaction_may_cancel_outer%> function");
27195 return error_mark_node;
27198 else if (parser->in_transaction == 0)
27200 error_at (token->location, "%<__transaction_cancel%> not within "
27201 "%<__transaction_atomic%>");
27202 return error_mark_node;
27205 stmt = build_tm_abort_call (token->location, is_outer);
27214 static GTY (()) cp_parser *the_parser;
27217 /* Special handling for the first token or line in the file. The first
27218 thing in the file might be #pragma GCC pch_preprocess, which loads a
27219 PCH file, which is a GC collection point. So we need to handle this
27220 first pragma without benefit of an existing lexer structure.
27222 Always returns one token to the caller in *FIRST_TOKEN. This is
27223 either the true first token of the file, or the first token after
27224 the initial pragma. */
27227 cp_parser_initial_pragma (cp_token *first_token)
27231 cp_lexer_get_preprocessor_token (NULL, first_token);
27232 if (first_token->pragma_kind != PRAGMA_GCC_PCH_PREPROCESS)
27235 cp_lexer_get_preprocessor_token (NULL, first_token);
27236 if (first_token->type == CPP_STRING)
27238 name = first_token->u.value;
27240 cp_lexer_get_preprocessor_token (NULL, first_token);
27241 if (first_token->type != CPP_PRAGMA_EOL)
27242 error_at (first_token->location,
27243 "junk at end of %<#pragma GCC pch_preprocess%>");
27246 error_at (first_token->location, "expected string literal");
27248 /* Skip to the end of the pragma. */
27249 while (first_token->type != CPP_PRAGMA_EOL && first_token->type != CPP_EOF)
27250 cp_lexer_get_preprocessor_token (NULL, first_token);
27252 /* Now actually load the PCH file. */
27254 c_common_pch_pragma (parse_in, TREE_STRING_POINTER (name));
27256 /* Read one more token to return to our caller. We have to do this
27257 after reading the PCH file in, since its pointers have to be
27259 cp_lexer_get_preprocessor_token (NULL, first_token);
27262 /* Normal parsing of a pragma token. Here we can (and must) use the
27266 cp_parser_pragma (cp_parser *parser, enum pragma_context context)
27268 cp_token *pragma_tok;
27271 pragma_tok = cp_lexer_consume_token (parser->lexer);
27272 gcc_assert (pragma_tok->type == CPP_PRAGMA);
27273 parser->lexer->in_pragma = true;
27275 id = pragma_tok->pragma_kind;
27278 case PRAGMA_GCC_PCH_PREPROCESS:
27279 error_at (pragma_tok->location,
27280 "%<#pragma GCC pch_preprocess%> must be first");
27283 case PRAGMA_OMP_BARRIER:
27286 case pragma_compound:
27287 cp_parser_omp_barrier (parser, pragma_tok);
27290 error_at (pragma_tok->location, "%<#pragma omp barrier%> may only be "
27291 "used in compound statements");
27298 case PRAGMA_OMP_FLUSH:
27301 case pragma_compound:
27302 cp_parser_omp_flush (parser, pragma_tok);
27305 error_at (pragma_tok->location, "%<#pragma omp flush%> may only be "
27306 "used in compound statements");
27313 case PRAGMA_OMP_TASKWAIT:
27316 case pragma_compound:
27317 cp_parser_omp_taskwait (parser, pragma_tok);
27320 error_at (pragma_tok->location,
27321 "%<#pragma omp taskwait%> may only be "
27322 "used in compound statements");
27329 case PRAGMA_OMP_TASKYIELD:
27332 case pragma_compound:
27333 cp_parser_omp_taskyield (parser, pragma_tok);
27336 error_at (pragma_tok->location,
27337 "%<#pragma omp taskyield%> may only be "
27338 "used in compound statements");
27345 case PRAGMA_OMP_THREADPRIVATE:
27346 cp_parser_omp_threadprivate (parser, pragma_tok);
27349 case PRAGMA_OMP_ATOMIC:
27350 case PRAGMA_OMP_CRITICAL:
27351 case PRAGMA_OMP_FOR:
27352 case PRAGMA_OMP_MASTER:
27353 case PRAGMA_OMP_ORDERED:
27354 case PRAGMA_OMP_PARALLEL:
27355 case PRAGMA_OMP_SECTIONS:
27356 case PRAGMA_OMP_SINGLE:
27357 case PRAGMA_OMP_TASK:
27358 if (context == pragma_external)
27360 cp_parser_omp_construct (parser, pragma_tok);
27363 case PRAGMA_OMP_SECTION:
27364 error_at (pragma_tok->location,
27365 "%<#pragma omp section%> may only be used in "
27366 "%<#pragma omp sections%> construct");
27370 gcc_assert (id >= PRAGMA_FIRST_EXTERNAL);
27371 c_invoke_pragma_handler (id);
27375 cp_parser_error (parser, "expected declaration specifiers");
27379 cp_parser_skip_to_pragma_eol (parser, pragma_tok);
27383 /* The interface the pragma parsers have to the lexer. */
27386 pragma_lex (tree *value)
27389 enum cpp_ttype ret;
27391 tok = cp_lexer_peek_token (the_parser->lexer);
27394 *value = tok->u.value;
27396 if (ret == CPP_PRAGMA_EOL || ret == CPP_EOF)
27398 else if (ret == CPP_STRING)
27399 *value = cp_parser_string_literal (the_parser, false, false);
27402 cp_lexer_consume_token (the_parser->lexer);
27403 if (ret == CPP_KEYWORD)
27411 /* External interface. */
27413 /* Parse one entire translation unit. */
27416 c_parse_file (void)
27418 static bool already_called = false;
27420 if (already_called)
27422 sorry ("inter-module optimizations not implemented for C++");
27425 already_called = true;
27427 the_parser = cp_parser_new ();
27428 push_deferring_access_checks (flag_access_control
27429 ? dk_no_deferred : dk_no_check);
27430 cp_parser_translation_unit (the_parser);
27434 #include "gt-cp-parser.h"